@btc-vision/bitcoin 6.5.3 → 6.5.5

package/browser/chunks/{psbt-BIwOrKer.js → psbt-URK2hBFc.js}

@@ -1,9 +1,9 @@
-import { B as l, h as ot, c as xr } from "./crypto-0PweVewC.js";
-import { o as Ce, t as Or, c as Cr, d as he, i as Hn, s as Se, a as Pr, b as Nr } from "./script-CROJPzz_.js";
-import { t as Hr, a as Ur, H as Br, U as Rr, i as Fr, b as Un, c as Ot, r as Bn } from "./utils-CO5kmxe9.js";
-import { p as _e, a as me, b as $e, c as ve, d as Ie, e as Rn, t as Kr, f as Ye, M as Fn, L as Lr, r as Mr, g as Kn, h as Ze, i as Wr } from "./payments-CgasufRS.js";
-import { T as I, a as Gr } from "./transaction-DchBu35N.js";
-const Je = {
+import { B as l, h as nt } from "./crypto-BhCpKpek.js";
+import { p as Ee, a as be, b as Ve, c as Te, d as _e, e as On, f as Pn, g as je, t as vr, h as ze, M as Nn, L as kr, r as Ar } from "./payments-yjA0Evsv.js";
+import { o as Ae, t as xr, c as Cr, d as fe, i as Hn, s as ge, a as Or } from "./script-DyPItFEl.js";
+import { t as Pr, a as Nr, H as Hr, U as Ur, i as Br, b as Un, c as kt, r as Bn } from "./utils-DNZi-T5W.js";
+import { T as v } from "./transaction-C_UbhMGn.js";
+const Ye = {
   /**
    * The message prefix used for signing Bitcoin messages.
    */
@@ -39,7 +39,7 @@ const Je = {
    * The prefix for Bitcoin Wallet Import Format (WIF) private keys.
    */
   wif: 128
-}, Xr = {
+}, Rr = {
   messagePrefix: `Bitcoin Signed Message:
 `,
   bech32: "bcrt",
@@ -51,7 +51,7 @@ const Je = {
   pubKeyHash: 111,
   scriptHash: 196,
   wif: 239
-}, qr = {
+}, Fr = {
   messagePrefix: `Bitcoin Signed Message:
 `,
   bech32: "tb",
@@ -63,7 +63,7 @@ const Je = {
   pubKeyHash: 111,
   scriptHash: 196,
   wif: 239
-}, Dr = {
+}, Kr = {
   messagePrefix: `Dogecoin Signed Message:
 `,
   bech32: "",
@@ -76,7 +76,7 @@ const Je = {
   pubKeyHash: 30,
   scriptHash: 22,
   wif: 158
-}, Vr = {
+}, Lr = {
   messagePrefix: `Dogecoin Signed Message:
 `,
   bech32: "",
@@ -89,7 +89,7 @@ const Je = {
   pubKeyHash: 113,
   scriptHash: 196,
   wif: 241
-}, jr = {
+}, Mr = {
   messagePrefix: `Litecoin Signed Message:
 `,
   bech32: "ltc",
@@ -101,7 +101,7 @@ const Je = {
   pubKeyHash: 48,
   scriptHash: 50,
   wif: 176
-}, zr = {
+}, Wr = {
   messagePrefix: `Litecoin Signed Message:
 `,
   bech32: "tltc",
@@ -113,7 +113,7 @@ const Je = {
   pubKeyHash: 111,
   scriptHash: 58,
   wif: 239
-}, $r = {
+}, Gr = {
   messagePrefix: `Bitcoin Signed Message:
 `,
   // Cashaddr prefix differs from bech32 for general usage, but we can set it similarly.
@@ -127,7 +127,7 @@ const Je = {
   pubKeyHash: 0,
   scriptHash: 5,
   wif: 128
-}, Yr = {
+}, Dr = {
   messagePrefix: `Bitcoin Signed Message:
 `,
   bech32: "bchtest",
@@ -139,7 +139,7 @@ const Je = {
   pubKeyHash: 111,
   scriptHash: 196,
   wif: 239
-}, Zr = {
+}, qr = {
   // Historically Dash used DarkCoin message prefix, and most implementations use this:
   // As of Dash Core 0.17, this has not changed in code.
   messagePrefix: `DarkCoin Signed Message:
@@ -154,7 +154,7 @@ const Je = {
   pubKeyHash: 76,
   scriptHash: 16,
   wif: 204
-}, Jr = {
+}, Xr = {
   messagePrefix: `DarkCoin Signed Message:
 `,
   bech32: "",
@@ -167,24 +167,24 @@ const Je = {
   pubKeyHash: 140,
   scriptHash: 19,
   wif: 239
-}, Qr = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}, Go = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  bitcoin: Je,
-  bitcoinCash: $r,
-  bitcoinCashTestnet: Yr,
-  dash: Zr,
-  dashTestnet: Jr,
-  dogecoin: Dr,
-  dogecoinTestnet: Vr,
-  litecoin: jr,
-  litecoinTestnet: zr,
-  regtest: Xr,
-  testnet: qr
+  bitcoin: Ye,
+  bitcoinCash: Gr,
+  bitcoinCashTestnet: Dr,
+  dash: qr,
+  dashTestnet: Xr,
+  dogecoin: Kr,
+  dogecoinTestnet: Lr,
+  litecoin: Mr,
+  litecoinTestnet: Wr,
+  regtest: Rr,
+  testnet: Fr
 }, Symbol.toStringTag, { value: "Module" }));
-var se = {}, Ct;
-function es() {
-  if (Ct) return se;
-  Ct = 1, Object.defineProperty(se, "__esModule", { value: !0 }), se.bech32m = se.bech32 = void 0;
+var ne = {}, At;
+function Vr() {
+  if (At) return ne;
+  At = 1, Object.defineProperty(ne, "__esModule", { value: !0 }), ne.bech32m = ne.bech32 = void 0;
   const t = "qpzry9x8gf2tvdw0s3jn54khce6mua7l", e = {};
   for (let u = 0; u < t.length; u++) {
     const f = t.charAt(u);
@@ -211,19 +211,19 @@ function es() {
   }
   function c(u, f, p, g) {
     let y = 0, h = 0;
-    const d = (1 << p) - 1, w = [];
-    for (let E = 0; E < u.length; ++E)
-      for (y = y << f | u[E], h += f; h >= p; )
-        h -= p, w.push(y >> h & d);
+    const d = (1 << p) - 1, E = [];
+    for (let b = 0; b < u.length; ++b)
+      for (y = y << f | u[b], h += f; h >= p; )
+        h -= p, E.push(y >> h & d);
     if (g)
-      h > 0 && w.push(y << p - h & d);
+      h > 0 && E.push(y << p - h & d);
     else {
       if (h >= f)
         return "Excess padding";
       if (y << p - h & d)
         return "Non-zero padding";
     }
-    return w;
+    return E;
   }
   function s(u) {
     return c(u, 8, 5, !0);
@@ -242,68 +242,68 @@ function es() {
   function a(u) {
     let f;
     u === "bech32" ? f = 1 : f = 734539939;
-    function p(d, w, E) {
-      if (E = E || 90, d.length + 7 + w.length > E)
+    function p(d, E, b) {
+      if (b = b || 90, d.length + 7 + E.length > b)
         throw new TypeError("Exceeds length limit");
       d = d.toLowerCase();
       let S = r(d);
       if (typeof S == "string")
         throw new Error(S);
-      let b = d + "1";
-      for (let _ = 0; _ < w.length; ++_) {
-        const v = w[_];
-        if (v >> 5 !== 0)
+      let w = d + "1";
+      for (let _ = 0; _ < E.length; ++_) {
+        const I = E[_];
+        if (I >> 5 !== 0)
           throw new Error("Non 5-bit word");
-        S = n(S) ^ v, b += t.charAt(v);
+        S = n(S) ^ I, w += t.charAt(I);
       }
       for (let _ = 0; _ < 6; ++_)
         S = n(S);
       S ^= f;
       for (let _ = 0; _ < 6; ++_) {
-        const v = S >> (5 - _) * 5 & 31;
-        b += t.charAt(v);
+        const I = S >> (5 - _) * 5 & 31;
+        w += t.charAt(I);
       }
-      return b;
+      return w;
     }
-    function g(d, w) {
-      if (w = w || 90, d.length < 8)
+    function g(d, E) {
+      if (E = E || 90, d.length < 8)
         return d + " too short";
-      if (d.length > w)
+      if (d.length > E)
         return "Exceeds length limit";
-      const E = d.toLowerCase(), S = d.toUpperCase();
-      if (d !== E && d !== S)
+      const b = d.toLowerCase(), S = d.toUpperCase();
+      if (d !== b && d !== S)
         return "Mixed-case string " + d;
-      d = E;
-      const b = d.lastIndexOf("1");
-      if (b === -1)
+      d = b;
+      const w = d.lastIndexOf("1");
+      if (w === -1)
         return "No separator character for " + d;
-      if (b === 0)
+      if (w === 0)
         return "Missing prefix for " + d;
-      const _ = d.slice(0, b), v = d.slice(b + 1);
-      if (v.length < 6)
+      const _ = d.slice(0, w), I = d.slice(w + 1);
+      if (I.length < 6)
         return "Data too short";
-      let C = r(_);
-      if (typeof C == "string")
-        return C;
+      let O = r(_);
+      if (typeof O == "string")
+        return O;
       const m = [];
-      for (let k = 0; k < v.length; ++k) {
-        const U = v.charAt(k), R = e[U];
-        if (R === void 0)
-          return "Unknown character " + U;
-        C = n(C) ^ R, !(k + 6 >= v.length) && m.push(R);
+      for (let k = 0; k < I.length; ++k) {
+        const H = I.charAt(k), B = e[H];
+        if (B === void 0)
+          return "Unknown character " + H;
+        O = n(O) ^ B, !(k + 6 >= I.length) && m.push(B);
       }
-      return C !== f ? "Invalid checksum for " + d : { prefix: _, words: m };
+      return O !== f ? "Invalid checksum for " + d : { prefix: _, words: m };
     }
-    function y(d, w) {
-      const E = g(d, w);
-      if (typeof E == "object")
-        return E;
+    function y(d, E) {
+      const b = g(d, E);
+      if (typeof b == "object")
+        return b;
     }
-    function h(d, w) {
-      const E = g(d, w);
-      if (typeof E == "object")
-        return E;
-      throw new Error(E);
+    function h(d, E) {
+      const b = g(d, E);
+      if (typeof b == "object")
+        return b;
+      throw new Error(b);
     }
     return {
       decodeUnsafe: y,
@@ -314,77 +314,77 @@ function es() {
       fromWords: i
     };
   }
-  return se.bech32 = a("bech32"), se.bech32m = a("bech32m"), se;
+  return ne.bech32 = a("bech32"), ne.bech32m = a("bech32m"), ne;
 }
-var M = es();
-function ts(t) {
+var K = Vr();
+function jr(t) {
   return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
 }
-function vt(t, ...e) {
-  if (!ts(t))
+function Tt(t, ...e) {
+  if (!jr(t))
     throw new Error("Uint8Array expected");
   if (e.length > 0 && !e.includes(t.length))
     throw new Error("Uint8Array expected of length " + e + ", got length=" + t.length);
 }
-function Pt(t, e = !0) {
+function xt(t, e = !0) {
   if (t.destroyed)
     throw new Error("Hash instance has been destroyed");
   if (e && t.finished)
     throw new Error("Hash#digest() has already been called");
 }
-function ns(t, e) {
-  vt(t);
+function zr(t, e) {
+  Tt(t);
   const n = e.outputLen;
   if (t.length < n)
     throw new Error("digestInto() expects output buffer of length at least " + n);
 }
-function dt(...t) {
+function pt(...t) {
   for (let e = 0; e < t.length; e++)
     t[e].fill(0);
 }
-function it(t) {
+function rt(t) {
   return new DataView(t.buffer, t.byteOffset, t.byteLength);
 }
-function B(t, e) {
+function U(t, e) {
   return t << 32 - e | t >>> e;
 }
-function rs(t) {
+function Yr(t) {
   if (typeof t != "string")
     throw new Error("string expected");
   return new Uint8Array(new TextEncoder().encode(t));
 }
-function Ln(t) {
-  return typeof t == "string" && (t = rs(t)), vt(t), t;
+function Rn(t) {
+  return typeof t == "string" && (t = Yr(t)), Tt(t), t;
 }
-class ss {
+class $r {
 }
-function os(t) {
-  const e = (r) => t().update(Ln(r)).digest(), n = t();
+function Zr(t) {
+  const e = (r) => t().update(Rn(r)).digest(), n = t();
   return e.outputLen = n.outputLen, e.blockLen = n.blockLen, e.create = () => t(), e;
 }
-function is(t, e, n, r) {
+function Jr(t, e, n, r) {
   if (typeof t.setBigUint64 == "function")
     return t.setBigUint64(e, n, r);
   const c = BigInt(32), s = BigInt(4294967295), o = Number(n >> c & s), i = Number(n & s), a = r ? 4 : 0, u = r ? 0 : 4;
   t.setUint32(e + a, o, r), t.setUint32(e + u, i, r);
 }
-function cs(t, e, n) {
+function Qr(t, e, n) {
   return t & e ^ ~t & n;
 }
-function as(t, e, n) {
+function es(t, e, n) {
   return t & e ^ t & n ^ e & n;
 }
-class us extends ss {
+class ts extends $r {
   constructor(e, n, r, c) {
-    super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = e, this.outputLen = n, this.padOffset = r, this.isLE = c, this.buffer = new Uint8Array(e), this.view = it(this.buffer);
+    super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = e, this.outputLen = n, this.padOffset = r, this.isLE = c, this.buffer = new Uint8Array(e), this.view = rt(this.buffer);
   }
   update(e) {
-    Pt(this), e = Ln(e), vt(e);
+    xt(this), e = Rn(e), Tt(e);
     const { view: n, buffer: r, blockLen: c } = this, s = e.length;
     for (let o = 0; o < s; ) {
       const i = Math.min(c - this.pos, s - o);
       if (i === c) {
-        const a = it(e);
+        const a = rt(e);
         for (; c <= s - o; o += c)
           this.process(a, o);
         continue;
@@ -394,14 +394,14 @@ class us extends ss {
     return this.length += e.length, this.roundClean(), this;
   }
   digestInto(e) {
-    Pt(this), ns(e, this), this.finished = !0;
+    xt(this), zr(e, this), this.finished = !0;
     const { buffer: n, view: r, blockLen: c, isLE: s } = this;
     let { pos: o } = this;
-    n[o++] = 128, dt(this.buffer.subarray(o)), this.padOffset > c - o && (this.process(r, 0), o = 0);
+    n[o++] = 128, pt(this.buffer.subarray(o)), this.padOffset > c - o && (this.process(r, 0), o = 0);
     for (let p = o; p < c; p++)
       n[p] = 0;
-    is(r, c - 8, BigInt(this.length * 8), s), this.process(r, 0);
-    const i = it(e), a = this.outputLen;
+    Jr(r, c - 8, BigInt(this.length * 8), s), this.process(r, 0);
+    const i = rt(e), a = this.outputLen;
     if (a % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const u = a / 4, f = this.get();
@@ -425,7 +425,7 @@ class us extends ss {
     return this._cloneInto();
   }
 }
-const W = /* @__PURE__ */ Uint32Array.from([
+const L = /* @__PURE__ */ Uint32Array.from([
   1779033703,
   3144134277,
   1013904242,
@@ -434,7 +434,7 @@ const W = /* @__PURE__ */ Uint32Array.from([
   2600822924,
   528734635,
   1541459225
-]), fs = /* @__PURE__ */ Uint32Array.from([
+]), ns = /* @__PURE__ */ Uint32Array.from([
   1116352408,
   1899447441,
   3049323471,
@@ -499,10 +499,10 @@ const W = /* @__PURE__ */ Uint32Array.from([
   2756734187,
   3204031479,
   3329325298
-]), G = /* @__PURE__ */ new Uint32Array(64);
-class ps extends us {
+]), M = /* @__PURE__ */ new Uint32Array(64);
+class rs extends ts {
   constructor(e = 32) {
-    super(64, e, 8, !1), this.A = W[0] | 0, this.B = W[1] | 0, this.C = W[2] | 0, this.D = W[3] | 0, this.E = W[4] | 0, this.F = W[5] | 0, this.G = W[6] | 0, this.H = W[7] | 0;
+    super(64, e, 8, !1), this.A = L[0] | 0, this.B = L[1] | 0, this.C = L[2] | 0, this.D = L[3] | 0, this.E = L[4] | 0, this.F = L[5] | 0, this.G = L[6] | 0, this.H = L[7] | 0;
   }
   get() {
     const { A: e, B: n, C: r, D: c, E: s, F: o, G: i, H: a } = this;
@@ -514,27 +514,27 @@ class ps extends us {
   }
   process(e, n) {
     for (let p = 0; p < 16; p++, n += 4)
-      G[p] = e.getUint32(n, !1);
+      M[p] = e.getUint32(n, !1);
     for (let p = 16; p < 64; p++) {
-      const g = G[p - 15], y = G[p - 2], h = B(g, 7) ^ B(g, 18) ^ g >>> 3, d = B(y, 17) ^ B(y, 19) ^ y >>> 10;
-      G[p] = d + G[p - 7] + h + G[p - 16] | 0;
+      const g = M[p - 15], y = M[p - 2], h = U(g, 7) ^ U(g, 18) ^ g >>> 3, d = U(y, 17) ^ U(y, 19) ^ y >>> 10;
+      M[p] = d + M[p - 7] + h + M[p - 16] | 0;
     }
     let { A: r, B: c, C: s, D: o, E: i, F: a, G: u, H: f } = this;
     for (let p = 0; p < 64; p++) {
-      const g = B(i, 6) ^ B(i, 11) ^ B(i, 25), y = f + g + cs(i, a, u) + fs[p] + G[p] | 0, d = (B(r, 2) ^ B(r, 13) ^ B(r, 22)) + as(r, c, s) | 0;
+      const g = U(i, 6) ^ U(i, 11) ^ U(i, 25), y = f + g + Qr(i, a, u) + ns[p] + M[p] | 0, d = (U(r, 2) ^ U(r, 13) ^ U(r, 22)) + es(r, c, s) | 0;
       f = u, u = a, a = i, i = o + y | 0, o = s, s = c, c = r, r = y + d | 0;
     }
     r = r + this.A | 0, c = c + this.B | 0, s = s + this.C | 0, o = o + this.D | 0, i = i + this.E | 0, a = a + this.F | 0, u = u + this.G | 0, f = f + this.H | 0, this.set(r, c, s, o, i, a, u, f);
   }
   roundClean() {
-    dt(G);
+    pt(M);
   }
   destroy() {
-    this.set(0, 0, 0, 0, 0, 0, 0, 0), dt(this.buffer);
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), pt(this.buffer);
   }
 }
-const hs = /* @__PURE__ */ os(() => new ps()), Nt = hs;
-function ls(t) {
+const ss = /* @__PURE__ */ Zr(() => new rs()), Ct = ss;
+function os(t) {
   if (t.length >= 255)
     throw new TypeError("Alphabet too long");
   const e = new Uint8Array(256);
@@ -558,20 +558,20 @@ function ls(t) {
       g++, f++;
     const h = (y - g) * s + 1 >>> 0, d = new Uint8Array(h);
     for (; g !== y; ) {
-      let S = u[g], b = 0;
-      for (let _ = h - 1; (S !== 0 || b < p) && _ !== -1; _--, b++)
+      let S = u[g], w = 0;
+      for (let _ = h - 1; (S !== 0 || w < p) && _ !== -1; _--, w++)
         S += 256 * d[_] >>> 0, d[_] = S % n >>> 0, S = S / n >>> 0;
       if (S !== 0)
         throw new Error("Non-zero carry");
-      p = b, g++;
+      p = w, g++;
     }
-    let w = h - p;
-    for (; w !== h && d[w] === 0; )
-      w++;
-    let E = r.repeat(f);
-    for (; w < h; ++w)
-      E += t.charAt(d[w]);
-    return E;
+    let E = h - p;
+    for (; E !== h && d[E] === 0; )
+      E++;
+    let b = r.repeat(f);
+    for (; E < h; ++E)
+      b += t.charAt(d[E]);
+    return b;
   }
   function i(u) {
     if (typeof u != "string")
@@ -586,24 +586,24 @@ function ls(t) {
       const S = u.charCodeAt(f);
       if (S > 255)
         return;
-      let b = e[S];
-      if (b === 255)
+      let w = e[S];
+      if (w === 255)
         return;
       let _ = 0;
-      for (let v = y - 1; (b !== 0 || _ < g) && v !== -1; v--, _++)
-        b += n * h[v] >>> 0, h[v] = b % 256 >>> 0, b = b / 256 >>> 0;
-      if (b !== 0)
+      for (let I = y - 1; (w !== 0 || _ < g) && I !== -1; I--, _++)
+        w += n * h[I] >>> 0, h[I] = w % 256 >>> 0, w = w / 256 >>> 0;
+      if (w !== 0)
         throw new Error("Non-zero carry");
       g = _, f++;
     }
     let d = y - g;
     for (; d !== y && h[d] === 0; )
       d++;
-    const w = new Uint8Array(p + (y - d));
-    let E = p;
+    const E = new Uint8Array(p + (y - d));
+    let b = p;
     for (; d !== y; )
-      w[E++] = h[d++];
-    return w;
+      E[b++] = h[d++];
+    return E;
   }
   function a(u) {
     const f = i(u);
@@ -617,12 +617,12 @@ function ls(t) {
     decode: a
   };
 }
-var ds = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz";
-const ct = ls(ds);
-function gs(t) {
+var is = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz";
+const st = os(is);
+function cs(t) {
   function e(s) {
     var o = Uint8Array.from(s), i = t(o), a = o.length + 4, u = new Uint8Array(a);
-    return u.set(o, 0), u.set(i.subarray(0, 4), o.length), ct.encode(u);
+    return u.set(o, 0), u.set(i.subarray(0, 4), o.length), st.encode(u);
   }
   function n(s) {
     var o = s.slice(0, -4), i = s.slice(-4), a = t(o);
@@ -630,12 +630,12 @@ function gs(t) {
       return o;
   }
   function r(s) {
-    var o = ct.decodeUnsafe(s);
+    var o = st.decodeUnsafe(s);
     if (o != null)
       return n(o);
   }
   function c(s) {
-    var o = ct.decode(s), i = n(o);
+    var o = st.decode(s), i = n(o);
     if (i == null)
       throw new Error("Invalid checksum");
     return i;
@@ -646,310 +646,112 @@ function gs(t) {
     decodeUnsafe: r
   };
 }
-function ys(t) {
-  return Nt(Nt(t));
+function as(t) {
+  return Ct(Ct(t));
 }
-const Mn = gs(ys), ke = 40, Ae = 2, xe = 15, Wn = 16, De = 16, Qe = 2, et = 80, Ss = "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.", Gn = (t) => {
-  try {
-    const e = l.from(t.subarray(2));
-    if (e.length < Ae || e.length > ke)
-      throw new TypeError("Invalid program length for segwit address");
-    const n = t[0] - et;
-    if (n < Qe || n > xe + 1)
-      throw new TypeError("Invalid version for segwit address");
-    if (n === 1) throw new TypeError("taproot");
-    return !0;
-  } catch {
-  }
-  return !1;
-};
-function Xn(t, e) {
-  if (!l.isBuffer(t)) throw new TypeError("output must be a Buffer");
-  if (!e.bech32Opnet) throw new Error("Network does not support opnet");
-  const n = t[0];
-  let r = 1, c;
-  if (t[1] < 76)
-    c = t[1], r = 2;
-  else if (t[1] === 76)
-    c = t[2], r = 3;
-  else
-    throw new TypeError("Unsupported push opcode in script");
-  const s = l.from(t.subarray(r, r + c));
-  if (s.length < Ae || s.length > ke)
-    throw new TypeError("Invalid program length for segwit address");
-  const o = n === Ce.OP_0 ? 0 : n >= Ce.OP_1 && n <= Ce.OP_16 ? n - (Ce.OP_1 - 1) : -1;
-  if (o < xe || o > Wn)
-    throw new TypeError(`Invalid segwit version ${o}`);
-  const i = [o, ...M.bech32m.toWords(s)];
-  return M.bech32m.encode(e.bech32Opnet, i);
-}
-function qn(t, e) {
-  const n = l.from(t.subarray(2));
-  if (n.length < Ae || n.length > ke)
-    throw new TypeError("Invalid program length for segwit address");
-  const r = t[0] - et;
-  if (r < Qe || r > xe)
-    throw new TypeError("Invalid version for segwit address");
-  if (t[1] !== n.length)
-    throw new TypeError(`Invalid script for segwit address ${t[1]} !== ${n.length}`);
-  return jn(n, r, e.bech32, e.bech32Opnet);
-}
-function Dn(t) {
-  const e = l.from(Mn.decode(t));
-  if (e.length < 21) throw new TypeError(t + " is too short");
-  if (e.length > 21) throw new TypeError(t + " is too long");
-  const n = e.readUInt8(0), r = l.from(e.subarray(1));
-  return { version: n, hash: r };
-}
-function Vn(t) {
+const Fn = cs(as);
+function Kn(t) {
   let e, n;
   try {
-    e = M.bech32.decode(t);
+    e = K.bech32.decode(t);
   } catch {
   }
   if (e) {
     if (n = e.words[0], n !== 0) throw new TypeError(t + " uses wrong encoding");
-  } else if (e = M.bech32m.decode(t), n = e.words[0], n === 0) throw new TypeError(t + " uses wrong encoding");
-  const r = M.bech32.fromWords(e.words.slice(1));
+  } else if (e = K.bech32m.decode(t), n = e.words[0], n === 0) throw new TypeError(t + " uses wrong encoding");
+  const r = K.bech32.fromWords(e.words.slice(1));
   return {
     version: n,
     prefix: e.prefix,
     data: l.from(r)
   };
 }
-function bs(t, e) {
-  Hr(Ur(Br, Rr), [t, e]);
-  const n = l.allocUnsafe(21);
-  return n.writeUInt8(e, 0), t.copy(n, 1), Mn.encode(n);
-}
-function jn(t, e, n, r) {
-  const c = M.bech32.toWords(t);
-  return c.unshift(e), e === De && r ? M.bech32m.encode(r, c) : e === 0 ? M.bech32.encode(n, c) : M.bech32m.encode(n, c);
-}
-function zn(t, e) {
-  e = e || Je;
-  try {
-    return _e({ output: t, network: e }).address;
-  } catch {
-  }
-  try {
-    return me({ output: t, network: e }).address;
-  } catch {
-  }
-  try {
-    return $e({ output: t, network: e }).address;
-  } catch {
-  }
-  try {
-    return ve({ output: t, network: e }).address;
-  } catch {
-  }
-  try {
-    return Ie({ output: t, network: e }).address;
-  } catch {
-  }
-  try {
-    return Xn(t, e);
-  } catch {
-  }
-  try {
-    return qn(t, e);
-  } catch {
-  }
-  throw new Error(Or(t) + " has no matching Address");
-}
-function $n(t, e) {
-  e = e || Je;
-  let n, r;
-  try {
-    n = Dn(t);
-  } catch {
-  }
-  if (n) {
-    if (n.version === e.pubKeyHash)
-      return _e({ hash: n.hash }).output;
-    if (n.version === e.scriptHash)
-      return me({ hash: n.hash }).output;
-  } else {
-    try {
-      r = Vn(t);
-    } catch {
-    }
-    if (r) {
-      if (r.prefix !== e.bech32 && e.bech32Opnet && r.prefix !== e.bech32Opnet)
-        throw new Error(t + " has an invalid prefix");
-      if (r.version === 0) {
-        if (r.data.length === 20)
-          return $e({ hash: r.data }).output;
-        if (r.data.length === 32)
-          return ve({ hash: r.data }).output;
-      } else if (r.version === 1) {
-        if (r.data.length === 32)
-          return Ie({ pubkey: r.data }).output;
-      } else if (r.version === De) {
-        if (!e.bech32Opnet) throw new Error(t + " has an invalid prefix");
-        return Rn({
-          program: r.data,
-          network: e
-        }).output;
-      } else if (r.version >= Qe && r.version <= xe && r.data.length >= Ae && r.data.length <= ke)
-        return r.version !== De && console.warn(Ss), Cr([
-          r.version + et,
-          r.data
-        ]);
-    }
-  }
-  throw new TypeError(t + " has no matching Script");
-}
-const ws = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
-  __proto__: null,
-  FUTURE_MAX_VERSION: Wn,
-  FUTURE_OPNET_VERSION: De,
-  FUTURE_SEGWIT_MAX_SIZE: ke,
-  FUTURE_SEGWIT_MAX_VERSION: xe,
-  FUTURE_SEGWIT_MIN_SIZE: Ae,
-  FUTURE_SEGWIT_MIN_VERSION: Qe,
-  FUTURE_SEGWIT_VERSION_DIFF: et,
-  _toFutureSegwitAddress: qn,
-  fromBase58Check: Dn,
-  fromBech32: Vn,
-  fromOutputScript: zn,
-  isUnknownSegwitVersion: Gn,
-  toBase58Check: bs,
-  toBech32: jn,
-  toFutureOPNetAddress: Xn,
-  toOutputScript: $n
-}, Symbol.toStringTag, { value: "Module" })), be = {};
-function Qo(t) {
-  t ? t !== be.eccLib && (Es(t), be.eccLib = t) : be.eccLib = t;
-}
-function ei() {
-  if (!be.eccLib)
-    throw new Error(
-      "No ECC Library provided. You must call initEccLib() with a valid TinySecp256k1Interface instance"
-    );
-  return be.eccLib;
-}
-const F = (t) => l.from(t, "hex");
-function Es(t) {
-  P(typeof t.isXOnlyPoint == "function"), P(t.isXOnlyPoint(F("79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"))), P(t.isXOnlyPoint(F("fffffffffffffffffffffffffffffffffffffffffffffffffffffffeeffffc2e"))), P(t.isXOnlyPoint(F("f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9"))), P(t.isXOnlyPoint(F("0000000000000000000000000000000000000000000000000000000000000001"))), P(
-    !t.isXOnlyPoint(F("0000000000000000000000000000000000000000000000000000000000000000"))
-  ), P(
-    !t.isXOnlyPoint(F("fffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"))
-  ), P(typeof t.xOnlyPointAddTweak == "function"), Ts.forEach((e) => {
-    const n = t.xOnlyPointAddTweak(F(e.pubkey), F(e.tweak));
-    e.result === null ? P(n === null) : (P(n !== null), P(n.parity === e.parity), P(l.from(n.xOnlyPubkey).equals(F(e.result))));
-  });
-}
-function P(t) {
-  if (!t) throw new Error("ecc library invalid");
-}
-const Ts = [
-  {
-    pubkey: "79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798",
-    tweak: "fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364140",
-    parity: -1,
-    result: null
-  },
-  {
-    pubkey: "1617d38ed8d8657da4d4761e8057bc396ea9e4b9d29776d4be096016dbd2509b",
-    tweak: "a8397a935f0dfceba6ba9618f6451ef4d80637abf4e6af2669fbc9de6a8fd2ac",
-    parity: 1,
-    result: "e478f99dab91052ab39a33ea35fd5e6e4933f4d28023cd597c9a1f6760346adf"
-  },
-  {
-    pubkey: "2c0b7cf95324a07d05398b240174dc0c2be444d96b159aa6c7f7b1e668680991",
-    tweak: "823c3cd2142744b075a87eade7e1b8678ba308d566226a0056ca2b7a76f86b47",
-    parity: 0,
-    result: "9534f8dc8c6deda2dc007655981c78b49c5d96c778fbf363462a11ec9dfd948c"
-  }
-];
-const _s = {
+const us = {
   p: 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2fn,
   n: 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141n,
   b: 7n,
   Gx: 0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798n,
   Gy: 0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8n
-}, { p: ie, n: Yn, Gx: ms, Gy: vs, b: Zn } = _s, Xe = 32, gt = 64, N = (t = "") => {
+}, { p: se, n: Ln, Gx: fs, Gy: ps, b: Mn } = us, Me = 32, ht = 64, P = (t = "") => {
   throw new Error(t);
-}, Jn = (t) => typeof t == "bigint", Qn = (t) => typeof t == "string", Is = (t) => t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array", Te = (t, e) => !Is(t) || typeof e == "number" && e > 0 && t.length !== e ? N("Uint8Array expected") : t, er = (t) => new Uint8Array(t), ks = (t) => Uint8Array.from(t), tr = (t, e) => t.toString(16).padStart(e, "0"), nr = (t) => Array.from(Te(t)).map((e) => tr(e, 2)).join(""), K = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 }, Ht = (t) => {
-  if (t >= K._0 && t <= K._9)
-    return t - K._0;
-  if (t >= K.A && t <= K.F)
-    return t - (K.A - 10);
-  if (t >= K.a && t <= K.f)
-    return t - (K.a - 10);
-}, rr = (t) => {
+}, Wn = (t) => typeof t == "bigint", Gn = (t) => typeof t == "string", hs = (t) => t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array", we = (t, e) => !hs(t) || typeof e == "number" && e > 0 && t.length !== e ? P("Uint8Array expected") : t, Dn = (t) => new Uint8Array(t), ls = (t) => Uint8Array.from(t), qn = (t, e) => t.toString(16).padStart(e, "0"), Xn = (t) => Array.from(we(t)).map((e) => qn(e, 2)).join(""), R = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 }, Ot = (t) => {
+  if (t >= R._0 && t <= R._9)
+    return t - R._0;
+  if (t >= R.A && t <= R.F)
+    return t - (R.A - 10);
+  if (t >= R.a && t <= R.f)
+    return t - (R.a - 10);
+}, Vn = (t) => {
   const e = "hex invalid";
-  if (!Qn(t))
-    return N(e);
+  if (!Gn(t))
+    return P(e);
   const n = t.length, r = n / 2;
   if (n % 2)
-    return N(e);
-  const c = er(r);
+    return P(e);
+  const c = Dn(r);
   for (let s = 0, o = 0; s < r; s++, o += 2) {
-    const i = Ht(t.charCodeAt(o)), a = Ht(t.charCodeAt(o + 1));
+    const i = Ot(t.charCodeAt(o)), a = Ot(t.charCodeAt(o + 1));
     if (i === void 0 || a === void 0)
-      return N(e);
+      return P(e);
     c[s] = i * 16 + a;
   }
   return c;
-}, sr = (t, e) => Te(Qn(t) ? rr(t) : ks(Te(t)), e), Ut = (...t) => {
-  const e = er(t.reduce((r, c) => r + Te(c).length, 0));
+}, jn = (t, e) => we(Gn(t) ? Vn(t) : ls(we(t)), e), Pt = (...t) => {
+  const e = Dn(t.reduce((r, c) => r + we(c).length, 0));
   let n = 0;
   return t.forEach((r) => {
     e.set(r, n), n += r.length;
   }), e;
-}, Ve = BigInt, Oe = (t, e, n, r = "bad number: out of range") => Jn(t) && e <= t && t < n ? t : N(r), T = (t, e = ie) => {
+}, Ge = BigInt, me = (t, e, n, r = "bad number: out of range") => Wn(t) && e <= t && t < n ? t : P(r), T = (t, e = se) => {
   const n = t % e;
   return n >= 0n ? n : e + n;
-}, As = (t, e) => {
-  (t === 0n || e <= 0n) && N("no inverse n=" + t + " mod=" + e);
+}, ds = (t, e) => {
+  (t === 0n || e <= 0n) && P("no inverse n=" + t + " mod=" + e);
   let n = T(t, e), r = e, c = 0n, s = 1n;
   for (; n !== 0n; ) {
     const o = r / n, i = r % n, a = c - s * o;
     r = n, n = i, c = s, s = a;
   }
-  return r === 1n ? T(c, e) : N("no inverse");
-}, Bt = (t) => t instanceof O ? t : N("Point expected"), or = (t) => T(T(t * t) * t + Zn), Rt = (t) => Oe(t, 0n, ie), qe = (t) => Oe(t, 1n, ie), xs = (t) => Oe(t, 1n, Yn), yt = (t) => (t & 1n) === 0n, ir = (t) => Uint8Array.of(t), Os = (t) => ir(yt(t) ? 2 : 3), Cs = (t) => {
-  const e = or(qe(t));
+  return r === 1n ? T(c, e) : P("no inverse");
+}, Nt = (t) => t instanceof C ? t : P("Point expected"), zn = (t) => T(T(t * t) * t + Mn), Ht = (t) => me(t, 0n, se), We = (t) => me(t, 1n, se), gs = (t) => me(t, 1n, Ln), lt = (t) => (t & 1n) === 0n, Yn = (t) => Uint8Array.of(t), ys = (t) => Yn(lt(t) ? 2 : 3), Ss = (t) => {
+  const e = zn(We(t));
   let n = 1n;
-  for (let r = e, c = (ie + 1n) / 4n; c > 0n; c >>= 1n)
-    c & 1n && (n = n * r % ie), r = r * r % ie;
-  return T(n * n) === e ? n : N("sqrt invalid");
+  for (let r = e, c = (se + 1n) / 4n; c > 0n; c >>= 1n)
+    c & 1n && (n = n * r % se), r = r * r % se;
+  return T(n * n) === e ? n : P("sqrt invalid");
 };
-class O {
+class C {
   static BASE;
   static ZERO;
   px;
   py;
   pz;
   constructor(e, n, r) {
-    this.px = Rt(e), this.py = qe(n), this.pz = Rt(r), Object.freeze(this);
+    this.px = Ht(e), this.py = We(n), this.pz = Ht(r), Object.freeze(this);
   }
   /** Convert Uint8Array or hex string to Point. */
   static fromBytes(e) {
-    Te(e);
+    we(e);
     let n;
-    const r = e[0], c = e.subarray(1), s = Ft(c, 0, Xe), o = e.length;
-    if (o === Xe + 1 && [2, 3].includes(r)) {
-      let i = Cs(s);
-      const a = yt(i);
-      yt(Ve(r)) !== a && (i = T(-i)), n = new O(s, i, 1n);
+    const r = e[0], c = e.subarray(1), s = Ut(c, 0, Me), o = e.length;
+    if (o === Me + 1 && [2, 3].includes(r)) {
+      let i = Ss(s);
+      const a = lt(i);
+      lt(Ge(r)) !== a && (i = T(-i)), n = new C(s, i, 1n);
     }
-    return o === gt + 1 && r === 4 && (n = new O(s, Ft(c, Xe, gt), 1n)), n ? n.assertValidity() : N("bad point: not on curve");
+    return o === ht + 1 && r === 4 && (n = new C(s, Ut(c, Me, ht), 1n)), n ? n.assertValidity() : P("bad point: not on curve");
   }
   /** Equality check: compare points P&Q. */
   equals(e) {
-    const { px: n, py: r, pz: c } = this, { px: s, py: o, pz: i } = Bt(e), a = T(n * i), u = T(s * c), f = T(r * i), p = T(o * c);
+    const { px: n, py: r, pz: c } = this, { px: s, py: o, pz: i } = Nt(e), a = T(n * i), u = T(s * c), f = T(r * i), p = T(o * c);
     return a === u && f === p;
   }
   is0() {
-    return this.equals(oe);
+    return this.equals(re);
   }
   /** Flip point over y coordinate. */
   negate() {
-    return new O(this.px, T(-this.py), this.pz);
+    return new C(this.px, T(-this.py), this.pz);
   }
   /** Point doubling: P+P, complete formula. */
   double() {
@@ -962,13 +764,13 @@ class O {
    */
   // prettier-ignore
   add(e) {
-    const { px: n, py: r, pz: c } = this, { px: s, py: o, pz: i } = Bt(e), a = 0n, u = Zn;
+    const { px: n, py: r, pz: c } = this, { px: s, py: o, pz: i } = Nt(e), a = 0n, u = Mn;
     let f = 0n, p = 0n, g = 0n;
     const y = T(u * 3n);
-    let h = T(n * s), d = T(r * o), w = T(c * i), E = T(n + r), S = T(s + o);
-    E = T(E * S), S = T(h + d), E = T(E - S), S = T(n + c);
-    let b = T(s + i);
-    return S = T(S * b), b = T(h + w), S = T(S - b), b = T(r + c), f = T(o + i), b = T(b * f), f = T(d + w), b = T(b - f), g = T(a * S), f = T(y * w), g = T(f + g), f = T(d - g), g = T(d + g), p = T(f * g), d = T(h + h), d = T(d + h), w = T(a * w), S = T(y * S), d = T(d + w), w = T(h - w), w = T(a * w), S = T(S + w), h = T(d * S), p = T(p + h), h = T(b * S), f = T(E * f), f = T(f - h), h = T(E * d), g = T(b * g), g = T(g + h), new O(f, p, g);
+    let h = T(n * s), d = T(r * o), E = T(c * i), b = T(n + r), S = T(s + o);
+    b = T(b * S), S = T(h + d), b = T(b - S), S = T(n + c);
+    let w = T(s + i);
+    return S = T(S * w), w = T(h + E), S = T(S - w), w = T(r + c), f = T(o + i), w = T(w * f), f = T(d + E), w = T(w - f), g = T(a * S), f = T(y * E), g = T(f + g), f = T(d - g), g = T(d + g), p = T(f * g), d = T(h + h), d = T(d + h), E = T(a * E), S = T(y * S), d = T(d + E), E = T(h - E), E = T(a * E), S = T(S + E), h = T(d * S), p = T(p + h), h = T(w * S), f = T(b * f), f = T(f - h), h = T(b * d), g = T(w * g), g = T(g + h), new C(f, p, g);
   }
   /**
    * Point-by-scalar multiplication. Scalar must be in range 1 <= n < CURVE.n.
@@ -979,12 +781,12 @@ class O {
    */
   multiply(e, n = !0) {
     if (!n && e === 0n)
-      return oe;
-    if (xs(e), e === 1n)
+      return re;
+    if (gs(e), e === 1n)
       return this;
-    if (this.equals(fe))
-      return Bs(e).p;
-    let r = oe, c = fe;
+    if (this.equals(ae))
+      return _s(e).p;
+    let r = re, c = ae;
     for (let s = this; e > 0n; s = s.double(), e >>= 1n)
       e & 1n ? r = r.add(s) : n && (c = c.add(s));
     return r;
@@ -992,36 +794,36 @@ class O {
   /** Convert point to 2d xy affine point. (X, Y, Z) ∋ (x=X/Z, y=Y/Z) */
   toAffine() {
     const { px: e, py: n, pz: r } = this;
-    if (this.equals(oe))
+    if (this.equals(re))
       return { x: 0n, y: 0n };
     if (r === 1n)
       return { x: e, y: n };
-    const c = As(r, ie);
-    return T(r * c) !== 1n && N("inverse invalid"), { x: T(e * c), y: T(n * c) };
+    const c = ds(r, se);
+    return T(r * c) !== 1n && P("inverse invalid"), { x: T(e * c), y: T(n * c) };
   }
   /** Checks if the point is valid and on-curve. */
   assertValidity() {
     const { x: e, y: n } = this.toAffine();
-    return qe(e), qe(n), T(n * n) === or(e) ? this : N("bad point: not on curve");
+    return We(e), We(n), T(n * n) === zn(e) ? this : P("bad point: not on curve");
   }
   /** Converts point to 33/65-byte Uint8Array. */
   toBytes(e = !0) {
-    const { x: n, y: r } = this.assertValidity().toAffine(), c = Kt(n);
-    return e ? Ut(Os(r), c) : Ut(ir(4), c, Kt(r));
+    const { x: n, y: r } = this.assertValidity().toAffine(), c = Bt(n);
+    return e ? Pt(ys(r), c) : Pt(Yn(4), c, Bt(r));
   }
   /** Create 3d xyz point from 2d xy. (0, 0) => (0, 1, 0), not (0, 0, 1) */
   static fromAffine(e) {
     const { x: n, y: r } = e;
-    return n === 0n && r === 0n ? oe : new O(n, r, 1n);
+    return n === 0n && r === 0n ? re : new C(n, r, 1n);
   }
   toHex(e) {
-    return nr(this.toBytes(e));
+    return Xn(this.toBytes(e));
   }
   static fromPrivateKey(e) {
-    return fe.multiply(Ns(e));
+    return ae.multiply(Es(e));
   }
   static fromHex(e) {
-    return O.fromBytes(sr(e));
+    return C.fromBytes(jn(e));
   }
   get x() {
     return this.toAffine().x;
@@ -1033,296 +835,47 @@ class O {
     return this.toBytes(e);
   }
 }
-const fe = new O(ms, vs, 1n), oe = new O(0n, 1n, 0n);
-O.BASE = fe;
-O.ZERO = oe;
-const cr = (t) => Ve("0x" + (nr(t) || "0")), Ft = (t, e, n) => cr(t.subarray(e, n)), Ps = 2n ** 256n, Kt = (t) => rr(tr(Oe(t, 0n, Ps), gt)), Ns = (t) => {
-  const e = Jn(t) ? t : cr(sr(t, Xe));
-  return Oe(e, 1n, Yn, "private key invalid 3");
-}, je = 8, Hs = 256, ar = Math.ceil(Hs / je) + 1, St = 2 ** (je - 1), Us = () => {
+const ae = new C(fs, ps, 1n), re = new C(0n, 1n, 0n);
+C.BASE = ae;
+C.ZERO = re;
+const $n = (t) => Ge("0x" + (Xn(t) || "0")), Ut = (t, e, n) => $n(t.subarray(e, n)), ws = 2n ** 256n, Bt = (t) => Vn(qn(me(t, 0n, ws), ht)), Es = (t) => {
+  const e = Wn(t) ? t : $n(jn(t, Me));
+  return me(e, 1n, Ln, "private key invalid 3");
+}, De = 8, bs = 256, Zn = Math.ceil(bs / De) + 1, dt = 2 ** (De - 1), Ts = () => {
   const t = [];
-  let e = fe, n = e;
-  for (let r = 0; r < ar; r++) {
+  let e = ae, n = e;
+  for (let r = 0; r < Zn; r++) {
     n = e, t.push(n);
-    for (let c = 1; c < St; c++)
+    for (let c = 1; c < dt; c++)
       n = n.add(e), t.push(n);
     e = n.double();
   }
   return t;
 };
-let Lt;
-const Mt = (t, e) => {
+let Rt;
+const Ft = (t, e) => {
   const n = e.negate();
   return t ? n : e;
-}, Bs = (t) => {
-  const e = Lt || (Lt = Us());
-  let n = oe, r = fe;
-  const c = 2 ** je, s = c, o = Ve(c - 1), i = Ve(je);
-  for (let a = 0; a < ar; a++) {
+}, _s = (t) => {
+  const e = Rt || (Rt = Ts());
+  let n = re, r = ae;
+  const c = 2 ** De, s = c, o = Ge(c - 1), i = Ge(De);
+  for (let a = 0; a < Zn; a++) {
     let u = Number(t & o);
-    t >>= i, u > St && (u -= s, t += 1n);
-    const f = a * St, p = f, g = f + Math.abs(u) - 1, y = a % 2 !== 0, h = u < 0;
-    u === 0 ? r = r.add(Mt(y, e[p])) : n = n.add(Mt(h, e[g]));
+    t >>= i, u > dt && (u -= s, t += 1n);
+    const f = a * dt, p = f, g = f + Math.abs(u) - 1, y = a % 2 !== 0, h = u < 0;
+    u === 0 ? r = r.add(Ft(y, e[p])) : n = n.add(Ft(h, e[g]));
   }
   return { p: n, f: r };
-};
-var ce = {}, Wt;
-function le() {
-  if (Wt) return ce;
-  Wt = 1, Object.defineProperty(ce, "__esModule", { value: !0 });
-  const t = 9007199254740991;
-  function e(s) {
-    if (s < 0 || s > t || s % 1 !== 0)
-      throw new RangeError("value out of range");
-  }
-  function n(s, o, i) {
-    if (e(s), o || (o = l.allocUnsafe(c(s))), !l.isBuffer(o))
-      throw new TypeError("buffer must be a Buffer instance");
-    return i || (i = 0), s < 253 ? (o.writeUInt8(s, i), Object.assign(n, { bytes: 1 })) : s <= 65535 ? (o.writeUInt8(253, i), o.writeUInt16LE(s, i + 1), Object.assign(n, { bytes: 3 })) : s <= 4294967295 ? (o.writeUInt8(254, i), o.writeUInt32LE(s, i + 1), Object.assign(n, { bytes: 5 })) : (o.writeUInt8(255, i), o.writeUInt32LE(s >>> 0, i + 1), o.writeUInt32LE(s / 4294967296 | 0, i + 5), Object.assign(n, { bytes: 9 })), o;
-  }
-  ce.encode = n;
-  function r(s, o) {
-    if (!l.isBuffer(s))
-      throw new TypeError("buffer must be a Buffer instance");
-    o || (o = 0);
-    const i = s.readUInt8(o);
-    if (i < 253)
-      return Object.assign(r, { bytes: 1 }), i;
-    if (i === 253)
-      return Object.assign(r, { bytes: 3 }), s.readUInt16LE(o + 1);
-    if (i === 254)
-      return Object.assign(r, { bytes: 5 }), s.readUInt32LE(o + 1);
-    {
-      Object.assign(r, { bytes: 9 });
-      const a = s.readUInt32LE(o + 1), f = s.readUInt32LE(o + 5) * 4294967296 + a;
-      return e(f), f;
-    }
-  }
-  ce.decode = r;
-  function c(s) {
-    return e(s), s < 253 ? 1 : s <= 65535 ? 3 : s <= 4294967295 ? 5 : 9;
-  }
-  return ce.encodingLength = c, ce;
-}
-var bt = le();
-const we = (t) => {
+}, ye = (t) => {
   const e = t.length === 32 ? t : t.subarray(1, 33);
   return l.isBuffer(e) ? e : l.from(e);
 };
-function Gt(t, e, n) {
-  const r = $s(e, t, n);
-  try {
-    const s = js(e, r).concat(r.script).concat(r.controlBlock);
-    return { finalScriptWitness: Ee(s) };
-  } catch (c) {
-    throw new Error(`Can not finalize taproot input #${t}: ${c}`);
-  }
-}
-function Pe(t, e) {
-  const n = e ? l.from([e]) : l.from([]);
-  return l.concat([t, n]);
-}
-function H(t) {
-  return t && !!(t.tapInternalKey || t.tapMerkleRoot || t.tapLeafScript && t.tapLeafScript.length || t.tapBip32Derivation && t.tapBip32Derivation.length || t.witnessUtxo && It(t.witnessUtxo.script));
-}
-function at(t, e) {
-  return t && !!(t.tapInternalKey || t.tapTree || t.tapBip32Derivation && t.tapBip32Derivation.length || e && It(e));
-}
-function Xt(t, e, n) {
-  qs(t, e, n), Vs(t, e, n);
-}
-function qt(t, e, n) {
-  Ds(t, e, n), Rs(t, e);
-}
-function Rs(t, e) {
-  if (!e.tapTree && !e.tapInternalKey) return;
-  const n = e.tapInternalKey || t.tapInternalKey, r = e.tapTree || t.tapTree;
-  if (n) {
-    const c = t.script, s = Fs(n, r);
-    if (c && !c.equals(s))
-      throw new Error("Error adding output. Script or address missmatch.");
-  }
-}
-function Fs(t, e) {
-  const n = e && Ks(e.leaves), { output: r } = Ie({
-    internalPubkey: t,
-    scriptTree: n
-  });
-  if (!r) throw new Error("Failed to generate taproot script pubkey");
-  return r;
-}
-function ti(t, e) {
-  const n = e.tapInternalKey, r = n && Kr(n, e.tapMerkleRoot);
-  if (!r)
-    throw new Error(
-      `Cannot tweak tap internal key for input #${t}. Public key: ${n && n.toString("hex")}`
-    );
-  return r.x;
-}
-function ni(t) {
-  if (!Fr(t))
-    throw new Error("Cannot convert taptree to tapleaf list. Expecting a tapree structure.");
-  return wt(t);
-}
-function Ks(t = []) {
-  return t.length === 1 && t[0].depth === 0 ? {
-    output: t[0].script,
-    version: t[0].leafVersion
-  } : Xs(t);
-}
-function Ls(t, e) {
-  return Ws(t).some((r) => pr(r, Ms, e));
-}
-function Ms(t) {
-  return {
-    signature: t.subarray(0, 64),
-    hashType: t.subarray(64)[0] || I.SIGHASH_DEFAULT
-  };
-}
-function Ws(t) {
-  const e = [];
-  if (t.tapKeySig && e.push(t.tapKeySig), t.tapScriptSig && e.push(...t.tapScriptSig.map((n) => n.signature)), !e.length) {
-    const n = Gs(t.finalScriptWitness);
-    n && e.push(n);
-  }
-  return e;
-}
-function Gs(t) {
-  if (!t) return;
-  const e = t.subarray(2);
-  if (e.length === 64 || e.length === 65) return e;
-}
-function wt(t, e = [], n = 0) {
-  if (n > Fn) throw new Error("Max taptree depth exceeded.");
-  return t ? Un(t) ? (e.push({
-    depth: n,
-    leafVersion: t.version || Lr,
-    script: t.output
-  }), e) : (t[0] && wt(t[0], e, n + 1), t[1] && wt(t[1], e, n + 1), e) : [];
-}
-function Xs(t) {
-  let e;
-  for (const n of t)
-    if (e = Et(n, e), !e) throw new Error("No room left to insert tapleaf in tree");
-  return e;
-}
-function Et(t, e, n = 0) {
-  if (n > Fn) throw new Error("Max taptree depth exceeded.");
-  if (t.depth === n)
-    return e ? void 0 : {
-      output: t.script,
-      version: t.leafVersion
-    };
-  if (Un(e)) return;
-  const r = Et(t, e && e[0], n + 1);
-  if (r) return [r, e && e[1]];
-  const c = Et(t, e && e[1], n + 1);
-  if (c) return [e && e[0], c];
-}
-function qs(t, e, n) {
-  const r = H(t) && pe(e), c = pe(t) && H(e), s = t === e && H(e) && pe(e);
-  if (r || c || s)
-    throw new Error(
-      `Invalid arguments for Psbt.${n}. Cannot use both taproot and non-taproot fields.`
-    );
-}
-function Ds(t, e, n) {
-  const r = at(t) && pe(e), c = pe(t) && at(e), s = t === e && at(e) && pe(e);
-  if (r || c || s)
-    throw new Error(
-      `Invalid arguments for Psbt.${n}. Cannot use both taproot and non-taproot fields.`
-    );
-}
-function Vs(t, e, n) {
-  if (e.tapMerkleRoot) {
-    const r = (e.tapLeafScript || []).every(
-      (s) => ut(s, e.tapMerkleRoot)
-    ), c = (t.tapLeafScript || []).every(
-      (s) => ut(s, e.tapMerkleRoot)
-    );
-    if (!r || !c)
-      throw new Error(`Invalid arguments for Psbt.${n}. Tapleaf not part of taptree.`);
-  } else if (t.tapMerkleRoot && !(e.tapLeafScript || []).every(
-    (c) => ut(c, t.tapMerkleRoot)
-  ))
-    throw new Error(`Invalid arguments for Psbt.${n}. Tapleaf not part of taptree.`);
-}
-function ut(t, e) {
-  if (!e) return !0;
-  const n = Ye({
-    output: t.script,
-    version: t.leafVersion
-  });
-  return Mr(t.controlBlock, n).equals(e);
-}
-function js(t, e) {
-  const n = Ye({
-    output: e.script,
-    version: e.leafVersion
-  });
-  return (t.tapScriptSig || []).filter((r) => r.leafHash.equals(n)).map((r) => zs(e.script, r)).sort((r, c) => c.positionInScript - r.positionInScript).map((r) => r.signature);
-}
-function zs(t, e) {
-  return Object.assign(
-    {
-      positionInScript: fr(e.pubkey, t)
-    },
-    e
-  );
-}
-function $s(t, e, n) {
-  const { tapScriptSig: r } = t;
-  if (!r || !r.length)
-    throw new Error(
-      `Can not finalize taproot input #${e}. No tapleaf script signature provided.`
-    );
-  const c = (t.tapLeafScript || []).sort((s, o) => s.controlBlock.length - o.controlBlock.length).find((s) => Ys(s, r, n));
-  if (!c)
-    throw new Error(
-      `Can not finalize taproot input #${e}. Signature for tapleaf script not found.`
-    );
-  return c;
-}
-function Ys(t, e, n) {
-  const r = Ye({
-    output: t.script,
-    version: t.leafVersion
-  });
-  return (!n || n.equals(r)) && e.find((s) => s.leafHash.equals(r)) !== void 0;
-}
-function pe(t) {
-  return t && !!(t.redeemScript || t.witnessScript || t.bip32Derivation && t.bip32Derivation.length);
-}
-function ne(t) {
-  return (e) => {
-    try {
-      return t({ output: e }), !0;
-    } catch {
-      return !1;
-    }
-  };
-}
-const Zs = ne(Ze), Js = ne(Kn), Qs = ne(_e), tt = ne($e), Dt = ne(ve), ur = ne(me), It = ne(Ie), ri = ne(Rn), si = (t) => t.length === 4 && t[0] === 81 && // OP_1
-t[1] === 2 && // push 2 bytes
-t[2] === 78 && t[3] === 115;
-function Ee(t) {
-  let e = l.allocUnsafe(0);
-  function n(o) {
-    e = l.concat([e, l.from(o)]);
-  }
-  function r(o) {
-    const i = e.length, a = bt.encodingLength(o);
-    e = l.concat([e, l.allocUnsafe(a)]), bt.encode(o, e, i);
-  }
-  function c(o) {
-    r(o.length), n(o);
-  }
-  function s(o) {
-    r(o.length), o.forEach(c);
-  }
-  return s(t), e;
+function Kt(t) {
+  let e = t.toString(16);
+  return e = e.padStart(64, "0"), e.length > 64 && (e = e.slice(-64)), l.from(e, "hex");
 }
-function eo(t) {
+function ms(t) {
   if (t.length === 32)
     return;
   if (![33, 65].includes(t.length)) {
@@ -1333,11 +886,11 @@ function eo(t) {
   }
   let e;
   try {
-    e = O.fromHex(t);
+    e = C.fromHex(t);
   } catch {
     throw new Error("Invalid secp256k1 public key bytes. Cannot parse.");
   }
-  const n = Vt(e.x), r = Vt(e.y), s = e.y % 2n === 0n ? 6 : 7, o = l.alloc(65);
+  const n = Kt(e.x), r = Kt(e.y), s = e.y % 2n === 0n ? 6 : 7, o = l.alloc(65);
   o[0] = s, n.copy(o, 1), r.copy(o, 33);
   const i = l.concat([l.from([4]), n, r]);
   return {
@@ -1345,11 +898,7 @@ function eo(t) {
     uncompressed: i
   };
 }
-function Vt(t) {
-  let e = t.toString(16);
-  return e = e.padStart(64, "0"), e.length > 64 && (e = e.slice(-64)), l.from(e, "hex");
-}
-function Ne(t, e) {
+function xe(t, e) {
   if (t.equals(e)) return !0;
   if (t.length === 65 && e.length === 65) {
     const n = l.from(t), r = l.from(e);
@@ -1357,51 +906,164 @@ function Ne(t, e) {
   }
   return !1;
 }
-function fr(t, e) {
-  const n = he(e);
-  if (n === null) throw new Error("Unknown script error");
-  const r = ot(t), c = we(t), s = eo(t), o = s?.hybrid ? ot(s.hybrid) : void 0, i = s?.uncompressed ? ot(s.uncompressed) : void 0;
-  return n.findIndex((a) => {
-    if (typeof a == "number") return !1;
-    if (Ne(a, t) || Ne(a, c) || a.equals(r) || s && (Ne(a, s.uncompressed) || Ne(a, s.hybrid) || o && a.equals(o) || i && a.equals(i)))
-      return !0;
-  });
+const Ie = 40, ve = 2, ke = 15, Jn = 16, qe = 16, $e = 2, Ze = 80, Is = "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.", Qn = (t) => {
+  try {
+    const e = l.from(t.subarray(2));
+    if (e.length < ve || e.length > Ie)
+      throw new TypeError("Invalid program length for segwit address");
+    const n = t[0] - Ze;
+    if (n < $e || n > ke + 1)
+      throw new TypeError("Invalid version for segwit address");
+    if (n === 1) throw new TypeError("taproot");
+    return !0;
+  } catch {
+  }
+  return !1;
+};
+function er(t, e) {
+  if (!l.isBuffer(t)) throw new TypeError("output must be a Buffer");
+  if (!e.bech32Opnet) throw new Error("Network does not support opnet");
+  const n = t[0];
+  let r = 1, c;
+  if (t[1] < 76)
+    c = t[1], r = 2;
+  else if (t[1] === 76)
+    c = t[2], r = 3;
+  else
+    throw new TypeError("Unsupported push opcode in script");
+  const s = l.from(t.subarray(r, r + c));
+  if (s.length < ve || s.length > Ie)
+    throw new TypeError("Invalid program length for segwit address");
+  const o = n === Ae.OP_0 ? 0 : n >= Ae.OP_1 && n <= Ae.OP_16 ? n - (Ae.OP_1 - 1) : -1;
+  if (o < ke || o > Jn)
+    throw new TypeError(`Invalid segwit version ${o}`);
+  const i = [o, ...K.bech32m.toWords(s)];
+  return K.bech32m.encode(e.bech32Opnet, i);
 }
-function nt(t, e) {
-  return fr(t, e) !== -1;
+function tr(t, e) {
+  const n = l.from(t.subarray(2));
+  if (n.length < ve || n.length > Ie)
+    throw new TypeError("Invalid program length for segwit address");
+  const r = t[0] - Ze;
+  if (r < $e || r > ke)
+    throw new TypeError("Invalid version for segwit address");
+  if (t[1] !== n.length)
+    throw new TypeError(`Invalid script for segwit address ${t[1]} !== ${n.length}`);
+  return rr(n, r, e.bech32, e.bech32Opnet);
 }
-function to(t, e) {
-  return no(t).some((r) => pr(r, Se.decode, e));
+function nr(t) {
+  const e = l.from(Fn.decode(t));
+  if (e.length < 21) throw new TypeError(t + " is too short");
+  if (e.length > 21) throw new TypeError(t + " is too long");
+  const n = e.readUInt8(0), r = l.from(e.subarray(1));
+  return { version: n, hash: r };
 }
-function pr(t, e, n) {
-  const { hashType: r } = e(t), c = [];
-  switch (r & I.SIGHASH_ANYONECANPAY && c.push("addInput"), r & 31) {
-    case I.SIGHASH_ALL:
-      break;
-    case I.SIGHASH_SINGLE:
-    case I.SIGHASH_NONE:
-      c.push("addOutput"), c.push("setInputSequence");
-      break;
-  }
-  return c.indexOf(n) === -1;
+function vs(t, e) {
+  Pr(Nr(Hr, Ur), [t, e]);
+  const n = l.allocUnsafe(21);
+  return n.writeUInt8(e, 0), t.copy(n, 1), Fn.encode(n);
 }
-function no(t) {
-  const { partialSig: e } = t;
-  let n;
-  if (!e || e.length === 0) {
-    if (!t.finalScriptSig && !t.finalScriptWitness) return [];
-    n = ro(t);
-  } else
-    n = e;
-  return n.map((r) => r.signature);
+function rr(t, e, n, r) {
+  const c = K.bech32.toWords(t);
+  return c.unshift(e), e === qe && r ? K.bech32m.encode(r, c) : e === 0 ? K.bech32.encode(n, c) : K.bech32m.encode(n, c);
 }
-function ro(t) {
-  const e = t.finalScriptSig ? he(t.finalScriptSig) || [] : [], n = t.finalScriptWitness ? he(t.finalScriptWitness) || [] : [];
-  return e.concat(n).filter((r) => l.isBuffer(r) && Hn(r)).map((r) => ({ signature: r }));
+function sr(t, e) {
+  e = e || Ye;
+  try {
+    return Ee({ output: t, network: e }).address;
+  } catch {
+  }
+  try {
+    return be({ output: t, network: e }).address;
+  } catch {
+  }
+  try {
+    return Ve({ output: t, network: e }).address;
+  } catch {
+  }
+  try {
+    return Te({ output: t, network: e }).address;
+  } catch {
+  }
+  try {
+    return _e({ output: t, network: e }).address;
+  } catch {
+  }
+  try {
+    return er(t, e);
+  } catch {
+  }
+  try {
+    return tr(t, e);
+  } catch {
+  }
+  throw new Error(xr(t) + " has no matching Address");
 }
-var He = {}, Ue = {}, ft = {}, ae = {}, ue = {}, pt = {}, jt;
+function or(t, e) {
+  e = e || Ye;
+  let n, r;
+  try {
+    n = nr(t);
+  } catch {
+  }
+  if (n) {
+    if (n.version === e.pubKeyHash)
+      return Ee({ hash: n.hash }).output;
+    if (n.version === e.scriptHash)
+      return be({ hash: n.hash }).output;
+  } else {
+    try {
+      r = Kn(t);
+    } catch {
+    }
+    if (r) {
+      if (r.prefix !== e.bech32 && e.bech32Opnet && r.prefix !== e.bech32Opnet)
+        throw new Error(t + " has an invalid prefix");
+      if (r.version === 0) {
+        if (r.data.length === 20)
+          return Ve({ hash: r.data }).output;
+        if (r.data.length === 32)
+          return Te({ hash: r.data }).output;
+      } else if (r.version === 1) {
+        if (r.data.length === 32)
+          return _e({ pubkey: r.data }).output;
+      } else if (r.version === qe) {
+        if (!e.bech32Opnet) throw new Error(t + " has an invalid prefix");
+        return On({
+          program: r.data,
+          network: e
+        }).output;
+      } else if (r.version >= $e && r.version <= ke && r.data.length >= ve && r.data.length <= Ie)
+        return r.version !== qe && console.warn(Is), Cr([
+          r.version + Ze,
+          r.data
+        ]);
+    }
+  }
+  throw new TypeError(t + " has no matching Script");
+}
+const Do = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  __proto__: null,
+  FUTURE_MAX_VERSION: Jn,
+  FUTURE_OPNET_VERSION: qe,
+  FUTURE_SEGWIT_MAX_SIZE: Ie,
+  FUTURE_SEGWIT_MAX_VERSION: ke,
+  FUTURE_SEGWIT_MIN_SIZE: ve,
+  FUTURE_SEGWIT_MIN_VERSION: $e,
+  FUTURE_SEGWIT_VERSION_DIFF: Ze,
+  _toFutureSegwitAddress: tr,
+  fromBase58Check: nr,
+  fromBech32: Kn,
+  fromOutputScript: sr,
+  isUnknownSegwitVersion: Qn,
+  toBase58Check: vs,
+  toBech32: rr,
+  toFutureOPNetAddress: er,
+  toOutputScript: or
+}, Symbol.toStringTag, { value: "Module" }));
+var Ce = {}, Oe = {}, ot = {}, oe = {}, ie = {}, it = {}, Lt;
 function A() {
-  return jt || (jt = 1, (function(t) {
+  return Lt || (Lt = 1, (function(t) {
     Object.defineProperty(t, "__esModule", { value: !0 }), (function(e) {
       e[e.UNSIGNED_TX = 0] = "UNSIGNED_TX", e[e.GLOBAL_XPUB = 1] = "GLOBAL_XPUB";
     })(t.GlobalTypes || (t.GlobalTypes = {})), t.GLOBAL_TYPE_NAMES = ["unsignedTx", "globalXpub"], (function(e) {
@@ -1433,12 +1095,12 @@ function A() {
       "tapTree",
       "tapBip32Derivation"
     ];
-  })(pt)), pt;
+  })(it)), it;
 }
-var X = {}, zt;
-function so() {
-  if (zt) return X;
-  zt = 1, Object.defineProperty(X, "__esModule", { value: !0 });
+var W = {}, Mt;
+function ks() {
+  if (Mt) return W;
+  Mt = 1, Object.defineProperty(W, "__esModule", { value: !0 });
   const t = A(), e = (o) => [...Array(o).keys()];
   function n(o) {
     if (o.key[0] !== t.GlobalTypes.GLOBAL_XPUB)
@@ -1464,7 +1126,7 @@ function so() {
     }
     return a;
   }
-  X.decode = n;
+  W.decode = n;
   function r(o) {
     const i = l.from([t.GlobalTypes.GLOBAL_XPUB]), a = l.concat([i, o.extendedPubkey]), u = o.path.split("/"), f = l.allocUnsafe(u.length * 4);
     o.masterFingerprint.copy(f, 0);
@@ -1478,22 +1140,22 @@ function so() {
       value: f
     };
   }
-  X.encode = r, X.expected = "{ masterFingerprint: Buffer; extendedPubkey: Buffer; path: string; }";
+  W.encode = r, W.expected = "{ masterFingerprint: Buffer; extendedPubkey: Buffer; path: string; }";
   function c(o) {
     const i = o.extendedPubkey, a = o.masterFingerprint, u = o.path;
     return l.isBuffer(i) && i.length === 78 && [2, 3].indexOf(i[45]) > -1 && l.isBuffer(a) && a.length === 4 && typeof u == "string" && !!u.match(/^m(\/\d+'?)*$/);
   }
-  X.check = c;
+  W.check = c;
   function s(o, i, a) {
     const u = i.extendedPubkey.toString("hex");
     return a.has(u) ? !1 : (a.add(u), o.filter((f) => f.extendedPubkey.equals(i.extendedPubkey)).length === 0);
   }
-  return X.canAddToArray = s, X;
+  return W.canAddToArray = s, W;
 }
-var Be = {}, $t;
-function oo() {
-  if ($t) return Be;
-  $t = 1, Object.defineProperty(Be, "__esModule", { value: !0 });
+var Pe = {}, Wt;
+function As() {
+  if (Wt) return Pe;
+  Wt = 1, Object.defineProperty(Pe, "__esModule", { value: !0 });
   const t = A();
   function e(n) {
     return {
@@ -1501,12 +1163,12 @@ function oo() {
       value: n.toBuffer()
     };
   }
-  return Be.encode = e, Be;
+  return Pe.encode = e, Pe;
 }
-var q = {}, Yt;
-function io() {
-  if (Yt) return q;
-  Yt = 1, Object.defineProperty(q, "__esModule", { value: !0 });
+var G = {}, Gt;
+function xs() {
+  if (Gt) return G;
+  Gt = 1, Object.defineProperty(G, "__esModule", { value: !0 });
   const t = A();
   function e(s) {
     if (s.key[0] !== t.InputTypes.FINAL_SCRIPTSIG)
@@ -1515,27 +1177,27 @@ function io() {
       );
     return s.value;
   }
-  q.decode = e;
+  G.decode = e;
   function n(s) {
     return {
       key: l.from([t.InputTypes.FINAL_SCRIPTSIG]),
       value: s
     };
   }
-  q.encode = n, q.expected = "Buffer";
+  G.encode = n, G.expected = "Buffer";
   function r(s) {
     return l.isBuffer(s);
   }
-  q.check = r;
+  G.check = r;
   function c(s, o) {
     return !!s && !!o && s.finalScriptSig === void 0;
   }
-  return q.canAdd = c, q;
+  return G.canAdd = c, G;
 }
-var D = {}, Zt;
-function co() {
-  if (Zt) return D;
-  Zt = 1, Object.defineProperty(D, "__esModule", { value: !0 });
+var D = {}, Dt;
+function Cs() {
+  if (Dt) return D;
+  Dt = 1, Object.defineProperty(D, "__esModule", { value: !0 });
   const t = A();
   function e(s) {
     if (s.key[0] !== t.InputTypes.FINAL_SCRIPTWITNESS)
@@ -1561,10 +1223,10 @@ function co() {
   }
   return D.canAdd = c, D;
 }
-var V = {}, Jt;
-function ao() {
-  if (Jt) return V;
-  Jt = 1, Object.defineProperty(V, "__esModule", { value: !0 });
+var q = {}, qt;
+function Os() {
+  if (qt) return q;
+  qt = 1, Object.defineProperty(q, "__esModule", { value: !0 });
   const t = A();
   function e(s) {
     if (s.key[0] !== t.InputTypes.NON_WITNESS_UTXO)
@@ -1573,27 +1235,27 @@ function ao() {
       );
     return s.value;
   }
-  V.decode = e;
+  q.decode = e;
   function n(s) {
     return {
       key: l.from([t.InputTypes.NON_WITNESS_UTXO]),
       value: s
     };
   }
-  V.encode = n, V.expected = "Buffer";
+  q.encode = n, q.expected = "Buffer";
   function r(s) {
     return l.isBuffer(s);
   }
-  V.check = r;
+  q.check = r;
   function c(s, o) {
     return !!s && !!o && s.nonWitnessUtxo === void 0;
   }
-  return V.canAdd = c, V;
+  return q.canAdd = c, q;
 }
-var j = {}, Qt;
-function uo() {
-  if (Qt) return j;
-  Qt = 1, Object.defineProperty(j, "__esModule", { value: !0 });
+var X = {}, Xt;
+function Ps() {
+  if (Xt) return X;
+  Xt = 1, Object.defineProperty(X, "__esModule", { value: !0 });
   const t = A();
   function e(o) {
     if (o.key[0] !== t.InputTypes.PARTIAL_SIG)
@@ -1609,7 +1271,7 @@ function uo() {
       signature: o.value
     };
   }
-  j.decode = e;
+  X.decode = e;
   function n(o) {
     const i = l.from([t.InputTypes.PARTIAL_SIG]);
     return {
@@ -1617,11 +1279,11 @@ function uo() {
       value: o.signature
     };
   }
-  j.encode = n, j.expected = "{ pubkey: Buffer; signature: Buffer; }";
+  X.encode = n, X.expected = "{ pubkey: Buffer; signature: Buffer; }";
   function r(o) {
     return l.isBuffer(o.pubkey) && l.isBuffer(o.signature) && [33, 65].includes(o.pubkey.length) && [2, 3, 4].includes(o.pubkey[0]) && c(o.signature);
   }
-  j.check = r;
+  X.check = r;
   function c(o) {
     if (!l.isBuffer(o) || o.length < 9 || o[0] !== 48 || o.length !== o[1] + 3 || o[2] !== 2) return !1;
     const i = o[3];
@@ -1633,12 +1295,12 @@ function uo() {
     const u = i.pubkey.toString("hex");
     return a.has(u) ? !1 : (a.add(u), o.filter((f) => f.pubkey.equals(i.pubkey)).length === 0);
   }
-  return j.canAddToArray = s, j;
+  return X.canAddToArray = s, X;
 }
-var z = {}, en;
-function fo() {
-  if (en) return z;
-  en = 1, Object.defineProperty(z, "__esModule", { value: !0 });
+var V = {}, Vt;
+function Ns() {
+  if (Vt) return V;
+  Vt = 1, Object.defineProperty(V, "__esModule", { value: !0 });
   const t = A();
   function e(s) {
     if (s.key[0] !== t.InputTypes.POR_COMMITMENT)
@@ -1647,27 +1309,27 @@ function fo() {
       );
     return s.value.toString("utf8");
   }
-  z.decode = e;
+  V.decode = e;
   function n(s) {
     return {
       key: l.from([t.InputTypes.POR_COMMITMENT]),
       value: l.from(s, "utf8")
     };
   }
-  z.encode = n, z.expected = "string";
+  V.encode = n, V.expected = "string";
   function r(s) {
     return typeof s == "string";
   }
-  z.check = r;
+  V.check = r;
   function c(s, o) {
     return !!s && !!o && s.porCommitment === void 0;
   }
-  return z.canAdd = c, z;
+  return V.canAdd = c, V;
 }
-var $ = {}, tn;
-function po() {
-  if (tn) return $;
-  tn = 1, Object.defineProperty($, "__esModule", { value: !0 });
+var j = {}, jt;
+function Hs() {
+  if (jt) return j;
+  jt = 1, Object.defineProperty(j, "__esModule", { value: !0 });
   const t = A();
   function e(s) {
     if (s.key[0] !== t.InputTypes.SIGHASH_TYPE)
@@ -1676,7 +1338,7 @@ function po() {
       );
     return s.value.readUInt32LE(0);
   }
-  $.decode = e;
+  j.decode = e;
   function n(s) {
     const o = l.from([t.InputTypes.SIGHASH_TYPE]), i = l.allocUnsafe(4);
     return i.writeUInt32LE(s, 0), {
@@ -1684,20 +1346,20 @@ function po() {
       value: i
     };
   }
-  $.encode = n, $.expected = "number";
+  j.encode = n, j.expected = "number";
   function r(s) {
     return typeof s == "number";
   }
-  $.check = r;
+  j.check = r;
   function c(s, o) {
     return !!s && !!o && s.sighashType === void 0;
   }
-  return $.canAdd = c, $;
+  return j.canAdd = c, j;
 }
-var Y = {}, nn;
-function ho() {
-  if (nn) return Y;
-  nn = 1, Object.defineProperty(Y, "__esModule", { value: !0 });
+var z = {}, zt;
+function Us() {
+  if (zt) return z;
+  zt = 1, Object.defineProperty(z, "__esModule", { value: !0 });
   const t = A();
   function e(s) {
     if (s.key[0] !== t.InputTypes.TAP_KEY_SIG || s.key.length !== 1)
@@ -1710,24 +1372,24 @@ function ho() {
       );
     return s.value;
   }
-  Y.decode = e;
+  z.decode = e;
   function n(s) {
     return { key: l.from([t.InputTypes.TAP_KEY_SIG]), value: s };
   }
-  Y.encode = n, Y.expected = "Buffer";
+  z.encode = n, z.expected = "Buffer";
   function r(s) {
     return l.isBuffer(s) && (s.length === 64 || s.length === 65);
   }
-  Y.check = r;
+  z.check = r;
   function c(s, o) {
     return !!s && !!o && s.tapKeySig === void 0;
   }
-  return Y.canAdd = c, Y;
+  return z.canAdd = c, z;
 }
-var Z = {}, rn;
-function lo() {
-  if (rn) return Z;
-  rn = 1, Object.defineProperty(Z, "__esModule", { value: !0 });
+var Y = {}, Yt;
+function Bs() {
+  if (Yt) return Y;
+  Yt = 1, Object.defineProperty(Y, "__esModule", { value: !0 });
   const t = A();
   function e(s) {
     if (s.key[0] !== t.InputTypes.TAP_LEAF_SCRIPT)
@@ -1746,7 +1408,7 @@ function lo() {
     const i = s.value.slice(0, -1);
     return { controlBlock: s.key.slice(1), script: i, leafVersion: o };
   }
-  Z.decode = e;
+  Y.decode = e;
   function n(s) {
     const o = l.from([t.InputTypes.TAP_LEAF_SCRIPT]), i = l.from([s.leafVersion]);
     return {
@@ -1754,21 +1416,21 @@ function lo() {
       value: l.concat([s.script, i])
     };
   }
-  Z.encode = n, Z.expected = "{ controlBlock: Buffer; leafVersion: number, script: Buffer; }";
+  Y.encode = n, Y.expected = "{ controlBlock: Buffer; leafVersion: number, script: Buffer; }";
   function r(s) {
     return l.isBuffer(s.controlBlock) && (s.controlBlock.length - 1) % 32 === 0 && (s.controlBlock[0] & 254) === s.leafVersion && l.isBuffer(s.script);
   }
-  Z.check = r;
+  Y.check = r;
   function c(s, o, i) {
     const a = o.controlBlock.toString("hex");
     return i.has(a) ? !1 : (i.add(a), s.filter((u) => u.controlBlock.equals(o.controlBlock)).length === 0);
   }
-  return Z.canAddToArray = c, Z;
+  return Y.canAddToArray = c, Y;
 }
-var J = {}, sn;
-function go() {
-  if (sn) return J;
-  sn = 1, Object.defineProperty(J, "__esModule", { value: !0 });
+var $ = {}, $t;
+function Rs() {
+  if ($t) return $;
+  $t = 1, Object.defineProperty($, "__esModule", { value: !0 });
   const t = A();
   function e(s) {
     if (s.key[0] !== t.InputTypes.TAP_MERKLE_ROOT || s.key.length !== 1)
@@ -1779,24 +1441,24 @@ function go() {
       throw new Error("Decode Error: tapMerkleRoot not a 32-byte hash");
     return s.value;
   }
-  J.decode = e;
+  $.decode = e;
   function n(s) {
     return { key: l.from([t.InputTypes.TAP_MERKLE_ROOT]), value: s };
   }
-  J.encode = n, J.expected = "Buffer";
+  $.encode = n, $.expected = "Buffer";
   function r(s) {
     return l.isBuffer(s) && s.length === 32;
   }
-  J.check = r;
+  $.check = r;
   function c(s, o) {
     return !!s && !!o && s.tapMerkleRoot === void 0;
   }
-  return J.canAdd = c, J;
+  return $.canAdd = c, $;
 }
-var Q = {}, on;
-function yo() {
-  if (on) return Q;
-  on = 1, Object.defineProperty(Q, "__esModule", { value: !0 });
+var Z = {}, Zt;
+function Fs() {
+  if (Zt) return Z;
+  Zt = 1, Object.defineProperty(Z, "__esModule", { value: !0 });
   const t = A();
   function e(s) {
     if (s.key[0] !== t.InputTypes.TAP_SCRIPT_SIG)
@@ -1818,7 +1480,7 @@ function yo() {
       signature: s.value
     };
   }
-  Q.decode = e;
+  Z.decode = e;
   function n(s) {
     const o = l.from([t.InputTypes.TAP_SCRIPT_SIG]);
     return {
@@ -1826,25 +1488,63 @@ function yo() {
       value: s.signature
     };
   }
-  Q.encode = n, Q.expected = "{ pubkey: Buffer; leafHash: Buffer; signature: Buffer; }";
+  Z.encode = n, Z.expected = "{ pubkey: Buffer; leafHash: Buffer; signature: Buffer; }";
   function r(s) {
     return l.isBuffer(s.pubkey) && l.isBuffer(s.leafHash) && l.isBuffer(s.signature) && s.pubkey.length === 32 && s.leafHash.length === 32 && (s.signature.length === 64 || s.signature.length === 65);
   }
-  Q.check = r;
+  Z.check = r;
   function c(s, o, i) {
     const a = o.pubkey.toString("hex") + o.leafHash.toString("hex");
     return i.has(a) ? !1 : (i.add(a), s.filter(
       (u) => u.pubkey.equals(o.pubkey) && u.leafHash.equals(o.leafHash)
     ).length === 0);
   }
-  return Q.canAddToArray = c, Q;
+  return Z.canAddToArray = c, Z;
+}
+var J = {}, F = {}, ce = {}, Jt;
+function pe() {
+  if (Jt) return ce;
+  Jt = 1, Object.defineProperty(ce, "__esModule", { value: !0 });
+  const t = 9007199254740991;
+  function e(s) {
+    if (s < 0 || s > t || s % 1 !== 0)
+      throw new RangeError("value out of range");
+  }
+  function n(s, o, i) {
+    if (e(s), o || (o = l.allocUnsafe(c(s))), !l.isBuffer(o))
+      throw new TypeError("buffer must be a Buffer instance");
+    return i || (i = 0), s < 253 ? (o.writeUInt8(s, i), Object.assign(n, { bytes: 1 })) : s <= 65535 ? (o.writeUInt8(253, i), o.writeUInt16LE(s, i + 1), Object.assign(n, { bytes: 3 })) : s <= 4294967295 ? (o.writeUInt8(254, i), o.writeUInt32LE(s, i + 1), Object.assign(n, { bytes: 5 })) : (o.writeUInt8(255, i), o.writeUInt32LE(s >>> 0, i + 1), o.writeUInt32LE(s / 4294967296 | 0, i + 5), Object.assign(n, { bytes: 9 })), o;
+  }
+  ce.encode = n;
+  function r(s, o) {
+    if (!l.isBuffer(s))
+      throw new TypeError("buffer must be a Buffer instance");
+    o || (o = 0);
+    const i = s.readUInt8(o);
+    if (i < 253)
+      return Object.assign(r, { bytes: 1 }), i;
+    if (i === 253)
+      return Object.assign(r, { bytes: 3 }), s.readUInt16LE(o + 1);
+    if (i === 254)
+      return Object.assign(r, { bytes: 5 }), s.readUInt32LE(o + 1);
+    {
+      Object.assign(r, { bytes: 9 });
+      const a = s.readUInt32LE(o + 1), f = s.readUInt32LE(o + 5) * 4294967296 + a;
+      return e(f), f;
+    }
+  }
+  ce.decode = r;
+  function c(s) {
+    return e(s), s < 253 ? 1 : s <= 65535 ? 3 : s <= 4294967295 ? 5 : 9;
+  }
+  return ce.encodingLength = c, ce;
 }
-var ee = {}, L = {}, cn;
-function kt() {
-  if (cn) return L;
-  cn = 1, Object.defineProperty(L, "__esModule", { value: !0 });
-  const t = le();
-  L.range = (i) => [...Array(i).keys()];
+var Qt;
+function _t() {
+  if (Qt) return F;
+  Qt = 1, Object.defineProperty(F, "__esModule", { value: !0 });
+  const t = pe();
+  F.range = (i) => [...Array(i).keys()];
   function e(i) {
     if (i.length < 1) return i;
     let a = i.length - 1, u = 0;
@@ -1852,19 +1552,19 @@ function kt() {
       u = i[f], i[f] = i[a], i[a] = u, a--;
     return i;
   }
-  L.reverseBuffer = e;
+  F.reverseBuffer = e;
   function n(i) {
     const a = i.map(r);
     return a.push(l.from([0])), l.concat(a);
   }
-  L.keyValsToBuffer = n;
+  F.keyValsToBuffer = n;
   function r(i) {
     const a = i.key.length, u = i.value.length, f = t.encodingLength(a), p = t.encodingLength(u), g = l.allocUnsafe(
       f + a + p + u
     );
     return t.encode(a, g, 0), i.key.copy(g, f), t.encode(u, g, f + a), i.value.copy(g, f + a + p), g;
   }
-  L.keyValToBuffer = r;
+  F.keyValToBuffer = r;
   function c(i, a) {
     if (typeof i != "number")
       throw new Error("cannot write a non-number as a number");
@@ -1879,17 +1579,17 @@ function kt() {
     let f = i.readUInt32LE(a + 4);
     return f *= 4294967296, c(f + u, 9007199254740991), f + u;
   }
-  L.readUInt64LE = s;
+  F.readUInt64LE = s;
   function o(i, a, u) {
     return c(a, 9007199254740991), i.writeInt32LE(a & -1, u), i.writeUInt32LE(Math.floor(a / 4294967296), u + 4), u + 8;
   }
-  return L.writeUInt64LE = o, L;
+  return F.writeUInt64LE = o, F;
 }
-var an;
-function So() {
-  if (an) return ee;
-  an = 1, Object.defineProperty(ee, "__esModule", { value: !0 });
-  const t = A(), e = kt(), n = le();
+var en;
+function Ks() {
+  if (en) return J;
+  en = 1, Object.defineProperty(J, "__esModule", { value: !0 });
+  const t = A(), e = _t(), n = pe();
   function r(i) {
     if (i.key[0] !== t.InputTypes.WITNESS_UTXO)
       throw new Error(
@@ -1907,7 +1607,7 @@ function So() {
       value: a
     };
   }
-  ee.decode = r;
+  J.decode = r;
   function c(i) {
     const { script: a, value: u } = i, f = n.encodingLength(a.length), p = l.allocUnsafe(8 + f + a.length);
     return e.writeUInt64LE(p, u, 0), n.encode(a.length, p, 8), a.copy(p, 8 + f), {
@@ -1915,21 +1615,21 @@ function So() {
       value: p
     };
   }
-  ee.encode = c, ee.expected = "{ script: Buffer; value: number; }";
+  J.encode = c, J.expected = "{ script: Buffer; value: number; }";
   function s(i) {
     return l.isBuffer(i.script) && typeof i.value == "number";
   }
-  ee.check = s;
+  J.check = s;
   function o(i, a) {
     return !!i && !!a && i.witnessUtxo === void 0;
   }
-  return ee.canAdd = o, ee;
+  return J.canAdd = o, J;
 }
-var te = {}, un;
-function bo() {
-  if (un) return te;
-  un = 1, Object.defineProperty(te, "__esModule", { value: !0 });
-  const t = A(), e = le();
+var Q = {}, tn;
+function Ls() {
+  if (tn) return Q;
+  tn = 1, Object.defineProperty(Q, "__esModule", { value: !0 });
+  const t = A(), e = pe();
   function n(o) {
     if (o.key[0] !== t.OutputTypes.TAP_TREE || o.key.length !== 1)
       throw new Error(
@@ -1947,7 +1647,7 @@ function bo() {
     }
     return { leaves: a };
   }
-  te.decode = n;
+  Q.decode = n;
   function r(o) {
     const i = l.from([t.OutputTypes.TAP_TREE]), a = [].concat(
       ...o.leaves.map((u) => [
@@ -1961,22 +1661,22 @@ function bo() {
       value: l.concat(a)
     };
   }
-  te.encode = r, te.expected = "{ leaves: [{ depth: number; leafVersion: number, script: Buffer; }] }";
+  Q.encode = r, Q.expected = "{ leaves: [{ depth: number; leafVersion: number, script: Buffer; }] }";
   function c(o) {
     return Array.isArray(o.leaves) && o.leaves.every(
       (i) => i.depth >= 0 && i.depth <= 128 && (i.leafVersion & 254) === i.leafVersion && l.isBuffer(i.script)
     );
   }
-  te.check = c;
+  Q.check = c;
   function s(o, i) {
     return !!o && !!i && o.tapTree === void 0;
   }
-  return te.canAdd = s, te;
+  return Q.canAdd = s, Q;
 }
-var Re = {}, fn;
-function hr() {
-  if (fn) return Re;
-  fn = 1, Object.defineProperty(Re, "__esModule", { value: !0 });
+var Ne = {}, nn;
+function ir() {
+  if (nn) return Ne;
+  nn = 1, Object.defineProperty(Ne, "__esModule", { value: !0 });
   const t = (r) => [...Array(r).keys()], e = (r) => r.length === 33 && [2, 3].includes(r[0]) || r.length === 65 && r[0] === 4;
   function n(r, c = e) {
     function s(f) {
@@ -1999,8 +1699,8 @@ function hr() {
         path: "m"
       };
       for (const y of t(f.value.length / 4 - 1)) {
-        const h = f.value.readUInt32LE(y * 4 + 4), d = !!(h & 2147483648), w = h & 2147483647;
-        g.path += "/" + w.toString(10) + (d ? "'" : "");
+        const h = f.value.readUInt32LE(y * 4 + 4), d = !!(h & 2147483648), E = h & 2147483647;
+        g.path += "/" + E.toString(10) + (d ? "'" : "");
       }
       return g;
     }
@@ -2008,10 +1708,10 @@ function hr() {
       const p = l.from([r]), g = l.concat([p, f.pubkey]), y = f.path.split("/"), h = l.allocUnsafe(y.length * 4);
       f.masterFingerprint.copy(h, 0);
       let d = 4;
-      return y.slice(1).forEach((w) => {
-        const E = w.slice(-1) === "'";
-        let S = 2147483647 & parseInt(E ? w.slice(0, -1) : w, 10);
-        E && (S += 2147483648), h.writeUInt32LE(S, d), d += 4;
+      return y.slice(1).forEach((E) => {
+        const b = E.slice(-1) === "'";
+        let S = 2147483647 & parseInt(b ? E.slice(0, -1) : E, 10);
+        b && (S += 2147483648), h.writeUInt32LE(S, d), d += 4;
       }), {
         key: g,
         value: h
@@ -2033,12 +1733,12 @@ function hr() {
       canAddToArray: u
     };
   }
-  return Re.makeConverter = n, Re;
+  return Ne.makeConverter = n, Ne;
 }
-var Fe = {}, pn;
-function wo() {
-  if (pn) return Fe;
-  pn = 1, Object.defineProperty(Fe, "__esModule", { value: !0 });
+var He = {}, rn;
+function Ms() {
+  if (rn) return He;
+  rn = 1, Object.defineProperty(He, "__esModule", { value: !0 });
   function t(e) {
     return n;
     function n(r) {
@@ -2050,12 +1750,12 @@ function wo() {
       return c;
     }
   }
-  return Fe.makeChecker = t, Fe;
+  return He.makeChecker = t, He;
 }
-var Ke = {}, hn;
-function Eo() {
-  if (hn) return Ke;
-  hn = 1, Object.defineProperty(Ke, "__esModule", { value: !0 });
+var Ue = {}, sn;
+function Ws() {
+  if (sn) return Ue;
+  sn = 1, Object.defineProperty(Ue, "__esModule", { value: !0 });
   function t(e) {
     function n(i) {
       if (i.key[0] !== e)
@@ -2085,13 +1785,13 @@ function Eo() {
       canAdd: o
     };
   }
-  return Ke.makeConverter = t, Ke;
+  return Ue.makeConverter = t, Ue;
 }
-var Le = {}, ln;
-function To() {
-  if (ln) return Le;
-  ln = 1, Object.defineProperty(Le, "__esModule", { value: !0 });
-  const t = le(), e = hr(), n = (c) => c.length === 32;
+var Be = {}, on;
+function Gs() {
+  if (on) return Be;
+  on = 1, Object.defineProperty(Be, "__esModule", { value: !0 });
+  const t = pe(), e = ir(), n = (c) => c.length === 32;
   function r(c) {
     const s = e.makeConverter(c, n);
     function o(f) {
@@ -2099,8 +1799,8 @@ function To() {
         key: f.key,
         value: f.value.slice(g + p * 32)
       }), h = new Array(p);
-      for (let d = 0, w = g; d < p; d++, w += 32)
-        h[d] = f.value.slice(w, w + 32);
+      for (let d = 0, E = g; d < p; d++, E += 32)
+        h[d] = f.value.slice(E, E + 32);
       return Object.assign({}, y, { leafHashes: h });
     }
     function i(f) {
@@ -2123,12 +1823,12 @@ function To() {
       canAddToArray: s.canAddToArray
     };
   }
-  return Le.makeConverter = r, Le;
+  return Be.makeConverter = r, Be;
 }
-var Me = {}, dn;
-function _o() {
-  if (dn) return Me;
-  dn = 1, Object.defineProperty(Me, "__esModule", { value: !0 });
+var Re = {}, cn;
+function Ds() {
+  if (cn) return Re;
+  cn = 1, Object.defineProperty(Re, "__esModule", { value: !0 });
   function t(e) {
     function n(i) {
       if (i.key[0] !== e || i.key.length !== 1)
@@ -2159,12 +1859,12 @@ function _o() {
       canAdd: o
     };
   }
-  return Me.makeConverter = t, Me;
+  return Re.makeConverter = t, Re;
 }
-var We = {}, gn;
-function mo() {
-  if (gn) return We;
-  gn = 1, Object.defineProperty(We, "__esModule", { value: !0 });
+var Fe = {}, an;
+function qs() {
+  if (an) return Fe;
+  an = 1, Object.defineProperty(Fe, "__esModule", { value: !0 });
   function t(e) {
     function n(i) {
       if (i.key[0] !== e)
@@ -2194,20 +1894,20 @@ function mo() {
       canAdd: o
     };
   }
-  return We.makeConverter = t, We;
+  return Fe.makeConverter = t, Fe;
 }
-var yn;
-function At() {
-  if (yn) return ue;
-  yn = 1, Object.defineProperty(ue, "__esModule", { value: !0 });
-  const t = A(), e = so(), n = oo(), r = io(), c = co(), s = ao(), o = uo(), i = fo(), a = po(), u = ho(), f = lo(), p = go(), g = yo(), y = So(), h = bo(), d = hr(), w = wo(), E = Eo(), S = To(), b = _o(), _ = mo(), v = {
+var un;
+function mt() {
+  if (un) return ie;
+  un = 1, Object.defineProperty(ie, "__esModule", { value: !0 });
+  const t = A(), e = ks(), n = As(), r = xs(), c = Cs(), s = Os(), o = Ps(), i = Ns(), a = Hs(), u = Us(), f = Bs(), p = Rs(), g = Fs(), y = Ks(), h = Ls(), d = ir(), E = Ms(), b = Ws(), S = Gs(), w = Ds(), _ = qs(), I = {
     unsignedTx: n,
     globalXpub: e,
     // pass an Array of key bytes that require pubkey beside the key
-    checkPubkey: w.makeChecker([])
+    checkPubkey: E.makeChecker([])
   };
-  ue.globals = v;
-  const C = {
+  ie.globals = I;
+  const O = {
     nonWitnessUtxo: s,
     partialSig: o,
     sighashType: a,
@@ -2218,13 +1918,13 @@ function At() {
     bip32Derivation: d.makeConverter(
       t.InputTypes.BIP32_DERIVATION
     ),
-    redeemScript: E.makeConverter(
+    redeemScript: b.makeConverter(
       t.InputTypes.REDEEM_SCRIPT
     ),
     witnessScript: _.makeConverter(
       t.InputTypes.WITNESS_SCRIPT
     ),
-    checkPubkey: w.makeChecker([
+    checkPubkey: E.makeChecker([
       t.InputTypes.PARTIAL_SIG,
       t.InputTypes.BIP32_DERIVATION
     ]),
@@ -2234,40 +1934,40 @@ function At() {
     tapBip32Derivation: S.makeConverter(
       t.InputTypes.TAP_BIP32_DERIVATION
     ),
-    tapInternalKey: b.makeConverter(
+    tapInternalKey: w.makeConverter(
       t.InputTypes.TAP_INTERNAL_KEY
     ),
     tapMerkleRoot: p
   };
-  ue.inputs = C;
+  ie.inputs = O;
   const m = {
     bip32Derivation: d.makeConverter(
       t.OutputTypes.BIP32_DERIVATION
     ),
-    redeemScript: E.makeConverter(
+    redeemScript: b.makeConverter(
       t.OutputTypes.REDEEM_SCRIPT
     ),
     witnessScript: _.makeConverter(
       t.OutputTypes.WITNESS_SCRIPT
     ),
-    checkPubkey: w.makeChecker([
+    checkPubkey: E.makeChecker([
       t.OutputTypes.BIP32_DERIVATION
     ]),
     tapBip32Derivation: S.makeConverter(
       t.OutputTypes.TAP_BIP32_DERIVATION
     ),
     tapTree: h,
-    tapInternalKey: b.makeConverter(
+    tapInternalKey: w.makeConverter(
       t.OutputTypes.TAP_INTERNAL_KEY
     )
   };
-  return ue.outputs = m, ue;
+  return ie.outputs = m, ie;
 }
-var Sn;
-function vo() {
-  if (Sn) return ae;
-  Sn = 1, Object.defineProperty(ae, "__esModule", { value: !0 });
-  const t = At(), e = kt(), n = le(), r = A();
+var fn;
+function Xs() {
+  if (fn) return oe;
+  fn = 1, Object.defineProperty(oe, "__esModule", { value: !0 });
+  const t = mt(), e = _t(), n = pe(), r = A();
   function c(i, a) {
     let u = 0;
     function f() {
@@ -2303,272 +2003,272 @@ function vo() {
       throw new Error(
         "Format Error: Magic Number must be followed by 0xff separator"
       );
-    const d = [], w = {};
+    const d = [], E = {};
     for (; !h(); ) {
       const m = y(), k = m.key.toString("hex");
-      if (w[k])
+      if (E[k])
         throw new Error(
           "Format Error: Keys must be unique for global keymap: key " + k
         );
-      w[k] = 1, d.push(m);
+      E[k] = 1, d.push(m);
     }
-    const E = d.filter(
+    const b = d.filter(
       (m) => m.key[0] === r.GlobalTypes.UNSIGNED_TX
     );
-    if (E.length !== 1)
+    if (b.length !== 1)
       throw new Error("Format Error: Only one UNSIGNED_TX allowed");
-    const S = a(E[0].value), { inputCount: b, outputCount: _ } = S.getInputOutputCounts(), v = [], C = [];
-    for (const m of e.range(b)) {
-      const k = {}, U = [];
+    const S = a(b[0].value), { inputCount: w, outputCount: _ } = S.getInputOutputCounts(), I = [], O = [];
+    for (const m of e.range(w)) {
+      const k = {}, H = [];
       for (; !h(); ) {
-        const R = y(), re = R.key.toString("hex");
-        if (k[re])
+        const B = y(), te = B.key.toString("hex");
+        if (k[te])
           throw new Error(
-            "Format Error: Keys must be unique for each input: input index " + m + " key " + re
+            "Format Error: Keys must be unique for each input: input index " + m + " key " + te
           );
-        k[re] = 1, U.push(R);
+        k[te] = 1, H.push(B);
       }
-      v.push(U);
+      I.push(H);
     }
     for (const m of e.range(_)) {
-      const k = {}, U = [];
+      const k = {}, H = [];
       for (; !h(); ) {
-        const R = y(), re = R.key.toString("hex");
-        if (k[re])
+        const B = y(), te = B.key.toString("hex");
+        if (k[te])
           throw new Error(
-            "Format Error: Keys must be unique for each output: output index " + m + " key " + re
+            "Format Error: Keys must be unique for each output: output index " + m + " key " + te
           );
-        k[re] = 1, U.push(R);
+        k[te] = 1, H.push(B);
       }
-      C.push(U);
+      O.push(H);
     }
     return o(S, {
       globalMapKeyVals: d,
-      inputKeyVals: v,
-      outputKeyVals: C
+      inputKeyVals: I,
+      outputKeyVals: O
     });
   }
-  ae.psbtFromBuffer = c;
+  oe.psbtFromBuffer = c;
   function s(i, a, u) {
     if (!a.equals(l.from([u])))
       throw new Error(
         `Format Error: Invalid ${i} key: ${a.toString("hex")}`
       );
   }
-  ae.checkKeyBuffer = s;
+  oe.checkKeyBuffer = s;
   function o(i, { globalMapKeyVals: a, inputKeyVals: u, outputKeyVals: f }) {
     const p = {
       unsignedTx: i
     };
     let g = 0;
-    for (const E of a)
-      switch (E.key[0]) {
+    for (const b of a)
+      switch (b.key[0]) {
         case r.GlobalTypes.UNSIGNED_TX:
           if (s(
             "global",
-            E.key,
+            b.key,
             r.GlobalTypes.UNSIGNED_TX
           ), g > 0)
             throw new Error("Format Error: GlobalMap has multiple UNSIGNED_TX");
           g++;
           break;
         case r.GlobalTypes.GLOBAL_XPUB:
-          p.globalXpub === void 0 && (p.globalXpub = []), p.globalXpub.push(t.globals.globalXpub.decode(E));
+          p.globalXpub === void 0 && (p.globalXpub = []), p.globalXpub.push(t.globals.globalXpub.decode(b));
           break;
         default:
-          p.unknownKeyVals || (p.unknownKeyVals = []), p.unknownKeyVals.push(E);
+          p.unknownKeyVals || (p.unknownKeyVals = []), p.unknownKeyVals.push(b);
       }
-    const y = u.length, h = f.length, d = [], w = [];
-    for (const E of e.range(y)) {
+    const y = u.length, h = f.length, d = [], E = [];
+    for (const b of e.range(y)) {
       const S = {};
-      for (const b of u[E])
-        switch (t.inputs.checkPubkey(b), b.key[0]) {
+      for (const w of u[b])
+        switch (t.inputs.checkPubkey(w), w.key[0]) {
           case r.InputTypes.NON_WITNESS_UTXO:
             if (s(
               "input",
-              b.key,
+              w.key,
               r.InputTypes.NON_WITNESS_UTXO
             ), S.nonWitnessUtxo !== void 0)
               throw new Error(
                 "Format Error: Input has multiple NON_WITNESS_UTXO"
               );
-            S.nonWitnessUtxo = t.inputs.nonWitnessUtxo.decode(b);
+            S.nonWitnessUtxo = t.inputs.nonWitnessUtxo.decode(w);
             break;
           case r.InputTypes.WITNESS_UTXO:
             if (s(
               "input",
-              b.key,
+              w.key,
               r.InputTypes.WITNESS_UTXO
             ), S.witnessUtxo !== void 0)
               throw new Error("Format Error: Input has multiple WITNESS_UTXO");
-            S.witnessUtxo = t.inputs.witnessUtxo.decode(b);
+            S.witnessUtxo = t.inputs.witnessUtxo.decode(w);
             break;
           case r.InputTypes.PARTIAL_SIG:
-            S.partialSig === void 0 && (S.partialSig = []), S.partialSig.push(t.inputs.partialSig.decode(b));
+            S.partialSig === void 0 && (S.partialSig = []), S.partialSig.push(t.inputs.partialSig.decode(w));
             break;
           case r.InputTypes.SIGHASH_TYPE:
             if (s(
               "input",
-              b.key,
+              w.key,
               r.InputTypes.SIGHASH_TYPE
             ), S.sighashType !== void 0)
               throw new Error("Format Error: Input has multiple SIGHASH_TYPE");
-            S.sighashType = t.inputs.sighashType.decode(b);
+            S.sighashType = t.inputs.sighashType.decode(w);
             break;
           case r.InputTypes.REDEEM_SCRIPT:
             if (s(
               "input",
-              b.key,
+              w.key,
               r.InputTypes.REDEEM_SCRIPT
             ), S.redeemScript !== void 0)
               throw new Error("Format Error: Input has multiple REDEEM_SCRIPT");
-            S.redeemScript = t.inputs.redeemScript.decode(b);
+            S.redeemScript = t.inputs.redeemScript.decode(w);
             break;
           case r.InputTypes.WITNESS_SCRIPT:
             if (s(
               "input",
-              b.key,
+              w.key,
               r.InputTypes.WITNESS_SCRIPT
             ), S.witnessScript !== void 0)
               throw new Error("Format Error: Input has multiple WITNESS_SCRIPT");
-            S.witnessScript = t.inputs.witnessScript.decode(b);
+            S.witnessScript = t.inputs.witnessScript.decode(w);
             break;
           case r.InputTypes.BIP32_DERIVATION:
             S.bip32Derivation === void 0 && (S.bip32Derivation = []), S.bip32Derivation.push(
-              t.inputs.bip32Derivation.decode(b)
+              t.inputs.bip32Derivation.decode(w)
             );
             break;
           case r.InputTypes.FINAL_SCRIPTSIG:
             s(
               "input",
-              b.key,
+              w.key,
               r.InputTypes.FINAL_SCRIPTSIG
-            ), S.finalScriptSig = t.inputs.finalScriptSig.decode(b);
+            ), S.finalScriptSig = t.inputs.finalScriptSig.decode(w);
             break;
           case r.InputTypes.FINAL_SCRIPTWITNESS:
             s(
               "input",
-              b.key,
+              w.key,
               r.InputTypes.FINAL_SCRIPTWITNESS
             ), S.finalScriptWitness = t.inputs.finalScriptWitness.decode(
-              b
+              w
             );
             break;
           case r.InputTypes.POR_COMMITMENT:
             s(
               "input",
-              b.key,
+              w.key,
               r.InputTypes.POR_COMMITMENT
-            ), S.porCommitment = t.inputs.porCommitment.decode(b);
+            ), S.porCommitment = t.inputs.porCommitment.decode(w);
             break;
           case r.InputTypes.TAP_KEY_SIG:
             s(
               "input",
-              b.key,
+              w.key,
               r.InputTypes.TAP_KEY_SIG
-            ), S.tapKeySig = t.inputs.tapKeySig.decode(b);
+            ), S.tapKeySig = t.inputs.tapKeySig.decode(w);
             break;
           case r.InputTypes.TAP_SCRIPT_SIG:
-            S.tapScriptSig === void 0 && (S.tapScriptSig = []), S.tapScriptSig.push(t.inputs.tapScriptSig.decode(b));
+            S.tapScriptSig === void 0 && (S.tapScriptSig = []), S.tapScriptSig.push(t.inputs.tapScriptSig.decode(w));
             break;
           case r.InputTypes.TAP_LEAF_SCRIPT:
-            S.tapLeafScript === void 0 && (S.tapLeafScript = []), S.tapLeafScript.push(t.inputs.tapLeafScript.decode(b));
+            S.tapLeafScript === void 0 && (S.tapLeafScript = []), S.tapLeafScript.push(t.inputs.tapLeafScript.decode(w));
             break;
           case r.InputTypes.TAP_BIP32_DERIVATION:
             S.tapBip32Derivation === void 0 && (S.tapBip32Derivation = []), S.tapBip32Derivation.push(
-              t.inputs.tapBip32Derivation.decode(b)
+              t.inputs.tapBip32Derivation.decode(w)
             );
             break;
           case r.InputTypes.TAP_INTERNAL_KEY:
             s(
               "input",
-              b.key,
+              w.key,
               r.InputTypes.TAP_INTERNAL_KEY
-            ), S.tapInternalKey = t.inputs.tapInternalKey.decode(b);
+            ), S.tapInternalKey = t.inputs.tapInternalKey.decode(w);
             break;
           case r.InputTypes.TAP_MERKLE_ROOT:
             s(
               "input",
-              b.key,
+              w.key,
               r.InputTypes.TAP_MERKLE_ROOT
-            ), S.tapMerkleRoot = t.inputs.tapMerkleRoot.decode(b);
+            ), S.tapMerkleRoot = t.inputs.tapMerkleRoot.decode(w);
             break;
           default:
-            S.unknownKeyVals || (S.unknownKeyVals = []), S.unknownKeyVals.push(b);
+            S.unknownKeyVals || (S.unknownKeyVals = []), S.unknownKeyVals.push(w);
         }
       d.push(S);
     }
-    for (const E of e.range(h)) {
+    for (const b of e.range(h)) {
       const S = {};
-      for (const b of f[E])
-        switch (t.outputs.checkPubkey(b), b.key[0]) {
+      for (const w of f[b])
+        switch (t.outputs.checkPubkey(w), w.key[0]) {
           case r.OutputTypes.REDEEM_SCRIPT:
             if (s(
               "output",
-              b.key,
+              w.key,
               r.OutputTypes.REDEEM_SCRIPT
             ), S.redeemScript !== void 0)
               throw new Error("Format Error: Output has multiple REDEEM_SCRIPT");
-            S.redeemScript = t.outputs.redeemScript.decode(b);
+            S.redeemScript = t.outputs.redeemScript.decode(w);
             break;
           case r.OutputTypes.WITNESS_SCRIPT:
             if (s(
               "output",
-              b.key,
+              w.key,
               r.OutputTypes.WITNESS_SCRIPT
             ), S.witnessScript !== void 0)
               throw new Error("Format Error: Output has multiple WITNESS_SCRIPT");
-            S.witnessScript = t.outputs.witnessScript.decode(b);
+            S.witnessScript = t.outputs.witnessScript.decode(w);
             break;
           case r.OutputTypes.BIP32_DERIVATION:
             S.bip32Derivation === void 0 && (S.bip32Derivation = []), S.bip32Derivation.push(
-              t.outputs.bip32Derivation.decode(b)
+              t.outputs.bip32Derivation.decode(w)
             );
             break;
           case r.OutputTypes.TAP_INTERNAL_KEY:
             s(
               "output",
-              b.key,
+              w.key,
               r.OutputTypes.TAP_INTERNAL_KEY
-            ), S.tapInternalKey = t.outputs.tapInternalKey.decode(b);
+            ), S.tapInternalKey = t.outputs.tapInternalKey.decode(w);
             break;
           case r.OutputTypes.TAP_TREE:
             s(
               "output",
-              b.key,
+              w.key,
               r.OutputTypes.TAP_TREE
-            ), S.tapTree = t.outputs.tapTree.decode(b);
+            ), S.tapTree = t.outputs.tapTree.decode(w);
             break;
           case r.OutputTypes.TAP_BIP32_DERIVATION:
             S.tapBip32Derivation === void 0 && (S.tapBip32Derivation = []), S.tapBip32Derivation.push(
-              t.outputs.tapBip32Derivation.decode(b)
+              t.outputs.tapBip32Derivation.decode(w)
             );
             break;
           default:
-            S.unknownKeyVals || (S.unknownKeyVals = []), S.unknownKeyVals.push(b);
+            S.unknownKeyVals || (S.unknownKeyVals = []), S.unknownKeyVals.push(w);
         }
-      w.push(S);
+      E.push(S);
     }
-    return { globalMap: p, inputs: d, outputs: w };
+    return { globalMap: p, inputs: d, outputs: E };
   }
-  return ae.psbtFromKeyVals = o, ae;
+  return oe.psbtFromKeyVals = o, oe;
 }
-var de = {}, bn;
-function Io() {
-  if (bn) return de;
-  bn = 1, Object.defineProperty(de, "__esModule", { value: !0 });
-  const t = At(), e = kt();
+var he = {}, pn;
+function Vs() {
+  if (pn) return he;
+  pn = 1, Object.defineProperty(he, "__esModule", { value: !0 });
+  const t = mt(), e = _t();
   function n({ globalMap: o, inputs: i, outputs: a }) {
     const { globalKeyVals: u, inputKeyVals: f, outputKeyVals: p } = s({
       globalMap: o,
       inputs: i,
       outputs: a
-    }), g = e.keyValsToBuffer(u), y = (E) => E.length === 0 ? [l.from([0])] : E.map(e.keyValsToBuffer), h = y(f), d = y(p), w = l.allocUnsafe(5);
-    return w.writeUIntBE(482972169471, 0, 5), l.concat(
-      [w, g].concat(h, d)
+    }), g = e.keyValsToBuffer(u), y = (b) => b.length === 0 ? [l.from([0])] : b.map(e.keyValsToBuffer), h = y(f), d = y(p), E = l.allocUnsafe(5);
+    return E.writeUIntBE(482972169471, 0, 5), l.concat(
+      [E, g].concat(h, d)
     );
   }
-  de.psbtToBuffer = n;
+  he.psbtToBuffer = n;
   const r = (o, i) => o.key.compare(i.key);
   function c(o, i) {
     const a = /* @__PURE__ */ new Set(), u = Object.entries(o).reduce((p, [g, y]) => {
@@ -2578,10 +2278,10 @@ function Io() {
       const d = (Array.isArray(y) ? y : [y]).map(
         h.encode
       );
-      return d.map((E) => E.key.toString("hex")).forEach((E) => {
-        if (a.has(E))
-          throw new Error("Serialize Error: Duplicate key: " + E);
-        a.add(E);
+      return d.map((b) => b.key.toString("hex")).forEach((b) => {
+        if (a.has(b))
+          throw new Error("Serialize Error: Duplicate key: " + b);
+        a.add(b);
       }), p.concat(d);
     }, []), f = o.unknownKeyVals ? o.unknownKeyVals.filter((p) => !a.has(p.key.toString("hex"))) : [];
     return u.concat(f).sort(r);
@@ -2593,22 +2293,22 @@ function Io() {
       outputKeyVals: a.map((u) => c(u, t.outputs))
     };
   }
-  return de.psbtToKeyVals = s, de;
+  return he.psbtToKeyVals = s, he;
 }
-var wn;
-function lr() {
-  return wn || (wn = 1, (function(t) {
+var hn;
+function cr() {
+  return hn || (hn = 1, (function(t) {
     function e(n) {
       for (var r in n) t.hasOwnProperty(r) || (t[r] = n[r]);
     }
-    Object.defineProperty(t, "__esModule", { value: !0 }), e(vo()), e(Io());
-  })(ft)), ft;
-}
-var En;
-function ko() {
-  if (En) return Ue;
-  En = 1, Object.defineProperty(Ue, "__esModule", { value: !0 });
-  const t = lr();
+    Object.defineProperty(t, "__esModule", { value: !0 }), e(Xs()), e(Vs());
+  })(ot)), ot;
+}
+var ln;
+function js() {
+  if (ln) return Oe;
+  ln = 1, Object.defineProperty(Oe, "__esModule", { value: !0 });
+  const t = cr();
   function e(s) {
     const o = s[0], i = t.psbtToKeyVals(o), a = s.slice(1);
     if (a.length === 0) throw new Error("Combine: Nothing to combine");
@@ -2630,7 +2330,7 @@ function ko() {
           d.globalKeyVals
         )
       ), d.inputKeyVals.map(c).forEach(
-        (b, _) => b.forEach(
+        (w, _) => w.forEach(
           n(
             p[_],
             i.inputKeyVals[_],
@@ -2638,7 +2338,7 @@ function ko() {
           )
         )
       ), d.outputKeyVals.map(c).forEach(
-        (b, _) => b.forEach(
+        (w, _) => w.forEach(
           n(
             g[_],
             i.outputKeyVals[_],
@@ -2653,7 +2353,7 @@ function ko() {
       outputKeyVals: i.outputKeyVals
     });
   }
-  Ue.combine = e;
+  Oe.combine = e;
   function n(s, o, i) {
     return (a) => {
       if (s.has(a)) return;
@@ -2673,13 +2373,13 @@ function ko() {
       o.add(a);
     }), o;
   }
-  return Ue;
+  return Oe;
 }
-var ht = {}, Tn;
-function dr() {
-  return Tn || (Tn = 1, (function(t) {
+var ct = {}, dn;
+function ar() {
+  return dn || (dn = 1, (function(t) {
     Object.defineProperty(t, "__esModule", { value: !0 });
-    const e = At();
+    const e = mt();
     function n(y, h) {
       const d = y[h];
       if (d === void 0) throw new Error(`No input #${h}`);
@@ -2697,7 +2397,7 @@ function dr() {
         throw new Error(
           "Use the method for your specific key instead of addUnknownKeyVal*"
         );
-      if (h && h.filter((w) => w.key.equals(y.key)).length !== 0)
+      if (h && h.filter((E) => E.key.equals(y.key)).length !== 0)
         throw new Error(`Duplicate Key: ${y.key.toString("hex")}`);
     }
     t.checkHasKey = c;
@@ -2711,8 +2411,8 @@ function dr() {
     function o(y, h) {
       let d = !1;
       if (h.nonWitnessUtxo || h.witnessUtxo) {
-        const w = !!h.redeemScript, E = !!h.witnessScript, S = !w || !!h.finalScriptSig, b = !E || !!h.finalScriptWitness, _ = !!h.finalScriptSig || !!h.finalScriptWitness;
-        d = S && b && _;
+        const E = !!h.redeemScript, b = !!h.witnessScript, S = !E || !!h.finalScriptSig, w = !b || !!h.finalScriptWitness, _ = !!h.finalScriptSig || !!h.finalScriptWitness;
+        d = S && w && _;
       }
       if (d === !1)
         throw new Error(
@@ -2720,45 +2420,45 @@ function dr() {
         );
     }
     t.inputCheckUncleanFinalized = o;
-    function i(y, h, d, w) {
+    function i(y, h, d, E) {
       throw new Error(
-        `Data for ${y} key ${h} is incorrect: Expected ${d} and got ${JSON.stringify(w)}`
+        `Data for ${y} key ${h} is incorrect: Expected ${d} and got ${JSON.stringify(E)}`
       );
     }
     function a(y) {
       return (h, d) => {
-        for (const w of Object.keys(h)) {
-          const E = h[w], { canAdd: S, canAddToArray: b, check: _, expected: v } = (
+        for (const E of Object.keys(h)) {
+          const b = h[E], { canAdd: S, canAddToArray: w, check: _, expected: I } = (
             // @ts-ignore
-            e[y + "s"][w] || {}
-          ), C = !!b;
+            e[y + "s"][E] || {}
+          ), O = !!w;
           if (_)
-            if (C) {
-              if (!Array.isArray(E) || // @ts-ignore
-              d[w] && !Array.isArray(d[w]))
-                throw new Error(`Key type ${w} must be an array`);
-              E.every(_) || i(y, w, v, E);
-              const m = d[w] || [], k = /* @__PURE__ */ new Set();
-              if (!E.every((U) => b(m, U, k)))
+            if (O) {
+              if (!Array.isArray(b) || // @ts-ignore
+              d[E] && !Array.isArray(d[E]))
+                throw new Error(`Key type ${E} must be an array`);
+              b.every(_) || i(y, E, I, b);
+              const m = d[E] || [], k = /* @__PURE__ */ new Set();
+              if (!b.every((H) => w(m, H, k)))
                 throw new Error("Can not add duplicate data to array");
-              d[w] = m.concat(E);
+              d[E] = m.concat(b);
             } else {
-              if (_(E) || i(y, w, v, E), !S(d, E))
+              if (_(b) || i(y, E, I, b), !S(d, b))
                 throw new Error(`Can not add duplicate data to ${y}`);
-              d[w] = E;
+              d[E] = b;
             }
         }
       };
     }
     t.updateGlobal = a("global"), t.updateInput = a("input"), t.updateOutput = a("output");
     function u(y, h) {
-      const d = y.length - 1, w = n(y, d);
-      t.updateInput(h, w);
+      const d = y.length - 1, E = n(y, d);
+      t.updateInput(h, E);
     }
     t.addInputAttributes = u;
     function f(y, h) {
-      const d = y.length - 1, w = r(y, d);
-      t.updateOutput(h, w);
+      const d = y.length - 1, E = r(y, d);
+      t.updateOutput(h, E);
     }
     t.addOutputAttributes = f;
     function p(y, h) {
@@ -2773,13 +2473,13 @@ function dr() {
       return h.writeUInt32LE(y, h.length - 4), h;
     }
     t.defaultLocktimeSetter = g;
-  })(ht)), ht;
+  })(ct)), ct;
 }
-var _n;
-function Ao() {
-  if (_n) return He;
-  _n = 1, Object.defineProperty(He, "__esModule", { value: !0 });
-  const t = ko(), e = lr(), n = A(), r = dr();
+var gn;
+function zs() {
+  if (gn) return Ce;
+  gn = 1, Object.defineProperty(Ce, "__esModule", { value: !0 });
+  const t = js(), e = cr(), n = A(), r = ar();
   class c {
     constructor(o) {
       this.inputs = [], this.outputs = [], this.globalMap = {
@@ -2884,15 +2584,270 @@ function Ao() {
       return this.globalMap.unsignedTx.toBuffer();
     }
   }
-  return He.Psbt = c, He;
+  return Ce.Psbt = c, Ce;
+}
+var yn = zs(), gt = pe(), x = ar();
+function ee(t) {
+  return (e) => {
+    try {
+      return t({ output: e }), !0;
+    } catch {
+      return !1;
+    }
+  };
+}
+const Ys = ee(je), $s = ee(Pn), Zs = ee(Ee), Je = ee(Ve), Sn = ee(Te), ur = ee(be), It = ee(_e), qo = ee(On), Xo = (t) => t.length === 4 && t[0] === 81 && // OP_1
+t[1] === 2 && // push 2 bytes
+t[2] === 78 && t[3] === 115;
+function Se(t) {
+  let e = l.allocUnsafe(0);
+  function n(o) {
+    e = l.concat([e, l.from(o)]);
+  }
+  function r(o) {
+    const i = e.length, a = gt.encodingLength(o);
+    e = l.concat([e, l.allocUnsafe(a)]), gt.encode(o, e, i);
+  }
+  function c(o) {
+    r(o.length), n(o);
+  }
+  function s(o) {
+    r(o.length), o.forEach(c);
+  }
+  return s(t), e;
+}
+function fr(t, e) {
+  const n = fe(e);
+  if (n === null) throw new Error("Unknown script error");
+  const r = nt(t), c = ye(t), s = ms(t), o = s?.hybrid ? nt(s.hybrid) : void 0, i = s?.uncompressed ? nt(s.uncompressed) : void 0;
+  return n.findIndex((a) => {
+    if (typeof a == "number") return !1;
+    if (xe(a, t) || xe(a, c) || a.equals(r) || s && (xe(a, s.uncompressed) || xe(a, s.hybrid) || o && a.equals(o) || i && a.equals(i)))
+      return !0;
+  });
+}
+function Qe(t, e) {
+  return fr(t, e) !== -1;
+}
+function Js(t, e) {
+  return Qs(t).some((r) => pr(r, ge.decode, e));
+}
+function pr(t, e, n) {
+  const { hashType: r } = e(t), c = [];
+  switch (r & v.SIGHASH_ANYONECANPAY && c.push("addInput"), r & 31) {
+    case v.SIGHASH_ALL:
+      break;
+    case v.SIGHASH_SINGLE:
+    case v.SIGHASH_NONE:
+      c.push("addOutput"), c.push("setInputSequence");
+      break;
+  }
+  return c.indexOf(n) === -1;
+}
+function Qs(t) {
+  const { partialSig: e } = t;
+  let n;
+  if (!e || e.length === 0) {
+    if (!t.finalScriptSig && !t.finalScriptWitness) return [];
+    n = eo(t);
+  } else
+    n = e;
+  return n.map((r) => r.signature);
+}
+function eo(t) {
+  const e = t.finalScriptSig ? fe(t.finalScriptSig) || [] : [], n = t.finalScriptWitness ? fe(t.finalScriptWitness) || [] : [];
+  return e.concat(n).filter((r) => l.isBuffer(r) && Hn(r)).map((r) => ({ signature: r }));
+}
+function wn(t, e, n) {
+  const r = go(e, t, n);
+  try {
+    const s = ho(e, r).concat(r.script).concat(r.controlBlock);
+    return { finalScriptWitness: Se(s) };
+  } catch (c) {
+    throw new Error(`Can not finalize taproot input #${t}: ${c}`);
+  }
+}
+function Ke(t, e) {
+  const n = e ? l.from([e]) : l.from([]);
+  return l.concat([t, n]);
+}
+function N(t) {
+  return t && !!(t.tapInternalKey || t.tapMerkleRoot || t.tapLeafScript && t.tapLeafScript.length || t.tapBip32Derivation && t.tapBip32Derivation.length || t.witnessUtxo && It(t.witnessUtxo.script));
+}
+function at(t, e) {
+  return t && !!(t.tapInternalKey || t.tapTree || t.tapBip32Derivation && t.tapBip32Derivation.length || e && It(e));
+}
+function En(t, e, n) {
+  uo(t, e, n), po(t, e, n);
+}
+function bn(t, e, n) {
+  fo(t, e, n), to(t, e);
+}
+function to(t, e) {
+  if (!e.tapTree && !e.tapInternalKey) return;
+  const n = e.tapInternalKey || t.tapInternalKey, r = e.tapTree || t.tapTree;
+  if (n) {
+    const c = t.script, s = no(n, r);
+    if (c && !c.equals(s))
+      throw new Error("Error adding output. Script or address missmatch.");
+  }
+}
+function no(t, e) {
+  const n = e && ro(e.leaves), { output: r } = _e({
+    internalPubkey: t,
+    scriptTree: n
+  });
+  if (!r) throw new Error("Failed to generate taproot script pubkey");
+  return r;
+}
+function Vo(t, e) {
+  const n = e.tapInternalKey, r = n && vr(n, e.tapMerkleRoot);
+  if (!r)
+    throw new Error(
+      `Cannot tweak tap internal key for input #${t}. Public key: ${n && n.toString("hex")}`
+    );
+  return r.x;
+}
+function jo(t) {
+  if (!Br(t))
+    throw new Error("Cannot convert taptree to tapleaf list. Expecting a tapree structure.");
+  return yt(t);
+}
+function ro(t = []) {
+  return t.length === 1 && t[0].depth === 0 ? {
+    output: t[0].script,
+    version: t[0].leafVersion
+  } : ao(t);
+}
+function so(t, e) {
+  return io(t).some((r) => pr(r, oo, e));
+}
+function oo(t) {
+  return {
+    signature: t.subarray(0, 64),
+    hashType: t.subarray(64)[0] || v.SIGHASH_DEFAULT
+  };
+}
+function io(t) {
+  const e = [];
+  if (t.tapKeySig && e.push(t.tapKeySig), t.tapScriptSig && e.push(...t.tapScriptSig.map((n) => n.signature)), !e.length) {
+    const n = co(t.finalScriptWitness);
+    n && e.push(n);
+  }
+  return e;
+}
+function co(t) {
+  if (!t) return;
+  const e = t.subarray(2);
+  if (e.length === 64 || e.length === 65) return e;
+}
+function yt(t, e = [], n = 0) {
+  if (n > Nn) throw new Error("Max taptree depth exceeded.");
+  return t ? Un(t) ? (e.push({
+    depth: n,
+    leafVersion: t.version || kr,
+    script: t.output
+  }), e) : (t[0] && yt(t[0], e, n + 1), t[1] && yt(t[1], e, n + 1), e) : [];
+}
+function ao(t) {
+  let e;
+  for (const n of t)
+    if (e = St(n, e), !e) throw new Error("No room left to insert tapleaf in tree");
+  return e;
+}
+function St(t, e, n = 0) {
+  if (n > Nn) throw new Error("Max taptree depth exceeded.");
+  if (t.depth === n)
+    return e ? void 0 : {
+      output: t.script,
+      version: t.leafVersion
+    };
+  if (Un(e)) return;
+  const r = St(t, e && e[0], n + 1);
+  if (r) return [r, e && e[1]];
+  const c = St(t, e && e[1], n + 1);
+  if (c) return [e && e[0], c];
 }
-var mn = Ao(), x = dr();
-const vn = bt.decode, xo = {
+function uo(t, e, n) {
+  const r = N(t) && ue(e), c = ue(t) && N(e), s = t === e && N(e) && ue(e);
+  if (r || c || s)
+    throw new Error(
+      `Invalid arguments for Psbt.${n}. Cannot use both taproot and non-taproot fields.`
+    );
+}
+function fo(t, e, n) {
+  const r = at(t) && ue(e), c = ue(t) && at(e), s = t === e && at(e) && ue(e);
+  if (r || c || s)
+    throw new Error(
+      `Invalid arguments for Psbt.${n}. Cannot use both taproot and non-taproot fields.`
+    );
+}
+function po(t, e, n) {
+  if (e.tapMerkleRoot) {
+    const r = (e.tapLeafScript || []).every(
+      (s) => ut(s, e.tapMerkleRoot)
+    ), c = (t.tapLeafScript || []).every(
+      (s) => ut(s, e.tapMerkleRoot)
+    );
+    if (!r || !c)
+      throw new Error(`Invalid arguments for Psbt.${n}. Tapleaf not part of taptree.`);
+  } else if (t.tapMerkleRoot && !(e.tapLeafScript || []).every(
+    (c) => ut(c, t.tapMerkleRoot)
+  ))
+    throw new Error(`Invalid arguments for Psbt.${n}. Tapleaf not part of taptree.`);
+}
+function ut(t, e) {
+  if (!e) return !0;
+  const n = ze({
+    output: t.script,
+    version: t.leafVersion
+  });
+  return Ar(t.controlBlock, n).equals(e);
+}
+function ho(t, e) {
+  const n = ze({
+    output: e.script,
+    version: e.leafVersion
+  });
+  return (t.tapScriptSig || []).filter((r) => r.leafHash.equals(n)).map((r) => lo(e.script, r)).sort((r, c) => c.positionInScript - r.positionInScript).map((r) => r.signature);
+}
+function lo(t, e) {
+  return Object.assign(
+    {
+      positionInScript: fr(e.pubkey, t)
+    },
+    e
+  );
+}
+function go(t, e, n) {
+  const { tapScriptSig: r } = t;
+  if (!r || !r.length)
+    throw new Error(
+      `Can not finalize taproot input #${e}. No tapleaf script signature provided.`
+    );
+  const c = (t.tapLeafScript || []).sort((s, o) => s.controlBlock.length - o.controlBlock.length).find((s) => yo(s, r, n));
+  if (!c)
+    throw new Error(
+      `Can not finalize taproot input #${e}. Signature for tapleaf script not found.`
+    );
+  return c;
+}
+function yo(t, e, n) {
+  const r = ze({
+    output: t.script,
+    version: t.leafVersion
+  });
+  return (!n || n.equals(r)) && e.find((s) => s.leafHash.equals(r)) !== void 0;
+}
+function ue(t) {
+  return t && !!(t.redeemScript || t.witnessScript || t.bip32Derivation && t.bip32Derivation.length);
+}
+const Tn = gt.decode, So = {
   /**
    * 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.
    */
-  network: Je,
+  network: Ye,
   /**
    * When extractTransaction is called, the fee rate is checked.
    * THIS IS NOT TO BE RELIED ON.
@@ -2901,9 +2856,9 @@ const vn = bt.decode, xo = {
   maximumFeeRate: 5e3
   // satoshi per byte
 };
-class Tt {
-  constructor(e = {}, n = new mn.Psbt(new gr())) {
-    this.data = n, this.opts = Object.assign({}, xo, e), this.__CACHE = {
+class wt {
+  constructor(e = {}, n = new yn.Psbt(new hr())) {
+    this.data = n, this.opts = Object.assign({}, So, e), this.__CACHE = {
       __NON_WITNESS_UTXO_TX_CACHE: [],
       __NON_WITNESS_UTXO_BUF_CACHE: [],
       __TX_IN_CACHE: {},
@@ -2936,7 +2891,7 @@ class Tt {
   }
   get txInputs() {
     return this.__CACHE.__TX.ins.map((e) => ({
-      hash: Ot(e.hash),
+      hash: kt(e.hash),
       index: e.index,
       sequence: e.sequence
     }));
@@ -2945,11 +2900,11 @@ class Tt {
     return this.__CACHE.__TX.outs.map((e) => {
       let n;
       try {
-        n = zn(e.script, this.opts.network);
+        n = sr(e.script, this.opts.network);
       } catch {
       }
       return {
-        script: Ot(e.script),
+        script: kt(e.script),
         value: e.value,
         address: n
       };
@@ -2964,34 +2919,34 @@ class Tt {
     return this.fromBuffer(r, n);
   }
   static fromBuffer(e, n = {}) {
-    const r = mn.Psbt.fromBuffer(e, Oo), c = new Tt(n, r);
-    return Uo(c.__CACHE.__TX, c.__CACHE), c;
+    const r = yn.Psbt.fromBuffer(e, wo), c = new wt(n, r);
+    return mo(c.__CACHE.__TX, c.__CACHE), c;
   }
   combine(...e) {
     return this.data.combine(...e.map((n) => n.data)), this;
   }
   clone() {
     const e = JSON.parse(JSON.stringify(this.opts));
-    return Tt.fromBuffer(this.data.toBuffer(), e);
+    return wt.fromBuffer(this.data.toBuffer(), e);
   }
   setMaximumFeeRate(e) {
-    Ge(e), this.opts.maximumFeeRate = e;
+    Le(e), this.opts.maximumFeeRate = e;
   }
   setVersion(e) {
-    Ge(e), ge(this.data.inputs, "setVersion");
+    Le(e), le(this.data.inputs, "setVersion");
     const n = this.__CACHE;
     return n.__TX.version = e, n.__EXTRACTED_TX = void 0, this;
   }
   setVersionTRUC() {
-    return this.setVersion(I.TRUC_VERSION);
+    return this.setVersion(v.TRUC_VERSION);
   }
   setLocktime(e) {
-    Ge(e), ge(this.data.inputs, "setLocktime");
+    Le(e), le(this.data.inputs, "setLocktime");
     const n = this.__CACHE;
     return n.__TX.locktime = e, n.__EXTRACTED_TX = void 0, this;
   }
   setInputSequence(e, n) {
-    Ge(n), ge(this.data.inputs, "setInputSequence");
+    Le(n), le(this.data.inputs, "setInputSequence");
     const r = this.__CACHE;
     if (r.__TX.ins.length <= e)
       throw new Error("Input index too high");
@@ -3005,13 +2960,13 @@ class Tt {
       throw new Error(
         "Invalid arguments for Psbt.addInput. Requires single object with at least [hash] and [index]"
       );
-    Xt(e, e, "addInput"), n && ge(this.data.inputs, "addInput"), e.witnessScript && ze(e.witnessScript);
+    En(e, e, "addInput"), n && le(this.data.inputs, "addInput"), e.witnessScript && Xe(e.witnessScript);
     const r = this.__CACHE;
     this.data.addInput(e);
     const c = r.__TX.ins[r.__TX.ins.length - 1];
-    br(r, c);
+    gr(r, c);
     const s = this.data.inputs.length - 1, o = this.data.inputs[s];
-    return o.nonWitnessUtxo && mt(this.__CACHE, o, s), r.__FEE = void 0, r.__FEE_RATE = void 0, r.__EXTRACTED_TX = void 0, this;
+    return o.nonWitnessUtxo && bt(this.__CACHE, o, s), r.__FEE = void 0, r.__FEE_RATE = void 0, r.__EXTRACTED_TX = void 0, this;
   }
   addOutputs(e) {
     return e.forEach((n) => this.addOutput(n)), this;
@@ -3022,23 +2977,23 @@ class Tt {
       throw new Error(
         "Invalid arguments for Psbt.addOutput. Requires single object with at least [script or address] and [value]"
       );
-    if (ge(this.data.inputs, "addOutput"), n) {
-      const { address: s } = e, { network: o } = this.opts, i = $n(s, o);
+    if (le(this.data.inputs, "addOutput"), n) {
+      const { address: s } = e, { network: o } = this.opts, i = or(s, o);
       e = Object.assign({}, e, { script: i });
     }
-    qt(e, e, "addOutput");
+    bn(e, e, "addOutput");
     const c = this.__CACHE;
     return this.data.addOutput(e), c.__FEE = void 0, c.__FEE_RATE = void 0, c.__EXTRACTED_TX = void 0, this;
   }
   extractTransaction(e, n) {
-    if (n && (this.data.inputs = this.data.inputs.filter((s) => !s.partialSig)), !this.data.inputs.every(yr)) throw new Error("Not finalized");
+    if (n && (this.data.inputs = this.data.inputs.filter((s) => !s.partialSig)), !this.data.inputs.every(lr)) throw new Error("Not finalized");
     const r = this.__CACHE;
-    if (e || Po(this, r, this.opts), r.__EXTRACTED_TX) return r.__EXTRACTED_TX;
+    if (e || bo(this, r, this.opts), r.__EXTRACTED_TX) return r.__EXTRACTED_TX;
     const c = r.__TX.clone();
-    return vr(this.data.inputs, c, r, !0, n), c;
+    return Tr(this.data.inputs, c, r, !0, n), c;
   }
   getFeeRate(e = !1) {
-    return On(
+    return kn(
       "__FEE_RATE",
       "fee rate",
       this.data.inputs,
@@ -3047,14 +3002,14 @@ class Tt {
     );
   }
   getFee(e = !1) {
-    return On("__FEE", "fee", this.data.inputs, this.__CACHE, e);
+    return kn("__FEE", "fee", this.data.inputs, this.__CACHE, e);
   }
   finalizeAllInputs() {
-    return x.checkForInput(this.data.inputs, 0), ye(this.data.inputs.length).forEach((e) => this.finalizeInput(e)), this;
+    return x.checkForInput(this.data.inputs, 0), de(this.data.inputs.length).forEach((e) => this.finalizeInput(e)), this;
   }
   finalizeInput(e, n, r) {
     const c = x.checkForInput(this.data.inputs, e);
-    return H(c) ? this._finalizeTaprootInput(
+    return N(c) ? this._finalizeTaprootInput(
       e,
       c,
       void 0,
@@ -3066,9 +3021,9 @@ class Tt {
       r ?? !0
     );
   }
-  finalizeTaprootInput(e, n, r = Gt) {
+  finalizeTaprootInput(e, n, r = wn) {
     const c = x.checkForInput(this.data.inputs, e);
-    if (H(c))
+    if (N(c))
       return this._finalizeTaprootInput(
         e,
         c,
@@ -3078,45 +3033,45 @@ class Tt {
     throw new Error(`Cannot finalize input #${e}. Not Taproot.`);
   }
   getInputType(e) {
-    const n = x.checkForInput(this.data.inputs, e), r = Ir(e, n, this.__CACHE), c = st(
+    const n = x.checkForInput(this.data.inputs, e), r = _r(e, n, this.__CACHE), c = tt(
       r,
       e,
       "input",
-      n.redeemScript || qo(n.finalScriptSig),
-      n.witnessScript || Do(n.finalScriptWitness)
-    ), s = c.type === "raw" ? "" : c.type + "-", o = Ar(c.meaningfulScript);
+      n.redeemScript || Ho(n.finalScriptSig),
+      n.witnessScript || Uo(n.finalScriptWitness)
+    ), s = c.type === "raw" ? "" : c.type + "-", o = Ir(c.meaningfulScript);
     return s + o;
   }
   inputHasPubkey(e, n) {
     const r = x.checkForInput(this.data.inputs, e);
-    return Go(n, r, e, this.__CACHE);
+    return Po(n, r, e, this.__CACHE);
   }
   inputHasHDKey(e, n) {
-    const r = x.checkForInput(this.data.inputs, e), c = kn(n);
+    const r = x.checkForInput(this.data.inputs, e), c = mn(n);
     return !!r.bip32Derivation && r.bip32Derivation.some(c);
   }
   outputHasPubkey(e, n) {
     const r = x.checkForOutput(this.data.outputs, e);
-    return Xo(n, r, e, this.__CACHE);
+    return No(n, r, e, this.__CACHE);
   }
   outputHasHDKey(e, n) {
-    const r = x.checkForOutput(this.data.outputs, e), c = kn(n);
+    const r = x.checkForOutput(this.data.outputs, e), c = mn(n);
     return !!r.bip32Derivation && r.bip32Derivation.some(c);
   }
   validateSignaturesOfAllInputs(e) {
-    return x.checkForInput(this.data.inputs, 0), ye(this.data.inputs.length).map(
+    return x.checkForInput(this.data.inputs, 0), de(this.data.inputs.length).map(
       (r) => this.validateSignaturesOfInput(r, e)
     ).reduce((r, c) => c && r, !0);
   }
   validateSignaturesOfInput(e, n, r) {
     const c = this.data.inputs[e];
-    return H(c) ? this.validateSignaturesOfTaprootInput(e, n, r) : this._validateSignaturesOfInput(e, n, r);
+    return N(c) ? this.validateSignaturesOfTaprootInput(e, n, r) : this._validateSignaturesOfInput(e, n, r);
   }
-  signAllInputsHD(e, n = [I.SIGHASH_ALL]) {
+  signAllInputsHD(e, n = [v.SIGHASH_ALL]) {
     if (!e || !e.publicKey || !e.fingerprint)
       throw new Error("Need HDSigner to sign input");
     const r = [];
-    for (const c of ye(this.data.inputs.length))
+    for (const c of de(this.data.inputs.length))
       try {
         this.signInputHD(c, e, n), r.push(!0);
       } catch {
@@ -3126,12 +3081,12 @@ class Tt {
       throw new Error("No inputs were signed");
     return this;
   }
-  signAllInputsHDAsync(e, n = [I.SIGHASH_ALL]) {
+  signAllInputsHDAsync(e, n = [v.SIGHASH_ALL]) {
     return new Promise((r, c) => {
       if (!e || !e.publicKey || !e.fingerprint)
         return c(new Error("Need HDSigner to sign input"));
       const s = [], o = [];
-      for (const i of ye(this.data.inputs.length))
+      for (const i of de(this.data.inputs.length))
         o.push(
           this.signInputHDAsync(i, e, n).then(
             () => {
@@ -3149,16 +3104,16 @@ class Tt {
       });
     });
   }
-  signInputHD(e, n, r = [I.SIGHASH_ALL]) {
+  signInputHD(e, n, r = [v.SIGHASH_ALL]) {
     if (!n || !n.publicKey || !n.fingerprint)
       throw new Error("Need HDSigner to sign input");
-    return Nn(e, this.data.inputs, n).forEach((s) => this.signInput(e, s, r)), this;
+    return Cn(e, this.data.inputs, n).forEach((s) => this.signInput(e, s, r)), this;
   }
-  signInputHDAsync(e, n, r = [I.SIGHASH_ALL]) {
+  signInputHDAsync(e, n, r = [v.SIGHASH_ALL]) {
     return new Promise((c, s) => {
       if (!n || !n.publicKey || !n.fingerprint)
         return s(new Error("Need HDSigner to sign input"));
-      const i = Nn(e, this.data.inputs, n).map(
+      const i = Cn(e, this.data.inputs, n).map(
         (a) => this.signInputAsync(e, a, r)
       );
       return Promise.all(i).then(() => {
@@ -3169,7 +3124,7 @@ class Tt {
   signAllInputs(e, n) {
     if (!e || !e.publicKey) throw new Error("Need Signer to sign input");
     const r = [];
-    for (const c of ye(this.data.inputs.length))
+    for (const c of de(this.data.inputs.length))
       try {
         this.signInput(c, e, n), r.push(!0);
       } catch {
@@ -3206,13 +3161,13 @@ class Tt {
     if (!n || !n.publicKey)
       throw new Error("Need Signer to sign input");
     const c = x.checkForInput(this.data.inputs, e);
-    return H(c) ? this._signTaprootInput(e, c, n, void 0, r) : this._signInput(e, n, r);
+    return N(c) ? this._signTaprootInput(e, c, n, void 0, r) : this._signInput(e, n, r);
   }
   signTaprootInput(e, n, r, c) {
     if (!n || !n.publicKey)
       throw new Error("Need Signer to sign input");
     const s = x.checkForInput(this.data.inputs, e);
-    if (H(s))
+    if (N(s))
       return this._signTaprootInput(
         e,
         s,
@@ -3226,7 +3181,7 @@ class Tt {
     return Promise.resolve().then(() => {
       if (!n || !n.publicKey) throw new Error("Need Signer to sign input");
       const c = x.checkForInput(this.data.inputs, e);
-      return H(c) ? this._signTaprootInputAsync(
+      return N(c) ? this._signTaprootInputAsync(
         e,
         c,
         n,
@@ -3239,7 +3194,7 @@ class Tt {
     return Promise.resolve().then(() => {
       if (!n || !n.publicKey) throw new Error("Need Signer to sign input");
       const s = x.checkForInput(this.data.inputs, e);
-      if (H(s))
+      if (N(s))
         return this._signTaprootInputAsync(
           e,
           s,
@@ -3251,23 +3206,23 @@ class Tt {
     });
   }
   toBuffer() {
-    return lt(this.__CACHE), this.data.toBuffer();
+    return ft(this.__CACHE), this.data.toBuffer();
   }
   toHex() {
-    return lt(this.__CACHE), this.data.toHex();
+    return ft(this.__CACHE), this.data.toHex();
   }
   toBase64() {
-    return lt(this.__CACHE), this.data.toBase64();
+    return ft(this.__CACHE), this.data.toBase64();
   }
   updateGlobal(e) {
     return this.data.updateGlobal(e), this;
   }
   updateInput(e, n) {
-    return n.witnessScript && ze(n.witnessScript), Xt(this.data.inputs[e], n, "updateInput"), this.data.updateInput(e, n), n.nonWitnessUtxo && mt(this.__CACHE, this.data.inputs[e], e), this;
+    return n.witnessScript && Xe(n.witnessScript), En(this.data.inputs[e], n, "updateInput"), this.data.updateInput(e, n), n.nonWitnessUtxo && bt(this.__CACHE, this.data.inputs[e], e), this;
   }
   updateOutput(e, n) {
     const r = this.data.outputs[e];
-    return qt(r, n, "updateOutput"), this.data.updateOutput(e, n), this;
+    return bn(r, n, "updateOutput"), this.data.updateOutput(e, n), this;
   }
   addUnknownKeyValToGlobal(e) {
     return this.data.addUnknownKeyValToGlobal(e), this;
@@ -3284,7 +3239,7 @@ class Tt {
   checkTaprootHashesForSig(e, n, r, c, s) {
     if (typeof r.signSchnorr != "function")
       throw new Error(`Need Schnorr Signer to sign taproot input #${e}.`);
-    const o = l.isBuffer(r.publicKey) ? r.publicKey : l.from(r.publicKey), i = _t(
+    const o = l.isBuffer(r.publicKey) ? r.publicKey : l.from(r.publicKey), i = Et(
       e,
       n,
       this.data.inputs,
@@ -3299,14 +3254,14 @@ class Tt {
       );
     return i;
   }
-  _finalizeInput(e, n, r = Bo, c = !0) {
-    const { script: s, isP2SH: o, isP2WSH: i, isSegwit: a } = Lo(
+  _finalizeInput(e, n, r = Io, c = !0) {
+    const { script: s, isP2SH: o, isP2WSH: i, isSegwit: a } = xo(
       e,
       n,
       this.__CACHE
     );
     if (!s) throw new Error(`No script found for input #${e}`);
-    No(n);
+    To(n);
     const { finalScriptSig: u, finalScriptWitness: f } = r(
       e,
       n,
@@ -3320,16 +3275,16 @@ class Tt {
       throw new Error(`Unknown error finalizing input #${e}`);
     return this.data.clearFinalizedInput(e), this;
   }
-  _finalizeTaprootInput(e, n, r, c = Gt) {
+  _finalizeTaprootInput(e, n, r, c = wn) {
     if (!n.witnessUtxo)
       throw new Error(`Cannot finalize input #${e}. Missing witness utxo.`);
     if (n.tapKeySig) {
-      const s = Ie({
+      const s = _e({
         output: n.witnessUtxo.script,
         signature: n.tapKeySig
       });
       if (!s.witness) throw new Error("Cannot finalize taproot key spend");
-      const o = Ee(s.witness);
+      const o = Se(s.witness);
       this.data.updateInput(e, { finalScriptWitness: o });
     } else {
       const { finalScriptWitness: s } = c(
@@ -3352,7 +3307,7 @@ class Tt {
     const i = [];
     let a, u, f;
     for (const p of o) {
-      const g = Se.decode(p.signature), { hash: y, script: h } = f !== g.hashType || !a || !u ? Er(
+      const g = ge.decode(p.signature), { hash: y, script: h } = f !== g.hashType || !a || !u ? Sr(
         e,
         Object.assign({}, c, {
           sighashType: g.hashType
@@ -3360,7 +3315,7 @@ class Tt {
         this.__CACHE,
         !0
       ) : { hash: a, script: u };
-      f = g.hashType, a = y, u = h, Sr(p.pubkey, h, "verify"), i.push(n(p.pubkey, y, g.signature));
+      f = g.hashType, a = y, u = h, dr(p.pubkey, h, "verify"), i.push(n(p.pubkey, y, g.signature));
     }
     return i.every((p) => p);
   }
@@ -3370,8 +3325,8 @@ class Tt {
       throw new Error("No signatures to validate");
     if (typeof n != "function")
       throw new Error("Need validator function to validate signatures");
-    r = r && we(r);
-    const i = r ? _t(e, c, this.data.inputs, r, this.__CACHE) : Fo(e, c, this.data.inputs, this.__CACHE);
+    r = r && ye(r);
+    const i = r ? Et(e, c, this.data.inputs, r, this.__CACHE) : ko(e, c, this.data.inputs, this.__CACHE);
     if (!i.length) throw new Error("No signatures for this pubkey");
     const a = i.find((f) => !f.leafHash);
     let u = 0;
@@ -3379,7 +3334,7 @@ class Tt {
       if (!n(
         a.pubkey,
         a.hash,
-        Pn(s)
+        xn(s)
       )) return !1;
       u++;
     }
@@ -3390,15 +3345,15 @@ class Tt {
           if (!n(
             f.pubkey,
             p.hash,
-            Pn(f.signature)
+            xn(f.signature)
           )) return !1;
           u++;
         }
       }
     return u > 0;
   }
-  _signInput(e, n, r = [I.SIGHASH_ALL]) {
-    const c = l.isBuffer(n.publicKey) ? n.publicKey : l.from(n.publicKey), { hash: s, sighashType: o } = Cn(
+  _signInput(e, n, r = [v.SIGHASH_ALL]) {
+    const c = l.isBuffer(n.publicKey) ? n.publicKey : l.from(n.publicKey), { hash: s, sighashType: o } = An(
       this.data.inputs,
       e,
       c,
@@ -3407,7 +3362,7 @@ class Tt {
     ), i = n.sign(s), a = [
       {
         pubkey: c,
-        signature: Se.encode(
+        signature: ge.encode(
           l.isBuffer(i) ? i : l.from(i),
           o
         )
@@ -3415,7 +3370,7 @@ class Tt {
     ];
     return this.data.updateInput(e, { partialSig: a }), this;
   }
-  _signTaprootInput(e, n, r, c, s = [I.SIGHASH_DEFAULT]) {
+  _signTaprootInput(e, n, r, c, s = [v.SIGHASH_DEFAULT]) {
     const o = l.isBuffer(r.publicKey) ? r.publicKey : l.from(r.publicKey), i = this.checkTaprootHashesForSig(
       e,
       n,
@@ -3423,11 +3378,11 @@ class Tt {
       c,
       s
     ), a = r.signSchnorr.bind(r), u = (g) => l.isBuffer(g) ? g : l.from(g), f = i.filter((g) => !g.leafHash).map(
-      (g) => Pe(u(a(g.hash)), n.sighashType)
+      (g) => Ke(u(a(g.hash)), n.sighashType)
     )[0], p = i.filter((g) => !!g.leafHash).map(
       (g) => ({
-        pubkey: we(o),
-        signature: Pe(
+        pubkey: ye(o),
+        signature: Ke(
           u(a(g.hash)),
           n.sighashType
         ),
@@ -3436,8 +3391,8 @@ class Tt {
     );
     return f && this.data.updateInput(e, { tapKeySig: f }), p.length && this.data.updateInput(e, { tapScriptSig: p }), this;
   }
-  _signInputAsync(e, n, r = [I.SIGHASH_ALL]) {
-    const c = l.isBuffer(n.publicKey) ? n.publicKey : l.from(n.publicKey), { hash: s, sighashType: o } = Cn(
+  _signInputAsync(e, n, r = [v.SIGHASH_ALL]) {
+    const c = l.isBuffer(n.publicKey) ? n.publicKey : l.from(n.publicKey), { hash: s, sighashType: o } = An(
       this.data.inputs,
       e,
       c,
@@ -3448,13 +3403,13 @@ class Tt {
       const a = l.isBuffer(i) ? i : l.from(i), u = [
         {
           pubkey: c,
-          signature: Se.encode(a, o)
+          signature: ge.encode(a, o)
         }
       ];
       this.data.updateInput(e, { partialSig: u });
     });
   }
-  async _signTaprootInputAsync(e, n, r, c, s = [I.SIGHASH_DEFAULT]) {
+  async _signTaprootInputAsync(e, n, r, c, s = [v.SIGHASH_DEFAULT]) {
     const o = l.isBuffer(r.publicKey) ? r.publicKey : l.from(r.publicKey), i = this.checkTaprootHashesForSig(
       e,
       n,
@@ -3464,19 +3419,19 @@ class Tt {
     ), a = r.signSchnorr.bind(r), u = (h) => l.isBuffer(h) ? h : l.from(h), f = [], p = i.filter((h) => !h.leafHash)[0];
     if (p) {
       const h = Promise.resolve(a(p.hash)).then((d) => ({
-        tapKeySig: Pe(u(d), n.sighashType)
+        tapKeySig: Ke(u(d), n.sighashType)
       }));
       f.push(h);
     }
     const g = i.filter((h) => !!h.leafHash);
     if (g.length) {
       const h = g.map(async (d) => {
-        const w = await a(d.hash);
+        const E = await a(d.hash);
         return { tapScriptSig: [
           {
-            pubkey: we(o),
-            signature: Pe(
-              u(w),
+            pubkey: ye(o),
+            signature: Ke(
+              u(E),
               n.sighashType
             ),
             leafHash: d.leafHash
@@ -3490,10 +3445,10 @@ class Tt {
       this.data.updateInput(e, h);
   }
 }
-const Oo = (t) => new gr(t);
-class gr {
+const wo = (t) => new hr(t);
+class hr {
   constructor(e = l.from([2, 0, 0, 0, 0, 0, 0, 0, 0, 0])) {
-    this.tx = I.fromBuffer(e), Ho(this.tx), Object.defineProperty(this, "tx", {
+    this.tx = v.fromBuffer(e), _o(this.tx), Object.defineProperty(this, "tx", {
       enumerable: !1,
       writable: !0
     });
@@ -3519,17 +3474,17 @@ class gr {
     return this.tx.toBuffer();
   }
 }
-function Co(t, e, n) {
+function Eo(t, e, n) {
   switch (n) {
     case "pubkey":
     case "pubkeyhash":
     case "witnesspubkeyhash":
-      return In(1, t.partialSig);
+      return _n(1, t.partialSig);
     case "multisig": {
-      const r = Ze({
+      const r = je({
         output: e
       });
-      return In(r.m, t.partialSig, r.pubkeys);
+      return _n(r.m, t.partialSig, r.pubkeys);
     }
     case "nonstandard":
       return !0;
@@ -3537,23 +3492,23 @@ function Co(t, e, n) {
       return !1;
   }
 }
-function lt(t) {
+function ft(t) {
   if (t.__UNSAFE_SIGN_NONSEGWIT)
     throw new Error("Not BIP174 compliant, can not export");
 }
-function In(t, e, n) {
+function _n(t, e, n) {
   if (!e) return !1;
   let r;
   if (n ? r = n.map((c) => {
-    const s = Vo(c);
+    const s = Bo(c);
     return e.find((o) => o.pubkey.equals(s));
   }).filter((c) => !!c) : r = e, r.length > t) throw new Error("Too many signatures");
   return r.length === t;
 }
-function yr(t) {
+function lr(t) {
   return !!t.finalScriptSig || !!t.finalScriptWitness;
 }
-function kn(t) {
+function mn(t) {
   return (e) => {
     const n = l.isBuffer(t.fingerprint) ? t.fingerprint : l.from(t.fingerprint);
     if (!e.masterFingerprint.equals(n)) return !1;
@@ -3561,52 +3516,52 @@ function kn(t) {
     return !!(l.isBuffer(r) ? r : l.from(r)).equals(e.pubkey);
   };
 }
-function Ge(t) {
+function Le(t) {
   if (typeof t != "number" || t !== Math.floor(t) || t > 4294967295 || t < 0)
     throw new Error("Invalid 32 bit integer");
 }
-function Po(t, e, n) {
+function bo(t, e, n) {
   const r = e.__FEE_RATE || t.getFeeRate(), c = e.__EXTRACTED_TX.virtualSize(), s = r * c;
   if (r >= n.maximumFeeRate)
     throw new Error(
       `Warning: You are paying around ${(s / 1e8).toFixed(8)} in fees, which is ${r} satoshi per byte for a transaction with a VSize of ${c} bytes (segwit counted as 0.25 byte per byte). Use setMaximumFeeRate method to raise your threshold, or pass true to the first arg of extractTransaction.`
     );
 }
-function ge(t, e) {
+function le(t, e) {
   t.forEach((n) => {
-    if (H(n) ? Ls(n, e) : to(n, e)) throw new Error("Can not modify transaction, signatures exist.");
+    if (N(n) ? so(n, e) : Js(n, e)) throw new Error("Can not modify transaction, signatures exist.");
   });
 }
-function No(t) {
+function To(t) {
   if (!t.sighashType || !t.partialSig) return;
   const { partialSig: e, sighashType: n } = t;
   e.forEach((r) => {
-    const { hashType: c } = Se.decode(r.signature);
+    const { hashType: c } = ge.decode(r.signature);
     if (n !== c)
       throw new Error("Signature sighash does not match input sighash type");
   });
 }
-function Sr(t, e, n) {
-  if (!nt(t, e))
+function dr(t, e, n) {
+  if (!Qe(t, e))
     throw new Error(`Can not ${n} for this input with the key ${t.toString("hex")}`);
 }
-function Ho(t) {
+function _o(t) {
   if (!t.ins.every(
     (n) => n.script && n.script.length === 0 && n.witness && n.witness.length === 0
   ))
     throw new Error("Format Error: Transaction ScriptSigs are not empty");
 }
-function Uo(t, e) {
+function mo(t, e) {
   t.ins.forEach((n) => {
-    br(e, n);
+    gr(e, n);
   });
 }
-function br(t, e) {
+function gr(t, e) {
   const n = `${Bn(l.from(e.hash)).toString("hex")}:${e.index}`;
   if (t.__TX_IN_CACHE[n]) throw new Error("Duplicate input detected.");
   t.__TX_IN_CACHE[n] = 1;
 }
-function wr(t, e) {
+function yr(t, e) {
   return (n, r, c, s) => {
     const o = t({
       redeem: { output: c }
@@ -3617,22 +3572,22 @@ function wr(t, e) {
       );
   };
 }
-const An = wr(me, "Redeem script"), xn = wr(ve, "Witness script");
-function On(t, e, n, r, c = !1) {
-  if (!n.every(yr)) throw new Error(`PSBT must be finalized to calculate ${e}`);
+const In = yr(be, "Redeem script"), vn = yr(Te, "Witness script");
+function kn(t, e, n, r, c = !1) {
+  if (!n.every(lr)) throw new Error(`PSBT must be finalized to calculate ${e}`);
   if (t === "__FEE_RATE" && r.__FEE_RATE) return r.__FEE_RATE;
   if (t === "__FEE" && r.__FEE) return r.__FEE;
   let s, o = !0;
-  r.__EXTRACTED_TX ? (s = r.__EXTRACTED_TX, o = !1) : s = r.__TX.clone(), vr(n, s, r, o, c);
+  r.__EXTRACTED_TX ? (s = r.__EXTRACTED_TX, o = !1) : s = r.__TX.clone(), Tr(n, s, r, o, c);
   const i = t === "__FEE_RATE" ? r.__FEE_RATE : r.__FEE;
   if (i === void 0) throw new Error(`Failed to calculate ${e}`);
   return i;
 }
-function Bo(t, e, n, r, c, s, o = !0, i) {
-  const a = Ar(n);
-  if (!Co(e, n, a) && o)
+function Io(t, e, n, r, c, s, o = !0, i) {
+  const a = Ir(n);
+  if (!Eo(e, n, a) && o)
     throw new Error(`Can not finalize input #${t}`);
-  return Ro(
+  return vo(
     n,
     a,
     e.partialSig,
@@ -3642,33 +3597,33 @@ function Bo(t, e, n, r, c, s, o = !0, i) {
     i
   );
 }
-function Ro(t, e, n, r, c, s, o) {
+function vo(t, e, n, r, c, s, o) {
   let i, a;
-  const u = Ko(t, e, n), f = s ? ve({ redeem: u }) : null, p = c ? me({ redeem: f || u }) : null;
-  return r ? (f ? a = Ee(f.witness) : u ? a = Ee(u.witness) : a = Ee(o ?? [l.from([0])]), p && (i = p?.input)) : p ? i = p?.input : u ? i = u.input : i = Array.isArray(o) && o[0] ? o[0] : l.from([1]), {
+  const u = Ao(t, e, n), f = s ? Te({ redeem: u }) : null, p = c ? be({ redeem: f || u }) : null;
+  return r ? (f ? a = Se(f.witness) : u ? a = Se(u.witness) : a = Se(o ?? [l.from([0])]), p && (i = p?.input)) : p ? i = p?.input : u ? i = u.input : i = Array.isArray(o) && o[0] ? o[0] : l.from([1]), {
     finalScriptSig: i,
     finalScriptWitness: a
   };
 }
-function Cn(t, e, n, r, c) {
-  const s = x.checkForInput(t, e), { hash: o, sighashType: i, script: a } = Er(
+function An(t, e, n, r, c) {
+  const s = x.checkForInput(t, e), { hash: o, sighashType: i, script: a } = Sr(
     e,
     s,
     r,
     !1,
     c
   );
-  return Sr(n, a, "sign"), {
+  return dr(n, a, "sign"), {
     hash: o,
     sighashType: i
   };
 }
-function Er(t, e, n, r, c) {
-  const s = n.__TX, o = e.sighashType || I.SIGHASH_ALL;
-  _r(o, c);
+function Sr(t, e, n, r, c) {
+  const s = n.__TX, o = e.sighashType || v.SIGHASH_ALL;
+  Er(o, c);
   let i, a;
   if (e.nonWitnessUtxo) {
-    const p = rt(n, e, t), g = s.ins[t].hash, y = p.getHash();
+    const p = et(n, e, t), g = s.ins[t].hash, y = p.getHash();
     if (!g.equals(y))
       throw new Error(
         `Non-witness UTXO hash for input #${t} doesn't match the hash specified in the prevout`
@@ -3679,7 +3634,7 @@ function Er(t, e, n, r, c) {
     a = e.witnessUtxo;
   else
     throw new Error("Need a Utxo input item for signing");
-  const { meaningfulScript: u, type: f } = st(
+  const { meaningfulScript: u, type: f } = tt(
     a.script,
     t,
     "input",
@@ -3693,8 +3648,8 @@ function Er(t, e, n, r, c) {
       a.value,
       o
     );
-  else if (tt(u)) {
-    const p = _e({
+  else if (Je(u)) {
+    const p = Ee({
       hash: u.subarray(2)
     }).output;
     i = s.hashForWitnessV0(t, p, a.value, o);
@@ -3716,10 +3671,10 @@ PROCEED WITH CAUTION!
     hash: i
   };
 }
-function Fo(t, e, n, r) {
+function ko(t, e, n, r) {
   const c = [];
   if (e.tapInternalKey) {
-    const o = Tr(t, e, r);
+    const o = wr(t, e, r);
     o && c.push(o);
   }
   if (e.tapScriptSig) {
@@ -3727,25 +3682,25 @@ function Fo(t, e, n, r) {
     c.push(...o);
   }
   return c.map(
-    (o) => _t(t, e, n, o, r)
+    (o) => Et(t, e, n, o, r)
   ).flat();
 }
-function Tr(t, e, n) {
-  const { script: r } = xt(t, e, n);
+function wr(t, e, n) {
+  const { script: r } = vt(t, e, n);
   return It(r) ? l.from(r.subarray(2, 34)) : null;
 }
-function Pn(t) {
+function xn(t) {
   return t.length === 64 ? t : l.from(t.subarray(0, 64));
 }
-function _t(t, e, n, r, c, s, o) {
-  const i = c.__TX, a = e.sighashType || I.SIGHASH_DEFAULT;
-  _r(a, o);
+function Et(t, e, n, r, c, s, o) {
+  const i = c.__TX, a = e.sighashType || v.SIGHASH_DEFAULT;
+  Er(a, o);
   const u = n.map(
-    (h, d) => xt(d, h, c)
+    (h, d) => vt(d, h, c)
   ), f = u.map((h) => h.script), p = u.map((h) => h.value), g = [];
   if (e.tapInternalKey && !s) {
-    const h = Tr(t, e, c) || l.from([]);
-    if (we(r).equals(h)) {
+    const h = wr(t, e, c) || l.from([]);
+    if (ye(r).equals(h)) {
       const d = i.hashForWitnessV1(
         t,
         f,
@@ -3755,8 +3710,8 @@ function _t(t, e, n, r, c, s, o) {
       g.push({ pubkey: r, hash: d });
     }
   }
-  const y = (e.tapLeafScript || []).filter((h) => nt(r, h.script)).map((h) => {
-    const d = Ye({
+  const y = (e.tapLeafScript || []).filter((h) => Qe(r, h.script)).map((h) => {
+    const d = ze({
       output: h.script,
       version: h.leafVersion
     });
@@ -3777,40 +3732,40 @@ function _t(t, e, n, r, c, s, o) {
   });
   return g.concat(y);
 }
-function _r(t, e) {
+function Er(t, e) {
   if (e && e.indexOf(t) < 0) {
-    const n = Wo(t);
+    const n = Oo(t);
     throw new Error(
       `Sighash type is not allowed. Retry the sign method passing the sighashTypes array of whitelisted types. Sighash type: ${n}`
     );
   }
 }
-function Ko(t, e, n) {
+function Ao(t, e, n) {
   let r;
   switch (e) {
     case "multisig": {
-      const c = Mo(t, n);
-      r = Ze({
+      const c = Co(t, n);
+      r = je({
         output: t,
         signatures: c
       });
       break;
     }
     case "pubkey":
-      r = Kn({
+      r = Pn({
         output: t,
         signature: n[0].signature
       });
       break;
     case "pubkeyhash":
-      r = _e({
+      r = Ee({
         output: t,
         pubkey: n[0].pubkey,
         signature: n[0].signature
       });
       break;
     case "witnesspubkeyhash":
-      r = $e({
+      r = Ve({
         output: t,
         pubkey: n[0].pubkey,
         signature: n[0].signature
@@ -3819,7 +3774,7 @@ function Ko(t, e, n) {
   }
   return r;
 }
-function Lo(t, e, n) {
+function xo(t, e, n) {
   const r = n.__TX, c = {
     script: null,
     isSegwit: !1,
@@ -3831,21 +3786,21 @@ function Lo(t, e, n) {
   else if (e.redeemScript)
     c.script = e.redeemScript;
   else if (e.nonWitnessUtxo) {
-    const s = rt(n, e, t), o = r.ins[t].index;
+    const s = et(n, e, t), o = r.ins[t].index;
     c.script = s.outs[o].script;
   } else e.witnessUtxo && (c.script = e.witnessUtxo.script);
-  if (e.witnessScript || tt(c.script))
+  if (e.witnessScript || Je(c.script))
     c.isSegwit = !0;
   else
     try {
       const s = c.script;
       if (!s) throw new TypeError("Invalid script for segwit address");
-      c.isSegwit = Gn(s);
+      c.isSegwit = Qn(s);
     } catch {
     }
   return c;
 }
-function Nn(t, e, n) {
+function Cn(t, e, n) {
   const r = x.checkForInput(e, t);
   if (!r.bip32Derivation || r.bip32Derivation.length === 0)
     throw new Error("Need bip32Derivation to sign with HD");
@@ -3864,17 +3819,17 @@ function Nn(t, e, n) {
     return o;
   });
 }
-function Mo(t, e) {
-  return Ze({ output: t }).pubkeys.map((r) => (e.filter((c) => c.pubkey.equals(r))[0] || {}).signature).filter((r) => !!r);
+function Co(t, e) {
+  return je({ output: t }).pubkeys.map((r) => (e.filter((c) => c.pubkey.equals(r))[0] || {}).signature).filter((r) => !!r);
 }
-function mr(t) {
+function br(t) {
   let e = 0;
   function n(o) {
     return e += o, t.subarray(e - o, e);
   }
   function r() {
-    const o = vn(t, e);
-    return e += vn.bytes, o;
+    const o = Tn(t, e);
+    return e += Tn.bytes, o;
   }
   function c() {
     return n(r());
@@ -3886,23 +3841,23 @@ function mr(t) {
   }
   return s();
 }
-function Wo(t) {
-  let e = t & I.SIGHASH_ANYONECANPAY ? "SIGHASH_ANYONECANPAY | " : "";
+function Oo(t) {
+  let e = t & v.SIGHASH_ANYONECANPAY ? "SIGHASH_ANYONECANPAY | " : "";
   switch (t & 31) {
-    case I.SIGHASH_ALL:
+    case v.SIGHASH_ALL:
       e += "SIGHASH_ALL";
       break;
-    case I.SIGHASH_SINGLE:
+    case v.SIGHASH_SINGLE:
       e += "SIGHASH_SINGLE";
       break;
-    case I.SIGHASH_NONE:
+    case v.SIGHASH_NONE:
       e += "SIGHASH_NONE";
       break;
   }
   return e;
 }
-function mt(t, e, n) {
-  t.__NON_WITNESS_UTXO_BUF_CACHE[n] = e.nonWitnessUtxo, t.__NON_WITNESS_UTXO_TX_CACHE[n] = I.fromBuffer(e.nonWitnessUtxo);
+function bt(t, e, n) {
+  t.__NON_WITNESS_UTXO_BUF_CACHE[n] = e.nonWitnessUtxo, t.__NON_WITNESS_UTXO_TX_CACHE[n] = v.fromBuffer(e.nonWitnessUtxo);
   const r = t, c = n;
   delete e.nonWitnessUtxo, Object.defineProperty(e, "nonWitnessUtxo", {
     enumerable: !0,
@@ -3920,13 +3875,13 @@ function mt(t, e, n) {
     }
   });
 }
-function vr(t, e, n, r, c) {
+function Tr(t, e, n, r, c) {
   let s = 0;
   t.forEach((u, f) => {
-    if (r && u.finalScriptSig && (e.ins[f].script = u.finalScriptSig), r && u.finalScriptWitness && (e.ins[f].witness = mr(u.finalScriptWitness)), u.witnessUtxo)
+    if (r && u.finalScriptSig && (e.ins[f].script = u.finalScriptSig), r && u.finalScriptWitness && (e.ins[f].witness = br(u.finalScriptWitness)), u.witnessUtxo)
       s += u.witnessUtxo.value;
     else if (u.nonWitnessUtxo) {
-      const p = rt(n, u, f), g = e.ins[f].index, y = p.outs[g];
+      const p = et(n, u, f), g = e.ins[f].index, y = p.outs[g];
       s += y.value;
     }
   });
@@ -3938,159 +3893,147 @@ function vr(t, e, n, r, c) {
   const a = e.virtualSize();
   n.__FEE = i, n.__EXTRACTED_TX = e, n.__FEE_RATE = Math.floor(i / a);
 }
-function rt(t, e, n) {
+function et(t, e, n) {
   const r = t.__NON_WITNESS_UTXO_TX_CACHE;
-  return r[n] || mt(t, e, n), r[n];
+  return r[n] || bt(t, e, n), r[n];
 }
-function Ir(t, e, n) {
-  const { script: r } = xt(t, e, n);
+function _r(t, e, n) {
+  const { script: r } = vt(t, e, n);
   return r;
 }
-function xt(t, e, n) {
+function vt(t, e, n) {
   if (e.witnessUtxo !== void 0)
     return {
       script: e.witnessUtxo.script,
       value: e.witnessUtxo.value
     };
   if (e.nonWitnessUtxo !== void 0) {
-    const c = rt(n, e, t).outs[n.__TX.ins[t].index];
+    const c = et(n, e, t).outs[n.__TX.ins[t].index];
     return { script: c.script, value: c.value };
   } else
     throw new Error("Can't find pubkey in input without Utxo data");
 }
-function Go(t, e, n, r) {
-  const c = Ir(n, e, r), { meaningfulScript: s } = st(
+function Po(t, e, n, r) {
+  const c = _r(n, e, r), { meaningfulScript: s } = tt(
     c,
     n,
     "input",
     e.redeemScript,
     e.witnessScript
   );
-  return nt(t, s);
+  return Qe(t, s);
 }
-function Xo(t, e, n, r) {
-  const c = r.__TX.outs[n].script, { meaningfulScript: s } = st(
+function No(t, e, n, r) {
+  const c = r.__TX.outs[n].script, { meaningfulScript: s } = tt(
     c,
     n,
     "output",
     e.redeemScript,
     e.witnessScript
   );
-  return nt(t, s);
+  return Qe(t, s);
 }
-function qo(t) {
+function Ho(t) {
   if (!t) return;
-  const e = he(t);
+  const e = fe(t);
   if (!e) return;
   const n = e[e.length - 1];
-  if (!(!l.isBuffer(n) || kr(n) || jo(n) || !he(n)))
+  if (!(!l.isBuffer(n) || mr(n) || Ro(n) || !fe(n)))
     return n;
 }
-function Do(t) {
+function Uo(t) {
   if (!t) return;
-  const e = mr(t), n = e[e.length - 1];
-  if (!(kr(n) || !he(n)))
+  const e = br(t), n = e[e.length - 1];
+  if (!(mr(n) || !fe(n)))
     return n;
 }
-function Vo(t) {
+function Bo(t) {
   if (t.length === 65) {
     const e = t[64] & 1, n = l.from(t.subarray(0, 33));
     return n[0] = 2 | e, n;
   }
   return l.from(t);
 }
-function kr(t) {
-  return t.length === 33 && Pr(t);
+function mr(t) {
+  return t.length === 33 && Or(t);
 }
-function jo(t) {
+function Ro(t) {
   return Hn(t);
 }
-function st(t, e, n, r, c) {
-  const s = ur(t), o = s && r && Dt(r), i = Dt(t);
+function tt(t, e, n, r, c) {
+  const s = ur(t), o = s && r && Sn(r), i = Sn(t);
   if (s && r === void 0)
     throw new Error("scriptPubkey is P2SH but redeemScript missing");
   if ((i || o) && c === void 0)
     throw new Error("scriptPubkey or redeemScript is P2WSH but witnessScript missing");
   let a;
-  return o ? (a = c, An(e, t, r, n), xn(e, r, c, n), ze(a)) : i ? (a = c, xn(e, t, c, n), ze(a)) : s ? (a = r, An(e, t, r, n)) : a = t, {
+  return o ? (a = c, In(e, t, r, n), vn(e, r, c, n), Xe(a)) : i ? (a = c, vn(e, t, c, n), Xe(a)) : s ? (a = r, In(e, t, r, n)) : a = t, {
     meaningfulScript: a,
     type: o ? "p2sh-p2wsh" : s ? "p2sh" : i ? "p2wsh" : "raw"
   };
 }
-function ze(t) {
-  if (tt(t) || ur(t))
+function Xe(t) {
+  if (Je(t) || ur(t))
     throw new Error("P2WPKH or P2SH can not be contained within P2WSH");
 }
-function Ar(t) {
-  return tt(t) ? "witnesspubkeyhash" : Qs(t) ? "pubkeyhash" : Zs(t) ? "multisig" : Js(t) ? "pubkey" : "nonstandard";
+function Ir(t) {
+  return Je(t) ? "witnesspubkeyhash" : Zs(t) ? "pubkeyhash" : Ys(t) ? "multisig" : $s(t) ? "pubkey" : "nonstandard";
 }
-function ye(t) {
+function de(t) {
   return [...Array(t).keys()];
 }
-const oi = {
-  networks: Qr,
-  address: ws,
-  payments: Wr,
-  script: Nr,
-  crypto: xr,
-  Transaction: Gr
-};
 export {
-  nt as $,
-  Wn as A,
-  De as B,
-  Qe as C,
-  et as D,
-  Gn as E,
-  ke as F,
-  Xn as G,
-  Dn as H,
-  bs as I,
-  jn as J,
-  zn as K,
-  $n as L,
+  $e as A,
+  Ze as B,
+  Qn as C,
+  er as D,
+  nr as E,
+  Ie as F,
+  vs as G,
+  rr as H,
+  sr as I,
+  or as J,
+  Ys as K,
+  $s as L,
   Zs as M,
-  Js as N,
-  Qs as O,
-  Tt as P,
-  tt as Q,
-  Dt as R,
-  ur as S,
-  It as T,
-  ri as U,
-  si as V,
-  Ee as W,
-  Vt as X,
-  Ne as Y,
-  fr as Z,
-  qn as _,
-  eo as a,
-  to as a0,
-  pr as a1,
-  ro as a2,
-  Je as b,
-  oi as c,
-  M as d,
-  ws as e,
-  Vn as f,
-  ei as g,
-  Qo as h,
-  Mn as i,
-  Bo as j,
-  Gt as k,
-  H as l,
-  at as m,
-  Qr as n,
-  Xt as o,
-  Ro as p,
-  qt as q,
-  ti as r,
-  Pe as s,
-  we as t,
-  ni as u,
-  Ks as v,
-  Ls as w,
-  Gs as x,
-  Ae as y,
-  xe as z
+  Je as N,
+  Sn as O,
+  wt as P,
+  ur as Q,
+  It as R,
+  qo as S,
+  Xo as T,
+  Se as U,
+  fr as V,
+  Qe as W,
+  Js as X,
+  pr as Y,
+  eo as Z,
+  tr as _,
+  ms as a,
+  Ye as b,
+  Do as c,
+  K as d,
+  vo as e,
+  Kn as f,
+  Io as g,
+  wn as h,
+  Fn as i,
+  N as j,
+  at as k,
+  En as l,
+  bn as m,
+  Go as n,
+  Vo as o,
+  xe as p,
+  jo as q,
+  ro as r,
+  Ke as s,
+  ye as t,
+  so as u,
+  co as v,
+  ve as w,
+  ke as x,
+  Jn as y,
+  qe as z
 };