@chainrails/react 0.4.1 → 0.4.2

package/dist/chainrails-sdk.es.js

@@ -522,7 +522,7 @@ const Ma = (t) => {
   POLYGON: "POLYGON_MAINNET",
   STARKNET: "STARKNET_MAINNET",
   STARKNET_TESTNET: "STARKNET_TESTNET"
-}, rI = {
+}, oI = {
   ARBITRUM: "ARBITRUM",
   ARBITRUM_TESTNET: "ARBITRUM_TESTNET",
   AVALANCHE: "AVALANCHE",
@@ -1697,7 +1697,7 @@ let rm = class {
     return Ve().post("modal/sessions", { json: s }).json().then((i) => ({ ...i, amount: s.amount }));
   }
 };
-const mI = {
+const bI = {
   router: new im(),
   quotes: new sm(),
   intents: new rm(),
@@ -3035,10 +3035,10 @@ function Og(t, e, { length: n, staticPosition: r }) {
     const I = [];
     for (let N = 0; N < m; ++N) {
       t.setPosition(d + (g ? N * 32 : S));
-      const [P, M] = Or(t, e, {
+      const [F, M] = Or(t, e, {
         staticPosition: d
       });
-      S += M, I.push(P);
+      S += M, I.push(F);
     }
     return t.setPosition(r + 32), [I, 32];
   }
@@ -3530,7 +3530,7 @@ class sy extends de {
           const [N] = I;
           d = qg[N];
         } else {
-          const N = g ? Mr(g, { includeName: !0 }) : void 0, P = g && I ? hf({
+          const N = g ? Mr(g, { includeName: !0 }) : void 0, F = g && I ? hf({
             abiItem: g,
             args: I,
             includeFunctionName: !1,
@@ -3538,7 +3538,7 @@ class sy extends de {
           }) : void 0;
           a = [
             N ? `Error: ${N}` : "",
-            P && P !== "()" ? `       ${[...Array(S?.length ?? 0).keys()].map(() => " ").join("")}${P}` : ""
+            F && F !== "()" ? `       ${[...Array(S?.length ?? 0).keys()].map(() => " ").join("")}${F}` : ""
           ];
         }
       } catch (g) {
@@ -4099,7 +4099,7 @@ class cy extends Ht {
 }
 const uy = 3;
 function dy(t, { abi: e, address: n, args: r, docsPath: s, functionName: i, sender: o }) {
-  const a = t instanceof oy ? t : t instanceof de ? t.walk((P) => "data" in P) || t.walk() : {}, { code: d, data: m, details: g, message: S, shortMessage: I } = a, N = t instanceof Ac ? new iy({ functionName: i }) : [uy, or.code].includes(d) && (m || g || S || I) || d === Lr.code && g === "execution reverted" && m ? new sy({
+  const a = t instanceof oy ? t : t instanceof de ? t.walk((F) => "data" in F) || t.walk() : {}, { code: d, data: m, details: g, message: S, shortMessage: I } = a, N = t instanceof Ac ? new iy({ functionName: i }) : [uy, or.code].includes(d) && (m || g || S || I) || d === Lr.code && g === "execution reverted" && m ? new sy({
     abi: e,
     data: typeof m == "object" ? m.data : m,
     functionName: i,
@@ -4597,8 +4597,8 @@ async function wy({ hash: t, signature: e }) {
   const n = Vn(t) ? t : La(t), { secp256k1: r } = await Promise.resolve().then(() => O1);
   return `0x${(() => {
     if (typeof e == "object" && "r" in e && "s" in e) {
-      const { r: m, s: g, v: S, yParity: I } = e, N = Number(I ?? S), P = ud(N);
-      return new r.Signature(Br(m), Br(g)).addRecoveryBit(P);
+      const { r: m, s: g, v: S, yParity: I } = e, N = Number(I ?? S), F = ud(N);
+      return new r.Signature(Br(m), Br(g)).addRecoveryBit(F);
     }
     const o = Vn(e) ? e : La(e);
     if (wt(o) !== 65)
@@ -5093,8 +5093,8 @@ class $y extends Mf {
     for (let S = 0; S < 16; S++, n += 4)
       Cn[S] = e.getUint32(n, !1);
     for (let S = 16; S < 64; S++) {
-      const I = Cn[S - 15], N = Cn[S - 2], P = cn(I, 7) ^ cn(I, 18) ^ I >>> 3, M = cn(N, 17) ^ cn(N, 19) ^ N >>> 10;
-      Cn[S] = M + Cn[S - 7] + P + Cn[S - 16] | 0;
+      const I = Cn[S - 15], N = Cn[S - 2], F = cn(I, 7) ^ cn(I, 18) ^ I >>> 3, M = cn(N, 17) ^ cn(N, 19) ^ N >>> 10;
+      Cn[S] = M + Cn[S - 7] + F + Cn[S - 16] | 0;
     }
     let { A: r, B: s, C: i, D: o, E: a, F: d, G: m, H: g } = this;
     for (let S = 0; S < 64; S++) {
@@ -5198,28 +5198,28 @@ class Vy extends Mf {
   }
   // prettier-ignore
   get() {
-    const { Ah: e, Al: n, Bh: r, Bl: s, Ch: i, Cl: o, Dh: a, Dl: d, Eh: m, El: g, Fh: S, Fl: I, Gh: N, Gl: P, Hh: M, Hl: k } = this;
-    return [e, n, r, s, i, o, a, d, m, g, S, I, N, P, M, k];
+    const { Ah: e, Al: n, Bh: r, Bl: s, Ch: i, Cl: o, Dh: a, Dl: d, Eh: m, El: g, Fh: S, Fl: I, Gh: N, Gl: F, Hh: M, Hl: k } = this;
+    return [e, n, r, s, i, o, a, d, m, g, S, I, N, F, M, k];
   }
   // prettier-ignore
-  set(e, n, r, s, i, o, a, d, m, g, S, I, N, P, M, k) {
-    this.Ah = e | 0, this.Al = n | 0, this.Bh = r | 0, this.Bl = s | 0, this.Ch = i | 0, this.Cl = o | 0, this.Dh = a | 0, this.Dl = d | 0, this.Eh = m | 0, this.El = g | 0, this.Fh = S | 0, this.Fl = I | 0, this.Gh = N | 0, this.Gl = P | 0, this.Hh = M | 0, this.Hl = k | 0;
+  set(e, n, r, s, i, o, a, d, m, g, S, I, N, F, M, k) {
+    this.Ah = e | 0, this.Al = n | 0, this.Bh = r | 0, this.Bl = s | 0, this.Ch = i | 0, this.Cl = o | 0, this.Dh = a | 0, this.Dl = d | 0, this.Eh = m | 0, this.El = g | 0, this.Fh = S | 0, this.Fl = I | 0, this.Gh = N | 0, this.Gl = F | 0, this.Hh = M | 0, this.Hl = k | 0;
   }
   process(e, n) {
-    for (let j = 0; j < 16; j++, n += 4)
-      Mn[j] = e.getUint32(n), Bn[j] = e.getUint32(n += 4);
-    for (let j = 16; j < 80; j++) {
-      const U = Mn[j - 15] | 0, V = Bn[j - 15] | 0, J = br(U, V, 1) ^ br(U, V, 8) ^ Ju(U, V, 7), ne = _r(U, V, 1) ^ _r(U, V, 8) ^ Xu(U, V, 7), te = Mn[j - 2] | 0, z = Bn[j - 2] | 0, C = br(te, z, 19) ^ ii(te, z, 61) ^ Ju(te, z, 6), F = _r(te, z, 19) ^ oi(te, z, 61) ^ Xu(te, z, 6), q = $m(ne, F, Bn[j - 7], Bn[j - 16]), w = zm(q, J, C, Mn[j - 7], Mn[j - 16]);
-      Mn[j] = w | 0, Bn[j] = q | 0;
+    for (let z = 0; z < 16; z++, n += 4)
+      Mn[z] = e.getUint32(n), Bn[z] = e.getUint32(n += 4);
+    for (let z = 16; z < 80; z++) {
+      const U = Mn[z - 15] | 0, j = Bn[z - 15] | 0, J = br(U, j, 1) ^ br(U, j, 8) ^ Ju(U, j, 7), ne = _r(U, j, 1) ^ _r(U, j, 8) ^ Xu(U, j, 7), te = Mn[z - 2] | 0, V = Bn[z - 2] | 0, C = br(te, V, 19) ^ ii(te, V, 61) ^ Ju(te, V, 6), L = _r(te, V, 19) ^ oi(te, V, 61) ^ Xu(te, V, 6), G = $m(ne, L, Bn[z - 7], Bn[z - 16]), w = zm(G, J, C, Mn[z - 7], Mn[z - 16]);
+      Mn[z] = w | 0, Bn[z] = G | 0;
     }
-    let { Ah: r, Al: s, Bh: i, Bl: o, Ch: a, Cl: d, Dh: m, Dl: g, Eh: S, El: I, Fh: N, Fl: P, Gh: M, Gl: k, Hh: K, Hl: Y } = this;
-    for (let j = 0; j < 80; j++) {
-      const U = br(S, I, 14) ^ br(S, I, 18) ^ ii(S, I, 41), V = _r(S, I, 14) ^ _r(S, I, 18) ^ oi(S, I, 41), J = S & N ^ ~S & M, ne = I & P ^ ~I & k, te = jm(Y, V, ne, jy[j], Bn[j]), z = Vm(te, K, U, J, zy[j], Mn[j]), C = te | 0, F = br(r, s, 28) ^ ii(r, s, 34) ^ ii(r, s, 39), q = _r(r, s, 28) ^ oi(r, s, 34) ^ oi(r, s, 39), w = r & i ^ r & a ^ i & a, c = s & o ^ s & d ^ o & d;
-      K = M | 0, Y = k | 0, M = N | 0, k = P | 0, N = S | 0, P = I | 0, { h: S, l: I } = yn(m | 0, g | 0, z | 0, C | 0), m = a | 0, g = d | 0, a = i | 0, d = o | 0, i = r | 0, o = s | 0;
-      const p = Pm(C, q, c);
-      r = Fm(p, z, F, w), s = p | 0;
+    let { Ah: r, Al: s, Bh: i, Bl: o, Ch: a, Cl: d, Dh: m, Dl: g, Eh: S, El: I, Fh: N, Fl: F, Gh: M, Gl: k, Hh: K, Hl: Y } = this;
+    for (let z = 0; z < 80; z++) {
+      const U = br(S, I, 14) ^ br(S, I, 18) ^ ii(S, I, 41), j = _r(S, I, 14) ^ _r(S, I, 18) ^ oi(S, I, 41), J = S & N ^ ~S & M, ne = I & F ^ ~I & k, te = jm(Y, j, ne, jy[z], Bn[z]), V = Vm(te, K, U, J, zy[z], Mn[z]), C = te | 0, L = br(r, s, 28) ^ ii(r, s, 34) ^ ii(r, s, 39), G = _r(r, s, 28) ^ oi(r, s, 34) ^ oi(r, s, 39), w = r & i ^ r & a ^ i & a, c = s & o ^ s & d ^ o & d;
+      K = M | 0, Y = k | 0, M = N | 0, k = F | 0, N = S | 0, F = I | 0, { h: S, l: I } = yn(m | 0, g | 0, V | 0, C | 0), m = a | 0, g = d | 0, a = i | 0, d = o | 0, i = r | 0, o = s | 0;
+      const p = Pm(C, G, c);
+      r = Fm(p, V, L, w), s = p | 0;
     }
-    ({ h: r, l: s } = yn(this.Ah | 0, this.Al | 0, r | 0, s | 0)), { h: i, l: o } = yn(this.Bh | 0, this.Bl | 0, i | 0, o | 0), { h: a, l: d } = yn(this.Ch | 0, this.Cl | 0, a | 0, d | 0), { h: m, l: g } = yn(this.Dh | 0, this.Dl | 0, m | 0, g | 0), { h: S, l: I } = yn(this.Eh | 0, this.El | 0, S | 0, I | 0), { h: N, l: P } = yn(this.Fh | 0, this.Fl | 0, N | 0, P | 0), { h: M, l: k } = yn(this.Gh | 0, this.Gl | 0, M | 0, k | 0), { h: K, l: Y } = yn(this.Hh | 0, this.Hl | 0, K | 0, Y | 0), this.set(r, s, i, o, a, d, m, g, S, I, N, P, M, k, K, Y);
+    ({ h: r, l: s } = yn(this.Ah | 0, this.Al | 0, r | 0, s | 0)), { h: i, l: o } = yn(this.Bh | 0, this.Bl | 0, i | 0, o | 0), { h: a, l: d } = yn(this.Ch | 0, this.Cl | 0, a | 0, d | 0), { h: m, l: g } = yn(this.Dh | 0, this.Dl | 0, m | 0, g | 0), { h: S, l: I } = yn(this.Eh | 0, this.El | 0, S | 0, I | 0), { h: N, l: F } = yn(this.Fh | 0, this.Fl | 0, N | 0, F | 0), { h: M, l: k } = yn(this.Gh | 0, this.Gl | 0, M | 0, k | 0), { h: K, l: Y } = yn(this.Hh | 0, this.Hl | 0, K | 0, Y | 0), this.set(r, s, i, o, a, d, m, g, S, I, N, F, M, k, K, Y);
   }
   roundClean() {
     Hn(Mn, Bn);
@@ -5328,20 +5328,20 @@ async function Hc(t) {
   return sr(e);
 }
 async function Qy(t, e) {
-  const { account: n = t.account, accessList: r, authorizationList: s, chain: i = t.chain, blobVersionedHashes: o, blobs: a, data: d, gas: m, gasPrice: g, maxFeePerBlobGas: S, maxFeePerGas: I, maxPriorityFeePerGas: N, nonce: P, nonceManager: M, to: k, type: K, value: Y, ...j } = e, U = await (async () => {
-    if (!n || !M || typeof P < "u")
-      return P;
-    const te = In(n), z = i ? i.id : await kt(t, Hc, "getChainId")({});
+  const { account: n = t.account, accessList: r, authorizationList: s, chain: i = t.chain, blobVersionedHashes: o, blobs: a, data: d, gas: m, gasPrice: g, maxFeePerBlobGas: S, maxFeePerGas: I, maxPriorityFeePerGas: N, nonce: F, nonceManager: M, to: k, type: K, value: Y, ...z } = e, U = await (async () => {
+    if (!n || !M || typeof F < "u")
+      return F;
+    const te = In(n), V = i ? i.id : await kt(t, Hc, "getChainId")({});
     return await M.consume({
       address: te.address,
-      chainId: z,
+      chainId: V,
       client: t
     });
   })();
   ho(e);
-  const V = i?.formatters?.transactionRequest?.format, ne = (V || zc)({
+  const j = i?.formatters?.transactionRequest?.format, ne = (j || zc)({
     // Pick out extra data that might exist on the chain's transaction request type.
-    ...$c(j, { format: V }),
+    ...$c(z, { format: j }),
     account: n ? In(n) : void 0,
     accessList: r,
     authorizationList: s,
@@ -5364,7 +5364,7 @@ async function Qy(t, e) {
       params: [ne]
     }), C = (i?.formatters?.transaction?.format || If)(te.tx);
     delete C.blockHash, delete C.blockNumber, delete C.r, delete C.s, delete C.transactionIndex, delete C.v, delete C.yParity, C.data = C.input, C.gas && (C.gas = e.gas ?? C.gas), C.gasPrice && (C.gasPrice = e.gasPrice ?? C.gasPrice), C.maxFeePerBlobGas && (C.maxFeePerBlobGas = e.maxFeePerBlobGas ?? C.maxFeePerBlobGas), C.maxFeePerGas && (C.maxFeePerGas = e.maxFeePerGas ?? C.maxFeePerGas), C.maxPriorityFeePerGas && (C.maxPriorityFeePerGas = e.maxPriorityFeePerGas ?? C.maxPriorityFeePerGas), C.nonce && (C.nonce = e.nonce ?? C.nonce);
-    const F = await (async () => {
+    const L = await (async () => {
       if (typeof i?.fees?.baseFeeMultiplier == "function") {
         const p = await kt(t, Ns, "getBlock")({});
         return i.fees.baseFeeMultiplier({
@@ -5375,9 +5375,9 @@ async function Qy(t, e) {
       }
       return i?.fees?.baseFeeMultiplier ?? 1.2;
     })();
-    if (F < 1)
+    if (L < 1)
       throw new Tf();
-    const w = 10 ** (F.toString().split(".")[1]?.length ?? 0), c = (p) => p * BigInt(Math.ceil(F * w)) / BigInt(w);
+    const w = 10 ** (L.toString().split(".")[1]?.length ?? 0), c = (p) => p * BigInt(Math.ceil(L * w)) / BigInt(w);
     return C.maxFeePerGas && !e.maxFeePerGas && (C.maxFeePerGas = c(C.maxFeePerGas)), C.gasPrice && !e.gasPrice && (C.gasPrice = c(C.gasPrice)), {
       raw: te.raw,
       transaction: {
@@ -5432,24 +5432,24 @@ async function Ff(t, e) {
   a?.fn && a.runAt?.includes("beforeFillTransaction") && (n = await a.fn({ ...n, chain: s }, {
     phase: "beforeFillTransaction"
   }), S ??= n.nonce);
-  const N = ((o.includes("blobVersionedHashes") || o.includes("sidecars")) && n.kzg && n.blobs || ta.get(t.uid) === !1 || !["fees", "gas"].some((V) => o.includes(V)) ? !1 : !!(o.includes("chainId") && typeof n.chainId != "number" || o.includes("nonce") && typeof S != "number" || o.includes("fees") && typeof n.gasPrice != "bigint" && (typeof n.maxFeePerGas != "bigint" || typeof n.maxPriorityFeePerGas != "bigint") || o.includes("gas") && typeof n.gas != "bigint")) ? await kt(t, Qy, "fillTransaction")({ ...n, nonce: S }).then((U) => {
-    const { chainId: V, from: J, gas: ne, gasPrice: te, nonce: z, maxFeePerBlobGas: C, maxFeePerGas: F, maxPriorityFeePerGas: q, type: w, ...c } = U.transaction;
+  const N = ((o.includes("blobVersionedHashes") || o.includes("sidecars")) && n.kzg && n.blobs || ta.get(t.uid) === !1 || !["fees", "gas"].some((j) => o.includes(j)) ? !1 : !!(o.includes("chainId") && typeof n.chainId != "number" || o.includes("nonce") && typeof S != "number" || o.includes("fees") && typeof n.gasPrice != "bigint" && (typeof n.maxFeePerGas != "bigint" || typeof n.maxPriorityFeePerGas != "bigint") || o.includes("gas") && typeof n.gas != "bigint")) ? await kt(t, Qy, "fillTransaction")({ ...n, nonce: S }).then((U) => {
+    const { chainId: j, from: J, gas: ne, gasPrice: te, nonce: V, maxFeePerBlobGas: C, maxFeePerGas: L, maxPriorityFeePerGas: G, type: w, ...c } = U.transaction;
     return ta.set(t.uid, !0), {
       ...n,
       ...J ? { from: J } : {},
       ...w ? { type: w } : {},
-      ...typeof V < "u" ? { chainId: V } : {},
+      ...typeof j < "u" ? { chainId: j } : {},
       ...typeof ne < "u" ? { gas: ne } : {},
       ...typeof te < "u" ? { gasPrice: te } : {},
-      ...typeof z < "u" ? { nonce: z } : {},
+      ...typeof V < "u" ? { nonce: V } : {},
       ...typeof C < "u" ? { maxFeePerBlobGas: C } : {},
-      ...typeof F < "u" ? { maxFeePerGas: F } : {},
-      ...typeof q < "u" ? { maxPriorityFeePerGas: q } : {},
+      ...typeof L < "u" ? { maxFeePerGas: L } : {},
+      ...typeof G < "u" ? { maxPriorityFeePerGas: G } : {},
       ..."nonceKey" in c && typeof c.nonceKey < "u" ? { nonceKey: c.nonceKey } : {}
     };
   }).catch((U) => {
-    const V = U;
-    return V.name !== "TransactionExecutionError" || V.walk?.((ne) => {
+    const j = U;
+    return j.name !== "TransactionExecutionError" || j.walk?.((ne) => {
       const te = ne;
       return te.name === "MethodNotFoundRpcError" || te.name === "MethodNotSupportedRpcError";
     }) && ta.set(t.uid, !1), n;
@@ -5459,31 +5459,31 @@ async function Ff(t, e) {
     ...g ? { from: g?.address } : {},
     ...S ? { nonce: S } : {}
   };
-  const { blobs: P, gas: M, kzg: k, type: K } = n;
+  const { blobs: F, gas: M, kzg: k, type: K } = n;
   a?.fn && a.runAt?.includes("beforeFillParameters") && (n = await a.fn({ ...n, chain: s }, {
     phase: "beforeFillParameters"
   }));
   let Y;
-  async function j() {
+  async function z() {
     return Y || (Y = await kt(t, Ns, "getBlock")({ blockTag: "latest" }), Y);
   }
   if (o.includes("nonce") && typeof S > "u" && g && !i && (n.nonce = await kt(t, Uy, "getTransactionCount")({
     address: g.address,
     blockTag: "pending"
-  })), (o.includes("blobVersionedHashes") || o.includes("sidecars")) && P && k) {
-    const U = Nf({ blobs: P, kzg: k });
+  })), (o.includes("blobVersionedHashes") || o.includes("sidecars")) && F && k) {
+    const U = Nf({ blobs: F, kzg: k });
     if (o.includes("blobVersionedHashes")) {
-      const V = Ky({
+      const j = Ky({
         commitments: U,
         to: "hex"
       });
-      n.blobVersionedHashes = V;
+      n.blobVersionedHashes = j;
     }
     if (o.includes("sidecars")) {
-      const V = Cf({ blobs: P, commitments: U, kzg: k }), J = Jy({
-        blobs: P,
+      const j = Cf({ blobs: F, commitments: U, kzg: k }), J = Jy({
+        blobs: F,
         commitments: U,
-        proofs: V,
+        proofs: j,
         to: "hex"
       });
       n.sidecars = J;
@@ -5494,12 +5494,12 @@ async function Ff(t, e) {
       n.type = Xy(n);
     } catch {
       let U = hd.get(t.uid);
-      typeof U > "u" && (U = typeof (await j())?.baseFeePerGas == "bigint", hd.set(t.uid, U)), n.type = U ? "eip1559" : "legacy";
+      typeof U > "u" && (U = typeof (await z())?.baseFeePerGas == "bigint", hd.set(t.uid, U)), n.type = U ? "eip1559" : "legacy";
     }
   if (o.includes("fees"))
     if (n.type !== "legacy" && n.type !== "eip2930") {
       if (typeof n.maxFeePerGas > "u" || typeof n.maxPriorityFeePerGas > "u") {
-        const U = await j(), { maxFeePerGas: V, maxPriorityFeePerGas: J } = await dd(t, {
+        const U = await z(), { maxFeePerGas: j, maxPriorityFeePerGas: J } = await dd(t, {
           block: U,
           chain: s,
           request: n
@@ -5508,19 +5508,19 @@ async function Ff(t, e) {
           throw new Oy({
             maxPriorityFeePerGas: J
           });
-        n.maxPriorityFeePerGas = J, n.maxFeePerGas = V;
+        n.maxPriorityFeePerGas = J, n.maxFeePerGas = j;
       }
     } else {
       if (typeof n.maxFeePerGas < "u" || typeof n.maxPriorityFeePerGas < "u")
         throw new jc();
       if (typeof n.gasPrice > "u") {
-        const U = await j(), { gasPrice: V } = await dd(t, {
+        const U = await z(), { gasPrice: j } = await dd(t, {
           block: U,
           chain: s,
           request: n,
           type: "legacy"
         });
-        n.gasPrice = V;
+        n.gasPrice = j;
       }
     }
   return o.includes("gas") && typeof M > "u" && (n.gas = await kt(t, e1, "estimateGas")({
@@ -5548,16 +5548,16 @@ async function e1(t, e) {
         }).catch(() => {
           throw new de("`to` is required. Could not infer from `authorizationList`");
         });
-    })(), { accessList: a, authorizationList: d, blobs: m, blobVersionedHashes: g, blockNumber: S, blockTag: I, data: N, gas: P, gasPrice: M, maxFeePerBlobGas: k, maxFeePerGas: K, maxPriorityFeePerGas: Y, nonce: j, value: U, stateOverride: V, ...J } = r ? await Ff(t, {
+    })(), { accessList: a, authorizationList: d, blobs: m, blobVersionedHashes: g, blockNumber: S, blockTag: I, data: N, gas: F, gasPrice: M, maxFeePerBlobGas: k, maxFeePerGas: K, maxPriorityFeePerGas: Y, nonce: z, value: U, stateOverride: j, ...J } = r ? await Ff(t, {
       ...e,
       parameters: i,
       to: o
     }) : e;
-    if (P && e.gas !== P)
-      return P;
-    const te = (typeof S == "bigint" ? ke(S) : void 0) || I, z = by(V);
+    if (F && e.gas !== F)
+      return F;
+    const te = (typeof S == "bigint" ? ke(S) : void 0) || I, V = by(j);
     ho(e);
-    const C = t.chain?.formatters?.transactionRequest?.format, q = (C || zc)({
+    const C = t.chain?.formatters?.transactionRequest?.format, G = (C || zc)({
       // Pick out extra data that might exist on the chain's transaction request type.
       ...$c(J, { format: C }),
       account: s,
@@ -5570,17 +5570,17 @@ async function e1(t, e) {
       maxFeePerBlobGas: k,
       maxFeePerGas: K,
       maxPriorityFeePerGas: Y,
-      nonce: j,
+      nonce: z,
       to: o,
       value: U
     }, "estimateGas");
     return BigInt(await t.request({
       method: "eth_estimateGas",
-      params: z ? [
-        q,
+      params: V ? [
+        G,
         te ?? t.experimental_blockTag ?? "latest",
-        z
-      ] : te ? [q, te] : [q]
+        V
+      ] : te ? [G, te] : [G]
     }));
   } catch (o) {
     throw Iy(o, {
@@ -5852,12 +5852,12 @@ function u1(t) {
     for (; !d.eql(I, d.ONE); ) {
       if (d.is0(I))
         return d.ZERO;
-      let P = 1, M = d.sqr(I);
+      let F = 1, M = d.sqr(I);
       for (; !d.eql(M, d.ONE); )
-        if (P++, M = d.sqr(M), P === g)
+        if (F++, M = d.sqr(M), F === g)
           throw new Error("Cannot find square root");
-      const k = At << BigInt(g - P - 1), K = d.pow(S, k);
-      g = P, S = d.sqr(K), I = d.mul(I, S), N = d.mul(N, K);
+      const k = At << BigInt(g - F - 1), K = d.pow(S, k);
+      g = F, S = d.sqr(K), I = d.mul(I, S), N = d.mul(N, K);
     }
     return N;
   };
@@ -6078,8 +6078,8 @@ function Jf(t, e) {
       let i = t.ZERO, o = t.BASE;
       const a = ra(n, e);
       for (let d = 0; d < a.windows; d++) {
-        const { nextN: m, offset: g, isZero: S, isNeg: I, isNegF: N, offsetF: P } = gd(s, d, a);
-        s = m, S ? o = o.add(na(N, r[P])) : i = i.add(na(I, r[g]));
+        const { nextN: m, offset: g, isZero: S, isNeg: I, isNegF: N, offsetF: F } = gd(s, d, a);
+        s = m, S ? o = o.add(na(N, r[F])) : i = i.add(na(I, r[g]));
       }
       return { p: i, f: o };
     },
@@ -6138,10 +6138,10 @@ function Xf(t, e, n, r) {
       const k = r[M], K = Number(k >> BigInt(N) & m);
       g[K] = g[K].add(n[M]);
     }
-    let P = o;
+    let F = o;
     for (let M = g.length - 1, k = o; M > 0; M--)
-      k = k.add(g[M]), P = P.add(k);
-    if (I = I.add(P), N !== 0)
+      k = k.add(g[M]), F = F.add(k);
+    if (I = I.add(F), N !== 0)
       for (let M = 0; M < d; M++)
         I = I.double();
   }
@@ -6289,95 +6289,95 @@ const Rn = BigInt(0), Et = BigInt(1);
 BigInt(2);
 const aa = BigInt(3), E1 = BigInt(4);
 function w1(t) {
-  const e = b1(t), { Fp: n } = e, r = Js(e.n, e.nBitLength), s = e.toBytes || ((j, U, V) => {
+  const e = b1(t), { Fp: n } = e, r = Js(e.n, e.nBitLength), s = e.toBytes || ((z, U, j) => {
     const J = U.toAffine();
     return $r(Uint8Array.from([4]), n.toBytes(J.x), n.toBytes(J.y));
-  }), i = e.fromBytes || ((j) => {
-    const U = j.subarray(1), V = n.fromBytes(U.subarray(0, n.BYTES)), J = n.fromBytes(U.subarray(n.BYTES, 2 * n.BYTES));
-    return { x: V, y: J };
+  }), i = e.fromBytes || ((z) => {
+    const U = z.subarray(1), j = n.fromBytes(U.subarray(0, n.BYTES)), J = n.fromBytes(U.subarray(n.BYTES, 2 * n.BYTES));
+    return { x: j, y: J };
   });
-  function o(j) {
-    const { a: U, b: V } = e, J = n.sqr(j), ne = n.mul(J, j);
-    return n.add(n.add(ne, n.mul(j, U)), V);
+  function o(z) {
+    const { a: U, b: j } = e, J = n.sqr(z), ne = n.mul(J, z);
+    return n.add(n.add(ne, n.mul(z, U)), j);
   }
-  function a(j, U) {
-    const V = n.sqr(U), J = o(j);
-    return n.eql(V, J);
+  function a(z, U) {
+    const j = n.sqr(U), J = o(z);
+    return n.eql(j, J);
   }
   if (!a(e.Gx, e.Gy))
     throw new Error("bad curve params: generator point");
   const d = n.mul(n.pow(e.a, aa), E1), m = n.mul(n.sqr(e.b), BigInt(27));
   if (n.is0(n.add(d, m)))
     throw new Error("bad curve params: a or b");
-  function g(j) {
-    return Pc(j, Et, e.n);
+  function g(z) {
+    return Pc(z, Et, e.n);
   }
-  function S(j) {
-    const { allowedPrivateKeyLengths: U, nByteLength: V, wrapPrivateKey: J, n: ne } = e;
-    if (U && typeof j != "bigint") {
-      if (Ws(j) && (j = Fr(j)), typeof j != "string" || !U.includes(j.length))
+  function S(z) {
+    const { allowedPrivateKeyLengths: U, nByteLength: j, wrapPrivateKey: J, n: ne } = e;
+    if (U && typeof z != "bigint") {
+      if (Ws(z) && (z = Fr(z)), typeof z != "string" || !U.includes(z.length))
         throw new Error("invalid private key");
-      j = j.padStart(V * 2, "0");
+      z = z.padStart(j * 2, "0");
     }
     let te;
     try {
-      te = typeof j == "bigint" ? j : nr(Xe("private key", j, V));
+      te = typeof z == "bigint" ? z : nr(Xe("private key", z, j));
     } catch {
-      throw new Error("invalid private key, expected hex or " + V + " bytes, got " + typeof j);
+      throw new Error("invalid private key, expected hex or " + j + " bytes, got " + typeof z);
     }
     return J && (te = He(te, ne)), tn("private key", te, Et, ne), te;
   }
-  function I(j) {
-    if (!(j instanceof M))
+  function I(z) {
+    if (!(z instanceof M))
       throw new Error("ProjectivePoint expected");
   }
-  const N = Ti((j, U) => {
-    const { px: V, py: J, pz: ne } = j;
+  const N = Ti((z, U) => {
+    const { px: j, py: J, pz: ne } = z;
     if (n.eql(ne, n.ONE))
-      return { x: V, y: J };
-    const te = j.is0();
+      return { x: j, y: J };
+    const te = z.is0();
     U == null && (U = te ? n.ONE : n.inv(ne));
-    const z = n.mul(V, U), C = n.mul(J, U), F = n.mul(ne, U);
+    const V = n.mul(j, U), C = n.mul(J, U), L = n.mul(ne, U);
     if (te)
       return { x: n.ZERO, y: n.ZERO };
-    if (!n.eql(F, n.ONE))
+    if (!n.eql(L, n.ONE))
       throw new Error("invZ was invalid");
-    return { x: z, y: C };
-  }), P = Ti((j) => {
-    if (j.is0()) {
-      if (e.allowInfinityPoint && !n.is0(j.py))
+    return { x: V, y: C };
+  }), F = Ti((z) => {
+    if (z.is0()) {
+      if (e.allowInfinityPoint && !n.is0(z.py))
         return;
       throw new Error("bad point: ZERO");
     }
-    const { x: U, y: V } = j.toAffine();
-    if (!n.isValid(U) || !n.isValid(V))
+    const { x: U, y: j } = z.toAffine();
+    if (!n.isValid(U) || !n.isValid(j))
       throw new Error("bad point: x or y not FE");
-    if (!a(U, V))
+    if (!a(U, j))
       throw new Error("bad point: equation left != right");
-    if (!j.isTorsionFree())
+    if (!z.isTorsionFree())
       throw new Error("bad point: not in prime-order subgroup");
     return !0;
   });
   class M {
-    constructor(U, V, J) {
+    constructor(U, j, J) {
       if (U == null || !n.isValid(U))
         throw new Error("x required");
-      if (V == null || !n.isValid(V) || n.is0(V))
+      if (j == null || !n.isValid(j) || n.is0(j))
         throw new Error("y required");
       if (J == null || !n.isValid(J))
         throw new Error("z required");
-      this.px = U, this.py = V, this.pz = J, Object.freeze(this);
+      this.px = U, this.py = j, this.pz = J, Object.freeze(this);
     }
     // Does not validate if the point is on-curve.
     // Use fromHex instead, or call assertValidity() later.
     static fromAffine(U) {
-      const { x: V, y: J } = U || {};
-      if (!U || !n.isValid(V) || !n.isValid(J))
+      const { x: j, y: J } = U || {};
+      if (!U || !n.isValid(j) || !n.isValid(J))
         throw new Error("invalid affine point");
       if (U instanceof M)
         throw new Error("projective point not allowed");
       const ne = (te) => n.eql(te, n.ZERO);
-      return ne(V) && ne(J) ? M.ZERO : new M(V, J, n.ONE);
+      return ne(j) && ne(J) ? M.ZERO : new M(j, J, n.ONE);
     }
     get x() {
       return this.toAffine().x;
@@ -6392,24 +6392,24 @@ function w1(t) {
      * Optimization: converts a list of projective points to a list of identical points with Z=1.
      */
     static normalizeZ(U) {
-      const V = Gc(n, U.map((J) => J.pz));
-      return U.map((J, ne) => J.toAffine(V[ne])).map(M.fromAffine);
+      const j = Gc(n, U.map((J) => J.pz));
+      return U.map((J, ne) => J.toAffine(j[ne])).map(M.fromAffine);
     }
     /**
      * Converts hash string or Uint8Array to Point.
      * @param hex short/long ECDSA hex
      */
     static fromHex(U) {
-      const V = M.fromAffine(i(Xe("pointHex", U)));
-      return V.assertValidity(), V;
+      const j = M.fromAffine(i(Xe("pointHex", U)));
+      return j.assertValidity(), j;
     }
     // Multiplies generator point by privateKey.
     static fromPrivateKey(U) {
       return M.BASE.multiply(S(U));
     }
     // Multiscalar Multiplication
-    static msm(U, V) {
-      return Xf(M, r, U, V);
+    static msm(U, j) {
+      return Xf(M, r, U, j);
     }
     // "Private method", don't use it directly
     _setWindowSize(U) {
@@ -6417,7 +6417,7 @@ function w1(t) {
     }
     // A point on curve is valid if it conforms to equation.
     assertValidity() {
-      P(this);
+      F(this);
     }
     hasEvenY() {
       const { y: U } = this.toAffine();
@@ -6430,8 +6430,8 @@ function w1(t) {
      */
     equals(U) {
       I(U);
-      const { px: V, py: J, pz: ne } = this, { px: te, py: z, pz: C } = U, F = n.eql(n.mul(V, C), n.mul(te, ne)), q = n.eql(n.mul(J, C), n.mul(z, ne));
-      return F && q;
+      const { px: j, py: J, pz: ne } = this, { px: te, py: V, pz: C } = U, L = n.eql(n.mul(j, C), n.mul(te, ne)), G = n.eql(n.mul(J, C), n.mul(V, ne));
+      return L && G;
     }
     /**
      * Flips point to one corresponding to (x, -y) in Affine coordinates.
@@ -6444,9 +6444,9 @@ function w1(t) {
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: U, b: V } = e, J = n.mul(V, aa), { px: ne, py: te, pz: z } = this;
-      let C = n.ZERO, F = n.ZERO, q = n.ZERO, w = n.mul(ne, ne), c = n.mul(te, te), p = n.mul(z, z), y = n.mul(ne, te);
-      return y = n.add(y, y), q = n.mul(ne, z), q = n.add(q, q), C = n.mul(U, q), F = n.mul(J, p), F = n.add(C, F), C = n.sub(c, F), F = n.add(c, F), F = n.mul(C, F), C = n.mul(y, C), q = n.mul(J, q), p = n.mul(U, p), y = n.sub(w, p), y = n.mul(U, y), y = n.add(y, q), q = n.add(w, w), w = n.add(q, w), w = n.add(w, p), w = n.mul(w, y), F = n.add(F, w), p = n.mul(te, z), p = n.add(p, p), w = n.mul(p, y), C = n.sub(C, w), q = n.mul(p, c), q = n.add(q, q), q = n.add(q, q), new M(C, F, q);
+      const { a: U, b: j } = e, J = n.mul(j, aa), { px: ne, py: te, pz: V } = this;
+      let C = n.ZERO, L = n.ZERO, G = n.ZERO, w = n.mul(ne, ne), c = n.mul(te, te), p = n.mul(V, V), y = n.mul(ne, te);
+      return y = n.add(y, y), G = n.mul(ne, V), G = n.add(G, G), C = n.mul(U, G), L = n.mul(J, p), L = n.add(C, L), C = n.sub(c, L), L = n.add(c, L), L = n.mul(C, L), C = n.mul(y, C), G = n.mul(J, G), p = n.mul(U, p), y = n.sub(w, p), y = n.mul(U, y), y = n.add(y, G), G = n.add(w, w), w = n.add(G, w), w = n.add(w, p), w = n.mul(w, y), L = n.add(L, w), p = n.mul(te, V), p = n.add(p, p), w = n.mul(p, y), C = n.sub(C, w), G = n.mul(p, c), G = n.add(G, G), G = n.add(G, G), new M(C, L, G);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -6454,13 +6454,13 @@ function w1(t) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(U) {
       I(U);
-      const { px: V, py: J, pz: ne } = this, { px: te, py: z, pz: C } = U;
-      let F = n.ZERO, q = n.ZERO, w = n.ZERO;
+      const { px: j, py: J, pz: ne } = this, { px: te, py: V, pz: C } = U;
+      let L = n.ZERO, G = n.ZERO, w = n.ZERO;
       const c = e.a, p = n.mul(e.b, aa);
-      let y = n.mul(V, te), A = n.mul(J, z), v = n.mul(ne, C), R = n.add(V, J), O = n.add(te, z);
-      R = n.mul(R, O), O = n.add(y, A), R = n.sub(R, O), O = n.add(V, ne);
+      let y = n.mul(j, te), A = n.mul(J, V), v = n.mul(ne, C), R = n.add(j, J), O = n.add(te, V);
+      R = n.mul(R, O), O = n.add(y, A), R = n.sub(R, O), O = n.add(j, ne);
       let _ = n.add(te, C);
-      return O = n.mul(O, _), _ = n.add(y, v), O = n.sub(O, _), _ = n.add(J, ne), F = n.add(z, C), _ = n.mul(_, F), F = n.add(A, v), _ = n.sub(_, F), w = n.mul(c, O), F = n.mul(p, v), w = n.add(F, w), F = n.sub(A, w), w = n.add(A, w), q = n.mul(F, w), A = n.add(y, y), A = n.add(A, y), v = n.mul(c, v), O = n.mul(p, O), A = n.add(A, v), v = n.sub(y, v), v = n.mul(c, v), O = n.add(O, v), y = n.mul(A, O), q = n.add(q, y), y = n.mul(_, O), F = n.mul(R, F), F = n.sub(F, y), y = n.mul(R, A), w = n.mul(_, w), w = n.add(w, y), new M(F, q, w);
+      return O = n.mul(O, _), _ = n.add(y, v), O = n.sub(O, _), _ = n.add(J, ne), L = n.add(V, C), _ = n.mul(_, L), L = n.add(A, v), _ = n.sub(_, L), w = n.mul(c, O), L = n.mul(p, v), w = n.add(L, w), L = n.sub(A, w), w = n.add(A, w), G = n.mul(L, w), A = n.add(y, y), A = n.add(A, y), v = n.mul(c, v), O = n.mul(p, O), A = n.add(A, v), v = n.sub(y, v), v = n.mul(c, v), O = n.add(O, v), y = n.mul(A, O), G = n.add(G, y), y = n.mul(_, O), L = n.mul(R, L), L = n.sub(L, y), y = n.mul(R, A), w = n.mul(_, w), w = n.add(w, y), new M(L, G, w);
     }
     subtract(U) {
       return this.add(U.negate());
@@ -6477,19 +6477,19 @@ function w1(t) {
      * an exposed private key e.g. sig verification, which works over *public* keys.
      */
     multiplyUnsafe(U) {
-      const { endo: V, n: J } = e;
+      const { endo: j, n: J } = e;
       tn("scalar", U, Rn, J);
       const ne = M.ZERO;
       if (U === Rn)
         return ne;
       if (this.is0() || U === Et)
         return this;
-      if (!V || Y.hasPrecomputes(this))
+      if (!j || Y.hasPrecomputes(this))
         return Y.wNAFCachedUnsafe(this, U, M.normalizeZ);
-      let { k1neg: te, k1: z, k2neg: C, k2: F } = V.splitScalar(U), q = ne, w = ne, c = this;
-      for (; z > Rn || F > Rn; )
-        z & Et && (q = q.add(c)), F & Et && (w = w.add(c)), c = c.double(), z >>= Et, F >>= Et;
-      return te && (q = q.negate()), C && (w = w.negate()), w = new M(n.mul(w.px, V.beta), w.py, w.pz), q.add(w);
+      let { k1neg: te, k1: V, k2neg: C, k2: L } = j.splitScalar(U), G = ne, w = ne, c = this;
+      for (; V > Rn || L > Rn; )
+        V & Et && (G = G.add(c)), L & Et && (w = w.add(c)), c = c.double(), V >>= Et, L >>= Et;
+      return te && (G = G.negate()), C && (w = w.negate()), w = new M(n.mul(w.px, j.beta), w.py, w.pz), G.add(w);
     }
     /**
      * Constant time multiplication.
@@ -6501,16 +6501,16 @@ function w1(t) {
      * @returns New point
      */
     multiply(U) {
-      const { endo: V, n: J } = e;
+      const { endo: j, n: J } = e;
       tn("scalar", U, Et, J);
       let ne, te;
-      if (V) {
-        const { k1neg: z, k1: C, k2neg: F, k2: q } = V.splitScalar(U);
-        let { p: w, f: c } = this.wNAF(C), { p, f: y } = this.wNAF(q);
-        w = Y.constTimeNegate(z, w), p = Y.constTimeNegate(F, p), p = new M(n.mul(p.px, V.beta), p.py, p.pz), ne = w.add(p), te = c.add(y);
+      if (j) {
+        const { k1neg: V, k1: C, k2neg: L, k2: G } = j.splitScalar(U);
+        let { p: w, f: c } = this.wNAF(C), { p, f: y } = this.wNAF(G);
+        w = Y.constTimeNegate(V, w), p = Y.constTimeNegate(L, p), p = new M(n.mul(p.px, j.beta), p.py, p.pz), ne = w.add(p), te = c.add(y);
       } else {
-        const { p: z, f: C } = this.wNAF(U);
-        ne = z, te = C;
+        const { p: V, f: C } = this.wNAF(U);
+        ne = V, te = C;
       }
       return M.normalizeZ([ne, te])[0];
     }
@@ -6520,9 +6520,9 @@ function w1(t) {
      * The trick could be useful if both P and Q are not G (not in our case).
      * @returns non-zero affine point
      */
-    multiplyAndAddUnsafe(U, V, J) {
-      const ne = M.BASE, te = (C, F) => F === Rn || F === Et || !C.equals(ne) ? C.multiplyUnsafe(F) : C.multiply(F), z = te(this, V).add(te(U, J));
-      return z.is0() ? void 0 : z;
+    multiplyAndAddUnsafe(U, j, J) {
+      const ne = M.BASE, te = (C, L) => L === Rn || L === Et || !C.equals(ne) ? C.multiplyUnsafe(L) : C.multiply(L), V = te(this, j).add(te(U, J));
+      return V.is0() ? void 0 : V;
     }
     // Converts Projective point to affine (x, y) coordinates.
     // Can accept precomputed Z^-1 - for example, from invertBatch.
@@ -6531,16 +6531,16 @@ function w1(t) {
       return N(this, U);
     }
     isTorsionFree() {
-      const { h: U, isTorsionFree: V } = e;
+      const { h: U, isTorsionFree: j } = e;
       if (U === Et)
         return !0;
-      if (V)
-        return V(M, this);
+      if (j)
+        return j(M, this);
       throw new Error("isTorsionFree() has not been declared for the elliptic curve");
     }
     clearCofactor() {
-      const { h: U, clearCofactor: V } = e;
-      return U === Et ? this : V ? V(M, this) : this.multiplyUnsafe(e.h);
+      const { h: U, clearCofactor: j } = e;
+      return U === Et ? this : j ? j(M, this) : this.multiplyUnsafe(e.h);
     }
     toRawBytes(U = !0) {
       return zn("isCompressed", U), this.assertValidity(), s(M, this, U);
@@ -6610,12 +6610,12 @@ function R1(t) {
       }
     }
   });
-  function P(p) {
+  function F(p) {
     const y = r >> Et;
     return p > y;
   }
   function M(p) {
-    return P(p) ? d(-p) : p;
+    return F(p) ? d(-p) : p;
   }
   const k = (p, y, A) => nr(p.slice(y, A));
   class K {
@@ -6649,14 +6649,14 @@ function R1(t) {
       const _ = R === 2 || R === 3 ? A + e.n : A;
       if (_ >= n.ORDER)
         throw new Error("recovery id 2 or 3 invalid");
-      const u = (R & 1) === 0 ? "02" : "03", l = g.fromHex(u + oa(_, n.BYTES)), E = m(_), T = d(-O * E), D = d(v * E), W = g.BASE.multiplyAndAddUnsafe(l, T, D);
+      const u = (R & 1) === 0 ? "02" : "03", l = g.fromHex(u + oa(_, n.BYTES)), E = m(_), T = d(-O * E), P = d(v * E), W = g.BASE.multiplyAndAddUnsafe(l, T, P);
       if (!W)
         throw new Error("point at infinify");
       return W.assertValidity(), W;
     }
     // Signatures should be low-s, to prevent malleability.
     hasHighS() {
-      return P(this.s);
+      return F(this.s);
     }
     normalizeS() {
       return this.hasHighS() ? new K(this.r, d(-this.s), this.recovery) : this;
@@ -6706,7 +6706,7 @@ function R1(t) {
       return y._setWindowSize(p), y.multiply(BigInt(3)), y;
     }
   };
-  function j(p, y = !0) {
+  function z(p, y = !0) {
     return g.fromPrivateKey(p).toRawBytes(y);
   }
   function U(p) {
@@ -6718,7 +6718,7 @@ function R1(t) {
     if (!(e.allowedPrivateKeyLengths || s === R))
       return A === R || A === O;
   }
-  function V(p, y, A = !0) {
+  function j(p, y, A = !0) {
     if (U(p) === !0)
       throw new Error("first arg must be private key");
     if (U(y) === !1)
@@ -6733,21 +6733,21 @@ function R1(t) {
   }, ne = e.bits2int_modN || function(p) {
     return d(J(p));
   }, te = fo(i);
-  function z(p) {
+  function V(p) {
     return tn("num < 2^" + i, p, Rn, te), Zs(p, s);
   }
-  function C(p, y, A = F) {
+  function C(p, y, A = L) {
     if (["recovered", "canonical"].some((ae) => ae in A))
       throw new Error("sign() legacy options not supported");
     const { hash: v, randomBytes: R } = e;
     let { lowS: O, prehash: _, extraEntropy: u } = A;
     O == null && (O = !0), p = Xe("msgHash", p), yd(A), _ && (p = Xe("prehashed msgHash", v(p)));
-    const l = ne(p), E = S(y), T = [z(E), z(l)];
+    const l = ne(p), E = S(y), T = [V(E), V(l)];
     if (u != null && u !== !1) {
       const ae = u === !0 ? R(n.BYTES) : u;
       T.push(Xe("extraEntropy", ae));
     }
-    const D = $r(...T), W = l;
+    const P = $r(...T), W = l;
     function se(ae) {
       const Me = J(ae);
       if (!N(Me))
@@ -6759,17 +6759,17 @@ function R1(t) {
       if (Re === Rn)
         return;
       let Oe = (we.x === De ? 0 : 2) | Number(we.y & Et), an = Re;
-      return O && P(Re) && (an = M(Re), Oe ^= 1), new K(De, an, Oe);
+      return O && F(Re) && (an = M(Re), Oe ^= 1), new K(De, an, Oe);
     }
-    return { seed: D, k2sig: se };
+    return { seed: P, k2sig: se };
   }
-  const F = { lowS: e.lowS, prehash: !1 }, q = { lowS: e.lowS, prehash: !1 };
-  function w(p, y, A = F) {
+  const L = { lowS: e.lowS, prehash: !1 }, G = { lowS: e.lowS, prehash: !1 };
+  function w(p, y, A = L) {
     const { seed: v, k2sig: R } = C(p, y, A), O = e;
     return hy(O.hash.outputLen, O.nByteLength, O.hmac)(v, R);
   }
   g.BASE._setWindowSize(8);
-  function c(p, y, A, v = q) {
+  function c(p, y, A, v = G) {
     const R = p;
     y = Xe("msgHash", y), A = Xe("publicKey", A);
     const { lowS: O, prehash: _, format: u } = v;
@@ -6780,7 +6780,7 @@ function R1(t) {
     const l = typeof R == "string" || Ws(R), E = !l && !u && typeof R == "object" && R !== null && typeof R.r == "bigint" && typeof R.s == "bigint";
     if (!l && !E)
       throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");
-    let T, D;
+    let T, P;
     try {
       if (E && (T = new K(R.r, R.s)), l) {
         try {
@@ -6791,20 +6791,20 @@ function R1(t) {
         }
         !T && u !== "der" && (T = K.fromCompact(R));
       }
-      D = g.fromHex(A);
+      P = g.fromHex(A);
     } catch {
       return !1;
     }
     if (!T || O && T.hasHighS())
       return !1;
     _ && (y = e.hash(y));
-    const { r: W, s: se } = T, ae = ne(y), Me = m(se), ve = d(ae * Me), we = d(W * Me), De = g.BASE.multiplyAndAddUnsafe(D, ve, we)?.toAffine();
+    const { r: W, s: se } = T, ae = ne(y), Me = m(se), ve = d(ae * Me), we = d(W * Me), De = g.BASE.multiplyAndAddUnsafe(P, ve, we)?.toAffine();
     return De ? d(De.x) === W : !1;
   }
   return {
     CURVE: e,
-    getPublicKey: j,
-    getSharedSecret: V,
+    getPublicKey: z,
+    getSharedSecret: j,
     sign: w,
     verify: c,
     ProjectivePoint: g,
@@ -6827,7 +6827,7 @@ function S1(t, e) {
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const Qf = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), bd = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), x1 = BigInt(0), T1 = BigInt(1), Qa = BigInt(2), _d = (t, e) => (t + e / Qa) / e;
 function I1(t) {
-  const e = Qf, n = BigInt(3), r = BigInt(6), s = BigInt(11), i = BigInt(22), o = BigInt(23), a = BigInt(44), d = BigInt(88), m = t * t * t % e, g = m * m * t % e, S = Ze(g, n, e) * g % e, I = Ze(S, n, e) * g % e, N = Ze(I, Qa, e) * m % e, P = Ze(N, s, e) * N % e, M = Ze(P, i, e) * P % e, k = Ze(M, a, e) * M % e, K = Ze(k, d, e) * k % e, Y = Ze(K, a, e) * M % e, j = Ze(Y, n, e) * g % e, U = Ze(j, o, e) * P % e, V = Ze(U, r, e) * m % e, J = Ze(V, Qa, e);
+  const e = Qf, n = BigInt(3), r = BigInt(6), s = BigInt(11), i = BigInt(22), o = BigInt(23), a = BigInt(44), d = BigInt(88), m = t * t * t % e, g = m * m * t % e, S = Ze(g, n, e) * g % e, I = Ze(S, n, e) * g % e, N = Ze(I, Qa, e) * m % e, F = Ze(N, s, e) * N % e, M = Ze(F, i, e) * F % e, k = Ze(M, a, e) * M % e, K = Ze(k, d, e) * k % e, Y = Ze(K, a, e) * M % e, z = Ze(Y, n, e) * g % e, U = Ze(z, o, e) * F % e, j = Ze(U, r, e) * m % e, J = Ze(j, Qa, e);
   if (!ec.eql(ec.sqr(J), t))
     throw new Error("Cannot find square root");
   return J;
@@ -6888,7 +6888,7 @@ async function N1(t, { serializedTransaction: e }) {
 }
 const ua = new Ks(128);
 async function th(t, e) {
-  const { account: n = t.account, chain: r = t.chain, accessList: s, authorizationList: i, blobs: o, data: a, gas: d, gasPrice: m, maxFeePerBlobGas: g, maxFeePerGas: S, maxPriorityFeePerGas: I, nonce: N, type: P, value: M, ...k } = e;
+  const { account: n = t.account, chain: r = t.chain, accessList: s, authorizationList: i, blobs: o, data: a, gas: d, gasPrice: m, maxFeePerBlobGas: g, maxFeePerGas: S, maxPriorityFeePerGas: I, nonce: N, type: F, value: M, ...k } = e;
   if (typeof n > "u")
     throw new eh({
       docsPath: "/docs/actions/wallet/sendTransaction"
@@ -6907,9 +6907,9 @@ async function th(t, e) {
         });
     })();
     if (K?.type === "json-rpc" || K === null) {
-      let j;
-      r !== null && (j = await kt(t, Hc, "getChainId")({}), o1({
-        currentChainId: j,
+      let z;
+      r !== null && (z = await kt(t, Hc, "getChainId")({}), o1({
+        currentChainId: z,
         chain: r
       }));
       const U = t.chain?.formatters?.transactionRequest?.format, J = (U || zc)({
@@ -6919,7 +6919,7 @@ async function th(t, e) {
         account: K,
         authorizationList: i,
         blobs: o,
-        chainId: j,
+        chainId: z,
         data: a,
         gas: d,
         gasPrice: m,
@@ -6928,7 +6928,7 @@ async function th(t, e) {
         maxPriorityFeePerGas: I,
         nonce: N,
         to: Y,
-        type: P,
+        type: F,
         value: M
       }, "sendTransaction"), ne = ua.get(t.uid), te = ne ? "wallet_sendTransaction" : "eth_sendTransaction";
       try {
@@ -6936,23 +6936,23 @@ async function th(t, e) {
           method: te,
           params: [J]
         }, { retryCount: 0 });
-      } catch (z) {
+      } catch (V) {
         if (ne === !1)
-          throw z;
-        const C = z;
+          throw V;
+        const C = V;
         if (C.name === "InvalidInputRpcError" || C.name === "InvalidParamsRpcError" || C.name === "MethodNotFoundRpcError" || C.name === "MethodNotSupportedRpcError")
           return await t.request({
             method: "wallet_sendTransaction",
             params: [J]
-          }, { retryCount: 0 }).then((F) => (ua.set(t.uid, !0), F)).catch((F) => {
-            const q = F;
-            throw q.name === "MethodNotFoundRpcError" || q.name === "MethodNotSupportedRpcError" ? (ua.set(t.uid, !1), C) : q;
+          }, { retryCount: 0 }).then((L) => (ua.set(t.uid, !0), L)).catch((L) => {
+            const G = L;
+            throw G.name === "MethodNotFoundRpcError" || G.name === "MethodNotSupportedRpcError" ? (ua.set(t.uid, !1), C) : G;
           });
         throw C;
       }
     }
     if (K?.type === "local") {
-      const j = await kt(t, Ff, "prepareTransactionRequest")({
+      const z = await kt(t, Ff, "prepareTransactionRequest")({
         account: K,
         accessList: s,
         authorizationList: i,
@@ -6967,15 +6967,15 @@ async function th(t, e) {
         nonce: N,
         nonceManager: K.nonceManager,
         parameters: [...Pf, "sidecars"],
-        type: P,
+        type: F,
         value: M,
         ...k,
         to: Y
-      }), U = r?.serializers?.transaction, V = await K.signTransaction(j, {
+      }), U = r?.serializers?.transaction, j = await K.signTransaction(z, {
         serializer: U
       });
       return await kt(t, N1, "sendRawTransaction")({
-        serializedTransaction: V
+        serializedTransaction: j
       });
     }
     throw K?.type === "smart" ? new ca({
@@ -7006,14 +7006,14 @@ async function Ni(t, e) {
       throw new eh({
         docsPath: "/docs/contract/writeContract"
       });
-    const N = a ? In(a) : null, P = Vg({
+    const N = a ? In(a) : null, F = Vg({
       abi: o,
       args: m,
       functionName: S
     });
     try {
       return await kt(n, r, s)({
-        data: `${P}${g ? g.replace("0x", "") : ""}`,
+        data: `${F}${g ? g.replace("0x", "") : ""}`,
         to: d,
         account: N,
         ...I
@@ -7210,7 +7210,7 @@ function oh(t = 11) {
   return di.substring(ui, ui++ + t);
 }
 function F1(t) {
-  const { batch: e, chain: n, ccipRead: r, key: s = "base", name: i = "Base Client", type: o = "base" } = t, a = t.experimental_blockTag ?? (typeof n?.experimental_preconfirmationTime == "number" ? "pending" : void 0), d = n?.blockTime ?? 12e3, m = Math.min(Math.max(Math.floor(d / 2), 500), 4e3), g = t.pollingInterval ?? m, S = t.cacheTime ?? g, I = t.account ? In(t.account) : void 0, { config: N, request: P, value: M } = t.transport({
+  const { batch: e, chain: n, ccipRead: r, key: s = "base", name: i = "Base Client", type: o = "base" } = t, a = t.experimental_blockTag ?? (typeof n?.experimental_preconfirmationTime == "number" ? "pending" : void 0), d = n?.blockTime ?? 12e3, m = Math.min(Math.max(Math.floor(d / 2), 500), 4e3), g = t.pollingInterval ?? m, S = t.cacheTime ?? g, I = t.account ? In(t.account) : void 0, { config: N, request: F, value: M } = t.transport({
     account: I,
     chain: n,
     pollingInterval: g
@@ -7223,18 +7223,18 @@ function F1(t) {
     key: s,
     name: i,
     pollingInterval: g,
-    request: P,
+    request: F,
     transport: k,
     type: o,
     uid: oh(),
     ...a ? { experimental_blockTag: a } : {}
   };
-  function Y(j) {
+  function Y(z) {
     return (U) => {
-      const V = U(j);
+      const j = U(z);
       for (const ne in K)
-        delete V[ne];
-      const J = { ...j, ...V };
+        delete j[ne];
+      const J = { ...z, ...j };
       return Object.assign(J, { extend: Y(J) });
     };
   }
@@ -7490,8 +7490,8 @@ function W1() {
     function i(d, m, g, S, I) {
       if (typeof g != "function")
         throw new TypeError("The listener must be a function");
-      var N = new s(g, S || d, I), P = n ? n + m : m;
-      return d._events[P] ? d._events[P].fn ? d._events[P] = [d._events[P], N] : d._events[P].push(N) : (d._events[P] = N, d._eventsCount++), d;
+      var N = new s(g, S || d, I), F = n ? n + m : m;
+      return d._events[F] ? d._events[F].fn ? d._events[F] = [d._events[F], N] : d._events[F].push(N) : (d._events[F] = N, d._eventsCount++), d;
     }
     function o(d, m) {
       --d._eventsCount === 0 ? d._events = new r() : delete d._events[m];
@@ -7509,16 +7509,16 @@ function W1() {
       var g = n ? n + m : m, S = this._events[g];
       if (!S) return [];
       if (S.fn) return [S.fn];
-      for (var I = 0, N = S.length, P = new Array(N); I < N; I++)
-        P[I] = S[I].fn;
-      return P;
+      for (var I = 0, N = S.length, F = new Array(N); I < N; I++)
+        F[I] = S[I].fn;
+      return F;
     }, a.prototype.listenerCount = function(m) {
       var g = n ? n + m : m, S = this._events[g];
       return S ? S.fn ? 1 : S.length : 0;
-    }, a.prototype.emit = function(m, g, S, I, N, P) {
+    }, a.prototype.emit = function(m, g, S, I, N, F) {
       var M = n ? n + m : m;
       if (!this._events[M]) return !1;
-      var k = this._events[M], K = arguments.length, Y, j;
+      var k = this._events[M], K = arguments.length, Y, z;
       if (k.fn) {
         switch (k.once && this.removeListener(m, k.fn, void 0, !0), K) {
           case 1:
@@ -7532,31 +7532,31 @@ function W1() {
           case 5:
             return k.fn.call(k.context, g, S, I, N), !0;
           case 6:
-            return k.fn.call(k.context, g, S, I, N, P), !0;
+            return k.fn.call(k.context, g, S, I, N, F), !0;
         }
-        for (j = 1, Y = new Array(K - 1); j < K; j++)
-          Y[j - 1] = arguments[j];
+        for (z = 1, Y = new Array(K - 1); z < K; z++)
+          Y[z - 1] = arguments[z];
         k.fn.apply(k.context, Y);
       } else {
-        var U = k.length, V;
-        for (j = 0; j < U; j++)
-          switch (k[j].once && this.removeListener(m, k[j].fn, void 0, !0), K) {
+        var U = k.length, j;
+        for (z = 0; z < U; z++)
+          switch (k[z].once && this.removeListener(m, k[z].fn, void 0, !0), K) {
             case 1:
-              k[j].fn.call(k[j].context);
+              k[z].fn.call(k[z].context);
               break;
             case 2:
-              k[j].fn.call(k[j].context, g);
+              k[z].fn.call(k[z].context, g);
               break;
             case 3:
-              k[j].fn.call(k[j].context, g, S);
+              k[z].fn.call(k[z].context, g, S);
               break;
             case 4:
-              k[j].fn.call(k[j].context, g, S, I);
+              k[z].fn.call(k[z].context, g, S, I);
               break;
             default:
-              if (!Y) for (V = 1, Y = new Array(K - 1); V < K; V++)
-                Y[V - 1] = arguments[V];
-              k[j].fn.apply(k[j].context, Y);
+              if (!Y) for (j = 1, Y = new Array(K - 1); j < K; j++)
+                Y[j - 1] = arguments[j];
+              k[z].fn.apply(k[z].context, Y);
           }
       }
       return !0;
@@ -7569,12 +7569,12 @@ function W1() {
       if (!this._events[N]) return this;
       if (!g)
         return o(this, N), this;
-      var P = this._events[N];
-      if (P.fn)
-        P.fn === g && (!I || P.once) && (!S || P.context === S) && o(this, N);
+      var F = this._events[N];
+      if (F.fn)
+        F.fn === g && (!I || F.once) && (!S || F.context === S) && o(this, N);
       else {
-        for (var M = 0, k = [], K = P.length; M < K; M++)
-          (P[M].fn !== g || I && !P[M].once || S && P[M].context !== S) && k.push(P[M]);
+        for (var M = 0, k = [], K = F.length; M < K; M++)
+          (F[M].fn !== g || I && !F[M].once || S && F[M].context !== S) && k.push(F[M]);
         k.length ? this._events[N] = k.length === 1 ? k[0] : k : o(this, N);
       }
       return this;
@@ -10547,42 +10547,42 @@ function o_() {
     t[s] = r[s], e[r.charCodeAt(s)] = s;
   e[45] = 62, e[95] = 63;
   function o(N) {
-    var P = N.length;
-    if (P % 4 > 0)
+    var F = N.length;
+    if (F % 4 > 0)
       throw new Error("Invalid string. Length must be a multiple of 4");
     var M = N.indexOf("=");
-    M === -1 && (M = P);
-    var k = M === P ? 0 : 4 - M % 4;
+    M === -1 && (M = F);
+    var k = M === F ? 0 : 4 - M % 4;
     return [M, k];
   }
   function a(N) {
-    var P = o(N), M = P[0], k = P[1];
+    var F = o(N), M = F[0], k = F[1];
     return (M + k) * 3 / 4 - k;
   }
-  function d(N, P, M) {
-    return (P + M) * 3 / 4 - M;
+  function d(N, F, M) {
+    return (F + M) * 3 / 4 - M;
   }
   function m(N) {
-    var P, M = o(N), k = M[0], K = M[1], Y = new n(d(N, k, K)), j = 0, U = K > 0 ? k - 4 : k, V;
-    for (V = 0; V < U; V += 4)
-      P = e[N.charCodeAt(V)] << 18 | e[N.charCodeAt(V + 1)] << 12 | e[N.charCodeAt(V + 2)] << 6 | e[N.charCodeAt(V + 3)], Y[j++] = P >> 16 & 255, Y[j++] = P >> 8 & 255, Y[j++] = P & 255;
-    return K === 2 && (P = e[N.charCodeAt(V)] << 2 | e[N.charCodeAt(V + 1)] >> 4, Y[j++] = P & 255), K === 1 && (P = e[N.charCodeAt(V)] << 10 | e[N.charCodeAt(V + 1)] << 4 | e[N.charCodeAt(V + 2)] >> 2, Y[j++] = P >> 8 & 255, Y[j++] = P & 255), Y;
+    var F, M = o(N), k = M[0], K = M[1], Y = new n(d(N, k, K)), z = 0, U = K > 0 ? k - 4 : k, j;
+    for (j = 0; j < U; j += 4)
+      F = e[N.charCodeAt(j)] << 18 | e[N.charCodeAt(j + 1)] << 12 | e[N.charCodeAt(j + 2)] << 6 | e[N.charCodeAt(j + 3)], Y[z++] = F >> 16 & 255, Y[z++] = F >> 8 & 255, Y[z++] = F & 255;
+    return K === 2 && (F = e[N.charCodeAt(j)] << 2 | e[N.charCodeAt(j + 1)] >> 4, Y[z++] = F & 255), K === 1 && (F = e[N.charCodeAt(j)] << 10 | e[N.charCodeAt(j + 1)] << 4 | e[N.charCodeAt(j + 2)] >> 2, Y[z++] = F >> 8 & 255, Y[z++] = F & 255), Y;
   }
   function g(N) {
     return t[N >> 18 & 63] + t[N >> 12 & 63] + t[N >> 6 & 63] + t[N & 63];
   }
-  function S(N, P, M) {
-    for (var k, K = [], Y = P; Y < M; Y += 3)
+  function S(N, F, M) {
+    for (var k, K = [], Y = F; Y < M; Y += 3)
       k = (N[Y] << 16 & 16711680) + (N[Y + 1] << 8 & 65280) + (N[Y + 2] & 255), K.push(g(k));
     return K.join("");
   }
   function I(N) {
-    for (var P, M = N.length, k = M % 3, K = [], Y = 16383, j = 0, U = M - k; j < U; j += Y)
-      K.push(S(N, j, j + Y > U ? U : j + Y));
-    return k === 1 ? (P = N[M - 1], K.push(
-      t[P >> 2] + t[P << 4 & 63] + "=="
-    )) : k === 2 && (P = (N[M - 2] << 8) + N[M - 1], K.push(
-      t[P >> 10] + t[P >> 4 & 63] + t[P << 2 & 63] + "="
+    for (var F, M = N.length, k = M % 3, K = [], Y = 16383, z = 0, U = M - k; z < U; z += Y)
+      K.push(S(N, z, z + Y > U ? U : z + Y));
+    return k === 1 ? (F = N[M - 1], K.push(
+      t[F >> 2] + t[F << 4 & 63] + "=="
+    )) : k === 2 && (F = (N[M - 2] << 8) + N[M - 1], K.push(
+      t[F >> 10] + t[F >> 4 & 63] + t[F << 2 & 63] + "="
     )), K.join("");
   }
   return ts;
@@ -10606,12 +10606,12 @@ function a_() {
     }
     return (N ? -1 : 1) * o * Math.pow(2, i - r);
   }, li.write = function(t, e, n, r, s, i) {
-    var o, a, d, m = i * 8 - s - 1, g = (1 << m) - 1, S = g >> 1, I = s === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, N = r ? 0 : i - 1, P = r ? 1 : -1, M = e < 0 || e === 0 && 1 / e < 0 ? 1 : 0;
-    for (e = Math.abs(e), isNaN(e) || e === 1 / 0 ? (a = isNaN(e) ? 1 : 0, o = g) : (o = Math.floor(Math.log(e) / Math.LN2), e * (d = Math.pow(2, -o)) < 1 && (o--, d *= 2), o + S >= 1 ? e += I / d : e += I * Math.pow(2, 1 - S), e * d >= 2 && (o++, d /= 2), o + S >= g ? (a = 0, o = g) : o + S >= 1 ? (a = (e * d - 1) * Math.pow(2, s), o = o + S) : (a = e * Math.pow(2, S - 1) * Math.pow(2, s), o = 0)); s >= 8; t[n + N] = a & 255, N += P, a /= 256, s -= 8)
+    var o, a, d, m = i * 8 - s - 1, g = (1 << m) - 1, S = g >> 1, I = s === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, N = r ? 0 : i - 1, F = r ? 1 : -1, M = e < 0 || e === 0 && 1 / e < 0 ? 1 : 0;
+    for (e = Math.abs(e), isNaN(e) || e === 1 / 0 ? (a = isNaN(e) ? 1 : 0, o = g) : (o = Math.floor(Math.log(e) / Math.LN2), e * (d = Math.pow(2, -o)) < 1 && (o--, d *= 2), o + S >= 1 ? e += I / d : e += I * Math.pow(2, 1 - S), e * d >= 2 && (o++, d /= 2), o + S >= g ? (a = 0, o = g) : o + S >= 1 ? (a = (e * d - 1) * Math.pow(2, s), o = o + S) : (a = e * Math.pow(2, S - 1) * Math.pow(2, s), o = 0)); s >= 8; t[n + N] = a & 255, N += F, a /= 256, s -= 8)
       ;
-    for (o = o << s | a, m += s; m > 0; t[n + N] = o & 255, N += P, o /= 256, m -= 8)
+    for (o = o << s | a, m += s; m > 0; t[n + N] = o & 255, N += F, o /= 256, m -= 8)
       ;
-    t[n + N - P] |= M * 128;
+    t[n + N - F] |= M * 128;
   }), li;
 }
 /*!
@@ -10673,7 +10673,7 @@ function tu() {
       if (typeof b == "string")
         return I(b, f);
       if (ArrayBuffer.isView(b))
-        return P(b);
+        return F(b);
       if (b == null)
         throw new TypeError(
           "The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " + typeof b
@@ -10687,8 +10687,8 @@ function tu() {
       const x = b.valueOf && b.valueOf();
       if (x != null && x !== b)
         return a.from(x, f, h);
-      const L = k(b);
-      if (L) return L;
+      const D = k(b);
+      if (D) return D;
       if (typeof Symbol < "u" && Symbol.toPrimitive != null && typeof b[Symbol.toPrimitive] == "function")
         return a.from(b[Symbol.toPrimitive]("string"), f, h);
       throw new TypeError(
@@ -10721,10 +10721,10 @@ function tu() {
     function I(b, f) {
       if ((typeof f != "string" || f === "") && (f = "utf8"), !a.isEncoding(f))
         throw new TypeError("Unknown encoding: " + f);
-      const h = j(b, f) | 0;
+      const h = z(b, f) | 0;
       let x = o(h);
-      const L = x.write(b, f);
-      return L !== h && (x = x.slice(0, L)), x;
+      const D = x.write(b, f);
+      return D !== h && (x = x.slice(0, D)), x;
     }
     function N(b) {
       const f = b.length < 0 ? 0 : K(b.length) | 0, h = o(f);
@@ -10732,7 +10732,7 @@ function tu() {
         h[x] = b[x] & 255;
       return h;
     }
-    function P(b) {
+    function F(b) {
       if (qt(b, Uint8Array)) {
         const f = new Uint8Array(b);
         return M(f.buffer, f.byteOffset, f.byteLength);
@@ -10773,13 +10773,13 @@ function tu() {
           'The "buf1", "buf2" arguments must be one of type Buffer or Uint8Array'
         );
       if (f === h) return 0;
-      let x = f.length, L = h.length;
-      for (let $ = 0, Z = Math.min(x, L); $ < Z; ++$)
+      let x = f.length, D = h.length;
+      for (let $ = 0, Z = Math.min(x, D); $ < Z; ++$)
         if (f[$] !== h[$]) {
-          x = f[$], L = h[$];
+          x = f[$], D = h[$];
           break;
         }
-      return x < L ? -1 : L < x ? 1 : 0;
+      return x < D ? -1 : D < x ? 1 : 0;
     }, a.isEncoding = function(f) {
       switch (String(f).toLowerCase()) {
         case "hex":
@@ -10806,25 +10806,25 @@ function tu() {
       if (h === void 0)
         for (h = 0, x = 0; x < f.length; ++x)
           h += f[x].length;
-      const L = a.allocUnsafe(h);
+      const D = a.allocUnsafe(h);
       let $ = 0;
       for (x = 0; x < f.length; ++x) {
         let Z = f[x];
         if (qt(Z, Uint8Array))
-          $ + Z.length > L.length ? (a.isBuffer(Z) || (Z = a.from(Z)), Z.copy(L, $)) : Uint8Array.prototype.set.call(
-            L,
+          $ + Z.length > D.length ? (a.isBuffer(Z) || (Z = a.from(Z)), Z.copy(D, $)) : Uint8Array.prototype.set.call(
+            D,
             Z,
             $
           );
         else if (a.isBuffer(Z))
-          Z.copy(L, $);
+          Z.copy(D, $);
         else
           throw new TypeError('"list" argument must be an Array of Buffers');
         $ += Z.length;
       }
-      return L;
+      return D;
     };
-    function j(b, f) {
+    function z(b, f) {
       if (a.isBuffer(b))
         return b.length;
       if (ArrayBuffer.isView(b) || qt(b, ArrayBuffer))
@@ -10835,7 +10835,7 @@ function tu() {
         );
       const h = b.length, x = arguments.length > 2 && arguments[2] === !0;
       if (!x && h === 0) return 0;
-      let L = !1;
+      let D = !1;
       for (; ; )
         switch (f) {
           case "ascii":
@@ -10855,12 +10855,12 @@ function tu() {
           case "base64":
             return Fe(b).length;
           default:
-            if (L)
+            if (D)
               return x ? -1 : Ue(b).length;
-            f = ("" + f).toLowerCase(), L = !0;
+            f = ("" + f).toLowerCase(), D = !0;
         }
     }
-    a.byteLength = j;
+    a.byteLength = z;
     function U(b, f, h) {
       let x = !1;
       if ((f === void 0 || f < 0) && (f = 0), f > this.length || ((h === void 0 || h > this.length) && (h = this.length), h <= 0) || (h >>>= 0, f >>>= 0, h <= f))
@@ -10890,7 +10890,7 @@ function tu() {
         }
     }
     a.prototype._isBuffer = !0;
-    function V(b, f, h) {
+    function j(b, f, h) {
       const x = b[f];
       b[f] = b[h], b[h] = x;
     }
@@ -10899,21 +10899,21 @@ function tu() {
       if (f % 2 !== 0)
         throw new RangeError("Buffer size must be a multiple of 16-bits");
       for (let h = 0; h < f; h += 2)
-        V(this, h, h + 1);
+        j(this, h, h + 1);
       return this;
     }, a.prototype.swap32 = function() {
       const f = this.length;
       if (f % 4 !== 0)
         throw new RangeError("Buffer size must be a multiple of 32-bits");
       for (let h = 0; h < f; h += 4)
-        V(this, h, h + 3), V(this, h + 1, h + 2);
+        j(this, h, h + 3), j(this, h + 1, h + 2);
       return this;
     }, a.prototype.swap64 = function() {
       const f = this.length;
       if (f % 8 !== 0)
         throw new RangeError("Buffer size must be a multiple of 64-bits");
       for (let h = 0; h < f; h += 8)
-        V(this, h, h + 7), V(this, h + 1, h + 6), V(this, h + 2, h + 5), V(this, h + 3, h + 4);
+        j(this, h, h + 7), j(this, h + 1, h + 6), j(this, h + 2, h + 5), j(this, h + 3, h + 4);
       return this;
     }, a.prototype.toString = function() {
       const f = this.length;
@@ -10925,22 +10925,22 @@ function tu() {
       let f = "";
       const h = t.INSPECT_MAX_BYTES;
       return f = this.toString("hex", 0, h).replace(/(.{2})/g, "$1 ").trim(), this.length > h && (f += " ... "), "<Buffer " + f + ">";
-    }, r && (a.prototype[r] = a.prototype.inspect), a.prototype.compare = function(f, h, x, L, $) {
+    }, r && (a.prototype[r] = a.prototype.inspect), a.prototype.compare = function(f, h, x, D, $) {
       if (qt(f, Uint8Array) && (f = a.from(f, f.offset, f.byteLength)), !a.isBuffer(f))
         throw new TypeError(
           'The "target" argument must be one of type Buffer or Uint8Array. Received type ' + typeof f
         );
-      if (h === void 0 && (h = 0), x === void 0 && (x = f ? f.length : 0), L === void 0 && (L = 0), $ === void 0 && ($ = this.length), h < 0 || x > f.length || L < 0 || $ > this.length)
+      if (h === void 0 && (h = 0), x === void 0 && (x = f ? f.length : 0), D === void 0 && (D = 0), $ === void 0 && ($ = this.length), h < 0 || x > f.length || D < 0 || $ > this.length)
         throw new RangeError("out of range index");
-      if (L >= $ && h >= x)
+      if (D >= $ && h >= x)
         return 0;
-      if (L >= $)
+      if (D >= $)
         return -1;
       if (h >= x)
         return 1;
-      if (h >>>= 0, x >>>= 0, L >>>= 0, $ >>>= 0, this === f) return 0;
-      let Z = $ - L, Ae = x - h;
-      const be = Math.min(Z, Ae), ge = this.slice(L, $), $e = f.slice(h, x);
+      if (h >>>= 0, x >>>= 0, D >>>= 0, $ >>>= 0, this === f) return 0;
+      let Z = $ - D, Ae = x - h;
+      const be = Math.min(Z, Ae), ge = this.slice(D, $), $e = f.slice(h, x);
       for (let pe = 0; pe < be; ++pe)
         if (ge[pe] !== $e[pe]) {
           Z = ge[pe], Ae = $e[pe];
@@ -10948,21 +10948,21 @@ function tu() {
         }
       return Z < Ae ? -1 : Ae < Z ? 1 : 0;
     };
-    function J(b, f, h, x, L) {
+    function J(b, f, h, x, D) {
       if (b.length === 0) return -1;
-      if (typeof h == "string" ? (x = h, h = 0) : h > 2147483647 ? h = 2147483647 : h < -2147483648 && (h = -2147483648), h = +h, je(h) && (h = L ? 0 : b.length - 1), h < 0 && (h = b.length + h), h >= b.length) {
-        if (L) return -1;
+      if (typeof h == "string" ? (x = h, h = 0) : h > 2147483647 ? h = 2147483647 : h < -2147483648 && (h = -2147483648), h = +h, je(h) && (h = D ? 0 : b.length - 1), h < 0 && (h = b.length + h), h >= b.length) {
+        if (D) return -1;
         h = b.length - 1;
       } else if (h < 0)
-        if (L) h = 0;
+        if (D) h = 0;
         else return -1;
       if (typeof f == "string" && (f = a.from(f, x)), a.isBuffer(f))
-        return f.length === 0 ? -1 : ne(b, f, h, x, L);
+        return f.length === 0 ? -1 : ne(b, f, h, x, D);
       if (typeof f == "number")
-        return f = f & 255, typeof Uint8Array.prototype.indexOf == "function" ? L ? Uint8Array.prototype.indexOf.call(b, f, h) : Uint8Array.prototype.lastIndexOf.call(b, f, h) : ne(b, [f], h, x, L);
+        return f = f & 255, typeof Uint8Array.prototype.indexOf == "function" ? D ? Uint8Array.prototype.indexOf.call(b, f, h) : Uint8Array.prototype.lastIndexOf.call(b, f, h) : ne(b, [f], h, x, D);
       throw new TypeError("val must be string, number or Buffer");
     }
-    function ne(b, f, h, x, L) {
+    function ne(b, f, h, x, D) {
       let $ = 1, Z = b.length, Ae = f.length;
       if (x !== void 0 && (x = String(x).toLowerCase(), x === "ucs2" || x === "ucs-2" || x === "utf16le" || x === "utf-16le")) {
         if (b.length < 2 || f.length < 2)
@@ -10973,7 +10973,7 @@ function tu() {
         return $ === 1 ? $e[pe] : $e.readUInt16BE(pe * $);
       }
       let ge;
-      if (L) {
+      if (D) {
         let $e = -1;
         for (ge = h; ge < Z; ge++)
           if (be(b, ge) === be(f, $e === -1 ? 0 : ge - $e)) {
@@ -11001,8 +11001,8 @@ function tu() {
     };
     function te(b, f, h, x) {
       h = Number(h) || 0;
-      const L = b.length - h;
-      x ? (x = Number(x), x > L && (x = L)) : x = L;
+      const D = b.length - h;
+      x ? (x = Number(x), x > D && (x = D)) : x = D;
       const $ = f.length;
       x > $ / 2 && (x = $ / 2);
       let Z;
@@ -11013,25 +11013,25 @@ function tu() {
       }
       return Z;
     }
-    function z(b, f, h, x) {
+    function V(b, f, h, x) {
       return Le(Ue(f, b.length - h), b, h, x);
     }
     function C(b, f, h, x) {
       return Le(ze(f), b, h, x);
     }
-    function F(b, f, h, x) {
+    function L(b, f, h, x) {
       return Le(Fe(f), b, h, x);
     }
-    function q(b, f, h, x) {
+    function G(b, f, h, x) {
       return Le(yr(f, b.length - h), b, h, x);
     }
-    a.prototype.write = function(f, h, x, L) {
+    a.prototype.write = function(f, h, x, D) {
       if (h === void 0)
-        L = "utf8", x = this.length, h = 0;
+        D = "utf8", x = this.length, h = 0;
       else if (x === void 0 && typeof h == "string")
-        L = h, x = this.length, h = 0;
+        D = h, x = this.length, h = 0;
       else if (isFinite(h))
-        h = h >>> 0, isFinite(x) ? (x = x >>> 0, L === void 0 && (L = "utf8")) : (L = x, x = void 0);
+        h = h >>> 0, isFinite(x) ? (x = x >>> 0, D === void 0 && (D = "utf8")) : (D = x, x = void 0);
       else
         throw new Error(
           "Buffer.write(string, encoding, offset[, length]) is no longer supported"
@@ -11039,29 +11039,29 @@ function tu() {
       const $ = this.length - h;
       if ((x === void 0 || x > $) && (x = $), f.length > 0 && (x < 0 || h < 0) || h > this.length)
         throw new RangeError("Attempt to write outside buffer bounds");
-      L || (L = "utf8");
+      D || (D = "utf8");
       let Z = !1;
       for (; ; )
-        switch (L) {
+        switch (D) {
           case "hex":
             return te(this, f, h, x);
           case "utf8":
           case "utf-8":
-            return z(this, f, h, x);
+            return V(this, f, h, x);
           case "ascii":
           case "latin1":
           case "binary":
             return C(this, f, h, x);
           case "base64":
-            return F(this, f, h, x);
+            return L(this, f, h, x);
           case "ucs2":
           case "ucs-2":
           case "utf16le":
           case "utf-16le":
-            return q(this, f, h, x);
+            return G(this, f, h, x);
           default:
-            if (Z) throw new TypeError("Unknown encoding: " + L);
-            L = ("" + L).toLowerCase(), Z = !0;
+            if (Z) throw new TypeError("Unknown encoding: " + D);
+            D = ("" + D).toLowerCase(), Z = !0;
         }
     }, a.prototype.toJSON = function() {
       return {
@@ -11075,27 +11075,27 @@ function tu() {
     function c(b, f, h) {
       h = Math.min(b.length, h);
       const x = [];
-      let L = f;
-      for (; L < h; ) {
-        const $ = b[L];
+      let D = f;
+      for (; D < h; ) {
+        const $ = b[D];
         let Z = null, Ae = $ > 239 ? 4 : $ > 223 ? 3 : $ > 191 ? 2 : 1;
-        if (L + Ae <= h) {
+        if (D + Ae <= h) {
           let be, ge, $e, pe;
           switch (Ae) {
             case 1:
               $ < 128 && (Z = $);
               break;
             case 2:
-              be = b[L + 1], (be & 192) === 128 && (pe = ($ & 31) << 6 | be & 63, pe > 127 && (Z = pe));
+              be = b[D + 1], (be & 192) === 128 && (pe = ($ & 31) << 6 | be & 63, pe > 127 && (Z = pe));
               break;
             case 3:
-              be = b[L + 1], ge = b[L + 2], (be & 192) === 128 && (ge & 192) === 128 && (pe = ($ & 15) << 12 | (be & 63) << 6 | ge & 63, pe > 2047 && (pe < 55296 || pe > 57343) && (Z = pe));
+              be = b[D + 1], ge = b[D + 2], (be & 192) === 128 && (ge & 192) === 128 && (pe = ($ & 15) << 12 | (be & 63) << 6 | ge & 63, pe > 2047 && (pe < 55296 || pe > 57343) && (Z = pe));
               break;
             case 4:
-              be = b[L + 1], ge = b[L + 2], $e = b[L + 3], (be & 192) === 128 && (ge & 192) === 128 && ($e & 192) === 128 && (pe = ($ & 15) << 18 | (be & 63) << 12 | (ge & 63) << 6 | $e & 63, pe > 65535 && pe < 1114112 && (Z = pe));
+              be = b[D + 1], ge = b[D + 2], $e = b[D + 3], (be & 192) === 128 && (ge & 192) === 128 && ($e & 192) === 128 && (pe = ($ & 15) << 18 | (be & 63) << 12 | (ge & 63) << 6 | $e & 63, pe > 65535 && pe < 1114112 && (Z = pe));
           }
         }
-        Z === null ? (Z = 65533, Ae = 1) : Z > 65535 && (Z -= 65536, x.push(Z >>> 10 & 1023 | 55296), Z = 56320 | Z & 1023), x.push(Z), L += Ae;
+        Z === null ? (Z = 65533, Ae = 1) : Z > 65535 && (Z -= 65536, x.push(Z >>> 10 & 1023 | 55296), Z = 56320 | Z & 1023), x.push(Z), D += Ae;
       }
       return y(x);
     }
@@ -11115,37 +11115,37 @@ function tu() {
     function A(b, f, h) {
       let x = "";
       h = Math.min(b.length, h);
-      for (let L = f; L < h; ++L)
-        x += String.fromCharCode(b[L] & 127);
+      for (let D = f; D < h; ++D)
+        x += String.fromCharCode(b[D] & 127);
       return x;
     }
     function v(b, f, h) {
       let x = "";
       h = Math.min(b.length, h);
-      for (let L = f; L < h; ++L)
-        x += String.fromCharCode(b[L]);
+      for (let D = f; D < h; ++D)
+        x += String.fromCharCode(b[D]);
       return x;
     }
     function R(b, f, h) {
       const x = b.length;
       (!f || f < 0) && (f = 0), (!h || h < 0 || h > x) && (h = x);
-      let L = "";
+      let D = "";
       for (let $ = f; $ < h; ++$)
-        L += qe[b[$]];
-      return L;
+        D += qe[b[$]];
+      return D;
     }
     function O(b, f, h) {
       const x = b.slice(f, h);
-      let L = "";
+      let D = "";
       for (let $ = 0; $ < x.length - 1; $ += 2)
-        L += String.fromCharCode(x[$] + x[$ + 1] * 256);
-      return L;
+        D += String.fromCharCode(x[$] + x[$ + 1] * 256);
+      return D;
     }
     a.prototype.slice = function(f, h) {
       const x = this.length;
       f = ~~f, h = h === void 0 ? x : ~~h, f < 0 ? (f += x, f < 0 && (f = 0)) : f > x && (f = x), h < 0 ? (h += x, h < 0 && (h = 0)) : h > x && (h = x), h < f && (h = f);
-      const L = this.subarray(f, h);
-      return Object.setPrototypeOf(L, a.prototype), L;
+      const D = this.subarray(f, h);
+      return Object.setPrototypeOf(D, a.prototype), D;
     };
     function _(b, f, h) {
       if (b % 1 !== 0 || b < 0) throw new RangeError("offset is not uint");
@@ -11153,16 +11153,16 @@ function tu() {
     }
     a.prototype.readUintLE = a.prototype.readUIntLE = function(f, h, x) {
       f = f >>> 0, h = h >>> 0, x || _(f, h, this.length);
-      let L = this[f], $ = 1, Z = 0;
+      let D = this[f], $ = 1, Z = 0;
       for (; ++Z < h && ($ *= 256); )
-        L += this[f + Z] * $;
-      return L;
+        D += this[f + Z] * $;
+      return D;
     }, a.prototype.readUintBE = a.prototype.readUIntBE = function(f, h, x) {
       f = f >>> 0, h = h >>> 0, x || _(f, h, this.length);
-      let L = this[f + --h], $ = 1;
+      let D = this[f + --h], $ = 1;
       for (; h > 0 && ($ *= 256); )
-        L += this[f + --h] * $;
-      return L;
+        D += this[f + --h] * $;
+      return D;
     }, a.prototype.readUint8 = a.prototype.readUInt8 = function(f, h) {
       return f = f >>> 0, h || _(f, 1, this.length), this[f];
     }, a.prototype.readUint16LE = a.prototype.readUInt16LE = function(f, h) {
@@ -11177,25 +11177,25 @@ function tu() {
       f = f >>> 0, De(f, "offset");
       const h = this[f], x = this[f + 7];
       (h === void 0 || x === void 0) && Re(f, this.length - 8);
-      const L = h + this[++f] * 2 ** 8 + this[++f] * 2 ** 16 + this[++f] * 2 ** 24, $ = this[++f] + this[++f] * 2 ** 8 + this[++f] * 2 ** 16 + x * 2 ** 24;
-      return BigInt(L) + (BigInt($) << BigInt(32));
+      const D = h + this[++f] * 2 ** 8 + this[++f] * 2 ** 16 + this[++f] * 2 ** 24, $ = this[++f] + this[++f] * 2 ** 8 + this[++f] * 2 ** 16 + x * 2 ** 24;
+      return BigInt(D) + (BigInt($) << BigInt(32));
     }), a.prototype.readBigUInt64BE = en(function(f) {
       f = f >>> 0, De(f, "offset");
       const h = this[f], x = this[f + 7];
       (h === void 0 || x === void 0) && Re(f, this.length - 8);
-      const L = h * 2 ** 24 + this[++f] * 2 ** 16 + this[++f] * 2 ** 8 + this[++f], $ = this[++f] * 2 ** 24 + this[++f] * 2 ** 16 + this[++f] * 2 ** 8 + x;
-      return (BigInt(L) << BigInt(32)) + BigInt($);
+      const D = h * 2 ** 24 + this[++f] * 2 ** 16 + this[++f] * 2 ** 8 + this[++f], $ = this[++f] * 2 ** 24 + this[++f] * 2 ** 16 + this[++f] * 2 ** 8 + x;
+      return (BigInt(D) << BigInt(32)) + BigInt($);
     }), a.prototype.readIntLE = function(f, h, x) {
       f = f >>> 0, h = h >>> 0, x || _(f, h, this.length);
-      let L = this[f], $ = 1, Z = 0;
+      let D = this[f], $ = 1, Z = 0;
       for (; ++Z < h && ($ *= 256); )
-        L += this[f + Z] * $;
-      return $ *= 128, L >= $ && (L -= Math.pow(2, 8 * h)), L;
+        D += this[f + Z] * $;
+      return $ *= 128, D >= $ && (D -= Math.pow(2, 8 * h)), D;
     }, a.prototype.readIntBE = function(f, h, x) {
       f = f >>> 0, h = h >>> 0, x || _(f, h, this.length);
-      let L = h, $ = 1, Z = this[f + --L];
-      for (; L > 0 && ($ *= 256); )
-        Z += this[f + --L] * $;
+      let D = h, $ = 1, Z = this[f + --D];
+      for (; D > 0 && ($ *= 256); )
+        Z += this[f + --D] * $;
       return $ *= 128, Z >= $ && (Z -= Math.pow(2, 8 * h)), Z;
     }, a.prototype.readInt8 = function(f, h) {
       return f = f >>> 0, h || _(f, 1, this.length), this[f] & 128 ? (255 - this[f] + 1) * -1 : this[f];
@@ -11215,15 +11215,15 @@ function tu() {
       f = f >>> 0, De(f, "offset");
       const h = this[f], x = this[f + 7];
       (h === void 0 || x === void 0) && Re(f, this.length - 8);
-      const L = this[f + 4] + this[f + 5] * 2 ** 8 + this[f + 6] * 2 ** 16 + (x << 24);
-      return (BigInt(L) << BigInt(32)) + BigInt(h + this[++f] * 2 ** 8 + this[++f] * 2 ** 16 + this[++f] * 2 ** 24);
+      const D = this[f + 4] + this[f + 5] * 2 ** 8 + this[f + 6] * 2 ** 16 + (x << 24);
+      return (BigInt(D) << BigInt(32)) + BigInt(h + this[++f] * 2 ** 8 + this[++f] * 2 ** 16 + this[++f] * 2 ** 24);
     }), a.prototype.readBigInt64BE = en(function(f) {
       f = f >>> 0, De(f, "offset");
       const h = this[f], x = this[f + 7];
       (h === void 0 || x === void 0) && Re(f, this.length - 8);
-      const L = (h << 24) + // Overflow
+      const D = (h << 24) + // Overflow
       this[++f] * 2 ** 16 + this[++f] * 2 ** 8 + this[++f];
-      return (BigInt(L) << BigInt(32)) + BigInt(this[++f] * 2 ** 24 + this[++f] * 2 ** 16 + this[++f] * 2 ** 8 + x);
+      return (BigInt(D) << BigInt(32)) + BigInt(this[++f] * 2 ** 24 + this[++f] * 2 ** 16 + this[++f] * 2 ** 8 + x);
     }), a.prototype.readFloatLE = function(f, h) {
       return f = f >>> 0, h || _(f, 4, this.length), n.read(this, f, !0, 23, 4);
     }, a.prototype.readFloatBE = function(f, h) {
@@ -11233,13 +11233,13 @@ function tu() {
     }, a.prototype.readDoubleBE = function(f, h) {
       return f = f >>> 0, h || _(f, 8, this.length), n.read(this, f, !1, 52, 8);
     };
-    function u(b, f, h, x, L, $) {
+    function u(b, f, h, x, D, $) {
       if (!a.isBuffer(b)) throw new TypeError('"buffer" argument must be a Buffer instance');
-      if (f > L || f < $) throw new RangeError('"value" argument is out of bounds');
+      if (f > D || f < $) throw new RangeError('"value" argument is out of bounds');
       if (h + x > b.length) throw new RangeError("Index out of range");
     }
-    a.prototype.writeUintLE = a.prototype.writeUIntLE = function(f, h, x, L) {
-      if (f = +f, h = h >>> 0, x = x >>> 0, !L) {
+    a.prototype.writeUintLE = a.prototype.writeUIntLE = function(f, h, x, D) {
+      if (f = +f, h = h >>> 0, x = x >>> 0, !D) {
         const Ae = Math.pow(2, 8 * x) - 1;
         u(this, f, h, x, Ae, 0);
       }
@@ -11247,8 +11247,8 @@ function tu() {
       for (this[h] = f & 255; ++Z < x && ($ *= 256); )
         this[h + Z] = f / $ & 255;
       return h + x;
-    }, a.prototype.writeUintBE = a.prototype.writeUIntBE = function(f, h, x, L) {
-      if (f = +f, h = h >>> 0, x = x >>> 0, !L) {
+    }, a.prototype.writeUintBE = a.prototype.writeUIntBE = function(f, h, x, D) {
+      if (f = +f, h = h >>> 0, x = x >>> 0, !D) {
         const Ae = Math.pow(2, 8 * x) - 1;
         u(this, f, h, x, Ae, 0);
       }
@@ -11267,15 +11267,15 @@ function tu() {
     }, a.prototype.writeUint32BE = a.prototype.writeUInt32BE = function(f, h, x) {
       return f = +f, h = h >>> 0, x || u(this, f, h, 4, 4294967295, 0), this[h] = f >>> 24, this[h + 1] = f >>> 16, this[h + 2] = f >>> 8, this[h + 3] = f & 255, h + 4;
     };
-    function l(b, f, h, x, L) {
-      we(f, x, L, b, h, 7);
+    function l(b, f, h, x, D) {
+      we(f, x, D, b, h, 7);
       let $ = Number(f & BigInt(4294967295));
       b[h++] = $, $ = $ >> 8, b[h++] = $, $ = $ >> 8, b[h++] = $, $ = $ >> 8, b[h++] = $;
       let Z = Number(f >> BigInt(32) & BigInt(4294967295));
       return b[h++] = Z, Z = Z >> 8, b[h++] = Z, Z = Z >> 8, b[h++] = Z, Z = Z >> 8, b[h++] = Z, h;
     }
-    function E(b, f, h, x, L) {
-      we(f, x, L, b, h, 7);
+    function E(b, f, h, x, D) {
+      we(f, x, D, b, h, 7);
       let $ = Number(f & BigInt(4294967295));
       b[h + 7] = $, $ = $ >> 8, b[h + 6] = $, $ = $ >> 8, b[h + 5] = $, $ = $ >> 8, b[h + 4] = $;
       let Z = Number(f >> BigInt(32) & BigInt(4294967295));
@@ -11285,8 +11285,8 @@ function tu() {
       return l(this, f, h, BigInt(0), BigInt("0xffffffffffffffff"));
     }), a.prototype.writeBigUInt64BE = en(function(f, h = 0) {
       return E(this, f, h, BigInt(0), BigInt("0xffffffffffffffff"));
-    }), a.prototype.writeIntLE = function(f, h, x, L) {
-      if (f = +f, h = h >>> 0, !L) {
+    }), a.prototype.writeIntLE = function(f, h, x, D) {
+      if (f = +f, h = h >>> 0, !D) {
         const be = Math.pow(2, 8 * x - 1);
         u(this, f, h, x, be - 1, -be);
       }
@@ -11294,8 +11294,8 @@ function tu() {
       for (this[h] = f & 255; ++$ < x && (Z *= 256); )
         f < 0 && Ae === 0 && this[h + $ - 1] !== 0 && (Ae = 1), this[h + $] = (f / Z >> 0) - Ae & 255;
       return h + x;
-    }, a.prototype.writeIntBE = function(f, h, x, L) {
-      if (f = +f, h = h >>> 0, !L) {
+    }, a.prototype.writeIntBE = function(f, h, x, D) {
+      if (f = +f, h = h >>> 0, !D) {
         const be = Math.pow(2, 8 * x - 1);
         u(this, f, h, x, be - 1, -be);
       }
@@ -11318,48 +11318,48 @@ function tu() {
     }), a.prototype.writeBigInt64BE = en(function(f, h = 0) {
       return E(this, f, h, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
     });
-    function T(b, f, h, x, L, $) {
+    function T(b, f, h, x, D, $) {
       if (h + x > b.length) throw new RangeError("Index out of range");
       if (h < 0) throw new RangeError("Index out of range");
     }
-    function D(b, f, h, x, L) {
-      return f = +f, h = h >>> 0, L || T(b, f, h, 4), n.write(b, f, h, x, 23, 4), h + 4;
+    function P(b, f, h, x, D) {
+      return f = +f, h = h >>> 0, D || T(b, f, h, 4), n.write(b, f, h, x, 23, 4), h + 4;
     }
     a.prototype.writeFloatLE = function(f, h, x) {
-      return D(this, f, h, !0, x);
+      return P(this, f, h, !0, x);
     }, a.prototype.writeFloatBE = function(f, h, x) {
-      return D(this, f, h, !1, x);
+      return P(this, f, h, !1, x);
     };
-    function W(b, f, h, x, L) {
-      return f = +f, h = h >>> 0, L || T(b, f, h, 8), n.write(b, f, h, x, 52, 8), h + 8;
+    function W(b, f, h, x, D) {
+      return f = +f, h = h >>> 0, D || T(b, f, h, 8), n.write(b, f, h, x, 52, 8), h + 8;
     }
     a.prototype.writeDoubleLE = function(f, h, x) {
       return W(this, f, h, !0, x);
     }, a.prototype.writeDoubleBE = function(f, h, x) {
       return W(this, f, h, !1, x);
-    }, a.prototype.copy = function(f, h, x, L) {
+    }, a.prototype.copy = function(f, h, x, D) {
       if (!a.isBuffer(f)) throw new TypeError("argument should be a Buffer");
-      if (x || (x = 0), !L && L !== 0 && (L = this.length), h >= f.length && (h = f.length), h || (h = 0), L > 0 && L < x && (L = x), L === x || f.length === 0 || this.length === 0) return 0;
+      if (x || (x = 0), !D && D !== 0 && (D = this.length), h >= f.length && (h = f.length), h || (h = 0), D > 0 && D < x && (D = x), D === x || f.length === 0 || this.length === 0) return 0;
       if (h < 0)
         throw new RangeError("targetStart out of bounds");
       if (x < 0 || x >= this.length) throw new RangeError("Index out of range");
-      if (L < 0) throw new RangeError("sourceEnd out of bounds");
-      L > this.length && (L = this.length), f.length - h < L - x && (L = f.length - h + x);
-      const $ = L - x;
-      return this === f && typeof Uint8Array.prototype.copyWithin == "function" ? this.copyWithin(h, x, L) : Uint8Array.prototype.set.call(
+      if (D < 0) throw new RangeError("sourceEnd out of bounds");
+      D > this.length && (D = this.length), f.length - h < D - x && (D = f.length - h + x);
+      const $ = D - x;
+      return this === f && typeof Uint8Array.prototype.copyWithin == "function" ? this.copyWithin(h, x, D) : Uint8Array.prototype.set.call(
         f,
-        this.subarray(x, L),
+        this.subarray(x, D),
         h
       ), $;
-    }, a.prototype.fill = function(f, h, x, L) {
+    }, a.prototype.fill = function(f, h, x, D) {
       if (typeof f == "string") {
-        if (typeof h == "string" ? (L = h, h = 0, x = this.length) : typeof x == "string" && (L = x, x = this.length), L !== void 0 && typeof L != "string")
+        if (typeof h == "string" ? (D = h, h = 0, x = this.length) : typeof x == "string" && (D = x, x = this.length), D !== void 0 && typeof D != "string")
           throw new TypeError("encoding must be a string");
-        if (typeof L == "string" && !a.isEncoding(L))
-          throw new TypeError("Unknown encoding: " + L);
+        if (typeof D == "string" && !a.isEncoding(D))
+          throw new TypeError("Unknown encoding: " + D);
         if (f.length === 1) {
           const Z = f.charCodeAt(0);
-          (L === "utf8" && Z < 128 || L === "latin1") && (f = Z);
+          (D === "utf8" && Z < 128 || D === "latin1") && (f = Z);
         }
       } else typeof f == "number" ? f = f & 255 : typeof f == "boolean" && (f = Number(f));
       if (h < 0 || this.length < h || this.length < x)
@@ -11372,7 +11372,7 @@ function tu() {
         for ($ = h; $ < x; ++$)
           this[$] = f;
       else {
-        const Z = a.isBuffer(f) ? f : a.from(f, L), Ae = Z.length;
+        const Z = a.isBuffer(f) ? f : a.from(f, D), Ae = Z.length;
         if (Ae === 0)
           throw new TypeError('The value "' + f + '" is invalid for argument "value"');
         for ($ = 0; $ < x - h; ++$)
@@ -11393,11 +11393,11 @@ function tu() {
         get code() {
           return b;
         }
-        set code(L) {
+        set code(D) {
           Object.defineProperty(this, "code", {
             configurable: !0,
             enumerable: !0,
-            value: L,
+            value: D,
             writable: !0
           });
         }
@@ -11421,8 +11421,8 @@ function tu() {
     ), ae(
       "ERR_OUT_OF_RANGE",
       function(b, f, h) {
-        let x = `The value of "${b}" is out of range.`, L = h;
-        return Number.isInteger(h) && Math.abs(h) > 2 ** 32 ? L = Me(String(h)) : typeof h == "bigint" && (L = String(h), (h > BigInt(2) ** BigInt(32) || h < -(BigInt(2) ** BigInt(32))) && (L = Me(L)), L += "n"), x += ` It must be ${f}. Received ${L}`, x;
+        let x = `The value of "${b}" is out of range.`, D = h;
+        return Number.isInteger(h) && Math.abs(h) > 2 ** 32 ? D = Me(String(h)) : typeof h == "bigint" && (D = String(h), (h > BigInt(2) ** BigInt(32) || h < -(BigInt(2) ** BigInt(32))) && (D = Me(D)), D += "n"), x += ` It must be ${f}. Received ${D}`, x;
       },
       RangeError
     );
@@ -11436,13 +11436,13 @@ function tu() {
     function ve(b, f, h) {
       De(f, "offset"), (b[f] === void 0 || b[f + h] === void 0) && Re(f, b.length - (h + 1));
     }
-    function we(b, f, h, x, L, $) {
+    function we(b, f, h, x, D, $) {
       if (b > h || b < f) {
         const Z = typeof f == "bigint" ? "n" : "";
         let Ae;
         throw f === 0 || f === BigInt(0) ? Ae = `>= 0${Z} and < 2${Z} ** ${($ + 1) * 8}${Z}` : Ae = `>= -(2${Z} ** ${($ + 1) * 8 - 1}${Z}) and < 2 ** ${($ + 1) * 8 - 1}${Z}`, new se.ERR_OUT_OF_RANGE("value", Ae, b);
       }
-      ve(x, L, $);
+      ve(x, D, $);
     }
     function De(b, f) {
       if (typeof b != "number")
@@ -11466,11 +11466,11 @@ function tu() {
       f = f || 1 / 0;
       let h;
       const x = b.length;
-      let L = null;
+      let D = null;
       const $ = [];
       for (let Z = 0; Z < x; ++Z) {
         if (h = b.charCodeAt(Z), h > 55295 && h < 57344) {
-          if (!L) {
+          if (!D) {
             if (h > 56319) {
               (f -= 3) > -1 && $.push(239, 191, 189);
               continue;
@@ -11478,16 +11478,16 @@ function tu() {
               (f -= 3) > -1 && $.push(239, 191, 189);
               continue;
             }
-            L = h;
+            D = h;
             continue;
           }
           if (h < 56320) {
-            (f -= 3) > -1 && $.push(239, 191, 189), L = h;
+            (f -= 3) > -1 && $.push(239, 191, 189), D = h;
             continue;
           }
-          h = (L - 55296 << 10 | h - 56320) + 65536;
-        } else L && (f -= 3) > -1 && $.push(239, 191, 189);
-        if (L = null, h < 128) {
+          h = (D - 55296 << 10 | h - 56320) + 65536;
+        } else D && (f -= 3) > -1 && $.push(239, 191, 189);
+        if (D = null, h < 128) {
           if ((f -= 1) < 0) break;
           $.push(h);
         } else if (h < 2048) {
@@ -11523,20 +11523,20 @@ function tu() {
       return f;
     }
     function yr(b, f) {
-      let h, x, L;
+      let h, x, D;
       const $ = [];
       for (let Z = 0; Z < b.length && !((f -= 2) < 0); ++Z)
-        h = b.charCodeAt(Z), x = h >> 8, L = h % 256, $.push(L), $.push(x);
+        h = b.charCodeAt(Z), x = h >> 8, D = h % 256, $.push(D), $.push(x);
       return $;
     }
     function Fe(b) {
       return e.toByteArray(an(b));
     }
     function Le(b, f, h, x) {
-      let L;
-      for (L = 0; L < x && !(L + h >= f.length || L >= b.length); ++L)
-        f[L + h] = b[L];
-      return L;
+      let D;
+      for (D = 0; D < x && !(D + h >= f.length || D >= b.length); ++D)
+        f[D + h] = b[D];
+      return D;
     }
     function qt(b, f) {
       return b instanceof f || b != null && b.constructor != null && b.constructor.name != null && b.constructor.name === f.name;
@@ -11548,8 +11548,8 @@ function tu() {
       const b = "0123456789abcdef", f = new Array(256);
       for (let h = 0; h < 16; ++h) {
         const x = h * 16;
-        for (let L = 0; L < 16; ++L)
-          f[x + L] = b[h] + b[L];
+        for (let D = 0; D < 16; ++D)
+          f[x + D] = b[h] + b[D];
       }
       return f;
     })();
@@ -11592,7 +11592,7 @@ function l_(t) {
     } catch {
       return { isValid: !1, value: un };
     }
-  }), P = e.adjustScalarBytes || ((v) => v), M = e.domain || ((v, R, O) => {
+  }), F = e.adjustScalarBytes || ((v) => v), M = e.domain || ((v, R, O) => {
     if (zn("phflag", O), R.length || O)
       throw new Error("Contexts/pre-hash are not supported");
     return v;
@@ -11608,17 +11608,17 @@ function l_(t) {
   const Y = Ti((v, R) => {
     const { ex: O, ey: _, ez: u } = v, l = v.is0();
     R == null && (R = l ? c_ : n.inv(u));
-    const E = g(O * R), T = g(_ * R), D = g(u * R);
+    const E = g(O * R), T = g(_ * R), P = g(u * R);
     if (l)
       return { x: un, y: Lt };
-    if (D !== Lt)
+    if (P !== Lt)
       throw new Error("invZ was invalid");
     return { x: E, y: T };
-  }), j = Ti((v) => {
+  }), z = Ti((v) => {
     const { a: R, d: O } = e;
     if (v.is0())
       throw new Error("bad point: ZERO");
-    const { ex: _, ey: u, ez: l, et: E } = v, T = g(_ * _), D = g(u * u), W = g(l * l), se = g(W * W), ae = g(T * R), Me = g(W * g(ae + D)), ve = g(se + g(O * g(T * D)));
+    const { ex: _, ey: u, ez: l, et: E } = v, T = g(_ * _), P = g(u * u), W = g(l * l), se = g(W * W), ae = g(T * R), Me = g(W * g(ae + P)), ve = g(se + g(O * g(T * P)));
     if (Me !== ve)
       throw new Error("bad point: equation left != right (1)");
     const we = g(_ * u), De = g(l * E);
@@ -11657,13 +11657,13 @@ function l_(t) {
     // Not required for fromHex(), which always creates valid points.
     // Could be useful for fromAffine().
     assertValidity() {
-      j(this);
+      z(this);
     }
     // Compare one point to another.
     equals(R) {
       K(R);
-      const { ex: O, ey: _, ez: u } = this, { ex: l, ey: E, ez: T } = R, D = g(O * T), W = g(l * u), se = g(_ * T), ae = g(E * u);
-      return D === W && se === ae;
+      const { ex: O, ey: _, ez: u } = this, { ex: l, ey: E, ez: T } = R, P = g(O * T), W = g(l * u), se = g(_ * T), ae = g(E * u);
+      return P === W && se === ae;
     }
     is0() {
       return this.equals(U.ZERO);
@@ -11675,7 +11675,7 @@ function l_(t) {
     // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#doubling-dbl-2008-hwcd
     // Cost: 4M + 4S + 1*a + 6add + 1*2.
     double() {
-      const { a: R } = e, { ex: O, ey: _, ez: u } = this, l = g(O * O), E = g(_ * _), T = g(Ud * g(u * u)), D = g(R * l), W = O + _, se = g(g(W * W) - l - E), ae = D + E, Me = ae - T, ve = D - E, we = g(se * Me), De = g(ae * ve), Re = g(se * ve), Oe = g(Me * ae);
+      const { a: R } = e, { ex: O, ey: _, ez: u } = this, l = g(O * O), E = g(_ * _), T = g(Ud * g(u * u)), P = g(R * l), W = O + _, se = g(g(W * W) - l - E), ae = P + E, Me = ae - T, ve = P - E, we = g(se * Me), De = g(ae * ve), Re = g(se * ve), Oe = g(Me * ae);
       return new U(we, De, Oe, Re);
     }
     // Fast algo for adding 2 Extended Points.
@@ -11683,7 +11683,7 @@ function l_(t) {
     // Cost: 9M + 1*a + 1*d + 7add.
     add(R) {
       K(R);
-      const { a: O, d: _ } = e, { ex: u, ey: l, ez: E, et: T } = this, { ex: D, ey: W, ez: se, et: ae } = R, Me = g(u * D), ve = g(l * W), we = g(T * _ * ae), De = g(E * se), Re = g((u + l) * (D + W) - Me - ve), Oe = De - we, an = De + we, Ue = g(ve - O * Me), ze = g(Re * Oe), yr = g(an * Ue), Fe = g(Re * Ue), Le = g(Oe * an);
+      const { a: O, d: _ } = e, { ex: u, ey: l, ez: E, et: T } = this, { ex: P, ey: W, ez: se, et: ae } = R, Me = g(u * P), ve = g(l * W), we = g(T * _ * ae), De = g(E * se), Re = g((u + l) * (P + W) - Me - ve), Oe = De - we, an = De + we, Ue = g(ve - O * Me), ze = g(Re * Oe), yr = g(an * Ue), Fe = g(Re * Ue), Le = g(Oe * an);
       return new U(ze, yr, Le, Fe);
     }
     subtract(R) {
@@ -11736,20 +11736,20 @@ function l_(t) {
       R = Xe("pointHex", R, l), zn("zip215", O);
       const E = R.slice(), T = R[l - 1];
       E[l - 1] = T & -129;
-      const D = os(E), W = O ? m : n.ORDER;
-      tn("pointHex.y", D, un, W);
-      const se = g(D * D), ae = g(se - Lt), Me = g(_ * se - u);
+      const P = os(E), W = O ? m : n.ORDER;
+      tn("pointHex.y", P, un, W);
+      const se = g(P * P), ae = g(se - Lt), Me = g(_ * se - u);
       let { isValid: ve, value: we } = N(ae, Me);
       if (!ve)
         throw new Error("Point.fromHex: invalid y coordinate");
       const De = (we & Lt) === Lt, Re = (T & 128) !== 0;
       if (!O && we === un && Re)
         throw new Error("Point.fromHex: x=0 and x_0=1");
-      return Re !== De && (we = g(-we)), U.fromAffine({ x: we, y: D });
+      return Re !== De && (we = g(-we)), U.fromAffine({ x: we, y: P });
     }
     static fromPrivateKey(R) {
       const { scalar: O } = C(R);
-      return V.multiply(O);
+      return j.multiply(O);
     }
     toRawBytes() {
       const { x: R, y: O } = this.toAffine(), _ = xi(O, n.BYTES);
@@ -11760,33 +11760,33 @@ function l_(t) {
     }
   }
   U.BASE = new U(e.Gx, e.Gy, Lt, g(e.Gx * e.Gy)), U.ZERO = new U(un, Lt, Lt, un);
-  const { BASE: V, ZERO: J } = U, ne = Jf(U, a * 8);
+  const { BASE: j, ZERO: J } = U, ne = Jf(U, a * 8);
   function te(v) {
     return He(v, r);
   }
-  function z(v) {
+  function V(v) {
     return te(os(v));
   }
   function C(v) {
     const R = n.BYTES;
     v = Xe("private key", v, R);
-    const O = Xe("hashed private key", i(v), 2 * R), _ = P(O.slice(0, R)), u = O.slice(R, 2 * R), l = z(_);
+    const O = Xe("hashed private key", i(v), 2 * R), _ = F(O.slice(0, R)), u = O.slice(R, 2 * R), l = V(_);
     return { head: _, prefix: u, scalar: l };
   }
-  function F(v) {
-    const { head: R, prefix: O, scalar: _ } = C(v), u = V.multiply(_), l = u.toRawBytes();
+  function L(v) {
+    const { head: R, prefix: O, scalar: _ } = C(v), u = j.multiply(_), l = u.toRawBytes();
     return { head: R, prefix: O, scalar: _, point: u, pointBytes: l };
   }
-  function q(v) {
-    return F(v).pointBytes;
+  function G(v) {
+    return L(v).pointBytes;
   }
   function w(v = Uint8Array.of(), ...R) {
     const O = $r(...R);
-    return z(i(M(O, Xe("context", v), !!s)));
+    return V(i(M(O, Xe("context", v), !!s)));
   }
   function c(v, R, O = {}) {
     v = Xe("message", v), s && (v = s(v));
-    const { prefix: _, scalar: u, pointBytes: l } = F(R), E = w(O.context, _, v), T = V.multiply(E).toRawBytes(), D = w(O.context, T, l, v), W = te(E + D * u);
+    const { prefix: _, scalar: u, pointBytes: l } = L(R), E = w(O.context, _, v), T = j.multiply(E).toRawBytes(), P = w(O.context, T, l, v), W = te(E + P * u);
     tn("signature.s", W, un, r);
     const se = $r(T, xi(W, n.BYTES));
     return Xe("result", se, n.BYTES * 2);
@@ -11796,25 +11796,25 @@ function l_(t) {
     const { context: u, zip215: l } = _, E = n.BYTES;
     v = Xe("signature", v, 2 * E), R = Xe("message", R), O = Xe("publicKey", O, E), l !== void 0 && zn("zip215", l), s && (R = s(R));
     const T = os(v.slice(E, 2 * E));
-    let D, W, se;
+    let P, W, se;
     try {
-      D = U.fromHex(O, l), W = U.fromHex(v.slice(0, E), l), se = V.multiplyUnsafe(T);
+      P = U.fromHex(O, l), W = U.fromHex(v.slice(0, E), l), se = j.multiplyUnsafe(T);
     } catch {
       return !1;
     }
-    if (!l && D.isSmallOrder())
+    if (!l && P.isSmallOrder())
       return !1;
-    const ae = w(u, W.toRawBytes(), D.toRawBytes(), R);
-    return W.add(D.multiplyUnsafe(ae)).subtract(se).clearCofactor().equals(U.ZERO);
+    const ae = w(u, W.toRawBytes(), P.toRawBytes(), R);
+    return W.add(P.multiplyUnsafe(ae)).subtract(se).clearCofactor().equals(U.ZERO);
   }
-  return V._setWindowSize(8), {
+  return j._setWindowSize(8), {
     CURVE: e,
-    getPublicKey: q,
+    getPublicKey: G,
     sign: c,
     verify: y,
     ExtendedPoint: U,
     utils: {
-      getExtendedPublicKey: F,
+      getExtendedPublicKey: L,
       /** ed25519 priv keys are uniform 32b. No need to check for modulo bias, like in secp256k1. */
       randomPrivateKey: () => o(n.BYTES),
       /**
@@ -11836,7 +11836,7 @@ const f_ = BigInt(1), Dd = BigInt(2);
 BigInt(3);
 const h_ = BigInt(5), p_ = BigInt(8);
 function m_(t) {
-  const e = BigInt(10), n = BigInt(20), r = BigInt(40), s = BigInt(80), i = nu, a = t * t % i * t % i, d = Ze(a, Dd, i) * a % i, m = Ze(d, f_, i) * t % i, g = Ze(m, h_, i) * m % i, S = Ze(g, e, i) * g % i, I = Ze(S, n, i) * S % i, N = Ze(I, r, i) * I % i, P = Ze(N, s, i) * N % i, M = Ze(P, s, i) * N % i, k = Ze(M, e, i) * g % i;
+  const e = BigInt(10), n = BigInt(20), r = BigInt(40), s = BigInt(80), i = nu, a = t * t % i * t % i, d = Ze(a, Dd, i) * a % i, m = Ze(d, f_, i) * t % i, g = Ze(m, h_, i) * m % i, S = Ze(g, e, i) * g % i, I = Ze(S, n, i) * S % i, N = Ze(I, r, i) * I % i, F = Ze(N, s, i) * N % i, M = Ze(F, s, i) * N % i, k = Ze(M, e, i) * g % i;
   return { pow_p_5_8: Ze(k, Dd, i) * t % i, b2: a };
 }
 function g_(t) {
@@ -12085,7 +12085,7 @@ function _h() {
         5,
         5,
         5
-      ], P = [
+      ], F = [
         0,
         0,
         33554432,
@@ -12138,7 +12138,7 @@ function _h() {
           return this.negative !== 0 && (y = "-" + y), y;
         }
         if (c === (c | 0) && c >= 2 && c <= 36) {
-          var u = N[c], l = P[c];
+          var u = N[c], l = F[c];
           y = "";
           var E = this.clone();
           for (E.negative = 0; !E.isZero(); ) {
@@ -12327,35 +12327,35 @@ function _h() {
         var A = w.words[0] | 0, v = c.words[0] | 0, R = A * v, O = R & 67108863, _ = R / 67108864 | 0;
         p.words[0] = O;
         for (var u = 1; u < y; u++) {
-          for (var l = _ >>> 26, E = _ & 67108863, T = Math.min(u, c.length - 1), D = Math.max(0, u - w.length + 1); D <= T; D++) {
-            var W = u - D | 0;
-            A = w.words[W] | 0, v = c.words[D] | 0, R = A * v + E, l += R / 67108864 | 0, E = R & 67108863;
+          for (var l = _ >>> 26, E = _ & 67108863, T = Math.min(u, c.length - 1), P = Math.max(0, u - w.length + 1); P <= T; P++) {
+            var W = u - P | 0;
+            A = w.words[W] | 0, v = c.words[P] | 0, R = A * v + E, l += R / 67108864 | 0, E = R & 67108863;
           }
           p.words[u] = E | 0, _ = l | 0;
         }
         return _ !== 0 ? p.words[u] = _ | 0 : p.length--, p._strip();
       }
       var Y = function(c, p, y) {
-        var A = c.words, v = p.words, R = y.words, O = 0, _, u, l, E = A[0] | 0, T = E & 8191, D = E >>> 13, W = A[1] | 0, se = W & 8191, ae = W >>> 13, Me = A[2] | 0, ve = Me & 8191, we = Me >>> 13, De = A[3] | 0, Re = De & 8191, Oe = De >>> 13, an = A[4] | 0, Ue = an & 8191, ze = an >>> 13, yr = A[5] | 0, Fe = yr & 8191, Le = yr >>> 13, qt = A[6] | 0, je = qt & 8191, qe = qt >>> 13, en = A[7] | 0, Ke = en & 8191, b = en >>> 13, f = A[8] | 0, h = f & 8191, x = f >>> 13, L = A[9] | 0, $ = L & 8191, Z = L >>> 13, Ae = v[0] | 0, be = Ae & 8191, ge = Ae >>> 13, $e = v[1] | 0, pe = $e & 8191, Qe = $e >>> 13, Tu = v[2] | 0, et = Tu & 8191, tt = Tu >>> 13, Iu = v[3] | 0, nt = Iu & 8191, rt = Iu >>> 13, Ou = v[4] | 0, st = Ou & 8191, it = Ou >>> 13, Nu = v[5] | 0, ot = Nu & 8191, at = Nu >>> 13, Cu = v[6] | 0, ct = Cu & 8191, ut = Cu >>> 13, Mu = v[7] | 0, dt = Mu & 8191, lt = Mu >>> 13, Bu = v[8] | 0, ft = Bu & 8191, ht = Bu >>> 13, ku = v[9] | 0, pt = ku & 8191, mt = ku >>> 13;
-        y.negative = c.negative ^ p.negative, y.length = 19, _ = Math.imul(T, be), u = Math.imul(T, ge), u = u + Math.imul(D, be) | 0, l = Math.imul(D, ge);
+        var A = c.words, v = p.words, R = y.words, O = 0, _, u, l, E = A[0] | 0, T = E & 8191, P = E >>> 13, W = A[1] | 0, se = W & 8191, ae = W >>> 13, Me = A[2] | 0, ve = Me & 8191, we = Me >>> 13, De = A[3] | 0, Re = De & 8191, Oe = De >>> 13, an = A[4] | 0, Ue = an & 8191, ze = an >>> 13, yr = A[5] | 0, Fe = yr & 8191, Le = yr >>> 13, qt = A[6] | 0, je = qt & 8191, qe = qt >>> 13, en = A[7] | 0, Ke = en & 8191, b = en >>> 13, f = A[8] | 0, h = f & 8191, x = f >>> 13, D = A[9] | 0, $ = D & 8191, Z = D >>> 13, Ae = v[0] | 0, be = Ae & 8191, ge = Ae >>> 13, $e = v[1] | 0, pe = $e & 8191, Qe = $e >>> 13, Tu = v[2] | 0, et = Tu & 8191, tt = Tu >>> 13, Iu = v[3] | 0, nt = Iu & 8191, rt = Iu >>> 13, Ou = v[4] | 0, st = Ou & 8191, it = Ou >>> 13, Nu = v[5] | 0, ot = Nu & 8191, at = Nu >>> 13, Cu = v[6] | 0, ct = Cu & 8191, ut = Cu >>> 13, Mu = v[7] | 0, dt = Mu & 8191, lt = Mu >>> 13, Bu = v[8] | 0, ft = Bu & 8191, ht = Bu >>> 13, ku = v[9] | 0, pt = ku & 8191, mt = ku >>> 13;
+        y.negative = c.negative ^ p.negative, y.length = 19, _ = Math.imul(T, be), u = Math.imul(T, ge), u = u + Math.imul(P, be) | 0, l = Math.imul(P, ge);
         var Ao = (O + _ | 0) + ((u & 8191) << 13) | 0;
-        O = (l + (u >>> 13) | 0) + (Ao >>> 26) | 0, Ao &= 67108863, _ = Math.imul(se, be), u = Math.imul(se, ge), u = u + Math.imul(ae, be) | 0, l = Math.imul(ae, ge), _ = _ + Math.imul(T, pe) | 0, u = u + Math.imul(T, Qe) | 0, u = u + Math.imul(D, pe) | 0, l = l + Math.imul(D, Qe) | 0;
+        O = (l + (u >>> 13) | 0) + (Ao >>> 26) | 0, Ao &= 67108863, _ = Math.imul(se, be), u = Math.imul(se, ge), u = u + Math.imul(ae, be) | 0, l = Math.imul(ae, ge), _ = _ + Math.imul(T, pe) | 0, u = u + Math.imul(T, Qe) | 0, u = u + Math.imul(P, pe) | 0, l = l + Math.imul(P, Qe) | 0;
         var So = (O + _ | 0) + ((u & 8191) << 13) | 0;
-        O = (l + (u >>> 13) | 0) + (So >>> 26) | 0, So &= 67108863, _ = Math.imul(ve, be), u = Math.imul(ve, ge), u = u + Math.imul(we, be) | 0, l = Math.imul(we, ge), _ = _ + Math.imul(se, pe) | 0, u = u + Math.imul(se, Qe) | 0, u = u + Math.imul(ae, pe) | 0, l = l + Math.imul(ae, Qe) | 0, _ = _ + Math.imul(T, et) | 0, u = u + Math.imul(T, tt) | 0, u = u + Math.imul(D, et) | 0, l = l + Math.imul(D, tt) | 0;
+        O = (l + (u >>> 13) | 0) + (So >>> 26) | 0, So &= 67108863, _ = Math.imul(ve, be), u = Math.imul(ve, ge), u = u + Math.imul(we, be) | 0, l = Math.imul(we, ge), _ = _ + Math.imul(se, pe) | 0, u = u + Math.imul(se, Qe) | 0, u = u + Math.imul(ae, pe) | 0, l = l + Math.imul(ae, Qe) | 0, _ = _ + Math.imul(T, et) | 0, u = u + Math.imul(T, tt) | 0, u = u + Math.imul(P, et) | 0, l = l + Math.imul(P, tt) | 0;
         var xo = (O + _ | 0) + ((u & 8191) << 13) | 0;
-        O = (l + (u >>> 13) | 0) + (xo >>> 26) | 0, xo &= 67108863, _ = Math.imul(Re, be), u = Math.imul(Re, ge), u = u + Math.imul(Oe, be) | 0, l = Math.imul(Oe, ge), _ = _ + Math.imul(ve, pe) | 0, u = u + Math.imul(ve, Qe) | 0, u = u + Math.imul(we, pe) | 0, l = l + Math.imul(we, Qe) | 0, _ = _ + Math.imul(se, et) | 0, u = u + Math.imul(se, tt) | 0, u = u + Math.imul(ae, et) | 0, l = l + Math.imul(ae, tt) | 0, _ = _ + Math.imul(T, nt) | 0, u = u + Math.imul(T, rt) | 0, u = u + Math.imul(D, nt) | 0, l = l + Math.imul(D, rt) | 0;
+        O = (l + (u >>> 13) | 0) + (xo >>> 26) | 0, xo &= 67108863, _ = Math.imul(Re, be), u = Math.imul(Re, ge), u = u + Math.imul(Oe, be) | 0, l = Math.imul(Oe, ge), _ = _ + Math.imul(ve, pe) | 0, u = u + Math.imul(ve, Qe) | 0, u = u + Math.imul(we, pe) | 0, l = l + Math.imul(we, Qe) | 0, _ = _ + Math.imul(se, et) | 0, u = u + Math.imul(se, tt) | 0, u = u + Math.imul(ae, et) | 0, l = l + Math.imul(ae, tt) | 0, _ = _ + Math.imul(T, nt) | 0, u = u + Math.imul(T, rt) | 0, u = u + Math.imul(P, nt) | 0, l = l + Math.imul(P, rt) | 0;
         var To = (O + _ | 0) + ((u & 8191) << 13) | 0;
-        O = (l + (u >>> 13) | 0) + (To >>> 26) | 0, To &= 67108863, _ = Math.imul(Ue, be), u = Math.imul(Ue, ge), u = u + Math.imul(ze, be) | 0, l = Math.imul(ze, ge), _ = _ + Math.imul(Re, pe) | 0, u = u + Math.imul(Re, Qe) | 0, u = u + Math.imul(Oe, pe) | 0, l = l + Math.imul(Oe, Qe) | 0, _ = _ + Math.imul(ve, et) | 0, u = u + Math.imul(ve, tt) | 0, u = u + Math.imul(we, et) | 0, l = l + Math.imul(we, tt) | 0, _ = _ + Math.imul(se, nt) | 0, u = u + Math.imul(se, rt) | 0, u = u + Math.imul(ae, nt) | 0, l = l + Math.imul(ae, rt) | 0, _ = _ + Math.imul(T, st) | 0, u = u + Math.imul(T, it) | 0, u = u + Math.imul(D, st) | 0, l = l + Math.imul(D, it) | 0;
+        O = (l + (u >>> 13) | 0) + (To >>> 26) | 0, To &= 67108863, _ = Math.imul(Ue, be), u = Math.imul(Ue, ge), u = u + Math.imul(ze, be) | 0, l = Math.imul(ze, ge), _ = _ + Math.imul(Re, pe) | 0, u = u + Math.imul(Re, Qe) | 0, u = u + Math.imul(Oe, pe) | 0, l = l + Math.imul(Oe, Qe) | 0, _ = _ + Math.imul(ve, et) | 0, u = u + Math.imul(ve, tt) | 0, u = u + Math.imul(we, et) | 0, l = l + Math.imul(we, tt) | 0, _ = _ + Math.imul(se, nt) | 0, u = u + Math.imul(se, rt) | 0, u = u + Math.imul(ae, nt) | 0, l = l + Math.imul(ae, rt) | 0, _ = _ + Math.imul(T, st) | 0, u = u + Math.imul(T, it) | 0, u = u + Math.imul(P, st) | 0, l = l + Math.imul(P, it) | 0;
         var Io = (O + _ | 0) + ((u & 8191) << 13) | 0;
-        O = (l + (u >>> 13) | 0) + (Io >>> 26) | 0, Io &= 67108863, _ = Math.imul(Fe, be), u = Math.imul(Fe, ge), u = u + Math.imul(Le, be) | 0, l = Math.imul(Le, ge), _ = _ + Math.imul(Ue, pe) | 0, u = u + Math.imul(Ue, Qe) | 0, u = u + Math.imul(ze, pe) | 0, l = l + Math.imul(ze, Qe) | 0, _ = _ + Math.imul(Re, et) | 0, u = u + Math.imul(Re, tt) | 0, u = u + Math.imul(Oe, et) | 0, l = l + Math.imul(Oe, tt) | 0, _ = _ + Math.imul(ve, nt) | 0, u = u + Math.imul(ve, rt) | 0, u = u + Math.imul(we, nt) | 0, l = l + Math.imul(we, rt) | 0, _ = _ + Math.imul(se, st) | 0, u = u + Math.imul(se, it) | 0, u = u + Math.imul(ae, st) | 0, l = l + Math.imul(ae, it) | 0, _ = _ + Math.imul(T, ot) | 0, u = u + Math.imul(T, at) | 0, u = u + Math.imul(D, ot) | 0, l = l + Math.imul(D, at) | 0;
+        O = (l + (u >>> 13) | 0) + (Io >>> 26) | 0, Io &= 67108863, _ = Math.imul(Fe, be), u = Math.imul(Fe, ge), u = u + Math.imul(Le, be) | 0, l = Math.imul(Le, ge), _ = _ + Math.imul(Ue, pe) | 0, u = u + Math.imul(Ue, Qe) | 0, u = u + Math.imul(ze, pe) | 0, l = l + Math.imul(ze, Qe) | 0, _ = _ + Math.imul(Re, et) | 0, u = u + Math.imul(Re, tt) | 0, u = u + Math.imul(Oe, et) | 0, l = l + Math.imul(Oe, tt) | 0, _ = _ + Math.imul(ve, nt) | 0, u = u + Math.imul(ve, rt) | 0, u = u + Math.imul(we, nt) | 0, l = l + Math.imul(we, rt) | 0, _ = _ + Math.imul(se, st) | 0, u = u + Math.imul(se, it) | 0, u = u + Math.imul(ae, st) | 0, l = l + Math.imul(ae, it) | 0, _ = _ + Math.imul(T, ot) | 0, u = u + Math.imul(T, at) | 0, u = u + Math.imul(P, ot) | 0, l = l + Math.imul(P, at) | 0;
         var Oo = (O + _ | 0) + ((u & 8191) << 13) | 0;
-        O = (l + (u >>> 13) | 0) + (Oo >>> 26) | 0, Oo &= 67108863, _ = Math.imul(je, be), u = Math.imul(je, ge), u = u + Math.imul(qe, be) | 0, l = Math.imul(qe, ge), _ = _ + Math.imul(Fe, pe) | 0, u = u + Math.imul(Fe, Qe) | 0, u = u + Math.imul(Le, pe) | 0, l = l + Math.imul(Le, Qe) | 0, _ = _ + Math.imul(Ue, et) | 0, u = u + Math.imul(Ue, tt) | 0, u = u + Math.imul(ze, et) | 0, l = l + Math.imul(ze, tt) | 0, _ = _ + Math.imul(Re, nt) | 0, u = u + Math.imul(Re, rt) | 0, u = u + Math.imul(Oe, nt) | 0, l = l + Math.imul(Oe, rt) | 0, _ = _ + Math.imul(ve, st) | 0, u = u + Math.imul(ve, it) | 0, u = u + Math.imul(we, st) | 0, l = l + Math.imul(we, it) | 0, _ = _ + Math.imul(se, ot) | 0, u = u + Math.imul(se, at) | 0, u = u + Math.imul(ae, ot) | 0, l = l + Math.imul(ae, at) | 0, _ = _ + Math.imul(T, ct) | 0, u = u + Math.imul(T, ut) | 0, u = u + Math.imul(D, ct) | 0, l = l + Math.imul(D, ut) | 0;
+        O = (l + (u >>> 13) | 0) + (Oo >>> 26) | 0, Oo &= 67108863, _ = Math.imul(je, be), u = Math.imul(je, ge), u = u + Math.imul(qe, be) | 0, l = Math.imul(qe, ge), _ = _ + Math.imul(Fe, pe) | 0, u = u + Math.imul(Fe, Qe) | 0, u = u + Math.imul(Le, pe) | 0, l = l + Math.imul(Le, Qe) | 0, _ = _ + Math.imul(Ue, et) | 0, u = u + Math.imul(Ue, tt) | 0, u = u + Math.imul(ze, et) | 0, l = l + Math.imul(ze, tt) | 0, _ = _ + Math.imul(Re, nt) | 0, u = u + Math.imul(Re, rt) | 0, u = u + Math.imul(Oe, nt) | 0, l = l + Math.imul(Oe, rt) | 0, _ = _ + Math.imul(ve, st) | 0, u = u + Math.imul(ve, it) | 0, u = u + Math.imul(we, st) | 0, l = l + Math.imul(we, it) | 0, _ = _ + Math.imul(se, ot) | 0, u = u + Math.imul(se, at) | 0, u = u + Math.imul(ae, ot) | 0, l = l + Math.imul(ae, at) | 0, _ = _ + Math.imul(T, ct) | 0, u = u + Math.imul(T, ut) | 0, u = u + Math.imul(P, ct) | 0, l = l + Math.imul(P, ut) | 0;
         var No = (O + _ | 0) + ((u & 8191) << 13) | 0;
-        O = (l + (u >>> 13) | 0) + (No >>> 26) | 0, No &= 67108863, _ = Math.imul(Ke, be), u = Math.imul(Ke, ge), u = u + Math.imul(b, be) | 0, l = Math.imul(b, ge), _ = _ + Math.imul(je, pe) | 0, u = u + Math.imul(je, Qe) | 0, u = u + Math.imul(qe, pe) | 0, l = l + Math.imul(qe, Qe) | 0, _ = _ + Math.imul(Fe, et) | 0, u = u + Math.imul(Fe, tt) | 0, u = u + Math.imul(Le, et) | 0, l = l + Math.imul(Le, tt) | 0, _ = _ + Math.imul(Ue, nt) | 0, u = u + Math.imul(Ue, rt) | 0, u = u + Math.imul(ze, nt) | 0, l = l + Math.imul(ze, rt) | 0, _ = _ + Math.imul(Re, st) | 0, u = u + Math.imul(Re, it) | 0, u = u + Math.imul(Oe, st) | 0, l = l + Math.imul(Oe, it) | 0, _ = _ + Math.imul(ve, ot) | 0, u = u + Math.imul(ve, at) | 0, u = u + Math.imul(we, ot) | 0, l = l + Math.imul(we, at) | 0, _ = _ + Math.imul(se, ct) | 0, u = u + Math.imul(se, ut) | 0, u = u + Math.imul(ae, ct) | 0, l = l + Math.imul(ae, ut) | 0, _ = _ + Math.imul(T, dt) | 0, u = u + Math.imul(T, lt) | 0, u = u + Math.imul(D, dt) | 0, l = l + Math.imul(D, lt) | 0;
+        O = (l + (u >>> 13) | 0) + (No >>> 26) | 0, No &= 67108863, _ = Math.imul(Ke, be), u = Math.imul(Ke, ge), u = u + Math.imul(b, be) | 0, l = Math.imul(b, ge), _ = _ + Math.imul(je, pe) | 0, u = u + Math.imul(je, Qe) | 0, u = u + Math.imul(qe, pe) | 0, l = l + Math.imul(qe, Qe) | 0, _ = _ + Math.imul(Fe, et) | 0, u = u + Math.imul(Fe, tt) | 0, u = u + Math.imul(Le, et) | 0, l = l + Math.imul(Le, tt) | 0, _ = _ + Math.imul(Ue, nt) | 0, u = u + Math.imul(Ue, rt) | 0, u = u + Math.imul(ze, nt) | 0, l = l + Math.imul(ze, rt) | 0, _ = _ + Math.imul(Re, st) | 0, u = u + Math.imul(Re, it) | 0, u = u + Math.imul(Oe, st) | 0, l = l + Math.imul(Oe, it) | 0, _ = _ + Math.imul(ve, ot) | 0, u = u + Math.imul(ve, at) | 0, u = u + Math.imul(we, ot) | 0, l = l + Math.imul(we, at) | 0, _ = _ + Math.imul(se, ct) | 0, u = u + Math.imul(se, ut) | 0, u = u + Math.imul(ae, ct) | 0, l = l + Math.imul(ae, ut) | 0, _ = _ + Math.imul(T, dt) | 0, u = u + Math.imul(T, lt) | 0, u = u + Math.imul(P, dt) | 0, l = l + Math.imul(P, lt) | 0;
         var Co = (O + _ | 0) + ((u & 8191) << 13) | 0;
-        O = (l + (u >>> 13) | 0) + (Co >>> 26) | 0, Co &= 67108863, _ = Math.imul(h, be), u = Math.imul(h, ge), u = u + Math.imul(x, be) | 0, l = Math.imul(x, ge), _ = _ + Math.imul(Ke, pe) | 0, u = u + Math.imul(Ke, Qe) | 0, u = u + Math.imul(b, pe) | 0, l = l + Math.imul(b, Qe) | 0, _ = _ + Math.imul(je, et) | 0, u = u + Math.imul(je, tt) | 0, u = u + Math.imul(qe, et) | 0, l = l + Math.imul(qe, tt) | 0, _ = _ + Math.imul(Fe, nt) | 0, u = u + Math.imul(Fe, rt) | 0, u = u + Math.imul(Le, nt) | 0, l = l + Math.imul(Le, rt) | 0, _ = _ + Math.imul(Ue, st) | 0, u = u + Math.imul(Ue, it) | 0, u = u + Math.imul(ze, st) | 0, l = l + Math.imul(ze, it) | 0, _ = _ + Math.imul(Re, ot) | 0, u = u + Math.imul(Re, at) | 0, u = u + Math.imul(Oe, ot) | 0, l = l + Math.imul(Oe, at) | 0, _ = _ + Math.imul(ve, ct) | 0, u = u + Math.imul(ve, ut) | 0, u = u + Math.imul(we, ct) | 0, l = l + Math.imul(we, ut) | 0, _ = _ + Math.imul(se, dt) | 0, u = u + Math.imul(se, lt) | 0, u = u + Math.imul(ae, dt) | 0, l = l + Math.imul(ae, lt) | 0, _ = _ + Math.imul(T, ft) | 0, u = u + Math.imul(T, ht) | 0, u = u + Math.imul(D, ft) | 0, l = l + Math.imul(D, ht) | 0;
+        O = (l + (u >>> 13) | 0) + (Co >>> 26) | 0, Co &= 67108863, _ = Math.imul(h, be), u = Math.imul(h, ge), u = u + Math.imul(x, be) | 0, l = Math.imul(x, ge), _ = _ + Math.imul(Ke, pe) | 0, u = u + Math.imul(Ke, Qe) | 0, u = u + Math.imul(b, pe) | 0, l = l + Math.imul(b, Qe) | 0, _ = _ + Math.imul(je, et) | 0, u = u + Math.imul(je, tt) | 0, u = u + Math.imul(qe, et) | 0, l = l + Math.imul(qe, tt) | 0, _ = _ + Math.imul(Fe, nt) | 0, u = u + Math.imul(Fe, rt) | 0, u = u + Math.imul(Le, nt) | 0, l = l + Math.imul(Le, rt) | 0, _ = _ + Math.imul(Ue, st) | 0, u = u + Math.imul(Ue, it) | 0, u = u + Math.imul(ze, st) | 0, l = l + Math.imul(ze, it) | 0, _ = _ + Math.imul(Re, ot) | 0, u = u + Math.imul(Re, at) | 0, u = u + Math.imul(Oe, ot) | 0, l = l + Math.imul(Oe, at) | 0, _ = _ + Math.imul(ve, ct) | 0, u = u + Math.imul(ve, ut) | 0, u = u + Math.imul(we, ct) | 0, l = l + Math.imul(we, ut) | 0, _ = _ + Math.imul(se, dt) | 0, u = u + Math.imul(se, lt) | 0, u = u + Math.imul(ae, dt) | 0, l = l + Math.imul(ae, lt) | 0, _ = _ + Math.imul(T, ft) | 0, u = u + Math.imul(T, ht) | 0, u = u + Math.imul(P, ft) | 0, l = l + Math.imul(P, ht) | 0;
         var Mo = (O + _ | 0) + ((u & 8191) << 13) | 0;
-        O = (l + (u >>> 13) | 0) + (Mo >>> 26) | 0, Mo &= 67108863, _ = Math.imul($, be), u = Math.imul($, ge), u = u + Math.imul(Z, be) | 0, l = Math.imul(Z, ge), _ = _ + Math.imul(h, pe) | 0, u = u + Math.imul(h, Qe) | 0, u = u + Math.imul(x, pe) | 0, l = l + Math.imul(x, Qe) | 0, _ = _ + Math.imul(Ke, et) | 0, u = u + Math.imul(Ke, tt) | 0, u = u + Math.imul(b, et) | 0, l = l + Math.imul(b, tt) | 0, _ = _ + Math.imul(je, nt) | 0, u = u + Math.imul(je, rt) | 0, u = u + Math.imul(qe, nt) | 0, l = l + Math.imul(qe, rt) | 0, _ = _ + Math.imul(Fe, st) | 0, u = u + Math.imul(Fe, it) | 0, u = u + Math.imul(Le, st) | 0, l = l + Math.imul(Le, it) | 0, _ = _ + Math.imul(Ue, ot) | 0, u = u + Math.imul(Ue, at) | 0, u = u + Math.imul(ze, ot) | 0, l = l + Math.imul(ze, at) | 0, _ = _ + Math.imul(Re, ct) | 0, u = u + Math.imul(Re, ut) | 0, u = u + Math.imul(Oe, ct) | 0, l = l + Math.imul(Oe, ut) | 0, _ = _ + Math.imul(ve, dt) | 0, u = u + Math.imul(ve, lt) | 0, u = u + Math.imul(we, dt) | 0, l = l + Math.imul(we, lt) | 0, _ = _ + Math.imul(se, ft) | 0, u = u + Math.imul(se, ht) | 0, u = u + Math.imul(ae, ft) | 0, l = l + Math.imul(ae, ht) | 0, _ = _ + Math.imul(T, pt) | 0, u = u + Math.imul(T, mt) | 0, u = u + Math.imul(D, pt) | 0, l = l + Math.imul(D, mt) | 0;
+        O = (l + (u >>> 13) | 0) + (Mo >>> 26) | 0, Mo &= 67108863, _ = Math.imul($, be), u = Math.imul($, ge), u = u + Math.imul(Z, be) | 0, l = Math.imul(Z, ge), _ = _ + Math.imul(h, pe) | 0, u = u + Math.imul(h, Qe) | 0, u = u + Math.imul(x, pe) | 0, l = l + Math.imul(x, Qe) | 0, _ = _ + Math.imul(Ke, et) | 0, u = u + Math.imul(Ke, tt) | 0, u = u + Math.imul(b, et) | 0, l = l + Math.imul(b, tt) | 0, _ = _ + Math.imul(je, nt) | 0, u = u + Math.imul(je, rt) | 0, u = u + Math.imul(qe, nt) | 0, l = l + Math.imul(qe, rt) | 0, _ = _ + Math.imul(Fe, st) | 0, u = u + Math.imul(Fe, it) | 0, u = u + Math.imul(Le, st) | 0, l = l + Math.imul(Le, it) | 0, _ = _ + Math.imul(Ue, ot) | 0, u = u + Math.imul(Ue, at) | 0, u = u + Math.imul(ze, ot) | 0, l = l + Math.imul(ze, at) | 0, _ = _ + Math.imul(Re, ct) | 0, u = u + Math.imul(Re, ut) | 0, u = u + Math.imul(Oe, ct) | 0, l = l + Math.imul(Oe, ut) | 0, _ = _ + Math.imul(ve, dt) | 0, u = u + Math.imul(ve, lt) | 0, u = u + Math.imul(we, dt) | 0, l = l + Math.imul(we, lt) | 0, _ = _ + Math.imul(se, ft) | 0, u = u + Math.imul(se, ht) | 0, u = u + Math.imul(ae, ft) | 0, l = l + Math.imul(ae, ht) | 0, _ = _ + Math.imul(T, pt) | 0, u = u + Math.imul(T, mt) | 0, u = u + Math.imul(P, pt) | 0, l = l + Math.imul(P, mt) | 0;
         var Bo = (O + _ | 0) + ((u & 8191) << 13) | 0;
         O = (l + (u >>> 13) | 0) + (Bo >>> 26) | 0, Bo &= 67108863, _ = Math.imul($, pe), u = Math.imul($, Qe), u = u + Math.imul(Z, pe) | 0, l = Math.imul(Z, Qe), _ = _ + Math.imul(h, et) | 0, u = u + Math.imul(h, tt) | 0, u = u + Math.imul(x, et) | 0, l = l + Math.imul(x, tt) | 0, _ = _ + Math.imul(Ke, nt) | 0, u = u + Math.imul(Ke, rt) | 0, u = u + Math.imul(b, nt) | 0, l = l + Math.imul(b, rt) | 0, _ = _ + Math.imul(je, st) | 0, u = u + Math.imul(je, it) | 0, u = u + Math.imul(qe, st) | 0, l = l + Math.imul(qe, it) | 0, _ = _ + Math.imul(Fe, ot) | 0, u = u + Math.imul(Fe, at) | 0, u = u + Math.imul(Le, ot) | 0, l = l + Math.imul(Le, at) | 0, _ = _ + Math.imul(Ue, ct) | 0, u = u + Math.imul(Ue, ut) | 0, u = u + Math.imul(ze, ct) | 0, l = l + Math.imul(ze, ut) | 0, _ = _ + Math.imul(Re, dt) | 0, u = u + Math.imul(Re, lt) | 0, u = u + Math.imul(Oe, dt) | 0, l = l + Math.imul(Oe, lt) | 0, _ = _ + Math.imul(ve, ft) | 0, u = u + Math.imul(ve, ht) | 0, u = u + Math.imul(we, ft) | 0, l = l + Math.imul(we, ht) | 0, _ = _ + Math.imul(se, pt) | 0, u = u + Math.imul(se, mt) | 0, u = u + Math.imul(ae, pt) | 0, l = l + Math.imul(ae, mt) | 0;
         var ko = (O + _ | 0) + ((u & 8191) << 13) | 0;
@@ -12378,25 +12378,25 @@ function _h() {
         return O = (l + (u >>> 13) | 0) + (jo >>> 26) | 0, jo &= 67108863, R[0] = Ao, R[1] = So, R[2] = xo, R[3] = To, R[4] = Io, R[5] = Oo, R[6] = No, R[7] = Co, R[8] = Mo, R[9] = Bo, R[10] = ko, R[11] = Uo, R[12] = Lo, R[13] = Do, R[14] = Po, R[15] = Fo, R[16] = $o, R[17] = zo, R[18] = jo, O !== 0 && (R[19] = O, y.length++), y;
       };
       Math.imul || (Y = K);
-      function j(w, c, p) {
+      function z(w, c, p) {
         p.negative = c.negative ^ w.negative, p.length = w.length + c.length;
         for (var y = 0, A = 0, v = 0; v < p.length - 1; v++) {
           var R = A;
           A = 0;
           for (var O = y & 67108863, _ = Math.min(v, c.length - 1), u = Math.max(0, v - w.length + 1); u <= _; u++) {
-            var l = v - u, E = w.words[l] | 0, T = c.words[u] | 0, D = E * T, W = D & 67108863;
-            R = R + (D / 67108864 | 0) | 0, W = W + O | 0, O = W & 67108863, R = R + (W >>> 26) | 0, A += R >>> 26, R &= 67108863;
+            var l = v - u, E = w.words[l] | 0, T = c.words[u] | 0, P = E * T, W = P & 67108863;
+            R = R + (P / 67108864 | 0) | 0, W = W + O | 0, O = W & 67108863, R = R + (W >>> 26) | 0, A += R >>> 26, R &= 67108863;
           }
           p.words[v] = O, y = R, R = A;
         }
         return y !== 0 ? p.words[v] = y : p.length--, p._strip();
       }
       function U(w, c, p) {
-        return j(w, c, p);
+        return z(w, c, p);
       }
       i.prototype.mulTo = function(c, p) {
         var y, A = this.length + c.length;
-        return this.length === 10 && c.length === 10 ? y = Y(this, c, p) : A < 63 ? y = K(this, c, p) : A < 1024 ? y = j(this, c, p) : y = U(this, c, p), y;
+        return this.length === 10 && c.length === 10 ? y = Y(this, c, p) : A < 63 ? y = K(this, c, p) : A < 1024 ? y = z(this, c, p) : y = U(this, c, p), y;
       }, i.prototype.mul = function(c) {
         var p = new i(null);
         return p.words = new Array(this.length + c.length), this.mulTo(c, p);
@@ -12550,10 +12550,10 @@ function _h() {
         var E = A.clone()._ishlnsubmul(v, 1, _);
         E.negative === 0 && (A = E, u && (u.words[_] = 1));
         for (var T = _ - 1; T >= 0; T--) {
-          var D = (A.words[v.length + T] | 0) * 67108864 + (A.words[v.length + T - 1] | 0);
-          for (D = Math.min(D / R | 0, 67108863), A._ishlnsubmul(v, D, T); A.negative !== 0; )
-            D--, A.negative = 0, A._ishlnsubmul(v, 1, T), A.isZero() || (A.negative ^= 1);
-          u && (u.words[T] = D);
+          var P = (A.words[v.length + T] | 0) * 67108864 + (A.words[v.length + T - 1] | 0);
+          for (P = Math.min(P / R | 0, 67108863), A._ishlnsubmul(v, P, T); A.negative !== 0; )
+            P--, A.negative = 0, A._ishlnsubmul(v, 1, T), A.isZero() || (A.negative ^= 1);
+          u && (u.words[T] = P);
         }
         return u && u._strip(), A._strip(), p !== "div" && y !== 0 && A.iushrn(y), {
           div: u || null,
@@ -12628,9 +12628,9 @@ function _h() {
           if (E > 0)
             for (p.iushrn(E); E-- > 0; )
               (A.isOdd() || v.isOdd()) && (A.iadd(u), v.isub(l)), A.iushrn(1), v.iushrn(1);
-          for (var D = 0, W = 1; (y.words[0] & W) === 0 && D < 26; ++D, W <<= 1) ;
-          if (D > 0)
-            for (y.iushrn(D); D-- > 0; )
+          for (var P = 0, W = 1; (y.words[0] & W) === 0 && P < 26; ++P, W <<= 1) ;
+          if (P > 0)
+            for (y.iushrn(P); P-- > 0; )
               (R.isOdd() || O.isOdd()) && (R.iadd(u), O.isub(l)), R.iushrn(1), O.iushrn(1);
           p.cmp(y) >= 0 ? (p.isub(y), A.isub(R), v.isub(O)) : (y.isub(p), R.isub(A), O.isub(v));
         }
@@ -12748,7 +12748,7 @@ function _h() {
       }, i.prototype.eq = function(c) {
         return this.cmp(c) === 0;
       }, i.red = function(c) {
-        return new F(c);
+        return new L(c);
       }, i.prototype.toRed = function(c) {
         return r(!this.red, "Already a number in reduction context"), r(this.negative === 0, "red works only with positives"), c.convertTo(this)._forceRed(c);
       }, i.prototype.fromRed = function() {
@@ -12784,7 +12784,7 @@ function _h() {
       }, i.prototype.redPow = function(c) {
         return r(this.red && !c.red, "redPow(normalNum)"), this.red._verify1(this), this.red.pow(this, c);
       };
-      var V = {
+      var j = {
         k256: null,
         p224: null,
         p192: null,
@@ -12844,14 +12844,14 @@ function _h() {
         );
       }
       s(te, J);
-      function z() {
+      function V() {
         J.call(
           this,
           "p192",
           "ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff"
         );
       }
-      s(z, J);
+      s(V, J);
       function C() {
         J.call(
           this,
@@ -12866,65 +12866,65 @@ function _h() {
         }
         return p !== 0 && (c.words[c.length++] = p), c;
       }, i._prime = function(c) {
-        if (V[c]) return V[c];
+        if (j[c]) return j[c];
         var p;
         if (c === "k256")
           p = new ne();
         else if (c === "p224")
           p = new te();
         else if (c === "p192")
-          p = new z();
+          p = new V();
         else if (c === "p25519")
           p = new C();
         else
           throw new Error("Unknown prime " + c);
-        return V[c] = p, p;
+        return j[c] = p, p;
       };
-      function F(w) {
+      function L(w) {
         if (typeof w == "string") {
           var c = i._prime(w);
           this.m = c.p, this.prime = c;
         } else
           r(w.gtn(1), "modulus must be greater than 1"), this.m = w, this.prime = null;
       }
-      F.prototype._verify1 = function(c) {
+      L.prototype._verify1 = function(c) {
         r(c.negative === 0, "red works only with positives"), r(c.red, "red works only with red numbers");
-      }, F.prototype._verify2 = function(c, p) {
+      }, L.prototype._verify2 = function(c, p) {
         r((c.negative | p.negative) === 0, "red works only with positives"), r(
           c.red && c.red === p.red,
           "red works only with red numbers"
         );
-      }, F.prototype.imod = function(c) {
+      }, L.prototype.imod = function(c) {
         return this.prime ? this.prime.ireduce(c)._forceRed(this) : (g(c, c.umod(this.m)._forceRed(this)), c);
-      }, F.prototype.neg = function(c) {
+      }, L.prototype.neg = function(c) {
         return c.isZero() ? c.clone() : this.m.sub(c)._forceRed(this);
-      }, F.prototype.add = function(c, p) {
+      }, L.prototype.add = function(c, p) {
         this._verify2(c, p);
         var y = c.add(p);
         return y.cmp(this.m) >= 0 && y.isub(this.m), y._forceRed(this);
-      }, F.prototype.iadd = function(c, p) {
+      }, L.prototype.iadd = function(c, p) {
         this._verify2(c, p);
         var y = c.iadd(p);
         return y.cmp(this.m) >= 0 && y.isub(this.m), y;
-      }, F.prototype.sub = function(c, p) {
+      }, L.prototype.sub = function(c, p) {
         this._verify2(c, p);
         var y = c.sub(p);
         return y.cmpn(0) < 0 && y.iadd(this.m), y._forceRed(this);
-      }, F.prototype.isub = function(c, p) {
+      }, L.prototype.isub = function(c, p) {
         this._verify2(c, p);
         var y = c.isub(p);
         return y.cmpn(0) < 0 && y.iadd(this.m), y;
-      }, F.prototype.shl = function(c, p) {
+      }, L.prototype.shl = function(c, p) {
         return this._verify1(c), this.imod(c.ushln(p));
-      }, F.prototype.imul = function(c, p) {
+      }, L.prototype.imul = function(c, p) {
         return this._verify2(c, p), this.imod(c.imul(p));
-      }, F.prototype.mul = function(c, p) {
+      }, L.prototype.mul = function(c, p) {
         return this._verify2(c, p), this.imod(c.mul(p));
-      }, F.prototype.isqr = function(c) {
+      }, L.prototype.isqr = function(c) {
         return this.imul(c, c.clone());
-      }, F.prototype.sqr = function(c) {
+      }, L.prototype.sqr = function(c) {
         return this.mul(c, c);
-      }, F.prototype.sqrt = function(c) {
+      }, L.prototype.sqrt = function(c) {
         if (c.isZero()) return c.clone();
         var p = this.m.andln(3);
         if (r(p % 2 === 1), p === 3) {
@@ -12937,18 +12937,18 @@ function _h() {
         var R = new i(1).toRed(this), O = R.redNeg(), _ = this.m.subn(1).iushrn(1), u = this.m.bitLength();
         for (u = new i(2 * u * u).toRed(this); this.pow(u, _).cmp(O) !== 0; )
           u.redIAdd(O);
-        for (var l = this.pow(u, A), E = this.pow(c, A.addn(1).iushrn(1)), T = this.pow(c, A), D = v; T.cmp(R) !== 0; ) {
+        for (var l = this.pow(u, A), E = this.pow(c, A.addn(1).iushrn(1)), T = this.pow(c, A), P = v; T.cmp(R) !== 0; ) {
           for (var W = T, se = 0; W.cmp(R) !== 0; se++)
             W = W.redSqr();
-          r(se < D);
-          var ae = this.pow(l, new i(1).iushln(D - se - 1));
-          E = E.redMul(ae), l = ae.redSqr(), T = T.redMul(l), D = se;
+          r(se < P);
+          var ae = this.pow(l, new i(1).iushln(P - se - 1));
+          E = E.redMul(ae), l = ae.redSqr(), T = T.redMul(l), P = se;
         }
         return E;
-      }, F.prototype.invm = function(c) {
+      }, L.prototype.invm = function(c) {
         var p = c._invmp(this.m);
         return p.negative !== 0 ? (p.negative = 0, this.imod(p).redNeg()) : this.imod(p);
-      }, F.prototype.pow = function(c, p) {
+      }, L.prototype.pow = function(c, p) {
         if (p.isZero()) return new i(1).toRed(this);
         if (p.cmpn(1) === 0) return c.clone();
         var y = 4, A = new Array(1 << y);
@@ -12968,33 +12968,33 @@ function _h() {
           u = 26;
         }
         return R;
-      }, F.prototype.convertTo = function(c) {
+      }, L.prototype.convertTo = function(c) {
         var p = c.umod(this.m);
         return p === c ? p.clone() : p;
-      }, F.prototype.convertFrom = function(c) {
+      }, L.prototype.convertFrom = function(c) {
         var p = c.clone();
         return p.red = null, p;
       }, i.mont = function(c) {
-        return new q(c);
+        return new G(c);
       };
-      function q(w) {
-        F.call(this, w), this.shift = this.m.bitLength(), this.shift % 26 !== 0 && (this.shift += 26 - this.shift % 26), this.r = new i(1).iushln(this.shift), this.r2 = this.imod(this.r.sqr()), this.rinv = this.r._invmp(this.m), this.minv = this.rinv.mul(this.r).isubn(1).div(this.m), this.minv = this.minv.umod(this.r), this.minv = this.r.sub(this.minv);
+      function G(w) {
+        L.call(this, w), this.shift = this.m.bitLength(), this.shift % 26 !== 0 && (this.shift += 26 - this.shift % 26), this.r = new i(1).iushln(this.shift), this.r2 = this.imod(this.r.sqr()), this.rinv = this.r._invmp(this.m), this.minv = this.rinv.mul(this.r).isubn(1).div(this.m), this.minv = this.minv.umod(this.r), this.minv = this.r.sub(this.minv);
       }
-      s(q, F), q.prototype.convertTo = function(c) {
+      s(G, L), G.prototype.convertTo = function(c) {
         return this.imod(c.ushln(this.shift));
-      }, q.prototype.convertFrom = function(c) {
+      }, G.prototype.convertFrom = function(c) {
         var p = this.imod(c.mul(this.rinv));
         return p.red = null, p;
-      }, q.prototype.imul = function(c, p) {
+      }, G.prototype.imul = function(c, p) {
         if (c.isZero() || p.isZero())
           return c.words[0] = 0, c.length = 1, c;
         var y = c.imul(p), A = y.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), v = y.isub(A).iushrn(this.shift), R = v;
         return v.cmp(this.m) >= 0 ? R = v.isub(this.m) : v.cmpn(0) < 0 && (R = v.iadd(this.m)), R._forceRed(this);
-      }, q.prototype.mul = function(c, p) {
+      }, G.prototype.mul = function(c, p) {
         if (c.isZero() || p.isZero()) return new i(0)._forceRed(this);
         var y = c.mul(p), A = y.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), v = y.isub(A).iushrn(this.shift), R = v;
         return v.cmp(this.m) >= 0 ? R = v.isub(this.m) : v.cmpn(0) < 0 && (R = v.iadd(this.m)), R._forceRed(this);
-      }, q.prototype.invm = function(c) {
+      }, G.prototype.invm = function(c) {
         var p = this.imod(c._invmp(this.m).mul(this.r2));
         return p._forceRed(this);
       };
@@ -13059,19 +13059,19 @@ function S_() {
         throw new TypeError("Expected Buffer");
       if (M.length === 0)
         return "";
-      for (var k = 0, K = 0, Y = 0, j = M.length; Y !== j && M[Y] === 0; )
+      for (var k = 0, K = 0, Y = 0, z = M.length; Y !== z && M[Y] === 0; )
         Y++, k++;
-      for (var U = (j - Y) * S + 1 >>> 0, V = new Uint8Array(U); Y !== j; ) {
+      for (var U = (z - Y) * S + 1 >>> 0, j = new Uint8Array(U); Y !== z; ) {
         for (var J = M[Y], ne = 0, te = U - 1; (J !== 0 || ne < K) && te !== -1; te--, ne++)
-          J += 256 * V[te] >>> 0, V[te] = J % d >>> 0, J = J / d >>> 0;
+          J += 256 * j[te] >>> 0, j[te] = J % d >>> 0, J = J / d >>> 0;
         if (J !== 0)
           throw new Error("Non-zero carry");
         K = ne, Y++;
       }
-      for (var z = U - K; z !== U && V[z] === 0; )
-        z++;
-      for (var C = m.repeat(k); z < U; ++z)
-        C += n.charAt(V[z]);
+      for (var V = U - K; V !== U && j[V] === 0; )
+        V++;
+      for (var C = m.repeat(k); V < U; ++V)
+        C += n.charAt(j[V]);
       return C;
     }
     function N(M) {
@@ -13081,28 +13081,28 @@ function S_() {
         return t.alloc(0);
       for (var k = 0, K = 0, Y = 0; M[k] === m; )
         K++, k++;
-      for (var j = (M.length - k) * g + 1 >>> 0, U = new Uint8Array(j); k < M.length; ) {
-        var V = M.charCodeAt(k);
-        if (V > 255)
+      for (var z = (M.length - k) * g + 1 >>> 0, U = new Uint8Array(z); k < M.length; ) {
+        var j = M.charCodeAt(k);
+        if (j > 255)
           return;
-        var J = r[V];
+        var J = r[j];
         if (J === 255)
           return;
-        for (var ne = 0, te = j - 1; (J !== 0 || ne < Y) && te !== -1; te--, ne++)
+        for (var ne = 0, te = z - 1; (J !== 0 || ne < Y) && te !== -1; te--, ne++)
           J += d * U[te] >>> 0, U[te] = J % 256 >>> 0, J = J / 256 >>> 0;
         if (J !== 0)
           throw new Error("Non-zero carry");
         Y = ne, k++;
       }
-      for (var z = j - Y; z !== j && U[z] === 0; )
-        z++;
-      var C = t.allocUnsafe(K + (j - z));
+      for (var V = z - Y; V !== z && U[V] === 0; )
+        V++;
+      var C = t.allocUnsafe(K + (z - V));
       C.fill(0, 0, K);
-      for (var F = K; z !== j; )
-        C[F++] = U[z++];
+      for (var L = K; V !== z; )
+        C[L++] = U[V++];
       return C;
     }
-    function P(M) {
+    function F(M) {
       var k = N(M);
       if (k)
         return k;
@@ -13111,7 +13111,7 @@ function S_() {
     return {
       encode: I,
       decodeUnsafe: N,
-      decode: P
+      decode: F
     };
   }
   return pa = e, pa;
@@ -13356,37 +13356,37 @@ var Hd;
 function B_() {
   if (Hd) return Be;
   Hd = 1;
-  var t = Be && Be.__createBinding || (Object.create ? (function(z, C, F, q) {
-    q === void 0 && (q = F), Object.defineProperty(z, q, { enumerable: !0, get: function() {
-      return C[F];
+  var t = Be && Be.__createBinding || (Object.create ? (function(V, C, L, G) {
+    G === void 0 && (G = L), Object.defineProperty(V, G, { enumerable: !0, get: function() {
+      return C[L];
     } });
-  }) : (function(z, C, F, q) {
-    q === void 0 && (q = F), z[q] = C[F];
-  })), e = Be && Be.__setModuleDefault || (Object.create ? (function(z, C) {
-    Object.defineProperty(z, "default", { enumerable: !0, value: C });
-  }) : function(z, C) {
-    z.default = C;
-  }), n = Be && Be.__decorate || function(z, C, F, q) {
-    var w = arguments.length, c = w < 3 ? C : q === null ? q = Object.getOwnPropertyDescriptor(C, F) : q, p;
-    if (typeof Reflect == "object" && typeof Reflect.decorate == "function") c = Reflect.decorate(z, C, F, q);
-    else for (var y = z.length - 1; y >= 0; y--) (p = z[y]) && (c = (w < 3 ? p(c) : w > 3 ? p(C, F, c) : p(C, F)) || c);
-    return w > 3 && c && Object.defineProperty(C, F, c), c;
-  }, r = Be && Be.__importStar || function(z) {
-    if (z && z.__esModule) return z;
+  }) : (function(V, C, L, G) {
+    G === void 0 && (G = L), V[G] = C[L];
+  })), e = Be && Be.__setModuleDefault || (Object.create ? (function(V, C) {
+    Object.defineProperty(V, "default", { enumerable: !0, value: C });
+  }) : function(V, C) {
+    V.default = C;
+  }), n = Be && Be.__decorate || function(V, C, L, G) {
+    var w = arguments.length, c = w < 3 ? C : G === null ? G = Object.getOwnPropertyDescriptor(C, L) : G, p;
+    if (typeof Reflect == "object" && typeof Reflect.decorate == "function") c = Reflect.decorate(V, C, L, G);
+    else for (var y = V.length - 1; y >= 0; y--) (p = V[y]) && (c = (w < 3 ? p(c) : w > 3 ? p(C, L, c) : p(C, L)) || c);
+    return w > 3 && c && Object.defineProperty(C, L, c), c;
+  }, r = Be && Be.__importStar || function(V) {
+    if (V && V.__esModule) return V;
     var C = {};
-    if (z != null) for (var F in z) F !== "default" && Object.hasOwnProperty.call(z, F) && t(C, z, F);
-    return e(C, z), C;
-  }, s = Be && Be.__importDefault || function(z) {
-    return z && z.__esModule ? z : { default: z };
+    if (V != null) for (var L in V) L !== "default" && Object.hasOwnProperty.call(V, L) && t(C, V, L);
+    return e(C, V), C;
+  }, s = Be && Be.__importDefault || function(V) {
+    return V && V.__esModule ? V : { default: V };
   };
   Object.defineProperty(Be, "__esModule", { value: !0 }), Be.deserializeUnchecked = Be.deserialize = Be.serialize = Be.BinaryReader = Be.BinaryWriter = Be.BorshError = Be.baseDecode = Be.baseEncode = void 0;
   const i = s(_h()), o = s(Eh()), a = r(M_), d = typeof TextDecoder != "function" ? a.TextDecoder : TextDecoder, m = new d("utf-8", { fatal: !0 });
-  function g(z) {
-    return typeof z == "string" && (z = Buffer.from(z, "utf8")), o.default.encode(Buffer.from(z));
+  function g(V) {
+    return typeof V == "string" && (V = Buffer.from(V, "utf8")), o.default.encode(Buffer.from(V));
   }
   Be.baseEncode = g;
-  function S(z) {
-    return Buffer.from(o.default.decode(z));
+  function S(V) {
+    return Buffer.from(o.default.decode(V));
   }
   Be.baseDecode = S;
   const I = 1024;
@@ -13399,7 +13399,7 @@ function B_() {
     }
   }
   Be.BorshError = N;
-  class P {
+  class F {
     constructor() {
       this.buf = Buffer.alloc(I), this.length = 0;
     }
@@ -13436,27 +13436,27 @@ function B_() {
     }
     writeString(C) {
       this.maybeResize();
-      const F = Buffer.from(C, "utf8");
-      this.writeU32(F.length), this.writeBuffer(F);
+      const L = Buffer.from(C, "utf8");
+      this.writeU32(L.length), this.writeBuffer(L);
     }
     writeFixedArray(C) {
       this.writeBuffer(Buffer.from(C));
     }
-    writeArray(C, F) {
+    writeArray(C, L) {
       this.maybeResize(), this.writeU32(C.length);
-      for (const q of C)
-        this.maybeResize(), F(q);
+      for (const G of C)
+        this.maybeResize(), L(G);
     }
     toArray() {
       return this.buf.subarray(0, this.length);
     }
   }
-  Be.BinaryWriter = P;
-  function M(z, C, F) {
-    const q = F.value;
-    F.value = function(...w) {
+  Be.BinaryWriter = F;
+  function M(V, C, L) {
+    const G = L.value;
+    L.value = function(...w) {
       try {
-        return q.apply(this, w);
+        return G.apply(this, w);
       } catch (c) {
         if (c instanceof RangeError) {
           const p = c.code;
@@ -13502,25 +13502,25 @@ function B_() {
     readBuffer(C) {
       if (this.offset + C > this.buf.length)
         throw new N(`Expected buffer length ${C} isn't within bounds`);
-      const F = this.buf.slice(this.offset, this.offset + C);
-      return this.offset += C, F;
+      const L = this.buf.slice(this.offset, this.offset + C);
+      return this.offset += C, L;
     }
     readString() {
-      const C = this.readU32(), F = this.readBuffer(C);
+      const C = this.readU32(), L = this.readBuffer(C);
       try {
-        return m.decode(F);
-      } catch (q) {
-        throw new N(`Error decoding UTF-8 string: ${q}`);
+        return m.decode(L);
+      } catch (G) {
+        throw new N(`Error decoding UTF-8 string: ${G}`);
       }
     }
     readFixedArray(C) {
       return new Uint8Array(this.readBuffer(C));
     }
     readArray(C) {
-      const F = this.readU32(), q = Array();
-      for (let w = 0; w < F; ++w)
-        q.push(C());
-      return q;
+      const L = this.readU32(), G = Array();
+      for (let w = 0; w < L; ++w)
+        G.push(C());
+      return G;
     }
   }
   n([
@@ -13544,156 +13544,156 @@ function B_() {
   ], k.prototype, "readFixedArray", null), n([
     M
   ], k.prototype, "readArray", null), Be.BinaryReader = k;
-  function K(z) {
-    return z.charAt(0).toUpperCase() + z.slice(1);
+  function K(V) {
+    return V.charAt(0).toUpperCase() + V.slice(1);
   }
-  function Y(z, C, F, q, w) {
+  function Y(V, C, L, G, w) {
     try {
-      if (typeof q == "string")
-        w[`write${K(q)}`](F);
-      else if (q instanceof Array)
-        if (typeof q[0] == "number") {
-          if (F.length !== q[0])
-            throw new N(`Expecting byte array of length ${q[0]}, but got ${F.length} bytes`);
-          w.writeFixedArray(F);
-        } else if (q.length === 2 && typeof q[1] == "number") {
-          if (F.length !== q[1])
-            throw new N(`Expecting byte array of length ${q[1]}, but got ${F.length} bytes`);
-          for (let c = 0; c < q[1]; c++)
-            Y(z, null, F[c], q[0], w);
+      if (typeof G == "string")
+        w[`write${K(G)}`](L);
+      else if (G instanceof Array)
+        if (typeof G[0] == "number") {
+          if (L.length !== G[0])
+            throw new N(`Expecting byte array of length ${G[0]}, but got ${L.length} bytes`);
+          w.writeFixedArray(L);
+        } else if (G.length === 2 && typeof G[1] == "number") {
+          if (L.length !== G[1])
+            throw new N(`Expecting byte array of length ${G[1]}, but got ${L.length} bytes`);
+          for (let c = 0; c < G[1]; c++)
+            Y(V, null, L[c], G[0], w);
         } else
-          w.writeArray(F, (c) => {
-            Y(z, C, c, q[0], w);
+          w.writeArray(L, (c) => {
+            Y(V, C, c, G[0], w);
           });
-      else if (q.kind !== void 0)
-        switch (q.kind) {
+      else if (G.kind !== void 0)
+        switch (G.kind) {
           case "option": {
-            F == null ? w.writeU8(0) : (w.writeU8(1), Y(z, C, F, q.type, w));
+            L == null ? w.writeU8(0) : (w.writeU8(1), Y(V, C, L, G.type, w));
             break;
           }
           case "map": {
-            w.writeU32(F.size), F.forEach((c, p) => {
-              Y(z, C, p, q.key, w), Y(z, C, c, q.value, w);
+            w.writeU32(L.size), L.forEach((c, p) => {
+              Y(V, C, p, G.key, w), Y(V, C, c, G.value, w);
             });
             break;
           }
           default:
-            throw new N(`FieldType ${q} unrecognized`);
+            throw new N(`FieldType ${G} unrecognized`);
         }
       else
-        j(z, F, w);
+        z(V, L, w);
     } catch (c) {
       throw c instanceof N && c.addToFieldPath(C), c;
     }
   }
-  function j(z, C, F) {
+  function z(V, C, L) {
     if (typeof C.borshSerialize == "function") {
-      C.borshSerialize(F);
+      C.borshSerialize(L);
       return;
     }
-    const q = z.get(C.constructor);
-    if (!q)
+    const G = V.get(C.constructor);
+    if (!G)
       throw new N(`Class ${C.constructor.name} is missing in schema`);
-    if (q.kind === "struct")
-      q.fields.map(([w, c]) => {
-        Y(z, w, C[w], c, F);
+    if (G.kind === "struct")
+      G.fields.map(([w, c]) => {
+        Y(V, w, C[w], c, L);
       });
-    else if (q.kind === "enum") {
-      const w = C[q.field];
-      for (let c = 0; c < q.values.length; ++c) {
-        const [p, y] = q.values[c];
+    else if (G.kind === "enum") {
+      const w = C[G.field];
+      for (let c = 0; c < G.values.length; ++c) {
+        const [p, y] = G.values[c];
         if (p === w) {
-          F.writeU8(c), Y(z, p, C[p], y, F);
+          L.writeU8(c), Y(V, p, C[p], y, L);
           break;
         }
       }
     } else
-      throw new N(`Unexpected schema kind: ${q.kind} for ${C.constructor.name}`);
+      throw new N(`Unexpected schema kind: ${G.kind} for ${C.constructor.name}`);
   }
-  function U(z, C, F = P) {
-    const q = new F();
-    return j(z, C, q), q.toArray();
+  function U(V, C, L = F) {
+    const G = new L();
+    return z(V, C, G), G.toArray();
   }
   Be.serialize = U;
-  function V(z, C, F, q) {
+  function j(V, C, L, G) {
     try {
-      if (typeof F == "string")
-        return q[`read${K(F)}`]();
-      if (F instanceof Array) {
-        if (typeof F[0] == "number")
-          return q.readFixedArray(F[0]);
-        if (typeof F[1] == "number") {
+      if (typeof L == "string")
+        return G[`read${K(L)}`]();
+      if (L instanceof Array) {
+        if (typeof L[0] == "number")
+          return G.readFixedArray(L[0]);
+        if (typeof L[1] == "number") {
           const w = [];
-          for (let c = 0; c < F[1]; c++)
-            w.push(V(z, null, F[0], q));
+          for (let c = 0; c < L[1]; c++)
+            w.push(j(V, null, L[0], G));
           return w;
         } else
-          return q.readArray(() => V(z, C, F[0], q));
+          return G.readArray(() => j(V, C, L[0], G));
       }
-      if (F.kind === "option")
-        return q.readU8() ? V(z, C, F.type, q) : void 0;
-      if (F.kind === "map") {
+      if (L.kind === "option")
+        return G.readU8() ? j(V, C, L.type, G) : void 0;
+      if (L.kind === "map") {
         let w = /* @__PURE__ */ new Map();
-        const c = q.readU32();
+        const c = G.readU32();
         for (let p = 0; p < c; p++) {
-          const y = V(z, C, F.key, q), A = V(z, C, F.value, q);
+          const y = j(V, C, L.key, G), A = j(V, C, L.value, G);
           w.set(y, A);
         }
         return w;
       }
-      return J(z, F, q);
+      return J(V, L, G);
     } catch (w) {
       throw w instanceof N && w.addToFieldPath(C), w;
     }
   }
-  function J(z, C, F) {
+  function J(V, C, L) {
     if (typeof C.borshDeserialize == "function")
-      return C.borshDeserialize(F);
-    const q = z.get(C);
-    if (!q)
+      return C.borshDeserialize(L);
+    const G = V.get(C);
+    if (!G)
       throw new N(`Class ${C.name} is missing in schema`);
-    if (q.kind === "struct") {
+    if (G.kind === "struct") {
       const w = {};
-      for (const [c, p] of z.get(C).fields)
-        w[c] = V(z, c, p, F);
+      for (const [c, p] of V.get(C).fields)
+        w[c] = j(V, c, p, L);
       return new C(w);
     }
-    if (q.kind === "enum") {
-      const w = F.readU8();
-      if (w >= q.values.length)
+    if (G.kind === "enum") {
+      const w = L.readU8();
+      if (w >= G.values.length)
         throw new N(`Enum index: ${w} is out of range`);
-      const [c, p] = q.values[w], y = V(z, c, p, F);
+      const [c, p] = G.values[w], y = j(V, c, p, L);
       return new C({ [c]: y });
     }
-    throw new N(`Unexpected schema kind: ${q.kind} for ${C.constructor.name}`);
+    throw new N(`Unexpected schema kind: ${G.kind} for ${C.constructor.name}`);
   }
-  function ne(z, C, F, q = k) {
-    const w = new q(F), c = J(z, C, w);
-    if (w.offset < F.length)
-      throw new N(`Unexpected ${F.length - w.offset} bytes after deserialized data`);
+  function ne(V, C, L, G = k) {
+    const w = new G(L), c = J(V, C, w);
+    if (w.offset < L.length)
+      throw new N(`Unexpected ${L.length - w.offset} bytes after deserialized data`);
     return c;
   }
   Be.deserialize = ne;
-  function te(z, C, F, q = k) {
-    const w = new q(F);
-    return J(z, C, w);
+  function te(V, C, L, G = k) {
+    const w = new G(L);
+    return J(V, C, w);
   }
   return Be.deserializeUnchecked = te, Be;
 }
-var ya = B_(), G = {}, Gd;
+var ya = B_(), q = {}, Gd;
 function k_() {
-  if (Gd) return G;
-  Gd = 1, Object.defineProperty(G, "__esModule", { value: !0 }), G.s16 = G.s8 = G.nu64be = G.u48be = G.u40be = G.u32be = G.u24be = G.u16be = G.nu64 = G.u48 = G.u40 = G.u32 = G.u24 = G.u16 = G.u8 = G.offset = G.greedy = G.Constant = G.UTF8 = G.CString = G.Blob = G.Boolean = G.BitField = G.BitStructure = G.VariantLayout = G.Union = G.UnionLayoutDiscriminator = G.UnionDiscriminator = G.Structure = G.Sequence = G.DoubleBE = G.Double = G.FloatBE = G.Float = G.NearInt64BE = G.NearInt64 = G.NearUInt64BE = G.NearUInt64 = G.IntBE = G.Int = G.UIntBE = G.UInt = G.OffsetLayout = G.GreedyCount = G.ExternalLayout = G.bindConstructorLayout = G.nameWithProperty = G.Layout = G.uint8ArrayToBuffer = G.checkUint8Array = void 0, G.constant = G.utf8 = G.cstr = G.blob = G.unionLayoutDiscriminator = G.union = G.seq = G.bits = G.struct = G.f64be = G.f64 = G.f32be = G.f32 = G.ns64be = G.s48be = G.s40be = G.s32be = G.s24be = G.s16be = G.ns64 = G.s48 = G.s40 = G.s32 = G.s24 = void 0;
+  if (Gd) return q;
+  Gd = 1, Object.defineProperty(q, "__esModule", { value: !0 }), q.s16 = q.s8 = q.nu64be = q.u48be = q.u40be = q.u32be = q.u24be = q.u16be = q.nu64 = q.u48 = q.u40 = q.u32 = q.u24 = q.u16 = q.u8 = q.offset = q.greedy = q.Constant = q.UTF8 = q.CString = q.Blob = q.Boolean = q.BitField = q.BitStructure = q.VariantLayout = q.Union = q.UnionLayoutDiscriminator = q.UnionDiscriminator = q.Structure = q.Sequence = q.DoubleBE = q.Double = q.FloatBE = q.Float = q.NearInt64BE = q.NearInt64 = q.NearUInt64BE = q.NearUInt64 = q.IntBE = q.Int = q.UIntBE = q.UInt = q.OffsetLayout = q.GreedyCount = q.ExternalLayout = q.bindConstructorLayout = q.nameWithProperty = q.Layout = q.uint8ArrayToBuffer = q.checkUint8Array = void 0, q.constant = q.utf8 = q.cstr = q.blob = q.unionLayoutDiscriminator = q.union = q.seq = q.bits = q.struct = q.f64be = q.f64 = q.f32be = q.f32 = q.ns64be = q.s48be = q.s40be = q.s32be = q.s24be = q.s16be = q.ns64 = q.s48 = q.s40 = q.s32 = q.s24 = void 0;
   const t = tu();
   function e(u) {
     if (!(u instanceof Uint8Array))
       throw new TypeError("b must be a Uint8Array");
   }
-  G.checkUint8Array = e;
+  q.checkUint8Array = e;
   function n(u) {
     return e(u), t.Buffer.from(u.buffer, u.byteOffset, u.length);
   }
-  G.uint8ArrayToBuffer = n;
+  q.uint8ArrayToBuffer = n;
   let r = class {
     constructor(l, E) {
       if (!Number.isInteger(l))
@@ -13782,11 +13782,11 @@ function k_() {
     fromArray(l) {
     }
   };
-  G.Layout = r;
+  q.Layout = r;
   function s(u, l) {
     return l.property ? u + "[" + l.property + "]" : u;
   }
-  G.nameWithProperty = s;
+  q.nameWithProperty = s;
   function i(u, l) {
     if (typeof u != "function")
       throw new TypeError("Class must be constructor");
@@ -13808,7 +13808,7 @@ function k_() {
       writable: !0
     });
   }
-  G.bindConstructorLayout = i;
+  q.bindConstructorLayout = i;
   class o extends r {
     /**
      * Return `true` iff the external layout decodes to an unsigned
@@ -13825,7 +13825,7 @@ function k_() {
       throw new Error("ExternalLayout is abstract");
     }
   }
-  G.ExternalLayout = o;
+  q.ExternalLayout = o;
   class a extends o {
     constructor(l = 1, E) {
       if (!Number.isInteger(l) || 0 >= l)
@@ -13847,7 +13847,7 @@ function k_() {
       return 0;
     }
   }
-  G.GreedyCount = a;
+  q.GreedyCount = a;
   class d extends o {
     constructor(l, E = 0, T) {
       if (!(l instanceof r))
@@ -13869,7 +13869,7 @@ function k_() {
       return this.layout.encode(l, E, T + this.offset);
     }
   }
-  G.OffsetLayout = d;
+  q.OffsetLayout = d;
   class m extends r {
     constructor(l, E) {
       if (super(l, E), 6 < this.span)
@@ -13884,7 +13884,7 @@ function k_() {
       return n(E).writeUIntLE(l, T, this.span), this.span;
     }
   }
-  G.UInt = m;
+  q.UInt = m;
   class g extends r {
     constructor(l, E) {
       if (super(l, E), 6 < this.span)
@@ -13899,7 +13899,7 @@ function k_() {
       return n(E).writeUIntBE(l, T, this.span), this.span;
     }
   }
-  G.UIntBE = g;
+  q.UIntBE = g;
   class S extends r {
     constructor(l, E) {
       if (super(l, E), 6 < this.span)
@@ -13914,7 +13914,7 @@ function k_() {
       return n(E).writeIntLE(l, T, this.span), this.span;
     }
   }
-  G.Int = S;
+  q.Int = S;
   class I extends r {
     constructor(l, E) {
       if (super(l, E), 6 < this.span)
@@ -13929,9 +13929,9 @@ function k_() {
       return n(E).writeIntBE(l, T, this.span), this.span;
     }
   }
-  G.IntBE = I;
+  q.IntBE = I;
   const N = Math.pow(2, 32);
-  function P(u) {
+  function F(u) {
     const l = Math.floor(u / N), E = u - l * N;
     return { hi32: l, lo32: E };
   }
@@ -13944,64 +13944,64 @@ function k_() {
     }
     /** @override */
     decode(l, E = 0) {
-      const T = n(l), D = T.readUInt32LE(E), W = T.readUInt32LE(E + 4);
-      return M(W, D);
+      const T = n(l), P = T.readUInt32LE(E), W = T.readUInt32LE(E + 4);
+      return M(W, P);
     }
     /** @override */
     encode(l, E, T = 0) {
-      const D = P(l), W = n(E);
-      return W.writeUInt32LE(D.lo32, T), W.writeUInt32LE(D.hi32, T + 4), 8;
+      const P = F(l), W = n(E);
+      return W.writeUInt32LE(P.lo32, T), W.writeUInt32LE(P.hi32, T + 4), 8;
     }
   }
-  G.NearUInt64 = k;
+  q.NearUInt64 = k;
   class K extends r {
     constructor(l) {
       super(8, l);
     }
     /** @override */
     decode(l, E = 0) {
-      const T = n(l), D = T.readUInt32BE(E), W = T.readUInt32BE(E + 4);
-      return M(D, W);
+      const T = n(l), P = T.readUInt32BE(E), W = T.readUInt32BE(E + 4);
+      return M(P, W);
     }
     /** @override */
     encode(l, E, T = 0) {
-      const D = P(l), W = n(E);
-      return W.writeUInt32BE(D.hi32, T), W.writeUInt32BE(D.lo32, T + 4), 8;
+      const P = F(l), W = n(E);
+      return W.writeUInt32BE(P.hi32, T), W.writeUInt32BE(P.lo32, T + 4), 8;
     }
   }
-  G.NearUInt64BE = K;
+  q.NearUInt64BE = K;
   class Y extends r {
     constructor(l) {
       super(8, l);
     }
     /** @override */
     decode(l, E = 0) {
-      const T = n(l), D = T.readUInt32LE(E), W = T.readInt32LE(E + 4);
-      return M(W, D);
+      const T = n(l), P = T.readUInt32LE(E), W = T.readInt32LE(E + 4);
+      return M(W, P);
     }
     /** @override */
     encode(l, E, T = 0) {
-      const D = P(l), W = n(E);
-      return W.writeUInt32LE(D.lo32, T), W.writeInt32LE(D.hi32, T + 4), 8;
+      const P = F(l), W = n(E);
+      return W.writeUInt32LE(P.lo32, T), W.writeInt32LE(P.hi32, T + 4), 8;
     }
   }
-  G.NearInt64 = Y;
-  class j extends r {
+  q.NearInt64 = Y;
+  class z extends r {
     constructor(l) {
       super(8, l);
     }
     /** @override */
     decode(l, E = 0) {
-      const T = n(l), D = T.readInt32BE(E), W = T.readUInt32BE(E + 4);
-      return M(D, W);
+      const T = n(l), P = T.readInt32BE(E), W = T.readUInt32BE(E + 4);
+      return M(P, W);
     }
     /** @override */
     encode(l, E, T = 0) {
-      const D = P(l), W = n(E);
-      return W.writeInt32BE(D.hi32, T), W.writeUInt32BE(D.lo32, T + 4), 8;
+      const P = F(l), W = n(E);
+      return W.writeInt32BE(P.hi32, T), W.writeUInt32BE(P.lo32, T + 4), 8;
     }
   }
-  G.NearInt64BE = j;
+  q.NearInt64BE = z;
   class U extends r {
     constructor(l) {
       super(4, l);
@@ -14015,8 +14015,8 @@ function k_() {
       return n(E).writeFloatLE(l, T), 4;
     }
   }
-  G.Float = U;
-  class V extends r {
+  q.Float = U;
+  class j extends r {
     constructor(l) {
       super(4, l);
     }
@@ -14029,7 +14029,7 @@ function k_() {
       return n(E).writeFloatBE(l, T), 4;
     }
   }
-  G.FloatBE = V;
+  q.FloatBE = j;
   class J extends r {
     constructor(l) {
       super(8, l);
@@ -14043,7 +14043,7 @@ function k_() {
       return n(E).writeDoubleLE(l, T), 8;
     }
   }
-  G.Double = J;
+  q.Double = J;
   class ne extends r {
     constructor(l) {
       super(8, l);
@@ -14057,26 +14057,26 @@ function k_() {
       return n(E).writeDoubleBE(l, T), 8;
     }
   }
-  G.DoubleBE = ne;
+  q.DoubleBE = ne;
   class te extends r {
     constructor(l, E, T) {
       if (!(l instanceof r))
         throw new TypeError("elementLayout must be a Layout");
       if (!(E instanceof o && E.isCount() || Number.isInteger(E) && 0 <= E))
         throw new TypeError("count must be non-negative integer or an unsigned integer ExternalLayout");
-      let D = -1;
-      !(E instanceof o) && 0 < l.span && (D = E * l.span), super(D, T), this.elementLayout = l, this.count = E;
+      let P = -1;
+      !(E instanceof o) && 0 < l.span && (P = E * l.span), super(P, T), this.elementLayout = l, this.count = E;
     }
     /** @override */
     getSpan(l, E = 0) {
       if (0 <= this.span)
         return this.span;
-      let T = 0, D = this.count;
-      if (D instanceof o && (D = D.decode(l, E)), 0 < this.elementLayout.span)
-        T = D * this.elementLayout.span;
+      let T = 0, P = this.count;
+      if (P instanceof o && (P = P.decode(l, E)), 0 < this.elementLayout.span)
+        T = P * this.elementLayout.span;
       else {
         let W = 0;
-        for (; W < D; )
+        for (; W < P; )
           T += this.elementLayout.getSpan(l, E + T), ++W;
       }
       return T;
@@ -14084,9 +14084,9 @@ function k_() {
     /** @override */
     decode(l, E = 0) {
       const T = [];
-      let D = 0, W = this.count;
-      for (W instanceof o && (W = W.decode(l, E)); D < W; )
-        T.push(this.elementLayout.decode(l, E)), E += this.elementLayout.getSpan(l, E), D += 1;
+      let P = 0, W = this.count;
+      for (W instanceof o && (W = W.decode(l, E)); P < W; )
+        T.push(this.elementLayout.decode(l, E)), E += this.elementLayout.getSpan(l, E), P += 1;
       return T;
     }
     /** Implement {@link Layout#encode|encode} for {@link Sequence}.
@@ -14100,12 +14100,12 @@ function k_() {
      * ExternalLayout} then the length of `src` will be encoded as the
      * count after `src` is encoded. */
     encode(l, E, T = 0) {
-      const D = this.elementLayout, W = l.reduce((se, ae) => se + D.encode(ae, E, T + se), 0);
+      const P = this.elementLayout, W = l.reduce((se, ae) => se + P.encode(ae, E, T + se), 0);
       return this.count instanceof o && this.count.encode(l.length, E, T), W;
     }
   }
-  G.Sequence = te;
-  class z extends r {
+  q.Sequence = te;
+  class V extends r {
     constructor(l, E, T) {
       if (!(Array.isArray(l) && l.reduce((W, se) => W && se instanceof r, !0)))
         throw new TypeError("fields must be array of Layout instances");
@@ -14113,12 +14113,12 @@ function k_() {
       for (const W of l)
         if (0 > W.span && W.property === void 0)
           throw new Error("fields cannot contain unnamed variable-length layout");
-      let D = -1;
+      let P = -1;
       try {
-        D = l.reduce((W, se) => W + se.getSpan(), 0);
+        P = l.reduce((W, se) => W + se.getSpan(), 0);
       } catch {
       }
-      super(D, E), this.fields = l, this.decodePrefixes = !!T;
+      super(P, E), this.fields = l, this.decodePrefixes = !!T;
     }
     /** @override */
     getSpan(l, E = 0) {
@@ -14126,9 +14126,9 @@ function k_() {
         return this.span;
       let T = 0;
       try {
-        T = this.fields.reduce((D, W) => {
+        T = this.fields.reduce((P, W) => {
           const se = W.getSpan(l, E);
-          return E += se, D + se;
+          return E += se, P + se;
         }, 0);
       } catch {
         throw new RangeError("indeterminate span");
@@ -14139,8 +14139,8 @@ function k_() {
     decode(l, E = 0) {
       e(l);
       const T = this.makeDestinationObject();
-      for (const D of this.fields)
-        if (D.property !== void 0 && (T[D.property] = D.decode(l, E)), E += D.getSpan(l, E), this.decodePrefixes && l.length === E)
+      for (const P of this.fields)
+        if (P.property !== void 0 && (T[P.property] = P.decode(l, E)), E += P.getSpan(l, E), this.decodePrefixes && l.length === E)
           break;
       return T;
     }
@@ -14150,7 +14150,7 @@ function k_() {
      * Layout#property|property} the corresponding region of the buffer is
      * left unmodified. */
     encode(l, E, T = 0) {
-      const D = T;
+      const P = T;
       let W = 0, se = 0;
       for (const ae of this.fields) {
         let Me = ae.span;
@@ -14160,7 +14160,7 @@ function k_() {
         }
         W = T, T += Me;
       }
-      return W + se - D;
+      return W + se - P;
     }
     /** @override */
     fromArray(l) {
@@ -14206,7 +14206,7 @@ function k_() {
       }
     }
   }
-  G.Structure = z;
+  q.Structure = V;
   class C {
     constructor(l) {
       this.property = l;
@@ -14226,8 +14226,8 @@ function k_() {
       throw new Error("UnionDiscriminator is abstract");
     }
   }
-  G.UnionDiscriminator = C;
-  class F extends C {
+  q.UnionDiscriminator = C;
+  class L extends C {
     constructor(l, E) {
       if (!(l instanceof o && l.isCount()))
         throw new TypeError("layout must be an unsigned integer ExternalLayout");
@@ -14242,16 +14242,16 @@ function k_() {
       return this.layout.encode(l, E, T);
     }
   }
-  G.UnionLayoutDiscriminator = F;
-  class q extends r {
+  q.UnionLayoutDiscriminator = L;
+  class G extends r {
     constructor(l, E, T) {
-      let D;
+      let P;
       if (l instanceof m || l instanceof g)
-        D = new F(new d(l));
+        P = new L(new d(l));
       else if (l instanceof o && l.isCount())
-        D = new F(l);
+        P = new L(l);
       else if (l instanceof C)
-        D = l;
+        P = l;
       else
         throw new TypeError("discr must be a UnionDiscriminator or an unsigned integer layout");
       if (E === void 0 && (E = null), !(E === null || E instanceof r))
@@ -14262,7 +14262,7 @@ function k_() {
         E.property === void 0 && (E = E.replicate("content"));
       }
       let W = -1;
-      E && (W = E.span, 0 <= W && (l instanceof m || l instanceof g) && (W += D.layout.span)), super(W, T), this.discriminator = D, this.usesPrefixDiscriminator = l instanceof m || l instanceof g, this.defaultLayout = E, this.registry = {};
+      E && (W = E.span, 0 <= W && (l instanceof m || l instanceof g) && (W += P.layout.span)), super(W, T), this.discriminator = P, this.usesPrefixDiscriminator = l instanceof m || l instanceof g, this.defaultLayout = E, this.registry = {};
       let se = this.defaultGetSourceVariant.bind(this);
       this.getSourceVariant = function(ae) {
         return se(ae);
@@ -14331,11 +14331,11 @@ function k_() {
      * layout} is used to decode the content. */
     decode(l, E = 0) {
       let T;
-      const D = this.discriminator, W = D.decode(l, E), se = this.registry[W];
+      const P = this.discriminator, W = P.decode(l, E), se = this.registry[W];
       if (se === void 0) {
         const ae = this.defaultLayout;
         let Me = 0;
-        this.usesPrefixDiscriminator && (Me = D.layout.span), T = this.makeDestinationObject(), T[D.property] = W, T[ae.property] = ae.decode(l, E + Me);
+        this.usesPrefixDiscriminator && (Me = P.layout.span), T = this.makeDestinationObject(), T[P.property] = W, T[ae.property] = ae.decode(l, E + Me);
       } else
         T = se.decode(l, E);
       return T;
@@ -14347,13 +14347,13 @@ function k_() {
      * use the appropriate variant-specific {@link VariantLayout#encode}
      * method. */
     encode(l, E, T = 0) {
-      const D = this.getSourceVariant(l);
-      if (D === void 0) {
+      const P = this.getSourceVariant(l);
+      if (P === void 0) {
         const W = this.discriminator, se = this.defaultLayout;
         let ae = 0;
         return this.usesPrefixDiscriminator && (ae = W.layout.span), W.encode(l[W.property], E, T), ae + se.encode(l[se.property], E, T + ae);
       }
-      return D.encode(l, E, T);
+      return P.encode(l, E, T);
     }
     /** Register a new variant structure within a union.  The newly
      * created variant is returned.
@@ -14369,8 +14369,8 @@ function k_() {
      *
      * @return {VariantLayout} */
     addVariant(l, E, T) {
-      const D = new w(this, l, E, T);
-      return this.registry[l] = D, D;
+      const P = new w(this, l, E, T);
+      return this.registry[l] = P, P;
     }
     /**
      * Get the layout associated with a registered variant.
@@ -14391,23 +14391,23 @@ function k_() {
       return l instanceof Uint8Array ? T = this.discriminator.decode(l, E) : T = l, this.registry[T];
     }
   }
-  G.Union = q;
+  q.Union = G;
   class w extends r {
-    constructor(l, E, T, D) {
-      if (!(l instanceof q))
+    constructor(l, E, T, P) {
+      if (!(l instanceof G))
         throw new TypeError("union must be a Union");
       if (!Number.isInteger(E) || 0 > E)
         throw new TypeError("variant must be a (non-negative) integer");
-      if (typeof T == "string" && D === void 0 && (D = T, T = null), T) {
+      if (typeof T == "string" && P === void 0 && (P = T, T = null), T) {
         if (!(T instanceof r))
           throw new TypeError("layout must be a Layout");
         if (l.defaultLayout !== null && 0 <= T.span && T.span > l.defaultLayout.span)
           throw new Error("variant span exceeds span of containing union");
-        if (typeof D != "string")
+        if (typeof P != "string")
           throw new TypeError("variant must have a String property");
       }
       let W = l.span;
-      0 > l.span && (W = T ? T.span : 0, 0 <= W && l.usesPrefixDiscriminator && (W += l.discriminator.layout.span)), super(W, D), this.union = l, this.variant = E, this.layout = T || null;
+      0 > l.span && (W = T ? T.span : 0, 0 <= W && l.usesPrefixDiscriminator && (W += l.discriminator.layout.span)), super(W, P), this.union = l, this.variant = E, this.layout = T || null;
     }
     /** @override */
     getSpan(l, E = 0) {
@@ -14415,25 +14415,25 @@ function k_() {
         return this.span;
       let T = 0;
       this.union.usesPrefixDiscriminator && (T = this.union.discriminator.layout.span);
-      let D = 0;
-      return this.layout && (D = this.layout.getSpan(l, E + T)), T + D;
+      let P = 0;
+      return this.layout && (P = this.layout.getSpan(l, E + T)), T + P;
     }
     /** @override */
     decode(l, E = 0) {
       const T = this.makeDestinationObject();
       if (this !== this.union.getVariant(l, E))
         throw new Error("variant mismatch");
-      let D = 0;
-      return this.union.usesPrefixDiscriminator && (D = this.union.discriminator.layout.span), this.layout ? T[this.property] = this.layout.decode(l, E + D) : this.property ? T[this.property] = !0 : this.union.usesPrefixDiscriminator && (T[this.union.discriminator.property] = this.variant), T;
+      let P = 0;
+      return this.union.usesPrefixDiscriminator && (P = this.union.discriminator.layout.span), this.layout ? T[this.property] = this.layout.decode(l, E + P) : this.property ? T[this.property] = !0 : this.union.usesPrefixDiscriminator && (T[this.union.discriminator.property] = this.variant), T;
     }
     /** @override */
     encode(l, E, T = 0) {
-      let D = 0;
-      if (this.union.usesPrefixDiscriminator && (D = this.union.discriminator.layout.span), this.layout && !Object.prototype.hasOwnProperty.call(l, this.property))
+      let P = 0;
+      if (this.union.usesPrefixDiscriminator && (P = this.union.discriminator.layout.span), this.layout && !Object.prototype.hasOwnProperty.call(l, this.property))
         throw new TypeError("variant lacks property " + this.property);
       this.union.discriminator.encode(this.variant, E, T);
-      let W = D;
-      if (this.layout && (this.layout.encode(l[this.property], E, T + D), W += this.layout.getSpan(E, T + D), 0 <= this.union.span && W > this.union.span))
+      let W = P;
+      if (this.layout && (this.layout.encode(l[this.property], E, T + P), W += this.layout.getSpan(E, T + P), 0 <= this.union.span && W > this.union.span))
         throw new Error("encoded variant overruns containing union");
       return W;
     }
@@ -14444,7 +14444,7 @@ function k_() {
         return this.layout.fromArray(l);
     }
   }
-  G.VariantLayout = w;
+  q.VariantLayout = w;
   function c(u) {
     return 0 > u && (u += 4294967296), u;
   }
@@ -14455,17 +14455,17 @@ function k_() {
       if (typeof E == "string" && T === void 0 && (T = E, E = !1), 4 < l.span)
         throw new RangeError("word cannot exceed 32 bits");
       super(l.span, T), this.word = l, this.msb = !!E, this.fields = [];
-      let D = 0;
+      let P = 0;
       this._packedSetValue = function(W) {
-        return D = c(W), this;
+        return P = c(W), this;
       }, this._packedGetValue = function() {
-        return D;
+        return P;
       };
     }
     /** @override */
     decode(l, E = 0) {
-      const T = this.makeDestinationObject(), D = this.word.decode(l, E);
-      this._packedSetValue(D);
+      const T = this.makeDestinationObject(), P = this.word.decode(l, E);
+      this._packedSetValue(P);
       for (const W of this.fields)
         W.property !== void 0 && (T[W.property] = W.decode(l));
       return T;
@@ -14476,8 +14476,8 @@ function k_() {
      * Layout#property|property} the corresponding region of the packed
      * value is left unmodified.  Unused bits are also left unmodified. */
     encode(l, E, T = 0) {
-      const D = this.word.decode(E, T);
-      this._packedSetValue(D);
+      const P = this.word.decode(E, T);
+      this._packedSetValue(P);
       for (const W of this.fields)
         if (W.property !== void 0) {
           const se = l[W.property];
@@ -14527,17 +14527,17 @@ function k_() {
           return E;
     }
   }
-  G.BitStructure = p;
+  q.BitStructure = p;
   class y {
     constructor(l, E, T) {
       if (!(l instanceof p))
         throw new TypeError("container must be a BitStructure");
       if (!Number.isInteger(E) || 0 >= E)
         throw new TypeError("bits must be positive integer");
-      const D = 8 * l.span, W = l.fields.reduce((se, ae) => se + ae.bits, 0);
-      if (E + W > D)
-        throw new Error("bits too long for span remainder (" + (D - W) + " of " + D + " remain)");
-      this.container = l, this.bits = E, this.valueMask = (1 << E) - 1, E === 32 && (this.valueMask = 4294967295), this.start = W, this.container.msb && (this.start = D - W - E), this.wordMask = c(this.valueMask << this.start), this.property = T;
+      const P = 8 * l.span, W = l.fields.reduce((se, ae) => se + ae.bits, 0);
+      if (E + W > P)
+        throw new Error("bits too long for span remainder (" + (P - W) + " of " + P + " remain)");
+      this.container = l, this.bits = E, this.valueMask = (1 << E) - 1, E === 32 && (this.valueMask = 4294967295), this.start = W, this.container.msb && (this.start = P - W - E), this.wordMask = c(this.valueMask << this.start), this.property = T;
     }
     /** Store a value into the corresponding subsequence of the containing
      * bit field. */
@@ -14557,7 +14557,7 @@ function k_() {
       this.container._packedSetValue(c(E & ~this.wordMask) | T);
     }
   }
-  G.BitField = y;
+  q.BitField = y;
   class A extends y {
     constructor(l, E) {
       super(l, 1, E);
@@ -14573,7 +14573,7 @@ function k_() {
       typeof l == "boolean" && (l = +l), super.encode(l);
     }
   }
-  G.Boolean = A;
+  q.Boolean = A;
   class v extends r {
     constructor(l, E) {
       if (!(l instanceof o && l.isCount() || Number.isInteger(l) && 0 <= l))
@@ -14597,16 +14597,16 @@ function k_() {
      * ExternalLayout} then the length of `src` will be encoded as the
      * count after `src` is encoded. */
     encode(l, E, T) {
-      let D = this.length;
-      if (this.length instanceof o && (D = l.length), !(l instanceof Uint8Array && D === l.length))
-        throw new TypeError(s("Blob.encode", this) + " requires (length " + D + ") Uint8Array as src");
-      if (T + D > E.length)
+      let P = this.length;
+      if (this.length instanceof o && (P = l.length), !(l instanceof Uint8Array && P === l.length))
+        throw new TypeError(s("Blob.encode", this) + " requires (length " + P + ") Uint8Array as src");
+      if (T + P > E.length)
         throw new RangeError("encoding overruns Uint8Array");
       const W = n(l);
-      return n(E).write(W.toString("hex"), T, D, "hex"), this.length instanceof o && this.length.encode(D, E, T), D;
+      return n(E).write(W.toString("hex"), T, P, "hex"), this.length instanceof o && this.length.encode(P, E, T), P;
     }
   }
-  G.Blob = v;
+  q.Blob = v;
   class R extends r {
     constructor(l) {
       super(-1, l);
@@ -14627,14 +14627,14 @@ function k_() {
     /** @override */
     encode(l, E, T = 0) {
       typeof l != "string" && (l = String(l));
-      const D = t.Buffer.from(l, "utf8"), W = D.length;
+      const P = t.Buffer.from(l, "utf8"), W = P.length;
       if (T + W > E.length)
         throw new RangeError("encoding overruns Buffer");
       const se = n(E);
-      return D.copy(se, T), se[T + W] = 0, W + 1;
+      return P.copy(se, T), se[T + W] = 0, W + 1;
     }
   }
-  G.CString = R;
+  q.CString = R;
   class O extends r {
     constructor(l, E) {
       if (typeof l == "string" && E === void 0 && (E = l, l = void 0), l === void 0)
@@ -14657,15 +14657,15 @@ function k_() {
     /** @override */
     encode(l, E, T = 0) {
       typeof l != "string" && (l = String(l));
-      const D = t.Buffer.from(l, "utf8"), W = D.length;
+      const P = t.Buffer.from(l, "utf8"), W = P.length;
       if (0 <= this.maxSpan && this.maxSpan < W)
         throw new RangeError("text length exceeds maxSpan");
       if (T + W > E.length)
         throw new RangeError("encoding overruns Buffer");
-      return D.copy(n(E), T), W;
+      return P.copy(n(E), T), W;
     }
   }
-  G.UTF8 = O;
+  q.UTF8 = O;
   class _ extends r {
     constructor(l, E) {
       super(0, E), this.value = l;
@@ -14679,7 +14679,7 @@ function k_() {
       return 0;
     }
   }
-  return G.Constant = _, G.greedy = ((u, l) => new a(u, l)), G.offset = ((u, l, E) => new d(u, l, E)), G.u8 = ((u) => new m(1, u)), G.u16 = ((u) => new m(2, u)), G.u24 = ((u) => new m(3, u)), G.u32 = ((u) => new m(4, u)), G.u40 = ((u) => new m(5, u)), G.u48 = ((u) => new m(6, u)), G.nu64 = ((u) => new k(u)), G.u16be = ((u) => new g(2, u)), G.u24be = ((u) => new g(3, u)), G.u32be = ((u) => new g(4, u)), G.u40be = ((u) => new g(5, u)), G.u48be = ((u) => new g(6, u)), G.nu64be = ((u) => new K(u)), G.s8 = ((u) => new S(1, u)), G.s16 = ((u) => new S(2, u)), G.s24 = ((u) => new S(3, u)), G.s32 = ((u) => new S(4, u)), G.s40 = ((u) => new S(5, u)), G.s48 = ((u) => new S(6, u)), G.ns64 = ((u) => new Y(u)), G.s16be = ((u) => new I(2, u)), G.s24be = ((u) => new I(3, u)), G.s32be = ((u) => new I(4, u)), G.s40be = ((u) => new I(5, u)), G.s48be = ((u) => new I(6, u)), G.ns64be = ((u) => new j(u)), G.f32 = ((u) => new U(u)), G.f32be = ((u) => new V(u)), G.f64 = ((u) => new J(u)), G.f64be = ((u) => new ne(u)), G.struct = ((u, l, E) => new z(u, l, E)), G.bits = ((u, l, E) => new p(u, l, E)), G.seq = ((u, l, E) => new te(u, l, E)), G.union = ((u, l, E) => new q(u, l, E)), G.unionLayoutDiscriminator = ((u, l) => new F(u, l)), G.blob = ((u, l) => new v(u, l)), G.cstr = ((u) => new R(u)), G.utf8 = ((u, l) => new O(u, l)), G.constant = ((u, l) => new _(u, l)), G;
+  return q.Constant = _, q.greedy = ((u, l) => new a(u, l)), q.offset = ((u, l, E) => new d(u, l, E)), q.u8 = ((u) => new m(1, u)), q.u16 = ((u) => new m(2, u)), q.u24 = ((u) => new m(3, u)), q.u32 = ((u) => new m(4, u)), q.u40 = ((u) => new m(5, u)), q.u48 = ((u) => new m(6, u)), q.nu64 = ((u) => new k(u)), q.u16be = ((u) => new g(2, u)), q.u24be = ((u) => new g(3, u)), q.u32be = ((u) => new g(4, u)), q.u40be = ((u) => new g(5, u)), q.u48be = ((u) => new g(6, u)), q.nu64be = ((u) => new K(u)), q.s8 = ((u) => new S(1, u)), q.s16 = ((u) => new S(2, u)), q.s24 = ((u) => new S(3, u)), q.s32 = ((u) => new S(4, u)), q.s40 = ((u) => new S(5, u)), q.s48 = ((u) => new S(6, u)), q.ns64 = ((u) => new Y(u)), q.s16be = ((u) => new I(2, u)), q.s24be = ((u) => new I(3, u)), q.s32be = ((u) => new I(4, u)), q.s40be = ((u) => new I(5, u)), q.s48be = ((u) => new I(6, u)), q.ns64be = ((u) => new z(u)), q.f32 = ((u) => new U(u)), q.f32be = ((u) => new j(u)), q.f64 = ((u) => new J(u)), q.f64be = ((u) => new ne(u)), q.struct = ((u, l, E) => new V(u, l, E)), q.bits = ((u, l, E) => new p(u, l, E)), q.seq = ((u, l, E) => new te(u, l, E)), q.union = ((u, l, E) => new G(u, l, E)), q.unionLayoutDiscriminator = ((u, l) => new L(u, l)), q.blob = ((u, l) => new v(u, l)), q.cstr = ((u) => new R(u)), q.utf8 = ((u, l) => new O(u, l)), q.constant = ((u, l) => new _(u, l)), q;
 }
 var B = k_(), U_ = 1, L_ = 2, D_ = 3, P_ = 4, F_ = 5, $_ = 6, z_ = 7, j_ = 8, V_ = 9, H_ = 10, G_ = -32700, q_ = -32603, K_ = -32602, W_ = -32601, Z_ = -32600, Y_ = -32016, J_ = -32015, X_ = -32014, Q_ = -32013, eE = -32012, tE = -32011, nE = -32010, rE = -32009, sE = -32008, iE = -32007, oE = -32006, aE = -32005, cE = -32004, uE = -32003, dE = -32002, lE = -32001, fE = 28e5, hE = 2800001, pE = 2800002, mE = 2800003, gE = 2800004, yE = 2800005, bE = 2800006, _E = 2800007, EE = 2800008, wE = 2800009, vE = 2800010, RE = 2800011, AE = 323e4, SE = 32300001, xE = 3230002, TE = 3230003, IE = 3230004, OE = 361e4, NE = 3610001, CE = 3610002, ME = 3610003, BE = 3610004, kE = 3610005, UE = 3610006, LE = 3610007, DE = 3611e3, PE = 3704e3, FE = 3704001, $E = 3704002, zE = 3704003, jE = 3704004, VE = 4128e3, HE = 4128001, GE = 4128002, qE = 4615e3, KE = 4615001, WE = 4615002, ZE = 4615003, YE = 4615004, JE = 4615005, XE = 4615006, QE = 4615007, ew = 4615008, tw = 4615009, nw = 4615010, rw = 4615011, sw = 4615012, iw = 4615013, ow = 4615014, aw = 4615015, cw = 4615016, uw = 4615017, dw = 4615018, lw = 4615019, fw = 4615020, hw = 4615021, pw = 4615022, mw = 4615023, gw = 4615024, yw = 4615025, bw = 4615026, _w = 4615027, Ew = 4615028, ww = 4615029, vw = 4615030, Rw = 4615031, Aw = 4615032, Sw = 4615033, xw = 4615034, Tw = 4615035, Iw = 4615036, Ow = 4615037, Nw = 4615038, Cw = 4615039, Mw = 4615040, Bw = 4615041, kw = 4615042, Uw = 4615043, Lw = 4615044, Dw = 4615045, Pw = 4615046, Fw = 4615047, $w = 4615048, zw = 4615049, jw = 4615050, Vw = 4615051, Hw = 4615052, Gw = 4615053, qw = 4615054, Kw = 5508e3, Ww = 5508001, Zw = 5508002, Yw = 5508003, Jw = 5508004, Xw = 5508005, Qw = 5508006, ev = 5508007, tv = 5508008, nv = 5508009, rv = 5508010, sv = 5508011, iv = 5663e3, ov = 5663001, av = 5663002, cv = 5663003, uv = 5663004, dv = 5663005, lv = 5663006, fv = 5663007, hv = 5663008, pv = 5663009, mv = 5663010, gv = 5663011, yv = 5663012, bv = 5663013, _v = 5663014, Ev = 5663015, wv = 5663016, vv = 5663017, Rv = 5663018, Av = 5663019, Sv = 5663020, xv = 705e4, Tv = 7050001, Iv = 7050002, Ov = 7050003, Nv = 7050004, Cv = 7050005, Mv = 7050006, Bv = 7050007, kv = 7050008, Uv = 7050009, Lv = 7050010, Dv = 7050011, Pv = 7050012, Fv = 7050013, $v = 7050014, zv = 7050015, jv = 7050016, Vv = 7050017, Hv = 7050018, Gv = 7050019, qv = 7050020, Kv = 7050021, Wv = 7050022, Zv = 7050023, Yv = 7050024, Jv = 7050025, Xv = 7050026, Qv = 7050027, eR = 7050028, tR = 7050029, nR = 7050030, rR = 7050031, sR = 7050032, iR = 7050033, oR = 7050034, aR = 7050035, cR = 7050036, wh = 8078e3, vh = 8078001, uR = 8078002, dR = 8078003, Rh = 8078004, Ah = 8078005, Sh = 8078006, lR = 8078007, fR = 8078008, hR = 8078009, pR = 8078010, xh = 8078011, mR = 8078012, gR = 8078013, yR = 8078014, bR = 8078015, _R = 8078016, ER = 8078017, wR = 8078018, vR = 8078019, RR = 8078020, AR = 8078021, SR = 8078022, xR = 81e5, TR = 8100001, IR = 8100002, OR = 8100003, NR = 819e4, CR = 8190001, MR = 8190002, BR = 8190003, kR = 8190004, UR = 99e5, LR = 9900001, DR = 9900002, PR = 9900003, FR = 9900004;
 function Th(t) {
@@ -15621,13 +15621,13 @@ function xA(t) {
   for (var S = 0; S < o; ++S) {
     for (var I = new Uint32Array(80), N = 0; N < 16; ++N)
       I[N] = a[S][N];
-    for (var P = 16; P < 80; ++P)
-      I[P] = va(I[P - 3] ^ I[P - 8] ^ I[P - 14] ^ I[P - 16], 1);
-    for (var M = n[0], k = n[1], K = n[2], Y = n[3], j = n[4], U = 0; U < 80; ++U) {
-      var V = Math.floor(U / 20), J = va(M, 5) + SA(V, k, K, Y) + j + e[V] + I[U] >>> 0;
-      j = Y, Y = K, K = va(k, 30) >>> 0, k = M, M = J;
+    for (var F = 16; F < 80; ++F)
+      I[F] = va(I[F - 3] ^ I[F - 8] ^ I[F - 14] ^ I[F - 16], 1);
+    for (var M = n[0], k = n[1], K = n[2], Y = n[3], z = n[4], U = 0; U < 80; ++U) {
+      var j = Math.floor(U / 20), J = va(M, 5) + SA(j, k, K, Y) + z + e[j] + I[U] >>> 0;
+      z = Y, Y = K, K = va(k, 30) >>> 0, k = M, M = J;
     }
-    n[0] = n[0] + M >>> 0, n[1] = n[1] + k >>> 0, n[2] = n[2] + K >>> 0, n[3] = n[3] + Y >>> 0, n[4] = n[4] + j >>> 0;
+    n[0] = n[0] + M >>> 0, n[1] = n[1] + k >>> 0, n[2] = n[2] + K >>> 0, n[3] = n[3] + Y >>> 0, n[4] = n[4] + z >>> 0;
   }
   return [n[0] >> 24 & 255, n[0] >> 16 & 255, n[0] >> 8 & 255, n[0] & 255, n[1] >> 24 & 255, n[1] >> 16 & 255, n[1] >> 8 & 255, n[1] & 255, n[2] >> 24 & 255, n[2] >> 16 & 255, n[2] >> 8 & 255, n[2] & 255, n[3] >> 24 & 255, n[3] >> 16 & 255, n[3] >> 8 & 255, n[3] & 255, n[4] >> 24 & 255, n[4] >> 16 & 255, n[4] >> 8 & 255, n[4] & 255];
 }
@@ -16162,16 +16162,16 @@ class Hr {
       const {
         accounts: I,
         programIdIndex: N
-      } = S, P = Array.from(Ft.decode(S.data));
+      } = S, F = Array.from(Ft.decode(S.data));
       let M = [];
       Wt(M, I.length);
       let k = [];
-      return Wt(k, P.length), {
+      return Wt(k, F.length), {
         programIdIndex: N,
         keyIndicesCount: Te.Buffer.from(M),
         keyIndices: I,
         dataLength: Te.Buffer.from(k),
-        data: P
+        data: F
       };
     });
     let s = [];
@@ -16212,7 +16212,7 @@ class Hr {
     const d = Zt(n, 0, jn), m = Kt(n);
     let g = [];
     for (let I = 0; I < m; I++) {
-      const N = Sn(n), P = Kt(n), M = Zt(n, 0, P), k = Kt(n), K = Zt(n, 0, k), Y = Ft.encode(Te.Buffer.from(K));
+      const N = Sn(n), F = Kt(n), M = Zt(n, 0, F), k = Kt(n), K = Zt(n, 0, k), Y = Ft.encode(Te.Buffer.from(K));
       g.push({
         programIdIndex: N,
         accounts: M,
@@ -16305,9 +16305,9 @@ class Zi {
       if (S !== void 0) {
         const [I, {
           writable: N,
-          readonly: P
+          readonly: F
         }] = S;
-        r.push(I), s.writable.push(...N), s.readonly.push(...P);
+        r.push(I), s.writable.push(...N), s.readonly.push(...F);
       }
     }
     const [o, a] = n.getMessageComponents(), m = new Wi(a, s).compileInstructions(e.instructions);
@@ -16388,24 +16388,24 @@ class Zi {
       numReadonlySignedAccounts: Sn(n),
       numReadonlyUnsignedAccounts: Sn(n)
     }, a = [], d = Kt(n);
-    for (let P = 0; P < d; P++)
+    for (let F = 0; F < d; F++)
       a.push(new Ee(Zt(n, 0, jn)));
     const m = Ft.encode(Zt(n, 0, jn)), g = Kt(n), S = [];
-    for (let P = 0; P < g; P++) {
-      const M = Sn(n), k = Kt(n), K = Zt(n, 0, k), Y = Kt(n), j = new Uint8Array(Zt(n, 0, Y));
+    for (let F = 0; F < g; F++) {
+      const M = Sn(n), k = Kt(n), K = Zt(n, 0, k), Y = Kt(n), z = new Uint8Array(Zt(n, 0, Y));
       S.push({
         programIdIndex: M,
         accountKeyIndexes: K,
-        data: j
+        data: z
       });
     }
     const I = Kt(n), N = [];
-    for (let P = 0; P < I; P++) {
-      const M = new Ee(Zt(n, 0, jn)), k = Kt(n), K = Zt(n, 0, k), Y = Kt(n), j = Zt(n, 0, Y);
+    for (let F = 0; F < I; F++) {
+      const M = new Ee(Zt(n, 0, jn)), k = Kt(n), K = Zt(n, 0, k), Y = Kt(n), z = Zt(n, 0, Y);
       N.push({
         accountKey: M,
         writableIndexes: K,
-        readonlyIndexes: j
+        readonlyIndexes: z
       });
     }
     return new Zi({
@@ -16607,7 +16607,7 @@ class Yi {
     }) => {
       k ? (S.push(M.toString()), d += 1, K || (m += 1)) : (I.push(M.toString()), K || (g += 1));
     });
-    const N = S.concat(I), P = n.map((M) => {
+    const N = S.concat(I), F = n.map((M) => {
       const {
         data: k,
         programId: K
@@ -16618,7 +16618,7 @@ class Yi {
         data: Ft.encode(k)
       };
     });
-    return P.forEach((M) => {
+    return F.forEach((M) => {
       bt(M.programIdIndex >= 0), M.accounts.forEach((k) => bt(k >= 0));
     }), new Hr({
       header: {
@@ -16628,7 +16628,7 @@ class Yi {
       },
       accountKeys: N,
       recentBlockhash: e,
-      instructions: P
+      instructions: F
     });
   }
   /**
@@ -20329,9 +20329,19 @@ const Q = {
     ...Vx,
     tokens: _t[xe.STARKNET_TESTNET]
   }
-};
-new Set(Object.values(xe));
-async function OT(t, e, n) {
+}, OT = new Set(Object.values(xe));
+function NT(t) {
+  if (CT(t))
+    return t;
+  const e = xe[t];
+  if (!e)
+    throw new Error(`Invalid chain: ${t}. Chain must be a valid chain alias or internal chain value from Chains.`);
+  return e;
+}
+function CT(t) {
+  return OT.has(t);
+}
+async function MT(t, e, n) {
   if (!n || !e)
     throw new Error("Wagmi config not found");
   const r = await P1(e, {
@@ -20349,7 +20359,7 @@ async function OT(t, e, n) {
     });
   }
 }
-async function NT(t, e, n) {
+async function BT(t, e, n) {
   if (!n || !e)
     throw new Error("Wagmi config not found");
   await j1(e);
@@ -20363,7 +20373,7 @@ async function NT(t, e, n) {
     t.current?.contentWindow?.postMessage(r, s);
   });
 }
-async function CT(t, e, n, r, s) {
+async function kT(t, e, n, r, s) {
   if (!n || !e)
     throw new Error("Wagmi config not found");
   let i = null;
@@ -20392,13 +20402,13 @@ async function CT(t, e, n, r, s) {
   }
   return i;
 }
-async function MT(t) {
+async function UT(t) {
   if (!t)
     throw new Error("Wagmi config not found");
   const e = new Set(V1(t).map((r) => r.id));
   return Object.entries(IT).filter(([, r]) => !e.has(r.chainId)).map(([r]) => r);
 }
-function BT() {
+function LT() {
   return /* @__PURE__ */ is("div", {
     role: "status",
     className: "payment-modal-loader",
@@ -20418,8 +20428,8 @@ function BT() {
     })
   });
 }
-const kT = ["light", "dark", "system"], gi = "https://app.chainrails.io", yi = "https://chainrails-frontend-git-staging-horus-labs.vercel.app";
-function AI(t) {
+const DT = ["light", "dark", "system"], gi = "https://app.chainrails.io", yi = "https://chainrails-frontend-git-staging-horus-labs.vercel.app";
+function TI(t) {
   const {
     amount: e,
     styles: n,
@@ -20434,7 +20444,7 @@ function AI(t) {
     sessionToken: S,
     farcasterMiniApp: I,
     wagmiConfig: N
-  } = t, [P, M] = Fn(0), [k, K] = Fn(""), [Y, j] = Fn(null), U = gc(null);
+  } = t, [F, M] = Fn(0), [k, K] = Fn(""), [Y, z] = Fn(null), U = gc(null);
   Xn.config({
     api_key: "",
     // @ts-expect-error
@@ -20443,19 +20453,19 @@ function AI(t) {
     K(Xn.getPayModalUrl(e));
   }, [e]), Jn(() => {
     const J = n?.theme;
-    if (!J || kT.includes(J)) {
-      j(null);
+    if (!J || DT.includes(J)) {
+      z(null);
       return;
     }
     let ne = !1;
     return (async () => {
       try {
-        const z = Xn.getBaseUrl(), C = await fetch(`${z}/themes/${J}`);
+        const V = Xn.getBaseUrl(), C = await fetch(`${V}/themes/${J}`);
         if (!C.ok) return;
-        const F = await C.json();
-        !ne && F.status === "approved" && F.cssContent && j(F.cssContent);
-      } catch (z) {
-        console.error("Failed to fetch theme:", z);
+        const L = await C.json();
+        !ne && L.status === "approved" && L.cssContent && z(L.cssContent);
+      } catch (V) {
+        console.error("Failed to fetch theme:", V);
       }
     })(), () => {
       ne = !0;
@@ -20464,37 +20474,44 @@ function AI(t) {
     const J = document.body.style.overflow;
     s ? (document.body.style.overflow = "hidden", document.body.style.overflow = "hidden") : document.body.style.overflow = J || "";
     const ne = async (te) => {
-      if (te.data === ln.CLOSED && (a(), d?.()), te.data === ln.COMPLETED && (window.setTimeout(a, 2e3), m?.()), te.data === ln.REQUEST_FARCASTER_CONNECT)
+      if (te.data === ln.CLOSED && (a(), d?.()), te?.data?.type === ln.COMPLETED) {
+        window.setTimeout(a, 2e3);
+        const L = te?.data?.transactionHash ? {
+          transactionHash: te.data.transactionHash
+        } : void 0;
+        m?.(L);
+      }
+      if (te.data === ln.REQUEST_FARCASTER_CONNECT)
         try {
-          await OT(U, N, I);
-        } catch (C) {
-          console.error(C);
+          await MT(U, N, I);
+        } catch (L) {
+          console.error(L);
         }
       if (te.data === ln.REQUEST_FARCASTER_DISCONNECT)
         try {
-          await NT(U, N, I);
-        } catch (C) {
-          console.error(C);
+          await BT(U, N, I);
+        } catch (L) {
+          console.error(L);
         }
-      const z = te.data;
-      if (z?.type === ln.REQUEST_FARCASTER_SEND_TRANSACTION && typeof z.requestId == "string" && z.params)
+      const C = te.data;
+      if (C?.type === ln.REQUEST_FARCASTER_SEND_TRANSACTION && typeof C.requestId == "string" && C.params)
         try {
-          const C = await CT(z.params, N, I, U.current, z.requestId);
-          C ? [gi, yi].forEach((F) => {
+          const L = await kT(C.params, N, I, U.current, C.requestId);
+          L ? [gi, yi].forEach((G) => {
             U.current?.contentWindow?.postMessage({
               type: ln.FARCASTER_SEND_TRANSACTION_RESULT,
-              requestId: z.requestId,
-              hash: C
-            }, F);
-          }) : [gi, yi].forEach((F) => {
+              requestId: C.requestId,
+              hash: L
+            }, G);
+          }) : [gi, yi].forEach((G) => {
             U.current?.contentWindow?.postMessage({
               type: ln.FARCASTER_SEND_TRANSACTION_RESULT,
-              requestId: z.requestId,
+              requestId: C.requestId,
               error: "sendTransaction not configured or returned no hash"
-            }, F);
+            }, G);
           });
-        } catch (C) {
-          console.log(C);
+        } catch (L) {
+          console.log(L);
         }
     };
     return window.addEventListener("message", ne), () => {
@@ -20503,15 +20520,15 @@ function AI(t) {
   }, [s, d, m, a, I, N]), Jn(() => {
     if (!S) return;
     const J = t.css || Y || void 0, ne = async () => {
-      const z = await g0.isInMiniApp(), C = z ? await MT(N) : [], q = [...r || [], ...C];
+      const V = await g0.isInMiniApp(), C = V ? await UT(N) : [], G = [...r?.map(NT) || [], ...C];
       return {
         type: "session",
         session_token: S,
         environment: Xn.getEnv() || Ec.PRODUCTION,
         styles: n,
         props: {
-          excludeChains: q.join(","),
-          isFarcasterMiniApp: z
+          excludeChains: G.join(","),
+          isFarcasterMiniApp: V
         },
         ...J ? {
           css: J
@@ -20519,43 +20536,43 @@ function AI(t) {
       };
     };
     let te = !1;
-    return ne().then((z) => {
+    return ne().then((V) => {
       te || ([gi, yi].forEach((C) => {
-        U.current?.contentWindow?.postMessage(z, C);
+        U.current?.contentWindow?.postMessage(V, C);
       }), window.setTimeout(() => {
         te || [gi, yi].forEach((C) => {
-          U.current?.contentWindow?.postMessage(z, C);
+          U.current?.contentWindow?.postMessage(V, C);
         });
       }, 1e3));
     }), () => {
       te = !0;
     };
-  }, [S, P, s, n, Y]);
-  function V() {
+  }, [S, F, s, n, Y]);
+  function j() {
     M(Math.random());
   }
   return /* @__PURE__ */ El("div", {
-    className: um("payment-modal-wrapper", P === 0 || i ? "loading" : "not-loading", s ? "open" : "closed"),
-    children: [(P === 0 || i) && /* @__PURE__ */ is(BT, {}), /* @__PURE__ */ is("iframe", {
+    className: um("payment-modal-wrapper", F === 0 || i ? "loading" : "not-loading", s ? "open" : "closed"),
+    children: [(F === 0 || i) && /* @__PURE__ */ is(LT, {}), /* @__PURE__ */ is("iframe", {
       allow: "clipboard-read *; clipboard-write *",
       src: k || void 0,
-      onLoad: V,
-      className: `payment-modal ${P === 0 || i ? "invisible" : "visible"}`,
+      onLoad: j,
+      className: `payment-modal ${F === 0 || i ? "invisible" : "visible"}`,
       "data-id": e,
       ref: U
     }, e)]
   });
 }
-const UT = Symbol(), Eu = Symbol(), ss = "a", N0 = "f", ml = "p", C0 = "c", M0 = "t", wu = "h", as = "w", vu = "o", Ru = "k";
-let LT = (t, e) => new Proxy(t, e);
-const pc = Object.getPrototypeOf, mc = /* @__PURE__ */ new WeakMap(), B0 = (t) => t && (mc.has(t) ? mc.get(t) : pc(t) === Object.prototype || pc(t) === Array.prototype), no = (t) => typeof t == "object" && t !== null, DT = (t) => Object.values(Object.getOwnPropertyDescriptors(t)).some((e) => !e.configurable && !e.writable), PT = (t) => {
+const PT = Symbol(), Eu = Symbol(), ss = "a", N0 = "f", ml = "p", C0 = "c", M0 = "t", wu = "h", as = "w", vu = "o", Ru = "k";
+let FT = (t, e) => new Proxy(t, e);
+const pc = Object.getPrototypeOf, mc = /* @__PURE__ */ new WeakMap(), B0 = (t) => t && (mc.has(t) ? mc.get(t) : pc(t) === Object.prototype || pc(t) === Array.prototype), no = (t) => typeof t == "object" && t !== null, $T = (t) => Object.values(Object.getOwnPropertyDescriptors(t)).some((e) => !e.configurable && !e.writable), zT = (t) => {
   if (Array.isArray(t))
     return Array.from(t);
   const e = Object.getOwnPropertyDescriptors(t);
   return Object.values(e).forEach((n) => {
     n.configurable = !0;
   }), Object.create(pc(t), e);
-}, FT = (t, e) => {
+}, jT = (t, e) => {
   const n = {
     [N0]: e
   };
@@ -20577,7 +20594,7 @@ const pc = Object.getPrototypeOf, mc = /* @__PURE__ */ new WeakMap(), B0 = (t) =
       return d === Eu ? t : (s(Ru, d), k0(Reflect.get(a, d), n[ss], n[C0], n[M0]));
     },
     has(a, d) {
-      return d === UT ? (i(), !0) : (s(wu, d), Reflect.has(a, d));
+      return d === PT ? (i(), !0) : (s(wu, d), Reflect.has(a, d));
     },
     getOwnPropertyDescriptor(a, d) {
       return s(vu, d), Reflect.getOwnPropertyDescriptor(a, d);
@@ -20597,12 +20614,12 @@ const pc = Object.getPrototypeOf, mc = /* @__PURE__ */ new WeakMap(), B0 = (t) =
   let s = r && r.get(t);
   if (!s) {
     const d = Au(t);
-    DT(d) ? s = [d, PT(d)] : s = [d], r?.set(t, s);
+    $T(d) ? s = [d, zT(d)] : s = [d], r?.set(t, s);
   }
   const [i, o] = s;
   let a = n && n.get(i);
-  return (!a || a[1][N0] !== !!o) && (a = FT(i, !!o), a[1][ml] = LT(o || i, a[0]), n && n.set(i, a)), a[1][ss] = e, a[1][C0] = n, a[1][M0] = r, a[1][ml];
-}, $T = (t, e) => {
+  return (!a || a[1][N0] !== !!o) && (a = jT(i, !!o), a[1][ml] = FT(o || i, a[0]), n && n.set(i, a)), a[1][ss] = e, a[1][C0] = n, a[1][M0] = r, a[1][ml];
+}, VT = (t, e) => {
   const n = Reflect.ownKeys(t), r = Reflect.ownKeys(e);
   return n.length !== r.length || n.some((s, i) => s !== r[i]);
 }, U0 = (t, e, n, r, s = Object.is) => {
@@ -20623,7 +20640,7 @@ const pc = Object.getPrototypeOf, mc = /* @__PURE__ */ new WeakMap(), B0 = (t) =
     if (o = Reflect.has(t, a) !== Reflect.has(e, a), o)
       return o;
   if (i[as] === !0) {
-    if (o = $T(t, e), o)
+    if (o = VT(t, e), o)
       return o;
   } else
     for (const a of i[vu] || []) {
@@ -20637,9 +20654,9 @@ const pc = Object.getPrototypeOf, mc = /* @__PURE__ */ new WeakMap(), B0 = (t) =
   if (o === null)
     throw new Error("invalid used");
   return o;
-}, zT = (t) => B0(t) && t[Eu] || null, gl = (t, e = !0) => {
+}, HT = (t) => B0(t) && t[Eu] || null, gl = (t, e = !0) => {
   mc.set(t, e);
-}, jT = (t, e, n) => {
+}, GT = (t, e, n) => {
   const r = [], s = /* @__PURE__ */ new WeakSet(), i = (o, a) => {
     var d, m, g;
     if (s.has(o))
@@ -20664,7 +20681,7 @@ const pc = Object.getPrototypeOf, mc = /* @__PURE__ */ new WeakMap(), B0 = (t) =
     } else a && r.push(a);
   };
   return i(t), r;
-}, ro = {}, Su = (t) => typeof t == "object" && t !== null, VT = (t) => Su(t) && !xu.has(t) && (Array.isArray(t) || !(Symbol.iterator in t)) && !(t instanceof WeakMap) && !(t instanceof WeakSet) && !(t instanceof Error) && !(t instanceof Number) && !(t instanceof Date) && !(t instanceof String) && !(t instanceof RegExp) && !(t instanceof ArrayBuffer) && !(t instanceof Promise), L0 = (t, e) => {
+}, ro = {}, Su = (t) => typeof t == "object" && t !== null, qT = (t) => Su(t) && !xu.has(t) && (Array.isArray(t) || !(Symbol.iterator in t)) && !(t instanceof WeakMap) && !(t instanceof WeakSet) && !(t instanceof Error) && !(t instanceof Number) && !(t instanceof Date) && !(t instanceof String) && !(t instanceof RegExp) && !(t instanceof ArrayBuffer) && !(t instanceof Promise), L0 = (t, e) => {
   const n = yl.get(t);
   if (n?.[0] === e)
     return n[1];
@@ -20692,7 +20709,7 @@ const pc = Object.getPrototypeOf, mc = /* @__PURE__ */ new WeakMap(), B0 = (t) =
     }
     Object.defineProperty(r, s, a);
   }), Object.preventExtensions(r);
-}, HT = (t, e, n, r) => ({
+}, KT = (t, e, n, r) => ({
   deleteProperty(s, i) {
     const o = Reflect.get(s, i);
     n(i);
@@ -20703,12 +20720,12 @@ const pc = Object.getPrototypeOf, mc = /* @__PURE__ */ new WeakMap(), B0 = (t) =
     const d = !t() && Reflect.has(s, i), m = Reflect.get(s, i, a);
     if (d && (bl(m, o) || so.has(o) && bl(m, so.get(o))))
       return !0;
-    n(i), Su(o) && (o = zT(o) || o);
-    const g = !lr.has(o) && qT(o) ? D0(o) : o;
+    n(i), Su(o) && (o = HT(o) || o);
+    const g = !lr.has(o) && ZT(o) ? D0(o) : o;
     return e(i, g), Reflect.set(s, i, g, a), r(["set", [i], o, m]), !0;
   }
 }), lr = /* @__PURE__ */ new WeakMap(), xu = /* @__PURE__ */ new WeakSet(), yl = /* @__PURE__ */ new WeakMap(), Oa = [1], so = /* @__PURE__ */ new WeakMap();
-let bl = Object.is, GT = (t, e) => new Proxy(t, e), qT = VT, KT = L0, WT = HT;
+let bl = Object.is, WT = (t, e) => new Proxy(t, e), ZT = qT, YT = L0, JT = KT;
 function D0(t = {}) {
   if (!Su(t))
     throw new Error("object required");
@@ -20724,16 +20741,16 @@ function D0(t = {}) {
     const Y = K[1](k);
     Y > n && (n = Y);
   })), n), a = (k) => (K, Y) => {
-    const j = [...K];
-    j[1] = [k, ...j[1]], s(j, Y);
+    const z = [...K];
+    z[1] = [k, ...z[1]], s(z, Y);
   }, d = /* @__PURE__ */ new Map(), m = (k, K) => {
     const Y = !xu.has(K) && lr.get(K);
     if (Y) {
       if ((ro ? "production" : void 0) !== "production" && d.has(k))
         throw new Error("prop listener already exists");
       if (r.size) {
-        const j = Y[2](a(k));
-        d.set(k, [Y, j]);
+        const z = Y[2](a(k));
+        d.set(k, [Y, z]);
       } else
         d.set(k, [Y]);
     }
@@ -20741,34 +20758,34 @@ function D0(t = {}) {
     var K;
     const Y = d.get(k);
     Y && (d.delete(k), (K = Y[1]) == null || K.call(Y));
-  }, S = (k) => (r.add(k), r.size === 1 && d.forEach(([Y, j], U) => {
-    if ((ro ? "production" : void 0) !== "production" && j)
+  }, S = (k) => (r.add(k), r.size === 1 && d.forEach(([Y, z], U) => {
+    if ((ro ? "production" : void 0) !== "production" && z)
       throw new Error("remove already exists");
-    const V = Y[2](a(U));
-    d.set(U, [Y, V]);
+    const j = Y[2](a(U));
+    d.set(U, [Y, j]);
   }), () => {
-    r.delete(k), r.size === 0 && d.forEach(([Y, j], U) => {
-      j && (j(), d.set(U, [Y]));
+    r.delete(k), r.size === 0 && d.forEach(([Y, z], U) => {
+      z && (z(), d.set(U, [Y]));
     });
   });
   let I = !0;
-  const N = WT(
+  const N = JT(
     () => I,
     m,
     g,
     s
-  ), P = GT(t, N);
-  so.set(t, P);
+  ), F = WT(t, N);
+  so.set(t, F);
   const M = [t, o, S];
-  return lr.set(P, M), Reflect.ownKeys(t).forEach((k) => {
+  return lr.set(F, M), Reflect.ownKeys(t).forEach((k) => {
     const K = Object.getOwnPropertyDescriptor(
       t,
       k
     );
-    "value" in K && K.writable && (P[k] = t[k]);
-  }), I = !1, P;
+    "value" in K && K.writable && (F[k] = t[k]);
+  }), I = !1, F;
 }
-function ZT(t, e, n) {
+function XT(t, e, n) {
   const r = lr.get(t);
   (ro ? "production" : void 0) !== "production" && !r && console.warn("Please use proxy object");
   let s;
@@ -20787,15 +20804,15 @@ function _l(t) {
   const e = lr.get(t);
   (ro ? "production" : void 0) !== "production" && !e && console.warn("Please use proxy object");
   const [n, r] = e;
-  return KT(n, r());
+  return YT(n, r());
 }
-const YT = {}, JT = (t, e) => {
+const QT = {}, eI = (t, e) => {
   const n = gc(void 0);
   Jn(() => {
-    n.current = jT(t, e);
+    n.current = GT(t, e);
   }), z0(n.current);
-}, XT = JT, QT = /* @__PURE__ */ new WeakMap();
-function eI(t, e) {
+}, tI = eI, nI = /* @__PURE__ */ new WeakMap();
+function rI(t, e) {
   const r = Uu(
     () => t && /* @__PURE__ */ new WeakMap(),
     [t]
@@ -20804,7 +20821,7 @@ function eI(t, e) {
   const o = P0(
     F0(
       (d) => {
-        const m = ZT(t, d);
+        const m = XT(t, d);
         return d(), m;
       },
       [t, void 0]
@@ -20827,23 +20844,23 @@ function eI(t, e) {
   );
   i = !1, $0(() => {
     s.current = o;
-  }), (YT ? "production" : void 0) !== "production" && XT(o, r);
+  }), (QT ? "production" : void 0) !== "production" && tI(o, r);
   const a = Uu(() => /* @__PURE__ */ new WeakMap(), []);
-  return k0(o, r, a, QT);
+  return k0(o, r, a, nI);
 }
 const kn = D0({
   data: null,
   isPending: !1,
   error: null
 });
-function SI({
+function II({
   session_url: t,
   onCancel: e,
   onSuccess: n,
   farcasterMiniApp: r,
   wagmiConfig: s
 }) {
-  const i = eI(kn), [o, a] = Fn(!1), [d, m] = Fn(Date.now()), g = i?.data?.sessionToken, S = i?.data?.amount;
+  const i = rI(kn), [o, a] = Fn(!1), [d, m] = Fn(Date.now()), g = i?.data?.sessionToken, S = i?.data?.amount;
   function I() {
     g || window.setTimeout(() => {
       g && a(!0);
@@ -20852,7 +20869,7 @@ function SI({
   function N() {
     a(!1);
   }
-  const P = () => {
+  const F = () => {
     const M = Date.now();
     kn.isPending = !0, kn.error = null, kn.data = null, fetch(t, {
       headers: {
@@ -20861,11 +20878,11 @@ function SI({
     }).then((k) => k.json()).then((k) => {
       M < d || (kn.data = k, kn.isPending = !1, m(M));
     }).catch((k) => {
-      M < d || (kn.error = k?.toString(), kn.isPending = !1, m(M), setInterval(P, 5e3));
+      M < d || (kn.error = k?.toString(), kn.isPending = !1, m(M), setInterval(F, 5e3));
     });
   };
   return Jn(() => {
-    P();
+    F();
   }, [t]), {
     sessionToken: g,
     amount: S,
@@ -20875,14 +20892,14 @@ function SI({
     close: N,
     isPending: i.isPending,
     error: i.error,
-    refetch: P,
+    refetch: F,
     onSuccess: n,
     onCancel: e,
     farcasterMiniApp: r,
     wagmiConfig: s
   };
 }
-function xI({
+function OI({
   sessionToken: t,
   amount: e,
   onCancel: n,
@@ -20905,7 +20922,7 @@ function xI({
       d && a(!0);
     }, 200), a(!0);
   }
-  function P() {
+  function F() {
     a(!1);
   }
   return {
@@ -20914,7 +20931,7 @@ function xI({
     amount: g,
     isOpen: o,
     open: N,
-    close: P,
+    close: F,
     onSuccess: r,
     onCancel: n,
     farcasterMiniApp: s,
@@ -20924,11 +20941,11 @@ function xI({
 export {
   X as AmountSymbols,
   Xn as Chainrails,
-  rI as Chains,
-  AI as PaymentModal,
-  rI as chains,
-  mI as crapi,
+  oI as Chains,
+  TI as PaymentModal,
+  oI as chains,
+  bI as crapi,
   X as tokens,
-  xI as usePaymentModal,
-  SI as usePaymentSession
+  OI as usePaymentModal,
+  II as usePaymentSession
 };