@btc-vision/transaction 1.8.7 → 1.8.9

package/browser/btc-vision-bitcoin.js

@@ -156,10 +156,10 @@ var kt = {
     scriptHash: 196,
     wif: 239
   }
-}, Symbol.toStringTag, { value: "Module" })), ye = {}, mi;
+}, Symbol.toStringTag, { value: "Module" })), ge = {}, mi;
 function Ia() {
-  if (mi) return ye;
-  mi = 1, Object.defineProperty(ye, "__esModule", { value: !0 }), ye.bech32m = ye.bech32 = void 0;
+  if (mi) return ge;
+  mi = 1, Object.defineProperty(ge, "__esModule", { value: !0 }), ge.bech32m = ge.bech32 = void 0;
   const e = "qpzry9x8gf2tvdw0s3jn54khce6mua7l", t = {};
   for (let p = 0; p < 32; p++) {
     const u = e.charAt(p);
@@ -184,13 +184,13 @@ function Ia() {
     return u;
   }
   function i(p, u, d, w) {
-    let b = 0, m = 0;
+    let g = 0, m = 0;
     const v = (1 << d) - 1, I = [];
-    for (let P = 0; P < p.length; ++P) for (b = b << u | p[P], m += u; m >= d; ) m -= d, I.push(b >> m & v);
-    if (w) m > 0 && I.push(b << d - m & v);
+    for (let P = 0; P < p.length; ++P) for (g = g << u | p[P], m += u; m >= d; ) m -= d, I.push(g >> m & v);
+    if (w) m > 0 && I.push(g << d - m & v);
     else {
       if (m >= u) return "Excess padding";
-      if (b << d - m & v) return "Non-zero padding";
+      if (g << d - m & v) return "Non-zero padding";
     }
     return I;
   }
@@ -239,20 +239,20 @@ function Ia() {
       if (_ === 0) return "Missing prefix for " + v;
       const O = v.slice(0, _), z = v.slice(_ + 1);
       if (z.length < 6) return "Data too short";
-      let D = n(O);
-      if (typeof D == "string") return D;
-      const X = [];
-      for (let at = 0; at < z.length; ++at) {
-        const q = z.charAt(at), Vt = t[q];
+      let M = n(O);
+      if (typeof M == "string") return M;
+      const Z = [];
+      for (let Q = 0; Q < z.length; ++Q) {
+        const q = z.charAt(Q), Vt = t[q];
         if (Vt === void 0) return "Unknown character " + q;
-        D = r(D) ^ Vt, !(at + 6 >= z.length) && X.push(Vt);
+        M = r(M) ^ Vt, !(Q + 6 >= z.length) && Z.push(Vt);
       }
-      return D !== u ? "Invalid checksum for " + v : {
+      return M !== u ? "Invalid checksum for " + v : {
         prefix: O,
-        words: X
+        words: Z
       };
     }
-    function b(v, I) {
+    function g(v, I) {
       const P = w(v, I);
       if (typeof P == "object") return P;
     }
@@ -262,7 +262,7 @@ function Ia() {
       throw new Error(P);
     }
     return {
-      decodeUnsafe: b,
+      decodeUnsafe: g,
       decode: m,
       encode: d,
       toWords: o,
@@ -270,19 +270,19 @@ function Ia() {
       fromWords: f
     };
   }
-  return ye.bech32 = l("bech32"), ye.bech32m = l("bech32m"), ye;
+  return ge.bech32 = l("bech32"), ge.bech32m = l("bech32m"), ge;
 }
-var tt = Ia();
+var et = Ia();
 function cr(e) {
   let t, r;
   try {
-    t = tt.bech32.decode(e);
+    t = et.bech32.decode(e);
   } catch {
   }
   if (t) {
     if (r = t.words[0], r !== 0) throw new TypeError(e + " uses wrong encoding");
-  } else if (t = tt.bech32m.decode(e), r = t.words[0], r === 0) throw new TypeError(e + " uses wrong encoding");
-  const n = tt.bech32.fromWords(t.words.slice(1));
+  } else if (t = et.bech32m.decode(e), r = t.words[0], r === 0) throw new TypeError(e + " uses wrong encoding");
+  const n = et.bech32.fromWords(t.words.slice(1));
   return {
     version: r,
     prefix: t.prefix,
@@ -351,7 +351,7 @@ function xa(e) {
 function Ts(e) {
   typeof e == "number" ? xa(e) : Pa(e);
 }
-function ge(e, t, r) {
+function ye(e, t, r) {
   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), {
@@ -397,7 +397,7 @@ function Ct(e) {
 var Kl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   decode: We,
-  encode: ge,
+  encode: ye,
   encodingLength: Ct
 }, 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);
@@ -901,13 +901,13 @@ var Wn = class {
   process(e, t) {
     for (let u = 0; u < 16; u++, t += 4) oe[u] = e.getUint32(t, !1);
     for (let u = 16; u < 64; u++) {
-      const d = oe[u - 15], w = oe[u - 2], b = Wt(d, 7) ^ Wt(d, 18) ^ d >>> 3;
-      oe[u] = (Wt(w, 17) ^ Wt(w, 19) ^ w >>> 10) + oe[u - 7] + b + oe[u - 16] | 0;
+      const d = oe[u - 15], w = oe[u - 2], g = Wt(d, 7) ^ Wt(d, 18) ^ d >>> 3, m = Wt(w, 17) ^ Wt(w, 19) ^ w >>> 10;
+      oe[u] = m + oe[u - 7] + g + oe[u - 16] | 0;
     }
     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 + 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;
+      const d = Wt(a, 6) ^ Wt(a, 11) ^ Wt(a, 25), w = p + d + Os(a, f, l) + Ca[u] + oe[u] | 0, g = (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 + g | 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);
   }
@@ -932,7 +932,7 @@ var Wn = class {
 }, 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);
+  const t = /* @__PURE__ */ new Uint8Array(256);
   for (let p = 0; p < t.length; p++) t[p] = 255;
   for (let p = 0; p < e.length; p++) {
     const u = e.charAt(p), d = u.charCodeAt(0);
@@ -944,10 +944,10 @@ function Ka(e) {
     if (p instanceof Uint8Array || (ArrayBuffer.isView(p) ? p = new Uint8Array(p.buffer, p.byteOffset, p.byteLength) : Array.isArray(p) && (p = Uint8Array.from(p))), !(p instanceof Uint8Array)) throw new TypeError("Expected Uint8Array");
     if (p.length === 0) return "";
     let u = 0, d = 0, w = 0;
-    const b = p.length;
-    for (; w !== b && p[w] === 0; ) w++, u++;
-    const m = (b - w) * o + 1 >>> 0, v = new Uint8Array(m);
-    for (; w !== b; ) {
+    const g = p.length;
+    for (; w !== g && p[w] === 0; ) w++, u++;
+    const m = (g - w) * o + 1 >>> 0, v = new Uint8Array(m);
+    for (; w !== g; ) {
       let S = p[w], _ = 0;
       for (let O = m - 1; (S !== 0 || _ < d) && O !== -1; O--, _++) S += 256 * v[O] >>> 0, v[O] = S % r >>> 0, S = S / r >>> 0;
       if (S !== 0) throw new Error("Non-zero carry");
@@ -961,25 +961,25 @@ function Ka(e) {
   }
   function f(p) {
     if (typeof p != "string") throw new TypeError("Expected String");
-    if (p.length === 0) return new Uint8Array();
+    if (p.length === 0) return /* @__PURE__ */ new Uint8Array();
     let u = 0, d = 0, w = 0;
     for (; p[u] === n; ) d++, u++;
-    const b = (p.length - u) * i + 1 >>> 0, m = new Uint8Array(b);
+    const g = (p.length - u) * i + 1 >>> 0, m = new Uint8Array(g);
     for (; u < p.length; ) {
       const S = p.charCodeAt(u);
       if (S > 255) return;
       let _ = t[S];
       if (_ === 255) return;
       let O = 0;
-      for (let z = b - 1; (_ !== 0 || O < w) && z !== -1; z--, O++) _ += r * m[z] >>> 0, m[z] = _ % 256 >>> 0, _ = _ / 256 >>> 0;
+      for (let z = g - 1; (_ !== 0 || O < w) && z !== -1; z--, O++) _ += r * m[z] >>> 0, m[z] = _ % 256 >>> 0, _ = _ / 256 >>> 0;
       if (_ !== 0) throw new Error("Non-zero carry");
       w = O, u++;
     }
-    let v = b - w;
-    for (; v !== b && m[v] === 0; ) v++;
-    const I = new Uint8Array(d + (b - v));
+    let v = g - w;
+    for (; v !== g && m[v] === 0; ) v++;
+    const I = new Uint8Array(d + (g - v));
     let P = d;
-    for (; v !== b; ) I[P++] = m[v++];
+    for (; v !== g; ) I[P++] = m[v++];
     return I;
   }
   function l(p) {
@@ -1304,21 +1304,21 @@ function eh(e) {
 }
 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) ;
+  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, g = e[t + d];
+  for (d += w, o = g & (1 << -u) - 1, g >>= -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) ;
   if (o === 0) o = 1 - p;
   else {
-    if (o === l) return a ? NaN : (b ? -1 : 1) * (1 / 0);
+    if (o === l) return a ? NaN : (g ? -1 : 1) * (1 / 0);
     a = a + Math.pow(2, n), o = o - p;
   }
-  return (b ? -1 : 1) * a * Math.pow(2, o - n);
+  return (g ? -1 : 1) * a * Math.pow(2, o - n);
 };
 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;
+  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, g = 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 + g] = f & 255, g += m, f /= 256, i -= 8) ;
+  for (a = a << i | f, p += i; p > 0; e[r + g] = a & 255, g += m, a /= 256, p -= 8) ;
+  e[r + g - m] |= v * 128;
 };
 (function(e) {
   const t = Zr, r = qn, n = typeof Symbol == "function" && typeof Symbol.for == "function" ? /* @__PURE__ */ Symbol.for("nodejs.util.inspect.custom") : null;
@@ -1367,10 +1367,10 @@ qn.write = function(e, t, r, n, i, o) {
     if (s == null) throw new TypeError("The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " + typeof s);
     if (Ft(s, a) || s && Ft(s.buffer, a) || typeof f < "u" && (Ft(s, f) || s && Ft(s.buffer, f))) return S(s, h, c);
     if (typeof s == "number") throw new TypeError('The "value" argument must not be of type number. Received type number');
-    const g = s.valueOf && s.valueOf();
-    if (g != null && g !== s) return u.from(g, h, c);
-    const y = _(s);
-    if (y) return y;
+    const y = s.valueOf && s.valueOf();
+    if (y != null && y !== s) return u.from(y, h, c);
+    const b = _(s);
+    if (b) return b;
     if (typeof Symbol < "u" && Symbol.toPrimitive != null && typeof s[Symbol.toPrimitive] == "function") return u.from(s[Symbol.toPrimitive]("string"), h, c);
     throw new TypeError("The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " + typeof s);
   }
@@ -1381,11 +1381,11 @@ qn.write = function(e, t, r, n, i, o) {
     if (typeof s != "number") throw new TypeError('"size" argument must be of type number');
     if (s < 0) throw new RangeError('The value "' + s + '" is invalid for option "size"');
   }
-  function b(s, h, c) {
+  function g(s, h, c) {
     return w(s), s <= 0 ? p(s) : h !== void 0 ? typeof c == "string" ? p(s).fill(h, c) : p(s).fill(h) : p(s);
   }
   u.alloc = function(s, h, c) {
-    return b(s, h, c);
+    return g(s, h, c);
   };
   function m(s) {
     return w(s), p(s < 0 ? 0 : O(s) | 0);
@@ -1397,14 +1397,14 @@ qn.write = function(e, t, r, n, i, o) {
   };
   function v(s, h) {
     if ((typeof h != "string" || h === "") && (h = "utf8"), !u.isEncoding(h)) throw new TypeError("Unknown encoding: " + h);
-    const c = D(s, h) | 0;
-    let g = p(c);
-    const y = g.write(s, h);
-    return y !== c && (g = g.slice(0, y)), g;
+    const c = M(s, h) | 0;
+    let y = p(c);
+    const b = y.write(s, h);
+    return b !== c && (y = y.slice(0, b)), y;
   }
   function I(s) {
     const h = s.length < 0 ? 0 : O(s.length) | 0, c = p(h);
-    for (let g = 0; g < h; g += 1) c[g] = s[g] & 255;
+    for (let y = 0; y < h; y += 1) c[y] = s[y] & 255;
     return c;
   }
   function P(s) {
@@ -1417,8 +1417,8 @@ qn.write = function(e, t, r, n, i, o) {
   function S(s, h, c) {
     if (h < 0 || s.byteLength < h) throw new RangeError('"offset" is outside of buffer bounds');
     if (s.byteLength < h + (c || 0)) throw new RangeError('"length" is outside of buffer bounds');
-    let g;
-    return h === void 0 && c === void 0 ? g = new o(s) : c === void 0 ? g = new o(s, h) : g = new o(s, h, c), Object.setPrototypeOf(g, u.prototype), g;
+    let y;
+    return h === void 0 && c === void 0 ? y = new o(s) : c === void 0 ? y = new o(s, h) : y = new o(s, h, c), Object.setPrototypeOf(y, u.prototype), y;
   }
   function _(s) {
     if (u.isBuffer(s)) {
@@ -1440,12 +1440,12 @@ qn.write = function(e, t, r, n, i, o) {
   }, u.compare = function(s, h) {
     if (Ft(s, o) && (s = u.from(s, s.offset, s.byteLength)), Ft(h, o) && (h = u.from(h, h.offset, h.byteLength)), !u.isBuffer(s) || !u.isBuffer(h)) throw new TypeError('The "buf1", "buf2" arguments must be one of type Buffer or Uint8Array');
     if (s === h) return 0;
-    let c = s.length, g = h.length;
-    for (let y = 0, E = Math.min(c, g); y < E; ++y) if (s[y] !== h[y]) {
-      c = s[y], g = h[y];
+    let c = s.length, y = h.length;
+    for (let b = 0, E = Math.min(c, y); b < E; ++b) if (s[b] !== h[b]) {
+      c = s[b], y = h[b];
       break;
     }
-    return c < g ? -1 : g < c ? 1 : 0;
+    return c < y ? -1 : y < c ? 1 : 0;
   }, u.isEncoding = function(s) {
     switch (String(s).toLowerCase()) {
       case "hex":
@@ -1468,24 +1468,24 @@ qn.write = function(e, t, r, n, i, o) {
     if (s.length === 0) return u.alloc(0);
     let c;
     if (h === void 0) for (h = 0, c = 0; c < s.length; ++c) h += s[c].length;
-    const g = u.allocUnsafe(h);
-    let y = 0;
+    const y = u.allocUnsafe(h);
+    let b = 0;
     for (c = 0; c < s.length; ++c) {
       let E = s[c];
-      if (Ft(E, o)) y + E.length > g.length ? (u.isBuffer(E) || (E = u.from(E)), E.copy(g, y)) : o.prototype.set.call(g, E, y);
-      else if (u.isBuffer(E)) E.copy(g, y);
+      if (Ft(E, o)) b + E.length > y.length ? (u.isBuffer(E) || (E = u.from(E)), E.copy(y, b)) : o.prototype.set.call(y, E, b);
+      else if (u.isBuffer(E)) E.copy(y, b);
       else throw new TypeError('"list" argument must be an Array of Buffers');
-      y += E.length;
+      b += E.length;
     }
-    return g;
+    return y;
   };
-  function D(s, h) {
+  function M(s, h) {
     if (u.isBuffer(s)) return s.length;
     if (a.isView(s) || Ft(s, a)) return s.byteLength;
     if (typeof s != "string") throw new TypeError('The "string" argument must be one of type string, Buffer, or ArrayBuffer. Received type ' + typeof s);
-    const c = s.length, g = arguments.length > 2 && arguments[2] === !0;
-    if (!g && c === 0) return 0;
-    let y = !1;
+    const c = s.length, y = arguments.length > 2 && arguments[2] === !0;
+    if (!y && c === 0) return 0;
+    let b = !1;
     for (; ; ) switch (h) {
       case "ascii":
       case "latin1":
@@ -1504,13 +1504,13 @@ qn.write = function(e, t, r, n, i, o) {
       case "base64":
         return bi(s).length;
       default:
-        if (y) return g ? -1 : hn(s).length;
-        h = ("" + h).toLowerCase(), y = !0;
+        if (b) return y ? -1 : hn(s).length;
+        h = ("" + h).toLowerCase(), b = !0;
     }
   }
-  u.byteLength = D;
-  function X(s, h, c) {
-    let g = !1;
+  u.byteLength = M;
+  function Z(s, h, c) {
+    let y = !1;
     if ((h === void 0 || h < 0) && (h = 0), h > this.length || ((c === void 0 || c > this.length) && (c = this.length), c <= 0) || (c >>>= 0, h >>>= 0, c <= h)) return "";
     for (s || (s = "utf8"); ; ) switch (s) {
       case "hex":
@@ -1522,7 +1522,7 @@ qn.write = function(e, t, r, n, i, o) {
         return L(this, h, c);
       case "latin1":
       case "binary":
-        return M(this, h, c);
+        return D(this, h, c);
       case "base64":
         return B(this, h, c);
       case "ucs2":
@@ -1531,33 +1531,33 @@ qn.write = function(e, t, r, n, i, o) {
       case "utf-16le":
         return ct(this, h, c);
       default:
-        if (g) throw new TypeError("Unknown encoding: " + s);
-        s = (s + "").toLowerCase(), g = !0;
+        if (y) throw new TypeError("Unknown encoding: " + s);
+        s = (s + "").toLowerCase(), y = !0;
     }
   }
   u.prototype._isBuffer = !0;
-  function at(s, h, c) {
-    const g = s[h];
-    s[h] = s[c], s[c] = g;
+  function Q(s, h, c) {
+    const y = s[h];
+    s[h] = s[c], s[c] = y;
   }
   u.prototype.swap16 = function() {
     const s = this.length;
     if (s % 2 !== 0) throw new RangeError("Buffer size must be a multiple of 16-bits");
-    for (let h = 0; h < s; h += 2) at(this, h, h + 1);
+    for (let h = 0; h < s; h += 2) Q(this, h, h + 1);
     return this;
   }, u.prototype.swap32 = function() {
     const s = this.length;
     if (s % 4 !== 0) throw new RangeError("Buffer size must be a multiple of 32-bits");
-    for (let h = 0; h < s; h += 4) at(this, h, h + 3), at(this, h + 1, h + 2);
+    for (let h = 0; h < s; h += 4) Q(this, h, h + 3), Q(this, h + 1, h + 2);
     return this;
   }, u.prototype.swap64 = function() {
     const s = this.length;
     if (s % 8 !== 0) throw new RangeError("Buffer size must be a multiple of 64-bits");
-    for (let h = 0; h < s; h += 8) at(this, h, h + 7), at(this, h + 1, h + 6), at(this, h + 2, h + 5), at(this, h + 3, h + 4);
+    for (let h = 0; h < s; h += 8) Q(this, h, h + 7), Q(this, h + 1, h + 6), Q(this, h + 2, h + 5), Q(this, h + 3, h + 4);
     return this;
   }, u.prototype.toString = function() {
     const s = this.length;
-    return s === 0 ? "" : arguments.length === 0 ? V(this, 0, s) : X.apply(this, arguments);
+    return s === 0 ? "" : arguments.length === 0 ? V(this, 0, s) : Z.apply(this, arguments);
   }, u.prototype.toLocaleString = u.prototype.toString, u.prototype.equals = function(s) {
     if (!u.isBuffer(s)) throw new TypeError("Argument must be a Buffer");
     return this === s ? !0 : u.compare(this, s) === 0;
@@ -1565,54 +1565,54 @@ qn.write = function(e, t, r, n, i, o) {
     let s = "";
     const h = e.INSPECT_MAX_BYTES;
     return s = this.toString("hex", 0, h).replace(/(.{2})/g, "$1 ").trim(), this.length > h && (s += " ... "), "<Buffer " + s + ">";
-  }, n && (u.prototype[n] = u.prototype.inspect), u.prototype.compare = function(s, h, c, g, y) {
+  }, n && (u.prototype[n] = u.prototype.inspect), u.prototype.compare = function(s, h, c, y, b) {
     if (Ft(s, o) && (s = u.from(s, s.offset, s.byteLength)), !u.isBuffer(s)) throw new TypeError('The "target" argument must be one of type Buffer or Uint8Array. Received type ' + typeof s);
-    if (h === void 0 && (h = 0), c === void 0 && (c = s ? s.length : 0), g === void 0 && (g = 0), y === void 0 && (y = this.length), h < 0 || c > s.length || g < 0 || y > this.length) throw new RangeError("out of range index");
-    if (g >= y && h >= c) return 0;
-    if (g >= y) return -1;
+    if (h === void 0 && (h = 0), c === void 0 && (c = s ? s.length : 0), y === void 0 && (y = 0), b === void 0 && (b = this.length), h < 0 || c > s.length || y < 0 || b > this.length) throw new RangeError("out of range index");
+    if (y >= b && h >= c) return 0;
+    if (y >= b) return -1;
     if (h >= c) return 1;
-    if (h >>>= 0, c >>>= 0, g >>>= 0, y >>>= 0, this === s) return 0;
-    let E = y - g, k = c - h;
-    const st = Math.min(E, k), bt = this.slice(g, y), ot = s.slice(h, c);
-    for (let rt = 0; rt < st; ++rt) if (bt[rt] !== ot[rt]) {
-      E = bt[rt], k = ot[rt];
+    if (h >>>= 0, c >>>= 0, y >>>= 0, b >>>= 0, this === s) return 0;
+    let E = b - y, k = c - h;
+    const ot = Math.min(E, k), bt = this.slice(y, b), at = s.slice(h, c);
+    for (let nt = 0; nt < ot; ++nt) if (bt[nt] !== at[nt]) {
+      E = bt[nt], k = at[nt];
       break;
     }
     return E < k ? -1 : k < E ? 1 : 0;
   };
-  function q(s, h, c, g, y) {
+  function q(s, h, c, y, b) {
     if (s.length === 0) return -1;
-    if (typeof c == "string" ? (g = c, c = 0) : c > 2147483647 ? c = 2147483647 : c < -2147483648 && (c = -2147483648), c = +c, un(c) && (c = y ? 0 : s.length - 1), c < 0 && (c = s.length + c), c >= s.length) {
-      if (y) return -1;
+    if (typeof c == "string" ? (y = c, c = 0) : c > 2147483647 ? c = 2147483647 : c < -2147483648 && (c = -2147483648), c = +c, un(c) && (c = b ? 0 : s.length - 1), c < 0 && (c = s.length + c), c >= s.length) {
+      if (b) return -1;
       c = s.length - 1;
-    } else if (c < 0) if (y) c = 0;
+    } else if (c < 0) if (b) c = 0;
     else return -1;
-    if (typeof h == "string" && (h = u.from(h, g)), u.isBuffer(h)) return h.length === 0 ? -1 : Vt(s, h, c, g, y);
-    if (typeof h == "number") return h = h & 255, typeof o.prototype.indexOf == "function" ? y ? o.prototype.indexOf.call(s, h, c) : o.prototype.lastIndexOf.call(s, h, c) : Vt(s, [h], c, g, y);
+    if (typeof h == "string" && (h = u.from(h, y)), u.isBuffer(h)) return h.length === 0 ? -1 : Vt(s, h, c, y, b);
+    if (typeof h == "number") return h = h & 255, typeof o.prototype.indexOf == "function" ? b ? o.prototype.indexOf.call(s, h, c) : o.prototype.lastIndexOf.call(s, h, c) : Vt(s, [h], c, y, b);
     throw new TypeError("val must be string, number or Buffer");
   }
-  function Vt(s, h, c, g, y) {
-    let E = 1, k = s.length, st = h.length;
-    if (g !== void 0 && (g = String(g).toLowerCase(), g === "ucs2" || g === "ucs-2" || g === "utf16le" || g === "utf-16le")) {
+  function Vt(s, h, c, y, b) {
+    let E = 1, k = s.length, ot = h.length;
+    if (y !== void 0 && (y = String(y).toLowerCase(), y === "ucs2" || y === "ucs-2" || y === "utf16le" || y === "utf-16le")) {
       if (s.length < 2 || h.length < 2) return -1;
-      E = 2, k /= 2, st /= 2, c /= 2;
-    }
-    function bt(rt, pt) {
-      return E === 1 ? rt[pt] : rt.readUInt16BE(pt * E);
-    }
-    let ot;
-    if (y) {
-      let rt = -1;
-      for (ot = c; ot < k; ot++) if (bt(s, ot) === bt(h, rt === -1 ? 0 : ot - rt)) {
-        if (rt === -1 && (rt = ot), ot - rt + 1 === st) return rt * E;
-      } else rt !== -1 && (ot -= ot - rt), rt = -1;
-    } else for (c + st > k && (c = k - st), ot = c; ot >= 0; ot--) {
-      let rt = !0;
-      for (let pt = 0; pt < st; pt++) if (bt(s, ot + pt) !== bt(h, pt)) {
-        rt = !1;
+      E = 2, k /= 2, ot /= 2, c /= 2;
+    }
+    function bt(nt, pt) {
+      return E === 1 ? nt[pt] : nt.readUInt16BE(pt * E);
+    }
+    let at;
+    if (b) {
+      let nt = -1;
+      for (at = c; at < k; at++) if (bt(s, at) === bt(h, nt === -1 ? 0 : at - nt)) {
+        if (nt === -1 && (nt = at), at - nt + 1 === ot) return nt * E;
+      } else nt !== -1 && (at -= at - nt), nt = -1;
+    } else for (c + ot > k && (c = k - ot), at = c; at >= 0; at--) {
+      let nt = !0;
+      for (let pt = 0; pt < ot; pt++) if (bt(s, at + pt) !== bt(h, pt)) {
+        nt = !1;
         break;
       }
-      if (rt) return ot;
+      if (nt) return at;
     }
     return -1;
   }
@@ -1623,42 +1623,42 @@ qn.write = function(e, t, r, n, i, o) {
   }, u.prototype.lastIndexOf = function(s, h, c) {
     return q(this, s, h, c, !1);
   };
-  function Qt(s, h, c, g) {
+  function Qt(s, h, c, y) {
     c = Number(c) || 0;
-    const y = s.length - c;
-    g ? (g = Number(g), g > y && (g = y)) : g = y;
+    const b = s.length - c;
+    y ? (y = Number(y), y > b && (y = b)) : y = b;
     const E = h.length;
-    g > E / 2 && (g = E / 2);
+    y > E / 2 && (y = E / 2);
     let k;
-    for (k = 0; k < g; ++k) {
-      const st = parseInt(h.substr(k * 2, 2), 16);
-      if (un(st)) return k;
-      s[c + k] = st;
+    for (k = 0; k < y; ++k) {
+      const ot = parseInt(h.substr(k * 2, 2), 16);
+      if (un(ot)) return k;
+      s[c + k] = ot;
     }
     return k;
   }
-  function Y(s, h, c, g) {
-    return br(hn(h, s.length - c), s, c, g);
+  function Y(s, h, c, y) {
+    return br(hn(h, s.length - c), s, c, y);
   }
-  function U(s, h, c, g) {
-    return br(ya(h), s, c, g);
+  function U(s, h, c, y) {
+    return br(ga(h), s, c, y);
   }
-  function T(s, h, c, g) {
-    return br(bi(h), s, c, g);
+  function T(s, h, c, y) {
+    return br(bi(h), s, c, y);
   }
-  function A(s, h, c, g) {
-    return br(ba(h, s.length - c), s, c, g);
+  function A(s, h, c, y) {
+    return br(ba(h, s.length - c), s, c, y);
   }
-  u.prototype.write = function(s, h, c, g) {
-    if (h === void 0) g = "utf8", c = this.length, h = 0;
-    else if (c === void 0 && typeof h == "string") g = h, c = this.length, h = 0;
-    else if (isFinite(h)) h = h >>> 0, isFinite(c) ? (c = c >>> 0, g === void 0 && (g = "utf8")) : (g = c, c = void 0);
+  u.prototype.write = function(s, h, c, y) {
+    if (h === void 0) y = "utf8", c = this.length, h = 0;
+    else if (c === void 0 && typeof h == "string") y = h, c = this.length, h = 0;
+    else if (isFinite(h)) h = h >>> 0, isFinite(c) ? (c = c >>> 0, y === void 0 && (y = "utf8")) : (y = c, c = void 0);
     else throw new Error("Buffer.write(string, encoding, offset[, length]) is no longer supported");
-    const y = this.length - h;
-    if ((c === void 0 || c > y) && (c = y), s.length > 0 && (c < 0 || h < 0) || h > this.length) throw new RangeError("Attempt to write outside buffer bounds");
-    g || (g = "utf8");
+    const b = this.length - h;
+    if ((c === void 0 || c > b) && (c = b), s.length > 0 && (c < 0 || h < 0) || h > this.length) throw new RangeError("Attempt to write outside buffer bounds");
+    y || (y = "utf8");
     let E = !1;
-    for (; ; ) switch (g) {
+    for (; ; ) switch (y) {
       case "hex":
         return Qt(this, s, h, c);
       case "utf8":
@@ -1676,8 +1676,8 @@ qn.write = function(e, t, r, n, i, o) {
       case "utf-16le":
         return A(this, s, h, c);
       default:
-        if (E) throw new TypeError("Unknown encoding: " + g);
-        g = ("" + g).toLowerCase(), E = !0;
+        if (E) throw new TypeError("Unknown encoding: " + y);
+        y = ("" + y).toLowerCase(), E = !0;
     }
   }, u.prototype.toJSON = function() {
     return {
@@ -1690,69 +1690,69 @@ qn.write = function(e, t, r, n, i, o) {
   }
   function V(s, h, c) {
     c = Math.min(s.length, c);
-    const g = [];
-    let y = h;
-    for (; y < c; ) {
-      const E = s[y];
-      let k = null, st = E > 239 ? 4 : E > 223 ? 3 : E > 191 ? 2 : 1;
-      if (y + st <= c) {
-        let bt, ot, rt, pt;
-        switch (st) {
+    const y = [];
+    let b = h;
+    for (; b < c; ) {
+      const E = s[b];
+      let k = null, ot = E > 239 ? 4 : E > 223 ? 3 : E > 191 ? 2 : 1;
+      if (b + ot <= c) {
+        let bt, at, nt, pt;
+        switch (ot) {
           case 1:
             E < 128 && (k = E);
             break;
           case 2:
-            bt = s[y + 1], (bt & 192) === 128 && (pt = (E & 31) << 6 | bt & 63, pt > 127 && (k = pt));
+            bt = s[b + 1], (bt & 192) === 128 && (pt = (E & 31) << 6 | bt & 63, pt > 127 && (k = pt));
             break;
           case 3:
-            bt = s[y + 1], ot = s[y + 2], (bt & 192) === 128 && (ot & 192) === 128 && (pt = (E & 15) << 12 | (bt & 63) << 6 | ot & 63, pt > 2047 && (pt < 55296 || pt > 57343) && (k = pt));
+            bt = s[b + 1], at = s[b + 2], (bt & 192) === 128 && (at & 192) === 128 && (pt = (E & 15) << 12 | (bt & 63) << 6 | at & 63, pt > 2047 && (pt < 55296 || pt > 57343) && (k = pt));
             break;
           case 4:
-            bt = s[y + 1], ot = s[y + 2], rt = s[y + 3], (bt & 192) === 128 && (ot & 192) === 128 && (rt & 192) === 128 && (pt = (E & 15) << 18 | (bt & 63) << 12 | (ot & 63) << 6 | rt & 63, pt > 65535 && pt < 1114112 && (k = pt));
+            bt = s[b + 1], at = s[b + 2], nt = s[b + 3], (bt & 192) === 128 && (at & 192) === 128 && (nt & 192) === 128 && (pt = (E & 15) << 18 | (bt & 63) << 12 | (at & 63) << 6 | nt & 63, pt > 65535 && pt < 1114112 && (k = pt));
         }
       }
-      k === null ? (k = 65533, st = 1) : k > 65535 && (k -= 65536, g.push(k >>> 10 & 1023 | 55296), k = 56320 | k & 1023), g.push(k), y += st;
+      k === null ? (k = 65533, ot = 1) : k > 65535 && (k -= 65536, y.push(k >>> 10 & 1023 | 55296), k = 56320 | k & 1023), y.push(k), b += ot;
     }
-    return C(g);
+    return C(y);
   }
   const $ = 4096;
   function C(s) {
     const h = s.length;
     if (h <= $) return String.fromCharCode.apply(String, s);
-    let c = "", g = 0;
-    for (; g < h; ) c += String.fromCharCode.apply(String, s.slice(g, g += $));
+    let c = "", y = 0;
+    for (; y < h; ) c += String.fromCharCode.apply(String, s.slice(y, y += $));
     return c;
   }
   function L(s, h, c) {
-    let g = "";
+    let y = "";
     c = Math.min(s.length, c);
-    for (let y = h; y < c; ++y) g += String.fromCharCode(s[y] & 127);
-    return g;
+    for (let b = h; b < c; ++b) y += String.fromCharCode(s[b] & 127);
+    return y;
   }
-  function M(s, h, c) {
-    let g = "";
+  function D(s, h, c) {
+    let y = "";
     c = Math.min(s.length, c);
-    for (let y = h; y < c; ++y) g += String.fromCharCode(s[y]);
-    return g;
+    for (let b = h; b < c; ++b) y += String.fromCharCode(s[b]);
+    return y;
   }
   function F(s, h, c) {
-    const g = s.length;
-    (!h || h < 0) && (h = 0), (!c || c < 0 || c > g) && (c = g);
-    let y = "";
-    for (let E = h; E < c; ++E) y += ma[s[E]];
-    return y;
+    const y = s.length;
+    (!h || h < 0) && (h = 0), (!c || c < 0 || c > y) && (c = y);
+    let b = "";
+    for (let E = h; E < c; ++E) b += ma[s[E]];
+    return b;
   }
   function ct(s, h, c) {
-    const g = s.slice(h, c);
-    let y = "";
-    for (let E = 0; E < g.length - 1; E += 2) y += String.fromCharCode(g[E] + g[E + 1] * 256);
-    return y;
+    const y = s.slice(h, c);
+    let b = "";
+    for (let E = 0; E < y.length - 1; E += 2) b += String.fromCharCode(y[E] + y[E + 1] * 256);
+    return b;
   }
   u.prototype.slice = function(s, h) {
     const c = this.length;
     s = ~~s, h = h === void 0 ? c : ~~h, s < 0 ? (s += c, s < 0 && (s = 0)) : s > c && (s = c), h < 0 ? (h += c, h < 0 && (h = 0)) : h > c && (h = c), h < s && (h = s);
-    const g = this.subarray(s, h);
-    return Object.setPrototypeOf(g, u.prototype), g;
+    const y = this.subarray(s, h);
+    return Object.setPrototypeOf(y, u.prototype), y;
   };
   function W(s, h, c) {
     if (s % 1 !== 0 || s < 0) throw new RangeError("offset is not uint");
@@ -1760,14 +1760,14 @@ qn.write = function(e, t, r, n, i, o) {
   }
   u.prototype.readUintLE = u.prototype.readUIntLE = function(s, h, c) {
     s = s >>> 0, h = h >>> 0, c || W(s, h, this.length);
-    let g = this[s], y = 1, E = 0;
-    for (; ++E < h && (y *= 256); ) g += this[s + E] * y;
-    return g;
+    let y = this[s], b = 1, E = 0;
+    for (; ++E < h && (b *= 256); ) y += this[s + E] * b;
+    return y;
   }, u.prototype.readUintBE = u.prototype.readUIntBE = function(s, h, c) {
     s = s >>> 0, h = h >>> 0, c || W(s, h, this.length);
-    let g = this[s + --h], y = 1;
-    for (; h > 0 && (y *= 256); ) g += this[s + --h] * y;
-    return g;
+    let y = this[s + --h], b = 1;
+    for (; h > 0 && (b *= 256); ) y += this[s + --h] * b;
+    return y;
   }, u.prototype.readUint8 = u.prototype.readUInt8 = function(s, h) {
     return s = s >>> 0, h || W(s, 1, this.length), this[s];
   }, u.prototype.readUint16LE = u.prototype.readUInt16LE = function(s, h) {
@@ -1782,24 +1782,24 @@ qn.write = function(e, t, r, n, i, o) {
     s = s >>> 0, _e(s, "offset");
     const h = this[s], c = this[s + 7];
     (h === void 0 || c === void 0) && ze(s, this.length - 8);
-    const g = h + this[++s] * 2 ** 8 + this[++s] * 2 ** 16 + this[++s] * 2 ** 24, y = this[++s] + this[++s] * 2 ** 8 + this[++s] * 2 ** 16 + c * 2 ** 24;
-    return BigInt(g) + (BigInt(y) << BigInt(32));
+    const y = h + this[++s] * 2 ** 8 + this[++s] * 2 ** 16 + this[++s] * 2 ** 24, b = this[++s] + this[++s] * 2 ** 8 + this[++s] * 2 ** 16 + c * 2 ** 24;
+    return BigInt(y) + (BigInt(b) << BigInt(32));
   }), u.prototype.readBigUInt64BE = ie(function(s) {
     s = s >>> 0, _e(s, "offset");
     const h = this[s], c = this[s + 7];
     (h === void 0 || c === void 0) && ze(s, this.length - 8);
-    const g = h * 2 ** 24 + this[++s] * 2 ** 16 + this[++s] * 2 ** 8 + this[++s], y = this[++s] * 2 ** 24 + this[++s] * 2 ** 16 + this[++s] * 2 ** 8 + c;
-    return (BigInt(g) << BigInt(32)) + BigInt(y);
+    const y = h * 2 ** 24 + this[++s] * 2 ** 16 + this[++s] * 2 ** 8 + this[++s], b = this[++s] * 2 ** 24 + this[++s] * 2 ** 16 + this[++s] * 2 ** 8 + c;
+    return (BigInt(y) << BigInt(32)) + BigInt(b);
   }), u.prototype.readIntLE = function(s, h, c) {
     s = s >>> 0, h = h >>> 0, c || W(s, h, this.length);
-    let g = this[s], y = 1, E = 0;
-    for (; ++E < h && (y *= 256); ) g += this[s + E] * y;
-    return y *= 128, g >= y && (g -= Math.pow(2, 8 * h)), g;
+    let y = this[s], b = 1, E = 0;
+    for (; ++E < h && (b *= 256); ) y += this[s + E] * b;
+    return b *= 128, y >= b && (y -= Math.pow(2, 8 * h)), y;
   }, u.prototype.readIntBE = function(s, h, c) {
     s = s >>> 0, h = h >>> 0, c || W(s, h, this.length);
-    let g = h, y = 1, E = this[s + --g];
-    for (; g > 0 && (y *= 256); ) E += this[s + --g] * y;
-    return y *= 128, E >= y && (E -= Math.pow(2, 8 * h)), E;
+    let y = h, b = 1, E = this[s + --y];
+    for (; y > 0 && (b *= 256); ) E += this[s + --y] * b;
+    return b *= 128, E >= b && (E -= Math.pow(2, 8 * h)), E;
   }, u.prototype.readInt8 = function(s, h) {
     return s = s >>> 0, h || W(s, 1, this.length), this[s] & 128 ? (255 - this[s] + 1) * -1 : this[s];
   }, u.prototype.readInt16LE = function(s, h) {
@@ -1818,14 +1818,14 @@ qn.write = function(e, t, r, n, i, o) {
     s = s >>> 0, _e(s, "offset");
     const h = this[s], c = this[s + 7];
     (h === void 0 || c === void 0) && ze(s, this.length - 8);
-    const g = this[s + 4] + this[s + 5] * 2 ** 8 + this[s + 6] * 2 ** 16 + (c << 24);
-    return (BigInt(g) << BigInt(32)) + BigInt(h + this[++s] * 2 ** 8 + this[++s] * 2 ** 16 + this[++s] * 2 ** 24);
+    const y = this[s + 4] + this[s + 5] * 2 ** 8 + this[s + 6] * 2 ** 16 + (c << 24);
+    return (BigInt(y) << BigInt(32)) + BigInt(h + this[++s] * 2 ** 8 + this[++s] * 2 ** 16 + this[++s] * 2 ** 24);
   }), u.prototype.readBigInt64BE = ie(function(s) {
     s = s >>> 0, _e(s, "offset");
     const h = this[s], c = this[s + 7];
     (h === void 0 || c === void 0) && ze(s, this.length - 8);
-    const g = (h << 24) + this[++s] * 2 ** 16 + this[++s] * 2 ** 8 + this[++s];
-    return (BigInt(g) << BigInt(32)) + BigInt(this[++s] * 2 ** 24 + this[++s] * 2 ** 16 + this[++s] * 2 ** 8 + c);
+    const y = (h << 24) + this[++s] * 2 ** 16 + this[++s] * 2 ** 8 + this[++s];
+    return (BigInt(y) << BigInt(32)) + BigInt(this[++s] * 2 ** 24 + this[++s] * 2 ** 16 + this[++s] * 2 ** 8 + c);
   }), u.prototype.readFloatLE = function(s, h) {
     return s = s >>> 0, h || W(s, 4, this.length), r.read(this, s, !0, 23, 4);
   }, u.prototype.readFloatBE = function(s, h) {
@@ -1835,26 +1835,26 @@ qn.write = function(e, t, r, n, i, o) {
   }, u.prototype.readDoubleBE = function(s, h) {
     return s = s >>> 0, h || W(s, 8, this.length), r.read(this, s, !1, 52, 8);
   };
-  function K(s, h, c, g, y, E) {
+  function K(s, h, c, y, b, E) {
     if (!u.isBuffer(s)) throw new TypeError('"buffer" argument must be a Buffer instance');
-    if (h > y || h < E) throw new RangeError('"value" argument is out of bounds');
-    if (c + g > s.length) throw new RangeError("Index out of range");
+    if (h > b || h < E) throw new RangeError('"value" argument is out of bounds');
+    if (c + y > s.length) throw new RangeError("Index out of range");
   }
-  u.prototype.writeUintLE = u.prototype.writeUIntLE = function(s, h, c, g) {
-    if (s = +s, h = h >>> 0, c = c >>> 0, !g) {
+  u.prototype.writeUintLE = u.prototype.writeUIntLE = function(s, h, c, y) {
+    if (s = +s, h = h >>> 0, c = c >>> 0, !y) {
       const k = Math.pow(2, 8 * c) - 1;
       K(this, s, h, c, k, 0);
     }
-    let y = 1, E = 0;
-    for (this[h] = s & 255; ++E < c && (y *= 256); ) this[h + E] = s / y & 255;
+    let b = 1, E = 0;
+    for (this[h] = s & 255; ++E < c && (b *= 256); ) this[h + E] = s / b & 255;
     return h + c;
-  }, u.prototype.writeUintBE = u.prototype.writeUIntBE = function(s, h, c, g) {
-    if (s = +s, h = h >>> 0, c = c >>> 0, !g) {
+  }, u.prototype.writeUintBE = u.prototype.writeUIntBE = function(s, h, c, y) {
+    if (s = +s, h = h >>> 0, c = c >>> 0, !y) {
       const k = Math.pow(2, 8 * c) - 1;
       K(this, s, h, c, k, 0);
     }
-    let y = c - 1, E = 1;
-    for (this[h + y] = s & 255; --y >= 0 && (E *= 256); ) this[h + y] = s / E & 255;
+    let b = c - 1, E = 1;
+    for (this[h + b] = s & 255; --b >= 0 && (E *= 256); ) this[h + b] = s / E & 255;
     return h + c;
   }, u.prototype.writeUint8 = u.prototype.writeUInt8 = function(s, h, c) {
     return s = +s, h = h >>> 0, c || K(this, s, h, 1, 255, 0), this[h] = s & 255, h + 1;
@@ -1867,39 +1867,39 @@ qn.write = function(e, t, r, n, i, o) {
   }, u.prototype.writeUint32BE = u.prototype.writeUInt32BE = function(s, h, c) {
     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) {
-    yi(h, g, y, s, c, 7);
+  function it(s, h, c, y, b) {
+    gi(h, y, b, 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) {
-    yi(h, g, y, s, c, 7);
+  function lt(s, h, c, y, b) {
+    gi(h, y, b, 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));
     return s[c + 3] = k, k = k >> 8, s[c + 2] = k, k = k >> 8, s[c + 1] = k, k = k >> 8, s[c] = k, c + 8;
   }
   u.prototype.writeBigUInt64LE = ie(function(s, h = 0) {
-    return nt(this, s, h, BigInt(0), BigInt("0xffffffffffffffff"));
+    return it(this, s, h, BigInt(0), BigInt("0xffffffffffffffff"));
   }), u.prototype.writeBigUInt64BE = ie(function(s, h = 0) {
     return lt(this, s, h, BigInt(0), BigInt("0xffffffffffffffff"));
-  }), u.prototype.writeIntLE = function(s, h, c, g) {
-    if (s = +s, h = h >>> 0, !g) {
-      const st = Math.pow(2, 8 * c - 1);
-      K(this, s, h, c, st - 1, -st);
+  }), u.prototype.writeIntLE = function(s, h, c, y) {
+    if (s = +s, h = h >>> 0, !y) {
+      const ot = Math.pow(2, 8 * c - 1);
+      K(this, s, h, c, ot - 1, -ot);
     }
-    let y = 0, E = 1, k = 0;
-    for (this[h] = s & 255; ++y < c && (E *= 256); ) s < 0 && k === 0 && this[h + y - 1] !== 0 && (k = 1), this[h + y] = (s / E >> 0) - k & 255;
+    let b = 0, E = 1, k = 0;
+    for (this[h] = s & 255; ++b < c && (E *= 256); ) s < 0 && k === 0 && this[h + b - 1] !== 0 && (k = 1), this[h + b] = (s / E >> 0) - k & 255;
     return h + c;
-  }, u.prototype.writeIntBE = function(s, h, c, g) {
-    if (s = +s, h = h >>> 0, !g) {
-      const st = Math.pow(2, 8 * c - 1);
-      K(this, s, h, c, st - 1, -st);
+  }, u.prototype.writeIntBE = function(s, h, c, y) {
+    if (s = +s, h = h >>> 0, !y) {
+      const ot = Math.pow(2, 8 * c - 1);
+      K(this, s, h, c, ot - 1, -ot);
     }
-    let y = c - 1, E = 1, k = 0;
-    for (this[h + y] = s & 255; --y >= 0 && (E *= 256); ) s < 0 && k === 0 && this[h + y + 1] !== 0 && (k = 1), this[h + y] = (s / E >> 0) - k & 255;
+    let b = c - 1, E = 1, k = 0;
+    for (this[h + b] = s & 255; --b >= 0 && (E *= 256); ) s < 0 && k === 0 && this[h + b + 1] !== 0 && (k = 1), this[h + b] = (s / E >> 0) - k & 255;
     return h + c;
   }, u.prototype.writeInt8 = function(s, h, c) {
     return s = +s, h = h >>> 0, c || K(this, s, h, 1, 127, -128), s < 0 && (s = 255 + s + 1), this[h] = s & 255, h + 1;
@@ -1912,56 +1912,56 @@ qn.write = function(e, t, r, n, i, o) {
   }, u.prototype.writeInt32BE = function(s, h, c) {
     return s = +s, h = h >>> 0, c || K(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;
   }, u.prototype.writeBigInt64LE = ie(function(s, h = 0) {
-    return nt(this, s, h, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
+    return it(this, s, h, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
   }), u.prototype.writeBigInt64BE = ie(function(s, h = 0) {
     return lt(this, s, h, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
   });
-  function _t(s, h, c, g, y, E) {
-    if (c + g > s.length) throw new RangeError("Index out of range");
+  function _t(s, h, c, y, b, E) {
+    if (c + y > s.length) throw new RangeError("Index out of range");
     if (c < 0) throw new RangeError("Index out of range");
   }
-  function it(s, h, c, g, y) {
-    return h = +h, c = c >>> 0, y || _t(s, h, c, 4), r.write(s, h, c, g, 23, 4), c + 4;
+  function st(s, h, c, y, b) {
+    return h = +h, c = c >>> 0, b || _t(s, h, c, 4), r.write(s, h, c, y, 23, 4), c + 4;
   }
   u.prototype.writeFloatLE = function(s, h, c) {
-    return it(this, s, h, !0, c);
+    return st(this, s, h, !0, c);
   }, u.prototype.writeFloatBE = function(s, h, c) {
-    return it(this, s, h, !1, c);
+    return st(this, s, h, !1, c);
   };
-  function yt(s, h, c, g, y) {
-    return h = +h, c = c >>> 0, y || _t(s, h, c, 8), r.write(s, h, c, g, 52, 8), c + 8;
+  function gt(s, h, c, y, b) {
+    return h = +h, c = c >>> 0, b || _t(s, h, c, 8), r.write(s, h, c, y, 52, 8), c + 8;
   }
   u.prototype.writeDoubleLE = function(s, h, c) {
-    return yt(this, s, h, !0, c);
+    return gt(this, s, h, !0, c);
   }, u.prototype.writeDoubleBE = function(s, h, c) {
-    return yt(this, s, h, !1, c);
-  }, u.prototype.copy = function(s, h, c, g) {
+    return gt(this, s, h, !1, c);
+  }, u.prototype.copy = function(s, h, c, y) {
     if (!u.isBuffer(s)) throw new TypeError("argument should be a Buffer");
-    if (c || (c = 0), !g && g !== 0 && (g = this.length), h >= s.length && (h = s.length), h || (h = 0), g > 0 && g < c && (g = c), g === c || s.length === 0 || this.length === 0) return 0;
+    if (c || (c = 0), !y && y !== 0 && (y = this.length), h >= s.length && (h = s.length), h || (h = 0), y > 0 && y < c && (y = c), y === c || s.length === 0 || this.length === 0) return 0;
     if (h < 0) throw new RangeError("targetStart out of bounds");
     if (c < 0 || c >= this.length) throw new RangeError("Index out of range");
-    if (g < 0) throw new RangeError("sourceEnd out of bounds");
-    g > this.length && (g = this.length), s.length - h < g - c && (g = s.length - h + c);
-    const y = g - c;
-    return this === s && typeof o.prototype.copyWithin == "function" ? this.copyWithin(h, c, g) : o.prototype.set.call(s, this.subarray(c, g), h), y;
-  }, u.prototype.fill = function(s, h, c, g) {
+    if (y < 0) throw new RangeError("sourceEnd out of bounds");
+    y > this.length && (y = this.length), s.length - h < y - c && (y = s.length - h + c);
+    const b = y - c;
+    return this === s && typeof o.prototype.copyWithin == "function" ? this.copyWithin(h, c, y) : o.prototype.set.call(s, this.subarray(c, y), h), b;
+  }, u.prototype.fill = function(s, h, c, y) {
     if (typeof s == "string") {
-      if (typeof h == "string" ? (g = h, h = 0, c = this.length) : typeof c == "string" && (g = c, c = this.length), g !== void 0 && typeof g != "string") throw new TypeError("encoding must be a string");
-      if (typeof g == "string" && !u.isEncoding(g)) throw new TypeError("Unknown encoding: " + g);
+      if (typeof h == "string" ? (y = h, h = 0, c = this.length) : typeof c == "string" && (y = c, c = this.length), y !== void 0 && typeof y != "string") throw new TypeError("encoding must be a string");
+      if (typeof y == "string" && !u.isEncoding(y)) throw new TypeError("Unknown encoding: " + y);
       if (s.length === 1) {
         const E = s.charCodeAt(0);
-        (g === "utf8" && E < 128 || g === "latin1") && (s = E);
+        (y === "utf8" && E < 128 || y === "latin1") && (s = E);
       }
     } else typeof s == "number" ? s = s & 255 : typeof s == "boolean" && (s = Number(s));
     if (h < 0 || this.length < h || this.length < c) throw new RangeError("Out of range index");
     if (c <= h) return this;
     h = h >>> 0, c = c === void 0 ? this.length : c >>> 0, s || (s = 0);
-    let y;
-    if (typeof s == "number") for (y = h; y < c; ++y) this[y] = s;
+    let b;
+    if (typeof s == "number") for (b = h; b < c; ++b) this[b] = s;
     else {
-      const E = u.isBuffer(s) ? s : u.from(s, g), k = E.length;
+      const E = u.isBuffer(s) ? s : u.from(s, y), k = E.length;
       if (k === 0) throw new TypeError('The value "' + s + '" is invalid for argument "value"');
-      for (y = 0; y < c - h; ++y) this[y + h] = E[y % k];
+      for (b = 0; b < c - h; ++b) this[b + h] = E[b % k];
     }
     return this;
   };
@@ -1978,11 +1978,11 @@ qn.write = function(e, t, r, n, i, o) {
       get code() {
         return s;
       }
-      set code(g) {
+      set code(y) {
         Object.defineProperty(this, "code", {
           configurable: !0,
           enumerable: !0,
-          value: g,
+          value: y,
           writable: !0
         });
       }
@@ -1996,25 +1996,25 @@ qn.write = function(e, t, r, n, i, o) {
   }, RangeError), Be("ERR_INVALID_ARG_TYPE", function(s, h) {
     return `The "${s}" argument must be of type number. Received type ${typeof h}`;
   }, TypeError), Be("ERR_OUT_OF_RANGE", function(s, h, c) {
-    let g = `The value of "${s}" is out of range.`, y = c;
-    return Number.isInteger(c) && Math.abs(c) > 2 ** 32 ? y = je(String(c)) : typeof c == "bigint" && (y = String(c), (c > BigInt(2) ** BigInt(32) || c < -(BigInt(2) ** BigInt(32))) && (y = je(y)), y += "n"), g += ` It must be ${h}. Received ${y}`, g;
+    let y = `The value of "${s}" is out of range.`, b = c;
+    return Number.isInteger(c) && Math.abs(c) > 2 ** 32 ? b = je(String(c)) : typeof c == "bigint" && (b = String(c), (c > BigInt(2) ** BigInt(32) || c < -(BigInt(2) ** BigInt(32))) && (b = je(b)), b += "n"), y += ` It must be ${h}. Received ${b}`, y;
   }, RangeError);
   function je(s) {
     let h = "", c = s.length;
-    const g = s[0] === "-" ? 1 : 0;
-    for (; c >= g + 4; c -= 3) h = `_${s.slice(c - 3, c)}${h}`;
+    const y = s[0] === "-" ? 1 : 0;
+    for (; c >= y + 4; c -= 3) h = `_${s.slice(c - 3, c)}${h}`;
     return `${s.slice(0, c)}${h}`;
   }
   function da(s, h, c) {
     _e(h, "offset"), (s[h] === void 0 || s[h + c] === void 0) && ze(h, s.length - (c + 1));
   }
-  function yi(s, h, c, g, y, E) {
+  function gi(s, h, c, y, b, E) {
     if (s > c || s < h) {
       const k = typeof h == "bigint" ? "n" : "";
-      let st;
-      throw h === 0 || h === BigInt(0) ? st = `>= 0${k} and < 2${k} ** ${(E + 1) * 8}${k}` : st = `>= -(2${k} ** ${(E + 1) * 8 - 1}${k}) and < 2 ** ${(E + 1) * 8 - 1}${k}`, new $t.ERR_OUT_OF_RANGE("value", st, s);
+      let ot;
+      throw h === 0 || h === BigInt(0) ? ot = `>= 0${k} and < 2${k} ** ${(E + 1) * 8}${k}` : ot = `>= -(2${k} ** ${(E + 1) * 8 - 1}${k}) and < 2 ** ${(E + 1) * 8 - 1}${k}`, new $t.ERR_OUT_OF_RANGE("value", ot, s);
     }
-    da(g, y, E);
+    da(y, b, E);
   }
   function _e(s, h) {
     if (typeof s != "number") throw new $t.ERR_INVALID_ARG_TYPE(h, "number", s);
@@ -2023,7 +2023,7 @@ qn.write = function(e, t, r, n, i, o) {
     throw Math.floor(s) !== s ? (_e(s, c), new $t.ERR_OUT_OF_RANGE("offset", "an integer", s)) : h < 0 ? new $t.ERR_BUFFER_OUT_OF_BOUNDS() : new $t.ERR_OUT_OF_RANGE("offset", `>= 0 and <= ${h}`, s);
   }
   const wa = /[^+/0-9A-Za-z-_]/g;
-  function ga(s) {
+  function ya(s) {
     if (s = s.split("=")[0], s = s.trim().replace(wa, ""), s.length < 2) return "";
     for (; s.length % 4 !== 0; ) s = s + "=";
     return s;
@@ -2031,29 +2031,29 @@ qn.write = function(e, t, r, n, i, o) {
   function hn(s, h) {
     h = h || 1 / 0;
     let c;
-    const g = s.length;
-    let y = null;
+    const y = s.length;
+    let b = null;
     const E = [];
-    for (let k = 0; k < g; ++k) {
+    for (let k = 0; k < y; ++k) {
       if (c = s.charCodeAt(k), c > 55295 && c < 57344) {
-        if (!y) {
+        if (!b) {
           if (c > 56319) {
             (h -= 3) > -1 && E.push(239, 191, 189);
             continue;
-          } else if (k + 1 === g) {
+          } else if (k + 1 === y) {
             (h -= 3) > -1 && E.push(239, 191, 189);
             continue;
           }
-          y = c;
+          b = c;
           continue;
         }
         if (c < 56320) {
-          (h -= 3) > -1 && E.push(239, 191, 189), y = c;
+          (h -= 3) > -1 && E.push(239, 191, 189), b = c;
           continue;
         }
-        c = (y - 55296 << 10 | c - 56320) + 65536;
-      } else y && (h -= 3) > -1 && E.push(239, 191, 189);
-      if (y = null, c < 128) {
+        c = (b - 55296 << 10 | c - 56320) + 65536;
+      } else b && (h -= 3) > -1 && E.push(239, 191, 189);
+      if (b = null, c < 128) {
         if ((h -= 1) < 0) break;
         E.push(c);
       } else if (c < 2048) {
@@ -2069,24 +2069,24 @@ qn.write = function(e, t, r, n, i, o) {
     }
     return E;
   }
-  function ya(s) {
+  function ga(s) {
     const h = [];
     for (let c = 0; c < s.length; ++c) h.push(s.charCodeAt(c) & 255);
     return h;
   }
   function ba(s, h) {
-    let c, g, y;
+    let c, y, b;
     const E = [];
-    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);
+    for (let k = 0; k < s.length && !((h -= 2) < 0); ++k) c = s.charCodeAt(k), y = c >> 8, b = c % 256, E.push(b), E.push(y);
     return E;
   }
   function bi(s) {
-    return t.toByteArray(ga(s));
+    return t.toByteArray(ya(s));
   }
-  function br(s, h, c, g) {
-    let y;
-    for (y = 0; y < g && !(y + c >= h.length || y >= s.length); ++y) h[y + c] = s[y];
-    return y;
+  function br(s, h, c, y) {
+    let b;
+    for (b = 0; b < y && !(b + c >= h.length || b >= s.length); ++b) h[b + c] = s[b];
+    return b;
   }
   function Ft(s, h) {
     return s instanceof h || s != null && s.constructor != null && s.constructor.name != null && s.constructor.name === h.name;
@@ -2097,8 +2097,8 @@ qn.write = function(e, t, r, n, i, o) {
   const ma = (function() {
     const s = "0123456789abcdef", h = new Array(256);
     for (let c = 0; c < 16; ++c) {
-      const g = c * 16;
-      for (let y = 0; y < 16; ++y) h[g + y] = s[c] + s[y];
+      const y = c * 16;
+      for (let b = 0; b < 16; ++b) h[y + b] = s[c] + s[b];
     }
     return h;
   })();
@@ -2236,11 +2236,11 @@ var wh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   encode: dh,
   isDefinedHashType: Qr
 }, Symbol.toStringTag, { value: "Module" })), Vs = j.OP_RESERVED;
-function gh(e) {
+function yh(e) {
   return oh(e) && (e === j.OP_0 || e >= j.OP_1 && e <= j.OP_16 || e === j.OP_1NEGATE);
 }
 function $s(e) {
-  return e instanceof Uint8Array ? !0 : gh(e);
+  return e instanceof Uint8Array ? !0 : yh(e);
 }
 function Jr(e) {
   return Yn(e) && e.every($s);
@@ -2258,13 +2258,13 @@ function Rr(e) {
 function Zn(e) {
   return e instanceof Uint8Array;
 }
-function yh(e) {
+function gh(e) {
   return Yn(e);
 }
 function Nr(e) {
   return e instanceof Uint8Array;
 }
-function gt(e) {
+function yt(e) {
   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);
@@ -2281,8 +2281,8 @@ function gt(e) {
   }), n !== r.length) throw new Error("Could not decode chunks");
   return r;
 }
-function et(e) {
-  if (yh(e)) return e;
+function rt(e) {
+  if (gh(e)) return e;
   if (!(e instanceof Uint8Array)) throw new TypeError("Expected a Uint8Array");
   const t = [];
   let r = 0;
@@ -2302,7 +2302,7 @@ function et(e) {
 function Ks(e) {
   let t;
   if (Zn(e)) {
-    const r = et(e);
+    const r = rt(e);
     if (!r) throw new Error("Could not convert invalid chunks to ASM");
     t = r;
   } else t = e;
@@ -2317,14 +2317,14 @@ function Ks(e) {
 }
 function bh(e) {
   if (typeof e != "string") throw new TypeError("Expected a string");
-  return gt(e.split(" ").map((t) => {
+  return yt(e.split(" ").map((t) => {
     if (j[t] !== void 0) return j[t];
     if (!hh(t)) throw new TypeError("Expected hex string");
     return Mt(t);
   }));
 }
 function Ds(e) {
-  const t = Zn(e) ? et(e) : e;
+  const t = Zn(e) ? rt(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) : Ns(r - Vs));
 }
@@ -2336,9 +2336,9 @@ function xe(e) {
 }
 var mh = sh, Ae = wh, Eh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  compile: gt,
+  compile: yt,
   countNonPushOnlyOPs: Xn,
-  decompile: et,
+  decompile: rt,
   fromASM: bh,
   isCanonicalPubKey: Ms,
   isCanonicalScriptSignature: xe,
@@ -2378,8 +2378,8 @@ var mh = sh, Ae = wh, Eh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.
   #l = !1;
   #d = !1;
   #w = !1;
-  #g = !1;
-  #y;
+  #y = !1;
+  #g;
   #m = !1;
   constructor(t, r) {
     this.#t = t.network ?? kt, this.#a = {
@@ -2406,7 +2406,7 @@ var mh = sh, Ae = wh, Eh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.
     return this.#w || (this.#u = this.#A(), this.#w = !0), this.#u;
   }
   get output() {
-    return this.#g || (this.#c = this.#T(), this.#g = !0), this.#c;
+    return this.#y || (this.#c = this.#T(), this.#y = !0), this.#c;
   }
   static fromProgram(t, r) {
     return new Qe({
@@ -2448,7 +2448,7 @@ var mh = sh, Ae = wh, Eh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.
     if (!this.#m) {
       if (this.#e) {
         const t = cr(this.#e);
-        t && (this.#y = {
+        t && (this.#g = {
           version: t.version,
           prefix: t.prefix,
           data: t.data
@@ -2456,7 +2456,7 @@ var mh = sh, Ae = wh, Eh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.
       }
       this.#m = !0;
     }
-    return this.#y;
+    return this.#g;
   }
   #v() {
     if (typeof this.#r < "u" && typeof this.#n < "u") {
@@ -2470,8 +2470,8 @@ var mh = sh, Ae = wh, Eh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.
     const t = this.program;
     if (!t) return;
     if (!this.#t.bech32Opnet) throw new TypeError("Network does not support opnet");
-    const r = tt.bech32m.toWords(t);
-    return r.unshift(Pi), tt.bech32m.encode(this.#t.bech32Opnet, r);
+    const r = et.bech32m.toWords(t);
+    return r.unshift(Pi), et.bech32m.encode(this.#t.bech32Opnet, r);
   }
   #b() {
     if (this.#s) return this.#s;
@@ -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([Oi.OP_16, t]);
+    if (t) return yt([Oi.OP_16, t]);
   }
   #k() {
     let t = Et(0);
@@ -2744,13 +2744,13 @@ var Er = /* @__PURE__ */ new Uint32Array(16), Ph = class extends Wn {
     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 = js[w], P = zs[w], S = Th[w], _ = kh[w];
+      const g = 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 + _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 + _i(b, o, f, p) + Er[P[O]] + v, _[O]) + d | 0;
+        const z = Ee(n + _i(g, o, f, p) + Er[P[O]] + v, _[O]) + d | 0;
         n = d, d = p, p = Ee(f, 10) | 0, f = o, o = z;
       }
     }
@@ -3518,11 +3518,11 @@ var Rh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   add(t) {
     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);
+    const g = N(p * 3n);
     let m = N(r * o), v = N(n * a), I = N(i * f), P = N(r + n), S = N(o + a);
     P = N(P * S), S = N(m + v), P = N(P - S), S = N(r + i);
     let _ = N(o + f);
-    return S = N(S * _), _ = N(m + I), S = N(S - _), _ = N(n + i), u = N(a + f), _ = N(_ * u), u = N(v + I), _ = N(_ - u), w = N(l * S), u = N(b * I), w = N(u + w), u = N(v - w), w = N(v + w), d = N(u * w), v = N(m + m), v = N(v + m), I = N(l * I), S = N(b * S), v = N(v + I), I = N(m - I), I = N(l * I), S = N(S + I), m = N(v * S), d = N(d + m), m = N(_ * S), u = N(P * u), u = N(u - m), m = N(P * v), w = N(_ * w), w = N(w + m), new be(u, d, w);
+    return S = N(S * _), _ = N(m + I), S = N(S - _), _ = N(n + i), u = N(a + f), _ = N(_ * u), u = N(v + I), _ = N(_ - u), w = N(l * S), u = N(g * I), w = N(u + w), u = N(v - w), w = N(v + w), d = N(u * w), v = N(m + m), v = N(v + m), I = N(l * I), S = N(g * S), v = N(v + I), I = N(m - I), I = N(l * I), S = N(S + I), m = N(v * S), d = N(d + m), m = N(_ * S), u = N(P * u), u = N(u - m), m = N(P * v), w = N(_ * w), w = N(w + m), new be(u, d, w);
   }
   subtract(t) {
     return this.add(pn(t).negate());
@@ -3587,8 +3587,8 @@ var jh = (e) => Hr("0x" + (ro(e) || "0")), Ci = (e, t, r) => jh(e.subarray(t, r)
   for (let l = 0; l < oo; l++) {
     let p = Number(e & a);
     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]));
+    const u = l * xn, d = u, w = u + Math.abs(p) - 1, g = l % 2 !== 0, m = p < 0;
+    p === 0 ? n = n.add(Ki(g, t[d])) : r = r.add(Ki(m, t[w]));
   }
   return e !== 0n && xt("invalid wnaf"), {
     p: r,
@@ -3647,8 +3647,8 @@ var he = j, ao = class Je {
   #l;
   #d;
   #w;
-  #g;
-  #y = !1;
+  #y;
+  #g = !1;
   #m = !1;
   #E = !1;
   #v = !1;
@@ -3672,7 +3672,7 @@ var he = j, ao = class Je {
     return this.#t;
   }
   get address() {
-    return this.#y || (this.#u = this.#x(), this.#y = !0), this.#u;
+    return this.#g || (this.#u = this.#x(), this.#g = !0), this.#u;
   }
   get hash() {
     return this.#m || (this.#c = this.#B(), this.#m = !0), this.#c;
@@ -3690,7 +3690,7 @@ var he = j, ao = class Je {
     return this.#b || (this.#w = this.#H(), this.#b = !0), this.#w;
   }
   get witness() {
-    return this.#S || (this.#g = this.#L(), this.#S = !0), this.#g;
+    return this.#S || (this.#y = this.#L(), this.#S = !0), this.#y;
   }
   static fromPubkey(t, r) {
     return new Je({
@@ -3743,7 +3743,7 @@ var he = j, ao = class Je {
     return this.#A;
   }
   #O() {
-    return this.#P || (this.#o && (this.#k = et(this.#o) ?? void 0), this.#P = !0), this.#k;
+    return this.#P || (this.#o && (this.#k = rt(this.#o) ?? void 0), this.#P = !0), this.#k;
   }
   #x() {
     if (this.#e) return this.#e;
@@ -3776,7 +3776,7 @@ var he = j, ao = class Je {
   #N() {
     if (this.#i) return this.#i;
     const t = this.hash;
-    if (t) return gt([
+    if (t) return yt([
       he.OP_DUP,
       he.OP_HASH160,
       t,
@@ -3792,13 +3792,13 @@ var he = j, ao = class Je {
       const r = Bn(this.#r);
       r && (this.#f ? t = r.uncompressed : t = r.hybrid);
     }
-    return gt([this.#n, t]);
+    return yt([this.#n, t]);
   }
   #L() {
     if (this.input) return [];
   }
   #C() {
-    let t = new Uint8Array(0);
+    let t = /* @__PURE__ */ new Uint8Array(0);
     if (this.#e) {
       const r = this.#U();
       if (!r) throw new TypeError("Invalid address");
@@ -3878,8 +3878,8 @@ var Ye = j, ho = class tr {
   #l;
   #d = !1;
   #w = !1;
-  #g = !1;
   #y = !1;
+  #g = !1;
   #m = !1;
   #E = !1;
   #v;
@@ -3909,10 +3909,10 @@ var Ye = j, ho = class tr {
     return this.#w || (this.#f = this.#x(), this.#w = !0), this.#f;
   }
   get output() {
-    return this.#g || (this.#u = this.#B(), this.#g = !0), this.#u;
+    return this.#y || (this.#u = this.#B(), this.#y = !0), this.#u;
   }
   get input() {
-    return this.#y || (this.#c = this.#_(), this.#y = !0), this.#c;
+    return this.#g || (this.#c = this.#_(), this.#g = !0), this.#c;
   }
   get redeem() {
     return this.#m || (this.#p = this.#R(), this.#m = !0), this.#p;
@@ -3970,7 +3970,7 @@ var Ye = j, ho = class tr {
     return this.#v;
   }
   #P() {
-    return this.#S || (this.#n && (this.#b = et(this.#n) ?? void 0), this.#S = !0), this.#b;
+    return this.#S || (this.#n && (this.#b = rt(this.#n) ?? void 0), this.#S = !0), this.#b;
   }
   #U() {
     if (!this.#T) {
@@ -3979,8 +3979,8 @@ var Ye = j, ho = class tr {
         const r = t[t.length - 1];
         this.#A = {
           network: this.#t,
-          output: r === Ye.OP_FALSE ? new Uint8Array(0) : r,
-          input: gt(t.slice(0, -1)),
+          output: r === Ye.OP_FALSE ? /* @__PURE__ */ new Uint8Array(0) : r,
+          input: yt(t.slice(0, -1)),
           witness: this.#o || []
         };
       }
@@ -4005,7 +4005,7 @@ var Ye = j, ho = class tr {
   #B() {
     if (this.#r) return this.#r;
     const t = this.hash;
-    if (t) return gt([
+    if (t) return yt([
       Ye.OP_HASH160,
       t,
       Ye.OP_EQUAL
@@ -4014,7 +4014,7 @@ var Ye = j, ho = class tr {
   #_() {
     if (this.#n) return this.#n;
     const t = this.#i;
-    if (!(!t || !t.input || !t.output)) return gt([].concat(et(t.input), t.output));
+    if (!(!t || !t.input || !t.output)) return yt([].concat(rt(t.input), t.output));
   }
   #R() {
     if (this.#i) return this.#i;
@@ -4028,7 +4028,7 @@ var Ye = j, ho = class tr {
   }
   #H(t) {
     if (t.output) {
-      const r = et(t.output);
+      const r = rt(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 (Xn(r) > 201) throw new TypeError("Redeem.output unspendable with more than 201 non-push ops");
@@ -4037,12 +4037,12 @@ var Ye = j, ho = class tr {
       const r = t.input.length > 0, n = t.witness && t.witness.length > 0;
       if (!r && !n) throw new TypeError("Empty input");
       if (r && n) throw new TypeError("Input and witness provided");
-      if (r && !Jr(et(t.input)))
+      if (r && !Jr(rt(t.input)))
         throw new TypeError("Non push-only scriptSig");
     }
   }
   #L() {
-    let t = new Uint8Array(0);
+    let t = /* @__PURE__ */ new Uint8Array(0);
     if (this.#e) {
       const r = this.#k();
       if (!r) throw new TypeError("Invalid address");
@@ -4388,13 +4388,13 @@ var nu = class {
   process(e, t) {
     for (let u = 0; u < 16; u++, t += 4) fe[u] = e.getUint32(t, !1);
     for (let u = 16; u < 64; u++) {
-      const d = fe[u - 15], w = fe[u - 2], b = Gt(d, 7) ^ Gt(d, 18) ^ d >>> 3;
-      fe[u] = (Gt(w, 17) ^ Gt(w, 19) ^ w >>> 10) + fe[u - 7] + b + fe[u - 16] | 0;
+      const d = fe[u - 15], w = fe[u - 2], g = Gt(d, 7) ^ Gt(d, 18) ^ d >>> 3, m = Gt(w, 17) ^ Gt(w, 19) ^ w >>> 10;
+      fe[u] = m + fe[u - 7] + g + fe[u - 16] | 0;
     }
     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 = Gt(a, 6) ^ Gt(a, 11) ^ Gt(a, 25), w = p + d + eu(a, f, l) + iu[u] + fe[u] | 0, b = (Gt(r, 2) ^ Gt(r, 13) ^ Gt(r, 22)) + ru(r, n, i) | 0;
-      p = l, l = f, f = a, a = o + w | 0, o = i, i = n, n = r, r = w + b | 0;
+      const d = Gt(a, 6) ^ Gt(a, 11) ^ Gt(a, 25), w = p + d + eu(a, f, l) + iu[u] + fe[u] | 0, g = (Gt(r, 2) ^ Gt(r, 13) ^ Gt(r, 22)) + ru(r, n, i) | 0;
+      p = l, l = f, f = a, a = o + w | 0, o = i, i = n, n = r, r = w + g | 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);
   }
@@ -4419,7 +4419,7 @@ var nu = class {
 }, au = /* @__PURE__ */ Jh(() => new ou(), /* @__PURE__ */ tu(1));
 function hu(e) {
   if (e.length >= 255) throw new TypeError("Alphabet too long");
-  const t = new Uint8Array(256);
+  const t = /* @__PURE__ */ new Uint8Array(256);
   for (let p = 0; p < t.length; p++) t[p] = 255;
   for (let p = 0; p < e.length; p++) {
     const u = e.charAt(p), d = u.charCodeAt(0);
@@ -4431,10 +4431,10 @@ function hu(e) {
     if (p instanceof Uint8Array || (ArrayBuffer.isView(p) ? p = new Uint8Array(p.buffer, p.byteOffset, p.byteLength) : Array.isArray(p) && (p = Uint8Array.from(p))), !(p instanceof Uint8Array)) throw new TypeError("Expected Uint8Array");
     if (p.length === 0) return "";
     let u = 0, d = 0, w = 0;
-    const b = p.length;
-    for (; w !== b && p[w] === 0; ) w++, u++;
-    const m = (b - w) * o + 1 >>> 0, v = new Uint8Array(m);
-    for (; w !== b; ) {
+    const g = p.length;
+    for (; w !== g && p[w] === 0; ) w++, u++;
+    const m = (g - w) * o + 1 >>> 0, v = new Uint8Array(m);
+    for (; w !== g; ) {
       let S = p[w], _ = 0;
       for (let O = m - 1; (S !== 0 || _ < d) && O !== -1; O--, _++) S += 256 * v[O] >>> 0, v[O] = S % r >>> 0, S = S / r >>> 0;
       if (S !== 0) throw new Error("Non-zero carry");
@@ -4448,25 +4448,25 @@ function hu(e) {
   }
   function f(p) {
     if (typeof p != "string") throw new TypeError("Expected String");
-    if (p.length === 0) return new Uint8Array();
+    if (p.length === 0) return /* @__PURE__ */ new Uint8Array();
     let u = 0, d = 0, w = 0;
     for (; p[u] === n; ) d++, u++;
-    const b = (p.length - u) * i + 1 >>> 0, m = new Uint8Array(b);
+    const g = (p.length - u) * i + 1 >>> 0, m = new Uint8Array(g);
     for (; u < p.length; ) {
       const S = p.charCodeAt(u);
       if (S > 255) return;
       let _ = t[S];
       if (_ === 255) return;
       let O = 0;
-      for (let z = b - 1; (_ !== 0 || O < w) && z !== -1; z--, O++) _ += r * m[z] >>> 0, m[z] = _ % 256 >>> 0, _ = _ / 256 >>> 0;
+      for (let z = g - 1; (_ !== 0 || O < w) && z !== -1; z--, O++) _ += r * m[z] >>> 0, m[z] = _ % 256 >>> 0, _ = _ / 256 >>> 0;
       if (_ !== 0) throw new Error("Non-zero carry");
       w = O, u++;
     }
-    let v = b - w;
-    for (; v !== b && m[v] === 0; ) v++;
-    const I = new Uint8Array(d + (b - v));
+    let v = g - w;
+    for (; v !== g && m[v] === 0; ) v++;
+    const I = new Uint8Array(d + (g - v));
     let P = d;
-    for (; v !== b; ) I[P++] = m[v++];
+    for (; v !== g; ) I[P++] = m[v++];
     return I;
   }
   function l(p) {
@@ -4515,7 +4515,7 @@ function ri(e, t) {
   if (r.length !== t) throw new Error("number too large");
   return r;
 }
-function go(e, t) {
+function yo(e, t) {
   return ri(e, t).reverse();
 }
 function uu(e) {
@@ -4540,7 +4540,7 @@ function pu(e, t, r) {
   let l = n(e), p = n(e), u = 0;
   const d = () => {
     l.fill(1), p.fill(0), u = 0;
-  }, w = (...v) => r(p, we(l, ...v)), b = (v = i) => {
+  }, w = (...v) => r(p, we(l, ...v)), g = (v = i) => {
     p = w(o, v), l = w(), v.length !== 0 && (p = w(a, v), l = w());
   }, m = () => {
     if (u++ >= f) throw new Error("drbg: tried max amount of iterations");
@@ -4554,9 +4554,9 @@ function pu(e, t, r) {
     return we(...I);
   };
   return (v, I) => {
-    d(), b(v);
+    d(), g(v);
     let P;
-    for (; !(P = I(m())); ) b();
+    for (; !(P = I(m())); ) g();
     return d(), P;
   };
 }
@@ -4580,7 +4580,7 @@ function Wi(e) {
     return t.set(r, o), o;
   };
 }
-var Ot = /* @__PURE__ */ BigInt(0), Tt = /* @__PURE__ */ BigInt(1), ve = /* @__PURE__ */ BigInt(2), yo = /* @__PURE__ */ BigInt(3), bo = /* @__PURE__ */ BigInt(4), mo = /* @__PURE__ */ BigInt(5), du = /* @__PURE__ */ BigInt(7), Eo = /* @__PURE__ */ BigInt(8), wu = /* @__PURE__ */ BigInt(9), vo = /* @__PURE__ */ BigInt(16);
+var Ot = /* @__PURE__ */ BigInt(0), Tt = /* @__PURE__ */ BigInt(1), ve = /* @__PURE__ */ BigInt(2), go = /* @__PURE__ */ BigInt(3), bo = /* @__PURE__ */ BigInt(4), mo = /* @__PURE__ */ BigInt(5), du = /* @__PURE__ */ BigInt(7), Eo = /* @__PURE__ */ BigInt(8), wu = /* @__PURE__ */ BigInt(9), vo = /* @__PURE__ */ BigInt(16);
 function Dt(e, t) {
   const r = e % t;
   return r >= Ot ? r : t + r;
@@ -4608,22 +4608,22 @@ function Io(e, t) {
   const r = (e.ORDER + Tt) / bo, n = e.pow(t, r);
   return si(e, n, t), n;
 }
-function gu(e, t) {
+function yu(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 si(e, f, t), f;
 }
-function yu(e) {
+function gu(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;
   return (f, l) => {
     let p = f.pow(l, a), u = f.mul(p, n);
-    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 d = f.mul(p, i), w = f.mul(p, o), g = f.eql(f.sqr(u), l), m = f.eql(f.sqr(d), l);
+    p = f.cmov(p, u, g), u = f.cmov(w, d, m);
     const v = f.eql(f.sqr(u), l), I = f.cmov(p, u, v);
     return si(f, I, l), I;
   };
 }
 function Ao(e) {
-  if (e < yo) throw new Error("sqrt is not defined for small field");
+  if (e < go) throw new Error("sqrt is not defined for small field");
   let t = e - Tt, r = 0;
   for (; t % ve === Ot; ) t /= ve, r++;
   let n = ve;
@@ -4638,16 +4638,16 @@ function Ao(e) {
     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;
-      let b = 1, m = f.sqr(d);
-      for (; !f.eql(m, f.ONE); ) if (b++, m = f.sqr(m), b === p) throw new Error("Cannot find square root");
-      const v = Tt << BigInt(p - b - 1), I = f.pow(u, v);
-      p = b, u = f.sqr(I), d = f.mul(d, u), w = f.mul(w, I);
+      let g = 1, m = f.sqr(d);
+      for (; !f.eql(m, f.ONE); ) if (g++, m = f.sqr(m), g === p) throw new Error("Cannot find square root");
+      const v = Tt << BigInt(p - g - 1), I = f.pow(u, v);
+      p = g, u = f.sqr(I), d = f.mul(d, u), w = f.mul(w, I);
     }
     return w;
   };
 }
 function bu(e) {
-  return e % bo === yo ? Io : e % Eo === mo ? gu : e % vo === wu ? yu(e) : Ao(e);
+  return e % bo === go ? Io : e % Eo === mo ? yu : e % vo === wu ? gu(e) : Ao(e);
 }
 var mu = [
   "create",
@@ -4777,7 +4777,7 @@ var Au = class {
     return this._sqrt || (this._sqrt = bu(this.ORDER)), this._sqrt(this, e);
   }
   toBytes(e) {
-    return this.isLE ? go(e, this.BYTES) : ri(e, this.BYTES);
+    return this.isLE ? yo(e, this.BYTES) : ri(e, this.BYTES);
   }
   fromBytes(e, t = !1) {
     ut(e);
@@ -4816,7 +4816,7 @@ 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) : ri(a, i);
+  return r ? yo(a, i) : ri(a, i);
 }
 var Me = /* @__PURE__ */ BigInt(0), Ie = /* @__PURE__ */ BigInt(1);
 function Dr(e, t) {
@@ -4845,18 +4845,18 @@ 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);
-  const p = t * n, u = p + Math.abs(f) - 1, d = f === 0, w = f < 0, b = t % 2 !== 0;
+  const p = t * n, u = p + Math.abs(f) - 1, d = f === 0, w = f < 0, g = t % 2 !== 0;
   return {
     nextN: l,
     offset: u,
     isZero: d,
     isNeg: w,
-    isNegF: b,
+    isNegF: g,
     offsetF: p
   };
 }
-var gn = /* @__PURE__ */ new WeakMap(), Oo = /* @__PURE__ */ new WeakMap();
-function yn(e) {
+var yn = /* @__PURE__ */ new WeakMap(), Oo = /* @__PURE__ */ new WeakMap();
+function gn(e) {
   return Oo.get(e) || 1;
 }
 function Yi(e) {
@@ -4910,22 +4910,22 @@ var Tu = class {
     return Yi(r), n;
   }
   getPrecomputes(e, t, r) {
-    let n = gn.get(t);
-    return n || (n = this.precomputeWindow(t, e), e !== 1 && (typeof r == "function" && (n = r(n)), gn.set(t, n))), n;
+    let n = yn.get(t);
+    return n || (n = this.precomputeWindow(t, e), e !== 1 && (typeof r == "function" && (n = r(n)), yn.set(t, n))), n;
   }
   cached(e, t, r) {
-    const n = yn(e);
+    const n = gn(e);
     return this.wNAF(n, this.getPrecomputes(n, e, r), t);
   }
   unsafe(e, t, r, n) {
-    const i = yn(e);
+    const i = gn(e);
     return i === 1 ? this._unsafeLadder(e, t, n) : this.wNAFUnsafe(i, this.getPrecomputes(i, e, r), t, n);
   }
   createCache(e, t) {
-    Uo(t, this.bits), Oo.set(e, t), gn.delete(e);
+    Uo(t, this.bits), Oo.set(e, t), yn.delete(e);
   }
   hasCache(e) {
-    return yn(e) !== 1;
+    return gn(e) !== 1;
   }
 };
 function ku(e, t, r, n) {
@@ -5020,8 +5020,8 @@ function Pu(e, t, 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 = ni(Math.ceil(lu(r) / 2)) + Ve;
-  if (p < re || p >= b || u < re || u >= b) throw new Error("splitScalar (endomorphism): failed, k=" + e);
+  const g = ni(Math.ceil(lu(r) / 2)) + Ve;
+  if (p < re || p >= g || u < re || u >= g) throw new Error("splitScalar (endomorphism): failed, k=" + e);
   return {
     k1neg: d,
     k1: p,
@@ -5151,8 +5151,8 @@ function _u(e, t = {}) {
         throw new Error("bad point: is not on curve, sqrt error" + ct);
       }
       u();
-      const M = n.isOdd(L);
-      return (B & 1) === 1 !== M && (L = n.neg(L)), {
+      const D = n.isOdd(L);
+      return (B & 1) === 1 !== D && (L = n.neg(L)), {
         x: $,
         y: L
       };
@@ -5165,7 +5165,7 @@ function _u(e, t = {}) {
       };
     } else throw new Error(`bad point: got length ${A}, expected compressed=${U} or uncompressed=${T}`);
   }
-  const b = t.toBytes || d, m = t.fromBytes || w;
+  const g = t.toBytes || d, m = t.fromBytes || w;
   function v(Y) {
     const U = n.sqr(Y), T = n.mul(U, Y);
     return n.add(n.add(T, n.mul(Y, o.a)), o.b);
@@ -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 = Wi((Y, U) => {
+  const M = 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 = Wi((Y) => {
+  }), Z = Wi((Y) => {
     if (Y.is0()) {
       if (t.allowInfinityPoint && !n.is0(Y.Y)) return;
       throw new Error("bad point: ZERO");
@@ -5217,7 +5217,7 @@ function _u(e, t = {}) {
     if (!Y.isTorsionFree()) throw new Error("bad point: not in prime-order subgroup");
     return !0;
   });
-  function at(Y, U, T, A, B) {
+  function Q(Y, U, T, A, B) {
     return T = new q(n.mul(T.X, Y), T.Y, T.Z), U = Dr(A, U), T = Dr(B, T), U.add(T);
   }
   class q {
@@ -5257,7 +5257,7 @@ function _u(e, t = {}) {
       return Qt.createCache(this, U), T || this.multiply(Ar), this;
     }
     assertValidity() {
-      X(this);
+      Z(this);
     }
     hasEvenY() {
       const { y: U } = this.toAffine();
@@ -5266,26 +5266,26 @@ function _u(e, t = {}) {
     }
     equals(U) {
       O(U);
-      const { X: T, Y: A, Z: B } = this, { X: V, Y: $, Z: C } = U, L = n.eql(n.mul(T, C), n.mul(V, B)), M = n.eql(n.mul(A, C), n.mul($, B));
-      return L && M;
+      const { X: T, Y: A, Z: B } = this, { X: V, Y: $, Z: C } = U, L = n.eql(n.mul(T, C), n.mul(V, B)), D = n.eql(n.mul(A, C), n.mul($, B));
+      return L && D;
     }
     negate() {
       return new q(this.X, n.neg(this.Y), this.Z);
     }
     double() {
       const { a: U, b: T } = o, A = n.mul(T, Ar), { X: B, Y: V, Z: $ } = this;
-      let C = n.ZERO, L = n.ZERO, M = n.ZERO, F = n.mul(B, B), ct = n.mul(V, V), W = n.mul($, $), K = n.mul(B, V);
-      return K = n.add(K, K), M = n.mul(B, $), M = n.add(M, M), C = n.mul(U, M), L = n.mul(A, W), L = n.add(C, L), C = n.sub(ct, L), L = n.add(ct, L), L = n.mul(C, L), C = n.mul(K, C), M = n.mul(A, M), W = n.mul(U, W), K = n.sub(F, W), K = n.mul(U, K), K = n.add(K, M), M = n.add(F, F), F = n.add(M, F), F = n.add(F, W), F = n.mul(F, K), L = n.add(L, F), W = n.mul(V, $), W = n.add(W, W), F = n.mul(W, K), C = n.sub(C, F), M = n.mul(W, ct), M = n.add(M, M), M = n.add(M, M), new q(C, L, M);
+      let C = n.ZERO, L = n.ZERO, D = n.ZERO, F = n.mul(B, B), ct = n.mul(V, V), W = n.mul($, $), K = n.mul(B, V);
+      return K = n.add(K, K), D = n.mul(B, $), D = n.add(D, D), C = n.mul(U, D), L = n.mul(A, W), L = n.add(C, L), C = n.sub(ct, L), L = n.add(ct, L), L = n.mul(C, L), C = n.mul(K, C), D = n.mul(A, D), W = n.mul(U, W), K = n.sub(F, W), K = n.mul(U, K), K = n.add(K, D), D = n.add(F, F), F = n.add(D, F), F = n.add(F, W), F = n.mul(F, K), L = n.add(L, F), W = n.mul(V, $), W = n.add(W, W), F = n.mul(W, K), C = n.sub(C, F), D = n.mul(W, ct), D = n.add(D, D), D = n.add(D, D), new q(C, L, D);
     }
     add(U) {
       O(U);
       const { X: T, Y: A, Z: B } = this, { X: V, Y: $, Z: C } = U;
-      let L = n.ZERO, M = n.ZERO, F = n.ZERO;
+      let L = n.ZERO, D = n.ZERO, F = n.ZERO;
       const ct = o.a, W = n.mul(o.b, Ar);
-      let K = n.mul(T, V), nt = n.mul(A, $), lt = n.mul(B, C), _t = n.add(T, A), it = n.add(V, $);
-      _t = n.mul(_t, it), it = n.add(K, nt), _t = n.sub(_t, it), it = n.add(T, B);
-      let yt = n.add(V, C);
-      return it = n.mul(it, yt), yt = n.add(K, lt), it = n.sub(it, yt), yt = n.add(A, B), L = n.add($, C), yt = n.mul(yt, L), L = n.add(nt, lt), yt = n.sub(yt, L), F = n.mul(ct, it), L = n.mul(W, lt), F = n.add(L, F), L = n.sub(nt, F), F = n.add(nt, F), M = n.mul(L, F), nt = n.add(K, K), nt = n.add(nt, K), lt = n.mul(ct, lt), it = n.mul(W, it), nt = n.add(nt, lt), lt = n.sub(K, lt), lt = n.mul(ct, lt), it = n.add(it, lt), K = n.mul(nt, it), M = n.add(M, K), K = n.mul(yt, it), L = n.mul(_t, L), L = n.sub(L, K), K = n.mul(_t, nt), F = n.mul(yt, F), F = n.add(F, K), new q(L, M, F);
+      let K = n.mul(T, V), it = n.mul(A, $), lt = n.mul(B, C), _t = n.add(T, A), st = n.add(V, $);
+      _t = n.mul(_t, st), st = n.add(K, it), _t = n.sub(_t, st), st = n.add(T, B);
+      let gt = n.add(V, C);
+      return st = n.mul(st, gt), gt = n.add(K, lt), st = n.sub(st, gt), gt = n.add(A, B), L = n.add($, C), gt = n.mul(gt, L), L = n.add(it, lt), gt = n.sub(gt, L), F = n.mul(ct, st), L = n.mul(W, lt), F = n.add(L, F), L = n.sub(it, F), F = n.add(it, F), D = n.mul(L, F), it = n.add(K, K), it = n.add(it, K), lt = n.mul(ct, lt), st = n.mul(W, st), it = n.add(it, lt), lt = n.sub(K, lt), lt = n.mul(ct, lt), st = n.add(st, lt), K = n.mul(it, st), D = n.add(D, K), K = n.mul(gt, st), L = n.mul(_t, L), L = n.sub(L, K), K = n.mul(_t, it), F = n.mul(gt, F), F = n.add(F, K), new q(L, D, F);
     }
     subtract(U) {
       return this.add(U.negate());
@@ -5299,8 +5299,8 @@ function _u(e, t = {}) {
       let A, B;
       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);
+        const { k1neg: $, k1: C, k2neg: L, k2: D } = z(U), { p: F, f: ct } = V(C), { p: W, f: K } = V(D);
+        B = ct.add(K), A = Q(T.beta, F, W, $, L);
       } else {
         const { p: $, f: C } = V(U);
         A = $, B = C;
@@ -5314,12 +5314,12 @@ function _u(e, t = {}) {
       if (U === Ve) return A;
       if (Qt.hasCache(this)) return this.multiply(U);
       if (T) {
-        const { k1neg: B, k1: V, k2neg: $, k2: C } = z(U), { p1: L, p2: M } = ku(q, A, V, C);
-        return at(T.beta, L, M, B, $);
+        const { k1neg: B, k1: V, k2neg: $, k2: C } = z(U), { p1: L, p2: D } = ku(q, A, V, C);
+        return Q(T.beta, L, D, B, $);
       } else return Qt.unsafe(A, U);
     }
     toAffine(U) {
-      return D(this, U);
+      return M(this, U);
     }
     isTorsionFree() {
       const { isTorsionFree: U } = t;
@@ -5333,7 +5333,7 @@ function _u(e, t = {}) {
       return this.multiplyUnsafe(a).is0();
     }
     toBytes(U = !0) {
-      return Kr(U, "isCompressed"), this.assertValidity(), b(q, this, U);
+      return Kr(U, "isCompressed"), this.assertValidity(), g(q, this, U);
     }
     toHex(U = !0) {
       return en(this.toBytes(U));
@@ -5359,39 +5359,39 @@ function Ro(e, t) {
 }
 function Ru(e, t = {}) {
   const { Fn: r } = e, n = t.randomBytes || co, i = Object.assign(Ro(e.Fp, r), { seed: ko(r.ORDER) });
-  function o(b) {
+  function o(g) {
     try {
-      const m = r.fromBytes(b);
+      const m = r.fromBytes(g);
       return r.isValidNot0(m);
     } catch {
       return !1;
     }
   }
-  function a(b, m) {
+  function a(g, m) {
     const { publicKey: v, publicKeyUncompressed: I } = i;
     try {
-      const P = b.length;
-      return m === !0 && P !== v || m === !1 && P !== I ? !1 : !!e.fromBytes(b);
+      const P = g.length;
+      return m === !0 && P !== v || m === !1 && P !== I ? !1 : !!e.fromBytes(g);
     } catch {
       return !1;
     }
   }
-  function f(b = n(i.seed)) {
-    return Su(ut(b, i.seed, "seed"), r.ORDER);
+  function f(g = n(i.seed)) {
+    return Su(ut(g, i.seed, "seed"), r.ORDER);
   }
-  function l(b, m = !0) {
-    return e.BASE.multiply(r.fromBytes(b)).toBytes(m);
+  function l(g, m = !0) {
+    return e.BASE.multiply(r.fromBytes(g)).toBytes(m);
   }
-  function p(b) {
+  function p(g) {
     const { secretKey: m, publicKey: v, publicKeyUncompressed: I } = i;
-    if (!ti(b) || "_lengths" in r && r._lengths || m === v) return;
-    const P = ut(b, void 0, "key").length;
+    if (!ti(g) || "_lengths" in r && r._lengths || m === v) return;
+    const P = ut(g, void 0, "key").length;
     return P === v || P === I;
   }
-  function u(b, m, v = !0) {
-    if (p(b) === !0) throw new Error("first arg must be private key");
+  function u(g, m, v = !0) {
+    if (p(g) === !0) throw new Error("first arg must be private key");
     if (p(m) === !1) throw new Error("second arg must be public key");
-    const I = r.fromBytes(b);
+    const I = r.fromBytes(g);
     return e.fromBytes(m).multiply(I).toBytes(v);
   }
   const d = {
@@ -5416,7 +5416,7 @@ function Nu(e, t, r = {}) {
     bits2int: "function",
     bits2int_modN: "function"
   }), r = Object.assign({}, r);
-  const n = r.randomBytes || co, i = r.hmac || ((T, A) => xo(t, T, A)), { Fp: o, Fn: a } = e, { ORDER: f, BITS: l } = a, { keygen: p, getPublicKey: u, getSharedSecret: d, utils: w, lengths: b } = Ru(e, r), m = {
+  const n = r.randomBytes || co, i = r.hmac || ((T, A) => xo(t, T, A)), { Fp: o, Fn: a } = e, { ORDER: f, BITS: l } = a, { keygen: p, getPublicKey: u, getSharedSecret: d, utils: w, lengths: g } = Ru(e, r), m = {
     prehash: !0,
     lowS: typeof r.lowS == "boolean" ? r.lowS : !0,
     format: "compact",
@@ -5434,7 +5434,7 @@ function Nu(e, t, r = {}) {
   }
   function _(T, A) {
     Rn(A);
-    const B = b.signature;
+    const B = g.signature;
     return ut(T, A === "compact" ? B : A === "recovered" ? B + 1 : void 0);
   }
   class O {
@@ -5457,11 +5457,11 @@ function Nu(e, t, r = {}) {
       _(A, B);
       let V;
       if (B === "der") {
-        const { r: M, s: F } = de.toSig(ut(A));
-        return new O(M, F);
+        const { r: D, s: F } = de.toSig(ut(A));
+        return new O(D, F);
       }
       B === "recovered" && (V = A[0], B = "compact", A = A.subarray(1));
-      const $ = b.signature / 2, C = A.subarray(0, $), L = A.subarray($, $ * 2);
+      const $ = g.signature / 2, C = A.subarray(0, $), L = A.subarray($, $ * 2);
       return new O(a.fromBytes(C), a.fromBytes(L), V);
     }
     static fromHex(A, B) {
@@ -5478,9 +5478,9 @@ function Nu(e, t, r = {}) {
     recoverPublicKey(A) {
       const { r: B, s: V } = this, $ = this.assertRecovery(), C = $ === 2 || $ === 3 ? B + f : B;
       if (!o.isValid(C)) throw new Error("invalid recovery id: sig.r+curve.n != R.x");
-      const L = o.toBytes(C), M = e.fromBytes(we(_o(($ & 1) === 0), L)), F = a.inv(C), ct = D(ut(A, void 0, "msgHash")), W = a.create(-ct * F), K = a.create(V * F), nt = e.BASE.multiplyUnsafe(W).add(M.multiplyUnsafe(K));
-      if (nt.is0()) throw new Error("invalid recovery: point at infinify");
-      return nt.assertValidity(), nt;
+      const L = o.toBytes(C), D = e.fromBytes(we(_o(($ & 1) === 0), L)), F = a.inv(C), ct = M(ut(A, void 0, "msgHash")), W = a.create(-ct * F), K = a.create(V * F), it = e.BASE.multiplyUnsafe(W).add(D.multiplyUnsafe(K));
+      if (it.is0()) throw new Error("invalid recovery: point at infinify");
+      return it.assertValidity(), it;
     }
     hasHighS() {
       return I(this.s);
@@ -5498,11 +5498,11 @@ function Nu(e, t, r = {}) {
     if (T.length > 8192) throw new Error("input is too large");
     const A = rn(T), B = T.length * 8 - l;
     return B > 0 ? A >> BigInt(B) : A;
-  }, D = r.bits2int_modN || function(T) {
+  }, M = r.bits2int_modN || function(T) {
     return a.create(z(T));
-  }, X = ni(l);
-  function at(T) {
-    return cu("num < 2^" + l, T, re, X), a.toBytes(T);
+  }, Z = ni(l);
+  function Q(T) {
+    return cu("num < 2^" + l, T, re, Z), a.toBytes(T);
   }
   function q(T, A) {
     return ut(T, void 0, "message"), A ? ut(t(T), void 0, "prehashed message") : T;
@@ -5510,23 +5510,23 @@ function Nu(e, t, r = {}) {
   function Vt(T, A, B) {
     const { lowS: V, prehash: $, extraEntropy: C } = bn(B, m);
     T = q(T, $);
-    const L = D(T), M = a.fromBytes(A);
-    if (!a.isValidNot0(M)) throw new Error("invalid private key");
-    const F = [at(M), at(L)];
+    const L = M(T), D = a.fromBytes(A);
+    if (!a.isValidNot0(D)) throw new Error("invalid private key");
+    const F = [Q(D), Q(L)];
     if (C != null && C !== !1) {
-      const nt = C === !0 ? n(b.secretKey) : C;
-      F.push(ut(nt, void 0, "extraEntropy"));
+      const it = C === !0 ? n(g.secretKey) : C;
+      F.push(ut(it, void 0, "extraEntropy"));
     }
     const ct = we(...F), W = L;
-    function K(nt) {
-      const lt = z(nt);
+    function K(it) {
+      const lt = z(it);
       if (!a.isValidNot0(lt)) return;
-      const _t = a.inv(lt), it = e.BASE.multiply(lt).toAffine(), yt = a.create(it.x);
-      if (yt === re) return;
-      const $t = a.create(_t * a.create(W + yt * M));
+      const _t = a.inv(lt), st = e.BASE.multiply(lt).toAffine(), gt = a.create(st.x);
+      if (gt === re) return;
+      const $t = a.create(_t * a.create(W + gt * D));
       if ($t === re) return;
-      let Be = (it.x === yt ? 0 : 2) | Number(it.y & Ve), je = $t;
-      return V && I($t) && (je = a.neg($t), Be ^= 1), new O(yt, je, v ? void 0 : Be);
+      let Be = (st.x === gt ? 0 : 2) | Number(st.y & Ve), je = $t;
+      return V && I($t) && (je = a.neg($t), Be ^= 1), new O(gt, je, v ? void 0 : Be);
     }
     return {
       seed: ct,
@@ -5540,15 +5540,15 @@ 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), !ti(T)) {
-      const M = T instanceof O ? ", use sig.toBytes()" : "";
-      throw new Error("verify expects Uint8Array signature" + M);
+      const D = T instanceof O ? ", use sig.toBytes()" : "";
+      throw new Error("verify expects Uint8Array signature" + D);
     }
     _(T, L);
     try {
-      const M = O.fromBytes(T, L), F = e.fromBytes(B);
-      if ($ && M.hasHighS()) return !1;
-      const { r: ct, s: W } = M, K = D(A), nt = a.inv(W), lt = a.create(K * nt), _t = a.create(ct * nt), it = e.BASE.multiplyUnsafe(lt).add(F.multiplyUnsafe(_t));
-      return it.is0() ? !1 : a.create(it.x) === ct;
+      const D = O.fromBytes(T, L), F = e.fromBytes(B);
+      if ($ && D.hasHighS()) return !1;
+      const { r: ct, s: W } = D, K = M(A), it = a.inv(W), lt = a.create(K * it), _t = a.create(ct * it), st = e.BASE.multiplyUnsafe(lt).add(F.multiplyUnsafe(_t));
+      return st.is0() ? !1 : a.create(st.x) === ct;
     } catch {
       return !1;
     }
@@ -5562,7 +5562,7 @@ function Nu(e, t, r = {}) {
     getPublicKey: u,
     getSharedSecret: d,
     utils: w,
-    lengths: b,
+    lengths: g,
     Point: e,
     sign: Qt,
     verify: Y,
@@ -5584,7 +5584,7 @@ var oi = {
   basises: [[BigInt("0x3086d221a7d46bcde86c90e49284eb15"), -BigInt("0xe4437ed6010e88286f547fa90abfe4c3")], [BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), BigInt("0x3086d221a7d46bcde86c90e49284eb15")]]
 }, Qi = /* @__PURE__ */ BigInt(2);
 function Lu(e) {
-  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);
+  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, g = Rt(w, o, t) * w % t, m = Rt(g, f, t) * g % t, v = Rt(Rt(Rt(Rt(Rt(Rt(m, l, t) * m % t, f, t) * g % 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;
 }
@@ -5596,21 +5596,21 @@ var Nn = nn(oi.p, { sqrt: Lu });
 function H(e) {
   return Xh(e);
 }
-function Z(e, t) {
+function X(e, t) {
   if (!e) throw new Error(`verifyCryptoBackend: ${t}`);
 }
 function Cu(e) {
-  Z(e.isPoint(H("0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798")), "isPoint should accept generator point"), Z(!e.isPoint(H("030000000000000000000000000000000000000000000000000000000000000005")), "isPoint should reject invalid point"), Z(e.isXOnlyPoint(H("79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798")), "isXOnlyPoint should accept generator x-coordinate"), Z(!e.isXOnlyPoint(H("0000000000000000000000000000000000000000000000000000000000000005")), "isXOnlyPoint should reject x-coordinate not on curve"), Z(!e.isXOnlyPoint(H("0000000000000000000000000000000000000000000000000000000000000000")), "isXOnlyPoint should reject zero"), Z(!e.isXOnlyPoint(H("79be667ef9dcbbac55a06295ce870b07")), "isXOnlyPoint should reject wrong length"), Z(e.isPrivate(H("79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798")), "isPrivate should accept valid scalar"), Z(e.isPrivate(H("fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364140")), "isPrivate should accept n-1"), Z(!e.isPrivate(H("0000000000000000000000000000000000000000000000000000000000000000")), "isPrivate should reject zero"), Z(!e.isPrivate(H("fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141")), "isPrivate should reject n"), Z(!e.isPrivate(H("fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364142")), "isPrivate should reject n+1");
+  X(e.isPoint(H("0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798")), "isPoint should accept generator point"), X(!e.isPoint(H("030000000000000000000000000000000000000000000000000000000000000005")), "isPoint should reject invalid point"), X(e.isXOnlyPoint(H("79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798")), "isXOnlyPoint should accept generator x-coordinate"), X(!e.isXOnlyPoint(H("0000000000000000000000000000000000000000000000000000000000000005")), "isXOnlyPoint should reject x-coordinate not on curve"), X(!e.isXOnlyPoint(H("0000000000000000000000000000000000000000000000000000000000000000")), "isXOnlyPoint should reject zero"), X(!e.isXOnlyPoint(H("79be667ef9dcbbac55a06295ce870b07")), "isXOnlyPoint should reject wrong length"), X(e.isPrivate(H("79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798")), "isPrivate should accept valid scalar"), X(e.isPrivate(H("fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364140")), "isPrivate should accept n-1"), X(!e.isPrivate(H("0000000000000000000000000000000000000000000000000000000000000000")), "isPrivate should reject zero"), X(!e.isPrivate(H("fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141")), "isPrivate should reject n"), X(!e.isPrivate(H("fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364142")), "isPrivate should reject n+1");
   const t = e.privateAdd(H("0000000000000000000000000000000000000000000000000000000000000001"), H("0000000000000000000000000000000000000000000000000000000000000000"));
-  Z(t !== null && Ut(t, H("0000000000000000000000000000000000000000000000000000000000000001")), "privateAdd: 1 + 0 should equal 1"), Z(e.privateAdd(H("fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd036413e"), H("0000000000000000000000000000000000000000000000000000000000000003")) === null, "privateAdd: (n-3) + 3 should return null (result is zero mod n)");
+  X(t !== null && Ut(t, H("0000000000000000000000000000000000000000000000000000000000000001")), "privateAdd: 1 + 0 should equal 1"), X(e.privateAdd(H("fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd036413e"), H("0000000000000000000000000000000000000000000000000000000000000003")) === null, "privateAdd: (n-3) + 3 should return null (result is zero mod n)");
   const r = e.privateAdd(H("e211078564db65c3ce7704f08262b1f38f1ef412ad15b5ac2d76657a63b2c500"), H("b51fbb69051255d1becbd683de5848242a89c229348dd72896a87ada94ae8665"));
-  Z(r !== null && Ut(r, H("9730c2ee69edbb958d42db7460bafa18fef9d955325aec99044c81c8282b0a24")), "privateAdd: known vector failed"), Z(Ut(e.privateNegate(H("0000000000000000000000000000000000000000000000000000000000000001")), H("fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364140")), "privateNegate(1) should equal n-1"), Z(Ut(e.privateNegate(H("fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd036413e")), H("0000000000000000000000000000000000000000000000000000000000000003")), "privateNegate(n-3) should equal 3"), Z(Ut(e.privateNegate(H("b1121e4088a66a28f5b6b0f5844943ecd9f610196d7bb83b25214b60452c09af")), H("4eede1bf775995d70a494f0a7bb6bc11e0b8cccd41cce8009ab1132c8b0a3792")), "privateNegate known vector failed"), Z(Ut(e.pointCompress(H("0479be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8"), !0), H("0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798")), "pointCompress uncompressed->compressed failed"), Z(Ut(e.pointCompress(H("0479be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8"), !1), H("0479be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8")), "pointCompress uncompressed->uncompressed failed"), Z(Ut(e.pointCompress(H("0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"), !0), H("0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798")), "pointCompress compressed->compressed failed"), Z(Ut(e.pointCompress(H("0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"), !1), H("0479be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8")), "pointCompress compressed->uncompressed failed");
+  X(r !== null && Ut(r, H("9730c2ee69edbb958d42db7460bafa18fef9d955325aec99044c81c8282b0a24")), "privateAdd: known vector failed"), X(Ut(e.privateNegate(H("0000000000000000000000000000000000000000000000000000000000000001")), H("fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364140")), "privateNegate(1) should equal n-1"), X(Ut(e.privateNegate(H("fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd036413e")), H("0000000000000000000000000000000000000000000000000000000000000003")), "privateNegate(n-3) should equal 3"), X(Ut(e.privateNegate(H("b1121e4088a66a28f5b6b0f5844943ecd9f610196d7bb83b25214b60452c09af")), H("4eede1bf775995d70a494f0a7bb6bc11e0b8cccd41cce8009ab1132c8b0a3792")), "privateNegate known vector failed"), X(Ut(e.pointCompress(H("0479be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8"), !0), H("0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798")), "pointCompress uncompressed->compressed failed"), X(Ut(e.pointCompress(H("0479be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8"), !1), H("0479be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8")), "pointCompress uncompressed->uncompressed failed"), X(Ut(e.pointCompress(H("0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"), !0), H("0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798")), "pointCompress compressed->compressed failed"), X(Ut(e.pointCompress(H("0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"), !1), H("0479be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8")), "pointCompress compressed->uncompressed failed");
   const n = e.pointFromScalar(H("b1121e4088a66a28f5b6b0f5844943ecd9f610196d7bb83b25214b60452c09af"));
-  Z(n !== null && Ut(n, H("02b07ba9dca9523b7ef4bd97703d43d20399eb698e194704791a25ce77a400df99")), "pointFromScalar known vector failed"), Z(e.xOnlyPointAddTweak(H("79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"), H("fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364140")) === null, "xOnlyPointAddTweak should return null for infinity result");
+  X(n !== null && Ut(n, H("02b07ba9dca9523b7ef4bd97703d43d20399eb698e194704791a25ce77a400df99")), "pointFromScalar known vector failed"), X(e.xOnlyPointAddTweak(H("79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"), H("fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364140")) === null, "xOnlyPointAddTweak should return null for infinity result");
   let i = e.xOnlyPointAddTweak(H("1617d38ed8d8657da4d4761e8057bc396ea9e4b9d29776d4be096016dbd2509b"), H("a8397a935f0dfceba6ba9618f6451ef4d80637abf4e6af2669fbc9de6a8fd2ac"));
-  Z(i !== null && Ut(i.xOnlyPubkey, H("e478f99dab91052ab39a33ea35fd5e6e4933f4d28023cd597c9a1f6760346adf")) && i.parity === 1, "xOnlyPointAddTweak parity=1 case failed"), i = e.xOnlyPointAddTweak(H("2c0b7cf95324a07d05398b240174dc0c2be444d96b159aa6c7f7b1e668680991"), H("823c3cd2142744b075a87eade7e1b8678ba308d566226a0056ca2b7a76f86b47")), Z(i !== null && Ut(i.xOnlyPubkey, H("9534f8dc8c6deda2dc007655981c78b49c5d96c778fbf363462a11ec9dfd948c")) && i.parity === 0, "xOnlyPointAddTweak parity=0 case failed");
+  X(i !== null && Ut(i.xOnlyPubkey, H("e478f99dab91052ab39a33ea35fd5e6e4933f4d28023cd597c9a1f6760346adf")) && i.parity === 1, "xOnlyPointAddTweak parity=1 case failed"), i = e.xOnlyPointAddTweak(H("2c0b7cf95324a07d05398b240174dc0c2be444d96b159aa6c7f7b1e668680991"), H("823c3cd2142744b075a87eade7e1b8678ba308d566226a0056ca2b7a76f86b47")), X(i !== null && Ut(i.xOnlyPubkey, H("9534f8dc8c6deda2dc007655981c78b49c5d96c778fbf363462a11ec9dfd948c")) && i.parity === 0, "xOnlyPointAddTweak parity=0 case failed");
   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");
+  X(Ut(o, H("54c4a33c6423d689378f160a7ff8b61330444abb58fb470f96ea16d99d4a2fed07082304410efa6b2943111b6a4e0aaa7b7db55a07e9861d1fb3cb1f421044a5")), "sign known vector failed"), X(e.verify(H("5e9f0a0d593efdcf78ac923bc3313e4e7d408d574354ee2b3288c0da9fbba6ed"), H("0379be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"), o), "verify known vector failed"), e.signSchnorr && X(Ut(e.signSchnorr(H("7e2d58d8b3bcdf1abadec7829054f90dda9805aab56c77333024b9d0a508b75c"), H("c90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b14e5c9"), H("c87aa53824b4d7ae2eb035a2b5bbbccc080e76cdc6d1692c4b0b62d798e6d906")), H("5831aaeed7b44bb74e5eab94ba9d4294c49bcf2a60728d8b4c200f50dd313c1bab745879a5ad954a72c45a91c3a51d3c7adea98d82f8481e0e1e03674a6f3fb7")), "signSchnorr known vector failed"), e.verifySchnorr && X(e.verifySchnorr(H("7e2d58d8b3bcdf1abadec7829054f90dda9805aab56c77333024b9d0a508b75c"), H("dd308afec5777e13121fa72b9cc1b7cc0139715309b086c960e18fd969774eb8"), H("5831aaeed7b44bb74e5eab94ba9d4294c49bcf2a60728d8b4c200f50dd313c1bab745879a5ad954a72c45a91c3a51d3c7adea98d82f8481e0e1e03674a6f3fb7")), "verifySchnorr known vector failed");
 }
 var Hn = class Kt {
   static #t;
@@ -5705,7 +5705,7 @@ function Fe(e, t) {
 }
 function Du(e) {
   const t = Et(Ct(e.length));
-  return ge(e.length, t), Bt([t, e]);
+  return ye(e.length, t), Bt([t, e]);
 }
 var Ji = j, ts = 2, Mu = 80, No = class rr {
   static NAME = ft.P2MR;
@@ -5725,8 +5725,8 @@ var Ji = j, ts = 2, Mu = 80, No = class rr {
   #l;
   #d;
   #w = !1;
-  #g = !1;
   #y = !1;
+  #g = !1;
   #m = !1;
   #E = !1;
   #v = !1;
@@ -5752,10 +5752,10 @@ var Ji = j, ts = 2, Mu = 80, No = class rr {
     return this.#w || (this.#f = this.#x(), this.#w = !0), this.#f;
   }
   get hash() {
-    return this.#g || (this.#u = this.#B(), this.#g = !0), this.#u;
+    return this.#y || (this.#u = this.#B(), this.#y = !0), this.#u;
   }
   get output() {
-    return this.#y || (this.#c = this.#_(), this.#y = !0), this.#c;
+    return this.#g || (this.#c = this.#_(), this.#g = !0), this.#c;
   }
   get redeem() {
     return this.#m || (this.#p = this.#R(), this.#m = !0), this.#p;
@@ -5834,8 +5834,8 @@ var Ji = j, ts = 2, Mu = 80, No = class rr {
     if (this.#e) return this.#e;
     const t = this.hash;
     if (!t) return;
-    const r = tt.bech32m.toWords(t);
-    return r.unshift(ts), tt.bech32m.encode(this.#t.bech32, r);
+    const r = et.bech32m.toWords(t);
+    return r.unshift(ts), et.bech32m.encode(this.#t.bech32, r);
   }
   #B() {
     if (this.#s) return this.#s;
@@ -5855,7 +5855,7 @@ var Ji = j, ts = 2, Mu = 80, No = class rr {
   #_() {
     if (this.#n) return this.#n;
     const t = this.hash;
-    if (t) return gt([Ji.OP_2, t]);
+    if (t) return yt([Ji.OP_2, t]);
   }
   #R() {
     if (this.#o) return this.#o;
@@ -5885,7 +5885,7 @@ var Ji = j, ts = 2, Mu = 80, No = class rr {
     }
   }
   #L() {
-    let t = new Uint8Array(0);
+    let t = /* @__PURE__ */ new Uint8Array(0);
     if (this.#e) {
       const i = this.#P();
       if (!i) throw new TypeError("Invalid address");
@@ -5914,7 +5914,7 @@ var Ji = j, ts = 2, Mu = 80, No = class rr {
     if (this.#o && this.redeem) {
       if (this.#o.redeemVersion && this.#o.redeemVersion !== this.redeem.redeemVersion) throw new TypeError("Redeem.redeemVersion and witness mismatch");
       if (this.#o.output) {
-        const i = et(this.#o.output);
+        const i = rt(this.#o.output);
         if (!i || i.length === 0) throw new TypeError("Redeem.output is invalid");
         if (this.redeem.output && !x(this.#o.output, this.redeem.output)) throw new TypeError("Redeem.output and witness mismatch");
       }
@@ -5969,8 +5969,8 @@ var es = j, rs = 1, Fu = 80, Ho = class nr {
   #l;
   #d;
   #w;
-  #g;
   #y;
+  #g;
   #m;
   #E;
   #v;
@@ -6014,10 +6014,10 @@ var es = j, rs = 1, Fu = 80, Ho = class nr {
     return this.#A || (this.#w = this.#M(), this.#A = !0), this.#w;
   }
   get signature() {
-    return this.#T || (this.#g = this.#F(), this.#T = !0), this.#g;
+    return this.#T || (this.#y = this.#F(), this.#T = !0), this.#y;
   }
   get output() {
-    return this.#k || (this.#y = this.#W(), this.#k = !0), this.#y;
+    return this.#k || (this.#g = this.#W(), this.#k = !0), this.#g;
   }
   get redeem() {
     return this.#P || (this.#m = this.#G(), this.#P = !0), this.#m;
@@ -6101,8 +6101,8 @@ var es = j, rs = 1, Fu = 80, Ho = class nr {
     if (this.#e) return this.#e;
     const t = this.pubkey;
     if (!t) return;
-    const r = tt.bech32m.toWords(t);
-    return r.unshift(rs), tt.bech32m.encode(this.#t.bech32, r);
+    const r = et.bech32m.toWords(t);
+    return r.unshift(rs), et.bech32m.encode(this.#t.bech32, r);
   }
   #K() {
     if (this.#s) return this.#s;
@@ -6142,7 +6142,7 @@ var es = j, rs = 1, Fu = 80, Ho = class nr {
   #W() {
     if (this.#h) return this.#h;
     const t = this.pubkey;
-    if (t) return gt([es.OP_1, t]);
+    if (t) return yt([es.OP_1, t]);
   }
   #G() {
     if (this.#u) return this.#u;
@@ -6179,7 +6179,7 @@ var es = j, rs = 1, Fu = 80, Ho = class nr {
     if (this.#o) return [this.#o];
   }
   #q() {
-    let t = new Uint8Array(0);
+    let t = /* @__PURE__ */ new Uint8Array(0);
     if (this.#e) {
       const i = this.#L();
       if (!i) throw new TypeError("Invalid address");
@@ -6214,7 +6214,7 @@ var es = j, rs = 1, Fu = 80, Ho = class nr {
     if (this.#u && this.redeem) {
       if (this.#u.redeemVersion && this.#u.redeemVersion !== this.redeem.redeemVersion) throw new TypeError("Redeem.redeemVersion and witness mismatch");
       if (this.#u.output) {
-        const i = et(this.#u.output);
+        const i = rt(this.#u.output);
         if (!i || i.length === 0) throw new TypeError("Redeem.output is invalid");
         if (this.redeem.output && !x(this.#u.output, this.redeem.output)) throw new TypeError("Redeem.output and witness mismatch");
       }
@@ -6259,7 +6259,7 @@ function wr(e, t) {
   }, t);
   return Object.assign(r.toPayment(), e);
 }
-var ns = j, Wu = new Uint8Array(0), Lo = class ir {
+var ns = j, Wu = /* @__PURE__ */ new Uint8Array(0), Lo = class ir {
   static NAME = ft.P2WPKH;
   #t;
   #a;
@@ -6277,8 +6277,8 @@ var ns = j, Wu = new Uint8Array(0), Lo = class ir {
   #l;
   #d;
   #w = !1;
-  #g = !1;
   #y = !1;
+  #g = !1;
   #m = !1;
   #E = !1;
   #v = !1;
@@ -6301,10 +6301,10 @@ var ns = j, Wu = new Uint8Array(0), Lo = class ir {
     return this.#w || (this.#h = this.#T(), this.#w = !0), this.#h;
   }
   get hash() {
-    return this.#g || (this.#f = this.#k(), this.#g = !0), this.#f;
+    return this.#y || (this.#f = this.#k(), this.#y = !0), this.#f;
   }
   get pubkey() {
-    return this.#y || (this.#u = this.#P(), this.#y = !0), this.#u;
+    return this.#g || (this.#u = this.#P(), this.#g = !0), this.#u;
   }
   get signature() {
     return this.#m || (this.#c = this.#U(), this.#m = !0), this.#c;
@@ -6358,7 +6358,7 @@ var ns = j, Wu = new Uint8Array(0), Lo = class ir {
   #A() {
     if (!this.#S) {
       if (this.#e) {
-        const t = tt.bech32.decode(this.#e), r = t.words.shift(), n = tt.bech32.fromWords(t.words);
+        const t = et.bech32.decode(this.#e), r = t.words.shift(), n = et.bech32.fromWords(t.words);
         this.#b = {
           version: r ?? 0,
           prefix: t.prefix,
@@ -6373,8 +6373,8 @@ var ns = j, Wu = new Uint8Array(0), Lo = class ir {
     if (this.#e) return this.#e;
     const t = this.hash;
     if (!t) return;
-    const r = tt.bech32.toWords(t);
-    return r.unshift(0), tt.bech32.encode(this.#t.bech32, r);
+    const r = et.bech32.toWords(t);
+    return r.unshift(0), et.bech32.encode(this.#t.bech32, r);
   }
   #k() {
     if (this.#s) return this.#s;
@@ -6394,7 +6394,7 @@ var ns = j, Wu = new Uint8Array(0), Lo = class ir {
   #O() {
     if (this.#i) return this.#i;
     const t = this.hash;
-    if (t) return gt([ns.OP_0, t]);
+    if (t) return yt([ns.OP_0, t]);
   }
   #x() {
     if (this.witness) return Wu;
@@ -6404,7 +6404,7 @@ var ns = j, Wu = new Uint8Array(0), Lo = class ir {
     if (!(!this.#r || !this.#n)) return [this.#n, this.#r];
   }
   #_() {
-    let t = new Uint8Array(0);
+    let t = /* @__PURE__ */ new Uint8Array(0);
     if (this.#e) {
       const r = this.#A();
       if (!r) throw new TypeError("Invalid address");
@@ -6452,7 +6452,7 @@ function sn(e, t) {
   }, t);
   return Object.assign(r.toPayment(), e);
 }
-var is = j, mn = new Uint8Array(0);
+var is = j, mn = /* @__PURE__ */ new Uint8Array(0);
 function Sr(e) {
   return !!(e instanceof Uint8Array && e.length === 65 && e[0] === 4 && ke(e));
 }
@@ -6474,8 +6474,8 @@ var Co = class sr {
   #l = !1;
   #d = !1;
   #w = !1;
-  #g = !1;
   #y = !1;
+  #g = !1;
   #m = !1;
   #E;
   #v = !1;
@@ -6505,10 +6505,10 @@ var Co = class sr {
     return this.#w || (this.#f = this.#P(), this.#w = !0), this.#f;
   }
   get input() {
-    return this.#g || (this.#u = this.#U(), this.#g = !0), this.#u;
+    return this.#y || (this.#u = this.#U(), this.#y = !0), this.#u;
   }
   get redeem() {
-    return this.#y || (this.#c = this.#O(), this.#y = !0), this.#c;
+    return this.#g || (this.#c = this.#O(), this.#g = !0), this.#c;
   }
   get witness() {
     return this.#m || (this.#p = this.#x(), this.#m = !0), this.#p;
@@ -6553,7 +6553,7 @@ var Co = class sr {
   #S() {
     if (!this.#v) {
       if (this.#e) {
-        const t = tt.bech32.decode(this.#e), r = t.words.shift(), n = tt.bech32.fromWords(t.words);
+        const t = et.bech32.decode(this.#e), r = t.words.shift(), n = et.bech32.fromWords(t.words);
         this.#E = {
           version: r ?? 0,
           prefix: t.prefix,
@@ -6565,14 +6565,14 @@ var Co = class sr {
     return this.#E;
   }
   #A() {
-    return this.#b || (this.#n?.input && (this.#I = et(this.#n.input) ?? void 0), this.#b = !0), this.#I;
+    return this.#b || (this.#n?.input && (this.#I = rt(this.#n.input) ?? void 0), this.#b = !0), this.#I;
   }
   #T() {
     if (this.#e) return this.#e;
     const t = this.hash;
     if (!t) return;
-    const r = tt.bech32.toWords(t);
-    return r.unshift(0), tt.bech32.encode(this.#t.bech32, r);
+    const r = et.bech32.toWords(t);
+    return r.unshift(0), et.bech32.encode(this.#t.bech32, r);
   }
   #k() {
     if (this.#s) return this.#s;
@@ -6584,7 +6584,7 @@ var Co = class sr {
   #P() {
     if (this.#r) return this.#r;
     const t = this.hash;
-    if (t) return gt([is.OP_0, t]);
+    if (t) return yt([is.OP_0, t]);
   }
   #U() {
     if (this.witness) return mn;
@@ -6605,14 +6605,14 @@ var Co = class sr {
         const r = this.#A();
         if (r) {
           const n = Ds(r);
-          return this.#c = Object.assign({ witness: n }, t, { input: mn }), this.#y = !0, [].concat(n, t.output);
+          return this.#c = Object.assign({ witness: n }, t, { input: mn }), this.#g = !0, [].concat(n, t.output);
         }
       }
       return !t.output || !t.witness ? void 0 : [].concat(t.witness, t.output);
     }
   }
   #B() {
-    let t = new Uint8Array(0);
+    let t = /* @__PURE__ */ new Uint8Array(0);
     if (this.#e) {
       const r = this.#S();
       if (!r) throw new TypeError("Invalid address");
@@ -6635,7 +6635,7 @@ var Co = class sr {
       if (this.#n.network && this.#n.network !== this.#t) throw new TypeError("Network mismatch");
       if (this.#n.input && this.#n.input.length > 0 && this.#n.witness && this.#n.witness.length > 0) throw new TypeError("Ambiguous witness source");
       if (this.#n.output) {
-        const n = et(this.#n.output);
+        const n = rt(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 (Xn(n) > 201) throw new TypeError("Redeem.output unspendable with more than 201 non-push ops");
@@ -6646,16 +6646,16 @@ var Co = class sr {
       const r = this.#A();
       if (this.#n.input && r && !Jr(r)) throw new TypeError("Non push-only scriptSig");
       if (this.#i && this.#n.witness && !Ue(this.#i, this.#n.witness)) throw new TypeError("Witness and redeem.witness mismatch");
-      if (this.#n.input && r?.some(Sr) || this.#n.output && (et(this.#n.output) || []).some(Sr)) throw new TypeError("redeem.input or redeem.output contains uncompressed pubkey");
+      if (this.#n.input && r?.some(Sr) || this.#n.output && (rt(this.#n.output) || []).some(Sr)) throw new TypeError("redeem.input or redeem.output contains uncompressed pubkey");
     }
     if (this.#i && this.#i.length > 0) {
       const r = this.#i[this.#i.length - 1];
       if (this.#n && this.#n.output && !x(this.#n.output, r)) throw new TypeError("Witness and redeem.output mismatch");
-      if (this.#i.some(Sr) || (et(r) || []).some(Sr)) throw new TypeError("Witness contains uncompressed pubkey");
+      if (this.#i.some(Sr) || (rt(r) || []).some(Sr)) throw new TypeError("Witness contains uncompressed pubkey");
     }
   }
 };
-function gr(e, t) {
+function yr(e, t) {
   if (!e.address && !e.hash && !e.output && !e.redeem && !e.witness) throw new TypeError("Not enough data");
   return new Co({
     address: e.address,
@@ -6697,10 +6697,10 @@ var ss = j, Vo = class Br {
     return this.#t;
   }
   get pubkey() {
-    return this.#c || (this.#i = this.#g(), this.#c = !0), this.#i;
+    return this.#c || (this.#i = this.#y(), this.#c = !0), this.#i;
   }
   get signature() {
-    return this.#p || (this.#o = this.#y(), this.#p = !0), this.#o;
+    return this.#p || (this.#o = this.#g(), this.#p = !0), this.#o;
   }
   get output() {
     return this.#l || (this.#h = this.#m(), this.#l = !0), this.#h;
@@ -6741,26 +6741,26 @@ var ss = j, Vo = class Br {
       witness: this.witness
     };
   }
-  #g() {
+  #y() {
     if (this.#e) return this.#e;
     if (this.#r) return this.#r.subarray(1, -1);
   }
-  #y() {
+  #g() {
     if (this.#s) return this.#s;
     if (this.#n) {
-      const t = et(this.#n);
+      const t = rt(this.#n);
       if (t && t.length > 0) return t[0];
     }
   }
   #m() {
     if (this.#r) return this.#r;
     const t = this.#e;
-    if (t) return gt([t, ss.OP_CHECKSIG]);
+    if (t) return yt([t, ss.OP_CHECKSIG]);
   }
   #E() {
     if (this.#n) return this.#n;
     const t = this.#s;
-    if (t) return gt([t]);
+    if (t) return yt([t]);
   }
   #v() {
     if (this.input) return [];
@@ -6777,7 +6777,7 @@ var ss = j, Vo = class Br {
       if (this.#n && t && !x(this.#n, t)) throw new TypeError("Signature mismatch");
     }
     if (this.#n) {
-      const t = et(this.#n);
+      const t = rt(this.#n);
       if (!t || t.length !== 1) throw new TypeError("Input is invalid");
       const r = this.signature;
       if (!r || !xe(r)) throw new TypeError("Input has invalid signature");
@@ -6813,8 +6813,8 @@ var He = j, Tr = He.OP_RESERVED, $o = class _r {
   #l;
   #d;
   #w = !1;
-  #g = !1;
   #y = !1;
+  #g = !1;
   #m = !1;
   #E = !1;
   #v = !1;
@@ -6838,10 +6838,10 @@ var He = j, Tr = He.OP_RESERVED, $o = class _r {
     return this.#w || (this.#h = this.#T(), this.#w = !0), this.#h;
   }
   get n() {
-    return this.#g || (this.#f = this.#k(), this.#g = !0), this.#f;
+    return this.#y || (this.#f = this.#k(), this.#y = !0), this.#f;
   }
   get pubkeys() {
-    return this.#y || (this.#u = this.#P(), this.#y = !0), this.#u;
+    return this.#g || (this.#u = this.#P(), this.#g = !0), this.#u;
   }
   get signatures() {
     return this.#m || (this.#c = this.#U(), this.#m = !0), this.#c;
@@ -6890,7 +6890,7 @@ var He = j, Tr = He.OP_RESERVED, $o = class _r {
     };
   }
   #A(t) {
-    this.#S || (this.#S = !0, this.#b = et(t) ?? [], this.#h = this.#b[0] - Tr, this.#f = this.#b[this.#b.length - 2] - Tr, this.#u = this.#b.slice(1, -2), this.#w = !0, this.#g = !0, this.#y = !0);
+    this.#S || (this.#S = !0, this.#b = rt(t) ?? [], this.#h = this.#b[0] - Tr, this.#f = this.#b[this.#b.length - 2] - Tr, this.#u = this.#b.slice(1, -2), this.#w = !0, this.#y = !0, this.#g = !0);
   }
   #T() {
     if (this.#e !== void 0) return this.#e;
@@ -6908,16 +6908,16 @@ var He = j, Tr = He.OP_RESERVED, $o = class _r {
   }
   #U() {
     if (this.#n) return this.#n;
-    if (this.#o) return et(this.#o)?.slice(1);
+    if (this.#o) return rt(this.#o)?.slice(1);
   }
   #O() {
     if (this.#i) return this.#i;
     const t = this.#e, r = this.n, n = this.#r;
-    if (!(t === void 0 || r === void 0 || !n)) return gt([].concat(Tr + t, n, Tr + r, He.OP_CHECKMULTISIG));
+    if (!(t === void 0 || r === void 0 || !n)) return yt([].concat(Tr + t, n, Tr + r, He.OP_CHECKMULTISIG));
   }
   #x() {
     if (this.#o) return this.#o;
-    if (this.#n) return gt([He.OP_0].concat(this.#n));
+    if (this.#n) return yt([He.OP_0].concat(this.#n));
   }
   #B() {
     if (this.input) return [];
@@ -6943,7 +6943,7 @@ var He = j, Tr = He.OP_RESERVED, $o = class _r {
     }
     if (this.#r) {
       if (this.#s !== void 0 && this.#s !== this.#r.length) throw new TypeError("Pubkey count mismatch");
-      if (this.#f = this.#r.length, this.#g = !0, this.#h !== void 0 && this.#f < this.#h) throw new TypeError("Pubkey count cannot be less than m");
+      if (this.#f = this.#r.length, this.#y = !0, this.#h !== void 0 && this.#f < this.#h) throw new TypeError("Pubkey count cannot be less than m");
     }
     if (this.#n) {
       if (this.#h !== void 0 && this.#n.length < this.#h) throw new TypeError("Not enough signatures provided");
@@ -6958,7 +6958,7 @@ var He = j, Tr = He.OP_RESERVED, $o = class _r {
     }
   }
 };
-function yr(e, t) {
+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 $o({
     m: e.m,
@@ -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), os = [], kr = Mt("0000000000000000000000000000000000000000000000000000000000000000"), as = Or(Mt("0000000000000000000000000000000000000000000000000000000000000001")), ju = 18446744073709551615n, J = class Q {
+var ce = /* @__PURE__ */ new Uint8Array(0), os = [], kr = Mt("0000000000000000000000000000000000000000000000000000000000000000"), as = Or(Mt("0000000000000000000000000000000000000000000000000000000000000001")), ju = 18446744073709551615n, tt = class J {
   static DEFAULT_SEQUENCE = 4294967295;
   static SIGHASH_DEFAULT = 0;
   static SIGHASH_ALL = 1;
@@ -6998,18 +6998,18 @@ var ce = new Uint8Array(0), os = [], kr = Mt("0000000000000000000000000000000000
   ins = [];
   outs = [];
   static fromBuffer(t, r) {
-    const n = new _a(t), i = new Q();
+    const n = new _a(t), i = new J();
     i.version = n.readInt32LE();
     const o = n.readUInt8(), a = n.readUInt8();
     let f = !1;
-    o === Q.ADVANCED_TRANSACTION_MARKER && a === Q.ADVANCED_TRANSACTION_FLAG ? f = !0 : n.offset -= 2;
+    o === J.ADVANCED_TRANSACTION_MARKER && a === J.ADVANCED_TRANSACTION_FLAG ? f = !0 : n.offset -= 2;
     const l = n.readVarInt();
     for (let u = 0; u < l; ++u) {
-      const d = n.readBytes(32), w = n.readUInt32LE(), b = n.readVarBytes(), m = n.readUInt32LE();
+      const d = n.readBytes(32), w = n.readUInt32LE(), g = n.readVarBytes(), m = n.readUInt32LE();
       i.ins.push({
         hash: d,
         index: w,
-        script: b,
+        script: g,
         sequence: m,
         witness: os
       });
@@ -7028,7 +7028,7 @@ var ce = new Uint8Array(0), os = [], kr = Mt("0000000000000000000000000000000000
     return i;
   }
   static fromHex(t) {
-    return Q.fromBuffer(Mt(t), !1);
+    return J.fromBuffer(Mt(t), !1);
   }
   static isCoinbaseHash(t) {
     if (t.length !== 32) throw new TypeError("Expected 32-byte hash");
@@ -7037,13 +7037,13 @@ var ce = new Uint8Array(0), os = [], kr = Mt("0000000000000000000000000000000000
   }
   isCoinbase() {
     const t = this.ins[0];
-    return this.ins.length === 1 && t !== void 0 && Q.isCoinbaseHash(t.hash);
+    return this.ins.length === 1 && t !== void 0 && J.isCoinbaseHash(t.hash);
   }
   addInput(t, r, n, i) {
     if (t.length !== 32) throw new TypeError("Expected 32-byte hash");
     if (!Number.isInteger(r) || r < 0 || r > 4294967295) throw new TypeError("Expected unsigned 32-bit integer for index");
     if (n != null && (!Number.isInteger(n) || n < 0 || n > 4294967295)) throw new TypeError("Expected unsigned 32-bit integer for sequence");
-    return n ??= Q.DEFAULT_SEQUENCE, this.ins.push({
+    return n ??= J.DEFAULT_SEQUENCE, this.ins.push({
       hash: t,
       index: r,
       script: i || ce,
@@ -7074,7 +7074,7 @@ var ce = new Uint8Array(0), os = [], kr = Mt("0000000000000000000000000000000000
     return (r ? 10 : 8) + Ct(this.ins.length) + Ct(this.outs.length) + this.ins.reduce((n, i) => n + 40 + Nt(i.script), 0) + this.outs.reduce((n, i) => n + 8 + Nt(i.script), 0) + (r ? this.ins.reduce((n, i) => n + Gu(i.witness), 0) : 0);
   }
   clone() {
-    const t = new Q();
+    const t = new J();
     return t.version = this.version, t.locktime = this.locktime, t.ins = this.ins.map((r) => ({
       hash: r.hash,
       index: r.index,
@@ -7091,13 +7091,13 @@ var ce = new Uint8Array(0), os = [], kr = Mt("0000000000000000000000000000000000
     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 as;
-    const i = et(r);
+    const i = rt(r);
     if (!i) throw new Error("Could not decompile prevOutScript");
-    const o = gt(i.filter((l) => l !== j.OP_CODESEPARATOR)), a = this.clone();
-    if ((n & 31) === Q.SIGHASH_NONE) a.outs = [], a.ins.forEach((l, p) => {
+    const o = yt(i.filter((l) => l !== j.OP_CODESEPARATOR)), a = this.clone();
+    if ((n & 31) === J.SIGHASH_NONE) a.outs = [], a.ins.forEach((l, p) => {
       p !== t && (l.sequence = 0);
     });
-    else if ((n & 31) === Q.SIGHASH_SINGLE) {
+    else if ((n & 31) === J.SIGHASH_SINGLE) {
       if (t >= this.outs.length) return as;
       a.outs.length = t + 1;
       for (let l = 0; l < t; l++) a.outs[l] = {
@@ -7108,7 +7108,7 @@ var ce = new Uint8Array(0), os = [], kr = Mt("0000000000000000000000000000000000
         p !== t && (l.sequence = 0);
       });
     }
-    n & Q.SIGHASH_ANYONECANPAY ? (a.ins = [a.ins[t]], a.ins[0].script = o) : (a.ins.forEach((l) => {
+    n & J.SIGHASH_ANYONECANPAY ? (a.ins = [a.ins[t]], a.ins[0].script = o) : (a.ins.forEach((l) => {
       l.script = ce;
     }), a.ins[t].script = o);
     const f = Et(a.byteLength(!1) + 4);
@@ -7116,40 +7116,40 @@ var ce = new Uint8Array(0), os = [], kr = Mt("0000000000000000000000000000000000
   }
   hashForWitnessV1(t, r, n, i, o, a, f) {
     if (!Number.isInteger(t) || t < 0 || t > 4294967295) throw new TypeError("Expected unsigned 32-bit integer for inIndex");
-    if (!Array.isArray(r) || !r.every((D) => D instanceof Uint8Array)) throw new TypeError("Expected array of Uint8Array for prevOutScripts");
-    if (!Array.isArray(n) || !n.every((D) => typeof D == "bigint")) throw new TypeError("Expected array of bigint for values");
+    if (!Array.isArray(r) || !r.every((M) => M instanceof Uint8Array)) throw new TypeError("Expected array of Uint8Array for prevOutScripts");
+    if (!Array.isArray(n) || !n.every((M) => typeof M == "bigint")) throw new TypeError("Expected array of bigint for values");
     if (!Number.isInteger(i) || i < 0 || i > 4294967295) throw new TypeError("Expected unsigned 32-bit integer for hashType");
     if (n.length !== this.ins.length || r.length !== this.ins.length) throw new Error("Must supply prevout script and value for all inputs");
-    const l = i === Q.SIGHASH_DEFAULT ? Q.SIGHASH_ALL : i & Q.SIGHASH_OUTPUT_MASK, p = (i & Q.SIGHASH_INPUT_MASK) === Q.SIGHASH_ANYONECANPAY, u = l === Q.SIGHASH_NONE, d = l === Q.SIGHASH_SINGLE;
-    let w = ce, b = ce, m = ce, v = ce, I = ce;
-    if (!p) if (f) w = f.hashPrevouts, b = f.hashAmounts, m = f.hashScriptPubKeys, v = f.hashSequences;
+    const l = i === J.SIGHASH_DEFAULT ? J.SIGHASH_ALL : i & J.SIGHASH_OUTPUT_MASK, p = (i & J.SIGHASH_INPUT_MASK) === J.SIGHASH_ANYONECANPAY, u = l === J.SIGHASH_NONE, d = l === J.SIGHASH_SINGLE;
+    let w = ce, g = ce, m = ce, v = ce, I = ce;
+    if (!p) if (f) w = f.hashPrevouts, g = f.hashAmounts, m = f.hashScriptPubKeys, v = f.hashSequences;
     else {
-      let D = new dt(36 * this.ins.length);
-      this.ins.forEach((X) => {
-        D.writeBytes(X.hash), D.writeUInt32LE(X.index);
-      }), w = It(D.finish()), D = new dt(8 * this.ins.length), n.forEach((X) => D.writeUInt64LE(X)), b = It(D.finish()), D = new dt(r.map(Nt).reduce((X, at) => X + at)), r.forEach((X) => D.writeVarBytes(X)), m = It(D.finish()), D = new dt(4 * this.ins.length), this.ins.forEach((X) => D.writeUInt32LE(X.sequence)), v = It(D.finish());
+      let M = new dt(36 * this.ins.length);
+      this.ins.forEach((Z) => {
+        M.writeBytes(Z.hash), M.writeUInt32LE(Z.index);
+      }), w = It(M.finish()), M = new dt(8 * this.ins.length), n.forEach((Z) => M.writeUInt64LE(Z)), g = It(M.finish()), M = new dt(r.map(Nt).reduce((Z, Q) => Z + Q)), r.forEach((Z) => M.writeVarBytes(Z)), m = It(M.finish()), M = new dt(4 * this.ins.length), this.ins.forEach((Z) => M.writeUInt32LE(Z.sequence)), v = It(M.finish());
     }
     if (u || d) {
       if (d && t < this.outs.length) {
-        const D = this.outs[t], X = new dt(8 + Nt(D.script));
-        X.writeUInt64LE(D.value), X.writeVarBytes(D.script), I = It(X.finish());
+        const M = this.outs[t], Z = new dt(8 + Nt(M.script));
+        Z.writeUInt64LE(M.value), Z.writeVarBytes(M.script), I = It(Z.finish());
       }
     } else if (f) I = f.hashOutputs;
     else {
       if (!this.outs.length) throw new Error("Add outputs to the transaction before signing.");
-      const D = new dt(this.outs.map((X) => 8 + Nt(X.script)).reduce((X, at) => X + at));
-      this.outs.forEach((X) => {
-        D.writeUInt64LE(X.value), D.writeVarBytes(X.script);
-      }), I = It(D.finish());
+      const M = this.outs.map((Q) => 8 + Nt(Q.script)).reduce((Q, q) => Q + q), Z = new dt(M);
+      this.outs.forEach((Q) => {
+        Z.writeUInt64LE(Q.value), Z.writeVarBytes(Q.script);
+      }), I = It(Z.finish());
     }
     const P = (o ? 2 : 0) + (a ? 1 : 0), S = new dt(174 - (p ? 49 : 0) - (u ? 32 : 0) + (a ? 32 : 0) + (o ? 37 : 0));
-    if (S.writeUInt8(i), S.writeInt32LE(this.version), S.writeUInt32LE(this.locktime), S.writeBytes(w), S.writeBytes(b), S.writeBytes(m), S.writeBytes(v), u || d || S.writeBytes(I), S.writeUInt8(P), p) {
-      const D = this.ins[t];
-      S.writeBytes(D.hash), S.writeUInt32LE(D.index), S.writeUInt64LE(n[t]), S.writeVarBytes(r[t]), S.writeUInt32LE(D.sequence);
+    if (S.writeUInt8(i), S.writeInt32LE(this.version), S.writeUInt32LE(this.locktime), S.writeBytes(w), S.writeBytes(g), S.writeBytes(m), S.writeBytes(v), u || d || S.writeBytes(I), S.writeUInt8(P), p) {
+      const M = this.ins[t];
+      S.writeBytes(M.hash), S.writeUInt32LE(M.index), S.writeUInt64LE(n[t]), S.writeVarBytes(r[t]), S.writeUInt32LE(M.sequence);
     } else S.writeUInt32LE(t);
     if (a) {
-      const D = new dt(Nt(a));
-      D.writeVarBytes(a), S.writeBytes(It(D.finish()));
+      const M = new dt(Nt(a));
+      M.writeVarBytes(a), S.writeBytes(It(M.finish()));
     }
     d && S.writeBytes(I), o && (S.writeBytes(o), S.writeUInt8(0), S.writeUInt32LE(4294967295));
     const _ = new Uint8Array([0]), O = S.finish(), z = new Uint8Array(1 + O.length);
@@ -7188,14 +7188,14 @@ var ce = new Uint8Array(0), os = [], kr = Mt("0000000000000000000000000000000000
     if (typeof n != "bigint") throw new TypeError("Expected bigint for value");
     if (!Number.isInteger(i) || i < 0 || i > 4294967295) throw new TypeError("Expected unsigned 32-bit integer for hashType");
     let o, a, f = kr, l = kr, p = kr;
-    if (i & Q.SIGHASH_ANYONECANPAY || (o = Et(36 * this.ins.length), a = new dt(o, 0), this.ins.forEach((d) => {
+    if (i & J.SIGHASH_ANYONECANPAY || (o = Et(36 * this.ins.length), a = new dt(o, 0), this.ins.forEach((d) => {
       a.writeBytes(d.hash), a.writeUInt32LE(d.index);
-    }), l = le(o)), !(i & Q.SIGHASH_ANYONECANPAY) && (i & 31) !== Q.SIGHASH_SINGLE && (i & 31) !== Q.SIGHASH_NONE && (o = Et(4 * this.ins.length), a = new dt(o, 0), this.ins.forEach((d) => {
+    }), l = le(o)), !(i & J.SIGHASH_ANYONECANPAY) && (i & 31) !== J.SIGHASH_SINGLE && (i & 31) !== J.SIGHASH_NONE && (o = Et(4 * this.ins.length), a = new dt(o, 0), this.ins.forEach((d) => {
       a.writeUInt32LE(d.sequence);
-    }), p = le(o)), (i & 31) !== Q.SIGHASH_SINGLE && (i & 31) !== Q.SIGHASH_NONE) o = Et(this.outs.reduce((d, w) => d + 8 + Nt(w.script), 0)), a = new dt(o, 0), this.outs.forEach((d) => {
+    }), p = le(o)), (i & 31) !== J.SIGHASH_SINGLE && (i & 31) !== J.SIGHASH_NONE) o = Et(this.outs.reduce((d, w) => d + 8 + Nt(w.script), 0)), a = new dt(o, 0), this.outs.forEach((d) => {
       a.writeUInt64LE(d.value), a.writeVarBytes(d.script);
     }), f = le(o);
-    else if ((i & 31) === Q.SIGHASH_SINGLE && t < this.outs.length) {
+    else if ((i & 31) === J.SIGHASH_SINGLE && t < this.outs.length) {
       const d = this.outs[t];
       o = Et(8 + Nt(d.script)), a = new dt(o, 0), a.writeUInt64LE(d.value), a.writeVarBytes(d.script), f = le(o);
     }
@@ -7204,7 +7204,7 @@ var ce = new Uint8Array(0), os = [], kr = Mt("0000000000000000000000000000000000
     return a.writeInt32LE(this.version), a.writeBytes(l), a.writeBytes(p), a.writeBytes(u.hash), a.writeUInt32LE(u.index), a.writeVarBytes(r), a.writeUInt64LE(n), a.writeUInt32LE(u.sequence), a.writeBytes(f), a.writeUInt32LE(this.locktime), a.writeUInt32LE(i), Or(le(o));
   }
   getHash(t) {
-    return t && this.isCoinbase() ? new Uint8Array(32) : le(this.#t(void 0, void 0, t));
+    return t && this.isCoinbase() ? /* @__PURE__ */ new Uint8Array(32) : le(this.#t(void 0, void 0, t));
   }
   getId() {
     return Yt(zn(this.getHash(!1)));
@@ -7230,7 +7230,7 @@ var ce = new Uint8Array(0), os = [], kr = Mt("0000000000000000000000000000000000
     const i = new dt(t, r || 0);
     i.writeInt32LE(this.version);
     const o = n && this.hasWitnesses();
-    return o && (i.writeUInt8(Q.ADVANCED_TRANSACTION_MARKER), i.writeUInt8(Q.ADVANCED_TRANSACTION_FLAG)), i.writeVarInt(this.ins.length), this.ins.forEach((a) => {
+    return o && (i.writeUInt8(J.ADVANCED_TRANSACTION_MARKER), i.writeUInt8(J.ADVANCED_TRANSACTION_FLAG)), i.writeVarInt(this.ins.length), this.ins.forEach((a) => {
       i.writeBytes(a.hash), i.writeUInt32LE(a.index), i.writeVarBytes(a.script), i.writeUInt32LE(a.sequence);
     }), i.writeVarInt(this.outs.length), this.outs.forEach((a) => {
       i.writeUInt64LE(a.value), i.writeVarBytes(a.script);
@@ -7240,7 +7240,7 @@ var ce = new Uint8Array(0), os = [], kr = Mt("0000000000000000000000000000000000
   }
 }, zu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  Transaction: J
+  Transaction: tt
 }, Symbol.toStringTag, { value: "Module" }));
 function ne(e) {
   return (t) => {
@@ -7251,7 +7251,7 @@ function ne(e) {
     }
   };
 }
-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;
+var qu = ne(gr), Yu = ne(hi), Xu = ne(pr), on = ne(sn), hs = ne(yr), 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) {
@@ -7259,7 +7259,7 @@ function or(e) {
   }
   function n(a) {
     const f = Et(Ct(a));
-    ge(a, f, 0), t.push(f);
+    ye(a, f, 0), t.push(f);
   }
   function i(a) {
     n(a.length), r(a);
@@ -7270,7 +7270,7 @@ function or(e) {
   return o(e), Bt(t);
 }
 function Do(e, t) {
-  const r = et(t);
+  const r = rt(t);
   if (r === null) throw new Error("Unknown script error");
   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))));
@@ -7283,11 +7283,11 @@ function Zu(e, t) {
 }
 function Mo(e, t, r) {
   const { hashType: n } = t(e), i = [];
-  switch (n & J.SIGHASH_ANYONECANPAY && i.push("addInput"), n & 31) {
-    case J.SIGHASH_ALL:
+  switch (n & tt.SIGHASH_ANYONECANPAY && i.push("addInput"), n & 31) {
+    case tt.SIGHASH_ALL:
       break;
-    case J.SIGHASH_SINGLE:
-    case J.SIGHASH_NONE:
+    case tt.SIGHASH_SINGLE:
+    case tt.SIGHASH_NONE:
       i.push("addOutput"), i.push("setInputSequence");
       break;
   }
@@ -7303,7 +7303,7 @@ function Qu(e) {
   return r.map((n) => new Uint8Array(n.signature));
 }
 function Ju(e) {
-  const t = e.finalScriptSig ? et(new Uint8Array(e.finalScriptSig)) || [] : [], r = e.finalScriptWitness ? et(new Uint8Array(e.finalScriptWitness)) || [] : [];
+  const t = e.finalScriptSig ? rt(new Uint8Array(e.finalScriptSig)) || [] : [], r = e.finalScriptWitness ? rt(new Uint8Array(e.finalScriptWitness)) || [] : [];
   return t.concat(r).filter((n) => n instanceof Uint8Array && xe(n)).map((n) => ({ signature: n }));
 }
 function us(e, t, r) {
@@ -7315,7 +7315,7 @@ function us(e, t, r) {
   }
 }
 function Le(e, t) {
-  return Bt([e, t ? new Uint8Array([t]) : new Uint8Array(0)]);
+  return Bt([e, t ? new Uint8Array([t]) : /* @__PURE__ */ new Uint8Array(0)]);
 }
 function Lt(e) {
   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))));
@@ -7361,7 +7361,7 @@ function nf(e, t) {
 function sf(e) {
   return {
     signature: e.subarray(0, 64),
-    hashType: e.subarray(64)[0] || J.SIGHASH_DEFAULT
+    hashType: e.subarray(64)[0] || tt.SIGHASH_DEFAULT
   };
 }
 function of(e) {
@@ -7453,10 +7453,10 @@ var Fo = {
   ECDSA: 0,
   Schnorr: 1
 };
-function gf(e) {
+function yf(e) {
   return e.type === "batchResult";
 }
-function yf(e) {
+function gf(e) {
   return e.type === "ready";
 }
 var At = {
@@ -7852,19 +7852,19 @@ var If = {
         const d = f[u];
         if (d.status === "fulfilled") {
           const w = d.value;
-          for (const b of w.results) l.set(b.inputIndex, {
+          for (const g of w.results) l.set(g.inputIndex, {
             type: "result",
-            taskId: b.taskId,
-            signature: b.signature,
-            inputIndex: b.inputIndex,
-            publicKey: b.publicKey,
-            signatureType: b.signatureType,
-            leafHash: b.leafHash
+            taskId: g.taskId,
+            signature: g.signature,
+            inputIndex: g.inputIndex,
+            publicKey: g.publicKey,
+            signatureType: g.signatureType,
+            leafHash: g.leafHash
           });
-          for (const b of w.errors) p.set(b.inputIndex, b.error);
+          for (const g of w.errors) p.set(g.inputIndex, g.error);
         } else {
-          const w = d.reason?.message ?? "Batch signing failed", b = o[u];
-          for (const m of b) p.set(m.inputIndex, w);
+          const w = d.reason?.message ?? "Batch signing failed", g = o[u];
+          for (const m of g) p.set(m.inputIndex, w);
         }
       }
       return this.#n || await this.#w(), {
@@ -7902,7 +7902,7 @@ var If = {
       const a = setTimeout(() => {
         o(/* @__PURE__ */ new Error(`Worker ${t} initialization timeout`));
       }, 1e4), f = (l) => {
-        yf(l.data) && (clearTimeout(a), r.removeEventListener("message", f), n.state = At.Idle, i());
+        gf(l.data) && (clearTimeout(a), r.removeEventListener("message", f), n.state = At.Idle, i());
       };
       r.addEventListener("message", f), r.addEventListener("error", (l) => {
         clearTimeout(a), o(/* @__PURE__ */ new Error(`Worker ${t} error: ${l.message}`));
@@ -7920,33 +7920,33 @@ var If = {
     };
     const o = this.#e[i] ?? await this.#p(), a = `batch-${this.#o++}`;
     return new Promise((f, l) => {
-      const p = {
+      const p = setTimeout(() => {
+        this.#s.delete(a), o.state = At.Idle, o.currentTaskId = null, o.taskStartTime = null, this.#d(o).catch(() => {
+        }), this.#u().catch(() => {
+        }), l(/* @__PURE__ */ new Error(`Batch signing timeout for ${t.length} tasks`));
+      }, this.#a.maxKeyHoldTimeMs), u = {
         batchId: a,
         resolve: f,
         reject: l,
-        timeoutId: setTimeout(() => {
-          this.#s.delete(a), o.state = At.Idle, o.currentTaskId = null, o.taskStartTime = null, this.#d(o).catch(() => {
-          }), this.#u().catch(() => {
-          }), l(/* @__PURE__ */ new Error(`Batch signing timeout for ${t.length} tasks`));
-        }, this.#a.maxKeyHoldTimeMs)
+        timeoutId: p
       };
-      this.#s.set(a, p), o.state = At.Busy, o.currentTaskId = a, o.taskStartTime = Date.now();
-      const u = {
+      this.#s.set(a, u), o.state = At.Busy, o.currentTaskId = a, o.taskStartTime = Date.now();
+      const d = t.map((g) => ({
+        taskId: g.taskId,
+        hash: g.hash,
+        publicKey: n,
+        signatureType: g.signatureType,
+        lowR: g.lowR,
+        inputIndex: g.inputIndex,
+        sighashType: g.sighashType,
+        leafHash: g.leafHash
+      })), w = {
         type: "signBatch",
         batchId: a,
-        tasks: t.map((d) => ({
-          taskId: d.taskId,
-          hash: d.hash,
-          publicKey: n,
-          signatureType: d.signatureType,
-          lowR: d.lowR,
-          inputIndex: d.inputIndex,
-          sighashType: d.sighashType,
-          leafHash: d.leafHash
-        })),
+        tasks: d,
         privateKey: r
       };
-      o.worker.postMessage(u);
+      o.worker.postMessage(w);
     });
   }
   async #p() {
@@ -7959,7 +7959,7 @@ var If = {
     });
   }
   #l(t, r) {
-    if (gf(r)) {
+    if (yf(r)) {
       const n = this.#s.get(r.batchId);
       n && (clearTimeout(n.timeoutId), this.#s.delete(r.batchId), t.state = At.Idle, t.currentTaskId = null, t.taskStartTime = null, n.resolve(r));
     }
@@ -8005,7 +8005,7 @@ function Af(e, t, r, n, i) {
       inputIndex: t,
       hash: f,
       signatureType: Fo.Schnorr,
-      sighashType: r.sighashType ?? J.SIGHASH_DEFAULT,
+      sighashType: r.sighashType ?? tt.SIGHASH_DEFAULT,
       leafHash: l
     });
   } catch {
@@ -8014,8 +8014,8 @@ function Af(e, t, r, n, i) {
 }
 function Sf(e, t, r, n, i) {
   try {
-    const o = r.sighashType ?? J.SIGHASH_ALL;
-    return (i.sighashTypes ?? [J.SIGHASH_ALL]).includes(o), null;
+    const o = r.sighashType ?? tt.SIGHASH_ALL;
+    return (i.sighashTypes ?? [tt.SIGHASH_ALL]).includes(o), null;
   } catch {
     return null;
   }
@@ -8036,7 +8036,7 @@ function Yl(e, t, r) {
       e.data.updateInput(i, { tapKeySig: f });
     }
     else {
-      const f = Ae.encode(o.signature, a.sighashType ?? J.SIGHASH_ALL), l = [{
+      const f = Ae.encode(o.signature, a.sighashType ?? tt.SIGHASH_ALL), l = [{
         pubkey: Uint8Array.from(n),
         signature: f
       }];
@@ -8076,8 +8076,8 @@ function Go(e, t) {
   if (f.length < 2 || f.length > 40) throw new TypeError("Invalid program length for segwit address");
   const l = r === j.OP_0 ? 0 : r !== void 0 && r >= j.OP_1 && r <= j.OP_16 ? r - (j.OP_1 - 1) : -1;
   if (l < 15 || l > 16) throw new TypeError(`Invalid segwit version ${l}`);
-  const p = [l, ...tt.bech32m.toWords(f)];
-  return tt.bech32m.encode(t.bech32Opnet, p);
+  const p = [l, ...et.bech32m.toWords(f)];
+  return et.bech32m.encode(t.bech32Opnet, p);
 }
 function jo(e, t) {
   const r = e.subarray(2);
@@ -8105,8 +8105,8 @@ function Vn(e, t) {
   return r[0] = t, r.set(e, 1), Gn(r);
 }
 function Wr(e, t, r, n) {
-  const i = tt.bech32.toWords(e);
-  return i.unshift(t), t === 16 && n ? tt.bech32m.encode(n, i) : t === 0 ? tt.bech32.encode(r, i) : tt.bech32m.encode(r, i);
+  const i = et.bech32.toWords(e);
+  return i.unshift(t), t === 16 && n ? et.bech32m.encode(n, i) : t === 0 ? et.bech32.encode(r, i) : et.bech32m.encode(r, i);
 }
 function qo(e, t) {
   t = t || kt;
@@ -8116,12 +8116,12 @@ function qo(e, t) {
   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) {
-    const n = tt.bech32m.toWords(e.subarray(2, 34));
-    return n.unshift(1), tt.bech32m.encode(t.bech32, n);
+    const n = et.bech32m.toWords(e.subarray(2, 34));
+    return n.unshift(1), et.bech32m.encode(t.bech32, n);
   }
   if (r === 34 && e[0] === 82 && e[1] === 32) {
-    const n = tt.bech32m.toWords(e.subarray(2, 34));
-    return n.unshift(2), tt.bech32m.encode(t.bech32, n);
+    const n = et.bech32m.toWords(e.subarray(2, 34));
+    return n.unshift(2), et.bech32m.encode(t.bech32, n);
   }
   try {
     return Go(e, t);
@@ -8153,7 +8153,7 @@ 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: Si(o.data) }).output;
+        if (o.data.length === 32) return yr({ hash: Si(o.data) }).output;
       } else if (o.version === 1) {
         if (o.data.length === 32) return wr({ pubkey: o.data }).output;
       } else {
@@ -8164,7 +8164,7 @@ function Yo(e, t) {
             program: o.data,
             network: r
           }).output;
-        } else if (o.version >= 2 && o.version <= 15 && o.data.length >= 2 && o.data.length <= 40) return o.version !== 16 && n && n(kf), gt([o.version + 80, o.data]);
+        } else if (o.version >= 2 && o.version <= 15 && o.data.length >= 2 && o.data.length <= 40) return o.version !== 16 && n && n(kf), yt([o.version + 80, o.data]);
       }
     }
   }
@@ -8238,15 +8238,15 @@ var Uf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   }
   #h() {
     if (this.#e) return this.#e;
-    if (this.#s) return et(this.#s)?.slice(1);
+    if (this.#s) return rt(this.#s)?.slice(1);
   }
   #f() {
     if (this.#s) return this.#s;
-    if (this.#e) return gt([ls.OP_RETURN].concat(this.#e));
+    if (this.#e) return yt([ls.OP_RETURN].concat(this.#e));
   }
   #u() {
     if (this.#s) {
-      const t = et(this.#s);
+      const t = rt(this.#s);
       if (!t) 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");
@@ -8281,22 +8281,21 @@ var Pf = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   findScriptPath: Pe,
   p2data: Of,
   p2mr: ai,
-  p2ms: yr,
+  p2ms: gr,
   p2op: Qn,
   p2pk: hi,
   p2pkh: pr,
   p2sh: dr,
   p2tr: wr,
   p2wpkh: sn,
-  p2wsh: gr,
+  p2wsh: yr,
   rootHashFromPath: Mr,
   rootHashFromPathP2MR: hr,
   tapBranchHash: Fe,
   tapleafHash: Pt,
   toHashTree: ur,
   tweakKey: er
-}, Symbol.toStringTag, { value: "Module" }));
-var Xl = Mt("6a24aa21a9ed"), qt;
+}, Symbol.toStringTag, { value: "Module" })), Xl = Mt("6a24aa21a9ed"), qt;
 (function(e) {
   e[e.UNSIGNED_TX = 0] = "UNSIGNED_TX", e[e.GLOBAL_XPUB = 1] = "GLOBAL_XPUB";
 })(qt || (qt = {}));
@@ -8325,7 +8324,7 @@ function Xt(e) {
   return r;
 }
 function G(e) {
-  const t = e || new Uint8Array();
+  const t = e || /* @__PURE__ */ new Uint8Array();
   return t.length > 512 ? Rf(t) : _f(t);
 }
 function _f(e) {
@@ -8550,22 +8549,22 @@ function wc(e) {
     2,
     3,
     4
-  ].includes(e.pubkey[0]) && gc(e.signature);
+  ].includes(e.pubkey[0]) && yc(e.signature);
 }
-function gc(e) {
+function yc(e) {
   if (!(e instanceof Uint8Array) || e.length < 9 || e[0] !== 48 || e.length !== e[1] + 3 || e[2] !== 2) return !1;
   const t = e[3];
   if (t > 33 || t < 1 || e[3 + t + 1] !== 2) return !1;
   const r = e[3 + t + 2];
   return !(r > 33 || r < 1 || e.length !== 3 + t + 2 + r + 2);
 }
-function yc(e, t, r) {
+function gc(e, t, r) {
   const n = G(t.pubkey);
   return r.has(n) ? !1 : (r.add(n), e.filter((i) => Zt(i.pubkey, t.pubkey) === 0).length === 0);
 }
 var bc = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  canAddToArray: yc,
+  canAddToArray: gc,
   check: wc,
   decode: lc,
   encode: pc,
@@ -8601,7 +8600,7 @@ function Tc(e) {
   return Number(an(e.value, 0, "LE"));
 }
 function kc(e) {
-  const t = Uint8Array.from([R.SIGHASH_TYPE]), r = new Uint8Array(4);
+  const t = Uint8Array.from([R.SIGHASH_TYPE]), r = /* @__PURE__ */ new Uint8Array(4);
   return ci(r, 0, e, "LE"), {
     key: t,
     value: r
@@ -8760,7 +8759,7 @@ function Jc(e) {
 }
 function tl(e) {
   const { script: t, value: r } = e, n = Ct(t.length), i = new Uint8Array(8 + n + t.length);
-  return Cf(i, 0, BigInt(r), "LE"), ge(t.length, i, 8), i.set(t, 8 + n), {
+  return Cf(i, 0, BigInt(r), "LE"), ye(t.length, i, 8), i.set(t, 8 + n), {
     key: Uint8Array.from([R.WITNESS_UTXO]),
     value: i
   };
@@ -8799,7 +8798,7 @@ function ol(e) {
     key: Uint8Array.from([ht.TAP_TREE]),
     value: Xt([].concat(...e.leaves.map((t) => [
       Uint8Array.of(t.depth, t.leafVersion),
-      ge(BigInt(t.script.length)).buffer,
+      ye(BigInt(t.script.length)).buffer,
       t.script
     ])))
   };
@@ -8831,8 +8830,8 @@ function li(e, t = ll) {
       path: "m"
     };
     for (const u of cl(f.value.length / 4 - 1)) {
-      const d = an(f.value, u * 4 + 4, "LE"), w = !!(d & 2147483648), b = d & 2147483647;
-      p.path += "/" + b.toString(10) + (w ? "'" : "");
+      const d = an(f.value, u * 4 + 4, "LE"), w = !!(d & 2147483648), g = d & 2147483647;
+      p.path += "/" + g.toString(10) + (w ? "'" : "");
     }
     return p;
   }
@@ -8841,9 +8840,9 @@ function li(e, t = ll) {
     u.set(f.masterFingerprint, 0);
     let d = 4;
     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), ci(u, d, m, "LE"), d += 4;
+      const g = w.slice(-1) === "'";
+      let m = 2147483647 & parseInt(g ? w.slice(0, -1) : w, 10);
+      g && (m += 2147483648), ci(u, d, m, "LE"), d += 4;
     }), {
       key: l,
       value: u
@@ -8919,7 +8918,7 @@ function ra(e) {
   }
   function n(a) {
     const f = t.encode(a), l = Ct(a.leafHashes.length), p = new Uint8Array(l);
-    ge(a.leafHashes.length, p);
+    ye(a.leafHashes.length, p);
     const u = Xt([
       p,
       ...a.leafHashes,
@@ -9037,9 +9036,9 @@ function ds(e) {
 }
 function wl(e) {
   const t = e.key.length, r = e.value.length, n = Ct(t), i = Ct(r), o = new Uint8Array(n + t + i + r);
-  return ge(t, o, 0), o.set(e.key, n), ge(r, o, n + t), o.set(e.value, n + t + i), o;
+  return ye(t, o, 0), o.set(e.key, n), ye(r, o, n + t), o.set(e.value, n + t + i), o;
 }
-function gl(e, t) {
+function yl(e, t) {
   let r = 0;
   function n() {
     const { numberValue: I, bytes: P } = We(e, r);
@@ -9076,7 +9075,7 @@ function gl(e, t) {
   }
   const u = l.filter((I) => I.key[0] === qt.UNSIGNED_TX);
   if (u.length !== 1) throw new Error("Format Error: Only one UNSIGNED_TX allowed");
-  const d = t(u[0].value), { inputCount: w, outputCount: b } = d.getInputOutputCounts(), m = [], v = [];
+  const d = t(u[0].value), { inputCount: w, outputCount: g } = d.getInputOutputCounts(), m = [], v = [];
   for (const I of qr(w)) {
     const P = {}, S = [];
     for (; !f(); ) {
@@ -9086,7 +9085,7 @@ function gl(e, t) {
     }
     m.push(S);
   }
-  for (const I of qr(b)) {
+  for (const I of qr(g)) {
     const P = {}, S = [];
     for (; !f(); ) {
       const _ = a(), O = G(_.key);
@@ -9214,12 +9213,12 @@ function sa(e, { globalMapKeyVals: t, inputKeyVals: r, outputKeyVals: n }) {
     outputs: p
   };
 }
-function yl({ globalMap: e, inputs: t, outputs: r }) {
+function gl({ globalMap: e, inputs: t, outputs: r }) {
   const { globalKeyVals: n, inputKeyVals: i, outputKeyVals: o } = Kn({
     globalMap: e,
     inputs: t,
     outputs: r
-  }), a = ds(n), f = (d) => d.length === 0 ? [Uint8Array.from([0])] : d.map(ds), 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 = /* @__PURE__ */ new Uint8Array(5);
   return u.set([
     112,
     115,
@@ -9313,7 +9312,7 @@ function El(e, t) {
   }
   if (r === !1) throw new Error(`Input #${e} has too much or too little data to clean`);
 }
-function gs(e, t, r, n) {
+function ys(e, t, r, n) {
   throw new Error(`Data for ${e} key ${t} is incorrect: Expected ${r} and got ${JSON.stringify(n)}`);
 }
 function wi(e) {
@@ -9322,12 +9321,12 @@ function wi(e) {
       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) || gs(e, n, l, i);
+        i.every(f) || ys(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) || gs(e, n, l, i), !o(r, i)) throw new Error(`Can not add duplicate data to ${e}`);
+        if (f(i) || ys(e, n, l, i), !o(r, i)) throw new Error(`Can not add duplicate data to ${e}`);
         r[n] = i;
       }
     }
@@ -9335,12 +9334,14 @@ function wi(e) {
 }
 var vl = wi("global"), oa = wi("input"), aa = wi("output");
 function Il(e, t) {
-  oa(t, mt(e, e.length - 1));
+  const r = mt(e, e.length - 1);
+  oa(t, r);
 }
 function Al(e, t) {
-  aa(t, fr(e, e.length - 1));
+  const r = fr(e, e.length - 1);
+  aa(t, r);
 }
-var ys = class {
+var gs = class {
   constructor(e) {
     this.inputs = [], this.outputs = [], this.globalMap = { unsignedTx: e };
   }
@@ -9353,7 +9354,7 @@ var ys = class {
     return this.fromBuffer(r, t);
   }
   static fromBuffer(e, t) {
-    const r = gl(e, t), n = new this(r.globalMap.unsignedTx);
+    const r = yl(e, t), n = new this(r.globalMap.unsignedTx);
     return Object.assign(n, r), n;
   }
   toBase64() {
@@ -9363,16 +9364,18 @@ var ys = class {
     return G(this.toBuffer());
   }
   toBuffer() {
-    return yl(this);
+    return gl(this);
   }
   updateGlobal(e) {
     return vl(e, this.globalMap), this;
   }
   updateInput(e, t) {
-    return oa(t, mt(this.inputs, e)), this;
+    const r = mt(this.inputs, e);
+    return oa(t, r), this;
   }
   updateOutput(e, t) {
-    return aa(t, fr(this.outputs, e)), this;
+    const r = fr(this.outputs, e);
+    return aa(t, r), this;
   }
   addUnknownKeyValToGlobal(e) {
     return Sn(e, this.globalMap.unknownKeyVals, Tn(qt)), this.globalMap.unknownKeyVals || (this.globalMap.unknownKeyVals = []), this.globalMap.unknownKeyVals.push(e), this;
@@ -9461,7 +9464,7 @@ function fa(e, t) {
     if (!x(n, a)) throw new Error(`${t} for ${o} #${r} doesn't match the scriptPubKey in the prevout`);
   };
 }
-var bs = fa(dr, "Redeem script"), ms = fa(gr, "Witness script");
+var bs = fa(dr, "Redeem script"), ms = fa(yr, "Witness script");
 function Es(e) {
   let t = 0;
   function r(a) {
@@ -9482,15 +9485,15 @@ function Es(e) {
   return o();
 }
 function Ul(e) {
-  let t = e & J.SIGHASH_ANYONECANPAY ? "SIGHASH_ANYONECANPAY | " : "";
+  let t = e & tt.SIGHASH_ANYONECANPAY ? "SIGHASH_ANYONECANPAY | " : "";
   switch (e & 31) {
-    case J.SIGHASH_ALL:
+    case tt.SIGHASH_ALL:
       t += "SIGHASH_ALL";
       break;
-    case J.SIGHASH_SINGLE:
+    case tt.SIGHASH_SINGLE:
       t += "SIGHASH_SINGLE";
       break;
-    case J.SIGHASH_NONE:
+    case tt.SIGHASH_NONE:
       t += "SIGHASH_NONE";
       break;
   }
@@ -9509,7 +9512,7 @@ function vs(e) {
 function Pl(e) {
   return xe(e);
 }
-function gi(e) {
+function yi(e) {
   return on(e) ? "witnesspubkeyhash" : Xu(e) ? "pubkeyhash" : qu(e) ? "multisig" : Yu(e) ? "pubkey" : "nonstandard";
 }
 function Ze(e) {
@@ -9617,24 +9620,24 @@ var xl = class {
   }
   redeemFromFinalScriptSig(e) {
     if (!e) return;
-    const t = et(e);
+    const t = rt(e);
     if (!t) return;
     const r = t[t.length - 1];
-    if (!(!(r instanceof Uint8Array) || vs(r) || Pl(r) || !et(r))) return r;
+    if (!(!(r instanceof Uint8Array) || vs(r) || Pl(r) || !rt(r))) return r;
   }
   redeemFromFinalWitnessScript(e) {
     if (!e) return;
     const t = Es(e), r = t[t.length - 1];
-    if (!(!r || vs(r) || !et(r))) return r;
+    if (!(!r || vs(r) || !rt(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 = Es(d.finalScriptWitness)), d.witnessUtxo) o += d.witnessUtxo.value;
+      const g = t.ins[w];
+      if (r && d.finalScriptSig && (g.script = d.finalScriptSig), r && d.finalScriptWitness && (g.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];
+        const m = this.getNonWitnessUtxoTx(d, w, i), v = g.index, I = m.outs[v];
         o += I.value;
       }
     });
@@ -9679,12 +9682,12 @@ var xl = class {
     };
   }
   getHashForSig(e, t, r, n) {
-    const i = this.#t.tx, o = t.sighashType || J.SIGHASH_ALL;
+    const i = this.#t.tx, o = t.sighashType || tt.SIGHASH_ALL;
     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;
-      if (!x(b, d.getHash())) throw new Error(`Non-witness UTXO hash for input #${e} doesn't match the hash specified in the prevout`);
+      const d = this.#t.getNonWitnessUtxoTx(t, e, this.#a), w = i.ins[e], g = w.hash;
+      if (!x(g, d.getHash())) throw new Error(`Non-witness UTXO hash for input #${e} doesn't match the hash specified in the prevout`);
       const m = w.index;
       f = d.outs[m];
     } else if (t.witnessUtxo) f = {
@@ -9712,17 +9715,17 @@ PROCEED WITH CAUTION!
     };
   }
   getTaprootHashesForSig(e, t, r, n, i, o) {
-    const a = this.#t.tx, f = t.sighashType || J.SIGHASH_DEFAULT;
+    const a = this.#t.tx, f = t.sighashType || tt.SIGHASH_DEFAULT;
     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);
+      const g = r.map((m, v) => this.#t.getScriptAndAmountFromUtxo(v, m, this.#a));
+      this.#t.prevOuts = g, this.#t.signingScripts = g.map((m) => m.script), this.#t.values = g.map((m) => m.value);
     }
     const l = this.#t.signingScripts, p = this.#t.values;
     this.#t.taprootHashCache || (this.#t.taprootHashCache = a.getTaprootHashCache(l, p));
     const u = this.#t.taprootHashCache, d = [];
     if (t.tapInternalKey && !i) {
-      const b = this.#t.getPrevoutTaprootKey(e, t, this.#a) || new Uint8Array(0);
-      if (x(Ce(n), b)) {
+      const g = this.#t.getPrevoutTaprootKey(e, t, this.#a) || /* @__PURE__ */ new Uint8Array(0);
+      if (x(Ce(n), g)) {
         const m = a.hashForWitnessV1(e, l, p, f, void 0, void 0, u);
         d.push({
           pubkey: n,
@@ -9730,16 +9733,16 @@ PROCEED WITH CAUTION!
         });
       }
     }
-    const w = (t.tapLeafScript || []).filter((b) => Fr(n, b.script)).map((b) => {
+    const w = (t.tapLeafScript || []).filter((g) => Fr(n, g.script)).map((g) => {
       const m = Pt({
-        output: b.script,
-        version: b.leafVersion
+        output: g.script,
+        version: g.leafVersion
       });
-      return Object.assign({ hash: m }, b);
-    }).filter((b) => !i || x(i, b.hash)).map((b) => ({
+      return Object.assign({ hash: m }, g);
+    }).filter((g) => !i || x(i, g.hash)).map((g) => ({
       pubkey: n,
-      hash: a.hashForWitnessV1(e, l, p, f, b.hash, void 0, u),
-      leafHash: b.hash
+      hash: a.hashForWitnessV1(e, l, p, f, g.hash, void 0, u),
+      leafHash: g.hash
     }));
     return d.concat(w);
   }
@@ -9793,7 +9796,7 @@ var _l = class {
     this.#t = e, this.#a = t;
   }
   getFinalScripts(e, t, r, n, i, o, a = !0, f) {
-    const l = gi(r);
+    const l = yi(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,14 +9806,14 @@ var _l = class {
   }
 };
 function Rl(e, t, r, n, i, o, a = !0, f) {
-  const l = gi(r);
+  const l = yi(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);
 }
 function ca(e, t, r, n, i, o, a) {
   let f, l;
-  const p = Nl(e, t, r), u = o ? gr({ redeem: p }) : null, d = i ? dr({ redeem: u || p }) : null;
+  const p = Nl(e, t, r), u = o ? yr({ redeem: p }) : null, d = i ? dr({ redeem: u || p }) : null;
   return n ? (u && u.witness ? l = or(u.witness) : p && p.witness ? l = or(p.witness) : l = or(a ?? [new Uint8Array([0])]), d && (f = d?.input)) : d ? f = d?.input : p ? f = p.input : f = Array.isArray(a) && a[0] ? a[0] : new Uint8Array([1]), {
     finalScriptSig: f,
     finalScriptWitness: l
@@ -9823,7 +9826,7 @@ function la(e, t, r) {
     case "witnesspubkeyhash":
       return As(1, e.partialSig);
     case "multisig": {
-      const n = yr({ output: t });
+      const n = gr({ output: t });
       if (n.m === void 0) throw new Error("Cannot determine m for multisig");
       return As(n.m, e.partialSig, n.pubkeys);
     }
@@ -9846,7 +9849,7 @@ function Nl(e, t, r) {
   const n = e;
   switch (t) {
     case "multisig":
-      return yr({
+      return gr({
         output: n,
         signatures: Hl(e, r)
       });
@@ -9878,7 +9881,7 @@ function Nl(e, t, r) {
   }
 }
 function Hl(e, t) {
-  const r = yr({ output: e });
+  const r = gr({ output: e });
   if (!r.pubkeys) throw new Error("Cannot extract pubkeys from multisig script");
   const n = [];
   for (const i of r.pubkeys) {
@@ -9901,7 +9904,7 @@ var Ll = new Uint8Array([
 ]), pa = class {
   tx;
   constructor(e = Ll) {
-    this.tx = J.fromBuffer(e), Sl(this.tx), Object.defineProperty(this, "tx", {
+    this.tx = tt.fromBuffer(e), Sl(this.tx), Object.defineProperty(this, "tx", {
       enumerable: !1,
       writable: !0
     });
@@ -9929,13 +9932,13 @@ var Ll = new Uint8Array([
   maximumFeeRate: 5e3
 };
 function jt(e) {
-  return J.fromBuffer(e);
+  return tt.fromBuffer(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 Mn {
-  constructor(t = {}, r = new ys(new pa())) {
+  constructor(t = {}, r = new gs(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);
@@ -9995,8 +9998,8 @@ var Zl = class Mn {
     return this.fromBuffer(n, r);
   }
   static fromBuffer(t, r = {}) {
-    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;
+    const n = gs.fromBuffer(t, Cl), i = new Mn(r, n);
+    return Tl(i.#t.tx, i.#t), i.#t.hasSignatures = i.data.inputs.some((o) => o.partialSig?.length || o.tapKeySig || o.tapScriptSig?.length || o.finalScriptSig || o.finalScriptWitness), i;
   }
   combine(...t) {
     return this.data.combine(...t.map((r) => r.data)), this;
@@ -10015,7 +10018,7 @@ var Zl = class Mn {
     return Ur(t), Xe(this.data.inputs, "setVersion", this.#t.hasSignatures), this.#t.tx.version = t, this.#t.invalidate("outputs"), this;
   }
   setVersionTRUC() {
-    return this.setVersion(J.TRUC_VERSION);
+    return this.setVersion(tt.TRUC_VERSION);
   }
   setLocktime(t) {
     return Ur(t), Xe(this.data.inputs, "setLocktime", this.#t.hasSignatures), this.#t.tx.locktime = t, this.#t.invalidate("outputs"), this;
@@ -10081,7 +10084,7 @@ var Zl = class Mn {
   }
   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 + "-") + gi(n.meaningfulScript);
+    return (n.type === "raw" ? "" : n.type + "-") + yi(n.meaningfulScript);
   }
   inputHasPubkey(t, r) {
     const n = mt(this.data.inputs, t);
@@ -10106,7 +10109,7 @@ var Zl = class Mn {
     const i = this.data.inputs[t];
     return Lt(i) ? this.#f(t, r, n) : this.#h(t, r, n);
   }
-  signAllInputsHD(t, r = [J.SIGHASH_ALL]) {
+  signAllInputsHD(t, r = [tt.SIGHASH_ALL]) {
     if (!t || !t.publicKey || !t.fingerprint) throw new Error("Need HDSigner to sign input");
     const n = [];
     for (const i of Ze(this.data.inputs.length)) try {
@@ -10117,7 +10120,7 @@ var Zl = class Mn {
     if (n.every((i) => !i)) throw new Error("No inputs were signed");
     return this;
   }
-  async signAllInputsHDAsync(t, r = [J.SIGHASH_ALL]) {
+  async signAllInputsHDAsync(t, r = [tt.SIGHASH_ALL]) {
     if (!t || !t.publicKey || !t.fingerprint) throw new Error("Need HDSigner to sign input");
     const n = [], i = [];
     for (const o of Ze(this.data.inputs.length)) i.push(this.signInputHDAsync(o, t, r).then(() => {
@@ -10127,11 +10130,11 @@ var Zl = class Mn {
     }));
     if (await Promise.all(i), n.every((o) => !o)) throw new Error("No inputs were signed");
   }
-  signInputHD(t, r, n = [J.SIGHASH_ALL]) {
+  signInputHD(t, r, n = [tt.SIGHASH_ALL]) {
     if (!r || !r.publicKey || !r.fingerprint) throw new Error("Need HDSigner to sign input");
     return this.#r.getSignersFromHD(t, this.data.inputs, r).forEach((i) => this.signInput(t, i, n)), this;
   }
-  async signInputHDAsync(t, r, n = [J.SIGHASH_ALL]) {
+  async signInputHDAsync(t, r, n = [tt.SIGHASH_ALL]) {
     if (!r || !r.publicKey || !r.fingerprint) throw new Error("Need HDSigner to sign input");
     const i = this.#r.getSignersFromHD(t, this.data.inputs, r).map((o) => this.signInputAsync(t, o, n));
     await Promise.all(i);
@@ -10257,11 +10260,11 @@ var Zl = class Mn {
     const f = [];
     let l, p, u;
     for (const d of a) {
-      const w = d.signature, b = d.pubkey, m = Ae.decode(w), { hash: v, script: I } = u !== m.hashType || !l || !p ? this.#r.getHashForSig(t, Object.assign({}, i, { sighashType: m.hashType }), !0) : {
+      const w = d.signature, g = d.pubkey, m = Ae.decode(w), { hash: v, script: I } = u !== m.hashType || !l || !p ? this.#r.getHashForSig(t, Object.assign({}, i, { sighashType: m.hashType }), !0) : {
         hash: l,
         script: p
       };
-      u = m.hashType, l = v, p = I, ua(b, I, "verify"), f.push(r(b, v, m.signature));
+      u = m.hashType, l = v, p = I, ua(g, I, "verify"), f.push(r(g, v, m.signature));
     }
     return f.every((d) => d);
   }
@@ -10278,22 +10281,22 @@ var Zl = class Mn {
       u++;
     }
     if (a) for (const d of a) {
-      const w = d.pubkey, b = l.find((m) => x(w, m.pubkey));
-      if (b) {
-        if (!r(w, b.hash, this.#r.trimTaprootSig(d.signature))) return !1;
+      const w = d.pubkey, g = l.find((m) => x(w, m.pubkey));
+      if (g) {
+        if (!r(w, g.hash, this.#r.trimTaprootSig(d.signature))) return !1;
         u++;
       }
     }
     return u > 0;
   }
-  #u(t, r, n = [J.SIGHASH_ALL]) {
+  #u(t, r, n = [tt.SIGHASH_ALL]) {
     const i = r.publicKey instanceof Uint8Array ? r.publicKey : new Uint8Array(r.publicKey), { hash: o, sighashType: a } = this.#r.getHashAndSighashType(this.data.inputs, t, i, n), f = r.sign(o), l = [{
       pubkey: i,
       signature: Ae.encode(f instanceof Uint8Array ? f : new Uint8Array(f), a)
     }];
     return this.data.updateInput(t, { partialSig: l }), this.#t.hasSignatures = !0, this;
   }
-  #c(t, r, n, i, o = [J.SIGHASH_DEFAULT]) {
+  #c(t, r, n, i, o = [tt.SIGHASH_DEFAULT]) {
     const a = n.publicKey instanceof Uint8Array ? n.publicKey : new Uint8Array(n.publicKey);
     if (!("signSchnorr" in n) || typeof n.signSchnorr != "function") throw new Error(`Need Schnorr Signer to sign taproot input #${t}.`);
     const f = this.checkTaprootHashesForSig(t, r, n, i, o), l = n.signSchnorr.bind(n), p = f.filter((d) => !d.leafHash).map((d) => Le(l(d.hash), r.sighashType))[0], u = f.filter((d) => !!d.leafHash).map((d) => ({
@@ -10303,14 +10306,14 @@ var Zl = class Mn {
     }));
     return p && (this.data.updateInput(t, { tapKeySig: p }), this.#t.hasSignatures = !0), u.length && (this.data.updateInput(t, { tapScriptSig: u }), this.#t.hasSignatures = !0), this;
   }
-  async #p(t, r, n = [J.SIGHASH_ALL]) {
+  async #p(t, r, n = [tt.SIGHASH_ALL]) {
     const i = r.publicKey instanceof Uint8Array ? r.publicKey : new Uint8Array(r.publicKey), { hash: o, sighashType: a } = this.#r.getHashAndSighashType(this.data.inputs, t, i, n), f = await r.sign(o), l = f instanceof Uint8Array ? f : new Uint8Array(f), p = [{
       pubkey: i,
       signature: Ae.encode(l, a)
     }];
     this.data.updateInput(t, { partialSig: p }), this.#t.hasSignatures = !0;
   }
-  async #l(t, r, n, i, o = [J.SIGHASH_DEFAULT]) {
+  async #l(t, r, n, i, o = [tt.SIGHASH_DEFAULT]) {
     const a = n.publicKey instanceof Uint8Array ? n.publicKey : new Uint8Array(n.publicKey);
     if (!("signSchnorr" in n) || typeof n.signSchnorr != "function") throw new Error(`Need Schnorr Signer to sign taproot input #${t}.`);
     const f = this.checkTaprootHashesForSig(t, r, n, i, o), l = n.signSchnorr.bind(n), p = f.find((d) => !d.leafHash);
@@ -10321,18 +10324,17 @@ var Zl = class Mn {
     const u = f.filter((d) => !!d.leafHash);
     if (u.length) {
       const d = await Promise.all(u.map(async (w) => {
-        const b = await l(w.hash);
+        const g = await l(w.hash);
         return {
           pubkey: Ce(a),
-          signature: Le(b, r.sighashType),
+          signature: Le(g, r.sighashType),
           leafHash: w.leafHash
         };
       }));
       this.data.updateInput(t, { tapScriptSig: d }), this.#t.hasSignatures = !0;
     }
   }
-};
-var Ql = {
+}, Ql = {
   networks: va,
   address: Uf,
   payments: Pf,
@@ -10366,7 +10368,7 @@ export {
   Kl as g,
   zl as h,
   Uf as i,
-  J as j,
+  tt as j,
   Mt as k,
   Yu as l,
   De as m,