@zama-fhe/relayer-sdk 0.3.0-0 → 0.3.0-1

package/bundle/relayer-sdk-js.js

@@ -3,11 +3,11 @@ var sw = {}, Lo = {};
 Lo.byteLength = Hg;
 Lo.toByteArray = qg;
 Lo.fromByteArray = Wg;
-var ar = [], Me = [], jg = typeof Uint8Array < "u" ? Uint8Array : Array, xa = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+var ar = [], je = [], jg = typeof Uint8Array < "u" ? Uint8Array : Array, xa = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
 for (var ji = 0, Gg = xa.length; ji < Gg; ++ji)
-  ar[ji] = xa[ji], Me[xa.charCodeAt(ji)] = ji;
-Me[45] = 62;
-Me[95] = 63;
+  ar[ji] = xa[ji], je[xa.charCodeAt(ji)] = ji;
+je[45] = 62;
+je[95] = 63;
 function ow(n) {
   var t = n.length;
   if (t % 4 > 0)
@@ -27,8 +27,8 @@ function Vg(n, t, e) {
 function qg(n) {
   var t, e = ow(n), r = e[0], i = e[1], o = new jg(Vg(n, r, i)), a = 0, u = i > 0 ? r - 4 : r, _;
   for (_ = 0; _ < u; _ += 4)
-    t = Me[n.charCodeAt(_)] << 18 | Me[n.charCodeAt(_ + 1)] << 12 | Me[n.charCodeAt(_ + 2)] << 6 | Me[n.charCodeAt(_ + 3)], o[a++] = t >> 16 & 255, o[a++] = t >> 8 & 255, o[a++] = t & 255;
-  return i === 2 && (t = Me[n.charCodeAt(_)] << 2 | Me[n.charCodeAt(_ + 1)] >> 4, o[a++] = t & 255), i === 1 && (t = Me[n.charCodeAt(_)] << 10 | Me[n.charCodeAt(_ + 1)] << 4 | Me[n.charCodeAt(_ + 2)] >> 2, o[a++] = t >> 8 & 255, o[a++] = t & 255), o;
+    t = je[n.charCodeAt(_)] << 18 | je[n.charCodeAt(_ + 1)] << 12 | je[n.charCodeAt(_ + 2)] << 6 | je[n.charCodeAt(_ + 3)], o[a++] = t >> 16 & 255, o[a++] = t >> 8 & 255, o[a++] = t & 255;
+  return i === 2 && (t = je[n.charCodeAt(_)] << 2 | je[n.charCodeAt(_ + 1)] >> 4, o[a++] = t & 255), i === 1 && (t = je[n.charCodeAt(_)] << 10 | je[n.charCodeAt(_ + 1)] << 4 | je[n.charCodeAt(_ + 2)] >> 2, o[a++] = t >> 8 & 255, o[a++] = t & 255), o;
 }
 function Qg(n) {
   return ar[n >> 18 & 63] + ar[n >> 12 & 63] + ar[n >> 6 & 63] + ar[n & 63];
@@ -1012,13 +1012,13 @@ Nu.write = function(n, t, e, r, i, o) {
     return h;
   }();
   function ae(b) {
-    return typeof BigInt > "u" ? Ne : b;
+    return typeof BigInt > "u" ? Le : b;
   }
-  function Ne() {
+  function Le() {
     throw new Error("BigInt not supported");
   }
 })(sw);
-const Xe = sw.Buffer, Jg = "6.15.0";
+const Ce = sw.Buffer, Jg = "6.15.0";
 function $g(n, t, e) {
   const r = t.split("|").map((o) => o.trim());
   for (let o = 0; o < r.length; o++)
@@ -1216,30 +1216,30 @@ function Yn(n, t) {
 function Yg(n, t) {
   return uw(n, t, !1);
 }
-const Uo = BigInt(0), Ye = BigInt(1), Ki = 9007199254740991;
+const Uo = BigInt(0), Ze = BigInt(1), Ki = 9007199254740991;
 function Zg(n, t) {
   const e = Mo(n, "value"), r = BigInt(Tt(t, "width"));
   if (_t(e >> r === Uo, "overflow", "NUMERIC_FAULT", {
     operation: "fromTwos",
     fault: "overflow",
     value: n
-  }), e >> r - Ye) {
-    const i = (Ye << r) - Ye;
-    return -((~e & i) + Ye);
+  }), e >> r - Ze) {
+    const i = (Ze << r) - Ze;
+    return -((~e & i) + Ze);
   }
   return e;
 }
 function _w(n, t) {
   let e = vt(n, "value");
-  const r = BigInt(Tt(t, "width")), i = Ye << r - Ye;
+  const r = BigInt(Tt(t, "width")), i = Ze << r - Ze;
   if (e < Uo) {
     e = -e, _t(e <= i, "too low", "NUMERIC_FAULT", {
       operation: "toTwos",
       fault: "overflow",
       value: n
     });
-    const o = (Ye << r) - Ye;
-    return (~e & o) + Ye;
+    const o = (Ze << r) - Ze;
+    return (~e & o) + Ze;
   } else
     _t(e < i, "too high", "NUMERIC_FAULT", {
       operation: "toTwos",
@@ -1250,7 +1250,7 @@ function _w(n, t) {
 }
 function zs(n, t) {
   const e = Mo(n, "value"), r = BigInt(Tt(t, "bits"));
-  return e & (Ye << r) - Ye;
+  return e & (Ze << r) - Ze;
 }
 function vt(n, t) {
   switch (typeof n) {
@@ -1335,7 +1335,7 @@ function ge(n) {
   }
   return r;
 }
-function Je(n) {
+function $e(n) {
   let t = yt(Du(n) ? n : ge(n)).substring(2);
   for (; t.startsWith("0"); )
     t = t.substring(1);
@@ -3188,7 +3188,7 @@ function Ku(n, t) {
 function cy(n) {
   return os(Gw(n));
 }
-function Ke(n, t, e) {
+function We(n, t, e) {
   let r;
   if (typeof t == "string")
     try {
@@ -3306,7 +3306,7 @@ const wy = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   bytesToNumberLE: Qu,
   concatBytes: Ns,
   createHmacDrbg: Hw,
-  ensureBytes: Ke,
+  ensureBytes: We,
   equalBytes: uy,
   hexToBytes: os,
   hexToNumber: qu,
@@ -3335,7 +3335,7 @@ function gy(n, t, e) {
     t & ue && (r = r * n % e), n = n * n % e, t >>= ue;
   return r;
 }
-function De(n, t, e) {
+function Ue(n, t, e) {
   let r = n;
   for (; t-- > be; )
     r *= r, r %= e;
@@ -3668,7 +3668,7 @@ const { bytesToNumberBE: ky, hexToBytes: Py } = wy, xi = {
     }, r = t(e(n.s)), i = t(e(n.r)), o = r.length / 2, a = i.length / 2, u = e(o), _ = e(a);
     return `30${e(a + o + 4)}02${_}${i}02${u}${r}`;
   }
-}, Vn = BigInt(0), je = BigInt(1);
+}, Vn = BigInt(0), Ge = BigInt(1);
 BigInt(2);
 const C_ = BigInt(3);
 BigInt(4);
@@ -3702,7 +3702,7 @@ function Fy(n) {
     }
     let S;
     try {
-      S = typeof F == "bigint" ? F : ki(Ke("private key", F, T));
+      S = typeof F == "bigint" ? F : ki(We("private key", F, T));
     } catch {
       throw new Error(`private key must be ${T} bytes, hex or bigint, not ${typeof F}`);
     }
@@ -3754,7 +3754,7 @@ function Fy(n) {
      * @param hex short/long ECDSA hex
      */
     static fromHex(k) {
-      const T = g.fromAffine(i(Ke("pointHex", k)));
+      const T = g.fromAffine(i(We("pointHex", k)));
       return T.assertValidity(), T;
     }
     // Multiplies generator point by privateKey.
@@ -3845,14 +3845,14 @@ function Fy(n) {
       const T = g.ZERO;
       if (k === Vn)
         return T;
-      if (u(k), k === je)
+      if (u(k), k === Ge)
         return this;
       const { endo: E } = t;
       if (!E)
         return v.unsafeLadder(this, k);
       let { k1neg: R, k1: S, k2neg: B, k2: O } = E.splitScalar(k), C = T, N = T, L = this;
       for (; S > Vn || O > Vn; )
-        S & je && (C = C.add(L)), O & je && (N = N.add(L)), L = L.double(), S >>= je, O >>= je;
+        S & Ge && (C = C.add(L)), O & Ge && (N = N.add(L)), L = L.double(), S >>= Ge, O >>= Ge;
       return R && (C = C.negate()), B && (N = N.negate()), N = new g(e.mul(N.px, E.beta), N.py, N.pz), C.add(N);
     }
     /**
@@ -3885,7 +3885,7 @@ function Fy(n) {
      * @returns non-zero affine point
      */
     multiplyAndAddUnsafe(k, T, E) {
-      const R = g.BASE, S = (O, C) => C === Vn || C === je || !O.equals(R) ? O.multiplyUnsafe(C) : O.multiply(C), B = S(this, T).add(S(k, E));
+      const R = g.BASE, S = (O, C) => C === Vn || C === Ge || !O.equals(R) ? O.multiplyUnsafe(C) : O.multiply(C), B = S(this, T).add(S(k, E));
       return B.is0() ? void 0 : B;
     }
     // Converts Projective point to affine (x, y) coordinates.
@@ -3903,7 +3903,7 @@ function Fy(n) {
     }
     isTorsionFree() {
       const { h: k, isTorsionFree: T } = t;
-      if (k === je)
+      if (k === Ge)
         return !0;
       if (T)
         return T(g, this);
@@ -3911,7 +3911,7 @@ function Fy(n) {
     }
     clearCofactor() {
       const { h: k, clearCofactor: T } = t;
-      return k === je ? this : T ? T(g, this) : this.multiplyUnsafe(t.h);
+      return k === Ge ? this : T ? T(g, this) : this.multiplyUnsafe(t.h);
     }
     toRawBytes(k = !0) {
       return this.assertValidity(), r(g, this, k);
@@ -3967,7 +3967,7 @@ function Oy(n) {
           throw new Error("Point is not on curve");
         const kt = g(xt);
         let Mt = e.sqrt(kt);
-        const W = (Mt & je) === je;
+        const W = (Mt & Ge) === Ge;
         return (mt & 1) === 1 !== W && (Mt = e.neg(Mt)), { x: xt, y: Mt };
       } else if (lt === o && mt === 4) {
         const xt = e.fromBytes(Rt.subarray(0, e.BYTES)), kt = e.fromBytes(Rt.subarray(e.BYTES, 2 * e.BYTES));
@@ -3977,7 +3977,7 @@ function Oy(n) {
     }
   }), v = (at) => ss(as(at, t.nByteLength));
   function F(at) {
-    const lt = r >> je;
+    const lt = r >> Ge;
     return at > lt;
   }
   function k(at) {
@@ -3991,12 +3991,12 @@ function Oy(n) {
     // pair (bytes of r, bytes of s)
     static fromCompact(lt) {
       const mt = t.nByteLength;
-      return lt = Ke("compactSignature", lt, mt * 2), new E(T(lt, 0, mt), T(lt, mt, 2 * mt));
+      return lt = We("compactSignature", lt, mt * 2), new E(T(lt, 0, mt), T(lt, mt, 2 * mt));
     }
     // DER encoded ECDSA signature
     // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script
     static fromDER(lt) {
-      const { r: mt, s: Rt } = xi.toSig(Ke("DER", lt));
+      const { r: mt, s: Rt } = xi.toSig(We("DER", lt));
       return new E(mt, Rt);
     }
     assertValidity() {
@@ -4009,7 +4009,7 @@ function Oy(n) {
       return new E(this.r, this.s, lt);
     }
     recoverPublicKey(lt) {
-      const { r: mt, s: Rt, recovery: xt } = this, kt = N(Ke("msgHash", lt));
+      const { r: mt, s: Rt, recovery: xt } = this, kt = N(We("msgHash", lt));
       if (xt == null || ![0, 1, 2, 3].includes(xt))
         throw new Error("recovery id invalid");
       const Mt = xt === 2 || xt === 3 ? mt + t.n : mt;
@@ -4103,11 +4103,11 @@ function Oy(n) {
       throw new Error("sign() legacy options not supported");
     const { hash: Rt, randomBytes: xt } = t;
     let { lowS: kt, prehash: Mt, extraEntropy: W } = mt;
-    kt == null && (kt = !0), at = Ke("msgHash", at), Mt && (at = Ke("prehashed msgHash", Rt(at)));
+    kt == null && (kt = !0), at = We("msgHash", at), Mt && (at = We("prehashed msgHash", Rt(at)));
     const Z = N(at), rt = f(lt), gt = [J(rt), J(Z)];
     if (W != null) {
       const ct = W === !0 ? xt(e.BYTES) : W;
-      gt.push(Ke("extraEntropy", ct));
+      gt.push(We("extraEntropy", ct));
     }
     const G = Ns(...gt), M = Z;
     function X(ct) {
@@ -4120,7 +4120,7 @@ function Oy(n) {
       const ft = u(x * u(M + et * rt));
       if (ft === Vn)
         return;
-      let Bt = (z.x === et ? 0 : 2) | Number(z.y & je), bt = ft;
+      let Bt = (z.x === et ? 0 : 2) | Number(z.y & Ge), bt = ft;
       return kt && F(ft) && (bt = k(ft), Bt ^= 1), new E(et, bt, Bt);
     }
     return { seed: G, k2sig: X };
@@ -4133,7 +4133,7 @@ function Oy(n) {
   l.BASE._setWindowSize(8);
   function dt(at, lt, mt, Rt = D) {
     const xt = at;
-    if (lt = Ke("msgHash", lt), mt = Ke("publicKey", mt), "strict" in Rt)
+    if (lt = We("msgHash", lt), mt = We("publicKey", mt), "strict" in Rt)
       throw new Error("options.strict was renamed to lowS");
     const { lowS: kt, prehash: Mt } = Rt;
     let W, Z;
@@ -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, v = De(y, gu, t) * l % t, F = De(v, i, t) * v % t, k = De(F, o, t) * F % t, T = De(k, u, t) * k % t, E = De(T, _, t) * T % t, R = De(E, u, t) * k % t, S = De(R, e, t) * f % t, B = De(S, a, t) * F % t, O = De(B, r, t) * l % t, C = De(O, 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 = Ue(f, e, t) * f % t, y = Ue(g, e, t) * f % t, v = Ue(y, gu, t) * l % t, F = Ue(v, i, t) * v % t, k = Ue(F, o, t) * F % t, T = Ue(k, u, t) * k % t, E = Ue(T, _, t) * T % t, R = Ue(E, u, t) * k % t, S = Ue(R, e, t) * f % t, B = Ue(S, a, t) * F % t, O = Ue(B, r, t) * l % t, C = Ue(O, gu, t);
   if (!yu.eql(yu.sqr(C), n))
     throw new Error("Cannot find square root");
   return C;
@@ -4698,7 +4698,7 @@ function Hy(n) {
 function Jw(n) {
   return n && typeof n.getAddress == "function";
 }
-function Ge(n) {
+function He(n) {
   try {
     return Ut(n), !0;
   } catch {
@@ -6082,7 +6082,7 @@ function Eb(n, t) {
   ];
   return t && (e.push(Lt(t.yParity, "yParity")), e.push(ge(t.r)), e.push(ge(t.s))), oe(["0x04", fi(e)]);
 }
-class We {
+class Je {
   #t;
   #e;
   #r;
@@ -6516,7 +6516,7 @@ class We {
    *  Create a copy of this transaciton.
    */
   clone() {
-    return We.from(this);
+    return Je.from(this);
   }
   /**
    *  Return a JSON-friendly object.
@@ -6545,24 +6545,24 @@ class We {
    */
   static from(t) {
     if (t == null)
-      return new We();
+      return new Je();
     if (typeof t == "string") {
       const r = Ot(t);
       if (r[0] >= 127)
-        return We.from(hb(r));
+        return Je.from(hb(r));
       switch (r[0]) {
         case 1:
-          return We.from(gb(r));
+          return Je.from(gb(r));
         case 2:
-          return We.from(wb(r));
+          return Je.from(wb(r));
         case 3:
-          return We.from(bb(r));
+          return Je.from(bb(r));
         case 4:
-          return We.from(Ab(r));
+          return Je.from(Ab(r));
       }
       _t(!1, "unsupported transaction type", "UNSUPPORTED_OPERATION", { operation: "from" });
     }
-    const e = new We();
+    const e = new Je();
     return t.type != null && (e.type = t.type), t.to != null && (e.to = t.to), t.nonce != null && (e.nonce = t.nonce), t.gasLimit != null && (e.gasLimit = t.gasLimit), t.gasPrice != null && (e.gasPrice = t.gasPrice), t.maxPriorityFeePerGas != null && (e.maxPriorityFeePerGas = t.maxPriorityFeePerGas), t.maxFeePerGas != null && (e.maxFeePerGas = t.maxFeePerGas), t.maxFeePerBlobGas != null && (e.maxFeePerBlobGas = t.maxFeePerBlobGas), t.data != null && (e.data = t.data), t.value != null && (e.value = t.value), t.chainId != null && (e.chainId = t.chainId), t.signature != null && (e.signature = ie.from(t.signature)), t.accessList != null && (e.accessList = t.accessList), t.authorizationList != null && (e.authorizationList = t.authorizationList), t.blobVersionedHashes != null && (e.blobVersionedHashes = t.blobVersionedHashes), t.kzg != null && (e.kzg = t.kzg), t.blobs != null && (e.blobs = t.blobs), t.hash != null && (V(e.isSigned(), "unsigned transaction cannot define '.hash'", "tx", t), V(e.hash === t.hash, "hash mismatch", "tx", t)), t.from != null && (V(e.isSigned(), "unsigned transaction cannot define '.from'", "tx", t), V(e.from.toLowerCase() === (t.from || "").toLowerCase(), "from mismatch", "tx", t)), e;
   }
 }
@@ -7167,7 +7167,7 @@ const l1 = {
   version: rf("version"),
   chainId: function(n) {
     const t = vt(n, "domain.chainId");
-    return V(t >= 0, "invalid chain ID", "domain.chainId", n), Number.isSafeInteger(t) ? Number(t) : Je(t);
+    return V(t >= 0, "invalid chain ID", "domain.chainId", n), Number.isSafeInteger(t) ? Number(t) : $e(t);
   },
   verifyingContract: function(n) {
     try {
@@ -7505,7 +7505,7 @@ const h1 = "external public payable override", p1 = Be(h1.split(" ")), zd = "con
   ",": "COMMA",
   "@": "AT"
 }, 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 Qe {
+class Ke {
   #t;
   #e;
   get offset() {
@@ -7518,13 +7518,13 @@ class Qe {
     this.#t = 0, this.#e = t.slice();
   }
   clone() {
-    return new Qe(this.#e);
+    return new Ke(this.#e);
   }
   reset() {
     this.#t = 0;
   }
   #r(t = 0, e = 0) {
-    return new Qe(this.#e.slice(t, e).map((r) => Object.freeze(Object.assign({}, r, {
+    return new Ke(this.#e.slice(t, e).map((r) => Object.freeze(Object.assign({}, r, {
       match: r.match - t,
       linkBack: r.linkBack - t,
       linkNext: r.linkNext - t
@@ -7648,7 +7648,7 @@ function hi(n) {
     }
     throw new Error(`unexpected token ${JSON.stringify(a[0])} at position ${o}`);
   }
-  return new Qe(t.map((a) => Object.freeze(a)));
+  return new Ke(t.map((a) => Object.freeze(a)));
 }
 function sf(n, t) {
   let e = [];
@@ -7924,7 +7924,7 @@ class Zt {
       } catch {
         V(!1, "invalid param type", "obj", t);
       }
-    else if (t instanceof Qe) {
+    else if (t instanceof Ke) {
       let u = "", _ = "", l = null;
       Zn(t, Be(["tuple"])).has("tuple") || t.peekType("OPEN_PAREN") ? (_ = "tuple", l = t.popParams().map((k) => Zt.from(k)), u = `tuple(${l.map((k) => k.format()).join(",")})`) : (u = of(t.popType("TYPE")), _ = u);
       let f = null, g = null;
@@ -8001,7 +8001,7 @@ class Ti {
       }
       return Ti.from(hi(t));
     }
-    if (t instanceof Qe)
+    if (t instanceof Ke)
       switch (t.peekKeyword(Sd)) {
         case "constructor":
           return Kn.from(t);
@@ -8119,7 +8119,7 @@ class Ie extends Jo {
       return t;
     if (typeof t == "string")
       return Ie.from(hi(t));
-    if (t instanceof Qe) {
+    if (t instanceof Ke) {
       const e = Wo("error", t), r = $n(t);
       return Oi(t), new Ie(re, e, r);
     }
@@ -8182,7 +8182,7 @@ class cr extends Jo {
       } catch {
         V(!1, "invalid event fragment", "obj", t);
       }
-    else if (t instanceof Qe) {
+    else if (t instanceof Ke) {
       const e = Wo("event", t), r = $n(t, !0), i = !!Zn(t, Be(["anonymous"])).has("anonymous");
       return Oi(t), new cr(re, e, r, i);
     }
@@ -8238,7 +8238,7 @@ class Kn extends Ti {
       } catch {
         V(!1, "invalid constuctor fragment", "obj", t);
       }
-    else if (t instanceof Qe) {
+    else if (t instanceof Ke) {
       Zn(t, Be(["constructor"]));
       const e = $n(t), r = !!Zn(t, p1).has("payable"), i = Od(t);
       return Oi(t), new Kn(re, "constructor", e, r, i);
@@ -8284,7 +8284,7 @@ class hr extends Ti {
       } catch {
         V(!1, "invalid fallback fragment", "obj", t);
       }
-    else if (t instanceof Qe) {
+    else if (t instanceof Ke) {
       const e = t.toString(), r = t.peekKeyword(Be(["fallback", "receive"]));
       if (V(r, "type must be fallback or receive", "obj", e), t.popKeyword(Be(["fallback", "receive"])) === "receive") {
         const u = $n(t);
@@ -8385,7 +8385,7 @@ class ur extends Jo {
       } catch {
         V(!1, "invalid function fragment", "obj", t);
       }
-    else if (t instanceof Qe) {
+    else if (t instanceof Ke) {
       const r = Wo("function", t), i = $n(t), o = Id(t);
       let a = [];
       Zn(t, Be(["returns"])).has("returns") && (a = $n(t));
@@ -8426,7 +8426,7 @@ class Pi extends Jo {
       } catch {
         V(!1, "invalid struct fragment", "obj", t);
       }
-    else if (t instanceof Qe) {
+    else if (t instanceof Ke) {
       const e = Wo("struct", t), r = $n(t);
       return Oi(t), new Pi(re, e, r);
     }
@@ -11894,7 +11894,7 @@ class rm extends Zs {
   }
 }
 const Da = /* @__PURE__ */ new Map();
-class Ce {
+class Ne {
   #t;
   #e;
   #r;
@@ -12001,7 +12001,7 @@ class Ce {
    *  Create a copy of this Network.
    */
   clone() {
-    const t = new Ce(this.name, this.chainId);
+    const t = new Ne(this.name, this.chainId);
     return this.plugins.forEach((e) => {
       t.attachPlugin(e.clone());
     }), t;
@@ -12030,20 +12030,20 @@ class Ce {
    */
   static from(t) {
     if (nm(), t == null)
-      return Ce.from("mainnet");
+      return Ne.from("mainnet");
     if (typeof t == "number" && (t = BigInt(t)), typeof t == "string" || typeof t == "bigint") {
       const e = Da.get(t);
       if (e)
         return e();
       if (typeof t == "bigint")
-        return new Ce("unknown", t);
+        return new Ne("unknown", t);
       V(!1, "unknown network", "network", t);
     }
     if (typeof t.clone == "function")
       return t.clone();
     if (typeof t == "object") {
       V(typeof t.name == "string" && typeof t.chainId == "number", "invalid network object name or chainId", "network", t);
-      const e = new Ce(t.name, t.chainId);
+      const e = new Ne(t.name, t.chainId);
       return (t.ensAddress || t.ensNetwork != null) && e.attachPlugin(new Zo(t.ensAddress, t.ensNetwork)), e;
     }
     V(!1, "invalid network", "network", t);
@@ -12101,13 +12101,13 @@ function nm() {
   Rf = !0;
   function n(t, e, r) {
     const i = function() {
-      const o = new Ce(t, e);
+      const o = new Ne(t, e);
       return r.ensNetwork != null && o.attachPlugin(new Zo(null, r.ensNetwork)), o.attachPlugin(new Yo()), (r.plugins || []).forEach((a) => {
         o.attachPlugin(a);
       }), o;
     };
-    Ce.register(t, i), Ce.register(e, i), r.altNames && r.altNames.forEach((o) => {
-      Ce.register(o, i);
+    Ne.register(t, i), Ne.register(e, i), r.altNames && r.altNames.forEach((o) => {
+      Ne.register(o, i);
     });
   }
   n("mainnet", 1, { ensNetwork: 1, altNames: ["homestead"] }), n("ropsten", 3, { ensNetwork: 3 }), n("rinkeby", 4, { ensNetwork: 4 }), n("goerli", 5, { ensNetwork: 5 }), n("kovan", 42, { ensNetwork: 42 }), n("sepolia", 11155111, { ensNetwork: 11155111 }), n("holesky", 17e3, { ensNetwork: 17e3 }), n("classic", 61, {}), n("classicKotti", 6, {}), n("arbitrum", 42161, {
@@ -12409,7 +12409,7 @@ class lm {
     if (this.#w = Object.assign({}, fm, e || {}), t === "any")
       this.#o = !0, this.#i = null;
     else if (t) {
-      const r = Ce.from(t);
+      const r = Ne.from(t);
       this.#o = !1, this.#i = Promise.resolve(r), setTimeout(() => {
         this.emit("network", r, null);
       }, 0);
@@ -12585,9 +12585,9 @@ class lm {
         return t;
     }
     if (Xt(t))
-      return Xt(t, 32) ? t : Je(t);
+      return Xt(t, 32) ? t : $e(t);
     if (typeof t == "bigint" && (t = Tt(t, "blockTag")), typeof t == "number")
-      return t >= 0 ? Je(t) : this.#a >= 0 ? Je(this.#a + t) : this.getBlockNumber().then((e) => Je(e + t));
+      return t >= 0 ? $e(t) : this.#a >= 0 ? $e(this.#a + t) : this.getBlockNumber().then((e) => $e(e + t));
     V(!1, "invalid blockTag", "blockTag", t);
   }
   /**
@@ -12802,7 +12802,7 @@ class lm {
         signedTransaction: t
       }),
       network: this.getNetwork()
-    }), o = We.from(t);
+    }), o = Je.from(t);
     if (o.hash !== r)
       throw new Error("@TODO: the returned hash did not match");
     return this._wrapTransactionResponse(o, i).replaceableTransaction(e);
@@ -13340,7 +13340,7 @@ class ym {
   async sendTransaction(t) {
     const e = wi(this, "sendTransaction"), r = await this.populateTransaction(t);
     delete r.from;
-    const i = We.from(r);
+    const i = Je.from(r);
     return await e.broadcastTransaction(await this.signTransaction(i));
   }
   // @TODO: in v7 move this to be abstract
@@ -13671,7 +13671,7 @@ class xm extends lm {
       this.#i = { promise: o, resolve: i };
     }
     const r = this._getOption("staticNetwork");
-    typeof r == "boolean" ? (V(!r || t !== "any", "staticNetwork cannot be used on special network 'any'", "options", e), r && t != null && (this.#o = Ce.from(t))) : r && (V(t == null || r.matches(t), "staticNetwork MUST match network object", "options", e), this.#o = r);
+    typeof r == "boolean" ? (V(!r || t !== "any", "staticNetwork cannot be used on special network 'any'", "options", e), r && t != null && (this.#o = Ne.from(t))) : r && (V(t == null || r.matches(t), "staticNetwork MUST match network object", "options", e), this.#o = r);
   }
   /**
    *  Returns the value associated with the option %%key%%.
@@ -13724,7 +13724,7 @@ class xm extends lm {
         return t;
     return this.#s ? await this.#s : this.ready ? (this.#s = (async () => {
       try {
-        const e = Ce.from(vt(await this.send("eth_chainId", [])));
+        const e = Ne.from(vt(await this.send("eth_chainId", [])));
         return this.#s = null, e;
       } catch (e) {
         throw this.#s = null, e;
@@ -13744,7 +13744,7 @@ class xm extends lm {
         throw this.#s = null, this.emit("debug", { action: "receiveRpcError", error: i }), i;
       }
       if (this.emit("debug", { action: "receiveRpcResult", result: r }), "result" in r)
-        return Ce.from(vt(r.result));
+        return Ne.from(vt(r.result));
       throw this.getRpcError(e, r);
     })(), await this.#s);
   }
@@ -13803,18 +13803,18 @@ class xm extends lm {
       if (t[r] == null)
         return;
       let i = r;
-      r === "gasLimit" && (i = "gas"), e[i] = Je(vt(t[r], `tx.${r}`));
+      r === "gasLimit" && (i = "gas"), e[i] = $e(vt(t[r], `tx.${r}`));
     }), ["from", "to", "data"].forEach((r) => {
       t[r] != null && (e[r] = yt(t[r]));
     }), t.accessList && (e.accessList = Li(t.accessList)), t.blobVersionedHashes && (e.blobVersionedHashes = t.blobVersionedHashes.map((r) => r.toLowerCase())), t.authorizationList && (e.authorizationList = t.authorizationList.map((r) => {
       const i = Xw(r);
       return {
         address: i.address,
-        nonce: Je(i.nonce),
-        chainId: Je(i.chainId),
-        yParity: Je(i.signature.yParity),
-        r: Je(i.signature.r),
-        s: Je(i.signature.s)
+        nonce: $e(i.nonce),
+        chainId: $e(i.chainId),
+        yParity: $e(i.signature.yParity),
+        r: $e(i.signature.r),
+        s: $e(i.signature.s)
       };
     })), e;
   }
@@ -15200,13 +15200,13 @@ function Xo() {
         return p = p >>> 0, d || Gt(p, 4, this.length), (this[p] | this[p + 1] << 8 | this[p + 2] << 16) + this[p + 3] * 16777216;
       }, D.prototype.readUint32BE = D.prototype.readUInt32BE = function(p, d) {
         return p = p >>> 0, d || Gt(p, 4, this.length), this[p] * 16777216 + (this[p + 1] << 16 | this[p + 2] << 8 | this[p + 3]);
-      }, D.prototype.readBigUInt64LE = Le(function(p) {
+      }, D.prototype.readBigUInt64LE = De(function(p) {
         p = p >>> 0, U(p, "offset");
         const d = this[p], I = this[p + 7];
         (d === void 0 || I === void 0) && $(p, this.length - 8);
         const H = d + this[++p] * 2 ** 8 + this[++p] * 2 ** 16 + this[++p] * 2 ** 24, Y = this[++p] + this[++p] * 2 ** 8 + this[++p] * 2 ** 16 + I * 2 ** 24;
         return BigInt(H) + (BigInt(Y) << BigInt(32));
-      }), D.prototype.readBigUInt64BE = Le(function(p) {
+      }), D.prototype.readBigUInt64BE = De(function(p) {
         p = p >>> 0, U(p, "offset");
         const d = this[p], I = this[p + 7];
         (d === void 0 || I === void 0) && $(p, this.length - 8);
@@ -15238,13 +15238,13 @@ function Xo() {
         return p = p >>> 0, d || Gt(p, 4, this.length), this[p] | this[p + 1] << 8 | this[p + 2] << 16 | this[p + 3] << 24;
       }, D.prototype.readInt32BE = function(p, d) {
         return p = p >>> 0, d || Gt(p, 4, this.length), this[p] << 24 | this[p + 1] << 16 | this[p + 2] << 8 | this[p + 3];
-      }, D.prototype.readBigInt64LE = Le(function(p) {
+      }, D.prototype.readBigInt64LE = De(function(p) {
         p = p >>> 0, U(p, "offset");
         const d = this[p], I = this[p + 7];
         (d === void 0 || I === void 0) && $(p, this.length - 8);
         const H = this[p + 4] + this[p + 5] * 2 ** 8 + this[p + 6] * 2 ** 16 + (I << 24);
         return (BigInt(H) << BigInt(32)) + BigInt(d + this[++p] * 2 ** 8 + this[++p] * 2 ** 16 + this[++p] * 2 ** 24);
-      }), D.prototype.readBigInt64BE = Le(function(p) {
+      }), D.prototype.readBigInt64BE = De(function(p) {
         p = p >>> 0, U(p, "offset");
         const d = this[p], I = this[p + 7];
         (d === void 0 || I === void 0) && $(p, this.length - 8);
@@ -15308,9 +15308,9 @@ function Xo() {
         let ot = Number(p >> BigInt(32) & BigInt(4294967295));
         return m[d + 3] = ot, ot = ot >> 8, m[d + 2] = ot, ot = ot >> 8, m[d + 1] = ot, ot = ot >> 8, m[d] = ot, d + 8;
       }
-      D.prototype.writeBigUInt64LE = Le(function(p, d = 0) {
+      D.prototype.writeBigUInt64LE = De(function(p, d = 0) {
         return de(this, p, d, BigInt(0), BigInt("0xffffffffffffffff"));
-      }), D.prototype.writeBigUInt64BE = Le(function(p, d = 0) {
+      }), D.prototype.writeBigUInt64BE = De(function(p, d = 0) {
         return fe(this, p, d, BigInt(0), BigInt("0xffffffffffffffff"));
       }), D.prototype.writeIntLE = function(p, d, I, H) {
         if (p = +p, d = d >>> 0, !H) {
@@ -15340,9 +15340,9 @@ function Xo() {
         return p = +p, d = d >>> 0, I || Qt(this, p, d, 4, 2147483647, -2147483648), this[d] = p & 255, this[d + 1] = p >>> 8, this[d + 2] = p >>> 16, this[d + 3] = p >>> 24, d + 4;
       }, D.prototype.writeInt32BE = function(p, d, I) {
         return p = +p, d = d >>> 0, I || Qt(this, p, d, 4, 2147483647, -2147483648), p < 0 && (p = 4294967295 + p + 1), this[d] = p >>> 24, this[d + 1] = p >>> 16, this[d + 2] = p >>> 8, this[d + 3] = p & 255, d + 4;
-      }, D.prototype.writeBigInt64LE = Le(function(p, d = 0) {
+      }, D.prototype.writeBigInt64LE = De(function(p, d = 0) {
         return de(this, p, d, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
-      }), D.prototype.writeBigInt64BE = Le(function(p, d = 0) {
+      }), D.prototype.writeBigInt64BE = De(function(p, d = 0) {
         return fe(this, p, d, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
       });
       function Ee(m, p, d, I, H, Y) {
@@ -15407,9 +15407,9 @@ function Xo() {
         }
         return this;
       };
-      const Ne = {};
+      const Le = {};
       function b(m, p, d) {
-        Ne[m] = class extends d {
+        Le[m] = class extends d {
           constructor() {
             super(), Object.defineProperty(this, "message", {
               value: p.apply(this, arguments),
@@ -15467,16 +15467,16 @@ function Xo() {
         if (m > d || m < p) {
           const ot = typeof p == "bigint" ? "n" : "";
           let Ft;
-          throw p === 0 || p === BigInt(0) ? Ft = `>= 0${ot} and < 2${ot} ** ${(Y + 1) * 8}${ot}` : Ft = `>= -(2${ot} ** ${(Y + 1) * 8 - 1}${ot}) and < 2 ** ${(Y + 1) * 8 - 1}${ot}`, new Ne.ERR_OUT_OF_RANGE("value", Ft, m);
+          throw p === 0 || p === BigInt(0) ? Ft = `>= 0${ot} and < 2${ot} ** ${(Y + 1) * 8}${ot}` : Ft = `>= -(2${ot} ** ${(Y + 1) * 8 - 1}${ot}) and < 2 ** ${(Y + 1) * 8 - 1}${ot}`, new Le.ERR_OUT_OF_RANGE("value", Ft, m);
         }
         w(I, H, Y);
       }
       function U(m, p) {
         if (typeof m != "number")
-          throw new Ne.ERR_INVALID_ARG_TYPE(p, "number", m);
+          throw new Le.ERR_INVALID_ARG_TYPE(p, "number", m);
       }
       function $(m, p, d) {
-        throw Math.floor(m) !== m ? (U(m, d), new Ne.ERR_OUT_OF_RANGE("offset", "an integer", m)) : p < 0 ? new Ne.ERR_BUFFER_OUT_OF_BOUNDS() : new Ne.ERR_OUT_OF_RANGE(
+        throw Math.floor(m) !== m ? (U(m, d), new Le.ERR_OUT_OF_RANGE("offset", "an integer", m)) : p < 0 ? new Le.ERR_BUFFER_OUT_OF_BOUNDS() : new Le.ERR_OUT_OF_RANGE(
           "offset",
           `>= 0 and <= ${p}`,
           m
@@ -15580,7 +15580,7 @@ function Xo() {
         }
         return p;
       }();
-      function Le(m) {
+      function De(m) {
         return typeof BigInt > "u" ? As : m;
       }
       function As() {
@@ -18567,9 +18567,9 @@ function g2() {
       r(i);
     }
     update(r, i) {
-      if (!Xe.isBuffer(r) && typeof r != "string") throw new TypeError("Data must be a string or a buffer");
+      if (!Ce.isBuffer(r) && typeof r != "string") throw new TypeError("Data must be a string or a buffer");
       if (this._finalized) throw new Error("Digest already called");
-      return Xe.isBuffer(r) || (r = Xe.from(r, i)), this._state.absorb(r), this;
+      return Ce.isBuffer(r) || (r = Ce.from(r, i)), this._state.absorb(r), this;
     }
     digest(r) {
       if (this._finalized) throw new Error("Digest already called");
@@ -18612,9 +18612,9 @@ function y2() {
       this.push(this.squeeze(r));
     }
     update(r, i) {
-      if (!Xe.isBuffer(r) && typeof r != "string") throw new TypeError("Data must be a string or a buffer");
+      if (!Ce.isBuffer(r) && typeof r != "string") throw new TypeError("Data must be a string or a buffer");
       if (this._finalized) throw new Error("Squeeze already called");
-      return Xe.isBuffer(r) || (r = Xe.from(r, i)), this._state.absorb(r), this;
+      return Ce.isBuffer(r) || (r = Ce.from(r, i)), this._state.absorb(r), this;
     }
     squeeze(r, i) {
       this._finalized || (this._finalized = !0, this._state.absorbLastFewBits(this._delimitedSuffix));
@@ -18682,8 +18682,8 @@ function m2() {
       v = u ^ (g << 1 | y >>> 31), F = _ ^ (y << 1 | g >>> 31);
       const ct = t[6] ^ v, ut = t[7] ^ F, x = t[16] ^ v, z = t[17] ^ F, et = t[26] ^ v, ft = t[27] ^ F, Bt = t[36] ^ v, bt = t[37] ^ F, St = t[46] ^ v, he = t[47] ^ F;
       v = l ^ (r << 1 | i >>> 31), F = f ^ (i << 1 | r >>> 31);
-      const it = t[8] ^ v, pe = t[9] ^ F, we = t[18] ^ v, Gt = t[19] ^ F, Qt = t[28] ^ v, de = t[29] ^ F, fe = t[38] ^ v, Ee = t[39] ^ F, Se = t[48] ^ v, ae = t[49] ^ F, Ne = k, b = T, h = R << 4 | E >>> 28, w = E << 4 | R >>> 28, P = S << 3 | B >>> 29, U = B << 3 | S >>> 29, $ = C << 9 | O >>> 23, st = O << 9 | C >>> 23, Pt = N << 18 | L >>> 14, Vt = L << 18 | N >>> 14, qt = J << 1 | nt >>> 31, Kt = nt << 1 | J >>> 31, Dt = D << 12 | ht >>> 20, ei = ht << 12 | D >>> 20, ke = Et << 10 | dt >>> 22, pi = dt << 10 | Et >>> 22, ms = lt << 13 | at >>> 19, Le = at << 13 | lt >>> 19, As = mt << 2 | Rt >>> 30, m = Rt << 2 | mt >>> 30, p = kt << 30 | xt >>> 2, d = xt << 30 | kt >>> 2, I = Mt << 6 | W >>> 26, H = W << 6 | Mt >>> 26, Y = rt << 11 | Z >>> 21, ot = Z << 11 | rt >>> 21, Ft = gt << 15 | G >>> 17, $t = G << 15 | gt >>> 17, Wt = X << 29 | M >>> 3, Yt = M << 29 | X >>> 3, Ht = ct << 28 | ut >>> 4, sa = ut << 28 | ct >>> 4, oa = z << 23 | x >>> 9, aa = x << 23 | z >>> 9, ca = et << 25 | ft >>> 7, ua = ft << 25 | et >>> 7, _a = Bt << 21 | bt >>> 11, fa = bt << 21 | Bt >>> 11, la = he << 24 | St >>> 8, ha = St << 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 & Y, t[1] = b ^ ~ei & ot, t[10] = Ht ^ ~da & P, t[11] = sa ^ ~ga & U, t[20] = qt ^ ~I & 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 ^ ~Y & _a, t[3] = ei ^ ~ot & fa, t[12] = da ^ ~P & ms, t[13] = ga ^ ~U & Le, t[22] = I ^ ~ca & ma, t[23] = H ^ ~ua & Aa, t[32] = h ^ ~ke & Ft, t[33] = w ^ ~pi & $t, t[42] = oa ^ ~ya & $, t[43] = aa ^ ~ba & st, t[4] = Y ^ ~_a & Ea, t[5] = ot ^ ~fa & va, t[14] = P ^ ~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 ^ ~$ & 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] = $ ^ ~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 & I, 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] ^ v, pe = t[9] ^ F, we = t[18] ^ v, Gt = t[19] ^ F, Qt = t[28] ^ v, de = t[29] ^ F, fe = t[38] ^ v, Ee = t[39] ^ F, Se = t[48] ^ v, ae = t[49] ^ F, Le = k, b = T, h = R << 4 | E >>> 28, w = E << 4 | R >>> 28, P = S << 3 | B >>> 29, U = B << 3 | S >>> 29, $ = C << 9 | O >>> 23, st = O << 9 | C >>> 23, Pt = N << 18 | L >>> 14, Vt = L << 18 | N >>> 14, qt = J << 1 | nt >>> 31, Kt = nt << 1 | J >>> 31, Dt = D << 12 | ht >>> 20, ei = ht << 12 | D >>> 20, ke = Et << 10 | dt >>> 22, pi = dt << 10 | Et >>> 22, ms = lt << 13 | at >>> 19, De = at << 13 | lt >>> 19, As = mt << 2 | Rt >>> 30, m = Rt << 2 | mt >>> 30, p = kt << 30 | xt >>> 2, d = xt << 30 | kt >>> 2, I = Mt << 6 | W >>> 26, H = W << 6 | Mt >>> 26, Y = rt << 11 | Z >>> 21, ot = Z << 11 | rt >>> 21, Ft = gt << 15 | G >>> 17, $t = G << 15 | gt >>> 17, Wt = X << 29 | M >>> 3, Yt = M << 29 | X >>> 3, Ht = ct << 28 | ut >>> 4, sa = ut << 28 | ct >>> 4, oa = z << 23 | x >>> 9, aa = x << 23 | z >>> 9, ca = et << 25 | ft >>> 7, ua = ft << 25 | et >>> 7, _a = Bt << 21 | bt >>> 11, fa = bt << 21 | Bt >>> 11, la = he << 24 | St >>> 8, ha = St << 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] = Le ^ ~Dt & Y, t[1] = b ^ ~ei & ot, t[10] = Ht ^ ~da & P, t[11] = sa ^ ~ga & U, t[20] = qt ^ ~I & 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 ^ ~Y & _a, t[3] = ei ^ ~ot & fa, t[12] = da ^ ~P & ms, t[13] = ga ^ ~U & De, t[22] = I ^ ~ca & ma, t[23] = H ^ ~ua & Aa, t[32] = h ^ ~ke & Ft, t[33] = w ^ ~pi & $t, t[42] = oa ^ ~ya & $, t[43] = aa ^ ~ba & st, t[4] = Y ^ ~_a & Ea, t[5] = ot ^ ~fa & va, t[14] = P ^ ~ms & Wt, t[15] = U ^ ~De & Yt, t[24] = ca ^ ~ma & Pt, t[25] = ua ^ ~Aa & Vt, t[34] = ke ^ ~Ft & la, t[35] = pi ^ ~$t & ha, t[44] = ya ^ ~$ & As, t[45] = ba ^ ~st & m, t[6] = _a ^ ~Ea & Le, t[7] = fa ^ ~va & b, t[16] = ms ^ ~Wt & Ht, t[17] = De ^ ~Yt & sa, t[26] = ma ^ ~Pt & qt, t[27] = Aa ^ ~Vt & Kt, t[36] = Ft ^ ~la & pa, t[37] = $t ^ ~ha & wa, t[46] = $ ^ ~As & p, t[47] = st ^ ~m & d, t[8] = Ea ^ ~Le & Dt, t[9] = va ^ ~b & ei, t[18] = Wt ^ ~Ht & da, t[19] = Yt ^ ~sa & ga, t[28] = Pt ^ ~qt & I, 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;
 }
@@ -18731,7 +18731,7 @@ function A2() {
     this.state[~~(this.count / 4)] ^= e << 8 * (this.count % 4), (e & 128) !== 0 && this.count === this.blockSize - 1 && n.p1600(this.state), this.state[~~((this.blockSize - 1) / 4)] ^= 128 << 8 * ((this.blockSize - 1) % 4), n.p1600(this.state), this.count = 0, this.squeezing = !0;
   }, t.prototype.squeeze = function(e) {
     this.squeezing || this.absorbLastFewBits(1);
-    const r = Xe.alloc(e);
+    const r = Ce.alloc(e);
     for (let i = 0; i < e; ++i)
       r[i] = this.state[~~(this.count / 4)] >>> 8 * (this.count % 4) & 255, this.count += 1, this.count === this.blockSize && (n.p1600(this.state), this.count = 0);
     return r;
@@ -19045,7 +19045,7 @@ class ui {
    * @returns {CompactCiphertextListBuilder}
    */
   static builder(t) {
-    A(t, Ze);
+    A(t, Xe);
     const e = s.compactciphertextlist_builder(t.__wbg_ptr);
     if (e[2])
       throw c(e[1]);
@@ -19493,7 +19493,7 @@ class eo {
    * @returns {ProvenCompactCiphertextList}
    */
   build_with_proof_packed(t, e, r) {
-    A(t, $e);
+    A(t, Ye);
     const i = q(e, s.__wbindgen_malloc), o = j, a = s.compactciphertextlistbuilder_build_with_proof_packed(this.__wbg_ptr, t.__wbg_ptr, i, o, r);
     if (a[2])
       throw c(a[1]);
@@ -20707,10 +20707,10 @@ class ls {
 const ah = typeof FinalizationRegistry > "u" ? { register: () => {
 }, unregister: () => {
 } } : new FinalizationRegistry((n) => s.__wbg_compactpkecrs_free(n >>> 0, 1));
-class $e {
+class Ye {
   static __wrap(t) {
     t = t >>> 0;
-    const e = Object.create($e.prototype);
+    const e = Object.create(Ye.prototype);
     return e.__wbg_ptr = t, ah.register(e, e.__wbg_ptr, e), e;
   }
   __destroy_into_raw() {
@@ -20740,7 +20740,7 @@ class $e {
     const e = q(t, s.__wbindgen_malloc), r = j, i = s.compactpkecrs_deserialize(e, r);
     if (i[2])
       throw c(i[1]);
-    return $e.__wrap(i[0]);
+    return Ye.__wrap(i[0]);
   }
   /**
    * @param {bigint} serialized_size_limit
@@ -20762,7 +20762,7 @@ class $e {
     const r = q(t, s.__wbindgen_malloc), i = j, o = s.compactpkecrs_safe_deserialize(r, i, e);
     if (o[2])
       throw c(o[1]);
-    return $e.__wrap(o[0]);
+    return Ye.__wrap(o[0]);
   }
   /**
    * @param {TfheConfig} config
@@ -20774,7 +20774,7 @@ class $e {
     const r = s.compactpkecrs_from_config(t.__wbg_ptr, e);
     if (r[2])
       throw c(r[1]);
-    return $e.__wrap(r[0]);
+    return Ye.__wrap(r[0]);
   }
   /**
    * @param {Uint8Array} buffer
@@ -20784,7 +20784,7 @@ class $e {
     const e = q(t, s.__wbindgen_malloc), r = j, i = s.compactpkecrs_deserialize_from_public_params(e, r);
     if (i[2])
       throw c(i[1]);
-    return $e.__wrap(i[0]);
+    return Ye.__wrap(i[0]);
   }
   /**
    * @param {Uint8Array} buffer
@@ -20795,7 +20795,7 @@ class $e {
     const r = q(t, s.__wbindgen_malloc), i = j, o = s.compactpkecrs_safe_deserialize_from_public_params(r, i, e);
     if (o[2])
       throw c(o[1]);
-    return $e.__wrap(o[0]);
+    return Ye.__wrap(o[0]);
   }
 }
 typeof FinalizationRegistry > "u" || new FinalizationRegistry((n) => s.__wbg_compressedfhebool_free(n >>> 0, 1));
@@ -29784,7 +29784,7 @@ class es {
    * @returns {CompactCiphertextListBuilder}
    */
   static builder(t) {
-    A(t, Ze);
+    A(t, Xe);
     const e = s.provencompactciphertextlist_builder(t.__wbg_ptr);
     if (e[2])
       throw c(e[1]);
@@ -29817,7 +29817,7 @@ class es {
    * @returns {CompactCiphertextListExpander}
    */
   verify_and_expand(t, e, r) {
-    A(t, $e), A(e, Ze);
+    A(t, Ye), A(e, Xe);
     const i = q(r, s.__wbindgen_malloc), o = j, a = s.provencompactciphertextlist_verify_and_expand(this.__wbg_ptr, t.__wbg_ptr, e.__wbg_ptr, i, o);
     if (a[2])
       throw c(a[1]);
@@ -30030,10 +30030,10 @@ class K {
 const Mp = typeof FinalizationRegistry > "u" ? { register: () => {
 }, unregister: () => {
 } } : new FinalizationRegistry((n) => s.__wbg_tfhecompactpublickey_free(n >>> 0, 1));
-class Ze {
+class Xe {
   static __wrap(t) {
     t = t >>> 0;
-    const e = Object.create(Ze.prototype);
+    const e = Object.create(Xe.prototype);
     return e.__wbg_ptr = t, Mp.register(e, e.__wbg_ptr, e), e;
   }
   __destroy_into_raw() {
@@ -30053,7 +30053,7 @@ class Ze {
     const e = s.tfhecompactpublickey_new(t.__wbg_ptr);
     if (e[2])
       throw c(e[1]);
-    return Ze.__wrap(e[0]);
+    return Xe.__wrap(e[0]);
   }
   /**
    * @returns {Uint8Array}
@@ -30073,7 +30073,7 @@ class Ze {
     const e = q(t, s.__wbindgen_malloc), r = j, i = s.tfhecompactpublickey_deserialize(e, r);
     if (i[2])
       throw c(i[1]);
-    return Ze.__wrap(i[0]);
+    return Xe.__wrap(i[0]);
   }
   /**
    * @param {bigint} serialized_size_limit
@@ -30095,7 +30095,7 @@ class Ze {
     const r = q(t, s.__wbindgen_malloc), i = j, o = s.tfhecompactpublickey_safe_deserialize(r, i, e);
     if (o[2])
       throw c(o[1]);
-    return Ze.__wrap(o[0]);
+    return Xe.__wrap(o[0]);
   }
   /**
    * @param {Uint8Array} buffer
@@ -30109,7 +30109,7 @@ class Ze {
     const a = s.tfhecompactpublickey_safe_deserialize_conformant(i, o, e, r.__wbg_ptr);
     if (a[2])
       throw c(a[1]);
-    return Ze.__wrap(a[0]);
+    return Xe.__wrap(a[0]);
   }
 }
 typeof FinalizationRegistry > "u" || new FinalizationRegistry((n) => s.__wbg_tfhecompressedcompactpublickey_free(n >>> 0, 1));
@@ -30516,7 +30516,7 @@ var N2 = /* @__PURE__ */ Object.freeze({
   CompactCiphertextList: ui,
   CompactCiphertextListBuilder: eo,
   CompactCiphertextListExpander: ls,
-  CompactPkeCrs: $e,
+  CompactPkeCrs: Ye,
   FheBool: pr,
   FheInt10: wr,
   FheInt1024: dr,
@@ -30604,7 +30604,7 @@ var N2 = /* @__PURE__ */ Object.freeze({
   ShortintCompactPublicKeyEncryptionParameters: Vs,
   ShortintNoiseDistribution: ra,
   TfheClientKey: K,
-  TfheCompactPublicKey: Ze,
+  TfheCompactPublicKey: Xe,
   TfheCompressedPublicKey: wt,
   TfheConfig: hs,
   TfhePublicKey: pt,
@@ -30651,7 +30651,7 @@ function Si(n, t, e) {
   return te = a, i;
 }
 let bi = null;
-function Ue() {
+function Me() {
   return (bi === null || bi.buffer.detached === !0 || bi.buffer.detached === void 0 && bi.buffer !== tt.memory.buffer) && (bi = new DataView(tt.memory.buffer)), bi;
 }
 function Wi(n) {
@@ -30717,10 +30717,10 @@ function Fi(n, t) {
   if (!(n instanceof t))
     throw new Error(`expected instance of ${t.name}`);
 }
-function Ve(n, t) {
+function qe(n, t) {
   return n = n >>> 0, rs().subarray(n / 1, n / 1 + t);
 }
-function qe(n, t) {
+function Qe(n, t) {
   const e = t(n.length * 1, 1) >>> 0;
   return rs().set(n, e / 1), te = n.length, e;
 }
@@ -30738,7 +30738,7 @@ 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]);
-    Ue().setUint32(e + 4 * r, i, !0);
+    Me().setUint32(e + 4 * r, i, !0);
   }
   return te = n.length, e;
 }
@@ -30750,7 +30750,7 @@ function U2(n, t, e) {
 }
 function Pg(n, t) {
   n = n >>> 0;
-  const e = Ue(), r = [];
+  const e = Me(), r = [];
   for (let i = n; i < n + 4 * t; i += 4)
     r.push(tt.__wbindgen_export_4.get(e.getUint32(i, !0)));
   return tt.__externref_drop_slice(n, t), r;
@@ -30769,7 +30769,7 @@ function G2(n) {
   const t = tt.ml_kem_pke_pk_to_u8vec(n.__wbg_ptr);
   if (t[3])
     throw Ui(t[2]);
-  var e = Ve(t[0], t[1]).slice();
+  var e = qe(t[0], t[1]).slice();
   return tt.__wbindgen_free(t[0], t[1] * 1, 1), e;
 }
 function H2(n) {
@@ -30777,17 +30777,17 @@ function H2(n) {
   const t = tt.ml_kem_pke_sk_to_u8vec(n.__wbg_ptr);
   if (t[3])
     throw Ui(t[2]);
-  var e = Ve(t[0], t[1]).slice();
+  var e = qe(t[0], t[1]).slice();
   return tt.__wbindgen_free(t[0], t[1] * 1, 1), e;
 }
 function V2(n) {
-  const t = qe(n, tt.__wbindgen_malloc), e = te, r = tt.u8vec_to_ml_kem_pke_pk(t, e);
+  const t = Qe(n, tt.__wbindgen_malloc), e = te, r = tt.u8vec_to_ml_kem_pke_pk(t, e);
   if (r[2])
     throw Ui(r[1]);
   return bs.__wrap(r[0]);
 }
 function q2(n) {
-  const t = qe(n, tt.__wbindgen_malloc), e = te, r = tt.u8vec_to_ml_kem_pke_sk(t, e);
+  const t = Qe(n, tt.__wbindgen_malloc), e = te, r = tt.u8vec_to_ml_kem_pke_sk(t, e);
   if (r[2])
     throw Ui(r[1]);
   return Mi.__wrap(r[0]);
@@ -30907,7 +30907,7 @@ class qs {
    */
   get ciphertext() {
     const t = tt.__wbg_get_typedciphertext_ciphertext(this.__wbg_ptr);
-    var e = Ve(t[0], t[1]).slice();
+    var e = qe(t[0], t[1]).slice();
     return tt.__wbindgen_free(t[0], t[1] * 1, 1), e;
   }
   /**
@@ -30915,7 +30915,7 @@ class qs {
    * @param {Uint8Array} arg0
    */
   set ciphertext(t) {
-    const e = qe(t, tt.__wbindgen_malloc), r = te;
+    const e = Qe(t, tt.__wbindgen_malloc), r = te;
     tt.__wbg_set_eip712domainmsg_name(this.__wbg_ptr, e, r);
   }
   /**
@@ -30940,7 +30940,7 @@ class qs {
    */
   get external_handle() {
     const t = tt.__wbg_get_typedciphertext_external_handle(this.__wbg_ptr);
-    var e = Ve(t[0], t[1]).slice();
+    var e = qe(t[0], t[1]).slice();
     return tt.__wbindgen_free(t[0], t[1] * 1, 1), e;
   }
   /**
@@ -30948,7 +30948,7 @@ class qs {
    * @param {Uint8Array} arg0
    */
   set external_handle(t) {
-    const e = qe(t, tt.__wbindgen_malloc), r = te;
+    const e = Qe(t, tt.__wbindgen_malloc), r = te;
     tt.__wbg_set_eip712domainmsg_version(this.__wbg_ptr, e, r);
   }
   /**
@@ -30991,7 +30991,7 @@ class f_ {
    */
   get bytes() {
     const t = tt.__wbg_get_typedplaintext_bytes(this.__wbg_ptr);
-    var e = Ve(t[0], t[1]).slice();
+    var e = qe(t[0], t[1]).slice();
     return tt.__wbindgen_free(t[0], t[1] * 1, 1), e;
   }
   /**
@@ -30999,7 +30999,7 @@ class f_ {
    * @param {Uint8Array} arg0
    */
   set bytes(t) {
-    const e = qe(t, tt.__wbindgen_malloc), r = te;
+    const e = Qe(t, tt.__wbindgen_malloc), r = te;
     tt.__wbg_set_eip712domainmsg_name(this.__wbg_ptr, e, r);
   }
   /**
@@ -31062,7 +31062,7 @@ class Qs {
    */
   get signcrypted_ciphertext() {
     const t = tt.__wbg_get_typedsigncryptedciphertext_signcrypted_ciphertext(this.__wbg_ptr);
-    var e = Ve(t[0], t[1]).slice();
+    var e = qe(t[0], t[1]).slice();
     return tt.__wbindgen_free(t[0], t[1] * 1, 1), e;
   }
   /**
@@ -31071,7 +31071,7 @@ class Qs {
    * @param {Uint8Array} arg0
    */
   set signcrypted_ciphertext(t) {
-    const e = qe(t, tt.__wbindgen_malloc), r = te;
+    const e = Qe(t, tt.__wbindgen_malloc), r = te;
     tt.__wbg_set_eip712domainmsg_name(this.__wbg_ptr, e, r);
   }
   /**
@@ -31080,7 +31080,7 @@ class Qs {
    */
   get external_handle() {
     const t = tt.__wbg_get_typedsigncryptedciphertext_external_handle(this.__wbg_ptr);
-    var e = Ve(t[0], t[1]).slice();
+    var e = qe(t[0], t[1]).slice();
     return tt.__wbindgen_free(t[0], t[1] * 1, 1), e;
   }
   /**
@@ -31088,7 +31088,7 @@ class Qs {
    * @param {Uint8Array} arg0
    */
   set external_handle(t) {
-    const e = qe(t, tt.__wbindgen_malloc), r = te;
+    const e = Qe(t, tt.__wbindgen_malloc), r = te;
     tt.__wbg_set_eip712domainmsg_version(this.__wbg_ptr, e, r);
   }
   /**
@@ -31129,14 +31129,14 @@ class l_ {
    */
   get signature() {
     const t = tt.__wbg_get_userdecryptionresponse_signature(this.__wbg_ptr);
-    var e = Ve(t[0], t[1]).slice();
+    var e = qe(t[0], t[1]).slice();
     return tt.__wbindgen_free(t[0], t[1] * 1, 1), e;
   }
   /**
    * @param {Uint8Array} arg0
    */
   set signature(t) {
-    const e = qe(t, tt.__wbindgen_malloc), r = te;
+    const e = Qe(t, tt.__wbindgen_malloc), r = te;
     tt.__wbg_set_eip712domainmsg_name(this.__wbg_ptr, e, r);
   }
   /**
@@ -31152,7 +31152,7 @@ class l_ {
    */
   get external_signature() {
     const t = tt.__wbg_get_userdecryptionresponse_external_signature(this.__wbg_ptr);
-    var e = Ve(t[0], t[1]).slice();
+    var e = qe(t[0], t[1]).slice();
     return tt.__wbindgen_free(t[0], t[1] * 1, 1), e;
   }
   /**
@@ -31167,7 +31167,7 @@ class l_ {
    * @param {Uint8Array} arg0
    */
   set external_signature(t) {
-    const e = qe(t, tt.__wbindgen_malloc), r = te;
+    const e = Qe(t, tt.__wbindgen_malloc), r = te;
     tt.__wbg_set_eip712domainmsg_version(this.__wbg_ptr, e, r);
   }
   /**
@@ -31192,7 +31192,7 @@ class l_ {
    */
   get extra_data() {
     const t = tt.__wbg_get_userdecryptionresponse_extra_data(this.__wbg_ptr);
-    var e = Ve(t[0], t[1]).slice();
+    var e = qe(t[0], t[1]).slice();
     return tt.__wbindgen_free(t[0], t[1] * 1, 1), e;
   }
   /**
@@ -31200,7 +31200,7 @@ class l_ {
    * @param {Uint8Array} arg0
    */
   set extra_data(t) {
-    const e = qe(t, tt.__wbindgen_malloc), r = te;
+    const e = Qe(t, tt.__wbindgen_malloc), r = te;
     tt.__wbg_set_eip712domainmsg_chain_id(this.__wbg_ptr, e, r);
   }
 }
@@ -31229,7 +31229,7 @@ class No {
    */
   get verification_key() {
     const t = tt.__wbg_get_userdecryptionresponsepayload_verification_key(this.__wbg_ptr);
-    var e = Ve(t[0], t[1]).slice();
+    var e = qe(t[0], t[1]).slice();
     return tt.__wbindgen_free(t[0], t[1] * 1, 1), e;
   }
   /**
@@ -31239,7 +31239,7 @@ class No {
    * @param {Uint8Array} arg0
    */
   set verification_key(t) {
-    const e = qe(t, tt.__wbindgen_malloc), r = te;
+    const e = Qe(t, tt.__wbindgen_malloc), r = te;
     tt.__wbg_set_eip712domainmsg_name(this.__wbg_ptr, e, r);
   }
   /**
@@ -31250,7 +31250,7 @@ class No {
    */
   get digest() {
     const t = tt.__wbg_get_userdecryptionresponsepayload_digest(this.__wbg_ptr);
-    var e = Ve(t[0], t[1]).slice();
+    var e = qe(t[0], t[1]).slice();
     return tt.__wbindgen_free(t[0], t[1] * 1, 1), e;
   }
   /**
@@ -31260,7 +31260,7 @@ class No {
    * @param {Uint8Array} arg0
    */
   set digest(t) {
-    const e = qe(t, tt.__wbindgen_malloc), r = te;
+    const e = Qe(t, tt.__wbindgen_malloc), r = te;
     tt.__wbg_set_eip712domainmsg_version(this.__wbg_ptr, e, r);
   }
   /**
@@ -31337,7 +31337,7 @@ function J2() {
   const n = {};
   return n.wbg = {}, n.wbg.__wbg_String_8f0eb39a4a4c2f66 = function(t, e) {
     const r = String(e), i = Si(r, tt.__wbindgen_malloc, tt.__wbindgen_realloc), o = te;
-    Ue().setInt32(t + 4 * 1, o, !0), Ue().setInt32(t + 4 * 0, i, !0);
+    Me().setInt32(t + 4 * 1, o, !0), Me().setInt32(t + 4 * 0, i, !0);
   }, n.wbg.__wbg_buffer_609cc3eee51ed158 = function(t) {
     return t.buffer;
   }, n.wbg.__wbg_call_672a4d21634d4a24 = function() {
@@ -31435,7 +31435,7 @@ function J2() {
     t.set(e, r >>> 0);
   }, n.wbg.__wbg_stack_0ed75d68575b0f3c = function(t, e) {
     const r = e.stack, i = Si(r, tt.__wbindgen_malloc, tt.__wbindgen_realloc), o = te;
-    Ue().setInt32(t + 4 * 1, o, !0), Ue().setInt32(t + 4 * 0, i, !0);
+    Me().setInt32(t + 4 * 1, o, !0), Me().setInt32(t + 4 * 0, i, !0);
   }, n.wbg.__wbg_static_accessor_GLOBAL_88a902d13a557d07 = function() {
     const t = typeof Co > "u" ? null : Co;
     return ai(t) ? 0 : Wi(t);
@@ -31473,7 +31473,7 @@ function J2() {
     return typeof e == "boolean" ? e ? 1 : 0 : 2;
   }, n.wbg.__wbindgen_debug_string = function(t, e) {
     const r = Cu(e), i = Si(r, tt.__wbindgen_malloc, tt.__wbindgen_realloc), o = te;
-    Ue().setInt32(t + 4 * 1, o, !0), Ue().setInt32(t + 4 * 0, i, !0);
+    Me().setInt32(t + 4 * 1, o, !0), Me().setInt32(t + 4 * 0, i, !0);
   }, n.wbg.__wbindgen_error_new = function(t, e) {
     return new Error(Rs(t, e));
   }, n.wbg.__wbindgen_in = function(t, e) {
@@ -31498,11 +31498,11 @@ function J2() {
     return tt.memory;
   }, n.wbg.__wbindgen_number_get = function(t, e) {
     const r = e, i = typeof r == "number" ? r : void 0;
-    Ue().setFloat64(t + 8 * 1, ai(i) ? 0 : i, !0), Ue().setInt32(t + 4 * 0, !ai(i), !0);
+    Me().setFloat64(t + 8 * 1, ai(i) ? 0 : i, !0), Me().setInt32(t + 4 * 0, !ai(i), !0);
   }, n.wbg.__wbindgen_string_get = function(t, e) {
     const r = e, i = typeof r == "string" ? r : void 0;
     var o = ai(i) ? 0 : Si(i, tt.__wbindgen_malloc, tt.__wbindgen_realloc), a = te;
-    Ue().setInt32(t + 4 * 1, a, !0), Ue().setInt32(t + 4 * 0, o, !0);
+    Me().setInt32(t + 4 * 1, a, !0), Me().setInt32(t + 4 * 0, o, !0);
   }, n.wbg.__wbindgen_string_new = function(t, e) {
     return Rs(t, e);
   }, n.wbg.__wbindgen_throw = function(t, e) {
@@ -31527,7 +31527,7 @@ async function h_(n) {
 const Y2 = BigInt(1024 * 1024 * 512), p_ = BigInt(1024 * 1024 * 512), w_ = BigInt(1024 * 1024 * 512), Cs = (n) => n ? n.endsWith("/") ? n.slice(0, -1) : n : "", Xp = (n) => {
   let t = n.toString(16);
   return t.length % 2 ? "0" + t : t;
-}, He = (n) => {
+}, Ve = (n) => {
   const t = n.replace(/^(0x)/, "").match(/.{1,2}/g);
   return t ? Uint8Array.from(t.map((e) => parseInt(e, 16))) : new Uint8Array();
 };
@@ -31564,12 +31564,12 @@ function Fg(n) {
   if (n instanceof Error && typeof n.cause == "object" && n.cause !== null)
     return n.cause;
 }
-function IA(n) {
+function TA(n) {
   const t = Fg(n);
   if (!(!t || !("code" in t) || !t.code) && typeof t.code == "string")
     return t.code;
 }
-function OA(n) {
+function CA(n) {
   const t = Fg(n);
   if (!(!t || !("status" in t) || t.status === void 0) && typeof t.status == "number")
     return t.status;
@@ -31946,12 +31946,12 @@ const hA = (n, t, e, r, i, o, a, u) => async (_, l, f, g, y, v, F, k, T) => {
   const E = "0x00";
   let R, S;
   try {
-    R = TKMS.u8vec_to_ml_kem_pke_pk(He(f)), S = TKMS.u8vec_to_ml_kem_pke_sk(He(l));
+    R = TKMS.u8vec_to_ml_kem_pke_pk(Ve(f)), S = TKMS.u8vec_to_ml_kem_pke_sk(Ve(l));
   } catch (dt) {
     throw new Error("Invalid public or private key", { cause: dt });
   }
   const B = g.replace(/^(0x)/, ""), O = f.replace(/^(0x)/, ""), C = _.map((dt) => ({
-    handle: typeof dt.handle == "string" ? _r(He(dt.handle), !0) : _r(dt.handle, !0),
+    handle: typeof dt.handle == "string" ? _r(Ve(dt.handle), !0) : _r(dt.handle, !0),
     contractAddress: Ro(dt.contractAddress)
   }));
   Mg(C.map((dt) => dt.handle)), lA(BigInt(F), BigInt(k));
@@ -32018,9 +32018,9 @@ const hA = (n, t, e, r, i, o, a, u) => async (_, l, f, g, y, v, F, k, T) => {
   if (n > e)
     throw new Error(`The value exceeds the limit for ${t}bits integer (${e.toString()}).`);
 }, pA = ({ aclContractAddress: n, chainId: t, tfheCompactPublicKey: e, publicParams: r, contractAddress: i, userAddress: o }) => {
-  if (!Ge(i))
+  if (!He(i))
     throw new Error("Contract address is not a valid address.");
-  if (!Ge(o))
+  if (!He(o))
     throw new Error("User address is not a valid address.");
   const a = e, u = [], _ = TFHE.CompactCiphertextList.builder(a);
   let l = new Uint8Array();
@@ -32056,7 +32056,7 @@ const hA = (n, t, e, r, i, o, a, u) => async (_, l, f, g, y, v, F, k, T) => {
       return ir(g, 128), f(128), _.push_u128(BigInt(g)), u.push(128), this;
     },
     addAddress(g) {
-      if (!Ge(g))
+      if (!He(g))
         throw new Error("The value must be a valid address.");
       return f(160), _.push_u160(BigInt(g)), u.push(160), this;
     },
@@ -32090,7 +32090,7 @@ const hA = (n, t, e, r, i, o, a, u) => async (_, l, f, g, y, v, F, k, T) => {
         if (!N)
           throw new Error(`Too many bits in provided values. Maximum is ${C[C.length - 1]}.`);
         return N;
-      })(), v = r[y].publicParams, F = He(i), k = He(o), T = He(n), E = He(t.toString(16).padStart(64, "0")), R = new Uint8Array(F.length + k.length + T.length + 32);
+      })(), v = r[y].publicParams, F = Ve(i), k = Ve(o), T = Ve(n), E = Ve(t.toString(16).padStart(64, "0")), R = new Uint8Array(F.length + k.length + T.length + 32);
       return R.set(F, 0), R.set(k, 20), R.set(T, 40), R.set(E, R.length - E.length), l = _.build_with_proof_packed(v, R, TFHE.ZkComputeLoad.Verify).safe_serialize(Y2), l;
     }
   };
@@ -32107,17 +32107,17 @@ const hA = (n, t, e, r, i, o, a, u) => async (_, l, f, g, y, v, F, k, T) => {
   512: 9,
   1024: 10,
   2048: 11
-}, dA = BigInt("18446744073709551615"), gA = (n, t, e, r, i) => {
-  const o = rh("keccak256").update(Xe.from(n)).digest(), a = Xe.from(He(e)), u = r.toString(16).padStart(64, "0"), _ = Xe.from(u, "hex");
+}, dA = BigInt("18446744073709551615"), gA = "ZK-w_rct", yA = "ZK-w_hdl", bA = (n, t, e, r, i) => {
+  const o = rh("keccak256").update(Ce.from(gA)).update(Ce.from(n)).digest(), a = Ce.from(Ve(e)), u = r.toString(16).padStart(64, "0"), _ = Ce.from(u, "hex");
   return t.map((f, g) => {
-    const y = wA[f], v = Xe.from([g]), F = rh("keccak256").update(o).update(v).update(a).update(_).digest(), k = new Uint8Array(32);
+    const y = wA[f], v = Ce.from([g]), F = rh("keccak256").update(Ce.from(yA)).update(o).update(v).update(a).update(_).digest(), k = new Uint8Array(32);
     if (k.set(F, 0), BigInt(r) > dA)
       throw new Error("ChainId exceeds maximum allowed value (8 bytes)");
-    const T = He(u).slice(24, 32);
+    const T = Ve(u).slice(24, 32);
     return k[21] = g, k.set(T, 22), k[30] = y, k[31] = i, k;
   });
-}, nw = (n) => Ut(n), yA = () => 0;
-function bA(n, t, e) {
+}, nw = (n) => Ut(n), mA = () => 0;
+function AA(n, t, e) {
   const r = /* @__PURE__ */ new Map();
   t.forEach((i, o) => {
     if (r.has(i)) {
@@ -32131,14 +32131,14 @@ function bA(n, t, e) {
       throw new Error(`Invalid address found: ${i} is not in the list of coprocessor signers`);
   return t.length >= e;
 }
-function mA(n) {
+function EA(n) {
   const t = n.response;
   return typeof t != "object" || t === null || !("handles" in t && Array.isArray(t.handles)) || !("signatures" in t && Array.isArray(t.signatures)) ? !1 : t.signatures.every((e) => typeof e == "string") && t.handles.every((e) => typeof e == "string");
 }
-const AA = (n, t, e, r, i, o, a, u, _, l) => (f, g) => {
-  if (!Ge(f))
+const vA = (n, t, e, r, i, o, a, u, _, l) => (f, g) => {
+  if (!He(f))
     throw new Error("Contract address is not a valid address.");
-  if (!Ge(g))
+  if (!He(g))
     throw new Error("User address is not a valid address.");
   const y = pA({
     aclContractAddress: n,
@@ -32185,10 +32185,10 @@ const AA = (n, t, e, r, i, o, a, u, _, l) => (f, g) => {
         contractChainId: "0x" + e.toString(16),
         extraData: F
       }, R = await d_("INPUT_PROOF", `${i}/v1/input-proof`, E, v ?? l);
-      mA(R) || X2("INPUT_PROOF", R);
-      const S = gA(T, k, n, e, yA());
+      EA(R) || X2("INPUT_PROOF", R);
+      const S = bA(T, k, n, e, mA());
       if (R.response.handles && R.response.handles.length > 0) {
-        const D = R.response.handles.map(He);
+        const D = R.response.handles.map(Ve);
         if (S.length != D.length)
           throw new Error(`Incorrect Handles list sizes: (expected) ${S.length} != ${D.length} (received)`);
         for (let Et = 0; Et < S.length; Et += 1) {
@@ -32220,20 +32220,20 @@ const AA = (n, t, e, r, i, o, a, u, _, l) => (f, g) => {
           extraData: F
         }, Et);
       });
-      if (!bA(u, N, _))
+      if (!AA(u, N, _))
         throw Error("Coprocessor signers threshold is not reached");
       let J = Xp(S.length);
       const nt = B.length;
       return J += Xp(nt), S.map((D) => _r(D)).map((D) => J += D), B.map((D) => J += D.slice(2)), J += F.slice(2), {
         handles: S,
-        inputProof: He(J)
+        inputProof: Ve(J)
       };
     }
   };
-}, EA = [
+}, xA = [
   "function isAllowedForDecryption(bytes32 handle) view returns (bool)"
 ];
-function vA(n, t, e) {
+function RA(n, t, e) {
   const r = /* @__PURE__ */ new Map();
   t.forEach((i, o) => {
     if (r.has(i)) {
@@ -32247,7 +32247,7 @@ function vA(n, t, e) {
       throw new Error(`Invalid address found: ${i} is not in the list of KMS signers`);
   return t.length >= e;
 }
-const xA = {
+const zA = {
   0: "bool",
   2: "uint256",
   3: "uint256",
@@ -32257,23 +32257,23 @@ const xA = {
   7: "address",
   8: "uint256"
 };
-function RA(n, t) {
+function BA(n, t) {
   let e = [];
   for (const l of n) {
     const f = l.slice(-4, -2).toLowerCase(), g = parseInt(f, 16);
     e.push(g);
   }
   const r = "0x" + "00".repeat(32) + // dummy requestID (ignored)
-  t.slice(2) + "00".repeat(32), i = e.map((l) => xA[l]), u = new Ci().decode(["uint256", ...i, "bytes[]"], r).slice(1, 1 + e.length);
+  t.slice(2) + "00".repeat(32), i = e.map((l) => zA[l]), u = new Ci().decode(["uint256", ...i, "bytes[]"], r).slice(1, 1 + e.length);
   let _ = {};
   return n.forEach((l, f) => _[l] = u[f]), _;
 }
-const zA = (n, t, e, r, i, o, a, u) => async (_, l) => {
-  const f = "0x00", g = new tr(i, EA, a);
+const SA = (n, t, e, r, i, o, a, u) => async (_, l) => {
+  const f = "0x00", g = new tr(i, xA, a);
   let y;
   try {
     y = await Promise.all(_.map(async (L) => {
-      const J = _r(typeof L == "string" ? He(L) : L, !0);
+      const J = _r(typeof L == "string" ? Ve(L) : L, !0);
       if (!await g.isAllowedForDecryption(J))
         throw new Error(`Handle ${J} is not allowed for public decryption!`);
       return J;
@@ -32300,16 +32300,16 @@ const zA = (n, t, e, r, i, o, a, u) => async (_, l) => {
     const J = L.startsWith("0x") ? L : `0x${L}`;
     return Rd(k, T, { ctHandles: y, decryptedResult: R, extraData: B }, J);
   });
-  if (!vA(n, O, t))
+  if (!RA(n, O, t))
     throw Error("KMS signers threshold is not reached");
-  return RA(y, R);
-}, BA = (n, t) => (e, r, i, o, a) => {
+  return BA(y, R);
+}, kA = (n, t) => (e, r, i, o, a) => {
   const u = "0x00";
-  if (a && !Ge(a))
+  if (a && !He(a))
     throw new Error("Invalid delegated account.");
-  if (!Ge(n))
+  if (!He(n))
     throw new Error("Invalid verifying contract address.");
-  if (!r.every((v) => Ge(v)))
+  if (!r.every((v) => He(v)))
     throw new Error("Invalid contract address.");
   const _ = typeof e == "string" ? e.startsWith("0x") ? e : `0x${e}` : e, l = typeof i == "number" ? i.toString() : i, f = typeof o == "number" ? o.toString() : o, g = [
     { name: "name", type: "string" },
@@ -32368,7 +32368,7 @@ const zA = (n, t, e, r, i, o, a, u) => async (_, l) => {
       extraData: u
     }
   };
-}, SA = () => {
+}, PA = () => {
   const n = TKMS.ml_kem_pke_keygen();
   return {
     publicKey: _r(TKMS.ml_kem_pke_pk_to_u8vec(TKMS.ml_kem_pke_get_pk(n))),
@@ -32376,7 +32376,7 @@ const zA = (n, t, e, r, i, o, a, u) => async (_, l) => {
   };
 };
 ns.fetch = B2(ns.fetch, { retries: 5, retryDelay: 500 });
-const TA = {
+const NA = {
   // ACL_CONTRACT_ADDRESS (FHEVM Host chain)
   aclContractAddress: "0x687820221192C5B662b25367F70076A37bc79b6c",
   // KMS_VERIFIER_CONTRACT_ADDRESS (FHEVM Host chain)
@@ -32395,15 +32395,15 @@ const TA = {
   network: "https://eth-sepolia.public.blastapi.io",
   // Relayer URL
   relayerUrl: "https://relayer.testnet.zama.cloud"
-}, CA = async (n) => {
+}, LA = async (n) => {
   const { verifyingContractAddressDecryption: t, verifyingContractAddressInputVerification: e, publicKey: r, kmsContractAddress: i, aclContractAddress: o, gatewayChainId: a, auth: u } = n;
-  if (!i || !Ge(i))
+  if (!i || !He(i))
     throw new Error("KMS contract address is not valid or empty");
-  if (!t || !Ge(t))
+  if (!t || !He(t))
     throw new Error("Verifying contract for Decryption address is not valid or empty");
-  if (!e || !Ge(e))
+  if (!e || !He(e))
     throw new Error("Verifying contract for InputVerification address is not valid or empty");
-  if (!o || !Ge(o))
+  if (!o || !He(o))
     throw new Error("ACL contract address is not valid or empty");
   if (r && !(r.data instanceof Uint8Array))
     throw new Error("publicKey must be a Uint8Array");
@@ -32412,10 +32412,10 @@ const TA = {
     throw new Error("No network has been provided!");
   const l = await rA(_, n), f = await nA(n), g = await iA(n), y = await sA(_, n), v = await oA(_, n), F = await aA(_, n), k = await cA(_, n);
   return {
-    createEncryptedInput: AA(o, e, l, a, Cs(n.relayerUrl), f.publicKey, g, F, k),
-    generateKeypair: SA,
-    createEIP712: BA(t, l),
-    publicDecrypt: zA(y, v, a, t, o, Cs(n.relayerUrl), _, u && { auth: u }),
+    createEncryptedInput: vA(o, e, l, a, Cs(n.relayerUrl), f.publicKey, g, F, k),
+    generateKeypair: PA,
+    createEIP712: kA(t, l),
+    publicDecrypt: SA(y, v, a, t, o, Cs(n.relayerUrl), _, u && { auth: u }),
     userDecrypt: hA(y, a, l, t, o, Cs(n.relayerUrl), _, u && { auth: u }),
     getPublicKey: () => f.publicKey ? {
       publicKey: f.publicKey.safe_serialize(p_),
@@ -32428,7 +32428,7 @@ const TA = {
   };
 };
 let iw = !1;
-const NA = async ({ tfheParams: n, kmsParams: t, thread: e } = {}) => (e == null && (e = navigator.hardwareConcurrency), await S2() || (console.warn(`This browser does not support threads. Verify that your server returns correct headers:
+const DA = async ({ tfheParams: n, kmsParams: t, thread: e } = {}) => (e == null && (e = navigator.hardwareConcurrency), await S2() || (console.warn(`This browser does not support threads. Verify that your server returns correct headers:
 `, `'Cross-Origin-Opener-Policy': 'same-origin'
 `, "'Cross-Origin-Embedder-Policy': 'require-corp'"), e = void 0), iw || (await ro({ module_or_path: n }), await h_({
   module_or_path: t
@@ -32437,8 +32437,8 @@ window.TFHE = {
   default: ro,
   initThreadPool: __,
   init_panic_hook: u_,
-  TfheCompactPublicKey: Ze,
-  CompactPkeCrs: $e,
+  TfheCompactPublicKey: Xe,
+  CompactPkeCrs: Ye,
   CompactCiphertextList: ui,
   ZkComputeLoad: Bg
 };
@@ -32456,11 +32456,11 @@ window.TKMS = {
 };
 export {
   wA as ENCRYPTION_TYPES,
-  TA as SepoliaConfig,
-  BA as createEIP712,
-  CA as createInstance,
-  SA as generateKeypair,
-  IA as getErrorCauseCode,
-  OA as getErrorCauseStatus,
-  NA as initSDK
+  NA as SepoliaConfig,
+  kA as createEIP712,
+  LA as createInstance,
+  PA as generateKeypair,
+  TA as getErrorCauseCode,
+  CA as getErrorCauseStatus,
+  DA as initSDK
 };