@omnity/ree-client-ts-sdk 0.5.6 → 0.5.8

package/dist/index.es.js

@@ -78,11 +78,11 @@ function v1() {
   }
   return Xs;
 }
-var _c = {};
+var Sc = {};
 /*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */
 var Vh;
 function I1() {
-  return Vh || (Vh = 1, _c.read = function(e, t, n, r, i) {
+  return Vh || (Vh = 1, Sc.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)
       ;
@@ -96,14 +96,14 @@ function I1() {
       o = o + Math.pow(2, r), s = s - u;
     }
     return (y ? -1 : 1) * o * Math.pow(2, s - r);
-  }, _c.write = function(e, t, n, r, i, s) {
+  }, Sc.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;
-  }), _c;
+  }), Sc;
 }
 /*!
  * The buffer module from node.js, for the browser.
@@ -112,7 +112,7 @@ function I1() {
  * @license  MIT
  */
 var Lh;
-function ec() {
+function tc() {
   return Lh || (Lh = 1, (function(e) {
     const t = v1(), n = I1(), 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;
@@ -1052,7 +1052,7 @@ function ec() {
     }
   })(vu)), vu;
 }
-var O1 = ec(), Iu = { exports: {} }, $h;
+var O1 = tc(), Iu = { exports: {} }, $h;
 function B1() {
   if ($h) return Iu.exports;
   $h = 1;
@@ -2086,7 +2086,7 @@ function Fs() {
   })(Pu)), Pu;
 }
 var Sn = {}, Je = {}, Yh;
