@omnity/ree-client-ts-sdk 0.4.7 → 0.4.8

package/dist/ree-sdk.es.js

@@ -32,10 +32,10 @@ function U1(e, t) {
 function Hy(e) {
   return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
 }
-var Bu = {}, Zs = {}, Dh;
+var Bu = {}, Js = {}, Dh;
 function C1() {
-  if (Dh) return Zs;
-  Dh = 1, Zs.byteLength = c, Zs.toByteArray = u, Zs.fromByteArray = d;
+  if (Dh) return Js;
+  Dh = 1, Js.byteLength = c, Js.toByteArray = u, Js.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,13 +78,13 @@ function C1() {
       e[g >> 10] + e[g >> 4 & 63] + e[g << 2 & 63] + "="
     )), _.join("");
   }
-  return Zs;
+  return Js;
 }
-var xc = {};
+var Ac = {};
 /*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */
 var jh;
 function H1() {
-  return jh || (jh = 1, xc.read = function(e, t, n, r, i) {
+  return jh || (jh = 1, Ac.read = function(e, t, n, r, i) {
     var s, o, c = i * 8 - r - 1, a = (1 << c) - 1, u = a >> 1, f = -7, l = n ? i - 1 : 0, d = n ? -1 : 1, y = e[t + l];
     for (l += d, s = y & (1 << -f) - 1, y >>= -f, f += c; f > 0; s = s * 256 + e[t + l], l += d, f -= 8)
       ;
@@ -98,14 +98,14 @@ function H1() {
       o = o + Math.pow(2, r), s = s - u;
     }
     return (y ? -1 : 1) * o * Math.pow(2, s - r);
-  }, xc.write = function(e, t, n, r, i, s) {
+  }, Ac.write = function(e, t, n, r, i, s) {
     var o, c, a, u = s * 8 - i - 1, f = (1 << u) - 1, l = f >> 1, d = i === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, y = r ? 0 : s - 1, g = r ? 1 : -1, m = t < 0 || t === 0 && 1 / t < 0 ? 1 : 0;
     for (t = Math.abs(t), isNaN(t) || t === 1 / 0 ? (c = isNaN(t) ? 1 : 0, o = f) : (o = Math.floor(Math.log(t) / Math.LN2), t * (a = Math.pow(2, -o)) < 1 && (o--, a *= 2), o + l >= 1 ? t += d / a : t += d * Math.pow(2, 1 - l), t * a >= 2 && (o++, a /= 2), o + l >= f ? (c = 0, o = f) : o + l >= 1 ? (c = (t * a - 1) * Math.pow(2, i), o = o + l) : (c = t * Math.pow(2, l - 1) * Math.pow(2, i), o = 0)); i >= 8; e[n + y] = c & 255, y += g, c /= 256, i -= 8)
       ;
     for (o = o << i | c, u += i; u > 0; e[n + y] = o & 255, y += g, o /= 256, u -= 8)
       ;
     e[n + y - g] |= m * 128;
-  }), xc;
+  }), Ac;
 }
 /*!
  * The buffer module from node.js, for the browser.
@@ -114,7 +114,7 @@ function H1() {
  * @license  MIT
  */
 var Kh;
-function rc() {
+function ic() {
   return Kh || (Kh = 1, (function(e) {
     const t = C1(), n = H1(), r = typeof Symbol == "function" && typeof Symbol.for == "function" ? Symbol.for("nodejs.util.inspect.custom") : null;
     e.Buffer = c, e.SlowBuffer = S, e.INSPECT_MAX_BYTES = 50;
@@ -1054,7 +1054,7 @@ function rc() {
     }
   })(Bu)), Bu;
 }
-var F1 = rc(), Nu = { exports: {} }, Gh;
+var F1 = ic(), Nu = { exports: {} }, Gh;
 function M1() {
   if (Gh) return Nu.exports;
   Gh = 1;
@@ -1155,9 +1155,9 @@ const L1 = /* @__PURE__ */ Hy(q1);
 typeof globalThis > "u" && (globalThis.global = globalThis);
 typeof globalThis.Buffer > "u" && (globalThis.Buffer = F1.Buffer);
 typeof globalThis.process > "u" && (globalThis.process = L1);
-var ot = {}, ku = {}, We = {}, Lt = {}, Pu = {}, Js = {}, Wh;
+var ot = {}, ku = {}, We = {}, Lt = {}, Pu = {}, Qs = {}, Wh;
 function V1() {
-  return Wh || (Wh = 1, Object.defineProperty(Js, "__esModule", { value: !0 }), Js.crypto = void 0, Js.crypto = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0), Js;
+  return Wh || (Wh = 1, Object.defineProperty(Qs, "__esModule", { value: !0 }), Qs.crypto = void 0, Qs.crypto = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0), Qs;
 }
 var Xh;
 function fi() {
@@ -1820,7 +1820,7 @@ function My() {
   }
   return We.SHA512_256 = _, 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 _()), We.sha512_224 = (0, n.createHasher)(() => new E()), We;
 }
-var Qs = {}, Ru = {}, Uu = {}, Jh;
+var eo = {}, Ru = {}, Uu = {}, Jh;
 function D1() {
   return Jh || (Jh = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.hmac = e.HMAC = void 0;
@@ -1869,7 +1869,7 @@ function D1() {
   })(Uu)), Uu;
 }
 var Cu = {}, Qh;
-function Ls() {
+function Vs() {
   return Qh || (Qh = 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 = _, e.asciiToBytes = S, 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 = $, e.memoized = D;
     /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
@@ -2088,11 +2088,11 @@ function Ls() {
   })(Cu)), Cu;
 }
 var Tn = {}, Je = {}, ed;
