@btc-vision/transaction 1.8.7-beta.0 → 1.8.7

package/browser/btc-vision-bitcoin.js

@@ -156,10 +156,10 @@ var kt = {
     scriptHash: 196,
     wif: 239
   }
-}, Symbol.toStringTag, { value: "Module" })), ye = {}, vi;
+}, Symbol.toStringTag, { value: "Module" })), ye = {}, mi;
 function Ia() {
-  if (vi) return ye;
-  vi = 1, Object.defineProperty(ye, "__esModule", { value: !0 }), ye.bech32m = ye.bech32 = void 0;
+  if (mi) return ye;
+  mi = 1, Object.defineProperty(ye, "__esModule", { value: !0 }), ye.bech32m = ye.bech32 = void 0;
   const e = "qpzry9x8gf2tvdw0s3jn54khce6mua7l", t = {};
   for (let p = 0; p < 32; p++) {
     const u = e.charAt(p);
@@ -289,10 +289,10 @@ function cr(e) {
     data: new Uint8Array(n)
   };
 }
-var Ts = "0123456789abcdefABCDEF";
-Ts.split("").map((e) => e.codePointAt(0));
+var Ss = "0123456789abcdefABCDEF";
+Ss.split("").map((e) => e.codePointAt(0));
 Array(256).fill(!0).map((e, t) => {
-  const r = String.fromCodePoint(t), n = Ts.indexOf(r);
+  const r = String.fromCodePoint(t), n = Ss.indexOf(r);
   return n < 0 ? void 0 : n < 16 ? n : n - 6;
 });
 new TextEncoder();
@@ -348,11 +348,11 @@ var Pa = (e) => {
 function xa(e) {
   if (e < 0 || e > Number.MAX_SAFE_INTEGER || e % 1 !== 0) throw new RangeError("value out of range");
 }
-function ks(e) {
+function Ts(e) {
   typeof e == "number" ? xa(e) : Pa(e);
 }
 function ge(e, t, r) {
-  ks(e), r === void 0 && (r = 0), t === void 0 && (t = new Uint8Array(Ct(e)));
+  Ts(e), r === void 0 && (r = 0), t === void 0 && (t = new Uint8Array(Ct(e)));
   let n = 0;
   return e < 253 ? (t.set([Number(e)], r), n = 1) : e <= 65535 ? (t.set([253], r), Aa(t, r + 1, Number(e), "LE"), n = 3) : e <= 4294967295 ? (t.set([254], r), Sa(t, r + 1, Number(e), "LE"), n = 5) : (t.set([255], r), Ta(t, r + 1, BigInt(e), "LE"), n = 9), {
     buffer: t,
@@ -392,14 +392,14 @@ function We(e, t) {
   }
 }
 function Ct(e) {
-  return ks(e), e < 253 ? 1 : e <= 65535 ? 3 : e <= 4294967295 ? 5 : 9;
+  return Ts(e), e < 253 ? 1 : e <= 65535 ? 3 : e <= 4294967295 ? 5 : 9;
 }
 var Kl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   decode: We,
   encode: ge,
   encodingLength: Ct
-}, Symbol.toStringTag, { value: "Module" })), Ba = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0")), Ii = (() => {
+}, Symbol.toStringTag, { value: "Module" })), Ba = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0")), Ei = (() => {
   const e = new Array(128).fill(-1);
   for (let t = 0; t < 10; t++) e[48 + t] = t;
   for (let t = 0; t < 6; t++) e[65 + t] = 10 + t, e[97 + t] = 10 + t;
@@ -421,14 +421,14 @@ function Mt(e) {
   for (let i = 0; i < r; i++) {
     const o = i * 2, a = e.charCodeAt(o), f = e.charCodeAt(o + 1);
     if (a >= 128 || f >= 128) throw new TypeError(`Invalid hex character at position ${o}`);
-    const l = Ii[a], p = Ii[f];
+    const l = Ei[a], p = Ei[f];
     if (l === -1) throw new TypeError(`Invalid hex character at position ${o}`);
     if (p === -1) throw new TypeError(`Invalid hex character at position ${o + 1}`);
     n[i] = l << 4 | p;
   }
   return n;
 }
