@chainrails/react 0.4.4 → 0.4.5

package/dist/chainrails-sdk.es.js

@@ -3037,10 +3037,10 @@ function Ag(t, e, { length: n, staticPosition: r }) {
     const O = [];
     for (let N = 0; N < m; ++N) {
       t.setPosition(d + (g ? N * 32 : x));
-      const [F, C] = Tr(t, e, {
+      const [F, M] = Tr(t, e, {
         staticPosition: d
       });
-      x += C, O.push(F);
+      x += M, O.push(F);
     }
     return t.setPosition(r + 32), [O, 32];
   }
@@ -5095,13 +5095,13 @@ class Ly extends Of {
     for (let x = 0; x < 16; x++, n += 4)
       Mn[x] = e.getUint32(n, !1);
     for (let x = 16; x < 64; x++) {
-      const O = Mn[x - 15], N = Mn[x - 2], F = on(O, 7) ^ on(O, 18) ^ O >>> 3, C = on(N, 17) ^ on(N, 19) ^ N >>> 10;
-      Mn[x] = C + Mn[x - 7] + F + Mn[x - 16] | 0;
+      const O = Mn[x - 15], N = Mn[x - 2], F = on(O, 7) ^ on(O, 18) ^ O >>> 3, M = on(N, 17) ^ on(N, 19) ^ N >>> 10;
+      Mn[x] = M + Mn[x - 7] + F + Mn[x - 16] | 0;
     }
     let { A: r, B: s, C: i, D: o, E: a, F: d, G: m, H: g } = this;
     for (let x = 0; x < 64; x++) {
-      const O = on(a, 6) ^ on(a, 11) ^ on(a, 25), N = g + O + My(a, d, m) + ky[x] + Mn[x] | 0, C = (on(r, 2) ^ on(r, 13) ^ on(r, 22)) + By(r, s, i) | 0;
-      g = m, m = d, d = a, a = o + N | 0, o = i, i = s, s = r, r = N + C | 0;
+      const O = on(a, 6) ^ on(a, 11) ^ on(a, 25), N = g + O + My(a, d, m) + ky[x] + Mn[x] | 0, M = (on(r, 2) ^ on(r, 13) ^ on(r, 22)) + By(r, s, i) | 0;
+      g = m, m = d, d = a, a = o + N | 0, o = i, i = s, s = r, r = N + M | 0;
     }
     r = r + this.A | 0, s = s + this.B | 0, i = i + this.C | 0, o = o + this.D | 0, a = a + this.E | 0, d = d + this.F | 0, m = m + this.G | 0, g = g + this.H | 0, this.set(r, s, i, o, a, d, m, g);
   }
@@ -5200,28 +5200,28 @@ class Dy extends Of {
   }
   // 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: x, Fl: O, Gh: N, Gl: F, Hh: C, Hl: k } = this;
-    return [e, n, r, s, i, o, a, d, m, g, x, O, N, F, C, k];
+    const { Ah: e, Al: n, Bh: r, Bl: s, Ch: i, Cl: o, Dh: a, Dl: d, Eh: m, El: g, Fh: x, Fl: O, Gh: N, Gl: F, Hh: M, Hl: k } = this;
+    return [e, n, r, s, i, o, a, d, m, g, x, O, N, F, M, k];
   }
   // prettier-ignore
-  set(e, n, r, s, i, o, a, d, m, g, x, O, N, F, C, 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 = x | 0, this.Fl = O | 0, this.Gh = N | 0, this.Gl = F | 0, this.Hh = C | 0, this.Hl = k | 0;
+  set(e, n, r, s, i, o, a, d, m, g, x, O, 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 = x | 0, this.Fl = O | 0, this.Gh = N | 0, this.Gl = F | 0, this.Hh = M | 0, this.Hl = k | 0;
   }
   process(e, n) {
     for (let V = 0; V < 16; V++, n += 4)
       Bn[V] = e.getUint32(n), kn[V] = e.getUint32(n += 4);
     for (let V = 16; V < 80; V++) {
-      const L = Bn[V - 15] | 0, z = kn[V - 15] | 0, J = gr(L, z, 1) ^ gr(L, z, 8) ^ Wu(L, z, 7), te = yr(L, z, 1) ^ yr(L, z, 8) ^ Zu(L, z, 7), ne = Bn[V - 2] | 0, q = kn[V - 2] | 0, B = gr(ne, q, 19) ^ ni(ne, q, 61) ^ Wu(ne, q, 6), P = yr(ne, q, 19) ^ ri(ne, q, 61) ^ Zu(ne, q, 6), j = Lm(te, P, kn[V - 7], kn[V - 16]), E = Pm(j, J, B, Bn[V - 7], Bn[V - 16]);
+      const L = Bn[V - 15] | 0, z = kn[V - 15] | 0, J = gr(L, z, 1) ^ gr(L, z, 8) ^ Wu(L, z, 7), te = yr(L, z, 1) ^ yr(L, z, 8) ^ Zu(L, z, 7), ne = Bn[V - 2] | 0, q = kn[V - 2] | 0, C = gr(ne, q, 19) ^ ni(ne, q, 61) ^ Wu(ne, q, 6), P = yr(ne, q, 19) ^ ri(ne, q, 61) ^ Zu(ne, q, 6), j = Lm(te, P, kn[V - 7], kn[V - 16]), E = Pm(j, J, C, Bn[V - 7], Bn[V - 16]);
       Bn[V] = E | 0, kn[V] = j | 0;
     }
-    let { Ah: r, Al: s, Bh: i, Bl: o, Ch: a, Cl: d, Dh: m, Dl: g, Eh: x, El: O, Fh: N, Fl: F, Gh: C, Gl: k, Hh: K, Hl: Y } = this;
+    let { Ah: r, Al: s, Bh: i, Bl: o, Ch: a, Cl: d, Dh: m, Dl: g, Eh: x, El: O, Fh: N, Fl: F, Gh: M, Gl: k, Hh: K, Hl: Y } = this;
     for (let V = 0; V < 80; V++) {
-      const L = gr(x, O, 14) ^ gr(x, O, 18) ^ ni(x, O, 41), z = yr(x, O, 14) ^ yr(x, O, 18) ^ ri(x, O, 41), J = x & N ^ ~x & C, te = O & F ^ ~O & k, ne = Um(Y, z, te, Uy[V], kn[V]), q = Dm(ne, K, L, J, Py[V], Bn[V]), B = ne | 0, P = gr(r, s, 28) ^ ni(r, s, 34) ^ ni(r, s, 39), j = yr(r, s, 28) ^ ri(r, s, 34) ^ ri(r, s, 39), E = r & i ^ r & a ^ i & a, c = s & o ^ s & d ^ o & d;
-      K = C | 0, Y = k | 0, C = N | 0, k = F | 0, N = x | 0, F = O | 0, { h: x, l: O } = gn(m | 0, g | 0, q | 0, B | 0), m = a | 0, g = d | 0, a = i | 0, d = o | 0, i = r | 0, o = s | 0;
-      const p = Bm(B, j, c);
-      r = km(p, q, P, E), s = p | 0;
+      const L = gr(x, O, 14) ^ gr(x, O, 18) ^ ni(x, O, 41), z = yr(x, O, 14) ^ yr(x, O, 18) ^ ri(x, O, 41), J = x & N ^ ~x & M, te = O & F ^ ~O & k, ne = Um(Y, z, te, Uy[V], kn[V]), q = Dm(ne, K, L, J, Py[V], Bn[V]), C = ne | 0, P = gr(r, s, 28) ^ ni(r, s, 34) ^ ni(r, s, 39), j = yr(r, s, 28) ^ ri(r, s, 34) ^ ri(r, s, 39), E = 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 = x | 0, F = O | 0, { h: x, l: O } = gn(m | 0, g | 0, q | 0, C | 0), m = a | 0, g = d | 0, a = i | 0, d = o | 0, i = r | 0, o = s | 0;
+      const h = Bm(C, j, c);
+      r = km(h, q, P, E), s = h | 0;
     }
-    ({ h: r, l: s } = gn(this.Ah | 0, this.Al | 0, r | 0, s | 0)), { h: i, l: o } = gn(this.Bh | 0, this.Bl | 0, i | 0, o | 0), { h: a, l: d } = gn(this.Ch | 0, this.Cl | 0, a | 0, d | 0), { h: m, l: g } = gn(this.Dh | 0, this.Dl | 0, m | 0, g | 0), { h: x, l: O } = gn(this.Eh | 0, this.El | 0, x | 0, O | 0), { h: N, l: F } = gn(this.Fh | 0, this.Fl | 0, N | 0, F | 0), { h: C, l: k } = gn(this.Gh | 0, this.Gl | 0, C | 0, k | 0), { h: K, l: Y } = gn(this.Hh | 0, this.Hl | 0, K | 0, Y | 0), this.set(r, s, i, o, a, d, m, g, x, O, N, F, C, k, K, Y);
+    ({ h: r, l: s } = gn(this.Ah | 0, this.Al | 0, r | 0, s | 0)), { h: i, l: o } = gn(this.Bh | 0, this.Bl | 0, i | 0, o | 0), { h: a, l: d } = gn(this.Ch | 0, this.Cl | 0, a | 0, d | 0), { h: m, l: g } = gn(this.Dh | 0, this.Dl | 0, m | 0, g | 0), { h: x, l: O } = gn(this.Eh | 0, this.El | 0, x | 0, O | 0), { h: N, l: F } = gn(this.Fh | 0, this.Fl | 0, N | 0, F | 0), { h: M, l: k } = gn(this.Gh | 0, this.Gl | 0, M | 0, k | 0), { h: K, l: Y } = gn(this.Hh | 0, this.Hl | 0, K | 0, Y | 0), this.set(r, s, i, o, a, d, m, g, x, O, N, F, M, k, K, Y);
   }
   roundClean() {
     Gn(Bn, kn);
@@ -5330,11 +5330,11 @@ async function zc(t) {
   return nr(e);
 }
 async function Wy(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: x, maxFeePerGas: O, maxPriorityFeePerGas: N, nonce: F, nonceManager: C, to: k, type: K, value: Y, ...V } = e, L = await (async () => {
-    if (!n || !C || typeof F < "u")
+  const { account: n = t.account, accessList: r, authorizationList: s, chain: i = t.chain, blobVersionedHashes: o, blobs: a, data: d, gas: m, gasPrice: g, maxFeePerBlobGas: x, maxFeePerGas: O, maxPriorityFeePerGas: N, nonce: F, nonceManager: M, to: k, type: K, value: Y, ...V } = e, L = await (async () => {
+    if (!n || !M || typeof F < "u")
       return F;
     const ne = In(n), q = i ? i.id : await Ct(t, zc, "getChainId")({});
-    return await C.consume({
+    return await M.consume({
       address: ne.address,
       chainId: q,
       client: t
@@ -5364,13 +5364,13 @@ async function Wy(t, e) {
     const ne = await t.request({
       method: "eth_fillTransaction",
       params: [te]
-    }), B = (i?.formatters?.transaction?.format || Af)(ne.tx);
-    delete B.blockHash, delete B.blockNumber, delete B.r, delete B.s, delete B.transactionIndex, delete B.v, delete B.yParity, B.data = B.input, B.gas && (B.gas = e.gas ?? B.gas), B.gasPrice && (B.gasPrice = e.gasPrice ?? B.gasPrice), B.maxFeePerBlobGas && (B.maxFeePerBlobGas = e.maxFeePerBlobGas ?? B.maxFeePerBlobGas), B.maxFeePerGas && (B.maxFeePerGas = e.maxFeePerGas ?? B.maxFeePerGas), B.maxPriorityFeePerGas && (B.maxPriorityFeePerGas = e.maxPriorityFeePerGas ?? B.maxPriorityFeePerGas), B.nonce && (B.nonce = e.nonce ?? B.nonce);
+    }), C = (i?.formatters?.transaction?.format || Af)(ne.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 P = await (async () => {
       if (typeof i?.fees?.baseFeeMultiplier == "function") {
-        const p = await Ct(t, Ts, "getBlock")({});
+        const h = await Ct(t, Ts, "getBlock")({});
         return i.fees.baseFeeMultiplier({
-          block: p,
+          block: h,
           client: t,
           request: e
         });
@@ -5379,12 +5379,12 @@ async function Wy(t, e) {
     })();
     if (P < 1)
       throw new Rf();
-    const E = 10 ** (P.toString().split(".")[1]?.length ?? 0), c = (p) => p * BigInt(Math.ceil(P * E)) / BigInt(E);
-    return B.maxFeePerGas && !e.maxFeePerGas && (B.maxFeePerGas = c(B.maxFeePerGas)), B.gasPrice && !e.gasPrice && (B.gasPrice = c(B.gasPrice)), {
+    const E = 10 ** (P.toString().split(".")[1]?.length ?? 0), c = (h) => h * BigInt(Math.ceil(P * E)) / BigInt(E);
+    return C.maxFeePerGas && !e.maxFeePerGas && (C.maxFeePerGas = c(C.maxFeePerGas)), C.gasPrice && !e.gasPrice && (C.gasPrice = c(C.gasPrice)), {
       raw: ne.raw,
       transaction: {
         from: te.from,
-        ...B
+        ...C
       }
     };
   } catch (ne) {
@@ -5435,7 +5435,7 @@ async function Lf(t, e) {
     phase: "beforeFillTransaction"
   }), x ??= n.nonce);
   const N = ((o.includes("blobVersionedHashes") || o.includes("sidecars")) && n.kzg && n.blobs || ea.get(t.uid) === !1 || !["fees", "gas"].some((z) => o.includes(z)) ? !1 : !!(o.includes("chainId") && typeof n.chainId != "number" || o.includes("nonce") && typeof x != "number" || o.includes("fees") && typeof n.gasPrice != "bigint" && (typeof n.maxFeePerGas != "bigint" || typeof n.maxPriorityFeePerGas != "bigint") || o.includes("gas") && typeof n.gas != "bigint")) ? await Ct(t, Wy, "fillTransaction")({ ...n, nonce: x }).then((L) => {
-    const { chainId: z, from: J, gas: te, gasPrice: ne, nonce: q, maxFeePerBlobGas: B, maxFeePerGas: P, maxPriorityFeePerGas: j, type: E, ...c } = L.transaction;
+    const { chainId: z, from: J, gas: te, gasPrice: ne, nonce: q, maxFeePerBlobGas: C, maxFeePerGas: P, maxPriorityFeePerGas: j, type: E, ...c } = L.transaction;
     return ea.set(t.uid, !0), {
       ...n,
       ...J ? { from: J } : {},
@@ -5444,7 +5444,7 @@ async function Lf(t, e) {
       ...typeof te < "u" ? { gas: te } : {},
       ...typeof ne < "u" ? { gasPrice: ne } : {},
       ...typeof q < "u" ? { nonce: q } : {},
-      ...typeof B < "u" ? { maxFeePerBlobGas: B } : {},
+      ...typeof C < "u" ? { maxFeePerBlobGas: C } : {},
       ...typeof P < "u" ? { maxFeePerGas: P } : {},
       ...typeof j < "u" ? { maxPriorityFeePerGas: j } : {},
       ..."nonceKey" in c && typeof c.nonceKey < "u" ? { nonceKey: c.nonceKey } : {}
@@ -5461,7 +5461,7 @@ async function Lf(t, e) {
     ...g ? { from: g?.address } : {},
     ...x ? { nonce: x } : {}
   };
-  const { blobs: F, gas: C, 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"
   }));
@@ -5525,7 +5525,7 @@ async function Lf(t, e) {
         n.gasPrice = z;
       }
     }
-  return o.includes("gas") && typeof C > "u" && (n.gas = await Ct(t, Zy, "estimateGas")({
+  return o.includes("gas") && typeof M > "u" && (n.gas = await Ct(t, Zy, "estimateGas")({
     ...n,
     account: g,
     prepare: g?.type === "local" ? [] : ["blobVersionedHashes"]
@@ -5550,7 +5550,7 @@ async function Zy(t, e) {
         }).catch(() => {
           throw new ue("`to` is required. Could not infer from `authorizationList`");
         });
-    })(), { accessList: a, authorizationList: d, blobs: m, blobVersionedHashes: g, blockNumber: x, blockTag: O, data: N, gas: F, gasPrice: C, maxFeePerBlobGas: k, maxFeePerGas: K, maxPriorityFeePerGas: Y, nonce: V, value: L, stateOverride: z, ...J } = r ? await Lf(t, {
+    })(), { accessList: a, authorizationList: d, blobs: m, blobVersionedHashes: g, blockNumber: x, blockTag: O, data: N, gas: F, gasPrice: M, maxFeePerBlobGas: k, maxFeePerGas: K, maxPriorityFeePerGas: Y, nonce: V, value: L, stateOverride: z, ...J } = r ? await Lf(t, {
       ...e,
       parameters: i,
       to: o
@@ -5559,16 +5559,16 @@ async function Zy(t, e) {
       return F;
     const ne = (typeof x == "bigint" ? Be(x) : void 0) || O, q = hy(z);
     lo(e);
-    const B = t.chain?.formatters?.transactionRequest?.format, j = (B || Dc)({
+    const C = t.chain?.formatters?.transactionRequest?.format, j = (C || Dc)({
       // Pick out extra data that might exist on the chain's transaction request type.
-      ...Uc(J, { format: B }),
+      ...Uc(J, { format: C }),
       account: s,
       accessList: a,
       authorizationList: d,
       blobs: m,
       blobVersionedHashes: g,
       data: N,
-      gasPrice: C,
+      gasPrice: M,
       maxFeePerBlobGas: k,
       maxFeePerGas: K,
       maxPriorityFeePerGas: Y,
@@ -5854,9 +5854,9 @@ function s1(t) {
     for (; !d.eql(O, d.ONE); ) {
       if (d.is0(O))
         return d.ZERO;
-      let F = 1, C = d.sqr(O);
-      for (; !d.eql(C, d.ONE); )
-        if (F++, C = d.sqr(C), F === g)
+      let F = 1, M = d.sqr(O);
+      for (; !d.eql(M, d.ONE); )
+        if (F++, M = d.sqr(M), F === g)
           throw new Error("Cannot find square root");
       const k = wt << BigInt(g - F - 1), K = d.pow(x, k);
       g = F, x = d.sqr(K), O = d.mul(O, x), N = d.mul(N, K);
@@ -6136,15 +6136,15 @@ function Wf(t, e, n, r) {
   let O = o;
   for (let N = x; N >= 0; N -= d) {
     g.fill(o);
-    for (let C = 0; C < i; C++) {
-      const k = r[C], K = Number(k >> BigInt(N) & m);
-      g[K] = g[K].add(n[C]);
+    for (let M = 0; M < i; M++) {
+      const k = r[M], K = Number(k >> BigInt(N) & m);
+      g[K] = g[K].add(n[M]);
     }
     let F = o;
-    for (let C = g.length - 1, k = o; C > 0; C--)
-      k = k.add(g[C]), F = F.add(k);
+    for (let M = g.length - 1, k = o; M > 0; M--)
+      k = k.add(g[M]), F = F.add(k);
     if (O = O.add(F), N !== 0)
-      for (let C = 0; C < d; C++)
+      for (let M = 0; M < d; M++)
         O = O.double();
   }
   return O;
@@ -6330,7 +6330,7 @@ function g1(t) {
     return J && (ne = Ve(ne, te)), Qt("private key", ne, yt, te), ne;
   }
   function O(V) {
-    if (!(V instanceof C))
+    if (!(V instanceof M))
       throw new Error("ProjectivePoint expected");
   }
   const N = xi((V, L) => {
@@ -6339,12 +6339,12 @@ function g1(t) {
       return { x: z, y: J };
     const ne = V.is0();
     L == null && (L = ne ? n.ONE : n.inv(te));
-    const q = n.mul(z, L), B = n.mul(J, L), P = n.mul(te, L);
+    const q = n.mul(z, L), C = n.mul(J, L), P = n.mul(te, L);
     if (ne)
       return { x: n.ZERO, y: n.ZERO };
     if (!n.eql(P, n.ONE))
       throw new Error("invZ was invalid");
-    return { x: q, y: B };
+    return { x: q, y: C };
   }), F = xi((V) => {
     if (V.is0()) {
       if (e.allowInfinityPoint && !n.is0(V.py))
@@ -6360,7 +6360,7 @@ function g1(t) {
       throw new Error("bad point: not in prime-order subgroup");
     return !0;
   });
-  class C {
+  class M {
     constructor(L, z, J) {
       if (L == null || !n.isValid(L))
         throw new Error("x required");
@@ -6376,10 +6376,10 @@ function g1(t) {
       const { x: z, y: J } = L || {};
       if (!L || !n.isValid(z) || !n.isValid(J))
         throw new Error("invalid affine point");
-      if (L instanceof C)
+      if (L instanceof M)
         throw new Error("projective point not allowed");
       const te = (ne) => n.eql(ne, n.ZERO);
-      return te(z) && te(J) ? C.ZERO : new C(z, J, n.ONE);
+      return te(z) && te(J) ? M.ZERO : new M(z, J, n.ONE);
     }
     get x() {
       return this.toAffine().x;
@@ -6395,23 +6395,23 @@ function g1(t) {
      */
     static normalizeZ(L) {
       const z = jc(n, L.map((J) => J.pz));
-      return L.map((J, te) => J.toAffine(z[te])).map(C.fromAffine);
+      return L.map((J, te) => J.toAffine(z[te])).map(M.fromAffine);
     }
     /**
      * Converts hash string or Uint8Array to Point.
      * @param hex short/long ECDSA hex
      */
     static fromHex(L) {
-      const z = C.fromAffine(i(Ye("pointHex", L)));
+      const z = M.fromAffine(i(Ye("pointHex", L)));
       return z.assertValidity(), z;
     }
     // Multiplies generator point by privateKey.
     static fromPrivateKey(L) {
-      return C.BASE.multiply(x(L));
+      return M.BASE.multiply(x(L));
     }
     // Multiscalar Multiplication
     static msm(L, z) {
-      return Wf(C, r, L, z);
+      return Wf(M, r, L, z);
     }
     // "Private method", don't use it directly
     _setWindowSize(L) {
@@ -6432,14 +6432,14 @@ function g1(t) {
      */
     equals(L) {
       O(L);
-      const { px: z, py: J, pz: te } = this, { px: ne, py: q, pz: B } = L, P = n.eql(n.mul(z, B), n.mul(ne, te)), j = n.eql(n.mul(J, B), n.mul(q, te));
+      const { px: z, py: J, pz: te } = this, { px: ne, py: q, pz: C } = L, P = n.eql(n.mul(z, C), n.mul(ne, te)), j = n.eql(n.mul(J, C), n.mul(q, te));
       return P && j;
     }
     /**
      * Flips point to one corresponding to (x, -y) in Affine coordinates.
      */
     negate() {
-      return new C(this.px, n.neg(this.py), this.pz);
+      return new M(this.px, n.neg(this.py), this.pz);
     }
     // Renes-Costello-Batina exception-free doubling formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -6447,8 +6447,8 @@ function g1(t) {
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
       const { a: L, b: z } = e, J = n.mul(z, oa), { px: te, py: ne, pz: q } = this;
-      let B = n.ZERO, P = n.ZERO, j = n.ZERO, E = n.mul(te, te), c = n.mul(ne, ne), p = n.mul(q, q), y = n.mul(te, ne);
-      return y = n.add(y, y), j = n.mul(te, q), j = n.add(j, j), B = n.mul(L, j), P = n.mul(J, p), P = n.add(B, P), B = n.sub(c, P), P = n.add(c, P), P = n.mul(B, P), B = n.mul(y, B), j = n.mul(J, j), p = n.mul(L, p), y = n.sub(E, p), y = n.mul(L, y), y = n.add(y, j), j = n.add(E, E), E = n.add(j, E), E = n.add(E, p), E = n.mul(E, y), P = n.add(P, E), p = n.mul(ne, q), p = n.add(p, p), E = n.mul(p, y), B = n.sub(B, E), j = n.mul(p, c), j = n.add(j, j), j = n.add(j, j), new C(B, P, j);
+      let C = n.ZERO, P = n.ZERO, j = n.ZERO, E = n.mul(te, te), c = n.mul(ne, ne), h = n.mul(q, q), y = n.mul(te, ne);
+      return y = n.add(y, y), j = n.mul(te, q), j = n.add(j, j), C = n.mul(L, j), P = n.mul(J, h), P = n.add(C, P), C = n.sub(c, P), P = n.add(c, P), P = n.mul(C, P), C = n.mul(y, C), j = n.mul(J, j), h = n.mul(L, h), y = n.sub(E, h), y = n.mul(L, y), y = n.add(y, j), j = n.add(E, E), E = n.add(j, E), E = n.add(E, h), E = n.mul(E, y), P = n.add(P, E), h = n.mul(ne, q), h = n.add(h, h), E = n.mul(h, y), C = n.sub(C, E), j = n.mul(h, c), j = n.add(j, j), j = n.add(j, j), new M(C, P, j);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -6456,22 +6456,22 @@ function g1(t) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(L) {
       O(L);
-      const { px: z, py: J, pz: te } = this, { px: ne, py: q, pz: B } = L;
+      const { px: z, py: J, pz: te } = this, { px: ne, py: q, pz: C } = L;
       let P = n.ZERO, j = n.ZERO, E = n.ZERO;
-      const c = e.a, p = n.mul(e.b, oa);
-      let y = n.mul(z, ne), A = n.mul(J, q), v = n.mul(te, B), R = n.add(z, J), I = n.add(ne, q);
+      const c = e.a, h = n.mul(e.b, oa);
+      let y = n.mul(z, ne), A = n.mul(J, q), v = n.mul(te, C), R = n.add(z, J), I = n.add(ne, q);
       R = n.mul(R, I), I = n.add(y, A), R = n.sub(R, I), I = n.add(z, te);
-      let b = n.add(ne, B);
-      return I = n.mul(I, b), b = n.add(y, v), I = n.sub(I, b), b = n.add(J, te), P = n.add(q, B), b = n.mul(b, P), P = n.add(A, v), b = n.sub(b, P), E = n.mul(c, I), P = n.mul(p, v), E = n.add(P, E), P = n.sub(A, E), E = n.add(A, E), j = n.mul(P, E), A = n.add(y, y), A = n.add(A, y), v = n.mul(c, v), I = n.mul(p, I), A = n.add(A, v), v = n.sub(y, v), v = n.mul(c, v), I = n.add(I, v), y = n.mul(A, I), j = n.add(j, y), y = n.mul(b, I), P = n.mul(R, P), P = n.sub(P, y), y = n.mul(R, A), E = n.mul(b, E), E = n.add(E, y), new C(P, j, E);
+      let b = n.add(ne, C);
+      return I = n.mul(I, b), b = n.add(y, v), I = n.sub(I, b), b = n.add(J, te), P = n.add(q, C), b = n.mul(b, P), P = n.add(A, v), b = n.sub(b, P), E = n.mul(c, I), P = n.mul(h, v), E = n.add(P, E), P = n.sub(A, E), E = n.add(A, E), j = n.mul(P, E), A = n.add(y, y), A = n.add(A, y), v = n.mul(c, v), I = n.mul(h, I), A = n.add(A, v), v = n.sub(y, v), v = n.mul(c, v), I = n.add(I, v), y = n.mul(A, I), j = n.add(j, y), y = n.mul(b, I), P = n.mul(R, P), P = n.sub(P, y), y = n.mul(R, A), E = n.mul(b, E), E = n.add(E, y), new M(P, j, E);
     }
     subtract(L) {
       return this.add(L.negate());
     }
     is0() {
-      return this.equals(C.ZERO);
+      return this.equals(M.ZERO);
     }
     wNAF(L) {
-      return Y.wNAFCached(this, L, C.normalizeZ);
+      return Y.wNAFCached(this, L, M.normalizeZ);
     }
     /**
      * Non-constant-time multiplication. Uses double-and-add algorithm.
@@ -6481,17 +6481,17 @@ function g1(t) {
     multiplyUnsafe(L) {
       const { endo: z, n: J } = e;
       Qt("scalar", L, Rn, J);
-      const te = C.ZERO;
+      const te = M.ZERO;
       if (L === Rn)
         return te;
       if (this.is0() || L === yt)
         return this;
       if (!z || Y.hasPrecomputes(this))
-        return Y.wNAFCachedUnsafe(this, L, C.normalizeZ);
-      let { k1neg: ne, k1: q, k2neg: B, k2: P } = z.splitScalar(L), j = te, E = te, c = this;
+        return Y.wNAFCachedUnsafe(this, L, M.normalizeZ);
+      let { k1neg: ne, k1: q, k2neg: C, k2: P } = z.splitScalar(L), j = te, E = te, c = this;
       for (; q > Rn || P > Rn; )
         q & yt && (j = j.add(c)), P & yt && (E = E.add(c)), c = c.double(), q >>= yt, P >>= yt;
-      return ne && (j = j.negate()), B && (E = E.negate()), E = new C(n.mul(E.px, z.beta), E.py, E.pz), j.add(E);
+      return ne && (j = j.negate()), C && (E = E.negate()), E = new M(n.mul(E.px, z.beta), E.py, E.pz), j.add(E);
     }
     /**
      * Constant time multiplication.
@@ -6507,14 +6507,14 @@ function g1(t) {
       Qt("scalar", L, yt, J);
       let te, ne;
       if (z) {
-        const { k1neg: q, k1: B, k2neg: P, k2: j } = z.splitScalar(L);
-        let { p: E, f: c } = this.wNAF(B), { p, f: y } = this.wNAF(j);
-        E = Y.constTimeNegate(q, E), p = Y.constTimeNegate(P, p), p = new C(n.mul(p.px, z.beta), p.py, p.pz), te = E.add(p), ne = c.add(y);
+        const { k1neg: q, k1: C, k2neg: P, k2: j } = z.splitScalar(L);
+        let { p: E, f: c } = this.wNAF(C), { p: h, f: y } = this.wNAF(j);
+        E = Y.constTimeNegate(q, E), h = Y.constTimeNegate(P, h), h = new M(n.mul(h.px, z.beta), h.py, h.pz), te = E.add(h), ne = c.add(y);
       } else {
-        const { p: q, f: B } = this.wNAF(L);
-        te = q, ne = B;
+        const { p: q, f: C } = this.wNAF(L);
+        te = q, ne = C;
       }
-      return C.normalizeZ([te, ne])[0];
+      return M.normalizeZ([te, ne])[0];
     }
     /**
      * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.
@@ -6523,7 +6523,7 @@ function g1(t) {
      * @returns non-zero affine point
      */
     multiplyAndAddUnsafe(L, z, J) {
-      const te = C.BASE, ne = (B, P) => P === Rn || P === yt || !B.equals(te) ? B.multiplyUnsafe(P) : B.multiply(P), q = ne(this, z).add(ne(L, J));
+      const te = M.BASE, ne = (C, P) => P === Rn || P === yt || !C.equals(te) ? C.multiplyUnsafe(P) : C.multiply(P), q = ne(this, z).add(ne(L, J));
       return q.is0() ? void 0 : q;
     }
     // Converts Projective point to affine (x, y) coordinates.
@@ -6537,25 +6537,25 @@ function g1(t) {
       if (L === yt)
         return !0;
       if (z)
-        return z(C, this);
+        return z(M, this);
       throw new Error("isTorsionFree() has not been declared for the elliptic curve");
     }
     clearCofactor() {
       const { h: L, clearCofactor: z } = e;
-      return L === yt ? this : z ? z(C, this) : this.multiplyUnsafe(e.h);
+      return L === yt ? this : z ? z(M, this) : this.multiplyUnsafe(e.h);
     }
     toRawBytes(L = !0) {
-      return zn("isCompressed", L), this.assertValidity(), s(C, this, L);
+      return zn("isCompressed", L), this.assertValidity(), s(M, this, L);
     }
     toHex(L = !0) {
       return zn("isCompressed", L), Ur(this.toRawBytes(L));
     }
   }
-  C.BASE = new C(e.Gx, e.Gy, n.ONE), C.ZERO = new C(n.ZERO, n.ONE, n.ZERO);
-  const { endo: k, nBitLength: K } = e, Y = Kf(C, k ? Math.ceil(K / 2) : K);
+  M.BASE = new M(e.Gx, e.Gy, n.ONE), M.ZERO = new M(n.ZERO, n.ONE, n.ZERO);
+  const { endo: k, nBitLength: K } = e, Y = Kf(M, k ? Math.ceil(K / 2) : K);
   return {
     CURVE: e,
-    ProjectivePoint: C,
+    ProjectivePoint: M,
     normPrivateKeyToScalar: x,
     weierstrassEquation: o,
     isWithinCurveOrder: g
@@ -6575,20 +6575,20 @@ function y1(t) {
 }
 function _1(t) {
   const e = y1(t), { Fp: n, n: r, nByteLength: s, nBitLength: i } = e, o = n.BYTES + 1, a = 2 * n.BYTES + 1;
-  function d(p) {
-    return Ve(p, r);
+  function d(h) {
+    return Ve(h, r);
   }
-  function m(p) {
-    return Ya(p, r);
+  function m(h) {
+    return Ya(h, r);
   }
   const { ProjectivePoint: g, normPrivateKeyToScalar: x, weierstrassEquation: O, isWithinCurveOrder: N } = g1({
     ...e,
-    toBytes(p, y, A) {
+    toBytes(h, y, A) {
       const v = y.toAffine(), R = n.toBytes(v.x), I = Dr;
       return zn("isCompressed", A), A ? I(Uint8Array.from([y.hasEvenY() ? 2 : 3]), R) : I(Uint8Array.from([4]), R, n.toBytes(v.y));
     },
-    fromBytes(p) {
-      const y = p.length, A = p[0], v = p.subarray(1);
+    fromBytes(h) {
+      const y = h.length, A = h[0], v = h.subarray(1);
       if (y === o && (A === 2 || A === 3)) {
         const R = er(v);
         if (!Lc(R, yt, n.ORDER))
@@ -6612,14 +6612,14 @@ function _1(t) {
       }
     }
   });
-  function F(p) {
+  function F(h) {
     const y = r >> yt;
-    return p > y;
+    return h > y;
   }
-  function C(p) {
-    return F(p) ? d(-p) : p;
+  function M(h) {
+    return F(h) ? d(-h) : h;
   }
-  const k = (p, y, A) => er(p.slice(y, A));
+  const k = (h, y, A) => er(h.slice(y, A));
   class K {
     constructor(y, A, v) {
       Qt("r", y, yt, r), Qt("s", A, yt, r), this.r = y, this.s = A, v != null && (this.recovery = v), Object.freeze(this);
@@ -6680,9 +6680,9 @@ function _1(t) {
     }
   }
   const Y = {
-    isValidPrivateKey(p) {
+    isValidPrivateKey(h) {
       try {
-        return x(p), !0;
+        return x(h), !0;
       } catch {
         return !1;
       }
@@ -6693,8 +6693,8 @@ function _1(t) {
      * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.
      */
     randomPrivateKey: () => {
-      const p = Gf(e.n);
-      return d1(e.randomBytes(p), e.n);
+      const h = Gf(e.n);
+      return d1(e.randomBytes(h), e.n);
     },
     /**
      * Creates precompute table for an arbitrary EC point. Makes point "cached".
@@ -6704,47 +6704,47 @@ function _1(t) {
      * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey));
      * fast.multiply(privKey); // much faster ECDH now
      */
-    precompute(p = 8, y = g.BASE) {
-      return y._setWindowSize(p), y.multiply(BigInt(3)), y;
+    precompute(h = 8, y = g.BASE) {
+      return y._setWindowSize(h), y.multiply(BigInt(3)), y;
     }
   };
-  function V(p, y = !0) {
-    return g.fromPrivateKey(p).toRawBytes(y);
+  function V(h, y = !0) {
+    return g.fromPrivateKey(h).toRawBytes(y);
   }
-  function L(p) {
-    if (typeof p == "bigint")
+  function L(h) {
+    if (typeof h == "bigint")
       return !1;
-    if (p instanceof g)
+    if (h instanceof g)
       return !0;
-    const A = Ye("key", p).length, v = n.BYTES, R = v + 1, I = 2 * v + 1;
+    const A = Ye("key", h).length, v = n.BYTES, R = v + 1, I = 2 * v + 1;
     if (!(e.allowedPrivateKeyLengths || s === R))
       return A === R || A === I;
   }
-  function z(p, y, A = !0) {
-    if (L(p) === !0)
+  function z(h, y, A = !0) {
+    if (L(h) === !0)
       throw new Error("first arg must be private key");
     if (L(y) === !1)
       throw new Error("second arg must be public key");
-    return g.fromHex(y).multiply(x(p)).toRawBytes(A);
+    return g.fromHex(y).multiply(x(h)).toRawBytes(A);
   }
-  const J = e.bits2int || function(p) {
-    if (p.length > 8192)
+  const J = e.bits2int || function(h) {
+    if (h.length > 8192)
       throw new Error("input is too large");
-    const y = er(p), A = p.length * 8 - i;
+    const y = er(h), A = h.length * 8 - i;
     return A > 0 ? y >> BigInt(A) : y;
-  }, te = e.bits2int_modN || function(p) {
-    return d(J(p));
+  }, te = e.bits2int_modN || function(h) {
+    return d(J(h));
   }, ne = uo(i);
-  function q(p) {
-    return Qt("num < 2^" + i, p, Rn, ne), qs(p, s);
+  function q(h) {
+    return Qt("num < 2^" + i, h, Rn, ne), qs(h, s);
   }
-  function B(p, y, A = P) {
+  function C(h, y, A = P) {
     if (["recovered", "canonical"].some((oe) => oe in A))
       throw new Error("sign() legacy options not supported");
     const { hash: v, randomBytes: R } = e;
     let { lowS: I, prehash: b, extraEntropy: u } = A;
-    I == null && (I = !0), p = Ye("msgHash", p), pd(A), b && (p = Ye("prehashed msgHash", v(p)));
-    const l = te(p), w = x(y), T = [q(w), q(l)];
+    I == null && (I = !0), h = Ye("msgHash", h), pd(A), b && (h = Ye("prehashed msgHash", v(h)));
+    const l = te(h), w = x(y), T = [q(w), q(l)];
     if (u != null && u !== !1) {
       const oe = u === !0 ? R(n.BYTES) : u;
       T.push(Ye("extraEntropy", oe));
@@ -6761,18 +6761,18 @@ function _1(t) {
       if (ve === Rn)
         return;
       let Te = (we.x === Pe ? 0 : 2) | Number(we.y & yt), sn = ve;
-      return I && F(ve) && (sn = C(ve), Te ^= 1), new K(Pe, sn, Te);
+      return I && F(ve) && (sn = M(ve), Te ^= 1), new K(Pe, sn, Te);
     }
     return { seed: D, k2sig: re };
   }
   const P = { lowS: e.lowS, prehash: !1 }, j = { lowS: e.lowS, prehash: !1 };
-  function E(p, y, A = P) {
-    const { seed: v, k2sig: R } = B(p, y, A), I = e;
+  function E(h, y, A = P) {
+    const { seed: v, k2sig: R } = C(h, y, A), I = e;
     return cy(I.hash.outputLen, I.nByteLength, I.hmac)(v, R);
   }
   g.BASE._setWindowSize(8);
-  function c(p, y, A, v = j) {
-    const R = p;
+  function c(h, y, A, v = j) {
+    const R = h;
     y = Ye("msgHash", y), A = Ye("publicKey", A);
     const { lowS: I, prehash: b, format: u } = v;
     if (pd(v), "strict" in v)
@@ -6829,7 +6829,7 @@ function w1(t, e) {
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const Zf = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), md = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), E1 = BigInt(0), v1 = BigInt(1), Xa = BigInt(2), gd = (t, e) => (t + e / Xa) / e;
 function R1(t) {
-  const e = Zf, 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, x = Ke(g, n, e) * g % e, O = Ke(x, n, e) * g % e, N = Ke(O, Xa, e) * m % e, F = Ke(N, s, e) * N % e, C = Ke(F, i, e) * F % e, k = Ke(C, a, e) * C % e, K = Ke(k, d, e) * k % e, Y = Ke(K, a, e) * C % e, V = Ke(Y, n, e) * g % e, L = Ke(V, o, e) * F % e, z = Ke(L, r, e) * m % e, J = Ke(z, Xa, e);
+  const e = Zf, 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, x = Ke(g, n, e) * g % e, O = Ke(x, n, e) * g % e, N = Ke(O, Xa, e) * m % e, F = Ke(N, s, e) * N % e, M = Ke(F, i, e) * F % e, k = Ke(M, a, e) * M % e, K = Ke(k, d, e) * k % e, Y = Ke(K, a, e) * M % e, V = Ke(Y, n, e) * g % e, L = Ke(V, o, e) * F % e, z = Ke(L, r, e) * m % e, J = Ke(z, Xa, e);
   if (!Qa.eql(Qa.sqr(J), t))
     throw new Error("Cannot find square root");
   return J;
@@ -6890,7 +6890,7 @@ async function x1(t, { serializedTransaction: e }) {
 }
 const ca = new Gs(128);
 async function Jf(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: x, maxPriorityFeePerGas: O, nonce: N, type: F, value: C, ...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: x, maxPriorityFeePerGas: O, nonce: N, type: F, value: M, ...k } = e;
   if (typeof n > "u")
     throw new Yf({
       docsPath: "/docs/actions/wallet/sendTransaction"
@@ -6931,7 +6931,7 @@ async function Jf(t, e) {
         nonce: N,
         to: Y,
         type: F,
-        value: C
+        value: M
       }, "sendTransaction"), te = ca.get(t.uid), ne = te ? "wallet_sendTransaction" : "eth_sendTransaction";
       try {
         return await t.request({
@@ -6941,16 +6941,16 @@ async function Jf(t, e) {
       } catch (q) {
         if (te === !1)
           throw q;
-        const B = q;
-        if (B.name === "InvalidInputRpcError" || B.name === "InvalidParamsRpcError" || B.name === "MethodNotFoundRpcError" || B.name === "MethodNotSupportedRpcError")
+        const C = q;
+        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((P) => (ca.set(t.uid, !0), P)).catch((P) => {
             const j = P;
-            throw j.name === "MethodNotFoundRpcError" || j.name === "MethodNotSupportedRpcError" ? (ca.set(t.uid, !1), B) : j;
+            throw j.name === "MethodNotFoundRpcError" || j.name === "MethodNotSupportedRpcError" ? (ca.set(t.uid, !1), C) : j;
           });
-        throw B;
+        throw C;
       }
     }
     if (K?.type === "local") {
@@ -6970,7 +6970,7 @@ async function Jf(t, e) {
         nonceManager: K.nonceManager,
         parameters: [...kf, "sidecars"],
         type: F,
-        value: C,
+        value: M,
         ...k,
         to: Y
       }), L = r?.serializers?.transaction, z = await K.signTransaction(V, {
@@ -7020,8 +7020,8 @@ async function Oi(t, e) {
         account: N,
         ...O
       });
-    } catch (C) {
-      throw iy(C, {
+    } catch (M) {
+      throw iy(M, {
         abi: o,
         address: d,
         args: m,
@@ -7212,11 +7212,11 @@ function nh(t = 11) {
   return ai.substring(oi, oi++ + t);
 }
 function k1(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, x = t.cacheTime ?? g, O = t.account ? In(t.account) : void 0, { config: N, request: F, value: C } = 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, x = t.cacheTime ?? g, O = t.account ? In(t.account) : void 0, { config: N, request: F, value: M } = t.transport({
     account: O,
     chain: n,
     pollingInterval: g
-  }), k = { ...N, ...C }, K = {
+  }), k = { ...N, ...M }, K = {
     account: O,
     batch: e,
     cacheTime: x,
@@ -7479,9 +7479,9 @@ function j1() {
       var g = n ? n + m : m, x = this._events[g];
       return x ? x.fn ? 1 : x.length : 0;
     }, a.prototype.emit = function(m, g, x, O, N, F) {
-      var C = n ? n + m : m;
-      if (!this._events[C]) return !1;
-      var k = this._events[C], K = arguments.length, Y, V;
+      var M = n ? n + m : m;
+      if (!this._events[M]) return !1;
+      var k = this._events[M], K = arguments.length, Y, V;
       if (k.fn) {
         switch (k.once && this.removeListener(m, k.fn, void 0, !0), K) {
           case 1:
@@ -7536,8 +7536,8 @@ function j1() {
       if (F.fn)
         F.fn === g && (!O || F.once) && (!x || F.context === x) && o(this, N);
       else {
-        for (var C = 0, k = [], K = F.length; C < K; C++)
-          (F[C].fn !== g || O && !F[C].once || x && F[C].context !== x) && k.push(F[C]);
+        for (var M = 0, k = [], K = F.length; M < K; M++)
+          (F[M].fn !== g || O && !F[M].once || x && F[M].context !== x) && k.push(F[M]);
         k.length ? this._events[N] = k.length === 1 ? k[0] : k : o(this, N);
       }
       return this;
@@ -10513,20 +10513,20 @@ function eb() {
     var F = N.length;
     if (F % 4 > 0)
       throw new Error("Invalid string. Length must be a multiple of 4");
-    var C = N.indexOf("=");
-    C === -1 && (C = F);
-    var k = C === F ? 0 : 4 - C % 4;
-    return [C, k];
+    var M = N.indexOf("=");
+    M === -1 && (M = F);
+    var k = M === F ? 0 : 4 - M % 4;
+    return [M, k];
   }
   function a(N) {
-    var F = o(N), C = F[0], k = F[1];
-    return (C + k) * 3 / 4 - k;
+    var F = o(N), M = F[0], k = F[1];
+    return (M + k) * 3 / 4 - k;
   }
-  function d(N, F, C) {
-    return (F + C) * 3 / 4 - C;
+  function d(N, F, M) {
+    return (F + M) * 3 / 4 - M;
   }
   function m(N) {
-    var F, C = o(N), k = C[0], K = C[1], Y = new n(d(N, k, K)), V = 0, L = K > 0 ? k - 4 : k, z;
+    var F, M = o(N), k = M[0], K = M[1], Y = new n(d(N, k, K)), V = 0, L = K > 0 ? k - 4 : k, z;
     for (z = 0; z < L; z += 4)
       F = e[N.charCodeAt(z)] << 18 | e[N.charCodeAt(z + 1)] << 12 | e[N.charCodeAt(z + 2)] << 6 | e[N.charCodeAt(z + 3)], Y[V++] = F >> 16 & 255, Y[V++] = F >> 8 & 255, Y[V++] = F & 255;
     return K === 2 && (F = e[N.charCodeAt(z)] << 2 | e[N.charCodeAt(z + 1)] >> 4, Y[V++] = F & 255), K === 1 && (F = e[N.charCodeAt(z)] << 10 | e[N.charCodeAt(z + 1)] << 4 | e[N.charCodeAt(z + 2)] >> 2, Y[V++] = F >> 8 & 255, Y[V++] = F & 255), Y;
@@ -10534,17 +10534,17 @@ function eb() {
   function g(N) {
     return t[N >> 18 & 63] + t[N >> 12 & 63] + t[N >> 6 & 63] + t[N & 63];
   }
-  function x(N, F, C) {
-    for (var k, K = [], Y = F; Y < C; Y += 3)
+  function x(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 O(N) {
-    for (var F, C = N.length, k = C % 3, K = [], Y = 16383, V = 0, L = C - k; V < L; V += Y)
+    for (var F, M = N.length, k = M % 3, K = [], Y = 16383, V = 0, L = M - k; V < L; V += Y)
       K.push(x(N, V, V + Y > L ? L : V + Y));
-    return k === 1 ? (F = N[C - 1], K.push(
+    return k === 1 ? (F = N[M - 1], K.push(
       t[F >> 2] + t[F << 4 & 63] + "=="
-    )) : k === 2 && (F = (N[C - 2] << 8) + N[C - 1], K.push(
+    )) : 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("");
   }
@@ -10569,12 +10569,12 @@ function tb() {
     }
     return (N ? -1 : 1) * o * Math.pow(2, i - r);
   }, ci.write = function(t, e, n, r, s, i) {
-    var o, a, d, m = i * 8 - s - 1, g = (1 << m) - 1, x = g >> 1, O = s === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, N = r ? 0 : i - 1, F = r ? 1 : -1, C = e < 0 || e === 0 && 1 / e < 0 ? 1 : 0;
+    var o, a, d, m = i * 8 - s - 1, g = (1 << m) - 1, x = g >> 1, O = 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 + x >= 1 ? e += O / d : e += O * Math.pow(2, 1 - x), e * d >= 2 && (o++, d /= 2), o + x >= g ? (a = 0, o = g) : o + x >= 1 ? (a = (e * d - 1) * Math.pow(2, s), o = o + x) : (a = e * Math.pow(2, x - 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 += F, o /= 256, m -= 8)
       ;
-    t[n + N - F] |= C * 128;
+    t[n + N - F] |= M * 128;
   }), ci;
 }
 /*!
@@ -10621,7 +10621,7 @@ function Xc() {
       const f = new Uint8Array(_);
       return Object.setPrototypeOf(f, a.prototype), f;
     }
-    function a(_, f, h) {
+    function a(_, f, p) {
       if (typeof _ == "number") {
         if (typeof f == "string")
           throw new TypeError(
@@ -10629,10 +10629,10 @@ function Xc() {
           );
         return x(_);
       }
-      return d(_, f, h);
+      return d(_, f, p);
     }
     a.poolSize = 8192;
-    function d(_, f, h) {
+    function d(_, f, p) {
       if (typeof _ == "string")
         return O(_, f);
       if (ArrayBuffer.isView(_))
@@ -10642,24 +10642,24 @@ function Xc() {
           "The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " + typeof _
         );
       if (Vt(_, ArrayBuffer) || _ && Vt(_.buffer, ArrayBuffer) || typeof SharedArrayBuffer < "u" && (Vt(_, SharedArrayBuffer) || _ && Vt(_.buffer, SharedArrayBuffer)))
-        return C(_, f, h);
+        return M(_, f, p);
       if (typeof _ == "number")
         throw new TypeError(
           'The "value" argument must not be of type number. Received type number'
         );
       const S = _.valueOf && _.valueOf();
       if (S != null && S !== _)
-        return a.from(S, f, h);
+        return a.from(S, f, p);
       const U = k(_);
       if (U) return U;
       if (typeof Symbol < "u" && Symbol.toPrimitive != null && typeof _[Symbol.toPrimitive] == "function")
-        return a.from(_[Symbol.toPrimitive]("string"), f, h);
+        return a.from(_[Symbol.toPrimitive]("string"), f, p);
       throw new TypeError(
         "The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " + typeof _
       );
     }
-    a.from = function(_, f, h) {
-      return d(_, f, h);
+    a.from = function(_, f, p) {
+      return d(_, f, p);
     }, Object.setPrototypeOf(a.prototype, Uint8Array.prototype), Object.setPrototypeOf(a, Uint8Array);
     function m(_) {
       if (typeof _ != "number")
@@ -10667,11 +10667,11 @@ function Xc() {
       if (_ < 0)
         throw new RangeError('The value "' + _ + '" is invalid for option "size"');
     }
-    function g(_, f, h) {
-      return m(_), _ <= 0 ? o(_) : f !== void 0 ? typeof h == "string" ? o(_).fill(f, h) : o(_).fill(f) : o(_);
+    function g(_, f, p) {
+      return m(_), _ <= 0 ? o(_) : f !== void 0 ? typeof p == "string" ? o(_).fill(f, p) : o(_).fill(f) : o(_);
     }
-    a.alloc = function(_, f, h) {
-      return g(_, f, h);
+    a.alloc = function(_, f, p) {
+      return g(_, f, p);
     };
     function x(_) {
       return m(_), o(_ < 0 ? 0 : K(_) | 0);
@@ -10684,36 +10684,36 @@ function Xc() {
     function O(_, f) {
       if ((typeof f != "string" || f === "") && (f = "utf8"), !a.isEncoding(f))
         throw new TypeError("Unknown encoding: " + f);
-      const h = V(_, f) | 0;
-      let S = o(h);
+      const p = V(_, f) | 0;
+      let S = o(p);
       const U = S.write(_, f);
-      return U !== h && (S = S.slice(0, U)), S;
+      return U !== p && (S = S.slice(0, U)), S;
     }
     function N(_) {
-      const f = _.length < 0 ? 0 : K(_.length) | 0, h = o(f);
+      const f = _.length < 0 ? 0 : K(_.length) | 0, p = o(f);
       for (let S = 0; S < f; S += 1)
-        h[S] = _[S] & 255;
-      return h;
+        p[S] = _[S] & 255;
+      return p;
     }
     function F(_) {
       if (Vt(_, Uint8Array)) {
         const f = new Uint8Array(_);
-        return C(f.buffer, f.byteOffset, f.byteLength);
+        return M(f.buffer, f.byteOffset, f.byteLength);
       }
       return N(_);
     }
-    function C(_, f, h) {
+    function M(_, f, p) {
       if (f < 0 || _.byteLength < f)
         throw new RangeError('"offset" is outside of buffer bounds');
-      if (_.byteLength < f + (h || 0))
+      if (_.byteLength < f + (p || 0))
         throw new RangeError('"length" is outside of buffer bounds');
       let S;
-      return f === void 0 && h === void 0 ? S = new Uint8Array(_) : h === void 0 ? S = new Uint8Array(_, f) : S = new Uint8Array(_, f, h), Object.setPrototypeOf(S, a.prototype), S;
+      return f === void 0 && p === void 0 ? S = new Uint8Array(_) : p === void 0 ? S = new Uint8Array(_, f) : S = new Uint8Array(_, f, p), Object.setPrototypeOf(S, a.prototype), S;
     }
     function k(_) {
       if (a.isBuffer(_)) {
-        const f = K(_.length) | 0, h = o(f);
-        return h.length === 0 || _.copy(h, 0, 0, f), h;
+        const f = K(_.length) | 0, p = o(f);
+        return p.length === 0 || _.copy(p, 0, 0, f), p;
       }
       if (_.length !== void 0)
         return typeof _.length != "number" || ze(_.length) ? o(0) : N(_);
@@ -10730,16 +10730,16 @@ function Xc() {
     }
     a.isBuffer = function(f) {
       return f != null && f._isBuffer === !0 && f !== a.prototype;
-    }, a.compare = function(f, h) {
-      if (Vt(f, Uint8Array) && (f = a.from(f, f.offset, f.byteLength)), Vt(h, Uint8Array) && (h = a.from(h, h.offset, h.byteLength)), !a.isBuffer(f) || !a.isBuffer(h))
+    }, a.compare = function(f, p) {
+      if (Vt(f, Uint8Array) && (f = a.from(f, f.offset, f.byteLength)), Vt(p, Uint8Array) && (p = a.from(p, p.offset, p.byteLength)), !a.isBuffer(f) || !a.isBuffer(p))
         throw new TypeError(
           'The "buf1", "buf2" arguments must be one of type Buffer or Uint8Array'
         );
-      if (f === h) return 0;
-      let S = f.length, U = h.length;
+      if (f === p) return 0;
+      let S = f.length, U = p.length;
       for (let $ = 0, Z = Math.min(S, U); $ < Z; ++$)
-        if (f[$] !== h[$]) {
-          S = f[$], U = h[$];
+        if (f[$] !== p[$]) {
+          S = f[$], U = p[$];
           break;
         }
       return S < U ? -1 : U < S ? 1 : 0;
@@ -10760,16 +10760,16 @@ function Xc() {
         default:
           return !1;
       }
-    }, a.concat = function(f, h) {
+    }, a.concat = function(f, p) {
       if (!Array.isArray(f))
         throw new TypeError('"list" argument must be an Array of Buffers');
       if (f.length === 0)
         return a.alloc(0);
       let S;
-      if (h === void 0)
-        for (h = 0, S = 0; S < f.length; ++S)
-          h += f[S].length;
-      const U = a.allocUnsafe(h);
+      if (p === void 0)
+        for (p = 0, S = 0; S < f.length; ++S)
+          p += f[S].length;
+      const U = a.allocUnsafe(p);
       let $ = 0;
       for (S = 0; S < f.length; ++S) {
         let Z = f[S];
@@ -10796,15 +10796,15 @@ function Xc() {
         throw new TypeError(
           'The "string" argument must be one of type string, Buffer, or ArrayBuffer. Received type ' + typeof _
         );
-      const h = _.length, S = arguments.length > 2 && arguments[2] === !0;
-      if (!S && h === 0) return 0;
+      const p = _.length, S = arguments.length > 2 && arguments[2] === !0;
+      if (!S && p === 0) return 0;
       let U = !1;
       for (; ; )
         switch (f) {
           case "ascii":
           case "latin1":
           case "binary":
-            return h;
+            return p;
           case "utf8":
           case "utf-8":
             return ke(_).length;
@@ -10812,9 +10812,9 @@ function Xc() {
           case "ucs-2":
           case "utf16le":
           case "utf-16le":
-            return h * 2;
+            return p * 2;
           case "hex":
-            return h >>> 1;
+            return p >>> 1;
           case "base64":
             return De(_).length;
           default:
@@ -10824,59 +10824,59 @@ function Xc() {
         }
     }
     a.byteLength = V;
-    function L(_, f, h) {
+    function L(_, f, p) {
       let S = !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))
+      if ((f === void 0 || f < 0) && (f = 0), f > this.length || ((p === void 0 || p > this.length) && (p = this.length), p <= 0) || (p >>>= 0, f >>>= 0, p <= f))
         return "";
       for (_ || (_ = "utf8"); ; )
         switch (_) {
           case "hex":
-            return R(this, f, h);
+            return R(this, f, p);
           case "utf8":
           case "utf-8":
-            return c(this, f, h);
+            return c(this, f, p);
           case "ascii":
-            return A(this, f, h);
+            return A(this, f, p);
           case "latin1":
           case "binary":
-            return v(this, f, h);
+            return v(this, f, p);
           case "base64":
-            return E(this, f, h);
+            return E(this, f, p);
           case "ucs2":
           case "ucs-2":
           case "utf16le":
           case "utf-16le":
-            return I(this, f, h);
+            return I(this, f, p);
           default:
             if (S) throw new TypeError("Unknown encoding: " + _);
             _ = (_ + "").toLowerCase(), S = !0;
         }
     }
     a.prototype._isBuffer = !0;
-    function z(_, f, h) {
+    function z(_, f, p) {
       const S = _[f];
-      _[f] = _[h], _[h] = S;
+      _[f] = _[p], _[p] = S;
     }
     a.prototype.swap16 = function() {
       const f = this.length;
       if (f % 2 !== 0)
         throw new RangeError("Buffer size must be a multiple of 16-bits");
-      for (let h = 0; h < f; h += 2)
-        z(this, h, h + 1);
+      for (let p = 0; p < f; p += 2)
+        z(this, p, p + 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)
-        z(this, h, h + 3), z(this, h + 1, h + 2);
+      for (let p = 0; p < f; p += 4)
+        z(this, p, p + 3), z(this, p + 1, p + 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)
-        z(this, h, h + 7), z(this, h + 1, h + 6), z(this, h + 2, h + 5), z(this, h + 3, h + 4);
+      for (let p = 0; p < f; p += 8)
+        z(this, p, p + 7), z(this, p + 1, p + 6), z(this, p + 2, p + 5), z(this, p + 3, p + 4);
       return this;
     }, a.prototype.toString = function() {
       const f = this.length;
@@ -10886,24 +10886,24 @@ function Xc() {
       return this === f ? !0 : a.compare(this, f) === 0;
     }, a.prototype.inspect = function() {
       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, S, U, $) {
+      const p = t.INSPECT_MAX_BYTES;
+      return f = this.toString("hex", 0, p).replace(/(.{2})/g, "$1 ").trim(), this.length > p && (f += " ... "), "<Buffer " + f + ">";
+    }, r && (a.prototype[r] = a.prototype.inspect), a.prototype.compare = function(f, p, S, U, $) {
       if (Vt(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), S === void 0 && (S = f ? f.length : 0), U === void 0 && (U = 0), $ === void 0 && ($ = this.length), h < 0 || S > f.length || U < 0 || $ > this.length)
+      if (p === void 0 && (p = 0), S === void 0 && (S = f ? f.length : 0), U === void 0 && (U = 0), $ === void 0 && ($ = this.length), p < 0 || S > f.length || U < 0 || $ > this.length)
         throw new RangeError("out of range index");
-      if (U >= $ && h >= S)
+      if (U >= $ && p >= S)
         return 0;
       if (U >= $)
         return -1;
-      if (h >= S)
+      if (p >= S)
         return 1;
-      if (h >>>= 0, S >>>= 0, U >>>= 0, $ >>>= 0, this === f) return 0;
-      let Z = $ - U, Re = S - h;
-      const ye = Math.min(Z, Re), me = this.slice(U, $), Fe = f.slice(h, S);
+      if (p >>>= 0, S >>>= 0, U >>>= 0, $ >>>= 0, this === f) return 0;
+      let Z = $ - U, Re = S - p;
+      const ye = Math.min(Z, Re), me = this.slice(U, $), Fe = f.slice(p, S);
       for (let he = 0; he < ye; ++he)
         if (me[he] !== Fe[he]) {
           Z = me[he], Re = Fe[he];
@@ -10911,26 +10911,26 @@ function Xc() {
         }
       return Z < Re ? -1 : Re < Z ? 1 : 0;
     };
-    function J(_, f, h, S, U) {
+    function J(_, f, p, S, U) {
       if (_.length === 0) return -1;
-      if (typeof h == "string" ? (S = h, h = 0) : h > 2147483647 ? h = 2147483647 : h < -2147483648 && (h = -2147483648), h = +h, ze(h) && (h = U ? 0 : _.length - 1), h < 0 && (h = _.length + h), h >= _.length) {
+      if (typeof p == "string" ? (S = p, p = 0) : p > 2147483647 ? p = 2147483647 : p < -2147483648 && (p = -2147483648), p = +p, ze(p) && (p = U ? 0 : _.length - 1), p < 0 && (p = _.length + p), p >= _.length) {
         if (U) return -1;
-        h = _.length - 1;
-      } else if (h < 0)
-        if (U) h = 0;
+        p = _.length - 1;
+      } else if (p < 0)
+        if (U) p = 0;
         else return -1;
       if (typeof f == "string" && (f = a.from(f, S)), a.isBuffer(f))
-        return f.length === 0 ? -1 : te(_, f, h, S, U);
+        return f.length === 0 ? -1 : te(_, f, p, S, U);
       if (typeof f == "number")
-        return f = f & 255, typeof Uint8Array.prototype.indexOf == "function" ? U ? Uint8Array.prototype.indexOf.call(_, f, h) : Uint8Array.prototype.lastIndexOf.call(_, f, h) : te(_, [f], h, S, U);
+        return f = f & 255, typeof Uint8Array.prototype.indexOf == "function" ? U ? Uint8Array.prototype.indexOf.call(_, f, p) : Uint8Array.prototype.lastIndexOf.call(_, f, p) : te(_, [f], p, S, U);
       throw new TypeError("val must be string, number or Buffer");
     }
-    function te(_, f, h, S, U) {
+    function te(_, f, p, S, U) {
       let $ = 1, Z = _.length, Re = f.length;
       if (S !== void 0 && (S = String(S).toLowerCase(), S === "ucs2" || S === "ucs-2" || S === "utf16le" || S === "utf-16le")) {
         if (_.length < 2 || f.length < 2)
           return -1;
-        $ = 2, Z /= 2, Re /= 2, h /= 2;
+        $ = 2, Z /= 2, Re /= 2, p /= 2;
       }
       function ye(Fe, he) {
         return $ === 1 ? Fe[he] : Fe.readUInt16BE(he * $);
@@ -10938,13 +10938,13 @@ function Xc() {
       let me;
       if (U) {
         let Fe = -1;
-        for (me = h; me < Z; me++)
+        for (me = p; me < Z; me++)
           if (ye(_, me) === ye(f, Fe === -1 ? 0 : me - Fe)) {
             if (Fe === -1 && (Fe = me), me - Fe + 1 === Re) return Fe * $;
           } else
             Fe !== -1 && (me -= me - Fe), Fe = -1;
       } else
-        for (h + Re > Z && (h = Z - Re), me = h; me >= 0; me--) {
+        for (p + Re > Z && (p = Z - Re), me = p; me >= 0; me--) {
           let Fe = !0;
           for (let he = 0; he < Re; he++)
             if (ye(_, me + he) !== ye(f, he)) {
@@ -10955,16 +10955,16 @@ function Xc() {
         }
       return -1;
     }
-    a.prototype.includes = function(f, h, S) {
-      return this.indexOf(f, h, S) !== -1;
-    }, a.prototype.indexOf = function(f, h, S) {
-      return J(this, f, h, S, !0);
-    }, a.prototype.lastIndexOf = function(f, h, S) {
-      return J(this, f, h, S, !1);
+    a.prototype.includes = function(f, p, S) {
+      return this.indexOf(f, p, S) !== -1;
+    }, a.prototype.indexOf = function(f, p, S) {
+      return J(this, f, p, S, !0);
+    }, a.prototype.lastIndexOf = function(f, p, S) {
+      return J(this, f, p, S, !1);
     };
-    function ne(_, f, h, S) {
-      h = Number(h) || 0;
-      const U = _.length - h;
+    function ne(_, f, p, S) {
+      p = Number(p) || 0;
+      const U = _.length - p;
       S ? (S = Number(S), S > U && (S = U)) : S = U;
       const $ = f.length;
       S > $ / 2 && (S = $ / 2);
@@ -10972,56 +10972,56 @@ function Xc() {
       for (Z = 0; Z < S; ++Z) {
         const Re = parseInt(f.substr(Z * 2, 2), 16);
         if (ze(Re)) return Z;
-        _[h + Z] = Re;
+        _[p + Z] = Re;
       }
       return Z;
     }
-    function q(_, f, h, S) {
-      return Le(ke(f, _.length - h), _, h, S);
+    function q(_, f, p, S) {
+      return Le(ke(f, _.length - p), _, p, S);
     }
-    function B(_, f, h, S) {
-      return Le($e(f), _, h, S);
+    function C(_, f, p, S) {
+      return Le($e(f), _, p, S);
     }
-    function P(_, f, h, S) {
-      return Le(De(f), _, h, S);
+    function P(_, f, p, S) {
+      return Le(De(f), _, p, S);
     }
-    function j(_, f, h, S) {
-      return Le(mr(f, _.length - h), _, h, S);
+    function j(_, f, p, S) {
+      return Le(mr(f, _.length - p), _, p, S);
     }
-    a.prototype.write = function(f, h, S, U) {
-      if (h === void 0)
-        U = "utf8", S = this.length, h = 0;
-      else if (S === void 0 && typeof h == "string")
-        U = h, S = this.length, h = 0;
-      else if (isFinite(h))
-        h = h >>> 0, isFinite(S) ? (S = S >>> 0, U === void 0 && (U = "utf8")) : (U = S, S = void 0);
+    a.prototype.write = function(f, p, S, U) {
+      if (p === void 0)
+        U = "utf8", S = this.length, p = 0;
+      else if (S === void 0 && typeof p == "string")
+        U = p, S = this.length, p = 0;
+      else if (isFinite(p))
+        p = p >>> 0, isFinite(S) ? (S = S >>> 0, U === void 0 && (U = "utf8")) : (U = S, S = void 0);
       else
         throw new Error(
           "Buffer.write(string, encoding, offset[, length]) is no longer supported"
         );
-      const $ = this.length - h;
-      if ((S === void 0 || S > $) && (S = $), f.length > 0 && (S < 0 || h < 0) || h > this.length)
+      const $ = this.length - p;
+      if ((S === void 0 || S > $) && (S = $), f.length > 0 && (S < 0 || p < 0) || p > this.length)
         throw new RangeError("Attempt to write outside buffer bounds");
       U || (U = "utf8");
       let Z = !1;
       for (; ; )
         switch (U) {
           case "hex":
-            return ne(this, f, h, S);
+            return ne(this, f, p, S);
           case "utf8":
           case "utf-8":
-            return q(this, f, h, S);
+            return q(this, f, p, S);
           case "ascii":
           case "latin1":
           case "binary":
-            return B(this, f, h, S);
+            return C(this, f, p, S);
           case "base64":
-            return P(this, f, h, S);
+            return P(this, f, p, S);
           case "ucs2":
           case "ucs-2":
           case "utf16le":
           case "utf-16le":
-            return j(this, f, h, S);
+            return j(this, f, p, S);
           default:
             if (Z) throw new TypeError("Unknown encoding: " + U);
             U = ("" + U).toLowerCase(), Z = !0;
@@ -11032,17 +11032,17 @@ function Xc() {
         data: Array.prototype.slice.call(this._arr || this, 0)
       };
     };
-    function E(_, f, h) {
-      return f === 0 && h === _.length ? e.fromByteArray(_) : e.fromByteArray(_.slice(f, h));
+    function E(_, f, p) {
+      return f === 0 && p === _.length ? e.fromByteArray(_) : e.fromByteArray(_.slice(f, p));
     }
-    function c(_, f, h) {
-      h = Math.min(_.length, h);
+    function c(_, f, p) {
+      p = Math.min(_.length, p);
       const S = [];
       let U = f;
-      for (; U < h; ) {
+      for (; U < p; ) {
         const $ = _[U];
         let Z = null, Re = $ > 239 ? 4 : $ > 223 ? 3 : $ > 191 ? 2 : 1;
-        if (U + Re <= h) {
+        if (U + Re <= p) {
           let ye, me, Fe, he;
           switch (Re) {
             case 1:
@@ -11062,261 +11062,261 @@ function Xc() {
       }
       return y(S);
     }
-    const p = 4096;
+    const h = 4096;
     function y(_) {
       const f = _.length;
-      if (f <= p)
+      if (f <= h)
         return String.fromCharCode.apply(String, _);
-      let h = "", S = 0;
+      let p = "", S = 0;
       for (; S < f; )
-        h += String.fromCharCode.apply(
+        p += String.fromCharCode.apply(
           String,
-          _.slice(S, S += p)
+          _.slice(S, S += h)
         );
-      return h;
+      return p;
     }
-    function A(_, f, h) {
+    function A(_, f, p) {
       let S = "";
-      h = Math.min(_.length, h);
-      for (let U = f; U < h; ++U)
+      p = Math.min(_.length, p);
+      for (let U = f; U < p; ++U)
         S += String.fromCharCode(_[U] & 127);
       return S;
     }
-    function v(_, f, h) {
+    function v(_, f, p) {
       let S = "";
-      h = Math.min(_.length, h);
-      for (let U = f; U < h; ++U)
+      p = Math.min(_.length, p);
+      for (let U = f; U < p; ++U)
         S += String.fromCharCode(_[U]);
       return S;
     }
-    function R(_, f, h) {
+    function R(_, f, p) {
       const S = _.length;
-      (!f || f < 0) && (f = 0), (!h || h < 0 || h > S) && (h = S);
+      (!f || f < 0) && (f = 0), (!p || p < 0 || p > S) && (p = S);
       let U = "";
-      for (let $ = f; $ < h; ++$)
+      for (let $ = f; $ < p; ++$)
         U += He[_[$]];
       return U;
     }
-    function I(_, f, h) {
-      const S = _.slice(f, h);
+    function I(_, f, p) {
+      const S = _.slice(f, p);
       let U = "";
       for (let $ = 0; $ < S.length - 1; $ += 2)
         U += String.fromCharCode(S[$] + S[$ + 1] * 256);
       return U;
     }
-    a.prototype.slice = function(f, h) {
+    a.prototype.slice = function(f, p) {
       const S = this.length;
-      f = ~~f, h = h === void 0 ? S : ~~h, f < 0 ? (f += S, f < 0 && (f = 0)) : f > S && (f = S), h < 0 ? (h += S, h < 0 && (h = 0)) : h > S && (h = S), h < f && (h = f);
-      const U = this.subarray(f, h);
+      f = ~~f, p = p === void 0 ? S : ~~p, f < 0 ? (f += S, f < 0 && (f = 0)) : f > S && (f = S), p < 0 ? (p += S, p < 0 && (p = 0)) : p > S && (p = S), p < f && (p = f);
+      const U = this.subarray(f, p);
       return Object.setPrototypeOf(U, a.prototype), U;
     };
-    function b(_, f, h) {
+    function b(_, f, p) {
       if (_ % 1 !== 0 || _ < 0) throw new RangeError("offset is not uint");
-      if (_ + f > h) throw new RangeError("Trying to access beyond buffer length");
+      if (_ + f > p) throw new RangeError("Trying to access beyond buffer length");
     }
-    a.prototype.readUintLE = a.prototype.readUIntLE = function(f, h, S) {
-      f = f >>> 0, h = h >>> 0, S || b(f, h, this.length);
+    a.prototype.readUintLE = a.prototype.readUIntLE = function(f, p, S) {
+      f = f >>> 0, p = p >>> 0, S || b(f, p, this.length);
       let U = this[f], $ = 1, Z = 0;
-      for (; ++Z < h && ($ *= 256); )
+      for (; ++Z < p && ($ *= 256); )
         U += this[f + Z] * $;
       return U;
-    }, a.prototype.readUintBE = a.prototype.readUIntBE = function(f, h, S) {
-      f = f >>> 0, h = h >>> 0, S || b(f, h, this.length);
-      let U = this[f + --h], $ = 1;
-      for (; h > 0 && ($ *= 256); )
-        U += this[f + --h] * $;
+    }, a.prototype.readUintBE = a.prototype.readUIntBE = function(f, p, S) {
+      f = f >>> 0, p = p >>> 0, S || b(f, p, this.length);
+      let U = this[f + --p], $ = 1;
+      for (; p > 0 && ($ *= 256); )
+        U += this[f + --p] * $;
       return U;
-    }, a.prototype.readUint8 = a.prototype.readUInt8 = function(f, h) {
-      return f = f >>> 0, h || b(f, 1, this.length), this[f];
-    }, a.prototype.readUint16LE = a.prototype.readUInt16LE = function(f, h) {
-      return f = f >>> 0, h || b(f, 2, this.length), this[f] | this[f + 1] << 8;
-    }, a.prototype.readUint16BE = a.prototype.readUInt16BE = function(f, h) {
-      return f = f >>> 0, h || b(f, 2, this.length), this[f] << 8 | this[f + 1];
-    }, a.prototype.readUint32LE = a.prototype.readUInt32LE = function(f, h) {
-      return f = f >>> 0, h || b(f, 4, this.length), (this[f] | this[f + 1] << 8 | this[f + 2] << 16) + this[f + 3] * 16777216;
-    }, a.prototype.readUint32BE = a.prototype.readUInt32BE = function(f, h) {
-      return f = f >>> 0, h || b(f, 4, this.length), this[f] * 16777216 + (this[f + 1] << 16 | this[f + 2] << 8 | this[f + 3]);
+    }, a.prototype.readUint8 = a.prototype.readUInt8 = function(f, p) {
+      return f = f >>> 0, p || b(f, 1, this.length), this[f];
+    }, a.prototype.readUint16LE = a.prototype.readUInt16LE = function(f, p) {
+      return f = f >>> 0, p || b(f, 2, this.length), this[f] | this[f + 1] << 8;
+    }, a.prototype.readUint16BE = a.prototype.readUInt16BE = function(f, p) {
+      return f = f >>> 0, p || b(f, 2, this.length), this[f] << 8 | this[f + 1];
+    }, a.prototype.readUint32LE = a.prototype.readUInt32LE = function(f, p) {
+      return f = f >>> 0, p || b(f, 4, this.length), (this[f] | this[f + 1] << 8 | this[f + 2] << 16) + this[f + 3] * 16777216;
+    }, a.prototype.readUint32BE = a.prototype.readUInt32BE = function(f, p) {
+      return f = f >>> 0, p || b(f, 4, this.length), this[f] * 16777216 + (this[f + 1] << 16 | this[f + 2] << 8 | this[f + 3]);
     }, a.prototype.readBigUInt64LE = Jt(function(f) {
       f = f >>> 0, Pe(f, "offset");
-      const h = this[f], S = this[f + 7];
-      (h === void 0 || S === void 0) && ve(f, this.length - 8);
-      const U = h + this[++f] * 2 ** 8 + this[++f] * 2 ** 16 + this[++f] * 2 ** 24, $ = this[++f] + this[++f] * 2 ** 8 + this[++f] * 2 ** 16 + S * 2 ** 24;
+      const p = this[f], S = this[f + 7];
+      (p === void 0 || S === void 0) && ve(f, this.length - 8);
+      const U = p + this[++f] * 2 ** 8 + this[++f] * 2 ** 16 + this[++f] * 2 ** 24, $ = this[++f] + this[++f] * 2 ** 8 + this[++f] * 2 ** 16 + S * 2 ** 24;
       return BigInt(U) + (BigInt($) << BigInt(32));
     }), a.prototype.readBigUInt64BE = Jt(function(f) {
       f = f >>> 0, Pe(f, "offset");
-      const h = this[f], S = this[f + 7];
-      (h === void 0 || S === void 0) && ve(f, this.length - 8);
-      const U = 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 + S;
+      const p = this[f], S = this[f + 7];
+      (p === void 0 || S === void 0) && ve(f, this.length - 8);
+      const U = p * 2 ** 24 + this[++f] * 2 ** 16 + this[++f] * 2 ** 8 + this[++f], $ = this[++f] * 2 ** 24 + this[++f] * 2 ** 16 + this[++f] * 2 ** 8 + S;
       return (BigInt(U) << BigInt(32)) + BigInt($);
-    }), a.prototype.readIntLE = function(f, h, S) {
-      f = f >>> 0, h = h >>> 0, S || b(f, h, this.length);
+    }), a.prototype.readIntLE = function(f, p, S) {
+      f = f >>> 0, p = p >>> 0, S || b(f, p, this.length);
       let U = this[f], $ = 1, Z = 0;
-      for (; ++Z < h && ($ *= 256); )
+      for (; ++Z < p && ($ *= 256); )
         U += this[f + Z] * $;
-      return $ *= 128, U >= $ && (U -= Math.pow(2, 8 * h)), U;
-    }, a.prototype.readIntBE = function(f, h, S) {
-      f = f >>> 0, h = h >>> 0, S || b(f, h, this.length);
-      let U = h, $ = 1, Z = this[f + --U];
+      return $ *= 128, U >= $ && (U -= Math.pow(2, 8 * p)), U;
+    }, a.prototype.readIntBE = function(f, p, S) {
+      f = f >>> 0, p = p >>> 0, S || b(f, p, this.length);
+      let U = p, $ = 1, Z = this[f + --U];
       for (; U > 0 && ($ *= 256); )
         Z += this[f + --U] * $;
-      return $ *= 128, Z >= $ && (Z -= Math.pow(2, 8 * h)), Z;
-    }, a.prototype.readInt8 = function(f, h) {
-      return f = f >>> 0, h || b(f, 1, this.length), this[f] & 128 ? (255 - this[f] + 1) * -1 : this[f];
-    }, a.prototype.readInt16LE = function(f, h) {
-      f = f >>> 0, h || b(f, 2, this.length);
+      return $ *= 128, Z >= $ && (Z -= Math.pow(2, 8 * p)), Z;
+    }, a.prototype.readInt8 = function(f, p) {
+      return f = f >>> 0, p || b(f, 1, this.length), this[f] & 128 ? (255 - this[f] + 1) * -1 : this[f];
+    }, a.prototype.readInt16LE = function(f, p) {
+      f = f >>> 0, p || b(f, 2, this.length);
       const S = this[f] | this[f + 1] << 8;
       return S & 32768 ? S | 4294901760 : S;
-    }, a.prototype.readInt16BE = function(f, h) {
-      f = f >>> 0, h || b(f, 2, this.length);
+    }, a.prototype.readInt16BE = function(f, p) {
+      f = f >>> 0, p || b(f, 2, this.length);
       const S = this[f + 1] | this[f] << 8;
       return S & 32768 ? S | 4294901760 : S;
-    }, a.prototype.readInt32LE = function(f, h) {
-      return f = f >>> 0, h || b(f, 4, this.length), this[f] | this[f + 1] << 8 | this[f + 2] << 16 | this[f + 3] << 24;
-    }, a.prototype.readInt32BE = function(f, h) {
-      return f = f >>> 0, h || b(f, 4, this.length), this[f] << 24 | this[f + 1] << 16 | this[f + 2] << 8 | this[f + 3];
+    }, a.prototype.readInt32LE = function(f, p) {
+      return f = f >>> 0, p || b(f, 4, this.length), this[f] | this[f + 1] << 8 | this[f + 2] << 16 | this[f + 3] << 24;
+    }, a.prototype.readInt32BE = function(f, p) {
+      return f = f >>> 0, p || b(f, 4, this.length), this[f] << 24 | this[f + 1] << 16 | this[f + 2] << 8 | this[f + 3];
     }, a.prototype.readBigInt64LE = Jt(function(f) {
       f = f >>> 0, Pe(f, "offset");
-      const h = this[f], S = this[f + 7];
-      (h === void 0 || S === void 0) && ve(f, this.length - 8);
+      const p = this[f], S = this[f + 7];
+      (p === void 0 || S === void 0) && ve(f, this.length - 8);
       const U = this[f + 4] + this[f + 5] * 2 ** 8 + this[f + 6] * 2 ** 16 + (S << 24);
-      return (BigInt(U) << BigInt(32)) + BigInt(h + this[++f] * 2 ** 8 + this[++f] * 2 ** 16 + this[++f] * 2 ** 24);
+      return (BigInt(U) << BigInt(32)) + BigInt(p + this[++f] * 2 ** 8 + this[++f] * 2 ** 16 + this[++f] * 2 ** 24);
     }), a.prototype.readBigInt64BE = Jt(function(f) {
       f = f >>> 0, Pe(f, "offset");
-      const h = this[f], S = this[f + 7];
-      (h === void 0 || S === void 0) && ve(f, this.length - 8);
-      const U = (h << 24) + // Overflow
+      const p = this[f], S = this[f + 7];
+      (p === void 0 || S === void 0) && ve(f, this.length - 8);
+      const U = (p << 24) + // Overflow
       this[++f] * 2 ** 16 + this[++f] * 2 ** 8 + this[++f];
       return (BigInt(U) << BigInt(32)) + BigInt(this[++f] * 2 ** 24 + this[++f] * 2 ** 16 + this[++f] * 2 ** 8 + S);
-    }), a.prototype.readFloatLE = function(f, h) {
-      return f = f >>> 0, h || b(f, 4, this.length), n.read(this, f, !0, 23, 4);
-    }, a.prototype.readFloatBE = function(f, h) {
-      return f = f >>> 0, h || b(f, 4, this.length), n.read(this, f, !1, 23, 4);
-    }, a.prototype.readDoubleLE = function(f, h) {
-      return f = f >>> 0, h || b(f, 8, this.length), n.read(this, f, !0, 52, 8);
-    }, a.prototype.readDoubleBE = function(f, h) {
-      return f = f >>> 0, h || b(f, 8, this.length), n.read(this, f, !1, 52, 8);
+    }), a.prototype.readFloatLE = function(f, p) {
+      return f = f >>> 0, p || b(f, 4, this.length), n.read(this, f, !0, 23, 4);
+    }, a.prototype.readFloatBE = function(f, p) {
+      return f = f >>> 0, p || b(f, 4, this.length), n.read(this, f, !1, 23, 4);
+    }, a.prototype.readDoubleLE = function(f, p) {
+      return f = f >>> 0, p || b(f, 8, this.length), n.read(this, f, !0, 52, 8);
+    }, a.prototype.readDoubleBE = function(f, p) {
+      return f = f >>> 0, p || b(f, 8, this.length), n.read(this, f, !1, 52, 8);
     };
-    function u(_, f, h, S, U, $) {
+    function u(_, f, p, S, U, $) {
       if (!a.isBuffer(_)) throw new TypeError('"buffer" argument must be a Buffer instance');
       if (f > U || f < $) throw new RangeError('"value" argument is out of bounds');
-      if (h + S > _.length) throw new RangeError("Index out of range");
+      if (p + S > _.length) throw new RangeError("Index out of range");
     }
-    a.prototype.writeUintLE = a.prototype.writeUIntLE = function(f, h, S, U) {
-      if (f = +f, h = h >>> 0, S = S >>> 0, !U) {
+    a.prototype.writeUintLE = a.prototype.writeUIntLE = function(f, p, S, U) {
+      if (f = +f, p = p >>> 0, S = S >>> 0, !U) {
         const Re = Math.pow(2, 8 * S) - 1;
-        u(this, f, h, S, Re, 0);
+        u(this, f, p, S, Re, 0);
       }
       let $ = 1, Z = 0;
-      for (this[h] = f & 255; ++Z < S && ($ *= 256); )
-        this[h + Z] = f / $ & 255;
-      return h + S;
-    }, a.prototype.writeUintBE = a.prototype.writeUIntBE = function(f, h, S, U) {
-      if (f = +f, h = h >>> 0, S = S >>> 0, !U) {
+      for (this[p] = f & 255; ++Z < S && ($ *= 256); )
+        this[p + Z] = f / $ & 255;
+      return p + S;
+    }, a.prototype.writeUintBE = a.prototype.writeUIntBE = function(f, p, S, U) {
+      if (f = +f, p = p >>> 0, S = S >>> 0, !U) {
         const Re = Math.pow(2, 8 * S) - 1;
-        u(this, f, h, S, Re, 0);
+        u(this, f, p, S, Re, 0);
       }
       let $ = S - 1, Z = 1;
-      for (this[h + $] = f & 255; --$ >= 0 && (Z *= 256); )
-        this[h + $] = f / Z & 255;
-      return h + S;
-    }, a.prototype.writeUint8 = a.prototype.writeUInt8 = function(f, h, S) {
-      return f = +f, h = h >>> 0, S || u(this, f, h, 1, 255, 0), this[h] = f & 255, h + 1;
-    }, a.prototype.writeUint16LE = a.prototype.writeUInt16LE = function(f, h, S) {
-      return f = +f, h = h >>> 0, S || u(this, f, h, 2, 65535, 0), this[h] = f & 255, this[h + 1] = f >>> 8, h + 2;
-    }, a.prototype.writeUint16BE = a.prototype.writeUInt16BE = function(f, h, S) {
-      return f = +f, h = h >>> 0, S || u(this, f, h, 2, 65535, 0), this[h] = f >>> 8, this[h + 1] = f & 255, h + 2;
-    }, a.prototype.writeUint32LE = a.prototype.writeUInt32LE = function(f, h, S) {
-      return f = +f, h = h >>> 0, S || u(this, f, h, 4, 4294967295, 0), this[h + 3] = f >>> 24, this[h + 2] = f >>> 16, this[h + 1] = f >>> 8, this[h] = f & 255, h + 4;
-    }, a.prototype.writeUint32BE = a.prototype.writeUInt32BE = function(f, h, S) {
-      return f = +f, h = h >>> 0, S || 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;
+      for (this[p + $] = f & 255; --$ >= 0 && (Z *= 256); )
+        this[p + $] = f / Z & 255;
+      return p + S;
+    }, a.prototype.writeUint8 = a.prototype.writeUInt8 = function(f, p, S) {
+      return f = +f, p = p >>> 0, S || u(this, f, p, 1, 255, 0), this[p] = f & 255, p + 1;
+    }, a.prototype.writeUint16LE = a.prototype.writeUInt16LE = function(f, p, S) {
+      return f = +f, p = p >>> 0, S || u(this, f, p, 2, 65535, 0), this[p] = f & 255, this[p + 1] = f >>> 8, p + 2;
+    }, a.prototype.writeUint16BE = a.prototype.writeUInt16BE = function(f, p, S) {
+      return f = +f, p = p >>> 0, S || u(this, f, p, 2, 65535, 0), this[p] = f >>> 8, this[p + 1] = f & 255, p + 2;
+    }, a.prototype.writeUint32LE = a.prototype.writeUInt32LE = function(f, p, S) {
+      return f = +f, p = p >>> 0, S || u(this, f, p, 4, 4294967295, 0), this[p + 3] = f >>> 24, this[p + 2] = f >>> 16, this[p + 1] = f >>> 8, this[p] = f & 255, p + 4;
+    }, a.prototype.writeUint32BE = a.prototype.writeUInt32BE = function(f, p, S) {
+      return f = +f, p = p >>> 0, S || u(this, f, p, 4, 4294967295, 0), this[p] = f >>> 24, this[p + 1] = f >>> 16, this[p + 2] = f >>> 8, this[p + 3] = f & 255, p + 4;
     };
-    function l(_, f, h, S, U) {
-      we(f, S, U, _, h, 7);
+    function l(_, f, p, S, U) {
+      we(f, S, U, _, p, 7);
       let $ = Number(f & BigInt(4294967295));
-      _[h++] = $, $ = $ >> 8, _[h++] = $, $ = $ >> 8, _[h++] = $, $ = $ >> 8, _[h++] = $;
+      _[p++] = $, $ = $ >> 8, _[p++] = $, $ = $ >> 8, _[p++] = $, $ = $ >> 8, _[p++] = $;
       let Z = Number(f >> BigInt(32) & BigInt(4294967295));
-      return _[h++] = Z, Z = Z >> 8, _[h++] = Z, Z = Z >> 8, _[h++] = Z, Z = Z >> 8, _[h++] = Z, h;
+      return _[p++] = Z, Z = Z >> 8, _[p++] = Z, Z = Z >> 8, _[p++] = Z, Z = Z >> 8, _[p++] = Z, p;
     }
-    function w(_, f, h, S, U) {
-      we(f, S, U, _, h, 7);
+    function w(_, f, p, S, U) {
+      we(f, S, U, _, p, 7);
       let $ = Number(f & BigInt(4294967295));
-      _[h + 7] = $, $ = $ >> 8, _[h + 6] = $, $ = $ >> 8, _[h + 5] = $, $ = $ >> 8, _[h + 4] = $;
+      _[p + 7] = $, $ = $ >> 8, _[p + 6] = $, $ = $ >> 8, _[p + 5] = $, $ = $ >> 8, _[p + 4] = $;
       let Z = Number(f >> BigInt(32) & BigInt(4294967295));
-      return _[h + 3] = Z, Z = Z >> 8, _[h + 2] = Z, Z = Z >> 8, _[h + 1] = Z, Z = Z >> 8, _[h] = Z, h + 8;
-    }
-    a.prototype.writeBigUInt64LE = Jt(function(f, h = 0) {
-      return l(this, f, h, BigInt(0), BigInt("0xffffffffffffffff"));
-    }), a.prototype.writeBigUInt64BE = Jt(function(f, h = 0) {
-      return w(this, f, h, BigInt(0), BigInt("0xffffffffffffffff"));
-    }), a.prototype.writeIntLE = function(f, h, S, U) {
-      if (f = +f, h = h >>> 0, !U) {
+      return _[p + 3] = Z, Z = Z >> 8, _[p + 2] = Z, Z = Z >> 8, _[p + 1] = Z, Z = Z >> 8, _[p] = Z, p + 8;
+    }
+    a.prototype.writeBigUInt64LE = Jt(function(f, p = 0) {
+      return l(this, f, p, BigInt(0), BigInt("0xffffffffffffffff"));
+    }), a.prototype.writeBigUInt64BE = Jt(function(f, p = 0) {
+      return w(this, f, p, BigInt(0), BigInt("0xffffffffffffffff"));
+    }), a.prototype.writeIntLE = function(f, p, S, U) {
+      if (f = +f, p = p >>> 0, !U) {
         const ye = Math.pow(2, 8 * S - 1);
-        u(this, f, h, S, ye - 1, -ye);
+        u(this, f, p, S, ye - 1, -ye);
       }
       let $ = 0, Z = 1, Re = 0;
-      for (this[h] = f & 255; ++$ < S && (Z *= 256); )
-        f < 0 && Re === 0 && this[h + $ - 1] !== 0 && (Re = 1), this[h + $] = (f / Z >> 0) - Re & 255;
-      return h + S;
-    }, a.prototype.writeIntBE = function(f, h, S, U) {
-      if (f = +f, h = h >>> 0, !U) {
+      for (this[p] = f & 255; ++$ < S && (Z *= 256); )
+        f < 0 && Re === 0 && this[p + $ - 1] !== 0 && (Re = 1), this[p + $] = (f / Z >> 0) - Re & 255;
+      return p + S;
+    }, a.prototype.writeIntBE = function(f, p, S, U) {
+      if (f = +f, p = p >>> 0, !U) {
         const ye = Math.pow(2, 8 * S - 1);
-        u(this, f, h, S, ye - 1, -ye);
+        u(this, f, p, S, ye - 1, -ye);
       }
       let $ = S - 1, Z = 1, Re = 0;
-      for (this[h + $] = f & 255; --$ >= 0 && (Z *= 256); )
-        f < 0 && Re === 0 && this[h + $ + 1] !== 0 && (Re = 1), this[h + $] = (f / Z >> 0) - Re & 255;
-      return h + S;
-    }, a.prototype.writeInt8 = function(f, h, S) {
-      return f = +f, h = h >>> 0, S || u(this, f, h, 1, 127, -128), f < 0 && (f = 255 + f + 1), this[h] = f & 255, h + 1;
-    }, a.prototype.writeInt16LE = function(f, h, S) {
-      return f = +f, h = h >>> 0, S || u(this, f, h, 2, 32767, -32768), this[h] = f & 255, this[h + 1] = f >>> 8, h + 2;
-    }, a.prototype.writeInt16BE = function(f, h, S) {
-      return f = +f, h = h >>> 0, S || u(this, f, h, 2, 32767, -32768), this[h] = f >>> 8, this[h + 1] = f & 255, h + 2;
-    }, a.prototype.writeInt32LE = function(f, h, S) {
-      return f = +f, h = h >>> 0, S || u(this, f, h, 4, 2147483647, -2147483648), this[h] = f & 255, this[h + 1] = f >>> 8, this[h + 2] = f >>> 16, this[h + 3] = f >>> 24, h + 4;
-    }, a.prototype.writeInt32BE = function(f, h, S) {
-      return f = +f, h = h >>> 0, S || u(this, f, h, 4, 2147483647, -2147483648), f < 0 && (f = 4294967295 + f + 1), this[h] = f >>> 24, this[h + 1] = f >>> 16, this[h + 2] = f >>> 8, this[h + 3] = f & 255, h + 4;
-    }, a.prototype.writeBigInt64LE = Jt(function(f, h = 0) {
-      return l(this, f, h, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
-    }), a.prototype.writeBigInt64BE = Jt(function(f, h = 0) {
-      return w(this, f, h, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
+      for (this[p + $] = f & 255; --$ >= 0 && (Z *= 256); )
+        f < 0 && Re === 0 && this[p + $ + 1] !== 0 && (Re = 1), this[p + $] = (f / Z >> 0) - Re & 255;
+      return p + S;
+    }, a.prototype.writeInt8 = function(f, p, S) {
+      return f = +f, p = p >>> 0, S || u(this, f, p, 1, 127, -128), f < 0 && (f = 255 + f + 1), this[p] = f & 255, p + 1;
+    }, a.prototype.writeInt16LE = function(f, p, S) {
+      return f = +f, p = p >>> 0, S || u(this, f, p, 2, 32767, -32768), this[p] = f & 255, this[p + 1] = f >>> 8, p + 2;
+    }, a.prototype.writeInt16BE = function(f, p, S) {
+      return f = +f, p = p >>> 0, S || u(this, f, p, 2, 32767, -32768), this[p] = f >>> 8, this[p + 1] = f & 255, p + 2;
+    }, a.prototype.writeInt32LE = function(f, p, S) {
+      return f = +f, p = p >>> 0, S || u(this, f, p, 4, 2147483647, -2147483648), this[p] = f & 255, this[p + 1] = f >>> 8, this[p + 2] = f >>> 16, this[p + 3] = f >>> 24, p + 4;
+    }, a.prototype.writeInt32BE = function(f, p, S) {
+      return f = +f, p = p >>> 0, S || u(this, f, p, 4, 2147483647, -2147483648), f < 0 && (f = 4294967295 + f + 1), this[p] = f >>> 24, this[p + 1] = f >>> 16, this[p + 2] = f >>> 8, this[p + 3] = f & 255, p + 4;
+    }, a.prototype.writeBigInt64LE = Jt(function(f, p = 0) {
+      return l(this, f, p, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
+    }), a.prototype.writeBigInt64BE = Jt(function(f, p = 0) {
+      return w(this, f, p, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
     });
-    function T(_, f, h, S, U, $) {
-      if (h + S > _.length) throw new RangeError("Index out of range");
-      if (h < 0) throw new RangeError("Index out of range");
+    function T(_, f, p, S, U, $) {
+      if (p + S > _.length) throw new RangeError("Index out of range");
+      if (p < 0) throw new RangeError("Index out of range");
     }
-    function D(_, f, h, S, U) {
-      return f = +f, h = h >>> 0, U || T(_, f, h, 4), n.write(_, f, h, S, 23, 4), h + 4;
+    function D(_, f, p, S, U) {
+      return f = +f, p = p >>> 0, U || T(_, f, p, 4), n.write(_, f, p, S, 23, 4), p + 4;
     }
-    a.prototype.writeFloatLE = function(f, h, S) {
-      return D(this, f, h, !0, S);
-    }, a.prototype.writeFloatBE = function(f, h, S) {
-      return D(this, f, h, !1, S);
+    a.prototype.writeFloatLE = function(f, p, S) {
+      return D(this, f, p, !0, S);
+    }, a.prototype.writeFloatBE = function(f, p, S) {
+      return D(this, f, p, !1, S);
     };
-    function W(_, f, h, S, U) {
-      return f = +f, h = h >>> 0, U || T(_, f, h, 8), n.write(_, f, h, S, 52, 8), h + 8;
-    }
-    a.prototype.writeDoubleLE = function(f, h, S) {
-      return W(this, f, h, !0, S);
-    }, a.prototype.writeDoubleBE = function(f, h, S) {
-      return W(this, f, h, !1, S);
-    }, a.prototype.copy = function(f, h, S, U) {
+    function W(_, f, p, S, U) {
+      return f = +f, p = p >>> 0, U || T(_, f, p, 8), n.write(_, f, p, S, 52, 8), p + 8;
+    }
+    a.prototype.writeDoubleLE = function(f, p, S) {
+      return W(this, f, p, !0, S);
+    }, a.prototype.writeDoubleBE = function(f, p, S) {
+      return W(this, f, p, !1, S);
+    }, a.prototype.copy = function(f, p, S, U) {
       if (!a.isBuffer(f)) throw new TypeError("argument should be a Buffer");
-      if (S || (S = 0), !U && U !== 0 && (U = this.length), h >= f.length && (h = f.length), h || (h = 0), U > 0 && U < S && (U = S), U === S || f.length === 0 || this.length === 0) return 0;
-      if (h < 0)
+      if (S || (S = 0), !U && U !== 0 && (U = this.length), p >= f.length && (p = f.length), p || (p = 0), U > 0 && U < S && (U = S), U === S || f.length === 0 || this.length === 0) return 0;
+      if (p < 0)
         throw new RangeError("targetStart out of bounds");
       if (S < 0 || S >= this.length) throw new RangeError("Index out of range");
       if (U < 0) throw new RangeError("sourceEnd out of bounds");
-      U > this.length && (U = this.length), f.length - h < U - S && (U = f.length - h + S);
+      U > this.length && (U = this.length), f.length - p < U - S && (U = f.length - p + S);
       const $ = U - S;
-      return this === f && typeof Uint8Array.prototype.copyWithin == "function" ? this.copyWithin(h, S, U) : Uint8Array.prototype.set.call(
+      return this === f && typeof Uint8Array.prototype.copyWithin == "function" ? this.copyWithin(p, S, U) : Uint8Array.prototype.set.call(
         f,
         this.subarray(S, U),
-        h
+        p
       ), $;
-    }, a.prototype.fill = function(f, h, S, U) {
+    }, a.prototype.fill = function(f, p, S, U) {
       if (typeof f == "string") {
-        if (typeof h == "string" ? (U = h, h = 0, S = this.length) : typeof S == "string" && (U = S, S = this.length), U !== void 0 && typeof U != "string")
+        if (typeof p == "string" ? (U = p, p = 0, S = this.length) : typeof S == "string" && (U = S, S = this.length), U !== void 0 && typeof U != "string")
           throw new TypeError("encoding must be a string");
         if (typeof U == "string" && !a.isEncoding(U))
           throw new TypeError("Unknown encoding: " + U);
@@ -11325,27 +11325,27 @@ function Xc() {
           (U === "utf8" && Z < 128 || U === "latin1") && (f = Z);
         }
       } else typeof f == "number" ? f = f & 255 : typeof f == "boolean" && (f = Number(f));
-      if (h < 0 || this.length < h || this.length < S)
+      if (p < 0 || this.length < p || this.length < S)
         throw new RangeError("Out of range index");
-      if (S <= h)
+      if (S <= p)
         return this;
-      h = h >>> 0, S = S === void 0 ? this.length : S >>> 0, f || (f = 0);
+      p = p >>> 0, S = S === void 0 ? this.length : S >>> 0, f || (f = 0);
       let $;
       if (typeof f == "number")
-        for ($ = h; $ < S; ++$)
+        for ($ = p; $ < S; ++$)
           this[$] = f;
       else {
         const Z = a.isBuffer(f) ? f : a.from(f, U), Re = Z.length;
         if (Re === 0)
           throw new TypeError('The value "' + f + '" is invalid for argument "value"');
-        for ($ = 0; $ < S - h; ++$)
-          this[$ + h] = Z[$ % Re];
+        for ($ = 0; $ < S - p; ++$)
+          this[$ + p] = Z[$ % Re];
       }
       return this;
     };
     const re = {};
-    function oe(_, f, h) {
-      re[_] = class extends h {
+    function oe(_, f, p) {
+      re[_] = class extends p {
         constructor() {
           super(), Object.defineProperty(this, "message", {
             value: f.apply(this, arguments),
@@ -11383,24 +11383,24 @@ function Xc() {
       TypeError
     ), oe(
       "ERR_OUT_OF_RANGE",
-      function(_, f, h) {
-        let S = `The value of "${_}" is out of range.`, U = h;
-        return Number.isInteger(h) && Math.abs(h) > 2 ** 32 ? U = Ne(String(h)) : typeof h == "bigint" && (U = String(h), (h > BigInt(2) ** BigInt(32) || h < -(BigInt(2) ** BigInt(32))) && (U = Ne(U)), U += "n"), S += ` It must be ${f}. Received ${U}`, S;
+      function(_, f, p) {
+        let S = `The value of "${_}" is out of range.`, U = p;
+        return Number.isInteger(p) && Math.abs(p) > 2 ** 32 ? U = Ne(String(p)) : typeof p == "bigint" && (U = String(p), (p > BigInt(2) ** BigInt(32) || p < -(BigInt(2) ** BigInt(32))) && (U = Ne(U)), U += "n"), S += ` It must be ${f}. Received ${U}`, S;
       },
       RangeError
     );
     function Ne(_) {
-      let f = "", h = _.length;
+      let f = "", p = _.length;
       const S = _[0] === "-" ? 1 : 0;
-      for (; h >= S + 4; h -= 3)
-        f = `_${_.slice(h - 3, h)}${f}`;
-      return `${_.slice(0, h)}${f}`;
+      for (; p >= S + 4; p -= 3)
+        f = `_${_.slice(p - 3, p)}${f}`;
+      return `${_.slice(0, p)}${f}`;
     }
-    function Ee(_, f, h) {
-      Pe(f, "offset"), (_[f] === void 0 || _[f + h] === void 0) && ve(f, _.length - (h + 1));
+    function Ee(_, f, p) {
+      Pe(f, "offset"), (_[f] === void 0 || _[f + p] === void 0) && ve(f, _.length - (p + 1));
     }
-    function we(_, f, h, S, U, $) {
-      if (_ > h || _ < f) {
+    function we(_, f, p, S, U, $) {
+      if (_ > p || _ < f) {
         const Z = typeof f == "bigint" ? "n" : "";
         let Re;
         throw f === 0 || f === BigInt(0) ? Re = `>= 0${Z} and < 2${Z} ** ${($ + 1) * 8}${Z}` : Re = `>= -(2${Z} ** ${($ + 1) * 8 - 1}${Z}) and < 2 ** ${($ + 1) * 8 - 1}${Z}`, new re.ERR_OUT_OF_RANGE("value", Re, _);
@@ -11411,8 +11411,8 @@ function Xc() {
       if (typeof _ != "number")
         throw new re.ERR_INVALID_ARG_TYPE(f, "number", _);
     }
-    function ve(_, f, h) {
-      throw Math.floor(_) !== _ ? (Pe(_, h), new re.ERR_OUT_OF_RANGE("offset", "an integer", _)) : f < 0 ? new re.ERR_BUFFER_OUT_OF_BOUNDS() : new re.ERR_OUT_OF_RANGE(
+    function ve(_, f, p) {
+      throw Math.floor(_) !== _ ? (Pe(_, p), new re.ERR_OUT_OF_RANGE("offset", "an integer", _)) : f < 0 ? new re.ERR_BUFFER_OUT_OF_BOUNDS() : new re.ERR_OUT_OF_RANGE(
         "offset",
         `>= 0 and <= ${f}`,
         _
@@ -11427,52 +11427,52 @@ function Xc() {
     }
     function ke(_, f) {
       f = f || 1 / 0;
-      let h;
+      let p;
       const S = _.length;
       let U = null;
       const $ = [];
       for (let Z = 0; Z < S; ++Z) {
-        if (h = _.charCodeAt(Z), h > 55295 && h < 57344) {
+        if (p = _.charCodeAt(Z), p > 55295 && p < 57344) {
           if (!U) {
-            if (h > 56319) {
+            if (p > 56319) {
               (f -= 3) > -1 && $.push(239, 191, 189);
               continue;
             } else if (Z + 1 === S) {
               (f -= 3) > -1 && $.push(239, 191, 189);
               continue;
             }
-            U = h;
+            U = p;
             continue;
           }
-          if (h < 56320) {
-            (f -= 3) > -1 && $.push(239, 191, 189), U = h;
+          if (p < 56320) {
+            (f -= 3) > -1 && $.push(239, 191, 189), U = p;
             continue;
           }
-          h = (U - 55296 << 10 | h - 56320) + 65536;
+          p = (U - 55296 << 10 | p - 56320) + 65536;
         } else U && (f -= 3) > -1 && $.push(239, 191, 189);
-        if (U = null, h < 128) {
+        if (U = null, p < 128) {
           if ((f -= 1) < 0) break;
-          $.push(h);
-        } else if (h < 2048) {
+          $.push(p);
+        } else if (p < 2048) {
           if ((f -= 2) < 0) break;
           $.push(
-            h >> 6 | 192,
-            h & 63 | 128
+            p >> 6 | 192,
+            p & 63 | 128
           );
-        } else if (h < 65536) {
+        } else if (p < 65536) {
           if ((f -= 3) < 0) break;
           $.push(
-            h >> 12 | 224,
-            h >> 6 & 63 | 128,
-            h & 63 | 128
+            p >> 12 | 224,
+            p >> 6 & 63 | 128,
+            p & 63 | 128
           );
-        } else if (h < 1114112) {
+        } else if (p < 1114112) {
           if ((f -= 4) < 0) break;
           $.push(
-            h >> 18 | 240,
-            h >> 12 & 63 | 128,
-            h >> 6 & 63 | 128,
-            h & 63 | 128
+            p >> 18 | 240,
+            p >> 12 & 63 | 128,
+            p >> 6 & 63 | 128,
+            p & 63 | 128
           );
         } else
           throw new Error("Invalid code point");
@@ -11481,24 +11481,24 @@ function Xc() {
     }
     function $e(_) {
       const f = [];
-      for (let h = 0; h < _.length; ++h)
-        f.push(_.charCodeAt(h) & 255);
+      for (let p = 0; p < _.length; ++p)
+        f.push(_.charCodeAt(p) & 255);
       return f;
     }
     function mr(_, f) {
-      let h, S, U;
+      let p, S, U;
       const $ = [];
       for (let Z = 0; Z < _.length && !((f -= 2) < 0); ++Z)
-        h = _.charCodeAt(Z), S = h >> 8, U = h % 256, $.push(U), $.push(S);
+        p = _.charCodeAt(Z), S = p >> 8, U = p % 256, $.push(U), $.push(S);
       return $;
     }
     function De(_) {
       return e.toByteArray(sn(_));
     }
-    function Le(_, f, h, S) {
+    function Le(_, f, p, S) {
       let U;
-      for (U = 0; U < S && !(U + h >= f.length || U >= _.length); ++U)
-        f[U + h] = _[U];
+      for (U = 0; U < S && !(U + p >= f.length || U >= _.length); ++U)
+        f[U + p] = _[U];
       return U;
     }
     function Vt(_, f) {
@@ -11509,10 +11509,10 @@ function Xc() {
     }
     const He = (function() {
       const _ = "0123456789abcdef", f = new Array(256);
-      for (let h = 0; h < 16; ++h) {
-        const S = h * 16;
+      for (let p = 0; p < 16; ++p) {
+        const S = p * 16;
         for (let U = 0; U < 16; ++U)
-          f[S + U] = _[h] + _[U];
+          f[S + U] = _[p] + _[U];
       }
       return f;
     })();
@@ -11555,7 +11555,7 @@ function ib(t) {
     } catch {
       return { isValid: !1, value: an };
     }
-  }), F = e.adjustScalarBytes || ((v) => v), C = e.domain || ((v, R, I) => {
+  }), F = e.adjustScalarBytes || ((v) => v), M = e.domain || ((v, R, I) => {
     if (zn("phflag", I), R.length || I)
       throw new Error("Contexts/pre-hash are not supported");
     return v;
@@ -11711,7 +11711,7 @@ function ib(t) {
       return ve !== Pe && (we = g(-we)), L.fromAffine({ x: we, y: D });
     }
     static fromPrivateKey(R) {
-      const { scalar: I } = B(R);
+      const { scalar: I } = C(R);
       return z.multiply(I);
     }
     toRawBytes() {
@@ -11730,14 +11730,14 @@ function ib(t) {
   function q(v) {
     return ne(rs(v));
   }
-  function B(v) {
+  function C(v) {
     const R = n.BYTES;
     v = Ye("private key", v, R);
     const I = Ye("hashed private key", i(v), 2 * R), b = F(I.slice(0, R)), u = I.slice(R, 2 * R), l = q(b);
     return { head: b, prefix: u, scalar: l };
   }
   function P(v) {
-    const { head: R, prefix: I, scalar: b } = B(v), u = z.multiply(b), l = u.toRawBytes();
+    const { head: R, prefix: I, scalar: b } = C(v), u = z.multiply(b), l = u.toRawBytes();
     return { head: R, prefix: I, scalar: b, point: u, pointBytes: l };
   }
   function j(v) {
@@ -11745,7 +11745,7 @@ function ib(t) {
   }
   function E(v = Uint8Array.of(), ...R) {
     const I = Dr(...R);
-    return q(i(C(I, Ye("context", v), !!s)));
+    return q(i(M(I, Ye("context", v), !!s)));
   }
   function c(v, R, I = {}) {
     v = Ye("message", v), s && (v = s(v));
@@ -11754,8 +11754,8 @@ function ib(t) {
     const re = Dr(T, Ai(W, n.BYTES));
     return Ye("result", re, n.BYTES * 2);
   }
-  const p = rb;
-  function y(v, R, I, b = p) {
+  const h = rb;
+  function y(v, R, I, b = h) {
     const { context: u, zip215: l } = b, w = n.BYTES;
     v = Ye("signature", v, 2 * w), R = Ye("message", R), I = Ye("publicKey", I, w), l !== void 0 && zn("zip215", l), s && (R = s(R));
     const T = rs(v.slice(w, 2 * w));
@@ -11799,7 +11799,7 @@ const ob = BigInt(1), kd = BigInt(2);
 BigInt(3);
 const ab = BigInt(5), cb = BigInt(8);
 function ub(t) {
-  const e = BigInt(10), n = BigInt(20), r = BigInt(40), s = BigInt(80), i = Qc, a = t * t % i * t % i, d = Ke(a, kd, i) * a % i, m = Ke(d, ob, i) * t % i, g = Ke(m, ab, i) * m % i, x = Ke(g, e, i) * g % i, O = Ke(x, n, i) * x % i, N = Ke(O, r, i) * O % i, F = Ke(N, s, i) * N % i, C = Ke(F, s, i) * N % i, k = Ke(C, e, i) * g % i;
+  const e = BigInt(10), n = BigInt(20), r = BigInt(40), s = BigInt(80), i = Qc, a = t * t % i * t % i, d = Ke(a, kd, i) * a % i, m = Ke(d, ob, i) * t % i, g = Ke(m, ab, i) * m % i, x = Ke(g, e, i) * g % i, O = Ke(x, n, i) * x % i, N = Ke(O, r, i) * O % i, F = Ke(N, s, i) * N % i, M = Ke(F, s, i) * N % i, k = Ke(M, e, i) * g % i;
   return { pow_p_5_8: Ke(k, kd, i) * t % i, b2: a };
 }
 function db(t) {
@@ -11845,14 +11845,14 @@ function mh() {
       }
       function s(E, c) {
         E.super_ = c;
-        var p = function() {
+        var h = function() {
         };
-        p.prototype = c.prototype, E.prototype = new p(), E.prototype.constructor = E;
+        h.prototype = c.prototype, E.prototype = new h(), E.prototype.constructor = E;
       }
-      function i(E, c, p) {
+      function i(E, c, h) {
         if (i.isBN(E))
           return E;
-        this.negative = 0, this.words = null, this.length = 0, this.red = null, E !== null && ((c === "le" || c === "be") && (p = c, c = 10), this._init(E || 0, c || 10, p || "be"));
+        this.negative = 0, this.words = null, this.length = 0, this.red = null, E !== null && ((c === "le" || c === "be") && (h = c, c = 10), this._init(E || 0, c || 10, h || "be"));
       }
       typeof e == "object" ? e.exports = i : n.BN = i, i.BN = i, i.wordSize = 26;
       var o;
@@ -11862,19 +11862,19 @@ function mh() {
       }
       i.isBN = function(c) {
         return c instanceof i ? !0 : c !== null && typeof c == "object" && c.constructor.wordSize === i.wordSize && Array.isArray(c.words);
-      }, i.max = function(c, p) {
-        return c.cmp(p) > 0 ? c : p;
-      }, i.min = function(c, p) {
-        return c.cmp(p) < 0 ? c : p;
-      }, i.prototype._init = function(c, p, y) {
+      }, i.max = function(c, h) {
+        return c.cmp(h) > 0 ? c : h;
+      }, i.min = function(c, h) {
+        return c.cmp(h) < 0 ? c : h;
+      }, i.prototype._init = function(c, h, y) {
         if (typeof c == "number")
-          return this._initNumber(c, p, y);
+          return this._initNumber(c, h, y);
         if (typeof c == "object")
-          return this._initArray(c, p, y);
-        p === "hex" && (p = 16), r(p === (p | 0) && p >= 2 && p <= 36), c = c.toString().replace(/\s+/g, "");
+          return this._initArray(c, h, y);
+        h === "hex" && (h = 16), r(h === (h | 0) && h >= 2 && h <= 36), c = c.toString().replace(/\s+/g, "");
         var A = 0;
-        c[0] === "-" && (A++, this.negative = 1), A < c.length && (p === 16 ? this._parseHex(c, A, y) : (this._parseBase(c, p, A), y === "le" && this._initArray(this.toArray(), p, y)));
-      }, i.prototype._initNumber = function(c, p, y) {
+        c[0] === "-" && (A++, this.negative = 1), A < c.length && (h === 16 ? this._parseHex(c, A, y) : (this._parseBase(c, h, A), y === "le" && this._initArray(this.toArray(), h, y)));
+      }, i.prototype._initNumber = function(c, h, y) {
         c < 0 && (this.negative = 1, c = -c), c < 67108864 ? (this.words = [c & 67108863], this.length = 1) : c < 4503599627370496 ? (this.words = [
           c & 67108863,
           c / 67108864 & 67108863
@@ -11882,8 +11882,8 @@ function mh() {
           c & 67108863,
           c / 67108864 & 67108863,
           1
-        ], this.length = 3), y === "le" && this._initArray(this.toArray(), p, y);
-      }, i.prototype._initArray = function(c, p, y) {
+        ], this.length = 3), y === "le" && this._initArray(this.toArray(), h, y);
+      }, i.prototype._initArray = function(c, h, y) {
         if (r(typeof c.length == "number"), c.length <= 0)
           return this.words = [0], this.length = 1, this;
         this.length = Math.ceil(c.length / 3), this.words = new Array(this.length);
@@ -11899,59 +11899,59 @@ function mh() {
         return this._strip();
       };
       function a(E, c) {
-        var p = E.charCodeAt(c);
-        if (p >= 48 && p <= 57)
-          return p - 48;
-        if (p >= 65 && p <= 70)
-          return p - 55;
-        if (p >= 97 && p <= 102)
-          return p - 87;
+        var h = E.charCodeAt(c);
+        if (h >= 48 && h <= 57)
+          return h - 48;
+        if (h >= 65 && h <= 70)
+          return h - 55;
+        if (h >= 97 && h <= 102)
+          return h - 87;
         r(!1, "Invalid character in " + E);
       }
-      function d(E, c, p) {
-        var y = a(E, p);
-        return p - 1 >= c && (y |= a(E, p - 1) << 4), y;
+      function d(E, c, h) {
+        var y = a(E, h);
+        return h - 1 >= c && (y |= a(E, h - 1) << 4), y;
       }
-      i.prototype._parseHex = function(c, p, y) {
-        this.length = Math.ceil((c.length - p) / 6), this.words = new Array(this.length);
+      i.prototype._parseHex = function(c, h, y) {
+        this.length = Math.ceil((c.length - h) / 6), this.words = new Array(this.length);
         for (var A = 0; A < this.length; A++)
           this.words[A] = 0;
         var v = 0, R = 0, I;
         if (y === "be")
-          for (A = c.length - 1; A >= p; A -= 2)
-            I = d(c, p, A) << v, this.words[R] |= I & 67108863, v >= 18 ? (v -= 18, R += 1, this.words[R] |= I >>> 26) : v += 8;
+          for (A = c.length - 1; A >= h; A -= 2)
+            I = d(c, h, A) << v, this.words[R] |= I & 67108863, v >= 18 ? (v -= 18, R += 1, this.words[R] |= I >>> 26) : v += 8;
         else {
-          var b = c.length - p;
-          for (A = b % 2 === 0 ? p + 1 : p; A < c.length; A += 2)
-            I = d(c, p, A) << v, this.words[R] |= I & 67108863, v >= 18 ? (v -= 18, R += 1, this.words[R] |= I >>> 26) : v += 8;
+          var b = c.length - h;
+          for (A = b % 2 === 0 ? h + 1 : h; A < c.length; A += 2)
+            I = d(c, h, A) << v, this.words[R] |= I & 67108863, v >= 18 ? (v -= 18, R += 1, this.words[R] |= I >>> 26) : v += 8;
         }
         this._strip();
       };
-      function m(E, c, p, y) {
-        for (var A = 0, v = 0, R = Math.min(E.length, p), I = c; I < R; I++) {
+      function m(E, c, h, y) {
+        for (var A = 0, v = 0, R = Math.min(E.length, h), I = c; I < R; I++) {
           var b = E.charCodeAt(I) - 48;
           A *= y, b >= 49 ? v = b - 49 + 10 : b >= 17 ? v = b - 17 + 10 : v = b, r(b >= 0 && v < y, "Invalid character"), A += v;
         }
         return A;
       }
-      i.prototype._parseBase = function(c, p, y) {
+      i.prototype._parseBase = function(c, h, y) {
         this.words = [0], this.length = 1;
-        for (var A = 0, v = 1; v <= 67108863; v *= p)
+        for (var A = 0, v = 1; v <= 67108863; v *= h)
           A++;
-        A--, v = v / p | 0;
+        A--, v = v / h | 0;
         for (var R = c.length - y, I = R % A, b = Math.min(R, R - I) + y, u = 0, l = y; l < b; l += A)
-          u = m(c, l, l + A, p), this.imuln(v), this.words[0] + u < 67108864 ? this.words[0] += u : this._iaddn(u);
+          u = m(c, l, l + A, h), this.imuln(v), this.words[0] + u < 67108864 ? this.words[0] += u : this._iaddn(u);
         if (I !== 0) {
           var w = 1;
-          for (u = m(c, l, c.length, p), l = 0; l < I; l++)
-            w *= p;
+          for (u = m(c, l, c.length, h), l = 0; l < I; l++)
+            w *= h;
           this.imuln(w), this.words[0] + u < 67108864 ? this.words[0] += u : this._iaddn(u);
         }
         this._strip();
       }, i.prototype.copy = function(c) {
         c.words = new Array(this.length);
-        for (var p = 0; p < this.length; p++)
-          c.words[p] = this.words[p];
+        for (var h = 0; h < this.length; h++)
+          c.words[h] = this.words[h];
         c.length = this.length, c.negative = this.negative, c.red = this.red;
       };
       function g(E, c) {
@@ -12087,8 +12087,8 @@ function mh() {
         52521875,
         60466176
       ];
-      i.prototype.toString = function(c, p) {
-        c = c || 10, p = p | 0 || 1;
+      i.prototype.toString = function(c, h) {
+        c = c || 10, h = h | 0 || 1;
         var y;
         if (c === 16 || c === "hex") {
           y = "";
@@ -12096,7 +12096,7 @@ function mh() {
             var I = this.words[R], b = ((I << A | v) & 16777215).toString(16);
             v = I >>> 24 - A & 16777215, A += 2, A >= 26 && (A -= 26, R--), v !== 0 || R !== this.length - 1 ? y = O[6 - b.length] + b + y : y = b + y;
           }
-          for (v !== 0 && (y = v.toString(16) + y); y.length % p !== 0; )
+          for (v !== 0 && (y = v.toString(16) + y); y.length % h !== 0; )
             y = "0" + y;
           return this.negative !== 0 && (y = "-" + y), y;
         }
@@ -12108,7 +12108,7 @@ function mh() {
             var T = w.modrn(l).toString(c);
             w = w.idivn(l), w.isZero() ? y = T + y : y = O[u - T.length] + T + y;
           }
-          for (this.isZero() && (y = "0" + y); y.length % p !== 0; )
+          for (this.isZero() && (y = "0" + y); y.length % h !== 0; )
             y = "0" + y;
           return this.negative !== 0 && (y = "-" + y), y;
         }
@@ -12118,21 +12118,21 @@ function mh() {
         return this.length === 2 ? c += this.words[1] * 67108864 : this.length === 3 && this.words[2] === 1 ? c += 4503599627370496 + this.words[1] * 67108864 : this.length > 2 && r(!1, "Number can only safely store up to 53 bits"), this.negative !== 0 ? -c : c;
       }, i.prototype.toJSON = function() {
         return this.toString(16, 2);
-      }, o && (i.prototype.toBuffer = function(c, p) {
-        return this.toArrayLike(o, c, p);
-      }), i.prototype.toArray = function(c, p) {
-        return this.toArrayLike(Array, c, p);
+      }, o && (i.prototype.toBuffer = function(c, h) {
+        return this.toArrayLike(o, c, h);
+      }), i.prototype.toArray = function(c, h) {
+        return this.toArrayLike(Array, c, h);
       };
-      var C = function(c, p) {
-        return c.allocUnsafe ? c.allocUnsafe(p) : new c(p);
+      var M = function(c, h) {
+        return c.allocUnsafe ? c.allocUnsafe(h) : new c(h);
       };
-      i.prototype.toArrayLike = function(c, p, y) {
+      i.prototype.toArrayLike = function(c, h, y) {
         this._strip();
         var A = this.byteLength(), v = y || Math.max(1, A);
         r(A <= v, "byte array longer than desired length"), r(v > 0, "Requested array length <= 0");
-        var R = C(c, v), I = p === "le" ? "LE" : "BE";
+        var R = M(c, v), I = h === "le" ? "LE" : "BE";
         return this["_toArrayLike" + I](R, A), R;
-      }, i.prototype._toArrayLikeLE = function(c, p) {
+      }, i.prototype._toArrayLikeLE = function(c, h) {
         for (var y = 0, A = 0, v = 0, R = 0; v < this.length; v++) {
           var I = this.words[v] << R | A;
           c[y++] = I & 255, y < c.length && (c[y++] = I >> 8 & 255), y < c.length && (c[y++] = I >> 16 & 255), R === 6 ? (y < c.length && (c[y++] = I >> 24 & 255), A = 0, R = 0) : (A = I >>> 24, R += 2);
@@ -12140,7 +12140,7 @@ function mh() {
         if (y < c.length)
           for (c[y++] = A; y < c.length; )
             c[y++] = 0;
-      }, i.prototype._toArrayLikeBE = function(c, p) {
+      }, i.prototype._toArrayLikeBE = function(c, h) {
         for (var y = c.length - 1, A = 0, v = 0, R = 0; v < this.length; v++) {
           var I = this.words[v] << R | A;
           c[y--] = I & 255, y >= 0 && (c[y--] = I >> 8 & 255), y >= 0 && (c[y--] = I >> 16 & 255), R === 6 ? (y >= 0 && (c[y--] = I >> 24 & 255), A = 0, R = 0) : (A = I >>> 24, R += 2);
@@ -12151,27 +12151,27 @@ function mh() {
       }, Math.clz32 ? i.prototype._countBits = function(c) {
         return 32 - Math.clz32(c);
       } : i.prototype._countBits = function(c) {
-        var p = c, y = 0;
-        return p >= 4096 && (y += 13, p >>>= 13), p >= 64 && (y += 7, p >>>= 7), p >= 8 && (y += 4, p >>>= 4), p >= 2 && (y += 2, p >>>= 2), y + p;
+        var h = c, y = 0;
+        return h >= 4096 && (y += 13, h >>>= 13), h >= 64 && (y += 7, h >>>= 7), h >= 8 && (y += 4, h >>>= 4), h >= 2 && (y += 2, h >>>= 2), y + h;
       }, i.prototype._zeroBits = function(c) {
         if (c === 0) return 26;
-        var p = c, y = 0;
-        return (p & 8191) === 0 && (y += 13, p >>>= 13), (p & 127) === 0 && (y += 7, p >>>= 7), (p & 15) === 0 && (y += 4, p >>>= 4), (p & 3) === 0 && (y += 2, p >>>= 2), (p & 1) === 0 && y++, y;
+        var h = c, y = 0;
+        return (h & 8191) === 0 && (y += 13, h >>>= 13), (h & 127) === 0 && (y += 7, h >>>= 7), (h & 15) === 0 && (y += 4, h >>>= 4), (h & 3) === 0 && (y += 2, h >>>= 2), (h & 1) === 0 && y++, y;
       }, i.prototype.bitLength = function() {
-        var c = this.words[this.length - 1], p = this._countBits(c);
-        return (this.length - 1) * 26 + p;
+        var c = this.words[this.length - 1], h = this._countBits(c);
+        return (this.length - 1) * 26 + h;
       };
       function k(E) {
-        for (var c = new Array(E.bitLength()), p = 0; p < c.length; p++) {
-          var y = p / 26 | 0, A = p % 26;
-          c[p] = E.words[y] >>> A & 1;
+        for (var c = new Array(E.bitLength()), h = 0; h < c.length; h++) {
+          var y = h / 26 | 0, A = h % 26;
+          c[h] = E.words[y] >>> A & 1;
         }
         return c;
       }
       i.prototype.zeroBits = function() {
         if (this.isZero()) return 0;
-        for (var c = 0, p = 0; p < this.length; p++) {
-          var y = this._zeroBits(this.words[p]);
+        for (var c = 0, h = 0; h < this.length; h++) {
+          var y = this._zeroBits(this.words[h]);
           if (c += y, y !== 26) break;
         }
         return c;
@@ -12190,8 +12190,8 @@ function mh() {
       }, i.prototype.iuor = function(c) {
         for (; this.length < c.length; )
           this.words[this.length++] = 0;
-        for (var p = 0; p < c.length; p++)
-          this.words[p] = this.words[p] | c.words[p];
+        for (var h = 0; h < c.length; h++)
+          this.words[h] = this.words[h] | c.words[h];
         return this._strip();
       }, i.prototype.ior = function(c) {
         return r((this.negative | c.negative) === 0), this.iuor(c);
@@ -12200,11 +12200,11 @@ function mh() {
       }, i.prototype.uor = function(c) {
         return this.length > c.length ? this.clone().iuor(c) : c.clone().iuor(this);
       }, i.prototype.iuand = function(c) {
-        var p;
-        this.length > c.length ? p = c : p = this;
-        for (var y = 0; y < p.length; y++)
+        var h;
+        this.length > c.length ? h = c : h = this;
+        for (var y = 0; y < h.length; y++)
           this.words[y] = this.words[y] & c.words[y];
-        return this.length = p.length, this._strip();
+        return this.length = h.length, this._strip();
       }, i.prototype.iand = function(c) {
         return r((this.negative | c.negative) === 0), this.iuand(c);
       }, i.prototype.and = function(c) {
@@ -12212,14 +12212,14 @@ function mh() {
       }, i.prototype.uand = function(c) {
         return this.length > c.length ? this.clone().iuand(c) : c.clone().iuand(this);
       }, i.prototype.iuxor = function(c) {
-        var p, y;
-        this.length > c.length ? (p = this, y = c) : (p = c, y = this);
+        var h, y;
+        this.length > c.length ? (h = this, y = c) : (h = c, y = this);
         for (var A = 0; A < y.length; A++)
-          this.words[A] = p.words[A] ^ y.words[A];
-        if (this !== p)
-          for (; A < p.length; A++)
-            this.words[A] = p.words[A];
-        return this.length = p.length, this._strip();
+          this.words[A] = h.words[A] ^ y.words[A];
+        if (this !== h)
+          for (; A < h.length; A++)
+            this.words[A] = h.words[A];
+        return this.length = h.length, this._strip();
       }, i.prototype.ixor = function(c) {
         return r((this.negative | c.negative) === 0), this.iuxor(c);
       }, i.prototype.xor = function(c) {
@@ -12228,29 +12228,29 @@ function mh() {
         return this.length > c.length ? this.clone().iuxor(c) : c.clone().iuxor(this);
       }, i.prototype.inotn = function(c) {
         r(typeof c == "number" && c >= 0);
-        var p = Math.ceil(c / 26) | 0, y = c % 26;
-        this._expand(p), y > 0 && p--;
-        for (var A = 0; A < p; A++)
+        var h = Math.ceil(c / 26) | 0, y = c % 26;
+        this._expand(h), y > 0 && h--;
+        for (var A = 0; A < h; A++)
           this.words[A] = ~this.words[A] & 67108863;
         return y > 0 && (this.words[A] = ~this.words[A] & 67108863 >> 26 - y), this._strip();
       }, i.prototype.notn = function(c) {
         return this.clone().inotn(c);
-      }, i.prototype.setn = function(c, p) {
+      }, i.prototype.setn = function(c, h) {
         r(typeof c == "number" && c >= 0);
         var y = c / 26 | 0, A = c % 26;
-        return this._expand(y + 1), p ? this.words[y] = this.words[y] | 1 << A : this.words[y] = this.words[y] & ~(1 << A), this._strip();
+        return this._expand(y + 1), h ? this.words[y] = this.words[y] | 1 << A : this.words[y] = this.words[y] & ~(1 << A), this._strip();
       }, i.prototype.iadd = function(c) {
-        var p;
+        var h;
         if (this.negative !== 0 && c.negative === 0)
-          return this.negative = 0, p = this.isub(c), this.negative ^= 1, this._normSign();
+          return this.negative = 0, h = this.isub(c), this.negative ^= 1, this._normSign();
         if (this.negative === 0 && c.negative !== 0)
-          return c.negative = 0, p = this.isub(c), c.negative = 1, p._normSign();
+          return c.negative = 0, h = this.isub(c), c.negative = 1, h._normSign();
         var y, A;
         this.length > c.length ? (y = this, A = c) : (y = c, A = this);
         for (var v = 0, R = 0; R < A.length; R++)
-          p = (y.words[R] | 0) + (A.words[R] | 0) + v, this.words[R] = p & 67108863, v = p >>> 26;
+          h = (y.words[R] | 0) + (A.words[R] | 0) + v, this.words[R] = h & 67108863, v = h >>> 26;
         for (; v !== 0 && R < y.length; R++)
-          p = (y.words[R] | 0) + v, this.words[R] = p & 67108863, v = p >>> 26;
+          h = (y.words[R] | 0) + v, this.words[R] = h & 67108863, v = h >>> 26;
         if (this.length = y.length, v !== 0)
           this.words[this.length] = v, this.length++;
         else if (y !== this)
@@ -12258,13 +12258,13 @@ function mh() {
             this.words[R] = y.words[R];
         return this;
       }, i.prototype.add = function(c) {
-        var p;
-        return c.negative !== 0 && this.negative === 0 ? (c.negative = 0, p = this.sub(c), c.negative ^= 1, p) : c.negative === 0 && this.negative !== 0 ? (this.negative = 0, p = c.sub(this), this.negative = 1, p) : this.length > c.length ? this.clone().iadd(c) : c.clone().iadd(this);
+        var h;
+        return c.negative !== 0 && this.negative === 0 ? (c.negative = 0, h = this.sub(c), c.negative ^= 1, h) : c.negative === 0 && this.negative !== 0 ? (this.negative = 0, h = c.sub(this), this.negative = 1, h) : this.length > c.length ? this.clone().iadd(c) : c.clone().iadd(this);
       }, i.prototype.isub = function(c) {
         if (c.negative !== 0) {
           c.negative = 0;
-          var p = this.iadd(c);
-          return c.negative = 1, p._normSign();
+          var h = this.iadd(c);
+          return c.negative = 1, h._normSign();
         } else if (this.negative !== 0)
           return this.negative = 0, this.iadd(c), this.negative = 1, this._normSign();
         var y = this.cmp(c);
@@ -12273,9 +12273,9 @@ function mh() {
         var A, v;
         y > 0 ? (A = this, v = c) : (A = c, v = this);
         for (var R = 0, I = 0; I < v.length; I++)
-          p = (A.words[I] | 0) - (v.words[I] | 0) + R, R = p >> 26, this.words[I] = p & 67108863;
+          h = (A.words[I] | 0) - (v.words[I] | 0) + R, R = h >> 26, this.words[I] = h & 67108863;
         for (; R !== 0 && I < A.length; I++)
-          p = (A.words[I] | 0) + R, R = p >> 26, this.words[I] = p & 67108863;
+          h = (A.words[I] | 0) + R, R = h >> 26, this.words[I] = h & 67108863;
         if (R === 0 && I < A.length && A !== this)
           for (; I < A.length; I++)
             this.words[I] = A.words[I];
@@ -12283,24 +12283,24 @@ function mh() {
       }, i.prototype.sub = function(c) {
         return this.clone().isub(c);
       };
-      function K(E, c, p) {
-        p.negative = c.negative ^ E.negative;
+      function K(E, c, h) {
+        h.negative = c.negative ^ E.negative;
         var y = E.length + c.length | 0;
-        p.length = y, y = y - 1 | 0;
+        h.length = y, y = y - 1 | 0;
         var A = E.words[0] | 0, v = c.words[0] | 0, R = A * v, I = R & 67108863, b = R / 67108864 | 0;
-        p.words[0] = I;
+        h.words[0] = I;
         for (var u = 1; u < y; u++) {
           for (var l = b >>> 26, w = b & 67108863, T = Math.min(u, c.length - 1), D = Math.max(0, u - E.length + 1); D <= T; D++) {
             var W = u - D | 0;
             A = E.words[W] | 0, v = c.words[D] | 0, R = A * v + w, l += R / 67108864 | 0, w = R & 67108863;
           }
-          p.words[u] = w | 0, b = l | 0;
+          h.words[u] = w | 0, b = l | 0;
         }
-        return b !== 0 ? p.words[u] = b | 0 : p.length--, p._strip();
+        return b !== 0 ? h.words[u] = b | 0 : h.length--, h._strip();
       }
-      var Y = function(c, p, y) {
-        var A = c.words, v = p.words, R = y.words, I = 0, b, u, l, w = A[0] | 0, T = w & 8191, D = w >>> 13, W = A[1] | 0, re = W & 8191, oe = W >>> 13, Ne = A[2] | 0, Ee = Ne & 8191, we = Ne >>> 13, Pe = A[3] | 0, ve = Pe & 8191, Te = Pe >>> 13, sn = A[4] | 0, ke = sn & 8191, $e = sn >>> 13, mr = A[5] | 0, De = mr & 8191, Le = mr >>> 13, Vt = A[6] | 0, ze = Vt & 8191, He = Vt >>> 13, Jt = A[7] | 0, qe = Jt & 8191, _ = Jt >>> 13, f = A[8] | 0, h = f & 8191, S = f >>> 13, U = A[9] | 0, $ = U & 8191, Z = U >>> 13, Re = v[0] | 0, ye = Re & 8191, me = Re >>> 13, Fe = v[1] | 0, he = Fe & 8191, Je = Fe >>> 13, Au = v[2] | 0, Xe = Au & 8191, Qe = Au >>> 13, xu = v[3] | 0, et = xu & 8191, tt = xu >>> 13, Su = v[4] | 0, nt = Su & 8191, rt = Su >>> 13, Tu = v[5] | 0, st = Tu & 8191, it = Tu >>> 13, Ou = v[6] | 0, ot = Ou & 8191, at = Ou >>> 13, Iu = v[7] | 0, ct = Iu & 8191, ut = Iu >>> 13, Nu = v[8] | 0, dt = Nu & 8191, lt = Nu >>> 13, Cu = v[9] | 0, ft = Cu & 8191, ht = Cu >>> 13;
-        y.negative = c.negative ^ p.negative, y.length = 19, b = Math.imul(T, ye), u = Math.imul(T, me), u = u + Math.imul(D, ye) | 0, l = Math.imul(D, me);
+      var Y = function(c, h, y) {
+        var A = c.words, v = h.words, R = y.words, I = 0, b, u, l, w = A[0] | 0, T = w & 8191, D = w >>> 13, W = A[1] | 0, re = W & 8191, oe = W >>> 13, Ne = A[2] | 0, Ee = Ne & 8191, we = Ne >>> 13, Pe = A[3] | 0, ve = Pe & 8191, Te = Pe >>> 13, sn = A[4] | 0, ke = sn & 8191, $e = sn >>> 13, mr = A[5] | 0, De = mr & 8191, Le = mr >>> 13, Vt = A[6] | 0, ze = Vt & 8191, He = Vt >>> 13, Jt = A[7] | 0, qe = Jt & 8191, _ = Jt >>> 13, f = A[8] | 0, p = f & 8191, S = f >>> 13, U = A[9] | 0, $ = U & 8191, Z = U >>> 13, Re = v[0] | 0, ye = Re & 8191, me = Re >>> 13, Fe = v[1] | 0, he = Fe & 8191, Je = Fe >>> 13, Au = v[2] | 0, Xe = Au & 8191, Qe = Au >>> 13, xu = v[3] | 0, et = xu & 8191, tt = xu >>> 13, Su = v[4] | 0, nt = Su & 8191, rt = Su >>> 13, Tu = v[5] | 0, st = Tu & 8191, it = Tu >>> 13, Ou = v[6] | 0, ot = Ou & 8191, at = Ou >>> 13, Iu = v[7] | 0, ct = Iu & 8191, ut = Iu >>> 13, Nu = v[8] | 0, dt = Nu & 8191, lt = Nu >>> 13, Cu = v[9] | 0, ft = Cu & 8191, ht = Cu >>> 13;
+        y.negative = c.negative ^ h.negative, y.length = 19, b = Math.imul(T, ye), u = Math.imul(T, me), u = u + Math.imul(D, ye) | 0, l = Math.imul(D, me);
         var vo = (I + b | 0) + ((u & 8191) << 13) | 0;
         I = (l + (u >>> 13) | 0) + (vo >>> 26) | 0, vo &= 67108863, b = Math.imul(re, ye), u = Math.imul(re, me), u = u + Math.imul(oe, ye) | 0, l = Math.imul(oe, me), b = b + Math.imul(T, he) | 0, u = u + Math.imul(T, Je) | 0, u = u + Math.imul(D, he) | 0, l = l + Math.imul(D, Je) | 0;
         var Ro = (I + b | 0) + ((u & 8191) << 13) | 0;
@@ -12316,66 +12316,66 @@ function mh() {
         var Oo = (I + b | 0) + ((u & 8191) << 13) | 0;
         I = (l + (u >>> 13) | 0) + (Oo >>> 26) | 0, Oo &= 67108863, b = Math.imul(qe, ye), u = Math.imul(qe, me), u = u + Math.imul(_, ye) | 0, l = Math.imul(_, me), b = b + Math.imul(ze, he) | 0, u = u + Math.imul(ze, Je) | 0, u = u + Math.imul(He, he) | 0, l = l + Math.imul(He, Je) | 0, b = b + Math.imul(De, Xe) | 0, u = u + Math.imul(De, Qe) | 0, u = u + Math.imul(Le, Xe) | 0, l = l + Math.imul(Le, Qe) | 0, b = b + Math.imul(ke, et) | 0, u = u + Math.imul(ke, tt) | 0, u = u + Math.imul($e, et) | 0, l = l + Math.imul($e, tt) | 0, b = b + Math.imul(ve, nt) | 0, u = u + Math.imul(ve, rt) | 0, u = u + Math.imul(Te, nt) | 0, l = l + Math.imul(Te, rt) | 0, b = b + Math.imul(Ee, st) | 0, u = u + Math.imul(Ee, it) | 0, u = u + Math.imul(we, st) | 0, l = l + Math.imul(we, it) | 0, b = b + 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, b = b + 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;
         var Io = (I + b | 0) + ((u & 8191) << 13) | 0;
-        I = (l + (u >>> 13) | 0) + (Io >>> 26) | 0, Io &= 67108863, b = Math.imul(h, ye), u = Math.imul(h, me), u = u + Math.imul(S, ye) | 0, l = Math.imul(S, me), b = b + Math.imul(qe, he) | 0, u = u + Math.imul(qe, Je) | 0, u = u + Math.imul(_, he) | 0, l = l + Math.imul(_, Je) | 0, b = b + Math.imul(ze, Xe) | 0, u = u + Math.imul(ze, Qe) | 0, u = u + Math.imul(He, Xe) | 0, l = l + Math.imul(He, Qe) | 0, b = b + Math.imul(De, et) | 0, u = u + Math.imul(De, tt) | 0, u = u + Math.imul(Le, et) | 0, l = l + Math.imul(Le, tt) | 0, b = b + Math.imul(ke, nt) | 0, u = u + Math.imul(ke, rt) | 0, u = u + Math.imul($e, nt) | 0, l = l + Math.imul($e, rt) | 0, b = b + Math.imul(ve, st) | 0, u = u + Math.imul(ve, it) | 0, u = u + Math.imul(Te, st) | 0, l = l + Math.imul(Te, it) | 0, b = b + Math.imul(Ee, ot) | 0, u = u + Math.imul(Ee, at) | 0, u = u + Math.imul(we, ot) | 0, l = l + Math.imul(we, at) | 0, b = b + 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, b = b + 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;
+        I = (l + (u >>> 13) | 0) + (Io >>> 26) | 0, Io &= 67108863, b = Math.imul(p, ye), u = Math.imul(p, me), u = u + Math.imul(S, ye) | 0, l = Math.imul(S, me), b = b + Math.imul(qe, he) | 0, u = u + Math.imul(qe, Je) | 0, u = u + Math.imul(_, he) | 0, l = l + Math.imul(_, Je) | 0, b = b + Math.imul(ze, Xe) | 0, u = u + Math.imul(ze, Qe) | 0, u = u + Math.imul(He, Xe) | 0, l = l + Math.imul(He, Qe) | 0, b = b + Math.imul(De, et) | 0, u = u + Math.imul(De, tt) | 0, u = u + Math.imul(Le, et) | 0, l = l + Math.imul(Le, tt) | 0, b = b + Math.imul(ke, nt) | 0, u = u + Math.imul(ke, rt) | 0, u = u + Math.imul($e, nt) | 0, l = l + Math.imul($e, rt) | 0, b = b + Math.imul(ve, st) | 0, u = u + Math.imul(ve, it) | 0, u = u + Math.imul(Te, st) | 0, l = l + Math.imul(Te, it) | 0, b = b + Math.imul(Ee, ot) | 0, u = u + Math.imul(Ee, at) | 0, u = u + Math.imul(we, ot) | 0, l = l + Math.imul(we, at) | 0, b = b + 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, b = b + 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;
         var No = (I + b | 0) + ((u & 8191) << 13) | 0;
-        I = (l + (u >>> 13) | 0) + (No >>> 26) | 0, No &= 67108863, b = Math.imul($, ye), u = Math.imul($, me), u = u + Math.imul(Z, ye) | 0, l = Math.imul(Z, me), b = b + Math.imul(h, he) | 0, u = u + Math.imul(h, Je) | 0, u = u + Math.imul(S, he) | 0, l = l + Math.imul(S, Je) | 0, b = b + Math.imul(qe, Xe) | 0, u = u + Math.imul(qe, Qe) | 0, u = u + Math.imul(_, Xe) | 0, l = l + Math.imul(_, Qe) | 0, b = b + Math.imul(ze, et) | 0, u = u + Math.imul(ze, tt) | 0, u = u + Math.imul(He, et) | 0, l = l + Math.imul(He, tt) | 0, b = b + Math.imul(De, nt) | 0, u = u + Math.imul(De, rt) | 0, u = u + Math.imul(Le, nt) | 0, l = l + Math.imul(Le, rt) | 0, b = b + Math.imul(ke, st) | 0, u = u + Math.imul(ke, it) | 0, u = u + Math.imul($e, st) | 0, l = l + Math.imul($e, it) | 0, b = b + Math.imul(ve, ot) | 0, u = u + Math.imul(ve, at) | 0, u = u + Math.imul(Te, ot) | 0, l = l + Math.imul(Te, at) | 0, b = b + Math.imul(Ee, ct) | 0, u = u + Math.imul(Ee, ut) | 0, u = u + Math.imul(we, ct) | 0, l = l + Math.imul(we, ut) | 0, b = b + 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, b = b + 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;
+        I = (l + (u >>> 13) | 0) + (No >>> 26) | 0, No &= 67108863, b = Math.imul($, ye), u = Math.imul($, me), u = u + Math.imul(Z, ye) | 0, l = Math.imul(Z, me), b = b + Math.imul(p, he) | 0, u = u + Math.imul(p, Je) | 0, u = u + Math.imul(S, he) | 0, l = l + Math.imul(S, Je) | 0, b = b + Math.imul(qe, Xe) | 0, u = u + Math.imul(qe, Qe) | 0, u = u + Math.imul(_, Xe) | 0, l = l + Math.imul(_, Qe) | 0, b = b + Math.imul(ze, et) | 0, u = u + Math.imul(ze, tt) | 0, u = u + Math.imul(He, et) | 0, l = l + Math.imul(He, tt) | 0, b = b + Math.imul(De, nt) | 0, u = u + Math.imul(De, rt) | 0, u = u + Math.imul(Le, nt) | 0, l = l + Math.imul(Le, rt) | 0, b = b + Math.imul(ke, st) | 0, u = u + Math.imul(ke, it) | 0, u = u + Math.imul($e, st) | 0, l = l + Math.imul($e, it) | 0, b = b + Math.imul(ve, ot) | 0, u = u + Math.imul(ve, at) | 0, u = u + Math.imul(Te, ot) | 0, l = l + Math.imul(Te, at) | 0, b = b + Math.imul(Ee, ct) | 0, u = u + Math.imul(Ee, ut) | 0, u = u + Math.imul(we, ct) | 0, l = l + Math.imul(we, ut) | 0, b = b + 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, b = b + 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;
         var Co = (I + b | 0) + ((u & 8191) << 13) | 0;
-        I = (l + (u >>> 13) | 0) + (Co >>> 26) | 0, Co &= 67108863, b = Math.imul($, he), u = Math.imul($, Je), u = u + Math.imul(Z, he) | 0, l = Math.imul(Z, Je), b = b + Math.imul(h, Xe) | 0, u = u + Math.imul(h, Qe) | 0, u = u + Math.imul(S, Xe) | 0, l = l + Math.imul(S, Qe) | 0, b = b + Math.imul(qe, et) | 0, u = u + Math.imul(qe, tt) | 0, u = u + Math.imul(_, et) | 0, l = l + Math.imul(_, tt) | 0, b = b + Math.imul(ze, nt) | 0, u = u + Math.imul(ze, rt) | 0, u = u + Math.imul(He, nt) | 0, l = l + Math.imul(He, rt) | 0, b = b + Math.imul(De, st) | 0, u = u + Math.imul(De, it) | 0, u = u + Math.imul(Le, st) | 0, l = l + Math.imul(Le, it) | 0, b = b + Math.imul(ke, ot) | 0, u = u + Math.imul(ke, at) | 0, u = u + Math.imul($e, ot) | 0, l = l + Math.imul($e, at) | 0, b = b + Math.imul(ve, ct) | 0, u = u + Math.imul(ve, ut) | 0, u = u + Math.imul(Te, ct) | 0, l = l + Math.imul(Te, ut) | 0, b = b + Math.imul(Ee, dt) | 0, u = u + Math.imul(Ee, lt) | 0, u = u + Math.imul(we, dt) | 0, l = l + Math.imul(we, lt) | 0, b = b + Math.imul(re, ft) | 0, u = u + Math.imul(re, ht) | 0, u = u + Math.imul(oe, ft) | 0, l = l + Math.imul(oe, ht) | 0;
+        I = (l + (u >>> 13) | 0) + (Co >>> 26) | 0, Co &= 67108863, b = Math.imul($, he), u = Math.imul($, Je), u = u + Math.imul(Z, he) | 0, l = Math.imul(Z, Je), b = b + Math.imul(p, Xe) | 0, u = u + Math.imul(p, Qe) | 0, u = u + Math.imul(S, Xe) | 0, l = l + Math.imul(S, Qe) | 0, b = b + Math.imul(qe, et) | 0, u = u + Math.imul(qe, tt) | 0, u = u + Math.imul(_, et) | 0, l = l + Math.imul(_, tt) | 0, b = b + Math.imul(ze, nt) | 0, u = u + Math.imul(ze, rt) | 0, u = u + Math.imul(He, nt) | 0, l = l + Math.imul(He, rt) | 0, b = b + Math.imul(De, st) | 0, u = u + Math.imul(De, it) | 0, u = u + Math.imul(Le, st) | 0, l = l + Math.imul(Le, it) | 0, b = b + Math.imul(ke, ot) | 0, u = u + Math.imul(ke, at) | 0, u = u + Math.imul($e, ot) | 0, l = l + Math.imul($e, at) | 0, b = b + Math.imul(ve, ct) | 0, u = u + Math.imul(ve, ut) | 0, u = u + Math.imul(Te, ct) | 0, l = l + Math.imul(Te, ut) | 0, b = b + Math.imul(Ee, dt) | 0, u = u + Math.imul(Ee, lt) | 0, u = u + Math.imul(we, dt) | 0, l = l + Math.imul(we, lt) | 0, b = b + Math.imul(re, ft) | 0, u = u + Math.imul(re, ht) | 0, u = u + Math.imul(oe, ft) | 0, l = l + Math.imul(oe, ht) | 0;
         var Mo = (I + b | 0) + ((u & 8191) << 13) | 0;
-        I = (l + (u >>> 13) | 0) + (Mo >>> 26) | 0, Mo &= 67108863, b = Math.imul($, Xe), u = Math.imul($, Qe), u = u + Math.imul(Z, Xe) | 0, l = Math.imul(Z, Qe), b = b + Math.imul(h, et) | 0, u = u + Math.imul(h, tt) | 0, u = u + Math.imul(S, et) | 0, l = l + Math.imul(S, tt) | 0, b = b + Math.imul(qe, nt) | 0, u = u + Math.imul(qe, rt) | 0, u = u + Math.imul(_, nt) | 0, l = l + Math.imul(_, rt) | 0, b = b + Math.imul(ze, st) | 0, u = u + Math.imul(ze, it) | 0, u = u + Math.imul(He, st) | 0, l = l + Math.imul(He, it) | 0, b = b + Math.imul(De, ot) | 0, u = u + Math.imul(De, at) | 0, u = u + Math.imul(Le, ot) | 0, l = l + Math.imul(Le, at) | 0, b = b + Math.imul(ke, ct) | 0, u = u + Math.imul(ke, ut) | 0, u = u + Math.imul($e, ct) | 0, l = l + Math.imul($e, ut) | 0, b = b + Math.imul(ve, dt) | 0, u = u + Math.imul(ve, lt) | 0, u = u + Math.imul(Te, dt) | 0, l = l + Math.imul(Te, lt) | 0, b = b + Math.imul(Ee, ft) | 0, u = u + Math.imul(Ee, ht) | 0, u = u + Math.imul(we, ft) | 0, l = l + Math.imul(we, ht) | 0;
+        I = (l + (u >>> 13) | 0) + (Mo >>> 26) | 0, Mo &= 67108863, b = Math.imul($, Xe), u = Math.imul($, Qe), u = u + Math.imul(Z, Xe) | 0, l = Math.imul(Z, Qe), b = b + Math.imul(p, et) | 0, u = u + Math.imul(p, tt) | 0, u = u + Math.imul(S, et) | 0, l = l + Math.imul(S, tt) | 0, b = b + Math.imul(qe, nt) | 0, u = u + Math.imul(qe, rt) | 0, u = u + Math.imul(_, nt) | 0, l = l + Math.imul(_, rt) | 0, b = b + Math.imul(ze, st) | 0, u = u + Math.imul(ze, it) | 0, u = u + Math.imul(He, st) | 0, l = l + Math.imul(He, it) | 0, b = b + Math.imul(De, ot) | 0, u = u + Math.imul(De, at) | 0, u = u + Math.imul(Le, ot) | 0, l = l + Math.imul(Le, at) | 0, b = b + Math.imul(ke, ct) | 0, u = u + Math.imul(ke, ut) | 0, u = u + Math.imul($e, ct) | 0, l = l + Math.imul($e, ut) | 0, b = b + Math.imul(ve, dt) | 0, u = u + Math.imul(ve, lt) | 0, u = u + Math.imul(Te, dt) | 0, l = l + Math.imul(Te, lt) | 0, b = b + Math.imul(Ee, ft) | 0, u = u + Math.imul(Ee, ht) | 0, u = u + Math.imul(we, ft) | 0, l = l + Math.imul(we, ht) | 0;
         var Bo = (I + b | 0) + ((u & 8191) << 13) | 0;
-        I = (l + (u >>> 13) | 0) + (Bo >>> 26) | 0, Bo &= 67108863, b = Math.imul($, et), u = Math.imul($, tt), u = u + Math.imul(Z, et) | 0, l = Math.imul(Z, tt), b = b + Math.imul(h, nt) | 0, u = u + Math.imul(h, rt) | 0, u = u + Math.imul(S, nt) | 0, l = l + Math.imul(S, rt) | 0, b = b + Math.imul(qe, st) | 0, u = u + Math.imul(qe, it) | 0, u = u + Math.imul(_, st) | 0, l = l + Math.imul(_, it) | 0, b = b + Math.imul(ze, ot) | 0, u = u + Math.imul(ze, at) | 0, u = u + Math.imul(He, ot) | 0, l = l + Math.imul(He, at) | 0, b = b + Math.imul(De, ct) | 0, u = u + Math.imul(De, ut) | 0, u = u + Math.imul(Le, ct) | 0, l = l + Math.imul(Le, ut) | 0, b = b + Math.imul(ke, dt) | 0, u = u + Math.imul(ke, lt) | 0, u = u + Math.imul($e, dt) | 0, l = l + Math.imul($e, lt) | 0, b = b + Math.imul(ve, ft) | 0, u = u + Math.imul(ve, ht) | 0, u = u + Math.imul(Te, ft) | 0, l = l + Math.imul(Te, ht) | 0;
+        I = (l + (u >>> 13) | 0) + (Bo >>> 26) | 0, Bo &= 67108863, b = Math.imul($, et), u = Math.imul($, tt), u = u + Math.imul(Z, et) | 0, l = Math.imul(Z, tt), b = b + Math.imul(p, nt) | 0, u = u + Math.imul(p, rt) | 0, u = u + Math.imul(S, nt) | 0, l = l + Math.imul(S, rt) | 0, b = b + Math.imul(qe, st) | 0, u = u + Math.imul(qe, it) | 0, u = u + Math.imul(_, st) | 0, l = l + Math.imul(_, it) | 0, b = b + Math.imul(ze, ot) | 0, u = u + Math.imul(ze, at) | 0, u = u + Math.imul(He, ot) | 0, l = l + Math.imul(He, at) | 0, b = b + Math.imul(De, ct) | 0, u = u + Math.imul(De, ut) | 0, u = u + Math.imul(Le, ct) | 0, l = l + Math.imul(Le, ut) | 0, b = b + Math.imul(ke, dt) | 0, u = u + Math.imul(ke, lt) | 0, u = u + Math.imul($e, dt) | 0, l = l + Math.imul($e, lt) | 0, b = b + Math.imul(ve, ft) | 0, u = u + Math.imul(ve, ht) | 0, u = u + Math.imul(Te, ft) | 0, l = l + Math.imul(Te, ht) | 0;
         var ko = (I + b | 0) + ((u & 8191) << 13) | 0;
-        I = (l + (u >>> 13) | 0) + (ko >>> 26) | 0, ko &= 67108863, b = Math.imul($, nt), u = Math.imul($, rt), u = u + Math.imul(Z, nt) | 0, l = Math.imul(Z, rt), b = b + Math.imul(h, st) | 0, u = u + Math.imul(h, it) | 0, u = u + Math.imul(S, st) | 0, l = l + Math.imul(S, it) | 0, b = b + Math.imul(qe, ot) | 0, u = u + Math.imul(qe, at) | 0, u = u + Math.imul(_, ot) | 0, l = l + Math.imul(_, at) | 0, b = b + Math.imul(ze, ct) | 0, u = u + Math.imul(ze, ut) | 0, u = u + Math.imul(He, ct) | 0, l = l + Math.imul(He, ut) | 0, b = b + Math.imul(De, dt) | 0, u = u + Math.imul(De, lt) | 0, u = u + Math.imul(Le, dt) | 0, l = l + Math.imul(Le, lt) | 0, b = b + Math.imul(ke, ft) | 0, u = u + Math.imul(ke, ht) | 0, u = u + Math.imul($e, ft) | 0, l = l + Math.imul($e, ht) | 0;
+        I = (l + (u >>> 13) | 0) + (ko >>> 26) | 0, ko &= 67108863, b = Math.imul($, nt), u = Math.imul($, rt), u = u + Math.imul(Z, nt) | 0, l = Math.imul(Z, rt), b = b + Math.imul(p, st) | 0, u = u + Math.imul(p, it) | 0, u = u + Math.imul(S, st) | 0, l = l + Math.imul(S, it) | 0, b = b + Math.imul(qe, ot) | 0, u = u + Math.imul(qe, at) | 0, u = u + Math.imul(_, ot) | 0, l = l + Math.imul(_, at) | 0, b = b + Math.imul(ze, ct) | 0, u = u + Math.imul(ze, ut) | 0, u = u + Math.imul(He, ct) | 0, l = l + Math.imul(He, ut) | 0, b = b + Math.imul(De, dt) | 0, u = u + Math.imul(De, lt) | 0, u = u + Math.imul(Le, dt) | 0, l = l + Math.imul(Le, lt) | 0, b = b + Math.imul(ke, ft) | 0, u = u + Math.imul(ke, ht) | 0, u = u + Math.imul($e, ft) | 0, l = l + Math.imul($e, ht) | 0;
         var Lo = (I + b | 0) + ((u & 8191) << 13) | 0;
-        I = (l + (u >>> 13) | 0) + (Lo >>> 26) | 0, Lo &= 67108863, b = Math.imul($, st), u = Math.imul($, it), u = u + Math.imul(Z, st) | 0, l = Math.imul(Z, it), b = b + Math.imul(h, ot) | 0, u = u + Math.imul(h, at) | 0, u = u + Math.imul(S, ot) | 0, l = l + Math.imul(S, at) | 0, b = b + Math.imul(qe, ct) | 0, u = u + Math.imul(qe, ut) | 0, u = u + Math.imul(_, ct) | 0, l = l + Math.imul(_, ut) | 0, b = b + Math.imul(ze, dt) | 0, u = u + Math.imul(ze, lt) | 0, u = u + Math.imul(He, dt) | 0, l = l + Math.imul(He, lt) | 0, b = b + Math.imul(De, ft) | 0, u = u + Math.imul(De, ht) | 0, u = u + Math.imul(Le, ft) | 0, l = l + Math.imul(Le, ht) | 0;
+        I = (l + (u >>> 13) | 0) + (Lo >>> 26) | 0, Lo &= 67108863, b = Math.imul($, st), u = Math.imul($, it), u = u + Math.imul(Z, st) | 0, l = Math.imul(Z, it), b = b + Math.imul(p, ot) | 0, u = u + Math.imul(p, at) | 0, u = u + Math.imul(S, ot) | 0, l = l + Math.imul(S, at) | 0, b = b + Math.imul(qe, ct) | 0, u = u + Math.imul(qe, ut) | 0, u = u + Math.imul(_, ct) | 0, l = l + Math.imul(_, ut) | 0, b = b + Math.imul(ze, dt) | 0, u = u + Math.imul(ze, lt) | 0, u = u + Math.imul(He, dt) | 0, l = l + Math.imul(He, lt) | 0, b = b + Math.imul(De, ft) | 0, u = u + Math.imul(De, ht) | 0, u = u + Math.imul(Le, ft) | 0, l = l + Math.imul(Le, ht) | 0;
         var Po = (I + b | 0) + ((u & 8191) << 13) | 0;
-        I = (l + (u >>> 13) | 0) + (Po >>> 26) | 0, Po &= 67108863, b = Math.imul($, ot), u = Math.imul($, at), u = u + Math.imul(Z, ot) | 0, l = Math.imul(Z, at), b = b + Math.imul(h, ct) | 0, u = u + Math.imul(h, ut) | 0, u = u + Math.imul(S, ct) | 0, l = l + Math.imul(S, ut) | 0, b = b + Math.imul(qe, dt) | 0, u = u + Math.imul(qe, lt) | 0, u = u + Math.imul(_, dt) | 0, l = l + Math.imul(_, lt) | 0, b = b + Math.imul(ze, ft) | 0, u = u + Math.imul(ze, ht) | 0, u = u + Math.imul(He, ft) | 0, l = l + Math.imul(He, ht) | 0;
+        I = (l + (u >>> 13) | 0) + (Po >>> 26) | 0, Po &= 67108863, b = Math.imul($, ot), u = Math.imul($, at), u = u + Math.imul(Z, ot) | 0, l = Math.imul(Z, at), b = b + Math.imul(p, ct) | 0, u = u + Math.imul(p, ut) | 0, u = u + Math.imul(S, ct) | 0, l = l + Math.imul(S, ut) | 0, b = b + Math.imul(qe, dt) | 0, u = u + Math.imul(qe, lt) | 0, u = u + Math.imul(_, dt) | 0, l = l + Math.imul(_, lt) | 0, b = b + Math.imul(ze, ft) | 0, u = u + Math.imul(ze, ht) | 0, u = u + Math.imul(He, ft) | 0, l = l + Math.imul(He, ht) | 0;
         var Uo = (I + b | 0) + ((u & 8191) << 13) | 0;
-        I = (l + (u >>> 13) | 0) + (Uo >>> 26) | 0, Uo &= 67108863, b = Math.imul($, ct), u = Math.imul($, ut), u = u + Math.imul(Z, ct) | 0, l = Math.imul(Z, ut), b = b + Math.imul(h, dt) | 0, u = u + Math.imul(h, lt) | 0, u = u + Math.imul(S, dt) | 0, l = l + Math.imul(S, lt) | 0, b = b + Math.imul(qe, ft) | 0, u = u + Math.imul(qe, ht) | 0, u = u + Math.imul(_, ft) | 0, l = l + Math.imul(_, ht) | 0;
+        I = (l + (u >>> 13) | 0) + (Uo >>> 26) | 0, Uo &= 67108863, b = Math.imul($, ct), u = Math.imul($, ut), u = u + Math.imul(Z, ct) | 0, l = Math.imul(Z, ut), b = b + Math.imul(p, dt) | 0, u = u + Math.imul(p, lt) | 0, u = u + Math.imul(S, dt) | 0, l = l + Math.imul(S, lt) | 0, b = b + Math.imul(qe, ft) | 0, u = u + Math.imul(qe, ht) | 0, u = u + Math.imul(_, ft) | 0, l = l + Math.imul(_, ht) | 0;
         var Do = (I + b | 0) + ((u & 8191) << 13) | 0;
-        I = (l + (u >>> 13) | 0) + (Do >>> 26) | 0, Do &= 67108863, b = Math.imul($, dt), u = Math.imul($, lt), u = u + Math.imul(Z, dt) | 0, l = Math.imul(Z, lt), b = b + Math.imul(h, ft) | 0, u = u + Math.imul(h, ht) | 0, u = u + Math.imul(S, ft) | 0, l = l + Math.imul(S, ht) | 0;
+        I = (l + (u >>> 13) | 0) + (Do >>> 26) | 0, Do &= 67108863, b = Math.imul($, dt), u = Math.imul($, lt), u = u + Math.imul(Z, dt) | 0, l = Math.imul(Z, lt), b = b + Math.imul(p, ft) | 0, u = u + Math.imul(p, ht) | 0, u = u + Math.imul(S, ft) | 0, l = l + Math.imul(S, ht) | 0;
         var Fo = (I + b | 0) + ((u & 8191) << 13) | 0;
         I = (l + (u >>> 13) | 0) + (Fo >>> 26) | 0, Fo &= 67108863, b = Math.imul($, ft), u = Math.imul($, ht), u = u + Math.imul(Z, ft) | 0, l = Math.imul(Z, ht);
         var $o = (I + b | 0) + ((u & 8191) << 13) | 0;
         return I = (l + (u >>> 13) | 0) + ($o >>> 26) | 0, $o &= 67108863, R[0] = vo, R[1] = Ro, R[2] = Ao, R[3] = xo, R[4] = So, R[5] = To, R[6] = Oo, R[7] = Io, R[8] = No, R[9] = Co, R[10] = Mo, R[11] = Bo, R[12] = ko, R[13] = Lo, R[14] = Po, R[15] = Uo, R[16] = Do, R[17] = Fo, R[18] = $o, I !== 0 && (R[19] = I, y.length++), y;
       };
       Math.imul || (Y = K);
-      function V(E, c, p) {
-        p.negative = c.negative ^ E.negative, p.length = E.length + c.length;
-        for (var y = 0, A = 0, v = 0; v < p.length - 1; v++) {
+      function V(E, c, h) {
+        h.negative = c.negative ^ E.negative, h.length = E.length + c.length;
+        for (var y = 0, A = 0, v = 0; v < h.length - 1; v++) {
           var R = A;
           A = 0;
           for (var I = y & 67108863, b = Math.min(v, c.length - 1), u = Math.max(0, v - E.length + 1); u <= b; u++) {
             var l = v - u, w = E.words[l] | 0, T = c.words[u] | 0, D = w * T, W = D & 67108863;
             R = R + (D / 67108864 | 0) | 0, W = W + I | 0, I = W & 67108863, R = R + (W >>> 26) | 0, A += R >>> 26, R &= 67108863;
           }
-          p.words[v] = I, y = R, R = A;
+          h.words[v] = I, y = R, R = A;
         }
-        return y !== 0 ? p.words[v] = y : p.length--, p._strip();
+        return y !== 0 ? h.words[v] = y : h.length--, h._strip();
       }
-      function L(E, c, p) {
-        return V(E, c, p);
+      function L(E, c, h) {
+        return V(E, c, h);
       }
-      i.prototype.mulTo = function(c, p) {
+      i.prototype.mulTo = function(c, h) {
         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 = V(this, c, p) : y = L(this, c, p), y;
+        return this.length === 10 && c.length === 10 ? y = Y(this, c, h) : A < 63 ? y = K(this, c, h) : A < 1024 ? y = V(this, c, h) : y = L(this, c, h), y;
       }, i.prototype.mul = function(c) {
-        var p = new i(null);
-        return p.words = new Array(this.length + c.length), this.mulTo(c, p);
+        var h = new i(null);
+        return h.words = new Array(this.length + c.length), this.mulTo(c, h);
       }, i.prototype.mulf = function(c) {
-        var p = new i(null);
-        return p.words = new Array(this.length + c.length), L(this, c, p);
+        var h = new i(null);
+        return h.words = new Array(this.length + c.length), L(this, c, h);
       }, i.prototype.imul = function(c) {
         return this.clone().mulTo(c, this);
       }, i.prototype.imuln = function(c) {
-        var p = c < 0;
-        p && (c = -c), r(typeof c == "number"), r(c < 67108864);
+        var h = c < 0;
+        h && (c = -c), r(typeof c == "number"), r(c < 67108864);
         for (var y = 0, A = 0; A < this.length; A++) {
           var v = (this.words[A] | 0) * c, R = (v & 67108863) + (y & 67108863);
           y >>= 26, y += v / 67108864 | 0, y += R >>> 26, this.words[A] = R & 67108863;
         }
-        return y !== 0 && (this.words[A] = y, this.length++), this.length = c === 0 ? 1 : this.length, p ? this.ineg() : this;
+        return y !== 0 && (this.words[A] = y, this.length++), this.length = c === 0 ? 1 : this.length, h ? this.ineg() : this;
       }, i.prototype.muln = function(c) {
         return this.clone().imuln(c);
       }, i.prototype.sqr = function() {
@@ -12383,22 +12383,22 @@ function mh() {
       }, i.prototype.isqr = function() {
         return this.imul(this.clone());
       }, i.prototype.pow = function(c) {
-        var p = k(c);
-        if (p.length === 0) return new i(1);
-        for (var y = this, A = 0; A < p.length && p[A] === 0; A++, y = y.sqr())
+        var h = k(c);
+        if (h.length === 0) return new i(1);
+        for (var y = this, A = 0; A < h.length && h[A] === 0; A++, y = y.sqr())
           ;
-        if (++A < p.length)
-          for (var v = y.sqr(); A < p.length; A++, v = v.sqr())
-            p[A] !== 0 && (y = y.mul(v));
+        if (++A < h.length)
+          for (var v = y.sqr(); A < h.length; A++, v = v.sqr())
+            h[A] !== 0 && (y = y.mul(v));
         return y;
       }, i.prototype.iushln = function(c) {
         r(typeof c == "number" && c >= 0);
-        var p = c % 26, y = (c - p) / 26, A = 67108863 >>> 26 - p << 26 - p, v;
-        if (p !== 0) {
+        var h = c % 26, y = (c - h) / 26, A = 67108863 >>> 26 - h << 26 - h, v;
+        if (h !== 0) {
           var R = 0;
           for (v = 0; v < this.length; v++) {
-            var I = this.words[v] & A, b = (this.words[v] | 0) - I << p;
-            this.words[v] = b | R, R = I >>> 26 - p;
+            var I = this.words[v] & A, b = (this.words[v] | 0) - I << h;
+            this.words[v] = b | R, R = I >>> 26 - h;
           }
           R && (this.words[v] = R, this.length++);
         }
@@ -12412,10 +12412,10 @@ function mh() {
         return this._strip();
       }, i.prototype.ishln = function(c) {
         return r(this.negative === 0), this.iushln(c);
-      }, i.prototype.iushrn = function(c, p, y) {
+      }, i.prototype.iushrn = function(c, h, y) {
         r(typeof c == "number" && c >= 0);
         var A;
-        p ? A = (p - p % 26) / 26 : A = 0;
+        h ? A = (h - h % 26) / 26 : A = 0;
         var v = c % 26, R = Math.min((c - v) / 26, this.length), I = 67108863 ^ 67108863 >>> v << v, b = y;
         if (A -= R, A = Math.max(0, A), b) {
           for (var u = 0; u < R; u++)
@@ -12433,8 +12433,8 @@ function mh() {
           this.words[u] = l << 26 - v | w >>> v, l = w & I;
         }
         return b && l !== 0 && (b.words[b.length++] = l), this.length === 0 && (this.words[0] = 0, this.length = 1), this._strip();
-      }, i.prototype.ishrn = function(c, p, y) {
-        return r(this.negative === 0), this.iushrn(c, p, y);
+      }, i.prototype.ishrn = function(c, h, y) {
+        return r(this.negative === 0), this.iushrn(c, h, y);
       }, i.prototype.shln = function(c) {
         return this.clone().ishln(c);
       }, i.prototype.ushln = function(c) {
@@ -12445,17 +12445,17 @@ function mh() {
         return this.clone().iushrn(c);
       }, i.prototype.testn = function(c) {
         r(typeof c == "number" && c >= 0);
-        var p = c % 26, y = (c - p) / 26, A = 1 << p;
+        var h = c % 26, y = (c - h) / 26, A = 1 << h;
         if (this.length <= y) return !1;
         var v = this.words[y];
         return !!(v & A);
       }, i.prototype.imaskn = function(c) {
         r(typeof c == "number" && c >= 0);
-        var p = c % 26, y = (c - p) / 26;
+        var h = c % 26, y = (c - h) / 26;
         if (r(this.negative === 0, "imaskn works only with positive numbers"), this.length <= y)
           return this;
-        if (p !== 0 && y++, this.length = Math.min(y, this.length), p !== 0) {
-          var A = 67108863 ^ 67108863 >>> p << p;
+        if (h !== 0 && y++, this.length = Math.min(y, this.length), h !== 0) {
+          var A = 67108863 ^ 67108863 >>> h << h;
           this.words[this.length - 1] &= A;
         }
         return this.length === 0 && (this.words[0] = 0, this.length = 1), this._strip();
@@ -12465,9 +12465,9 @@ function mh() {
         return r(typeof c == "number"), r(c < 67108864), c < 0 ? this.isubn(-c) : this.negative !== 0 ? this.length === 1 && (this.words[0] | 0) <= c ? (this.words[0] = c - (this.words[0] | 0), this.negative = 0, this) : (this.negative = 0, this.isubn(c), this.negative = 1, this) : this._iaddn(c);
       }, i.prototype._iaddn = function(c) {
         this.words[0] += c;
-        for (var p = 0; p < this.length && this.words[p] >= 67108864; p++)
-          this.words[p] -= 67108864, p === this.length - 1 ? this.words[p + 1] = 1 : this.words[p + 1]++;
-        return this.length = Math.max(this.length, p + 1), this;
+        for (var h = 0; h < this.length && this.words[h] >= 67108864; h++)
+          this.words[h] -= 67108864, h === this.length - 1 ? this.words[h + 1] = 1 : this.words[h + 1]++;
+        return this.length = Math.max(this.length, h + 1), this;
       }, i.prototype.isubn = function(c) {
         if (r(typeof c == "number"), r(c < 67108864), c < 0) return this.iaddn(-c);
         if (this.negative !== 0)
@@ -12475,8 +12475,8 @@ function mh() {
         if (this.words[0] -= c, this.length === 1 && this.words[0] < 0)
           this.words[0] = -this.words[0], this.negative = 1;
         else
-          for (var p = 0; p < this.length && this.words[p] < 0; p++)
-            this.words[p] += 67108864, this.words[p + 1] -= 1;
+          for (var h = 0; h < this.length && this.words[h] < 0; h++)
+            this.words[h] += 67108864, this.words[h + 1] -= 1;
         return this._strip();
       }, i.prototype.addn = function(c) {
         return this.clone().iaddn(c);
@@ -12486,13 +12486,13 @@ function mh() {
         return this.negative = 0, this;
       }, i.prototype.abs = function() {
         return this.clone().iabs();
-      }, i.prototype._ishlnsubmul = function(c, p, y) {
+      }, i.prototype._ishlnsubmul = function(c, h, y) {
         var A = c.length + y, v;
         this._expand(A);
         var R, I = 0;
         for (v = 0; v < c.length; v++) {
           R = (this.words[v + y] | 0) + I;
-          var b = (c.words[v] | 0) * p;
+          var b = (c.words[v] | 0) * h;
           R -= b & 67108863, I = (R >> 26) - (b / 67108864 | 0), this.words[v + y] = R & 67108863;
         }
         for (; v < this.length - y; v++)
@@ -12501,11 +12501,11 @@ function mh() {
         for (r(I === -1), I = 0, v = 0; v < this.length; v++)
           R = -(this.words[v] | 0) + I, I = R >> 26, this.words[v] = R & 67108863;
         return this.negative = 1, this._strip();
-      }, i.prototype._wordDiv = function(c, p) {
+      }, i.prototype._wordDiv = function(c, h) {
         var y = this.length - c.length, A = this.clone(), v = c, R = v.words[v.length - 1] | 0, I = this._countBits(R);
         y = 26 - I, y !== 0 && (v = v.ushln(y), A.iushln(y), R = v.words[v.length - 1] | 0);
         var b = A.length - v.length, u;
-        if (p !== "mod") {
+        if (h !== "mod") {
           u = new i(null), u.length = b + 1, u.words = new Array(u.length);
           for (var l = 0; l < u.length; l++)
             u.words[l] = 0;
@@ -12518,39 +12518,39 @@ function mh() {
             D--, A.negative = 0, A._ishlnsubmul(v, 1, T), A.isZero() || (A.negative ^= 1);
           u && (u.words[T] = D);
         }
-        return u && u._strip(), A._strip(), p !== "div" && y !== 0 && A.iushrn(y), {
+        return u && u._strip(), A._strip(), h !== "div" && y !== 0 && A.iushrn(y), {
           div: u || null,
           mod: A
         };
-      }, i.prototype.divmod = function(c, p, y) {
+      }, i.prototype.divmod = function(c, h, y) {
         if (r(!c.isZero()), this.isZero())
           return {
             div: new i(0),
             mod: new i(0)
           };
         var A, v, R;
-        return this.negative !== 0 && c.negative === 0 ? (R = this.neg().divmod(c, p), p !== "mod" && (A = R.div.neg()), p !== "div" && (v = R.mod.neg(), y && v.negative !== 0 && v.iadd(c)), {
+        return this.negative !== 0 && c.negative === 0 ? (R = this.neg().divmod(c, h), h !== "mod" && (A = R.div.neg()), h !== "div" && (v = R.mod.neg(), y && v.negative !== 0 && v.iadd(c)), {
           div: A,
           mod: v
-        }) : this.negative === 0 && c.negative !== 0 ? (R = this.divmod(c.neg(), p), p !== "mod" && (A = R.div.neg()), {
+        }) : this.negative === 0 && c.negative !== 0 ? (R = this.divmod(c.neg(), h), h !== "mod" && (A = R.div.neg()), {
           div: A,
           mod: R.mod
-        }) : (this.negative & c.negative) !== 0 ? (R = this.neg().divmod(c.neg(), p), p !== "div" && (v = R.mod.neg(), y && v.negative !== 0 && v.isub(c)), {
+        }) : (this.negative & c.negative) !== 0 ? (R = this.neg().divmod(c.neg(), h), h !== "div" && (v = R.mod.neg(), y && v.negative !== 0 && v.isub(c)), {
           div: R.div,
           mod: v
         }) : c.length > this.length || this.cmp(c) < 0 ? {
           div: new i(0),
           mod: this
-        } : c.length === 1 ? p === "div" ? {
+        } : c.length === 1 ? h === "div" ? {
           div: this.divn(c.words[0]),
           mod: null
-        } : p === "mod" ? {
+        } : h === "mod" ? {
           div: null,
           mod: new i(this.modrn(c.words[0]))
         } : {
           div: this.divn(c.words[0]),
           mod: new i(this.modrn(c.words[0]))
-        } : this._wordDiv(c, p);
+        } : this._wordDiv(c, h);
       }, i.prototype.div = function(c) {
         return this.divmod(c, "div", !1).div;
       }, i.prototype.mod = function(c) {
@@ -12558,44 +12558,44 @@ function mh() {
       }, i.prototype.umod = function(c) {
         return this.divmod(c, "mod", !0).mod;
       }, i.prototype.divRound = function(c) {
-        var p = this.divmod(c);
-        if (p.mod.isZero()) return p.div;
-        var y = p.div.negative !== 0 ? p.mod.isub(c) : p.mod, A = c.ushrn(1), v = c.andln(1), R = y.cmp(A);
-        return R < 0 || v === 1 && R === 0 ? p.div : p.div.negative !== 0 ? p.div.isubn(1) : p.div.iaddn(1);
+        var h = this.divmod(c);
+        if (h.mod.isZero()) return h.div;
+        var y = h.div.negative !== 0 ? h.mod.isub(c) : h.mod, A = c.ushrn(1), v = c.andln(1), R = y.cmp(A);
+        return R < 0 || v === 1 && R === 0 ? h.div : h.div.negative !== 0 ? h.div.isubn(1) : h.div.iaddn(1);
       }, i.prototype.modrn = function(c) {
-        var p = c < 0;
-        p && (c = -c), r(c <= 67108863);
+        var h = c < 0;
+        h && (c = -c), r(c <= 67108863);
         for (var y = (1 << 26) % c, A = 0, v = this.length - 1; v >= 0; v--)
           A = (y * A + (this.words[v] | 0)) % c;
-        return p ? -A : A;
+        return h ? -A : A;
       }, i.prototype.modn = function(c) {
         return this.modrn(c);
       }, i.prototype.idivn = function(c) {
-        var p = c < 0;
-        p && (c = -c), r(c <= 67108863);
+        var h = c < 0;
+        h && (c = -c), r(c <= 67108863);
         for (var y = 0, A = this.length - 1; A >= 0; A--) {
           var v = (this.words[A] | 0) + y * 67108864;
           this.words[A] = v / c | 0, y = v % c;
         }
-        return this._strip(), p ? this.ineg() : this;
+        return this._strip(), h ? this.ineg() : this;
       }, i.prototype.divn = function(c) {
         return this.clone().idivn(c);
       }, i.prototype.egcd = function(c) {
         r(c.negative === 0), r(!c.isZero());
-        var p = this, y = c.clone();
-        p.negative !== 0 ? p = p.umod(c) : p = p.clone();
-        for (var A = new i(1), v = new i(0), R = new i(0), I = new i(1), b = 0; p.isEven() && y.isEven(); )
-          p.iushrn(1), y.iushrn(1), ++b;
-        for (var u = y.clone(), l = p.clone(); !p.isZero(); ) {
-          for (var w = 0, T = 1; (p.words[0] & T) === 0 && w < 26; ++w, T <<= 1) ;
+        var h = this, y = c.clone();
+        h.negative !== 0 ? h = h.umod(c) : h = h.clone();
+        for (var A = new i(1), v = new i(0), R = new i(0), I = new i(1), b = 0; h.isEven() && y.isEven(); )
+          h.iushrn(1), y.iushrn(1), ++b;
+        for (var u = y.clone(), l = h.clone(); !h.isZero(); ) {
+          for (var w = 0, T = 1; (h.words[0] & T) === 0 && w < 26; ++w, T <<= 1) ;
           if (w > 0)
-            for (p.iushrn(w); w-- > 0; )
+            for (h.iushrn(w); w-- > 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; )
               (R.isOdd() || I.isOdd()) && (R.iadd(u), I.isub(l)), R.iushrn(1), I.iushrn(1);
-          p.cmp(y) >= 0 ? (p.isub(y), A.isub(R), v.isub(I)) : (y.isub(p), R.isub(A), I.isub(v));
+          h.cmp(y) >= 0 ? (h.isub(y), A.isub(R), v.isub(I)) : (y.isub(h), R.isub(A), I.isub(v));
         }
         return {
           a: R,
@@ -12604,40 +12604,40 @@ function mh() {
         };
       }, i.prototype._invmp = function(c) {
         r(c.negative === 0), r(!c.isZero());
-        var p = this, y = c.clone();
-        p.negative !== 0 ? p = p.umod(c) : p = p.clone();
-        for (var A = new i(1), v = new i(0), R = y.clone(); p.cmpn(1) > 0 && y.cmpn(1) > 0; ) {
-          for (var I = 0, b = 1; (p.words[0] & b) === 0 && I < 26; ++I, b <<= 1) ;
+        var h = this, y = c.clone();
+        h.negative !== 0 ? h = h.umod(c) : h = h.clone();
+        for (var A = new i(1), v = new i(0), R = y.clone(); h.cmpn(1) > 0 && y.cmpn(1) > 0; ) {
+          for (var I = 0, b = 1; (h.words[0] & b) === 0 && I < 26; ++I, b <<= 1) ;
           if (I > 0)
-            for (p.iushrn(I); I-- > 0; )
+            for (h.iushrn(I); I-- > 0; )
               A.isOdd() && A.iadd(R), A.iushrn(1);
           for (var u = 0, l = 1; (y.words[0] & l) === 0 && u < 26; ++u, l <<= 1) ;
           if (u > 0)
             for (y.iushrn(u); u-- > 0; )
               v.isOdd() && v.iadd(R), v.iushrn(1);
-          p.cmp(y) >= 0 ? (p.isub(y), A.isub(v)) : (y.isub(p), v.isub(A));
+          h.cmp(y) >= 0 ? (h.isub(y), A.isub(v)) : (y.isub(h), v.isub(A));
         }
         var w;
-        return p.cmpn(1) === 0 ? w = A : w = v, w.cmpn(0) < 0 && w.iadd(c), w;
+        return h.cmpn(1) === 0 ? w = A : w = v, w.cmpn(0) < 0 && w.iadd(c), w;
       }, i.prototype.gcd = function(c) {
         if (this.isZero()) return c.abs();
         if (c.isZero()) return this.abs();
-        var p = this.clone(), y = c.clone();
-        p.negative = 0, y.negative = 0;
-        for (var A = 0; p.isEven() && y.isEven(); A++)
-          p.iushrn(1), y.iushrn(1);
+        var h = this.clone(), y = c.clone();
+        h.negative = 0, y.negative = 0;
+        for (var A = 0; h.isEven() && y.isEven(); A++)
+          h.iushrn(1), y.iushrn(1);
         do {
-          for (; p.isEven(); )
-            p.iushrn(1);
+          for (; h.isEven(); )
+            h.iushrn(1);
           for (; y.isEven(); )
             y.iushrn(1);
-          var v = p.cmp(y);
+          var v = h.cmp(y);
           if (v < 0) {
-            var R = p;
-            p = y, y = R;
+            var R = h;
+            h = y, y = R;
           } else if (v === 0 || y.cmpn(1) === 0)
             break;
-          p.isub(y);
+          h.isub(y);
         } while (!0);
         return y.iushln(A);
       }, i.prototype.invm = function(c) {
@@ -12650,7 +12650,7 @@ function mh() {
         return this.words[0] & c;
       }, i.prototype.bincn = function(c) {
         r(typeof c == "number");
-        var p = c % 26, y = (c - p) / 26, A = 1 << p;
+        var h = c % 26, y = (c - h) / 26, A = 1 << h;
         if (this.length <= y)
           return this._expand(y + 1), this.words[y] |= A, this;
         for (var v = A, R = y; v !== 0 && R < this.length; R++) {
@@ -12661,15 +12661,15 @@ function mh() {
       }, i.prototype.isZero = function() {
         return this.length === 1 && this.words[0] === 0;
       }, i.prototype.cmpn = function(c) {
-        var p = c < 0;
-        if (this.negative !== 0 && !p) return -1;
-        if (this.negative === 0 && p) return 1;
+        var h = c < 0;
+        if (this.negative !== 0 && !h) return -1;
+        if (this.negative === 0 && h) return 1;
         this._strip();
         var y;
         if (this.length > 1)
           y = 1;
         else {
-          p && (c = -c), r(c <= 67108863, "Number is too big");
+          h && (c = -c), r(c <= 67108863, "Number is too big");
           var A = this.words[0] | 0;
           y = A === c ? 0 : A < c ? -1 : 1;
         }
@@ -12677,19 +12677,19 @@ function mh() {
       }, i.prototype.cmp = function(c) {
         if (this.negative !== 0 && c.negative === 0) return -1;
         if (this.negative === 0 && c.negative !== 0) return 1;
-        var p = this.ucmp(c);
-        return this.negative !== 0 ? -p | 0 : p;
+        var h = this.ucmp(c);
+        return this.negative !== 0 ? -h | 0 : h;
       }, i.prototype.ucmp = function(c) {
         if (this.length > c.length) return 1;
         if (this.length < c.length) return -1;
-        for (var p = 0, y = this.length - 1; y >= 0; y--) {
+        for (var h = 0, y = this.length - 1; y >= 0; y--) {
           var A = this.words[y] | 0, v = c.words[y] | 0;
           if (A !== v) {
-            A < v ? p = -1 : A > v && (p = 1);
+            A < v ? h = -1 : A > v && (h = 1);
             break;
           }
         }
-        return p;
+        return h;
       }, i.prototype.gtn = function(c) {
         return this.cmpn(c) === 1;
       }, i.prototype.gt = function(c) {
@@ -12760,14 +12760,14 @@ function mh() {
         var c = new i(null);
         return c.words = new Array(Math.ceil(this.n / 13)), c;
       }, J.prototype.ireduce = function(c) {
-        var p = c, y;
+        var h = c, y;
         do
-          this.split(p, this.tmp), p = this.imulK(p), p = p.iadd(this.tmp), y = p.bitLength();
+          this.split(h, this.tmp), h = this.imulK(h), h = h.iadd(this.tmp), y = h.bitLength();
         while (y > this.n);
-        var A = y < this.n ? -1 : p.ucmp(this.p);
-        return A === 0 ? (p.words[0] = 0, p.length = 1) : A > 0 ? p.isub(this.p) : p.strip !== void 0 ? p.strip() : p._strip(), p;
-      }, J.prototype.split = function(c, p) {
-        c.iushrn(this.n, 0, p);
+        var A = y < this.n ? -1 : h.ucmp(this.p);
+        return A === 0 ? (h.words[0] = 0, h.length = 1) : A > 0 ? h.isub(this.p) : h.strip !== void 0 ? h.strip() : h._strip(), h;
+      }, J.prototype.split = function(c, h) {
+        c.iushrn(this.n, 0, h);
       }, J.prototype.imulK = function(c) {
         return c.imul(this.k);
       };
@@ -12778,24 +12778,24 @@ function mh() {
           "ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f"
         );
       }
-      s(te, J), te.prototype.split = function(c, p) {
+      s(te, J), te.prototype.split = function(c, h) {
         for (var y = 4194303, A = Math.min(c.length, 9), v = 0; v < A; v++)
-          p.words[v] = c.words[v];
-        if (p.length = A, c.length <= 9) {
+          h.words[v] = c.words[v];
+        if (h.length = A, c.length <= 9) {
           c.words[0] = 0, c.length = 1;
           return;
         }
         var R = c.words[9];
-        for (p.words[p.length++] = R & y, v = 10; v < c.length; v++) {
+        for (h.words[h.length++] = R & y, v = 10; v < c.length; v++) {
           var I = c.words[v] | 0;
           c.words[v - 10] = (I & y) << 4 | R >>> 22, R = I;
         }
         R >>>= 22, c.words[v - 10] = R, R === 0 && c.length > 10 ? c.length -= 10 : c.length -= 9;
       }, te.prototype.imulK = function(c) {
         c.words[c.length] = 0, c.words[c.length + 1] = 0, c.length += 2;
-        for (var p = 0, y = 0; y < c.length; y++) {
+        for (var h = 0, y = 0; y < c.length; y++) {
           var A = c.words[y] | 0;
-          p += A * 977, c.words[y] = p & 67108863, p = A * 64 + (p / 67108864 | 0);
+          h += A * 977, c.words[y] = h & 67108863, h = A * 64 + (h / 67108864 | 0);
         }
         return c.words[c.length - 1] === 0 && (c.length--, c.words[c.length - 1] === 0 && c.length--), c;
       };
@@ -12815,33 +12815,33 @@ function mh() {
         );
       }
       s(q, J);
-      function B() {
+      function C() {
         J.call(
           this,
           "25519",
           "7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed"
         );
       }
-      s(B, J), B.prototype.imulK = function(c) {
-        for (var p = 0, y = 0; y < c.length; y++) {
-          var A = (c.words[y] | 0) * 19 + p, v = A & 67108863;
-          A >>>= 26, c.words[y] = v, p = A;
+      s(C, J), C.prototype.imulK = function(c) {
+        for (var h = 0, y = 0; y < c.length; y++) {
+          var A = (c.words[y] | 0) * 19 + h, v = A & 67108863;
+          A >>>= 26, c.words[y] = v, h = A;
         }
-        return p !== 0 && (c.words[c.length++] = p), c;
+        return h !== 0 && (c.words[c.length++] = h), c;
       }, i._prime = function(c) {
         if (z[c]) return z[c];
-        var p;
+        var h;
         if (c === "k256")
-          p = new te();
+          h = new te();
         else if (c === "p224")
-          p = new ne();
+          h = new ne();
         else if (c === "p192")
-          p = new q();
+          h = new q();
         else if (c === "p25519")
-          p = new B();
+          h = new C();
         else
           throw new Error("Unknown prime " + c);
-        return z[c] = p, p;
+        return z[c] = h, h;
       };
       function P(E) {
         if (typeof E == "string") {
@@ -12852,45 +12852,45 @@ function mh() {
       }
       P.prototype._verify1 = function(c) {
         r(c.negative === 0, "red works only with positives"), r(c.red, "red works only with red numbers");
-      }, P.prototype._verify2 = function(c, p) {
-        r((c.negative | p.negative) === 0, "red works only with positives"), r(
-          c.red && c.red === p.red,
+      }, P.prototype._verify2 = function(c, h) {
+        r((c.negative | h.negative) === 0, "red works only with positives"), r(
+          c.red && c.red === h.red,
           "red works only with red numbers"
         );
       }, P.prototype.imod = function(c) {
         return this.prime ? this.prime.ireduce(c)._forceRed(this) : (g(c, c.umod(this.m)._forceRed(this)), c);
       }, P.prototype.neg = function(c) {
         return c.isZero() ? c.clone() : this.m.sub(c)._forceRed(this);
-      }, P.prototype.add = function(c, p) {
-        this._verify2(c, p);
-        var y = c.add(p);
+      }, P.prototype.add = function(c, h) {
+        this._verify2(c, h);
+        var y = c.add(h);
         return y.cmp(this.m) >= 0 && y.isub(this.m), y._forceRed(this);
-      }, P.prototype.iadd = function(c, p) {
-        this._verify2(c, p);
-        var y = c.iadd(p);
+      }, P.prototype.iadd = function(c, h) {
+        this._verify2(c, h);
+        var y = c.iadd(h);
         return y.cmp(this.m) >= 0 && y.isub(this.m), y;
-      }, P.prototype.sub = function(c, p) {
-        this._verify2(c, p);
-        var y = c.sub(p);
+      }, P.prototype.sub = function(c, h) {
+        this._verify2(c, h);
+        var y = c.sub(h);
         return y.cmpn(0) < 0 && y.iadd(this.m), y._forceRed(this);
-      }, P.prototype.isub = function(c, p) {
-        this._verify2(c, p);
-        var y = c.isub(p);
+      }, P.prototype.isub = function(c, h) {
+        this._verify2(c, h);
+        var y = c.isub(h);
         return y.cmpn(0) < 0 && y.iadd(this.m), y;
-      }, P.prototype.shl = function(c, p) {
-        return this._verify1(c), this.imod(c.ushln(p));
-      }, P.prototype.imul = function(c, p) {
-        return this._verify2(c, p), this.imod(c.imul(p));
-      }, P.prototype.mul = function(c, p) {
-        return this._verify2(c, p), this.imod(c.mul(p));
+      }, P.prototype.shl = function(c, h) {
+        return this._verify1(c), this.imod(c.ushln(h));
+      }, P.prototype.imul = function(c, h) {
+        return this._verify2(c, h), this.imod(c.imul(h));
+      }, P.prototype.mul = function(c, h) {
+        return this._verify2(c, h), this.imod(c.mul(h));
       }, P.prototype.isqr = function(c) {
         return this.imul(c, c.clone());
       }, P.prototype.sqr = function(c) {
         return this.mul(c, c);
       }, P.prototype.sqrt = function(c) {
         if (c.isZero()) return c.clone();
-        var p = this.m.andln(3);
-        if (r(p % 2 === 1), p === 3) {
+        var h = this.m.andln(3);
+        if (r(h % 2 === 1), h === 3) {
           var y = this.m.add(new i(1)).iushrn(2);
           return this.pow(c, y);
         }
@@ -12909,18 +12909,18 @@ function mh() {
         }
         return w;
       }, P.prototype.invm = function(c) {
-        var p = c._invmp(this.m);
-        return p.negative !== 0 ? (p.negative = 0, this.imod(p).redNeg()) : this.imod(p);
-      }, P.prototype.pow = function(c, p) {
-        if (p.isZero()) return new i(1).toRed(this);
-        if (p.cmpn(1) === 0) return c.clone();
+        var h = c._invmp(this.m);
+        return h.negative !== 0 ? (h.negative = 0, this.imod(h).redNeg()) : this.imod(h);
+      }, P.prototype.pow = function(c, h) {
+        if (h.isZero()) return new i(1).toRed(this);
+        if (h.cmpn(1) === 0) return c.clone();
         var y = 4, A = new Array(1 << y);
         A[0] = new i(1).toRed(this), A[1] = c;
         for (var v = 2; v < A.length; v++)
           A[v] = this.mul(A[v - 1], c);
-        var R = A[0], I = 0, b = 0, u = p.bitLength() % 26;
-        for (u === 0 && (u = 26), v = p.length - 1; v >= 0; v--) {
-          for (var l = p.words[v], w = u - 1; w >= 0; w--) {
+        var R = A[0], I = 0, b = 0, u = h.bitLength() % 26;
+        for (u === 0 && (u = 26), v = h.length - 1; v >= 0; v--) {
+          for (var l = h.words[v], w = u - 1; w >= 0; w--) {
             var T = l >> w & 1;
             if (R !== A[0] && (R = this.sqr(R)), T === 0 && I === 0) {
               b = 0;
@@ -12932,11 +12932,11 @@ function mh() {
         }
         return R;
       }, P.prototype.convertTo = function(c) {
-        var p = c.umod(this.m);
-        return p === c ? p.clone() : p;
+        var h = c.umod(this.m);
+        return h === c ? h.clone() : h;
       }, P.prototype.convertFrom = function(c) {
-        var p = c.clone();
-        return p.red = null, p;
+        var h = c.clone();
+        return h.red = null, h;
       }, i.mont = function(c) {
         return new j(c);
       };
@@ -12946,20 +12946,20 @@ function mh() {
       s(j, P), j.prototype.convertTo = function(c) {
         return this.imod(c.ushln(this.shift));
       }, j.prototype.convertFrom = function(c) {
-        var p = this.imod(c.mul(this.rinv));
-        return p.red = null, p;
-      }, j.prototype.imul = function(c, p) {
-        if (c.isZero() || p.isZero())
+        var h = this.imod(c.mul(this.rinv));
+        return h.red = null, h;
+      }, j.prototype.imul = function(c, h) {
+        if (c.isZero() || h.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;
+        var y = c.imul(h), 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);
-      }, j.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;
+      }, j.prototype.mul = function(c, h) {
+        if (c.isZero() || h.isZero()) return new i(0)._forceRed(this);
+        var y = c.mul(h), 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);
       }, j.prototype.invm = function(c) {
-        var p = this.imod(c._invmp(this.m).mul(this.r2));
-        return p._forceRed(this);
+        var h = this.imod(c._invmp(this.m).mul(this.r2));
+        return h._forceRed(this);
       };
     })(t, gb);
   })(yi)), yi.exports;
@@ -13017,15 +13017,15 @@ function bb() {
       r[a] = i;
     }
     var d = n.length, m = n.charAt(0), g = Math.log(d) / Math.log(256), x = Math.log(256) / Math.log(d);
-    function O(C) {
-      if ((Array.isArray(C) || C instanceof Uint8Array) && (C = t.from(C)), !t.isBuffer(C))
+    function O(M) {
+      if ((Array.isArray(M) || M instanceof Uint8Array) && (M = t.from(M)), !t.isBuffer(M))
         throw new TypeError("Expected Buffer");
-      if (C.length === 0)
+      if (M.length === 0)
         return "";
-      for (var k = 0, K = 0, Y = 0, V = C.length; Y !== V && C[Y] === 0; )
+      for (var k = 0, K = 0, Y = 0, V = M.length; Y !== V && M[Y] === 0; )
         Y++, k++;
       for (var L = (V - Y) * x + 1 >>> 0, z = new Uint8Array(L); Y !== V; ) {
-        for (var J = C[Y], te = 0, ne = L - 1; (J !== 0 || te < K) && ne !== -1; ne--, te++)
+        for (var J = M[Y], te = 0, ne = L - 1; (J !== 0 || te < K) && ne !== -1; ne--, te++)
           J += 256 * z[ne] >>> 0, z[ne] = J % d >>> 0, J = J / d >>> 0;
         if (J !== 0)
           throw new Error("Non-zero carry");
@@ -13033,19 +13033,19 @@ function bb() {
       }
       for (var q = L - K; q !== L && z[q] === 0; )
         q++;
-      for (var B = m.repeat(k); q < L; ++q)
-        B += n.charAt(z[q]);
-      return B;
+      for (var C = m.repeat(k); q < L; ++q)
+        C += n.charAt(z[q]);
+      return C;
     }
-    function N(C) {
-      if (typeof C != "string")
+    function N(M) {
+      if (typeof M != "string")
         throw new TypeError("Expected String");
-      if (C.length === 0)
+      if (M.length === 0)
         return t.alloc(0);
-      for (var k = 0, K = 0, Y = 0; C[k] === m; )
+      for (var k = 0, K = 0, Y = 0; M[k] === m; )
         K++, k++;
-      for (var V = (C.length - k) * g + 1 >>> 0, L = new Uint8Array(V); k < C.length; ) {
-        var z = C.charCodeAt(k);
+      for (var V = (M.length - k) * g + 1 >>> 0, L = new Uint8Array(V); k < M.length; ) {
+        var z = M.charCodeAt(k);
         if (z > 255)
           return;
         var J = r[z];
@@ -13059,14 +13059,14 @@ function bb() {
       }
       for (var q = V - Y; q !== V && L[q] === 0; )
         q++;
-      var B = t.allocUnsafe(K + (V - q));
-      B.fill(0, 0, K);
+      var C = t.allocUnsafe(K + (V - q));
+      C.fill(0, 0, K);
       for (var P = K; q !== V; )
-        B[P++] = L[q++];
-      return B;
+        C[P++] = L[q++];
+      return C;
     }
-    function F(C) {
-      var k = N(C);
+    function F(M) {
+      var k = N(M);
       if (k)
         return k;
       throw new Error("Non-base" + d + " character");
@@ -13319,26 +13319,26 @@ var zd;
 function Tb() {
   if (zd) return Ce;
   zd = 1;
-  var t = Ce && Ce.__createBinding || (Object.create ? (function(q, B, P, j) {
+  var t = Ce && Ce.__createBinding || (Object.create ? (function(q, C, P, j) {
     j === void 0 && (j = P), Object.defineProperty(q, j, { enumerable: !0, get: function() {
-      return B[P];
+      return C[P];
     } });
-  }) : (function(q, B, P, j) {
-    j === void 0 && (j = P), q[j] = B[P];
-  })), e = Ce && Ce.__setModuleDefault || (Object.create ? (function(q, B) {
-    Object.defineProperty(q, "default", { enumerable: !0, value: B });
-  }) : function(q, B) {
-    q.default = B;
-  }), n = Ce && Ce.__decorate || function(q, B, P, j) {
-    var E = arguments.length, c = E < 3 ? B : j === null ? j = Object.getOwnPropertyDescriptor(B, P) : j, p;
-    if (typeof Reflect == "object" && typeof Reflect.decorate == "function") c = Reflect.decorate(q, B, P, j);
-    else for (var y = q.length - 1; y >= 0; y--) (p = q[y]) && (c = (E < 3 ? p(c) : E > 3 ? p(B, P, c) : p(B, P)) || c);
-    return E > 3 && c && Object.defineProperty(B, P, c), c;
+  }) : (function(q, C, P, j) {
+    j === void 0 && (j = P), q[j] = C[P];
+  })), e = Ce && Ce.__setModuleDefault || (Object.create ? (function(q, C) {
+    Object.defineProperty(q, "default", { enumerable: !0, value: C });
+  }) : function(q, C) {
+    q.default = C;
+  }), n = Ce && Ce.__decorate || function(q, C, P, j) {
+    var E = arguments.length, c = E < 3 ? C : j === null ? j = Object.getOwnPropertyDescriptor(C, P) : j, h;
+    if (typeof Reflect == "object" && typeof Reflect.decorate == "function") c = Reflect.decorate(q, C, P, j);
+    else for (var y = q.length - 1; y >= 0; y--) (h = q[y]) && (c = (E < 3 ? h(c) : E > 3 ? h(C, P, c) : h(C, P)) || c);
+    return E > 3 && c && Object.defineProperty(C, P, c), c;
   }, r = Ce && Ce.__importStar || function(q) {
     if (q && q.__esModule) return q;
-    var B = {};
-    if (q != null) for (var P in q) P !== "default" && Object.hasOwnProperty.call(q, P) && t(B, q, P);
-    return e(B, q), B;
+    var C = {};
+    if (q != null) for (var P in q) P !== "default" && Object.hasOwnProperty.call(q, P) && t(C, q, P);
+    return e(C, q), C;
   }, s = Ce && Ce.__importDefault || function(q) {
     return q && q.__esModule ? q : { default: q };
   };
@@ -13354,11 +13354,11 @@ function Tb() {
   Ce.baseDecode = x;
   const O = 1024;
   class N extends Error {
-    constructor(B) {
-      super(B), this.fieldPath = [], this.originalMessage = B;
+    constructor(C) {
+      super(C), this.fieldPath = [], this.originalMessage = C;
     }
-    addToFieldPath(B) {
-      this.fieldPath.splice(0, 0, B), this.message = this.originalMessage + ": " + this.fieldPath.join(".");
+    addToFieldPath(C) {
+      this.fieldPath.splice(0, 0, C), this.message = this.originalMessage + ": " + this.fieldPath.join(".");
     }
   }
   Ce.BorshError = N;
@@ -13369,45 +13369,45 @@ function Tb() {
     maybeResize() {
       this.buf.length < 16 + this.length && (this.buf = Buffer.concat([this.buf, Buffer.alloc(O)]));
     }
-    writeU8(B) {
-      this.maybeResize(), this.buf.writeUInt8(B, this.length), this.length += 1;
+    writeU8(C) {
+      this.maybeResize(), this.buf.writeUInt8(C, this.length), this.length += 1;
     }
-    writeU16(B) {
-      this.maybeResize(), this.buf.writeUInt16LE(B, this.length), this.length += 2;
+    writeU16(C) {
+      this.maybeResize(), this.buf.writeUInt16LE(C, this.length), this.length += 2;
     }
-    writeU32(B) {
-      this.maybeResize(), this.buf.writeUInt32LE(B, this.length), this.length += 4;
+    writeU32(C) {
+      this.maybeResize(), this.buf.writeUInt32LE(C, this.length), this.length += 4;
     }
-    writeU64(B) {
-      this.maybeResize(), this.writeBuffer(Buffer.from(new i.default(B).toArray("le", 8)));
+    writeU64(C) {
+      this.maybeResize(), this.writeBuffer(Buffer.from(new i.default(C).toArray("le", 8)));
     }
-    writeU128(B) {
-      this.maybeResize(), this.writeBuffer(Buffer.from(new i.default(B).toArray("le", 16)));
+    writeU128(C) {
+      this.maybeResize(), this.writeBuffer(Buffer.from(new i.default(C).toArray("le", 16)));
     }
-    writeU256(B) {
-      this.maybeResize(), this.writeBuffer(Buffer.from(new i.default(B).toArray("le", 32)));
+    writeU256(C) {
+      this.maybeResize(), this.writeBuffer(Buffer.from(new i.default(C).toArray("le", 32)));
     }
-    writeU512(B) {
-      this.maybeResize(), this.writeBuffer(Buffer.from(new i.default(B).toArray("le", 64)));
+    writeU512(C) {
+      this.maybeResize(), this.writeBuffer(Buffer.from(new i.default(C).toArray("le", 64)));
     }
-    writeBuffer(B) {
+    writeBuffer(C) {
       this.buf = Buffer.concat([
         Buffer.from(this.buf.subarray(0, this.length)),
-        B,
+        C,
         Buffer.alloc(O)
-      ]), this.length += B.length;
+      ]), this.length += C.length;
     }
-    writeString(B) {
+    writeString(C) {
       this.maybeResize();
-      const P = Buffer.from(B, "utf8");
+      const P = Buffer.from(C, "utf8");
       this.writeU32(P.length), this.writeBuffer(P);
     }
-    writeFixedArray(B) {
-      this.writeBuffer(Buffer.from(B));
+    writeFixedArray(C) {
+      this.writeBuffer(Buffer.from(C));
     }
-    writeArray(B, P) {
-      this.maybeResize(), this.writeU32(B.length);
-      for (const j of B)
+    writeArray(C, P) {
+      this.maybeResize(), this.writeU32(C.length);
+      for (const j of C)
         this.maybeResize(), P(j);
     }
     toArray() {
@@ -13415,15 +13415,15 @@ function Tb() {
     }
   }
   Ce.BinaryWriter = F;
-  function C(q, B, P) {
+  function M(q, C, P) {
     const j = P.value;
     P.value = function(...E) {
       try {
         return j.apply(this, E);
       } catch (c) {
         if (c instanceof RangeError) {
-          const p = c.code;
-          if (["ERR_BUFFER_OUT_OF_BOUNDS", "ERR_OUT_OF_RANGE"].indexOf(p) >= 0)
+          const h = c.code;
+          if (["ERR_BUFFER_OUT_OF_BOUNDS", "ERR_OUT_OF_RANGE"].indexOf(h) >= 0)
             throw new N("Reached the end of buffer when deserializing");
         }
         throw c;
@@ -13431,86 +13431,86 @@ function Tb() {
     };
   }
   class k {
-    constructor(B) {
-      this.buf = B, this.offset = 0;
+    constructor(C) {
+      this.buf = C, this.offset = 0;
     }
     readU8() {
-      const B = this.buf.readUInt8(this.offset);
-      return this.offset += 1, B;
+      const C = this.buf.readUInt8(this.offset);
+      return this.offset += 1, C;
     }
     readU16() {
-      const B = this.buf.readUInt16LE(this.offset);
-      return this.offset += 2, B;
+      const C = this.buf.readUInt16LE(this.offset);
+      return this.offset += 2, C;
     }
     readU32() {
-      const B = this.buf.readUInt32LE(this.offset);
-      return this.offset += 4, B;
+      const C = this.buf.readUInt32LE(this.offset);
+      return this.offset += 4, C;
     }
     readU64() {
-      const B = this.readBuffer(8);
-      return new i.default(B, "le");
+      const C = this.readBuffer(8);
+      return new i.default(C, "le");
     }
     readU128() {
-      const B = this.readBuffer(16);
-      return new i.default(B, "le");
+      const C = this.readBuffer(16);
+      return new i.default(C, "le");
     }
     readU256() {
-      const B = this.readBuffer(32);
-      return new i.default(B, "le");
+      const C = this.readBuffer(32);
+      return new i.default(C, "le");
     }
     readU512() {
-      const B = this.readBuffer(64);
-      return new i.default(B, "le");
+      const C = this.readBuffer(64);
+      return new i.default(C, "le");
     }
-    readBuffer(B) {
-      if (this.offset + B > this.buf.length)
-        throw new N(`Expected buffer length ${B} isn't within bounds`);
-      const P = this.buf.slice(this.offset, this.offset + B);
-      return this.offset += B, P;
+    readBuffer(C) {
+      if (this.offset + C > this.buf.length)
+        throw new N(`Expected buffer length ${C} isn't within bounds`);
+      const P = this.buf.slice(this.offset, this.offset + C);
+      return this.offset += C, P;
     }
     readString() {
-      const B = this.readU32(), P = this.readBuffer(B);
+      const C = this.readU32(), P = this.readBuffer(C);
       try {
         return m.decode(P);
       } catch (j) {
         throw new N(`Error decoding UTF-8 string: ${j}`);
       }
     }
-    readFixedArray(B) {
-      return new Uint8Array(this.readBuffer(B));
+    readFixedArray(C) {
+      return new Uint8Array(this.readBuffer(C));
     }
-    readArray(B) {
+    readArray(C) {
       const P = this.readU32(), j = Array();
       for (let E = 0; E < P; ++E)
-        j.push(B());
+        j.push(C());
       return j;
     }
   }
   n([
-    C
+    M
   ], k.prototype, "readU8", null), n([
-    C
+    M
   ], k.prototype, "readU16", null), n([
-    C
+    M
   ], k.prototype, "readU32", null), n([
-    C
+    M
   ], k.prototype, "readU64", null), n([
-    C
+    M
   ], k.prototype, "readU128", null), n([
-    C
+    M
   ], k.prototype, "readU256", null), n([
-    C
+    M
   ], k.prototype, "readU512", null), n([
-    C
+    M
   ], k.prototype, "readString", null), n([
-    C
+    M
   ], k.prototype, "readFixedArray", null), n([
-    C
+    M
   ], k.prototype, "readArray", null), Ce.BinaryReader = k;
   function K(q) {
     return q.charAt(0).toUpperCase() + q.slice(1);
   }
-  function Y(q, B, P, j, E) {
+  function Y(q, C, P, j, E) {
     try {
       if (typeof j == "string")
         E[`write${K(j)}`](P);
@@ -13526,17 +13526,17 @@ function Tb() {
             Y(q, null, P[c], j[0], E);
         } else
           E.writeArray(P, (c) => {
-            Y(q, B, c, j[0], E);
+            Y(q, C, c, j[0], E);
           });
       else if (j.kind !== void 0)
         switch (j.kind) {
           case "option": {
-            P == null ? E.writeU8(0) : (E.writeU8(1), Y(q, B, P, j.type, E));
+            P == null ? E.writeU8(0) : (E.writeU8(1), Y(q, C, P, j.type, E));
             break;
           }
           case "map": {
-            E.writeU32(P.size), P.forEach((c, p) => {
-              Y(q, B, p, j.key, E), Y(q, B, c, j.value, E);
+            E.writeU32(P.size), P.forEach((c, h) => {
+              Y(q, C, h, j.key, E), Y(q, C, c, j.value, E);
             });
             break;
           }
@@ -13546,39 +13546,39 @@ function Tb() {
       else
         V(q, P, E);
     } catch (c) {
-      throw c instanceof N && c.addToFieldPath(B), c;
+      throw c instanceof N && c.addToFieldPath(C), c;
     }
   }
-  function V(q, B, P) {
-    if (typeof B.borshSerialize == "function") {
-      B.borshSerialize(P);
+  function V(q, C, P) {
+    if (typeof C.borshSerialize == "function") {
+      C.borshSerialize(P);
       return;
     }
-    const j = q.get(B.constructor);
+    const j = q.get(C.constructor);
     if (!j)
-      throw new N(`Class ${B.constructor.name} is missing in schema`);
+      throw new N(`Class ${C.constructor.name} is missing in schema`);
     if (j.kind === "struct")
       j.fields.map(([E, c]) => {
-        Y(q, E, B[E], c, P);
+        Y(q, E, C[E], c, P);
       });
     else if (j.kind === "enum") {
-      const E = B[j.field];
+      const E = C[j.field];
       for (let c = 0; c < j.values.length; ++c) {
-        const [p, y] = j.values[c];
-        if (p === E) {
-          P.writeU8(c), Y(q, p, B[p], y, P);
+        const [h, y] = j.values[c];
+        if (h === E) {
+          P.writeU8(c), Y(q, h, C[h], y, P);
           break;
         }
       }
     } else
-      throw new N(`Unexpected schema kind: ${j.kind} for ${B.constructor.name}`);
+      throw new N(`Unexpected schema kind: ${j.kind} for ${C.constructor.name}`);
   }
-  function L(q, B, P = F) {
+  function L(q, C, P = F) {
     const j = new P();
-    return V(q, B, j), j.toArray();
+    return V(q, C, j), j.toArray();
   }
   Ce.serialize = L;
-  function z(q, B, P, j) {
+  function z(q, C, P, j) {
     try {
       if (typeof P == "string")
         return j[`read${K(P)}`]();
@@ -13591,55 +13591,55 @@ function Tb() {
             E.push(z(q, null, P[0], j));
           return E;
         } else
-          return j.readArray(() => z(q, B, P[0], j));
+          return j.readArray(() => z(q, C, P[0], j));
       }
       if (P.kind === "option")
-        return j.readU8() ? z(q, B, P.type, j) : void 0;
+        return j.readU8() ? z(q, C, P.type, j) : void 0;
       if (P.kind === "map") {
         let E = /* @__PURE__ */ new Map();
         const c = j.readU32();
-        for (let p = 0; p < c; p++) {
-          const y = z(q, B, P.key, j), A = z(q, B, P.value, j);
+        for (let h = 0; h < c; h++) {
+          const y = z(q, C, P.key, j), A = z(q, C, P.value, j);
           E.set(y, A);
         }
         return E;
       }
       return J(q, P, j);
     } catch (E) {
-      throw E instanceof N && E.addToFieldPath(B), E;
+      throw E instanceof N && E.addToFieldPath(C), E;
     }
   }
-  function J(q, B, P) {
-    if (typeof B.borshDeserialize == "function")
-      return B.borshDeserialize(P);
-    const j = q.get(B);
+  function J(q, C, P) {
+    if (typeof C.borshDeserialize == "function")
+      return C.borshDeserialize(P);
+    const j = q.get(C);
     if (!j)
-      throw new N(`Class ${B.name} is missing in schema`);
+      throw new N(`Class ${C.name} is missing in schema`);
     if (j.kind === "struct") {
       const E = {};
-      for (const [c, p] of q.get(B).fields)
-        E[c] = z(q, c, p, P);
-      return new B(E);
+      for (const [c, h] of q.get(C).fields)
+        E[c] = z(q, c, h, P);
+      return new C(E);
     }
     if (j.kind === "enum") {
       const E = P.readU8();
       if (E >= j.values.length)
         throw new N(`Enum index: ${E} is out of range`);
-      const [c, p] = j.values[E], y = z(q, c, p, P);
-      return new B({ [c]: y });
+      const [c, h] = j.values[E], y = z(q, c, h, P);
+      return new C({ [c]: y });
     }
-    throw new N(`Unexpected schema kind: ${j.kind} for ${B.constructor.name}`);
+    throw new N(`Unexpected schema kind: ${j.kind} for ${C.constructor.name}`);
   }
-  function te(q, B, P, j = k) {
-    const E = new j(P), c = J(q, B, E);
+  function te(q, C, P, j = k) {
+    const E = new j(P), c = J(q, C, E);
     if (E.offset < P.length)
       throw new N(`Unexpected ${P.length - E.offset} bytes after deserialized data`);
     return c;
   }
   Ce.deserialize = te;
-  function ne(q, B, P, j = k) {
+  function ne(q, C, P, j = k) {
     const E = new j(P);
-    return J(q, B, E);
+    return J(q, C, E);
   }
   return Ce.deserializeUnchecked = ne, Ce;
 }
@@ -13898,7 +13898,7 @@ function Ob() {
     const l = Math.floor(u / N), w = u - l * N;
     return { hi32: l, lo32: w };
   }
-  function C(u, l) {
+  function M(u, l) {
     return u * N + l;
   }
   class k extends r {
@@ -13908,7 +13908,7 @@ function Ob() {
     /** @override */
     decode(l, w = 0) {
       const T = n(l), D = T.readUInt32LE(w), W = T.readUInt32LE(w + 4);
-      return C(W, D);
+      return M(W, D);
     }
     /** @override */
     encode(l, w, T = 0) {
@@ -13924,7 +13924,7 @@ function Ob() {
     /** @override */
     decode(l, w = 0) {
       const T = n(l), D = T.readUInt32BE(w), W = T.readUInt32BE(w + 4);
-      return C(D, W);
+      return M(D, W);
     }
     /** @override */
     encode(l, w, T = 0) {
@@ -13940,7 +13940,7 @@ function Ob() {
     /** @override */
     decode(l, w = 0) {
       const T = n(l), D = T.readUInt32LE(w), W = T.readInt32LE(w + 4);
-      return C(W, D);
+      return M(W, D);
     }
     /** @override */
     encode(l, w, T = 0) {
@@ -13956,7 +13956,7 @@ function Ob() {
     /** @override */
     decode(l, w = 0) {
       const T = n(l), D = T.readInt32BE(w), W = T.readUInt32BE(w + 4);
-      return C(D, W);
+      return M(D, W);
     }
     /** @override */
     encode(l, w, T = 0) {
@@ -14170,7 +14170,7 @@ function Ob() {
     }
   }
   H.Structure = q;
-  class B {
+  class C {
     constructor(l) {
       this.property = l;
     }
@@ -14189,8 +14189,8 @@ function Ob() {
       throw new Error("UnionDiscriminator is abstract");
     }
   }
-  H.UnionDiscriminator = B;
-  class P extends B {
+  H.UnionDiscriminator = C;
+  class P extends C {
     constructor(l, w) {
       if (!(l instanceof o && l.isCount()))
         throw new TypeError("layout must be an unsigned integer ExternalLayout");
@@ -14213,7 +14213,7 @@ function Ob() {
         D = new P(new d(l));
       else if (l instanceof o && l.isCount())
         D = new P(l);
-      else if (l instanceof B)
+      else if (l instanceof C)
         D = l;
       else
         throw new TypeError("discr must be a UnionDiscriminator or an unsigned integer layout");
@@ -14411,7 +14411,7 @@ function Ob() {
   function c(u) {
     return 0 > u && (u += 4294967296), u;
   }
-  class p extends r {
+  class h extends r {
     constructor(l, w, T) {
       if (!(l instanceof m || l instanceof g))
         throw new TypeError("word must be a UInt or UIntBE layout");
@@ -14490,10 +14490,10 @@ function Ob() {
           return w;
     }
   }
-  H.BitStructure = p;
+  H.BitStructure = h;
   class y {
     constructor(l, w, T) {
-      if (!(l instanceof p))
+      if (!(l instanceof h))
         throw new TypeError("container must be a BitStructure");
       if (!Number.isInteger(w) || 0 >= w)
         throw new TypeError("bits must be positive integer");
@@ -14642,9 +14642,9 @@ function Ob() {
       return 0;
     }
   }
-  return H.Constant = b, H.greedy = ((u, l) => new a(u, l)), H.offset = ((u, l, w) => new d(u, l, w)), H.u8 = ((u) => new m(1, u)), H.u16 = ((u) => new m(2, u)), H.u24 = ((u) => new m(3, u)), H.u32 = ((u) => new m(4, u)), H.u40 = ((u) => new m(5, u)), H.u48 = ((u) => new m(6, u)), H.nu64 = ((u) => new k(u)), H.u16be = ((u) => new g(2, u)), H.u24be = ((u) => new g(3, u)), H.u32be = ((u) => new g(4, u)), H.u40be = ((u) => new g(5, u)), H.u48be = ((u) => new g(6, u)), H.nu64be = ((u) => new K(u)), H.s8 = ((u) => new x(1, u)), H.s16 = ((u) => new x(2, u)), H.s24 = ((u) => new x(3, u)), H.s32 = ((u) => new x(4, u)), H.s40 = ((u) => new x(5, u)), H.s48 = ((u) => new x(6, u)), H.ns64 = ((u) => new Y(u)), H.s16be = ((u) => new O(2, u)), H.s24be = ((u) => new O(3, u)), H.s32be = ((u) => new O(4, u)), H.s40be = ((u) => new O(5, u)), H.s48be = ((u) => new O(6, u)), H.ns64be = ((u) => new V(u)), H.f32 = ((u) => new L(u)), H.f32be = ((u) => new z(u)), H.f64 = ((u) => new J(u)), H.f64be = ((u) => new te(u)), H.struct = ((u, l, w) => new q(u, l, w)), H.bits = ((u, l, w) => new p(u, l, w)), H.seq = ((u, l, w) => new ne(u, l, w)), H.union = ((u, l, w) => new j(u, l, w)), H.unionLayoutDiscriminator = ((u, l) => new P(u, l)), H.blob = ((u, l) => new v(u, l)), H.cstr = ((u) => new R(u)), H.utf8 = ((u, l) => new I(u, l)), H.constant = ((u, l) => new b(u, l)), H;
+  return H.Constant = b, H.greedy = ((u, l) => new a(u, l)), H.offset = ((u, l, w) => new d(u, l, w)), H.u8 = ((u) => new m(1, u)), H.u16 = ((u) => new m(2, u)), H.u24 = ((u) => new m(3, u)), H.u32 = ((u) => new m(4, u)), H.u40 = ((u) => new m(5, u)), H.u48 = ((u) => new m(6, u)), H.nu64 = ((u) => new k(u)), H.u16be = ((u) => new g(2, u)), H.u24be = ((u) => new g(3, u)), H.u32be = ((u) => new g(4, u)), H.u40be = ((u) => new g(5, u)), H.u48be = ((u) => new g(6, u)), H.nu64be = ((u) => new K(u)), H.s8 = ((u) => new x(1, u)), H.s16 = ((u) => new x(2, u)), H.s24 = ((u) => new x(3, u)), H.s32 = ((u) => new x(4, u)), H.s40 = ((u) => new x(5, u)), H.s48 = ((u) => new x(6, u)), H.ns64 = ((u) => new Y(u)), H.s16be = ((u) => new O(2, u)), H.s24be = ((u) => new O(3, u)), H.s32be = ((u) => new O(4, u)), H.s40be = ((u) => new O(5, u)), H.s48be = ((u) => new O(6, u)), H.ns64be = ((u) => new V(u)), H.f32 = ((u) => new L(u)), H.f32be = ((u) => new z(u)), H.f64 = ((u) => new J(u)), H.f64be = ((u) => new te(u)), H.struct = ((u, l, w) => new q(u, l, w)), H.bits = ((u, l, w) => new h(u, l, w)), H.seq = ((u, l, w) => new ne(u, l, w)), H.union = ((u, l, w) => new j(u, l, w)), H.unionLayoutDiscriminator = ((u, l) => new P(u, l)), H.blob = ((u, l) => new v(u, l)), H.cstr = ((u) => new R(u)), H.utf8 = ((u, l) => new I(u, l)), H.constant = ((u, l) => new b(u, l)), H;
 }
-var M = Ob(), Ib = 1, Nb = 2, Cb = 3, Mb = 4, Bb = 5, kb = 6, Lb = 7, Pb = 8, Ub = 9, Db = 10, Fb = -32700, $b = -32603, zb = -32602, jb = -32601, Vb = -32600, Gb = -32016, Hb = -32015, qb = -32014, Kb = -32013, Wb = -32012, Zb = -32011, Yb = -32010, Jb = -32009, Xb = -32008, Qb = -32007, ew = -32006, tw = -32005, nw = -32004, rw = -32003, sw = -32002, iw = -32001, ow = 28e5, aw = 2800001, cw = 2800002, uw = 2800003, dw = 2800004, lw = 2800005, fw = 2800006, hw = 2800007, pw = 2800008, mw = 2800009, gw = 2800010, yw = 2800011, _w = 323e4, bw = 32300001, ww = 3230002, Ew = 3230003, vw = 3230004, Rw = 361e4, Aw = 3610001, xw = 3610002, Sw = 3610003, Tw = 3610004, Ow = 3610005, Iw = 3610006, Nw = 3610007, Cw = 3611e3, Mw = 3704e3, Bw = 3704001, kw = 3704002, Lw = 3704003, Pw = 3704004, Uw = 4128e3, Dw = 4128001, Fw = 4128002, $w = 4615e3, zw = 4615001, jw = 4615002, Vw = 4615003, Gw = 4615004, Hw = 4615005, qw = 4615006, Kw = 4615007, Ww = 4615008, Zw = 4615009, Yw = 4615010, Jw = 4615011, Xw = 4615012, Qw = 4615013, eE = 4615014, tE = 4615015, nE = 4615016, rE = 4615017, sE = 4615018, iE = 4615019, oE = 4615020, aE = 4615021, cE = 4615022, uE = 4615023, dE = 4615024, lE = 4615025, fE = 4615026, hE = 4615027, pE = 4615028, mE = 4615029, gE = 4615030, yE = 4615031, _E = 4615032, bE = 4615033, wE = 4615034, EE = 4615035, vE = 4615036, RE = 4615037, AE = 4615038, xE = 4615039, SE = 4615040, TE = 4615041, OE = 4615042, IE = 4615043, NE = 4615044, CE = 4615045, ME = 4615046, BE = 4615047, kE = 4615048, LE = 4615049, PE = 4615050, UE = 4615051, DE = 4615052, FE = 4615053, $E = 4615054, zE = 5508e3, jE = 5508001, VE = 5508002, GE = 5508003, HE = 5508004, qE = 5508005, KE = 5508006, WE = 5508007, ZE = 5508008, YE = 5508009, JE = 5508010, XE = 5508011, QE = 5663e3, ev = 5663001, tv = 5663002, nv = 5663003, rv = 5663004, sv = 5663005, iv = 5663006, ov = 5663007, av = 5663008, cv = 5663009, uv = 5663010, dv = 5663011, lv = 5663012, fv = 5663013, hv = 5663014, pv = 5663015, mv = 5663016, gv = 5663017, yv = 5663018, _v = 5663019, bv = 5663020, wv = 705e4, Ev = 7050001, vv = 7050002, Rv = 7050003, Av = 7050004, xv = 7050005, Sv = 7050006, Tv = 7050007, Ov = 7050008, Iv = 7050009, Nv = 7050010, Cv = 7050011, Mv = 7050012, Bv = 7050013, kv = 7050014, Lv = 7050015, Pv = 7050016, Uv = 7050017, Dv = 7050018, Fv = 7050019, $v = 7050020, zv = 7050021, jv = 7050022, Vv = 7050023, Gv = 7050024, Hv = 7050025, qv = 7050026, Kv = 7050027, Wv = 7050028, Zv = 7050029, Yv = 7050030, Jv = 7050031, Xv = 7050032, Qv = 7050033, eR = 7050034, tR = 7050035, nR = 7050036, yh = 8078e3, _h = 8078001, rR = 8078002, sR = 8078003, bh = 8078004, wh = 8078005, Eh = 8078006, iR = 8078007, oR = 8078008, aR = 8078009, cR = 8078010, vh = 8078011, uR = 8078012, dR = 8078013, lR = 8078014, fR = 8078015, hR = 8078016, pR = 8078017, mR = 8078018, gR = 8078019, yR = 8078020, _R = 8078021, bR = 8078022, wR = 81e5, ER = 8100001, vR = 8100002, RR = 8100003, AR = 819e4, xR = 8190001, SR = 8190002, TR = 8190003, OR = 8190004, IR = 99e5, NR = 9900001, CR = 9900002, MR = 9900003, BR = 9900004;
+var B = Ob(), Ib = 1, Nb = 2, Cb = 3, Mb = 4, Bb = 5, kb = 6, Lb = 7, Pb = 8, Ub = 9, Db = 10, Fb = -32700, $b = -32603, zb = -32602, jb = -32601, Vb = -32600, Gb = -32016, Hb = -32015, qb = -32014, Kb = -32013, Wb = -32012, Zb = -32011, Yb = -32010, Jb = -32009, Xb = -32008, Qb = -32007, ew = -32006, tw = -32005, nw = -32004, rw = -32003, sw = -32002, iw = -32001, ow = 28e5, aw = 2800001, cw = 2800002, uw = 2800003, dw = 2800004, lw = 2800005, fw = 2800006, hw = 2800007, pw = 2800008, mw = 2800009, gw = 2800010, yw = 2800011, _w = 323e4, bw = 32300001, ww = 3230002, Ew = 3230003, vw = 3230004, Rw = 361e4, Aw = 3610001, xw = 3610002, Sw = 3610003, Tw = 3610004, Ow = 3610005, Iw = 3610006, Nw = 3610007, Cw = 3611e3, Mw = 3704e3, Bw = 3704001, kw = 3704002, Lw = 3704003, Pw = 3704004, Uw = 4128e3, Dw = 4128001, Fw = 4128002, $w = 4615e3, zw = 4615001, jw = 4615002, Vw = 4615003, Gw = 4615004, Hw = 4615005, qw = 4615006, Kw = 4615007, Ww = 4615008, Zw = 4615009, Yw = 4615010, Jw = 4615011, Xw = 4615012, Qw = 4615013, eE = 4615014, tE = 4615015, nE = 4615016, rE = 4615017, sE = 4615018, iE = 4615019, oE = 4615020, aE = 4615021, cE = 4615022, uE = 4615023, dE = 4615024, lE = 4615025, fE = 4615026, hE = 4615027, pE = 4615028, mE = 4615029, gE = 4615030, yE = 4615031, _E = 4615032, bE = 4615033, wE = 4615034, EE = 4615035, vE = 4615036, RE = 4615037, AE = 4615038, xE = 4615039, SE = 4615040, TE = 4615041, OE = 4615042, IE = 4615043, NE = 4615044, CE = 4615045, ME = 4615046, BE = 4615047, kE = 4615048, LE = 4615049, PE = 4615050, UE = 4615051, DE = 4615052, FE = 4615053, $E = 4615054, zE = 5508e3, jE = 5508001, VE = 5508002, GE = 5508003, HE = 5508004, qE = 5508005, KE = 5508006, WE = 5508007, ZE = 5508008, YE = 5508009, JE = 5508010, XE = 5508011, QE = 5663e3, ev = 5663001, tv = 5663002, nv = 5663003, rv = 5663004, sv = 5663005, iv = 5663006, ov = 5663007, av = 5663008, cv = 5663009, uv = 5663010, dv = 5663011, lv = 5663012, fv = 5663013, hv = 5663014, pv = 5663015, mv = 5663016, gv = 5663017, yv = 5663018, _v = 5663019, bv = 5663020, wv = 705e4, Ev = 7050001, vv = 7050002, Rv = 7050003, Av = 7050004, xv = 7050005, Sv = 7050006, Tv = 7050007, Ov = 7050008, Iv = 7050009, Nv = 7050010, Cv = 7050011, Mv = 7050012, Bv = 7050013, kv = 7050014, Lv = 7050015, Pv = 7050016, Uv = 7050017, Dv = 7050018, Fv = 7050019, $v = 7050020, zv = 7050021, jv = 7050022, Vv = 7050023, Gv = 7050024, Hv = 7050025, qv = 7050026, Kv = 7050027, Wv = 7050028, Zv = 7050029, Yv = 7050030, Jv = 7050031, Xv = 7050032, Qv = 7050033, eR = 7050034, tR = 7050035, nR = 7050036, yh = 8078e3, _h = 8078001, rR = 8078002, sR = 8078003, bh = 8078004, wh = 8078005, Eh = 8078006, iR = 8078007, oR = 8078008, aR = 8078009, cR = 8078010, vh = 8078011, uR = 8078012, dR = 8078013, lR = 8078014, fR = 8078015, hR = 8078016, pR = 8078017, mR = 8078018, gR = 8078019, yR = 8078020, _R = 8078021, bR = 8078022, wR = 81e5, ER = 8100001, vR = 8100002, RR = 8100003, AR = 819e4, xR = 8190001, SR = 8190002, TR = 8190003, OR = 8190004, IR = 99e5, NR = 9900001, CR = 9900002, MR = 9900003, BR = 9900004;
 function Rh(t) {
   return Array.isArray(t) ? "%5B" + t.map(Rh).join(
     "%2C%20"
@@ -15586,11 +15586,11 @@ function wA(t) {
       O[N] = a[x][N];
     for (var F = 16; F < 80; ++F)
       O[F] = wa(O[F - 3] ^ O[F - 8] ^ O[F - 14] ^ O[F - 16], 1);
-    for (var C = n[0], k = n[1], K = n[2], Y = n[3], V = n[4], L = 0; L < 80; ++L) {
-      var z = Math.floor(L / 20), J = wa(C, 5) + bA(z, k, K, Y) + V + e[z] + O[L] >>> 0;
-      V = Y, Y = K, K = wa(k, 30) >>> 0, k = C, C = J;
+    for (var M = n[0], k = n[1], K = n[2], Y = n[3], V = n[4], L = 0; L < 80; ++L) {
+      var z = Math.floor(L / 20), J = wa(M, 5) + bA(z, k, K, Y) + V + e[z] + O[L] >>> 0;
+      V = Y, Y = K, K = wa(k, 30) >>> 0, k = M, M = J;
     }
-    n[0] = n[0] + C >>> 0, n[1] = n[1] + k >>> 0, n[2] = n[2] + K >>> 0, n[3] = n[3] + Y >>> 0, n[4] = n[4] + V >>> 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] + V >>> 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];
 }
@@ -15951,15 +15951,15 @@ class qi {
     }));
   }
 }
-const Se = (t = "publicKey") => M.blob(32, t), CA = (t = "signature") => M.blob(64, t), Sr = (t = "string") => {
-  const e = M.struct([M.u32("length"), M.u32("lengthPadding"), M.blob(M.offset(M.u32(), -8), "chars")], t), n = e.decode.bind(e), r = e.encode.bind(e), s = e;
+const Se = (t = "publicKey") => B.blob(32, t), CA = (t = "signature") => B.blob(64, t), Sr = (t = "string") => {
+  const e = B.struct([B.u32("length"), B.u32("lengthPadding"), B.blob(B.offset(B.u32(), -8), "chars")], t), n = e.decode.bind(e), r = e.encode.bind(e), s = e;
   return s.decode = (i, o) => n(i, o).chars.toString(), s.encode = (i, o, a) => {
     const d = {
       chars: xe.Buffer.from(i, "utf8")
     };
     return r(d, o, a);
-  }, s.alloc = (i) => M.u32().span + M.u32().span + xe.Buffer.from(i, "utf8").length, s;
-}, MA = (t = "authorized") => M.struct([Se("staker"), Se("withdrawer")], t), BA = (t = "lockup") => M.struct([M.ns64("unixTimestamp"), M.ns64("epoch"), Se("custodian")], t), kA = (t = "voteInit") => M.struct([Se("nodePubkey"), Se("authorizedVoter"), Se("authorizedWithdrawer"), M.u8("commission")], t), LA = (t = "voteAuthorizeWithSeedArgs") => M.struct([M.u32("voteAuthorizationType"), Se("currentAuthorityDerivedKeyOwnerPubkey"), Sr("currentAuthorityDerivedKeySeed"), Se("newAuthorized")], t);
+  }, s.alloc = (i) => B.u32().span + B.u32().span + xe.Buffer.from(i, "utf8").length, s;
+}, MA = (t = "authorized") => B.struct([Se("staker"), Se("withdrawer")], t), BA = (t = "lockup") => B.struct([B.ns64("unixTimestamp"), B.ns64("epoch"), Se("custodian")], t), kA = (t = "voteInit") => B.struct([Se("nodePubkey"), Se("authorizedVoter"), Se("authorizedWithdrawer"), B.u8("commission")], t), LA = (t = "voteAuthorizeWithSeedArgs") => B.struct([B.u32("voteAuthorizationType"), Se("currentAuthorityDerivedKeyOwnerPubkey"), Sr("currentAuthorityDerivedKeySeed"), Se("newAuthorized")], t);
 function Gt(t) {
   let e = 0, n = 0;
   for (; ; ) {
@@ -16126,12 +16126,12 @@ class jr {
         accounts: O,
         programIdIndex: N
       } = x, F = Array.from(Pt.decode(x.data));
-      let C = [];
-      Ht(C, O.length);
+      let M = [];
+      Ht(M, O.length);
       let k = [];
       return Ht(k, F.length), {
         programIdIndex: N,
-        keyIndicesCount: xe.Buffer.from(C),
+        keyIndicesCount: xe.Buffer.from(M),
         keyIndices: O,
         dataLength: xe.Buffer.from(k),
         data: F
@@ -16143,10 +16143,10 @@ class jr {
     xe.Buffer.from(s).copy(i);
     let o = s.length;
     r.forEach((x) => {
-      const N = M.struct([M.u8("programIdIndex"), M.blob(x.keyIndicesCount.length, "keyIndicesCount"), M.seq(M.u8("keyIndex"), x.keyIndices.length, "keyIndices"), M.blob(x.dataLength.length, "dataLength"), M.seq(M.u8("userdatum"), x.data.length, "data")]).encode(x, i, o);
+      const N = B.struct([B.u8("programIdIndex"), B.blob(x.keyIndicesCount.length, "keyIndicesCount"), B.seq(B.u8("keyIndex"), x.keyIndices.length, "keyIndices"), B.blob(x.dataLength.length, "dataLength"), B.seq(B.u8("userdatum"), x.data.length, "data")]).encode(x, i, o);
       o += N;
     }), i = i.slice(0, o);
-    const a = M.struct([M.blob(1, "numRequiredSignatures"), M.blob(1, "numReadonlySignedAccounts"), M.blob(1, "numReadonlyUnsignedAccounts"), M.blob(n.length, "keyCount"), M.seq(Se("key"), e, "keys"), Se("recentBlockhash")]), d = {
+    const a = B.struct([B.blob(1, "numRequiredSignatures"), B.blob(1, "numReadonlySignedAccounts"), B.blob(1, "numReadonlyUnsignedAccounts"), B.blob(n.length, "keyCount"), B.seq(Se("key"), e, "keys"), Se("recentBlockhash")]), d = {
       numRequiredSignatures: xe.Buffer.from([this.header.numRequiredSignatures]),
       numReadonlySignedAccounts: xe.Buffer.from([this.header.numReadonlySignedAccounts]),
       numReadonlyUnsignedAccounts: xe.Buffer.from([this.header.numReadonlyUnsignedAccounts]),
@@ -16175,10 +16175,10 @@ class jr {
     const d = qt(n, 0, jn), m = Gt(n);
     let g = [];
     for (let O = 0; O < m; O++) {
-      const N = xn(n), F = Gt(n), C = qt(n, 0, F), k = Gt(n), K = qt(n, 0, k), Y = Pt.encode(xe.Buffer.from(K));
+      const N = xn(n), F = Gt(n), M = qt(n, 0, F), k = Gt(n), K = qt(n, 0, k), Y = Pt.encode(xe.Buffer.from(K));
       g.push({
         programIdIndex: N,
-        accounts: C,
+        accounts: M,
         data: Y
       });
     }
@@ -16289,7 +16289,7 @@ class Ki {
     Ht(r, this.compiledInstructions.length);
     const s = this.serializeAddressTableLookups(), i = Array();
     Ht(i, this.addressTableLookups.length);
-    const o = M.struct([M.u8("prefix"), M.struct([M.u8("numRequiredSignatures"), M.u8("numReadonlySignedAccounts"), M.u8("numReadonlyUnsignedAccounts")], "header"), M.blob(e.length, "staticAccountKeysLength"), M.seq(Se(), this.staticAccountKeys.length, "staticAccountKeys"), Se("recentBlockhash"), M.blob(r.length, "instructionsLength"), M.blob(n.length, "serializedInstructions"), M.blob(i.length, "addressTableLookupsLength"), M.blob(s.length, "serializedAddressTableLookups")]), a = new Uint8Array(Ir), m = o.encode({
+    const o = B.struct([B.u8("prefix"), B.struct([B.u8("numRequiredSignatures"), B.u8("numReadonlySignedAccounts"), B.u8("numReadonlyUnsignedAccounts")], "header"), B.blob(e.length, "staticAccountKeysLength"), B.seq(Se(), this.staticAccountKeys.length, "staticAccountKeys"), Se("recentBlockhash"), B.blob(r.length, "instructionsLength"), B.blob(n.length, "serializedInstructions"), B.blob(i.length, "addressTableLookupsLength"), B.blob(s.length, "serializedAddressTableLookups")]), a = new Uint8Array(Ir), m = o.encode({
       prefix: 128,
       header: this.header,
       staticAccountKeysLength: new Uint8Array(e),
@@ -16310,7 +16310,7 @@ class Ki {
       Ht(s, r.accountKeyIndexes.length);
       const i = Array();
       Ht(i, r.data.length);
-      const o = M.struct([M.u8("programIdIndex"), M.blob(s.length, "encodedAccountKeyIndexesLength"), M.seq(M.u8(), r.accountKeyIndexes.length, "accountKeyIndexes"), M.blob(i.length, "encodedDataLength"), M.blob(r.data.length, "data")]);
+      const o = B.struct([B.u8("programIdIndex"), B.blob(s.length, "encodedAccountKeyIndexesLength"), B.seq(B.u8(), r.accountKeyIndexes.length, "accountKeyIndexes"), B.blob(i.length, "encodedDataLength"), B.blob(r.data.length, "data")]);
       e += o.encode({
         programIdIndex: r.programIdIndex,
         encodedAccountKeyIndexesLength: new Uint8Array(s),
@@ -16329,7 +16329,7 @@ class Ki {
       Ht(s, r.writableIndexes.length);
       const i = Array();
       Ht(i, r.readonlyIndexes.length);
-      const o = M.struct([Se("accountKey"), M.blob(s.length, "encodedWritableIndexesLength"), M.seq(M.u8(), r.writableIndexes.length, "writableIndexes"), M.blob(i.length, "encodedReadonlyIndexesLength"), M.seq(M.u8(), r.readonlyIndexes.length, "readonlyIndexes")]);
+      const o = B.struct([Se("accountKey"), B.blob(s.length, "encodedWritableIndexesLength"), B.seq(B.u8(), r.writableIndexes.length, "writableIndexes"), B.blob(i.length, "encodedReadonlyIndexesLength"), B.seq(B.u8(), r.readonlyIndexes.length, "readonlyIndexes")]);
       e += o.encode({
         accountKey: r.accountKey.toBytes(),
         encodedWritableIndexesLength: new Uint8Array(s),
@@ -16355,18 +16355,18 @@ class Ki {
       a.push(new be(qt(n, 0, jn)));
     const m = Pt.encode(qt(n, 0, jn)), g = Gt(n), x = [];
     for (let F = 0; F < g; F++) {
-      const C = xn(n), k = Gt(n), K = qt(n, 0, k), Y = Gt(n), V = new Uint8Array(qt(n, 0, Y));
+      const M = xn(n), k = Gt(n), K = qt(n, 0, k), Y = Gt(n), V = new Uint8Array(qt(n, 0, Y));
       x.push({
-        programIdIndex: C,
+        programIdIndex: M,
         accountKeyIndexes: K,
         data: V
       });
     }
     const O = Gt(n), N = [];
     for (let F = 0; F < O; F++) {
-      const C = new be(qt(n, 0, jn)), k = Gt(n), K = qt(n, 0, k), Y = Gt(n), V = qt(n, 0, Y);
+      const M = new be(qt(n, 0, jn)), k = Gt(n), K = qt(n, 0, k), Y = Gt(n), V = qt(n, 0, Y);
       N.push({
-        accountKey: C,
+        accountKey: M,
         writableIndexes: K,
         readonlyIndexes: V
       });
@@ -16506,34 +16506,34 @@ class Wi {
       r = this.signatures[0].publicKey;
     else
       throw new Error("Transaction fee payer required");
-    for (let C = 0; C < n.length; C++)
-      if (n[C].programId === void 0)
-        throw new Error(`Transaction instruction index ${C} has undefined program id`);
+    for (let M = 0; M < n.length; M++)
+      if (n[M].programId === void 0)
+        throw new Error(`Transaction instruction index ${M} has undefined program id`);
     const s = [], i = [];
-    n.forEach((C) => {
-      C.keys.forEach((K) => {
+    n.forEach((M) => {
+      M.keys.forEach((K) => {
         i.push({
           ...K
         });
       });
-      const k = C.programId.toString();
+      const k = M.programId.toString();
       s.includes(k) || s.push(k);
-    }), s.forEach((C) => {
+    }), s.forEach((M) => {
       i.push({
-        pubkey: new be(C),
+        pubkey: new be(M),
         isSigner: !1,
         isWritable: !1
       });
     });
     const o = [];
-    i.forEach((C) => {
-      const k = C.pubkey.toString(), K = o.findIndex((Y) => Y.pubkey.toString() === k);
-      K > -1 ? (o[K].isWritable = o[K].isWritable || C.isWritable, o[K].isSigner = o[K].isSigner || C.isSigner) : o.push(C);
-    }), o.sort(function(C, k) {
-      if (C.isSigner !== k.isSigner)
-        return C.isSigner ? -1 : 1;
-      if (C.isWritable !== k.isWritable)
-        return C.isWritable ? -1 : 1;
+    i.forEach((M) => {
+      const k = M.pubkey.toString(), K = o.findIndex((Y) => Y.pubkey.toString() === k);
+      K > -1 ? (o[K].isWritable = o[K].isWritable || M.isWritable, o[K].isSigner = o[K].isSigner || M.isSigner) : o.push(M);
+    }), o.sort(function(M, k) {
+      if (M.isSigner !== k.isSigner)
+        return M.isSigner ? -1 : 1;
+      if (M.isWritable !== k.isWritable)
+        return M.isWritable ? -1 : 1;
       const K = {
         localeMatcher: "best fit",
         usage: "sort",
@@ -16542,47 +16542,47 @@ class Wi {
         numeric: !1,
         caseFirst: "lower"
       };
-      return C.pubkey.toBase58().localeCompare(k.pubkey.toBase58(), "en", K);
+      return M.pubkey.toBase58().localeCompare(k.pubkey.toBase58(), "en", K);
     });
-    const a = o.findIndex((C) => C.pubkey.equals(r));
+    const a = o.findIndex((M) => M.pubkey.equals(r));
     if (a > -1) {
-      const [C] = o.splice(a, 1);
-      C.isSigner = !0, C.isWritable = !0, o.unshift(C);
+      const [M] = o.splice(a, 1);
+      M.isSigner = !0, M.isWritable = !0, o.unshift(M);
     } else
       o.unshift({
         pubkey: r,
         isSigner: !0,
         isWritable: !0
       });
-    for (const C of this.signatures) {
-      const k = o.findIndex((K) => K.pubkey.equals(C.publicKey));
+    for (const M of this.signatures) {
+      const k = o.findIndex((K) => K.pubkey.equals(M.publicKey));
       if (k > -1)
         o[k].isSigner || (o[k].isSigner = !0, console.warn("Transaction references a signature that is unnecessary, only the fee payer and instruction signer accounts should sign a transaction. This behavior is deprecated and will throw an error in the next major version release."));
       else
-        throw new Error(`unknown signer: ${C.publicKey.toString()}`);
+        throw new Error(`unknown signer: ${M.publicKey.toString()}`);
     }
     let d = 0, m = 0, g = 0;
     const x = [], O = [];
     o.forEach(({
-      pubkey: C,
+      pubkey: M,
       isSigner: k,
       isWritable: K
     }) => {
-      k ? (x.push(C.toString()), d += 1, K || (m += 1)) : (O.push(C.toString()), K || (g += 1));
+      k ? (x.push(M.toString()), d += 1, K || (m += 1)) : (O.push(M.toString()), K || (g += 1));
     });
-    const N = x.concat(O), F = n.map((C) => {
+    const N = x.concat(O), F = n.map((M) => {
       const {
         data: k,
         programId: K
-      } = C;
+      } = M;
       return {
         programIdIndex: N.indexOf(K.toString()),
-        accounts: C.keys.map((Y) => N.indexOf(Y.pubkey.toString())),
+        accounts: M.keys.map((Y) => N.indexOf(Y.pubkey.toString())),
         data: Pt.encode(k)
       };
     });
-    return F.forEach((C) => {
-      gt(C.programIdIndex >= 0), C.accounts.forEach((k) => gt(k >= 0));
+    return F.forEach((M) => {
+      gt(M.programIdIndex >= 0), M.accounts.forEach((k) => gt(k >= 0));
     }), new jr({
       header: {
         numRequiredSignatures: d,
@@ -16876,7 +16876,7 @@ class cu {
   serialize() {
     const e = this.message.serialize(), n = Array();
     Ht(n, this.signatures.length);
-    const r = M.struct([M.blob(n.length, "encodedSignaturesLength"), M.seq(CA(), this.signatures.length, "signatures"), M.blob(e.length, "serializedMessage")]), s = new Uint8Array(2048), i = r.encode({
+    const r = B.struct([B.blob(n.length, "encodedSignaturesLength"), B.seq(CA(), this.signatures.length, "signatures"), B.blob(e.length, "serializedMessage")]), s = new Uint8Array(2048), i = r.encode({
       encodedSignaturesLength: new Uint8Array(n),
       signatures: this.signatures,
       serializedMessage: e
@@ -16913,10 +16913,10 @@ new be("SysvarRewards111111111111111111111111111111");
 new be("SysvarS1otHashes111111111111111111111111111");
 new be("SysvarS1otHistory11111111111111111111111111");
 new be("SysvarStakeHistory1111111111111111111111111");
-const UA = M.nu64("lamportsPerSignature"), DA = M.struct([M.u32("version"), M.u32("state"), Se("authorizedPubkey"), Se("nonce"), M.struct([UA], "feeCalculator")]);
+const UA = B.nu64("lamportsPerSignature"), DA = B.struct([B.u32("version"), B.u32("state"), Se("authorizedPubkey"), Se("nonce"), B.struct([UA], "feeCalculator")]);
 DA.span;
 function Vr(t) {
-  const e = M.blob(8, t), n = e.decode.bind(e), r = e.encode.bind(e), s = e, i = JR();
+  const e = B.blob(8, t), n = e.decode.bind(e), r = e.encode.bind(e), s = e, i = JR();
   return s.decode = (o, a) => {
     const d = n(o, a);
     return i.decode(d);
@@ -16928,67 +16928,67 @@ function Vr(t) {
 Object.freeze({
   Create: {
     index: 0,
-    layout: M.struct([M.u32("instruction"), M.ns64("lamports"), M.ns64("space"), Se("programId")])
+    layout: B.struct([B.u32("instruction"), B.ns64("lamports"), B.ns64("space"), Se("programId")])
   },
   Assign: {
     index: 1,
-    layout: M.struct([M.u32("instruction"), Se("programId")])
+    layout: B.struct([B.u32("instruction"), Se("programId")])
   },
   Transfer: {
     index: 2,
-    layout: M.struct([M.u32("instruction"), Vr("lamports")])
+    layout: B.struct([B.u32("instruction"), Vr("lamports")])
   },
   CreateWithSeed: {
     index: 3,
-    layout: M.struct([M.u32("instruction"), Se("base"), Sr("seed"), M.ns64("lamports"), M.ns64("space"), Se("programId")])
+    layout: B.struct([B.u32("instruction"), Se("base"), Sr("seed"), B.ns64("lamports"), B.ns64("space"), Se("programId")])
   },
   AdvanceNonceAccount: {
     index: 4,
-    layout: M.struct([M.u32("instruction")])
+    layout: B.struct([B.u32("instruction")])
   },
   WithdrawNonceAccount: {
     index: 5,
-    layout: M.struct([M.u32("instruction"), M.ns64("lamports")])
+    layout: B.struct([B.u32("instruction"), B.ns64("lamports")])
   },
   InitializeNonceAccount: {
     index: 6,
-    layout: M.struct([M.u32("instruction"), Se("authorized")])
+    layout: B.struct([B.u32("instruction"), Se("authorized")])
   },
   AuthorizeNonceAccount: {
     index: 7,
-    layout: M.struct([M.u32("instruction"), Se("authorized")])
+    layout: B.struct([B.u32("instruction"), Se("authorized")])
   },
   Allocate: {
     index: 8,
-    layout: M.struct([M.u32("instruction"), M.ns64("space")])
+    layout: B.struct([B.u32("instruction"), B.ns64("space")])
   },
   AllocateWithSeed: {
     index: 9,
-    layout: M.struct([M.u32("instruction"), Se("base"), Sr("seed"), M.ns64("space"), Se("programId")])
+    layout: B.struct([B.u32("instruction"), Se("base"), Sr("seed"), B.ns64("space"), Se("programId")])
   },
   AssignWithSeed: {
     index: 10,
-    layout: M.struct([M.u32("instruction"), Se("base"), Sr("seed"), Se("programId")])
+    layout: B.struct([B.u32("instruction"), Se("base"), Sr("seed"), Se("programId")])
   },
   TransferWithSeed: {
     index: 11,
-    layout: M.struct([M.u32("instruction"), Vr("lamports"), Sr("seed"), Se("programId")])
+    layout: B.struct([B.u32("instruction"), Vr("lamports"), Sr("seed"), Se("programId")])
   },
   UpgradeNonceAccount: {
     index: 12,
-    layout: M.struct([M.u32("instruction")])
+    layout: B.struct([B.u32("instruction")])
   }
 });
 new be("11111111111111111111111111111111");
 new be("BPFLoader2111111111111111111111111111111111");
-M.struct([
-  M.u32("typeIndex"),
+B.struct([
+  B.u32("typeIndex"),
   Vr("deactivationSlot"),
-  M.nu64("lastExtendedSlot"),
-  M.u8("lastExtendedStartIndex"),
-  M.u8(),
+  B.nu64("lastExtendedSlot"),
+  B.u8("lastExtendedStartIndex"),
+  B.u8(),
   // option
-  M.seq(Se(), M.offset(M.u8(), -1), "authority")
+  B.seq(Se(), B.offset(B.u8(), -1), "authority")
 ]);
 const Ze = Js(ru(be), se(), (t) => new be(t)), Lh = su([se(), Ge("base64")]), uu = Js(ru(xe.Buffer), Lh, (t) => xe.Buffer.from(t[0], "base64"));
 function Ph(t) {
@@ -17524,50 +17524,50 @@ Q({
 Object.freeze({
   CreateLookupTable: {
     index: 0,
-    layout: M.struct([M.u32("instruction"), Vr("recentSlot"), M.u8("bumpSeed")])
+    layout: B.struct([B.u32("instruction"), Vr("recentSlot"), B.u8("bumpSeed")])
   },
   FreezeLookupTable: {
     index: 1,
-    layout: M.struct([M.u32("instruction")])
+    layout: B.struct([B.u32("instruction")])
   },
   ExtendLookupTable: {
     index: 2,
-    layout: M.struct([M.u32("instruction"), Vr(), M.seq(Se(), M.offset(M.u32(), -8), "addresses")])
+    layout: B.struct([B.u32("instruction"), Vr(), B.seq(Se(), B.offset(B.u32(), -8), "addresses")])
   },
   DeactivateLookupTable: {
     index: 3,
-    layout: M.struct([M.u32("instruction")])
+    layout: B.struct([B.u32("instruction")])
   },
   CloseLookupTable: {
     index: 4,
-    layout: M.struct([M.u32("instruction")])
+    layout: B.struct([B.u32("instruction")])
   }
 });
 new be("AddressLookupTab1e1111111111111111111111111");
 Object.freeze({
   RequestUnits: {
     index: 0,
-    layout: M.struct([M.u8("instruction"), M.u32("units"), M.u32("additionalFee")])
+    layout: B.struct([B.u8("instruction"), B.u32("units"), B.u32("additionalFee")])
   },
   RequestHeapFrame: {
     index: 1,
-    layout: M.struct([M.u8("instruction"), M.u32("bytes")])
+    layout: B.struct([B.u8("instruction"), B.u32("bytes")])
   },
   SetComputeUnitLimit: {
     index: 2,
-    layout: M.struct([M.u8("instruction"), M.u32("units")])
+    layout: B.struct([B.u8("instruction"), B.u32("units")])
   },
   SetComputeUnitPrice: {
     index: 3,
-    layout: M.struct([M.u8("instruction"), Vr("microLamports")])
+    layout: B.struct([B.u8("instruction"), Vr("microLamports")])
   }
 });
 new be("ComputeBudget111111111111111111111111111111");
-M.struct([M.u8("numSignatures"), M.u8("padding"), M.u16("signatureOffset"), M.u16("signatureInstructionIndex"), M.u16("publicKeyOffset"), M.u16("publicKeyInstructionIndex"), M.u16("messageDataOffset"), M.u16("messageDataSize"), M.u16("messageInstructionIndex")]);
+B.struct([B.u8("numSignatures"), B.u8("padding"), B.u16("signatureOffset"), B.u16("signatureInstructionIndex"), B.u16("publicKeyOffset"), B.u16("publicKeyInstructionIndex"), B.u16("messageDataOffset"), B.u16("messageDataSize"), B.u16("messageInstructionIndex")]);
 new be("Ed25519SigVerify111111111111111111111111111");
 Gc.utils.isValidPrivateKey;
 Gc.getPublicKey;
-M.struct([M.u8("numSignatures"), M.u16("signatureOffset"), M.u8("signatureInstructionIndex"), M.u16("ethAddressOffset"), M.u8("ethAddressInstructionIndex"), M.u16("messageDataOffset"), M.u16("messageDataSize"), M.u8("messageInstructionIndex"), M.blob(20, "ethAddress"), M.blob(64, "signature"), M.u8("recoveryId")]);
+B.struct([B.u8("numSignatures"), B.u16("signatureOffset"), B.u8("signatureInstructionIndex"), B.u16("ethAddressOffset"), B.u8("ethAddressInstructionIndex"), B.u16("messageDataOffset"), B.u16("messageDataSize"), B.u8("messageInstructionIndex"), B.blob(20, "ethAddress"), B.blob(64, "signature"), B.u8("recoveryId")]);
 new be("KeccakSecp256k11111111111111111111111111111");
 var Hh;
 new be("StakeConfig11111111111111111111111111111111");
@@ -17587,58 +17587,58 @@ qh.default = new Hh(0, 0, be.default);
 Object.freeze({
   Initialize: {
     index: 0,
-    layout: M.struct([M.u32("instruction"), MA(), BA()])
+    layout: B.struct([B.u32("instruction"), MA(), BA()])
   },
   Authorize: {
     index: 1,
-    layout: M.struct([M.u32("instruction"), Se("newAuthorized"), M.u32("stakeAuthorizationType")])
+    layout: B.struct([B.u32("instruction"), Se("newAuthorized"), B.u32("stakeAuthorizationType")])
   },
   Delegate: {
     index: 2,
-    layout: M.struct([M.u32("instruction")])
+    layout: B.struct([B.u32("instruction")])
   },
   Split: {
     index: 3,
-    layout: M.struct([M.u32("instruction"), M.ns64("lamports")])
+    layout: B.struct([B.u32("instruction"), B.ns64("lamports")])
   },
   Withdraw: {
     index: 4,
-    layout: M.struct([M.u32("instruction"), M.ns64("lamports")])
+    layout: B.struct([B.u32("instruction"), B.ns64("lamports")])
   },
   Deactivate: {
     index: 5,
-    layout: M.struct([M.u32("instruction")])
+    layout: B.struct([B.u32("instruction")])
   },
   Merge: {
     index: 7,
-    layout: M.struct([M.u32("instruction")])
+    layout: B.struct([B.u32("instruction")])
   },
   AuthorizeWithSeed: {
     index: 8,
-    layout: M.struct([M.u32("instruction"), Se("newAuthorized"), M.u32("stakeAuthorizationType"), Sr("authoritySeed"), Se("authorityOwner")])
+    layout: B.struct([B.u32("instruction"), Se("newAuthorized"), B.u32("stakeAuthorizationType"), Sr("authoritySeed"), Se("authorityOwner")])
   }
 });
 new be("Stake11111111111111111111111111111111111111");
 Object.freeze({
   InitializeAccount: {
     index: 0,
-    layout: M.struct([M.u32("instruction"), kA()])
+    layout: B.struct([B.u32("instruction"), kA()])
   },
   Authorize: {
     index: 1,
-    layout: M.struct([M.u32("instruction"), Se("newAuthorized"), M.u32("voteAuthorizationType")])
+    layout: B.struct([B.u32("instruction"), Se("newAuthorized"), B.u32("voteAuthorizationType")])
   },
   Withdraw: {
     index: 3,
-    layout: M.struct([M.u32("instruction"), M.ns64("lamports")])
+    layout: B.struct([B.u32("instruction"), B.ns64("lamports")])
   },
   UpdateValidatorIdentity: {
     index: 4,
-    layout: M.struct([M.u32("instruction")])
+    layout: B.struct([B.u32("instruction")])
   },
   AuthorizeWithSeed: {
     index: 10,
-    layout: M.struct([M.u32("instruction"), LA()])
+    layout: B.struct([B.u32("instruction"), LA()])
   }
 });
 new be("Vote111111111111111111111111111111111111111");
@@ -17651,23 +17651,23 @@ Q({
   keybaseUsername: fe(se())
 });
 new be("Vote111111111111111111111111111111111111111");
-M.struct([
+B.struct([
   Se("nodePubkey"),
   Se("authorizedWithdrawer"),
-  M.u8("commission"),
-  M.nu64(),
+  B.u8("commission"),
+  B.nu64(),
   // votes.length
-  M.seq(M.struct([M.nu64("slot"), M.u32("confirmationCount")]), M.offset(M.u32(), -8), "votes"),
-  M.u8("rootSlotValid"),
-  M.nu64("rootSlot"),
-  M.nu64(),
+  B.seq(B.struct([B.nu64("slot"), B.u32("confirmationCount")]), B.offset(B.u32(), -8), "votes"),
+  B.u8("rootSlotValid"),
+  B.nu64("rootSlot"),
+  B.nu64(),
   // authorizedVoters.length
-  M.seq(M.struct([M.nu64("epoch"), Se("authorizedVoter")]), M.offset(M.u32(), -8), "authorizedVoters"),
-  M.struct([M.seq(M.struct([Se("authorizedPubkey"), M.nu64("epochOfLastAuthorizedSwitch"), M.nu64("targetEpoch")]), 32, "buf"), M.nu64("idx"), M.u8("isEmpty")], "priorVoters"),
-  M.nu64(),
+  B.seq(B.struct([B.nu64("epoch"), Se("authorizedVoter")]), B.offset(B.u32(), -8), "authorizedVoters"),
+  B.struct([B.seq(B.struct([Se("authorizedPubkey"), B.nu64("epochOfLastAuthorizedSwitch"), B.nu64("targetEpoch")]), 32, "buf"), B.nu64("idx"), B.u8("isEmpty")], "priorVoters"),
+  B.nu64(),
   // epochCredits.length
-  M.seq(M.struct([M.nu64("epoch"), M.nu64("credits"), M.nu64("prevCredits")]), M.offset(M.u32(), -8), "epochCredits"),
-  M.struct([M.nu64("slot"), M.nu64("timestamp")], "lastTimestamp")
+  B.seq(B.struct([B.nu64("epoch"), B.nu64("credits"), B.nu64("prevCredits")]), B.offset(B.u32(), -8), "epochCredits"),
+  B.struct([B.nu64("slot"), B.nu64("timestamp")], "lastTimestamp")
 ]);
 const cx = (t) => ({
   request: t,
@@ -19736,19 +19736,19 @@ function e2(t) {
     sessionToken: x,
     farcasterMiniApp: O,
     wagmiConfig: N
-  } = t, [F, C] = Sn(0), [k, K] = Sn(""), [Y, V] = Sn(null), [L, z] = Sn(!1), J = wi(null), te = wi(!1);
+  } = t, [F, M] = Sn(0), [k, K] = Sn(""), [Y, V] = Sn(null), [L, z] = Sn(!1), J = wi(null), te = wi(!1);
   un(() => {
-    const P = n?.theme;
-    if (P === "dark") {
+    const C = n?.theme;
+    if (C === "dark") {
       z(!0);
       return;
     }
-    if (P === "light") {
+    if (C === "light") {
       z(!1);
       return;
     }
-    const j = window.matchMedia("(prefers-color-scheme: dark)"), E = () => z(j.matches);
-    return E(), j.addEventListener("change", E), () => j.removeEventListener("change", E);
+    const P = window.matchMedia("(prefers-color-scheme: dark)"), j = () => z(P.matches);
+    return j(), P.addEventListener("change", j), () => P.removeEventListener("change", j);
   }, [n?.theme]), Me.config({
     api_key: "",
     // @ts-expect-error
@@ -19756,121 +19756,126 @@ function e2(t) {
   }), un(() => {
     K(Me.getPayModalUrl(e));
   }, [e]), un(() => {
-    const P = n?.theme;
-    if (!P || fT.includes(P)) {
+    const C = n?.theme;
+    if (!C || fT.includes(C)) {
       V(null);
       return;
     }
-    let j = !1;
+    let P = !1;
     return (async () => {
       try {
-        const c = Me.getBaseUrl(), p = await fetch(`${c}/themes/${P}`);
-        if (!p.ok) return;
-        const y = await p.json();
-        !j && y.status === "approved" && y.cssContent && V(y.cssContent);
-      } catch (c) {
-        console.error("Failed to fetch theme:", c);
+        const E = Me.getBaseUrl(), c = await fetch(`${E}/themes/${C}`);
+        if (!c.ok) return;
+        const h = await c.json();
+        !P && h.status === "approved" && h.cssContent && V(h.cssContent);
+      } catch (E) {
+        console.error("Failed to fetch theme:", E);
       }
     })(), () => {
-      j = !0;
+      P = !0;
     };
   }, [n?.theme]), un(() => {
-    const P = document.body.style.overflow;
-    s ? (document.body.style.overflow = "hidden", document.body.style.overflow = "hidden") : document.body.style.overflow = P || "";
-    const j = async (E) => {
-      if (E.data === dn.CLOSED && (a(), d?.()), E?.data?.type === dn.COMPLETED) {
+    const C = document.body.style.overflow;
+    s ? (document.body.style.overflow = "hidden", document.body.style.overflow = "hidden") : document.body.style.overflow = C || "";
+    const P = async (j) => {
+      if (j.data === dn.CLOSED && (a(), d?.()), j?.data?.type === dn.COMPLETED) {
         window.setTimeout(a, 2e3);
-        const y = E?.data?.transactionHash ? {
-          transactionHash: E.data.transactionHash
+        const h = j?.data?.transactionHash ? {
+          transactionHash: j.data.transactionHash
         } : void 0;
-        m?.(y);
+        m?.(h);
       }
-      if (E.data === dn.REQUEST_FARCASTER_CONNECT)
+      if (j.data === dn.REQUEST_FARCASTER_CONNECT)
         try {
           await aT(J, N, O);
-        } catch (y) {
-          console.error(y);
+        } catch (h) {
+          console.error(h);
         }
-      if (E.data === dn.REQUEST_FARCASTER_DISCONNECT)
+      if (j.data === dn.REQUEST_FARCASTER_DISCONNECT)
         try {
           await cT(J, N, O);
-        } catch (y) {
-          console.error(y);
+        } catch (h) {
+          console.error(h);
         }
-      const p = E.data;
-      if (p?.type === dn.REQUEST_FARCASTER_SEND_TRANSACTION && typeof p.requestId == "string" && p.params)
+      const c = j.data;
+      if (c?.type === dn.REQUEST_FARCASTER_SEND_TRANSACTION && typeof c.requestId == "string" && c.params)
         try {
-          const y = await uT(p.params, N, O, J.current, p.requestId);
-          y ? [hi, pi].forEach((A) => {
+          const h = await uT(c.params, N, O, J.current, c.requestId);
+          h ? [hi, pi].forEach((y) => {
             J.current?.contentWindow?.postMessage({
               type: dn.FARCASTER_SEND_TRANSACTION_RESULT,
-              requestId: p.requestId,
-              hash: y
-            }, A);
-          }) : [hi, pi].forEach((A) => {
+              requestId: c.requestId,
+              hash: h
+            }, y);
+          }) : [hi, pi].forEach((y) => {
             J.current?.contentWindow?.postMessage({
               type: dn.FARCASTER_SEND_TRANSACTION_RESULT,
-              requestId: p.requestId,
+              requestId: c.requestId,
               error: "sendTransaction not configured or returned no hash"
-            }, A);
+            }, y);
           });
-        } catch (y) {
-          console.log(y);
+        } catch (h) {
+          console.log(h);
         }
     };
-    return window.addEventListener("message", j), () => {
-      document.body.style.overflow = P || "", window.removeEventListener("message", j);
+    return window.addEventListener("message", P), () => {
+      document.body.style.overflow = C || "", window.removeEventListener("message", P);
     };
   }, [s, d, m, a, O, N]), un(() => {
     if (!x) return;
-    const P = t.css || Y || void 0, j = async () => {
-      const c = await f0.isInMiniApp(), p = r?.map(iT) || [], y = N ? dT(N) : void 0;
+    const C = t.css || Y || void 0, P = async () => {
+      const E = await f0.isInMiniApp(), c = r?.map(iT) || [], h = N ? dT(N) : void 0;
       return {
         type: "session",
         session_token: x,
         environment: Me.getEnv() || yc.PRODUCTION,
         styles: n,
         props: {
-          excludeChains: p.join(","),
-          isFarcasterMiniApp: c,
-          ...y?.length ? {
-            supportedChains: y
+          excludeChains: c.join(","),
+          isFarcasterMiniApp: E,
+          ...h?.length ? {
+            supportedChains: h
           } : {}
         },
-        ...P ? {
-          css: P
+        ...C ? {
+          css: C
         } : {}
       };
     };
-    let E = !1;
-    return j().then((c) => {
-      E || ([hi, pi].forEach((p) => {
-        J.current?.contentWindow?.postMessage(c, p);
+    let j = !1;
+    return P().then((E) => {
+      j || ([hi, pi].forEach((c) => {
+        J.current?.contentWindow?.postMessage(E, c);
       }), window.setTimeout(() => {
-        E || [hi, pi].forEach((p) => {
-          J.current?.contentWindow?.postMessage(c, p);
+        j || [hi, pi].forEach((c) => {
+          J.current?.contentWindow?.postMessage(E, c);
         });
       }, 1e3));
     }), () => {
-      E = !0;
+      j = !0;
     };
   }, [x, F, s, n, Y]), un(() => {
     if (!s) return;
-    const P = te.current;
-    C(P ? Math.random() : 0);
+    const C = te.current;
+    M(C ? Math.random() : 0);
   }, [s]);
   function ne() {
-    te.current = !0, C(Math.random());
+    te.current = !0, M(Math.random());
   }
   un(() => {
-    const P = document.querySelector(".payment-modal-loader-container"), j = document.querySelector(".payment-modal-loader-logo");
-    P.style.opacity = "1", P.style.transform = "translateX(-50%)", j.style.opacity = "1", j.style.transform = "scale(1)", j.style.filter = "blur(0px)";
+    const C = document.querySelector(".payment-modal-loader-container"), P = document.querySelector(".payment-modal-loader-logo");
+    C.style.opacity = "1", C.style.transform = "translateX(-50%)", P.style.opacity = "1", P.style.transform = "scale(1)", P.style.filter = "blur(0px)";
   }, []);
-  const q = F === 0 || i, B = (Number(e) || 0) > 0;
+  const q = F === 0 || i;
   return /* @__PURE__ */ Oa("div", {
     className: Ko("payment-modal-wrapper", s ? "open" : "closed"),
     children: [/* @__PURE__ */ En("div", {
-      className: Ko("payment-modal-loader-container", L ? "dark-mode" : "light-mode", B ? "has-amount" : "no-amount"),
+      className: Ko(
+        "payment-modal-loader-container",
+        L ? "dark-mode" : "light-mode",
+        // hasAmount ? "has-amount" : "no-amount",
+        "no-amount"
+      ),
       children: /* @__PURE__ */ En(lT, {})
     }), /* @__PURE__ */ En("iframe", {
       allow: "clipboard-read *; clipboard-write *",
@@ -20095,8 +20100,8 @@ function B0(t = {}) {
     s
   ), F = RT(t, N);
   no.set(t, F);
-  const C = [t, o, x];
-  return ur.set(F, C), Reflect.ownKeys(t).forEach((k) => {
+  const M = [t, o, x];
+  return ur.set(F, M), Reflect.ownKeys(t).forEach((k) => {
     const K = Object.getOwnPropertyDescriptor(
       t,
       k
@@ -20189,15 +20194,15 @@ function t2({
     a(!1);
   }
   const F = () => {
-    const C = Date.now();
+    const M = Date.now();
     Ln.isPending = !0, Ln.error = null, Ln.data = null, fetch(t, {
       headers: {
         "Content-Type": "application/json"
       }
     }).then((k) => k.json()).then((k) => {
-      C < d || (Ln.data = k, Ln.isPending = !1, m(C));
+      M < d || (Ln.data = k, Ln.isPending = !1, m(M));
     }).catch((k) => {
-      C < d || (Ln.error = k?.toString(), Ln.isPending = !1, m(C), setInterval(F, 5e3));
+      M < d || (Ln.error = k?.toString(), Ln.isPending = !1, m(M), setInterval(F, 5e3));
     });
   };
   return un(() => {
@@ -20228,10 +20233,10 @@ function n2({
 }) {
   const [o, a] = Sn(!1), [d, m] = Sn(t), [g, x] = Sn(e);
   function O({
-    sessionToken: C,
+    sessionToken: M,
     amount: k
   }) {
-    m(C), x(k);
+    m(M), x(k);
   }
   un(() => {
     m(t);