@omnity/ree-client-ts-sdk 0.7.4 → 0.7.6

package/dist/index.es.js

@@ -1158,7 +1158,7 @@ function Bw() {
   return fh || (fh = 1, Object.defineProperty(Fs, "__esModule", { value: !0 }), Fs.crypto = void 0, Fs.crypto = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0), Fs;
 }
 var lh;
-function ti() {
+function ni() {
   return lh || (lh = 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 = p, e.rotl = y, e.byteSwap = g, e.byteSwap32 = w, e.bytesToHex = S, e.hexToBytes = I, e.asyncLoop = U, e.utf8ToBytes = M, e.bytesToUtf8 = v, e.toBytes = R, e.kdfInputToBytes = V, e.concatBytes = W, e.checkOpts = H, e.createHasher = N, e.createOptHasher = $, e.createXOFer = F, e.randomBytes = x;
@@ -1332,7 +1332,7 @@ var hh;
 function Lp() {
   if (hh) return Ut;
   hh = 1, Object.defineProperty(Ut, "__esModule", { value: !0 }), Ut.SHA512_IV = Ut.SHA384_IV = Ut.SHA224_IV = Ut.SHA256_IV = Ut.HashMD = void 0, Ut.setBigUint64 = t, Ut.Chi = n, Ut.Maj = r;
-  const e = /* @__PURE__ */ ti();
+  const e = /* @__PURE__ */ ni();
   function t(s, o, c, a) {
     if (typeof s.setBigUint64 == "function")
       return s.setBigUint64(o, c, a);
@@ -1539,7 +1539,7 @@ var ph;
 function Kp() {
   if (ph) return $e;
   ph = 1, Object.defineProperty($e, "__esModule", { value: !0 }), $e.sha512_224 = $e.sha512_256 = $e.sha384 = $e.sha512 = $e.sha224 = $e.sha256 = $e.SHA512_256 = $e.SHA512_224 = $e.SHA384 = $e.SHA512 = $e.SHA224 = $e.SHA256 = void 0;
-  const e = /* @__PURE__ */ Lp(), t = /* @__PURE__ */ Iw(), n = /* @__PURE__ */ ti(), r = /* @__PURE__ */ Uint32Array.from([
+  const e = /* @__PURE__ */ Lp(), t = /* @__PURE__ */ Iw(), n = /* @__PURE__ */ ni(), r = /* @__PURE__ */ Uint32Array.from([
     1116352408,
     1899447441,
     3049323471,
@@ -1822,7 +1822,7 @@ var Ms = {}, hu = {}, du = {}, yh;
 function Ow() {
   return yh || (yh = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.hmac = e.HMAC = void 0;
-    const t = /* @__PURE__ */ ti();
+    const t = /* @__PURE__ */ ni();
     class n extends t.Hash {
       constructor(s, o) {
         super(), this.finished = !1, this.destroyed = !1, (0, t.ahash)(s);
@@ -1871,8 +1871,8 @@ function vs() {
   return gh || (gh = 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 = p, e.numberToBytesLE = y, e.numberToVarBytesBE = g, e.ensureBytes = w, e.equalBytes = E, e.copyBytes = _, e.asciiToBytes = S, e.inRange = T, e.aInRange = I, e.bitLen = A, e.bitGet = U, e.bitSet = M, e.createHmacDrbg = R, e.validateObject = W, e.isHash = H, e._validateObject = K, e.memoized = $;
     /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-    const t = /* @__PURE__ */ ti();
-    var n = /* @__PURE__ */ ti();
+    const t = /* @__PURE__ */ ni();
+    var n = /* @__PURE__ */ ni();
     Object.defineProperty(e, "abytes", { enumerable: !0, get: function() {
       return n.abytes;
     } }), Object.defineProperty(e, "anumber", { enumerable: !0, get: function() {
@@ -2596,7 +2596,7 @@ function $p() {
   return bh || (bh = 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 = m, e.mapToCurveSimpleSWU = T, e.ecdh = A, e.ecdsa = U, e.weierstrassPoints = M, e._legacyHelperEquat = V, e.weierstrass = K;
     /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-    const t = /* @__PURE__ */ Ow(), n = /* @__PURE__ */ ti(), r = /* @__PURE__ */ vs(), i = /* @__PURE__ */ Pw(), s = /* @__PURE__ */ Lo(), o = (N, $) => (N + (N >= 0 ? $ : -$) / y) / $;
+    const t = /* @__PURE__ */ Ow(), n = /* @__PURE__ */ ni(), r = /* @__PURE__ */ vs(), i = /* @__PURE__ */ Pw(), s = /* @__PURE__ */ Lo(), o = (N, $) => (N + (N >= 0 ? $ : -$) / y) / $;
     function c(N, $, F) {
       const [[x, O], [q, P]] = $, L = o(P * N, F), G = o(-O * N, F);
       let X = N - L * x - G * q, Y = -L * O - G * P;
@@ -3607,7 +3607,7 @@ function Uw() {
   return Sh || (Sh = 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__ */ Kp(), n = /* @__PURE__ */ ti(), r = /* @__PURE__ */ kw(), i = /* @__PURE__ */ Nw(), s = /* @__PURE__ */ Lo(), o = /* @__PURE__ */ $p(), c = /* @__PURE__ */ vs(), a = {
+    const t = /* @__PURE__ */ Kp(), n = /* @__PURE__ */ ni(), r = /* @__PURE__ */ kw(), i = /* @__PURE__ */ Nw(), s = /* @__PURE__ */ Lo(), o = /* @__PURE__ */ $p(), c = /* @__PURE__ */ vs(), a = {
       p: BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),
       n: BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),
       h: BigInt(1),
@@ -4375,7 +4375,7 @@ function Ww(e) {
     t[n * 2] = jc[e[n] >> 4], t[n * 2 + 1] = jc[e[n] & 15];
   return Xp.decode(t);
 }
-function Tr(e) {
+function Ar(e) {
   const t = Dp.encode(e || ""), n = new Uint8Array(Math.floor(t.length / 2));
   let r;
   for (r = 0; r < n.length; r++) {
@@ -4430,7 +4430,7 @@ function Xw(e, t, n, r) {
     throw new Error(`The value of "value" is out of range. It must be >= 0 and <= ${0xffffffffffffffffn}. Received ${n}`);
   return r === "LE" ? (e[t] = Number(n & 0xffn), e[t + 1] = Number(n >> 8n & 0xffn), e[t + 2] = Number(n >> 16n & 0xffn), e[t + 3] = Number(n >> 24n & 0xffn), e[t + 4] = Number(n >> 32n & 0xffn), e[t + 5] = Number(n >> 40n & 0xffn), e[t + 6] = Number(n >> 48n & 0xffn), e[t + 7] = Number(n >> 56n & 0xffn)) : (e[t] = Number(n >> 56n & 0xffn), e[t + 1] = Number(n >> 48n & 0xffn), e[t + 2] = Number(n >> 40n & 0xffn), e[t + 3] = Number(n >> 32n & 0xffn), e[t + 4] = Number(n >> 24n & 0xffn), e[t + 5] = Number(n >> 16n & 0xffn), e[t + 6] = Number(n >> 8n & 0xffn), e[t + 7] = Number(n & 0xffn)), t + 8;
 }
-function mr(e, t) {
+function Er(e, t) {
   if (t + 1 > e.length)
     throw new Error("Offset is outside the bounds of Uint8Array");
   return e[t];
@@ -4502,13 +4502,13 @@ function Zw(e, t, n) {
   return r === 1 ? dn(e, n, t) : r === 2 ? (dn(e, n, Ke.OP_PUSHDATA1), dn(e, n + 1, t)) : r === 3 ? (dn(e, n, Ke.OP_PUSHDATA2), Dw(e, n + 1, t, "LE")) : (dn(e, n, Ke.OP_PUSHDATA4), Ko(e, n + 1, t, "LE")), r;
 }
 function Jw(e, t) {
-  const n = mr(e, t);
+  const n = Er(e, t);
   let r, i;
   if (n < Ke.OP_PUSHDATA1)
     r = n, i = 1;
   else if (n === Ke.OP_PUSHDATA1) {
     if (t + 2 > e.length) return null;
-    r = mr(e, t + 1), i = 2;
+    r = Er(e, t + 1), i = 2;
   } else if (n === Ke.OP_PUSHDATA2) {
     if (t + 3 > e.length) return null;
     r = zw(e, t + 1, "LE"), i = 3;
@@ -5014,7 +5014,7 @@ function rt(e, t, n) {
     throw new um(r.issues);
   return r.value;
 }
-function ni(e, t) {
+function ri(e, t) {
   const n = {};
   for (const r in e.entries)
     n[r] = Gc(e.entries[r]);
@@ -5037,7 +5037,7 @@ function Is(...e) {
     }
   };
 }
-const vh = new Uint8Array(32), Bh = Tr(
+const vh = new Uint8Array(32), Bh = Ar(
   "fffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"
 ), Et = (e) => Is(Ia(Uint8Array), ty(e));
 function ho(e, t) {
@@ -5066,7 +5066,7 @@ const hm = Is(
   Yf(),
   va(0),
   Aa(255)
-), ar = Is(
+), ur = Is(
   sn(),
   Yf(),
   va(0),
@@ -5092,7 +5092,7 @@ function Nh(e) {
   return t.set(e, n), t;
 }
 function dm(e) {
-  const t = mr(e, e.length - 1);
+  const t = Er(e, e.length - 1);
   if (!tl(t))
     throw new Error("Invalid hashType " + t);
   const n = Vw(e.subarray(0, -1)), r = Nh(n.r), i = Nh(n.s);
@@ -5204,7 +5204,7 @@ function tl(e) {
   const t = e & -129;
   return t > 0 && t < 4;
 }
-function br(e) {
+function _r(e) {
   return !(e instanceof Uint8Array) || !tl(e[e.length - 1]) ? !1 : qw(e.slice(0, -1));
 }
 const co = ym;
@@ -5236,10 +5236,10 @@ function Oa(e, t) {
     throw new TypeError("Not enough data");
   t = Object.assign({ validate: !0 }, t || {});
   function n(a) {
-    return br(a) || (t.allowIncomplete && a === rs.OP_0) !== void 0;
+    return _r(a) || (t.allowIncomplete && a === rs.OP_0) !== void 0;
   }
   rt(
-    ni(
+    ri(
       yt({
         network: yt({}),
         m: sn(),
@@ -5334,13 +5334,13 @@ function hy(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 || {}), rt(
-    ni(
+    ri(
       yt({
         network: yt({}),
         output: qe,
         pubkey: Mn(Hn, "invalid pubkey"),
         signature: Mn(
-          br,
+          _r,
           "Expected signature to be of type isCanonicalScriptSignature"
         ),
         input: qe
@@ -5376,7 +5376,7 @@ function hy(e, t) {
       throw new TypeError("Signature mismatch");
     if (e.input) {
       if (n().length !== 1) throw new TypeError("Input is invalid");
-      if (!br(i.signature))
+      if (!_r(i.signature))
         throw new TypeError("Input has invalid signature");
     }
   }
@@ -5556,7 +5556,7 @@ class nl extends xm {
     return this._cloneInto();
   }
 }
-const Ar = /* @__PURE__ */ Uint32Array.from([
+const Br = /* @__PURE__ */ Uint32Array.from([
   1779033703,
   3144134277,
   1013904242,
@@ -5565,7 +5565,7 @@ const Ar = /* @__PURE__ */ Uint32Array.from([
   2600822924,
   528734635,
   1541459225
-]), vr = /* @__PURE__ */ Uint32Array.from([
+]), Ir = /* @__PURE__ */ Uint32Array.from([
   3238371032,
   914150663,
   812702999,
@@ -5755,10 +5755,10 @@ const qm = (e, t, n) => (e >>> 0) + (t >>> 0) + (n >>> 0), Vm = (e, t, n, r) =>
   2756734187,
   3204031479,
   3329325298
-]), Br = /* @__PURE__ */ new Uint32Array(64);
+]), Or = /* @__PURE__ */ new Uint32Array(64);
 class _y extends nl {
   constructor(t = 32) {
-    super(64, t, 8, !1), this.A = Ar[0] | 0, this.B = Ar[1] | 0, this.C = Ar[2] | 0, this.D = Ar[3] | 0, this.E = Ar[4] | 0, this.F = Ar[5] | 0, this.G = Ar[6] | 0, this.H = Ar[7] | 0;
+    super(64, t, 8, !1), this.A = Br[0] | 0, this.B = Br[1] | 0, this.C = Br[2] | 0, this.D = Br[3] | 0, this.E = Br[4] | 0, this.F = Br[5] | 0, this.G = Br[6] | 0, this.H = Br[7] | 0;
   }
   get() {
     const { A: t, B: n, C: r, D: i, E: s, F: o, G: c, H: a } = this;
@@ -5770,20 +5770,20 @@ class _y extends nl {
   }
   process(t, n) {
     for (let l = 0; l < 16; l++, n += 4)
-      Br[l] = t.getUint32(n, !1);
+      Or[l] = t.getUint32(n, !1);
     for (let l = 16; l < 64; l++) {
-      const p = Br[l - 15], y = Br[l - 2], g = Kn(p, 7) ^ Kn(p, 18) ^ p >>> 3, w = Kn(y, 17) ^ Kn(y, 19) ^ y >>> 10;
-      Br[l] = w + Br[l - 7] + g + Br[l - 16] | 0;
+      const p = Or[l - 15], y = Or[l - 2], g = Kn(p, 7) ^ Kn(p, 18) ^ p >>> 3, w = Kn(y, 17) ^ Kn(y, 19) ^ y >>> 10;
+      Or[l] = w + Or[l - 7] + g + Or[l - 16] | 0;
     }
     let { A: r, B: i, C: s, D: o, E: c, F: a, G: u, H: f } = this;
     for (let l = 0; l < 64; l++) {
-      const p = Kn(c, 6) ^ Kn(c, 11) ^ Kn(c, 25), y = f + p + vm(c, a, u) + Wm[l] + Br[l] | 0, w = (Kn(r, 2) ^ Kn(r, 13) ^ Kn(r, 22)) + Bm(r, i, s) | 0;
+      const p = Kn(c, 6) ^ Kn(c, 11) ^ Kn(c, 25), y = f + p + vm(c, a, u) + Wm[l] + Or[l] | 0, w = (Kn(r, 2) ^ Kn(r, 13) ^ Kn(r, 22)) + Bm(r, i, s) | 0;
       f = u, u = a, a = c, c = o + y | 0, o = s, s = i, i = r, r = y + w | 0;
     }
     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() {
-    Ri(Br);
+    Ri(Or);
   }
   destroy() {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), Ri(this.buffer);
@@ -5791,7 +5791,7 @@ class _y extends nl {
 }
 class Gm extends _y {
   constructor() {
-    super(28), this.A = vr[0] | 0, this.B = vr[1] | 0, this.C = vr[2] | 0, this.D = vr[3] | 0, this.E = vr[4] | 0, this.F = vr[5] | 0, this.G = vr[6] | 0, this.H = vr[7] | 0;
+    super(28), this.A = Ir[0] | 0, this.B = Ir[1] | 0, this.C = Ir[2] | 0, this.D = Ir[3] | 0, this.E = Ir[4] | 0, this.F = Ir[5] | 0, this.G = Ir[6] | 0, this.H = Ir[7] | 0;
   }
 }
 const Sy = Mm([
@@ -5875,7 +5875,7 @@ const Sy = Mm([
   "0x597f299cfc657e2a",
   "0x5fcb6fab3ad6faec",
   "0x6c44198c4a475817"
-].map((e) => BigInt(e))), Dm = Sy[0], Xm = Sy[1], Ir = /* @__PURE__ */ new Uint32Array(80), Or = /* @__PURE__ */ new Uint32Array(80);
+].map((e) => BigInt(e))), Dm = Sy[0], Xm = Sy[1], Pr = /* @__PURE__ */ new Uint32Array(80), kr = /* @__PURE__ */ new Uint32Array(80);
 class zm extends nl {
   constructor(t = 64) {
     super(128, t, 16, !1), this.Ah = Rt[0] | 0, this.Al = Rt[1] | 0, this.Bh = Rt[2] | 0, this.Bl = Rt[3] | 0, this.Ch = Rt[4] | 0, this.Cl = Rt[5] | 0, this.Dh = Rt[6] | 0, this.Dl = Rt[7] | 0, this.Eh = Rt[8] | 0, this.El = Rt[9] | 0, this.Fh = Rt[10] | 0, this.Fl = Rt[11] | 0, this.Gh = Rt[12] | 0, this.Gl = Rt[13] | 0, this.Hh = Rt[14] | 0, this.Hl = Rt[15] | 0;
@@ -5891,14 +5891,14 @@ class zm extends nl {
   }
   process(t, n) {
     for (let m = 0; m < 16; m++, n += 4)
-      Ir[m] = t.getUint32(n), Or[m] = t.getUint32(n += 4);
+      Pr[m] = t.getUint32(n), kr[m] = t.getUint32(n += 4);
     for (let m = 16; m < 80; m++) {
-      const T = Ir[m - 15] | 0, I = Or[m - 15] | 0, A = zi(T, I, 1) ^ zi(T, I, 8) ^ Mh(T, I, 7), U = Yi(T, I, 1) ^ Yi(T, I, 8) ^ qh(T, I, 7), M = Ir[m - 2] | 0, v = Or[m - 2] | 0, R = zi(M, v, 19) ^ hc(M, v, 61) ^ Mh(M, v, 6), V = Yi(M, v, 19) ^ dc(M, v, 61) ^ qh(M, v, 6), W = Lm(U, V, Or[m - 7], Or[m - 16]), H = Km(W, A, R, Ir[m - 7], Ir[m - 16]);
-      Ir[m] = H | 0, Or[m] = W | 0;
+      const T = Pr[m - 15] | 0, I = kr[m - 15] | 0, A = zi(T, I, 1) ^ zi(T, I, 8) ^ Mh(T, I, 7), U = Yi(T, I, 1) ^ Yi(T, I, 8) ^ qh(T, I, 7), M = Pr[m - 2] | 0, v = kr[m - 2] | 0, R = zi(M, v, 19) ^ hc(M, v, 61) ^ Mh(M, v, 6), V = Yi(M, v, 19) ^ dc(M, v, 61) ^ qh(M, v, 6), W = Lm(U, V, kr[m - 7], kr[m - 16]), H = Km(W, A, R, Pr[m - 7], Pr[m - 16]);
+      Pr[m] = H | 0, kr[m] = W | 0;
     }
     let { Ah: r, Al: i, Bh: s, Bl: o, Ch: c, Cl: a, Dh: u, Dl: f, Eh: l, El: p, Fh: y, Fl: g, Gh: w, Gl: E, Hh: _, Hl: S } = this;
     for (let m = 0; m < 80; m++) {
-      const T = zi(l, p, 14) ^ zi(l, p, 18) ^ hc(l, p, 41), I = Yi(l, p, 14) ^ Yi(l, p, 18) ^ dc(l, p, 41), A = l & y ^ ~l & w, U = p & g ^ ~p & E, M = $m(S, I, U, Xm[m], Or[m]), v = jm(M, _, T, A, Dm[m], Ir[m]), R = M | 0, V = zi(r, i, 28) ^ hc(r, i, 34) ^ hc(r, i, 39), W = Yi(r, i, 28) ^ dc(r, i, 34) ^ dc(r, i, 39), H = r & s ^ r & c ^ s & c, K = i & o ^ i & a ^ o & a;
+      const T = zi(l, p, 14) ^ zi(l, p, 18) ^ hc(l, p, 41), I = Yi(l, p, 14) ^ Yi(l, p, 18) ^ dc(l, p, 41), A = l & y ^ ~l & w, U = p & g ^ ~p & E, M = $m(S, I, U, Xm[m], kr[m]), v = jm(M, _, T, A, Dm[m], Pr[m]), R = M | 0, V = zi(r, i, 28) ^ hc(r, i, 34) ^ hc(r, i, 39), W = Yi(r, i, 28) ^ dc(r, i, 34) ^ dc(r, i, 39), H = r & s ^ r & c ^ s & c, K = i & o ^ i & a ^ o & a;
       _ = w | 0, S = E | 0, w = y | 0, E = g | 0, y = l | 0, g = p | 0, { h: l, l: p } = Qn(u | 0, f | 0, v | 0, R | 0), u = c | 0, f = a | 0, c = s | 0, a = o | 0, s = r | 0, o = i | 0;
       const N = qm(R, W, K);
       r = Vm(N, v, V, H), i = N | 0;
@@ -5906,17 +5906,17 @@ class zm extends nl {
     ({ h: r, l: i } = Qn(this.Ah | 0, this.Al | 0, r | 0, i | 0)), { h: s, l: o } = Qn(this.Bh | 0, this.Bl | 0, s | 0, o | 0), { h: c, l: a } = Qn(this.Ch | 0, this.Cl | 0, c | 0, a | 0), { h: u, l: f } = Qn(this.Dh | 0, this.Dl | 0, u | 0, f | 0), { h: l, l: p } = Qn(this.Eh | 0, this.El | 0, l | 0, p | 0), { h: y, l: g } = Qn(this.Fh | 0, this.Fl | 0, y | 0, g | 0), { h: w, l: E } = Qn(this.Gh | 0, this.Gl | 0, w | 0, E | 0), { h: _, l: S } = Qn(this.Hh | 0, this.Hl | 0, _ | 0, S | 0), this.set(r, i, s, o, c, a, u, f, l, p, y, g, w, E, _, S);
   }
   roundClean() {
-    Ri(Ir, Or);
+    Ri(Pr, kr);
   }
   destroy() {
     Ri(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
   }
 }
 const pn = /* @__PURE__ */ Pa(() => new _y()), Ym = /* @__PURE__ */ Pa(() => new Gm()), Zm = /* @__PURE__ */ Pa(() => new zm()), Xt = pn;
-function wr(e) {
+function br(e) {
   return Hm(Xt(e));
 }
-function fi(e) {
+function li(e) {
   return Xt(Xt(e));
 }
 const Jm = {
@@ -6633,26 +6633,26 @@ function tb(e) {
 function nb(e) {
   return Xt(Xt(e));
 }
-const po = tb(nb), Pr = Ke;
+const po = tb(nb), Nr = Ke;
 function Wo(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 || {}), rt(
-    ni(
+    ri(
       yt({
         network: yt({}),
         address: Li(),
         hash: lm,
         output: Et(25),
         pubkey: Mn(Hn),
-        signature: Mn(br),
+        signature: Mn(_r),
         input: qe
       })
     ),
     e
   );
   const n = _n(() => {
-    const o = po.decode(e.address), c = mr(o, 0), a = o.slice(1);
+    const o = po.decode(e.address), c = Er(o, 0), a = o.slice(1);
     return { version: c, hash: a };
   }), r = _n(() => ct(e.input)), i = e.network || vn, s = { name: "p2pkh", network: i };
   if (Ee(s, "address", () => {
@@ -6662,15 +6662,15 @@ function Wo(e, t) {
   }), Ee(s, "hash", () => {
     if (e.output) return e.output.slice(3, 23);
     if (e.address) return n().hash;
-    if (e.pubkey || s.pubkey) return wr(e.pubkey || s.pubkey);
+    if (e.pubkey || s.pubkey) return br(e.pubkey || s.pubkey);
   }), Ee(s, "output", () => {
     if (s.hash)
       return Yt([
-        Pr.OP_DUP,
-        Pr.OP_HASH160,
+        Nr.OP_DUP,
+        Nr.OP_HASH160,
         s.hash,
-        Pr.OP_EQUALVERIFY,
-        Pr.OP_CHECKSIG
+        Nr.OP_EQUALVERIFY,
+        Nr.OP_CHECKSIG
       ]);
   }), Ee(s, "pubkey", () => {
     if (e.input)
@@ -6698,7 +6698,7 @@ function Wo(e, t) {
       o = e.hash;
     }
     if (e.output) {
-      if (e.output.length !== 25 || e.output[0] !== Pr.OP_DUP || e.output[1] !== Pr.OP_HASH160 || e.output[2] !== 20 || e.output[23] !== Pr.OP_EQUALVERIFY || e.output[24] !== Pr.OP_CHECKSIG)
+      if (e.output.length !== 25 || e.output[0] !== Nr.OP_DUP || e.output[1] !== Nr.OP_HASH160 || e.output[2] !== 20 || e.output[23] !== Nr.OP_EQUALVERIFY || e.output[24] !== Nr.OP_CHECKSIG)
         throw new TypeError("Output is invalid");
       const c = e.output.slice(3, 23);
       if (o.length > 0 && he(o, c) !== 0)
@@ -6706,7 +6706,7 @@ function Wo(e, t) {
       o = c;
     }
     if (e.pubkey) {
-      const c = wr(e.pubkey);
+      const c = br(e.pubkey);
       if (o.length > 0 && he(o, c) !== 0)
         throw new TypeError("Hash mismatch");
       o = c;
@@ -6714,14 +6714,14 @@ function Wo(e, t) {
     if (e.input) {
       const c = r();
       if (c.length !== 2) throw new TypeError("Input is invalid");
-      if (!br(c[0]))
+      if (!_r(c[0]))
         throw new TypeError("Input has invalid signature");
       if (!Hn(c[1])) throw new TypeError("Input has invalid pubkey");
       if (e.signature && he(e.signature, c[0]) !== 0)
         throw new TypeError("Signature mismatch");
       if (e.pubkey && he(e.pubkey, c[1]) !== 0)
         throw new TypeError("Pubkey mismatch");
-      const a = wr(c[1]);
+      const a = br(c[1]);
       if (o.length > 0 && he(o, a) !== 0)
         throw new TypeError("Hash mismatch");
     }
@@ -6733,13 +6733,13 @@ function Go(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 || {}), rt(
-    ni(
+    ri(
       yt({
         network: yt({}),
         address: Li(),
         hash: Et(20),
         output: Et(23),
-        redeem: ni(
+        redeem: ri(
           yt({
             network: yt({}),
             output: qe,
@@ -6756,7 +6756,7 @@ function Go(e, t) {
   let n = e.network;
   n || (n = e.redeem && e.redeem.network || vn);
   const r = { network: n }, i = _n(() => {
-    const c = po.decode(e.address), a = mr(c, 0), u = c.slice(1);
+    const c = po.decode(e.address), a = Er(c, 0), u = c.slice(1);
     return { version: a, hash: u };
   }), s = _n(() => ct(e.input)), o = _n(() => {
     const c = s(), a = c[c.length - 1];
@@ -6774,7 +6774,7 @@ function Go(e, t) {
   }), Ee(r, "hash", () => {
     if (e.output) return e.output.slice(2, 22);
     if (e.address) return i().hash;
-    if (r.redeem && r.redeem.output) return wr(r.redeem.output);
+    if (r.redeem && r.redeem.output) return br(r.redeem.output);
   }), Ee(r, "output", () => {
     if (r.hash)
       return Yt([qs.OP_HASH160, r.hash, qs.OP_EQUAL]);
@@ -6826,7 +6826,7 @@ function Go(e, t) {
           throw new TypeError(
             "Redeem.output unspendable with more than 201 non-push ops"
           );
-        const l = wr(u.output);
+        const l = br(u.output);
         if (c.length > 0 && he(c, l) !== 0)
           throw new TypeError("Hash mismatch");
         c = l;
@@ -6867,10 +6867,10 @@ function Go(e, t) {
   }
   return Object.assign(r, e);
 }
-var li = {}, Vh;
+var hi = {}, Vh;
 function Do() {
-  if (Vh) return li;
-  Vh = 1, Object.defineProperty(li, "__esModule", { value: !0 }), li.bech32m = li.bech32 = void 0;
+  if (Vh) return hi;
+  Vh = 1, Object.defineProperty(hi, "__esModule", { value: !0 }), hi.bech32m = hi.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 Do() {
       fromWords: c
     };
   }
-  return li.bech32 = a("bech32"), li.bech32m = a("bech32m"), li;
+  return hi.bech32 = a("bech32"), hi.bech32m = a("bech32m"), hi;
 }
 var qt = Do();
 const Lh = Ke, rb = new Uint8Array(0);
@@ -7008,7 +7008,7 @@ function Na(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 || {}), rt(
-    ni(
+    ri(
       yt({
         address: Li(),
         hash: Et(20),
@@ -7016,7 +7016,7 @@ function Na(e, t) {
         network: yt({}),
         output: Et(22),
         pubkey: Mn(Hn, "Not a valid pubkey"),
-        signature: Mn(br),
+        signature: Mn(_r),
         witness: cn(qe)
       })
     ),
@@ -7037,7 +7037,7 @@ function Na(e, t) {
   }), Ee(i, "hash", () => {
     if (e.output) return e.output.slice(2, 22);
     if (e.address) return n().data;
-    if (e.pubkey || i.pubkey) return wr(e.pubkey || i.pubkey);
+    if (e.pubkey || i.pubkey) return br(e.pubkey || i.pubkey);
   }), Ee(i, "output", () => {
     if (i.hash)
       return Yt([Lh.OP_0, i.hash]);
@@ -7078,7 +7078,7 @@ function Na(e, t) {
       s = e.output.slice(2);
     }
     if (e.pubkey) {
-      const o = wr(e.pubkey);
+      const o = br(e.pubkey);
       if (s.length > 0 && he(s, o) !== 0)
         throw new TypeError("Hash mismatch");
       if (s = o, !Hn(e.pubkey) || e.pubkey.length !== 33)
@@ -7086,7 +7086,7 @@ function Na(e, t) {
     }
     if (e.witness) {
       if (e.witness.length !== 2) throw new TypeError("Witness is invalid");
-      if (!br(e.witness[0]))
+      if (!_r(e.witness[0]))
         throw new TypeError("Witness has invalid signature");
       if (!Hn(e.witness[1]) || e.witness[1].length !== 33)
         throw new TypeError("Witness has invalid pubkey");
@@ -7094,7 +7094,7 @@ function Na(e, t) {
         throw new TypeError("Signature mismatch");
       if (e.pubkey && he(e.pubkey, e.witness[1]) !== 0)
         throw new TypeError("Pubkey mismatch");
-      const o = wr(e.witness[1]);
+      const o = br(e.witness[1]);
       if (s.length > 0 && he(s, o) !== 0)
         throw new TypeError("Hash mismatch");
     }
@@ -7245,7 +7245,7 @@ function wf() {
     );
   return ao.eccLib;
 }
-const er = (e) => Tr(e);
+const er = (e) => Ar(e);
 function sb(e) {
   wn(typeof e.isXOnlyPoint == "function"), wn(
     e.isXOnlyPoint(
@@ -7371,7 +7371,7 @@ function pb(e) {
 function xy(e) {
   typeof e == "number" ? pb(e) : db(e);
 }
-function ri(e, t, n) {
+function ii(e, t, n) {
   xy(e), n === void 0 && (n = 0), t === void 0 && (t = new Uint8Array(Tn(e)));
   let r = 0;
   return e < 253 ? (t.set([Number(e)], n), r = 1) : e <= 65535 ? (t.set([253], n), cb(t, n + 1, Number(e), "LE"), r = 3) : e <= 4294967295 ? (t.set([254], n), ab(t, n + 1, Number(e), "LE"), r = 5) : (t.set([255], n), ub(t, n + 1, BigInt(e), "LE"), r = 9), { buffer: t, bytes: r };
@@ -7434,7 +7434,7 @@ class Ht {
     return new Ht(new Uint8Array(t));
   }
   constructor(t, n = 0) {
-    this.buffer = t, this.offset = n, rt(Gn([qe, ar]), [
+    this.buffer = t, this.offset = n, rt(Gn([qe, ur]), [
       t,
       n
     ]);
@@ -7455,7 +7455,7 @@ class Ht {
     this.offset = Xw(this.buffer, this.offset, BigInt(t), "LE");
   }
   writeVarInt(t) {
-    const { bytes: n } = ri(t, this.buffer, this.offset);
+    const { bytes: n } = ii(t, this.buffer, this.offset);
     this.offset += n;
   }
   writeSlice(t) {
@@ -7479,13 +7479,13 @@ class wb {
   buffer;
   offset;
   constructor(t, n = 0) {
-    this.buffer = t, this.offset = n, rt(Gn([qe, ar]), [
+    this.buffer = t, this.offset = n, rt(Gn([qe, ur]), [
       t,
       n
     ]);
   }
   readUInt8() {
-    const t = mr(this.buffer, this.offset);
+    const t = Er(this.buffer, this.offset);
     return this.offset++, t;
   }
   readInt32() {
@@ -7536,7 +7536,7 @@ function mf(e, t) {
   return r;
 }
 function bf(e) {
-  if (Qf(e)) return { hash: hr(e) };
+  if (Qf(e)) return { hash: pr(e) };
   const t = [bf(e[0]), bf(e[1])];
   t.sort((i, s) => he(i.hash, s.hash));
   const [n, r] = t;
@@ -7555,7 +7555,7 @@ function zc(e, t) {
   } else if (he(e.hash, t) === 0)
     return [];
 }
-function hr(e) {
+function pr(e) {
   const t = e.version || Ay;
   return ka(
     "TapLeaf",
@@ -7581,14 +7581,14 @@ function Ef(e, t) {
 }
 function _b(e) {
   const t = Tn(e.length), n = new Uint8Array(t);
-  return ri(e.length, n), it([n, e]);
+  return ii(e.length, n), it([n, e]);
 }
 const jh = Ke, Wh = 1, Sb = 80;
 function zo(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 || {}), rt(
-    ni(
+    ri(
       yt({
         address: Li(),
         input: Et(0),
@@ -7605,7 +7605,7 @@ function zo(e, t) {
         ]),
         witness: cn(qe),
         scriptTree: Mn(oy, "Taptree is not of type isTaptree"),
-        redeem: ni(
+        redeem: ri(
           yt({
             output: qe,
             // tapleaf script
@@ -7635,7 +7635,7 @@ function zo(e, t) {
     if (c) return c.hash;
     const a = r();
     if (a && a.length > 1) {
-      const u = a[a.length - 1], f = u[0] & Nc, l = a[a.length - 2], p = hr({ output: l, version: f });
+      const u = a[a.length - 1], f = u[0] & Nc, l = a[a.length - 2], p = pr({ output: l, version: f });
       return mf(u, p);
     }
     return null;
@@ -7672,7 +7672,7 @@ function zo(e, t) {
     if (e.witness) return e.witness;
     const c = i();
     if (c && e.redeem && e.redeem.output && e.internalPubkey) {
-      const a = hr({
+      const a = pr({
         output: e.redeem.output,
         version: o.redeemVersion
       }), u = zc(c, a);
@@ -7723,7 +7723,7 @@ function zo(e, t) {
     if (e.hash && a && he(e.hash, a.hash) !== 0)
       throw new TypeError("Hash mismatch");
     if (e.redeem && e.redeem.output && a) {
-      const f = hr({
+      const f = pr({
         output: e.redeem.output,
         version: o.redeemVersion
       });
@@ -7767,7 +7767,7 @@ function zo(e, t) {
           throw new TypeError("Internal pubkey mismatch");
         if (!wf().isXOnlyPoint(p))
           throw new TypeError("Invalid internalPubkey for p2tr witness");
-        const y = f[0] & Nc, g = u[u.length - 2], w = hr({ output: g, version: y }), E = mf(f, w), _ = yc(p, E);
+        const y = f[0] & Nc, g = u[u.length - 2], w = pr({ output: g, version: y }), E = mf(f, w), _ = yc(p, E);
         if (!_)
           throw new TypeError("Invalid outputKey for p2tr witness");
         if (c.length && he(c, _.x) !== 0)
@@ -7794,7 +7794,7 @@ function Ny(e) {
   const t = po.decode(e);
   if (t.length < 21) throw new TypeError(e + " is too short");
   if (t.length > 21) throw new TypeError(e + " is too long");
-  const n = mr(t, 0), r = t.slice(1);
+  const n = Er(t, 0), r = t.slice(1);
   return { version: n, hash: r };
 }
 function il(e) {
@@ -7890,12 +7890,12 @@ function vb(e) {
   const t = e.length;
   return Tn(t) + e.reduce((n, r) => n + Wn(r), 0);
 }
-const Gr = new Uint8Array(0), Gh = [], _u = Tr(
+const Dr = new Uint8Array(0), Gh = [], _u = Ar(
   "0000000000000000000000000000000000000000000000000000000000000000"
-), Dh = Tr(
+), Dh = Ar(
   "0000000000000000000000000000000000000000000000000000000000000001"
-), Bb = Tr("ffffffffffffffff"), Ib = {
-  script: Gr,
+), Bb = Ar("ffffffffffffffff"), Ib = {
+  script: Dr,
   valueBuffer: Bb
 };
 function Ob(e) {
@@ -7945,7 +7945,7 @@ let ht = class Ge {
     return i;
   }
   static fromHex(t) {
-    return Ge.fromBuffer(Tr(t), !1);
+    return Ge.fromBuffer(Ar(t), !1);
   }
   static isCoinbaseHash(t) {
     rt(Ih, t);
@@ -7964,15 +7964,15 @@ let ht = class Ge {
     return rt(
       Gn([
         Ih,
-        ar,
-        gf(Gc(ar)),
+        ur,
+        gf(Gc(ur)),
         gf(Gc(qe))
       ]),
       [t, n, r, i]
     ), r == null && (r = Ge.DEFAULT_SEQUENCE), this.ins.push({
       hash: t,
       index: n,
-      script: i || Gr,
+      script: i || Dr,
       sequence: r,
       witness: Gh
     }) - 1;
@@ -8022,7 +8022,7 @@ let ht = class Ge {
    * This hash can then be used to sign the provided transaction input.
    */
   hashForSignature(t, n, r) {
-    if (rt(Gn([ar, qe, sn()]), [
+    if (rt(Gn([ur, qe, sn()]), [
       t,
       n,
       r
@@ -8044,24 +8044,24 @@ let ht = class Ge {
       });
     }
     r & Ge.SIGHASH_ANYONECANPAY ? (s.ins = [s.ins[t]], s.ins[0].script = i) : (s.ins.forEach((c) => {
-      c.script = Gr;
+      c.script = Dr;
     }), s.ins[t].script = i);
     const o = new Uint8Array(s.byteLength(!1) + 4);
-    return Yp(o, o.length - 4, r, "LE"), s.__toBuffer(o, 0, !1), fi(o);
+    return Yp(o, o.length - 4, r, "LE"), s.__toBuffer(o, 0, !1), li(o);
   }
   hashForWitnessV1(t, n, r, i, s, o) {
     if (rt(
       Gn([
-        ar,
+        ur,
         cn(qe),
         cn(wu),
-        ar
+        ur
       ]),
       [t, n, r, i]
     ), 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 === Ge.SIGHASH_DEFAULT ? Ge.SIGHASH_ALL : i & Ge.SIGHASH_OUTPUT_MASK, u = (i & Ge.SIGHASH_INPUT_MASK) === Ge.SIGHASH_ANYONECANPAY, f = c === Ge.SIGHASH_NONE, l = c === Ge.SIGHASH_SINGLE;
-    let p = Gr, y = Gr, g = Gr, w = Gr, E = Gr;
+    let p = Dr, y = Dr, g = Dr, w = Dr, E = Dr;
     if (!u) {
       let T = Ht.withCapacity(36 * this.ins.length);
       this.ins.forEach((I) => {
@@ -8105,33 +8105,33 @@ let ht = class Ge {
   hashForWitnessV0(t, n, r, i) {
     rt(
       Gn([
-        ar,
+        ur,
         qe,
         wu,
-        ar
+        ur
       ]),
       [t, n, r, i]
     );
     let s = Uint8Array.from([]), o, c = _u, a = _u, u = _u;
     if (i & Ge.SIGHASH_ANYONECANPAY || (s = new Uint8Array(36 * this.ins.length), o = new Ht(s, 0), this.ins.forEach((l) => {
       o.writeSlice(l.hash), o.writeUInt32(l.index);
-    }), a = fi(s)), !(i & Ge.SIGHASH_ANYONECANPAY) && (i & 31) !== Ge.SIGHASH_SINGLE && (i & 31) !== Ge.SIGHASH_NONE && (s = new Uint8Array(4 * this.ins.length), o = new Ht(s, 0), this.ins.forEach((l) => {
+    }), a = li(s)), !(i & Ge.SIGHASH_ANYONECANPAY) && (i & 31) !== Ge.SIGHASH_SINGLE && (i & 31) !== Ge.SIGHASH_NONE && (s = new Uint8Array(4 * this.ins.length), o = new Ht(s, 0), this.ins.forEach((l) => {
       o.writeUInt32(l.sequence);
-    }), u = fi(s)), (i & 31) !== Ge.SIGHASH_SINGLE && (i & 31) !== Ge.SIGHASH_NONE) {
+    }), u = li(s)), (i & 31) !== Ge.SIGHASH_SINGLE && (i & 31) !== Ge.SIGHASH_NONE) {
       const l = this.outs.reduce((p, y) => p + 8 + Wn(y.script), 0);
       s = new Uint8Array(l), o = new Ht(s, 0), this.outs.forEach((p) => {
         o.writeInt64(p.value), o.writeVarSlice(p.script);
-      }), c = fi(s);
+      }), c = li(s);
     } else if ((i & 31) === Ge.SIGHASH_SINGLE && t < this.outs.length) {
       const l = this.outs[t];
-      s = new Uint8Array(8 + Wn(l.script)), o = new Ht(s, 0), o.writeInt64(l.value), o.writeVarSlice(l.script), c = fi(s);
+      s = new Uint8Array(8 + Wn(l.script)), o = new Ht(s, 0), o.writeInt64(l.value), o.writeVarSlice(l.script), c = li(s);
     }
     s = new Uint8Array(156 + Wn(n)), o = new Ht(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), fi(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), li(s);
   }
   getHash(t) {
-    return t && this.isCoinbase() ? new Uint8Array(32) : fi(this.__toBuffer(void 0, void 0, t));
+    return t && this.isCoinbase() ? new Uint8Array(32) : li(this.__toBuffer(void 0, void 0, t));
   }
   getId() {
     return _e(rl(this.getHash(!1)));
@@ -8590,7 +8590,7 @@ function j2(e) {
 }
 function W2(e) {
   const { script: t, value: n } = e, r = Tn(t.length), i = new Uint8Array(8 + r + t.length);
-  return Zp(i, 0, BigInt(n), "LE"), ri(t.length, i, 8), i.set(t, 8 + r), {
+  return Zp(i, 0, BigInt(n), "LE"), ii(t.length, i, 8), i.set(t, 8 + r), {
     key: Uint8Array.from([ye.WITNESS_UTXO]),
     value: i
   };
@@ -8634,7 +8634,7 @@ function Z2(e) {
   const t = Uint8Array.from([ft.TAP_TREE]), n = [].concat(
     ...e.leaves.map((r) => [
       Uint8Array.of(r.depth, r.leafVersion),
-      ri(BigInt(r.script.length)).buffer,
+      ii(BigInt(r.script.length)).buffer,
       r.script
     ])
   );
@@ -8771,7 +8771,7 @@ function Fy(e) {
   }
   function r(o) {
     const c = t.encode(o), a = Tn(o.leafHashes.length), u = new Uint8Array(a);
-    ri(o.leafHashes.length, u);
+    ii(o.leafHashes.length, u);
     const f = it([u, ...o.leafHashes, c.value]);
     return { ...c, value: f };
   }
@@ -8876,7 +8876,7 @@ const cl = {
   ),
   tapInternalKey: My(ye.TAP_INTERNAL_KEY),
   tapMerkleRoot: F2
-}, ur = {
+}, fr = {
   bip32Derivation: sl(ft.BIP32_DERIVATION),
   redeemScript: Hy(ft.REDEEM_SCRIPT),
   witnessScript: qy(ft.WITNESS_SCRIPT),
@@ -8890,7 +8890,7 @@ const cl = {
   __proto__: null,
   globals: cl,
   inputs: gt,
-  outputs: ur
+  outputs: fr
 }, Symbol.toStringTag, { value: "Module" })), Yc = (e) => [...Array(e).keys()];
 function Xh(e) {
   const t = e.map(oE);
@@ -8898,7 +8898,7 @@ function Xh(e) {
 }
 function oE(e) {
   const t = e.key.length, n = e.value.length, r = Tn(t), i = Tn(n), s = new Uint8Array(r + t + i + n);
-  return ri(t, s, 0), s.set(e.key, r), ri(n, s, r + t), s.set(e.value, r + t + i), s;
+  return ii(t, s, 0), s.set(e.key, r), ii(n, s, r + t), s.set(e.value, r + t + i), s;
 }
 function cE(e, t) {
   let n = 0;
@@ -8913,7 +8913,7 @@ function cE(e, t) {
     return n += 4, E;
   }
   function s() {
-    const E = mr(e, n);
+    const E = Er(e, n);
     return n += 1, E;
   }
   function o() {
@@ -8926,7 +8926,7 @@ function cE(e, t) {
   function c() {
     if (n >= e.length)
       throw new Error("Format Error: Unexpected End of PSBT");
-    const E = mr(e, n) === 0;
+    const E = Er(e, n) === 0;
     return E && n++, E;
   }
   if (i() !== 1886610036)
@@ -9084,31 +9084,31 @@ function Vy(e, { globalMapKeyVals: t, inputKeyVals: n, outputKeyVals: r }) {
   for (const f of Yc(c)) {
     const l = {};
     for (const p of r[f])
-      switch (ur.checkPubkey(p), p.key[0]) {
+      switch (fr.checkPubkey(p), p.key[0]) {
         case ft.REDEEM_SCRIPT:
           if (Ct("output", p.key, ft.REDEEM_SCRIPT), l.redeemScript !== void 0)
             throw new Error("Format Error: Output has multiple REDEEM_SCRIPT");
-          l.redeemScript = ur.redeemScript.decode(p);
+          l.redeemScript = fr.redeemScript.decode(p);
           break;
         case ft.WITNESS_SCRIPT:
           if (Ct("output", p.key, ft.WITNESS_SCRIPT), l.witnessScript !== void 0)
             throw new Error("Format Error: Output has multiple WITNESS_SCRIPT");
-          l.witnessScript = ur.witnessScript.decode(p);
+          l.witnessScript = fr.witnessScript.decode(p);
           break;
         case ft.BIP32_DERIVATION:
           l.bip32Derivation === void 0 && (l.bip32Derivation = []), l.bip32Derivation.push(
-            ur.bip32Derivation.decode(p)
+            fr.bip32Derivation.decode(p)
           );
           break;
         case ft.TAP_INTERNAL_KEY:
-          Ct("output", p.key, ft.TAP_INTERNAL_KEY), l.tapInternalKey = ur.tapInternalKey.decode(p);
+          Ct("output", p.key, ft.TAP_INTERNAL_KEY), l.tapInternalKey = fr.tapInternalKey.decode(p);
           break;
         case ft.TAP_TREE:
-          Ct("output", p.key, ft.TAP_TREE), l.tapTree = ur.tapTree.decode(p);
+          Ct("output", p.key, ft.TAP_TREE), l.tapTree = fr.tapTree.decode(p);
           break;
         case ft.TAP_BIP32_DERIVATION:
           l.tapBip32Derivation === void 0 && (l.tapBip32Derivation = []), l.tapBip32Derivation.push(
-            ur.tapBip32Derivation.decode(p)
+            fr.tapBip32Derivation.decode(p)
           );
           break;
         default:
@@ -9149,7 +9149,7 @@ function _f({ globalMap: e, inputs: t, outputs: n }) {
   return {
     globalKeyVals: Su(e, cl),
     inputKeyVals: t.map((r) => Su(r, gt)),
-    outputKeyVals: n.map((r) => Su(r, ur))
+    outputKeyVals: n.map((r) => Su(r, fr))
   };
 }
 function fE(e) {
@@ -9300,7 +9300,7 @@ let Zh = class {
     return this.fromBuffer(r, n);
   }
   static fromHex(t, n) {
-    const r = Tr(t);
+    const r = Ar(t);
     return this.fromBuffer(r, n);
   }
   static fromBuffer(t, n) {
@@ -9404,7 +9404,7 @@ function Zc(e) {
   }
   function r(o) {
     const c = t.length, a = Tn(o);
-    t = it([t, new Uint8Array(a)]), ri(o, t, c);
+    t = it([t, new Uint8Array(a)]), ii(o, t, c);
   }
   function i(o) {
     r(o.length), n(o);
@@ -9415,7 +9415,7 @@ function Zc(e) {
   return s(e), t;
 }
 function Wy(e, t) {
-  const n = wr(e), r = e.slice(1, 33), i = ct(t);
+  const n = br(e), r = e.slice(1, 33), i = ct(t);
   if (i === null) throw new Error("Unknown script error");
   return i.findIndex((s) => typeof s == "number" ? !1 : he(e, s) === 0 || he(n, s) === 0 || he(r, s) === 0);
 }
@@ -9450,7 +9450,7 @@ function bE(e) {
 }
 function EE(e) {
   const t = e.finalScriptSig ? ct(e.finalScriptSig) || [] : [], n = e.finalScriptWitness ? ct(e.finalScriptWitness) || [] : [];
-  return t.concat(n).filter((r) => r instanceof Uint8Array && br(r)).map((r) => ({ signature: r }));
+  return t.concat(n).filter((r) => r instanceof Uint8Array && _r(r)).map((r) => ({ signature: r }));
 }
 const Uc = (e) => e.length === 32 ? e : e.slice(1, 33);
 function Qh(e, t, n) {
@@ -9581,14 +9581,14 @@ function kE(e, t, n) {
 }
 function Bu(e, t) {
   if (!t) return !0;
-  const n = hr({
+  const n = pr({
     output: e.script,
     version: e.leafVersion
   }), r = mf(e.controlBlock, n);
   return he(r, t) === 0;
 }
 function NE(e, t) {
-  const n = hr({
+  const n = pr({
     output: t.script,
     version: t.leafVersion
   });
@@ -9617,7 +9617,7 @@ function RE(e, t, n) {
   return r;
 }
 function CE(e, t, n) {
-  const r = hr({
+  const r = pr({
     output: e.script,
     version: e.leafVersion
   });
@@ -9647,7 +9647,7 @@ class Jc {
     return this.fromBuffer(r, n);
   }
   static fromHex(t, n = {}) {
-    const r = Tr(t);
+    const r = Ar(t);
     return this.fromBuffer(r, n);
   }
   static fromBuffer(t, n = {}) {
@@ -10277,7 +10277,7 @@ class Dy {
   addInput(t) {
     if (t.hash === void 0 || t.index === void 0 || !(t.hash instanceof Uint8Array) && typeof t.hash != "string" || typeof t.index != "number")
       throw new Error("Error adding input.");
-    const n = typeof t.hash == "string" ? rl(Tr(t.hash)) : t.hash;
+    const n = typeof t.hash == "string" ? rl(Ar(t.hash)) : t.hash;
     this.tx.addInput(n, t.index, t.sequence);
   }
   addOutput(t) {
@@ -10535,7 +10535,7 @@ function Tf(e, t, n, r, i, s, o) {
     }
   }
   const y = (t.tapLeafScript || []).filter((g) => Ra(r, g.script)).map((g) => {
-    const w = hr({
+    const w = pr({
       output: g.script,
       version: g.leafVersion
     });
@@ -10784,7 +10784,7 @@ function ig(e) {
   return e.length === 33 && Em(e);
 }
 function t_(e) {
-  return br(e);
+  return _r(e);
 }
 function Ha(e, t, n, r, i) {
   const s = $y(e), o = s && r && Jh(r), c = Jh(e);
@@ -11402,7 +11402,7 @@ function _t(e) {
   }
   return r.buffer;
 }
-function Dr(e) {
+function Xr(e) {
   const t = new Uint8Array(e.buffer);
   let n = 0;
   for (; n < t.byteLength; n++)
@@ -11596,7 +11596,7 @@ class Bn extends Ma {
   _buildTypeTableImpl(t) {
   }
 }
-class oi extends Ma {
+class ci extends Ma {
   checkType(t) {
     if (t instanceof xn) {
       const n = t.getType();
@@ -11745,7 +11745,7 @@ class wo extends Bn {
     return "null";
   }
 }
-class ii extends Bn {
+class si extends Bn {
   get typeName() {
     return ve.ReservedClass;
   }
@@ -11827,7 +11827,7 @@ class ll extends Bn {
     return _t(He.Int);
   }
   decodeValue(t, n) {
-    return this.checkType(n), Dr(t);
+    return this.checkType(n), Xr(t);
   }
   get name() {
     return "int";
@@ -11952,7 +11952,7 @@ class Fi extends Bn {
     return t.toString();
   }
 }
-class ei extends Bn {
+class ti extends Bn {
   get typeName() {
     return ve.FixedNatClass;
   }
@@ -11991,7 +11991,7 @@ class ei extends Bn {
     return t.toString();
   }
 }
-class Es extends oi {
+class Es extends ci {
   get typeName() {
     return ve.VecClass;
   }
@@ -11999,13 +11999,13 @@ class Es extends oi {
     return t.typeName === ve.VecClass;
   }
   constructor(t) {
-    super(), this._type = t, this._blobOptimization = !1, t instanceof ei && t._bits === 8 && (this._blobOptimization = !0);
+    super(), this._type = t, this._blobOptimization = !1, t instanceof ti && t._bits === 8 && (this._blobOptimization = !0);
   }
   accept(t, n) {
     return t.visitVec(this, this._type, n);
   }
   covariant(t) {
-    const n = this._type instanceof ei ? this._type._bits : this._type instanceof Fi ? this._type._bits : 0;
+    const n = this._type instanceof ti ? this._type._bits : this._type instanceof Fi ? 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 Es))
       throw new Error("Not a vector type");
     const i = Number(xt(t));
-    if (this._type instanceof ei) {
+    if (this._type instanceof ti) {
       if (this._type._bits == 8)
         return new Uint8Array(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 Er extends oi {
+class Sr extends ci {
   get typeName() {
     return ve.OptClass;
   }
@@ -12144,7 +12144,7 @@ class Er extends oi {
   decodeValue(t, n) {
     if (n instanceof wo)
       return [];
-    if (n instanceof ii)
+    if (n instanceof si)
       return [];
     let r = n;
     if (n instanceof xn) {
@@ -12153,7 +12153,7 @@ class Er extends oi {
         throw new Error("type mismatch with uninitialized type");
       r = i;
     }
-    if (r instanceof Er)
+    if (r instanceof Sr)
       switch (Hi(t)) {
         case 0:
           return [];
@@ -12171,7 +12171,7 @@ class Er extends oi {
     else {
       if (
         // this check corresponds to `not (null <: <t>)` in the spec
-        this._type instanceof wo || this._type instanceof Er || this._type instanceof ii
+        this._type instanceof wo || this._type instanceof Sr || this._type instanceof si
       )
         return r.decodeValue(t, r), [];
       {
@@ -12194,7 +12194,7 @@ class Er extends oi {
     return t.length === 0 ? "null" : `opt ${this._type.valueToString(t[0])}`;
   }
 }
-class Mi extends oi {
+class Mi extends ci {
   get typeName() {
     return ve.RecordClass;
   }
@@ -12257,7 +12257,7 @@ field ${n} -> ${i.message}`);
       if (l === p)
         i[u] = f.decodeValue(t, a), s++, o++;
       else if (p > l)
-        if (f instanceof Er || f instanceof ii)
+        if (f instanceof Sr || f instanceof si)
           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 Er || a instanceof ii)
+      if (a instanceof Sr || a instanceof si)
         i[c] = [];
       else
         throw new Error("Cannot find required field " + c);
@@ -12337,7 +12337,7 @@ index ${r} -> ${i.message}`);
     return `record {${go(this._components, t, (r, i) => r.valueToString(i)).join("; ")}}`;
   }
 }
-class _s extends oi {
+class _s extends ci {
   get typeName() {
     return ve.VariantClass;
   }
@@ -12416,7 +12416,7 @@ variant ${n} -> ${i.message}`);
     return t;
   }
 }
-const Ta = class Ta extends oi {
+const Ta = class Ta extends ci {
   constructor() {
     super(...arguments), this._id = Ta._counter++;
   }
@@ -12511,7 +12511,7 @@ class pg extends Bn {
     return `${this.name} "${t.toText()}"`;
   }
 }
-class mo extends oi {
+class mo extends ci {
   get typeName() {
     return ve.FuncClass;
   }
@@ -12573,7 +12573,7 @@ class mo extends oi {
     throw new Error("Illegal function annotation");
   }
 }
-class ta extends oi {
+class ta extends ci {
   get typeName() {
     return ve.ServiceClass;
   }
@@ -12653,11 +12653,11 @@ function yg(e, t) {
   function s(p) {
     const y = [], g = Number(xt(p));
     for (let _ = 0; _ < g; _++) {
-      const S = Number(Dr(p));
+      const S = Number(Xr(p));
       switch (S) {
         case He.Opt:
         case He.Vector: {
-          const m = Number(Dr(p));
+          const m = Number(Xr(p));
           y.push([S, m]);
           break;
         }
@@ -12672,7 +12672,7 @@ function yg(e, t) {
             if (typeof I == "number" && I >= A)
               throw new Error("field id collision or not sorted");
             I = A;
-            const U = Number(Dr(p));
+            const U = Number(Xr(p));
             m.push([A, U]);
           }
           y.push([S, m]);
@@ -12682,11 +12682,11 @@ function yg(e, t) {
           const m = [];
           let T = Number(xt(p));
           for (; T--; )
-            m.push(Number(Dr(p)));
+            m.push(Number(Xr(p)));
           const I = [];
           let A = Number(xt(p));
           for (; A--; )
-            I.push(Number(Dr(p)));
+            I.push(Number(Xr(p)));
           const U = [];
           let M = Number(xt(p));
           for (; M--; )
@@ -12713,7 +12713,7 @@ function yg(e, t) {
           let m = Number(xt(p));
           const T = [];
           for (; m--; ) {
-            const I = Number(xt(p)), A = new TextDecoder().decode(Ci(p, I)), U = Dr(p);
+            const I = Number(xt(p)), A = new TextDecoder().decode(Ci(p, I)), U = Xr(p);
             T.push([A, U]);
           }
           y.push([S, T]);
@@ -12725,7 +12725,7 @@ function yg(e, t) {
     }
     const w = [], E = Number(xt(p));
     for (let _ = 0; _ < E; _++)
-      w.push(Number(Dr(p)));
+      w.push(Number(Xr(p)));
     return [y, w];
   }
   const [o, c] = s(n);
@@ -12848,7 +12848,7 @@ function yg(e, t) {
     Bf();
   }
 }
-const gg = new fl(), wg = new ii(), y_ = new lg(), mg = new hg(), bg = new wo(), Eg = new dg(), _g = new ll(), Sg = new hl(), Tg = new dl(32), xg = new dl(64), Ag = new Fi(8), vg = new Fi(16), Bg = new Fi(32), Ig = new Fi(64), Og = new ei(8), Pg = new ei(16), kg = new ei(32), Ng = new ei(64), Ug = new pg();
+const gg = new fl(), wg = new si(), y_ = new lg(), mg = new hg(), bg = new wo(), Eg = new dg(), _g = new ll(), Sg = new hl(), Tg = new dl(32), xg = new dl(64), Ag = new Fi(8), vg = new Fi(16), Bg = new Fi(32), Ig = new Fi(64), Og = new ti(8), Pg = new ti(16), kg = new ti(32), Ng = new ti(64), Ug = new pg();
 function Rg(...e) {
   return new qa(e);
 }
@@ -12856,7 +12856,7 @@ function Cg(e) {
   return new Es(e);
 }
 function Hg(e) {
-  return new Er(e);
+  return new Sr(e);
 }
 function Fg(e) {
   return new Mi(e);
@@ -12927,30 +12927,30 @@ function g_(e, t) {
   return !0;
 }
 function Ou(e) {
-  return e instanceof Er || e instanceof wo || e instanceof ii;
+  return e instanceof Sr || e instanceof wo || e instanceof si;
 }
 function yl(e, t) {
-  const n = Cc.copy(), r = or(n, e, t);
+  const n = Cc.copy(), r = cr(n, e, t);
   return r ? Cc.add(e, t) : Cc.addNegative(e, t), r;
 }
-function or(e, t, n) {
+function cr(e, t, n) {
   if (t.name === n.name)
     return !0;
   const r = e.known(t, n);
   if (r !== void 0)
     return r;
-  if (e.add(t, n), n instanceof ii || t instanceof fl || t instanceof hl && n instanceof ll)
+  if (e.add(t, n), n instanceof si || t instanceof fl || t instanceof hl && n instanceof ll)
     return !0;
   if (t instanceof Es && n instanceof Es)
-    return or(e, t._type, n._type);
-  if (n instanceof Er)
+    return cr(e, t._type, n._type);
+  if (n instanceof Sr)
     return !0;
   if (t instanceof Mi && n instanceof Mi) {
     const i = t.fieldsAsObject;
     for (const [s, o] of n._fields) {
       const c = i[tn(s)];
       if (c) {
-        if (!or(e, c, o))
+        if (!cr(e, c, o))
           return !1;
       } else if (!Ou(o))
         return !1;
@@ -12963,7 +12963,7 @@ function or(e, t, n) {
     for (let i = 0; i < t.argTypes.length; i++) {
       const s = t.argTypes[i];
       if (i < n.argTypes.length) {
-        if (!or(e, n.argTypes[i], s))
+        if (!cr(e, n.argTypes[i], s))
           return !1;
       } else if (!Ou(s))
         return !1;
@@ -12971,7 +12971,7 @@ function or(e, t, n) {
     for (let i = 0; i < n.retTypes.length; i++) {
       const s = n.retTypes[i];
       if (i < t.retTypes.length) {
-        if (!or(e, t.retTypes[i], s))
+        if (!cr(e, t.retTypes[i], s))
           return !1;
       } else if (!Ou(s))
         return !1;
@@ -12982,7 +12982,7 @@ function or(e, t, n) {
     const i = n.alternativesAsObject;
     for (const [s, o] of t._fields) {
       const c = i[tn(s)];
-      if (!c || !or(e, o, c))
+      if (!c || !cr(e, o, c))
         return !1;
     }
     return !0;
@@ -12991,22 +12991,22 @@ function or(e, t, n) {
     const i = t.fieldsAsObject();
     for (const [s, o] of n._fields) {
       const c = i[s];
-      if (!c || !or(e, c, o))
+      if (!c || !cr(e, c, o))
         return !1;
     }
     return !0;
   }
-  return t instanceof xn ? or(e, t.getType(), n) : n instanceof xn ? or(e, t, n.getType()) : !1;
+  return t instanceof xn ? cr(e, t.getType(), n) : n instanceof xn ? cr(e, t, n.getType()) : !1;
 }
 const w_ = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   Bool: mg,
   BoolClass: hg,
-  ConstructType: oi,
+  ConstructType: ci,
   Empty: gg,
   EmptyClass: fl,
   FixedIntClass: Fi,
-  FixedNatClass: ei,
+  FixedNatClass: ti,
   Float32: Tg,
   Float64: xg,
   FloatClass: dl,
@@ -13027,7 +13027,7 @@ const w_ = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   Null: bg,
   NullClass: wo,
   Opt: Hg,
-  OptClass: Er,
+  OptClass: Sr,
   PrimitiveType: Bn,
   Principal: Ug,
   PrincipalClass: pg,
@@ -13036,7 +13036,7 @@ const w_ = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   Record: Fg,
   RecordClass: Mi,
   Reserved: wg,
-  ReservedClass: ii,
+  ReservedClass: si,
   Service: Lg,
   ServiceClass: ta,
   Text: Eg,
@@ -14808,10 +14808,10 @@ function zS(e) {
 function YS(e) {
   return e != null && "certificate" in e;
 }
-var _r;
+var Tr;
 (function(e) {
   e.Trust = "Trust", e.Protocol = "Protocol", e.Reject = "Reject", e.Transport = "Transport", e.External = "External", e.Limit = "Limit", e.Input = "Input", e.Unknown = "Unknown";
-})(_r || (_r = {}));
+})(Tr || (Tr = {}));
 class ke {
   constructor(t = !1) {
     this.isCertified = t;
@@ -14830,7 +14830,7 @@ Call context:
   HTTP details: ${JSON.stringify(this.callContext.httpDetails, null, 2)}`), t;
   }
 }
-class lr extends Error {
+class dr extends Error {
   get code() {
     return this.cause.code;
   }
@@ -14851,7 +14851,7 @@ class lr extends Error {
     return this.code.isCertified;
   }
   constructor(t, n) {
-    super(t.toString()), this.name = "AgentError", this.cause = { code: t, kind: n }, Object.setPrototypeOf(this, lr.prototype);
+    super(t.toString()), this.name = "AgentError", this.cause = { code: t, kind: n }, Object.setPrototypeOf(this, dr.prototype);
   }
   hasCode(t) {
     return this.code instanceof t;
@@ -14860,44 +14860,44 @@ class lr extends Error {
     return `${this.name} (${this.kind}): ${this.message}`;
   }
 }
-class $i extends lr {
+class $i extends dr {
   static fromCode(t) {
     return new this(t);
   }
 }
 class bn extends $i {
   constructor(t) {
-    super(t, _r.Trust), this.name = "TrustError", Object.setPrototypeOf(this, bn.prototype);
+    super(t, Tr.Trust), this.name = "TrustError", Object.setPrototypeOf(this, bn.prototype);
   }
 }
 class lt extends $i {
   constructor(t) {
-    super(t, _r.Protocol), this.name = "ProtocolError", Object.setPrototypeOf(this, lt.prototype);
+    super(t, Tr.Protocol), this.name = "ProtocolError", Object.setPrototypeOf(this, lt.prototype);
   }
 }
 class fs extends $i {
   constructor(t) {
-    super(t, _r.Reject), this.name = "RejectError", Object.setPrototypeOf(this, fs.prototype);
+    super(t, Tr.Reject), this.name = "RejectError", Object.setPrototypeOf(this, fs.prototype);
   }
 }
 class ia extends $i {
   constructor(t) {
-    super(t, _r.Transport), this.name = "TransportError", Object.setPrototypeOf(this, ia.prototype);
+    super(t, Tr.Transport), this.name = "TransportError", Object.setPrototypeOf(this, ia.prototype);
   }
 }
 class nn extends $i {
   constructor(t) {
-    super(t, _r.External), this.name = "ExternalError", Object.setPrototypeOf(this, nn.prototype);
+    super(t, Tr.External), this.name = "ExternalError", Object.setPrototypeOf(this, nn.prototype);
   }
 }
 class Ye extends $i {
   constructor(t) {
-    super(t, _r.Input), this.name = "InputError", Object.setPrototypeOf(this, Ye.prototype);
+    super(t, Tr.Input), this.name = "InputError", Object.setPrototypeOf(this, Ye.prototype);
   }
 }
 class rn extends $i {
   constructor(t) {
-    super(t, _r.Unknown), this.name = "UnknownError", Object.setPrototypeOf(this, rn.prototype);
+    super(t, Tr.Unknown), this.name = "UnknownError", Object.setPrototypeOf(this, rn.prototype);
   }
 }
 class ls extends ke {
@@ -14981,9 +14981,9 @@ class Sl extends ke {
     return `DER payload mismatch: Expected length ${this.expectedLength}, actual length: ${this.actualLength}`;
   }
 }
-class Sr extends ke {
+class xr extends ke {
   constructor(t) {
-    super(), this.error = t, this.name = "DerDecodeErrorCode", Object.setPrototypeOf(this, Sr.prototype);
+    super(), this.error = t, this.name = "DerDecodeErrorCode", Object.setPrototypeOf(this, xr.prototype);
   }
   toErrorMessage() {
     return `Failed to decode DER: ${this.error}`;
@@ -15109,9 +15109,9 @@ class uo extends ke {
     return this.error;
   }
 }
-class Ti extends ke {
+class xi extends ke {
   constructor() {
-    super(), this.name = "IdentityInvalidErrorCode", Object.setPrototypeOf(this, Ti.prototype);
+    super(), this.name = "IdentityInvalidErrorCode", Object.setPrototypeOf(this, xi.prototype);
   }
   toErrorMessage() {
     return "This identity has expired due this application's security policy. Please refresh your authentication.";
@@ -15847,7 +15847,7 @@ function U3(e, t) {
   return Vl(e, c, t), c;
 }
 function R3(e) {
-  const t = ci(e), n = U1(e), r = n(t, t.neg(t.ONE)), i = n(t, r), s = n(t, t.neg(r)), o = (e + k3) / k1;
+  const t = ai(e), n = U1(e), r = n(t, t.neg(t.ONE)), i = n(t, r), s = n(t, t.neg(r)), o = (e + k3) / k1;
   return (c, a) => {
     let u = c.pow(a, o), f = c.mul(u, r);
     const l = c.mul(u, i), p = c.mul(u, s), y = c.eql(c.sqr(f), a), g = c.eql(c.sqr(l), a);
@@ -15863,7 +15863,7 @@ function U1(e) {
   for (; t % Ii === on; )
     t /= Ii, n++;
   let r = Ii;
-  const i = ci(e);
+  const i = ai(e);
   for (; da(i, r) === 1; )
     if (r++ > 1e3)
       throw new Error("Cannot find square root: probably non-prime P");
@@ -15948,7 +15948,7 @@ function M3(e, t) {
   const n = t !== void 0 ? t : e.toString(2).length, r = Math.ceil(n / 8);
   return { nBitLength: n, nByteLength: r };
 }
-function ci(e, t, n = !1, r = {}) {
+function ai(e, t, n = !1, r = {}) {
   if (e <= on)
     throw new Error("invalid field: expected ORDER > 0, got " + e);
   let i, s, o = !1, c;
@@ -16043,7 +16043,7 @@ function pa(e, t) {
   const n = t.negate();
   return e ? n : t;
 }
-function dr(e, t) {
+function yr(e, t) {
   const n = Gi(e.Fp, t.map((r) => r.Z));
   return t.map((r, i) => e.fromAffine(r.toAffine(n[i])));
 }
@@ -16214,7 +16214,7 @@ function Rd(e, t, n) {
       throw new Error("Field.ORDER must match order: Fp == p, Fn == n");
     return R1(t), t;
   } else
-    return ci(e, { isLE: n });
+    return ai(e, { isLE: n });
 }
 function L1(e, t, n = {}, r) {
   if (r === void 0 && (r = e === "edwards"), !t || typeof t != "object")
@@ -16231,7 +16231,7 @@ function L1(e, t, n = {}, r) {
   return t = Object.freeze(Object.assign({}, t)), { CURVE: t, Fp: i, Fn: s };
 }
 const $3 = Yn;
-function Xr(e, t) {
+function zr(e, t) {
   if (Io(e), Io(t), e < 0 || e >= 1 << 8 * t)
     throw new Error("invalid I2OSP input: " + e);
   const n = Array.from({ length: t }).fill(0);
@@ -16259,10 +16259,10 @@ function W3(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 = Me(t, Xr(t.length, 1)), a = Xr(0, s), u = Xr(n, 2), f = new Array(o), l = r(Me(a, e, u, Xr(0, 1), c));
-  f[0] = r(Me(l, Xr(1, 1), c));
+  const c = Me(t, zr(t.length, 1)), a = zr(0, s), u = zr(n, 2), f = new Array(o), l = r(Me(a, e, u, zr(0, 1), c));
+  f[0] = r(Me(l, zr(1, 1), c));
   for (let y = 1; y <= o; y++) {
-    const g = [j3(l, f[y - 1]), Xr(y + 1, 1), c];
+    const g = [j3(l, f[y - 1]), zr(y + 1, 1), c];
     f[y] = r(Me(...g));
   }
   return Me(...f).slice(0, n);
@@ -16274,7 +16274,7 @@ function G3(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(Xr(n, 2)).update(t).update(Xr(t.length, 1)).digest();
+  return i.create({ dkLen: n }).update(e).update(zr(n, 2)).update(t).update(zr(t.length, 1)).digest();
 }
 function Lu(e, t, n) {
   nc(n, {
@@ -16354,7 +16354,7 @@ function Cd(e, t, n) {
   };
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Hd = (e, t) => (e + (e >= 0 ? t : -t) / cr) / t;
+const Hd = (e, t) => (e + (e >= 0 ? t : -t) / ar) / t;
 function X3(e, t, n) {
   const [[r, i], [s, o]] = t, c = Hd(o * e, n), a = Hd(-i * e, n);
   let u = e - c * r - a * s, f = -c * i - a * o;
@@ -16365,7 +16365,7 @@ function X3(e, t, n) {
     throw new Error("splitScalar (endomorphism): failed, k=" + e);
   return { k1neg: l, k1: u, k2neg: p, k2: f };
 }
-const Pi = BigInt(0), Dt = BigInt(1), cr = BigInt(2), os = BigInt(3), Mf = BigInt(4);
+const Pi = BigInt(0), Dt = BigInt(1), ar = BigInt(2), os = BigInt(3), Mf = BigInt(4);
 function ya(e, t) {
   const { BYTES: n } = e;
   let r;
@@ -16600,7 +16600,7 @@ function z3(e, t = {}) {
       if (!i.isValidNot0(H))
         throw new Error("invalid scalar: out of range");
       let N, $;
-      const F = (x) => V.cached(this, x, (O) => dr(v, O));
+      const F = (x) => V.cached(this, x, (O) => yr(v, O));
       if (K) {
         const { k1neg: x, k1: O, k2neg: q, k2: P } = I(H), { p: L, f: G } = F(O), { p: X, f: Y } = F(P);
         $ = G.add(Y), N = M(K.beta, L, X, x, q);
@@ -16608,7 +16608,7 @@ function z3(e, t = {}) {
         const { p: x, f: O } = F(H);
         N = x, $ = O;
       }
-      return dr(v, [N, $])[0];
+      return yr(v, [N, $])[0];
     }
     /**
      * Non-constant-time multiplication. Uses double-and-add algorithm.
@@ -16683,7 +16683,7 @@ function z3(e, t = {}) {
       this.precompute(H);
     }
     static normalizeZ(H) {
-      return dr(v, H);
+      return yr(v, H);
     }
     static msm(H, K) {
       return V1(v, i, H, K);
@@ -16702,9 +16702,9 @@ function Y3(e) {
 function Z3(e, t) {
   const n = e.ORDER;
   let r = Pi;
-  for (let g = n - Dt; g % cr === Pi; g /= cr)
+  for (let g = n - Dt; g % ar === Pi; g /= ar)
     r += Dt;
-  const i = r, s = cr << i - Dt - Dt, o = s * cr, c = (n - Dt) / o, a = (c - Dt) / cr, u = o - Dt, f = s, l = e.pow(t, c), p = e.pow(t, (c + Dt) / cr);
+  const i = r, s = ar << i - Dt - Dt, o = s * ar, c = (n - Dt) / o, a = (c - Dt) / ar, u = o - Dt, f = s, l = e.pow(t, c), p = e.pow(t, (c + Dt) / ar);
   let y = (g, w) => {
     let E = l, _ = e.pow(w, u), S = e.sqr(_);
     S = e.mul(S, w);
@@ -16715,8 +16715,8 @@ function Z3(e, t) {
     let I = e.eql(m, e.ONE);
     _ = e.mul(S, p), m = e.mul(T, E), S = e.cmov(_, S, I), T = e.cmov(m, T, I);
     for (let A = i; A > Dt; A--) {
-      let U = A - cr;
-      U = cr << U - Dt;
+      let U = A - ar;
+      U = ar << U - Dt;
       let M = e.pow(T, U);
       const v = e.eql(M, e.ONE);
       _ = e.mul(S, E), E = e.mul(E, E), M = e.mul(T, E), S = e.cmov(_, S, v), T = e.cmov(M, T, v);
@@ -16781,7 +16781,7 @@ function Q3(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 = ci(t.n, {
+  const i = ai(t.n, {
     BITS: e.nBitLength,
     allowedLengths: r,
     modFromBytes: e.wrapPrivateKey
@@ -16880,7 +16880,7 @@ function iT(e, t, n, r) {
   }
   function _(m, T = !0) {
     const I = [];
-    dr(t, m.map(({ g1: A }) => A)), dr(n, m.map(({ g2: A }) => A));
+    yr(t, m.map(({ g1: A }) => A)), yr(n, m.map(({ g2: A }) => A));
     for (const { g1: A, g2: U } of m) {
       if (A.is0() || U.is0())
         throw new Error("pairing is not available for ZERO point");
@@ -17086,12 +17086,12 @@ function sT(e) {
   };
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Vd = BigInt(0), pr = BigInt(1), zt = BigInt(2), Ld = BigInt(3);
+const Vd = BigInt(0), gr = BigInt(1), zt = BigInt(2), Ld = BigInt(3);
 function Ll(e, t, n, r, i = 1, s) {
   const o = BigInt(s === void 0 ? r : s), c = n ** BigInt(r), a = [];
   for (let u = 0; u < i; u++) {
     const f = BigInt(u + 1), l = [];
-    for (let p = 0, y = pr; p < r; p++) {
+    for (let p = 0, y = gr; p < r; p++) {
       const g = (f * y - f) / o % c;
       l.push(e.pow(t, g)), y *= n;
     }
@@ -17100,12 +17100,12 @@ function Ll(e, t, n, r, i = 1, s) {
   return a;
 }
 function oT(e, t, n) {
-  const r = t.pow(n, (e.ORDER - pr) / Ld), i = t.pow(n, (e.ORDER - pr) / zt);
+  const r = t.pow(n, (e.ORDER - gr) / Ld), i = t.pow(n, (e.ORDER - gr) / zt);
   function s(p, y) {
     const g = t.mul(t.frobeniusMap(p, 1), r), w = t.mul(t.frobeniusMap(y, 1), i);
     return [g, w];
   }
-  const o = t.pow(n, (e.ORDER ** zt - pr) / Ld), c = t.pow(n, (e.ORDER ** zt - pr) / zt);
+  const o = t.pow(n, (e.ORDER ** zt - gr) / Ld), c = t.pow(n, (e.ORDER ** zt - gr) / zt);
   if (!t.eql(c, t.neg(t.ONE)))
     throw new Error("psiFrobenius: PSI2_Y!==-1");
   function a(p, y) {
@@ -17125,7 +17125,7 @@ const Kd = (e, t) => {
 };
 class cT {
   constructor(t, n = {}) {
-    this.MASK = pr;
+    this.MASK = gr;
     const r = t.ORDER, i = r * r;
     this.Fp = t, this.ORDER = i, this.BITS = vo(i), this.BYTES = Math.ceil(vo(i) / 8), this.isLE = t.isLE, this.ZERO = { c0: t.ZERO, c1: t.ZERO }, this.ONE = { c0: t.ONE, c1: t.ZERO }, this.Fp_NONRESIDUE = t.create(n.NONRESIDUE || BigInt(-1)), this.Fp_div2 = t.div(t.ONE, zt), this.NONRESIDUE = Kd(t, n.FP2_NONRESIDUE), this.FROBENIUS_COEFFICIENTS = Ll(t, this.Fp_NONRESIDUE, t.ORDER, 2)[0], this.mulByB = n.Fp2mulByB, Object.seal(this);
   }
@@ -17224,7 +17224,7 @@ class cT {
   // Same as sgn0_m_eq_2 in RFC 9380
   isOdd(t) {
     const { re: n, im: r } = this.reim(t), i = n % zt, s = n === Vd, o = r % zt;
-    return BigInt(i || s && o) == pr;
+    return BigInt(i || s && o) == gr;
   }
   // Bytes util
   fromBytes(t) {
@@ -17267,7 +17267,7 @@ class cT {
 }
 class aT {
   constructor(t) {
-    this.MASK = pr, this.Fp2 = t, this.ORDER = t.ORDER, this.BITS = 3 * t.BITS, this.BYTES = 3 * t.BYTES, this.isLE = t.isLE, this.ZERO = { c0: t.ZERO, c1: t.ZERO, c2: t.ZERO }, this.ONE = { c0: t.ONE, c1: t.ZERO, c2: t.ZERO };
+    this.MASK = gr, this.Fp2 = t, this.ORDER = t.ORDER, this.BITS = 3 * t.BITS, this.BYTES = 3 * t.BYTES, this.isLE = t.isLE, this.ZERO = { c0: t.ZERO, c1: t.ZERO, c2: t.ZERO }, this.ONE = { c0: t.ONE, c1: t.ZERO, c2: t.ZERO };
     const { Fp: n } = t, r = Ll(t, t.NONRESIDUE, n.ORDER, 6, 2, 3);
     this.FROBENIUS_COEFFICIENTS_1 = r[0], this.FROBENIUS_COEFFICIENTS_2 = r[1], Object.seal(this);
   }
@@ -17449,7 +17449,7 @@ class aT {
 }
 class uT {
   constructor(t, n) {
-    this.MASK = pr;
+    this.MASK = gr;
     const { Fp2: r } = t, { Fp: i } = r;
     this.Fp6 = t, this.ORDER = r.ORDER, this.BITS = 2 * t.BITS, this.BYTES = 2 * t.BYTES, this.isLE = t.isLE, this.ZERO = { c0: t.ZERO, c1: t.ZERO }, this.ONE = { c0: t.ONE, c1: t.ZERO }, this.FROBENIUS_COEFFICIENTS = Ll(r, r.NONRESIDUE, i.ORDER, 12, 1, 6)[0], this.X_LEN = n.X_LEN, this.finalExponentiate = n.Fp12finalExponentiate;
   }
@@ -17655,11 +17655,11 @@ class uT {
   }
 }
 function fT(e) {
-  const t = ci(e.ORDER), n = new cT(t, e), r = new aT(n), i = new uT(r, e);
+  const t = ai(e.ORDER), n = new cT(t, e), r = new aT(n), i = new uT(r, e);
   return { Fp: t, Fp2: n, Fp6: r, Fp12: i };
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Mt = BigInt(0), ga = BigInt(1), An = BigInt(2), eu = BigInt(3), Oo = BigInt(4), zr = BigInt("0xd201000000010000"), lT = vo(zr), Vi = {
+const Mt = BigInt(0), ga = BigInt(1), An = BigInt(2), eu = BigInt(3), Oo = BigInt(4), Yr = BigInt("0xd201000000010000"), lT = vo(Yr), Vi = {
   p: BigInt("0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab"),
   n: BigInt("0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001"),
   h: BigInt("0x396c8c005555e1568c00aaab0000aaab"),
@@ -17667,7 +17667,7 @@ const Mt = BigInt(0), ga = BigInt(1), An = BigInt(2), eu = BigInt(3), Oo = BigIn
   b: Oo,
   Gx: BigInt("0x17f1d3a73197d7942695638c4fa9ac0fc3688c4f9774b905a14e3a3f171bac586c55e83ff97a1aeffb3af00adb22c6bb"),
   Gy: BigInt("0x08b3f481e3aaa0f1a09e30ed741d8ae4fcf5e095d5d00af600db18cb2c04b3edd03cc744a2888ae40caa232946c5e7e1")
-}, hT = ci(Vi.n, {
+}, hT = ai(Vi.n, {
   modFromBytes: !0,
   isLE: !0
 }), { Fp: me, Fp2: Pe, Fp6: dT, Fp12: Re } = fT({
@@ -17681,7 +17681,7 @@ const Mt = BigInt(0), ga = BigInt(1), An = BigInt(2), eu = BigInt(3), Oo = BigIn
     return { c0: me.sub(n, r), c1: me.add(n, r) };
   },
   Fp12finalExponentiate: (e) => {
-    const t = zr, n = Re.div(Re.frobeniusMap(e, 6), e), r = Re.mul(Re.frobeniusMap(n, 2), n), i = Re.conjugate(Re._cyclotomicExp(r, t)), s = Re.mul(Re.conjugate(Re._cyclotomicSquare(r)), i), o = Re.conjugate(Re._cyclotomicExp(s, t)), c = Re.conjugate(Re._cyclotomicExp(o, t)), a = Re.mul(Re.conjugate(Re._cyclotomicExp(c, t)), Re._cyclotomicSquare(i)), u = Re.conjugate(Re._cyclotomicExp(a, t)), f = Re.frobeniusMap(Re.mul(i, c), 2), l = Re.frobeniusMap(Re.mul(o, r), 3), p = Re.frobeniusMap(Re.mul(a, Re.conjugate(r)), 1), y = Re.mul(Re.mul(u, Re.conjugate(s)), r);
+    const t = Yr, n = Re.div(Re.frobeniusMap(e, 6), e), r = Re.mul(Re.frobeniusMap(n, 2), n), i = Re.conjugate(Re._cyclotomicExp(r, t)), s = Re.mul(Re.conjugate(Re._cyclotomicSquare(r)), i), o = Re.conjugate(Re._cyclotomicExp(s, t)), c = Re.conjugate(Re._cyclotomicExp(o, t)), a = Re.mul(Re.conjugate(Re._cyclotomicExp(c, t)), Re._cyclotomicSquare(i)), u = Re.conjugate(Re._cyclotomicExp(a, t)), f = Re.frobeniusMap(Re.mul(i, c), 2), l = Re.frobeniusMap(Re.mul(o, r), 3), p = Re.frobeniusMap(Re.mul(a, Re.conjugate(r)), 1), y = Re.mul(Re.mul(u, Re.conjugate(s)), r);
     return Re.mul(Re.mul(Re.mul(f, l), p), y);
   }
 }), { G2psi: $d, G2psi2: pT } = oT(me, Pe, Pe.div(Pe.ONE, Pe.NONRESIDUE)), $u = Object.freeze({
@@ -17861,11 +17861,11 @@ const ru = sT({
     // https://eprint.iacr.org/2021/1130.pdf
     isTorsionFree: (e, t) => {
       const n = BigInt("0x5f19672fdf76ce51ba69c6076a0f77eaddb3a93be6f89688de17d813620a00022e01fffffffefffe"), r = new e(me.mul(t.X, n), t.Y, t.Z);
-      return t.multiplyUnsafe(zr).negate().multiplyUnsafe(zr).equals(r);
+      return t.multiplyUnsafe(Yr).negate().multiplyUnsafe(Yr).equals(r);
     },
     // Clear cofactor of G1
     // https://eprint.iacr.org/2019/403
-    clearCofactor: (e, t) => t.multiplyUnsafe(zr).add(t),
+    clearCofactor: (e, t) => t.multiplyUnsafe(Yr).add(t),
     mapToCurve: TT,
     fromBytes: gT,
     toBytes: yT,
@@ -17902,13 +17902,13 @@ const ru = sT({
     // 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(zr).negate().equals($d(e, t)),
+    isTorsionFree: (e, t) => t.multiplyUnsafe(Yr).negate().equals($d(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 = zr;
+      const n = Yr;
       let r = t.multiplyUnsafe(n).negate(), i = $d(e, t), s = t.double();
       return s = pT(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);
     },
@@ -17933,7 +17933,7 @@ const ru = sT({
     }
   },
   params: {
-    ateLoopSize: zr,
+    ateLoopSize: Yr,
     // The BLS parameter x for BLS12-381
     r: Vi.n,
     // order; z⁴ − z² + 1; CURVE.n from other curves
@@ -18471,7 +18471,7 @@ const Dd = async (e) => {
                 }
           }
       } catch (l) {
-        if (l instanceof lr && (l.hasCode(ls) || l.hasCode(Eo)))
+        if (l instanceof dr && (l.hasCode(ls) || l.hasCode(Eo)))
           throw l;
         typeof a != "string" && "key" in a && "path" in a ? o.set(a.key, null) : o.set(a, null), console.group(), console.warn(`Expected to find result for path ${a}, but instead found nothing.`), console.warn(l), console.groupEnd();
       }
@@ -18538,7 +18538,7 @@ const Dd = async (e) => {
   throw rn.fromCode(new Un(`Error while encoding your path for canister status. Please ensure that your path ${e} was formatted correctly.`));
 }, MT = (e) => Dn(e).map((n) => Le.fromUint8Array(n));
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const kr = BigInt(0), Tt = BigInt(1), Gu = BigInt(2), qT = BigInt(8);
+const Ur = BigInt(0), Tt = BigInt(1), Gu = BigInt(2), qT = BigInt(8);
 function VT(e, t, n, r) {
   const i = e.sqr(n), s = e.sqr(r), o = e.add(e.mul(t.a, i), s), c = e.add(e.ONE, e.mul(t.d, e.mul(i, s)));
   return e.eql(o, c);
@@ -18552,13 +18552,13 @@ function LT(e, t = {}) {
     try {
       return { isValid: !0, value: r.sqrt(r.div(E, _)) };
     } catch {
-      return { isValid: !1, value: kr };
+      return { isValid: !1, value: Ur };
     }
   });
   if (!VT(r, s, s.Gx, s.Gy))
     throw new Error("bad curve params: generator point");
   function f(E, _, S = !1) {
-    const m = S ? Tt : kr;
+    const m = S ? Tt : Ur;
     return Pd("coordinate " + E, _, m, c), _;
   }
   function l(E) {
@@ -18570,7 +18570,7 @@ function LT(e, t = {}) {
     _ == null && (_ = I ? qT : r.inv(T));
     const A = a(S * _), U = a(m * _), M = r.mul(T, _);
     if (I)
-      return { x: kr, y: Tt };
+      return { x: Ur, y: Tt };
     if (M !== Tt)
       throw new Error("invZ was invalid");
     return { x: A, y: U };
@@ -18606,13 +18606,13 @@ function LT(e, t = {}) {
       const A = Od(_), U = _[m - 1];
       A[m - 1] = U & -129;
       const M = Ao(A), v = S ? c : r.ORDER;
-      Pd("point.y", M, kr, v);
+      Pd("point.y", M, Ur, v);
       const R = a(M * M), V = a(R - Tt), W = a(I * R - T);
       let { isValid: H, value: K } = u(V, W);
       if (!H)
         throw new Error("bad point: invalid y coordinate");
       const N = (K & Tt) === Tt, $ = (U & 128) !== 0;
-      if (!S && K === kr && $)
+      if (!S && K === Ur && $)
         throw new Error("bad point: x=0 and x_0=1");
       return $ !== N && (K = a(-K)), g.fromAffine({ x: K, y: M });
     }
@@ -18666,8 +18666,8 @@ function LT(e, t = {}) {
     multiply(_) {
       if (!i.isValidNot0(_))
         throw new Error("invalid scalar: expected 1 <= sc < curve.n");
-      const { p: S, f: m } = w.cached(this, _, (T) => dr(g, T));
-      return dr(g, [S, m])[0];
+      const { p: S, f: m } = w.cached(this, _, (T) => yr(g, T));
+      return yr(g, [S, m])[0];
     }
     // Non-constant-time multiplication. Uses double-and-add algorithm.
     // It's faster, but should only be used when you don't care about
@@ -18677,7 +18677,7 @@ function LT(e, t = {}) {
     multiplyUnsafe(_, S = g.ZERO) {
       if (!i.isValid(_))
         throw new Error("invalid scalar: expected 0 <= sc < curve.n");
-      return _ === kr ? g.ZERO : this.is0() || _ === Tt ? this : w.unsafe(this, _, (m) => dr(g, m), S);
+      return _ === Ur ? g.ZERO : this.is0() || _ === Tt ? this : w.unsafe(this, _, (m) => yr(g, m), S);
     }
     // Checks if point is of small order.
     // If you add something to small order point, you will have "dirty"
@@ -18723,7 +18723,7 @@ function LT(e, t = {}) {
       return this.T;
     }
     static normalizeZ(_) {
-      return dr(g, _);
+      return yr(g, _);
     }
     static msm(_, S) {
       return V1(g, i, _, S);
@@ -18735,7 +18735,7 @@ function LT(e, t = {}) {
       return this.toBytes();
     }
   }
-  g.BASE = new g(s.Gx, s.Gy, Tt, a(s.Gx * s.Gy)), g.ZERO = new g(kr, Tt, Tt, kr), g.Fp = r, g.Fn = i;
+  g.BASE = new g(s.Gx, s.Gy, Tt, a(s.Gx * s.Gy)), g.ZERO = new g(Ur, Tt, Tt, Ur), g.Fp = r, g.Fn = i;
   const w = new q1(g, i.BITS);
   return g.BASE.precompute(8), g;
 }
@@ -18874,7 +18874,7 @@ function $T(e) {
     h: e.h,
     Gx: e.Gx,
     Gy: e.Gy
-  }, n = e.Fp, r = ci(t.n, e.nBitLength, !0), i = { Fp: n, Fn: r, uvRatio: e.uvRatio }, s = {
+  }, n = e.Fp, r = ai(t.n, e.nBitLength, !0), i = { Fp: n, Fn: r, uvRatio: e.uvRatio }, s = {
     randomBytes: e.randomBytes,
     adjustScalarBytes: e.adjustScalarBytes,
     domain: e.domain,
@@ -18922,7 +18922,7 @@ function ZT(e, t) {
   const c = dt(t * o * o, n), a = o, u = dt(o * zd, n), f = c === e, l = c === dt(-e, n), p = c === dt(-e * zd, n);
   return f && (o = a), (l || p) && (o = u), H3(o, n) && (o = dt(-o, n)), { isValid: f || l, value: o };
 }
-const JT = ci(X1.p, { isLE: !0 }), QT = {
+const JT = ai(X1.p, { isLE: !0 }), QT = {
   ...X1,
   Fp: JT,
   hash: Zm,
@@ -19080,14 +19080,14 @@ const Jd = (e) => {
   if (e[t] < 128)
     return 1;
   if (e[t] === 128)
-    throw Ye.fromCode(new Sr("Invalid length 0"));
+    throw Ye.fromCode(new xr("Invalid length 0"));
   if (e[t] === 129)
     return 2;
   if (e[t] === 130)
     return 3;
   if (e[t] === 131)
     return 4;
-  throw Ye.fromCode(new Sr("Length too long (> 4 bytes)"));
+  throw Ye.fromCode(new xr("Length too long (> 4 bytes)"));
 }, n8 = (e, t) => {
   const n = Vf(e, t);
   if (n === 1)
@@ -19098,7 +19098,7 @@ const Jd = (e) => {
     return (e[t + 1] << 8) + e[t + 2];
   if (n === 4)
     return (e[t + 1] << 16) + (e[t + 2] << 8) + e[t + 3];
-  throw Ye.fromCode(new Sr("Length too long (> 4 bytes)"));
+  throw Ye.fromCode(new xr("Length too long (> 4 bytes)"));
 };
 Uint8Array.from([
   48,
@@ -19191,10 +19191,10 @@ const i8 = (e, t) => {
   let n = 0;
   const r = (c, a) => {
     if (i[n++] !== c)
-      throw Ye.fromCode(new Sr(`Expected ${a} at offset ${n}`));
+      throw Ye.fromCode(new xr(`Expected ${a} at offset ${n}`));
   }, i = new Uint8Array(e);
   if (r(48, "sequence"), n += Vf(i, n), !Ja(i.slice(n, n + t.byteLength), t))
-    throw Ye.fromCode(new Sr("Not the expected OID."));
+    throw Ye.fromCode(new xr("Not the expected OID."));
   n += t.byteLength, r(3, "bit string");
   const s = n8(i, n) - 1;
   n += Vf(i, n), r(0, "0 padding");
@@ -19210,7 +19210,7 @@ const Ai = class Ai {
     Jt(this, ko);
     Jt(this, No);
     if (t.byteLength !== Ai.RAW_KEY_LENGTH)
-      throw Ye.fromCode(new Sr("An Ed25519 public key must be exactly 32 bytes long"));
+      throw Ye.fromCode(new xr("An Ed25519 public key must be exactly 32 bytes long"));
     $t(this, ko, t), $t(this, No, Ai.derEncode(t));
   }
   static from(t) {
@@ -19228,7 +19228,7 @@ const Ai = class Ai {
   static derDecode(t) {
     const n = i8(t, e0);
     if (n.length !== this.RAW_KEY_LENGTH)
-      throw Ye.fromCode(new Sr("An Ed25519 public key must be exactly 32 bytes long"));
+      throw Ye.fromCode(new xr("An Ed25519 public key must be exactly 32 bytes long"));
     return n;
   }
   get rawKey() {
@@ -19321,10 +19321,10 @@ Pn = new WeakMap(), Uo = new WeakMap(), Ro = new WeakMap(), Co = new WeakMap(),
   date: Date
 };
 let Kf = xa;
-var fr;
+var lr;
 (function(e) {
   e.Received = "received", e.Processing = "processing", e.Replied = "replied", e.Rejected = "rejected", e.Unknown = "unknown", e.Done = "done";
-})(fr || (fr = {}));
+})(lr || (lr = {}));
 const $f = 60 * 1e3, c8 = 1e6, a8 = 0, u8 = "308182301d060d2b0601040182dc7c0503010201060c2b0601040182dc7c05030201036100814c0e6ec71fab583b08bd81373c255c3c371b2e84863c98a4f1e08b74235d14fb5d9c0cd546d9685f913a0c0b2cc5341583bf4b4392e467db96d65b9bb4cb717112f8472e0d5a4d14505ffd7484b01291091c5f87b98883463f98091a0baaae", f8 = "ic0.app", l8 = ".ic0.app", h8 = "icp0.io", d8 = ".icp0.io", p8 = "icp-api.io", y8 = ".icp-api.io", Du = 200, g8 = 202, w8 = 404;
 function m8() {
   let e;
@@ -19354,7 +19354,7 @@ function b8(e) {
   }
   return t.toString();
 }
-class yr {
+class wr {
   #t;
   #e;
   #i;
@@ -19442,12 +19442,12 @@ class yr {
     return new this({ ...t });
   }
   static async create(t = {}) {
-    const n = yr.createSync(t);
+    const n = wr.createSync(t);
     return await n.#y(), n;
   }
   static async from(t) {
     try {
-      return "config" in t ? await yr.create(t.config) : await yr.create({
+      return "config" in t ? await wr.create(t.config) : await wr.create({
         fetch: t._fetch,
         fetchOptions: t._fetchOptions,
         callOptions: t._callOptions,
@@ -19473,7 +19473,7 @@ class yr {
   }
   async getPrincipal() {
     if (!this.#n)
-      throw nn.fromCode(new Ti());
+      throw nn.fromCode(new xi());
     return (await this.#n).getPrincipal();
   }
   /**
@@ -19491,7 +19491,7 @@ class yr {
   async call(t, n, r) {
     const i = n.callSync ?? !0, s = await (r ?? this.#n);
     if (!s)
-      throw nn.fromCode(new Ti());
+      throw nn.fromCode(new xi());
     const o = Le.from(t), c = n.effectiveCanisterId ? Le.from(n.effectiveCanisterId) : o;
     await this.#y(c);
     const a = s.getPrincipal(), u = Xu(this.#o, this.#i), f = {
@@ -19544,7 +19544,7 @@ class yr {
       };
     } catch (_) {
       let S;
-      if (_ instanceof lr) {
+      if (_ instanceof dr) {
         if (_.hasCode(oa))
           return this.log.warn("v3 api not supported. Fall back to v2"), this.call(t, {
             ...n,
@@ -19599,7 +19599,7 @@ class yr {
         return this.log.warn(`Caught exception while attempting to make query:
   ${y}
   Retrying query.`), await this.#E({ ...t, tries: c + 1 });
-      throw y instanceof lr ? y : ia.fromCode(new ca(y));
+      throw y instanceof dr ? y : ia.fromCode(new ca(y));
     }
     if (!this.#d)
       return u;
@@ -19668,7 +19668,7 @@ class yr {
     let o;
     const c = await (r ?? this.#n);
     if (!c)
-      throw nn.fromCode(new Ti());
+      throw nn.fromCode(new xi());
     const a = Le.from(t), u = c.getPrincipal(), f = Xu(this.#o, this.#i), l = {
       request_type: To.Query,
       canister_id: a,
@@ -19725,7 +19725,7 @@ class yr {
       }
     } catch (_) {
       let S;
-      throw _ instanceof lr ? (_.code.requestContext = {
+      throw _ instanceof dr ? (_.code.requestContext = {
         requestId: p,
         senderPubKey: o.body.sender_pubkey,
         senderSignature: o.body.sender_sig,
@@ -19744,7 +19744,7 @@ class yr {
     await this.#y();
     const r = await (n ?? this.#n);
     if (!r)
-      throw nn.fromCode(new Ti());
+      throw nn.fromCode(new xi());
     const i = r.getPrincipal(), s = await this._transform({
       request: {
         method: "POST",
@@ -19780,7 +19780,7 @@ class yr {
       a = o(n);
       const f = await this.#n;
       if (!f)
-        throw nn.fromCode(new Ti());
+        throw nn.fromCode(new xi());
       c = await this.createReadStateRequest(n, f);
     }
     this.log.print(`fetching "/api/v2/canister/${s}/read_state" with request:`, c);
@@ -19798,7 +19798,7 @@ class yr {
       return this.log.print("Read state response:", l), l;
     } catch (f) {
       let l;
-      throw f instanceof lr ? (f.code.requestContext = {
+      throw f instanceof dr ? (f.code.requestContext = {
         requestId: a,
         senderPubKey: c.body.sender_pubkey,
         senderSignature: c.body.sender_sig,
@@ -19835,7 +19835,7 @@ class yr {
       const n = Date.now();
       try {
         t || this.log.print("Syncing time with the IC. No canisterId provided, so falling back to ryjl3-tyaaa-aaaaa-aaaba-cai");
-        const r = t ?? Le.from("ryjl3-tyaaa-aaaaa-aaaba-cai"), i = yr.createSync({
+        const r = t ?? Le.from("ryjl3-tyaaa-aaaaa-aaaba-cai"), i = wr.createSync({
           identity: new vd(),
           host: this.host.toString(),
           fetch: this.#s,
@@ -19858,7 +19858,7 @@ class yr {
           level: "info"
         }));
       } catch (r) {
-        const i = r instanceof lr ? r : rn.fromCode(new Un(r));
+        const i = r instanceof dr ? r : rn.fromCode(new Un(r));
         throw this.log.error("Caught exception while attempting to sync time", i), i;
       }
     })(), await this.#a.finally(() => {
@@ -20010,15 +20010,15 @@ async function Y1(e, t, n, r = {}) {
     agent: e
   }), u = yn(a.lookup_path([...i, ut("status")]));
   let f;
-  switch (typeof u > "u" ? f = fr.Unknown : f = new TextDecoder().decode(u), f) {
-    case fr.Replied:
+  switch (typeof u > "u" ? f = lr.Unknown : f = new TextDecoder().decode(u), f) {
+    case lr.Replied:
       return {
         reply: yn(a.lookup_path([...i, "reply"])),
         certificate: a
       };
-    case fr.Received:
-    case fr.Unknown:
-    case fr.Processing: {
+    case lr.Received:
+    case lr.Unknown:
+    case lr.Processing: {
       const l = r.strategy ?? _8();
       return await l(t, n, f), Y1(e, t, n, {
         ...r,
@@ -20027,11 +20027,11 @@ async function Y1(e, t, n, r = {}) {
         request: o
       });
     }
-    case fr.Rejected: {
+    case lr.Rejected: {
       const l = new Uint8Array(yn(a.lookup_path([...i, "reject_code"])))[0], p = new TextDecoder().decode(yn(a.lookup_path([...i, "reject_message"]))), y = yn(a.lookup_path([...i, "error_code"])), g = y ? new TextDecoder().decode(y) : void 0;
       throw fs.fromCode(new Za(n, l, p, g));
     }
-    case fr.Done:
+    case lr.Done:
       throw rn.fromCode(new Il(n));
   }
   throw hs;
@@ -20142,7 +20142,7 @@ function P8(e, t, n, r) {
         ...o
       })
     };
-    const a = o.agent || e[mn].config.agent || new yr(), u = Le.from(o.canisterId || e[mn].config.canisterId), f = vf(n.argTypes, c), l = await a.query(u, {
+    const a = o.agent || e[mn].config.agent || new wr(), u = Le.from(o.canisterId || e[mn].config.canisterId), f = vf(n.argTypes, c), l = await a.query(u, {
       methodName: t,
       arg: f,
       effectiveCanisterId: o.effectiveCanisterId
@@ -20173,7 +20173,7 @@ function P8(e, t, n, r) {
         ...o
       })
     };
-    const a = o.agent || e[mn].config.agent || yr.createSync(), { canisterId: u, effectiveCanisterId: f, pollingOptions: l } = {
+    const a = o.agent || e[mn].config.agent || wr.createSync(), { canisterId: u, effectiveCanisterId: f, pollingOptions: l } = {
       ...Z1,
       ...e[mn].config,
       ...o
@@ -20258,7 +20258,7 @@ const Gt = {
   P2TR: { P2TR: null },
   UNKNOWN: { UNKNOWN: null }
 };
-var hi = {}, je = {}, Yu = {}, jt = {}, tr = {}, a0;
+var di = {}, je = {}, Yu = {}, jt = {}, tr = {}, a0;
 function Vn() {
   return a0 || (a0 = 1, Object.defineProperty(tr, "__esModule", { value: !0 }), tr.testnet = tr.regtest = tr.bitcoin = void 0, tr.bitcoin = {
     /**
@@ -20374,10 +20374,10 @@ function Q1() {
   }
   return nr.encode = n, nr;
 }
-var di = {}, f0;
+var pi = {}, f0;
 function Gl() {
-  if (f0) return di;
-  f0 = 1, Object.defineProperty(di, "__esModule", { value: !0 }), di.REVERSE_OPS = di.OPS = void 0;
+  if (f0) return pi;
+  f0 = 1, Object.defineProperty(pi, "__esModule", { value: !0 }), pi.REVERSE_OPS = pi.OPS = void 0;
   const e = {
     OP_FALSE: 0,
     OP_0: 0,
@@ -20499,14 +20499,14 @@ function Gl() {
     OP_PUBKEY: 254,
     OP_INVALIDOPCODE: 255
   };
-  di.OPS = e;
+  pi.OPS = e;
   const t = {};
-  di.REVERSE_OPS = t;
+  pi.REVERSE_OPS = t;
   for (const n of Object.keys(e)) {
     const r = e[n];
     t[r] = n;
   }
-  return di;
+  return pi;
 }
 var rr = {}, l0;
 function k8() {
@@ -20546,10 +20546,10 @@ function k8() {
   }
   return rr.decode = r, rr;
 }
-var pi = {}, h0;
+var yi = {}, h0;
 function N8() {
-  if (h0) return pi;
-  h0 = 1, Object.defineProperty(pi, "__esModule", { value: !0 }), pi.encode = pi.decode = void 0;
+  if (h0) return yi;
+  h0 = 1, Object.defineProperty(yi, "__esModule", { value: !0 }), yi.encode = yi.decode = void 0;
   function e(r, i, s) {
     i = i || 4, s = s === void 0 ? !0 : s;
     const o = r.length;
@@ -20566,7 +20566,7 @@ function N8() {
       c |= r[a] << 8 * a;
     return r[o - 1] & 128 ? -(c & ~(128 << 8 * (o - 1))) : c;
   }
-  pi.decode = e;
+  yi.decode = e;
   function t(r) {
     return r > 2147483647 ? 5 : r > 8388607 ? 4 : r > 32767 ? 3 : r > 127 ? 2 : r > 0 ? 1 : 0;
   }
@@ -20577,9 +20577,9 @@ function N8() {
       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 pi.encode = n, pi;
+  return yi.encode = n, yi;
 }
-var yi = {}, Qu = {}, ef, d0;
+var gi = {}, Qu = {}, ef, d0;
 function Dl() {
   if (d0) return ef;
   d0 = 1;
@@ -20977,8 +20977,8 @@ function Kt() {
 }
 var m0;
 function C8() {
-  if (m0) return yi;
-  m0 = 1, Object.defineProperty(yi, "__esModule", { value: !0 }), yi.encode = yi.decode = void 0;
+  if (m0) return gi;
+  m0 = 1, Object.defineProperty(gi, "__esModule", { value: !0 }), gi.encode = gi.decode = void 0;
   const e = Q1(), t = Zt(), n = Kt(), { typeforce: r } = n, i = Buffer.alloc(1, 0);
   function s(u) {
     let f = 0;
@@ -20997,7 +20997,7 @@ function C8() {
     const l = e.decode(u.slice(0, -1)), p = o(l.r), y = o(l.s);
     return { signature: Buffer.concat([p, y], 64), hashType: f };
   }
-  yi.decode = c;
+  gi.decode = c;
   function a(u, f) {
     if (r(
       {
@@ -21012,7 +21012,7 @@ function C8() {
     const p = s(u.slice(0, 32)), y = s(u.slice(32, 64));
     return Buffer.concat([e.encode(p, y), l]);
   }
-  return yi.encode = a, yi;
+  return gi.encode = a, gi;
 }
 var b0;
 function Zt() {
@@ -21133,10 +21133,10 @@ function Zt() {
     e.isCanonicalScriptSignature = M, e.number = i, e.signature = s;
   })(Ju)), Ju;
 }
-var gi = {}, E0;
-function ai() {
-  if (E0) return gi;
-  E0 = 1, Object.defineProperty(gi, "__esModule", { value: !0 }), gi.value = gi.prop = void 0;
+var wi = {}, E0;
+function ui() {
+  if (E0) return wi;
+  E0 = 1, Object.defineProperty(wi, "__esModule", { value: !0 }), wi.value = wi.prop = void 0;
   function e(n, r, i) {
     Object.defineProperty(n, r, {
       configurable: !0,
@@ -21155,18 +21155,18 @@ function ai() {
       }
     });
   }
-  gi.prop = e;
+  wi.prop = e;
   function t(n) {
     let r;
     return () => (r !== void 0 || (r = n()), r);
   }
-  return gi.value = t, gi;
+  return wi.value = t, wi;
 }
 var _0;
 function H8() {
   if (_0) return Gs;
   _0 = 1, Object.defineProperty(Gs, "__esModule", { value: !0 }), Gs.p2data = void 0;
-  const e = Vn(), t = Zt(), n = Kt(), r = ai(), i = t.OPS;
+  const e = Vn(), t = Zt(), n = Kt(), r = ui(), 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)(
@@ -21202,7 +21202,7 @@ var Ds = {}, S0;
 function F8() {
   if (S0) return Ds;
   S0 = 1, Object.defineProperty(Ds, "__esModule", { value: !0 }), Ds.p2ms = void 0;
-  const e = Vn(), t = Zt(), n = Kt(), r = ai(), i = t.OPS, s = i.OP_RESERVED;
+  const e = Vn(), t = Zt(), n = Kt(), r = ui(), 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");
@@ -21308,7 +21308,7 @@ var Xs = {}, T0;
 function M8() {
   if (T0) return Xs;
   T0 = 1, Object.defineProperty(Xs, "__esModule", { value: !0 }), Xs.p2pk = void 0;
-  const e = Vn(), t = Zt(), n = Kt(), r = ai(), i = t.OPS;
+  const e = Vn(), t = Zt(), n = Kt(), r = ui(), i = t.OPS;
   function s(o, c) {
     if (!o.input && !o.output && !o.pubkey && !o.input && !o.signature)
       throw new TypeError("Not enough data");
@@ -21359,11 +21359,11 @@ function M8() {
   }
   return Xs.p2pk = s, Xs;
 }
-var zs = {}, sf = {}, wi = {}, Wt = {}, x0;
+var zs = {}, sf = {}, mi = {}, Wt = {}, x0;
 function tw() {
   if (x0) return Wt;
   x0 = 1, Object.defineProperty(Wt, "__esModule", { value: !0 }), Wt.ripemd160 = Wt.RIPEMD160 = Wt.md5 = Wt.MD5 = Wt.sha1 = Wt.SHA1 = void 0;
-  const e = /* @__PURE__ */ Lp(), t = /* @__PURE__ */ ti(), n = /* @__PURE__ */ Uint32Array.from([
+  const e = /* @__PURE__ */ Lp(), t = /* @__PURE__ */ ni(), n = /* @__PURE__ */ Uint32Array.from([
     1732584193,
     4023233417,
     2562383102,
@@ -21518,17 +21518,17 @@ function tw() {
 }
 var A0;
 function q8() {
-  if (A0) return wi;
-  A0 = 1, Object.defineProperty(wi, "__esModule", { value: !0 }), wi.ripemd160 = wi.RIPEMD160 = void 0;
+  if (A0) return mi;
+  A0 = 1, Object.defineProperty(mi, "__esModule", { value: !0 }), mi.ripemd160 = mi.RIPEMD160 = void 0;
   const e = /* @__PURE__ */ tw();
-  return wi.RIPEMD160 = e.RIPEMD160, wi.ripemd160 = e.ripemd160, wi;
+  return mi.RIPEMD160 = e.RIPEMD160, mi.ripemd160 = e.ripemd160, mi;
 }
-var mi = {}, v0;
+var bi = {}, v0;
 function V8() {
-  if (v0) return mi;
-  v0 = 1, Object.defineProperty(mi, "__esModule", { value: !0 }), mi.sha1 = mi.SHA1 = void 0;
+  if (v0) return bi;
+  v0 = 1, Object.defineProperty(bi, "__esModule", { value: !0 }), bi.sha1 = bi.SHA1 = void 0;
   const e = /* @__PURE__ */ tw();
-  return mi.SHA1 = e.SHA1, mi.sha1 = e.sha1, mi;
+  return bi.SHA1 = e.SHA1, bi.sha1 = e.sha1, bi;
 }
 var In = {}, B0;
 function nw() {
@@ -21538,7 +21538,7 @@ function nw() {
   return In.SHA256 = e.SHA256, In.sha256 = e.sha256, In.SHA224 = e.SHA224, In.sha224 = e.sha224, In;
 }
 var I0;
-function xr() {
+function vr() {
   return I0 || (I0 = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.taggedHash = e.TAGGED_HASH_PREFIXES = e.TAGS = e.hash256 = e.hash160 = e.sha256 = e.sha1 = e.ripemd160 = void 0;
     const t = /* @__PURE__ */ q8(), n = /* @__PURE__ */ V8(), r = /* @__PURE__ */ nw();
@@ -22303,7 +22303,7 @@ var U0;
 function j8() {
   if (U0) return zs;
   U0 = 1, Object.defineProperty(zs, "__esModule", { value: !0 }), zs.p2pkh = void 0;
-  const e = xr(), t = Vn(), n = Zt(), r = Kt(), i = ai(), s = Xl(), o = n.OPS;
+  const e = vr(), t = Vn(), n = Zt(), r = Kt(), i = ui(), s = Xl(), o = n.OPS;
   function c(a, u) {
     if (!a.address && !a.hash && !a.output && !a.pubkey && !a.input)
       throw new TypeError("Not enough data");
@@ -22403,7 +22403,7 @@ var Ys = {}, R0;
 function W8() {
   if (R0) return Ys;
   R0 = 1, Object.defineProperty(Ys, "__esModule", { value: !0 }), Ys.p2sh = void 0;
-  const e = xr(), t = Vn(), n = Zt(), r = Kt(), i = ai(), s = Xl(), o = n.OPS;
+  const e = vr(), t = Vn(), n = Zt(), r = Kt(), i = ui(), s = Xl(), o = n.OPS;
   function c(a, u) {
     if (!a.address && !a.hash && !a.output && !a.redeem && !a.input)
       throw new TypeError("Not enough data");
@@ -22548,7 +22548,7 @@ var Zs = {}, C0;
 function G8() {
   if (C0) return Zs;
   C0 = 1, Object.defineProperty(Zs, "__esModule", { value: !0 }), Zs.p2wpkh = void 0;
-  const e = xr(), t = Vn(), n = Zt(), r = Kt(), i = ai(), s = Do(), o = n.OPS, c = Buffer.alloc(0);
+  const e = vr(), t = Vn(), n = Zt(), r = Kt(), i = ui(), s = Do(), 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");
@@ -22652,7 +22652,7 @@ var Js = {}, H0;
 function D8() {
   if (H0) return Js;
   H0 = 1, Object.defineProperty(Js, "__esModule", { value: !0 }), Js.p2wsh = void 0;
-  const e = xr(), t = Vn(), n = Zt(), r = Kt(), i = ai(), s = Do(), o = n.OPS, c = Buffer.alloc(0);
+  const e = vr(), t = Vn(), n = Zt(), r = Kt(), i = ui(), s = Do(), o = n.OPS, c = Buffer.alloc(0);
   function a(f) {
     return !!(Buffer.isBuffer(f) && f.length === 65 && f[0] === 4 && (0, r.isPoint)(f));
   }
@@ -22791,15 +22791,15 @@ function D8() {
   }
   return Js.p2wsh = u, Js;
 }
-var Qs = {}, bi = {}, F0;
+var Qs = {}, Ei = {}, F0;
 function zl() {
-  if (F0) return bi;
-  F0 = 1, Object.defineProperty(bi, "__esModule", { value: !0 }), bi.getEccLib = bi.initEccLib = void 0;
+  if (F0) return Ei;
+  F0 = 1, Object.defineProperty(Ei, "__esModule", { value: !0 }), Ei.getEccLib = Ei.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;
   }
-  bi.initEccLib = t;
+  Ei.initEccLib = t;
   function n() {
     if (!e.eccLib)
       throw new Error(
@@ -22807,7 +22807,7 @@ function zl() {
       );
     return e.eccLib;
   }
-  bi.getEccLib = n;
+  Ei.getEccLib = n;
   const r = (c) => Buffer.from(c, "hex");
   function i(c) {
     s(typeof c.isXOnlyPoint == "function"), s(
@@ -22862,7 +22862,7 @@ function zl() {
       result: "9534f8dc8c6deda2dc007655981c78b49c5d96c778fbf363462a11ec9dfd948c"
     }
   ];
-  return bi;
+  return Ei;
 }
 var ff = {}, At = {}, Sc = { exports: {} };
 /*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */
@@ -23052,7 +23052,7 @@ var L0;
 function Yl() {
   return L0 || (L0 = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.tweakKey = e.tapTweakHash = e.tapleafHash = e.findScriptPath = e.toHashTree = e.rootHashFromPath = e.MAX_TAPTREE_DEPTH = e.LEAF_VERSION_TAPSCRIPT = void 0;
-    const t = Vo(), n = zl(), r = xr(), i = iu(), s = Kt();
+    const t = Vo(), n = zl(), r = vr(), i = iu(), s = Kt();
     e.LEAF_VERSION_TAPSCRIPT = 192, e.MAX_TAPTREE_DEPTH = 128;
     const o = (w) => "left" in w && "right" in w;
     function c(w, E) {
@@ -23132,7 +23132,7 @@ var K0;
 function Y8() {
   if (K0) return Qs;
   K0 = 1, Object.defineProperty(Qs, "__esModule", { value: !0 }), Qs.p2tr = void 0;
-  const e = Vo(), t = Vn(), n = Zt(), r = Kt(), i = zl(), s = Yl(), o = ai(), c = Do(), a = Zl(), u = n.OPS, f = 1, l = 80;
+  const e = Vo(), t = Vn(), n = Zt(), r = Kt(), i = zl(), s = Yl(), o = ui(), c = Do(), a = Zl(), u = n.OPS, f = 1, l = 80;
   function p(y, g) {
     if (!y.address && !y.output && !y.pubkey && !y.internalPubkey && !(y.witness && y.witness.length > 1))
       throw new TypeError("Not enough data");
@@ -23544,7 +23544,7 @@ var no = {}, G0;
 function oc() {
   if (G0) return no;
   G0 = 1, Object.defineProperty(no, "__esModule", { value: !0 }), no.Transaction = void 0;
-  const e = iu(), t = xr(), n = Zt(), r = Zt(), i = Kt(), { typeforce: s } = i;
+  const e = iu(), t = vr(), n = Zt(), r = Zt(), i = Kt(), { typeforce: s } = i;
   function o(E) {
     const _ = E.length;
     return e.varuint.encodingLength(_) + _;
@@ -23834,7 +23834,7 @@ var D0;
 function J8() {
   if (D0) return eo;
   D0 = 1, Object.defineProperty(eo, "__esModule", { value: !0 }), eo.Block = void 0;
-  const e = iu(), t = xr(), n = Z8(), r = oc(), i = Kt(), { typeforce: s } = i, o = new TypeError(
+  const e = iu(), t = vr(), n = Z8(), r = oc(), i = Kt(), { typeforce: s } = i, o = new TypeError(
     "Cannot compute merkle root for zero transactions"
   ), c = new TypeError(
     "Cannot compute witness commit for non-segwit block"
@@ -23999,10 +23999,10 @@ function Nt() {
     ];
   })(df)), df;
 }
-var Nr = {}, z0;
+var Rr = {}, z0;
 function Q8() {
-  if (z0) return Nr;
-  z0 = 1, Object.defineProperty(Nr, "__esModule", { value: !0 });
+  if (z0) return Rr;
+  z0 = 1, Object.defineProperty(Rr, "__esModule", { value: !0 });
   const e = Nt(), t = (o) => [...Array(o).keys()];
   function n(o) {
     if (o.key[0] !== e.GlobalTypes.GLOBAL_XPUB)
@@ -24028,7 +24028,7 @@ function Q8() {
     }
     return a;
   }
-  Nr.decode = n;
+  Rr.decode = n;
   function r(o) {
     const c = Buffer.from([e.GlobalTypes.GLOBAL_XPUB]), a = Buffer.concat([c, o.extendedPubkey]), u = o.path.split("/"), f = Buffer.allocUnsafe(u.length * 4);
     o.masterFingerprint.copy(f, 0);
@@ -24042,17 +24042,17 @@ function Q8() {
       value: f
     };
   }
-  Nr.encode = r, Nr.expected = "{ masterFingerprint: Buffer; extendedPubkey: Buffer; path: string; }";
+  Rr.encode = r, Rr.expected = "{ masterFingerprint: Buffer; extendedPubkey: Buffer; path: string; }";
   function i(o) {
     const c = o.extendedPubkey, a = o.masterFingerprint, u = o.path;
     return Buffer.isBuffer(c) && c.length === 78 && [2, 3].indexOf(c[45]) > -1 && Buffer.isBuffer(a) && a.length === 4 && typeof u == "string" && !!u.match(/^m(\/\d+'?)*$/);
   }
-  Nr.check = i;
+  Rr.check = i;
   function s(o, c, a) {
     const u = c.extendedPubkey.toString("hex");
     return a.has(u) ? !1 : (a.add(u), o.filter((f) => f.extendedPubkey.equals(c.extendedPubkey)).length === 0);
   }
-  return Nr.canAddToArray = s, Nr;
+  return Rr.canAddToArray = s, Rr;
 }
 var Ac = {}, Y0;
 function ex() {
@@ -24067,10 +24067,10 @@ function ex() {
   }
   return Ac.encode = t, Ac;
 }
-var Ur = {}, Z0;
+var Cr = {}, Z0;
 function tx() {
-  if (Z0) return Ur;
-  Z0 = 1, Object.defineProperty(Ur, "__esModule", { value: !0 });
+  if (Z0) return Cr;
+  Z0 = 1, Object.defineProperty(Cr, "__esModule", { value: !0 });
   const e = Nt();
   function t(s) {
     if (s.key[0] !== e.InputTypes.FINAL_SCRIPTSIG)
@@ -24079,27 +24079,27 @@ function tx() {
       );
     return s.value;
   }
-  Ur.decode = t;
+  Cr.decode = t;
   function n(s) {
     return {
       key: Buffer.from([e.InputTypes.FINAL_SCRIPTSIG]),
       value: s
     };
   }
-  Ur.encode = n, Ur.expected = "Buffer";
+  Cr.encode = n, Cr.expected = "Buffer";
   function r(s) {
     return Buffer.isBuffer(s);
   }
-  Ur.check = r;
+  Cr.check = r;
   function i(s, o) {
     return !!s && !!o && s.finalScriptSig === void 0;
   }
-  return Ur.canAdd = i, Ur;
+  return Cr.canAdd = i, Cr;
 }
-var Rr = {}, J0;
+var Hr = {}, J0;
 function nx() {
-  if (J0) return Rr;
-  J0 = 1, Object.defineProperty(Rr, "__esModule", { value: !0 });
+  if (J0) return Hr;
+  J0 = 1, Object.defineProperty(Hr, "__esModule", { value: !0 });
   const e = Nt();
   function t(s) {
     if (s.key[0] !== e.InputTypes.FINAL_SCRIPTWITNESS)
@@ -24108,27 +24108,27 @@ function nx() {
       );
     return s.value;
   }
-  Rr.decode = t;
+  Hr.decode = t;
   function n(s) {
     return {
       key: Buffer.from([e.InputTypes.FINAL_SCRIPTWITNESS]),
       value: s
     };
   }
-  Rr.encode = n, Rr.expected = "Buffer";
+  Hr.encode = n, Hr.expected = "Buffer";
   function r(s) {
     return Buffer.isBuffer(s);
   }
-  Rr.check = r;
+  Hr.check = r;
   function i(s, o) {
     return !!s && !!o && s.finalScriptWitness === void 0;
   }
-  return Rr.canAdd = i, Rr;
+  return Hr.canAdd = i, Hr;
 }
-var Cr = {}, Q0;
+var Fr = {}, Q0;
 function rx() {
-  if (Q0) return Cr;
-  Q0 = 1, Object.defineProperty(Cr, "__esModule", { value: !0 });
+  if (Q0) return Fr;
+  Q0 = 1, Object.defineProperty(Fr, "__esModule", { value: !0 });
   const e = Nt();
   function t(s) {
     if (s.key[0] !== e.InputTypes.NON_WITNESS_UTXO)
@@ -24137,27 +24137,27 @@ function rx() {
       );
     return s.value;
   }
-  Cr.decode = t;
+  Fr.decode = t;
   function n(s) {
     return {
       key: Buffer.from([e.InputTypes.NON_WITNESS_UTXO]),
       value: s
     };
   }
-  Cr.encode = n, Cr.expected = "Buffer";
+  Fr.encode = n, Fr.expected = "Buffer";
   function r(s) {
     return Buffer.isBuffer(s);
   }
-  Cr.check = r;
+  Fr.check = r;
   function i(s, o) {
     return !!s && !!o && s.nonWitnessUtxo === void 0;
   }
-  return Cr.canAdd = i, Cr;
+  return Fr.canAdd = i, Fr;
 }
-var Hr = {}, ep;
+var Mr = {}, ep;
 function ix() {
-  if (ep) return Hr;
-  ep = 1, Object.defineProperty(Hr, "__esModule", { value: !0 });
+  if (ep) return Mr;
+  ep = 1, Object.defineProperty(Mr, "__esModule", { value: !0 });
   const e = Nt();
   function t(o) {
     if (o.key[0] !== e.InputTypes.PARTIAL_SIG)
@@ -24173,7 +24173,7 @@ function ix() {
       signature: o.value
     };
   }
-  Hr.decode = t;
+  Mr.decode = t;
   function n(o) {
     const c = Buffer.from([e.InputTypes.PARTIAL_SIG]);
     return {
@@ -24181,11 +24181,11 @@ function ix() {
       value: o.signature
     };
   }
-  Hr.encode = n, Hr.expected = "{ pubkey: Buffer; signature: Buffer; }";
+  Mr.encode = n, Mr.expected = "{ pubkey: Buffer; signature: Buffer; }";
   function r(o) {
     return Buffer.isBuffer(o.pubkey) && Buffer.isBuffer(o.signature) && [33, 65].includes(o.pubkey.length) && [2, 3, 4].includes(o.pubkey[0]) && i(o.signature);
   }
-  Hr.check = r;
+  Mr.check = r;
   function i(o) {
     if (!Buffer.isBuffer(o) || o.length < 9 || o[0] !== 48 || o.length !== o[1] + 3 || o[2] !== 2) return !1;
     const c = o[3];
@@ -24197,12 +24197,12 @@ function ix() {
     const u = c.pubkey.toString("hex");
     return a.has(u) ? !1 : (a.add(u), o.filter((f) => f.pubkey.equals(c.pubkey)).length === 0);
   }
-  return Hr.canAddToArray = s, Hr;
+  return Mr.canAddToArray = s, Mr;
 }
-var Fr = {}, tp;
+var qr = {}, tp;
 function sx() {
-  if (tp) return Fr;
-  tp = 1, Object.defineProperty(Fr, "__esModule", { value: !0 });
+  if (tp) return qr;
+  tp = 1, Object.defineProperty(qr, "__esModule", { value: !0 });
   const e = Nt();
   function t(s) {
     if (s.key[0] !== e.InputTypes.POR_COMMITMENT)
@@ -24211,27 +24211,27 @@ function sx() {
       );
     return s.value.toString("utf8");
   }
-  Fr.decode = t;
+  qr.decode = t;
   function n(s) {
     return {
       key: Buffer.from([e.InputTypes.POR_COMMITMENT]),
       value: Buffer.from(s, "utf8")
     };
   }
-  Fr.encode = n, Fr.expected = "string";
+  qr.encode = n, qr.expected = "string";
   function r(s) {
     return typeof s == "string";
   }
-  Fr.check = r;
+  qr.check = r;
   function i(s, o) {
     return !!s && !!o && s.porCommitment === void 0;
   }
-  return Fr.canAdd = i, Fr;
+  return qr.canAdd = i, qr;
 }
-var Mr = {}, np;
+var Vr = {}, np;
 function ox() {
-  if (np) return Mr;
-  np = 1, Object.defineProperty(Mr, "__esModule", { value: !0 });
+  if (np) return Vr;
+  np = 1, Object.defineProperty(Vr, "__esModule", { value: !0 });
   const e = Nt();
   function t(s) {
     if (s.key[0] !== e.InputTypes.SIGHASH_TYPE)
@@ -24240,7 +24240,7 @@ function ox() {
       );
     return s.value.readUInt32LE(0);
   }
-  Mr.decode = t;
+  Vr.decode = t;
   function n(s) {
     const o = Buffer.from([e.InputTypes.SIGHASH_TYPE]), c = Buffer.allocUnsafe(4);
     return c.writeUInt32LE(s, 0), {
@@ -24248,20 +24248,20 @@ function ox() {
       value: c
     };
   }
-  Mr.encode = n, Mr.expected = "number";
+  Vr.encode = n, Vr.expected = "number";
   function r(s) {
     return typeof s == "number";
   }
-  Mr.check = r;
+  Vr.check = r;
   function i(s, o) {
     return !!s && !!o && s.sighashType === void 0;
   }
-  return Mr.canAdd = i, Mr;
+  return Vr.canAdd = i, Vr;
 }
-var qr = {}, rp;
+var Lr = {}, rp;
 function cx() {
-  if (rp) return qr;
-  rp = 1, Object.defineProperty(qr, "__esModule", { value: !0 });
+  if (rp) return Lr;
+  rp = 1, Object.defineProperty(Lr, "__esModule", { value: !0 });
   const e = Nt();
   function t(s) {
     if (s.key[0] !== e.InputTypes.TAP_KEY_SIG || s.key.length !== 1)
@@ -24274,24 +24274,24 @@ function cx() {
       );
     return s.value;
   }
-  qr.decode = t;
+  Lr.decode = t;
   function n(s) {
     return { key: Buffer.from([e.InputTypes.TAP_KEY_SIG]), value: s };
   }
-  qr.encode = n, qr.expected = "Buffer";
+  Lr.encode = n, Lr.expected = "Buffer";
   function r(s) {
     return Buffer.isBuffer(s) && (s.length === 64 || s.length === 65);
   }
-  qr.check = r;
+  Lr.check = r;
   function i(s, o) {
     return !!s && !!o && s.tapKeySig === void 0;
   }
-  return qr.canAdd = i, qr;
+  return Lr.canAdd = i, Lr;
 }
-var Vr = {}, ip;
+var Kr = {}, ip;
 function ax() {
-  if (ip) return Vr;
-  ip = 1, Object.defineProperty(Vr, "__esModule", { value: !0 });
+  if (ip) return Kr;
+  ip = 1, Object.defineProperty(Kr, "__esModule", { value: !0 });
   const e = Nt();
   function t(s) {
     if (s.key[0] !== e.InputTypes.TAP_LEAF_SCRIPT)
@@ -24310,7 +24310,7 @@ function ax() {
     const c = s.value.slice(0, -1);
     return { controlBlock: s.key.slice(1), script: c, leafVersion: o };
   }
-  Vr.decode = t;
+  Kr.decode = t;
   function n(s) {
     const o = Buffer.from([e.InputTypes.TAP_LEAF_SCRIPT]), c = Buffer.from([s.leafVersion]);
     return {
@@ -24318,21 +24318,21 @@ function ax() {
       value: Buffer.concat([s.script, c])
     };
   }
-  Vr.encode = n, Vr.expected = "{ controlBlock: Buffer; leafVersion: number, script: Buffer; }";
+  Kr.encode = n, Kr.expected = "{ controlBlock: Buffer; leafVersion: number, script: Buffer; }";
   function r(s) {
     return Buffer.isBuffer(s.controlBlock) && (s.controlBlock.length - 1) % 32 === 0 && (s.controlBlock[0] & 254) === s.leafVersion && Buffer.isBuffer(s.script);
   }
-  Vr.check = r;
+  Kr.check = r;
   function i(s, o, c) {
     const a = o.controlBlock.toString("hex");
     return c.has(a) ? !1 : (c.add(a), s.filter((u) => u.controlBlock.equals(o.controlBlock)).length === 0);
   }
-  return Vr.canAddToArray = i, Vr;
+  return Kr.canAddToArray = i, Kr;
 }
-var Lr = {}, sp;
+var $r = {}, sp;
 function ux() {
-  if (sp) return Lr;
-  sp = 1, Object.defineProperty(Lr, "__esModule", { value: !0 });
+  if (sp) return $r;
+  sp = 1, Object.defineProperty($r, "__esModule", { value: !0 });
   const e = Nt();
   function t(s) {
     if (s.key[0] !== e.InputTypes.TAP_MERKLE_ROOT || s.key.length !== 1)
@@ -24343,24 +24343,24 @@ function ux() {
       throw new Error("Decode Error: tapMerkleRoot not a 32-byte hash");
     return s.value;
   }
-  Lr.decode = t;
+  $r.decode = t;
   function n(s) {
     return { key: Buffer.from([e.InputTypes.TAP_MERKLE_ROOT]), value: s };
   }
-  Lr.encode = n, Lr.expected = "Buffer";
+  $r.encode = n, $r.expected = "Buffer";
   function r(s) {
     return Buffer.isBuffer(s) && s.length === 32;
   }
-  Lr.check = r;
+  $r.check = r;
   function i(s, o) {
     return !!s && !!o && s.tapMerkleRoot === void 0;
   }
-  return Lr.canAdd = i, Lr;
+  return $r.canAdd = i, $r;
 }
-var Kr = {}, op;
+var jr = {}, op;
 function fx() {
-  if (op) return Kr;
-  op = 1, Object.defineProperty(Kr, "__esModule", { value: !0 });
+  if (op) return jr;
+  op = 1, Object.defineProperty(jr, "__esModule", { value: !0 });
   const e = Nt();
   function t(s) {
     if (s.key[0] !== e.InputTypes.TAP_SCRIPT_SIG)
@@ -24382,7 +24382,7 @@ function fx() {
       signature: s.value
     };
   }
-  Kr.decode = t;
+  jr.decode = t;
   function n(s) {
     const o = Buffer.from([e.InputTypes.TAP_SCRIPT_SIG]);
     return {
@@ -24390,20 +24390,20 @@ function fx() {
       value: s.signature
     };
   }
-  Kr.encode = n, Kr.expected = "{ pubkey: Buffer; leafHash: Buffer; signature: Buffer; }";
+  jr.encode = n, jr.expected = "{ pubkey: Buffer; leafHash: Buffer; signature: Buffer; }";
   function r(s) {
     return Buffer.isBuffer(s.pubkey) && Buffer.isBuffer(s.leafHash) && Buffer.isBuffer(s.signature) && s.pubkey.length === 32 && s.leafHash.length === 32 && (s.signature.length === 64 || s.signature.length === 65);
   }
-  Kr.check = r;
+  jr.check = r;
   function i(s, o, c) {
     const a = o.pubkey.toString("hex") + o.leafHash.toString("hex");
     return c.has(a) ? !1 : (c.add(a), s.filter(
       (u) => u.pubkey.equals(o.pubkey) && u.leafHash.equals(o.leafHash)
     ).length === 0);
   }
-  return Kr.canAddToArray = i, Kr;
+  return jr.canAddToArray = i, jr;
 }
-var $r = {}, ir = {}, ts = {}, cp;
+var Wr = {}, ir = {}, ts = {}, cp;
 function Di() {
   if (cp) return ts;
   cp = 1, Object.defineProperty(ts, "__esModule", { value: !0 });
@@ -24489,8 +24489,8 @@ function Jl() {
 }
 var up;
 function lx() {
-  if (up) return $r;
-  up = 1, Object.defineProperty($r, "__esModule", { value: !0 });
+  if (up) return Wr;
+  up = 1, Object.defineProperty(Wr, "__esModule", { value: !0 });
   const e = Nt(), t = Jl(), n = Di();
   function r(c) {
     if (c.key[0] !== e.InputTypes.WITNESS_UTXO)
@@ -24509,7 +24509,7 @@ function lx() {
       value: a
     };
   }
-  $r.decode = r;
+  Wr.decode = r;
   function i(c) {
     const { script: a, value: u } = c, f = n.encodingLength(a.length), l = Buffer.allocUnsafe(8 + f + a.length);
     return t.writeUInt64LE(l, u, 0), n.encode(a.length, l, 8), a.copy(l, 8 + f), {
@@ -24517,20 +24517,20 @@ function lx() {
       value: l
     };
   }
-  $r.encode = i, $r.expected = "{ script: Buffer; value: number; }";
+  Wr.encode = i, Wr.expected = "{ script: Buffer; value: number; }";
   function s(c) {
     return Buffer.isBuffer(c.script) && typeof c.value == "number";
   }
-  $r.check = s;
+  Wr.check = s;
   function o(c, a) {
     return !!c && !!a && c.witnessUtxo === void 0;
   }
-  return $r.canAdd = o, $r;
+  return Wr.canAdd = o, Wr;
 }
-var jr = {}, fp;
+var Gr = {}, fp;
 function hx() {
-  if (fp) return jr;
-  fp = 1, Object.defineProperty(jr, "__esModule", { value: !0 });
+  if (fp) return Gr;
+  fp = 1, Object.defineProperty(Gr, "__esModule", { value: !0 });
   const e = Nt(), t = Di();
   function n(o) {
     if (o.key[0] !== e.OutputTypes.TAP_TREE || o.key.length !== 1)
@@ -24549,7 +24549,7 @@ function hx() {
     }
     return { leaves: a };
   }
-  jr.decode = n;
+  Gr.decode = n;
   function r(o) {
     const c = Buffer.from([e.OutputTypes.TAP_TREE]), a = [].concat(
       ...o.leaves.map((u) => [
@@ -24563,17 +24563,17 @@ function hx() {
       value: Buffer.concat(a)
     };
   }
-  jr.encode = r, jr.expected = "{ leaves: [{ depth: number; leafVersion: number, script: Buffer; }] }";
+  Gr.encode = r, Gr.expected = "{ leaves: [{ depth: number; leafVersion: number, script: Buffer; }] }";
   function i(o) {
     return Array.isArray(o.leaves) && o.leaves.every(
       (c) => c.depth >= 0 && c.depth <= 128 && (c.leafVersion & 254) === c.leafVersion && Buffer.isBuffer(c.script)
     );
   }
-  jr.check = i;
+  Gr.check = i;
   function s(o, c) {
     return !!o && !!c && o.tapTree === void 0;
   }
-  return jr.canAdd = s, jr;
+  return Gr.canAdd = s, Gr;
 }
 var vc = {}, lp;
 function rw() {
@@ -25492,7 +25492,7 @@ var ze = {}, We = {}, xp;
 function Wf() {
   if (xp) return We;
   xp = 1, Object.defineProperty(We, "__esModule", { value: !0 }), We.signatureBlocksAction = We.checkInputForSig = We.pubkeyInScript = We.pubkeyPositionInScript = We.witnessStackToScriptWitness = We.isP2TR = We.isP2SHScript = We.isP2WSHScript = We.isP2WPKH = We.isP2PKH = We.isP2PK = We.isP2MS = void 0;
-  const e = Di(), t = Zt(), n = oc(), r = xr(), i = sc();
+  const e = Di(), t = Zt(), n = oc(), r = vr(), i = sc();
   function s(y) {
     return (g) => {
       try {
@@ -26998,7 +26998,7 @@ function xx() {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.initEccLib = e.Transaction = e.opcodes = e.Psbt = e.Block = e.script = e.payments = e.networks = e.crypto = e.address = void 0;
     const t = Zl();
     e.address = t;
-    const n = xr();
+    const n = vr();
     e.crypto = n;
     const r = Vn();
     e.networks = r;
@@ -27043,10 +27043,10 @@ function xx() {
     });
   })(Yu)), Yu;
 }
-var Ei = {}, Ip;
+var _i = {}, Ip;
 function Ax() {
-  if (Ip) return Ei;
-  Ip = 1, Object.defineProperty(Ei, "__esModule", { value: !0 }), Ei.base26Decode = Ei.base26Encode = void 0;
+  if (Ip) return _i;
+  Ip = 1, Object.defineProperty(_i, "__esModule", { value: !0 }), _i.base26Decode = _i.base26Encode = void 0;
   function e(n) {
     let r = 0n;
     for (let i = 0; i < n.length; i++) {
@@ -27060,7 +27060,7 @@ function Ax() {
     }
     return r;
   }
-  Ei.base26Encode = e;
+  _i.base26Encode = e;
   function t(n) {
     if (n === 340282366920938463463374607431768211455n)
       return "BCGDENLQRQWDSLRUGSNLBTMFIJAV";
@@ -27072,12 +27072,12 @@ function Ax() {
     }
     return r.reverse().join("");
   }
-  return Ei.base26Decode = t, Ei;
+  return _i.base26Decode = t, _i;
 }
-var _i = {}, Op;
+var Si = {}, Op;
 function ow() {
-  if (Op) return _i;
-  Op = 1, Object.defineProperty(_i, "__esModule", { value: !0 }), _i.none = _i.some = void 0;
+  if (Op) return Si;
+  Op = 1, Object.defineProperty(Si, "__esModule", { value: !0 }), Si.none = Si.some = void 0;
   class e {
     constructor() {
     }
@@ -27108,16 +27108,16 @@ function ow() {
   function n(i) {
     return new t(i);
   }
-  _i.some = n;
+  Si.some = n;
   function r() {
     return new e();
   }
-  return _i.none = r, _i;
+  return Si.none = r, Si;
 }
-var Si = {}, Pp;
+var Ti = {}, Pp;
 function vx() {
-  if (Pp) return Si;
-  Pp = 1, Object.defineProperty(Si, "__esModule", { value: !0 }), Si.decodeLEB128 = Si.encodeLEB128 = void 0;
+  if (Pp) return Ti;
+  Pp = 1, Object.defineProperty(Ti, "__esModule", { value: !0 }), Ti.decodeLEB128 = Ti.encodeLEB128 = void 0;
   function e(n) {
     const r = [];
     let i = !0;
@@ -27127,7 +27127,7 @@ function vx() {
     }
     return r;
   }
-  Si.encodeLEB128 = e;
+  Ti.encodeLEB128 = e;
   function t(n) {
     let r = BigInt(0);
     for (let i = 0; i < n.length; i++) {
@@ -27145,7 +27145,7 @@ function vx() {
     }
     throw new Error("Unterminated");
   }
-  return Si.decodeLEB128 = t, Si;
+  return Ti.decodeLEB128 = t, Ti;
 }
 var yf = {}, kp;
 function Bx() {
@@ -27658,7 +27658,7 @@ function Ix() {
 var Rp;
 function Ox() {
   return Rp || (Rp = 1, (function(e) {
-    var t = hi && hi.__createBinding || (Object.create ? (function(s, o, c, a) {
+    var t = di && di.__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() {
@@ -27666,7 +27666,7 @@ function Ox() {
       } }), Object.defineProperty(s, a, u);
     }) : (function(s, o, c, a) {
       a === void 0 && (a = c), s[a] = o[c];
-    })), n = hi && hi.__exportStar || function(s, o) {
+    })), n = di && di.__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(Ix(), e);
@@ -27684,7 +27684,7 @@ function Ox() {
     } }), Object.defineProperty(e, "removeSpacers", { enumerable: !0, get: function() {
       return i.removeSpacers;
     } });
-  })(hi)), hi;
+  })(di)), di;
 }
 var ns = Ox();
 function oo(e) {
@@ -27705,7 +27705,7 @@ function ba(e, t = Fa.Testnet) {
   const n = eh(t);
   return Uy(e, n);
 }
-function Zr(e) {
+function hr(e) {
   const t = vn, n = Wp, r = Mw;
   let i, s, o = Gt.UNKNOWN;
   if (e.startsWith("bc1") || e.startsWith("tb1") || e.startsWith("bcrt1"))
@@ -27753,12 +27753,12 @@ const Y6 = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   bytesToHex: ma,
   formatPoolUtxo: Px,
-  getAddressType: Zr,
+  getAddressType: hr,
   getScriptByAddress: ba,
   getUtxoProof: aw,
   hexToBytes: oo,
   toBitcoinNetwork: eh
-}, Symbol.toStringTag, { value: "Module" })), kx = "kqs64-paaaa-aaaar-qamza-cai", Nx = "hvyp5-5yaaa-aaaao-qjxha-cai", Wr = BigInt(546), Qt = "0:0", Cp = {
+}, Symbol.toStringTag, { value: "Module" })), kx = "kqs64-paaaa-aaaar-qamza-cai", Nx = "hvyp5-5yaaa-aaaao-qjxha-cai", or = BigInt(546), Qt = "0:0", Cp = {
   P2PKH: 148,
   P2SH_P2WPKH: 91,
   P2WPKH: 68,
@@ -27780,7 +27780,7 @@ const Y6 = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   "P2SH_P2WPKH",
   "P2TR"
 ]), Rx = 2;
-class xi {
+class Zr {
   psbt;
   client;
   inputAddressTypes = [];
@@ -27807,7 +27807,7 @@ class xi {
     ) >= 0)
       return;
     const { address: n } = t;
-    if (Zr(n) === Gt.P2TR) {
+    if (hr(n) === Gt.P2TR) {
       let i = t.pubkey;
       i || t.address === this.config.address && this.config.publicKey && (i = this.config.publicKey);
       const s = i ? i.length === 66 ? i.slice(2) : i : void 0;
@@ -27836,7 +27836,7 @@ class xi {
           script: oo(t.scriptPk)
         }
       });
-    this.inputAddressTypes.push(Zr(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(hr(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
@@ -27847,7 +27847,7 @@ class xi {
     this.psbt.addOutput({
       address: t,
       value: n
-    }), this.outputAddressTypes.push(Zr(t));
+    }), this.outputAddressTypes.push(hr(t));
   }
   /**
    * Add an OP_RETURN script output (for Runestone)
@@ -27919,13 +27919,13 @@ class xi {
    * @returns Fee calculation result
    */
   async addBtcAndFees(t, n) {
-    const r = this.config.paymentAddress, i = this.additionalDustNeeded, s = Zr(r), o = this.userInputUtxoDusts, c = this.config.feeRate;
+    const r = this.config.paymentAddress, i = this.additionalDustNeeded, s = hr(r), o = this.userInputUtxoDusts, c = this.config.feeRate;
     this.outputAddressTypes.push(s);
     let a = !0, u = BigInt(0), f = BigInt(0), l = [], p = BigInt(0), y = BigInt(0);
     const g = [...this.inputAddressTypes];
     do {
       if (u = f, c !== void 0) {
-        const _ = xi.estimateTxVirtualSize(
+        const _ = Zr.estimateTxVirtualSize(
           this.inputAddressTypes,
           this.outputAddressTypes
         );
@@ -27949,7 +27949,7 @@ class xi {
           (m, T) => m + BigInt(T.satoshis),
           BigInt(0)
         );
-        S - p > 0 && S - p > Wr || (this.outputAddressTypes.pop(), a = !1), l = _;
+        S - p > 0 && S - p > or || (this.outputAddressTypes.pop(), a = !1), l = _;
       }
     } while (f > u && p > 0);
     this.inputAddressTypes = [...g], a && this.outputAddressTypes.pop();
@@ -27960,7 +27960,7 @@ class xi {
     const E = w - p;
     if (E < 0)
       throw new Error("Insufficient UTXO(s)");
-    E > Wr ? this.addOutput(r, E) : E > BigInt(0) && (y = E), this.txFee = y + f;
+    E > or ? 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.
@@ -28208,8 +28208,8 @@ class xi {
       });
       const a = new ns.Runestone(s, ns.none(), ns.none(), ns.none());
       this.addScriptOutput(new Uint8Array(a.encipher())), o.forEach((u) => {
-        const f = t[u]?.[Qt] ?? BigInt(0), l = u === this.config.address, p = f > BigInt(0) && (!l || n), y = p && f > Wr ? f : Wr;
-        this.addOutput(u, y), p ? (f < Wr && (this.additionalDustNeeded += Wr - f), delete t[u][Qt]) : this.additionalDustNeeded += Wr;
+        const f = t[u]?.[Qt] ?? BigInt(0), l = u === this.config.address, p = f > BigInt(0) && (!l || n), y = p && f > or ? f : or;
+        this.addOutput(u, y), p ? (f < or && (this.additionalDustNeeded += or - f), delete t[u][Qt]) : this.additionalDustNeeded += or;
       });
     }
     for (const [s, o] of Object.entries(
@@ -28264,10 +28264,36 @@ class xi {
    * ```
    */
   async build() {
-    const t = await this.getInvolvedAddressUtxos(), n = this.config.paymentAddress, r = t.btc[n] ?? [];
-    if (this.config.manualBuild)
-      await this.addBtcAndFees(r, BigInt(0));
-    else {
+    const t = await this.getInvolvedAddressUtxos(), n = this.config.paymentAddress;
+    let r = t.btc[n] ?? [];
+    if (this.config.manualBuild) {
+      const a = this.inputUtxos.filter((y) => y.address === n).reduce((y, g) => y + BigInt(g.satoshis), BigInt(0));
+      let u = BigInt(0);
+      for (const y of this.psbt.txOutputs)
+        y.address && y.address !== n && (u += BigInt(y.value));
+      const f = hr(n);
+      this.outputAddressTypes.push(f);
+      let l;
+      if (this.config.feeRate !== void 0) {
+        const y = Zr.estimateTxVirtualSize(
+          this.inputAddressTypes,
+          this.outputAddressTypes
+        );
+        l = BigInt(Math.round(this.config.feeRate * y));
+      } else
+        l = (await this.client.orchestrator.estimate_min_tx_fee({
+          input_types: this.inputAddressTypes,
+          pool_address: this.intentions.map((g) => g.poolAddress),
+          output_types: this.outputAddressTypes
+        })).Ok;
+      this.outputAddressTypes.pop();
+      const p = a - u - l - this.additionalDustNeeded;
+      if (p < 0)
+        throw new Error(
+          `Insufficient funds: inputs=${a}, outputs=${u}, fee=${l}, needed=${this.additionalDustNeeded}, shortage=${-p}`
+        );
+      p > or ? (this.addOutput(n, p), this.txFee = l) : p > BigInt(0) ? this.txFee = l + p : this.txFee = l;
+    } else {
       for (const f of this.intentions) {
         const l = f.poolUtxos;
         if (!l) continue;
@@ -28284,7 +28310,7 @@ class xi {
       const u = this.inputUtxos[a], f = u.address;
       if (f !== this.config.paymentAddress || f !== this.config.address)
         continue;
-      const l = this.psbt.data.inputs[a].redeemScript, p = Zr(f);
+      const l = this.psbt.data.inputs[a].redeemScript, p = hr(f);
       if (o.push({
         index: a,
         ...p === Gt.P2TR ? { address: f, disableTweakSigner: !1 } : { publicKey: u.pubkey, disableTweakSigner: !0 }
@@ -28304,16 +28330,16 @@ class xi {
   static estimateTxVirtualSize(t, n) {
     const r = t.length, i = n.length;
     let s = 8 + // locktime
-    xi.varIntSize(r) + xi.varIntSize(i), o = !1;
+    Zr.varIntSize(r) + Zr.varIntSize(i), o = !1;
     for (const c of t) {
-      const a = xi.parseAddressType(c);
+      const a = Zr.parseAddressType(c);
       if (a.key === "OpReturn")
         continue;
       const u = Cp[a.key] ?? Cp.UNKNOWN;
       s += u, Ux.has(a.key) && (o = !0);
     }
     for (const c of n) {
-      const a = xi.parseAddressType(c);
+      const a = Zr.parseAddressType(c);
       if (a.key === "OpReturn") {
         const f = Math.max(0, a.opReturnLength ?? 0);
         s += 11 + f;
@@ -28430,7 +28456,7 @@ class xi {
  *  Copyright (c) 2025 Michael Mclaughlin <M8ch88l@gmail.com>
  *  MIT Licence
  */
-var as = 9e15, ui = 1e9, Gf = "0123456789abcdef", Ea = "2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058", _a = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789", Df = {
+var as = 9e15, fi = 1e9, Gf = "0123456789abcdef", Ea = "2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058", _a = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789", Df = {
   // 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.
@@ -28488,7 +28514,7 @@ var as = 9e15, ui = 1e9, Gf = "0123456789abcdef", Ea = "2.3025850929940456840179
   // Whether to use cryptographically-secure random number generation, if available.
   crypto: !1
   // true/false
-}, uw, gr, Te = !0, su = "[DecimalError] ", si = su + "Invalid argument: ", fw = su + "Precision limit exceeded", lw = su + "crypto unavailable", hw = "[object Decimal]", Lt = Math.floor, bt = Math.pow, Cx = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i, Hx = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i, Fx = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i, dw = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i, Fn = 1e7, be = 7, Mx = 9007199254740991, qx = Ea.length - 1, Xf = _a.length - 1, ie = { toStringTag: hw };
+}, uw, mr, Te = !0, su = "[DecimalError] ", oi = su + "Invalid argument: ", fw = su + "Precision limit exceeded", lw = su + "crypto unavailable", hw = "[object Decimal]", Lt = Math.floor, bt = Math.pow, Cx = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i, Hx = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i, Fx = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i, dw = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i, Fn = 1e7, be = 7, Mx = 9007199254740991, qx = Ea.length - 1, Xf = _a.length - 1, ie = { toStringTag: hw };
 ie.absoluteValue = ie.abs = function() {
   var e = new this.constructor(this);
   return e.s < 0 && (e.s = 1), we(e);
@@ -28499,7 +28525,7 @@ ie.ceil = function() {
 ie.clampedTo = ie.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(si + t);
+  if (e.gt(t)) throw Error(oi + t);
   return n = r.cmp(e), n < 0 ? e : r.cmp(t) > 0 ? t : new i(r);
 };
 ie.comparedTo = ie.cmp = function(e) {
@@ -28515,7 +28541,7 @@ ie.comparedTo = ie.cmp = function(e) {
 };
 ie.cosine = ie.cos = function() {
   var e, t, n = this, r = n.constructor;
-  return n.d ? n.d[0] ? (e = r.precision, t = r.rounding, r.precision = e + Math.max(n.e, n.sd()) + be, r.rounding = 1, n = Vx(r, mw(r, n)), r.precision = e, r.rounding = t, we(gr == 2 || gr == 3 ? n.neg() : n, e, t, !0)) : new r(1) : new r(NaN);
+  return n.d ? n.d[0] ? (e = r.precision, t = r.rounding, r.precision = e + Math.max(n.e, n.sd()) + be, r.rounding = 1, n = Vx(r, mw(r, n)), r.precision = e, r.rounding = t, we(mr == 2 || mr == 3 ? n.neg() : n, e, t, !0)) : new r(1) : new r(NaN);
 };
 ie.cubeRoot = ie.cbrt = function() {
   var e, t, n, r, i, s, o, c, a, u, f = this, l = f.constructor;
@@ -28665,9 +28691,9 @@ ie.logarithm = ie.log = function(e) {
       for (i = n[0]; i % 10 === 0; ) i /= 10;
       s = i !== 1;
     }
-  if (Te = !1, c = l + y, o = Jr(u, c), r = t ? Sa(f, c + 10) : Jr(e, c), a = De(o, r, c, 1), Po(a.d, i = l, p))
+  if (Te = !1, c = l + y, o = Qr(u, c), r = t ? Sa(f, c + 10) : Qr(e, c), a = De(o, r, c, 1), Po(a.d, i = l, p))
     do
-      if (c += 10, o = Jr(u, c), r = t ? Sa(f, c + 10) : Jr(e, c), a = De(o, r, c, 1), !s) {
+      if (c += 10, o = Qr(u, c), r = t ? Sa(f, c + 10) : Qr(e, c), a = De(o, r, c, 1), !s) {
         +Pt(a.d).slice(i + 1, i + 15) + 1 == 1e14 && (a = we(a, l + 1, 0));
         break;
       }
@@ -28717,7 +28743,7 @@ ie.naturalExponential = ie.exp = function() {
   return zf(this);
 };
 ie.naturalLogarithm = ie.ln = function() {
-  return Jr(this);
+  return Qr(this);
 };
 ie.negated = ie.neg = function() {
   var e = new this.constructor(this);
@@ -28742,7 +28768,7 @@ ie.plus = ie.add = function(e) {
 };
 ie.precision = ie.sd = function(e) {
   var t, n = this;
-  if (e !== void 0 && e !== !!e && e !== 1 && e !== 0) throw Error(si + e);
+  if (e !== void 0 && e !== !!e && e !== 1 && e !== 0) throw Error(oi + e);
   return n.d ? (t = pw(n.d), e && n.e + 1 > t && (t = n.e + 1)) : t = NaN, t;
 };
 ie.round = function() {
@@ -28751,7 +28777,7 @@ ie.round = function() {
 };
 ie.sine = ie.sin = function() {
   var e, t, n = this, r = n.constructor;
-  return n.isFinite() ? n.isZero() ? new r(n) : (e = r.precision, t = r.rounding, r.precision = e + Math.max(n.e, n.sd()) + be, r.rounding = 1, n = Kx(r, mw(r, n)), r.precision = e, r.rounding = t, we(gr > 2 ? n.neg() : n, e, t, !0)) : new r(NaN);
+  return n.isFinite() ? n.isZero() ? new r(n) : (e = r.precision, t = r.rounding, r.precision = e + Math.max(n.e, n.sd()) + be, r.rounding = 1, n = Kx(r, mw(r, n)), r.precision = e, r.rounding = t, we(mr > 2 ? n.neg() : n, e, t, !0)) : new r(NaN);
 };
 ie.squareRoot = ie.sqrt = function() {
   var e, t, n, r, i, s, o = this, c = o.d, a = o.e, u = o.s, f = o.constructor;
@@ -28773,7 +28799,7 @@ ie.squareRoot = ie.sqrt = function() {
 };
 ie.tangent = ie.tan = function() {
   var e, t, n = this, r = n.constructor;
-  return n.isFinite() ? n.isZero() ? new r(n) : (e = r.precision, t = r.rounding, r.precision = e + 10, r.rounding = 1, n = n.sin(), n.s = 1, n = De(n, new r(1).minus(n.times(n)).sqrt(), e + 10, 0), r.precision = e, r.rounding = t, we(gr == 2 || gr == 4 ? n.neg() : n, e, t, !0)) : new r(NaN);
+  return n.isFinite() ? n.isZero() ? new r(n) : (e = r.precision, t = r.rounding, r.precision = e + 10, r.rounding = 1, n = n.sin(), n.s = 1, n = De(n, new r(1).minus(n.times(n)).sqrt(), e + 10, 0), r.precision = e, r.rounding = t, we(mr == 2 || mr == 4 ? n.neg() : n, e, t, !0)) : new r(NaN);
 };
 ie.times = ie.mul = function(e) {
   var t, n, r, i, s, o, c, a, u, f = this, l = f.constructor, p = f.d, y = (e = new l(e)).d;
@@ -28793,15 +28819,15 @@ ie.toBinary = function(e, t) {
 };
 ie.toDecimalPlaces = ie.toDP = function(e, t) {
   var n = this, r = n.constructor;
-  return n = new r(n), e === void 0 ? n : (fn(e, 0, ui), t === void 0 ? t = r.rounding : fn(t, 0, 8), we(n, e + n.e + 1, t));
+  return n = new r(n), e === void 0 ? n : (fn(e, 0, fi), t === void 0 ? t = r.rounding : fn(t, 0, 8), we(n, e + n.e + 1, t));
 };
 ie.toExponential = function(e, t) {
   var n, r = this, i = r.constructor;
-  return e === void 0 ? n = Zn(r, !0) : (fn(e, 0, ui), t === void 0 ? t = i.rounding : fn(t, 0, 8), r = we(new i(r), e + 1, t), n = Zn(r, !0, e + 1)), r.isNeg() && !r.isZero() ? "-" + n : n;
+  return e === void 0 ? n = Zn(r, !0) : (fn(e, 0, fi), t === void 0 ? t = i.rounding : fn(t, 0, 8), r = we(new i(r), e + 1, t), n = Zn(r, !0, e + 1)), r.isNeg() && !r.isZero() ? "-" + n : n;
 };
 ie.toFixed = function(e, t) {
   var n, r, i = this, s = i.constructor;
-  return e === void 0 ? n = Zn(i) : (fn(e, 0, ui), t === void 0 ? t = s.rounding : fn(t, 0, 8), r = we(new s(i), e + i.e + 1, t), n = Zn(r, !1, e + r.e + 1)), i.isNeg() && !i.isZero() ? "-" + n : n;
+  return e === void 0 ? n = Zn(i) : (fn(e, 0, fi), t === void 0 ? t = s.rounding : fn(t, 0, 8), r = we(new s(i), e + i.e + 1, t), n = Zn(r, !1, e + r.e + 1)), i.isNeg() && !i.isZero() ? "-" + n : n;
 };
 ie.toFraction = function(e) {
   var t, n, r, i, s, o, c, a, u, f, l, p, y = this, g = y.d, w = y.constructor;
@@ -28809,7 +28835,7 @@ ie.toFraction = function(e) {
   if (u = n = new w(1), r = a = new w(0), t = new w(r), s = t.e = pw(g) - y.e - 1, o = s % be, t.d[0] = bt(10, o < 0 ? be + o : o), e == null)
     e = s > 0 ? t : u;
   else {
-    if (c = new w(e), !c.isInt() || c.lt(u)) throw Error(si + c);
+    if (c = new w(e), !c.isInt() || c.lt(u)) throw Error(oi + c);
     e = c.gt(t) ? s > 0 ? t : u : c;
   }
   for (Te = !1, c = new w(Pt(g)), f = w.precision, w.precision = s = g.length * be * 2; l = De(c, t, 0, 1, 1), i = n.plus(l.times(r)), i.cmp(e) != 1; )
@@ -28849,15 +28875,15 @@ ie.toPower = ie.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 = bt(+c, u), t = n == 0 || !isFinite(n) ? Lt(u * (Math.log("0." + Pt(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) : (Te = !1, a.rounding = c.s = 1, n = Math.min(12, (t + "").length), i = zf(e.times(Jr(c, r + n)), r), i.d && (i = we(i, r + 5, 1), Po(i.d, r, s) && (t = r + 10, i = we(zf(e.times(Jr(c, t + n)), t), t + 5, 1), +Pt(i.d).slice(r + 1, r + 15) + 1 == 1e14 && (i = we(i, r + 1, 0)))), i.s = o, Te = !0, a.rounding = s, we(i, r, s));
+  return n = bt(+c, u), t = n == 0 || !isFinite(n) ? Lt(u * (Math.log("0." + Pt(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) : (Te = !1, a.rounding = c.s = 1, n = Math.min(12, (t + "").length), i = zf(e.times(Qr(c, r + n)), r), i.d && (i = we(i, r + 5, 1), Po(i.d, r, s) && (t = r + 10, i = we(zf(e.times(Qr(c, t + n)), t), t + 5, 1), +Pt(i.d).slice(r + 1, r + 15) + 1 == 1e14 && (i = we(i, r + 1, 0)))), i.s = o, Te = !0, a.rounding = s, we(i, r, s));
 };
 ie.toPrecision = function(e, t) {
   var n, r = this, i = r.constructor;
-  return e === void 0 ? n = Zn(r, r.e <= i.toExpNeg || r.e >= i.toExpPos) : (fn(e, 1, ui), t === void 0 ? t = i.rounding : fn(t, 0, 8), r = we(new i(r), e, t), n = Zn(r, e <= r.e || r.e <= i.toExpNeg, e)), r.isNeg() && !r.isZero() ? "-" + n : n;
+  return e === void 0 ? n = Zn(r, r.e <= i.toExpNeg || r.e >= i.toExpPos) : (fn(e, 1, fi), t === void 0 ? t = i.rounding : fn(t, 0, 8), r = we(new i(r), e, t), n = Zn(r, e <= r.e || r.e <= i.toExpNeg, e)), r.isNeg() && !r.isZero() ? "-" + n : n;
 };
 ie.toSignificantDigits = ie.toSD = function(e, t) {
   var n = this, r = n.constructor;
-  return e === void 0 ? (e = r.precision, t = r.rounding) : (fn(e, 1, ui), t === void 0 ? t = r.rounding : fn(t, 0, 8)), we(new r(n), e, t);
+  return e === void 0 ? (e = r.precision, t = r.rounding) : (fn(e, 1, fi), t === void 0 ? t = r.rounding : fn(t, 0, 8)), we(new r(n), e, t);
 };
 ie.toString = function() {
   var e = this, t = e.constructor, n = Zn(e, e.e <= t.toExpNeg || e.e >= t.toExpPos);
@@ -28874,8 +28900,8 @@ function Pt(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 = be - r.length, n && (s += Yr(n)), s += r;
-    o = e[t], r = o + "", n = be - r.length, n && (s += Yr(n));
+      r = e[t] + "", n = be - r.length, n && (s += Jr(n)), s += r;
+    o = e[t], r = o + "", n = be - r.length, n && (s += Jr(n));
   } else if (o === 0)
     return "0";
   for (; o % 10 === 0; ) o /= 10;
@@ -28883,7 +28909,7 @@ function Pt(e) {
 }
 function fn(e, t, n) {
   if (e !== ~~e || e < t || e > n)
-    throw Error(si + e);
+    throw Error(oi + e);
 }
 function Po(e, t, n, r) {
   var i, s, o, c;
@@ -29007,7 +29033,7 @@ function we(e, t, n, r) {
 function Zn(e, t, n) {
   if (!e.isFinite()) return ww(e);
   var r, i = e.e, s = Pt(e.d), o = s.length;
-  return t ? (n && (r = n - o) > 0 ? s = s.charAt(0) + "." + s.slice(1) + Yr(r) : o > 1 && (s = s.charAt(0) + "." + s.slice(1)), s = s + (e.e < 0 ? "e" : "e+") + e.e) : i < 0 ? (s = "0." + Yr(-i - 1) + s, n && (r = n - o) > 0 && (s += Yr(r))) : i >= o ? (s += Yr(i + 1 - o), n && (r = n - i - 1) > 0 && (s = s + "." + Yr(r))) : ((r = i + 1) < o && (s = s.slice(0, r) + "." + s.slice(r)), n && (r = n - o) > 0 && (i + 1 === o && (s += "."), s += Yr(r))), s;
+  return t ? (n && (r = n - o) > 0 ? s = s.charAt(0) + "." + s.slice(1) + Jr(r) : o > 1 && (s = s.charAt(0) + "." + s.slice(1)), s = s + (e.e < 0 ? "e" : "e+") + e.e) : i < 0 ? (s = "0." + Jr(-i - 1) + s, n && (r = n - o) > 0 && (s += Jr(r))) : i >= o ? (s += Jr(i + 1 - o), n && (r = n - i - 1) > 0 && (s = s + "." + Jr(r))) : ((r = i + 1) < o && (s = s.slice(0, r) + "." + s.slice(r)), n && (r = n - o) > 0 && (i + 1 === o && (s += "."), s += Jr(r))), s;
 }
 function ou(e, t) {
   var n = e[0];
@@ -29031,7 +29057,7 @@ function pw(e) {
   }
   return n;
 }
-function Yr(e) {
+function Jr(e) {
   for (var t = ""; e--; ) t += "0";
   return t;
 }
@@ -29079,7 +29105,7 @@ function zf(e, t) {
     o = c;
   }
 }
-function Jr(e, t) {
+function Qr(e, t) {
   var n, r, i, s, o, c, a, u, f, l, p, y = 1, g = 10, w = e, E = w.d, _ = w.constructor, S = _.rounding, m = _.precision;
   if (w.s < 0 || !E || !E[0] || !w.e && E[0] == 1 && E.length == 1)
     return new _(E && !E[0] ? -1 / 0 : w.s != 1 ? NaN : E ? 0 : w);
@@ -29088,7 +29114,7 @@ function Jr(e, t) {
       w = w.times(e), n = Pt(w.d), r = n.charAt(0), y++;
     s = w.e, r > 1 ? (w = new _("0." + n), s++) : w = new _(r + "." + n.slice(1));
   } else
-    return u = Sa(_, f + 2, m).times(s + ""), w = Jr(new _(r + "." + n.slice(1)), f - g).plus(u), _.precision = m, t == null ? we(w, m, S, Te = !0) : w;
+    return u = Sa(_, f + 2, m).times(s + ""), w = Qr(new _(r + "." + n.slice(1)), f - g).plus(u), _.precision = m, t == null ? we(w, m, S, Te = !0) : w;
   for (l = w, a = o = w = De(w.minus(1), w.plus(1), f, 1), p = we(w.times(w), f, 1), i = 3; ; ) {
     if (o = we(o.times(p), f, 1), u = a.plus(De(o, new _(i), f, 1)), Pt(u.d).slice(0, f) === Pt(a.d).slice(0, f))
       if (a = a.times(2), s !== 0 && (a = a.plus(Sa(_, f + 2, m).times(s + ""))), a = De(a, new _(y), f, 1), t == null)
@@ -29133,9 +29159,9 @@ function Lx(e, t) {
   else if (Fx.test(t))
     n = 8;
   else
-    throw Error(si + t);
+    throw Error(oi + 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 = yw(r, new r(n), s, s * 2)), u = Lc(t, n, Fn), f = u.length - 1, s = f; u[s] === 0; --s) u.pop();
-  return s < 0 ? new r(e.s * 0) : (e.e = ou(u, f), e.d = u, Te = !1, o && (e = De(e, i, c * 4)), a && (e = e.times(Math.abs(a) < 54 ? bt(2, a) : Qr.pow(2, a))), Te = !0, e);
+  return s < 0 ? new r(e.s * 0) : (e.e = ou(u, f), e.d = u, Te = !1, o && (e = De(e, i, c * 4)), a && (e = e.times(Math.abs(a) < 54 ? bt(2, a) : ei.pow(2, a))), Te = !0, e);
 }
 function Kx(e, t) {
   var n, r = t.d.length;
@@ -29164,19 +29190,19 @@ function cu(e, t) {
 function mw(e, t) {
   var n, r = t.s < 0, i = Xn(e, e.precision, 1), s = i.times(0.5);
   if (t = t.abs(), t.lte(s))
-    return gr = r ? 4 : 1, t;
+    return mr = r ? 4 : 1, t;
   if (n = t.divToInt(i), n.isZero())
-    gr = r ? 3 : 2;
+    mr = r ? 3 : 2;
   else {
     if (t = t.minus(n.times(i)), t.lte(s))
-      return gr = Fp(n) ? r ? 2 : 3 : r ? 4 : 1, t;
-    gr = Fp(n) ? r ? 1 : 4 : r ? 3 : 2;
+      return mr = Fp(n) ? r ? 2 : 3 : r ? 4 : 1, t;
+    mr = Fp(n) ? r ? 1 : 4 : r ? 3 : 2;
   }
   return t.minus(i).abs();
 }
 function th(e, t, n, r) {
   var i, s, o, c, a, u, f, l, p, y = e.constructor, g = n !== void 0;
-  if (g ? (fn(n, 1, ui), r === void 0 ? r = y.rounding : fn(r, 0, 8)) : (n = y.precision, r = y.rounding), !e.isFinite())
+  if (g ? (fn(n, 1, fi), r === void 0 ? r = y.rounding : fn(r, 0, 8)) : (n = y.precision, r = y.rounding), !e.isFinite())
     f = ww(e);
   else {
     for (f = Zn(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(".", ""), p = new y(1), p.e = f.length - o, p.d = Lc(Zn(p), 10, i), p.e = p.d.length), l = Lc(f, 10, i), s = a = l.length; l[--a] == 0; ) l.pop();
@@ -29254,7 +29280,7 @@ function t6(e) {
   var t, n, r, i = e.defaults === !0, s = [
     "precision",
     1,
-    ui,
+    fi,
     "rounding",
     0,
     8,
@@ -29277,7 +29303,7 @@ function t6(e) {
   for (t = 0; t < s.length; t += 3)
     if (n = s[t], i && (this[n] = Df[n]), (r = e[n]) !== void 0)
       if (Lt(r) === r && r >= s[t + 1] && r <= s[t + 2]) this[n] = r;
-      else throw Error(si + n + ": " + r);
+      else throw Error(oi + n + ": " + r);
   if (n = "crypto", i && (this[n] = Df[n]), (r = e[n]) !== void 0)
     if (r === !0 || r === !1 || r === 0 || r === 1)
       if (r)
@@ -29288,7 +29314,7 @@ function t6(e) {
       else
         this[n] = !1;
     else
-      throw Error(si + n + ": " + r);
+      throw Error(oi + n + ": " + r);
   return this;
 }
 function n6(e) {
@@ -29326,7 +29352,7 @@ function bw(e) {
       return (c = s.charCodeAt(0)) === 45 ? (s = s.slice(1), u.s = -1) : (c === 43 && (s = s.slice(1)), u.s = 1), dw.test(s) ? Kc(u, s) : Lx(u, s);
     if (a === "bigint")
       return s < 0 ? (s = -s, u.s = -1) : u.s = 1, Kc(u, s.toString());
-    throw Error(si + s);
+    throw Error(oi + s);
   }
   if (i.prototype = ie, 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 = t6, i.clone = bw, i.isDecimal = qp, i.abs = $x, i.acos = jx, i.acosh = Wx, i.add = Gx, i.asin = Dx, i.asinh = Xx, i.atan = zx, i.atanh = Yx, i.atan2 = Zx, i.cbrt = Jx, i.ceil = Qx, i.clamp = e6, i.cos = n6, i.cosh = r6, i.div = i6, i.exp = s6, i.floor = o6, i.hypot = c6, i.ln = a6, i.log = u6, i.log10 = l6, i.log2 = f6, i.max = h6, i.min = d6, i.mod = p6, i.mul = y6, i.pow = g6, i.random = w6, i.round = m6, i.sign = b6, i.sin = E6, i.sinh = _6, i.sqrt = S6, i.sub = T6, i.sum = x6, i.tan = A6, i.tanh = v6, i.trunc = B6, 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]);
@@ -29354,7 +29380,7 @@ function c6() {
   return Te = !0, n.sqrt();
 }
 function qp(e) {
-  return e instanceof Qr || e && e.toStringTag === hw || !1;
+  return e instanceof ei || e && e.toStringTag === hw || !1;
 }
 function a6(e) {
   return new this(e).ln();
@@ -29385,7 +29411,7 @@ function g6(e, t) {
 }
 function w6(e) {
   var t, n, r, i, s = 0, o = new this(1), c = [];
-  if (e === void 0 ? e = this.precision : fn(e, 1, ui), r = Math.ceil(e / be), this.crypto)
+  if (e === void 0 ? e = this.precision : fn(e, 1, fi), r = Math.ceil(e / be), 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;
@@ -29440,9 +29466,9 @@ function B6(e) {
 }
 ie[Symbol.for("nodejs.util.inspect.custom")] = ie.toString;
 ie[Symbol.toStringTag] = "Decimal";
-var Qr = ie.constructor = bw(Df);
-Ea = new Qr(Ea);
-_a = new Qr(_a);
+var ei = ie.constructor = bw(Df);
+Ea = new ei(Ea);
+_a = new ei(_a);
 const I6 = ({ IDL: e }) => {
   const t = e.Record({
     exchange_id: e.Text,
@@ -29834,14 +29860,14 @@ class Z6 {
     });
     const i = "https://icp0.io";
     this.exchange = wa.createActor(t.exchangeIdlFactory, {
-      agent: yr.createSync({
+      agent: wr.createSync({
         host: i,
         retryTimes: 50,
         verifyQuerySignatures: !1
       }),
       canisterId: t.exchangeCanisterId
     }), this.orchestrator = wa.createActor(I6, {
-      agent: yr.createSync({
+      agent: wr.createSync({
         host: i,
         retryTimes: 50,
         verifyQuerySignatures: !1
@@ -29876,7 +29902,7 @@ class Z6 {
   async getPendingBtcUtxos(t) {
     const n = await this.orchestrator.get_zero_confirmed_utxos_of_address(
       t
-    ), r = Zr(t);
+    ), r = hr(t);
     return n.filter(({ maybe_rune: i }) => !i.length).map(({ value: i, script_pubkey_hex: s, outpoint: o }) => {
       const [c, a] = o.split(":");
       return {
@@ -29900,7 +29926,7 @@ class Z6 {
   async getPendingRuneUtxos(t, n) {
     const r = await this.orchestrator.get_zero_confirmed_utxos_of_address(
       t
-    ), i = Zr(t);
+    ), i = hr(t);
     return r.filter(({ maybe_rune: s }) => s.length).map(({ value: s, script_pubkey_hex: o, outpoint: c, maybe_rune: a }) => {
       const [u, f] = c.split(":"), l = a[0];
       return {
@@ -29971,11 +29997,11 @@ class Z6 {
       vout: p,
       address: t,
       runes: y.map(
-        ({ runeId: w, amount: E, divisibility: _ }) => {
-          const S = new Qr(E).mul(10 ** _).toFixed(0);
+        ({ runeId: w, amount: E }) => {
+          const _ = new ei(E).toFixed(0);
           return {
             id: w,
-            amount: S
+            amount: _
           };
         }
       ),
@@ -29994,7 +30020,7 @@ class Z6 {
       (i, s) => i + BigInt(s.satoshis),
       BigInt(0)
     );
-    return new Qr(r.toString()).div(1e8).toNumber();
+    return new ei(r.toString()).div(1e8).toNumber();
   }
   /**
    * Get the balance of a specific rune for the user's address
@@ -30006,10 +30032,10 @@ class Z6 {
     const i = await this.getRuneUtxos(t, n, r);
     if (!i)
       return;
-    let s = new Qr(0);
+    let s = new ei(0);
     for (const o of i)
       s = s.add(
-        new Qr(o.runes.find((c) => c.id === n)?.amount ?? 0)
+        new ei(o.runes.find((c) => c.id === n)?.amount ?? 0)
       );
     return s.toNumber();
   }
@@ -30059,7 +30085,7 @@ class Z6 {
     clientInfo: o,
     manualBuild: c
   }) {
-    return new xi(
+    return new Zr(
       {
         network: this.config.network,
         exchangeId: this.config.exchangeId,
@@ -30085,6 +30111,6 @@ class Z6 {
 export {
   Fa as Network,
   Z6 as ReeClient,
-  xi as Transaction,
+  Zr as Transaction,
   Y6 as utils
 };