-var _a = class Us {
+var _a = class ks {
   #t;
   #a;
   #e;
@@ -452,7 +452,7 @@ var _a = class Us {
     return this.#t;
   }
   static fromHex(t) {
-    return new Us(Mt(t));
+    return new ks(Mt(t));
   }
   readUInt8() {
     if (this.#e >= this.#t.length) throw new RangeError("Read past end of buffer");
@@ -697,7 +697,7 @@ var _a = class Us {
 function Na(e) {
   return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
 }
-function Os(e, t, r = "") {
+function Us(e, t, r = "") {
   const n = Na(e), i = e?.length;
   if (!n || t !== void 0) {
     const o = r && `"${r}" `, a = n ? `length=${i}` : `type=${typeof e}`;
@@ -705,12 +705,12 @@ function Os(e, t, r = "") {
   }
   return e;
 }
-function Ai(e, t = !0) {
+function vi(e, t = !0) {
   if (e.destroyed) throw new Error("Hash instance has been destroyed");
   if (t && e.finished) throw new Error("Hash#digest() has already been called");
 }
 function Ha(e, t) {
-  Os(e, void 0, "digestInto() output");
+  Us(e, void 0, "digestInto() output");
   const r = t.outputLen;
   if (e.length < r) throw new Error('"digestInto() output" expected to be of length >=' + r);
 }
@@ -726,7 +726,7 @@ function Wt(e, t) {
 function Ee(e, t) {
   return e << t | e >>> 32 - t >>> 0;
 }
-function Wn(e, t = {}) {
+function Fn(e, t = {}) {
   const r = (i, o) => e(o).update(i).digest(), n = e(void 0);
   return r.outputLen = n.outputLen, r.blockLen = n.blockLen, r.create = (i) => e(i), Object.assign(r, t), Object.freeze(r);
 }
@@ -743,13 +743,13 @@ var La = (e) => ({ oid: Uint8Array.from([
   2,
   e
 ]) });
-function Ps(e, t, r) {
+function Os(e, t, r) {
   return e & t ^ ~e & r;
 }
-function xs(e, t, r) {
+function Ps(e, t, r) {
   return e & t ^ e & r ^ t & r;
 }
-var Gn = class {
+var Wn = class {
   blockLen;
   outputLen;
   padOffset;
@@ -764,7 +764,7 @@ var Gn = class {
     this.blockLen = e, this.outputLen = t, this.padOffset = r, this.isLE = n, this.buffer = new Uint8Array(e), this.view = fn(this.buffer);
   }
   update(e) {
-    Ai(this), Os(e);
+    vi(this), Us(e);
     const { view: t, buffer: r, blockLen: n } = this, i = e.length;
     for (let o = 0; o < i; ) {
       const a = Math.min(n - this.pos, i - o);
@@ -778,7 +778,7 @@ var Gn = class {
     return this.length += e.length, this.roundClean(), this;
   }
   digestInto(e) {
-    Ai(this), Ha(e, this), this.finished = !0;
+    vi(this), Ha(e, this), this.finished = !0;
     const { buffer: t, view: r, blockLen: n, isLE: i } = this;
     let { pos: o } = this;
     t[o++] = 128, Te(this.buffer.subarray(o)), this.padOffset > n - o && (this.process(r, 0), o = 0);
@@ -878,7 +878,7 @@ var Gn = class {
   2756734187,
   3204031479,
   3329325298
-]), oe = /* @__PURE__ */ new Uint32Array(64), Va = class extends Gn {
+]), oe = /* @__PURE__ */ new Uint32Array(64), Va = class extends Wn {
   constructor(e) {
     super(64, e, 8, !1);
   }
@@ -906,7 +906,7 @@ var Gn = class {
     }
     let { A: r, B: n, C: i, D: o, E: a, F: f, G: l, H: p } = this;
     for (let u = 0; u < 64; u++) {
-      const d = Wt(a, 6) ^ Wt(a, 11) ^ Wt(a, 25), w = p + d + Ps(a, f, l) + Ca[u] + oe[u] | 0, b = (Wt(r, 2) ^ Wt(r, 13) ^ Wt(r, 22)) + xs(r, n, i) | 0;
+      const d = Wt(a, 6) ^ Wt(a, 11) ^ Wt(a, 25), w = p + d + Os(a, f, l) + Ca[u] + oe[u] | 0, b = (Wt(r, 2) ^ Wt(r, 13) ^ Wt(r, 22)) + Ps(r, n, i) | 0;
       p = l, l = f, f = a, a = o + w | 0, o = i, i = n, n = r, r = w + b | 0;
     }
     r = r + this.A | 0, n = n + this.B | 0, i = i + this.C | 0, o = o + this.D | 0, a = a + this.E | 0, f = f + this.F | 0, l = l + this.G | 0, p = p + this.H | 0, this.set(r, n, i, o, a, f, l, p);
@@ -929,7 +929,7 @@ var Gn = class {
   constructor() {
     super(32);
   }
-}, Ke = /* @__PURE__ */ Wn(() => new $a(), /* @__PURE__ */ La(1));
+}, Ke = /* @__PURE__ */ Fn(() => new $a(), /* @__PURE__ */ La(1));
 function Ka(e) {
   if (e.length >= 255) throw new TypeError("Alphabet too long");
   const t = new Uint8Array(256);
@@ -1021,7 +1021,7 @@ function Da(e) {
 function Ma(e) {
   return Ke(Ke(e));
 }
-var { encode: jn, decode: zn } = Da(Ma);
+var { encode: Gn, decode: jn } = Da(Ma);
 function Bt(e) {
   let t = 0;
   for (const i of e) t += i.length;
@@ -1047,11 +1047,11 @@ function Un(e) {
   for (let t = 0; t < e.length; t++) if (e[t] !== 0) return !1;
   return !0;
 }
-function Si(e) {
+function Ii(e) {
   const t = new Uint8Array(e.length);
   return t.set(e), t;
 }
-function qn(e) {
+function zn(e) {
   return e.reverse(), e;
 }
 function Et(e, t = 0) {
@@ -1224,7 +1224,7 @@ var j = {
   OP_PUBKEY: 254,
   OP_INVALIDOPCODE: 255
 }, mr;
-function Bs() {
+function xs() {
   if (!mr) {
     mr = {};
     for (const e of Object.keys(j)) {
@@ -1234,12 +1234,12 @@ function Bs() {
   }
   return mr;
 }
-Bs();
-function _s(e) {
+xs();
+function Bs(e) {
   return e < j.OP_PUSHDATA1 ? 1 : e <= 255 ? 2 : e <= 65535 ? 3 : 5;
 }
 function ja(e, t, r) {
-  const n = _s(t), i = new DataView(e.buffer, e.byteOffset, e.byteLength);
+  const n = Bs(t), i = new DataView(e.buffer, e.byteOffset, e.byteLength);
   return n === 1 ? e[r] = t : n === 2 ? (e[r] = j.OP_PUSHDATA1, e[r + 1] = t) : n === 3 ? (e[r] = j.OP_PUSHDATA2, i.setUint16(r + 1, t, !0)) : (e[r] = j.OP_PUSHDATA4, i.setUint32(r + 1, t, !0)), n;
 }
 function za(e, t) {
@@ -1263,7 +1263,7 @@ function za(e, t) {
     size: o
   };
 }
-var Rs = {}, Zr = {};
+var _s = {}, Zr = {};
 Zr.byteLength = Xa;
 Zr.toByteArray = Qa;
 Zr.fromByteArray = eh;
@@ -1271,7 +1271,7 @@ var zt = [], Ht = [], qa = typeof Uint8Array < "u" ? Uint8Array : Array, ln = "A
 for (var Re = 0, Ya = ln.length; Re < Ya; ++Re) zt[Re] = ln[Re], Ht[ln.charCodeAt(Re)] = Re;
 Ht[45] = 62;
 Ht[95] = 63;
-function Ns(e) {
+function Rs(e) {
   var t = e.length;
   if (t % 4 > 0) throw new Error("Invalid string. Length must be a multiple of 4");
   var r = e.indexOf("=");
@@ -1280,14 +1280,14 @@ function Ns(e) {
   return [r, n];
 }
 function Xa(e) {
-  var t = Ns(e), r = t[0], n = t[1];
+  var t = Rs(e), r = t[0], n = t[1];
   return (r + n) * 3 / 4 - n;
 }
 function Za(e, t, r) {
   return (t + r) * 3 / 4 - r;
 }
 function Qa(e) {
-  var t, r = Ns(e), n = r[0], i = r[1], o = new qa(Za(e, n, i)), a = 0, f = i > 0 ? n - 4 : n, l;
+  var t, r = Rs(e), n = r[0], i = r[1], o = new qa(Za(e, n, i)), a = 0, f = i > 0 ? n - 4 : n, l;
   for (l = 0; l < f; l += 4) t = Ht[e.charCodeAt(l)] << 18 | Ht[e.charCodeAt(l + 1)] << 12 | Ht[e.charCodeAt(l + 2)] << 6 | Ht[e.charCodeAt(l + 3)], o[a++] = t >> 16 & 255, o[a++] = t >> 8 & 255, o[a++] = t & 255;
   return i === 2 && (t = Ht[e.charCodeAt(l)] << 2 | Ht[e.charCodeAt(l + 1)] >> 4, o[a++] = t & 255), i === 1 && (t = Ht[e.charCodeAt(l)] << 10 | Ht[e.charCodeAt(l + 1)] << 4 | Ht[e.charCodeAt(l + 2)] >> 2, o[a++] = t >> 8 & 255, o[a++] = t & 255), o;
 }
@@ -1302,8 +1302,8 @@ function eh(e) {
   for (var t, r = e.length, n = r % 3, i = [], o = 16383, a = 0, f = r - n; a < f; a += o) i.push(th(e, a, a + o > f ? f : a + o));
   return n === 1 ? (t = e[r - 1], i.push(zt[t >> 2] + zt[t << 4 & 63] + "==")) : n === 2 && (t = (e[r - 2] << 8) + e[r - 1], i.push(zt[t >> 10] + zt[t >> 4 & 63] + zt[t << 2 & 63] + "=")), i.join("");
 }
-var Yn = {};
-Yn.read = function(e, t, r, n, i) {
+var qn = {};
+qn.read = function(e, t, r, n, i) {
   var o, a, f = i * 8 - n - 1, l = (1 << f) - 1, p = l >> 1, u = -7, d = r ? i - 1 : 0, w = r ? -1 : 1, b = e[t + d];
   for (d += w, o = b & (1 << -u) - 1, b >>= -u, u += f; u > 0; o = o * 256 + e[t + d], d += w, u -= 8) ;
   for (a = o & (1 << -u) - 1, o >>= -u, u += n; u > 0; a = a * 256 + e[t + d], d += w, u -= 8) ;
@@ -1314,14 +1314,14 @@ Yn.read = function(e, t, r, n, i) {
   }
   return (b ? -1 : 1) * a * Math.pow(2, o - n);
 };
-Yn.write = function(e, t, r, n, i, o) {
+qn.write = function(e, t, r, n, i, o) {
   var a, f, l, p = o * 8 - i - 1, u = (1 << p) - 1, d = u >> 1, w = i === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, b = n ? 0 : o - 1, m = n ? 1 : -1, v = t < 0 || t === 0 && 1 / t < 0 ? 1 : 0;
   for (t = Math.abs(t), isNaN(t) || t === 1 / 0 ? (f = isNaN(t) ? 1 : 0, a = u) : (a = Math.floor(Math.log(t) / Math.LN2), t * (l = Math.pow(2, -a)) < 1 && (a--, l *= 2), a + d >= 1 ? t += w / l : t += w * Math.pow(2, 1 - d), t * l >= 2 && (a++, l /= 2), a + d >= u ? (f = 0, a = u) : a + d >= 1 ? (f = (t * l - 1) * Math.pow(2, i), a = a + d) : (f = t * Math.pow(2, d - 1) * Math.pow(2, i), a = 0)); i >= 8; e[r + b] = f & 255, b += m, f /= 256, i -= 8) ;
   for (a = a << i | f, p += i; p > 0; e[r + b] = a & 255, b += m, a /= 256, p -= 8) ;
   e[r + b - m] |= v * 128;
 };
 (function(e) {
-  const t = Zr, r = Yn, n = typeof Symbol == "function" && typeof Symbol.for == "function" ? /* @__PURE__ */ Symbol.for("nodejs.util.inspect.custom") : null;
+  const t = Zr, r = qn, n = typeof Symbol == "function" && typeof Symbol.for == "function" ? /* @__PURE__ */ Symbol.for("nodejs.util.inspect.custom") : null;
   e.Buffer = u, e.SlowBuffer = z, e.INSPECT_MAX_BYTES = 50;
   const i = 2147483647;
   e.kMaxLength = i;
@@ -1502,7 +1502,7 @@ Yn.write = function(e, t, r, n, i, o) {
       case "hex":
         return c >>> 1;
       case "base64":
-        return Ei(s).length;
+        return bi(s).length;
       default:
         if (y) return g ? -1 : hn(s).length;
         h = ("" + h).toLowerCase(), y = !0;
@@ -1644,7 +1644,7 @@ Yn.write = function(e, t, r, n, i, o) {
     return br(ya(h), s, c, g);
   }
   function T(s, h, c, g) {
-    return br(Ei(h), s, c, g);
+    return br(bi(h), s, c, g);
   }
   function A(s, h, c, g) {
     return br(ba(h, s.length - c), s, c, g);
@@ -1868,14 +1868,14 @@ Yn.write = function(e, t, r, n, i, o) {
     return s = +s, h = h >>> 0, c || K(this, s, h, 4, 4294967295, 0), this[h] = s >>> 24, this[h + 1] = s >>> 16, this[h + 2] = s >>> 8, this[h + 3] = s & 255, h + 4;
   };
   function nt(s, h, c, g, y) {
-    mi(h, g, y, s, c, 7);
+    yi(h, g, y, s, c, 7);
     let E = Number(h & BigInt(4294967295));
     s[c++] = E, E = E >> 8, s[c++] = E, E = E >> 8, s[c++] = E, E = E >> 8, s[c++] = E;
     let k = Number(h >> BigInt(32) & BigInt(4294967295));
     return s[c++] = k, k = k >> 8, s[c++] = k, k = k >> 8, s[c++] = k, k = k >> 8, s[c++] = k, c;
   }
   function lt(s, h, c, g, y) {
-    mi(h, g, y, s, c, 7);
+    yi(h, g, y, s, c, 7);
     let E = Number(h & BigInt(4294967295));
     s[c + 7] = E, E = E >> 8, s[c + 6] = E, E = E >> 8, s[c + 5] = E, E = E >> 8, s[c + 4] = E;
     let k = Number(h >> BigInt(32) & BigInt(4294967295));
@@ -2008,7 +2008,7 @@ Yn.write = function(e, t, r, n, i, o) {
   function da(s, h, c) {
     _e(h, "offset"), (s[h] === void 0 || s[h + c] === void 0) && ze(h, s.length - (c + 1));
   }
-  function mi(s, h, c, g, y, E) {
+  function yi(s, h, c, g, y, E) {
     if (s > c || s < h) {
       const k = typeof h == "bigint" ? "n" : "";
       let st;
@@ -2080,7 +2080,7 @@ Yn.write = function(e, t, r, n, i, o) {
     for (let k = 0; k < s.length && !((h -= 2) < 0); ++k) c = s.charCodeAt(k), g = c >> 8, y = c % 256, E.push(y), E.push(g);
     return E;
   }
-  function Ei(s) {
+  function bi(s) {
     return t.toByteArray(ga(s));
   }
   function br(s, h, c, g) {
@@ -2108,8 +2108,8 @@ Yn.write = function(e, t, r, n, i, o) {
   function Ea() {
     throw new Error("BigInt not supported");
   }
-})(Rs);
-var rh = Rs.Buffer;
+})(_s);
+var rh = _s.Buffer;
 function nh(e, t, r) {
   t = t || 4, r = r === void 0 ? !0 : r;
   const n = e.length;
@@ -2127,7 +2127,7 @@ function nh(e, t, r) {
 function ih(e) {
   return e > 2147483647 ? 5 : e > 8388607 ? 4 : e > 32767 ? 3 : e > 127 ? 2 : e > 0 ? 1 : 0;
 }
-function Hs(e) {
+function Ns(e) {
   let t = Math.abs(e);
   const r = ih(t), n = rh.allocUnsafe(r), i = e < 0;
   for (let o = 0; o < r; ++o) n.writeUInt8(t & 255, o), t >>= 8;
@@ -2136,9 +2136,9 @@ function Hs(e) {
 var sh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   decode: nh,
-  encode: Hs
-}, Symbol.toStringTag, { value: "Module" })), On = Mt("fffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), Ml = Mt("fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), Ti = 21n * 10n ** 14n;
-function Ls(e) {
+  encode: Ns
+}, Symbol.toStringTag, { value: "Module" })), On = Mt("fffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), Ml = Mt("fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), Ai = 21n * 10n ** 14n;
+function Hs(e) {
   return typeof e == "number" && Number.isInteger(e) && e >= 0 && e <= 255;
 }
 function oh(e) {
@@ -2147,7 +2147,7 @@ function oh(e) {
 function ah(e, t) {
   return e instanceof Uint8Array && e.length === t;
 }
-function Xn(e) {
+function Yn(e) {
   return Array.isArray(e);
 }
 function hh(e) {
@@ -2156,7 +2156,7 @@ function hh(e) {
 function uh(e) {
   return e instanceof Uint8Array && e.length === 32;
 }
-function Cs(e) {
+function Ls(e) {
   return e instanceof Uint8Array && e.length === 20;
 }
 function fh(e) {
@@ -2171,7 +2171,7 @@ function ke(e) {
   const n = e.subarray(33);
   return Un(n) || De(n, On) >= 0 ? !1 : t === 4 || t === 6 || t === 7;
 }
-function Vs(e) {
+function Cs(e) {
   if (!e || typeof e != "object") return !1;
   const t = e;
   return !(!("output" in t) || !(t.output instanceof Uint8Array) || t.version !== void 0 && (typeof t.version != "number" || (t.version & 254) !== t.version));
@@ -2179,7 +2179,7 @@ function Vs(e) {
 function Ue(e, t) {
   return e.length !== t.length ? !1 : e.every((r, n) => x(r, t[n]));
 }
-function ki(e) {
+function Si(e) {
   if (!uh(e)) throw new TypeError(`Expected 32-byte Uint8Array, got ${e.length} bytes`);
   return e;
 }
@@ -2191,25 +2191,25 @@ function Or(e) {
   return e;
 }
 function lh(e) {
-  if (!Cs(e)) throw new TypeError(`Expected 20-byte Uint8Array, got ${e.length} bytes`);
+  if (!Ls(e)) throw new TypeError(`Expected 20-byte Uint8Array, got ${e.length} bytes`);
   return e;
 }
 function Fl(e) {
   if (e < 0n) throw new RangeError(`Satoshi cannot be negative, got ${e}`);
-  if (e > Ti) throw new RangeError(`Satoshi exceeds maximum supply (${Ti}), got ${e}`);
+  if (e > Ai) throw new RangeError(`Satoshi exceeds maximum supply (${Ai}), got ${e}`);
   return e;
 }
-var Ui = new Uint8Array([0]);
+var Ti = new Uint8Array([0]);
 function Qr(e) {
   const t = e & -129;
   return t > 0 && t < 4;
 }
-function Oi(e) {
+function ki(e) {
   let t = 0;
   for (; e[t] === 0; ) ++t;
-  return t === e.length ? Ui : (e = e.subarray(t), e[0] & 128 ? Bt([Ui, e]) : e);
+  return t === e.length ? Ti : (e = e.subarray(t), e[0] & 128 ? Bt([Ti, e]) : e);
 }
-function Pi(e) {
+function Ui(e) {
   e[0] === 0 && (e = e.subarray(1));
   const t = Et(32), r = Math.max(0, 32 - e.length);
   return t.set(e, r), t;
@@ -2219,55 +2219,55 @@ function ph(e) {
   if (!Qr(t)) throw new Error(`Invalid hashType ${t}`);
   const r = Wa(e.subarray(0, -1));
   return {
-    signature: Bt([Pi(r.r), Pi(r.s)]),
+    signature: Bt([Ui(r.r), Ui(r.s)]),
     hashType: t
   };
 }
 function dh(e, t) {
   if (!ah(e, 64)) throw new TypeError("Expected signature to be a 64-byte Uint8Array");
-  if (!Ls(t)) throw new TypeError("Expected hashType to be a UInt8");
+  if (!Hs(t)) throw new TypeError("Expected hashType to be a UInt8");
   if (!Qr(t)) throw new Error(`Invalid hashType ${t}`);
   const r = new Uint8Array([t]);
-  return Bt([Ga(Oi(e.subarray(0, 32)), Oi(e.subarray(32, 64))), r]);
+  return Bt([Ga(ki(e.subarray(0, 32)), ki(e.subarray(32, 64))), r]);
 }
 var wh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   decode: ph,
   encode: dh,
   isDefinedHashType: Qr
-}, Symbol.toStringTag, { value: "Module" })), $s = j.OP_RESERVED;
+}, Symbol.toStringTag, { value: "Module" })), Vs = j.OP_RESERVED;
 function gh(e) {
   return oh(e) && (e === j.OP_0 || e >= j.OP_1 && e <= j.OP_16 || e === j.OP_1NEGATE);
 }
-function Ks(e) {
+function $s(e) {
   return e instanceof Uint8Array ? !0 : gh(e);
 }
 function Jr(e) {
-  return Xn(e) && e.every(Ks);
+  return Yn(e) && e.every($s);
 }
-function Zn(e) {
-  return e.length - e.filter(Ks).length;
+function Xn(e) {
+  return e.length - e.filter($s).length;
 }
 function Rr(e) {
   if (e.length === 0) return j.OP_0;
   if (e.length !== 1) return;
   const t = e[0];
-  if (t >= 1 && t <= 16) return $s + t;
+  if (t >= 1 && t <= 16) return Vs + t;
   if (t === 129) return j.OP_1NEGATE;
 }
-function Qn(e) {
+function Zn(e) {
   return e instanceof Uint8Array;
 }
 function yh(e) {
-  return Xn(e);
+  return Yn(e);
 }
 function Nr(e) {
   return e instanceof Uint8Array;
 }
 function gt(e) {
-  if (Qn(e)) return e;
-  if (!Xn(e)) throw new TypeError("Expected an array");
-  const t = e.reduce((i, o) => Nr(o) ? o.length === 1 && Rr(o) !== void 0 ? i + 1 : i + _s(o.length) + o.length : i + 1, 0), r = new Uint8Array(t);
+  if (Zn(e)) return e;
+  if (!Yn(e)) throw new TypeError("Expected an array");
+  const t = e.reduce((i, o) => Nr(o) ? o.length === 1 && Rr(o) !== void 0 ? i + 1 : i + Bs(o.length) + o.length : i + 1, 0), r = new Uint8Array(t);
   let n = 0;
   if (e.forEach((i) => {
     if (Nr(i)) {
@@ -2299,9 +2299,9 @@ function et(e) {
   }
   return t;
 }
-function Ds(e) {
+function Ks(e) {
   let t;
-  if (Qn(e)) {
+  if (Zn(e)) {
     const r = et(e);
     if (!r) throw new Error("Could not convert invalid chunks to ASM");
     t = r;
@@ -2312,7 +2312,7 @@ function Ds(e) {
       if (n === void 0) return Yt(r);
       r = n;
     }
-    return Bs()[r];
+    return xs()[r];
   }).join(" ");
 }
 function bh(e) {
@@ -2323,12 +2323,12 @@ function bh(e) {
     return Mt(t);
   }));
 }
-function Ms(e) {
-  const t = Qn(e) ? et(e) : e;
+function Ds(e) {
+  const t = Zn(e) ? et(e) : e;
   if (!t || !Jr(t)) throw new TypeError("Expected push-only script");
-  return t.map((r) => Nr(r) ? r : r === j.OP_0 ? Et(0) : Hs(r - $s));
+  return t.map((r) => Nr(r) ? r : r === j.OP_0 ? Et(0) : Ns(r - Vs));
 }
-function Fs(e) {
+function Ms(e) {
   return ke(e);
 }
 function xe(e) {
@@ -2337,17 +2337,17 @@ function xe(e) {
 var mh = sh, Ae = wh, Eh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   compile: gt,
-  countNonPushOnlyOPs: Zn,
+  countNonPushOnlyOPs: Xn,
   decompile: et,
   fromASM: bh,
-  isCanonicalPubKey: Fs,
+  isCanonicalPubKey: Ms,
   isCanonicalScriptSignature: xe,
   isPushOnly: Jr,
   number: mh,
   opcodes: j,
   signature: Ae,
-  toASM: Ds,
-  toStack: Ms
+  toASM: Ks,
+  toStack: Ds
 }, Symbol.toStringTag, { value: "Module" })), ft = {
   P2PK: "p2pk",
   P2PKH: "p2pkh",
@@ -2360,7 +2360,7 @@ var mh = sh, Ae = wh, Eh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.
   P2OP: "p2op",
   Embed: "embed",
   ScriptRedeem: "scriptRedeem"
-}, xi = j, Bi = 16, _i = 2, Ri = 40, Ws = class Qe {
+}, Oi = j, Pi = 16, xi = 2, Bi = 40, Fs = class Qe {
   static NAME = ft.P2OP;
   #t;
   #a;
@@ -2471,14 +2471,14 @@ var mh = sh, Ae = wh, Eh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.
     if (!t) return;
     if (!this.#t.bech32Opnet) throw new TypeError("Network does not support opnet");
     const r = tt.bech32m.toWords(t);
-    return r.unshift(Bi), tt.bech32m.encode(this.#t.bech32Opnet, r);
+    return r.unshift(Pi), tt.bech32m.encode(this.#t.bech32Opnet, r);
   }
   #b() {
     if (this.#s) return this.#s;
     const t = this.#v();
     if (t) return t;
     if (this.#i) {
-      if (this.#i[0] !== xi.OP_16) throw new TypeError("Invalid P2OP script");
+      if (this.#i[0] !== Oi.OP_16) throw new TypeError("Invalid P2OP script");
       let r = 1, n;
       const i = this.#i[1], o = this.#i[2];
       if (i !== void 0 && i < 76) n = i, r = 2;
@@ -2501,7 +2501,7 @@ var mh = sh, Ae = wh, Eh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.
   #T() {
     if (this.#i) return this.#i;
     const t = this.program;
-    if (t) return gt([xi.OP_16, t]);
+    if (t) return gt([Oi.OP_16, t]);
   }
   #k() {
     let t = Et(0);
@@ -2509,8 +2509,8 @@ var mh = sh, Ae = wh, Eh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.
       const r = this.#E();
       if (!r) throw new TypeError("Invalid address");
       if (this.#t.bech32Opnet !== r.prefix) throw new TypeError("Invalid prefix or network mismatch");
-      if (r.version !== Bi) throw new TypeError("Invalid witness version for p2op");
-      if (r.data.length < _i || r.data.length > Ri) throw new TypeError("Invalid witness program length");
+      if (r.version !== Pi) throw new TypeError("Invalid witness version for p2op");
+      if (r.data.length < xi || r.data.length > Bi) throw new TypeError("Invalid witness program length");
       t = r.data;
     }
     if (this.#s) {
@@ -2527,14 +2527,14 @@ var mh = sh, Ae = wh, Eh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.
       if (t.length > 0 && !x(t, r)) throw new TypeError("Program mismatch (output vs other source)");
       t = r;
     }
-    if (t.length < _i || t.length > Ri) throw new TypeError(`Witness program must be 2–40 bytes. Was ${t.length} bytes`);
+    if (t.length < xi || t.length > Bi) throw new TypeError(`Witness program must be 2–40 bytes. Was ${t.length} bytes`);
     if (this.#r !== void 0 && this.#r !== t[0]) throw new TypeError("deploymentVersion mismatch");
     if (this.#n && !x(this.#n, t.subarray(1))) throw new TypeError("hash160 mismatch");
   }
 };
-function Jn(e, t) {
+function Qn(e, t) {
   if (!e.address && !e.output && !e.program && (typeof e.deploymentVersion > "u" || !e.hash160)) throw new TypeError("At least one of address, output or program must be provided");
-  const r = new Ws({
+  const r = new Fs({
     address: e.address,
     program: e.program,
     deploymentVersion: e.deploymentVersion,
@@ -2550,7 +2550,7 @@ var qe = /* @__PURE__ */ Uint32Array.from([
   2562383102,
   271733878,
   3285377520
-]), ae = /* @__PURE__ */ new Uint32Array(80), vh = class extends Gn {
+]), ae = /* @__PURE__ */ new Uint32Array(80), vh = class extends Wn {
   A = qe[0] | 0;
   B = qe[1] | 0;
   C = qe[2] | 0;
@@ -2578,7 +2578,7 @@ var qe = /* @__PURE__ */ Uint32Array.from([
     let { A: r, B: n, C: i, D: o, E: a } = this;
     for (let f = 0; f < 80; f++) {
       let l, p;
-      f < 20 ? (l = Ps(n, i, o), p = 1518500249) : f < 40 ? (l = n ^ i ^ o, p = 1859775393) : f < 60 ? (l = xs(n, i, o), p = 2400959708) : (l = n ^ i ^ o, p = 3395469782);
+      f < 20 ? (l = Os(n, i, o), p = 1518500249) : f < 40 ? (l = n ^ i ^ o, p = 1859775393) : f < 60 ? (l = Ps(n, i, o), p = 2400959708) : (l = n ^ i ^ o, p = 3395469782);
       const u = Ee(r, 5) + l + a + p + ae[f] | 0;
       a = o, o = i, i = Ee(n, 30), n = r, r = u;
     }
@@ -2590,7 +2590,7 @@ var qe = /* @__PURE__ */ Uint32Array.from([
   destroy() {
     this.set(0, 0, 0, 0, 0), Te(this.buffer);
   }
-}, Ih = /* @__PURE__ */ Wn(() => new vh()), Ah = /* @__PURE__ */ Uint8Array.from([
+}, Ih = /* @__PURE__ */ Fn(() => new vh()), Ah = /* @__PURE__ */ Uint8Array.from([
   7,
   4,
   13,
@@ -2607,11 +2607,11 @@ var qe = /* @__PURE__ */ Uint32Array.from([
   14,
   11,
   8
-]), Gs = Uint8Array.from(new Array(16).fill(0).map((e, t) => t)), Sh = Gs.map((e) => (9 * e + 5) % 16), js = /* @__PURE__ */ (() => {
-  const e = [[Gs], [Sh]];
+]), Ws = Uint8Array.from(new Array(16).fill(0).map((e, t) => t)), Sh = Ws.map((e) => (9 * e + 5) % 16), Gs = /* @__PURE__ */ (() => {
+  const e = [[Ws], [Sh]];
   for (let t = 0; t < 4; t++) for (let r of e) r.push(r[t].map((n) => Ah[n]));
   return e;
-})(), zs = js[0], qs = js[1], Ys = /* @__PURE__ */ [
+})(), js = Gs[0], zs = Gs[1], qs = /* @__PURE__ */ [
   [
     11,
     14,
@@ -2702,7 +2702,7 @@ var qe = /* @__PURE__ */ Uint32Array.from([
     5,
     5
   ]
-].map((e) => Uint8Array.from(e)), Th = /* @__PURE__ */ zs.map((e, t) => e.map((r) => Ys[t][r])), kh = /* @__PURE__ */ qs.map((e, t) => e.map((r) => Ys[t][r])), Uh = /* @__PURE__ */ Uint32Array.from([
+].map((e) => Uint8Array.from(e)), Th = /* @__PURE__ */ js.map((e, t) => e.map((r) => qs[t][r])), kh = /* @__PURE__ */ zs.map((e, t) => e.map((r) => qs[t][r])), Uh = /* @__PURE__ */ Uint32Array.from([
   0,
   1518500249,
   1859775393,
@@ -2715,10 +2715,10 @@ var qe = /* @__PURE__ */ Uint32Array.from([
   2053994217,
   0
 ]);
-function Ni(e, t, r, n) {
+function _i(e, t, r, n) {
   return e === 0 ? t ^ r ^ n : e === 1 ? t & r | ~t & n : e === 2 ? (t | ~r) ^ n : e === 3 ? t & n | r & ~n : t ^ (r | ~n);
 }
-var Er = /* @__PURE__ */ new Uint32Array(16), Ph = class extends Gn {
+var Er = /* @__PURE__ */ new Uint32Array(16), Ph = class extends Wn {
   h0 = 1732584193;
   h1 = -271733879;
   h2 = -1732584194;
@@ -2744,13 +2744,13 @@ var Er = /* @__PURE__ */ new Uint32Array(16), Ph = class extends Gn {
     for (let w = 0; w < 16; w++, t += 4) Er[w] = e.getUint32(t, !0);
     let r = this.h0 | 0, n = r, i = this.h1 | 0, o = i, a = this.h2 | 0, f = a, l = this.h3 | 0, p = l, u = this.h4 | 0, d = u;
     for (let w = 0; w < 5; w++) {
-      const b = 4 - w, m = Uh[w], v = Oh[w], I = zs[w], P = qs[w], S = Th[w], _ = kh[w];
+      const b = 4 - w, m = Uh[w], v = Oh[w], I = js[w], P = zs[w], S = Th[w], _ = kh[w];
       for (let O = 0; O < 16; O++) {
-        const z = Ee(r + Ni(w, i, a, l) + Er[I[O]] + m, S[O]) + u | 0;
+        const z = Ee(r + _i(w, i, a, l) + Er[I[O]] + m, S[O]) + u | 0;
         r = u, u = l, l = Ee(a, 10) | 0, a = i, i = z;
       }
       for (let O = 0; O < 16; O++) {
-        const z = Ee(n + Ni(b, o, f, p) + Er[P[O]] + v, _[O]) + d | 0;
+        const z = Ee(n + _i(b, o, f, p) + Er[P[O]] + v, _[O]) + d | 0;
         n = d, d = p, p = Ee(f, 10) | 0, f = o, o = z;
       }
     }
@@ -2762,9 +2762,9 @@ var Er = /* @__PURE__ */ new Uint32Array(16), Ph = class extends Gn {
   destroy() {
     this.destroyed = !0, Te(this.buffer), this.set(0, 0, 0, 0, 0);
   }
-}, Xs = /* @__PURE__ */ Wn(() => new Ph());
+}, Ys = /* @__PURE__ */ Fn(() => new Ph());
 function xh(e) {
-  return Xs(e);
+  return Ys(e);
 }
 function Bh(e) {
   return Ih(e);
@@ -2773,7 +2773,7 @@ function It(e) {
   return Ke(e);
 }
 function St(e) {
-  return Xs(Ke(e));
+  return Ys(Ke(e));
 }
 function le(e) {
   return Ke(Ke(e));
@@ -2788,7 +2788,7 @@ var _h = [
   "TapTweak",
   "KeyAgg list",
   "KeyAgg coefficient"
-], Zs = {
+], Xs = {
   "BIP0340/challenge": new Uint8Array([
     123,
     181,
@@ -3385,11 +3385,11 @@ var _h = [
   ])
 };
 function lr(e, t) {
-  return It(Bt([Zs[e], t]));
+  return It(Bt([Xs[e], t]));
 }
 var Rh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  TAGGED_HASH_PREFIXES: Zs,
+  TAGGED_HASH_PREFIXES: Xs,
   TAGS: _h,
   hash160: St,
   hash256: le,
@@ -3397,7 +3397,7 @@ var Rh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   sha1: Bh,
   sha256: It,
   taggedHash: lr
-}, Symbol.toStringTag, { value: "Module" })), Qs = {
+}, Symbol.toStringTag, { value: "Module" })), Zs = {
   p: 115792089237316195423570985008687907853269984665640564039457584007908834671663n,
   n: 115792089237316195423570985008687907852837564279074904382605163141518161494337n,
   h: 1n,
@@ -3405,29 +3405,29 @@ var Rh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   b: 7n,
   Gx: 55066263022277343669578718895168534326250603453777594175500187360389116729240n,
   Gy: 32670510020758816978083085130507043184471273380659243275938904335757337482424n
-}, { p: Se, n: Nh, Gx: Hh, Gy: Lh, b: Js } = Qs, Pn = 32, ti = 64, Ch = {
-  publicKey: Pn + 1,
-  publicKeyUncompressed: ti + 1
+}, { p: Se, n: Nh, Gx: Hh, Gy: Lh, b: Qs } = Zs, Ri = 32, Js = 64, Ch = {
+  publicKey: 33,
+  publicKeyUncompressed: 65
 }, Vh = (...e) => {
   "captureStackTrace" in Error && typeof Error.captureStackTrace == "function" && Error.captureStackTrace(...e);
 }, xt = (e = "") => {
   const t = new Error(e);
   throw Vh(t, xt), t;
-}, $h = (e) => typeof e == "bigint", Kh = (e) => typeof e == "string", Dh = (e) => e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array", ei = (e, t, r = "") => {
+}, $h = (e) => typeof e == "bigint", Kh = (e) => typeof e == "string", Dh = (e) => e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array", Jn = (e, t, r = "") => {
   const n = Dh(e), i = e?.length, o = t !== void 0;
   if (!n || o && i !== t) {
     const a = r && `"${r}" `, f = o ? ` of length ${t}` : "", l = n ? `length=${i}` : `type=${typeof e}`;
     xt(a + "expected Uint8Array" + f + ", got " + l);
   }
   return e;
-}, to = (e) => new Uint8Array(e), eo = (e, t) => e.toString(16).padStart(t, "0"), ro = (e) => Array.from(ei(e)).map((t) => eo(t, 2)).join(""), Jt = {
+}, to = (e) => new Uint8Array(e), eo = (e, t) => e.toString(16).padStart(t, "0"), ro = (e) => Array.from(Jn(e)).map((t) => eo(t, 2)).join(""), Jt = {
   _0: 48,
   _9: 57,
   A: 65,
   F: 70,
   a: 97,
   f: 102
-}, Hi = (e) => {
+}, Ni = (e) => {
   if (e >= Jt._0 && e <= Jt._9) return e - Jt._0;
   if (e >= Jt.A && e <= Jt.F) return e - (Jt.A - 10);
   if (e >= Jt.a && e <= Jt.f) return e - (Jt.a - 10);
@@ -3438,13 +3438,13 @@ var Rh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   if (r % 2) return xt(t);
   const i = to(n);
   for (let o = 0, a = 0; o < n; o++, a += 2) {
-    const f = Hi(e.charCodeAt(a)), l = Hi(e.charCodeAt(a + 1));
+    const f = Ni(e.charCodeAt(a)), l = Ni(e.charCodeAt(a + 1));
     if (f === void 0 || l === void 0) return xt(t);
     i[o] = f * 16 + l;
   }
   return i;
-}, Li = (...e) => {
-  const t = to(e.reduce((n, i) => n + ei(i).length, 0));
+}, Hi = (...e) => {
+  const t = to(e.reduce((n, i) => n + Jn(i).length, 0));
   let r = 0;
   return e.forEach((n) => {
     t.set(n, r), r += n.length;
@@ -3460,7 +3460,7 @@ var Rh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     n = r, r = f, i = o, o = l;
   }
   return n === 1n ? N(i, t) : xt("no inverse");
-}, pn = (e) => e instanceof Ge ? e : xt("Point expected"), io = (e) => N(N(e * e) * e + Js), Ci = (e) => tn(e, 0n, Se), Pr = (e) => tn(e, 1n, Se), Fh = (e) => tn(e, 1n, Nh), xn = (e) => (e & 1n) === 0n, so = (e) => Uint8Array.of(e), Wh = (e) => so(xn(e) ? 2 : 3), Gh = (e) => {
+}, pn = (e) => e instanceof Ge ? e : xt("Point expected"), io = (e) => N(N(e * e) * e + Qs), Li = (e) => tn(e, 0n, Se), Pr = (e) => tn(e, 1n, Se), Fh = (e) => tn(e, 1n, Nh), Pn = (e) => (e & 1n) === 0n, so = (e) => Uint8Array.of(e), Wh = (e) => so(Pn(e) ? 2 : 3), Gh = (e) => {
   const t = io(Pr(e));
   let r = 1n;
   for (let n = t, i = (Se + 1n) / 4n; i > 0n; i >>= 1n) i & 1n && (r = r * n % Se), n = n * n % Se;
@@ -3472,26 +3472,26 @@ var Rh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   Y;
   Z;
   constructor(t, r, n) {
-    this.X = Ci(t), this.Y = Pr(r), this.Z = Ci(n), Object.freeze(this);
+    this.X = Li(t), this.Y = Pr(r), this.Z = Li(n), Object.freeze(this);
   }
   static CURVE() {
-    return Qs;
+    return Zs;
   }
   static fromAffine(t) {
     const { x: r, y: n } = t;
     return r === 0n && n === 0n ? me : new be(r, n, 1n);
   }
   static fromBytes(t) {
-    ei(t);
+    Jn(t);
     const { publicKey: r, publicKeyUncompressed: n } = Ch;
     let i;
-    const o = t.length, a = t[0], f = t.subarray(1), l = Vi(f, 0, Pn);
+    const o = t.length, a = t[0], f = t.subarray(1), l = Ci(f, 0, Ri);
     if (o === r && (a === 2 || a === 3)) {
       let p = Gh(l);
-      const u = xn(p);
-      xn(Hr(a)) !== u && (p = N(-p)), i = new be(l, p, 1n);
+      const u = Pn(p);
+      Pn(Hr(a)) !== u && (p = N(-p)), i = new be(l, p, 1n);
     }
-    return o === n && a === 4 && (i = new be(l, Vi(f, Pn, ti), 1n)), i ? i.assertValidity() : xt("bad point: not on curve");
+    return o === n && a === 4 && (i = new be(l, Ci(f, Ri, Js), 1n)), i ? i.assertValidity() : xt("bad point: not on curve");
   }
   static fromHex(t) {
     return be.fromBytes(no(t));
@@ -3516,7 +3516,7 @@ var Rh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     return this.add(this);
   }
   add(t) {
-    const { X: r, Y: n, Z: i } = this, { X: o, Y: a, Z: f } = pn(t), l = 0n, p = Js;
+    const { X: r, Y: n, Z: i } = this, { X: o, Y: a, Z: f } = pn(t), l = 0n, p = Qs;
     let u = 0n, d = 0n, w = 0n;
     const b = N(p * 3n);
     let m = N(r * o), v = N(n * a), I = N(i * f), P = N(r + n), S = N(o + a);
@@ -3559,8 +3559,8 @@ var Rh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     return Pr(t), Pr(r), N(r * r) === io(t) ? this : xt("bad point: not on curve");
   }
   toBytes(t = !0) {
-    const { x: r, y: n } = this.assertValidity().toAffine(), i = $i(r);
-    return t ? Li(Wh(n), i) : Li(so(4), i, $i(n));
+    const { x: r, y: n } = this.assertValidity().toAffine(), i = Vi(r);
+    return t ? Hi(Wh(n), i) : Hi(so(4), i, Vi(n));
   }
   toHex(t) {
     return ro(this.toBytes(t));
@@ -3568,38 +3568,38 @@ var Rh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
 }, ar = new Ge(Hh, Lh, 1n), me = new Ge(0n, 1n, 0n);
 Ge.BASE = ar;
 Ge.ZERO = me;
-var jh = (e) => Hr("0x" + (ro(e) || "0")), Vi = (e, t, r) => jh(e.subarray(t, r)), zh = 2n ** 256n, $i = (e) => no(eo(tn(e, 0n, zh), ti)), Lr = 8, oo = Math.ceil(256 / Lr) + 1, Bn = 2 ** (Lr - 1), qh = () => {
+var jh = (e) => Hr("0x" + (ro(e) || "0")), Ci = (e, t, r) => jh(e.subarray(t, r)), zh = 2n ** 256n, Vi = (e) => no(eo(tn(e, 0n, zh), Js)), Lr = 8, oo = Math.ceil(256 / Lr) + 1, xn = 2 ** (Lr - 1), qh = () => {
   const e = [];
   let t = ar, r = t;
   for (let n = 0; n < oo; n++) {
     r = t, e.push(r);
-    for (let i = 1; i < Bn; i++) r = r.add(t), e.push(r);
+    for (let i = 1; i < xn; i++) r = r.add(t), e.push(r);
     t = r.double();
   }
   return e;
-}, Ki, Di = (e, t) => {
+}, $i, Ki = (e, t) => {
   const r = t.negate();
   return e ? r : t;
 }, Yh = (e) => {
-  const t = Ki || (Ki = qh());
+  const t = $i || ($i = qh());
   let r = me, n = ar;
   const i = 2 ** Lr, o = i, a = Hr(i - 1), f = Hr(Lr);
   for (let l = 0; l < oo; l++) {
     let p = Number(e & a);
-    e >>= f, p > Bn && (p -= o, e += 1n);
-    const u = l * Bn, d = u, w = u + Math.abs(p) - 1, b = l % 2 !== 0, m = p < 0;
-    p === 0 ? n = n.add(Di(b, t[d])) : r = r.add(Di(m, t[w]));
+    e >>= f, p > xn && (p -= o, e += 1n);
+    const u = l * xn, d = u, w = u + Math.abs(p) - 1, b = l % 2 !== 0, m = p < 0;
+    p === 0 ? n = n.add(Ki(b, t[d])) : r = r.add(Ki(m, t[w]));
   }
   return e !== 0n && xt("invalid wnaf"), {
     p: r,
     f: n
   };
 }, Ce = (e) => e.length === 32 ? e : e.subarray(1, 33);
-function Mi(e) {
+function Di(e) {
   let t = e.toString(16);
   return t = t.padStart(64, "0"), t.length > 64 && (t = t.slice(-64)), Mt(t);
 }
-function _n(e) {
+function Bn(e) {
   if (e.length === 32) return;
   if (![33, 65].includes(e.length)) {
     console.warn(`Unsupported key length=${e.length}. Must be 33 (compressed) or 65 (uncompressed).`);
@@ -3611,7 +3611,7 @@ function _n(e) {
   } catch (a) {
     throw new Error("Invalid secp256k1 public key bytes. Cannot parse.", { cause: a });
   }
-  const r = Mi(t.x), n = Mi(t.y), i = t.y % 2n === 0n ? 6 : 7, o = Et(65);
+  const r = Di(t.x), n = Di(t.y), i = t.y % 2n === 0n ? 6 : 7, o = Et(65);
   return o[0] = i, o.set(r, 1), o.set(n, 33), {
     hybrid: o,
     uncompressed: Bt([
@@ -3732,7 +3732,7 @@ var he = j, ao = class Je {
   #U() {
     if (!this.#T) {
       if (this.#e) {
-        const t = new Uint8Array(zn(this.#e));
+        const t = new Uint8Array(jn(this.#e));
         this.#A = {
           version: t[0],
           hash: t.subarray(1)
@@ -3750,7 +3750,7 @@ var he = j, ao = class Je {
     const t = this.hash;
     if (!t) return;
     const r = Et(21);
-    return r[0] = this.#t.pubKeyHash, r.set(t, 1), jn(r);
+    return r[0] = this.#t.pubKeyHash, r.set(t, 1), Gn(r);
   }
   #B() {
     if (this.#s) return this.#s;
@@ -3789,7 +3789,7 @@ var he = j, ao = class Je {
     if (!this.#r || !this.#n) return;
     let t = this.#r;
     if (this.#h || this.#f) {
-      const r = _n(this.#r);
+      const r = Bn(this.#r);
       r && (this.#f ? t = r.uncompressed : t = r.hybrid);
     }
     return gt([this.#n, t]);
@@ -3820,7 +3820,7 @@ var he = j, ao = class Je {
       const r = St(this.#r);
       let n = t.length > 0 && !x(t, r);
       if (n && (this.#r.length === 33 && (this.#r[0] === 2 || this.#r[0] === 3) || this.#r.length === 65 && this.#r[0] === 4)) {
-        const i = _n(this.#r);
+        const i = Bn(this.#r);
         if (i) {
           const o = St(i.uncompressed);
           if (x(t, o)) n = !1, this.#f = !0;
@@ -3959,7 +3959,7 @@ var Ye = j, ho = class tr {
   #k() {
     if (!this.#I) {
       if (this.#e) {
-        const t = new Uint8Array(zn(this.#e));
+        const t = new Uint8Array(jn(this.#e));
         this.#v = {
           version: t[0],
           hash: t.subarray(1)
@@ -3993,7 +3993,7 @@ var Ye = j, ho = class tr {
     const t = this.hash;
     if (!t) return;
     const r = Et(21);
-    return r[0] = this.#t.scriptHash, r.set(t, 1), jn(r);
+    return r[0] = this.#t.scriptHash, r.set(t, 1), Gn(r);
   }
   #x() {
     if (this.#s) return this.#s;
@@ -4031,7 +4031,7 @@ var Ye = j, ho = class tr {
       const r = et(t.output);
       if (!r || r.length < 1) throw new TypeError("Redeem.output too short");
       if (t.output.byteLength > 520) throw new TypeError("Redeem.output unspendable if larger than 520 bytes");
-      if (Zn(r) > 201) throw new TypeError("Redeem.output unspendable with more than 201 non-push ops");
+      if (Xn(r) > 201) throw new TypeError("Redeem.output unspendable with more than 201 non-push ops");
     }
     if (t.input) {
       const r = t.input.length > 0, n = t.witness && t.witness.length > 0;
@@ -4106,13 +4106,13 @@ function Xh(e) {
   if (t % 2 !== 0) throw new TypeError("fromHexInternal: odd-length hex string");
   const r = new Uint8Array(t / 2);
   for (let n = 0; n < t; n += 2) {
-    const i = Fi(e.charCodeAt(n)), o = Fi(e.charCodeAt(n + 1));
+    const i = Mi(e.charCodeAt(n)), o = Mi(e.charCodeAt(n + 1));
     if (i === -1 || o === -1) throw new TypeError("fromHexInternal: invalid hex character");
     r[n >> 1] = i << 4 | o;
   }
   return r;
 }
-function Fi(e) {
+function Mi(e) {
   return e >= 48 && e <= 57 ? e - 48 : e >= 65 && e <= 70 ? e - 55 : e >= 97 && e <= 102 ? e - 87 : -1;
 }
 function Ut(e, t) {
@@ -4120,7 +4120,7 @@ function Ut(e, t) {
   for (let r = 0; r < e.length; r++) if (e[r] !== t[r]) return !1;
   return !0;
 }
-function ri(e) {
+function ti(e) {
   return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
 }
 function Oe(e, t = "") {
@@ -4130,7 +4130,7 @@ function Oe(e, t = "") {
   }
 }
 function ut(e, t, r = "") {
-  const n = ri(e), i = e?.length, o = t !== void 0;
+  const n = ti(e), i = e?.length, o = t !== void 0;
   if (!n || o && i !== t) {
     const a = r && `"${r}" `, f = o ? ` of length ${t}` : "", l = n ? `length=${i}` : `type=${typeof e}`;
     throw new Error(a + "expected Uint8Array" + f + ", got " + l);
@@ -4174,7 +4174,7 @@ var te = {
   a: 97,
   f: 102
 };
-function Wi(e) {
+function Fi(e) {
   if (e >= te._0 && e <= te._9) return e - te._0;
   if (e >= te.A && e <= te.F) return e - (te.A - 10);
   if (e >= te.a && e <= te.f) return e - (te.a - 10);
@@ -4186,7 +4186,7 @@ function $r(e) {
   if (t % 2) throw new Error("hex string expected, got unpadded hex of length " + t);
   const n = new Uint8Array(r);
   for (let i = 0, o = 0; i < r; i++, o += 2) {
-    const a = Wi(e.charCodeAt(o)), f = Wi(e.charCodeAt(o + 1));
+    const a = Fi(e.charCodeAt(o)), f = Fi(e.charCodeAt(o + 1));
     if (a === void 0 || f === void 0) {
       const l = e[o] + e[o + 1];
       throw new Error('hex string expected, got non-hex character "' + l + '" at index ' + o);
@@ -4481,7 +4481,7 @@ function hu(e) {
   };
 }
 hu("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
-var ni = /* @__PURE__ */ BigInt(0), Rn = /* @__PURE__ */ BigInt(1);
+var ei = /* @__PURE__ */ BigInt(0), _n = /* @__PURE__ */ BigInt(1);
 function Kr(e, t = "") {
   if (typeof e != "boolean") {
     const r = t && `"${t}" `;
@@ -4501,7 +4501,7 @@ function Ir(e) {
 }
 function po(e) {
   if (typeof e != "string") throw new Error("hex string expected, got " + typeof e);
-  return e === "" ? ni : BigInt("0x" + e);
+  return e === "" ? ei : BigInt("0x" + e);
 }
 function rn(e) {
   return po(en(e));
@@ -4509,19 +4509,19 @@ function rn(e) {
 function wo(e) {
   return po(en(uu(ut(e)).reverse()));
 }
-function ii(e, t) {
+function ri(e, t) {
   Oe(t), e = lo(e);
   const r = $r(e.toString(16).padStart(t * 2, "0"));
   if (r.length !== t) throw new Error("number too large");
   return r;
 }
 function go(e, t) {
-  return ii(e, t).reverse();
+  return ri(e, t).reverse();
 }
 function uu(e) {
   return Uint8Array.from(e);
 }
-var xr = (e) => typeof e == "bigint" && ni <= e;
+var xr = (e) => typeof e == "bigint" && ei <= e;
 function fu(e, t, r) {
   return xr(e) && xr(t) && xr(r) && t <= e && e < r;
 }
@@ -4530,10 +4530,10 @@ function cu(e, t, r, n) {
 }
 function lu(e) {
   let t;
-  for (t = 0; e > ni; e >>= Rn, t += 1) ;
+  for (t = 0; e > ei; e >>= _n, t += 1) ;
   return t;
 }
-var si = (e) => (Rn << BigInt(e)) - Rn;
+var ni = (e) => (_n << BigInt(e)) - _n;
 function pu(e, t, r) {
   if (Oe(e, "hashLen"), Oe(t, "qByteLen"), typeof r != "function") throw new Error("hmacFn must be a function");
   const n = (v) => new Uint8Array(v), i = Uint8Array.of(), o = Uint8Array.of(0), a = Uint8Array.of(1), f = 1e3;
@@ -4560,7 +4560,7 @@ function pu(e, t, r) {
     return d(), P;
   };
 }
-function oi(e, t = {}, r = {}) {
+function ii(e, t = {}, r = {}) {
   if (!e || typeof e != "object") throw new Error("expected valid options object");
   function n(o, a, f) {
     const l = e[o];
@@ -4571,7 +4571,7 @@ function oi(e, t = {}, r = {}) {
   const i = (o, a) => Object.entries(o).forEach(([f, l]) => n(f, l, a));
   i(t, !1), i(r, !0);
 }
-function Gi(e) {
+function Wi(e) {
   const t = /* @__PURE__ */ new WeakMap();
   return (r, ...n) => {
     const i = t.get(r);
@@ -4590,7 +4590,7 @@ function Rt(e, t, r) {
   for (; t-- > Ot; ) n *= n, n %= r;
   return n;
 }
-function ji(e, t) {
+function Gi(e, t) {
   if (e === Ot) throw new Error("invert: expected non-zero number");
   if (t <= Ot) throw new Error("invert: expected positive modulus, got " + t);
   let r = Dt(e, t), n = t, i = Ot, o = Tt;
@@ -4601,16 +4601,16 @@ function ji(e, t) {
   if (n !== Tt) throw new Error("invert: does not exist");
   return Dt(i, t);
 }
-function ai(e, t, r) {
+function si(e, t, r) {
   if (!e.eql(e.sqr(t), r)) throw new Error("Cannot find square root");
 }
 function Io(e, t) {
   const r = (e.ORDER + Tt) / bo, n = e.pow(t, r);
-  return ai(e, n, t), n;
+  return si(e, n, t), n;
 }
 function gu(e, t) {
   const r = (e.ORDER - mo) / Eo, n = e.mul(t, ve), i = e.pow(n, r), o = e.mul(t, i), a = e.mul(e.mul(o, ve), i), f = e.mul(o, e.sub(a, e.ONE));
-  return ai(e, f, t), f;
+  return si(e, f, t), f;
 }
 function yu(e) {
   const t = nn(e), r = Ao(e), n = r(t, t.neg(t.ONE)), i = r(t, n), o = r(t, t.neg(n)), a = (e + du) / vo;
@@ -4619,7 +4619,7 @@ function yu(e) {
     const d = f.mul(p, i), w = f.mul(p, o), b = f.eql(f.sqr(u), l), m = f.eql(f.sqr(d), l);
     p = f.cmov(p, u, b), u = f.cmov(w, d, m);
     const v = f.eql(f.sqr(u), l), I = f.cmov(p, u, v);
-    return ai(f, I, l), I;
+    return si(f, I, l), I;
   };
 }
 function Ao(e) {
@@ -4628,13 +4628,13 @@ function Ao(e) {
   for (; t % ve === Ot; ) t /= ve, r++;
   let n = ve;
   const i = nn(e);
-  for (; zi(i, n) === 1; ) if (n++ > 1e3) throw new Error("Cannot find square root: probably non-prime P");
+  for (; ji(i, n) === 1; ) if (n++ > 1e3) throw new Error("Cannot find square root: probably non-prime P");
   if (r === 1) return Io;
   let o = i.pow(n, t);
   const a = (t + Tt) / ve;
   return function(f, l) {
     if (f.is0(l)) return l;
-    if (zi(f, l) !== 1) throw new Error("Cannot find square root");
+    if (ji(f, l) !== 1) throw new Error("Cannot find square root");
     let p = r, u = f.mul(f.ONE, o), d = f.pow(l, t), w = f.pow(l, a);
     for (; !f.eql(d, f.ONE); ) {
       if (f.is0(d)) return f.ZERO;
@@ -4669,7 +4669,7 @@ var mu = [
   "sqrN"
 ];
 function Eu(e) {
-  return oi(e, mu.reduce((t, r) => (t[r] = "function", t), {
+  return ii(e, mu.reduce((t, r) => (t[r] = "function", t), {
     ORDER: "bigint",
     BYTES: "number",
     BITS: "number"
@@ -4687,7 +4687,7 @@ function So(e, t, r = !1) {
   const n = new Array(t.length).fill(r ? e.ZERO : void 0), i = t.reduce((a, f, l) => e.is0(f) ? a : (n[l] = a, e.mul(a, f)), e.ONE), o = e.inv(i);
   return t.reduceRight((a, f, l) => e.is0(f) ? a : (n[l] = e.mul(a, n[l]), e.mul(a, f)), o), n;
 }
-function zi(e, t) {
+function ji(e, t) {
   const r = (e.ORDER - Tt) / ve, n = e.pow(t, r), i = e.eql(n, e.ONE), o = e.eql(n, e.ZERO), a = e.eql(n, e.neg(e.ONE));
   if (!i && !o && !a) throw new Error("invalid Legendre symbol result");
   return i ? 1 : o ? 0 : -1;
@@ -4756,7 +4756,7 @@ var Au = class {
     return vu(this, e, t);
   }
   div(e, t) {
-    return Dt(e * ji(t, this.ORDER), this.ORDER);
+    return Dt(e * Gi(t, this.ORDER), this.ORDER);
   }
   sqrN(e) {
     return e * e;
@@ -4771,13 +4771,13 @@ var Au = class {
     return e * t;
   }
   inv(e) {
-    return ji(e, this.ORDER);
+    return Gi(e, this.ORDER);
   }
   sqrt(e) {
     return this._sqrt || (this._sqrt = bu(this.ORDER)), this._sqrt(this, e);
   }
   toBytes(e) {
-    return this.isLE ? go(e, this.BYTES) : ii(e, this.BYTES);
+    return this.isLE ? go(e, this.BYTES) : ri(e, this.BYTES);
   }
   fromBytes(e, t = !1) {
     ut(e);
@@ -4816,14 +4816,14 @@ function Su(e, t, r = !1) {
   const n = e.length, i = To(t), o = ko(t);
   if (n < 16 || n < o || n > 1024) throw new Error("expected " + o + "-1024 bytes of input, got " + n);
   const a = Dt(r ? wo(e) : rn(e), t - Tt) + Tt;
-  return r ? go(a, i) : ii(a, i);
+  return r ? go(a, i) : ri(a, i);
 }
 var Me = /* @__PURE__ */ BigInt(0), Ie = /* @__PURE__ */ BigInt(1);
 function Dr(e, t) {
   const r = t.negate();
   return e ? r : t;
 }
-function qi(e, t) {
+function zi(e, t) {
   const r = So(e.Fp, t.map((n) => n.Z));
   return t.map((n, i) => e.fromAffine(n.toAffine(r[i])));
 }
@@ -4836,12 +4836,12 @@ function wn(e, t) {
   return {
     windows: r,
     windowSize: n,
-    mask: si(e),
+    mask: ni(e),
     maxNumber: i,
     shiftBy: BigInt(e)
   };
 }
-function Yi(e, t, r) {
+function qi(e, t, r) {
   const { windowSize: n, mask: i, maxNumber: o, shiftBy: a } = r;
   let f = Number(e & i), l = e >> a;
   f > n && (f -= o, l += Ie);
@@ -4859,7 +4859,7 @@ var gn = /* @__PURE__ */ new WeakMap(), Oo = /* @__PURE__ */ new WeakMap();
 function yn(e) {
   return Oo.get(e) || 1;
 }
-function Xi(e) {
+function Yi(e) {
   if (e !== Me) throw new Error("invalid wNAF");
 }
 var Tu = class {
@@ -4890,10 +4890,10 @@ var Tu = class {
     let n = this.ZERO, i = this.BASE;
     const o = wn(e, this.bits);
     for (let a = 0; a < o.windows; a++) {
-      const { nextN: f, offset: l, isZero: p, isNeg: u, isNegF: d, offsetF: w } = Yi(r, a, o);
+      const { nextN: f, offset: l, isZero: p, isNeg: u, isNegF: d, offsetF: w } = qi(r, a, o);
       r = f, p ? i = i.add(Dr(d, t[w])) : n = n.add(Dr(u, t[l]));
     }
-    return Xi(r), {
+    return Yi(r), {
       p: n,
       f: i
     };
@@ -4901,13 +4901,13 @@ var Tu = class {
   wNAFUnsafe(e, t, r, n = this.ZERO) {
     const i = wn(e, this.bits);
     for (let o = 0; o < i.windows && r !== Me; o++) {
-      const { nextN: a, offset: f, isZero: l, isNeg: p } = Yi(r, o, i);
+      const { nextN: a, offset: f, isZero: l, isNeg: p } = qi(r, o, i);
       if (r = a, !l) {
         const u = t[f];
         n = n.add(p ? u.negate() : u);
       }
     }
-    return Xi(r), n;
+    return Yi(r), n;
   }
   getPrecomputes(e, t, r) {
     let n = gn.get(t);
@@ -4936,7 +4936,7 @@ function ku(e, t, r, n) {
     p2: a
   };
 }
-function Zi(e, t, r) {
+function Xi(e, t, r) {
   if (t) {
     if (t.ORDER !== e) throw new Error("Field.ORDER must match order: Fp == p, Fn == n");
     return Eu(t), t;
@@ -4952,7 +4952,7 @@ function Uu(e, t, r = {}, n) {
     const f = t[a];
     if (!(typeof f == "bigint" && f > Me)) throw new Error(`CURVE.${a} must be positive bigint`);
   }
-  const i = Zi(t.p, r.Fp, n), o = Zi(t.n, r.Fn, n);
+  const i = Xi(t.p, r.Fp, n), o = Xi(t.n, r.Fn, n);
   for (const a of [
     "Gx",
     "Gy",
@@ -5014,13 +5014,13 @@ var Po = class {
   }
 }, xo = (e, t, r) => new Po(e, t).update(r).digest();
 xo.create = (e, t) => new Po(e, t);
-var Qi = (e, t) => (e + (e >= 0 ? t : -t) / Bo) / t;
+var Zi = (e, t) => (e + (e >= 0 ? t : -t) / Bo) / t;
 function Pu(e, t, r) {
-  const [[n, i], [o, a]] = t, f = Qi(a * e, r), l = Qi(-i * e, r);
+  const [[n, i], [o, a]] = t, f = Zi(a * e, r), l = Zi(-i * e, r);
   let p = e - f * n - l * o, u = -f * i - l * a;
   const d = p < re, w = u < re;
   d && (p = -p), w && (u = -u);
-  const b = si(Math.ceil(lu(r) / 2)) + Ve;
+  const b = ni(Math.ceil(lu(r) / 2)) + Ve;
   if (p < re || p >= b || u < re || u >= b) throw new Error("splitScalar (endomorphism): failed, k=" + e);
   return {
     k1neg: d,
@@ -5029,7 +5029,7 @@ function Pu(e, t, r) {
     k2: u
   };
 }
-function Nn(e) {
+function Rn(e) {
   if (![
     "compact",
     "recovered",
@@ -5040,7 +5040,7 @@ function Nn(e) {
 function bn(e, t) {
   const r = {};
   for (let n of Object.keys(t)) r[n] = e[n] === void 0 ? t[n] : e[n];
-  return Kr(r.lowS, "lowS"), Kr(r.prehash, "prehash"), r.format !== void 0 && Nn(r.format), r;
+  return Kr(r.lowS, "lowS"), Kr(r.prehash, "prehash"), r.format !== void 0 && Rn(r.format), r;
 }
 var xu = class extends Error {
   constructor(e = "") {
@@ -5118,7 +5118,7 @@ function _u(e, t = {}) {
   const r = Uu("weierstrass", e, t), { Fp: n, Fn: i } = r;
   let o = r.CURVE;
   const { h: a, n: f } = o;
-  oi(t, {}, {
+  ii(t, {}, {
     allowInfinityPoint: "boolean",
     clearCofactor: "function",
     isTorsionFree: "function",
@@ -5188,7 +5188,7 @@ function _u(e, t = {}) {
     if (!l || !l.basises) throw new Error("no endo");
     return Pu(Y, l.basises, i.ORDER);
   }
-  const D = Gi((Y, U) => {
+  const D = Wi((Y, U) => {
     const { X: T, Y: A, Z: B } = Y;
     if (n.eql(B, n.ONE)) return {
       x: T,
@@ -5206,7 +5206,7 @@ function _u(e, t = {}) {
       x: $,
       y: C
     };
-  }), X = Gi((Y) => {
+  }), X = Wi((Y) => {
     if (Y.is0()) {
       if (t.allowInfinityPoint && !n.is0(Y.Y)) return;
       throw new Error("bad point: ZERO");
@@ -5297,7 +5297,7 @@ function _u(e, t = {}) {
       const { endo: T } = t;
       if (!i.isValidNot0(U)) throw new Error("invalid scalar: out of range");
       let A, B;
-      const V = ($) => Qt.cached(this, $, (C) => qi(q, C));
+      const V = ($) => Qt.cached(this, $, (C) => zi(q, C));
       if (T) {
         const { k1neg: $, k1: C, k2neg: L, k2: M } = z(U), { p: F, f: ct } = V(C), { p: W, f: K } = V(M);
         B = ct.add(K), A = at(T.beta, F, W, $, L);
@@ -5305,7 +5305,7 @@ function _u(e, t = {}) {
         const { p: $, f: C } = V(U);
         A = $, B = C;
       }
-      return qi(q, [A, B])[0];
+      return zi(q, [A, B])[0];
     }
     multiplyUnsafe(U) {
       const { endo: T } = t, A = this;
@@ -5384,7 +5384,7 @@ function Ru(e, t = {}) {
   }
   function p(b) {
     const { secretKey: m, publicKey: v, publicKeyUncompressed: I } = i;
-    if (!ri(b) || "_lengths" in r && r._lengths || m === v) return;
+    if (!ti(b) || "_lengths" in r && r._lengths || m === v) return;
     const P = ut(b, void 0, "key").length;
     return P === v || P === I;
   }
@@ -5409,7 +5409,7 @@ function Ru(e, t = {}) {
   });
 }
 function Nu(e, t, r = {}) {
-  uo(t), oi(r, {}, {
+  uo(t), ii(r, {}, {
     hmac: "function",
     lowS: "boolean",
     randomBytes: "function",
@@ -5433,7 +5433,7 @@ function Nu(e, t, r = {}) {
     if (v) throw new Error('"recovered" sig type is not supported for cofactor >2 curves');
   }
   function _(T, A) {
-    Nn(A);
+    Rn(A);
     const B = b.signature;
     return ut(T, A === "compact" ? B : A === "recovered" ? B + 1 : void 0);
   }
@@ -5486,7 +5486,7 @@ function Nu(e, t, r = {}) {
       return I(this.s);
     }
     toBytes(A = m.format) {
-      if (Nn(A), A === "der") return $r(de.hexFromSig(this));
+      if (Rn(A), A === "der") return $r(de.hexFromSig(this));
       const { r: B, s: V } = this, $ = a.toBytes(B), C = a.toBytes(V);
       return A === "recovered" ? (S(), we(Uint8Array.of(this.assertRecovery()), $, C)) : we($, C);
     }
@@ -5500,7 +5500,7 @@ function Nu(e, t, r = {}) {
     return B > 0 ? A >> BigInt(B) : A;
   }, D = r.bits2int_modN || function(T) {
     return a.create(z(T));
-  }, X = si(l);
+  }, X = ni(l);
   function at(T) {
     return cu("num < 2^" + l, T, re, X), a.toBytes(T);
   }
@@ -5539,7 +5539,7 @@ function Nu(e, t, r = {}) {
   }
   function Y(T, A, B, V = {}) {
     const { lowS: $, prehash: C, format: L } = bn(V, m);
-    if (B = ut(B, void 0, "publicKey"), A = q(A, C), !ri(T)) {
+    if (B = ut(B, void 0, "publicKey"), A = q(A, C), !ti(T)) {
       const M = T instanceof O ? ", use sig.toBytes()" : "";
       throw new Error("verify expects Uint8Array signature" + M);
     }
@@ -5571,7 +5571,7 @@ function Nu(e, t, r = {}) {
     hash: t
   });
 }
-var hi = {
+var oi = {
   p: BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),
   n: BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),
   h: BigInt(1),
@@ -5582,15 +5582,15 @@ var hi = {
 }, Hu = {
   beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
   basises: [[BigInt("0x3086d221a7d46bcde86c90e49284eb15"), -BigInt("0xe4437ed6010e88286f547fa90abfe4c3")], [BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), BigInt("0x3086d221a7d46bcde86c90e49284eb15")]]
-}, Ji = /* @__PURE__ */ BigInt(2);
+}, Qi = /* @__PURE__ */ BigInt(2);
 function Lu(e) {
-  const t = hi.p, r = BigInt(3), n = BigInt(6), i = BigInt(11), o = BigInt(22), a = BigInt(23), f = BigInt(44), l = BigInt(88), p = e * e * e % t, u = p * p * e % t, d = Rt(Rt(Rt(u, r, t) * u % t, r, t) * u % t, Ji, t) * p % t, w = Rt(d, i, t) * d % t, b = Rt(w, o, t) * w % t, m = Rt(b, f, t) * b % t, v = Rt(Rt(Rt(Rt(Rt(Rt(m, l, t) * m % t, f, t) * b % t, r, t) * u % t, a, t) * w % t, n, t) * p % t, Ji, t);
-  if (!Hn.eql(Hn.sqr(v), e)) throw new Error("Cannot find square root");
+  const t = oi.p, r = BigInt(3), n = BigInt(6), i = BigInt(11), o = BigInt(22), a = BigInt(23), f = BigInt(44), l = BigInt(88), p = e * e * e % t, u = p * p * e % t, d = Rt(Rt(Rt(u, r, t) * u % t, r, t) * u % t, Qi, t) * p % t, w = Rt(d, i, t) * d % t, b = Rt(w, o, t) * w % t, m = Rt(b, f, t) * b % t, v = Rt(Rt(Rt(Rt(Rt(Rt(m, l, t) * m % t, f, t) * b % t, r, t) * u % t, a, t) * w % t, n, t) * p % t, Qi, t);
+  if (!Nn.eql(Nn.sqr(v), e)) throw new Error("Cannot find square root");
   return v;
 }
-var Hn = nn(hi.p, { sqrt: Lu });
-(/* @__PURE__ */ Nu(/* @__PURE__ */ _u(hi, {
-  Fp: Hn,
+var Nn = nn(oi.p, { sqrt: Lu });
+(/* @__PURE__ */ Nu(/* @__PURE__ */ _u(oi, {
+  Fp: Nn,
   endo: Hu
 }), au)).Point.Fn.ORDER;
 function H(e) {
@@ -5612,7 +5612,7 @@ function Cu(e) {
   const o = e.sign(H("5e9f0a0d593efdcf78ac923bc3313e4e7d408d574354ee2b3288c0da9fbba6ed"), H("fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364140"));
   Z(Ut(o, H("54c4a33c6423d689378f160a7ff8b61330444abb58fb470f96ea16d99d4a2fed07082304410efa6b2943111b6a4e0aaa7b7db55a07e9861d1fb3cb1f421044a5")), "sign known vector failed"), Z(e.verify(H("5e9f0a0d593efdcf78ac923bc3313e4e7d408d574354ee2b3288c0da9fbba6ed"), H("0379be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"), o), "verify known vector failed"), e.signSchnorr && Z(Ut(e.signSchnorr(H("7e2d58d8b3bcdf1abadec7829054f90dda9805aab56c77333024b9d0a508b75c"), H("c90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b14e5c9"), H("c87aa53824b4d7ae2eb035a2b5bbbccc080e76cdc6d1692c4b0b62d798e6d906")), H("5831aaeed7b44bb74e5eab94ba9d4294c49bcf2a60728d8b4c200f50dd313c1bab745879a5ad954a72c45a91c3a51d3c7adea98d82f8481e0e1e03674a6f3fb7")), "signSchnorr known vector failed"), e.verifySchnorr && Z(e.verifySchnorr(H("7e2d58d8b3bcdf1abadec7829054f90dda9805aab56c77333024b9d0a508b75c"), H("dd308afec5777e13121fa72b9cc1b7cc0139715309b086c960e18fd969774eb8"), H("5831aaeed7b44bb74e5eab94ba9d4294c49bcf2a60728d8b4c200f50dd313c1bab745879a5ad954a72c45a91c3a51d3c7adea98d82f8481e0e1e03674a6f3fb7")), "verifySchnorr known vector failed");
 }
-var Ln = class Kt {
+var Hn = class Kt {
   static #t;
   #a;
   constructor(t) {
@@ -5637,13 +5637,13 @@ var Ln = class Kt {
 };
 function Wl(e) {
   if (e === void 0) {
-    Ln.clear();
+    Hn.clear();
     return;
   }
-  Ln.init(e);
+  Hn.init(e);
 }
 function Vu() {
-  return Ln.get().lib;
+  return Hn.get().lib;
 }
 var $u = (e) => "left" in e && "right" in e;
 function Mr(e, t) {
@@ -5667,7 +5667,7 @@ function hr(e, t) {
   return n;
 }
 function ur(e) {
-  if (Vs(e)) return { hash: Pt(e) };
+  if (Cs(e)) return { hash: Pt(e) };
   const t = [ur(e[0]), ur(e[1])];
   t.sort((i, o) => De(i.hash, o.hash));
   const r = t[0], n = t[1];
@@ -5707,7 +5707,7 @@ function Du(e) {
   const t = Et(Ct(e.length));
   return ge(e.length, t), Bt([t, e]);
 }
-var ts = j, es = 2, Mu = 80, No = class rr {
+var Ji = j, ts = 2, Mu = 80, No = class rr {
   static NAME = ft.P2MR;
   #t;
   #a;
@@ -5835,7 +5835,7 @@ var ts = j, es = 2, Mu = 80, No = class rr {
     const t = this.hash;
     if (!t) return;
     const r = tt.bech32m.toWords(t);
-    return r.unshift(es), tt.bech32m.encode(this.#t.bech32, r);
+    return r.unshift(ts), tt.bech32m.encode(this.#t.bech32, r);
   }
   #B() {
     if (this.#s) return this.#s;
@@ -5855,7 +5855,7 @@ var ts = j, es = 2, Mu = 80, No = class rr {
   #_() {
     if (this.#n) return this.#n;
     const t = this.hash;
-    if (t) return gt([ts.OP_2, t]);
+    if (t) return gt([Ji.OP_2, t]);
   }
   #R() {
     if (this.#o) return this.#o;
@@ -5890,12 +5890,12 @@ var ts = j, es = 2, Mu = 80, No = class rr {
       const i = this.#P();
       if (!i) throw new TypeError("Invalid address");
       if (this.#t && this.#t.bech32 !== i.prefix) throw new TypeError("Invalid prefix or Network mismatch");
-      if (i.version !== es) throw new TypeError("Invalid address version");
+      if (i.version !== ts) throw new TypeError("Invalid address version");
       if (i.data.length !== 32) throw new TypeError("Invalid address data");
       t = i.data;
     }
     if (this.#n) {
-      if (this.#n.length !== 34 || this.#n[0] !== ts.OP_2 || this.#n[1] !== 32) throw new TypeError("Output is invalid");
+      if (this.#n.length !== 34 || this.#n[0] !== Ji.OP_2 || this.#n[1] !== 32) throw new TypeError("Output is invalid");
       if (t.length > 0 && !x(t, this.#n.subarray(2))) throw new TypeError("Hash mismatch");
       t = this.#n.subarray(2);
     }
@@ -5937,7 +5937,7 @@ var ts = j, es = 2, Mu = 80, No = class rr {
     }
   }
 };
-function ui(e, t) {
+function ai(e, t) {
   if (!e.address && !e.output && !e.hash && !e.scriptTree && !(e.witness && e.witness.length > 1)) throw new TypeError("Not enough data");
   const r = new No({
     address: e.address,
@@ -5951,7 +5951,7 @@ function ui(e, t) {
   }, t);
   return Object.assign(r.toPayment(), e);
 }
-var rs = j, ns = 1, Fu = 80, Ho = class nr {
+var es = j, rs = 1, Fu = 80, Ho = class nr {
   static NAME = ft.P2TR;
   #t;
   #a;
@@ -6102,7 +6102,7 @@ var rs = j, ns = 1, Fu = 80, Ho = class nr {
     const t = this.pubkey;
     if (!t) return;
     const r = tt.bech32m.toWords(t);
-    return r.unshift(ns), tt.bech32m.encode(this.#t.bech32, r);
+    return r.unshift(rs), tt.bech32m.encode(this.#t.bech32, r);
   }
   #K() {
     if (this.#s) return this.#s;
@@ -6142,7 +6142,7 @@ var rs = j, ns = 1, Fu = 80, Ho = class nr {
   #W() {
     if (this.#h) return this.#h;
     const t = this.pubkey;
-    if (t) return gt([rs.OP_1, t]);
+    if (t) return gt([es.OP_1, t]);
   }
   #G() {
     if (this.#u) return this.#u;
@@ -6184,7 +6184,7 @@ var rs = j, ns = 1, Fu = 80, Ho = class nr {
       const i = this.#L();
       if (!i) throw new TypeError("Invalid address");
       if (this.#t && this.#t.bech32 !== i.prefix) throw new TypeError("Invalid prefix or Network mismatch");
-      if (i.version !== ns) throw new TypeError("Invalid address version");
+      if (i.version !== rs) throw new TypeError("Invalid address version");
       if (i.data.length !== 32) throw new TypeError("Invalid address data");
       t = i.data;
     }
@@ -6193,7 +6193,7 @@ var rs = j, ns = 1, Fu = 80, Ho = class nr {
       t = this.#s;
     }
     if (this.#h) {
-      if (this.#h.length !== 34 || this.#h[0] !== rs.OP_1 || this.#h[1] !== 32) throw new TypeError("Output is invalid");
+      if (this.#h.length !== 34 || this.#h[0] !== es.OP_1 || this.#h[1] !== 32) throw new TypeError("Output is invalid");
       if (t.length > 0 && !x(t, this.#h.subarray(2))) throw new TypeError("Pubkey mismatch");
       t = this.#h.subarray(2);
     }
@@ -6259,7 +6259,7 @@ function wr(e, t) {
   }, t);
   return Object.assign(r.toPayment(), e);
 }
-var is = j, Wu = new Uint8Array(0), Lo = class ir {
+var ns = j, Wu = new Uint8Array(0), Lo = class ir {
   static NAME = ft.P2WPKH;
   #t;
   #a;
@@ -6394,7 +6394,7 @@ var is = j, Wu = new Uint8Array(0), Lo = class ir {
   #O() {
     if (this.#i) return this.#i;
     const t = this.hash;
-    if (t) return gt([is.OP_0, t]);
+    if (t) return gt([ns.OP_0, t]);
   }
   #x() {
     if (this.witness) return Wu;
@@ -6418,7 +6418,7 @@ var is = j, Wu = new Uint8Array(0), Lo = class ir {
       t = this.#s;
     }
     if (this.#i) {
-      if (this.#i.length !== 22 || this.#i[0] !== is.OP_0 || this.#i[1] !== 20) throw new TypeError("Output is invalid");
+      if (this.#i.length !== 22 || this.#i[0] !== ns.OP_0 || this.#i[1] !== 20) throw new TypeError("Output is invalid");
       if (t.length > 0 && !x(t, this.#i.subarray(2))) throw new TypeError("Hash mismatch");
       t = this.#i.subarray(2);
     }
@@ -6452,7 +6452,7 @@ function sn(e, t) {
   }, t);
   return Object.assign(r.toPayment(), e);
 }
-var ss = j, mn = new Uint8Array(0);
+var is = j, mn = new Uint8Array(0);
 function Sr(e) {
   return !!(e instanceof Uint8Array && e.length === 65 && e[0] === 4 && ke(e));
 }
@@ -6584,7 +6584,7 @@ var Co = class sr {
   #P() {
     if (this.#r) return this.#r;
     const t = this.hash;
-    if (t) return gt([ss.OP_0, t]);
+    if (t) return gt([is.OP_0, t]);
   }
   #U() {
     if (this.witness) return mn;
@@ -6604,7 +6604,7 @@ var Co = class sr {
       if (t.input && t.input.length > 0 && t.output && t.output.length > 0) {
         const r = this.#A();
         if (r) {
-          const n = Ms(r);
+          const n = Ds(r);
           return this.#c = Object.assign({ witness: n }, t, { input: mn }), this.#y = !0, [].concat(n, t.output);
         }
       }
@@ -6626,7 +6626,7 @@ var Co = class sr {
       t = this.#s;
     }
     if (this.#r) {
-      if (this.#r.length !== 34 || this.#r[0] !== ss.OP_0 || this.#r[1] !== 32) throw new TypeError("Output is invalid");
+      if (this.#r.length !== 34 || this.#r[0] !== is.OP_0 || this.#r[1] !== 32) throw new TypeError("Output is invalid");
       const r = this.#r.subarray(2);
       if (t.length > 0 && !x(t, r)) throw new TypeError("Hash mismatch");
       t = r;
@@ -6638,7 +6638,7 @@ var Co = class sr {
         const n = et(this.#n.output);
         if (!n || n.length < 1) throw new TypeError("Redeem.output is invalid");
         if (this.#n.output.byteLength > 3600) throw new TypeError("Redeem.output unspendable if larger than 3600 bytes");
-        if (Zn(n) > 201) throw new TypeError("Redeem.output unspendable with more than 201 non-push ops");
+        if (Xn(n) > 201) throw new TypeError("Redeem.output unspendable with more than 201 non-push ops");
         const i = It(this.#n.output);
         if (t.length > 0 && !x(t, i)) throw new TypeError("Hash mismatch");
         t = i;
@@ -6666,7 +6666,7 @@ function gr(e, t) {
     network: e.network
   }, t).toPayment();
 }
-var os = j, Vo = class Br {
+var ss = j, Vo = class Br {
   static NAME = ft.P2PK;
   #t;
   #a;
@@ -6755,7 +6755,7 @@ var os = j, Vo = class Br {
   #m() {
     if (this.#r) return this.#r;
     const t = this.#e;
-    if (t) return gt([t, os.OP_CHECKSIG]);
+    if (t) return gt([t, ss.OP_CHECKSIG]);
   }
   #E() {
     if (this.#n) return this.#n;
@@ -6767,7 +6767,7 @@ var os = j, Vo = class Br {
   }
   #I() {
     if (this.#r) {
-      if (this.#r[this.#r.length - 1] !== os.OP_CHECKSIG) throw new TypeError("Output is invalid");
+      if (this.#r[this.#r.length - 1] !== ss.OP_CHECKSIG) throw new TypeError("Output is invalid");
       const t = this.pubkey;
       if (!ke(t)) throw new TypeError("Output pubkey is invalid");
       if (this.#e && t && !x(this.#e, t)) throw new TypeError("Pubkey mismatch");
@@ -6784,7 +6784,7 @@ var os = j, Vo = class Br {
     }
   }
 };
-function fi(e, t) {
+function hi(e, t) {
   if (!e.input && !e.output && !e.pubkey && !e.signature) throw new TypeError("Not enough data");
   const r = new Vo({
     pubkey: e.pubkey,
@@ -6979,7 +6979,7 @@ function Gu(e) {
   const t = e.length;
   return Ct(t) + e.reduce((r, n) => r + Nt(n), 0);
 }
-var ce = new Uint8Array(0), as = [], kr = Mt("0000000000000000000000000000000000000000000000000000000000000000"), hs = Or(Mt("0000000000000000000000000000000000000000000000000000000000000001")), ju = 18446744073709551615n, J = class Q {
+var ce = new Uint8Array(0), os = [], kr = Mt("0000000000000000000000000000000000000000000000000000000000000000"), as = Or(Mt("0000000000000000000000000000000000000000000000000000000000000001")), ju = 18446744073709551615n, J = class Q {
   static DEFAULT_SEQUENCE = 4294967295;
   static SIGHASH_DEFAULT = 0;
   static SIGHASH_ALL = 1;
@@ -7011,7 +7011,7 @@ var ce = new Uint8Array(0), as = [], kr = Mt("0000000000000000000000000000000000
         index: w,
         script: b,
         sequence: m,
-        witness: as
+        witness: os
       });
     }
     const p = n.readVarInt();
@@ -7048,7 +7048,7 @@ var ce = new Uint8Array(0), as = [], kr = Mt("0000000000000000000000000000000000
       index: r,
       script: i || ce,
       sequence: n,
-      witness: as
+      witness: os
     }) - 1;
   }
   addOutput(t, r) {
@@ -7090,7 +7090,7 @@ var ce = new Uint8Array(0), as = [], kr = Mt("0000000000000000000000000000000000
     if (!Number.isInteger(t) || t < 0) throw new TypeError("Expected non-negative integer for inIndex");
     if (!(r instanceof Uint8Array)) throw new TypeError("Expected Uint8Array for prevOutScript");
     if (!Number.isInteger(n)) throw new TypeError("Expected integer for hashType");
-    if (t >= this.ins.length) return hs;
+    if (t >= this.ins.length) return as;
     const i = et(r);
     if (!i) throw new Error("Could not decompile prevOutScript");
     const o = gt(i.filter((l) => l !== j.OP_CODESEPARATOR)), a = this.clone();
@@ -7098,7 +7098,7 @@ var ce = new Uint8Array(0), as = [], kr = Mt("0000000000000000000000000000000000
       p !== t && (l.sequence = 0);
     });
     else if ((n & 31) === Q.SIGHASH_SINGLE) {
-      if (t >= this.outs.length) return hs;
+      if (t >= this.outs.length) return as;
       a.outs.length = t + 1;
       for (let l = 0; l < t; l++) a.outs[l] = {
         script: ce,
@@ -7207,7 +7207,7 @@ var ce = new Uint8Array(0), as = [], kr = Mt("0000000000000000000000000000000000
     return t && this.isCoinbase() ? new Uint8Array(32) : le(this.#t(void 0, void 0, t));
   }
   getId() {
-    return Yt(qn(this.getHash(!1)));
+    return Yt(zn(this.getHash(!1)));
   }
   toBuffer(t, r) {
     return this.#t(t, r, !0);
@@ -7251,7 +7251,7 @@ function ne(e) {
     }
   };
 }
-var qu = ne(yr), Yu = ne(fi), Xu = ne(pr), on = ne(sn), us = ne(gr), Ko = ne(dr), ci = ne(wr), li = ne(ui), Gl = ne(Jn), jl = (e) => e.length === 4 && e[0] === 81 && e[1] === 2 && e[2] === 78 && e[3] === 115;
+var qu = ne(yr), Yu = ne(hi), Xu = ne(pr), on = ne(sn), hs = ne(gr), Ko = ne(dr), ui = ne(wr), fi = ne(ai), Gl = ne(Qn), jl = (e) => e.length === 4 && e[0] === 81 && e[1] === 2 && e[2] === 78 && e[3] === 115;
 function or(e) {
   const t = [];
   function r(a) {
@@ -7272,7 +7272,7 @@ function or(e) {
 function Do(e, t) {
   const r = et(t);
   if (r === null) throw new Error("Unknown script error");
-  const n = St(e), i = Ce(e), o = _n(e), a = o?.hybrid ? St(o.hybrid) : void 0, f = o?.uncompressed ? St(o.uncompressed) : void 0;
+  const n = St(e), i = Ce(e), o = Bn(e), a = o?.hybrid ? St(o.hybrid) : void 0, f = o?.uncompressed ? St(o.uncompressed) : void 0;
   return r.findIndex((l) => typeof l == "number" ? !1 : !!(vr(l, e) || vr(l, i) || x(l, n) || o && (vr(l, o.uncompressed) || vr(l, o.hybrid) || a && x(l, a) || f && x(l, f))));
 }
 function Fr(e, t) {
@@ -7306,7 +7306,7 @@ function Ju(e) {
   const t = e.finalScriptSig ? et(new Uint8Array(e.finalScriptSig)) || [] : [], r = e.finalScriptWitness ? et(new Uint8Array(e.finalScriptWitness)) || [] : [];
   return t.concat(r).filter((n) => n instanceof Uint8Array && xe(n)).map((n) => ({ signature: n }));
 }
-function fs(e, t, r) {
+function us(e, t, r) {
   const n = df(t, e, r);
   try {
     return { finalScriptWitness: or(lf(t, n).concat(new Uint8Array(n.script)).concat(new Uint8Array(n.controlBlock))) };
@@ -7318,18 +7318,18 @@ function Le(e, t) {
   return Bt([e, t ? new Uint8Array([t]) : new Uint8Array(0)]);
 }
 function Lt(e) {
-  return e && !!(e.tapInternalKey || e.tapMerkleRoot || e.tapLeafScript && e.tapLeafScript.length || e.tapBip32Derivation && e.tapBip32Derivation.length || e.witnessUtxo && (ci(new Uint8Array(e.witnessUtxo.script)) || li(new Uint8Array(e.witnessUtxo.script))));
+  return e && !!(e.tapInternalKey || e.tapMerkleRoot || e.tapLeafScript && e.tapLeafScript.length || e.tapBip32Derivation && e.tapBip32Derivation.length || e.witnessUtxo && (ui(new Uint8Array(e.witnessUtxo.script)) || fi(new Uint8Array(e.witnessUtxo.script))));
 }
-function Cn(e) {
-  return !!(e.witnessUtxo && li(new Uint8Array(e.witnessUtxo.script)));
+function Ln(e) {
+  return !!(e.witnessUtxo && fi(new Uint8Array(e.witnessUtxo.script)));
 }
 function En(e, t) {
-  return e && !!(e.tapInternalKey || e.tapTree || e.tapBip32Derivation && e.tapBip32Derivation.length || t && (ci(t) || li(t)));
+  return e && !!(e.tapInternalKey || e.tapTree || e.tapBip32Derivation && e.tapBip32Derivation.length || t && (ui(t) || fi(t)));
 }
-function cs(e, t, r) {
+function fs(e, t, r) {
   uf(e, t, r), cf(e, t, r);
 }
-function ls(e, t, r) {
+function cs(e, t, r) {
   ff(e, t, r), tf(e, t);
 }
 function tf(e, t) {
@@ -7379,19 +7379,19 @@ function af(e) {
 }
 function hf(e) {
   let t;
-  for (const r of e) if (t = Vn(r, t), !t) throw new Error("No room left to insert tapleaf in tree");
+  for (const r of e) if (t = Cn(r, t), !t) throw new Error("No room left to insert tapleaf in tree");
   return t;
 }
-function Vn(e, t, r = 0) {
+function Cn(e, t, r = 0) {
   if (r > 128) throw new Error("Max taptree depth exceeded.");
   if (e.depth === r) return t ? void 0 : {
     output: new Uint8Array(e.script),
     version: e.leafVersion
   };
-  if (Vs(t)) return;
-  const n = Vn(e, t && t[0], r + 1);
+  if (Cs(t)) return;
+  const n = Cn(e, t && t[0], r + 1);
   if (n) return [n, t && t[1]];
-  const i = Vn(e, t && t[1], r + 1);
+  const i = Cn(e, t && t[1], r + 1);
   if (i) return [t && t[0], i];
 }
 function uf(e, t, r) {
@@ -7403,7 +7403,7 @@ function ff(e, t, r) {
   if (n || i || o) throw new Error(`Invalid arguments for Psbt.${r}. Cannot use both taproot and non-taproot fields.`);
 }
 function cf(e, t, r) {
-  const n = Cn(e) || Cn(t);
+  const n = Ln(e) || Ln(t);
   if (t.tapMerkleRoot) {
     const i = new Uint8Array(t.tapMerkleRoot), o = (t.tapLeafScript || []).every((f) => vn(f, i, n)), a = (e.tapLeafScript || []).every((f) => vn(f, i, n));
     if (!o || !a) throw new Error(`Invalid arguments for Psbt.${r}. Tapleaf not part of taptree.`);
@@ -8090,7 +8090,7 @@ function jo(e, t) {
   return Wr(r, i, t.bech32, t.bech32Opnet);
 }
 function zo(e) {
-  const t = new Uint8Array(zn(e));
+  const t = new Uint8Array(jn(e));
   if (t.length < 21) throw new TypeError(e + " is too short");
   if (t.length > 21) throw new TypeError(e + " is too long");
   return {
@@ -8098,11 +8098,11 @@ function zo(e) {
     hash: t.subarray(1)
   };
 }
-function $n(e, t) {
-  if (!Cs(e)) throw new TypeError("Expected 20 bytes hash");
-  if (!Ls(t)) throw new TypeError("Expected UInt8 version");
+function Vn(e, t) {
+  if (!Ls(e)) throw new TypeError("Expected 20 bytes hash");
+  if (!Hs(t)) throw new TypeError("Expected UInt8 version");
   const r = Et(21);
-  return r[0] = t, r.set(e, 1), jn(r);
+  return r[0] = t, r.set(e, 1), Gn(r);
 }
 function Wr(e, t, r, n) {
   const i = tt.bech32.toWords(e);
@@ -8111,8 +8111,8 @@ function Wr(e, t, r, n) {
 function qo(e, t) {
   t = t || kt;
   const r = e.length;
-  if (r === 25 && e[0] === 118 && e[1] === 169 && e[2] === 20 && e[23] === 136 && e[24] === 172) return $n(e.subarray(3, 23), t.pubKeyHash);
-  if (r === 23 && e[0] === 169 && e[1] === 20 && e[22] === 135) return $n(e.subarray(2, 22), t.scriptHash);
+  if (r === 25 && e[0] === 118 && e[1] === 169 && e[2] === 20 && e[23] === 136 && e[24] === 172) return Vn(e.subarray(3, 23), t.pubKeyHash);
+  if (r === 23 && e[0] === 169 && e[1] === 20 && e[22] === 135) return Vn(e.subarray(2, 22), t.scriptHash);
   if (r === 22 && e[0] === 0 && e[1] === 20) return Wr(e.subarray(2, 22), 0, t.bech32);
   if (r === 34 && e[0] === 0 && e[1] === 32) return Wr(e.subarray(2, 34), 0, t.bech32);
   if (r === 34 && e[0] === 81 && e[1] === 32) {
@@ -8131,7 +8131,7 @@ function qo(e, t) {
     return jo(e, t);
   } catch {
   }
-  throw new Error(Ds(e) + " has no matching Address");
+  throw new Error(Ks(e) + " has no matching Address");
 }
 function Yo(e, t) {
   let r, n;
@@ -8153,14 +8153,14 @@ function Yo(e, t) {
       if (o.prefix !== r.bech32 && r.bech32Opnet && o.prefix !== r.bech32Opnet) throw new Error(e + " has an invalid prefix");
       if (o.version === 0) {
         if (o.data.length === 20) return sn({ hash: lh(o.data) }).output;
-        if (o.data.length === 32) return gr({ hash: ki(o.data) }).output;
+        if (o.data.length === 32) return gr({ hash: Si(o.data) }).output;
       } else if (o.version === 1) {
         if (o.data.length === 32) return wr({ pubkey: o.data }).output;
       } else {
-        if (o.version === 2 && o.data.length === 32) return ui({ hash: ki(o.data) }).output;
+        if (o.version === 2 && o.data.length === 32) return ai({ hash: Si(o.data) }).output;
         if (o.version === 16) {
           if (!r.bech32Opnet) throw new Error(e + " has an invalid prefix");
-          return Jn({
+          return Qn({
             program: o.data,
             network: r
           }).output;
@@ -8184,11 +8184,11 @@ var Uf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   fromBech32: cr,
   fromOutputScript: qo,
   isUnknownSegwitVersion: Wo,
-  toBase58Check: $n,
+  toBase58Check: Vn,
   toBech32: Wr,
   toFutureOPNetAddress: Go,
   toOutputScript: Yo
-}, Symbol.toStringTag, { value: "Module" })), ps = j, Xo = class Kn {
+}, Symbol.toStringTag, { value: "Module" })), ls = j, Xo = class $n {
   static NAME = ft.Embed;
   #t;
   #a;
@@ -8217,13 +8217,13 @@ var Uf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     return this.#o || (this.#n = this.#f(), this.#o = !0), this.#n;
   }
   static fromData(t, r) {
-    return new Kn({
+    return new $n({
       data: t,
       network: r
     });
   }
   static fromOutput(t, r) {
-    return new Kn({
+    return new $n({
       output: t,
       network: r
     });
@@ -8242,13 +8242,13 @@ var Uf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   }
   #f() {
     if (this.#s) return this.#s;
-    if (this.#e) return gt([ps.OP_RETURN].concat(this.#e));
+    if (this.#e) return gt([ls.OP_RETURN].concat(this.#e));
   }
   #u() {
     if (this.#s) {
       const t = et(this.#s);
       if (!t) throw new TypeError("Output is invalid");
-      if (t[0] !== ps.OP_RETURN) throw new TypeError("Output is invalid");
+      if (t[0] !== ls.OP_RETURN) throw new TypeError("Output is invalid");
       if (!t.slice(1).every((r) => r instanceof Uint8Array)) throw new TypeError("Output is invalid");
       if (this.#e && !Ue(this.#e, this.data)) throw new TypeError("Data mismatch");
     }
@@ -8270,7 +8270,7 @@ var Pf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   MAX_TAPTREE_DEPTH: 128,
   P2MR: No,
   P2MS: $o,
-  P2OP: Ws,
+  P2OP: Fs,
   P2PK: Vo,
   P2PKH: ao,
   P2SH: ho,
@@ -8280,10 +8280,10 @@ var Pf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   PaymentType: ft,
   findScriptPath: Pe,
   p2data: Of,
-  p2mr: ui,
+  p2mr: ai,
   p2ms: yr,
-  p2op: Jn,
-  p2pk: fi,
+  p2op: Qn,
+  p2pk: hi,
   p2pkh: pr,
   p2sh: dr,
   p2tr: wr,
@@ -8361,12 +8361,12 @@ function Zt(e, t) {
   for (let n = 0; n < r; ++n) if (e[n] !== t[n]) return e[n] < t[n] ? -1 : 1;
   return e.length === t.length ? 0 : e.length > t.length ? 1 : -1;
 }
-function pi(e, t, r, n) {
+function ci(e, t, r, n) {
   if (t + 4 > e.length) throw new Error("Offset is outside the bounds of Uint8Array");
   if (n = n.toUpperCase(), r > 4294967295) throw new Error(`The value of "value" is out of range. It must be >= 0 and <= 4294967295. Received ${r}`);
   return n === "LE" ? (e[t] = r & 255, e[t + 1] = r >> 8 & 255, e[t + 2] = r >> 16 & 255, e[t + 3] = r >> 24 & 255) : (e[t] = r >> 24 & 255, e[t + 1] = r >> 16 & 255, e[t + 2] = r >> 8 & 255, e[t + 3] = r & 255), t + 4;
 }
-function ds(e, t) {
+function ps(e, t) {
   if (t + 1 > e.length) throw new Error("Offset is outside the bounds of Uint8Array");
   return e[t];
 }
@@ -8418,7 +8418,7 @@ function Df(e) {
   return r.slice(1).forEach((o) => {
     const a = o.slice(-1) === "'";
     let f = 2147483647 & parseInt(a ? o.slice(0, -1) : o, 10);
-    a && (f += 2147483648), pi(n, i, f, "LE"), i += 4;
+    a && (f += 2147483648), ci(n, i, f, "LE"), i += 4;
   }), {
     key: t,
     value: n
@@ -8602,7 +8602,7 @@ function Tc(e) {
 }
 function kc(e) {
   const t = Uint8Array.from([R.SIGHASH_TYPE]), r = new Uint8Array(4);
-  return pi(r, 0, e, "LE"), {
+  return ci(r, 0, e, "LE"), {
     key: t,
     value: r
   };
@@ -8819,7 +8819,7 @@ var fl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   encode: ol,
   expected: al
 }, Symbol.toStringTag, { value: "Module" })), cl = (e) => [...Array(e).keys()], ll = (e) => e.length === 33 && [2, 3].includes(e[0]) || e.length === 65 && e[0] === 4;
-function di(e, t = ll) {
+function li(e, t = ll) {
   function r(f) {
     if (f.key[0] !== e) throw new Error("Decode Error: could not decode bip32Derivation with key 0x" + G(f.key));
     const l = f.key.slice(1);
@@ -8843,7 +8843,7 @@ function di(e, t = ll) {
     return p.slice(1).forEach((w) => {
       const b = w.slice(-1) === "'";
       let m = 2147483647 & parseInt(b ? w.slice(0, -1) : w, 10);
-      b && (m += 2147483648), pi(u, d, m, "LE"), d += 4;
+      b && (m += 2147483648), ci(u, d, m, "LE"), d += 4;
     }), {
       key: l,
       value: u
@@ -8865,7 +8865,7 @@ function di(e, t = ll) {
     canAddToArray: a
   };
 }
-function wi(e) {
+function pi(e) {
   return t;
   function t(r) {
     let n;
@@ -8905,7 +8905,7 @@ function ea(e) {
 }
 var pl = (e) => e.length === 32;
 function ra(e) {
-  const t = di(e, pl);
+  const t = li(e, pl);
   function r(a) {
     const { numberValue: f, bytes: l } = We(a.value), p = t.decode({
       key: a.key,
@@ -8995,10 +8995,10 @@ function ia(e) {
     canAdd: o
   };
 }
-var gi = {
+var di = {
   unsignedTx: zf,
   globalXpub: Gf,
-  checkPubkey: wi([])
+  checkPubkey: pi([])
 }, wt = {
   nonWitnessUtxo: cc,
   partialSig: bc,
@@ -9007,10 +9007,10 @@ var gi = {
   finalScriptWitness: sc,
   porCommitment: Sc,
   witnessUtxo: il,
-  bip32Derivation: di(R.BIP32_DERIVATION),
+  bip32Derivation: li(R.BIP32_DERIVATION),
   redeemScript: ea(R.REDEEM_SCRIPT),
   witnessScript: ia(R.WITNESS_SCRIPT),
-  checkPubkey: wi([R.PARTIAL_SIG, R.BIP32_DERIVATION]),
+  checkPubkey: pi([R.PARTIAL_SIG, R.BIP32_DERIVATION]),
   tapKeySig: Hc,
   tapScriptSig: Qc,
   tapLeafScript: Dc,
@@ -9018,20 +9018,20 @@ var gi = {
   tapInternalKey: na(R.TAP_INTERNAL_KEY),
   tapMerkleRoot: jc
 }, ee = {
-  bip32Derivation: di(ht.BIP32_DERIVATION),
+  bip32Derivation: li(ht.BIP32_DERIVATION),
   redeemScript: ea(ht.REDEEM_SCRIPT),
   witnessScript: ia(ht.WITNESS_SCRIPT),
-  checkPubkey: wi([ht.BIP32_DERIVATION]),
+  checkPubkey: pi([ht.BIP32_DERIVATION]),
   tapBip32Derivation: ra(ht.TAP_BIP32_DERIVATION),
   tapTree: fl,
   tapInternalKey: na(ht.TAP_INTERNAL_KEY)
 }, dl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  globals: gi,
+  globals: di,
   inputs: wt,
   outputs: ee
 }, Symbol.toStringTag, { value: "Module" })), qr = (e) => [...Array(e).keys()];
-function ws(e) {
+function ds(e) {
   const t = e.map(wl);
   return t.push(Uint8Array.from([0])), Xt(t);
 }
@@ -9052,7 +9052,7 @@ function gl(e, t) {
     return r += 4, I;
   }
   function o() {
-    const I = ds(e, r);
+    const I = ps(e, r);
     return r += 1, I;
   }
   function a() {
@@ -9063,7 +9063,7 @@ function gl(e, t) {
   }
   function f() {
     if (r >= e.length) throw new Error("Format Error: Unexpected End of PSBT");
-    const I = ds(e, r) === 0;
+    const I = ps(e, r) === 0;
     return I && r++, I;
   }
   if (i() !== 1886610036) throw new Error("Format Error: Invalid Magic Number");
@@ -9113,7 +9113,7 @@ function sa(e, { globalMapKeyVals: t, inputKeyVals: r, outputKeyVals: n }) {
       o++;
       break;
     case qt.GLOBAL_XPUB:
-      i.globalXpub === void 0 && (i.globalXpub = []), i.globalXpub.push(gi.globalXpub.decode(u));
+      i.globalXpub === void 0 && (i.globalXpub = []), i.globalXpub.push(di.globalXpub.decode(u));
       break;
     default:
       i.unknownKeyVals || (i.unknownKeyVals = []), i.unknownKeyVals.push(u);
@@ -9215,11 +9215,11 @@ function sa(e, { globalMapKeyVals: t, inputKeyVals: r, outputKeyVals: n }) {
   };
 }
 function yl({ globalMap: e, inputs: t, outputs: r }) {
-  const { globalKeyVals: n, inputKeyVals: i, outputKeyVals: o } = Dn({
+  const { globalKeyVals: n, inputKeyVals: i, outputKeyVals: o } = Kn({
     globalMap: e,
     inputs: t,
     outputs: r
-  }), a = ws(n), f = (d) => d.length === 0 ? [Uint8Array.from([0])] : d.map(ws), l = f(i), p = f(o), u = new Uint8Array(5);
+  }), a = ds(n), f = (d) => d.length === 0 ? [Uint8Array.from([0])] : d.map(ds), l = f(i), p = f(o), u = new Uint8Array(5);
   return u.set([
     112,
     115,
@@ -9242,23 +9242,23 @@ function In(e, t) {
   }, []), i = e.unknownKeyVals ? e.unknownKeyVals.filter((o) => !r.has(G(o.key))) : [];
   return n.concat(i).sort(bl);
 }
-function Dn({ globalMap: e, inputs: t, outputs: r }) {
+function Kn({ globalMap: e, inputs: t, outputs: r }) {
   return {
-    globalKeyVals: In(e, gi),
+    globalKeyVals: In(e, di),
     inputKeyVals: t.map((n) => In(n, wt)),
     outputKeyVals: r.map((n) => In(n, ee))
   };
 }
 function ml(e) {
-  const t = e[0], r = Dn(t), n = e.slice(1);
+  const t = e[0], r = Kn(t), n = e.slice(1);
   if (n.length === 0) throw new Error("Combine: Nothing to combine");
-  const i = gs(t);
+  const i = ws(t);
   if (i === void 0) throw new Error("Combine: Self missing transaction");
   const o = Ne(r.globalKeyVals), a = r.inputKeyVals.map(Ne), f = r.outputKeyVals.map(Ne);
   for (const l of n) {
-    const p = gs(l);
+    const p = ws(l);
     if (p === void 0 || Zt(p.toBuffer(), i.toBuffer()) !== 0) throw new Error("Combine: One of the Psbts does not have the same transaction.");
-    const u = Dn(l);
+    const u = Kn(l);
     Ne(u.globalKeyVals).forEach(An(o, r.globalKeyVals, u.globalKeyVals)), u.inputKeyVals.map(Ne).forEach((d, w) => d.forEach(An(a[w], r.inputKeyVals[w], u.inputKeyVals[w]))), u.outputKeyVals.map(Ne).forEach((d, w) => d.forEach(An(f[w], r.outputKeyVals[w], u.outputKeyVals[w])));
   }
   return sa(i, {
@@ -9274,7 +9274,7 @@ function An(e, t, r) {
     t.push(i), e.add(n);
   };
 }
-function gs(e) {
+function ws(e) {
   return e.globalMap.unsignedTx;
 }
 function Ne(e) {
@@ -9313,34 +9313,34 @@ function El(e, t) {
   }
   if (r === !1) throw new Error(`Input #${e} has too much or too little data to clean`);
 }
-function ys(e, t, r, n) {
+function gs(e, t, r, n) {
   throw new Error(`Data for ${e} key ${t} is incorrect: Expected ${r} and got ${JSON.stringify(n)}`);
 }
-function yi(e) {
+function wi(e) {
   return (t, r) => {
     for (const n of Object.keys(t)) {
       const i = t[n], { canAdd: o, canAddToArray: a, check: f, expected: l } = dl[e + "s"][n] || {}, p = !!a;
       if (f) if (p) {
         if (!Array.isArray(i) || r[n] && !Array.isArray(r[n])) throw new Error(`Key type ${n} must be an array`);
-        i.every(f) || ys(e, n, l, i);
+        i.every(f) || gs(e, n, l, i);
         const u = r[n] || [], d = /* @__PURE__ */ new Set();
         if (!i.every((w) => a(u, w, d))) throw new Error("Can not add duplicate data to array");
         r[n] = u.concat(i);
       } else {
-        if (f(i) || ys(e, n, l, i), !o(r, i)) throw new Error(`Can not add duplicate data to ${e}`);
+        if (f(i) || gs(e, n, l, i), !o(r, i)) throw new Error(`Can not add duplicate data to ${e}`);
         r[n] = i;
       }
     }
   };
 }
-var vl = yi("global"), oa = yi("input"), aa = yi("output");
+var vl = wi("global"), oa = wi("input"), aa = wi("output");
 function Il(e, t) {
   oa(t, mt(e, e.length - 1));
 }
 function Al(e, t) {
   aa(t, fr(e, e.length - 1));
 }
-var bs = class {
+var ys = class {
   constructor(e) {
     this.inputs = [], this.outputs = [], this.globalMap = { unsignedTx: e };
   }
@@ -9423,14 +9423,14 @@ function Ur(e) {
 function kn(e) {
   if (e.unsafeSignNonSegwit) throw new Error("Not BIP174 compliant, can not export");
 }
-function Mn(e) {
+function Dn(e) {
   return !!e.finalScriptSig || !!e.finalScriptWitness;
 }
 function Sl(e) {
   if (!e.ins.every((t) => t.script && t.script.length === 0 && t.witness && t.witness.length === 0)) throw new Error("Format Error: Transaction ScriptSigs are not empty");
 }
 function ha(e, t) {
-  const r = `${Yt(qn(new Uint8Array(t.hash)))}:${t.index}`;
+  const r = `${Yt(zn(new Uint8Array(t.hash)))}:${t.index}`;
   if (e.txInCache[r]) throw new Error("Duplicate input detected.");
   e.txInCache[r] = 1;
 }
@@ -9461,8 +9461,8 @@ function fa(e, t) {
     if (!x(n, a)) throw new Error(`${t} for ${o} #${r} doesn't match the scriptPubKey in the prevout`);
   };
 }
-var ms = fa(dr, "Redeem script"), Es = fa(gr, "Witness script");
-function vs(e) {
+var bs = fa(dr, "Redeem script"), ms = fa(gr, "Witness script");
+function Es(e) {
   let t = 0;
   function r(a) {
     return t += a, e.subarray(t - a, t);
@@ -9503,13 +9503,13 @@ function Ol(e) {
   }
   return new Uint8Array(e);
 }
-function Is(e) {
-  return e.length === 33 && Fs(e);
+function vs(e) {
+  return e.length === 33 && Ms(e);
 }
 function Pl(e) {
   return xe(e);
 }
-function bi(e) {
+function gi(e) {
   return on(e) ? "witnesspubkeyhash" : Xu(e) ? "pubkeyhash" : qu(e) ? "multisig" : Yu(e) ? "pubkey" : "nonstandard";
 }
 function Ze(e) {
@@ -9519,19 +9519,19 @@ function Yr(e) {
   if (on(e) || Ko(e)) throw new Error("P2WPKH or P2SH can not be contained within P2WSH");
 }
 function Xr(e, t, r, n, i) {
-  const o = Ko(e), a = o && n && us(n), f = us(e);
+  const o = Ko(e), a = o && n && hs(n), f = hs(e);
   if (o && n === void 0) throw new Error("scriptPubkey is P2SH but redeemScript missing");
   let l;
   if (a) {
     if (!i) throw new Error("scriptPubkey or redeemScript is P2WSH but witnessScript missing");
     if (!n) throw new Error("P2SH-P2WSH requires redeemScript");
-    l = i, ms(t, e, n, r), Es(t, n, i, r), Yr(l);
+    l = i, bs(t, e, n, r), ms(t, n, i, r), Yr(l);
   } else if (f) {
     if (!i) throw new Error("scriptPubkey or redeemScript is P2WSH but witnessScript missing");
-    l = i, Es(t, e, i, r), Yr(l);
+    l = i, ms(t, e, i, r), Yr(l);
   } else if (o) {
     if (!n) throw new Error("P2SH requires redeemScript");
-    l = n, ms(t, e, n, r);
+    l = n, bs(t, e, n, r);
   } else l = e;
   return {
     meaningfulScript: l,
@@ -9585,7 +9585,7 @@ var xl = class {
     } else throw new Error("Can't find pubkey in input without Utxo data");
   }
   computeFee(e, t = !1, r) {
-    if (!e.every(Mn)) throw new Error("PSBT must be finalized to calculate fee");
+    if (!e.every(Dn)) throw new Error("PSBT must be finalized to calculate fee");
     if (this.fee !== void 0) return this.fee;
     let n, i = !0;
     this.extractedTx ? (n = this.extractedTx, i = !1) : n = this.tx.clone();
@@ -9593,7 +9593,7 @@ var xl = class {
     return o;
   }
   computeFeeRate(e, t = !1, r) {
-    if (!e.every(Mn)) throw new Error("PSBT must be finalized to calculate fee rate");
+    if (!e.every(Dn)) throw new Error("PSBT must be finalized to calculate fee rate");
     if (this.feeRate !== void 0) return this.feeRate;
     let n, i = !0;
     this.extractedTx ? (n = this.extractedTx, i = !1) : n = this.tx.clone();
@@ -9620,18 +9620,18 @@ var xl = class {
     const t = et(e);
     if (!t) return;
     const r = t[t.length - 1];
-    if (!(!(r instanceof Uint8Array) || Is(r) || Pl(r) || !et(r))) return r;
+    if (!(!(r instanceof Uint8Array) || vs(r) || Pl(r) || !et(r))) return r;
   }
   redeemFromFinalWitnessScript(e) {
     if (!e) return;
-    const t = vs(e), r = t[t.length - 1];
-    if (!(!r || Is(r) || !et(r))) return r;
+    const t = Es(e), r = t[t.length - 1];
+    if (!(!r || vs(r) || !et(r))) return r;
   }
   finalizeAndComputeAmounts(e, t, r, n, i) {
     let o = 0n;
     e.forEach((d, w) => {
       const b = t.ins[w];
-      if (r && d.finalScriptSig && (b.script = d.finalScriptSig), r && d.finalScriptWitness && (b.witness = vs(d.finalScriptWitness)), d.witnessUtxo) o += d.witnessUtxo.value;
+      if (r && d.finalScriptSig && (b.script = d.finalScriptSig), r && d.finalScriptWitness && (b.witness = Es(d.finalScriptWitness)), d.witnessUtxo) o += d.witnessUtxo.value;
       else if (d.nonWitnessUtxo) {
         if (!i) throw new Error("txFromBuffer is required for nonWitnessUtxo inputs");
         const m = this.getNonWitnessUtxoTx(d, w, i), v = b.index, I = m.outs[v];
@@ -9663,7 +9663,7 @@ var xl = class {
   }
   getPrevoutTaprootKey(e, t, r) {
     const { script: n } = this.getScriptAndAmountFromUtxo(e, t, r);
-    return ci(n) ? n.subarray(2, 34) : null;
+    return ui(n) ? n.subarray(2, 34) : null;
   }
 }, Bl = class {
   #t;
@@ -9680,7 +9680,7 @@ var xl = class {
   }
   getHashForSig(e, t, r, n) {
     const i = this.#t.tx, o = t.sighashType || J.SIGHASH_ALL;
-    As(o, n);
+    Is(o, n);
     let a, f;
     if (t.nonWitnessUtxo) {
       const d = this.#t.getNonWitnessUtxoTx(t, e, this.#a), w = i.ins[e], b = w.hash;
@@ -9713,7 +9713,7 @@ PROCEED WITH CAUTION!
   }
   getTaprootHashesForSig(e, t, r, n, i, o) {
     const a = this.#t.tx, f = t.sighashType || J.SIGHASH_DEFAULT;
-    if (As(f, o), !this.#t.prevOuts) {
+    if (Is(f, o), !this.#t.prevOuts) {
       const b = r.map((m, v) => this.#t.getScriptAndAmountFromUtxo(v, m, this.#a));
       this.#t.prevOuts = b, this.#t.signingScripts = b.map((m) => m.script), this.#t.values = b.map((m) => m.value);
     }
@@ -9780,7 +9780,7 @@ PROCEED WITH CAUTION!
     };
   }
 };
-function As(e, t) {
+function Is(e, t) {
   if (t && !t.includes(e)) {
     const r = Ul(e);
     throw new Error(`Sighash type is not allowed. Retry the sign method passing the sighashTypes array of whitelisted types. Sighash type: ${r}`);
@@ -9793,7 +9793,7 @@ var _l = class {
     this.#t = e, this.#a = t;
   }
   getFinalScripts(e, t, r, n, i, o, a = !0, f) {
-    const l = bi(r);
+    const l = gi(r);
     if (!la(t, r, l) && a) throw new Error(`Can not finalize input #${e}`);
     if (!t.partialSig) throw new Error("Input missing partial signatures");
     return ca(r, l, t.partialSig, n, i, o, f);
@@ -9803,7 +9803,7 @@ var _l = class {
   }
 };
 function Rl(e, t, r, n, i, o, a = !0, f) {
-  const l = bi(r);
+  const l = gi(r);
   if (!la(t, r, l) && a) throw new Error(`Can not finalize input #${e}`);
   if (!t.partialSig) throw new Error("Input missing partial signatures");
   return ca(r, l, t.partialSig, n, i, o, f);
@@ -9821,11 +9821,11 @@ function la(e, t, r) {
     case "pubkey":
     case "pubkeyhash":
     case "witnesspubkeyhash":
-      return Ss(1, e.partialSig);
+      return As(1, e.partialSig);
     case "multisig": {
       const n = yr({ output: t });
       if (n.m === void 0) throw new Error("Cannot determine m for multisig");
-      return Ss(n.m, e.partialSig, n.pubkeys);
+      return As(n.m, e.partialSig, n.pubkeys);
     }
     case "nonstandard":
       return !0;
@@ -9833,7 +9833,7 @@ function la(e, t, r) {
       return !1;
   }
 }
-function Ss(e, t, r) {
+function As(e, t, r) {
   if (!t) return !1;
   let n;
   if (r ? n = r.map((i) => {
@@ -9852,7 +9852,7 @@ function Nl(e, t, r) {
       });
     case "pubkey": {
       const i = r[0];
-      return fi({
+      return hi({
         output: n,
         signature: i.signature
       });
@@ -9914,7 +9914,7 @@ var Ll = new Uint8Array([
   }
   addInput(e) {
     if (e.hash === void 0 || e.index === void 0 || !(e.hash instanceof Uint8Array) && typeof e.hash != "string" || typeof e.index != "number") throw new Error("Error adding input.");
-    const t = typeof e.hash == "string" ? qn(Mt(e.hash)) : e.hash;
+    const t = typeof e.hash == "string" ? zn(Mt(e.hash)) : e.hash;
     this.tx.addInput(t, e.index, e.sequence);
   }
   addOutput(e) {
@@ -9934,8 +9934,8 @@ function jt(e) {
 function $l(e, t, r, n, i, o, a = !0, f) {
   return Rl(e, t, r, n, i, o, a, f);
 }
-var Zl = class Fn {
-  constructor(t = {}, r = new bs(new pa())) {
+var Zl = class Mn {
+  constructor(t = {}, r = new ys(new pa())) {
     this.data = r, this.#s = Object.assign({}, Vl, t);
     const n = this.data.globalMap.unsignedTx.tx;
     this.#t = new xl(n), t.version === 3 ? this.setVersionTRUC() : this.data.inputs.length === 0 && this.setVersion(2);
@@ -9961,7 +9961,7 @@ var Zl = class Fn {
   }
   get txInputs() {
     return this.#t.tx.ins.map((t) => ({
-      hash: Si(t.hash),
+      hash: Ii(t.hash),
       index: t.index,
       sequence: t.sequence
     }));
@@ -9974,7 +9974,7 @@ var Zl = class Fn {
       } catch {
       }
       return {
-        script: Si(t.script),
+        script: Ii(t.script),
         value: t.value,
         address: r
       };
@@ -9995,7 +9995,7 @@ var Zl = class Fn {
     return this.fromBuffer(n, r);
   }
   static fromBuffer(t, r = {}) {
-    const n = new Fn(r, bs.fromBuffer(t, Cl));
+    const n = new Mn(r, ys.fromBuffer(t, Cl));
     return Tl(n.#t.tx, n.#t), n.#t.hasSignatures = n.data.inputs.some((i) => i.partialSig?.length || i.tapKeySig || i.tapScriptSig?.length || i.finalScriptSig || i.finalScriptWitness), n;
   }
   combine(...t) {
@@ -10003,7 +10003,7 @@ var Zl = class Fn {
   }
   clone() {
     const t = structuredClone(this.#s);
-    return Fn.fromBuffer(new Uint8Array(this.data.toBuffer()), t);
+    return Mn.fromBuffer(new Uint8Array(this.data.toBuffer()), t);
   }
   get maximumFeeRate() {
     return this.#s.maximumFeeRate;
@@ -10029,7 +10029,7 @@ var Zl = class Fn {
   }
   addInput(t, r = !0) {
     if (!t || t.hash === void 0 || t.index === void 0) throw new Error("Invalid arguments for Psbt.addInput. Requires single object with at least [hash] and [index]");
-    cs(t, t, "addInput"), r && Xe(this.data.inputs, "addInput", this.#t.hasSignatures), t.witnessScript && Yr(t.witnessScript);
+    fs(t, t, "addInput"), r && Xe(this.data.inputs, "addInput", this.#t.hasSignatures), t.witnessScript && Yr(t.witnessScript);
     const n = t.witnessUtxo ? {
       ...t,
       witnessUtxo: {
@@ -10053,10 +10053,10 @@ var Zl = class Fn {
       const { address: o } = t, { network: a } = this.#s, f = Yo(o, a);
       t = Object.assign({}, t, { script: f });
     }
-    return ls(t, t, "addOutput"), this.data.addOutput(t), this.#t.invalidate("outputs"), this;
+    return cs(t, t, "addOutput"), this.data.addOutput(t), this.#t.invalidate("outputs"), this;
   }
   extractTransaction(t, r) {
-    if (r && (this.data.inputs = this.data.inputs.filter((i) => !i.partialSig)), !this.data.inputs.every(Mn)) throw new Error("Not finalized");
+    if (r && (this.data.inputs = this.data.inputs.filter((i) => !i.partialSig)), !this.data.inputs.every(Dn)) throw new Error("Not finalized");
     if (t || (this.#t.computeFeeRate(this.data.inputs, r, jt), this.#t.checkFees(this.#s)), this.#t.extractedTx) return this.#t.extractedTx;
     const n = this.#t.tx.clone();
     return this.#t.finalizeAndComputeAmounts(this.data.inputs, n, !0, r, jt), n;
@@ -10074,14 +10074,14 @@ var Zl = class Fn {
     const i = mt(this.data.inputs, t);
     return Lt(i) ? this.#o(t, i, void 0, r) : this.#i(t, i, r, n ?? !0);
   }
-  finalizeTaprootInput(t, r, n = fs) {
+  finalizeTaprootInput(t, r, n = us) {
     const i = mt(this.data.inputs, t);
     if (Lt(i)) return this.#o(t, i, r, n);
     throw new Error(`Cannot finalize input #${t}. Not Taproot.`);
   }
   getInputType(t) {
     const r = mt(this.data.inputs, t), n = Xr(this.#t.getScriptFromUtxo(t, r, jt), t, "input", r.redeemScript || this.#t.redeemFromFinalScriptSig(r.finalScriptSig), r.witnessScript || this.#t.redeemFromFinalWitnessScript(r.finalScriptWitness));
-    return (n.type === "raw" ? "" : n.type + "-") + bi(n.meaningfulScript);
+    return (n.type === "raw" ? "" : n.type + "-") + gi(n.meaningfulScript);
   }
   inputHasPubkey(t, r) {
     const n = mt(this.data.inputs, t);
@@ -10192,7 +10192,7 @@ var Zl = class Fn {
     return this.data.updateGlobal(t), this;
   }
   updateInput(t, r) {
-    r.witnessScript && Yr(r.witnessScript), cs(this.data.inputs[t], r, "updateInput");
+    r.witnessScript && Yr(r.witnessScript), fs(this.data.inputs[t], r, "updateInput");
     const n = r.witnessUtxo ? {
       ...r,
       witnessUtxo: {
@@ -10204,7 +10204,7 @@ var Zl = class Fn {
   }
   updateOutput(t, r) {
     const n = this.data.outputs[t];
-    return ls(n, r, "updateOutput"), this.data.updateOutput(t, r), this;
+    return cs(n, r, "updateOutput"), this.data.updateOutput(t, r), this;
   }
   addUnknownKeyValToGlobal(t) {
     return this.data.addUnknownKeyValToGlobal(t), this;
@@ -10232,9 +10232,9 @@ var Zl = class Fn {
     if (p && this.data.updateInput(t, { finalScriptSig: p }), u && this.data.updateInput(t, { finalScriptWitness: u }), !p && !u) throw new Error(`Unknown error finalizing input #${t}`);
     return this.data.clearFinalizedInput(t), this;
   }
-  #o(t, r, n, i = fs) {
+  #o(t, r, n, i = us) {
     if (!r.witnessUtxo) throw new Error(`Cannot finalize input #${t}. Missing witness utxo.`);
-    if (r.tapKeySig && !Cn(r)) {
+    if (r.tapKeySig && !Ln(r)) {
       const o = wr({
         output: r.witnessUtxo.script,
         signature: r.tapKeySig
@@ -10354,10 +10354,10 @@ export {
   Wl as O,
   Ku as P,
   Yt as R,
-  ci as S,
-  li as T,
+  ui as S,
+  fi as T,
   j as V,
-  us as _,
+  hs as _,
   $l as a,
   va as b,
   Wo as c,
@@ -10372,7 +10372,7 @@ export {
   De as m,
   Pf as n,
   Tf as o,
-  _n as p,
+  Bn as p,
   qo as r,
   Ql as s,
   Zl as t,