-function tc() {
+function nc() {
   if (Yh) return Je;
   Yh = 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 = V, 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) */
@@ -2356,7 +2356,7 @@ function C1() {
   if (Zh) return Sn;
   Zh = 1, Object.defineProperty(Sn, "__esModule", { value: !0 }), Sn.wNAF = void 0, Sn.negateCt = i, Sn.normalizeZ = s, Sn.mulEndoUnsafe = E, Sn.pippenger = _, Sn.precomputeMSMUnsafe = S, Sn.validateBasic = w, Sn._createCurveFields = O;
   /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-  const e = /* @__PURE__ */ Fs(), t = /* @__PURE__ */ tc(), n = BigInt(0), r = BigInt(1);
+  const e = /* @__PURE__ */ Fs(), t = /* @__PURE__ */ nc(), n = BigInt(0), r = BigInt(1);
   function i(A, R) {
     const M = R.negate();
     return A ? M : R;
@@ -2596,7 +2596,7 @@ function Cy() {
   return Jh || (Jh = 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 = V, e.weierstrass = $;
     /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-    const t = /* @__PURE__ */ U1(), n = /* @__PURE__ */ ai(), r = /* @__PURE__ */ Fs(), i = /* @__PURE__ */ C1(), s = /* @__PURE__ */ tc(), o = (P, D) => (P + (P >= 0 ? D : -D) / y) / D;
+    const t = /* @__PURE__ */ U1(), n = /* @__PURE__ */ ai(), r = /* @__PURE__ */ Fs(), i = /* @__PURE__ */ C1(), s = /* @__PURE__ */ nc(), o = (P, D) => (P + (P >= 0 ? D : -D) / y) / D;
     function c(P, D, F) {
       const [[x, B], [q, N]] = D, L = o(N * P, F), G = o(-B * P, F);
       let X = P - L * x - G * q, Y = -L * B - G * N;
@@ -3477,7 +3477,7 @@ var Ru = {}, ed;
 function F1() {
   return ed || (ed = 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__ */ Fs(), n = /* @__PURE__ */ tc(), r = t.bytesToNumberBE;
+    const t = /* @__PURE__ */ Fs(), n = /* @__PURE__ */ nc(), 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);
@@ -3607,7 +3607,7 @@ function M1() {
   return td || (td = 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__ */ Uy(), n = /* @__PURE__ */ ai(), r = /* @__PURE__ */ H1(), i = /* @__PURE__ */ F1(), s = /* @__PURE__ */ tc(), o = /* @__PURE__ */ Cy(), c = /* @__PURE__ */ Fs(), a = {
+    const t = /* @__PURE__ */ Uy(), n = /* @__PURE__ */ ai(), r = /* @__PURE__ */ H1(), i = /* @__PURE__ */ F1(), s = /* @__PURE__ */ nc(), o = /* @__PURE__ */ Cy(), c = /* @__PURE__ */ Fs(), a = {
       p: BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),
       n: BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),
       h: BigInt(1),
@@ -3775,7 +3775,7 @@ var rd;
 function V1() {
   if (rd) return st;
   rd = 1;
-  var e = /* @__PURE__ */ M1(), t = /* @__PURE__ */ tc(), n = /* @__PURE__ */ q1();
+  var e = /* @__PURE__ */ M1(), t = /* @__PURE__ */ nc(), n = /* @__PURE__ */ q1();
   function r(p) {
     var h = /* @__PURE__ */ Object.create(null);
     return p && Object.keys(p).forEach(function(b) {
@@ -4416,7 +4416,7 @@ function J1(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 nc(e, t, n, r) {
+function rc(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)
@@ -4499,7 +4499,7 @@ function Ky(e) {
 }
 function nb(e, t, n) {
   const r = Ky(t);
-  return r === 1 ? bn(e, n, t) : r === 2 ? (bn(e, n, Ge.OP_PUSHDATA1), bn(e, n + 1, t)) : r === 3 ? (bn(e, n, Ge.OP_PUSHDATA2), J1(e, n + 1, t, "LE")) : (bn(e, n, Ge.OP_PUSHDATA4), nc(e, n + 1, t, "LE")), r;
+  return r === 1 ? bn(e, n, t) : r === 2 ? (bn(e, n, Ge.OP_PUSHDATA1), bn(e, n + 1, t)) : r === 3 ? (bn(e, n, Ge.OP_PUSHDATA2), J1(e, n + 1, t, "LE")) : (bn(e, n, Ge.OP_PUSHDATA4), rc(e, n + 1, t, "LE")), r;
 }
 function rb(e, t) {
   const n = vr(e, t);
@@ -4554,12 +4554,12 @@ var lb;
 function hb(e, t) {
   return lb?.get(e)?.get(t);
 }
-function xo(e) {
+function Ao(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 Gt(e, t, n, r, i) {
-  const s = i && "input" in i ? i.input : n.value, o = i?.expected ?? e.expects ?? null, c = i?.received ?? xo(s), a = {
+  const s = i && "input" in i ? i.input : n.value, o = i?.expected ?? e.expects ?? null, c = i?.received ?? Ao(s), a = {
     kind: e.kind,
     type: e.type,
     input: s,
@@ -4645,12 +4645,12 @@ function $a(e, t) {
     type: "max_value",
     reference: $a,
     async: !1,
-    expects: `<=${e instanceof Date ? e.toJSON() : xo(e)}`,
+    expects: `<=${e instanceof Date ? e.toJSON() : Ao(e)}`,
     requirement: e,
     message: t,
     _run(n, r) {
       return n.typed && n.value > this.requirement && Gt(this, "value", n, r, {
-        received: n.value instanceof Date ? n.value.toJSON() : xo(n.value)
+        received: n.value instanceof Date ? n.value.toJSON() : Ao(n.value)
       }), n;
     }
   };
@@ -4661,12 +4661,12 @@ function Da(e, t) {
     type: "min_value",
     reference: Da,
     async: !1,
-    expects: `>=${e instanceof Date ? e.toJSON() : xo(e)}`,
+    expects: `>=${e instanceof Date ? e.toJSON() : Ao(e)}`,
     requirement: e,
     message: t,
     _run(n, r) {
       return n.typed && n.value < this.requirement && Gt(this, "value", n, r, {
-        received: n.value instanceof Date ? n.value.toJSON() : xo(n.value)
+        received: n.value instanceof Date ? n.value.toJSON() : Ao(n.value)
       }), n;
     }
   };
@@ -5040,7 +5040,7 @@ function qs(...e) {
 const sd = new Uint8Array(32), od = kr(
   "fffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"
 ), At = (e) => qs(Ka(Uint8Array), Wy(e));
-function Ao(e, t) {
+function vo(e, t) {
   return e.length !== t.length ? !1 : e.every((n, r) => de(n, t[r]) === 0);
 }
 function Dn(e) {
@@ -5052,9 +5052,9 @@ function Dn(e) {
   const r = e.slice(33);
   return de(sd, r) === 0 || de(r, od) >= 0 ? !1 : t === 4 && e.length === 65;
 }
-const Wc = 254;
+const Xc = 254;
 function vl(e) {
-  return !e || !("output" in e) || !(e.output instanceof Uint8Array) ? !1 : e.version !== void 0 ? (e.version & Wc) === e.version : !0;
+  return !e || !("output" in e) || !(e.output instanceof Uint8Array) ? !1 : e.version !== void 0 ? (e.version & Xc) === e.version : !0;
 }
 function Jy(e) {
   return Array.isArray(e) ? e.length !== 2 ? !1 : e.every((t) => Jy(t)) : vl(e);
@@ -5207,7 +5207,7 @@ function Ol(e) {
 function Ir(e) {
   return !(e instanceof Uint8Array) || !Ol(e[e.length - 1]) ? !1 : j1(e.slice(0, -1));
 }
-const Eo = Eb;
+const _o = Eb;
 function Te(e, t, n) {
   Object.defineProperty(e, t, {
     configurable: !0,
@@ -5230,7 +5230,7 @@ function In(e) {
   let t;
   return () => (t !== void 0 || (t = e()), t);
 }
-const hs = Ge, Sc = hs.OP_RESERVED;
+const hs = Ge, Tc = hs.OP_RESERVED;
 function Ga(e, t) {
   if (!e.input && !e.output && !(e.pubkeys && e.m !== void 0) && !e.signatures)
     throw new TypeError("Not enough data");
@@ -5258,15 +5258,15 @@ function Ga(e, t) {
   const i = { network: e.network || Pn };
   let s = [], o = !1;
   function c(a) {
-    o || (o = !0, s = lt(a), i.m = s[0] - Sc, i.n = s[s.length - 2] - Sc, i.pubkeys = s.slice(1, -2));
+    o || (o = !0, s = lt(a), i.m = s[0] - Tc, i.n = s[s.length - 2] - Tc, i.pubkeys = s.slice(1, -2));
   }
   if (Te(i, "output", () => {
     if (e.m && i.n && e.pubkeys)
       return tn(
         [].concat(
-          Sc + e.m,
+          Tc + e.m,
           e.pubkeys,
-          Sc + i.n,
+          Tc + i.n,
           hs.OP_CHECKMULTISIG
         )
       );
@@ -5303,7 +5303,7 @@ function Ga(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 && !Ao(e.pubkeys, i.pubkeys))
+      if (e.pubkeys && !vo(e.pubkeys, i.pubkeys))
         throw new TypeError("Pubkeys mismatch");
     }
     if (e.pubkeys) {
@@ -5321,7 +5321,7 @@ function Ga(e, t) {
       if (e.input[0] !== hs.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 && !Ao(e.signatures, i.signatures))
+      if (e.signatures && !vo(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");
@@ -5384,7 +5384,7 @@ function ig(e, t) {
 }
 const ns = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function rc(e) {
+function ic(e) {
   return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
 }
 function vb(e) {
@@ -5392,7 +5392,7 @@ function vb(e) {
     throw new Error("positive integer expected, got " + e);
 }
 function On(e, ...t) {
-  if (!rc(e))
+  if (!ic(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);
@@ -5419,7 +5419,7 @@ function Hu(e) {
 function zn(e, t) {
   return e << 32 - t | e >>> t;
 }
-function Tc(e, t) {
+function xc(e, t) {
   return e << t | e >>> 32 - t >>> 0;
 }
 const sg = /* @ts-ignore */ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", Ob = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
@@ -5440,7 +5440,7 @@ function pd(e) {
   if (e >= sr.a && e <= sr.f)
     return e - (sr.a - 10);
 }
-function ic(e) {
+function sc(e) {
   if (typeof e != "string")
     throw new Error("hex string expected, got " + typeof e);
   if (sg)
@@ -5636,7 +5636,7 @@ const Rr = /* @__PURE__ */ Uint32Array.from([
 function yd(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 xc = /* @__PURE__ */ new Uint32Array(16);
+const Ac = /* @__PURE__ */ new Uint32Array(16);
 class qb extends Bl {
   constructor() {
     super(64, 20, 8, !0), this.h0 = 1732584193, this.h1 = -271733879, this.h2 = -1732584194, this.h3 = 271733878, this.h4 = -1009589776;
@@ -5650,31 +5650,31 @@ class qb extends Bl {
   }
   process(t, n) {
     for (let y = 0; y < 16; y++, n += 4)
-      xc[y] = t.getUint32(n, !0);
+      Ac[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 = Fb[y], E = Mb[y], _ = fg[y], S = lg[y], w = Cb[y], T = Hb[y];
       for (let O = 0; O < 16; O++) {
-        const A = Tc(r + yd(y, s, c, u) + xc[_[O]] + m, w[O]) + l | 0;
-        r = l, l = u, u = Tc(c, 10) | 0, c = s, s = A;
+        const A = xc(r + yd(y, s, c, u) + Ac[_[O]] + m, w[O]) + l | 0;
+        r = l, l = u, u = xc(c, 10) | 0, c = s, s = A;
       }
       for (let O = 0; O < 16; O++) {
-        const A = Tc(i + yd(g, o, a, f) + xc[S[O]] + E, T[O]) + d | 0;
-        i = d, d = f, f = Tc(a, 10) | 0, a = o, o = A;
+        const A = xc(i + yd(g, o, a, f) + Ac[S[O]] + E, T[O]) + d | 0;
+        i = d, d = f, f = xc(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() {
-    Li(xc);
+    Li(Ac);
   }
   destroy() {
     this.destroyed = !0, Li(this.buffer), this.set(0, 0, 0, 0, 0);
   }
 }
-const Vb = /* @__PURE__ */ Wa(() => new qb()), Lb = Vb, Ac = /* @__PURE__ */ BigInt(2 ** 32 - 1), gd = /* @__PURE__ */ BigInt(32);
+const Vb = /* @__PURE__ */ Wa(() => new qb()), Lb = Vb, vc = /* @__PURE__ */ BigInt(2 ** 32 - 1), gd = /* @__PURE__ */ BigInt(32);
 function $b(e, t = !1) {
-  return t ? { h: Number(e & Ac), l: Number(e >> gd & Ac) } : { h: Number(e >> gd & Ac) | 0, l: Number(e & Ac) | 0 };
+  return t ? { h: Number(e & vc), l: Number(e >> gd & vc) } : { h: Number(e >> gd & vc) | 0, l: Number(e & vc) | 0 };
 }
 function Db(e, t = !1) {
   const n = e.length;
@@ -5685,7 +5685,7 @@ function Db(e, t = !1) {
   }
   return [r, i];
 }
-const md = (e, t, n) => e >>> n, wd = (e, t, n) => e << 32 - n | t >>> n, rs = (e, t, n) => e >>> n | t << 32 - n, is = (e, t, n) => e << 32 - n | t >>> n, vc = (e, t, n) => e << 64 - n | t >>> n - 32, Ic = (e, t, n) => e >>> n - 32 | t << 64 - n;
+const md = (e, t, n) => e >>> n, wd = (e, t, n) => e << 32 - n | t >>> n, rs = (e, t, n) => e >>> n | t << 32 - n, is = (e, t, n) => e << 32 - n | t >>> n, Ic = (e, t, n) => e << 64 - n | t >>> n - 32, Oc = (e, t, n) => e >>> n - 32 | t << 64 - n;
 function or(e, t, n, r) {
   const i = (t >>> 0) + (r >>> 0);
   return { h: e + n + (i / 2 ** 32 | 0) | 0, l: i | 0 };
@@ -5893,12 +5893,12 @@ class e2 extends Bl {
     for (let w = 0; w < 16; w++, n += 4)
       Hr[w] = t.getUint32(n), Fr[w] = t.getUint32(n += 4);
     for (let w = 16; w < 80; w++) {
-      const T = Hr[w - 15] | 0, O = Fr[w - 15] | 0, A = rs(T, O, 1) ^ rs(T, O, 8) ^ md(T, O, 7), R = is(T, O, 1) ^ is(T, O, 8) ^ wd(T, O, 7), M = Hr[w - 2] | 0, v = Fr[w - 2] | 0, U = rs(M, v, 19) ^ vc(M, v, 61) ^ md(M, v, 6), V = is(M, v, 19) ^ Ic(M, v, 61) ^ wd(M, v, 6), K = Gb(R, V, Fr[w - 7], Fr[w - 16]), H = Wb(K, A, U, Hr[w - 7], Hr[w - 16]);
+      const T = Hr[w - 15] | 0, O = Fr[w - 15] | 0, A = rs(T, O, 1) ^ rs(T, O, 8) ^ md(T, O, 7), R = is(T, O, 1) ^ is(T, O, 8) ^ wd(T, O, 7), M = Hr[w - 2] | 0, v = Fr[w - 2] | 0, U = rs(M, v, 19) ^ Ic(M, v, 61) ^ md(M, v, 6), V = is(M, v, 19) ^ Oc(M, v, 61) ^ wd(M, v, 6), K = Gb(R, V, Fr[w - 7], Fr[w - 16]), H = Wb(K, A, U, Hr[w - 7], Hr[w - 16]);
       Hr[w] = H | 0, Fr[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 = rs(l, d, 14) ^ rs(l, d, 18) ^ vc(l, d, 41), O = is(l, d, 14) ^ is(l, d, 18) ^ Ic(l, d, 41), A = l & y ^ ~l & m, R = d & g ^ ~d & E, M = Xb(S, O, R, Qb[w], Fr[w]), v = zb(M, _, T, A, Jb[w], Hr[w]), U = M | 0, V = rs(r, i, 28) ^ vc(r, i, 34) ^ vc(r, i, 39), K = is(r, i, 28) ^ Ic(r, i, 34) ^ Ic(r, i, 39), H = r & s ^ r & c ^ s & c, $ = i & o ^ i & a ^ o & a;
+      const T = rs(l, d, 14) ^ rs(l, d, 18) ^ Ic(l, d, 41), O = is(l, d, 14) ^ is(l, d, 18) ^ Oc(l, d, 41), A = l & y ^ ~l & m, R = d & g ^ ~d & E, M = Xb(S, O, R, Qb[w], Fr[w]), v = zb(M, _, T, A, Jb[w], Hr[w]), U = M | 0, V = rs(r, i, 28) ^ Ic(r, i, 34) ^ Ic(r, i, 39), K = is(r, i, 28) ^ Oc(r, i, 34) ^ Oc(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 } = or(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 = jb(U, K, $);
       r = Kb(P, v, V, H), i = P | 0;
@@ -6633,8 +6633,8 @@ function o2(e) {
 function c2(e) {
   return Qt(Qt(e));
 }
-const vo = o2(c2), Mr = Ge;
-function sc(e, t) {
+const Io = o2(c2), Mr = Ge;
+function oc(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 || {}), ct(
@@ -6652,13 +6652,13 @@ function sc(e, t) {
     e
   );
   const n = In(() => {
-    const o = vo.decode(e.address), c = vr(o, 0), a = o.slice(1);
+    const o = Io.decode(e.address), c = vr(o, 0), a = o.slice(1);
     return { version: c, hash: a };
   }), r = In(() => lt(e.input)), i = e.network || Pn, s = { name: "p2pkh", network: i };
   if (Te(s, "address", () => {
     if (!s.hash) return;
     const o = new Uint8Array(21);
-    return bn(o, 0, i.pubKeyHash), o.set(s.hash, 1), vo.encode(o);
+    return bn(o, 0, i.pubKeyHash), o.set(s.hash, 1), Io.encode(o);
   }), Te(s, "hash", () => {
     if (e.output) return e.output.slice(3, 23);
     if (e.address) return n().hash;
@@ -6729,7 +6729,7 @@ function sc(e, t) {
   return Object.assign(s, e);
 }
 const Zs = Ge;
-function oc(e, t) {
+function cc(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 || {}), ct(
@@ -6756,7 +6756,7 @@ function oc(e, t) {
   let n = e.network;
   n || (n = e.redeem && e.redeem.network || Pn);
   const r = { network: n }, i = In(() => {
-    const c = vo.decode(e.address), a = vr(c, 0), u = c.slice(1);
+    const c = Io.decode(e.address), a = vr(c, 0), u = c.slice(1);
     return { version: a, hash: u };
   }), s = In(() => lt(e.input)), o = In(() => {
     const c = s(), a = c[c.length - 1];
@@ -6770,7 +6770,7 @@ function oc(e, t) {
   if (Te(r, "address", () => {
     if (!r.hash) return;
     const c = new Uint8Array(21);
-    return bn(c, 0, r.network.scriptHash), c.set(r.hash, 1), vo.encode(c);
+    return bn(c, 0, r.network.scriptHash), c.set(r.hash, 1), Io.encode(c);
   }), Te(r, "hash", () => {
     if (e.output) return e.output.slice(2, 22);
     if (e.address) return i().hash;
@@ -6862,13 +6862,13 @@ function oc(e, t) {
       }
       a(e.redeem);
     }
-    if (e.witness && e.redeem && e.redeem.witness && !Ao(e.redeem.witness, e.witness))
+    if (e.witness && e.redeem && e.redeem.witness && !vo(e.redeem.witness, e.witness))
       throw new TypeError("Witness and redeem.witness mismatch");
   }
   return Object.assign(r, e);
 }
 var wi = {}, bd;
-function cc() {
+function ac() {
   if (bd) return wi;
   bd = 1, Object.defineProperty(wi, "__esModule", { value: !0 }), wi.bech32m = wi.bech32 = void 0;
   const e = "qpzry9x8gf2tvdw0s3jn54khce6mua7l", t = {};
@@ -7002,7 +7002,7 @@ function cc() {
   }
   return wi.bech32 = a("bech32"), wi.bech32m = a("bech32m"), wi;
 }
-var Kt = cc();
+var Kt = ac();
 const Ed = Ge, a2 = new Uint8Array(0);
 function za(e, t) {
   if (!e.address && !e.hash && !e.output && !e.pubkey && !e.witness)
@@ -7102,10 +7102,10 @@ function za(e, t) {
   return Object.assign(i, e);
 }
 const _d = Ge, Mu = new Uint8Array(0);
-function Oc(e) {
+function Bc(e) {
   return !!(e instanceof Uint8Array && e.length === 65 && e[0] === 4 && Dn(e));
 }
-function ac(e, t) {
+function uc(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 || {}), ct(
@@ -7215,10 +7215,10 @@ function ac(e, t) {
       }
       if (e.redeem.input && !Il(r()))
         throw new TypeError("Non push-only scriptSig");
-      if (e.witness && e.redeem.witness && !Ao(e.witness, e.redeem.witness))
+      if (e.witness && e.redeem.witness && !vo(e.witness, e.redeem.witness))
         throw new TypeError("Witness and redeem.witness mismatch");
-      if (e.redeem.input && r().some(Oc) || e.redeem.output && (lt(e.redeem.output) || []).some(
-        Oc
+      if (e.redeem.input && r().some(Bc) || e.redeem.output && (lt(e.redeem.output) || []).some(
+        Bc
       ))
         throw new TypeError(
           "redeem.input or redeem.output contains uncompressed pubkey"
@@ -7228,22 +7228,22 @@ function ac(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(Oc) || (lt(c) || []).some(Oc))
+      if (e.witness.some(Bc) || (lt(c) || []).some(Bc))
         throw new TypeError("Witness contains uncompressed pubkey");
     }
   }
   return Object.assign(s, e);
 }
-const _o = {};
+const So = {};
 function u2(e) {
-  e ? e !== _o.eccLib && (f2(e), _o.eccLib = e) : _o.eccLib = e;
+  e ? e !== So.eccLib && (f2(e), So.eccLib = e) : So.eccLib = e;
 }
 function qf() {
-  if (!_o.eccLib)
+  if (!So.eccLib)
     throw new Error(
       "No ECC Library provided. You must call initEccLib() with a valid TinySecp256k1Interface instance"
     );
-  return _o.eccLib;
+  return So.eccLib;
 }
 const cr = (e) => kr(e);
 function f2(e) {
@@ -7449,7 +7449,7 @@ class $t {
     this.offset = Dy(this.buffer, this.offset, BigInt(t), "LE");
   }
   writeUInt32(t) {
-    this.offset = nc(this.buffer, this.offset, t, "LE");
+    this.offset = rc(this.buffer, this.offset, t, "LE");
   }
   writeUInt64(t) {
     this.offset = Q1(this.buffer, this.offset, BigInt(t), "LE");
@@ -7568,7 +7568,7 @@ function A2(e, t) {
     at(t ? [e, t] : [e])
   );
 }
-function Bc(e, t) {
+function Nc(e, t) {
   if (!(e instanceof Uint8Array) || e.length !== 32 || t && t.length !== 32) return null;
   const n = A2(e, t), r = qf().xOnlyPointAddTweak(e, n);
   return !r || r.xOnlyPubkey === null ? null : {
@@ -7584,7 +7584,7 @@ function v2(e) {
   return fi(e.length, n), at([n, e]);
 }
 const Td = Ge, xd = 1, I2 = 80;
-function uc(e, t) {
+function fc(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 || {}), ct(
@@ -7635,7 +7635,7 @@ function uc(e, t) {
     if (c) return c.hash;
     const a = r();
     if (a && a.length > 1) {
-      const u = a[a.length - 1], f = u[0] & Wc, l = a[a.length - 2], d = Er({ output: l, version: f });
+      const u = a[a.length - 1], f = u[0] & Xc, l = a[a.length - 2], d = Er({ output: l, version: f });
       return Vf(u, d);
     }
     return null;
@@ -7648,14 +7648,14 @@ function uc(e, t) {
       return {
         output: c[c.length - 2],
         witness: c.slice(0, -2),
-        redeemVersion: c[c.length - 1][0] & Wc
+        redeemVersion: c[c.length - 1][0] & Xc
       };
   }), Te(o, "pubkey", () => {
     if (e.pubkey) return e.pubkey;
     if (e.output) return e.output.slice(2);
     if (e.address) return n().data;
     if (o.internalPubkey) {
-      const c = Bc(o.internalPubkey, o.hash);
+      const c = Nc(o.internalPubkey, o.hash);
       if (c) return c.x;
     }
   }), Te(o, "internalPubkey", () => {
@@ -7677,7 +7677,7 @@ function uc(e, t) {
         version: o.redeemVersion
       }), u = pa(c, a);
       if (!u) return;
-      const f = Bc(e.internalPubkey, c.hash);
+      const f = Nc(e.internalPubkey, c.hash);
       if (!f) return;
       const l = at(
         [
@@ -7712,7 +7712,7 @@ function uc(e, t) {
       c = e.output.slice(2);
     }
     if (e.internalPubkey) {
-      const f = Bc(e.internalPubkey, o.hash);
+      const f = Nc(e.internalPubkey, o.hash);
       if (c.length > 0 && de(c, f.x) !== 0)
         throw new TypeError("Pubkey mismatch");
       c = f.x;
@@ -7740,7 +7740,7 @@ function uc(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 && !Ao(e.redeem.witness, o.redeem.witness))
+      if (e.redeem.witness && o.redeem.witness && !vo(e.redeem.witness, o.redeem.witness))
         throw new TypeError("Redeem.witness and witness mismatch");
     }
     if (u && u.length)
@@ -7767,7 +7767,7 @@ function uc(e, t) {
           throw new TypeError("Internal pubkey mismatch");
         if (!qf().isXOnlyPoint(d))
           throw new TypeError("Invalid internalPubkey for p2tr witness");
-        const y = f[0] & Wc, g = u[u.length - 2], m = Er({ output: g, version: y }), E = Vf(f, m), _ = Bc(d, E);
+        const y = f[0] & Xc, g = u[u.length - 2], m = Er({ output: g, version: y }), E = Vf(f, m), _ = Nc(d, E);
         if (!_)
           throw new TypeError("Invalid outputKey for p2tr witness");
         if (c.length && de(c, _.x) !== 0)
@@ -7791,7 +7791,7 @@ function O2(e, t) {
   return console.warn(Tg), B2(n, r, t.bech32);
 }
 function xg(e) {
-  const t = vo.decode(e);
+  const t = Io.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 = vr(t, 0), r = t.slice(1);
@@ -7820,11 +7820,11 @@ function B2(e, t, n) {
 function N2(e, t) {
   t = t || Pn;
   try {
-    return sc({ output: e, network: t }).address;
+    return oc({ output: e, network: t }).address;
   } catch {
   }
   try {
-    return oc({ output: e, network: t }).address;
+    return cc({ output: e, network: t }).address;
   } catch {
   }
   try {
@@ -7832,11 +7832,11 @@ function N2(e, t) {
   } catch {
   }
   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 {
@@ -7854,9 +7854,9 @@ function Ag(e, t) {
   }
   if (n) {
     if (n.version === t.pubKeyHash)
-      return sc({ hash: n.hash }).output;
-    if (n.version === t.scriptHash)
       return oc({ hash: n.hash }).output;
+    if (n.version === t.scriptHash)
+      return cc({ hash: n.hash }).output;
   } else {
     try {
       r = kl(e);
@@ -7869,10 +7869,10 @@ function Ag(e, t) {
         if (r.data.length === 20)
           return za({ hash: r.data }).output;
         if (r.data.length === 32)
-          return ac({ hash: r.data }).output;
+          return uc({ hash: r.data }).output;
       } else if (r.version === 1) {
         if (r.data.length === 32)
-          return uc({ pubkey: r.data }).output;
+          return fc({ pubkey: r.data }).output;
       } else if (r.version >= _g && r.version <= Eg && r.data.length >= bg && r.data.length <= wg)
         return console.warn(Tg), tn([
           r.version + Sg,
@@ -8209,7 +8209,7 @@ function F2(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), nc(i, s, a, "LE"), s += 4;
+    c && (a += 2147483648), rc(i, s, a, "LE"), s += 4;
   }), {
     key: n,
     value: i
@@ -8407,7 +8407,7 @@ function _E(e) {
 }
 function SE(e) {
   const t = Uint8Array.from([me.SIGHASH_TYPE]), n = new Uint8Array(4);
-  return nc(n, 0, e, "LE"), {
+  return rc(n, 0, e, "LE"), {
     key: t,
     value: n
   };
@@ -8693,7 +8693,7 @@ function Pl(e, t = a_) {
     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), nc(l, d, m, "LE"), d += 4;
+      g && (m += 2147483648), rc(l, d, m, "LE"), d += 4;
     }), {
       key: u,
       value: l
@@ -9220,7 +9220,7 @@ function Rt(e, t) {
   if (n === void 0) throw new Error(`No input #${t}`);
   return n;
 }
-function Io(e, t) {
+function Oo(e, t) {
   const n = e[t];
   if (n === void 0) throw new Error(`No output #${t}`);
   return n;
@@ -9286,7 +9286,7 @@ function w_(e, t) {
   Rg(t, r);
 }
 function b_(e, t) {
-  const n = e.length - 1, r = Io(e, n);
+  const n = e.length - 1, r = Oo(e, n);
   Ug(t, r);
 }
 let Nd = class {
@@ -9326,7 +9326,7 @@ let Nd = class {
     return Rg(n, r), this;
   }
   updateOutput(t, n) {
-    const r = Io(this.outputs, t);
+    const r = Oo(this.outputs, t);
     return Ug(n, r), this;
   }
   addUnknownKeyValToGlobal(t) {
@@ -9341,7 +9341,7 @@ let Nd = class {
     return $u(n, r.unknownKeyVals, Du(me)), r.unknownKeyVals || (r.unknownKeyVals = []), r.unknownKeyVals.push(n), this;
   }
   addUnknownKeyValToOutput(t, n) {
-    const r = Io(this.outputs, t);
+    const r = Oo(this.outputs, t);
     return $u(n, r.unknownKeyVals, Du(pt)), r.unknownKeyVals || (r.unknownKeyVals = []), r.unknownKeyVals.push(n), this;
   }
   addInput(t) {
@@ -9396,7 +9396,7 @@ function Yi(e) {
     }
   };
 }
-const E_ = Yi(Ga), __ = Yi(ig), S_ = Yi(sc), Ya = Yi(za), kd = Yi(ac), Cg = Yi(oc), Hg = Yi(uc);
+const E_ = Yi(Ga), __ = Yi(ig), S_ = Yi(oc), Ya = Yi(za), kd = Yi(uc), Cg = Yi(cc), Hg = Yi(fc);
 function ga(e) {
   let t = new Uint8Array(0);
   function n(o) {
@@ -9424,7 +9424,7 @@ function Za(e, t) {
 }
 function T_(e, t) {
   return x_(e).some(
-    (r) => Mg(r, Eo.decode, t)
+    (r) => Mg(r, _o.decode, t)
   );
 }
 function Mg(e, t, n) {
@@ -9452,7 +9452,7 @@ function A_(e) {
   const t = e.finalScriptSig ? lt(e.finalScriptSig) || [] : [], n = e.finalScriptWitness ? lt(e.finalScriptWitness) || [] : [];
   return t.concat(n).filter((r) => r instanceof Uint8Array && Ir(r)).map((r) => ({ signature: r }));
 }
-const Xc = (e) => e.length === 32 ? e : e.slice(1, 33);
+const zc = (e) => e.length === 32 ? e : e.slice(1, 33);
 function Pd(e, t, n) {
   const r = q_(
     t,
@@ -9466,7 +9466,7 @@ function Pd(e, t, n) {
     throw new Error(`Can not finalize taproot input #${e}: ${i}`);
   }
 }
-function Nc(e, t) {
+function kc(e, t) {
   const n = t ? Uint8Array.from([t]) : Uint8Array.from([]);
   return at([e, n]);
 }
@@ -9492,7 +9492,7 @@ function v_(e, t) {
   }
 }
 function I_(e, t) {
-  const n = t && O_(t.leaves), { output: r } = uc({
+  const n = t && O_(t.leaves), { output: r } = fc({
     internalPubkey: e,
     scriptTree: n
   });
@@ -9722,20 +9722,20 @@ class ma {
     return t.opts = JSON.parse(JSON.stringify(this.opts)), t;
   }
   setMaximumFeeRate(t) {
-    kc(t), this.opts.maximumFeeRate = t;
+    Pc(t), this.opts.maximumFeeRate = t;
   }
   setVersion(t) {
-    kc(t), Js(this.data.inputs, "setVersion");
+    Pc(t), Js(this.data.inputs, "setVersion");
     const n = this.__CACHE;
     return n.__TX.version = t, n.__EXTRACTED_TX = void 0, this;
   }
   setLocktime(t) {
-    kc(t), Js(this.data.inputs, "setLocktime");
+    Pc(t), Js(this.data.inputs, "setLocktime");
     const n = this.__CACHE;
     return n.__TX.locktime = t, n.__EXTRACTED_TX = void 0, this;
   }
   setInputSequence(t, n) {
-    kc(n), Js(this.data.inputs, "setInputSequence");
+    Pc(n), Js(this.data.inputs, "setInputSequence");
     const r = this.__CACHE;
     if (r.__TX.ins.length <= t)
       throw new Error("Input index too high");
@@ -9842,7 +9842,7 @@ class ma {
         `Cannot finalize input #${t}. Missing withness utxo.`
       );
     if (n.tapKeySig) {
-      const s = uc({
+      const s = fc({
         output: n.witnessUtxo.script,
         signature: n.tapKeySig
       }), o = ga(s.witness);
@@ -9876,11 +9876,11 @@ class ma {
     return !!r.bip32Derivation && r.bip32Derivation.some(i);
   }
   outputHasPubkey(t, n) {
-    const r = Io(this.data.outputs, t);
+    const r = Oo(this.data.outputs, t);
     return nS(n, r, t, this.__CACHE);
   }
   outputHasHDKey(t, n) {
-    const r = Io(this.data.outputs, t), i = Hd(n);
+    const r = Oo(this.data.outputs, t), i = Hd(n);
     return !!r.bip32Derivation && r.bip32Derivation.some(i);
   }
   validateSignaturesOfAllInputs(t) {
@@ -9907,7 +9907,7 @@ class ma {
     const c = [];
     let a, u, f;
     for (const l of o) {
-      const d = Eo.decode(l.signature), { hash: y, script: g } = f !== d.hashType ? jg(
+      const d = _o.decode(l.signature), { hash: y, script: g } = f !== d.hashType ? jg(
         t,
         Object.assign({}, i, { sighashType: d.hashType }),
         this.__CACHE,
@@ -9923,7 +9923,7 @@ class ma {
       throw new Error("No signatures to validate");
     if (typeof n != "function")
       throw new Error("Need validator function to validate signatures");
-    r = r && Xc(r);
+    r = r && zc(r);
     const c = r ? Kf(
       t,
       i,
@@ -10090,7 +10090,7 @@ class ma {
     ), o = [
       {
         pubkey: n.publicKey,
-        signature: Eo.encode(n.sign(i), s)
+        signature: _o.encode(n.sign(i), s)
       }
     ];
     return this.data.updateInput(t, { partialSig: o }), this;
@@ -10103,13 +10103,13 @@ class ma {
       i,
       s
     ), c = o.filter((u) => !u.leafHash).map(
-      (u) => Nc(
+      (u) => kc(
         r.signSchnorr(u.hash),
         n.sighashType
       )
     )[0], a = o.filter((u) => !!u.leafHash).map((u) => ({
-      pubkey: Xc(r.publicKey),
-      signature: Nc(
+      pubkey: zc(r.publicKey),
+      signature: kc(
         r.signSchnorr(u.hash),
         n.sighashType
       ),
@@ -10159,7 +10159,7 @@ class ma {
       const c = [
         {
           pubkey: n.publicKey,
-          signature: Eo.encode(o, s)
+          signature: _o.encode(o, s)
         }
       ];
       this.data.updateInput(t, { partialSig: c });
@@ -10176,7 +10176,7 @@ class ma {
     if (a) {
       const f = Promise.resolve(
         r.signSchnorr(a.hash)
-      ).then((l) => ({ tapKeySig: Nc(l, n.sighashType) }));
+      ).then((l) => ({ tapKeySig: kc(l, n.sighashType) }));
       c.push(f);
     }
     const u = o.filter((f) => !!f.leafHash);
@@ -10184,8 +10184,8 @@ class ma {
       const f = u.map((l) => Promise.resolve(r.signSchnorr(l.hash)).then(
         (d) => ({ tapScriptSig: [
           {
-            pubkey: Xc(r.publicKey),
-            signature: Nc(
+            pubkey: zc(r.publicKey),
+            signature: kc(
               d,
               n.sighashType
             ),
@@ -10323,7 +10323,7 @@ function Vg(e) {
 function Hd(e) {
   return (t) => !(de(e.fingerprint, t.masterFingerprint) || de(e.derivePath(t.path).publicKey, t.pubkey));
 }
-function kc(e) {
+function Pc(e) {
   if (typeof e != "number" || e !== Math.floor(e) || e > 4294967295 || e < 0)
     throw new Error("Invalid 32 bit integer");
 }
@@ -10344,7 +10344,7 @@ function K_(e) {
   if (!e.sighashType || !e.partialSig) return;
   const { partialSig: t, sighashType: n } = e;
   t.forEach((r) => {
-    const { hashType: i } = Eo.decode(r.signature);
+    const { hashType: i } = _o.decode(r.signature);
     if (n !== i)
       throw new Error("Signature sighash does not match input sighash type");
   });
@@ -10382,8 +10382,8 @@ function Dg(e, t) {
       );
   };
 }
-const Fd = Dg(oc, "Redeem script"), Md = Dg(
-  ac,
+const Fd = Dg(cc, "Redeem script"), Md = Dg(
+  uc,
   "Witness script"
 );
 function qd(e, t, n, r) {
@@ -10410,7 +10410,7 @@ function X_(e, t, n, r, i, s) {
 }
 function z_(e, t, n, r, i, s) {
   let o, c;
-  const a = Z_(e, t, n), u = s ? ac({ redeem: a }) : null, f = i ? oc({ redeem: u || a }) : null;
+  const a = Z_(e, t, n), u = s ? uc({ redeem: a }) : null, f = i ? cc({ redeem: u || a }) : null;
   return r ? (u ? c = ga(u.witness) : c = ga(a.witness), f && (o = f.input)) : f ? o = f.input : o = a.input, {
     finalScriptSig: o,
     finalScriptWitness: c
@@ -10464,7 +10464,7 @@ function jg(e, t, n, r, i) {
       o
     );
   else if (Ya(u)) {
-    const l = sc({
+    const l = oc({
       hash: u.slice(2)
     }).output;
     c = s.hashForWitnessV0(
@@ -10524,7 +10524,7 @@ function Kf(e, t, n, r, i, s, o) {
   ), f = u.map((g) => g.script), l = u.map((g) => g.value), d = [];
   if (t.tapInternalKey && !s) {
     const g = Kg(e, t, i) || Uint8Array.from([]);
-    if (de(Xc(r), g) === 0) {
+    if (de(zc(r), g) === 0) {
       const m = c.hashForWitnessV1(
         e,
         f,
@@ -10583,7 +10583,7 @@ function Z_(e, t, n) {
       });
       break;
     case "pubkeyhash":
-      r = sc({
+      r = oc({
         output: e,
         pubkey: n[0].pubkey,
         signature: n[0].signature
@@ -10811,7 +10811,7 @@ function Qs(e) {
   return [...Array(e).keys()];
 }
 u2($1);
-const Oo = {
+const Bo = {
   Mainnet: "mainnet",
   Testnet: "testnet"
 }, ba = "abcdefghijklmnopqrstuvwxyz234567", Ns = /* @__PURE__ */ Object.create(null);
@@ -11108,7 +11108,7 @@ function fS(e) {
   }
   return (t ^ -1) >>> 0;
 }
-const Pc = "__principal__", lS = 2, Dd = 4, hS = "aaaaa-aa";
+const Rc = "__principal__", lS = 2, Dd = 4, hS = "aaaaa-aa";
 let Ke = class ds {
   static anonymous() {
     return new this(new Uint8Array([Dd]));
@@ -11134,13 +11134,13 @@ let Ke = class ds {
     throw new Error(`Impossible to convert ${JSON.stringify(t)} to Principal.`);
   }
   static fromHex(t) {
-    return new this(ic(t));
+    return new this(sc(t));
   }
   static fromText(t) {
     let n = t;
-    if (t.includes(Pc)) {
+    if (t.includes(Rc)) {
       const o = JSON.parse(t);
-      Pc in o && (n = o[Pc]);
+      Rc in o && (n = o[Rc]);
     }
     const r = n.toLowerCase().replace(/-/g, "");
     let i = aS(r);
@@ -11184,7 +11184,7 @@ let Ke = class ds {
    * @returns {JsonnablePrincipal} a JSON object with a single key, {@link JSON_KEY_PRINCIPAL}, whose value is the principal as a string
    */
   toJSON() {
-    return { [Pc]: this.toText() };
+    return { [Rc]: this.toText() };
   }
   /**
    * Utility method taking a Principal to compare against. Used for determining canister ranges in certificate verification
@@ -11452,8 +11452,8 @@ var Ve;
 (function(e) {
   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";
 })(Ve || (Ve = {}));
-const zc = "DIDL", jd = 400;
-function Bo(e, t, n) {
+const Yc = "DIDL", jd = 400;
+function No(e, t, n) {
   return e.map((r, i) => n(r, t[i]));
 }
 class wS {
@@ -11717,7 +11717,7 @@ class im extends Rn {
     return "bool";
   }
 }
-class No extends Rn {
+class ko extends Rn {
   get typeName() {
     return Be.NullClass;
   }
@@ -12142,7 +12142,7 @@ class Or extends di {
     t.add(this, Le(n, r));
   }
   decodeValue(t, n) {
-    if (n instanceof No)
+    if (n instanceof ko)
       return [];
     if (n instanceof li)
       return [];
@@ -12171,7 +12171,7 @@ class Or extends di {
     else {
       if (
         // this check corresponds to `not (null <: <t>)` in the spec
-        this._type instanceof No || this._type instanceof Or || this._type instanceof li
+        this._type instanceof ko || this._type instanceof Or || this._type instanceof li
       )
         return r.decodeValue(t, r), [];
       {
@@ -12233,7 +12233,7 @@ field ${n} -> ${i.message}`);
     throw new Error(`Invalid ${this.display()} argument: ${wt(t)}`);
   }
   encodeValue(t) {
-    const n = this._fields.map(([i]) => t[i]), r = Bo(this._fields, n, ([, i], s) => i.encodeValue(s));
+    const n = this._fields.map(([i]) => t[i]), r = No(this._fields, n, ([, i], s) => i.encodeValue(s));
     return Le(...r);
   }
   _buildTypeTableImpl(t) {
@@ -12285,7 +12285,7 @@ field ${n} -> ${i.message}`);
   }
   valueToString(t) {
     const n = this._fields.map(([i]) => t[i]);
-    return `record {${Bo(this._fields, n, ([i, s], o) => i + "=" + s.valueToString(o)).join("; ")}}`;
+    return `record {${No(this._fields, n, ([i, s], o) => i + "=" + s.valueToString(o)).join("; ")}}`;
   }
 }
 class tu extends Ki {
@@ -12316,7 +12316,7 @@ index ${r} -> ${i.message}`);
     throw new Error(`Invalid ${this.display()} argument: ${wt(t)}`);
   }
   encodeValue(t) {
-    const n = Bo(this._components, t, (r, i) => r.encodeValue(i));
+    const n = No(this._components, t, (r, i) => r.encodeValue(i));
     return Le(...n);
   }
   decodeValue(t, n) {
@@ -12334,7 +12334,7 @@ index ${r} -> ${i.message}`);
     return `record {${this._components.map((n) => n.display()).join("; ")}}`;
   }
   valueToString(t) {
-    return `record {${Bo(this._components, t, (r, i) => r.valueToString(i)).join("; ")}}`;
+    return `record {${No(this._components, t, (r, i) => r.valueToString(i)).join("; ")}}`;
   }
 }
 class Ps extends di {
@@ -12511,7 +12511,7 @@ class om extends Rn {
     return `${this.name} "${t.toText()}"`;
   }
 }
-class ko extends di {
+class Po extends di {
   get typeName() {
     return Be.FuncClass;
   }
@@ -12631,7 +12631,7 @@ function Xf(e, t) {
     throw Error("Wrong number of message arguments");
   const n = new wS();
   e.forEach((a) => a.buildTypeTable(n));
-  const r = new TextEncoder().encode(zc), i = n.encode(), s = ft(t.length), o = Le(...e.map((a) => a.encodeType(n))), c = Le(...Bo(e, t, (a, u) => {
+  const r = new TextEncoder().encode(Yc), i = n.encode(), s = ft(t.length), o = Le(...e.map((a) => a.encodeType(n))), c = Le(...No(e, t, (a, u) => {
     try {
       a.covariant(u);
     } catch (f) {
@@ -12645,10 +12645,10 @@ function Xf(e, t) {
 }
 function cm(e, t) {
   const n = new Ls(t);
-  if (t.byteLength < zc.length)
+  if (t.byteLength < Yc.length)
     throw new Error("Message length smaller than magic number");
-  const r = $i(n, zc.length), i = new TextDecoder().decode(r);
-  if (i !== zc)
+  const r = $i(n, Yc.length), i = new TextDecoder().decode(r);
+  if (i !== Yc)
     throw new Error("Wrong magic number: " + JSON.stringify(i));
   function s(d) {
     const y = [], g = Number(Bt(d));
@@ -12815,7 +12815,7 @@ function cm(e, t) {
         const y = {}, g = d[1];
         for (const [m, E] of g) {
           let _ = u(E);
-          if (_ instanceof Nn && (_ = _.getType()), !(_ instanceof ko))
+          if (_ instanceof Nn && (_ = _.getType()), !(_ instanceof Po))
             throw new Error("Illegal service definition: services can only contain functions");
           y[m] = _;
         }
@@ -12848,7 +12848,7 @@ function cm(e, t) {
     zf();
   }
 }
-const am = new Fl(), um = new li(), ES = new rm(), fm = new im(), lm = new No(), hm = new sm(), dm = new Ml(), pm = new ql(), ym = new Vl(32), gm = new Vl(64), mm = new ji(8), wm = new ji(16), bm = new ji(32), Em = new ji(64), _m = new ci(8), Sm = new ci(16), Tm = new ci(32), xm = new ci(64), Am = new om();
+const am = new Fl(), um = new li(), ES = new rm(), fm = new im(), lm = new ko(), hm = new sm(), dm = new Ml(), pm = new ql(), ym = new Vl(32), gm = new Vl(64), mm = new ji(8), wm = new ji(16), bm = new ji(32), Em = new ji(64), _m = new ci(8), Sm = new ci(16), Tm = new ci(32), xm = new ci(64), Am = new om();
 function vm(...e) {
   return new tu(e);
 }
@@ -12868,7 +12868,7 @@ function km() {
   return new Nn();
 }
 function Pm(e, t, n = []) {
-  return new ko(e, t, n);
+  return new Po(e, t, n);
 }
 function Rm(e) {
   return new Ea(e);
@@ -12913,9 +12913,9 @@ class nu {
       i.set(n, r);
   }
 }
-let Yc = new nu();
+let Zc = new nu();
 function zf() {
-  Yc = new nu();
+  Zc = new nu();
 }
 function _S(e, t) {
   const n = new Set(e.annotations), r = new Set(t.annotations);
@@ -12927,11 +12927,11 @@ function _S(e, t) {
   return !0;
 }
 function Wu(e) {
-  return e instanceof Or || e instanceof No || e instanceof li;
+  return e instanceof Or || e instanceof ko || e instanceof li;
 }
 function $l(e, t) {
-  const n = Yc.copy(), r = dr(n, e, t);
-  return r ? Yc.add(e, t) : Yc.addNegative(e, t), r;
+  const n = Zc.copy(), r = dr(n, e, t);
+  return r ? Zc.add(e, t) : Zc.addNegative(e, t), r;
 }
 function dr(e, t, n) {
   if (t.name === n.name)
@@ -12957,7 +12957,7 @@ function dr(e, t, n) {
     }
     return !0;
   }
-  if (t instanceof ko && n instanceof ko) {
+  if (t instanceof Po && n instanceof Po) {
     if (!_S(t, n))
       return !1;
     for (let i = 0; i < t.argTypes.length; i++) {
@@ -13011,7 +13011,7 @@ const SS = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   Float64: gm,
   FloatClass: Vl,
   Func: Pm,
-  FuncClass: ko,
+  FuncClass: Po,
   Int: dm,
   Int16: wm,
   Int32: bm,
@@ -13025,7 +13025,7 @@ const SS = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   Nat8: _m,
   NatClass: ql,
   Null: lm,
-  NullClass: No,
+  NullClass: ko,
   Opt: Om,
   OptClass: Or,
   PrimitiveType: Rn,
@@ -13064,34 +13064,34 @@ function Um(e, t) {
 const { toString: TS } = Object.prototype, { getPrototypeOf: Dl } = Object, { iterator: ru, toStringTag: Cm } = Symbol, iu = /* @__PURE__ */ ((e) => (t) => {
   const n = TS.call(t);
   return e[n] || (e[n] = n.slice(8, -1).toLowerCase());
-})(/* @__PURE__ */ Object.create(null)), Gn = (e) => (e = e.toLowerCase(), (t) => iu(t) === e), su = (e) => (t) => typeof t === e, { isArray: $s } = Array, Po = su("undefined");
-function fc(e) {
-  return e !== null && !Po(e) && e.constructor !== null && !Po(e.constructor) && pn(e.constructor.isBuffer) && e.constructor.isBuffer(e);
+})(/* @__PURE__ */ Object.create(null)), Gn = (e) => (e = e.toLowerCase(), (t) => iu(t) === e), su = (e) => (t) => typeof t === e, { isArray: $s } = Array, Ro = su("undefined");
+function lc(e) {
+  return e !== null && !Ro(e) && e.constructor !== null && !Ro(e.constructor) && pn(e.constructor.isBuffer) && e.constructor.isBuffer(e);
 }
 const Hm = Gn("ArrayBuffer");
 function xS(e) {
   let t;
   return typeof ArrayBuffer < "u" && ArrayBuffer.isView ? t = ArrayBuffer.isView(e) : t = e && e.buffer && Hm(e.buffer), t;
 }
-const AS = su("string"), pn = su("function"), Fm = su("number"), lc = (e) => e !== null && typeof e == "object", vS = (e) => e === !0 || e === !1, Zc = (e) => {
+const AS = su("string"), pn = su("function"), Fm = su("number"), hc = (e) => e !== null && typeof e == "object", vS = (e) => e === !0 || e === !1, Jc = (e) => {
   if (iu(e) !== "object")
     return !1;
   const t = Dl(e);
   return (t === null || t === Object.prototype || Object.getPrototypeOf(t) === null) && !(Cm in e) && !(ru in e);
 }, IS = (e) => {
-  if (!lc(e) || fc(e))
+  if (!hc(e) || lc(e))
     return !1;
   try {
     return Object.keys(e).length === 0 && Object.getPrototypeOf(e) === Object.prototype;
   } catch {
     return !1;
   }
-}, OS = Gn("Date"), BS = Gn("File"), NS = Gn("Blob"), kS = Gn("FileList"), PS = (e) => lc(e) && pn(e.pipe), RS = (e) => {
+}, OS = Gn("Date"), BS = Gn("File"), NS = Gn("Blob"), kS = Gn("FileList"), PS = (e) => hc(e) && pn(e.pipe), RS = (e) => {
   let t;
   return e && (typeof FormData == "function" && e instanceof FormData || pn(e.append) && ((t = iu(e)) === "formdata" || // detect form-data instance
   t === "object" && pn(e.toString) && e.toString() === "[object FormData]"));
 }, US = Gn("URLSearchParams"), [CS, HS, FS, MS] = ["ReadableStream", "Request", "Response", "Headers"].map(Gn), qS = (e) => e.trim ? e.trim() : e.replace(/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g, "");
-function hc(e, t, { allOwnKeys: n = !1 } = {}) {
+function dc(e, t, { allOwnKeys: n = !1 } = {}) {
   if (e === null || typeof e > "u")
     return;
   let r, i;
@@ -13099,7 +13099,7 @@ function hc(e, t, { allOwnKeys: n = !1 } = {}) {
     for (r = 0, i = e.length; r < i; r++)
       t.call(null, e[r], r, e);
   else {
-    if (fc(e))
+    if (lc(e))
       return;
     const s = n ? Object.getOwnPropertyNames(e) : Object.keys(e), o = s.length;
     let c;
@@ -13108,7 +13108,7 @@ function hc(e, t, { allOwnKeys: n = !1 } = {}) {
   }
 }
 function Mm(e, t) {
-  if (fc(e))
+  if (lc(e))
     return null;
   t = t.toLowerCase();
   const n = Object.keys(e);
@@ -13118,17 +13118,17 @@ function Mm(e, t) {
       return i;
   return null;
 }
-const Ri = typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typeof window < "u" ? window : globalThis, qm = (e) => !Po(e) && e !== Ri;
+const Ri = typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typeof window < "u" ? window : globalThis, qm = (e) => !Ro(e) && e !== Ri;
 function Yf() {
   const { caseless: e } = qm(this) && this || {}, t = {}, n = (r, i) => {
     const s = e && Mm(t, i) || i;
-    Zc(t[s]) && Zc(r) ? t[s] = Yf(t[s], r) : Zc(r) ? t[s] = Yf({}, r) : $s(r) ? t[s] = r.slice() : t[s] = r;
+    Jc(t[s]) && Jc(r) ? t[s] = Yf(t[s], r) : Jc(r) ? t[s] = Yf({}, r) : $s(r) ? t[s] = r.slice() : t[s] = r;
   };
   for (let r = 0, i = arguments.length; r < i; r++)
-    arguments[r] && hc(arguments[r], n);
+    arguments[r] && dc(arguments[r], n);
   return t;
 }
-const VS = (e, t, n, { allOwnKeys: r } = {}) => (hc(t, (i, s) => {
+const VS = (e, t, n, { allOwnKeys: r } = {}) => (dc(t, (i, s) => {
   n && pn(i) ? e[s] = Um(i, n) : e[s] = i;
 }, { allOwnKeys: r }), e), LS = (e) => (e.charCodeAt(0) === 65279 && (e = e.slice(1)), e), $S = (e, t, n, r) => {
   e.prototype = Object.create(t.prototype, r), e.prototype.constructor = e, Object.defineProperty(e, "super", {
@@ -13177,7 +13177,7 @@ const VS = (e, t, n, { allOwnKeys: r } = {}) => (hc(t, (i, s) => {
   }
 ), Kd = (({ hasOwnProperty: e }) => (t, n) => e.call(t, n))(Object.prototype), ZS = Gn("RegExp"), Vm = (e, t) => {
   const n = Object.getOwnPropertyDescriptors(e), r = {};
-  hc(n, (i, s) => {
+  dc(n, (i, s) => {
     let o;
     (o = t(i, s, e)) !== !1 && (r[s] = o || i);
   }), Object.defineProperties(e, r);
@@ -13210,24 +13210,24 @@ function nT(e) {
 }
 const rT = (e) => {
   const t = new Array(10), n = (r, i) => {
-    if (lc(r)) {
+    if (hc(r)) {
       if (t.indexOf(r) >= 0)
         return;
-      if (fc(r))
+      if (lc(r))
         return r;
       if (!("toJSON" in r)) {
         t[i] = r;
         const s = $s(r) ? [] : {};
-        return hc(r, (o, c) => {
+        return dc(r, (o, c) => {
           const a = n(o, i + 1);
-          !Po(a) && (s[c] = a);
+          !Ro(a) && (s[c] = a);
         }), t[i] = void 0, s;
       }
     }
     return r;
   };
   return n(e, 0);
-}, iT = Gn("AsyncFunction"), sT = (e) => e && (lc(e) || pn(e)) && pn(e.then) && pn(e.catch), Lm = ((e, t) => e ? setImmediate : t ? ((n, r) => (Ri.addEventListener("message", ({ source: i, data: s }) => {
+}, iT = Gn("AsyncFunction"), sT = (e) => e && (hc(e) || pn(e)) && pn(e.then) && pn(e.catch), Lm = ((e, t) => e ? setImmediate : t ? ((n, r) => (Ri.addEventListener("message", ({ source: i, data: s }) => {
   i === Ri && s === n && r.length && r.shift()();
 }, !1), (i) => {
   r.push(i), Ri.postMessage(n, "*");
@@ -13237,20 +13237,20 @@ const rT = (e) => {
 ), oT = typeof queueMicrotask < "u" ? queueMicrotask.bind(Ri) : typeof process < "u" && process.nextTick || Lm, cT = (e) => e != null && pn(e[ru]), z = {
   isArray: $s,
   isArrayBuffer: Hm,
-  isBuffer: fc,
+  isBuffer: lc,
   isFormData: RS,
   isArrayBufferView: xS,
   isString: AS,
   isNumber: Fm,
   isBoolean: vS,
-  isObject: lc,
-  isPlainObject: Zc,
+  isObject: hc,
+  isPlainObject: Jc,
   isEmptyObject: IS,
   isReadableStream: CS,
   isRequest: HS,
   isResponse: FS,
   isHeaders: MS,
-  isUndefined: Po,
+  isUndefined: Ro,
   isDate: OS,
   isFile: BS,
   isBlob: NS,
@@ -13260,7 +13260,7 @@ const rT = (e) => {
   isURLSearchParams: US,
   isTypedArray: GS,
   isFileList: kS,
-  forEach: hc,
+  forEach: dc,
   merge: Yf,
   extend: VS,
   trim: qS,
@@ -13595,7 +13595,7 @@ function TT(e, t, n) {
     }
   return (n || JSON.stringify)(e);
 }
-const dc = {
+const pc = {
   transitional: Wm,
   adapter: ["xhr", "http", "fetch"],
   transformRequest: [function(t, n) {
@@ -13624,7 +13624,7 @@ const dc = {
     return s || i ? (n.setContentType("application/json", !1), TT(t)) : t;
   }],
   transformResponse: [function(t) {
-    const n = this.transitional || dc.transitional, r = n && n.forcedJSONParsing, i = this.responseType === "json";
+    const n = this.transitional || pc.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)) {
@@ -13662,7 +13662,7 @@ const dc = {
   }
 };
 z.forEach(["delete", "get", "head", "post", "put", "patch"], (e) => {
-  dc.headers[e] = {};
+  pc.headers[e] = {};
 });
 const xT = z.toObjectSet([
   "age",
@@ -13693,8 +13693,8 @@ const xT = z.toObjectSet([
 function eo(e) {
   return e && String(e).trim().toLowerCase();
 }
-function Jc(e) {
-  return e === !1 || e == null ? e : z.isArray(e) ? e.map(Jc) : String(e);
+function Qc(e) {
+  return e === !1 || e == null ? e : z.isArray(e) ? e.map(Qc) : String(e);
 }
 function vT(e) {
   const t = /* @__PURE__ */ Object.create(null), n = /([^\s,;=]+)\s*(?:=\s*([^,;]+))?/g;
@@ -13739,7 +13739,7 @@ let yn = class {
       if (!f)
         throw new Error("header name must be a non-empty string");
       const l = z.findKey(i, f);
-      (!l || i[l] === void 0 || u === !0 || u === void 0 && i[l] !== !1) && (i[l || a] = Jc(c));
+      (!l || i[l] === void 0 || u === !0 || u === void 0 && i[l] !== !1) && (i[l || a] = Qc(c));
     }
     const o = (c, a) => z.forEach(c, (u, f) => s(u, f, a));
     if (z.isPlainObject(t) || t instanceof this.constructor)
@@ -13807,11 +13807,11 @@ let yn = class {
     return z.forEach(this, (i, s) => {
       const o = z.findKey(r, s);
       if (o) {
-        n[o] = Jc(i), delete n[s];
+        n[o] = Qc(i), delete n[s];
         return;
       }
       const c = t ? OT(s) : String(s).trim();
-      c !== s && delete n[s], n[c] = Jc(i), r[c] = !0;
+      c !== s && delete n[s], n[c] = Qc(i), r[c] = !0;
     }), this;
   }
   concat(...t) {
@@ -13866,7 +13866,7 @@ z.reduceDescriptors(yn.prototype, ({ value: e }, t) => {
 });
 z.freezeMethods(yn);
 function zu(e, t) {
-  const n = this || dc, r = t || n, i = yn.from(r.headers);
+  const n = this || pc, 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);
@@ -14393,7 +14393,7 @@ function n0(e) {
   return Yu(e), e.headers = yn.from(e.headers), e.data = zu.call(
     e,
     e.transformRequest
-  ), ["post", "put", "patch"].indexOf(e.method) !== -1 && e.headers.setContentType("application/x-www-form-urlencoded", !1), tw.getAdapter(e.adapter || dc.adapter)(e).then(function(r) {
+  ), ["post", "put", "patch"].indexOf(e.method) !== -1 && e.headers.setContentType("application/x-www-form-urlencoded", !1), tw.getAdapter(e.adapter || pc.adapter)(e).then(function(r) {
     return Yu(e), r.data = zu.call(
       e,
       e.transformResponse,
@@ -14452,10 +14452,10 @@ function zT(e, t, n) {
       throw new ke("Unknown option " + s, ke.ERR_BAD_OPTION);
   }
 }
-const Qc = {
+const ea = {
   assertOptions: zT,
   validators: au
-}, Yn = Qc.validators;
+}, Yn = ea.validators;
 let Mi = class {
   constructor(t) {
     this.defaults = t || {}, this.interceptors = {
@@ -14491,16 +14491,16 @@ let Mi = class {
   _request(t, n) {
     typeof t == "string" ? (n = n || {}, n.url = t) : n = t || {}, n = Gi(this.defaults, n);
     const { transitional: r, paramsSerializer: i, headers: s } = n;
-    r !== void 0 && Qc.assertOptions(r, {
+    r !== void 0 && ea.assertOptions(r, {
       silentJSONParsing: Yn.transitional(Yn.boolean),
       forcedJSONParsing: Yn.transitional(Yn.boolean),
       clarifyTimeoutError: Yn.transitional(Yn.boolean)
     }, !1), i != null && (z.isFunction(i) ? n.paramsSerializer = {
       serialize: i
-    } : Qc.assertOptions(i, {
+    } : ea.assertOptions(i, {
       encode: Yn.function,
       serialize: Yn.function
-    }, !0)), n.allowAbsoluteUrls !== void 0 || (this.defaults.allowAbsoluteUrls !== void 0 ? n.allowAbsoluteUrls = this.defaults.allowAbsoluteUrls : n.allowAbsoluteUrls = !0), Qc.assertOptions(n, {
+    }, !0)), n.allowAbsoluteUrls !== void 0 || (this.defaults.allowAbsoluteUrls !== void 0 ? n.allowAbsoluteUrls = this.defaults.allowAbsoluteUrls : n.allowAbsoluteUrls = !0), ea.assertOptions(n, {
       baseUrl: Yn.spelling("baseURL"),
       withXsrfToken: Yn.spelling("withXSRFToken")
     }, !0), n.method = (n.method || this.defaults.method || "get").toLowerCase();
@@ -14735,7 +14735,7 @@ function iw(e) {
     return iw(Gi(e, i));
   }, n;
 }
-const ht = iw(dc);
+const ht = iw(pc);
 ht.Axios = Mi;
 ht.CanceledError = Ds;
 ht.CancelToken = YT;
@@ -14764,14 +14764,14 @@ const {
   VERSION: Z6,
   all: J6,
   Cancel: Q6,
-  isAxiosError: e4,
-  spread: t4,
-  toFormData: n4,
-  AxiosHeaders: r4,
-  HttpStatusCode: i4,
-  formToJSON: s4,
-  getAdapter: o4,
-  mergeConfig: c4
+  isAxiosError: eI,
+  spread: tI,
+  toFormData: nI,
+  AxiosHeaders: rI,
+  HttpStatusCode: iI,
+  formToJSON: sI,
+  getAdapter: oI,
+  mergeConfig: cI
 } = ht;
 class QT {
   axios;
@@ -14921,12 +14921,12 @@ class _s extends Ue {
   }
   toErrorMessage() {
     let t = this.reason;
-    return this.error && (t += `: ${yc(this.error)}`), `Certificate verification error: "${t}"`;
+    return this.error && (t += `: ${gc(this.error)}`), `Certificate verification error: "${t}"`;
   }
 }
-class Ro extends Ue {
+class Uo 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, Ro.prototype);
+    super(), this.maxAgeInMinutes = t, this.certificateTime = n, this.currentTime = r, this.timeDiffMsecs = i, this.ageType = s, this.name = "CertificateTimeErrorCode", Object.setPrototypeOf(this, Uo.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`;
@@ -15017,7 +15017,7 @@ class Yl extends Ue {
     super(), this.error = t, this.input = n, this.name = "CborDecodeErrorCode", Object.setPrototypeOf(this, Yl.prototype);
   }
   toErrorMessage() {
-    return `Failed to decode CBOR: ${yc(this.error)}, input: ${rt(this.input)}`;
+    return `Failed to decode CBOR: ${gc(this.error)}, input: ${rt(this.input)}`;
   }
 }
 class Zl extends Ue {
@@ -15025,12 +15025,12 @@ class Zl extends Ue {
     super(), this.error = t, this.value = n, this.name = "CborEncodeErrorCode", Object.setPrototypeOf(this, Zl.prototype);
   }
   toErrorMessage() {
-    return `Failed to encode CBOR: ${yc(this.error)}, input: ${this.value}`;
+    return `Failed to encode CBOR: ${gc(this.error)}, input: ${this.value}`;
   }
 }
-class Uo extends Ue {
+class Co extends Ue {
   constructor(t, n, r) {
-    super(), this.message = t, this.requestId = n, this.status = r, this.name = "TimeoutWaitingForResponseErrorCode", Object.setPrototypeOf(this, Uo.prototype);
+    super(), this.message = t, this.requestId = n, this.status = r, this.name = "TimeoutWaitingForResponseErrorCode", Object.setPrototypeOf(this, Co.prototype);
   }
   toErrorMessage() {
     let t = `${this.message}
@@ -15116,9 +15116,9 @@ class nh extends Ue {
     return `Attempt to hash a value of unsupported type: ${this.value}`;
   }
 }
-class So extends Ue {
+class To extends Ue {
   constructor(t) {
-    super(), this.error = t, this.name = "HttpDefaultFetchErrorCode", Object.setPrototypeOf(this, So.prototype);
+    super(), this.error = t, this.name = "HttpDefaultFetchErrorCode", Object.setPrototypeOf(this, To.prototype);
   }
   toErrorMessage() {
     return this.error;
@@ -15185,12 +15185,12 @@ class Vn extends Ue {
     super(), this.error = t, this.name = "UnexpectedErrorCode", Object.setPrototypeOf(this, Vn.prototype);
   }
   toErrorMessage() {
-    return `Unexpected error: ${yc(this.error)}`;
+    return `Unexpected error: ${gc(this.error)}`;
   }
 }
-class pc extends Ue {
+class yc extends Ue {
   constructor(t) {
-    super(), this.error = t, this.name = "HashTreeDecodeErrorCode", Object.setPrototypeOf(this, pc.prototype);
+    super(), this.error = t, this.name = "HashTreeDecodeErrorCode", Object.setPrototypeOf(this, yc.prototype);
   }
   toErrorMessage() {
     return `Failed to decode certificate: ${this.error}`;
@@ -15222,7 +15222,7 @@ class va extends Ue {
     super(), this.error = t, this.name = "HttpFetchErrorCode", Object.setPrototypeOf(this, va.prototype);
   }
   toErrorMessage() {
-    return `Failed to fetch HTTP request: ${yc(this.error)}`;
+    return `Failed to fetch HTTP request: ${gc(this.error)}`;
   }
 }
 class Ia extends Ue {
@@ -15249,7 +15249,7 @@ class Oa extends Ue {
     return `Failed to deserialize expiry: ${this.error}`;
   }
 }
-function yc(e) {
+function gc(e) {
   if (e instanceof Error)
     return e.stack ?? e.message;
   try {
@@ -15347,14 +15347,14 @@ function fx(e) {
 function lx(e) {
   return e & 31;
 }
-let Co = new Uint8Array(), to, $n = 0;
+let Ho = new Uint8Array(), to, $n = 0;
 function hx(e, t) {
-  Co = e, $n = 0;
+  Ho = e, $n = 0;
   const n = qi();
   return t?.(n) ?? n;
 }
 function qi(e) {
-  const [t, n] = ea();
+  const [t, n] = ta();
   switch (t) {
     case Tt.UnsignedInteger:
       return Ks(n);
@@ -15375,8 +15375,8 @@ function qi(e) {
   }
   throw new Ji(`Unsupported major type: ${t}`);
 }
-function ea() {
-  const e = Co.at($n);
+function ta() {
+  const e = Ho.at($n);
   if (ax(e))
     throw new Ji("Provided CBOR data is empty");
   const t = fx(e), n = lx(e);
@@ -15416,15 +15416,15 @@ function px(e) {
 function yx(e, t) {
   const n = Ks(e), r = {};
   if (n === 1 / 0) {
-    let [i, s] = ea();
+    let [i, s] = ta();
     for (; i !== Tt.Simple && s !== Ln.Break; ) {
       const o = rl(s), c = qi();
-      r[o] = c, [i, s] = ea();
+      r[o] = c, [i, s] = ta();
     }
     return r;
   }
   for (let i = 0; i < n; i++) {
-    const [s, o] = ea();
+    const [s, o] = ta();
     if (s !== Tt.TextString)
       throw new Ji("Map keys must be text strings");
     const c = rl(o), a = qi();
@@ -15435,7 +15435,7 @@ function yx(e, t) {
 function Ks(e) {
   if (e <= qn.Value)
     return e;
-  switch (to = new DataView(Co.buffer, Co.byteOffset + $n), e) {
+  switch (to = new DataView(Ho.buffer, Ho.byteOffset + $n), e) {
     case qn.OneByte:
       return $n++, to.getUint8(0);
     case qn.TwoBytes:
@@ -15459,7 +15459,7 @@ function uw(e) {
   if (t > Number.MAX_SAFE_INTEGER)
     throw new Ji("Byte length is too large");
   const n = Number(t);
-  return $n += n, Co.slice($n - n, $n);
+  return $n += n, Ho.slice($n - n, $n);
 }
 function rl(e) {
   const t = uw(e);
@@ -15623,7 +15623,7 @@ function er(e) {
     throw et.fromCode(new Yl(t, e));
   }
 }
-const Rc = () => {
+const Uc = () => {
   if (typeof window < "u" && window.crypto && window.crypto.getRandomValues) {
     const e = new Uint32Array(1);
     return window.crypto.getRandomValues(e), e[0];
@@ -15642,15 +15642,15 @@ var il;
 (function(e) {
   e.Call = "call";
 })(il || (il = {}));
-var Ho;
+var Fo;
 (function(e) {
   e.Query = "query", e.ReadState = "read_state";
-})(Ho || (Ho = {}));
+})(Fo || (Fo = {}));
 function sl() {
-  const e = new ArrayBuffer(16), t = new DataView(e), n = Rc(), r = Rc(), i = Rc(), s = Rc();
+  const e = new ArrayBuffer(16), t = new DataView(e), n = Uc(), r = Uc(), i = Uc(), s = Uc();
   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 Uc = "__expiry__", lh = BigInt(1e3), kx = BigInt(1e6), dw = BigInt(60), Px = BigInt(90) * lh;
+const Cc = "__expiry__", lh = BigInt(1e3), kx = BigInt(1e6), dw = BigInt(60), Px = BigInt(90) * lh;
 function pw(e) {
   return e / lh;
 }
@@ -15688,7 +15688,7 @@ class xs {
    * @returns {JsonnableExpiry} a JSON object with a single key, {@link JSON_KEY_EXPIRY}, whose value is the expiry as a string
    */
   toJSON() {
-    return { [Uc]: this.toString() };
+    return { [Cc]: this.toString() };
   }
   /**
    * Deserializes a {@link JsonnableExpiry} object from a JSON string.
@@ -15697,14 +15697,14 @@ class xs {
    */
   static fromJSON(t) {
     const n = JSON.parse(t);
-    if (n[Uc])
+    if (n[Cc])
       try {
-        const r = BigInt(n[Uc]);
+        const r = BigInt(n[Cc]);
         return new xs(r);
       } catch (r) {
         throw new et(new Oa(`Not a valid BigInt: ${r}`));
       }
-    throw new et(new Oa(`The input does not contain the key ${Uc}`));
+    throw new et(new Oa(`The input does not contain the key ${Cc}`));
   }
   static isExpiry(t) {
     return t instanceof xs || typeof t == "object" && t !== null && "_isExpiry" in t && t._isExpiry === !0 && "__expiry__" in t && typeof t.__expiry__ == "bigint";
@@ -15724,7 +15724,7 @@ function ef(e) {
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const hh = /* @__PURE__ */ BigInt(0), ka = /* @__PURE__ */ BigInt(1);
-function Fo(e, t = "") {
+function Mo(e, t = "") {
   if (typeof e != "boolean") {
     const n = t && `"${t}"`;
     throw new Error(n + "expected boolean, got type=" + typeof e);
@@ -15732,7 +15732,7 @@ function Fo(e, t = "") {
   return e;
 }
 function As(e, t, n = "") {
-  const r = rc(e), i = e?.length, s = t !== void 0;
+  const r = ic(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);
@@ -15747,11 +15747,11 @@ function yw(e) {
 function rr(e) {
   return yw(rt(e));
 }
-function Mo(e) {
+function qo(e) {
   return On(e), yw(rt(Uint8Array.from(e).reverse()));
 }
 function Ut(e, t) {
-  return ic(e.toString(16).padStart(t * 2, "0"));
+  return sc(e.toString(16).padStart(t * 2, "0"));
 }
 function gw(e, t) {
   return Ut(e, t).reverse();
@@ -15760,11 +15760,11 @@ function cn(e, t, n) {
   let r;
   if (typeof t == "string")
     try {
-      r = ic(t);
+      r = sc(t);
     } catch (s) {
       throw new Error(e + " must be hex string or Uint8Array, cause: " + s);
     }
-  else if (rc(t))
+  else if (ic(t))
     r = Uint8Array.from(t);
   else
     throw new Error(e + " must be hex string or Uint8Array");
@@ -15784,7 +15784,7 @@ function u0(e, t, n, r) {
   if (!mw(t, n, r))
     throw new Error("expected valid " + e + ": " + n + " <= n < " + r + ", got " + t);
 }
-function qo(e) {
+function Vo(e) {
   let t;
   for (t = 0; e > hh; e >>= ka, t += 1)
     ;
@@ -15797,7 +15797,7 @@ const Qi = (e) => (ka << BigInt(e)) - ka;
 function Cx(e) {
   return typeof e == "function" && Number.isSafeInteger(e.outputLen);
 }
-function gc(e, t, n = {}) {
+function mc(e, t, n = {}) {
   if (!e || typeof e != "object")
     throw new Error("expected valid options object");
   function r(i, s, o) {
@@ -15813,7 +15813,7 @@ function gc(e, t, n = {}) {
 const ww = () => {
   throw new Error("not implemented");
 };
-function Vo(e) {
+function Lo(e) {
   const t = /* @__PURE__ */ new WeakMap();
   return (n, ...r) => {
     const i = t.get(n);
@@ -15934,7 +15934,7 @@ function vw(e) {
     BYTES: "number",
     BITS: "number"
   }, n = $x.reduce((r, i) => (r[i] = "function", r), t);
-  return gc(e, n), e;
+  return mc(e, n), e;
 }
 function yu(e, t, n) {
   if (n < hn)
@@ -16022,7 +16022,7 @@ function pi(e, t, n = !1, r = {}) {
       }
       if (d.length !== u)
         throw new Error("Field.fromBytes: expected " + u + " bytes, got " + d.length);
-      let g = n ? Mo(d) : rr(d);
+      let g = n ? qo(d) : rr(d);
       if (o && (g = mt(g, e)), !y && !l.isValid(g))
         throw new Error("invalid field element: outside of range 0..ORDER");
       return g;
@@ -16049,7 +16049,7 @@ function jx(e, t, n = !1) {
   const r = e.length, i = Iw(t), s = Ow(t);
   if (r < 16 || r < s || r > 1024)
     throw new Error("expected " + s + "-1024 bytes of input, got " + r);
-  const o = n ? Mo(e) : rr(e), c = mt(o, t - Ft) + Ft;
+  const o = n ? qo(e) : rr(e), c = mt(o, t - Ft) + Ft;
   return n ? gw(c, i) : Ut(c, i);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
@@ -16203,7 +16203,7 @@ function Pw(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 = qo(BigInt(i));
+  const o = e.ZERO, c = Vo(BigInt(i));
   let a = 1;
   c > 12 ? a = c - 3 : c > 4 ? a = c - 2 : c > 0 && (a = 2);
   const u = Qi(a), f = new Array(Number(u) + 1).fill(o), l = Math.floor((t.BITS - 1) / a) * a;
@@ -16247,7 +16247,7 @@ function Rw(e, t, n = {}, r) {
 }
 const Xx = rr;
 function ni(e, t) {
-  if (Lo(e), Lo(t), e < 0 || e >= 1 << 8 * t)
+  if ($o(e), $o(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--)
@@ -16260,17 +16260,17 @@ function zx(e, t) {
     n[r] = e[r] ^ t[r];
   return n;
 }
-function Lo(e) {
+function $o(e) {
   if (!Number.isSafeInteger(e))
     throw new Error("number expected");
 }
 function Uw(e) {
-  if (!rc(e) && typeof e != "string")
+  if (!ic(e) && typeof e != "string")
     throw new Error("DST must be Uint8Array or string");
   return typeof e == "string" ? dt(e) : e;
 }
 function Yx(e, t, n, r) {
-  On(e), Lo(n), t = Uw(t), t.length > 255 && (t = r($e(dt("H2C-OVERSIZE-DST-"), t)));
+  On(e), $o(n), t = Uw(t), t.length > 255 && (t = r($e(dt("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");
@@ -16283,7 +16283,7 @@ function Yx(e, t, n, r) {
   return $e(...f).slice(0, n);
 }
 function Zx(e, t, n, r, i) {
-  if (On(e), Lo(n), t = Uw(t), t.length > 255) {
+  if (On(e), $o(n), t = Uw(t), t.length > 255) {
     const s = Math.ceil(2 * r / 8);
     t = i.create({ dkLen: s }).update(dt("H2C-OVERSIZE-DST-")).update(t).digest();
   }
@@ -16292,7 +16292,7 @@ function Zx(e, t, n, r, i) {
   return i.create({ dkLen: n }).update(e).update(ni(n, 2)).update(t).update(ni(t.length, 1)).digest();
 }
 function of(e, t, n) {
-  gc(n, {
+  mc(n, {
     p: "bigint",
     m: "number",
     k: "number",
@@ -16301,7 +16301,7 @@ function of(e, t, n) {
   const { p: r, k: i, m: s, hash: o, expand: c, DST: a } = n;
   if (!Cx(n.hash))
     throw new Error("expected valid hash");
-  On(e), Lo(t);
+  On(e), $o(t);
   const u = r.toString(2).length, f = Math.ceil((u + i) / 8), l = t * s * f;
   let d;
   if (c === "xmd")
@@ -16375,7 +16375,7 @@ function Qx(e, t, n) {
   let u = e - c * r - a * s, f = -c * i - a * o;
   const l = u < Fi, d = f < Fi;
   l && (u = -u), d && (f = -f);
-  const y = Qi(Math.ceil(qo(n) / 2)) + Jt;
+  const y = Qi(Math.ceil(Vo(n) / 2)) + Jt;
   if (u < Fi || u >= y || f < Fi || f >= y)
     throw new Error("splitScalar (endomorphism): failed, k=" + e);
   return { k1neg: l, k1: u, k2neg: d, k2: f };
@@ -16402,7 +16402,7 @@ function e3(e, t = {}) {
   const n = Rw("weierstrass", e, t), { Fp: r, Fn: i } = n;
   let s = n.CURVE;
   const { h: o, n: c } = s;
-  gc(t, {}, {
+  mc(t, {}, {
     allowInfinityPoint: "boolean",
     clearCofactor: "function",
     isTorsionFree: "function",
@@ -16421,7 +16421,7 @@ function e3(e, t = {}) {
   }
   function l(K, H, $) {
     const { x: P, y: D } = H.toAffine(), F = r.toBytes(P);
-    if (Fo($, "isCompressed"), $) {
+    if (Mo($, "isCompressed"), $) {
       f();
       const x = !r.isOdd(D);
       return $e(t3(x), F);
@@ -16482,7 +16482,7 @@ function e3(e, t = {}) {
       throw new Error("no endo");
     return Qx(K, a.basises, i.ORDER);
   }
-  const A = Vo((K, H) => {
+  const A = Lo((K, H) => {
     const { X: $, Y: P, Z: D } = K;
     if (r.eql(D, r.ONE))
       return { x: $, y: P };
@@ -16494,7 +16494,7 @@ function e3(e, t = {}) {
     if (!r.eql(q, r.ONE))
       throw new Error("invZ was invalid");
     return { x, y: B };
-  }), R = Vo((K) => {
+  }), R = Lo((K) => {
     if (K.is0()) {
       if (t.allowInfinityPoint && !r.is0(K.Y))
         return;
@@ -16673,7 +16673,7 @@ function e3(e, t = {}) {
       return this.multiplyUnsafe(o).is0();
     }
     toBytes(H = !0) {
-      return Fo(H, "isCompressed"), this.assertValidity(), y(v, this, H);
+      return Mo(H, "isCompressed"), this.assertValidity(), y(v, this, H);
     }
     toHex(H = !0) {
       return rt(this.toBytes(H));
@@ -16835,11 +16835,11 @@ function o3(e, t) {
   });
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const c3 = BigInt(0), Cc = BigInt(1), m0 = BigInt(2), gs = BigInt(3);
+const c3 = BigInt(0), Hc = BigInt(1), m0 = BigInt(2), gs = BigInt(3);
 function a3(e) {
   const t = [];
-  for (; e > Cc; e >>= Cc)
-    (e & Cc) === c3 ? t.unshift(0) : (e & gs) === gs ? (t.unshift(-1), e += Cc) : t.unshift(1);
+  for (; e > Hc; e >>= Hc)
+    (e & Hc) === c3 ? t.unshift(0) : (e & gs) === gs ? (t.unshift(-1), e += Hc) : t.unshift(1);
   return t;
 }
 function cf(e) {
@@ -16866,7 +16866,7 @@ function u3(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, m0)), 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 = a3(c), m = Vo((w) => {
+  const g = a3(c), m = Lo((w) => {
     const T = w, { x: O, y: A } = T.toAffine(), R = O, M = A, v = i.neg(A);
     let U = R, V = M, K = i.ONE;
     const H = [];
@@ -17142,7 +17142,7 @@ class h3 {
   constructor(t, n = {}) {
     this.MASK = Sr;
     const r = t.ORDER, i = r * r;
-    this.Fp = t, this.ORDER = i, this.BITS = qo(i), this.BYTES = Math.ceil(qo(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, en), this.NONRESIDUE = _0(t, n.FP2_NONRESIDUE), this.FROBENIUS_COEFFICIENTS = ph(t, this.Fp_NONRESIDUE, t.ORDER, 2)[0], this.mulByB = n.Fp2mulByB, Object.seal(this);
+    this.Fp = t, this.ORDER = i, this.BITS = Vo(i), this.BYTES = Math.ceil(Vo(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, en), this.NONRESIDUE = _0(t, n.FP2_NONRESIDUE), this.FROBENIUS_COEFFICIENTS = ph(t, this.Fp_NONRESIDUE, t.ORDER, 2)[0], this.mulByB = n.Fp2mulByB, Object.seal(this);
   }
   fromBigTuple(t) {
     return _0(this.Fp, t);
@@ -17674,12 +17674,12 @@ function y3(e) {
   return { Fp: t, Fp2: n, Fp6: r, Fp12: i };
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const jt = BigInt(0), Ca = BigInt(1), kn = BigInt(2), gu = BigInt(3), $o = BigInt(4), ri = BigInt("0xd201000000010000"), g3 = qo(ri), Wi = {
+const jt = BigInt(0), Ca = BigInt(1), kn = BigInt(2), gu = BigInt(3), Do = BigInt(4), ri = BigInt("0xd201000000010000"), g3 = Vo(ri), Wi = {
   p: BigInt("0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab"),
   n: BigInt("0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001"),
   h: BigInt("0x396c8c005555e1568c00aaab0000aaab"),
   a: jt,
-  b: $o,
+  b: Do,
   Gx: BigInt("0x17f1d3a73197d7942695638c4fa9ac0fc3688c4f9774b905a14e3a3f171bac586c55e83ff97a1aeffb3af00adb22c6bb"),
   Gy: BigInt("0x08b3f481e3aaa0f1a09e30ed741d8ae4fcf5e095d5d00af600db18cb2c04b3edd03cc744a2888ae40caa232946c5e7e1")
 }, m3 = pi(Wi.n, {
@@ -17692,7 +17692,7 @@ const jt = BigInt(0), Ca = BigInt(1), kn = BigInt(2), gu = BigInt(3), $o = BigIn
   // Fp(u) / (u² - β) where β = -1
   FP2_NONRESIDUE: [Ca, Ca],
   Fp2mulByB: ({ c0: e, c1: t }) => {
-    const n = Ee.mul(e, $o), r = Ee.mul(t, $o);
+    const n = Ee.mul(e, Do), r = Ee.mul(t, Do);
     return { c0: Ee.sub(n, r), c1: Ee.add(n, r) };
   },
   Fp12finalExponentiate: (e) => {
@@ -17712,7 +17712,7 @@ const jt = BigInt(0), Ca = BigInt(1), kn = BigInt(2), gu = BigInt(3), $o = BigIn
   n: Wi.n,
   h: BigInt("0x5d543a95414e7f1091d50792876a202cd91de4547085abaa68a205b2e5a7ddfa628f1cb4d9e82ef21537e293a6691ae1616ec6e786f0c70cf1c38e31c7238e5"),
   a: Re.ZERO,
-  b: Re.fromBigTuple([$o, $o]),
+  b: Re.fromBigTuple([Do, Do]),
   Gx: Re.fromBigTuple([
     BigInt("0x024aa2b2f08f0a91260805272dc51051c6e47ad4fa403b02b4510b647ae3d1770bac0326a805bbefd48056c8c121bdb8"),
     BigInt("0x13e02b6052719f607dacd3a088274f65596bd0d09920b61ab5da61bbdc7f5049334cf11213945d57e5ac7d055d042b7e")
@@ -17721,13 +17721,13 @@ const jt = BigInt(0), Ca = BigInt(1), kn = BigInt(2), gu = BigInt(3), $o = BigIn
     BigInt("0x0ce5d527727d6e118cc9cdc6da2e351aadfd9baa8cbdd3a76d429a695160d12c923ac9cc3baca289e193548608b82801"),
     BigInt("0x0606c4a02ea734cc32acd2b02bc28b99cb3e287e85a763af267492ab572e99ab3f370d275cec1da1aaa9075ff05f79be")
   ])
-}, mu = mc(Ee.toBytes(jt), { infinity: !0, compressed: !0 });
+}, mu = wc(Ee.toBytes(jt), { infinity: !0, compressed: !0 });
 function wu(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 mc(e, t) {
+function wc(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;
@@ -17738,7 +17738,7 @@ function E3(e, t, n) {
     if (s)
       return mu.slice();
     const a = !!(c * kn / i);
-    return mc(Ut(o, r), { compressed: !0, sort: a });
+    return wc(Ut(o, r), { compressed: !0, sort: a });
   } else
     return s ? $e(Uint8Array.of(64), new Uint8Array(2 * r - 1)) : $e(Ut(o, r), Ut(c, r));
 }
@@ -17748,7 +17748,7 @@ function uf(e) {
   if (e.is0())
     return mu.slice();
   const s = !!(i * kn / n);
-  return mc(Ut(r, t), { compressed: !0, sort: s });
+  return wc(Ut(r, t), { compressed: !0, sort: s });
 }
 function _3(e) {
   const { compressed: t, infinity: n, sort: r, value: i } = wu(e), { BYTES: s, ORDER: o } = Ee;
@@ -17794,7 +17794,7 @@ function S3(e, t, n) {
     if (s)
       return $e(mu, Ut(jt, r));
     const a = !!(c.c1 === jt ? c.c0 * kn / i : c.c1 * kn / i);
-    return $e(mc(Ut(o.c1, r), { compressed: !0, sort: a }), Ut(o.c0, r));
+    return $e(wc(Ut(o.c1, r), { compressed: !0, sort: a }), Ut(o.c0, r));
   } else {
     if (s)
       return $e(Uint8Array.of(64), new Uint8Array(4 * r - 1));
@@ -17808,7 +17808,7 @@ function ff(e) {
   if (e.is0())
     return $e(mu, Ut(jt, t));
   const { x: n, y: r } = e.toAffine(), { re: i, im: s } = Re.reim(n), { re: o, im: c } = Re.reim(r), u = !!((c > jt ? c * kn : o * kn) / Ee.ORDER & Ca), f = i;
-  return $e(mc(Ut(s, t), { sort: u, compressed: !0 }), Ut(f, t));
+  return $e(wc(Ut(s, t), { sort: u, compressed: !0 }), Ut(f, t));
 }
 function T3(e) {
   const { BYTES: t, ORDER: n } = Ee, { compressed: r, infinity: i, sort: s, value: o } = wu(e);
@@ -18157,7 +18157,7 @@ class Vi {
    * @returns The result of the lookup.
    */
   lookup_path(t) {
-    return wc(t, this.cert.tree);
+    return bc(t, this.cert.tree);
   }
   /**
    * Lookup a subtree in the certificate tree, using {@link lookup_subtree}.
@@ -18168,7 +18168,7 @@ class Vi {
     return mh(t, this.cert.tree);
   }
   async verify() {
-    const t = await ta(this.cert.tree), n = await this._checkDelegationAndGetKey(this.cert.delegation), r = this.cert.signature, i = V3(n), s = $e(wo("ic-state-root"), t), o = _n(this.lookup_path(["time"]));
+    const t = await na(this.cert.tree), n = await this._checkDelegationAndGetKey(this.cert.delegation), r = this.cert.signature, i = V3(n), s = $e(wo("ic-state-root"), t), o = _n(this.lookup_path(["time"]));
     if (!o)
       throw yt.fromCode(new _s("Certificate does not contain a time"));
     if (!this.#t) {
@@ -18176,9 +18176,9 @@ class Vi {
       if ((g || m) && this.#e && !this.#e.hasSyncedTime())
         return await this.#e.syncTime(this._canisterId), await this.verify();
       if (g)
-        throw An.fromCode(new Ro(this._maxAgeInMinutes, y, u, c, "past"));
+        throw An.fromCode(new Uo(this._maxAgeInMinutes, y, u, c, "past"));
       if (m)
-        throw this.#e?.hasSyncedTime() ? fn.fromCode(new Vn("System time has been synced with the IC network, but certificate is still too far in the future.")) : An.fromCode(new Ro(5, y, u, c, "future"));
+        throw this.#e?.hasSyncedTime() ? fn.fromCode(new Vn("System time has been synced with the IC network, but certificate is still too far in the future.")) : An.fromCode(new Uo(5, y, u, c, "future"));
     }
     try {
       if (!await this._blsVerify(i, r, s))
@@ -18215,7 +18215,7 @@ class Vi {
     return o;
   }
 }
-const ro = ic("308182301d060d2b0601040182dc7c0503010201060c2b0601040182dc7c05030201036100"), q3 = 96;
+const ro = sc("308182301d060d2b0601040182dc7c0503010201060c2b0601040182dc7c05030201036100"), q3 = 96;
 function V3(e) {
   const t = ro.byteLength + q3;
   if (e.byteLength !== t)
@@ -18229,7 +18229,7 @@ function _n(e) {
   if (e.status === vn.Found && e.value instanceof Uint8Array)
     return e.value;
 }
-async function ta(e) {
+async function na(e) {
   switch (e[0]) {
     case Ct.Empty:
       return En(wo("ic-hashtree-empty"));
@@ -18238,9 +18238,9 @@ async function ta(e) {
     case Ct.Leaf:
       return En($e(wo("ic-hashtree-leaf"), e[1]));
     case Ct.Labeled:
-      return En($e(wo("ic-hashtree-labeled"), e[1], await ta(e[2])));
+      return En($e(wo("ic-hashtree-labeled"), e[1], await na(e[2])));
     case Ct.Fork:
-      return En($e(wo("ic-hashtree-fork"), await ta(e[1]), await ta(e[2])));
+      return En($e(wo("ic-hashtree-fork"), await na(e[1]), await na(e[2])));
     default:
       throw Ss;
   }
@@ -18264,7 +18264,7 @@ var ot;
 (function(e) {
   e.Absent = "Absent", e.Unknown = "Unknown", e.Found = "Found", e.Less = "Less", e.Greater = "Greater";
 })(ot || (ot = {}));
-function wc(e, t) {
+function bc(e, t) {
   if (e.length === 0)
     switch (t[0]) {
       case Ct.Empty:
@@ -18273,7 +18273,7 @@ function wc(e, t) {
         };
       case Ct.Leaf: {
         if (!t[1])
-          throw fn.fromCode(new pc("Invalid tree structure for leaf"));
+          throw fn.fromCode(new yc("Invalid tree structure for leaf"));
         if (t[1] instanceof Uint8Array)
           return {
             status: vn.Found,
@@ -18293,10 +18293,10 @@ function wc(e, t) {
       default:
         throw Ss;
     }
-  const n = Mw(e), r = To(n, t);
+  const n = Mw(e), r = xo(n, t);
   switch (r.status) {
     case ot.Found:
-      return wc(e.slice(1), r.value);
+      return bc(e.slice(1), r.value);
     case ot.Absent:
     case ot.Greater:
     case ot.Less:
@@ -18317,7 +18317,7 @@ function mh(e, t) {
       status: vs.Found,
       value: t
     };
-  const n = Mw(e), r = To(n, t);
+  const n = Mw(e), r = xo(n, t);
   switch (r.status) {
     case ot.Found:
       return mh(e.slice(1), r.value);
@@ -18345,7 +18345,7 @@ function cl(e) {
       return [e];
   }
 }
-function To(e, t) {
+function xo(e, t) {
   switch (t[0]) {
     // if we have a labelled node, compare the node's label to the one we are
     // looking for
@@ -18360,12 +18360,12 @@ function To(e, t) {
       };
     // if we have a fork node, we need to search both sides, starting with the left
     case Ct.Fork: {
-      const n = To(e, t[1]);
+      const n = xo(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 ot.Greater: {
-          const r = To(e, t[2]);
+          const r = xo(e, t[2]);
           return r.status === ot.Less ? {
             status: ot.Absent
           } : r;
@@ -18373,7 +18373,7 @@ function To(e, t) {
         // if the left node returns an uncertain result, we need to search the
         // right node
         case ot.Unknown: {
-          const r = To(e, t[2]);
+          const r = xo(e, t[2]);
           return r.status === ot.Less ? {
             status: ot.Unknown
           } : r;
@@ -18401,7 +18401,7 @@ function To(e, t) {
   }
 }
 function qw(e) {
-  const { canisterId: t, subnetId: n, tree: r } = e, i = wc(["subnet", n.toUint8Array(), "canister_ranges"], r);
+  const { canisterId: t, subnetId: n, tree: r } = e, i = bc(["subnet", n.toUint8Array(), "canister_ranges"], r);
   if (i.status !== vn.Found)
     throw yt.fromCode(new Us(`Could not find canister ranges for subnet ${n.toText()}`, i.status));
   if (!(i.value instanceof Uint8Array))
@@ -18486,7 +18486,7 @@ const v0 = async (e) => {
                 }
           }
       } catch (l) {
-        if (l instanceof wr && (l.hasCode(_s) || l.hasCode(Ro)))
+        if (l instanceof wr && (l.hasCode(_s) || l.hasCode(Uo)))
           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();
       }
@@ -18510,10 +18510,10 @@ const v0 = async (e) => {
   if (a.status !== vs.Found)
     throw yt.fromCode(new Us("Node not found", a.status));
   if (a.value instanceof Uint8Array)
-    throw fn.fromCode(new pc("Invalid node tree"));
+    throw fn.fromCode(new yc("Invalid node tree"));
   const u = cl(a.value), f = /* @__PURE__ */ new Map();
   return u.forEach((l) => {
-    const d = Ke.from(l[1]).toText(), y = wc(["public_key"], l[2]);
+    const d = Ke.from(l[1]).toText(), y = bc(["public_key"], l[2]);
     if (y.status !== vn.Found)
       throw yt.fromCode(new Us("Public key not found", y.status));
     const g = y.value;
@@ -18562,7 +18562,7 @@ function G3(e, t = {}) {
   const n = Rw("edwards", e, t, t.FpFnLE), { Fp: r, Fn: i } = n;
   let s = n.CURVE;
   const { h: o } = s;
-  gc(t, {}, { uvRatio: "function" });
+  mc(t, {}, { uvRatio: "function" });
   const c = lf << BigInt(i.BYTES * 8) - Ot, a = (E) => r.create(E), u = t.uvRatio || ((E, _) => {
     try {
       return { isValid: !0, value: r.sqrt(r.div(E, _)) };
@@ -18580,7 +18580,7 @@ function G3(e, t = {}) {
     if (!(E instanceof g))
       throw new Error("ExtendedPoint expected");
   }
-  const d = Vo((E, _) => {
+  const d = Lo((E, _) => {
     const { X: S, Y: w, Z: T } = E, O = E.is0();
     _ == null && (_ = O ? j3 : r.inv(T));
     const A = a(S * _), R = a(w * _), M = r.mul(T, _);
@@ -18589,7 +18589,7 @@ function G3(e, t = {}) {
     if (M !== Ot)
       throw new Error("invZ was invalid");
     return { x: A, y: R };
-  }), y = Vo((E) => {
+  }), y = Lo((E) => {
     const { a: _, d: S } = s;
     if (E.is0())
       throw new Error("bad point: ZERO");
@@ -18617,10 +18617,10 @@ function G3(e, t = {}) {
     // Uses algo from RFC8032 5.1.3.
     static fromBytes(_, S = !1) {
       const w = r.BYTES, { a: T, d: O } = s;
-      _ = a0(As(_, w, "point")), Fo(S, "zip215");
+      _ = a0(As(_, w, "point")), Mo(S, "zip215");
       const A = a0(_), R = _[w - 1];
       A[w - 1] = R & -129;
-      const M = Mo(A), v = S ? c : r.ORDER;
+      const M = qo(A), v = S ? c : r.ORDER;
       u0("point.y", M, qr, v);
       const U = a(M * M), V = a(U - Ot), K = a(O * U - T);
       let { isValid: H, value: $ } = u(V, K);
@@ -18757,7 +18757,7 @@ function G3(e, t = {}) {
 function W3(e, t, n = {}) {
   if (typeof t != "function")
     throw new Error('"hash" function param is required');
-  gc(n, {}, {
+  mc(n, {}, {
     adjustScalarBytes: "function",
     randomBytes: "function",
     domain: "function",
@@ -18765,12 +18765,12 @@ function W3(e, t, n = {}) {
     mapToCurve: "function"
   });
   const { prehash: r } = n, { BASE: i, Fp: s, Fn: o } = e, c = n.randomBytes || cg, a = n.adjustScalarBytes || ((v) => v), u = n.domain || ((v, U, V) => {
-    if (Fo(V, "phflag"), U.length || V)
+    if (Mo(V, "phflag"), U.length || V)
       throw new Error("Contexts/pre-hash are not supported");
     return v;
   });
   function f(v) {
-    return o.create(Mo(v));
+    return o.create(qo(v));
   }
   function l(v) {
     const U = w.secretKey;
@@ -18800,8 +18800,8 @@ function W3(e, t, n = {}) {
   const E = { zip215: !0 };
   function _(v, U, V, K = E) {
     const { context: H, zip215: $ } = K, P = w.signature;
-    v = cn("signature", v, P), U = cn("message", U), V = cn("publicKey", V, w.publicKey), $ !== void 0 && Fo($, "zip215"), r && (U = r(U));
-    const D = P / 2, F = v.subarray(0, D), x = Mo(v.subarray(D, P));
+    v = cn("signature", v, P), U = cn("message", U), V = cn("publicKey", V, w.publicKey), $ !== void 0 && Mo($, "zip215"), r && (U = r(U));
+    const D = P / 2, F = v.subarray(0, D), x = qo(v.subarray(D, P));
     let B, q, N;
     try {
       B = e.fromBytes(V, $), q = e.fromBytes(F, $), N = i.multiplyUnsafe(x);
@@ -18827,7 +18827,7 @@ function W3(e, t, n = {}) {
     return { secretKey: U, publicKey: y(U) };
   }
   function A(v) {
-    return rc(v) && v.length === o.BYTES;
+    return ic(v) && v.length === o.BYTES;
   }
   function R(v, U) {
     try {
@@ -19218,15 +19218,15 @@ const u8 = (e, t) => {
     throw et.fromCode(new zl(s, o.length));
   return o;
 };
-var Ko, Go;
+var Go, Wo;
 const Pi = class Pi {
   // `fromRaw` and `fromDer` should be used for instantiation, not this constructor.
   constructor(t) {
-    rn(this, Ko);
     rn(this, Go);
+    rn(this, Wo);
     if (t.byteLength !== Pi.RAW_KEY_LENGTH)
       throw et.fromCode(new Nr("An Ed25519 public key must be exactly 32 bytes long"));
-    zt(this, Ko, t), zt(this, Go, Pi.derEncode(t));
+    zt(this, Go, t), zt(this, Wo, Pi.derEncode(t));
   }
   static from(t) {
     return this.fromDer(t.toDer());
@@ -19247,10 +19247,10 @@ const Pi = class Pi {
     return n;
   }
   get rawKey() {
-    return Fe(this, Ko);
+    return Fe(this, Go);
   }
   get derKey() {
-    return Fe(this, Go);
+    return Fe(this, Wo);
   }
   toDer() {
     return this.derKey;
@@ -19259,7 +19259,7 @@ const Pi = class Pi {
     return this.rawKey;
   }
 };
-Ko = new WeakMap(), Go = new WeakMap(), Pi.RAW_KEY_LENGTH = 32;
+Go = new WeakMap(), Wo = new WeakMap(), Pi.RAW_KEY_LENGTH = 32;
 let ul = Pi;
 class f8 {
   constructor() {
@@ -19290,23 +19290,23 @@ class l8 extends f8 {
   }
 }
 const U0 = 0.5, C0 = 1.5, H0 = 500, F0 = 6e4, M0 = 9e5, q0 = 10;
-var Fn, Wo, Xo, zo, Yo, Zo, Jo, Qo, Bs;
+var Fn, Xo, zo, Yo, Zo, Jo, Qo, ec, Bs;
 const La = class La {
   constructor(t = La.default) {
     rn(this, Fn);
-    rn(this, Wo);
     rn(this, Xo);
     rn(this, zo);
     rn(this, Yo);
     rn(this, Zo);
     rn(this, Jo);
     rn(this, Qo);
+    rn(this, ec);
     rn(this, Bs, 0);
     const { initialInterval: n = H0, randomizationFactor: r = U0, multiplier: i = C0, maxInterval: s = F0, maxElapsedTime: o = M0, maxIterations: c = q0, date: a = Date } = t;
-    zt(this, Fn, n), zt(this, Wo, r), zt(this, Xo, i), zt(this, zo, s), zt(this, Qo, a), zt(this, Yo, a.now()), zt(this, Zo, o), zt(this, Jo, c);
+    zt(this, Fn, n), zt(this, Xo, r), zt(this, zo, i), zt(this, Yo, s), zt(this, ec, a), zt(this, Zo, a.now()), zt(this, Jo, o), zt(this, Qo, c);
   }
   get ellapsedTimeInMsec() {
-    return Fe(this, Qo).now() - Fe(this, Yo);
+    return Fe(this, ec).now() - Fe(this, Zo);
   }
   get currentInterval() {
     return Fe(this, Fn);
@@ -19315,17 +19315,17 @@ const La = class La {
     return Fe(this, Bs);
   }
   get randomValueFromInterval() {
-    const t = Fe(this, Wo) * Fe(this, Fn), n = Fe(this, Fn) - t, r = Fe(this, Fn) + t;
+    const t = Fe(this, Xo) * Fe(this, Fn), n = Fe(this, Fn) - t, r = Fe(this, Fn) + t;
     return Math.random() * (r - n) + n;
   }
   incrementCurrentInterval() {
-    return zt(this, Fn, Math.min(Fe(this, Fn) * Fe(this, Xo), Fe(this, zo))), Mh(this, Bs)._++, Fe(this, Fn);
+    return zt(this, Fn, Math.min(Fe(this, Fn) * Fe(this, zo), Fe(this, Yo))), Mh(this, Bs)._++, Fe(this, Fn);
   }
   next() {
-    return this.ellapsedTimeInMsec >= Fe(this, Zo) || Fe(this, Bs) >= Fe(this, Jo) ? null : (this.incrementCurrentInterval(), this.randomValueFromInterval);
+    return this.ellapsedTimeInMsec >= Fe(this, Jo) || Fe(this, Bs) >= Fe(this, Qo) ? null : (this.incrementCurrentInterval(), this.randomValueFromInterval);
   }
 };
-Fn = new WeakMap(), Wo = new WeakMap(), Xo = new WeakMap(), zo = new WeakMap(), Yo = new WeakMap(), Zo = new WeakMap(), Jo = new WeakMap(), Qo = new WeakMap(), Bs = new WeakMap(), La.default = {
+Fn = new WeakMap(), Xo = new WeakMap(), zo = new WeakMap(), Yo = new WeakMap(), Zo = new WeakMap(), Jo = new WeakMap(), Qo = new WeakMap(), ec = new WeakMap(), Bs = new WeakMap(), La.default = {
   initialInterval: H0,
   randomizationFactor: U0,
   multiplier: C0,
@@ -19347,16 +19347,16 @@ function T8() {
     if (window.fetch)
       e = window.fetch.bind(window);
     else
-      throw un.fromCode(new So("Fetch implementation was not available. You appear to be in a browser context, but window.fetch was not present."));
+      throw un.fromCode(new To("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 So("Fetch implementation was not available. You appear to be in a Node.js context, but global.fetch was not available."));
+      throw un.fromCode(new To("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 So("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 To("Fetch implementation was not available. Please provide fetch to the HttpAgent constructor, or ensure it is available in the window or global context."));
 }
 function x8(e) {
   let t;
@@ -19435,7 +19435,7 @@ class Tr {
         throw An.fromCode(new ch(d));
       }
       return i;
-    }, this.config = t, this.#s = t.fetch || T8() || 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 = ic(p8);
+    }, this.config = t, this.#s = t.fetch || T8() || 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 = sc(p8);
     const n = x8(t.host);
     this.host = new URL(n), t.verifyQuerySignatures !== void 0 && (this.#d = t.verifyQuerySignatures), this.#c = t.retryTimes ?? 3;
     const r = () => new fl({
@@ -19586,7 +19586,7 @@ class Tr {
       backoff: o,
       delay: a
     }), a === null)
-      throw fn.fromCode(new Uo(`Backoff strategy exhausted after ${c} attempts.`, s));
+      throw fn.fromCode(new Co(`Backoff strategy exhausted after ${c} attempts.`, s));
     a > 0 && await new Promise((y) => setTimeout(y, a));
     let u;
     try {
@@ -19646,7 +19646,7 @@ class Tr {
   async #p(t) {
     const { requestFn: n, backoff: r, tries: i } = t, s = i === 0 ? 0 : r.next();
     if (s === null)
-      throw yt.fromCode(new Uo(`Retry strategy exhausted after ${i} attempts.`));
+      throw yt.fromCode(new Co(`Retry strategy exhausted after ${i} attempts.`));
     s > 0 && await new Promise((f) => setTimeout(f, s));
     let o, c = new Uint8Array();
     try {
@@ -19685,7 +19685,7 @@ class Tr {
     if (!c)
       throw un.fromCode(new Ni());
     const a = Ke.from(t), u = c.getPrincipal(), f = df(this.#o, this.#i), l = {
-      request_type: Ho.Query,
+      request_type: Fo.Query,
       canister_id: a,
       method_name: n.methodName,
       arg: n.arg,
@@ -19770,7 +19770,7 @@ class Tr {
       },
       endpoint: Ui.ReadState,
       body: {
-        request_type: Ho.ReadState,
+        request_type: Fo.ReadState,
         paths: t.paths,
         sender: i,
         ingress_expiry: df(this.#o, this.#i)
@@ -19828,8 +19828,8 @@ class Tr {
       if (r && "tree" in r)
         n = r.tree;
       else
-        throw yt.fromCode(new pc("Could not decode time from response"));
-      const i = wc(["time"], n);
+        throw yt.fromCode(new yc("Could not decode time from response"));
+      const i = bc(["time"], n);
       if (i.status !== vn.Found)
         throw yt.fromCode(new Us("Time was not found in the response or was not in its expected format.", i.status));
       if (!(i.value instanceof Uint8Array) && !ArrayBuffer.isView(i))
@@ -19978,7 +19978,7 @@ function B8(e) {
   const t = Date.now() + e;
   return async (n, r, i) => {
     if (Date.now() > t)
-      throw yt.fromCode(new Uo(`Request timed out after ${e} msec`, r, i));
+      throw yt.fromCode(new Co(`Request timed out after ${e} msec`, r, i));
   };
 }
 function N8(e, t) {
@@ -20006,7 +20006,7 @@ function R8(e, t) {
   return Lw(e, t) && typeof e[t] == "function";
 }
 function V0(e) {
-  return pf(e, "body") && pf(e.body, "content") && e.body.content.request_type === Ho.ReadState && pf(e.body.content, "ingress_expiry") && typeof e.body.content.ingress_expiry == "object" && e.body.content.ingress_expiry !== null && R8(e.body.content.ingress_expiry, "toHash");
+  return pf(e, "body") && pf(e.body, "content") && e.body.content.request_type === Fo.ReadState && pf(e.body.content, "ingress_expiry") && typeof e.body.content.ingress_expiry == "object" && e.body.content.ingress_expiry !== null && R8(e.body.content.ingress_expiry, "toHash");
 }
 async function $w(e, t, n, r = {}) {
   const i = [dt("request_status"), n];
@@ -20955,7 +20955,7 @@ var Y0;
 function Xt() {
   return Y0 || (Y0 = 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 = ec();
+    const t = tc();
     e.typeforce = q8();
     const n = t.Buffer.alloc(32, 0), r = t.Buffer.from(
       "fffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f",
@@ -22563,7 +22563,7 @@ var uo = {}, pp;
 function Z8() {
   if (pp) return uo;
   pp = 1, Object.defineProperty(uo, "__esModule", { value: !0 }), uo.p2wpkh = void 0;
-  const e = Pr(), t = Wn(), n = nn(), r = Xt(), i = yi(), s = cc(), o = n.OPS, c = Buffer.alloc(0);
+  const e = Pr(), t = Wn(), n = nn(), r = Xt(), i = yi(), s = ac(), 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");
@@ -22667,7 +22667,7 @@ var fo = {}, yp;
 function J8() {
   if (yp) return fo;
   yp = 1, Object.defineProperty(fo, "__esModule", { value: !0 }), fo.p2wsh = void 0;
-  const e = Pr(), t = Wn(), n = nn(), r = Xt(), i = yi(), s = cc(), o = n.OPS, c = Buffer.alloc(0);
+  const e = Pr(), t = Wn(), n = nn(), r = Xt(), i = yi(), s = ac(), o = n.OPS, c = Buffer.alloc(0);
   function a(f) {
     return !!(Buffer.isBuffer(f) && f.length === 65 && f[0] === 4 && (0, r.isPoint)(f));
   }
@@ -22879,12 +22879,12 @@ function Sh() {
   ];
   return vi;
 }
-var Of = {}, kt = {}, Hc = { exports: {} };
+var Of = {}, kt = {}, Fc = { exports: {} };
 /*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */
 var mp;
 function Q8() {
   return mp || (mp = 1, (function(e, t) {
-    var n = ec(), r = n.Buffer;
+    var n = tc(), r = n.Buffer;
     function i(o, c) {
       for (var a in o)
         c[a] = o[a];
@@ -22911,7 +22911,7 @@ function Q8() {
         throw new TypeError("Argument must be a number");
       return n.SlowBuffer(o);
     };
-  })(Hc, Hc.exports)), Hc.exports;
+  })(Fc, Fc.exports)), Fc.exports;
 }
 var Bf, wp;
 function eA() {
@@ -23067,7 +23067,7 @@ var Ep;
 function Th() {
   return Ep || (Ep = 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 = ec(), n = Sh(), r = Pr(), i = Eu(), s = Xt();
+    const t = tc(), n = Sh(), r = Pr(), i = Eu(), s = Xt();
     e.LEAF_VERSION_TAPSCRIPT = 192, e.MAX_TAPTREE_DEPTH = 128;
     const o = (m) => "left" in m && "right" in m;
     function c(m, E) {
@@ -23147,7 +23147,7 @@ var _p;
 function tA() {
   if (_p) return lo;
   _p = 1, Object.defineProperty(lo, "__esModule", { value: !0 }), lo.p2tr = void 0;
-  const e = ec(), t = Wn(), n = nn(), r = Xt(), i = Sh(), s = Th(), o = yi(), c = cc(), a = xh(), u = n.OPS, f = 1, l = 80;
+  const e = tc(), t = Wn(), n = nn(), r = Xt(), i = Sh(), s = Th(), o = yi(), c = ac(), a = xh(), 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");
@@ -23349,7 +23349,7 @@ function tA() {
   return lo.p2tr = d, lo;
 }
 var Sp;
-function bc() {
+function Ec() {
   return Sp || (Sp = 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 = L8();
@@ -23414,7 +23414,7 @@ var Tp;
 function xh() {
   if (Tp) return Yt;
   Tp = 1, Object.defineProperty(Yt, "__esModule", { value: !0 }), Yt.toOutputScript = Yt.fromOutputScript = Yt.toBech32 = Yt.toBase58Check = Yt.fromBech32 = Yt.fromBase58Check = void 0;
-  const e = Wn(), t = bc(), n = nn(), r = Xt(), i = cc(), s = _h(), o = 40, c = 2, a = 16, u = 2, f = 80, l = "WARNING: Sending to a future segwit version address can lead to loss of funds. End users MUST be warned carefully in the GUI and asked if they wish to proceed with caution. Wallets should verify the segwit version from the output of fromBech32, then decide when it is safe to use which version of segwit.";
+  const e = Wn(), t = Ec(), n = nn(), r = Xt(), i = ac(), s = _h(), 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)
@@ -23556,7 +23556,7 @@ function nA() {
   return po.fastMerkleRoot = e, po;
 }
 var yo = {}, Ap;
-function Ec() {
+function _c() {
   if (Ap) return yo;
   Ap = 1, Object.defineProperty(yo, "__esModule", { value: !0 }), yo.Transaction = void 0;
   const e = Eu(), t = Pr(), n = nn(), r = nn(), i = Xt(), { typeforce: s } = i;
@@ -23849,7 +23849,7 @@ var vp;
 function rA() {
   if (vp) return ho;
   vp = 1, Object.defineProperty(ho, "__esModule", { value: !0 }), ho.Block = void 0;
-  const e = Eu(), t = Pr(), n = nA(), r = Ec(), i = Xt(), { typeforce: s } = i, o = new TypeError(
+  const e = Eu(), t = Pr(), n = nA(), r = _c(), i = Xt(), { typeforce: s } = i, o = new TypeError(
     "Cannot compute merkle root for zero transactions"
   ), c = new TypeError(
     "Cannot compute witness commit for non-segwit block"
@@ -23978,7 +23978,7 @@ function rA() {
   }
   return ho;
 }
-var go = {}, Fc = {}, Mc = {}, Nf = {}, cs = {}, as = {}, kf = {}, Ip;
+var go = {}, Mc = {}, qc = {}, Nf = {}, cs = {}, as = {}, kf = {}, Ip;
 function Mt() {
   return Ip || (Ip = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), (function(t) {
@@ -24069,10 +24069,10 @@ function iA() {
   }
   return Vr.canAddToArray = s, Vr;
 }
-var qc = {}, Bp;
+var Vc = {}, Bp;
 function sA() {
-  if (Bp) return qc;
-  Bp = 1, Object.defineProperty(qc, "__esModule", { value: !0 });
+  if (Bp) return Vc;
+  Bp = 1, Object.defineProperty(Vc, "__esModule", { value: !0 });
   const e = Mt();
   function t(n) {
     return {
@@ -24080,7 +24080,7 @@ function sA() {
       value: n.toBuffer()
     };
   }
-  return qc.encode = t, qc;
+  return Vc.encode = t, Vc;
 }
 var Lr = {}, Np;
 function oA() {
@@ -24590,10 +24590,10 @@ function mA() {
   }
   return Jr.canAdd = s, Jr;
 }
-var Vc = {}, jp;
+var Lc = {}, jp;
 function zw() {
-  if (jp) return Vc;
-  jp = 1, Object.defineProperty(Vc, "__esModule", { value: !0 });
+  if (jp) return Lc;
+  jp = 1, Object.defineProperty(Lc, "__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) {
@@ -24650,12 +24650,12 @@ function zw() {
       canAddToArray: u
     };
   }
-  return Vc.makeConverter = n, Vc;
+  return Lc.makeConverter = n, Lc;
 }
-var Lc = {}, Kp;
+var $c = {}, Kp;
 function wA() {
-  if (Kp) return Lc;
-  Kp = 1, Object.defineProperty(Lc, "__esModule", { value: !0 });
+  if (Kp) return $c;
+  Kp = 1, Object.defineProperty($c, "__esModule", { value: !0 });
   function e(t) {
     return n;
     function n(r) {
@@ -24667,12 +24667,12 @@ function wA() {
       return i;
     }
   }
-  return Lc.makeChecker = e, Lc;
+  return $c.makeChecker = e, $c;
 }
-var $c = {}, Gp;
+var Dc = {}, Gp;
 function bA() {
-  if (Gp) return $c;
-  Gp = 1, Object.defineProperty($c, "__esModule", { value: !0 });
+  if (Gp) return Dc;
+  Gp = 1, Object.defineProperty(Dc, "__esModule", { value: !0 });
   function e(t) {
     function n(c) {
       if (c.key[0] !== t)
@@ -24702,12 +24702,12 @@ function bA() {
       canAdd: o
     };
   }
-  return $c.makeConverter = e, $c;
+  return Dc.makeConverter = e, Dc;
 }
-var Dc = {}, Wp;
+var jc = {}, Wp;
 function EA() {
-  if (Wp) return Dc;
-  Wp = 1, Object.defineProperty(Dc, "__esModule", { value: !0 });
+  if (Wp) return jc;
+  Wp = 1, Object.defineProperty(jc, "__esModule", { value: !0 });
   const e = ts(), t = zw(), n = (i) => i.length === 32;
   function r(i) {
     const s = t.makeConverter(i, n);
@@ -24740,12 +24740,12 @@ function EA() {
       canAddToArray: s.canAddToArray
     };
   }
-  return Dc.makeConverter = r, Dc;
+  return jc.makeConverter = r, jc;
 }
-var jc = {}, Xp;
+var Kc = {}, Xp;
 function _A() {
-  if (Xp) return jc;
-  Xp = 1, Object.defineProperty(jc, "__esModule", { value: !0 });
+  if (Xp) return Kc;
+  Xp = 1, Object.defineProperty(Kc, "__esModule", { value: !0 });
   function e(t) {
     function n(c) {
       if (c.key[0] !== t || c.key.length !== 1)
@@ -24776,12 +24776,12 @@ function _A() {
       canAdd: o
     };
   }
-  return jc.makeConverter = e, jc;
+  return Kc.makeConverter = e, Kc;
 }
-var Kc = {}, zp;
+var Gc = {}, zp;
 function SA() {
-  if (zp) return Kc;
-  zp = 1, Object.defineProperty(Kc, "__esModule", { value: !0 });
+  if (zp) return Gc;
+  zp = 1, Object.defineProperty(Gc, "__esModule", { value: !0 });
   function e(t) {
     function n(c) {
       if (c.key[0] !== t)
@@ -24811,7 +24811,7 @@ function SA() {
       canAdd: o
     };
   }
-  return Kc.makeConverter = e, Kc;
+  return Gc.makeConverter = e, Gc;
 }
 var Yp;
 function vh() {
@@ -25223,8 +25223,8 @@ function Yw() {
 }
 var ey;
 function AA() {
-  if (ey) return Mc;
-  ey = 1, Object.defineProperty(Mc, "__esModule", { value: !0 });
+  if (ey) return qc;
+  ey = 1, Object.defineProperty(qc, "__esModule", { value: !0 });
   const e = Yw();
   function t(s) {
     const o = s[0], c = e.psbtToKeyVals(o), a = s.slice(1);
@@ -25270,7 +25270,7 @@ function AA() {
       outputKeyVals: c.outputKeyVals
     });
   }
-  Mc.combine = t;
+  qc.combine = t;
   function n(s, o, c) {
     return (a) => {
       if (s.has(a)) return;
@@ -25290,7 +25290,7 @@ function AA() {
       o.add(a);
     }), o;
   }
-  return Mc;
+  return qc;
 }
 var Pf = {}, ty;
 function Zw() {
@@ -25394,8 +25394,8 @@ function Zw() {
 }
 var ny;
 function vA() {
-  if (ny) return Fc;
-  ny = 1, Object.defineProperty(Fc, "__esModule", { value: !0 });
+  if (ny) return Mc;
+  ny = 1, Object.defineProperty(Mc, "__esModule", { value: !0 });
   const e = AA(), t = Yw(), n = Mt(), r = Zw();
   class i {
     constructor(o) {
@@ -25501,13 +25501,13 @@ function vA() {
       return this.globalMap.unsignedTx.toBuffer();
     }
   }
-  return Fc.Psbt = i, Fc;
+  return Mc.Psbt = i, Mc;
 }
 var Qe = {}, ze = {}, ry;
 function dl() {
   if (ry) return ze;
   ry = 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 = ts(), t = nn(), n = Ec(), r = Pr(), i = bc();
+  const e = ts(), t = nn(), n = _c(), r = Pr(), i = Ec();
   function s(y) {
     return (g) => {
       try {
@@ -25584,7 +25584,7 @@ var iy;
 function IA() {
   if (iy) return Qe;
   iy = 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 = Xt(), t = Ec(), n = dl(), r = Th(), i = bc(), s = dl(), o = (x) => x.length === 32 ? x : x.slice(1, 33);
+  const e = Xt(), t = _c(), n = dl(), r = Th(), i = Ec(), s = dl(), o = (x) => x.length === 32 ? x : x.slice(1, 33);
   Qe.toXOnly = o;
   function c(x, B, q) {
     const N = P(
@@ -25808,7 +25808,7 @@ var sy;
 function OA() {
   if (sy) return go;
   sy = 1, Object.defineProperty(go, "__esModule", { value: !0 }), go.Psbt = void 0;
-  const e = vA(), t = ts(), n = Zw(), r = xh(), i = Eu(), s = Wn(), o = bc(), c = Th(), a = nn(), u = Ec(), f = IA(), l = dl(), d = {
+  const e = vA(), t = ts(), n = Zw(), r = xh(), i = Eu(), s = Wn(), o = Ec(), c = Th(), a = nn(), u = _c(), f = IA(), l = dl(), 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.
@@ -27017,7 +27017,7 @@ function BA() {
     e.crypto = n;
     const r = Wn();
     e.networks = r;
-    const i = bc();
+    const i = Ec();
     e.payments = i;
     const s = nn();
     e.script = s;
@@ -27042,7 +27042,7 @@ function BA() {
         return a.OPS;
       }
     });
-    var u = Ec();
+    var u = _c();
     Object.defineProperty(e, "Transaction", {
       enumerable: !0,
       get: function() {
@@ -27702,7 +27702,7 @@ function UA() {
   })(bi)), bi;
 }
 var fs = UA();
-function na(e) {
+function bo(e) {
   if (e.length % 2 !== 0)
     throw new Error("Hex string must have even length");
   const t = new Uint8Array(e.length / 2);
@@ -27714,9 +27714,9 @@ function Ih(e) {
   return Array.from(e).map((t) => t.toString(16).padStart(2, "0")).join("");
 }
 function Oh(e) {
-  return e === Oo.Mainnet ? Pn : Fy;
+  return e === Bo.Mainnet ? Pn : Fy;
 }
-function Bh(e, t = Oo.Testnet) {
+function Bh(e, t = Bo.Testnet) {
   const n = Oh(t);
   return Ag(e, n);
 }
@@ -27755,7 +27755,7 @@ function CA(e, t, n) {
 }
 async function e1(e, t) {
   try {
-    const n = t === Oo.Mainnet ? "https://mpc.omnity.network/utxo-status" : "https://mpc.omnity.network/testnet4/utxo-status", r = await ht.post(n, e).then((c) => c.data);
+    const n = t === Bo.Mainnet ? "https://mpc.omnity.network/utxo-status" : "https://mpc.omnity.network/testnet4/utxo-status", r = await ht.post(n, e).then((c) => c.data);
     if (!r)
       return null;
     const i = JSON.stringify(r), o = new TextEncoder().encode(i);
@@ -27764,14 +27764,14 @@ async function e1(e, t) {
     return null;
   }
 }
-const a4 = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const aI = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   bytesToHex: Ih,
   formatPoolUtxo: CA,
   getAddressType: si,
   getScriptByAddress: Bh,
   getUtxoProof: e1,
-  hexToBytes: na,
+  hexToBytes: bo,
   toBitcoinNetwork: Oh
 }, Symbol.toStringTag, { value: "Module" })), HA = "kqs64-paaaa-aaaar-qamza-cai", FA = "hvyp5-5yaaa-aaaao-qjxha-cai", Qr = BigInt(546), sn = "0:0", MA = "https://runescan-hasura-mainnet.omnity.network/v1/graphql", qA = "https://runescan-hasura-testnet.omnity.network/v1/graphql", py = {
   P2PKH: 148,
@@ -27826,14 +27826,21 @@ class ki {
       let i = t.pubkey;
       i || t.address === this.config.address && this.config.publicKey && (i = this.config.publicKey);
       const s = i ? i.length === 66 ? i.slice(2) : i : void 0;
-      this.psbt.data.addInput({
+      s ? this.psbt.data.addInput({
         hash: t.txid,
         index: t.vout,
         witnessUtxo: {
           value: BigInt(t.satoshis),
-          script: na(t.scriptPk)
+          script: bo(t.scriptPk)
         },
-        tapInternalKey: s ? na(s) : void 0
+        tapInternalKey: bo(s)
+      }) : this.psbt.data.addInput({
+        hash: t.txid,
+        index: t.vout,
+        witnessUtxo: {
+          value: BigInt(t.satoshis),
+          script: bo(t.scriptPk)
+        }
       });
     } else
       this.psbt.data.addInput({
@@ -27841,7 +27848,7 @@ class ki {
         index: t.vout,
         witnessUtxo: {
           value: BigInt(t.satoshis),
-          script: na(t.scriptPk)
+          script: bo(t.scriptPk)
         }
       });
     this.inputAddressTypes.push(si(n)), this.inputUtxos.push(t), (n === this.config.address || n === this.config.paymentAddress) && t.runes.length !== 0 && (this.userInputUtxoDusts += BigInt(t.satoshis));
@@ -28813,7 +28820,7 @@ var Se;
 function gl(e) {
   return e === 9 || e === 32;
 }
-function Do(e) {
+function jo(e) {
   return e >= 48 && e <= 57;
 }
 function s1(e) {
@@ -28824,7 +28831,7 @@ function o1(e) {
   return s1(e) || e === 95;
 }
 function ev(e) {
-  return s1(e) || Do(e) || e === 95;
+  return s1(e) || jo(e) || e === 95;
 }
 function tv(e) {
   var t;
@@ -29017,7 +29024,7 @@ function ov(e, t) {
       case 34:
         return n.charCodeAt(i + 1) === 34 && n.charCodeAt(i + 2) === 34 ? dv(e, i) : uv(e, i);
     }
-    if (Do(s) || s === 45)
+    if (jo(s) || s === 45)
       return av(e, i, s);
     if (o1(s))
       return pv(e, i);
@@ -29055,7 +29062,7 @@ function av(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), Do(s))
+    if (s = r.charCodeAt(++i), jo(s))
       throw Nt(
         e.source,
         i,
@@ -29084,7 +29091,7 @@ function av(e, t, n) {
   );
 }
 function Cf(e, t, n) {
-  if (!Do(n))
+  if (!jo(n))
     throw Nt(
       e.source,
       t,
@@ -29095,7 +29102,7 @@ function Cf(e, t, n) {
     );
   const r = e.source.body;
   let i = t + 1;
-  for (; Do(r.charCodeAt(i)); )
+  for (; jo(r.charCodeAt(i)); )
     ++i;
   return i;
 }
@@ -29143,7 +29150,7 @@ function fv(e, t) {
         size: i
       };
     }
-    if (r = r << 4 | bo(s), r < 0)
+    if (r = r << 4 | Eo(s), r < 0)
       break;
   }
   throw Nt(
@@ -29177,9 +29184,9 @@ function lv(e, t) {
   );
 }
 function _y(e, t) {
-  return bo(e.charCodeAt(t)) << 12 | bo(e.charCodeAt(t + 1)) << 8 | bo(e.charCodeAt(t + 2)) << 4 | bo(e.charCodeAt(t + 3));
+  return Eo(e.charCodeAt(t)) << 12 | Eo(e.charCodeAt(t + 1)) << 8 | Eo(e.charCodeAt(t + 2)) << 4 | Eo(e.charCodeAt(t + 3));
 }
-function bo(e) {
+function Eo(e) {
   return e >= 48 && e <= 57 ? e - 48 : e >= 65 && e <= 70 ? e - 55 : e >= 97 && e <= 102 ? e - 87 : -1;
 }
 function hv(e, t) {
@@ -30119,7 +30126,7 @@ class Av {
       throw Nt(
         this._lexer.source,
         this._lexer.token.start,
-        `${Gc(
+        `${Wc(
           this._lexer.token
         )} is reserved and cannot be used for an enum value.`
       );
@@ -30412,7 +30419,7 @@ class Av {
     throw Nt(
       this._lexer.source,
       n.start,
-      `Expected ${l1(t)}, found ${Gc(n)}.`
+      `Expected ${l1(t)}, found ${Wc(n)}.`
     );
   }
   /**
@@ -30434,7 +30441,7 @@ class Av {
       throw Nt(
         this._lexer.source,
         n.start,
-        `Expected "${t}", found ${Gc(n)}.`
+        `Expected "${t}", found ${Wc(n)}.`
       );
   }
   /**
@@ -30453,7 +30460,7 @@ class Av {
     return Nt(
       this._lexer.source,
       n.start,
-      `Unexpected ${Gc(n)}.`
+      `Unexpected ${Wc(n)}.`
     );
   }
   /**
@@ -30520,7 +30527,7 @@ class Av {
       );
   }
 }
-function Gc(e) {
+function Wc(e) {
   const t = e.value;
   return l1(e.kind) + (t != null ? ` "${t}"` : "");
 }
@@ -31556,13 +31563,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 = oi(u, c), r = t ? qa(f, c + 10) : oi(e, c), a = Ze(o, r, c, 1), jo(a.d, i = l, d))
+  if (ve = !1, c = l + y, o = oi(u, c), r = t ? qa(f, c + 10) : oi(e, c), a = Ze(o, r, c, 1), Ko(a.d, i = l, d))
     do
       if (c += 10, o = oi(u, c), r = t ? qa(f, c + 10) : oi(e, c), a = Ze(o, r, c, 1), !s) {
         +Ht(a.d).slice(i + 1, i + 15) + 1 == 1e14 && (a = be(a, l + 1, 0));
         break;
       }
-    while (jo(a.d, i += 10, d));
+    while (Ko(a.d, i += 10, d));
   return ve = !0, be(a, l, d);
 };
 se.minus = se.sub = function(e) {
@@ -31740,7 +31747,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 = xt(+c, u), t = n == 0 || !isFinite(n) ? Wt(u * (Math.log("0." + Ht(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 = Sl(e.times(oi(c, r + n)), r), i.d && (i = be(i, r + 5, 1), jo(i.d, r, s) && (t = r + 10, i = be(Sl(e.times(oi(c, t + n)), t), t + 5, 1), +Ht(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 = xt(+c, u), t = n == 0 || !isFinite(n) ? Wt(u * (Math.log("0." + Ht(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 = Sl(e.times(oi(c, r + n)), r), i.d && (i = be(i, r + 5, 1), Ko(i.d, r, s) && (t = r + 10, i = be(Sl(e.times(oi(c, t + n)), t), t + 5, 1), +Ht(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;
@@ -31776,7 +31783,7 @@ function gn(e, t, n) {
   if (e !== ~~e || e < t || e > n)
     throw Error(hi + e);
 }
-function jo(e, t, n, r) {
+function Ko(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 = xt(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) == xt(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) == xt(10, t - 3) - 1, o;
@@ -31960,7 +31967,7 @@ function Sl(e, t) {
     if (s = be(s.times(e), a, 1), n = n.times(++f), c = o.plus(Ze(s, n, a, 1)), Ht(c.d).slice(0, a) === Ht(o.d).slice(0, a)) {
       for (i = l; i--; ) o = be(o.times(o), a, 1);
       if (t == null)
-        if (u < 3 && jo(o.d, a - r, y, u))
+        if (u < 3 && Ko(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);
@@ -31983,7 +31990,7 @@ function oi(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)), Ht(u.d).slice(0, f) === Ht(a.d).slice(0, f))
       if (a = a.times(2), s !== 0 && (a = a.plus(qa(_, f + 2, w).times(s + ""))), a = Ze(a, new _(y), f, 1), t == null)
-        if (jo(a.d, f - g, S, c))
+        if (Ko(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);
@@ -32703,7 +32710,7 @@ const V6 = ({ IDL: e }) => {
     version: e.Func([], [e.Text], ["query"])
   });
 };
-class u4 {
+class uI {
   /** Maestro API client for Bitcoin data */
   maestro;
   /** Configuration object */
@@ -32718,7 +32725,7 @@ class u4 {
    */
   constructor(t) {
     this.config = t;
-    const n = t.network === Oo.Testnet, r = n ? "https://xbt-testnet.gomaestro-api.org/v0" : "https://xbt-mainnet.gomaestro-api.org/v0";
+    const n = t.network === Bo.Testnet, r = n ? "https://xbt-testnet.gomaestro-api.org/v0" : "https://xbt-mainnet.gomaestro-api.org/v0";
     this.maestro = new QT({
       baseUrl: r,
       apiKey: t.maestroApiKey
@@ -32888,7 +32895,7 @@ class u4 {
    * @returns Array of matching rune information
    */
   async searchRunes(t) {
-    const n = this.config.network === Oo.Testnet ? qA : MA, r = Gv`
+    const n = this.config.network === Bo.Testnet ? qA : MA, r = Gv`
       query GetRunes($keyword: String!, $regex: String!) {
         runes(
           where: {
@@ -33026,8 +33033,8 @@ class u4 {
   }
 }
 export {
-  Oo as Network,
-  u4 as ReeClient,
+  Bo as Network,
+  uI as ReeClient,
   ki as Transaction,
-  a4 as utils
+  aI as utils
 };