@argent/x-shared 1.33.0 → 1.33.2

package/dist/index.mjs

@@ -1,6 +1,6 @@
 import F, { z as h } from "zod";
-import { p as xt, H as K, a as tn, u as k, N as jn, c as Dr, C as Ln, A as St, i as Hr, b as Vr, n as Dn, d as Mr, e as Gr, f as zr, g as qr, s as Q, h as nt, j as en, k as Wr, S as Kr, l as nn, M as rn, m as Zr, o as Yr, q as Hn, r as Xr, t as se, B as sn, v as oe, w as Pt, x as Jr, y as Qr, z as ts, D as es, E as ns, F as rs, T as ss, G as Re, I as Vn, J as os, K as ye, L as as, O as is, P as cs, Q as ls, R as _t } from "./transactionVersion-xln1MPWP.mjs";
-import { am as Nd, aV as Cd, bO as Od, aX as kd, aT as Pd, an as Rd, af as $d, ah as Fd, ag as Ud, ai as jd, bt as Ld, bB as Dd, bh as Hd, bl as Vd, a9 as Md, aa as Gd, a5 as zd, a4 as qd, Z as Wd, W as Kd, X as Zd, Y as Yd, aM as Xd, az as Jd, au as Qd, av as tf, as as ef, at as nf, ax as rf, aw as sf, ay as of, ar as af, aq as cf, ap as lf, ao as uf, aA as df, aj as ff, ab as hf, b1 as pf, b5 as mf, b3 as gf, bo as wf, bD as yf, by as bf, bJ as Sf, ae as Ef, bd as Af, b7 as xf, bf as vf, bk as If, aD as Tf, aE as Bf, aF as _f, bL as Nf, bK as Cf, bH as Of, br as kf, aB as Pf, aC as Rf, bp as $f, aK as Ff, aG as Uf, aL as jf, aI as Lf, aJ as Df, b0 as Hf, bq as Vf, bg as Mf, bA as Gf, bw as zf, bn as qf, be as Wf, aY as Kf, $ as Zf, _ as Yf, a1 as Xf, a2 as Jf, bv as Qf, bu as th, aS as eh, aZ as nh, b2 as rh, a0 as sh, aP as oh, ac as ah, a7 as ih, ak as ch, a6 as lh, aQ as uh, bC as dh, bx as fh, bc as hh, aU as ph, b9 as mh, a8 as gh, ad as wh, al as yh, aO as bh, aH as Sh, bs as Eh, bI as Ah, b8 as xh, ba as vh, bb as Ih, bi as Th, bm as Bh, bj as _h, bF as Nh, bG as Ch, bE as Oh, a3 as kh, b4 as Ph, bz as Rh, aW as $h, a_ as Fh, aR as Uh, a$ as jh, b6 as Lh, aN as Dh, bQ as Hh, bP as Vh, bM as Mh, bR as Gh, bN as zh, U as qh, V as Wh } from "./transactionVersion-xln1MPWP.mjs";
+import { p as xt, H as K, a as tn, u as k, N as jn, c as Dr, C as Ln, A as St, i as Hr, b as Vr, n as Dn, d as Mr, e as Gr, f as zr, g as qr, s as Q, h as nt, j as en, k as Wr, S as Kr, l as nn, M as rn, m as Zr, o as Yr, q as Hn, r as Xr, t as se, B as sn, v as oe, w as Pt, x as Jr, y as Qr, z as ts, D as es, E as ns, F as rs, T as ss, G as Re, I as Vn, J as os, K as ye, L as as, O as is, P as cs, Q as ls, R as _t } from "./transactionVersion-BxOdbj7v.mjs";
+import { am as Nd, aV as Cd, bO as Od, aX as kd, aT as Pd, an as Rd, af as $d, ah as Fd, ag as Ud, ai as jd, bt as Ld, bB as Dd, bh as Hd, bl as Vd, a9 as Md, aa as Gd, a5 as zd, a4 as qd, Z as Wd, W as Kd, X as Zd, Y as Yd, aM as Xd, az as Jd, au as Qd, av as tf, as as ef, at as nf, ax as rf, aw as sf, ay as of, ar as af, aq as cf, ap as lf, ao as uf, aA as df, aj as ff, ab as hf, b1 as pf, b5 as mf, b3 as gf, bo as wf, bD as yf, by as bf, bJ as Sf, ae as Ef, bd as Af, b7 as xf, bf as vf, bk as If, aD as Tf, aE as Bf, aF as _f, bL as Nf, bK as Cf, bH as Of, br as kf, aB as Pf, aC as Rf, bp as $f, aK as Ff, aG as Uf, aL as jf, aI as Lf, aJ as Df, b0 as Hf, bq as Vf, bg as Mf, bA as Gf, bw as zf, bn as qf, be as Wf, aY as Kf, $ as Zf, _ as Yf, a1 as Xf, a2 as Jf, bv as Qf, bu as th, aS as eh, aZ as nh, b2 as rh, a0 as sh, aP as oh, ac as ah, a7 as ih, ak as ch, a6 as lh, aQ as uh, bC as dh, bx as fh, bc as hh, aU as ph, b9 as mh, a8 as gh, ad as wh, al as yh, aO as bh, aH as Sh, bs as Eh, bI as Ah, b8 as xh, ba as vh, bb as Ih, bi as Th, bm as Bh, bj as _h, bF as Nh, bG as Ch, bE as Oh, a3 as kh, b4 as Ph, bz as Rh, aW as $h, a_ as Fh, aR as Uh, a$ as jh, b6 as Lh, aN as Dh, bQ as Hh, bP as Vh, bM as Mh, bR as Gh, bN as zh, U as qh, V as Wh } from "./transactionVersion-BxOdbj7v.mjs";
 import { constants as Z, starknetId as Mn, CallData as mt, CairoOption as on, CairoOptionVariant as an, hash as Gn, num as O, encode as $t, uint256 as Ht, ec as us, isSierra as ds, TransactionType as cn } from "starknet";
 import { useEffect as Ft, useRef as ln, useState as zn, useMemo as vt, useCallback as qn, createContext as fs } from "react";
 import { isFunction as qt, isString as Wn, upperCase as $e, isNil as hs, upperFirst as ps, lowerCase as Kn, isUndefined as ms, isEmpty as un, isArray as gs } from "lodash-es";
@@ -36,11 +36,11 @@ const vs = h.object({
     guid: h.string().optional(),
     signerType: h.enum(["StarknetKey", "EthereumKey"]).optional()
   }).optional()
