@btc-vision/transaction 1.8.0-alpha.2 → 1.8.0-beta.1

package/browser/btc-vision-bitcoin.js

@@ -1,4 +1,4 @@
-import { d as I, B as h, a as U, t as c, i as Ut, b as Kn, e as Br, c as kt, v as Se, p as qe, u as N } from "./vendors.js";
+import { d as I, B as h, a as U, t as c, i as Ut, b as Kn, e as Cr, c as kt, v as Se, p as $e, u as N } from "./vendors.js";
 const M = {
   messagePrefix: `Bitcoin Signed Message:
 `,
@@ -11,7 +11,7 @@ const M = {
   pubKeyHash: 0,
   scriptHash: 5,
   wif: 128
-}, so = {
+}, Ji = {
   messagePrefix: `Bitcoin Signed Message:
 `,
   bech32: "bcrt",
@@ -23,7 +23,7 @@ const M = {
   pubKeyHash: 111,
   scriptHash: 196,
   wif: 239
-}, io = {
+}, to = {
   messagePrefix: `Bitcoin Signed Message:
 `,
   bech32: "tb",
@@ -36,7 +36,7 @@ const M = {
   scriptHash: 196,
   wif: 239
 };
-function Be(t) {
+function Ce(t) {
   let e, r;
   try {
     e = I.bech32.decode(t);
@@ -240,16 +240,16 @@ const E = {
   OP_PUBKEYHASH: 253,
   OP_PUBKEY: 254,
   OP_INVALIDOPCODE: 255
-}, Rr = {};
+}, Br = {};
 for (const t of Object.keys(E)) {
   const e = E[t];
-  Rr[e] = t;
+  Br[e] = t;
 }
-function Fr(t) {
+function Rr(t) {
   return t < E.OP_PUSHDATA1 ? 1 : t <= 255 ? 2 : t <= 65535 ? 3 : 5;
 }
 function qn(t, e, r) {
-  const n = Fr(e);
+  const n = Rr(e);
   return n === 1 ? t.writeUInt8(e, r) : n === 2 ? (t.writeUInt8(E.OP_PUSHDATA1, r), t.writeUInt8(e, r + 1)) : n === 3 ? (t.writeUInt8(E.OP_PUSHDATA2, r), t.writeUInt16LE(e, r + 1)) : (t.writeUInt8(E.OP_PUSHDATA4, r), t.writeUInt32LE(e, r + 1)), n;
 }
 function Xn(t, e) {
@@ -299,7 +299,7 @@ function jn(t, e, r) {
 function zn(t) {
   return t > 2147483647 ? 5 : t > 8388607 ? 4 : t > 32767 ? 3 : t > 127 ? 2 : t > 0 ? 1 : 0;
 }
-function Lr(t) {
+function Fr(t) {
   let e = Math.abs(t);
   const r = zn(e), n = h.allocUnsafe(r), s = t < 0;
   for (let i = 0; i < r; ++i)
@@ -309,8 +309,8 @@ function Lr(t) {
 const Yn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   decode: jn,
-  encode: Lr
-}, Symbol.toStringTag, { value: "Module" })), Xe = U.alloc(32, 0), je = U.from("fffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f", "hex");
+  encode: Fr
+}, Symbol.toStringTag, { value: "Module" })), qe = U.alloc(32, 0), Xe = U.from("fffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f", "hex");
 function at(t, e) {
   return t.length !== e.length ? !1 : t.every((r, n) => r.equals(e[n]));
 }
@@ -318,14 +318,14 @@ function W(t) {
   if (!U.isBuffer(t) || t.length < 33)
     return !1;
   const e = t[0], r = t.subarray(1, 33);
-  if (r.compare(Xe) === 0 || r.compare(je) >= 0)
+  if (r.compare(qe) === 0 || r.compare(Xe) >= 0)
     return !1;
   if ((e === 2 || e === 3) && t.length === 33)
     return !0;
   if (t.length !== 65)
     return !1;
   const n = t.subarray(33);
-  return n.compare(Xe) === 0 || n.compare(je) >= 0 ? !1 : e === 4 || e === 6 || e === 7;
+  return n.compare(qe) === 0 || n.compare(Xe) >= 0 ? !1 : e === 4 || e === 6 || e === 7;
 }
 const Zn = 21 * 1e14;
 function qt(t) {
@@ -338,111 +338,114 @@ function ne(t) {
   const e = t;
   return U.isBuffer(e.output) ? e.version !== void 0 ? (e.version & Pt) === e.version : !0 : !1;
 }
-function Re(t) {
-  return globalThis.Array.isArray(t) ? t.length !== 2 ? !1 : t.every((e) => Re(e)) : ne(t);
-}
-const Qn = c.BufferN(32), Jn = c.BufferN(20), _e = c.BufferN(32), It = c.Number, se = c.Array, ts = c.Boolean, Vr = c.String, V = c.Buffer, Wr = c.Hex, Te = c.maybe, z = c.tuple, Gr = c.UInt8, Y = c.UInt32, es = c.Function, Kr = c.BufferN, Mr = c.Null, rs = c.oneOf, ie = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+function Be(t) {
+  return globalThis.Array.isArray(t) ? t.length !== 2 ? !1 : t.every((e) => Be(e)) : ne(t);
+}
+c.BufferN(32);
+c.BufferN(20);
+const _e = c.BufferN(32), It = c.Number, se = c.Array;
+c.Boolean;
+const Lr = c.String, V = c.Buffer, Vr = c.Hex, Te = c.maybe, z = c.tuple, Wr = c.UInt8, Y = c.UInt32;
+c.Function;
+const Gr = c.BufferN, Kr = c.Null;
+c.oneOf;
+const ie = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   Array: se,
-  Boolean: ts,
   Buffer: V,
-  Buffer256bit: Qn,
-  BufferN: Kr,
-  Function: es,
-  Hash160bit: Jn,
+  BufferN: Gr,
   Hash256bit: _e,
-  Hex: Wr,
-  Null: Mr,
+  Hex: Vr,
+  Null: Kr,
   Number: It,
   Satoshi: qt,
-  String: Vr,
+  String: Lr,
   TAPLEAF_VERSION_MASK: Pt,
   UInt32: Y,
-  UInt8: Gr,
+  UInt8: Wr,
   isPoint: W,
   isTapleaf: ne,
-  isTaptree: Re,
+  isTaptree: Be,
   maybe: Te,
-  oneOf: rs,
   stacksEqual: at,
   tuple: z,
   typeforce: c
-}, Symbol.toStringTag, { value: "Module" })), { typeforce: ns } = ie, ze = h.alloc(1, 0);
+}, Symbol.toStringTag, { value: "Module" })), { typeforce: Qn } = ie, je = h.alloc(1, 0);
 function oe(t) {
   const e = t & -129;
   return e > 0 && e < 4;
 }
