@omnity/ree-client-ts-sdk 0.5.2 → 0.5.4

package/dist/{ree-sdk.es.js → index.es.js}

@@ -1158,7 +1158,7 @@ function P1() {
   return $h || ($h = 1, Object.defineProperty(zs, "__esModule", { value: !0 }), zs.crypto = void 0, zs.crypto = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0), zs;
 }
 var Dh;
-function oi() {
+function ci() {
   return Dh || (Dh = 1, (function(e) {
     /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
     Object.defineProperty(e, "__esModule", { value: !0 }), e.wrapXOFConstructorWithOpts = e.wrapConstructorWithOpts = e.wrapConstructor = e.Hash = e.nextTick = e.swap32IfBE = e.byteSwapIfBE = e.swap8IfBE = e.isLE = void 0, e.isBytes = n, e.anumber = r, e.abytes = i, e.ahash = s, e.aexists = o, e.aoutput = c, e.u8 = a, e.u32 = u, e.clean = f, e.createView = l, e.rotr = d, e.rotl = y, e.byteSwap = g, e.byteSwap32 = m, e.bytesToHex = S, e.hexToBytes = O, e.asyncLoop = R, e.utf8ToBytes = M, e.bytesToUtf8 = v, e.toBytes = U, e.kdfInputToBytes = V, e.concatBytes = K, e.checkOpts = H, e.createHasher = P, e.createOptHasher = D, e.createXOFer = F, e.randomBytes = x;
@@ -1332,7 +1332,7 @@ var jh;
 function Py() {
   if (jh) return qt;
   jh = 1, Object.defineProperty(qt, "__esModule", { value: !0 }), qt.SHA512_IV = qt.SHA384_IV = qt.SHA224_IV = qt.SHA256_IV = qt.HashMD = void 0, qt.setBigUint64 = t, qt.Chi = n, qt.Maj = r;
-  const e = /* @__PURE__ */ oi();
+  const e = /* @__PURE__ */ ci();
   function t(s, o, c, a) {
     if (typeof s.setBigUint64 == "function")
       return s.setBigUint64(o, c, a);
@@ -1539,7 +1539,7 @@ var Gh;
 function Ry() {
   if (Gh) return We;
   Gh = 1, Object.defineProperty(We, "__esModule", { value: !0 }), We.sha512_224 = We.sha512_256 = We.sha384 = We.sha512 = We.sha224 = We.sha256 = We.SHA512_256 = We.SHA512_224 = We.SHA384 = We.SHA512 = We.SHA224 = We.SHA256 = void 0;
-  const e = /* @__PURE__ */ Py(), t = /* @__PURE__ */ R1(), n = /* @__PURE__ */ oi(), r = /* @__PURE__ */ Uint32Array.from([
+  const e = /* @__PURE__ */ Py(), t = /* @__PURE__ */ R1(), n = /* @__PURE__ */ ci(), r = /* @__PURE__ */ Uint32Array.from([
     1116352408,
     1899447441,
     3049323471,
@@ -1822,7 +1822,7 @@ var Ys = {}, Bu = {}, Nu = {}, Wh;
 function U1() {
   return Wh || (Wh = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.hmac = e.HMAC = void 0;
-    const t = /* @__PURE__ */ oi();
+    const t = /* @__PURE__ */ ci();
     class n extends t.Hash {
       constructor(s, o) {
         super(), this.finished = !1, this.destroyed = !1, (0, t.ahash)(s);
@@ -1871,8 +1871,8 @@ function Fs() {
   return Xh || (Xh = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.notImplemented = e.bitMask = e.utf8ToBytes = e.randomBytes = e.isBytes = e.hexToBytes = e.concatBytes = e.bytesToUtf8 = e.bytesToHex = e.anumber = e.abytes = void 0, e.abool = s, e._abool2 = o, e._abytes2 = c, e.numberToHexUnpadded = a, e.hexToNumber = u, e.bytesToNumberBE = f, e.bytesToNumberLE = l, e.numberToBytesBE = d, e.numberToBytesLE = y, e.numberToVarBytesBE = g, e.ensureBytes = m, e.equalBytes = E, e.copyBytes = _, e.asciiToBytes = S, e.inRange = T, e.aInRange = O, e.bitLen = A, e.bitGet = R, e.bitSet = M, e.createHmacDrbg = U, e.validateObject = K, e.isHash = H, e._validateObject = $, e.memoized = D;
     /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-    const t = /* @__PURE__ */ oi();
-    var n = /* @__PURE__ */ oi();
+    const t = /* @__PURE__ */ ci();
+    var n = /* @__PURE__ */ ci();
     Object.defineProperty(e, "abytes", { enumerable: !0, get: function() {
       return n.abytes;
     } }), Object.defineProperty(e, "anumber", { enumerable: !0, get: function() {
@@ -2596,7 +2596,7 @@ function Uy() {
   return Zh || (Zh = 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__ */ oi(), 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__ */ ci(), r = /* @__PURE__ */ Fs(), i = /* @__PURE__ */ C1(), s = /* @__PURE__ */ tc(), 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;
@@ -3607,7 +3607,7 @@ function M1() {
   return ed || (ed = 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__ */ Ry(), n = /* @__PURE__ */ oi(), r = /* @__PURE__ */ H1(), i = /* @__PURE__ */ F1(), s = /* @__PURE__ */ tc(), o = /* @__PURE__ */ Uy(), c = /* @__PURE__ */ Fs(), a = {
+    const t = /* @__PURE__ */ Ry(), n = /* @__PURE__ */ ci(), r = /* @__PURE__ */ H1(), i = /* @__PURE__ */ F1(), s = /* @__PURE__ */ tc(), o = /* @__PURE__ */ Uy(), c = /* @__PURE__ */ Fs(), a = {
       p: BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),
       n: BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),
       h: BigInt(1),
@@ -4896,11 +4896,11 @@ function fa(e, ...t) {
   };
   return 0 in t && (n.default = t[0]), n;
 }
-function Xi(e) {
+function zi(e) {
   return {
     kind: "schema",
     type: "string",
-    reference: Xi,
+    reference: zi,
     expects: "string",
     async: !1,
     message: e,
@@ -5014,7 +5014,7 @@ function ct(e, t, n) {
     throw new pb(r.issues);
   return r.value;
 }
-function ci(e, t) {
+function ai(e, t) {
   const n = {};
   for (const r in e.entries)
     n[r] = fa(e.entries[r]);
@@ -5060,7 +5060,7 @@ function Zy(e) {
   return Array.isArray(e) ? e.length !== 2 ? !1 : e.every((t) => Zy(t)) : Al(e);
 }
 const yb = At(32), gb = At(20), od = At(32), De = ja(Uint8Array);
-qs(Xi(), Wy(/^([0-9a-f]{2})+$/i));
+qs(zi(), Wy(/^([0-9a-f]{2})+$/i));
 const mb = qs(
   fn(),
   Sl(),
@@ -5239,7 +5239,7 @@ function Ka(e, t) {
     return Ir(a) || (t.allowIncomplete && a === hs.OP_0) !== void 0;
   }
   ct(
-    ci(
+    ai(
       Et({
         network: Et({}),
         m: fn(),
@@ -5334,7 +5334,7 @@ function rg(e, t) {
   if (!e.input && !e.output && !e.pubkey && !e.input && !e.signature)
     throw new TypeError("Not enough data");
   t = Object.assign({ validate: !0 }, t || {}), ct(
-    ci(
+    ai(
       Et({
         network: Et({}),
         output: De,
@@ -5382,7 +5382,7 @@ function rg(e, t) {
   }
   return Object.assign(i, e);
 }
-const ts = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+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) {
   return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
@@ -5409,7 +5409,7 @@ function Ib(e, t) {
   if (e.length < n)
     throw new Error("digestInto() expects output buffer of length at least " + n);
 }
-function Vi(...e) {
+function Li(...e) {
   for (let t = 0; t < e.length; t++)
     e[t].fill(0);
 }
@@ -5487,10 +5487,10 @@ function Ga(e) {
   return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
 function og(e = 32) {
-  if (ts && typeof ts.getRandomValues == "function")
-    return ts.getRandomValues(new Uint8Array(e));
-  if (ts && typeof ts.randomBytes == "function")
-    return Uint8Array.from(ts.randomBytes(e));
+  if (ns && typeof ns.getRandomValues == "function")
+    return ns.getRandomValues(new Uint8Array(e));
+  if (ns && typeof ns.randomBytes == "function")
+    return Uint8Array.from(ns.randomBytes(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
 function Nb(e, t, n, r) {
@@ -5528,7 +5528,7 @@ class Ol extends Bb {
     hd(this), Ib(t, this), this.finished = !0;
     const { buffer: n, view: r, blockLen: i, isLE: s } = this;
     let { pos: o } = this;
-    n[o++] = 128, Vi(this.buffer.subarray(o)), this.padOffset > i - o && (this.process(r, 0), o = 0);
+    n[o++] = 128, Li(this.buffer.subarray(o)), this.padOffset > i - o && (this.process(r, 0), o = 0);
     for (let l = o; l < i; l++)
       n[l] = 0;
     Nb(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
@@ -5666,10 +5666,10 @@ class qb extends Ol {
     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() {
-    Vi(xc);
+    Li(xc);
   }
   destroy() {
-    this.destroyed = !0, Vi(this.buffer), this.set(0, 0, 0, 0, 0);
+    this.destroyed = !0, Li(this.buffer), this.set(0, 0, 0, 0, 0);
   }
 }
 const Vb = /* @__PURE__ */ Ga(() => new qb()), Lb = Vb, Ac = /* @__PURE__ */ BigInt(2 ** 32 - 1), yd = /* @__PURE__ */ BigInt(32);
@@ -5685,7 +5685,7 @@ function Db(e, t = !1) {
   }
   return [r, i];
 }
-const gd = (e, t, n) => e >>> n, md = (e, t, n) => e << 32 - n | t >>> n, ns = (e, t, n) => e >>> n | t << 32 - n, rs = (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 gd = (e, t, n) => e >>> n, md = (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;
 function or(e, t, n, r) {
   const i = (t >>> 0) + (r >>> 0);
   return { h: e + n + (i / 2 ** 32 | 0) | 0, l: i | 0 };
@@ -5783,10 +5783,10 @@ class hg extends Ol {
     r = r + this.A | 0, i = i + this.B | 0, s = s + this.C | 0, o = o + this.D | 0, c = c + this.E | 0, a = a + this.F | 0, u = u + this.G | 0, f = f + this.H | 0, this.set(r, i, s, o, c, a, u, f);
   }
   roundClean() {
-    Vi(Cr);
+    Li(Cr);
   }
   destroy() {
-    this.set(0, 0, 0, 0, 0, 0, 0, 0), Vi(this.buffer);
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), Li(this.buffer);
   }
 }
 class Zb extends hg {
@@ -5893,12 +5893,12 @@ class e2 extends Ol {
     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 = ns(T, O, 1) ^ ns(T, O, 8) ^ gd(T, O, 7), R = rs(T, O, 1) ^ rs(T, O, 8) ^ md(T, O, 7), M = Hr[w - 2] | 0, v = Fr[w - 2] | 0, U = ns(M, v, 19) ^ vc(M, v, 61) ^ gd(M, v, 6), V = rs(M, v, 19) ^ Ic(M, v, 61) ^ md(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) ^ gd(T, O, 7), R = is(T, O, 1) ^ is(T, O, 8) ^ md(T, O, 7), M = Hr[w - 2] | 0, v = Fr[w - 2] | 0, U = rs(M, v, 19) ^ vc(M, v, 61) ^ gd(M, v, 6), V = is(M, v, 19) ^ Ic(M, v, 61) ^ md(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 = ns(l, d, 14) ^ ns(l, d, 18) ^ vc(l, d, 41), O = rs(l, d, 14) ^ rs(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 = ns(r, i, 28) ^ vc(r, i, 34) ^ vc(r, i, 39), K = rs(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) ^ 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;
       _ = 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;
@@ -5906,17 +5906,17 @@ class e2 extends Ol {
     ({ h: r, l: i } = or(this.Ah | 0, this.Al | 0, r | 0, i | 0)), { h: s, l: o } = or(this.Bh | 0, this.Bl | 0, s | 0, o | 0), { h: c, l: a } = or(this.Ch | 0, this.Cl | 0, c | 0, a | 0), { h: u, l: f } = or(this.Dh | 0, this.Dl | 0, u | 0, f | 0), { h: l, l: d } = or(this.Eh | 0, this.El | 0, l | 0, d | 0), { h: y, l: g } = or(this.Fh | 0, this.Fl | 0, y | 0, g | 0), { h: m, l: E } = or(this.Gh | 0, this.Gl | 0, m | 0, E | 0), { h: _, l: S } = or(this.Hh | 0, this.Hl | 0, _ | 0, S | 0), this.set(r, i, s, o, c, a, u, f, l, d, y, g, m, E, _, S);
   }
   roundClean() {
-    Vi(Hr, Fr);
+    Li(Hr, Fr);
   }
   destroy() {
-    Vi(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
+    Li(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
   }
 }
 const En = /* @__PURE__ */ Ga(() => new hg()), t2 = /* @__PURE__ */ Ga(() => new Zb()), n2 = /* @__PURE__ */ Ga(() => new e2()), Qt = En;
 function Ar(e) {
   return Lb(Qt(e));
 }
-function yi(e) {
+function gi(e) {
   return Qt(Qt(e));
 }
 const r2 = {
@@ -6638,10 +6638,10 @@ function sc(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(
-    ci(
+    ai(
       Et({
         network: Et({}),
-        address: Xi(),
+        address: zi(),
         hash: gb,
         output: At(25),
         pubkey: Kn(Dn),
@@ -6733,13 +6733,13 @@ function oc(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(
-    ci(
+    ai(
       Et({
         network: Et({}),
-        address: Xi(),
+        address: zi(),
         hash: At(20),
         output: At(23),
-        redeem: ci(
+        redeem: ai(
           Et({
             network: Et({}),
             output: De,
@@ -6867,10 +6867,10 @@ function oc(e, t) {
   }
   return Object.assign(r, e);
 }
-var gi = {}, wd;
+var mi = {}, wd;
 function cc() {
-  if (wd) return gi;
-  wd = 1, Object.defineProperty(gi, "__esModule", { value: !0 }), gi.bech32m = gi.bech32 = void 0;
+  if (wd) return mi;
+  wd = 1, Object.defineProperty(mi, "__esModule", { value: !0 }), mi.bech32m = mi.bech32 = void 0;
   const e = "qpzry9x8gf2tvdw0s3jn54khce6mua7l", t = {};
   for (let u = 0; u < e.length; u++) {
     const f = e.charAt(u);
@@ -7000,7 +7000,7 @@ function cc() {
       fromWords: c
     };
   }
-  return gi.bech32 = a("bech32"), gi.bech32m = a("bech32m"), gi;
+  return mi.bech32 = a("bech32"), mi.bech32m = a("bech32m"), mi;
 }
 var Kt = cc();
 const bd = Ge, a2 = new Uint8Array(0);
@@ -7008,9 +7008,9 @@ function Xa(e, t) {
   if (!e.address && !e.hash && !e.output && !e.pubkey && !e.witness)
     throw new TypeError("Not enough data");
   t = Object.assign({ validate: !0 }, t || {}), ct(
-    ci(
+    ai(
       Et({
-        address: Xi(),
+        address: zi(),
         hash: At(20),
         input: At(0),
         network: Et({}),
@@ -7111,7 +7111,7 @@ function ac(e, t) {
   t = Object.assign({ validate: !0 }, t || {}), ct(
     cd({
       network: Et({}),
-      address: Xi(),
+      address: zi(),
       hash: yb,
       output: At(34),
       redeem: cd({
@@ -7371,7 +7371,7 @@ function b2(e) {
 function yg(e) {
   typeof e == "number" ? b2(e) : w2(e);
 }
-function ai(e, t, n) {
+function ui(e, t, n) {
   yg(e), n === void 0 && (n = 0), t === void 0 && (t = new Uint8Array(Bn(e)));
   let r = 0;
   return e < 253 ? (t.set([Number(e)], n), r = 1) : e <= 65535 ? (t.set([253], n), h2(t, n + 1, Number(e), "LE"), r = 3) : e <= 4294967295 ? (t.set([254], n), d2(t, n + 1, Number(e), "LE"), r = 5) : (t.set([255], n), p2(t, n + 1, BigInt(e), "LE"), r = 9), { buffer: t, bytes: r };
@@ -7455,7 +7455,7 @@ class $t {
     this.offset = Q1(this.buffer, this.offset, BigInt(t), "LE");
   }
   writeVarInt(t) {
-    const { bytes: n } = ai(t, this.buffer, this.offset);
+    const { bytes: n } = ui(t, this.buffer, this.offset);
     this.offset += n;
   }
   writeSlice(t) {
@@ -7581,16 +7581,16 @@ function Lf(e, t) {
 }
 function v2(e) {
   const t = Bn(e.length), n = new Uint8Array(t);
-  return ai(e.length, n), at([n, e]);
+  return ui(e.length, n), at([n, e]);
 }
 const Sd = Ge, Td = 1, I2 = 80;
 function uc(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(
-    ci(
+    ai(
       Et({
-        address: Xi(),
+        address: zi(),
         input: At(0),
         network: Et({}),
         output: At(34),
@@ -7605,7 +7605,7 @@ function uc(e, t) {
         ]),
         witness: hn(De),
         scriptTree: Kn(Zy, "Taptree is not of type isTaptree"),
-        redeem: ci(
+        redeem: ai(
           Et({
             output: De,
             // tapleaf script
@@ -7890,12 +7890,12 @@ function k2(e) {
   const t = e.length;
   return Bn(t) + e.reduce((n, r) => n + Jn(r), 0);
 }
-const Qr = new Uint8Array(0), xd = [], Mu = kr(
+const ei = new Uint8Array(0), xd = [], Mu = kr(
   "0000000000000000000000000000000000000000000000000000000000000000"
 ), Ad = kr(
   "0000000000000000000000000000000000000000000000000000000000000001"
 ), P2 = kr("ffffffffffffffff"), R2 = {
-  script: Qr,
+  script: ei,
   valueBuffer: P2
 };
 function U2(e) {
@@ -7972,7 +7972,7 @@ let gt = class Ye {
     ), r == null && (r = Ye.DEFAULT_SEQUENCE), this.ins.push({
       hash: t,
       index: n,
-      script: i || Qr,
+      script: i || ei,
       sequence: r,
       witness: xd
     }) - 1;
@@ -8044,10 +8044,10 @@ let gt = class Ye {
       });
     }
     r & Ye.SIGHASH_ANYONECANPAY ? (s.ins = [s.ins[t]], s.ins[0].script = i) : (s.ins.forEach((c) => {
-      c.script = Qr;
+      c.script = ei;
     }), s.ins[t].script = i);
     const o = new Uint8Array(s.byteLength(!1) + 4);
-    return Ly(o, o.length - 4, r, "LE"), s.__toBuffer(o, 0, !1), yi(o);
+    return Ly(o, o.length - 4, r, "LE"), s.__toBuffer(o, 0, !1), gi(o);
   }
   hashForWitnessV1(t, n, r, i, s, o) {
     if (ct(
@@ -8061,7 +8061,7 @@ let gt = class Ye {
     ), r.length !== this.ins.length || n.length !== this.ins.length)
       throw new Error("Must supply prevout script and value for all inputs");
     const c = i === Ye.SIGHASH_DEFAULT ? Ye.SIGHASH_ALL : i & Ye.SIGHASH_OUTPUT_MASK, u = (i & Ye.SIGHASH_INPUT_MASK) === Ye.SIGHASH_ANYONECANPAY, f = c === Ye.SIGHASH_NONE, l = c === Ye.SIGHASH_SINGLE;
-    let d = Qr, y = Qr, g = Qr, m = Qr, E = Qr;
+    let d = ei, y = ei, g = ei, m = ei, E = ei;
     if (!u) {
       let T = $t.withCapacity(36 * this.ins.length);
       this.ins.forEach((O) => {
@@ -8115,23 +8115,23 @@ let gt = class Ye {
     let s = Uint8Array.from([]), o, c = Mu, a = Mu, u = Mu;
     if (i & Ye.SIGHASH_ANYONECANPAY || (s = new Uint8Array(36 * this.ins.length), o = new $t(s, 0), this.ins.forEach((l) => {
       o.writeSlice(l.hash), o.writeUInt32(l.index);
-    }), a = yi(s)), !(i & Ye.SIGHASH_ANYONECANPAY) && (i & 31) !== Ye.SIGHASH_SINGLE && (i & 31) !== Ye.SIGHASH_NONE && (s = new Uint8Array(4 * this.ins.length), o = new $t(s, 0), this.ins.forEach((l) => {
+    }), a = gi(s)), !(i & Ye.SIGHASH_ANYONECANPAY) && (i & 31) !== Ye.SIGHASH_SINGLE && (i & 31) !== Ye.SIGHASH_NONE && (s = new Uint8Array(4 * this.ins.length), o = new $t(s, 0), this.ins.forEach((l) => {
       o.writeUInt32(l.sequence);
-    }), u = yi(s)), (i & 31) !== Ye.SIGHASH_SINGLE && (i & 31) !== Ye.SIGHASH_NONE) {
+    }), u = gi(s)), (i & 31) !== Ye.SIGHASH_SINGLE && (i & 31) !== Ye.SIGHASH_NONE) {
       const l = this.outs.reduce((d, y) => d + 8 + Jn(y.script), 0);
       s = new Uint8Array(l), o = new $t(s, 0), this.outs.forEach((d) => {
         o.writeInt64(d.value), o.writeVarSlice(d.script);
-      }), c = yi(s);
+      }), c = gi(s);
     } else if ((i & 31) === Ye.SIGHASH_SINGLE && t < this.outs.length) {
       const l = this.outs[t];
-      s = new Uint8Array(8 + Jn(l.script)), o = new $t(s, 0), o.writeInt64(l.value), o.writeVarSlice(l.script), c = yi(s);
+      s = new Uint8Array(8 + Jn(l.script)), o = new $t(s, 0), o.writeInt64(l.value), o.writeVarSlice(l.script), c = gi(s);
     }
     s = new Uint8Array(156 + Jn(n)), o = new $t(s, 0);
     const f = this.ins[t];
-    return o.writeInt32(this.version), o.writeSlice(a), o.writeSlice(u), o.writeSlice(f.hash), o.writeUInt32(f.index), o.writeVarSlice(n), o.writeInt64(r), o.writeUInt32(f.sequence), o.writeSlice(c), o.writeUInt32(this.locktime), o.writeUInt32(i), yi(s);
+    return o.writeInt32(this.version), o.writeSlice(a), o.writeSlice(u), o.writeSlice(f.hash), o.writeUInt32(f.index), o.writeVarSlice(n), o.writeInt64(r), o.writeUInt32(f.sequence), o.writeSlice(c), o.writeUInt32(this.locktime), o.writeUInt32(i), gi(s);
   }
   getHash(t) {
-    return t && this.isCoinbase() ? new Uint8Array(32) : yi(this.__toBuffer(void 0, void 0, t));
+    return t && this.isCoinbase() ? new Uint8Array(32) : gi(this.__toBuffer(void 0, void 0, t));
   }
   getId() {
     return xe(Bl(this.getHash(!1)));
@@ -8590,7 +8590,7 @@ function zE(e) {
 }
 function YE(e) {
   const { script: t, value: n } = e, r = Bn(t.length), i = new Uint8Array(8 + r + t.length);
-  return $y(i, 0, BigInt(n), "LE"), ai(t.length, i, 8), i.set(t, 8 + r), {
+  return $y(i, 0, BigInt(n), "LE"), ui(t.length, i, 8), i.set(t, 8 + r), {
     key: Uint8Array.from([me.WITNESS_UTXO]),
     value: i
   };
@@ -8634,7 +8634,7 @@ function n_(e) {
   const t = Uint8Array.from([pt.TAP_TREE]), n = [].concat(
     ...e.leaves.map((r) => [
       Uint8Array.of(r.depth, r.leafVersion),
-      ai(BigInt(r.script.length)).buffer,
+      ui(BigInt(r.script.length)).buffer,
       r.script
     ])
   );
@@ -8771,7 +8771,7 @@ function Og(e) {
   }
   function r(o) {
     const c = t.encode(o), a = Bn(o.leafHashes.length), u = new Uint8Array(a);
-    ai(o.leafHashes.length, u);
+    ui(o.leafHashes.length, u);
     const f = at([u, ...o.leafHashes, c.value]);
     return { ...c, value: f };
   }
@@ -8898,7 +8898,7 @@ function vd(e) {
 }
 function l_(e) {
   const t = e.key.length, n = e.value.length, r = Bn(t), i = Bn(n), s = new Uint8Array(r + t + i + n);
-  return ai(t, s, 0), s.set(e.key, r), ai(n, s, r + t), s.set(e.value, r + t + i), s;
+  return ui(t, s, 0), s.set(e.key, r), ui(n, s, r + t), s.set(e.value, r + t + i), s;
 }
 function h_(e, t) {
   let n = 0;
@@ -9158,7 +9158,7 @@ function y_(e) {
   const i = Id(t);
   if (i === void 0)
     throw new Error("Combine: Self missing transaction");
-  const s = is(n.globalKeyVals), o = n.inputKeyVals.map(is), c = n.outputKeyVals.map(is);
+  const s = ss(n.globalKeyVals), o = n.inputKeyVals.map(ss), c = n.outputKeyVals.map(ss);
   for (const a of r) {
     const u = Id(a);
     if (u === void 0 || de(u.toBuffer(), i.toBuffer()) !== 0)
@@ -9166,13 +9166,13 @@ function y_(e) {
         "Combine: One of the Psbts does not have the same transaction."
       );
     const f = $f(a);
-    is(f.globalKeyVals).forEach(
+    ss(f.globalKeyVals).forEach(
       Vu(
         s,
         n.globalKeyVals,
         f.globalKeyVals
       )
-    ), f.inputKeyVals.map(is).forEach(
+    ), f.inputKeyVals.map(ss).forEach(
       (g, m) => g.forEach(
         Vu(
           o[m],
@@ -9180,7 +9180,7 @@ function y_(e) {
           f.inputKeyVals[m]
         )
       )
-    ), f.outputKeyVals.map(is).forEach(
+    ), f.outputKeyVals.map(ss).forEach(
       (g, m) => g.forEach(
         Vu(
           c[m],
@@ -9206,7 +9206,7 @@ function Vu(e, t, n) {
 function Id(e) {
   return e.globalMap.unsignedTx;
 }
-function is(e) {
+function ss(e) {
   const t = /* @__PURE__ */ new Set();
   return e.forEach((n) => {
     const r = xe(n.key);
@@ -9387,7 +9387,7 @@ let Bd = class {
     return this.globalMap.unsignedTx.toBuffer();
   }
 };
-function zi(e) {
+function Yi(e) {
   return (t) => {
     try {
       return e({ output: t }), !0;
@@ -9396,7 +9396,7 @@ function zi(e) {
     }
   };
 }
-const E_ = zi(Ka), __ = zi(rg), S_ = zi(sc), za = zi(Xa), Nd = zi(ac), Ug = zi(oc), Cg = zi(uc);
+const E_ = Yi(Ka), __ = Yi(rg), S_ = Yi(sc), za = Yi(Xa), Nd = Yi(ac), Ug = Yi(oc), Cg = Yi(uc);
 function ya(e) {
   let t = new Uint8Array(0);
   function n(o) {
@@ -9404,7 +9404,7 @@ function ya(e) {
   }
   function r(o) {
     const c = t.length, a = Bn(o);
-    t = at([t, new Uint8Array(a)]), ai(o, t, c);
+    t = at([t, new Uint8Array(a)]), ui(o, t, c);
   }
   function i(o) {
     r(o.length), n(o);
@@ -11355,10 +11355,10 @@ function Gf(e) {
 function Qg() {
   throw new Error("unexpected end of buffer");
 }
-function Li(e, t) {
+function $i(e, t) {
   return e.byteLength < t && Qg(), e.read(t);
 }
-function $i(e) {
+function Di(e) {
   const t = e.readUint8();
   return t === void 0 && Qg(), t;
 }
@@ -11379,7 +11379,7 @@ function ft(e) {
 function Bt(e) {
   let t = BigInt(1), n = BigInt(0), r;
   do
-    r = $i(e), n += BigInt(r & 127).valueOf() * t, t *= BigInt(128);
+    r = Di(e), n += BigInt(r & 127).valueOf() * t, t *= BigInt(128);
   while (r >= 128);
   return n;
 }
@@ -11402,7 +11402,7 @@ function vt(e) {
   }
   return r.buffer;
 }
-function ei(e) {
+function ti(e) {
   const t = new Uint8Array(e.buffer);
   let n = 0;
   for (; n < t.byteLength; n++)
@@ -11411,7 +11411,7 @@ function ei(e) {
         return Bt(e);
       break;
     }
-  const r = new Uint8Array(Li(e, n + 1));
+  const r = new Uint8Array($i(e, n + 1));
   let i = BigInt(0);
   for (let s = r.byteLength - 1; s >= 0; s--)
     i = i * BigInt(128) + BigInt(128 - (r[s] & 127) - 1);
@@ -11433,10 +11433,10 @@ function em(e, t) {
 function tm(e, t) {
   if (t <= 0 || !Number.isInteger(t))
     throw new Error("Byte length must be a positive integer");
-  let n = BigInt($i(e)), r = BigInt(1), i = 0;
+  let n = BigInt(Di(e)), r = BigInt(1), i = 0;
   for (; ++i < t; ) {
     r *= BigInt(256);
-    const s = BigInt($i(e));
+    const s = BigInt(Di(e));
     n = n + r * s;
   }
   return n;
@@ -11596,7 +11596,7 @@ class Rn extends Qa {
   _buildTypeTableImpl(t) {
   }
 }
-class li extends Qa {
+class hi extends Qa {
   checkType(t) {
     if (t instanceof Nn) {
       const n = t.getType();
@@ -11704,7 +11704,7 @@ class rm extends Rn {
     return vt(Ve.Bool);
   }
   decodeValue(t, n) {
-    switch (this.checkType(n), $i(t)) {
+    switch (this.checkType(n), Di(t)) {
       case 0:
         return !1;
       case 1:
@@ -11745,7 +11745,7 @@ class No extends Rn {
     return "null";
   }
 }
-class ui extends Rn {
+class fi extends Rn {
   get typeName() {
     return Be.ReservedClass;
   }
@@ -11795,7 +11795,7 @@ class im extends Rn {
   }
   decodeValue(t, n) {
     this.checkType(n);
-    const r = Bt(t), i = Li(t, Number(r));
+    const r = Bt(t), i = $i(t, Number(r));
     return new TextDecoder("utf8", { fatal: !0 }).decode(i);
   }
   get name() {
@@ -11827,7 +11827,7 @@ class Fl extends Rn {
     return vt(Ve.Int);
   }
   decodeValue(t, n) {
-    return this.checkType(n), ei(t);
+    return this.checkType(n), ti(t);
   }
   get name() {
     return "int";
@@ -11896,7 +11896,7 @@ class ql extends Rn {
   }
   decodeValue(t, n) {
     this.checkType(n);
-    const r = Li(t, this._bits / 8), i = pS(r);
+    const r = $i(t, this._bits / 8), i = pS(r);
     return this._bits === 32 ? i.getFloat32(0, !0) : i.getFloat64(0, !0);
   }
   get name() {
@@ -11906,7 +11906,7 @@ class ql extends Rn {
     return t.toString();
   }
 }
-class Di extends Rn {
+class ji extends Rn {
   get typeName() {
     return Be.FixedIntClass;
   }
@@ -11952,7 +11952,7 @@ class Di extends Rn {
     return t.toString();
   }
 }
-class si extends Rn {
+class oi extends Rn {
   get typeName() {
     return Be.FixedNatClass;
   }
@@ -11991,7 +11991,7 @@ class si extends Rn {
     return t.toString();
   }
 }
-class ks extends li {
+class ks extends hi {
   get typeName() {
     return Be.VecClass;
   }
@@ -11999,13 +11999,13 @@ class ks extends li {
     return t.typeName === Be.VecClass;
   }
   constructor(t) {
-    super(), this._type = t, this._blobOptimization = !1, t instanceof si && t._bits === 8 && (this._blobOptimization = !0);
+    super(), this._type = t, this._blobOptimization = !1, t instanceof oi && t._bits === 8 && (this._blobOptimization = !0);
   }
   accept(t, n) {
     return t.visitVec(this, this._type, n);
   }
   covariant(t) {
-    const n = this._type instanceof si ? this._type._bits : this._type instanceof Di ? this._type._bits : 0;
+    const n = this._type instanceof oi ? this._type._bits : this._type instanceof ji ? this._type._bits : 0;
     if (ArrayBuffer.isView(t) && n == t.BYTES_PER_ELEMENT * 8 || Array.isArray(t) && t.every((r, i) => {
       try {
         return this._type.covariant(r);
@@ -12058,7 +12058,7 @@ index ${i} -> ${s.message}`);
     if (!(r instanceof ks))
       throw new Error("Not a vector type");
     const i = Number(Bt(t));
-    if (this._type instanceof si) {
+    if (this._type instanceof oi) {
       if (this._type._bits == 8)
         return new Uint8Array(t.read(i));
       if (this._type._bits == 16) {
@@ -12072,7 +12072,7 @@ index ${i} -> ${s.message}`);
       if (this._type._bits == 64)
         return new BigUint64Array(t.read(i * 8).buffer);
     }
-    if (this._type instanceof Di) {
+    if (this._type instanceof ji) {
       if (this._type._bits == 8)
         return new Int8Array(t.read(i));
       if (this._type._bits == 16) {
@@ -12109,7 +12109,7 @@ index ${i} -> ${s.message}`);
     return "vec {" + t.map((r) => this._type.valueToString(r)).join("; ") + "}";
   }
 }
-class Or extends li {
+class Or extends hi {
   get typeName() {
     return Be.OptClass;
   }
@@ -12144,7 +12144,7 @@ class Or extends li {
   decodeValue(t, n) {
     if (n instanceof No)
       return [];
-    if (n instanceof ui)
+    if (n instanceof fi)
       return [];
     let r = n;
     if (n instanceof Nn) {
@@ -12154,7 +12154,7 @@ class Or extends li {
       r = i;
     }
     if (r instanceof Or)
-      switch ($i(t)) {
+      switch (Di(t)) {
         case 0:
           return [];
         case 1: {
@@ -12171,7 +12171,7 @@ class Or extends li {
     else {
       if (
         // this check corresponds to `not (null <: <t>)` in the spec
-        this._type instanceof No || this._type instanceof Or || this._type instanceof ui
+        this._type instanceof No || this._type instanceof Or || this._type instanceof fi
       )
         return r.decodeValue(t, r), [];
       {
@@ -12194,7 +12194,7 @@ class Or extends li {
     return t.length === 0 ? "null" : `opt ${this._type.valueToString(t[0])}`;
   }
 }
-class ji extends li {
+class Ki extends hi {
   get typeName() {
     return Be.RecordClass;
   }
@@ -12243,7 +12243,7 @@ field ${n} -> ${i.message}`);
   }
   decodeValue(t, n) {
     const r = this.checkType(n);
-    if (!(r instanceof ji))
+    if (!(r instanceof Ki))
       throw new Error("Not a record type");
     const i = {};
     let s = 0, o = 0;
@@ -12257,7 +12257,7 @@ field ${n} -> ${i.message}`);
       if (l === d)
         i[u] = f.decodeValue(t, a), s++, o++;
       else if (d > l)
-        if (f instanceof Or || f instanceof ui)
+        if (f instanceof Or || f instanceof fi)
           i[u] = [], s++;
         else
           throw new Error("Cannot find required field " + u);
@@ -12265,7 +12265,7 @@ field ${n} -> ${i.message}`);
         a.decodeValue(t, a), o++;
     }
     for (const [c, a] of this._fields.slice(s))
-      if (a instanceof Or || a instanceof ui)
+      if (a instanceof Or || a instanceof fi)
         i[c] = [];
       else
         throw new Error("Cannot find required field " + c);
@@ -12288,7 +12288,7 @@ field ${n} -> ${i.message}`);
     return `record {${Bo(this._fields, n, ([i, s], o) => i + "=" + s.valueToString(o)).join("; ")}}`;
   }
 }
-class eu extends ji {
+class eu extends Ki {
   get typeName() {
     return Be.TupleClass;
   }
@@ -12337,7 +12337,7 @@ index ${r} -> ${i.message}`);
     return `record {${Bo(this._components, t, (r, i) => r.valueToString(i)).join("; ")}}`;
   }
 }
-class Ps extends li {
+class Ps extends hi {
   get typeName() {
     return Be.VariantClass;
   }
@@ -12416,7 +12416,7 @@ variant ${n} -> ${i.message}`);
     return t;
   }
 }
-const qa = class qa extends li {
+const qa = class qa extends hi {
   constructor() {
     super(...arguments), this._id = qa._counter++;
   }
@@ -12474,10 +12474,10 @@ const qa = class qa extends li {
 qa._counter = 0;
 let Nn = qa;
 function Vl(e) {
-  if ($i(e) !== 1)
+  if (Di(e) !== 1)
     throw new Error("Cannot decode principal");
   const n = Number(Bt(e));
-  return Ke.fromUint8Array(new Uint8Array(Li(e, n)));
+  return Ke.fromUint8Array(new Uint8Array($i(e, n)));
 }
 class sm extends Rn {
   get typeName() {
@@ -12511,7 +12511,7 @@ class sm extends Rn {
     return `${this.name} "${t.toText()}"`;
   }
 }
-class ko extends li {
+class ko extends hi {
   get typeName() {
     return Be.FuncClass;
   }
@@ -12547,9 +12547,9 @@ class ko extends li {
     const r = n instanceof Nn ? n.getType() ?? n : n;
     if (!Ll(r, this))
       throw new Error(`Cannot decode function reference at type ${this.display()} from wire type ${r.display()}`);
-    if ($i(t) !== 1)
+    if (Di(t) !== 1)
       throw new Error("Cannot decode function reference");
-    const s = Vl(t), o = Number(Bt(t)), c = Li(t, o), u = new TextDecoder("utf8", { fatal: !0 }).decode(c);
+    const s = Vl(t), o = Number(Bt(t)), c = $i(t, o), u = new TextDecoder("utf8", { fatal: !0 }).decode(c);
     return [s, u];
   }
   get name() {
@@ -12573,7 +12573,7 @@ class ko extends li {
     throw new Error("Illegal function annotation");
   }
 }
-class ba extends li {
+class ba extends hi {
   get typeName() {
     return Be.ServiceClass;
   }
@@ -12647,17 +12647,17 @@ function om(e, t) {
   const n = new Ls(t);
   if (t.byteLength < zc.length)
     throw new Error("Message length smaller than magic number");
-  const r = Li(n, zc.length), i = new TextDecoder().decode(r);
+  const r = $i(n, zc.length), i = new TextDecoder().decode(r);
   if (i !== zc)
     throw new Error("Wrong magic number: " + JSON.stringify(i));
   function s(d) {
     const y = [], g = Number(Bt(d));
     for (let _ = 0; _ < g; _++) {
-      const S = Number(ei(d));
+      const S = Number(ti(d));
       switch (S) {
         case Ve.Opt:
         case Ve.Vector: {
-          const w = Number(ei(d));
+          const w = Number(ti(d));
           y.push([S, w]);
           break;
         }
@@ -12672,7 +12672,7 @@ function om(e, t) {
             if (typeof O == "number" && O >= A)
               throw new Error("field id collision or not sorted");
             O = A;
-            const R = Number(ei(d));
+            const R = Number(ti(d));
             w.push([A, R]);
           }
           y.push([S, w]);
@@ -12682,11 +12682,11 @@ function om(e, t) {
           const w = [];
           let T = Number(Bt(d));
           for (; T--; )
-            w.push(Number(ei(d)));
+            w.push(Number(ti(d)));
           const O = [];
           let A = Number(Bt(d));
           for (; A--; )
-            O.push(Number(ei(d)));
+            O.push(Number(ti(d)));
           const R = [];
           let M = Number(Bt(d));
           for (; M--; )
@@ -12713,7 +12713,7 @@ function om(e, t) {
           let w = Number(Bt(d));
           const T = [];
           for (; w--; ) {
-            const O = Number(Bt(d)), A = new TextDecoder().decode(Li(d, O)), R = ei(d);
+            const O = Number(Bt(d)), A = new TextDecoder().decode($i(d, O)), R = ti(d);
             T.push([A, R]);
           }
           y.push([S, T]);
@@ -12725,7 +12725,7 @@ function om(e, t) {
     }
     const m = [], E = Number(Bt(d));
     for (let _ = 0; _ < E; _++)
-      m.push(Number(ei(d)));
+      m.push(Number(ti(d)));
     return [y, m];
   }
   const [o, c] = s(n);
@@ -12848,7 +12848,7 @@ function om(e, t) {
     Xf();
   }
 }
-const cm = new Hl(), am = new ui(), ES = new nm(), um = new rm(), fm = new No(), lm = new im(), hm = new Fl(), dm = new Ml(), pm = new ql(32), ym = new ql(64), gm = new Di(8), mm = new Di(16), wm = new Di(32), bm = new Di(64), Em = new si(8), _m = new si(16), Sm = new si(32), Tm = new si(64), xm = new sm();
+const cm = new Hl(), am = new fi(), ES = new nm(), um = new rm(), fm = new No(), lm = new im(), hm = new Fl(), dm = new Ml(), pm = new ql(32), ym = new ql(64), gm = new ji(8), mm = new ji(16), wm = new ji(32), bm = new ji(64), Em = new oi(8), _m = new oi(16), Sm = new oi(32), Tm = new oi(64), xm = new sm();
 function Am(...e) {
   return new eu(e);
 }
@@ -12859,7 +12859,7 @@ function Im(e) {
   return new Or(e);
 }
 function Om(e) {
-  return new ji(e);
+  return new Ki(e);
 }
 function Bm(e) {
   return new Ps(e);
@@ -12927,7 +12927,7 @@ function _S(e, t) {
   return !0;
 }
 function Gu(e) {
-  return e instanceof Or || e instanceof No || e instanceof ui;
+  return e instanceof Or || e instanceof No || e instanceof fi;
 }
 function Ll(e, t) {
   const n = Yc.copy(), r = dr(n, e, t);
@@ -12939,13 +12939,13 @@ function dr(e, t, n) {
   const r = e.known(t, n);
   if (r !== void 0)
     return r;
-  if (e.add(t, n), n instanceof ui || t instanceof Hl || t instanceof Ml && n instanceof Fl)
+  if (e.add(t, n), n instanceof fi || t instanceof Hl || t instanceof Ml && n instanceof Fl)
     return !0;
   if (t instanceof ks && n instanceof ks)
     return dr(e, t._type, n._type);
   if (n instanceof Or)
     return !0;
-  if (t instanceof ji && n instanceof ji) {
+  if (t instanceof Ki && n instanceof Ki) {
     const i = t.fieldsAsObject;
     for (const [s, o] of n._fields) {
       const c = i[cn(s)];
@@ -13002,11 +13002,11 @@ const SS = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   Bool: um,
   BoolClass: rm,
-  ConstructType: li,
+  ConstructType: hi,
   Empty: cm,
   EmptyClass: Hl,
-  FixedIntClass: Di,
-  FixedNatClass: si,
+  FixedIntClass: ji,
+  FixedNatClass: oi,
   Float32: pm,
   Float64: ym,
   FloatClass: ql,
@@ -13034,9 +13034,9 @@ const SS = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   Rec: Nm,
   RecClass: Nn,
   Record: Om,
-  RecordClass: ji,
+  RecordClass: Ki,
   Reserved: am,
-  ReservedClass: ui,
+  ReservedClass: fi,
   Service: Pm,
   ServiceClass: ba,
   Text: lm,
@@ -13118,7 +13118,7 @@ function Fm(e, t) {
       return i;
   return null;
 }
-const ki = typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typeof window < "u" ? window : globalThis, Mm = (e) => !Po(e) && e !== ki;
+const Pi = typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typeof window < "u" ? window : globalThis, Mm = (e) => !Po(e) && e !== Pi;
 function zf() {
   const { caseless: e } = Mm(this) && this || {}, t = {}, n = (r, i) => {
     const s = e && Fm(t, i) || i;
@@ -13227,14 +13227,14 @@ const rT = (e) => {
     return r;
   };
   return n(e, 0);
-}, iT = Gn("AsyncFunction"), sT = (e) => e && (lc(e) || dn(e)) && dn(e.then) && dn(e.catch), Vm = ((e, t) => e ? setImmediate : t ? ((n, r) => (ki.addEventListener("message", ({ source: i, data: s }) => {
-  i === ki && s === n && r.length && r.shift()();
+}, iT = Gn("AsyncFunction"), sT = (e) => e && (lc(e) || dn(e)) && dn(e.then) && dn(e.catch), Vm = ((e, t) => e ? setImmediate : t ? ((n, r) => (Pi.addEventListener("message", ({ source: i, data: s }) => {
+  i === Pi && s === n && r.length && r.shift()();
 }, !1), (i) => {
-  r.push(i), ki.postMessage(n, "*");
+  r.push(i), Pi.postMessage(n, "*");
 }))(`axios@${Math.random()}`, []) : (n) => setTimeout(n))(
   typeof setImmediate == "function",
-  dn(ki.postMessage)
-), oT = typeof queueMicrotask < "u" ? queueMicrotask.bind(ki) : typeof process < "u" && process.nextTick || Vm, cT = (e) => e != null && dn(e[nu]), z = {
+  dn(Pi.postMessage)
+), oT = typeof queueMicrotask < "u" ? queueMicrotask.bind(Pi) : typeof process < "u" && process.nextTick || Vm, cT = (e) => e != null && dn(e[nu]), z = {
   isArray: $s,
   isArrayBuffer: Cm,
   isBuffer: fc,
@@ -13284,7 +13284,7 @@ const rT = (e) => {
   noop: eT,
   toFiniteNumber: tT,
   findKey: Fm,
-  global: ki,
+  global: Pi,
   isContextDefined: Mm,
   isSpecCompliantForm: nT,
   toJSONObject: rT,
@@ -13990,7 +13990,7 @@ function Ym(e, t, n) {
   return e && (r || n == !1) ? HT(e, t) : t;
 }
 const Zd = (e) => e instanceof pn ? { ...e } : e;
-function Ki(e, t) {
+function Gi(e, t) {
   t = t || {};
   const n = {};
   function r(u, f, l, d) {
@@ -14055,7 +14055,7 @@ function Ki(e, t) {
   }), n;
 }
 const Zm = (e) => {
-  const t = Ki({}, e);
+  const t = Gi({}, e);
   let { data: n, withXSRFToken: r, xsrfHeaderName: i, xsrfCookieName: s, headers: o, auth: c } = t;
   t.headers = o = pn.from(o), t.url = Km(Ym(t.baseURL, t.url, t.allowAbsoluteUrls), e.params, e.paramsSerializer), c && o.set(
     "Authorization",
@@ -14456,7 +14456,7 @@ const Qc = {
   assertOptions: zT,
   validators: cu
 }, Yn = Qc.validators;
-let Fi = class {
+let Mi = class {
   constructor(t) {
     this.defaults = t || {}, this.interceptors = {
       request: new Wd(),
@@ -14489,7 +14489,7 @@ let Fi = class {
     }
   }
   _request(t, n) {
-    typeof t == "string" ? (n = n || {}, n.url = t) : n = t || {}, n = Ki(this.defaults, 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, {
       silentJSONParsing: Yn.transitional(Yn.boolean),
@@ -14551,14 +14551,14 @@ let Fi = class {
     return f;
   }
   getUri(t) {
-    t = Ki(this.defaults, t);
+    t = Gi(this.defaults, t);
     const n = Ym(t.baseURL, t.url, t.allowAbsoluteUrls);
     return Km(n, t.params, t.paramsSerializer);
   }
 };
 z.forEach(["delete", "get", "head", "options"], function(t) {
-  Fi.prototype[t] = function(n, r) {
-    return this.request(Ki(r || {}, {
+  Mi.prototype[t] = function(n, r) {
+    return this.request(Gi(r || {}, {
       method: t,
       url: n,
       data: (r || {}).data
@@ -14568,7 +14568,7 @@ z.forEach(["delete", "get", "head", "options"], function(t) {
 z.forEach(["post", "put", "patch"], function(t) {
   function n(r) {
     return function(s, o, c) {
-      return this.request(Ki(c || {}, {
+      return this.request(Gi(c || {}, {
         method: t,
         headers: r ? {
           "Content-Type": "multipart/form-data"
@@ -14578,7 +14578,7 @@ z.forEach(["post", "put", "patch"], function(t) {
       }));
     };
   }
-  Fi.prototype[t] = n(), Fi.prototype[t + "Form"] = n(!0);
+  Mi.prototype[t] = n(), Mi.prototype[t + "Form"] = n(!0);
 });
 let YT = class nw {
   constructor(t) {
@@ -14730,13 +14730,13 @@ Object.entries(el).forEach(([e, t]) => {
   el[t] = e;
 });
 function rw(e) {
-  const t = new Fi(e), n = Rm(Fi.prototype.request, t);
-  return z.extend(n, Fi.prototype, t, { allOwnKeys: !0 }), z.extend(n, t, null, { allOwnKeys: !0 }), n.create = function(i) {
-    return rw(Ki(e, i));
+  const t = new Mi(e), n = Rm(Mi.prototype.request, t);
+  return z.extend(n, Mi.prototype, t, { allOwnKeys: !0 }), z.extend(n, t, null, { allOwnKeys: !0 }), n.create = function(i) {
+    return rw(Gi(e, i));
   }, n;
 }
 const ht = rw(dc);
-ht.Axios = Fi;
+ht.Axios = Mi;
 ht.CanceledError = Ds;
 ht.CancelToken = YT;
 ht.isCancel = Xm;
@@ -14749,7 +14749,7 @@ ht.all = function(t) {
 };
 ht.spread = ZT;
 ht.isAxiosError = JT;
-ht.mergeConfig = Ki;
+ht.mergeConfig = Gi;
 ht.AxiosHeaders = pn;
 ht.formToJSON = (e) => Wm(z.isHTMLForm(e) ? new FormData(e) : e);
 ht.getAdapter = ew.getAdapter;
@@ -14875,42 +14875,42 @@ class wr extends Error {
     return `${this.name} (${this.kind}): ${this.message}`;
   }
 }
-class Yi extends wr {
+class Zi extends wr {
   static fromCode(t) {
     return new this(t);
   }
 }
-class An extends Yi {
+class An extends Zi {
   constructor(t) {
     super(t, Br.Trust), this.name = "TrustError", Object.setPrototypeOf(this, An.prototype);
   }
 }
-class yt extends Yi {
+class yt extends Zi {
   constructor(t) {
     super(t, Br.Protocol), this.name = "ProtocolError", Object.setPrototypeOf(this, yt.prototype);
   }
 }
-class Es extends Yi {
+class Es extends Zi {
   constructor(t) {
     super(t, Br.Reject), this.name = "RejectError", Object.setPrototypeOf(this, Es.prototype);
   }
 }
-class Sa extends Yi {
+class Sa extends Zi {
   constructor(t) {
     super(t, Br.Transport), this.name = "TransportError", Object.setPrototypeOf(this, Sa.prototype);
   }
 }
-class an extends Yi {
+class an extends Zi {
   constructor(t) {
     super(t, Br.External), this.name = "ExternalError", Object.setPrototypeOf(this, an.prototype);
   }
 }
-class et extends Yi {
+class et extends Zi {
   constructor(t) {
     super(t, Br.Input), this.name = "InputError", Object.setPrototypeOf(this, et.prototype);
   }
 }
-class un extends Yi {
+class un extends Zi {
   constructor(t) {
     super(t, Br.Unknown), this.name = "UnknownError", Object.setPrototypeOf(this, un.prototype);
   }
@@ -15124,9 +15124,9 @@ class So extends Ue {
     return this.error;
   }
 }
-class Oi extends Ue {
+class Bi extends Ue {
   constructor() {
-    super(), this.name = "IdentityInvalidErrorCode", Object.setPrototypeOf(this, Oi.prototype);
+    super(), this.name = "IdentityInvalidErrorCode", Object.setPrototypeOf(this, Bi.prototype);
   }
   toErrorMessage() {
     return "This identity has expired due this application's security policy. Please refresh your authentication.";
@@ -15323,7 +15323,7 @@ class i0 {
     };
   }
 }
-class Zi extends Error {
+class Ji extends Error {
   constructor(t) {
     super(t), this.name = "DecodingError";
   }
@@ -15350,10 +15350,10 @@ function lx(e) {
 let Co = new Uint8Array(), to, $n = 0;
 function hx(e, t) {
   Co = e, $n = 0;
-  const n = Mi();
+  const n = qi();
   return t?.(n) ?? n;
 }
-function Mi(e) {
+function qi(e) {
   const [t, n] = ea();
   switch (t) {
     case Tt.UnsignedInteger:
@@ -15373,12 +15373,12 @@ function Mi(e) {
     case Tt.Simple:
       return px(n);
   }
-  throw new Zi(`Unsupported major type: ${t}`);
+  throw new Ji(`Unsupported major type: ${t}`);
 }
 function ea() {
   const e = Co.at($n);
   if (ax(e))
-    throw new Zi("Provided CBOR data is empty");
+    throw new Ji("Provided CBOR data is empty");
   const t = fx(e), n = lx(e);
   return $n++, [t, n];
 }
@@ -15386,14 +15386,14 @@ function dx(e, t) {
   const n = Ks(e);
   if (n === 1 / 0) {
     const i = [];
-    let s = Mi();
+    let s = qi();
     for (; s !== ow; )
-      i.push(s), s = Mi();
+      i.push(s), s = qi();
     return i;
   }
   const r = new Array(n);
   for (let i = 0; i < n; i++) {
-    const s = Mi();
+    const s = qi();
     r[i] = s;
   }
   return r;
@@ -15411,14 +15411,14 @@ function px(e) {
     case Ln.Break:
       return ow;
   }
-  throw new Zi(`Unrecognized simple type: ${e.toString(2)}`);
+  throw new Ji(`Unrecognized simple type: ${e.toString(2)}`);
 }
 function yx(e, t) {
   const n = Ks(e), r = {};
   if (n === 1 / 0) {
     let [i, s] = ea();
     for (; i !== Tt.Simple && s !== Ln.Break; ) {
-      const o = nl(s), c = Mi();
+      const o = nl(s), c = qi();
       r[o] = c, [i, s] = ea();
     }
     return r;
@@ -15426,8 +15426,8 @@ function yx(e, t) {
   for (let i = 0; i < n; i++) {
     const [s, o] = ea();
     if (s !== Tt.TextString)
-      throw new Zi("Map keys must be text strings");
-    const c = nl(o), a = Mi();
+      throw new Ji("Map keys must be text strings");
+    const c = nl(o), a = qi();
     r[c] = a;
   }
   return r;
@@ -15447,7 +15447,7 @@ function Ks(e) {
     case qn.Indefinite:
       return 1 / 0;
     default:
-      throw new Zi(`Unsupported integer info: ${e.toString(2)}`);
+      throw new Ji(`Unsupported integer info: ${e.toString(2)}`);
   }
 }
 function gx(e) {
@@ -15457,7 +15457,7 @@ function gx(e) {
 function aw(e) {
   const t = Ks(e);
   if (t > Number.MAX_SAFE_INTEGER)
-    throw new Zi("Byte length is too large");
+    throw new Ji("Byte length is too large");
   const n = Number(t);
   return $n += n, Co.slice($n - n, $n);
 }
@@ -15468,8 +15468,8 @@ function nl(e) {
 function mx(e, t) {
   const n = Ks(e);
   if (n === sw)
-    return Mi();
-  throw new Zi(`Unsupported tag: ${n}.`);
+    return qi();
+  throw new Ji(`Unsupported tag: ${n}.`);
 }
 class ah extends Error {
   constructor(t) {
@@ -15634,10 +15634,10 @@ const Rc = () => {
   }
   return typeof crypto < "u" && crypto.randomInt ? crypto.randomInt(0, 4294967295) : Math.floor(Math.random() * 4294967295);
 };
-var Pi;
+var Ri;
 (function(e) {
   e.Query = "read", e.ReadState = "read_state", e.Call = "call";
-})(Pi || (Pi = {}));
+})(Ri || (Ri = {}));
 var rl;
 (function(e) {
   e.Call = "call";
@@ -15713,7 +15713,7 @@ class xs {
 function o0(e = il) {
   return async (t) => {
     const n = t.request.headers;
-    t.request.headers = n, t.endpoint === Pi.Call && (t.body.nonce = e());
+    t.request.headers = n, t.endpoint === Ri.Call && (t.body.nonce = e());
   };
 }
 function Qu(e) {
@@ -15793,7 +15793,7 @@ function qo(e) {
 function Ux(e, t) {
   return e >> BigInt(t) & Na;
 }
-const Ji = (e) => (Na << BigInt(e)) - Na;
+const Qi = (e) => (Na << BigInt(e)) - Na;
 function Cx(e) {
   return typeof e == "function" && Number.isSafeInteger(e.outputLen);
 }
@@ -15824,7 +15824,7 @@ function Vo(e) {
   };
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const ln = BigInt(0), Ft = BigInt(1), Ri = /* @__PURE__ */ BigInt(2), ww = /* @__PURE__ */ BigInt(3), bw = /* @__PURE__ */ BigInt(4), Ew = /* @__PURE__ */ BigInt(5), Hx = /* @__PURE__ */ BigInt(7), _w = /* @__PURE__ */ BigInt(8), Fx = /* @__PURE__ */ BigInt(9), Sw = /* @__PURE__ */ BigInt(16);
+const ln = BigInt(0), Ft = BigInt(1), Ui = /* @__PURE__ */ BigInt(2), ww = /* @__PURE__ */ BigInt(3), bw = /* @__PURE__ */ BigInt(4), Ew = /* @__PURE__ */ BigInt(5), Hx = /* @__PURE__ */ BigInt(7), _w = /* @__PURE__ */ BigInt(8), Fx = /* @__PURE__ */ BigInt(9), Sw = /* @__PURE__ */ BigInt(16);
 function mt(e, t) {
   const n = e % t;
   return n >= ln ? n : t + n;
@@ -15858,11 +15858,11 @@ function Tw(e, t) {
   return hh(e, r, t), r;
 }
 function Mx(e, t) {
-  const n = (e.ORDER - Ew) / _w, r = e.mul(t, Ri), i = e.pow(r, n), s = e.mul(t, i), o = e.mul(e.mul(s, Ri), i), c = e.mul(s, e.sub(o, e.ONE));
+  const n = (e.ORDER - Ew) / _w, r = e.mul(t, Ui), i = e.pow(r, n), s = e.mul(t, i), o = e.mul(e.mul(s, Ui), i), c = e.mul(s, e.sub(o, e.ONE));
   return hh(e, c, t), c;
 }
 function qx(e) {
-  const t = hi(e), n = xw(e), r = n(t, t.neg(t.ONE)), i = n(t, r), s = n(t, t.neg(r)), o = (e + Hx) / Sw;
+  const t = di(e), n = xw(e), r = n(t, t.neg(t.ONE)), i = n(t, r), s = n(t, t.neg(r)), o = (e + Hx) / Sw;
   return (c, a) => {
     let u = c.pow(a, o), f = c.mul(u, r);
     const l = c.mul(u, i), d = c.mul(u, s), y = c.eql(c.sqr(f), a), g = c.eql(c.sqr(l), a);
@@ -15875,17 +15875,17 @@ function xw(e) {
   if (e < ww)
     throw new Error("sqrt is not defined for small field");
   let t = e - Ft, n = 0;
-  for (; t % Ri === ln; )
-    t /= Ri, n++;
-  let r = Ri;
-  const i = hi(e);
+  for (; t % Ui === ln; )
+    t /= Ui, n++;
+  let r = Ui;
+  const i = di(e);
   for (; ka(i, r) === 1; )
     if (r++ > 1e3)
       throw new Error("Cannot find square root: probably non-prime P");
   if (n === 1)
     return Tw;
   let s = i.pow(r, t);
-  const o = (t + Ft) / Ri;
+  const o = (t + Ft) / Ui;
   return function(a, u) {
     if (a.is0(u))
       return u;
@@ -15948,12 +15948,12 @@ function pu(e, t, n) {
     n & Ft && (r = e.mul(r, i)), i = e.sqr(i), n >>= Ft;
   return r;
 }
-function Qi(e, t, n = !1) {
+function es(e, t, n = !1) {
   const r = new Array(t.length).fill(n ? e.ZERO : void 0), i = t.reduce((o, c, a) => e.is0(c) ? o : (r[a] = o, e.mul(o, c)), e.ONE), s = e.inv(i);
   return t.reduceRight((o, c, a) => e.is0(c) ? o : (r[a] = e.mul(o, r[a]), e.mul(o, c)), s), r;
 }
 function ka(e, t) {
-  const n = (e.ORDER - Ft) / Ri, r = e.pow(t, n), i = e.eql(r, e.ONE), s = e.eql(r, e.ZERO), o = e.eql(r, e.neg(e.ONE));
+  const n = (e.ORDER - Ft) / Ui, r = e.pow(t, n), i = e.eql(r, e.ONE), s = e.eql(r, e.ZERO), o = e.eql(r, e.neg(e.ONE));
   if (!i && !s && !o)
     throw new Error("invalid Legendre symbol result");
   return i ? 1 : s ? 0 : -1;
@@ -15963,7 +15963,7 @@ function Dx(e, t) {
   const n = t !== void 0 ? t : e.toString(2).length, r = Math.ceil(n / 8);
   return { nBitLength: n, nByteLength: r };
 }
-function hi(e, t, n = !1, r = {}) {
+function di(e, t, n = !1, r = {}) {
   if (e <= ln)
     throw new Error("invalid field: expected ORDER > 0, got " + e);
   let i, s, o = !1, c;
@@ -15983,7 +15983,7 @@ function hi(e, t, n = !1, r = {}) {
     isLE: n,
     BITS: a,
     BYTES: u,
-    MASK: Ji(a),
+    MASK: Qi(a),
     ZERO: ln,
     ONE: Ft,
     allowedLengths: c,
@@ -16028,7 +16028,7 @@ function hi(e, t, n = !1, r = {}) {
       return g;
     },
     // TODO: we don't need it here, move out to separate fn
-    invertBatch: (d) => Qi(l, d),
+    invertBatch: (d) => es(l, d),
     // We can't move this out because Fp6, Fp12 implement it
     // and it's unclear what to return in there.
     cmov: (d, y, g) => g ? y : d
@@ -16053,13 +16053,13 @@ function jx(e, t, n = !1) {
   return n ? yw(c, i) : Ut(c, i);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Cs = BigInt(0), Ui = BigInt(1);
+const Cs = BigInt(0), Ci = BigInt(1);
 function Pa(e, t) {
   const n = t.negate();
   return e ? n : t;
 }
 function _r(e, t) {
-  const n = Qi(e.Fp, t.map((r) => r.Z));
+  const n = es(e.Fp, t.map((r) => r.Z));
   return t.map((r, i) => e.fromAffine(r.toAffine(n[i])));
 }
 function Ow(e, t) {
@@ -16068,13 +16068,13 @@ function Ow(e, t) {
 }
 function tf(e, t) {
   Ow(e, t);
-  const n = Math.ceil(t / e) + 1, r = 2 ** (e - 1), i = 2 ** e, s = Ji(e), o = BigInt(e);
+  const n = Math.ceil(t / e) + 1, r = 2 ** (e - 1), i = 2 ** e, s = Qi(e), o = BigInt(e);
   return { windows: n, windowSize: r, mask: s, maxNumber: i, shiftBy: o };
 }
 function f0(e, t, n) {
   const { windowSize: r, mask: i, maxNumber: s, shiftBy: o } = n;
   let c = Number(e & i), a = e >> o;
-  c > r && (c -= s, a += Ui);
+  c > r && (c -= s, a += Ci);
   const u = t * r, f = u + Math.abs(c) - 1, l = c === 0, d = c < 0, y = t % 2 !== 0;
   return { nextN: a, offset: f, isZero: l, isNeg: d, isNegF: y, offsetF: u };
 }
@@ -16111,7 +16111,7 @@ class Nw {
   _unsafeLadder(t, n, r = this.ZERO) {
     let i = t;
     for (; n > Cs; )
-      n & Ui && (r = r.add(i)), i = i.double(), n >>= Ui;
+      n & Ci && (r = r.add(i)), i = i.double(), n >>= Ci;
     return r;
   }
   /**
@@ -16195,7 +16195,7 @@ class Nw {
 function Wx(e, t, n, r) {
   let i = t, s = e.ZERO, o = e.ZERO;
   for (; n > Cs || r > Cs; )
-    n & Ui && (s = s.add(i)), r & Ui && (o = o.add(i)), i = i.double(), n >>= Ui, r >>= Ui;
+    n & Ci && (s = s.add(i)), r & Ci && (o = o.add(i)), i = i.double(), n >>= Ci, r >>= Ci;
   return { p1: s, p2: o };
 }
 function kw(e, t, n, r) {
@@ -16206,7 +16206,7 @@ function kw(e, t, n, r) {
   const o = e.ZERO, c = qo(BigInt(i));
   let a = 1;
   c > 12 ? a = c - 3 : c > 4 ? a = c - 2 : c > 0 && (a = 2);
-  const u = Ji(a), f = new Array(Number(u) + 1).fill(o), l = Math.floor((t.BITS - 1) / a) * a;
+  const u = Qi(a), f = new Array(Number(u) + 1).fill(o), l = Math.floor((t.BITS - 1) / a) * a;
   let d = o;
   for (let y = l; y >= 0; y -= a) {
     f.fill(o);
@@ -16229,7 +16229,7 @@ function h0(e, t, n) {
       throw new Error("Field.ORDER must match order: Fp == p, Fn == n");
     return Aw(t), t;
   } else
-    return hi(e, { isLE: n });
+    return di(e, { isLE: n });
 }
 function Pw(e, t, n = {}, r) {
   if (r === void 0 && (r = e === "edwards"), !t || typeof t != "object")
@@ -16246,7 +16246,7 @@ function Pw(e, t, n = {}, r) {
   return t = Object.freeze(Object.assign({}, t)), { CURVE: t, Fp: i, Fn: s };
 }
 const Xx = rr;
-function ti(e, t) {
+function ni(e, t) {
   if (Lo(e), Lo(t), e < 0 || e >= 1 << 8 * t)
     throw new Error("invalid I2OSP input: " + e);
   const n = Array.from({ length: t }).fill(0);
@@ -16274,10 +16274,10 @@ function Yx(e, t, n, r) {
   const { outputLen: i, blockLen: s } = r, o = Math.ceil(n / i);
   if (n > 65535 || o > 255)
     throw new Error("expand_message_xmd: invalid lenInBytes");
-  const c = $e(t, ti(t.length, 1)), a = ti(0, s), u = ti(n, 2), f = new Array(o), l = r($e(a, e, u, ti(0, 1), c));
-  f[0] = r($e(l, ti(1, 1), c));
+  const c = $e(t, ni(t.length, 1)), a = ni(0, s), u = ni(n, 2), f = new Array(o), l = r($e(a, e, u, ni(0, 1), c));
+  f[0] = r($e(l, ni(1, 1), c));
   for (let y = 1; y <= o; y++) {
-    const g = [zx(l, f[y - 1]), ti(y + 1, 1), c];
+    const g = [zx(l, f[y - 1]), ni(y + 1, 1), c];
     f[y] = r($e(...g));
   }
   return $e(...f).slice(0, n);
@@ -16289,7 +16289,7 @@ function Zx(e, t, n, r, i) {
   }
   if (n > 65535 || t.length > 255)
     throw new Error("expand_message_xof: invalid lenInBytes");
-  return i.create({ dkLen: n }).update(e).update(ti(n, 2)).update(t).update(ti(t.length, 1)).digest();
+  return i.create({ dkLen: n }).update(e).update(ni(n, 2)).update(t).update(ni(t.length, 1)).digest();
 }
 function sf(e, t, n) {
   gc(n, {
@@ -16326,7 +16326,7 @@ function sf(e, t, n) {
 function Uw(e, t) {
   const n = t.map((r) => Array.from(r).reverse());
   return (r, i) => {
-    const [s, o, c, a] = n.map((l) => l.reduce((d, y) => e.add(e.mul(d, r), y))), [u, f] = Qi(e, [o, a], !0);
+    const [s, o, c, a] = n.map((l) => l.reduce((d, y) => e.add(e.mul(d, r), y))), [u, f] = es(e, [o, a], !0);
     return r = e.mul(s, u), i = e.mul(i, e.mul(c, f)), { x: r, y: i };
   };
 }
@@ -16373,14 +16373,14 @@ const p0 = (e, t) => (e + (e >= 0 ? t : -t) / pr) / t;
 function Qx(e, t, n) {
   const [[r, i], [s, o]] = t, c = p0(o * e, n), a = p0(-i * e, n);
   let u = e - c * r - a * s, f = -c * i - a * o;
-  const l = u < Ci, d = f < Ci;
+  const l = u < Hi, d = f < Hi;
   l && (u = -u), d && (f = -f);
-  const y = Ji(Math.ceil(qo(n) / 2)) + Jt;
-  if (u < Ci || u >= y || f < Ci || f >= y)
+  const y = Qi(Math.ceil(qo(n) / 2)) + Jt;
+  if (u < Hi || u >= y || f < Hi || f >= y)
     throw new Error("splitScalar (endomorphism): failed, k=" + e);
   return { k1neg: l, k1: u, k2neg: d, k2: f };
 }
-const Ci = BigInt(0), Jt = BigInt(1), pr = BigInt(2), ys = BigInt(3), sl = BigInt(4);
+const Hi = BigInt(0), Jt = BigInt(1), pr = BigInt(2), ys = BigInt(3), sl = BigInt(4);
 function Ra(e, t) {
   const { BYTES: n } = e;
   let r;
@@ -16634,7 +16634,7 @@ function e3(e, t = {}) {
       const { endo: $ } = t, P = this;
       if (!i.isValid(H))
         throw new Error("invalid scalar: out of range");
-      if (H === Ci || P.is0())
+      if (H === Hi || P.is0())
         return v.ZERO;
       if (H === Jt)
         return P;
@@ -16716,8 +16716,8 @@ function t3(e) {
 }
 function n3(e, t) {
   const n = e.ORDER;
-  let r = Ci;
-  for (let g = n - Jt; g % pr === Ci; g /= pr)
+  let r = Hi;
+  for (let g = n - Jt; g % pr === Hi; g /= pr)
     r += Jt;
   const i = r, s = pr << i - Jt - Jt, o = s * pr, c = (n - Jt) / o, a = (c - Jt) / pr, u = o - Jt, f = s, l = e.pow(t, c), d = e.pow(t, (c + Jt) / pr);
   let y = (g, m) => {
@@ -16768,7 +16768,7 @@ function Cw(e, t) {
     g = e.mul(c, o), g = e.mul(g, E), y = e.cmov(y, u, m), g = e.cmov(g, E, m);
     const _ = e.isOdd(o) === e.isOdd(g);
     g = e.cmov(e.neg(g), g, _);
-    const S = Qi(e, [f], !0)[0];
+    const S = es(e, [f], !0)[0];
     return y = e.mul(y, S), { x: y, y: g };
   };
 }
@@ -16796,7 +16796,7 @@ function i3(e) {
     Gy: e.Gy
   }, n = e.Fp;
   let r = e.allowedPrivateKeyLengths ? Array.from(new Set(e.allowedPrivateKeyLengths.map((o) => Math.ceil(o / 2)))) : void 0;
-  const i = hi(t.n, {
+  const i = di(t.n, {
     BITS: e.nBitLength,
     allowedLengths: r,
     modFromBytes: e.wrapPrivateKey
@@ -17172,7 +17172,7 @@ class h3 {
     return pu(this, t, n);
   }
   invertBatch(t) {
-    return Qi(this, t);
+    return es(this, t);
   }
   // Normalized
   add(t, n) {
@@ -17378,7 +17378,7 @@ class d3 {
     return pu(this, t, n);
   }
   invertBatch(t) {
-    return Qi(this, t);
+    return es(this, t);
   }
   inv({ c0: t, c1: n, c2: r }) {
     const { Fp2: i } = this;
@@ -17506,7 +17506,7 @@ class p3 {
     return pu(this, t, n);
   }
   invertBatch(t) {
-    return Qi(this, t);
+    return es(this, t);
   }
   // Normalized
   add({ c0: t, c1: n }, { c0: r, c1: i }) {
@@ -17670,11 +17670,11 @@ class p3 {
   }
 }
 function y3(e) {
-  const t = hi(e.ORDER), n = new h3(t, e), r = new d3(n), i = new p3(r, e);
+  const t = di(e.ORDER), n = new h3(t, e), r = new d3(n), i = new p3(r, e);
   return { Fp: t, Fp2: n, Fp6: r, Fp12: i };
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const jt = BigInt(0), Ua = BigInt(1), kn = BigInt(2), yu = BigInt(3), $o = BigInt(4), ni = BigInt("0xd201000000010000"), g3 = qo(ni), Gi = {
+const jt = BigInt(0), Ua = BigInt(1), kn = BigInt(2), yu = BigInt(3), $o = BigInt(4), ri = BigInt("0xd201000000010000"), g3 = qo(ri), Wi = {
   p: BigInt("0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab"),
   n: BigInt("0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001"),
   h: BigInt("0x396c8c005555e1568c00aaab0000aaab"),
@@ -17682,11 +17682,11 @@ const jt = BigInt(0), Ua = BigInt(1), kn = BigInt(2), yu = BigInt(3), $o = BigIn
   b: $o,
   Gx: BigInt("0x17f1d3a73197d7942695638c4fa9ac0fc3688c4f9774b905a14e3a3f171bac586c55e83ff97a1aeffb3af00adb22c6bb"),
   Gy: BigInt("0x08b3f481e3aaa0f1a09e30ed741d8ae4fcf5e095d5d00af600db18cb2c04b3edd03cc744a2888ae40caa232946c5e7e1")
-}, m3 = hi(Gi.n, {
+}, m3 = di(Wi.n, {
   modFromBytes: !0,
   isLE: !0
 }), { Fp: Ee, Fp2: Re, Fp6: w3, Fp12: Me } = y3({
-  ORDER: Gi.p,
+  ORDER: Wi.p,
   X_LEN: g3,
   // Finite extension field over irreducible polynominal.
   // Fp(u) / (u² - β) where β = -1
@@ -17696,7 +17696,7 @@ const jt = BigInt(0), Ua = BigInt(1), kn = BigInt(2), yu = BigInt(3), $o = BigIn
     return { c0: Ee.sub(n, r), c1: Ee.add(n, r) };
   },
   Fp12finalExponentiate: (e) => {
-    const t = ni, n = Me.div(Me.frobeniusMap(e, 6), e), r = Me.mul(Me.frobeniusMap(n, 2), n), i = Me.conjugate(Me._cyclotomicExp(r, t)), s = Me.mul(Me.conjugate(Me._cyclotomicSquare(r)), i), o = Me.conjugate(Me._cyclotomicExp(s, t)), c = Me.conjugate(Me._cyclotomicExp(o, t)), a = Me.mul(Me.conjugate(Me._cyclotomicExp(c, t)), Me._cyclotomicSquare(i)), u = Me.conjugate(Me._cyclotomicExp(a, t)), f = Me.frobeniusMap(Me.mul(i, c), 2), l = Me.frobeniusMap(Me.mul(o, r), 3), d = Me.frobeniusMap(Me.mul(a, Me.conjugate(r)), 1), y = Me.mul(Me.mul(u, Me.conjugate(s)), r);
+    const t = ri, n = Me.div(Me.frobeniusMap(e, 6), e), r = Me.mul(Me.frobeniusMap(n, 2), n), i = Me.conjugate(Me._cyclotomicExp(r, t)), s = Me.mul(Me.conjugate(Me._cyclotomicSquare(r)), i), o = Me.conjugate(Me._cyclotomicExp(s, t)), c = Me.conjugate(Me._cyclotomicExp(o, t)), a = Me.mul(Me.conjugate(Me._cyclotomicExp(c, t)), Me._cyclotomicSquare(i)), u = Me.conjugate(Me._cyclotomicExp(a, t)), f = Me.frobeniusMap(Me.mul(i, c), 2), l = Me.frobeniusMap(Me.mul(o, r), 3), d = Me.frobeniusMap(Me.mul(a, Me.conjugate(r)), 1), y = Me.mul(Me.mul(u, Me.conjugate(s)), r);
     return Me.mul(Me.mul(Me.mul(f, l), d), y);
   }
 }), { G2psi: _0, G2psi2: b3 } = l3(Ee, Re, Re.div(Re.ONE, Re.NONRESIDUE)), cf = Object.freeze({
@@ -17709,7 +17709,7 @@ const jt = BigInt(0), Ua = BigInt(1), kn = BigInt(2), yu = BigInt(3), $o = BigIn
   hash: En
 }), ph = {
   p: Re.ORDER,
-  n: Gi.n,
+  n: Wi.n,
   h: BigInt("0x5d543a95414e7f1091d50792876a202cd91de4547085abaa68a205b2e5a7ddfa628f1cb4d9e82ef21537e293a6691ae1616ec6e786f0c70cf1c38e31c7238e5"),
   a: Re.ZERO,
   b: Re.fromBigTuple([$o, $o]),
@@ -17753,13 +17753,13 @@ function af(e) {
 function _3(e) {
   const { compressed: t, infinity: n, sort: r, value: i } = mu(e), { BYTES: s, ORDER: o } = Ee;
   if (i.length === 48 && t) {
-    const c = rr(i), a = Ee.create(c & Ji(Ee.BITS));
+    const c = rr(i), a = Ee.create(c & Qi(Ee.BITS));
     if (n) {
       if (a !== jt)
         throw new Error("invalid G1 point: non-empty, at infinity, with compression");
       return { x: jt, y: jt };
     }
-    const u = Ee.add(Ee.pow(a, yu), Ee.create(Gi.b));
+    const u = Ee.add(Ee.pow(a, yu), Ee.create(Wi.b));
     let f = Ee.sqrt(u);
     if (!f)
       throw new Error("invalid G1 point: compressed point");
@@ -17779,7 +17779,7 @@ function S0(e) {
   const { infinity: t, sort: n, value: r } = mu(on("signatureHex", e, 48)), i = Ee.ORDER, s = wu.G1.Point, o = rr(r);
   if (t)
     return s.ZERO;
-  const c = Ee.create(o & Ji(Ee.BITS)), a = Ee.add(Ee.pow(c, yu), Ee.create(Gi.b));
+  const c = Ee.create(o & Qi(Ee.BITS)), a = Ee.add(Ee.pow(c, yu), Ee.create(Wi.b));
   let u = Ee.sqrt(a);
   if (!u)
     throw new Error("invalid G1 point: compressed");
@@ -17845,7 +17845,7 @@ function T0(e) {
   const c = rr(i.slice(0, o)), a = rr(i.slice(o));
   if (n)
     return s.ZERO;
-  const u = Ee.create(c & Ji(Ee.BITS)), f = Ee.create(a), l = Re.create({ c0: f, c1: u }), d = Re.add(Re.pow(l, yu), ph.b);
+  const u = Ee.create(c & Qi(Ee.BITS)), f = Ee.create(a), l = Re.create({ c0: f, c1: u }), d = Re.add(Re.pow(l, yu), ph.b);
   let y = Re.sqrt(d);
   if (!y)
     throw new Error("Failed to find a square root");
@@ -17865,7 +17865,7 @@ const wu = f3({
   },
   // G1: y² = x³ + 4
   G1: {
-    ...Gi,
+    ...Wi,
     Fp: Ee,
     htfDefaults: { ...cf, m: 1, DST: "BLS_SIG_BLS12381G1_XMD:SHA-256_SSWU_RO_NUL_" },
     wrapPrivateKey: !0,
@@ -17876,11 +17876,11 @@ const wu = f3({
     // https://eprint.iacr.org/2021/1130.pdf
     isTorsionFree: (e, t) => {
       const n = BigInt("0x5f19672fdf76ce51ba69c6076a0f77eaddb3a93be6f89688de17d813620a00022e01fffffffefffe"), r = new e(Ee.mul(t.X, n), t.Y, t.Z);
-      return t.multiplyUnsafe(ni).negate().multiplyUnsafe(ni).equals(r);
+      return t.multiplyUnsafe(ri).negate().multiplyUnsafe(ri).equals(r);
     },
     // Clear cofactor of G1
     // https://eprint.iacr.org/2019/403
-    clearCofactor: (e, t) => t.multiplyUnsafe(ni).add(t),
+    clearCofactor: (e, t) => t.multiplyUnsafe(ri).add(t),
     mapToCurve: O3,
     fromBytes: _3,
     toBytes: E3,
@@ -17917,13 +17917,13 @@ const wu = f3({
     // It returns false for shitty points.
     // https://eprint.iacr.org/2021/1130.pdf
     // Older version: https://eprint.iacr.org/2019/814.pdf
-    isTorsionFree: (e, t) => t.multiplyUnsafe(ni).negate().equals(_0(e, t)),
+    isTorsionFree: (e, t) => t.multiplyUnsafe(ri).negate().equals(_0(e, t)),
     // Maps the point into the prime-order subgroup G2.
     // clear_cofactor_bls12381_g2 from RFC 9380.
     // https://eprint.iacr.org/2017/419.pdf
     // prettier-ignore
     clearCofactor: (e, t) => {
-      const n = ni;
+      const n = ri;
       let r = t.multiplyUnsafe(n).negate(), i = _0(e, t), s = t.double();
       return s = b3(e, s), s = s.subtract(i), i = r.add(i), i = i.multiplyUnsafe(n).negate(), s = s.add(i), s = s.subtract(r), s.subtract(t);
     },
@@ -17948,9 +17948,9 @@ const wu = f3({
     }
   },
   params: {
-    ateLoopSize: ni,
+    ateLoopSize: ri,
     // The BLS parameter x for BLS12-381
-    r: Gi.n,
+    r: Wi.n,
     // order; z⁴ − z² + 1; CURVE.n from other curves
     xNegative: !0,
     twistType: "multiplicative"
@@ -18133,7 +18133,7 @@ function M3(e, t) {
       return !0;
   return !1;
 }
-class qi {
+class Vi {
   #t = !1;
   #e = void 0;
   /**
@@ -18142,11 +18142,11 @@ class qi {
    * @throws if the verification of the certificate fails
    */
   static async create(t) {
-    const n = qi.createUnverified(t);
+    const n = Vi.createUnverified(t);
     return await n.verify(), n;
   }
   static createUnverified(t) {
-    return new qi(t.certificate, t.rootKey, t.canisterId, t.blsVerify ?? N3, t.maxAgeInMinutes, t.disableTimeVerification, t.agent);
+    return new Vi(t.certificate, t.rootKey, t.canisterId, t.blsVerify ?? N3, t.maxAgeInMinutes, t.disableTimeVerification, t.agent);
   }
   constructor(t, n, r, i, s = C3, o = !1, c) {
     this._rootKey = n, this._canisterId = r, this._blsVerify = i, this._maxAgeInMinutes = s, this.#t = o, this.cert = er(t), c && "getTimeDiffMsecs" in c && "hasSyncedTime" in c && "syncTime" in c && (this.#e = c);
@@ -18190,7 +18190,7 @@ class qi {
   async _checkDelegationAndGetKey(t) {
     if (!t)
       return this._rootKey;
-    const n = qi.createUnverified({
+    const n = Vi.createUnverified({
       certificate: t.certificate,
       rootKey: this._rootKey,
       canisterId: this._canisterId,
@@ -18420,7 +18420,7 @@ const A0 = async (e) => {
           throw an.fromCode(new js());
         const l = t.rootKey, d = await t.readState(i, {
           paths: [f]
-        }), y = await qi.create({
+        }), y = await Vi.create({
           certificate: d.certificate,
           rootKey: l,
           canisterId: i,
@@ -18889,7 +18889,7 @@ function X3(e) {
     h: e.h,
     Gx: e.Gx,
     Gy: e.Gy
-  }, n = e.Fp, r = hi(t.n, e.nBitLength, !0), i = { Fp: n, Fn: r, uvRatio: e.uvRatio }, s = {
+  }, n = e.Fp, r = di(t.n, e.nBitLength, !0), i = { Fp: n, Fn: r, uvRatio: e.uvRatio }, s = {
     randomBytes: e.randomBytes,
     adjustScalarBytes: e.adjustScalarBytes,
     domain: e.domain,
@@ -18937,7 +18937,7 @@ function n8(e, t) {
   const c = mt(t * o * o, n), a = o, u = mt(o * I0, n), f = c === e, l = c === mt(-e, n), d = c === mt(-e * I0, n);
   return f && (o = a), (l || d) && (o = u), Lx(o, n) && (o = mt(-o, n)), { isValid: f || l, value: o };
 }
-const r8 = hi(qw.p, { isLE: !0 }), i8 = {
+const r8 = di(qw.p, { isLE: !0 }), i8 = {
   ...qw,
   Fp: r8,
   hash: n2,
@@ -19219,23 +19219,23 @@ const u8 = (e, t) => {
   return o;
 };
 var Ko, Go;
-const Ni = class Ni {
+const ki = class ki {
   // `fromRaw` and `fromDer` should be used for instantiation, not this constructor.
   constructor(t) {
     rn(this, Ko);
     rn(this, Go);
-    if (t.byteLength !== Ni.RAW_KEY_LENGTH)
+    if (t.byteLength !== ki.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, Ni.derEncode(t));
+    zt(this, Ko, t), zt(this, Go, ki.derEncode(t));
   }
   static from(t) {
     return this.fromDer(t.toDer());
   }
   static fromRaw(t) {
-    return new Ni(t);
+    return new ki(t);
   }
   static fromDer(t) {
-    return new Ni(this.derDecode(t));
+    return new ki(this.derDecode(t));
   }
   static derEncode(t) {
     return a8(t, P0);
@@ -19259,8 +19259,8 @@ const Ni = class Ni {
     return this.rawKey;
   }
 };
-Ko = new WeakMap(), Go = new WeakMap(), Ni.RAW_KEY_LENGTH = 32;
-let al = Ni;
+Ko = new WeakMap(), Go = new WeakMap(), ki.RAW_KEY_LENGTH = 32;
+let al = ki;
 class f8 {
   constructor() {
     this.observers = [];
@@ -19488,7 +19488,7 @@ class Tr {
   }
   async getPrincipal() {
     if (!this.#n)
-      throw an.fromCode(new Oi());
+      throw an.fromCode(new Bi());
     return (await this.#n).getPrincipal();
   }
   /**
@@ -19506,7 +19506,7 @@ class Tr {
   async call(t, n, r) {
     const i = n.callSync ?? !0, s = await (r ?? this.#n);
     if (!s)
-      throw an.fromCode(new Oi());
+      throw an.fromCode(new Bi());
     const o = Ke.from(t), c = n.effectiveCanisterId ? Ke.from(n.effectiveCanisterId) : o;
     await this.#y(c);
     const a = s.getPrincipal(), u = hf(this.#o, this.#i), f = {
@@ -19526,7 +19526,7 @@ class Tr {
           ...this.#r ? { Authorization: "Basic " + btoa(this.#r) } : {}
         }
       },
-      endpoint: Pi.Call,
+      endpoint: Ri.Call,
       body: f
     }), d;
     n?.nonce ? d = y(n.nonce) : l.body.nonce ? d = y(l.body.nonce) : d = void 0, f.nonce = d;
@@ -19683,7 +19683,7 @@ class Tr {
     let o;
     const c = await (r ?? this.#n);
     if (!c)
-      throw an.fromCode(new Oi());
+      throw an.fromCode(new Bi());
     const a = Ke.from(t), u = c.getPrincipal(), f = hf(this.#o, this.#i), l = {
       request_type: Ho.Query,
       canister_id: a,
@@ -19700,7 +19700,7 @@ class Tr {
           ...this.#r ? { Authorization: "Basic " + btoa(this.#r) } : {}
         }
       },
-      endpoint: Pi.Query,
+      endpoint: Ri.Query,
       body: l
     }), o = await c.transformRequest(o);
     const y = Ju(o.body), g = {
@@ -19759,7 +19759,7 @@ class Tr {
     await this.#y();
     const r = await (n ?? this.#n);
     if (!r)
-      throw an.fromCode(new Oi());
+      throw an.fromCode(new Bi());
     const i = r.getPrincipal(), s = await this._transform({
       request: {
         method: "POST",
@@ -19768,7 +19768,7 @@ class Tr {
           ...this.#r ? { Authorization: "Basic " + btoa(this.#r) } : {}
         }
       },
-      endpoint: Pi.ReadState,
+      endpoint: Ri.ReadState,
       body: {
         request_type: Ho.ReadState,
         paths: t.paths,
@@ -19795,7 +19795,7 @@ class Tr {
       a = o(n);
       const f = await this.#n;
       if (!f)
-        throw an.fromCode(new Oi());
+        throw an.fromCode(new Bi());
       c = await this.createReadStateRequest(n, f);
     }
     this.log.print(`fetching "/api/v2/canister/${s}/read_state" with request:`, c);
@@ -19932,7 +19932,7 @@ class Tr {
   }
   _transform(t) {
     let n = Promise.resolve(t);
-    if (t.endpoint === Pi.Call)
+    if (t.endpoint === Ri.Call)
       for (const r of this.#l)
         n = n.then((i) => r(i).then((s) => s || i));
     else
@@ -20017,7 +20017,7 @@ async function Lw(e, t, n, r = {}) {
     pollingOptions: r
   }), s = await e.readState(t, { paths: [i] }, void 0, o)) : s = await e.readState(t, { paths: [i] }), e.rootKey == null)
     throw an.fromCode(new js());
-  const a = await qi.create({
+  const a = await Vi.create({
     certificate: s.certificate,
     rootKey: e.rootKey,
     canisterId: t,
@@ -20133,7 +20133,7 @@ class Ca {
     this[xn] = Object.freeze(t);
   }
 }
-function ss(e, t) {
+function os(e, t) {
   const n = om(e, t);
   switch (n.length) {
     case 0:
@@ -20177,8 +20177,8 @@ function C8(e, t, n, r) {
       case Rs.Replied:
         return n.annotations.includes(ll) ? {
           httpDetails: d,
-          result: ss(n.retTypes, l.reply.arg)
-        } : ss(n.retTypes, l.reply.arg);
+          result: os(n.retTypes, l.reply.arg)
+        } : os(n.retTypes, l.reply.arg);
     }
   } : i = async (o, ...c) => {
     o = {
@@ -20203,7 +20203,7 @@ function C8(e, t, n, r) {
       if (a.rootKey == null)
         throw an.fromCode(new js());
       const R = E.body.certificate;
-      w = await qi.create({
+      w = await Vi.create({
         certificate: R,
         rootKey: a.rootKey,
         canisterId: y,
@@ -20244,14 +20244,14 @@ function C8(e, t, n, r) {
       return T && O ? {
         httpDetails: A,
         certificate: w,
-        result: ss(n.retTypes, S)
+        result: os(n.retTypes, S)
       } : O ? {
         certificate: w,
-        result: ss(n.retTypes, S)
+        result: os(n.retTypes, S)
       } : T ? {
         httpDetails: A,
-        result: ss(n.retTypes, S)
-      } : ss(n.retTypes, S);
+        result: os(n.retTypes, S)
+      } : os(n.retTypes, S);
     {
       const R = new Vn(`Call was returned undefined. We cannot determine if the call was successful or not. Return types: [${n.retTypes.map((M) => M.display()).join(",")}].`);
       throw R.callContext = {
@@ -20273,7 +20273,7 @@ const mn = {
   P2TR: { P2TR: null },
   UNKNOWN: { UNKNOWN: null }
 };
-var mi = {}, Xe = {}, pf = {}, Yt = {}, ar = {}, V0;
+var wi = {}, Xe = {}, pf = {}, Yt = {}, ar = {}, V0;
 function Wn() {
   return V0 || (V0 = 1, Object.defineProperty(ar, "__esModule", { value: !0 }), ar.testnet = ar.regtest = ar.bitcoin = void 0, ar.bitcoin = {
     /**
@@ -20389,10 +20389,10 @@ function jw() {
   }
   return ur.encode = n, ur;
 }
-var wi = {}, $0;
+var bi = {}, $0;
 function wh() {
-  if ($0) return wi;
-  $0 = 1, Object.defineProperty(wi, "__esModule", { value: !0 }), wi.REVERSE_OPS = wi.OPS = void 0;
+  if ($0) return bi;
+  $0 = 1, Object.defineProperty(bi, "__esModule", { value: !0 }), bi.REVERSE_OPS = bi.OPS = void 0;
   const e = {
     OP_FALSE: 0,
     OP_0: 0,
@@ -20514,14 +20514,14 @@ function wh() {
     OP_PUBKEY: 254,
     OP_INVALIDOPCODE: 255
   };
-  wi.OPS = e;
+  bi.OPS = e;
   const t = {};
-  wi.REVERSE_OPS = t;
+  bi.REVERSE_OPS = t;
   for (const n of Object.keys(e)) {
     const r = e[n];
     t[r] = n;
   }
-  return wi;
+  return bi;
 }
 var fr = {}, D0;
 function H8() {
@@ -20561,10 +20561,10 @@ function H8() {
   }
   return fr.decode = r, fr;
 }
-var bi = {}, j0;
+var Ei = {}, j0;
 function F8() {
-  if (j0) return bi;
-  j0 = 1, Object.defineProperty(bi, "__esModule", { value: !0 }), bi.encode = bi.decode = void 0;
+  if (j0) return Ei;
+  j0 = 1, Object.defineProperty(Ei, "__esModule", { value: !0 }), Ei.encode = Ei.decode = void 0;
   function e(r, i, s) {
     i = i || 4, s = s === void 0 ? !0 : s;
     const o = r.length;
@@ -20581,7 +20581,7 @@ function F8() {
       c |= r[a] << 8 * a;
     return r[o - 1] & 128 ? -(c & ~(128 << 8 * (o - 1))) : c;
   }
-  bi.decode = e;
+  Ei.decode = e;
   function t(r) {
     return r > 2147483647 ? 5 : r > 8388607 ? 4 : r > 32767 ? 3 : r > 127 ? 2 : r > 0 ? 1 : 0;
   }
@@ -20592,9 +20592,9 @@ function F8() {
       o.writeUInt8(i & 255, a), i >>= 8;
     return o[s - 1] & 128 ? o.writeUInt8(c ? 128 : 0, s - 1) : c && (o[s - 1] |= 128), o;
   }
-  return bi.encode = n, bi;
+  return Ei.encode = n, Ei;
 }
-var Ei = {}, mf = {}, wf, K0;
+var _i = {}, mf = {}, wf, K0;
 function bh() {
   if (K0) return wf;
   K0 = 1;
@@ -20992,8 +20992,8 @@ function Xt() {
 }
 var Y0;
 function V8() {
-  if (Y0) return Ei;
-  Y0 = 1, Object.defineProperty(Ei, "__esModule", { value: !0 }), Ei.encode = Ei.decode = void 0;
+  if (Y0) return _i;
+  Y0 = 1, Object.defineProperty(_i, "__esModule", { value: !0 }), _i.encode = _i.decode = void 0;
   const e = jw(), t = nn(), n = Xt(), { typeforce: r } = n, i = Buffer.alloc(1, 0);
   function s(u) {
     let f = 0;
@@ -21012,7 +21012,7 @@ function V8() {
     const l = e.decode(u.slice(0, -1)), d = o(l.r), y = o(l.s);
     return { signature: Buffer.concat([d, y], 64), hashType: f };
   }
-  Ei.decode = c;
+  _i.decode = c;
   function a(u, f) {
     if (r(
       {
@@ -21027,7 +21027,7 @@ function V8() {
     const d = s(u.slice(0, 32)), y = s(u.slice(32, 64));
     return Buffer.concat([e.encode(d, y), l]);
   }
-  return Ei.encode = a, Ei;
+  return _i.encode = a, _i;
 }
 var Z0;
 function nn() {
@@ -21148,10 +21148,10 @@ function nn() {
     e.isCanonicalScriptSignature = M, e.number = i, e.signature = s;
   })(gf)), gf;
 }
-var _i = {}, J0;
-function di() {
-  if (J0) return _i;
-  J0 = 1, Object.defineProperty(_i, "__esModule", { value: !0 }), _i.value = _i.prop = void 0;
+var Si = {}, J0;
+function pi() {
+  if (J0) return Si;
+  J0 = 1, Object.defineProperty(Si, "__esModule", { value: !0 }), Si.value = Si.prop = void 0;
   function e(n, r, i) {
     Object.defineProperty(n, r, {
       configurable: !0,
@@ -21170,18 +21170,18 @@ function di() {
       }
     });
   }
-  _i.prop = e;
+  Si.prop = e;
   function t(n) {
     let r;
     return () => (r !== void 0 || (r = n()), r);
   }
-  return _i.value = t, _i;
+  return Si.value = t, Si;
 }
 var Q0;
 function L8() {
   if (Q0) return io;
   Q0 = 1, Object.defineProperty(io, "__esModule", { value: !0 }), io.p2data = void 0;
-  const e = Wn(), t = nn(), n = Xt(), r = di(), i = t.OPS;
+  const e = Wn(), t = nn(), n = Xt(), r = pi(), i = t.OPS;
   function s(o, c) {
     if (!o.data && !o.output) throw new TypeError("Not enough data");
     c = Object.assign({ validate: !0 }, c || {}), (0, n.typeforce)(
@@ -21217,7 +21217,7 @@ var so = {}, ep;
 function $8() {
   if (ep) return so;
   ep = 1, Object.defineProperty(so, "__esModule", { value: !0 }), so.p2ms = void 0;
-  const e = Wn(), t = nn(), n = Xt(), r = di(), i = t.OPS, s = i.OP_RESERVED;
+  const e = Wn(), t = nn(), n = Xt(), r = pi(), i = t.OPS, s = i.OP_RESERVED;
   function o(c, a) {
     if (!c.input && !c.output && !(c.pubkeys && c.m !== void 0) && !c.signatures)
       throw new TypeError("Not enough data");
@@ -21323,7 +21323,7 @@ var oo = {}, tp;
 function D8() {
   if (tp) return oo;
   tp = 1, Object.defineProperty(oo, "__esModule", { value: !0 }), oo.p2pk = void 0;
-  const e = Wn(), t = nn(), n = Xt(), r = di(), i = t.OPS;
+  const e = Wn(), t = nn(), n = Xt(), r = pi(), i = t.OPS;
   function s(o, c) {
     if (!o.input && !o.output && !o.pubkey && !o.input && !o.signature)
       throw new TypeError("Not enough data");
@@ -21374,11 +21374,11 @@ function D8() {
   }
   return oo.p2pk = s, oo;
 }
-var co = {}, Sf = {}, Si = {}, Zt = {}, np;
+var co = {}, Sf = {}, Ti = {}, Zt = {}, np;
 function Gw() {
   if (np) return Zt;
   np = 1, Object.defineProperty(Zt, "__esModule", { value: !0 }), Zt.ripemd160 = Zt.RIPEMD160 = Zt.md5 = Zt.MD5 = Zt.sha1 = Zt.SHA1 = void 0;
-  const e = /* @__PURE__ */ Py(), t = /* @__PURE__ */ oi(), n = /* @__PURE__ */ Uint32Array.from([
+  const e = /* @__PURE__ */ Py(), t = /* @__PURE__ */ ci(), n = /* @__PURE__ */ Uint32Array.from([
     1732584193,
     4023233417,
     2562383102,
@@ -21533,17 +21533,17 @@ function Gw() {
 }
 var rp;
 function j8() {
-  if (rp) return Si;
-  rp = 1, Object.defineProperty(Si, "__esModule", { value: !0 }), Si.ripemd160 = Si.RIPEMD160 = void 0;
+  if (rp) return Ti;
+  rp = 1, Object.defineProperty(Ti, "__esModule", { value: !0 }), Ti.ripemd160 = Ti.RIPEMD160 = void 0;
   const e = /* @__PURE__ */ Gw();
-  return Si.RIPEMD160 = e.RIPEMD160, Si.ripemd160 = e.ripemd160, Si;
+  return Ti.RIPEMD160 = e.RIPEMD160, Ti.ripemd160 = e.ripemd160, Ti;
 }
-var Ti = {}, ip;
+var xi = {}, ip;
 function K8() {
-  if (ip) return Ti;
-  ip = 1, Object.defineProperty(Ti, "__esModule", { value: !0 }), Ti.sha1 = Ti.SHA1 = void 0;
+  if (ip) return xi;
+  ip = 1, Object.defineProperty(xi, "__esModule", { value: !0 }), xi.sha1 = xi.SHA1 = void 0;
   const e = /* @__PURE__ */ Gw();
-  return Ti.SHA1 = e.SHA1, Ti.sha1 = e.sha1, Ti;
+  return xi.SHA1 = e.SHA1, xi.sha1 = e.sha1, xi;
 }
 var Un = {}, sp;
 function Ww() {
@@ -22318,7 +22318,7 @@ var lp;
 function z8() {
   if (lp) return co;
   lp = 1, Object.defineProperty(co, "__esModule", { value: !0 }), co.p2pkh = void 0;
-  const e = Pr(), t = Wn(), n = nn(), r = Xt(), i = di(), s = Eh(), o = n.OPS;
+  const e = Pr(), t = Wn(), n = nn(), r = Xt(), i = pi(), s = Eh(), o = n.OPS;
   function c(a, u) {
     if (!a.address && !a.hash && !a.output && !a.pubkey && !a.input)
       throw new TypeError("Not enough data");
@@ -22418,7 +22418,7 @@ var ao = {}, hp;
 function Y8() {
   if (hp) return ao;
   hp = 1, Object.defineProperty(ao, "__esModule", { value: !0 }), ao.p2sh = void 0;
-  const e = Pr(), t = Wn(), n = nn(), r = Xt(), i = di(), s = Eh(), o = n.OPS;
+  const e = Pr(), t = Wn(), n = nn(), r = Xt(), i = pi(), s = Eh(), o = n.OPS;
   function c(a, u) {
     if (!a.address && !a.hash && !a.output && !a.redeem && !a.input)
       throw new TypeError("Not enough data");
@@ -22563,7 +22563,7 @@ var uo = {}, dp;
 function Z8() {
   if (dp) return uo;
   dp = 1, Object.defineProperty(uo, "__esModule", { value: !0 }), uo.p2wpkh = void 0;
-  const e = Pr(), t = Wn(), n = nn(), r = Xt(), i = di(), s = cc(), o = n.OPS, c = Buffer.alloc(0);
+  const e = Pr(), t = Wn(), n = nn(), r = Xt(), i = pi(), s = cc(), 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 = {}, pp;
 function J8() {
   if (pp) return fo;
   pp = 1, Object.defineProperty(fo, "__esModule", { value: !0 }), fo.p2wsh = void 0;
-  const e = Pr(), t = Wn(), n = nn(), r = Xt(), i = di(), s = cc(), o = n.OPS, c = Buffer.alloc(0);
+  const e = Pr(), t = Wn(), n = nn(), r = Xt(), i = pi(), s = cc(), o = n.OPS, c = Buffer.alloc(0);
   function a(f) {
     return !!(Buffer.isBuffer(f) && f.length === 65 && f[0] === 4 && (0, r.isPoint)(f));
   }
@@ -22806,15 +22806,15 @@ function J8() {
   }
   return fo.p2wsh = u, fo;
 }
-var lo = {}, xi = {}, yp;
+var lo = {}, Ai = {}, yp;
 function _h() {
-  if (yp) return xi;
-  yp = 1, Object.defineProperty(xi, "__esModule", { value: !0 }), xi.getEccLib = xi.initEccLib = void 0;
+  if (yp) return Ai;
+  yp = 1, Object.defineProperty(Ai, "__esModule", { value: !0 }), Ai.getEccLib = Ai.initEccLib = void 0;
   const e = {};
   function t(c, a) {
     c ? c !== e.eccLib && (a?.DANGER_DO_NOT_VERIFY_ECCLIB || i(c), e.eccLib = c) : e.eccLib = c;
   }
-  xi.initEccLib = t;
+  Ai.initEccLib = t;
   function n() {
     if (!e.eccLib)
       throw new Error(
@@ -22822,7 +22822,7 @@ function _h() {
       );
     return e.eccLib;
   }
-  xi.getEccLib = n;
+  Ai.getEccLib = n;
   const r = (c) => Buffer.from(c, "hex");
   function i(c) {
     s(typeof c.isXOnlyPoint == "function"), s(
@@ -22877,7 +22877,7 @@ function _h() {
       result: "9534f8dc8c6deda2dc007655981c78b49c5d96c778fbf363462a11ec9dfd948c"
     }
   ];
-  return xi;
+  return Ai;
 }
 var If = {}, kt = {}, Hc = { exports: {} };
 /*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */
@@ -23147,7 +23147,7 @@ var Ep;
 function tA() {
   if (Ep) return lo;
   Ep = 1, Object.defineProperty(lo, "__esModule", { value: !0 }), lo.p2tr = void 0;
-  const e = ec(), t = Wn(), n = nn(), r = Xt(), i = _h(), s = Sh(), o = di(), c = cc(), a = Th(), u = n.OPS, f = 1, l = 80;
+  const e = ec(), t = Wn(), n = nn(), r = Xt(), i = _h(), s = Sh(), o = pi(), c = cc(), a = Th(), 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");
@@ -23978,7 +23978,7 @@ function rA() {
   }
   return ho;
 }
-var go = {}, Fc = {}, Mc = {}, Bf = {}, os = {}, cs = {}, Nf = {}, vp;
+var go = {}, Fc = {}, Mc = {}, Bf = {}, cs = {}, as = {}, Nf = {}, vp;
 function Mt() {
   return vp || (vp = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), (function(t) {
@@ -24418,10 +24418,10 @@ function yA() {
   }
   return Yr.canAddToArray = i, Yr;
 }
-var Zr = {}, lr = {}, as = {}, qp;
-function es() {
-  if (qp) return as;
-  qp = 1, Object.defineProperty(as, "__esModule", { value: !0 });
+var Zr = {}, lr = {}, us = {}, qp;
+function ts() {
+  if (qp) return us;
+  qp = 1, Object.defineProperty(us, "__esModule", { value: !0 });
   const e = 9007199254740991;
   function t(s) {
     if (s < 0 || s > e || s % 1 !== 0)
@@ -24432,7 +24432,7 @@ function es() {
       throw new TypeError("buffer must be a Buffer instance");
     return c || (c = 0), s < 253 ? (o.writeUInt8(s, c), Object.assign(n, { bytes: 1 })) : s <= 65535 ? (o.writeUInt8(253, c), o.writeUInt16LE(s, c + 1), Object.assign(n, { bytes: 3 })) : s <= 4294967295 ? (o.writeUInt8(254, c), o.writeUInt32LE(s, c + 1), Object.assign(n, { bytes: 5 })) : (o.writeUInt8(255, c), o.writeUInt32LE(s >>> 0, c + 1), o.writeUInt32LE(s / 4294967296 | 0, c + 5), Object.assign(n, { bytes: 9 })), o;
   }
-  as.encode = n;
+  us.encode = n;
   function r(s, o) {
     if (!Buffer.isBuffer(s))
       throw new TypeError("buffer must be a Buffer instance");
@@ -24450,17 +24450,17 @@ function es() {
       return t(f), f;
     }
   }
-  as.decode = r;
+  us.decode = r;
   function i(s) {
     return t(s), s < 253 ? 1 : s <= 65535 ? 3 : s <= 4294967295 ? 5 : 9;
   }
-  return as.encodingLength = i, as;
+  return us.encodingLength = i, us;
 }
 var Vp;
 function xh() {
   if (Vp) return lr;
   Vp = 1, Object.defineProperty(lr, "__esModule", { value: !0 });
-  const e = es();
+  const e = ts();
   lr.range = (c) => [...Array(c).keys()];
   function t(c) {
     if (c.length < 1) return c;
@@ -24506,7 +24506,7 @@ var Lp;
 function gA() {
   if (Lp) return Zr;
   Lp = 1, Object.defineProperty(Zr, "__esModule", { value: !0 });
-  const e = Mt(), t = xh(), n = es();
+  const e = Mt(), t = xh(), n = ts();
   function r(c) {
     if (c.key[0] !== e.InputTypes.WITNESS_UTXO)
       throw new Error(
@@ -24546,7 +24546,7 @@ var Jr = {}, $p;
 function mA() {
   if ($p) return Jr;
   $p = 1, Object.defineProperty(Jr, "__esModule", { value: !0 });
-  const e = Mt(), t = es();
+  const e = Mt(), t = ts();
   function n(o) {
     if (o.key[0] !== e.OutputTypes.TAP_TREE || o.key.length !== 1)
       throw new Error(
@@ -24708,7 +24708,7 @@ var Dc = {}, Gp;
 function EA() {
   if (Gp) return Dc;
   Gp = 1, Object.defineProperty(Dc, "__esModule", { value: !0 });
-  const e = es(), t = Xw(), n = (i) => i.length === 32;
+  const e = ts(), t = Xw(), n = (i) => i.length === 32;
   function r(i) {
     const s = t.makeConverter(i, n);
     function o(f) {
@@ -24815,15 +24815,15 @@ function SA() {
 }
 var zp;
 function Ah() {
-  if (zp) return cs;
-  zp = 1, Object.defineProperty(cs, "__esModule", { value: !0 });
+  if (zp) return as;
+  zp = 1, Object.defineProperty(as, "__esModule", { value: !0 });
   const e = Mt(), t = iA(), n = sA(), r = oA(), i = cA(), s = aA(), o = uA(), c = fA(), a = lA(), u = hA(), f = dA(), l = pA(), d = yA(), y = gA(), g = mA(), m = Xw(), E = wA(), _ = bA(), S = EA(), w = _A(), T = SA(), O = {
     unsignedTx: n,
     globalXpub: t,
     // pass an Array of key bytes that require pubkey beside the key
     checkPubkey: E.makeChecker([])
   };
-  cs.globals = O;
+  as.globals = O;
   const A = {
     nonWitnessUtxo: s,
     partialSig: o,
@@ -24856,7 +24856,7 @@ function Ah() {
     ),
     tapMerkleRoot: l
   };
-  cs.inputs = A;
+  as.inputs = A;
   const R = {
     bip32Derivation: m.makeConverter(
       e.OutputTypes.BIP32_DERIVATION
@@ -24878,13 +24878,13 @@ function Ah() {
       e.OutputTypes.TAP_INTERNAL_KEY
     )
   };
-  return cs.outputs = R, cs;
+  return as.outputs = R, as;
 }
 var Yp;
 function TA() {
-  if (Yp) return os;
-  Yp = 1, Object.defineProperty(os, "__esModule", { value: !0 });
-  const e = Ah(), t = xh(), n = es(), r = Mt();
+  if (Yp) return cs;
+  Yp = 1, Object.defineProperty(cs, "__esModule", { value: !0 });
+  const e = Ah(), t = xh(), n = ts(), r = Mt();
   function i(c, a) {
     let u = 0;
     function f() {
@@ -24965,14 +24965,14 @@ function TA() {
       outputKeyVals: A
     });
   }
-  os.psbtFromBuffer = i;
+  cs.psbtFromBuffer = i;
   function s(c, a, u) {
     if (!a.equals(Buffer.from([u])))
       throw new Error(
         `Format Error: Invalid ${c} key: ${a.toString("hex")}`
       );
   }
-  os.checkKeyBuffer = s;
+  cs.checkKeyBuffer = s;
   function o(c, { globalMapKeyVals: a, inputKeyVals: u, outputKeyVals: f }) {
     const l = {
       unsignedTx: c
@@ -25168,7 +25168,7 @@ function TA() {
     }
     return { globalMap: l, inputs: m, outputs: E };
   }
-  return os.psbtFromKeyVals = o, os;
+  return cs.psbtFromKeyVals = o, cs;
 }
 var mo = {}, Zp;
 function xA() {
@@ -25507,7 +25507,7 @@ var Qe = {}, ze = {}, ny;
 function hl() {
   if (ny) return ze;
   ny = 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 = es(), t = nn(), n = Ec(), r = Pr(), i = bc();
+  const e = ts(), t = nn(), n = Ec(), r = Pr(), i = bc();
   function s(y) {
     return (g) => {
       try {
@@ -25808,7 +25808,7 @@ var iy;
 function OA() {
   if (iy) return go;
   iy = 1, Object.defineProperty(go, "__esModule", { value: !0 }), go.Psbt = void 0;
-  const e = vA(), t = es(), n = Yw(), r = Th(), i = bu(), s = Wn(), o = bc(), c = Sh(), a = nn(), u = Ec(), f = IA(), l = hl(), d = {
+  const e = vA(), t = ts(), n = Yw(), r = Th(), i = bu(), s = Wn(), o = bc(), c = Sh(), a = nn(), u = Ec(), f = IA(), l = hl(), 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.
@@ -27058,10 +27058,10 @@ function BA() {
     });
   })(pf)), pf;
 }
-var Ai = {}, oy;
+var vi = {}, oy;
 function NA() {
-  if (oy) return Ai;
-  oy = 1, Object.defineProperty(Ai, "__esModule", { value: !0 }), Ai.base26Decode = Ai.base26Encode = void 0;
+  if (oy) return vi;
+  oy = 1, Object.defineProperty(vi, "__esModule", { value: !0 }), vi.base26Decode = vi.base26Encode = void 0;
   function e(n) {
     let r = 0n;
     for (let i = 0; i < n.length; i++) {
@@ -27075,7 +27075,7 @@ function NA() {
     }
     return r;
   }
-  Ai.base26Encode = e;
+  vi.base26Encode = e;
   function t(n) {
     if (n === 340282366920938463463374607431768211455n)
       return "BCGDENLQRQWDSLRUGSNLBTMFIJAV";
@@ -27087,12 +27087,12 @@ function NA() {
     }
     return r.reverse().join("");
   }
-  return Ai.base26Decode = t, Ai;
+  return vi.base26Decode = t, vi;
 }
-var vi = {}, cy;
+var Ii = {}, cy;
 function Zw() {
-  if (cy) return vi;
-  cy = 1, Object.defineProperty(vi, "__esModule", { value: !0 }), vi.none = vi.some = void 0;
+  if (cy) return Ii;
+  cy = 1, Object.defineProperty(Ii, "__esModule", { value: !0 }), Ii.none = Ii.some = void 0;
   class e {
     constructor() {
     }
@@ -27123,16 +27123,16 @@ function Zw() {
   function n(i) {
     return new t(i);
   }
-  vi.some = n;
+  Ii.some = n;
   function r() {
     return new e();
   }
-  return vi.none = r, vi;
+  return Ii.none = r, Ii;
 }
-var Ii = {}, ay;
+var Oi = {}, ay;
 function kA() {
-  if (ay) return Ii;
-  ay = 1, Object.defineProperty(Ii, "__esModule", { value: !0 }), Ii.decodeLEB128 = Ii.encodeLEB128 = void 0;
+  if (ay) return Oi;
+  ay = 1, Object.defineProperty(Oi, "__esModule", { value: !0 }), Oi.decodeLEB128 = Oi.encodeLEB128 = void 0;
   function e(n) {
     const r = [];
     let i = !0;
@@ -27142,7 +27142,7 @@ function kA() {
     }
     return r;
   }
-  Ii.encodeLEB128 = e;
+  Oi.encodeLEB128 = e;
   function t(n) {
     let r = BigInt(0);
     for (let i = 0; i < n.length; i++) {
@@ -27160,7 +27160,7 @@ function kA() {
     }
     throw new Error("Unterminated");
   }
-  return Ii.decodeLEB128 = t, Ii;
+  return Oi.decodeLEB128 = t, Oi;
 }
 var Pf = {}, uy;
 function PA() {
@@ -27673,7 +27673,7 @@ function RA() {
 var hy;
 function UA() {
   return hy || (hy = 1, (function(e) {
-    var t = mi && mi.__createBinding || (Object.create ? (function(s, o, c, a) {
+    var t = wi && wi.__createBinding || (Object.create ? (function(s, o, c, a) {
       a === void 0 && (a = c);
       var u = Object.getOwnPropertyDescriptor(o, c);
       (!u || ("get" in u ? !o.__esModule : u.writable || u.configurable)) && (u = { enumerable: !0, get: function() {
@@ -27681,7 +27681,7 @@ function UA() {
       } }), Object.defineProperty(s, a, u);
     }) : (function(s, o, c, a) {
       a === void 0 && (a = c), s[a] = o[c];
-    })), n = mi && mi.__exportStar || function(s, o) {
+    })), n = wi && wi.__exportStar || function(s, o) {
       for (var c in s) c !== "default" && !Object.prototype.hasOwnProperty.call(o, c) && t(o, s, c);
     };
     Object.defineProperty(e, "__esModule", { value: !0 }), e.removeSpacers = e.getSpacersVal = e.applySpacers = e.some = e.none = void 0, n(RA(), e);
@@ -27699,9 +27699,9 @@ function UA() {
     } }), Object.defineProperty(e, "removeSpacers", { enumerable: !0, get: function() {
       return i.removeSpacers;
     } });
-  })(mi)), mi;
+  })(wi)), wi;
 }
-var us = UA();
+var fs = UA();
 function Qw(e) {
   if (e.length % 2 !== 0)
     throw new Error("Hex string must have even length");
@@ -27720,7 +27720,7 @@ function Oh(e, t = Oo.Testnet) {
   const n = Ih(t);
   return xg(e, n);
 }
-function Hi(e) {
+function Fi(e) {
   const t = Pn, n = Hy, r = D1;
   let i, s, o = mn.UNKNOWN;
   if (e.startsWith("bc1") || e.startsWith("tb1") || e.startsWith("bcrt1"))
@@ -27768,12 +27768,12 @@ const a4 = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   bytesToHex: vh,
   formatPoolUtxo: CA,
-  getAddressType: Hi,
+  getAddressType: Fi,
   getScriptByAddress: Oh,
   getUtxoProof: e1,
   hexToBytes: Qw,
   toBitcoinNetwork: Ih
-}, Symbol.toStringTag, { value: "Module" })), HA = "kqs64-paaaa-aaaar-qamza-cai", FA = "hvyp5-5yaaa-aaaao-qjxha-cai", fs = BigInt(546), sn = "0:0", MA = "https://runescan-hasura-mainnet.omnity.network/v1/graphql", qA = "https://runescan-hasura-testnet.omnity.network/v1/graphql", dy = {
+}, 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", dy = {
   P2PKH: 148,
   P2SH_P2WPKH: 91,
   P2WPKH: 68,
@@ -27795,7 +27795,7 @@ const a4 = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   "P2SH_P2WPKH",
   "P2TR"
 ]), LA = 2;
-class Bi {
+class Ni {
   psbt;
   client;
   inputAddressTypes = [];
@@ -27829,7 +27829,7 @@ class Bi {
         value: BigInt(t.satoshis),
         script: Qw(t.scriptPk)
       }
-    }), this.inputAddressTypes.push(Hi(n)), this.inputUtxos.push(t), (n === this.config.address || n === this.config.paymentAddress) && t.runes.length !== 0 && (this.userInputUtxoDusts += BigInt(t.satoshis));
+    }), this.inputAddressTypes.push(Fi(n)), this.inputUtxos.push(t), (n === this.config.address || n === this.config.paymentAddress) && t.runes.length !== 0 && (this.userInputUtxoDusts += BigInt(t.satoshis));
   }
   /**
    * Add a standard output to the transaction
@@ -27840,7 +27840,7 @@ class Bi {
     this.psbt.addOutput({
       address: t,
       value: n
-    }), this.outputAddressTypes.push(Hi(t));
+    }), this.outputAddressTypes.push(Fi(t));
   }
   /**
    * Add an OP_RETURN script output (for Runestone)
@@ -27912,13 +27912,13 @@ class Bi {
    * @returns Fee calculation result
    */
   async addBtcAndFees(t, n) {
-    const r = this.config.paymentAddress, i = this.additionalDustNeeded, s = Hi(r), o = this.userInputUtxoDusts, c = this.config.feeRate;
+    const r = this.config.paymentAddress, i = this.additionalDustNeeded, s = Fi(r), o = this.userInputUtxoDusts, c = this.config.feeRate;
     this.outputAddressTypes.push(s);
     let a = !0, u = BigInt(0), f = BigInt(0), l = [], d = BigInt(0), y = BigInt(0);
     const g = [...this.inputAddressTypes];
     do {
       if (u = f, c !== void 0) {
-        const _ = Bi.estimateTxVirtualSize(
+        const _ = Ni.estimateTxVirtualSize(
           this.inputAddressTypes,
           this.outputAddressTypes
         );
@@ -27940,7 +27940,7 @@ class Bi {
           (w, T) => w + BigInt(T.satoshis),
           BigInt(0)
         );
-        S - d > 0 && S - d > fs || (this.outputAddressTypes.pop(), a = !1), l = _;
+        S - d > 0 && S - d > Qr || (this.outputAddressTypes.pop(), a = !1), l = _;
       }
     } while (f > u && d > 0);
     this.inputAddressTypes = [...g], a && this.outputAddressTypes.pop();
@@ -27951,7 +27951,7 @@ class Bi {
     const E = m - d;
     if (E < 0)
       throw new Error("Insufficient UTXO(s)");
-    E > fs ? this.addOutput(r, E) : E > BigInt(0) && (y = E), this.txFee = y + f;
+    E > Qr ? this.addOutput(r, E) : E > BigInt(0) && (y = E), this.txFee = y + f;
   }
   /**
    * Resolve and fetch all UTXOs required by the current intention set, grouped by address.
@@ -28189,7 +28189,7 @@ class Bi {
       const s = [], o = [];
       let c = 1;
       i.forEach((u) => {
-        const f = new us.RuneId(
+        const f = new fs.RuneId(
           Number(u.split(":")[0]),
           Number(u.split(":")[1])
         );
@@ -28197,13 +28197,13 @@ class Bi {
           t
         )) {
           const y = d[u] ?? BigInt(0);
-          y > BigInt(0) && (s.push(new us.Edict(f, y, c)), o.push(l), c++);
+          y > BigInt(0) && (s.push(new fs.Edict(f, y, c)), o.push(l), c++);
         }
       });
-      const a = new us.Runestone(s, us.none(), us.none(), us.none());
+      const a = new fs.Runestone(s, fs.none(), fs.none(), fs.none());
       this.addScriptOutput(new Uint8Array(a.encipher())), o.forEach((u) => {
-        const f = t[u]?.[sn] ?? BigInt(0), l = u === this.config.address, d = f > BigInt(0) && (!l || n), y = d && f > fs ? f : fs;
-        this.addOutput(u, y), d ? delete t[u][sn] : this.additionalDustNeeded += fs;
+        const f = t[u]?.[sn] ?? BigInt(0), l = u === this.config.address, d = f > BigInt(0) && (!l || n), y = d && f > Qr ? f : Qr;
+        this.addOutput(u, y), d ? (f < Qr && (this.additionalDustNeeded += Qr - f), delete t[u][sn]) : this.additionalDustNeeded += Qr;
       });
     }
     for (const [s, o] of Object.entries(
@@ -28276,7 +28276,7 @@ class Bi {
       const l = this.inputUtxos[u].address;
       if (l !== this.config.paymentAddress || l !== this.config.address)
         continue;
-      const d = this.psbt.data.inputs[u].redeemScript, y = Hi(l);
+      const d = this.psbt.data.inputs[u].redeemScript, y = Fi(l);
       if (d && y === mn.P2SH_P2WPKH) {
         const g = tn([d]);
         c.setInputScript(u, g);
@@ -28292,16 +28292,16 @@ class Bi {
   static estimateTxVirtualSize(t, n) {
     const r = t.length, i = n.length;
     let s = 8 + // locktime
-    Bi.varIntSize(r) + Bi.varIntSize(i), o = !1;
+    Ni.varIntSize(r) + Ni.varIntSize(i), o = !1;
     for (const c of t) {
-      const a = Bi.parseAddressType(c);
+      const a = Ni.parseAddressType(c);
       if (a.key === "OpReturn")
         continue;
       const u = dy[a.key] ?? dy.UNKNOWN;
       s += u, VA.has(a.key) && (o = !0);
     }
     for (const c of n) {
-      const a = Bi.parseAddressType(c);
+      const a = Ni.parseAddressType(c);
       if (a.key === "OpReturn") {
         const f = Math.max(0, a.opReturnLength ?? 0);
         s += 11 + f;
@@ -28902,7 +28902,7 @@ function c1(e) {
 function a1(e) {
   return e >= 56320 && e <= 57343;
 }
-function Wi(e, t) {
+function Xi(e, t) {
   const n = e.source.body.codePointAt(t);
   if (n === void 0)
     return ee.EOF;
@@ -29007,7 +29007,7 @@ function ov(e, t) {
     throw Nt(
       e.source,
       i,
-      s === 39 ? `Unexpected single quote character ('), did you mean to use a double quote (")?` : Ws(s) || Eu(n, i) ? `Unexpected character: ${Wi(e, i)}.` : `Invalid character: ${Wi(e, i)}.`
+      s === 39 ? `Unexpected single quote character ('), did you mean to use a double quote (")?` : Ws(s) || Eu(n, i) ? `Unexpected character: ${Xi(e, i)}.` : `Invalid character: ${Xi(e, i)}.`
     );
   }
   return bt(e, ee.EOF, r, r);
@@ -29042,7 +29042,7 @@ function av(e, t, n) {
       throw Nt(
         e.source,
         i,
-        `Invalid number, unexpected digit after 0: ${Wi(
+        `Invalid number, unexpected digit after 0: ${Xi(
           e,
           i
         )}.`
@@ -29053,7 +29053,7 @@ function av(e, t, n) {
     throw Nt(
       e.source,
       i,
-      `Invalid number, expected digit but got: ${Wi(
+      `Invalid number, expected digit but got: ${Xi(
         e,
         i
       )}.`
@@ -29071,7 +29071,7 @@ function Uf(e, t, n) {
     throw Nt(
       e.source,
       t,
-      `Invalid number, expected digit but got: ${Wi(
+      `Invalid number, expected digit but got: ${Xi(
         e,
         t
       )}.`
@@ -29105,7 +29105,7 @@ function uv(e, t) {
       throw Nt(
         e.source,
         i,
-        `Invalid character within String: ${Wi(
+        `Invalid character within String: ${Xi(
           e,
           i
         )}.`
@@ -29254,7 +29254,7 @@ function dv(e, t) {
       throw Nt(
         e.source,
         s,
-        `Invalid character within String: ${Wi(
+        `Invalid character within String: ${Xi(
           e,
           s
         )}.`
@@ -31304,7 +31304,7 @@ const Kv = (e, t, n) => e.document ? e : {
  *  Copyright (c) 2025 Michael Mclaughlin <M8ch88l@gmail.com>
  *  MIT Licence
  */
-var ws = 9e15, pi = 1e9, wl = "0123456789abcdef", Ha = "2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058", Fa = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789", bl = {
+var ws = 9e15, yi = 1e9, wl = "0123456789abcdef", Ha = "2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058", Fa = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789", bl = {
   // These values must be integers within the stated ranges (inclusive).
   // Most of these values can be changed at run-time using the `Decimal.config` method.
   // The maximum number of significant digits of the result of a calculation or base conversion.
@@ -31362,7 +31362,7 @@ var ws = 9e15, pi = 1e9, wl = "0123456789abcdef", Ha = "2.3025850929940456840179
   // Whether to use cryptographically-secure random number generation, if available.
   crypto: !1
   // true/false
-}, p1, xr, ve = !0, Su = "[DecimalError] ", fi = Su + "Invalid argument: ", y1 = Su + "Precision limit exceeded", g1 = Su + "crypto unavailable", m1 = "[object Decimal]", Wt = Math.floor, xt = Math.pow, Wv = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i, Xv = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i, zv = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i, w1 = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i, jn = 1e7, _e = 7, Yv = 9007199254740991, Zv = Ha.length - 1, El = Fa.length - 1, se = { toStringTag: m1 };
+}, p1, xr, ve = !0, Su = "[DecimalError] ", li = Su + "Invalid argument: ", y1 = Su + "Precision limit exceeded", g1 = Su + "crypto unavailable", m1 = "[object Decimal]", Wt = Math.floor, xt = Math.pow, Wv = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i, Xv = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i, zv = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i, w1 = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i, jn = 1e7, _e = 7, Yv = 9007199254740991, Zv = Ha.length - 1, El = Fa.length - 1, se = { toStringTag: m1 };
 se.absoluteValue = se.abs = function() {
   var e = new this.constructor(this);
   return e.s < 0 && (e.s = 1), be(e);
@@ -31373,7 +31373,7 @@ se.ceil = function() {
 se.clampedTo = se.clamp = function(e, t) {
   var n, r = this, i = r.constructor;
   if (e = new i(e), t = new i(t), !e.s || !t.s) return new i(NaN);
-  if (e.gt(t)) throw Error(fi + t);
+  if (e.gt(t)) throw Error(li + t);
   return n = r.cmp(e), n < 0 ? e : r.cmp(t) > 0 ? t : new i(r);
 };
 se.comparedTo = se.cmp = function(e) {
@@ -31539,9 +31539,9 @@ 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 = ii(u, c), r = t ? Ma(f, c + 10) : ii(e, c), a = Ze(o, r, c, 1), jo(a.d, i = l, d))
+  if (ve = !1, c = l + y, o = si(u, c), r = t ? Ma(f, c + 10) : si(e, c), a = Ze(o, r, c, 1), jo(a.d, i = l, d))
     do
-      if (c += 10, o = ii(u, c), r = t ? Ma(f, c + 10) : ii(e, c), a = Ze(o, r, c, 1), !s) {
+      if (c += 10, o = si(u, c), r = t ? Ma(f, c + 10) : si(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;
       }
@@ -31591,7 +31591,7 @@ se.naturalExponential = se.exp = function() {
   return _l(this);
 };
 se.naturalLogarithm = se.ln = function() {
-  return ii(this);
+  return si(this);
 };
 se.negated = se.neg = function() {
   var e = new this.constructor(this);
@@ -31616,7 +31616,7 @@ se.plus = se.add = function(e) {
 };
 se.precision = se.sd = function(e) {
   var t, n = this;
-  if (e !== void 0 && e !== !!e && e !== 1 && e !== 0) throw Error(fi + e);
+  if (e !== void 0 && e !== !!e && e !== 1 && e !== 0) throw Error(li + e);
   return n.d ? (t = b1(n.d), e && n.e + 1 > t && (t = n.e + 1)) : t = NaN, t;
 };
 se.round = function() {
@@ -31667,15 +31667,15 @@ se.toBinary = function(e, t) {
 };
 se.toDecimalPlaces = se.toDP = function(e, t) {
   var n = this, r = n.constructor;
-  return n = new r(n), e === void 0 ? n : (yn(e, 0, pi), t === void 0 ? t = r.rounding : yn(t, 0, 8), be(n, e + n.e + 1, t));
+  return n = new r(n), e === void 0 ? n : (yn(e, 0, yi), t === void 0 ? t = r.rounding : yn(t, 0, 8), be(n, e + n.e + 1, t));
 };
 se.toExponential = function(e, t) {
   var n, r = this, i = r.constructor;
-  return e === void 0 ? n = ir(r, !0) : (yn(e, 0, pi), t === void 0 ? t = i.rounding : yn(t, 0, 8), r = be(new i(r), e + 1, t), n = ir(r, !0, e + 1)), r.isNeg() && !r.isZero() ? "-" + n : n;
+  return e === void 0 ? n = ir(r, !0) : (yn(e, 0, yi), t === void 0 ? t = i.rounding : yn(t, 0, 8), r = be(new i(r), e + 1, t), n = ir(r, !0, e + 1)), r.isNeg() && !r.isZero() ? "-" + n : n;
 };
 se.toFixed = function(e, t) {
   var n, r, i = this, s = i.constructor;
-  return e === void 0 ? n = ir(i) : (yn(e, 0, pi), t === void 0 ? t = s.rounding : yn(t, 0, 8), r = be(new s(i), e + i.e + 1, t), n = ir(r, !1, e + r.e + 1)), i.isNeg() && !i.isZero() ? "-" + n : n;
+  return e === void 0 ? n = ir(i) : (yn(e, 0, yi), t === void 0 ? t = s.rounding : yn(t, 0, 8), r = be(new s(i), e + i.e + 1, t), n = ir(r, !1, e + r.e + 1)), i.isNeg() && !i.isZero() ? "-" + n : n;
 };
 se.toFraction = function(e) {
   var t, n, r, i, s, o, c, a, u, f, l, d, y = this, g = y.d, m = y.constructor;
@@ -31683,7 +31683,7 @@ se.toFraction = function(e) {
   if (u = n = new m(1), r = a = new m(0), t = new m(r), s = t.e = b1(g) - y.e - 1, o = s % _e, t.d[0] = xt(10, o < 0 ? _e + o : o), e == null)
     e = s > 0 ? t : u;
   else {
-    if (c = new m(e), !c.isInt() || c.lt(u)) throw Error(fi + c);
+    if (c = new m(e), !c.isInt() || c.lt(u)) throw Error(li + c);
     e = c.gt(t) ? s > 0 ? t : u : c;
   }
   for (ve = !1, c = new m(Ht(g)), f = m.precision, m.precision = s = g.length * _e * 2; l = Ze(c, t, 0, 1, 1), i = n.plus(l.times(r)), i.cmp(e) != 1; )
@@ -31723,15 +31723,15 @@ 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 = _l(e.times(ii(c, r + n)), r), i.d && (i = be(i, r + 5, 1), jo(i.d, r, s) && (t = r + 10, i = be(_l(e.times(ii(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 = _l(e.times(si(c, r + n)), r), i.d && (i = be(i, r + 5, 1), jo(i.d, r, s) && (t = r + 10, i = be(_l(e.times(si(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;
-  return e === void 0 ? n = ir(r, r.e <= i.toExpNeg || r.e >= i.toExpPos) : (yn(e, 1, pi), t === void 0 ? t = i.rounding : yn(t, 0, 8), r = be(new i(r), e, t), n = ir(r, e <= r.e || r.e <= i.toExpNeg, e)), r.isNeg() && !r.isZero() ? "-" + n : n;
+  return e === void 0 ? n = ir(r, r.e <= i.toExpNeg || r.e >= i.toExpPos) : (yn(e, 1, yi), t === void 0 ? t = i.rounding : yn(t, 0, 8), r = be(new i(r), e, t), n = ir(r, e <= r.e || r.e <= i.toExpNeg, e)), r.isNeg() && !r.isZero() ? "-" + n : n;
 };
 se.toSignificantDigits = se.toSD = function(e, t) {
   var n = this, r = n.constructor;
-  return e === void 0 ? (e = r.precision, t = r.rounding) : (yn(e, 1, pi), t === void 0 ? t = r.rounding : yn(t, 0, 8)), be(new r(n), e, t);
+  return e === void 0 ? (e = r.precision, t = r.rounding) : (yn(e, 1, yi), t === void 0 ? t = r.rounding : yn(t, 0, 8)), be(new r(n), e, t);
 };
 se.toString = function() {
   var e = this, t = e.constructor, n = ir(e, e.e <= t.toExpNeg || e.e >= t.toExpPos);
@@ -31748,8 +31748,8 @@ function Ht(e) {
   var t, n, r, i = e.length - 1, s = "", o = e[0];
   if (i > 0) {
     for (s += o, t = 1; t < i; t++)
-      r = e[t] + "", n = _e - r.length, n && (s += ri(n)), s += r;
-    o = e[t], r = o + "", n = _e - r.length, n && (s += ri(n));
+      r = e[t] + "", n = _e - r.length, n && (s += ii(n)), s += r;
+    o = e[t], r = o + "", n = _e - r.length, n && (s += ii(n));
   } else if (o === 0)
     return "0";
   for (; o % 10 === 0; ) o /= 10;
@@ -31757,7 +31757,7 @@ function Ht(e) {
 }
 function yn(e, t, n) {
   if (e !== ~~e || e < t || e > n)
-    throw Error(fi + e);
+    throw Error(li + e);
 }
 function jo(e, t, n, r) {
   var i, s, o, c;
@@ -31881,7 +31881,7 @@ function be(e, t, n, r) {
 function ir(e, t, n) {
   if (!e.isFinite()) return S1(e);
   var r, i = e.e, s = Ht(e.d), o = s.length;
-  return t ? (n && (r = n - o) > 0 ? s = s.charAt(0) + "." + s.slice(1) + ri(r) : o > 1 && (s = s.charAt(0) + "." + s.slice(1)), s = s + (e.e < 0 ? "e" : "e+") + e.e) : i < 0 ? (s = "0." + ri(-i - 1) + s, n && (r = n - o) > 0 && (s += ri(r))) : i >= o ? (s += ri(i + 1 - o), n && (r = n - i - 1) > 0 && (s = s + "." + ri(r))) : ((r = i + 1) < o && (s = s.slice(0, r) + "." + s.slice(r)), n && (r = n - o) > 0 && (i + 1 === o && (s += "."), s += ri(r))), s;
+  return t ? (n && (r = n - o) > 0 ? s = s.charAt(0) + "." + s.slice(1) + ii(r) : o > 1 && (s = s.charAt(0) + "." + s.slice(1)), s = s + (e.e < 0 ? "e" : "e+") + e.e) : i < 0 ? (s = "0." + ii(-i - 1) + s, n && (r = n - o) > 0 && (s += ii(r))) : i >= o ? (s += ii(i + 1 - o), n && (r = n - i - 1) > 0 && (s = s + "." + ii(r))) : ((r = i + 1) < o && (s = s.slice(0, r) + "." + s.slice(r)), n && (r = n - o) > 0 && (i + 1 === o && (s += "."), s += ii(r))), s;
 }
 function Tu(e, t) {
   var n = e[0];
@@ -31905,7 +31905,7 @@ function b1(e) {
   }
   return n;
 }
-function ri(e) {
+function ii(e) {
   for (var t = ""; e--; ) t += "0";
   return t;
 }
@@ -31953,7 +31953,7 @@ function _l(e, t) {
     o = c;
   }
 }
-function ii(e, t) {
+function si(e, t) {
   var n, r, i, s, o, c, a, u, f, l, d, y = 1, g = 10, m = e, E = m.d, _ = m.constructor, S = _.rounding, w = _.precision;
   if (m.s < 0 || !E || !E[0] || !m.e && E[0] == 1 && E.length == 1)
     return new _(E && !E[0] ? -1 / 0 : m.s != 1 ? NaN : E ? 0 : m);
@@ -31962,7 +31962,7 @@ function ii(e, t) {
       m = m.times(e), n = Ht(m.d), r = n.charAt(0), y++;
     s = m.e, r > 1 ? (m = new _("0." + n), s++) : m = new _(r + "." + n.slice(1));
   } else
-    return u = Ma(_, f + 2, w).times(s + ""), m = ii(new _(r + "." + n.slice(1)), f - g).plus(u), _.precision = w, t == null ? be(m, w, S, ve = !0) : m;
+    return u = Ma(_, f + 2, w).times(s + ""), m = si(new _(r + "." + n.slice(1)), f - g).plus(u), _.precision = w, t == null ? be(m, w, S, ve = !0) : m;
   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(Ma(_, f + 2, w).times(s + ""))), a = Ze(a, new _(y), f, 1), t == null)
@@ -32007,7 +32007,7 @@ function Qv(e, t) {
   else if (zv.test(t))
     n = 8;
   else
-    throw Error(fi + t);
+    throw Error(li + t);
   for (s = t.search(/p/i), s > 0 ? (a = +t.slice(s + 1), t = t.substring(2, s)) : t = t.slice(2), s = t.indexOf("."), o = s >= 0, r = e.constructor, o && (t = t.replace(".", ""), c = t.length, s = c - s, i = E1(r, new r(n), s, s * 2)), u = sa(t, n, jn), f = u.length - 1, s = f; u[s] === 0; --s) u.pop();
   return s < 0 ? new r(e.s * 0) : (e.e = Tu(u, f), e.d = u, ve = !1, o && (e = Ze(e, i, c * 4)), a && (e = e.times(Math.abs(a) < 54 ? xt(2, a) : br.pow(2, a))), ve = !0, e);
 }
@@ -32050,7 +32050,7 @@ function T1(e, t) {
 }
 function Rh(e, t, n, r) {
   var i, s, o, c, a, u, f, l, d, y = e.constructor, g = n !== void 0;
-  if (g ? (yn(n, 1, pi), r === void 0 ? r = y.rounding : yn(r, 0, 8)) : (n = y.precision, r = y.rounding), !e.isFinite())
+  if (g ? (yn(n, 1, yi), r === void 0 ? r = y.rounding : yn(r, 0, 8)) : (n = y.precision, r = y.rounding), !e.isFinite())
     f = S1(e);
   else {
     for (f = ir(e), o = f.indexOf("."), g ? (i = 2, t == 16 ? n = n * 4 - 3 : t == 8 && (n = n * 3 - 2)) : i = t, o >= 0 && (f = f.replace(".", ""), d = new y(1), d.e = f.length - o, d.d = sa(ir(d), 10, i), d.e = d.d.length), l = sa(f, 10, i), s = a = l.length; l[--a] == 0; ) l.pop();
@@ -32128,7 +32128,7 @@ function d6(e) {
   var t, n, r, i = e.defaults === !0, s = [
     "precision",
     1,
-    pi,
+    yi,
     "rounding",
     0,
     8,
@@ -32151,7 +32151,7 @@ function d6(e) {
   for (t = 0; t < s.length; t += 3)
     if (n = s[t], i && (this[n] = bl[n]), (r = e[n]) !== void 0)
       if (Wt(r) === r && r >= s[t + 1] && r <= s[t + 2]) this[n] = r;
-      else throw Error(fi + n + ": " + r);
+      else throw Error(li + n + ": " + r);
   if (n = "crypto", i && (this[n] = bl[n]), (r = e[n]) !== void 0)
     if (r === !0 || r === !1 || r === 0 || r === 1)
       if (r)
@@ -32162,7 +32162,7 @@ function d6(e) {
       else
         this[n] = !1;
     else
-      throw Error(fi + n + ": " + r);
+      throw Error(li + n + ": " + r);
   return this;
 }
 function p6(e) {
@@ -32200,7 +32200,7 @@ function x1(e) {
       return (c = s.charCodeAt(0)) === 45 ? (s = s.slice(1), u.s = -1) : (c === 43 && (s = s.slice(1)), u.s = 1), w1.test(s) ? oa(u, s) : Qv(u, s);
     if (a === "bigint")
       return s < 0 ? (s = -s, u.s = -1) : u.s = 1, oa(u, s.toString());
-    throw Error(fi + s);
+    throw Error(li + s);
   }
   if (i.prototype = se, i.ROUND_UP = 0, i.ROUND_DOWN = 1, i.ROUND_CEIL = 2, i.ROUND_FLOOR = 3, i.ROUND_HALF_UP = 4, i.ROUND_HALF_DOWN = 5, i.ROUND_HALF_EVEN = 6, i.ROUND_HALF_CEIL = 7, i.ROUND_HALF_FLOOR = 8, i.EUCLID = 9, i.config = i.set = d6, i.clone = x1, i.isDecimal = Ny, i.abs = t6, i.acos = n6, i.acosh = r6, i.add = i6, i.asin = s6, i.asinh = o6, i.atan = c6, i.atanh = a6, i.atan2 = u6, i.cbrt = f6, i.ceil = l6, i.clamp = h6, i.cos = p6, i.cosh = y6, i.div = g6, i.exp = m6, i.floor = w6, i.hypot = b6, i.ln = E6, i.log = _6, i.log10 = T6, i.log2 = S6, i.max = x6, i.min = A6, i.mod = v6, i.mul = I6, i.pow = O6, i.random = B6, i.round = N6, i.sign = k6, i.sin = P6, i.sinh = R6, i.sqrt = U6, i.sub = C6, i.sum = H6, i.tan = F6, i.tanh = M6, i.trunc = q6, e === void 0 && (e = {}), e && e.defaults !== !0)
     for (r = ["precision", "rounding", "toExpNeg", "toExpPos", "maxE", "minE", "modulo", "crypto"], t = 0; t < r.length; ) e.hasOwnProperty(n = r[t++]) || (e[n] = this[n]);
@@ -32259,7 +32259,7 @@ function O6(e, t) {
 }
 function B6(e) {
   var t, n, r, i, s = 0, o = new this(1), c = [];
-  if (e === void 0 ? e = this.precision : yn(e, 1, pi), r = Math.ceil(e / _e), this.crypto)
+  if (e === void 0 ? e = this.precision : yn(e, 1, yi), r = Math.ceil(e / _e), this.crypto)
     if (crypto.getRandomValues)
       for (t = crypto.getRandomValues(new Uint32Array(r)); s < r; )
         i = t[s], i >= 429e7 ? t[s] = crypto.getRandomValues(new Uint32Array(1))[0] : c[s++] = i % 1e7;
@@ -32746,7 +32746,7 @@ class u4 {
   async getPendingBtcUtxos(t) {
     const n = await this.orchestrator.get_zero_confirmed_utxos_of_address(
       t
-    ), r = Hi(t);
+    ), r = Fi(t);
     return n.filter(({ maybe_rune: i }) => !i.length).map(({ value: i, script_pubkey_hex: s, outpoint: o }) => {
       const [c, a] = o.split(":");
       return {
@@ -32770,7 +32770,7 @@ class u4 {
   async getPendingRuneUtxos(t) {
     const n = await this.orchestrator.get_zero_confirmed_utxos_of_address(
       t
-    ), r = Hi(t);
+    ), r = Fi(t);
     return n.filter(({ maybe_rune: i }) => i.length).map(({ value: i, script_pubkey_hex: s, outpoint: o, maybe_rune: c }) => {
       const [a, u] = o.split(":"), f = c[0];
       return {
@@ -32978,7 +32978,7 @@ class u4 {
     feeRate: r,
     mergeSelfRuneBtcOutputs: i
   }) {
-    return new Bi(
+    return new Ni(
       {
         network: this.config.network,
         exchangeId: this.config.exchangeId,
@@ -33001,6 +33001,6 @@ class u4 {
 export {
   Oo as Network,
   u4 as ReeClient,
-  Bi as Transaction,
+  Ni as Transaction,
   a4 as utils
 };