@omnity/ree-client-ts-sdk 0.3.4 → 0.3.5

package/dist/ree-sdk.es.js

@@ -2,7 +2,7 @@ var Mh = (e) => {
   throw TypeError(e);
 };
 var Lh = (e, t, n) => t.has(e) || Mh("Cannot " + n);
-var Fe = (e, t, n) => (Lh(e, t, "read from private field"), n ? n.call(e) : t.get(e)), rn = (e, t, n) => t.has(e) ? Mh("Cannot add the same private member more than once") : t instanceof WeakSet ? t.add(e) : t.set(e, n), Yt = (e, t, n, r) => (Lh(e, t, "write to private field"), r ? r.call(e, n) : t.set(e, n), n);
+var Fe = (e, t, n) => (Lh(e, t, "read from private field"), n ? n.call(e) : t.get(e)), sn = (e, t, n) => t.has(e) ? Mh("Cannot add the same private member more than once") : t instanceof WeakSet ? t.add(e) : t.set(e, n), Yt = (e, t, n, r) => (Lh(e, t, "write to private field"), r ? r.call(e, n) : t.set(e, n), n);
 var qh = (e, t, n, r) => ({
   set _(i) {
     Yt(e, t, i, n);
@@ -32,10 +32,10 @@ function P1(e, t) {
 function Ry(e) {
   return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
 }
-var Ou = {}, zs = {}, Dh;
+var Ou = {}, Ys = {}, Dh;
 function R1() {
-  if (Dh) return zs;
-  Dh = 1, zs.byteLength = c, zs.toByteArray = u, zs.fromByteArray = d;
+  if (Dh) return Ys;
+  Dh = 1, Ys.byteLength = c, Ys.toByteArray = u, Ys.fromByteArray = d;
   for (var e = [], t = [], n = typeof Uint8Array < "u" ? Uint8Array : Array, r = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", i = 0, s = r.length; i < s; ++i)
     e[i] = r[i], t[r.charCodeAt(i)] = i;
   t[45] = 62, t[95] = 63;
@@ -78,7 +78,7 @@ function R1() {
       e[g >> 10] + e[g >> 4 & 63] + e[g << 2 & 63] + "="
     )), S.join("");
   }
-  return zs;
+  return Ys;
 }
 var Tc = {};
 /*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */
@@ -1155,9 +1155,9 @@ const M1 = /* @__PURE__ */ Ry(F1);
 typeof globalThis > "u" && (globalThis.global = globalThis);
 typeof globalThis.Buffer > "u" && (globalThis.Buffer = C1.Buffer);
 typeof globalThis.process > "u" && (globalThis.process = M1);
-var it = {}, Nu = {}, We = {}, qt = {}, ku = {}, Ys = {}, Gh;
+var it = {}, Nu = {}, We = {}, qt = {}, ku = {}, Zs = {}, Gh;
 function L1() {
-  return Gh || (Gh = 1, Object.defineProperty(Ys, "__esModule", { value: !0 }), Ys.crypto = void 0, Ys.crypto = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0), Ys;
+  return Gh || (Gh = 1, Object.defineProperty(Zs, "__esModule", { value: !0 }), Zs.crypto = void 0, Zs.crypto = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0), Zs;
 }
 var Wh;
 function ui() {
@@ -1820,7 +1820,7 @@ function Cy() {
   }
   return We.SHA512_256 = S, We.sha256 = (0, n.createHasher)(() => new s()), We.sha224 = (0, n.createHasher)(() => new o()), We.sha512 = (0, n.createHasher)(() => new d()), We.sha384 = (0, n.createHasher)(() => new y()), We.sha512_256 = (0, n.createHasher)(() => new S()), We.sha512_224 = (0, n.createHasher)(() => new E()), We;
 }
-var Zs = {}, Pu = {}, Ru = {}, Zh;
+var Js = {}, Pu = {}, Ru = {}, Zh;
 function V1() {
   return Zh || (Zh = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.hmac = e.HMAC = void 0;
@@ -1869,7 +1869,7 @@ function V1() {
   })(Ru)), Ru;
 }
 var Uu = {}, Jh;
-function Ms() {
+function Ls() {
   return Jh || (Jh = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.notImplemented = e.bitMask = e.utf8ToBytes = e.randomBytes = e.isBytes = e.hexToBytes = e.concatBytes = e.bytesToUtf8 = e.bytesToHex = e.anumber = e.abytes = void 0, e.abool = s, e._abool2 = o, e._abytes2 = c, e.numberToHexUnpadded = a, e.hexToNumber = u, e.bytesToNumberBE = f, e.bytesToNumberLE = l, e.numberToBytesBE = d, e.numberToBytesLE = y, e.numberToVarBytesBE = g, e.ensureBytes = m, e.equalBytes = E, e.copyBytes = S, e.asciiToBytes = _, e.inRange = T, e.aInRange = O, e.bitLen = A, e.bitGet = R, e.bitSet = M, e.createHmacDrbg = U, e.validateObject = K, e.isHash = H, e._validateObject = D, e.memoized = $;
     /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
@@ -2087,12 +2087,12 @@ function Ms() {
     }
   })(Uu)), Uu;
 }
-var _n = {}, Je = {}, Qh;
+var Sn = {}, Je = {}, Qh;
 function rc() {
   if (Qh) return Je;
   Qh = 1, Object.defineProperty(Je, "__esModule", { value: !0 }), Je.isNegativeLE = void 0, Je.mod = l, Je.pow = d, Je.pow2 = y, Je.invert = g, Je.tonelliShanks = w, Je.FpSqrt = T, Je.validateField = R, Je.FpPow = M, Je.FpInvertBatch = v, Je.FpDiv = U, Je.FpLegendre = q, Je.FpIsSquare = K, Je.nLength = H, Je.Field = D, Je.FpSqrtOdd = P, Je.FpSqrtEven = $, Je.hashToPrivateScalar = F, Je.getFieldBytesLength = x, Je.getMinHashLength = B, Je.mapHashToField = L;
   /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-  const e = /* @__PURE__ */ Ms(), t = BigInt(0), n = BigInt(1), r = /* @__PURE__ */ BigInt(2), i = /* @__PURE__ */ BigInt(3), s = /* @__PURE__ */ BigInt(4), o = /* @__PURE__ */ BigInt(5), c = /* @__PURE__ */ BigInt(7), a = /* @__PURE__ */ BigInt(8), u = /* @__PURE__ */ BigInt(9), f = /* @__PURE__ */ BigInt(16);
+  const e = /* @__PURE__ */ Ls(), t = BigInt(0), n = BigInt(1), r = /* @__PURE__ */ BigInt(2), i = /* @__PURE__ */ BigInt(3), s = /* @__PURE__ */ BigInt(4), o = /* @__PURE__ */ BigInt(5), c = /* @__PURE__ */ BigInt(7), a = /* @__PURE__ */ BigInt(8), u = /* @__PURE__ */ BigInt(9), f = /* @__PURE__ */ BigInt(16);
   function l(N, V) {
     const G = N % V;
     return G >= t ? G : V + G;
@@ -2355,10 +2355,10 @@ function rc() {
 }
 var ed;
 function D1() {
-  if (ed) return _n;
-  ed = 1, Object.defineProperty(_n, "__esModule", { value: !0 }), _n.wNAF = void 0, _n.negateCt = i, _n.normalizeZ = s, _n.mulEndoUnsafe = E, _n.pippenger = S, _n.precomputeMSMUnsafe = _, _n.validateBasic = w, _n._createCurveFields = O;
+  if (ed) return Sn;
+  ed = 1, Object.defineProperty(Sn, "__esModule", { value: !0 }), Sn.wNAF = void 0, Sn.negateCt = i, Sn.normalizeZ = s, Sn.mulEndoUnsafe = E, Sn.pippenger = S, Sn.precomputeMSMUnsafe = _, Sn.validateBasic = w, Sn._createCurveFields = O;
   /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-  const e = /* @__PURE__ */ Ms(), t = /* @__PURE__ */ rc(), n = BigInt(0), r = BigInt(1);
+  const e = /* @__PURE__ */ Ls(), t = /* @__PURE__ */ rc(), n = BigInt(0), r = BigInt(1);
   function i(A, R) {
     const M = R.negate();
     return A ? M : R;
@@ -2497,7 +2497,7 @@ function D1() {
       return y(R) !== 1;
     }
   }
-  _n.wNAF = m;
+  Sn.wNAF = m;
   function E(A, R, M, v) {
     let U = R, q = A.ZERO, K = A.ZERO;
     for (; M > n || v > n; )
@@ -2591,14 +2591,14 @@ function D1() {
         throw new Error(`CURVE.${D} must be valid field element of CURVE.Fp`);
     return R = Object.freeze(Object.assign({}, R)), { CURVE: R, Fp: U, Fn: q };
   }
-  return _n;
+  return Sn;
 }
 var td;
 function Hy() {
   return td || (td = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.DER = e.DERErr = void 0, e._splitEndoScalar = c, e._normFnElement = E, e.weierstrassN = S, e.SWUFpSqrtRatio = w, e.mapToCurveSimpleSWU = T, e.ecdh = A, e.ecdsa = R, e.weierstrassPoints = M, e._legacyHelperEquat = q, e.weierstrass = D;
     /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-    const t = /* @__PURE__ */ V1(), n = /* @__PURE__ */ ui(), r = /* @__PURE__ */ Ms(), i = /* @__PURE__ */ D1(), s = /* @__PURE__ */ rc(), o = (P, $) => (P + (P >= 0 ? $ : -$) / y) / $;
+    const t = /* @__PURE__ */ V1(), n = /* @__PURE__ */ ui(), r = /* @__PURE__ */ Ls(), i = /* @__PURE__ */ D1(), s = /* @__PURE__ */ rc(), o = (P, $) => (P + (P >= 0 ? $ : -$) / y) / $;
     function c(P, $, F) {
       const [[x, B], [L, N]] = $, V = o(N * P, F), G = o(-B * P, F);
       let X = P - V * x - G * L, Y = -V * B - G * N;
@@ -3462,8 +3462,8 @@ function Hy() {
 }
 var nd;
 function $1() {
-  if (nd) return Zs;
-  nd = 1, Object.defineProperty(Zs, "__esModule", { value: !0 }), Zs.getHash = t, Zs.createCurve = n;
+  if (nd) return Js;
+  nd = 1, Object.defineProperty(Js, "__esModule", { value: !0 }), Js.getHash = t, Js.createCurve = n;
   /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
   const e = /* @__PURE__ */ Hy();
   function t(r) {
@@ -3473,13 +3473,13 @@ function $1() {
     const s = (o) => (0, e.weierstrass)({ ...r, hash: o });
     return { ...s(i), create: s };
   }
-  return Zs;
+  return Js;
 }
 var Cu = {}, rd;
 function j1() {
   return rd || (rd = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e._DST_scalar = void 0, e.expand_message_xmd = a, e.expand_message_xof = u, e.hash_to_field = f, e.isogenyMap = l, e.createHasher = d;
-    const t = /* @__PURE__ */ Ms(), n = /* @__PURE__ */ rc(), r = t.bytesToNumberBE;
+    const t = /* @__PURE__ */ Ls(), n = /* @__PURE__ */ rc(), r = t.bytesToNumberBE;
     function i(y, g) {
       if (o(y), o(g), y < 0 || y >= 1 << 8 * g)
         throw new Error("invalid I2OSP input: " + y);
@@ -3609,7 +3609,7 @@ function K1() {
   return id || (id = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.encodeToCurve = e.hashToCurve = e.secp256k1_hasher = e.schnorr = e.secp256k1 = void 0;
     /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-    const t = /* @__PURE__ */ Cy(), n = /* @__PURE__ */ ui(), r = /* @__PURE__ */ $1(), i = /* @__PURE__ */ j1(), s = /* @__PURE__ */ rc(), o = /* @__PURE__ */ Hy(), c = /* @__PURE__ */ Ms(), a = {
+    const t = /* @__PURE__ */ Cy(), n = /* @__PURE__ */ ui(), r = /* @__PURE__ */ $1(), i = /* @__PURE__ */ j1(), s = /* @__PURE__ */ rc(), o = /* @__PURE__ */ Hy(), c = /* @__PURE__ */ Ls(), a = {
       p: BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),
       n: BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),
       h: BigInt(1),
@@ -3770,7 +3770,7 @@ var pe = {}, sd;
 function G1() {
   if (sd) return pe;
   sd = 1, Object.defineProperty(pe, "__esModule", { value: !0 }), pe.isHash = pe.validateObject = pe.memoized = pe.notImplemented = pe.createHmacDrbg = pe.bitMask = pe.bitSet = pe.bitGet = pe.bitLen = pe.aInRange = pe.inRange = pe.asciiToBytes = pe.copyBytes = pe.equalBytes = pe.ensureBytes = pe.numberToVarBytesBE = pe.numberToBytesLE = pe.numberToBytesBE = pe.bytesToNumberLE = pe.bytesToNumberBE = pe.hexToNumber = pe.numberToHexUnpadded = pe.abool = pe.utf8ToBytes = pe.randomBytes = pe.isBytes = pe.hexToBytes = pe.concatBytes = pe.bytesToUtf8 = pe.bytesToHex = pe.anumber = pe.abytes = void 0;
-  const e = /* @__PURE__ */ Ms();
+  const e = /* @__PURE__ */ Ls();
   return pe.abytes = e.abytes, pe.anumber = e.anumber, pe.bytesToHex = e.bytesToHex, pe.bytesToUtf8 = e.bytesToUtf8, pe.concatBytes = e.concatBytes, pe.hexToBytes = e.hexToBytes, pe.isBytes = e.isBytes, pe.randomBytes = e.randomBytes, pe.utf8ToBytes = e.utf8ToBytes, pe.abool = e.abool, pe.numberToHexUnpadded = e.numberToHexUnpadded, pe.hexToNumber = e.hexToNumber, pe.bytesToNumberBE = e.bytesToNumberBE, pe.bytesToNumberLE = e.bytesToNumberLE, pe.numberToBytesBE = e.numberToBytesBE, pe.numberToBytesLE = e.numberToBytesLE, pe.numberToVarBytesBE = e.numberToVarBytesBE, pe.ensureBytes = e.ensureBytes, pe.equalBytes = e.equalBytes, pe.copyBytes = e.copyBytes, pe.asciiToBytes = e.asciiToBytes, pe.inRange = e.inRange, pe.aInRange = e.aInRange, pe.bitLen = e.bitLen, pe.bitGet = e.bitGet, pe.bitSet = e.bitSet, pe.bitMask = e.bitMask, pe.createHmacDrbg = e.createHmacDrbg, pe.notImplemented = e.notImplemented, pe.memoized = e.memoized, pe.validateObject = e.validateObject, pe.isHash = e.isHash, pe;
 }
 var od;
@@ -4404,7 +4404,7 @@ function de(e, t) {
       return e[r] < t[r] ? -1 : 1;
   return e.length === t.length ? 0 : e.length > t.length ? 1 : -1;
 }
-function wn(e, t, n) {
+function bn(e, t, n) {
   if (t + 1 > e.length)
     throw new Error("Offset is outside the bounds of Uint8Array");
   if (n > 255)
@@ -4448,7 +4448,7 @@ function cb(e, t, n) {
     return r = (r << 8) + e[t], r = (r << 8) + e[t + 1], r;
   }
 }
-function Ls(e, t, n) {
+function qs(e, t, n) {
   if (t + 4 > e.length)
     throw new Error("Offset is outside the bounds of Uint8Array");
   if (n = n.toUpperCase(), n === "LE") {
@@ -4501,7 +4501,7 @@ function Gy(e) {
 }
 function ub(e, t, n) {
   const r = Gy(t);
-  return r === 1 ? wn(e, n, t) : r === 2 ? (wn(e, n, Ge.OP_PUSHDATA1), wn(e, n + 1, t)) : r === 3 ? (wn(e, n, Ge.OP_PUSHDATA2), sb(e, n + 1, t, "LE")) : (wn(e, n, Ge.OP_PUSHDATA4), ic(e, n + 1, t, "LE")), r;
+  return r === 1 ? bn(e, n, t) : r === 2 ? (bn(e, n, Ge.OP_PUSHDATA1), bn(e, n + 1, t)) : r === 3 ? (bn(e, n, Ge.OP_PUSHDATA2), sb(e, n + 1, t, "LE")) : (bn(e, n, Ge.OP_PUSHDATA4), ic(e, n + 1, t, "LE")), r;
 }
 function fb(e, t) {
   const n = Br(e, t);
@@ -4517,7 +4517,7 @@ function fb(e, t) {
   } else {
     if (t + 5 > e.length) return null;
     if (n !== Ge.OP_PUSHDATA4) throw new Error("Unexpected opcode");
-    r = Ls(e, t + 1, "LE"), i = 5;
+    r = qs(e, t + 1, "LE"), i = 5;
   }
   return {
     opcode: n,
@@ -4532,8 +4532,8 @@ function hb(e) {
   let t = Math.abs(e);
   const n = lb(t), r = new Uint8Array(n), i = e < 0;
   for (let s = 0; s < n; ++s)
-    wn(r, s, t & 255), t >>= 8;
-  return r[n - 1] & 128 ? wn(r, n - 1, i ? 128 : 0) : i && (r[n - 1] |= 128), r;
+    bn(r, s, t & 255), t >>= 8;
+  return r[n - 1] & 128 ? bn(r, n - 1, i ? 128 : 0) : i && (r[n - 1] |= 128), r;
 }
 var Hu;
 function db(e) {
@@ -4711,11 +4711,11 @@ function Yy() {
     }
   };
 }
-function ln(e, t) {
+function hn(e, t) {
   return {
     kind: "schema",
     type: "array",
-    reference: ln,
+    reference: hn,
     expects: "Array",
     async: !1,
     item: e,
@@ -4826,11 +4826,11 @@ function Jy(e, ...t) {
   };
   return 0 in t && (n.default = t[0]), n;
 }
-function un(e) {
+function fn(e) {
   return {
     kind: "schema",
     type: "number",
-    reference: un,
+    reference: fn,
     expects: "number",
     async: !1,
     message: e,
@@ -5022,7 +5022,7 @@ function fi(e, t) {
     n[r] = da(e.entries[r]);
   return { ...e, entries: n };
 }
-function qs(...e) {
+function Vs(...e) {
   return {
     ...e[0],
     pipe: e,
@@ -5041,7 +5041,7 @@ function qs(...e) {
 }
 const ad = new Uint8Array(32), ud = Ur(
   "fffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"
-), vt = (e) => qs(Wa(Uint8Array), Xy(e));
+), vt = (e) => Vs(Wa(Uint8Array), Xy(e));
 function Io(e, t) {
   return e.length !== t.length ? !1 : e.every((n, r) => de(n, t[r]) === 0);
 }
@@ -5062,18 +5062,18 @@ function Qy(e) {
   return Array.isArray(e) ? e.length !== 2 ? !1 : e.every((t) => Qy(t)) : Ol(e);
 }
 const Sb = vt(32), Tb = vt(20), fd = vt(32), $e = Wa(Uint8Array);
-qs(Yi(), zy(/^([0-9a-f]{2})+$/i));
-const xb = qs(
-  un(),
+Vs(Yi(), zy(/^([0-9a-f]{2})+$/i));
+const xb = Vs(
+  fn(),
   Al(),
   Ka(0),
   ja(255)
-), wr = qs(
-  un(),
+), wr = Vs(
+  fn(),
   Al(),
   Ka(0),
   ja(4294967295)
-), Fu = qs(
+), Fu = Vs(
   Zy(),
   Ka(0n),
   ja(0x7fffffffffffffffn)
@@ -5110,7 +5110,7 @@ function vb(e, t) {
   ), !Nl(t))
     throw new Error("Invalid hashType " + t);
   const n = new Uint8Array(1);
-  wn(n, 0, t);
+  bn(n, 0, t);
   const r = dd(e.slice(0, 32)), i = dd(e.slice(32, 64));
   return ct([Q1(r, i), n]);
 }
@@ -5118,15 +5118,15 @@ const Ib = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   decode: Ab,
   encode: vb
-}, Symbol.toStringTag, { value: "Module" })), eg = Ge.OP_RESERVED, tg = ln(Il([Wa(Uint8Array), un()]));
+}, Symbol.toStringTag, { value: "Module" })), eg = Ge.OP_RESERVED, tg = hn(Il([Wa(Uint8Array), fn()]));
 function Ob(e) {
-  return Ga(un(), e) && (e === Ge.OP_0 || e >= Ge.OP_1 && e <= Ge.OP_16 || e === Ge.OP_1NEGATE);
+  return Ga(fn(), e) && (e === Ge.OP_0 || e >= Ge.OP_1 && e <= Ge.OP_16 || e === Ge.OP_1NEGATE);
 }
 function ng(e) {
   return Ga($e, e) || Ob(e);
 }
 function Bl(e) {
-  return Ga(qs(Yy(), Wy(ng)), e);
+  return Ga(Vs(Yy(), Wy(ng)), e);
 }
 function rg(e) {
   return e.length - e.filter(ng).length;
@@ -5147,7 +5147,7 @@ function Bb(e) {
 function ya(e) {
   return e instanceof Uint8Array;
 }
-function hn(e) {
+function nn(e) {
   if (ig(e)) return e;
   ot(tg, e);
   const t = e.reduce((i, s) => ya(s) ? s.length === 1 && pa(s) !== void 0 ? i + 1 : i + Gy(s.length) + s.length : i + 1, 0), n = new Uint8Array(t);
@@ -5156,12 +5156,12 @@ function hn(e) {
     if (ya(i)) {
       const s = pa(i);
       if (s !== void 0) {
-        wn(n, r, s), r += 1;
+        bn(n, r, s), r += 1;
         return;
       }
       r += ub(n, i.length, r), n.set(i, r), r += i.length;
     } else
-      wn(n, r, i), r += 1;
+      bn(n, r, i), r += 1;
   }), r !== n.length) throw new Error("Could not decode chunks");
   return n;
 }
@@ -5244,11 +5244,11 @@ function Xa(e, t) {
     fi(
       _t({
         network: _t({}),
-        m: un(),
-        n: un(),
+        m: fn(),
+        n: fn(),
         output: $e,
-        pubkeys: ln(Kn($n), "Received invalid pubkey"),
-        signatures: ln(
+        pubkeys: hn(Kn($n), "Received invalid pubkey"),
+        signatures: hn(
           Kn(n),
           "Expected signature to be of type isAcceptableSignature"
         ),
@@ -5264,7 +5264,7 @@ function Xa(e, t) {
   }
   if (Te(i, "output", () => {
     if (e.m && i.n && e.pubkeys)
-      return hn(
+      return nn(
         [].concat(
           xc + e.m,
           e.pubkeys,
@@ -5286,7 +5286,7 @@ function Xa(e, t) {
       return ft(e.input).slice(1);
   }), Te(i, "input", () => {
     if (e.signatures)
-      return hn([ds.OP_0].concat(e.signatures));
+      return nn([ds.OP_0].concat(e.signatures));
   }), Te(i, "witness", () => {
     if (i.input)
       return [];
@@ -5295,7 +5295,7 @@ function Xa(e, t) {
       return `p2ms(${i.m} of ${i.n})`;
   }), t.validate) {
     if (e.output) {
-      if (c(e.output), ot(un(), s[0], { message: "Output is invalid" }), ot(un(), s[s.length - 2], {
+      if (c(e.output), ot(fn(), s[0], { message: "Output is invalid" }), ot(fn(), s[s.length - 2], {
         message: "Output is invalid"
       }), s[s.length - 1] !== ds.OP_CHECKMULTISIG)
         throw new TypeError("Output is invalid");
@@ -5353,7 +5353,7 @@ function sg(e, t) {
   const n = In(() => ft(e.input)), i = { name: "p2pk", network: e.network || Pn };
   if (Te(i, "output", () => {
     if (e.pubkey)
-      return hn([e.pubkey, yd.OP_CHECKSIG]);
+      return nn([e.pubkey, yd.OP_CHECKSIG]);
   }), Te(i, "pubkey", () => {
     if (e.output)
       return e.output.slice(1, -1);
@@ -5362,7 +5362,7 @@ function sg(e, t) {
       return n()[0];
   }), Te(i, "input", () => {
     if (e.signature)
-      return hn([e.signature]);
+      return nn([e.signature]);
   }), Te(i, "witness", () => {
     if (i.input)
       return [];
@@ -5914,7 +5914,7 @@ class cE extends kl {
     Di(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
   }
 }
-const bn = /* @__PURE__ */ za(() => new pg()), aE = /* @__PURE__ */ za(() => new iE()), uE = /* @__PURE__ */ za(() => new cE()), en = bn;
+const En = /* @__PURE__ */ za(() => new pg()), aE = /* @__PURE__ */ za(() => new iE()), uE = /* @__PURE__ */ za(() => new cE()), en = En;
 function Or(e) {
   return Xb(en(e));
 }
@@ -6660,14 +6660,14 @@ function cc(e, t) {
   if (Te(s, "address", () => {
     if (!s.hash) return;
     const o = new Uint8Array(21);
-    return wn(o, 0, i.pubKeyHash), o.set(s.hash, 1), Oo.encode(o);
+    return bn(o, 0, i.pubKeyHash), o.set(s.hash, 1), Oo.encode(o);
   }), Te(s, "hash", () => {
     if (e.output) return e.output.slice(3, 23);
     if (e.address) return n().hash;
     if (e.pubkey || s.pubkey) return Or(e.pubkey || s.pubkey);
   }), Te(s, "output", () => {
     if (s.hash)
-      return hn([
+      return nn([
         Vr.OP_DUP,
         Vr.OP_HASH160,
         s.hash,
@@ -6682,7 +6682,7 @@ function cc(e, t) {
       return r()[0];
   }), Te(s, "input", () => {
     if (e.pubkey && e.signature)
-      return hn([e.signature, e.pubkey]);
+      return nn([e.signature, e.pubkey]);
   }), Te(s, "witness", () => {
     if (s.input)
       return [];
@@ -6730,7 +6730,7 @@ function cc(e, t) {
   }
   return Object.assign(s, e);
 }
-const Js = Ge;
+const Qs = Ge;
 function ac(e, t) {
   if (!e.address && !e.hash && !e.output && !e.redeem && !e.input)
     throw new TypeError("Not enough data");
@@ -6746,11 +6746,11 @@ function ac(e, t) {
             network: _t({}),
             output: $e,
             input: $e,
-            witness: ln($e)
+            witness: hn($e)
           })
         ),
         input: $e,
-        witness: ln($e)
+        witness: hn($e)
       })
     ),
     e
@@ -6764,28 +6764,28 @@ function ac(e, t) {
     const c = s(), a = c[c.length - 1];
     return {
       network: n,
-      output: a === Js.OP_FALSE ? Uint8Array.from([]) : a,
-      input: hn(c.slice(0, -1)),
+      output: a === Qs.OP_FALSE ? Uint8Array.from([]) : a,
+      input: nn(c.slice(0, -1)),
       witness: e.witness || []
     };
   });
   if (Te(r, "address", () => {
     if (!r.hash) return;
     const c = new Uint8Array(21);
-    return wn(c, 0, r.network.scriptHash), c.set(r.hash, 1), Oo.encode(c);
+    return bn(c, 0, r.network.scriptHash), c.set(r.hash, 1), Oo.encode(c);
   }), Te(r, "hash", () => {
     if (e.output) return e.output.slice(2, 22);
     if (e.address) return i().hash;
     if (r.redeem && r.redeem.output) return Or(r.redeem.output);
   }), Te(r, "output", () => {
     if (r.hash)
-      return hn([Js.OP_HASH160, r.hash, Js.OP_EQUAL]);
+      return nn([Qs.OP_HASH160, r.hash, Qs.OP_EQUAL]);
   }), Te(r, "redeem", () => {
     if (e.input)
       return o();
   }), Te(r, "input", () => {
     if (!(!e.redeem || !e.redeem.input || !e.redeem.output))
-      return hn(
+      return nn(
         [].concat(ft(e.redeem.input), e.redeem.output)
       );
   }), Te(r, "witness", () => {
@@ -6808,7 +6808,7 @@ function ac(e, t) {
       c = e.hash;
     }
     if (e.output) {
-      if (e.output.length !== 23 || e.output[0] !== Js.OP_HASH160 || e.output[1] !== 20 || e.output[22] !== Js.OP_EQUAL)
+      if (e.output.length !== 23 || e.output[0] !== Qs.OP_HASH160 || e.output[1] !== 20 || e.output[22] !== Qs.OP_EQUAL)
         throw new TypeError("Output is invalid");
       const u = e.output.slice(2, 22);
       if (c.length > 0 && de(c, u) !== 0)
@@ -7019,7 +7019,7 @@ function Za(e, t) {
         output: vt(22),
         pubkey: Kn($n, "Not a valid pubkey"),
         signature: Kn(Nr),
-        witness: ln($e)
+        witness: hn($e)
       })
     ),
     e
@@ -7042,7 +7042,7 @@ function Za(e, t) {
     if (e.pubkey || i.pubkey) return Or(e.pubkey || i.pubkey);
   }), Te(i, "output", () => {
     if (i.hash)
-      return hn([Td.OP_0, i.hash]);
+      return nn([Td.OP_0, i.hash]);
   }), Te(i, "pubkey", () => {
     if (e.pubkey) return e.pubkey;
     if (e.witness)
@@ -7120,10 +7120,10 @@ function fc(e, t) {
         input: $e,
         network: _t({}),
         output: $e,
-        witness: ln($e)
+        witness: hn($e)
       }),
       input: vt(0),
-      witness: ln($e)
+      witness: hn($e)
     }),
     e
   );
@@ -7148,7 +7148,7 @@ function fc(e, t) {
     if (s.redeem && s.redeem.output) return en(s.redeem.output);
   }), Te(s, "output", () => {
     if (s.hash)
-      return hn([xd.OP_0, s.hash]);
+      return nn([xd.OP_0, s.hash]);
   }), Te(s, "redeem", () => {
     if (e.witness)
       return {
@@ -7249,36 +7249,36 @@ function Vf() {
 }
 const fr = (e) => Ur(e);
 function mE(e) {
-  Sn(typeof e.isXOnlyPoint == "function"), Sn(
+  Tn(typeof e.isXOnlyPoint == "function"), Tn(
     e.isXOnlyPoint(
       fr("79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798")
     )
-  ), Sn(
+  ), Tn(
     e.isXOnlyPoint(
       fr("fffffffffffffffffffffffffffffffffffffffffffffffffffffffeeffffc2e")
     )
-  ), Sn(
+  ), Tn(
     e.isXOnlyPoint(
       fr("f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9")
     )
-  ), Sn(
+  ), Tn(
     e.isXOnlyPoint(
       fr("0000000000000000000000000000000000000000000000000000000000000001")
     )
-  ), Sn(
+  ), Tn(
     !e.isXOnlyPoint(
       fr("0000000000000000000000000000000000000000000000000000000000000000")
     )
-  ), Sn(
+  ), Tn(
     !e.isXOnlyPoint(
       fr("fffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f")
     )
-  ), Sn(typeof e.xOnlyPointAddTweak == "function"), wE.forEach((t) => {
+  ), Tn(typeof e.xOnlyPointAddTweak == "function"), wE.forEach((t) => {
     const n = e.xOnlyPointAddTweak(fr(t.pubkey), fr(t.tweak));
-    t.result === null ? Sn(n === null) : (Sn(n !== null), Sn(n.parity === t.parity), Sn(de(n.xOnlyPubkey, fr(t.result)) === 0));
+    t.result === null ? Tn(n === null) : (Tn(n !== null), Tn(n.parity === t.parity), Tn(de(n.xOnlyPubkey, fr(t.result)) === 0));
   });
 }
-function Sn(e) {
+function Tn(e) {
   if (!e) throw new Error("ecc library invalid");
 }
 const wE = [
@@ -7378,7 +7378,7 @@ function li(e, t, n) {
   let r = 0;
   return e < 253 ? (t.set([Number(e)], n), r = 1) : e <= 65535 ? (t.set([253], n), bE(t, n + 1, Number(e), "LE"), r = 3) : e <= 4294967295 ? (t.set([254], n), EE(t, n + 1, Number(e), "LE"), r = 5) : (t.set([255], n), _E(t, n + 1, BigInt(e), "LE"), r = 9), { buffer: t, bytes: r };
 }
-function Vs(e, t) {
+function Ds(e, t) {
   t === void 0 && (t = 0);
   const n = e.at(t);
   if (n === void 0)
@@ -7442,7 +7442,7 @@ class $t {
     ]);
   }
   writeUInt8(t) {
-    this.offset = wn(this.buffer, this.offset, t);
+    this.offset = bn(this.buffer, this.offset, t);
   }
   writeInt32(t) {
     this.offset = $y(this.buffer, this.offset, t, "LE");
@@ -7495,7 +7495,7 @@ class BE {
     return this.offset += 4, t;
   }
   readUInt32() {
-    const t = Ls(this.buffer, this.offset, "LE");
+    const t = qs(this.buffer, this.offset, "LE");
     return this.offset += 4, t;
   }
   readInt64() {
@@ -7503,7 +7503,7 @@ class BE {
     return this.offset += 8, t;
   }
   readVarInt() {
-    const { bigintValue: t, bytes: n } = Vs(this.buffer, this.offset);
+    const { bigintValue: t, bytes: n } = Ds(this.buffer, this.offset);
     return this.offset += n, t;
   }
   readSlice(t) {
@@ -7605,18 +7605,18 @@ function lc(e, t) {
           vt(64),
           vt(65)
         ]),
-        witness: ln($e),
+        witness: hn($e),
         scriptTree: Kn(Qy, "Taptree is not of type isTaptree"),
         redeem: fi(
           _t({
             output: $e,
             // tapleaf script
-            redeemVersion: un(),
+            redeemVersion: fn(),
             // tapleaf version
-            witness: ln($e)
+            witness: hn($e)
           })
         ),
-        redeemVersion: un()
+        redeemVersion: fn()
       })
     ),
     e
@@ -7643,7 +7643,7 @@ function lc(e, t) {
     return null;
   }), Te(o, "output", () => {
     if (o.pubkey)
-      return hn([vd.OP_1, o.pubkey]);
+      return nn([vd.OP_1, o.pubkey]);
   }), Te(o, "redeemVersion", () => e.redeemVersion ? e.redeemVersion : e.redeem && e.redeem.redeemVersion !== void 0 && e.redeem.redeemVersion !== null ? e.redeem.redeemVersion : wg), Te(o, "redeem", () => {
     const c = r();
     if (!(!c || c.length < 2))
@@ -7876,7 +7876,7 @@ function vg(e, t) {
         if (r.data.length === 32)
           return lc({ pubkey: r.data }).output;
       } else if (r.version >= Sg && r.version <= _g && r.data.length >= Eg && r.data.length <= bg)
-        return console.warn(xg), hn([
+        return console.warn(xg), nn([
           r.version + Tg,
           r.data
         ]);
@@ -8024,12 +8024,12 @@ let gt = class Ye {
    * This hash can then be used to sign the provided transaction input.
    */
   hashForSignature(t, n, r) {
-    if (ot(er([wr, $e, un()]), [
+    if (ot(er([wr, $e, fn()]), [
       t,
       n,
       r
     ]), t >= this.ins.length) return Bd;
-    const i = hn(
+    const i = nn(
       ft(n).filter((c) => c !== Ge.OP_CODESEPARATOR)
     ), s = this.clone();
     if ((r & 31) === Ye.SIGHASH_NONE)
@@ -8055,8 +8055,8 @@ let gt = class Ye {
     if (ot(
       er([
         wr,
-        ln($e),
-        ln(Fu),
+        hn($e),
+        hn(Fu),
         wr
       ]),
       [t, n, r, i]
@@ -8145,10 +8145,10 @@ let gt = class Ye {
     return xe(this.toBuffer(void 0, void 0));
   }
   setInputScript(t, n) {
-    ot(er([un(), $e]), [t, n]), this.ins[t].script = n;
+    ot(er([fn(), $e]), [t, n]), this.ins[t].script = n;
   }
   setWitness(t, n) {
-    ot(er([un(), ln($e)]), [
+    ot(er([fn(), hn($e)]), [
       t,
       n
     ]), this.ins[t].witness = n;
@@ -8199,7 +8199,7 @@ function $E(e) {
     path: "m"
   };
   for (const r of DE(e.value.length / 4 - 1)) {
-    const i = Ls(e.value, r * 4 + 4, "LE"), s = !!(i & 2147483648), o = i & 2147483647;
+    const i = qs(e.value, r * 4 + 4, "LE"), s = !!(i & 2147483648), o = i & 2147483647;
     n.path += "/" + o.toString(10) + (s ? "'" : "");
   }
   return n;
@@ -8405,7 +8405,7 @@ function O2(e) {
     throw new Error(
       "Decode Error: could not decode sighashType with key 0x" + xe(e.key)
     );
-  return Number(Ls(e.value, 0, "LE"));
+  return Number(qs(e.value, 0, "LE"));
 }
 function B2(e) {
   const t = Uint8Array.from([me.SIGHASH_TYPE]), n = new Uint8Array(4);
@@ -8577,7 +8577,7 @@ function n_(e) {
     );
   const t = Ky(e.value, 0, "LE");
   let n = 8;
-  const { numberValue: r, bytes: i } = Vs(
+  const { numberValue: r, bytes: i } = Ds(
     e.value,
     n
   );
@@ -8620,7 +8620,7 @@ function a_(e) {
   let t = 0;
   const n = [];
   for (; t < e.value.length; ) {
-    const r = e.value[t++], i = e.value[t++], { numberValue: s, bytes: o } = Vs(
+    const r = e.value[t++], i = e.value[t++], { numberValue: s, bytes: o } = Ds(
       e.value,
       t
     );
@@ -8683,7 +8683,7 @@ function Ul(e, t = y_) {
       path: "m"
     };
     for (const f of p_(c.value.length / 4 - 1)) {
-      const l = Ls(c.value, f * 4 + 4, "LE"), d = !!(l & 2147483648), y = l & 2147483647;
+      const l = qs(c.value, f * 4 + 4, "LE"), d = !!(l & 2147483648), y = l & 2147483647;
       u.path += "/" + y.toString(10) + (d ? "'" : "");
     }
     return u;
@@ -8761,7 +8761,7 @@ const g_ = (e) => e.length === 32;
 function Ng(e) {
   const t = Ul(e, g_);
   function n(o) {
-    const { numberValue: c, bytes: a } = Vs(
+    const { numberValue: c, bytes: a } = Ds(
       o.value
     ), u = t.decode({
       key: o.key,
@@ -8905,13 +8905,13 @@ function w_(e) {
 function b_(e, t) {
   let n = 0;
   function r() {
-    const { numberValue: E, bytes: S } = Vs(e, n);
+    const { numberValue: E, bytes: S } = Ds(e, n);
     n += S;
     const _ = e.slice(n, n + Number(E));
     return n += Number(E), _;
   }
   function i() {
-    const E = Ls(e, n, "BE");
+    const E = qs(e, n, "BE");
     return n += 4, E;
   }
   function s() {
@@ -9550,14 +9550,14 @@ function Gf(e, t, n = 0) {
   if (i) return [t && t[0], i];
 }
 function V_(e, t, n) {
-  const r = Mn(e) && Es(t), i = Es(e) && Mn(t), s = e === t && Mn(t) && Es(t);
+  const r = Mn(e) && _s(t), i = _s(e) && Mn(t), s = e === t && Mn(t) && _s(t);
   if (r || i || s)
     throw new Error(
       `Invalid arguments for Psbt.${n}. Cannot use both taproot and non-taproot fields.`
     );
 }
 function D_(e, t, n) {
-  const r = Gu(e) && Es(t), i = Es(e) && Gu(t), s = e === t && Gu(t) && Es(t);
+  const r = Gu(e) && _s(t), i = _s(e) && Gu(t), s = e === t && Gu(t) && _s(t);
   if (r || i || s)
     throw new Error(
       `Invalid arguments for Psbt.${n}. Cannot use both taproot and non-taproot fields.`
@@ -9625,7 +9625,7 @@ function W_(e, t, n) {
   });
   return (!n || de(r, n) === 0) && t.find((s) => de(s.leafHash, r) === 0) !== void 0;
 }
-function Es(e) {
+function _s(e) {
   return e && !!(e.redeemScript || e.witnessScript || e.bip32Derivation && e.bip32Derivation.length);
 }
 const X_ = {
@@ -9727,17 +9727,17 @@ class ba {
     Rc(t), this.opts.maximumFeeRate = t;
   }
   setVersion(t) {
-    Rc(t), Qs(this.data.inputs, "setVersion");
+    Rc(t), eo(this.data.inputs, "setVersion");
     const n = this.__CACHE;
     return n.__TX.version = t, n.__EXTRACTED_TX = void 0, this;
   }
   setLocktime(t) {
-    Rc(t), Qs(this.data.inputs, "setLocktime");
+    Rc(t), eo(this.data.inputs, "setLocktime");
     const n = this.__CACHE;
     return n.__TX.locktime = t, n.__EXTRACTED_TX = void 0, this;
   }
   setInputSequence(t, n) {
-    Rc(n), Qs(this.data.inputs, "setInputSequence");
+    Rc(n), eo(this.data.inputs, "setInputSequence");
     const r = this.__CACHE;
     if (r.__TX.ins.length <= t)
       throw new Error("Input index too high");
@@ -9751,7 +9751,7 @@ class ba {
       throw new Error(
         "Invalid arguments for Psbt.addInput. Requires single object with at least [hash] and [index]"
       );
-    Hd(t, t, "addInput"), Qs(this.data.inputs, "addInput"), t.witnessScript && Ea(t.witnessScript);
+    Hd(t, t, "addInput"), eo(this.data.inputs, "addInput"), t.witnessScript && Ea(t.witnessScript);
     const n = this.__CACHE;
     this.data.addInput(t);
     const r = n.__TX.ins[n.__TX.ins.length - 1];
@@ -9767,7 +9767,7 @@ class ba {
       throw new Error(
         "Invalid arguments for Psbt.addOutput. Requires single object with at least [script or address] and [value]"
       );
-    Qs(this.data.inputs, "addOutput");
+    eo(this.data.inputs, "addOutput");
     const { address: n } = t;
     if (typeof n == "string") {
       const { network: i } = this.opts, s = vg(n, i);
@@ -9796,7 +9796,7 @@ class ba {
     return Dd("__FEE", "fee", this.data.inputs, this.__CACHE);
   }
   finalizeAllInputs() {
-    return Ut(this.data.inputs, 0), eo(this.data.inputs.length).forEach((t) => this.finalizeInput(t)), this;
+    return Ut(this.data.inputs, 0), to(this.data.inputs.length).forEach((t) => this.finalizeInput(t)), this;
   }
   finalizeInput(t, n) {
     const r = Ut(this.data.inputs, t);
@@ -9886,7 +9886,7 @@ class ba {
     return !!r.bip32Derivation && r.bip32Derivation.some(i);
   }
   validateSignaturesOfAllInputs(t) {
-    return Ut(this.data.inputs, 0), eo(this.data.inputs.length).map(
+    return Ut(this.data.inputs, 0), to(this.data.inputs.length).map(
       (r) => this.validateSignaturesOfInput(r, t)
     ).reduce((r, i) => i === !0 && r, !0);
   }
@@ -9969,7 +9969,7 @@ class ba {
     if (!t || !t.publicKey || !t.fingerprint)
       throw new Error("Need HDSigner to sign input");
     const r = [];
-    for (const i of eo(this.data.inputs.length))
+    for (const i of to(this.data.inputs.length))
       try {
         this.signInputHD(i, t, n), r.push(!0);
       } catch {
@@ -9984,7 +9984,7 @@ class ba {
       if (!t || !t.publicKey || !t.fingerprint)
         return i(new Error("Need HDSigner to sign input"));
       const s = [], o = [];
-      for (const c of eo(this.data.inputs.length))
+      for (const c of to(this.data.inputs.length))
         o.push(
           this.signInputHDAsync(c, t, n).then(
             () => {
@@ -10023,7 +10023,7 @@ class ba {
     if (!t || !t.publicKey)
       throw new Error("Need Signer to sign input");
     const r = [];
-    for (const i of eo(this.data.inputs.length))
+    for (const i of to(this.data.inputs.length))
       try {
         this.signInput(i, t, n), r.push(!0);
       } catch {
@@ -10336,7 +10336,7 @@ function Z_(e, t, n) {
       `Warning: You are paying around ${(s / 1e8).toFixed(8)} in fees, which is ${r} satoshi per byte for a transaction with a VSize of ${i} bytes (segwit counted as 0.25 byte per byte). Use setMaximumFeeRate method to raise your threshold, or pass true to the first arg of extractTransaction.`
     );
 }
-function Qs(e, t) {
+function eo(e, t) {
   e.forEach((n) => {
     if (Mn(n) ? H_(n, t) : N_(n, t))
       throw new Error("Can not modify transaction, signatures exist.");
@@ -10650,7 +10650,7 @@ function Xg(e) {
     return t += o, e.slice(t - o, t);
   }
   function r() {
-    const o = Vs(e, t);
+    const o = Ds(e, t);
     return t += Bn(o.bigintValue), o.numberValue;
   }
   function i() {
@@ -10809,18 +10809,18 @@ function Ea(e) {
 function Jg(e) {
   return Ja(e) ? "witnesspubkeyhash" : B_(e) ? "pubkeyhash" : I_(e) ? "multisig" : O_(e) ? "pubkey" : "nonstandard";
 }
-function eo(e) {
+function to(e) {
   return [...Array(e).keys()];
 }
 gE(z1);
 const No = {
   Mainnet: "mainnet",
   Testnet: "testnet"
-}, _a = "abcdefghijklmnopqrstuvwxyz234567", ks = /* @__PURE__ */ Object.create(null);
+}, _a = "abcdefghijklmnopqrstuvwxyz234567", Ps = /* @__PURE__ */ Object.create(null);
 for (let e = 0; e < _a.length; e++)
-  ks[_a[e]] = e;
-ks[0] = ks.o;
-ks[1] = ks.i;
+  Ps[_a[e]] = e;
+Ps[0] = Ps.o;
+Ps[1] = Ps.i;
 function pS(e) {
   let t = 0, n = 0, r = "";
   function i(s) {
@@ -10835,7 +10835,7 @@ function yS(e) {
   const r = new Uint8Array(e.length * 4 / 3 | 0);
   let i = 0;
   function s(o) {
-    let c = ks[o.toLowerCase()];
+    let c = Ps[o.toLowerCase()];
     if (c === void 0)
       throw new Error(`Invalid character: ${JSON.stringify(o)}`);
     c <<= 3, n |= c >>> t, t += 5, t >= 8 && (r[i++] = n, t -= 8, t > 0 ? n = c << 5 - t & 255 : n = 0);
@@ -11228,7 +11228,7 @@ function qe(...e) {
     t.set(r, n), n += r.byteLength;
   return t;
 }
-class Ds {
+class $s {
   /**
    * Save a checkpoint of the reading view (for backtracking)
    */
@@ -11334,7 +11334,7 @@ function SS(e) {
     r = (r * 223 + i) % 2 ** 32;
   return r;
 }
-function on(e) {
+function cn(e) {
   if (/^_\d+_$/.test(e) || /^_0x[0-9a-fA-F]+_$/.test(e)) {
     const t = +e.slice(1, -1);
     if (Number.isSafeInteger(t) && t >= 0 && t < 2 ** 32)
@@ -11367,7 +11367,7 @@ function ji(e) {
 function ut(e) {
   if (typeof e == "number" && (e = BigInt(e)), e < BigInt(0))
     throw new Error("Cannot leb encode negative values.");
-  const t = (e === BigInt(0) ? 0 : em(e)) + 1, n = new Ds(new Uint8Array(t), 0);
+  const t = (e === BigInt(0) ? 0 : em(e)) + 1, n = new $s(new Uint8Array(t), 0);
   for (; ; ) {
     const r = Number(e & BigInt(127));
     if (e /= BigInt(128), e === BigInt(0)) {
@@ -11389,7 +11389,7 @@ function It(e) {
   typeof e == "number" && (e = BigInt(e));
   const t = e < BigInt(0);
   t && (e = -e - BigInt(1));
-  const n = (e === BigInt(0) ? 0 : em(e)) + 1, r = new Ds(new Uint8Array(n), 0);
+  const n = (e === BigInt(0) ? 0 : em(e)) + 1, r = new $s(new Uint8Array(n), 0);
   for (; ; ) {
     const s = i(e);
     if (e /= BigInt(128), t && e === BigInt(0) && (s & 64) !== 0 || !t && e === BigInt(0) && (s & 64) === 0) {
@@ -11426,7 +11426,7 @@ function TS(e, t) {
 }
 function nm(e, t) {
   e = BigInt(e);
-  const n = new Ds(new Uint8Array(Math.min(1, t)), 0);
+  const n = new $s(new Uint8Array(Math.min(1, t)), 0);
   let r = 0, i = BigInt(256), s = BigInt(0), o = Number(e % i);
   for (n.write(new Uint8Array([o])); ++r < t; )
     e < 0 && s === BigInt(0) && o !== 0 && (s = BigInt(1)), o = Number((e / i - s) % BigInt(256)), n.write(new Uint8Array([o])), i *= BigInt(256);
@@ -11993,7 +11993,7 @@ class ai extends Rn {
     return t.toString();
   }
 }
-class Ps extends pi {
+class Rs extends pi {
   get typeName() {
     return Be.VecClass;
   }
@@ -12042,7 +12042,7 @@ index ${i} -> ${s.message}`);
         return qe(n, new Uint8Array(i.buffer));
       } else
         return qe(n, new Uint8Array(t.buffer, t.byteOffset, t.byteLength));
-    const r = new Ds(new Uint8Array(n.byteLength + t.length), 0);
+    const r = new $s(new Uint8Array(n.byteLength + t.length), 0);
     r.write(n);
     for (const i of t) {
       const s = this._type.encodeValue(i);
@@ -12057,7 +12057,7 @@ index ${i} -> ${s.message}`);
   }
   decodeValue(t, n) {
     const r = this.checkType(n);
-    if (!(r instanceof Ps))
+    if (!(r instanceof Rs))
       throw new Error("Not a vector type");
     const i = Number(Nt(t));
     if (this._type instanceof ai) {
@@ -12204,7 +12204,7 @@ class Gi extends pi {
     return t.typeName === Be.RecordClass || t.typeName === Be.TupleClass;
   }
   constructor(t = {}) {
-    super(), this._fields = Object.entries(t).sort((n, r) => on(n[0]) - on(r[0]));
+    super(), this._fields = Object.entries(t).sort((n, r) => cn(n[0]) - cn(r[0]));
   }
   accept(t, n) {
     return t.visitRecord(this, this._fields, n);
@@ -12240,7 +12240,7 @@ field ${n} -> ${i.message}`);
   }
   _buildTypeTableImpl(t) {
     this._fields.forEach(([s, o]) => o.buildTypeTable(t));
-    const n = It(Le.Record), r = ut(this._fields.length), i = this._fields.map(([s, o]) => qe(ut(on(s)), o.encodeType(t)));
+    const n = It(Le.Record), r = ut(this._fields.length), i = this._fields.map(([s, o]) => qe(ut(cn(s)), o.encodeType(t)));
     t.add(this, qe(n, r, qe(...i)));
   }
   decodeValue(t, n) {
@@ -12255,7 +12255,7 @@ field ${n} -> ${i.message}`);
         a.decodeValue(t, a), o++;
         continue;
       }
-      const [u, f] = this._fields[s], l = on(this._fields[s][0]), d = on(c);
+      const [u, f] = this._fields[s], l = cn(this._fields[s][0]), d = cn(c);
       if (l === d)
         i[u] = f.decodeValue(t, a), s++, o++;
       else if (d > l)
@@ -12276,7 +12276,7 @@ field ${n} -> ${i.message}`);
   get fieldsAsObject() {
     const t = {};
     for (const [n, r] of this._fields)
-      t[on(n)] = r;
+      t[cn(n)] = r;
     return t;
   }
   get name() {
@@ -12339,7 +12339,7 @@ index ${r} -> ${i.message}`);
     return `record {${ko(this._components, t, (r, i) => r.valueToString(i)).join("; ")}}`;
   }
 }
-class Rs extends pi {
+class Us extends pi {
   get typeName() {
     return Be.VariantClass;
   }
@@ -12347,7 +12347,7 @@ class Rs extends pi {
     return t.typeName === Be.VariantClass;
   }
   constructor(t = {}) {
-    super(), this._fields = Object.entries(t).sort((n, r) => on(n[0]) - on(r[0]));
+    super(), this._fields = Object.entries(t).sort((n, r) => cn(n[0]) - cn(r[0]));
   }
   accept(t, n) {
     return t.visitVariant(this, this._fields, n);
@@ -12379,19 +12379,19 @@ variant ${n} -> ${i.message}`);
     this._fields.forEach(([, s]) => {
       s.buildTypeTable(t);
     });
-    const n = It(Le.Variant), r = ut(this._fields.length), i = this._fields.map(([s, o]) => qe(ut(on(s)), o.encodeType(t)));
+    const n = It(Le.Variant), r = ut(this._fields.length), i = this._fields.map(([s, o]) => qe(ut(cn(s)), o.encodeType(t)));
     t.add(this, qe(n, r, ...i));
   }
   decodeValue(t, n) {
     const r = this.checkType(n);
-    if (!(r instanceof Rs))
+    if (!(r instanceof Us))
       throw new Error("Not a variant type");
     const i = Number(Nt(t));
     if (i >= r._fields.length)
       throw Error("Invalid variant index: " + i);
     const [s, o] = r._fields[i];
     for (const [c, a] of this._fields)
-      if (on(s) === on(c)) {
+      if (cn(s) === cn(c)) {
         const u = a.decodeValue(t, o);
         return { [c]: u };
       }
@@ -12414,7 +12414,7 @@ variant ${n} -> ${i.message}`);
   get alternativesAsObject() {
     const t = {};
     for (const [n, r] of this._fields)
-      t[on(n)] = r;
+      t[cn(n)] = r;
     return t;
   }
 }
@@ -12646,7 +12646,7 @@ function Yf(e, t) {
   return qe(r, i, s, o, c);
 }
 function am(e, t) {
-  const n = new Ds(t);
+  const n = new $s(t);
   if (t.byteLength < Jc.length)
     throw new Error("Message length smaller than magic number");
   const r = $i(n, Jc.length), i = new TextDecoder().decode(r);
@@ -12855,7 +12855,7 @@ function Im(...e) {
   return new ru(e);
 }
 function Om(e) {
-  return new Ps(e);
+  return new Rs(e);
 }
 function Bm(e) {
   return new kr(e);
@@ -12864,7 +12864,7 @@ function Nm(e) {
   return new Gi(e);
 }
 function km(e) {
-  return new Rs(e);
+  return new Us(e);
 }
 function Pm() {
   return new Nn();
@@ -12943,14 +12943,14 @@ function gr(e, t, n) {
     return r;
   if (e.add(t, n), n instanceof hi || t instanceof Ll || t instanceof Vl && n instanceof ql)
     return !0;
-  if (t instanceof Ps && n instanceof Ps)
+  if (t instanceof Rs && n instanceof Rs)
     return gr(e, t._type, n._type);
   if (n instanceof kr)
     return !0;
   if (t instanceof Gi && n instanceof Gi) {
     const i = t.fieldsAsObject;
     for (const [s, o] of n._fields) {
-      const c = i[on(s)];
+      const c = i[cn(s)];
       if (c) {
         if (!gr(e, c, o))
           return !1;
@@ -12980,10 +12980,10 @@ function gr(e, t, n) {
     }
     return !0;
   }
-  if (t instanceof Rs && n instanceof Rs) {
+  if (t instanceof Us && n instanceof Us) {
     const i = n.alternativesAsObject;
     for (const [s, o] of t._fields) {
-      const c = i[on(s)];
+      const c = i[cn(s)];
       if (!c || !gr(e, o, c))
         return !1;
     }
@@ -13049,9 +13049,9 @@ const BS = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   Unknown: IS,
   UnknownClass: im,
   Variant: km,
-  VariantClass: Rs,
+  VariantClass: Us,
   Vec: Om,
-  VecClass: Ps,
+  VecClass: Rs,
   Visitor: vS,
   decode: am,
   encode: Yf,
@@ -13066,7 +13066,7 @@ function Cm(e, t) {
 const { toString: NS } = Object.prototype, { getPrototypeOf: Kl } = Object, { iterator: su, toStringTag: Hm } = Symbol, ou = /* @__PURE__ */ ((e) => (t) => {
   const n = NS.call(t);
   return e[n] || (e[n] = n.slice(8, -1).toLowerCase());
-})(/* @__PURE__ */ Object.create(null)), Gn = (e) => (e = e.toLowerCase(), (t) => ou(t) === e), cu = (e) => (t) => typeof t === e, { isArray: $s } = Array, Uo = cu("undefined");
+})(/* @__PURE__ */ Object.create(null)), Gn = (e) => (e = e.toLowerCase(), (t) => ou(t) === e), cu = (e) => (t) => typeof t === e, { isArray: js } = Array, Uo = cu("undefined");
 function hc(e) {
   return e !== null && !Uo(e) && e.constructor !== null && !Uo(e.constructor) && dn(e.constructor.isBuffer) && e.constructor.isBuffer(e);
 }
@@ -13097,7 +13097,7 @@ function pc(e, t, { allOwnKeys: n = !1 } = {}) {
   if (e === null || typeof e > "u")
     return;
   let r, i;
-  if (typeof e != "object" && (e = [e]), $s(e))
+  if (typeof e != "object" && (e = [e]), js(e))
     for (r = 0, i = e.length; r < i; r++)
       t.call(null, e[r], r, e);
   else {
@@ -13124,7 +13124,7 @@ const Ui = typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typ
 function Jf() {
   const { caseless: e } = qm(this) && this || {}, t = {}, n = (r, i) => {
     const s = e && Lm(t, i) || i;
-    ea(t[s]) && ea(r) ? t[s] = Jf(t[s], r) : ea(r) ? t[s] = Jf({}, r) : $s(r) ? t[s] = r.slice() : t[s] = r;
+    ea(t[s]) && ea(r) ? t[s] = Jf(t[s], r) : ea(r) ? t[s] = Jf({}, r) : js(r) ? t[s] = r.slice() : t[s] = r;
   };
   for (let r = 0, i = arguments.length; r < i; r++)
     arguments[r] && pc(arguments[r], n);
@@ -13152,7 +13152,7 @@ const WS = (e, t, n, { allOwnKeys: r } = {}) => (pc(t, (i, s) => {
   return r !== -1 && r === n;
 }, JS = (e) => {
   if (!e) return null;
-  if ($s(e)) return e;
+  if (js(e)) return e;
   let t = e.length;
   if (!Mm(t)) return null;
   const n = new Array(t);
@@ -13204,7 +13204,7 @@ const WS = (e, t, n, { allOwnKeys: r } = {}) => (pc(t, (i, s) => {
       n[s] = !0;
     });
   };
-  return $s(e) ? r(e) : r(String(e).split(t)), n;
+  return js(e) ? r(e) : r(String(e).split(t)), n;
 }, cT = () => {
 }, aT = (e, t) => e != null && Number.isFinite(e = +e) ? e : t;
 function uT(e) {
@@ -13219,7 +13219,7 @@ const fT = (e) => {
         return r;
       if (!("toJSON" in r)) {
         t[i] = r;
-        const s = $s(r) ? [] : {};
+        const s = js(r) ? [] : {};
         return pc(r, (o, c) => {
           const a = n(o, i + 1);
           !Uo(a) && (s[c] = a);
@@ -13237,7 +13237,7 @@ const fT = (e) => {
   typeof setImmediate == "function",
   dn(Ui.postMessage)
 ), dT = typeof queueMicrotask < "u" ? queueMicrotask.bind(Ui) : typeof process < "u" && process.nextTick || Dm, pT = (e) => e != null && dn(e[su]), z = {
-  isArray: $s,
+  isArray: js,
   isArrayBuffer: Fm,
   isBuffer: hc,
   isFormData: qS,
@@ -13692,7 +13692,7 @@ const kT = z.toObjectSet([
     i = o.indexOf(":"), n = o.substring(0, i).trim().toLowerCase(), r = o.substring(i + 1).trim(), !(!n || t[n] && kT[n]) && (n === "set-cookie" ? t[n] ? t[n].push(r) : t[n] = [r] : t[n] = t[n] ? t[n] + ", " + r : r);
   }), t;
 }, Jd = Symbol("internals");
-function to(e) {
+function no(e) {
   return e && String(e).trim().toLowerCase();
 }
 function ta(e) {
@@ -13737,7 +13737,7 @@ let pn = class {
   set(t, n, r) {
     const i = this;
     function s(c, a, u) {
-      const f = to(a);
+      const f = no(a);
       if (!f)
         throw new Error("header name must be a non-empty string");
       const l = z.findKey(i, f);
@@ -13761,7 +13761,7 @@ let pn = class {
     return this;
   }
   get(t, n) {
-    if (t = to(t), t) {
+    if (t = no(t), t) {
       const r = z.findKey(this, t);
       if (r) {
         const i = this[r];
@@ -13778,7 +13778,7 @@ let pn = class {
     }
   }
   has(t, n) {
-    if (t = to(t), t) {
+    if (t = no(t), t) {
       const r = z.findKey(this, t);
       return !!(r && this[r] !== void 0 && (!n || Yu(this, this[r], r, n)));
     }
@@ -13788,7 +13788,7 @@ let pn = class {
     const r = this;
     let i = !1;
     function s(o) {
-      if (o = to(o), o) {
+      if (o = no(o), o) {
         const c = z.findKey(r, o);
         c && (!n || Yu(r, r[c], c, n)) && (delete r[c], i = !0);
       }
@@ -13850,7 +13850,7 @@ let pn = class {
       accessors: {}
     }).accessors, i = this.prototype;
     function s(o) {
-      const c = to(o);
+      const c = no(o);
       r[c] || (HT(i, o), r[c] = !0);
     }
     return z.isArray(t) ? t.forEach(s) : s(t), this;
@@ -13877,10 +13877,10 @@ function Zu(e, t) {
 function Ym(e) {
   return !!(e && e.__CANCEL__);
 }
-function js(e, t, n) {
+function Ks(e, t, n) {
   ke.call(this, e ?? "canceled", ke.ERR_CANCELED, t, n), this.name = "CanceledError";
 }
-z.inherits(js, ke, {
+z.inherits(Ks, ke, {
   __CANCEL__: !0
 });
 function Zm(e, t, n) {
@@ -14125,7 +14125,7 @@ const Qm = (e) => {
     }, s === void 0 && o.setContentType(null), "setRequestHeader" in E && z.forEach(o.toJSON(), function(T, O) {
       E.setRequestHeader(O, T);
     }), z.isUndefined(i.withCredentials) || (E.withCredentials = !!i.withCredentials), c && c !== "json" && (E.responseType = i.responseType), u && ([d, g] = Ta(u, !0), E.addEventListener("progress", d)), a && E.upload && ([l, y] = Ta(a), E.upload.addEventListener("progress", l), E.upload.addEventListener("loadend", y)), (i.cancelToken || i.signal) && (f = (w) => {
-      E && (r(!w || w.type ? new js(null, e, E) : w), E.abort(), E = null);
+      E && (r(!w || w.type ? new Ks(null, e, E) : w), E.abort(), E = null);
     }, i.cancelToken && i.cancelToken.subscribe(f), i.signal && (i.signal.aborted ? f() : i.signal.addEventListener("abort", f)));
     const _ = FT(i.url);
     if (_ && jt.protocols.indexOf(_) === -1) {
@@ -14142,7 +14142,7 @@ const Qm = (e) => {
       if (!i) {
         i = !0, c();
         const f = u instanceof Error ? u : this.reason;
-        r.abort(f instanceof ke ? f : new js(f instanceof Error ? f.message : f));
+        r.abort(f instanceof ke ? f : new Ks(f instanceof Error ? f.message : f));
       }
     };
     let o = t && setTimeout(() => {
@@ -14389,7 +14389,7 @@ const i0 = (e) => `- ${e}`, tx = (e) => z.isFunction(e) || e === null || e === !
 };
 function Ju(e) {
   if (e.cancelToken && e.cancelToken.throwIfRequested(), e.signal && e.signal.aborted)
-    throw new js(null, e);
+    throw new Ks(null, e);
 }
 function s0(e) {
   return Ju(e), e.headers = pn.from(e.headers), e.data = Zu.call(
@@ -14606,7 +14606,7 @@ let rx = class iw {
         r.unsubscribe(s);
       }, o;
     }, t(function(s, o, c) {
-      r.reason || (r.reason = new js(s, o, c), n(r.reason));
+      r.reason || (r.reason = new Ks(s, o, c), n(r.reason));
     });
   }
   /**
@@ -14739,7 +14739,7 @@ function sw(e) {
 }
 const ht = sw(yc);
 ht.Axios = Li;
-ht.CanceledError = js;
+ht.CanceledError = Ks;
 ht.CancelToken = rx;
 ht.isCancel = Ym;
 ht.VERSION = rw;
@@ -14810,10 +14810,10 @@ var c0;
 (function(e) {
   e[e.SysFatal = 1] = "SysFatal", e[e.SysTransient = 2] = "SysTransient", e[e.DestinationInvalid = 3] = "DestinationInvalid", e[e.CanisterReject = 4] = "CanisterReject", e[e.CanisterError = 5] = "CanisterError";
 })(c0 || (c0 = {}));
-var Us;
+var Cs;
 (function(e) {
   e.Replied = "replied", e.Rejected = "rejected";
-})(Us || (Us = {}));
+})(Cs || (Cs = {}));
 function cx(e) {
   return e != null && "reject_code" in e;
 }
@@ -14887,9 +14887,9 @@ class yt extends Ji {
     super(t, Pr.Protocol), this.name = "ProtocolError", Object.setPrototypeOf(this, yt.prototype);
   }
 }
-class _s extends Ji {
+class Ss extends Ji {
   constructor(t) {
-    super(t, Pr.Reject), this.name = "RejectError", Object.setPrototypeOf(this, _s.prototype);
+    super(t, Pr.Reject), this.name = "RejectError", Object.setPrototypeOf(this, Ss.prototype);
   }
 }
 class Aa extends Ji {
@@ -14897,9 +14897,9 @@ class Aa extends Ji {
     super(t, Pr.Transport), this.name = "TransportError", Object.setPrototypeOf(this, Aa.prototype);
   }
 }
-class cn extends Ji {
+class an extends Ji {
   constructor(t) {
-    super(t, Pr.External), this.name = "ExternalError", Object.setPrototypeOf(this, cn.prototype);
+    super(t, Pr.External), this.name = "ExternalError", Object.setPrototypeOf(this, an.prototype);
   }
 }
 class et extends Ji {
@@ -14907,14 +14907,14 @@ class et extends Ji {
     super(t, Pr.Input), this.name = "InputError", Object.setPrototypeOf(this, et.prototype);
   }
 }
-class an extends Ji {
+class un extends Ji {
   constructor(t) {
-    super(t, Pr.Unknown), this.name = "UnknownError", Object.setPrototypeOf(this, an.prototype);
+    super(t, Pr.Unknown), this.name = "UnknownError", Object.setPrototypeOf(this, un.prototype);
   }
 }
-class Ss extends Ue {
+class Ts extends Ue {
   constructor(t, n) {
-    super(), this.reason = t, this.error = n, this.name = "CertificateVerificationErrorCode", Object.setPrototypeOf(this, Ss.prototype);
+    super(), this.reason = t, this.error = n, this.name = "CertificateVerificationErrorCode", Object.setPrototypeOf(this, Ts.prototype);
   }
   toErrorMessage() {
     let t = this.reason;
@@ -14945,9 +14945,9 @@ class lu extends Ue {
     return `The certificate contains a delegation that does not include the canister ${this.canisterId.toText()} in the canister_ranges field. Subnet ID: ${this.subnetId.toText()}`;
   }
 }
-class Cs extends Ue {
+class Hs extends Ue {
   constructor(t, n) {
-    super(), this.message = t, this.lookupStatus = n, this.name = "LookupErrorCode", Object.setPrototypeOf(this, Cs.prototype);
+    super(), this.message = t, this.lookupStatus = n, this.name = "LookupErrorCode", Object.setPrototypeOf(this, Hs.prototype);
   }
   toErrorMessage() {
     return `${this.message}. Lookup status: ${this.lookupStatus}`;
@@ -15097,9 +15097,9 @@ class rh extends Ue {
 `;
   }
 }
-class Ks extends Ue {
+class Gs extends Ue {
   constructor(t) {
-    super(), this.shouldFetchRootKey = t, this.name = "MissingRootKeyErrorCode", Object.setPrototypeOf(this, Ks.prototype);
+    super(), this.shouldFetchRootKey = t, this.name = "MissingRootKeyErrorCode", Object.setPrototypeOf(this, Gs.prototype);
   }
   toErrorMessage() {
     return this.shouldFetchRootKey === void 0 ? "Agent is missing root key" : `Agent is missing root key and the shouldFetchRootKey value is set to ${this.shouldFetchRootKey}. The root key should only be unknown if you are in local development. Otherwise you should avoid fetching and use the default IC Root Key or the known root key of your environment.`;
@@ -15129,9 +15129,9 @@ class Pi extends Ue {
     return "This identity has expired due this application's security policy. Please refresh your authentication.";
   }
 }
-class ys extends Ue {
+class gs extends Ue {
   constructor(t, n) {
-    super(), this.message = t, this.providedIngressExpiryInMinutes = n, this.name = "IngressExpiryInvalidErrorCode", Object.setPrototypeOf(this, ys.prototype);
+    super(), this.message = t, this.providedIngressExpiryInMinutes = n, this.name = "IngressExpiryInvalidErrorCode", Object.setPrototypeOf(this, gs.prototype);
   }
   toErrorMessage() {
     return `${this.message}. Provided ingress expiry time is ${this.providedIngressExpiryInMinutes} minutes.`;
@@ -15255,7 +15255,7 @@ function mc(e) {
     return String(e);
   }
 }
-const Ts = new Error("unreachable");
+const xs = new Error("unreachable");
 function ka(e) {
   if (!e)
     throw new Error("Input cannot be null or undefined");
@@ -15273,27 +15273,27 @@ function il(e) {
   if (typeof e == "string")
     return ow(e);
   if (typeof e == "number")
-    return bn(ut(e));
+    return En(ut(e));
   if (e instanceof Uint8Array || ArrayBuffer.isView(e))
-    return bn(ka(e));
+    return En(ka(e));
   if (Array.isArray(e)) {
     const t = e.map(il);
-    return bn(De(...t));
+    return En(De(...t));
   } else {
     if (e && typeof e == "object" && e._isPrincipal)
-      return bn(e.toUint8Array());
+      return En(e.toUint8Array());
     if (typeof e == "object" && e !== null && typeof e.toHash == "function")
       return il(e.toHash());
     if (typeof e == "object")
       return Pa(e);
     if (typeof e == "bigint")
-      return bn(ut(e));
+      return En(ut(e));
   }
   throw et.fromCode(new ih(e));
 }
 const ow = (e) => {
   const t = new TextEncoder().encode(e);
-  return bn(t);
+  return En(t);
 };
 function Qu(e) {
   return Pa(e);
@@ -15303,7 +15303,7 @@ function Pa(e) {
     const a = ow(o), u = il(c);
     return [a, u];
   }).sort(([o], [c]) => ES(o, c)), i = De(...r.map((o) => De(...o)));
-  return bn(i);
+  return En(i);
 }
 new TextEncoder().encode(`
 ic-request`);
@@ -15329,7 +15329,7 @@ const cw = 55799, aw = Symbol("CBOR_STOP_CODE");
 var Vn = /* @__PURE__ */ ((e) => (e[e.False = 20] = "False", e[e.True = 21] = "True", e[e.Null = 22] = "Null", e[e.Undefined = 23] = "Undefined", e[e.Break = 31] = "Break", e))(Vn || {}), xt = /* @__PURE__ */ ((e) => (e[e.UnsignedInteger = 0] = "UnsignedInteger", e[e.NegativeInteger = 1] = "NegativeInteger", e[e.ByteString = 2] = "ByteString", e[e.TextString = 3] = "TextString", e[e.Array = 4] = "Array", e[e.Map = 5] = "Map", e[e.Tag = 6] = "Tag", e[e.Simple = 7] = "Simple", e))(xt || {});
 const fx = 23, lx = 255, hx = 65535, dx = 4294967295, px = BigInt("0xffffffffffffffff");
 var Ln = /* @__PURE__ */ ((e) => (e[e.Value = 23] = "Value", e[e.OneByte = 24] = "OneByte", e[e.TwoBytes = 25] = "TwoBytes", e[e.FourBytes = 26] = "FourBytes", e[e.EightBytes = 27] = "EightBytes", e[e.Indefinite = 31] = "Indefinite", e))(Ln || {});
-const xs = !1;
+const As = !1;
 function yx(e) {
   return e == null;
 }
@@ -15344,7 +15344,7 @@ function mx(e) {
 function wx(e) {
   return e & 31;
 }
-let Fo = new Uint8Array(), no, Dn = 0;
+let Fo = new Uint8Array(), ro, Dn = 0;
 function bx(e, t) {
   Fo = e, Dn = 0;
   const n = qi();
@@ -15354,7 +15354,7 @@ function qi(e) {
   const [t, n] = ra();
   switch (t) {
     case xt.UnsignedInteger:
-      return Gs(n);
+      return Ws(n);
     case xt.NegativeInteger:
       return Tx(n);
     case xt.ByteString:
@@ -15380,7 +15380,7 @@ function ra() {
   return Dn++, [t, n];
 }
 function Ex(e, t) {
-  const n = Gs(e);
+  const n = Ws(e);
   if (n === 1 / 0) {
     const i = [];
     let s = qi();
@@ -15411,7 +15411,7 @@ function _x(e) {
   throw new Qi(`Unrecognized simple type: ${e.toString(2)}`);
 }
 function Sx(e, t) {
-  const n = Gs(e), r = {};
+  const n = Ws(e), r = {};
   if (n === 1 / 0) {
     let [i, s] = ra();
     for (; i !== xt.Simple && s !== Vn.Break; ) {
@@ -15429,18 +15429,18 @@ function Sx(e, t) {
   }
   return r;
 }
-function Gs(e) {
+function Ws(e) {
   if (e <= Ln.Value)
     return e;
-  switch (no = new DataView(Fo.buffer, Fo.byteOffset + Dn), e) {
+  switch (ro = new DataView(Fo.buffer, Fo.byteOffset + Dn), e) {
     case Ln.OneByte:
-      return Dn++, no.getUint8(0);
+      return Dn++, ro.getUint8(0);
     case Ln.TwoBytes:
-      return Dn += 2, no.getUint16(0, xs);
+      return Dn += 2, ro.getUint16(0, As);
     case Ln.FourBytes:
-      return Dn += 4, no.getUint32(0, xs);
+      return Dn += 4, ro.getUint32(0, As);
     case Ln.EightBytes:
-      return Dn += 8, no.getBigUint64(0, xs);
+      return Dn += 8, ro.getBigUint64(0, As);
     case Ln.Indefinite:
       return 1 / 0;
     default:
@@ -15448,11 +15448,11 @@ function Gs(e) {
   }
 }
 function Tx(e) {
-  const t = Gs(e);
+  const t = Ws(e);
   return typeof t == "number" ? -1 - t : -1n - t;
 }
 function fw(e) {
-  const t = Gs(e);
+  const t = Ws(e);
   if (t > Number.MAX_SAFE_INTEGER)
     throw new Qi("Byte length is too large");
   const n = Number(t);
@@ -15463,7 +15463,7 @@ function sl(e) {
   return gx.decode(t);
 }
 function xx(e, t) {
-  const n = Gs(e);
+  const n = Ws(e);
   if (n === cw)
     return qi();
   throw new Qi(`Unsupported tag: ${n}.`);
@@ -15474,17 +15474,17 @@ class lh extends Error {
   }
 }
 const Ax = 2 * 1024, vx = 100, Ix = new TextEncoder();
-function ro(e) {
+function io(e) {
   return e << 5;
 }
-let mn = new Uint8Array(Ax), Hn = new DataView(mn.buffer), Tt = 0, ef = [];
+let wn = new Uint8Array(Ax), Hn = new DataView(wn.buffer), Tt = 0, ef = [];
 function Ox(e, t) {
   Tt = 0;
   const n = t?.(e) ?? e;
-  return Hx(cw, n, t), mn.slice(0, Tt);
+  return Hx(cw, n, t), wn.slice(0, Tt);
 }
 function hh(e, t) {
-  if (Tt > mn.length - vx && (mn = uw(mn, mn.length * 2), Hn = new DataView(mn.buffer)), e === !1 || e === !0 || e === null || e === void 0) {
+  if (Tt > wn.length - vx && (wn = uw(wn, wn.length * 2), Hn = new DataView(wn.buffer)), e === !1 || e === !0 || e === null || e === void 0) {
     kx(e);
     return;
   }
@@ -15515,55 +15515,55 @@ function hh(e, t) {
   throw new lh(`Unsupported type: ${typeof e}`);
 }
 function Bx(e, t) {
-  Ws(xt.Array, e.length), e.forEach((n, r) => {
+  Xs(xt.Array, e.length), e.forEach((n, r) => {
     hh(t?.(n, r.toString()) ?? n, t);
   });
 }
 function Nx(e, t) {
-  ef = Object.entries(e), Ws(xt.Map, ef.length), ef.forEach(([n, r]) => {
+  ef = Object.entries(e), Xs(xt.Map, ef.length), ef.forEach(([n, r]) => {
     dw(n), hh(t?.(r, n) ?? r, t);
   });
 }
-function Ws(e, t) {
+function Xs(e, t) {
   if (t <= fx) {
     Hn.setUint8(
       Tt++,
-      ro(e) | Number(t)
+      io(e) | Number(t)
     );
     return;
   }
   if (t <= lx) {
     Hn.setUint8(
       Tt++,
-      ro(e) | Ln.OneByte
+      io(e) | Ln.OneByte
     ), Hn.setUint8(Tt, Number(t)), Tt += 1;
     return;
   }
   if (t <= hx) {
     Hn.setUint8(
       Tt++,
-      ro(e) | Ln.TwoBytes
-    ), Hn.setUint16(Tt, Number(t), xs), Tt += 2;
+      io(e) | Ln.TwoBytes
+    ), Hn.setUint16(Tt, Number(t), As), Tt += 2;
     return;
   }
   if (t <= dx) {
     Hn.setUint8(
       Tt++,
-      ro(e) | Ln.FourBytes
-    ), Hn.setUint32(Tt, Number(t), xs), Tt += 4;
+      io(e) | Ln.FourBytes
+    ), Hn.setUint32(Tt, Number(t), As), Tt += 4;
     return;
   }
   if (t <= px) {
     Hn.setUint8(
       Tt++,
-      ro(e) | Ln.EightBytes
-    ), Hn.setBigUint64(Tt, BigInt(t), xs), Tt += 8;
+      io(e) | Ln.EightBytes
+    ), Hn.setBigUint64(Tt, BigInt(t), As), Tt += 8;
     return;
   }
   throw new lh(`Value too large to encode: ${t}`);
 }
 function kx(e) {
-  Ws(xt.Simple, Px(e));
+  Xs(xt.Simple, Px(e));
 }
 function Px(e) {
   if (e === !1)
@@ -15577,10 +15577,10 @@ function Px(e) {
   throw new lh(`Unrecognized simple value: ${e.toString()}`);
 }
 function lw(e, t) {
-  Ws(e, t.length), Tt > mn.length - t.length && (mn = uw(mn, mn.length + t.length), Hn = new DataView(mn.buffer)), mn.set(t, Tt), Tt += t.length;
+  Xs(e, t.length), Tt > wn.length - t.length && (wn = uw(wn, wn.length + t.length), Hn = new DataView(wn.buffer)), wn.set(t, Tt), Tt += t.length;
 }
 function hw(e, t) {
-  Ws(e, t);
+  Xs(e, t);
 }
 function Rx(e) {
   hw(xt.UnsignedInteger, e);
@@ -15601,14 +15601,14 @@ function u0(e) {
   lw(xt.ByteString, e);
 }
 function Hx(e, t, n) {
-  Ws(xt.Tag, e), hh(t, n);
+  Xs(xt.Tag, e), hh(t, n);
 }
 function Fx(e) {
   return typeof e == "object" && e !== null && "toCborValue" in e;
 }
 function tf(e) {
   try {
-    return Ox(e, (t) => Ke.isPrincipal(t) ? t.toUint8Array() : As.isExpiry(t) ? t.toBigInt() : Fx(t) ? t.toCborValue() : t);
+    return Ox(e, (t) => Ke.isPrincipal(t) ? t.toUint8Array() : vs.isExpiry(t) ? t.toBigInt() : Fx(t) ? t.toCborValue() : t);
   } catch (t) {
     throw et.fromCode(new Ql(t, e));
   }
@@ -15654,7 +15654,7 @@ function yw(e) {
 function qx(e) {
   return yw(e) / pw;
 }
-class As {
+class vs {
   constructor(t) {
     this.__expiry__ = t, this._isExpiry = !0;
   }
@@ -15669,7 +15669,7 @@ class As {
   static fromDeltaInMilliseconds(t, n = 0) {
     const r = BigInt(t), i = BigInt(Date.now()) + r + BigInt(n);
     let s;
-    return r < Lx ? s = yw(i) : s = qx(i) * pw, new As(s * dh * Mx);
+    return r < Lx ? s = yw(i) : s = qx(i) * pw, new vs(s * dh * Mx);
   }
   toBigInt() {
     return this.__expiry__;
@@ -15697,14 +15697,14 @@ class As {
     if (n[Hc])
       try {
         const r = BigInt(n[Hc]);
-        return new As(r);
+        return new vs(r);
       } catch (r) {
         throw new et(new Na(`Not a valid BigInt: ${r}`));
       }
     throw new et(new Na(`The input does not contain the key ${Hc}`));
   }
   static isExpiry(t) {
-    return t instanceof As || typeof t == "object" && t !== null && "_isExpiry" in t && t._isExpiry === !0 && "__expiry__" in t && typeof t.__expiry__ == "bigint";
+    return t instanceof vs || typeof t == "object" && t !== null && "_isExpiry" in t && t._isExpiry === !0 && "__expiry__" in t && typeof t.__expiry__ == "bigint";
   }
 }
 function f0(e = cl) {
@@ -15728,7 +15728,7 @@ function Lo(e, t = "") {
   }
   return e;
 }
-function vs(e, t, n = "") {
+function Is(e, t, n = "") {
   const r = sc(e), i = e?.length, s = t !== void 0;
   if (!r || s && i !== t) {
     const o = n && `"${n}" `, c = s ? ` of length ${t}` : "", a = r ? `length=${i}` : `type=${typeof e}`;
@@ -15753,7 +15753,7 @@ function Ct(e, t) {
 function mw(e, t) {
   return Ct(e, t).reverse();
 }
-function sn(e, t, n) {
+function on(e, t, n) {
   let r;
   if (typeof t == "string")
     try {
@@ -15821,24 +15821,24 @@ function Do(e) {
   };
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const fn = BigInt(0), Mt = BigInt(1), Hi = /* @__PURE__ */ BigInt(2), Ew = /* @__PURE__ */ BigInt(3), _w = /* @__PURE__ */ BigInt(4), Sw = /* @__PURE__ */ BigInt(5), $x = /* @__PURE__ */ BigInt(7), Tw = /* @__PURE__ */ BigInt(8), jx = /* @__PURE__ */ BigInt(9), xw = /* @__PURE__ */ BigInt(16);
+const ln = BigInt(0), Mt = BigInt(1), Hi = /* @__PURE__ */ BigInt(2), Ew = /* @__PURE__ */ BigInt(3), _w = /* @__PURE__ */ BigInt(4), Sw = /* @__PURE__ */ BigInt(5), $x = /* @__PURE__ */ BigInt(7), Tw = /* @__PURE__ */ BigInt(8), jx = /* @__PURE__ */ BigInt(9), xw = /* @__PURE__ */ BigInt(16);
 function mt(e, t) {
   const n = e % t;
-  return n >= fn ? n : t + n;
+  return n >= ln ? n : t + n;
 }
 function Zn(e, t, n) {
   let r = e;
-  for (; t-- > fn; )
+  for (; t-- > ln; )
     r *= r, r %= n;
   return r;
 }
 function d0(e, t) {
-  if (e === fn)
+  if (e === ln)
     throw new Error("invert: expected non-zero number");
-  if (t <= fn)
+  if (t <= ln)
     throw new Error("invert: expected positive modulus, got " + t);
-  let n = mt(e, t), r = t, i = fn, s = Mt;
-  for (; n !== fn; ) {
+  let n = mt(e, t), r = t, i = ln, s = Mt;
+  for (; n !== ln; ) {
     const c = r / n, a = r % n, u = i - s * c;
     r = n, n = a, i = s, s = u;
   }
@@ -15872,7 +15872,7 @@ function vw(e) {
   if (e < Ew)
     throw new Error("sqrt is not defined for small field");
   let t = e - Mt, n = 0;
-  for (; t % Hi === fn; )
+  for (; t % Hi === ln; )
     t /= Hi, n++;
   let r = Hi;
   const i = yi(e);
@@ -15934,14 +15934,14 @@ function Iw(e) {
   return wc(e, n), e;
 }
 function mu(e, t, n) {
-  if (n < fn)
+  if (n < ln)
     throw new Error("invalid exponent, negatives unsupported");
-  if (n === fn)
+  if (n === ln)
     return e.ONE;
   if (n === Mt)
     return t;
   let r = e.ONE, i = t;
-  for (; n > fn; )
+  for (; n > ln; )
     n & Mt && (r = e.mul(r, i)), i = e.sqr(i), n >>= Mt;
   return r;
 }
@@ -15961,7 +15961,7 @@ function Yx(e, t) {
   return { nBitLength: n, nByteLength: r };
 }
 function yi(e, t, n = !1, r = {}) {
-  if (e <= fn)
+  if (e <= ln)
     throw new Error("invalid field: expected ORDER > 0, got " + e);
   let i, s, o = !1, c;
   if (typeof t == "object" && t != null) {
@@ -15981,16 +15981,16 @@ function yi(e, t, n = !1, r = {}) {
     BITS: a,
     BYTES: u,
     MASK: es(a),
-    ZERO: fn,
+    ZERO: ln,
     ONE: Mt,
     allowedLengths: c,
     create: (d) => mt(d, e),
     isValid: (d) => {
       if (typeof d != "bigint")
         throw new Error("invalid field element: expected bigint, got " + typeof d);
-      return fn <= d && d < e;
+      return ln <= d && d < e;
     },
-    is0: (d) => d === fn,
+    is0: (d) => d === ln,
     // is valid and invertible
     isValidNot0: (d) => !l.is0(d) && l.isValid(d),
     isOdd: (d) => (d & Mt) === Mt,
@@ -16050,7 +16050,7 @@ function Zx(e, t, n = !1) {
   return n ? mw(c, i) : Ct(c, i);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Hs = BigInt(0), Fi = BigInt(1);
+const Fs = BigInt(0), Fi = BigInt(1);
 function Ca(e, t) {
   const n = t.negate();
   return e ? n : t;
@@ -16096,7 +16096,7 @@ function cf(e) {
   return kw.get(e) || 1;
 }
 function y0(e) {
-  if (e !== Hs)
+  if (e !== Fs)
     throw new Error("invalid wNAF");
 }
 class Pw {
@@ -16107,7 +16107,7 @@ class Pw {
   // non-const time multiplication ladder
   _unsafeLadder(t, n, r = this.ZERO) {
     let i = t;
-    for (; n > Hs; )
+    for (; n > Fs; )
       n & Fi && (r = r.add(i)), i = i.double(), n >>= Fi;
     return r;
   }
@@ -16158,7 +16158,7 @@ class Pw {
    */
   wNAFUnsafe(t, n, r, i = this.ZERO) {
     const s = sf(t, this.bits);
-    for (let o = 0; o < s.windows && r !== Hs; o++) {
+    for (let o = 0; o < s.windows && r !== Fs; o++) {
       const { nextN: c, offset: a, isZero: u, isNeg: f } = p0(r, o, s);
       if (r = c, !u) {
         const l = n[a];
@@ -16191,7 +16191,7 @@ class Pw {
 }
 function e3(e, t, n, r) {
   let i = t, s = e.ZERO, o = e.ZERO;
-  for (; n > Hs || r > Hs; )
+  for (; n > Fs || r > Fs; )
     n & Fi && (s = s.add(i)), r & Fi && (o = o.add(i)), i = i.double(), n >>= Fi, r >>= Fi;
   return { p1: s, p2: o };
 }
@@ -16233,7 +16233,7 @@ function Uw(e, t, n = {}, r) {
     throw new Error(`expected valid ${e} CURVE object`);
   for (const a of ["p", "n", "h"]) {
     const u = t[a];
-    if (!(typeof u == "bigint" && u > Hs))
+    if (!(typeof u == "bigint" && u > Fs))
       throw new Error(`CURVE.${a} must be positive bigint`);
   }
   const i = g0(t.p, n.Fp, r), s = g0(t.n, n.Fn, r), c = ["Gx", "Gy", "a", e === "weierstrass" ? "b" : "d"];
@@ -16377,14 +16377,14 @@ function o3(e, t, n) {
     throw new Error("splitScalar (endomorphism): failed, k=" + e);
   return { k1neg: l, k1: u, k2neg: d, k2: f };
 }
-const Mi = BigInt(0), Qt = BigInt(1), mr = BigInt(2), gs = BigInt(3), al = BigInt(4);
+const Mi = BigInt(0), Qt = BigInt(1), mr = BigInt(2), ms = BigInt(3), al = BigInt(4);
 function Ha(e, t) {
   const { BYTES: n } = e;
   let r;
   if (typeof t == "bigint")
     r = t;
   else {
-    let i = sn("private key", t);
+    let i = on("private key", t);
     try {
       r = e.fromBytes(i);
     } catch {
@@ -16426,7 +16426,7 @@ function c3(e, t = {}) {
       return De(Uint8Array.of(4), F, r.toBytes($));
   }
   function d(K) {
-    vs(K, void 0, "Point");
+    Is(K, void 0, "Point");
     const { publicKey: H, publicKeyUncompressed: D } = u, P = K.length, $ = K[0], F = K.subarray(1);
     if (P === H && ($ === 2 || $ === 3)) {
       const x = r.fromBytes(F);
@@ -16462,7 +16462,7 @@ function c3(e, t = {}) {
   }
   if (!E(s.Gx, s.Gy))
     throw new Error("bad curve params: generator point");
-  const S = r.mul(r.pow(s.a, gs), al), _ = r.mul(r.sqr(s.b), BigInt(27));
+  const S = r.mul(r.pow(s.a, ms), al), _ = r.mul(r.sqr(s.b), BigInt(27));
   if (r.is0(r.add(S, _)))
     throw new Error("bad curve params: a or b");
   function w(K, H, D = !1) {
@@ -16527,11 +16527,11 @@ function c3(e, t = {}) {
       return r.is0(D) && r.is0(P) ? v.ZERO : new v(D, P, r.ONE);
     }
     static fromBytes(H) {
-      const D = v.fromAffine(g(vs(H, void 0, "point")));
+      const D = v.fromAffine(g(Is(H, void 0, "point")));
       return D.assertValidity(), D;
     }
     static fromHex(H) {
-      return v.fromBytes(sn("pointHex", H));
+      return v.fromBytes(on("pointHex", H));
     }
     get x() {
       return this.toAffine().x;
@@ -16546,7 +16546,7 @@ function c3(e, t = {}) {
      * @returns
      */
     precompute(H = 8, D = !0) {
-      return q.createCache(this, H), D || this.multiply(gs), this;
+      return q.createCache(this, H), D || this.multiply(ms), this;
     }
     // TODO: return `this`
     /** A point on curve is valid if it conforms to equation. */
@@ -16574,7 +16574,7 @@ function c3(e, t = {}) {
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: H, b: D } = s, P = r.mul(D, gs), { X: $, Y: F, Z: x } = this;
+      const { a: H, b: D } = s, P = r.mul(D, ms), { X: $, Y: F, Z: x } = this;
       let B = r.ZERO, L = r.ZERO, N = r.ZERO, V = r.mul($, $), G = r.mul(F, F), X = r.mul(x, x), Y = r.mul($, F);
       return Y = r.add(Y, Y), N = r.mul($, x), N = r.add(N, N), B = r.mul(H, N), L = r.mul(P, X), L = r.add(B, L), B = r.sub(G, L), L = r.add(G, L), L = r.mul(B, L), B = r.mul(Y, B), N = r.mul(P, N), X = r.mul(H, X), Y = r.sub(V, X), Y = r.mul(H, Y), Y = r.add(Y, N), N = r.add(V, V), V = r.add(N, V), V = r.add(V, X), V = r.mul(V, Y), L = r.add(L, V), X = r.mul(F, x), X = r.add(X, X), V = r.mul(X, Y), B = r.sub(B, V), N = r.mul(X, G), N = r.add(N, N), N = r.add(N, N), new v(B, L, N);
     }
@@ -16586,7 +16586,7 @@ function c3(e, t = {}) {
       T(H);
       const { X: D, Y: P, Z: $ } = this, { X: F, Y: x, Z: B } = H;
       let L = r.ZERO, N = r.ZERO, V = r.ZERO;
-      const G = s.a, X = r.mul(s.b, gs);
+      const G = s.a, X = r.mul(s.b, ms);
       let Y = r.mul(D, F), ce = r.mul(P, x), ue = r.mul($, B), te = r.add(D, P), Z = r.add(F, x);
       te = r.mul(te, Z), Z = r.add(Y, ce), te = r.sub(te, Z), Z = r.add(D, $);
       let ae = r.add(F, B);
@@ -16735,8 +16735,8 @@ function u3(e, t) {
     }
     return { isValid: O, value: _ };
   };
-  if (e.ORDER % al === gs) {
-    const g = (e.ORDER - gs) / al, m = e.sqrt(e.neg(t));
+  if (e.ORDER % al === ms) {
+    const g = (e.ORDER - ms) / al, m = e.sqrt(e.neg(t));
     y = (E, S) => {
       let _ = e.sqr(S);
       const w = e.mul(E, S);
@@ -16832,11 +16832,11 @@ function d3(e, t) {
   });
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const p3 = BigInt(0), Fc = BigInt(1), E0 = BigInt(2), ms = BigInt(3);
+const p3 = BigInt(0), Fc = BigInt(1), E0 = BigInt(2), ws = BigInt(3);
 function y3(e) {
   const t = [];
   for (; e > Fc; e >>= Fc)
-    (e & Fc) === p3 ? t.unshift(0) : (e & ms) === ms ? (t.unshift(-1), e += Fc) : t.unshift(1);
+    (e & Fc) === p3 ? t.unshift(0) : (e & ws) === ws ? (t.unshift(-1), e += Fc) : t.unshift(1);
   return t;
 }
 function uf(e) {
@@ -16854,8 +16854,8 @@ function g3(e, t, n, r) {
     throw new Error("bls: unknown twist type");
   const l = i.div(i.ONE, i.mul(i.ONE, E0));
   function d(w, T, O, A) {
-    const R = i.sqr(O), M = i.sqr(A), v = i.mulByB(i.mul(M, ms)), U = i.mul(v, ms), q = i.sub(i.sub(i.sqr(i.add(O, A)), M), R), K = i.sub(v, R), H = i.mul(i.sqr(T), ms), D = i.neg(q);
-    return w.push([K, H, D]), T = i.mul(i.mul(i.mul(i.sub(R, U), T), O), l), O = i.sub(i.sqr(i.mul(i.add(R, U), l)), i.mul(i.sqr(v), ms)), A = i.mul(R, q), { Rx: T, Ry: O, Rz: A };
+    const R = i.sqr(O), M = i.sqr(A), v = i.mulByB(i.mul(M, ws)), U = i.mul(v, ws), q = i.sub(i.sub(i.sqr(i.add(O, A)), M), R), K = i.sub(v, R), H = i.mul(i.sqr(T), ws), D = i.neg(q);
+    return w.push([K, H, D]), T = i.mul(i.mul(i.mul(i.sub(R, U), T), O), l), O = i.sub(i.sqr(i.mul(i.add(R, U), l)), i.mul(i.sqr(v), ws)), A = i.mul(R, q), { Rx: T, Ry: O, Rz: A };
   }
   function y(w, T, O, A, R, M) {
     const v = i.sub(O, i.mul(M, A)), U = i.sub(T, i.mul(R, A)), q = i.sub(i.mul(v, R), i.mul(U, M)), K = i.neg(v), H = U;
@@ -17015,10 +17015,10 @@ function m3(e) {
     calcPairingPrecomputes: g
   }, { ShortSignature: T } = e.G1, { Signature: O } = e.G2;
   function A(x, B) {
-    return x instanceof c.Point ? x : E.hash(sn("point", x), B?.DST);
+    return x instanceof c.Point ? x : E.hash(on("point", x), B?.DST);
   }
   function R(x, B) {
-    return x instanceof u.Point ? x : m.hash(sn("point", x), B?.DST);
+    return x instanceof u.Point ? x : m.hash(on("point", x), B?.DST);
   }
   function M(x) {
     return m.getPublicKey(x).toBytes(!0);
@@ -17703,7 +17703,7 @@ const Kt = BigInt(0), Fa = BigInt(1), kn = BigInt(2), wu = BigInt(3), jo = BigIn
   m: 2,
   k: 128,
   expand: "xmd",
-  hash: bn
+  hash: En
 }), mh = {
   p: Re.ORDER,
   n: Xi.n,
@@ -17773,7 +17773,7 @@ function O3(e) {
     throw new Error("invalid G1 point: expected 48/96 bytes");
 }
 function v0(e) {
-  const { infinity: t, sort: n, value: r } = Eu(sn("signatureHex", e, 48)), i = Ee.ORDER, s = _u.G1.Point, o = ir(r);
+  const { infinity: t, sort: n, value: r } = Eu(on("signatureHex", e, 48)), i = Ee.ORDER, s = _u.G1.Point, o = ir(r);
   if (t)
     return s.ZERO;
   const c = Ee.create(o & es(Ee.BITS)), a = Ee.add(Ee.pow(c, wu), Ee.create(Xi.b));
@@ -17836,7 +17836,7 @@ function N3(e) {
     throw new Error("invalid G2 point: expected 96/192 bytes");
 }
 function I0(e) {
-  const { ORDER: t } = Ee, { infinity: n, sort: r, value: i } = Eu(sn("signatureHex", e)), s = _u.G2.Point, o = i.length / 2;
+  const { ORDER: t } = Ee, { infinity: n, sort: r, value: i } = Eu(on("signatureHex", e)), s = _u.G2.Point, o = i.length / 2;
   if (o !== 48 && o !== 96)
     throw new Error("invalid compressed signature length, expected 96/192 bytes");
   const c = ir(i.slice(0, o)), a = ir(i.slice(o));
@@ -18116,7 +18116,7 @@ function F3(e, t, n) {
   const r = typeof e == "string" ? e : nt(e), i = typeof t == "string" ? t : nt(t), s = typeof n == "string" ? n : nt(n);
   return _u.verifyShortSignature(i, s, r);
 }
-const M3 = BigInt(1e6), Mw = (e) => Nt(new Ds(e)), wh = (e) => {
+const M3 = BigInt(1e6), Mw = (e) => Nt(new $s(e)), wh = (e) => {
   const n = Mw(e) / M3;
   return new Date(Number(n));
 }, O0 = 60 * 1e3, L3 = 60, q3 = 24, V3 = q3 * L3, D3 = 5, $3 = 5, j3 = 30 * V3;
@@ -18165,9 +18165,9 @@ class Vi {
     return bh(t, this.cert.tree);
   }
   async verify() {
-    const t = await ia(this.cert.tree), n = await this._checkDelegationAndGetKey(this.cert.delegation), r = this.cert.signature, i = W3(n), s = De(bo("ic-state-root"), t), o = En(this.lookup_path(["time"]));
+    const t = await ia(this.cert.tree), n = await this._checkDelegationAndGetKey(this.cert.delegation), r = this.cert.signature, i = W3(n), s = De(Eo("ic-state-root"), t), o = _n(this.lookup_path(["time"]));
     if (!o)
-      throw yt.fromCode(new Ss("Certificate does not contain a time"));
+      throw yt.fromCode(new Ts("Certificate does not contain a time"));
     if (!this.#t) {
       const c = this.#e?.getTimeDiffMsecs() ?? 0, a = this._maxAgeInMinutes * O0, u = /* @__PURE__ */ new Date(), f = u.getTime() + c, l = f - a, d = f + $3 * O0, y = wh(o), g = y.getTime() < l, m = y.getTime() > d;
       if ((g || m) && this.#e && !this.#e.hasSyncedTime())
@@ -18175,13 +18175,13 @@ class Vi {
       if (g)
         throw An.fromCode(new Co(this._maxAgeInMinutes, y, u, c, "past"));
       if (m)
-        throw this.#e?.hasSyncedTime() ? an.fromCode(new qn("System time has been synced with the IC network, but certificate is still too far in the future.")) : An.fromCode(new Co(5, y, u, c, "future"));
+        throw this.#e?.hasSyncedTime() ? un.fromCode(new qn("System time has been synced with the IC network, but certificate is still too far in the future.")) : An.fromCode(new Co(5, y, u, c, "future"));
     }
     try {
       if (!await this._blsVerify(i, r, s))
-        throw An.fromCode(new Ss("Invalid signature"));
+        throw An.fromCode(new Ts("Invalid signature"));
     } catch (c) {
-      throw An.fromCode(new Ss("Signature verification failed", c));
+      throw An.fromCode(new Ts("Signature verification failed", c));
     }
   }
   async _checkDelegationAndGetKey(t) {
@@ -18206,43 +18206,43 @@ class Vi {
       tree: n.cert.tree
     }))
       throw An.fromCode(new lu(this._canisterId, i));
-    const o = En(n.lookup_path(["subnet", r, "public_key"]));
+    const o = _n(n.lookup_path(["subnet", r, "public_key"]));
     if (!o)
       throw An.fromCode(new zl(`Could not find subnet key for subnet ID ${i.toText()}`));
     return o;
   }
 }
-const io = oc("308182301d060d2b0601040182dc7c0503010201060c2b0601040182dc7c05030201036100"), G3 = 96;
+const so = oc("308182301d060d2b0601040182dc7c0503010201060c2b0601040182dc7c05030201036100"), G3 = 96;
 function W3(e) {
-  const t = io.byteLength + G3;
+  const t = so.byteLength + G3;
   if (e.byteLength !== t)
     throw yt.fromCode(new du(t, e.byteLength));
-  const n = e.slice(0, io.byteLength);
-  if (!gu(n, io))
-    throw yt.fromCode(new Yl(io, n));
-  return e.slice(io.byteLength);
+  const n = e.slice(0, so.byteLength);
+  if (!gu(n, so))
+    throw yt.fromCode(new Yl(so, n));
+  return e.slice(so.byteLength);
 }
-function En(e) {
+function _n(e) {
   if (e.status === vn.Found && e.value instanceof Uint8Array)
     return e.value;
 }
 async function ia(e) {
   switch (e[0]) {
     case Ht.Empty:
-      return bn(bo("ic-hashtree-empty"));
+      return En(Eo("ic-hashtree-empty"));
     case Ht.Pruned:
       return e[1];
     case Ht.Leaf:
-      return bn(De(bo("ic-hashtree-leaf"), e[1]));
+      return En(De(Eo("ic-hashtree-leaf"), e[1]));
     case Ht.Labeled:
-      return bn(De(bo("ic-hashtree-labeled"), e[1], await ia(e[2])));
+      return En(De(Eo("ic-hashtree-labeled"), e[1], await ia(e[2])));
     case Ht.Fork:
-      return bn(De(bo("ic-hashtree-fork"), await ia(e[1]), await ia(e[2])));
+      return En(De(Eo("ic-hashtree-fork"), await ia(e[1]), await ia(e[2])));
     default:
-      throw Ts;
+      throw xs;
   }
 }
-function bo(e) {
+function Eo(e) {
   const t = new Uint8Array([e.length]), n = new TextEncoder().encode(e);
   return De(t, n);
 }
@@ -18253,10 +18253,10 @@ var vn;
 (function(e) {
   e.Unknown = "Unknown", e.Absent = "Absent", e.Found = "Found", e.Error = "Error";
 })(vn || (vn = {}));
-var Is;
+var Os;
 (function(e) {
   e.Absent = "Absent", e.Unknown = "Unknown", e.Found = "Found";
-})(Is || (Is = {}));
+})(Os || (Os = {}));
 var st;
 (function(e) {
   e.Absent = "Absent", e.Unknown = "Unknown", e.Found = "Found", e.Less = "Less", e.Greater = "Greater";
@@ -18270,13 +18270,13 @@ function Ec(e, t) {
         };
       case Ht.Leaf: {
         if (!t[1])
-          throw an.fromCode(new gc("Invalid tree structure for leaf"));
+          throw un.fromCode(new gc("Invalid tree structure for leaf"));
         if (t[1] instanceof Uint8Array)
           return {
             status: vn.Found,
             value: t[1].slice(t[1].byteOffset, t[1].byteLength + t[1].byteOffset)
           };
-        throw Ts;
+        throw xs;
       }
       case Ht.Pruned:
         return {
@@ -18288,7 +18288,7 @@ function Ec(e, t) {
           status: vn.Error
         };
       default:
-        throw Ts;
+        throw xs;
     }
   const n = Lw(e), r = Ao(n, t);
   switch (r.status) {
@@ -18305,13 +18305,13 @@ function Ec(e, t) {
         status: vn.Unknown
       };
     default:
-      throw Ts;
+      throw xs;
   }
 }
 function bh(e, t) {
   if (e.length === 0)
     return {
-      status: Is.Found,
+      status: Os.Found,
       value: t
     };
   const n = Lw(e), r = Ao(n, t);
@@ -18320,16 +18320,16 @@ function bh(e, t) {
       return bh(e.slice(1), r.value);
     case st.Unknown:
       return {
-        status: Is.Unknown
+        status: Os.Unknown
       };
     case st.Absent:
     case st.Greater:
     case st.Less:
       return {
-        status: Is.Absent
+        status: Os.Absent
       };
     default:
-      throw Ts;
+      throw xs;
   }
 }
 function ul(e) {
@@ -18400,7 +18400,7 @@ function Ao(e, t) {
 function qw(e) {
   const { canisterId: t, subnetId: n, tree: r } = e, i = Ec(["subnet", n.toUint8Array(), "canister_ranges"], r);
   if (i.status !== vn.Found)
-    throw yt.fromCode(new Cs(`Could not find canister ranges for subnet ${n.toText()}`, i.status));
+    throw yt.fromCode(new Hs(`Could not find canister ranges for subnet ${n.toText()}`, i.status));
   if (!(i.value instanceof Uint8Array))
     throw yt.fromCode(new hu(`Could not find canister ranges for subnet ${n.toText()}`));
   return tr(i.value).map((a) => [
@@ -18414,7 +18414,7 @@ const B0 = async (e) => {
     return (async () => {
       try {
         if (t.rootKey === null)
-          throw cn.fromCode(new Ks());
+          throw an.fromCode(new Gs());
         const l = t.rootKey, d = await t.readState(i, {
           paths: [f]
         }), y = await Vi.create({
@@ -18433,7 +18433,7 @@ const B0 = async (e) => {
           } else
             return {
               path: _,
-              data: En(S.lookup_path(f))
+              data: _n(S.lookup_path(f))
             };
         }, { path: m, data: E } = g(y, s[u]);
         if (!E)
@@ -18483,7 +18483,7 @@ const B0 = async (e) => {
                 }
           }
       } catch (l) {
-        if (l instanceof _r && (l.hasCode(Ss) || l.hasCode(Co)))
+        if (l instanceof _r && (l.hasCode(Ts) || l.hasCode(Co)))
           throw l;
         typeof a != "string" && "key" in a && "path" in a ? o.set(a.key, null) : o.set(a, null), console.group(), console.warn(`Expected to find result for path ${a}, but instead found nothing.`), console.warn(l), console.groupEnd();
       }
@@ -18504,15 +18504,15 @@ const B0 = async (e) => {
   }), !qw({ canisterId: t, subnetId: o, tree: i }))
     throw An.fromCode(new lu(t, o));
   const a = bh(["subnet", s.subnet_id, "node"], i);
-  if (a.status !== Is.Found)
-    throw yt.fromCode(new Cs("Node not found", a.status));
+  if (a.status !== Os.Found)
+    throw yt.fromCode(new Hs("Node not found", a.status));
   if (a.value instanceof Uint8Array)
-    throw an.fromCode(new gc("Invalid node tree"));
+    throw un.fromCode(new gc("Invalid node tree"));
   const u = ul(a.value), f = /* @__PURE__ */ new Map();
   return u.forEach((l) => {
     const d = Ke.from(l[1]).toText(), y = Ec(["public_key"], l[2]);
     if (y.status !== vn.Found)
-      throw yt.fromCode(new Cs("Public key not found", y.status));
+      throw yt.fromCode(new Hs("Public key not found", y.status));
     const g = y.value;
     if (g.byteLength !== 44)
       throw yt.fromCode(new du(44, g.byteLength));
@@ -18547,7 +18547,7 @@ const B0 = async (e) => {
         } else
           return e.path;
   }
-  throw an.fromCode(new qn(`Error while encoding your path for canister status. Please ensure that your path ${e} was formatted correctly.`));
+  throw un.fromCode(new qn(`Error while encoding your path for canister status. Please ensure that your path ${e} was formatted correctly.`));
 }, Y3 = (e) => tr(e).map((n) => Ke.fromUint8Array(n));
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const Dr = BigInt(0), Bt = BigInt(1), df = BigInt(2), Z3 = BigInt(8);
@@ -18614,7 +18614,7 @@ function Q3(e, t = {}) {
     // Uses algo from RFC8032 5.1.3.
     static fromBytes(S, _ = !1) {
       const w = r.BYTES, { a: T, d: O } = s;
-      S = l0(vs(S, w, "point")), Lo(_, "zip215");
+      S = l0(Is(S, w, "point")), Lo(_, "zip215");
       const A = l0(S), R = S[w - 1];
       A[w - 1] = R & -129;
       const M = qo(A), v = _ ? c : r.ORDER;
@@ -18629,7 +18629,7 @@ function Q3(e, t = {}) {
       return $ !== P && (D = a(-D)), g.fromAffine({ x: D, y: M });
     }
     static fromHex(S, _ = !1) {
-      return g.fromBytes(sn("point", S), _);
+      return g.fromBytes(on("point", S), _);
     }
     get x() {
       return this.toAffine().x;
@@ -18771,8 +18771,8 @@ function e8(e, t, n = {}) {
   }
   function l(v) {
     const U = w.secretKey;
-    v = sn("private key", v, U);
-    const q = sn("hashed private key", t(v), 2 * U), K = a(q.slice(0, U)), H = q.slice(U, 2 * U), D = f(K);
+    v = on("private key", v, U);
+    const q = on("hashed private key", t(v), 2 * U), K = a(q.slice(0, U)), H = q.slice(U, 2 * U), D = f(K);
     return { head: K, prefix: H, scalar: D };
   }
   function d(v) {
@@ -18784,20 +18784,20 @@ function e8(e, t, n = {}) {
   }
   function g(v = Uint8Array.of(), ...U) {
     const q = De(...U);
-    return f(t(u(q, sn("context", v), !!r)));
+    return f(t(u(q, on("context", v), !!r)));
   }
   function m(v, U, q = {}) {
-    v = sn("message", v), r && (v = r(v));
+    v = on("message", v), r && (v = r(v));
     const { prefix: K, scalar: H, pointBytes: D } = d(U), P = g(q.context, K, v), $ = i.multiply(P).toBytes(), F = g(q.context, $, D, v), x = o.create(P + F * H);
     if (!o.isValid(x))
       throw new Error("sign failed: invalid s");
     const B = De($, o.toBytes(x));
-    return vs(B, w.signature, "result");
+    return Is(B, w.signature, "result");
   }
   const E = { zip215: !0 };
   function S(v, U, q, K = E) {
     const { context: H, zip215: D } = K, P = w.signature;
-    v = sn("signature", v, P), U = sn("message", U), q = sn("publicKey", q, w.publicKey), D !== void 0 && Lo(D, "zip215"), r && (U = r(U));
+    v = on("signature", v, P), U = on("message", U), q = on("publicKey", q, w.publicKey), D !== void 0 && Lo(D, "zip215"), r && (U = r(U));
     const $ = P / 2, F = v.subarray(0, $), x = qo(v.subarray($, P));
     let B, L, N;
     try {
@@ -18817,7 +18817,7 @@ function e8(e, t, n = {}) {
     seed: _
   };
   function T(v = c(w.seed)) {
-    return vs(v, w.seed, "seed");
+    return Is(v, w.seed, "seed");
   }
   function O(v) {
     const U = M.randomSecretKey(v);
@@ -18856,7 +18856,7 @@ function e8(e, t, n = {}) {
     },
     toMontgomerySecret(v) {
       const U = w.secretKey;
-      vs(v, U);
+      Is(v, U);
       const q = t(v.subarray(0, U));
       return a(q).subarray(0, U);
     },
@@ -18944,7 +18944,7 @@ const f8 = yi(Vw.p, { isLE: !0 }), l8 = {
   // Constant-time, u/√v
   uvRatio: u8
 }, h8 = r8(l8);
-var P0, R0, Rt, Bs;
+var P0, R0, Rt, Ns;
 class d8 {
   /**
    * Create a new ExpirableMap.
@@ -18954,11 +18954,11 @@ class d8 {
    */
   constructor(t = {}) {
     // Internals
-    rn(this, Rt);
-    rn(this, Bs);
+    sn(this, Rt);
+    sn(this, Ns);
     this[P0] = this.entries.bind(this), this[R0] = "ExpirableMap";
     const { source: n = [], expirationTime: r = 600 * 1e3 } = t, i = Date.now();
-    Yt(this, Rt, new Map([...n].map(([s, o]) => [s, { value: o, timestamp: i }]))), Yt(this, Bs, r);
+    Yt(this, Rt, new Map([...n].map(([s, o]) => [s, { value: o, timestamp: i }]))), Yt(this, Ns, r);
   }
   /**
    * Prune removes all expired entries.
@@ -18966,7 +18966,7 @@ class d8 {
   prune() {
     const t = Date.now();
     for (const [n, r] of Fe(this, Rt).entries())
-      t - r.timestamp > Fe(this, Bs) && Fe(this, Rt).delete(n);
+      t - r.timestamp > Fe(this, Ns) && Fe(this, Rt).delete(n);
     return this;
   }
   // Implementing the Map interface
@@ -18992,7 +18992,7 @@ class d8 {
   get(t) {
     const n = Fe(this, Rt).get(t);
     if (n !== void 0) {
-      if (Date.now() - n.timestamp > Fe(this, Bs)) {
+      if (Date.now() - n.timestamp > Fe(this, Ns)) {
         Fe(this, Rt).delete(t);
         return;
       }
@@ -19067,7 +19067,7 @@ class d8 {
     return Fe(this, Rt).size;
   }
 }
-Rt = new WeakMap(), Bs = new WeakMap(), P0 = Symbol.iterator, R0 = Symbol.toStringTag;
+Rt = new WeakMap(), Ns = new WeakMap(), P0 = Symbol.iterator, R0 = Symbol.toStringTag;
 const U0 = (e) => {
   if (e <= 127)
     return 1;
@@ -19219,8 +19219,8 @@ var Wo, Xo;
 const Ri = class Ri {
   // `fromRaw` and `fromDer` should be used for instantiation, not this constructor.
   constructor(t) {
-    rn(this, Wo);
-    rn(this, Xo);
+    sn(this, Wo);
+    sn(this, Xo);
     if (t.byteLength !== Ri.RAW_KEY_LENGTH)
       throw et.fromCode(new Rr("An Ed25519 public key must be exactly 32 bytes long"));
     Yt(this, Wo, t), Yt(this, Xo, Ri.derEncode(t));
@@ -19287,18 +19287,18 @@ class w8 extends m8 {
   }
 }
 const F0 = 0.5, M0 = 1.5, L0 = 500, q0 = 6e4, V0 = 9e5, D0 = 10;
-var Fn, zo, Yo, Zo, Jo, Qo, ec, tc, Ns;
+var Fn, zo, Yo, Zo, Jo, Qo, ec, tc, ks;
 const $a = class $a {
   constructor(t = $a.default) {
-    rn(this, Fn);
-    rn(this, zo);
-    rn(this, Yo);
-    rn(this, Zo);
-    rn(this, Jo);
-    rn(this, Qo);
-    rn(this, ec);
-    rn(this, tc);
-    rn(this, Ns, 0);
+    sn(this, Fn);
+    sn(this, zo);
+    sn(this, Yo);
+    sn(this, Zo);
+    sn(this, Jo);
+    sn(this, Qo);
+    sn(this, ec);
+    sn(this, tc);
+    sn(this, ks, 0);
     const { initialInterval: n = L0, randomizationFactor: r = F0, multiplier: i = M0, maxInterval: s = q0, maxElapsedTime: o = V0, maxIterations: c = D0, date: a = Date } = t;
     Yt(this, Fn, n), Yt(this, zo, r), Yt(this, Yo, i), Yt(this, Zo, s), Yt(this, tc, a), Yt(this, Jo, a.now()), Yt(this, Qo, o), Yt(this, ec, c);
   }
@@ -19309,20 +19309,20 @@ const $a = class $a {
     return Fe(this, Fn);
   }
   get count() {
-    return Fe(this, Ns);
+    return Fe(this, ks);
   }
   get randomValueFromInterval() {
     const t = Fe(this, zo) * Fe(this, Fn), n = Fe(this, Fn) - t, r = Fe(this, Fn) + t;
     return Math.random() * (r - n) + n;
   }
   incrementCurrentInterval() {
-    return Yt(this, Fn, Math.min(Fe(this, Fn) * Fe(this, Yo), Fe(this, Zo))), qh(this, Ns)._++, Fe(this, Fn);
+    return Yt(this, Fn, Math.min(Fe(this, Fn) * Fe(this, Yo), Fe(this, Zo))), qh(this, ks)._++, Fe(this, Fn);
   }
   next() {
-    return this.ellapsedTimeInMsec >= Fe(this, Qo) || Fe(this, Ns) >= Fe(this, ec) ? null : (this.incrementCurrentInterval(), this.randomValueFromInterval);
+    return this.ellapsedTimeInMsec >= Fe(this, Qo) || Fe(this, ks) >= Fe(this, ec) ? null : (this.incrementCurrentInterval(), this.randomValueFromInterval);
   }
 };
-Fn = new WeakMap(), zo = new WeakMap(), Yo = new WeakMap(), Zo = new WeakMap(), Jo = new WeakMap(), Qo = new WeakMap(), ec = new WeakMap(), tc = new WeakMap(), Ns = new WeakMap(), $a.default = {
+Fn = new WeakMap(), zo = new WeakMap(), Yo = new WeakMap(), Zo = new WeakMap(), Jo = new WeakMap(), Qo = new WeakMap(), ec = new WeakMap(), tc = new WeakMap(), ks = new WeakMap(), $a.default = {
   initialInterval: L0,
   randomizationFactor: F0,
   multiplier: M0,
@@ -19344,16 +19344,16 @@ function N8() {
     if (window.fetch)
       e = window.fetch.bind(window);
     else
-      throw cn.fromCode(new xo("Fetch implementation was not available. You appear to be in a browser context, but window.fetch was not present."));
+      throw an.fromCode(new xo("Fetch implementation was not available. You appear to be in a browser context, but window.fetch was not present."));
   else if (typeof globalThis < "u")
     if (globalThis.fetch)
       e = globalThis.fetch.bind(globalThis);
     else
-      throw cn.fromCode(new xo("Fetch implementation was not available. You appear to be in a Node.js context, but global.fetch was not available."));
+      throw an.fromCode(new xo("Fetch implementation was not available. You appear to be in a Node.js context, but global.fetch was not available."));
   else typeof self < "u" && self.fetch && (e = self.fetch.bind(self));
   if (e)
     return e;
-  throw cn.fromCode(new xo("Fetch implementation was not available. Please provide fetch to the HttpAgent constructor, or ensure it is available in the window or global context."));
+  throw an.fromCode(new xo("Fetch implementation was not available. Please provide fetch to the HttpAgent constructor, or ensure it is available in the window or global context."));
 }
 function k8(e) {
   let t;
@@ -19403,7 +19403,7 @@ class vr {
       for (const u of c) {
         const { timestamp: f, identity: l } = u, d = Ke.fromUint8Array(l).toText();
         let y;
-        if (o === Us.Replied) {
+        if (o === Cs.Replied) {
           const { reply: _ } = i;
           y = Pa({
             status: o,
@@ -19411,7 +19411,7 @@ class vr {
             timestamp: BigInt(f),
             request_id: a
           });
-        } else if (o === Us.Rejected) {
+        } else if (o === Cs.Rejected) {
           const { reject_code: _, reject_message: w, error_code: T } = i;
           y = Pa({
             status: o,
@@ -19422,7 +19422,7 @@ class vr {
             request_id: a
           });
         } else
-          throw an.fromCode(new qn(`Unknown status: ${o}`));
+          throw un.fromCode(new qn(`Unknown status: ${o}`));
         const g = De(ux, y), m = s.nodeKeys.get(d);
         if (!m)
           throw yt.fromCode(new ah());
@@ -19443,9 +19443,9 @@ class vr {
       this.#r = `${i}${s ? ":" + s : ""}`;
     }
     if (this.#n = Promise.resolve(t.identity || new a0()), t.ingressExpiryInMinutes && t.ingressExpiryInMinutes > 5)
-      throw et.fromCode(new ys("The maximum ingress expiry time is 5 minutes.", t.ingressExpiryInMinutes));
+      throw et.fromCode(new gs("The maximum ingress expiry time is 5 minutes.", t.ingressExpiryInMinutes));
     if (t.ingressExpiryInMinutes && t.ingressExpiryInMinutes <= 0)
-      throw et.fromCode(new ys("Ingress expiry time must be greater than 0.", t.ingressExpiryInMinutes));
+      throw et.fromCode(new gs("Ingress expiry time must be greater than 0.", t.ingressExpiryInMinutes));
     this.#o = t.ingressExpiryInMinutes || 5, this.addTransform("update", f0(cl)), t.useQueryNonces && this.addTransform("query", f0(cl)), t.logToConsole && this.log.subscribe((i) => {
       i.level === "error" ? console.error(i.message) : i.level === "warn" ? console.warn(i.message) : console.log(i.message);
     });
@@ -19485,7 +19485,7 @@ class vr {
   }
   async getPrincipal() {
     if (!this.#n)
-      throw cn.fromCode(new Pi());
+      throw an.fromCode(new Pi());
     return (await this.#n).getPrincipal();
   }
   /**
@@ -19503,7 +19503,7 @@ class vr {
   async call(t, n, r) {
     const i = n.callSync ?? !0, s = await (r ?? this.#n);
     if (!s)
-      throw cn.fromCode(new Pi());
+      throw an.fromCode(new Pi());
     const o = Ke.from(t), c = n.effectiveCanisterId ? Ke.from(n.effectiveCanisterId) : o;
     await this.#y(c);
     const a = s.getPrincipal(), u = yf(this.#o, this.#i), f = {
@@ -19563,7 +19563,7 @@ class vr {
             // disable v3 api
             callSync: !1
           }, r);
-        if (S.hasCode(ys) && !this.#g)
+        if (S.hasCode(gs) && !this.#g)
           return await this.syncTime(o), this.call(o, n, r);
         S.code.requestContext = {
           requestId: E,
@@ -19572,7 +19572,7 @@ class vr {
           ingressExpiry: l.body.content.ingress_expiry
         }, _ = S;
       } else
-        _ = an.fromCode(new qn(S));
+        _ = un.fromCode(new qn(S));
       throw this.log.error(`Error while making call: ${_.message}`, _), _;
     }
   }
@@ -19583,7 +19583,7 @@ class vr {
       backoff: o,
       delay: a
     }), a === null)
-      throw an.fromCode(new Ho(`Backoff strategy exhausted after ${c} attempts.`, s));
+      throw un.fromCode(new Ho(`Backoff strategy exhausted after ${c} attempts.`, s));
     a > 0 && await new Promise((y) => setTimeout(y, a));
     let u;
     try {
@@ -19669,7 +19669,7 @@ class vr {
     if (o.status === B8 && o.url.includes("api/v3"))
       throw yt.fromCode(new Ia());
     if (u.startsWith("Invalid request expiry: "))
-      throw et.fromCode(new ys(u, this.#o));
+      throw et.fromCode(new gs(u, this.#o));
     if (i < this.#c)
       return await this.#p({ requestFn: n, backoff: r, tries: i + 1 });
     throw yt.fromCode(new va(o.status, o.statusText, a, u));
@@ -19680,7 +19680,7 @@ class vr {
     let o;
     const c = await (r ?? this.#n);
     if (!c)
-      throw cn.fromCode(new Pi());
+      throw an.fromCode(new Pi());
     const a = Ke.from(t), u = c.getPrincipal(), f = yf(this.#o, this.#i), l = {
       request_type: Mo.Query,
       canister_id: a,
@@ -19742,7 +19742,7 @@ class vr {
         senderPubKey: o.body.sender_pubkey,
         senderSignature: o.body.sender_sig,
         ingressExpiry: o.body.content.ingress_expiry
-      }, _ = S) : _ = an.fromCode(new qn(S)), this.log.error(`Error while making query: ${_.message}`, _), _;
+      }, _ = S) : _ = un.fromCode(new qn(S)), this.log.error(`Error while making query: ${_.message}`, _), _;
     }
   }
   /**
@@ -19756,7 +19756,7 @@ class vr {
     await this.#y();
     const r = await (n ?? this.#n);
     if (!r)
-      throw cn.fromCode(new Pi());
+      throw an.fromCode(new Pi());
     const i = r.getPrincipal(), s = await this._transform({
       request: {
         method: "POST",
@@ -19792,7 +19792,7 @@ class vr {
       a = o(n);
       const f = await this.#n;
       if (!f)
-        throw cn.fromCode(new Pi());
+        throw an.fromCode(new Pi());
       c = await this.createReadStateRequest(n, f);
     }
     this.log.print(`fetching "/api/v2/canister/${s}/read_state" with request:`, c);
@@ -19815,7 +19815,7 @@ class vr {
         senderPubKey: c.body.sender_pubkey,
         senderSignature: c.body.sender_sig,
         ingressExpiry: c.body.content.ingress_expiry
-      }, l = f) : l = an.fromCode(new qn(f)), this.log.error(`Error while making read state: ${l.message}`, l), l;
+      }, l = f) : l = un.fromCode(new qn(f)), this.log.error(`Error while making read state: ${l.message}`, l), l;
     }
   }
   parseTimeFromResponse(t) {
@@ -19828,7 +19828,7 @@ class vr {
         throw yt.fromCode(new gc("Could not decode time from response"));
       const i = Ec(["time"], n);
       if (i.status !== vn.Found)
-        throw yt.fromCode(new Cs("Time was not found in the response or was not in its expected format.", i.status));
+        throw yt.fromCode(new Hs("Time was not found in the response or was not in its expected format.", i.status));
       if (!(i.value instanceof Uint8Array) && !ArrayBuffer.isView(i))
         throw yt.fromCode(new hu("Time was not in its expected format."));
       const s = wh(i.value);
@@ -19870,7 +19870,7 @@ class vr {
           level: "info"
         }));
       } catch (r) {
-        const i = r instanceof _r ? r : an.fromCode(new qn(r));
+        const i = r instanceof _r ? r : un.fromCode(new qn(r));
         throw this.log.error("Caught exception while attempting to sync time", i), i;
       }
     })(), await this.#a.finally(() => {
@@ -19905,7 +19905,7 @@ class vr {
       if (this.rootKey === null && this.host.toString() !== "https://icp-api.io" && this.#e)
         await this.fetchRootKey();
       else
-        throw cn.fromCode(new Ks(this.#e));
+        throw an.fromCode(new Gs(this.#e));
   }
   async #x(t) {
     this.#w && !this.hasSyncedTime() && await this.syncTime(t);
@@ -19955,7 +19955,7 @@ class vr {
 }
 function yf(e, t) {
   const n = e * dl;
-  return As.fromDeltaInMilliseconds(n, t);
+  return vs.fromDeltaInMilliseconds(n, t);
 }
 const P8 = 300 * 1e3;
 function Dw() {
@@ -20014,19 +20014,19 @@ async function jw(e, t, n, r = {}) {
     agent: e,
     pollingOptions: r
   }), s = await e.readState(t, { paths: [i] }, void 0, o)) : s = await e.readState(t, { paths: [i] }), e.rootKey == null)
-    throw cn.fromCode(new Ks());
+    throw an.fromCode(new Gs());
   const a = await Vi.create({
     certificate: s.certificate,
     rootKey: e.rootKey,
     canisterId: t,
     blsVerify: r.blsVerify,
     agent: e
-  }), u = En(a.lookup_path([...i, dt("status")]));
+  }), u = _n(a.lookup_path([...i, dt("status")]));
   let f;
   switch (typeof u > "u" ? f = Er.Unknown : f = new TextDecoder().decode(u), f) {
     case Er.Replied:
       return {
-        reply: En(a.lookup_path([...i, "reply"])),
+        reply: _n(a.lookup_path([...i, "reply"])),
         certificate: a
       };
     case Er.Received:
@@ -20037,13 +20037,13 @@ async function jw(e, t, n, r = {}) {
         request: o
       });
     case Er.Rejected: {
-      const l = new Uint8Array(En(a.lookup_path([...i, "reject_code"])))[0], d = new TextDecoder().decode(En(a.lookup_path([...i, "reject_message"]))), y = En(a.lookup_path([...i, "error_code"])), g = y ? new TextDecoder().decode(y) : void 0;
-      throw _s.fromCode(new yu(n, l, d, g));
+      const l = new Uint8Array(_n(a.lookup_path([...i, "reject_code"])))[0], d = new TextDecoder().decode(_n(a.lookup_path([...i, "reject_message"]))), y = _n(a.lookup_path([...i, "error_code"])), g = y ? new TextDecoder().decode(y) : void 0;
+      throw Ss.fromCode(new yu(n, l, d, g));
     }
     case Er.Done:
-      throw an.fromCode(new rh(n));
+      throw un.fromCode(new rh(n));
   }
-  throw Ts;
+  throw xs;
 }
 async function q8(e) {
   const { paths: t, agent: n, pollingOptions: r } = e;
@@ -20160,15 +20160,15 @@ function V8(e, t, n, r) {
       requestDetails: l.requestDetails
     };
     switch (l.status) {
-      case Us.Rejected: {
+      case Cs.Rejected: {
         const y = new th(l.requestId, l.reject_code, l.reject_message, l.error_code, l.signatures);
         throw y.callContext = {
           canisterId: u,
           methodName: t,
           httpDetails: d
-        }, _s.fromCode(y);
+        }, Ss.fromCode(y);
       }
-      case Us.Replied:
+      case Cs.Replied:
         return n.annotations.includes(pl) ? {
           httpDetails: d,
           result: cs(n.retTypes, l.reply.arg)
@@ -20195,7 +20195,7 @@ function V8(e, t, n, r) {
     let _, w;
     if (ax(E.body)) {
       if (a.rootKey == null)
-        throw cn.fromCode(new Ks());
+        throw an.fromCode(new Gs());
       const R = E.body.certificate;
       w = await Vi.create({
         certificate: R,
@@ -20205,17 +20205,17 @@ function V8(e, t, n, r) {
         agent: a
       });
       const M = [dt("request_status"), m];
-      switch (new TextDecoder().decode(En(w.lookup_path([...M, "status"])))) {
+      switch (new TextDecoder().decode(_n(w.lookup_path([...M, "status"])))) {
         case "replied":
-          _ = En(w.lookup_path([...M, "reply"]));
+          _ = _n(w.lookup_path([...M, "reply"]));
           break;
         case "rejected": {
-          const U = new Uint8Array(En(w.lookup_path([...M, "reject_code"])))[0], q = new TextDecoder().decode(En(w.lookup_path([...M, "reject_message"]))), K = En(w.lookup_path([...M, "error_code"])), H = K ? new TextDecoder().decode(K) : void 0, D = new yu(m, U, q, H);
+          const U = new Uint8Array(_n(w.lookup_path([...M, "reject_code"])))[0], q = new TextDecoder().decode(_n(w.lookup_path([...M, "reject_message"]))), K = _n(w.lookup_path([...M, "error_code"])), H = K ? new TextDecoder().decode(K) : void 0, D = new yu(m, U, q, H);
           throw D.callContext = {
             canisterId: d,
             methodName: t,
             httpDetails: E
-          }, _s.fromCode(D);
+          }, Ss.fromCode(D);
         }
       }
     } else if (cx(E.body)) {
@@ -20224,7 +20224,7 @@ function V8(e, t, n, r) {
         canisterId: d,
         methodName: t,
         httpDetails: E
-      }, _s.fromCode(U);
+      }, Ss.fromCode(U);
     }
     if (E.status === 202) {
       const R = {
@@ -20252,12 +20252,21 @@ function V8(e, t, n, r) {
         canisterId: d,
         methodName: t,
         httpDetails: A
-      }, an.fromCode(R);
+      }, un.fromCode(R);
     }
   };
   const s = (...o) => i({}, ...o);
   return s.withOptions = (o) => (...c) => i(o, ...c), s;
 }
+const mn = {
+  P2PKH: { P2PKH: null },
+  P2SH_P2WPKH: { P2SH_P2WPKH: null },
+  P2WPKH: { P2WPKH: null },
+  P2WSH: { P2WSH: null },
+  P2SH: { P2SH: null },
+  P2TR: { P2TR: null },
+  UNKNOWN: { UNKNOWN: null }
+};
 var _i = {}, Xe = {}, mf = {}, Zt = {}, lr = {}, j0;
 function Wn() {
   return j0 || (j0 = 1, Object.defineProperty(lr, "__esModule", { value: !0 }), lr.testnet = lr.regtest = lr.bitcoin = void 0, lr.bitcoin = {
@@ -20319,7 +20328,7 @@ function Wn() {
     wif: 239
   }), lr;
 }
-var wf = {}, so = {}, bf = {}, hr = {}, K0;
+var wf = {}, oo = {}, bf = {}, hr = {}, K0;
 function Ww() {
   if (K0) return hr;
   K0 = 1, Object.defineProperty(hr, "__esModule", { value: !0 }), hr.encode = hr.decode = hr.check = void 0;
@@ -20979,7 +20988,7 @@ var ep;
 function G8() {
   if (ep) return xi;
   ep = 1, Object.defineProperty(xi, "__esModule", { value: !0 }), xi.encode = xi.decode = void 0;
-  const e = Ww(), t = nn(), n = zt(), { typeforce: r } = n, i = Buffer.alloc(1, 0);
+  const e = Ww(), t = rn(), n = zt(), { typeforce: r } = n, i = Buffer.alloc(1, 0);
   function s(u) {
     let f = 0;
     for (; u[f] === 0; ) ++f;
@@ -21015,7 +21024,7 @@ function G8() {
   return xi.encode = a, xi;
 }
 var tp;
-function nn() {
+function rn() {
   return tp || (tp = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.signature = e.number = e.isCanonicalScriptSignature = e.isDefinedHashType = e.isCanonicalPubKey = e.toStack = e.fromASM = e.toASM = e.decompile = e.compile = e.countNonPushOnlyOPs = e.isPushOnly = e.OPS = void 0;
     const t = Ww(), n = _h();
@@ -21164,9 +21173,9 @@ function gi() {
 }
 var rp;
 function W8() {
-  if (rp) return so;
-  rp = 1, Object.defineProperty(so, "__esModule", { value: !0 }), so.p2data = void 0;
-  const e = Wn(), t = nn(), n = zt(), r = gi(), i = t.OPS;
+  if (rp) return oo;
+  rp = 1, Object.defineProperty(oo, "__esModule", { value: !0 }), oo.p2data = void 0;
+  const e = Wn(), t = rn(), n = zt(), r = gi(), i = t.OPS;
   function s(o, c) {
     if (!o.data && !o.output) throw new TypeError("Not enough data");
     c = Object.assign({ validate: !0 }, c || {}), (0, n.typeforce)(
@@ -21196,13 +21205,13 @@ function W8() {
     }
     return Object.assign(u, o);
   }
-  return so.p2data = s, so;
+  return oo.p2data = s, oo;
 }
-var oo = {}, ip;
+var co = {}, ip;
 function X8() {
-  if (ip) return oo;
-  ip = 1, Object.defineProperty(oo, "__esModule", { value: !0 }), oo.p2ms = void 0;
-  const e = Wn(), t = nn(), n = zt(), r = gi(), i = t.OPS, s = i.OP_RESERVED;
+  if (ip) return co;
+  ip = 1, Object.defineProperty(co, "__esModule", { value: !0 }), co.p2ms = void 0;
+  const e = Wn(), t = rn(), n = zt(), r = gi(), i = t.OPS, s = i.OP_RESERVED;
   function o(c, a) {
     if (!c.input && !c.output && !(c.pubkeys && c.m !== void 0) && !c.signatures)
       throw new TypeError("Not enough data");
@@ -21302,13 +21311,13 @@ function X8() {
     }
     return Object.assign(l, c);
   }
-  return oo.p2ms = o, oo;
+  return co.p2ms = o, co;
 }
-var co = {}, sp;
+var ao = {}, sp;
 function z8() {
-  if (sp) return co;
-  sp = 1, Object.defineProperty(co, "__esModule", { value: !0 }), co.p2pk = void 0;
-  const e = Wn(), t = nn(), n = zt(), r = gi(), i = t.OPS;
+  if (sp) return ao;
+  sp = 1, Object.defineProperty(ao, "__esModule", { value: !0 }), ao.p2pk = void 0;
+  const e = Wn(), t = rn(), n = zt(), r = gi(), i = t.OPS;
   function s(o, c) {
     if (!o.input && !o.output && !o.pubkey && !o.input && !o.signature)
       throw new TypeError("Not enough data");
@@ -21357,9 +21366,9 @@ function z8() {
     }
     return Object.assign(f, o);
   }
-  return co.p2pk = s, co;
+  return ao.p2pk = s, ao;
 }
-var ao = {}, Af = {}, vi = {}, Jt = {}, op;
+var uo = {}, Af = {}, vi = {}, Jt = {}, op;
 function zw() {
   if (op) return Jt;
   op = 1, Object.defineProperty(Jt, "__esModule", { value: !0 }), Jt.ripemd160 = Jt.RIPEMD160 = Jt.md5 = Jt.MD5 = Jt.sha1 = Jt.SHA1 = void 0;
@@ -22301,9 +22310,9 @@ function Th() {
 }
 var yp;
 function tA() {
-  if (yp) return ao;
-  yp = 1, Object.defineProperty(ao, "__esModule", { value: !0 }), ao.p2pkh = void 0;
-  const e = Cr(), t = Wn(), n = nn(), r = zt(), i = gi(), s = Th(), o = n.OPS;
+  if (yp) return uo;
+  yp = 1, Object.defineProperty(uo, "__esModule", { value: !0 }), uo.p2pkh = void 0;
+  const e = Cr(), t = Wn(), n = rn(), r = zt(), i = gi(), s = Th(), o = n.OPS;
   function c(a, u) {
     if (!a.address && !a.hash && !a.output && !a.pubkey && !a.input)
       throw new TypeError("Not enough data");
@@ -22397,13 +22406,13 @@ function tA() {
     }
     return Object.assign(y, a);
   }
-  return ao.p2pkh = c, ao;
+  return uo.p2pkh = c, uo;
 }
-var uo = {}, gp;
+var fo = {}, gp;
 function nA() {
-  if (gp) return uo;
-  gp = 1, Object.defineProperty(uo, "__esModule", { value: !0 }), uo.p2sh = void 0;
-  const e = Cr(), t = Wn(), n = nn(), r = zt(), i = gi(), s = Th(), o = n.OPS;
+  if (gp) return fo;
+  gp = 1, Object.defineProperty(fo, "__esModule", { value: !0 }), fo.p2sh = void 0;
+  const e = Cr(), t = Wn(), n = rn(), r = zt(), i = gi(), s = Th(), o = n.OPS;
   function c(a, u) {
     if (!a.address && !a.hash && !a.output && !a.redeem && !a.input)
       throw new TypeError("Not enough data");
@@ -22542,13 +22551,13 @@ function nA() {
     }
     return Object.assign(l, a);
   }
-  return uo.p2sh = c, uo;
+  return fo.p2sh = c, fo;
 }
-var fo = {}, mp;
+var lo = {}, mp;
 function rA() {
-  if (mp) return fo;
-  mp = 1, Object.defineProperty(fo, "__esModule", { value: !0 }), fo.p2wpkh = void 0;
-  const e = Cr(), t = Wn(), n = nn(), r = zt(), i = gi(), s = uc(), o = n.OPS, c = Buffer.alloc(0);
+  if (mp) return lo;
+  mp = 1, Object.defineProperty(lo, "__esModule", { value: !0 }), lo.p2wpkh = void 0;
+  const e = Cr(), t = Wn(), n = rn(), r = zt(), i = gi(), s = uc(), o = n.OPS, c = Buffer.alloc(0);
   function a(u, f) {
     if (!u.address && !u.hash && !u.output && !u.pubkey && !u.witness)
       throw new TypeError("Not enough data");
@@ -22646,13 +22655,13 @@ function rA() {
     }
     return Object.assign(y, u);
   }
-  return fo.p2wpkh = a, fo;
+  return lo.p2wpkh = a, lo;
 }
-var lo = {}, wp;
+var ho = {}, wp;
 function iA() {
-  if (wp) return lo;
-  wp = 1, Object.defineProperty(lo, "__esModule", { value: !0 }), lo.p2wsh = void 0;
-  const e = Cr(), t = Wn(), n = nn(), r = zt(), i = gi(), s = uc(), o = n.OPS, c = Buffer.alloc(0);
+  if (wp) return ho;
+  wp = 1, Object.defineProperty(ho, "__esModule", { value: !0 }), ho.p2wsh = void 0;
+  const e = Cr(), t = Wn(), n = rn(), r = zt(), i = gi(), s = uc(), o = n.OPS, c = Buffer.alloc(0);
   function a(f) {
     return !!(Buffer.isBuffer(f) && f.length === 65 && f[0] === 4 && (0, r.isPoint)(f));
   }
@@ -22789,9 +22798,9 @@ function iA() {
     }
     return Object.assign(m, f);
   }
-  return lo.p2wsh = u, lo;
+  return ho.p2wsh = u, ho;
 }
-var ho = {}, Oi = {}, bp;
+var po = {}, Oi = {}, bp;
 function xh() {
   if (bp) return Oi;
   bp = 1, Object.defineProperty(Oi, "__esModule", { value: !0 }), Oi.getEccLib = Oi.initEccLib = void 0;
@@ -23130,9 +23139,9 @@ function Ah() {
 }
 var xp;
 function cA() {
-  if (xp) return ho;
-  xp = 1, Object.defineProperty(ho, "__esModule", { value: !0 }), ho.p2tr = void 0;
-  const e = nc(), t = Wn(), n = nn(), r = zt(), i = xh(), s = Ah(), o = gi(), c = uc(), a = vh(), u = n.OPS, f = 1, l = 80;
+  if (xp) return po;
+  xp = 1, Object.defineProperty(po, "__esModule", { value: !0 }), po.p2tr = void 0;
+  const e = nc(), t = Wn(), n = rn(), r = zt(), i = xh(), s = Ah(), o = gi(), c = uc(), a = vh(), u = n.OPS, f = 1, l = 80;
   function d(y, g) {
     if (!y.address && !y.output && !y.pubkey && !y.internalPubkey && !(y.witness && y.witness.length > 1))
       throw new TypeError("Not enough data");
@@ -23331,7 +23340,7 @@ function cA() {
     }
     return Object.assign(w, y);
   }
-  return ho.p2tr = d, ho;
+  return po.p2tr = d, po;
 }
 var Ap;
 function _c() {
@@ -23399,7 +23408,7 @@ var vp;
 function vh() {
   if (vp) return Zt;
   vp = 1, Object.defineProperty(Zt, "__esModule", { value: !0 }), Zt.toOutputScript = Zt.fromOutputScript = Zt.toBech32 = Zt.toBase58Check = Zt.fromBech32 = Zt.fromBase58Check = void 0;
-  const e = Wn(), t = _c(), n = nn(), r = zt(), i = uc(), s = Th(), o = 40, c = 2, a = 16, u = 2, f = 80, l = "WARNING: Sending to a future segwit version address can lead to loss of funds. End users MUST be warned carefully in the GUI and asked if they wish to proceed with caution. Wallets should verify the segwit version from the output of fromBech32, then decide when it is safe to use which version of segwit.";
+  const e = Wn(), t = _c(), n = rn(), r = zt(), i = uc(), s = Th(), o = 40, c = 2, a = 16, u = 2, f = 80, l = "WARNING: Sending to a future segwit version address can lead to loss of funds. End users MUST be warned carefully in the GUI and asked if they wish to proceed with caution. Wallets should verify the segwit version from the output of fromBech32, then decide when it is safe to use which version of segwit.";
   function d(w, T) {
     const O = w.slice(2);
     if (O.length < c || O.length > o)
@@ -23518,10 +23527,10 @@ function vh() {
   }
   return Zt.toOutputScript = _, Zt;
 }
-var po = {}, yo = {}, Ip;
+var yo = {}, go = {}, Ip;
 function aA() {
-  if (Ip) return yo;
-  Ip = 1, Object.defineProperty(yo, "__esModule", { value: !0 }), yo.fastMerkleRoot = void 0;
+  if (Ip) return go;
+  Ip = 1, Object.defineProperty(go, "__esModule", { value: !0 }), go.fastMerkleRoot = void 0;
   function e(t, n) {
     if (!Array.isArray(t)) throw TypeError("Expected values Array");
     if (typeof n != "function")
@@ -23538,13 +23547,13 @@ function aA() {
     }
     return i[0];
   }
-  return yo.fastMerkleRoot = e, yo;
+  return go.fastMerkleRoot = e, go;
 }
-var go = {}, Op;
+var mo = {}, Op;
 function Sc() {
-  if (Op) return go;
-  Op = 1, Object.defineProperty(go, "__esModule", { value: !0 }), go.Transaction = void 0;
-  const e = Su(), t = Cr(), n = nn(), r = nn(), i = zt(), { typeforce: s } = i;
+  if (Op) return mo;
+  Op = 1, Object.defineProperty(mo, "__esModule", { value: !0 }), mo.Transaction = void 0;
+  const e = Su(), t = Cr(), n = rn(), r = rn(), i = zt(), { typeforce: s } = i;
   function o(E) {
     const S = E.length;
     return e.varuint.encodingLength(S) + S;
@@ -23828,12 +23837,12 @@ function Sc() {
       }), T.writeUInt32(this.locktime), _ !== void 0 ? S.slice(_, T.offset) : S;
     }
   }
-  return go.Transaction = m, m.DEFAULT_SEQUENCE = 4294967295, m.SIGHASH_DEFAULT = 0, m.SIGHASH_ALL = 1, m.SIGHASH_NONE = 2, m.SIGHASH_SINGLE = 3, m.SIGHASH_ANYONECANPAY = 128, m.SIGHASH_OUTPUT_MASK = 3, m.SIGHASH_INPUT_MASK = 128, m.ADVANCED_TRANSACTION_MARKER = 0, m.ADVANCED_TRANSACTION_FLAG = 1, go;
+  return mo.Transaction = m, m.DEFAULT_SEQUENCE = 4294967295, m.SIGHASH_DEFAULT = 0, m.SIGHASH_ALL = 1, m.SIGHASH_NONE = 2, m.SIGHASH_SINGLE = 3, m.SIGHASH_ANYONECANPAY = 128, m.SIGHASH_OUTPUT_MASK = 3, m.SIGHASH_INPUT_MASK = 128, m.ADVANCED_TRANSACTION_MARKER = 0, m.ADVANCED_TRANSACTION_FLAG = 1, mo;
 }
 var Bp;
 function uA() {
-  if (Bp) return po;
-  Bp = 1, Object.defineProperty(po, "__esModule", { value: !0 }), po.Block = void 0;
+  if (Bp) return yo;
+  Bp = 1, Object.defineProperty(yo, "__esModule", { value: !0 }), yo.Block = void 0;
   const e = Su(), t = Cr(), n = aA(), r = Sc(), i = zt(), { typeforce: s } = i, o = new TypeError(
     "Cannot compute merkle root for zero transactions"
   ), c = new TypeError(
@@ -23950,7 +23959,7 @@ function uA() {
       return this.witnessCommit.compare(d) === 0;
     }
   }
-  po.Block = a;
+  yo.Block = a;
   function u(l) {
     return l instanceof Array && l[0] && l[0].ins && l[0].ins instanceof Array && l[0].ins[0] && l[0].ins[0].witness && l[0].ins[0].witness instanceof Array && l[0].ins[0].witness.length > 0;
   }
@@ -23961,9 +23970,9 @@ function uA() {
       )
     );
   }
-  return po;
+  return yo;
 }
-var mo = {}, Lc = {}, qc = {}, Pf = {}, as = {}, us = {}, Rf = {}, Np;
+var wo = {}, Lc = {}, qc = {}, Pf = {}, as = {}, us = {}, Rf = {}, Np;
 function Lt() {
   return Np || (Np = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), (function(t) {
@@ -25155,10 +25164,10 @@ function BA() {
   }
   return as.psbtFromKeyVals = o, as;
 }
-var wo = {}, ty;
+var bo = {}, ty;
 function NA() {
-  if (ty) return wo;
-  ty = 1, Object.defineProperty(wo, "__esModule", { value: !0 });
+  if (ty) return bo;
+  ty = 1, Object.defineProperty(bo, "__esModule", { value: !0 });
   const e = Oh(), t = Ih();
   function n({ globalMap: o, inputs: c, outputs: a }) {
     const { globalKeyVals: u, inputKeyVals: f, outputKeyVals: l } = s({
@@ -25170,7 +25179,7 @@ function NA() {
       [E, d].concat(g, m)
     );
   }
-  wo.psbtToBuffer = n;
+  bo.psbtToBuffer = n;
   const r = (o, c) => o.key.compare(c.key);
   function i(o, c) {
     const a = /* @__PURE__ */ new Set(), u = Object.entries(o).reduce((l, [d, y]) => {
@@ -25195,7 +25204,7 @@ function NA() {
       outputKeyVals: a.map((u) => i(u, e.outputs))
     };
   }
-  return wo.psbtToKeyVals = s, wo;
+  return bo.psbtToKeyVals = s, bo;
 }
 var ny;
 function Jw() {
@@ -25492,7 +25501,7 @@ var Qe = {}, ze = {}, oy;
 function yl() {
   if (oy) return ze;
   oy = 1, Object.defineProperty(ze, "__esModule", { value: !0 }), ze.signatureBlocksAction = ze.checkInputForSig = ze.pubkeyInScript = ze.pubkeyPositionInScript = ze.witnessStackToScriptWitness = ze.isP2TR = ze.isP2SHScript = ze.isP2WSHScript = ze.isP2WPKH = ze.isP2PKH = ze.isP2PK = ze.isP2MS = void 0;
-  const e = ns(), t = nn(), n = Sc(), r = Cr(), i = _c();
+  const e = ns(), t = rn(), n = Sc(), r = Cr(), i = _c();
   function s(y) {
     return (g) => {
       try {
@@ -25791,9 +25800,9 @@ function RA() {
 }
 var ay;
 function UA() {
-  if (ay) return mo;
-  ay = 1, Object.defineProperty(mo, "__esModule", { value: !0 }), mo.Psbt = void 0;
-  const e = PA(), t = ns(), n = Qw(), r = vh(), i = Su(), s = Wn(), o = _c(), c = Ah(), a = nn(), u = Sc(), f = RA(), l = yl(), d = {
+  if (ay) return wo;
+  ay = 1, Object.defineProperty(wo, "__esModule", { value: !0 }), wo.Psbt = void 0;
+  const e = PA(), t = ns(), n = Qw(), r = vh(), i = Su(), s = Wn(), o = _c(), c = Ah(), a = rn(), u = Sc(), f = RA(), l = yl(), d = {
     /**
      * A bitcoinjs Network object. This is only used if you pass an `address`
      * parameter to addOutput. Otherwise it is not needed and can be left default.
@@ -26437,7 +26446,7 @@ function UA() {
       return this.data.clearFinalizedInput(h), this;
     }
   }
-  mo.Psbt = y;
+  wo.Psbt = y;
   const g = (p) => new m(p);
   class m {
     constructor(h = Buffer.from([2, 0, 0, 0, 0, 0, 0, 0, 0, 0])) {
@@ -26990,7 +26999,7 @@ PROCEED WITH CAUTION!
   function k(p) {
     return [...Array(p).keys()];
   }
-  return mo;
+  return wo;
 }
 var uy;
 function CA() {
@@ -27004,7 +27013,7 @@ function CA() {
     e.networks = r;
     const i = _c();
     e.payments = i;
-    const s = nn();
+    const s = rn();
     e.script = s;
     var o = uA();
     Object.defineProperty(e, "Block", {
@@ -27701,33 +27710,24 @@ function Bh(e) {
 function Nh(e) {
   return e === No.Mainnet ? Pn : My;
 }
-const Tn = {
-  P2PKH: { P2PKH: null },
-  P2SH_P2WPKH: { P2SH_P2WPKH: null },
-  P2WPKH: { P2WPKH: null },
-  P2WSH: { P2WSH: null },
-  P2SH: { P2SH: null },
-  P2TR: { P2TR: null },
-  UNKNOWN: { UNKNOWN: null }
-};
 function kh(e, t = No.Testnet) {
   const n = Nh(t);
   return vg(e, n);
 }
-function Eo(e) {
+function ys(e) {
   const t = Pn, n = My, r = Y1;
-  let i, s, o = Tn.UNKNOWN;
+  let i, s, o = mn.UNKNOWN;
   if (e.startsWith("bc1") || e.startsWith("tb1") || e.startsWith("bcrt1"))
     try {
-      return s = Rl(e), s.version === 0 ? s.data.length === 20 ? o = Tn.P2WPKH : o = Tn.P2WSH : o = Tn.P2TR, o;
+      return s = Rl(e), s.version === 0 ? s.data.length === 20 ? o = mn.P2WPKH : o = mn.P2WSH : o = mn.P2TR, o;
     } catch {
-      return Tn.UNKNOWN;
+      return mn.UNKNOWN;
     }
   else
     try {
-      return i = Ag(e), i.version === t.pubKeyHash || i.version === n.pubKeyHash || i.version === r.pubKeyHash ? o = Tn.P2PKH : (i.version === t.scriptHash || (i.version, n.scriptHash), o = Tn.P2SH_P2WPKH), o;
+      return i = Ag(e), i.version === t.pubKeyHash || i.version === n.pubKeyHash || i.version === r.pubKeyHash ? o = mn.P2PKH : (i.version === t.scriptHash || (i.version, n.scriptHash), o = mn.P2SH_P2WPKH), o;
     } catch {
-      return Tn.UNKNOWN;
+      return mn.UNKNOWN;
     }
 }
 function VA(e, t, n) {
@@ -27762,7 +27762,7 @@ const g6 = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   bytesToHex: Bh,
   formatPoolUtxo: VA,
-  getAddressType: Eo,
+  getAddressType: ys,
   getScriptByAddress: kh,
   getUtxoProof: r1,
   hexToBytes: n1,
@@ -27802,7 +27802,7 @@ class GA {
         value: BigInt(t.satoshis),
         script: n1(t.scriptPk)
       }
-    }), this.inputAddressTypes.push(Eo(n)), this.inputUtxos.push(t), (n === this.config.address || n === this.config.paymentAddress) && t.runes.length !== 0 && (this.userInputUtxoDusts += BigInt(t.satoshis));
+    }), this.inputAddressTypes.push(ys(n)), this.inputUtxos.push(t), (n === this.config.address || n === this.config.paymentAddress) && t.runes.length !== 0 && (this.userInputUtxoDusts += BigInt(t.satoshis));
   }
   /**
    * Add a standard output to the transaction
@@ -27813,7 +27813,7 @@ class GA {
     this.psbt.addOutput({
       address: t,
       value: n
-    }), this.outputAddressTypes.push(Eo(t));
+    }), this.outputAddressTypes.push(ys(t));
   }
   /**
    * Add an OP_RETURN script output (for Runestone)
@@ -27886,7 +27886,7 @@ class GA {
    */
   async addBtcAndFees(t, n) {
     const r = this.config.paymentAddress, i = this.additionalDustNeeded, s = this.userInputUtxoDusts;
-    this.outputAddressTypes.push(Eo(r));
+    this.outputAddressTypes.push(ys(r));
     let o = BigInt(0), c = BigInt(0), a = [], u = BigInt(0), f = BigInt(0);
     const l = [...this.inputAddressTypes];
     do
@@ -27899,7 +27899,7 @@ class GA {
         if (m.length === 0)
           throw new Error("INSUFFICIENT_BTC_UTXOs");
         this.inputAddressTypes = l.concat([
-          ...m.map(() => Eo(r))
+          ...m.map(() => ys(r))
         ]);
         const E = m.reduce(
           (S, _) => S + BigInt(_.satoshis),
@@ -28184,27 +28184,43 @@ class GA {
    * @example
    * ```typescript
    * // After adding intentions
-   * const psbt = await transaction.build();
+   * const { psbt, txid } = await transaction.build();
    * const signedPsbt = await wallet.signPsbt(psbt);
    * ```
    */
   async build() {
     const t = await this.getInvolvedAddressUtxos();
-    for (const o of this.intentions) {
-      const c = o.poolUtxos;
-      if (!c?.length) continue;
-      t.btc[o.poolAddress] = c, t.rune[o.poolAddress] = {};
-      const a = t.rune[o.poolAddress];
-      for (const u of c)
-        for (const f of u.runes) (a[f.id] ??= []).push(u);
+    for (const u of this.intentions) {
+      const f = u.poolUtxos;
+      if (!f?.length) continue;
+      t.btc[u.poolAddress] = f, t.rune[u.poolAddress] = {};
+      const l = t.rune[u.poolAddress];
+      for (const d of f)
+        for (const y of d.runes) (l[y.id] ??= []).push(d);
     }
     const n = this.addInputsAndCalculateOutputs(t);
     this.addOutputs(n);
     const r = this.config.paymentAddress, i = t.btc[r] ?? [], s = n[r]?.[Jn] ?? BigInt(0);
-    return await this.addBtcAndFees(
+    await this.addBtcAndFees(
       i,
       s < 0 ? -s : BigInt(0)
-    ), this.psbt;
+    );
+    const c = this.psbt.__CACHE.__TX.clone();
+    for (let u = 0; u < this.inputUtxos.length; u++) {
+      const l = this.inputUtxos[u].address;
+      if (l !== this.config.paymentAddress || l !== this.config.address)
+        continue;
+      const d = this.psbt.data.inputs[u].redeemScript, y = ys(l);
+      if (d && y === mn.P2SH_P2WPKH) {
+        const g = nn([d]);
+        c.setInputScript(u, g);
+      }
+    }
+    const a = c.getId();
+    return {
+      psbt: this.psbt,
+      txid: a
+    };
   }
   /**
    * Submit the signed transaction to the orchestrator for execution
@@ -28271,15 +28287,15 @@ class GA {
     });
   }
 }
-class Os extends Error {
+class Bs extends Error {
   response;
   request;
   constructor(t, n) {
-    const r = `${Os.extractMessage(t)}: ${JSON.stringify({
+    const r = `${Bs.extractMessage(t)}: ${JSON.stringify({
       response: t,
       request: n
     })}`;
-    super(r), Object.setPrototypeOf(this, Os.prototype), this.response = t, this.request = n, typeof Error.captureStackTrace == "function" && Error.captureStackTrace(this, Os);
+    super(r), Object.setPrototypeOf(this, Bs.prototype), this.response = t, this.request = n, typeof Error.captureStackTrace == "function" && Error.captureStackTrace(this, Bs);
   }
   static extractMessage(t) {
     return t.errors?.[0]?.message ?? `GraphQL Error (Code: ${String(t.status)})`;
@@ -28649,10 +28665,10 @@ function _y(e) {
   const t = e?.kind;
   return typeof t == "string" && iv.has(t);
 }
-var ws;
+var bs;
 (function(e) {
   e.QUERY = "query", e.MUTATION = "mutation", e.SUBSCRIPTION = "subscription";
-})(ws || (ws = {}));
+})(bs || (bs = {}));
 var ml;
 (function(e) {
   e.QUERY = "QUERY", e.MUTATION = "MUTATION", e.SUBSCRIPTION = "SUBSCRIPTION", e.FIELD = "FIELD", e.FRAGMENT_DEFINITION = "FRAGMENT_DEFINITION", e.FRAGMENT_SPREAD = "FRAGMENT_SPREAD", e.INLINE_FRAGMENT = "INLINE_FRAGMENT", e.VARIABLE_DEFINITION = "VARIABLE_DEFINITION", e.SCHEMA = "SCHEMA", e.SCALAR = "SCALAR", e.OBJECT = "OBJECT", e.FIELD_DEFINITION = "FIELD_DEFINITION", e.ARGUMENT_DEFINITION = "ARGUMENT_DEFINITION", e.INTERFACE = "INTERFACE", e.UNION = "UNION", e.ENUM = "ENUM", e.ENUM_VALUE = "ENUM_VALUE", e.INPUT_OBJECT = "INPUT_OBJECT", e.INPUT_FIELD_DEFINITION = "INPUT_FIELD_DEFINITION";
@@ -28758,7 +28774,7 @@ class uv {
 function fv(e) {
   return e === ee.BANG || e === ee.DOLLAR || e === ee.AMP || e === ee.PAREN_L || e === ee.PAREN_R || e === ee.SPREAD || e === ee.COLON || e === ee.EQUALS || e === ee.AT || e === ee.BRACKET_L || e === ee.BRACKET_R || e === ee.BRACE_L || e === ee.PIPE || e === ee.BRACE_R;
 }
-function Xs(e) {
+function zs(e) {
   return e >= 0 && e <= 55295 || e >= 57344 && e <= 1114111;
 }
 function Tu(e, t) {
@@ -28875,7 +28891,7 @@ function lv(e, t) {
     throw kt(
       e.source,
       i,
-      s === 39 ? `Unexpected single quote character ('), did you mean to use a double quote (")?` : Xs(s) || Tu(n, i) ? `Unexpected character: ${zi(e, i)}.` : `Invalid character: ${zi(e, i)}.`
+      s === 39 ? `Unexpected single quote character ('), did you mean to use a double quote (")?` : zs(s) || Tu(n, i) ? `Unexpected character: ${zi(e, i)}.` : `Invalid character: ${zi(e, i)}.`
     );
   }
   return Et(e, ee.EOF, r, r);
@@ -28887,7 +28903,7 @@ function hv(e, t) {
     const s = n.charCodeAt(i);
     if (s === 10 || s === 13)
       break;
-    if (Xs(s))
+    if (zs(s))
       ++i;
     else if (Tu(n, i))
       i += 2;
@@ -28965,7 +28981,7 @@ function pv(e, t) {
     }
     if (c === 10 || c === 13)
       break;
-    if (Xs(c))
+    if (zs(c))
       ++i;
     else if (Tu(n, i))
       i += 2;
@@ -28987,7 +29003,7 @@ function yv(e, t) {
   for (; i < 12; ) {
     const s = n.charCodeAt(t + i++);
     if (s === 125) {
-      if (i < 5 || !Xs(r))
+      if (i < 5 || !zs(r))
         break;
       return {
         value: String.fromCodePoint(r),
@@ -29008,7 +29024,7 @@ function yv(e, t) {
 }
 function gv(e, t) {
   const n = e.source.body, r = Sy(n, t + 2);
-  if (Xs(r))
+  if (zs(r))
     return {
       value: String.fromCodePoint(r),
       size: 6
@@ -29114,7 +29130,7 @@ function wv(e, t) {
       c += n.slice(o, s), a.push(c), u === 13 && n.charCodeAt(s + 1) === 10 ? s += 2 : ++s, c = "", o = s, i = s;
       continue;
     }
-    if (Xs(u))
+    if (zs(u))
       ++s;
     else if (Tu(n, s))
       s += 2;
@@ -29375,7 +29391,7 @@ class Nv {
     if (this.peek(ee.BRACE_L))
       return this.node(t, {
         kind: Se.OPERATION_DEFINITION,
-        operation: ws.QUERY,
+        operation: bs.QUERY,
         name: void 0,
         variableDefinitions: [],
         directives: [],
@@ -29399,11 +29415,11 @@ class Nv {
     const t = this.expectToken(ee.NAME);
     switch (t.value) {
       case "query":
-        return ws.QUERY;
+        return bs.QUERY;
       case "mutation":
-        return ws.MUTATION;
+        return bs.MUTATION;
       case "subscription":
-        return ws.SUBSCRIPTION;
+        return bs.SUBSCRIPTION;
     }
     throw this.unexpected(t);
   }
@@ -30958,7 +30974,7 @@ ${String(e)}`);
     }
   }, r = await Gv(t.method)(t);
   if (!r.ok)
-    return new Os({ status: r.status, headers: r.headers }, {
+    return new Bs({ status: r.status, headers: r.headers }, {
       query: e.request._tag === "Single" ? e.request.document.expression : e.request.query,
       variables: e.request.variables
     });
@@ -30974,7 +30990,7 @@ ${String(e)}`);
       ...i.executionResult,
       ...s
     };
-    return new Os(o, {
+    return new Bs(o, {
       query: e.request._tag === "Single" ? e.request.document.expression : e.request.query,
       variables: e.request.variables
     });
@@ -31172,7 +31188,7 @@ const Yv = (e, t, n) => e.document ? e : {
  *  Copyright (c) 2025 Michael Mclaughlin <M8ch88l@gmail.com>
  *  MIT Licence
  */
-var bs = 9e15, mi = 1e9, _l = "0123456789abcdef", La = "2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058", qa = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789", Sl = {
+var Es = 9e15, mi = 1e9, _l = "0123456789abcdef", La = "2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058", qa = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789", Sl = {
   // These values must be integers within the stated ranges (inclusive).
   // Most of these values can be changed at run-time using the `Decimal.config` method.
   // The maximum number of significant digits of the result of a calculation or base conversion.
@@ -31221,11 +31237,11 @@ var bs = 9e15, mi = 1e9, _l = "0123456789abcdef", La = "2.3025850929940456840179
   // 0 to EXP_LIMIT
   // The minimum exponent value, beneath which underflow to zero occurs.
   // JavaScript numbers: -324  (5e-324)
-  minE: -bs,
+  minE: -Es,
   // -1 to -EXP_LIMIT
   // The maximum exponent value, above which overflow to Infinity occurs.
   // JavaScript numbers: 308  (1.7976931348623157e+308)
-  maxE: bs,
+  maxE: Es,
   // 1 to EXP_LIMIT
   // Whether to use cryptographically-secure random number generation, if available.
   crypto: !1
@@ -31308,7 +31324,7 @@ se.hyperbolicCosine = se.cosh = function() {
   var e, t, n, r, i, s = this, o = s.constructor, c = new o(1);
   if (!s.isFinite()) return new o(s.s ? 1 / 0 : NaN);
   if (s.isZero()) return c;
-  n = o.precision, r = o.rounding, o.precision = n + Math.max(s.e, s.sd()) + 4, o.rounding = 1, i = s.d.length, i < 32 ? (e = Math.ceil(i / 3), t = (1 / Iu(4, e)).toString()) : (e = 16, t = "2.3283064365386962890625e-10"), s = Fs(o, 1, s.times(t), new o(1), !0);
+  n = o.precision, r = o.rounding, o.precision = n + Math.max(s.e, s.sd()) + 4, o.rounding = 1, i = s.d.length, i < 32 ? (e = Math.ceil(i / 3), t = (1 / Iu(4, e)).toString()) : (e = 16, t = "2.3283064365386962890625e-10"), s = Ms(o, 1, s.times(t), new o(1), !0);
   for (var a, u = e, f = new o(8); u--; )
     a = s.times(s), s = c.minus(a.times(f.minus(a.times(f))));
   return be(s, o.precision = n, o.rounding = r, !0);
@@ -31317,9 +31333,9 @@ se.hyperbolicSine = se.sinh = function() {
   var e, t, n, r, i = this, s = i.constructor;
   if (!i.isFinite() || i.isZero()) return new s(i);
   if (t = s.precision, n = s.rounding, s.precision = t + Math.max(i.e, i.sd()) + 4, s.rounding = 1, r = i.d.length, r < 3)
-    i = Fs(s, 2, i, i, !0);
+    i = Ms(s, 2, i, i, !0);
   else {
-    e = 1.4 * Math.sqrt(r), e = e > 16 ? 16 : e | 0, i = i.times(1 / Iu(5, e)), i = Fs(s, 2, i, i, !0);
+    e = 1.4 * Math.sqrt(r), e = e > 16 ? 16 : e | 0, i = i.times(1 / Iu(5, e)), i = Ms(s, 2, i, i, !0);
     for (var o, c = new s(5), a = new s(16), u = new s(20); e--; )
       o = i.times(i), i = i.times(c.plus(o.times(a.times(o).plus(u))));
   }
@@ -31643,7 +31659,7 @@ function aa(e, t, n) {
 function rI(e, t) {
   var n, r, i;
   if (t.isZero()) return t;
-  r = t.d.length, r < 32 ? (n = Math.ceil(r / 3), i = (1 / Iu(4, n)).toString()) : (n = 16, i = "2.3283064365386962890625e-10"), e.precision += n, t = Fs(e, 1, t.times(i), new e(1));
+  r = t.d.length, r < 32 ? (n = Math.ceil(r / 3), i = (1 / Iu(4, n)).toString()) : (n = 16, i = "2.3283064365386962890625e-10"), e.precision += n, t = Ms(e, 1, t.times(i), new e(1));
   for (var s = n; s--; ) {
     var o = t.times(t);
     t = o.times(o).minus(o).times(8).plus(1);
@@ -31882,13 +31898,13 @@ function iI(e, t) {
 function sI(e, t) {
   var n, r = t.d.length;
   if (r < 3)
-    return t.isZero() ? t : Fs(e, 2, t, t);
-  n = 1.4 * Math.sqrt(r), n = n > 16 ? 16 : n | 0, t = t.times(1 / Iu(5, n)), t = Fs(e, 2, t, t);
+    return t.isZero() ? t : Ms(e, 2, t, t);
+  n = 1.4 * Math.sqrt(r), n = n > 16 ? 16 : n | 0, t = t.times(1 / Iu(5, n)), t = Ms(e, 2, t, t);
   for (var i, s = new e(5), o = new e(16), c = new e(20); n--; )
     i = t.times(t), t = t.times(s.plus(i.times(o.times(i).minus(c))));
   return t;
 }
-function Fs(e, t, n, r, i) {
+function Ms(e, t, n, r, i) {
   var s, o, c, a, u = e.precision, f = Math.ceil(u / _e);
   for (Ae = !1, a = n.times(n), c = new e(r); ; ) {
     if (o = Ze(c.times(a), new e(t++ * t++), u, 1), c = i ? r.plus(o) : r.minus(o), r = Ze(o.times(a), new e(t++ * t++), u, 1), o = c.plus(r), o.d[f] !== void 0) {
@@ -32001,16 +32017,16 @@ function wI(e) {
     0,
     8,
     "toExpNeg",
-    -bs,
+    -Es,
     0,
     "toExpPos",
     0,
-    bs,
+    Es,
     "maxE",
     0,
-    bs,
+    Es,
     "minE",
-    -bs,
+    -Es,
     0,
     "modulo",
     0,