@btc-vision/bitcoin 6.5.4 → 6.5.6

package/browser/chunks/{psbt-CcM4rw3q.js → psbt-BCNk7JUx.js}

@@ -1,9 +1,9 @@
-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-Ngcm87h_.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 { B as l, h as et } from "./crypto-BhCpKpek.js";
+import { p as we, a as Ee, b as Xe, c as be, d as Te, e as On, f as Pn, g as De, t as Tr, h as qe, M as Nn, L as _r, r as mr } from "./payments-B1wlSccx.js";
+import { o as ve, t as Ir, c as vr, d as ue, i as Un, s as de, a as kr } from "./script-DyPItFEl.js";
+import { t as Ar, a as xr, H as Cr, U as Or, i as Pr, b as Hn, c as At, r as Bn } from "./utils-DNZi-T5W.js";
 import { T as v } from "./transaction-C_UbhMGn.js";
-const Ye = {
+const Ve = {
   /**
    * The message prefix used for signing Bitcoin messages.
    */
@@ -39,7 +39,7 @@ const Ye = {
    * The prefix for Bitcoin Wallet Import Format (WIF) private keys.
    */
   wif: 128
-}, Rr = {
+}, Nr = {
   messagePrefix: `Bitcoin Signed Message:
 `,
   bech32: "bcrt",
@@ -51,7 +51,7 @@ const Ye = {
   pubKeyHash: 111,
   scriptHash: 196,
   wif: 239
-}, Fr = {
+}, Ur = {
   messagePrefix: `Bitcoin Signed Message:
 `,
   bech32: "tb",
@@ -63,7 +63,7 @@ const Ye = {
   pubKeyHash: 111,
   scriptHash: 196,
   wif: 239
-}, Kr = {
+}, Hr = {
   messagePrefix: `Dogecoin Signed Message:
 `,
   bech32: "",
@@ -76,7 +76,7 @@ const Ye = {
   pubKeyHash: 30,
   scriptHash: 22,
   wif: 158
-}, Lr = {
+}, Br = {
   messagePrefix: `Dogecoin Signed Message:
 `,
   bech32: "",
@@ -89,7 +89,7 @@ const Ye = {
   pubKeyHash: 113,
   scriptHash: 196,
   wif: 241
-}, Mr = {
+}, Rr = {
   messagePrefix: `Litecoin Signed Message:
 `,
   bech32: "ltc",
@@ -101,7 +101,7 @@ const Ye = {
   pubKeyHash: 48,
   scriptHash: 50,
   wif: 176
-}, Wr = {
+}, Fr = {
   messagePrefix: `Litecoin Signed Message:
 `,
   bech32: "tltc",
@@ -113,7 +113,7 @@ const Ye = {
   pubKeyHash: 111,
   scriptHash: 58,
   wif: 239
-}, Gr = {
+}, Kr = {
   messagePrefix: `Bitcoin Signed Message:
 `,
   // Cashaddr prefix differs from bech32 for general usage, but we can set it similarly.
@@ -127,7 +127,7 @@ const Ye = {
   pubKeyHash: 0,
   scriptHash: 5,
   wif: 128
-}, Dr = {
+}, Lr = {
   messagePrefix: `Bitcoin Signed Message:
 `,
   bech32: "bchtest",
@@ -139,7 +139,7 @@ const Ye = {
   pubKeyHash: 111,
   scriptHash: 196,
   wif: 239
-}, qr = {
+}, Mr = {
   // 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 Ye = {
   pubKeyHash: 76,
   scriptHash: 16,
   wif: 204
-}, Xr = {
+}, Wr = {
   messagePrefix: `DarkCoin Signed Message:
 `,
   bech32: "",
@@ -167,24 +167,24 @@ const Ye = {
   pubKeyHash: 140,
   scriptHash: 19,
   wif: 239
-}, Go = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}, Wo = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  bitcoin: Ye,
-  bitcoinCash: Gr,
-  bitcoinCashTestnet: Dr,
-  dash: qr,
-  dashTestnet: Xr,
-  dogecoin: Kr,
-  dogecoinTestnet: Lr,
-  litecoin: Mr,
-  litecoinTestnet: Wr,
-  regtest: Rr,
-  testnet: Fr
+  bitcoin: Ve,
+  bitcoinCash: Kr,
+  bitcoinCashTestnet: Lr,
+  dash: Mr,
+  dashTestnet: Wr,
+  dogecoin: Hr,
+  dogecoinTestnet: Br,
+  litecoin: Rr,
+  litecoinTestnet: Fr,
+  regtest: Nr,
+  testnet: Ur
 }, Symbol.toStringTag, { value: "Module" }));
-var ne = {}, At;
-function Vr() {
-  if (At) return ne;
-  At = 1, Object.defineProperty(ne, "__esModule", { value: !0 }), ne.bech32m = ne.bech32 = void 0;
+var ne = {}, xt;
+function Gr() {
+  if (xt) return ne;
+  xt = 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);
@@ -196,31 +196,31 @@ function Vr() {
   }
   function r(u) {
     let f = 1;
-    for (let p = 0; p < u.length; ++p) {
-      const g = u.charCodeAt(p);
+    for (let h = 0; h < u.length; ++h) {
+      const g = u.charCodeAt(h);
       if (g < 33 || g > 126)
         return "Invalid prefix (" + u + ")";
       f = n(f) ^ g >> 5;
     }
     f = n(f);
-    for (let p = 0; p < u.length; ++p) {
-      const g = u.charCodeAt(p);
+    for (let h = 0; h < u.length; ++h) {
+      const g = u.charCodeAt(h);
       f = n(f) ^ g & 31;
     }
     return f;
   }
-  function c(u, f, p, g) {
-    let y = 0, h = 0;
-    const d = (1 << p) - 1, E = [];
+  function c(u, f, h, g) {
+    let y = 0, p = 0;
+    const d = (1 << h) - 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);
+      for (y = y << f | u[b], p += f; p >= h; )
+        p -= h, E.push(y >> p & d);
     if (g)
-      h > 0 && E.push(y << p - h & d);
+      p > 0 && E.push(y << h - p & d);
     else {
-      if (h >= f)
+      if (p >= f)
         return "Excess padding";
-      if (y << p - h & d)
+      if (y << h - p & d)
         return "Non-zero padding";
     }
     return E;
@@ -242,7 +242,7 @@ function Vr() {
   function a(u) {
     let f;
     u === "bech32" ? f = 1 : f = 734539939;
-    function p(d, E, b) {
+    function h(d, E, b) {
       if (b = b || 90, d.length + 7 + E.length > b)
         throw new TypeError("Exceeds length limit");
       d = d.toLowerCase();
@@ -282,24 +282,24 @@ function Vr() {
       const _ = d.slice(0, w), I = d.slice(w + 1);
       if (I.length < 6)
         return "Data too short";
-      let O = r(_);
-      if (typeof O == "string")
-        return O;
+      let P = r(_);
+      if (typeof P == "string")
+        return P;
       const m = [];
       for (let k = 0; k < I.length; ++k) {
-        const H = I.charAt(k), B = e[H];
+        const U = I.charAt(k), B = e[U];
         if (B === void 0)
-          return "Unknown character " + H;
-        O = n(O) ^ B, !(k + 6 >= I.length) && m.push(B);
+          return "Unknown character " + U;
+        P = n(P) ^ B, !(k + 6 >= I.length) && m.push(B);
       }
-      return O !== f ? "Invalid checksum for " + d : { prefix: _, words: m };
+      return P !== f ? "Invalid checksum for " + d : { prefix: _, words: m };
     }
     function y(d, E) {
       const b = g(d, E);
       if (typeof b == "object")
         return b;
     }
-    function h(d, E) {
+    function p(d, E) {
       const b = g(d, E);
       if (typeof b == "object")
         return b;
@@ -307,8 +307,8 @@ function Vr() {
     }
     return {
       decodeUnsafe: y,
-      decode: h,
-      encode: p,
+      decode: p,
+      encode: h,
       toWords: s,
       fromWordsUnsafe: o,
       fromWords: i
@@ -316,75 +316,75 @@ function Vr() {
   }
   return ne.bech32 = a("bech32"), ne.bech32m = a("bech32m"), ne;
 }
-var K = Vr();
-function jr(t) {
+var K = Gr();
+function Xr(t) {
   return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
 }
-function Tt(t, ...e) {
-  if (!jr(t))
+function bt(t, ...e) {
+  if (!Xr(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 xt(t, e = !0) {
+function Ct(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 zr(t, e) {
-  Tt(t);
+function Dr(t, e) {
+  bt(t);
   const n = e.outputLen;
   if (t.length < n)
     throw new Error("digestInto() expects output buffer of length at least " + n);
 }
-function pt(...t) {
+function ft(...t) {
   for (let e = 0; e < t.length; e++)
     t[e].fill(0);
 }
-function rt(t) {
+function tt(t) {
   return new DataView(t.buffer, t.byteOffset, t.byteLength);
 }
-function U(t, e) {
+function H(t, e) {
   return t << 32 - e | t >>> e;
 }
-function Yr(t) {
+function qr(t) {
   if (typeof t != "string")
     throw new Error("string expected");
   return new Uint8Array(new TextEncoder().encode(t));
 }
 function Rn(t) {
-  return typeof t == "string" && (t = Yr(t)), Tt(t), t;
+  return typeof t == "string" && (t = qr(t)), bt(t), t;
 }
-class $r {
+class Vr {
 }
-function Zr(t) {
+function jr(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 Jr(t, e, n, r) {
+function zr(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 Qr(t, e, n) {
+function Yr(t, e, n) {
   return t & e ^ ~t & n;
 }
-function es(t, e, n) {
+function $r(t, e, n) {
   return t & e ^ t & n ^ e & n;
 }
-class ts extends $r {
+class Zr extends Vr {
   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 = rt(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 = tt(this.buffer);
   }
   update(e) {
-    xt(this), e = Rn(e), Tt(e);
+    Ct(this), e = Rn(e), bt(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 = rt(e);
+        const a = tt(e);
         for (; c <= s - o; o += c)
           this.process(a, o);
         continue;
@@ -394,21 +394,21 @@ class ts extends $r {
     return this.length += e.length, this.roundClean(), this;
   }
   digestInto(e) {
-    xt(this), zr(e, this), this.finished = !0;
+    Ct(this), Dr(e, this), this.finished = !0;
     const { buffer: n, view: r, blockLen: c, isLE: s } = this;
     let { pos: o } = this;
-    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;
-    Jr(r, c - 8, BigInt(this.length * 8), s), this.process(r, 0);
-    const i = rt(e), a = this.outputLen;
+    n[o++] = 128, ft(this.buffer.subarray(o)), this.padOffset > c - o && (this.process(r, 0), o = 0);
+    for (let h = o; h < c; h++)
+      n[h] = 0;
+    zr(r, c - 8, BigInt(this.length * 8), s), this.process(r, 0);
+    const i = tt(e), a = this.outputLen;
     if (a % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const u = a / 4, f = this.get();
     if (u > f.length)
       throw new Error("_sha2: outputLen bigger than state");
-    for (let p = 0; p < u; p++)
-      i.setUint32(4 * p, f[p], s);
+    for (let h = 0; h < u; h++)
+      i.setUint32(4 * h, f[h], s);
   }
   digest() {
     const { buffer: e, outputLen: n } = this;
@@ -434,7 +434,7 @@ const L = /* @__PURE__ */ Uint32Array.from([
   2600822924,
   528734635,
   1541459225
-]), ns = /* @__PURE__ */ Uint32Array.from([
+]), Jr = /* @__PURE__ */ Uint32Array.from([
   1116352408,
   1899447441,
   3049323471,
@@ -500,7 +500,7 @@ const L = /* @__PURE__ */ Uint32Array.from([
   3204031479,
   3329325298
 ]), M = /* @__PURE__ */ new Uint32Array(64);
-class rs extends ts {
+class Qr extends Zr {
   constructor(e = 32) {
     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;
   }
@@ -513,38 +513,38 @@ class rs extends ts {
     this.A = e | 0, this.B = n | 0, this.C = r | 0, this.D = c | 0, this.E = s | 0, this.F = o | 0, this.G = i | 0, this.H = a | 0;
   }
   process(e, n) {
-    for (let p = 0; p < 16; p++, n += 4)
-      M[p] = e.getUint32(n, !1);
-    for (let p = 16; p < 64; p++) {
-      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;
+    for (let h = 0; h < 16; h++, n += 4)
+      M[h] = e.getUint32(n, !1);
+    for (let h = 16; h < 64; h++) {
+      const g = M[h - 15], y = M[h - 2], p = H(g, 7) ^ H(g, 18) ^ g >>> 3, d = H(y, 17) ^ H(y, 19) ^ y >>> 10;
+      M[h] = d + M[h - 7] + p + M[h - 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 = 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;
+    for (let h = 0; h < 64; h++) {
+      const g = H(i, 6) ^ H(i, 11) ^ H(i, 25), y = f + g + Yr(i, a, u) + Jr[h] + M[h] | 0, d = (H(r, 2) ^ H(r, 13) ^ H(r, 22)) + $r(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() {
-    pt(M);
+    ft(M);
   }
   destroy() {
-    this.set(0, 0, 0, 0, 0, 0, 0, 0), pt(this.buffer);
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), ft(this.buffer);
   }
 }
-const ss = /* @__PURE__ */ Zr(() => new rs()), Ct = ss;
-function os(t) {
+const es = /* @__PURE__ */ jr(() => new Qr()), Ot = es;
+function ts(t) {
   if (t.length >= 255)
     throw new TypeError("Alphabet too long");
   const e = new Uint8Array(256);
   for (let u = 0; u < e.length; u++)
     e[u] = 255;
   for (let u = 0; u < t.length; u++) {
-    const f = t.charAt(u), p = f.charCodeAt(0);
-    if (e[p] !== 255)
+    const f = t.charAt(u), h = f.charCodeAt(0);
+    if (e[h] !== 255)
       throw new TypeError(f + " is ambiguous");
-    e[p] = u;
+    e[h] = u;
   }
   const n = t.length, r = t.charAt(0), c = Math.log(n) / Math.log(256), s = Math.log(256) / Math.log(n);
   function o(u) {
@@ -552,24 +552,24 @@ function os(t) {
       throw new TypeError("Expected Uint8Array");
     if (u.length === 0)
       return "";
-    let f = 0, p = 0, g = 0;
+    let f = 0, h = 0, g = 0;
     const y = u.length;
     for (; g !== y && u[g] === 0; )
       g++, f++;
-    const h = (y - g) * s + 1 >>> 0, d = new Uint8Array(h);
+    const p = (y - g) * s + 1 >>> 0, d = new Uint8Array(p);
     for (; g !== y; ) {
       let S = u[g], w = 0;
-      for (let _ = h - 1; (S !== 0 || w < p) && _ !== -1; _--, w++)
+      for (let _ = p - 1; (S !== 0 || w < h) && _ !== -1; _--, w++)
         S += 256 * d[_] >>> 0, d[_] = S % n >>> 0, S = S / n >>> 0;
       if (S !== 0)
         throw new Error("Non-zero carry");
-      p = w, g++;
+      h = w, g++;
     }
-    let E = h - p;
-    for (; E !== h && d[E] === 0; )
+    let E = p - h;
+    for (; E !== p && d[E] === 0; )
       E++;
     let b = r.repeat(f);
-    for (; E < h; ++E)
+    for (; E < p; ++E)
       b += t.charAt(d[E]);
     return b;
   }
@@ -578,10 +578,10 @@ function os(t) {
       throw new TypeError("Expected String");
     if (u.length === 0)
       return new Uint8Array();
-    let f = 0, p = 0, g = 0;
+    let f = 0, h = 0, g = 0;
     for (; u[f] === r; )
-      p++, f++;
-    const y = (u.length - f) * c + 1 >>> 0, h = new Uint8Array(y);
+      h++, f++;
+    const y = (u.length - f) * c + 1 >>> 0, p = new Uint8Array(y);
     for (; f < u.length; ) {
       const S = u.charCodeAt(f);
       if (S > 255)
@@ -591,18 +591,18 @@ function os(t) {
         return;
       let _ = 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;
+        w += n * p[I] >>> 0, p[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; )
+    for (; d !== y && p[d] === 0; )
       d++;
-    const E = new Uint8Array(p + (y - d));
-    let b = p;
+    const E = new Uint8Array(h + (y - d));
+    let b = h;
     for (; d !== y; )
-      E[b++] = h[d++];
+      E[b++] = p[d++];
     return E;
   }
   function a(u) {
@@ -617,12 +617,12 @@ function os(t) {
     decode: a
   };
 }
-var is = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz";
-const st = os(is);
-function cs(t) {
+var ns = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz";
+const nt = ts(ns);
+function rs(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), st.encode(u);
+    return u.set(o, 0), u.set(i.subarray(0, 4), o.length), nt.encode(u);
   }
   function n(s) {
     var o = s.slice(0, -4), i = s.slice(-4), a = t(o);
@@ -630,12 +630,12 @@ function cs(t) {
       return o;
   }
   function r(s) {
-    var o = st.decodeUnsafe(s);
+    var o = nt.decodeUnsafe(s);
     if (o != null)
       return n(o);
   }
   function c(s) {
-    var o = st.decode(s), i = n(o);
+    var o = nt.decode(s), i = n(o);
     if (i == null)
       throw new Error("Invalid checksum");
     return i;
@@ -646,10 +646,10 @@ function cs(t) {
     decodeUnsafe: r
   };
 }
-function as(t) {
-  return Ct(Ct(t));
+function ss(t) {
+  return Ot(Ot(t));
 }
-const Fn = cs(as);
+const Fn = rs(ss);
 function Kn(t) {
   let e, n;
   try {
@@ -666,92 +666,125 @@ function Kn(t) {
     data: l.from(r)
   };
 }
-const us = {
+const Ln = {
   p: 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2fn,
   n: 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141n,
+  h: 1n,
+  a: 0n,
   b: 7n,
   Gx: 0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798n,
   Gy: 0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8n
-}, { p: se, n: Ln, Gx: fs, Gy: ps, b: Mn } = us, Me = 32, ht = 64, P = (t = "") => {
-  throw new Error(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) => {
+}, { p: se, n: os, Gx: is, Gy: cs, b: Mn } = Ln, ht = 32, Tt = 64, as = {
+  publicKey: ht + 1,
+  publicKeyUncompressed: Tt + 1
+}, us = (...t) => {
+  "captureStackTrace" in Error && typeof Error.captureStackTrace == "function" && Error.captureStackTrace(...t);
+}, C = (t = "") => {
+  const e = new Error(t);
+  throw us(e, C), e;
+}, fs = (t) => typeof t == "bigint", hs = (t) => typeof t == "string", ps = (t) => t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array", _t = (t, e, n = "") => {
+  const r = ps(t), c = t?.length, s = e !== void 0;
+  if (!r || s && c !== e) {
+    const o = n && `"${n}" `, i = s ? ` of length ${e}` : "", a = r ? `length=${c}` : `type=${typeof t}`;
+    C(o + "expected Uint8Array" + i + ", got " + a);
+  }
+  return t;
+}, Wn = (t) => new Uint8Array(t), Gn = (t, e) => t.toString(16).padStart(e, "0"), Xn = (t) => Array.from(_t(t)).map((e) => Gn(e, 2)).join(""), R = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 }, Pt = (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) => {
+}, Dn = (t) => {
   const e = "hex invalid";
-  if (!Gn(t))
-    return P(e);
+  if (!hs(t))
+    return C(e);
   const n = t.length, r = n / 2;
   if (n % 2)
-    return P(e);
-  const c = Dn(r);
+    return C(e);
+  const c = Wn(r);
   for (let s = 0, o = 0; s < r; s++, o += 2) {
-    const i = Ot(t.charCodeAt(o)), a = Ot(t.charCodeAt(o + 1));
+    const i = Pt(t.charCodeAt(o)), a = Pt(t.charCodeAt(o + 1));
     if (i === void 0 || a === void 0)
-      return P(e);
+      return C(e);
     c[s] = i * 16 + a;
   }
   return c;
-}, 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));
+}, Nt = (...t) => {
+  const e = Wn(t.reduce((r, c) => r + _t(c).length, 0));
   let n = 0;
   return t.forEach((r) => {
     e.set(r, n), n += r.length;
   }), e;
-}, 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) => {
+}, Le = BigInt, je = (t, e, n, r = "bad number: out of range") => fs(t) && e <= t && t < n ? t : C(r), T = (t, e = se) => {
   const n = t % e;
   return n >= 0n ? n : e + n;
-}, ds = (t, e) => {
-  (t === 0n || e <= 0n) && P("no inverse n=" + t + " mod=" + e);
+}, ls = (t, e) => {
+  (t === 0n || e <= 0n) && C("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) : 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));
+  return r === 1n ? T(c, e) : C("no inverse");
+}, rt = (t) => t instanceof O ? t : C("Point expected"), qn = (t) => T(T(t * t) * t + Mn), Ut = (t) => je(t, 0n, se), Ke = (t) => je(t, 1n, se), ds = (t) => je(t, 1n, os), pt = (t) => (t & 1n) === 0n, Vn = (t) => Uint8Array.of(t), gs = (t) => Vn(pt(t) ? 2 : 3), ys = (t) => {
+  const e = qn(Ke(t));
   let n = 1n;
   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");
+  return T(n * n) === e ? n : C("sqrt invalid");
 };
-class C {
+class O {
   static BASE;
   static ZERO;
-  px;
-  py;
-  pz;
+  X;
+  Y;
+  Z;
   constructor(e, n, r) {
-    this.px = Ht(e), this.py = We(n), this.pz = Ht(r), Object.freeze(this);
+    this.X = Ut(e), this.Y = Ke(n), this.Z = Ut(r), Object.freeze(this);
+  }
+  static CURVE() {
+    return Ln;
+  }
+  /** 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 ? re : new O(n, r, 1n);
   }
   /** Convert Uint8Array or hex string to Point. */
   static fromBytes(e) {
-    we(e);
-    let n;
-    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);
+    _t(e);
+    const { publicKey: n, publicKeyUncompressed: r } = as;
+    let c;
+    const s = e.length, o = e[0], i = e.subarray(1), a = Ht(i, 0, ht);
+    if (s === n && (o === 2 || o === 3)) {
+      let u = ys(a);
+      const f = pt(u);
+      pt(Le(o)) !== f && (u = T(-u)), c = new O(a, u, 1n);
     }
-    return o === ht + 1 && r === 4 && (n = new C(s, Ut(c, Me, ht), 1n)), n ? n.assertValidity() : P("bad point: not on curve");
+    return s === r && o === 4 && (c = new O(a, Ht(i, ht, Tt), 1n)), c ? c.assertValidity() : C("bad point: not on curve");
+  }
+  static fromHex(e) {
+    return O.fromBytes(Dn(e));
+  }
+  get x() {
+    return this.toAffine().x;
+  }
+  get y() {
+    return this.toAffine().y;
   }
   /** Equality check: compare points P&Q. */
   equals(e) {
-    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;
+    const { X: n, Y: r, Z: c } = this, { X: s, Y: o, Z: i } = rt(e), a = T(n * i), u = T(s * c), f = T(r * i), h = T(o * c);
+    return a === u && f === h;
   }
   is0() {
     return this.equals(re);
   }
   /** Flip point over y coordinate. */
   negate() {
-    return new C(this.px, T(-this.py), this.pz);
+    return new O(this.X, T(-this.Y), this.Z);
   }
   /** Point doubling: P+P, complete formula. */
   double() {
@@ -764,13 +797,16 @@ class C {
    */
   // prettier-ignore
   add(e) {
-    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 { X: n, Y: r, Z: c } = this, { X: s, Y: o, Z: i } = rt(e), a = 0n, u = Mn;
+    let f = 0n, h = 0n, g = 0n;
     const y = T(u * 3n);
-    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 p = 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(p + 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);
+    return S = T(S * w), w = T(p + 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), h = T(f * g), d = T(p + p), d = T(d + p), E = T(a * E), S = T(y * S), d = T(d + E), E = T(p - E), E = T(a * E), S = T(S + E), p = T(d * S), h = T(h + p), p = T(w * S), f = T(b * f), f = T(f - p), p = T(b * d), g = T(w * g), g = T(g + p), new O(f, h, g);
+  }
+  subtract(e) {
+    return this.add(rt(e).negate());
   }
   /**
    * Point-by-scalar multiplication. Scalar must be in range 1 <= n < CURVE.n.
@@ -782,71 +818,51 @@ class C {
   multiply(e, n = !0) {
     if (!n && e === 0n)
       return re;
-    if (gs(e), e === 1n)
+    if (ds(e), e === 1n)
       return this;
-    if (this.equals(ae))
-      return _s(e).p;
-    let r = re, c = ae;
+    if (this.equals(Se))
+      return Ts(e).p;
+    let r = re, c = Se;
     for (let s = this; e > 0n; s = s.double(), e >>= 1n)
       e & 1n ? r = r.add(s) : n && (c = c.add(s));
     return r;
   }
+  multiplyUnsafe(e) {
+    return this.multiply(e, !1);
+  }
   /** 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;
+    const { X: e, Y: n, Z: r } = this;
     if (this.equals(re))
       return { x: 0n, y: 0n };
     if (r === 1n)
       return { x: e, y: n };
-    const c = ds(r, se);
-    return T(r * c) !== 1n && P("inverse invalid"), { x: T(e * c), y: T(n * c) };
+    const c = ls(r, se);
+    return T(r * c) !== 1n && C("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 We(e), We(n), T(n * n) === zn(e) ? this : P("bad point: not on curve");
+    return Ke(e), Ke(n), T(n * n) === qn(e) ? this : C("bad point: not on curve");
   }
   /** Converts point to 33/65-byte Uint8Array. */
   toBytes(e = !0) {
     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 ? re : new C(n, r, 1n);
+    return e ? Nt(gs(r), c) : Nt(Vn(4), c, Bt(r));
   }
   toHex(e) {
     return Xn(this.toBytes(e));
   }
-  static fromPrivateKey(e) {
-    return ae.multiply(Es(e));
-  }
-  static fromHex(e) {
-    return C.fromBytes(jn(e));
-  }
-  get x() {
-    return this.toAffine().x;
-  }
-  get y() {
-    return this.toAffine().y;
-  }
-  toRawBytes(e) {
-    return this.toBytes(e);
-  }
 }
-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 Se = new O(is, cs, 1n), re = new O(0n, 1n, 0n);
+O.BASE = Se;
+O.ZERO = re;
+const Ss = (t) => Le("0x" + (Xn(t) || "0")), Ht = (t, e, n) => Ss(t.subarray(e, n)), ws = 2n ** 256n, Bt = (t) => Dn(Gn(je(t, 0n, ws), Tt)), Me = 8, Es = 256, jn = Math.ceil(Es / Me) + 1, lt = 2 ** (Me - 1), bs = () => {
   const t = [];
-  let e = ae, n = e;
-  for (let r = 0; r < Zn; r++) {
+  let e = Se, n = e;
+  for (let r = 0; r < jn; r++) {
     n = e, t.push(n);
-    for (let c = 1; c < dt; c++)
+    for (let c = 1; c < lt; c++)
       n = n.add(e), t.push(n);
     e = n.double();
   }
@@ -856,18 +872,18 @@ let Rt;
 const Ft = (t, e) => {
   const n = e.negate();
   return t ? n : e;
-}, _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++) {
+}, Ts = (t) => {
+  const e = Rt || (Rt = bs());
+  let n = re, r = Se;
+  const c = 2 ** Me, s = c, o = Le(c - 1), i = Le(Me);
+  for (let a = 0; a < jn; a++) {
     let u = Number(t & o);
-    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]));
+    t >>= i, u > lt && (u -= s, t += 1n);
+    const f = a * lt, h = f, g = f + Math.abs(u) - 1, y = a % 2 !== 0, p = u < 0;
+    u === 0 ? r = r.add(Ft(y, e[h])) : n = n.add(Ft(p, e[g]));
   }
-  return { p: n, f: r };
-}, ye = (t) => {
+  return t !== 0n && C("invalid wnaf"), { p: n, f: r };
+}, ge = (t) => {
   const e = t.length === 32 ? t : t.subarray(1, 33);
   return l.isBuffer(e) ? e : l.from(e);
 };
@@ -875,7 +891,7 @@ 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 ms(t) {
+function _s(t) {
   if (t.length === 32)
     return;
   if (![33, 65].includes(t.length)) {
@@ -886,7 +902,7 @@ function ms(t) {
   }
   let e;
   try {
-    e = C.fromHex(t);
+    e = O.fromHex(l.from(t).toString("hex"));
   } catch {
     throw new Error("Invalid secp256k1 public key bytes. Cannot parse.");
   }
@@ -898,7 +914,7 @@ function ms(t) {
     uncompressed: i
   };
 }
-function xe(t, e) {
+function ke(t, e) {
   if (t.equals(e)) return !0;
   if (t.length === 65 && e.length === 65) {
     const n = l.from(t), r = l.from(e);
@@ -906,13 +922,13 @@ function xe(t, e) {
   }
   return !1;
 }
-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) => {
+const _e = 40, me = 2, Ie = 15, zn = 16, We = 16, ze = 2, Ye = 80, ms = "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.", Yn = (t) => {
   try {
     const e = l.from(t.subarray(2));
-    if (e.length < ve || e.length > Ie)
+    if (e.length < me || e.length > _e)
       throw new TypeError("Invalid program length for segwit address");
-    const n = t[0] - Ze;
-    if (n < $e || n > ke + 1)
+    const n = t[0] - Ye;
+    if (n < ze || n > Ie + 1)
       throw new TypeError("Invalid version for segwit address");
     if (n === 1) throw new TypeError("taproot");
     return !0;
@@ -920,7 +936,7 @@ const Ie = 40, ve = 2, ke = 15, Jn = 16, qe = 16, $e = 2, Ze = 80, Is = "WARNING
   }
   return !1;
 };
-function er(t, e) {
+function $n(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];
@@ -932,85 +948,85 @@ function er(t, e) {
   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)
+  if (s.length < me || s.length > _e)
     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)
+  const o = n === ve.OP_0 ? 0 : n >= ve.OP_1 && n <= ve.OP_16 ? n - (ve.OP_1 - 1) : -1;
+  if (o < Ie || o > zn)
     throw new TypeError(`Invalid segwit version ${o}`);
   const i = [o, ...K.bech32m.toWords(s)];
   return K.bech32m.encode(e.bech32Opnet, i);
 }
-function tr(t, e) {
+function Zn(t, e) {
   const n = l.from(t.subarray(2));
-  if (n.length < ve || n.length > Ie)
+  if (n.length < me || n.length > _e)
     throw new TypeError("Invalid program length for segwit address");
-  const r = t[0] - Ze;
-  if (r < $e || r > ke)
+  const r = t[0] - Ye;
+  if (r < ze || r > Ie)
     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);
+  return Qn(n, r, e.bech32, e.bech32Opnet);
 }
-function nr(t) {
+function Jn(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 vs(t, e) {
-  Pr(Nr(Hr, Ur), [t, e]);
+function Is(t, e) {
+  Ar(xr(Cr, Or), [t, e]);
   const n = l.allocUnsafe(21);
   return n.writeUInt8(e, 0), t.copy(n, 1), Fn.encode(n);
 }
-function rr(t, e, n, r) {
+function Qn(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);
+  return c.unshift(e), e === We && r ? K.bech32m.encode(r, c) : e === 0 ? K.bech32.encode(n, c) : K.bech32m.encode(n, c);
 }
-function sr(t, e) {
-  e = e || Ye;
+function er(t, e) {
+  e = e || Ve;
   try {
-    return Ee({ output: t, network: e }).address;
+    return we({ output: t, network: e }).address;
   } catch {
   }
   try {
-    return be({ output: t, network: e }).address;
+    return Ee({ output: t, network: e }).address;
   } catch {
   }
   try {
-    return Ve({ output: t, network: e }).address;
+    return Xe({ output: t, network: e }).address;
   } catch {
   }
   try {
-    return Te({ output: t, network: e }).address;
+    return be({ output: t, network: e }).address;
   } catch {
   }
   try {
-    return _e({ output: t, network: e }).address;
+    return Te({ output: t, network: e }).address;
   } catch {
   }
   try {
-    return er(t, e);
+    return $n(t, e);
   } catch {
   }
   try {
-    return tr(t, e);
+    return Zn(t, e);
   } catch {
   }
-  throw new Error(xr(t) + " has no matching Address");
+  throw new Error(Ir(t) + " has no matching Address");
 }
-function or(t, e) {
-  e = e || Ye;
+function tr(t, e) {
+  e = e || Ve;
   let n, r;
   try {
-    n = nr(t);
+    n = Jn(t);
   } catch {
   }
   if (n) {
     if (n.version === e.pubKeyHash)
-      return Ee({ hash: n.hash }).output;
+      return we({ hash: n.hash }).output;
     if (n.version === e.scriptHash)
-      return be({ hash: n.hash }).output;
+      return Ee({ hash: n.hash }).output;
   } else {
     try {
       r = Kn(t);
@@ -1021,47 +1037,47 @@ function or(t, e) {
         throw new Error(t + " has an invalid prefix");
       if (r.version === 0) {
         if (r.data.length === 20)
-          return Ve({ hash: r.data }).output;
+          return Xe({ hash: r.data }).output;
         if (r.data.length === 32)
-          return Te({ hash: r.data }).output;
+          return be({ 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) {
+          return Te({ pubkey: r.data }).output;
+      } else if (r.version === We) {
         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,
+      } else if (r.version >= ze && r.version <= Ie && r.data.length >= me && r.data.length <= _e)
+        return r.version !== We && console.warn(ms), vr([
+          r.version + Ye,
           r.data
         ]);
     }
   }
   throw new TypeError(t + " has no matching Script");
 }
-const Do = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Go = /* @__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,
+  FUTURE_MAX_VERSION: zn,
+  FUTURE_OPNET_VERSION: We,
+  FUTURE_SEGWIT_MAX_SIZE: _e,
+  FUTURE_SEGWIT_MAX_VERSION: Ie,
+  FUTURE_SEGWIT_MIN_SIZE: me,
+  FUTURE_SEGWIT_MIN_VERSION: ze,
+  FUTURE_SEGWIT_VERSION_DIFF: Ye,
+  _toFutureSegwitAddress: Zn,
+  fromBase58Check: Jn,
   fromBech32: Kn,
-  fromOutputScript: sr,
-  isUnknownSegwitVersion: Qn,
-  toBase58Check: vs,
-  toBech32: rr,
-  toFutureOPNetAddress: er,
-  toOutputScript: or
+  fromOutputScript: er,
+  isUnknownSegwitVersion: Yn,
+  toBase58Check: Is,
+  toBech32: Qn,
+  toFutureOPNetAddress: $n,
+  toOutputScript: tr
 }, Symbol.toStringTag, { value: "Module" }));
-var Ce = {}, Oe = {}, ot = {}, oe = {}, ie = {}, it = {}, Lt;
+var Ae = {}, xe = {}, st = {}, oe = {}, ie = {}, ot = {}, Lt;
 function A() {
   return Lt || (Lt = 1, (function(t) {
     Object.defineProperty(t, "__esModule", { value: !0 }), (function(e) {
@@ -1095,10 +1111,10 @@ function A() {
       "tapTree",
       "tapBip32Derivation"
     ];
-  })(it)), it;
+  })(ot)), ot;
 }
 var W = {}, Mt;
-function ks() {
+function vs() {
   if (Mt) return W;
   Mt = 1, Object.defineProperty(W, "__esModule", { value: !0 });
   const t = A(), e = (o) => [...Array(o).keys()];
@@ -1121,8 +1137,8 @@ function ks() {
       path: "m"
     };
     for (const u of e(o.value.length / 4 - 1)) {
-      const f = o.value.readUInt32LE(u * 4 + 4), p = !!(f & 2147483648), g = f & 2147483647;
-      a.path += "/" + g.toString(10) + (p ? "'" : "");
+      const f = o.value.readUInt32LE(u * 4 + 4), h = !!(f & 2147483648), g = f & 2147483647;
+      a.path += "/" + g.toString(10) + (h ? "'" : "");
     }
     return a;
   }
@@ -1130,11 +1146,11 @@ function ks() {
   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);
-    let p = 4;
+    let h = 4;
     return u.slice(1).forEach((g) => {
       const y = g.slice(-1) === "'";
-      let h = 2147483647 & parseInt(y ? g.slice(0, -1) : g, 10);
-      y && (h += 2147483648), f.writeUInt32LE(h, p), p += 4;
+      let p = 2147483647 & parseInt(y ? g.slice(0, -1) : g, 10);
+      y && (p += 2147483648), f.writeUInt32LE(p, h), h += 4;
     }), {
       key: a,
       value: f
@@ -1152,10 +1168,10 @@ function ks() {
   }
   return W.canAddToArray = s, W;
 }
-var Pe = {}, Wt;
-function As() {
-  if (Wt) return Pe;
-  Wt = 1, Object.defineProperty(Pe, "__esModule", { value: !0 });
+var Ce = {}, Wt;
+function ks() {
+  if (Wt) return Ce;
+  Wt = 1, Object.defineProperty(Ce, "__esModule", { value: !0 });
   const t = A();
   function e(n) {
     return {
@@ -1163,10 +1179,10 @@ function As() {
       value: n.toBuffer()
     };
   }
-  return Pe.encode = e, Pe;
+  return Ce.encode = e, Ce;
 }
 var G = {}, Gt;
-function xs() {
+function As() {
   if (Gt) return G;
   Gt = 1, Object.defineProperty(G, "__esModule", { value: !0 });
   const t = A();
@@ -1194,10 +1210,10 @@ function xs() {
   }
   return G.canAdd = c, G;
 }
-var D = {}, Dt;
-function Cs() {
-  if (Dt) return D;
-  Dt = 1, Object.defineProperty(D, "__esModule", { value: !0 });
+var X = {}, Xt;
+function xs() {
+  if (Xt) return X;
+  Xt = 1, Object.defineProperty(X, "__esModule", { value: !0 });
   const t = A();
   function e(s) {
     if (s.key[0] !== t.InputTypes.FINAL_SCRIPTWITNESS)
@@ -1206,27 +1222,27 @@ function Cs() {
       );
     return s.value;
   }
-  D.decode = e;
+  X.decode = e;
   function n(s) {
     return {
       key: l.from([t.InputTypes.FINAL_SCRIPTWITNESS]),
       value: s
     };
   }
-  D.encode = n, D.expected = "Buffer";
+  X.encode = n, X.expected = "Buffer";
   function r(s) {
     return l.isBuffer(s);
   }
-  D.check = r;
+  X.check = r;
   function c(s, o) {
     return !!s && !!o && s.finalScriptWitness === void 0;
   }
-  return D.canAdd = c, D;
+  return X.canAdd = c, X;
 }
-var q = {}, qt;
-function Os() {
-  if (qt) return q;
-  qt = 1, Object.defineProperty(q, "__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.NON_WITNESS_UTXO)
@@ -1235,27 +1251,27 @@ function Os() {
       );
     return s.value;
   }
-  q.decode = e;
+  D.decode = e;
   function n(s) {
     return {
       key: l.from([t.InputTypes.NON_WITNESS_UTXO]),
       value: s
     };
   }
-  q.encode = n, q.expected = "Buffer";
+  D.encode = n, D.expected = "Buffer";
   function r(s) {
     return l.isBuffer(s);
   }
-  q.check = r;
+  D.check = r;
   function c(s, o) {
     return !!s && !!o && s.nonWitnessUtxo === void 0;
   }
-  return q.canAdd = c, q;
+  return D.canAdd = c, D;
 }
-var X = {}, Xt;
-function Ps() {
-  if (Xt) return X;
-  Xt = 1, Object.defineProperty(X, "__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(o) {
     if (o.key[0] !== t.InputTypes.PARTIAL_SIG)
@@ -1271,7 +1287,7 @@ function Ps() {
       signature: o.value
     };
   }
-  X.decode = e;
+  q.decode = e;
   function n(o) {
     const i = l.from([t.InputTypes.PARTIAL_SIG]);
     return {
@@ -1279,11 +1295,11 @@ function Ps() {
       value: o.signature
     };
   }
-  X.encode = n, X.expected = "{ pubkey: Buffer; signature: Buffer; }";
+  q.encode = n, q.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);
   }
-  X.check = r;
+  q.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];
@@ -1295,10 +1311,10 @@ function Ps() {
     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 X.canAddToArray = s, X;
+  return q.canAddToArray = s, q;
 }
 var V = {}, Vt;
-function Ns() {
+function Ps() {
   if (Vt) return V;
   Vt = 1, Object.defineProperty(V, "__esModule", { value: !0 });
   const t = A();
@@ -1327,7 +1343,7 @@ function Ns() {
   return V.canAdd = c, V;
 }
 var j = {}, jt;
-function Hs() {
+function Ns() {
   if (jt) return j;
   jt = 1, Object.defineProperty(j, "__esModule", { value: !0 });
   const t = A();
@@ -1387,7 +1403,7 @@ function Us() {
   return z.canAdd = c, z;
 }
 var Y = {}, Yt;
-function Bs() {
+function Hs() {
   if (Yt) return Y;
   Yt = 1, Object.defineProperty(Y, "__esModule", { value: !0 });
   const t = A();
@@ -1428,7 +1444,7 @@ function Bs() {
   return Y.canAddToArray = c, Y;
 }
 var $ = {}, $t;
-function Rs() {
+function Bs() {
   if ($t) return $;
   $t = 1, Object.defineProperty($, "__esModule", { value: !0 });
   const t = A();
@@ -1456,7 +1472,7 @@ function Rs() {
   return $.canAdd = c, $;
 }
 var Z = {}, Zt;
-function Fs() {
+function Rs() {
   if (Zt) return Z;
   Zt = 1, Object.defineProperty(Z, "__esModule", { value: !0 });
   const t = A();
@@ -1502,7 +1518,7 @@ function Fs() {
   return Z.canAddToArray = c, Z;
 }
 var J = {}, F = {}, ce = {}, Jt;
-function pe() {
+function fe() {
   if (Jt) return ce;
   Jt = 1, Object.defineProperty(ce, "__esModule", { value: !0 });
   const t = 9007199254740991;
@@ -1540,10 +1556,10 @@ function pe() {
   return ce.encodingLength = c, ce;
 }
 var Qt;
-function _t() {
+function mt() {
   if (Qt) return F;
   Qt = 1, Object.defineProperty(F, "__esModule", { value: !0 });
-  const t = pe();
+  const t = fe();
   F.range = (i) => [...Array(i).keys()];
   function e(i) {
     if (i.length < 1) return i;
@@ -1559,10 +1575,10 @@ function _t() {
   }
   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
+    const a = i.key.length, u = i.value.length, f = t.encodingLength(a), h = t.encodingLength(u), g = l.allocUnsafe(
+      f + a + h + 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;
+    return t.encode(a, g, 0), i.key.copy(g, f), t.encode(u, g, f + a), i.value.copy(g, f + a + h), g;
   }
   F.keyValToBuffer = r;
   function c(i, a) {
@@ -1586,10 +1602,10 @@ function _t() {
   return F.writeUInt64LE = o, F;
 }
 var en;
-function Ks() {
+function Fs() {
   if (en) return J;
   en = 1, Object.defineProperty(J, "__esModule", { value: !0 });
-  const t = A(), e = _t(), n = pe();
+  const t = A(), e = mt(), n = fe();
   function r(i) {
     if (i.key[0] !== t.InputTypes.WITNESS_UTXO)
       throw new Error(
@@ -1599,20 +1615,20 @@ function Ks() {
     let u = 8;
     const f = n.decode(i.value, u);
     u += n.encodingLength(f);
-    const p = i.value.slice(u);
-    if (p.length !== f)
+    const h = i.value.slice(u);
+    if (h.length !== f)
       throw new Error("Decode Error: WITNESS_UTXO script is not proper length");
     return {
-      script: p,
+      script: h,
       value: a
     };
   }
   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), {
+    const { script: a, value: u } = i, f = n.encodingLength(a.length), h = l.allocUnsafe(8 + f + a.length);
+    return e.writeUInt64LE(h, u, 0), n.encode(a.length, h, 8), a.copy(h, 8 + f), {
       key: l.from([t.InputTypes.WITNESS_UTXO]),
-      value: p
+      value: h
     };
   }
   J.encode = c, J.expected = "{ script: Buffer; value: number; }";
@@ -1626,10 +1642,10 @@ function Ks() {
   return J.canAdd = o, J;
 }
 var Q = {}, tn;
-function Ls() {
+function Ks() {
   if (tn) return Q;
   tn = 1, Object.defineProperty(Q, "__esModule", { value: !0 });
-  const t = A(), e = pe();
+  const t = A(), e = fe();
   function n(o) {
     if (o.key[0] !== t.OutputTypes.TAP_TREE || o.key.length !== 1)
       throw new Error(
@@ -1638,12 +1654,12 @@ function Ls() {
     let i = 0;
     const a = [];
     for (; i < o.value.length; ) {
-      const u = o.value[i++], f = o.value[i++], p = e.decode(o.value, i);
-      i += e.encodingLength(p), a.push({
+      const u = o.value[i++], f = o.value[i++], h = e.decode(o.value, i);
+      i += e.encodingLength(h), a.push({
         depth: u,
         leafVersion: f,
-        script: o.value.slice(i, i + p)
-      }), i += p;
+        script: o.value.slice(i, i + h)
+      }), i += h;
     }
     return { leaves: a };
   }
@@ -1673,10 +1689,10 @@ function Ls() {
   }
   return Q.canAdd = s, Q;
 }
-var Ne = {}, nn;
-function ir() {
-  if (nn) return Ne;
-  nn = 1, Object.defineProperty(Ne, "__esModule", { value: !0 });
+var Oe = {}, nn;
+function nr() {
+  if (nn) return Oe;
+  nn = 1, Object.defineProperty(Oe, "__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) {
@@ -1684,8 +1700,8 @@ function ir() {
         throw new Error(
           "Decode Error: could not decode bip32Derivation with key 0x" + f.key.toString("hex")
         );
-      const p = f.key.slice(1);
-      if (!c(p))
+      const h = f.key.slice(1);
+      if (!c(h))
         throw new Error(
           "Decode Error: bip32Derivation has invalid pubkey in key 0x" + f.key.toString("hex")
         );
@@ -1695,35 +1711,35 @@ function ir() {
         );
       const g = {
         masterFingerprint: f.value.slice(0, 4),
-        pubkey: p,
+        pubkey: h,
         path: "m"
       };
       for (const y of t(f.value.length / 4 - 1)) {
-        const h = f.value.readUInt32LE(y * 4 + 4), d = !!(h & 2147483648), E = h & 2147483647;
+        const p = f.value.readUInt32LE(y * 4 + 4), d = !!(p & 2147483648), E = p & 2147483647;
         g.path += "/" + E.toString(10) + (d ? "'" : "");
       }
       return g;
     }
     function o(f) {
-      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);
+      const h = l.from([r]), g = l.concat([h, f.pubkey]), y = f.path.split("/"), p = l.allocUnsafe(y.length * 4);
+      f.masterFingerprint.copy(p, 0);
       let 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;
+        b && (S += 2147483648), p.writeUInt32LE(S, d), d += 4;
       }), {
         key: g,
-        value: h
+        value: p
       };
     }
     const i = "{ masterFingerprint: Buffer; pubkey: Buffer; path: string; }";
     function a(f) {
       return l.isBuffer(f.pubkey) && l.isBuffer(f.masterFingerprint) && typeof f.path == "string" && c(f.pubkey) && f.masterFingerprint.length === 4;
     }
-    function u(f, p, g) {
-      const y = p.pubkey.toString("hex");
-      return g.has(y) ? !1 : (g.add(y), f.filter((h) => h.pubkey.equals(p.pubkey)).length === 0);
+    function u(f, h, g) {
+      const y = h.pubkey.toString("hex");
+      return g.has(y) ? !1 : (g.add(y), f.filter((p) => p.pubkey.equals(h.pubkey)).length === 0);
     }
     return {
       decode: s,
@@ -1733,12 +1749,12 @@ function ir() {
       canAddToArray: u
     };
   }
-  return Ne.makeConverter = n, Ne;
+  return Oe.makeConverter = n, Oe;
 }
-var He = {}, rn;
-function Ms() {
-  if (rn) return He;
-  rn = 1, Object.defineProperty(He, "__esModule", { value: !0 });
+var Pe = {}, rn;
+function Ls() {
+  if (rn) return Pe;
+  rn = 1, Object.defineProperty(Pe, "__esModule", { value: !0 });
   function t(e) {
     return n;
     function n(r) {
@@ -1750,12 +1766,12 @@ function Ms() {
       return c;
     }
   }
-  return He.makeChecker = t, He;
+  return Pe.makeChecker = t, Pe;
 }
-var Ue = {}, sn;
-function Ws() {
-  if (sn) return Ue;
-  sn = 1, Object.defineProperty(Ue, "__esModule", { value: !0 });
+var Ne = {}, sn;
+function Ms() {
+  if (sn) return Ne;
+  sn = 1, Object.defineProperty(Ne, "__esModule", { value: !0 });
   function t(e) {
     function n(i) {
       if (i.key[0] !== e)
@@ -1785,34 +1801,34 @@ function Ws() {
       canAdd: o
     };
   }
-  return Ue.makeConverter = t, Ue;
+  return Ne.makeConverter = t, Ne;
 }
-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;
+var Ue = {}, on;
+function Ws() {
+  if (on) return Ue;
+  on = 1, Object.defineProperty(Ue, "__esModule", { value: !0 });
+  const t = fe(), e = nr(), n = (c) => c.length === 32;
   function r(c) {
     const s = e.makeConverter(c, n);
     function o(f) {
-      const p = t.decode(f.value), g = t.encodingLength(p), y = s.decode({
+      const h = t.decode(f.value), g = t.encodingLength(h), y = s.decode({
         key: f.key,
-        value: f.value.slice(g + p * 32)
-      }), h = new Array(p);
-      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 });
+        value: f.value.slice(g + h * 32)
+      }), p = new Array(h);
+      for (let d = 0, E = g; d < h; d++, E += 32)
+        p[d] = f.value.slice(E, E + 32);
+      return Object.assign({}, y, { leafHashes: p });
     }
     function i(f) {
-      const p = s.encode(f), g = t.encodingLength(f.leafHashes.length), y = l.allocUnsafe(g);
+      const h = s.encode(f), g = t.encodingLength(f.leafHashes.length), y = l.allocUnsafe(g);
       t.encode(f.leafHashes.length, y);
-      const h = l.concat([y, ...f.leafHashes, p.value]);
-      return Object.assign({}, p, { value: h });
+      const p = l.concat([y, ...f.leafHashes, h.value]);
+      return Object.assign({}, h, { value: p });
     }
     const a = "{ masterFingerprint: Buffer; pubkey: Buffer; path: string; leafHashes: Buffer[]; }";
     function u(f) {
       return Array.isArray(f.leafHashes) && f.leafHashes.every(
-        (p) => l.isBuffer(p) && p.length === 32
+        (h) => l.isBuffer(h) && h.length === 32
       ) && s.check(f);
     }
     return {
@@ -1823,12 +1839,12 @@ function Gs() {
       canAddToArray: s.canAddToArray
     };
   }
-  return Be.makeConverter = r, Be;
+  return Ue.makeConverter = r, Ue;
 }
-var Re = {}, cn;
-function Ds() {
-  if (cn) return Re;
-  cn = 1, Object.defineProperty(Re, "__esModule", { value: !0 });
+var He = {}, cn;
+function Gs() {
+  if (cn) return He;
+  cn = 1, Object.defineProperty(He, "__esModule", { value: !0 });
   function t(e) {
     function n(i) {
       if (i.key[0] !== e || i.key.length !== 1)
@@ -1859,12 +1875,12 @@ function Ds() {
       canAdd: o
     };
   }
-  return Re.makeConverter = t, Re;
+  return He.makeConverter = t, He;
 }
-var Fe = {}, an;
-function qs() {
-  if (an) return Fe;
-  an = 1, Object.defineProperty(Fe, "__esModule", { value: !0 });
+var Be = {}, an;
+function Xs() {
+  if (an) return Be;
+  an = 1, Object.defineProperty(Be, "__esModule", { value: !0 });
   function t(e) {
     function n(i) {
       if (i.key[0] !== e)
@@ -1894,20 +1910,20 @@ function qs() {
       canAdd: o
     };
   }
-  return Fe.makeConverter = t, Fe;
+  return Be.makeConverter = t, Be;
 }
 var un;
-function mt() {
+function It() {
   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 = {
+  const t = A(), e = vs(), n = ks(), r = As(), c = xs(), s = Cs(), o = Os(), i = Ps(), a = Ns(), u = Us(), f = Hs(), h = Bs(), g = Rs(), y = Fs(), p = Ks(), d = nr(), E = Ls(), b = Ms(), S = Ws(), w = Gs(), _ = Xs(), I = {
     unsignedTx: n,
     globalXpub: e,
     // pass an Array of key bytes that require pubkey beside the key
     checkPubkey: E.makeChecker([])
   };
   ie.globals = I;
-  const O = {
+  const P = {
     nonWitnessUtxo: s,
     partialSig: o,
     sighashType: a,
@@ -1937,9 +1953,9 @@ function mt() {
     tapInternalKey: w.makeConverter(
       t.InputTypes.TAP_INTERNAL_KEY
     ),
-    tapMerkleRoot: p
+    tapMerkleRoot: h
   };
-  ie.inputs = O;
+  ie.inputs = P;
   const m = {
     bip32Derivation: d.makeConverter(
       t.OutputTypes.BIP32_DERIVATION
@@ -1956,7 +1972,7 @@ function mt() {
     tapBip32Derivation: S.makeConverter(
       t.OutputTypes.TAP_BIP32_DERIVATION
     ),
-    tapTree: h,
+    tapTree: p,
     tapInternalKey: w.makeConverter(
       t.OutputTypes.TAP_INTERNAL_KEY
     )
@@ -1964,10 +1980,10 @@ function mt() {
   return ie.outputs = m, ie;
 }
 var fn;
-function Xs() {
+function Ds() {
   if (fn) return oe;
   fn = 1, Object.defineProperty(oe, "__esModule", { value: !0 });
-  const t = mt(), e = _t(), n = pe(), r = A();
+  const t = It(), e = mt(), n = fe(), r = A();
   function c(i, a) {
     let u = 0;
     function f() {
@@ -1976,7 +1992,7 @@ function Xs() {
       const k = i.slice(u, u + m);
       return u += m, k;
     }
-    function p() {
+    function h() {
       const m = i.readUInt32BE(u);
       return u += 4, m;
     }
@@ -1991,20 +2007,20 @@ function Xs() {
         value: k
       };
     }
-    function h() {
+    function p() {
       if (u >= i.length)
         throw new Error("Format Error: Unexpected End of PSBT");
       const m = i.readUInt8(u) === 0;
       return m && u++, m;
     }
-    if (p() !== 1886610036)
+    if (h() !== 1886610036)
       throw new Error("Format Error: Invalid Magic Number");
     if (g() !== 255)
       throw new Error(
         "Format Error: Magic Number must be followed by 0xff separator"
       );
     const d = [], E = {};
-    for (; !h(); ) {
+    for (; !p(); ) {
       const m = y(), k = m.key.toString("hex");
       if (E[k])
         throw new Error(
@@ -2017,35 +2033,35 @@ function Xs() {
     );
     if (b.length !== 1)
       throw new Error("Format Error: Only one UNSIGNED_TX allowed");
-    const S = a(b[0].value), { inputCount: w, outputCount: _ } = S.getInputOutputCounts(), I = [], O = [];
+    const S = a(b[0].value), { inputCount: w, outputCount: _ } = S.getInputOutputCounts(), I = [], P = [];
     for (const m of e.range(w)) {
-      const k = {}, H = [];
-      for (; !h(); ) {
+      const k = {}, U = [];
+      for (; !p(); ) {
         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 " + te
           );
-        k[te] = 1, H.push(B);
+        k[te] = 1, U.push(B);
       }
-      I.push(H);
+      I.push(U);
     }
     for (const m of e.range(_)) {
-      const k = {}, H = [];
-      for (; !h(); ) {
+      const k = {}, U = [];
+      for (; !p(); ) {
         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 " + te
           );
-        k[te] = 1, H.push(B);
+        k[te] = 1, U.push(B);
       }
-      O.push(H);
+      P.push(U);
     }
     return o(S, {
       globalMapKeyVals: d,
       inputKeyVals: I,
-      outputKeyVals: O
+      outputKeyVals: P
     });
   }
   oe.psbtFromBuffer = c;
@@ -2057,7 +2073,7 @@ function Xs() {
   }
   oe.checkKeyBuffer = s;
   function o(i, { globalMapKeyVals: a, inputKeyVals: u, outputKeyVals: f }) {
-    const p = {
+    const h = {
       unsignedTx: i
     };
     let g = 0;
@@ -2073,12 +2089,12 @@ function Xs() {
           g++;
           break;
         case r.GlobalTypes.GLOBAL_XPUB:
-          p.globalXpub === void 0 && (p.globalXpub = []), p.globalXpub.push(t.globals.globalXpub.decode(b));
+          h.globalXpub === void 0 && (h.globalXpub = []), h.globalXpub.push(t.globals.globalXpub.decode(b));
           break;
         default:
-          p.unknownKeyVals || (p.unknownKeyVals = []), p.unknownKeyVals.push(b);
+          h.unknownKeyVals || (h.unknownKeyVals = []), h.unknownKeyVals.push(b);
       }
-    const y = u.length, h = f.length, d = [], E = [];
+    const y = u.length, p = f.length, d = [], E = [];
     for (const b of e.range(y)) {
       const S = {};
       for (const w of u[b])
@@ -2198,7 +2214,7 @@ function Xs() {
         }
       d.push(S);
     }
-    for (const b of e.range(h)) {
+    for (const b of e.range(p)) {
       const S = {};
       for (const w of f[b])
         switch (t.outputs.checkPubkey(w), w.key[0]) {
@@ -2249,41 +2265,41 @@ function Xs() {
         }
       E.push(S);
     }
-    return { globalMap: p, inputs: d, outputs: E };
+    return { globalMap: h, inputs: d, outputs: E };
   }
   return oe.psbtFromKeyVals = o, oe;
 }
-var he = {}, pn;
-function Vs() {
-  if (pn) return he;
-  pn = 1, Object.defineProperty(he, "__esModule", { value: !0 });
-  const t = mt(), e = _t();
+var he = {}, hn;
+function qs() {
+  if (hn) return he;
+  hn = 1, Object.defineProperty(he, "__esModule", { value: !0 });
+  const t = It(), e = mt();
   function n({ globalMap: o, inputs: i, outputs: a }) {
-    const { globalKeyVals: u, inputKeyVals: f, outputKeyVals: p } = s({
+    const { globalKeyVals: u, inputKeyVals: f, outputKeyVals: h } = s({
       globalMap: o,
       inputs: i,
       outputs: a
-    }), 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);
+    }), g = e.keyValsToBuffer(u), y = (b) => b.length === 0 ? [l.from([0])] : b.map(e.keyValsToBuffer), p = y(f), d = y(h), E = l.allocUnsafe(5);
     return E.writeUIntBE(482972169471, 0, 5), l.concat(
-      [E, g].concat(h, d)
+      [E, g].concat(p, d)
     );
   }
   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]) => {
-      if (g === "unknownKeyVals") return p;
-      const h = i[g];
-      if (h === void 0) return p;
+    const a = /* @__PURE__ */ new Set(), u = Object.entries(o).reduce((h, [g, y]) => {
+      if (g === "unknownKeyVals") return h;
+      const p = i[g];
+      if (p === void 0) return h;
       const d = (Array.isArray(y) ? y : [y]).map(
-        h.encode
+        p.encode
       );
       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"))) : [];
+      }), h.concat(d);
+    }, []), f = o.unknownKeyVals ? o.unknownKeyVals.filter((h) => !a.has(h.key.toString("hex"))) : [];
     return u.concat(f).sort(r);
   }
   function s({ globalMap: o, inputs: i, outputs: a }) {
@@ -2295,30 +2311,30 @@ function Vs() {
   }
   return he.psbtToKeyVals = s, he;
 }
-var hn;
-function cr() {
-  return hn || (hn = 1, (function(t) {
+var pn;
+function rr() {
+  return pn || (pn = 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(Xs()), e(Vs());
-  })(ot)), ot;
+    Object.defineProperty(t, "__esModule", { value: !0 }), e(Ds()), e(qs());
+  })(st)), st;
 }
 var ln;
-function js() {
-  if (ln) return Oe;
-  ln = 1, Object.defineProperty(Oe, "__esModule", { value: !0 });
-  const t = cr();
+function Vs() {
+  if (ln) return xe;
+  ln = 1, Object.defineProperty(xe, "__esModule", { value: !0 });
+  const t = rr();
   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");
     const u = r(o);
     if (u === void 0)
       throw new Error("Combine: Self missing transaction");
-    const f = c(i.globalKeyVals), p = i.inputKeyVals.map(c), g = i.outputKeyVals.map(c);
+    const f = c(i.globalKeyVals), h = i.inputKeyVals.map(c), g = i.outputKeyVals.map(c);
     for (const y of a) {
-      const h = r(y);
-      if (h === void 0 || !h.toBuffer().equals(u.toBuffer()))
+      const p = r(y);
+      if (p === void 0 || !p.toBuffer().equals(u.toBuffer()))
         throw new Error(
           "Combine: One of the Psbts does not have the same transaction."
         );
@@ -2332,7 +2348,7 @@ function js() {
       ), d.inputKeyVals.map(c).forEach(
         (w, _) => w.forEach(
           n(
-            p[_],
+            h[_],
             i.inputKeyVals[_],
             d.inputKeyVals[_]
           )
@@ -2353,7 +2369,7 @@ function js() {
       outputKeyVals: i.outputKeyVals
     });
   }
-  Oe.combine = e;
+  xe.combine = e;
   function n(s, o, i) {
     return (a) => {
       if (s.has(a)) return;
@@ -2373,45 +2389,45 @@ function js() {
       o.add(a);
     }), o;
   }
-  return Oe;
+  return xe;
 }
-var ct = {}, dn;
-function ar() {
+var it = {}, dn;
+function sr() {
   return dn || (dn = 1, (function(t) {
     Object.defineProperty(t, "__esModule", { value: !0 });
-    const e = mt();
-    function n(y, h) {
-      const d = y[h];
-      if (d === void 0) throw new Error(`No input #${h}`);
+    const e = It();
+    function n(y, p) {
+      const d = y[p];
+      if (d === void 0) throw new Error(`No input #${p}`);
       return d;
     }
     t.checkForInput = n;
-    function r(y, h) {
-      const d = y[h];
-      if (d === void 0) throw new Error(`No output #${h}`);
+    function r(y, p) {
+      const d = y[p];
+      if (d === void 0) throw new Error(`No output #${p}`);
       return d;
     }
     t.checkForOutput = r;
-    function c(y, h, d) {
+    function c(y, p, d) {
       if (y.key[0] < d)
         throw new Error(
           "Use the method for your specific key instead of addUnknownKeyVal*"
         );
-      if (h && h.filter((E) => E.key.equals(y.key)).length !== 0)
+      if (p && p.filter((E) => E.key.equals(y.key)).length !== 0)
         throw new Error(`Duplicate Key: ${y.key.toString("hex")}`);
     }
     t.checkHasKey = c;
     function s(y) {
-      let h = 0;
+      let p = 0;
       return Object.keys(y).forEach((d) => {
-        Number(isNaN(Number(d))) && h++;
-      }), h;
+        Number(isNaN(Number(d))) && p++;
+      }), p;
     }
     t.getEnumLength = s;
-    function o(y, h) {
+    function o(y, p) {
       let d = !1;
-      if (h.nonWitnessUtxo || h.witnessUtxo) {
-        const E = !!h.redeemScript, b = !!h.witnessScript, S = !E || !!h.finalScriptSig, w = !b || !!h.finalScriptWitness, _ = !!h.finalScriptSig || !!h.finalScriptWitness;
+      if (p.nonWitnessUtxo || p.witnessUtxo) {
+        const E = !!p.redeemScript, b = !!p.witnessScript, S = !E || !!p.finalScriptSig, w = !b || !!p.finalScriptWitness, _ = !!p.finalScriptSig || !!p.finalScriptWitness;
         d = S && w && _;
       }
       if (d === !1)
@@ -2420,26 +2436,26 @@ function ar() {
         );
     }
     t.inputCheckUncleanFinalized = o;
-    function i(y, h, d, E) {
+    function i(y, p, d, E) {
       throw new Error(
-        `Data for ${y} key ${h} is incorrect: Expected ${d} and got ${JSON.stringify(E)}`
+        `Data for ${y} key ${p} is incorrect: Expected ${d} and got ${JSON.stringify(E)}`
       );
     }
     function a(y) {
-      return (h, d) => {
-        for (const E of Object.keys(h)) {
-          const b = h[E], { canAdd: S, canAddToArray: w, check: _, expected: I } = (
+      return (p, d) => {
+        for (const E of Object.keys(p)) {
+          const b = p[E], { canAdd: S, canAddToArray: w, check: _, expected: I } = (
             // @ts-ignore
             e[y + "s"][E] || {}
-          ), O = !!w;
+          ), P = !!w;
           if (_)
-            if (O) {
+            if (P) {
               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)))
+              if (!b.every((U) => w(m, U, k)))
                 throw new Error("Can not add duplicate data to array");
               d[E] = m.concat(b);
             } else {
@@ -2451,35 +2467,35 @@ function ar() {
       };
     }
     t.updateGlobal = a("global"), t.updateInput = a("input"), t.updateOutput = a("output");
-    function u(y, h) {
+    function u(y, p) {
       const d = y.length - 1, E = n(y, d);
-      t.updateInput(h, E);
+      t.updateInput(p, E);
     }
     t.addInputAttributes = u;
-    function f(y, h) {
+    function f(y, p) {
       const d = y.length - 1, E = r(y, d);
-      t.updateOutput(h, E);
+      t.updateOutput(p, E);
     }
     t.addOutputAttributes = f;
-    function p(y, h) {
-      if (!l.isBuffer(h) || h.length < 4)
+    function h(y, p) {
+      if (!l.isBuffer(p) || p.length < 4)
         throw new Error("Set Version: Invalid Transaction");
-      return h.writeUInt32LE(y, 0), h;
+      return p.writeUInt32LE(y, 0), p;
     }
-    t.defaultVersionSetter = p;
-    function g(y, h) {
-      if (!l.isBuffer(h) || h.length < 4)
+    t.defaultVersionSetter = h;
+    function g(y, p) {
+      if (!l.isBuffer(p) || p.length < 4)
         throw new Error("Set Locktime: Invalid Transaction");
-      return h.writeUInt32LE(y, h.length - 4), h;
+      return p.writeUInt32LE(y, p.length - 4), p;
     }
     t.defaultLocktimeSetter = g;
-  })(ct)), ct;
+  })(it)), it;
 }
 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();
+function js() {
+  if (gn) return Ae;
+  gn = 1, Object.defineProperty(Ae, "__esModule", { value: !0 });
+  const t = Vs(), e = rr(), n = A(), r = sr();
   class c {
     constructor(o) {
       this.inputs = [], this.outputs = [], this.globalMap = {
@@ -2584,9 +2600,9 @@ function zs() {
       return this.globalMap.unsignedTx.toBuffer();
     }
   }
-  return Ce.Psbt = c, Ce;
+  return Ae.Psbt = c, Ae;
 }
-var yn = zs(), gt = pe(), x = ar();
+var yn = js(), dt = fe(), x = sr();
 function ee(t) {
   return (e) => {
     try {
@@ -2596,17 +2612,17 @@ function ee(t) {
     }
   };
 }
-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
+const zs = ee(De), Ys = ee(Pn), $s = ee(we), $e = ee(Xe), Sn = ee(be), or = ee(Ee), vt = ee(Te), Xo = ee(On), Do = (t) => t.length === 4 && t[0] === 81 && // OP_1
 t[1] === 2 && // push 2 bytes
 t[2] === 78 && t[3] === 115;
-function Se(t) {
+function ye(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);
+    const i = e.length, a = dt.encodingLength(o);
+    e = l.concat([e, l.allocUnsafe(a)]), dt.encode(o, e, i);
   }
   function c(o) {
     r(o.length), n(o);
@@ -2616,23 +2632,23 @@ function Se(t) {
   }
   return s(t), e;
 }
-function fr(t, e) {
-  const n = fe(e);
+function ir(t, e) {
+  const n = ue(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;
+  const r = et(t), c = ge(t), s = _s(t), o = s?.hybrid ? et(s.hybrid) : void 0, i = s?.uncompressed ? et(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)))
+    if (ke(a, t) || ke(a, c) || a.equals(r) || s && (ke(a, s.uncompressed) || ke(a, s.hybrid) || o && a.equals(o) || i && a.equals(i)))
       return !0;
   });
 }
-function Qe(t, e) {
-  return fr(t, e) !== -1;
+function Ze(t, e) {
+  return ir(t, e) !== -1;
 }
-function Js(t, e) {
-  return Qs(t).some((r) => pr(r, ge.decode, e));
+function Zs(t, e) {
+  return Js(t).some((r) => cr(r, de.decode, e));
 }
-function pr(t, e, n) {
+function cr(t, e, n) {
   const { hashType: r } = e(t), c = [];
   switch (r & v.SIGHASH_ANYONECANPAY && c.push("addInput"), r & 31) {
     case v.SIGHASH_ALL:
@@ -2644,210 +2660,210 @@ function pr(t, e, n) {
   }
   return c.indexOf(n) === -1;
 }
-function Qs(t) {
+function Js(t) {
   const { partialSig: e } = t;
   let n;
   if (!e || e.length === 0) {
     if (!t.finalScriptSig && !t.finalScriptWitness) return [];
-    n = eo(t);
+    n = Qs(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 Qs(t) {
+  const e = t.finalScriptSig ? ue(t.finalScriptSig) || [] : [], n = t.finalScriptWitness ? ue(t.finalScriptWitness) || [] : [];
+  return e.concat(n).filter((r) => l.isBuffer(r) && Un(r)).map((r) => ({ signature: r }));
 }
 function wn(t, e, n) {
-  const r = go(e, t, n);
+  const r = lo(e, t, n);
   try {
     const s = ho(e, r).concat(r.script).concat(r.controlBlock);
-    return { finalScriptWitness: Se(s) };
+    return { finalScriptWitness: ye(s) };
   } catch (c) {
     throw new Error(`Can not finalize taproot input #${t}: ${c}`);
   }
 }
-function Ke(t, e) {
+function Re(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));
+  return t && !!(t.tapInternalKey || t.tapMerkleRoot || t.tapLeafScript && t.tapLeafScript.length || t.tapBip32Derivation && t.tapBip32Derivation.length || t.witnessUtxo && vt(t.witnessUtxo.script));
 }
-function at(t, e) {
-  return t && !!(t.tapInternalKey || t.tapTree || t.tapBip32Derivation && t.tapBip32Derivation.length || e && It(e));
+function ct(t, e) {
+  return t && !!(t.tapInternalKey || t.tapTree || t.tapBip32Derivation && t.tapBip32Derivation.length || e && vt(e));
 }
 function En(t, e, n) {
-  uo(t, e, n), po(t, e, n);
+  ao(t, e, n), fo(t, e, n);
 }
 function bn(t, e, n) {
-  fo(t, e, n), to(t, e);
+  uo(t, e, n), eo(t, e);
 }
-function to(t, e) {
+function eo(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);
+    const c = t.script, s = to(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({
+function to(t, e) {
+  const n = e && no(e.leaves), { output: r } = Te({
     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);
+function qo(t, e) {
+  const n = e.tapInternalKey, r = n && Tr(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))
+function Vo(t) {
+  if (!Pr(t))
     throw new Error("Cannot convert taptree to tapleaf list. Expecting a tapree structure.");
-  return yt(t);
+  return gt(t);
 }
-function ro(t = []) {
+function no(t = []) {
   return t.length === 1 && t[0].depth === 0 ? {
     output: t[0].script,
     version: t[0].leafVersion
-  } : ao(t);
+  } : co(t);
 }
-function so(t, e) {
-  return io(t).some((r) => pr(r, oo, e));
+function ro(t, e) {
+  return oo(t).some((r) => cr(r, so, e));
 }
-function oo(t) {
+function so(t) {
   return {
     signature: t.subarray(0, 64),
     hashType: t.subarray(64)[0] || v.SIGHASH_DEFAULT
   };
 }
-function io(t) {
+function oo(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);
+    const n = io(t.finalScriptWitness);
     n && e.push(n);
   }
   return e;
 }
-function co(t) {
+function io(t) {
   if (!t) return;
   const e = t.subarray(2);
   if (e.length === 64 || e.length === 65) return e;
 }
-function yt(t, e = [], n = 0) {
+function gt(t, e = [], n = 0) {
   if (n > Nn) throw new Error("Max taptree depth exceeded.");
-  return t ? Un(t) ? (e.push({
+  return t ? Hn(t) ? (e.push({
     depth: n,
-    leafVersion: t.version || kr,
+    leafVersion: t.version || _r,
     script: t.output
-  }), e) : (t[0] && yt(t[0], e, n + 1), t[1] && yt(t[1], e, n + 1), e) : [];
+  }), e) : (t[0] && gt(t[0], e, n + 1), t[1] && gt(t[1], e, n + 1), e) : [];
 }
-function ao(t) {
+function co(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");
+    if (e = yt(n, e), !e) throw new Error("No room left to insert tapleaf in tree");
   return e;
 }
-function St(t, e, n = 0) {
+function yt(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 (Hn(e)) return;
+  const r = yt(t, e && e[0], n + 1);
   if (r) return [r, e && e[1]];
-  const c = St(t, e && e[1], n + 1);
+  const c = yt(t, e && e[1], n + 1);
   if (c) return [e && e[0], c];
 }
-function uo(t, e, n) {
-  const r = N(t) && ue(e), c = ue(t) && N(e), s = t === e && N(e) && ue(e);
+function ao(t, e, n) {
+  const r = N(t) && ae(e), c = ae(t) && N(e), s = t === e && N(e) && ae(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);
+function uo(t, e, n) {
+  const r = ct(t) && ae(e), c = ae(t) && ct(e), s = t === e && ct(e) && ae(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) {
+function fo(t, e, n) {
   if (e.tapMerkleRoot) {
     const r = (e.tapLeafScript || []).every(
-      (s) => ut(s, e.tapMerkleRoot)
+      (s) => at(s, e.tapMerkleRoot)
     ), c = (t.tapLeafScript || []).every(
-      (s) => ut(s, e.tapMerkleRoot)
+      (s) => at(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)
+    (c) => at(c, t.tapMerkleRoot)
   ))
     throw new Error(`Invalid arguments for Psbt.${n}. Tapleaf not part of taptree.`);
 }
-function ut(t, e) {
+function at(t, e) {
   if (!e) return !0;
-  const n = ze({
+  const n = qe({
     output: t.script,
     version: t.leafVersion
   });
-  return Ar(t.controlBlock, n).equals(e);
+  return mr(t.controlBlock, n).equals(e);
 }
 function ho(t, e) {
-  const n = ze({
+  const n = qe({
     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);
+  return (t.tapScriptSig || []).filter((r) => r.leafHash.equals(n)).map((r) => po(e.script, r)).sort((r, c) => c.positionInScript - r.positionInScript).map((r) => r.signature);
 }
-function lo(t, e) {
+function po(t, e) {
   return Object.assign(
     {
-      positionInScript: fr(e.pubkey, t)
+      positionInScript: ir(e.pubkey, t)
     },
     e
   );
 }
-function go(t, e, n) {
+function lo(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));
+  const c = (t.tapLeafScript || []).sort((s, o) => s.controlBlock.length - o.controlBlock.length).find((s) => go(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({
+function go(t, e, n) {
+  const r = qe({
     output: t.script,
     version: t.leafVersion
   });
   return (!n || n.equals(r)) && e.find((s) => s.leafHash.equals(r)) !== void 0;
 }
-function ue(t) {
+function ae(t) {
   return t && !!(t.redeemScript || t.witnessScript || t.bip32Derivation && t.bip32Derivation.length);
 }
-const Tn = gt.decode, So = {
+const Tn = dt.decode, yo = {
   /**
    * 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: Ye,
+  network: Ve,
   /**
    * When extractTransaction is called, the fee rate is checked.
    * THIS IS NOT TO BE RELIED ON.
@@ -2856,9 +2872,9 @@ const Tn = gt.decode, So = {
   maximumFeeRate: 5e3
   // satoshi per byte
 };
-class wt {
-  constructor(e = {}, n = new yn.Psbt(new hr())) {
-    this.data = n, this.opts = Object.assign({}, So, e), this.__CACHE = {
+class St {
+  constructor(e = {}, n = new yn.Psbt(new ar())) {
+    this.data = n, this.opts = Object.assign({}, yo, e), this.__CACHE = {
       __NON_WITNESS_UTXO_TX_CACHE: [],
       __NON_WITNESS_UTXO_BUF_CACHE: [],
       __TX_IN_CACHE: {},
@@ -2891,7 +2907,7 @@ class wt {
   }
   get txInputs() {
     return this.__CACHE.__TX.ins.map((e) => ({
-      hash: kt(e.hash),
+      hash: At(e.hash),
       index: e.index,
       sequence: e.sequence
     }));
@@ -2900,11 +2916,11 @@ class wt {
     return this.__CACHE.__TX.outs.map((e) => {
       let n;
       try {
-        n = sr(e.script, this.opts.network);
+        n = er(e.script, this.opts.network);
       } catch {
       }
       return {
-        script: kt(e.script),
+        script: At(e.script),
         value: e.value,
         address: n
       };
@@ -2919,21 +2935,21 @@ class wt {
     return this.fromBuffer(r, n);
   }
   static fromBuffer(e, n = {}) {
-    const r = yn.Psbt.fromBuffer(e, wo), c = new wt(n, r);
-    return mo(c.__CACHE.__TX, c.__CACHE), c;
+    const r = yn.Psbt.fromBuffer(e, So), c = new St(n, r);
+    return _o(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 wt.fromBuffer(this.data.toBuffer(), e);
+    return St.fromBuffer(this.data.toBuffer(), e);
   }
   setMaximumFeeRate(e) {
-    Le(e), this.opts.maximumFeeRate = e;
+    Fe(e), this.opts.maximumFeeRate = e;
   }
   setVersion(e) {
-    Le(e), le(this.data.inputs, "setVersion");
+    Fe(e), pe(this.data.inputs, "setVersion");
     const n = this.__CACHE;
     return n.__TX.version = e, n.__EXTRACTED_TX = void 0, this;
   }
@@ -2941,12 +2957,12 @@ class wt {
     return this.setVersion(v.TRUC_VERSION);
   }
   setLocktime(e) {
-    Le(e), le(this.data.inputs, "setLocktime");
+    Fe(e), pe(this.data.inputs, "setLocktime");
     const n = this.__CACHE;
     return n.__TX.locktime = e, n.__EXTRACTED_TX = void 0, this;
   }
   setInputSequence(e, n) {
-    Le(n), le(this.data.inputs, "setInputSequence");
+    Fe(n), pe(this.data.inputs, "setInputSequence");
     const r = this.__CACHE;
     if (r.__TX.ins.length <= e)
       throw new Error("Input index too high");
@@ -2960,13 +2976,13 @@ class wt {
       throw new Error(
         "Invalid arguments for Psbt.addInput. Requires single object with at least [hash] and [index]"
       );
-    En(e, e, "addInput"), n && le(this.data.inputs, "addInput"), e.witnessScript && Xe(e.witnessScript);
+    En(e, e, "addInput"), n && pe(this.data.inputs, "addInput"), e.witnessScript && Ge(e.witnessScript);
     const r = this.__CACHE;
     this.data.addInput(e);
     const c = r.__TX.ins[r.__TX.ins.length - 1];
-    gr(r, c);
+    hr(r, c);
     const s = this.data.inputs.length - 1, o = this.data.inputs[s];
-    return o.nonWitnessUtxo && bt(this.__CACHE, o, s), r.__FEE = void 0, r.__FEE_RATE = void 0, r.__EXTRACTED_TX = void 0, this;
+    return o.nonWitnessUtxo && Et(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;
@@ -2977,8 +2993,8 @@ class wt {
       throw new Error(
         "Invalid arguments for Psbt.addOutput. Requires single object with at least [script or address] and [value]"
       );
-    if (le(this.data.inputs, "addOutput"), n) {
-      const { address: s } = e, { network: o } = this.opts, i = or(s, o);
+    if (pe(this.data.inputs, "addOutput"), n) {
+      const { address: s } = e, { network: o } = this.opts, i = tr(s, o);
       e = Object.assign({}, e, { script: i });
     }
     bn(e, e, "addOutput");
@@ -2986,11 +3002,11 @@ class wt {
     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(lr)) throw new Error("Not finalized");
+    if (n && (this.data.inputs = this.data.inputs.filter((s) => !s.partialSig)), !this.data.inputs.every(ur)) throw new Error("Not finalized");
     const r = this.__CACHE;
-    if (e || bo(this, r, this.opts), r.__EXTRACTED_TX) return r.__EXTRACTED_TX;
+    if (e || Eo(this, r, this.opts), r.__EXTRACTED_TX) return r.__EXTRACTED_TX;
     const c = r.__TX.clone();
-    return Tr(this.data.inputs, c, r, !0, n), c;
+    return Sr(this.data.inputs, c, r, !0, n), c;
   }
   getFeeRate(e = !1) {
     return kn(
@@ -3005,7 +3021,7 @@ class wt {
     return kn("__FEE", "fee", this.data.inputs, this.__CACHE, e);
   }
   finalizeAllInputs() {
-    return x.checkForInput(this.data.inputs, 0), de(this.data.inputs.length).forEach((e) => this.finalizeInput(e)), this;
+    return x.checkForInput(this.data.inputs, 0), le(this.data.inputs.length).forEach((e) => this.finalizeInput(e)), this;
   }
   finalizeInput(e, n, r) {
     const c = x.checkForInput(this.data.inputs, e);
@@ -3033,18 +3049,18 @@ class wt {
     throw new Error(`Cannot finalize input #${e}. Not Taproot.`);
   }
   getInputType(e) {
-    const n = x.checkForInput(this.data.inputs, e), r = _r(e, n, this.__CACHE), c = tt(
+    const n = x.checkForInput(this.data.inputs, e), r = wr(e, n, this.__CACHE), c = Qe(
       r,
       e,
       "input",
-      n.redeemScript || Ho(n.finalScriptSig),
+      n.redeemScript || No(n.finalScriptSig),
       n.witnessScript || Uo(n.finalScriptWitness)
-    ), s = c.type === "raw" ? "" : c.type + "-", o = Ir(c.meaningfulScript);
+    ), s = c.type === "raw" ? "" : c.type + "-", o = br(c.meaningfulScript);
     return s + o;
   }
   inputHasPubkey(e, n) {
     const r = x.checkForInput(this.data.inputs, e);
-    return Po(n, r, e, this.__CACHE);
+    return Oo(n, r, e, this.__CACHE);
   }
   inputHasHDKey(e, n) {
     const r = x.checkForInput(this.data.inputs, e), c = mn(n);
@@ -3052,14 +3068,14 @@ class wt {
   }
   outputHasPubkey(e, n) {
     const r = x.checkForOutput(this.data.outputs, e);
-    return No(n, r, e, this.__CACHE);
+    return Po(n, r, e, this.__CACHE);
   }
   outputHasHDKey(e, 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), de(this.data.inputs.length).map(
+    return x.checkForInput(this.data.inputs, 0), le(this.data.inputs.length).map(
       (r) => this.validateSignaturesOfInput(r, e)
     ).reduce((r, c) => c && r, !0);
   }
@@ -3071,7 +3087,7 @@ class wt {
     if (!e || !e.publicKey || !e.fingerprint)
       throw new Error("Need HDSigner to sign input");
     const r = [];
-    for (const c of de(this.data.inputs.length))
+    for (const c of le(this.data.inputs.length))
       try {
         this.signInputHD(c, e, n), r.push(!0);
       } catch {
@@ -3086,7 +3102,7 @@ class wt {
       if (!e || !e.publicKey || !e.fingerprint)
         return c(new Error("Need HDSigner to sign input"));
       const s = [], o = [];
-      for (const i of de(this.data.inputs.length))
+      for (const i of le(this.data.inputs.length))
         o.push(
           this.signInputHDAsync(i, e, n).then(
             () => {
@@ -3124,7 +3140,7 @@ class wt {
   signAllInputs(e, n) {
     if (!e || !e.publicKey) throw new Error("Need Signer to sign input");
     const r = [];
-    for (const c of de(this.data.inputs.length))
+    for (const c of le(this.data.inputs.length))
       try {
         this.signInput(c, e, n), r.push(!0);
       } catch {
@@ -3206,19 +3222,19 @@ class wt {
     });
   }
   toBuffer() {
-    return ft(this.__CACHE), this.data.toBuffer();
+    return ut(this.__CACHE), this.data.toBuffer();
   }
   toHex() {
-    return ft(this.__CACHE), this.data.toHex();
+    return ut(this.__CACHE), this.data.toHex();
   }
   toBase64() {
-    return ft(this.__CACHE), this.data.toBase64();
+    return ut(this.__CACHE), this.data.toBase64();
   }
   updateGlobal(e) {
     return this.data.updateGlobal(e), this;
   }
   updateInput(e, n) {
-    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;
+    return n.witnessScript && Ge(n.witnessScript), En(this.data.inputs[e], n, "updateInput"), this.data.updateInput(e, n), n.nonWitnessUtxo && Et(this.__CACHE, this.data.inputs[e], e), this;
   }
   updateOutput(e, n) {
     const r = this.data.outputs[e];
@@ -3239,7 +3255,7 @@ class wt {
   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 = Et(
+    const o = l.isBuffer(r.publicKey) ? r.publicKey : l.from(r.publicKey), i = wt(
       e,
       n,
       this.data.inputs,
@@ -3254,14 +3270,14 @@ class wt {
       );
     return i;
   }
-  _finalizeInput(e, n, r = Io, c = !0) {
-    const { script: s, isP2SH: o, isP2WSH: i, isSegwit: a } = xo(
+  _finalizeInput(e, n, r = mo, c = !0) {
+    const { script: s, isP2SH: o, isP2WSH: i, isSegwit: a } = Ao(
       e,
       n,
       this.__CACHE
     );
     if (!s) throw new Error(`No script found for input #${e}`);
-    To(n);
+    bo(n);
     const { finalScriptSig: u, finalScriptWitness: f } = r(
       e,
       n,
@@ -3279,12 +3295,12 @@ class wt {
     if (!n.witnessUtxo)
       throw new Error(`Cannot finalize input #${e}. Missing witness utxo.`);
     if (n.tapKeySig) {
-      const s = _e({
+      const s = Te({
         output: n.witnessUtxo.script,
         signature: n.tapKeySig
       });
       if (!s.witness) throw new Error("Cannot finalize taproot key spend");
-      const o = Se(s.witness);
+      const o = ye(s.witness);
       this.data.updateInput(e, { finalScriptWitness: o });
     } else {
       const { finalScriptWitness: s } = c(
@@ -3302,12 +3318,12 @@ class wt {
       throw new Error("No signatures to validate");
     if (typeof n != "function")
       throw new Error("Need validator function to validate signatures");
-    const o = r ? s.filter((p) => p.pubkey.equals(r)) : s;
+    const o = r ? s.filter((h) => h.pubkey.equals(r)) : s;
     if (o.length < 1) throw new Error("No signatures for this pubkey");
     const i = [];
     let a, u, f;
-    for (const p of o) {
-      const g = ge.decode(p.signature), { hash: y, script: h } = f !== g.hashType || !a || !u ? Sr(
+    for (const h of o) {
+      const g = de.decode(h.signature), { hash: y, script: p } = f !== g.hashType || !a || !u ? lr(
         e,
         Object.assign({}, c, {
           sighashType: g.hashType
@@ -3315,9 +3331,9 @@ class wt {
         this.__CACHE,
         !0
       ) : { hash: a, script: u };
-      f = g.hashType, a = y, u = h, dr(p.pubkey, h, "verify"), i.push(n(p.pubkey, y, g.signature));
+      f = g.hashType, a = y, u = p, fr(h.pubkey, p, "verify"), i.push(n(h.pubkey, y, g.signature));
     }
-    return i.every((p) => p);
+    return i.every((h) => h);
   }
   validateSignaturesOfTaprootInput(e, n, r) {
     const c = this.data.inputs[e], s = (c || {}).tapKeySig, o = (c || {}).tapScriptSig;
@@ -3325,8 +3341,8 @@ class wt {
       throw new Error("No signatures to validate");
     if (typeof n != "function")
       throw new Error("Need validator function to validate signatures");
-    r = r && ye(r);
-    const i = r ? Et(e, c, this.data.inputs, r, this.__CACHE) : ko(e, c, this.data.inputs, this.__CACHE);
+    r = r && ge(r);
+    const i = r ? wt(e, c, this.data.inputs, r, this.__CACHE) : vo(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;
@@ -3340,11 +3356,11 @@ class wt {
     }
     if (o)
       for (const f of o) {
-        const p = i.find((g) => f.pubkey.equals(g.pubkey));
-        if (p) {
+        const h = i.find((g) => f.pubkey.equals(g.pubkey));
+        if (h) {
           if (!n(
             f.pubkey,
-            p.hash,
+            h.hash,
             xn(f.signature)
           )) return !1;
           u++;
@@ -3362,7 +3378,7 @@ class wt {
     ), i = n.sign(s), a = [
       {
         pubkey: c,
-        signature: ge.encode(
+        signature: de.encode(
           l.isBuffer(i) ? i : l.from(i),
           o
         )
@@ -3378,18 +3394,18 @@ class wt {
       c,
       s
     ), a = r.signSchnorr.bind(r), u = (g) => l.isBuffer(g) ? g : l.from(g), f = i.filter((g) => !g.leafHash).map(
-      (g) => Ke(u(a(g.hash)), n.sighashType)
-    )[0], p = i.filter((g) => !!g.leafHash).map(
+      (g) => Re(u(a(g.hash)), n.sighashType)
+    )[0], h = i.filter((g) => !!g.leafHash).map(
       (g) => ({
-        pubkey: ye(o),
-        signature: Ke(
+        pubkey: ge(o),
+        signature: Re(
           u(a(g.hash)),
           n.sighashType
         ),
         leafHash: g.leafHash
       })
     );
-    return f && this.data.updateInput(e, { tapKeySig: f }), p.length && this.data.updateInput(e, { tapScriptSig: p }), this;
+    return f && this.data.updateInput(e, { tapKeySig: f }), h.length && this.data.updateInput(e, { tapScriptSig: h }), this;
   }
   _signInputAsync(e, n, r = [v.SIGHASH_ALL]) {
     const c = l.isBuffer(n.publicKey) ? n.publicKey : l.from(n.publicKey), { hash: s, sighashType: o } = An(
@@ -3403,7 +3419,7 @@ class wt {
       const a = l.isBuffer(i) ? i : l.from(i), u = [
         {
           pubkey: c,
-          signature: ge.encode(a, o)
+          signature: de.encode(a, o)
         }
       ];
       this.data.updateInput(e, { partialSig: u });
@@ -3416,21 +3432,21 @@ class wt {
       r,
       c,
       s
-    ), 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: Ke(u(d), n.sighashType)
+    ), a = r.signSchnorr.bind(r), u = (p) => l.isBuffer(p) ? p : l.from(p), f = [], h = i.filter((p) => !p.leafHash)[0];
+    if (h) {
+      const p = Promise.resolve(a(h.hash)).then((d) => ({
+        tapKeySig: Re(u(d), n.sighashType)
       }));
-      f.push(h);
+      f.push(p);
     }
-    const g = i.filter((h) => !!h.leafHash);
+    const g = i.filter((p) => !!p.leafHash);
     if (g.length) {
-      const h = g.map(async (d) => {
+      const p = g.map(async (d) => {
         const E = await a(d.hash);
         return { tapScriptSig: [
           {
-            pubkey: ye(o),
-            signature: Ke(
+            pubkey: ge(o),
+            signature: Re(
               u(E),
               n.sighashType
             ),
@@ -3438,17 +3454,17 @@ class wt {
           }
         ] };
       });
-      f.push(...h);
+      f.push(...p);
     }
     const y = await Promise.all(f);
-    for (const h of y)
-      this.data.updateInput(e, h);
+    for (const p of y)
+      this.data.updateInput(e, p);
   }
 }
-const wo = (t) => new hr(t);
-class hr {
+const So = (t) => new ar(t);
+class ar {
   constructor(e = l.from([2, 0, 0, 0, 0, 0, 0, 0, 0, 0])) {
-    this.tx = v.fromBuffer(e), _o(this.tx), Object.defineProperty(this, "tx", {
+    this.tx = v.fromBuffer(e), To(this.tx), Object.defineProperty(this, "tx", {
       enumerable: !1,
       writable: !0
     });
@@ -3474,14 +3490,14 @@ class hr {
     return this.tx.toBuffer();
   }
 }
-function Eo(t, e, n) {
+function wo(t, e, n) {
   switch (n) {
     case "pubkey":
     case "pubkeyhash":
     case "witnesspubkeyhash":
       return _n(1, t.partialSig);
     case "multisig": {
-      const r = je({
+      const r = De({
         output: e
       });
       return _n(r.m, t.partialSig, r.pubkeys);
@@ -3492,7 +3508,7 @@ function Eo(t, e, n) {
       return !1;
   }
 }
-function ft(t) {
+function ut(t) {
   if (t.__UNSAFE_SIGN_NONSEGWIT)
     throw new Error("Not BIP174 compliant, can not export");
 }
@@ -3500,12 +3516,12 @@ function _n(t, e, n) {
   if (!e) return !1;
   let r;
   if (n ? r = n.map((c) => {
-    const s = Bo(c);
+    const s = Ho(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 lr(t) {
+function ur(t) {
   return !!t.finalScriptSig || !!t.finalScriptWitness;
 }
 function mn(t) {
@@ -3516,52 +3532,52 @@ function mn(t) {
     return !!(l.isBuffer(r) ? r : l.from(r)).equals(e.pubkey);
   };
 }
-function Le(t) {
+function Fe(t) {
   if (typeof t != "number" || t !== Math.floor(t) || t > 4294967295 || t < 0)
     throw new Error("Invalid 32 bit integer");
 }
-function bo(t, e, n) {
+function Eo(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 le(t, e) {
+function pe(t, e) {
   t.forEach((n) => {
-    if (N(n) ? so(n, e) : Js(n, e)) throw new Error("Can not modify transaction, signatures exist.");
+    if (N(n) ? ro(n, e) : Zs(n, e)) throw new Error("Can not modify transaction, signatures exist.");
   });
 }
-function To(t) {
+function bo(t) {
   if (!t.sighashType || !t.partialSig) return;
   const { partialSig: e, sighashType: n } = t;
   e.forEach((r) => {
-    const { hashType: c } = ge.decode(r.signature);
+    const { hashType: c } = de.decode(r.signature);
     if (n !== c)
       throw new Error("Signature sighash does not match input sighash type");
   });
 }
-function dr(t, e, n) {
-  if (!Qe(t, e))
+function fr(t, e, n) {
+  if (!Ze(t, e))
     throw new Error(`Can not ${n} for this input with the key ${t.toString("hex")}`);
 }
-function _o(t) {
+function To(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 mo(t, e) {
+function _o(t, e) {
   t.ins.forEach((n) => {
-    gr(e, n);
+    hr(e, n);
   });
 }
-function gr(t, e) {
+function hr(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 yr(t, e) {
+function pr(t, e) {
   return (n, r, c, s) => {
     const o = t({
       redeem: { output: c }
@@ -3572,22 +3588,22 @@ function yr(t, e) {
       );
   };
 }
-const In = yr(be, "Redeem script"), vn = yr(Te, "Witness script");
+const In = pr(Ee, "Redeem script"), vn = pr(be, "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 (!n.every(ur)) 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(), Tr(n, s, r, o, c);
+  r.__EXTRACTED_TX ? (s = r.__EXTRACTED_TX, o = !1) : s = r.__TX.clone(), Sr(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 Io(t, e, n, r, c, s, o = !0, i) {
-  const a = Ir(n);
-  if (!Eo(e, n, a) && o)
+function mo(t, e, n, r, c, s, o = !0, i) {
+  const a = br(n);
+  if (!wo(e, n, a) && o)
     throw new Error(`Can not finalize input #${t}`);
-  return vo(
+  return Io(
     n,
     a,
     e.partialSig,
@@ -3597,44 +3613,44 @@ function Io(t, e, n, r, c, s, o = !0, i) {
     i
   );
 }
-function vo(t, e, n, r, c, s, o) {
+function Io(t, e, n, r, c, s, o) {
   let i, a;
-  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]), {
+  const u = ko(t, e, n), f = s ? be({ redeem: u }) : null, h = c ? Ee({ redeem: f || u }) : null;
+  return r ? (f ? a = ye(f.witness) : u ? a = ye(u.witness) : a = ye(o ?? [l.from([0])]), h && (i = h?.input)) : h ? i = h?.input : u ? i = u.input : i = Array.isArray(o) && o[0] ? o[0] : l.from([1]), {
     finalScriptSig: i,
     finalScriptWitness: a
   };
 }
 function An(t, e, n, r, c) {
-  const s = x.checkForInput(t, e), { hash: o, sighashType: i, script: a } = Sr(
+  const s = x.checkForInput(t, e), { hash: o, sighashType: i, script: a } = lr(
     e,
     s,
     r,
     !1,
     c
   );
-  return dr(n, a, "sign"), {
+  return fr(n, a, "sign"), {
     hash: o,
     sighashType: i
   };
 }
-function Sr(t, e, n, r, c) {
+function lr(t, e, n, r, c) {
   const s = n.__TX, o = e.sighashType || v.SIGHASH_ALL;
-  Er(o, c);
+  gr(o, c);
   let i, a;
   if (e.nonWitnessUtxo) {
-    const p = et(n, e, t), g = s.ins[t].hash, y = p.getHash();
+    const h = Je(n, e, t), g = s.ins[t].hash, y = h.getHash();
     if (!g.equals(y))
       throw new Error(
         `Non-witness UTXO hash for input #${t} doesn't match the hash specified in the prevout`
       );
-    const h = s.ins[t].index;
-    a = p.outs[h];
+    const p = s.ins[t].index;
+    a = h.outs[p];
   } else if (e.witnessUtxo)
     a = e.witnessUtxo;
   else
     throw new Error("Need a Utxo input item for signing");
-  const { meaningfulScript: u, type: f } = tt(
+  const { meaningfulScript: u, type: f } = Qe(
     a.script,
     t,
     "input",
@@ -3648,11 +3664,11 @@ function Sr(t, e, n, r, c) {
       a.value,
       o
     );
-  else if (Je(u)) {
-    const p = Ee({
+  else if ($e(u)) {
+    const h = we({
       hash: u.subarray(2)
     }).output;
-    i = s.hashForWitnessV0(t, p, a.value, o);
+    i = s.hashForWitnessV0(t, h, a.value, o);
   } else {
     if (e.nonWitnessUtxo === void 0 && !n.__UNSAFE_SIGN_NONSEGWIT)
       throw new Error(
@@ -3671,10 +3687,10 @@ PROCEED WITH CAUTION!
     hash: i
   };
 }
-function ko(t, e, n, r) {
+function vo(t, e, n, r) {
   const c = [];
   if (e.tapInternalKey) {
-    const o = wr(t, e, r);
+    const o = dr(t, e, r);
     o && c.push(o);
   }
   if (e.tapScriptSig) {
@@ -3682,70 +3698,70 @@ function ko(t, e, n, r) {
     c.push(...o);
   }
   return c.map(
-    (o) => Et(t, e, n, o, r)
+    (o) => wt(t, e, n, o, r)
   ).flat();
 }
-function wr(t, e, n) {
-  const { script: r } = vt(t, e, n);
-  return It(r) ? l.from(r.subarray(2, 34)) : null;
+function dr(t, e, n) {
+  const { script: r } = kt(t, e, n);
+  return vt(r) ? l.from(r.subarray(2, 34)) : null;
 }
 function xn(t) {
   return t.length === 64 ? t : l.from(t.subarray(0, 64));
 }
-function Et(t, e, n, r, c, s, o) {
+function wt(t, e, n, r, c, s, o) {
   const i = c.__TX, a = e.sighashType || v.SIGHASH_DEFAULT;
-  Er(a, o);
+  gr(a, o);
   const u = n.map(
-    (h, d) => vt(d, h, c)
-  ), f = u.map((h) => h.script), p = u.map((h) => h.value), g = [];
+    (p, d) => kt(d, p, c)
+  ), f = u.map((p) => p.script), h = u.map((p) => p.value), g = [];
   if (e.tapInternalKey && !s) {
-    const h = wr(t, e, c) || l.from([]);
-    if (ye(r).equals(h)) {
+    const p = dr(t, e, c) || l.from([]);
+    if (ge(r).equals(p)) {
       const d = i.hashForWitnessV1(
         t,
         f,
-        p,
+        h,
         a
       );
       g.push({ pubkey: r, hash: d });
     }
   }
-  const y = (e.tapLeafScript || []).filter((h) => Qe(r, h.script)).map((h) => {
-    const d = ze({
-      output: h.script,
-      version: h.leafVersion
+  const y = (e.tapLeafScript || []).filter((p) => Ze(r, p.script)).map((p) => {
+    const d = qe({
+      output: p.script,
+      version: p.leafVersion
     });
-    return Object.assign({ hash: d }, h);
-  }).filter((h) => !s || s.equals(h.hash)).map((h) => {
+    return Object.assign({ hash: d }, p);
+  }).filter((p) => !s || s.equals(p.hash)).map((p) => {
     const d = i.hashForWitnessV1(
       t,
       f,
-      p,
+      h,
       a,
-      h.hash
+      p.hash
     );
     return {
       pubkey: r,
       hash: d,
-      leafHash: h.hash
+      leafHash: p.hash
     };
   });
   return g.concat(y);
 }
-function Er(t, e) {
+function gr(t, e) {
   if (e && e.indexOf(t) < 0) {
-    const n = Oo(t);
+    const n = Co(t);
     throw new Error(
       `Sighash type is not allowed. Retry the sign method passing the sighashTypes array of whitelisted types. Sighash type: ${n}`
     );
   }
 }
-function Ao(t, e, n) {
+function ko(t, e, n) {
   let r;
   switch (e) {
     case "multisig": {
-      const c = Co(t, n);
-      r = je({
+      const c = xo(t, n);
+      r = De({
         output: t,
         signatures: c
       });
@@ -3758,14 +3774,14 @@ function Ao(t, e, n) {
       });
       break;
     case "pubkeyhash":
-      r = Ee({
+      r = we({
         output: t,
         pubkey: n[0].pubkey,
         signature: n[0].signature
       });
       break;
     case "witnesspubkeyhash":
-      r = Ve({
+      r = Xe({
         output: t,
         pubkey: n[0].pubkey,
         signature: n[0].signature
@@ -3774,7 +3790,7 @@ function Ao(t, e, n) {
   }
   return r;
 }
-function xo(t, e, n) {
+function Ao(t, e, n) {
   const r = n.__TX, c = {
     script: null,
     isSegwit: !1,
@@ -3786,16 +3802,16 @@ function xo(t, e, n) {
   else if (e.redeemScript)
     c.script = e.redeemScript;
   else if (e.nonWitnessUtxo) {
-    const s = et(n, e, t), o = r.ins[t].index;
+    const s = Je(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 || Je(c.script))
+  if (e.witnessScript || $e(c.script))
     c.isSegwit = !0;
   else
     try {
       const s = c.script;
       if (!s) throw new TypeError("Invalid script for segwit address");
-      c.isSegwit = Qn(s);
+      c.isSegwit = Yn(s);
     } catch {
     }
   return c;
@@ -3819,10 +3835,10 @@ function Cn(t, e, n) {
     return o;
   });
 }
-function Co(t, e) {
-  return je({ output: t }).pubkeys.map((r) => (e.filter((c) => c.pubkey.equals(r))[0] || {}).signature).filter((r) => !!r);
+function xo(t, e) {
+  return De({ output: t }).pubkeys.map((r) => (e.filter((c) => c.pubkey.equals(r))[0] || {}).signature).filter((r) => !!r);
 }
-function br(t) {
+function yr(t) {
   let e = 0;
   function n(o) {
     return e += o, t.subarray(e - o, e);
@@ -3841,7 +3857,7 @@ function br(t) {
   }
   return s();
 }
-function Oo(t) {
+function Co(t) {
   let e = t & v.SIGHASH_ANYONECANPAY ? "SIGHASH_ANYONECANPAY | " : "";
   switch (t & 31) {
     case v.SIGHASH_ALL:
@@ -3856,7 +3872,7 @@ function Oo(t) {
   }
   return e;
 }
-function bt(t, e, n) {
+function Et(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", {
@@ -3875,13 +3891,13 @@ function bt(t, e, n) {
     }
   });
 }
-function Tr(t, e, n, r, c) {
+function Sr(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 = br(u.finalScriptWitness)), u.witnessUtxo)
+    if (r && u.finalScriptSig && (e.ins[f].script = u.finalScriptSig), r && u.finalScriptWitness && (e.ins[f].witness = yr(u.finalScriptWitness)), u.witnessUtxo)
       s += u.witnessUtxo.value;
     else if (u.nonWitnessUtxo) {
-      const p = et(n, u, f), g = e.ins[f].index, y = p.outs[g];
+      const h = Je(n, u, f), g = e.ins[f].index, y = h.outs[g];
       s += y.value;
     }
   });
@@ -3893,147 +3909,147 @@ function Tr(t, e, n, r, c) {
   const a = e.virtualSize();
   n.__FEE = i, n.__EXTRACTED_TX = e, n.__FEE_RATE = Math.floor(i / a);
 }
-function et(t, e, n) {
+function Je(t, e, n) {
   const r = t.__NON_WITNESS_UTXO_TX_CACHE;
-  return r[n] || bt(t, e, n), r[n];
+  return r[n] || Et(t, e, n), r[n];
 }
-function _r(t, e, n) {
-  const { script: r } = vt(t, e, n);
+function wr(t, e, n) {
+  const { script: r } = kt(t, e, n);
   return r;
 }
-function vt(t, e, n) {
+function kt(t, e, n) {
   if (e.witnessUtxo !== void 0)
     return {
       script: e.witnessUtxo.script,
       value: e.witnessUtxo.value
     };
   if (e.nonWitnessUtxo !== void 0) {
-    const c = et(n, e, t).outs[n.__TX.ins[t].index];
+    const c = Je(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 Po(t, e, n, r) {
-  const c = _r(n, e, r), { meaningfulScript: s } = tt(
+function Oo(t, e, n, r) {
+  const c = wr(n, e, r), { meaningfulScript: s } = Qe(
     c,
     n,
     "input",
     e.redeemScript,
     e.witnessScript
   );
-  return Qe(t, s);
+  return Ze(t, s);
 }
-function No(t, e, n, r) {
-  const c = r.__TX.outs[n].script, { meaningfulScript: s } = tt(
+function Po(t, e, n, r) {
+  const c = r.__TX.outs[n].script, { meaningfulScript: s } = Qe(
     c,
     n,
     "output",
     e.redeemScript,
     e.witnessScript
   );
-  return Qe(t, s);
+  return Ze(t, s);
 }
-function Ho(t) {
+function No(t) {
   if (!t) return;
-  const e = fe(t);
+  const e = ue(t);
   if (!e) return;
   const n = e[e.length - 1];
-  if (!(!l.isBuffer(n) || mr(n) || Ro(n) || !fe(n)))
+  if (!(!l.isBuffer(n) || Er(n) || Bo(n) || !ue(n)))
     return n;
 }
 function Uo(t) {
   if (!t) return;
-  const e = br(t), n = e[e.length - 1];
-  if (!(mr(n) || !fe(n)))
+  const e = yr(t), n = e[e.length - 1];
+  if (!(Er(n) || !ue(n)))
     return n;
 }
-function Bo(t) {
+function Ho(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 mr(t) {
-  return t.length === 33 && Or(t);
+function Er(t) {
+  return t.length === 33 && kr(t);
 }
-function Ro(t) {
-  return Hn(t);
+function Bo(t) {
+  return Un(t);
 }
-function tt(t, e, n, r, c) {
-  const s = ur(t), o = s && r && Sn(r), i = Sn(t);
+function Qe(t, e, n, r, c) {
+  const s = or(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, 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, {
+  return o ? (a = c, In(e, t, r, n), vn(e, r, c, n), Ge(a)) : i ? (a = c, vn(e, t, c, n), Ge(a)) : s ? (a = r, In(e, t, r, n)) : a = t, {
     meaningfulScript: a,
     type: o ? "p2sh-p2wsh" : s ? "p2sh" : i ? "p2wsh" : "raw"
   };
 }
-function Xe(t) {
-  if (Je(t) || ur(t))
+function Ge(t) {
+  if ($e(t) || or(t))
     throw new Error("P2WPKH or P2SH can not be contained within P2WSH");
 }
-function Ir(t) {
-  return Je(t) ? "witnesspubkeyhash" : Zs(t) ? "pubkeyhash" : Ys(t) ? "multisig" : $s(t) ? "pubkey" : "nonstandard";
+function br(t) {
+  return $e(t) ? "witnesspubkeyhash" : $s(t) ? "pubkeyhash" : zs(t) ? "multisig" : Ys(t) ? "pubkey" : "nonstandard";
 }
-function de(t) {
+function le(t) {
   return [...Array(t).keys()];
 }
 export {
-  $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,
-  Je as N,
+  ze as A,
+  Ye as B,
+  Yn as C,
+  $n as D,
+  Jn as E,
+  _e as F,
+  Is as G,
+  Qn as H,
+  er as I,
+  tr as J,
+  zs as K,
+  Ys as L,
+  $s as M,
+  $e 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,
+  St as P,
+  or as Q,
+  vt as R,
+  Xo as S,
+  Do as T,
+  ye as U,
+  ir as V,
+  Ze as W,
+  Zs as X,
+  cr as Y,
+  Qs as Z,
+  Zn as _,
+  _s as a,
+  Ve as b,
+  Go as c,
   K as d,
-  vo as e,
+  Io as e,
   Kn as f,
-  Io as g,
+  mo as g,
   wn as h,
   Fn as i,
   N as j,
-  at as k,
+  ct 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
+  Wo as n,
+  qo as o,
+  ke as p,
+  Vo as q,
+  no as r,
+  Re as s,
+  ge as t,
+  ro as u,
+  io as v,
+  me as w,
+  Ie as x,
+  zn as y,
+  We as z
 };