-function Ye(t) {
+function ze(t) {
   let e = 0;
   for (; t[e] === 0; )
     ++e;
-  return e === t.length ? ze : (t = t.subarray(e), t[0] & 128 ? h.concat([ze, t], 1 + t.length) : t);
+  return e === t.length ? je : (t = t.subarray(e), t[0] & 128 ? h.concat([je, t], 1 + t.length) : t);
 }
-function Ze(t) {
+function Ye(t) {
   t[0] === 0 && (t = t.subarray(1));
   const e = h.alloc(32, 0), r = Math.max(0, 32 - t.length);
   return t.copy(e, r), e;
 }
-function ss(t) {
+function Jn(t) {
   const e = t.readUInt8(t.length - 1);
   if (!oe(e))
     throw new Error(`Invalid hashType ${e}`);
-  const r = Dn(t.subarray(0, -1)), n = Ze(r.r), s = Ze(r.s);
+  const r = Dn(t.subarray(0, -1)), n = Ye(r.r), s = Ye(r.s);
   return { signature: h.concat([n, s], 64), hashType: e };
 }
-function is(t, e) {
-  if (ns({
-    signature: Kr(64),
-    hashType: Gr
+function ts(t, e) {
+  if (Qn({
+    signature: Gr(64),
+    hashType: Wr
   }, { signature: t, hashType: e }), !oe(e))
     throw new Error(`Invalid hashType ${e}`);
   const r = h.allocUnsafe(1);
   r.writeUInt8(e, 0);
-  const n = Ye(t.subarray(0, 32)), s = Ye(t.subarray(32, 64));
+  const n = ze(t.subarray(0, 32)), s = ze(t.subarray(32, 64));
   return h.concat([$n(n, s), r]);
 }
-const os = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const es = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  decode: ss,
-  encode: is,
+  decode: Jn,
+  encode: ts,
   isDefinedHashType: oe
-}, Symbol.toStringTag, { value: "Module" })), { typeforce: Nt } = ie, Dr = E.OP_RESERVED;
-function us(t) {
+}, Symbol.toStringTag, { value: "Module" })), { typeforce: Nt } = ie, Mr = E.OP_RESERVED;
+function rs(t) {
   return It(t) && (t === E.OP_0 || t >= E.OP_1 && t <= E.OP_16 || t === E.OP_1NEGATE);
 }
-function $r(t) {
-  return V(t) || us(t);
+function Dr(t) {
+  return V(t) || rs(t);
 }
 function ue(t) {
-  return se(t) && t.every($r);
+  return se(t) && t.every(Dr);
 }
-function Fe(t) {
-  return t.length - t.filter($r).length;
+function Re(t) {
+  return t.length - t.filter(Dr).length;
 }
 function zt(t) {
   if (t.length === 0)
     return E.OP_0;
   if (t.length === 1) {
     if (t[0] >= 1 && t[0] <= 16)
-      return Dr + t[0];
+      return Mr + t[0];
     if (t[0] === 129)
       return E.OP_1NEGATE;
   }
 }
-function qr(t) {
+function $r(t) {
   return h.isBuffer(t);
 }
-function fs(t) {
+function ns(t) {
   return se(t);
 }
 function Yt(t) {
   return h.isBuffer(t);
 }
 function v(t) {
-  if (qr(t))
+  if ($r(t))
     return t;
   Nt(se, t);
-  const e = t.reduce((s, i) => Yt(i) ? i.length === 1 && zt(i) !== void 0 ? s + 1 : s + Fr(i.length) + i.length : s + 1, 0), r = h.allocUnsafe(e);
+  const e = t.reduce((s, i) => Yt(i) ? i.length === 1 && zt(i) !== void 0 ? s + 1 : s + Rr(i.length) + i.length : s + 1, 0), r = h.allocUnsafe(e);
   let n = 0;
   if (t.forEach((s) => {
     if (Yt(s)) {
@@ -459,7 +462,7 @@ function v(t) {
   return r;
 }
 function A(t) {
-  if (fs(t))
+  if (ns(t))
     return t;
   Nt(V, t);
   const e = [];
@@ -479,8 +482,8 @@ function A(t) {
   }
   return e;
 }
-function Xr(t) {
-  if (qr(t) && (t = A(t)), !t)
+function qr(t) {
+  if ($r(t) && (t = A(t)), !t)
     throw new Error("Could not convert invalid chunks to ASM");
   return t.map((e) => {
     if (Yt(e)) {
@@ -489,35 +492,35 @@ function Xr(t) {
         return e.toString("hex");
       e = r;
     }
-    return Rr[e];
+    return Br[e];
   }).join(" ");
 }
-function cs(t) {
-  return Nt(Vr, t), v(t.split(" ").map((e) => E[e] !== void 0 ? E[e] : (Nt(Wr, e), h.from(e, "hex"))));
+function ss(t) {
+  return Nt(Lr, t), v(t.split(" ").map((e) => E[e] !== void 0 ? E[e] : (Nt(Vr, e), h.from(e, "hex"))));
 }
-function jr(t) {
-  return t = A(t), Nt(ue, t), t.map((e) => Yt(e) ? e : e === E.OP_0 ? h.allocUnsafe(0) : Lr(e - Dr));
+function Xr(t) {
+  return t = A(t), Nt(ue, t), t.map((e) => Yt(e) ? e : e === E.OP_0 ? h.allocUnsafe(0) : Fr(e - Mr));
 }
-function zr(t) {
+function jr(t) {
   return W(t);
 }
 function Q(t) {
   return !h.isBuffer(t) || !oe(t[t.length - 1]) ? !1 : Mn(t.subarray(0, -1));
 }
-const as = Yn, dt = os, hs = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const is = Yn, dt = es, os = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   compile: v,
-  countNonPushOnlyOPs: Fe,
+  countNonPushOnlyOPs: Re,
   decompile: A,
-  fromASM: cs,
-  isCanonicalPubKey: zr,
+  fromASM: ss,
+  isCanonicalPubKey: jr,
   isCanonicalScriptSignature: Q,
   isPushOnly: ue,
-  number: as,
+  number: is,
   opcodes: E,
   signature: dt,
-  toASM: Xr,
-  toStack: jr
+  toASM: qr,
+  toStack: Xr
 }, Symbol.toStringTag, { value: "Module" }));
 var K;
 (function(t) {
@@ -545,8 +548,8 @@ function B(t) {
   let e;
   return () => (e !== void 0 || (e = t()), e);
 }
-const Qe = E, Je = 16, tr = 2, er = 40;
-function Yr(t, e) {
+const Ze = E, Qe = 16, Je = 2, tr = 40;
+function zr(t, e) {
   if (!t.address && !t.output && !t.program && (typeof t.deploymentVersion > "u" || !t.hash160))
     throw new TypeError("At least one of address, output or program must be provided");
   e = Object.assign({ validate: !0 }, e || {}), c({
@@ -565,7 +568,7 @@ function Yr(t, e) {
         throw new TypeError("deploymentVersion must fit in one byte");
       return h.concat([h.of(t.deploymentVersion), t.hash160]);
     }
-  }, n = B(() => Be(t.address)), s = t.network || M, i = {
+  }, n = B(() => Ce(t.address)), s = t.network || M, i = {
     name: K.P2OP,
     network: s,
     deploymentVersion: 0
@@ -577,7 +580,7 @@ function Yr(t, e) {
     if (o)
       return o;
     if (t.output) {
-      if (t.output[0] !== Qe.OP_16)
+      if (t.output[0] !== Ze.OP_16)
         throw new TypeError("Invalid P2OP script");
       let u = 1, f;
       if (t.output[1] < 76)
@@ -598,23 +601,23 @@ function Yr(t, e) {
       return i.program.subarray(1);
   }), y(i, "output", () => {
     if (i.program)
-      return v([Qe.OP_16, i.program]);
+      return v([Ze.OP_16, i.program]);
   }), y(i, "address", () => {
     if (!i.program)
       return;
     if (!s.bech32Opnet)
       throw new TypeError("Network does not support opnet");
     const o = I.bech32m.toWords(i.program);
-    return o.unshift(Je), I.bech32m.encode(s.bech32Opnet, o);
+    return o.unshift(Qe), I.bech32m.encode(s.bech32Opnet, o);
   }), e.validate) {
     let o = U.alloc(0);
     if (t.address) {
       const u = n();
       if (s.bech32Opnet !== u.prefix)
         throw new TypeError("Invalid prefix or network mismatch");
-      if (u.version !== Je)
+      if (u.version !== Qe)
         throw new TypeError("Invalid witness version for p2op");
-      if (u.data.length < tr || u.data.length > er)
+      if (u.data.length < Je || u.data.length > tr)
         throw new TypeError("Invalid witness program length");
       o = u.data;
     }
@@ -629,7 +632,7 @@ function Yr(t, e) {
         throw new TypeError("Program mismatch (output vs other source)");
       o = u;
     }
-    if (o.length < tr || o.length > er)
+    if (o.length < Je || o.length > tr)
       throw new TypeError(`Witness program must be 2–40 bytes. Was ${o.length} bytes`);
     if (t.deploymentVersion !== void 0 && t.deploymentVersion !== o[0])
       throw new TypeError("deploymentVersion mismatch");
@@ -638,25 +641,25 @@ function Yr(t, e) {
   }
   return Object.assign(i, t);
 }
-function ps(t) {
+function us(t) {
   return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
 }
-function Zr(t, e, r = "") {
-  const n = ps(t), s = t?.length;
+function Yr(t, e, r = "") {
+  const n = us(t), s = t?.length;
   if (!n || e !== void 0) {
     const o = r && `"${r}" `, u = "", f = n ? `length=${s}` : `type=${typeof t}`;
     throw new Error(o + "expected Uint8Array" + u + ", got " + f);
   }
   return t;
 }
-function rr(t, e = !0) {
+function er(t, e = !0) {
   if (t.destroyed)
     throw new Error("Hash instance has been destroyed");
   if (e && t.finished)
     throw new Error("Hash#digest() has already been called");
 }
-function ls(t, e) {
-  Zr(t, void 0, "digestInto() output");
+function fs(t, e) {
+  Yr(t, void 0, "digestInto() output");
   const r = e.outputLen;
   if (t.length < r)
     throw new Error('"digestInto() output" expected to be of length >=' + r);
@@ -674,20 +677,20 @@ function q(t, e) {
 function ft(t, e) {
   return t << e | t >>> 32 - e >>> 0;
 }
-function Le(t, e = {}) {
+function Fe(t, e = {}) {
   const r = (s, i) => t(i).update(s).digest(), n = t(void 0);
   return r.outputLen = n.outputLen, r.blockLen = n.blockLen, r.create = (s) => t(s), Object.assign(r, e), Object.freeze(r);
 }
-const ds = (t) => ({
+const cs = (t) => ({
   oid: Uint8Array.from([6, 9, 96, 134, 72, 1, 101, 3, 4, 2, t])
 });
-function Qr(t, e, r) {
+function Zr(t, e, r) {
   return t & e ^ ~t & r;
 }
-function Jr(t, e, r) {
+function Qr(t, e, r) {
   return t & e ^ t & r ^ e & r;
 }
-class Ve {
+class Le {
   blockLen;
   outputLen;
   padOffset;
@@ -703,7 +706,7 @@ class Ve {
     this.blockLen = e, this.outputLen = r, this.padOffset = n, this.isLE = s, this.buffer = new Uint8Array(e), this.view = we(this.buffer);
   }
   update(e) {
-    rr(this), Zr(e);
+    er(this), Yr(e);
     const { view: r, buffer: n, blockLen: s } = this, i = e.length;
     for (let o = 0; o < i; ) {
       const u = Math.min(s - this.pos, i - o);
@@ -718,7 +721,7 @@ class Ve {
     return this.length += e.length, this.roundClean(), this;
   }
   digestInto(e) {
-    rr(this), ls(e, this), this.finished = !0;
+    er(this), fs(e, this), this.finished = !0;
     const { buffer: r, view: n, blockLen: s, isLE: i } = this;
     let { pos: o } = this;
     r[o++] = 128, ht(this.buffer.subarray(o)), this.padOffset > s - o && (this.process(n, 0), o = 0);
@@ -765,7 +768,7 @@ const et = /* @__PURE__ */ Uint32Array.from([
   271733878,
   3285377520
 ]), rt = /* @__PURE__ */ new Uint32Array(80);
-class ws extends Ve {
+class as extends Le {
   A = St[0] | 0;
   B = St[1] | 0;
   C = St[2] | 0;
@@ -789,7 +792,7 @@ class ws extends Ve {
     let { A: n, B: s, C: i, D: o, E: u } = this;
     for (let f = 0; f < 80; f++) {
       let a, p;
-      f < 20 ? (a = Qr(s, i, o), p = 1518500249) : f < 40 ? (a = s ^ i ^ o, p = 1859775393) : f < 60 ? (a = Jr(s, i, o), p = 2400959708) : (a = s ^ i ^ o, p = 3395469782);
+      f < 20 ? (a = Zr(s, i, o), p = 1518500249) : f < 40 ? (a = s ^ i ^ o, p = 1859775393) : f < 60 ? (a = Qr(s, i, o), p = 2400959708) : (a = s ^ i ^ o, p = 3395469782);
       const l = ft(n, 5) + a + u + p + rt[f] | 0;
       u = o, o = i, i = ft(s, 30), s = n, n = l;
     }
@@ -802,7 +805,7 @@ class ws extends Ve {
     this.set(0, 0, 0, 0, 0), ht(this.buffer);
   }
 }
-const gs = /* @__PURE__ */ Le(() => new ws()), ys = /* @__PURE__ */ Uint8Array.from([
+const hs = /* @__PURE__ */ Fe(() => new as()), ps = /* @__PURE__ */ Uint8Array.from([
   7,
   4,
   13,
@@ -819,36 +822,36 @@ const gs = /* @__PURE__ */ Le(() => new ws()), ys = /* @__PURE__ */ Uint8Array.f
   14,
   11,
   8
-]), tn = Uint8Array.from(new Array(16).fill(0).map((t, e) => e)), ms = tn.map((t) => (9 * t + 5) % 16), en = /* @__PURE__ */ (() => {
-  const r = [[tn], [ms]];
+]), Jr = Uint8Array.from(new Array(16).fill(0).map((t, e) => e)), ls = Jr.map((t) => (9 * t + 5) % 16), tn = /* @__PURE__ */ (() => {
+  const r = [[Jr], [ls]];
   for (let n = 0; n < 4; n++)
     for (let s of r)
-      s.push(s[n].map((i) => ys[i]));
+      s.push(s[n].map((i) => ps[i]));
   return r;
-})(), rn = en[0], nn = en[1], sn = /* @__PURE__ */ [
+})(), en = tn[0], rn = tn[1], nn = /* @__PURE__ */ [
   [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],
   [12, 13, 11, 15, 6, 9, 9, 7, 12, 15, 11, 13, 7, 8, 7, 7],
   [13, 15, 14, 11, 7, 7, 6, 8, 13, 14, 13, 12, 5, 5, 6, 9],
   [14, 11, 12, 14, 8, 6, 5, 5, 15, 12, 15, 14, 9, 9, 8, 6],
   [15, 12, 13, 13, 9, 5, 8, 6, 14, 11, 12, 11, 8, 6, 5, 5]
-].map((t) => Uint8Array.from(t)), bs = /* @__PURE__ */ rn.map((t, e) => t.map((r) => sn[e][r])), Es = /* @__PURE__ */ nn.map((t, e) => t.map((r) => sn[e][r])), Ss = /* @__PURE__ */ Uint32Array.from([
+].map((t) => Uint8Array.from(t)), ds = /* @__PURE__ */ en.map((t, e) => t.map((r) => nn[e][r])), ws = /* @__PURE__ */ rn.map((t, e) => t.map((r) => nn[e][r])), gs = /* @__PURE__ */ Uint32Array.from([
   0,
   1518500249,
   1859775393,
   2400959708,
   2840853838
-]), _s = /* @__PURE__ */ Uint32Array.from([
+]), ys = /* @__PURE__ */ Uint32Array.from([
   1352829926,
   1548603684,
   1836072691,
   2053994217,
   0
 ]);
-function nr(t, e, r, n) {
+function rr(t, e, r, n) {
   return t === 0 ? e ^ r ^ n : t === 1 ? e & r | ~e & n : t === 2 ? (e | ~r) ^ n : t === 3 ? e & n | r & ~n : e ^ (r | ~n);
 }
 const Wt = /* @__PURE__ */ new Uint32Array(16);
-class Ts extends Ve {
+class ms extends Le {
   h0 = 1732584193;
   h1 = -271733879;
   h2 = -1732584194;
@@ -869,13 +872,13 @@ class Ts extends Ve {
       Wt[b] = e.getUint32(r, !0);
     let n = this.h0 | 0, s = n, i = this.h1 | 0, o = i, u = this.h2 | 0, f = u, a = this.h3 | 0, p = a, l = this.h4 | 0, d = l;
     for (let b = 0; b < 5; b++) {
-      const w = 4 - b, S = Ss[b], P = _s[b], k = rn[b], H = nn[b], _ = bs[b], O = Es[b];
+      const w = 4 - b, S = gs[b], P = ys[b], k = en[b], H = rn[b], _ = ds[b], O = ws[b];
       for (let T = 0; T < 16; T++) {
-        const F = ft(n + nr(b, i, u, a) + Wt[k[T]] + S, _[T]) + l | 0;
+        const F = ft(n + rr(b, i, u, a) + Wt[k[T]] + S, _[T]) + l | 0;
         n = l, l = a, a = ft(u, 10) | 0, u = i, i = F;
       }
       for (let T = 0; T < 16; T++) {
-        const F = ft(s + nr(w, o, f, p) + Wt[H[T]] + P, O[T]) + d | 0;
+        const F = ft(s + rr(w, o, f, p) + Wt[H[T]] + P, O[T]) + d | 0;
         s = d, d = p, p = ft(f, 10) | 0, f = o, o = F;
       }
     }
@@ -888,7 +891,7 @@ class Ts extends Ve {
     this.destroyed = !0, ht(this.buffer), this.set(0, 0, 0, 0, 0);
   }
 }
-const on = /* @__PURE__ */ Le(() => new Ts()), Os = /* @__PURE__ */ Uint32Array.from([
+const sn = /* @__PURE__ */ Fe(() => new ms()), bs = /* @__PURE__ */ Uint32Array.from([
   1116352408,
   1899447441,
   3049323471,
@@ -954,7 +957,7 @@ const on = /* @__PURE__ */ Le(() => new Ts()), Os = /* @__PURE__ */ Uint32Array.
   3204031479,
   3329325298
 ]), nt = /* @__PURE__ */ new Uint32Array(64);
-class As extends Ve {
+class Es extends Le {
   constructor(e) {
     super(64, e, 8, !1);
   }
@@ -975,7 +978,7 @@ class As extends Ve {
     }
     let { A: n, B: s, C: i, D: o, E: u, F: f, G: a, H: p } = this;
     for (let l = 0; l < 64; l++) {
-      const d = q(u, 6) ^ q(u, 11) ^ q(u, 25), b = p + d + Qr(u, f, a) + Os[l] + nt[l] | 0, S = (q(n, 2) ^ q(n, 13) ^ q(n, 22)) + Jr(n, s, i) | 0;
+      const d = q(u, 6) ^ q(u, 11) ^ q(u, 25), b = p + d + Zr(u, f, a) + bs[l] + nt[l] | 0, S = (q(n, 2) ^ q(n, 13) ^ q(n, 22)) + Qr(n, s, i) | 0;
       p = a, a = f, f = u, u = o + b | 0, o = i, i = s, s = n, n = b + S | 0;
     }
     n = n + this.A | 0, s = s + this.B | 0, i = i + this.C | 0, o = o + this.D | 0, u = u + this.E | 0, f = f + this.F | 0, a = a + this.G | 0, p = p + this.H | 0, this.set(n, s, i, o, u, f, a, p);
@@ -987,7 +990,7 @@ class As extends Ve {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), ht(this.buffer);
   }
 }
-class Ps extends As {
+class Ss extends Es {
   // We cannot use array here since array allows indexing by variable
   // which means optimizer/compiler cannot use registers.
   A = et[0] | 0;
@@ -1002,26 +1005,26 @@ class Ps extends As {
     super(32);
   }
 }
-const Zt = /* @__PURE__ */ Le(
-  () => new Ps(),
-  /* @__PURE__ */ ds(1)
+const Zt = /* @__PURE__ */ Fe(
+  () => new Ss(),
+  /* @__PURE__ */ cs(1)
 );
-function Is(t) {
-  return h.from(on(Uint8Array.from(t)));
+function _s(t) {
+  return h.from(sn(Uint8Array.from(t)));
 }
-function Hs(t) {
-  return h.from(gs(Uint8Array.from(t)));
+function Ts(t) {
+  return h.from(hs(Uint8Array.from(t)));
 }
 function D(t) {
   return h.from(Zt(Uint8Array.from(t)));
 }
 function C(t) {
-  return h.from(on(Zt(Uint8Array.from(t))));
+  return h.from(sn(Zt(Uint8Array.from(t))));
 }
 function it(t) {
   return h.from(Zt(Zt(Uint8Array.from(t))));
 }
-const vs = [
+const Os = [
   "BIP0340/challenge",
   "BIP0340/aux",
   "BIP0340/nonce",
@@ -1031,7 +1034,7 @@ const vs = [
   "TapTweak",
   "KeyAgg list",
   "KeyAgg coefficient"
-], un = {
+], on = {
   "BIP0340/challenge": h.from([
     123,
     181,
@@ -1628,59 +1631,59 @@ const vs = [
   ])
 };
 function Rt(t, e) {
-  return D(h.concat([un[t], e]));
+  return D(h.concat([on[t], e]));
 }
-const xs = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const As = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  TAGGED_HASH_PREFIXES: un,
-  TAGS: vs,
+  TAGGED_HASH_PREFIXES: on,
+  TAGS: Os,
   hash160: C,
   hash256: it,
-  ripemd160: Is,
-  sha1: Hs,
+  ripemd160: _s,
+  sha1: Ts,
   sha256: D,
   taggedHash: Rt
 }, Symbol.toStringTag, { value: "Module" }));
-const Us = {
+const Ps = {
   p: 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2fn,
   n: 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141n,
   b: 7n,
   Gx: 0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798n,
   Gy: 0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8n
-}, { p: ct, n: fn, Gx: ks, Gy: Ns, b: cn } = Us, Xt = 32, Oe = 64, G = (t = "") => {
+}, { p: ct, n: un, Gx: Is, Gy: Hs, b: fn } = Ps, Xt = 32, Oe = 64, G = (t = "") => {
   throw new Error(t);
-}, an = (t) => typeof t == "bigint", hn = (t) => typeof t == "string", Cs = (t) => t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array", Ct = (t, e) => !Cs(t) || typeof e == "number" && e > 0 && t.length !== e ? G("Uint8Array expected") : t, pn = (t) => new Uint8Array(t), Bs = (t) => Uint8Array.from(t), ln = (t, e) => t.toString(16).padStart(e, "0"), dn = (t) => Array.from(Ct(t)).map((e) => ln(e, 2)).join(""), J = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 }, sr = (t) => {
+}, cn = (t) => typeof t == "bigint", an = (t) => typeof t == "string", vs = (t) => t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array", Ct = (t, e) => !vs(t) || typeof e == "number" && e > 0 && t.length !== e ? G("Uint8Array expected") : t, hn = (t) => new Uint8Array(t), xs = (t) => Uint8Array.from(t), pn = (t, e) => t.toString(16).padStart(e, "0"), ln = (t) => Array.from(Ct(t)).map((e) => pn(e, 2)).join(""), J = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 }, nr = (t) => {
   if (t >= J._0 && t <= J._9)
     return t - J._0;
   if (t >= J.A && t <= J.F)
     return t - (J.A - 10);
   if (t >= J.a && t <= J.f)
     return t - (J.a - 10);
-}, wn = (t) => {
+}, dn = (t) => {
   const e = "hex invalid";
-  if (!hn(t))
+  if (!an(t))
     return G(e);
   const r = t.length, n = r / 2;
   if (r % 2)
     return G(e);
-  const s = pn(n);
+  const s = hn(n);
   for (let i = 0, o = 0; i < n; i++, o += 2) {
-    const u = sr(t.charCodeAt(o)), f = sr(t.charCodeAt(o + 1));
+    const u = nr(t.charCodeAt(o)), f = nr(t.charCodeAt(o + 1));
     if (u === void 0 || f === void 0)
       return G(e);
     s[i] = u * 16 + f;
   }
   return s;
-}, gn = (t, e) => Ct(hn(t) ? wn(t) : Bs(Ct(t)), e), ir = (...t) => {
-  const e = pn(t.reduce((n, s) => n + Ct(s).length, 0));
+}, wn = (t, e) => Ct(an(t) ? dn(t) : xs(Ct(t)), e), sr = (...t) => {
+  const e = hn(t.reduce((n, s) => n + Ct(s).length, 0));
   let r = 0;
   return t.forEach((n) => {
     e.set(n, r), r += n.length;
   }), e;
-}, Qt = BigInt, Ft = (t, e, r, n = "bad number: out of range") => an(t) && e <= t && t < r ? t : G(n), m = (t, e = ct) => {
+}, Qt = BigInt, Ft = (t, e, r, n = "bad number: out of range") => cn(t) && e <= t && t < r ? t : G(n), m = (t, e = ct) => {
   const r = t % e;
   return r >= 0n ? r : e + r;
-}, Rs = (t, e) => {
+}, Us = (t, e) => {
   (t === 0n || e <= 0n) && G("no inverse n=" + t + " mod=" + e);
   let r = m(t, e), n = e, s = 0n, i = 1n;
   for (; r !== 0n; ) {
@@ -1688,8 +1691,8 @@ const Us = {
     n = r, r = u, s = i, i = f;
   }
   return n === 1n ? m(s, e) : G("no inverse");
-}, or = (t) => t instanceof R ? t : G("Point expected"), yn = (t) => m(m(t * t) * t + cn), ur = (t) => Ft(t, 0n, ct), jt = (t) => Ft(t, 1n, ct), Fs = (t) => Ft(t, 1n, fn), Ae = (t) => (t & 1n) === 0n, mn = (t) => Uint8Array.of(t), Ls = (t) => mn(Ae(t) ? 2 : 3), Vs = (t) => {
-  const e = yn(jt(t));
+}, ir = (t) => t instanceof R ? t : G("Point expected"), gn = (t) => m(m(t * t) * t + fn), or = (t) => Ft(t, 0n, ct), jt = (t) => Ft(t, 1n, ct), ks = (t) => Ft(t, 1n, un), Ae = (t) => (t & 1n) === 0n, yn = (t) => Uint8Array.of(t), Ns = (t) => yn(Ae(t) ? 2 : 3), Cs = (t) => {
+  const e = gn(jt(t));
   let r = 1n;
   for (let n = e, s = (ct + 1n) / 4n; s > 0n; s >>= 1n)
     s & 1n && (r = r * n % ct), n = n * n % ct;
@@ -1702,23 +1705,23 @@ class R {
   py;
   pz;
   constructor(e, r, n) {
-    this.px = ur(e), this.py = jt(r), this.pz = ur(n), Object.freeze(this);
+    this.px = or(e), this.py = jt(r), this.pz = or(n), Object.freeze(this);
   }
   /** Convert Uint8Array or hex string to Point. */
   static fromBytes(e) {
     Ct(e);
     let r;
-    const n = e[0], s = e.subarray(1), i = fr(s, 0, Xt), o = e.length;
+    const n = e[0], s = e.subarray(1), i = ur(s, 0, Xt), o = e.length;
     if (o === Xt + 1 && [2, 3].includes(n)) {
-      let u = Vs(i);
+      let u = Cs(i);
       const f = Ae(u);
       Ae(Qt(n)) !== f && (u = m(-u)), r = new R(i, u, 1n);
     }
-    return o === Oe + 1 && n === 4 && (r = new R(i, fr(s, Xt, Oe), 1n)), r ? r.assertValidity() : G("bad point: not on curve");
+    return o === Oe + 1 && n === 4 && (r = new R(i, ur(s, Xt, Oe), 1n)), r ? r.assertValidity() : G("bad point: not on curve");
   }
   /** Equality check: compare points P&Q. */
   equals(e) {
-    const { px: r, py: n, pz: s } = this, { px: i, py: o, pz: u } = or(e), f = m(r * u), a = m(i * s), p = m(n * u), l = m(o * s);
+    const { px: r, py: n, pz: s } = this, { px: i, py: o, pz: u } = ir(e), f = m(r * u), a = m(i * s), p = m(n * u), l = m(o * s);
     return f === a && p === l;
   }
   is0() {
@@ -1739,7 +1742,7 @@ class R {
    */
   // prettier-ignore
   add(e) {
-    const { px: r, py: n, pz: s } = this, { px: i, py: o, pz: u } = or(e), f = 0n, a = cn;
+    const { px: r, py: n, pz: s } = this, { px: i, py: o, pz: u } = ir(e), f = 0n, a = fn;
     let p = 0n, l = 0n, d = 0n;
     const b = m(a * 3n);
     let w = m(r * i), S = m(n * o), P = m(s * u), k = m(r + n), H = m(i + o);
@@ -1757,10 +1760,10 @@ class R {
   multiply(e, r = !0) {
     if (!r && e === 0n)
       return ut;
-    if (Fs(e), e === 1n)
+    if (ks(e), e === 1n)
       return this;
     if (this.equals(wt))
-      return Ds(e).p;
+      return Vs(e).p;
     let n = ut, s = wt;
     for (let i = this; e > 0n; i = i.double(), e >>= 1n)
       e & 1n ? n = n.add(i) : r && (s = s.add(i));
@@ -1773,18 +1776,18 @@ class R {
       return { x: 0n, y: 0n };
     if (n === 1n)
       return { x: e, y: r };
-    const s = Rs(n, ct);
+    const s = Us(n, ct);
     return m(n * s) !== 1n && G("inverse invalid"), { x: m(e * s), y: m(r * s) };
   }
   /** Checks if the point is valid and on-curve. */
   assertValidity() {
     const { x: e, y: r } = this.toAffine();
-    return jt(e), jt(r), m(r * r) === yn(e) ? this : G("bad point: not on curve");
+    return jt(e), jt(r), m(r * r) === gn(e) ? this : G("bad point: not on curve");
   }
   /** Converts point to 33/65-byte Uint8Array. */
   toBytes(e = !0) {
-    const { x: r, y: n } = this.assertValidity().toAffine(), s = cr(r);
-    return e ? ir(Ls(n), s) : ir(mn(4), s, cr(n));
+    const { x: r, y: n } = this.assertValidity().toAffine(), s = fr(r);
+    return e ? sr(Ns(n), s) : sr(yn(4), s, fr(n));
   }
   /** Create 3d xyz point from 2d xy. (0, 0) => (0, 1, 0), not (0, 0, 1) */
   static fromAffine(e) {
@@ -1792,13 +1795,13 @@ class R {
     return r === 0n && n === 0n ? ut : new R(r, n, 1n);
   }
   toHex(e) {
-    return dn(this.toBytes(e));
+    return ln(this.toBytes(e));
   }
   static fromPrivateKey(e) {
-    return wt.multiply(Gs(e));
+    return wt.multiply(Rs(e));
   }
   static fromHex(e) {
-    return R.fromBytes(gn(e));
+    return R.fromBytes(wn(e));
   }
   get x() {
     return this.toAffine().x;
@@ -1810,16 +1813,16 @@ class R {
     return this.toBytes(e);
   }
 }
-const wt = new R(ks, Ns, 1n), ut = new R(0n, 1n, 0n);
+const wt = new R(Is, Hs, 1n), ut = new R(0n, 1n, 0n);
 R.BASE = wt;
 R.ZERO = ut;
-const bn = (t) => Qt("0x" + (dn(t) || "0")), fr = (t, e, r) => bn(t.subarray(e, r)), Ws = 2n ** 256n, cr = (t) => wn(ln(Ft(t, 0n, Ws), Oe)), Gs = (t) => {
-  const e = an(t) ? t : bn(gn(t, Xt));
-  return Ft(e, 1n, fn, "private key invalid 3");
-}, Jt = 8, Ks = 256, En = Math.ceil(Ks / Jt) + 1, Pe = 2 ** (Jt - 1), Ms = () => {
+const mn = (t) => Qt("0x" + (ln(t) || "0")), ur = (t, e, r) => mn(t.subarray(e, r)), Bs = 2n ** 256n, fr = (t) => dn(pn(Ft(t, 0n, Bs), Oe)), Rs = (t) => {
+  const e = cn(t) ? t : mn(wn(t, Xt));
+  return Ft(e, 1n, un, "private key invalid 3");
+}, Jt = 8, Fs = 256, bn = Math.ceil(Fs / Jt) + 1, Pe = 2 ** (Jt - 1), Ls = () => {
   const t = [];
   let e = wt, r = e;
-  for (let n = 0; n < En; n++) {
+  for (let n = 0; n < bn; n++) {
     r = e, t.push(r);
     for (let s = 1; s < Pe; s++)
       r = r.add(e), t.push(r);
@@ -1827,26 +1830,26 @@ const bn = (t) => Qt("0x" + (dn(t) || "0")), fr = (t, e, r) => bn(t.subarray(e,
   }
   return t;
 };
-let ar;
-const hr = (t, e) => {
+let cr;
+const ar = (t, e) => {
   const r = e.negate();
   return t ? r : e;
-}, Ds = (t) => {
-  const e = ar || (ar = Ms());
+}, Vs = (t) => {
+  const e = cr || (cr = Ls());
   let r = ut, n = wt;
   const s = 2 ** Jt, i = s, o = Qt(s - 1), u = Qt(Jt);
-  for (let f = 0; f < En; f++) {
+  for (let f = 0; f < bn; f++) {
     let a = Number(t & o);
     t >>= u, a > Pe && (a -= i, t += 1n);
     const p = f * Pe, l = p, d = p + Math.abs(a) - 1, b = f % 2 !== 0, w = a < 0;
-    a === 0 ? n = n.add(hr(b, e[l])) : r = r.add(hr(w, e[d]));
+    a === 0 ? n = n.add(ar(b, e[l])) : r = r.add(ar(w, e[d]));
   }
   return { p: r, f: n };
 }, Ht = (t) => {
   const e = t.length === 32 ? t : t.subarray(1, 33);
   return h.isBuffer(e) ? e : h.from(e);
 };
-function pr(t) {
+function hr(t) {
   let e = t.toString(16);
   return e = e.padStart(64, "0"), e.length > 64 && (e = e.slice(-64)), h.from(e, "hex");
 }
@@ -1863,7 +1866,7 @@ function Ie(t) {
   } catch {
     throw new Error("Invalid secp256k1 public key bytes. Cannot parse.");
   }
-  const r = pr(e.x), n = pr(e.y), i = e.y % 2n === 0n ? 6 : 7, o = h.alloc(65);
+  const r = hr(e.x), n = hr(e.y), i = e.y % 2n === 0n ? 6 : 7, o = h.alloc(65);
   o[0] = i, r.copy(o, 1), n.copy(o, 33);
   const u = h.concat([h.from([4]), r, n]);
   return {
@@ -2093,7 +2096,7 @@ function mt(t, e) {
           throw new TypeError("Redeem.output too short");
         if (a.output.byteLength > 520)
           throw new TypeError("Redeem.output unspendable if larger than 520 bytes");
-        if (Fe(p) > 201)
+        if (Re(p) > 201)
           throw new TypeError("Redeem.output unspendable with more than 201 non-push ops");
         const l = C(a.output);
         if (u.length > 0 && !u.equals(l))
@@ -2139,17 +2142,17 @@ function mt(t, e) {
   return Object.assign(n, t);
 }
 const vt = {};
-function oo(t) {
-  t ? t !== vt.eccLib && ($s(t), vt.eccLib = t) : vt.eccLib = t;
+function eo(t) {
+  t ? t !== vt.eccLib && (Ws(t), vt.eccLib = t) : vt.eccLib = t;
 }
-function He() {
+function En() {
   if (!vt.eccLib)
     throw new Error("No ECC Library provided. You must call initEccLib() with a valid TinySecp256k1Interface instance");
   return vt.eccLib;
 }
 const tt = (t) => h.from(t, "hex");
-function $s(t) {
-  L(typeof t.isXOnlyPoint == "function"), L(t.isXOnlyPoint(tt("79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"))), L(t.isXOnlyPoint(tt("fffffffffffffffffffffffffffffffffffffffffffffffffffffffeeffffc2e"))), L(t.isXOnlyPoint(tt("f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9"))), L(t.isXOnlyPoint(tt("0000000000000000000000000000000000000000000000000000000000000001"))), L(!t.isXOnlyPoint(tt("0000000000000000000000000000000000000000000000000000000000000000"))), L(!t.isXOnlyPoint(tt("fffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"))), L(typeof t.xOnlyPointAddTweak == "function"), qs.forEach((e) => {
+function Ws(t) {
+  L(typeof t.isXOnlyPoint == "function"), L(t.isXOnlyPoint(tt("79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"))), L(t.isXOnlyPoint(tt("fffffffffffffffffffffffffffffffffffffffffffffffffffffffeeffffc2e"))), L(t.isXOnlyPoint(tt("f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9"))), L(t.isXOnlyPoint(tt("0000000000000000000000000000000000000000000000000000000000000001"))), L(!t.isXOnlyPoint(tt("0000000000000000000000000000000000000000000000000000000000000000"))), L(!t.isXOnlyPoint(tt("fffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"))), L(typeof t.xOnlyPointAddTweak == "function"), Gs.forEach((e) => {
     const r = t.xOnlyPointAddTweak(tt(e.pubkey), tt(e.tweak));
     e.result === null ? L(r === null) : (L(r !== null), L(r.parity === e.parity), L(h.from(r.xOnlyPubkey).equals(tt(e.result))));
   });
@@ -2158,7 +2161,7 @@ function L(t) {
   if (!t)
     throw new Error("ecc library invalid");
 }
-const qs = [
+const Gs = [
   {
     pubkey: "79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798",
     tweak: "fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364140",
@@ -2188,15 +2191,15 @@ function _n(t, e) {
   if (Math.floor(t) !== t)
     throw new Error("value has a fractional component");
 }
-function Xs(t, e) {
+function Ks(t, e) {
   const r = t.readUInt32LE(e);
   let n = t.readUInt32LE(e + 4);
   return n *= 4294967296, _n(n + r, 9007199254740991), n + r;
 }
-function js(t, e, r) {
+function Ms(t, e, r) {
   return _n(e, 9007199254740991), t.writeInt32LE(e & -1, r), t.writeUInt32LE(Math.floor(e / 4294967296), r + 4), r + 8;
 }
-function We(t) {
+function Ve(t) {
   if (t.length < 1)
     return t;
   let e = t.length - 1, r = 0;
@@ -2204,7 +2207,7 @@ function We(t) {
     r = t[n], t[n] = t[e], t[e] = r, e--;
   return t;
 }
-function lr(t) {
+function pr(t) {
   const e = h.allocUnsafe(t.length);
   return t.copy(e), e;
 }
@@ -2225,10 +2228,10 @@ class x {
     this.offset = this.buffer.writeUInt32LE(e, this.offset);
   }
   writeUInt64(e) {
-    this.offset = js(this.buffer, e, this.offset);
+    this.offset = Ms(this.buffer, e, this.offset);
   }
   writeVarInt(e) {
-    const r = Br(e, this.buffer, this.offset);
+    const r = Cr(e, this.buffer, this.offset);
     this.offset += r.bytes;
   }
   writeSlice(e) {
@@ -2248,7 +2251,7 @@ class x {
     throw new Error(`buffer size ${this.buffer.length}, offset ${this.offset}`);
   }
 }
-class zs {
+class Ds {
   constructor(e, r = 0) {
     this.buffer = e, this.offset = r, Sn(z(V, Y), [e, r]);
   }
@@ -2265,7 +2268,7 @@ class zs {
     return this.offset += 4, e;
   }
   readUInt64() {
-    const e = Xs(this.buffer, this.offset);
+    const e = Ks(this.buffer, this.offset);
     return this.offset += 8, e;
   }
   readVarInt() {
@@ -2288,7 +2291,7 @@ class zs {
     return r;
   }
 }
-const Ge = 192, Tn = 128, Ys = (t) => "left" in t && "right" in t;
+const We = 192, Tn = 128, $s = (t) => "left" in t && "right" in t;
 function te(t, e) {
   if (t.length < 33)
     throw new TypeError(`The control-block length is too small. Got ${t.length}, expected min 33.`);
@@ -2296,7 +2299,7 @@ function te(t, e) {
   let n = e;
   for (let s = 0; s < r; s++) {
     const i = t.subarray(33 + 32 * s, 65 + 32 * s);
-    n.compare(i) < 0 ? n = ve(n, i) : n = ve(i, n);
+    n.compare(i) < 0 ? n = He(n, i) : n = He(i, n);
   }
   return n;
 }
@@ -2307,13 +2310,13 @@ function ee(t) {
   e.sort((s, i) => s.hash.compare(i.hash));
   const [r, n] = e;
   return {
-    hash: ve(r.hash, n.hash),
+    hash: He(r.hash, n.hash),
     left: r,
     right: n
   };
 }
 function Bt(t, e) {
-  if (Ys(t)) {
+  if ($s(t)) {
     const r = Bt(t.left, e);
     if (r !== void 0)
       return [...r, t.right.hash];
@@ -2324,29 +2327,29 @@ function Bt(t, e) {
     return [];
 }
 function Z(t) {
-  const e = t.version || Ge;
-  return Rt("TapLeaf", U.concat([U.from([e]), Qs(t.output)]));
+  const e = t.version || We;
+  return Rt("TapLeaf", U.concat([U.from([e]), Xs(t.output)]));
 }
-function Zs(t, e) {
+function qs(t, e) {
   return Rt("TapTweak", U.concat(e ? [t, e] : [t]));
 }
 function At(t, e) {
   if (!U.isBuffer(t) || t.length !== 32 || e && e.length !== 32)
     return null;
-  const r = Zs(t, e), n = He().xOnlyPointAddTweak(t, r);
+  const r = qs(t, e), n = En().xOnlyPointAddTweak(t, r);
   return !n || n.xOnlyPubkey === null ? null : {
     parity: n.parity,
     x: U.from(n.xOnlyPubkey)
   };
 }
-function ve(t, e) {
+function He(t, e) {
   return Rt("TapBranch", U.concat([t, e]));
 }
-function Qs(t) {
+function Xs(t) {
   const e = kt(t.length), r = U.allocUnsafe(e);
-  return Br(t.length, r), U.concat([r, t]);
+  return Cr(t.length, r), U.concat([r, t]);
 }
-const dr = E, wr = 1, Js = 80;
+const lr = E, dr = 1, js = 80;
 function bt(t, e) {
   if (!t.address && !t.output && !t.pubkey && !t.internalPubkey && !(t.witness && t.witness.length > 1))
     throw new TypeError("Not enough data");
@@ -2360,7 +2363,7 @@ function bt(t, e) {
     pubkey: c.maybe(c.BufferN(32)),
     signature: c.maybe(c.anyOf(c.BufferN(64), c.BufferN(65))),
     witness: c.maybe(c.arrayOf(c.Buffer)),
-    scriptTree: c.maybe(Re),
+    scriptTree: c.maybe(Be),
     redeem: c.maybe({
       output: c.maybe(c.Buffer),
       redeemVersion: c.maybe(c.Number),
@@ -2368,9 +2371,9 @@ function bt(t, e) {
     }),
     redeemVersion: c.maybe(c.Number)
   }, t);
-  const r = B(() => Be(t.address)), n = B(() => {
+  const r = B(() => Ce(t.address)), n = B(() => {
     if (!(!t.witness || !t.witness.length))
-      return t.witness.length >= 2 && t.witness[t.witness.length - 1][0] === Js ? t.witness.slice(0, -1) : t.witness.slice();
+      return t.witness.length >= 2 && t.witness[t.witness.length - 1][0] === js ? t.witness.slice(0, -1) : t.witness.slice();
   }), s = B(() => {
     if (t.scriptTree)
       return ee(t.scriptTree);
@@ -2384,7 +2387,7 @@ function bt(t, e) {
     if (!o.pubkey)
       return;
     const u = I.bech32m.toWords(o.pubkey);
-    return u.unshift(wr), I.bech32m.encode(i.bech32, u);
+    return u.unshift(dr), I.bech32m.encode(i.bech32, u);
   }), y(o, "hash", () => {
     const u = s();
     if (u)
@@ -2399,8 +2402,8 @@ function bt(t, e) {
     }
   }), y(o, "output", () => {
     if (o.pubkey)
-      return v([dr.OP_1, o.pubkey]);
-  }), y(o, "redeemVersion", () => t.redeemVersion ? t.redeemVersion : t.redeem && t.redeem.redeemVersion !== void 0 && t.redeem.redeemVersion !== null ? t.redeem.redeemVersion : Ge), y(o, "redeem", () => {
+      return v([lr.OP_1, o.pubkey]);
+  }), y(o, "redeemVersion", () => t.redeemVersion ? t.redeemVersion : t.redeem && t.redeem.redeemVersion !== void 0 && t.redeem.redeemVersion !== null ? t.redeem.redeemVersion : We), y(o, "redeem", () => {
     const u = n();
     if (!(!u || u.length < 2))
       return {
@@ -2456,7 +2459,7 @@ function bt(t, e) {
     if (t.address) {
       if (i && i.bech32 !== r().prefix)
         throw new TypeError("Invalid prefix or Network mismatch");
-      if (r().version !== wr)
+      if (r().version !== dr)
         throw new TypeError("Invalid address version");
       if (r().data.length !== 32)
         throw new TypeError("Invalid address data");
@@ -2468,7 +2471,7 @@ function bt(t, e) {
       u = t.pubkey;
     }
     if (t.output) {
-      if (t.output.length !== 34 || t.output[0] !== dr.OP_1 || t.output[1] !== 32)
+      if (t.output.length !== 34 || t.output[0] !== lr.OP_1 || t.output[1] !== 32)
         throw new TypeError("Output is invalid");
       if (u.length > 0 && !u.equals(t.output.subarray(2)))
         throw new TypeError("Pubkey mismatch");
@@ -2480,8 +2483,6 @@ function bt(t, e) {
         throw new TypeError("Pubkey mismatch");
       u = p.x;
     }
-    if (u && u.length && !He().isXOnlyPoint(u))
-      throw new TypeError("Invalid pubkey for p2tr");
     const f = s();
     if (t.hash && f && !t.hash.equals(f.hash))
       throw new TypeError("Hash mismatch");
@@ -2522,7 +2523,7 @@ function bt(t, e) {
         const d = p.subarray(1, 33);
         if (t.internalPubkey && !t.internalPubkey.equals(d))
           throw new TypeError("Internal pubkey mismatch");
-        if (!He().isXOnlyPoint(d))
+        if (!En().isXOnlyPoint(d))
           throw new TypeError("Invalid internalPubkey for p2tr witness");
         const b = p[0] & Pt, w = a[a.length - 2], S = Z({
           output: w,
@@ -2538,7 +2539,7 @@ function bt(t, e) {
   }
   return Object.assign(o, t);
 }
-const gr = E, ti = h.alloc(0);
+const wr = E, zs = h.alloc(0);
 function Lt(t, e) {
   if (!t.address && !t.hash && !t.output && !t.pubkey && !t.witness)
     throw new TypeError("Not enough data");
@@ -2577,7 +2578,7 @@ function Lt(t, e) {
       return C(t.pubkey || s.pubkey);
   }), y(s, "output", () => {
     if (s.hash)
-      return v([gr.OP_0, s.hash]);
+      return v([wr.OP_0, s.hash]);
   }), y(s, "pubkey", () => {
     if (t.pubkey)
       return t.pubkey;
@@ -2588,7 +2589,7 @@ function Lt(t, e) {
       return t.witness[0];
   }), y(s, "input", () => {
     if (s.witness)
-      return ti;
+      return zs;
   }), y(s, "witness", () => {
     if (t.pubkey && t.signature)
       return [t.signature, t.pubkey];
@@ -2609,7 +2610,7 @@ function Lt(t, e) {
       i = t.hash;
     }
     if (t.output) {
-      if (t.output.length !== 22 || t.output[0] !== gr.OP_0 || t.output[1] !== 20)
+      if (t.output.length !== 22 || t.output[0] !== wr.OP_0 || t.output[1] !== 20)
         throw new TypeError("Output is invalid");
       if (i.length > 0 && !i.equals(t.output.subarray(2)))
         throw new TypeError("Hash mismatch");
@@ -2640,7 +2641,7 @@ function Lt(t, e) {
   }
   return Object.assign(s, t);
 }
-const yr = E, ge = h.alloc(0);
+const gr = E, ge = h.alloc(0);
 function Kt(t) {
   return !!(h.isBuffer(t) && t.length === 65 && t[0] === 4 && W(t));
 }
@@ -2689,7 +2690,7 @@ function Et(t, e) {
       return D(i.redeem.output);
   }), y(i, "output", () => {
     if (i.hash)
-      return v([yr.OP_0, i.hash]);
+      return v([gr.OP_0, i.hash]);
   }), y(i, "redeem", () => {
     if (t.witness)
       return {
@@ -2702,7 +2703,7 @@ function Et(t, e) {
       return ge;
   }), y(i, "witness", () => {
     if (t.redeem && t.redeem.input && t.redeem.input.length > 0 && t.redeem.output && t.redeem.output.length > 0) {
-      const o = jr(n());
+      const o = Xr(n());
       return i.redeem = Object.assign({ witness: o }, t.redeem), i.redeem.input = ge, [].concat(o, t.redeem.output);
     }
     if (t.redeem && t.redeem.output && t.redeem.witness)
@@ -2727,7 +2728,7 @@ function Et(t, e) {
       o = t.hash;
     }
     if (t.output) {
-      if (t.output.length !== 34 || t.output[0] !== yr.OP_0 || t.output[1] !== 32)
+      if (t.output.length !== 34 || t.output[0] !== gr.OP_0 || t.output[1] !== 32)
         throw new TypeError("Output is invalid");
       const u = t.output.subarray(2);
       if (o.length > 0 && !o.equals(u))
@@ -2745,7 +2746,7 @@ function Et(t, e) {
           throw new TypeError("Redeem.output is invalid");
         if (t.redeem.output.byteLength > 3600)
           throw new TypeError("Redeem.output unspendable if larger than 3600 bytes");
-        if (Fe(u) > 201)
+        if (Re(u) > 201)
           throw new TypeError("Redeem.output unspendable with more than 201 non-push ops");
         const f = D(t.redeem.output);
         if (o.length > 0 && !o.equals(f))
@@ -2769,13 +2770,13 @@ function Et(t, e) {
   }
   return Object.assign(i, t);
 }
-const fe = 40, ce = 2, ae = 15, ei = 16, xe = 16, Ke = 2, Me = 80, ri = "WARNING: Sending to a future segwit version address can lead to loss of funds. End users MUST be warned carefully in the GUI and asked if they wish to proceed with caution. Wallets should verify the segwit version from the output of fromBech32, then decide when it is safe to use which version of segwit.", ni = (t) => {
+const fe = 40, ce = 2, ae = 15, Ys = 16, ve = 16, Ge = 2, Ke = 80, Zs = "WARNING: Sending to a future segwit version address can lead to loss of funds. End users MUST be warned carefully in the GUI and asked if they wish to proceed with caution. Wallets should verify the segwit version from the output of fromBech32, then decide when it is safe to use which version of segwit.", Qs = (t) => {
   try {
     const e = h.from(t.subarray(2));
     if (e.length < ce || e.length > fe)
       throw new TypeError("Invalid program length for segwit address");
-    const r = t[0] - Me;
-    if (r < Ke || r > ae + 1)
+    const r = t[0] - Ke;
+    if (r < Ge || r > ae + 1)
       throw new TypeError("Invalid version for segwit address");
     if (r === 1)
       throw new TypeError("taproot");
@@ -2784,7 +2785,7 @@ const fe = 40, ce = 2, ae = 15, ei = 16, xe = 16, Ke = 2, Me = 80, ri = "WARNING
   }
   return !1;
 };
-function si(t, e) {
+function Js(t, e) {
   if (!h.isBuffer(t))
     throw new TypeError("output must be a Buffer");
   if (!e.bech32Opnet)
@@ -2801,23 +2802,23 @@ function si(t, e) {
   if (i.length < ce || i.length > fe)
     throw new TypeError("Invalid program length for segwit address");
   const o = r === E.OP_0 ? 0 : r >= E.OP_1 && r <= E.OP_16 ? r - (E.OP_1 - 1) : -1;
-  if (o < ae || o > ei)
+  if (o < ae || o > Ys)
     throw new TypeError(`Invalid segwit version ${o}`);
   const u = [o, ...I.bech32m.toWords(i)];
   return I.bech32m.encode(e.bech32Opnet, u);
 }
-function ii(t, e) {
+function ti(t, e) {
   const r = h.from(t.subarray(2));
   if (r.length < ce || r.length > fe)
     throw new TypeError("Invalid program length for segwit address");
-  const n = t[0] - Me;
-  if (n < Ke || n > ae)
+  const n = t[0] - Ke;
+  if (n < Ge || n > ae)
     throw new TypeError("Invalid version for segwit address");
   if (t[1] !== r.length)
     throw new TypeError(`Invalid script for segwit address ${t[1]} !== ${r.length}`);
-  return ui(r, n, e.bech32, e.bech32Opnet);
+  return ri(r, n, e.bech32, e.bech32Opnet);
 }
-function oi(t) {
+function ei(t) {
   const e = h.from(Ut.decode(t));
   if (e.length < 21)
     throw new TypeError(t + " is too short");
@@ -2826,11 +2827,11 @@ function oi(t) {
   const r = e.readUInt8(0), n = h.from(e.subarray(1));
   return { version: r, hash: n };
 }
-function ui(t, e, r, n) {
+function ri(t, e, r, n) {
   const s = I.bech32.toWords(t);
-  return s.unshift(e), e === xe && n ? I.bech32m.encode(n, s) : e === 0 ? I.bech32.encode(r, s) : I.bech32m.encode(r, s);
+  return s.unshift(e), e === ve && n ? I.bech32m.encode(n, s) : e === 0 ? I.bech32.encode(r, s) : I.bech32m.encode(r, s);
 }
-function fi(t, e) {
+function ni(t, e) {
   e = e || M;
   try {
     return yt({ output: t, network: e }).address;
@@ -2853,20 +2854,20 @@ function fi(t, e) {
   } catch {
   }
   try {
-    return si(t, e);
+    return Js(t, e);
   } catch {
   }
   try {
-    return ii(t, e);
+    return ti(t, e);
   } catch {
   }
-  throw new Error(Xr(t) + " has no matching Address");
+  throw new Error(qr(t) + " has no matching Address");
 }
-function ci(t, e) {
+function si(t, e) {
   e = e || M;
   let r, n;
   try {
-    r = oi(t);
+    r = ei(t);
   } catch {
   }
   if (r) {
@@ -2876,7 +2877,7 @@ function ci(t, e) {
       return mt({ hash: r.hash }).output;
   } else {
     try {
-      n = Be(t);
+      n = Ce(t);
     } catch {
     }
     if (n) {
@@ -2890,24 +2891,24 @@ function ci(t, e) {
       } else if (n.version === 1) {
         if (n.data.length === 32)
           return bt({ pubkey: n.data }).output;
-      } else if (n.version === xe) {
+      } else if (n.version === ve) {
         if (!e.bech32Opnet)
           throw new Error(t + " has an invalid prefix");
-        return Yr({
+        return zr({
           program: n.data,
           network: e
         }).output;
-      } else if (n.version >= Ke && n.version <= ae && n.data.length >= ce && n.data.length <= fe)
-        return n.version !== xe && console.warn(ri), v([
-          n.version + Me,
+      } else if (n.version >= Ge && n.version <= ae && n.data.length >= ce && n.data.length <= fe)
+        return n.version !== ve && console.warn(Zs), v([
+          n.version + Ke,
           n.data
         ]);
     }
   }
   throw new TypeError(t + " has no matching Script");
 }
-const mr = E;
-function ai(t, e) {
+const yr = E;
+function ii(t, e) {
   if (!t.data && !t.output)
     throw new TypeError("Not enough data");
   e = Object.assign({ validate: !0 }, e || {}), c({
@@ -2918,7 +2919,7 @@ function ai(t, e) {
   const r = t.network || M, n = { name: K.Embed, network: r, data: [] };
   if (y(n, "output", () => {
     if (t.data)
-      return v([mr.OP_RETURN].concat(t.data));
+      return v([yr.OP_RETURN].concat(t.data));
   }), y(n, "data", () => {
     if (!t.output)
       return;
@@ -2927,7 +2928,7 @@ function ai(t, e) {
       return s.slice(1);
   }), e.validate && t.output) {
     const s = A(t.output);
-    if (s[0] !== mr.OP_RETURN)
+    if (s[0] !== yr.OP_RETURN)
       throw new TypeError("Output is invalid");
     if (!s.slice(1).every(c.Buffer))
       throw new TypeError("Output is invalid");
@@ -3032,8 +3033,8 @@ function Vt(t, e) {
   }
   return Object.assign(s, t);
 }
-const br = E;
-function De(t, e) {
+const mr = E;
+function Me(t, e) {
   if (!t.input && !t.output && !t.pubkey && !t.input && !t.signature)
     throw new TypeError("Not enough data");
   e = Object.assign({ validate: !0 }, e || {}), c({
@@ -3050,7 +3051,7 @@ function De(t, e) {
   };
   if (y(s, "output", () => {
     if (t.pubkey)
-      return v([t.pubkey, br.OP_CHECKSIG]);
+      return v([t.pubkey, mr.OP_CHECKSIG]);
   }), y(s, "pubkey", () => {
     if (t.output)
       return t.output.subarray(1, -1);
@@ -3065,7 +3066,7 @@ function De(t, e) {
       return [];
   }), e.validate) {
     if (t.output) {
-      if (t.output[t.output.length - 1] !== br.OP_CHECKSIG)
+      if (t.output[t.output.length - 1] !== mr.OP_CHECKSIG)
         throw new TypeError("Output is invalid");
       if (!W(s.pubkey))
         throw new TypeError("Output pubkey is invalid");
@@ -3083,18 +3084,18 @@ function De(t, e) {
   }
   return Object.assign(s, t);
 }
-const hi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const oi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  LEAF_VERSION_TAPSCRIPT: Ge,
+  LEAF_VERSION_TAPSCRIPT: We,
   MAX_TAPTREE_DEPTH: Tn,
   get PaymentType() {
     return K;
   },
   findScriptPath: Bt,
-  p2data: ai,
+  p2data: ii,
   p2ms: Vt,
-  p2op: Yr,
-  p2pk: De,
+  p2op: zr,
+  p2pk: Me,
   p2pkh: yt,
   p2sh: mt,
   p2tr: bt,
@@ -3111,15 +3112,15 @@ function j(t) {
   const e = t.length;
   return kt(e) + e;
 }
-function pi(t) {
+function ui(t) {
   const e = t.length;
   return kt(e) + t.reduce((r, n) => r + j(n), 0);
 }
-const ot = h.allocUnsafe(0), Er = [], ye = h.from("0000000000000000000000000000000000000000000000000000000000000000", "hex"), Sr = h.from("0000000000000000000000000000000000000000000000000000000000000001", "hex"), li = h.from("ffffffffffffffff", "hex"), di = {
+const ot = h.allocUnsafe(0), br = [], ye = h.from("0000000000000000000000000000000000000000000000000000000000000000", "hex"), Er = h.from("0000000000000000000000000000000000000000000000000000000000000001", "hex"), fi = h.from("ffffffffffffffff", "hex"), ci = {
   script: ot,
-  valueBuffer: li
+  valueBuffer: fi
 };
-function wi(t) {
+function ai(t) {
   return "value" in t;
 }
 class g {
@@ -3127,7 +3128,7 @@ class g {
     this.version = 1, this.locktime = 0, this.ins = [], this.outs = [];
   }
   static fromBuffer(e, r) {
-    const n = new zs(e), s = new g();
+    const n = new Ds(e), s = new g();
     s.version = n.readInt32();
     const i = n.readUInt8(), o = n.readUInt8();
     let u = !1;
@@ -3140,7 +3141,7 @@ class g {
         index: d,
         script: b,
         sequence: w,
-        witness: Er
+        witness: br
       });
     }
     const a = n.readVarInt();
@@ -3175,12 +3176,12 @@ class g {
     return this.ins.length === 1 && g.isCoinbaseHash(this.ins[0].hash);
   }
   addInput(e, r, n, s) {
-    return X(z(_e, Y, Te(Y), Te(V)), [e, r, n, s]), Mr(n) && (n = g.DEFAULT_SEQUENCE), this.ins.push({
+    return X(z(_e, Y, Te(Y), Te(V)), [e, r, n, s]), Kr(n) && (n = g.DEFAULT_SEQUENCE), this.ins.push({
       hash: e,
       index: r,
       script: s || ot,
       sequence: n,
-      witness: Er
+      witness: br
     }) - 1;
   }
   addOutput(e, r) {
@@ -3201,7 +3202,7 @@ class g {
   }
   byteLength(e = !0) {
     const r = e && this.hasWitnesses();
-    return (r ? 10 : 8) + kt(this.ins.length) + kt(this.outs.length) + this.ins.reduce((n, s) => n + 40 + j(s.script), 0) + this.outs.reduce((n, s) => n + 8 + j(s.script), 0) + (r ? this.ins.reduce((n, s) => n + pi(s.witness), 0) : 0);
+    return (r ? 10 : 8) + kt(this.ins.length) + kt(this.outs.length) + this.ins.reduce((n, s) => n + 40 + j(s.script), 0) + this.outs.reduce((n, s) => n + 8 + j(s.script), 0) + (r ? this.ins.reduce((n, s) => n + ui(s.witness), 0) : 0);
   }
   clone() {
     const e = new g();
@@ -3222,7 +3223,7 @@ class g {
       r,
       n
     ]), e >= this.ins.length)
-      return Sr;
+      return Er;
     const s = A(r);
     if (!s)
       throw new Error("Could not decompile prevOutScript");
@@ -3233,10 +3234,10 @@ class g {
       });
     else if ((n & 31) === g.SIGHASH_SINGLE) {
       if (e >= this.outs.length)
-        return Sr;
+        return Er;
       o.outs.length = e + 1;
       for (let f = 0; f < e; f++)
-        o.outs[f] = di;
+        o.outs[f] = ci;
       o.ins.forEach((f, a) => {
         a !== e && (f.sequence = 0);
       });
@@ -3312,7 +3313,7 @@ class g {
     return e && this.isCoinbase() ? h.alloc(32, 0) : it(this.__toBuffer(void 0, void 0, e));
   }
   getId() {
-    return We(this.getHash(!1)).toString("hex");
+    return Ve(this.getHash(!1)).toString("hex");
   }
   toBuffer(e, r) {
     return this.__toBuffer(e, r, !0);
@@ -3334,7 +3335,7 @@ class g {
     return i && (s.writeUInt8(g.ADVANCED_TRANSACTION_MARKER), s.writeUInt8(g.ADVANCED_TRANSACTION_FLAG)), s.writeVarInt(this.ins.length), this.ins.forEach((o) => {
       s.writeSlice(o.hash), s.writeUInt32(o.index), s.writeVarSlice(o.script), s.writeUInt32(o.sequence);
     }), s.writeVarInt(this.outs.length), this.outs.forEach((o) => {
-      wi(o) ? s.writeUInt64(o.value) : s.writeSlice(o.valueBuffer), s.writeVarSlice(o.script);
+      ai(o) ? s.writeUInt64(o.value) : s.writeSlice(o.valueBuffer), s.writeVarSlice(o.script);
     }), i && this.ins.forEach((o) => {
       s.writeVector(o.witness);
     }), s.writeUInt32(this.locktime), r !== void 0 ? e.subarray(r, s.offset) : e;
@@ -3362,7 +3363,7 @@ function pt(t) {
     }
   };
 }
-const gi = pt(Vt), yi = pt(De), mi = pt(yt), he = pt(Lt), _r = pt(Et), On = pt(mt), An = pt(bt), uo = (t) => t.length === 4 && t[0] === 81 && t[1] === 2 && t[2] === 78 && t[3] === 115;
+const hi = pt(Vt), pi = pt(Me), li = pt(yt), he = pt(Lt), Sr = pt(Et), On = pt(mt), An = pt(bt), ro = (t) => t.length === 4 && t[0] === 81 && t[1] === 2 && t[2] === 78 && t[3] === 115;
 function xt(t) {
   let e = h.allocUnsafe(0);
   function r(o) {
@@ -3395,8 +3396,8 @@ function Pn(t, e) {
 function pe(t, e) {
   return Pn(t, e) !== -1;
 }
-function bi(t, e) {
-  return Ei(t).some((n) => In(n, dt.decode, e));
+function di(t, e) {
+  return wi(t).some((n) => In(n, dt.decode, e));
 }
 function In(t, e, r) {
   const { hashType: n } = e(t), s = [];
@@ -3410,25 +3411,25 @@ function In(t, e, r) {
   }
   return s.indexOf(r) === -1;
 }
-function Ei(t) {
+function wi(t) {
   const { partialSig: e } = t;
   let r;
   if (!e || e.length === 0) {
     if (!t.finalScriptSig && !t.finalScriptWitness)
       return [];
-    r = Si(t);
+    r = gi(t);
   } else
     r = e;
   return r.map((n) => n.signature);
 }
-function Si(t) {
+function gi(t) {
   const e = t.finalScriptSig ? A(t.finalScriptSig) || [] : [], r = t.finalScriptWitness ? A(t.finalScriptWitness) || [] : [];
   return e.concat(r).filter((n) => h.isBuffer(n) && Q(n)).map((n) => ({ signature: n }));
 }
-function Tr(t, e, r) {
-  const n = Bi(e, t, r);
+function _r(t, e, r) {
+  const n = xi(e, t, r);
   try {
-    const i = Ni(e, n).concat(n.script).concat(n.controlBlock);
+    const i = Hi(e, n).concat(n.script).concat(n.controlBlock);
     return { finalScriptWitness: xt(i) };
   } catch (s) {
     throw new Error(`Can not finalize taproot input #${t}: ${s}`);
@@ -3444,24 +3445,24 @@ function $(t) {
 function me(t, e) {
   return t && !!(t.tapInternalKey || t.tapTree || t.tapBip32Derivation && t.tapBip32Derivation.length || e);
 }
-function Or(t, e, r) {
-  xi(t, e, r), ki(t, e, r);
+function Tr(t, e, r) {
+  Ai(t, e, r), Ii(t, e, r);
 }
-function Ar(t, e, r) {
-  Ui(t, e, r), _i(t, e);
+function Or(t, e, r) {
+  Pi(t, e, r), yi(t, e);
 }
-function _i(t, e) {
+function yi(t, e) {
   if (!e.tapTree && !e.tapInternalKey)
     return;
   const r = e.tapInternalKey || t.tapInternalKey, n = e.tapTree || t.tapTree;
   if (r) {
-    const s = t.script, i = Ti(r, n);
+    const s = t.script, i = mi(r, n);
     if (s && !s.equals(i))
       throw new Error("Error adding output. Script or address missmatch.");
   }
 }
-function Ti(t, e) {
-  const r = e && Oi(e.leaves), { output: n } = bt({
+function mi(t, e) {
+  const r = e && bi(e.leaves), { output: n } = bt({
     internalPubkey: t,
     scriptTree: r
   });
@@ -3469,44 +3470,44 @@ function Ti(t, e) {
     throw new Error("Failed to generate taproot script pubkey");
   return n;
 }
-function Oi(t = []) {
+function bi(t = []) {
   return t.length === 1 && t[0].depth === 0 ? {
     output: t[0].script,
     version: t[0].leafVersion
-  } : vi(t);
+  } : Oi(t);
 }
-function Ai(t, e) {
-  return Ii(t).some((n) => In(n, Pi, e));
+function Ei(t, e) {
+  return _i(t).some((n) => In(n, Si, e));
 }
-function Pi(t) {
+function Si(t) {
   return {
     signature: t.subarray(0, 64),
     hashType: t.subarray(64)[0] || g.SIGHASH_DEFAULT
   };
 }
-function Ii(t) {
+function _i(t) {
   const e = [];
   if (t.tapKeySig && e.push(t.tapKeySig), t.tapScriptSig && e.push(...t.tapScriptSig.map((r) => r.signature)), !e.length) {
-    const r = Hi(t.finalScriptWitness);
+    const r = Ti(t.finalScriptWitness);
     r && e.push(r);
   }
   return e;
 }
-function Hi(t) {
+function Ti(t) {
   if (!t)
     return;
   const e = t.subarray(2);
   if (e.length === 64 || e.length === 65)
     return e;
 }
-function vi(t) {
+function Oi(t) {
   let e;
   for (const r of t)
-    if (e = Ue(r, e), !e)
+    if (e = xe(r, e), !e)
       throw new Error("No room left to insert tapleaf in tree");
   return e;
 }
-function Ue(t, e, r = 0) {
+function xe(t, e, r = 0) {
   if (r > Tn)
     throw new Error("Max taptree depth exceeded.");
   if (t.depth === r)
@@ -3516,24 +3517,24 @@ function Ue(t, e, r = 0) {
     };
   if (ne(e))
     return;
-  const n = Ue(t, e && e[0], r + 1);
+  const n = xe(t, e && e[0], r + 1);
   if (n)
     return [n, e && e[1]];
-  const s = Ue(t, e && e[1], r + 1);
+  const s = xe(t, e && e[1], r + 1);
   if (s)
     return [e && e[0], s];
 }
-function xi(t, e, r) {
+function Ai(t, e, r) {
   const n = $(t) && gt(e), s = gt(t) && $(e), i = t === e && $(e) && gt(e);
   if (n || s || i)
     throw new Error(`Invalid arguments for Psbt.${r}. Cannot use both taproot and non-taproot fields.`);
 }
-function Ui(t, e, r) {
+function Pi(t, e, r) {
   const n = me(t) && gt(e), s = gt(t) && me(e), i = t === e && me(e) && gt(e);
   if (n || s || i)
     throw new Error(`Invalid arguments for Psbt.${r}. Cannot use both taproot and non-taproot fields.`);
 }
-function ki(t, e, r) {
+function Ii(t, e, r) {
   if (e.tapMerkleRoot) {
     const n = (e.tapLeafScript || []).every((i) => be(i, e.tapMerkleRoot)), s = (t.tapLeafScript || []).every((i) => be(i, e.tapMerkleRoot));
     if (!n || !s)
@@ -3550,28 +3551,28 @@ function be(t, e) {
   });
   return te(t.controlBlock, r).equals(e);
 }
-function Ni(t, e) {
+function Hi(t, e) {
   const r = Z({
     output: e.script,
     version: e.leafVersion
   });
-  return (t.tapScriptSig || []).filter((n) => n.leafHash.equals(r)).map((n) => Ci(e.script, n)).sort((n, s) => s.positionInScript - n.positionInScript).map((n) => n.signature);
+  return (t.tapScriptSig || []).filter((n) => n.leafHash.equals(r)).map((n) => vi(e.script, n)).sort((n, s) => s.positionInScript - n.positionInScript).map((n) => n.signature);
 }
-function Ci(t, e) {
+function vi(t, e) {
   return Object.assign({
     positionInScript: Pn(e.pubkey, t)
   }, e);
 }
-function Bi(t, e, r) {
+function xi(t, e, r) {
   const { tapScriptSig: n } = t;
   if (!n || !n.length)
     throw new Error(`Can not finalize taproot input #${e}. No tapleaf script signature provided.`);
-  const s = (t.tapLeafScript || []).sort((i, o) => i.controlBlock.length - o.controlBlock.length).find((i) => Ri(i, n, r));
+  const s = (t.tapLeafScript || []).sort((i, o) => i.controlBlock.length - o.controlBlock.length).find((i) => Ui(i, n, r));
   if (!s)
     throw new Error(`Can not finalize taproot input #${e}. Signature for tapleaf script not found.`);
   return s;
 }
-function Ri(t, e, r) {
+function Ui(t, e, r) {
   const n = Z({
     output: t.script,
     version: t.leafVersion
@@ -3581,13 +3582,13 @@ function Ri(t, e, r) {
 function gt(t) {
   return t && !!(t.redeemScript || t.witnessScript || t.bip32Derivation && t.bip32Derivation.length);
 }
-const Pr = Se.decode, Fi = {
+const Ar = Se.decode, ki = {
   network: M,
   maximumFeeRate: 5e3
 };
-class ke {
-  constructor(e = {}, r = new qe.Psbt(new Hn())) {
-    this.data = r, this.opts = Object.assign({}, Fi, e), this.__CACHE = {
+class Ue {
+  constructor(e = {}, r = new $e.Psbt(new Hn())) {
+    this.data = r, this.opts = Object.assign({}, ki, e), this.__CACHE = {
       __NON_WITNESS_UTXO_TX_CACHE: [],
       __NON_WITNESS_UTXO_BUF_CACHE: [],
       __TX_IN_CACHE: {},
@@ -3619,7 +3620,7 @@ class ke {
   }
   get txInputs() {
     return this.__CACHE.__TX.ins.map((e) => ({
-      hash: lr(e.hash),
+      hash: pr(e.hash),
       index: e.index,
       sequence: e.sequence
     }));
@@ -3628,11 +3629,11 @@ class ke {
     return this.__CACHE.__TX.outs.map((e) => {
       let r;
       try {
-        r = fi(e.script, this.opts.network);
+        r = ni(e.script, this.opts.network);
       } catch {
       }
       return {
-        script: lr(e.script),
+        script: pr(e.script),
         value: e.value,
         address: r
       };
@@ -3647,15 +3648,15 @@ class ke {
     return this.fromBuffer(n, r);
   }
   static fromBuffer(e, r = {}) {
-    const n = qe.Psbt.fromBuffer(e, Li), s = new ke(r, n);
-    return Mi(s.__CACHE.__TX, s.__CACHE), s;
+    const n = $e.Psbt.fromBuffer(e, Ni), s = new Ue(r, n);
+    return Li(s.__CACHE.__TX, s.__CACHE), s;
   }
   combine(...e) {
     return this.data.combine(...e.map((r) => r.data)), this;
   }
   clone() {
     const e = JSON.parse(JSON.stringify(this.opts));
-    return ke.fromBuffer(this.data.toBuffer(), e);
+    return Ue.fromBuffer(this.data.toBuffer(), e);
   }
   setMaximumFeeRate(e) {
     $t(e), this.opts.maximumFeeRate = e;
@@ -3686,13 +3687,13 @@ class ke {
   addInput(e, r = !0) {
     if (!e || e.hash === void 0 || e.index === void 0)
       throw new Error("Invalid arguments for Psbt.addInput. Requires single object with at least [hash] and [index]");
-    Or(e, e, "addInput"), r && Tt(this.data.inputs, "addInput"), e.witnessScript && re(e.witnessScript);
+    Tr(e, e, "addInput"), r && Tt(this.data.inputs, "addInput"), e.witnessScript && re(e.witnessScript);
     const n = this.__CACHE;
     this.data.addInput(e);
     const s = n.__TX.ins[n.__TX.ins.length - 1];
     Un(n, s);
     const i = this.data.inputs.length - 1, o = this.data.inputs[i];
-    return o.nonWitnessUtxo && Ce(this.__CACHE, o, i), n.__FEE = void 0, n.__FEE_RATE = void 0, n.__EXTRACTED_TX = void 0, this;
+    return o.nonWitnessUtxo && Ne(this.__CACHE, o, i), n.__FEE = void 0, n.__FEE_RATE = void 0, n.__EXTRACTED_TX = void 0, this;
   }
   addOutputs(e) {
     return e.forEach((r) => this.addOutput(r)), this;
@@ -3702,10 +3703,10 @@ class ke {
     if (arguments.length > 1 || !e || e.value === void 0 || !r && !n)
       throw new Error("Invalid arguments for Psbt.addOutput. Requires single object with at least [script or address] and [value]");
     if (Tt(this.data.inputs, "addOutput"), r) {
-      const { address: i } = e, { network: o } = this.opts, u = ci(i, o);
+      const { address: i } = e, { network: o } = this.opts, u = si(i, o);
       e = Object.assign({}, e, { script: u });
     }
-    Ar(e, e, "addOutput");
+    Or(e, e, "addOutput");
     const s = this.__CACHE;
     return this.data.addOutput(e), s.__FEE = void 0, s.__FEE_RATE = void 0, s.__EXTRACTED_TX = void 0, this;
   }
@@ -3713,16 +3714,16 @@ class ke {
     if (r && (this.data.inputs = this.data.inputs.filter((i) => !i.partialSig)), !this.data.inputs.every(vn))
       throw new Error("Not finalized");
     const n = this.__CACHE;
-    if (e || Wi(this, n, this.opts), n.__EXTRACTED_TX)
+    if (e || Bi(this, n, this.opts), n.__EXTRACTED_TX)
       return n.__EXTRACTED_TX;
     const s = n.__TX.clone();
     return Fn(this.data.inputs, s, n, !0, r), s;
   }
   getFeeRate(e = !1) {
-    return Ur("__FEE_RATE", "fee rate", this.data.inputs, this.__CACHE, e);
+    return xr("__FEE_RATE", "fee rate", this.data.inputs, this.__CACHE, e);
   }
   getFee(e = !1) {
-    return Ur("__FEE", "fee", this.data.inputs, this.__CACHE, e);
+    return xr("__FEE", "fee", this.data.inputs, this.__CACHE, e);
   }
   finalizeAllInputs() {
     return N.checkForInput(this.data.inputs, 0), Ot(this.data.inputs.length).forEach((e) => this.finalizeInput(e)), this;
@@ -3731,30 +3732,30 @@ class ke {
     const s = N.checkForInput(this.data.inputs, e);
     return $(s) ? this._finalizeTaprootInput(e, s, void 0, r) : this._finalizeInput(e, s, r, n ?? !0);
   }
-  finalizeTaprootInput(e, r, n = Tr) {
+  finalizeTaprootInput(e, r, n = _r) {
     const s = N.checkForInput(this.data.inputs, e);
     if ($(s))
       return this._finalizeTaprootInput(e, s, r, n);
     throw new Error(`Cannot finalize input #${e}. Not Taproot.`);
   }
   getInputType(e) {
-    const r = N.checkForInput(this.data.inputs, e), n = Ln(e, r, this.__CACHE), s = de(n, e, "input", r.redeemScript || Ji(r.finalScriptSig), r.witnessScript || to(r.finalScriptWitness)), i = s.type === "raw" ? "" : s.type + "-", o = Wn(s.meaningfulScript);
+    const r = N.checkForInput(this.data.inputs, e), n = Ln(e, r, this.__CACHE), s = de(n, e, "input", r.redeemScript || ji(r.finalScriptSig), r.witnessScript || zi(r.finalScriptWitness)), i = s.type === "raw" ? "" : s.type + "-", o = Wn(s.meaningfulScript);
     return i + o;
   }
   inputHasPubkey(e, r) {
     const n = N.checkForInput(this.data.inputs, e);
-    return Zi(r, n, e, this.__CACHE);
+    return qi(r, n, e, this.__CACHE);
   }
   inputHasHDKey(e, r) {
-    const n = N.checkForInput(this.data.inputs, e), s = Hr(r);
+    const n = N.checkForInput(this.data.inputs, e), s = Ir(r);
     return !!n.bip32Derivation && n.bip32Derivation.some(s);
   }
   outputHasPubkey(e, r) {
     const n = N.checkForOutput(this.data.outputs, e);
-    return Qi(r, n, e, this.__CACHE);
+    return Xi(r, n, e, this.__CACHE);
   }
   outputHasHDKey(e, r) {
-    const n = N.checkForOutput(this.data.outputs, e), s = Hr(r);
+    const n = N.checkForOutput(this.data.outputs, e), s = Ir(r);
     return !!n.bip32Derivation && n.bip32Derivation.some(s);
   }
   validateSignaturesOfAllInputs(e) {
@@ -3799,13 +3800,13 @@ class ke {
   signInputHD(e, r, n = [g.SIGHASH_ALL]) {
     if (!r || !r.publicKey || !r.fingerprint)
       throw new Error("Need HDSigner to sign input");
-    return Cr(e, this.data.inputs, r).forEach((i) => this.signInput(e, i, n)), this;
+    return Nr(e, this.data.inputs, r).forEach((i) => this.signInput(e, i, n)), this;
   }
   signInputHDAsync(e, r, n = [g.SIGHASH_ALL]) {
     return new Promise((s, i) => {
       if (!r || !r.publicKey || !r.fingerprint)
         return i(new Error("Need HDSigner to sign input"));
-      const u = Cr(e, this.data.inputs, r).map((f) => this.signInputAsync(e, f, n));
+      const u = Nr(e, this.data.inputs, r).map((f) => this.signInputAsync(e, f, n));
       return Promise.all(u).then(() => {
         s();
       }).catch(i);
@@ -3888,11 +3889,11 @@ class ke {
     return this.data.updateGlobal(e), this;
   }
   updateInput(e, r) {
-    return r.witnessScript && re(r.witnessScript), Or(this.data.inputs[e], r, "updateInput"), this.data.updateInput(e, r), r.nonWitnessUtxo && Ce(this.__CACHE, this.data.inputs[e], e), this;
+    return r.witnessScript && re(r.witnessScript), Tr(this.data.inputs[e], r, "updateInput"), this.data.updateInput(e, r), r.nonWitnessUtxo && Ne(this.__CACHE, this.data.inputs[e], e), this;
   }
   updateOutput(e, r) {
     const n = this.data.outputs[e];
-    return Ar(n, r, "updateOutput"), this.data.updateOutput(e, r), this;
+    return Or(n, r, "updateOutput"), this.data.updateOutput(e, r), this;
   }
   addUnknownKeyValToGlobal(e) {
     return this.data.addUnknownKeyValToGlobal(e), this;
@@ -3909,22 +3910,22 @@ class ke {
   checkTaprootHashesForSig(e, r, n, s, i) {
     if (typeof n.signSchnorr != "function")
       throw new Error(`Need Schnorr Signer to sign taproot input #${e}.`);
-    const o = h.isBuffer(n.publicKey) ? n.publicKey : h.from(n.publicKey), u = Ne(e, r, this.data.inputs, o, this.__CACHE, s, i);
+    const o = h.isBuffer(n.publicKey) ? n.publicKey : h.from(n.publicKey), u = ke(e, r, this.data.inputs, o, this.__CACHE, s, i);
     if (!u || !u.length)
       throw new Error(`Can not sign for input #${e} with the key ${o.toString("hex")}`);
     return u;
   }
-  _finalizeInput(e, r, n = Di, s = !0) {
-    const { script: i, isP2SH: o, isP2WSH: u, isSegwit: f } = ji(e, r, this.__CACHE);
+  _finalizeInput(e, r, n = Vi, s = !0) {
+    const { script: i, isP2SH: o, isP2WSH: u, isSegwit: f } = Mi(e, r, this.__CACHE);
     if (!i)
       throw new Error(`No script found for input #${e}`);
-    Gi(r);
+    Ri(r);
     const { finalScriptSig: a, finalScriptWitness: p } = n(e, r, i, f, o, u, s);
     if (a && this.data.updateInput(e, { finalScriptSig: a }), p && this.data.updateInput(e, { finalScriptWitness: p }), !a && !p)
       throw new Error(`Unknown error finalizing input #${e}`);
     return this.data.clearFinalizedInput(e), this;
   }
-  _finalizeTaprootInput(e, r, n, s = Tr) {
+  _finalizeTaprootInput(e, r, n, s = _r) {
     if (!r.witnessUtxo)
       throw new Error(`Cannot finalize input #${e}. Missing witness utxo.`);
     if (r.tapKeySig) {
@@ -3968,13 +3969,13 @@ class ke {
     if (typeof r != "function")
       throw new Error("Need validator function to validate signatures");
     n = n && Ht(n);
-    const u = n ? Ne(e, s, this.data.inputs, n, this.__CACHE) : qi(e, s, this.data.inputs, this.__CACHE);
+    const u = n ? ke(e, s, this.data.inputs, n, this.__CACHE) : Gi(e, s, this.data.inputs, this.__CACHE);
     if (!u.length)
       throw new Error("No signatures for this pubkey");
     const f = u.find((p) => !p.leafHash);
     let a = 0;
     if (i && f) {
-      if (!r(f.pubkey, f.hash, Nr(i)))
+      if (!r(f.pubkey, f.hash, kr(i)))
         return !1;
       a++;
     }
@@ -3982,7 +3983,7 @@ class ke {
       for (const p of o) {
         const l = u.find((d) => p.pubkey.equals(d.pubkey));
         if (l) {
-          if (!r(p.pubkey, l.hash, Nr(p.signature)))
+          if (!r(p.pubkey, l.hash, kr(p.signature)))
             return !1;
           a++;
         }
@@ -3990,7 +3991,7 @@ class ke {
     return a > 0;
   }
   _signInput(e, r, n = [g.SIGHASH_ALL]) {
-    const s = h.isBuffer(r.publicKey) ? r.publicKey : h.from(r.publicKey), { hash: i, sighashType: o } = kr(this.data.inputs, e, s, this.__CACHE, n), u = r.sign(i), f = [
+    const s = h.isBuffer(r.publicKey) ? r.publicKey : h.from(r.publicKey), { hash: i, sighashType: o } = Ur(this.data.inputs, e, s, this.__CACHE, n), u = r.sign(i), f = [
       {
         pubkey: s,
         signature: dt.encode(h.isBuffer(u) ? u : h.from(u), o)
@@ -4007,7 +4008,7 @@ class ke {
     return p && this.data.updateInput(e, { tapKeySig: p }), l.length && this.data.updateInput(e, { tapScriptSig: l }), this;
   }
   _signInputAsync(e, r, n = [g.SIGHASH_ALL]) {
-    const s = h.isBuffer(r.publicKey) ? r.publicKey : h.from(r.publicKey), { hash: i, sighashType: o } = kr(this.data.inputs, e, s, this.__CACHE, n);
+    const s = h.isBuffer(r.publicKey) ? r.publicKey : h.from(r.publicKey), { hash: i, sighashType: o } = Ur(this.data.inputs, e, s, this.__CACHE, n);
     return Promise.resolve(r.sign(i)).then((u) => {
       const f = h.isBuffer(u) ? u : h.from(u), a = [
         {
@@ -4045,10 +4046,10 @@ class ke {
       this.data.updateInput(e, w);
   }
 }
-const Li = (t) => new Hn(t);
+const Ni = (t) => new Hn(t);
 class Hn {
   constructor(e = h.from([2, 0, 0, 0, 0, 0, 0, 0, 0, 0])) {
-    this.tx = g.fromBuffer(e), Ki(this.tx), Object.defineProperty(this, "tx", {
+    this.tx = g.fromBuffer(e), Fi(this.tx), Object.defineProperty(this, "tx", {
       enumerable: !1,
       writable: !0
     });
@@ -4062,7 +4063,7 @@ class Hn {
   addInput(e) {
     if (e.hash === void 0 || e.index === void 0 || !h.isBuffer(e.hash) && typeof e.hash != "string" || typeof e.index != "number")
       throw new Error("Error adding input.");
-    const r = typeof e.hash == "string" ? We(h.from(e.hash, "hex")) : e.hash;
+    const r = typeof e.hash == "string" ? Ve(h.from(e.hash, "hex")) : e.hash;
     this.tx.addInput(r, e.index, e.sequence);
   }
   addOutput(e) {
@@ -4074,17 +4075,17 @@ class Hn {
     return this.tx.toBuffer();
   }
 }
-function Vi(t, e, r) {
+function Ci(t, e, r) {
   switch (r) {
     case "pubkey":
     case "pubkeyhash":
     case "witnesspubkeyhash":
-      return Ir(1, t.partialSig);
+      return Pr(1, t.partialSig);
     case "multisig": {
       const n = Vt({
         output: e
       });
-      return Ir(n.m, t.partialSig, n.pubkeys);
+      return Pr(n.m, t.partialSig, n.pubkeys);
     }
     case "nonstandard":
       return !0;
@@ -4096,12 +4097,12 @@ function Ee(t) {
   if (t.__UNSAFE_SIGN_NONSEGWIT)
     throw new Error("Not BIP174 compliant, can not export");
 }
-function Ir(t, e, r) {
+function Pr(t, e, r) {
   if (!e)
     return !1;
   let n;
   if (r ? n = r.map((s) => {
-    const i = eo(s);
+    const i = Yi(s);
     return e.find((o) => o.pubkey.equals(i));
   }).filter((s) => !!s) : n = e, n.length > t)
     throw new Error("Too many signatures");
@@ -4110,7 +4111,7 @@ function Ir(t, e, r) {
 function vn(t) {
   return !!t.finalScriptSig || !!t.finalScriptWitness;
 }
-function Hr(t) {
+function Ir(t) {
   return (e) => {
     const r = h.isBuffer(t.fingerprint) ? t.fingerprint : h.from(t.fingerprint);
     if (!e.masterFingerprint.equals(r))
@@ -4123,18 +4124,18 @@ function $t(t) {
   if (typeof t != "number" || t !== Math.floor(t) || t > 4294967295 || t < 0)
     throw new Error("Invalid 32 bit integer");
 }
-function Wi(t, e, r) {
+function Bi(t, e, r) {
   const n = e.__FEE_RATE || t.getFeeRate(), s = e.__EXTRACTED_TX.virtualSize(), i = n * s;
   if (n >= r.maximumFeeRate)
     throw new Error(`Warning: You are paying around ${(i / 1e8).toFixed(8)} in fees, which is ${n} satoshi per byte for a transaction with a VSize of ${s} bytes (segwit counted as 0.25 byte per byte). Use setMaximumFeeRate method to raise your threshold, or pass true to the first arg of extractTransaction.`);
 }
 function Tt(t, e) {
   t.forEach((r) => {
-    if ($(r) ? Ai(r, e) : bi(r, e))
+    if ($(r) ? Ei(r, e) : di(r, e))
       throw new Error("Can not modify transaction, signatures exist.");
   });
 }
-function Gi(t) {
+function Ri(t) {
   if (!t.sighashType || !t.partialSig)
     return;
   const { partialSig: e, sighashType: r } = t;
@@ -4148,17 +4149,17 @@ function xn(t, e, r) {
   if (!pe(t, e))
     throw new Error(`Can not ${r} for this input with the key ${t.toString("hex")}`);
 }
-function Ki(t) {
+function Fi(t) {
   if (!t.ins.every((r) => r.script && r.script.length === 0 && r.witness && r.witness.length === 0))
     throw new Error("Format Error: Transaction ScriptSigs are not empty");
 }
-function Mi(t, e) {
+function Li(t, e) {
   t.ins.forEach((r) => {
     Un(e, r);
   });
 }
 function Un(t, e) {
-  const r = `${We(h.from(e.hash)).toString("hex")}:${e.index}`;
+  const r = `${Ve(h.from(e.hash)).toString("hex")}:${e.index}`;
   if (t.__TX_IN_CACHE[r])
     throw new Error("Duplicate input detected.");
   t.__TX_IN_CACHE[r] = 1;
@@ -4172,8 +4173,8 @@ function kn(t, e) {
       throw new Error(`${e} for ${i} #${r} doesn't match the scriptPubKey in the prevout`);
   };
 }
-const vr = kn(mt, "Redeem script"), xr = kn(Et, "Witness script");
-function Ur(t, e, r, n, s = !1) {
+const Hr = kn(mt, "Redeem script"), vr = kn(Et, "Witness script");
+function xr(t, e, r, n, s = !1) {
   if (!r.every(vn))
     throw new Error(`PSBT must be finalized to calculate ${e}`);
   if (t === "__FEE_RATE" && n.__FEE_RATE)
@@ -4187,21 +4188,21 @@ function Ur(t, e, r, n, s = !1) {
     throw new Error(`Failed to calculate ${e}`);
   return u;
 }
-function Di(t, e, r, n, s, i, o = !0, u) {
+function Vi(t, e, r, n, s, i, o = !0, u) {
   const f = Wn(r);
-  if (!Vi(e, r, f) && o)
+  if (!Ci(e, r, f) && o)
     throw new Error(`Can not finalize input #${t}`);
-  return $i(r, f, e.partialSig, n, s, i, u);
+  return Wi(r, f, e.partialSig, n, s, i, u);
 }
-function $i(t, e, r, n, s, i, o) {
+function Wi(t, e, r, n, s, i, o) {
   let u, f;
-  const a = Xi(t, e, r), p = i ? Et({ redeem: a }) : null, l = s ? mt({ redeem: p || a }) : null;
+  const a = Ki(t, e, r), p = i ? Et({ redeem: a }) : null, l = s ? mt({ redeem: p || a }) : null;
   return n ? (p ? f = xt(p.witness) : a ? f = xt(a.witness) : f = xt(o ?? [h.from([0])]), l && (u = l?.input)) : l ? u = l?.input : a ? u = a.input : u = Array.isArray(o) && o[0] ? o[0] : h.from([1]), {
     finalScriptSig: u,
     finalScriptWitness: f
   };
 }
-function kr(t, e, r, n, s) {
+function Ur(t, e, r, n, s) {
   const i = N.checkForInput(t, e), { hash: o, sighashType: u, script: f } = Nn(e, i, n, !1, s);
   return xn(r, f, "sign"), {
     hash: o,
@@ -4244,7 +4245,7 @@ PROCEED WITH CAUTION!
     hash: u
   };
 }
-function qi(t, e, r, n) {
+function Gi(t, e, r, n) {
   const s = [];
   if (e.tapInternalKey) {
     const o = Cn(t, e, n);
@@ -4254,19 +4255,19 @@ function qi(t, e, r, n) {
     const o = e.tapScriptSig.map((u) => u.pubkey);
     s.push(...o);
   }
-  return s.map((o) => Ne(t, e, r, o, n)).flat();
+  return s.map((o) => ke(t, e, r, o, n)).flat();
 }
 function Cn(t, e, r) {
-  const { script: n } = $e(t, e, r);
+  const { script: n } = De(t, e, r);
   return An(n) ? h.from(n.subarray(2, 34)) : null;
 }
-function Nr(t) {
+function kr(t) {
   return t.length === 64 ? t : h.from(t.subarray(0, 64));
 }
-function Ne(t, e, r, n, s, i, o) {
+function ke(t, e, r, n, s, i, o) {
   const u = s.__TX, f = e.sighashType || g.SIGHASH_DEFAULT;
   Bn(f, o);
-  const a = r.map((w, S) => $e(S, w, s)), p = a.map((w) => w.script), l = a.map((w) => w.value), d = [];
+  const a = r.map((w, S) => De(S, w, s)), p = a.map((w) => w.script), l = a.map((w) => w.value), d = [];
   if (e.tapInternalKey && !i) {
     const w = Cn(t, e, s) || h.from([]);
     if (Ht(n).equals(w)) {
@@ -4292,15 +4293,15 @@ function Ne(t, e, r, n, s, i, o) {
 }
 function Bn(t, e) {
   if (e && e.indexOf(t) < 0) {
-    const r = Yi(t);
+    const r = $i(t);
     throw new Error(`Sighash type is not allowed. Retry the sign method passing the sighashTypes array of whitelisted types. Sighash type: ${r}`);
   }
 }
-function Xi(t, e, r) {
+function Ki(t, e, r) {
   let n;
   switch (e) {
     case "multisig": {
-      const s = zi(t, r);
+      const s = Di(t, r);
       n = Vt({
         output: t,
         signatures: s
@@ -4308,7 +4309,7 @@ function Xi(t, e, r) {
       break;
     }
     case "pubkey":
-      n = De({
+      n = Me({
         output: t,
         signature: r[0].signature
       });
@@ -4330,7 +4331,7 @@ function Xi(t, e, r) {
   }
   return n;
 }
-function ji(t, e, r) {
+function Mi(t, e, r) {
   const n = r.__TX, s = {
     script: null,
     isSegwit: !1,
@@ -4352,12 +4353,12 @@ function ji(t, e, r) {
       const i = s.script;
       if (!i)
         throw new TypeError("Invalid script for segwit address");
-      s.isSegwit = ni(i);
+      s.isSegwit = Qs(i);
     } catch {
     }
   return s;
 }
-function Cr(t, e, r) {
+function Nr(t, e, r) {
   const n = N.checkForInput(e, t);
   if (!n.bip32Derivation || n.bip32Derivation.length === 0)
     throw new Error("Need bip32Derivation to sign with HD");
@@ -4374,7 +4375,7 @@ function Cr(t, e, r) {
     return o;
   });
 }
-function zi(t, e) {
+function Di(t, e) {
   return Vt({ output: t }).pubkeys.map((n) => (e.filter((s) => s.pubkey.equals(n))[0] || {}).signature).filter((n) => !!n);
 }
 function Rn(t) {
@@ -4383,8 +4384,8 @@ function Rn(t) {
     return e += o, t.subarray(e - o, e);
   }
   function n() {
-    const o = Pr(t, e);
-    return e += Pr.bytes, o;
+    const o = Ar(t, e);
+    return e += Ar.bytes, o;
   }
   function s() {
     return r(n());
@@ -4397,7 +4398,7 @@ function Rn(t) {
   }
   return i();
 }
-function Yi(t) {
+function $i(t) {
   let e = t & g.SIGHASH_ANYONECANPAY ? "SIGHASH_ANYONECANPAY | " : "";
   switch (t & 31) {
     case g.SIGHASH_ALL:
@@ -4412,7 +4413,7 @@ function Yi(t) {
   }
   return e;
 }
-function Ce(t, e, r) {
+function Ne(t, e, r) {
   t.__NON_WITNESS_UTXO_BUF_CACHE[r] = e.nonWitnessUtxo, t.__NON_WITNESS_UTXO_TX_CACHE[r] = g.fromBuffer(e.nonWitnessUtxo);
   const n = t, s = r;
   delete e.nonWitnessUtxo, Object.defineProperty(e, "nonWitnessUtxo", {
@@ -4449,13 +4450,13 @@ function Fn(t, e, r, n, s) {
 }
 function le(t, e, r) {
   const n = t.__NON_WITNESS_UTXO_TX_CACHE;
-  return n[r] || Ce(t, e, r), n[r];
+  return n[r] || Ne(t, e, r), n[r];
 }
 function Ln(t, e, r) {
-  const { script: n } = $e(t, e, r);
+  const { script: n } = De(t, e, r);
   return n;
 }
-function $e(t, e, r) {
+function De(t, e, r) {
   if (e.witnessUtxo !== void 0)
     return {
       script: e.witnessUtxo.script,
@@ -4467,32 +4468,32 @@ function $e(t, e, r) {
   } else
     throw new Error("Can't find pubkey in input without Utxo data");
 }
-function Zi(t, e, r, n) {
+function qi(t, e, r, n) {
   const s = Ln(r, e, n), { meaningfulScript: i } = de(s, r, "input", e.redeemScript, e.witnessScript);
   return pe(t, i);
 }
-function Qi(t, e, r, n) {
+function Xi(t, e, r, n) {
   const s = n.__TX.outs[r].script, { meaningfulScript: i } = de(s, r, "output", e.redeemScript, e.witnessScript);
   return pe(t, i);
 }
-function Ji(t) {
+function ji(t) {
   if (!t)
     return;
   const e = A(t);
   if (!e)
     return;
   const r = e[e.length - 1];
-  if (!(!h.isBuffer(r) || Vn(r) || ro(r) || !A(r)))
+  if (!(!h.isBuffer(r) || Vn(r) || Zi(r) || !A(r)))
     return r;
 }
-function to(t) {
+function zi(t) {
   if (!t)
     return;
   const e = Rn(t), r = e[e.length - 1];
   if (!(Vn(r) || !A(r)))
     return r;
 }
-function eo(t) {
+function Yi(t) {
   if (t.length === 65) {
     const e = t[64] & 1, r = h.from(t.subarray(0, 33));
     return r[0] = 2 | e, r;
@@ -4500,19 +4501,19 @@ function eo(t) {
   return h.from(t);
 }
 function Vn(t) {
-  return t.length === 33 && zr(t);
+  return t.length === 33 && jr(t);
 }
-function ro(t) {
+function Zi(t) {
   return Q(t);
 }
 function de(t, e, r, n, s) {
-  const i = On(t), o = i && n && _r(n), u = _r(t);
+  const i = On(t), o = i && n && Sr(n), u = Sr(t);
   if (i && n === void 0)
     throw new Error("scriptPubkey is P2SH but redeemScript missing");
   if ((u || o) && s === void 0)
     throw new Error("scriptPubkey or redeemScript is P2WSH but witnessScript missing");
   let f;
-  return o ? (f = s, vr(e, t, n, r), xr(e, n, s, r), re(f)) : u ? (f = s, xr(e, t, s, r), re(f)) : i ? (f = n, vr(e, t, n, r)) : f = t, {
+  return o ? (f = s, Hr(e, t, n, r), vr(e, n, s, r), re(f)) : u ? (f = s, vr(e, t, s, r), re(f)) : i ? (f = n, Hr(e, t, n, r)) : f = t, {
     meaningfulScript: f,
     type: o ? "p2sh-p2wsh" : i ? "p2sh" : u ? "p2wsh" : "raw"
   };
@@ -4522,57 +4523,57 @@ function re(t) {
     throw new Error("P2WPKH or P2SH can not be contained within P2WSH");
 }
 function Wn(t) {
-  return he(t) ? "witnesspubkeyhash" : mi(t) ? "pubkeyhash" : gi(t) ? "multisig" : yi(t) ? "pubkey" : "nonstandard";
+  return he(t) ? "witnesspubkeyhash" : li(t) ? "pubkeyhash" : hi(t) ? "multisig" : pi(t) ? "pubkey" : "nonstandard";
 }
 function Ot(t) {
   return [...Array(t).keys()];
 }
-const fo = {
-  payments: hi,
-  script: hs,
-  crypto: xs
+const no = {
+  payments: oi,
+  script: os,
+  crypto: As
 };
 export {
-  so as A,
+  Ji as A,
   An as B,
   Pn as C,
-  Di as D,
-  mi as E,
+  Vi as D,
+  li as E,
   he as F,
-  ni as G,
-  _r as H,
+  Qs as G,
+  Sr as H,
   On as I,
-  uo as J,
-  yi as K,
-  gi as L,
-  ke as M,
-  Hs as N,
+  ro as J,
+  pi as K,
+  hi as L,
+  Ue as M,
+  Ts as N,
   K as P,
   g as T,
   Et as a,
   M as b,
   Lt as c,
   bt as d,
-  fo as e,
+  no as e,
   v as f,
-  fi as g,
-  ci as h,
-  oo as i,
+  ni as g,
+  si as h,
+  eo as i,
   mt as j,
   yt as k,
-  De as l,
+  Me as l,
   A as m,
-  Be as n,
+  Ce as n,
   E as o,
   Vt as p,
-  oi as q,
-  as as r,
+  ei as q,
+  is as r,
   Ie as s,
   Ht as t,
   it as u,
   C as v,
-  Is as w,
-  Zs as x,
+  _s as w,
+  qs as x,
   D as y,
-  io as z
+  to as z
 };