@argent/x-shared 1.34.4 → 1.34.6

package/dist/{transactionVersion-tQTwHiJA.mjs → transactionVersion-cwkr7wat.mjs}

@@ -1,5 +1,5 @@
 import { z as e } from "zod";
-import { validateChecksumAddress as Cr, validateAndParseAddress as Dr, getChecksumAddress as Pr, num as be, constants as xe, CairoCustomEnum as jr, uint256 as Qe, hash as Nt } from "starknet";
+import { validateChecksumAddress as Cr, validateAndParseAddress as Dr, getChecksumAddress as Pr, num as Ne, constants as xe, CairoCustomEnum as jr, uint256 as Qe, hash as St } from "starknet";
 import { memoize as Pt, noop as kr, isString as Ur, isEmpty as Fr } from "lodash-es";
 import "@scure/base";
 import { jsx as xr } from "react/jsx-runtime";
@@ -8,9 +8,9 @@ import "object-hash";
 import "swr";
 function Vr(t, o) {
   let [E, T = ""] = t.split(".");
-  const N = E.startsWith("-");
-  return N && (E = E.slice(1)), T.length > o ? Number(T[o]) >= 5 ? T = (BigInt(T.slice(0, o)) + 1n).toString().padStart(o, "0") : T = T.slice(0, o) : T = T.padEnd(o, "0"), {
-    value: BigInt(`${N ? "-" : ""}${E}${T}`),
+  const S = E.startsWith("-");
+  return S && (E = E.slice(1)), T.length > o ? Number(T[o]) >= 5 ? T = (BigInt(T.slice(0, o)) + 1n).toString().padStart(o, "0") : T = T.slice(0, o) : T = T.padEnd(o, "0"), {
+    value: BigInt(`${S ? "-" : ""}${E}${T}`),
     decimals: o
   };
 }
@@ -28,33 +28,33 @@ const jt = e.string().refine((t) => {
   } catch {
   }
   return !1;
-}, "Invalid address (validation error)"), Ve = e.string().regex(/^0x[0-9a-fA-F]+$/, "Invalid address"), Xr = Ve.min(50, "Addresses must at least be 50 characters long").max(66, "Addresses must at most be 66 characters long"), Hr = Ve.length(66, "Address must be 66 characters long"), K = Xr.pipe(jt).transform((t) => `0x${(t.startsWith("0x") ? t.slice(2) : t).padStart(64, "0")}`), Ua = K.or(e.literal("")).transform((t) => t === "" ? void 0 : t).optional(), H = Ve.transform((t) => `0x${t.replace(/^0x/, "").toLowerCase().padStart(64, "0")}`), zr = (t) => K.safeParse(t).success, qr = zr, $e = (t) => Pr(t), Fa = (t) => {
-  const o = $e(t), E = o.slice(0, 2), T = o.slice(2, 6), N = o.slice(-4);
-  return `${E}${T}…${N}`;
-}, xa = (t) => {
-  const o = $e(t), E = o.slice(0, 2), N = o.slice(2).match(/.{1,4}/g) || [];
-  return `${E} ${N.join(" ")}`;
+}, "Invalid address (validation error)"), Ve = e.string().regex(/^0x[0-9a-fA-F]+$/, "Invalid address"), Xr = Ve.min(50, "Addresses must at least be 50 characters long").max(66, "Addresses must at most be 66 characters long"), Hr = Ve.length(66, "Address must be 66 characters long"), K = Xr.pipe(jt).transform((t) => `0x${(t.startsWith("0x") ? t.slice(2) : t).padStart(64, "0")}`), Fa = K.or(e.literal("")).transform((t) => t === "" ? void 0 : t).optional(), H = Ve.transform((t) => `0x${t.replace(/^0x/, "").toLowerCase().padStart(64, "0")}`), qr = (t) => K.safeParse(t).success, zr = qr, $e = (t) => Pr(t), xa = (t) => {
+  const o = $e(t), E = o.slice(0, 2), T = o.slice(2, 6), S = o.slice(-4);
+  return `${E}${T}…${S}`;
+}, Ba = (t) => {
+  const o = $e(t), E = o.slice(0, 2), S = o.slice(2).match(/.{1,4}/g) || [];
+  return `${E} ${S.join(" ")}`;
 }, Wr = (t) => !/^0x[0-9a-f]{63,64}$/.test(t), Kr = (t, o) => {
   try {
-    return !t || !o ? !1 : be.hexToDecimalString(t) === be.hexToDecimalString(o);
+    return !t || !o ? !1 : Ne.hexToDecimalString(t) === Ne.hexToDecimalString(o);
   } catch {
   }
   return !1;
 }, Yr = (t) => {
   try {
-    return be.toBigInt(Ve.parse(t)) === xe.ZERO;
+    return Ne.toBigInt(Ve.parse(t)) === xe.ZERO;
   } catch {
   }
   return !1;
-}, Ba = (t, o) => !!(o != null && o.some((E) => Kr(E, t))), Ma = Pt((t) => {
+}, Ma = (t, o) => !!(o != null && o.some((E) => Kr(E, t))), Ga = Pt((t) => {
   const o = t.slice(0, 6), E = t.slice(-4);
   return `${o}…${E}`;
-}), Ga = Pt((t, o) => {
+}), Va = Pt((t, o) => {
   if (t.length < o)
     return t;
-  const E = Math.floor((o - 1) / 2), T = t.slice(0, E), N = t.slice(-E);
-  return `${T}…${N}`;
-}), Va = e.string().regex(/^[a-zA-Z0-9.-]*$/g, "Invalid address character").max(66, "Address cannot be over 66 characters"), Zr = Hr.pipe(jt).pipe($r), Xe = e.string().regex(/^([a-zA-Z0-9-]+\.)+argent.xyz$/, "Invalid Argent name").max(253, "Argent name cannot be over 253 characters"), Jr = (t) => Xe.safeParse(t).success, Qr = (t, o) => {
+  const E = Math.floor((o - 1) / 2), T = t.slice(0, E), S = t.slice(-E);
+  return `${T}…${S}`;
+}), $a = e.string().regex(/^[a-zA-Z0-9.-]*$/g, "Invalid address character").max(66, "Address cannot be over 66 characters"), Zr = Hr.pipe(jt).pipe($r), Xe = e.string().regex(/^([a-zA-Z0-9-]+\.)+argent.xyz$/, "Invalid Argent name").max(253, "Argent name cannot be over 253 characters"), Jr = (t) => Xe.safeParse(t).success, Qr = (t, o) => {
   try {
     return o ? et(t) === et(o) : !1;
   } catch {
@@ -69,19 +69,19 @@ const jt = e.string().refine((t) => {
 }, tt = (t) => ht.parse(t).toLowerCase(), mt = e.union([
   Xe,
   ht
-]), $a = e.union([
+]), Xa = e.union([
   K,
   mt
-]), Xa = e.union([
+]), Ha = e.union([
   Zr,
   mt
-]), Ha = (t) => mt.safeParse(t).success, za = (t, o) => {
+]), qa = (t) => mt.safeParse(t).success, za = (t, o) => {
   try {
     return o ? Qr(t, o) || tn(t, o) : !1;
   } catch {
   }
   return !1;
-}, qa = (t) => en(t) ? tt(t) : Jr(t) ? et(t) : $e(t), rn = e.union([e.literal("0"), e.literal("1")]), Wa = "0x049d36570d4e46f48e99674bd3fcc84644ddd6b96f7c741b1562b82f9e004dc7", Ka = "0x04718f5a0fc34cc1af16a1cdee98ffb20c31f5cd61d6ab07201858f4287c938d", Ya = "0x1a736d6ed154502257f02b1ccdf4d9d1089f80811cd6acad48e6b6a9d1f2003", Za = "0x036078334509b514626504edc9fb252328d1a240e4e948bef8d0c08dff45927f", Ja = "0x737ee2f87ce571a58c6c8da558ec18a07ceb64a6172d5ec46171fbc80077a48", Qa = "0x6e150953b26271a740bf2b6e9bca17cc52c68d765f761295de51ceb8526ee72", ei = "0x4d07e40e93398ed3c76981e72dd1fd22557a78ce36c0515f679e27f0bb5bc5f";
+}, Wa = (t) => en(t) ? tt(t) : Jr(t) ? et(t) : $e(t), rn = e.union([e.literal("0"), e.literal("1")]), Ka = "0x049d36570d4e46f48e99674bd3fcc84644ddd6b96f7c741b1562b82f9e004dc7", Ya = "0x04718f5a0fc34cc1af16a1cdee98ffb20c31f5cd61d6ab07201858f4287c938d", Za = "0x1a736d6ed154502257f02b1ccdf4d9d1089f80811cd6acad48e6b6a9d1f2003", Ja = "0x036078334509b514626504edc9fb252328d1a240e4e948bef8d0c08dff45927f", Qa = "0x737ee2f87ce571a58c6c8da558ec18a07ceb64a6172d5ec46171fbc80077a48", ei = "0x6e150953b26271a740bf2b6e9bca17cc52c68d765f761295de51ceb8526ee72", ti = "0x4d07e40e93398ed3c76981e72dd1fd22557a78ce36c0515f679e27f0bb5bc5f";
 function nn(t) {
   var o = [];
   if (t.length === 0)
@@ -94,10 +94,10 @@ function nn(t) {
   }
   t[0].match(/^file:\/\/\//) ? t[0] = t[0].replace(/^([^/:]+):\/*/, "$1:///") : t[0] = t[0].replace(/^([^/:]+):\/*/, "$1://");
   for (var T = 0; T < t.length; T++) {
-    var N = t[T];
-    if (typeof N != "string")
-      throw new TypeError("Url must be a string. Received " + N);
-    N !== "" && (T > 0 && (N = N.replace(/^[\/]+/, "")), T < t.length - 1 ? N = N.replace(/[\/]+$/, "") : N = N.replace(/[\/]+$/, "/"), o.push(N));
+    var S = t[T];
+    if (typeof S != "string")
+      throw new TypeError("Url must be a string. Received " + S);
+    S !== "" && (T > 0 && (S = S.replace(/^[\/]+/, "")), T < t.length - 1 ? S = S.replace(/[\/]+$/, "") : S = S.replace(/[\/]+$/, "/"), o.push(S));
   }
   var D = o.join("/");
   D = D.replace(/\/(\?|&|#[^!])/g, "$1");
@@ -109,9 +109,9 @@ function an() {
   return typeof arguments[0] == "object" ? t = arguments[0] : t = [].slice.call(arguments), nn(t);
 }
 class we extends Error {
-  constructor({ code: o, message: E, options: T = {} }, N) {
+  constructor({ code: o, message: E, options: T = {} }, S) {
     const { error: D, context: w } = T;
-    super(E, { cause: D }), this.errorMessages = N, this.name = "BaseError", this.context = w, this.code = o, this.setMessageByCode(o, E);
+    super(E, { cause: D }), this.errorMessages = S, this.name = "BaseError", this.context = w, this.code = o, this.setMessageByCode(o, E);
   }
   setMessageByCode(o, E) {
     !o || !this.errorMessages || E || (this.message = this.errorMessages[o]);
@@ -134,11 +134,11 @@ class dt extends Error {
     super(o), this.status = E, this.data = T, Object.setPrototypeOf(this, dt.prototype);
   }
 }
-var St;
+var bt;
 (function(t) {
   t.FAILED_TO_FETCH_URL = "Failed to fetch url", t.FAILED_TO_POST_URL = "Failed to post url";
-})(St || (St = {}));
-const ti = e.object({
+})(bt || (bt = {}));
+const ri = e.object({
   walletAddress: H,
   ens: Xe,
   chain: e.enum(["ethereum", "starknet"]),
@@ -147,11 +147,11 @@ const ti = e.object({
 }).or(e.object({
   status: e.string()
 }));
-async function ri(t, o, E, T = "starknet") {
-  const N = {
+async function ni(t, o, E, T = "starknet") {
+  const S = {
     ens: t,
     chain: T
-  }, D = new URLSearchParams(N), w = an(E, "wallet", `?${D}`);
+  }, D = new URLSearchParams(S), w = an(E, "wallet", `?${D}`);
   try {
     const k = await o.get(w), L = k && "walletAddress" in k ? k.walletAddress : void 0;
     if (!L)
@@ -163,7 +163,7 @@ async function ri(t, o, E, T = "starknet") {
         code: "ARGENT_NAME_NOT_FOUND",
         message: `${t} not found`
       });
-    if (!qr(L))
+    if (!zr(L))
       throw new ke({
         code: "ARGENT_NAME_INVALID_ADDRESS",
         message: `${t} resolved to an invalid address (${L})`
@@ -180,7 +180,7 @@ var nt;
 (function(t) {
   t.NOT_VALID = "Invalid call";
 })(nt || (nt = {}));
-class ni extends we {
+class ai extends we {
   constructor(o) {
     super(o, nt), this.name = "CallError";
   }
@@ -189,7 +189,7 @@ var at;
 (function(t) {
   t.NO_NETWORK_OR_MULTICALL = "Missing networkId or multicall", t.NOT_FOUND = "Network not found";
 })(at || (at = {}));
-class ai extends we {
+class ii extends we {
   constructor(o) {
     super(o, at), this.name = "NetworkError";
   }
@@ -208,18 +208,18 @@ const De = e.union([e.string(), e.number(), e.bigint()]), sn = e.object({
   contractAddress: e.string(),
   calldata: un,
   entrypoint: e.string().optional()
-})), bt = e.lazy(() => fn.and(e.object({
+})), Nt = e.lazy(() => fn.and(e.object({
   entrypoint: e.string()
-}))), he = e.string().refine((t) => typeof parseInt(t) == "number"), ii = e.tuple([he]), si = e.tuple([he]), oi = e.object({
+}))), he = e.string().refine((t) => typeof parseInt(t) == "number"), si = e.tuple([he]), oi = e.tuple([he]), ci = e.object({
   new_threshold: e.string().refine((t) => typeof parseInt(t) == "number"),
   signers_to_add: e.array(he)
-}), ci = e.object({
+}), li = e.object({
   new_threshold: e.string().refine((t) => typeof parseInt(t) == "number"),
   signers_to_remove: e.array(he)
-}), li = e.object({
+}), ui = e.object({
   signer_to_remove: he,
   signer_to_add: he
-}), ui = e.tuple([he]), fi = e.tuple([he]), pi = e.tuple([he]), hi = e.tuple([he]).rest(he), mi = e.object({
+}), fi = e.tuple([he]), pi = e.tuple([he]), hi = e.tuple([he]), mi = e.tuple([he]).rest(he), di = e.object({
   recipient: K,
   amount: e.object({
     low: De,
@@ -228,14 +228,14 @@ const De = e.union([e.string(), e.number(), e.bigint()]), sn = e.object({
 }), pn = e.string().regex(/^(0x)?[0-9a-fA-F]+$/, "Invalid hex string"), Me = pn.transform((t) => {
   const o = t.startsWith("0x") ? t.slice(2) : t;
   return `0x${o.length % 2 === 0 ? o : `0${o}`}`;
-}), di = e.object({
+}), gi = e.object({
   cairoVersion: rn,
   accountClassHash: Me
-}), hn = e.array(e.string()), gi = e.object({
+}), hn = e.array(e.string()), Ei = e.object({
   implementation: e.string(),
   selector: Me,
   calldata: hn
-}), Ei = e.object({
+}), Ii = e.object({
   owner: e.string(),
   guardian: e.string().optional().transform((t) => t ?? "0")
 });
@@ -243,7 +243,7 @@ var Tt;
 (function(t) {
   t.Starknet = "Starknet", t.Secp256k1 = "Secp256k1", t.Secp256r1 = "Secp256r1", t.Eip191 = "Eip191", t.Webauthn = "Webauthn";
 })(Tt || (Tt = {}));
-function Ii(t, o) {
+function Ai(t, o) {
   const E = {
     Starknet: void 0,
     Secp256k1: void 0,
@@ -257,7 +257,7 @@ var it;
 (function(t) {
   t.NOT_FOUND = "Account not found", t.CALCULATED_ADDRESS_NO_MATCH = "Calculated address does not match account address";
 })(it || (it = {}));
-class Ai extends we {
+class Si extends we {
   constructor(o) {
     super(o, it), this.name = "AccountError";
   }
@@ -274,7 +274,7 @@ var st = { exports: {} };
     r.unshift("SEMVER"), console.log.apply(console, r);
   } : E = function() {
   }, o.SEMVER_SPEC_VERSION = "2.0.0";
-  var T = 256, N = Number.MAX_SAFE_INTEGER || /* istanbul ignore next */
+  var T = 256, S = Number.MAX_SAFE_INTEGER || /* istanbul ignore next */
   9007199254740991, D = 16, w = T - 6, k = o.re = [], L = o.safeRe = [], A = o.src = [], d = o.tokens = {}, Y = 0;
   function P(r) {
     d[r] = Y++;
@@ -286,8 +286,8 @@ var st = { exports: {} };
   ];
   function Ie(r) {
     for (var s = 0; s < ee.length; s++) {
-      var l = ee[s][0], S = ee[s][1];
-      r = r.split(l + "*").join(l + "{0," + S + "}").split(l + "+").join(l + "{1," + S + "}");
+      var l = ee[s][0], b = ee[s][1];
+      r = r.split(l + "*").join(l + "{0," + b + "}").split(l + "+").join(l + "{1," + b + "}");
     }
     return r;
   }
@@ -347,19 +347,19 @@ var st = { exports: {} };
     var l = r.trim().match(s.loose ? L[d.LOOSE] : L[d.FULL]);
     if (!l)
       throw new TypeError("Invalid Version: " + r);
-    if (this.raw = r, this.major = +l[1], this.minor = +l[2], this.patch = +l[3], this.major > N || this.major < 0)
+    if (this.raw = r, this.major = +l[1], this.minor = +l[2], this.patch = +l[3], this.major > S || this.major < 0)
       throw new TypeError("Invalid major version");
-    if (this.minor > N || this.minor < 0)
+    if (this.minor > S || this.minor < 0)
       throw new TypeError("Invalid minor version");
-    if (this.patch > N || this.patch < 0)
+    if (this.patch > S || this.patch < 0)
       throw new TypeError("Invalid patch version");
-    l[4] ? this.prerelease = l[4].split(".").map(function(S) {
-      if (/^[0-9]+$/.test(S)) {
-        var y = +S;
-        if (y >= 0 && y < N)
+    l[4] ? this.prerelease = l[4].split(".").map(function(b) {
+      if (/^[0-9]+$/.test(b)) {
+        var y = +b;
+        if (y >= 0 && y < S)
           return y;
       }
-      return S;
+      return b;
     }) : this.prerelease = [], this.build = l[5] ? l[5].split(".") : [], this.format();
   }
   j.prototype.format = function() {
@@ -379,31 +379,31 @@ var st = { exports: {} };
       return 0;
     var s = 0;
     do {
-      var l = this.prerelease[s], S = r.prerelease[s];
-      if (E("prerelease compare", s, l, S), l === void 0 && S === void 0)
+      var l = this.prerelease[s], b = r.prerelease[s];
+      if (E("prerelease compare", s, l, b), l === void 0 && b === void 0)
         return 0;
-      if (S === void 0)
+      if (b === void 0)
         return 1;
       if (l === void 0)
         return -1;
-      if (l === S)
+      if (l === b)
         continue;
-      return h(l, S);
+      return h(l, b);
     } while (++s);
   }, j.prototype.compareBuild = function(r) {
     r instanceof j || (r = new j(r, this.options));
     var s = 0;
     do {
-      var l = this.build[s], S = r.build[s];
-      if (E("prerelease compare", s, l, S), l === void 0 && S === void 0)
+      var l = this.build[s], b = r.build[s];
+      if (E("prerelease compare", s, l, b), l === void 0 && b === void 0)
         return 0;
-      if (S === void 0)
+      if (b === void 0)
         return 1;
       if (l === void 0)
         return -1;
-      if (l === S)
+      if (l === b)
         continue;
-      return h(l, S);
+      return h(l, b);
     } while (++s);
   }, j.prototype.inc = function(r, s) {
     switch (r) {
@@ -443,33 +443,33 @@ var st = { exports: {} };
     }
     return this.format(), this.raw = this.version, this;
   }, o.inc = n;
-  function n(r, s, l, S) {
-    typeof l == "string" && (S = l, l = void 0);
+  function n(r, s, l, b) {
+    typeof l == "string" && (b = l, l = void 0);
     try {
-      return new j(r, l).inc(s, S).version;
+      return new j(r, l).inc(s, b).version;
     } catch {
       return null;
     }
   }
   o.diff = a;
   function a(r, s) {
-    if (z(r, s))
+    if (q(r, s))
       return null;
-    var l = me(r), S = me(s), y = "";
-    if (l.prerelease.length || S.prerelease.length) {
+    var l = me(r), b = me(s), y = "";
+    if (l.prerelease.length || b.prerelease.length) {
       y = "pre";
       var v = "prerelease";
     }
     for (var O in l)
-      if ((O === "major" || O === "minor" || O === "patch") && l[O] !== S[O])
+      if ((O === "major" || O === "minor" || O === "patch") && l[O] !== b[O])
         return y + O;
     return v;
   }
   o.compareIdentifiers = h;
   var i = /^[0-9]+$/;
   function h(r, s) {
-    var l = i.test(r), S = i.test(s);
-    return l && S && (r = +r, s = +s), r === s ? 0 : l && !S ? -1 : S && !l ? 1 : r < s ? -1 : 1;
+    var l = i.test(r), b = i.test(s);
+    return l && b && (r = +r, s = +s), r === s ? 0 : l && !b ? -1 : b && !l ? 1 : r < s ? -1 : 1;
   }
   o.rcompareIdentifiers = u;
   function u(r, s) {
@@ -497,23 +497,23 @@ var st = { exports: {} };
   }
   o.compareBuild = m;
   function m(r, s, l) {
-    var S = new j(r, l), y = new j(s, l);
-    return S.compare(y) || S.compareBuild(y);
+    var b = new j(r, l), y = new j(s, l);
+    return b.compare(y) || b.compareBuild(y);
   }
-  o.rcompare = b;
-  function b(r, s, l) {
+  o.rcompare = N;
+  function N(r, s, l) {
     return f(s, r, l);
   }
   o.sort = _;
   function _(r, s) {
-    return r.sort(function(l, S) {
-      return o.compareBuild(l, S, s);
+    return r.sort(function(l, b) {
+      return o.compareBuild(l, b, s);
     });
   }
   o.rsort = C;
   function C(r, s) {
-    return r.sort(function(l, S) {
-      return o.compareBuild(S, l, s);
+    return r.sort(function(l, b) {
+      return o.compareBuild(b, l, s);
     });
   }
   o.gt = x;
@@ -524,8 +524,8 @@ var st = { exports: {} };
   function X(r, s, l) {
     return f(r, s, l) < 0;
   }
-  o.eq = z;
-  function z(r, s, l) {
+  o.eq = q;
+  function q(r, s, l) {
     return f(r, s, l) === 0;
   }
   o.neq = M;
@@ -540,8 +540,8 @@ var st = { exports: {} };
   function W(r, s, l) {
     return f(r, s, l) <= 0;
   }
-  o.cmp = Ne;
-  function Ne(r, s, l, S) {
+  o.cmp = Se;
+  function Se(r, s, l, b) {
     switch (s) {
       case "===":
         return typeof r == "object" && (r = r.version), typeof l == "object" && (l = l.version), r === l;
@@ -550,17 +550,17 @@ var st = { exports: {} };
       case "":
       case "=":
       case "==":
-        return z(r, l, S);
+        return q(r, l, b);
       case "!=":
-        return M(r, l, S);
+        return M(r, l, b);
       case ">":
-        return x(r, l, S);
+        return x(r, l, b);
       case ">=":
-        return $(r, l, S);
+        return $(r, l, b);
       case "<":
-        return X(r, l, S);
+        return X(r, l, b);
       case "<=":
-        return W(r, l, S);
+        return W(r, l, b);
       default:
         throw new TypeError("Invalid operator: " + s);
     }
@@ -596,7 +596,7 @@ var st = { exports: {} };
       } catch {
         return !1;
       }
-    return Ne(r, this.operator, this.semver, this.options);
+    return Se(r, this.operator, this.semver, this.options);
   }, Q.prototype.intersects = function(r, s) {
     if (!(r instanceof Q))
       throw new TypeError("a Comparator is required");
@@ -609,8 +609,8 @@ var st = { exports: {} };
       return this.value === "" ? !0 : (l = new G(r.value, s), je(this.value, l, s));
     if (r.operator === "")
       return r.value === "" ? !0 : (l = new G(this.value, s), je(r.semver, l, s));
-    var S = (this.operator === ">=" || this.operator === ">") && (r.operator === ">=" || r.operator === ">"), y = (this.operator === "<=" || this.operator === "<") && (r.operator === "<=" || r.operator === "<"), v = this.semver.version === r.semver.version, O = (this.operator === ">=" || this.operator === "<=") && (r.operator === ">=" || r.operator === "<="), V = Ne(this.semver, "<", r.semver, s) && (this.operator === ">=" || this.operator === ">") && (r.operator === "<=" || r.operator === "<"), F = Ne(this.semver, ">", r.semver, s) && (this.operator === "<=" || this.operator === "<") && (r.operator === ">=" || r.operator === ">");
-    return S || y || v && O || V || F;
+    var b = (this.operator === ">=" || this.operator === ">") && (r.operator === ">=" || r.operator === ">"), y = (this.operator === "<=" || this.operator === "<") && (r.operator === "<=" || r.operator === "<"), v = this.semver.version === r.semver.version, O = (this.operator === ">=" || this.operator === "<=") && (r.operator === ">=" || r.operator === "<="), V = Se(this.semver, "<", r.semver, s) && (this.operator === ">=" || this.operator === ">") && (r.operator === "<=" || r.operator === "<"), F = Se(this.semver, ">", r.semver, s) && (this.operator === "<=" || this.operator === "<") && (r.operator === ">=" || r.operator === ">");
+    return b || y || v && O || V || F;
   }, o.Range = G;
   function G(r, s) {
     if ((!s || typeof s != "object") && (s = {
@@ -638,12 +638,12 @@ var st = { exports: {} };
     return this.range;
   }, G.prototype.parseRange = function(r) {
     var s = this.options.loose, l = s ? L[d.HYPHENRANGELOOSE] : L[d.HYPHENRANGE];
-    r = r.replace(l, Nr), E("hyphen replace", r), r = r.replace(L[d.COMPARATORTRIM], R), E("comparator trim", r, L[d.COMPARATORTRIM]), r = r.replace(L[d.TILDETRIM], Ae), r = r.replace(L[d.CARETTRIM], _e), r = r.split(/\s+/).join(" ");
-    var S = s ? L[d.COMPARATORLOOSE] : L[d.COMPARATOR], y = r.split(" ").map(function(v) {
+    r = r.replace(l, Sr), E("hyphen replace", r), r = r.replace(L[d.COMPARATORTRIM], R), E("comparator trim", r, L[d.COMPARATORTRIM]), r = r.replace(L[d.TILDETRIM], Ae), r = r.replace(L[d.CARETTRIM], _e), r = r.split(/\s+/).join(" ");
+    var b = s ? L[d.COMPARATORLOOSE] : L[d.COMPARATOR], y = r.split(" ").map(function(v) {
       return J(v, this.options);
     }, this).join(" ").split(/\s+/);
     return this.options.loose && (y = y.filter(function(v) {
-      return !!v.match(S);
+      return !!v.match(b);
     })), y = y.map(function(v) {
       return new Q(v, this.options);
     }, this), y;
@@ -651,9 +651,9 @@ var st = { exports: {} };
     if (!(r instanceof G))
       throw new TypeError("a Range is required");
     return this.set.some(function(l) {
-      return Te(l, s) && r.set.some(function(S) {
-        return Te(S, s) && l.every(function(y) {
-          return S.every(function(v) {
+      return Te(l, s) && r.set.some(function(b) {
+        return Te(b, s) && l.every(function(y) {
+          return b.every(function(v) {
             return y.intersects(v, s);
           });
         });
@@ -661,17 +661,17 @@ var st = { exports: {} };
     });
   };
   function Te(r, s) {
-    for (var l = !0, S = r.slice(), y = S.pop(); l && S.length; )
-      l = S.every(function(v) {
+    for (var l = !0, b = r.slice(), y = b.pop(); l && b.length; )
+      l = b.every(function(v) {
         return y.intersects(v, s);
-      }), y = S.pop();
+      }), y = b.pop();
     return l;
   }
   o.toComparators = re;
   function re(r, s) {
     return new G(r, s).set.map(function(l) {
-      return l.map(function(S) {
-        return S.value;
+      return l.map(function(b) {
+        return b.value;
       }).join(" ").trim().split(" ");
     });
   }
@@ -688,8 +688,8 @@ var st = { exports: {} };
   }
   function mr(r, s) {
     var l = s.loose ? L[d.TILDELOOSE] : L[d.TILDE];
-    return r.replace(l, function(S, y, v, O, V) {
-      E("tilde", r, S, y, v, O, V);
+    return r.replace(l, function(b, y, v, O, V) {
+      E("tilde", r, b, y, v, O, V);
       var F;
       return B(y) ? F = "" : B(v) ? F = ">=" + y + ".0.0 <" + (+y + 1) + ".0.0" : B(O) ? F = ">=" + y + "." + v + ".0 <" + y + "." + (+v + 1) + ".0" : V ? (E("replaceTilde pr", V), F = ">=" + y + "." + v + "." + O + "-" + V + " <" + y + "." + (+v + 1) + ".0") : F = ">=" + y + "." + v + "." + O + " <" + y + "." + (+v + 1) + ".0", E("tilde return", F), F;
     });
@@ -702,8 +702,8 @@ var st = { exports: {} };
   function gr(r, s) {
     E("caret", r, s);
     var l = s.loose ? L[d.CARETLOOSE] : L[d.CARET];
-    return r.replace(l, function(S, y, v, O, V) {
-      E("caret", r, S, y, v, O, V);
+    return r.replace(l, function(b, y, v, O, V) {
+      E("caret", r, b, y, v, O, V);
       var F;
       return B(y) ? F = "" : B(v) ? F = ">=" + y + ".0.0 <" + (+y + 1) + ".0.0" : B(O) ? y === "0" ? F = ">=" + y + "." + v + ".0 <" + y + "." + (+v + 1) + ".0" : F = ">=" + y + "." + v + ".0 <" + (+y + 1) + ".0.0" : V ? (E("replaceCaret pr", V), y === "0" ? v === "0" ? F = ">=" + y + "." + v + "." + O + "-" + V + " <" + y + "." + v + "." + (+O + 1) : F = ">=" + y + "." + v + "." + O + "-" + V + " <" + y + "." + (+v + 1) + ".0" : F = ">=" + y + "." + v + "." + O + "-" + V + " <" + (+y + 1) + ".0.0") : (E("no pr"), y === "0" ? v === "0" ? F = ">=" + y + "." + v + "." + O + " <" + y + "." + v + "." + (+O + 1) : F = ">=" + y + "." + v + "." + O + " <" + y + "." + (+v + 1) + ".0" : F = ">=" + y + "." + v + "." + O + " <" + (+y + 1) + ".0.0"), E("caret return", F), F;
     });
@@ -716,17 +716,17 @@ var st = { exports: {} };
   function Ir(r, s) {
     r = r.trim();
     var l = s.loose ? L[d.XRANGELOOSE] : L[d.XRANGE];
-    return r.replace(l, function(S, y, v, O, V, F) {
-      E("xRange", r, S, y, v, O, V, F);
+    return r.replace(l, function(b, y, v, O, V, F) {
+      E("xRange", r, b, y, v, O, V, F);
       var ge = B(v), Ee = ge || B(O), se = Ee || B(V), ie = se;
-      return y === "=" && ie && (y = ""), F = s.includePrerelease ? "-0" : "", ge ? y === ">" || y === "<" ? S = "<0.0.0-0" : S = "*" : y && ie ? (Ee && (O = 0), V = 0, y === ">" ? (y = ">=", Ee ? (v = +v + 1, O = 0, V = 0) : (O = +O + 1, V = 0)) : y === "<=" && (y = "<", Ee ? v = +v + 1 : O = +O + 1), S = y + v + "." + O + "." + V + F) : Ee ? S = ">=" + v + ".0.0" + F + " <" + (+v + 1) + ".0.0" + F : se && (S = ">=" + v + "." + O + ".0" + F + " <" + v + "." + (+O + 1) + ".0" + F), E("xRange return", S), S;
+      return y === "=" && ie && (y = ""), F = s.includePrerelease ? "-0" : "", ge ? y === ">" || y === "<" ? b = "<0.0.0-0" : b = "*" : y && ie ? (Ee && (O = 0), V = 0, y === ">" ? (y = ">=", Ee ? (v = +v + 1, O = 0, V = 0) : (O = +O + 1, V = 0)) : y === "<=" && (y = "<", Ee ? v = +v + 1 : O = +O + 1), b = y + v + "." + O + "." + V + F) : Ee ? b = ">=" + v + ".0.0" + F + " <" + (+v + 1) + ".0.0" + F : se && (b = ">=" + v + "." + O + ".0" + F + " <" + v + "." + (+O + 1) + ".0" + F), E("xRange return", b), b;
     });
   }
   function Ar(r, s) {
     return E("replaceStars", r, s), r.trim().replace(L[d.STAR], "");
   }
-  function Nr(r, s, l, S, y, v, O, V, F, ge, Ee, se, ie) {
-    return B(l) ? s = "" : B(S) ? s = ">=" + l + ".0.0" : B(y) ? s = ">=" + l + "." + S + ".0" : s = ">=" + s, B(F) ? V = "" : B(ge) ? V = "<" + (+F + 1) + ".0.0" : B(Ee) ? V = "<" + F + "." + (+ge + 1) + ".0" : se ? V = "<=" + F + "." + ge + "." + Ee + "-" + se : V = "<=" + V, (s + " " + V).trim();
+  function Sr(r, s, l, b, y, v, O, V, F, ge, Ee, se, ie) {
+    return B(l) ? s = "" : B(b) ? s = ">=" + l + ".0.0" : B(y) ? s = ">=" + l + "." + b + ".0" : s = ">=" + s, B(F) ? V = "" : B(ge) ? V = "<" + (+F + 1) + ".0.0" : B(Ee) ? V = "<" + F + "." + (+ge + 1) + ".0" : se ? V = "<=" + F + "." + ge + "." + Ee + "-" + se : V = "<=" + V, (s + " " + V).trim();
   }
   G.prototype.test = function(r) {
     if (!r)
@@ -738,18 +738,18 @@ var st = { exports: {} };
         return !1;
       }
     for (var s = 0; s < this.set.length; s++)
-      if (Sr(this.set[s], r, this.options))
+      if (br(this.set[s], r, this.options))
         return !0;
     return !1;
   };
-  function Sr(r, s, l) {
-    for (var S = 0; S < r.length; S++)
-      if (!r[S].test(s))
+  function br(r, s, l) {
+    for (var b = 0; b < r.length; b++)
+      if (!r[b].test(s))
         return !1;
     if (s.prerelease.length && !l.includePrerelease) {
-      for (S = 0; S < r.length; S++)
-        if (E(r[S].semver), r[S].semver !== de && r[S].semver.prerelease.length > 0) {
-          var y = r[S].semver;
+      for (b = 0; b < r.length; b++)
+        if (E(r[b].semver), r[b].semver !== de && r[b].semver.prerelease.length > 0) {
+          var y = r[b].semver;
           if (y.major === s.major && y.minor === s.minor && y.patch === s.patch)
             return !0;
         }
@@ -766,29 +766,29 @@ var st = { exports: {} };
     }
     return s.test(r);
   }
-  o.maxSatisfying = br;
-  function br(r, s, l) {
-    var S = null, y = null;
+  o.maxSatisfying = Nr;
+  function Nr(r, s, l) {
+    var b = null, y = null;
     try {
       var v = new G(s, l);
     } catch {
       return null;
     }
     return r.forEach(function(O) {
-      v.test(O) && (!S || y.compare(O) === -1) && (S = O, y = new j(S, l));
-    }), S;
+      v.test(O) && (!b || y.compare(O) === -1) && (b = O, y = new j(b, l));
+    }), b;
   }
   o.minSatisfying = Tr;
   function Tr(r, s, l) {
-    var S = null, y = null;
+    var b = null, y = null;
     try {
       var v = new G(s, l);
     } catch {
       return null;
     }
     return r.forEach(function(O) {
-      v.test(O) && (!S || y.compare(O) === 1) && (S = O, y = new j(S, l));
-    }), S;
+      v.test(O) && (!b || y.compare(O) === 1) && (b = O, y = new j(b, l));
+    }), b;
   }
   o.minVersion = yr;
   function yr(r, s) {
@@ -797,8 +797,8 @@ var st = { exports: {} };
     if (r.test(l) || (l = new j("0.0.0-0"), r.test(l)))
       return l;
     l = null;
-    for (var S = 0; S < r.set.length; ++S) {
-      var y = r.set[S];
+    for (var b = 0; b < r.set.length; ++b) {
+      var y = r.set[b];
       y.forEach(function(v) {
         var O = new j(v.semver.version);
         switch (v.operator) {
@@ -828,15 +828,15 @@ var st = { exports: {} };
   }
   o.ltr = vr;
   function vr(r, s, l) {
-    return ze(r, s, "<", l);
+    return qe(r, s, "<", l);
   }
   o.gtr = Or;
   function Or(r, s, l) {
-    return ze(r, s, ">", l);
+    return qe(r, s, ">", l);
   }
-  o.outside = ze;
-  function ze(r, s, l, S) {
-    r = new j(r, S), s = new G(s, S);
+  o.outside = qe;
+  function qe(r, s, l, b) {
+    r = new j(r, b), s = new G(s, b);
     var y, v, O, V, F;
     switch (l) {
       case ">":
@@ -848,12 +848,12 @@ var st = { exports: {} };
       default:
         throw new TypeError('Must provide a hilo val of "<" or ">"');
     }
-    if (je(r, s, S))
+    if (je(r, s, b))
       return !1;
     for (var ge = 0; ge < s.set.length; ++ge) {
       var Ee = s.set[ge], se = null, ie = null;
       if (Ee.forEach(function(ye) {
-        ye.semver === de && (ye = new Q(">=0.0.0")), se = se || ye, ie = ie || ye, y(ye.semver, se.semver, S) ? se = ye : O(ye.semver, ie.semver, S) && (ie = ye);
+        ye.semver === de && (ye = new Q(">=0.0.0")), se = se || ye, ie = ie || ye, y(ye.semver, se.semver, b) ? se = ye : O(ye.semver, ie.semver, b) && (ie = ye);
       }), se.operator === V || se.operator === F || (!ie.operator || ie.operator === V) && v(r, ie.semver))
         return !1;
       if (ie.operator === F && O(r, ie.semver))
@@ -881,20 +881,20 @@ var st = { exports: {} };
     if (!s.rtl)
       l = r.match(L[d.COERCE]);
     else {
-      for (var S; (S = L[d.COERCERTL].exec(r)) && (!l || l.index + l[0].length !== r.length); )
-        (!l || S.index + S[0].length !== l.index + l[0].length) && (l = S), L[d.COERCERTL].lastIndex = S.index + S[1].length + S[2].length;
+      for (var b; (b = L[d.COERCERTL].exec(r)) && (!l || l.index + l[0].length !== r.length); )
+        (!l || b.index + b[0].length !== l.index + l[0].length) && (l = b), L[d.COERCERTL].lastIndex = b.index + b[1].length + b[2].length;
       L[d.COERCERTL].lastIndex = -1;
     }
     return l === null ? null : me(l[2] + "." + (l[3] || "0") + "." + (l[4] || "0"), s);
   }
 })(st, st.exports);
 var dn = st.exports;
-const Ni = /* @__PURE__ */ mn(dn), Si = (t) => t == null ? [] : Array.isArray(t) ? t : [t], bi = e.any().refine((t) => typeof t == "bigint", {
+const bi = /* @__PURE__ */ mn(dn), Ni = (t) => t == null ? [] : Array.isArray(t) ? t : [t], Ti = e.any().refine((t) => typeof t == "bigint", {
   message: "Value must be a BigInt"
 }).transform((t) => BigInt(t));
-var gn = /^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i, qe = Math.ceil, ce = Math.floor, ne = "[BigNumber Error] ", yt = ne + "Number primitive has more than 15 significant digits: ", pe = 1e14, U = 14, We = 9007199254740991, Ke = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13], Re = 1e7, Z = 1e9;
+var gn = /^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i, ze = Math.ceil, ce = Math.floor, ne = "[BigNumber Error] ", yt = ne + "Number primitive has more than 15 significant digits: ", pe = 1e14, U = 14, We = 9007199254740991, Ke = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13], Re = 1e7, Z = 1e9;
 function kt(t) {
-  var o, E, T, N = R.prototype = { constructor: R, toString: null, valueOf: null }, D = new R(1), w = 20, k = 4, L = -7, A = 21, d = -1e7, Y = 1e7, P = !1, fe = 1, ee = 0, Ie = {
+  var o, E, T, S = R.prototype = { constructor: R, toString: null, valueOf: null }, D = new R(1), w = 20, k = 4, L = -7, A = 21, d = -1e7, Y = 1e7, P = !1, fe = 1, ee = 0, Ie = {
     prefix: "",
     groupSize: 3,
     secondaryGroupSize: 0,
@@ -926,7 +926,7 @@ function kt(t) {
       }
       (p = g.indexOf(".")) > -1 && (g = g.replace(".", "")), (I = g.search(/e/i)) > 0 ? (p < 0 && (p = I), p += +g.slice(I + 1), g = g.substring(0, I)) : p < 0 && (p = g.length);
     } else {
-      if (q(a, 2, Ae.length, "Base"), a == 10 && _e)
+      if (z(a, 2, Ae.length, "Base"), a == 10 && _e)
         return m = new R(n), te(m, w + m.e + 1, k);
       if (g = String(n), c = typeof n == "number") {
         if (n * 0 != 0) return T(m, g, c, a);
@@ -975,10 +975,10 @@ function kt(t) {
     var a, i;
     if (n != null)
       if (typeof n == "object") {
-        if (n.hasOwnProperty(a = "DECIMAL_PLACES") && (i = n[a], q(i, 0, Z, a), w = i), n.hasOwnProperty(a = "ROUNDING_MODE") && (i = n[a], q(i, 0, 8, a), k = i), n.hasOwnProperty(a = "EXPONENTIAL_AT") && (i = n[a], i && i.pop ? (q(i[0], -Z, 0, a), q(i[1], 0, Z, a), L = i[0], A = i[1]) : (q(i, -Z, Z, a), L = -(A = i < 0 ? -i : i))), n.hasOwnProperty(a = "RANGE"))
+        if (n.hasOwnProperty(a = "DECIMAL_PLACES") && (i = n[a], z(i, 0, Z, a), w = i), n.hasOwnProperty(a = "ROUNDING_MODE") && (i = n[a], z(i, 0, 8, a), k = i), n.hasOwnProperty(a = "EXPONENTIAL_AT") && (i = n[a], i && i.pop ? (z(i[0], -Z, 0, a), z(i[1], 0, Z, a), L = i[0], A = i[1]) : (z(i, -Z, Z, a), L = -(A = i < 0 ? -i : i))), n.hasOwnProperty(a = "RANGE"))
           if (i = n[a], i && i.pop)
-            q(i[0], -Z, -1, a), q(i[1], 1, Z, a), d = i[0], Y = i[1];
-          else if (q(i, -Z, Z, a), i)
+            z(i[0], -Z, -1, a), z(i[1], 1, Z, a), d = i[0], Y = i[1];
+          else if (z(i, -Z, Z, a), i)
             d = -(Y = i < 0 ? -i : i);
           else
             throw Error(ne + a + " cannot be zero: " + i);
@@ -993,7 +993,7 @@ function kt(t) {
               P = i;
           else
             throw Error(ne + a + " not true or false: " + i);
-        if (n.hasOwnProperty(a = "MODULO_MODE") && (i = n[a], q(i, 0, 9, a), fe = i), n.hasOwnProperty(a = "POW_PRECISION") && (i = n[a], q(i, 0, Z, a), ee = i), n.hasOwnProperty(a = "FORMAT"))
+        if (n.hasOwnProperty(a = "MODULO_MODE") && (i = n[a], z(i, 0, 9, a), fe = i), n.hasOwnProperty(a = "POW_PRECISION") && (i = n[a], z(i, 0, Z, a), ee = i), n.hasOwnProperty(a = "FORMAT"))
           if (i = n[a], typeof i == "object") Ie = i;
           else throw Error(ne + a + " not an object: " + i);
         if (n.hasOwnProperty(a = "ALPHABET"))
@@ -1045,7 +1045,7 @@ function kt(t) {
     };
     return function(i) {
       var h, u, p, I, c, f = 0, g = [], m = new R(D);
-      if (i == null ? i = w : q(i, 0, Z), I = qe(i / U), P)
+      if (i == null ? i = w : z(i, 0, Z), I = ze(i / U), P)
         if (crypto.getRandomValues) {
           for (h = crypto.getRandomValues(new Uint32Array(I *= 2)); f < I; )
             c = h[f] * 131072 + (h[f + 1] >>> 11), c >= 9e15 ? (u = crypto.getRandomValues(new Uint32Array(2)), h[f] = u[0], h[f + 1] = u[1]) : (g.push(c % 1e14), f += 2);
@@ -1083,31 +1083,31 @@ function kt(t) {
       return c.reverse();
     }
     return function(i, h, u, p, I) {
-      var c, f, g, m, b, _, C, x, X = i.indexOf("."), z = w, M = k;
+      var c, f, g, m, N, _, C, x, X = i.indexOf("."), q = w, M = k;
       for (X >= 0 && (m = ee, ee = 0, i = i.replace(".", ""), x = new R(h), _ = x.pow(i.length - X), ee = m, x.c = a(
-        Se(oe(_.c), _.e, "0"),
+        be(oe(_.c), _.e, "0"),
         10,
         u,
         n
       ), x.e = x.c.length), C = a(i, h, u, I ? (c = Ae, n) : (c = n, Ae)), g = m = C.length; C[--m] == 0; C.pop()) ;
       if (!C[0]) return c.charAt(0);
-      if (X < 0 ? --g : (_.c = C, _.e = g, _.s = p, _ = o(_, x, z, M, u), C = _.c, b = _.r, g = _.e), f = g + z + 1, X = C[f], m = u / 2, b = b || f < 0 || C[f + 1] != null, b = M < 4 ? (X != null || b) && (M == 0 || M == (_.s < 0 ? 3 : 2)) : X > m || X == m && (M == 4 || b || M == 6 && C[f - 1] & 1 || M == (_.s < 0 ? 8 : 7)), f < 1 || !C[0])
-        i = b ? Se(c.charAt(1), -z, c.charAt(0)) : c.charAt(0);
+      if (X < 0 ? --g : (_.c = C, _.e = g, _.s = p, _ = o(_, x, q, M, u), C = _.c, N = _.r, g = _.e), f = g + q + 1, X = C[f], m = u / 2, N = N || f < 0 || C[f + 1] != null, N = M < 4 ? (X != null || N) && (M == 0 || M == (_.s < 0 ? 3 : 2)) : X > m || X == m && (M == 4 || N || M == 6 && C[f - 1] & 1 || M == (_.s < 0 ? 8 : 7)), f < 1 || !C[0])
+        i = N ? be(c.charAt(1), -q, c.charAt(0)) : c.charAt(0);
       else {
-        if (C.length = f, b)
+        if (C.length = f, N)
           for (--u; ++C[--f] > u; )
             C[f] = 0, f || (++g, C = [1].concat(C));
         for (m = C.length; !C[--m]; ) ;
         for (X = 0, i = ""; X <= m; i += c.charAt(C[X++])) ;
-        i = Se(i, g, c.charAt(0));
+        i = be(i, g, c.charAt(0));
       }
       return i;
     };
   }(), o = /* @__PURE__ */ function() {
     function n(h, u, p) {
-      var I, c, f, g, m = 0, b = h.length, _ = u % Re, C = u / Re | 0;
-      for (h = h.slice(); b--; )
-        f = h[b] % Re, g = h[b] / Re | 0, I = C * f + g * _, c = _ * f + I % Re * Re + m, m = (c / p | 0) + (I / Re | 0) + C * g, h[b] = c % p;
+      var I, c, f, g, m = 0, N = h.length, _ = u % Re, C = u / Re | 0;
+      for (h = h.slice(); N--; )
+        f = h[N] % Re, g = h[N] / Re | 0, I = C * f + g * _, c = _ * f + I % Re * Re + m, m = (c / p | 0) + (I / Re | 0) + C * g, h[N] = c % p;
       return m && (h = [m].concat(h)), h;
     }
     function a(h, u, p, I) {
@@ -1128,7 +1128,7 @@ function kt(t) {
       for (; !h[0] && h.length > 1; h.splice(0, 1)) ;
     }
     return function(h, u, p, I, c) {
-      var f, g, m, b, _, C, x, X, z, M, $, W, Ne, Q, de, G, Te, re = h.s == u.s ? 1 : -1, J = h.c, B = u.c;
+      var f, g, m, N, _, C, x, X, q, M, $, W, Se, Q, de, G, Te, re = h.s == u.s ? 1 : -1, J = h.c, B = u.c;
       if (!J || !J[0] || !B || !B[0])
         return new R(
           // Return NaN if either NaN, or both Infinity or 0.
@@ -1137,11 +1137,11 @@ function kt(t) {
             J && J[0] == 0 || !B ? re * 0 : re / 0
           )
         );
-      for (X = new R(re), z = X.c = [], g = h.e - u.e, re = p + g + 1, c || (c = pe, g = le(h.e / U) - le(u.e / U), re = re / U | 0), m = 0; B[m] == (J[m] || 0); m++) ;
+      for (X = new R(re), q = X.c = [], g = h.e - u.e, re = p + g + 1, c || (c = pe, g = le(h.e / U) - le(u.e / U), re = re / U | 0), m = 0; B[m] == (J[m] || 0); m++) ;
       if (B[m] > (J[m] || 0) && g--, re < 0)
-        z.push(1), b = !0;
+        q.push(1), N = !0;
       else {
-        for (Q = J.length, G = B.length, m = 0, re += 2, _ = ce(c / (B[0] + 1)), _ > 1 && (B = n(B, _, c), J = n(J, _, c), G = B.length, Q = J.length), Ne = G, M = J.slice(0, G), $ = M.length; $ < G; M[$++] = 0) ;
+        for (Q = J.length, G = B.length, m = 0, re += 2, _ = ce(c / (B[0] + 1)), _ > 1 && (B = n(B, _, c), J = n(J, _, c), G = B.length, Q = J.length), Se = G, M = J.slice(0, G), $ = M.length; $ < G; M[$++] = 0) ;
         Te = B.slice(), Te = [0].concat(Te), de = B[0], B[1] >= c / 2 && de++;
         do {
           if (_ = 0, f = a(B, M, G, $), f < 0) {
@@ -1154,27 +1154,27 @@ function kt(t) {
               for (; a(B, M, G, $) < 1; )
                 _++, i(M, G < $ ? Te : B, $, c), $ = M.length;
           } else f === 0 && (_++, M = [0]);
-          z[m++] = _, M[0] ? M[$++] = J[Ne] || 0 : (M = [J[Ne]], $ = 1);
-        } while ((Ne++ < Q || M[0] != null) && re--);
-        b = M[0] != null, z[0] || z.splice(0, 1);
+          q[m++] = _, M[0] ? M[$++] = J[Se] || 0 : (M = [J[Se]], $ = 1);
+        } while ((Se++ < Q || M[0] != null) && re--);
+        N = M[0] != null, q[0] || q.splice(0, 1);
       }
       if (c == pe) {
-        for (m = 1, re = z[0]; re >= 10; re /= 10, m++) ;
-        te(X, p + (X.e = m + g * U - 1) + 1, I, b);
+        for (m = 1, re = q[0]; re >= 10; re /= 10, m++) ;
+        te(X, p + (X.e = m + g * U - 1) + 1, I, N);
       } else
-        X.e = g, X.r = +b;
+        X.e = g, X.r = +N;
       return X;
     };
   }();
   function ae(n, a, i, h) {
     var u, p, I, c, f;
-    if (i == null ? i = k : q(i, 0, 8), !n.c) return n.toString();
+    if (i == null ? i = k : z(i, 0, 8), !n.c) return n.toString();
     if (u = n.c[0], I = n.e, a == null)
-      f = oe(n.c), f = h == 1 || h == 2 && (I <= L || I >= A) ? Fe(f, I) : Se(f, I, "0");
+      f = oe(n.c), f = h == 1 || h == 2 && (I <= L || I >= A) ? Fe(f, I) : be(f, I, "0");
     else if (n = te(new R(n), a, i), p = n.e, f = oe(n.c), c = f.length, h == 1 || h == 2 && (a <= p || p <= L)) {
       for (; c < a; f += "0", c++) ;
       f = Fe(f, p);
-    } else if (a -= I, f = Se(f, p, "0"), p + 1 > c) {
+    } else if (a -= I, f = be(f, p, "0"), p + 1 > c) {
       if (--a > 0) for (f += "."; a--; f += "0") ;
     } else if (a += p - c, a > 0)
       for (p + 1 == c && (f += "."); a--; f += "0") ;
@@ -1197,8 +1197,8 @@ function kt(t) {
       if (h.test(m))
         p.s = isNaN(m) ? null : m < 0 ? -1 : 1;
       else {
-        if (!c && (m = m.replace(n, function(b, _, C) {
-          return g = (C = C.toLowerCase()) == "x" ? 16 : C == "b" ? 2 : 8, !f || f == g ? _ : b;
+        if (!c && (m = m.replace(n, function(N, _, C) {
+          return g = (C = C.toLowerCase()) == "x" ? 16 : C == "b" ? 2 : 8, !f || f == g ? _ : N;
         }), f && (g = f, m = m.replace(a, "$1").replace(i, "0.$1")), I != m))
           return new R(m, g);
         if (R.DEBUG)
@@ -1209,40 +1209,40 @@ function kt(t) {
     };
   }();
   function te(n, a, i, h) {
-    var u, p, I, c, f, g, m, b = n.c, _ = Ke;
-    if (b) {
+    var u, p, I, c, f, g, m, N = n.c, _ = Ke;
+    if (N) {
       e: {
-        for (u = 1, c = b[0]; c >= 10; c /= 10, u++) ;
+        for (u = 1, c = N[0]; c >= 10; c /= 10, u++) ;
         if (p = a - u, p < 0)
-          p += U, I = a, f = b[g = 0], m = ce(f / _[u - I - 1] % 10);
-        else if (g = qe((p + 1) / U), g >= b.length)
+          p += U, I = a, f = N[g = 0], m = ce(f / _[u - I - 1] % 10);
+        else if (g = ze((p + 1) / U), g >= N.length)
           if (h) {
-            for (; b.length <= g; b.push(0)) ;
+            for (; N.length <= g; N.push(0)) ;
             f = m = 0, u = 1, p %= U, I = p - U + 1;
           } else
             break e;
         else {
-          for (f = c = b[g], u = 1; c >= 10; c /= 10, u++) ;
+          for (f = c = N[g], u = 1; c >= 10; c /= 10, u++) ;
           p %= U, I = p - U + u, m = I < 0 ? 0 : ce(f / _[u - I - 1] % 10);
         }
         if (h = h || a < 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.
-        b[g + 1] != null || (I < 0 ? f : f % _[u - I - 1]), h = i < 4 ? (m || h) && (i == 0 || i == (n.s < 0 ? 3 : 2)) : m > 5 || m == 5 && (i == 4 || h || i == 6 && // Check whether the digit to the left of the rounding digit is odd.
-        (p > 0 ? I > 0 ? f / _[u - I] : 0 : b[g - 1]) % 10 & 1 || i == (n.s < 0 ? 8 : 7)), a < 1 || !b[0])
-          return b.length = 0, h ? (a -= n.e + 1, b[0] = _[(U - a % U) % U], n.e = -a || 0) : b[0] = n.e = 0, n;
-        if (p == 0 ? (b.length = g, c = 1, g--) : (b.length = g + 1, c = _[U - p], b[g] = I > 0 ? ce(f / _[u - I] % _[I]) * c : 0), h)
+        N[g + 1] != null || (I < 0 ? f : f % _[u - I - 1]), h = i < 4 ? (m || h) && (i == 0 || i == (n.s < 0 ? 3 : 2)) : m > 5 || m == 5 && (i == 4 || h || i == 6 && // Check whether the digit to the left of the rounding digit is odd.
+        (p > 0 ? I > 0 ? f / _[u - I] : 0 : N[g - 1]) % 10 & 1 || i == (n.s < 0 ? 8 : 7)), a < 1 || !N[0])
+          return N.length = 0, h ? (a -= n.e + 1, N[0] = _[(U - a % U) % U], n.e = -a || 0) : N[0] = n.e = 0, n;
+        if (p == 0 ? (N.length = g, c = 1, g--) : (N.length = g + 1, c = _[U - p], N[g] = I > 0 ? ce(f / _[u - I] % _[I]) * c : 0), h)
           for (; ; )
             if (g == 0) {
-              for (p = 1, I = b[0]; I >= 10; I /= 10, p++) ;
-              for (I = b[0] += c, c = 1; I >= 10; I /= 10, c++) ;
-              p != c && (n.e++, b[0] == pe && (b[0] = 1));
+              for (p = 1, I = N[0]; I >= 10; I /= 10, p++) ;
+              for (I = N[0] += c, c = 1; I >= 10; I /= 10, c++) ;
+              p != c && (n.e++, N[0] == pe && (N[0] = 1));
               break;
             } else {
-              if (b[g] += c, b[g] != pe) break;
-              b[g--] = 0, c = 1;
+              if (N[g] += c, N[g] != pe) break;
+              N[g--] = 0, c = 1;
             }
-        for (p = b.length; b[--p] === 0; b.pop()) ;
+        for (p = N.length; N[--p] === 0; N.pop()) ;
       }
       n.e > Y ? n.c = n.e = null : n.e < d && (n.c = [n.e = 0]);
     }
@@ -1250,41 +1250,41 @@ function kt(t) {
   }
   function j(n) {
     var a, i = n.e;
-    return i === null ? n.toString() : (a = oe(n.c), a = i <= L || i >= A ? Fe(a, i) : Se(a, i, "0"), n.s < 0 ? "-" + a : a);
+    return i === null ? n.toString() : (a = oe(n.c), a = i <= L || i >= A ? Fe(a, i) : be(a, i, "0"), n.s < 0 ? "-" + a : a);
   }
-  return N.absoluteValue = N.abs = function() {
+  return S.absoluteValue = S.abs = function() {
     var n = new R(this);
     return n.s < 0 && (n.s = 1), n;
-  }, N.comparedTo = function(n, a) {
+  }, S.comparedTo = function(n, a) {
     return Oe(this, new R(n, a));
-  }, N.decimalPlaces = N.dp = function(n, a) {
+  }, S.decimalPlaces = S.dp = function(n, a) {
     var i, h, u, p = this;
     if (n != null)
-      return q(n, 0, Z), a == null ? a = k : q(a, 0, 8), te(new R(p), n + p.e + 1, a);
+      return z(n, 0, Z), a == null ? a = k : z(a, 0, 8), te(new R(p), n + p.e + 1, a);
     if (!(i = p.c)) return null;
     if (h = ((u = i.length - 1) - le(this.e / U)) * U, u = i[u]) for (; u % 10 == 0; u /= 10, h--) ;
     return h < 0 && (h = 0), h;
-  }, N.dividedBy = N.div = function(n, a) {
+  }, S.dividedBy = S.div = function(n, a) {
     return o(this, new R(n, a), w, k);
-  }, N.dividedToIntegerBy = N.idiv = function(n, a) {
+  }, S.dividedToIntegerBy = S.idiv = function(n, a) {
     return o(this, new R(n, a), 0, 1);
-  }, N.exponentiatedBy = N.pow = function(n, a) {
-    var i, h, u, p, I, c, f, g, m, b = this;
+  }, S.exponentiatedBy = S.pow = function(n, a) {
+    var i, h, u, p, I, c, f, g, m, N = this;
     if (n = new R(n), n.c && !n.isInteger())
       throw Error(ne + "Exponent not an integer: " + j(n));
-    if (a != null && (a = new R(a)), c = n.e > 14, !b.c || !b.c[0] || b.c[0] == 1 && !b.e && b.c.length == 1 || !n.c || !n.c[0])
-      return m = new R(Math.pow(+j(b), c ? n.s * (2 - Ue(n)) : +j(n))), a ? m.mod(a) : m;
+    if (a != null && (a = new R(a)), c = n.e > 14, !N.c || !N.c[0] || N.c[0] == 1 && !N.e && N.c.length == 1 || !n.c || !n.c[0])
+      return m = new R(Math.pow(+j(N), c ? n.s * (2 - Ue(n)) : +j(n))), a ? m.mod(a) : m;
     if (f = n.s < 0, a) {
       if (a.c ? !a.c[0] : !a.s) return new R(NaN);
-      h = !f && b.isInteger() && a.isInteger(), h && (b = b.mod(a));
+      h = !f && N.isInteger() && a.isInteger(), h && (N = N.mod(a));
     } else {
-      if (n.e > 9 && (b.e > 0 || b.e < -1 || (b.e == 0 ? b.c[0] > 1 || c && b.c[1] >= 24e7 : b.c[0] < 8e13 || c && b.c[0] <= 9999975e7)))
-        return p = b.s < 0 && Ue(n) ? -0 : 0, b.e > -1 && (p = 1 / p), new R(f ? 1 / p : p);
-      ee && (p = qe(ee / U + 2));
+      if (n.e > 9 && (N.e > 0 || N.e < -1 || (N.e == 0 ? N.c[0] > 1 || c && N.c[1] >= 24e7 : N.c[0] < 8e13 || c && N.c[0] <= 9999975e7)))
+        return p = N.s < 0 && Ue(n) ? -0 : 0, N.e > -1 && (p = 1 / p), new R(f ? 1 / p : p);
+      ee && (p = ze(ee / U + 2));
     }
     for (c ? (i = new R(0.5), f && (n.s = 1), g = Ue(n)) : (u = Math.abs(+j(n)), g = u % 2), m = new R(D); ; ) {
       if (g) {
-        if (m = m.times(b), !m.c) break;
+        if (m = m.times(N), !m.c) break;
         p ? m.c.length > p && (m.c.length = p) : h && (m = m.mod(a));
       }
       if (u) {
@@ -1296,85 +1296,85 @@ function kt(t) {
         if (u = +j(n), u === 0) break;
         g = u % 2;
       }
-      b = b.times(b), p ? b.c && b.c.length > p && (b.c.length = p) : h && (b = b.mod(a));
+      N = N.times(N), p ? N.c && N.c.length > p && (N.c.length = p) : h && (N = N.mod(a));
     }
     return h ? m : (f && (m = D.div(m)), a ? m.mod(a) : p ? te(m, ee, k, I) : m);
-  }, N.integerValue = function(n) {
+  }, S.integerValue = function(n) {
     var a = new R(this);
-    return n == null ? n = k : q(n, 0, 8), te(a, a.e + 1, n);
-  }, N.isEqualTo = N.eq = function(n, a) {
+    return n == null ? n = k : z(n, 0, 8), te(a, a.e + 1, n);
+  }, S.isEqualTo = S.eq = function(n, a) {
     return Oe(this, new R(n, a)) === 0;
-  }, N.isFinite = function() {
+  }, S.isFinite = function() {
     return !!this.c;
-  }, N.isGreaterThan = N.gt = function(n, a) {
+  }, S.isGreaterThan = S.gt = function(n, a) {
     return Oe(this, new R(n, a)) > 0;
-  }, N.isGreaterThanOrEqualTo = N.gte = function(n, a) {
+  }, S.isGreaterThanOrEqualTo = S.gte = function(n, a) {
     return (a = Oe(this, new R(n, a))) === 1 || a === 0;
-  }, N.isInteger = function() {
+  }, S.isInteger = function() {
     return !!this.c && le(this.e / U) > this.c.length - 2;
-  }, N.isLessThan = N.lt = function(n, a) {
+  }, S.isLessThan = S.lt = function(n, a) {
     return Oe(this, new R(n, a)) < 0;
-  }, N.isLessThanOrEqualTo = N.lte = function(n, a) {
+  }, S.isLessThanOrEqualTo = S.lte = function(n, a) {
     return (a = Oe(this, new R(n, a))) === -1 || a === 0;
-  }, N.isNaN = function() {
+  }, S.isNaN = function() {
     return !this.s;
-  }, N.isNegative = function() {
+  }, S.isNegative = function() {
     return this.s < 0;
-  }, N.isPositive = function() {
+  }, S.isPositive = function() {
     return this.s > 0;
-  }, N.isZero = function() {
+  }, S.isZero = function() {
     return !!this.c && this.c[0] == 0;
-  }, N.minus = function(n, a) {
+  }, S.minus = function(n, a) {
     var i, h, u, p, I = this, c = I.s;
     if (n = new R(n, a), a = n.s, !c || !a) return new R(NaN);
     if (c != a)
       return n.s = -a, I.plus(n);
-    var f = I.e / U, g = n.e / U, m = I.c, b = n.c;
+    var f = I.e / U, g = n.e / U, m = I.c, N = n.c;
     if (!f || !g) {
-      if (!m || !b) return m ? (n.s = -a, n) : new R(b ? I : NaN);
-      if (!m[0] || !b[0])
-        return b[0] ? (n.s = -a, n) : new R(m[0] ? I : (
+      if (!m || !N) return m ? (n.s = -a, n) : new R(N ? I : NaN);
+      if (!m[0] || !N[0])
+        return N[0] ? (n.s = -a, n) : new R(m[0] ? I : (
           // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity
           k == 3 ? -0 : 0
         ));
     }
     if (f = le(f), g = le(g), m = m.slice(), c = f - g) {
-      for ((p = c < 0) ? (c = -c, u = m) : (g = f, u = b), u.reverse(), a = c; a--; u.push(0)) ;
+      for ((p = c < 0) ? (c = -c, u = m) : (g = f, u = N), u.reverse(), a = c; a--; u.push(0)) ;
       u.reverse();
     } else
-      for (h = (p = (c = m.length) < (a = b.length)) ? c : a, c = a = 0; a < h; a++)
-        if (m[a] != b[a]) {
-          p = m[a] < b[a];
+      for (h = (p = (c = m.length) < (a = N.length)) ? c : a, c = a = 0; a < h; a++)
+        if (m[a] != N[a]) {
+          p = m[a] < N[a];
           break;
         }
-    if (p && (u = m, m = b, b = u, n.s = -n.s), a = (h = b.length) - (i = m.length), a > 0) for (; a--; m[i++] = 0) ;
+    if (p && (u = m, m = N, N = u, n.s = -n.s), a = (h = N.length) - (i = m.length), a > 0) for (; a--; m[i++] = 0) ;
     for (a = pe - 1; h > c; ) {
-      if (m[--h] < b[h]) {
+      if (m[--h] < N[h]) {
         for (i = h; i && !m[--i]; m[i] = a) ;
         --m[i], m[h] += pe;
       }
-      m[h] -= b[h];
+      m[h] -= N[h];
     }
     for (; m[0] == 0; m.splice(0, 1), --g) ;
     return m[0] ? Le(n, m, g) : (n.s = k == 3 ? -1 : 1, n.c = [n.e = 0], n);
-  }, N.modulo = N.mod = function(n, a) {
+  }, S.modulo = S.mod = function(n, a) {
     var i, h, u = this;
     return n = new R(n, a), !u.c || !n.s || n.c && !n.c[0] ? new R(NaN) : !n.c || u.c && !u.c[0] ? new R(u) : (fe == 9 ? (h = n.s, n.s = 1, i = o(u, n, 0, 3), n.s = h, i.s *= h) : i = o(u, n, 0, fe), n = u.minus(i.times(n)), !n.c[0] && fe == 1 && (n.s = u.s), n);
-  }, N.multipliedBy = N.times = function(n, a) {
-    var i, h, u, p, I, c, f, g, m, b, _, C, x, X, z, M = this, $ = M.c, W = (n = new R(n, a)).c;
+  }, S.multipliedBy = S.times = function(n, a) {
+    var i, h, u, p, I, c, f, g, m, N, _, C, x, X, q, M = this, $ = M.c, W = (n = new R(n, a)).c;
     if (!$ || !W || !$[0] || !W[0])
       return !M.s || !n.s || $ && !$[0] && !W || W && !W[0] && !$ ? n.c = n.e = n.s = null : (n.s *= M.s, !$ || !W ? n.c = n.e = null : (n.c = [0], n.e = 0)), n;
-    for (h = le(M.e / U) + le(n.e / U), n.s *= M.s, f = $.length, b = W.length, f < b && (x = $, $ = W, W = x, u = f, f = b, b = u), u = f + b, x = []; u--; x.push(0)) ;
-    for (X = pe, z = Re, u = b; --u >= 0; ) {
-      for (i = 0, _ = W[u] % z, C = W[u] / z | 0, I = f, p = u + I; p > u; )
-        g = $[--I] % z, m = $[I] / z | 0, c = C * g + m * _, g = _ * g + c % z * z + x[p] + i, i = (g / X | 0) + (c / z | 0) + C * m, x[p--] = g % X;
+    for (h = le(M.e / U) + le(n.e / U), n.s *= M.s, f = $.length, N = W.length, f < N && (x = $, $ = W, W = x, u = f, f = N, N = u), u = f + N, x = []; u--; x.push(0)) ;
+    for (X = pe, q = Re, u = N; --u >= 0; ) {
+      for (i = 0, _ = W[u] % q, C = W[u] / q | 0, I = f, p = u + I; p > u; )
+        g = $[--I] % q, m = $[I] / q | 0, c = C * g + m * _, g = _ * g + c % q * q + x[p] + i, i = (g / X | 0) + (c / q | 0) + C * m, x[p--] = g % X;
       x[p] = i;
     }
     return i ? ++h : x.splice(0, 1), Le(n, x, h);
-  }, N.negated = function() {
+  }, S.negated = function() {
     var n = new R(this);
     return n.s = -n.s || null, n;
-  }, N.plus = function(n, a) {
+  }, S.plus = function(n, a) {
     var i, h = this, u = h.s;
     if (n = new R(n, a), a = n.s, !u || !a) return new R(NaN);
     if (u != a)
@@ -1391,19 +1391,19 @@ function kt(t) {
     for (u = c.length, a = f.length, u - a < 0 && (i = f, f = c, c = i, a = u), u = 0; a; )
       u = (c[--a] = c[a] + f[a] + u) / pe | 0, c[a] = pe === c[a] ? 0 : c[a] % pe;
     return u && (c = [u].concat(c), ++I), Le(n, c, I);
-  }, N.precision = N.sd = function(n, a) {
+  }, S.precision = S.sd = function(n, a) {
     var i, h, u, p = this;
     if (n != null && n !== !!n)
-      return q(n, 1, Z), a == null ? a = k : q(a, 0, 8), te(new R(p), n, a);
+      return z(n, 1, Z), a == null ? a = k : z(a, 0, 8), te(new R(p), n, a);
     if (!(i = p.c)) return null;
     if (u = i.length - 1, h = u * U + 1, u = i[u]) {
       for (; u % 10 == 0; u /= 10, h--) ;
       for (u = i[0]; u >= 10; u /= 10, h++) ;
     }
     return n && p.e + 1 > h && (h = p.e + 1), h;
-  }, N.shiftedBy = function(n) {
-    return q(n, -We, We), this.times("1e" + n);
-  }, N.squareRoot = N.sqrt = function() {
+  }, S.shiftedBy = function(n) {
+    return z(n, -We, We), this.times("1e" + n);
+  }, S.squareRoot = S.sqrt = function() {
     var n, a, i, h, u, p = this, I = p.c, c = p.s, f = p.e, g = w + 4, m = new R("0.5");
     if (c !== 1 || !I || !I[0])
       return new R(!c || c < 0 && (!I || I[0]) ? NaN : I ? p : 1 / 0);
@@ -1422,72 +1422,72 @@ function kt(t) {
           }
     }
     return te(i, i.e + w + 1, k, n);
-  }, N.toExponential = function(n, a) {
-    return n != null && (q(n, 0, Z), n++), ae(this, n, a, 1);
-  }, N.toFixed = function(n, a) {
-    return n != null && (q(n, 0, Z), n = n + this.e + 1), ae(this, n, a);
-  }, N.toFormat = function(n, a, i) {
+  }, S.toExponential = function(n, a) {
+    return n != null && (z(n, 0, Z), n++), ae(this, n, a, 1);
+  }, S.toFixed = function(n, a) {
+    return n != null && (z(n, 0, Z), n = n + this.e + 1), ae(this, n, a);
+  }, S.toFormat = function(n, a, i) {
     var h, u = this;
     if (i == null)
       n != null && a && typeof a == "object" ? (i = a, a = null) : n && typeof n == "object" ? (i = n, n = a = null) : i = Ie;
     else if (typeof i != "object")
       throw Error(ne + "Argument not an object: " + i);
     if (h = u.toFixed(n, a), u.c) {
-      var p, I = h.split("."), c = +i.groupSize, f = +i.secondaryGroupSize, g = i.groupSeparator || "", m = I[0], b = I[1], _ = u.s < 0, C = _ ? m.slice(1) : m, x = C.length;
+      var p, I = h.split("."), c = +i.groupSize, f = +i.secondaryGroupSize, g = i.groupSeparator || "", m = I[0], N = I[1], _ = u.s < 0, C = _ ? m.slice(1) : m, x = C.length;
       if (f && (p = c, c = f, f = p, x -= p), c > 0 && x > 0) {
         for (p = x % c || c, m = C.substr(0, p); p < x; p += c) m += g + C.substr(p, c);
         f > 0 && (m += g + C.slice(p)), _ && (m = "-" + m);
       }
-      h = b ? m + (i.decimalSeparator || "") + ((f = +i.fractionGroupSize) ? b.replace(
+      h = N ? m + (i.decimalSeparator || "") + ((f = +i.fractionGroupSize) ? N.replace(
         new RegExp("\\d{" + f + "}\\B", "g"),
         "$&" + (i.fractionGroupSeparator || "")
-      ) : b) : m;
+      ) : N) : m;
     }
     return (i.prefix || "") + h + (i.suffix || "");
-  }, N.toFraction = function(n) {
-    var a, i, h, u, p, I, c, f, g, m, b, _, C = this, x = C.c;
+  }, S.toFraction = function(n) {
+    var a, i, h, u, p, I, c, f, g, m, N, _, C = this, x = C.c;
     if (n != null && (c = new R(n), !c.isInteger() && (c.c || c.s !== 1) || c.lt(D)))
       throw Error(ne + "Argument " + (c.isInteger() ? "out of range: " : "not an integer: ") + j(c));
     if (!x) return new R(C);
     for (a = new R(D), g = i = new R(D), h = f = new R(D), _ = oe(x), p = a.e = _.length - C.e - 1, a.c[0] = Ke[(I = p % U) < 0 ? U + I : I], n = !n || c.comparedTo(a) > 0 ? p > 0 ? a : g : c, I = Y, Y = 1 / 0, c = new R(_), f.c[0] = 0; m = o(c, a, 0, 1), u = i.plus(m.times(h)), u.comparedTo(n) != 1; )
       i = h, h = u, g = f.plus(m.times(u = g)), f = u, a = c.minus(m.times(u = a)), c = u;
-    return u = o(n.minus(i), h, 0, 1), f = f.plus(u.times(g)), i = i.plus(u.times(h)), f.s = g.s = C.s, p = p * 2, b = o(g, h, p, k).minus(C).abs().comparedTo(
+    return u = o(n.minus(i), h, 0, 1), f = f.plus(u.times(g)), i = i.plus(u.times(h)), f.s = g.s = C.s, p = p * 2, N = o(g, h, p, k).minus(C).abs().comparedTo(
       o(f, i, p, k).minus(C).abs()
-    ) < 1 ? [g, h] : [f, i], Y = I, b;
-  }, N.toNumber = function() {
+    ) < 1 ? [g, h] : [f, i], Y = I, N;
+  }, S.toNumber = function() {
     return +j(this);
-  }, N.toPrecision = function(n, a) {
-    return n != null && q(n, 1, Z), ae(this, n, a, 2);
-  }, N.toString = function(n) {
+  }, S.toPrecision = function(n, a) {
+    return n != null && z(n, 1, Z), ae(this, n, a, 2);
+  }, S.toString = function(n) {
     var a, i = this, h = i.s, u = i.e;
-    return u === null ? h ? (a = "Infinity", h < 0 && (a = "-" + a)) : a = "NaN" : (n == null ? a = u <= L || u >= A ? Fe(oe(i.c), u) : Se(oe(i.c), u, "0") : n === 10 && _e ? (i = te(new R(i), w + u + 1, k), a = Se(oe(i.c), i.e, "0")) : (q(n, 2, Ae.length, "Base"), a = E(Se(oe(i.c), u, "0"), 10, n, h, !0)), h < 0 && i.c[0] && (a = "-" + a)), a;
-  }, N.valueOf = N.toJSON = function() {
+    return u === null ? h ? (a = "Infinity", h < 0 && (a = "-" + a)) : a = "NaN" : (n == null ? a = u <= L || u >= A ? Fe(oe(i.c), u) : be(oe(i.c), u, "0") : n === 10 && _e ? (i = te(new R(i), w + u + 1, k), a = be(oe(i.c), i.e, "0")) : (z(n, 2, Ae.length, "Base"), a = E(be(oe(i.c), u, "0"), 10, n, h, !0)), h < 0 && i.c[0] && (a = "-" + a)), a;
+  }, S.valueOf = S.toJSON = function() {
     return j(this);
-  }, N._isBigNumber = !0, N[Symbol.toStringTag] = "BigNumber", N[Symbol.for("nodejs.util.inspect.custom")] = N.valueOf, t != null && R.set(t), R;
+  }, S._isBigNumber = !0, S[Symbol.toStringTag] = "BigNumber", S[Symbol.for("nodejs.util.inspect.custom")] = S.valueOf, t != null && R.set(t), R;
 }
 function le(t) {
   var o = t | 0;
   return t > 0 || t === o ? o : o - 1;
 }
 function oe(t) {
-  for (var o, E, T = 1, N = t.length, D = t[0] + ""; T < N; ) {
+  for (var o, E, T = 1, S = t.length, D = t[0] + ""; T < S; ) {
     for (o = t[T++] + "", E = U - o.length; E--; o = "0" + o) ;
     D += o;
   }
-  for (N = D.length; D.charCodeAt(--N) === 48; ) ;
-  return D.slice(0, N + 1 || 1);
+  for (S = D.length; D.charCodeAt(--S) === 48; ) ;
+  return D.slice(0, S + 1 || 1);
 }
 function Oe(t, o) {
-  var E, T, N = t.c, D = o.c, w = t.s, k = o.s, L = t.e, A = o.e;
+  var E, T, S = t.c, D = o.c, w = t.s, k = o.s, L = t.e, A = o.e;
   if (!w || !k) return null;
-  if (E = N && !N[0], T = D && !D[0], E || T) return E ? T ? 0 : -k : w;
+  if (E = S && !S[0], T = D && !D[0], E || T) return E ? T ? 0 : -k : w;
   if (w != k) return w;
-  if (E = w < 0, T = L == A, !N || !D) return T ? 0 : !N ^ E ? 1 : -1;
+  if (E = w < 0, T = L == A, !S || !D) return T ? 0 : !S ^ E ? 1 : -1;
   if (!T) return L > A ^ E ? 1 : -1;
-  for (k = (L = N.length) < (A = D.length) ? L : A, w = 0; w < k; w++) if (N[w] != D[w]) return N[w] > D[w] ^ E ? 1 : -1;
+  for (k = (L = S.length) < (A = D.length) ? L : A, w = 0; w < k; w++) if (S[w] != D[w]) return S[w] > D[w] ^ E ? 1 : -1;
   return L == A ? 0 : L > A ^ E ? 1 : -1;
 }
-function q(t, o, E, T) {
+function z(t, o, E, T) {
   if (t < o || t > E || t !== ce(t))
     throw Error(ne + (T || "Argument") + (typeof t == "number" ? t < o || t > E ? " out of range: " : " not an integer: " : " not a primitive number: ") + String(t));
 }
@@ -1498,19 +1498,19 @@ function Ue(t) {
 function Fe(t, o) {
   return (t.length > 1 ? t.charAt(0) + "." + t.slice(1) : t) + (o < 0 ? "e" : "e+") + o;
 }
-function Se(t, o, E) {
-  var T, N;
+function be(t, o, E) {
+  var T, S;
   if (o < 0) {
-    for (N = E + "."; ++o; N += E) ;
-    t = N + t;
+    for (S = E + "."; ++o; S += E) ;
+    t = S + t;
   } else if (T = t.length, ++o > T) {
-    for (N = E, o -= T; --o; N += E) ;
-    t += N;
+    for (S = E, o -= T; --o; S += E) ;
+    t += S;
   } else o < T && (t = t.slice(0, o) + "." + t.slice(o));
   return t;
 }
-var Ti = kt();
-const yi = e.boolean().transform((t) => String(t)), Ri = e.string().transform((t) => t === "true");
+var yi = kt();
+const Ri = e.boolean().transform((t) => String(t)), vi = e.string().transform((t) => t === "true");
 var ot;
 (function(t) {
   t[t.function = 0] = "function", t[t.l1_handler = 1] = "l1_handler", t[t.constructor = 2] = "constructor";
@@ -1523,7 +1523,7 @@ const Ut = e.array(e.string()), Ye = e.object({
   CONSTRUCTOR: e.array(Ye),
   EXTERNAL: e.array(Ye),
   L1_HANDLER: e.array(Ye)
-}), vi = e.string(), En = e.object({
+}), Oi = e.string(), En = e.object({
   builtins: Ut,
   data: e.array(e.string())
 }), ct = e.object({
@@ -1540,24 +1540,24 @@ const Ut = e.array(e.string()), Ye = e.object({
   name: e.string(),
   type: e.union([e.literal("felt"), e.literal("felt*"), e.string()]),
   kind: e.union([e.literal("key"), e.literal("data")])
-}), Nn = e.object({
+}), Sn = e.object({
   name: e.string(),
   type: e.literal("event"),
   data: e.array(lt),
   keys: e.array(lt)
-}), Sn = e.object({
+}), bn = e.object({
   name: e.string(),
   members: e.array(lt),
   kind: e.literal("struct"),
   type: e.literal("event")
-}), bn = e.object({
+}), Nn = e.object({
   members: e.array(ct.and(e.object({
     offset: e.number()
   }))),
   name: e.string(),
   size: e.number(),
   type: e.literal("struct")
-}), Tn = e.union([Sn, Nn]), xt = e.array(e.union([An, Tn, bn, e.any()])), yn = e.object({
+}), Tn = e.union([bn, Sn]), xt = e.array(e.union([An, Tn, Nn, e.any()])), yn = e.object({
   program: En,
   entry_points_by_type: Ft,
   abi: xt
@@ -1585,13 +1585,13 @@ const Ut = e.array(e.string()), Ye = e.object({
   hints: e.array(e.any()),
   pythonic_hints: wn,
   entry_points_by_type: Ft
-}), Oi = _n, wi = e.union([
+}), wi = _n, _i = e.union([
   yn,
   On
-]), Mt = Br(null), Gt = () => Mr(Mt), _i = () => {
+]), Mt = Br(null), Gt = () => Mr(Mt), Li = () => {
   var t;
   return !!((t = Gt()) != null && t.emitter);
-}, Li = ({ emitter: t, children: o }) => /* @__PURE__ */ xr(Mt.Provider, { value: {
+}, Ci = ({ emitter: t, children: o }) => /* @__PURE__ */ xr(Mt.Provider, { value: {
   emitter: t
 }, children: o });
 let Rt = !1;
@@ -1603,10 +1603,10 @@ const Vt = () => {
     return;
   }
   return t;
-}, Ci = () => {
+}, Di = () => {
   const t = Vt();
   return t ? t.emit.bind(t) : kr;
-}, Di = () => {
+}, Pi = () => {
   const t = Vt();
   return (E, T) => {
     Gr(() => t ? t.on(E, T) : void 0, [E, T]);
@@ -1667,8 +1667,8 @@ ue.prototype.mainError = function() {
   if (this._errors.length === 0)
     return null;
   for (var t = {}, o = null, E = 0, T = 0; T < this._errors.length; T++) {
-    var N = this._errors[T], D = N.message, w = (t[D] || 0) + 1;
-    t[D] = w, w >= E && (o = N, E = w);
+    var S = this._errors[T], D = S.message, w = (t[D] || 0) + 1;
+    t[D] = w, w >= E && (o = S, E = w);
   }
   return o;
 };
@@ -1691,8 +1691,8 @@ ue.prototype.mainError = function() {
       maxTimeout: 1 / 0,
       randomize: !1
     };
-    for (var N in E)
-      T[N] = E[N];
+    for (var S in E)
+      T[S] = E[S];
     if (T.minTimeout > T.maxTimeout)
       throw new Error("minTimeout is greater than maxTimeout");
     for (var D = [], w = 0; w < T.retries; w++)
@@ -1701,16 +1701,16 @@ ue.prototype.mainError = function() {
       return k - L;
     }), D;
   }, t.createTimeout = function(E, T) {
-    var N = T.randomize ? Math.random() + 1 : 1, D = Math.round(N * Math.max(T.minTimeout, 1) * Math.pow(T.factor, E));
+    var S = T.randomize ? Math.random() + 1 : 1, D = Math.round(S * Math.max(T.minTimeout, 1) * Math.pow(T.factor, E));
     return D = Math.min(D, T.maxTimeout), D;
-  }, t.wrap = function(E, T, N) {
-    if (T instanceof Array && (N = T, T = null), !N) {
-      N = [];
+  }, t.wrap = function(E, T, S) {
+    if (T instanceof Array && (S = T, T = null), !S) {
+      S = [];
       for (var D in E)
-        typeof E[D] == "function" && N.push(D);
+        typeof E[D] == "function" && S.push(D);
     }
-    for (var w = 0; w < N.length; w++) {
-      var k = N[w], L = E[k];
+    for (var w = 0; w < S.length; w++) {
+      var k = S[w], L = E[k];
       E[k] = (function(d) {
         var Y = t.operation(T), P = Array.prototype.slice.call(arguments, 1), fe = P.pop();
         P.push(function(ee) {
@@ -1726,7 +1726,7 @@ var ut;
 (function(t) {
   t.NO_TOKEN_API_URL = "NO_TOKEN_API_URL is not defined", t.NO_TOKEN_PRICE_API_URL = "NO_TOKEN_PRICE_API_URL is not defined", t.TOKENS_DEFI_DECOMPOSITION_URL = "TOKENS_DEFI_DECOMPOSITION_URL is not defined", t.TOKENS_AIRDROPS_API_URL = "TOKENS_AIRDROPS_API_URL is not defined", t.TOKEN_PARSING_ERROR = "Unable to parse token data response", t.TOKEN_PRICE_PARSING_ERROR = "Unable to parse token price response", t.TOKEN_DEFI_DECOMPOSITION_PARSING_ERROR = "Unable to parse token defi decomposition response", t.TOKEN_PRICE_NOT_FOUND = "Token price not found", t.TOKEN_NOT_FOUND = "Token not found", t.TOKEN_DETAILS_NOT_FOUND = "Token details not found", t.FEE_TOKEN_NOT_FOUND = "Fee token not found", t.UNABLE_TO_CALCULATE_CURRENCY_VALUE = "Unable to calculate currency value", t.UNSAFE_DECIMALS = "Unsafe decimals in token";
 })(ut || (ut = {}));
-class Pi extends we {
+class ji extends we {
   constructor(o) {
     super(o, ut), this.name = "TokenError";
   }
@@ -1734,7 +1734,7 @@ class Pi extends we {
 const $t = e.union([
   e.literal("concentratedLiquidityPosition"),
   e.literal("collateralizedDebtPosition")
-]), ji = e.object({
+]), ki = e.object({
   status: e.literal("initialising")
 }).or(e.object({
   status: e.literal("initialised"),
@@ -1769,15 +1769,15 @@ const $t = e.union([
     rank: e.number()
   }).optional(),
   tags: e.array(e.string()).optional()
-}), ki = e.object({
+}), Ui = e.object({
   tokens: e.array(Pe)
-}), Ui = Pe, Xt = e.object({
+}), Fi = Pe, Xt = e.object({
   pricingId: e.number(),
   ethValue: e.string(),
   ccyValue: e.string(),
   ethDayChange: e.string(),
   ccyDayChange: e.string()
-}), Fi = e.object({
+}), xi = e.object({
   prices: e.array(Xt)
 }), vt = e.object({
   tokenAddress: H,
@@ -1789,7 +1789,7 @@ const $t = e.union([
 }), Ht = e.object({
   tokenAddress: K.optional(),
   totalBalances: e.record(e.string())
-}), zt = Ht.extend({
+}), qt = Ht.extend({
   tokenId: e.string(),
   data: e.object({
     poolFeePercentage: e.string(),
@@ -1797,7 +1797,7 @@ const $t = e.union([
     token0: vt,
     token1: vt
   })
-}), xi = e.array(zt), qt = Ht.extend({
+}), Bi = e.array(qt), zt = Ht.extend({
   data: e.object({
     apy: e.string().optional(),
     group: e.number().optional(),
@@ -1805,7 +1805,7 @@ const $t = e.union([
     debt: e.boolean(),
     lending: e.boolean()
   })
-}), Bi = e.array(qt), Dn = e.array(zt.or(qt)), Pn = e.object({
+}), Mi = e.array(zt), Dn = e.array(qt.or(zt)), Pn = e.object({
   name: e.string(),
   manageUrl: e.string(),
   type: $t,
@@ -1817,7 +1817,7 @@ const $t = e.union([
 }), jn = e.object({
   dappId: e.string(),
   products: e.array(Pn)
-}), Mi = e.object({
+}), Gi = e.object({
   dapps: e.array(jn)
 }), kn = e.object({
   name: e.string().optional(),
@@ -1826,18 +1826,16 @@ const $t = e.union([
   claimUrl: e.string().optional(),
   claimStart: e.number(),
   claimEnd: e.number().optional()
-}), Gi = e.object({
+}), Vi = e.object({
   accountAddress: K,
   chain: e.string(),
   airdrops: e.array(kn)
 }), He = e.object({
   address: K,
   networkId: e.string({ required_error: "Network is required" })
-}, { required_error: "BaseToken is required" });
-He.required().extend({
+}, { required_error: "WebBaseToken is required" }), $i = He.required().extend({
   balance: e.string()
-});
-const Wt = He.required().extend({
+}), Wt = He.required().extend({
   id: e.number().optional(),
   name: e.string().optional(),
   symbol: e.string().optional(),
@@ -1852,20 +1850,17 @@ const Wt = He.required().extend({
   balance: e.string()
 }), Fn = Wt.extend({
   currencyValue: e.string(),
+  currencySymbol: e.string().optional(),
   ccyDayChange: e.string().optional(),
   ethDayChange: e.string().optional(),
   unitCurrencyValue: e.string().optional()
 }), Et = Fn.extend({
   ...Un.shape
-});
-e.array(Et);
-He.extend({
+}), Xi = e.array(Et), Hi = He.extend({
   ...Xt.shape
-});
-He.extend({
+}), qi = He.extend({
   ...Pe.shape
-});
-const Ot = Et.extend({
+}), Ot = Et.extend({
   accruedFees: e.string(),
   currentPrice: e.string(),
   maxPrice: e.string(),
@@ -1882,7 +1877,7 @@ const Ot = Et.extend({
   unitCurrencyValueToken1: e.string().optional(),
   token0: Ot,
   token1: Ot
-}), Vi = e.array(Yt), $i = e.object({
+}), zi = e.array(Yt), Wi = e.object({
   name: e.string().optional(),
   healthRatio: e.string().optional(),
   accountAddress: K.optional()
@@ -1898,7 +1893,7 @@ const Ot = Et.extend({
   token: Et.optional(),
   accountAddress: K.optional(),
   accountAddressGroup: e.string().optional()
-}), Xi = e.array(Zt), xn = Yt.or(Zt), Bn = e.record(e.object({
+}), Ki = e.array(Zt), xn = Yt.or(Zt), Bn = e.record(e.object({
   name: e.string().optional(),
   healthRatio: e.string().optional(),
   accountAddress: K.optional()
@@ -1912,7 +1907,7 @@ const Ot = Et.extend({
   brandColor: e.string().optional(),
   groups: Bn.optional(),
   accountAddress: K
-}), Gn = e.array(Mn), Hi = e.object({
+}), Gn = e.array(Mn), Yi = e.object({
   dappId: e.string(),
   products: Gn
 }), Vn = e.object({
@@ -1923,7 +1918,7 @@ const Ot = Et.extend({
   claimUrl: e.string().optional(),
   claimStart: e.number(),
   claimEnd: e.number().optional()
-}), zi = e.array(Vn), $n = (t, o = 18) => Vr(t.replace(",", "."), Number(o)), Xn = e.string().trim().refine((t) => t !== "", {
+}), Zi = e.array(Vn), $n = (t, o = 18) => Vr(t.replace(",", "."), Number(o)), Xn = e.string().trim().refine((t) => t !== "", {
   message: "Amount is required"
 }).refine((t) => {
   try {
@@ -1938,7 +1933,7 @@ const Ot = Et.extend({
     throw new Error("Amount should be a number");
   }
   return !0;
-}, { message: "Invalid amount" }), qi = (t) => !!Xn.parse(t), Hn = e.object({
+}, { message: "Invalid amount" }), Ji = (t) => !!Xn.parse(t), Hn = e.object({
   data: e.object({
     code: e.string().optional(),
     // "STARKNAME_NOT_FOUND",
@@ -1947,29 +1942,29 @@ const Ot = Et.extend({
     message: e.string()
     // "foo.stark not found"
   })
-}), Wi = (t) => {
+}), Qi = (t) => {
   const o = Hn.safeParse(t);
   if (o.success)
     return o.data.data.message;
-}, zn = 3, Jt = process.env.FEE_OVERHEAD ? parseFloat(process.env.FEE_OVERHEAD) : zn, qn = 1.5, Ge = 10, Wn = ({ estimatedFee: t, overheadMultiplier: o = Jt }) => {
-  const T = be.toBigInt(t) * BigInt(o * Ge) / BigInt(Ge);
-  return be.toHex(T);
-}, Ki = ({ suggestedMaxFee: t, overheadMultiplier: o = Jt, starknetJsOverheadMultiplier: E = qn }) => {
-  const N = be.toBigInt(t) * BigInt(Ge) / BigInt(E * Ge);
-  return Wn({ estimatedFee: N, overheadMultiplier: o });
+}, qn = 3, Jt = process.env.FEE_OVERHEAD ? parseFloat(process.env.FEE_OVERHEAD) : qn, zn = 1.5, Ge = 10, Wn = ({ estimatedFee: t, overheadMultiplier: o = Jt }) => {
+  const T = Ne.toBigInt(t) * BigInt(o * Ge) / BigInt(Ge);
+  return Ne.toHex(T);
+}, es = ({ suggestedMaxFee: t, overheadMultiplier: o = Jt, starknetJsOverheadMultiplier: E = zn }) => {
+  const S = Ne.toBigInt(t) * BigInt(Ge) / BigInt(E * Ge);
+  return Wn({ estimatedFee: S, overheadMultiplier: o });
 };
 var ft;
 (function(t) {
   t.SIMULATE_AND_REVIEW_FAILED = "Missing simulation";
 })(ft || (ft = {}));
-class Yi extends we {
+class ts extends we {
   constructor(o) {
     super(o, ft), this.name = "EstimateError";
   }
 }
-const Zi = e.object({
+const rs = e.object({
   type: e.enum(["DECLARE", "DEPLOY", "DEPLOY_ACCOUNT", "INVOKE"]).default("INVOKE"),
-  calls: e.array(bt).or(bt).optional(),
+  calls: e.array(Nt).or(Nt).optional(),
   calldata: e.array(e.string()).optional(),
   classHash: Me.optional(),
   salt: Me.optional(),
@@ -2176,17 +2171,17 @@ const Zi = e.object({
   reviewOfTransaction: rr,
   simulation: e.undefined(),
   simulationError: la
-}), sr = ar.or(ir), Ji = e.object({
+}), sr = ar.or(ir), ns = e.object({
   transactions: e.array(sr)
-}), Qi = e.object({
+}), as = e.object({
   transactions: e.array(sr),
   enrichedFeeEstimation: Yn.optional(),
   isBackendDown: e.boolean().default(!1).optional()
 });
-function es(t) {
+function is(t) {
   return ar.safeParse(t).success;
 }
-function ts(t) {
+function ss(t) {
   return ir.safeParse(t).success;
 }
 const or = e.object({
@@ -2241,11 +2236,19 @@ const or = e.object({
   name: e.string(),
   parameters: e.array(e.unknown()).optional()
 }), da = e.object({
+  guid: e.string().optional(),
+  signerType: e.string().optional(),
+  // StarknetKey, Secp256k1, Secp256r1, Eip191, Webauthn
+  signer: e.object({
+    publicKey: e.string().optional()
+  }).optional()
+}), ga = e.object({
   activeAt: e.string().optional(),
+  newGuardian: e.string().optional(),
   newImplementation: e.string().optional(),
   newVersion: e.string().optional(),
   signerGuid: e.string().optional(),
-  signers: e.string().array().optional()
+  signers: e.array(da).optional()
 }), Ct = e.discriminatedUnion("type", [
   e.object({
     type: e.literal("deploy"),
@@ -2273,7 +2276,7 @@ const or = e.object({
   e.object({
     type: e.literal("security"),
     action: cr,
-    context: da.optional()
+    context: ga.optional()
   }),
   e.object({
     type: e.literal("dappInteraction"),
@@ -2281,7 +2284,7 @@ const or = e.object({
     function: ma.optional().nullable()
     // This object is often null. It happens when we were unable to get the ABI or failed decoding the function call
   })
-]), ga = e.union([
+]), Ea = e.union([
   Ct,
   e.object({
     type: e.literal("multicall"),
@@ -2289,7 +2292,7 @@ const or = e.object({
       details: Ct
     }))
   })
-]), Ea = e.object({
+]), Ia = e.object({
   dappId: e.string(),
   name: e.string().optional().nullable()
 }), lr = e.object({
@@ -2315,7 +2318,7 @@ const or = e.object({
       }).optional().nullable()
     })
   ])
-}), Ia = e.object({
+}), Aa = e.object({
   type: e.string(),
   // "gas" for example
   to: H,
@@ -2342,25 +2345,25 @@ const or = e.object({
   transaction: or,
   transfers: e.array(ua),
   // to be clarified
-  fees: e.array(Ia).optional(),
+  fees: e.array(Aa).optional(),
   relatedAddresses: e.array(fa).nullable(),
   network: e.string(),
   networkDetails: pa.optional(),
-  details: ga,
+  details: Ea,
   transferSummary: e.array(lr).optional(),
-  dapp: Ea.optional(),
+  dapp: Ia.optional(),
   actions: e.array(Qt).optional(),
   title: e.string().optional(),
   multisigDetails: e.object({
     signers: e.array(H)
   }).optional()
-}), Aa = e.object({
+}), Sa = e.object({
   title: e.string().optional(),
   shortTitle: e.string().optional(),
   subtitle: e.string().optional(),
   /** let's not import the keys from x-ui here */
   icon: e.string().optional()
-}), Na = "native", Sa = "rejected", ba = "cancelled", Ta = "queued", rs = fr.pick({
+}), ba = "native", Na = "rejected", Ta = "cancelled", ya = "queued", os = fr.pick({
   status: !0,
   actions: !0,
   submitted: !0,
@@ -2372,36 +2375,36 @@ const or = e.object({
   status: e.union([
     ur,
     e.enum([
-      Sa,
-      ba,
-      Ta
+      Na,
+      Ta,
+      ya
     ])
   ]),
-  type: e.literal(Na),
+  type: e.literal(ba),
   transaction: or.pick({
     hash: !0
   }),
   dapp: tr.optional(),
-  meta: Aa.optional()
-}), ya = e.array(fr), ns = e.object({
-  activities: ya,
+  meta: Sa.optional()
+}), Ra = e.array(fr), cs = e.object({
+  activities: Ra,
   page: e.number(),
   pageSize: e.number(),
   totalElements: e.number(),
   totalPages: e.number()
 });
-function as(t) {
+function ls(t) {
   return cr.safeParse(t).success;
 }
-const pr = (t) => lr.safeParse(t).success, is = (t) => pr(t) && t.asset.type === "token", ss = (t) => pr(t) && t.asset.type === "nft", Dt = {
-  Transfer: Nt.getSelectorFromName("Transfer"),
+const pr = (t) => lr.safeParse(t).success, us = (t) => pr(t) && t.asset.type === "token", fs = (t) => pr(t) && t.asset.type === "nft", Dt = {
+  Transfer: St.getSelectorFromName("Transfer"),
   // 0x99cd8bde557814842a3121e8ddfd433a539b8c9f14bf31ebf108d12e6196e9
-  Approval: Nt.getSelectorFromName("Approval")
+  Approval: St.getSelectorFromName("Approval")
   // 0x134692b230b9e1ffa39098904722134159652b09c5bc41d88d6698779d228ff
-}, Ra = (t, o, E) => {
+}, va = (t, o, E) => {
   for (const T of t) {
-    const { events: N, internal_calls: D } = T;
-    for (const w of N)
+    const { events: S, internal_calls: D } = T;
+    for (const w of S)
       for (const k of w.keys)
         k === Dt.Approval && o.push({
           tokenAddress: K.parse(T.contract_address),
@@ -2414,13 +2417,13 @@ const pr = (t) => lr.safeParse(t).success, is = (t) => pr(t) && t.asset.type ===
           to: w.data[1],
           value: Qe.uint256ToBN({ low: w.data[2], high: w.data[3] }).toString()
         });
-    D && Ra(D, o, E);
+    D && va(D, o, E);
   }
   return { approvals: o, transfers: E };
-}, va = /(0x[a-fA-F0-9]+)\s*\('(.*?)'\)/, os = (t) => {
+}, Oa = /(0x[a-fA-F0-9]+)\s*\('(.*?)'\)/, ps = (t) => {
   if (!Ur(t))
     return;
-  const o = t.match(va);
+  const o = t.match(Oa);
   if (o && !Fr(o[2]))
     return o[2];
 };
@@ -2428,226 +2431,235 @@ var pt;
 (function(t) {
   t.SIMULATE_AND_REVIEW_FAILED = "Something went wrong fetching review", t.NO_CALLS_FOUND = "No calls found", t.ONCHAIN_FEE_ESTIMATION_FAILED = "Failed to estimate fees onchain";
 })(pt || (pt = {}));
-class cs extends we {
+class hs extends we {
   constructor(o) {
     super(o, pt), this.name = "ReviewError";
   }
 }
-const ls = e.object({
+const ms = e.object({
   reason: e.string(),
   severity: e.string().optional(),
   title: e.string(),
   description: e.string().optional()
-}), Oa = Object.values(xe.TRANSACTION_VERSION), us = e.string().default("0x3").refine((t) => {
-  const o = be.toBigInt(t);
-  return Oa.map((E) => be.toBigInt(E)).includes(o);
-}).transform((t) => be.toHex(t));
-function fs(t) {
+}), wa = Object.values(xe.TRANSACTION_VERSION), ds = e.string().default("0x3").refine((t) => {
+  const o = Ne.toBigInt(t);
+  return wa.map((E) => Ne.toBigInt(E)).includes(o);
+}).transform((t) => Ne.toHex(t));
+function gs(t) {
   if (t === xe.TRANSACTION_VERSION.V3 || t === xe.TRANSACTION_VERSION.F3)
     throw Error("Only txv1 is supported");
 }
 export {
-  xa as $,
+  Ba as $,
   ke as A,
-  Ti as B,
-  ni as C,
-  Ui as D,
-  ji as E,
-  Mi as F,
-  Ka as G,
+  yi as B,
+  ai as C,
+  Fi as D,
+  ki as E,
+  Gi as F,
+  Ya as G,
   dt as H,
-  Wa as I,
-  mi as J,
+  Ka as I,
+  di as J,
   sa as K,
-  Yi as L,
+  ts as L,
   Tt as M,
-  ai as N,
+  ii as N,
   Wn as O,
-  Ji as P,
-  ts as Q,
-  cs as R,
-  ei as S,
-  Pi as T,
+  ns as P,
+  ss as Q,
+  hs as R,
+  ti as S,
+  ji as T,
   jt as U,
   $r as V,
   Ve as W,
   Xr as X,
   Hr as Y,
-  Ua as Z,
-  Fa as _,
-  St as a,
-  us as a$,
-  Ba as a0,
-  Ma as a1,
-  Ga as a2,
+  Fa as Z,
+  xa as _,
+  bt as a,
+  Qi as a$,
+  Ma as a0,
+  Ga as a1,
+  Va as a2,
   mt as a3,
-  $a as a4,
-  Xa as a5,
-  Ha as a6,
+  Xa as a4,
+  Ha as a5,
+  qa as a6,
   za as a7,
-  qa as a8,
-  Va as a9,
-  Gi as aA,
+  Wa as a8,
+  $a as a9,
+  Vi as aA,
   Yt as aB,
-  Vi as aC,
-  $i as aD,
+  zi as aC,
+  Wi as aD,
   Zt as aE,
-  Xi as aF,
+  Ki as aF,
   xn as aG,
   Bn as aH,
   Mn as aI,
   Gn as aJ,
-  Hi as aK,
+  Yi as aK,
   $t as aL,
   Vn as aM,
-  zi as aN,
-  $n as aO,
-  Xn as aP,
-  qi as aQ,
-  Hn as aR,
-  Wi as aS,
-  Jt as aT,
-  Ki as aU,
-  ft as aV,
-  Zi as aW,
-  Dt as aX,
-  Ra as aY,
-  os as aZ,
-  ls as a_,
+  Zi as aN,
+  He as aO,
+  $i as aP,
+  Wt as aQ,
+  Un as aR,
+  Fn as aS,
+  Et as aT,
+  Xi as aU,
+  Hi as aV,
+  qi as aW,
+  $n as aX,
+  Xn as aY,
+  Ji as aZ,
+  Hn as a_,
   Zr as aa,
   Xe as ab,
   Qr as ac,
   et as ad,
   rn as ae,
-  Ya as af,
-  Za as ag,
-  Ja as ah,
-  Qa as ai,
-  ti as aj,
+  Za as af,
+  Ja as ag,
+  Qa as ah,
+  ei as ai,
+  ri as aj,
   tn as ak,
   tt as al,
   we as am,
   ut as an,
   Pe as ao,
   Xt as ap,
-  Fi as aq,
+  xi as aq,
   vt as ar,
-  zt as as,
-  xi as at,
-  qt as au,
-  Bi as av,
+  qt as as,
+  Bi as at,
+  zt as au,
+  Mi as av,
   Dn as aw,
   Pn as ax,
   jn as ay,
   kn as az,
-  qr as b,
-  Aa as b$,
-  fs as b0,
-  bi as b1,
-  pn as b2,
-  yi as b3,
-  Ri as b4,
-  De as b5,
-  sn as b6,
-  on as b7,
-  cn as b8,
-  Be as b9,
-  Tn as bA,
-  xt as bB,
-  yn as bC,
-  Bt as bD,
-  Rn as bE,
-  Ze as bF,
-  vn as bG,
-  On as bH,
-  wn as bI,
-  _n as bJ,
-  Oi as bK,
-  wi as bL,
-  Gt as bM,
-  _i as bN,
-  Li as bO,
-  Vt as bP,
-  Ci as bQ,
-  Di as bR,
-  pr as bS,
-  lr as bT,
-  Na as bU,
-  rs as bV,
-  ua as bW,
-  ga as bX,
-  Ea as bY,
-  Ia as bZ,
-  fr as b_,
-  ln as ba,
-  gt as bb,
-  un as bc,
-  fn as bd,
-  he as be,
-  ii as bf,
-  si as bg,
-  oi as bh,
-  ci as bi,
-  li as bj,
-  ui as bk,
-  fi as bl,
-  pi as bm,
-  hi as bn,
-  Ut as bo,
-  Ye as bp,
-  Ft as bq,
-  vi as br,
-  En as bs,
-  ct as bt,
-  In as bu,
-  An as bv,
-  lt as bw,
-  Nn as bx,
-  Sn as by,
-  bn as bz,
-  bt as c,
-  Sa as c0,
+  zr as b,
+  pr as b$,
+  Jt as b0,
+  es as b1,
+  ft as b2,
+  rs as b3,
+  Dt as b4,
+  va as b5,
+  ps as b6,
+  ms as b7,
+  ds as b8,
+  gs as b9,
+  Oi as bA,
+  En as bB,
+  ct as bC,
+  In as bD,
+  An as bE,
+  lt as bF,
+  Sn as bG,
+  bn as bH,
+  Nn as bI,
+  Tn as bJ,
+  xt as bK,
+  yn as bL,
+  Bt as bM,
+  Rn as bN,
+  Ze as bO,
+  vn as bP,
+  On as bQ,
+  wn as bR,
+  _n as bS,
+  wi as bT,
+  _i as bU,
+  Gt as bV,
+  Li as bW,
+  Ci as bX,
+  Vt as bY,
+  Di as bZ,
+  Pi as b_,
+  Ti as ba,
+  pn as bb,
+  Ri as bc,
+  vi as bd,
+  De as be,
+  sn as bf,
+  on as bg,
+  cn as bh,
+  Be as bi,
+  ln as bj,
+  gt as bk,
+  un as bl,
+  fn as bm,
+  he as bn,
+  si as bo,
+  oi as bp,
+  ci as bq,
+  li as br,
+  ui as bs,
+  fi as bt,
+  pi as bu,
+  hi as bv,
+  mi as bw,
+  Ut as bx,
+  Ye as by,
+  Ft as bz,
+  Nt as c,
+  lr as c0,
   ba as c1,
-  Ta as c2,
-  ya as c3,
-  ns as c4,
-  as as c5,
-  is as c6,
-  ss as c7,
-  wt as c8,
-  Yn as c9,
-  _t as ca,
-  Qt as cb,
-  ea as cc,
-  ta as cd,
-  er as ce,
-  ra as cf,
-  tr as cg,
-  Qi as ch,
-  es as ci,
-  Zn as cj,
-  Jn as ck,
-  zr as d,
+  os as c2,
+  ua as c3,
+  Ea as c4,
+  Ia as c5,
+  Aa as c6,
+  fr as c7,
+  Sa as c8,
+  Na as c9,
+  Ta as ca,
+  ya as cb,
+  Ra as cc,
+  cs as cd,
+  ls as ce,
+  us as cf,
+  fs as cg,
+  wt as ch,
+  Yn as ci,
+  _t as cj,
+  Qt as ck,
+  ea as cl,
+  ta as cm,
+  er as cn,
+  ra as co,
+  tr as cp,
+  as as cq,
+  is as cr,
+  Zn as cs,
+  Jn as ct,
+  qr as d,
   en as e,
   Jr as f,
-  ri as g,
+  ni as g,
   Kr as h,
   Yr as i,
-  di as j,
-  Ai as k,
-  Ii as l,
-  gi as m,
+  gi as j,
+  Si as k,
+  Ai as l,
+  Ei as m,
   $e as n,
-  Ei as o,
+  Ii as o,
   Vr as p,
   H as q,
   ht as r,
-  Ni as s,
+  bi as s,
   K as t,
   an as u,
-  Si as v,
+  Ni as v,
   Me as w,
   Ln as x,
   mn as y,
-  ki as z
+  Ui as z
 };