-function ic() {
+function sc() {
   if (ed) return Je;
   ed = 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 = L, Je.FpIsSquare = K, Je.nLength = H, Je.Field = $, Je.FpSqrtOdd = P, Je.FpSqrtEven = D, Je.hashToPrivateScalar = F, Je.getFieldBytesLength = x, Je.getMinHashLength = B, Je.mapHashToField = q;
   /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-  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);
+  const e = /* @__PURE__ */ Vs(), 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;
@@ -2358,7 +2358,7 @@ function j1() {
   if (td) return Tn;
   td = 1, Object.defineProperty(Tn, "__esModule", { value: !0 }), Tn.wNAF = void 0, Tn.negateCt = i, Tn.normalizeZ = s, Tn.mulEndoUnsafe = E, Tn.pippenger = _, Tn.precomputeMSMUnsafe = S, Tn.validateBasic = w, Tn._createCurveFields = O;
   /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-  const e = /* @__PURE__ */ Ls(), t = /* @__PURE__ */ ic(), n = BigInt(0), r = BigInt(1);
+  const e = /* @__PURE__ */ Vs(), t = /* @__PURE__ */ sc(), n = BigInt(0), r = BigInt(1);
   function i(A, R) {
     const M = R.negate();
     return A ? M : R;
@@ -2598,7 +2598,7 @@ function qy() {
   return nd || (nd = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.DER = e.DERErr = void 0, e._splitEndoScalar = c, e._normFnElement = E, e.weierstrassN = _, e.SWUFpSqrtRatio = w, e.mapToCurveSimpleSWU = T, e.ecdh = A, e.ecdsa = R, e.weierstrassPoints = M, e._legacyHelperEquat = L, e.weierstrass = $;
     /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-    const t = /* @__PURE__ */ D1(), n = /* @__PURE__ */ fi(), r = /* @__PURE__ */ Ls(), i = /* @__PURE__ */ j1(), s = /* @__PURE__ */ ic(), o = (P, D) => (P + (P >= 0 ? D : -D) / y) / D;
+    const t = /* @__PURE__ */ D1(), n = /* @__PURE__ */ fi(), r = /* @__PURE__ */ Vs(), i = /* @__PURE__ */ j1(), s = /* @__PURE__ */ sc(), o = (P, D) => (P + (P >= 0 ? D : -D) / y) / D;
     function c(P, D, F) {
       const [[x, B], [q, N]] = D, V = o(N * P, F), G = o(-B * P, F);
       let X = P - V * x - G * q, Y = -V * B - G * N;
@@ -3462,8 +3462,8 @@ function qy() {
 }
 var rd;
 function K1() {
-  if (rd) return Qs;
-  rd = 1, Object.defineProperty(Qs, "__esModule", { value: !0 }), Qs.getHash = t, Qs.createCurve = n;
+  if (rd) return eo;
+  rd = 1, Object.defineProperty(eo, "__esModule", { value: !0 }), eo.getHash = t, eo.createCurve = n;
   /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
   const e = /* @__PURE__ */ qy();
   function t(r) {
@@ -3473,13 +3473,13 @@ function K1() {
     const s = (o) => (0, e.weierstrass)({ ...r, hash: o });
     return { ...s(i), create: s };
   }
-  return Qs;
+  return eo;
 }
 var Hu = {}, id;
 function G1() {
   return id || (id = 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__ */ Ls(), n = /* @__PURE__ */ ic(), r = t.bytesToNumberBE;
+    const t = /* @__PURE__ */ Vs(), n = /* @__PURE__ */ sc(), 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 W1() {
   return sd || (sd = 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__ */ My(), n = /* @__PURE__ */ fi(), r = /* @__PURE__ */ K1(), i = /* @__PURE__ */ G1(), s = /* @__PURE__ */ ic(), o = /* @__PURE__ */ qy(), c = /* @__PURE__ */ Ls(), a = {
+    const t = /* @__PURE__ */ My(), n = /* @__PURE__ */ fi(), r = /* @__PURE__ */ K1(), i = /* @__PURE__ */ G1(), s = /* @__PURE__ */ sc(), o = /* @__PURE__ */ qy(), c = /* @__PURE__ */ Vs(), a = {
       p: BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),
       n: BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),
       h: BigInt(1),
@@ -3770,14 +3770,14 @@ var pe = {}, od;
 function X1() {
   if (od) return pe;
   od = 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__ */ Ls();
+  const e = /* @__PURE__ */ Vs();
   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 cd;
 function z1() {
   if (cd) return ot;
   cd = 1;
-  var e = /* @__PURE__ */ W1(), t = /* @__PURE__ */ ic(), n = /* @__PURE__ */ X1();
+  var e = /* @__PURE__ */ W1(), t = /* @__PURE__ */ sc(), n = /* @__PURE__ */ X1();
   function r(p) {
     var h = /* @__PURE__ */ Object.create(null);
     return p && Object.keys(p).forEach(function(b) {
@@ -4418,7 +4418,7 @@ function cb(e, t, n, r) {
     throw new Error(`The value of "value" is out of range. It must be >= 0 and <= 65535. Received ${n}`);
   return r === "LE" ? (e[t] = n & 255, e[t + 1] = n >> 8 & 255) : (e[t] = n >> 8 & 255, e[t + 1] = n & 255), t + 2;
 }
-function sc(e, t, n, r) {
+function oc(e, t, n, r) {
   if (t + 4 > e.length)
     throw new Error("Offset is outside the bounds of Uint8Array");
   if (r = r.toUpperCase(), n > 4294967295)
@@ -4448,7 +4448,7 @@ function ub(e, t, n) {
     return r = (r << 8) + e[t], r = (r << 8) + e[t + 1], r;
   }
 }
-function Vs(e, t, n) {
+function $s(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 zy(e) {
 }
 function lb(e, t, n) {
   const r = zy(t);
-  return r === 1 ? En(e, n, t) : r === 2 ? (En(e, n, Ge.OP_PUSHDATA1), En(e, n + 1, t)) : r === 3 ? (En(e, n, Ge.OP_PUSHDATA2), cb(e, n + 1, t, "LE")) : (En(e, n, Ge.OP_PUSHDATA4), sc(e, n + 1, t, "LE")), r;
+  return r === 1 ? En(e, n, t) : r === 2 ? (En(e, n, Ge.OP_PUSHDATA1), En(e, n + 1, t)) : r === 3 ? (En(e, n, Ge.OP_PUSHDATA2), cb(e, n + 1, t, "LE")) : (En(e, n, Ge.OP_PUSHDATA4), oc(e, n + 1, t, "LE")), r;
 }
 function hb(e, t) {
   const n = Br(e, t);
@@ -4517,7 +4517,7 @@ function hb(e, t) {
   } else {
     if (t + 5 > e.length) return null;
     if (n !== Ge.OP_PUSHDATA4) throw new Error("Unexpected opcode");
-    r = Vs(e, t + 1, "LE"), i = 5;
+    r = $s(e, t + 1, "LE"), i = 5;
   }
   return {
     opcode: n,
@@ -4556,12 +4556,12 @@ var Eb;
 function _b(e, t) {
   return Eb?.get(e)?.get(t);
 }
-function Io(e) {
+function Oo(e) {
   const t = typeof e;
   return t === "string" ? `"${e}"` : t === "number" || t === "bigint" || t === "boolean" ? `${e}` : t === "object" || t === "function" ? (e && Object.getPrototypeOf(e)?.constructor?.name) ?? "null" : t;
 }
 function Wt(e, t, n, r, i) {
-  const s = i && "input" in i ? i.input : n.value, o = i?.expected ?? e.expects ?? null, c = i?.received ?? Io(s), a = {
+  const s = i && "input" in i ? i.input : n.value, o = i?.expected ?? e.expects ?? null, c = i?.received ?? Oo(s), a = {
     kind: e.kind,
     type: e.type,
     input: s,
@@ -4647,12 +4647,12 @@ function Ka(e, t) {
     type: "max_value",
     reference: Ka,
     async: !1,
-    expects: `<=${e instanceof Date ? e.toJSON() : Io(e)}`,
+    expects: `<=${e instanceof Date ? e.toJSON() : Oo(e)}`,
     requirement: e,
     message: t,
     _run(n, r) {
       return n.typed && n.value > this.requirement && Wt(this, "value", n, r, {
-        received: n.value instanceof Date ? n.value.toJSON() : Io(n.value)
+        received: n.value instanceof Date ? n.value.toJSON() : Oo(n.value)
       }), n;
     }
   };
@@ -4663,12 +4663,12 @@ function Ga(e, t) {
     type: "min_value",
     reference: Ga,
     async: !1,
-    expects: `>=${e instanceof Date ? e.toJSON() : Io(e)}`,
+    expects: `>=${e instanceof Date ? e.toJSON() : Oo(e)}`,
     requirement: e,
     message: t,
     _run(n, r) {
       return n.typed && n.value < this.requirement && Wt(this, "value", n, r, {
-        received: n.value instanceof Date ? n.value.toJSON() : Io(n.value)
+        received: n.value instanceof Date ? n.value.toJSON() : Oo(n.value)
       }), n;
     }
   };
@@ -5022,7 +5022,7 @@ function li(e, t) {
     n[r] = pa(e.entries[r]);
   return { ...e, entries: n };
 }
-function $s(...e) {
+function Ds(...e) {
   return {
     ...e[0],
     pipe: e,
@@ -5041,8 +5041,8 @@ function $s(...e) {
 }
 const ud = new Uint8Array(32), fd = Ur(
   "fffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"
-), vt = (e) => $s(Xa(Uint8Array), Zy(e));
-function Oo(e, t) {
+), vt = (e) => Ds(Xa(Uint8Array), Zy(e));
+function Bo(e, t) {
   return e.length !== t.length ? !1 : e.every((n, r) => de(n, t[r]) === 0);
 }
 function Kn(e) {
@@ -5062,18 +5062,18 @@ function ng(e) {
   return Array.isArray(e) ? e.length !== 2 ? !1 : e.every((t) => ng(t)) : Bl(e);
 }
 const xb = vt(32), Ab = vt(20), ld = vt(32), De = Xa(Uint8Array);
-$s(Ji(), Jy(/^([0-9a-f]{2})+$/i));
-const vb = $s(
+Ds(Ji(), Jy(/^([0-9a-f]{2})+$/i));
+const vb = Ds(
   ln(),
   vl(),
   Ga(0),
   Ka(255)
-), wr = $s(
+), wr = Ds(
   ln(),
   vl(),
   Ga(0),
   Ka(4294967295)
-), Mu = $s(
+), Mu = Ds(
   eg(),
   Ga(0n),
   Ka(0x7fffffffffffffffn)
@@ -5126,7 +5126,7 @@ function sg(e) {
   return Wa(De, e) || Nb(e);
 }
 function Nl(e) {
-  return Wa($s(Qy(), Yy(sg)), e);
+  return Wa(Ds(Qy(), Yy(sg)), e);
 }
 function og(e) {
   return e.length - e.filter(sg).length;
@@ -5209,7 +5209,7 @@ function kl(e) {
 function Nr(e) {
   return !(e instanceof Uint8Array) || !kl(e[e.length - 1]) ? !1 : Q1(e.slice(0, -1));
 }
-const To = Bb;
+const xo = Bb;
 function Te(e, t, n) {
   Object.defineProperty(e, t, {
     configurable: !0,
@@ -5232,13 +5232,13 @@ function On(e) {
   let t;
   return () => (t !== void 0 || (t = e()), t);
 }
-const ys = Ge, Ac = ys.OP_RESERVED;
+const gs = Ge, vc = gs.OP_RESERVED;
 function za(e, t) {
   if (!e.input && !e.output && !(e.pubkeys && e.m !== void 0) && !e.signatures)
     throw new TypeError("Not enough data");
   t = Object.assign({ validate: !0 }, t || {});
   function n(a) {
-    return Nr(a) || (t.allowIncomplete && a === ys.OP_0) !== void 0;
+    return Nr(a) || (t.allowIncomplete && a === gs.OP_0) !== void 0;
   }
   at(
     li(
@@ -5260,16 +5260,16 @@ function za(e, t) {
   const i = { network: e.network || Un };
   let s = [], o = !1;
   function c(a) {
-    o || (o = !0, s = ht(a), i.m = s[0] - Ac, i.n = s[s.length - 2] - Ac, i.pubkeys = s.slice(1, -2));
+    o || (o = !0, s = ht(a), i.m = s[0] - vc, i.n = s[s.length - 2] - vc, i.pubkeys = s.slice(1, -2));
   }
   if (Te(i, "output", () => {
     if (e.m && i.n && e.pubkeys)
       return nn(
         [].concat(
-          Ac + e.m,
+          vc + e.m,
           e.pubkeys,
-          Ac + i.n,
-          ys.OP_CHECKMULTISIG
+          vc + i.n,
+          gs.OP_CHECKMULTISIG
         )
       );
   }), Te(i, "m", () => {
@@ -5286,7 +5286,7 @@ function za(e, t) {
       return ht(e.input).slice(1);
   }), Te(i, "input", () => {
     if (e.signatures)
-      return nn([ys.OP_0].concat(e.signatures));
+      return nn([gs.OP_0].concat(e.signatures));
   }), Te(i, "witness", () => {
     if (i.input)
       return [];
@@ -5297,7 +5297,7 @@ function za(e, t) {
     if (e.output) {
       if (c(e.output), at(ln(), s[0], { message: "Output is invalid" }), at(ln(), s[s.length - 2], {
         message: "Output is invalid"
-      }), s[s.length - 1] !== ys.OP_CHECKMULTISIG)
+      }), s[s.length - 1] !== gs.OP_CHECKMULTISIG)
         throw new TypeError("Output is invalid");
       if (i.m <= 0 || i.n > 16 || i.m > i.n || i.n !== s.length - 3)
         throw new TypeError("Output is invalid");
@@ -5305,7 +5305,7 @@ function za(e, t) {
         throw new TypeError("Output is invalid");
       if (e.m !== void 0 && e.m !== i.m) throw new TypeError("m mismatch");
       if (e.n !== void 0 && e.n !== i.n) throw new TypeError("n mismatch");
-      if (e.pubkeys && !Oo(e.pubkeys, i.pubkeys))
+      if (e.pubkeys && !Bo(e.pubkeys, i.pubkeys))
         throw new TypeError("Pubkeys mismatch");
     }
     if (e.pubkeys) {
@@ -5320,10 +5320,10 @@ function za(e, t) {
         throw new TypeError("Too many signatures provided");
     }
     if (e.input) {
-      if (e.input[0] !== ys.OP_0) throw new TypeError("Input is invalid");
+      if (e.input[0] !== gs.OP_0) throw new TypeError("Input is invalid");
       if (i.signatures.length === 0 || !i.signatures.every(n))
         throw new TypeError("Input has invalid signature(s)");
-      if (e.signatures && !Oo(e.signatures, i.signatures))
+      if (e.signatures && !Bo(e.signatures, i.signatures))
         throw new TypeError("Signature mismatch");
       if (e.m !== void 0 && e.m !== e.signatures.length)
         throw new TypeError("Signature count mismatch");
@@ -5386,7 +5386,7 @@ function ag(e, t) {
 }
 const ss = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function oc(e) {
+function cc(e) {
   return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
 }
 function Cb(e) {
@@ -5394,7 +5394,7 @@ function Cb(e) {
     throw new Error("positive integer expected, got " + e);
 }
 function Nn(e, ...t) {
-  if (!oc(e))
+  if (!cc(e))
     throw new Error("Uint8Array expected");
   if (t.length > 0 && !t.includes(e.length))
     throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
@@ -5421,7 +5421,7 @@ function qu(e) {
 function Jn(e, t) {
   return e << 32 - t | e >>> t;
 }
-function vc(e, t) {
+function Ic(e, t) {
   return e << t | e >>> 32 - t >>> 0;
 }
 const ug = /* @ts-ignore */ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", Fb = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
@@ -5442,7 +5442,7 @@ function wd(e) {
   if (e >= ar.a && e <= ar.f)
     return e - (ar.a - 10);
 }
-function cc(e) {
+function ac(e) {
   if (typeof e != "string")
     throw new Error("hex string expected, got " + typeof e);
   if (ug)
@@ -5638,7 +5638,7 @@ const Fr = /* @__PURE__ */ Uint32Array.from([
 function bd(e, t, n, r) {
   return e === 0 ? t ^ n ^ r : e === 1 ? t & n | ~t & r : e === 2 ? (t | ~n) ^ r : e === 3 ? t & r | n & ~r : t ^ (n | ~r);
 }
-const Ic = /* @__PURE__ */ new Uint32Array(16);
+const Oc = /* @__PURE__ */ new Uint32Array(16);
 class Xb extends Pl {
   constructor() {
     super(64, 20, 8, !0), this.h0 = 1732584193, this.h1 = -271733879, this.h2 = -1732584194, this.h3 = 271733878, this.h4 = -1009589776;
@@ -5652,31 +5652,31 @@ class Xb extends Pl {
   }
   process(t, n) {
     for (let y = 0; y < 16; y++, n += 4)
-      Ic[y] = t.getUint32(n, !0);
+      Oc[y] = t.getUint32(n, !0);
     let r = this.h0 | 0, i = r, s = this.h1 | 0, o = s, c = this.h2 | 0, a = c, u = this.h3 | 0, f = u, l = this.h4 | 0, d = l;
     for (let y = 0; y < 5; y++) {
       const g = 4 - y, m = Gb[y], E = Wb[y], _ = pg[y], S = yg[y], w = jb[y], T = Kb[y];
       for (let O = 0; O < 16; O++) {
-        const A = vc(r + bd(y, s, c, u) + Ic[_[O]] + m, w[O]) + l | 0;
-        r = l, l = u, u = vc(c, 10) | 0, c = s, s = A;
+        const A = Ic(r + bd(y, s, c, u) + Oc[_[O]] + m, w[O]) + l | 0;
+        r = l, l = u, u = Ic(c, 10) | 0, c = s, s = A;
       }
       for (let O = 0; O < 16; O++) {
-        const A = vc(i + bd(g, o, a, f) + Ic[S[O]] + E, T[O]) + d | 0;
-        i = d, d = f, f = vc(a, 10) | 0, a = o, o = A;
+        const A = Ic(i + bd(g, o, a, f) + Oc[S[O]] + E, T[O]) + d | 0;
+        i = d, d = f, f = Ic(a, 10) | 0, a = o, o = A;
       }
     }
     this.set(this.h1 + c + f | 0, this.h2 + u + d | 0, this.h3 + l + i | 0, this.h4 + r + o | 0, this.h0 + s + a | 0);
   }
   roundClean() {
-    ji(Ic);
+    ji(Oc);
   }
   destroy() {
     this.destroyed = !0, ji(this.buffer), this.set(0, 0, 0, 0, 0);
   }
 }
-const zb = /* @__PURE__ */ Ya(() => new Xb()), Yb = zb, Oc = /* @__PURE__ */ BigInt(2 ** 32 - 1), Ed = /* @__PURE__ */ BigInt(32);
+const zb = /* @__PURE__ */ Ya(() => new Xb()), Yb = zb, Bc = /* @__PURE__ */ BigInt(2 ** 32 - 1), Ed = /* @__PURE__ */ BigInt(32);
 function Zb(e, t = !1) {
-  return t ? { h: Number(e & Oc), l: Number(e >> Ed & Oc) } : { h: Number(e >> Ed & Oc) | 0, l: Number(e & Oc) | 0 };
+  return t ? { h: Number(e & Bc), l: Number(e >> Ed & Bc) } : { h: Number(e >> Ed & Bc) | 0, l: Number(e & Bc) | 0 };
 }
 function Jb(e, t = !1) {
   const n = e.length;
@@ -5687,7 +5687,7 @@ function Jb(e, t = !1) {
   }
   return [r, i];
 }
-const _d = (e, t, n) => e >>> n, Sd = (e, t, n) => e << 32 - n | t >>> n, os = (e, t, n) => e >>> n | t << 32 - n, cs = (e, t, n) => e << 32 - n | t >>> n, Bc = (e, t, n) => e << 64 - n | t >>> n - 32, Nc = (e, t, n) => e >>> n - 32 | t << 64 - n;
+const _d = (e, t, n) => e >>> n, Sd = (e, t, n) => e << 32 - n | t >>> n, os = (e, t, n) => e >>> n | t << 32 - n, cs = (e, t, n) => e << 32 - n | t >>> n, Nc = (e, t, n) => e << 64 - n | t >>> n - 32, kc = (e, t, n) => e >>> n - 32 | t << 64 - n;
 function ur(e, t, n, r) {
   const i = (t >>> 0) + (r >>> 0);
   return { h: e + n + (i / 2 ** 32 | 0) | 0, l: i | 0 };
@@ -5895,12 +5895,12 @@ class uE extends Pl {
     for (let w = 0; w < 16; w++, n += 4)
       Lr[w] = t.getUint32(n), Vr[w] = t.getUint32(n += 4);
     for (let w = 16; w < 80; w++) {
-      const T = Lr[w - 15] | 0, O = Vr[w - 15] | 0, A = os(T, O, 1) ^ os(T, O, 8) ^ _d(T, O, 7), R = cs(T, O, 1) ^ cs(T, O, 8) ^ Sd(T, O, 7), M = Lr[w - 2] | 0, v = Vr[w - 2] | 0, U = os(M, v, 19) ^ Bc(M, v, 61) ^ _d(M, v, 6), L = cs(M, v, 19) ^ Nc(M, v, 61) ^ Sd(M, v, 6), K = tE(R, L, Vr[w - 7], Vr[w - 16]), H = nE(K, A, U, Lr[w - 7], Lr[w - 16]);
+      const T = Lr[w - 15] | 0, O = Vr[w - 15] | 0, A = os(T, O, 1) ^ os(T, O, 8) ^ _d(T, O, 7), R = cs(T, O, 1) ^ cs(T, O, 8) ^ Sd(T, O, 7), M = Lr[w - 2] | 0, v = Vr[w - 2] | 0, U = os(M, v, 19) ^ Nc(M, v, 61) ^ _d(M, v, 6), L = cs(M, v, 19) ^ kc(M, v, 61) ^ Sd(M, v, 6), K = tE(R, L, Vr[w - 7], Vr[w - 16]), H = nE(K, A, U, Lr[w - 7], Lr[w - 16]);
       Lr[w] = H | 0, Vr[w] = K | 0;
     }
     let { Ah: r, Al: i, Bh: s, Bl: o, Ch: c, Cl: a, Dh: u, Dl: f, Eh: l, El: d, Fh: y, Fl: g, Gh: m, Gl: E, Hh: _, Hl: S } = this;
     for (let w = 0; w < 80; w++) {
-      const T = os(l, d, 14) ^ os(l, d, 18) ^ Bc(l, d, 41), O = cs(l, d, 14) ^ cs(l, d, 18) ^ Nc(l, d, 41), A = l & y ^ ~l & m, R = d & g ^ ~d & E, M = rE(S, O, R, aE[w], Vr[w]), v = iE(M, _, T, A, cE[w], Lr[w]), U = M | 0, L = os(r, i, 28) ^ Bc(r, i, 34) ^ Bc(r, i, 39), K = cs(r, i, 28) ^ Nc(r, i, 34) ^ Nc(r, i, 39), H = r & s ^ r & c ^ s & c, $ = i & o ^ i & a ^ o & a;
+      const T = os(l, d, 14) ^ os(l, d, 18) ^ Nc(l, d, 41), O = cs(l, d, 14) ^ cs(l, d, 18) ^ kc(l, d, 41), A = l & y ^ ~l & m, R = d & g ^ ~d & E, M = rE(S, O, R, aE[w], Vr[w]), v = iE(M, _, T, A, cE[w], Lr[w]), U = M | 0, L = os(r, i, 28) ^ Nc(r, i, 34) ^ Nc(r, i, 39), K = cs(r, i, 28) ^ kc(r, i, 34) ^ kc(r, i, 39), H = r & s ^ r & c ^ s & c, $ = i & o ^ i & a ^ o & a;
       _ = m | 0, S = E | 0, m = y | 0, E = g | 0, y = l | 0, g = d | 0, { h: l, l: d } = ur(u | 0, f | 0, v | 0, U | 0), u = c | 0, f = a | 0, c = s | 0, a = o | 0, s = r | 0, o = i | 0;
       const P = Qb(U, K, $);
       r = eE(P, v, L, H), i = P | 0;
@@ -6635,8 +6635,8 @@ function yE(e) {
 function gE(e) {
   return en(en(e));
 }
-const Bo = yE(gE), $r = Ge;
-function ac(e, t) {
+const No = yE(gE), $r = Ge;
+function uc(e, t) {
   if (!e.address && !e.hash && !e.output && !e.pubkey && !e.input)
     throw new TypeError("Not enough data");
   t = Object.assign({ validate: !0 }, t || {}), at(
@@ -6654,13 +6654,13 @@ function ac(e, t) {
     e
   );
   const n = On(() => {
-    const o = Bo.decode(e.address), c = Br(o, 0), a = o.slice(1);
+    const o = No.decode(e.address), c = Br(o, 0), a = o.slice(1);
     return { version: c, hash: a };
   }), r = On(() => ht(e.input)), i = e.network || Un, s = { name: "p2pkh", network: i };
   if (Te(s, "address", () => {
     if (!s.hash) return;
     const o = new Uint8Array(21);
-    return En(o, 0, i.pubKeyHash), o.set(s.hash, 1), Bo.encode(o);
+    return En(o, 0, i.pubKeyHash), o.set(s.hash, 1), No.encode(o);
   }), Te(s, "hash", () => {
     if (e.output) return e.output.slice(3, 23);
     if (e.address) return n().hash;
@@ -6730,8 +6730,8 @@ function ac(e, t) {
   }
   return Object.assign(s, e);
 }
-const eo = Ge;
-function uc(e, t) {
+const to = Ge;
+function fc(e, t) {
   if (!e.address && !e.hash && !e.output && !e.redeem && !e.input)
     throw new TypeError("Not enough data");
   t = Object.assign({ validate: !0 }, t || {}), at(
@@ -6758,13 +6758,13 @@ function uc(e, t) {
   let n = e.network;
   n || (n = e.redeem && e.redeem.network || Un);
   const r = { network: n }, i = On(() => {
-    const c = Bo.decode(e.address), a = Br(c, 0), u = c.slice(1);
+    const c = No.decode(e.address), a = Br(c, 0), u = c.slice(1);
     return { version: a, hash: u };
   }), s = On(() => ht(e.input)), o = On(() => {
     const c = s(), a = c[c.length - 1];
     return {
       network: n,
-      output: a === eo.OP_FALSE ? Uint8Array.from([]) : a,
+      output: a === to.OP_FALSE ? Uint8Array.from([]) : a,
       input: nn(c.slice(0, -1)),
       witness: e.witness || []
     };
@@ -6772,14 +6772,14 @@ function uc(e, t) {
   if (Te(r, "address", () => {
     if (!r.hash) return;
     const c = new Uint8Array(21);
-    return En(c, 0, r.network.scriptHash), c.set(r.hash, 1), Bo.encode(c);
+    return En(c, 0, r.network.scriptHash), c.set(r.hash, 1), No.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 nn([eo.OP_HASH160, r.hash, eo.OP_EQUAL]);
+      return nn([to.OP_HASH160, r.hash, to.OP_EQUAL]);
   }), Te(r, "redeem", () => {
     if (e.input)
       return o();
@@ -6808,7 +6808,7 @@ function uc(e, t) {
       c = e.hash;
     }
     if (e.output) {
-      if (e.output.length !== 23 || e.output[0] !== eo.OP_HASH160 || e.output[1] !== 20 || e.output[22] !== eo.OP_EQUAL)
+      if (e.output.length !== 23 || e.output[0] !== to.OP_HASH160 || e.output[1] !== 20 || e.output[22] !== to.OP_EQUAL)
         throw new TypeError("Output is invalid");
       const u = e.output.slice(2, 22);
       if (c.length > 0 && de(c, u) !== 0)
@@ -6864,13 +6864,13 @@ function uc(e, t) {
       }
       a(e.redeem);
     }
-    if (e.witness && e.redeem && e.redeem.witness && !Oo(e.redeem.witness, e.witness))
+    if (e.witness && e.redeem && e.redeem.witness && !Bo(e.redeem.witness, e.witness))
       throw new TypeError("Witness and redeem.witness mismatch");
   }
   return Object.assign(r, e);
 }
 var Ei = {}, Td;
-function fc() {
+function lc() {
   if (Td) return Ei;
   Td = 1, Object.defineProperty(Ei, "__esModule", { value: !0 }), Ei.bech32m = Ei.bech32 = void 0;
   const e = "qpzry9x8gf2tvdw0s3jn54khce6mua7l", t = {};
@@ -7004,7 +7004,7 @@ function fc() {
   }
   return Ei.bech32 = a("bech32"), Ei.bech32m = a("bech32m"), Ei;
 }
-var Gt = fc();
+var Gt = lc();
 const xd = Ge, mE = new Uint8Array(0);
 function Ja(e, t) {
   if (!e.address && !e.hash && !e.output && !e.pubkey && !e.witness)
@@ -7104,10 +7104,10 @@ function Ja(e, t) {
   return Object.assign(i, e);
 }
 const Ad = Ge, Vu = new Uint8Array(0);
-function kc(e) {
+function Pc(e) {
   return !!(e instanceof Uint8Array && e.length === 65 && e[0] === 4 && Kn(e));
 }
-function lc(e, t) {
+function hc(e, t) {
   if (!e.address && !e.hash && !e.output && !e.redeem && !e.witness)
     throw new TypeError("Not enough data");
   t = Object.assign({ validate: !0 }, t || {}), at(
@@ -7217,10 +7217,10 @@ function lc(e, t) {
       }
       if (e.redeem.input && !Nl(r()))
         throw new TypeError("Non push-only scriptSig");
-      if (e.witness && e.redeem.witness && !Oo(e.witness, e.redeem.witness))
+      if (e.witness && e.redeem.witness && !Bo(e.witness, e.redeem.witness))
         throw new TypeError("Witness and redeem.witness mismatch");
-      if (e.redeem.input && r().some(kc) || e.redeem.output && (ht(e.redeem.output) || []).some(
-        kc
+      if (e.redeem.input && r().some(Pc) || e.redeem.output && (ht(e.redeem.output) || []).some(
+        Pc
       ))
         throw new TypeError(
           "redeem.input or redeem.output contains uncompressed pubkey"
@@ -7230,22 +7230,22 @@ function lc(e, t) {
       const c = e.witness[e.witness.length - 1];
       if (e.redeem && e.redeem.output && de(e.redeem.output, c) !== 0)
         throw new TypeError("Witness and redeem.output mismatch");
-      if (e.witness.some(kc) || (ht(c) || []).some(kc))
+      if (e.witness.some(Pc) || (ht(c) || []).some(Pc))
         throw new TypeError("Witness contains uncompressed pubkey");
     }
   }
   return Object.assign(s, e);
 }
-const xo = {};
+const Ao = {};
 function wE(e) {
-  e ? e !== xo.eccLib && (bE(e), xo.eccLib = e) : xo.eccLib = e;
+  e ? e !== Ao.eccLib && (bE(e), Ao.eccLib = e) : Ao.eccLib = e;
 }
 function $f() {
-  if (!xo.eccLib)
+  if (!Ao.eccLib)
     throw new Error(
       "No ECC Library provided. You must call initEccLib() with a valid TinySecp256k1Interface instance"
     );
-  return xo.eccLib;
+  return Ao.eccLib;
 }
 const fr = (e) => Ur(e);
 function bE(e) {
@@ -7378,7 +7378,7 @@ function hi(e, t, n) {
   let r = 0;
   return e < 253 ? (t.set([Number(e)], n), r = 1) : e <= 65535 ? (t.set([253], n), _E(t, n + 1, Number(e), "LE"), r = 3) : e <= 4294967295 ? (t.set([254], n), SE(t, n + 1, Number(e), "LE"), r = 5) : (t.set([255], n), TE(t, n + 1, BigInt(e), "LE"), r = 9), { buffer: t, bytes: r };
 }
-function Ds(e, t) {
+function js(e, t) {
   t === void 0 && (t = 0);
   const n = e.at(t);
   if (n === void 0)
@@ -7451,7 +7451,7 @@ class Dt {
     this.offset = Wy(this.buffer, this.offset, BigInt(t), "LE");
   }
   writeUInt32(t) {
-    this.offset = sc(this.buffer, this.offset, t, "LE");
+    this.offset = oc(this.buffer, this.offset, t, "LE");
   }
   writeUInt64(t) {
     this.offset = ab(this.buffer, this.offset, BigInt(t), "LE");
@@ -7495,7 +7495,7 @@ class kE {
     return this.offset += 4, t;
   }
   readUInt32() {
-    const t = Vs(this.buffer, this.offset, "LE");
+    const t = $s(this.buffer, this.offset, "LE");
     return this.offset += 4, t;
   }
   readInt64() {
@@ -7503,7 +7503,7 @@ class kE {
     return this.offset += 8, t;
   }
   readVarInt() {
-    const { bigintValue: t, bytes: n } = Ds(this.buffer, this.offset);
+    const { bigintValue: t, bytes: n } = js(this.buffer, this.offset);
     return this.offset += n, t;
   }
   readSlice(t) {
@@ -7570,7 +7570,7 @@ function UE(e, t) {
     ut(t ? [e, t] : [e])
   );
 }
-function Pc(e, t) {
+function Rc(e, t) {
   if (!(e instanceof Uint8Array) || e.length !== 32 || t && t.length !== 32) return null;
   const n = UE(e, t), r = $f().xOnlyPointAddTweak(e, n);
   return !r || r.xOnlyPubkey === null ? null : {
@@ -7586,7 +7586,7 @@ function CE(e) {
   return hi(e.length, n), ut([n, e]);
 }
 const Id = Ge, Od = 1, HE = 80;
-function hc(e, t) {
+function dc(e, t) {
   if (!e.address && !e.output && !e.pubkey && !e.internalPubkey && !(e.witness && e.witness.length > 1))
     throw new TypeError("Not enough data");
   t = Object.assign({ validate: !0 }, t || {}), at(
@@ -7657,7 +7657,7 @@ function hc(e, t) {
     if (e.output) return e.output.slice(2);
     if (e.address) return n().data;
     if (o.internalPubkey) {
-      const c = Pc(o.internalPubkey, o.hash);
+      const c = Rc(o.internalPubkey, o.hash);
       if (c) return c.x;
     }
   }), Te(o, "internalPubkey", () => {
@@ -7679,7 +7679,7 @@ function hc(e, t) {
         version: o.redeemVersion
       }), u = ma(c, a);
       if (!u) return;
-      const f = Pc(e.internalPubkey, c.hash);
+      const f = Rc(e.internalPubkey, c.hash);
       if (!f) return;
       const l = ut(
         [
@@ -7714,7 +7714,7 @@ function hc(e, t) {
       c = e.output.slice(2);
     }
     if (e.internalPubkey) {
-      const f = Pc(e.internalPubkey, o.hash);
+      const f = Rc(e.internalPubkey, o.hash);
       if (c.length > 0 && de(c, f.x) !== 0)
         throw new TypeError("Pubkey mismatch");
       c = f.x;
@@ -7742,7 +7742,7 @@ function hc(e, t) {
         if (o.redeem.output && de(e.redeem.output, o.redeem.output) !== 0)
           throw new TypeError("Redeem.output and witness mismatch");
       }
-      if (e.redeem.witness && o.redeem.witness && !Oo(e.redeem.witness, o.redeem.witness))
+      if (e.redeem.witness && o.redeem.witness && !Bo(e.redeem.witness, o.redeem.witness))
         throw new TypeError("Redeem.witness and witness mismatch");
     }
     if (u && u.length)
@@ -7769,7 +7769,7 @@ function hc(e, t) {
           throw new TypeError("Internal pubkey mismatch");
         if (!$f().isXOnlyPoint(d))
           throw new TypeError("Invalid internalPubkey for p2tr witness");
-        const y = f[0] & Zc, g = u[u.length - 2], m = Tr({ output: g, version: y }), E = Df(f, m), _ = Pc(d, E);
+        const y = f[0] & Zc, g = u[u.length - 2], m = Tr({ output: g, version: y }), E = Df(f, m), _ = Rc(d, E);
         if (!_)
           throw new TypeError("Invalid outputKey for p2tr witness");
         if (c.length && de(c, _.x) !== 0)
@@ -7793,7 +7793,7 @@ function FE(e, t) {
   return console.warn(Ig), ME(n, r, t.bech32);
 }
 function Og(e) {
-  const t = Bo.decode(e);
+  const t = No.decode(e);
   if (t.length < 21) throw new TypeError(e + " is too short");
   if (t.length > 21) throw new TypeError(e + " is too long");
   const n = Br(t, 0), r = t.slice(1);
@@ -7822,11 +7822,11 @@ function ME(e, t, n) {
 function qE(e, t) {
   t = t || Un;
   try {
-    return ac({ output: e, network: t }).address;
+    return uc({ output: e, network: t }).address;
   } catch {
   }
   try {
-    return uc({ output: e, network: t }).address;
+    return fc({ output: e, network: t }).address;
   } catch {
   }
   try {
@@ -7834,11 +7834,11 @@ function qE(e, t) {
   } catch {
   }
   try {
-    return lc({ output: e, network: t }).address;
+    return hc({ output: e, network: t }).address;
   } catch {
   }
   try {
-    return hc({ output: e, network: t }).address;
+    return dc({ output: e, network: t }).address;
   } catch {
   }
   try {
@@ -7856,9 +7856,9 @@ function Bg(e, t) {
   }
   if (n) {
     if (n.version === t.pubKeyHash)
-      return ac({ hash: n.hash }).output;
-    if (n.version === t.scriptHash)
       return uc({ hash: n.hash }).output;
+    if (n.version === t.scriptHash)
+      return fc({ hash: n.hash }).output;
   } else {
     try {
       r = Ul(e);
@@ -7871,10 +7871,10 @@ function Bg(e, t) {
         if (r.data.length === 20)
           return Ja({ hash: r.data }).output;
         if (r.data.length === 32)
-          return lc({ hash: r.data }).output;
+          return hc({ hash: r.data }).output;
       } else if (r.version === 1) {
         if (r.data.length === 32)
-          return hc({ pubkey: r.data }).output;
+          return dc({ pubkey: r.data }).output;
       } else if (r.version >= Ag && r.version <= xg && r.data.length >= Tg && r.data.length <= Sg)
         return console.warn(Ig), nn([
           r.version + vg,
@@ -8199,7 +8199,7 @@ function KE(e) {
     path: "m"
   };
   for (const r of jE(e.value.length / 4 - 1)) {
-    const i = Vs(e.value, r * 4 + 4, "LE"), s = !!(i & 2147483648), o = i & 2147483647;
+    const i = $s(e.value, r * 4 + 4, "LE"), s = !!(i & 2147483648), o = i & 2147483647;
     n.path += "/" + o.toString(10) + (s ? "'" : "");
   }
   return n;
@@ -8211,7 +8211,7 @@ function GE(e) {
   return r.slice(1).forEach((o) => {
     const c = o.slice(-1) === "'";
     let a = 2147483647 & parseInt(c ? o.slice(0, -1) : o, 10);
-    c && (a += 2147483648), sc(i, s, a, "LE"), s += 4;
+    c && (a += 2147483648), oc(i, s, a, "LE"), s += 4;
   }), {
     key: n,
     value: i
@@ -8405,11 +8405,11 @@ function N2(e) {
     throw new Error(
       "Decode Error: could not decode sighashType with key 0x" + xe(e.key)
     );
-  return Number(Vs(e.value, 0, "LE"));
+  return Number($s(e.value, 0, "LE"));
 }
 function k2(e) {
   const t = Uint8Array.from([me.SIGHASH_TYPE]), n = new Uint8Array(4);
-  return sc(n, 0, e, "LE"), {
+  return oc(n, 0, e, "LE"), {
     key: t,
     value: n
   };
@@ -8577,7 +8577,7 @@ function i_(e) {
     );
   const t = Xy(e.value, 0, "LE");
   let n = 8;
-  const { numberValue: r, bytes: i } = Ds(
+  const { numberValue: r, bytes: i } = js(
     e.value,
     n
   );
@@ -8620,7 +8620,7 @@ function f_(e) {
   let t = 0;
   const n = [];
   for (; t < e.value.length; ) {
-    const r = e.value[t++], i = e.value[t++], { numberValue: s, bytes: o } = Ds(
+    const r = e.value[t++], i = e.value[t++], { numberValue: s, bytes: o } = js(
       e.value,
       t
     );
@@ -8683,7 +8683,7 @@ function Cl(e, t = m_) {
       path: "m"
     };
     for (const f of g_(c.value.length / 4 - 1)) {
-      const l = Vs(c.value, f * 4 + 4, "LE"), d = !!(l & 2147483648), y = l & 2147483647;
+      const l = $s(c.value, f * 4 + 4, "LE"), d = !!(l & 2147483648), y = l & 2147483647;
       u.path += "/" + y.toString(10) + (d ? "'" : "");
     }
     return u;
@@ -8695,7 +8695,7 @@ function Cl(e, t = m_) {
     return f.slice(1).forEach((y) => {
       const g = y.slice(-1) === "'";
       let m = 2147483647 & parseInt(g ? y.slice(0, -1) : y, 10);
-      g && (m += 2147483648), sc(l, d, m, "LE"), d += 4;
+      g && (m += 2147483648), oc(l, d, m, "LE"), d += 4;
     }), {
       key: u,
       value: l
@@ -8761,7 +8761,7 @@ const w_ = (e) => e.length === 32;
 function Rg(e) {
   const t = Cl(e, w_);
   function n(o) {
-    const { numberValue: c, bytes: a } = Ds(
+    const { numberValue: c, bytes: a } = js(
       o.value
     ), u = t.decode({
       key: o.key,
@@ -8905,13 +8905,13 @@ function E_(e) {
 function __(e, t) {
   let n = 0;
   function r() {
-    const { numberValue: E, bytes: _ } = Ds(e, n);
+    const { numberValue: E, bytes: _ } = js(e, n);
     n += _;
     const S = e.slice(n, n + Number(E));
     return n += Number(E), S;
   }
   function i() {
-    const E = Vs(e, n, "BE");
+    const E = $s(e, n, "BE");
     return n += 4, E;
   }
   function s() {
@@ -9222,7 +9222,7 @@ function Ut(e, t) {
   if (n === void 0) throw new Error(`No input #${t}`);
   return n;
 }
-function No(e, t) {
+function ko(e, t) {
   const n = e[t];
   if (n === void 0) throw new Error(`No output #${t}`);
   return n;
@@ -9288,7 +9288,7 @@ function I_(e, t) {
   Fg(t, r);
 }
 function O_(e, t) {
-  const n = e.length - 1, r = No(e, n);
+  const n = e.length - 1, r = ko(e, n);
   Mg(t, r);
 }
 let Ud = class {
@@ -9328,7 +9328,7 @@ let Ud = class {
     return Fg(n, r), this;
   }
   updateOutput(t, n) {
-    const r = No(this.outputs, t);
+    const r = ko(this.outputs, t);
     return Mg(n, r), this;
   }
   addUnknownKeyValToGlobal(t) {
@@ -9343,7 +9343,7 @@ let Ud = class {
     return Ku(n, r.unknownKeyVals, Gu(me)), r.unknownKeyVals || (r.unknownKeyVals = []), r.unknownKeyVals.push(n), this;
   }
   addUnknownKeyValToOutput(t, n) {
-    const r = No(this.outputs, t);
+    const r = ko(this.outputs, t);
     return Ku(n, r.unknownKeyVals, Gu(yt)), r.unknownKeyVals || (r.unknownKeyVals = []), r.unknownKeyVals.push(n), this;
   }
   addInput(t) {
@@ -9398,7 +9398,7 @@ function Qi(e) {
     }
   };
 }
-const B_ = Qi(za), N_ = Qi(ag), k_ = Qi(ac), Qa = Qi(Ja), Cd = Qi(lc), qg = Qi(uc), Lg = Qi(hc);
+const B_ = Qi(za), N_ = Qi(ag), k_ = Qi(uc), Qa = Qi(Ja), Cd = Qi(hc), qg = Qi(fc), Lg = Qi(dc);
 function ba(e) {
   let t = new Uint8Array(0);
   function n(o) {
@@ -9426,7 +9426,7 @@ function eu(e, t) {
 }
 function P_(e, t) {
   return R_(e).some(
-    (r) => $g(r, To.decode, t)
+    (r) => $g(r, xo.decode, t)
   );
 }
 function $g(e, t, n) {
@@ -9468,7 +9468,7 @@ function Hd(e, t, n) {
     throw new Error(`Can not finalize taproot input #${e}: ${i}`);
   }
 }
-function Rc(e, t) {
+function Uc(e, t) {
   const n = t ? Uint8Array.from([t]) : Uint8Array.from([]);
   return ut([e, n]);
 }
@@ -9494,7 +9494,7 @@ function C_(e, t) {
   }
 }
 function H_(e, t) {
-  const n = t && F_(t.leaves), { output: r } = hc({
+  const n = t && F_(t.leaves), { output: r } = dc({
     internalPubkey: e,
     scriptTree: n
   });
@@ -9550,14 +9550,14 @@ function Wf(e, t, n = 0) {
   if (i) return [t && t[0], i];
 }
 function D_(e, t, n) {
-  const r = Ln(e) && Ss(t), i = Ss(e) && Ln(t), s = e === t && Ln(t) && Ss(t);
+  const r = Ln(e) && Ts(t), i = Ts(e) && Ln(t), s = e === t && Ln(t) && Ts(t);
   if (r || i || s)
     throw new Error(
       `Invalid arguments for Psbt.${n}. Cannot use both taproot and non-taproot fields.`
     );
 }
 function j_(e, t, n) {
-  const r = Wu(e) && Ss(t), i = Ss(e) && Wu(t), s = e === t && Wu(t) && Ss(t);
+  const r = Wu(e) && Ts(t), i = Ts(e) && Wu(t), s = e === t && Wu(t) && Ts(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 z_(e, t, n) {
   });
   return (!n || de(r, n) === 0) && t.find((s) => de(s.leafHash, r) === 0) !== void 0;
 }
-function Ss(e) {
+function Ts(e) {
   return e && !!(e.redeemScript || e.witnessScript || e.bip32Derivation && e.bip32Derivation.length);
 }
 const Y_ = {
@@ -9724,20 +9724,20 @@ class Ea {
     return t.opts = JSON.parse(JSON.stringify(this.opts)), t;
   }
   setMaximumFeeRate(t) {
-    Uc(t), this.opts.maximumFeeRate = t;
+    Cc(t), this.opts.maximumFeeRate = t;
   }
   setVersion(t) {
-    Uc(t), to(this.data.inputs, "setVersion");
+    Cc(t), no(this.data.inputs, "setVersion");
     const n = this.__CACHE;
     return n.__TX.version = t, n.__EXTRACTED_TX = void 0, this;
   }
   setLocktime(t) {
-    Uc(t), to(this.data.inputs, "setLocktime");
+    Cc(t), no(this.data.inputs, "setLocktime");
     const n = this.__CACHE;
     return n.__TX.locktime = t, n.__EXTRACTED_TX = void 0, this;
   }
   setInputSequence(t, n) {
-    Uc(n), to(this.data.inputs, "setInputSequence");
+    Cc(n), no(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 Ea {
       throw new Error(
         "Invalid arguments for Psbt.addInput. Requires single object with at least [hash] and [index]"
       );
-    Fd(t, t, "addInput"), to(this.data.inputs, "addInput"), t.witnessScript && _a(t.witnessScript);
+    Fd(t, t, "addInput"), no(this.data.inputs, "addInput"), t.witnessScript && _a(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 Ea {
       throw new Error(
         "Invalid arguments for Psbt.addOutput. Requires single object with at least [script or address] and [value]"
       );
-    to(this.data.inputs, "addOutput");
+    no(this.data.inputs, "addOutput");
     const { address: n } = t;
     if (typeof n == "string") {
       const { network: i } = this.opts, s = Bg(n, i);
@@ -9796,7 +9796,7 @@ class Ea {
     return Dd("__FEE", "fee", this.data.inputs, this.__CACHE);
   }
   finalizeAllInputs() {
-    return Ut(this.data.inputs, 0), no(this.data.inputs.length).forEach((t) => this.finalizeInput(t)), this;
+    return Ut(this.data.inputs, 0), ro(this.data.inputs.length).forEach((t) => this.finalizeInput(t)), this;
   }
   finalizeInput(t, n) {
     const r = Ut(this.data.inputs, t);
@@ -9844,7 +9844,7 @@ class Ea {
         `Cannot finalize input #${t}. Missing withness utxo.`
       );
     if (n.tapKeySig) {
-      const s = hc({
+      const s = dc({
         output: n.witnessUtxo.script,
         signature: n.tapKeySig
       }), o = ba(s.witness);
@@ -9878,15 +9878,15 @@ class Ea {
     return !!r.bip32Derivation && r.bip32Derivation.some(i);
   }
   outputHasPubkey(t, n) {
-    const r = No(this.data.outputs, t);
+    const r = ko(this.data.outputs, t);
     return lS(n, r, t, this.__CACHE);
   }
   outputHasHDKey(t, n) {
-    const r = No(this.data.outputs, t), i = Ld(n);
+    const r = ko(this.data.outputs, t), i = Ld(n);
     return !!r.bip32Derivation && r.bip32Derivation.some(i);
   }
   validateSignaturesOfAllInputs(t) {
-    return Ut(this.data.inputs, 0), no(this.data.inputs.length).map(
+    return Ut(this.data.inputs, 0), ro(this.data.inputs.length).map(
       (r) => this.validateSignaturesOfInput(r, t)
     ).reduce((r, i) => i === !0 && r, !0);
   }
@@ -9909,7 +9909,7 @@ class Ea {
     const c = [];
     let a, u, f;
     for (const l of o) {
-      const d = To.decode(l.signature), { hash: y, script: g } = f !== d.hashType ? Xg(
+      const d = xo.decode(l.signature), { hash: y, script: g } = f !== d.hashType ? Xg(
         t,
         Object.assign({}, i, { sighashType: d.hashType }),
         this.__CACHE,
@@ -9969,7 +9969,7 @@ class Ea {
     if (!t || !t.publicKey || !t.fingerprint)
       throw new Error("Need HDSigner to sign input");
     const r = [];
-    for (const i of no(this.data.inputs.length))
+    for (const i of ro(this.data.inputs.length))
       try {
         this.signInputHD(i, t, n), r.push(!0);
       } catch {
@@ -9984,7 +9984,7 @@ class Ea {
       if (!t || !t.publicKey || !t.fingerprint)
         return i(new Error("Need HDSigner to sign input"));
       const s = [], o = [];
-      for (const c of no(this.data.inputs.length))
+      for (const c of ro(this.data.inputs.length))
         o.push(
           this.signInputHDAsync(c, t, n).then(
             () => {
@@ -10023,7 +10023,7 @@ class Ea {
     if (!t || !t.publicKey)
       throw new Error("Need Signer to sign input");
     const r = [];
-    for (const i of no(this.data.inputs.length))
+    for (const i of ro(this.data.inputs.length))
       try {
         this.signInput(i, t, n), r.push(!0);
       } catch {
@@ -10092,7 +10092,7 @@ class Ea {
     ), o = [
       {
         pubkey: n.publicKey,
-        signature: To.encode(n.sign(i), s)
+        signature: xo.encode(n.sign(i), s)
       }
     ];
     return this.data.updateInput(t, { partialSig: o }), this;
@@ -10105,13 +10105,13 @@ class Ea {
       i,
       s
     ), c = o.filter((u) => !u.leafHash).map(
-      (u) => Rc(
+      (u) => Uc(
         r.signSchnorr(u.hash),
         n.sighashType
       )
     )[0], a = o.filter((u) => !!u.leafHash).map((u) => ({
       pubkey: Jc(r.publicKey),
-      signature: Rc(
+      signature: Uc(
         r.signSchnorr(u.hash),
         n.sighashType
       ),
@@ -10161,7 +10161,7 @@ class Ea {
       const c = [
         {
           pubkey: n.publicKey,
-          signature: To.encode(o, s)
+          signature: xo.encode(o, s)
         }
       ];
       this.data.updateInput(t, { partialSig: c });
@@ -10178,7 +10178,7 @@ class Ea {
     if (a) {
       const f = Promise.resolve(
         r.signSchnorr(a.hash)
-      ).then((l) => ({ tapKeySig: Rc(l, n.sighashType) }));
+      ).then((l) => ({ tapKeySig: Uc(l, n.sighashType) }));
       c.push(f);
     }
     const u = o.filter((f) => !!f.leafHash);
@@ -10187,7 +10187,7 @@ class Ea {
         (d) => ({ tapScriptSig: [
           {
             pubkey: Jc(r.publicKey),
-            signature: Rc(
+            signature: Uc(
               d,
               n.sighashType
             ),
@@ -10325,7 +10325,7 @@ function jg(e) {
 function Ld(e) {
   return (t) => !(de(e.fingerprint, t.masterFingerprint) || de(e.derivePath(t.path).publicKey, t.pubkey));
 }
-function Uc(e) {
+function Cc(e) {
   if (typeof e != "number" || e !== Math.floor(e) || e > 4294967295 || e < 0)
     throw new Error("Invalid 32 bit integer");
 }
@@ -10336,7 +10336,7 @@ function Q_(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 to(e, t) {
+function no(e, t) {
   e.forEach((n) => {
     if (Ln(n) ? M_(n, t) : P_(n, t))
       throw new Error("Can not modify transaction, signatures exist.");
@@ -10346,7 +10346,7 @@ function eS(e) {
   if (!e.sighashType || !e.partialSig) return;
   const { partialSig: t, sighashType: n } = e;
   t.forEach((r) => {
-    const { hashType: i } = To.decode(r.signature);
+    const { hashType: i } = xo.decode(r.signature);
     if (n !== i)
       throw new Error("Signature sighash does not match input sighash type");
   });
@@ -10384,8 +10384,8 @@ function Wg(e, t) {
       );
   };
 }
-const Vd = Wg(uc, "Redeem script"), $d = Wg(
-  lc,
+const Vd = Wg(fc, "Redeem script"), $d = Wg(
+  hc,
   "Witness script"
 );
 function Dd(e, t, n, r) {
@@ -10412,7 +10412,7 @@ function rS(e, t, n, r, i, s) {
 }
 function iS(e, t, n, r, i, s) {
   let o, c;
-  const a = oS(e, t, n), u = s ? lc({ redeem: a }) : null, f = i ? uc({ redeem: u || a }) : null;
+  const a = oS(e, t, n), u = s ? hc({ redeem: a }) : null, f = i ? fc({ redeem: u || a }) : null;
   return r ? (u ? c = ba(u.witness) : c = ba(a.witness), f && (o = f.input)) : f ? o = f.input : o = a.input, {
     finalScriptSig: o,
     finalScriptWitness: c
@@ -10466,7 +10466,7 @@ function Xg(e, t, n, r, i) {
       o
     );
   else if (Qa(u)) {
-    const l = ac({
+    const l = uc({
       hash: u.slice(2)
     }).output;
     c = s.hashForWitnessV0(
@@ -10585,7 +10585,7 @@ function oS(e, t, n) {
       });
       break;
     case "pubkeyhash":
-      r = ac({
+      r = uc({
         output: e,
         pubkey: n[0].pubkey,
         signature: n[0].signature
@@ -10650,7 +10650,7 @@ function Zg(e) {
     return t += o, e.slice(t - o, t);
   }
   function r() {
-    const o = Ds(e, t);
+    const o = js(e, t);
     return t += kn(o.bigintValue), o.numberValue;
   }
   function i() {
@@ -10809,18 +10809,18 @@ function _a(e) {
 function tm(e) {
   return Qa(e) ? "witnesspubkeyhash" : k_(e) ? "pubkeyhash" : B_(e) ? "multisig" : N_(e) ? "pubkey" : "nonstandard";
 }
-function no(e) {
+function ro(e) {
   return [...Array(e).keys()];
 }
 wE(Z1);
-const ko = {
+const Po = {
   Mainnet: "mainnet",
   Testnet: "testnet"
-}, Sa = "abcdefghijklmnopqrstuvwxyz234567", Rs = /* @__PURE__ */ Object.create(null);
+}, Sa = "abcdefghijklmnopqrstuvwxyz234567", Us = /* @__PURE__ */ Object.create(null);
 for (let e = 0; e < Sa.length; e++)
-  Rs[Sa[e]] = e;
-Rs[0] = Rs.o;
-Rs[1] = Rs.i;
+  Us[Sa[e]] = e;
+Us[0] = Us.o;
+Us[1] = Us.i;
 function gS(e) {
   let t = 0, n = 0, r = "";
   function i(s) {
@@ -10835,7 +10835,7 @@ function mS(e) {
   const r = new Uint8Array(e.length * 4 / 3 | 0);
   let i = 0;
   function s(o) {
-    let c = Rs[o.toLowerCase()];
+    let c = Us[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);
@@ -11110,8 +11110,8 @@ function bS(e) {
   }
   return (t ^ -1) >>> 0;
 }
-const Cc = "__principal__", ES = 2, Wd = 4, _S = "aaaaa-aa";
-let Ke = class gs {
+const Hc = "__principal__", ES = 2, Wd = 4, _S = "aaaaa-aa";
+let Ke = class ms {
   static anonymous() {
     return new this(new Uint8Array([Wd]));
   }
@@ -11128,21 +11128,21 @@ let Ke = class gs {
   }
   static from(t) {
     if (typeof t == "string")
-      return gs.fromText(t);
+      return ms.fromText(t);
     if (Object.getPrototypeOf(t) === Uint8Array.prototype)
-      return new gs(t);
-    if (gs.isPrincipal(t))
-      return new gs(t._arr);
+      return new ms(t);
+    if (ms.isPrincipal(t))
+      return new ms(t._arr);
     throw new Error(`Impossible to convert ${JSON.stringify(t)} to Principal.`);
   }
   static fromHex(t) {
-    return new this(cc(t));
+    return new this(ac(t));
   }
   static fromText(t) {
     let n = t;
-    if (t.includes(Cc)) {
+    if (t.includes(Hc)) {
       const o = JSON.parse(t);
-      Cc in o && (n = o[Cc]);
+      Hc in o && (n = o[Hc]);
     }
     const r = n.toLowerCase().replace(/-/g, "");
     let i = mS(r);
@@ -11156,7 +11156,7 @@ let Ke = class gs {
     return new this(t);
   }
   static isPrincipal(t) {
-    return t instanceof gs || typeof t == "object" && t !== null && "_isPrincipal" in t && t._isPrincipal === !0 && "_arr" in t && t._arr instanceof Uint8Array;
+    return t instanceof ms || typeof t == "object" && t !== null && "_isPrincipal" in t && t._isPrincipal === !0 && "_arr" in t && t._arr instanceof Uint8Array;
   }
   constructor(t) {
     this._arr = t, this._isPrincipal = !0;
@@ -11186,7 +11186,7 @@ let Ke = class gs {
    * @returns {JsonnablePrincipal} a JSON object with a single key, {@link JSON_KEY_PRINCIPAL}, whose value is the principal as a string
    */
   toJSON() {
-    return { [Cc]: this.toText() };
+    return { [Hc]: this.toText() };
   }
   /**
    * Utility method taking a Principal to compare against. Used for determining canister ranges in certificate verification
@@ -11228,7 +11228,7 @@ function Ve(...e) {
     t.set(r, n), n += r.byteLength;
   return t;
 }
-class js {
+class Ks {
   /**
    * Save a checkpoint of the reading view (for backtracking)
    */
@@ -11367,7 +11367,7 @@ function Gi(e) {
 function lt(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 : rm(e)) + 1, n = new js(new Uint8Array(t), 0);
+  const t = (e === BigInt(0) ? 0 : rm(e)) + 1, n = new Ks(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 : rm(e)) + 1, r = new js(new Uint8Array(n), 0);
+  const n = (e === BigInt(0) ? 0 : rm(e)) + 1, r = new Ks(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 AS(e, t) {
 }
 function sm(e, t) {
   e = BigInt(e);
-  const n = new js(new Uint8Array(Math.min(1, t)), 0);
+  const n = new Ks(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);
@@ -11455,7 +11455,7 @@ var Le;
   e[e.Null = -1] = "Null", e[e.Bool = -2] = "Bool", e[e.Nat = -3] = "Nat", e[e.Int = -4] = "Int", e[e.Float32 = -13] = "Float32", e[e.Float64 = -14] = "Float64", e[e.Text = -15] = "Text", e[e.Reserved = -16] = "Reserved", e[e.Empty = -17] = "Empty", e[e.Opt = -18] = "Opt", e[e.Vector = -19] = "Vector", e[e.Record = -20] = "Record", e[e.Variant = -21] = "Variant", e[e.Func = -22] = "Func", e[e.Service = -23] = "Service", e[e.Principal = -24] = "Principal";
 })(Le || (Le = {}));
 const Qc = "DIDL", Xd = 400;
-function Po(e, t, n) {
+function Ro(e, t, n) {
   return e.map((r, i) => n(r, t[i]));
 }
 class IS {
@@ -11719,7 +11719,7 @@ class am extends Cn {
     return "bool";
   }
 }
-class Ro extends Cn {
+class Uo extends Cn {
   get typeName() {
     return Be.NullClass;
   }
@@ -11993,7 +11993,7 @@ class ui extends Cn {
     return t.toString();
   }
 }
-class Us extends yi {
+class Cs extends yi {
   get typeName() {
     return Be.VecClass;
   }
@@ -12042,7 +12042,7 @@ index ${i} -> ${s.message}`);
         return Ve(n, new Uint8Array(i.buffer));
       } else
         return Ve(n, new Uint8Array(t.buffer, t.byteOffset, t.byteLength));
-    const r = new js(new Uint8Array(n.byteLength + t.length), 0);
+    const r = new Ks(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 Us))
+    if (!(r instanceof Cs))
       throw new Error("Not a vector type");
     const i = Number(Nt(t));
     if (this._type instanceof ui) {
@@ -12144,7 +12144,7 @@ class kr extends yi {
     t.add(this, Ve(n, r));
   }
   decodeValue(t, n) {
-    if (n instanceof Ro)
+    if (n instanceof Uo)
       return [];
     if (n instanceof di)
       return [];
@@ -12173,7 +12173,7 @@ class kr extends yi {
     else {
       if (
         // this check corresponds to `not (null <: <t>)` in the spec
-        this._type instanceof Ro || this._type instanceof kr || this._type instanceof di
+        this._type instanceof Uo || this._type instanceof kr || this._type instanceof di
       )
         return r.decodeValue(t, r), [];
       {
@@ -12235,7 +12235,7 @@ field ${n} -> ${i.message}`);
     throw new Error(`Invalid ${this.display()} argument: ${bt(t)}`);
   }
   encodeValue(t) {
-    const n = this._fields.map(([i]) => t[i]), r = Po(this._fields, n, ([, i], s) => i.encodeValue(s));
+    const n = this._fields.map(([i]) => t[i]), r = Ro(this._fields, n, ([, i], s) => i.encodeValue(s));
     return Ve(...r);
   }
   _buildTypeTableImpl(t) {
@@ -12287,7 +12287,7 @@ field ${n} -> ${i.message}`);
   }
   valueToString(t) {
     const n = this._fields.map(([i]) => t[i]);
-    return `record {${Po(this._fields, n, ([i, s], o) => i + "=" + s.valueToString(o)).join("; ")}}`;
+    return `record {${Ro(this._fields, n, ([i, s], o) => i + "=" + s.valueToString(o)).join("; ")}}`;
   }
 }
 class iu extends Xi {
@@ -12318,7 +12318,7 @@ index ${r} -> ${i.message}`);
     throw new Error(`Invalid ${this.display()} argument: ${bt(t)}`);
   }
   encodeValue(t) {
-    const n = Po(this._components, t, (r, i) => r.encodeValue(i));
+    const n = Ro(this._components, t, (r, i) => r.encodeValue(i));
     return Ve(...n);
   }
   decodeValue(t, n) {
@@ -12336,10 +12336,10 @@ index ${r} -> ${i.message}`);
     return `record {${this._components.map((n) => n.display()).join("; ")}}`;
   }
   valueToString(t) {
-    return `record {${Po(this._components, t, (r, i) => r.valueToString(i)).join("; ")}}`;
+    return `record {${Ro(this._components, t, (r, i) => r.valueToString(i)).join("; ")}}`;
   }
 }
-class Cs extends yi {
+class Hs extends yi {
   get typeName() {
     return Be.VariantClass;
   }
@@ -12384,7 +12384,7 @@ variant ${n} -> ${i.message}`);
   }
   decodeValue(t, n) {
     const r = this.checkType(n);
-    if (!(r instanceof Cs))
+    if (!(r instanceof Hs))
       throw new Error("Not a variant type");
     const i = Number(Nt(t));
     if (i >= r._fields.length)
@@ -12513,7 +12513,7 @@ class fm extends Cn {
     return `${this.name} "${t.toText()}"`;
   }
 }
-class Uo extends yi {
+class Co extends yi {
   get typeName() {
     return Be.FuncClass;
   }
@@ -12633,7 +12633,7 @@ function Zf(e, t) {
     throw Error("Wrong number of message arguments");
   const n = new IS();
   e.forEach((a) => a.buildTypeTable(n));
-  const r = new TextEncoder().encode(Qc), i = n.encode(), s = lt(t.length), o = Ve(...e.map((a) => a.encodeType(n))), c = Ve(...Po(e, t, (a, u) => {
+  const r = new TextEncoder().encode(Qc), i = n.encode(), s = lt(t.length), o = Ve(...e.map((a) => a.encodeType(n))), c = Ve(...Ro(e, t, (a, u) => {
     try {
       a.covariant(u);
     } catch (f) {
@@ -12646,7 +12646,7 @@ function Zf(e, t) {
   return Ve(r, i, s, o, c);
 }
 function lm(e, t) {
-  const n = new js(t);
+  const n = new Ks(t);
   if (t.byteLength < Qc.length)
     throw new Error("Message length smaller than magic number");
   const r = Ki(n, Qc.length), i = new TextDecoder().decode(r);
@@ -12817,7 +12817,7 @@ function lm(e, t) {
         const y = {}, g = d[1];
         for (const [m, E] of g) {
           let _ = u(E);
-          if (_ instanceof Pn && (_ = _.getType()), !(_ instanceof Uo))
+          if (_ instanceof Pn && (_ = _.getType()), !(_ instanceof Co))
             throw new Error("Illegal service definition: services can only contain functions");
           y[m] = _;
         }
@@ -12850,12 +12850,12 @@ function lm(e, t) {
     Jf();
   }
 }
-const hm = new Ll(), dm = new di(), BS = new cm(), pm = new am(), ym = new Ro(), gm = new um(), mm = new Vl(), wm = new $l(), bm = new Dl(32), Em = new Dl(64), _m = new Wi(8), Sm = new Wi(16), Tm = new Wi(32), xm = new Wi(64), Am = new ui(8), vm = new ui(16), Im = new ui(32), Om = new ui(64), Bm = new fm();
+const hm = new Ll(), dm = new di(), BS = new cm(), pm = new am(), ym = new Uo(), gm = new um(), mm = new Vl(), wm = new $l(), bm = new Dl(32), Em = new Dl(64), _m = new Wi(8), Sm = new Wi(16), Tm = new Wi(32), xm = new Wi(64), Am = new ui(8), vm = new ui(16), Im = new ui(32), Om = new ui(64), Bm = new fm();
 function Nm(...e) {
   return new iu(e);
 }
 function km(e) {
-  return new Us(e);
+  return new Cs(e);
 }
 function Pm(e) {
   return new kr(e);
@@ -12864,13 +12864,13 @@ function Rm(e) {
   return new Xi(e);
 }
 function Um(e) {
-  return new Cs(e);
+  return new Hs(e);
 }
 function Cm() {
   return new Pn();
 }
 function Hm(e, t, n = []) {
-  return new Uo(e, t, n);
+  return new Co(e, t, n);
 }
 function Fm(e) {
   return new Ta(e);
@@ -12929,7 +12929,7 @@ function NS(e, t) {
   return !0;
 }
 function Yu(e) {
-  return e instanceof kr || e instanceof Ro || e instanceof di;
+  return e instanceof kr || e instanceof Uo || e instanceof di;
 }
 function Kl(e, t) {
   const n = ea.copy(), r = gr(n, e, t);
@@ -12943,7 +12943,7 @@ function gr(e, t, n) {
     return r;
   if (e.add(t, n), n instanceof di || t instanceof Ll || t instanceof $l && n instanceof Vl)
     return !0;
-  if (t instanceof Us && n instanceof Us)
+  if (t instanceof Cs && n instanceof Cs)
     return gr(e, t._type, n._type);
   if (n instanceof kr)
     return !0;
@@ -12959,7 +12959,7 @@ function gr(e, t, n) {
     }
     return !0;
   }
-  if (t instanceof Uo && n instanceof Uo) {
+  if (t instanceof Co && n instanceof Co) {
     if (!NS(t, n))
       return !1;
     for (let i = 0; i < t.argTypes.length; i++) {
@@ -12980,7 +12980,7 @@ function gr(e, t, n) {
     }
     return !0;
   }
-  if (t instanceof Cs && n instanceof Cs) {
+  if (t instanceof Hs && n instanceof Hs) {
     const i = n.alternativesAsObject;
     for (const [s, o] of t._fields) {
       const c = i[an(s)];
@@ -13013,7 +13013,7 @@ const kS = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   Float64: Em,
   FloatClass: Dl,
   Func: Hm,
-  FuncClass: Uo,
+  FuncClass: Co,
   Int: mm,
   Int16: Sm,
   Int32: Tm,
@@ -13027,7 +13027,7 @@ const kS = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   Nat8: Am,
   NatClass: $l,
   Null: ym,
-  NullClass: Ro,
+  NullClass: Uo,
   Opt: Pm,
   OptClass: kr,
   PrimitiveType: Cn,
@@ -13049,9 +13049,9 @@ const kS = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   Unknown: BS,
   UnknownClass: cm,
   Variant: Um,
-  VariantClass: Cs,
+  VariantClass: Hs,
   Vec: km,
-  VecClass: Us,
+  VecClass: Cs,
   Visitor: OS,
   decode: lm,
   encode: Zf,
@@ -13066,42 +13066,42 @@ function Mm(e, t) {
 const { toString: PS } = Object.prototype, { getPrototypeOf: Gl } = Object, { iterator: ou, toStringTag: qm } = Symbol, cu = /* @__PURE__ */ ((e) => (t) => {
   const n = PS.call(t);
   return e[n] || (e[n] = n.slice(8, -1).toLowerCase());
-})(/* @__PURE__ */ Object.create(null)), zn = (e) => (e = e.toLowerCase(), (t) => cu(t) === e), au = (e) => (t) => typeof t === e, { isArray: Ks } = Array, Co = au("undefined");
-function dc(e) {
-  return e !== null && !Co(e) && e.constructor !== null && !Co(e.constructor) && pn(e.constructor.isBuffer) && e.constructor.isBuffer(e);
+})(/* @__PURE__ */ Object.create(null)), zn = (e) => (e = e.toLowerCase(), (t) => cu(t) === e), au = (e) => (t) => typeof t === e, { isArray: Gs } = Array, Ho = au("undefined");
+function pc(e) {
+  return e !== null && !Ho(e) && e.constructor !== null && !Ho(e.constructor) && pn(e.constructor.isBuffer) && e.constructor.isBuffer(e);
 }
 const Lm = zn("ArrayBuffer");
 function RS(e) {
   let t;
   return typeof ArrayBuffer < "u" && ArrayBuffer.isView ? t = ArrayBuffer.isView(e) : t = e && e.buffer && Lm(e.buffer), t;
 }
-const US = au("string"), pn = au("function"), Vm = au("number"), pc = (e) => e !== null && typeof e == "object", CS = (e) => e === !0 || e === !1, ta = (e) => {
+const US = au("string"), pn = au("function"), Vm = au("number"), yc = (e) => e !== null && typeof e == "object", CS = (e) => e === !0 || e === !1, ta = (e) => {
   if (cu(e) !== "object")
     return !1;
   const t = Gl(e);
   return (t === null || t === Object.prototype || Object.getPrototypeOf(t) === null) && !(qm in e) && !(ou in e);
 }, HS = (e) => {
-  if (!pc(e) || dc(e))
+  if (!yc(e) || pc(e))
     return !1;
   try {
     return Object.keys(e).length === 0 && Object.getPrototypeOf(e) === Object.prototype;
   } catch {
     return !1;
   }
-}, FS = zn("Date"), MS = zn("File"), qS = zn("Blob"), LS = zn("FileList"), VS = (e) => pc(e) && pn(e.pipe), $S = (e) => {
+}, FS = zn("Date"), MS = zn("File"), qS = zn("Blob"), LS = zn("FileList"), VS = (e) => yc(e) && pn(e.pipe), $S = (e) => {
   let t;
   return e && (typeof FormData == "function" && e instanceof FormData || pn(e.append) && ((t = cu(e)) === "formdata" || // detect form-data instance
   t === "object" && pn(e.toString) && e.toString() === "[object FormData]"));
 }, DS = zn("URLSearchParams"), [jS, KS, GS, WS] = ["ReadableStream", "Request", "Response", "Headers"].map(zn), XS = (e) => e.trim ? e.trim() : e.replace(/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g, "");
-function yc(e, t, { allOwnKeys: n = !1 } = {}) {
+function gc(e, t, { allOwnKeys: n = !1 } = {}) {
   if (e === null || typeof e > "u")
     return;
   let r, i;
-  if (typeof e != "object" && (e = [e]), Ks(e))
+  if (typeof e != "object" && (e = [e]), Gs(e))
     for (r = 0, i = e.length; r < i; r++)
       t.call(null, e[r], r, e);
   else {
-    if (dc(e))
+    if (pc(e))
       return;
     const s = n ? Object.getOwnPropertyNames(e) : Object.keys(e), o = s.length;
     let c;
@@ -13110,7 +13110,7 @@ function yc(e, t, { allOwnKeys: n = !1 } = {}) {
   }
 }
 function $m(e, t) {
-  if (dc(e))
+  if (pc(e))
     return null;
   t = t.toLowerCase();
   const n = Object.keys(e);
@@ -13120,17 +13120,17 @@ function $m(e, t) {
       return i;
   return null;
 }
-const Ci = typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typeof window < "u" ? window : globalThis, Dm = (e) => !Co(e) && e !== Ci;
+const Ci = typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typeof window < "u" ? window : globalThis, Dm = (e) => !Ho(e) && e !== Ci;
 function Qf() {
   const { caseless: e } = Dm(this) && this || {}, t = {}, n = (r, i) => {
     const s = e && $m(t, i) || i;
-    ta(t[s]) && ta(r) ? t[s] = Qf(t[s], r) : ta(r) ? t[s] = Qf({}, r) : Ks(r) ? t[s] = r.slice() : t[s] = r;
+    ta(t[s]) && ta(r) ? t[s] = Qf(t[s], r) : ta(r) ? t[s] = Qf({}, r) : Gs(r) ? t[s] = r.slice() : t[s] = r;
   };
   for (let r = 0, i = arguments.length; r < i; r++)
-    arguments[r] && yc(arguments[r], n);
+    arguments[r] && gc(arguments[r], n);
   return t;
 }
-const zS = (e, t, n, { allOwnKeys: r } = {}) => (yc(t, (i, s) => {
+const zS = (e, t, n, { allOwnKeys: r } = {}) => (gc(t, (i, s) => {
   n && pn(i) ? e[s] = Mm(i, n) : e[s] = i;
 }, { allOwnKeys: r }), e), YS = (e) => (e.charCodeAt(0) === 65279 && (e = e.slice(1)), e), ZS = (e, t, n, r) => {
   e.prototype = Object.create(t.prototype, r), e.prototype.constructor = e, Object.defineProperty(e, "super", {
@@ -13152,7 +13152,7 @@ const zS = (e, t, n, { allOwnKeys: r } = {}) => (yc(t, (i, s) => {
   return r !== -1 && r === n;
 }, eT = (e) => {
   if (!e) return null;
-  if (Ks(e)) return e;
+  if (Gs(e)) return e;
   let t = e.length;
   if (!Vm(t)) return null;
   const n = new Array(t);
@@ -13179,7 +13179,7 @@ const zS = (e, t, n, { allOwnKeys: r } = {}) => (yc(t, (i, s) => {
   }
 ), zd = (({ hasOwnProperty: e }) => (t, n) => e.call(t, n))(Object.prototype), oT = zn("RegExp"), jm = (e, t) => {
   const n = Object.getOwnPropertyDescriptors(e), r = {};
-  yc(n, (i, s) => {
+  gc(n, (i, s) => {
     let o;
     (o = t(i, s, e)) !== !1 && (r[s] = o || i);
   }), Object.defineProperties(e, r);
@@ -13204,7 +13204,7 @@ const zS = (e, t, n, { allOwnKeys: r } = {}) => (yc(t, (i, s) => {
       n[s] = !0;
     });
   };
-  return Ks(e) ? r(e) : r(String(e).split(t)), n;
+  return Gs(e) ? r(e) : r(String(e).split(t)), n;
 }, uT = () => {
 }, fT = (e, t) => e != null && Number.isFinite(e = +e) ? e : t;
 function lT(e) {
@@ -13212,24 +13212,24 @@ function lT(e) {
 }
 const hT = (e) => {
   const t = new Array(10), n = (r, i) => {
-    if (pc(r)) {
+    if (yc(r)) {
       if (t.indexOf(r) >= 0)
         return;
-      if (dc(r))
+      if (pc(r))
         return r;
       if (!("toJSON" in r)) {
         t[i] = r;
-        const s = Ks(r) ? [] : {};
-        return yc(r, (o, c) => {
+        const s = Gs(r) ? [] : {};
+        return gc(r, (o, c) => {
           const a = n(o, i + 1);
-          !Co(a) && (s[c] = a);
+          !Ho(a) && (s[c] = a);
         }), t[i] = void 0, s;
       }
     }
     return r;
   };
   return n(e, 0);
-}, dT = zn("AsyncFunction"), pT = (e) => e && (pc(e) || pn(e)) && pn(e.then) && pn(e.catch), Km = ((e, t) => e ? setImmediate : t ? ((n, r) => (Ci.addEventListener("message", ({ source: i, data: s }) => {
+}, dT = zn("AsyncFunction"), pT = (e) => e && (yc(e) || pn(e)) && pn(e.then) && pn(e.catch), Km = ((e, t) => e ? setImmediate : t ? ((n, r) => (Ci.addEventListener("message", ({ source: i, data: s }) => {
   i === Ci && s === n && r.length && r.shift()();
 }, !1), (i) => {
   r.push(i), Ci.postMessage(n, "*");
@@ -13237,22 +13237,22 @@ const hT = (e) => {
   typeof setImmediate == "function",
   pn(Ci.postMessage)
 ), yT = typeof queueMicrotask < "u" ? queueMicrotask.bind(Ci) : typeof process < "u" && process.nextTick || Km, gT = (e) => e != null && pn(e[ou]), z = {
-  isArray: Ks,
+  isArray: Gs,
   isArrayBuffer: Lm,
-  isBuffer: dc,
+  isBuffer: pc,
   isFormData: $S,
   isArrayBufferView: RS,
   isString: US,
   isNumber: Vm,
   isBoolean: CS,
-  isObject: pc,
+  isObject: yc,
   isPlainObject: ta,
   isEmptyObject: HS,
   isReadableStream: jS,
   isRequest: KS,
   isResponse: GS,
   isHeaders: WS,
-  isUndefined: Co,
+  isUndefined: Ho,
   isDate: FS,
   isFile: MS,
   isBlob: qS,
@@ -13262,7 +13262,7 @@ const hT = (e) => {
   isURLSearchParams: DS,
   isTypedArray: tT,
   isFileList: LS,
-  forEach: yc,
+  forEach: gc,
   merge: Qf,
   extend: zS,
   trim: XS,
@@ -13597,7 +13597,7 @@ function PT(e, t, n) {
     }
   return (n || JSON.stringify)(e);
 }
-const gc = {
+const mc = {
   transitional: Zm,
   adapter: ["xhr", "http", "fetch"],
   transformRequest: [function(t, n) {
@@ -13626,7 +13626,7 @@ const gc = {
     return s || i ? (n.setContentType("application/json", !1), PT(t)) : t;
   }],
   transformResponse: [function(t) {
-    const n = this.transitional || gc.transitional, r = n && n.forcedJSONParsing, i = this.responseType === "json";
+    const n = this.transitional || mc.transitional, r = n && n.forcedJSONParsing, i = this.responseType === "json";
     if (z.isResponse(t) || z.isReadableStream(t))
       return t;
     if (t && z.isString(t) && (r && !this.responseType || i)) {
@@ -13664,7 +13664,7 @@ const gc = {
   }
 };
 z.forEach(["delete", "get", "head", "post", "put", "patch"], (e) => {
-  gc.headers[e] = {};
+  mc.headers[e] = {};
 });
 const RT = z.toObjectSet([
   "age",
@@ -13692,7 +13692,7 @@ const RT = z.toObjectSet([
     i = o.indexOf(":"), n = o.substring(0, i).trim().toLowerCase(), r = o.substring(i + 1).trim(), !(!n || t[n] && RT[n]) && (n === "set-cookie" ? t[n] ? t[n].push(r) : t[n] = [r] : t[n] = t[n] ? t[n] + ", " + r : r);
   }), t;
 }, Qd = Symbol("internals");
-function ro(e) {
+function io(e) {
   return e && String(e).trim().toLowerCase();
 }
 function na(e) {
@@ -13737,7 +13737,7 @@ let yn = class {
   set(t, n, r) {
     const i = this;
     function s(c, a, u) {
-      const f = ro(a);
+      const f = io(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 yn = class {
     return this;
   }
   get(t, n) {
-    if (t = ro(t), t) {
+    if (t = io(t), t) {
       const r = z.findKey(this, t);
       if (r) {
         const i = this[r];
@@ -13778,7 +13778,7 @@ let yn = class {
     }
   }
   has(t, n) {
-    if (t = ro(t), t) {
+    if (t = io(t), t) {
       const r = z.findKey(this, t);
       return !!(r && this[r] !== void 0 && (!n || Zu(this, this[r], r, n)));
     }
@@ -13788,7 +13788,7 @@ let yn = class {
     const r = this;
     let i = !1;
     function s(o) {
-      if (o = ro(o), o) {
+      if (o = io(o), o) {
         const c = z.findKey(r, o);
         c && (!n || Zu(r, r[c], c, n)) && (delete r[c], i = !0);
       }
@@ -13850,7 +13850,7 @@ let yn = class {
       accessors: {}
     }).accessors, i = this.prototype;
     function s(o) {
-      const c = ro(o);
+      const c = io(o);
       r[c] || (MT(i, o), r[c] = !0);
     }
     return z.isArray(t) ? t.forEach(s) : s(t), this;
@@ -13868,7 +13868,7 @@ z.reduceDescriptors(yn.prototype, ({ value: e }, t) => {
 });
 z.freezeMethods(yn);
 function Ju(e, t) {
-  const n = this || gc, r = t || n, i = yn.from(r.headers);
+  const n = this || mc, r = t || n, i = yn.from(r.headers);
   let s = r.data;
   return z.forEach(e, function(c) {
     s = c.call(n, s, i.normalize(), t ? t.status : void 0);
@@ -13877,10 +13877,10 @@ function Ju(e, t) {
 function Qm(e) {
   return !!(e && e.__CANCEL__);
 }
-function Gs(e, t, n) {
+function Ws(e, t, n) {
   ke.call(this, e ?? "canceled", ke.ERR_CANCELED, t, n), this.name = "CanceledError";
 }
-z.inherits(Gs, ke, {
+z.inherits(Ws, ke, {
   __CANCEL__: !0
 });
 function ew(e, t, n) {
@@ -14125,7 +14125,7 @@ const nw = (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] = xa(u, !0), E.addEventListener("progress", d)), a && E.upload && ([l, y] = xa(a), E.upload.addEventListener("progress", l), E.upload.addEventListener("loadend", y)), (i.cancelToken || i.signal) && (f = (w) => {
-      E && (r(!w || w.type ? new Gs(null, e, E) : w), E.abort(), E = null);
+      E && (r(!w || w.type ? new Ws(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 S = qT(i.url);
     if (S && jt.protocols.indexOf(S) === -1) {
@@ -14142,7 +14142,7 @@ const nw = (e) => {
       if (!i) {
         i = !0, c();
         const f = u instanceof Error ? u : this.reason;
-        r.abort(f instanceof ke ? f : new Gs(f instanceof Error ? f.message : f));
+        r.abort(f instanceof ke ? f : new Ws(f instanceof Error ? f.message : f));
       }
     };
     let o = t && setTimeout(() => {
@@ -14389,13 +14389,13 @@ const s0 = (e) => `- ${e}`, rx = (e) => z.isFunction(e) || e === null || e === !
 };
 function Qu(e) {
   if (e.cancelToken && e.cancelToken.throwIfRequested(), e.signal && e.signal.aborted)
-    throw new Gs(null, e);
+    throw new Ws(null, e);
 }
 function o0(e) {
   return Qu(e), e.headers = yn.from(e.headers), e.data = Ju.call(
     e,
     e.transformRequest
-  ), ["post", "put", "patch"].indexOf(e.method) !== -1 && e.headers.setContentType("application/x-www-form-urlencoded", !1), sw.getAdapter(e.adapter || gc.adapter)(e).then(function(r) {
+  ), ["post", "put", "patch"].indexOf(e.method) !== -1 && e.headers.setContentType("application/x-www-form-urlencoded", !1), sw.getAdapter(e.adapter || mc.adapter)(e).then(function(r) {
     return Qu(e), r.data = Ju.call(
       e,
       e.transformResponse,
@@ -14606,7 +14606,7 @@ let sx = class cw {
         r.unsubscribe(s);
       }, o;
     }, t(function(s, o, c) {
-      r.reason || (r.reason = new Gs(s, o, c), n(r.reason));
+      r.reason || (r.reason = new Ws(s, o, c), n(r.reason));
     });
   }
   /**
@@ -14737,9 +14737,9 @@ function aw(e) {
     return aw(zi(e, i));
   }, n;
 }
-const dt = aw(gc);
+const dt = aw(mc);
 dt.Axios = Vi;
-dt.CanceledError = Gs;
+dt.CanceledError = Ws;
 dt.CancelToken = sx;
 dt.isCancel = Qm;
 dt.VERSION = ow;
@@ -14810,10 +14810,10 @@ var a0;
 (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";
 })(a0 || (a0 = {}));
-var Hs;
+var Fs;
 (function(e) {
   e.Replied = "replied", e.Rejected = "rejected";
-})(Hs || (Hs = {}));
+})(Fs || (Fs = {}));
 function ux(e) {
   return e != null && "reject_code" in e;
 }
@@ -14887,9 +14887,9 @@ class gt extends es {
     super(t, Pr.Protocol), this.name = "ProtocolError", Object.setPrototypeOf(this, gt.prototype);
   }
 }
-class Ts extends es {
+class xs extends es {
   constructor(t) {
-    super(t, Pr.Reject), this.name = "RejectError", Object.setPrototypeOf(this, Ts.prototype);
+    super(t, Pr.Reject), this.name = "RejectError", Object.setPrototypeOf(this, xs.prototype);
   }
 }
 class va extends es {
@@ -14912,18 +14912,18 @@ class fn extends es {
     super(t, Pr.Unknown), this.name = "UnknownError", Object.setPrototypeOf(this, fn.prototype);
   }
 }
-class xs extends Ue {
+class As extends Ue {
   constructor(t, n) {
-    super(), this.reason = t, this.error = n, this.name = "CertificateVerificationErrorCode", Object.setPrototypeOf(this, xs.prototype);
+    super(), this.reason = t, this.error = n, this.name = "CertificateVerificationErrorCode", Object.setPrototypeOf(this, As.prototype);
   }
   toErrorMessage() {
     let t = this.reason;
-    return this.error && (t += `: ${wc(this.error)}`), `Certificate verification error: "${t}"`;
+    return this.error && (t += `: ${bc(this.error)}`), `Certificate verification error: "${t}"`;
   }
 }
-class Ho extends Ue {
+class Fo extends Ue {
   constructor(t, n, r, i, s) {
-    super(), this.maxAgeInMinutes = t, this.certificateTime = n, this.currentTime = r, this.timeDiffMsecs = i, this.ageType = s, this.name = "CertificateTimeErrorCode", Object.setPrototypeOf(this, Ho.prototype);
+    super(), this.maxAgeInMinutes = t, this.certificateTime = n, this.currentTime = r, this.timeDiffMsecs = i, this.ageType = s, this.name = "CertificateTimeErrorCode", Object.setPrototypeOf(this, Fo.prototype);
   }
   toErrorMessage() {
     return `Certificate is signed more than ${this.maxAgeInMinutes} minutes in the ${this.ageType}. Certificate time: ${this.certificateTime.toISOString()} Current time: ${this.currentTime.toISOString()} Clock drift: ${this.timeDiffMsecs}ms`;
@@ -14945,9 +14945,9 @@ class hu 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 Fs extends Ue {
+class Ms extends Ue {
   constructor(t, n) {
-    super(), this.message = t, this.lookupStatus = n, this.name = "LookupErrorCode", Object.setPrototypeOf(this, Fs.prototype);
+    super(), this.message = t, this.lookupStatus = n, this.name = "LookupErrorCode", Object.setPrototypeOf(this, Ms.prototype);
   }
   toErrorMessage() {
     return `${this.message}. Lookup status: ${this.lookupStatus}`;
@@ -15014,7 +15014,7 @@ class Ql extends Ue {
     super(), this.error = t, this.input = n, this.name = "CborDecodeErrorCode", Object.setPrototypeOf(this, Ql.prototype);
   }
   toErrorMessage() {
-    return `Failed to decode CBOR: ${wc(this.error)}, input: ${it(this.input)}`;
+    return `Failed to decode CBOR: ${bc(this.error)}, input: ${it(this.input)}`;
   }
 }
 class eh extends Ue {
@@ -15022,12 +15022,12 @@ class eh extends Ue {
     super(), this.error = t, this.value = n, this.name = "CborEncodeErrorCode", Object.setPrototypeOf(this, eh.prototype);
   }
   toErrorMessage() {
-    return `Failed to encode CBOR: ${wc(this.error)}, input: ${this.value}`;
+    return `Failed to encode CBOR: ${bc(this.error)}, input: ${this.value}`;
   }
 }
-class Fo extends Ue {
+class Mo extends Ue {
   constructor(t, n, r) {
-    super(), this.message = t, this.requestId = n, this.status = r, this.name = "TimeoutWaitingForResponseErrorCode", Object.setPrototypeOf(this, Fo.prototype);
+    super(), this.message = t, this.requestId = n, this.status = r, this.name = "TimeoutWaitingForResponseErrorCode", Object.setPrototypeOf(this, Mo.prototype);
   }
   toErrorMessage() {
     let t = `${this.message}
@@ -15097,9 +15097,9 @@ class ih extends Ue {
 `;
   }
 }
-class Ws extends Ue {
+class Xs extends Ue {
   constructor(t) {
-    super(), this.shouldFetchRootKey = t, this.name = "MissingRootKeyErrorCode", Object.setPrototypeOf(this, Ws.prototype);
+    super(), this.shouldFetchRootKey = t, this.name = "MissingRootKeyErrorCode", Object.setPrototypeOf(this, Xs.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.`;
@@ -15113,9 +15113,9 @@ class sh extends Ue {
     return `Attempt to hash a value of unsupported type: ${this.value}`;
   }
 }
-class Ao extends Ue {
+class vo extends Ue {
   constructor(t) {
-    super(), this.error = t, this.name = "HttpDefaultFetchErrorCode", Object.setPrototypeOf(this, Ao.prototype);
+    super(), this.error = t, this.name = "HttpDefaultFetchErrorCode", Object.setPrototypeOf(this, vo.prototype);
   }
   toErrorMessage() {
     return this.error;
@@ -15129,9 +15129,9 @@ class Pi extends Ue {
     return "This identity has expired due this application's security policy. Please refresh your authentication.";
   }
 }
-class ms extends Ue {
+class ws extends Ue {
   constructor(t, n) {
-    super(), this.message = t, this.providedIngressExpiryInMinutes = n, this.name = "IngressExpiryInvalidErrorCode", Object.setPrototypeOf(this, ms.prototype);
+    super(), this.message = t, this.providedIngressExpiryInMinutes = n, this.name = "IngressExpiryInvalidErrorCode", Object.setPrototypeOf(this, ws.prototype);
   }
   toErrorMessage() {
     return `${this.message}. Provided ingress expiry time is ${this.providedIngressExpiryInMinutes} minutes.`;
@@ -15182,12 +15182,12 @@ class $n extends Ue {
     super(), this.error = t, this.name = "UnexpectedErrorCode", Object.setPrototypeOf(this, $n.prototype);
   }
   toErrorMessage() {
-    return `Unexpected error: ${wc(this.error)}`;
+    return `Unexpected error: ${bc(this.error)}`;
   }
 }
-class mc extends Ue {
+class wc extends Ue {
   constructor(t) {
-    super(), this.error = t, this.name = "HashTreeDecodeErrorCode", Object.setPrototypeOf(this, mc.prototype);
+    super(), this.error = t, this.name = "HashTreeDecodeErrorCode", Object.setPrototypeOf(this, wc.prototype);
   }
   toErrorMessage() {
     return `Failed to decode certificate: ${this.error}`;
@@ -15219,7 +15219,7 @@ class Ba extends Ue {
     super(), this.error = t, this.name = "HttpFetchErrorCode", Object.setPrototypeOf(this, Ba.prototype);
   }
   toErrorMessage() {
-    return `Failed to fetch HTTP request: ${wc(this.error)}`;
+    return `Failed to fetch HTTP request: ${bc(this.error)}`;
   }
 }
 class Na extends Ue {
@@ -15246,7 +15246,7 @@ class ka extends Ue {
     return `Failed to deserialize expiry: ${this.error}`;
   }
 }
-function wc(e) {
+function bc(e) {
   if (e instanceof Error)
     return e.stack ?? e.message;
   try {
@@ -15255,7 +15255,7 @@ function wc(e) {
     return String(e);
   }
 }
-const As = new Error("unreachable");
+const vs = new Error("unreachable");
 function Pa(e) {
   if (!e)
     throw new Error("Input cannot be null or undefined");
@@ -15329,7 +15329,7 @@ const fw = 55799, lw = Symbol("CBOR_STOP_CODE");
 var Dn = /* @__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))(Dn || {}), 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 hx = 23, dx = 255, px = 65535, yx = 4294967295, gx = BigInt("0xffffffffffffffff");
 var Vn = /* @__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))(Vn || {});
-const vs = !1;
+const Is = !1;
 function mx(e) {
   return e == null;
 }
@@ -15344,9 +15344,9 @@ function bx(e) {
 function Ex(e) {
   return e & 31;
 }
-let Mo = new Uint8Array(), io, jn = 0;
+let qo = new Uint8Array(), so, jn = 0;
 function _x(e, t) {
-  Mo = e, jn = 0;
+  qo = e, jn = 0;
   const n = $i();
   return t?.(n) ?? n;
 }
@@ -15354,7 +15354,7 @@ function $i(e) {
   const [t, n] = ia();
   switch (t) {
     case xt.UnsignedInteger:
-      return Xs(n);
+      return zs(n);
     case xt.NegativeInteger:
       return Ax(n);
     case xt.ByteString:
@@ -15373,14 +15373,14 @@ function $i(e) {
   throw new ts(`Unsupported major type: ${t}`);
 }
 function ia() {
-  const e = Mo.at(jn);
+  const e = qo.at(jn);
   if (mx(e))
     throw new ts("Provided CBOR data is empty");
   const t = bx(e), n = Ex(e);
   return jn++, [t, n];
 }
 function Sx(e, t) {
-  const n = Xs(e);
+  const n = zs(e);
   if (n === 1 / 0) {
     const i = [];
     let s = $i();
@@ -15411,7 +15411,7 @@ function Tx(e) {
   throw new ts(`Unrecognized simple type: ${e.toString(2)}`);
 }
 function xx(e, t) {
-  const n = Xs(e), r = {};
+  const n = zs(e), r = {};
   if (n === 1 / 0) {
     let [i, s] = ia();
     for (; i !== xt.Simple && s !== Dn.Break; ) {
@@ -15429,18 +15429,18 @@ function xx(e, t) {
   }
   return r;
 }
-function Xs(e) {
+function zs(e) {
   if (e <= Vn.Value)
     return e;
-  switch (io = new DataView(Mo.buffer, Mo.byteOffset + jn), e) {
+  switch (so = new DataView(qo.buffer, qo.byteOffset + jn), e) {
     case Vn.OneByte:
-      return jn++, io.getUint8(0);
+      return jn++, so.getUint8(0);
     case Vn.TwoBytes:
-      return jn += 2, io.getUint16(0, vs);
+      return jn += 2, so.getUint16(0, Is);
     case Vn.FourBytes:
-      return jn += 4, io.getUint32(0, vs);
+      return jn += 4, so.getUint32(0, Is);
     case Vn.EightBytes:
-      return jn += 8, io.getBigUint64(0, vs);
+      return jn += 8, so.getBigUint64(0, Is);
     case Vn.Indefinite:
       return 1 / 0;
     default:
@@ -15448,22 +15448,22 @@ function Xs(e) {
   }
 }
 function Ax(e) {
-  const t = Xs(e);
+  const t = zs(e);
   return typeof t == "number" ? -1 - t : -1n - t;
 }
 function dw(e) {
-  const t = Xs(e);
+  const t = zs(e);
   if (t > Number.MAX_SAFE_INTEGER)
     throw new ts("Byte length is too large");
   const n = Number(t);
-  return jn += n, Mo.slice(jn - n, jn);
+  return jn += n, qo.slice(jn - n, jn);
 }
 function ol(e) {
   const t = dw(e);
   return wx.decode(t);
 }
 function vx(e, t) {
-  const n = Xs(e);
+  const n = zs(e);
   if (n === fw)
     return $i();
   throw new ts(`Unsupported tag: ${n}.`);
@@ -15474,7 +15474,7 @@ class hh extends Error {
   }
 }
 const Ix = 2 * 1024, Ox = 100, Bx = new TextEncoder();
-function so(e) {
+function oo(e) {
   return e << 5;
 }
 let bn = new Uint8Array(Ix), Mn = new DataView(bn.buffer), Tt = 0, tf = [];
@@ -15515,55 +15515,55 @@ function dh(e, t) {
   throw new hh(`Unsupported type: ${typeof e}`);
 }
 function kx(e, t) {
-  zs(xt.Array, e.length), e.forEach((n, r) => {
+  Ys(xt.Array, e.length), e.forEach((n, r) => {
     dh(t?.(n, r.toString()) ?? n, t);
   });
 }
 function Px(e, t) {
-  tf = Object.entries(e), zs(xt.Map, tf.length), tf.forEach(([n, r]) => {
+  tf = Object.entries(e), Ys(xt.Map, tf.length), tf.forEach(([n, r]) => {
     gw(n), dh(t?.(r, n) ?? r, t);
   });
 }
-function zs(e, t) {
+function Ys(e, t) {
   if (t <= hx) {
     Mn.setUint8(
       Tt++,
-      so(e) | Number(t)
+      oo(e) | Number(t)
     );
     return;
   }
   if (t <= dx) {
     Mn.setUint8(
       Tt++,
-      so(e) | Vn.OneByte
+      oo(e) | Vn.OneByte
     ), Mn.setUint8(Tt, Number(t)), Tt += 1;
     return;
   }
   if (t <= px) {
     Mn.setUint8(
       Tt++,
-      so(e) | Vn.TwoBytes
-    ), Mn.setUint16(Tt, Number(t), vs), Tt += 2;
+      oo(e) | Vn.TwoBytes
+    ), Mn.setUint16(Tt, Number(t), Is), Tt += 2;
     return;
   }
   if (t <= yx) {
     Mn.setUint8(
       Tt++,
-      so(e) | Vn.FourBytes
-    ), Mn.setUint32(Tt, Number(t), vs), Tt += 4;
+      oo(e) | Vn.FourBytes
+    ), Mn.setUint32(Tt, Number(t), Is), Tt += 4;
     return;
   }
   if (t <= gx) {
     Mn.setUint8(
       Tt++,
-      so(e) | Vn.EightBytes
-    ), Mn.setBigUint64(Tt, BigInt(t), vs), Tt += 8;
+      oo(e) | Vn.EightBytes
+    ), Mn.setBigUint64(Tt, BigInt(t), Is), Tt += 8;
     return;
   }
   throw new hh(`Value too large to encode: ${t}`);
 }
 function Rx(e) {
-  zs(xt.Simple, Ux(e));
+  Ys(xt.Simple, Ux(e));
 }
 function Ux(e) {
   if (e === !1)
@@ -15577,10 +15577,10 @@ function Ux(e) {
   throw new hh(`Unrecognized simple value: ${e.toString()}`);
 }
 function pw(e, t) {
-  zs(e, t.length), Tt > bn.length - t.length && (bn = hw(bn, bn.length + t.length), Mn = new DataView(bn.buffer)), bn.set(t, Tt), Tt += t.length;
+  Ys(e, t.length), Tt > bn.length - t.length && (bn = hw(bn, bn.length + t.length), Mn = new DataView(bn.buffer)), bn.set(t, Tt), Tt += t.length;
 }
 function yw(e, t) {
-  zs(e, t);
+  Ys(e, t);
 }
 function Cx(e) {
   yw(xt.UnsignedInteger, e);
@@ -15601,14 +15601,14 @@ function f0(e) {
   pw(xt.ByteString, e);
 }
 function Mx(e, t, n) {
-  zs(xt.Tag, e), dh(t, n);
+  Ys(xt.Tag, e), dh(t, n);
 }
 function qx(e) {
   return typeof e == "object" && e !== null && "toCborValue" in e;
 }
 function nf(e) {
   try {
-    return Nx(e, (t) => Ke.isPrincipal(t) ? t.toUint8Array() : Is.isExpiry(t) ? t.toBigInt() : qx(t) ? t.toCborValue() : t);
+    return Nx(e, (t) => Ke.isPrincipal(t) ? t.toUint8Array() : Os.isExpiry(t) ? t.toBigInt() : qx(t) ? t.toCborValue() : t);
   } catch (t) {
     throw et.fromCode(new eh(t, e));
   }
@@ -15620,7 +15620,7 @@ function rr(e) {
     throw et.fromCode(new Ql(t, e));
   }
 }
-const Hc = () => {
+const Fc = () => {
   if (typeof window < "u" && window.crypto && window.crypto.getRandomValues) {
     const e = new Uint32Array(1);
     return window.crypto.getRandomValues(e), e[0];
@@ -15639,22 +15639,22 @@ var cl;
 (function(e) {
   e.Call = "call";
 })(cl || (cl = {}));
-var qo;
+var Lo;
 (function(e) {
   e.Query = "query", e.ReadState = "read_state";
-})(qo || (qo = {}));
+})(Lo || (Lo = {}));
 function al() {
-  const e = new ArrayBuffer(16), t = new DataView(e), n = Hc(), r = Hc(), i = Hc(), s = Hc();
+  const e = new ArrayBuffer(16), t = new DataView(e), n = Fc(), r = Fc(), i = Fc(), s = Fc();
   return t.setUint32(0, n), t.setUint32(4, r), t.setUint32(8, i), t.setUint32(12, s), Object.assign(new Uint8Array(e), { __nonce__: void 0 });
 }
-const Fc = "__expiry__", ph = BigInt(1e3), Lx = BigInt(1e6), mw = BigInt(60), Vx = BigInt(90) * ph;
+const Mc = "__expiry__", ph = BigInt(1e3), Lx = BigInt(1e6), mw = BigInt(60), Vx = BigInt(90) * ph;
 function ww(e) {
   return e / ph;
 }
 function $x(e) {
   return ww(e) / mw;
 }
-class Is {
+class Os {
   constructor(t) {
     this.__expiry__ = t, this._isExpiry = !0;
   }
@@ -15669,7 +15669,7 @@ class Is {
   static fromDeltaInMilliseconds(t, n = 0) {
     const r = BigInt(t), i = BigInt(Date.now()) + r + BigInt(n);
     let s;
-    return r < Vx ? s = ww(i) : s = $x(i) * mw, new Is(s * ph * Lx);
+    return r < Vx ? s = ww(i) : s = $x(i) * mw, new Os(s * ph * Lx);
   }
   toBigInt() {
     return this.__expiry__;
@@ -15685,7 +15685,7 @@ class Is {
    * @returns {JsonnableExpiry} a JSON object with a single key, {@link JSON_KEY_EXPIRY}, whose value is the expiry as a string
    */
   toJSON() {
-    return { [Fc]: this.toString() };
+    return { [Mc]: this.toString() };
   }
   /**
    * Deserializes a {@link JsonnableExpiry} object from a JSON string.
@@ -15694,17 +15694,17 @@ class Is {
    */
   static fromJSON(t) {
     const n = JSON.parse(t);
-    if (n[Fc])
+    if (n[Mc])
       try {
-        const r = BigInt(n[Fc]);
-        return new Is(r);
+        const r = BigInt(n[Mc]);
+        return new Os(r);
       } catch (r) {
         throw new et(new ka(`Not a valid BigInt: ${r}`));
       }
-    throw new et(new ka(`The input does not contain the key ${Fc}`));
+    throw new et(new ka(`The input does not contain the key ${Mc}`));
   }
   static isExpiry(t) {
-    return t instanceof Is || typeof t == "object" && t !== null && "_isExpiry" in t && t._isExpiry === !0 && "__expiry__" in t && typeof t.__expiry__ == "bigint";
+    return t instanceof Os || typeof t == "object" && t !== null && "_isExpiry" in t && t._isExpiry === !0 && "__expiry__" in t && typeof t.__expiry__ == "bigint";
   }
 }
 function l0(e = al) {
@@ -15721,15 +15721,15 @@ function rf(e) {
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const yh = /* @__PURE__ */ BigInt(0), Ua = /* @__PURE__ */ BigInt(1);
-function Lo(e, t = "") {
+function Vo(e, t = "") {
   if (typeof e != "boolean") {
     const n = t && `"${t}"`;
     throw new Error(n + "expected boolean, got type=" + typeof e);
   }
   return e;
 }
-function Os(e, t, n = "") {
-  const r = oc(e), i = e?.length, s = t !== void 0;
+function Bs(e, t, n = "") {
+  const r = cc(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}`;
     throw new Error(o + "expected Uint8Array" + c + ", got " + a);
@@ -15744,11 +15744,11 @@ function bw(e) {
 function or(e) {
   return bw(it(e));
 }
-function Vo(e) {
+function $o(e) {
   return Nn(e), bw(it(Uint8Array.from(e).reverse()));
 }
 function Ct(e, t) {
-  return cc(e.toString(16).padStart(t * 2, "0"));
+  return ac(e.toString(16).padStart(t * 2, "0"));
 }
 function Ew(e, t) {
   return Ct(e, t).reverse();
@@ -15757,11 +15757,11 @@ function cn(e, t, n) {
   let r;
   if (typeof t == "string")
     try {
-      r = cc(t);
+      r = ac(t);
     } catch (s) {
       throw new Error(e + " must be hex string or Uint8Array, cause: " + s);
     }
-  else if (oc(t))
+  else if (cc(t))
     r = Uint8Array.from(t);
   else
     throw new Error(e + " must be hex string or Uint8Array");
@@ -15781,7 +15781,7 @@ function d0(e, t, n, r) {
   if (!_w(t, n, r))
     throw new Error("expected valid " + e + ": " + n + " <= n < " + r + ", got " + t);
 }
-function $o(e) {
+function Do(e) {
   let t;
   for (t = 0; e > yh; e >>= Ua, t += 1)
     ;
@@ -15794,7 +15794,7 @@ const ns = (e) => (Ua << BigInt(e)) - Ua;
 function jx(e) {
   return typeof e == "function" && Number.isSafeInteger(e.outputLen);
 }
-function bc(e, t, n = {}) {
+function Ec(e, t, n = {}) {
   if (!e || typeof e != "object")
     throw new Error("expected valid options object");
   function r(i, s, o) {
@@ -15810,7 +15810,7 @@ function bc(e, t, n = {}) {
 const Sw = () => {
   throw new Error("not implemented");
 };
-function Do(e) {
+function jo(e) {
   const t = /* @__PURE__ */ new WeakMap();
   return (n, ...r) => {
     const i = t.get(n);
@@ -15931,7 +15931,7 @@ function Nw(e) {
     BYTES: "number",
     BITS: "number"
   }, n = Zx.reduce((r, i) => (r[i] = "function", r), t);
-  return bc(e, n), e;
+  return Ec(e, n), e;
 }
 function wu(e, t, n) {
   if (n < hn)
@@ -16019,7 +16019,7 @@ function gi(e, t, n = !1, r = {}) {
       }
       if (d.length !== u)
         throw new Error("Field.fromBytes: expected " + u + " bytes, got " + d.length);
-      let g = n ? Vo(d) : or(d);
+      let g = n ? $o(d) : or(d);
       if (o && (g = wt(g, e)), !y && !l.isValid(g))
         throw new Error("invalid field element: outside of range 0..ORDER");
       return g;
@@ -16046,11 +16046,11 @@ function Qx(e, t, n = !1) {
   const r = e.length, i = kw(t), s = Pw(t);
   if (r < 16 || r < s || r > 1024)
     throw new Error("expected " + s + "-1024 bytes of input, got " + r);
-  const o = n ? Vo(e) : or(e), c = wt(o, t - Mt) + Mt;
+  const o = n ? $o(e) : or(e), c = wt(o, t - Mt) + Mt;
   return n ? Ew(c, i) : Ct(c, i);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Ms = BigInt(0), Mi = BigInt(1);
+const qs = BigInt(0), Mi = BigInt(1);
 function Ha(e, t) {
   const n = t.negate();
   return e ? n : t;
@@ -16096,7 +16096,7 @@ function af(e) {
   return Uw.get(e) || 1;
 }
 function g0(e) {
-  if (e !== Ms)
+  if (e !== qs)
     throw new Error("invalid wNAF");
 }
 class Cw {
@@ -16107,7 +16107,7 @@ class Cw {
   // non-const time multiplication ladder
   _unsafeLadder(t, n, r = this.ZERO) {
     let i = t;
-    for (; n > Ms; )
+    for (; n > qs; )
       n & Mi && (r = r.add(i)), i = i.double(), n >>= Mi;
     return r;
   }
@@ -16158,7 +16158,7 @@ class Cw {
    */
   wNAFUnsafe(t, n, r, i = this.ZERO) {
     const s = of(t, this.bits);
-    for (let o = 0; o < s.windows && r !== Ms; o++) {
+    for (let o = 0; o < s.windows && r !== qs; o++) {
       const { nextN: c, offset: a, isZero: u, isNeg: f } = y0(r, o, s);
       if (r = c, !u) {
         const l = n[a];
@@ -16191,7 +16191,7 @@ class Cw {
 }
 function n3(e, t, n, r) {
   let i = t, s = e.ZERO, o = e.ZERO;
-  for (; n > Ms || r > Ms; )
+  for (; n > qs || r > qs; )
     n & Mi && (s = s.add(i)), r & Mi && (o = o.add(i)), i = i.double(), n >>= Mi, r >>= Mi;
   return { p1: s, p2: o };
 }
@@ -16200,7 +16200,7 @@ function Hw(e, t, n, r) {
   const i = n.length, s = r.length;
   if (i !== s)
     throw new Error("arrays of points and scalars must have equal length");
-  const o = e.ZERO, c = $o(BigInt(i));
+  const o = e.ZERO, c = Do(BigInt(i));
   let a = 1;
   c > 12 ? a = c - 3 : c > 4 ? a = c - 2 : c > 0 && (a = 2);
   const u = ns(a), f = new Array(Number(u) + 1).fill(o), l = Math.floor((t.BITS - 1) / a) * a;
@@ -16233,7 +16233,7 @@ function Fw(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 > Ms))
+    if (!(typeof u == "bigint" && u > qs))
       throw new Error(`CURVE.${a} must be positive bigint`);
   }
   const i = m0(t.p, n.Fp, r), s = m0(t.n, n.Fn, r), c = ["Gx", "Gy", "a", e === "weierstrass" ? "b" : "d"];
@@ -16244,7 +16244,7 @@ function Fw(e, t, n = {}, r) {
 }
 const r3 = or;
 function si(e, t) {
-  if (jo(e), jo(t), e < 0 || e >= 1 << 8 * t)
+  if (Ko(e), Ko(t), e < 0 || e >= 1 << 8 * t)
     throw new Error("invalid I2OSP input: " + e);
   const n = Array.from({ length: t }).fill(0);
   for (let r = t - 1; r >= 0; r--)
@@ -16257,17 +16257,17 @@ function i3(e, t) {
     n[r] = e[r] ^ t[r];
   return n;
 }
-function jo(e) {
+function Ko(e) {
   if (!Number.isSafeInteger(e))
     throw new Error("number expected");
 }
 function Mw(e) {
-  if (!oc(e) && typeof e != "string")
+  if (!cc(e) && typeof e != "string")
     throw new Error("DST must be Uint8Array or string");
   return typeof e == "string" ? pt(e) : e;
 }
 function s3(e, t, n, r) {
-  Nn(e), jo(n), t = Mw(t), t.length > 255 && (t = r($e(pt("H2C-OVERSIZE-DST-"), t)));
+  Nn(e), Ko(n), t = Mw(t), t.length > 255 && (t = r($e(pt("H2C-OVERSIZE-DST-"), t)));
   const { outputLen: i, blockLen: s } = r, o = Math.ceil(n / i);
   if (n > 65535 || o > 255)
     throw new Error("expand_message_xmd: invalid lenInBytes");
@@ -16280,7 +16280,7 @@ function s3(e, t, n, r) {
   return $e(...f).slice(0, n);
 }
 function o3(e, t, n, r, i) {
-  if (Nn(e), jo(n), t = Mw(t), t.length > 255) {
+  if (Nn(e), Ko(n), t = Mw(t), t.length > 255) {
     const s = Math.ceil(2 * r / 8);
     t = i.create({ dkLen: s }).update(pt("H2C-OVERSIZE-DST-")).update(t).digest();
   }
@@ -16289,7 +16289,7 @@ function o3(e, t, n, r, i) {
   return i.create({ dkLen: n }).update(e).update(si(n, 2)).update(t).update(si(t.length, 1)).digest();
 }
 function uf(e, t, n) {
-  bc(n, {
+  Ec(n, {
     p: "bigint",
     m: "number",
     k: "number",
@@ -16298,7 +16298,7 @@ function uf(e, t, n) {
   const { p: r, k: i, m: s, hash: o, expand: c, DST: a } = n;
   if (!jx(n.hash))
     throw new Error("expected valid hash");
-  Nn(e), jo(t);
+  Nn(e), Ko(t);
   const u = r.toString(2).length, f = Math.ceil((u + i) / 8), l = t * s * f;
   let d;
   if (c === "xmd")
@@ -16372,12 +16372,12 @@ function a3(e, t, n) {
   let u = e - c * r - a * s, f = -c * i - a * o;
   const l = u < qi, d = f < qi;
   l && (u = -u), d && (f = -f);
-  const y = ns(Math.ceil($o(n) / 2)) + Qt;
+  const y = ns(Math.ceil(Do(n) / 2)) + Qt;
   if (u < qi || u >= y || f < qi || f >= y)
     throw new Error("splitScalar (endomorphism): failed, k=" + e);
   return { k1neg: l, k1: u, k2neg: d, k2: f };
 }
-const qi = BigInt(0), Qt = BigInt(1), mr = BigInt(2), ws = BigInt(3), ul = BigInt(4);
+const qi = BigInt(0), Qt = BigInt(1), mr = BigInt(2), bs = BigInt(3), ul = BigInt(4);
 function Fa(e, t) {
   const { BYTES: n } = e;
   let r;
@@ -16399,7 +16399,7 @@ function u3(e, t = {}) {
   const n = Fw("weierstrass", e, t), { Fp: r, Fn: i } = n;
   let s = n.CURVE;
   const { h: o, n: c } = s;
-  bc(t, {}, {
+  Ec(t, {}, {
     allowInfinityPoint: "boolean",
     clearCofactor: "function",
     isTorsionFree: "function",
@@ -16418,7 +16418,7 @@ function u3(e, t = {}) {
   }
   function l(K, H, $) {
     const { x: P, y: D } = H.toAffine(), F = r.toBytes(P);
-    if (Lo($, "isCompressed"), $) {
+    if (Vo($, "isCompressed"), $) {
       f();
       const x = !r.isOdd(D);
       return $e(f3(x), F);
@@ -16426,7 +16426,7 @@ function u3(e, t = {}) {
       return $e(Uint8Array.of(4), F, r.toBytes(D));
   }
   function d(K) {
-    Os(K, void 0, "Point");
+    Bs(K, void 0, "Point");
     const { publicKey: H, publicKeyUncompressed: $ } = u, P = K.length, D = K[0], F = K.subarray(1);
     if (P === H && (D === 2 || D === 3)) {
       const x = r.fromBytes(F);
@@ -16462,7 +16462,7 @@ function u3(e, t = {}) {
   }
   if (!E(s.Gx, s.Gy))
     throw new Error("bad curve params: generator point");
-  const _ = r.mul(r.pow(s.a, ws), ul), S = r.mul(r.sqr(s.b), BigInt(27));
+  const _ = r.mul(r.pow(s.a, bs), ul), S = 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, $ = !1) {
@@ -16479,7 +16479,7 @@ function u3(e, t = {}) {
       throw new Error("no endo");
     return a3(K, a.basises, i.ORDER);
   }
-  const A = Do((K, H) => {
+  const A = jo((K, H) => {
     const { X: $, Y: P, Z: D } = K;
     if (r.eql(D, r.ONE))
       return { x: $, y: P };
@@ -16491,7 +16491,7 @@ function u3(e, t = {}) {
     if (!r.eql(q, r.ONE))
       throw new Error("invZ was invalid");
     return { x, y: B };
-  }), R = Do((K) => {
+  }), R = jo((K) => {
     if (K.is0()) {
       if (t.allowInfinityPoint && !r.is0(K.Y))
         return;
@@ -16527,7 +16527,7 @@ function u3(e, t = {}) {
       return r.is0($) && r.is0(P) ? v.ZERO : new v($, P, r.ONE);
     }
     static fromBytes(H) {
-      const $ = v.fromAffine(g(Os(H, void 0, "point")));
+      const $ = v.fromAffine(g(Bs(H, void 0, "point")));
       return $.assertValidity(), $;
     }
     static fromHex(H) {
@@ -16546,7 +16546,7 @@ function u3(e, t = {}) {
      * @returns
      */
     precompute(H = 8, $ = !0) {
-      return L.createCache(this, H), $ || this.multiply(ws), this;
+      return L.createCache(this, H), $ || this.multiply(bs), this;
     }
     // TODO: return `this`
     /** A point on curve is valid if it conforms to equation. */
@@ -16574,7 +16574,7 @@ function u3(e, t = {}) {
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: H, b: $ } = s, P = r.mul($, ws), { X: D, Y: F, Z: x } = this;
+      const { a: H, b: $ } = s, P = r.mul($, bs), { X: D, Y: F, Z: x } = this;
       let B = r.ZERO, q = r.ZERO, N = r.ZERO, V = r.mul(D, D), G = r.mul(F, F), X = r.mul(x, x), Y = r.mul(D, F);
       return Y = r.add(Y, Y), N = r.mul(D, x), N = r.add(N, N), B = r.mul(H, N), q = r.mul(P, X), q = r.add(B, q), B = r.sub(G, q), q = r.add(G, q), q = r.mul(B, q), 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), q = r.add(q, 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, q, N);
     }
@@ -16586,7 +16586,7 @@ function u3(e, t = {}) {
       T(H);
       const { X: $, Y: P, Z: D } = this, { X: F, Y: x, Z: B } = H;
       let q = r.ZERO, N = r.ZERO, V = r.ZERO;
-      const G = s.a, X = r.mul(s.b, ws);
+      const G = s.a, X = r.mul(s.b, bs);
       let Y = r.mul($, F), ce = r.mul(P, x), ue = r.mul(D, B), te = r.add($, 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);
@@ -16670,7 +16670,7 @@ function u3(e, t = {}) {
       return this.multiplyUnsafe(o).is0();
     }
     toBytes(H = !0) {
-      return Lo(H, "isCompressed"), this.assertValidity(), y(v, this, H);
+      return Vo(H, "isCompressed"), this.assertValidity(), y(v, this, H);
     }
     toHex(H = !0) {
       return it(this.toBytes(H));
@@ -16735,8 +16735,8 @@ function l3(e, t) {
     }
     return { isValid: O, value: S };
   };
-  if (e.ORDER % ul === ws) {
-    const g = (e.ORDER - ws) / ul, m = e.sqrt(e.neg(t));
+  if (e.ORDER % ul === bs) {
+    const g = (e.ORDER - bs) / ul, m = e.sqrt(e.neg(t));
     y = (E, _) => {
       let S = e.sqr(_);
       const w = e.mul(E, _);
@@ -16832,11 +16832,11 @@ function y3(e, t) {
   });
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const g3 = BigInt(0), Mc = BigInt(1), _0 = BigInt(2), bs = BigInt(3);
+const g3 = BigInt(0), qc = BigInt(1), _0 = BigInt(2), Es = BigInt(3);
 function m3(e) {
   const t = [];
-  for (; e > Mc; e >>= Mc)
-    (e & Mc) === g3 ? t.unshift(0) : (e & bs) === bs ? (t.unshift(-1), e += Mc) : t.unshift(1);
+  for (; e > qc; e >>= qc)
+    (e & qc) === g3 ? t.unshift(0) : (e & Es) === Es ? (t.unshift(-1), e += qc) : t.unshift(1);
   return t;
 }
 function ff(e) {
@@ -16854,8 +16854,8 @@ function w3(e, t, n, r) {
     throw new Error("bls: unknown twist type");
   const l = i.div(i.ONE, i.mul(i.ONE, _0));
   function d(w, T, O, A) {
-    const R = i.sqr(O), M = i.sqr(A), v = i.mulByB(i.mul(M, bs)), U = i.mul(v, bs), L = i.sub(i.sub(i.sqr(i.add(O, A)), M), R), K = i.sub(v, R), H = i.mul(i.sqr(T), bs), $ = i.neg(L);
-    return w.push([K, H, $]), 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), bs)), A = i.mul(R, L), { Rx: T, Ry: O, Rz: A };
+    const R = i.sqr(O), M = i.sqr(A), v = i.mulByB(i.mul(M, Es)), U = i.mul(v, Es), L = i.sub(i.sub(i.sqr(i.add(O, A)), M), R), K = i.sub(v, R), H = i.mul(i.sqr(T), Es), $ = i.neg(L);
+    return w.push([K, H, $]), 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), Es)), A = i.mul(R, L), { 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)), L = i.sub(i.mul(v, R), i.mul(U, M)), K = i.neg(v), H = U;
@@ -16863,7 +16863,7 @@ function w3(e, t, n, r) {
     const $ = i.sqr(U), P = i.mul($, U), D = i.mul($, T), F = i.add(i.sub(P, i.mul(D, _0)), i.mul(i.sqr(v), A));
     return T = i.mul(U, F), O = i.sub(i.mul(i.sub(D, F), v), i.mul(P, O)), A = i.mul(A, P), { Rx: T, Ry: O, Rz: A };
   }
-  const g = m3(c), m = Do((w) => {
+  const g = m3(c), m = jo((w) => {
     const T = w, { x: O, y: A } = T.toAffine(), R = O, M = A, v = i.neg(A);
     let U = R, L = M, K = i.ONE;
     const H = [];
@@ -17139,7 +17139,7 @@ class _3 {
   constructor(t, n = {}) {
     this.MASK = Ar;
     const r = t.ORDER, i = r * r;
-    this.Fp = t, this.ORDER = i, this.BITS = $o(i), this.BYTES = Math.ceil($o(i) / 8), this.isLE = t.isLE, this.ZERO = { c0: t.ZERO, c1: t.ZERO }, this.ONE = { c0: t.ONE, c1: t.ZERO }, this.Fp_NONRESIDUE = t.create(n.NONRESIDUE || BigInt(-1)), this.Fp_div2 = t.div(t.ONE, tn), this.NONRESIDUE = A0(t, n.FP2_NONRESIDUE), this.FROBENIUS_COEFFICIENTS = mh(t, this.Fp_NONRESIDUE, t.ORDER, 2)[0], this.mulByB = n.Fp2mulByB, Object.seal(this);
+    this.Fp = t, this.ORDER = i, this.BITS = Do(i), this.BYTES = Math.ceil(Do(i) / 8), this.isLE = t.isLE, this.ZERO = { c0: t.ZERO, c1: t.ZERO }, this.ONE = { c0: t.ONE, c1: t.ZERO }, this.Fp_NONRESIDUE = t.create(n.NONRESIDUE || BigInt(-1)), this.Fp_div2 = t.div(t.ONE, tn), this.NONRESIDUE = A0(t, n.FP2_NONRESIDUE), this.FROBENIUS_COEFFICIENTS = mh(t, this.Fp_NONRESIDUE, t.ORDER, 2)[0], this.mulByB = n.Fp2mulByB, Object.seal(this);
   }
   fromBigTuple(t) {
     return A0(this.Fp, t);
@@ -17671,12 +17671,12 @@ function x3(e) {
   return { Fp: t, Fp2: n, Fp6: r, Fp12: i };
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Kt = BigInt(0), Ma = BigInt(1), Rn = BigInt(2), bu = BigInt(3), Ko = BigInt(4), oi = BigInt("0xd201000000010000"), A3 = $o(oi), Yi = {
+const Kt = BigInt(0), Ma = BigInt(1), Rn = BigInt(2), bu = BigInt(3), Go = BigInt(4), oi = BigInt("0xd201000000010000"), A3 = Do(oi), Yi = {
   p: BigInt("0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab"),
   n: BigInt("0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001"),
   h: BigInt("0x396c8c005555e1568c00aaab0000aaab"),
   a: Kt,
-  b: Ko,
+  b: Go,
   Gx: BigInt("0x17f1d3a73197d7942695638c4fa9ac0fc3688c4f9774b905a14e3a3f171bac586c55e83ff97a1aeffb3af00adb22c6bb"),
   Gy: BigInt("0x08b3f481e3aaa0f1a09e30ed741d8ae4fcf5e095d5d00af600db18cb2c04b3edd03cc744a2888ae40caa232946c5e7e1")
 }, v3 = gi(Yi.n, {
@@ -17689,7 +17689,7 @@ const Kt = BigInt(0), Ma = BigInt(1), Rn = BigInt(2), bu = BigInt(3), Ko = BigIn
   // Fp(u) / (u² - β) where β = -1
   FP2_NONRESIDUE: [Ma, Ma],
   Fp2mulByB: ({ c0: e, c1: t }) => {
-    const n = Ee.mul(e, Ko), r = Ee.mul(t, Ko);
+    const n = Ee.mul(e, Go), r = Ee.mul(t, Go);
     return { c0: Ee.sub(n, r), c1: Ee.add(n, r) };
   },
   Fp12finalExponentiate: (e) => {
@@ -17709,7 +17709,7 @@ const Kt = BigInt(0), Ma = BigInt(1), Rn = BigInt(2), bu = BigInt(3), Ko = BigIn
   n: Yi.n,
   h: BigInt("0x5d543a95414e7f1091d50792876a202cd91de4547085abaa68a205b2e5a7ddfa628f1cb4d9e82ef21537e293a6691ae1616ec6e786f0c70cf1c38e31c7238e5"),
   a: Re.ZERO,
-  b: Re.fromBigTuple([Ko, Ko]),
+  b: Re.fromBigTuple([Go, Go]),
   Gx: Re.fromBigTuple([
     BigInt("0x024aa2b2f08f0a91260805272dc51051c6e47ad4fa403b02b4510b647ae3d1770bac0326a805bbefd48056c8c121bdb8"),
     BigInt("0x13e02b6052719f607dacd3a088274f65596bd0d09920b61ab5da61bbdc7f5049334cf11213945d57e5ac7d055d042b7e")
@@ -17718,13 +17718,13 @@ const Kt = BigInt(0), Ma = BigInt(1), Rn = BigInt(2), bu = BigInt(3), Ko = BigIn
     BigInt("0x0ce5d527727d6e118cc9cdc6da2e351aadfd9baa8cbdd3a76d429a695160d12c923ac9cc3baca289e193548608b82801"),
     BigInt("0x0606c4a02ea734cc32acd2b02bc28b99cb3e287e85a763af267492ab572e99ab3f370d275cec1da1aaa9075ff05f79be")
   ])
-}, Eu = Ec(Ee.toBytes(Kt), { infinity: !0, compressed: !0 });
+}, Eu = _c(Ee.toBytes(Kt), { infinity: !0, compressed: !0 });
 function _u(e) {
   e = e.slice();
   const t = e[0] & 224, n = !!(t >> 7 & 1), r = !!(t >> 6 & 1), i = !!(t >> 5 & 1);
   return e[0] &= 31, { compressed: n, infinity: r, sort: i, value: e };
 }
-function Ec(e, t) {
+function _c(e, t) {
   if (e[0] & 224)
     throw new Error("setMask: non-empty mask");
   return t.compressed && (e[0] |= 128), t.infinity && (e[0] |= 64), t.sort && (e[0] |= 32), e;
@@ -17735,7 +17735,7 @@ function B3(e, t, n) {
     if (s)
       return Eu.slice();
     const a = !!(c * Rn / i);
-    return Ec(Ct(o, r), { compressed: !0, sort: a });
+    return _c(Ct(o, r), { compressed: !0, sort: a });
   } else
     return s ? $e(Uint8Array.of(64), new Uint8Array(2 * r - 1)) : $e(Ct(o, r), Ct(c, r));
 }
@@ -17745,7 +17745,7 @@ function hf(e) {
   if (e.is0())
     return Eu.slice();
   const s = !!(i * Rn / n);
-  return Ec(Ct(r, t), { compressed: !0, sort: s });
+  return _c(Ct(r, t), { compressed: !0, sort: s });
 }
 function N3(e) {
   const { compressed: t, infinity: n, sort: r, value: i } = _u(e), { BYTES: s, ORDER: o } = Ee;
@@ -17791,7 +17791,7 @@ function k3(e, t, n) {
     if (s)
       return $e(Eu, Ct(Kt, r));
     const a = !!(c.c1 === Kt ? c.c0 * Rn / i : c.c1 * Rn / i);
-    return $e(Ec(Ct(o.c1, r), { compressed: !0, sort: a }), Ct(o.c0, r));
+    return $e(_c(Ct(o.c1, r), { compressed: !0, sort: a }), Ct(o.c0, r));
   } else {
     if (s)
       return $e(Uint8Array.of(64), new Uint8Array(4 * r - 1));
@@ -17805,7 +17805,7 @@ function df(e) {
   if (e.is0())
     return $e(Eu, Ct(Kt, t));
   const { x: n, y: r } = e.toAffine(), { re: i, im: s } = Re.reim(n), { re: o, im: c } = Re.reim(r), u = !!((c > Kt ? c * Rn : o * Rn) / Ee.ORDER & Ma), f = i;
-  return $e(Ec(Ct(s, t), { sort: u, compressed: !0 }), Ct(f, t));
+  return $e(_c(Ct(s, t), { sort: u, compressed: !0 }), Ct(f, t));
 }
 function P3(e) {
   const { BYTES: t, ORDER: n } = Ee, { compressed: r, infinity: i, sort: s, value: o } = _u(e);
@@ -18116,7 +18116,7 @@ function q3(e, t, n) {
   const r = typeof e == "string" ? e : it(e), i = typeof t == "string" ? t : it(t), s = typeof n == "string" ? n : it(n);
   return Su.verifyShortSignature(i, s, r);
 }
-const L3 = BigInt(1e6), Vw = (e) => Nt(new js(e)), bh = (e) => {
+const L3 = BigInt(1e6), Vw = (e) => Nt(new Ks(e)), bh = (e) => {
   const n = Vw(e) / L3;
   return new Date(Number(n));
 }, B0 = 60 * 1e3, V3 = 60, $3 = 24, D3 = $3 * V3, j3 = 5, K3 = 5, G3 = 30 * D3;
@@ -18154,7 +18154,7 @@ class Di {
    * @returns The result of the lookup.
    */
   lookup_path(t) {
-    return _c(t, this.cert.tree);
+    return Sc(t, this.cert.tree);
   }
   /**
    * Lookup a subtree in the certificate tree, using {@link lookup_subtree}.
@@ -18165,23 +18165,23 @@ class Di {
     return Eh(t, this.cert.tree);
   }
   async verify() {
-    const t = await sa(this.cert.tree), n = await this._checkDelegationAndGetKey(this.cert.delegation), r = this.cert.signature, i = z3(n), s = $e(_o("ic-state-root"), t), o = Sn(this.lookup_path(["time"]));
+    const t = await sa(this.cert.tree), n = await this._checkDelegationAndGetKey(this.cert.delegation), r = this.cert.signature, i = z3(n), s = $e(So("ic-state-root"), t), o = Sn(this.lookup_path(["time"]));
     if (!o)
-      throw gt.fromCode(new xs("Certificate does not contain a time"));
+      throw gt.fromCode(new As("Certificate does not contain a time"));
     if (!this.#t) {
       const c = this.#e?.getTimeDiffMsecs() ?? 0, a = this._maxAgeInMinutes * B0, u = /* @__PURE__ */ new Date(), f = u.getTime() + c, l = f - a, d = f + K3 * B0, y = bh(o), g = y.getTime() < l, m = y.getTime() > d;
       if ((g || m) && this.#e && !this.#e.hasSyncedTime())
         return await this.#e.syncTime(this._canisterId), await this.verify();
       if (g)
-        throw vn.fromCode(new Ho(this._maxAgeInMinutes, y, u, c, "past"));
+        throw vn.fromCode(new Fo(this._maxAgeInMinutes, y, u, c, "past"));
       if (m)
-        throw this.#e?.hasSyncedTime() ? fn.fromCode(new $n("System time has been synced with the IC network, but certificate is still too far in the future.")) : vn.fromCode(new Ho(5, y, u, c, "future"));
+        throw this.#e?.hasSyncedTime() ? fn.fromCode(new $n("System time has been synced with the IC network, but certificate is still too far in the future.")) : vn.fromCode(new Fo(5, y, u, c, "future"));
     }
     try {
       if (!await this._blsVerify(i, r, s))
-        throw vn.fromCode(new xs("Invalid signature"));
+        throw vn.fromCode(new As("Invalid signature"));
     } catch (c) {
-      throw vn.fromCode(new xs("Signature verification failed", c));
+      throw vn.fromCode(new As("Signature verification failed", c));
     }
   }
   async _checkDelegationAndGetKey(t) {
@@ -18212,15 +18212,15 @@ class Di {
     return o;
   }
 }
-const oo = cc("308182301d060d2b0601040182dc7c0503010201060c2b0601040182dc7c05030201036100"), X3 = 96;
+const co = ac("308182301d060d2b0601040182dc7c0503010201060c2b0601040182dc7c05030201036100"), X3 = 96;
 function z3(e) {
-  const t = oo.byteLength + X3;
+  const t = co.byteLength + X3;
   if (e.byteLength !== t)
     throw gt.fromCode(new pu(t, e.byteLength));
-  const n = e.slice(0, oo.byteLength);
-  if (!mu(n, oo))
-    throw gt.fromCode(new Zl(oo, n));
-  return e.slice(oo.byteLength);
+  const n = e.slice(0, co.byteLength);
+  if (!mu(n, co))
+    throw gt.fromCode(new Zl(co, n));
+  return e.slice(co.byteLength);
 }
 function Sn(e) {
   if (e.status === In.Found && e.value instanceof Uint8Array)
@@ -18229,20 +18229,20 @@ function Sn(e) {
 async function sa(e) {
   switch (e[0]) {
     case Ht.Empty:
-      return _n(_o("ic-hashtree-empty"));
+      return _n(So("ic-hashtree-empty"));
     case Ht.Pruned:
       return e[1];
     case Ht.Leaf:
-      return _n($e(_o("ic-hashtree-leaf"), e[1]));
+      return _n($e(So("ic-hashtree-leaf"), e[1]));
     case Ht.Labeled:
-      return _n($e(_o("ic-hashtree-labeled"), e[1], await sa(e[2])));
+      return _n($e(So("ic-hashtree-labeled"), e[1], await sa(e[2])));
     case Ht.Fork:
-      return _n($e(_o("ic-hashtree-fork"), await sa(e[1]), await sa(e[2])));
+      return _n($e(So("ic-hashtree-fork"), await sa(e[1]), await sa(e[2])));
     default:
-      throw As;
+      throw vs;
   }
 }
-function _o(e) {
+function So(e) {
   const t = new Uint8Array([e.length]), n = new TextEncoder().encode(e);
   return $e(t, n);
 }
@@ -18253,15 +18253,15 @@ var In;
 (function(e) {
   e.Unknown = "Unknown", e.Absent = "Absent", e.Found = "Found", e.Error = "Error";
 })(In || (In = {}));
-var Bs;
+var Ns;
 (function(e) {
   e.Absent = "Absent", e.Unknown = "Unknown", e.Found = "Found";
-})(Bs || (Bs = {}));
+})(Ns || (Ns = {}));
 var ct;
 (function(e) {
   e.Absent = "Absent", e.Unknown = "Unknown", e.Found = "Found", e.Less = "Less", e.Greater = "Greater";
 })(ct || (ct = {}));
-function _c(e, t) {
+function Sc(e, t) {
   if (e.length === 0)
     switch (t[0]) {
       case Ht.Empty:
@@ -18270,13 +18270,13 @@ function _c(e, t) {
         };
       case Ht.Leaf: {
         if (!t[1])
-          throw fn.fromCode(new mc("Invalid tree structure for leaf"));
+          throw fn.fromCode(new wc("Invalid tree structure for leaf"));
         if (t[1] instanceof Uint8Array)
           return {
             status: In.Found,
             value: t[1].slice(t[1].byteOffset, t[1].byteLength + t[1].byteOffset)
           };
-        throw As;
+        throw vs;
       }
       case Ht.Pruned:
         return {
@@ -18288,12 +18288,12 @@ function _c(e, t) {
           status: In.Error
         };
       default:
-        throw As;
+        throw vs;
     }
-  const n = $w(e), r = vo(n, t);
+  const n = $w(e), r = Io(n, t);
   switch (r.status) {
     case ct.Found:
-      return _c(e.slice(1), r.value);
+      return Sc(e.slice(1), r.value);
     case ct.Absent:
     case ct.Greater:
     case ct.Less:
@@ -18305,31 +18305,31 @@ function _c(e, t) {
         status: In.Unknown
       };
     default:
-      throw As;
+      throw vs;
   }
 }
 function Eh(e, t) {
   if (e.length === 0)
     return {
-      status: Bs.Found,
+      status: Ns.Found,
       value: t
     };
-  const n = $w(e), r = vo(n, t);
+  const n = $w(e), r = Io(n, t);
   switch (r.status) {
     case ct.Found:
       return Eh(e.slice(1), r.value);
     case ct.Unknown:
       return {
-        status: Bs.Unknown
+        status: Ns.Unknown
       };
     case ct.Absent:
     case ct.Greater:
     case ct.Less:
       return {
-        status: Bs.Absent
+        status: Ns.Absent
       };
     default:
-      throw As;
+      throw vs;
   }
 }
 function fl(e) {
@@ -18342,7 +18342,7 @@ function fl(e) {
       return [e];
   }
 }
-function vo(e, t) {
+function Io(e, t) {
   switch (t[0]) {
     // if we have a labelled node, compare the node's label to the one we are
     // looking for
@@ -18357,12 +18357,12 @@ function vo(e, t) {
       };
     // if we have a fork node, we need to search both sides, starting with the left
     case Ht.Fork: {
-      const n = vo(e, t[1]);
+      const n = Io(e, t[1]);
       switch (n.status) {
         // if the label we're searching for is greater than the left node lookup,
         // we need to search the right node
         case ct.Greater: {
-          const r = vo(e, t[2]);
+          const r = Io(e, t[2]);
           return r.status === ct.Less ? {
             status: ct.Absent
           } : r;
@@ -18370,7 +18370,7 @@ function vo(e, t) {
         // if the left node returns an uncertain result, we need to search the
         // right node
         case ct.Unknown: {
-          const r = vo(e, t[2]);
+          const r = Io(e, t[2]);
           return r.status === ct.Less ? {
             status: ct.Unknown
           } : r;
@@ -18398,9 +18398,9 @@ function vo(e, t) {
   }
 }
 function Dw(e) {
-  const { canisterId: t, subnetId: n, tree: r } = e, i = _c(["subnet", n.toUint8Array(), "canister_ranges"], r);
+  const { canisterId: t, subnetId: n, tree: r } = e, i = Sc(["subnet", n.toUint8Array(), "canister_ranges"], r);
   if (i.status !== In.Found)
-    throw gt.fromCode(new Fs(`Could not find canister ranges for subnet ${n.toText()}`, i.status));
+    throw gt.fromCode(new Ms(`Could not find canister ranges for subnet ${n.toText()}`, i.status));
   if (!(i.value instanceof Uint8Array))
     throw gt.fromCode(new du(`Could not find canister ranges for subnet ${n.toText()}`));
   return rr(i.value).map((a) => [
@@ -18414,7 +18414,7 @@ const N0 = async (e) => {
     return (async () => {
       try {
         if (t.rootKey === null)
-          throw un.fromCode(new Ws());
+          throw un.fromCode(new Xs());
         const l = t.rootKey, d = await t.readState(i, {
           paths: [f]
         }), y = await Di.create({
@@ -18483,7 +18483,7 @@ const N0 = async (e) => {
                 }
           }
       } catch (l) {
-        if (l instanceof _r && (l.hasCode(xs) || l.hasCode(Ho)))
+        if (l instanceof _r && (l.hasCode(As) || l.hasCode(Fo)))
           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 N0 = async (e) => {
   }), !Dw({ canisterId: t, subnetId: o, tree: i }))
     throw vn.fromCode(new hu(t, o));
   const a = Eh(["subnet", s.subnet_id, "node"], i);
-  if (a.status !== Bs.Found)
-    throw gt.fromCode(new Fs("Node not found", a.status));
+  if (a.status !== Ns.Found)
+    throw gt.fromCode(new Ms("Node not found", a.status));
   if (a.value instanceof Uint8Array)
-    throw fn.fromCode(new mc("Invalid node tree"));
+    throw fn.fromCode(new wc("Invalid node tree"));
   const u = fl(a.value), f = /* @__PURE__ */ new Map();
   return u.forEach((l) => {
-    const d = Ke.from(l[1]).toText(), y = _c(["public_key"], l[2]);
+    const d = Ke.from(l[1]).toText(), y = Sc(["public_key"], l[2]);
     if (y.status !== In.Found)
-      throw gt.fromCode(new Fs("Public key not found", y.status));
+      throw gt.fromCode(new Ms("Public key not found", y.status));
     const g = y.value;
     if (g.byteLength !== 44)
       throw gt.fromCode(new pu(44, g.byteLength));
@@ -18559,7 +18559,7 @@ function t8(e, t = {}) {
   const n = Fw("edwards", e, t, t.FpFnLE), { Fp: r, Fn: i } = n;
   let s = n.CURVE;
   const { h: o } = s;
-  bc(t, {}, { uvRatio: "function" });
+  Ec(t, {}, { uvRatio: "function" });
   const c = pf << BigInt(i.BYTES * 8) - Bt, a = (E) => r.create(E), u = t.uvRatio || ((E, _) => {
     try {
       return { isValid: !0, value: r.sqrt(r.div(E, _)) };
@@ -18577,7 +18577,7 @@ function t8(e, t = {}) {
     if (!(E instanceof g))
       throw new Error("ExtendedPoint expected");
   }
-  const d = Do((E, _) => {
+  const d = jo((E, _) => {
     const { X: S, Y: w, Z: T } = E, O = E.is0();
     _ == null && (_ = O ? Q3 : r.inv(T));
     const A = a(S * _), R = a(w * _), M = r.mul(T, _);
@@ -18586,7 +18586,7 @@ function t8(e, t = {}) {
     if (M !== Bt)
       throw new Error("invZ was invalid");
     return { x: A, y: R };
-  }), y = Do((E) => {
+  }), y = jo((E) => {
     const { a: _, d: S } = s;
     if (E.is0())
       throw new Error("bad point: ZERO");
@@ -18614,10 +18614,10 @@ function t8(e, t = {}) {
     // Uses algo from RFC8032 5.1.3.
     static fromBytes(_, S = !1) {
       const w = r.BYTES, { a: T, d: O } = s;
-      _ = h0(Os(_, w, "point")), Lo(S, "zip215");
+      _ = h0(Bs(_, w, "point")), Vo(S, "zip215");
       const A = h0(_), R = _[w - 1];
       A[w - 1] = R & -129;
-      const M = Vo(A), v = S ? c : r.ORDER;
+      const M = $o(A), v = S ? c : r.ORDER;
       d0("point.y", M, Dr, v);
       const U = a(M * M), L = a(U - Bt), K = a(O * U - T);
       let { isValid: H, value: $ } = u(L, K);
@@ -18754,7 +18754,7 @@ function t8(e, t = {}) {
 function n8(e, t, n = {}) {
   if (typeof t != "function")
     throw new Error('"hash" function param is required');
-  bc(n, {}, {
+  Ec(n, {}, {
     adjustScalarBytes: "function",
     randomBytes: "function",
     domain: "function",
@@ -18762,12 +18762,12 @@ function n8(e, t, n = {}) {
     mapToCurve: "function"
   });
   const { prehash: r } = n, { BASE: i, Fp: s, Fn: o } = e, c = n.randomBytes || lg, a = n.adjustScalarBytes || ((v) => v), u = n.domain || ((v, U, L) => {
-    if (Lo(L, "phflag"), U.length || L)
+    if (Vo(L, "phflag"), U.length || L)
       throw new Error("Contexts/pre-hash are not supported");
     return v;
   });
   function f(v) {
-    return o.create(Vo(v));
+    return o.create($o(v));
   }
   function l(v) {
     const U = w.secretKey;
@@ -18792,13 +18792,13 @@ function n8(e, t, n = {}) {
     if (!o.isValid(x))
       throw new Error("sign failed: invalid s");
     const B = $e(D, o.toBytes(x));
-    return Os(B, w.signature, "result");
+    return Bs(B, w.signature, "result");
   }
   const E = { zip215: !0 };
   function _(v, U, L, K = E) {
     const { context: H, zip215: $ } = K, P = w.signature;
-    v = cn("signature", v, P), U = cn("message", U), L = cn("publicKey", L, w.publicKey), $ !== void 0 && Lo($, "zip215"), r && (U = r(U));
-    const D = P / 2, F = v.subarray(0, D), x = Vo(v.subarray(D, P));
+    v = cn("signature", v, P), U = cn("message", U), L = cn("publicKey", L, w.publicKey), $ !== void 0 && Vo($, "zip215"), r && (U = r(U));
+    const D = P / 2, F = v.subarray(0, D), x = $o(v.subarray(D, P));
     let B, q, N;
     try {
       B = e.fromBytes(L, $), q = e.fromBytes(F, $), N = i.multiplyUnsafe(x);
@@ -18817,14 +18817,14 @@ function n8(e, t, n = {}) {
     seed: S
   };
   function T(v = c(w.seed)) {
-    return Os(v, w.seed, "seed");
+    return Bs(v, w.seed, "seed");
   }
   function O(v) {
     const U = M.randomSecretKey(v);
     return { secretKey: U, publicKey: y(U) };
   }
   function A(v) {
-    return oc(v) && v.length === o.BYTES;
+    return cc(v) && v.length === o.BYTES;
   }
   function R(v, U) {
     try {
@@ -18856,7 +18856,7 @@ function n8(e, t, n = {}) {
     },
     toMontgomerySecret(v) {
       const U = w.secretKey;
-      Os(v, U);
+      Bs(v, U);
       const L = t(v.subarray(0, U));
       return a(L).subarray(0, U);
     },
@@ -18944,7 +18944,7 @@ const h8 = gi(jw.p, { isLE: !0 }), d8 = {
   // Constant-time, u/√v
   uvRatio: l8
 }, p8 = s8(d8);
-var R0, U0, Rt, ks;
+var R0, U0, Rt, Ps;
 class y8 {
   /**
    * Create a new ExpirableMap.
@@ -18955,10 +18955,10 @@ class y8 {
   constructor(t = {}) {
     // Internals
     sn(this, Rt);
-    sn(this, ks);
+    sn(this, Ps);
     this[R0] = this.entries.bind(this), this[U0] = "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, ks, r);
+    Yt(this, Rt, new Map([...n].map(([s, o]) => [s, { value: o, timestamp: i }]))), Yt(this, Ps, r);
   }
   /**
    * Prune removes all expired entries.
@@ -18966,7 +18966,7 @@ class y8 {
   prune() {
     const t = Date.now();
     for (const [n, r] of Fe(this, Rt).entries())
-      t - r.timestamp > Fe(this, ks) && Fe(this, Rt).delete(n);
+      t - r.timestamp > Fe(this, Ps) && Fe(this, Rt).delete(n);
     return this;
   }
   // Implementing the Map interface
@@ -18992,7 +18992,7 @@ class y8 {
   get(t) {
     const n = Fe(this, Rt).get(t);
     if (n !== void 0) {
-      if (Date.now() - n.timestamp > Fe(this, ks)) {
+      if (Date.now() - n.timestamp > Fe(this, Ps)) {
         Fe(this, Rt).delete(t);
         return;
       }
@@ -19067,7 +19067,7 @@ class y8 {
     return Fe(this, Rt).size;
   }
 }
-Rt = new WeakMap(), ks = new WeakMap(), R0 = Symbol.iterator, U0 = Symbol.toStringTag;
+Rt = new WeakMap(), Ps = new WeakMap(), R0 = Symbol.iterator, U0 = Symbol.toStringTag;
 const C0 = (e) => {
   if (e <= 127)
     return 1;
@@ -19215,15 +19215,15 @@ const w8 = (e, t) => {
     throw et.fromCode(new Jl(s, o.length));
   return o;
 };
-var Xo, zo;
+var zo, Yo;
 const Ui = class Ui {
   // `fromRaw` and `fromDer` should be used for instantiation, not this constructor.
   constructor(t) {
-    sn(this, Xo);
     sn(this, zo);
+    sn(this, Yo);
     if (t.byteLength !== Ui.RAW_KEY_LENGTH)
       throw et.fromCode(new Rr("An Ed25519 public key must be exactly 32 bytes long"));
-    Yt(this, Xo, t), Yt(this, zo, Ui.derEncode(t));
+    Yt(this, zo, t), Yt(this, Yo, Ui.derEncode(t));
   }
   static from(t) {
     return this.fromDer(t.toDer());
@@ -19244,10 +19244,10 @@ const Ui = class Ui {
     return n;
   }
   get rawKey() {
-    return Fe(this, Xo);
+    return Fe(this, zo);
   }
   get derKey() {
-    return Fe(this, zo);
+    return Fe(this, Yo);
   }
   toDer() {
     return this.derKey;
@@ -19256,7 +19256,7 @@ const Ui = class Ui {
     return this.rawKey;
   }
 };
-Xo = new WeakMap(), zo = new WeakMap(), Ui.RAW_KEY_LENGTH = 32;
+zo = new WeakMap(), Yo = new WeakMap(), Ui.RAW_KEY_LENGTH = 32;
 let hl = Ui;
 class b8 {
   constructor() {
@@ -19287,42 +19287,42 @@ class E8 extends b8 {
   }
 }
 const M0 = 0.5, q0 = 1.5, L0 = 500, V0 = 6e4, $0 = 9e5, D0 = 10;
-var qn, Yo, Zo, Jo, Qo, ec, tc, nc, Ps;
+var qn, Zo, Jo, Qo, ec, tc, nc, rc, Rs;
 const ja = class ja {
   constructor(t = ja.default) {
     sn(this, qn);
-    sn(this, Yo);
     sn(this, Zo);
     sn(this, Jo);
     sn(this, Qo);
     sn(this, ec);
     sn(this, tc);
     sn(this, nc);
-    sn(this, Ps, 0);
+    sn(this, rc);
+    sn(this, Rs, 0);
     const { initialInterval: n = L0, randomizationFactor: r = M0, multiplier: i = q0, maxInterval: s = V0, maxElapsedTime: o = $0, maxIterations: c = D0, date: a = Date } = t;
-    Yt(this, qn, n), Yt(this, Yo, r), Yt(this, Zo, i), Yt(this, Jo, s), Yt(this, nc, a), Yt(this, Qo, a.now()), Yt(this, ec, o), Yt(this, tc, c);
+    Yt(this, qn, n), Yt(this, Zo, r), Yt(this, Jo, i), Yt(this, Qo, s), Yt(this, rc, a), Yt(this, ec, a.now()), Yt(this, tc, o), Yt(this, nc, c);
   }
   get ellapsedTimeInMsec() {
-    return Fe(this, nc).now() - Fe(this, Qo);
+    return Fe(this, rc).now() - Fe(this, ec);
   }
   get currentInterval() {
     return Fe(this, qn);
   }
   get count() {
-    return Fe(this, Ps);
+    return Fe(this, Rs);
   }
   get randomValueFromInterval() {
-    const t = Fe(this, Yo) * Fe(this, qn), n = Fe(this, qn) - t, r = Fe(this, qn) + t;
+    const t = Fe(this, Zo) * Fe(this, qn), n = Fe(this, qn) - t, r = Fe(this, qn) + t;
     return Math.random() * (r - n) + n;
   }
   incrementCurrentInterval() {
-    return Yt(this, qn, Math.min(Fe(this, qn) * Fe(this, Zo), Fe(this, Jo))), Vh(this, Ps)._++, Fe(this, qn);
+    return Yt(this, qn, Math.min(Fe(this, qn) * Fe(this, Jo), Fe(this, Qo))), Vh(this, Rs)._++, Fe(this, qn);
   }
   next() {
-    return this.ellapsedTimeInMsec >= Fe(this, ec) || Fe(this, Ps) >= Fe(this, tc) ? null : (this.incrementCurrentInterval(), this.randomValueFromInterval);
+    return this.ellapsedTimeInMsec >= Fe(this, tc) || Fe(this, Rs) >= Fe(this, nc) ? null : (this.incrementCurrentInterval(), this.randomValueFromInterval);
   }
 };
-qn = new WeakMap(), Yo = new WeakMap(), Zo = new WeakMap(), Jo = new WeakMap(), Qo = new WeakMap(), ec = new WeakMap(), tc = new WeakMap(), nc = new WeakMap(), Ps = new WeakMap(), ja.default = {
+qn = new WeakMap(), Zo = new WeakMap(), Jo = new WeakMap(), Qo = new WeakMap(), ec = new WeakMap(), tc = new WeakMap(), nc = new WeakMap(), rc = new WeakMap(), Rs = new WeakMap(), ja.default = {
   initialInterval: L0,
   randomizationFactor: M0,
   multiplier: q0,
@@ -19344,16 +19344,16 @@ function P8() {
     if (window.fetch)
       e = window.fetch.bind(window);
     else
-      throw un.fromCode(new Ao("Fetch implementation was not available. You appear to be in a browser context, but window.fetch was not present."));
+      throw un.fromCode(new vo("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 un.fromCode(new Ao("Fetch implementation was not available. You appear to be in a Node.js context, but global.fetch was not available."));
+      throw un.fromCode(new vo("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 un.fromCode(new Ao("Fetch implementation was not available. Please provide fetch to the HttpAgent constructor, or ensure it is available in the window or global context."));
+  throw un.fromCode(new vo("Fetch implementation was not available. Please provide fetch to the HttpAgent constructor, or ensure it is available in the window or global context."));
 }
 function R8(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 === Hs.Replied) {
+        if (o === Fs.Replied) {
           const { reply: S } = i;
           y = Ra({
             status: o,
@@ -19411,7 +19411,7 @@ class vr {
             timestamp: BigInt(f),
             request_id: a
           });
-        } else if (o === Hs.Rejected) {
+        } else if (o === Fs.Rejected) {
           const { reject_code: S, reject_message: w, error_code: T } = i;
           y = Ra({
             status: o,
@@ -19432,7 +19432,7 @@ class vr {
         throw vn.fromCode(new fh(d));
       }
       return i;
-    }, this.config = t, this.#s = t.fetch || P8() || fetch.bind(globalThis), this.#m = t.fetchOptions, this.#b = t.callOptions, this.#e = t.shouldFetchRootKey ?? !1, this.#w = t.shouldSyncTime ?? !1, t.rootKey ? this.rootKey = t.rootKey : this.#e ? this.rootKey = null : this.rootKey = cc(T8);
+    }, this.config = t, this.#s = t.fetch || P8() || fetch.bind(globalThis), this.#m = t.fetchOptions, this.#b = t.callOptions, this.#e = t.shouldFetchRootKey ?? !1, this.#w = t.shouldSyncTime ?? !1, t.rootKey ? this.rootKey = t.rootKey : this.#e ? this.rootKey = null : this.rootKey = ac(T8);
     const n = R8(t.host);
     this.host = new URL(n), t.verifyQuerySignatures !== void 0 && (this.#d = t.verifyQuerySignatures), this.#c = t.retryTimes ?? 3;
     const r = () => new dl({
@@ -19443,9 +19443,9 @@ class vr {
       this.#r = `${i}${s ? ":" + s : ""}`;
     }
     if (this.#n = Promise.resolve(t.identity || new u0()), t.ingressExpiryInMinutes && t.ingressExpiryInMinutes > 5)
-      throw et.fromCode(new ms("The maximum ingress expiry time is 5 minutes.", t.ingressExpiryInMinutes));
+      throw et.fromCode(new ws("The maximum ingress expiry time is 5 minutes.", t.ingressExpiryInMinutes));
     if (t.ingressExpiryInMinutes && t.ingressExpiryInMinutes <= 0)
-      throw et.fromCode(new ms("Ingress expiry time must be greater than 0.", t.ingressExpiryInMinutes));
+      throw et.fromCode(new ws("Ingress expiry time must be greater than 0.", t.ingressExpiryInMinutes));
     this.#o = t.ingressExpiryInMinutes || 5, this.addTransform("update", l0(al)), t.useQueryNonces && this.addTransform("query", l0(al)), t.logToConsole && this.log.subscribe((i) => {
       i.level === "error" ? console.error(i.message) : i.level === "warn" ? console.warn(i.message) : console.log(i.message);
     });
@@ -19563,7 +19563,7 @@ class vr {
             // disable v3 api
             callSync: !1
           }, r);
-        if (_.hasCode(ms) && !this.#g)
+        if (_.hasCode(ws) && !this.#g)
           return await this.syncTime(o), this.call(o, n, r);
         _.code.requestContext = {
           requestId: E,
@@ -19583,7 +19583,7 @@ class vr {
       backoff: o,
       delay: a
     }), a === null)
-      throw fn.fromCode(new Fo(`Backoff strategy exhausted after ${c} attempts.`, s));
+      throw fn.fromCode(new Mo(`Backoff strategy exhausted after ${c} attempts.`, s));
     a > 0 && await new Promise((y) => setTimeout(y, a));
     let u;
     try {
@@ -19643,7 +19643,7 @@ class vr {
   async #p(t) {
     const { requestFn: n, backoff: r, tries: i } = t, s = i === 0 ? 0 : r.next();
     if (s === null)
-      throw gt.fromCode(new Fo(`Retry strategy exhausted after ${i} attempts.`));
+      throw gt.fromCode(new Mo(`Retry strategy exhausted after ${i} attempts.`));
     s > 0 && await new Promise((f) => setTimeout(f, s));
     let o, c = new Uint8Array();
     try {
@@ -19669,7 +19669,7 @@ class vr {
     if (o.status === k8 && o.url.includes("api/v3"))
       throw gt.fromCode(new Oa());
     if (u.startsWith("Invalid request expiry: "))
-      throw et.fromCode(new ms(u, this.#o));
+      throw et.fromCode(new ws(u, this.#o));
     if (i < this.#c)
       return await this.#p({ requestFn: n, backoff: r, tries: i + 1 });
     throw gt.fromCode(new Ia(o.status, o.statusText, a, u));
@@ -19682,7 +19682,7 @@ class vr {
     if (!c)
       throw un.fromCode(new Pi());
     const a = Ke.from(t), u = c.getPrincipal(), f = gf(this.#o, this.#i), l = {
-      request_type: qo.Query,
+      request_type: Lo.Query,
       canister_id: a,
       method_name: n.methodName,
       arg: n.arg,
@@ -19767,7 +19767,7 @@ class vr {
       },
       endpoint: Hi.ReadState,
       body: {
-        request_type: qo.ReadState,
+        request_type: Lo.ReadState,
         paths: t.paths,
         sender: i,
         ingress_expiry: gf(this.#o, this.#i)
@@ -19825,10 +19825,10 @@ class vr {
       if (r && "tree" in r)
         n = r.tree;
       else
-        throw gt.fromCode(new mc("Could not decode time from response"));
-      const i = _c(["time"], n);
+        throw gt.fromCode(new wc("Could not decode time from response"));
+      const i = Sc(["time"], n);
       if (i.status !== In.Found)
-        throw gt.fromCode(new Fs("Time was not found in the response or was not in its expected format.", i.status));
+        throw gt.fromCode(new Ms("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 gt.fromCode(new du("Time was not in its expected format."));
       const s = bh(i.value);
@@ -19905,7 +19905,7 @@ class vr {
       if (this.rootKey === null && this.host.toString() !== "https://icp-api.io" && this.#e)
         await this.fetchRootKey();
       else
-        throw un.fromCode(new Ws(this.#e));
+        throw un.fromCode(new Xs(this.#e));
   }
   async #x(t) {
     this.#w && !this.hasSyncedTime() && await this.syncTime(t);
@@ -19955,7 +19955,7 @@ class vr {
 }
 function gf(e, t) {
   const n = e * pl;
-  return Is.fromDeltaInMilliseconds(n, t);
+  return Os.fromDeltaInMilliseconds(n, t);
 }
 const U8 = 300 * 1e3;
 function C8() {
@@ -19975,7 +19975,7 @@ function M8(e) {
   const t = Date.now() + e;
   return async (n, r, i) => {
     if (Date.now() > t)
-      throw gt.fromCode(new Fo(`Request timed out after ${e} msec`, r, i));
+      throw gt.fromCode(new Mo(`Request timed out after ${e} msec`, r, i));
   };
 }
 function q8(e, t) {
@@ -20003,7 +20003,7 @@ function $8(e, t) {
   return Kw(e, t) && typeof e[t] == "function";
 }
 function j0(e) {
-  return mf(e, "body") && mf(e.body, "content") && e.body.content.request_type === qo.ReadState && mf(e.body.content, "ingress_expiry") && typeof e.body.content.ingress_expiry == "object" && e.body.content.ingress_expiry !== null && $8(e.body.content.ingress_expiry, "toHash");
+  return mf(e, "body") && mf(e.body, "content") && e.body.content.request_type === Lo.ReadState && mf(e.body.content, "ingress_expiry") && typeof e.body.content.ingress_expiry == "object" && e.body.content.ingress_expiry !== null && $8(e.body.content.ingress_expiry, "toHash");
 }
 async function Gw(e, t, n, r = {}) {
   const i = [pt("request_status"), n];
@@ -20013,7 +20013,7 @@ async function Gw(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 un.fromCode(new Ws());
+    throw un.fromCode(new Xs());
   const a = await Di.create({
     certificate: s.certificate,
     rootKey: e.rootKey,
@@ -20041,12 +20041,12 @@ async function Gw(e, t, n, r = {}) {
     }
     case Er.Rejected: {
       const l = new Uint8Array(Sn(a.lookup_path([...i, "reject_code"])))[0], d = new TextDecoder().decode(Sn(a.lookup_path([...i, "reject_message"]))), y = Sn(a.lookup_path([...i, "error_code"])), g = y ? new TextDecoder().decode(y) : void 0;
-      throw Ts.fromCode(new gu(n, l, d, g));
+      throw xs.fromCode(new gu(n, l, d, g));
     }
     case Er.Done:
       throw fn.fromCode(new ih(n));
   }
-  throw As;
+  throw vs;
 }
 async function D8(e) {
   const { paths: t, agent: n, pollingOptions: r } = e;
@@ -20163,15 +20163,15 @@ function j8(e, t, n, r) {
       requestDetails: l.requestDetails
     };
     switch (l.status) {
-      case Hs.Rejected: {
+      case Fs.Rejected: {
         const y = new nh(l.requestId, l.reject_code, l.reject_message, l.error_code, l.signatures);
         throw y.callContext = {
           canisterId: u,
           methodName: t,
           httpDetails: d
-        }, Ts.fromCode(y);
+        }, xs.fromCode(y);
       }
-      case Hs.Replied:
+      case Fs.Replied:
         return n.annotations.includes(yl) ? {
           httpDetails: d,
           result: us(n.retTypes, l.reply.arg)
@@ -20198,7 +20198,7 @@ function j8(e, t, n, r) {
     let S, w;
     if (fx(E.body)) {
       if (a.rootKey == null)
-        throw un.fromCode(new Ws());
+        throw un.fromCode(new Xs());
       const R = E.body.certificate;
       w = await Di.create({
         certificate: R,
@@ -20218,7 +20218,7 @@ function j8(e, t, n, r) {
             canisterId: d,
             methodName: t,
             httpDetails: E
-          }, Ts.fromCode($);
+          }, xs.fromCode($);
         }
       }
     } else if (ux(E.body)) {
@@ -20227,7 +20227,7 @@ function j8(e, t, n, r) {
         canisterId: d,
         methodName: t,
         httpDetails: E
-      }, Ts.fromCode(U);
+      }, xs.fromCode(U);
     }
     if (E.status === 202) {
       const R = {
@@ -20331,7 +20331,7 @@ function Yn() {
     wif: 239
   }), lr;
 }
-var bf = {}, co = {}, Ef = {}, hr = {}, G0;
+var bf = {}, ao = {}, Ef = {}, hr = {}, G0;
 function zw() {
   if (G0) return hr;
   G0 = 1, Object.defineProperty(hr, "__esModule", { value: !0 }), hr.encode = hr.decode = hr.check = void 0;
@@ -20952,7 +20952,7 @@ var ep;
 function zt() {
   return ep || (ep = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.oneOf = e.Null = e.BufferN = e.Function = e.UInt32 = e.UInt8 = e.tuple = e.maybe = e.Hex = e.Buffer = e.String = e.Boolean = e.Array = e.Number = e.Hash256bit = e.Hash160bit = e.Buffer256bit = e.isTaptree = e.isTapleaf = e.TAPLEAF_VERSION_MASK = e.Satoshi = e.isPoint = e.stacksEqual = e.typeforce = void 0;
-    const t = rc();
+    const t = ic();
     e.typeforce = X8();
     const n = t.Buffer.alloc(32, 0), r = t.Buffer.from(
       "fffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f",
@@ -21176,8 +21176,8 @@ function mi() {
 }
 var ip;
 function Y8() {
-  if (ip) return co;
-  ip = 1, Object.defineProperty(co, "__esModule", { value: !0 }), co.p2data = void 0;
+  if (ip) return ao;
+  ip = 1, Object.defineProperty(ao, "__esModule", { value: !0 }), ao.p2data = void 0;
   const e = Yn(), t = rn(), n = zt(), r = mi(), i = t.OPS;
   function s(o, c) {
     if (!o.data && !o.output) throw new TypeError("Not enough data");
@@ -21208,12 +21208,12 @@ function Y8() {
     }
     return Object.assign(u, o);
   }
-  return co.p2data = s, co;
+  return ao.p2data = s, ao;
 }
-var ao = {}, sp;
+var uo = {}, sp;
 function Z8() {
-  if (sp) return ao;
-  sp = 1, Object.defineProperty(ao, "__esModule", { value: !0 }), ao.p2ms = void 0;
+  if (sp) return uo;
+  sp = 1, Object.defineProperty(uo, "__esModule", { value: !0 }), uo.p2ms = void 0;
   const e = Yn(), t = rn(), n = zt(), r = mi(), i = t.OPS, s = i.OP_RESERVED;
   function o(c, a) {
     if (!c.input && !c.output && !(c.pubkeys && c.m !== void 0) && !c.signatures)
@@ -21314,12 +21314,12 @@ function Z8() {
     }
     return Object.assign(l, c);
   }
-  return ao.p2ms = o, ao;
+  return uo.p2ms = o, uo;
 }
-var uo = {}, op;
+var fo = {}, op;
 function J8() {
-  if (op) return uo;
-  op = 1, Object.defineProperty(uo, "__esModule", { value: !0 }), uo.p2pk = void 0;
+  if (op) return fo;
+  op = 1, Object.defineProperty(fo, "__esModule", { value: !0 }), fo.p2pk = void 0;
   const e = Yn(), t = rn(), n = zt(), r = mi(), i = t.OPS;
   function s(o, c) {
     if (!o.input && !o.output && !o.pubkey && !o.input && !o.signature)
@@ -21369,9 +21369,9 @@ function J8() {
     }
     return Object.assign(f, o);
   }
-  return uo.p2pk = s, uo;
+  return fo.p2pk = s, fo;
 }
-var fo = {}, vf = {}, vi = {}, Jt = {}, cp;
+var lo = {}, vf = {}, vi = {}, Jt = {}, cp;
 function Zw() {
   if (cp) return Jt;
   cp = 1, Object.defineProperty(Jt, "__esModule", { value: !0 }), Jt.ripemd160 = Jt.RIPEMD160 = Jt.md5 = Jt.MD5 = Jt.sha1 = Jt.SHA1 = void 0;
@@ -22313,8 +22313,8 @@ function xh() {
 }
 var gp;
 function iA() {
-  if (gp) return fo;
-  gp = 1, Object.defineProperty(fo, "__esModule", { value: !0 }), fo.p2pkh = void 0;
+  if (gp) return lo;
+  gp = 1, Object.defineProperty(lo, "__esModule", { value: !0 }), lo.p2pkh = void 0;
   const e = Cr(), t = Yn(), n = rn(), r = zt(), i = mi(), s = xh(), o = n.OPS;
   function c(a, u) {
     if (!a.address && !a.hash && !a.output && !a.pubkey && !a.input)
@@ -22409,12 +22409,12 @@ function iA() {
     }
     return Object.assign(y, a);
   }
-  return fo.p2pkh = c, fo;
+  return lo.p2pkh = c, lo;
 }
-var lo = {}, mp;
+var ho = {}, mp;
 function sA() {
-  if (mp) return lo;
-  mp = 1, Object.defineProperty(lo, "__esModule", { value: !0 }), lo.p2sh = void 0;
+  if (mp) return ho;
+  mp = 1, Object.defineProperty(ho, "__esModule", { value: !0 }), ho.p2sh = void 0;
   const e = Cr(), t = Yn(), n = rn(), r = zt(), i = mi(), s = xh(), o = n.OPS;
   function c(a, u) {
     if (!a.address && !a.hash && !a.output && !a.redeem && !a.input)
@@ -22554,13 +22554,13 @@ function sA() {
     }
     return Object.assign(l, a);
   }
-  return lo.p2sh = c, lo;
+  return ho.p2sh = c, ho;
 }
-var ho = {}, wp;
+var po = {}, wp;
 function oA() {
-  if (wp) return ho;
-  wp = 1, Object.defineProperty(ho, "__esModule", { value: !0 }), ho.p2wpkh = void 0;
-  const e = Cr(), t = Yn(), n = rn(), r = zt(), i = mi(), s = fc(), o = n.OPS, c = Buffer.alloc(0);
+  if (wp) return po;
+  wp = 1, Object.defineProperty(po, "__esModule", { value: !0 }), po.p2wpkh = void 0;
+  const e = Cr(), t = Yn(), n = rn(), r = zt(), i = mi(), s = lc(), 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");
@@ -22658,13 +22658,13 @@ function oA() {
     }
     return Object.assign(y, u);
   }
-  return ho.p2wpkh = a, ho;
+  return po.p2wpkh = a, po;
 }
-var po = {}, bp;
+var yo = {}, bp;
 function cA() {
-  if (bp) return po;
-  bp = 1, Object.defineProperty(po, "__esModule", { value: !0 }), po.p2wsh = void 0;
-  const e = Cr(), t = Yn(), n = rn(), r = zt(), i = mi(), s = fc(), o = n.OPS, c = Buffer.alloc(0);
+  if (bp) return yo;
+  bp = 1, Object.defineProperty(yo, "__esModule", { value: !0 }), yo.p2wsh = void 0;
+  const e = Cr(), t = Yn(), n = rn(), r = zt(), i = mi(), s = lc(), o = n.OPS, c = Buffer.alloc(0);
   function a(f) {
     return !!(Buffer.isBuffer(f) && f.length === 65 && f[0] === 4 && (0, r.isPoint)(f));
   }
@@ -22801,9 +22801,9 @@ function cA() {
     }
     return Object.assign(m, f);
   }
-  return po.p2wsh = u, po;
+  return yo.p2wsh = u, yo;
 }
-var yo = {}, Oi = {}, Ep;
+var go = {}, Oi = {}, Ep;
 function Ah() {
   if (Ep) return Oi;
   Ep = 1, Object.defineProperty(Oi, "__esModule", { value: !0 }), Oi.getEccLib = Oi.initEccLib = void 0;
@@ -22876,12 +22876,12 @@ function Ah() {
   ];
   return Oi;
 }
-var kf = {}, Pt = {}, qc = { exports: {} };
+var kf = {}, Pt = {}, Lc = { exports: {} };
 /*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */
 var _p;
 function aA() {
   return _p || (_p = 1, (function(e, t) {
-    var n = rc(), r = n.Buffer;
+    var n = ic(), r = n.Buffer;
     function i(o, c) {
       for (var a in o)
         c[a] = o[a];
@@ -22908,7 +22908,7 @@ function aA() {
         throw new TypeError("Argument must be a number");
       return n.SlowBuffer(o);
     };
-  })(qc, qc.exports)), qc.exports;
+  })(Lc, Lc.exports)), Lc.exports;
 }
 var Pf, Sp;
 function uA() {
@@ -23064,7 +23064,7 @@ var xp;
 function vh() {
   return xp || (xp = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.tweakKey = e.tapTweakHash = e.tapleafHash = e.findScriptPath = e.toHashTree = e.rootHashFromPath = e.MAX_TAPTREE_DEPTH = e.LEAF_VERSION_TAPSCRIPT = void 0;
-    const t = rc(), n = Ah(), r = Cr(), i = Tu(), s = zt();
+    const t = ic(), n = Ah(), r = Cr(), i = Tu(), s = zt();
     e.LEAF_VERSION_TAPSCRIPT = 192, e.MAX_TAPTREE_DEPTH = 128;
     const o = (m) => "left" in m && "right" in m;
     function c(m, E) {
@@ -23142,9 +23142,9 @@ function vh() {
 }
 var Ap;
 function fA() {
-  if (Ap) return yo;
-  Ap = 1, Object.defineProperty(yo, "__esModule", { value: !0 }), yo.p2tr = void 0;
-  const e = rc(), t = Yn(), n = rn(), r = zt(), i = Ah(), s = vh(), o = mi(), c = fc(), a = Ih(), u = n.OPS, f = 1, l = 80;
+  if (Ap) return go;
+  Ap = 1, Object.defineProperty(go, "__esModule", { value: !0 }), go.p2tr = void 0;
+  const e = ic(), t = Yn(), n = rn(), r = zt(), i = Ah(), s = vh(), o = mi(), c = lc(), a = Ih(), 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");
@@ -23343,10 +23343,10 @@ function fA() {
     }
     return Object.assign(w, y);
   }
-  return yo.p2tr = d, yo;
+  return go.p2tr = d, go;
 }
 var vp;
-function Sc() {
+function Tc() {
   return vp || (vp = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.p2tr = e.p2wsh = e.p2wpkh = e.p2sh = e.p2pkh = e.p2pk = e.p2ms = e.embed = void 0;
     const t = Y8();
@@ -23411,7 +23411,7 @@ var Ip;
 function Ih() {
   if (Ip) return Zt;
   Ip = 1, Object.defineProperty(Zt, "__esModule", { value: !0 }), Zt.toOutputScript = Zt.fromOutputScript = Zt.toBech32 = Zt.toBase58Check = Zt.fromBech32 = Zt.fromBase58Check = void 0;
-  const e = Yn(), t = Sc(), n = rn(), r = zt(), i = fc(), s = xh(), 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 = Yn(), t = Tc(), n = rn(), r = zt(), i = lc(), s = xh(), 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)
@@ -23530,10 +23530,10 @@ function Ih() {
   }
   return Zt.toOutputScript = S, Zt;
 }
-var go = {}, mo = {}, Op;
+var mo = {}, wo = {}, Op;
 function lA() {
-  if (Op) return mo;
-  Op = 1, Object.defineProperty(mo, "__esModule", { value: !0 }), mo.fastMerkleRoot = void 0;
+  if (Op) return wo;
+  Op = 1, Object.defineProperty(wo, "__esModule", { value: !0 }), wo.fastMerkleRoot = void 0;
   function e(t, n) {
     if (!Array.isArray(t)) throw TypeError("Expected values Array");
     if (typeof n != "function")
@@ -23550,12 +23550,12 @@ function lA() {
     }
     return i[0];
   }
-  return mo.fastMerkleRoot = e, mo;
+  return wo.fastMerkleRoot = e, wo;
 }
-var wo = {}, Bp;
-function Tc() {
-  if (Bp) return wo;
-  Bp = 1, Object.defineProperty(wo, "__esModule", { value: !0 }), wo.Transaction = void 0;
+var bo = {}, Bp;
+function xc() {
+  if (Bp) return bo;
+  Bp = 1, Object.defineProperty(bo, "__esModule", { value: !0 }), bo.Transaction = void 0;
   const e = Tu(), t = Cr(), n = rn(), r = rn(), i = zt(), { typeforce: s } = i;
   function o(E) {
     const _ = E.length;
@@ -23840,13 +23840,13 @@ function Tc() {
       }), T.writeUInt32(this.locktime), S !== void 0 ? _.slice(S, T.offset) : _;
     }
   }
-  return wo.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, wo;
+  return bo.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, bo;
 }
 var Np;
 function hA() {
-  if (Np) return go;
-  Np = 1, Object.defineProperty(go, "__esModule", { value: !0 }), go.Block = void 0;
-  const e = Tu(), t = Cr(), n = lA(), r = Tc(), i = zt(), { typeforce: s } = i, o = new TypeError(
+  if (Np) return mo;
+  Np = 1, Object.defineProperty(mo, "__esModule", { value: !0 }), mo.Block = void 0;
+  const e = Tu(), t = Cr(), n = lA(), r = xc(), i = zt(), { typeforce: s } = i, o = new TypeError(
     "Cannot compute merkle root for zero transactions"
   ), c = new TypeError(
     "Cannot compute witness commit for non-segwit block"
@@ -23962,7 +23962,7 @@ function hA() {
       return this.witnessCommit.compare(d) === 0;
     }
   }
-  go.Block = a;
+  mo.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;
   }
@@ -23973,9 +23973,9 @@ function hA() {
       )
     );
   }
-  return go;
+  return mo;
 }
-var bo = {}, Lc = {}, Vc = {}, Rf = {}, fs = {}, ls = {}, Uf = {}, kp;
+var Eo = {}, Vc = {}, $c = {}, Rf = {}, fs = {}, ls = {}, Uf = {}, kp;
 function qt() {
   return kp || (kp = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), (function(t) {
@@ -24066,10 +24066,10 @@ function dA() {
   }
   return jr.canAddToArray = s, jr;
 }
-var $c = {}, Rp;
+var Dc = {}, Rp;
 function pA() {
-  if (Rp) return $c;
-  Rp = 1, Object.defineProperty($c, "__esModule", { value: !0 });
+  if (Rp) return Dc;
+  Rp = 1, Object.defineProperty(Dc, "__esModule", { value: !0 });
   const e = qt();
   function t(n) {
     return {
@@ -24077,7 +24077,7 @@ function pA() {
       value: n.toBuffer()
     };
   }
-  return $c.encode = t, $c;
+  return Dc.encode = t, Dc;
 }
 var Kr = {}, Up;
 function yA() {
@@ -24587,10 +24587,10 @@ function vA() {
   }
   return ni.canAdd = s, ni;
 }
-var Dc = {}, Xp;
+var jc = {}, Xp;
 function Qw() {
-  if (Xp) return Dc;
-  Xp = 1, Object.defineProperty(Dc, "__esModule", { value: !0 });
+  if (Xp) return jc;
+  Xp = 1, Object.defineProperty(jc, "__esModule", { value: !0 });
   const e = (r) => [...Array(r).keys()], t = (r) => r.length === 33 && [2, 3].includes(r[0]) || r.length === 65 && r[0] === 4;
   function n(r, i = t) {
     function s(f) {
@@ -24647,12 +24647,12 @@ function Qw() {
       canAddToArray: u
     };
   }
-  return Dc.makeConverter = n, Dc;
+  return jc.makeConverter = n, jc;
 }
-var jc = {}, zp;
+var Kc = {}, zp;
 function IA() {
-  if (zp) return jc;
-  zp = 1, Object.defineProperty(jc, "__esModule", { value: !0 });
+  if (zp) return Kc;
+  zp = 1, Object.defineProperty(Kc, "__esModule", { value: !0 });
   function e(t) {
     return n;
     function n(r) {
@@ -24664,12 +24664,12 @@ function IA() {
       return i;
     }
   }
-  return jc.makeChecker = e, jc;
+  return Kc.makeChecker = e, Kc;
 }
-var Kc = {}, Yp;
+var Gc = {}, Yp;
 function OA() {
-  if (Yp) return Kc;
-  Yp = 1, Object.defineProperty(Kc, "__esModule", { value: !0 });
+  if (Yp) return Gc;
+  Yp = 1, Object.defineProperty(Gc, "__esModule", { value: !0 });
   function e(t) {
     function n(c) {
       if (c.key[0] !== t)
@@ -24699,12 +24699,12 @@ function OA() {
       canAdd: o
     };
   }
-  return Kc.makeConverter = e, Kc;
+  return Gc.makeConverter = e, Gc;
 }
-var Gc = {}, Zp;
+var Wc = {}, Zp;
 function BA() {
-  if (Zp) return Gc;
-  Zp = 1, Object.defineProperty(Gc, "__esModule", { value: !0 });
+  if (Zp) return Wc;
+  Zp = 1, Object.defineProperty(Wc, "__esModule", { value: !0 });
   const e = is(), t = Qw(), n = (i) => i.length === 32;
   function r(i) {
     const s = t.makeConverter(i, n);
@@ -24737,12 +24737,12 @@ function BA() {
       canAddToArray: s.canAddToArray
     };
   }
-  return Gc.makeConverter = r, Gc;
+  return Wc.makeConverter = r, Wc;
 }
-var Wc = {}, Jp;
+var Xc = {}, Jp;
 function NA() {
-  if (Jp) return Wc;
-  Jp = 1, Object.defineProperty(Wc, "__esModule", { value: !0 });
+  if (Jp) return Xc;
+  Jp = 1, Object.defineProperty(Xc, "__esModule", { value: !0 });
   function e(t) {
     function n(c) {
       if (c.key[0] !== t || c.key.length !== 1)
@@ -24773,12 +24773,12 @@ function NA() {
       canAdd: o
     };
   }
-  return Wc.makeConverter = e, Wc;
+  return Xc.makeConverter = e, Xc;
 }
-var Xc = {}, Qp;
+var zc = {}, Qp;
 function kA() {
-  if (Qp) return Xc;
-  Qp = 1, Object.defineProperty(Xc, "__esModule", { value: !0 });
+  if (Qp) return zc;
+  Qp = 1, Object.defineProperty(zc, "__esModule", { value: !0 });
   function e(t) {
     function n(c) {
       if (c.key[0] !== t)
@@ -24808,7 +24808,7 @@ function kA() {
       canAdd: o
     };
   }
-  return Xc.makeConverter = e, Xc;
+  return zc.makeConverter = e, zc;
 }
 var ey;
 function Bh() {
@@ -25167,10 +25167,10 @@ function PA() {
   }
   return fs.psbtFromKeyVals = o, fs;
 }
-var Eo = {}, ny;
+var _o = {}, ny;
 function RA() {
-  if (ny) return Eo;
-  ny = 1, Object.defineProperty(Eo, "__esModule", { value: !0 });
+  if (ny) return _o;
+  ny = 1, Object.defineProperty(_o, "__esModule", { value: !0 });
   const e = Bh(), t = Oh();
   function n({ globalMap: o, inputs: c, outputs: a }) {
     const { globalKeyVals: u, inputKeyVals: f, outputKeyVals: l } = s({
@@ -25182,7 +25182,7 @@ function RA() {
       [E, d].concat(g, m)
     );
   }
-  Eo.psbtToBuffer = n;
+  _o.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]) => {
@@ -25207,7 +25207,7 @@ function RA() {
       outputKeyVals: a.map((u) => i(u, e.outputs))
     };
   }
-  return Eo.psbtToKeyVals = s, Eo;
+  return _o.psbtToKeyVals = s, _o;
 }
 var ry;
 function e1() {
@@ -25220,8 +25220,8 @@ function e1() {
 }
 var iy;
 function UA() {
-  if (iy) return Vc;
-  iy = 1, Object.defineProperty(Vc, "__esModule", { value: !0 });
+  if (iy) return $c;
+  iy = 1, Object.defineProperty($c, "__esModule", { value: !0 });
   const e = e1();
   function t(s) {
     const o = s[0], c = e.psbtToKeyVals(o), a = s.slice(1);
@@ -25267,7 +25267,7 @@ function UA() {
       outputKeyVals: c.outputKeyVals
     });
   }
-  Vc.combine = t;
+  $c.combine = t;
   function n(s, o, c) {
     return (a) => {
       if (s.has(a)) return;
@@ -25287,7 +25287,7 @@ function UA() {
       o.add(a);
     }), o;
   }
-  return Vc;
+  return $c;
 }
 var Cf = {}, sy;
 function t1() {
@@ -25391,8 +25391,8 @@ function t1() {
 }
 var oy;
 function CA() {
-  if (oy) return Lc;
-  oy = 1, Object.defineProperty(Lc, "__esModule", { value: !0 });
+  if (oy) return Vc;
+  oy = 1, Object.defineProperty(Vc, "__esModule", { value: !0 });
   const e = UA(), t = e1(), n = qt(), r = t1();
   class i {
     constructor(o) {
@@ -25498,13 +25498,13 @@ function CA() {
       return this.globalMap.unsignedTx.toBuffer();
     }
   }
-  return Lc.Psbt = i, Lc;
+  return Vc.Psbt = i, Vc;
 }
 var Qe = {}, ze = {}, cy;
 function gl() {
   if (cy) return ze;
   cy = 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 = is(), t = rn(), n = Tc(), r = Cr(), i = Sc();
+  const e = is(), t = rn(), n = xc(), r = Cr(), i = Tc();
   function s(y) {
     return (g) => {
       try {
@@ -25581,7 +25581,7 @@ var ay;
 function HA() {
   if (ay) return Qe;
   ay = 1, Object.defineProperty(Qe, "__esModule", { value: !0 }), Qe.checkTaprootInputForSigs = Qe.tapTreeFromList = Qe.tapTreeToList = Qe.tweakInternalPubKey = Qe.checkTaprootOutputFields = Qe.checkTaprootInputFields = Qe.isTaprootOutput = Qe.isTaprootInput = Qe.serializeTaprootSignature = Qe.tapScriptFinalizer = Qe.toXOnly = void 0;
-  const e = zt(), t = Tc(), n = gl(), r = vh(), i = Sc(), s = gl(), o = (x) => x.length === 32 ? x : x.slice(1, 33);
+  const e = zt(), t = xc(), n = gl(), r = vh(), i = Tc(), s = gl(), o = (x) => x.length === 32 ? x : x.slice(1, 33);
   Qe.toXOnly = o;
   function c(x, B, q) {
     const N = P(
@@ -25803,9 +25803,9 @@ function HA() {
 }
 var uy;
 function FA() {
-  if (uy) return bo;
-  uy = 1, Object.defineProperty(bo, "__esModule", { value: !0 }), bo.Psbt = void 0;
-  const e = CA(), t = is(), n = t1(), r = Ih(), i = Tu(), s = Yn(), o = Sc(), c = vh(), a = rn(), u = Tc(), f = HA(), l = gl(), d = {
+  if (uy) return Eo;
+  uy = 1, Object.defineProperty(Eo, "__esModule", { value: !0 }), Eo.Psbt = void 0;
+  const e = CA(), t = is(), n = t1(), r = Ih(), i = Tu(), s = Yn(), o = Tc(), c = vh(), a = rn(), u = xc(), f = HA(), l = gl(), 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.
@@ -26449,7 +26449,7 @@ function FA() {
       return this.data.clearFinalizedInput(h), this;
     }
   }
-  bo.Psbt = y;
+  Eo.Psbt = y;
   const g = (p) => new m(p);
   class m {
     constructor(h = Buffer.from([2, 0, 0, 0, 0, 0, 0, 0, 0, 0])) {
@@ -27002,7 +27002,7 @@ PROCEED WITH CAUTION!
   function k(p) {
     return [...Array(p).keys()];
   }
-  return bo;
+  return Eo;
 }
 var fy;
 function MA() {
@@ -27014,7 +27014,7 @@ function MA() {
     e.crypto = n;
     const r = Yn();
     e.networks = r;
-    const i = Sc();
+    const i = Tc();
     e.payments = i;
     const s = rn();
     e.script = s;
@@ -27039,7 +27039,7 @@ function MA() {
         return a.OPS;
       }
     });
-    var u = Tc();
+    var u = xc();
     Object.defineProperty(e, "Transaction", {
       enumerable: !0,
       get: function() {
@@ -27711,9 +27711,9 @@ function Nh(e) {
   return Array.from(e).map((t) => t.toString(16).padStart(2, "0")).join("");
 }
 function kh(e) {
-  return e === ko.Mainnet ? Un : Vy;
+  return e === Po.Mainnet ? Un : Vy;
 }
-function Ph(e, t = ko.Testnet) {
+function Ph(e, t = Po.Testnet) {
   const n = kh(t);
   return Bg(e, n);
 }
@@ -27752,7 +27752,7 @@ function jA(e, t, n) {
 }
 async function s1(e, t) {
   try {
-    const n = t === ko.Mainnet ? "https://mpc.omnity.network/utxo-status" : "https://mpc.omnity.network/testnet4/utxo-status", r = await dt.post(n, e).then((c) => c.data);
+    const n = t === Po.Mainnet ? "https://mpc.omnity.network/utxo-status" : "https://mpc.omnity.network/testnet4/utxo-status", r = await dt.post(n, e).then((c) => c.data);
     if (!r)
       return null;
     const i = JSON.stringify(r), o = new TextEncoder().encode(i);
@@ -27770,7 +27770,7 @@ const EI = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   getUtxoProof: s1,
   hexToBytes: i1,
   toBitcoinNetwork: kh
-}, Symbol.toStringTag, { value: "Module" })), KA = "kqs64-paaaa-aaaar-qamza-cai", GA = "hvyp5-5yaaa-aaaao-qjxha-cai", zc = BigInt(546), on = "0:0", WA = "https://runescan-hasura-mainnet.omnity.network/v1/graphql", XA = "https://runescan-hasura-testnet.omnity.network/v1/graphql", wy = {
+}, Symbol.toStringTag, { value: "Module" })), KA = "kqs64-paaaa-aaaar-qamza-cai", GA = "hvyp5-5yaaa-aaaao-qjxha-cai", ps = BigInt(546), on = "0:0", WA = "https://runescan-hasura-mainnet.omnity.network/v1/graphql", XA = "https://runescan-hasura-testnet.omnity.network/v1/graphql", wy = {
   P2PKH: 148,
   P2SH_P2WPKH: 91,
   P2WPKH: 68,
@@ -27937,7 +27937,7 @@ class Ri {
           (w, T) => w + BigInt(T.satoshis),
           BigInt(0)
         );
-        S - d > 0 && S - d > zc || (this.outputAddressTypes.pop(), a = !1), l = _;
+        S - d > 0 && S - d > ps || (this.outputAddressTypes.pop(), a = !1), l = _;
       }
     } while (f > u && d > 0);
     this.inputAddressTypes = [...g], a && this.outputAddressTypes.pop();
@@ -27948,7 +27948,7 @@ class Ri {
     const E = m - d;
     if (E < 0)
       throw new Error("Insufficient UTXO(s)");
-    E > zc ? this.addOutput(r, E) : E > BigInt(0) && (y = E), this.txFee = y + f;
+    E > ps ? this.addOutput(r, E) : E > BigInt(0) && (y = E), this.txFee = y + f;
   }
   /**
    * Resolve and fetch all UTXOs required by the current intention set, grouped by address.
@@ -28199,8 +28199,8 @@ class Ri {
       });
       const a = new ds.Runestone(s, ds.none(), ds.none(), ds.none());
       this.addScriptOutput(new Uint8Array(a.encipher())), o.forEach((u) => {
-        const f = t[u]?.[on] ?? BigInt(0), l = u === this.config.address, d = f > BigInt(0) && (!l || n), y = d ? f : zc;
-        this.addOutput(u, y), d ? delete t[u][on] : this.additionalDustNeeded += zc;
+        const f = t[u]?.[on] ?? BigInt(0), l = u === this.config.address, d = f > BigInt(0) && (!l || n), y = d && f > ps ? f : ps;
+        this.addOutput(u, y), d ? delete t[u][on] : this.additionalDustNeeded += ps;
       });
     }
     for (const [s, o] of Object.entries(
@@ -28400,21 +28400,21 @@ class Ri {
     });
   }
 }
-class Ns extends Error {
+class ks extends Error {
   response;
   request;
   constructor(t, n) {
-    const r = `${Ns.extractMessage(t)}: ${JSON.stringify({
+    const r = `${ks.extractMessage(t)}: ${JSON.stringify({
       response: t,
       request: n
     })}`;
-    super(r), Object.setPrototypeOf(this, Ns.prototype), this.response = t, this.request = n, typeof Error.captureStackTrace == "function" && Error.captureStackTrace(this, Ns);
+    super(r), Object.setPrototypeOf(this, ks.prototype), this.response = t, this.request = n, typeof Error.captureStackTrace == "function" && Error.captureStackTrace(this, ks);
   }
   static extractMessage(t) {
     return t.errors?.[0]?.message ?? `GraphQL Error (Code: ${String(t.status)})`;
   }
 }
-const Ey = (e) => e.toUpperCase(), Ff = (e) => typeof e == "function" ? e() : e, o1 = (e, t) => e.map((n, r) => [n, t[r]]), ps = (e) => {
+const Ey = (e) => e.toUpperCase(), Ff = (e) => typeof e == "function" ? e() : e, o1 = (e, t) => e.map((n, r) => [n, t[r]]), ys = (e) => {
   let t = {};
   return e instanceof Headers ? t = ZA(e) : Array.isArray(e) ? e.forEach(([n, r]) => {
     n && r !== void 0 && (t[n] = r);
@@ -28778,10 +28778,10 @@ function xy(e) {
   const t = e?.kind;
   return typeof t == "string" && av.has(t);
 }
-var Es;
+var _s;
 (function(e) {
   e.QUERY = "query", e.MUTATION = "mutation", e.SUBSCRIPTION = "subscription";
-})(Es || (Es = {}));
+})(_s || (_s = {}));
 var wl;
 (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";
@@ -28793,7 +28793,7 @@ var Se;
 function bl(e) {
   return e === 9 || e === 32;
 }
-function Go(e) {
+function Wo(e) {
   return e >= 48 && e <= 57;
 }
 function f1(e) {
@@ -28804,7 +28804,7 @@ function l1(e) {
   return f1(e) || e === 95;
 }
 function uv(e) {
-  return f1(e) || Go(e) || e === 95;
+  return f1(e) || Wo(e) || e === 95;
 }
 function fv(e) {
   var t;
@@ -28887,7 +28887,7 @@ class dv {
 function pv(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 Ys(e) {
+function Zs(e) {
   return e >= 0 && e <= 55295 || e >= 57344 && e <= 1114111;
 }
 function xu(e, t) {
@@ -28997,14 +28997,14 @@ function yv(e, t) {
       case 34:
         return n.charCodeAt(i + 1) === 34 && n.charCodeAt(i + 2) === 34 ? Sv(e, i) : wv(e, i);
     }
-    if (Go(s) || s === 45)
+    if (Wo(s) || s === 45)
       return mv(e, i, s);
     if (l1(s))
       return Tv(e, i);
     throw kt(
       e.source,
       i,
-      s === 39 ? `Unexpected single quote character ('), did you mean to use a double quote (")?` : Ys(s) || xu(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) || xu(n, i) ? `Unexpected character: ${Zi(e, i)}.` : `Invalid character: ${Zi(e, i)}.`
     );
   }
   return Et(e, ee.EOF, r, r);
@@ -29016,7 +29016,7 @@ function gv(e, t) {
     const s = n.charCodeAt(i);
     if (s === 10 || s === 13)
       break;
-    if (Ys(s))
+    if (Zs(s))
       ++i;
     else if (xu(n, i))
       i += 2;
@@ -29035,7 +29035,7 @@ function mv(e, t, n) {
   const r = e.source.body;
   let i = t, s = n, o = !1;
   if (s === 45 && (s = r.charCodeAt(++i)), s === 48) {
-    if (s = r.charCodeAt(++i), Go(s))
+    if (s = r.charCodeAt(++i), Wo(s))
       throw kt(
         e.source,
         i,
@@ -29064,7 +29064,7 @@ function mv(e, t, n) {
   );
 }
 function Mf(e, t, n) {
-  if (!Go(n))
+  if (!Wo(n))
     throw kt(
       e.source,
       t,
@@ -29075,7 +29075,7 @@ function Mf(e, t, n) {
     );
   const r = e.source.body;
   let i = t + 1;
-  for (; Go(r.charCodeAt(i)); )
+  for (; Wo(r.charCodeAt(i)); )
     ++i;
   return i;
 }
@@ -29094,7 +29094,7 @@ function wv(e, t) {
     }
     if (c === 10 || c === 13)
       break;
-    if (Ys(c))
+    if (Zs(c))
       ++i;
     else if (xu(n, i))
       i += 2;
@@ -29116,14 +29116,14 @@ function bv(e, t) {
   for (; i < 12; ) {
     const s = n.charCodeAt(t + i++);
     if (s === 125) {
-      if (i < 5 || !Ys(r))
+      if (i < 5 || !Zs(r))
         break;
       return {
         value: String.fromCodePoint(r),
         size: i
       };
     }
-    if (r = r << 4 | So(s), r < 0)
+    if (r = r << 4 | To(s), r < 0)
       break;
   }
   throw kt(
@@ -29137,7 +29137,7 @@ function bv(e, t) {
 }
 function Ev(e, t) {
   const n = e.source.body, r = Ay(n, t + 2);
-  if (Ys(r))
+  if (Zs(r))
     return {
       value: String.fromCodePoint(r),
       size: 6
@@ -29157,9 +29157,9 @@ function Ev(e, t) {
   );
 }
 function Ay(e, t) {
-  return So(e.charCodeAt(t)) << 12 | So(e.charCodeAt(t + 1)) << 8 | So(e.charCodeAt(t + 2)) << 4 | So(e.charCodeAt(t + 3));
+  return To(e.charCodeAt(t)) << 12 | To(e.charCodeAt(t + 1)) << 8 | To(e.charCodeAt(t + 2)) << 4 | To(e.charCodeAt(t + 3));
 }
-function So(e) {
+function To(e) {
   return e >= 48 && e <= 57 ? e - 48 : e >= 65 && e <= 70 ? e - 55 : e >= 97 && e <= 102 ? e - 87 : -1;
 }
 function _v(e, t) {
@@ -29243,7 +29243,7 @@ function Sv(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 (Ys(u))
+    if (Zs(u))
       ++s;
     else if (xu(n, s))
       s += 2;
@@ -29504,7 +29504,7 @@ class Uv {
     if (this.peek(ee.BRACE_L))
       return this.node(t, {
         kind: Se.OPERATION_DEFINITION,
-        operation: Es.QUERY,
+        operation: _s.QUERY,
         name: void 0,
         variableDefinitions: [],
         directives: [],
@@ -29528,11 +29528,11 @@ class Uv {
     const t = this.expectToken(ee.NAME);
     switch (t.value) {
       case "query":
-        return Es.QUERY;
+        return _s.QUERY;
       case "mutation":
-        return Es.MUTATION;
+        return _s.MUTATION;
       case "subscription":
-        return Es.SUBSCRIPTION;
+        return _s.SUBSCRIPTION;
     }
     throw this.unexpected(t);
   }
@@ -31087,7 +31087,7 @@ ${String(e)}`);
     }
   }, r = await Yv(t.method)(t);
   if (!r.ok)
-    return new Ns({ status: r.status, headers: r.headers }, {
+    return new ks({ status: r.status, headers: r.headers }, {
       query: e.request._tag === "Single" ? e.request.document.expression : e.request.query,
       variables: e.request.variables
     });
@@ -31103,7 +31103,7 @@ ${String(e)}`);
       ...i.executionResult,
       ...s
     };
-    return new Ns(o, {
+    return new ks(o, {
       query: e.request._tag === "Single" ? e.request.document.expression : e.request.query,
       variables: e.request.variables
     });
@@ -31199,8 +31199,8 @@ class Qv {
         variables: s.variables
       },
       headers: {
-        ...ps(Ff(o)),
-        ...ps(s.requestHeaders)
+        ...ys(Ff(o)),
+        ...ys(s.requestHeaders)
       },
       fetch: c,
       method: a,
@@ -31226,8 +31226,8 @@ class Qv {
         variables: s.variables
       },
       headers: {
-        ...ps(Ff(o)),
-        ...ps(s.requestHeaders)
+        ...ys(Ff(o)),
+        ...ys(s.requestHeaders)
       },
       fetch: c,
       method: a,
@@ -31255,8 +31255,8 @@ class Qv {
         variables: f
       },
       headers: {
-        ...ps(Ff(i)),
-        ...ps(r.requestHeaders)
+        ...ys(Ff(i)),
+        ...ys(r.requestHeaders)
       },
       fetch: this.requestConfig.fetch ?? globalThis.fetch,
       method: this.requestConfig.method || "POST",
@@ -31301,7 +31301,7 @@ const e6 = (e, t, n) => e.document ? e : {
  *  Copyright (c) 2025 Michael Mclaughlin <M8ch88l@gmail.com>
  *  MIT Licence
  */
-var _s = 9e15, wi = 1e9, Sl = "0123456789abcdef", La = "2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058", Va = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789", Tl = {
+var Ss = 9e15, wi = 1e9, Sl = "0123456789abcdef", La = "2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058", Va = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789", Tl = {
   // 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.
@@ -31350,11 +31350,11 @@ var _s = 9e15, wi = 1e9, Sl = "0123456789abcdef", La = "2.3025850929940456840179
   // 0 to EXP_LIMIT
   // The minimum exponent value, beneath which underflow to zero occurs.
   // JavaScript numbers: -324  (5e-324)
-  minE: -_s,
+  minE: -Ss,
   // -1 to -EXP_LIMIT
   // The maximum exponent value, above which overflow to Infinity occurs.
   // JavaScript numbers: 308  (1.7976931348623157e+308)
-  maxE: _s,
+  maxE: Ss,
   // 1 to EXP_LIMIT
   // Whether to use cryptographically-secure random number generation, if available.
   crypto: !1
@@ -31437,7 +31437,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 / Ou(4, e)).toString()) : (e = 16, t = "2.3283064365386962890625e-10"), s = qs(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 / Ou(4, e)).toString()) : (e = 16, t = "2.3283064365386962890625e-10"), s = Ls(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);
@@ -31446,9 +31446,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 = qs(s, 2, i, i, !0);
+    i = Ls(s, 2, i, i, !0);
   else {
-    e = 1.4 * Math.sqrt(r), e = e > 16 ? 16 : e | 0, i = i.times(1 / Ou(5, e)), i = qs(s, 2, i, i, !0);
+    e = 1.4 * Math.sqrt(r), e = e > 16 ? 16 : e | 0, i = i.times(1 / Ou(5, e)), i = Ls(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))));
   }
@@ -31536,13 +31536,13 @@ se.logarithm = se.log = function(e) {
       for (i = n[0]; i % 10 === 0; ) i /= 10;
       s = i !== 1;
     }
-  if (ve = !1, c = l + y, o = ai(u, c), r = t ? $a(f, c + 10) : ai(e, c), a = Ze(o, r, c, 1), Wo(a.d, i = l, d))
+  if (ve = !1, c = l + y, o = ai(u, c), r = t ? $a(f, c + 10) : ai(e, c), a = Ze(o, r, c, 1), Xo(a.d, i = l, d))
     do
       if (c += 10, o = ai(u, c), r = t ? $a(f, c + 10) : ai(e, c), a = Ze(o, r, c, 1), !s) {
         +Ft(a.d).slice(i + 1, i + 15) + 1 == 1e14 && (a = be(a, l + 1, 0));
         break;
       }
-    while (Wo(a.d, i += 10, d));
+    while (Xo(a.d, i += 10, d));
   return ve = !0, be(a, l, d);
 };
 se.minus = se.sub = function(e) {
@@ -31720,7 +31720,7 @@ se.toPower = se.pow = function(e) {
     if ((e.d[t] & 1) == 0 && (o = 1), c.e == 0 && c.d[0] == 1 && c.d.length == 1)
       return c.s = o, c;
   }
-  return n = At(+c, u), t = n == 0 || !isFinite(n) ? Xt(u * (Math.log("0." + Ft(c.d)) / Math.LN10 + c.e + 1)) : new a(n + "").e, t > a.maxE + 1 || t < a.minE - 1 ? new a(t > 0 ? o / 0 : 0) : (ve = !1, a.rounding = c.s = 1, n = Math.min(12, (t + "").length), i = Al(e.times(ai(c, r + n)), r), i.d && (i = be(i, r + 5, 1), Wo(i.d, r, s) && (t = r + 10, i = be(Al(e.times(ai(c, t + n)), t), t + 5, 1), +Ft(i.d).slice(r + 1, r + 15) + 1 == 1e14 && (i = be(i, r + 1, 0)))), i.s = o, ve = !0, a.rounding = s, be(i, r, s));
+  return n = At(+c, u), t = n == 0 || !isFinite(n) ? Xt(u * (Math.log("0." + Ft(c.d)) / Math.LN10 + c.e + 1)) : new a(n + "").e, t > a.maxE + 1 || t < a.minE - 1 ? new a(t > 0 ? o / 0 : 0) : (ve = !1, a.rounding = c.s = 1, n = Math.min(12, (t + "").length), i = Al(e.times(ai(c, r + n)), r), i.d && (i = be(i, r + 5, 1), Xo(i.d, r, s) && (t = r + 10, i = be(Al(e.times(ai(c, t + n)), t), t + 5, 1), +Ft(i.d).slice(r + 1, r + 15) + 1 == 1e14 && (i = be(i, r + 1, 0)))), i.s = o, ve = !0, a.rounding = s, be(i, r, s));
 };
 se.toPrecision = function(e, t) {
   var n, r = this, i = r.constructor;
@@ -31756,7 +31756,7 @@ function gn(e, t, n) {
   if (e !== ~~e || e < t || e > n)
     throw Error(pi + e);
 }
-function Wo(e, t, n, r) {
+function Xo(e, t, n, r) {
   var i, s, o, c;
   for (s = e[0]; s >= 10; s /= 10) --t;
   return --t < 0 ? (t += _e, i = 0) : (i = Math.ceil((t + 1) / _e), t %= _e), s = At(10, _e - t), c = e[i] % s | 0, r == null ? t < 3 ? (t == 0 ? c = c / 100 | 0 : t == 1 && (c = c / 10 | 0), o = n < 4 && c == 99999 || n > 3 && c == 49999 || c == 5e4 || c == 0) : o = (n < 4 && c + 1 == s || n > 3 && c + 1 == s / 2) && (e[i + 1] / s / 100 | 0) == At(10, t - 2) - 1 || (c == s / 2 || c == 0) && (e[i + 1] / s / 100 | 0) == 0 : t < 4 ? (t == 0 ? c = c / 1e3 | 0 : t == 1 ? c = c / 100 | 0 : t == 2 && (c = c / 10 | 0), o = (r || n < 4) && c == 9999 || !r && n > 3 && c == 4999) : o = ((r || n < 4) && c + 1 == s || !r && n > 3 && c + 1 == s / 2) && (e[i + 1] / s / 1e3 | 0) == At(10, t - 3) - 1, o;
@@ -31772,7 +31772,7 @@ function ua(e, t, n) {
 function c6(e, t) {
   var n, r, i;
   if (t.isZero()) return t;
-  r = t.d.length, r < 32 ? (n = Math.ceil(r / 3), i = (1 / Ou(4, n)).toString()) : (n = 16, i = "2.3283064365386962890625e-10"), e.precision += n, t = qs(e, 1, t.times(i), new e(1));
+  r = t.d.length, r < 32 ? (n = Math.ceil(r / 3), i = (1 / Ou(4, n)).toString()) : (n = 16, i = "2.3283064365386962890625e-10"), e.precision += n, t = Ls(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);
@@ -31940,7 +31940,7 @@ function Al(e, t) {
     if (s = be(s.times(e), a, 1), n = n.times(++f), c = o.plus(Ze(s, n, a, 1)), Ft(c.d).slice(0, a) === Ft(o.d).slice(0, a)) {
       for (i = l; i--; ) o = be(o.times(o), a, 1);
       if (t == null)
-        if (u < 3 && Wo(o.d, a - r, y, u))
+        if (u < 3 && Xo(o.d, a - r, y, u))
           d.precision = a += 10, n = s = c = new d(1), f = 0, u++;
         else
           return be(o, d.precision = g, y, ve = !0);
@@ -31963,7 +31963,7 @@ function ai(e, t) {
   for (l = m, a = o = m = Ze(m.minus(1), m.plus(1), f, 1), d = be(m.times(m), f, 1), i = 3; ; ) {
     if (o = be(o.times(d), f, 1), u = a.plus(Ze(o, new _(i), f, 1)), Ft(u.d).slice(0, f) === Ft(a.d).slice(0, f))
       if (a = a.times(2), s !== 0 && (a = a.plus($a(_, f + 2, w).times(s + ""))), a = Ze(a, new _(y), f, 1), t == null)
-        if (Wo(a.d, f - g, S, c))
+        if (Xo(a.d, f - g, S, c))
           _.precision = f += g, u = o = m = Ze(l.minus(1), l.plus(1), f, 1), d = be(m.times(m), f, 1), i = c = 1;
         else
           return be(a, _.precision = w, S, ve = !0);
@@ -32011,13 +32011,13 @@ function a6(e, t) {
 function u6(e, t) {
   var n, r = t.d.length;
   if (r < 3)
-    return t.isZero() ? t : qs(e, 2, t, t);
-  n = 1.4 * Math.sqrt(r), n = n > 16 ? 16 : n | 0, t = t.times(1 / Ou(5, n)), t = qs(e, 2, t, t);
+    return t.isZero() ? t : Ls(e, 2, t, t);
+  n = 1.4 * Math.sqrt(r), n = n > 16 ? 16 : n | 0, t = t.times(1 / Ou(5, n)), t = Ls(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 qs(e, t, n, r, i) {
+function Ls(e, t, n, r, i) {
   var s, o, c, a, u = e.precision, f = Math.ceil(u / _e);
   for (ve = !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) {
@@ -32130,16 +32130,16 @@ function S6(e) {
     0,
     8,
     "toExpNeg",
-    -_s,
+    -Ss,
     0,
     "toExpPos",
     0,
-    _s,
+    Ss,
     "maxE",
     0,
-    _s,
+    Ss,
     "minE",
-    -_s,
+    -Ss,
     0,
     "modulo",
     0,
@@ -32694,7 +32694,7 @@ class Y6 {
    */
   constructor(t) {
     this.config = t;
-    const n = t.network === ko.Testnet, r = n ? "https://xbt-testnet.gomaestro-api.org/v0" : "https://xbt-mainnet.gomaestro-api.org/v0";
+    const n = t.network === Po.Testnet, r = n ? "https://xbt-testnet.gomaestro-api.org/v0" : "https://xbt-mainnet.gomaestro-api.org/v0";
     this.maestro = new ax({
       baseUrl: r,
       apiKey: t.maestroApiKey
@@ -32862,7 +32862,7 @@ class Y6 {
    * @returns Array of matching rune information
    */
   async searchRunes(t) {
-    const n = this.config.network === ko.Testnet ? XA : WA, r = t6`
+    const n = this.config.network === Po.Testnet ? XA : WA, r = t6`
       query GetRunes($keyword: String!, $regex: String!) {
         runes(
           where: {
@@ -33299,7 +33299,7 @@ function NI(e = {}) {
   };
 }
 export {
-  ko as Network,
+  Po as Network,
   Y6 as ReeClient,
   _I as ReeProvider,
   Ri as Transaction,