@zama-fhe/relayer-sdk 0.1.2 → 0.2.0-1

package/bundle/relayer-sdk-js.js

@@ -80,7 +80,7 @@ Nu.write = function(n, t, e, r, i, o) {
  */
 (function(n) {
   const t = Lo, e = Nu, r = typeof Symbol == "function" && typeof Symbol.for == "function" ? Symbol.for("nodejs.util.inspect.custom") : null;
-  n.Buffer = f, n.SlowBuffer = k, n.INSPECT_MAX_BYTES = 50;
+  n.Buffer = f, n.SlowBuffer = P, n.INSPECT_MAX_BYTES = 50;
   const i = 2147483647;
   n.kMaxLength = i;
   const { Uint8Array: o, ArrayBuffer: a, SharedArrayBuffer: u } = globalThis;
@@ -145,7 +145,7 @@ Nu.write = function(n, t, e, r, i, o) {
     const F = b.valueOf && b.valueOf();
     if (F != null && F !== b)
       return f.from(F, h, w);
-    const U = P(b);
+    const U = k(b);
     if (U) return U;
     if (typeof Symbol < "u" && Symbol.toPrimitive != null && typeof b[Symbol.toPrimitive] == "function")
       return f.from(b[Symbol.toPrimitive]("string"), h, w);
@@ -205,7 +205,7 @@ Nu.write = function(n, t, e, r, i, o) {
     let F;
     return h === void 0 && w === void 0 ? F = new o(b) : w === void 0 ? F = new o(b, h) : F = new o(b, h, w), Object.setPrototypeOf(F, f.prototype), F;
   }
-  function P(b) {
+  function k(b) {
     if (f.isBuffer(b)) {
       const h = z(b.length) | 0, w = l(h);
       return w.length === 0 || b.copy(w, 0, 0, h), w;
@@ -220,7 +220,7 @@ Nu.write = function(n, t, e, r, i, o) {
       throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x" + i.toString(16) + " bytes");
     return b | 0;
   }
-  function k(b) {
+  function P(b) {
     return +b != b && (b = 0), f.alloc(+b);
   }
   f.isBuffer = function(h) {
@@ -397,14 +397,14 @@ Nu.write = function(n, t, e, r, i, o) {
     if (w >= F)
       return 1;
     if (w >>>= 0, F >>>= 0, U >>>= 0, J >>>= 0, this === h) return 0;
-    let st = J - U, kt = F - w;
-    const Vt = Math.min(st, kt), qt = this.slice(U, J), Kt = h.slice(w, F);
+    let st = J - U, Pt = F - w;
+    const Vt = Math.min(st, Pt), qt = this.slice(U, J), Kt = h.slice(w, F);
     for (let Dt = 0; Dt < Vt; ++Dt)
       if (qt[Dt] !== Kt[Dt]) {
-        st = qt[Dt], kt = Kt[Dt];
+        st = qt[Dt], Pt = Kt[Dt];
         break;
       }
-    return st < kt ? -1 : kt < st ? 1 : 0;
+    return st < Pt ? -1 : Pt < st ? 1 : 0;
   };
   function Y(b, h, w, F, U) {
     if (b.length === 0) return -1;
@@ -421,11 +421,11 @@ Nu.write = function(n, t, e, r, i, o) {
     throw new TypeError("val must be string, number or Buffer");
   }
   function Z(b, h, w, F, U) {
-    let J = 1, st = b.length, kt = h.length;
+    let J = 1, st = b.length, Pt = h.length;
     if (F !== void 0 && (F = String(F).toLowerCase(), F === "ucs2" || F === "ucs-2" || F === "utf16le" || F === "utf-16le")) {
       if (b.length < 2 || h.length < 2)
         return -1;
-      J = 2, st /= 2, kt /= 2, w /= 2;
+      J = 2, st /= 2, Pt /= 2, w /= 2;
     }
     function Vt(Kt, Dt) {
       return J === 1 ? Kt[Dt] : Kt.readUInt16BE(Dt * J);
@@ -435,13 +435,13 @@ Nu.write = function(n, t, e, r, i, o) {
       let Kt = -1;
       for (qt = w; qt < st; qt++)
         if (Vt(b, qt) === Vt(h, Kt === -1 ? 0 : qt - Kt)) {
-          if (Kt === -1 && (Kt = qt), qt - Kt + 1 === kt) return Kt * J;
+          if (Kt === -1 && (Kt = qt), qt - Kt + 1 === Pt) return Kt * J;
         } else
           Kt !== -1 && (qt -= qt - Kt), Kt = -1;
     } else
-      for (w + kt > st && (w = st - kt), qt = w; qt >= 0; qt--) {
+      for (w + Pt > st && (w = st - Pt), qt = w; qt >= 0; qt--) {
         let Kt = !0;
-        for (let Dt = 0; Dt < kt; Dt++)
+        for (let Dt = 0; Dt < Pt; Dt++)
           if (Vt(b, qt + Dt) !== Vt(h, Dt)) {
             Kt = !1;
             break;
@@ -465,9 +465,9 @@ Nu.write = function(n, t, e, r, i, o) {
     F > J / 2 && (F = J / 2);
     let st;
     for (st = 0; st < F; ++st) {
-      const kt = parseInt(h.substr(st * 2, 2), 16);
-      if (Ee(kt)) return st;
-      b[w + st] = kt;
+      const Pt = parseInt(h.substr(st * 2, 2), 16);
+      if (Ee(Pt)) return st;
+      b[w + st] = Pt;
     }
     return st;
   }
@@ -536,10 +536,10 @@ Nu.write = function(n, t, e, r, i, o) {
     let U = h;
     for (; U < w; ) {
       const J = b[U];
-      let st = null, kt = J > 239 ? 4 : J > 223 ? 3 : J > 191 ? 2 : 1;
-      if (U + kt <= w) {
+      let st = null, Pt = J > 239 ? 4 : J > 223 ? 3 : J > 191 ? 2 : 1;
+      if (U + Pt <= w) {
         let Vt, qt, Kt, Dt;
-        switch (kt) {
+        switch (Pt) {
           case 1:
             J < 128 && (st = J);
             break;
@@ -553,7 +553,7 @@ Nu.write = function(n, t, e, r, i, o) {
             Vt = b[U + 1], qt = b[U + 2], Kt = b[U + 3], (Vt & 192) === 128 && (qt & 192) === 128 && (Kt & 192) === 128 && (Dt = (J & 15) << 18 | (Vt & 63) << 12 | (qt & 63) << 6 | Kt & 63, Dt > 65535 && Dt < 1114112 && (st = Dt));
         }
       }
-      st === null ? (st = 65533, kt = 1) : st > 65535 && (st -= 65536, F.push(st >>> 10 & 1023 | 55296), st = 56320 | st & 1023), F.push(st), U += kt;
+      st === null ? (st = 65533, Pt = 1) : st > 65535 && (st -= 65536, F.push(st >>> 10 & 1023 | 55296), st = 56320 | st & 1023), F.push(st), U += Pt;
     }
     return vt(F);
   }
@@ -634,13 +634,13 @@ Nu.write = function(n, t, e, r, i, o) {
   }, f.prototype.readBigUInt64LE = ae(function(h) {
     h = h >>> 0, yt(h, "offset");
     const w = this[h], F = this[h + 7];
-    (w === void 0 || F === void 0) && Pt(h, this.length - 8);
+    (w === void 0 || F === void 0) && kt(h, this.length - 8);
     const U = w + this[++h] * 2 ** 8 + this[++h] * 2 ** 16 + this[++h] * 2 ** 24, J = this[++h] + this[++h] * 2 ** 8 + this[++h] * 2 ** 16 + F * 2 ** 24;
     return BigInt(U) + (BigInt(J) << BigInt(32));
   }), f.prototype.readBigUInt64BE = ae(function(h) {
     h = h >>> 0, yt(h, "offset");
     const w = this[h], F = this[h + 7];
-    (w === void 0 || F === void 0) && Pt(h, this.length - 8);
+    (w === void 0 || F === void 0) && kt(h, this.length - 8);
     const U = w * 2 ** 24 + this[++h] * 2 ** 16 + this[++h] * 2 ** 8 + this[++h], J = this[++h] * 2 ** 24 + this[++h] * 2 ** 16 + this[++h] * 2 ** 8 + F;
     return (BigInt(U) << BigInt(32)) + BigInt(J);
   }), f.prototype.readIntLE = function(h, w, F) {
@@ -672,13 +672,13 @@ Nu.write = function(n, t, e, r, i, o) {
   }, f.prototype.readBigInt64LE = ae(function(h) {
     h = h >>> 0, yt(h, "offset");
     const w = this[h], F = this[h + 7];
-    (w === void 0 || F === void 0) && Pt(h, this.length - 8);
+    (w === void 0 || F === void 0) && kt(h, this.length - 8);
     const U = this[h + 4] + this[h + 5] * 2 ** 8 + this[h + 6] * 2 ** 16 + (F << 24);
     return (BigInt(U) << BigInt(32)) + BigInt(w + this[++h] * 2 ** 8 + this[++h] * 2 ** 16 + this[++h] * 2 ** 24);
   }), f.prototype.readBigInt64BE = ae(function(h) {
     h = h >>> 0, yt(h, "offset");
     const w = this[h], F = this[h + 7];
-    (w === void 0 || F === void 0) && Pt(h, this.length - 8);
+    (w === void 0 || F === void 0) && kt(h, this.length - 8);
     const U = (w << 24) + // Overflow
     this[++h] * 2 ** 16 + this[++h] * 2 ** 8 + this[++h];
     return (BigInt(U) << BigInt(32)) + BigInt(this[++h] * 2 ** 24 + this[++h] * 2 ** 16 + this[++h] * 2 ** 8 + F);
@@ -698,8 +698,8 @@ Nu.write = function(n, t, e, r, i, o) {
   }
   f.prototype.writeUintLE = f.prototype.writeUIntLE = function(h, w, F, U) {
     if (h = +h, w = w >>> 0, F = F >>> 0, !U) {
-      const kt = Math.pow(2, 8 * F) - 1;
-      dt(this, h, w, F, kt, 0);
+      const Pt = Math.pow(2, 8 * F) - 1;
+      dt(this, h, w, F, Pt, 0);
     }
     let J = 1, st = 0;
     for (this[w] = h & 255; ++st < F && (J *= 256); )
@@ -707,8 +707,8 @@ Nu.write = function(n, t, e, r, i, o) {
     return w + F;
   }, f.prototype.writeUintBE = f.prototype.writeUIntBE = function(h, w, F, U) {
     if (h = +h, w = w >>> 0, F = F >>> 0, !U) {
-      const kt = Math.pow(2, 8 * F) - 1;
-      dt(this, h, w, F, kt, 0);
+      const Pt = Math.pow(2, 8 * F) - 1;
+      dt(this, h, w, F, Pt, 0);
     }
     let J = F - 1, st = 1;
     for (this[w + J] = h & 255; --J >= 0 && (st *= 256); )
@@ -748,18 +748,18 @@ Nu.write = function(n, t, e, r, i, o) {
       const Vt = Math.pow(2, 8 * F - 1);
       dt(this, h, w, F, Vt - 1, -Vt);
     }
-    let J = 0, st = 1, kt = 0;
+    let J = 0, st = 1, Pt = 0;
     for (this[w] = h & 255; ++J < F && (st *= 256); )
-      h < 0 && kt === 0 && this[w + J - 1] !== 0 && (kt = 1), this[w + J] = (h / st >> 0) - kt & 255;
+      h < 0 && Pt === 0 && this[w + J - 1] !== 0 && (Pt = 1), this[w + J] = (h / st >> 0) - Pt & 255;
     return w + F;
   }, f.prototype.writeIntBE = function(h, w, F, U) {
     if (h = +h, w = w >>> 0, !U) {
       const Vt = Math.pow(2, 8 * F - 1);
       dt(this, h, w, F, Vt - 1, -Vt);
     }
-    let J = F - 1, st = 1, kt = 0;
+    let J = F - 1, st = 1, Pt = 0;
     for (this[w + J] = h & 255; --J >= 0 && (st *= 256); )
-      h < 0 && kt === 0 && this[w + J + 1] !== 0 && (kt = 1), this[w + J] = (h / st >> 0) - kt & 255;
+      h < 0 && Pt === 0 && this[w + J + 1] !== 0 && (Pt = 1), this[w + J] = (h / st >> 0) - Pt & 255;
     return w + F;
   }, f.prototype.writeInt8 = function(h, w, F) {
     return h = +h, w = w >>> 0, F || dt(this, h, w, 1, 127, -128), h < 0 && (h = 255 + h + 1), this[w] = h & 255, w + 1;
@@ -830,11 +830,11 @@ Nu.write = function(n, t, e, r, i, o) {
       for (J = w; J < F; ++J)
         this[J] = h;
     else {
-      const st = f.isBuffer(h) ? h : f.from(h, U), kt = st.length;
-      if (kt === 0)
+      const st = f.isBuffer(h) ? h : f.from(h, U), Pt = st.length;
+      if (Pt === 0)
         throw new TypeError('The value "' + h + '" is invalid for argument "value"');
       for (J = 0; J < F - w; ++J)
-        this[J + w] = st[J % kt];
+        this[J + w] = st[J % Pt];
     }
     return this;
   };
@@ -892,13 +892,13 @@ Nu.write = function(n, t, e, r, i, o) {
     return `${b.slice(0, w)}${h}`;
   }
   function lt(b, h, w) {
-    yt(h, "offset"), (b[h] === void 0 || b[h + w] === void 0) && Pt(h, b.length - (w + 1));
+    yt(h, "offset"), (b[h] === void 0 || b[h + w] === void 0) && kt(h, b.length - (w + 1));
   }
   function St(b, h, w, F, U, J) {
     if (b > w || b < h) {
       const st = typeof h == "bigint" ? "n" : "";
-      let kt;
-      throw h === 0 || h === BigInt(0) ? kt = `>= 0${st} and < 2${st} ** ${(J + 1) * 8}${st}` : kt = `>= -(2${st} ** ${(J + 1) * 8 - 1}${st}) and < 2 ** ${(J + 1) * 8 - 1}${st}`, new v.ERR_OUT_OF_RANGE("value", kt, b);
+      let Pt;
+      throw h === 0 || h === BigInt(0) ? Pt = `>= 0${st} and < 2${st} ** ${(J + 1) * 8}${st}` : Pt = `>= -(2${st} ** ${(J + 1) * 8 - 1}${st}) and < 2 ** ${(J + 1) * 8 - 1}${st}`, new v.ERR_OUT_OF_RANGE("value", Pt, b);
     }
     lt(F, U, J);
   }
@@ -906,7 +906,7 @@ Nu.write = function(n, t, e, r, i, o) {
     if (typeof b != "number")
       throw new v.ERR_INVALID_ARG_TYPE(h, "number", b);
   }
-  function Pt(b, h, w) {
+  function kt(b, h, w) {
     throw Math.floor(b) !== b ? (yt(b, w), new v.ERR_OUT_OF_RANGE("offset", "an integer", b)) : h < 0 ? new v.ERR_BUFFER_OUT_OF_BOUNDS() : new v.ERR_OUT_OF_RANGE(
       "offset",
       `>= 0 and <= ${h}`,
@@ -2833,7 +2833,7 @@ function Bw(n, t = !1) {
   }
   return [e, r];
 }
-const S0 = (n, t) => BigInt(n >>> 0) << pu | BigInt(t >>> 0), P0 = (n, t, e) => n >>> e, k0 = (n, t, e) => n << 32 - e | t >>> e, F0 = (n, t, e) => n >>> e | t << 32 - e, I0 = (n, t, e) => n << 32 - e | t >>> e, O0 = (n, t, e) => n << 64 - e | t >>> e - 32, T0 = (n, t, e) => n >>> e - 32 | t << 64 - e, C0 = (n, t) => t, N0 = (n, t) => n, Sw = (n, t, e) => n << e | t >>> 32 - e, Pw = (n, t, e) => t << e | n >>> 32 - e, kw = (n, t, e) => t << e - 32 | n >>> 64 - e, Fw = (n, t, e) => n << e - 32 | t >>> 64 - e;
+const S0 = (n, t) => BigInt(n >>> 0) << pu | BigInt(t >>> 0), k0 = (n, t, e) => n >>> e, P0 = (n, t, e) => n << 32 - e | t >>> e, F0 = (n, t, e) => n >>> e | t << 32 - e, I0 = (n, t, e) => n << 32 - e | t >>> e, O0 = (n, t, e) => n << 64 - e | t >>> e - 32, T0 = (n, t, e) => n >>> e - 32 | t << 64 - e, C0 = (n, t) => t, N0 = (n, t) => n, Sw = (n, t, e) => n << e | t >>> 32 - e, kw = (n, t, e) => t << e | n >>> 32 - e, Pw = (n, t, e) => t << e - 32 | n >>> 64 - e, Fw = (n, t, e) => n << e - 32 | t >>> 64 - e;
 function L0(n, t, e, r) {
   const i = (t >>> 0) + (r >>> 0);
   return { h: n + e + (i / 2 ** 32 | 0) | 0, l: i | 0 };
@@ -2842,8 +2842,8 @@ const D0 = (n, t, e) => (n >>> 0) + (t >>> 0) + (e >>> 0), U0 = (n, t, e, r) =>
   fromBig: zw,
   split: Bw,
   toBig: S0,
-  shrSH: P0,
-  shrSL: k0,
+  shrSH: k0,
+  shrSL: P0,
   rotrSH: F0,
   rotrSL: I0,
   rotrBH: O0,
@@ -2851,8 +2851,8 @@ const D0 = (n, t, e) => (n >>> 0) + (t >>> 0) + (e >>> 0), U0 = (n, t, e, r) =>
   rotr32H: C0,
   rotr32L: N0,
   rotlSH: Sw,
-  rotlSL: Pw,
-  rotlBH: kw,
+  rotlSL: kw,
+  rotlBH: Pw,
   rotlBL: Fw,
   add: L0,
   add3L: D0,
@@ -2957,15 +2957,15 @@ class Q0 extends xw {
     this.Ah = t | 0, this.Al = e | 0, this.Bh = r | 0, this.Bl = i | 0, this.Ch = o | 0, this.Cl = a | 0, this.Dh = u | 0, this.Dl = _ | 0, this.Eh = l | 0, this.El = f | 0, this.Fh = g | 0, this.Fl = y | 0, this.Gh = B | 0, this.Gl = I | 0, this.Hh = S | 0, this.Hl = T | 0;
   }
   process(t, e) {
-    for (let P = 0; P < 16; P++, e += 4)
-      ii[P] = t.getUint32(e), si[P] = t.getUint32(e += 4);
-    for (let P = 16; P < 80; P++) {
-      const z = ii[P - 15] | 0, k = si[P - 15] | 0, C = It.rotrSH(z, k, 1) ^ It.rotrSH(z, k, 8) ^ It.shrSH(z, k, 7), N = It.rotrSL(z, k, 1) ^ It.rotrSL(z, k, 8) ^ It.shrSL(z, k, 7), D = ii[P - 2] | 0, Y = si[P - 2] | 0, Z = It.rotrSH(D, Y, 19) ^ It.rotrBH(D, Y, 61) ^ It.shrSH(D, Y, 6), ft = It.rotrSL(D, Y, 19) ^ It.rotrBL(D, Y, 61) ^ It.shrSL(D, Y, 6), L = It.add4L(N, ft, si[P - 7], si[P - 16]), At = It.add4H(L, C, Z, ii[P - 7], ii[P - 16]);
-      ii[P] = At | 0, si[P] = L | 0;
+    for (let k = 0; k < 16; k++, e += 4)
+      ii[k] = t.getUint32(e), si[k] = t.getUint32(e += 4);
+    for (let k = 16; k < 80; k++) {
+      const z = ii[k - 15] | 0, P = si[k - 15] | 0, C = It.rotrSH(z, P, 1) ^ It.rotrSH(z, P, 8) ^ It.shrSH(z, P, 7), N = It.rotrSL(z, P, 1) ^ It.rotrSL(z, P, 8) ^ It.shrSL(z, P, 7), D = ii[k - 2] | 0, Y = si[k - 2] | 0, Z = It.rotrSH(D, Y, 19) ^ It.rotrBH(D, Y, 61) ^ It.shrSH(D, Y, 6), ft = It.rotrSL(D, Y, 19) ^ It.rotrBL(D, Y, 61) ^ It.shrSL(D, Y, 6), L = It.add4L(N, ft, si[k - 7], si[k - 16]), At = It.add4H(L, C, Z, ii[k - 7], ii[k - 16]);
+      ii[k] = At | 0, si[k] = L | 0;
     }
     let { Ah: r, Al: i, Bh: o, Bl: a, Ch: u, Cl: _, Dh: l, Dl: f, Eh: g, El: y, Fh: B, Fl: I, Gh: S, Gl: T, Hh: A, Hl: R } = this;
-    for (let P = 0; P < 80; P++) {
-      const z = It.rotrSH(g, y, 14) ^ It.rotrSH(g, y, 18) ^ It.rotrBH(g, y, 41), k = It.rotrSL(g, y, 14) ^ It.rotrSL(g, y, 18) ^ It.rotrBL(g, y, 41), C = g & B ^ ~g & S, N = y & I ^ ~y & T, D = It.add5L(R, k, N, q0[P], si[P]), Y = It.add5H(D, A, z, C, V0[P], ii[P]), Z = D | 0, ft = It.rotrSH(r, i, 28) ^ It.rotrBH(r, i, 34) ^ It.rotrBH(r, i, 39), L = It.rotrSL(r, i, 28) ^ It.rotrBL(r, i, 34) ^ It.rotrBL(r, i, 39), At = r & o ^ r & u ^ o & u, Rt = i & a ^ i & _ ^ a & _;
+    for (let k = 0; k < 80; k++) {
+      const z = It.rotrSH(g, y, 14) ^ It.rotrSH(g, y, 18) ^ It.rotrBH(g, y, 41), P = It.rotrSL(g, y, 14) ^ It.rotrSL(g, y, 18) ^ It.rotrBL(g, y, 41), C = g & B ^ ~g & S, N = y & I ^ ~y & T, D = It.add5L(R, P, N, q0[k], si[k]), Y = It.add5H(D, A, z, C, V0[k], ii[k]), Z = D | 0, ft = It.rotrSH(r, i, 28) ^ It.rotrBH(r, i, 34) ^ It.rotrBH(r, i, 39), L = It.rotrSL(r, i, 28) ^ It.rotrBL(r, i, 34) ^ It.rotrBL(r, i, 39), At = r & o ^ r & u ^ o & u, Rt = i & a ^ i & _ ^ a & _;
       A = S | 0, R = T | 0, S = B | 0, T = I | 0, B = g | 0, I = y | 0, { h: g, l: y } = It.add(l | 0, f | 0, Y | 0, Z | 0), l = u | 0, f = _ | 0, u = o | 0, _ = a | 0, o = r | 0, a = i | 0;
       const at = It.add3L(Z, L, Rt);
       r = It.add3H(at, Y, ft, At), i = at | 0;
@@ -2989,8 +2989,8 @@ function W0() {
     return ns;
   throw new Error("unable to locate global object");
 }
-const P_ = W0();
-P_.crypto || P_.msCrypto;
+const k_ = W0();
+k_.crypto || k_.msCrypto;
 function J0(n) {
   switch (n) {
     case "sha256":
@@ -3008,20 +3008,20 @@ for (let n = 0, t = vs, e = 1, r = 0; n < 24; n++) {
     t = (t << vs ^ (t >> Z0) * ty) % X0, t & Y0 && (i ^= vs << (vs << /* @__PURE__ */ BigInt(o)) - vs);
   Tw.push(i);
 }
-const [ey, ry] = /* @__PURE__ */ Bw(Tw, !0), k_ = (n, t, e) => e > 32 ? kw(n, t, e) : Sw(n, t, e), F_ = (n, t, e) => e > 32 ? Fw(n, t, e) : Pw(n, t, e);
+const [ey, ry] = /* @__PURE__ */ Bw(Tw, !0), P_ = (n, t, e) => e > 32 ? Pw(n, t, e) : Sw(n, t, e), F_ = (n, t, e) => e > 32 ? Fw(n, t, e) : kw(n, t, e);
 function ny(n, t = 24) {
   const e = new Uint32Array(10);
   for (let r = 24 - t; r < 24; r++) {
     for (let a = 0; a < 10; a++)
       e[a] = n[a] ^ n[a + 10] ^ n[a + 20] ^ n[a + 30] ^ n[a + 40];
     for (let a = 0; a < 10; a += 2) {
-      const u = (a + 8) % 10, _ = (a + 2) % 10, l = e[_], f = e[_ + 1], g = k_(l, f, 1) ^ e[u], y = F_(l, f, 1) ^ e[u + 1];
+      const u = (a + 8) % 10, _ = (a + 2) % 10, l = e[_], f = e[_ + 1], g = P_(l, f, 1) ^ e[u], y = F_(l, f, 1) ^ e[u + 1];
       for (let B = 0; B < 50; B += 10)
         n[a + B] ^= g, n[a + B + 1] ^= y;
     }
     let i = n[2], o = n[3];
     for (let a = 0; a < 24; a++) {
-      const u = Ow[a], _ = k_(i, o, u), l = F_(i, o, u), f = Iw[a];
+      const u = Ow[a], _ = P_(i, o, u), l = F_(i, o, u), f = Iw[a];
       i = n[f], o = n[f + 1], n[f] = _, n[f + 1] = l;
     }
     for (let a = 0; a < 50; a += 10) {
@@ -3171,7 +3171,7 @@ function os(n) {
   }
   return e;
 }
-function Pi(n) {
+function ki(n) {
   return qu(ss(n));
 }
 function Qu(n) {
@@ -3302,7 +3302,7 @@ const wy = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   bitMask: Wu,
   bitSet: hy,
   bytesToHex: ss,
-  bytesToNumberBE: Pi,
+  bytesToNumberBE: ki,
   bytesToNumberLE: Qu,
   concatBytes: Ns,
   createHmacDrbg: Hw,
@@ -3499,7 +3499,7 @@ function xy(n, t, e = !1, r = {}) {
     fromBytes: (_) => {
       if (_.length !== o)
         throw new Error(`Fp.fromBytes: expected ${o}, got ${_.length}`);
-      return e ? Qu(_) : Pi(_);
+      return e ? Qu(_) : ki(_);
     }
   });
   return Object.freeze(u);
@@ -3518,11 +3518,11 @@ function Ry(n, t, e = !1) {
   const r = n.length, i = qw(t), o = Qw(t);
   if (r < 16 || r < o || r > 1024)
     throw new Error(`expected ${o}-1024 bytes of input, got ${r}`);
-  const a = e ? Pi(n) : Qu(n), u = Fe(a, t - ue) + ue;
+  const a = e ? ki(n) : Qu(n), u = Fe(a, t - ue) + ue;
   return e ? Ku(u, i) : as(u, i);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const zy = BigInt(0), Pa = BigInt(1);
+const zy = BigInt(0), ka = BigInt(1);
 function By(n, t) {
   const e = (i, o) => {
     const a = o.negate();
@@ -3537,7 +3537,7 @@ function By(n, t) {
     unsafeLadder(i, o) {
       let a = n.ZERO, u = i;
       for (; o > zy; )
-        o & Pa && (a = a.add(u)), u = u.double(), o >>= Pa;
+        o & ka && (a = a.add(u)), u = u.double(), o >>= ka;
       return a;
     },
     /**
@@ -3575,9 +3575,9 @@ function By(n, t) {
       for (let I = 0; I < u; I++) {
         const S = I * _;
         let T = Number(a & g);
-        a >>= B, T > _ && (T -= y, a += Pa);
-        const A = S, R = S + Math.abs(T) - 1, P = I % 2 !== 0, z = T < 0;
-        T === 0 ? f = f.add(e(P, o[A])) : l = l.add(e(z, o[R]));
+        a >>= B, T > _ && (T -= y, a += ka);
+        const A = S, R = S + Math.abs(T) - 1, k = I % 2 !== 0, z = T < 0;
+        T === 0 ? f = f.add(e(k, o[A])) : l = l.add(e(z, o[R]));
       }
       return { p: l, f };
     },
@@ -3627,7 +3627,7 @@ function Sy(n) {
   }
   return Object.freeze({ ...t });
 }
-const { bytesToNumberBE: Py, hexToBytes: ky } = wy, xi = {
+const { bytesToNumberBE: ky, hexToBytes: Py } = wy, xi = {
   // asn.1 DER encoding utils
   Err: class extends Error {
     constructor(t = "") {
@@ -3645,10 +3645,10 @@ const { bytesToNumberBE: Py, hexToBytes: ky } = wy, xi = {
       throw new t("Invalid signature integer: negative");
     if (r[0] === 0 && !(r[1] & 128))
       throw new t("Invalid signature integer: unnecessary leading zero");
-    return { d: Py(r), l: n.subarray(e + 2) };
+    return { d: ky(r), l: n.subarray(e + 2) };
   },
   toSig(n) {
-    const { Err: t } = xi, e = typeof n == "string" ? ky(n) : n;
+    const { Err: t } = xi, e = typeof n == "string" ? Py(n) : n;
     if (!(e instanceof Uint8Array))
       throw new Error("ui8a expected");
     let r = e.length;
@@ -3700,13 +3700,13 @@ function Fy(n) {
         throw new Error("Invalid key");
       I = I.padStart(T * 2, "0");
     }
-    let P;
+    let k;
     try {
-      P = typeof I == "bigint" ? I : Pi(qe("private key", I, T));
+      k = typeof I == "bigint" ? I : ki(qe("private key", I, T));
     } catch {
       throw new Error(`private key must be ${T} bytes, hex or bigint, not ${typeof I}`);
     }
-    return A && (P = Fe(P, R)), u(P), P;
+    return A && (k = Fe(k, R)), u(k), k;
   }
   const l = /* @__PURE__ */ new Map();
   function f(I) {
@@ -3730,7 +3730,7 @@ function Fy(n) {
         throw new Error("invalid affine point");
       if (S instanceof g)
         throw new Error("projective point not allowed");
-      const R = (P) => e.eql(P, e.ZERO);
+      const R = (k) => e.eql(k, e.ZERO);
       return R(T) && R(A) ? g.ZERO : new g(T, A, e.ONE);
     }
     get x() {
@@ -3792,7 +3792,7 @@ function Fy(n) {
      */
     equals(S) {
       f(S);
-      const { px: T, py: A, pz: R } = this, { px: P, py: z, pz: k } = S, C = e.eql(e.mul(T, k), e.mul(P, R)), N = e.eql(e.mul(A, k), e.mul(z, R));
+      const { px: T, py: A, pz: R } = this, { px: k, py: z, pz: P } = S, C = e.eql(e.mul(T, P), e.mul(k, R)), N = e.eql(e.mul(A, P), e.mul(z, R));
       return C && N;
     }
     /**
@@ -3806,9 +3806,9 @@ function Fy(n) {
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: S, b: T } = t, A = e.mul(T, C_), { px: R, py: P, pz: z } = this;
-      let k = e.ZERO, C = e.ZERO, N = e.ZERO, D = e.mul(R, R), Y = e.mul(P, P), Z = e.mul(z, z), ft = e.mul(R, P);
-      return ft = e.add(ft, ft), N = e.mul(R, z), N = e.add(N, N), k = e.mul(S, N), C = e.mul(A, Z), C = e.add(k, C), k = e.sub(Y, C), C = e.add(Y, C), C = e.mul(k, C), k = e.mul(ft, k), N = e.mul(A, N), Z = e.mul(S, Z), ft = e.sub(D, Z), ft = e.mul(S, ft), ft = e.add(ft, N), N = e.add(D, D), D = e.add(N, D), D = e.add(D, Z), D = e.mul(D, ft), C = e.add(C, D), Z = e.mul(P, z), Z = e.add(Z, Z), D = e.mul(Z, ft), k = e.sub(k, D), N = e.mul(Z, Y), N = e.add(N, N), N = e.add(N, N), new g(k, C, N);
+      const { a: S, b: T } = t, A = e.mul(T, C_), { px: R, py: k, pz: z } = this;
+      let P = e.ZERO, C = e.ZERO, N = e.ZERO, D = e.mul(R, R), Y = e.mul(k, k), Z = e.mul(z, z), ft = e.mul(R, k);
+      return ft = e.add(ft, ft), N = e.mul(R, z), N = e.add(N, N), P = e.mul(S, N), C = e.mul(A, Z), C = e.add(P, C), P = e.sub(Y, C), C = e.add(Y, C), C = e.mul(P, C), P = e.mul(ft, P), N = e.mul(A, N), Z = e.mul(S, Z), ft = e.sub(D, Z), ft = e.mul(S, ft), ft = e.add(ft, N), N = e.add(D, D), D = e.add(N, D), D = e.add(D, Z), D = e.mul(D, ft), C = e.add(C, D), Z = e.mul(k, z), Z = e.add(Z, Z), D = e.mul(Z, ft), P = e.sub(P, D), N = e.mul(Z, Y), N = e.add(N, N), N = e.add(N, N), new g(P, C, N);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -3816,13 +3816,13 @@ function Fy(n) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(S) {
       f(S);
-      const { px: T, py: A, pz: R } = this, { px: P, py: z, pz: k } = S;
+      const { px: T, py: A, pz: R } = this, { px: k, py: z, pz: P } = S;
       let C = e.ZERO, N = e.ZERO, D = e.ZERO;
       const Y = t.a, Z = e.mul(t.b, C_);
-      let ft = e.mul(T, P), L = e.mul(A, z), At = e.mul(R, k), Rt = e.add(T, A), at = e.add(P, z);
+      let ft = e.mul(T, k), L = e.mul(A, z), At = e.mul(R, P), Rt = e.add(T, A), at = e.add(k, z);
       Rt = e.mul(Rt, at), at = e.add(ft, L), Rt = e.sub(Rt, at), at = e.add(T, R);
-      let wt = e.add(P, k);
-      return at = e.mul(at, wt), wt = e.add(ft, At), at = e.sub(at, wt), wt = e.add(A, R), C = e.add(z, k), wt = e.mul(wt, C), C = e.add(L, At), wt = e.sub(wt, C), D = e.mul(Y, at), C = e.mul(Z, At), D = e.add(C, D), C = e.sub(L, D), D = e.add(L, D), N = e.mul(C, D), L = e.add(ft, ft), L = e.add(L, ft), At = e.mul(Y, At), at = e.mul(Z, at), L = e.add(L, At), At = e.sub(ft, At), At = e.mul(Y, At), at = e.add(at, At), ft = e.mul(L, at), N = e.add(N, ft), ft = e.mul(wt, at), C = e.mul(Rt, C), C = e.sub(C, ft), ft = e.mul(Rt, L), D = e.mul(wt, D), D = e.add(D, ft), new g(C, N, D);
+      let wt = e.add(k, P);
+      return at = e.mul(at, wt), wt = e.add(ft, At), at = e.sub(at, wt), wt = e.add(A, R), C = e.add(z, P), wt = e.mul(wt, C), C = e.add(L, At), wt = e.sub(wt, C), D = e.mul(Y, at), C = e.mul(Z, At), D = e.add(C, D), C = e.sub(L, D), D = e.add(L, D), N = e.mul(C, D), L = e.add(ft, ft), L = e.add(L, ft), At = e.mul(Y, At), at = e.mul(Z, at), L = e.add(L, At), At = e.sub(ft, At), At = e.mul(Y, At), at = e.add(at, At), ft = e.mul(L, at), N = e.add(N, ft), ft = e.mul(wt, at), C = e.mul(Rt, C), C = e.sub(C, ft), ft = e.mul(Rt, L), D = e.mul(wt, D), D = e.add(D, ft), new g(C, N, D);
     }
     subtract(S) {
       return this.add(S.negate());
@@ -3833,7 +3833,7 @@ function Fy(n) {
     wNAF(S) {
       return B.wNAFCached(this, l, S, (T) => {
         const A = e.invertBatch(T.map((R) => R.pz));
-        return T.map((R, P) => R.toAffine(A[P])).map(g.fromAffine);
+        return T.map((R, k) => R.toAffine(A[k])).map(g.fromAffine);
       });
     }
     /**
@@ -3850,9 +3850,9 @@ function Fy(n) {
       const { endo: A } = t;
       if (!A)
         return B.unsafeLadder(this, S);
-      let { k1neg: R, k1: P, k2neg: z, k2: k } = A.splitScalar(S), C = T, N = T, D = this;
-      for (; P > Vn || k > Vn; )
-        P & je && (C = C.add(D)), k & je && (N = N.add(D)), D = D.double(), P >>= je, k >>= je;
+      let { k1neg: R, k1: k, k2neg: z, k2: P } = A.splitScalar(S), C = T, N = T, D = this;
+      for (; k > Vn || P > Vn; )
+        k & je && (C = C.add(D)), P & je && (N = N.add(D)), D = D.double(), k >>= je, P >>= je;
       return R && (C = C.negate()), z && (N = N.negate()), N = new g(e.mul(N.px, A.beta), N.py, N.pz), C.add(N);
     }
     /**
@@ -3867,14 +3867,14 @@ function Fy(n) {
     multiply(S) {
       u(S);
       let T = S, A, R;
-      const { endo: P } = t;
-      if (P) {
-        const { k1neg: z, k1: k, k2neg: C, k2: N } = P.splitScalar(T);
-        let { p: D, f: Y } = this.wNAF(k), { p: Z, f: ft } = this.wNAF(N);
-        D = B.constTimeNegate(z, D), Z = B.constTimeNegate(C, Z), Z = new g(e.mul(Z.px, P.beta), Z.py, Z.pz), A = D.add(Z), R = Y.add(ft);
+      const { endo: k } = t;
+      if (k) {
+        const { k1neg: z, k1: P, k2neg: C, k2: N } = k.splitScalar(T);
+        let { p: D, f: Y } = this.wNAF(P), { p: Z, f: ft } = this.wNAF(N);
+        D = B.constTimeNegate(z, D), Z = B.constTimeNegate(C, Z), Z = new g(e.mul(Z.px, k.beta), Z.py, Z.pz), A = D.add(Z), R = Y.add(ft);
       } else {
-        const { p: z, f: k } = this.wNAF(T);
-        A = z, R = k;
+        const { p: z, f: P } = this.wNAF(T);
+        A = z, R = P;
       }
       return g.normalizeZ([A, R])[0];
     }
@@ -3885,21 +3885,21 @@ function Fy(n) {
      * @returns non-zero affine point
      */
     multiplyAndAddUnsafe(S, T, A) {
-      const R = g.BASE, P = (k, C) => C === Vn || C === je || !k.equals(R) ? k.multiplyUnsafe(C) : k.multiply(C), z = P(this, T).add(P(S, A));
+      const R = g.BASE, k = (P, C) => C === Vn || C === je || !P.equals(R) ? P.multiplyUnsafe(C) : P.multiply(C), z = k(this, T).add(k(S, A));
       return z.is0() ? void 0 : z;
     }
     // Converts Projective point to affine (x, y) coordinates.
     // Can accept precomputed Z^-1 - for example, from invertBatch.
     // (x, y, z) ∋ (x=x/z, y=y/z)
     toAffine(S) {
-      const { px: T, py: A, pz: R } = this, P = this.is0();
-      S == null && (S = P ? e.ONE : e.inv(R));
-      const z = e.mul(T, S), k = e.mul(A, S), C = e.mul(R, S);
-      if (P)
+      const { px: T, py: A, pz: R } = this, k = this.is0();
+      S == null && (S = k ? e.ONE : e.inv(R));
+      const z = e.mul(T, S), P = e.mul(A, S), C = e.mul(R, S);
+      if (k)
         return { x: e.ZERO, y: e.ZERO };
       if (!e.eql(C, e.ONE))
         throw new Error("invZ was invalid");
-      return { x: z, y: k };
+      return { x: z, y: P };
     }
     isTorsionFree() {
       const { h: S, isTorsionFree: T } = t;
@@ -3962,7 +3962,7 @@ function Oy(n) {
     fromBytes(at) {
       const wt = at.length, Et = at[0], xt = at.subarray(1);
       if (wt === i && (Et === 2 || Et === 3)) {
-        const vt = Pi(xt);
+        const vt = ki(xt);
         if (!a(vt))
           throw new Error("Point is not on curve");
         const Bt = g(vt);
@@ -3983,7 +3983,7 @@ function Oy(n) {
   function S(at) {
     return I(at) ? u(-at) : at;
   }
-  const T = (at, wt, Et) => Pi(at.slice(wt, Et));
+  const T = (at, wt, Et) => ki(at.slice(wt, Et));
   class A {
     constructor(wt, Et, xt) {
       this.r = wt, this.s = Et, this.recovery = xt, this.assertValidity();
@@ -4071,14 +4071,14 @@ function Oy(n) {
       return wt._setWindowSize(at), wt.multiply(BigInt(3)), wt;
     }
   };
-  function P(at, wt = !0) {
+  function k(at, wt = !0) {
     return l.fromPrivateKey(at).toRawBytes(wt);
   }
   function z(at) {
     const wt = at instanceof Uint8Array, Et = typeof at == "string", xt = (wt || Et) && at.length;
     return wt ? xt === i || xt === o : Et ? xt === 2 * i || xt === 2 * o : at instanceof l;
   }
-  function k(at, wt, Et = !0) {
+  function P(at, wt, Et = !0) {
     if (z(at))
       throw new Error("first arg must be private key");
     if (!z(wt))
@@ -4086,7 +4086,7 @@ function Oy(n) {
     return l.fromHex(wt).multiply(f(at)).toRawBytes(Et);
   }
   const C = t.bits2int || function(at) {
-    const wt = Pi(at), Et = at.length * 8 - t.nBitLength;
+    const wt = ki(at), Et = at.length * 8 - t.nBitLength;
     return Et > 0 ? wt >> BigInt(Et) : wt;
   }, N = t.bits2int_modN || function(at) {
     return u(C(at));
@@ -4165,8 +4165,8 @@ function Oy(n) {
   }
   return {
     CURVE: t,
-    getPublicKey: P,
-    getSharedSecret: k,
+    getPublicKey: k,
+    getSharedSecret: P,
     sign: At,
     verify: Rt,
     ProjectivePoint: l,
@@ -4189,7 +4189,7 @@ function Cy(n, t) {
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const Ww = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), N_ = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), Ny = BigInt(1), gu = BigInt(2), L_ = (n, t) => (n + t / gu) / t;
 function Ly(n) {
-  const t = Ww, e = BigInt(3), r = BigInt(6), i = BigInt(11), o = BigInt(22), a = BigInt(23), u = BigInt(44), _ = BigInt(88), l = n * n * n % t, f = l * l * n % t, g = De(f, e, t) * f % t, y = De(g, e, t) * f % t, B = De(y, gu, t) * l % t, I = De(B, i, t) * B % t, S = De(I, o, t) * I % t, T = De(S, u, t) * S % t, A = De(T, _, t) * T % t, R = De(A, u, t) * S % t, P = De(R, e, t) * f % t, z = De(P, a, t) * I % t, k = De(z, r, t) * l % t, C = De(k, gu, t);
+  const t = Ww, e = BigInt(3), r = BigInt(6), i = BigInt(11), o = BigInt(22), a = BigInt(23), u = BigInt(44), _ = BigInt(88), l = n * n * n % t, f = l * l * n % t, g = De(f, e, t) * f % t, y = De(g, e, t) * f % t, B = De(y, gu, t) * l % t, I = De(B, i, t) * B % t, S = De(I, o, t) * I % t, T = De(S, u, t) * S % t, A = De(T, _, t) * T % t, R = De(A, u, t) * S % t, k = De(R, e, t) * f % t, z = De(k, a, t) * I % t, P = De(z, r, t) * l % t, C = De(P, gu, t);
   if (!yu.eql(yu.sqr(C), n))
     throw new Error("Cannot find square root");
   return C;
@@ -4705,17 +4705,17 @@ function Ge(n) {
   }
   return !1;
 }
-async function ka(n, t) {
+async function Pa(n, t) {
   const e = await t;
   return (e == null || e === "0x0000000000000000000000000000000000000000") && (_t(typeof n != "string", "unconfigured name", "UNCONFIGURED_NAME", { value: n }), V(!1, "invalid AddressLike value; did not resolve to a value address", "target", n)), Ut(e);
 }
 function ze(n, t) {
   if (typeof n == "string")
-    return n.match(/^0x[0-9a-f]{40}$/i) ? Ut(n) : (_t(t != null, "ENS resolution requires a provider", "UNSUPPORTED_OPERATION", { operation: "resolveName" }), ka(n, t.resolveName(n)));
+    return n.match(/^0x[0-9a-f]{40}$/i) ? Ut(n) : (_t(t != null, "ENS resolution requires a provider", "UNSUPPORTED_OPERATION", { operation: "resolveName" }), Pa(n, t.resolveName(n)));
   if (Jw(n))
-    return ka(n, n.getAddress());
+    return Pa(n, n.getAddress());
   if (n && typeof n.then == "function")
-    return ka(n, n);
+    return Pa(n, n);
   V(!1, "unsupported addressable value", "target", n);
 }
 const lr = {};
@@ -6577,7 +6577,7 @@ function xb(n) {
     return n[t++] << 8 | n[t++];
   }
   let r = e(), i = 1, o = [0, 1];
-  for (let k = 1; k < r; k++)
+  for (let P = 1; P < r; P++)
     o.push(i += e());
   let a = e(), u = t;
   t += a;
@@ -6587,26 +6587,26 @@ function xb(n) {
   }
   const g = 31, y = 2 ** g, B = y >>> 1, I = B >> 1, S = y - 1;
   let T = 0;
-  for (let k = 0; k < g; k++) T = T << 1 | f();
-  let A = [], R = 0, P = y;
+  for (let P = 0; P < g; P++) T = T << 1 | f();
+  let A = [], R = 0, k = y;
   for (; ; ) {
-    let k = Math.floor(((T - R + 1) * i - 1) / P), C = 0, N = r;
+    let P = Math.floor(((T - R + 1) * i - 1) / k), C = 0, N = r;
     for (; N - C > 1; ) {
       let Z = C + N >>> 1;
-      k < o[Z] ? N = Z : C = Z;
+      P < o[Z] ? N = Z : C = Z;
     }
     if (C == 0) break;
     A.push(C);
-    let D = R + Math.floor(P * o[C] / i), Y = R + Math.floor(P * o[C + 1] / i) - 1;
+    let D = R + Math.floor(k * o[C] / i), Y = R + Math.floor(k * o[C + 1] / i) - 1;
     for (; ((D ^ Y) & B) == 0; )
       T = T << 1 & S | f(), D = D << 1 & S, Y = Y << 1 & S | 1;
     for (; D & ~Y & I; )
       T = T & B | T << 1 & S >>> 1 | f(), D = D << 1 ^ B, Y = (Y ^ B) << 1 | B | 1;
-    R = D, P = 1 + Y - D;
+    R = D, k = 1 + Y - D;
   }
   let z = r - 4;
-  return A.map((k) => {
-    switch (k - z) {
+  return A.map((P) => {
+    switch (P - z) {
       case 3:
         return z + 65792 + (n[u++] << 16 | n[u++] << 8 | n[u++]);
       case 2:
@@ -6614,7 +6614,7 @@ function xb(n) {
       case 1:
         return z + n[u++];
       default:
-        return k - 1;
+        return P - 1;
     }
   });
 }
@@ -6664,12 +6664,12 @@ function nd(n) {
   for (; ; ) {
     let e = n();
     if (e == 0) break;
-    t.push(Pb(e, n));
+    t.push(kb(e, n));
   }
   for (; ; ) {
     let e = n() - 1;
     if (e < 0) break;
-    t.push(kb(e, n));
+    t.push(Pb(e, n));
   }
   return t.flat();
 }
@@ -6688,7 +6688,7 @@ function id(n, t, e) {
     Sb(n, e).forEach((o, a) => r[a].push(o));
   return r;
 }
-function Pb(n, t) {
+function kb(n, t) {
   let e = 1 + t(), r = t(), i = Us(t);
   return id(i.length, 1 + n, t).flatMap((a, u) => {
     let [_, ...l] = a;
@@ -6698,7 +6698,7 @@ function Pb(n, t) {
     });
   });
 }
-function kb(n, t) {
+function Pb(n, t) {
   let e = 1 + t();
   return id(e, 1 + n, t).map((i) => [i[0], i.slice(1)]);
 }
@@ -6749,7 +6749,7 @@ function Tb(n, t) {
   return r;
 }
 var Cb = "AEUDTAHBCFQATQDRADAAcgAgADQAFAAsABQAHwAOACQADQARAAoAFwAHABIACAAPAAUACwAFAAwABAAQAAMABwAEAAoABQAIAAIACgABAAQAFAALAAIACwABAAIAAQAHAAMAAwAEAAsADAAMAAwACgANAA0AAwAKAAkABAAdAAYAZwDSAdsDJgC0CkMB8xhZAqfoC190UGcThgBurwf7PT09Pb09AjgJum8OjDllxHYUKXAPxzq6tABAxgK8ysUvWAgMPT09PT09PSs6LT2HcgWXWwFLoSMEEEl5RFVMKvO0XQ8ExDdJMnIgsj26PTQyy8FfEQ8AY8IPAGcEbwRwBHEEcgRzBHQEdQR2BHcEeAR6BHsEfAR+BIAEgfndBQoBYgULAWIFDAFiBNcE2ATZBRAFEQUvBdALFAsVDPcNBw13DYcOMA4xDjMB4BllHI0B2grbAMDpHLkQ7QHVAPRNQQFnGRUEg0yEB2uaJF8AJpIBpob5AERSMAKNoAXqaQLUBMCzEiACnwRZEkkVsS7tANAsBG0RuAQLEPABv9HICTUBXigPZwRBApMDOwAamhtaABqEAY8KvKx3LQ4ArAB8UhwEBAVSagD8AEFZADkBIadVj2UMUgx5Il4ANQC9AxIB1BlbEPMAs30CGxlXAhwZKQIECBc6EbsCoxngzv7UzRQA8M0BawL6ZwkN7wABAD33OQRcsgLJCjMCjqUChtw/km+NAsXPAoP2BT84PwURAK0RAvptb6cApQS/OMMey5HJS84UdxpxTPkCogVFITaTOwERAK5pAvkNBOVyA7q3BKlOJSALAgUIBRcEdASpBXqzABXFSWZOawLCOqw//AolCZdvv3dSBkEQGyelEPcMMwG1ATsN7UvYBPEGOwTJH30ZGQ/NlZwIpS3dDO0m4y6hgFoj9SqDBe1L9DzdC01RaA9ZC2UJ4zpjgU4DIQENIosK3Q05CG0Q8wrJaw3lEUUHOQPVSZoApQcBCxEdNRW1JhBirAsJOXcG+xr2C48mrxMpevwF0xohBk0BKRr/AM8u54WwWjFcHE9fBgMLJSPHFKhQIA0lQLd4SBobBxUlqQKRQ3BKh1E2HpMh9jw9DWYuE1F8B/U8BRlPC4E8nkarRQ4R0j6NPUgiSUwsBDV/LC8niwnPD4UMuXxyAVkJIQmxDHETMREXN8UIOQcZLZckJxUIIUaVYJoE958D8xPRAwsFPwlBBxMDtRwtEy4VKQUNgSTXAvM21S6zAo9WgAEXBcsPJR/fEFBH4A7pCJsCZQODJesALRUhABcimwhDYwBfj9hTBS7LCMdqbCN0A2cU52ERcweRDlcHpxwzFb8c4XDIXguGCCijrwlbAXUJmQFfBOMICTVbjKAgQWdTi1gYmyBhQT9d/AIxDGUVn0S9h3gCiw9rEhsBNQFzBzkNAQJ3Ee0RaxCVCOuGBDW1M/g6JQRPIYMgEQonA09szgsnJvkM+GkBoxJiAww0PXfuZ6tgtiQX/QcZMsVBYCHxC5JPzQycGsEYQlQuGeQHvwPzGvMn6kFXBf8DowMTOk0z7gS9C2kIiwk/AEkOoxcH1xhqCnGM0AExiwG3mQNXkYMCb48GNwcLAGcLhwV55QAdAqcIowAFAM8DVwA5Aq0HnQAZAIVBAT0DJy8BIeUCjwOTCDHLAZUvAfMpBBvDDBUA9zduSgLDsQKAamaiBd1YAo4CSTUBTSUEBU5HUQOvceEA2wBLBhPfRwEVq0rLGuNDAd9vKwDHAPsABTUHBUEBzQHzbQC3AV8LMQmis7UBTekpAIMAFWsB1wKJAN0ANQB/8QFTAE0FWfkF0wJPSQERMRgrV2EBuwMfATMBDQB5BsuNpckHHwRtB9MCEBsV4QLvLge1AQMi3xPNQsUCvd5VoWACZIECYkJbTa9bNyACofcCaJgCZgkCn4Q4GwsCZjsCZiYEbgR/A38TA36SOQY5dxc5gjojIwJsHQIyNjgKAm3HAm2u74ozZ0UrAWcA3gDhAEoFB5gMjQD+C8IADbUCdy8CdqI/AnlLQwJ4uh1c20WuRtcCfD8CesgCfQkCfPAFWQUgSABIfWMkAoFtAoAAAoAFAn+uSVhKWxUXSswC0QEC0MxLJwOITwOH5kTFkTIC8qFdAwMDrkvOTC0lA89NTE2vAos/AorYwRsHHUNnBbcCjjcCjlxAl4ECjtkCjlx4UbRTNQpS1FSFApP7ApMMAOkAHFUeVa9V0AYsGymVhjLheGZFOzkCl58C77JYIagAWSUClo8ClnycAKlZrFoJgU0AOwKWtQKWTlxEXNECmcsCmWRcyl0HGQKcmznCOp0CnBYCn5sCnriKAB0PMSoPAp3xAp6SALU9YTRh7wKe0wKgbgGpAp6fHwKeTqVjyGQnJSsCJ68CJn4CoPsCoEwCot0CocQCpi8Cpc4Cp/8AfQKn8mh8aLEAA0lqHGrRAqzjAqyuAq1nAq0CAlcdAlXcArHh1wMfTmyXArK9DQKy6Bds4G1jbUhfAyXNArZcOz9ukAMpRQK4XgK5RxUCuSp3cDZw4QK9GQK72nCWAzIRAr6IcgIDM3ECvhpzInNPAsPLAsMEc4J0SzVFdOADPKcDPJoDPb8CxXwCxkcCxhCJAshpUQLIRALJTwLJLgJknQLd0nh5YXiueSVL0AMYo2cCAmH0GfOVJHsLXpJeuxECz2sCz2wvS1PS8xOfAMatAs9zASnqA04SfksFAtwnAtuKAtJPA1JcA1NfAQEDVYyAiT8AyxbtYEWCHILTgs6DjQLaxwLZ3oQQhEmnPAOGpQAvA2QOhnFZ+QBVAt9lAt64c3cC4i/tFAHzMCcB9JsB8tKHAuvzAulweQLq+QLq5AD5RwG5Au6JAuuclqqXAwLuPwOF4Jh5cOBxoQLzAwBpA44WmZMC9xMDkW4DkocC95gC+dkC+GaaHJqruzebHgOdgwL++gEbADmfHJ+zAwWNA6ZqA6bZANHFAwZqoYiiBQkDDEkCwAA/AwDhQRdTARHzA2sHl2cFAJMtK7evvdsBiZkUfxEEOQH7KQUhDp0JnwCS/SlXxQL3AZ0AtwW5AG8LbUEuFCaNLgFDAYD8AbUmAHUDDgRtACwCFgyhAAAKAj0CagPdA34EkQEgRQUhfAoABQBEABMANhICdwEABdUDa+8KxQIA9wqfJ7+xt+UBkSFBQgHpFH8RNMCJAAQAGwBaAkUChIsABjpTOpSNbQC4Oo860ACNOME63AClAOgAywE6gTo7Ofw5+Tt2iTpbO56JOm85GAFWATMBbAUvNV01njWtNWY1dTW2NcU1gjWRNdI14TWeNa017jX9NbI1wTYCNhE1xjXVNhY2JzXeNe02LjY9Ni41LSE2OjY9Njw2yTcIBJA8VzY4Nt03IDcPNsogN4k3MAoEsDxnNiQ3GTdsOo03IULUQwdC4EMLHA8PCZsobShRVQYA6X8A6bABFCnXAukBowC9BbcAbwNzBL8MDAMMAQgDAAkKCwsLCQoGBAVVBI/DvwDz9b29kaUCb0QtsRTNLt4eGBcSHAMZFhYZEhYEARAEBUEcQRxBHEEcQRxBHEEaQRxBHEFCSTxBPElISUhBNkM2QTYbNklISVmBVIgBFLWZAu0BhQCjBcEAbykBvwGJAaQcEZ0ePCklMAAhMvAIMAL54gC7Bm8EescjzQMpARQpKgDUABavAj626xQAJP0A3etzuf4NNRA7efy2Z9NQrCnC0OSyANz5BBIbJ5IFDR6miIavYS6tprjjmuKebxm5C74Q225X1pkaYYPb6f1DK4k3xMEBb9S2WMjEibTNWhsRJIA+vwNVEiXTE5iXs/wezV66oFLfp9NZGYW+Gk19J2+bCT6Ye2w6LDYdgzKMUabk595eLBCXANz9HUpWbATq9vqXVx9XDg+Pc9Xp4+bsS005SVM/BJBM4687WUuf+Uj9dEi8aDNaPxtpbDxcG1THTImUMZq4UCaaNYpsVqraNyKLJXDYsFZ/5jl7bLRtO88t7P3xZaAxhb5OdPMXqsSkp1WCieG8jXm1U99+blvLlXzPCS+M93VnJCiK+09LfaSaBAVBomyDgJua8dfUzR7ga34IvR2Nvj+A9heJ6lsl1KG4NkI1032Cnff1m1wof2B9oHJK4bi6JkEdSqeNeiuo6QoZZincoc73/TH9SXF8sCE7XyuYyW8WSgbGFCjPV0ihLKhdPs08Tx82fYAkLLc4I2wdl4apY7GU5lHRFzRWJep7Ww3wbeA3qmd59/86P4xuNaqDpygXt6M85glSBHOCGgJDnt+pN9bK7HApMguX6+06RZNjzVmcZJ+wcUrJ9//bpRNxNuKpNl9uFds+S9tdx7LaM5ZkIrPj6nIU9mnbFtVbs9s/uLgl8MVczAwet+iOEzzBlYW7RCMgE6gyNLeq6+1tIx4dpgZnd0DksJS5f+JNDpwwcPNXaaVspq1fbQajOrJgK0ofKtJ1Ne90L6VO4MOl5S886p7u6xo7OLjG8TGL+HU1JXGJgppg4nNbNJ5nlzSpuPYy21JUEcUA94PoFiZfjZue+QnyQ80ekOuZVkxx4g+cvhJfHgNl4hy1/a6+RKcKlar/J29y//EztlbVPHVUeQ1zX86eQVAjR/M3dA9w4W8LfaXp4EgM85wOWasli837PzVMOnsLzR+k3o75/lRPAJSE1xAKQzEi5v10ke+VBvRt1cwQRMd+U5mLCTGVd6XiZtgBG5cDi0w22GKcVNvHiu5LQbZEDVtz0onn7k5+heuKXVsZtSzilkLRAUmjMXEMB3J9YC50XBxPiz53SC+EhnPl9WsKCv92SM/OFFIMJZYfl0WW8tIO3UxYcwdMAj7FSmgrsZ2aAZO03BOhP1bNNZItyXYQFTpC3SG1VuPDqH9GkiCDmE+JwxyIVSO5siDErAOpEXFgjy6PQtOVDj+s6e1r8heWVvmZnTciuf4EiNZzCAd7SOMhXERIOlsHIMG399i9aLTy3m2hRLZjJVDNLS53iGIK11dPqQt0zBDyg6qc7YqkDm2M5Ve6dCWCaCbTXX2rToaIgz6+zh4lYUi/+6nqcFMAkQJKHYLK0wYk5N9szV6xihDbDDFr45lN1K4aCXBq/FitPSud9gLt5ZVn+ZqGX7cwm2z5EGMgfFpIFyhGGuDPmso6TItTMwny+7uPnLCf4W6goFQFV0oQSsc9VfMmVLcLr6ZetDZbaSFTLqnSO/bIPjA3/zAUoqgGFAEQS4IhuMzEp2I3jJzbzkk/IEmyax+rhZTwd6f+CGtwPixu8IvzACquPWPREu9ZvGkUzpRwvRRuaNN6cr0W1wWits9ICdYJ7ltbgMiSL3sTPeufgNcVqMVWFkCPDH4jG2jA0XcVgQj62Cb29v9f/z/+2KbYvIv/zzjpQAPkliaVDzNrW57TZ/ZOyZD0nlfMmAIBIAGAI0D3k/mdN4xr9v85ZbZbbqfH2jGd5hUqNZWwl5SPfoGmfElmazUIeNL1j/mkF7VNAzTq4jNt8JoQ11NQOcmhprXoxSxfRGJ9LDEOAQ+dmxAQH90iti9e2u/MoeuaGcDTHoC+xsmEeWmxEKefQuIzHbpw5Tc5cEocboAD09oipWQhtTO1wivf/O+DRe2rpl/E9wlrzBorjJsOeG1B/XPW4EaJEFdNlECEZga5ZoGRHXgYouGRuVkm8tDESiEyFNo+3s5M5puSdTyUL2llnINVHEt91XUNW4ewdMgJ4boJfEyt/iY5WXqbA+A2Fkt5Z0lutiWhe9nZIyIUjyXDC3UsaG1t+eNx6z4W/OYoTB7A6x+dNSTOi9AInctbESqm5gvOLww7OWXPrmHwVZasrl4eD113pm+JtT7JVOvnCXqdzzdTRHgJ0PiGTFYW5Gvt9R9LD6Lzfs0v/TZZHSmyVNq7viIHE6DBK7Qp07Iz55EM8SYtQvZf/obBniTWi5C2/ovHfw4VndkE5XYdjOhCMRjDeOEfXeN/CwfGduiUIfsoFeUxXeQXba7c7972XNv8w+dTjjUM0QeNAReW+J014dKAD/McQYXT7c0GQPIkn3Ll6R7gGjuiQoZD0TEeEqQpKoZ15g/0OPQI17QiSv9AUROa/V/TQN3dvLArec3RrsYlvBm1b8LWzltdugsC50lNKYLEp2a+ZZYqPejULRlOJh5zj/LVMyTDvwKhMxxwuDkxJ1QpoNI0OTWLom4Z71SNzI9TV1iXJrIu9Wcnd+MCaAw8o1jSXd94YU/1gnkrC9BUEOtQvEIQ7g0i6h+KL2JKk8Ydl7HruvgWMSAmNe+LshGhV4qnWHhO9/RIPQzY1tHRj2VqOyNsDpK0cww+56AdDC4gsWwY0XxoucIWIqs/GcwnWqlaT0KPr8mbK5U94/301i1WLt4YINTVvCFBrFZbIbY8eycOdeJ2teD5IfPLCRg7jjcFTwlMFNl9zdh/o3E/hHPwj7BWg0MU09pPrBLbrCgm54A6H+I6v27+jL5gkjWg/iYdks9jbfVP5y/n0dlgWEMlKasl7JvFZd56LfybW1eeaVO0gxTfXZwD8G4SI116yx7UKVRgui6Ya1YpixqXeNLc8IxtAwCU5IhwQgn+NqHnRaDv61CxKhOq4pOX7M6pkA+Pmpd4j1vn6ACUALoLLc4vpXci8VidLxzm7qFBe7s+quuJs6ETYmnpgS3LwSZxPIltgBDXz8M1k/W2ySNv2f9/NPhxLGK2D21dkHeSGmenRT3Yqcdl0m/h3OYr8V+lXNYGf8aCCpd4bWjE4QIPj7vUKN4Nrfs7ML6Y2OyS830JCnofg/k7lpFpt4SqZc5HGg1HCOrHvOdC8bP6FGDbE/VV0mX4IakzbdS/op+Kt3G24/8QbBV7y86sGSQ/vZzU8FXs7u6jIvwchsEP2BpIhW3G8uWNwa3HmjfH/ZjhhCWvluAcF+nMf14ClKg5hGgtPLJ98ueNAkc5Hs2WZlk2QHvfreCK1CCGO6nMZVSb99VM/ajr8WHTte9JSmkXq/i/U943HEbdzW6Re/S88dKgg8pGOLlAeNiqrcLkUR3/aClFpMXcOUP3rmETcWSfMXZE3TUOi8i+fqRnTYLflVx/Vb/6GJ7eIRZUA6k3RYR3iFSK9c4iDdNwJuZL2FKz/IK5VimcNWEqdXjSoxSgmF0UPlDoUlNrPcM7ftmA8Y9gKiqKEHuWN+AZRIwtVSxye2Kf8rM3lhJ5XcBXU9n4v0Oy1RU2M+4qM8AQPVwse8ErNSob5oFPWxuqZnVzo1qB/IBxkM3EVUKFUUlO3e51259GgNcJbCmlvrdjtoTW7rChm1wyCKzpCTwozUUEOIcWLneRLgMXh+SjGSFkAllzbGS5HK7LlfCMRNRDSvbQPjcXaenNYxCvu2Qyznz6StuxVj66SgI0T8B6/sfHAJYZaZ78thjOSIFumNWLQbeZixDCCC+v0YBtkxiBB3jefHqZ/dFHU+crbj6OvS1x/JDD7vlm7zOVPwpUC01nhxZuY/63E7g";
-const Ms = 44032, So = 4352, Po = 4449, ko = 4519, od = 19, ad = 21, us = 28, Fo = ad * us, Nb = od * Fo, Lb = Ms + Nb, Db = So + od, Ub = Po + ad, Mb = ko + us;
+const Ms = 44032, So = 4352, ko = 4449, Po = 4519, od = 19, ad = 21, us = 28, Fo = ad * us, Nb = od * Fo, Lb = Ms + Nb, Db = So + od, Ub = ko + ad, Mb = Po + us;
 function Bs(n) {
   return n >> 24 & 255;
 }
@@ -6772,10 +6772,10 @@ function ud(n) {
   return n >= Ms && n < Lb;
 }
 function Gb(n, t) {
-  if (n >= So && n < Db && t >= Po && t < Ub)
-    return Ms + (n - So) * Fo + (t - Po) * us;
-  if (ud(n) && t > ko && t < Mb && (n - Ms) % us == 0)
-    return n + (t - ko);
+  if (n >= So && n < Db && t >= ko && t < Ub)
+    return Ms + (n - So) * Fo + (t - ko) * us;
+  if (ud(n) && t > Po && t < Mb && (n - Ms) % us == 0)
+    return n + (t - Po);
   {
     let e = yo.get(n);
     return e && (e = e.get(t), e) ? e : -1;
@@ -6794,7 +6794,7 @@ function _d(n) {
         t.push(o);
       else if (ud(o)) {
         let a = o - Ms, u = a / Fo | 0, _ = a % Fo / us | 0, l = a % us;
-        i(So + u), i(Po + _), l > 0 && i(ko + l);
+        i(So + u), i(ko + _), l > 0 && i(Po + l);
       } else {
         let a = mu.get(o);
         a ? e.push(...a) : i(o);
@@ -7239,7 +7239,7 @@ function uo(n) {
     }
   } : { base: n };
 }
-class ke {
+class Pe {
   /**
    *  The primary type for the structured [[types]].
    *
@@ -7394,19 +7394,19 @@ class ke {
    *  Create a new **TypedDataEncoder** for %%types%%.
    */
   static from(t) {
-    return new ke(t);
+    return new Pe(t);
   }
   /**
    *  Return the primary type for %%types%%.
    */
   static getPrimaryType(t) {
-    return ke.from(t).primaryType;
+    return Pe.from(t).primaryType;
   }
   /**
    *  Return the hashed struct for %%value%% using %%types%% and %%name%%.
    */
   static hashStruct(t, e, r) {
-    return ke.from(e).hashStruct(t, r);
+    return Pe.from(e).hashStruct(t, r);
   }
   /**
    *  Return the domain hash for %%domain%%.
@@ -7419,7 +7419,7 @@ class ke {
       const i = ef[r];
       V(i, `invalid typed-data domain key: ${JSON.stringify(r)}`, "domain", t), e.push({ name: r, type: i });
     }
-    return e.sort((r, i) => Ta.indexOf(r.name) - Ta.indexOf(i.name)), ke.hashStruct("EIP712Domain", { EIP712Domain: e }, t);
+    return e.sort((r, i) => Ta.indexOf(r.name) - Ta.indexOf(i.name)), Pe.hashStruct("EIP712Domain", { EIP712Domain: e }, t);
   }
   /**
    *  Return the fully encoded [[link-eip-712]] %%value%% for %%types%% with %%domain%%.
@@ -7427,15 +7427,15 @@ class ke {
   static encode(t, e, r) {
     return oe([
       "0x1901",
-      ke.hashDomain(t),
-      ke.from(e).hash(r)
+      Pe.hashDomain(t),
+      Pe.from(e).hash(r)
     ]);
   }
   /**
    *  Return the hash of the fully encoded [[link-eip-712]] %%value%% for %%types%% with %%domain%%.
    */
   static hash(t, e, r) {
-    return le(ke.encode(t, e, r));
+    return le(Pe.encode(t, e, r));
   }
   // Replaces all address types with ENS names with their looked up address
   /**
@@ -7448,7 +7448,7 @@ class ke {
       t[u] == null && delete t[u];
     const o = {};
     t.verifyingContract && !Xt(t.verifyingContract, 20) && (o[t.verifyingContract] = "0x");
-    const a = ke.from(e);
+    const a = Pe.from(e);
     a.visit(r, (u, _) => (u === "address" && !Xt(_, 20) && (o[_] = "0x"), _));
     for (const u in o)
       o[u] = await i(u);
@@ -7459,13 +7459,13 @@ class ke {
    *  the JSON-RPC [[link-eip-712]] method.
    */
   static getPayload(t, e, r) {
-    ke.hashDomain(t);
+    Pe.hashDomain(t);
     const i = {}, o = [];
     Ta.forEach((_) => {
       const l = t[_];
       l != null && (i[_] = l1[_](l), o.push({ name: _, type: ef[_] }));
     });
-    const a = ke.from(e);
+    const a = Pe.from(e);
     e = a.types;
     const u = Object.assign({}, e);
     return V(u.EIP712Domain == null, "types must not contain EIP712Domain type", "types.EIP712Domain", e), u.EIP712Domain = o, a.encode(r), {
@@ -7491,20 +7491,20 @@ class ke {
   }
 }
 function Rd(n, t, e, r) {
-  return td(ke.hash(n, t, e), r);
+  return td(Pe.hash(n, t, e), r);
 }
 function Be(n) {
   const t = /* @__PURE__ */ new Set();
   return n.forEach((e) => t.add(e)), Object.freeze(t);
 }
-const h1 = "external public payable override", p1 = Be(h1.split(" ")), zd = "constant external internal payable private public pure view override", w1 = Be(zd.split(" ")), Bd = "constructor error event fallback function receive struct", Sd = Be(Bd.split(" ")), Pd = "calldata memory storage payable indexed", d1 = Be(Pd.split(" ")), g1 = "tuple returns", y1 = [Bd, Pd, g1, zd].join(" "), b1 = Be(y1.split(" ")), m1 = {
+const h1 = "external public payable override", p1 = Be(h1.split(" ")), zd = "constant external internal payable private public pure view override", w1 = Be(zd.split(" ")), Bd = "constructor error event fallback function receive struct", Sd = Be(Bd.split(" ")), kd = "calldata memory storage payable indexed", d1 = Be(kd.split(" ")), g1 = "tuple returns", y1 = [Bd, kd, g1, zd].join(" "), b1 = Be(y1.split(" ")), m1 = {
   "(": "OPEN_PAREN",
   ")": "CLOSE_PAREN",
   "[": "OPEN_BRACKET",
   "]": "CLOSE_BRACKET",
   ",": "COMMA",
   "@": "AT"
-}, A1 = new RegExp("^(\\s*)"), E1 = new RegExp("^([0-9]+)"), v1 = new RegExp("^([a-zA-Z$_][a-zA-Z0-9$_]*)"), kd = new RegExp("^([a-zA-Z$_][a-zA-Z0-9$_]*)$"), Fd = new RegExp("^(address|bool|bytes([0-9]*)|string|u?int([0-9]*))$");
+}, A1 = new RegExp("^(\\s*)"), E1 = new RegExp("^([0-9]+)"), v1 = new RegExp("^([a-zA-Z$_][a-zA-Z0-9$_]*)"), Pd = new RegExp("^([a-zA-Z$_][a-zA-Z0-9$_]*)$"), Fd = new RegExp("^(address|bool|bytes([0-9]*)|string|u?int([0-9]*))$");
 class Ve {
   #t;
   #e;
@@ -7944,7 +7944,7 @@ class Zt {
       return new Zt(re, I, u, _, y, l, g, f);
     }
     const r = t.name;
-    V(!r || typeof r == "string" && r.match(kd), "invalid name", "obj.name", r);
+    V(!r || typeof r == "string" && r.match(Pd), "invalid name", "obj.name", r);
     let i = t.indexed;
     i != null && (V(e, "parameter cannot be indexed", "obj.indexed", t.indexed), i = !!i);
     let o = t.type, a = o.match(x1);
@@ -8015,7 +8015,7 @@ class Ti {
         case "function":
           return ur.from(t);
         case "struct":
-          return ki.from(t);
+          return Pi.from(t);
       }
     else if (typeof t == "object") {
       switch (t.type) {
@@ -8031,7 +8031,7 @@ class Ti {
         case "function":
           return ur.from(t);
         case "struct":
-          return ki.from(t);
+          return Pi.from(t);
       }
       _t(!1, `unsupported type: ${t.type}`, "UNSUPPORTED_OPERATION", {
         operation: "Fragment.from"
@@ -8067,7 +8067,7 @@ class Ti {
    *  Returns true if %%value%% is a [[StructFragment]].
    */
   static isStruct(t) {
-    return ki.isFragment(t);
+    return Pi.isFragment(t);
   }
 }
 class Jo extends Ti {
@@ -8079,7 +8079,7 @@ class Jo extends Ti {
    *  @private
    */
   constructor(t, e, r, i) {
-    super(t, e, i), V(typeof r == "string" && r.match(kd), "invalid identifier", "name", r), i = Object.freeze(i.slice()), zt(this, { name: r });
+    super(t, e, i), V(typeof r == "string" && r.match(Pd), "invalid identifier", "name", r), i = Object.freeze(i.slice()), zt(this, { name: r });
   }
 }
 function Gs(n, t) {
@@ -8403,7 +8403,7 @@ class ur extends Jo {
     return t && t[Oe] === lf;
   }
 }
-class ki extends Jo {
+class Pi extends Jo {
   /**
    *  @private
    */
@@ -8422,15 +8422,15 @@ class ki extends Jo {
   static from(t) {
     if (typeof t == "string")
       try {
-        return ki.from(hi(t));
+        return Pi.from(hi(t));
       } catch {
         V(!1, "invalid struct fragment", "obj", t);
       }
     else if (t instanceof Ve) {
       const e = Wo("struct", t), r = $n(t);
-      return Oi(t), new ki(re, e, r);
+      return Oi(t), new Pi(re, e, r);
     }
-    return new ki(re, t.name, t.inputs ? t.inputs.map(Zt.from) : []);
+    return new Pi(re, t.name, t.inputs ? t.inputs.map(Zt.from) : []);
   }
   // @TODO: fix this return type
   /**
@@ -8617,7 +8617,7 @@ class S1 {
     });
   }
 }
-class P1 {
+class k1 {
   /**
    *  The matching fragment from the transaction ``data``.
    */
@@ -8657,7 +8657,7 @@ class P1 {
     });
   }
 }
-class k1 {
+class P1 {
   /**
    *  The matching fragment.
    */
@@ -9365,7 +9365,7 @@ class Ei {
     if (!i)
       return null;
     const o = this.#n.decode(i.inputs, e.slice(4));
-    return new P1(i, i.selector, o, r);
+    return new k1(i, i.selector, o, r);
   }
   parseCallResult(t) {
     throw new Error("@TODO");
@@ -9391,7 +9391,7 @@ class Ei {
     if (!r)
       return null;
     const i = this.#n.decode(r.inputs, ne(e, 4));
-    return new k1(r, r.selector, i);
+    return new P1(r, r.selector, i);
   }
   /**
    *  Creates a new [[Interface]] from the ABI %%value%%.
@@ -10324,10 +10324,10 @@ class $s {
               const R = await this.provider.getTransactionReceipt(A.hash);
               if (R == null || y - R.blockNumber + 1 < r)
                 return;
-              let P = "replaced";
-              A.data === this.data && A.to === this.to && A.value === this.value ? P = "repriced" : A.data === "0x" && A.from === A.to && A.value === Td && (P = "cancelled"), _t(!1, "transaction was replaced", "TRANSACTION_REPLACED", {
-                cancelled: P === "replaced" || P === "cancelled",
-                reason: P,
+              let k = "replaced";
+              A.data === this.data && A.to === this.to && A.value === this.value ? k = "repriced" : A.data === "0x" && A.from === A.to && A.value === Td && (k = "cancelled"), _t(!1, "transaction was replaced", "TRANSACTION_REPLACED", {
+                cancelled: k === "replaced" || k === "cancelled",
+                reason: k,
                 replacement: A.replaceableTransaction(o),
                 hash: A.hash,
                 receipt: R
@@ -10878,8 +10878,8 @@ async function mf(n, t, e) {
         } catch {
         }
       if (A) {
-        const R = A, P = i ? n.interface.decodeEventLog(i, T.data, T.topics) : [];
-        zu(n, e, P, (z) => new C1(n, z, e, R, T));
+        const R = A, k = i ? n.interface.decodeEventLog(i, T.data, T.topics) : [];
+        zu(n, e, k, (z) => new C1(n, z, e, R, T));
       } else
         zu(n, e, [], (R) => new Ud(n, R, e, T));
     };
@@ -13157,14 +13157,14 @@ class lm {
 }
 function hm(n, t) {
   try {
-    const e = Pu(n, t);
+    const e = ku(n, t);
     if (e)
       return zo(e);
   } catch {
   }
   return null;
 }
-function Pu(n, t) {
+function ku(n, t) {
   if (n === "0x")
     return null;
   try {
@@ -13231,7 +13231,7 @@ function gm(n) {
     });
   }
   try {
-    const r = Pu(n, 64);
+    const r = ku(n, 64);
     if (r == null)
       throw new Error("abort");
     t.calldata = r;
@@ -13244,7 +13244,7 @@ function gm(n) {
     reason: "corrupt OffchainLookup callbaackSelector"
   }), t.selector = ne(n, 96, 100);
   try {
-    const r = Pu(n, 128);
+    const r = ku(n, 128);
     if (r == null)
       throw new Error("abort");
     t.extraData = r;
@@ -13476,7 +13476,7 @@ function vm(n) {
 function Hi(n) {
   return n && n.toLowerCase();
 }
-function Pf(n) {
+function kf(n) {
   return n && typeof n.pollingInterval == "number";
 }
 const $d = {
@@ -13577,13 +13577,13 @@ class ja extends ym {
     ]);
   }
   async signTypedData(t, e, r) {
-    const i = mo(r), o = await ke.resolveNames(t, e, i, async (a) => {
+    const i = mo(r), o = await Pe.resolveNames(t, e, i, async (a) => {
       const u = await ze(a);
       return V(u != null, "TypedData does not support null address", "value", a), u;
     });
     return await this.provider.send("eth_signTypedData_v4", [
       this.address.toLowerCase(),
-      JSON.stringify(ke.getPayload(o.domain, e, o.value))
+      JSON.stringify(Pe.getPayload(o.domain, e, o.value))
     ]);
   }
   async unlock(t) {
@@ -13920,7 +13920,7 @@ class xm extends lm {
         });
     }
     if (r === "eth_call" || r === "eth_estimateGas") {
-      const u = ku(i), _ = Ci.getBuiltinCallException(r === "eth_call" ? "call" : "estimateGas", t.params[0], u ? u.data : null);
+      const u = Pu(i), _ = Ci.getBuiltinCallException(r === "eth_call" ? "call" : "estimateGas", t.params[0], u ? u.data : null);
       return _.info = { error: i, payload: t }, _;
     }
     const o = JSON.stringify(zm(i));
@@ -14036,7 +14036,7 @@ class Yd extends xm {
   }
   _getSubscriber(t) {
     const e = super._getSubscriber(t);
-    return Pf(e) && (e.pollingInterval = this.#t), e;
+    return kf(e) && (e.pollingInterval = this.#t), e;
   }
   /**
    *  The polling interval (default: 4000 ms)
@@ -14048,7 +14048,7 @@ class Yd extends xm {
     if (!Number.isInteger(t) || t < 0)
       throw new Error("invalid interval");
     this.#t = t, this._forEachSubscriber((e) => {
-      Pf(e) && (e.pollingInterval = this.#t);
+      kf(e) && (e.pollingInterval = this.#t);
     });
   }
 }
@@ -14072,14 +14072,14 @@ class Rm extends Yd {
     return Array.isArray(i) || (i = [i]), i;
   }
 }
-function ku(n) {
+function Pu(n) {
   if (n == null)
     return null;
   if (typeof n.message == "string" && n.message.match(/revert/i) && Xt(n.data))
     return { message: n.message, data: n.data };
   if (typeof n == "object") {
     for (const t in n) {
-      const e = ku(n[t]);
+      const e = Pu(n[t]);
       if (e)
         return e;
     }
@@ -14087,7 +14087,7 @@ function ku(n) {
   }
   if (typeof n == "string")
     try {
-      return ku(JSON.parse(n));
+      return Pu(JSON.parse(n));
     } catch {
     }
   return null;
@@ -14291,12 +14291,12 @@ function Sm(n) {
   }
 }
 var Wn = [], Xi = !1, Bi, Ao = -1;
-function Pm() {
+function km() {
   !Xi || !Bi || (Xi = !1, Bi.length ? Wn = Bi.concat(Wn) : Ao = -1, Wn.length && eg());
 }
 function eg() {
   if (!Xi) {
-    var n = tg(Pm);
+    var n = tg(km);
     Xi = !0;
     for (var t = Wn.length; t; ) {
       for (Bi = Wn, Wn = []; ++Ao < t; )
@@ -14351,25 +14351,25 @@ _e.chdir = function(n) {
 _e.umask = function() {
   return 0;
 };
-var km = Xd.exports;
-const Ct = /* @__PURE__ */ Bm(km);
-var ho = { exports: {} }, kf;
+var Pm = Xd.exports;
+const Ct = /* @__PURE__ */ Bm(Pm);
+var ho = { exports: {} }, Pf;
 function ng() {
-  if (kf) return ho.exports;
-  kf = 1;
-  var n = typeof Reflect == "object" ? Reflect : null, t = n && typeof n.apply == "function" ? n.apply : function(k, C, N) {
-    return Function.prototype.apply.call(k, C, N);
+  if (Pf) return ho.exports;
+  Pf = 1;
+  var n = typeof Reflect == "object" ? Reflect : null, t = n && typeof n.apply == "function" ? n.apply : function(P, C, N) {
+    return Function.prototype.apply.call(P, C, N);
   }, e;
-  n && typeof n.ownKeys == "function" ? e = n.ownKeys : Object.getOwnPropertySymbols ? e = function(k) {
-    return Object.getOwnPropertyNames(k).concat(Object.getOwnPropertySymbols(k));
-  } : e = function(k) {
-    return Object.getOwnPropertyNames(k);
+  n && typeof n.ownKeys == "function" ? e = n.ownKeys : Object.getOwnPropertySymbols ? e = function(P) {
+    return Object.getOwnPropertyNames(P).concat(Object.getOwnPropertySymbols(P));
+  } : e = function(P) {
+    return Object.getOwnPropertyNames(P);
   };
   function r(z) {
     console && console.warn && console.warn(z);
   }
-  var i = Number.isNaN || function(k) {
-    return k !== k;
+  var i = Number.isNaN || function(P) {
+    return P !== P;
   };
   function o() {
     o.init.call(this);
@@ -14392,19 +14392,19 @@ function ng() {
     }
   }), o.init = function() {
     (this._events === void 0 || this._events === Object.getPrototypeOf(this)._events) && (this._events = /* @__PURE__ */ Object.create(null), this._eventsCount = 0), this._maxListeners = this._maxListeners || void 0;
-  }, o.prototype.setMaxListeners = function(k) {
-    if (typeof k != "number" || k < 0 || i(k))
-      throw new RangeError('The value of "n" is out of range. It must be a non-negative number. Received ' + k + ".");
-    return this._maxListeners = k, this;
+  }, o.prototype.setMaxListeners = function(P) {
+    if (typeof P != "number" || P < 0 || i(P))
+      throw new RangeError('The value of "n" is out of range. It must be a non-negative number. Received ' + P + ".");
+    return this._maxListeners = P, this;
   };
   function _(z) {
     return z._maxListeners === void 0 ? o.defaultMaxListeners : z._maxListeners;
   }
   o.prototype.getMaxListeners = function() {
     return _(this);
-  }, o.prototype.emit = function(k) {
+  }, o.prototype.emit = function(P) {
     for (var C = [], N = 1; N < arguments.length; N++) C.push(arguments[N]);
-    var D = k === "error", Y = this._events;
+    var D = P === "error", Y = this._events;
     if (Y !== void 0)
       D = D && Y.error === void 0;
     else if (!D)
@@ -14416,7 +14416,7 @@ function ng() {
       var ft = new Error("Unhandled error." + (Z ? " (" + Z.message + ")" : ""));
       throw ft.context = Z, ft;
     }
-    var L = Y[k];
+    var L = Y[P];
     if (L === void 0)
       return !1;
     if (typeof L == "function")
@@ -14426,46 +14426,46 @@ function ng() {
         t(Rt[N], this, C);
     return !0;
   };
-  function l(z, k, C, N) {
+  function l(z, P, C, N) {
     var D, Y, Z;
     if (u(C), Y = z._events, Y === void 0 ? (Y = z._events = /* @__PURE__ */ Object.create(null), z._eventsCount = 0) : (Y.newListener !== void 0 && (z.emit(
       "newListener",
-      k,
+      P,
       C.listener ? C.listener : C
-    ), Y = z._events), Z = Y[k]), Z === void 0)
-      Z = Y[k] = C, ++z._eventsCount;
-    else if (typeof Z == "function" ? Z = Y[k] = N ? [C, Z] : [Z, C] : N ? Z.unshift(C) : Z.push(C), D = _(z), D > 0 && Z.length > D && !Z.warned) {
+    ), Y = z._events), Z = Y[P]), Z === void 0)
+      Z = Y[P] = C, ++z._eventsCount;
+    else if (typeof Z == "function" ? Z = Y[P] = N ? [C, Z] : [Z, C] : N ? Z.unshift(C) : Z.push(C), D = _(z), D > 0 && Z.length > D && !Z.warned) {
       Z.warned = !0;
-      var ft = new Error("Possible EventEmitter memory leak detected. " + Z.length + " " + String(k) + " listeners added. Use emitter.setMaxListeners() to increase limit");
-      ft.name = "MaxListenersExceededWarning", ft.emitter = z, ft.type = k, ft.count = Z.length, r(ft);
+      var ft = new Error("Possible EventEmitter memory leak detected. " + Z.length + " " + String(P) + " listeners added. Use emitter.setMaxListeners() to increase limit");
+      ft.name = "MaxListenersExceededWarning", ft.emitter = z, ft.type = P, ft.count = Z.length, r(ft);
     }
     return z;
   }
-  o.prototype.addListener = function(k, C) {
-    return l(this, k, C, !1);
-  }, o.prototype.on = o.prototype.addListener, o.prototype.prependListener = function(k, C) {
-    return l(this, k, C, !0);
+  o.prototype.addListener = function(P, C) {
+    return l(this, P, C, !1);
+  }, o.prototype.on = o.prototype.addListener, o.prototype.prependListener = function(P, C) {
+    return l(this, P, C, !0);
   };
   function f() {
     if (!this.fired)
       return this.target.removeListener(this.type, this.wrapFn), this.fired = !0, arguments.length === 0 ? this.listener.call(this.target) : this.listener.apply(this.target, arguments);
   }
-  function g(z, k, C) {
-    var N = { fired: !1, wrapFn: void 0, target: z, type: k, listener: C }, D = f.bind(N);
+  function g(z, P, C) {
+    var N = { fired: !1, wrapFn: void 0, target: z, type: P, listener: C }, D = f.bind(N);
     return D.listener = C, N.wrapFn = D, D;
   }
-  o.prototype.once = function(k, C) {
-    return u(C), this.on(k, g(this, k, C)), this;
-  }, o.prototype.prependOnceListener = function(k, C) {
-    return u(C), this.prependListener(k, g(this, k, C)), this;
-  }, o.prototype.removeListener = function(k, C) {
+  o.prototype.once = function(P, C) {
+    return u(C), this.on(P, g(this, P, C)), this;
+  }, o.prototype.prependOnceListener = function(P, C) {
+    return u(C), this.prependListener(P, g(this, P, C)), this;
+  }, o.prototype.removeListener = function(P, C) {
     var N, D, Y, Z, ft;
     if (u(C), D = this._events, D === void 0)
       return this;
-    if (N = D[k], N === void 0)
+    if (N = D[P], N === void 0)
       return this;
     if (N === C || N.listener === C)
-      --this._eventsCount === 0 ? this._events = /* @__PURE__ */ Object.create(null) : (delete D[k], D.removeListener && this.emit("removeListener", k, N.listener || C));
+      --this._eventsCount === 0 ? this._events = /* @__PURE__ */ Object.create(null) : (delete D[P], D.removeListener && this.emit("removeListener", P, N.listener || C));
     else if (typeof N != "function") {
       for (Y = -1, Z = N.length - 1; Z >= 0; Z--)
         if (N[Z] === C || N[Z].listener === C) {
@@ -14474,46 +14474,46 @@ function ng() {
         }
       if (Y < 0)
         return this;
-      Y === 0 ? N.shift() : S(N, Y), N.length === 1 && (D[k] = N[0]), D.removeListener !== void 0 && this.emit("removeListener", k, ft || C);
+      Y === 0 ? N.shift() : S(N, Y), N.length === 1 && (D[P] = N[0]), D.removeListener !== void 0 && this.emit("removeListener", P, ft || C);
     }
     return this;
-  }, o.prototype.off = o.prototype.removeListener, o.prototype.removeAllListeners = function(k) {
+  }, o.prototype.off = o.prototype.removeListener, o.prototype.removeAllListeners = function(P) {
     var C, N, D;
     if (N = this._events, N === void 0)
       return this;
     if (N.removeListener === void 0)
-      return arguments.length === 0 ? (this._events = /* @__PURE__ */ Object.create(null), this._eventsCount = 0) : N[k] !== void 0 && (--this._eventsCount === 0 ? this._events = /* @__PURE__ */ Object.create(null) : delete N[k]), this;
+      return arguments.length === 0 ? (this._events = /* @__PURE__ */ Object.create(null), this._eventsCount = 0) : N[P] !== void 0 && (--this._eventsCount === 0 ? this._events = /* @__PURE__ */ Object.create(null) : delete N[P]), this;
     if (arguments.length === 0) {
       var Y = Object.keys(N), Z;
       for (D = 0; D < Y.length; ++D)
         Z = Y[D], Z !== "removeListener" && this.removeAllListeners(Z);
       return this.removeAllListeners("removeListener"), this._events = /* @__PURE__ */ Object.create(null), this._eventsCount = 0, this;
     }
-    if (C = N[k], typeof C == "function")
-      this.removeListener(k, C);
+    if (C = N[P], typeof C == "function")
+      this.removeListener(P, C);
     else if (C !== void 0)
       for (D = C.length - 1; D >= 0; D--)
-        this.removeListener(k, C[D]);
+        this.removeListener(P, C[D]);
     return this;
   };
-  function y(z, k, C) {
+  function y(z, P, C) {
     var N = z._events;
     if (N === void 0)
       return [];
-    var D = N[k];
+    var D = N[P];
     return D === void 0 ? [] : typeof D == "function" ? C ? [D.listener || D] : [D] : C ? T(D) : I(D, D.length);
   }
-  o.prototype.listeners = function(k) {
-    return y(this, k, !0);
-  }, o.prototype.rawListeners = function(k) {
-    return y(this, k, !1);
-  }, o.listenerCount = function(z, k) {
-    return typeof z.listenerCount == "function" ? z.listenerCount(k) : B.call(z, k);
+  o.prototype.listeners = function(P) {
+    return y(this, P, !0);
+  }, o.prototype.rawListeners = function(P) {
+    return y(this, P, !1);
+  }, o.listenerCount = function(z, P) {
+    return typeof z.listenerCount == "function" ? z.listenerCount(P) : B.call(z, P);
   }, o.prototype.listenerCount = B;
   function B(z) {
-    var k = this._events;
-    if (k !== void 0) {
-      var C = k[z];
+    var P = this._events;
+    if (P !== void 0) {
+      var C = P[z];
       if (typeof C == "function")
         return 1;
       if (C !== void 0)
@@ -14524,41 +14524,41 @@ function ng() {
   o.prototype.eventNames = function() {
     return this._eventsCount > 0 ? e(this._events) : [];
   };
-  function I(z, k) {
-    for (var C = new Array(k), N = 0; N < k; ++N)
+  function I(z, P) {
+    for (var C = new Array(P), N = 0; N < P; ++N)
       C[N] = z[N];
     return C;
   }
-  function S(z, k) {
-    for (; k + 1 < z.length; k++)
-      z[k] = z[k + 1];
+  function S(z, P) {
+    for (; P + 1 < z.length; P++)
+      z[P] = z[P + 1];
     z.pop();
   }
   function T(z) {
-    for (var k = new Array(z.length), C = 0; C < k.length; ++C)
-      k[C] = z[C].listener || z[C];
-    return k;
+    for (var P = new Array(z.length), C = 0; C < P.length; ++C)
+      P[C] = z[C].listener || z[C];
+    return P;
   }
-  function A(z, k) {
+  function A(z, P) {
     return new Promise(function(C, N) {
       function D(Z) {
-        z.removeListener(k, Y), N(Z);
+        z.removeListener(P, Y), N(Z);
       }
       function Y() {
         typeof z.removeListener == "function" && z.removeListener("error", D), C([].slice.call(arguments));
       }
-      P(z, k, Y, { once: !0 }), k !== "error" && R(z, D, { once: !0 });
+      k(z, P, Y, { once: !0 }), P !== "error" && R(z, D, { once: !0 });
     });
   }
-  function R(z, k, C) {
-    typeof z.on == "function" && P(z, "error", k, C);
+  function R(z, P, C) {
+    typeof z.on == "function" && k(z, "error", P, C);
   }
-  function P(z, k, C, N) {
+  function k(z, P, C, N) {
     if (typeof z.on == "function")
-      N.once ? z.once(k, C) : z.on(k, C);
+      N.once ? z.once(P, C) : z.on(P, C);
     else if (typeof z.addEventListener == "function")
-      z.addEventListener(k, function D(Y) {
-        N.once && z.removeEventListener(k, D), C(Y);
+      z.addEventListener(P, function D(Y) {
+        N.once && z.removeEventListener(P, D), C(Y);
       });
     else
       throw new TypeError('The "emitter" argument must be of type EventEmitter. Received type ' + typeof z);
@@ -14579,63 +14579,63 @@ function Xo() {
       r[u] = a[u], i[a.charCodeAt(u)] = u;
     i[45] = 62, i[95] = 63;
     function l(R) {
-      var P = R.length;
-      if (P % 4 > 0)
+      var k = R.length;
+      if (k % 4 > 0)
         throw new Error("Invalid string. Length must be a multiple of 4");
       var z = R.indexOf("=");
-      z === -1 && (z = P);
-      var k = z === P ? 0 : 4 - z % 4;
-      return [z, k];
+      z === -1 && (z = k);
+      var P = z === k ? 0 : 4 - z % 4;
+      return [z, P];
     }
     function f(R) {
-      var P = l(R), z = P[0], k = P[1];
-      return (z + k) * 3 / 4 - k;
+      var k = l(R), z = k[0], P = k[1];
+      return (z + P) * 3 / 4 - P;
     }
-    function g(R, P, z) {
-      return (P + z) * 3 / 4 - z;
+    function g(R, k, z) {
+      return (k + z) * 3 / 4 - z;
     }
     function y(R) {
-      var P, z = l(R), k = z[0], C = z[1], N = new o(g(R, k, C)), D = 0, Y = C > 0 ? k - 4 : k, Z;
+      var k, z = l(R), P = z[0], C = z[1], N = new o(g(R, P, C)), D = 0, Y = C > 0 ? P - 4 : P, Z;
       for (Z = 0; Z < Y; Z += 4)
-        P = i[R.charCodeAt(Z)] << 18 | i[R.charCodeAt(Z + 1)] << 12 | i[R.charCodeAt(Z + 2)] << 6 | i[R.charCodeAt(Z + 3)], N[D++] = P >> 16 & 255, N[D++] = P >> 8 & 255, N[D++] = P & 255;
-      return C === 2 && (P = i[R.charCodeAt(Z)] << 2 | i[R.charCodeAt(Z + 1)] >> 4, N[D++] = P & 255), C === 1 && (P = i[R.charCodeAt(Z)] << 10 | i[R.charCodeAt(Z + 1)] << 4 | i[R.charCodeAt(Z + 2)] >> 2, N[D++] = P >> 8 & 255, N[D++] = P & 255), N;
+        k = i[R.charCodeAt(Z)] << 18 | i[R.charCodeAt(Z + 1)] << 12 | i[R.charCodeAt(Z + 2)] << 6 | i[R.charCodeAt(Z + 3)], N[D++] = k >> 16 & 255, N[D++] = k >> 8 & 255, N[D++] = k & 255;
+      return C === 2 && (k = i[R.charCodeAt(Z)] << 2 | i[R.charCodeAt(Z + 1)] >> 4, N[D++] = k & 255), C === 1 && (k = i[R.charCodeAt(Z)] << 10 | i[R.charCodeAt(Z + 1)] << 4 | i[R.charCodeAt(Z + 2)] >> 2, N[D++] = k >> 8 & 255, N[D++] = k & 255), N;
     }
     function B(R) {
       return r[R >> 18 & 63] + r[R >> 12 & 63] + r[R >> 6 & 63] + r[R & 63];
     }
-    function I(R, P, z) {
-      for (var k, C = [], N = P; N < z; N += 3)
-        k = (R[N] << 16 & 16711680) + (R[N + 1] << 8 & 65280) + (R[N + 2] & 255), C.push(B(k));
+    function I(R, k, z) {
+      for (var P, C = [], N = k; N < z; N += 3)
+        P = (R[N] << 16 & 16711680) + (R[N + 1] << 8 & 65280) + (R[N + 2] & 255), C.push(B(P));
       return C.join("");
     }
     function S(R) {
-      for (var P, z = R.length, k = z % 3, C = [], N = 16383, D = 0, Y = z - k; D < Y; D += N)
+      for (var k, z = R.length, P = z % 3, C = [], N = 16383, D = 0, Y = z - P; D < Y; D += N)
         C.push(I(R, D, D + N > Y ? Y : D + N));
-      return k === 1 ? (P = R[z - 1], C.push(
-        r[P >> 2] + r[P << 4 & 63] + "=="
-      )) : k === 2 && (P = (R[z - 2] << 8) + R[z - 1], C.push(
-        r[P >> 10] + r[P >> 4 & 63] + r[P << 2 & 63] + "="
+      return P === 1 ? (k = R[z - 1], C.push(
+        r[k >> 2] + r[k << 4 & 63] + "=="
+      )) : P === 2 && (k = (R[z - 2] << 8) + R[z - 1], C.push(
+        r[k >> 10] + r[k >> 4 & 63] + r[k << 2 & 63] + "="
       )), C.join("");
     }
     var T = {};
     /*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */
-    T.read = function(R, P, z, k, C) {
-      var N, D, Y = C * 8 - k - 1, Z = (1 << Y) - 1, ft = Z >> 1, L = -7, At = z ? C - 1 : 0, Rt = z ? -1 : 1, at = R[P + At];
-      for (At += Rt, N = at & (1 << -L) - 1, at >>= -L, L += Y; L > 0; N = N * 256 + R[P + At], At += Rt, L -= 8)
+    T.read = function(R, k, z, P, C) {
+      var N, D, Y = C * 8 - P - 1, Z = (1 << Y) - 1, ft = Z >> 1, L = -7, At = z ? C - 1 : 0, Rt = z ? -1 : 1, at = R[k + At];
+      for (At += Rt, N = at & (1 << -L) - 1, at >>= -L, L += Y; L > 0; N = N * 256 + R[k + At], At += Rt, L -= 8)
         ;
-      for (D = N & (1 << -L) - 1, N >>= -L, L += k; L > 0; D = D * 256 + R[P + At], At += Rt, L -= 8)
+      for (D = N & (1 << -L) - 1, N >>= -L, L += P; L > 0; D = D * 256 + R[k + At], At += Rt, L -= 8)
         ;
       if (N === 0)
         N = 1 - ft;
       else {
         if (N === Z)
           return D ? NaN : (at ? -1 : 1) * (1 / 0);
-        D = D + Math.pow(2, k), N = N - ft;
+        D = D + Math.pow(2, P), N = N - ft;
       }
-      return (at ? -1 : 1) * D * Math.pow(2, N - k);
-    }, T.write = function(R, P, z, k, C, N) {
-      var D, Y, Z, ft = N * 8 - C - 1, L = (1 << ft) - 1, At = L >> 1, Rt = C === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, at = k ? 0 : N - 1, wt = k ? 1 : -1, Et = P < 0 || P === 0 && 1 / P < 0 ? 1 : 0;
-      for (P = Math.abs(P), isNaN(P) || P === 1 / 0 ? (Y = isNaN(P) ? 1 : 0, D = L) : (D = Math.floor(Math.log(P) / Math.LN2), P * (Z = Math.pow(2, -D)) < 1 && (D--, Z *= 2), D + At >= 1 ? P += Rt / Z : P += Rt * Math.pow(2, 1 - At), P * Z >= 2 && (D++, Z /= 2), D + At >= L ? (Y = 0, D = L) : D + At >= 1 ? (Y = (P * Z - 1) * Math.pow(2, C), D = D + At) : (Y = P * Math.pow(2, At - 1) * Math.pow(2, C), D = 0)); C >= 8; R[z + at] = Y & 255, at += wt, Y /= 256, C -= 8)
+      return (at ? -1 : 1) * D * Math.pow(2, N - P);
+    }, T.write = function(R, k, z, P, C, N) {
+      var D, Y, Z, ft = N * 8 - C - 1, L = (1 << ft) - 1, At = L >> 1, Rt = C === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, at = P ? 0 : N - 1, wt = P ? 1 : -1, Et = k < 0 || k === 0 && 1 / k < 0 ? 1 : 0;
+      for (k = Math.abs(k), isNaN(k) || k === 1 / 0 ? (Y = isNaN(k) ? 1 : 0, D = L) : (D = Math.floor(Math.log(k) / Math.LN2), k * (Z = Math.pow(2, -D)) < 1 && (D--, Z *= 2), D + At >= 1 ? k += Rt / Z : k += Rt * Math.pow(2, 1 - At), k * Z >= 2 && (D++, Z /= 2), D + At >= L ? (Y = 0, D = L) : D + At >= 1 ? (Y = (k * Z - 1) * Math.pow(2, C), D = D + At) : (Y = k * Math.pow(2, At - 1) * Math.pow(2, C), D = 0)); C >= 8; R[z + at] = Y & 255, at += wt, Y /= 256, C -= 8)
         ;
       for (D = D << C | Y, ft += C; ft > 0; R[z + at] = D & 255, at += wt, D /= 256, ft -= 8)
         ;
@@ -14648,7 +14648,7 @@ function Xo() {
      * @license  MIT
      */
     (function(R) {
-      const P = e, z = T, k = typeof Symbol == "function" && typeof Symbol.for == "function" ? Symbol.for("nodejs.util.inspect.custom") : null;
+      const k = e, z = T, P = typeof Symbol == "function" && typeof Symbol.for == "function" ? Symbol.for("nodejs.util.inspect.custom") : null;
       R.Buffer = L, R.SlowBuffer = X, R.INSPECT_MAX_BYTES = 50;
       const C = 2147483647;
       R.kMaxLength = C;
@@ -14705,7 +14705,7 @@ function Xo() {
           throw new TypeError(
             "The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " + typeof m
           );
-        if (Pe(m, D) || m && Pe(m.buffer, D) || typeof Y < "u" && (Pe(m, Y) || m && Pe(m.buffer, Y)))
+        if (ke(m, D) || m && ke(m.buffer, D) || typeof Y < "u" && (ke(m, Y) || m && ke(m.buffer, Y)))
           return Bt(m, p, d);
         if (typeof m == "number")
           throw new TypeError(
@@ -14760,7 +14760,7 @@ function Xo() {
         return d;
       }
       function vt(m) {
-        if (Pe(m, N)) {
+        if (ke(m, N)) {
           const p = new N(m);
           return Bt(p.buffer, p.byteOffset, p.byteLength);
         }
@@ -14795,7 +14795,7 @@ function Xo() {
       L.isBuffer = function(p) {
         return p != null && p._isBuffer === !0 && p !== L.prototype;
       }, L.compare = function(p, d) {
-        if (Pe(p, N) && (p = L.from(p, p.offset, p.byteLength)), Pe(d, N) && (d = L.from(d, d.offset, d.byteLength)), !L.isBuffer(p) || !L.isBuffer(d))
+        if (ke(p, N) && (p = L.from(p, p.offset, p.byteLength)), ke(d, N) && (d = L.from(d, d.offset, d.byteLength)), !L.isBuffer(p) || !L.isBuffer(d))
           throw new TypeError(
             'The "buf1", "buf2" arguments must be one of type Buffer or Uint8Array'
           );
@@ -14837,7 +14837,7 @@ function Xo() {
         let $ = 0;
         for (O = 0; O < p.length; ++O) {
           let ot = p[O];
-          if (Pe(ot, N))
+          if (ke(ot, N))
             $ + ot.length > H.length ? (L.isBuffer(ot) || (ot = L.from(ot)), ot.copy(H, $)) : N.prototype.set.call(
               H,
               ot,
@@ -14854,7 +14854,7 @@ function Xo() {
       function nt(m, p) {
         if (L.isBuffer(m))
           return m.length;
-        if (D.isView(m) || Pe(m, D))
+        if (D.isView(m) || ke(m, D))
           return m.byteLength;
         if (typeof m != "string")
           throw new TypeError(
@@ -14952,8 +14952,8 @@ function Xo() {
         let p = "";
         const d = R.INSPECT_MAX_BYTES;
         return p = this.toString("hex", 0, d).replace(/(.{2})/g, "$1 ").trim(), this.length > d && (p += " ... "), "<Buffer " + p + ">";
-      }, k && (L.prototype[k] = L.prototype.inspect), L.prototype.compare = function(p, d, O, H, $) {
-        if (Pe(p, N) && (p = L.from(p, p.offset, p.byteLength)), !L.isBuffer(p))
+      }, P && (L.prototype[P] = L.prototype.inspect), L.prototype.compare = function(p, d, O, H, $) {
+        if (ke(p, N) && (p = L.from(p, p.offset, p.byteLength)), !L.isBuffer(p))
           throw new TypeError(
             'The "target" argument must be one of type Buffer or Uint8Array. Received type ' + typeof p
           );
@@ -15097,7 +15097,7 @@ function Xo() {
         };
       };
       function lt(m, p, d) {
-        return p === 0 && d === m.length ? P.fromByteArray(m) : P.fromByteArray(m.slice(p, d));
+        return p === 0 && d === m.length ? k.fromByteArray(m) : k.fromByteArray(m.slice(p, d));
       }
       function St(m, p, d) {
         d = Math.min(m.length, d);
@@ -15124,10 +15124,10 @@ function Xo() {
           }
           ot === null ? (ot = 65533, Ft = 1) : ot > 65535 && (ot -= 65536, O.push(ot >>> 10 & 1023 | 55296), ot = 56320 | ot & 1023), O.push(ot), H += Ft;
         }
-        return Pt(O);
+        return kt(O);
       }
       const yt = 4096;
-      function Pt(m) {
+      function kt(m) {
         const p = m.length;
         if (p <= yt)
           return String.fromCharCode.apply(String, m);
@@ -15483,7 +15483,7 @@ function Xo() {
         );
       }
       const st = /[^+/0-9A-Za-z-_]/g;
-      function kt(m) {
+      function Pt(m) {
         if (m = m.split("=")[0], m = m.trim().replace(st, ""), m.length < 2) return "";
         for (; m.length % 4 !== 0; )
           m = m + "=";
@@ -15557,7 +15557,7 @@ function Xo() {
         return $;
       }
       function Dt(m) {
-        return P.toByteArray(kt(m));
+        return k.toByteArray(Pt(m));
       }
       function ei(m, p, d, O) {
         let H;
@@ -15565,7 +15565,7 @@ function Xo() {
           p[H + d] = m[H];
         return H;
       }
-      function Pe(m, p) {
+      function ke(m, p) {
         return m instanceof p || m != null && m.constructor != null && m.constructor.name != null && m.constructor.name === p.name;
       }
       function pi(m) {
@@ -15888,9 +15888,9 @@ function lg() {
       return T('"use strict"; return (' + ct + ").constructor;")();
     } catch {
     }
-  }, R = /* @__PURE__ */ Xs(), P = /* @__PURE__ */ ea(), z = function() {
+  }, R = /* @__PURE__ */ Xs(), k = /* @__PURE__ */ ea(), z = function() {
     throw new u();
-  }, k = R ? function() {
+  }, P = R ? function() {
     try {
       return arguments.callee, z;
     } catch {
@@ -15960,7 +15960,7 @@ function lg() {
     "%StringIteratorPrototype%": C && N ? N(""[Symbol.iterator]()) : n,
     "%Symbol%": C ? Symbol : n,
     "%SyntaxError%": a,
-    "%ThrowTypeError%": k,
+    "%ThrowTypeError%": P,
     "%TypedArray%": At,
     "%TypeError%": u,
     "%Uint8Array%": typeof Uint8Array > "u" ? n : Uint8Array,
@@ -15973,7 +15973,7 @@ function lg() {
     "%WeakSet%": typeof WeakSet > "u" ? n : WeakSet,
     "%Function.prototype.call%": ft,
     "%Function.prototype.apply%": Z,
-    "%Object.defineProperty%": P,
+    "%Object.defineProperty%": k,
     "%Object.getPrototypeOf%": D,
     "%Math.abs%": l,
     "%Math.floor%": f,
@@ -16067,8 +16067,8 @@ function lg() {
     if (x === "%" && v !== "%")
       throw new a("invalid intrinsic syntax, expected opening `%`");
     var et = [];
-    return W(ut, dt, function(lt, St, yt, Pt) {
-      et[et.length] = yt ? W(Pt, G, "$1") : St || lt;
+    return W(ut, dt, function(lt, St, yt, kt) {
+      et[et.length] = yt ? W(kt, G, "$1") : St || lt;
     }), et;
   }, tt = function(ut, v) {
     var x = ut, et;
@@ -16091,13 +16091,13 @@ function lg() {
       throw new u('"allowMissing" argument must be a boolean');
     if (nt(/^%?[^%]*%?$/, ut) === null)
       throw new a("`%` may not be present anywhere but at the beginning and end of the intrinsic name");
-    var x = M(ut), et = x.length > 0 ? x[0] : "", lt = tt("%" + et + "%", v), St = lt.name, yt = lt.value, Pt = !1, he = lt.alias;
+    var x = M(ut), et = x.length > 0 ? x[0] : "", lt = tt("%" + et + "%", v), St = lt.name, yt = lt.value, kt = !1, he = lt.alias;
     he && (et = he[0], jt(x, Bt([0, 1], he)));
     for (var it = 1, pe = !0; it < x.length; it += 1) {
       var we = x[it], Gt = X(we, 0, 1), Qt = X(we, -1);
       if ((Gt === '"' || Gt === "'" || Gt === "`" || Qt === '"' || Qt === "'" || Qt === "`") && Gt !== Qt)
         throw new a("property names with quotes must have matching quotes");
-      if ((we === "constructor" || !pe) && (Pt = !0), et += "." + we, St = "%" + et + "%", vt(Rt, St))
+      if ((we === "constructor" || !pe) && (kt = !0), et += "." + we, St = "%" + et + "%", vt(Rt, St))
         yt = Rt[St];
       else if (yt != null) {
         if (!(we in yt)) {
@@ -16110,7 +16110,7 @@ function lg() {
           pe = !!de, pe && "get" in de && !("originalValue" in de.get) ? yt = de.get : yt = yt[we];
         } else
           pe = vt(yt, we), yt = yt[we];
-        pe && !Pt && (Rt[St] = yt);
+        pe && !kt && (Rt[St] = yt);
       }
     }
     return yt;
@@ -16145,9 +16145,9 @@ function $m() {
   }();
   return r.isLegacyArguments = i, Sc = o ? r : i, Sc;
 }
-var Pc, dl;
+var kc, dl;
 function Ym() {
-  if (dl) return Pc;
+  if (dl) return kc;
   dl = 1;
   var n = Object.prototype.toString, t = Function.prototype.toString, e = /^\s*(?:function)?\*/, r = i_()(), i = Object.getPrototypeOf, o = function() {
     if (!r)
@@ -16157,7 +16157,7 @@ function Ym() {
     } catch {
     }
   }, a;
-  return Pc = function(_) {
+  return kc = function(_) {
     if (typeof _ != "function")
       return !1;
     if (e.test(t.call(_)))
@@ -16173,11 +16173,11 @@ function Ym() {
       a = f ? i(f) : !1;
     }
     return i(_) === a;
-  }, Pc;
+  }, kc;
 }
-var kc, gl;
+var Pc, gl;
 function Zm() {
-  if (gl) return kc;
+  if (gl) return Pc;
   gl = 1;
   var n = Function.prototype.toString, t = typeof Reflect == "object" && Reflect !== null && Reflect.apply, e, r;
   if (typeof t == "function" && typeof Object.defineProperty == "function")
@@ -16194,16 +16194,16 @@ function Zm() {
     }
   else
     t = null;
-  var i = /^\s*class\b/, o = function(P) {
+  var i = /^\s*class\b/, o = function(k) {
     try {
-      var z = n.call(P);
+      var z = n.call(k);
       return i.test(z);
     } catch {
       return !1;
     }
-  }, a = function(P) {
+  }, a = function(k) {
     try {
-      return o(P) ? !1 : (n.call(P), !0);
+      return o(k) ? !1 : (n.call(k), !0);
     } catch {
       return !1;
     }
@@ -16212,40 +16212,40 @@ function Zm() {
   };
   if (typeof document == "object") {
     var A = document.all;
-    u.call(A) === u.call(document.all) && (T = function(P) {
-      if ((S || !P) && (typeof P > "u" || typeof P == "object"))
+    u.call(A) === u.call(document.all) && (T = function(k) {
+      if ((S || !k) && (typeof k > "u" || typeof k == "object"))
         try {
-          var z = u.call(P);
-          return (z === g || z === y || z === B || z === _) && P("") == null;
+          var z = u.call(k);
+          return (z === g || z === y || z === B || z === _) && k("") == null;
         } catch {
         }
       return !1;
     });
   }
-  return kc = t ? function(P) {
-    if (T(P))
+  return Pc = t ? function(k) {
+    if (T(k))
       return !0;
-    if (!P || typeof P != "function" && typeof P != "object")
+    if (!k || typeof k != "function" && typeof k != "object")
       return !1;
     try {
-      t(P, null, e);
+      t(k, null, e);
     } catch (z) {
       if (z !== r)
         return !1;
     }
-    return !o(P) && a(P);
-  } : function(P) {
-    if (T(P))
+    return !o(k) && a(k);
+  } : function(k) {
+    if (T(k))
       return !0;
-    if (!P || typeof P != "function" && typeof P != "object")
+    if (!k || typeof k != "function" && typeof k != "object")
       return !1;
     if (I)
-      return a(P);
-    if (o(P))
+      return a(k);
+    if (o(k))
       return !1;
-    var z = u.call(P);
-    return z !== l && z !== f && !/^\[object HTML/.test(z) ? !1 : a(P);
-  }, kc;
+    var z = u.call(k);
+    return z !== l && z !== f && !/^\[object HTML/.test(z) ? !1 : a(k);
+  }, Pc;
 }
 var Fc, yl;
 function Xm() {
@@ -16415,8 +16415,8 @@ function pg() {
     if (Symbol.toStringTag in T && o) {
       var A = o(T), R = i(A, Symbol.toStringTag);
       if (!R && A) {
-        var P = o(A);
-        R = i(P, Symbol.toStringTag);
+        var k = o(A);
+        R = i(k, Symbol.toStringTag);
       }
       y["$" + S] = e(R.get);
     }
@@ -16435,11 +16435,11 @@ function pg() {
       /** @type {Record<`\$${import('.').TypedArrayName}`, Getter>} */
       y,
       /** @type {(getter: Getter, name: `\$${import('.').TypedArrayName}`) => void} */
-      function(R, P) {
+      function(R, k) {
         if (!A)
           try {
-            "$" + R(T) === P && (A = /** @type {import('.').TypedArrayName} */
-            f(P, 1));
+            "$" + R(T) === k && (A = /** @type {import('.').TypedArrayName} */
+            f(k, 1));
           } catch {
           }
       }
@@ -16450,11 +16450,11 @@ function pg() {
       /** @type {Record<`\$${import('.').TypedArrayName}`, Getter>} */
       y,
       /** @type {(getter: Getter, name: `\$${import('.').TypedArrayName}`) => void} */
-      function(R, P) {
+      function(R, k) {
         if (!A)
           try {
             R(T), A = /** @type {import('.').TypedArrayName} */
-            f(P, 1);
+            f(k, 1);
           } catch {
           }
       }
@@ -16517,18 +16517,18 @@ function c2() {
       return r(it) === "Uint8ClampedArray";
     }
     n.isUint8ClampedArray = R;
-    function P(it) {
+    function k(it) {
       return r(it) === "Uint16Array";
     }
-    n.isUint16Array = P;
+    n.isUint16Array = k;
     function z(it) {
       return r(it) === "Uint32Array";
     }
     n.isUint32Array = z;
-    function k(it) {
+    function P(it) {
       return r(it) === "Int8Array";
     }
-    n.isInt8Array = k;
+    n.isInt8Array = P;
     function C(it) {
       return r(it) === "Int16Array";
     }
@@ -16649,10 +16649,10 @@ function c2() {
       return u && I(it, B);
     }
     n.isSymbolObject = yt;
-    function Pt(it) {
+    function kt(it) {
       return x(it) || et(it) || lt(it) || St(it) || yt(it);
     }
-    n.isBoxedPrimitive = Pt;
+    n.isBoxedPrimitive = kt;
     function he(it) {
       return typeof Uint8Array < "u" && (jt(it) || G(it));
     }
@@ -16666,15 +16666,15 @@ function c2() {
     });
   }(qa)), qa;
 }
-var jc, Pl;
+var jc, kl;
 function u2() {
-  return Pl || (Pl = 1, jc = function(t) {
+  return kl || (kl = 1, jc = function(t) {
     return t && typeof t == "object" && typeof t.copy == "function" && typeof t.fill == "function" && typeof t.readUInt8 == "function";
   }), jc;
 }
-var po = { exports: {} }, kl;
+var po = { exports: {} }, Pl;
 function gs() {
-  return kl || (kl = 1, typeof Object.create == "function" ? po.exports = function(t, e) {
+  return Pl || (Pl = 1, typeof Object.create == "function" ? po.exports = function(t, e) {
     e && (t.super_ = e, t.prototype = Object.create(e.prototype, {
       constructor: {
         value: t,
@@ -16701,7 +16701,7 @@ function wg() {
       return dt;
     }, e = /%[sdj%]/g;
     n.format = function(W) {
-      if (!k(W)) {
+      if (!P(W)) {
         for (var X = [], nt = 0; nt < arguments.length; nt++)
           X.push(a(arguments[nt]));
         return X.join(" ");
@@ -16812,7 +16812,7 @@ function wg() {
       X.inspect !== n.inspect && // Also filter out any prototype objects using the circular check.
       !(X.constructor && X.constructor.prototype === X)) {
         var dt = X.inspect(nt, W);
-        return k(dt) || (dt = f(W, dt, nt)), dt;
+        return P(dt) || (dt = f(W, dt, nt)), dt;
       }
       var G = g(W, X);
       if (G)
@@ -16850,7 +16850,7 @@ function wg() {
     function g(W, X) {
       if (N(X))
         return W.stylize("undefined", "undefined");
-      if (k(X)) {
+      if (P(X)) {
         var nt = "'" + JSON.stringify(X).replace(/^"|"$/g, "").replace(/'/g, "\\'").replace(/\\"/g, '"') + "'";
         return W.stylize(nt, "string");
       }
@@ -16926,18 +16926,18 @@ function wg() {
       return W === null;
     }
     n.isNull = R;
-    function P(W) {
+    function k(W) {
       return W == null;
     }
-    n.isNullOrUndefined = P;
+    n.isNullOrUndefined = k;
     function z(W) {
       return typeof W == "number";
     }
     n.isNumber = z;
-    function k(W) {
+    function P(W) {
       return typeof W == "string";
     }
-    n.isString = k;
+    n.isString = P;
     function C(W) {
       return typeof W == "symbol";
     }
@@ -17191,8 +17191,8 @@ function _2() {
       key: "concat",
       value: function(T) {
         if (this.length === 0) return l.alloc(0);
-        for (var A = l.allocUnsafe(T >>> 0), R = this.head, P = 0; R; )
-          B(R.data, A, P), P += R.data.length, R = R.next;
+        for (var A = l.allocUnsafe(T >>> 0), R = this.head, k = 0; R; )
+          B(R.data, A, k), k += R.data.length, R = R.next;
         return A;
       }
       // Consumes a specified amount of bytes or characters from the buffered data.
@@ -17211,31 +17211,31 @@ function _2() {
     }, {
       key: "_getString",
       value: function(T) {
-        var A = this.head, R = 1, P = A.data;
-        for (T -= P.length; A = A.next; ) {
-          var z = A.data, k = T > z.length ? z.length : T;
-          if (k === z.length ? P += z : P += z.slice(0, T), T -= k, T === 0) {
-            k === z.length ? (++R, A.next ? this.head = A.next : this.head = this.tail = null) : (this.head = A, A.data = z.slice(k));
+        var A = this.head, R = 1, k = A.data;
+        for (T -= k.length; A = A.next; ) {
+          var z = A.data, P = T > z.length ? z.length : T;
+          if (P === z.length ? k += z : k += z.slice(0, T), T -= P, T === 0) {
+            P === z.length ? (++R, A.next ? this.head = A.next : this.head = this.tail = null) : (this.head = A, A.data = z.slice(P));
             break;
           }
           ++R;
         }
-        return this.length -= R, P;
+        return this.length -= R, k;
       }
       // Consumes a specified amount of bytes from the buffered data.
     }, {
       key: "_getBuffer",
       value: function(T) {
-        var A = l.allocUnsafe(T), R = this.head, P = 1;
+        var A = l.allocUnsafe(T), R = this.head, k = 1;
         for (R.data.copy(A), T -= R.data.length; R = R.next; ) {
-          var z = R.data, k = T > z.length ? z.length : T;
-          if (z.copy(A, A.length - T, 0, k), T -= k, T === 0) {
-            k === z.length ? (++P, R.next ? this.head = R.next : this.head = this.tail = null) : (this.head = R, R.data = z.slice(k));
+          var z = R.data, P = T > z.length ? z.length : T;
+          if (z.copy(A, A.length - T, 0, P), T -= P, T === 0) {
+            P === z.length ? (++k, R.next ? this.head = R.next : this.head = this.tail = null) : (this.head = R, R.data = z.slice(P));
             break;
           }
-          ++P;
+          ++k;
         }
-        return this.length -= P, A;
+        return this.length -= k, A;
       }
       // Make sure the linked list only shows the minimal necessary information.
     }, {
@@ -17418,9 +17418,9 @@ function yg() {
   function u(G) {
     return i.isBuffer(G) || G instanceof o;
   }
-  var _ = dg(), l = gg(), f = l.getHighWaterMark, g = ys().codes, y = g.ERR_INVALID_ARG_TYPE, B = g.ERR_METHOD_NOT_IMPLEMENTED, I = g.ERR_MULTIPLE_CALLBACK, S = g.ERR_STREAM_CANNOT_PIPE, T = g.ERR_STREAM_DESTROYED, A = g.ERR_STREAM_NULL_VALUES, R = g.ERR_STREAM_WRITE_AFTER_END, P = g.ERR_UNKNOWN_ENCODING, z = _.errorOrDestroy;
+  var _ = dg(), l = gg(), f = l.getHighWaterMark, g = ys().codes, y = g.ERR_INVALID_ARG_TYPE, B = g.ERR_METHOD_NOT_IMPLEMENTED, I = g.ERR_MULTIPLE_CALLBACK, S = g.ERR_STREAM_CANNOT_PIPE, T = g.ERR_STREAM_DESTROYED, A = g.ERR_STREAM_NULL_VALUES, R = g.ERR_STREAM_WRITE_AFTER_END, k = g.ERR_UNKNOWN_ENCODING, z = _.errorOrDestroy;
   gs()(D, r);
-  function k() {
+  function P() {
   }
   function C(G, M, tt) {
     t = t || fs(), G = G || {}, typeof tt != "boolean" && (tt = M instanceof t), this.objectMode = !!G.objectMode, tt && (this.objectMode = this.objectMode || !!G.writableObjectMode), this.highWaterMark = f(this, G, "writableHighWaterMark", tt), this.finalCalled = !1, this.needDrain = !1, this.ending = !1, this.ended = !1, this.finished = !1, this.destroyed = !1;
@@ -17470,14 +17470,14 @@ function yg() {
   }
   D.prototype.write = function(G, M, tt) {
     var ct = this._writableState, ut = !1, v = !ct.objectMode && u(G);
-    return v && !i.isBuffer(G) && (G = a(G)), typeof M == "function" && (tt = M, M = null), v ? M = "buffer" : M || (M = ct.defaultEncoding), typeof tt != "function" && (tt = k), ct.ending ? Y(this, tt) : (v || Z(this, ct, G, tt)) && (ct.pendingcb++, ut = L(this, ct, v, G, M, tt)), ut;
+    return v && !i.isBuffer(G) && (G = a(G)), typeof M == "function" && (tt = M, M = null), v ? M = "buffer" : M || (M = ct.defaultEncoding), typeof tt != "function" && (tt = P), ct.ending ? Y(this, tt) : (v || Z(this, ct, G, tt)) && (ct.pendingcb++, ut = L(this, ct, v, G, M, tt)), ut;
   }, D.prototype.cork = function() {
     this._writableState.corked++;
   }, D.prototype.uncork = function() {
     var G = this._writableState;
     G.corked && (G.corked--, !G.writing && !G.corked && !G.bufferProcessing && G.bufferedRequest && vt(this, G));
   }, D.prototype.setDefaultEncoding = function(M) {
-    if (typeof M == "string" && (M = M.toLowerCase()), !(["hex", "utf8", "utf-8", "ascii", "binary", "base64", "ucs2", "ucs-2", "utf16le", "utf-16le", "raw"].indexOf((M + "").toLowerCase()) > -1)) throw new P(M);
+    if (typeof M == "string" && (M = M.toLowerCase()), !(["hex", "utf8", "utf-8", "ascii", "binary", "base64", "ucs2", "ucs-2", "utf16le", "utf-16le", "raw"].indexOf((M + "").toLowerCase()) > -1)) throw new k(M);
     return this._writableState.defaultEncoding = M, this;
   }, Object.defineProperty(D.prototype, "writableBuffer", {
     // making it explicit this property is not enumerable
@@ -17556,8 +17556,8 @@ function yg() {
       ut.allBuffers = et, At(G, M, !0, M.length, ut, "", v.finish), M.pendingcb++, M.lastBufferedRequest = null, v.next ? (M.corkedRequestsFree = v.next, v.next = null) : M.corkedRequestsFree = new n(M), M.bufferedRequestCount = 0;
     } else {
       for (; tt; ) {
-        var lt = tt.chunk, St = tt.encoding, yt = tt.callback, Pt = M.objectMode ? 1 : lt.length;
-        if (At(G, M, !1, Pt, lt, St, yt), tt = tt.next, M.bufferedRequestCount--, M.writing)
+        var lt = tt.chunk, St = tt.encoding, yt = tt.callback, kt = M.objectMode ? 1 : lt.length;
+        if (At(G, M, !1, kt, lt, St, yt), tt = tt.next, M.bufferedRequestCount--, M.writing)
           break;
       }
       tt === null && (M.lastBufferedRequest = null);
@@ -17794,13 +17794,13 @@ function jl() {
   }
   i.prototype.write = function(A) {
     if (A.length === 0) return "";
-    var R, P;
+    var R, k;
     if (this.lastNeed) {
       if (R = this.fillLast(A), R === void 0) return "";
-      P = this.lastNeed, this.lastNeed = 0;
+      k = this.lastNeed, this.lastNeed = 0;
     } else
-      P = 0;
-    return P < A.length ? R ? R + this.text(A, P) : this.text(A, P) : R || "";
+      k = 0;
+    return k < A.length ? R ? R + this.text(A, k) : this.text(A, k) : R || "";
   }, i.prototype.end = f, i.prototype.text = l, i.prototype.fillLast = function(A) {
     if (this.lastNeed <= A.length)
       return A.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, this.lastNeed), this.lastChar.toString(this.encoding, 0, this.lastTotal);
@@ -17809,13 +17809,13 @@ function jl() {
   function o(A) {
     return A <= 127 ? 0 : A >> 5 === 6 ? 2 : A >> 4 === 14 ? 3 : A >> 3 === 30 ? 4 : A >> 6 === 2 ? -1 : -2;
   }
-  function a(A, R, P) {
+  function a(A, R, k) {
     var z = R.length - 1;
-    if (z < P) return 0;
-    var k = o(R[z]);
-    return k >= 0 ? (k > 0 && (A.lastNeed = k - 1), k) : --z < P || k === -2 ? 0 : (k = o(R[z]), k >= 0 ? (k > 0 && (A.lastNeed = k - 2), k) : --z < P || k === -2 ? 0 : (k = o(R[z]), k >= 0 ? (k > 0 && (k === 2 ? k = 0 : A.lastNeed = k - 3), k) : 0));
+    if (z < k) return 0;
+    var P = o(R[z]);
+    return P >= 0 ? (P > 0 && (A.lastNeed = P - 1), P) : --z < k || P === -2 ? 0 : (P = o(R[z]), P >= 0 ? (P > 0 && (A.lastNeed = P - 2), P) : --z < k || P === -2 ? 0 : (P = o(R[z]), P >= 0 ? (P > 0 && (P === 2 ? P = 0 : A.lastNeed = P - 3), P) : 0));
   }
-  function u(A, R, P) {
+  function u(A, R, k) {
     if ((R[0] & 192) !== 128)
       return A.lastNeed = 0, "�";
     if (A.lastNeed > 1 && R.length > 1) {
@@ -17826,17 +17826,17 @@ function jl() {
     }
   }
   function _(A) {
-    var R = this.lastTotal - this.lastNeed, P = u(this, A);
-    if (P !== void 0) return P;
+    var R = this.lastTotal - this.lastNeed, k = u(this, A);
+    if (k !== void 0) return k;
     if (this.lastNeed <= A.length)
       return A.copy(this.lastChar, R, 0, this.lastNeed), this.lastChar.toString(this.encoding, 0, this.lastTotal);
     A.copy(this.lastChar, R, 0, A.length), this.lastNeed -= A.length;
   }
   function l(A, R) {
-    var P = a(this, A, R);
+    var k = a(this, A, R);
     if (!this.lastNeed) return A.toString("utf8", R);
-    this.lastTotal = P;
-    var z = A.length - (P - this.lastNeed);
+    this.lastTotal = k;
+    var z = A.length - (k - this.lastNeed);
     return A.copy(this.lastChar, 0, z), A.toString("utf8", R, z);
   }
   function f(A) {
@@ -17845,27 +17845,27 @@ function jl() {
   }
   function g(A, R) {
     if ((A.length - R) % 2 === 0) {
-      var P = A.toString("utf16le", R);
-      if (P) {
-        var z = P.charCodeAt(P.length - 1);
+      var k = A.toString("utf16le", R);
+      if (k) {
+        var z = k.charCodeAt(k.length - 1);
         if (z >= 55296 && z <= 56319)
-          return this.lastNeed = 2, this.lastTotal = 4, this.lastChar[0] = A[A.length - 2], this.lastChar[1] = A[A.length - 1], P.slice(0, -1);
+          return this.lastNeed = 2, this.lastTotal = 4, this.lastChar[0] = A[A.length - 2], this.lastChar[1] = A[A.length - 1], k.slice(0, -1);
       }
-      return P;
+      return k;
     }
     return this.lastNeed = 1, this.lastTotal = 2, this.lastChar[0] = A[A.length - 1], A.toString("utf16le", R, A.length - 1);
   }
   function y(A) {
     var R = A && A.length ? this.write(A) : "";
     if (this.lastNeed) {
-      var P = this.lastTotal - this.lastNeed;
-      return R + this.lastChar.toString("utf16le", 0, P);
+      var k = this.lastTotal - this.lastNeed;
+      return R + this.lastChar.toString("utf16le", 0, k);
     }
     return R;
   }
   function B(A, R) {
-    var P = (A.length - R) % 3;
-    return P === 0 ? A.toString("base64", R) : (this.lastNeed = 3 - P, this.lastTotal = 3, P === 1 ? this.lastChar[0] = A[A.length - 1] : (this.lastChar[0] = A[A.length - 2], this.lastChar[1] = A[A.length - 1]), A.toString("base64", R, A.length - P));
+    var k = (A.length - R) % 3;
+    return k === 0 ? A.toString("base64", R) : (this.lastNeed = 3 - k, this.lastTotal = 3, k === 1 ? this.lastChar[0] = A[A.length - 1] : (this.lastChar[0] = A[A.length - 2], this.lastChar[1] = A[A.length - 1]), A.toString("base64", R, A.length - k));
   }
   function I(A) {
     var R = A && A.length ? this.write(A) : "";
@@ -17909,14 +17909,14 @@ function c_() {
       l = !1, g = !0, _ || u.call(o);
     }, B = o._readableState && o._readableState.endEmitted, I = function() {
       _ = !1, B = !0, l || u.call(o);
-    }, S = function(P) {
-      u.call(o, P);
+    }, S = function(k) {
+      u.call(o, k);
     }, T = function() {
-      var P;
+      var k;
       if (_ && !B)
-        return (!o._readableState || !o._readableState.ended) && (P = new n()), u.call(o, P);
+        return (!o._readableState || !o._readableState.ended) && (k = new n()), u.call(o, k);
       if (l && !g)
-        return (!o._writableState || !o._writableState.ended) && (P = new n()), u.call(o, P);
+        return (!o._writableState || !o._writableState.ended) && (k = new n()), u.call(o, k);
     }, A = function() {
       o.req.on("finish", y);
     };
@@ -17931,48 +17931,48 @@ function h2() {
   if (Hl) return Yc;
   Hl = 1;
   var n;
-  function t(P, z, k) {
-    return z = e(z), z in P ? Object.defineProperty(P, z, { value: k, enumerable: !0, configurable: !0, writable: !0 }) : P[z] = k, P;
+  function t(k, z, P) {
+    return z = e(z), z in k ? Object.defineProperty(k, z, { value: P, enumerable: !0, configurable: !0, writable: !0 }) : k[z] = P, k;
   }
-  function e(P) {
-    var z = r(P, "string");
+  function e(k) {
+    var z = r(k, "string");
     return typeof z == "symbol" ? z : String(z);
   }
-  function r(P, z) {
-    if (typeof P != "object" || P === null) return P;
-    var k = P[Symbol.toPrimitive];
-    if (k !== void 0) {
-      var C = k.call(P, z);
+  function r(k, z) {
+    if (typeof k != "object" || k === null) return k;
+    var P = k[Symbol.toPrimitive];
+    if (P !== void 0) {
+      var C = P.call(k, z);
       if (typeof C != "object") return C;
       throw new TypeError("@@toPrimitive must return a primitive value.");
     }
-    return (z === "string" ? String : Number)(P);
+    return (z === "string" ? String : Number)(k);
   }
   var i = c_(), o = Symbol("lastResolve"), a = Symbol("lastReject"), u = Symbol("error"), _ = Symbol("ended"), l = Symbol("lastPromise"), f = Symbol("handlePromise"), g = Symbol("stream");
-  function y(P, z) {
+  function y(k, z) {
     return {
-      value: P,
+      value: k,
       done: z
     };
   }
-  function B(P) {
-    var z = P[o];
+  function B(k) {
+    var z = k[o];
     if (z !== null) {
-      var k = P[g].read();
-      k !== null && (P[l] = null, P[o] = null, P[a] = null, z(y(k, !1)));
+      var P = k[g].read();
+      P !== null && (k[l] = null, k[o] = null, k[a] = null, z(y(P, !1)));
     }
   }
-  function I(P) {
-    Ct.nextTick(B, P);
+  function I(k) {
+    Ct.nextTick(B, k);
   }
-  function S(P, z) {
-    return function(k, C) {
-      P.then(function() {
+  function S(k, z) {
+    return function(P, C) {
+      k.then(function() {
         if (z[_]) {
-          k(y(void 0, !0));
+          P(y(void 0, !0));
           return;
         }
-        z[f](k, C);
+        z[f](P, C);
       }, C);
     };
   }
@@ -17982,9 +17982,9 @@ function h2() {
       return this[g];
     },
     next: function() {
-      var z = this, k = this[u];
-      if (k !== null)
-        return Promise.reject(k);
+      var z = this, P = this[u];
+      if (P !== null)
+        return Promise.reject(P);
       if (this[_])
         return Promise.resolve(y(void 0, !0));
       if (this[g].destroyed)
@@ -18008,38 +18008,38 @@ function h2() {
     return this;
   }), t(n, "return", function() {
     var z = this;
-    return new Promise(function(k, C) {
+    return new Promise(function(P, C) {
       z[g].destroy(null, function(N) {
         if (N) {
           C(N);
           return;
         }
-        k(y(void 0, !0));
+        P(y(void 0, !0));
       });
     });
   }), n), T), R = function(z) {
-    var k, C = Object.create(A, (k = {}, t(k, g, {
+    var P, C = Object.create(A, (P = {}, t(P, g, {
       value: z,
       writable: !0
-    }), t(k, o, {
+    }), t(P, o, {
       value: null,
       writable: !0
-    }), t(k, a, {
+    }), t(P, a, {
       value: null,
       writable: !0
-    }), t(k, u, {
+    }), t(P, u, {
       value: null,
       writable: !0
-    }), t(k, _, {
+    }), t(P, _, {
       value: z._readableState.endEmitted,
       writable: !0
-    }), t(k, f, {
+    }), t(P, f, {
       value: function(D, Y) {
         var Z = C[g].read();
         Z ? (C[l] = null, C[o] = null, C[a] = null, D(y(Z, !1))) : (C[o] = D, C[a] = Y);
       },
       writable: !0
-    }), k));
+    }), P));
     return C[l] = null, i(z, function(N) {
       if (N && N.code !== "ERR_STREAM_PREMATURE_CLOSE") {
         var D = C[a];
@@ -18077,9 +18077,9 @@ function bg() {
   var u = wg(), _;
   u && u.debuglog ? _ = u.debuglog("stream") : _ = function() {
   };
-  var l = _2(), f = dg(), g = gg(), y = g.getHighWaterMark, B = ys().codes, I = B.ERR_INVALID_ARG_TYPE, S = B.ERR_STREAM_PUSH_AFTER_EOF, T = B.ERR_METHOD_NOT_IMPLEMENTED, A = B.ERR_STREAM_UNSHIFT_AFTER_END_EVENT, R, P, z;
+  var l = _2(), f = dg(), g = gg(), y = g.getHighWaterMark, B = ys().codes, I = B.ERR_INVALID_ARG_TYPE, S = B.ERR_STREAM_PUSH_AFTER_EOF, T = B.ERR_METHOD_NOT_IMPLEMENTED, A = B.ERR_STREAM_UNSHIFT_AFTER_END_EVENT, R, k, z;
   gs()(Y, e);
-  var k = f.errorOrDestroy, C = ["error", "close", "destroy", "pause", "resume"];
+  var P = f.errorOrDestroy, C = ["error", "close", "destroy", "pause", "resume"];
   function N(v, x, et) {
     if (typeof v.prependListener == "function") return v.prependListener(x, et);
     !v._events || !v._events[x] ? v.on(x, et) : Array.isArray(v._events[x]) ? v._events[x].unshift(et) : v._events[x] = [et, v._events[x]];
@@ -18117,14 +18117,14 @@ function bg() {
     if (x === null)
       yt.reading = !1, wt(v, yt);
     else {
-      var Pt;
-      if (St || (Pt = L(yt, x)), Pt)
-        k(v, Pt);
+      var kt;
+      if (St || (kt = L(yt, x)), kt)
+        P(v, kt);
       else if (yt.objectMode || x && x.length > 0)
         if (typeof x != "string" && !yt.objectMode && Object.getPrototypeOf(x) !== r.prototype && (x = o(x)), lt)
-          yt.endEmitted ? k(v, new A()) : ft(v, yt, x, !0);
+          yt.endEmitted ? P(v, new A()) : ft(v, yt, x, !0);
         else if (yt.ended)
-          k(v, new S());
+          P(v, new S());
         else {
           if (yt.destroyed)
             return !1;
@@ -18199,7 +18199,7 @@ function bg() {
     x.readingMore = !1;
   }
   Y.prototype._read = function(v) {
-    k(this, new T("_read()"));
+    P(this, new T("_read()"));
   }, Y.prototype.pipe = function(v, x) {
     var et = this, lt = this._readableState;
     switch (lt.pipesCount) {
@@ -18215,8 +18215,8 @@ function bg() {
     }
     lt.pipesCount += 1, _("pipe count=%d opts=%j", lt.pipesCount, x);
     var St = (!x || x.end !== !1) && v !== Ct.stdout && v !== Ct.stderr, yt = St ? he : Ee;
-    lt.endEmitted ? Ct.nextTick(yt) : et.once("end", yt), v.on("unpipe", Pt);
-    function Pt(Se, ae) {
+    lt.endEmitted ? Ct.nextTick(yt) : et.once("end", yt), v.on("unpipe", kt);
+    function kt(Se, ae) {
       _("onunpipe"), Se === et && ae && ae.hasUnpiped === !1 && (ae.hasUnpiped = !0, we());
     }
     function he() {
@@ -18226,7 +18226,7 @@ function bg() {
     v.on("drain", it);
     var pe = !1;
     function we() {
-      _("cleanup"), v.removeListener("close", de), v.removeListener("finish", fe), v.removeListener("drain", it), v.removeListener("error", Qt), v.removeListener("unpipe", Pt), et.removeListener("end", he), et.removeListener("end", Ee), et.removeListener("data", Gt), pe = !0, lt.awaitDrain && (!v._writableState || v._writableState.needDrain) && it();
+      _("cleanup"), v.removeListener("close", de), v.removeListener("finish", fe), v.removeListener("drain", it), v.removeListener("error", Qt), v.removeListener("unpipe", kt), et.removeListener("end", he), et.removeListener("end", Ee), et.removeListener("data", Gt), pe = !0, lt.awaitDrain && (!v._writableState || v._writableState.needDrain) && it();
     }
     et.on("data", Gt);
     function Gt(Se) {
@@ -18235,7 +18235,7 @@ function bg() {
       _("dest.write", ae), ae === !1 && ((lt.pipesCount === 1 && lt.pipes === v || lt.pipesCount > 1 && ut(lt.pipes, v) !== -1) && !pe && (_("false write response, pause", lt.awaitDrain), lt.awaitDrain++), et.pause());
     }
     function Qt(Se) {
-      _("onerror", Se), Ee(), v.removeListener("error", Qt), t(v, "error") === 0 && k(v, Se);
+      _("onerror", Se), Ee(), v.removeListener("error", Qt), t(v, "error") === 0 && P(v, Se);
     }
     N(v, "error", Qt);
     function de() {
@@ -18272,8 +18272,8 @@ function bg() {
       });
       return this;
     }
-    var Pt = ut(x.pipes, v);
-    return Pt === -1 ? this : (x.pipes.splice(Pt, 1), x.pipesCount -= 1, x.pipesCount === 1 && (x.pipes = x.pipes[0]), v.emit("unpipe", this, et), this);
+    var kt = ut(x.pipes, v);
+    return kt === -1 ? this : (x.pipes.splice(kt, 1), x.pipesCount -= 1, x.pipesCount === 1 && (x.pipes = x.pipes[0]), v.emit("unpipe", this, et), this);
   }, Y.prototype.on = function(v, x) {
     var et = e.prototype.on.call(this, v, x), lt = this._readableState;
     return v === "data" ? (lt.readableListening = this.listenerCount("readable") > 0, lt.flowing !== !1 && this.resume()) : v === "readable" && !lt.endEmitted && !lt.readableListening && (lt.readableListening = lt.needReadable = !0, lt.flowing = !1, lt.emittedReadable = !1, _("on readable", lt.length, lt.reading), lt.length ? Et(this) : lt.reading || Ct.nextTick(X, this)), et;
@@ -18312,13 +18312,13 @@ function bg() {
     var x = this, et = this._readableState, lt = !1;
     v.on("end", function() {
       if (_("wrapped end"), et.decoder && !et.ended) {
-        var Pt = et.decoder.end();
-        Pt && Pt.length && x.push(Pt);
+        var kt = et.decoder.end();
+        kt && kt.length && x.push(kt);
       }
       x.push(null);
-    }), v.on("data", function(Pt) {
-      if (_("wrapped data"), et.decoder && (Pt = et.decoder.write(Pt)), !(et.objectMode && Pt == null) && !(!et.objectMode && (!Pt || !Pt.length))) {
-        var he = x.push(Pt);
+    }), v.on("data", function(kt) {
+      if (_("wrapped data"), et.decoder && (kt = et.decoder.write(kt)), !(et.objectMode && kt == null) && !(!et.objectMode && (!kt || !kt.length))) {
+        var he = x.push(kt);
         he || (lt = !0, v.pause());
       }
     });
@@ -18330,11 +18330,11 @@ function bg() {
       }(St));
     for (var yt = 0; yt < C.length; yt++)
       v.on(C[yt], this.emit.bind(this, C[yt]));
-    return this._read = function(Pt) {
-      _("wrapped _read", Pt), lt && (lt = !1, v.resume());
+    return this._read = function(kt) {
+      _("wrapped _read", kt), lt && (lt = !1, v.resume());
     }, this;
   }, typeof Symbol == "function" && (Y.prototype[Symbol.asyncIterator] = function() {
-    return P === void 0 && (P = h2()), P(this);
+    return k === void 0 && (k = h2()), k(this);
   }), Object.defineProperty(Y.prototype, "readableHighWaterMark", {
     // making it explicit this property is not enumerable
     // because otherwise some prototype manipulation in
@@ -18523,9 +18523,9 @@ function d2() {
     var S = f(B);
     if (Array.isArray(B[0]) && (B = B[0]), B.length < 2)
       throw new r("streams");
-    var T, A = B.map(function(R, P) {
-      var z = P < B.length - 1, k = P > 0;
-      return u(R, z, k, function(C) {
+    var T, A = B.map(function(R, k) {
+      var z = k < B.length - 1, P = k > 0;
+      return u(R, z, P, function(C) {
         T || (T = C), C && A.forEach(_), !z && (A.forEach(_), S(T));
       });
     });
@@ -18674,16 +18674,16 @@ function m2() {
     for (let e = 0; e < 24; ++e) {
       const r = t[0] ^ t[10] ^ t[20] ^ t[30] ^ t[40], i = t[1] ^ t[11] ^ t[21] ^ t[31] ^ t[41], o = t[2] ^ t[12] ^ t[22] ^ t[32] ^ t[42], a = t[3] ^ t[13] ^ t[23] ^ t[33] ^ t[43], u = t[4] ^ t[14] ^ t[24] ^ t[34] ^ t[44], _ = t[5] ^ t[15] ^ t[25] ^ t[35] ^ t[45], l = t[6] ^ t[16] ^ t[26] ^ t[36] ^ t[46], f = t[7] ^ t[17] ^ t[27] ^ t[37] ^ t[47], g = t[8] ^ t[18] ^ t[28] ^ t[38] ^ t[48], y = t[9] ^ t[19] ^ t[29] ^ t[39] ^ t[49];
       let B = g ^ (o << 1 | a >>> 31), I = y ^ (a << 1 | o >>> 31);
-      const S = t[0] ^ B, T = t[1] ^ I, A = t[10] ^ B, R = t[11] ^ I, P = t[20] ^ B, z = t[21] ^ I, k = t[30] ^ B, C = t[31] ^ I, N = t[40] ^ B, D = t[41] ^ I;
+      const S = t[0] ^ B, T = t[1] ^ I, A = t[10] ^ B, R = t[11] ^ I, k = t[20] ^ B, z = t[21] ^ I, P = t[30] ^ B, C = t[31] ^ I, N = t[40] ^ B, D = t[41] ^ I;
       B = r ^ (u << 1 | _ >>> 31), I = i ^ (_ << 1 | u >>> 31);
       const Y = t[2] ^ B, Z = t[3] ^ I, ft = t[12] ^ B, L = t[13] ^ I, At = t[22] ^ B, Rt = t[23] ^ I, at = t[32] ^ B, wt = t[33] ^ I, Et = t[42] ^ B, xt = t[43] ^ I;
       B = o ^ (l << 1 | f >>> 31), I = a ^ (f << 1 | l >>> 31);
       const vt = t[4] ^ B, Bt = t[5] ^ I, jt = t[14] ^ B, W = t[15] ^ I, X = t[24] ^ B, nt = t[25] ^ I, dt = t[34] ^ B, G = t[35] ^ I, M = t[44] ^ B, tt = t[45] ^ I;
       B = u ^ (g << 1 | y >>> 31), I = _ ^ (y << 1 | g >>> 31);
-      const ct = t[6] ^ B, ut = t[7] ^ I, v = t[16] ^ B, x = t[17] ^ I, et = t[26] ^ B, lt = t[27] ^ I, St = t[36] ^ B, yt = t[37] ^ I, Pt = t[46] ^ B, he = t[47] ^ I;
+      const ct = t[6] ^ B, ut = t[7] ^ I, v = t[16] ^ B, x = t[17] ^ I, et = t[26] ^ B, lt = t[27] ^ I, St = t[36] ^ B, yt = t[37] ^ I, kt = t[46] ^ B, he = t[47] ^ I;
       B = l ^ (r << 1 | i >>> 31), I = f ^ (i << 1 | r >>> 31);
-      const it = t[8] ^ B, pe = t[9] ^ I, we = t[18] ^ B, Gt = t[19] ^ I, Qt = t[28] ^ B, de = t[29] ^ I, fe = t[38] ^ B, Ee = t[39] ^ I, Se = t[48] ^ B, ae = t[49] ^ I, Ne = S, b = T, h = R << 4 | A >>> 28, w = A << 4 | R >>> 28, F = P << 3 | z >>> 29, U = z << 3 | P >>> 29, J = C << 9 | k >>> 23, st = k << 9 | C >>> 23, kt = N << 18 | D >>> 14, Vt = D << 18 | N >>> 14, qt = Y << 1 | Z >>> 31, Kt = Z << 1 | Y >>> 31, Dt = L << 12 | ft >>> 20, ei = ft << 12 | L >>> 20, Pe = At << 10 | Rt >>> 22, pi = Rt << 10 | At >>> 22, ms = wt << 13 | at >>> 19, Le = at << 13 | wt >>> 19, As = Et << 2 | xt >>> 30, m = xt << 2 | Et >>> 30, p = Bt << 30 | vt >>> 2, d = vt << 30 | Bt >>> 2, O = jt << 6 | W >>> 26, H = W << 6 | jt >>> 26, $ = nt << 11 | X >>> 21, ot = X << 11 | nt >>> 21, Ft = dt << 15 | G >>> 17, $t = G << 15 | dt >>> 17, Wt = tt << 29 | M >>> 3, Yt = M << 29 | tt >>> 3, Ht = ct << 28 | ut >>> 4, sa = ut << 28 | ct >>> 4, oa = x << 23 | v >>> 9, aa = v << 23 | x >>> 9, ca = et << 25 | lt >>> 7, ua = lt << 25 | et >>> 7, _a = St << 21 | yt >>> 11, fa = yt << 21 | St >>> 11, la = he << 24 | Pt >>> 8, ha = Pt << 24 | he >>> 8, pa = it << 27 | pe >>> 5, wa = pe << 27 | it >>> 5, da = we << 20 | Gt >>> 12, ga = Gt << 20 | we >>> 12, ya = de << 7 | Qt >>> 25, ba = Qt << 7 | de >>> 25, ma = fe << 8 | Ee >>> 24, Aa = Ee << 8 | fe >>> 24, Ea = Se << 14 | ae >>> 18, va = ae << 14 | Se >>> 18;
-      t[0] = Ne ^ ~Dt & $, t[1] = b ^ ~ei & ot, t[10] = Ht ^ ~da & F, t[11] = sa ^ ~ga & U, t[20] = qt ^ ~O & ca, t[21] = Kt ^ ~H & ua, t[30] = pa ^ ~h & Pe, t[31] = wa ^ ~w & pi, t[40] = p ^ ~oa & ya, t[41] = d ^ ~aa & ba, t[2] = Dt ^ ~$ & _a, t[3] = ei ^ ~ot & fa, t[12] = da ^ ~F & ms, t[13] = ga ^ ~U & Le, t[22] = O ^ ~ca & ma, t[23] = H ^ ~ua & Aa, t[32] = h ^ ~Pe & Ft, t[33] = w ^ ~pi & $t, t[42] = oa ^ ~ya & J, t[43] = aa ^ ~ba & st, t[4] = $ ^ ~_a & Ea, t[5] = ot ^ ~fa & va, t[14] = F ^ ~ms & Wt, t[15] = U ^ ~Le & Yt, t[24] = ca ^ ~ma & kt, t[25] = ua ^ ~Aa & Vt, t[34] = Pe ^ ~Ft & la, t[35] = pi ^ ~$t & ha, t[44] = ya ^ ~J & As, t[45] = ba ^ ~st & m, t[6] = _a ^ ~Ea & Ne, t[7] = fa ^ ~va & b, t[16] = ms ^ ~Wt & Ht, t[17] = Le ^ ~Yt & sa, t[26] = ma ^ ~kt & qt, t[27] = Aa ^ ~Vt & Kt, t[36] = Ft ^ ~la & pa, t[37] = $t ^ ~ha & wa, t[46] = J ^ ~As & p, t[47] = st ^ ~m & d, t[8] = Ea ^ ~Ne & Dt, t[9] = va ^ ~b & ei, t[18] = Wt ^ ~Ht & da, t[19] = Yt ^ ~sa & ga, t[28] = kt ^ ~qt & O, t[29] = Vt ^ ~Kt & H, t[38] = la ^ ~pa & h, t[39] = ha ^ ~wa & w, t[48] = As ^ ~p & oa, t[49] = m ^ ~d & aa, t[0] ^= n[e * 2], t[1] ^= n[e * 2 + 1];
+      const it = t[8] ^ B, pe = t[9] ^ I, we = t[18] ^ B, Gt = t[19] ^ I, Qt = t[28] ^ B, de = t[29] ^ I, fe = t[38] ^ B, Ee = t[39] ^ I, Se = t[48] ^ B, ae = t[49] ^ I, Ne = S, b = T, h = R << 4 | A >>> 28, w = A << 4 | R >>> 28, F = k << 3 | z >>> 29, U = z << 3 | k >>> 29, J = C << 9 | P >>> 23, st = P << 9 | C >>> 23, Pt = N << 18 | D >>> 14, Vt = D << 18 | N >>> 14, qt = Y << 1 | Z >>> 31, Kt = Z << 1 | Y >>> 31, Dt = L << 12 | ft >>> 20, ei = ft << 12 | L >>> 20, ke = At << 10 | Rt >>> 22, pi = Rt << 10 | At >>> 22, ms = wt << 13 | at >>> 19, Le = at << 13 | wt >>> 19, As = Et << 2 | xt >>> 30, m = xt << 2 | Et >>> 30, p = Bt << 30 | vt >>> 2, d = vt << 30 | Bt >>> 2, O = jt << 6 | W >>> 26, H = W << 6 | jt >>> 26, $ = nt << 11 | X >>> 21, ot = X << 11 | nt >>> 21, Ft = dt << 15 | G >>> 17, $t = G << 15 | dt >>> 17, Wt = tt << 29 | M >>> 3, Yt = M << 29 | tt >>> 3, Ht = ct << 28 | ut >>> 4, sa = ut << 28 | ct >>> 4, oa = x << 23 | v >>> 9, aa = v << 23 | x >>> 9, ca = et << 25 | lt >>> 7, ua = lt << 25 | et >>> 7, _a = St << 21 | yt >>> 11, fa = yt << 21 | St >>> 11, la = he << 24 | kt >>> 8, ha = kt << 24 | he >>> 8, pa = it << 27 | pe >>> 5, wa = pe << 27 | it >>> 5, da = we << 20 | Gt >>> 12, ga = Gt << 20 | we >>> 12, ya = de << 7 | Qt >>> 25, ba = Qt << 7 | de >>> 25, ma = fe << 8 | Ee >>> 24, Aa = Ee << 8 | fe >>> 24, Ea = Se << 14 | ae >>> 18, va = ae << 14 | Se >>> 18;
+      t[0] = Ne ^ ~Dt & $, t[1] = b ^ ~ei & ot, t[10] = Ht ^ ~da & F, t[11] = sa ^ ~ga & U, t[20] = qt ^ ~O & ca, t[21] = Kt ^ ~H & ua, t[30] = pa ^ ~h & ke, t[31] = wa ^ ~w & pi, t[40] = p ^ ~oa & ya, t[41] = d ^ ~aa & ba, t[2] = Dt ^ ~$ & _a, t[3] = ei ^ ~ot & fa, t[12] = da ^ ~F & ms, t[13] = ga ^ ~U & Le, t[22] = O ^ ~ca & ma, t[23] = H ^ ~ua & Aa, t[32] = h ^ ~ke & Ft, t[33] = w ^ ~pi & $t, t[42] = oa ^ ~ya & J, t[43] = aa ^ ~ba & st, t[4] = $ ^ ~_a & Ea, t[5] = ot ^ ~fa & va, t[14] = F ^ ~ms & Wt, t[15] = U ^ ~Le & Yt, t[24] = ca ^ ~ma & Pt, t[25] = ua ^ ~Aa & Vt, t[34] = ke ^ ~Ft & la, t[35] = pi ^ ~$t & ha, t[44] = ya ^ ~J & As, t[45] = ba ^ ~st & m, t[6] = _a ^ ~Ea & Ne, t[7] = fa ^ ~va & b, t[16] = ms ^ ~Wt & Ht, t[17] = Le ^ ~Yt & sa, t[26] = ma ^ ~Pt & qt, t[27] = Aa ^ ~Vt & Kt, t[36] = Ft ^ ~la & pa, t[37] = $t ^ ~ha & wa, t[46] = J ^ ~As & p, t[47] = st ^ ~m & d, t[8] = Ea ^ ~Ne & Dt, t[9] = va ^ ~b & ei, t[18] = Wt ^ ~Ht & da, t[19] = Yt ^ ~sa & ga, t[28] = Pt ^ ~qt & O, t[29] = Vt ^ ~Kt & H, t[38] = la ^ ~pa & h, t[39] = ha ^ ~wa & w, t[48] = As ^ ~p & oa, t[49] = m ^ ~d & aa, t[0] ^= n[e * 2], t[1] ^= n[e * 2 + 1];
     }
   }, ou;
 }
@@ -18787,39 +18787,39 @@ function R2() {
               throw new i("retryOn property expects an array or function");
           return new Promise(function(I, S) {
             var T = function(R) {
-              var P = typeof Request < "u" && l instanceof Request ? l.clone() : l;
-              o(P, f).then(function(z) {
+              var k = typeof Request < "u" && l instanceof Request ? l.clone() : l;
+              o(k, f).then(function(z) {
                 if (Array.isArray(B) && B.indexOf(z.status) === -1)
                   I(z);
                 else if (typeof B == "function")
                   try {
-                    return Promise.resolve(B(R, null, z)).then(function(k) {
-                      k ? A(R, null, z) : I(z);
+                    return Promise.resolve(B(R, null, z)).then(function(P) {
+                      P ? A(R, null, z) : I(z);
                     }).catch(S);
-                  } catch (k) {
-                    S(k);
+                  } catch (P) {
+                    S(P);
                   }
                 else
                   R < g ? A(R, null, z) : I(z);
               }).catch(function(z) {
                 if (typeof B == "function")
                   try {
-                    Promise.resolve(B(R, z, null)).then(function(k) {
-                      k ? A(R, z, null) : S(z);
-                    }).catch(function(k) {
-                      S(k);
+                    Promise.resolve(B(R, z, null)).then(function(P) {
+                      P ? A(R, z, null) : S(z);
+                    }).catch(function(P) {
+                      S(P);
                     });
-                  } catch (k) {
-                    S(k);
+                  } catch (P) {
+                    S(P);
                   }
                 else R < g ? A(R, z, null) : S(z);
               });
             };
-            function A(R, P, z) {
-              var k = typeof y == "function" ? y(R, P, z) : y;
+            function A(R, k, z) {
+              var P = typeof y == "function" ? y(R, k, z) : y;
               setTimeout(function() {
                 T(++R);
-              }, k);
+              }, P);
             }
             T(0);
           });
@@ -18857,7 +18857,7 @@ xg(self, "wasm_bindgen_worker_init").then(async ({ init: n, receiver: t }) => {
   });
   await e.default(n), postMessage({ type: "wasm_bindgen_worker_ready" }), e.wbg_rayon_start_worker(t);
 });
-async function P2(n, t, e) {
+async function k2(n, t, e) {
   if (e.numThreads() === 0)
     throw new Error("num_threads must be > 0.");
   const r = {
@@ -18888,7 +18888,7 @@ async function P2(n, t, e) {
   ), e.build();
 }
 let s;
-function Ps(n) {
+function ks(n) {
   const t = s.__externref_table_alloc();
   return s.__wbindgen_export_2.set(t, n), t;
 }
@@ -18896,7 +18896,7 @@ function Vi(n, t) {
   try {
     return n.apply(this, t);
   } catch (e) {
-    const r = Ps(e);
+    const r = ks(e);
     s.__wbindgen_exn_store(r);
   }
 }
@@ -18904,9 +18904,9 @@ const Rg = typeof TextDecoder < "u" ? new TextDecoder("utf-8", { ignoreBOM: !0,
   throw Error("TextDecoder not available");
 } };
 typeof TextDecoder < "u" && Rg.decode();
-let ks = null;
+let Ps = null;
 function ts() {
-  return (ks === null || ks.buffer !== s.memory.buffer) && (ks = new Uint8Array(s.memory.buffer)), ks;
+  return (Ps === null || Ps.buffer !== s.memory.buffer) && (Ps = new Uint8Array(s.memory.buffer)), Ps;
 }
 function xs(n, t) {
   return n = n >>> 0, Rg.decode(ts().slice(n, n + t));
@@ -18914,7 +18914,7 @@ function xs(n, t) {
 let j = 0;
 const zg = typeof TextEncoder < "u" ? new TextEncoder("utf-8") : { encode: () => {
   throw Error("TextEncoder not available");
-} }, k2 = function(n, t) {
+} }, P2 = function(n, t) {
   const e = zg.encode(n);
   return t.set(e), {
     read: n.length,
@@ -18936,7 +18936,7 @@ function go(n, t, e) {
   }
   if (a !== r) {
     a !== 0 && (n = n.slice(a)), i = e(i, r, r = a + n.length * 3, 1) >>> 0;
-    const u = ts().subarray(i + a, i + r), _ = k2(n, u);
+    const u = ts().subarray(i + a, i + r), _ = P2(n, u);
     a += _.written, i = e(i, r, a, 1) >>> 0;
   }
   return j = a, i;
@@ -20101,7 +20101,7 @@ class ls {
     const e = s.compactciphertextlistexpander_get_uint248(this.__wbg_ptr, t);
     if (e[2])
       throw c(e[1]);
-    return Pn.__wrap(e[0]);
+    return kn.__wrap(e[0]);
   }
   /**
    * @param {number} index
@@ -20111,7 +20111,7 @@ class ls {
     const e = s.compactciphertextlistexpander_get_uint256(this.__wbg_ptr, t);
     if (e[2])
       throw c(e[1]);
-    return kn.__wrap(e[0]);
+    return Pn.__wrap(e[0]);
   }
   /**
    * @param {number} index
@@ -20421,7 +20421,7 @@ class ls {
     const e = s.compactciphertextlistexpander_get_int176(this.__wbg_ptr, t);
     if (e[2])
       throw c(e[1]);
-    return Pr.__wrap(e[0]);
+    return kr.__wrap(e[0]);
   }
   /**
    * @param {number} index
@@ -20431,7 +20431,7 @@ class ls {
     const e = s.compactciphertextlistexpander_get_int184(this.__wbg_ptr, t);
     if (e[2])
       throw c(e[1]);
-    return kr.__wrap(e[0]);
+    return Pr.__wrap(e[0]);
   }
   /**
    * @param {number} index
@@ -22489,10 +22489,10 @@ class Sr {
 const vh = typeof FinalizationRegistry > "u" ? { register: () => {
 }, unregister: () => {
 } } : new FinalizationRegistry((n) => s.__wbg_fheint176_free(n >>> 0, 1));
-class Pr {
+class kr {
   static __wrap(t) {
     t = t >>> 0;
-    const e = Object.create(Pr.prototype);
+    const e = Object.create(kr.prototype);
     return e.__wbg_ptr = t, vh.register(e, e.__wbg_ptr, e), e;
   }
   __destroy_into_raw() {
@@ -22513,7 +22513,7 @@ class Pr {
     const r = s.fheint176_encrypt_with_client_key(t, e.__wbg_ptr);
     if (r[2])
       throw c(r[1]);
-    return Pr.__wrap(r[0]);
+    return kr.__wrap(r[0]);
   }
   /**
    * @param {any} value
@@ -22525,7 +22525,7 @@ class Pr {
     const r = s.fheint176_encrypt_with_public_key(t, e.__wbg_ptr);
     if (r[2])
       throw c(r[1]);
-    return Pr.__wrap(r[0]);
+    return kr.__wrap(r[0]);
   }
   /**
    * @param {any} value
@@ -22537,7 +22537,7 @@ class Pr {
     const r = s.fheint176_encrypt_with_compressed_public_key(t, e.__wbg_ptr);
     if (r[2])
       throw c(r[1]);
-    return Pr.__wrap(r[0]);
+    return kr.__wrap(r[0]);
   }
   /**
    * @param {TfheClientKey} client_key
@@ -22568,7 +22568,7 @@ class Pr {
     const e = q(t, s.__wbindgen_malloc), r = j, i = s.fheint176_deserialize(e, r);
     if (i[2])
       throw c(i[1]);
-    return Pr.__wrap(i[0]);
+    return kr.__wrap(i[0]);
   }
   /**
    * @param {bigint} serialized_size_limit
@@ -22590,16 +22590,16 @@ class Pr {
     const r = q(t, s.__wbindgen_malloc), i = j, o = s.fheint176_safe_deserialize(r, i, e);
     if (o[2])
       throw c(o[1]);
-    return Pr.__wrap(o[0]);
+    return kr.__wrap(o[0]);
   }
 }
 const xh = typeof FinalizationRegistry > "u" ? { register: () => {
 }, unregister: () => {
 } } : new FinalizationRegistry((n) => s.__wbg_fheint184_free(n >>> 0, 1));
-class kr {
+class Pr {
   static __wrap(t) {
     t = t >>> 0;
-    const e = Object.create(kr.prototype);
+    const e = Object.create(Pr.prototype);
     return e.__wbg_ptr = t, xh.register(e, e.__wbg_ptr, e), e;
   }
   __destroy_into_raw() {
@@ -22620,7 +22620,7 @@ class kr {
     const r = s.fheint184_encrypt_with_client_key(t, e.__wbg_ptr);
     if (r[2])
       throw c(r[1]);
-    return kr.__wrap(r[0]);
+    return Pr.__wrap(r[0]);
   }
   /**
    * @param {any} value
@@ -22632,7 +22632,7 @@ class kr {
     const r = s.fheint184_encrypt_with_public_key(t, e.__wbg_ptr);
     if (r[2])
       throw c(r[1]);
-    return kr.__wrap(r[0]);
+    return Pr.__wrap(r[0]);
   }
   /**
    * @param {any} value
@@ -22644,7 +22644,7 @@ class kr {
     const r = s.fheint184_encrypt_with_compressed_public_key(t, e.__wbg_ptr);
     if (r[2])
       throw c(r[1]);
-    return kr.__wrap(r[0]);
+    return Pr.__wrap(r[0]);
   }
   /**
    * @param {TfheClientKey} client_key
@@ -22675,7 +22675,7 @@ class kr {
     const e = q(t, s.__wbindgen_malloc), r = j, i = s.fheint184_deserialize(e, r);
     if (i[2])
       throw c(i[1]);
-    return kr.__wrap(i[0]);
+    return Pr.__wrap(i[0]);
   }
   /**
    * @param {bigint} serialized_size_limit
@@ -22697,7 +22697,7 @@ class kr {
     const r = q(t, s.__wbindgen_malloc), i = j, o = s.fheint184_safe_deserialize(r, i, e);
     if (o[2])
       throw c(o[1]);
-    return kr.__wrap(o[0]);
+    return Pr.__wrap(o[0]);
   }
 }
 const Rh = typeof FinalizationRegistry > "u" ? { register: () => {
@@ -23128,18 +23128,18 @@ class Tr {
     return Tr.__wrap(o[0]);
   }
 }
-const Ph = typeof FinalizationRegistry > "u" ? { register: () => {
+const kh = typeof FinalizationRegistry > "u" ? { register: () => {
 }, unregister: () => {
 } } : new FinalizationRegistry((n) => s.__wbg_fheint208_free(n >>> 0, 1));
 class Cr {
   static __wrap(t) {
     t = t >>> 0;
     const e = Object.create(Cr.prototype);
-    return e.__wbg_ptr = t, Ph.register(e, e.__wbg_ptr, e), e;
+    return e.__wbg_ptr = t, kh.register(e, e.__wbg_ptr, e), e;
   }
   __destroy_into_raw() {
     const t = this.__wbg_ptr;
-    return this.__wbg_ptr = 0, Ph.unregister(this), t;
+    return this.__wbg_ptr = 0, kh.unregister(this), t;
   }
   free() {
     const t = this.__destroy_into_raw();
@@ -23235,18 +23235,18 @@ class Cr {
     return Cr.__wrap(o[0]);
   }
 }
-const kh = typeof FinalizationRegistry > "u" ? { register: () => {
+const Ph = typeof FinalizationRegistry > "u" ? { register: () => {
 }, unregister: () => {
 } } : new FinalizationRegistry((n) => s.__wbg_fheint216_free(n >>> 0, 1));
 class Nr {
   static __wrap(t) {
     t = t >>> 0;
     const e = Object.create(Nr.prototype);
-    return e.__wbg_ptr = t, kh.register(e, e.__wbg_ptr, e), e;
+    return e.__wbg_ptr = t, Ph.register(e, e.__wbg_ptr, e), e;
   }
   __destroy_into_raw() {
     const t = this.__wbg_ptr;
-    return this.__wbg_ptr = 0, kh.unregister(this), t;
+    return this.__wbg_ptr = 0, Ph.unregister(this), t;
   }
   free() {
     const t = this.__destroy_into_raw();
@@ -28160,10 +28160,10 @@ class Sn {
 const Ep = typeof FinalizationRegistry > "u" ? { register: () => {
 }, unregister: () => {
 } } : new FinalizationRegistry((n) => s.__wbg_fheuint248_free(n >>> 0, 1));
-class Pn {
+class kn {
   static __wrap(t) {
     t = t >>> 0;
-    const e = Object.create(Pn.prototype);
+    const e = Object.create(kn.prototype);
     return e.__wbg_ptr = t, Ep.register(e, e.__wbg_ptr, e), e;
   }
   __destroy_into_raw() {
@@ -28184,7 +28184,7 @@ class Pn {
     const r = s.fheuint248_encrypt_with_client_key(t, e.__wbg_ptr);
     if (r[2])
       throw c(r[1]);
-    return Pn.__wrap(r[0]);
+    return kn.__wrap(r[0]);
   }
   /**
    * @param {any} value
@@ -28196,7 +28196,7 @@ class Pn {
     const r = s.fheuint248_encrypt_with_public_key(t, e.__wbg_ptr);
     if (r[2])
       throw c(r[1]);
-    return Pn.__wrap(r[0]);
+    return kn.__wrap(r[0]);
   }
   /**
    * @param {any} value
@@ -28208,7 +28208,7 @@ class Pn {
     const r = s.fheuint248_encrypt_with_compressed_public_key(t, e.__wbg_ptr);
     if (r[2])
       throw c(r[1]);
-    return Pn.__wrap(r[0]);
+    return kn.__wrap(r[0]);
   }
   /**
    * @param {TfheClientKey} client_key
@@ -28239,7 +28239,7 @@ class Pn {
     const e = q(t, s.__wbindgen_malloc), r = j, i = s.fheuint248_deserialize(e, r);
     if (i[2])
       throw c(i[1]);
-    return Pn.__wrap(i[0]);
+    return kn.__wrap(i[0]);
   }
   /**
    * @param {bigint} serialized_size_limit
@@ -28261,16 +28261,16 @@ class Pn {
     const r = q(t, s.__wbindgen_malloc), i = j, o = s.fheuint248_safe_deserialize(r, i, e);
     if (o[2])
       throw c(o[1]);
-    return Pn.__wrap(o[0]);
+    return kn.__wrap(o[0]);
   }
 }
 const vp = typeof FinalizationRegistry > "u" ? { register: () => {
 }, unregister: () => {
 } } : new FinalizationRegistry((n) => s.__wbg_fheuint256_free(n >>> 0, 1));
-class kn {
+class Pn {
   static __wrap(t) {
     t = t >>> 0;
-    const e = Object.create(kn.prototype);
+    const e = Object.create(Pn.prototype);
     return e.__wbg_ptr = t, vp.register(e, e.__wbg_ptr, e), e;
   }
   __destroy_into_raw() {
@@ -28291,7 +28291,7 @@ class kn {
     const r = s.fheuint256_encrypt_with_client_key(t, e.__wbg_ptr);
     if (r[2])
       throw c(r[1]);
-    return kn.__wrap(r[0]);
+    return Pn.__wrap(r[0]);
   }
   /**
    * @param {any} value
@@ -28303,7 +28303,7 @@ class kn {
     const r = s.fheuint256_encrypt_with_public_key(t, e.__wbg_ptr);
     if (r[2])
       throw c(r[1]);
-    return kn.__wrap(r[0]);
+    return Pn.__wrap(r[0]);
   }
   /**
    * @param {any} value
@@ -28315,7 +28315,7 @@ class kn {
     const r = s.fheuint256_encrypt_with_compressed_public_key(t, e.__wbg_ptr);
     if (r[2])
       throw c(r[1]);
-    return kn.__wrap(r[0]);
+    return Pn.__wrap(r[0]);
   }
   /**
    * @param {TfheClientKey} client_key
@@ -28346,7 +28346,7 @@ class kn {
     const e = q(t, s.__wbindgen_malloc), r = j, i = s.fheuint256_deserialize(e, r);
     if (i[2])
       throw c(i[1]);
-    return kn.__wrap(i[0]);
+    return Pn.__wrap(i[0]);
   }
   /**
    * @param {bigint} serialized_size_limit
@@ -28368,7 +28368,7 @@ class kn {
     const r = q(t, s.__wbindgen_malloc), i = j, o = s.fheuint256_safe_deserialize(r, i, e);
     if (o[2])
       throw c(o[1]);
-    return kn.__wrap(o[0]);
+    return Pn.__wrap(o[0]);
   }
 }
 const xp = typeof FinalizationRegistry > "u" ? { register: () => {
@@ -28906,18 +28906,18 @@ class Cn {
     return Cn.__wrap(o[0]);
   }
 }
-const Pp = typeof FinalizationRegistry > "u" ? { register: () => {
+const kp = typeof FinalizationRegistry > "u" ? { register: () => {
 }, unregister: () => {
 } } : new FinalizationRegistry((n) => s.__wbg_fheuint56_free(n >>> 0, 1));
 class Nn {
   static __wrap(t) {
     t = t >>> 0;
     const e = Object.create(Nn.prototype);
-    return e.__wbg_ptr = t, Pp.register(e, e.__wbg_ptr, e), e;
+    return e.__wbg_ptr = t, kp.register(e, e.__wbg_ptr, e), e;
   }
   __destroy_into_raw() {
     const t = this.__wbg_ptr;
-    return this.__wbg_ptr = 0, Pp.unregister(this), t;
+    return this.__wbg_ptr = 0, kp.unregister(this), t;
   }
   free() {
     const t = this.__destroy_into_raw();
@@ -29013,18 +29013,18 @@ class Nn {
     return Nn.__wrap(o[0]);
   }
 }
-const kp = typeof FinalizationRegistry > "u" ? { register: () => {
+const Pp = typeof FinalizationRegistry > "u" ? { register: () => {
 }, unregister: () => {
 } } : new FinalizationRegistry((n) => s.__wbg_fheuint6_free(n >>> 0, 1));
 class Ln {
   static __wrap(t) {
     t = t >>> 0;
     const e = Object.create(Ln.prototype);
-    return e.__wbg_ptr = t, kp.register(e, e.__wbg_ptr, e), e;
+    return e.__wbg_ptr = t, Pp.register(e, e.__wbg_ptr, e), e;
   }
   __destroy_into_raw() {
     const t = this.__wbg_ptr;
-    return this.__wbg_ptr = 0, kp.unregister(this), t;
+    return this.__wbg_ptr = 0, Pp.unregister(this), t;
   }
   free() {
     const t = this.__destroy_into_raw();
@@ -30410,19 +30410,19 @@ function O2() {
     const r = e.stack, i = go(r, s.__wbindgen_malloc, s.__wbindgen_realloc), o = j;
     nr().setInt32(t + 4 * 1, o, !0), nr().setInt32(t + 4 * 0, i, !0);
   }, n.wbg.__wbg_startWorkers_2ca11761e08ff5d5 = function(t, e, r) {
-    return P2(t, e, na.__wrap(r));
+    return k2(t, e, na.__wrap(r));
   }, n.wbg.__wbg_static_accessor_GLOBAL_88a902d13a557d07 = function() {
     const t = typeof Co > "u" ? null : Co;
-    return di(t) ? 0 : Ps(t);
+    return di(t) ? 0 : ks(t);
   }, n.wbg.__wbg_static_accessor_GLOBAL_THIS_56578be7e9f832b0 = function() {
     const t = typeof globalThis > "u" ? null : globalThis;
-    return di(t) ? 0 : Ps(t);
+    return di(t) ? 0 : ks(t);
   }, n.wbg.__wbg_static_accessor_SELF_37c5d418e4bf5819 = function() {
     const t = typeof self > "u" ? null : self;
-    return di(t) ? 0 : Ps(t);
+    return di(t) ? 0 : ks(t);
   }, n.wbg.__wbg_static_accessor_WINDOW_5de37043a91a9c40 = function() {
     const t = typeof window > "u" ? null : window;
-    return di(t) ? 0 : Ps(t);
+    return di(t) ? 0 : ks(t);
   }, n.wbg.__wbg_subarray_aa9065fa9dc5df96 = function(t, e, r) {
     return t.subarray(e >>> 0, r >>> 0);
   }, n.wbg.__wbg_toString_2f76f493957b63da = function(t, e, r) {
@@ -30491,10 +30491,10 @@ function O2() {
   }, n;
 }
 function T2(n, t) {
-  n.wbg.memory = t || new WebAssembly.Memory({ initial: 20, maximum: 16384, shared: !0 });
+  n.wbg.memory = t || new WebAssembly.Memory({ initial: 21, maximum: 16384, shared: !0 });
 }
 function C2(n, t, e) {
-  if (s = n.exports, ro.__wbindgen_wasm_module = t, Fs = null, ks = null, typeof e < "u" && (typeof e != "number" || e === 0 || e % 65536 !== 0))
+  if (s = n.exports, ro.__wbindgen_wasm_module = t, Fs = null, Ps = null, typeof e < "u" && (typeof e != "number" || e === 0 || e % 65536 !== 0))
     throw "invalid stack size";
   return s.__wbindgen_start(e), s;
 }
@@ -30532,8 +30532,8 @@ var N2 = /* @__PURE__ */ Object.freeze({
   FheInt16: zr,
   FheInt160: Br,
   FheInt168: Sr,
-  FheInt176: Pr,
-  FheInt184: kr,
+  FheInt176: kr,
+  FheInt184: Pr,
   FheInt192: Fr,
   FheInt2: Ir,
   FheInt200: Or,
@@ -30585,8 +30585,8 @@ var N2 = /* @__PURE__ */ Object.freeze({
   FheUint232: zn,
   FheUint24: Bn,
   FheUint240: Sn,
-  FheUint248: Pn,
-  FheUint256: kn,
+  FheUint248: kn,
+  FheUint256: Pn,
   FheUint32: Fn,
   FheUint4: In,
   FheUint40: On,
@@ -30734,7 +30734,7 @@ function D2(n, t) {
     throw Ui(i[1]);
   return ps.__wrap(i[0]);
 }
-function Pg(n, t) {
+function kg(n, t) {
   const e = t(n.length * 4, 4) >>> 0;
   for (let r = 0; r < n.length; r++) {
     const i = Wi(n[r]);
@@ -30743,12 +30743,12 @@ function Pg(n, t) {
   return ee = n.length, e;
 }
 function U2(n, t, e) {
-  const r = Pg(n, rt.__wbindgen_malloc), i = ee, o = Si(t, rt.__wbindgen_malloc, rt.__wbindgen_realloc), a = ee, u = Si(e, rt.__wbindgen_malloc, rt.__wbindgen_realloc), _ = ee, l = rt.new_client(r, i, o, a, u, _);
+  const r = kg(n, rt.__wbindgen_malloc), i = ee, o = Si(t, rt.__wbindgen_malloc, rt.__wbindgen_realloc), a = ee, u = Si(e, rt.__wbindgen_malloc, rt.__wbindgen_realloc), _ = ee, l = rt.new_client(r, i, o, a, u, _);
   if (l[2])
     throw Ui(l[1]);
   return ia.__wrap(l[0]);
 }
-function kg(n, t) {
+function Pg(n, t) {
   n = n >>> 0;
   const e = Ue(), r = [];
   for (let i = n; i < n + 4 * t; i += 4)
@@ -30797,7 +30797,7 @@ function Q2(n, t, e, r, i, o, a) {
   const u = rt.process_user_decryption_resp_from_js(n.__wbg_ptr, t, e, r, i.__wbg_ptr, o.__wbg_ptr, a);
   if (u[3])
     throw Ui(u[2]);
-  var _ = kg(u[0], u[1]).slice();
+  var _ = Pg(u[0], u[1]).slice();
   return rt.__wbindgen_free(u[0], u[1] * 4, 4), _;
 }
 typeof FinalizationRegistry > "u" || new FinalizationRegistry((n) => rt.__wbg_ciphertexthandle_free(n >>> 0, 1));
@@ -30819,12 +30819,11 @@ class ia {
     rt.__wbg_client_free(t, 0);
   }
 }
-typeof FinalizationRegistry > "u" || new FinalizationRegistry((n) => rt.__wbg_cryptoboxct_free(n >>> 0, 1));
 typeof FinalizationRegistry > "u" || new FinalizationRegistry((n) => rt.__wbg_eip712domainmsg_free(n >>> 0, 1));
 typeof FinalizationRegistry > "u" || new FinalizationRegistry((n) => rt.__wbg_parseduserdecryptionrequest_free(n >>> 0, 1));
 const Qp = typeof FinalizationRegistry > "u" ? { register: () => {
 }, unregister: () => {
-} } : new FinalizationRegistry((n) => rt.__wbg_privateenckey_free(n >>> 0, 1));
+} } : new FinalizationRegistry((n) => rt.__wbg_privateenckeymlkem512_free(n >>> 0, 1));
 class Mi {
   static __wrap(t) {
     t = t >>> 0;
@@ -30837,13 +30836,13 @@ class Mi {
   }
   free() {
     const t = this.__destroy_into_raw();
-    rt.__wbg_privateenckey_free(t, 0);
+    rt.__wbg_privateenckeymlkem512_free(t, 0);
   }
 }
 typeof FinalizationRegistry > "u" || new FinalizationRegistry((n) => rt.__wbg_privatesigkey_free(n >>> 0, 1));
 const Kp = typeof FinalizationRegistry > "u" ? { register: () => {
 }, unregister: () => {
-} } : new FinalizationRegistry((n) => rt.__wbg_publicenckey_free(n >>> 0, 1));
+} } : new FinalizationRegistry((n) => rt.__wbg_publicenckeymlkem512_free(n >>> 0, 1));
 class bs {
   static __wrap(t) {
     t = t >>> 0;
@@ -30856,7 +30855,7 @@ class bs {
   }
   free() {
     const t = this.__destroy_into_raw();
-    rt.__wbg_publicenckey_free(t, 0);
+    rt.__wbg_publicenckeymlkem512_free(t, 0);
   }
 }
 typeof FinalizationRegistry > "u" || new FinalizationRegistry((n) => rt.__wbg_publicsigkey_free(n >>> 0, 1));
@@ -31253,7 +31252,7 @@ class No {
    */
   get signcrypted_ciphertexts() {
     const t = rt.__wbg_get_userdecryptionresponsepayload_signcrypted_ciphertexts(this.__wbg_ptr);
-    var e = kg(t[0], t[1]).slice();
+    var e = Pg(t[0], t[1]).slice();
     return rt.__wbindgen_free(t[0], t[1] * 4, 4), e;
   }
   /**
@@ -31263,7 +31262,7 @@ class No {
    * @param {TypedSigncryptedCiphertext[]} arg0
    */
   set signcrypted_ciphertexts(t) {
-    const e = Pg(t, rt.__wbindgen_malloc), r = ee;
+    const e = kg(t, rt.__wbindgen_malloc), r = ee;
     rt.__wbg_set_userdecryptionresponsepayload_signcrypted_ciphertexts(this.__wbg_ptr, e, r);
   }
   /**
@@ -31912,13 +31911,13 @@ const lA = (n, t, e, r, i, o, a, u) => async (_, l, f, g, y, B, I, S) => {
   } catch (L) {
     throw new Error("Invalid public or private key", { cause: L });
   }
-  const R = g.replace(/^(0x)/, ""), P = f.replace(/^(0x)/, ""), z = _.map((L) => ({
+  const R = g.replace(/^(0x)/, ""), k = f.replace(/^(0x)/, ""), z = _.map((L) => ({
     handle: typeof L.handle == "string" ? _r(He(L.handle), !0) : _r(L.handle, !0),
     contractAddress: Ro(L.contractAddress)
   }));
   Mg(z.map((L) => L.handle)), fA(BigInt(I), BigInt(S));
-  const k = new Ze(i, cA, a), C = z.map(async ({ handle: L, contractAddress: At }) => {
-    const Rt = await k.persistAllowed(L, B), at = await k.persistAllowed(L, At);
+  const P = new Ze(i, cA, a), C = z.map(async ({ handle: L, contractAddress: At }) => {
+    const Rt = await P.persistAllowed(L, B), at = await P.persistAllowed(L, At);
     if (!Rt)
       throw new Error(`User ${B} is not authorized to user decrypt handle ${L}!`);
     if (!at)
@@ -31946,7 +31945,7 @@ const lA = (n, t, e, r, i, o, a, u) => async (_, l, f, g, y, B, I, S) => {
     contractAddresses: y.map((L) => Ro(L)),
     userAddress: Ro(B),
     signature: R,
-    publicKey: P
+    publicKey: k
   }, Y = await d_("USER_DECRYPT", `${o}/v1/user-decrypt`, D, u);
   let Z = n.map((L, At) => TKMS.new_server_id_addr(At + 1, L));
   const ft = TKMS.new_client(Z, B, "default");
@@ -31962,7 +31961,7 @@ const lA = (n, t, e, r, i, o, a, u) => async (_, l, f, g, y, B, I, S) => {
     }, wt = {
       signature: R,
       client_address: B,
-      enc_key: P,
+      enc_key: k,
       ciphertext_handles: z.map((Bt) => Bt.handle.replace(/^0x/, "")),
       eip712_verifying_contract: r
     }, xt = TKMS.process_user_decryption_resp_from_js(ft, wt, at, Y.response, T, A, !0).map((Bt) => xo(Bt.bytes));
@@ -32047,7 +32046,7 @@ const lA = (n, t, e, r, i, o, a, u) => async (_, l, f, g, y, B, I, S) => {
     },
     encrypt() {
       const y = (() => {
-        const z = (D) => Object.keys(D), k = u.reduce((D, Y) => D + Y, 0), C = z(r), N = C.find((D) => Number(D) >= k);
+        const z = (D) => Object.keys(D), P = u.reduce((D, Y) => D + Y, 0), C = z(r), N = C.find((D) => Number(D) >= P);
         if (!N)
           throw new Error(`Too many bits in provided values. Maximum is ${C[C.length - 1]}.`);
         return N;
@@ -32157,7 +32156,7 @@ const mA = (n, t, e, r, i, o, a, u, _) => (l, f) => {
             throw new Error(`Incorrect Handle ${ft}: (expected) ${Rt} != ${at} (received)`);
         }
       }
-      const R = T.response.signatures, P = {
+      const R = T.response.signatures, k = {
         name: "InputVerification",
         version: "1",
         chainId: r,
@@ -32169,16 +32168,16 @@ const mA = (n, t, e, r, i, o, a, u, _) => (l, f) => {
           { name: "contractAddress", type: "address" },
           { name: "contractChainId", type: "uint256" }
         ]
-      }, k = R.map((Z) => {
+      }, P = R.map((Z) => {
         const ft = Z.startsWith("0x") ? Z : `0x${Z}`;
-        return Rd(P, z, {
+        return Rd(k, z, {
           ctHandles: A,
           userAddress: f,
           contractAddress: l,
           contractChainId: e
         }, ft);
       });
-      if (!yA(u, k, _))
+      if (!yA(u, P, _))
         throw Error("Coprocessor signers threshold is not reached");
       let N = Xp(A.length);
       const D = R.length;
@@ -32230,14 +32229,14 @@ const RA = (n, t, e, r, i, o, a, u) => async (_) => {
   const l = new Ze(i, AA, a);
   let f;
   try {
-    f = await Promise.all(_.map(async (k) => {
-      const C = _r(typeof k == "string" ? He(k) : k, !0);
+    f = await Promise.all(_.map(async (P) => {
+      const C = _r(typeof P == "string" ? He(P) : P, !0);
       if (!await l.isAllowedForDecryption(C))
         throw new Error(`Handle ${C} is not allowed for public decryption!`);
       return C;
     }));
-  } catch (k) {
-    throw k;
+  } catch (P) {
+    throw P;
   }
   Mg(f);
   const g = {
@@ -32252,8 +32251,8 @@ const RA = (n, t, e, r, i, o, a, u) => async (_) => {
       { name: "ctHandles", type: "bytes32[]" },
       { name: "decryptedResult", type: "bytes" }
     ]
-  }, S = y.response[0], T = S.decrypted_value.startsWith("0x") ? S.decrypted_value : `0x${S.decrypted_value}`, R = S.signatures.map((k) => {
-    const C = k.startsWith("0x") ? k : `0x${k}`;
+  }, S = y.response[0], T = S.decrypted_value.startsWith("0x") ? S.decrypted_value : `0x${S.decrypted_value}`, R = S.signatures.map((P) => {
+    const C = P.startsWith("0x") ? P : `0x${P}`;
     return Rd(B, I, { ctHandles: f, decryptedResult: T }, C);
   });
   if (!EA(n, R, t))