@omnity/ree-client-ts-sdk 0.7.7 → 0.7.9

package/dist/index.es.js

@@ -2,10 +2,10 @@ var rh = (e) => {
   throw TypeError(e);
 };
 var ih = (e, t, n) => t.has(e) || rh("Cannot " + n);
-var Ue = (e, t, n) => (ih(e, t, "read from private field"), n ? n.call(e) : t.get(e)), Jt = (e, t, n) => t.has(e) ? rh("Cannot add the same private member more than once") : t instanceof WeakSet ? t.add(e) : t.set(e, n), Kt = (e, t, n, r) => (ih(e, t, "write to private field"), r ? r.call(e, n) : t.set(e, n), n);
+var Ue = (e, t, n) => (ih(e, t, "read from private field"), n ? n.call(e) : t.get(e)), Qt = (e, t, n) => t.has(e) ? rh("Cannot add the same private member more than once") : t instanceof WeakSet ? t.add(e) : t.set(e, n), jt = (e, t, n, r) => (ih(e, t, "write to private field"), r ? r.call(e, n) : t.set(e, n), n);
 var sh = (e, t, n, r) => ({
   set _(i) {
-    Kt(e, t, i, n);
+    jt(e, t, i, n);
   },
   get _() {
     return Ue(e, t, r);
@@ -1153,7 +1153,7 @@ const vw = /* @__PURE__ */ Vp(Aw);
 typeof globalThis > "u" && (globalThis.global = globalThis);
 typeof globalThis.Buffer > "u" && (globalThis.Buffer = Tw.Buffer);
 typeof globalThis.process > "u" && (globalThis.process = vw);
-var tt = {}, fu = {}, Ke = {}, Ut = {}, lu = {}, Fs = {}, fh;
+var tt = {}, fu = {}, Ke = {}, Rt = {}, lu = {}, Fs = {}, fh;
 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;
 }
@@ -1330,8 +1330,8 @@ function ti() {
 }
 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;
+  if (hh) return Rt;
+  hh = 1, Object.defineProperty(Rt, "__esModule", { value: !0 }), Rt.SHA512_IV = Rt.SHA384_IV = Rt.SHA224_IV = Rt.SHA256_IV = Rt.HashMD = void 0, Rt.setBigUint64 = t, Rt.Chi = n, Rt.Maj = r;
   const e = /* @__PURE__ */ ti();
   function t(s, o, c, a) {
     if (typeof s.setBigUint64 == "function")
@@ -1396,7 +1396,7 @@ function Lp() {
       return this._cloneInto();
     }
   }
-  return Ut.HashMD = i, Ut.SHA256_IV = Uint32Array.from([
+  return Rt.HashMD = i, Rt.SHA256_IV = Uint32Array.from([
     1779033703,
     3144134277,
     1013904242,
@@ -1405,7 +1405,7 @@ function Lp() {
     2600822924,
     528734635,
     1541459225
-  ]), Ut.SHA224_IV = Uint32Array.from([
+  ]), Rt.SHA224_IV = Uint32Array.from([
     3238371032,
     914150663,
     812702999,
@@ -1414,7 +1414,7 @@ function Lp() {
     1750603025,
     1694076839,
     3204075428
-  ]), Ut.SHA384_IV = Uint32Array.from([
+  ]), Rt.SHA384_IV = Uint32Array.from([
     3418070365,
     3238371032,
     1654270250,
@@ -1431,7 +1431,7 @@ function Lp() {
     1694076839,
     1203062813,
     3204075428
-  ]), Ut.SHA512_IV = Uint32Array.from([
+  ]), Rt.SHA512_IV = Uint32Array.from([
     1779033703,
     4089235720,
     3144134277,
@@ -1448,7 +1448,7 @@ function Lp() {
     4215389547,
     1541459225,
     327033209
-  ]), Ut;
+  ]), Rt;
 }
 var xe = {}, dh;
 function Iw() {
@@ -4558,7 +4558,7 @@ function lo(e) {
   const t = typeof e;
   return t === "string" ? `"${e}"` : t === "number" || t === "bigint" || t === "boolean" ? `${e}` : t === "object" || t === "function" ? (e && Object.getPrototypeOf(e)?.constructor?.name) ?? "null" : t;
 }
-function Vt(e, t, n, r, i) {
+function Lt(e, t, n, r, i) {
   const s = i && "input" in i ? i.input : n.value, o = i?.expected ?? e.expects ?? null, c = i?.received ?? lo(s), a = {
     kind: e.kind,
     type: e.type,
@@ -4605,7 +4605,7 @@ function ey(e, t) {
     requirement: e,
     message: t,
     _run(n, r) {
-      return n.typed && !n.value.every(this.requirement) && Vt(this, "item", n, r), n;
+      return n.typed && !n.value.every(this.requirement) && Lt(this, "item", n, r), n;
     }
   };
 }
@@ -4619,7 +4619,7 @@ function Yf(e) {
     requirement: Number.isInteger,
     message: e,
     _run(t, n) {
-      return t.typed && !this.requirement(t.value) && Vt(this, "integer", t, n), t;
+      return t.typed && !this.requirement(t.value) && Lt(this, "integer", t, n), t;
     }
   };
 }
@@ -4633,7 +4633,7 @@ function ty(e, t) {
     requirement: e,
     message: t,
     _run(n, r) {
-      return n.typed && n.value.length !== this.requirement && Vt(this, "length", n, r, {
+      return n.typed && n.value.length !== this.requirement && Lt(this, "length", n, r, {
         received: `${n.value.length}`
       }), n;
     }
@@ -4649,7 +4649,7 @@ function Aa(e, t) {
     requirement: e,
     message: t,
     _run(n, r) {
-      return n.typed && n.value > this.requirement && Vt(this, "value", n, r, {
+      return n.typed && n.value > this.requirement && Lt(this, "value", n, r, {
         received: n.value instanceof Date ? n.value.toJSON() : lo(n.value)
       }), n;
     }
@@ -4665,7 +4665,7 @@ function va(e, t) {
     requirement: e,
     message: t,
     _run(n, r) {
-      return n.typed && n.value < this.requirement && Vt(this, "value", n, r, {
+      return n.typed && n.value < this.requirement && Lt(this, "value", n, r, {
         received: n.value instanceof Date ? n.value.toJSON() : lo(n.value)
       }), n;
     }
@@ -4681,7 +4681,7 @@ function ny(e, t) {
     requirement: e,
     message: t,
     _run(n, r) {
-      return n.typed && !this.requirement.test(n.value) && Vt(this, "format", n, r), n;
+      return n.typed && !this.requirement.test(n.value) && Lt(this, "format", n, r), n;
     }
   };
 }
@@ -4742,7 +4742,7 @@ function cn(e, t) {
           c.typed || (n.typed = !1), n.value.push(c.value);
         }
       } else
-        Vt(this, "type", n, r);
+        Lt(this, "type", n, r);
       return n;
     }
   };
@@ -4756,7 +4756,7 @@ function iy(e) {
     async: !1,
     message: e,
     _run(t, n) {
-      return typeof t.value == "bigint" ? t.typed = !0 : Vt(this, "type", t, n), t;
+      return typeof t.value == "bigint" ? t.typed = !0 : Lt(this, "type", t, n), t;
     }
   };
 }
@@ -4770,7 +4770,7 @@ function Mn(e, t) {
     check: e,
     message: t,
     _run(n, r) {
-      return this.check(n.value) ? n.typed = !0 : Vt(this, "type", n, r), n;
+      return this.check(n.value) ? n.typed = !0 : Lt(this, "type", n, r), n;
     }
   };
 }
@@ -4784,7 +4784,7 @@ function Ia(e, t) {
     class: e,
     message: t,
     _run(n, r) {
-      return n.value instanceof this.class ? n.typed = !0 : Vt(this, "type", n, r), n;
+      return n.value instanceof this.class ? n.typed = !0 : Lt(this, "type", n, r), n;
     }
   };
 }
@@ -4833,7 +4833,7 @@ function sn(e) {
     async: !1,
     message: e,
     _run(t, n) {
-      return typeof t.value == "number" && !isNaN(t.value) ? t.typed = !0 : Vt(this, "type", t, n), t;
+      return typeof t.value == "number" && !isNaN(t.value) ? t.typed = !0 : Lt(this, "type", t, n), t;
     }
   };
 }
@@ -4873,7 +4873,7 @@ function yt(e, t) {
           c.typed || (n.typed = !1), (c.value !== void 0 || s in i) && (n.value[s] = c.value);
         }
       } else
-        Vt(this, "type", n, r);
+        Lt(this, "type", n, r);
       return n;
     }
   };
@@ -4905,7 +4905,7 @@ function Li(e) {
     async: !1,
     message: e,
     _run(t, n) {
-      return typeof t.value == "string" ? t.typed = !0 : Vt(this, "type", t, n), t;
+      return typeof t.value == "string" ? t.typed = !0 : Lt(this, "type", t, n), t;
     }
   };
 }
@@ -4945,7 +4945,7 @@ function Gn(e, t) {
           c.typed || (n.typed = !1), n.value.push(c.value);
         }
       } else
-        Vt(this, "type", n, r);
+        Lt(this, "type", n, r);
       return n;
     }
   };
@@ -4991,13 +4991,13 @@ function Jf(e, t) {
       if (s) {
         if (s.length === 1)
           return s[0];
-        Vt(this, "type", n, r, {
+        Lt(this, "type", n, r, {
           issues: Ah(s)
         }), n.typed = !0;
       } else {
         if (o?.length === 1)
           return o[0];
-        Vt(this, "type", n, r, {
+        Lt(this, "type", n, r, {
           issues: Ah(o)
         });
       }
@@ -5145,7 +5145,7 @@ function wm(e) {
 function Xc(e) {
   return e instanceof Uint8Array;
 }
-function Yt(e) {
+function Zt(e) {
   if (ly(e)) return e;
   rt(ay, e);
   const t = e.reduce((i, s) => Xc(s) ? s.length === 1 && Dc(s) !== void 0 ? i + 1 : i + Qp(s.length) + s.length : i + 1, 0), n = new Uint8Array(t);
@@ -5262,7 +5262,7 @@ function Oa(e, t) {
   }
   if (Ee(i, "output", () => {
     if (e.m && i.n && e.pubkeys)
-      return Yt(
+      return Zt(
         [].concat(
           ac + e.m,
           e.pubkeys,
@@ -5284,7 +5284,7 @@ function Oa(e, t) {
       return ct(e.input).slice(1);
   }), Ee(i, "input", () => {
     if (e.signatures)
-      return Yt([rs.OP_0].concat(e.signatures));
+      return Zt([rs.OP_0].concat(e.signatures));
   }), Ee(i, "witness", () => {
     if (i.input)
       return [];
@@ -5351,7 +5351,7 @@ function hy(e, t) {
   const n = _n(() => ct(e.input)), i = { name: "p2pk", network: e.network || vn };
   if (Ee(i, "output", () => {
     if (e.pubkey)
-      return Yt([e.pubkey, Uh.OP_CHECKSIG]);
+      return Zt([e.pubkey, Uh.OP_CHECKSIG]);
   }), Ee(i, "pubkey", () => {
     if (e.output)
       return e.output.slice(1, -1);
@@ -5360,7 +5360,7 @@ function hy(e, t) {
       return n()[0];
   }), Ee(i, "input", () => {
     if (e.signature)
-      return Yt([e.signature]);
+      return Zt([e.signature]);
   }), Ee(i, "witness", () => {
     if (i.input)
       return [];
@@ -5574,7 +5574,7 @@ const Ar = /* @__PURE__ */ Uint32Array.from([
   1750603025,
   1694076839,
   3204075428
-]), Rt = /* @__PURE__ */ Uint32Array.from([
+]), Ct = /* @__PURE__ */ Uint32Array.from([
   1779033703,
   4089235720,
   3144134277,
@@ -5878,7 +5878,7 @@ const Sy = Mm([
 ].map((e) => BigInt(e))), Dm = Sy[0], Xm = Sy[1], Ir = /* @__PURE__ */ new Uint32Array(80), Or = /* @__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;
+    super(128, t, 16, !1), this.Ah = Ct[0] | 0, this.Al = Ct[1] | 0, this.Bh = Ct[2] | 0, this.Bl = Ct[3] | 0, this.Ch = Ct[4] | 0, this.Cl = Ct[5] | 0, this.Dh = Ct[6] | 0, this.Dl = Ct[7] | 0, this.Eh = Ct[8] | 0, this.El = Ct[9] | 0, this.Fh = Ct[10] | 0, this.Fl = Ct[11] | 0, this.Gh = Ct[12] | 0, this.Gl = Ct[13] | 0, this.Hh = Ct[14] | 0, this.Hl = Ct[15] | 0;
   }
   // prettier-ignore
   get() {
@@ -5912,12 +5912,12 @@ class zm extends nl {
     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;
+const pn = /* @__PURE__ */ Pa(() => new _y()), Ym = /* @__PURE__ */ Pa(() => new Gm()), Zm = /* @__PURE__ */ Pa(() => new zm()), zt = pn;
 function wr(e) {
-  return Hm(Xt(e));
+  return Hm(zt(e));
 }
 function fi(e) {
-  return Xt(Xt(e));
+  return zt(zt(e));
 }
 const Jm = {
   "BIP0340/challenge": Uint8Array.from([
@@ -6516,7 +6516,7 @@ const Jm = {
   ])
 };
 function ka(e, t) {
-  return Xt(it([Jm[e], t]));
+  return zt(it([Jm[e], t]));
 }
 function Qm(e) {
   if (e.length >= 255)
@@ -6631,7 +6631,7 @@ function tb(e) {
   };
 }
 function nb(e) {
-  return Xt(Xt(e));
+  return zt(zt(e));
 }
 const po = tb(nb), Pr = $e;
 function Wo(e, t) {
@@ -6665,7 +6665,7 @@ function Wo(e, t) {
     if (e.pubkey || s.pubkey) return wr(e.pubkey || s.pubkey);
   }), Ee(s, "output", () => {
     if (s.hash)
-      return Yt([
+      return Zt([
         Pr.OP_DUP,
         Pr.OP_HASH160,
         s.hash,
@@ -6680,7 +6680,7 @@ function Wo(e, t) {
       return r()[0];
   }), Ee(s, "input", () => {
     if (e.pubkey && e.signature)
-      return Yt([e.signature, e.pubkey]);
+      return Zt([e.signature, e.pubkey]);
   }), Ee(s, "witness", () => {
     if (s.input)
       return [];
@@ -6763,7 +6763,7 @@ function Go(e, t) {
     return {
       network: n,
       output: a === qs.OP_FALSE ? Uint8Array.from([]) : a,
-      input: Yt(c.slice(0, -1)),
+      input: Zt(c.slice(0, -1)),
       witness: e.witness || []
     };
   });
@@ -6777,13 +6777,13 @@ function Go(e, t) {
     if (r.redeem && r.redeem.output) return wr(r.redeem.output);
   }), Ee(r, "output", () => {
     if (r.hash)
-      return Yt([qs.OP_HASH160, r.hash, qs.OP_EQUAL]);
+      return Zt([qs.OP_HASH160, r.hash, qs.OP_EQUAL]);
   }), Ee(r, "redeem", () => {
     if (e.input)
       return o();
   }), Ee(r, "input", () => {
     if (!(!e.redeem || !e.redeem.input || !e.redeem.output))
-      return Yt(
+      return Zt(
         [].concat(ct(e.redeem.input), e.redeem.output)
       );
   }), Ee(r, "witness", () => {
@@ -7002,7 +7002,7 @@ function Do() {
   }
   return li.bech32 = a("bech32"), li.bech32m = a("bech32m"), li;
 }
-var qt = Do();
+var Vt = Do();
 const Lh = $e, rb = new Uint8Array(0);
 function Na(e, t) {
   if (!e.address && !e.hash && !e.output && !e.pubkey && !e.witness)
@@ -7023,7 +7023,7 @@ function Na(e, t) {
     e
   );
   const n = _n(() => {
-    const s = qt.bech32.decode(e.address), o = s.words.shift(), c = qt.bech32.fromWords(s.words);
+    const s = Vt.bech32.decode(e.address), o = s.words.shift(), c = Vt.bech32.fromWords(s.words);
     return {
       version: o,
       prefix: s.prefix,
@@ -7032,15 +7032,15 @@ function Na(e, t) {
   }), r = e.network || vn, i = { name: "p2wpkh", network: r };
   if (Ee(i, "address", () => {
     if (!i.hash) return;
-    const s = qt.bech32.toWords(i.hash);
-    return s.unshift(0), qt.bech32.encode(r.bech32, s);
+    const s = Vt.bech32.toWords(i.hash);
+    return s.unshift(0), Vt.bech32.encode(r.bech32, s);
   }), 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);
   }), Ee(i, "output", () => {
     if (i.hash)
-      return Yt([Lh.OP_0, i.hash]);
+      return Zt([Lh.OP_0, i.hash]);
   }), Ee(i, "pubkey", () => {
     if (e.pubkey) return e.pubkey;
     if (e.witness)
@@ -7126,7 +7126,7 @@ function Xo(e, t) {
     e
   );
   const n = _n(() => {
-    const o = qt.bech32.decode(e.address), c = o.words.shift(), a = qt.bech32.fromWords(o.words);
+    const o = Vt.bech32.decode(e.address), c = o.words.shift(), a = Vt.bech32.fromWords(o.words);
     return {
       version: c,
       prefix: o.prefix,
@@ -7138,15 +7138,15 @@ function Xo(e, t) {
   const s = { network: i };
   if (Ee(s, "address", () => {
     if (!s.hash) return;
-    const o = qt.bech32.toWords(s.hash);
-    return o.unshift(0), qt.bech32.encode(i.bech32, o);
+    const o = Vt.bech32.toWords(s.hash);
+    return o.unshift(0), Vt.bech32.encode(i.bech32, o);
   }), Ee(s, "hash", () => {
     if (e.output) return e.output.slice(2);
     if (e.address) return n().data;
-    if (s.redeem && s.redeem.output) return Xt(s.redeem.output);
+    if (s.redeem && s.redeem.output) return zt(s.redeem.output);
   }), Ee(s, "output", () => {
     if (s.hash)
-      return Yt([$h.OP_0, s.hash]);
+      return Zt([$h.OP_0, s.hash]);
   }), Ee(s, "redeem", () => {
     if (e.witness)
       return {
@@ -7208,7 +7208,7 @@ function Xo(e, t) {
           throw new TypeError(
             "Redeem.output unspendable with more than 201 non-push ops"
           );
-        const a = Xt(e.redeem.output);
+        const a = zt(e.redeem.output);
         if (o.length > 0 && he(o, a) !== 0)
           throw new TypeError("Hash mismatch");
         o = a;
@@ -7427,11 +7427,11 @@ function Kh(e) {
   const t = new Uint8Array(e.length);
   return t.set(e), t;
 }
-class Ht {
+class Ft {
   buffer;
   offset;
   static withCapacity(t) {
-    return new Ht(new Uint8Array(t));
+    return new Ft(new Uint8Array(t));
   }
   constructor(t, n = 0) {
     this.buffer = t, this.offset = n, rt(Gn([qe, ar]), [
@@ -7628,8 +7628,8 @@ function zo(e, t) {
   }), s = e.network || vn, o = { name: "p2tr", network: s };
   if (Ee(o, "address", () => {
     if (!o.pubkey) return;
-    const c = qt.bech32m.toWords(o.pubkey);
-    return c.unshift(Wh), qt.bech32m.encode(s.bech32, c);
+    const c = Vt.bech32m.toWords(o.pubkey);
+    return c.unshift(Wh), Vt.bech32m.encode(s.bech32, c);
   }), Ee(o, "hash", () => {
     const c = i();
     if (c) return c.hash;
@@ -7641,7 +7641,7 @@ function zo(e, t) {
     return null;
   }), Ee(o, "output", () => {
     if (o.pubkey)
-      return Yt([jh.OP_1, o.pubkey]);
+      return Zt([jh.OP_1, o.pubkey]);
   }), Ee(o, "redeemVersion", () => e.redeemVersion ? e.redeemVersion : e.redeem && e.redeem.redeemVersion !== void 0 && e.redeem.redeemVersion !== null ? e.redeem.redeemVersion : Ay), Ee(o, "redeem", () => {
     const c = r();
     if (!(!c || c.length < 2))
@@ -7800,13 +7800,13 @@ function Ny(e) {
 function il(e) {
   let t, n;
   try {
-    t = qt.bech32.decode(e);
+    t = Vt.bech32.decode(e);
   } catch {
   }
   if (t) {
     if (n = t.words[0], n !== 0) throw new TypeError(e + " uses wrong encoding");
-  } else if (t = qt.bech32m.decode(e), n = t.words[0], n === 0) throw new TypeError(e + " uses wrong encoding");
-  const r = qt.bech32.fromWords(t.words.slice(1));
+  } else if (t = Vt.bech32m.decode(e), n = t.words[0], n === 0) throw new TypeError(e + " uses wrong encoding");
+  const r = Vt.bech32.fromWords(t.words.slice(1));
   return {
     version: n,
     prefix: t.prefix,
@@ -7814,8 +7814,8 @@ function il(e) {
   };
 }
 function xb(e, t, n) {
-  const r = qt.bech32.toWords(e);
-  return r.unshift(t), t === 0 ? qt.bech32.encode(n, r) : qt.bech32m.encode(n, r);
+  const r = Vt.bech32.toWords(e);
+  return r.unshift(t), t === 0 ? Vt.bech32.encode(n, r) : Vt.bech32m.encode(n, r);
 }
 function Ab(e, t) {
   t = t || vn;
@@ -7874,7 +7874,7 @@ function Uy(e, t) {
         if (r.data.length === 32)
           return zo({ pubkey: r.data }).output;
       } else if (r.version >= Oy && r.version <= Iy && r.data.length >= By && r.data.length <= vy)
-        return console.warn(ky), Yt([
+        return console.warn(ky), Zt([
           r.version + Py,
           r.data
         ]);
@@ -8027,7 +8027,7 @@ let ht = class Ge {
       n,
       r
     ]), t >= this.ins.length) return Dh;
-    const i = Yt(
+    const i = Zt(
       ct(n).filter((c) => c !== $e.OP_CODESEPARATOR)
     ), s = this.clone();
     if ((r & 31) === Ge.SIGHASH_NONE)
@@ -8063,39 +8063,39 @@ let ht = class Ge {
     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;
     if (!u) {
-      let T = Ht.withCapacity(36 * this.ins.length);
+      let T = Ft.withCapacity(36 * this.ins.length);
       this.ins.forEach((I) => {
         T.writeSlice(I.hash), T.writeUInt32(I.index);
-      }), p = Xt(T.end()), T = Ht.withCapacity(8 * this.ins.length), r.forEach((I) => T.writeInt64(I)), y = Xt(T.end()), T = Ht.withCapacity(
+      }), p = zt(T.end()), T = Ft.withCapacity(8 * this.ins.length), r.forEach((I) => T.writeInt64(I)), y = zt(T.end()), T = Ft.withCapacity(
         n.map(Wn).reduce((I, A) => I + A)
       ), n.forEach(
         (I) => T.writeVarSlice(I)
-      ), g = Xt(T.end()), T = Ht.withCapacity(4 * this.ins.length), this.ins.forEach((I) => T.writeUInt32(I.sequence)), w = Xt(T.end());
+      ), g = zt(T.end()), T = Ft.withCapacity(4 * this.ins.length), this.ins.forEach((I) => T.writeUInt32(I.sequence)), w = zt(T.end());
     }
     if (f || l) {
       if (l && t < this.outs.length) {
-        const T = this.outs[t], I = Ht.withCapacity(
+        const T = this.outs[t], I = Ft.withCapacity(
           8 + Wn(T.script)
         );
-        I.writeInt64(T.value), I.writeVarSlice(T.script), E = Xt(I.end());
+        I.writeInt64(T.value), I.writeVarSlice(T.script), E = zt(I.end());
       }
     } else {
       if (!this.outs.length)
         throw new Error("Add outputs to the transaction before signing.");
-      const T = this.outs.map((A) => 8 + Wn(A.script)).reduce((A, U) => A + U), I = Ht.withCapacity(T);
+      const T = this.outs.map((A) => 8 + Wn(A.script)).reduce((A, U) => A + U), I = Ft.withCapacity(T);
       this.outs.forEach((A) => {
         I.writeInt64(A.value), I.writeVarSlice(A.script);
-      }), E = Xt(I.end());
+      }), E = zt(I.end());
     }
-    const S = (s ? 2 : 0) + (o ? 1 : 0), _ = 174 - (u ? 49 : 0) - (f ? 32 : 0) + (o ? 32 : 0) + (s ? 37 : 0), m = Ht.withCapacity(_);
+    const S = (s ? 2 : 0) + (o ? 1 : 0), _ = 174 - (u ? 49 : 0) - (f ? 32 : 0) + (o ? 32 : 0) + (s ? 37 : 0), m = Ft.withCapacity(_);
     if (m.writeUInt8(i), m.writeInt32(this.version), m.writeUInt32(this.locktime), m.writeSlice(p), m.writeSlice(y), m.writeSlice(g), m.writeSlice(w), f || l || m.writeSlice(E), m.writeUInt8(S), u) {
       const T = this.ins[t];
       m.writeSlice(T.hash), m.writeUInt32(T.index), m.writeInt64(r[t]), m.writeVarSlice(n[t]), m.writeUInt32(T.sequence);
     } else
       m.writeUInt32(t);
     if (o) {
-      const T = Ht.withCapacity(Wn(o));
-      T.writeVarSlice(o), m.writeSlice(Xt(T.end()));
+      const T = Ft.withCapacity(Wn(o));
+      T.writeVarSlice(o), m.writeSlice(zt(T.end()));
     }
     return l && m.writeSlice(E), s && (m.writeSlice(s), m.writeUInt8(0), m.writeUInt32(4294967295)), ka(
       "TapSighash",
@@ -8113,20 +8113,20 @@ let ht = class Ge {
       [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) => {
+    if (i & Ge.SIGHASH_ANYONECANPAY || (s = new Uint8Array(36 * this.ins.length), o = new Ft(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 = 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 Ft(s, 0), this.ins.forEach((l) => {
       o.writeUInt32(l.sequence);
     }), u = fi(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) => {
+      s = new Uint8Array(l), o = new Ft(s, 0), this.outs.forEach((p) => {
         o.writeInt64(p.value), o.writeVarSlice(p.script);
       }), c = fi(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 Ft(s, 0), o.writeInt64(l.value), o.writeVarSlice(l.script), c = fi(s);
     }
-    s = new Uint8Array(156 + Wn(n)), o = new Ht(s, 0);
+    s = new Uint8Array(156 + Wn(n)), o = new Ft(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);
   }
@@ -8153,7 +8153,7 @@ let ht = class Ge {
   }
   __toBuffer(t, n, r = !1) {
     t || (t = new Uint8Array(this.byteLength(r)));
-    const i = new Ht(t, n || 0);
+    const i = new Ft(t, n || 0);
     i.writeInt32(this.version);
     const s = r && this.hasWitnesses();
     return s && (i.writeUInt8(Ge.ADVANCED_TRANSACTION_MARKER), i.writeUInt8(Ge.ADVANCED_TRANSACTION_FLAG)), i.writeVarInt(this.ins.length), this.ins.forEach((o) => {
@@ -8980,7 +8980,7 @@ function cE(e, t) {
     outputKeyVals: w
   });
 }
-function Ct(e, t, n) {
+function Ht(e, t, n) {
   if (he(t, Uint8Array.from([n])))
     throw new Error(
       // `Format Error: Invalid ${type} key: ${keyBuf.toString('hex')}`,
@@ -8995,7 +8995,7 @@ function Vy(e, { globalMapKeyVals: t, inputKeyVals: n, outputKeyVals: r }) {
   for (const f of t)
     switch (f.key[0]) {
       case zn.UNSIGNED_TX:
-        if (Ct("global", f.key, zn.UNSIGNED_TX), s > 0)
+        if (Ht("global", f.key, zn.UNSIGNED_TX), s > 0)
           throw new Error("Format Error: GlobalMap has multiple UNSIGNED_TX");
         s++;
         break;
@@ -9011,14 +9011,14 @@ function Vy(e, { globalMapKeyVals: t, inputKeyVals: n, outputKeyVals: r }) {
     for (const p of n[f])
       switch (gt.checkPubkey(p), p.key[0]) {
         case ye.NON_WITNESS_UTXO:
-          if (Ct("input", p.key, ye.NON_WITNESS_UTXO), l.nonWitnessUtxo !== void 0)
+          if (Ht("input", p.key, ye.NON_WITNESS_UTXO), l.nonWitnessUtxo !== void 0)
             throw new Error(
               "Format Error: Input has multiple NON_WITNESS_UTXO"
             );
           l.nonWitnessUtxo = gt.nonWitnessUtxo.decode(p);
           break;
         case ye.WITNESS_UTXO:
-          if (Ct("input", p.key, ye.WITNESS_UTXO), l.witnessUtxo !== void 0)
+          if (Ht("input", p.key, ye.WITNESS_UTXO), l.witnessUtxo !== void 0)
             throw new Error("Format Error: Input has multiple WITNESS_UTXO");
           l.witnessUtxo = gt.witnessUtxo.decode(p);
           break;
@@ -9026,17 +9026,17 @@ function Vy(e, { globalMapKeyVals: t, inputKeyVals: n, outputKeyVals: r }) {
           l.partialSig === void 0 && (l.partialSig = []), l.partialSig.push(gt.partialSig.decode(p));
           break;
         case ye.SIGHASH_TYPE:
-          if (Ct("input", p.key, ye.SIGHASH_TYPE), l.sighashType !== void 0)
+          if (Ht("input", p.key, ye.SIGHASH_TYPE), l.sighashType !== void 0)
             throw new Error("Format Error: Input has multiple SIGHASH_TYPE");
           l.sighashType = gt.sighashType.decode(p);
           break;
         case ye.REDEEM_SCRIPT:
-          if (Ct("input", p.key, ye.REDEEM_SCRIPT), l.redeemScript !== void 0)
+          if (Ht("input", p.key, ye.REDEEM_SCRIPT), l.redeemScript !== void 0)
             throw new Error("Format Error: Input has multiple REDEEM_SCRIPT");
           l.redeemScript = gt.redeemScript.decode(p);
           break;
         case ye.WITNESS_SCRIPT:
-          if (Ct("input", p.key, ye.WITNESS_SCRIPT), l.witnessScript !== void 0)
+          if (Ht("input", p.key, ye.WITNESS_SCRIPT), l.witnessScript !== void 0)
             throw new Error("Format Error: Input has multiple WITNESS_SCRIPT");
           l.witnessScript = gt.witnessScript.decode(p);
           break;
@@ -9046,18 +9046,18 @@ function Vy(e, { globalMapKeyVals: t, inputKeyVals: n, outputKeyVals: r }) {
           );
           break;
         case ye.FINAL_SCRIPTSIG:
-          Ct("input", p.key, ye.FINAL_SCRIPTSIG), l.finalScriptSig = gt.finalScriptSig.decode(p);
+          Ht("input", p.key, ye.FINAL_SCRIPTSIG), l.finalScriptSig = gt.finalScriptSig.decode(p);
           break;
         case ye.FINAL_SCRIPTWITNESS:
-          Ct("input", p.key, ye.FINAL_SCRIPTWITNESS), l.finalScriptWitness = gt.finalScriptWitness.decode(
+          Ht("input", p.key, ye.FINAL_SCRIPTWITNESS), l.finalScriptWitness = gt.finalScriptWitness.decode(
             p
           );
           break;
         case ye.POR_COMMITMENT:
-          Ct("input", p.key, ye.POR_COMMITMENT), l.porCommitment = gt.porCommitment.decode(p);
+          Ht("input", p.key, ye.POR_COMMITMENT), l.porCommitment = gt.porCommitment.decode(p);
           break;
         case ye.TAP_KEY_SIG:
-          Ct("input", p.key, ye.TAP_KEY_SIG), l.tapKeySig = gt.tapKeySig.decode(p);
+          Ht("input", p.key, ye.TAP_KEY_SIG), l.tapKeySig = gt.tapKeySig.decode(p);
           break;
         case ye.TAP_SCRIPT_SIG:
           l.tapScriptSig === void 0 && (l.tapScriptSig = []), l.tapScriptSig.push(gt.tapScriptSig.decode(p));
@@ -9071,10 +9071,10 @@ function Vy(e, { globalMapKeyVals: t, inputKeyVals: n, outputKeyVals: r }) {
           );
           break;
         case ye.TAP_INTERNAL_KEY:
-          Ct("input", p.key, ye.TAP_INTERNAL_KEY), l.tapInternalKey = gt.tapInternalKey.decode(p);
+          Ht("input", p.key, ye.TAP_INTERNAL_KEY), l.tapInternalKey = gt.tapInternalKey.decode(p);
           break;
         case ye.TAP_MERKLE_ROOT:
-          Ct("input", p.key, ye.TAP_MERKLE_ROOT), l.tapMerkleRoot = gt.tapMerkleRoot.decode(p);
+          Ht("input", p.key, ye.TAP_MERKLE_ROOT), l.tapMerkleRoot = gt.tapMerkleRoot.decode(p);
           break;
         default:
           l.unknownKeyVals || (l.unknownKeyVals = []), l.unknownKeyVals.push(p);
@@ -9086,12 +9086,12 @@ function Vy(e, { globalMapKeyVals: t, inputKeyVals: n, outputKeyVals: r }) {
     for (const p of r[f])
       switch (ur.checkPubkey(p), p.key[0]) {
         case ft.REDEEM_SCRIPT:
-          if (Ct("output", p.key, ft.REDEEM_SCRIPT), l.redeemScript !== void 0)
+          if (Ht("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);
           break;
         case ft.WITNESS_SCRIPT:
-          if (Ct("output", p.key, ft.WITNESS_SCRIPT), l.witnessScript !== void 0)
+          if (Ht("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);
           break;
@@ -9101,10 +9101,10 @@ function Vy(e, { globalMapKeyVals: t, inputKeyVals: n, outputKeyVals: r }) {
           );
           break;
         case ft.TAP_INTERNAL_KEY:
-          Ct("output", p.key, ft.TAP_INTERNAL_KEY), l.tapInternalKey = ur.tapInternalKey.decode(p);
+          Ht("output", p.key, ft.TAP_INTERNAL_KEY), l.tapInternalKey = ur.tapInternalKey.decode(p);
           break;
         case ft.TAP_TREE:
-          Ct("output", p.key, ft.TAP_TREE), l.tapTree = ur.tapTree.decode(p);
+          Ht("output", p.key, ft.TAP_TREE), l.tapTree = ur.tapTree.decode(p);
           break;
         case ft.TAP_BIP32_DERIVATION:
           l.tapBip32Derivation === void 0 && (l.tapBip32Derivation = []), l.tapBip32Derivation.push(
@@ -9215,7 +9215,7 @@ function Zi(e) {
     t.add(r);
   }), t;
 }
-function Bt(e, t) {
+function It(e, t) {
   const n = e[t];
   if (n === void 0) throw new Error(`No input #${t}`);
   return n;
@@ -9282,7 +9282,7 @@ function al(e) {
 }
 const hE = al("global"), Ly = al("input"), $y = al("output");
 function dE(e, t) {
-  const n = e.length - 1, r = Bt(e, n);
+  const n = e.length - 1, r = It(e, n);
   Ly(t, r);
 }
 function pE(e, t) {
@@ -9322,7 +9322,7 @@ let Zh = class {
     return hE(t, this.globalMap), this;
   }
   updateInput(t, n) {
-    const r = Bt(this.inputs, t);
+    const r = It(this.inputs, t);
     return Ly(n, r), this;
   }
   updateOutput(t, n) {
@@ -9337,7 +9337,7 @@ let Zh = class {
     ), this.globalMap.unknownKeyVals || (this.globalMap.unknownKeyVals = []), this.globalMap.unknownKeyVals.push(t), this;
   }
   addUnknownKeyValToInput(t, n) {
-    const r = Bt(this.inputs, t);
+    const r = It(this.inputs, t);
     return xu(n, r.unknownKeyVals, Au(ye)), r.unknownKeyVals || (r.unknownKeyVals = []), r.unknownKeyVals.push(n), this;
   }
   addUnknownKeyValToOutput(t, n) {
@@ -9367,7 +9367,7 @@ let Zh = class {
     ), pE(this.outputs, t), this;
   }
   clearFinalizedInput(t) {
-    const n = Bt(this.inputs, t);
+    const n = It(this.inputs, t);
     lE(t, n);
     for (const r of Object.keys(n))
       [
@@ -9794,10 +9794,10 @@ class Jc {
     return od("__FEE", "fee", this.data.inputs, this.__CACHE);
   }
   finalizeAllInputs() {
-    return Bt(this.data.inputs, 0), Ls(this.data.inputs.length).forEach((t) => this.finalizeInput(t)), this;
+    return It(this.data.inputs, 0), Ls(this.data.inputs.length).forEach((t) => this.finalizeInput(t)), this;
   }
   finalizeInput(t, n) {
-    const r = Bt(this.data.inputs, t);
+    const r = It(this.data.inputs, t);
     return kn(r) ? this._finalizeTaprootInput(
       t,
       r,
@@ -9806,7 +9806,7 @@ class Jc {
     ) : this._finalizeInput(t, r, n);
   }
   finalizeTaprootInput(t, n, r = Qh) {
-    const i = Bt(this.data.inputs, t);
+    const i = It(this.data.inputs, t);
     if (kn(i))
       return this._finalizeTaprootInput(
         t,
@@ -9858,7 +9858,7 @@ class Jc {
     return this.data.clearFinalizedInput(t), this;
   }
   getInputType(t) {
-    const n = Bt(this.data.inputs, t), r = rg(t, n, this.__CACHE), i = Ha(
+    const n = It(this.data.inputs, t), r = rg(t, n, this.__CACHE), i = Ha(
       r,
       t,
       "input",
@@ -9868,11 +9868,11 @@ class Jc {
     return s + o;
   }
   inputHasPubkey(t, n) {
-    const r = Bt(this.data.inputs, t);
+    const r = It(this.data.inputs, t);
     return YE(n, r, t, this.__CACHE);
   }
   inputHasHDKey(t, n) {
-    const r = Bt(this.data.inputs, t), i = rd(n);
+    const r = It(this.data.inputs, t), i = rd(n);
     return !!r.bip32Derivation && r.bip32Derivation.some(i);
   }
   outputHasPubkey(t, n) {
@@ -9884,7 +9884,7 @@ class Jc {
     return !!r.bip32Derivation && r.bip32Derivation.some(i);
   }
   validateSignaturesOfAllInputs(t) {
-    return Bt(this.data.inputs, 0), Ls(this.data.inputs.length).map(
+    return It(this.data.inputs, 0), Ls(this.data.inputs.length).map(
       (r) => this.validateSignaturesOfInput(r, t)
     ).reduce((r, i) => i === !0 && r, !0);
   }
@@ -10057,7 +10057,7 @@ class Jc {
   signInput(t, n, r) {
     if (!n || !n.publicKey)
       throw new Error("Need Signer to sign input");
-    const i = Bt(this.data.inputs, t);
+    const i = It(this.data.inputs, t);
     return kn(i) ? this._signTaprootInput(
       t,
       i,
@@ -10069,7 +10069,7 @@ class Jc {
   signTaprootInput(t, n, r, i) {
     if (!n || !n.publicKey)
       throw new Error("Need Signer to sign input");
-    const s = Bt(this.data.inputs, t);
+    const s = It(this.data.inputs, t);
     if (kn(s))
       return this._signTaprootInput(
         t,
@@ -10121,7 +10121,7 @@ class Jc {
     return Promise.resolve().then(() => {
       if (!n || !n.publicKey)
         throw new Error("Need Signer to sign input");
-      const i = Bt(this.data.inputs, t);
+      const i = It(this.data.inputs, t);
       return kn(i) ? this._signTaprootInputAsync(
         t,
         i,
@@ -10135,7 +10135,7 @@ class Jc {
     return Promise.resolve().then(() => {
       if (!n || !n.publicKey)
         throw new Error("Need Signer to sign input");
-      const s = Bt(this.data.inputs, t);
+      const s = It(this.data.inputs, t);
       if (kn(s))
         return this._signTaprootInputAsync(
           t,
@@ -10417,7 +10417,7 @@ function jE(e, t, n, r, i, s) {
   };
 }
 function cd(e, t, n, r, i) {
-  const s = Bt(e, t), { hash: o, sighashType: c, script: a } = Jy(
+  const s = It(e, t), { hash: o, sighashType: c, script: a } = Jy(
     t,
     s,
     r,
@@ -10621,7 +10621,7 @@ function DE(e, t, n) {
   return (t.witnessScript || Ua(i.script)) && (i.isSegwit = !0), i;
 }
 function ud(e, t, n) {
-  const r = Bt(t, e);
+  const r = It(t, e);
   if (!r.bip32Derivation || r.bip32Derivation.length === 0)
     throw new Error("Need bip32Derivation to sign with HD");
   const i = r.bip32Derivation.map((o) => {
@@ -13546,14 +13546,14 @@ self instanceof WorkerGlobalScope && typeof self.importScripts == "function", dS
   hasStandardBrowserWebWorkerEnv: hS,
   navigator: Pf,
   origin: dS
-}, Symbol.toStringTag, { value: "Module" })), Ft = {
+}, Symbol.toStringTag, { value: "Module" })), Mt = {
   ...pS,
   ...fS
 };
 function yS(e, t) {
-  return ja(e, new Ft.classes.URLSearchParams(), {
+  return ja(e, new Mt.classes.URLSearchParams(), {
     visitor: function(n, r, i, s) {
-      return Ft.isNode && z.isBuffer(n) ? (this.append(r, n.toString("base64")), !1) : s.defaultVisitor.apply(this, arguments);
+      return Mt.isNode && z.isBuffer(n) ? (this.append(r, n.toString("base64")), !1) : s.defaultVisitor.apply(this, arguments);
     },
     ...t
   });
@@ -13648,8 +13648,8 @@ const Qo = {
   maxContentLength: -1,
   maxBodyLength: -1,
   env: {
-    FormData: Ft.classes.FormData,
-    Blob: Ft.classes.Blob
+    FormData: Mt.classes.FormData,
+    Blob: Mt.classes.Blob
   },
   validateStatus: function(t) {
     return t >= 200 && t < 300;
@@ -13949,10 +13949,10 @@ const na = (e, t, n = 3) => {
     total: e,
     loaded: r
   }), t[1]];
-}, md = (e) => (...t) => z.asap(() => e(...t)), IS = Ft.hasStandardBrowserEnv ? /* @__PURE__ */ ((e, t) => (n) => (n = new URL(n, Ft.origin), e.protocol === n.protocol && e.host === n.host && (t || e.port === n.port)))(
-  new URL(Ft.origin),
-  Ft.navigator && /(msie|trident)/i.test(Ft.navigator.userAgent)
-) : () => !0, OS = Ft.hasStandardBrowserEnv ? (
+}, md = (e) => (...t) => z.asap(() => e(...t)), IS = Mt.hasStandardBrowserEnv ? /* @__PURE__ */ ((e, t) => (n) => (n = new URL(n, Mt.origin), e.protocol === n.protocol && e.host === n.host && (t || e.port === n.port)))(
+  new URL(Mt.origin),
+  Mt.navigator && /(msie|trident)/i.test(Mt.navigator.userAgent)
+) : () => !0, OS = Mt.hasStandardBrowserEnv ? (
   // Standard browser envs support document.cookie
   {
     write(e, t, n, r, i, s) {
@@ -14063,14 +14063,14 @@ const o1 = (e) => {
   );
   let a;
   if (z.isFormData(n)) {
-    if (Ft.hasStandardBrowserEnv || Ft.hasStandardBrowserWebWorkerEnv)
+    if (Mt.hasStandardBrowserEnv || Mt.hasStandardBrowserWebWorkerEnv)
       o.setContentType(void 0);
     else if ((a = o.getContentType()) !== !1) {
       const [u, ...f] = a ? a.split(";").map((l) => l.trim()).filter(Boolean) : [];
       o.setContentType([u || "multipart/form-data", ...f].join("; "));
     }
   }
-  if (Ft.hasStandardBrowserEnv && (r && z.isFunction(r) && (r = r(t)), r || r !== !1 && IS(t.url))) {
+  if (Mt.hasStandardBrowserEnv && (r && z.isFunction(r) && (r = r(t)), r || r !== !1 && IS(t.url))) {
     const u = i && s && OS.read(s);
     u && o.set(i, u);
   }
@@ -14126,7 +14126,7 @@ const o1 = (e) => {
       E && (r(!m || m.type ? new Ns(null, e, E) : m), E.abort(), E = null);
     }, i.cancelToken && i.cancelToken.subscribe(f), i.signal && (i.signal.aborted ? f() : i.signal.addEventListener("abort", f)));
     const _ = AS(i.url);
-    if (_ && Ft.protocols.indexOf(_) === -1) {
+    if (_ && Mt.protocols.indexOf(_) === -1) {
       r(new Ie("Unsupported protocol " + _ + ":", Ie.ERR_BAD_REQUEST, e));
       return;
     }
@@ -14220,7 +14220,7 @@ const o1 = (e) => {
   }
 }, qS = c1 && a1(() => {
   let e = !1;
-  const t = new Request(Ft.origin, {
+  const t = new Request(Mt.origin, {
     body: new ReadableStream(),
     method: "POST",
     get duplex() {
@@ -14244,7 +14244,7 @@ const VS = async (e) => {
   if (z.isBlob(e))
     return e.size;
   if (z.isSpecCompliantForm(e))
-    return (await new Request(Ft.origin, {
+    return (await new Request(Mt.origin, {
       method: "POST",
       body: e
     }).arrayBuffer()).byteLength;
@@ -15735,11 +15735,11 @@ function Yn(e) {
 function Ao(e) {
   return Sn(e), T1(Qe(Uint8Array.from(e).reverse()));
 }
-function It(e, t) {
+function Ot(e, t) {
   return jo(e.toString(16).padStart(t * 2, "0"));
 }
 function x1(e, t) {
-  return It(e, t).reverse();
+  return Ot(e, t).reverse();
 }
 function en(e, t, n) {
   let r;
@@ -15809,7 +15809,7 @@ function Bo(e) {
   };
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const on = BigInt(0), kt = BigInt(1), Ii = /* @__PURE__ */ BigInt(2), B1 = /* @__PURE__ */ BigInt(3), I1 = /* @__PURE__ */ BigInt(4), O1 = /* @__PURE__ */ BigInt(5), k3 = /* @__PURE__ */ BigInt(7), P1 = /* @__PURE__ */ BigInt(8), N3 = /* @__PURE__ */ BigInt(9), k1 = /* @__PURE__ */ BigInt(16);
+const on = BigInt(0), Nt = BigInt(1), Ii = /* @__PURE__ */ BigInt(2), B1 = /* @__PURE__ */ BigInt(3), I1 = /* @__PURE__ */ BigInt(4), O1 = /* @__PURE__ */ BigInt(5), k3 = /* @__PURE__ */ BigInt(7), P1 = /* @__PURE__ */ BigInt(8), N3 = /* @__PURE__ */ BigInt(9), k1 = /* @__PURE__ */ BigInt(16);
 function dt(e, t) {
   const n = e % t;
   return n >= on ? n : t + n;
@@ -15825,12 +15825,12 @@ function kd(e, t) {
     throw new Error("invert: expected non-zero number");
   if (t <= on)
     throw new Error("invert: expected positive modulus, got " + t);
-  let n = dt(e, t), r = t, i = on, s = kt;
+  let n = dt(e, t), r = t, i = on, s = Nt;
   for (; n !== on; ) {
     const c = r / n, a = r % n, u = i - s * c;
     r = n, n = a, i = s, s = u;
   }
-  if (r !== kt)
+  if (r !== Nt)
     throw new Error("invert: does not exist");
   return dt(i, t);
 }
@@ -15839,7 +15839,7 @@ function Vl(e, t, n) {
     throw new Error("Cannot find square root");
 }
 function N1(e, t) {
-  const n = (e.ORDER + kt) / I1, r = e.pow(t, n);
+  const n = (e.ORDER + Nt) / I1, r = e.pow(t, n);
   return Vl(e, r, t), r;
 }
 function U3(e, t) {
@@ -15859,7 +15859,7 @@ function R3(e) {
 function U1(e) {
   if (e < B1)
     throw new Error("sqrt is not defined for small field");
-  let t = e - kt, n = 0;
+  let t = e - Nt, n = 0;
   for (; t % Ii === on; )
     t /= Ii, n++;
   let r = Ii;
@@ -15870,7 +15870,7 @@ function U1(e) {
   if (n === 1)
     return N1;
   let s = i.pow(r, t);
-  const o = (t + kt) / Ii;
+  const o = (t + Nt) / Ii;
   return function(a, u) {
     if (a.is0(u))
       return u;
@@ -15884,7 +15884,7 @@ function U1(e) {
       for (; !a.eql(w, a.ONE); )
         if (g++, w = a.sqr(w), g === f)
           throw new Error("Cannot find square root");
-      const E = kt << BigInt(f - g - 1), S = a.pow(l, E);
+      const E = Nt << BigInt(f - g - 1), S = a.pow(l, E);
       f = g, l = a.sqr(S), p = a.mul(p, l), y = a.mul(y, S);
     }
     return y;
@@ -15893,7 +15893,7 @@ function U1(e) {
 function C3(e) {
   return e % I1 === B1 ? N1 : e % P1 === O1 ? U3 : e % k1 === N3 ? R3(e) : U1(e);
 }
-const H3 = (e, t) => (dt(e, t) & kt) === kt, F3 = [
+const H3 = (e, t) => (dt(e, t) & Nt) === Nt, F3 = [
   "create",
   "isValid",
   "is0",
@@ -15926,11 +15926,11 @@ function Qa(e, t, n) {
     throw new Error("invalid exponent, negatives unsupported");
   if (n === on)
     return e.ONE;
-  if (n === kt)
+  if (n === Nt)
     return t;
   let r = e.ONE, i = t;
   for (; n > on; )
-    n & kt && (r = e.mul(r, i)), i = e.sqr(i), n >>= kt;
+    n & Nt && (r = e.mul(r, i)), i = e.sqr(i), n >>= Nt;
   return r;
 }
 function Gi(e, t, n = !1) {
@@ -15938,7 +15938,7 @@ function Gi(e, t, n = !1) {
   return t.reduceRight((o, c, a) => e.is0(c) ? o : (r[a] = e.mul(o, r[a]), e.mul(o, c)), s), r;
 }
 function da(e, t) {
-  const n = (e.ORDER - kt) / Ii, r = e.pow(t, n), i = e.eql(r, e.ONE), s = e.eql(r, e.ZERO), o = e.eql(r, e.neg(e.ONE));
+  const n = (e.ORDER - Nt) / Ii, r = e.pow(t, n), i = e.eql(r, e.ONE), s = e.eql(r, e.ZERO), o = e.eql(r, e.neg(e.ONE));
   if (!i && !s && !o)
     throw new Error("invalid Legendre symbol result");
   return i ? 1 : s ? 0 : -1;
@@ -15970,7 +15970,7 @@ function ci(e, t, n = !1, r = {}) {
     BYTES: u,
     MASK: Wi(a),
     ZERO: on,
-    ONE: kt,
+    ONE: Nt,
     allowedLengths: c,
     create: (p) => dt(p, e),
     isValid: (p) => {
@@ -15981,7 +15981,7 @@ function ci(e, t, n = !1, r = {}) {
     is0: (p) => p === on,
     // is valid and invertible
     isValidNot0: (p) => !l.is0(p) && l.isValid(p),
-    isOdd: (p) => (p & kt) === kt,
+    isOdd: (p) => (p & Nt) === Nt,
     neg: (p) => dt(-p, e),
     eql: (p, y) => p === y,
     sqr: (p) => dt(p * p, e),
@@ -15997,7 +15997,7 @@ function ci(e, t, n = !1, r = {}) {
     mulN: (p, y) => p * y,
     inv: (p) => kd(p, e),
     sqrt: s || ((p) => (f || (f = C3(e)), f(l, p))),
-    toBytes: (p) => n ? x1(p, u) : It(p, u),
+    toBytes: (p) => n ? x1(p, u) : Ot(p, u),
     fromBytes: (p, y = !0) => {
       if (c) {
         if (!c.includes(p.length) || p.length > u)
@@ -16034,8 +16034,8 @@ function q3(e, t, n = !1) {
   const r = e.length, i = C1(t), s = H1(t);
   if (r < 16 || r < s || r > 1024)
     throw new Error("expected " + s + "-1024 bytes of input, got " + r);
-  const o = n ? Ao(e) : Yn(e), c = dt(o, t - kt) + kt;
-  return n ? x1(c, i) : It(c, i);
+  const o = n ? Ao(e) : Yn(e), c = dt(o, t - Nt) + Nt;
+  return n ? x1(c, i) : Ot(c, i);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const xs = BigInt(0), Oi = BigInt(1);
@@ -16360,12 +16360,12 @@ function X3(e, t, n) {
   let u = e - c * r - a * s, f = -c * i - a * o;
   const l = u < Pi, p = f < Pi;
   l && (u = -u), p && (f = -f);
-  const y = Wi(Math.ceil(vo(n) / 2)) + Dt;
+  const y = Wi(Math.ceil(vo(n) / 2)) + Xt;
   if (u < Pi || u >= y || f < Pi || f >= y)
     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), Xt = BigInt(1), cr = BigInt(2), os = BigInt(3), Mf = BigInt(4);
 function ya(e, t) {
   const { BYTES: n } = e;
   let r;
@@ -16621,7 +16621,7 @@ function z3(e, t = {}) {
         throw new Error("invalid scalar: out of range");
       if (H === Pi || N.is0())
         return v.ZERO;
-      if (H === Dt)
+      if (H === Xt)
         return N;
       if (V.hasCache(this))
         return this.multiply(H);
@@ -16648,11 +16648,11 @@ function z3(e, t = {}) {
      */
     isTorsionFree() {
       const { isTorsionFree: H } = t;
-      return o === Dt ? !0 : H ? H(v, this) : V.unsafe(this, c).is0();
+      return o === Xt ? !0 : H ? H(v, this) : V.unsafe(this, c).is0();
     }
     clearCofactor() {
       const { clearCofactor: H } = t;
-      return o === Dt ? this : H ? H(v, this) : this.multiplyUnsafe(o);
+      return o === Xt ? this : H ? H(v, this) : this.multiplyUnsafe(o);
     }
     isSmallOrder() {
       return this.multiplyUnsafe(o).is0();
@@ -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)
-    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);
+  for (let g = n - Xt; g % cr === Pi; g /= cr)
+    r += Xt;
+  const i = r, s = cr << i - Xt - Xt, o = s * cr, c = (n - Xt) / o, a = (c - Xt) / cr, u = o - Xt, f = s, l = e.pow(t, c), p = e.pow(t, (c + Xt) / cr);
   let y = (g, w) => {
     let E = l, S = e.pow(w, u), _ = e.sqr(S);
     _ = e.mul(_, w);
@@ -16714,9 +16714,9 @@ function Z3(e, t) {
     m = e.pow(T, f);
     let I = e.eql(m, e.ONE);
     S = e.mul(_, p), m = e.mul(T, E), _ = e.cmov(S, _, I), T = e.cmov(m, T, I);
-    for (let A = i; A > Dt; A--) {
+    for (let A = i; A > Xt; A--) {
       let U = A - cr;
-      U = cr << U - Dt;
+      U = cr << U - Xt;
       let M = e.pow(T, U);
       const v = e.eql(M, e.ONE);
       S = e.mul(_, E), E = e.mul(E, E), M = e.mul(T, E), _ = e.cmov(S, _, v), T = e.cmov(M, T, v);
@@ -16807,7 +16807,7 @@ function eT(e, t, n) {
 function tT(e, t) {
   const { Fp: n, Fn: r } = t;
   function i(o) {
-    return A1(o, Dt, r.ORDER);
+    return A1(o, Xt, r.ORDER);
   }
   const s = eT(n, e.a, e.b);
   return Object.assign({}, {
@@ -17086,7 +17086,7 @@ 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), pr = BigInt(1), Yt = 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++) {
@@ -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 - pr) / Ld), i = t.pow(n, (e.ORDER - pr) / Yt);
   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 ** Yt - pr) / Ld), c = t.pow(n, (e.ORDER ** Yt - pr) / Yt);
   if (!t.eql(c, t.neg(t.ONE)))
     throw new Error("psiFrobenius: PSI2_Y!==-1");
   function a(p, y) {
@@ -17127,7 +17127,7 @@ class cT {
   constructor(t, n = {}) {
     this.MASK = pr;
     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 = $d(t, n.FP2_NONRESIDUE), this.FROBENIUS_COEFFICIENTS = Ll(t, this.Fp_NONRESIDUE, t.ORDER, 2)[0], this.mulByB = n.Fp2mulByB, Object.seal(this);
+    this.Fp = t, this.ORDER = i, this.BITS = vo(i), this.BYTES = Math.ceil(vo(i) / 8), this.isLE = t.isLE, this.ZERO = { c0: t.ZERO, c1: t.ZERO }, this.ONE = { c0: t.ONE, c1: t.ZERO }, this.Fp_NONRESIDUE = t.create(n.NONRESIDUE || BigInt(-1)), this.Fp_div2 = t.div(t.ONE, Yt), this.NONRESIDUE = $d(t, n.FP2_NONRESIDUE), this.FROBENIUS_COEFFICIENTS = Ll(t, this.Fp_NONRESIDUE, t.ORDER, 2)[0], this.mulByB = n.Fp2mulByB, Object.seal(this);
   }
   fromBigTuple(t) {
     return $d(this.Fp, t);
@@ -17223,7 +17223,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;
+    const { re: n, im: r } = this.reim(t), i = n % Yt, s = n === Vd, o = r % Yt;
     return BigInt(i || s && o) == pr;
   }
   // Bytes util
@@ -17307,7 +17307,7 @@ class aT {
   }
   sqr({ c0: t, c1: n, c2: r }) {
     const { Fp2: i } = this;
-    let s = i.sqr(t), o = i.mul(i.mul(t, n), zt), c = i.mul(i.mul(n, r), zt), a = i.sqr(r);
+    let s = i.sqr(t), o = i.mul(i.mul(t, n), Yt), c = i.mul(i.mul(n, r), Yt), a = i.sqr(r);
     return {
       c0: i.add(i.mulByNonresidue(c), s),
       // T3 * (u + 1) + T0
@@ -17630,19 +17630,19 @@ class uT {
     const { Fp6: r } = this, { Fp2: i } = r, { c0: s, c1: o, c2: c } = t, { c0: a, c1: u, c2: f } = n, { first: l, second: p } = i.Fp4Square(s, u), { first: y, second: g } = i.Fp4Square(a, c), { first: w, second: E } = i.Fp4Square(o, f), S = i.mulByNonresidue(E);
     return {
       c0: r.create({
-        c0: i.add(i.mul(i.sub(l, s), zt), l),
+        c0: i.add(i.mul(i.sub(l, s), Yt), l),
         // 2 * (T3 - c0c0)  + T3
-        c1: i.add(i.mul(i.sub(y, o), zt), y),
+        c1: i.add(i.mul(i.sub(y, o), Yt), y),
         // 2 * (T5 - c0c1)  + T5
-        c2: i.add(i.mul(i.sub(w, c), zt), w)
+        c2: i.add(i.mul(i.sub(w, c), Yt), w)
       }),
       // 2 * (T7 - c0c2)  + T7
       c1: r.create({
-        c0: i.add(i.mul(i.add(S, a), zt), S),
+        c0: i.add(i.mul(i.add(S, a), Yt), S),
         // 2 * (T9 + c1c0) + T9
-        c1: i.add(i.mul(i.add(p, u), zt), p),
+        c1: i.add(i.mul(i.add(p, u), Yt), p),
         // 2 * (T4 + c1c1) + T4
-        c2: i.add(i.mul(i.add(g, f), zt), g)
+        c2: i.add(i.mul(i.add(g, f), Yt), g)
       })
     };
   }
@@ -17659,11 +17659,11 @@ function fT(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 qt = BigInt(0), ga = BigInt(1), An = BigInt(2), eu = BigInt(3), Oo = BigInt(4), zr = BigInt("0xd201000000010000"), lT = vo(zr), Vi = {
   p: BigInt("0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab"),
   n: BigInt("0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001"),
   h: BigInt("0x396c8c005555e1568c00aaab0000aaab"),
-  a: Mt,
+  a: qt,
   b: Oo,
   Gx: BigInt("0x17f1d3a73197d7942695638c4fa9ac0fc3688c4f9774b905a14e3a3f171bac586c55e83ff97a1aeffb3af00adb22c6bb"),
   Gy: BigInt("0x08b3f481e3aaa0f1a09e30ed741d8ae4fcf5e095d5d00af600db18cb2c04b3edd03cc744a2888ae40caa232946c5e7e1")
@@ -17706,7 +17706,7 @@ const Mt = BigInt(0), ga = BigInt(1), An = BigInt(2), eu = BigInt(3), Oo = BigIn
     BigInt("0x0ce5d527727d6e118cc9cdc6da2e351aadfd9baa8cbdd3a76d429a695160d12c923ac9cc3baca289e193548608b82801"),
     BigInt("0x0606c4a02ea734cc32acd2b02bc28b99cb3e287e85a763af267492ab572e99ab3f370d275cec1da1aaa9075ff05f79be")
   ])
-}, tu = rc(me.toBytes(Mt), { infinity: !0, compressed: !0 });
+}, tu = rc(me.toBytes(qt), { infinity: !0, compressed: !0 });
 function nu(e) {
   e = e.slice();
   const t = e[0] & 224, n = !!(t >> 7 & 1), r = !!(t >> 6 & 1), i = !!(t >> 5 & 1);
@@ -17723,9 +17723,9 @@ function yT(e, t, n) {
     if (s)
       return tu.slice();
     const a = !!(c * An / i);
-    return rc(It(o, r), { compressed: !0, sort: a });
+    return rc(Ot(o, r), { compressed: !0, sort: a });
   } else
-    return s ? Me(Uint8Array.of(64), new Uint8Array(2 * r - 1)) : Me(It(o, r), It(c, r));
+    return s ? Me(Uint8Array.of(64), new Uint8Array(2 * r - 1)) : Me(Ot(o, r), Ot(c, r));
 }
 function ju(e) {
   e.assertValidity();
@@ -17733,16 +17733,16 @@ function ju(e) {
   if (e.is0())
     return tu.slice();
   const s = !!(i * An / n);
-  return rc(It(r, t), { compressed: !0, sort: s });
+  return rc(Ot(r, t), { compressed: !0, sort: s });
 }
 function gT(e) {
   const { compressed: t, infinity: n, sort: r, value: i } = nu(e), { BYTES: s, ORDER: o } = me;
   if (i.length === 48 && t) {
     const c = Yn(i), a = me.create(c & Wi(me.BITS));
     if (n) {
-      if (a !== Mt)
+      if (a !== qt)
         throw new Error("invalid G1 point: non-empty, at infinity, with compression");
-      return { x: Mt, y: Mt };
+      return { x: qt, y: qt };
     }
     const u = me.add(me.pow(a, eu), me.create(Vi.b));
     let f = me.sqrt(u);
@@ -17752,7 +17752,7 @@ function gT(e) {
   } else if (i.length === 96 && !t) {
     const c = Yn(i.subarray(0, s)), a = Yn(i.subarray(s));
     if (n) {
-      if (c !== Mt || a !== Mt)
+      if (c !== qt || a !== qt)
         throw new Error("G1: non-empty point at infinity");
       return ru.G1.Point.ZERO.toAffine();
     }
@@ -17777,23 +17777,23 @@ function wT(e, t, n) {
   const { BYTES: r, ORDER: i } = me, s = t.is0(), { x: o, y: c } = t.toAffine();
   if (n) {
     if (s)
-      return Me(tu, It(Mt, r));
-    const a = !!(c.c1 === Mt ? c.c0 * An / i : c.c1 * An / i);
-    return Me(rc(It(o.c1, r), { compressed: !0, sort: a }), It(o.c0, r));
+      return Me(tu, Ot(qt, r));
+    const a = !!(c.c1 === qt ? c.c0 * An / i : c.c1 * An / i);
+    return Me(rc(Ot(o.c1, r), { compressed: !0, sort: a }), Ot(o.c0, r));
   } else {
     if (s)
       return Me(Uint8Array.of(64), new Uint8Array(4 * r - 1));
     const { re: a, im: u } = Pe.reim(o), { re: f, im: l } = Pe.reim(c);
-    return Me(It(u, r), It(a, r), It(l, r), It(f, r));
+    return Me(Ot(u, r), Ot(a, r), Ot(l, r), Ot(f, r));
   }
 }
 function Wu(e) {
   e.assertValidity();
   const { BYTES: t } = me;
   if (e.is0())
-    return Me(tu, It(Mt, t));
-  const { x: n, y: r } = e.toAffine(), { re: i, im: s } = Pe.reim(n), { re: o, im: c } = Pe.reim(r), u = !!((c > Mt ? c * An : o * An) / me.ORDER & ga), f = i;
-  return Me(rc(It(s, t), { sort: u, compressed: !0 }), It(f, t));
+    return Me(tu, Ot(qt, t));
+  const { x: n, y: r } = e.toAffine(), { re: i, im: s } = Pe.reim(n), { re: o, im: c } = Pe.reim(r), u = !!((c > qt ? c * An : o * An) / me.ORDER & ga), f = i;
+  return Me(rc(Ot(s, t), { sort: u, compressed: !0 }), Ot(f, t));
 }
 function mT(e) {
   const { BYTES: t, ORDER: n } = me, { compressed: r, infinity: i, sort: s, value: o } = nu(e);
@@ -17810,7 +17810,7 @@ function mT(e) {
     }
     const a = c(o, 0, t), u = c(o, t, 2 * t), f = Pe.create({ c0: me.create(u), c1: me.create(a) }), l = Pe.add(Pe.pow(f, eu), $l.b);
     let p = Pe.sqrt(l);
-    const y = p.c1 === Mt ? p.c0 * An / n : p.c1 * An / n ? ga : Mt;
+    const y = p.c1 === qt ? p.c0 * An / n : p.c1 * An / n ? ga : qt;
     return p = s && y > 0 ? p : Pe.neg(p), { x: f, y: p };
   } else if (o.length === 192 && !r) {
     if (i) {
@@ -17834,7 +17834,7 @@ function Wd(e) {
   let y = Pe.sqrt(p);
   if (!y)
     throw new Error("Failed to find a square root");
-  const { re: g, im: w } = Pe.reim(y), E = BigInt(r), S = w > Mt && w * An / t !== E, _ = w === Mt && g * An / t !== E;
+  const { re: g, im: w } = Pe.reim(y), E = BigInt(r), S = w > qt && w * An / t !== E, _ = w === qt && g * An / t !== E;
   (S || _) && (y = Pe.neg(y));
   const m = s.fromAffine({ x: l, y });
   return m.assertValidity(), m;
@@ -18085,7 +18085,7 @@ const ru = sT({
   B: me.create(BigInt("0x12e2908d11688030018b12e8753eee3b2016c1f0f24f4070a0b9c14fcef35ef55a23215a316ceaa5d1cc48e98e172be0")),
   Z: me.create(BigInt(11))
 }), ST = j1(Pe, {
-  A: Pe.create({ c0: me.create(Mt), c1: me.create(BigInt(240)) }),
+  A: Pe.create({ c0: me.create(qt), c1: me.create(BigInt(240)) }),
   // A' = 240 * I
   B: Pe.create({ c0: me.create(BigInt(1012)), c1: me.create(BigInt(1012)) }),
   // B' = 1012 * (1 + I)
@@ -18108,10 +18108,10 @@ const vT = BigInt(1e6), W1 = (e) => xt(new Ps(e)), Kl = (e) => {
   const n = W1(e) / vT;
   return new Date(Number(n));
 }, Gd = 60 * 1e3, BT = 60, IT = 24, OT = IT * BT, PT = 5, kT = 5, NT = 30 * OT;
-var Ot;
+var Pt;
 (function(e) {
   e[e.Empty = 0] = "Empty", e[e.Fork = 1] = "Fork", e[e.Labeled = 2] = "Labeled", e[e.Leaf = 3] = "Leaf", e[e.Pruned = 4] = "Pruned";
-})(Ot || (Ot = {}));
+})(Pt || (Pt = {}));
 function UT(e, t) {
   for (let n = 0; n < e.length; n++)
     if (e[n] > t[n])
@@ -18216,15 +18216,15 @@ function yn(e) {
 }
 async function Vc(e) {
   switch (e[0]) {
-    case Ot.Empty:
+    case Pt.Empty:
       return pn(so("ic-hashtree-empty"));
-    case Ot.Pruned:
+    case Pt.Pruned:
       return e[1];
-    case Ot.Leaf:
+    case Pt.Leaf:
       return pn(Me(so("ic-hashtree-leaf"), e[1]));
-    case Ot.Labeled:
+    case Pt.Labeled:
       return pn(Me(so("ic-hashtree-labeled"), e[1], await Vc(e[2])));
-    case Ot.Fork:
+    case Pt.Fork:
       return pn(Me(so("ic-hashtree-fork"), await Vc(e[1]), await Vc(e[2])));
     default:
       throw hs;
@@ -18252,11 +18252,11 @@ var nt;
 function ic(e, t) {
   if (e.length === 0)
     switch (t[0]) {
-      case Ot.Empty:
+      case Pt.Empty:
         return {
           status: En.Absent
         };
-      case Ot.Leaf: {
+      case Pt.Leaf: {
         if (!t[1])
           throw rn.fromCode(new ec("Invalid tree structure for leaf"));
         if (t[1] instanceof Uint8Array)
@@ -18266,12 +18266,12 @@ function ic(e, t) {
           };
         throw hs;
       }
-      case Ot.Pruned:
+      case Pt.Pruned:
         return {
           status: En.Unknown
         };
-      case Ot.Labeled:
-      case Ot.Fork:
+      case Pt.Labeled:
+      case Pt.Fork:
         return {
           status: En.Error
         };
@@ -18322,9 +18322,9 @@ function jl(e, t) {
 }
 function qf(e) {
   switch (e[0]) {
-    case Ot.Empty:
+    case Pt.Empty:
       return [];
-    case Ot.Fork:
+    case Pt.Fork:
       return qf(e[1]).concat(qf(e[2]));
     default:
       return [e];
@@ -18334,7 +18334,7 @@ function fo(e, t) {
   switch (t[0]) {
     // if we have a labelled node, compare the node's label to the one we are
     // looking for
-    case Ot.Labeled:
+    case Pt.Labeled:
       return UT(e, t[1]) ? {
         status: nt.Greater
       } : Ja(e, t[1]) ? {
@@ -18344,7 +18344,7 @@ function fo(e, t) {
         status: nt.Less
       };
     // if we have a fork node, we need to search both sides, starting with the left
-    case Ot.Fork: {
+    case Pt.Fork: {
       const n = fo(e, t[1]);
       switch (n.status) {
         // if the label we're searching for is greater than the left node lookup,
@@ -18373,7 +18373,7 @@ function fo(e, t) {
     }
     // if we encounter a Pruned node, we can't know for certain if the label
     // we're searching for is present or not
-    case Ot.Pruned:
+    case Pt.Pruned:
       return {
         status: nt.Unknown
       };
@@ -18932,7 +18932,7 @@ const JT = ci(X1.p, { isLE: !0 }), QT = {
   // Constant-time, u/√v
   uvRatio: ZT
 }, e8 = WT(QT);
-var Yd, Zd, vt, ws;
+var Yd, Zd, Bt, ws;
 class t8 {
   /**
    * Create a new ExpirableMap.
@@ -18942,19 +18942,19 @@ class t8 {
    */
   constructor(t = {}) {
     // Internals
-    Jt(this, vt);
-    Jt(this, ws);
+    Qt(this, Bt);
+    Qt(this, ws);
     this[Yd] = this.entries.bind(this), this[Zd] = "ExpirableMap";
     const { source: n = [], expirationTime: r = 600 * 1e3 } = t, i = Date.now();
-    Kt(this, vt, new Map([...n].map(([s, o]) => [s, { value: o, timestamp: i }]))), Kt(this, ws, r);
+    jt(this, Bt, new Map([...n].map(([s, o]) => [s, { value: o, timestamp: i }]))), jt(this, ws, r);
   }
   /**
    * Prune removes all expired entries.
    */
   prune() {
     const t = Date.now();
-    for (const [n, r] of Ue(this, vt).entries())
-      t - r.timestamp > Ue(this, ws) && Ue(this, vt).delete(n);
+    for (const [n, r] of Ue(this, Bt).entries())
+      t - r.timestamp > Ue(this, ws) && Ue(this, Bt).delete(n);
     return this;
   }
   // Implementing the Map interface
@@ -18970,7 +18970,7 @@ class t8 {
       value: n,
       timestamp: Date.now()
     };
-    return Ue(this, vt).set(t, r), this;
+    return Ue(this, Bt).set(t, r), this;
   }
   /**
    * Get the value associated with the key, if it exists and has not expired.
@@ -18978,10 +18978,10 @@ class t8 {
    * @returns the value associated with the key, or undefined if the key is not present or has expired.
    */
   get(t) {
-    const n = Ue(this, vt).get(t);
+    const n = Ue(this, Bt).get(t);
     if (n !== void 0) {
       if (Date.now() - n.timestamp > Ue(this, ws)) {
-        Ue(this, vt).delete(t);
+        Ue(this, Bt).delete(t);
         return;
       }
       return n.value;
@@ -18991,14 +18991,14 @@ class t8 {
    * Clear all entries.
    */
   clear() {
-    Ue(this, vt).clear();
+    Ue(this, Bt).clear();
   }
   /**
    * Entries returns the entries of the map, without the expiration time.
    * @returns an iterator over the entries of the map.
    */
   entries() {
-    const t = Ue(this, vt).entries();
+    const t = Ue(this, Bt).entries();
     return function* () {
       for (const [r, i] of t)
         yield [r, i.value];
@@ -19009,7 +19009,7 @@ class t8 {
    * @returns an iterator over the values of the map.
    */
   values() {
-    const t = Ue(this, vt).values();
+    const t = Ue(this, Bt).values();
     return function* () {
       for (const r of t)
         yield r.value;
@@ -19020,7 +19020,7 @@ class t8 {
    * @returns an iterator over the keys of the map.
    */
   keys() {
-    return Ue(this, vt).keys();
+    return Ue(this, Bt).keys();
   }
   /**
    * forEach calls the callbackfn on each entry of the map.
@@ -19028,7 +19028,7 @@ class t8 {
    * @param thisArg to use as this when calling the callbackfn
    */
   forEach(t, n) {
-    for (const [r, i] of Ue(this, vt).entries())
+    for (const [r, i] of Ue(this, Bt).entries())
       t.call(n, i.value, r, this);
   }
   /**
@@ -19037,7 +19037,7 @@ class t8 {
    * @returns true if the key exists and has not expired.
    */
   has(t) {
-    return Ue(this, vt).has(t);
+    return Ue(this, Bt).has(t);
   }
   /**
    * delete the entry for the given key.
@@ -19045,17 +19045,17 @@ class t8 {
    * @returns true if the key existed and has been deleted.
    */
   delete(t) {
-    return Ue(this, vt).delete(t);
+    return Ue(this, Bt).delete(t);
   }
   /**
    * get size of the map.
    * @returns the size of the map.
    */
   get size() {
-    return Ue(this, vt).size;
+    return Ue(this, Bt).size;
   }
 }
-vt = new WeakMap(), ws = new WeakMap(), Yd = Symbol.iterator, Zd = Symbol.toStringTag;
+Bt = new WeakMap(), ws = new WeakMap(), Yd = Symbol.iterator, Zd = Symbol.toStringTag;
 const Jd = (e) => {
   if (e <= 127)
     return 1;
@@ -19207,11 +19207,11 @@ var ko, No;
 const Ai = class Ai {
   // `fromRaw` and `fromDer` should be used for instantiation, not this constructor.
   constructor(t) {
-    Jt(this, ko);
-    Jt(this, No);
+    Qt(this, ko);
+    Qt(this, No);
     if (t.byteLength !== Ai.RAW_KEY_LENGTH)
       throw Ye.fromCode(new Sr("An Ed25519 public key must be exactly 32 bytes long"));
-    Kt(this, ko, t), Kt(this, No, Ai.derEncode(t));
+    jt(this, ko, t), jt(this, No, Ai.derEncode(t));
   }
   static from(t) {
     return this.fromDer(t.toDer());
@@ -19278,17 +19278,17 @@ const t0 = 0.5, n0 = 1.5, r0 = 500, i0 = 6e4, s0 = 9e5, o0 = 10;
 var Pn, Uo, Ro, Co, Ho, Fo, Mo, qo, ms;
 const xa = class xa {
   constructor(t = xa.default) {
-    Jt(this, Pn);
-    Jt(this, Uo);
-    Jt(this, Ro);
-    Jt(this, Co);
-    Jt(this, Ho);
-    Jt(this, Fo);
-    Jt(this, Mo);
-    Jt(this, qo);
-    Jt(this, ms, 0);
+    Qt(this, Pn);
+    Qt(this, Uo);
+    Qt(this, Ro);
+    Qt(this, Co);
+    Qt(this, Ho);
+    Qt(this, Fo);
+    Qt(this, Mo);
+    Qt(this, qo);
+    Qt(this, ms, 0);
     const { initialInterval: n = r0, randomizationFactor: r = t0, multiplier: i = n0, maxInterval: s = i0, maxElapsedTime: o = s0, maxIterations: c = o0, date: a = Date } = t;
-    Kt(this, Pn, n), Kt(this, Uo, r), Kt(this, Ro, i), Kt(this, Co, s), Kt(this, qo, a), Kt(this, Ho, a.now()), Kt(this, Fo, o), Kt(this, Mo, c);
+    jt(this, Pn, n), jt(this, Uo, r), jt(this, Ro, i), jt(this, Co, s), jt(this, qo, a), jt(this, Ho, a.now()), jt(this, Fo, o), jt(this, Mo, c);
   }
   get ellapsedTimeInMsec() {
     return Ue(this, qo).now() - Ue(this, Ho);
@@ -19304,7 +19304,7 @@ const xa = class xa {
     return Math.random() * (r - n) + n;
   }
   incrementCurrentInterval() {
-    return Kt(this, Pn, Math.min(Ue(this, Pn) * Ue(this, Ro), Ue(this, Co))), sh(this, ms)._++, Ue(this, Pn);
+    return jt(this, Pn, Math.min(Ue(this, Pn) * Ue(this, Ro), Ue(this, Co))), sh(this, ms)._++, Ue(this, Pn);
   }
   next() {
     return this.ellapsedTimeInMsec >= Ue(this, Fo) || Ue(this, ms) >= Ue(this, Mo) ? null : (this.incrementCurrentInterval(), this.randomValueFromInterval);
@@ -20249,7 +20249,7 @@ function P8(e, t, n, r) {
   const s = (...o) => i({}, ...o);
   return s.withOptions = (o) => (...c) => i(o, ...c), s;
 }
-const Gt = {
+const Dt = {
   P2PKH: { P2PKH: null },
   P2SH_P2WPKH: { P2SH_P2WPKH: null },
   P2WPKH: { P2WPKH: null },
@@ -20258,7 +20258,7 @@ const Gt = {
   P2TR: { P2TR: null },
   UNKNOWN: { UNKNOWN: null }
 };
-var hi = {}, je = {}, Yu = {}, jt = {}, tr = {}, a0;
+var hi = {}, je = {}, Yu = {}, Wt = {}, tr = {}, a0;
 function Vn() {
   return a0 || (a0 = 1, Object.defineProperty(tr, "__esModule", { value: !0 }), tr.testnet = tr.regtest = tr.bitcoin = void 0, tr.bitcoin = {
     /**
@@ -20937,7 +20937,7 @@ function R8() {
   return u.compile = a, u.TfTypeError = r, u.TfPropertyTypeError = i, rf = u, rf;
 }
 var w0;
-function $t() {
+function Kt() {
   return w0 || (w0 = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.oneOf = e.Null = e.BufferN = e.Function = e.UInt32 = e.UInt8 = e.tuple = e.maybe = e.Hex = e.Buffer = e.String = e.Boolean = e.Array = e.Number = e.Hash256bit = e.Hash160bit = e.Buffer256bit = e.isTaptree = e.isTapleaf = e.TAPLEAF_VERSION_MASK = e.Satoshi = e.isPoint = e.stacksEqual = e.typeforce = void 0;
     const t = Vo();
@@ -20979,7 +20979,7 @@ var m0;
 function C8() {
   if (m0) return yi;
   m0 = 1, Object.defineProperty(yi, "__esModule", { value: !0 }), yi.encode = yi.decode = void 0;
-  const e = Q1(), t = Zt(), n = $t(), { typeforce: r } = n, i = Buffer.alloc(1, 0);
+  const e = Q1(), t = Jt(), n = Kt(), { typeforce: r } = n, i = Buffer.alloc(1, 0);
   function s(u) {
     let f = 0;
     for (; u[f] === 0; ) ++f;
@@ -21015,7 +21015,7 @@ function C8() {
   return yi.encode = a, yi;
 }
 var b0;
-function Zt() {
+function Jt() {
   return b0 || (b0 = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.signature = e.number = e.isCanonicalScriptSignature = e.isDefinedHashType = e.isCanonicalPubKey = e.toStack = e.fromASM = e.toASM = e.decompile = e.compile = e.countNonPushOnlyOPs = e.isPushOnly = e.OPS = void 0;
     const t = Q1(), n = Gl();
@@ -21025,7 +21025,7 @@ function Zt() {
         return n.OPS;
       }
     });
-    const r = k8(), i = N8(), s = C8(), o = $t(), { typeforce: c } = o, a = n.OPS.OP_RESERVED;
+    const r = k8(), i = N8(), s = C8(), o = Kt(), { typeforce: c } = o, a = n.OPS.OP_RESERVED;
     function u(v) {
       return o.Number(v) && (v === n.OPS.OP_0 || v >= n.OPS.OP_1 && v <= n.OPS.OP_16 || v === n.OPS.OP_1NEGATE);
     }
@@ -21166,7 +21166,7 @@ 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 = $t(), r = ai(), i = t.OPS;
+  const e = Vn(), t = Jt(), n = Kt(), r = ai(), 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 = $t(), r = ai(), i = t.OPS, s = i.OP_RESERVED;
+  const e = Vn(), t = Jt(), n = Kt(), r = ai(), 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 = $t(), r = ai(), i = t.OPS;
+  const e = Vn(), t = Jt(), n = Kt(), r = ai(), 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,10 +21359,10 @@ function M8() {
   }
   return Xs.p2pk = s, Xs;
 }
-var zs = {}, sf = {}, wi = {}, Wt = {}, x0;
+var zs = {}, sf = {}, wi = {}, Gt = {}, 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;
+  if (x0) return Gt;
+  x0 = 1, Object.defineProperty(Gt, "__esModule", { value: !0 }), Gt.ripemd160 = Gt.RIPEMD160 = Gt.md5 = Gt.MD5 = Gt.sha1 = Gt.SHA1 = void 0;
   const e = /* @__PURE__ */ Lp(), t = /* @__PURE__ */ ti(), n = /* @__PURE__ */ Uint32Array.from([
     1732584193,
     4023233417,
@@ -21402,7 +21402,7 @@ function tw() {
       this.set(0, 0, 0, 0, 0), (0, t.clean)(this.buffer);
     }
   }
-  Wt.SHA1 = i, Wt.sha1 = (0, t.createHasher)(() => new i());
+  Gt.SHA1 = i, Gt.sha1 = (0, t.createHasher)(() => new i());
   const s = /* @__PURE__ */ Math.pow(2, 32), o = /* @__PURE__ */ Array.from({ length: 64 }, (M, v) => Math.floor(s * Math.abs(Math.sin(v + 1)))), c = /* @__PURE__ */ n.slice(0, 4), a = /* @__PURE__ */ new Uint32Array(16);
   class u extends e.HashMD {
     constructor() {
@@ -21432,7 +21432,7 @@ function tw() {
       this.set(0, 0, 0, 0), (0, t.clean)(this.buffer);
     }
   }
-  Wt.MD5 = u, Wt.md5 = (0, t.createHasher)(() => new u());
+  Gt.MD5 = u, Gt.md5 = (0, t.createHasher)(() => new u());
   const f = /* @__PURE__ */ Uint8Array.from([
     7,
     4,
@@ -21514,7 +21514,7 @@ function tw() {
       this.destroyed = !0, (0, t.clean)(this.buffer), this.set(0, 0, 0, 0, 0);
     }
   }
-  return Wt.RIPEMD160 = U, Wt.ripemd160 = (0, t.createHasher)(() => new U()), Wt;
+  return Gt.RIPEMD160 = U, Gt.ripemd160 = (0, t.createHasher)(() => new U()), Gt;
 }
 var A0;
 function q8() {
@@ -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 = $t(), i = ai(), s = Xl(), o = n.OPS;
+  const e = xr(), t = Vn(), n = Jt(), r = Kt(), i = ai(), 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 = $t(), i = ai(), s = Xl(), o = n.OPS;
+  const e = xr(), t = Vn(), n = Jt(), r = Kt(), i = ai(), 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 = $t(), i = ai(), s = Do(), o = n.OPS, c = Buffer.alloc(0);
+  const e = xr(), t = Vn(), n = Jt(), r = Kt(), i = ai(), 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 = $t(), i = ai(), s = Do(), o = n.OPS, c = Buffer.alloc(0);
+  const e = xr(), t = Vn(), n = Jt(), r = Kt(), i = ai(), 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));
   }
@@ -22933,7 +22933,7 @@ var V0;
 function iu() {
   if (V0) return At;
   V0 = 1, Object.defineProperty(At, "__esModule", { value: !0 }), At.BufferReader = At.BufferWriter = At.cloneBuffer = At.reverseBuffer = At.writeUInt64LE = At.readUInt64LE = At.varuint = void 0;
-  const e = $t(), { typeforce: t } = e, n = z8();
+  const e = Kt(), { typeforce: t } = e, n = z8();
   At.varuint = n;
   function r(f, l) {
     if (typeof f != "number")
@@ -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 = $t();
+    const t = Vo(), n = zl(), r = xr(), 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 $0;
 function Y8() {
   if ($0) return Qs;
   $0 = 1, Object.defineProperty(Qs, "__esModule", { value: !0 }), Qs.p2tr = void 0;
-  const e = Vo(), t = Vn(), n = Zt(), r = $t(), i = zl(), s = Yl(), o = ai(), c = Do(), a = Zl(), u = n.OPS, f = 1, l = 80;
+  const e = Vo(), t = Vn(), n = Jt(), r = Kt(), i = zl(), s = Yl(), o = ai(), 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");
@@ -23397,9 +23397,9 @@ function sc() {
 }
 var j0;
 function Zl() {
-  if (j0) return jt;
-  j0 = 1, Object.defineProperty(jt, "__esModule", { value: !0 }), jt.toOutputScript = jt.fromOutputScript = jt.toBech32 = jt.toBase58Check = jt.fromBech32 = jt.fromBase58Check = void 0;
-  const e = Vn(), t = sc(), n = Zt(), r = $t(), i = Do(), s = Xl(), o = 40, c = 2, a = 16, u = 2, f = 80, l = "WARNING: Sending to a future segwit version address can lead to loss of funds. End users MUST be warned carefully in the GUI and asked if they wish to proceed with caution. Wallets should verify the segwit version from the output of fromBech32, then decide when it is safe to use which version of segwit.";
+  if (j0) return Wt;
+  j0 = 1, Object.defineProperty(Wt, "__esModule", { value: !0 }), Wt.toOutputScript = Wt.fromOutputScript = Wt.toBech32 = Wt.toBase58Check = Wt.fromBech32 = Wt.fromBase58Check = void 0;
+  const e = Vn(), t = sc(), n = Jt(), r = Kt(), i = Do(), s = Xl(), o = 40, c = 2, a = 16, u = 2, f = 80, l = "WARNING: Sending to a future segwit version address can lead to loss of funds. End users MUST be warned carefully in the GUI and asked if they wish to proceed with caution. Wallets should verify the segwit version from the output of fromBech32, then decide when it is safe to use which version of segwit.";
   function p(m, T) {
     const I = m.slice(2);
     if (I.length < c || I.length > o)
@@ -23418,7 +23418,7 @@ function Zl() {
     const I = T.readUInt8(0), A = T.slice(1);
     return { version: I, hash: A };
   }
-  jt.fromBase58Check = y;
+  Wt.fromBase58Check = y;
   function g(m) {
     let T, I;
     try {
@@ -23435,7 +23435,7 @@ function Zl() {
       data: Buffer.from(A)
     };
   }
-  jt.fromBech32 = g;
+  Wt.fromBech32 = g;
   function w(m, T) {
     (0, r.typeforce)(
       (0, r.tuple)(r.Hash160bit, r.UInt8),
@@ -23444,12 +23444,12 @@ function Zl() {
     const I = Buffer.allocUnsafe(21);
     return I.writeUInt8(T, 0), m.copy(I, 1), s.encode(I);
   }
-  jt.toBase58Check = w;
+  Wt.toBase58Check = w;
   function E(m, T, I) {
     const A = i.bech32.toWords(m);
     return A.unshift(T), T === 0 ? i.bech32.encode(I, A) : i.bech32m.encode(I, A);
   }
-  jt.toBech32 = E;
+  Wt.toBech32 = E;
   function S(m, T) {
     T = T || e.bitcoin;
     try {
@@ -23478,7 +23478,7 @@ function Zl() {
     }
     throw new Error(n.toASM(m) + " has no matching Address");
   }
-  jt.fromOutputScript = S;
+  Wt.fromOutputScript = S;
   function _(m, T) {
     T = T || e.bitcoin;
     let I, A;
@@ -23516,7 +23516,7 @@ function Zl() {
     }
     throw new Error(m + " has no matching Script");
   }
-  return jt.toOutputScript = _, jt;
+  return Wt.toOutputScript = _, Wt;
 }
 var eo = {}, to = {}, W0;
 function Z8() {
@@ -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 = $t(), { typeforce: s } = i;
+  const e = iu(), t = xr(), n = Jt(), r = Jt(), i = Kt(), { typeforce: s } = i;
   function o(E) {
     const S = E.length;
     return e.varuint.encodingLength(S) + S;
@@ -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 = $t(), { typeforce: s } = i, o = new TypeError(
+  const e = iu(), t = xr(), 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"
@@ -23964,7 +23964,7 @@ function J8() {
   return eo;
 }
 var ro = {}, Tc = {}, xc = {}, hf = {}, Qi = {}, es = {}, df = {}, X0;
-function Nt() {
+function Ut() {
   return X0 || (X0 = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), (function(t) {
       t[t.UNSIGNED_TX = 0] = "UNSIGNED_TX", t[t.GLOBAL_XPUB = 1] = "GLOBAL_XPUB";
@@ -24003,7 +24003,7 @@ var Nr = {}, z0;
 function Q8() {
   if (z0) return Nr;
   z0 = 1, Object.defineProperty(Nr, "__esModule", { value: !0 });
-  const e = Nt(), t = (o) => [...Array(o).keys()];
+  const e = Ut(), t = (o) => [...Array(o).keys()];
   function n(o) {
     if (o.key[0] !== e.GlobalTypes.GLOBAL_XPUB)
       throw new Error(
@@ -24058,7 +24058,7 @@ var Ac = {}, Y0;
 function ex() {
   if (Y0) return Ac;
   Y0 = 1, Object.defineProperty(Ac, "__esModule", { value: !0 });
-  const e = Nt();
+  const e = Ut();
   function t(n) {
     return {
       key: Buffer.from([e.GlobalTypes.UNSIGNED_TX]),
@@ -24071,7 +24071,7 @@ var Ur = {}, Z0;
 function tx() {
   if (Z0) return Ur;
   Z0 = 1, Object.defineProperty(Ur, "__esModule", { value: !0 });
-  const e = Nt();
+  const e = Ut();
   function t(s) {
     if (s.key[0] !== e.InputTypes.FINAL_SCRIPTSIG)
       throw new Error(
@@ -24100,7 +24100,7 @@ var Rr = {}, J0;
 function nx() {
   if (J0) return Rr;
   J0 = 1, Object.defineProperty(Rr, "__esModule", { value: !0 });
-  const e = Nt();
+  const e = Ut();
   function t(s) {
     if (s.key[0] !== e.InputTypes.FINAL_SCRIPTWITNESS)
       throw new Error(
@@ -24129,7 +24129,7 @@ var Cr = {}, Q0;
 function rx() {
   if (Q0) return Cr;
   Q0 = 1, Object.defineProperty(Cr, "__esModule", { value: !0 });
-  const e = Nt();
+  const e = Ut();
   function t(s) {
     if (s.key[0] !== e.InputTypes.NON_WITNESS_UTXO)
       throw new Error(
@@ -24158,7 +24158,7 @@ var Hr = {}, ep;
 function ix() {
   if (ep) return Hr;
   ep = 1, Object.defineProperty(Hr, "__esModule", { value: !0 });
-  const e = Nt();
+  const e = Ut();
   function t(o) {
     if (o.key[0] !== e.InputTypes.PARTIAL_SIG)
       throw new Error(
@@ -24203,7 +24203,7 @@ var Fr = {}, tp;
 function sx() {
   if (tp) return Fr;
   tp = 1, Object.defineProperty(Fr, "__esModule", { value: !0 });
-  const e = Nt();
+  const e = Ut();
   function t(s) {
     if (s.key[0] !== e.InputTypes.POR_COMMITMENT)
       throw new Error(
@@ -24232,7 +24232,7 @@ var Mr = {}, np;
 function ox() {
   if (np) return Mr;
   np = 1, Object.defineProperty(Mr, "__esModule", { value: !0 });
-  const e = Nt();
+  const e = Ut();
   function t(s) {
     if (s.key[0] !== e.InputTypes.SIGHASH_TYPE)
       throw new Error(
@@ -24262,7 +24262,7 @@ var qr = {}, rp;
 function cx() {
   if (rp) return qr;
   rp = 1, Object.defineProperty(qr, "__esModule", { value: !0 });
-  const e = Nt();
+  const e = Ut();
   function t(s) {
     if (s.key[0] !== e.InputTypes.TAP_KEY_SIG || s.key.length !== 1)
       throw new Error(
@@ -24292,7 +24292,7 @@ var Vr = {}, ip;
 function ax() {
   if (ip) return Vr;
   ip = 1, Object.defineProperty(Vr, "__esModule", { value: !0 });
-  const e = Nt();
+  const e = Ut();
   function t(s) {
     if (s.key[0] !== e.InputTypes.TAP_LEAF_SCRIPT)
       throw new Error(
@@ -24333,7 +24333,7 @@ var Lr = {}, sp;
 function ux() {
   if (sp) return Lr;
   sp = 1, Object.defineProperty(Lr, "__esModule", { value: !0 });
-  const e = Nt();
+  const e = Ut();
   function t(s) {
     if (s.key[0] !== e.InputTypes.TAP_MERKLE_ROOT || s.key.length !== 1)
       throw new Error(
@@ -24361,7 +24361,7 @@ var $r = {}, op;
 function fx() {
   if (op) return $r;
   op = 1, Object.defineProperty($r, "__esModule", { value: !0 });
-  const e = Nt();
+  const e = Ut();
   function t(s) {
     if (s.key[0] !== e.InputTypes.TAP_SCRIPT_SIG)
       throw new Error(
@@ -24491,7 +24491,7 @@ var up;
 function lx() {
   if (up) return Kr;
   up = 1, Object.defineProperty(Kr, "__esModule", { value: !0 });
-  const e = Nt(), t = Jl(), n = Di();
+  const e = Ut(), t = Jl(), n = Di();
   function r(c) {
     if (c.key[0] !== e.InputTypes.WITNESS_UTXO)
       throw new Error(
@@ -24531,7 +24531,7 @@ var jr = {}, fp;
 function hx() {
   if (fp) return jr;
   fp = 1, Object.defineProperty(jr, "__esModule", { value: !0 });
-  const e = Nt(), t = Di();
+  const e = Ut(), t = Di();
   function n(o) {
     if (o.key[0] !== e.OutputTypes.TAP_TREE || o.key.length !== 1)
       throw new Error(
@@ -24802,7 +24802,7 @@ var wp;
 function Ql() {
   if (wp) return es;
   wp = 1, Object.defineProperty(es, "__esModule", { value: !0 });
-  const e = Nt(), t = Q8(), n = ex(), r = tx(), i = nx(), s = rx(), o = ix(), c = sx(), a = ox(), u = cx(), f = ax(), l = ux(), p = fx(), y = lx(), g = hx(), w = rw(), E = dx(), S = px(), _ = yx(), m = gx(), T = wx(), I = {
+  const e = Ut(), t = Q8(), n = ex(), r = tx(), i = nx(), s = rx(), o = ix(), c = sx(), a = ox(), u = cx(), f = ax(), l = ux(), p = fx(), y = lx(), g = hx(), w = rw(), E = dx(), S = px(), _ = yx(), m = gx(), T = wx(), I = {
     unsignedTx: n,
     globalXpub: t,
     // pass an Array of key bytes that require pubkey beside the key
@@ -24869,7 +24869,7 @@ var mp;
 function mx() {
   if (mp) return Qi;
   mp = 1, Object.defineProperty(Qi, "__esModule", { value: !0 });
-  const e = Ql(), t = Jl(), n = Di(), r = Nt();
+  const e = Ql(), t = Jl(), n = Di(), r = Ut();
   function i(c, a) {
     let u = 0;
     function f() {
@@ -25381,7 +25381,7 @@ var Tp;
 function _x() {
   if (Tp) return Tc;
   Tp = 1, Object.defineProperty(Tc, "__esModule", { value: !0 });
-  const e = Ex(), t = iw(), n = Nt(), r = sw();
+  const e = Ex(), t = iw(), n = Ut(), r = sw();
   class i {
     constructor(o) {
       this.inputs = [], this.outputs = [], this.globalMap = {
@@ -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 = Jt(), n = oc(), r = xr(), i = sc();
   function s(y) {
     return (g) => {
       try {
@@ -25569,7 +25569,7 @@ var Ap;
 function Sx() {
   if (Ap) return ze;
   Ap = 1, Object.defineProperty(ze, "__esModule", { value: !0 }), ze.checkTaprootInputForSigs = ze.tapTreeFromList = ze.tapTreeToList = ze.tweakInternalPubKey = ze.checkTaprootOutputFields = ze.checkTaprootInputFields = ze.isTaprootOutput = ze.isTaprootInput = ze.serializeTaprootSignature = ze.tapScriptFinalizer = ze.toXOnly = void 0;
-  const e = $t(), t = oc(), n = Wf(), r = Yl(), i = sc(), s = Wf(), o = (x) => x.length === 32 ? x : x.slice(1, 33);
+  const e = Kt(), t = oc(), n = Wf(), r = Yl(), i = sc(), s = Wf(), o = (x) => x.length === 32 ? x : x.slice(1, 33);
   ze.toXOnly = o;
   function c(x, O, q) {
     const P = N(
@@ -25793,7 +25793,7 @@ var vp;
 function Tx() {
   if (vp) return ro;
   vp = 1, Object.defineProperty(ro, "__esModule", { value: !0 }), ro.Psbt = void 0;
-  const e = _x(), t = Di(), n = sw(), r = Zl(), i = iu(), s = Vn(), o = sc(), c = Yl(), a = Zt(), u = oc(), f = Sx(), l = Wf(), p = {
+  const e = _x(), t = Di(), n = sw(), r = Zl(), i = iu(), s = Vn(), o = sc(), c = Yl(), a = Jt(), u = oc(), f = Sx(), l = Wf(), p = {
     /**
      * A bitcoinjs Network object. This is only used if you pass an `address`
      * parameter to addOutput. Otherwise it is not needed and can be left default.
@@ -27004,7 +27004,7 @@ function xx() {
     e.networks = r;
     const i = sc();
     e.payments = i;
-    const s = Zt();
+    const s = Jt();
     e.script = s;
     var o = J8();
     Object.defineProperty(e, "Block", {
@@ -27707,18 +27707,18 @@ function ba(e, t = Fa.Testnet) {
 }
 function Zr(e) {
   const t = vn, n = Wp, r = Mw;
-  let i, s, o = Gt.UNKNOWN;
+  let i, s, o = Dt.UNKNOWN;
   if (e.startsWith("bc1") || e.startsWith("tb1") || e.startsWith("bcrt1"))
     try {
-      return s = il(e), s.version === 0 ? s.data.length === 20 ? o = Gt.P2WPKH : o = Gt.P2WSH : o = Gt.P2TR, o;
+      return s = il(e), s.version === 0 ? s.data.length === 20 ? o = Dt.P2WPKH : o = Dt.P2WSH : o = Dt.P2TR, o;
     } catch {
-      return Gt.UNKNOWN;
+      return Dt.UNKNOWN;
     }
   else
     try {
-      return i = Ny(e), i.version === t.pubKeyHash || i.version === n.pubKeyHash || i.version === r.pubKeyHash ? o = Gt.P2PKH : (i.version === t.scriptHash || (i.version, n.scriptHash), o = Gt.P2SH_P2WPKH), o;
+      return i = Ny(e), i.version === t.pubKeyHash || i.version === n.pubKeyHash || i.version === r.pubKeyHash ? o = Dt.P2PKH : (i.version === t.scriptHash || (i.version, n.scriptHash), o = Dt.P2SH_P2WPKH), o;
     } catch {
-      return Gt.UNKNOWN;
+      return Dt.UNKNOWN;
     }
 }
 function Px(e, t, n) {
@@ -27758,7 +27758,7 @@ const Y6 = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   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", Wr = BigInt(546), vt = "0:0", Cp = {
   P2PKH: 148,
   P2SH_P2WPKH: 91,
   P2WPKH: 68,
@@ -27807,7 +27807,7 @@ class xi {
     ) >= 0)
       return;
     const { address: n } = t;
-    if (Zr(n) === Gt.P2TR) {
+    if (Zr(n) === Dt.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;
@@ -28007,18 +28007,18 @@ class xi {
     for (const s of this.intentions) {
       for (const a of s.inputCoins) {
         const u = i(a.from);
-        a.coin.id === Qt ? u.needBtc = !0 : u.runeIds.add(a.coin.id);
+        a.coin.id === vt ? u.needBtc = !0 : u.runeIds.add(a.coin.id);
       }
       for (const a of s.outputCoins) {
         const u = i(a.to);
-        a.coin.id === Qt ? u.needBtc = !0 : u.runeIds.add(a.coin.id);
+        a.coin.id === vt ? u.needBtc = !0 : u.runeIds.add(a.coin.id);
       }
       const o = i(s.poolAddress), c = [
         ...s.inputCoins.map((a) => a.coin.id),
         ...s.outputCoins.map((a) => a.coin.id)
       ];
       for (const a of c)
-        a === Qt ? o.needBtc = !0 : o.runeIds.add(a);
+        a === vt ? o.needBtc = !0 : o.runeIds.add(a);
     }
     return await Promise.all(
       Array.from(r.entries()).map(async ([s, o]) => {
@@ -28112,7 +28112,7 @@ class xi {
       i[a] ??= {};
       const f = i[a];
       u.forEach((l) => {
-        this.addInput(l), f[Qt] = (f[Qt] ?? BigInt(0)) + BigInt(l.satoshis), l.runes.forEach((p) => {
+        this.addInput(l), f[vt] = (f[vt] ?? BigInt(0)) + BigInt(l.satoshis), l.runes.forEach((p) => {
           f[p.id] = (f[p.id] ?? BigInt(0)) + BigInt(p.amount);
         });
       });
@@ -28121,7 +28121,7 @@ class xi {
       r
     ))
       for (const [f, l] of Object.entries(u))
-        if (f === Qt) {
+        if (f === vt) {
           if (a === this.config.paymentAddress) {
             s += l;
             continue;
@@ -28153,33 +28153,41 @@ class xi {
           ), E = g - l;
           if (n.includes(a)) {
             i[a] ??= {};
-            const S = i[a], _ = (r[a]?.[Qt] ?? BigInt(0)) > BigInt(0);
-            w > BigInt(0) && !_ && (S[Qt] = (S[Qt] ?? BigInt(0)) + w), E > BigInt(0) && (S[f] = (S[f] ?? BigInt(0)) + E);
+            const S = i[a], _ = (r[a]?.[vt] ?? BigInt(0)) > BigInt(0);
+            w > BigInt(0) && !_ && (S[vt] = (S[vt] ?? BigInt(0)) + w), E > BigInt(0) && (S[f] = (S[f] ?? BigInt(0)) + E);
           } else E > BigInt(0) && (i[a] ??= {}, i[a][f] = (i[a][f] ?? BigInt(0)) + E);
           y.forEach((S) => this.addInput(S));
         }
     for (const [a, u] of Object.entries(
       i
-    ))
-      if (!(r[a] || !n.includes(a) || c.has(a)))
-        for (const [f] of Object.entries(u))
-          if (f === Qt) {
-            const l = t.btc[a] || [], p = l.reduce(
-              (y, g) => y + BigInt(g.satoshis),
-              BigInt(0)
-            );
-            i[a] ??= {}, i[a][f] = (i[a][f] ?? BigInt(0)) + p, l.forEach((y) => {
-              this.addInput(y), y.runes.forEach((g) => {
-                i[a] ??= {}, i[a][g.id] = (i[a][g.id] ?? BigInt(0)) + BigInt(g.amount);
-              });
-            });
-          } else {
-            const l = t.rune[a]?.[f] || [], p = l.reduce((y, g) => {
-              const w = g.runes.find((E) => E.id === f);
-              return y + BigInt(w?.amount ?? 0);
-            }, BigInt(0));
-            i[a] ??= {}, i[a][f] = (i[a][f] ?? BigInt(0)) + p, l.forEach((y) => this.addInput(y));
-          }
+    )) {
+      if (r[a] || !n.includes(a) || c.has(a))
+        continue;
+      const f = /* @__PURE__ */ new Set();
+      if (u[vt] !== void 0) {
+        const l = t.btc[a] || [], p = l.reduce(
+          (y, g) => y + BigInt(g.satoshis),
+          BigInt(0)
+        );
+        i[a] ??= {}, i[a][vt] = (i[a][vt] ?? BigInt(0)) + p, l.forEach((y) => {
+          this.addInput(y), f.add(`${y.txid}:${y.vout}`), y.runes.forEach((g) => {
+            i[a] ??= {}, i[a][g.id] = (i[a][g.id] ?? BigInt(0)) + BigInt(g.amount);
+          });
+        });
+      }
+      for (const [l] of Object.entries(u)) {
+        if (l === vt) continue;
+        const y = (t.rune[a]?.[l] || []).filter(
+          (w) => !f.has(`${w.txid}:${w.vout}`)
+        ), g = y.reduce((w, E) => {
+          const S = E.runes.find((_) => _.id === l);
+          return w + BigInt(S?.amount ?? 0);
+        }, BigInt(0));
+        i[a] ??= {}, i[a][l] = (i[a][l] ?? BigInt(0)) + g, y.forEach((w) => {
+          this.addInput(w), f.add(`${w.txid}:${w.vout}`);
+        });
+      }
+    }
     return { addressOutputCoinAmounts: i, paymentBtcRequired: s };
   }
   /**
@@ -28202,7 +28210,7 @@ class xi {
     const n = this.config.mergeSelfRuneBtcOutputs === !0, r = /* @__PURE__ */ new Set();
     for (const [, s] of Object.entries(t))
       for (const o of Object.keys(s))
-        o !== Qt && r.add(o);
+        o !== vt && r.add(o);
     const i = Array.from(r);
     if (i.length > 0) {
       const s = [], o = [];
@@ -28221,14 +28229,14 @@ 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]?.[vt] ?? 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][vt]) : this.additionalDustNeeded += Wr;
       });
     }
     for (const [s, o] of Object.entries(
       t
     )) {
-      const c = o[Qt] ?? BigInt(0);
+      const c = o[vt] ?? BigInt(0);
       c > BigInt(0) && this.addOutput(s, c);
     }
   }
@@ -28296,14 +28304,14 @@ class xi {
     const s = this.psbt.__CACHE.__TX.clone(), o = [];
     for (let a = 0; a < this.inputUtxos.length; a++) {
       const u = this.inputUtxos[a], f = u.address;
-      if (f !== this.config.paymentAddress || f !== this.config.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 = Zr(f);
       if (o.push({
         index: a,
-        ...p === Gt.P2TR ? { address: f, disableTweakSigner: !1 } : { publicKey: u.pubkey, disableTweakSigner: !0 }
-      }), l && p === Gt.P2SH_P2WPKH) {
-        const y = Yt([l]);
+        ...p === Dt.P2TR ? { address: f, disableTweakSigner: !1 } : { publicKey: u.pubkey, disableTweakSigner: !0 }
+      }), l && p === Dt.P2SH_P2WPKH) {
+        const y = Zt([l]);
         s.setInputScript(a, y);
       }
     }
@@ -28502,7 +28510,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, gr, Te = !0, su = "[DecimalError] ", si = su + "Invalid argument: ", fw = su + "Precision limit exceeded", lw = su + "crypto unavailable", hw = "[object Decimal]", $t = 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);
@@ -28534,8 +28542,8 @@ ie.cosine = ie.cos = function() {
 ie.cubeRoot = ie.cbrt = function() {
   var e, t, n, r, i, s, o, c, a, u, f = this, l = f.constructor;
   if (!f.isFinite() || f.isZero()) return new l(f);
-  for (Te = !1, s = f.s * bt(f.s * f, 1 / 3), !s || Math.abs(s) == 1 / 0 ? (n = Pt(f.d), e = f.e, (s = (e - n.length + 1) % 3) && (n += s == 1 || s == -2 ? "0" : "00"), s = bt(n, 1 / 3), e = Lt((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2)), s == 1 / 0 ? n = "5e" + e : (n = s.toExponential(), n = n.slice(0, n.indexOf("e") + 1) + e), r = new l(n), r.s = f.s) : r = new l(s.toString()), o = (e = l.precision) + 3; ; )
-    if (c = r, a = c.times(c).times(c), u = a.plus(f), r = De(u.plus(f).times(c), u.plus(a), o + 2, 1), Pt(c.d).slice(0, o) === (n = Pt(r.d)).slice(0, o))
+  for (Te = !1, s = f.s * bt(f.s * f, 1 / 3), !s || Math.abs(s) == 1 / 0 ? (n = kt(f.d), e = f.e, (s = (e - n.length + 1) % 3) && (n += s == 1 || s == -2 ? "0" : "00"), s = bt(n, 1 / 3), e = $t((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2)), s == 1 / 0 ? n = "5e" + e : (n = s.toExponential(), n = n.slice(0, n.indexOf("e") + 1) + e), r = new l(n), r.s = f.s) : r = new l(s.toString()), o = (e = l.precision) + 3; ; )
+    if (c = r, a = c.times(c).times(c), u = a.plus(f), r = De(u.plus(f).times(c), u.plus(a), o + 2, 1), kt(c.d).slice(0, o) === (n = kt(r.d)).slice(0, o))
       if (n = n.slice(o - 3, o + 1), n == "9999" || !i && n == "4999") {
         if (!i && (we(c, e + 1, 0), c.times(c).times(c).eq(f))) {
           r = c;
@@ -28551,7 +28559,7 @@ ie.cubeRoot = ie.cbrt = function() {
 ie.decimalPlaces = ie.dp = function() {
   var e, t = this.d, n = NaN;
   if (t) {
-    if (e = t.length - 1, n = (e - Lt(this.e / be)) * be, e = t[e], e) for (; e % 10 == 0; e /= 10) n--;
+    if (e = t.length - 1, n = (e - $t(this.e / be)) * be, e = t[e], e) for (; e % 10 == 0; e /= 10) n--;
     n < 0 && (n = 0);
   }
   return n;
@@ -28642,7 +28650,7 @@ ie.isFinite = function() {
   return !!this.d;
 };
 ie.isInteger = ie.isInt = function() {
-  return !!this.d && Lt(this.e / be) > this.d.length - 2;
+  return !!this.d && $t(this.e / be) > this.d.length - 2;
 };
 ie.isNaN = function() {
   return !this.s;
@@ -28682,7 +28690,7 @@ ie.logarithm = ie.log = function(e) {
   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))
     do
       if (c += 10, o = Jr(u, c), r = t ? Sa(f, c + 10) : Jr(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));
+        +kt(a.d).slice(i + 1, i + 15) + 1 == 1e14 && (a = we(a, l + 1, 0));
         break;
       }
     while (Po(a.d, i += 10, p));
@@ -28700,7 +28708,7 @@ ie.minus = ie.sub = function(e) {
     else return new g(a === 3 ? -0 : 0);
     return Te ? we(e, c, a) : e;
   }
-  if (n = Lt(e.e / be), f = Lt(y.e / be), u = u.slice(), s = f - n, s) {
+  if (n = $t(e.e / be), f = $t(y.e / be), u = u.slice(), s = f - n, s) {
     for (l = s < 0, l ? (t = u, s = -s, o = p.length) : (t = p, n = f, o = u.length), r = Math.max(Math.ceil(c / be), o) + 2, s > r && (s = r, t.length = 1), t.reverse(), r = s; r--; ) t.push(0);
     t.reverse();
   } else {
@@ -28745,7 +28753,7 @@ ie.plus = ie.add = function(e) {
     return e.s = -e.s, l.minus(e);
   if (u = l.d, f = e.d, c = p.precision, a = p.rounding, !u[0] || !f[0])
     return f[0] || (e = new p(l)), Te ? we(e, c, a) : e;
-  if (s = Lt(l.e / be), r = Lt(e.e / be), u = u.slice(), i = s - r, i) {
+  if (s = $t(l.e / be), r = $t(e.e / be), u = u.slice(), i = s - r, i) {
     for (i < 0 ? (n = u, i = -i, o = f.length) : (n = f, r = s, o = u.length), s = Math.ceil(c / be), o = s > o ? s + 1 : o + 1, i > o && (i = o, n.length = 1), n.reverse(); i--; ) n.push(0);
     n.reverse();
   }
@@ -28771,8 +28779,8 @@ 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;
   if (u !== 1 || !c || !c[0])
     return new f(!u || u < 0 && (!c || c[0]) ? NaN : c ? o : 1 / 0);
-  for (Te = !1, u = Math.sqrt(+o), u == 0 || u == 1 / 0 ? (t = Pt(c), (t.length + a) % 2 == 0 && (t += "0"), u = Math.sqrt(t), a = Lt((a + 1) / 2) - (a < 0 || a % 2), u == 1 / 0 ? t = "5e" + a : (t = u.toExponential(), t = t.slice(0, t.indexOf("e") + 1) + a), r = new f(t)) : r = new f(u.toString()), n = (a = f.precision) + 3; ; )
-    if (s = r, r = s.plus(De(o, s, n + 2, 1)).times(0.5), Pt(s.d).slice(0, n) === (t = Pt(r.d)).slice(0, n))
+  for (Te = !1, u = Math.sqrt(+o), u == 0 || u == 1 / 0 ? (t = kt(c), (t.length + a) % 2 == 0 && (t += "0"), u = Math.sqrt(t), a = $t((a + 1) / 2) - (a < 0 || a % 2), u == 1 / 0 ? t = "5e" + a : (t = u.toExponential(), t = t.slice(0, t.indexOf("e") + 1) + a), r = new f(t)) : r = new f(u.toString()), n = (a = f.precision) + 3; ; )
+    if (s = r, r = s.plus(De(o, s, n + 2, 1)).times(0.5), kt(s.d).slice(0, n) === (t = kt(r.d)).slice(0, n))
       if (t = t.slice(n - 3, n + 1), t == "9999" || !i && t == "4999") {
         if (!i && (we(s, a + 1, 0), s.times(s).eq(o))) {
           r = s;
@@ -28793,7 +28801,7 @@ 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;
   if (e.s *= f.s, !p || !p[0] || !y || !y[0])
     return new l(!e.s || p && !p[0] && !y || y && !y[0] && !p ? NaN : !p || !y ? e.s / 0 : e.s * 0);
-  for (n = Lt(f.e / be) + Lt(e.e / be), a = p.length, u = y.length, a < u && (s = p, p = y, y = s, o = a, a = u, u = o), s = [], o = a + u, r = o; r--; ) s.push(0);
+  for (n = $t(f.e / be) + $t(e.e / be), a = p.length, u = y.length, a < u && (s = p, p = y, y = s, o = a, a = u, u = o), s = [], o = a + u, r = o; r--; ) s.push(0);
   for (r = u; --r >= 0; ) {
     for (t = 0, i = a + r; i > r; )
       c = s[i] + y[r] * p[i - r - 1] + t, s[i--] = c % Fn | 0, t = c / Fn | 0;
@@ -28826,7 +28834,7 @@ ie.toFraction = function(e) {
     if (c = new w(e), !c.isInt() || c.lt(u)) throw Error(si + 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; )
+  for (Te = !1, c = new w(kt(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; )
     n = r, r = i, i = u, u = a.plus(l.times(i)), a = i, i = t, t = c.minus(l.times(i)), c = i;
   return i = De(e.minus(n), r, 0, 1, 1), a = a.plus(i.times(u)), n = n.plus(i.times(r)), a.s = u.s = y.s, p = De(u, r, s, 1).minus(y).abs().cmp(De(a, n, s, 1).minus(y).abs()) < 1 ? [u, r] : [a, n], w.precision = f, Te = !0, p;
 };
@@ -28856,14 +28864,14 @@ ie.toPower = ie.pow = function(e) {
   if (!c.d || !e.d || !c.d[0] || !e.d[0]) return new a(bt(+c, u));
   if (c = new a(c), c.eq(1)) return c;
   if (r = a.precision, s = a.rounding, e.eq(1)) return we(c, r, s);
-  if (t = Lt(e.e / be), t >= e.d.length - 1 && (n = u < 0 ? -u : u) <= Mx)
+  if (t = $t(e.e / be), t >= e.d.length - 1 && (n = u < 0 ? -u : u) <= Mx)
     return i = yw(a, c, n, r), e.s < 0 ? new a(1).div(i) : we(i, r, s);
   if (o = c.s, o < 0) {
     if (t < e.d.length - 1) return new a(NaN);
     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) ? $t(u * (Math.log("0." + kt(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), +kt(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;
@@ -28884,7 +28892,7 @@ ie.valueOf = ie.toJSON = function() {
   var e = this, t = e.constructor, n = Zn(e, e.e <= t.toExpNeg || e.e >= t.toExpPos);
   return e.isNeg() ? "-" + n : n;
 };
-function Pt(e) {
+function kt(e) {
   var t, n, r, i = e.length - 1, s = "", o = e[0];
   if (i > 0) {
     for (s += o, t = 1; t < i; t++)
@@ -28956,7 +28964,7 @@ var De = /* @__PURE__ */ (function() {
           N && N[0] == 0 || !K ? $ * 0 : $ / 0
         )
       );
-    for (a ? (y = 1, f = r.e - i.e) : (a = Fn, y = be, f = Lt(r.e / y) - Lt(i.e / y)), V = K.length, v = N.length, S = new H($), _ = S.d = [], l = 0; K[l] == (N[l] || 0); l++) ;
+    for (a ? (y = 1, f = r.e - i.e) : (a = Fn, y = be, f = $t(r.e / y) - $t(i.e / y)), V = K.length, v = N.length, S = new H($), _ = S.d = [], l = 0; K[l] == (N[l] || 0); l++) ;
     if (K[l] > (N[l] || 0) && f--, s == null ? (A = s = H.precision, o = H.rounding) : c ? A = s + (r.e - i.e) + 1 : A = s, A < 0)
       _.push(1), g = !0;
     else {
@@ -29020,7 +29028,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;
+  var r, i = e.e, s = kt(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;
 }
 function ou(e, t) {
@@ -29052,7 +29060,7 @@ function Yr(e) {
 function yw(e, t, n, r) {
   var i, s = new e(1), o = Math.ceil(r / be + 4);
   for (Te = !1; ; ) {
-    if (n % 2 && (s = s.times(t), Mp(s.d, o) && (i = !0)), n = Lt(n / 2), n === 0) {
+    if (n % 2 && (s = s.times(t), Mp(s.d, o) && (i = !0)), n = $t(n / 2), n === 0) {
       n = s.d.length - 1, i && s.d[n] === 0 && ++s.d[n];
       break;
     }
@@ -29080,7 +29088,7 @@ function zf(e, t) {
   for (t == null ? (Te = !1, a = g) : a = t, c = new p(0.03125); e.e > -2; )
     e = e.times(c), l += 5;
   for (r = Math.log(bt(2, l)) / Math.LN10 * 2 + 5 | 0, a += r, n = s = o = new p(1), p.precision = a; ; ) {
-    if (s = we(s.times(e), a, 1), n = n.times(++f), c = o.plus(De(s, n, a, 1)), Pt(c.d).slice(0, a) === Pt(o.d).slice(0, a)) {
+    if (s = we(s.times(e), a, 1), n = n.times(++f), c = o.plus(De(s, n, a, 1)), kt(c.d).slice(0, a) === kt(o.d).slice(0, a)) {
       for (i = l; i--; ) o = we(o.times(o), a, 1);
       if (t == null)
         if (u < 3 && Po(o.d, a - r, y, u))
@@ -29097,14 +29105,14 @@ function Jr(e, t) {
   var n, r, i, s, o, c, a, u, f, l, p, y = 1, g = 10, w = e, E = w.d, S = w.constructor, _ = S.rounding, m = S.precision;
   if (w.s < 0 || !E || !E[0] || !w.e && E[0] == 1 && E.length == 1)
     return new S(E && !E[0] ? -1 / 0 : w.s != 1 ? NaN : E ? 0 : w);
-  if (t == null ? (Te = !1, f = m) : f = t, S.precision = f += g, n = Pt(E), r = n.charAt(0), Math.abs(s = w.e) < 15e14) {
+  if (t == null ? (Te = !1, f = m) : f = t, S.precision = f += g, n = kt(E), r = n.charAt(0), Math.abs(s = w.e) < 15e14) {
     for (; r < 7 && r != 1 || r == 1 && n.charAt(1) > 3; )
-      w = w.times(e), n = Pt(w.d), r = n.charAt(0), y++;
+      w = w.times(e), n = kt(w.d), r = n.charAt(0), y++;
     s = w.e, r > 1 ? (w = new S("0." + n), s++) : w = new S(r + "." + n.slice(1));
   } else
     return u = Sa(S, f + 2, m).times(s + ""), w = Jr(new S(r + "." + n.slice(1)), f - g).plus(u), S.precision = m, t == null ? we(w, m, _, 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 S(i), f, 1)), Pt(u.d).slice(0, f) === Pt(a.d).slice(0, f))
+    if (o = we(o.times(p), f, 1), u = a.plus(De(o, new S(i), f, 1)), kt(u.d).slice(0, f) === kt(a.d).slice(0, f))
       if (a = a.times(2), s !== 0 && (a = a.plus(Sa(S, f + 2, m).times(s + ""))), a = De(a, new S(y), f, 1), t == null)
         if (Po(a.d, f - g, _, c))
           S.precision = f += g, u = o = w = De(l.minus(1), l.plus(1), f, 1), p = we(w.times(w), f, 1), i = c = 1;
@@ -29290,7 +29298,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;
+      if ($t(r) === r && r >= s[t + 1] && r <= s[t + 2]) this[n] = r;
       else throw Error(si + n + ": " + r);
   if (n = "crypto", i && (this[n] = Df[n]), (r = e[n]) !== void 0)
     if (r === !0 || r === !1 || r === 0 || r === 1)