@btc-vision/transaction 1.8.0-beta.4 → 1.8.0-beta.6

package/browser/btc-vision-bitcoin.js

@@ -351,9 +351,9 @@ function Ka(e) {
 function xs(e) {
   return typeof e == "string" && (e = Ka(e)), Jn(e), e;
 }
-let Da = class {
+let Va = class {
 };
-function Va(e) {
+function Da(e) {
   const t = (n) => e().update(xs(n)).digest(), r = e();
   return t.outputLen = r.outputLen, t.blockLen = r.blockLen, t.create = () => e(), t;
 }
@@ -369,7 +369,7 @@ function Fa(e, t, r) {
 function Wa(e, t, r) {
   return e & t ^ e & r ^ t & r;
 }
-let Ga = class extends Da {
+let Ga = class extends Va {
   constructor(t, r, n, i) {
     super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = t, this.outputLen = r, this.padOffset = n, this.isLE = i, this.buffer = new Uint8Array(t), this.view = mn(this.buffer);
   }
@@ -495,7 +495,7 @@ const oe = /* @__PURE__ */ Uint32Array.from([
   3204031479,
   3329325298
 ]), ae = /* @__PURE__ */ new Uint32Array(64);
-class za extends Ga {
+let za = class extends Ga {
   constructor(t = 32) {
     super(64, t, 8, !1), this.A = oe[0] | 0, this.B = oe[1] | 0, this.C = oe[2] | 0, this.D = oe[3] | 0, this.E = oe[4] | 0, this.F = oe[5] | 0, this.G = oe[6] | 0, this.H = oe[7] | 0;
   }
@@ -527,8 +527,8 @@ class za extends Ga {
   destroy() {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), Cn(this.buffer);
   }
-}
-const qa = /* @__PURE__ */ Va(() => new za()), Oi = qa;
+};
+const qa = /* @__PURE__ */ Da(() => new za()), Oi = qa;
 function Ya(e) {
   if (e.length >= 255)
     throw new TypeError("Alphabet too long");
@@ -768,7 +768,7 @@ function Ge(e, t) {
 function Kt(e) {
   return Bs(e), e < 253 ? 1 : e <= 65535 ? 3 : e <= 4294967295 ? 5 : 9;
 }
-const gp = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const yp = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   decode: Ge,
   encode: me,
@@ -1665,7 +1665,7 @@ function Et(e, t = 0) {
   const r = new Uint8Array(e);
   return t !== 0 && r.fill(t), r;
 }
-function bp(e) {
+function mp(e) {
   return new TextEncoder().encode(e);
 }
 function uh(e) {
@@ -2202,7 +2202,7 @@ ri.write = function(e, t, r, n, i, o) {
           return L(this, h, c);
         case "latin1":
         case "binary":
-          return V(this, h, c);
+          return D(this, h, c);
         case "base64":
           return x(this, h, c);
         case "ucs2":
@@ -2445,7 +2445,7 @@ ri.write = function(e, t, r, n, i, o) {
       g += String.fromCharCode(s[b] & 127);
     return g;
   }
-  function V(s, h, c) {
+  function D(s, h, c) {
     let g = "";
     c = Math.min(s.length, c);
     for (let b = h; b < c; ++b)
@@ -2559,7 +2559,7 @@ ri.write = function(e, t, r, n, i, o) {
   }, f.prototype.readDoubleBE = function(s, h) {
     return s = s >>> 0, h || W(s, 8, this.length), r.read(this, s, !1, 52, 8);
   };
-  function D(s, h, c, g, b, I) {
+  function V(s, h, c, g, b, I) {
     if (!f.isBuffer(s)) throw new TypeError('"buffer" argument must be a Buffer instance');
     if (h > b || h < I) throw new RangeError('"value" argument is out of bounds');
     if (c + g > s.length) throw new RangeError("Index out of range");
@@ -2567,7 +2567,7 @@ ri.write = function(e, t, r, n, i, o) {
   f.prototype.writeUintLE = f.prototype.writeUIntLE = function(s, h, c, g) {
     if (s = +s, h = h >>> 0, c = c >>> 0, !g) {
       const T = Math.pow(2, 8 * c) - 1;
-      D(this, s, h, c, T, 0);
+      V(this, s, h, c, T, 0);
     }
     let b = 1, I = 0;
     for (this[h] = s & 255; ++I < c && (b *= 256); )
@@ -2576,22 +2576,22 @@ ri.write = function(e, t, r, n, i, o) {
   }, f.prototype.writeUintBE = f.prototype.writeUIntBE = function(s, h, c, g) {
     if (s = +s, h = h >>> 0, c = c >>> 0, !g) {
       const T = Math.pow(2, 8 * c) - 1;
-      D(this, s, h, c, T, 0);
+      V(this, s, h, c, T, 0);
     }
     let b = c - 1, I = 1;
     for (this[h + b] = s & 255; --b >= 0 && (I *= 256); )
       this[h + b] = s / I & 255;
     return h + c;
   }, f.prototype.writeUint8 = f.prototype.writeUInt8 = function(s, h, c) {
-    return s = +s, h = h >>> 0, c || D(this, s, h, 1, 255, 0), this[h] = s & 255, h + 1;
+    return s = +s, h = h >>> 0, c || V(this, s, h, 1, 255, 0), this[h] = s & 255, h + 1;
   }, f.prototype.writeUint16LE = f.prototype.writeUInt16LE = function(s, h, c) {
-    return s = +s, h = h >>> 0, c || D(this, s, h, 2, 65535, 0), this[h] = s & 255, this[h + 1] = s >>> 8, h + 2;
+    return s = +s, h = h >>> 0, c || V(this, s, h, 2, 65535, 0), this[h] = s & 255, this[h + 1] = s >>> 8, h + 2;
   }, f.prototype.writeUint16BE = f.prototype.writeUInt16BE = function(s, h, c) {
-    return s = +s, h = h >>> 0, c || D(this, s, h, 2, 65535, 0), this[h] = s >>> 8, this[h + 1] = s & 255, h + 2;
+    return s = +s, h = h >>> 0, c || V(this, s, h, 2, 65535, 0), this[h] = s >>> 8, this[h + 1] = s & 255, h + 2;
   }, f.prototype.writeUint32LE = f.prototype.writeUInt32LE = function(s, h, c) {
-    return s = +s, h = h >>> 0, c || D(this, s, h, 4, 4294967295, 0), this[h + 3] = s >>> 24, this[h + 2] = s >>> 16, this[h + 1] = s >>> 8, this[h] = s & 255, h + 4;
+    return s = +s, h = h >>> 0, c || V(this, s, h, 4, 4294967295, 0), this[h + 3] = s >>> 24, this[h + 2] = s >>> 16, this[h + 1] = s >>> 8, this[h] = s & 255, h + 4;
   }, f.prototype.writeUint32BE = f.prototype.writeUInt32BE = function(s, h, c) {
-    return s = +s, h = h >>> 0, c || D(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;
+    return s = +s, h = h >>> 0, c || V(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, b) {
     vi(h, g, b, s, c, 7);
@@ -2614,7 +2614,7 @@ ri.write = function(e, t, r, n, i, o) {
   }), f.prototype.writeIntLE = function(s, h, c, g) {
     if (s = +s, h = h >>> 0, !g) {
       const st = Math.pow(2, 8 * c - 1);
-      D(this, s, h, c, st - 1, -st);
+      V(this, s, h, c, st - 1, -st);
     }
     let b = 0, I = 1, T = 0;
     for (this[h] = s & 255; ++b < c && (I *= 256); )
@@ -2623,22 +2623,22 @@ ri.write = function(e, t, r, n, i, o) {
   }, f.prototype.writeIntBE = function(s, h, c, g) {
     if (s = +s, h = h >>> 0, !g) {
       const st = Math.pow(2, 8 * c - 1);
-      D(this, s, h, c, st - 1, -st);
+      V(this, s, h, c, st - 1, -st);
     }
     let b = c - 1, I = 1, T = 0;
     for (this[h + b] = s & 255; --b >= 0 && (I *= 256); )
       s < 0 && T === 0 && this[h + b + 1] !== 0 && (T = 1), this[h + b] = (s / I >> 0) - T & 255;
     return h + c;
   }, f.prototype.writeInt8 = function(s, h, c) {
-    return s = +s, h = h >>> 0, c || D(this, s, h, 1, 127, -128), s < 0 && (s = 255 + s + 1), this[h] = s & 255, h + 1;
+    return s = +s, h = h >>> 0, c || V(this, s, h, 1, 127, -128), s < 0 && (s = 255 + s + 1), this[h] = s & 255, h + 1;
   }, f.prototype.writeInt16LE = function(s, h, c) {
-    return s = +s, h = h >>> 0, c || D(this, s, h, 2, 32767, -32768), this[h] = s & 255, this[h + 1] = s >>> 8, h + 2;
+    return s = +s, h = h >>> 0, c || V(this, s, h, 2, 32767, -32768), this[h] = s & 255, this[h + 1] = s >>> 8, h + 2;
   }, f.prototype.writeInt16BE = function(s, h, c) {
-    return s = +s, h = h >>> 0, c || D(this, s, h, 2, 32767, -32768), this[h] = s >>> 8, this[h + 1] = s & 255, h + 2;
+    return s = +s, h = h >>> 0, c || V(this, s, h, 2, 32767, -32768), this[h] = s >>> 8, this[h + 1] = s & 255, h + 2;
   }, f.prototype.writeInt32LE = function(s, h, c) {
-    return s = +s, h = h >>> 0, c || D(this, s, h, 4, 2147483647, -2147483648), this[h] = s & 255, this[h + 1] = s >>> 8, this[h + 2] = s >>> 16, this[h + 3] = s >>> 24, h + 4;
+    return s = +s, h = h >>> 0, c || V(this, s, h, 4, 2147483647, -2147483648), this[h] = s & 255, this[h + 1] = s >>> 8, this[h + 2] = s >>> 16, this[h + 3] = s >>> 24, h + 4;
   }, f.prototype.writeInt32BE = function(s, h, c) {
-    return s = +s, h = h >>> 0, c || D(this, s, h, 4, 2147483647, -2147483648), s < 0 && (s = 4294967295 + s + 1), this[h] = s >>> 24, this[h + 1] = s >>> 16, this[h + 2] = s >>> 8, this[h + 3] = s & 255, h + 4;
+    return s = +s, h = h >>> 0, c || V(this, s, h, 4, 2147483647, -2147483648), s < 0 && (s = 4294967295 + s + 1), this[h] = s >>> 24, this[h + 1] = s >>> 16, this[h + 2] = s >>> 8, this[h + 3] = s & 255, h + 4;
   }, f.prototype.writeBigInt64LE = se(function(s, h = 0) {
     return nt(this, s, h, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
   }), f.prototype.writeBigInt64BE = se(function(s, h = 0) {
@@ -2706,9 +2706,9 @@ ri.write = function(e, t, r, n, i, o) {
     }
     return this;
   };
-  const Dt = {};
+  const Vt = {};
   function _e(s, h, c) {
-    Dt[s] = class extends c {
+    Vt[s] = class extends c {
       constructor() {
         super(), Object.defineProperty(this, "message", {
           value: h.apply(this, arguments),
@@ -2766,16 +2766,16 @@ ri.write = function(e, t, r, n, i, o) {
     if (s > c || s < h) {
       const T = typeof h == "bigint" ? "n" : "";
       let st;
-      throw h === 0 || h === BigInt(0) ? st = `>= 0${T} and < 2${T} ** ${(I + 1) * 8}${T}` : st = `>= -(2${T} ** ${(I + 1) * 8 - 1}${T}) and < 2 ** ${(I + 1) * 8 - 1}${T}`, new Dt.ERR_OUT_OF_RANGE("value", st, s);
+      throw h === 0 || h === BigInt(0) ? st = `>= 0${T} and < 2${T} ** ${(I + 1) * 8}${T}` : st = `>= -(2${T} ** ${(I + 1) * 8 - 1}${T}) and < 2 ** ${(I + 1) * 8 - 1}${T}`, new Vt.ERR_OUT_OF_RANGE("value", st, s);
     }
     ma(g, b, I);
   }
   function Re(s, h) {
     if (typeof s != "number")
-      throw new Dt.ERR_INVALID_ARG_TYPE(h, "number", s);
+      throw new Vt.ERR_INVALID_ARG_TYPE(h, "number", s);
   }
   function ze(s, h, c) {
-    throw Math.floor(s) !== s ? (Re(s, c), new Dt.ERR_OUT_OF_RANGE("offset", "an integer", s)) : h < 0 ? new Dt.ERR_BUFFER_OUT_OF_BOUNDS() : new Dt.ERR_OUT_OF_RANGE(
+    throw Math.floor(s) !== s ? (Re(s, c), new Vt.ERR_OUT_OF_RANGE("offset", "an integer", s)) : h < 0 ? new Vt.ERR_BUFFER_OUT_OF_BOUNDS() : new Vt.ERR_OUT_OF_RANGE(
       "offset",
       `>= 0 and <= ${h}`,
       s
@@ -2980,7 +2980,7 @@ function Rh(e) {
     throw new TypeError(`Expected 20-byte Uint8Array, got ${e.length} bytes`);
   return e;
 }
-function mp(e) {
+function Ep(e) {
   if (e < 0n)
     throw new RangeError(`Satoshi cannot be negative, got ${e}`);
   if (e > Bi)
@@ -3024,23 +3024,23 @@ const Hh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   decode: Nh,
   encode: Lh,
   isDefinedHashType: on
-}, Symbol.toStringTag, { value: "Module" })), Ds = Y.OP_RESERVED;
+}, Symbol.toStringTag, { value: "Module" })), Vs = Y.OP_RESERVED;
 function Ch(e) {
   return kh(e) && (e === Y.OP_0 || e >= Y.OP_1 && e <= Y.OP_16 || e === Y.OP_1NEGATE);
 }
-function Vs(e) {
+function Ds(e) {
   return e instanceof Uint8Array ? !0 : Ch(e);
 }
 function an(e) {
-  return ni(e) && e.every(Vs);
+  return ni(e) && e.every(Ds);
 }
 function ii(e) {
-  return e.length - e.filter(Vs).length;
+  return e.length - e.filter(Ds).length;
 }
 function Lr(e) {
   if (e.length === 0) return Y.OP_0;
   if (e.length === 1) {
-    if (e[0] >= 1 && e[0] <= 16) return Ds + e[0];
+    if (e[0] >= 1 && e[0] <= 16) return Vs + e[0];
     if (e[0] === 129) return Y.OP_1NEGATE;
   }
 }
@@ -3127,7 +3127,7 @@ function Fs(e) {
   const t = si(e) ? et(e) : e;
   if (!t || !an(t))
     throw new TypeError("Expected push-only script");
-  return t.map((r) => Hr(r) ? r : r === Y.OP_0 ? Et(0) : Hs(r - Ds));
+  return t.map((r) => Hr(r) ? r : r === Y.OP_0 ? Et(0) : Hs(r - Vs));
 }
 function Ws(e) {
   return Ue(e);
@@ -3135,7 +3135,7 @@ function Ws(e) {
 function Pe(e) {
   return !(e instanceof Uint8Array) || !on(e[e.length - 1]) ? !1 : uh(e.subarray(0, -1));
 }
-const Dh = Th, Te = Hh, Vh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Vh = Th, Te = Hh, Dh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   compile: yt,
   countNonPushOnlyOPs: ii,
@@ -3144,7 +3144,7 @@ const Dh = Th, Te = Hh, Vh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Objec
   isCanonicalPubKey: Ws,
   isCanonicalScriptSignature: Pe,
   isPushOnly: an,
-  number: Dh,
+  number: Vh,
   opcodes: Y,
   signature: Te,
   toASM: Ms,
@@ -3650,7 +3650,7 @@ const jh = /* @__PURE__ */ oi(() => new Gh()), zh = /* @__PURE__ */ Uint8Array.f
   2053994217,
   0
 ]);
-function Di(e, t, r, n) {
+function Vi(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);
 }
 const Sr = /* @__PURE__ */ new Uint32Array(16);
@@ -3677,11 +3677,11 @@ class Jh extends ai {
     for (let y = 0; y < 5; y++) {
       const m = 4 - y, E = Zh[y], S = Qh[y], O = Qs[y], _ = Js[y], U = Yh[y], H = Xh[y];
       for (let j = 0; j < 16; j++) {
-        const rt = Se(n + Di(y, o, u, d) + Sr[O[j]] + E, U[j]) + p | 0;
+        const rt = Se(n + Vi(y, o, u, d) + Sr[O[j]] + E, U[j]) + p | 0;
         n = p, p = d, d = Se(u, 10) | 0, u = o, o = rt;
       }
       for (let j = 0; j < 16; j++) {
-        const rt = Se(i + Di(m, a, l, f) + Sr[_[j]] + S, H[j]) + w | 0;
+        const rt = Se(i + Vi(m, a, l, f) + Sr[_[j]] + S, H[j]) + w | 0;
         i = w, w = f, f = Se(l, 10) | 0, l = a, a = rt;
       }
     }
@@ -4454,8 +4454,8 @@ const ou = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   b: 7n,
   Gx: 0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798n,
   Gy: 0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8n
-}, { p: ke, n: au, Gx: hu, Gy: uu, b: io } = no, Dn = 32, hi = 64, fu = {
-  publicKey: Dn + 1,
+}, { p: ke, n: au, Gx: hu, Gy: uu, b: io } = no, Vn = 32, hi = 64, fu = {
+  publicKey: Vn + 1,
   publicKeyUncompressed: hi + 1
 }, cu = (...e) => {
   "captureStackTrace" in Error && typeof Error.captureStackTrace == "function" && Error.captureStackTrace(...e);
@@ -4469,7 +4469,7 @@ const ou = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     xt(a + "expected Uint8Array" + u + ", got " + l);
   }
   return e;
-}, so = (e) => new Uint8Array(e), oo = (e, t) => e.toString(16).padStart(t, "0"), ao = (e) => Array.from(ui(e)).map((t) => oo(t, 2)).join(""), ee = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 }, Vi = (e) => {
+}, so = (e) => new Uint8Array(e), oo = (e, t) => e.toString(16).padStart(t, "0"), ao = (e) => Array.from(ui(e)).map((t) => oo(t, 2)).join(""), ee = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 }, Di = (e) => {
   if (e >= ee._0 && e <= ee._9)
     return e - ee._0;
   if (e >= ee.A && e <= ee.F)
@@ -4485,7 +4485,7 @@ const ou = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     return xt(t);
   const i = so(n);
   for (let o = 0, a = 0; o < n; o++, a += 2) {
-    const u = Vi(e.charCodeAt(a)), l = Vi(e.charCodeAt(a + 1));
+    const u = Di(e.charCodeAt(a)), l = Di(e.charCodeAt(a + 1));
     if (u === void 0 || l === void 0)
       return xt(t);
     i[o] = u * 16 + l;
@@ -4508,7 +4508,7 @@ const ou = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     n = r, r = u, i = o, o = l;
   }
   return n === 1n ? R(i, t) : xt("no inverse");
-}, An = (e) => e instanceof Rt ? e : xt("Point expected"), uo = (e) => R(R(e * e) * e + io), Fi = (e) => hn(e, 0n, ke), _r = (e) => hn(e, 1n, ke), gu = (e) => hn(e, 1n, au), Vn = (e) => (e & 1n) === 0n, fo = (e) => Uint8Array.of(e), yu = (e) => fo(Vn(e) ? 2 : 3), bu = (e) => {
+}, An = (e) => e instanceof Rt ? e : xt("Point expected"), uo = (e) => R(R(e * e) * e + io), Fi = (e) => hn(e, 0n, ke), _r = (e) => hn(e, 1n, ke), gu = (e) => hn(e, 1n, au), Dn = (e) => (e & 1n) === 0n, fo = (e) => Uint8Array.of(e), yu = (e) => fo(Dn(e) ? 2 : 3), bu = (e) => {
   const t = uo(_r(e));
   let r = 1n;
   for (let n = t, i = (ke + 1n) / 4n; i > 0n; i >>= 1n)
@@ -4537,13 +4537,13 @@ class Rt {
     ui(t);
     const { publicKey: r, publicKeyUncompressed: n } = fu;
     let i;
-    const o = t.length, a = t[0], u = t.subarray(1), l = Wi(u, 0, Dn);
+    const o = t.length, a = t[0], u = t.subarray(1), l = Wi(u, 0, Vn);
     if (o === r && (a === 2 || a === 3)) {
       let d = bu(l);
-      const f = Vn(d);
-      Vn($r(a)) !== f && (d = R(-d)), i = new Rt(l, d, 1n);
+      const f = Dn(d);
+      Dn($r(a)) !== f && (d = R(-d)), i = new Rt(l, d, 1n);
     }
-    return o === n && a === 4 && (i = new Rt(l, Wi(u, Dn, hi), 1n)), i ? i.assertValidity() : xt("bad point: not on curve");
+    return o === n && a === 4 && (i = new Rt(l, Wi(u, Vn, hi), 1n)), i ? i.assertValidity() : xt("bad point: not on curve");
   }
   static fromHex(t) {
     return Rt.fromBytes(ho(t));
@@ -5460,7 +5460,7 @@ function wo(e) {
     throw new Error("Hash must wrapped by utils.createHasher");
   xe(e.outputLen), xe(e.blockLen);
 }
-function Dr(e, t = !0) {
+function Vr(e, t = !0) {
   if (e.destroyed)
     throw new Error("Hash instance has been destroyed");
   if (t && e.finished)
@@ -5472,7 +5472,7 @@ function Tu(e, t) {
   if (e.length < r)
     throw new Error('"digestInto() output" expected to be of length >=' + r);
 }
-function Vr(...e) {
+function Dr(...e) {
   for (let t = 0; t < e.length; t++)
     e[t].fill(0);
 }
@@ -5570,7 +5570,7 @@ class Bu {
     this.blockLen = t, this.outputLen = r, this.padOffset = n, this.isLE = i, this.buffer = new Uint8Array(t), this.view = vn(this.buffer);
   }
   update(t) {
-    Dr(this), ut(t);
+    Vr(this), ut(t);
     const { view: r, buffer: n, blockLen: i } = this, o = t.length;
     for (let a = 0; a < o; ) {
       const u = Math.min(i - this.pos, o - a);
@@ -5585,10 +5585,10 @@ class Bu {
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
-    Dr(this), Tu(t, this), this.finished = !0;
+    Vr(this), Tu(t, this), this.finished = !0;
     const { buffer: r, view: n, blockLen: i, isLE: o } = this;
     let { pos: a } = this;
-    r[a++] = 128, Vr(this.buffer.subarray(a)), this.padOffset > i - a && (this.process(n, 0), a = 0);
+    r[a++] = 128, Dr(this.buffer.subarray(a)), this.padOffset > i - a && (this.process(n, 0), a = 0);
     for (let p = a; p < i; p++)
       r[p] = 0;
     n.setBigUint64(i - 8, BigInt(this.length * 8), o), this.process(n, 0);
@@ -5718,10 +5718,10 @@ class Ru extends Bu {
     n = n + this.A | 0, i = i + this.B | 0, o = o + this.C | 0, a = a + this.D | 0, u = u + this.E | 0, l = l + this.F | 0, d = d + this.G | 0, f = f + this.H | 0, this.set(n, i, o, a, u, l, d, f);
   }
   roundClean() {
-    Vr(pe);
+    Dr(pe);
   }
   destroy() {
-    this.set(0, 0, 0, 0, 0, 0, 0, 0), Vr(this.buffer);
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), Dr(this.buffer);
   }
 }
 class Nu extends Ru {
@@ -5801,7 +5801,7 @@ function Ku(e) {
   return t;
 }
 const pi = (e) => (Wn << BigInt(e)) - Wn;
-function Du(e, t, r) {
+function Vu(e, t, r) {
   if (xe(e, "hashLen"), xe(t, "qByteLen"), typeof r != "function")
     throw new Error("hmacFn must be a function");
   const n = (E) => new Uint8Array(E), i = Uint8Array.of(), o = Uint8Array.of(0), a = Uint8Array.of(1), u = 1e3;
@@ -5854,8 +5854,8 @@ function Zi(e) {
     return t.set(r, o), o;
   };
 }
-const Ot = /* @__PURE__ */ BigInt(0), Tt = /* @__PURE__ */ BigInt(1), Ae = /* @__PURE__ */ BigInt(2), So = /* @__PURE__ */ BigInt(3), Ao = /* @__PURE__ */ BigInt(4), vo = /* @__PURE__ */ BigInt(5), Vu = /* @__PURE__ */ BigInt(7), To = /* @__PURE__ */ BigInt(8), Mu = /* @__PURE__ */ BigInt(9), ko = /* @__PURE__ */ BigInt(16);
-function Vt(e, t) {
+const Ot = /* @__PURE__ */ BigInt(0), Tt = /* @__PURE__ */ BigInt(1), Ae = /* @__PURE__ */ BigInt(2), So = /* @__PURE__ */ BigInt(3), Ao = /* @__PURE__ */ BigInt(4), vo = /* @__PURE__ */ BigInt(5), Du = /* @__PURE__ */ BigInt(7), To = /* @__PURE__ */ BigInt(8), Mu = /* @__PURE__ */ BigInt(9), ko = /* @__PURE__ */ BigInt(16);
+function Dt(e, t) {
   const r = e % t;
   return r >= Ot ? r : t + r;
 }
@@ -5870,14 +5870,14 @@ function Qi(e, t) {
     throw new Error("invert: expected non-zero number");
   if (t <= Ot)
     throw new Error("invert: expected positive modulus, got " + t);
-  let r = Vt(e, t), n = t, i = Ot, o = Tt;
+  let r = Dt(e, t), n = t, i = Ot, o = Tt;
   for (; r !== Ot; ) {
     const a = n / r, u = n % r, l = i - o * a;
     n = r, r = u, i = o, o = l;
   }
   if (n !== Tt)
     throw new Error("invert: does not exist");
-  return Vt(i, t);
+  return Dt(i, t);
 }
 function wi(e, t, r) {
   if (!e.eql(e.sqr(t), r))
@@ -5892,7 +5892,7 @@ function Fu(e, t) {
   return wi(e, u, t), u;
 }
 function Wu(e) {
-  const t = cn(e), r = Oo(e), n = r(t, t.neg(t.ONE)), i = r(t, n), o = r(t, t.neg(n)), a = (e + Vu) / ko;
+  const t = cn(e), r = Oo(e), n = r(t, t.neg(t.ONE)), i = r(t, n), o = r(t, t.neg(n)), a = (e + Du) / ko;
   return (u, l) => {
     let d = u.pow(l, a), f = u.mul(d, n);
     const p = u.mul(d, i), w = u.mul(d, o), y = u.eql(u.sqr(f), l), m = u.eql(u.sqr(p), l);
@@ -6014,7 +6014,7 @@ class Xu {
     this.ORDER = t, this.BITS = i, this.BYTES = o, this._sqrt = void 0, Object.preventExtensions(this);
   }
   create(t) {
-    return Vt(t, this.ORDER);
+    return Dt(t, this.ORDER);
   }
   isValid(t) {
     if (typeof t != "bigint")
@@ -6032,28 +6032,28 @@ class Xu {
     return (t & Tt) === Tt;
   }
   neg(t) {
-    return Vt(-t, this.ORDER);
+    return Dt(-t, this.ORDER);
   }
   eql(t, r) {
     return t === r;
   }
   sqr(t) {
-    return Vt(t * t, this.ORDER);
+    return Dt(t * t, this.ORDER);
   }
   add(t, r) {
-    return Vt(t + r, this.ORDER);
+    return Dt(t + r, this.ORDER);
   }
   sub(t, r) {
-    return Vt(t - r, this.ORDER);
+    return Dt(t - r, this.ORDER);
   }
   mul(t, r) {
-    return Vt(t * r, this.ORDER);
+    return Dt(t * r, this.ORDER);
   }
   pow(t, r) {
     return qu(this, t, r);
   }
   div(t, r) {
-    return Vt(t * Qi(r, this.ORDER), this.ORDER);
+    return Dt(t * Qi(r, this.ORDER), this.ORDER);
   }
   // Same as above, but doesn't normalize
   sqrN(t) {
@@ -6089,7 +6089,7 @@ class Xu {
     if (t.length !== i)
       throw new Error("Field.fromBytes: expected " + i + " bytes, got " + t.length);
     let l = o ? Eo(t) : fn(t);
-    if (u && (l = Vt(l, a)), !r && !this.isValid(l))
+    if (u && (l = Dt(l, a)), !r && !this.isValid(l))
       throw new Error("invalid field element: outside of range 0..ORDER");
     return l;
   }
@@ -6121,7 +6121,7 @@ function Zu(e, t, r = !1) {
   const n = e.length, i = Po(t), o = Bo(t);
   if (n < 16 || n < o || n > 1024)
     throw new Error("expected " + o + "-1024 bytes of input, got " + n);
-  const a = r ? Eo(e) : fn(e), u = Vt(a, t - Tt) + Tt;
+  const a = r ? Eo(e) : fn(e), u = Dt(a, t - Tt) + Tt;
   return r ? Io(u, i) : li(u, i);
 }
 const We = /* @__PURE__ */ BigInt(0), ve = /* @__PURE__ */ BigInt(1);
@@ -6303,13 +6303,13 @@ let No = class {
     this.iHash.update(i), this.oHash = t.create();
     for (let o = 0; o < i.length; o++)
       i[o] ^= 106;
-    this.oHash.update(i), Vr(i);
+    this.oHash.update(i), Dr(i);
   }
   update(t) {
-    return Dr(this), this.iHash.update(t), this;
+    return Vr(this), this.iHash.update(t), this;
   }
   digestInto(t) {
-    Dr(this), ut(t, this.outputLen, "output"), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
+    Vr(this), ut(t, this.outputLen, "output"), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
   }
   digest() {
     const t = new Uint8Array(this.oHash.outputLen);
@@ -6489,8 +6489,8 @@ function of(e, t = {}) {
         throw new Error("bad point: is not on curve, sqrt error" + ft);
       }
       f();
-      const V = n.isOdd(L);
-      return (x & 1) === 1 !== V && (L = n.neg(L)), { x: $, y: L };
+      const D = n.isOdd(L);
+      return (x & 1) === 1 !== D && (L = n.neg(L)), { x: $, y: L };
     } else if (A === v && x === 4) {
       const $ = n.BYTES, K = n.fromBytes(C.subarray(0, $)), L = n.fromBytes(C.subarray($, $ * 2));
       if (!S(K, L))
@@ -6622,8 +6622,8 @@ function of(e, t = {}) {
     /** Compare one point to another. */
     equals(k) {
       H(k);
-      const { X: v, Y: A, Z: x } = this, { X: C, Y: $, Z: K } = k, L = n.eql(n.mul(v, K), n.mul(C, x)), V = n.eql(n.mul(A, K), n.mul($, x));
-      return L && V;
+      const { X: v, Y: A, Z: x } = this, { X: C, Y: $, Z: K } = k, L = n.eql(n.mul(v, K), n.mul(C, x)), D = n.eql(n.mul(A, K), n.mul($, x));
+      return L && D;
     }
     /** Flips point to one corresponding to (x, -y) in Affine coordinates. */
     negate() {
@@ -6635,8 +6635,8 @@ function of(e, t = {}) {
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
       const { a: k, b: v } = o, A = n.mul(v, Tr), { X: x, Y: C, Z: $ } = this;
-      let K = n.ZERO, L = n.ZERO, V = n.ZERO, F = n.mul(x, x), ft = n.mul(C, C), W = n.mul($, $), D = n.mul(x, C);
-      return D = n.add(D, D), V = n.mul(x, $), V = n.add(V, V), K = n.mul(k, V), L = n.mul(A, W), L = n.add(K, L), K = n.sub(ft, L), L = n.add(ft, L), L = n.mul(K, L), K = n.mul(D, K), V = n.mul(A, V), W = n.mul(k, W), D = n.sub(F, W), D = n.mul(k, D), D = n.add(D, V), V = n.add(F, F), F = n.add(V, F), F = n.add(F, W), F = n.mul(F, D), L = n.add(L, F), W = n.mul(C, $), W = n.add(W, W), F = n.mul(W, D), K = n.sub(K, F), V = n.mul(W, ft), V = n.add(V, V), V = n.add(V, V), new M(K, L, V);
+      let K = n.ZERO, L = n.ZERO, D = n.ZERO, F = n.mul(x, x), ft = n.mul(C, C), W = n.mul($, $), V = n.mul(x, C);
+      return V = n.add(V, V), D = n.mul(x, $), D = n.add(D, D), K = n.mul(k, D), L = n.mul(A, W), L = n.add(K, L), K = n.sub(ft, L), L = n.add(ft, L), L = n.mul(K, L), K = n.mul(V, K), D = n.mul(A, D), W = n.mul(k, W), V = n.sub(F, W), V = n.mul(k, V), V = n.add(V, D), D = n.add(F, F), F = n.add(D, F), F = n.add(F, W), F = n.mul(F, V), L = n.add(L, F), W = n.mul(C, $), W = n.add(W, W), F = n.mul(W, V), K = n.sub(K, F), D = n.mul(W, ft), D = n.add(D, D), D = n.add(D, D), new M(K, L, D);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -6645,12 +6645,12 @@ function of(e, t = {}) {
     add(k) {
       H(k);
       const { X: v, Y: A, Z: x } = this, { X: C, Y: $, Z: K } = k;
-      let L = n.ZERO, V = n.ZERO, F = n.ZERO;
+      let L = n.ZERO, D = n.ZERO, F = n.ZERO;
       const ft = o.a, W = n.mul(o.b, Tr);
-      let D = n.mul(v, C), nt = n.mul(A, $), ct = n.mul(x, K), _t = n.add(v, A), it = n.add(C, $);
-      _t = n.mul(_t, it), it = n.add(D, nt), _t = n.sub(_t, it), it = n.add(v, x);
+      let V = n.mul(v, C), nt = n.mul(A, $), ct = n.mul(x, K), _t = n.add(v, A), it = n.add(C, $);
+      _t = n.mul(_t, it), it = n.add(V, nt), _t = n.sub(_t, it), it = n.add(v, x);
       let gt = n.add(C, K);
-      return it = n.mul(it, gt), gt = n.add(D, ct), it = n.sub(it, gt), gt = n.add(A, x), L = n.add($, K), gt = n.mul(gt, L), L = n.add(nt, ct), gt = n.sub(gt, L), F = n.mul(ft, it), L = n.mul(W, ct), F = n.add(L, F), L = n.sub(nt, F), F = n.add(nt, F), V = n.mul(L, F), nt = n.add(D, D), nt = n.add(nt, D), ct = n.mul(ft, ct), it = n.mul(W, it), nt = n.add(nt, ct), ct = n.sub(D, ct), ct = n.mul(ft, ct), it = n.add(it, ct), D = n.mul(nt, it), V = n.add(V, D), D = n.mul(gt, it), L = n.mul(_t, L), L = n.sub(L, D), D = n.mul(_t, nt), F = n.mul(gt, F), F = n.add(F, D), new M(L, V, F);
+      return it = n.mul(it, gt), gt = n.add(V, ct), it = n.sub(it, gt), gt = n.add(A, x), L = n.add($, K), gt = n.mul(gt, L), L = n.add(nt, ct), gt = n.sub(gt, L), F = n.mul(ft, it), L = n.mul(W, ct), F = n.add(L, F), L = n.sub(nt, F), F = n.add(nt, F), D = n.mul(L, F), nt = n.add(V, V), nt = n.add(nt, V), ct = n.mul(ft, ct), it = n.mul(W, it), nt = n.add(nt, ct), ct = n.sub(V, ct), ct = n.mul(ft, ct), it = n.add(it, ct), V = n.mul(nt, it), D = n.add(D, V), V = n.mul(gt, it), L = n.mul(_t, L), L = n.sub(L, V), V = n.mul(_t, nt), F = n.mul(gt, F), F = n.add(F, V), new M(L, D, F);
     }
     subtract(k) {
       return this.add(k.negate());
@@ -6674,8 +6674,8 @@ function of(e, t = {}) {
       let A, x;
       const C = ($) => te.cached(this, $, (K) => ts(M, K));
       if (v) {
-        const { k1neg: $, k1: K, k2neg: L, k2: V } = j(k), { p: F, f: ft } = C(K), { p: W, f: D } = C(V);
-        x = ft.add(D), A = q(v.beta, F, W, $, L);
+        const { k1neg: $, k1: K, k2neg: L, k2: D } = j(k), { p: F, f: ft } = C(K), { p: W, f: V } = C(D);
+        x = ft.add(V), A = q(v.beta, F, W, $, L);
       } else {
         const { p: $, f: K } = C(k);
         A = $, x = K;
@@ -6698,8 +6698,8 @@ function of(e, t = {}) {
       if (te.hasCache(this))
         return this.multiply(k);
       if (v) {
-        const { k1neg: x, k1: C, k2neg: $, k2: K } = j(k), { p1: L, p2: V } = Ju(M, A, C, K);
-        return q(v.beta, L, V, x, $);
+        const { k1neg: x, k1: C, k2neg: $, k2: K } = j(k), { p1: L, p2: D } = Ju(M, A, C, K);
+        return q(v.beta, L, D, x, $);
       } else
         return te.unsafe(A, k);
     }
@@ -6845,8 +6845,8 @@ function hf(e, t, r = {}) {
       U(A, x);
       let C;
       if (x === "der") {
-        const { r: V, s: F } = ye.toSig(ut(A));
-        return new H(V, F);
+        const { r: D, s: F } = ye.toSig(ut(A));
+        return new H(D, F);
       }
       x === "recovered" && (C = A[0], x = "compact", A = A.subarray(1));
       const $ = y.signature / 2, K = A.subarray(0, $), L = A.subarray($, $ * 2);
@@ -6868,7 +6868,7 @@ function hf(e, t, r = {}) {
       const { r: x, s: C } = this, $ = this.assertRecovery(), K = $ === 2 || $ === 3 ? x + u : x;
       if (!o.isValid(K))
         throw new Error("invalid recovery id: sig.r+curve.n != R.x");
-      const L = o.toBytes(K), V = e.fromBytes(be(Co(($ & 1) === 0), L)), F = a.inv(K), ft = rt(ut(A, void 0, "msgHash")), W = a.create(-ft * F), D = a.create(C * F), nt = e.BASE.multiplyUnsafe(W).add(V.multiplyUnsafe(D));
+      const L = o.toBytes(K), D = e.fromBytes(be(Co(($ & 1) === 0), L)), F = a.inv(K), ft = rt(ut(A, void 0, "msgHash")), W = a.create(-ft * F), V = a.create(C * F), nt = e.BASE.multiplyUnsafe(W).add(D.multiplyUnsafe(V));
       if (nt.is0())
         throw new Error("invalid recovery: point at infinify");
       return nt.assertValidity(), nt;
@@ -6904,46 +6904,46 @@ function hf(e, t, r = {}) {
   function Bt(v, A, x) {
     const { lowS: C, prehash: $, extraEntropy: K } = On(x, m);
     v = M(v, $);
-    const L = rt(v), V = a.fromBytes(A);
-    if (!a.isValidNot0(V))
+    const L = rt(v), D = a.fromBytes(A);
+    if (!a.isValidNot0(D))
       throw new Error("invalid private key");
-    const F = [q(V), q(L)];
+    const F = [q(D), q(L)];
     if (K != null && K !== !1) {
       const nt = K === !0 ? n(y.secretKey) : K;
       F.push(ut(nt, void 0, "extraEntropy"));
     }
     const ft = be(...F), W = L;
-    function D(nt) {
+    function V(nt) {
       const ct = j(nt);
       if (!a.isValidNot0(ct))
         return;
       const _t = a.inv(ct), it = e.BASE.multiply(ct).toAffine(), gt = a.create(it.x);
       if (gt === ie)
         return;
-      const Dt = a.create(_t * a.create(W + gt * V));
-      if (Dt === ie)
+      const Vt = a.create(_t * a.create(W + gt * D));
+      if (Vt === ie)
         return;
-      let _e = (it.x === gt ? 0 : 2) | Number(it.y & Ke), je = Dt;
-      return C && S(Dt) && (je = a.neg(Dt), _e ^= 1), new H(gt, je, E ? void 0 : _e);
+      let _e = (it.x === gt ? 0 : 2) | Number(it.y & Ke), je = Vt;
+      return C && S(Vt) && (je = a.neg(Vt), _e ^= 1), new H(gt, je, E ? void 0 : _e);
     }
-    return { seed: ft, k2sig: D };
+    return { seed: ft, k2sig: V };
   }
   function te(v, A, x = {}) {
     const { seed: C, k2sig: $ } = Bt(v, A, x);
-    return Du(t.outputLen, a.BYTES, i)(C, $).toBytes(x.format);
+    return Vu(t.outputLen, a.BYTES, i)(C, $).toBytes(x.format);
   }
   function X(v, A, x, C = {}) {
     const { lowS: $, prehash: K, format: L } = On(C, m);
     if (x = ut(x, void 0, "publicKey"), A = M(A, K), !fi(v)) {
-      const V = v instanceof H ? ", use sig.toBytes()" : "";
-      throw new Error("verify expects Uint8Array signature" + V);
+      const D = v instanceof H ? ", use sig.toBytes()" : "";
+      throw new Error("verify expects Uint8Array signature" + D);
     }
     U(v, L);
     try {
-      const V = H.fromBytes(v, L), F = e.fromBytes(x);
-      if ($ && V.hasHighS())
+      const D = H.fromBytes(v, L), F = e.fromBytes(x);
+      if ($ && D.hasHighS())
         return !1;
-      const { r: ft, s: W } = V, D = rt(A), nt = a.inv(W), ct = a.create(D * nt), _t = a.create(ft * nt), it = e.BASE.multiplyUnsafe(ct).add(F.multiplyUnsafe(_t));
+      const { r: ft, s: W } = D, V = rt(A), nt = a.inv(W), ct = a.create(V * nt), _t = a.create(ft * nt), it = e.BASE.multiplyUnsafe(ct).add(F.multiplyUnsafe(_t));
       return it.is0() ? !1 : a.create(it.x) === ft;
     } catch {
       return !1;
@@ -7311,7 +7311,7 @@ class Ut {
     return Ut.#t !== void 0;
   }
 }
-function Ip(e) {
+function Sp(e) {
   if (e === void 0) {
     Ut.clear();
     return;
@@ -7381,7 +7381,7 @@ function bf(e) {
   return me(e.length, r), Nt([r, e]);
 }
 const os = Y, as = 1, mf = 80;
-let Do = class rr {
+let Vo = class rr {
   // Static public fields
   static NAME = wt.P2TR;
   // Private instance fields
@@ -7477,14 +7477,14 @@ let Do = class rr {
    * This is the tweaked pubkey that appears in the output.
    */
   get pubkey() {
-    return this.#b || (this.#l = this.#D(), this.#b = !0), this.#l;
+    return this.#b || (this.#l = this.#V(), this.#b = !0), this.#l;
   }
   /**
    * x-only internal pubkey (32 bytes).
    * This is the untweaked pubkey before adding the merkle root tweak.
    */
   get internalPubkey() {
-    return this.#v || (this.#d = this.#V(), this.#v = !0), this.#d;
+    return this.#v || (this.#d = this.#D(), this.#v = !0), this.#d;
   }
   /**
    * Merkle root hash (32 bytes).
@@ -7628,7 +7628,7 @@ let Do = class rr {
     const r = at.bech32m.toWords(t);
     return r.unshift(as), at.bech32m.encode(this.#t.bech32, r);
   }
-  #D() {
+  #V() {
     if (this.#s)
       return this.#s;
     if (this.#u)
@@ -7642,7 +7642,7 @@ let Do = class rr {
         return r.x;
     }
   }
-  #V() {
+  #D() {
     if (this.#r)
       return this.#r;
     const t = this.#H();
@@ -7810,7 +7810,7 @@ let Do = class rr {
 function dr(e, t) {
   if (!e.address && !e.output && !e.pubkey && !e.internalPubkey && !(e.witness && e.witness.length > 1))
     throw new TypeError("Not enough data");
-  const r = new Do(
+  const r = new Vo(
     {
       address: e.address,
       pubkey: e.pubkey,
@@ -7829,7 +7829,7 @@ function dr(e, t) {
   return Object.assign(r.toPayment(), e);
 }
 const hs = Y, Ef = new Uint8Array(0);
-let Vo = class nr {
+let Do = class nr {
   // Static public fields
   static NAME = wt.P2WPKH;
   // Private instance fields
@@ -8127,7 +8127,7 @@ let Vo = class nr {
 function ln(e, t) {
   if (!e.address && !e.hash && !e.output && !e.pubkey && !e.witness)
     throw new TypeError("Not enough data");
-  const r = new Vo(
+  const r = new Do(
     {
       address: e.address,
       hash: e.hash,
@@ -8702,7 +8702,7 @@ function yi(e, t) {
   return Object.assign(r.toPayment(), e);
 }
 const He = Y, Ur = He.OP_RESERVED;
-class De {
+class Ve {
   // Static public fields
   static NAME = wt.P2MS;
   // Private instance fields
@@ -8829,7 +8829,7 @@ class De {
    * ```
    */
   static fromPubkeys(t, r, n) {
-    return new De({ m: t, pubkeys: r, network: n });
+    return new Ve({ m: t, pubkeys: r, network: n });
   }
   /**
    * Creates a P2MS payment from a scriptPubKey.
@@ -8839,7 +8839,7 @@ class De {
    * @returns A new P2MS payment instance
    */
   static fromOutput(t, r) {
-    return new De({ output: t, network: r });
+    return new Ve({ output: t, network: r });
   }
   /**
    * Creates a P2MS payment from signatures (for spending).
@@ -8851,7 +8851,7 @@ class De {
    * @returns A new P2MS payment instance
    */
   static fromSignatures(t, r, n, i) {
-    return new De({ signatures: t, m: r, pubkeys: n, network: i });
+    return new Ve({ signatures: t, m: r, pubkeys: n, network: i });
   }
   // Private helper methods
   /**
@@ -8980,7 +8980,7 @@ class De {
 function gr(e, t) {
   if (!e.input && !e.output && !(e.pubkeys && e.m !== void 0) && !e.signatures)
     throw new TypeError("Not enough data");
-  const r = new De(
+  const r = new Ve(
     {
       m: e.m,
       n: e.n,
@@ -9433,7 +9433,7 @@ function Be(e) {
     }
   };
 }
-const Af = Be(gr), vf = Be(yi), Tf = Be(lr), pn = Be(ln), ps = Be(wr), Wo = Be(pr), Go = Be(dr), Sp = (e) => e.length === 4 && e[0] === 81 && // OP_1
+const Af = Be(gr), vf = Be(yi), Tf = Be(lr), pn = Be(ln), ps = Be(wr), Wo = Be(pr), Go = Be(dr), Ap = (e) => e.length === 4 && e[0] === 81 && // OP_1
 e[1] === 2 && // push 2 bytes
 e[2] === 78 && e[3] === 115;
 function sr(e) {
@@ -9494,7 +9494,7 @@ function Of(e) {
 function ds(e, t, r) {
   const n = Mf(t, e, r);
   try {
-    const i = Df(t, n).concat(new Uint8Array(n.script)).concat(new Uint8Array(n.controlBlock));
+    const i = Vf(t, n).concat(new Uint8Array(n.script)).concat(new Uint8Array(n.controlBlock));
     return { finalScriptWitness: sr(i) };
   } catch (i) {
     throw new Error(`Can not finalize taproot input #${e}: ${i}`);
@@ -9583,14 +9583,14 @@ function qn(e, t, r = 0) {
   if (i) return [t && t[0], i];
 }
 function Cf(e, t, r) {
-  const n = $t(e) && Ve(t), i = Ve(e) && $t(t), o = e === t && $t(t) && Ve(t);
+  const n = $t(e) && De(t), i = De(e) && $t(t), o = e === t && $t(t) && De(t);
   if (n || i || o)
     throw new Error(
       `Invalid arguments for Psbt.${r}. Cannot use both taproot and non-taproot fields.`
     );
 }
 function $f(e, t, r) {
-  const n = Pn(e) && Ve(t), i = Ve(e) && Pn(t), o = e === t && Pn(t) && Ve(t);
+  const n = Pn(e) && De(t), i = De(e) && Pn(t), o = e === t && Pn(t) && De(t);
   if (n || i || o)
     throw new Error(
       `Invalid arguments for Psbt.${r}. Cannot use both taproot and non-taproot fields.`
@@ -9621,14 +9621,14 @@ function Bn(e, t) {
   }), n = jr(new Uint8Array(e.controlBlock), r);
   return P(n, t);
 }
-function Df(e, t) {
+function Vf(e, t) {
   const r = new Uint8Array(t.script), n = Yt({
     output: r,
     version: t.leafVersion
   });
-  return (e.tapScriptSig || []).filter((i) => P(new Uint8Array(i.leafHash), n)).map((i) => Vf(r, i)).sort((i, o) => o.positionInScript - i.positionInScript).map((i) => new Uint8Array(i.signature));
+  return (e.tapScriptSig || []).filter((i) => P(new Uint8Array(i.leafHash), n)).map((i) => Df(r, i)).sort((i, o) => o.positionInScript - i.positionInScript).map((i) => new Uint8Array(i.signature));
 }
-function Vf(e, t) {
+function Df(e, t) {
   return Object.assign(
     {
       positionInScript: jo(new Uint8Array(t.pubkey), e)
@@ -9656,7 +9656,7 @@ function Ff(e, t, r) {
   });
   return (!r || P(r, n)) && t.find((i) => P(new Uint8Array(i.leafHash), n)) !== void 0;
 }
-function Ve(e) {
+function De(e) {
   return e && !!(e.redeemScript || e.witnessScript || e.bip32Derivation && e.bip32Derivation.length);
 }
 const qo = {
@@ -10003,7 +10003,7 @@ const Xf = {
   verifySignatures: !0,
   preserveWorkers: !1
 };
-class ge {
+let vp = class ge {
   /**
    * Singleton instance.
    */
@@ -10361,8 +10361,8 @@ class ge {
     const t = this.#e.filter((r) => r.state === At.Idle);
     await Promise.all(t.map((r) => this.#d(r)));
   }
-}
-function Ap(e, t, r = {}) {
+};
+function Tp(e, t, r = {}) {
   const n = [], i = e.data.inputs, o = t.publicKey;
   for (let a = 0; a < i.length; a++) {
     const u = i[a];
@@ -10408,7 +10408,7 @@ function Qf(e, t, r, n, i) {
     return null;
   }
 }
-function vp(e, t, r) {
+function kp(e, t, r) {
   const n = r.publicKey;
   for (const [i, o] of t.signatures) {
     const a = e.data.inputs[i];
@@ -10580,7 +10580,7 @@ function ea(e, t) {
   }
   throw new TypeError(e + " has no matching Script");
 }
-const Tp = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Up = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   FUTURE_MAX_VERSION: Yo,
   FUTURE_OPNET_VERSION: Yr,
@@ -10745,13 +10745,13 @@ const rc = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   Embed: ur,
   LEAF_VERSION_TAPSCRIPT: Gr,
   MAX_TAPTREE_DEPTH: Ko,
-  P2MS: De,
+  P2MS: Ve,
   P2OP: Gs,
   P2PK: Fo,
   P2PKH: lo,
   P2SH: po,
-  P2TR: Do,
-  P2WPKH: Vo,
+  P2TR: Vo,
+  P2WPKH: Do,
   P2WSH: Mo,
   PaymentType: wt,
   findScriptPath: hr,
@@ -11047,14 +11047,14 @@ function Kc(e) {
     signature: e.value
   };
 }
-function Dc(e) {
+function Vc(e) {
   const t = new Uint8Array([B.PARTIAL_SIG]);
   return {
     key: Qt([t, e.pubkey]),
     value: e.signature
   };
 }
-const Vc = "{ pubkey: Uint8Array; signature: Uint8Array; }";
+const Dc = "{ pubkey: Uint8Array; signature: Uint8Array; }";
 function Mc(e) {
   return e.pubkey instanceof Uint8Array && e.signature instanceof Uint8Array && [33, 65].includes(e.pubkey.length) && [2, 3, 4].includes(e.pubkey[0]) && Fc(e.signature);
 }
@@ -11074,8 +11074,8 @@ const Gc = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   canAddToArray: Wc,
   check: Mc,
   decode: Kc,
-  encode: Dc,
-  expected: Vc
+  encode: Vc,
+  expected: Dc
 }, Symbol.toStringTag, { value: "Module" }));
 function jc(e) {
   if (e.key[0] !== B.POR_COMMITMENT)
@@ -11462,9 +11462,9 @@ function oa(e) {
     canAdd: o
   };
 }
-const Dl = (e) => e.length === 32;
+const Vl = (e) => e.length === 32;
 function aa(e) {
-  const t = mi(e, Dl);
+  const t = mi(e, Vl);
   function r(a) {
     const { numberValue: u, bytes: l } = Ge(
       a.value
@@ -11593,7 +11593,7 @@ const Ii = {
   ),
   tapTree: Cl,
   tapInternalKey: ha(ht.TAP_INTERNAL_KEY)
-}, Vl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}, Dl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   globals: Ii,
   inputs: dt,
@@ -11967,7 +11967,7 @@ function Si(e) {
     for (const n of Object.keys(t)) {
       const i = t[n], { canAdd: o, canAddToArray: a, check: u, expected: l } = (
         // @ts-ignore
-        Vl[e + "s"][n] || {}
+        Dl[e + "s"][n] || {}
       ), d = !!a;
       if (u)
         if (d) {
@@ -13314,49 +13314,49 @@ class Qn {
     }
   }
 }
-const kp = {
+const Op = {
   payments: rc,
-  script: Vh,
+  script: Dh,
   crypto: ou
 };
 export {
   ta as A,
-  vp as B,
+  Dh as B,
   Qn as C,
-  $e as D,
-  Xo as E,
-  ps as F,
-  ou as H,
-  Tp as I,
-  kp as J,
-  Sp as K,
-  Ip as L,
-  pn as M,
-  vf as N,
-  mp as O,
-  Vh as R,
-  Zt as T,
+  yf as E,
+  $e as F,
+  pn as H,
+  Up as I,
+  Op as J,
+  ps as L,
+  vp as N,
+  vf as P,
+  Tf as R,
+  Nt as S,
+  Sp as T,
+  ou as U,
   P as V,
   Fn as W,
-  Nt as a,
-  gp as b,
-  wt as c,
-  Et as d,
-  Ap as e,
-  ge as f,
-  nu as g,
-  Tf as h,
+  Wo as _,
+  Zt as a,
+  nu as b,
+  Go as c,
+  mp as d,
+  yp as e,
+  wt as f,
+  kp as g,
+  Xo as h,
   or as i,
-  Wo as j,
-  yf as k,
-  pp as l,
-  bp as m,
-  Af as n,
-  lp as o,
-  Go as p,
+  Ap as j,
+  Af as k,
+  Et as l,
+  lp as m,
+  pp as o,
+  jo as p,
   tt as q,
+  Tp as r,
   Mt as s,
   rc as v,
-  jo as w,
+  Ep as x,
   Y as z
 };