-}), Cl = h.object({
+}), Ol = h.object({
   address: h.string(),
   guardianAddress: h.string().optional(),
   account: vs
-}), Ol = h.object({
+}), kl = h.object({
   ownerAddress: h.string(),
   signature: h.object({
     r: h.string(),
@@ -50,25 +50,25 @@ const vs = h.object({
   name: h.string().optional(),
   icon: h.string().optional()
 });
-function kl(t) {
+function Pl(t) {
   return "transactionVersion" in t;
 }
-function Pl(t) {
+function Rl(t) {
   return "simulateTransaction" in t;
 }
-function Rl(t) {
+function $l(t) {
   return !("simulateTransaction" in t);
 }
 const Is = h.object({
   value: h.string(),
   platform: h.enum(["ios", "argentx", "android", "webwallet"]).nullable()
-}), $l = h.object({
+}), Fl = h.object({
   preferences: h.record(Is)
 }), Ts = h.enum(["mainnet-alpha", "sepolia-alpha"]), Bs = h.enum(["mainnet", "sepolia"]);
-function Fl(t) {
+function Ul(t) {
   return Ts.safeParse(t).success;
 }
-function Ul(t) {
+function jl(t) {
   return Bs.safeParse(t).success;
 }
 const Vt = 18;
@@ -145,7 +145,7 @@ const Gs = { value: 1n, decimals: 0 };
 function zs(t) {
   return h.string().refine((e) => /^-?\d+(\.\d+)?$/.test(e), { message: "Invalid number format" }).transform((e) => xt(e, t));
 }
-const jl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Ll = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   ONE: Gs,
   abs: Ue,
@@ -173,7 +173,7 @@ const jl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   toFixedDecimals: Fe,
   toTiniestPossibleDecimal: Xn
 }, Symbol.toStringTag, { value: "Module" }));
-class Ll {
+class Dl {
   constructor(e, n) {
     this.cachePromise = n.open(e).catch((r) => (console.error(new Error("Failed to open cache", { cause: r })), null));
   }
@@ -207,7 +207,7 @@ class Ll {
     await Promise.allSettled(n.map((r) => e.delete(r)));
   }
 }
-class Dl {
+class Hl {
   constructor(e, n) {
     this.httpService = e, this.baseUrl = n, this.offsetInS = 0, this.syncIntervalInMs = 60 * 1e3, this.initialSync = this.syncWithServer(), setInterval(() => void this.syncWithServer(), this.syncIntervalInMs);
   }
@@ -318,7 +318,7 @@ function qs(t, e) {
     headers: r
   });
 }
-class Hl {
+class Vl {
   constructor(e, n, r, s) {
     this.dateService = e, this.cacheService = n, this.httpService = r, this.options = s, this.inFlightRequests = /* @__PURE__ */ new Map();
   }
@@ -379,7 +379,7 @@ const Xt = (t, e, n) => {
   } catch {
     throw Xt("An error occurred while parsing", n, r);
   }
-}, Vl = async (t, e) => {
+}, Ml = async (t, e) => {
   const n = await fetch(t, {
     method: "POST",
     ...e
@@ -391,10 +391,10 @@ const Xt = (t, e, n) => {
   } catch {
     throw Xt("An error occurred while parsing", n, r);
   }
-}, Ml = (t) => ({
+}, Gl = (t) => ({
   refreshInterval: t,
   dedupingInterval: t
-}), Gl = (t) => `${t.networkId}::${t.address}`, Ws = () => {
+}), zl = (t) => `${t.networkId}::${t.address}`, Ws = () => {
 };
 function Ks(t, e, n, r) {
   const { cache: s } = ws(), o = ae(t && e, t ? n : Ws, r);
@@ -402,7 +402,7 @@ function Ks(t, e, n, r) {
     t || (o.mutate(), s.delete(e));
   }, [t]), o;
 }
-const zl = {
+const ql = {
   revalidateOnFocus: !1,
   revalidateOnMount: !0,
   revalidateOnReconnect: !1,
@@ -418,7 +418,7 @@ const zl = {
   } catch {
     throw new Error("failed to request time");
   }
-}, ql = async (t, e) => {
+}, Wl = async (t, e) => {
   const n = await Zs(t, e);
   return Math.floor(n);
 };
@@ -494,7 +494,7 @@ async function to(t, e, n) {
     });
   return Dn(o);
 }
-class Wl {
+class Kl {
   constructor(e, n, r) {
     this.httpService = e, this.baseUrl = n, this.allowedArgentNameNetworkId = r;
   }
@@ -803,8 +803,8 @@ function ya(t, e, n) {
     for (; ++r < o; ) {
       var d = t[r], u = d;
       if (d = n || d !== 0 ? d : 0, a && u === u) {
-        for (var w = c.length; w--; )
-          if (c[w] === u)
+        for (var y = c.length; y--; )
+          if (c[y] === u)
             continue t;
         i.push(d);
       } else s(c, u, n) || (c !== i && c.push(u), i.push(d));
@@ -833,7 +833,7 @@ function Sa() {
     throw new Error(`No argent account contract found: v${t} `);
   return tt[t];
 }
-function Kl() {
+function Zl() {
   const t = Q.maxSatisfying(Object.keys(Jt), "*");
   if (!t)
     throw new Error(`No argent multisig contract found: v${t} `);
@@ -842,7 +842,7 @@ function Kl() {
 function Ea() {
   return Object.entries(tt).filter(([t]) => Q.gte(t, "0.4.0")).map(([, t]) => t);
 }
-function Zl() {
+function Yl() {
   const t = Q.maxSatisfying(Object.keys(tt), "<0.3.0");
   if (!t)
     throw new Error(`No argent account contract found: v${t} `);
@@ -852,17 +852,17 @@ function Aa() {
   const t = Object.entries(tt).filter(([n]) => Q.gte(n, "0.3.1")).map(([, n]) => n), e = Object.entries(Jt).filter(([n]) => Q.gte(n, "0.1.1")).map(([, n]) => n);
   return [...t, ...e];
 }
-function Yl() {
+function Xl() {
   return Object.entries(tt).filter(([t]) => Q.gte(t, "0.4.0")).map(([, t]) => t);
 }
-function Xl() {
+function Jl() {
   const t = Q.maxSatisfying(Object.keys(tt), ">=0.4.0");
   if (!t)
     throw new Error(`No ledger account contract found: v${t}`);
   return tt[t];
 }
 const xa = (t, e) => t.cairoVersion === e.cairoVersion && nt(t.accountClassHash, e.accountClassHash);
-function Jl(t, e, n = []) {
+function Ql(t, e, n = []) {
   const r = en.parse({
     cairoVersion: e.cairoVersion ?? "1",
     accountClassHash: e.classHash ?? Sa()
@@ -911,7 +911,7 @@ function Ta(t, e, n, r, s) {
   const o = va(t, e, n, r, s);
   return Gn.calculateContractAddressFromHash(o.addressSalt, o.classHash, o.constructorCalldata, 0);
 }
-function Ql(t, e) {
+function tu(t, e) {
   const n = ln(t), r = ln();
   return Ft(() => {
     n.current = t;
@@ -921,7 +921,7 @@ function Ql(t, e) {
     r.current && clearTimeout(r.current), r.current = setTimeout(() => n.current(...s), e);
   };
 }
-function tu(t, e) {
+function eu(t, e) {
   const [n, r] = zn(t);
   return Ft(() => {
     const s = setTimeout(() => {
@@ -961,7 +961,7 @@ const Ba = h.object({
   brandColor: h.string().optional(),
   executeFromOutsideAllowed: h.boolean().default(!1).optional()
 }), Ca = h.array(Na);
-class eu {
+class nu {
   constructor(e, n) {
     this.apiBase = e, this.httpService = new Le(n, "json");
   }
@@ -976,7 +976,7 @@ function Oa(t) {
   var e;
   return (e = t == null ? void 0 : t.links) == null ? void 0 : e.find((n) => n.name === "dappland");
 }
-function nu(t) {
+function ru(t) {
   var e;
   return (e = Oa(t)) == null ? void 0 : e.url;
 }
@@ -994,7 +994,7 @@ const sr = F.object({
   status: F.union([F.literal("KNOWN"), F.literal("UNKNOWN")]),
   resolutions: F.array(Pa).optional()
 }), $a = F.array(F.string()), Fa = Ra.array();
-class ru {
+class su {
   constructor(e, n) {
     this.apiBase = e, this.headers = n, this.httpService = new Le(this.headers, "json");
   }
@@ -1116,9 +1116,9 @@ function si(t, e = 24) {
     for (let a = 0; a < 10; a++)
       n[a] = t[a] ^ t[a + 10] ^ t[a + 20] ^ t[a + 30] ^ t[a + 40];
     for (let a = 0; a < 10; a += 2) {
-      const i = (a + 8) % 10, c = (a + 2) % 10, l = n[c], d = n[c + 1], u = bn(l, d, 1) ^ n[i], w = Sn(l, d, 1) ^ n[i + 1];
+      const i = (a + 8) % 10, c = (a + 2) % 10, l = n[c], d = n[c + 1], u = bn(l, d, 1) ^ n[i], y = Sn(l, d, 1) ^ n[i + 1];
       for (let m = 0; m < 50; m += 10)
-        t[a + m] ^= u, t[a + m + 1] ^= w;
+        t[a + m] ^= u, t[a + m + 1] ^= y;
     }
     let s = t[2], o = t[3];
     for (let a = 0; a < 24; a++) {
@@ -1243,34 +1243,34 @@ const li = (t) => {
   } catch {
   }
   return "";
-}, ou = ({ accountName: t, networkId: e, accountAddress: n, backgroundColor: r }) => {
+}, au = ({ accountName: t, networkId: e, accountAddress: n, backgroundColor: r }) => {
   const s = hi(n), o = `${e}::${s}`, a = r || fi(o);
   return ee(t, { background: a });
 }, pi = (t) => {
   const e = $t.removeHexPrefix($t.sanitizeHex(O.toHex(t))), n = Zn.decode(e);
   return Yn.encode(n);
-}, au = (t) => t.map(pi), mi = (t) => {
+}, iu = (t) => t.map(pi), mi = (t) => {
   const e = Yn.decode(t);
   return $t.sanitizeHex(Zn.encode(e));
-}, iu = (t) => t.map(mi);
-function cu(t, e) {
+}, cu = (t) => t.map(mi);
+function lu(t, e) {
   const n = t.getTime(), r = e.getTime(), s = Math.abs(n - r);
   return Math.floor(s / (1e3 * 60 * 60 * 24));
 }
-const lu = (t) => (t || "false") === "true", uu = async (t, e) => {
+const uu = (t) => (t || "false") === "true", du = async (t, e) => {
   try {
     return await t.getClassHashAt(e), !0;
   } catch {
     return !1;
   }
 };
-function du(t) {
+function fu(t) {
   return !hs(t);
 }
-const fu = (t) => {
+const hu = (t) => {
   const e = /^(0|0x([a-f0-9A-F]+)?)$/;
   return !!(t === "" || e.test(t));
-}, Y = (t) => !isNaN(parseFloat(t)) && isFinite(Number(t)), hu = (t, e = 16) => {
+}, Y = (t) => !isNaN(parseFloat(t)) && isFinite(Number(t)), pu = (t, e = 16) => {
   const n = new RegExp(`^[0-9]*.?[0-9]{0,${e}}$`);
   return t === "" ? !0 : Y(t) ? !!n.test(t) : !1;
 }, He = {
@@ -1318,21 +1318,21 @@ const fu = (t) => {
 function jt(t) {
   return Ht.bnToUint256(t);
 }
-const pu = (t, e) => `${t} ${e}${t === 1 ? "" : "s"}`, mu = (t) => new Promise((e, n) => {
+const mu = (t, e) => `${t} ${e}${t === 1 ? "" : "s"}`, gu = (t) => new Promise((e, n) => {
   const r = new FileReader();
   r.onload = () => {
     var s;
     return r.result ? e((s = r.result) == null ? void 0 : s.toString()) : n(new Error("Could not read file"));
   }, r.onerror = n, r.onabort = n.bind(null, new Error("User aborted")), r.readAsText(t);
 });
-function gu(t) {
+function wu(t) {
   try {
     return ps(Kn(t));
   } catch {
     return t;
   }
 }
-const wu = (t, e) => {
+const bi = (t, e) => {
   const n = new URLSearchParams(e), r = n.size ? `?${n}` : "";
   return k(...oe(t), r);
 };
@@ -1341,12 +1341,12 @@ function yu(t) {
     t(...e);
   };
 }
-class bi extends Error {
+class Si extends Error {
   constructor(e, n) {
     super(`${e}::${n}`), this.name = e, this.code = n, this.name = e;
   }
 }
-class xn extends bi {
+class xn extends Si {
   constructor(e) {
     super("BackendPaginationError", e);
   }
@@ -1357,7 +1357,7 @@ class bu {
     this.apiBase = e, this.headers = n, this.imageOptimizationUrl = r, this.httpService = new Le(this.headers, "json");
   }
   async getNfts(e, n, r, s = 1) {
-    const o = this.normalizeAddress(r), a = k(this.apiBase, "pandora", e, n), i = this.pageToPageIndex(s), l = `${k(a, "profile", o, "nfts")}?page=${i}&size=${vn}`, d = await this.httpService.get(l), u = d.content.map((w) => this.mapItem(w, r));
+    const o = this.normalizeAddress(r), a = k(this.apiBase, "pandora", e, n), i = this.pageToPageIndex(s), l = `${k(a, "profile", o, "nfts")}?page=${i}&size=${vn}`, d = await this.httpService.get(l), u = d.content.map((y) => this.mapItem(y, r));
     return {
       totalPages: d.totalPages,
       page: d.number + 1,
@@ -1369,7 +1369,7 @@ class bu {
     const s = this.normalizeAddress(r), o = k(this.apiBase, "pandora", e, n), a = k(o, "collection", s), i = `${o}/collection/${s}`, [c, l] = await Promise.all([
       this.httpService.get(a),
       this.httpService.get(i)
-    ]), d = Ee(c), u = l.content.map((w) => this.mapItem(w));
+    ]), d = Ee(c), u = l.content.map((y) => this.mapItem(y));
     return {
       ...d,
       nfts: {
@@ -1386,12 +1386,12 @@ class bu {
   }
   async getProfileCollections(e, n, r, s = 1, o = !1) {
     const a = this.pageToPageIndex(s), i = this.normalizeAddress(r), c = k(this.apiBase, "pandora", e, n), l = k(c, "profile", i, "collections", `?page=${a}&size=${vn}`), d = await this.httpService.get(l), u = [];
-    for (const w of d.content)
+    for (const y of d.content)
       if (o) {
-        const m = await this.getCollectionMetrics(e, n, w.contractAddress);
-        u.push(Ee(w, m));
+        const m = await this.getCollectionMetrics(e, n, y.contractAddress);
+        u.push(Ee(y, m));
       } else
-        u.push(Ee(w));
+        u.push(Ee(y));
     return {
       totalPages: d.totalPages,
       page: d.number + 1,
@@ -1431,7 +1431,7 @@ class bu {
       token_id: e.tokenId,
       contract_address: e.contractAddress,
       name: r,
-      spec: "spec" in e ? Si(e.spec) : void 0,
+      spec: "spec" in e ? Ei(e.spec) : void 0,
       description: "",
       best_bid_order: {
         payment_amount: "bestListPrice" in e ? BigInt(e.bestListPrice) : void 0
@@ -1452,7 +1452,7 @@ class bu {
     };
   }
 }
-function Si(t) {
+function Ei(t) {
   switch (t) {
     case "erc721":
     case "starknetErc721":
@@ -1526,11 +1526,11 @@ function In(t) {
   if (!Number.isSafeInteger(t) || t < 0)
     throw new Error(`Wrong positive integer: ${t}`);
 }
-function Ei(t) {
+function Ai(t) {
   return t instanceof Uint8Array || t != null && typeof t == "object" && t.constructor.name === "Uint8Array";
 }
 function pr(t, ...e) {
-  if (!Ei(t))
+  if (!Ai(t))
     throw new Error("Expected Uint8Array");
   if (e.length > 0 && !e.includes(t.length))
     throw new Error(`Expected Uint8Array of length ${e}, not of length=${t.length}`);
@@ -1548,25 +1548,25 @@ function mr(t, e) {
     throw new Error(`digestInto() expects output buffer of length at least ${n}`);
 }
 const Zt = /* @__PURE__ */ BigInt(2 ** 32 - 1), Tn = /* @__PURE__ */ BigInt(32);
-function Ai(t, e = !1) {
+function xi(t, e = !1) {
   return e ? { h: Number(t & Zt), l: Number(t >> Tn & Zt) } : { h: Number(t >> Tn & Zt) | 0, l: Number(t & Zt) | 0 };
 }
-function xi(t, e = !1) {
+function vi(t, e = !1) {
   let n = new Uint32Array(t.length), r = new Uint32Array(t.length);
   for (let s = 0; s < t.length; s++) {
-    const { h: o, l: a } = Ai(t[s], e);
+    const { h: o, l: a } = xi(t[s], e);
     [n[s], r[s]] = [o, a];
   }
   return [n, r];
 }
-const vi = (t, e, n) => t << n | e >>> 32 - n, Ii = (t, e, n) => e << n | t >>> 32 - n, Ti = (t, e, n) => e << n - 32 | t >>> 64 - n, Bi = (t, e, n) => t << n - 32 | e >>> 64 - n;
+const Ii = (t, e, n) => t << n | e >>> 32 - n, Ti = (t, e, n) => e << n | t >>> 32 - n, Bi = (t, e, n) => e << n - 32 | t >>> 64 - n, _i = (t, e, n) => t << n - 32 | e >>> 64 - n;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const _i = (t) => new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4));
-function Ni(t) {
+const Ni = (t) => new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4));
+function Ci(t) {
   return t instanceof Uint8Array || t != null && typeof t == "object" && t.constructor.name === "Uint8Array";
 }
-const Ae = (t) => new DataView(t.buffer, t.byteOffset, t.byteLength), J = (t, e) => t << 32 - e | t >>> e, Ci = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-if (!Ci)
+const Ae = (t) => new DataView(t.buffer, t.byteOffset, t.byteLength), J = (t, e) => t << 32 - e | t >>> e, Oi = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+if (!Oi)
   throw new Error("Non little-endian hardware is not supported");
 function gr(t) {
   if (typeof t != "string")
@@ -1574,7 +1574,7 @@ function gr(t) {
   return new Uint8Array(new TextEncoder().encode(t));
 }
 function Ve(t) {
-  if (typeof t == "string" && (t = gr(t)), !Ni(t))
+  if (typeof t == "string" && (t = gr(t)), !Ci(t))
     throw new Error(`expected Uint8Array, got ${typeof t}`);
   return t;
 }
@@ -1588,24 +1588,24 @@ function yr(t) {
   const e = (r) => t().update(Ve(r)).digest(), n = t();
   return e.outputLen = n.outputLen, e.blockLen = n.blockLen, e.create = () => t(), e;
 }
-const [br, Sr, Er] = [[], [], []], Oi = /* @__PURE__ */ BigInt(0), Ot = /* @__PURE__ */ BigInt(1), ki = /* @__PURE__ */ BigInt(2), Pi = /* @__PURE__ */ BigInt(7), Ri = /* @__PURE__ */ BigInt(256), $i = /* @__PURE__ */ BigInt(113);
+const [br, Sr, Er] = [[], [], []], ki = /* @__PURE__ */ BigInt(0), Ot = /* @__PURE__ */ BigInt(1), Pi = /* @__PURE__ */ BigInt(2), Ri = /* @__PURE__ */ BigInt(7), $i = /* @__PURE__ */ BigInt(256), Fi = /* @__PURE__ */ BigInt(113);
 for (let t = 0, e = Ot, n = 1, r = 0; t < 24; t++) {
   [n, r] = [r, (2 * n + 3 * r) % 5], br.push(2 * (5 * r + n)), Sr.push((t + 1) * (t + 2) / 2 % 64);
-  let s = Oi;
+  let s = ki;
   for (let o = 0; o < 7; o++)
-    e = (e << Ot ^ (e >> Pi) * $i) % Ri, e & ki && (s ^= Ot << (Ot << /* @__PURE__ */ BigInt(o)) - Ot);
+    e = (e << Ot ^ (e >> Ri) * Fi) % $i, e & Pi && (s ^= Ot << (Ot << /* @__PURE__ */ BigInt(o)) - Ot);
   Er.push(s);
 }
-const [Fi, Ui] = /* @__PURE__ */ xi(Er, !0), Bn = (t, e, n) => n > 32 ? Ti(t, e, n) : vi(t, e, n), _n = (t, e, n) => n > 32 ? Bi(t, e, n) : Ii(t, e, n);
-function ji(t, e = 24) {
+const [Ui, ji] = /* @__PURE__ */ vi(Er, !0), Bn = (t, e, n) => n > 32 ? Bi(t, e, n) : Ii(t, e, n), _n = (t, e, n) => n > 32 ? _i(t, e, n) : Ti(t, e, n);
+function Li(t, e = 24) {
   const n = new Uint32Array(10);
   for (let r = 24 - e; r < 24; r++) {
     for (let a = 0; a < 10; a++)
       n[a] = t[a] ^ t[a + 10] ^ t[a + 20] ^ t[a + 30] ^ t[a + 40];
     for (let a = 0; a < 10; a += 2) {
-      const i = (a + 8) % 10, c = (a + 2) % 10, l = n[c], d = n[c + 1], u = Bn(l, d, 1) ^ n[i], w = _n(l, d, 1) ^ n[i + 1];
+      const i = (a + 8) % 10, c = (a + 2) % 10, l = n[c], d = n[c + 1], u = Bn(l, d, 1) ^ n[i], y = _n(l, d, 1) ^ n[i + 1];
       for (let m = 0; m < 50; m += 10)
-        t[a + m] ^= u, t[a + m + 1] ^= w;
+        t[a + m] ^= u, t[a + m + 1] ^= y;
     }
     let s = t[2], o = t[3];
     for (let a = 0; a < 24; a++) {
@@ -1618,7 +1618,7 @@ function ji(t, e = 24) {
       for (let i = 0; i < 10; i++)
         t[a + i] ^= ~n[(i + 2) % 10] & n[(i + 4) % 10];
     }
-    t[0] ^= Fi[r], t[1] ^= Ui[r];
+    t[0] ^= Ui[r], t[1] ^= ji[r];
   }
   n.fill(0);
 }
@@ -1627,10 +1627,10 @@ class Me extends wr {
   constructor(e, n, r, s = !1, o = 24) {
     if (super(), this.blockLen = e, this.suffix = n, this.outputLen = r, this.enableXOF = s, this.rounds = o, this.pos = 0, this.posOut = 0, this.finished = !1, this.destroyed = !1, In(r), 0 >= this.blockLen || this.blockLen >= 200)
       throw new Error("Sha3 supports only keccak-f1600 function");
-    this.state = new Uint8Array(200), this.state32 = _i(this.state);
+    this.state = new Uint8Array(200), this.state32 = Ni(this.state);
   }
   keccak() {
-    ji(this.state32, this.rounds), this.posOut = 0, this.pos = 0;
+    Li(this.state32, this.rounds), this.posOut = 0, this.pos = 0;
   }
   update(e) {
     ne(this);
@@ -1686,14 +1686,14 @@ class Me extends wr {
     return e || (e = new Me(n, r, s, a, o)), e.state32.set(this.state32), e.pos = this.pos, e.posOut = this.posOut, e.finished = this.finished, e.rounds = o, e.suffix = r, e.outputLen = s, e.enableXOF = a, e.destroyed = this.destroyed, e;
   }
 }
-const Li = (t, e, n) => yr(() => new Me(e, t, n)), Di = /* @__PURE__ */ Li(1, 136, 256 / 8);
-function Hi(t, e, n, r) {
+const Di = (t, e, n) => yr(() => new Me(e, t, n)), Hi = /* @__PURE__ */ Di(1, 136, 256 / 8);
+function Vi(t, e, n, r) {
   if (typeof t.setBigUint64 == "function")
     return t.setBigUint64(e, n, r);
   const s = BigInt(32), o = BigInt(4294967295), a = Number(n >> s & o), i = Number(n & o), c = r ? 4 : 0, l = r ? 0 : 4;
   t.setUint32(e + c, a, r), t.setUint32(e + l, i, r);
 }
-class Vi extends wr {
+class Mi extends wr {
   constructor(e, n, r, s) {
     super(), this.blockLen = e, this.outputLen = n, this.padOffset = r, this.isLE = s, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(e), this.view = Ae(this.buffer);
   }
@@ -1721,7 +1721,7 @@ class Vi extends wr {
     n[a++] = 128, this.buffer.subarray(a).fill(0), this.padOffset > s - a && (this.process(r, 0), a = 0);
     for (let u = a; u < s; u++)
       n[u] = 0;
-    Hi(r, s - 8, BigInt(this.length * 8), o), this.process(r, 0);
+    Vi(r, s - 8, BigInt(this.length * 8), o), this.process(r, 0);
     const i = Ae(e), c = this.outputLen;
     if (c % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
@@ -1743,7 +1743,7 @@ class Vi extends wr {
     return e.length = s, e.pos = i, e.finished = o, e.destroyed = a, s % n && e.buffer.set(r), e;
   }
 }
-const Mi = (t, e, n) => t & e ^ ~t & n, Gi = (t, e, n) => t & e ^ t & n ^ e & n, zi = /* @__PURE__ */ new Uint32Array([
+const Gi = (t, e, n) => t & e ^ ~t & n, zi = (t, e, n) => t & e ^ t & n ^ e & n, qi = /* @__PURE__ */ new Uint32Array([
   1116352408,
   1899447441,
   3049323471,
@@ -1818,7 +1818,7 @@ const Mi = (t, e, n) => t & e ^ ~t & n, Gi = (t, e, n) => t & e ^ t & n ^ e & n,
   528734635,
   1541459225
 ]), ct = /* @__PURE__ */ new Uint32Array(64);
-class qi extends Vi {
+class Wi extends Mi {
   constructor() {
     super(64, 32, 8, !1), this.A = it[0] | 0, this.B = it[1] | 0, this.C = it[2] | 0, this.D = it[3] | 0, this.E = it[4] | 0, this.F = it[5] | 0, this.G = it[6] | 0, this.H = it[7] | 0;
   }
@@ -1834,12 +1834,12 @@ class qi extends Vi {
     for (let u = 0; u < 16; u++, n += 4)
       ct[u] = e.getUint32(n, !1);
     for (let u = 16; u < 64; u++) {
-      const w = ct[u - 15], m = ct[u - 2], S = J(w, 7) ^ J(w, 18) ^ w >>> 3, f = J(m, 17) ^ J(m, 19) ^ m >>> 10;
+      const y = ct[u - 15], m = ct[u - 2], S = J(y, 7) ^ J(y, 18) ^ y >>> 3, f = J(m, 17) ^ J(m, 19) ^ m >>> 10;
       ct[u] = f + ct[u - 7] + S + ct[u - 16] | 0;
     }
     let { A: r, B: s, C: o, D: a, E: i, F: c, G: l, H: d } = this;
     for (let u = 0; u < 64; u++) {
-      const w = J(i, 6) ^ J(i, 11) ^ J(i, 25), m = d + w + Mi(i, c, l) + zi[u] + ct[u] | 0, f = (J(r, 2) ^ J(r, 13) ^ J(r, 22)) + Gi(r, s, o) | 0;
+      const y = J(i, 6) ^ J(i, 11) ^ J(i, 25), m = d + y + Gi(i, c, l) + qi[u] + ct[u] | 0, f = (J(r, 2) ^ J(r, 13) ^ J(r, 22)) + zi(r, s, o) | 0;
       d = l, l = c, c = i, i = a + m | 0, a = o, o = s, s = r, r = m + f | 0;
     }
     r = r + this.A | 0, s = s + this.B | 0, o = o + this.C | 0, a = a + this.D | 0, i = i + this.E | 0, c = c + this.F | 0, l = l + this.G | 0, d = d + this.H | 0, this.set(r, s, o, a, i, c, l, d);
@@ -1851,15 +1851,15 @@ class qi extends Vi {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
   }
 }
-const Ar = /* @__PURE__ */ yr(() => new qi());
+const Ar = /* @__PURE__ */ yr(() => new Wi());
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const xr = BigInt(0), fe = BigInt(1), Wi = BigInt(2), he = (t) => t instanceof Uint8Array, Ki = Array.from({ length: 256 }, (t, e) => e.toString(16).padStart(2, "0"));
+const xr = BigInt(0), fe = BigInt(1), Ki = BigInt(2), he = (t) => t instanceof Uint8Array, Zi = Array.from({ length: 256 }, (t, e) => e.toString(16).padStart(2, "0"));
 function ht(t) {
   if (!he(t))
     throw new Error("Uint8Array expected");
   let e = "";
   for (let n = 0; n < t.length; n++)
-    e += Ki[t[n]];
+    e += Zi[t[n]];
   return e;
 }
 function vr(t) {
@@ -1893,7 +1893,7 @@ function ze(t) {
     throw new Error("Uint8Array expected");
   return Ge(ht(Uint8Array.from(t).reverse()));
 }
-const Et = (t, e) => pt(t.toString(16).padStart(e * 2, "0")), Ir = (t, e) => Et(t, e).reverse(), Zi = (t) => pt(vr(t));
+const Et = (t, e) => pt(t.toString(16).padStart(e * 2, "0")), Ir = (t, e) => Et(t, e).reverse(), Yi = (t) => pt(vr(t));
 function V(t, e, n) {
   let r;
   if (typeof e == "string")
@@ -1920,7 +1920,7 @@ function Lt(...t) {
     e.set(r, n), n += r.length;
   }), e;
 }
-function Yi(t, e) {
+function Xi(t, e) {
   if (t.length !== e.length)
     return !1;
   for (let n = 0; n < t.length; n++)
@@ -1928,18 +1928,18 @@ function Yi(t, e) {
       return !1;
   return !0;
 }
-function Xi(t) {
+function Ji(t) {
   if (typeof t != "string")
     throw new Error(`utf8ToBytes expected string, got ${typeof t}`);
   return new TextEncoder().encode(t);
 }
-function Ji(t) {
+function Qi(t) {
   let e;
   for (e = 0; t > xr; t >>= fe, e += 1)
     ;
   return e;
 }
-const Qi = (t, e) => t >> BigInt(e) & fe, tc = (t, e, n) => t | (n ? fe : xr) << BigInt(e), pe = (t) => (Wi << BigInt(t - 1)) - fe, xe = (t) => new Uint8Array(t), Nn = (t) => Uint8Array.from(t);
+const tc = (t, e) => t >> BigInt(e) & fe, ec = (t, e, n) => t | (n ? fe : xr) << BigInt(e), pe = (t) => (Ki << BigInt(t - 1)) - fe, xe = (t) => new Uint8Array(t), Nn = (t) => Uint8Array.from(t);
 function Tr(t, e, n) {
   if (typeof t != "number" || t < 2)
     throw new Error("hashLen must be a number");
@@ -1956,23 +1956,23 @@ function Tr(t, e, n) {
     if (o++ >= 1e3)
       throw new Error("drbg: tried 1000 values");
     let u = 0;
-    const w = [];
+    const y = [];
     for (; u < e; ) {
       r = i();
       const m = r.slice();
-      w.push(m), u += r.length;
+      y.push(m), u += r.length;
     }
-    return Lt(...w);
+    return Lt(...y);
   };
-  return (u, w) => {
+  return (u, y) => {
     a(), c(u);
     let m;
-    for (; !(m = w(l())); )
+    for (; !(m = y(l())); )
       c();
     return a(), m;
   };
 }
-const ec = {
+const nc = {
   bigint: (t) => typeof t == "bigint",
   function: (t) => typeof t == "function",
   boolean: (t) => typeof t == "boolean",
@@ -1984,7 +1984,7 @@ const ec = {
 };
 function zt(t, e, n = {}) {
   const r = (s, o, a) => {
-    const i = ec[o];
+    const i = nc[o];
     if (typeof i != "function")
       throw new Error(`Invalid validator "${o}", expected function`);
     const c = t[s];
@@ -1997,37 +1997,37 @@ function zt(t, e, n = {}) {
     r(s, o, !0);
   return t;
 }
-const nc = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const rc = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  bitGet: Qi,
-  bitLen: Ji,
+  bitGet: tc,
+  bitLen: Qi,
   bitMask: pe,
-  bitSet: tc,
+  bitSet: ec,
   bytesToHex: ht,
   bytesToNumberBE: X,
   bytesToNumberLE: ze,
   concatBytes: Lt,
   createHmacDrbg: Tr,
   ensureBytes: V,
-  equalBytes: Yi,
+  equalBytes: Xi,
   hexToBytes: pt,
   hexToNumber: Ge,
   numberToBytesBE: Et,
   numberToBytesLE: Ir,
   numberToHexUnpadded: vr,
-  numberToVarBytesBE: Zi,
-  utf8ToBytes: Xi,
+  numberToVarBytesBE: Yi,
+  utf8ToBytes: Ji,
   validateObject: zt
 }, Symbol.toStringTag, { value: "Module" }));
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const U = BigInt(0), $ = BigInt(1), ut = BigInt(2), rc = BigInt(3), _e = BigInt(4), Cn = BigInt(5), On = BigInt(8);
+const U = BigInt(0), $ = BigInt(1), ut = BigInt(2), sc = BigInt(3), _e = BigInt(4), Cn = BigInt(5), On = BigInt(8);
 BigInt(9);
 BigInt(16);
 function M(t, e) {
   const n = t % e;
   return n >= U ? n : e + n;
 }
-function sc(t, e, n) {
+function oc(t, e, n) {
   if (n <= U || e < U)
     throw new Error("Expected power/modulo > 0");
   if (n === $)
@@ -2049,12 +2049,12 @@ function Ne(t, e) {
     throw new Error("invert: does not exist");
   return M(s, e);
 }
-function oc(t) {
+function ac(t) {
   const e = (t - $) / ut;
   let n, r, s;
   for (n = t - $, r = 0; n % ut === U; n /= ut, r++)
     ;
-  for (s = ut; s < t && sc(s, e, t) !== t - $; s++)
+  for (s = ut; s < t && oc(s, e, t) !== t - $; s++)
     ;
   if (r === 1) {
     const a = (t + $) / _e;
@@ -2069,21 +2069,21 @@ function oc(t) {
   return function(i, c) {
     if (i.pow(c, e) === i.neg(i.ONE))
       throw new Error("Cannot find square root");
-    let l = r, d = i.pow(i.mul(i.ONE, s), n), u = i.pow(c, o), w = i.pow(c, n);
-    for (; !i.eql(w, i.ONE); ) {
-      if (i.eql(w, i.ZERO))
+    let l = r, d = i.pow(i.mul(i.ONE, s), n), u = i.pow(c, o), y = i.pow(c, n);
+    for (; !i.eql(y, i.ONE); ) {
+      if (i.eql(y, i.ZERO))
         return i.ZERO;
       let m = 1;
-      for (let f = i.sqr(w); m < l && !i.eql(f, i.ONE); m++)
+      for (let f = i.sqr(y); m < l && !i.eql(f, i.ONE); m++)
         f = i.sqr(f);
       const S = i.pow(d, $ << BigInt(l - m - 1));
-      d = i.sqr(S), u = i.mul(u, S), w = i.mul(w, d), l = m;
+      d = i.sqr(S), u = i.mul(u, S), y = i.mul(y, d), l = m;
     }
     return u;
   };
 }
-function ac(t) {
-  if (t % _e === rc) {
+function ic(t) {
+  if (t % _e === sc) {
     const e = (t + $) / _e;
     return function(r, s) {
       const o = r.pow(s, e);
@@ -2101,9 +2101,9 @@ function ac(t) {
       return l;
     };
   }
-  return oc(t);
+  return ac(t);
 }
-const ic = [
+const cc = [
   "create",
   "isValid",
   "is0",
@@ -2128,7 +2128,7 @@ function qe(t) {
     MASK: "bigint",
     BYTES: "isSafeInteger",
     BITS: "isSafeInteger"
-  }, n = ic.reduce((r, s) => (r[s] = "function", r), e);
+  }, n = cc.reduce((r, s) => (r[s] = "function", r), e);
   return zt(t, n);
 }
 function Br(t, e, n) {
@@ -2143,7 +2143,7 @@ function Br(t, e, n) {
     n & $ && (r = t.mul(r, s)), s = t.sqr(s), n >>= $;
   return r;
 }
-function cc(t, e) {
+function lc(t, e) {
   const n = new Array(e.length), r = e.reduce((o, a, i) => t.is0(a) ? o : (n[i] = o, t.mul(o, a)), t.ONE), s = t.inv(r);
   return e.reduceRight((o, a, i) => t.is0(a) ? o : (n[i] = t.mul(o, n[i]), t.mul(o, a)), s), n;
 }
@@ -2157,7 +2157,7 @@ function Ke(t, e, n = !1, r = {}) {
   const { nBitLength: s, nByteLength: o } = We(t, e);
   if (o > 2048)
     throw new Error("Field lengths over 2048 bytes are not supported");
-  const a = ac(t), i = Object.freeze({
+  const a = ic(t), i = Object.freeze({
     ORDER: t,
     BITS: s,
     BYTES: o,
@@ -2187,7 +2187,7 @@ function Ke(t, e, n = !1, r = {}) {
     mulN: (c, l) => c * l,
     inv: (c) => Ne(c, t),
     sqrt: r.sqrt || ((c) => a(i, c)),
-    invertBatch: (c) => cc(i, c),
+    invertBatch: (c) => lc(i, c),
     // TODO: do we really need constant cmov?
     // We don't have const-time bigints anyway, so probably will be not very useful
     cmov: (c, l, d) => d ? l : c,
@@ -2200,7 +2200,7 @@ function Ke(t, e, n = !1, r = {}) {
   });
   return Object.freeze(i);
 }
-function lc(t, e, n = !1) {
+function uc(t, e, n = !1) {
   t = V("privateHash", t);
   const r = t.length, s = We(e).nByteLength + 8;
   if (s < 24 || r < s || r > 1024)
@@ -2209,7 +2209,7 @@ function lc(t, e, n = !1) {
   return M(o, e - $) + $;
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function uc(t) {
+function dc(t) {
   const { Fp: e } = t;
   qe(e);
   for (const c of ["t", "roundsFull", "roundsPartial"])
@@ -2249,8 +2249,8 @@ function uc(t) {
   });
   return Object.freeze({ ...t, rounds: o, sboxFn: s, roundConstants: a, mds: i });
 }
-function dc(t) {
-  const { t: e, Fp: n, rounds: r, sboxFn: s, reversePartialPowIdx: o } = uc(t), a = Math.floor(t.roundsFull / 2), i = o ? e - 1 : 0, c = (d, u, w) => (d = d.map((m, S) => n.add(m, t.roundConstants[w][S])), u ? d = d.map((m) => s(m)) : d[i] = s(d[i]), d = t.mds.map((m) => m.reduce((S, f, g) => n.add(S, n.mulN(f, d[g])), n.ZERO)), d), l = function(u) {
+function fc(t) {
+  const { t: e, Fp: n, rounds: r, sboxFn: s, reversePartialPowIdx: o } = dc(t), a = Math.floor(t.roundsFull / 2), i = o ? e - 1 : 0, c = (d, u, y) => (d = d.map((m, S) => n.add(m, t.roundConstants[y][S])), u ? d = d.map((m) => s(m)) : d[i] = s(d[i]), d = t.mds.map((m) => m.reduce((S, f, g) => n.add(S, n.mulN(f, d[g])), n.ZERO)), d), l = function(u) {
     if (!Array.isArray(u) || u.length !== e)
       throw new Error(`Poseidon: wrong values (expected array of bigints with length ${e})`);
     u = u.map((m) => {
@@ -2258,22 +2258,22 @@ function dc(t) {
         throw new Error(`Poseidon: wrong value=${m} (${typeof m})`);
       return n.create(m);
     });
-    let w = 0;
+    let y = 0;
     for (let m = 0; m < a; m++)
-      u = c(u, !0, w++);
+      u = c(u, !0, y++);
     for (let m = 0; m < t.roundsPartial; m++)
-      u = c(u, !1, w++);
+      u = c(u, !1, y++);
     for (let m = 0; m < a; m++)
-      u = c(u, !0, w++);
-    if (w !== r)
-      throw new Error(`Poseidon: wrong number of rounds: last round=${w}, total=${r}`);
+      u = c(u, !0, y++);
+    if (y !== r)
+      throw new Error(`Poseidon: wrong number of rounds: last round=${y}, total=${r}`);
     return u;
   };
   return l.roundConstants = t.roundConstants, l;
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const fc = BigInt(0), ve = BigInt(1);
-function hc(t, e) {
+const hc = BigInt(0), ve = BigInt(1);
+function pc(t, e) {
   const n = (s, o) => {
     const a = o.negate();
     return s ? a : o;
@@ -2286,7 +2286,7 @@ function hc(t, e) {
     // non-const time multiplication ladder
     unsafeLadder(s, o) {
       let a = t.ZERO, i = s;
-      for (; o > fc; )
+      for (; o > hc; )
         o & ve && (a = a.add(i)), i = i.double(), o >>= ve;
       return a;
     },
@@ -2305,7 +2305,7 @@ function hc(t, e) {
       let l = s, d = l;
       for (let u = 0; u < a; u++) {
         d = l, c.push(d);
-        for (let w = 1; w < i; w++)
+        for (let y = 1; y < i; y++)
           d = d.add(l), c.push(d);
         l = d.double();
       }
@@ -2321,13 +2321,13 @@ function hc(t, e) {
     wNAF(s, o, a) {
       const { windows: i, windowSize: c } = r(s);
       let l = t.ZERO, d = t.BASE;
-      const u = BigInt(2 ** s - 1), w = 2 ** s, m = BigInt(s);
+      const u = BigInt(2 ** s - 1), y = 2 ** s, m = BigInt(s);
       for (let S = 0; S < i; S++) {
         const f = S * c;
         let g = Number(a & u);
-        a >>= m, g > c && (g -= w, a += ve);
-        const b = f, E = f + Math.abs(g) - 1, x = S % 2 !== 0, _ = g < 0;
-        g === 0 ? d = d.add(n(x, o[b])) : l = l.add(n(_, o[E]));
+        a >>= m, g > c && (g -= y, a += ve);
+        const w = f, E = f + Math.abs(g) - 1, x = S % 2 !== 0, _ = g < 0;
+        g === 0 ? d = d.add(n(x, o[w])) : l = l.add(n(_, o[E]));
       }
       return { p: l, f: d };
     },
@@ -2354,7 +2354,7 @@ function _r(t) {
   });
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function pc(t) {
+function mc(t) {
   const e = _r(t);
   zt(e, {
     a: "field",
@@ -2377,7 +2377,7 @@ function pc(t) {
   }
   return Object.freeze({ ...e });
 }
-const { bytesToNumberBE: mc, hexToBytes: gc } = nc, dt = {
+const { bytesToNumberBE: gc, hexToBytes: wc } = rc, dt = {
   // asn.1 DER encoding utils
   Err: class extends Error {
     constructor(e = "") {
@@ -2395,10 +2395,10 @@ const { bytesToNumberBE: mc, hexToBytes: gc } = nc, dt = {
       throw new e("Invalid signature integer: negative");
     if (r[0] === 0 && !(r[1] & 128))
       throw new e("Invalid signature integer: unnecessary leading zero");
-    return { d: mc(r), l: t.subarray(n + 2) };
+    return { d: gc(r), l: t.subarray(n + 2) };
   },
   toSig(t) {
-    const { Err: e } = dt, n = typeof t == "string" ? gc(t) : t;
+    const { Err: e } = dt, n = typeof t == "string" ? wc(t) : t;
     if (!(n instanceof Uint8Array))
       throw new Error("ui8a expected");
     let r = n.length;
@@ -2422,16 +2422,16 @@ const { bytesToNumberBE: mc, hexToBytes: gc } = nc, dt = {
 BigInt(2);
 const kn = BigInt(3);
 BigInt(4);
-function wc(t) {
-  const e = pc(t), { Fp: n } = e, r = e.toBytes || ((S, f, g) => {
-    const b = f.toAffine();
-    return Lt(Uint8Array.from([4]), n.toBytes(b.x), n.toBytes(b.y));
+function yc(t) {
+  const e = mc(t), { Fp: n } = e, r = e.toBytes || ((S, f, g) => {
+    const w = f.toAffine();
+    return Lt(Uint8Array.from([4]), n.toBytes(w.x), n.toBytes(w.y));
   }), s = e.fromBytes || ((S) => {
-    const f = S.subarray(1), g = n.fromBytes(f.subarray(0, n.BYTES)), b = n.fromBytes(f.subarray(n.BYTES, 2 * n.BYTES));
-    return { x: g, y: b };
+    const f = S.subarray(1), g = n.fromBytes(f.subarray(0, n.BYTES)), w = n.fromBytes(f.subarray(n.BYTES, 2 * n.BYTES));
+    return { x: g, y: w };
   });
   function o(S) {
-    const { a: f, b: g } = e, b = n.sqr(S), E = n.mul(b, S);
+    const { a: f, b: g } = e, w = n.sqr(S), E = n.mul(w, S);
     return n.add(n.add(E, n.mul(S, f)), g);
   }
   if (!n.eql(n.sqr(e.Gy), o(e.Gx)))
@@ -2444,7 +2444,7 @@ function wc(t) {
       throw new Error("Expected valid bigint: 0 < bigint < curve.n");
   }
   function c(S) {
-    const { allowedPrivateKeyLengths: f, nByteLength: g, wrapPrivateKey: b, n: E } = e;
+    const { allowedPrivateKeyLengths: f, nByteLength: g, wrapPrivateKey: w, n: E } = e;
     if (f && typeof S != "bigint") {
       if (S instanceof Uint8Array && (S = ht(S)), typeof S != "string" || !f.includes(S.length))
         throw new Error("Invalid key");
@@ -2456,7 +2456,7 @@ function wc(t) {
     } catch {
       throw new Error(`private key must be ${g} bytes, hex or bigint, not ${typeof S}`);
     }
-    return b && (x = M(x, E)), i(x), x;
+    return w && (x = M(x, E)), i(x), x;
   }
   const l = /* @__PURE__ */ new Map();
   function d(S) {
@@ -2464,24 +2464,24 @@ function wc(t) {
       throw new Error("ProjectivePoint expected");
   }
   class u {
-    constructor(f, g, b) {
-      if (this.px = f, this.py = g, this.pz = b, f == null || !n.isValid(f))
+    constructor(f, g, w) {
+      if (this.px = f, this.py = g, this.pz = w, f == null || !n.isValid(f))
         throw new Error("x required");
       if (g == null || !n.isValid(g))
         throw new Error("y required");
-      if (b == null || !n.isValid(b))
+      if (w == null || !n.isValid(w))
         throw new Error("z required");
     }
     // Does not validate if the point is on-curve.
     // Use fromHex instead, or call assertValidity() later.
     static fromAffine(f) {
-      const { x: g, y: b } = f || {};
-      if (!f || !n.isValid(g) || !n.isValid(b))
+      const { x: g, y: w } = f || {};
+      if (!f || !n.isValid(g) || !n.isValid(w))
         throw new Error("invalid affine point");
       if (f instanceof u)
         throw new Error("projective point not allowed");
       const E = (x) => n.eql(x, n.ZERO);
-      return E(g) && E(b) ? u.ZERO : new u(g, b, n.ONE);
+      return E(g) && E(w) ? u.ZERO : new u(g, w, n.ONE);
     }
     get x() {
       return this.toAffine().x;
@@ -2496,8 +2496,8 @@ function wc(t) {
      * Optimization: converts a list of projective points to a list of identical points with Z=1.
      */
     static normalizeZ(f) {
-      const g = n.invertBatch(f.map((b) => b.pz));
-      return f.map((b, E) => b.toAffine(g[E])).map(u.fromAffine);
+      const g = n.invertBatch(f.map((w) => w.pz));
+      return f.map((w, E) => w.toAffine(g[E])).map(u.fromAffine);
     }
     /**
      * Converts hash string or Uint8Array to Point.
@@ -2525,8 +2525,8 @@ function wc(t) {
       const { x: f, y: g } = this.toAffine();
       if (!n.isValid(f) || !n.isValid(g))
         throw new Error("bad point: x or y not FE");
-      const b = n.sqr(g), E = o(f);
-      if (!n.eql(b, E))
+      const w = n.sqr(g), E = o(f);
+      if (!n.eql(w, E))
         throw new Error("bad point: equation left != right");
       if (!this.isTorsionFree())
         throw new Error("bad point: not in prime-order subgroup");
@@ -2542,7 +2542,7 @@ function wc(t) {
      */
     equals(f) {
       d(f);
-      const { px: g, py: b, pz: E } = this, { px: x, py: _, pz: B } = f, A = n.eql(n.mul(g, B), n.mul(x, E)), v = n.eql(n.mul(b, B), n.mul(_, E));
+      const { px: g, py: w, pz: E } = this, { px: x, py: _, pz: B } = f, A = n.eql(n.mul(g, B), n.mul(x, E)), v = n.eql(n.mul(w, B), n.mul(_, E));
       return A && v;
     }
     /**
@@ -2556,9 +2556,9 @@ function wc(t) {
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: f, b: g } = e, b = n.mul(g, kn), { px: E, py: x, pz: _ } = this;
+      const { a: f, b: g } = e, w = n.mul(g, kn), { px: E, py: x, pz: _ } = this;
       let B = n.ZERO, A = n.ZERO, v = n.ZERO, T = n.mul(E, E), G = n.mul(x, x), R = n.mul(_, _), N = n.mul(E, x);
-      return N = n.add(N, N), v = n.mul(E, _), v = n.add(v, v), B = n.mul(f, v), A = n.mul(b, R), A = n.add(B, A), B = n.sub(G, A), A = n.add(G, A), A = n.mul(B, A), B = n.mul(N, B), v = n.mul(b, v), R = n.mul(f, R), N = n.sub(T, R), N = n.mul(f, N), N = n.add(N, v), v = n.add(T, T), T = n.add(v, T), T = n.add(T, R), T = n.mul(T, N), A = n.add(A, T), R = n.mul(x, _), R = n.add(R, R), T = n.mul(R, N), B = n.sub(B, T), v = n.mul(R, G), v = n.add(v, v), v = n.add(v, v), new u(B, A, v);
+      return N = n.add(N, N), v = n.mul(E, _), v = n.add(v, v), B = n.mul(f, v), A = n.mul(w, R), A = n.add(B, A), B = n.sub(G, A), A = n.add(G, A), A = n.mul(B, A), B = n.mul(N, B), v = n.mul(w, v), R = n.mul(f, R), N = n.sub(T, R), N = n.mul(f, N), N = n.add(N, v), v = n.add(T, T), T = n.add(v, T), T = n.add(T, R), T = n.mul(T, N), A = n.add(A, T), R = n.mul(x, _), R = n.add(R, R), T = n.mul(R, N), B = n.sub(B, T), v = n.mul(R, G), v = n.add(v, v), v = n.add(v, v), new u(B, A, v);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -2566,13 +2566,13 @@ function wc(t) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(f) {
       d(f);
-      const { px: g, py: b, pz: E } = this, { px: x, py: _, pz: B } = f;
+      const { px: g, py: w, pz: E } = this, { px: x, py: _, pz: B } = f;
       let A = n.ZERO, v = n.ZERO, T = n.ZERO;
       const G = e.a, R = n.mul(e.b, kn);
-      let N = n.mul(g, x), L = n.mul(b, _), D = n.mul(E, B), rt = n.add(g, b), p = n.add(x, _);
+      let N = n.mul(g, x), L = n.mul(w, _), D = n.mul(E, B), rt = n.add(g, w), p = n.add(x, _);
       rt = n.mul(rt, p), p = n.add(N, L), rt = n.sub(rt, p), p = n.add(g, E);
-      let y = n.add(x, B);
-      return p = n.mul(p, y), y = n.add(N, D), p = n.sub(p, y), y = n.add(b, E), A = n.add(_, B), y = n.mul(y, A), A = n.add(L, D), y = n.sub(y, A), T = n.mul(G, p), A = n.mul(R, D), T = n.add(A, T), A = n.sub(L, T), T = n.add(L, T), v = n.mul(A, T), L = n.add(N, N), L = n.add(L, N), D = n.mul(G, D), p = n.mul(R, p), L = n.add(L, D), D = n.sub(N, D), D = n.mul(G, D), p = n.add(p, D), N = n.mul(L, p), v = n.add(v, N), N = n.mul(y, p), A = n.mul(rt, A), A = n.sub(A, N), N = n.mul(rt, L), T = n.mul(y, T), T = n.add(T, N), new u(A, v, T);
+      let b = n.add(x, B);
+      return p = n.mul(p, b), b = n.add(N, D), p = n.sub(p, b), b = n.add(w, E), A = n.add(_, B), b = n.mul(b, A), A = n.add(L, D), b = n.sub(b, A), T = n.mul(G, p), A = n.mul(R, D), T = n.add(A, T), A = n.sub(L, T), T = n.add(L, T), v = n.mul(A, T), L = n.add(N, N), L = n.add(L, N), D = n.mul(G, D), p = n.mul(R, p), L = n.add(L, D), D = n.sub(N, D), D = n.mul(G, D), p = n.add(p, D), N = n.mul(L, p), v = n.add(v, N), N = n.mul(b, p), A = n.mul(rt, A), A = n.sub(A, N), N = n.mul(rt, L), T = n.mul(b, T), T = n.add(T, N), new u(A, v, T);
     }
     subtract(f) {
       return this.add(f.negate());
@@ -2582,8 +2582,8 @@ function wc(t) {
     }
     wNAF(f) {
       return m.wNAFCached(this, l, f, (g) => {
-        const b = n.invertBatch(g.map((E) => E.pz));
-        return g.map((E, x) => E.toAffine(b[x])).map(u.fromAffine);
+        const w = n.invertBatch(g.map((E) => E.pz));
+        return g.map((E, x) => E.toAffine(w[x])).map(u.fromAffine);
       });
     }
     /**
@@ -2597,13 +2597,13 @@ function wc(t) {
         return g;
       if (i(f), f === q)
         return this;
-      const { endo: b } = e;
-      if (!b)
+      const { endo: w } = e;
+      if (!w)
         return m.unsafeLadder(this, f);
-      let { k1neg: E, k1: x, k2neg: _, k2: B } = b.splitScalar(f), A = g, v = g, T = this;
+      let { k1neg: E, k1: x, k2neg: _, k2: B } = w.splitScalar(f), A = g, v = g, T = this;
       for (; x > et || B > et; )
         x & q && (A = A.add(T)), B & q && (v = v.add(T)), T = T.double(), x >>= q, B >>= q;
-      return E && (A = A.negate()), _ && (v = v.negate()), v = new u(n.mul(v.px, b.beta), v.py, v.pz), A.add(v);
+      return E && (A = A.negate()), _ && (v = v.negate()), v = new u(n.mul(v.px, w.beta), v.py, v.pz), A.add(v);
     }
     /**
      * Constant time multiplication.
@@ -2616,17 +2616,17 @@ function wc(t) {
      */
     multiply(f) {
       i(f);
-      let g = f, b, E;
+      let g = f, w, E;
       const { endo: x } = e;
       if (x) {
         const { k1neg: _, k1: B, k2neg: A, k2: v } = x.splitScalar(g);
         let { p: T, f: G } = this.wNAF(B), { p: R, f: N } = this.wNAF(v);
-        T = m.constTimeNegate(_, T), R = m.constTimeNegate(A, R), R = new u(n.mul(R.px, x.beta), R.py, R.pz), b = T.add(R), E = G.add(N);
+        T = m.constTimeNegate(_, T), R = m.constTimeNegate(A, R), R = new u(n.mul(R.px, x.beta), R.py, R.pz), w = T.add(R), E = G.add(N);
       } else {
         const { p: _, f: B } = this.wNAF(g);
-        b = _, E = B;
+        w = _, E = B;
       }
-      return u.normalizeZ([b, E])[0];
+      return u.normalizeZ([w, E])[0];
     }
     /**
      * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.
@@ -2634,17 +2634,17 @@ function wc(t) {
      * The trick could be useful if both P and Q are not G (not in our case).
      * @returns non-zero affine point
      */
-    multiplyAndAddUnsafe(f, g, b) {
-      const E = u.BASE, x = (B, A) => A === et || A === q || !B.equals(E) ? B.multiplyUnsafe(A) : B.multiply(A), _ = x(this, g).add(x(f, b));
+    multiplyAndAddUnsafe(f, g, w) {
+      const E = u.BASE, x = (B, A) => A === et || A === q || !B.equals(E) ? B.multiplyUnsafe(A) : B.multiply(A), _ = x(this, g).add(x(f, w));
       return _.is0() ? void 0 : _;
     }
     // Converts Projective point to affine (x, y) coordinates.
     // Can accept precomputed Z^-1 - for example, from invertBatch.
     // (x, y, z) ∋ (x=x/z, y=y/z)
     toAffine(f) {
-      const { px: g, py: b, pz: E } = this, x = this.is0();
+      const { px: g, py: w, pz: E } = this, x = this.is0();
       f == null && (f = x ? n.ONE : n.inv(E));
-      const _ = n.mul(g, f), B = n.mul(b, f), A = n.mul(E, f);
+      const _ = n.mul(g, f), B = n.mul(w, f), A = n.mul(E, f);
       if (x)
         return { x: n.ZERO, y: n.ZERO };
       if (!n.eql(A, n.ONE))
@@ -2671,7 +2671,7 @@ function wc(t) {
     }
   }
   u.BASE = new u(e.Gx, e.Gy, n.ONE), u.ZERO = new u(n.ZERO, n.ONE, n.ZERO);
-  const w = e.nBitLength, m = hc(u, e.endo ? Math.ceil(w / 2) : w);
+  const y = e.nBitLength, m = pc(u, e.endo ? Math.ceil(y / 2) : y);
   return {
     CURVE: e,
     ProjectivePoint: u,
@@ -2680,7 +2680,7 @@ function wc(t) {
     isWithinCurveOrder: a
   };
 }
-function yc(t) {
+function bc(t) {
   const e = _r(t);
   return zt(e, {
     hash: "hash",
@@ -2692,8 +2692,8 @@ function yc(t) {
     lowS: "boolean"
   }), Object.freeze({ lowS: !0, ...e });
 }
-function bc(t) {
-  const e = yc(t), { Fp: n, n: r } = e, s = n.BYTES + 1, o = 2 * n.BYTES + 1;
+function Sc(t) {
+  const e = bc(t), { Fp: n, n: r } = e, s = n.BYTES + 1, o = 2 * n.BYTES + 1;
   function a(p) {
     return et < p && p < n.ORDER;
   }
@@ -2703,15 +2703,15 @@ function bc(t) {
   function c(p) {
     return Ne(p, r);
   }
-  const { ProjectivePoint: l, normPrivateKeyToScalar: d, weierstrassEquation: u, isWithinCurveOrder: w } = wc({
+  const { ProjectivePoint: l, normPrivateKeyToScalar: d, weierstrassEquation: u, isWithinCurveOrder: y } = yc({
     ...e,
-    toBytes(p, y, I) {
-      const P = y.toAffine(), C = n.toBytes(P.x), j = Lt;
-      return I ? j(Uint8Array.from([y.hasEvenY() ? 2 : 3]), C) : j(Uint8Array.from([4]), C, n.toBytes(P.y));
+    toBytes(p, b, I) {
+      const P = b.toAffine(), C = n.toBytes(P.x), j = Lt;
+      return I ? j(Uint8Array.from([b.hasEvenY() ? 2 : 3]), C) : j(Uint8Array.from([4]), C, n.toBytes(P.y));
     },
     fromBytes(p) {
-      const y = p.length, I = p[0], P = p.subarray(1);
-      if (y === s && (I === 2 || I === 3)) {
+      const b = p.length, I = p[0], P = p.subarray(1);
+      if (b === s && (I === 2 || I === 3)) {
         const C = X(P);
         if (!a(C))
           throw new Error("Point is not on curve");
@@ -2719,47 +2719,47 @@ function bc(t) {
         let z = n.sqrt(j);
         const H = (z & q) === q;
         return (I & 1) === 1 !== H && (z = n.neg(z)), { x: C, y: z };
-      } else if (y === o && I === 4) {
+      } else if (b === o && I === 4) {
         const C = n.fromBytes(P.subarray(0, n.BYTES)), j = n.fromBytes(P.subarray(n.BYTES, 2 * n.BYTES));
         return { x: C, y: j };
       } else
-        throw new Error(`Point of length ${y} was invalid. Expected ${s} compressed bytes or ${o} uncompressed bytes`);
+        throw new Error(`Point of length ${b} was invalid. Expected ${s} compressed bytes or ${o} uncompressed bytes`);
     }
   }), m = (p) => ht(Et(p, e.nByteLength));
   function S(p) {
-    const y = r >> q;
-    return p > y;
+    const b = r >> q;
+    return p > b;
   }
   function f(p) {
     return S(p) ? i(-p) : p;
   }
-  const g = (p, y, I) => X(p.slice(y, I));
-  class b {
-    constructor(y, I, P) {
-      this.r = y, this.s = I, this.recovery = P, this.assertValidity();
+  const g = (p, b, I) => X(p.slice(b, I));
+  class w {
+    constructor(b, I, P) {
+      this.r = b, this.s = I, this.recovery = P, this.assertValidity();
     }
     // pair (bytes of r, bytes of s)
-    static fromCompact(y) {
+    static fromCompact(b) {
       const I = e.nByteLength;
-      return y = V("compactSignature", y, I * 2), new b(g(y, 0, I), g(y, I, 2 * I));
+      return b = V("compactSignature", b, I * 2), new w(g(b, 0, I), g(b, I, 2 * I));
     }
     // DER encoded ECDSA signature
     // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script
-    static fromDER(y) {
-      const { r: I, s: P } = dt.toSig(V("DER", y));
-      return new b(I, P);
+    static fromDER(b) {
+      const { r: I, s: P } = dt.toSig(V("DER", b));
+      return new w(I, P);
     }
     assertValidity() {
-      if (!w(this.r))
+      if (!y(this.r))
         throw new Error("r must be 0 < r < CURVE.n");
-      if (!w(this.s))
+      if (!y(this.s))
         throw new Error("s must be 0 < s < CURVE.n");
     }
-    addRecoveryBit(y) {
-      return new b(this.r, this.s, y);
+    addRecoveryBit(b) {
+      return new w(this.r, this.s, b);
     }
-    recoverPublicKey(y) {
-      const { r: I, s: P, recovery: C } = this, j = v(V("msgHash", y));
+    recoverPublicKey(b) {
+      const { r: I, s: P, recovery: C } = this, j = v(V("msgHash", b));
       if (C == null || ![0, 1, 2, 3].includes(C))
         throw new Error("recovery id invalid");
       const z = C === 2 || C === 3 ? I + e.n : I;
@@ -2775,7 +2775,7 @@ function bc(t) {
       return S(this.s);
     }
     normalizeS() {
-      return this.hasHighS() ? new b(this.r, i(-this.s), this.recovery) : this;
+      return this.hasHighS() ? new w(this.r, i(-this.s), this.recovery) : this;
     }
     // DER-encoded
     toDERRawBytes() {
@@ -2806,8 +2806,8 @@ function bc(t) {
      * as per FIPS 186 B.4.1 with modulo bias being neglible.
      */
     randomPrivateKey: () => {
-      const p = e.randomBytes(n.BYTES + 8), y = lc(p, r);
-      return Et(y, e.nByteLength);
+      const p = e.randomBytes(n.BYTES + 8), b = uc(p, r);
+      return Et(b, e.nByteLength);
     },
     /**
      * Creates precompute table for an arbitrary EC point. Makes point "cached".
@@ -2817,27 +2817,27 @@ function bc(t) {
      * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey));
      * fast.multiply(privKey); // much faster ECDH now
      */
-    precompute(p = 8, y = l.BASE) {
-      return y._setWindowSize(p), y.multiply(BigInt(3)), y;
+    precompute(p = 8, b = l.BASE) {
+      return b._setWindowSize(p), b.multiply(BigInt(3)), b;
     }
   };
-  function x(p, y = !0) {
-    return l.fromPrivateKey(p).toRawBytes(y);
+  function x(p, b = !0) {
+    return l.fromPrivateKey(p).toRawBytes(b);
   }
   function _(p) {
-    const y = p instanceof Uint8Array, I = typeof p == "string", P = (y || I) && p.length;
-    return y ? P === s || P === o : I ? P === 2 * s || P === 2 * o : p instanceof l;
+    const b = p instanceof Uint8Array, I = typeof p == "string", P = (b || I) && p.length;
+    return b ? P === s || P === o : I ? P === 2 * s || P === 2 * o : p instanceof l;
   }
-  function B(p, y, I = !0) {
+  function B(p, b, I = !0) {
     if (_(p))
       throw new Error("first arg must be private key");
-    if (!_(y))
+    if (!_(b))
       throw new Error("second arg must be public key");
-    return l.fromHex(y).multiply(d(p)).toRawBytes(I);
+    return l.fromHex(b).multiply(d(p)).toRawBytes(I);
   }
   const A = e.bits2int || function(p) {
-    const y = X(p), I = p.length * 8 - e.nBitLength;
-    return I > 0 ? y >> BigInt(I) : y;
+    const b = X(p), I = p.length * 8 - e.nBitLength;
+    return I > 0 ? b >> BigInt(I) : b;
   }, v = e.bits2int_modN || function(p) {
     return i(A(p));
   }, T = pe(e.nBitLength);
@@ -2848,13 +2848,13 @@ function bc(t) {
       throw new Error(`bigint expected < 2^${e.nBitLength}`);
     return Et(p, e.nByteLength);
   }
-  function R(p, y, I = N) {
+  function R(p, b, I = N) {
     if (["recovered", "canonical"].some((lt) => lt in I))
       throw new Error("sign() legacy options not supported");
     const { hash: P, randomBytes: C } = e;
     let { lowS: j, prehash: z, extraEntropy: H } = I;
     j == null && (j = !0), p = V("msgHash", p), z && (p = V("prehashed msgHash", P(p)));
-    const st = v(p), ot = d(y), gt = [G(ot), G(st)];
+    const st = v(p), ot = d(b), gt = [G(ot), G(st)];
     if (H != null) {
       const lt = H === !0 ? C(n.BYTES) : H;
       gt.push(V("extraEntropy", lt, n.BYTES));
@@ -2862,7 +2862,7 @@ function bc(t) {
     const Bt = Lt(...gt), at = st;
     function we(lt) {
       const wt = A(lt);
-      if (!w(wt))
+      if (!y(wt))
         return;
       const Xe = c(wt), yt = l.BASE.multiply(wt).toAffine(), W = i(yt.x);
       if (W === et)
@@ -2871,35 +2871,35 @@ function bc(t) {
       if (bt === et)
         return;
       let Je = (yt.x === W ? 0 : 2) | Number(yt.y & q), Qe = bt;
-      return j && S(bt) && (Qe = f(bt), Je ^= 1), new b(W, Qe, Je);
+      return j && S(bt) && (Qe = f(bt), Je ^= 1), new w(W, Qe, Je);
     }
     return { seed: Bt, k2sig: we };
   }
   const N = { lowS: e.lowS, prehash: !1 }, L = { lowS: e.lowS, prehash: !1 };
-  function D(p, y, I = N) {
-    const { seed: P, k2sig: C } = R(p, y, I);
+  function D(p, b, I = N) {
+    const { seed: P, k2sig: C } = R(p, b, I);
     return Tr(e.hash.outputLen, e.nByteLength, e.hmac)(P, C);
   }
   l.BASE._setWindowSize(8);
-  function rt(p, y, I, P = L) {
+  function rt(p, b, I, P = L) {
     var yt;
     const C = p;
-    if (y = V("msgHash", y), I = V("publicKey", I), "strict" in P)
+    if (b = V("msgHash", b), I = V("publicKey", I), "strict" in P)
       throw new Error("options.strict was renamed to lowS");
     const { lowS: j, prehash: z } = P;
     let H, st;
     try {
       if (typeof C == "string" || C instanceof Uint8Array)
         try {
-          H = b.fromDER(C);
+          H = w.fromDER(C);
         } catch (W) {
           if (!(W instanceof dt.Err))
             throw W;
-          H = b.fromCompact(C);
+          H = w.fromCompact(C);
         }
       else if (typeof C == "object" && typeof C.r == "bigint" && typeof C.s == "bigint") {
         const { r: W, s: bt } = C;
-        H = new b(W, bt);
+        H = new w(W, bt);
       } else
         throw new Error("PARSE");
       st = l.fromHex(I);
@@ -2910,8 +2910,8 @@ function bc(t) {
     }
     if (j && H.hasHighS())
       return !1;
-    z && (y = e.hash(y));
-    const { r: ot, s: gt } = H, Bt = v(y), at = c(gt), we = i(Bt * at), lt = i(ot * at), wt = (yt = l.BASE.multiplyAndAddUnsafe(st, we, lt)) == null ? void 0 : yt.toAffine();
+    z && (b = e.hash(b));
+    const { r: ot, s: gt } = H, Bt = v(b), at = c(gt), we = i(Bt * at), lt = i(ot * at), wt = (yt = l.BASE.multiplyAndAddUnsafe(st, we, lt)) == null ? void 0 : yt.toAffine();
     return wt ? i(wt.x) === ot : !1;
   }
   return {
@@ -2921,7 +2921,7 @@ function bc(t) {
     sign: D,
     verify: rt,
     ProjectivePoint: l,
-    Signature: b,
+    Signature: w,
     utils: E
   };
 }
@@ -2929,7 +2929,7 @@ function Ce(t) {
   if (!Number.isSafeInteger(t) || t < 0)
     throw new Error(`Wrong positive integer: ${t}`);
 }
-function Sc(t) {
+function Ec(t) {
   if (typeof t != "boolean")
     throw new Error(`Expected boolean, not ${t}`);
 }
@@ -2939,18 +2939,18 @@ function Nr(t, ...e) {
   if (e.length > 0 && !e.includes(t.length))
     throw new TypeError(`Expected Uint8Array of length ${e}, not of length=${t.length}`);
 }
-function Ec(t) {
+function Ac(t) {
   if (typeof t != "function" || typeof t.create != "function")
     throw new Error("Hash should be wrapped by utils.wrapConstructor");
   Ce(t.outputLen), Ce(t.blockLen);
 }
-function Ac(t, e = !0) {
+function xc(t, e = !0) {
   if (t.destroyed)
     throw new Error("Hash instance has been destroyed");
   if (e && t.finished)
     throw new Error("Hash#digest() has already been called");
 }
-function xc(t, e) {
+function vc(t, e) {
   Nr(t);
   const n = e.outputLen;
   if (t.length < n)
@@ -2958,28 +2958,28 @@ function xc(t, e) {
 }
 const Yt = {
   number: Ce,
-  bool: Sc,
+  bool: Ec,
   bytes: Nr,
-  hash: Ec,
-  exists: Ac,
-  output: xc
+  hash: Ac,
+  exists: xc,
+  output: vc
 }, Ie = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const vc = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-if (!vc)
+const Ic = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+if (!Ic)
   throw new Error("Non little-endian hardware is not supported");
 Array.from({ length: 256 }, (t, e) => e.toString(16).padStart(2, "0"));
-function Ic(t) {
+function Tc(t) {
   if (typeof t != "string")
     throw new TypeError(`utf8ToBytes expected string, got ${typeof t}`);
   return new TextEncoder().encode(t);
 }
-function Tc(t) {
-  if (typeof t == "string" && (t = Ic(t)), !(t instanceof Uint8Array))
+function Bc(t) {
+  if (typeof t == "string" && (t = Tc(t)), !(t instanceof Uint8Array))
     throw new TypeError(`Expected input type is Uint8Array (got ${typeof t})`);
   return t;
 }
-function Bc(...t) {
+function _c(...t) {
   if (!t.every((r) => r instanceof Uint8Array))
     throw new Error("Uint8Array list expected");
   if (t.length === 1)
@@ -2991,21 +2991,21 @@ function Bc(...t) {
   }
   return n;
 }
-class _c {
+class Nc {
   // Safe version that clones internal state
   clone() {
     return this._cloneInto();
   }
 }
-function Nc(t = 32) {
+function Cc(t = 32) {
   if (Ie && typeof Ie.getRandomValues == "function")
     return Ie.getRandomValues(new Uint8Array(t));
   throw new Error("crypto.getRandomValues must be defined");
 }
-class Cr extends _c {
+class Cr extends Nc {
   constructor(e, n) {
     super(), this.finished = !1, this.destroyed = !1, Yt.hash(e);
-    const r = Tc(n);
+    const r = Bc(n);
     if (this.iHash = e.create(), typeof this.iHash.update != "function")
       throw new TypeError("Expected instance of class which extends utils.Hash");
     this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
@@ -3040,11 +3040,11 @@ class Cr extends _c {
 const Or = (t, e, n) => new Cr(t, e).update(n).digest();
 Or.create = (t, e) => new Cr(t, e);
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function Cc(t) {
+function Oc(t) {
   return {
     hash: t,
-    hmac: (e, ...n) => Or(t, e, Bc(...n)),
-    randomBytes: Nc
+    hmac: (e, ...n) => Or(t, e, _c(...n)),
+    randomBytes: Cc
   };
 }
 const Pn = BigInt("3618502788666131213697322783095070105526743751716087489154079457884512865583"), kr = 252;
@@ -3055,9 +3055,9 @@ function Rn(t) {
   return e > 0 ? n >> BigInt(e) : n;
 }
 function Pr(t) {
-  return typeof t == "string" && (t = Pc(t), t.length & 1 && (t = "0" + t)), pt(t);
+  return typeof t == "string" && (t = Rc(t), t.length & 1 && (t = "0" + t)), pt(t);
 }
-const Rr = bc({
+const Rr = Sc({
   a: BigInt(1),
   b: BigInt("3141592653589793238462643383279502884197169399375105820974944592307816406665"),
   Fp: Ke(BigInt("0x800000000000011000000000000000000000000000000000000000000000001")),
@@ -3067,21 +3067,21 @@ const Rr = bc({
   Gy: BigInt("152666792071518830868575557812948353041420400780739481342941381225525861407"),
   h: BigInt(1),
   lowS: !1,
-  ...Cc(Ar),
+  ...Oc(Ar),
   bits2int: Rn,
   bits2int_modN: (t) => {
     const e = X(t).toString(16);
     return e.length === 63 && (t = Pr(e + "0")), M(Rn(t), Pn);
   }
 });
-function Oc(t) {
+function kc(t) {
   return V("", typeof t == "string" ? Pr(t) : t);
 }
 const { CURVE: Bu, ProjectivePoint: kt, Signature: _u, utils: Nu } = Rr;
-function kc(t) {
+function Pc(t) {
   return `0x${ht(t.subarray(1)).replace(/^0+/gm, "")}`;
 }
-function Pc(t) {
+function Rc(t) {
   return t.replace(/^0x/i, "");
 }
 const Dt = [
@@ -3101,8 +3101,8 @@ function $r(t, e) {
     n.push(r), r = r.double();
   return n;
 }
-const Rc = $r(Dt[1], Dt[2]), $c = $r(Dt[3], Dt[4]);
-function Fc(t) {
+const $c = $r(Dt[1], Dt[2]), Fc = $r(Dt[3], Dt[4]);
+function Uc(t) {
   let e;
   if (typeof t == "bigint")
     e = t;
@@ -3111,13 +3111,13 @@ function Fc(t) {
       throw new Error(`Invalid pedersenArg: ${t}`);
     e = BigInt(t);
   } else
-    e = X(Oc(t));
+    e = X(kc(t));
   if (!(0n <= e && e < Rr.CURVE.Fp.ORDER))
     throw new Error(`PedersenArg should be 0 <= value < CURVE.P: ${e}`);
   return e;
 }
 function $n(t, e, n) {
-  let r = Fc(e);
+  let r = Uc(e);
   for (let s = 0; s < 252; s++) {
     const o = n[s];
     if (o.equals(t))
@@ -3126,33 +3126,33 @@ function $n(t, e, n) {
   }
   return t;
 }
-function Uc(t, e) {
+function jc(t, e) {
   let n = Dt[0];
-  return n = $n(n, t, Rc), n = $n(n, e, $c), kc(n.toRawBytes(!0));
+  return n = $n(n, t, $c), n = $n(n, e, Fc), Pc(n.toRawBytes(!0));
 }
-const jc = pe(250), Lc = (t) => X(Di(t)) & jc;
+const Lc = pe(250), Dc = (t) => X(Hi(t)) & Lc;
 Ke(BigInt("14474011154664525231415395255581126252639794253786371766033694892385558855681"));
-const Dc = Ke(BigInt("3618502788666131213697322783095070105623107215331596699973092056135872020481"));
-function Hc(t, e, n) {
+const Hc = Ke(BigInt("3618502788666131213697322783095070105623107215331596699973092056135872020481"));
+function Vc(t, e, n) {
   const r = t.fromBytes(Ar(gr(`${e}${n}`)));
   return t.create(r);
 }
-const Vc = [
+const Mc = [
   [3, 1, 1],
   [1, -1, 1],
   [1, 1, -2]
 ].map((t) => t.map(BigInt));
-function Mc(t, e) {
+function Gc(t, e) {
   if (qe(t.Fp), !Number.isSafeInteger(t.rate) || !Number.isSafeInteger(t.capacity))
     throw new Error(`Wrong poseidon opts: ${t}`);
   const n = t.rate + t.capacity, r = t.roundsFull + t.roundsPartial, s = [];
   for (let a = 0; a < r; a++) {
     const i = [];
     for (let c = 0; c < n; c++)
-      i.push(Hc(t.Fp, "Hades", n * a + c));
+      i.push(Vc(t.Fp, "Hades", n * a + c));
     s.push(i);
   }
-  const o = dc({
+  const o = fc({
     ...t,
     t: n,
     sboxPower: 3,
@@ -3162,12 +3162,12 @@ function Mc(t, e) {
   });
   return o.m = n, o.rate = t.rate, o.capacity = t.capacity, o;
 }
-Mc({ Fp: Dc, rate: 2, capacity: 1, roundsFull: 8, roundsPartial: 83 }, Vc);
+Gc({ Fp: Hc, rate: 2, capacity: 1, roundsFull: 8, roundsPartial: 83 }, Mc);
 var Oe;
 (function(t) {
   t.NOT_STARTED = "NOT_STARTED", t.ONGOING = "ONGOING", t.AWAITING_FUNDS = "AWAITING_FUNDS", t.AWAITING_COMPLETION = "AWAITING_COMPLETION", t.COMPLETED = "COMPLETED", t.CANCELLED = "CANCELLED", t.ERROR = "ERROR";
 })(Oe || (Oe = {}));
-const Gc = h.object({
+const zc = h.object({
   recoveryId: h.number()
 }), Cu = h.object({
   feeToken: se,
@@ -3179,14 +3179,14 @@ const Gc = h.object({
       s: Pt
     })
   })
-}), zc = h.nativeEnum(Oe), Fr = h.object({
+}), qc = h.nativeEnum(Oe), Fr = h.object({
   recoveryId: h.number(),
-  status: zc,
+  status: qc,
   completionTime: h.array(h.number()).optional()
-}), qc = h.object({
+}), Wc = h.object({
   activeRecovery: Fr.optional().or(h.null()).optional(),
   minFees: h.record(h.number()).optional()
-}), Wc = h.object({
+}), Kc = h.object({
   recovery: Fr.optional().or(h.null()).optional(),
   minFees: h.record(h.number()).optional()
 });
@@ -3194,8 +3194,8 @@ var ke;
 (function(t) {
   t.UNDEPLOYED_ACCOUNT = "undeployedAccount", t.NOT_ENOUGH_TO_PAY_FEES = "notEnoughToPayFees", t.RECOVERY_ALREADY_EXISTS = "recoveryAlreadyExists";
 })(ke || (ke = {}));
-const Kc = h.nativeEnum(ke), Ou = h.object({
-  status: Kc
+const Zc = h.nativeEnum(ke), Ou = h.object({
+  status: Zc
 });
 class ku {
   constructor(e, n) {
@@ -3209,7 +3209,7 @@ class ku {
    * @returns A promise that resolves to the on-chain recovery details.
    */
   async getRecovery(e, n) {
-    const r = k(this.apiBase, "accounts", "starknet", e, "recovery", `${n}`), s = await this.httpService.get(r), o = Wc.safeParse(s);
+    const r = k(this.apiBase, "accounts", "starknet", e, "recovery", `${n}`), s = await this.httpService.get(r), o = Kc.safeParse(s);
     return o.error ? null : o.data;
   }
   /**
@@ -3219,7 +3219,7 @@ class ku {
    * @returns A promise that resolves to the on-chain recovery details.
    */
   async getActiveRecovery(e) {
-    const n = k(this.apiBase, "accounts", "starknet", e, "recovery"), r = await this.httpService.get(n), s = qc.safeParse(r);
+    const n = k(this.apiBase, "accounts", "starknet", e, "recovery"), r = await this.httpService.get(n), s = Wc.safeParse(r);
     return s.error ? null : s.data;
   }
   /**
@@ -3231,7 +3231,7 @@ class ku {
    * @returns A promise that resolves to the recovery details.
    */
   async startRecovery(e, n, r, s) {
-    const { r: o, s: a } = us.starkCurve.sign(Uc(Lc(ys("utf8", "starknet:recovery")), r), s), i = {
+    const { r: o, s: a } = us.starkCurve.sign(jc(Dc(ys("utf8", "starknet:recovery")), r), s), i = {
       feeToken: n,
       signerSignature: {
         type: "StarknetKey",
@@ -3244,7 +3244,7 @@ class ku {
     };
     return await this.httpService.post(`${this.apiBase}/accounts/starknet/${e}/recovery`, {
       body: JSON.stringify(i)
-    }, Gc);
+    }, zc);
   }
   /**
    * Completes the recovery process for a given address and recovery ID.
@@ -3267,11 +3267,11 @@ async function Pu() {
   return !1;
 }
 let Te;
-function Zc() {
+function Yc() {
   return Te || (Te = new bs(navigator.userAgent).getResult()), Te;
 }
 function me(t) {
-  return Zc().browser.name === t;
+  return Yc().browser.name === t;
 }
 function Ru() {
   return me("Firefox");
@@ -3462,7 +3462,7 @@ const ju = h.string().refine((t) => Ss(t, Es), "Invalid seedphrase"), Ze = [
     networkId: "mainnet-alpha",
     image: "https://dv3jj1unlp2jl.cloudfront.net/128/color/ekubo.png"
   }
-], Yc = async (t, e, n) => {
+], Xc = async (t, e, n) => {
   const r = await n.callContract({
     contractAddress: t,
     entrypoint: "balanceOf",
@@ -3503,31 +3503,31 @@ const ju = h.string().refine((t) => Ss(t, Es), "Invalid seedphrase"), Ze = [
     return;
   const n = Number(e);
   return xt(t.toString(), n).value.toString();
-}, Gu = (t) => Y(t) ? Number(t) : 18, { UINT_256_MAX: Xc } = Ht, Jc = (t) => String(t) === String(Xc), zu = (t, e = "$", n) => {
+}, Gu = (t) => Y(t) ? Number(t) : 18, { UINT_256_MAX: Jc } = Ht, Qc = (t) => String(t) === String(Jc), zu = (t, e = "$", n) => {
   if (t === void 0 || !Y(t))
     return null;
   const r = gi(t, n);
   return [e, r].filter(Boolean).join("");
-}, Qc = "Unlimited", qu = ({ amount: t, decimals: e, symbol: n, showPlusSign: r = !1, withSymbol: s = !0, unlimitedText: o = Qc, prettyConfigOverrides: a }) => {
+}, tl = "Unlimited", qu = ({ amount: t, decimals: e, symbol: n, showPlusSign: r = !1, withSymbol: s = !0, unlimitedText: o = tl, prettyConfigOverrides: a }) => {
   if (!Y(t))
     return null;
   let i, c = !1;
-  if (Jc(t))
+  if (Qc(t))
     i = o;
   else {
     const d = Number(e), u = BigInt(t);
     c = u > 0n;
-    const w = d > 0 ? Mt({ value: u, decimals: d }) : u.toString();
-    i = d > 0 ? wi(w, a) : w;
+    const y = d > 0 ? Mt({ value: u, decimals: d }) : u.toString();
+    i = d > 0 ? wi(y, a) : y;
   }
   const l = [i, s && n].filter(Boolean).join(" ");
   return r && c ? `+${l}` : l;
 };
-var tl = Jr, el = tl;
-function nl(t, e) {
+var el = Jr, nl = el;
+function rl(t, e) {
   function n(r, s) {
     var o = e || {}, a;
-    "randomize" in o || (o.randomize = !0), a = el.operation(o);
+    "randomize" in o || (o.randomize = !0), a = nl.operation(o);
     function i(d) {
       s(d || new Error("Aborted"));
     }
@@ -3542,8 +3542,8 @@ function nl(t, e) {
       var u;
       try {
         u = t(i, d);
-      } catch (w) {
-        c(w, d);
+      } catch (y) {
+        c(y, d);
         return;
       }
       Promise.resolve(u).then(r).catch(function(m) {
@@ -3554,8 +3554,8 @@ function nl(t, e) {
   }
   return new Promise(n);
 }
-var rl = nl;
-const sl = /* @__PURE__ */ Qr(rl);
+var sl = rl;
+const ol = /* @__PURE__ */ Qr(sl);
 class Wu {
   constructor(e, n) {
     this.apiBase = e, this.httpService = n, this.TOKENS_INFO_URL = "/tokens/info", this.TOKENS_DEFI_DECOMPOSITION_URL = "/tokens/defi/decomposition";
@@ -3580,7 +3580,7 @@ class Wu {
    */
   async fetchAddressTokenBalancesFromBackend(e, n, r) {
     const s = k(this.apiBase, "activity", "starknet", n, "account", e, "balance");
-    return (await sl(
+    return (await ol(
       // eslint-disable-next-line @typescript-eslint/no-explicit-any
       async (i) => {
         let c;
@@ -3645,7 +3645,7 @@ const Ku = (t, e, n, r) => ({
 function Ur(t) {
   return $e(t.unit) === "WEI";
 }
-function ol(t) {
+function al(t) {
   return $e(t.unit) === "FRI";
 }
 function At(t, e) {
@@ -3673,13 +3673,13 @@ function Rt(t) {
   };
 }
 function Be(t) {
-  return ol({ unit: t }) ? Re : Vn;
+  return al({ unit: t }) ? Re : Vn;
 }
 function Xu(t, e, n = 2) {
   const r = BigInt(10 ** n), s = BigInt(Math.round(e * 10 ** n));
   return t * s / r;
 }
-const Ju = [Re], jr = (t, e = ul) => {
+const Ju = [Re], jr = (t, e = dl) => {
   if (t.max && "amount" in t.max)
     return {
       ...t,
@@ -3699,11 +3699,11 @@ const Ju = [Re], jr = (t, e = ul) => {
 }, re = (t) => {
   const { amount: e, pricePerUnit: n, dataGasConsumed: r = 0n, dataGasPrice: s = 0n } = t;
   return e * n + r * s;
-}, al = (t) => {
+}, il = (t) => {
   if (t.max)
     return "maxFee" in t.max ? t.max.maxFee : re(t.max);
 }, Pe = (t) => {
-  const e = al(t);
+  const e = il(t);
   return e || re(jr(t));
 }, Qu = (t) => {
   if (t.deployment && !nt(t.deployment.feeTokenAddress, t.transactions.feeTokenAddress))
@@ -3726,7 +3726,7 @@ const Ju = [Re], jr = (t, e = ul) => {
       amount: Ht.bnToUint256(BigInt(1))
     }))
   }
-], il = (t, e) => {
+], cl = (t, e) => {
   if (!t)
     return {
       transactions: {
@@ -3774,7 +3774,7 @@ const Ju = [Re], jr = (t, e = ul) => {
     };
   }
   throw Error("Unexpected simulation response length");
-}, cl = ({ transaction: t, nonce: e, chainId: n, version: r, isDeploymentTransaction: s, cairoVersion: o, address: a, appDomain: i }) => {
+}, ll = ({ transaction: t, nonce: e, chainId: n, version: r, isDeploymentTransaction: s, cairoVersion: o, address: a, appDomain: i }) => {
   let c = e;
   s && t.type !== "DEPLOY_ACCOUNT" && (c = O.toHex(1));
   const l = oe(t.calls);
@@ -3793,7 +3793,7 @@ const Ju = [Re], jr = (t, e = ul) => {
     appDomain: i
     // appDomain: "https://starknetkit-blacked-listed.vercel.app", // to simulate blacklisted domain
   };
-}, ll = (t, e) => {
+}, ul = (t, e) => {
   const { transactions: n } = t, r = n.map((c) => {
     if (!c.simulation)
       throw new as({ code: "SIMULATE_AND_REVIEW_FAILED" });
@@ -3801,7 +3801,7 @@ const Ju = [Re], jr = (t, e = ul) => {
   }), s = r.map((c) => ({
     ...c.simulation,
     feeEstimation: At(c.simulation.feeEstimation, Number)
-  })), o = il(s, e), [a, i] = r.length === 1 ? [r[0], void 0] : [r[1], r[0]];
+  })), o = cl(s, e), [a, i] = r.length === 1 ? [r[0], void 0] : [r[1], r[0]];
   return {
     ...o,
     transactions: {
@@ -3839,12 +3839,12 @@ const Ju = [Re], jr = (t, e = ul) => {
 }, rd = (t) => {
   const e = Math.sqrt(t);
   return isNaN(e) ? Math.sqrt(2) : e;
-}, ul = (t) => {
+}, dl = (t) => {
   const e = Math.cbrt(t);
   return isNaN(e) ? Math.cbrt(2) : e;
-}, sd = (t) => t < 1 || isNaN(t) ? 1.1 : Math.log(t + 1) + 1, dl = [Re];
+}, sd = (t) => t < 1 || isNaN(t) ? 1.1 : Math.log(t + 1) + 1, fl = [Re];
 function Ye({ address: t }) {
-  return dl.some((e) => nt(t, e));
+  return fl.some((e) => nt(t, e));
 }
 function od(t) {
   return t ? Aa().some((e) => nt(e, t)) : !1;
@@ -3880,44 +3880,44 @@ class cd {
     const e = k(this.apiBase, "reviewer", "warnings/reasons");
     return await this.httpService.get(e);
   }
-  async simulateAndReview(e, n, r, s, o) {
-    const a = n.some((i) => i.type === "DEPLOY_ACCOUNT");
+  async simulateAndReview(e, n, r, s, o, a) {
+    const i = n.some((c) => c.type === "DEPLOY_ACCOUNT");
     try {
       if (!("getChainId" in e))
         throw new Error("MISSING_METHOD");
-      const i = Fn(r), c = a ? "0x0" : await e.getNonce(), l = await e.getChainId(), d = {
-        transactions: n.map((f) => ({
-          ...cl({
-            transaction: f,
-            nonce: c,
-            version: i,
-            chainId: l,
-            isDeploymentTransaction: a,
+      const c = Fn(r), l = i ? "0x0" : await e.getNonce(), d = await e.getChainId(), u = {
+        transactions: n.map((w) => ({
+          ...ll({
+            transaction: w,
+            nonce: l,
+            version: c,
+            chainId: d,
+            isDeploymentTransaction: i,
             appDomain: s,
             cairoVersion: e.cairoVersion,
             address: e.address
           }),
-          type: f.type
+          type: w.type
         }))
-      }, u = k(this.apiBase, "reviewer", "transactions", "v2", "review", "starknet"), w = await this.httpService.post(u, {
+      }, y = k(this.apiBase, "reviewer", "transactions", "v2", "review", "starknet"), m = a ? bi(y, { delayedTransaction: "true" }) : y, S = await this.httpService.post(m, {
         headers: {
           Accept: "application/json",
           "Content-Type": "application/json"
         },
-        body: JSON.stringify(d)
+        body: JSON.stringify(u)
       }, cs);
-      if (w.transactions.some((f) => ls(f)))
-        return w;
-      const S = ll(w, r);
+      if (S.transactions.some((w) => ls(w)))
+        return S;
+      const g = ul(S, r);
       return {
-        ...w,
-        enrichedFeeEstimation: S
+        ...S,
+        enrichedFeeEstimation: g
       };
-    } catch (i) {
-      return console.error(i), this.fallbackToOnchainFeeEstimation({
+    } catch (c) {
+      return console.error(c), this.fallbackToOnchainFeeEstimation({
         transactions: n,
         account: e,
-        isDeploymentTransaction: a,
+        isDeploymentTransaction: i,
         feeTokenAddress: r,
         accountDeployTransaction: o
       });
@@ -4040,7 +4040,7 @@ const ld = [
 ], ud = (t) => ({ showBalanceChange: vt(() => {
   const n = t == null ? void 0 : t.some((s) => !un(s.transfers)), r = t == null ? void 0 : t.some((s) => !un(s.approvals));
   return t && (n || r);
-}, [t]) }), ge = (t) => t ? t.filter((e) => e.token.type === "erc20") : [], dd = (t) => vt(() => ge(t), [t]), fd = (t) => ge(t).length > 0, hd = (t) => ge(t).some((n) => n.amount > 0n), pd = (t) => ge(t).some((n) => n.amount < 0n), Lr = (t) => t ? t.filter((e) => e.token.type === "erc721") : [], md = (t) => vt(() => Lr(t), [t]), fl = (t) => Lr(t).length > 0, gd = (t) => vt(() => fl(t), [t]), wd = (t, e) => vt(() => t && e ? [
+}, [t]) }), ge = (t) => t ? t.filter((e) => e.token.type === "erc20") : [], dd = (t) => vt(() => ge(t), [t]), fd = (t) => ge(t).length > 0, hd = (t) => ge(t).some((n) => n.amount > 0n), pd = (t) => ge(t).some((n) => n.amount < 0n), Lr = (t) => t ? t.filter((e) => e.token.type === "erc721") : [], md = (t) => vt(() => Lr(t), [t]), hl = (t) => Lr(t).length > 0, gd = (t) => vt(() => hl(t), [t]), wd = (t, e) => vt(() => t && e ? [
   {
     contractAddress: t.address,
     entrypoint: "transfer",
@@ -4078,7 +4078,7 @@ const ld = [
     warn: e,
     reason: r
   };
-}, hl = (t) => {
+}, pl = (t) => {
   var e;
   if (t) {
     for (const n of t.reviews)
@@ -4093,7 +4093,7 @@ const ld = [
       if (((n = r.activity) == null ? void 0 : n.type) === t)
         return r.activity;
   }
-}, Ad = (t) => !!hl(t), xd = (t) => {
+}, Ad = (t) => !!pl(t), xd = (t) => {
   var e, n;
   if (t) {
     for (const r of t.reviews)
@@ -4103,48 +4103,49 @@ const ld = [
           type: (n = r.activity) == null ? void 0 : n.type
         };
   }
-}, pl = async ({ feeTokenAddress: t, calls: e, selectedAccount: n, transactionReviewService: r, appDomain: s, accountDeployTransaction: o }) => {
-  const a = {
+}, ml = async ({ feeTokenAddress: t, calls: e, selectedAccount: n, transactionReviewService: r, appDomain: s, accountDeployTransaction: o, isDelayedTransaction: a }) => {
+  const i = {
     type: "INVOKE",
     calls: oe(e)
   };
   if (!n || !t)
     return;
-  const i = o ? [o, a] : [a];
-  return { result: await r.simulateAndReview(n, i, t, s, o) };
-}, ml = async (t, e, n, r) => {
-  var w, m, S, f, g, b;
+  const c = o ? [o, i] : [i];
+  return { result: await r.simulateAndReview(n, c, t, s, o, a) };
+}, gl = async (t, e, n, r) => {
+  var y, m, S, f, g, w;
   let s = !1;
   const o = e.transactions.find((E) => {
     var x, _;
     return (_ = (x = E == null ? void 0 : E.simulation) == null ? void 0 : x.summary) == null ? void 0 : _.find((B) => B.sent);
   });
-  if (!o || !((w = o.simulation) != null && w.summary))
+  if (!o || !((y = o.simulation) != null && y.summary))
     return s;
   const a = o.simulation.summary.filter((E) => E.sent).map((E) => E.token.address);
   if (!(((m = e.enrichedFeeEstimation) == null ? void 0 : m.transactions.feeTokenAddress) && a.includes((S = e.enrichedFeeEstimation) == null ? void 0 : S.transactions.feeTokenAddress)) || !((g = (f = e.enrichedFeeEstimation) == null ? void 0 : f.transactions) != null && g.max))
     return s;
-  const c = "amount" in e.enrichedFeeEstimation.transactions.max ? e.enrichedFeeEstimation.transactions.max.amount * e.enrichedFeeEstimation.transactions.max.pricePerUnit : "maxFee" in e.enrichedFeeEstimation.transactions.max ? e.enrichedFeeEstimation.transactions.max.maxFee : void 0, l = (b = o.simulation.summary.find((E) => E.sent && E.token.address === n)) == null ? void 0 : b.value;
+  const c = "amount" in e.enrichedFeeEstimation.transactions.max ? e.enrichedFeeEstimation.transactions.max.amount * e.enrichedFeeEstimation.transactions.max.pricePerUnit : "maxFee" in e.enrichedFeeEstimation.transactions.max ? e.enrichedFeeEstimation.transactions.max.maxFee : void 0, l = (w = o.simulation.summary.find((E) => E.sent && E.token.address === n)) == null ? void 0 : w.value;
   if (!c || !l)
     return s;
-  const d = await Yc(n, t, r) ?? 0n;
+  const d = await Xc(n, t, r) ?? 0n;
   return BigInt(d) > c + BigInt(l) || (s = !0), s;
-}, vd = () => qn(async ({ feeTokenAddress: e, calls: n, selectedAccount: r, transactionReviewService: s, appDomain: o, accountDeployPayload: a, provider: i }) => {
+}, vd = () => qn(async ({ feeTokenAddress: e, calls: n, selectedAccount: r, transactionReviewService: s, appDomain: o, accountDeployPayload: a, provider: i, isDelayedTransaction: c }) => {
   if (!r)
     return;
-  const c = await pl({
+  const l = await ml({
     feeTokenAddress: e,
     calls: n,
     selectedAccount: r,
     transactionReviewService: s,
     appDomain: o,
-    accountDeployTransaction: gl(a)
+    accountDeployTransaction: wl(a),
+    isDelayedTransaction: c
   });
-  if (!c || !c.result || !e)
+  if (!l || !l.result || !e)
     return;
-  const l = await ml(r.address, c.result, e, i);
-  return { ...c.result, isSendingMoreThanBalanceAndGas: l };
-}, []), gl = (t) => t ? {
+  const d = await gl(r.address, l.result, e, i);
+  return { ...l.result, isSendingMoreThanBalanceAndGas: d };
+}, []), wl = (t) => t ? {
   type: "DEPLOY_ACCOUNT",
   calldata: t.calldata,
   classHash: Pt.parse(t.class_hash),
@@ -4169,24 +4170,24 @@ function Id(t) {
     }
   };
 }
-const wl = fs({}), Td = ({ enabled: t, initialize: e, children: n }) => {
+const yl = fs({}), Td = ({ enabled: t, initialize: e, children: n }) => {
   const [r, s] = zn(!1);
   return Ft(() => {
     !r && t && e().then(() => s(!0));
-  }, [r, t, e]), /* @__PURE__ */ xs(wl.Provider, { value: {}, children: n });
+  }, [r, t, e]), /* @__PURE__ */ xs(yl.Provider, { value: {}, children: n });
 };
 export {
   tt as ARGENT_ACCOUNT_CONTRACT_CLASS_HASHES,
   Jt as ARGENT_MULTISIG_CONTRACT_CLASS_HASHES,
-  Cl as AddSmartAccountResponseSchema,
-  Ol as AddSmartAcountRequestSchema,
+  Ol as AddSmartAccountResponseSchema,
+  kl as AddSmartAcountRequestSchema,
   vs as BackendAccountSchema,
   bu as BackendNftService,
   Nd as BaseError,
   eo as C0_PROXY_CONTRACT_CLASS_HASHES,
-  Ll as CacheService,
+  Dl as CacheService,
   Vt as DEFAULT_TOKEN_DECIMALS,
-  Dl as DateService,
+  Hl as DateService,
   Cd as ESTIMATE_ERROR_MESSAGES,
   Vn as ETH_TOKEN_ADDRESS,
   as as EstimateError,
@@ -4196,16 +4197,16 @@ export {
   Le as HTTPService,
   tn as HTTP_ERROR_MESSAGE,
   K as HttpError,
-  eu as KnownDappsBackendService,
+  nu as KnownDappsBackendService,
   rn as MultiSigner,
   ku as OnchainRecoveryService,
-  Qc as PRETTY_UNLIMITED,
+  tl as PRETTY_UNLIMITED,
   Oe as RecoveryStatusEnum,
-  ru as ResolveNameService,
+  su as ResolveNameService,
   Kr as STANDARD_DEVNET_ACCOUNT_CLASS_HASH,
   Re as STRK_TOKEN_ADDRESS,
-  Hl as SWRService,
-  Wl as StarknetAddressService,
+  Vl as SWRService,
+  Kl as StarknetAddressService,
   ke as StartOnchainRecoveryErrorStatusEnum,
   Rd as TOKEN_ERROR_MESSAGES,
   $d as TXV1_ACCOUNT_CLASS_HASH,
@@ -4219,7 +4220,7 @@ export {
   Id as WebAnalyticsServiceFactory,
   Ld as abiEntrySchema,
   Dd as abiSchema,
-  qc as activeOnchainRecoverySchema,
+  Wc as activeOnchainRecoverySchema,
   Hd as addOwnersCalldataSchema,
   Vd as addPluginCalldataSchema,
   Md as addressInputCharactersAndLengthSchema,
@@ -4256,11 +4257,11 @@ export {
   is as argentMaxFee,
   hf as argentNameSchema,
   Ts as argentNetworkIdSchema,
-  jl as bigDecimal,
+  Ll as bigDecimal,
   pf as bigNumberSchema,
   mf as bigNumberishSchema,
   gf as booleanToStringSchema,
-  gl as buildAccountDeployTransaction,
+  wl as buildAccountDeployTransaction,
   Ia as buildConstructorCalldata,
   ed as buildDummyTx,
   wf as builtinsSchema,
@@ -4268,7 +4269,7 @@ export {
   bf as cairo1EventSchema,
   Sf as cairoAssemblySchema,
   Ef as cairoVersionSchema,
-  ul as calculateCubeRootAdjustment,
+  dl as calculateCubeRootAdjustment,
   sd as calculateNonLinearAdjustment,
   rd as calculateSqrtAdjustment,
   Af as callDetailsSchema,
@@ -4277,7 +4278,7 @@ export {
   At as castFeeEstimation,
   vf as changeGuardianCalldataSchema,
   If as changeThresholdCalldataSchema,
-  ml as checkGasFeeBalance,
+  gl as checkGasFeeBalance,
   od as classHashSupportsTxV3,
   Tf as collateralizedDebtGroupSchema,
   Bf as collateralizedDebtPositionSchema,
@@ -4295,9 +4296,9 @@ export {
   Mu as convertTokenUnitAmountWithDecimals,
   _a as dappContractSchema,
   Ba as dappLinkSchema,
-  cu as daysBetween,
+  lu as daysBetween,
   mi as decodeBase58,
-  iu as decodeBase58Array,
+  cu as decodeBase58Array,
   Ff as defiDappsProductsSchema,
   Uf as defiPositionSchema,
   jf as defiPositionTypeSchema,
@@ -4305,10 +4306,10 @@ export {
   Df as defiProductsSchema,
   Hf as denyTxV3,
   pi as encodeBase58,
-  au as encodeBase58Array,
+  iu as encodeBase58Array,
   oe as ensureArray,
   Gu as ensureDecimals,
-  gu as entryPointToHumanReadable,
+  wu as entryPointToHumanReadable,
   Vf as entryPointsByTypeSchema,
   vu as equalNft,
   Ku as erc20TransferTransaction,
@@ -4327,7 +4328,7 @@ export {
   Wf as feltSchema,
   tr as fetchData,
   Xt as fetcherError,
-  Jl as findImplementationForAccount,
+  Ql as findImplementationForAccount,
   Kf as findTransfersAndApprovals,
   or as formatAddress,
   Zf as formatFullAddress,
@@ -4339,54 +4340,54 @@ export {
   ee as generateAvatarImage,
   Ta as getAccountContractAddress,
   va as getAccountDeploymentPayload,
-  Gl as getAccountIdentifier,
+  zl as getAccountIdentifier,
   qr as getAddressFromArgentName,
   to as getAddressFromStarkName,
   hn as getArgentAccountClassHashes,
   Aa as getArgentAccountClassHashesWithTxV3Support,
   Ea as getArgentAccountWithMultiSignerClassHashes,
-  ql as getBackendTimeNowSeconds,
+  Wl as getBackendTimeNowSeconds,
   Zs as getBackendTimeSeconds,
   Qs as getCallFromStarkName,
   Ys as getChainIdFromNetworkId,
   fi as getColor,
   Oa as getDapplandLinkForDapp,
-  nu as getDapplandUrlForDapp,
+  ru as getDapplandUrlForDapp,
   bd as getDisplayWarnAndReasonForTransactionReview,
   ge as getERC20Transactions,
   Lr as getERC721Transactions,
-  il as getEstimatedFeeFromBulkSimulation,
-  ll as getEstimatedFeeFromSimulationAndRespectWatermarkFee,
+  cl as getEstimatedFeeFromBulkSimulation,
+  ul as getEstimatedFeeFromSimulationAndRespectWatermarkFee,
   ui as getInitials,
-  Zl as getLastCairo0ArgentAccountClassHash,
+  Yl as getLastCairo0ArgentAccountClassHash,
   Sa as getLatestArgentAccountClassHash,
-  Kl as getLatestArgentMultisigClassHash,
-  Xl as getLatestLedgerAccountClassHash,
-  Yl as getLedgerAccountClassHashes,
+  Zl as getLatestArgentMultisigClassHash,
+  Jl as getLatestLedgerAccountClassHash,
+  Xl as getLedgerAccountClassHashes,
   eh as getMessageFromTrpcError,
   Sd as getNFTTransferActivity,
-  ou as getNetworkAccountImageUrl,
+  au as getNetworkAccountImageUrl,
   xu as getNftPicture,
-  cl as getPayloadFromTransaction,
+  ll as getPayloadFromTransaction,
   nh as getPrettyRpcError,
-  pl as getReviewForTransactions,
+  ml as getReviewForTransactions,
   nn as getSignerForMultiSigner,
   ad as getSimulationTxVersionFromFeeToken,
   Js as getStarknetIdContractAddressFromNetworkId,
-  Yc as getTokenBalance,
+  Xc as getTokenBalance,
   Du as getTokens,
   Lu as getTokensBalances,
   Ed as getTransactionReviewActivityOfType,
   Ad as getTransactionReviewHasSwap,
-  hl as getTransactionReviewSwap,
+  pl as getTransactionReviewSwap,
   xd as getTransactionReviewWithType,
   Fn as getTxVersionFromFeeToken,
   id as getTxVersionFromFeeTokenForDeclareContract,
-  Zc as getUAParserResult,
+  Yc as getUAParserResult,
   jt as getUint256CalldataFromBN,
-  al as getWatermarkedMaxFeeTotal,
+  il as getWatermarkedMaxFeeTotal,
   fd as hasERC20Transactions,
-  fl as hasERC721Transactions,
+  hl as hasERC721Transactions,
   hd as hasIncomingERC20Transactions,
   pd as hasOutgoingERC20Transactions,
   Pt as hexSchema,
@@ -4395,33 +4396,33 @@ export {
   en as implementationSchema,
   sh as includesAddress,
   oh as inputAmountSchema,
-  Rl as isAccountV4,
-  Pl as isAccountV5,
-  kl as isAccountV6,
+  $l as isAccountV4,
+  Rl as isAccountV5,
+  Pl as isAccountV6,
   Mr as isAddress,
-  fu as isAllowedAddressHexInputValue,
-  hu as isAllowedNumericInputValue,
-  Ul as isArgentBackendNetworkId,
+  hu as isAllowedAddressHexInputValue,
+  pu as isAllowedNumericInputValue,
+  jl as isArgentBackendNetworkId,
   zr as isArgentName,
-  Fl as isArgentNetworkId,
+  Ul as isArgentNetworkId,
   Pu as isBraveBrowser,
   me as isBrowser,
   $u as isChromeBrowser,
-  uu as isContractDeployed,
+  du as isContractDeployed,
   Uu as isEdgeBrowser,
   nt as isEqualAddress,
   ah as isEqualArgentName,
   xa as isEqualImplementation,
   ih as isEqualStarknetDomainName,
   ch as isEqualStarknetId,
-  ol as isFRI,
-  lu as isFeatureEnabled,
+  al as isFRI,
+  uu as isFeatureEnabled,
   Ru as isFirefoxBrowser,
   Y as isNumeric,
   Fu as isSafariBrowser,
   lh as isStarknetDomainName,
   Gr as isStarknetId,
-  Jc as isUnlimitedAmount,
+  Qc as isUnlimitedAmount,
   Vr as isValidAddress,
   uh as isValidInputAmount,
   Ur as isWEI,
@@ -4439,17 +4440,17 @@ export {
   Fa as nameResolutionAddressesSchema,
   sr as nameResolutionStarknetIdSchema,
   ka as nameResolutionStarknetIdsSchema,
-  du as nonNullable,
+  fu as nonNullable,
   Dn as normalizeAddress,
   gh as normalizeAddressOrDomain,
   wh as normalizeArgentName,
   yh as normalizeStarknetId,
-  Wc as onchainRecoverySchema,
+  Kc as onchainRecoverySchema,
   bh as parseAmount,
   yi as parseAmountValue,
-  pu as pluralise,
-  Vl as postData,
-  $l as preferencesEndpointPayload,
+  mu as pluralise,
+  Ml as postData,
+  Fl as preferencesEndpointPayload,
   Is as preferencesSchema,
   gi as prettifyCurrencyNumber,
   zu as prettifyCurrencyValue,
@@ -4464,10 +4465,10 @@ export {
   xh as rawArgsArraySchema,
   vh as rawArgsObjectSchema,
   Ih as rawArgsSchema,
-  mu as readFileAsString,
+  gu as readFileAsString,
   Fr as recoveryBaseSchema,
   Cu as recoveryBodySchema,
-  zc as recoveryStatusSchema,
+  qc as recoveryStatusSchema,
   Th as removeOwnersCalldataSchema,
   Bh as removePluginCalldataSchema,
   _h as replaceSignerCalldataSchema,
@@ -4479,12 +4480,12 @@ export {
   kh as starknetDomainNameSchema,
   Xr as starknetIdSchema,
   Ou as startOnchainRecoveryErrorSchema,
-  Kc as startOnchainRecoveryErrorStatusSchema,
-  Gc as startOnchainRecoverySchema,
+  Zc as startOnchainRecoveryErrorStatusSchema,
+  zc as startOnchainRecoverySchema,
   Ph as stringToBooleanSchema,
   hi as stripAddressZeroPadding,
   Rh as structAbiSchema,
-  zl as swrRefetchDisabledConfig,
+  ql as swrRefetchDisabledConfig,
   Rt as toMax,
   Ju as tokensRequireTxV3Support,
   $h as transactionReviewTransactionsSchema,
@@ -4495,12 +4496,12 @@ export {
   Lh as uint256Schema,
   Dh as unclaimedRewardsSchema,
   Be as unitToFeeTokenAddress,
-  wu as urlWithQuery,
+  bi as urlWithQuery,
   ud as useBalanceChange,
   Eu as useCollection,
   Ks as useConditionallyEnabledSWR,
-  Ql as useDebounce,
-  tu as useDebouncedValue,
+  tu as useDebounce,
+  eu as useDebouncedValue,
   dd as useERC20Transactions,
   md as useERC721Transactions,
   Hh as useEmitEvent,
@@ -4518,5 +4519,5 @@ export {
   qh as validChecksumAddressSchema,
   Wh as validateAddressRangeSchema,
   yu as voidify,
-  Ml as withPolling
+  Gl as withPolling
 };