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

package/browser/btc-vision-bitcoin.js

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