@argent/x-shared 1.34.5 → 1.35.0

package/dist/webToken.model-Cl4dvcmj.mjs

@@ -0,0 +1,1881 @@
+import { z as t } from "zod";
+import { validateChecksumAddress as qr, validateAndParseAddress as zr, getChecksumAddress as Hr, num as Xe, constants as Wr, CairoCustomEnum as Yr } from "starknet";
+import { memoize as fr, noop as Zr } from "lodash-es";
+import { createContext as Kr, useContext as Jr, useEffect as Qr } from "react";
+import "swr";
+import { jsx as et } from "react/jsx-runtime";
+function rn(s, f) {
+  let [O, L = ""] = s.split(".");
+  const A = O.startsWith("-");
+  return A && (O = O.slice(1)), L.length > f ? Number(L[f]) >= 5 ? L = (BigInt(L.slice(0, f)) + 1n).toString().padStart(f, "0") : L = L.slice(0, f) : L = L.padEnd(f, "0"), {
+    value: BigInt(`${A ? "-" : ""}${O}${L}`),
+    decimals: f
+  };
+}
+const hr = t.string().refine((s) => {
+  if (s.toLowerCase() === s)
+    return !0;
+  try {
+    return qr(s) && at(s);
+  } catch {
+  }
+  return !1;
+}, "Invalid address (checksum error)"), rt = t.string().refine((s) => {
+  try {
+    return zr(s);
+  } catch {
+  }
+  return !1;
+}, "Invalid address (validation error)"), be = t.string().regex(/^0x[0-9a-fA-F]+$/, "Invalid address"), tt = be.min(50, "Addresses must at least be 50 characters long").max(66, "Addresses must at most be 66 characters long"), nt = be.length(66, "Address must be 66 characters long"), Re = tt.pipe(hr).transform((s) => `0x${(s.startsWith("0x") ? s.slice(2) : s).padStart(64, "0")}`), tn = Re.or(t.literal("")).transform((s) => s === "" ? void 0 : s).optional(), er = be.transform((s) => `0x${s.replace(/^0x/, "").toLowerCase().padStart(64, "0")}`), st = (s) => Re.safeParse(s).success, it = st, _e = (s) => Hr(s), nn = (s) => {
+  const f = _e(s), O = f.slice(0, 2), L = f.slice(2, 6), A = f.slice(-4);
+  return `${O}${L}…${A}`;
+}, sn = (s) => {
+  const f = _e(s), O = f.slice(0, 2), A = f.slice(2).match(/.{1,4}/g) || [];
+  return `${O} ${A.join(" ")}`;
+}, at = (s) => !/^0x[0-9a-f]{63,64}$/.test(s), ot = (s, f) => {
+  try {
+    return !s || !f ? !1 : Xe.hexToDecimalString(s) === Xe.hexToDecimalString(f);
+  } catch {
+  }
+  return !1;
+}, ct = (s) => {
+  try {
+    return Xe.toBigInt(be.parse(s)) === Wr.ZERO;
+  } catch {
+  }
+  return !1;
+}, an = (s, f) => !!(f != null && f.some((O) => ot(O, s))), on = fr((s) => {
+  const f = s.slice(0, 6), O = s.slice(-4);
+  return `${f}…${O}`;
+}), cn = fr((s, f) => {
+  if (s.length < f)
+    return s;
+  const O = Math.floor((f - 1) / 2), L = s.slice(0, O), A = s.slice(-O);
+  return `${L}…${A}`;
+}), ln = t.string().regex(/^[a-zA-Z0-9.-]*$/g, "Invalid address character").max(66, "Address cannot be over 66 characters"), lt = nt.pipe(hr).pipe(rt), je = t.string().regex(/^([a-zA-Z0-9-]+\.)+argent.xyz$/, "Invalid Argent name").max(253, "Argent name cannot be over 253 characters"), ut = (s) => je.safeParse(s).success, ft = (s, f) => {
+  try {
+    return f ? Ve(s) === Ve(f) : !1;
+  } catch {
+  }
+  return !1;
+}, Ve = (s) => je.parse(s).toLowerCase(), rr = t.string().regex(/^([a-zA-Z0-9-]+\.)+stark$/, "Invalid Starknet ID").max(50, "Starknet ID cannot be over 50 characters"), ht = (s) => rr.safeParse(s).success, Et = (s, f) => {
+  try {
+    return f ? qe(s) === qe(f) : !1;
+  } catch {
+  }
+  return !1;
+}, qe = (s) => rr.parse(s).toLowerCase(), tr = t.union([
+  je,
+  rr
+]), un = t.union([
+  Re,
+  tr
+]), fn = t.union([
+  lt,
+  tr
+]), hn = (s) => tr.safeParse(s).success, En = (s, f) => {
+  try {
+    return f ? ft(s, f) || Et(s, f) : !1;
+  } catch {
+  }
+  return !1;
+}, pn = (s) => ht(s) ? qe(s) : ut(s) ? Ve(s) : _e(s), pt = t.union([t.literal("0"), t.literal("1")]);
+function dt(s) {
+  var f = [];
+  if (s.length === 0)
+    return "";
+  if (typeof s[0] != "string")
+    throw new TypeError("Url must be a string. Received " + s[0]);
+  if (s[0].match(/^[^/:]+:\/*$/) && s.length > 1) {
+    var O = s.shift();
+    s[0] = O + s[0];
+  }
+  s[0].match(/^file:\/\/\//) ? s[0] = s[0].replace(/^([^/:]+):\/*/, "$1:///") : s[0] = s[0].replace(/^([^/:]+):\/*/, "$1://");
+  for (var L = 0; L < s.length; L++) {
+    var A = s[L];
+    if (typeof A != "string")
+      throw new TypeError("Url must be a string. Received " + A);
+    A !== "" && (L > 0 && (A = A.replace(/^[\/]+/, "")), L < s.length - 1 ? A = A.replace(/[\/]+$/, "") : A = A.replace(/[\/]+$/, "/"), f.push(A));
+  }
+  var M = f.join("/");
+  M = M.replace(/\/(\?|&|#[^!])/g, "$1");
+  var x = M.split("?");
+  return M = x.shift() + (x.length > 0 ? "?" : "") + x.join("&"), M;
+}
+function mt() {
+  var s;
+  return typeof arguments[0] == "object" ? s = arguments[0] : s = [].slice.call(arguments), dt(s);
+}
+class ke extends Error {
+  constructor({ code: f, message: O, options: L = {} }, A) {
+    const { error: M, context: x } = L;
+    super(O, { cause: M }), this.errorMessages = A, this.name = "BaseError", this.context = x, this.code = f, this.setMessageByCode(f, O);
+  }
+  setMessageByCode(f, O) {
+    !f || !this.errorMessages || O || (this.message = this.errorMessages[f]);
+  }
+  toString() {
+    return this.message || "";
+  }
+}
+var ze;
+(function(s) {
+  s.NOT_VALID = "Invalid address", s.NOT_FOUND = "Address not found", s.STARKNAME_NOT_FOUND = "Stark name not found", s.STARKNAME_ERROR = "Could not get address from stark name", s.STARKNAME_INVALID_ADDRESS = "Stark name resolved to an invalid address", s.ARGENT_NAME_NOT_FOUND = "Argent name not found", s.NO_ADDRESS_FROM_ARGENT_NAME = "Could not get address from Argent name", s.ARGENT_NAME_INVALID_ADDRESS = "Argent name resolved to an invalid address", s.NO_ADDRESS_FROM_DOMAIN = "Could not get address from domain", s.ARGENT_NAME_INVALID_NETWORK = "Argent name is not enabled on the requested network";
+})(ze || (ze = {}));
+class ye extends ke {
+  constructor(f) {
+    super(f, ze), this.name = "AddressError";
+  }
+}
+class nr extends Error {
+  constructor(f, O, L) {
+    super(f), this.status = O, this.data = L, Object.setPrototypeOf(this, nr.prototype);
+  }
+}
+var ar;
+(function(s) {
+  s.FAILED_TO_FETCH_URL = "Failed to fetch url", s.FAILED_TO_POST_URL = "Failed to post url";
+})(ar || (ar = {}));
+const dn = t.object({
+  walletAddress: er,
+  ens: je,
+  chain: t.enum(["ethereum", "starknet"]),
+  deleted: t.boolean(),
+  walletDeployed: t.boolean()
+}).or(t.object({
+  status: t.string()
+}));
+async function mn(s, f, O, L = "starknet") {
+  const A = {
+    ens: s,
+    chain: L
+  }, M = new URLSearchParams(A), x = mt(O, "wallet", `?${M}`);
+  try {
+    const k = await f.get(x), D = k && "walletAddress" in k ? k.walletAddress : void 0;
+    if (!D)
+      throw new ye({
+        code: "NO_ADDRESS_FROM_ARGENT_NAME"
+      });
+    if (ct(D))
+      throw new ye({
+        code: "ARGENT_NAME_NOT_FOUND",
+        message: `${s} not found`
+      });
+    if (!it(D))
+      throw new ye({
+        code: "ARGENT_NAME_INVALID_ADDRESS",
+        message: `${s} resolved to an invalid address (${D})`
+      });
+    return _e(D);
+  } catch (k) {
+    throw k instanceof nr && k.status === 404 ? new ye({
+      code: "ARGENT_NAME_NOT_FOUND",
+      message: `${s} not found`
+    }) : k;
+  }
+}
+var He;
+(function(s) {
+  s.NOT_VALID = "Invalid call";
+})(He || (He = {}));
+class gn extends ke {
+  constructor(f) {
+    super(f, He), this.name = "CallError";
+  }
+}
+var We;
+(function(s) {
+  s.NO_NETWORK_OR_MULTICALL = "Missing networkId or multicall", s.NOT_FOUND = "Network not found";
+})(We || (We = {}));
+class In extends ke {
+  constructor(f) {
+    super(f, We), this.name = "NetworkError";
+  }
+}
+const ve = t.union([t.string(), t.number(), t.bigint()]), gt = t.object({
+  low: ve,
+  high: ve
+}), It = t.array(t.string()).and(t.object({
+  __compiled__: t.boolean().optional()
+}).optional()), Rt = t.lazy(() => t.array(t.union([Pe, t.array(Pe), sr]))), Pe = t.union([
+  ve,
+  gt,
+  t.any(),
+  t.boolean()
+]), Nt = t.lazy(() => t.record(t.union([Pe, t.array(Pe), sr]))), sr = t.lazy(() => t.union([Nt, Rt])), At = t.union([sr, It]).optional(), Ot = t.lazy(() => t.object({
+  contractAddress: t.string(),
+  calldata: At,
+  entrypoint: t.string().optional()
+})), Rn = t.lazy(() => Ot.and(t.object({
+  entrypoint: t.string()
+}))), le = t.string().refine((s) => typeof parseInt(s) == "number"), Nn = t.tuple([le]), An = t.tuple([le]), On = t.object({
+  new_threshold: t.string().refine((s) => typeof parseInt(s) == "number"),
+  signers_to_add: t.array(le)
+}), Sn = t.object({
+  new_threshold: t.string().refine((s) => typeof parseInt(s) == "number"),
+  signers_to_remove: t.array(le)
+}), Tn = t.object({
+  signer_to_remove: le,
+  signer_to_add: le
+}), wn = t.tuple([le]), vn = t.tuple([le]), Ln = t.tuple([le]), yn = t.tuple([le]).rest(le), Cn = t.object({
+  recipient: Re,
+  amount: t.object({
+    low: ve,
+    high: ve
+  })
+}), St = t.string().regex(/^(0x)?[0-9a-fA-F]+$/, "Invalid hex string"), Er = St.transform((s) => {
+  const f = s.startsWith("0x") ? s.slice(2) : s;
+  return `0x${f.length % 2 === 0 ? f : `0${f}`}`;
+}), Dn = t.object({
+  cairoVersion: pt,
+  accountClassHash: Er
+}), Tt = t.array(t.string()), Pn = t.object({
+  implementation: t.string(),
+  selector: Er,
+  calldata: Tt
+}), bn = t.object({
+  owner: t.string(),
+  guardian: t.string().optional().transform((s) => s ?? "0")
+});
+var or;
+(function(s) {
+  s.Starknet = "Starknet", s.Secp256k1 = "Secp256k1", s.Secp256r1 = "Secp256r1", s.Eip191 = "Eip191", s.Webauthn = "Webauthn";
+})(or || (or = {}));
+function _n(s, f) {
+  const O = {
+    Starknet: void 0,
+    Secp256k1: void 0,
+    Secp256r1: void 0,
+    Eip191: void 0,
+    Webauthn: void 0
+  };
+  return O[f] = s, new Yr(O);
+}
+var Ye;
+(function(s) {
+  s.NOT_FOUND = "Account not found", s.CALCULATED_ADDRESS_NO_MATCH = "Calculated address does not match account address";
+})(Ye || (Ye = {}));
+class jn extends ke {
+  constructor(f) {
+    super(f, Ye), this.name = "AccountError";
+  }
+}
+function wt(s) {
+  return s && s.__esModule && Object.prototype.hasOwnProperty.call(s, "default") ? s.default : s;
+}
+var Ze = { exports: {} };
+(function(s, f) {
+  f = s.exports = P;
+  var O;
+  typeof process == "object" && process.env && process.env.NODE_DEBUG && /\bsemver\b/i.test(process.env.NODE_DEBUG) ? O = function() {
+    var e = Array.prototype.slice.call(arguments, 0);
+    e.unshift("SEMVER"), console.log.apply(console, e);
+  } : O = function() {
+  }, f.SEMVER_SPEC_VERSION = "2.0.0";
+  var L = 256, A = Number.MAX_SAFE_INTEGER || /* istanbul ignore next */
+  9007199254740991, M = 16, x = L - 6, k = f.re = [], D = f.safeRe = [], I = f.src = [], d = f.tokens = {}, K = 0;
+  function b(e) {
+    d[e] = K++;
+  }
+  var pe = "[a-zA-Z0-9-]", ne = [
+    ["\\s", 1],
+    ["\\d", L],
+    [pe, x]
+  ];
+  function de(e) {
+    for (var a = 0; a < ne.length; a++) {
+      var c = ne[a][0], R = ne[a][1];
+      e = e.split(c + "*").join(c + "{0," + R + "}").split(c + "+").join(c + "{1," + R + "}");
+    }
+    return e;
+  }
+  b("NUMERICIDENTIFIER"), I[d.NUMERICIDENTIFIER] = "0|[1-9]\\d*", b("NUMERICIDENTIFIERLOOSE"), I[d.NUMERICIDENTIFIERLOOSE] = "\\d+", b("NONNUMERICIDENTIFIER"), I[d.NONNUMERICIDENTIFIER] = "\\d*[a-zA-Z-]" + pe + "*", b("MAINVERSION"), I[d.MAINVERSION] = "(" + I[d.NUMERICIDENTIFIER] + ")\\.(" + I[d.NUMERICIDENTIFIER] + ")\\.(" + I[d.NUMERICIDENTIFIER] + ")", b("MAINVERSIONLOOSE"), I[d.MAINVERSIONLOOSE] = "(" + I[d.NUMERICIDENTIFIERLOOSE] + ")\\.(" + I[d.NUMERICIDENTIFIERLOOSE] + ")\\.(" + I[d.NUMERICIDENTIFIERLOOSE] + ")", b("PRERELEASEIDENTIFIER"), I[d.PRERELEASEIDENTIFIER] = "(?:" + I[d.NUMERICIDENTIFIER] + "|" + I[d.NONNUMERICIDENTIFIER] + ")", b("PRERELEASEIDENTIFIERLOOSE"), I[d.PRERELEASEIDENTIFIERLOOSE] = "(?:" + I[d.NUMERICIDENTIFIERLOOSE] + "|" + I[d.NONNUMERICIDENTIFIER] + ")", b("PRERELEASE"), I[d.PRERELEASE] = "(?:-(" + I[d.PRERELEASEIDENTIFIER] + "(?:\\." + I[d.PRERELEASEIDENTIFIER] + ")*))", b("PRERELEASELOOSE"), I[d.PRERELEASELOOSE] = "(?:-?(" + I[d.PRERELEASEIDENTIFIERLOOSE] + "(?:\\." + I[d.PRERELEASEIDENTIFIERLOOSE] + ")*))", b("BUILDIDENTIFIER"), I[d.BUILDIDENTIFIER] = pe + "+", b("BUILD"), I[d.BUILD] = "(?:\\+(" + I[d.BUILDIDENTIFIER] + "(?:\\." + I[d.BUILDIDENTIFIER] + ")*))", b("FULL"), b("FULLPLAIN"), I[d.FULLPLAIN] = "v?" + I[d.MAINVERSION] + I[d.PRERELEASE] + "?" + I[d.BUILD] + "?", I[d.FULL] = "^" + I[d.FULLPLAIN] + "$", b("LOOSEPLAIN"), I[d.LOOSEPLAIN] = "[v=\\s]*" + I[d.MAINVERSIONLOOSE] + I[d.PRERELEASELOOSE] + "?" + I[d.BUILD] + "?", b("LOOSE"), I[d.LOOSE] = "^" + I[d.LOOSEPLAIN] + "$", b("GTLT"), I[d.GTLT] = "((?:<|>)?=?)", b("XRANGEIDENTIFIERLOOSE"), I[d.XRANGEIDENTIFIERLOOSE] = I[d.NUMERICIDENTIFIERLOOSE] + "|x|X|\\*", b("XRANGEIDENTIFIER"), I[d.XRANGEIDENTIFIER] = I[d.NUMERICIDENTIFIER] + "|x|X|\\*", b("XRANGEPLAIN"), I[d.XRANGEPLAIN] = "[v=\\s]*(" + I[d.XRANGEIDENTIFIER] + ")(?:\\.(" + I[d.XRANGEIDENTIFIER] + ")(?:\\.(" + I[d.XRANGEIDENTIFIER] + ")(?:" + I[d.PRERELEASE] + ")?" + I[d.BUILD] + "?)?)?", b("XRANGEPLAINLOOSE"), I[d.XRANGEPLAINLOOSE] = "[v=\\s]*(" + I[d.XRANGEIDENTIFIERLOOSE] + ")(?:\\.(" + I[d.XRANGEIDENTIFIERLOOSE] + ")(?:\\.(" + I[d.XRANGEIDENTIFIERLOOSE] + ")(?:" + I[d.PRERELEASELOOSE] + ")?" + I[d.BUILD] + "?)?)?", b("XRANGE"), I[d.XRANGE] = "^" + I[d.GTLT] + "\\s*" + I[d.XRANGEPLAIN] + "$", b("XRANGELOOSE"), I[d.XRANGELOOSE] = "^" + I[d.GTLT] + "\\s*" + I[d.XRANGEPLAINLOOSE] + "$", b("COERCE"), I[d.COERCE] = "(^|[^\\d])(\\d{1," + M + "})(?:\\.(\\d{1," + M + "}))?(?:\\.(\\d{1," + M + "}))?(?:$|[^\\d])", b("COERCERTL"), k[d.COERCERTL] = new RegExp(I[d.COERCE], "g"), D[d.COERCERTL] = new RegExp(de(I[d.COERCE]), "g"), b("LONETILDE"), I[d.LONETILDE] = "(?:~>?)", b("TILDETRIM"), I[d.TILDETRIM] = "(\\s*)" + I[d.LONETILDE] + "\\s+", k[d.TILDETRIM] = new RegExp(I[d.TILDETRIM], "g"), D[d.TILDETRIM] = new RegExp(de(I[d.TILDETRIM]), "g");
+  var me = "$1~";
+  b("TILDE"), I[d.TILDE] = "^" + I[d.LONETILDE] + I[d.XRANGEPLAIN] + "$", b("TILDELOOSE"), I[d.TILDELOOSE] = "^" + I[d.LONETILDE] + I[d.XRANGEPLAINLOOSE] + "$", b("LONECARET"), I[d.LONECARET] = "(?:\\^)", b("CARETTRIM"), I[d.CARETTRIM] = "(\\s*)" + I[d.LONECARET] + "\\s+", k[d.CARETTRIM] = new RegExp(I[d.CARETTRIM], "g"), D[d.CARETTRIM] = new RegExp(de(I[d.CARETTRIM]), "g");
+  var Te = "$1^";
+  b("CARET"), I[d.CARET] = "^" + I[d.LONECARET] + I[d.XRANGEPLAIN] + "$", b("CARETLOOSE"), I[d.CARETLOOSE] = "^" + I[d.LONECARET] + I[d.XRANGEPLAINLOOSE] + "$", b("COMPARATORLOOSE"), I[d.COMPARATORLOOSE] = "^" + I[d.GTLT] + "\\s*(" + I[d.LOOSEPLAIN] + ")$|^$", b("COMPARATOR"), I[d.COMPARATOR] = "^" + I[d.GTLT] + "\\s*(" + I[d.FULLPLAIN] + ")$|^$", b("COMPARATORTRIM"), I[d.COMPARATORTRIM] = "(\\s*)" + I[d.GTLT] + "\\s*(" + I[d.LOOSEPLAIN] + "|" + I[d.XRANGEPLAIN] + ")", k[d.COMPARATORTRIM] = new RegExp(I[d.COMPARATORTRIM], "g"), D[d.COMPARATORTRIM] = new RegExp(de(I[d.COMPARATORTRIM]), "g");
+  var T = "$1$2$3";
+  b("HYPHENRANGE"), I[d.HYPHENRANGE] = "^\\s*(" + I[d.XRANGEPLAIN] + ")\\s+-\\s+(" + I[d.XRANGEPLAIN] + ")\\s*$", b("HYPHENRANGELOOSE"), I[d.HYPHENRANGELOOSE] = "^\\s*(" + I[d.XRANGEPLAINLOOSE] + ")\\s+-\\s+(" + I[d.XRANGEPLAINLOOSE] + ")\\s*$", b("STAR"), I[d.STAR] = "(<|>)?=?\\s*\\*";
+  for (var re = 0; re < K; re++)
+    O(re, I[re]), k[re] || (k[re] = new RegExp(I[re]), D[re] = new RegExp(de(I[re])));
+  f.parse = ue;
+  function ue(e, a) {
+    if ((!a || typeof a != "object") && (a = {
+      loose: !!a,
+      includePrerelease: !1
+    }), e instanceof P)
+      return e;
+    if (typeof e != "string" || e.length > L)
+      return null;
+    var c = a.loose ? D[d.LOOSE] : D[d.FULL];
+    if (!c.test(e))
+      return null;
+    try {
+      return new P(e, a);
+    } catch {
+      return null;
+    }
+  }
+  f.valid = we;
+  function we(e, a) {
+    var c = ue(e, a);
+    return c ? c.version : null;
+  }
+  f.clean = J;
+  function J(e, a) {
+    var c = ue(e.trim().replace(/^[=v]+/, ""), a);
+    return c ? c.version : null;
+  }
+  f.SemVer = P;
+  function P(e, a) {
+    if ((!a || typeof a != "object") && (a = {
+      loose: !!a,
+      includePrerelease: !1
+    }), e instanceof P) {
+      if (e.loose === a.loose)
+        return e;
+      e = e.version;
+    } else if (typeof e != "string")
+      throw new TypeError("Invalid Version: " + e);
+    if (e.length > L)
+      throw new TypeError("version is longer than " + L + " characters");
+    if (!(this instanceof P))
+      return new P(e, a);
+    O("SemVer", e, a), this.options = a, this.loose = !!a.loose;
+    var c = e.trim().match(a.loose ? D[d.LOOSE] : D[d.FULL]);
+    if (!c)
+      throw new TypeError("Invalid Version: " + e);
+    if (this.raw = e, this.major = +c[1], this.minor = +c[2], this.patch = +c[3], this.major > A || this.major < 0)
+      throw new TypeError("Invalid major version");
+    if (this.minor > A || this.minor < 0)
+      throw new TypeError("Invalid minor version");
+    if (this.patch > A || this.patch < 0)
+      throw new TypeError("Invalid patch version");
+    c[4] ? this.prerelease = c[4].split(".").map(function(R) {
+      if (/^[0-9]+$/.test(R)) {
+        var S = +R;
+        if (S >= 0 && S < A)
+          return S;
+      }
+      return R;
+    }) : this.prerelease = [], this.build = c[5] ? c[5].split(".") : [], this.format();
+  }
+  P.prototype.format = function() {
+    return this.version = this.major + "." + this.minor + "." + this.patch, this.prerelease.length && (this.version += "-" + this.prerelease.join(".")), this.version;
+  }, P.prototype.toString = function() {
+    return this.version;
+  }, P.prototype.compare = function(e) {
+    return O("SemVer.compare", this.version, this.options, e), e instanceof P || (e = new P(e, this.options)), this.compareMain(e) || this.comparePre(e);
+  }, P.prototype.compareMain = function(e) {
+    return e instanceof P || (e = new P(e, this.options)), E(this.major, e.major) || E(this.minor, e.minor) || E(this.patch, e.patch);
+  }, P.prototype.comparePre = function(e) {
+    if (e instanceof P || (e = new P(e, this.options)), this.prerelease.length && !e.prerelease.length)
+      return -1;
+    if (!this.prerelease.length && e.prerelease.length)
+      return 1;
+    if (!this.prerelease.length && !e.prerelease.length)
+      return 0;
+    var a = 0;
+    do {
+      var c = this.prerelease[a], R = e.prerelease[a];
+      if (O("prerelease compare", a, c, R), c === void 0 && R === void 0)
+        return 0;
+      if (R === void 0)
+        return 1;
+      if (c === void 0)
+        return -1;
+      if (c === R)
+        continue;
+      return E(c, R);
+    } while (++a);
+  }, P.prototype.compareBuild = function(e) {
+    e instanceof P || (e = new P(e, this.options));
+    var a = 0;
+    do {
+      var c = this.build[a], R = e.build[a];
+      if (O("prerelease compare", a, c, R), c === void 0 && R === void 0)
+        return 0;
+      if (R === void 0)
+        return 1;
+      if (c === void 0)
+        return -1;
+      if (c === R)
+        continue;
+      return E(c, R);
+    } while (++a);
+  }, P.prototype.inc = function(e, a) {
+    switch (e) {
+      case "premajor":
+        this.prerelease.length = 0, this.patch = 0, this.minor = 0, this.major++, this.inc("pre", a);
+        break;
+      case "preminor":
+        this.prerelease.length = 0, this.patch = 0, this.minor++, this.inc("pre", a);
+        break;
+      case "prepatch":
+        this.prerelease.length = 0, this.inc("patch", a), this.inc("pre", a);
+        break;
+      case "prerelease":
+        this.prerelease.length === 0 && this.inc("patch", a), this.inc("pre", a);
+        break;
+      case "major":
+        (this.minor !== 0 || this.patch !== 0 || this.prerelease.length === 0) && this.major++, this.minor = 0, this.patch = 0, this.prerelease = [];
+        break;
+      case "minor":
+        (this.patch !== 0 || this.prerelease.length === 0) && this.minor++, this.patch = 0, this.prerelease = [];
+        break;
+      case "patch":
+        this.prerelease.length === 0 && this.patch++, this.prerelease = [];
+        break;
+      case "pre":
+        if (this.prerelease.length === 0)
+          this.prerelease = [0];
+        else {
+          for (var c = this.prerelease.length; --c >= 0; )
+            typeof this.prerelease[c] == "number" && (this.prerelease[c]++, c = -2);
+          c === -1 && this.prerelease.push(0);
+        }
+        a && (this.prerelease[0] === a ? isNaN(this.prerelease[1]) && (this.prerelease = [a, 0]) : this.prerelease = [a, 0]);
+        break;
+      default:
+        throw new Error("invalid increment argument: " + e);
+    }
+    return this.format(), this.raw = this.version, this;
+  }, f.inc = r;
+  function r(e, a, c, R) {
+    typeof c == "string" && (R = c, c = void 0);
+    try {
+      return new P(e, c).inc(a, R).version;
+    } catch {
+      return null;
+    }
+  }
+  f.diff = n;
+  function n(e, a) {
+    if (q(e, a))
+      return null;
+    var c = ue(e), R = ue(a), S = "";
+    if (c.prerelease.length || R.prerelease.length) {
+      S = "pre";
+      var w = "prerelease";
+    }
+    for (var v in c)
+      if ((v === "major" || v === "minor" || v === "patch") && c[v] !== R[v])
+        return S + v;
+    return w;
+  }
+  f.compareIdentifiers = E;
+  var i = /^[0-9]+$/;
+  function E(e, a) {
+    var c = i.test(e), R = i.test(a);
+    return c && R && (e = +e, a = +a), e === a ? 0 : c && !R ? -1 : R && !c ? 1 : e < a ? -1 : 1;
+  }
+  f.rcompareIdentifiers = l;
+  function l(e, a) {
+    return E(a, e);
+  }
+  f.major = h;
+  function h(e, a) {
+    return new P(e, a).major;
+  }
+  f.minor = g;
+  function g(e, a) {
+    return new P(e, a).minor;
+  }
+  f.patch = o;
+  function o(e, a) {
+    return new P(e, a).patch;
+  }
+  f.compare = u;
+  function u(e, a, c) {
+    return new P(e, c).compare(new P(a, c));
+  }
+  f.compareLoose = m;
+  function m(e, a) {
+    return u(e, a, !0);
+  }
+  f.compareBuild = p;
+  function p(e, a, c) {
+    var R = new P(e, c), S = new P(a, c);
+    return R.compare(S) || R.compareBuild(S);
+  }
+  f.rcompare = N;
+  function N(e, a, c) {
+    return u(a, e, c);
+  }
+  f.sort = y;
+  function y(e, a) {
+    return e.sort(function(c, R) {
+      return f.compareBuild(c, R, a);
+    });
+  }
+  f.rsort = C;
+  function C(e, a) {
+    return e.sort(function(c, R) {
+      return f.compareBuild(R, c, a);
+    });
+  }
+  f.gt = F;
+  function F(e, a, c) {
+    return u(e, a, c) > 0;
+  }
+  f.lt = V;
+  function V(e, a, c) {
+    return u(e, a, c) < 0;
+  }
+  f.eq = q;
+  function q(e, a, c) {
+    return u(e, a, c) === 0;
+  }
+  f.neq = B;
+  function B(e, a, c) {
+    return u(e, a, c) !== 0;
+  }
+  f.gte = X;
+  function X(e, a, c) {
+    return u(e, a, c) >= 0;
+  }
+  f.lte = H;
+  function H(e, a, c) {
+    return u(e, a, c) <= 0;
+  }
+  f.cmp = ge;
+  function ge(e, a, c, R) {
+    switch (a) {
+      case "===":
+        return typeof e == "object" && (e = e.version), typeof c == "object" && (c = c.version), e === c;
+      case "!==":
+        return typeof e == "object" && (e = e.version), typeof c == "object" && (c = c.version), e !== c;
+      case "":
+      case "=":
+      case "==":
+        return q(e, c, R);
+      case "!=":
+        return B(e, c, R);
+      case ">":
+        return F(e, c, R);
+      case ">=":
+        return X(e, c, R);
+      case "<":
+        return V(e, c, R);
+      case "<=":
+        return H(e, c, R);
+      default:
+        throw new TypeError("Invalid operator: " + a);
+    }
+  }
+  f.Comparator = Z;
+  function Z(e, a) {
+    if ((!a || typeof a != "object") && (a = {
+      loose: !!a,
+      includePrerelease: !1
+    }), e instanceof Z) {
+      if (e.loose === !!a.loose)
+        return e;
+      e = e.value;
+    }
+    if (!(this instanceof Z))
+      return new Z(e, a);
+    e = e.trim().split(/\s+/).join(" "), O("comparator", e, a), this.options = a, this.loose = !!a.loose, this.parse(e), this.semver === fe ? this.value = "" : this.value = this.operator + this.semver.version, O("comp", this);
+  }
+  var fe = {};
+  Z.prototype.parse = function(e) {
+    var a = this.options.loose ? D[d.COMPARATORLOOSE] : D[d.COMPARATOR], c = e.match(a);
+    if (!c)
+      throw new TypeError("Invalid comparator: " + e);
+    this.operator = c[1] !== void 0 ? c[1] : "", this.operator === "=" && (this.operator = ""), c[2] ? this.semver = new P(c[2], this.options.loose) : this.semver = fe;
+  }, Z.prototype.toString = function() {
+    return this.value;
+  }, Z.prototype.test = function(e) {
+    if (O("Comparator.test", e, this.options.loose), this.semver === fe || e === fe)
+      return !0;
+    if (typeof e == "string")
+      try {
+        e = new P(e, this.options);
+      } catch {
+        return !1;
+      }
+    return ge(e, this.operator, this.semver, this.options);
+  }, Z.prototype.intersects = function(e, a) {
+    if (!(e instanceof Z))
+      throw new TypeError("a Comparator is required");
+    (!a || typeof a != "object") && (a = {
+      loose: !!a,
+      includePrerelease: !1
+    });
+    var c;
+    if (this.operator === "")
+      return this.value === "" ? !0 : (c = new G(e.value, a), Le(this.value, c, a));
+    if (e.operator === "")
+      return e.value === "" ? !0 : (c = new G(this.value, a), Le(e.semver, c, a));
+    var R = (this.operator === ">=" || this.operator === ">") && (e.operator === ">=" || e.operator === ">"), S = (this.operator === "<=" || this.operator === "<") && (e.operator === "<=" || e.operator === "<"), w = this.semver.version === e.semver.version, v = (this.operator === ">=" || this.operator === "<=") && (e.operator === ">=" || e.operator === "<="), $ = ge(this.semver, "<", e.semver, a) && (this.operator === ">=" || this.operator === ">") && (e.operator === "<=" || e.operator === "<"), j = ge(this.semver, ">", e.semver, a) && (this.operator === "<=" || this.operator === "<") && (e.operator === ">=" || e.operator === ">");
+    return R || S || w && v || $ || j;
+  }, f.Range = G;
+  function G(e, a) {
+    if ((!a || typeof a != "object") && (a = {
+      loose: !!a,
+      includePrerelease: !1
+    }), e instanceof G)
+      return e.loose === !!a.loose && e.includePrerelease === !!a.includePrerelease ? e : new G(e.raw, a);
+    if (e instanceof Z)
+      return new G(e.value, a);
+    if (!(this instanceof G))
+      return new G(e, a);
+    if (this.options = a, this.loose = !!a.loose, this.includePrerelease = !!a.includePrerelease, this.raw = e.trim().split(/\s+/).join(" "), this.set = this.raw.split("||").map(function(c) {
+      return this.parseRange(c.trim());
+    }, this).filter(function(c) {
+      return c.length;
+    }), !this.set.length)
+      throw new TypeError("Invalid SemVer Range: " + this.raw);
+    this.format();
+  }
+  G.prototype.format = function() {
+    return this.range = this.set.map(function(e) {
+      return e.join(" ").trim();
+    }).join("||").trim(), this.range;
+  }, G.prototype.toString = function() {
+    return this.range;
+  }, G.prototype.parseRange = function(e) {
+    var a = this.options.loose, c = a ? D[d.HYPHENRANGELOOSE] : D[d.HYPHENRANGE];
+    e = e.replace(c, jr), O("hyphen replace", e), e = e.replace(D[d.COMPARATORTRIM], T), O("comparator trim", e, D[d.COMPARATORTRIM]), e = e.replace(D[d.TILDETRIM], me), e = e.replace(D[d.CARETTRIM], Te), e = e.split(/\s+/).join(" ");
+    var R = a ? D[d.COMPARATORLOOSE] : D[d.COMPARATOR], S = e.split(" ").map(function(w) {
+      return Y(w, this.options);
+    }, this).join(" ").split(/\s+/);
+    return this.options.loose && (S = S.filter(function(w) {
+      return !!w.match(R);
+    })), S = S.map(function(w) {
+      return new Z(w, this.options);
+    }, this), S;
+  }, G.prototype.intersects = function(e, a) {
+    if (!(e instanceof G))
+      throw new TypeError("a Range is required");
+    return this.set.some(function(c) {
+      return Ne(c, a) && e.set.some(function(R) {
+        return Ne(R, a) && c.every(function(S) {
+          return R.every(function(w) {
+            return S.intersects(w, a);
+          });
+        });
+      });
+    });
+  };
+  function Ne(e, a) {
+    for (var c = !0, R = e.slice(), S = R.pop(); c && R.length; )
+      c = R.every(function(w) {
+        return S.intersects(w, a);
+      }), S = R.pop();
+    return c;
+  }
+  f.toComparators = Q;
+  function Q(e, a) {
+    return new G(e, a).set.map(function(c) {
+      return c.map(function(R) {
+        return R.value;
+      }).join(" ").trim().split(" ");
+    });
+  }
+  function Y(e, a) {
+    return O("comp", e, a), e = Cr(e, a), O("caret", e), e = Lr(e, a), O("tildes", e), e = Pr(e, a), O("xrange", e), e = _r(e, a), O("stars", e), e;
+  }
+  function U(e) {
+    return !e || e.toLowerCase() === "x" || e === "*";
+  }
+  function Lr(e, a) {
+    return e.trim().split(/\s+/).map(function(c) {
+      return yr(c, a);
+    }).join(" ");
+  }
+  function yr(e, a) {
+    var c = a.loose ? D[d.TILDELOOSE] : D[d.TILDE];
+    return e.replace(c, function(R, S, w, v, $) {
+      O("tilde", e, R, S, w, v, $);
+      var j;
+      return U(S) ? j = "" : U(w) ? j = ">=" + S + ".0.0 <" + (+S + 1) + ".0.0" : U(v) ? j = ">=" + S + "." + w + ".0 <" + S + "." + (+w + 1) + ".0" : $ ? (O("replaceTilde pr", $), j = ">=" + S + "." + w + "." + v + "-" + $ + " <" + S + "." + (+w + 1) + ".0") : j = ">=" + S + "." + w + "." + v + " <" + S + "." + (+w + 1) + ".0", O("tilde return", j), j;
+    });
+  }
+  function Cr(e, a) {
+    return e.trim().split(/\s+/).map(function(c) {
+      return Dr(c, a);
+    }).join(" ");
+  }
+  function Dr(e, a) {
+    O("caret", e, a);
+    var c = a.loose ? D[d.CARETLOOSE] : D[d.CARET];
+    return e.replace(c, function(R, S, w, v, $) {
+      O("caret", e, R, S, w, v, $);
+      var j;
+      return U(S) ? j = "" : U(w) ? j = ">=" + S + ".0.0 <" + (+S + 1) + ".0.0" : U(v) ? S === "0" ? j = ">=" + S + "." + w + ".0 <" + S + "." + (+w + 1) + ".0" : j = ">=" + S + "." + w + ".0 <" + (+S + 1) + ".0.0" : $ ? (O("replaceCaret pr", $), S === "0" ? w === "0" ? j = ">=" + S + "." + w + "." + v + "-" + $ + " <" + S + "." + w + "." + (+v + 1) : j = ">=" + S + "." + w + "." + v + "-" + $ + " <" + S + "." + (+w + 1) + ".0" : j = ">=" + S + "." + w + "." + v + "-" + $ + " <" + (+S + 1) + ".0.0") : (O("no pr"), S === "0" ? w === "0" ? j = ">=" + S + "." + w + "." + v + " <" + S + "." + w + "." + (+v + 1) : j = ">=" + S + "." + w + "." + v + " <" + S + "." + (+w + 1) + ".0" : j = ">=" + S + "." + w + "." + v + " <" + (+S + 1) + ".0.0"), O("caret return", j), j;
+    });
+  }
+  function Pr(e, a) {
+    return O("replaceXRanges", e, a), e.split(/\s+/).map(function(c) {
+      return br(c, a);
+    }).join(" ");
+  }
+  function br(e, a) {
+    e = e.trim();
+    var c = a.loose ? D[d.XRANGELOOSE] : D[d.XRANGE];
+    return e.replace(c, function(R, S, w, v, $, j) {
+      O("xRange", e, R, S, w, v, $, j);
+      var he = U(w), Ee = he || U(v), se = Ee || U($), te = se;
+      return S === "=" && te && (S = ""), j = a.includePrerelease ? "-0" : "", he ? S === ">" || S === "<" ? R = "<0.0.0-0" : R = "*" : S && te ? (Ee && (v = 0), $ = 0, S === ">" ? (S = ">=", Ee ? (w = +w + 1, v = 0, $ = 0) : (v = +v + 1, $ = 0)) : S === "<=" && (S = "<", Ee ? w = +w + 1 : v = +v + 1), R = S + w + "." + v + "." + $ + j) : Ee ? R = ">=" + w + ".0.0" + j + " <" + (+w + 1) + ".0.0" + j : se && (R = ">=" + w + "." + v + ".0" + j + " <" + w + "." + (+v + 1) + ".0" + j), O("xRange return", R), R;
+    });
+  }
+  function _r(e, a) {
+    return O("replaceStars", e, a), e.trim().replace(D[d.STAR], "");
+  }
+  function jr(e, a, c, R, S, w, v, $, j, he, Ee, se, te) {
+    return U(c) ? a = "" : U(R) ? a = ">=" + c + ".0.0" : U(S) ? a = ">=" + c + "." + R + ".0" : a = ">=" + a, U(j) ? $ = "" : U(he) ? $ = "<" + (+j + 1) + ".0.0" : U(Ee) ? $ = "<" + j + "." + (+he + 1) + ".0" : se ? $ = "<=" + j + "." + he + "." + Ee + "-" + se : $ = "<=" + $, (a + " " + $).trim();
+  }
+  G.prototype.test = function(e) {
+    if (!e)
+      return !1;
+    if (typeof e == "string")
+      try {
+        e = new P(e, this.options);
+      } catch {
+        return !1;
+      }
+    for (var a = 0; a < this.set.length; a++)
+      if (kr(this.set[a], e, this.options))
+        return !0;
+    return !1;
+  };
+  function kr(e, a, c) {
+    for (var R = 0; R < e.length; R++)
+      if (!e[R].test(a))
+        return !1;
+    if (a.prerelease.length && !c.includePrerelease) {
+      for (R = 0; R < e.length; R++)
+        if (O(e[R].semver), e[R].semver !== fe && e[R].semver.prerelease.length > 0) {
+          var S = e[R].semver;
+          if (S.major === a.major && S.minor === a.minor && S.patch === a.patch)
+            return !0;
+        }
+      return !1;
+    }
+    return !0;
+  }
+  f.satisfies = Le;
+  function Le(e, a, c) {
+    try {
+      a = new G(a, c);
+    } catch {
+      return !1;
+    }
+    return a.test(e);
+  }
+  f.maxSatisfying = Fr;
+  function Fr(e, a, c) {
+    var R = null, S = null;
+    try {
+      var w = new G(a, c);
+    } catch {
+      return null;
+    }
+    return e.forEach(function(v) {
+      w.test(v) && (!R || S.compare(v) === -1) && (R = v, S = new P(R, c));
+    }), R;
+  }
+  f.minSatisfying = Ur;
+  function Ur(e, a, c) {
+    var R = null, S = null;
+    try {
+      var w = new G(a, c);
+    } catch {
+      return null;
+    }
+    return e.forEach(function(v) {
+      w.test(v) && (!R || S.compare(v) === 1) && (R = v, S = new P(R, c));
+    }), R;
+  }
+  f.minVersion = Br;
+  function Br(e, a) {
+    e = new G(e, a);
+    var c = new P("0.0.0");
+    if (e.test(c) || (c = new P("0.0.0-0"), e.test(c)))
+      return c;
+    c = null;
+    for (var R = 0; R < e.set.length; ++R) {
+      var S = e.set[R];
+      S.forEach(function(w) {
+        var v = new P(w.semver.version);
+        switch (w.operator) {
+          case ">":
+            v.prerelease.length === 0 ? v.patch++ : v.prerelease.push(0), v.raw = v.format();
+          case "":
+          case ">=":
+            (!c || F(c, v)) && (c = v);
+            break;
+          case "<":
+          case "<=":
+            break;
+          default:
+            throw new Error("Unexpected operation: " + w.operator);
+        }
+      });
+    }
+    return c && e.test(c) ? c : null;
+  }
+  f.validRange = xr;
+  function xr(e, a) {
+    try {
+      return new G(e, a).range || "*";
+    } catch {
+      return null;
+    }
+  }
+  f.ltr = Mr;
+  function Mr(e, a, c) {
+    return Ue(e, a, "<", c);
+  }
+  f.gtr = Gr;
+  function Gr(e, a, c) {
+    return Ue(e, a, ">", c);
+  }
+  f.outside = Ue;
+  function Ue(e, a, c, R) {
+    e = new P(e, R), a = new G(a, R);
+    var S, w, v, $, j;
+    switch (c) {
+      case ">":
+        S = F, w = H, v = V, $ = ">", j = ">=";
+        break;
+      case "<":
+        S = V, w = X, v = F, $ = "<", j = "<=";
+        break;
+      default:
+        throw new TypeError('Must provide a hilo val of "<" or ">"');
+    }
+    if (Le(e, a, R))
+      return !1;
+    for (var he = 0; he < a.set.length; ++he) {
+      var Ee = a.set[he], se = null, te = null;
+      if (Ee.forEach(function(Ae) {
+        Ae.semver === fe && (Ae = new Z(">=0.0.0")), se = se || Ae, te = te || Ae, S(Ae.semver, se.semver, R) ? se = Ae : v(Ae.semver, te.semver, R) && (te = Ae);
+      }), se.operator === $ || se.operator === j || (!te.operator || te.operator === $) && w(e, te.semver))
+        return !1;
+      if (te.operator === j && v(e, te.semver))
+        return !1;
+    }
+    return !0;
+  }
+  f.prerelease = $r;
+  function $r(e, a) {
+    var c = ue(e, a);
+    return c && c.prerelease.length ? c.prerelease : null;
+  }
+  f.intersects = Xr;
+  function Xr(e, a, c) {
+    return e = new G(e, c), a = new G(a, c), e.intersects(a);
+  }
+  f.coerce = Vr;
+  function Vr(e, a) {
+    if (e instanceof P)
+      return e;
+    if (typeof e == "number" && (e = String(e)), typeof e != "string")
+      return null;
+    a = a || {};
+    var c = null;
+    if (!a.rtl)
+      c = e.match(D[d.COERCE]);
+    else {
+      for (var R; (R = D[d.COERCERTL].exec(e)) && (!c || c.index + c[0].length !== e.length); )
+        (!c || R.index + R[0].length !== c.index + c[0].length) && (c = R), D[d.COERCERTL].lastIndex = R.index + R[1].length + R[2].length;
+      D[d.COERCERTL].lastIndex = -1;
+    }
+    return c === null ? null : ue(c[2] + "." + (c[3] || "0") + "." + (c[4] || "0"), a);
+  }
+})(Ze, Ze.exports);
+var vt = Ze.exports;
+const kn = /* @__PURE__ */ wt(vt), Fn = (s) => s == null ? [] : Array.isArray(s) ? s : [s], Un = t.any().refine((s) => typeof s == "bigint", {
+  message: "Value must be a BigInt"
+}).transform((s) => BigInt(s));
+var Lt = /^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i, Be = Math.ceil, ae = Math.floor, ee = "[BigNumber Error] ", cr = ee + "Number primitive has more than 15 significant digits: ", ce = 1e14, _ = 14, xe = 9007199254740991, Me = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13], Oe = 1e7, W = 1e9;
+function pr(s) {
+  var f, O, L, A = T.prototype = { constructor: T, toString: null, valueOf: null }, M = new T(1), x = 20, k = 4, D = -7, I = 21, d = -1e7, K = 1e7, b = !1, pe = 1, ne = 0, de = {
+    prefix: "",
+    groupSize: 3,
+    secondaryGroupSize: 0,
+    groupSeparator: ",",
+    decimalSeparator: ".",
+    fractionGroupSize: 0,
+    fractionGroupSeparator: " ",
+    // non-breaking space
+    suffix: ""
+  }, me = "0123456789abcdefghijklmnopqrstuvwxyz", Te = !0;
+  function T(r, n) {
+    var i, E, l, h, g, o, u, m, p = this;
+    if (!(p instanceof T)) return new T(r, n);
+    if (n == null) {
+      if (r && r._isBigNumber === !0) {
+        p.s = r.s, !r.c || r.e > K ? p.c = p.e = null : r.e < d ? p.c = [p.e = 0] : (p.e = r.e, p.c = r.c.slice());
+        return;
+      }
+      if ((o = typeof r == "number") && r * 0 == 0) {
+        if (p.s = 1 / r < 0 ? (r = -r, -1) : 1, r === ~~r) {
+          for (h = 0, g = r; g >= 10; g /= 10, h++) ;
+          h > K ? p.c = p.e = null : (p.e = h, p.c = [r]);
+          return;
+        }
+        m = String(r);
+      } else {
+        if (!Lt.test(m = String(r))) return L(p, m, o);
+        p.s = m.charCodeAt(0) == 45 ? (m = m.slice(1), -1) : 1;
+      }
+      (h = m.indexOf(".")) > -1 && (m = m.replace(".", "")), (g = m.search(/e/i)) > 0 ? (h < 0 && (h = g), h += +m.slice(g + 1), m = m.substring(0, g)) : h < 0 && (h = m.length);
+    } else {
+      if (z(n, 2, me.length, "Base"), n == 10 && Te)
+        return p = new T(r), J(p, x + p.e + 1, k);
+      if (m = String(r), o = typeof r == "number") {
+        if (r * 0 != 0) return L(p, m, o, n);
+        if (p.s = 1 / r < 0 ? (m = m.slice(1), -1) : 1, T.DEBUG && m.replace(/^0\.0*|\./, "").length > 15)
+          throw Error(cr + r);
+      } else
+        p.s = m.charCodeAt(0) === 45 ? (m = m.slice(1), -1) : 1;
+      for (i = me.slice(0, n), h = g = 0, u = m.length; g < u; g++)
+        if (i.indexOf(E = m.charAt(g)) < 0) {
+          if (E == ".") {
+            if (g > h) {
+              h = u;
+              continue;
+            }
+          } else if (!l && (m == m.toUpperCase() && (m = m.toLowerCase()) || m == m.toLowerCase() && (m = m.toUpperCase()))) {
+            l = !0, g = -1, h = 0;
+            continue;
+          }
+          return L(p, String(r), o, n);
+        }
+      o = !1, m = O(m, n, 10, p.s), (h = m.indexOf(".")) > -1 ? m = m.replace(".", "") : h = m.length;
+    }
+    for (g = 0; m.charCodeAt(g) === 48; g++) ;
+    for (u = m.length; m.charCodeAt(--u) === 48; ) ;
+    if (m = m.slice(g, ++u)) {
+      if (u -= g, o && T.DEBUG && u > 15 && (r > xe || r !== ae(r)))
+        throw Error(cr + p.s * r);
+      if ((h = h - g - 1) > K)
+        p.c = p.e = null;
+      else if (h < d)
+        p.c = [p.e = 0];
+      else {
+        if (p.e = h, p.c = [], g = (h + 1) % _, h < 0 && (g += _), g < u) {
+          for (g && p.c.push(+m.slice(0, g)), u -= _; g < u; )
+            p.c.push(+m.slice(g, g += _));
+          g = _ - (m = m.slice(g)).length;
+        } else
+          g -= u;
+        for (; g--; m += "0") ;
+        p.c.push(+m);
+      }
+    } else
+      p.c = [p.e = 0];
+  }
+  T.clone = pr, T.ROUND_UP = 0, T.ROUND_DOWN = 1, T.ROUND_CEIL = 2, T.ROUND_FLOOR = 3, T.ROUND_HALF_UP = 4, T.ROUND_HALF_DOWN = 5, T.ROUND_HALF_EVEN = 6, T.ROUND_HALF_CEIL = 7, T.ROUND_HALF_FLOOR = 8, T.EUCLID = 9, T.config = T.set = function(r) {
+    var n, i;
+    if (r != null)
+      if (typeof r == "object") {
+        if (r.hasOwnProperty(n = "DECIMAL_PLACES") && (i = r[n], z(i, 0, W, n), x = i), r.hasOwnProperty(n = "ROUNDING_MODE") && (i = r[n], z(i, 0, 8, n), k = i), r.hasOwnProperty(n = "EXPONENTIAL_AT") && (i = r[n], i && i.pop ? (z(i[0], -W, 0, n), z(i[1], 0, W, n), D = i[0], I = i[1]) : (z(i, -W, W, n), D = -(I = i < 0 ? -i : i))), r.hasOwnProperty(n = "RANGE"))
+          if (i = r[n], i && i.pop)
+            z(i[0], -W, -1, n), z(i[1], 1, W, n), d = i[0], K = i[1];
+          else if (z(i, -W, W, n), i)
+            d = -(K = i < 0 ? -i : i);
+          else
+            throw Error(ee + n + " cannot be zero: " + i);
+        if (r.hasOwnProperty(n = "CRYPTO"))
+          if (i = r[n], i === !!i)
+            if (i)
+              if (typeof crypto < "u" && crypto && (crypto.getRandomValues || crypto.randomBytes))
+                b = i;
+              else
+                throw b = !i, Error(ee + "crypto unavailable");
+            else
+              b = i;
+          else
+            throw Error(ee + n + " not true or false: " + i);
+        if (r.hasOwnProperty(n = "MODULO_MODE") && (i = r[n], z(i, 0, 9, n), pe = i), r.hasOwnProperty(n = "POW_PRECISION") && (i = r[n], z(i, 0, W, n), ne = i), r.hasOwnProperty(n = "FORMAT"))
+          if (i = r[n], typeof i == "object") de = i;
+          else throw Error(ee + n + " not an object: " + i);
+        if (r.hasOwnProperty(n = "ALPHABET"))
+          if (i = r[n], typeof i == "string" && !/^.?$|[+\-.\s]|(.).*\1/.test(i))
+            Te = i.slice(0, 10) == "0123456789", me = i;
+          else
+            throw Error(ee + n + " invalid: " + i);
+      } else
+        throw Error(ee + "Object expected: " + r);
+    return {
+      DECIMAL_PLACES: x,
+      ROUNDING_MODE: k,
+      EXPONENTIAL_AT: [D, I],
+      RANGE: [d, K],
+      CRYPTO: b,
+      MODULO_MODE: pe,
+      POW_PRECISION: ne,
+      FORMAT: de,
+      ALPHABET: me
+    };
+  }, T.isBigNumber = function(r) {
+    if (!r || r._isBigNumber !== !0) return !1;
+    if (!T.DEBUG) return !0;
+    var n, i, E = r.c, l = r.e, h = r.s;
+    e: if ({}.toString.call(E) == "[object Array]") {
+      if ((h === 1 || h === -1) && l >= -W && l <= W && l === ae(l)) {
+        if (E[0] === 0) {
+          if (l === 0 && E.length === 1) return !0;
+          break e;
+        }
+        if (n = (l + 1) % _, n < 1 && (n += _), String(E[0]).length == n) {
+          for (n = 0; n < E.length; n++)
+            if (i = E[n], i < 0 || i >= ce || i !== ae(i)) break e;
+          if (i !== 0) return !0;
+        }
+      }
+    } else if (E === null && l === null && (h === null || h === 1 || h === -1))
+      return !0;
+    throw Error(ee + "Invalid BigNumber: " + r);
+  }, T.maximum = T.max = function() {
+    return ue(arguments, -1);
+  }, T.minimum = T.min = function() {
+    return ue(arguments, 1);
+  }, T.random = function() {
+    var r = 9007199254740992, n = Math.random() * r & 2097151 ? function() {
+      return ae(Math.random() * r);
+    } : function() {
+      return (Math.random() * 1073741824 | 0) * 8388608 + (Math.random() * 8388608 | 0);
+    };
+    return function(i) {
+      var E, l, h, g, o, u = 0, m = [], p = new T(M);
+      if (i == null ? i = x : z(i, 0, W), g = Be(i / _), b)
+        if (crypto.getRandomValues) {
+          for (E = crypto.getRandomValues(new Uint32Array(g *= 2)); u < g; )
+            o = E[u] * 131072 + (E[u + 1] >>> 11), o >= 9e15 ? (l = crypto.getRandomValues(new Uint32Array(2)), E[u] = l[0], E[u + 1] = l[1]) : (m.push(o % 1e14), u += 2);
+          u = g / 2;
+        } else if (crypto.randomBytes) {
+          for (E = crypto.randomBytes(g *= 7); u < g; )
+            o = (E[u] & 31) * 281474976710656 + E[u + 1] * 1099511627776 + E[u + 2] * 4294967296 + E[u + 3] * 16777216 + (E[u + 4] << 16) + (E[u + 5] << 8) + E[u + 6], o >= 9e15 ? crypto.randomBytes(7).copy(E, u) : (m.push(o % 1e14), u += 7);
+          u = g / 7;
+        } else
+          throw b = !1, Error(ee + "crypto unavailable");
+      if (!b)
+        for (; u < g; )
+          o = n(), o < 9e15 && (m[u++] = o % 1e14);
+      for (g = m[--u], i %= _, g && i && (o = Me[_ - i], m[u] = ae(g / o) * o); m[u] === 0; m.pop(), u--) ;
+      if (u < 0)
+        m = [h = 0];
+      else {
+        for (h = -1; m[0] === 0; m.splice(0, 1), h -= _) ;
+        for (u = 1, o = m[0]; o >= 10; o /= 10, u++) ;
+        u < _ && (h -= _ - u);
+      }
+      return p.e = h, p.c = m, p;
+    };
+  }(), T.sum = function() {
+    for (var r = 1, n = arguments, i = new T(n[0]); r < n.length; ) i = i.plus(n[r++]);
+    return i;
+  }, O = /* @__PURE__ */ function() {
+    var r = "0123456789";
+    function n(i, E, l, h) {
+      for (var g, o = [0], u, m = 0, p = i.length; m < p; ) {
+        for (u = o.length; u--; o[u] *= E) ;
+        for (o[0] += h.indexOf(i.charAt(m++)), g = 0; g < o.length; g++)
+          o[g] > l - 1 && (o[g + 1] == null && (o[g + 1] = 0), o[g + 1] += o[g] / l | 0, o[g] %= l);
+      }
+      return o.reverse();
+    }
+    return function(i, E, l, h, g) {
+      var o, u, m, p, N, y, C, F, V = i.indexOf("."), q = x, B = k;
+      for (V >= 0 && (p = ne, ne = 0, i = i.replace(".", ""), F = new T(E), y = F.pow(i.length - V), ne = p, F.c = n(
+        Ie(ie(y.c), y.e, "0"),
+        10,
+        l,
+        r
+      ), F.e = F.c.length), C = n(i, E, l, g ? (o = me, r) : (o = r, me)), m = p = C.length; C[--p] == 0; C.pop()) ;
+      if (!C[0]) return o.charAt(0);
+      if (V < 0 ? --m : (y.c = C, y.e = m, y.s = h, y = f(y, F, q, B, l), C = y.c, N = y.r, m = y.e), u = m + q + 1, V = C[u], p = l / 2, N = N || u < 0 || C[u + 1] != null, N = B < 4 ? (V != null || N) && (B == 0 || B == (y.s < 0 ? 3 : 2)) : V > p || V == p && (B == 4 || N || B == 6 && C[u - 1] & 1 || B == (y.s < 0 ? 8 : 7)), u < 1 || !C[0])
+        i = N ? Ie(o.charAt(1), -q, o.charAt(0)) : o.charAt(0);
+      else {
+        if (C.length = u, N)
+          for (--l; ++C[--u] > l; )
+            C[u] = 0, u || (++m, C = [1].concat(C));
+        for (p = C.length; !C[--p]; ) ;
+        for (V = 0, i = ""; V <= p; i += o.charAt(C[V++])) ;
+        i = Ie(i, m, o.charAt(0));
+      }
+      return i;
+    };
+  }(), f = /* @__PURE__ */ function() {
+    function r(E, l, h) {
+      var g, o, u, m, p = 0, N = E.length, y = l % Oe, C = l / Oe | 0;
+      for (E = E.slice(); N--; )
+        u = E[N] % Oe, m = E[N] / Oe | 0, g = C * u + m * y, o = y * u + g % Oe * Oe + p, p = (o / h | 0) + (g / Oe | 0) + C * m, E[N] = o % h;
+      return p && (E = [p].concat(E)), E;
+    }
+    function n(E, l, h, g) {
+      var o, u;
+      if (h != g)
+        u = h > g ? 1 : -1;
+      else
+        for (o = u = 0; o < h; o++)
+          if (E[o] != l[o]) {
+            u = E[o] > l[o] ? 1 : -1;
+            break;
+          }
+      return u;
+    }
+    function i(E, l, h, g) {
+      for (var o = 0; h--; )
+        E[h] -= o, o = E[h] < l[h] ? 1 : 0, E[h] = o * g + E[h] - l[h];
+      for (; !E[0] && E.length > 1; E.splice(0, 1)) ;
+    }
+    return function(E, l, h, g, o) {
+      var u, m, p, N, y, C, F, V, q, B, X, H, ge, Z, fe, G, Ne, Q = E.s == l.s ? 1 : -1, Y = E.c, U = l.c;
+      if (!Y || !Y[0] || !U || !U[0])
+        return new T(
+          // Return NaN if either NaN, or both Infinity or 0.
+          !E.s || !l.s || (Y ? U && Y[0] == U[0] : !U) ? NaN : (
+            // Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.
+            Y && Y[0] == 0 || !U ? Q * 0 : Q / 0
+          )
+        );
+      for (V = new T(Q), q = V.c = [], m = E.e - l.e, Q = h + m + 1, o || (o = ce, m = oe(E.e / _) - oe(l.e / _), Q = Q / _ | 0), p = 0; U[p] == (Y[p] || 0); p++) ;
+      if (U[p] > (Y[p] || 0) && m--, Q < 0)
+        q.push(1), N = !0;
+      else {
+        for (Z = Y.length, G = U.length, p = 0, Q += 2, y = ae(o / (U[0] + 1)), y > 1 && (U = r(U, y, o), Y = r(Y, y, o), G = U.length, Z = Y.length), ge = G, B = Y.slice(0, G), X = B.length; X < G; B[X++] = 0) ;
+        Ne = U.slice(), Ne = [0].concat(Ne), fe = U[0], U[1] >= o / 2 && fe++;
+        do {
+          if (y = 0, u = n(U, B, G, X), u < 0) {
+            if (H = B[0], G != X && (H = H * o + (B[1] || 0)), y = ae(H / fe), y > 1)
+              for (y >= o && (y = o - 1), C = r(U, y, o), F = C.length, X = B.length; n(C, B, F, X) == 1; )
+                y--, i(C, G < F ? Ne : U, F, o), F = C.length, u = 1;
+            else
+              y == 0 && (u = y = 1), C = U.slice(), F = C.length;
+            if (F < X && (C = [0].concat(C)), i(B, C, X, o), X = B.length, u == -1)
+              for (; n(U, B, G, X) < 1; )
+                y++, i(B, G < X ? Ne : U, X, o), X = B.length;
+          } else u === 0 && (y++, B = [0]);
+          q[p++] = y, B[0] ? B[X++] = Y[ge] || 0 : (B = [Y[ge]], X = 1);
+        } while ((ge++ < Z || B[0] != null) && Q--);
+        N = B[0] != null, q[0] || q.splice(0, 1);
+      }
+      if (o == ce) {
+        for (p = 1, Q = q[0]; Q >= 10; Q /= 10, p++) ;
+        J(V, h + (V.e = p + m * _ - 1) + 1, g, N);
+      } else
+        V.e = m, V.r = +N;
+      return V;
+    };
+  }();
+  function re(r, n, i, E) {
+    var l, h, g, o, u;
+    if (i == null ? i = k : z(i, 0, 8), !r.c) return r.toString();
+    if (l = r.c[0], g = r.e, n == null)
+      u = ie(r.c), u = E == 1 || E == 2 && (g <= D || g >= I) ? De(u, g) : Ie(u, g, "0");
+    else if (r = J(new T(r), n, i), h = r.e, u = ie(r.c), o = u.length, E == 1 || E == 2 && (n <= h || h <= D)) {
+      for (; o < n; u += "0", o++) ;
+      u = De(u, h);
+    } else if (n -= g, u = Ie(u, h, "0"), h + 1 > o) {
+      if (--n > 0) for (u += "."; n--; u += "0") ;
+    } else if (n += h - o, n > 0)
+      for (h + 1 == o && (u += "."); n--; u += "0") ;
+    return r.s < 0 && l ? "-" + u : u;
+  }
+  function ue(r, n) {
+    for (var i, E, l = 1, h = new T(r[0]); l < r.length; l++)
+      E = new T(r[l]), (!E.s || (i = Se(h, E)) === n || i === 0 && h.s === n) && (h = E);
+    return h;
+  }
+  function we(r, n, i) {
+    for (var E = 1, l = n.length; !n[--l]; n.pop()) ;
+    for (l = n[0]; l >= 10; l /= 10, E++) ;
+    return (i = E + i * _ - 1) > K ? r.c = r.e = null : i < d ? r.c = [r.e = 0] : (r.e = i, r.c = n), r;
+  }
+  L = /* @__PURE__ */ function() {
+    var r = /^(-?)0([xbo])(?=\w[\w.]*$)/i, n = /^([^.]+)\.$/, i = /^\.([^.]+)$/, E = /^-?(Infinity|NaN)$/, l = /^\s*\+(?=[\w.])|^\s+|\s+$/g;
+    return function(h, g, o, u) {
+      var m, p = o ? g : g.replace(l, "");
+      if (E.test(p))
+        h.s = isNaN(p) ? null : p < 0 ? -1 : 1;
+      else {
+        if (!o && (p = p.replace(r, function(N, y, C) {
+          return m = (C = C.toLowerCase()) == "x" ? 16 : C == "b" ? 2 : 8, !u || u == m ? y : N;
+        }), u && (m = u, p = p.replace(n, "$1").replace(i, "0.$1")), g != p))
+          return new T(p, m);
+        if (T.DEBUG)
+          throw Error(ee + "Not a" + (u ? " base " + u : "") + " number: " + g);
+        h.s = null;
+      }
+      h.c = h.e = null;
+    };
+  }();
+  function J(r, n, i, E) {
+    var l, h, g, o, u, m, p, N = r.c, y = Me;
+    if (N) {
+      e: {
+        for (l = 1, o = N[0]; o >= 10; o /= 10, l++) ;
+        if (h = n - l, h < 0)
+          h += _, g = n, u = N[m = 0], p = ae(u / y[l - g - 1] % 10);
+        else if (m = Be((h + 1) / _), m >= N.length)
+          if (E) {
+            for (; N.length <= m; N.push(0)) ;
+            u = p = 0, l = 1, h %= _, g = h - _ + 1;
+          } else
+            break e;
+        else {
+          for (u = o = N[m], l = 1; o >= 10; o /= 10, l++) ;
+          h %= _, g = h - _ + l, p = g < 0 ? 0 : ae(u / y[l - g - 1] % 10);
+        }
+        if (E = E || n < 0 || // Are there any non-zero digits after the rounding digit?
+        // The expression  n % pows10[d - j - 1]  returns all digits of n to the right
+        // of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714.
+        N[m + 1] != null || (g < 0 ? u : u % y[l - g - 1]), E = i < 4 ? (p || E) && (i == 0 || i == (r.s < 0 ? 3 : 2)) : p > 5 || p == 5 && (i == 4 || E || i == 6 && // Check whether the digit to the left of the rounding digit is odd.
+        (h > 0 ? g > 0 ? u / y[l - g] : 0 : N[m - 1]) % 10 & 1 || i == (r.s < 0 ? 8 : 7)), n < 1 || !N[0])
+          return N.length = 0, E ? (n -= r.e + 1, N[0] = y[(_ - n % _) % _], r.e = -n || 0) : N[0] = r.e = 0, r;
+        if (h == 0 ? (N.length = m, o = 1, m--) : (N.length = m + 1, o = y[_ - h], N[m] = g > 0 ? ae(u / y[l - g] % y[g]) * o : 0), E)
+          for (; ; )
+            if (m == 0) {
+              for (h = 1, g = N[0]; g >= 10; g /= 10, h++) ;
+              for (g = N[0] += o, o = 1; g >= 10; g /= 10, o++) ;
+              h != o && (r.e++, N[0] == ce && (N[0] = 1));
+              break;
+            } else {
+              if (N[m] += o, N[m] != ce) break;
+              N[m--] = 0, o = 1;
+            }
+        for (h = N.length; N[--h] === 0; N.pop()) ;
+      }
+      r.e > K ? r.c = r.e = null : r.e < d && (r.c = [r.e = 0]);
+    }
+    return r;
+  }
+  function P(r) {
+    var n, i = r.e;
+    return i === null ? r.toString() : (n = ie(r.c), n = i <= D || i >= I ? De(n, i) : Ie(n, i, "0"), r.s < 0 ? "-" + n : n);
+  }
+  return A.absoluteValue = A.abs = function() {
+    var r = new T(this);
+    return r.s < 0 && (r.s = 1), r;
+  }, A.comparedTo = function(r, n) {
+    return Se(this, new T(r, n));
+  }, A.decimalPlaces = A.dp = function(r, n) {
+    var i, E, l, h = this;
+    if (r != null)
+      return z(r, 0, W), n == null ? n = k : z(n, 0, 8), J(new T(h), r + h.e + 1, n);
+    if (!(i = h.c)) return null;
+    if (E = ((l = i.length - 1) - oe(this.e / _)) * _, l = i[l]) for (; l % 10 == 0; l /= 10, E--) ;
+    return E < 0 && (E = 0), E;
+  }, A.dividedBy = A.div = function(r, n) {
+    return f(this, new T(r, n), x, k);
+  }, A.dividedToIntegerBy = A.idiv = function(r, n) {
+    return f(this, new T(r, n), 0, 1);
+  }, A.exponentiatedBy = A.pow = function(r, n) {
+    var i, E, l, h, g, o, u, m, p, N = this;
+    if (r = new T(r), r.c && !r.isInteger())
+      throw Error(ee + "Exponent not an integer: " + P(r));
+    if (n != null && (n = new T(n)), o = r.e > 14, !N.c || !N.c[0] || N.c[0] == 1 && !N.e && N.c.length == 1 || !r.c || !r.c[0])
+      return p = new T(Math.pow(+P(N), o ? r.s * (2 - Ce(r)) : +P(r))), n ? p.mod(n) : p;
+    if (u = r.s < 0, n) {
+      if (n.c ? !n.c[0] : !n.s) return new T(NaN);
+      E = !u && N.isInteger() && n.isInteger(), E && (N = N.mod(n));
+    } else {
+      if (r.e > 9 && (N.e > 0 || N.e < -1 || (N.e == 0 ? N.c[0] > 1 || o && N.c[1] >= 24e7 : N.c[0] < 8e13 || o && N.c[0] <= 9999975e7)))
+        return h = N.s < 0 && Ce(r) ? -0 : 0, N.e > -1 && (h = 1 / h), new T(u ? 1 / h : h);
+      ne && (h = Be(ne / _ + 2));
+    }
+    for (o ? (i = new T(0.5), u && (r.s = 1), m = Ce(r)) : (l = Math.abs(+P(r)), m = l % 2), p = new T(M); ; ) {
+      if (m) {
+        if (p = p.times(N), !p.c) break;
+        h ? p.c.length > h && (p.c.length = h) : E && (p = p.mod(n));
+      }
+      if (l) {
+        if (l = ae(l / 2), l === 0) break;
+        m = l % 2;
+      } else if (r = r.times(i), J(r, r.e + 1, 1), r.e > 14)
+        m = Ce(r);
+      else {
+        if (l = +P(r), l === 0) break;
+        m = l % 2;
+      }
+      N = N.times(N), h ? N.c && N.c.length > h && (N.c.length = h) : E && (N = N.mod(n));
+    }
+    return E ? p : (u && (p = M.div(p)), n ? p.mod(n) : h ? J(p, ne, k, g) : p);
+  }, A.integerValue = function(r) {
+    var n = new T(this);
+    return r == null ? r = k : z(r, 0, 8), J(n, n.e + 1, r);
+  }, A.isEqualTo = A.eq = function(r, n) {
+    return Se(this, new T(r, n)) === 0;
+  }, A.isFinite = function() {
+    return !!this.c;
+  }, A.isGreaterThan = A.gt = function(r, n) {
+    return Se(this, new T(r, n)) > 0;
+  }, A.isGreaterThanOrEqualTo = A.gte = function(r, n) {
+    return (n = Se(this, new T(r, n))) === 1 || n === 0;
+  }, A.isInteger = function() {
+    return !!this.c && oe(this.e / _) > this.c.length - 2;
+  }, A.isLessThan = A.lt = function(r, n) {
+    return Se(this, new T(r, n)) < 0;
+  }, A.isLessThanOrEqualTo = A.lte = function(r, n) {
+    return (n = Se(this, new T(r, n))) === -1 || n === 0;
+  }, A.isNaN = function() {
+    return !this.s;
+  }, A.isNegative = function() {
+    return this.s < 0;
+  }, A.isPositive = function() {
+    return this.s > 0;
+  }, A.isZero = function() {
+    return !!this.c && this.c[0] == 0;
+  }, A.minus = function(r, n) {
+    var i, E, l, h, g = this, o = g.s;
+    if (r = new T(r, n), n = r.s, !o || !n) return new T(NaN);
+    if (o != n)
+      return r.s = -n, g.plus(r);
+    var u = g.e / _, m = r.e / _, p = g.c, N = r.c;
+    if (!u || !m) {
+      if (!p || !N) return p ? (r.s = -n, r) : new T(N ? g : NaN);
+      if (!p[0] || !N[0])
+        return N[0] ? (r.s = -n, r) : new T(p[0] ? g : (
+          // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity
+          k == 3 ? -0 : 0
+        ));
+    }
+    if (u = oe(u), m = oe(m), p = p.slice(), o = u - m) {
+      for ((h = o < 0) ? (o = -o, l = p) : (m = u, l = N), l.reverse(), n = o; n--; l.push(0)) ;
+      l.reverse();
+    } else
+      for (E = (h = (o = p.length) < (n = N.length)) ? o : n, o = n = 0; n < E; n++)
+        if (p[n] != N[n]) {
+          h = p[n] < N[n];
+          break;
+        }
+    if (h && (l = p, p = N, N = l, r.s = -r.s), n = (E = N.length) - (i = p.length), n > 0) for (; n--; p[i++] = 0) ;
+    for (n = ce - 1; E > o; ) {
+      if (p[--E] < N[E]) {
+        for (i = E; i && !p[--i]; p[i] = n) ;
+        --p[i], p[E] += ce;
+      }
+      p[E] -= N[E];
+    }
+    for (; p[0] == 0; p.splice(0, 1), --m) ;
+    return p[0] ? we(r, p, m) : (r.s = k == 3 ? -1 : 1, r.c = [r.e = 0], r);
+  }, A.modulo = A.mod = function(r, n) {
+    var i, E, l = this;
+    return r = new T(r, n), !l.c || !r.s || r.c && !r.c[0] ? new T(NaN) : !r.c || l.c && !l.c[0] ? new T(l) : (pe == 9 ? (E = r.s, r.s = 1, i = f(l, r, 0, 3), r.s = E, i.s *= E) : i = f(l, r, 0, pe), r = l.minus(i.times(r)), !r.c[0] && pe == 1 && (r.s = l.s), r);
+  }, A.multipliedBy = A.times = function(r, n) {
+    var i, E, l, h, g, o, u, m, p, N, y, C, F, V, q, B = this, X = B.c, H = (r = new T(r, n)).c;
+    if (!X || !H || !X[0] || !H[0])
+      return !B.s || !r.s || X && !X[0] && !H || H && !H[0] && !X ? r.c = r.e = r.s = null : (r.s *= B.s, !X || !H ? r.c = r.e = null : (r.c = [0], r.e = 0)), r;
+    for (E = oe(B.e / _) + oe(r.e / _), r.s *= B.s, u = X.length, N = H.length, u < N && (F = X, X = H, H = F, l = u, u = N, N = l), l = u + N, F = []; l--; F.push(0)) ;
+    for (V = ce, q = Oe, l = N; --l >= 0; ) {
+      for (i = 0, y = H[l] % q, C = H[l] / q | 0, g = u, h = l + g; h > l; )
+        m = X[--g] % q, p = X[g] / q | 0, o = C * m + p * y, m = y * m + o % q * q + F[h] + i, i = (m / V | 0) + (o / q | 0) + C * p, F[h--] = m % V;
+      F[h] = i;
+    }
+    return i ? ++E : F.splice(0, 1), we(r, F, E);
+  }, A.negated = function() {
+    var r = new T(this);
+    return r.s = -r.s || null, r;
+  }, A.plus = function(r, n) {
+    var i, E = this, l = E.s;
+    if (r = new T(r, n), n = r.s, !l || !n) return new T(NaN);
+    if (l != n)
+      return r.s = -n, E.minus(r);
+    var h = E.e / _, g = r.e / _, o = E.c, u = r.c;
+    if (!h || !g) {
+      if (!o || !u) return new T(l / 0);
+      if (!o[0] || !u[0]) return u[0] ? r : new T(o[0] ? E : l * 0);
+    }
+    if (h = oe(h), g = oe(g), o = o.slice(), l = h - g) {
+      for (l > 0 ? (g = h, i = u) : (l = -l, i = o), i.reverse(); l--; i.push(0)) ;
+      i.reverse();
+    }
+    for (l = o.length, n = u.length, l - n < 0 && (i = u, u = o, o = i, n = l), l = 0; n; )
+      l = (o[--n] = o[n] + u[n] + l) / ce | 0, o[n] = ce === o[n] ? 0 : o[n] % ce;
+    return l && (o = [l].concat(o), ++g), we(r, o, g);
+  }, A.precision = A.sd = function(r, n) {
+    var i, E, l, h = this;
+    if (r != null && r !== !!r)
+      return z(r, 1, W), n == null ? n = k : z(n, 0, 8), J(new T(h), r, n);
+    if (!(i = h.c)) return null;
+    if (l = i.length - 1, E = l * _ + 1, l = i[l]) {
+      for (; l % 10 == 0; l /= 10, E--) ;
+      for (l = i[0]; l >= 10; l /= 10, E++) ;
+    }
+    return r && h.e + 1 > E && (E = h.e + 1), E;
+  }, A.shiftedBy = function(r) {
+    return z(r, -xe, xe), this.times("1e" + r);
+  }, A.squareRoot = A.sqrt = function() {
+    var r, n, i, E, l, h = this, g = h.c, o = h.s, u = h.e, m = x + 4, p = new T("0.5");
+    if (o !== 1 || !g || !g[0])
+      return new T(!o || o < 0 && (!g || g[0]) ? NaN : g ? h : 1 / 0);
+    if (o = Math.sqrt(+P(h)), o == 0 || o == 1 / 0 ? (n = ie(g), (n.length + u) % 2 == 0 && (n += "0"), o = Math.sqrt(+n), u = oe((u + 1) / 2) - (u < 0 || u % 2), o == 1 / 0 ? n = "5e" + u : (n = o.toExponential(), n = n.slice(0, n.indexOf("e") + 1) + u), i = new T(n)) : i = new T(o + ""), i.c[0]) {
+      for (u = i.e, o = u + m, o < 3 && (o = 0); ; )
+        if (l = i, i = p.times(l.plus(f(h, l, m, 1))), ie(l.c).slice(0, o) === (n = ie(i.c)).slice(0, o))
+          if (i.e < u && --o, n = n.slice(o - 3, o + 1), n == "9999" || !E && n == "4999") {
+            if (!E && (J(l, l.e + x + 2, 0), l.times(l).eq(h))) {
+              i = l;
+              break;
+            }
+            m += 4, o += 4, E = 1;
+          } else {
+            (!+n || !+n.slice(1) && n.charAt(0) == "5") && (J(i, i.e + x + 2, 1), r = !i.times(i).eq(h));
+            break;
+          }
+    }
+    return J(i, i.e + x + 1, k, r);
+  }, A.toExponential = function(r, n) {
+    return r != null && (z(r, 0, W), r++), re(this, r, n, 1);
+  }, A.toFixed = function(r, n) {
+    return r != null && (z(r, 0, W), r = r + this.e + 1), re(this, r, n);
+  }, A.toFormat = function(r, n, i) {
+    var E, l = this;
+    if (i == null)
+      r != null && n && typeof n == "object" ? (i = n, n = null) : r && typeof r == "object" ? (i = r, r = n = null) : i = de;
+    else if (typeof i != "object")
+      throw Error(ee + "Argument not an object: " + i);
+    if (E = l.toFixed(r, n), l.c) {
+      var h, g = E.split("."), o = +i.groupSize, u = +i.secondaryGroupSize, m = i.groupSeparator || "", p = g[0], N = g[1], y = l.s < 0, C = y ? p.slice(1) : p, F = C.length;
+      if (u && (h = o, o = u, u = h, F -= h), o > 0 && F > 0) {
+        for (h = F % o || o, p = C.substr(0, h); h < F; h += o) p += m + C.substr(h, o);
+        u > 0 && (p += m + C.slice(h)), y && (p = "-" + p);
+      }
+      E = N ? p + (i.decimalSeparator || "") + ((u = +i.fractionGroupSize) ? N.replace(
+        new RegExp("\\d{" + u + "}\\B", "g"),
+        "$&" + (i.fractionGroupSeparator || "")
+      ) : N) : p;
+    }
+    return (i.prefix || "") + E + (i.suffix || "");
+  }, A.toFraction = function(r) {
+    var n, i, E, l, h, g, o, u, m, p, N, y, C = this, F = C.c;
+    if (r != null && (o = new T(r), !o.isInteger() && (o.c || o.s !== 1) || o.lt(M)))
+      throw Error(ee + "Argument " + (o.isInteger() ? "out of range: " : "not an integer: ") + P(o));
+    if (!F) return new T(C);
+    for (n = new T(M), m = i = new T(M), E = u = new T(M), y = ie(F), h = n.e = y.length - C.e - 1, n.c[0] = Me[(g = h % _) < 0 ? _ + g : g], r = !r || o.comparedTo(n) > 0 ? h > 0 ? n : m : o, g = K, K = 1 / 0, o = new T(y), u.c[0] = 0; p = f(o, n, 0, 1), l = i.plus(p.times(E)), l.comparedTo(r) != 1; )
+      i = E, E = l, m = u.plus(p.times(l = m)), u = l, n = o.minus(p.times(l = n)), o = l;
+    return l = f(r.minus(i), E, 0, 1), u = u.plus(l.times(m)), i = i.plus(l.times(E)), u.s = m.s = C.s, h = h * 2, N = f(m, E, h, k).minus(C).abs().comparedTo(
+      f(u, i, h, k).minus(C).abs()
+    ) < 1 ? [m, E] : [u, i], K = g, N;
+  }, A.toNumber = function() {
+    return +P(this);
+  }, A.toPrecision = function(r, n) {
+    return r != null && z(r, 1, W), re(this, r, n, 2);
+  }, A.toString = function(r) {
+    var n, i = this, E = i.s, l = i.e;
+    return l === null ? E ? (n = "Infinity", E < 0 && (n = "-" + n)) : n = "NaN" : (r == null ? n = l <= D || l >= I ? De(ie(i.c), l) : Ie(ie(i.c), l, "0") : r === 10 && Te ? (i = J(new T(i), x + l + 1, k), n = Ie(ie(i.c), i.e, "0")) : (z(r, 2, me.length, "Base"), n = O(Ie(ie(i.c), l, "0"), 10, r, E, !0)), E < 0 && i.c[0] && (n = "-" + n)), n;
+  }, A.valueOf = A.toJSON = function() {
+    return P(this);
+  }, A._isBigNumber = !0, A[Symbol.toStringTag] = "BigNumber", A[Symbol.for("nodejs.util.inspect.custom")] = A.valueOf, s != null && T.set(s), T;
+}
+function oe(s) {
+  var f = s | 0;
+  return s > 0 || s === f ? f : f - 1;
+}
+function ie(s) {
+  for (var f, O, L = 1, A = s.length, M = s[0] + ""; L < A; ) {
+    for (f = s[L++] + "", O = _ - f.length; O--; f = "0" + f) ;
+    M += f;
+  }
+  for (A = M.length; M.charCodeAt(--A) === 48; ) ;
+  return M.slice(0, A + 1 || 1);
+}
+function Se(s, f) {
+  var O, L, A = s.c, M = f.c, x = s.s, k = f.s, D = s.e, I = f.e;
+  if (!x || !k) return null;
+  if (O = A && !A[0], L = M && !M[0], O || L) return O ? L ? 0 : -k : x;
+  if (x != k) return x;
+  if (O = x < 0, L = D == I, !A || !M) return L ? 0 : !A ^ O ? 1 : -1;
+  if (!L) return D > I ^ O ? 1 : -1;
+  for (k = (D = A.length) < (I = M.length) ? D : I, x = 0; x < k; x++) if (A[x] != M[x]) return A[x] > M[x] ^ O ? 1 : -1;
+  return D == I ? 0 : D > I ^ O ? 1 : -1;
+}
+function z(s, f, O, L) {
+  if (s < f || s > O || s !== ae(s))
+    throw Error(ee + (L || "Argument") + (typeof s == "number" ? s < f || s > O ? " out of range: " : " not an integer: " : " not a primitive number: ") + String(s));
+}
+function Ce(s) {
+  var f = s.c.length - 1;
+  return oe(s.e / _) == f && s.c[f] % 2 != 0;
+}
+function De(s, f) {
+  return (s.length > 1 ? s.charAt(0) + "." + s.slice(1) : s) + (f < 0 ? "e" : "e+") + f;
+}
+function Ie(s, f, O) {
+  var L, A;
+  if (f < 0) {
+    for (A = O + "."; ++f; A += O) ;
+    s = A + s;
+  } else if (L = s.length, ++f > L) {
+    for (A = O, f -= L; --f; A += O) ;
+    s += A;
+  } else f < L && (s = s.slice(0, f) + "." + s.slice(f));
+  return s;
+}
+var Bn = pr();
+const xn = t.boolean().transform((s) => String(s)), Mn = t.string().transform((s) => s === "true");
+var Ke;
+(function(s) {
+  s[s.function = 0] = "function", s[s.l1_handler = 1] = "l1_handler", s[s.constructor = 2] = "constructor";
+})(Ke || (Ke = {}));
+const dr = t.array(t.string()), Ge = t.object({
+  selector: t.string(),
+  offset: t.string(),
+  builtins: dr.optional()
+}), mr = t.object({
+  CONSTRUCTOR: t.array(Ge),
+  EXTERNAL: t.array(Ge),
+  L1_HANDLER: t.array(Ge)
+}), Gn = t.string(), yt = t.object({
+  builtins: dr,
+  data: t.array(t.string())
+}), Je = t.object({
+  name: t.string(),
+  type: t.union([t.literal("felt"), t.literal("felt*"), t.string()])
+}), Ct = t.nativeEnum(Ke), Dt = t.object({
+  inputs: t.array(Je),
+  name: t.string(),
+  outputs: t.array(Je),
+  stateMutability: t.literal("view").optional(),
+  state_mutability: t.string().optional(),
+  type: Ct
+}), Qe = t.object({
+  name: t.string(),
+  type: t.union([t.literal("felt"), t.literal("felt*"), t.string()]),
+  kind: t.union([t.literal("key"), t.literal("data")])
+}), Pt = t.object({
+  name: t.string(),
+  type: t.literal("event"),
+  data: t.array(Qe),
+  keys: t.array(Qe)
+}), bt = t.object({
+  name: t.string(),
+  members: t.array(Qe),
+  kind: t.literal("struct"),
+  type: t.literal("event")
+}), _t = t.object({
+  members: t.array(Je.and(t.object({
+    offset: t.number()
+  }))),
+  name: t.string(),
+  size: t.number(),
+  type: t.literal("struct")
+}), jt = t.union([bt, Pt]), gr = t.array(t.union([Dt, jt, _t, t.any()])), kt = t.object({
+  program: yt,
+  entry_points_by_type: mr,
+  abi: gr
+}), Ir = t.array(t.string()), Ft = t.object({
+  type_names: t.array(t.tuple([t.number(), t.string()])),
+  libfunc_names: t.array(t.tuple([t.number(), t.string()])),
+  user_func_names: t.array(t.tuple([t.number(), t.string()]))
+}), $e = t.object({
+  selector: t.string(),
+  function_idx: t.number()
+}), Ut = t.object({
+  CONSTRUCTOR: t.array($e),
+  EXTERNAL: t.array($e),
+  L1_HANDLER: t.array($e)
+}), Bt = t.object({
+  sierra_program: Ir,
+  sierra_program_debug_info: Ft.optional(),
+  contract_class_version: t.string(),
+  entry_points_by_type: Ut,
+  abi: gr
+}), xt = t.array(t.tuple([t.number(), t.array(t.string())])), Mt = t.object({
+  prime: t.string(),
+  compiler_version: t.string(),
+  bytecode: Ir,
+  hints: t.array(t.any()),
+  pythonic_hints: xt,
+  entry_points_by_type: mr
+}), $n = Mt, Xn = t.union([
+  kt,
+  Bt
+]), Rr = Kr(null), Nr = () => Jr(Rr), Vn = () => {
+  var s;
+  return !!((s = Nr()) != null && s.emitter);
+}, qn = ({ emitter: s, children: f }) => /* @__PURE__ */ et(Rr.Provider, { value: {
+  emitter: s
+}, children: f });
+let lr = !1;
+const Ar = () => {
+  var O;
+  const s = (O = Nr()) == null ? void 0 : O.emitter;
+  if (!s && !lr) {
+    lr = !0;
+    return;
+  }
+  return s;
+}, zn = () => {
+  const s = Ar();
+  return s ? s.emit.bind(s) : Zr;
+}, Hn = () => {
+  const s = Ar();
+  return (O, L) => {
+    Qr(() => s ? s.on(O, L) : void 0, [O, L]);
+  };
+}, Gt = t.union([
+  t.literal("concentratedLiquidityPosition"),
+  t.literal("collateralizedDebtPosition")
+]), Wn = t.object({
+  status: t.literal("initialising")
+}).or(t.object({
+  status: t.literal("initialised"),
+  balances: t.array(t.object({
+    tokenAddress: er,
+    tokenBalance: t.string()
+  }))
+})), ir = t.object({
+  id: t.number(),
+  address: Re,
+  brandColor: t.string().optional(),
+  name: t.string(),
+  symbol: t.string(),
+  decimals: t.number(),
+  iconUrl: t.string().optional(),
+  sendable: t.boolean(),
+  popular: t.boolean(),
+  refundable: t.boolean(),
+  listed: t.boolean(),
+  tradable: t.boolean(),
+  category: t.union([
+    t.literal("tokens"),
+    t.literal("currencies"),
+    t.literal("savings")
+  ]),
+  pricingId: t.number().optional(),
+  dappId: t.string().optional(),
+  marketData: t.object({
+    marketCap: t.number(),
+    marketCap24hChange: t.number(),
+    dailyVolume: t.number(),
+    rank: t.number()
+  }).optional(),
+  tags: t.array(t.string()).optional()
+}), Yn = t.object({
+  tokens: t.array(ir)
+}), Zn = ir, Or = t.object({
+  pricingId: t.number(),
+  ethValue: t.string(),
+  ccyValue: t.string(),
+  ethDayChange: t.string(),
+  ccyDayChange: t.string()
+}), Kn = t.object({
+  prices: t.array(Or)
+}), ur = t.object({
+  tokenAddress: er,
+  principal: t.string(),
+  accruedFees: t.string(),
+  minPrice: t.string(),
+  maxPrice: t.string(),
+  currentPrice: t.string()
+}), Sr = t.object({
+  tokenAddress: Re.optional(),
+  totalBalances: t.record(t.string())
+}), Tr = Sr.extend({
+  tokenId: t.string(),
+  data: t.object({
+    poolFeePercentage: t.string(),
+    tickSpacingPercentage: t.string().optional(),
+    token0: ur,
+    token1: ur
+  })
+}), Jn = t.array(Tr), wr = Sr.extend({
+  data: t.object({
+    apy: t.string().optional(),
+    group: t.number().optional(),
+    collateral: t.boolean(),
+    debt: t.boolean(),
+    lending: t.boolean()
+  })
+}), Qn = t.array(wr), $t = t.array(Tr.or(wr)), Xt = t.object({
+  name: t.string(),
+  manageUrl: t.string(),
+  type: Gt,
+  groups: t.record(t.object({
+    name: t.string().optional(),
+    healthRatio: t.string().optional()
+  })).optional(),
+  positions: $t
+}), Vt = t.object({
+  dappId: t.string(),
+  products: t.array(Xt)
+}), es = t.object({
+  dapps: t.array(Vt)
+}), qt = t.object({
+  name: t.string().optional(),
+  tokenAddress: Re,
+  amount: t.string().optional(),
+  claimUrl: t.string().optional(),
+  claimStart: t.number(),
+  claimEnd: t.number().optional()
+}), rs = t.object({
+  accountAddress: Re,
+  chain: t.string(),
+  airdrops: t.array(qt)
+}), Fe = t.object({
+  address: Re,
+  networkId: t.string({ required_error: "Network is required" })
+}, { required_error: "Token is required" }), ts = Fe.required().extend({
+  balance: t.string()
+}), vr = Fe.required().extend({
+  id: t.number().optional(),
+  name: t.string().optional(),
+  symbol: t.string().optional(),
+  decimals: t.coerce.number().optional(),
+  iconUrl: t.string().url("").optional().or(t.literal("")),
+  // fallback since some iconUrls are empty, causing validation to fail
+  pricingId: t.number().optional(),
+  category: t.string().optional(),
+  dappId: t.string().optional(),
+  brandColor: t.string().optional()
+}), zt = vr.extend({
+  balance: t.string()
+}), Ht = vr.extend({
+  currencyValue: t.string(),
+  currencySymbol: t.string().optional(),
+  ccyDayChange: t.string().optional(),
+  ethDayChange: t.string().optional(),
+  unitCurrencyValue: t.string().optional()
+}), Wt = Ht.extend({
+  ...zt.shape
+}), ns = t.array(Wt), ss = Fe.extend({
+  ...Or.shape
+}), is = Fe.extend({
+  ...ir.shape
+});
+export {
+  lt as $,
+  ye as A,
+  Bn as B,
+  gn as C,
+  es as D,
+  Cn as E,
+  Fn as F,
+  hr as G,
+  nr as H,
+  rt as I,
+  be as J,
+  tt as K,
+  nt as L,
+  or as M,
+  In as N,
+  tn as O,
+  nn as P,
+  sn as Q,
+  an as R,
+  on as S,
+  cn as T,
+  tr as U,
+  un as V,
+  fn as W,
+  hn as X,
+  En as Y,
+  pn as Z,
+  ln as _,
+  ar as a,
+  Pt as a$,
+  je as a0,
+  ft as a1,
+  Ve as a2,
+  pt as a3,
+  dn as a4,
+  Et as a5,
+  qe as a6,
+  ke as a7,
+  ir as a8,
+  Or as a9,
+  gt as aA,
+  It as aB,
+  Rt as aC,
+  Pe as aD,
+  Nt as aE,
+  sr as aF,
+  At as aG,
+  Ot as aH,
+  le as aI,
+  Nn as aJ,
+  An as aK,
+  On as aL,
+  Sn as aM,
+  Tn as aN,
+  wn as aO,
+  vn as aP,
+  Ln as aQ,
+  yn as aR,
+  dr as aS,
+  Ge as aT,
+  mr as aU,
+  Gn as aV,
+  yt as aW,
+  Je as aX,
+  Ct as aY,
+  Dt as aZ,
+  Qe as a_,
+  Kn as aa,
+  ur as ab,
+  Tr as ac,
+  Jn as ad,
+  wr as ae,
+  Qn as af,
+  $t as ag,
+  Xt as ah,
+  Vt as ai,
+  qt as aj,
+  rs as ak,
+  Gt as al,
+  Fe as am,
+  ts as an,
+  vr as ao,
+  zt as ap,
+  Ht as aq,
+  Wt as ar,
+  ns as as,
+  ss as at,
+  is as au,
+  Un as av,
+  St as aw,
+  xn as ax,
+  Mn as ay,
+  ve as az,
+  it as b,
+  bt as b0,
+  _t as b1,
+  jt as b2,
+  gr as b3,
+  kt as b4,
+  Ir as b5,
+  Ft as b6,
+  $e as b7,
+  Ut as b8,
+  Bt as b9,
+  xt as ba,
+  Mt as bb,
+  $n as bc,
+  Xn as bd,
+  Nr as be,
+  Vn as bf,
+  qn as bg,
+  Ar as bh,
+  zn as bi,
+  Hn as bj,
+  Rn as c,
+  st as d,
+  ht as e,
+  ut as f,
+  mn as g,
+  ot as h,
+  ct as i,
+  Dn as j,
+  jn as k,
+  _n as l,
+  Pn as m,
+  _e as n,
+  bn as o,
+  rn as p,
+  er as q,
+  rr as r,
+  kn as s,
+  Re as t,
+  mt as u,
+  Er as v,
+  wt as w,
+  Yn as x,
+  Zn as y,
+  Wn as z
+};