@btc-vision/transaction 1.7.28 → 1.7.29

package/browser/btc-vision-bitcoin.js

@@ -1,4 +1,4 @@
-import { B as h, a as U, t as c, d as I, i as Ut, b as Mn, 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 Br, c as kt, v as Se, p as qe, u as N } from "./vendors.js";
 const M = {
   messagePrefix: `Bitcoin Signed Message:
 `,
@@ -36,7 +36,25 @@ const M = {
   scriptHash: 196,
   wif: 239
 };
-function Dn(t) {
+function Be(t) {
+  let e, r;
+  try {
+    e = I.bech32.decode(t);
+  } catch {
+  }
+  if (e) {
+    if (r = e.words[0], r !== 0)
+      throw new TypeError(t + " uses wrong encoding");
+  } else if (e = I.bech32m.decode(t), r = e.words[0], r === 0)
+    throw new TypeError(t + " uses wrong encoding");
+  const n = I.bech32.fromWords(e.words.slice(1));
+  return {
+    version: r,
+    prefix: e.prefix,
+    data: h.from(n)
+  };
+}
+function Mn(t) {
   if (t.length < 8 || t.length > 72 || t[0] !== 48 || t[1] !== t.length - 2 || t[2] !== 2)
     return !1;
   const e = t[3];
@@ -45,7 +63,7 @@ function Dn(t) {
   const r = t[5 + e];
   return !(r === 0 || 6 + e + r !== t.length || t[4] & 128 || e > 1 && t[4] === 0 && !(t[5] & 128) || t[e + 6] & 128 || r > 1 && t[e + 6] === 0 && !(t[e + 7] & 128));
 }
-function $n(t) {
+function Dn(t) {
   if (t.length < 8)
     throw new Error("DER sequence length is too short");
   if (t.length > 72)
@@ -81,7 +99,7 @@ function $n(t) {
     s: t.subarray(6 + e)
   };
 }
-function qn(t, e) {
+function $n(t, e) {
   const r = t.length, n = e.length;
   if (r === 0)
     throw new Error("R length is zero");
@@ -230,11 +248,11 @@ for (const t of Object.keys(E)) {
 function Fr(t) {
   return t < E.OP_PUSHDATA1 ? 1 : t <= 255 ? 2 : t <= 65535 ? 3 : 5;
 }
-function Xn(t, e, r) {
+function qn(t, e, r) {
   const n = Fr(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 jn(t, e) {
+function Xn(t, e) {
   const r = t.readUInt8(e);
   let n, s;
   if (r < E.OP_PUSHDATA1)
@@ -260,7 +278,7 @@ function jn(t, e) {
     size: s
   };
 }
-function zn(t, e, r) {
+function jn(t, e, r) {
   e = e || 4, r = r === void 0 ? !0 : r;
   const n = t.length;
   if (n === 0)
@@ -278,19 +296,19 @@ function zn(t, e, r) {
     s |= t[i] << 8 * i;
   return t[n - 1] & 128 ? -(s & ~(128 << 8 * (n - 1))) : s;
 }
-function Yn(t) {
+function zn(t) {
   return t > 2147483647 ? 5 : t > 8388607 ? 4 : t > 32767 ? 3 : t > 127 ? 2 : t > 0 ? 1 : 0;
 }
 function Lr(t) {
   let e = Math.abs(t);
-  const r = Yn(e), n = h.allocUnsafe(r), s = t < 0;
+  const r = zn(e), n = h.allocUnsafe(r), s = t < 0;
   for (let i = 0; i < r; ++i)
     n.writeUInt8(e & 255, i), e >>= 8;
   return n[r - 1] & 128 ? n.writeUInt8(s ? 128 : 0, r - 1) : s && (n[r - 1] |= 128), n;
 }
-const Zn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Yn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  decode: zn,
+  decode: jn,
   encode: Lr
 }, Symbol.toStringTag, { value: "Module" })), Xe = U.alloc(32, 0), je = U.from("fffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f", "hex");
 function at(t, e) {
@@ -309,9 +327,9 @@ function W(t) {
   const n = t.subarray(33);
   return n.compare(Xe) === 0 || n.compare(je) >= 0 ? !1 : e === 4 || e === 6 || e === 7;
 }
-const Qn = 21 * 1e14;
+const Zn = 21 * 1e14;
 function qt(t) {
-  return c.UInt53(t) && t <= Qn;
+  return c.UInt53(t) && t <= Zn;
 }
 const Pt = 254;
 function ne(t) {
@@ -320,18 +338,18 @@ function ne(t) {
   const e = t;
   return U.isBuffer(e.output) ? e.version !== void 0 ? (e.version & Pt) === e.version : !0 : !1;
 }
-function Be(t) {
-  return globalThis.Array.isArray(t) ? t.length !== 2 ? !1 : t.every((e) => Be(e)) : ne(t);
+function Re(t) {
+  return globalThis.Array.isArray(t) ? t.length !== 2 ? !1 : t.every((e) => Re(e)) : ne(t);
 }
-const Jn = c.BufferN(32), ts = c.BufferN(20), _e = c.BufferN(32), It = c.Number, se = c.Array, es = c.Boolean, Vr = c.String, V = c.Buffer, Wr = c.Hex, Te = c.maybe, z = c.tuple, Gr = c.UInt8, Y = c.UInt32, rs = c.Function, Kr = c.BufferN, Mr = c.Null, ns = c.oneOf, ie = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+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({
   __proto__: null,
   Array: se,
-  Boolean: es,
+  Boolean: ts,
   Buffer: V,
-  Buffer256bit: Jn,
+  Buffer256bit: Qn,
   BufferN: Kr,
-  Function: rs,
-  Hash160bit: ts,
+  Function: es,
+  Hash160bit: Jn,
   Hash256bit: _e,
   Hex: Wr,
   Null: Mr,
@@ -343,13 +361,17 @@ const Jn = c.BufferN(32), ts = c.BufferN(20), _e = c.BufferN(32), It = c.Number,
   UInt8: Gr,
   isPoint: W,
   isTapleaf: ne,
-  isTaptree: Be,
+  isTaptree: Re,
   maybe: Te,
-  oneOf: ns,
+  oneOf: rs,
   stacksEqual: at,
   tuple: z,
   typeforce: c
-}, Symbol.toStringTag, { value: "Module" })), { typeforce: ss } = ie, ze = h.alloc(1, 0);
+}, Symbol.toStringTag, { value: "Module" })), { typeforce: ns } = ie, ze = h.alloc(1, 0);
+function oe(t) {
+  const e = t & -129;
+  return e > 0 && e < 4;
+}
 function Ye(t) {
   let e = 0;
   for (; t[e] === 0; )
@@ -361,39 +383,40 @@ function Ze(t) {
   const e = h.alloc(32, 0), r = Math.max(0, 32 - t.length);
   return t.copy(e, r), e;
 }
-function is(t) {
+function ss(t) {
   const e = t.readUInt8(t.length - 1);
-  if (!ue(e))
+  if (!oe(e))
     throw new Error(`Invalid hashType ${e}`);
-  const r = $n(t.subarray(0, -1)), n = Ze(r.r), s = Ze(r.s);
+  const r = Dn(t.subarray(0, -1)), n = Ze(r.r), s = Ze(r.s);
   return { signature: h.concat([n, s], 64), hashType: e };
 }
-function os(t, e) {
-  if (ss({
+function is(t, e) {
+  if (ns({
     signature: Kr(64),
     hashType: Gr
-  }, { signature: t, hashType: e }), !ue(e))
+  }, { 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));
-  return h.concat([qn(n, s), r]);
+  return h.concat([$n(n, s), r]);
 }
-const us = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const os = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  decode: is,
-  encode: os
+  decode: ss,
+  encode: is,
+  isDefinedHashType: oe
 }, Symbol.toStringTag, { value: "Module" })), { typeforce: Nt } = ie, Dr = E.OP_RESERVED;
-function fs(t) {
+function us(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) || fs(t);
+  return V(t) || us(t);
 }
-function oe(t) {
+function ue(t) {
   return se(t) && t.every($r);
 }
-function Re(t) {
+function Fe(t) {
   return t.length - t.filter($r).length;
 }
 function zt(t) {
@@ -409,7 +432,7 @@ function zt(t) {
 function qr(t) {
   return h.isBuffer(t);
 }
-function cs(t) {
+function fs(t) {
   return se(t);
 }
 function Yt(t) {
@@ -428,7 +451,7 @@ function v(t) {
         r.writeUInt8(i, n), n += 1;
         return;
       }
-      n += Xn(r, s.length, n), s.copy(r, n), n += s.length;
+      n += qn(r, s.length, n), s.copy(r, n), n += s.length;
     } else
       r.writeUInt8(s, n), n += 1;
   }), n !== r.length)
@@ -436,7 +459,7 @@ function v(t) {
   return r;
 }
 function A(t) {
-  if (cs(t))
+  if (fs(t))
     return t;
   Nt(V, t);
   const e = [];
@@ -444,7 +467,7 @@ function A(t) {
   for (; r < t.length; ) {
     const n = t[r];
     if (n > E.OP_0 && n <= E.OP_PUSHDATA4) {
-      const s = jn(t, r);
+      const s = Xn(t, r);
       if (s === null || (r += s.size, r + s.number > t.length))
         return null;
       const i = t.subarray(r, r + s.number);
@@ -469,211 +492,171 @@ function Xr(t) {
     return Rr[e];
   }).join(" ");
 }
-function as(t) {
+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 jr(t) {
-  return t = A(t), Nt(oe, t), t.map((e) => Yt(e) ? e : e === E.OP_0 ? h.allocUnsafe(0) : Lr(e - Dr));
+  return t = A(t), Nt(ue, t), t.map((e) => Yt(e) ? e : e === E.OP_0 ? h.allocUnsafe(0) : Lr(e - Dr));
 }
 function zr(t) {
   return W(t);
 }
-function ue(t) {
-  const e = t & -129;
-  return e > 0 && e < 4;
-}
 function Q(t) {
-  return !h.isBuffer(t) || !ue(t[t.length - 1]) ? !1 : Dn(t.subarray(0, -1));
+  return !h.isBuffer(t) || !oe(t[t.length - 1]) ? !1 : Mn(t.subarray(0, -1));
 }
-const hs = Zn, dt = us, ps = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const as = Yn, dt = os, hs = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   compile: v,
-  countNonPushOnlyOPs: Re,
+  countNonPushOnlyOPs: Fe,
   decompile: A,
-  fromASM: as,
+  fromASM: cs,
   isCanonicalPubKey: zr,
   isCanonicalScriptSignature: Q,
-  isDefinedHashType: ue,
-  isPushOnly: oe,
-  number: hs,
+  isPushOnly: ue,
+  number: as,
   opcodes: E,
   signature: dt,
   toASM: Xr,
   toStack: jr
-}, Symbol.toStringTag, { value: "Module" })), fe = 40, ce = 2, ae = 15, ls = 16, Oe = 16, Fe = 2, Le = 80, ds = "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.", ws = (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] - Le;
-    if (r < Fe || r > ae + 1)
-      throw new TypeError("Invalid version for segwit address");
-    if (r === 1)
-      throw new TypeError("taproot");
-    return !0;
-  } catch {
-  }
-  return !1;
-};
-function gs(t, e) {
-  if (!h.isBuffer(t))
-    throw new TypeError("output must be a Buffer");
-  if (!e.bech32Opnet)
-    throw new Error("Network does not support opnet");
-  const r = t[0];
-  let n = 1, s;
-  if (t[1] < 76)
-    s = t[1], n = 2;
-  else if (t[1] === 76)
-    s = t[2], n = 3;
-  else
-    throw new TypeError("Unsupported push opcode in script");
-  const i = h.from(t.subarray(n, n + s));
-  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 > ls)
-    throw new TypeError(`Invalid segwit version ${o}`);
-  const u = [o, ...I.bech32m.toWords(i)];
-  return I.bech32m.encode(e.bech32Opnet, u);
-}
-function ys(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] - Le;
-  if (n < Fe || 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 bs(r, n, e.bech32, e.bech32Opnet);
+}, Symbol.toStringTag, { value: "Module" }));
+var K;
+(function(t) {
+  t.P2PK = "p2pk", t.P2PKH = "p2pkh", t.P2SH = "p2sh", t.P2MS = "p2ms", t.P2WPKH = "p2wpkh", t.P2WSH = "p2wsh", t.P2TR = "p2tr", t.P2OP = "p2op", t.Embed = "embed", t.ScriptRedeem = "scriptRedeem";
+})(K || (K = {}));
+function y(t, e, r) {
+  Object.defineProperty(t, e, {
+    configurable: !0,
+    enumerable: !0,
+    get() {
+      const n = r.call(this);
+      return this[e] = n, n;
+    },
+    set(n) {
+      Object.defineProperty(this, e, {
+        configurable: !0,
+        enumerable: !0,
+        value: n,
+        writable: !0
+      });
+    }
+  });
 }
-function ms(t) {
-  const e = h.from(Ut.decode(t));
-  if (e.length < 21)
-    throw new TypeError(t + " is too short");
-  if (e.length > 21)
-    throw new TypeError(t + " is too long");
-  const r = e.readUInt8(0), n = h.from(e.subarray(1));
-  return { version: r, hash: n };
+function B(t) {
+  let e;
+  return () => (e !== void 0 || (e = t()), e);
 }
-function Ve(t) {
-  let e, r;
-  try {
-    e = I.bech32.decode(t);
-  } catch {
-  }
-  if (e) {
-    if (r = e.words[0], r !== 0)
-      throw new TypeError(t + " uses wrong encoding");
-  } else if (e = I.bech32m.decode(t), r = e.words[0], r === 0)
-    throw new TypeError(t + " uses wrong encoding");
-  const n = I.bech32.fromWords(e.words.slice(1));
-  return {
-    version: r,
-    prefix: e.prefix,
-    data: h.from(n)
+const Qe = E, Je = 16, tr = 2, er = 40;
+function Yr(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({
+    address: c.maybe(c.String),
+    output: c.maybe(c.Buffer),
+    program: c.maybe(c.Buffer),
+    network: c.maybe(c.Object),
+    deploymentVersion: c.maybe(c.Number),
+    hash160: c.maybe(c.BufferN(20))
+  }, t);
+  const r = () => {
+    if (typeof t.deploymentVersion < "u" && typeof t.hash160 < "u") {
+      if (t.hash160.length !== 20)
+        throw new TypeError("hash160 must be exactly 20 bytes");
+      if (t.deploymentVersion < 0 || t.deploymentVersion > 255)
+        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 = {
+    name: K.P2OP,
+    network: s,
+    deploymentVersion: 0
   };
+  if (y(i, "program", () => {
+    if (t.program)
+      return t.program;
+    const o = r();
+    if (o)
+      return o;
+    if (t.output) {
+      if (t.output[0] !== Qe.OP_16)
+        throw new TypeError("Invalid P2OP script");
+      let u = 1, f;
+      if (t.output[1] < 76)
+        f = t.output[1], u = 2;
+      else if (t.output[1] === 76)
+        f = t.output[2], u = 3;
+      else
+        throw new TypeError("Unsupported push opcode in P2OP script");
+      return t.output.subarray(u, u + f);
+    }
+    if (t.address)
+      return n().data;
+  }), y(i, "deploymentVersion", () => {
+    if (i.program)
+      return i.program[0];
+  }), y(i, "hash160", () => {
+    if (i.program)
+      return i.program.subarray(1);
+  }), y(i, "output", () => {
+    if (i.program)
+      return v([Qe.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);
+  }), 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)
+        throw new TypeError("Invalid witness version for p2op");
+      if (u.data.length < tr || u.data.length > er)
+        throw new TypeError("Invalid witness program length");
+      o = u.data;
+    }
+    if (t.program) {
+      if (o.length && !o.equals(t.program))
+        throw new TypeError("Program mismatch");
+      o = t.program;
+    }
+    if (!o.length && t.deploymentVersion !== void 0 && t.hash160 && (o = r()), t.output) {
+      const u = i.program;
+      if (o.length && !o.equals(u))
+        throw new TypeError("Program mismatch (output vs other source)");
+      o = u;
+    }
+    if (o.length < tr || o.length > er)
+      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");
+    if (t.hash160 && !t.hash160.equals(o.subarray(1)))
+      throw new TypeError("hash160 mismatch");
+  }
+  return Object.assign(i, t);
 }
-function bs(t, e, r, n) {
-  const s = I.bech32.toWords(t);
-  return s.unshift(e), e === Oe && n ? I.bech32m.encode(n, s) : e === 0 ? I.bech32.encode(r, s) : I.bech32m.encode(r, s);
+function ps(t) {
+  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
 }
-function Es(t, e) {
-  e = e || M;
-  try {
-    return Et({ output: t, network: e }).address;
-  } catch {
-  }
-  try {
-    return yt({ output: t, network: e }).address;
-  } catch {
-  }
-  try {
-    return Vt({ output: t, network: e }).address;
-  } catch {
-  }
-  try {
-    return bt({ output: t, network: e }).address;
-  } catch {
-  }
-  try {
-    return mt({ output: t, network: e }).address;
-  } catch {
-  }
-  try {
-    return gs(t, e);
-  } catch {
-  }
-  try {
-    return ys(t, e);
-  } catch {
+function Zr(t, e, r = "") {
+  const n = ps(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);
   }
-  throw new Error(Xr(t) + " has no matching Address");
+  return t;
 }
-function Ss(t, e) {
-  e = e || M;
-  let r, n;
-  try {
-    r = ms(t);
-  } catch {
-  }
-  if (r) {
-    if (r.version === e.pubKeyHash)
-      return Et({ hash: r.hash }).output;
-    if (r.version === e.scriptHash)
-      return yt({ hash: r.hash }).output;
-  } else {
-    try {
-      n = Ve(t);
-    } catch {
-    }
-    if (n) {
-      if (n.prefix !== e.bech32 && e.bech32Opnet && n.prefix !== e.bech32Opnet)
-        throw new Error(t + " has an invalid prefix");
-      if (n.version === 0) {
-        if (n.data.length === 20)
-          return Vt({ hash: n.data }).output;
-        if (n.data.length === 32)
-          return bt({ hash: n.data }).output;
-      } else if (n.version === 1) {
-        if (n.data.length === 32)
-          return mt({ pubkey: n.data }).output;
-      } else if (n.version === Oe) {
-        if (!e.bech32Opnet)
-          throw new Error(t + " has an invalid prefix");
-        return On({
-          program: n.data,
-          network: e
-        }).output;
-      } else if (n.version >= Fe && n.version <= ae && n.data.length >= ce && n.data.length <= fe)
-        return n.version !== Oe && console.warn(ds), v([
-          n.version + Le,
-          n.data
-        ]);
-    }
-  }
-  throw new TypeError(t + " has no matching Script");
-}
-function _s(t) {
-  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
-}
-function Yr(t, e, r = "") {
-  const n = _s(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 Qe(t, e = !0) {
+function rr(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 Ts(t, e) {
-  Yr(t, void 0, "digestInto() output");
+function ls(t, e) {
+  Zr(t, void 0, "digestInto() output");
   const r = e.outputLen;
   if (t.length < r)
     throw new Error('"digestInto() output" expected to be of length >=' + r);
@@ -691,20 +674,20 @@ function q(t, e) {
 function ft(t, e) {
   return t << e | t >>> 32 - e >>> 0;
 }
-function We(t, e = {}) {
+function Le(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 Os = (t) => ({
+const ds = (t) => ({
   oid: Uint8Array.from([6, 9, 96, 134, 72, 1, 101, 3, 4, 2, t])
 });
-function Zr(t, e, r) {
+function Qr(t, e, r) {
   return t & e ^ ~t & r;
 }
-function Qr(t, e, r) {
+function Jr(t, e, r) {
   return t & e ^ t & r ^ e & r;
 }
-class Ge {
+class Ve {
   blockLen;
   outputLen;
   padOffset;
@@ -720,7 +703,7 @@ class Ge {
     this.blockLen = e, this.outputLen = r, this.padOffset = n, this.isLE = s, this.buffer = new Uint8Array(e), this.view = we(this.buffer);
   }
   update(e) {
-    Qe(this), Yr(e);
+    rr(this), Zr(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);
@@ -735,7 +718,7 @@ class Ge {
     return this.length += e.length, this.roundClean(), this;
   }
   digestInto(e) {
-    Qe(this), Ts(e, this), this.finished = !0;
+    rr(this), ls(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);
@@ -782,7 +765,7 @@ const et = /* @__PURE__ */ Uint32Array.from([
   271733878,
   3285377520
 ]), rt = /* @__PURE__ */ new Uint32Array(80);
-class As extends Ge {
+class ws extends Ve {
   A = St[0] | 0;
   B = St[1] | 0;
   C = St[2] | 0;
@@ -806,7 +789,7 @@ class As extends Ge {
     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 = 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);
+      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);
       const l = ft(n, 5) + a + u + p + rt[f] | 0;
       u = o, o = i, i = ft(s, 30), s = n, n = l;
     }
@@ -819,7 +802,7 @@ class As extends Ge {
     this.set(0, 0, 0, 0, 0), ht(this.buffer);
   }
 }
-const Ps = /* @__PURE__ */ We(() => new As()), Is = /* @__PURE__ */ Uint8Array.from([
+const gs = /* @__PURE__ */ Le(() => new ws()), ys = /* @__PURE__ */ Uint8Array.from([
   7,
   4,
   13,
@@ -836,36 +819,36 @@ const Ps = /* @__PURE__ */ We(() => new As()), Is = /* @__PURE__ */ Uint8Array.f
   14,
   11,
   8
-]), Jr = Uint8Array.from(new Array(16).fill(0).map((t, e) => e)), Hs = Jr.map((t) => (9 * t + 5) % 16), tn = /* @__PURE__ */ (() => {
-  const r = [[Jr], [Hs]];
+]), 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]];
   for (let n = 0; n < 4; n++)
     for (let s of r)
-      s.push(s[n].map((i) => Is[i]));
+      s.push(s[n].map((i) => ys[i]));
   return r;
-})(), en = tn[0], rn = tn[1], nn = /* @__PURE__ */ [
+})(), rn = en[0], nn = en[1], sn = /* @__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)), vs = /* @__PURE__ */ en.map((t, e) => t.map((r) => nn[e][r])), xs = /* @__PURE__ */ rn.map((t, e) => t.map((r) => nn[e][r])), Us = /* @__PURE__ */ Uint32Array.from([
+].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([
   0,
   1518500249,
   1859775393,
   2400959708,
   2840853838
-]), ks = /* @__PURE__ */ Uint32Array.from([
+]), _s = /* @__PURE__ */ Uint32Array.from([
   1352829926,
   1548603684,
   1836072691,
   2053994217,
   0
 ]);
-function Je(t, e, r, n) {
+function nr(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 Ns extends Ge {
+class Ts extends Ve {
   h0 = 1732584193;
   h1 = -271733879;
   h2 = -1732584194;
@@ -886,13 +869,13 @@ class Ns extends Ge {
       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 = Us[b], P = ks[b], k = en[b], H = rn[b], _ = vs[b], O = xs[b];
+      const w = 4 - b, S = Ss[b], P = _s[b], k = rn[b], H = nn[b], _ = bs[b], O = Es[b];
       for (let T = 0; T < 16; T++) {
-        const F = ft(n + Je(b, i, u, a) + Wt[k[T]] + S, _[T]) + l | 0;
+        const F = ft(n + nr(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 + Je(w, o, f, p) + Wt[H[T]] + P, O[T]) + d | 0;
+        const F = ft(s + nr(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;
       }
     }
@@ -905,7 +888,7 @@ class Ns extends Ge {
     this.destroyed = !0, ht(this.buffer), this.set(0, 0, 0, 0, 0);
   }
 }
-const sn = /* @__PURE__ */ We(() => new Ns()), Cs = /* @__PURE__ */ Uint32Array.from([
+const on = /* @__PURE__ */ Le(() => new Ts()), Os = /* @__PURE__ */ Uint32Array.from([
   1116352408,
   1899447441,
   3049323471,
@@ -971,7 +954,7 @@ const sn = /* @__PURE__ */ We(() => new Ns()), Cs = /* @__PURE__ */ Uint32Array.
   3204031479,
   3329325298
 ]), nt = /* @__PURE__ */ new Uint32Array(64);
-class Bs extends Ge {
+class As extends Ve {
   constructor(e) {
     super(64, e, 8, !1);
   }
@@ -992,7 +975,7 @@ class Bs extends Ge {
     }
     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 + Zr(u, f, a) + Cs[l] + nt[l] | 0, S = (q(n, 2) ^ q(n, 13) ^ q(n, 22)) + Qr(n, s, i) | 0;
+      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;
       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);
@@ -1004,7 +987,7 @@ class Bs extends Ge {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), ht(this.buffer);
   }
 }
-class Rs extends Bs {
+class Ps extends As {
   // We cannot use array here since array allows indexing by variable
   // which means optimizer/compiler cannot use registers.
   A = et[0] | 0;
@@ -1019,26 +1002,26 @@ class Rs extends Bs {
     super(32);
   }
 }
-const Zt = /* @__PURE__ */ We(
-  () => new Rs(),
-  /* @__PURE__ */ Os(1)
+const Zt = /* @__PURE__ */ Le(
+  () => new Ps(),
+  /* @__PURE__ */ ds(1)
 );
-function Fs(t) {
-  return h.from(sn(Uint8Array.from(t)));
+function Is(t) {
+  return h.from(on(Uint8Array.from(t)));
 }
-function Ls(t) {
-  return h.from(Ps(Uint8Array.from(t)));
+function Hs(t) {
+  return h.from(gs(Uint8Array.from(t)));
 }
 function D(t) {
   return h.from(Zt(Uint8Array.from(t)));
 }
 function C(t) {
-  return h.from(sn(Zt(Uint8Array.from(t))));
+  return h.from(on(Zt(Uint8Array.from(t))));
 }
 function it(t) {
   return h.from(Zt(Zt(Uint8Array.from(t))));
 }
-const Vs = [
+const vs = [
   "BIP0340/challenge",
   "BIP0340/aux",
   "BIP0340/nonce",
@@ -1048,7 +1031,7 @@ const Vs = [
   "TapTweak",
   "KeyAgg list",
   "KeyAgg coefficient"
-], on = {
+], un = {
   "BIP0340/challenge": h.from([
     123,
     181,
@@ -1645,628 +1628,380 @@ const Vs = [
   ])
 };
 function Rt(t, e) {
-  return D(h.concat([on[t], e]));
+  return D(h.concat([un[t], e]));
 }
-const Ws = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const xs = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  TAGGED_HASH_PREFIXES: on,
-  TAGS: Vs,
+  TAGGED_HASH_PREFIXES: un,
+  TAGS: vs,
   hash160: C,
   hash256: it,
-  ripemd160: Fs,
-  sha1: Ls,
+  ripemd160: Is,
+  sha1: Hs,
   sha256: D,
   taggedHash: Rt
-}, Symbol.toStringTag, { value: "Module" })), Ht = {};
-function oo(t) {
-  t ? t !== Ht.eccLib && (Gs(t), Ht.eccLib = t) : Ht.eccLib = t;
-}
-function Ae() {
-  if (!Ht.eccLib)
-    throw new Error("No ECC Library provided. You must call initEccLib() with a valid TinySecp256k1Interface instance");
-  return Ht.eccLib;
-}
-const J = (t) => h.from(t, "hex");
-function Gs(t) {
-  L(typeof t.isXOnlyPoint == "function"), L(t.isXOnlyPoint(J("79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"))), L(t.isXOnlyPoint(J("fffffffffffffffffffffffffffffffffffffffffffffffffffffffeeffffc2e"))), L(t.isXOnlyPoint(J("f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9"))), L(t.isXOnlyPoint(J("0000000000000000000000000000000000000000000000000000000000000001"))), L(!t.isXOnlyPoint(J("0000000000000000000000000000000000000000000000000000000000000000"))), L(!t.isXOnlyPoint(J("fffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"))), L(typeof t.xOnlyPointAddTweak == "function"), Ks.forEach((e) => {
-    const r = t.xOnlyPointAddTweak(J(e.pubkey), J(e.tweak));
-    e.result === null ? L(r === null) : (L(r !== null), L(r.parity === e.parity), L(h.from(r.xOnlyPubkey).equals(J(e.result))));
-  });
-}
-function L(t) {
-  if (!t)
-    throw new Error("ecc library invalid");
-}
-const Ks = [
-  {
-    pubkey: "79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798",
-    tweak: "fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364140",
-    parity: -1,
-    result: null
-  },
-  {
-    pubkey: "1617d38ed8d8657da4d4761e8057bc396ea9e4b9d29776d4be096016dbd2509b",
-    tweak: "a8397a935f0dfceba6ba9618f6451ef4d80637abf4e6af2669fbc9de6a8fd2ac",
-    parity: 1,
-    result: "e478f99dab91052ab39a33ea35fd5e6e4933f4d28023cd597c9a1f6760346adf"
-  },
-  {
-    pubkey: "2c0b7cf95324a07d05398b240174dc0c2be444d96b159aa6c7f7b1e668680991",
-    tweak: "823c3cd2142744b075a87eade7e1b8678ba308d566226a0056ca2b7a76f86b47",
-    parity: 0,
-    result: "9534f8dc8c6deda2dc007655981c78b49c5d96c778fbf363462a11ec9dfd948c"
-  }
-], { typeforce: un } = ie;
-function fn(t, e) {
-  if (typeof t != "number")
-    throw new Error("cannot write a non-number as a number");
-  if (t < 0)
-    throw new Error("specified a negative value for writing an unsigned value");
-  if (t > e)
-    throw new Error("RangeError: value out of range");
-  if (Math.floor(t) !== t)
-    throw new Error("value has a fractional component");
-}
-function Ms(t, e) {
-  const r = t.readUInt32LE(e);
-  let n = t.readUInt32LE(e + 4);
-  return n *= 4294967296, fn(n + r, 9007199254740991), n + r;
-}
-function Ds(t, e, r) {
-  return fn(e, 9007199254740991), t.writeInt32LE(e & -1, r), t.writeUInt32LE(Math.floor(e / 4294967296), r + 4), r + 8;
-}
-function Ke(t) {
-  if (t.length < 1)
-    return t;
-  let e = t.length - 1, r = 0;
-  for (let n = 0; n < t.length / 2; n++)
-    r = t[n], t[n] = t[e], t[e] = r, e--;
-  return t;
-}
-function tr(t) {
-  const e = h.allocUnsafe(t.length);
-  return t.copy(e), e;
-}
-class x {
-  constructor(e, r = 0) {
-    this.buffer = e, this.offset = r, un(z(V, Y), [e, r]);
+}, Symbol.toStringTag, { value: "Module" }));
+const Us = {
+  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 = "") => {
+  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) => {
+  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) => {
+  const e = "hex invalid";
+  if (!hn(t))
+    return G(e);
+  const r = t.length, n = r / 2;
+  if (r % 2)
+    return G(e);
+  const s = pn(n);
+  for (let i = 0, o = 0; i < n; i++, o += 2) {
+    const u = sr(t.charCodeAt(o)), f = sr(t.charCodeAt(o + 1));
+    if (u === void 0 || f === void 0)
+      return G(e);
+    s[i] = u * 16 + f;
   }
-  static withCapacity(e) {
-    return new x(h.alloc(e));
+  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));
+  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) => {
+  const r = t % e;
+  return r >= 0n ? r : e + r;
+}, Rs = (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; ) {
+    const o = n / r, u = n % r, f = s - i * o;
+    n = r, r = u, s = i, i = f;
   }
-  writeUInt8(e) {
-    this.offset = this.buffer.writeUInt8(e, this.offset);
+  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));
+  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;
+  return m(r * r) === e ? r : G("sqrt invalid");
+};
+class R {
+  static BASE;
+  static ZERO;
+  px;
+  py;
+  pz;
+  constructor(e, r, n) {
+    this.px = ur(e), this.py = jt(r), this.pz = ur(n), Object.freeze(this);
   }
-  writeInt32(e) {
-    this.offset = this.buffer.writeInt32LE(e, this.offset);
+  /** 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;
+    if (o === Xt + 1 && [2, 3].includes(n)) {
+      let u = Vs(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");
   }
-  writeUInt32(e) {
-    this.offset = this.buffer.writeUInt32LE(e, this.offset);
+  /** 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);
+    return f === a && p === l;
   }
-  writeUInt64(e) {
-    this.offset = Ds(this.buffer, e, this.offset);
+  is0() {
+    return this.equals(ut);
   }
-  writeVarInt(e) {
-    const r = Br(e, this.buffer, this.offset);
-    this.offset += r.bytes;
+  /** Flip point over y coordinate. */
+  negate() {
+    return new R(this.px, m(-this.py), this.pz);
   }
-  writeSlice(e) {
-    if (this.buffer.length < this.offset + e.length)
-      throw new Error("Cannot write slice out of bounds");
-    this.offset += e.copy(this.buffer, this.offset);
+  /** Point doubling: P+P, complete formula. */
+  double() {
+    return this.add(this);
   }
-  writeVarSlice(e) {
-    this.writeVarInt(e.length), this.writeSlice(e);
+  /**
+   * Point addition: P+Q, complete, exception-free formula
+   * (Renes-Costello-Batina, algo 1 of [2015/1060](https://eprint.iacr.org/2015/1060)).
+   * Cost: `12M + 0S + 3*a + 3*b3 + 23add`.
+   */
+  // prettier-ignore
+  add(e) {
+    const { px: r, py: n, pz: s } = this, { px: i, py: o, pz: u } = or(e), f = 0n, a = cn;
+    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);
+    k = m(k * H), H = m(w + S), k = m(k - H), H = m(r + s);
+    let _ = m(i + u);
+    return H = m(H * _), _ = m(w + P), H = m(H - _), _ = m(n + s), p = m(o + u), _ = m(_ * p), p = m(S + P), _ = m(_ - p), d = m(f * H), p = m(b * P), d = m(p + d), p = m(S - d), d = m(S + d), l = m(p * d), S = m(w + w), S = m(S + w), P = m(f * P), H = m(b * H), S = m(S + P), P = m(w - P), P = m(f * P), H = m(H + P), w = m(S * H), l = m(l + w), w = m(_ * H), p = m(k * p), p = m(p - w), w = m(k * S), d = m(_ * d), d = m(d + w), new R(p, l, d);
   }
-  writeVector(e) {
-    this.writeVarInt(e.length), e.forEach((r) => this.writeVarSlice(r));
+  /**
+   * Point-by-scalar multiplication. Scalar must be in range 1 <= n < CURVE.n.
+   * Uses {@link wNAF} for base point.
+   * Uses fake point to mitigate side-channel leakage.
+   * @param n scalar by which point is multiplied
+   * @param safe safe mode guards against timing attacks; unsafe mode is faster
+   */
+  multiply(e, r = !0) {
+    if (!r && e === 0n)
+      return ut;
+    if (Fs(e), e === 1n)
+      return this;
+    if (this.equals(wt))
+      return Ds(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));
+    return n;
   }
-  end() {
-    if (this.buffer.length === this.offset)
-      return this.buffer;
-    throw new Error(`buffer size ${this.buffer.length}, offset ${this.offset}`);
+  /** Convert point to 2d xy affine point. (X, Y, Z) ∋ (x=X/Z, y=Y/Z) */
+  toAffine() {
+    const { px: e, py: r, pz: n } = this;
+    if (this.equals(ut))
+      return { x: 0n, y: 0n };
+    if (n === 1n)
+      return { x: e, y: r };
+    const s = Rs(n, ct);
+    return m(n * s) !== 1n && G("inverse invalid"), { x: m(e * s), y: m(r * s) };
   }
-}
-class $s {
-  constructor(e, r = 0) {
-    this.buffer = e, this.offset = r, un(z(V, Y), [e, r]);
+  /** 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");
   }
-  readUInt8() {
-    const e = this.buffer.readUInt8(this.offset);
-    return this.offset++, e;
+  /** 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));
   }
-  readInt32() {
-    const e = this.buffer.readInt32LE(this.offset);
-    return this.offset += 4, e;
+  /** Create 3d xyz point from 2d xy. (0, 0) => (0, 1, 0), not (0, 0, 1) */
+  static fromAffine(e) {
+    const { x: r, y: n } = e;
+    return r === 0n && n === 0n ? ut : new R(r, n, 1n);
   }
-  readUInt32() {
-    const e = this.buffer.readUInt32LE(this.offset);
-    return this.offset += 4, e;
+  toHex(e) {
+    return dn(this.toBytes(e));
   }
-  readUInt64() {
-    const e = Ms(this.buffer, this.offset);
-    return this.offset += 8, e;
+  static fromPrivateKey(e) {
+    return wt.multiply(Gs(e));
   }
-  readVarInt() {
-    const e = Mn(this.buffer, this.offset);
-    return this.offset += e.bytes, e.numberValue || 0;
+  static fromHex(e) {
+    return R.fromBytes(gn(e));
   }
-  readSlice(e) {
-    if (this.buffer.length < this.offset + e)
-      throw new Error("Cannot read slice out of bounds");
-    const r = h.from(this.buffer.subarray(this.offset, this.offset + e));
-    return this.offset += e, r;
+  get x() {
+    return this.toAffine().x;
   }
-  readVarSlice() {
-    return this.readSlice(this.readVarInt());
+  get y() {
+    return this.toAffine().y;
   }
-  readVector() {
-    const e = this.readVarInt(), r = [];
-    for (let n = 0; n < e; n++)
-      r.push(this.readVarSlice());
-    return r;
+  toRawBytes(e) {
+    return this.toBytes(e);
   }
 }
-const Me = 192, cn = 128, qs = (t) => "left" in t && "right" in t;
-function Qt(t, e) {
-  if (t.length < 33)
-    throw new TypeError(`The control-block length is too small. Got ${t.length}, expected min 33.`);
-  const r = (t.length - 33) / 32;
-  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 = Pe(n, i) : n = Pe(i, n);
+const wt = new R(ks, Ns, 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 t = [];
+  let e = wt, r = e;
+  for (let n = 0; n < En; n++) {
+    r = e, t.push(r);
+    for (let s = 1; s < Pe; s++)
+      r = r.add(e), t.push(r);
+    e = r.double();
   }
-  return n;
-}
-function Jt(t) {
-  if (ne(t))
-    return { hash: Z(t) };
-  const e = [Jt(t[0]), Jt(t[1])];
-  e.sort((s, i) => s.hash.compare(i.hash));
-  const [r, n] = e;
-  return {
-    hash: Pe(r.hash, n.hash),
-    left: r,
-    right: n
-  };
-}
-function Ct(t, e) {
-  if (qs(t)) {
-    const r = Ct(t.left, e);
-    if (r !== void 0)
-      return [...r, t.right.hash];
-    const n = Ct(t.right, e);
-    if (n !== void 0)
-      return [...n, t.left.hash];
-  } else if (t.hash.equals(e))
-    return [];
-}
-function Z(t) {
-  const e = t.version || Me;
-  return Rt("TapLeaf", U.concat([U.from([e]), Xs(t.output)]));
-}
-function an(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 = an(t, e), n = Ae().xOnlyPointAddTweak(t, r);
-  return !n || n.xOnlyPubkey === null ? null : {
-    parity: n.parity,
-    x: U.from(n.xOnlyPubkey)
-  };
-}
-function Pe(t, e) {
-  return Rt("TapBranch", U.concat([t, e]));
-}
-function Xs(t) {
-  const e = kt(t.length), r = U.allocUnsafe(e);
-  return Br(t.length, r), U.concat([r, t]);
-}
-function y(t, e, r) {
-  Object.defineProperty(t, e, {
-    configurable: !0,
-    enumerable: !0,
-    get() {
-      const n = r.call(this);
-      return this[e] = n, n;
-    },
-    set(n) {
-      Object.defineProperty(this, e, {
-        configurable: !0,
-        enumerable: !0,
-        value: n,
-        writable: !0
-      });
-    }
-  });
+  return t;
+};
+let ar;
+const hr = (t, e) => {
+  const r = e.negate();
+  return t ? r : e;
+}, Ds = (t) => {
+  const e = ar || (ar = Ms());
+  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++) {
+    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]));
+  }
+  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) {
+  let e = t.toString(16);
+  return e = e.padStart(64, "0"), e.length > 64 && (e = e.slice(-64)), h.from(e, "hex");
 }
-function B(t) {
+function Ie(t) {
+  if (t.length === 32)
+    return;
+  if (![33, 65].includes(t.length)) {
+    console.warn(`Unsupported key length=${t.length}. Must be 33 (compressed) or 65 (uncompressed).`);
+    return;
+  }
   let e;
-  return () => (e !== void 0 || (e = t()), e);
+  try {
+    e = R.fromHex(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);
+  o[0] = i, r.copy(o, 1), n.copy(o, 33);
+  const u = h.concat([h.from([4]), r, n]);
+  return {
+    hybrid: o,
+    uncompressed: u
+  };
 }
-const er = E;
-function js(t, e) {
-  if (!t.data && !t.output)
-    throw new TypeError("Not enough data");
-  e = Object.assign({ validate: !0 }, e || {}), c({
-    network: c.maybe(c.Object),
-    output: c.maybe(c.Buffer),
-    data: c.maybe(c.arrayOf(c.Buffer))
-  }, t);
-  const r = t.network || M, n = { name: K.Embed, network: r, data: [] };
-  if (y(n, "output", () => {
-    if (t.data)
-      return v([er.OP_RETURN].concat(t.data));
-  }), y(n, "data", () => {
-    if (!t.output)
-      return;
-    const s = A(t.output);
-    if (s != null)
-      return s.slice(1);
-  }), e.validate && t.output) {
-    const s = A(t.output);
-    if (s[0] !== er.OP_RETURN)
-      throw new TypeError("Output is invalid");
-    if (!s.slice(1).every(c.Buffer))
-      throw new TypeError("Output is invalid");
-    if (t.data && !at(t.data, n.data))
-      throw new TypeError("Data mismatch");
+function Gt(t, e) {
+  if (t.equals(e))
+    return !0;
+  if (t.length === 65 && e.length === 65) {
+    const r = h.from(t), n = h.from(e);
+    return (r[0] === 6 || r[0] === 7) && (r[0] = 4), (n[0] === 6 || n[0] === 7) && (n[0] = 4), r.equals(n);
   }
-  return Object.assign(n, t);
+  return !1;
 }
-const lt = E, Gt = lt.OP_RESERVED;
-function Ft(t, e) {
-  if (!t.input && !t.output && !(t.pubkeys && t.m !== void 0) && !t.signatures)
+const st = E;
+function yt(t, e) {
+  if (!t.address && !t.hash && !t.output && !t.pubkey && !t.input)
     throw new TypeError("Not enough data");
-  e = Object.assign({ validate: !0 }, e || {});
-  function r(f) {
-    return Q(f) || (e.allowIncomplete && f === lt.OP_0) !== void 0;
-  }
-  c({
+  e = Object.assign({ validate: !0 }, e || {}), c({
     network: c.maybe(c.Object),
-    m: c.maybe(c.Number),
-    n: c.maybe(c.Number),
-    output: c.maybe(c.Buffer),
-    pubkeys: c.maybe(c.arrayOf(W)),
-    signatures: c.maybe(c.arrayOf(r)),
+    address: c.maybe(c.String),
+    hash: c.maybe(c.BufferN(20)),
+    output: c.maybe(c.BufferN(25)),
+    pubkey: c.maybe(W),
+    signature: c.maybe(Q),
     input: c.maybe(c.Buffer)
   }, t);
-  const s = {
-    network: t.network || M,
-    name: K.P2MS
+  const r = B(() => {
+    const o = h.from(Ut.decode(t.address)), u = o.readUInt8(0), f = o.subarray(1);
+    return { version: u, hash: f };
+  }), n = B(() => A(t.input)), s = t.network || M, i = {
+    name: K.P2PKH,
+    network: s,
+    hash: void 0
   };
-  let i = [], o = !1;
-  function u(f) {
-    o || (o = !0, i = A(f), s.m = i[0] - Gt, s.n = i[i.length - 2] - Gt, s.pubkeys = i.slice(1, -2));
-  }
-  if (y(s, "output", () => {
-    if (t.m && s.n && t.pubkeys)
-      return v([].concat(Gt + t.m, t.pubkeys, Gt + s.n, lt.OP_CHECKMULTISIG));
-  }), y(s, "m", () => {
-    if (s.output)
-      return u(s.output), s.m;
-  }), y(s, "n", () => {
-    if (s.pubkeys)
-      return s.pubkeys.length;
-  }), y(s, "pubkeys", () => {
+  if (y(i, "address", () => {
+    if (!i.hash)
+      return;
+    const o = h.allocUnsafe(21);
+    return o.writeUInt8(s.pubKeyHash, 0), i.hash.copy(o, 1), Ut.encode(o);
+  }), y(i, "hash", () => {
     if (t.output)
-      return u(t.output), s.pubkeys;
-  }), y(s, "signatures", () => {
-    if (!t.input)
+      return t.output.subarray(3, 23);
+    if (t.address)
+      return r().hash;
+    if (t.pubkey || i.pubkey)
+      return C(t.pubkey || i.pubkey);
+  }), y(i, "output", () => {
+    if (i.hash)
+      return v([
+        st.OP_DUP,
+        st.OP_HASH160,
+        i.hash,
+        st.OP_EQUALVERIFY,
+        st.OP_CHECKSIG
+      ]);
+  }), y(i, "pubkey", () => {
+    if (t.input)
+      return n()[1];
+  }), y(i, "signature", () => {
+    if (t.input)
+      return n()[0];
+  }), y(i, "input", () => {
+    if (!t.pubkey || !t.signature)
       return;
-    const f = A(t.input);
-    if (f != null)
-      return f.slice(1);
-  }), y(s, "input", () => {
-    if (t.signatures)
-      return v([lt.OP_0].concat(t.signatures));
-  }), y(s, "witness", () => {
-    if (s.input)
+    let o = t.pubkey;
+    if (t.useHybrid || t.useUncompressed) {
+      const u = Ie(t.pubkey);
+      u && (t.useUncompressed ? o = u.uncompressed : o = u.hybrid);
+    }
+    return v([t.signature, o]);
+  }), y(i, "witness", () => {
+    if (i.input)
       return [];
-  }), y(s, "name", () => {
-    if (!(!s.m || !s.n))
-      return `p2ms(${s.m} of ${s.n})`;
   }), e.validate) {
+    let o = h.from([]);
+    if (t.address) {
+      if (r().version !== s.pubKeyHash)
+        throw new TypeError("Invalid version or Network mismatch");
+      if (r().hash.length !== 20)
+        throw new TypeError("Invalid address");
+      o = r().hash;
+    }
+    if (t.hash) {
+      if (o.length > 0 && !o.equals(t.hash))
+        throw new TypeError("Hash mismatch");
+      o = t.hash;
+    }
     if (t.output) {
-      if (u(t.output), !c.Number(i[0]))
-        throw new TypeError("Output is invalid");
-      if (!c.Number(i[i.length - 2]))
-        throw new TypeError("Output is invalid");
-      if (i[i.length - 1] !== lt.OP_CHECKMULTISIG)
-        throw new TypeError("Output is invalid");
-      if (s.m <= 0 || s.n > 16 || s.m > s.n || s.n !== i.length - 3)
-        throw new TypeError("Output is invalid");
-      if (!s.pubkeys.every((f) => W(f)))
+      if (t.output.length !== 25 || t.output[0] !== st.OP_DUP || t.output[1] !== st.OP_HASH160 || t.output[2] !== 20 || t.output[23] !== st.OP_EQUALVERIFY || t.output[24] !== st.OP_CHECKSIG)
         throw new TypeError("Output is invalid");
-      if (t.m !== void 0 && t.m !== s.m)
-        throw new TypeError("m mismatch");
-      if (t.n !== void 0 && t.n !== s.n)
-        throw new TypeError("n mismatch");
-      if (t.pubkeys && !at(t.pubkeys, s.pubkeys))
-        throw new TypeError("Pubkeys mismatch");
+      const u = t.output.subarray(3, 23);
+      if (o.length > 0 && !o.equals(u))
+        throw new TypeError("Hash mismatch");
+      o = u;
     }
-    if (t.pubkeys) {
-      if (t.n !== void 0 && t.n !== t.pubkeys.length)
-        throw new TypeError("Pubkey count mismatch");
-      if (s.n = t.pubkeys.length, s.n < s.m)
-        throw new TypeError("Pubkey count cannot be less than m");
-    }
-    if (t.signatures) {
-      if (t.signatures.length < s.m)
-        throw new TypeError("Not enough signatures provided");
-      if (t.signatures.length > s.m)
-        throw new TypeError("Too many signatures provided");
+    if (t.pubkey) {
+      const u = C(t.pubkey);
+      let f = o.length > 0 && !o.equals(u);
+      if (f && (t.pubkey.length === 33 && (t.pubkey[0] === 2 || t.pubkey[0] === 3) || t.pubkey.length === 65 && t.pubkey[0] === 4)) {
+        const a = Ie(t.pubkey);
+        if (a) {
+          const p = C(a.uncompressed);
+          if (o.equals(p))
+            f = !1, t.useUncompressed = !0;
+          else {
+            const l = C(a.hybrid);
+            f = !o.equals(l), f || (t.useHybrid = !0);
+          }
+        }
+      }
+      if (f)
+        throw new TypeError("Hash mismatch");
+      o = u;
     }
     if (t.input) {
-      if (t.input[0] !== lt.OP_0)
+      const u = n();
+      if (u.length !== 2)
         throw new TypeError("Input is invalid");
-      if (s.signatures.length === 0 || !s.signatures.every(r))
-        throw new TypeError("Input has invalid signature(s)");
-      if (t.signatures && !at(t.signatures, s.signatures))
+      if (!Q(u[0]))
+        throw new TypeError("Input has invalid signature");
+      if (!W(u[1]))
+        throw new TypeError("Input has invalid pubkey");
+      if (t.signature && !t.signature.equals(u[0]))
         throw new TypeError("Signature mismatch");
-      if (t.m !== void 0 && t.m !== t.signatures.length)
-        throw new TypeError("Signature count mismatch");
-    }
-  }
-  return Object.assign(s, t);
-}
-const rr = E;
-function De(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({
-    network: c.maybe(c.Object),
-    output: c.maybe(c.Buffer),
-    pubkey: c.maybe(W),
-    signature: c.maybe(Q),
-    input: c.maybe(c.Buffer)
-  }, t);
-  const r = B(() => A(t.input)), n = t.network || M, s = {
-    name: K.P2PK,
-    network: n,
-    pubkey: void 0
-  };
-  if (y(s, "output", () => {
-    if (t.pubkey)
-      return v([t.pubkey, rr.OP_CHECKSIG]);
-  }), y(s, "pubkey", () => {
-    if (t.output)
-      return t.output.subarray(1, -1);
-  }), y(s, "signature", () => {
-    if (t.input)
-      return r()[0];
-  }), y(s, "input", () => {
-    if (t.signature)
-      return v([t.signature]);
-  }), y(s, "witness", () => {
-    if (s.input)
-      return [];
-  }), e.validate) {
-    if (t.output) {
-      if (t.output[t.output.length - 1] !== rr.OP_CHECKSIG)
-        throw new TypeError("Output is invalid");
-      if (!W(s.pubkey))
-        throw new TypeError("Output pubkey is invalid");
-      if (t.pubkey && !t.pubkey.equals(s.pubkey))
+      if (t.pubkey && !t.pubkey.equals(u[1]))
         throw new TypeError("Pubkey mismatch");
+      const f = C(u[1]);
+      if (o.length > 0 && !o.equals(f))
+        throw new TypeError("Hash mismatch (input)");
     }
-    if (t.signature && t.input && !t.input.equals(s.input))
-      throw new TypeError("Signature mismatch");
-    if (t.input) {
-      if (r().length !== 1)
-        throw new TypeError("Input is invalid");
-      if (!Q(s.signature))
-        throw new TypeError("Input has invalid signature");
-    }
-  }
-  return Object.assign(s, t);
-}
-const zs = {
-  p: 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2fn,
-  n: 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141n,
-  b: 7n,
-  Gx: 0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798n,
-  Gy: 0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8n
-}, { p: ct, n: hn, Gx: Ys, Gy: Zs, b: pn } = zs, Xt = 32, Ie = 64, G = (t = "") => {
-  throw new Error(t);
-}, ln = (t) => typeof t == "bigint", dn = (t) => typeof t == "string", Qs = (t) => t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array", Bt = (t, e) => !Qs(t) || typeof e == "number" && e > 0 && t.length !== e ? G("Uint8Array expected") : t, wn = (t) => new Uint8Array(t), Js = (t) => Uint8Array.from(t), gn = (t, e) => t.toString(16).padStart(e, "0"), yn = (t) => Array.from(Bt(t)).map((e) => gn(e, 2)).join(""), tt = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 }, nr = (t) => {
-  if (t >= tt._0 && t <= tt._9)
-    return t - tt._0;
-  if (t >= tt.A && t <= tt.F)
-    return t - (tt.A - 10);
-  if (t >= tt.a && t <= tt.f)
-    return t - (tt.a - 10);
-}, mn = (t) => {
-  const e = "hex invalid";
-  if (!dn(t))
-    return G(e);
-  const r = t.length, n = r / 2;
-  if (r % 2)
-    return G(e);
-  const s = wn(n);
-  for (let i = 0, o = 0; i < n; i++, o += 2) {
-    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;
-}, bn = (t, e) => Bt(dn(t) ? mn(t) : Js(Bt(t)), e), sr = (...t) => {
-  const e = wn(t.reduce((n, s) => n + Bt(s).length, 0));
-  let r = 0;
-  return t.forEach((n) => {
-    e.set(n, r), r += n.length;
-  }), e;
-}, te = BigInt, Lt = (t, e, r, n = "bad number: out of range") => ln(t) && e <= t && t < r ? t : G(n), m = (t, e = ct) => {
-  const r = t % e;
-  return r >= 0n ? r : e + r;
-}, ti = (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; ) {
-    const o = n / r, u = n % r, f = s - i * o;
-    n = r, r = u, s = i, i = f;
-  }
-  return n === 1n ? m(s, e) : G("no inverse");
-}, ir = (t) => t instanceof R ? t : G("Point expected"), En = (t) => m(m(t * t) * t + pn), or = (t) => Lt(t, 0n, ct), jt = (t) => Lt(t, 1n, ct), ei = (t) => Lt(t, 1n, hn), He = (t) => (t & 1n) === 0n, Sn = (t) => Uint8Array.of(t), ri = (t) => Sn(He(t) ? 2 : 3), ni = (t) => {
-  const e = En(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;
-  return m(r * r) === e ? r : G("sqrt invalid");
-};
-class R {
-  static BASE;
-  static ZERO;
-  px;
-  py;
-  pz;
-  constructor(e, r, n) {
-    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) {
-    Bt(e);
-    let r;
-    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 = ni(i);
-      const f = He(u);
-      He(te(n)) !== f && (u = m(-u)), r = new R(i, u, 1n);
-    }
-    return o === Ie + 1 && n === 4 && (r = new R(i, ur(s, Xt, Ie), 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 } = ir(e), f = m(r * u), a = m(i * s), p = m(n * u), l = m(o * s);
-    return f === a && p === l;
-  }
-  is0() {
-    return this.equals(ut);
-  }
-  /** Flip point over y coordinate. */
-  negate() {
-    return new R(this.px, m(-this.py), this.pz);
-  }
-  /** Point doubling: P+P, complete formula. */
-  double() {
-    return this.add(this);
-  }
-  /**
-   * Point addition: P+Q, complete, exception-free formula
-   * (Renes-Costello-Batina, algo 1 of [2015/1060](https://eprint.iacr.org/2015/1060)).
-   * Cost: `12M + 0S + 3*a + 3*b3 + 23add`.
-   */
-  // prettier-ignore
-  add(e) {
-    const { px: r, py: n, pz: s } = this, { px: i, py: o, pz: u } = ir(e), f = 0n, a = pn;
-    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);
-    k = m(k * H), H = m(w + S), k = m(k - H), H = m(r + s);
-    let _ = m(i + u);
-    return H = m(H * _), _ = m(w + P), H = m(H - _), _ = m(n + s), p = m(o + u), _ = m(_ * p), p = m(S + P), _ = m(_ - p), d = m(f * H), p = m(b * P), d = m(p + d), p = m(S - d), d = m(S + d), l = m(p * d), S = m(w + w), S = m(S + w), P = m(f * P), H = m(b * H), S = m(S + P), P = m(w - P), P = m(f * P), H = m(H + P), w = m(S * H), l = m(l + w), w = m(_ * H), p = m(k * p), p = m(p - w), w = m(k * S), d = m(_ * d), d = m(d + w), new R(p, l, d);
-  }
-  /**
-   * Point-by-scalar multiplication. Scalar must be in range 1 <= n < CURVE.n.
-   * Uses {@link wNAF} for base point.
-   * Uses fake point to mitigate side-channel leakage.
-   * @param n scalar by which point is multiplied
-   * @param safe safe mode guards against timing attacks; unsafe mode is faster
-   */
-  multiply(e, r = !0) {
-    if (!r && e === 0n)
-      return ut;
-    if (ei(e), e === 1n)
-      return this;
-    if (this.equals(wt))
-      return fi(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));
-    return n;
-  }
-  /** Convert point to 2d xy affine point. (X, Y, Z) ∋ (x=X/Z, y=Y/Z) */
-  toAffine() {
-    const { px: e, py: r, pz: n } = this;
-    if (this.equals(ut))
-      return { x: 0n, y: 0n };
-    if (n === 1n)
-      return { x: e, y: r };
-    const s = ti(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) === En(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 = fr(r);
-    return e ? sr(ri(n), s) : sr(Sn(4), s, fr(n));
-  }
-  /** Create 3d xyz point from 2d xy. (0, 0) => (0, 1, 0), not (0, 0, 1) */
-  static fromAffine(e) {
-    const { x: r, y: n } = e;
-    return r === 0n && n === 0n ? ut : new R(r, n, 1n);
-  }
-  toHex(e) {
-    return yn(this.toBytes(e));
-  }
-  static fromPrivateKey(e) {
-    return wt.multiply(ii(e));
-  }
-  static fromHex(e) {
-    return R.fromBytes(bn(e));
-  }
-  get x() {
-    return this.toAffine().x;
-  }
-  get y() {
-    return this.toAffine().y;
-  }
-  toRawBytes(e) {
-    return this.toBytes(e);
   }
+  return Object.assign(i, t);
 }
-const wt = new R(Ys, Zs, 1n), ut = new R(0n, 1n, 0n);
-R.BASE = wt;
-R.ZERO = ut;
-const _n = (t) => te("0x" + (yn(t) || "0")), ur = (t, e, r) => _n(t.subarray(e, r)), si = 2n ** 256n, fr = (t) => mn(gn(Lt(t, 0n, si), Ie)), ii = (t) => {
-  const e = ln(t) ? t : _n(bn(t, Xt));
-  return Lt(e, 1n, hn, "private key invalid 3");
-}, ee = 8, oi = 256, Tn = Math.ceil(oi / ee) + 1, ve = 2 ** (ee - 1), ui = () => {
-  const t = [];
-  let e = wt, r = e;
-  for (let n = 0; n < Tn; n++) {
-    r = e, t.push(r);
-    for (let s = 1; s < ve; s++)
-      r = r.add(e), t.push(r);
-    e = r.double();
-  }
-  return t;
-};
-let cr;
-const ar = (t, e) => {
-  const r = e.negate();
-  return t ? r : e;
-}, fi = (t) => {
-  const e = cr || (cr = ui());
-  let r = ut, n = wt;
-  const s = 2 ** ee, i = s, o = te(s - 1), u = te(ee);
-  for (let f = 0; f < Tn; f++) {
-    let a = Number(t & o);
-    t >>= u, a > ve && (a -= i, t += 1n);
-    const p = f * ve, l = p, d = p + Math.abs(a) - 1, b = f % 2 !== 0, w = a < 0;
-    a === 0 ? n = n.add(ar(b, e[l])) : r = r.add(ar(w, e[d]));
-  }
-  return { p: r, f: n };
-}, _t = E;
-function yt(t, e) {
+const _t = E;
+function mt(t, e) {
   if (!t.address && !t.hash && !t.output && !t.redeem && !t.input)
     throw new TypeError("Not enough data");
   e = Object.assign({ validate: !0 }, e || {}), c({
@@ -2358,7 +2093,7 @@ function yt(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 (Re(p) > 201)
+        if (Fe(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))
@@ -2373,7 +2108,7 @@ function yt(t, e) {
           throw new TypeError("Input and witness provided");
         if (p) {
           const d = A(a.input);
-          if (!oe(d))
+          if (!ue(d))
             throw new TypeError("Non push-only scriptSig");
         }
       }
@@ -2403,61 +2138,269 @@ function yt(t, e) {
   }
   return Object.assign(n, t);
 }
-const hr = E, pr = 1, ci = 80;
-function mt(t, e) {
-  if (!t.address && !t.output && !t.pubkey && !t.internalPubkey && !(t.witness && t.witness.length > 1))
-    throw new TypeError("Not enough data");
-  e = Object.assign({ validate: !0 }, e || {}), c({
-    address: c.maybe(c.String),
-    input: c.maybe(c.BufferN(0)),
-    network: c.maybe(c.Object),
-    output: c.maybe(c.BufferN(34)),
-    internalPubkey: c.maybe(c.BufferN(32)),
-    hash: c.maybe(c.BufferN(32)),
-    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(Be),
-    redeem: c.maybe({
-      output: c.maybe(c.Buffer),
-      redeemVersion: c.maybe(c.Number),
-      witness: c.maybe(c.arrayOf(c.Buffer))
-    }),
-    redeemVersion: c.maybe(c.Number)
-  }, t);
-  const r = B(() => Ve(t.address)), n = B(() => {
-    if (!(!t.witness || !t.witness.length))
-      return t.witness.length >= 2 && t.witness[t.witness.length - 1][0] === ci ? t.witness.slice(0, -1) : t.witness.slice();
-  }), s = B(() => {
-    if (t.scriptTree)
-      return Jt(t.scriptTree);
-    if (t.hash)
-      return { hash: t.hash };
-  }), i = t.network || M, o = {
-    name: K.P2TR,
-    network: i
-  };
-  if (y(o, "address", () => {
-    if (!o.pubkey)
-      return;
-    const u = I.bech32m.toWords(o.pubkey);
-    return u.unshift(pr), I.bech32m.encode(i.bech32, u);
-  }), y(o, "hash", () => {
-    const u = s();
-    if (u)
-      return u.hash;
+const vt = {};
+function oo(t) {
+  t ? t !== vt.eccLib && ($s(t), vt.eccLib = t) : vt.eccLib = t;
+}
+function He() {
+  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) => {
+    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))));
+  });
+}
+function L(t) {
+  if (!t)
+    throw new Error("ecc library invalid");
+}
+const qs = [
+  {
+    pubkey: "79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798",
+    tweak: "fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364140",
+    parity: -1,
+    result: null
+  },
+  {
+    pubkey: "1617d38ed8d8657da4d4761e8057bc396ea9e4b9d29776d4be096016dbd2509b",
+    tweak: "a8397a935f0dfceba6ba9618f6451ef4d80637abf4e6af2669fbc9de6a8fd2ac",
+    parity: 1,
+    result: "e478f99dab91052ab39a33ea35fd5e6e4933f4d28023cd597c9a1f6760346adf"
+  },
+  {
+    pubkey: "2c0b7cf95324a07d05398b240174dc0c2be444d96b159aa6c7f7b1e668680991",
+    tweak: "823c3cd2142744b075a87eade7e1b8678ba308d566226a0056ca2b7a76f86b47",
+    parity: 0,
+    result: "9534f8dc8c6deda2dc007655981c78b49c5d96c778fbf363462a11ec9dfd948c"
+  }
+], { typeforce: Sn } = ie;
+function _n(t, e) {
+  if (typeof t != "number")
+    throw new Error("cannot write a non-number as a number");
+  if (t < 0)
+    throw new Error("specified a negative value for writing an unsigned value");
+  if (t > e)
+    throw new Error("RangeError: value out of range");
+  if (Math.floor(t) !== t)
+    throw new Error("value has a fractional component");
+}
+function Xs(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) {
+  return _n(e, 9007199254740991), t.writeInt32LE(e & -1, r), t.writeUInt32LE(Math.floor(e / 4294967296), r + 4), r + 8;
+}
+function We(t) {
+  if (t.length < 1)
+    return t;
+  let e = t.length - 1, r = 0;
+  for (let n = 0; n < t.length / 2; n++)
+    r = t[n], t[n] = t[e], t[e] = r, e--;
+  return t;
+}
+function lr(t) {
+  const e = h.allocUnsafe(t.length);
+  return t.copy(e), e;
+}
+class x {
+  constructor(e, r = 0) {
+    this.buffer = e, this.offset = r, Sn(z(V, Y), [e, r]);
+  }
+  static withCapacity(e) {
+    return new x(h.alloc(e));
+  }
+  writeUInt8(e) {
+    this.offset = this.buffer.writeUInt8(e, this.offset);
+  }
+  writeInt32(e) {
+    this.offset = this.buffer.writeInt32LE(e, this.offset);
+  }
+  writeUInt32(e) {
+    this.offset = this.buffer.writeUInt32LE(e, this.offset);
+  }
+  writeUInt64(e) {
+    this.offset = js(this.buffer, e, this.offset);
+  }
+  writeVarInt(e) {
+    const r = Br(e, this.buffer, this.offset);
+    this.offset += r.bytes;
+  }
+  writeSlice(e) {
+    if (this.buffer.length < this.offset + e.length)
+      throw new Error("Cannot write slice out of bounds");
+    this.offset += e.copy(this.buffer, this.offset);
+  }
+  writeVarSlice(e) {
+    this.writeVarInt(e.length), this.writeSlice(e);
+  }
+  writeVector(e) {
+    this.writeVarInt(e.length), e.forEach((r) => this.writeVarSlice(r));
+  }
+  end() {
+    if (this.buffer.length === this.offset)
+      return this.buffer;
+    throw new Error(`buffer size ${this.buffer.length}, offset ${this.offset}`);
+  }
+}
+class zs {
+  constructor(e, r = 0) {
+    this.buffer = e, this.offset = r, Sn(z(V, Y), [e, r]);
+  }
+  readUInt8() {
+    const e = this.buffer.readUInt8(this.offset);
+    return this.offset++, e;
+  }
+  readInt32() {
+    const e = this.buffer.readInt32LE(this.offset);
+    return this.offset += 4, e;
+  }
+  readUInt32() {
+    const e = this.buffer.readUInt32LE(this.offset);
+    return this.offset += 4, e;
+  }
+  readUInt64() {
+    const e = Xs(this.buffer, this.offset);
+    return this.offset += 8, e;
+  }
+  readVarInt() {
+    const e = Kn(this.buffer, this.offset);
+    return this.offset += e.bytes, e.numberValue || 0;
+  }
+  readSlice(e) {
+    if (this.buffer.length < this.offset + e)
+      throw new Error("Cannot read slice out of bounds");
+    const r = h.from(this.buffer.subarray(this.offset, this.offset + e));
+    return this.offset += e, r;
+  }
+  readVarSlice() {
+    return this.readSlice(this.readVarInt());
+  }
+  readVector() {
+    const e = this.readVarInt(), r = [];
+    for (let n = 0; n < e; n++)
+      r.push(this.readVarSlice());
+    return r;
+  }
+}
+const Ge = 192, Tn = 128, Ys = (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.`);
+  const r = (t.length - 33) / 32;
+  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);
+  }
+  return n;
+}
+function ee(t) {
+  if (ne(t))
+    return { hash: Z(t) };
+  const e = [ee(t[0]), ee(t[1])];
+  e.sort((s, i) => s.hash.compare(i.hash));
+  const [r, n] = e;
+  return {
+    hash: ve(r.hash, n.hash),
+    left: r,
+    right: n
+  };
+}
+function Bt(t, e) {
+  if (Ys(t)) {
+    const r = Bt(t.left, e);
+    if (r !== void 0)
+      return [...r, t.right.hash];
+    const n = Bt(t.right, e);
+    if (n !== void 0)
+      return [...n, t.left.hash];
+  } else if (t.hash.equals(e))
+    return [];
+}
+function Z(t) {
+  const e = t.version || Ge;
+  return Rt("TapLeaf", U.concat([U.from([e]), Qs(t.output)]));
+}
+function Zs(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);
+  return !n || n.xOnlyPubkey === null ? null : {
+    parity: n.parity,
+    x: U.from(n.xOnlyPubkey)
+  };
+}
+function ve(t, e) {
+  return Rt("TapBranch", U.concat([t, e]));
+}
+function Qs(t) {
+  const e = kt(t.length), r = U.allocUnsafe(e);
+  return Br(t.length, r), U.concat([r, t]);
+}
+const dr = E, wr = 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");
+  e = Object.assign({ validate: !0 }, e || {}), c({
+    address: c.maybe(c.String),
+    input: c.maybe(c.BufferN(0)),
+    network: c.maybe(c.Object),
+    output: c.maybe(c.BufferN(34)),
+    internalPubkey: c.maybe(c.BufferN(32)),
+    hash: c.maybe(c.BufferN(32)),
+    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),
+    redeem: c.maybe({
+      output: c.maybe(c.Buffer),
+      redeemVersion: c.maybe(c.Number),
+      witness: c.maybe(c.arrayOf(c.Buffer))
+    }),
+    redeemVersion: c.maybe(c.Number)
+  }, t);
+  const r = B(() => Be(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();
+  }), s = B(() => {
+    if (t.scriptTree)
+      return ee(t.scriptTree);
+    if (t.hash)
+      return { hash: t.hash };
+  }), i = t.network || M, o = {
+    name: K.P2TR,
+    network: i
+  };
+  if (y(o, "address", () => {
+    if (!o.pubkey)
+      return;
+    const u = I.bech32m.toWords(o.pubkey);
+    return u.unshift(wr), I.bech32m.encode(i.bech32, u);
+  }), y(o, "hash", () => {
+    const u = s();
+    if (u)
+      return u.hash;
     const f = n();
     if (f && f.length > 1) {
       const a = f[f.length - 1], p = a[0] & Pt, l = f[f.length - 2], d = Z({
         output: l,
         version: p
       });
-      return Qt(a, d);
+      return te(a, d);
     }
   }), y(o, "output", () => {
     if (o.pubkey)
-      return v([hr.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 : Me), y(o, "redeem", () => {
+      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", () => {
     const u = n();
     if (!(!u || u.length < 2))
       return {
@@ -2497,7 +2440,7 @@ function mt(t, e) {
       const f = Z({
         output: t.redeem.output,
         version: o.redeemVersion
-      }), a = Ct(u, f);
+      }), a = Bt(u, f);
       if (!a)
         return;
       const p = At(t.internalPubkey, u.hash);
@@ -2513,7 +2456,7 @@ function mt(t, e) {
     if (t.address) {
       if (i && i.bech32 !== r().prefix)
         throw new TypeError("Invalid prefix or Network mismatch");
-      if (r().version !== pr)
+      if (r().version !== wr)
         throw new TypeError("Invalid address version");
       if (r().data.length !== 32)
         throw new TypeError("Invalid address data");
@@ -2525,7 +2468,7 @@ function mt(t, e) {
       u = t.pubkey;
     }
     if (t.output) {
-      if (t.output.length !== 34 || t.output[0] !== hr.OP_1 || t.output[1] !== 32)
+      if (t.output.length !== 34 || t.output[0] !== dr.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");
@@ -2537,7 +2480,7 @@ function mt(t, e) {
         throw new TypeError("Pubkey mismatch");
       u = p.x;
     }
-    if (u && u.length && !Ae().isXOnlyPoint(u))
+    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))
@@ -2547,7 +2490,7 @@ function mt(t, e) {
         output: t.redeem.output,
         version: o.redeemVersion
       });
-      if (!Ct(f, p))
+      if (!Bt(f, p))
         throw new TypeError("Redeem script not in tree");
     }
     const a = n();
@@ -2579,12 +2522,12 @@ function mt(t, e) {
         const d = p.subarray(1, 33);
         if (t.internalPubkey && !t.internalPubkey.equals(d))
           throw new TypeError("Internal pubkey mismatch");
-        if (!Ae().isXOnlyPoint(d))
+        if (!He().isXOnlyPoint(d))
           throw new TypeError("Invalid internalPubkey for p2tr witness");
         const b = p[0] & Pt, w = a[a.length - 2], S = Z({
           output: w,
           version: b
-        }), P = Qt(p, S), k = At(d, P);
+        }), P = te(p, S), k = At(d, P);
         if (!k)
           throw new TypeError("Invalid outputKey for p2tr witness");
         if (u.length && !u.equals(k.x))
@@ -2595,8 +2538,8 @@ function mt(t, e) {
   }
   return Object.assign(o, t);
 }
-const lr = E, ai = h.alloc(0);
-function Vt(t, e) {
+const gr = E, ti = h.alloc(0);
+function Lt(t, e) {
   if (!t.address && !t.hash && !t.output && !t.pubkey && !t.witness)
     throw new TypeError("Not enough data");
   e = Object.assign({ validate: !0 }, e || {}), c({
@@ -2627,219 +2570,556 @@ function Vt(t, e) {
     return i.unshift(0), I.bech32.encode(n.bech32, i);
   }), y(s, "hash", () => {
     if (t.output)
-      return t.output.subarray(2, 22);
-    if (t.address)
-      return r().data;
-    if (t.pubkey || s.pubkey)
-      return C(t.pubkey || s.pubkey);
-  }), y(s, "output", () => {
-    if (s.hash)
-      return v([lr.OP_0, s.hash]);
-  }), y(s, "pubkey", () => {
-    if (t.pubkey)
-      return t.pubkey;
-    if (t.witness)
-      return t.witness[1];
-  }), y(s, "signature", () => {
-    if (t.witness)
-      return t.witness[0];
+      return t.output.subarray(2, 22);
+    if (t.address)
+      return r().data;
+    if (t.pubkey || s.pubkey)
+      return C(t.pubkey || s.pubkey);
+  }), y(s, "output", () => {
+    if (s.hash)
+      return v([gr.OP_0, s.hash]);
+  }), y(s, "pubkey", () => {
+    if (t.pubkey)
+      return t.pubkey;
+    if (t.witness)
+      return t.witness[1];
+  }), y(s, "signature", () => {
+    if (t.witness)
+      return t.witness[0];
+  }), y(s, "input", () => {
+    if (s.witness)
+      return ti;
+  }), y(s, "witness", () => {
+    if (t.pubkey && t.signature)
+      return [t.signature, t.pubkey];
+  }), e.validate) {
+    let i = h.from([]);
+    if (t.address) {
+      if (n && n.bech32 !== r().prefix)
+        throw new TypeError("Invalid prefix or Network mismatch");
+      if (r().version !== 0)
+        throw new TypeError("Invalid address version");
+      if (r().data.length !== 20)
+        throw new TypeError("Invalid address data");
+      i = r().data;
+    }
+    if (t.hash) {
+      if (i.length > 0 && !i.equals(t.hash))
+        throw new TypeError("Hash mismatch");
+      i = t.hash;
+    }
+    if (t.output) {
+      if (t.output.length !== 22 || t.output[0] !== gr.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");
+      i = t.output.subarray(2);
+    }
+    if (t.pubkey) {
+      const o = C(t.pubkey);
+      if (i.length > 0 && !i.equals(o))
+        throw new TypeError("Hash mismatch");
+      if (i = o, !W(t.pubkey) || t.pubkey.length !== 33)
+        throw new TypeError("Invalid pubkey for p2wpkh");
+    }
+    if (t.witness) {
+      if (t.witness.length !== 2)
+        throw new TypeError("Witness is invalid");
+      if (!Q(t.witness[0]))
+        throw new TypeError("Witness has invalid signature");
+      if (!W(t.witness[1]) || t.witness[1].length !== 33)
+        throw new TypeError("Witness has invalid pubkey");
+      if (t.signature && !t.signature.equals(t.witness[0]))
+        throw new TypeError("Signature mismatch");
+      if (t.pubkey && !t.pubkey.equals(t.witness[1]))
+        throw new TypeError("Pubkey mismatch");
+      const o = C(t.witness[1]);
+      if (i.length > 0 && !i.equals(o))
+        throw new TypeError("Hash mismatch");
+    }
+  }
+  return Object.assign(s, t);
+}
+const yr = E, ge = h.alloc(0);
+function Kt(t) {
+  return !!(h.isBuffer(t) && t.length === 65 && t[0] === 4 && W(t));
+}
+function Et(t, e) {
+  if (!t.address && !t.hash && !t.output && !t.redeem && !t.witness)
+    throw new TypeError("Not enough data");
+  e = Object.assign({ validate: !0 }, e || {}), c({
+    network: c.maybe(c.Object),
+    address: c.maybe(c.String),
+    hash: c.maybe(c.BufferN(32)),
+    output: c.maybe(c.BufferN(34)),
+    redeem: c.maybe({
+      input: c.maybe(c.Buffer),
+      network: c.maybe(c.Object),
+      output: c.maybe(c.Buffer),
+      witness: c.maybe(c.arrayOf(c.Buffer))
+    }),
+    input: c.maybe(c.BufferN(0)),
+    witness: c.maybe(c.arrayOf(c.Buffer))
+  }, t);
+  const r = B(() => {
+    const o = I.bech32.decode(t.address), u = o.words.shift(), f = I.bech32.fromWords(o.words);
+    return {
+      version: u,
+      prefix: o.prefix,
+      data: h.from(f)
+    };
+  }), n = B(() => A(t.redeem.input));
+  let s = t.network;
+  s || (s = t.redeem && t.redeem.network || M);
+  const i = {
+    network: s,
+    name: K.P2WSH
+  };
+  if (y(i, "address", () => {
+    if (!i.hash)
+      return;
+    const o = I.bech32.toWords(i.hash);
+    return o.unshift(0), I.bech32.encode(s.bech32, o);
+  }), y(i, "hash", () => {
+    if (t.output)
+      return t.output.subarray(2);
+    if (t.address)
+      return r().data;
+    if (i.redeem && i.redeem.output)
+      return D(i.redeem.output);
+  }), y(i, "output", () => {
+    if (i.hash)
+      return v([yr.OP_0, i.hash]);
+  }), y(i, "redeem", () => {
+    if (t.witness)
+      return {
+        output: t.witness[t.witness.length - 1],
+        input: ge,
+        witness: t.witness.slice(0, -1)
+      };
+  }), y(i, "input", () => {
+    if (i.witness)
+      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());
+      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)
+      return [].concat(t.redeem.witness, t.redeem.output);
+  }), y(i, "name", () => {
+    const o = ["p2wsh"];
+    return i.redeem !== void 0 && i.redeem.name !== void 0 && o.push(i.redeem.name), o.join("-");
+  }), e.validate) {
+    let o = h.from([]);
+    if (t.address) {
+      if (r().prefix !== s.bech32)
+        throw new TypeError("Invalid prefix or Network mismatch");
+      if (r().version !== 0)
+        throw new TypeError("Invalid address version");
+      if (r().data.length !== 32)
+        throw new TypeError("Invalid address data");
+      o = r().data;
+    }
+    if (t.hash) {
+      if (o.length > 0 && !o.equals(t.hash))
+        throw new TypeError("Hash mismatch");
+      o = t.hash;
+    }
+    if (t.output) {
+      if (t.output.length !== 34 || t.output[0] !== yr.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))
+        throw new TypeError("Hash mismatch");
+      o = u;
+    }
+    if (t.redeem) {
+      if (t.redeem.network && t.redeem.network !== s)
+        throw new TypeError("Network mismatch");
+      if (t.redeem.input && t.redeem.input.length > 0 && t.redeem.witness && t.redeem.witness.length > 0)
+        throw new TypeError("Ambiguous witness source");
+      if (t.redeem.output) {
+        const u = A(t.redeem.output);
+        if (!u || u.length < 1)
+          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)
+          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))
+          throw new TypeError("Hash mismatch");
+        o = f;
+      }
+      if (t.redeem.input && !ue(n()))
+        throw new TypeError("Non push-only scriptSig");
+      if (t.witness && t.redeem.witness && !at(t.witness, t.redeem.witness))
+        throw new TypeError("Witness and redeem.witness mismatch");
+      if (t.redeem.input && n().some(Kt) || t.redeem.output && (A(t.redeem.output) || []).some(Kt))
+        throw new TypeError("redeem.input or redeem.output contains uncompressed pubkey");
+    }
+    if (t.witness && t.witness.length > 0) {
+      const u = t.witness[t.witness.length - 1];
+      if (t.redeem && t.redeem.output && !t.redeem.output.equals(u))
+        throw new TypeError("Witness and redeem.output mismatch");
+      if (t.witness.some(Kt) || (A(u) || []).some(Kt))
+        throw new TypeError("Witness contains uncompressed pubkey");
+    }
+  }
+  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) => {
+  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)
+      throw new TypeError("Invalid version for segwit address");
+    if (r === 1)
+      throw new TypeError("taproot");
+    return !0;
+  } catch {
+  }
+  return !1;
+};
+function si(t, e) {
+  if (!h.isBuffer(t))
+    throw new TypeError("output must be a Buffer");
+  if (!e.bech32Opnet)
+    throw new Error("Network does not support opnet");
+  const r = t[0];
+  let n = 1, s;
+  if (t[1] < 76)
+    s = t[1], n = 2;
+  else if (t[1] === 76)
+    s = t[2], n = 3;
+  else
+    throw new TypeError("Unsupported push opcode in script");
+  const i = h.from(t.subarray(n, n + s));
+  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)
+    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) {
+  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)
+    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);
+}
+function oi(t) {
+  const e = h.from(Ut.decode(t));
+  if (e.length < 21)
+    throw new TypeError(t + " is too short");
+  if (e.length > 21)
+    throw new TypeError(t + " is too long");
+  const r = e.readUInt8(0), n = h.from(e.subarray(1));
+  return { version: r, hash: n };
+}
+function ui(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);
+}
+function fi(t, e) {
+  e = e || M;
+  try {
+    return yt({ output: t, network: e }).address;
+  } catch {
+  }
+  try {
+    return mt({ output: t, network: e }).address;
+  } catch {
+  }
+  try {
+    return Lt({ output: t, network: e }).address;
+  } catch {
+  }
+  try {
+    return Et({ output: t, network: e }).address;
+  } catch {
+  }
+  try {
+    return bt({ output: t, network: e }).address;
+  } catch {
+  }
+  try {
+    return si(t, e);
+  } catch {
+  }
+  try {
+    return ii(t, e);
+  } catch {
+  }
+  throw new Error(Xr(t) + " has no matching Address");
+}
+function ci(t, e) {
+  e = e || M;
+  let r, n;
+  try {
+    r = oi(t);
+  } catch {
+  }
+  if (r) {
+    if (r.version === e.pubKeyHash)
+      return yt({ hash: r.hash }).output;
+    if (r.version === e.scriptHash)
+      return mt({ hash: r.hash }).output;
+  } else {
+    try {
+      n = Be(t);
+    } catch {
+    }
+    if (n) {
+      if (n.prefix !== e.bech32 && e.bech32Opnet && n.prefix !== e.bech32Opnet)
+        throw new Error(t + " has an invalid prefix");
+      if (n.version === 0) {
+        if (n.data.length === 20)
+          return Lt({ hash: n.data }).output;
+        if (n.data.length === 32)
+          return Et({ hash: n.data }).output;
+      } else if (n.version === 1) {
+        if (n.data.length === 32)
+          return bt({ pubkey: n.data }).output;
+      } else if (n.version === xe) {
+        if (!e.bech32Opnet)
+          throw new Error(t + " has an invalid prefix");
+        return Yr({
+          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,
+          n.data
+        ]);
+    }
+  }
+  throw new TypeError(t + " has no matching Script");
+}
+const mr = E;
+function ai(t, e) {
+  if (!t.data && !t.output)
+    throw new TypeError("Not enough data");
+  e = Object.assign({ validate: !0 }, e || {}), c({
+    network: c.maybe(c.Object),
+    output: c.maybe(c.Buffer),
+    data: c.maybe(c.arrayOf(c.Buffer))
+  }, t);
+  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));
+  }), y(n, "data", () => {
+    if (!t.output)
+      return;
+    const s = A(t.output);
+    if (s != null)
+      return s.slice(1);
+  }), e.validate && t.output) {
+    const s = A(t.output);
+    if (s[0] !== mr.OP_RETURN)
+      throw new TypeError("Output is invalid");
+    if (!s.slice(1).every(c.Buffer))
+      throw new TypeError("Output is invalid");
+    if (t.data && !at(t.data, n.data))
+      throw new TypeError("Data mismatch");
+  }
+  return Object.assign(n, t);
+}
+const lt = E, Mt = lt.OP_RESERVED;
+function Vt(t, e) {
+  if (!t.input && !t.output && !(t.pubkeys && t.m !== void 0) && !t.signatures)
+    throw new TypeError("Not enough data");
+  e = Object.assign({ validate: !0 }, e || {});
+  function r(f) {
+    return Q(f) || (e.allowIncomplete && f === lt.OP_0) !== void 0;
+  }
+  c({
+    network: c.maybe(c.Object),
+    m: c.maybe(c.Number),
+    n: c.maybe(c.Number),
+    output: c.maybe(c.Buffer),
+    pubkeys: c.maybe(c.arrayOf(W)),
+    signatures: c.maybe(c.arrayOf(r)),
+    input: c.maybe(c.Buffer)
+  }, t);
+  const s = {
+    network: t.network || M,
+    name: K.P2MS
+  };
+  let i = [], o = !1;
+  function u(f) {
+    o || (o = !0, i = A(f), s.m = i[0] - Mt, s.n = i[i.length - 2] - Mt, s.pubkeys = i.slice(1, -2));
+  }
+  if (y(s, "output", () => {
+    if (t.m && s.n && t.pubkeys)
+      return v([].concat(Mt + t.m, t.pubkeys, Mt + s.n, lt.OP_CHECKMULTISIG));
+  }), y(s, "m", () => {
+    if (s.output)
+      return u(s.output), s.m;
+  }), y(s, "n", () => {
+    if (s.pubkeys)
+      return s.pubkeys.length;
+  }), y(s, "pubkeys", () => {
+    if (t.output)
+      return u(t.output), s.pubkeys;
+  }), y(s, "signatures", () => {
+    if (!t.input)
+      return;
+    const f = A(t.input);
+    if (f != null)
+      return f.slice(1);
   }), y(s, "input", () => {
-    if (s.witness)
-      return ai;
+    if (t.signatures)
+      return v([lt.OP_0].concat(t.signatures));
   }), y(s, "witness", () => {
-    if (t.pubkey && t.signature)
-      return [t.signature, t.pubkey];
+    if (s.input)
+      return [];
+  }), y(s, "name", () => {
+    if (!(!s.m || !s.n))
+      return `p2ms(${s.m} of ${s.n})`;
   }), e.validate) {
-    let i = h.from([]);
-    if (t.address) {
-      if (n && n.bech32 !== r().prefix)
-        throw new TypeError("Invalid prefix or Network mismatch");
-      if (r().version !== 0)
-        throw new TypeError("Invalid address version");
-      if (r().data.length !== 20)
-        throw new TypeError("Invalid address data");
-      i = r().data;
-    }
-    if (t.hash) {
-      if (i.length > 0 && !i.equals(t.hash))
-        throw new TypeError("Hash mismatch");
-      i = t.hash;
-    }
     if (t.output) {
-      if (t.output.length !== 22 || t.output[0] !== lr.OP_0 || t.output[1] !== 20)
+      if (u(t.output), !c.Number(i[0]))
         throw new TypeError("Output is invalid");
-      if (i.length > 0 && !i.equals(t.output.subarray(2)))
-        throw new TypeError("Hash mismatch");
-      i = t.output.subarray(2);
+      if (!c.Number(i[i.length - 2]))
+        throw new TypeError("Output is invalid");
+      if (i[i.length - 1] !== lt.OP_CHECKMULTISIG)
+        throw new TypeError("Output is invalid");
+      if (s.m <= 0 || s.n > 16 || s.m > s.n || s.n !== i.length - 3)
+        throw new TypeError("Output is invalid");
+      if (!s.pubkeys.every((f) => W(f)))
+        throw new TypeError("Output is invalid");
+      if (t.m !== void 0 && t.m !== s.m)
+        throw new TypeError("m mismatch");
+      if (t.n !== void 0 && t.n !== s.n)
+        throw new TypeError("n mismatch");
+      if (t.pubkeys && !at(t.pubkeys, s.pubkeys))
+        throw new TypeError("Pubkeys mismatch");
     }
-    if (t.pubkey) {
-      const o = C(t.pubkey);
-      if (i.length > 0 && !i.equals(o))
-        throw new TypeError("Hash mismatch");
-      if (i = o, !W(t.pubkey) || t.pubkey.length !== 33)
-        throw new TypeError("Invalid pubkey for p2wpkh");
+    if (t.pubkeys) {
+      if (t.n !== void 0 && t.n !== t.pubkeys.length)
+        throw new TypeError("Pubkey count mismatch");
+      if (s.n = t.pubkeys.length, s.n < s.m)
+        throw new TypeError("Pubkey count cannot be less than m");
     }
-    if (t.witness) {
-      if (t.witness.length !== 2)
-        throw new TypeError("Witness is invalid");
-      if (!Q(t.witness[0]))
-        throw new TypeError("Witness has invalid signature");
-      if (!W(t.witness[1]) || t.witness[1].length !== 33)
-        throw new TypeError("Witness has invalid pubkey");
-      if (t.signature && !t.signature.equals(t.witness[0]))
+    if (t.signatures) {
+      if (t.signatures.length < s.m)
+        throw new TypeError("Not enough signatures provided");
+      if (t.signatures.length > s.m)
+        throw new TypeError("Too many signatures provided");
+    }
+    if (t.input) {
+      if (t.input[0] !== lt.OP_0)
+        throw new TypeError("Input is invalid");
+      if (s.signatures.length === 0 || !s.signatures.every(r))
+        throw new TypeError("Input has invalid signature(s)");
+      if (t.signatures && !at(t.signatures, s.signatures))
         throw new TypeError("Signature mismatch");
-      if (t.pubkey && !t.pubkey.equals(t.witness[1]))
-        throw new TypeError("Pubkey mismatch");
-      const o = C(t.witness[1]);
-      if (i.length > 0 && !i.equals(o))
-        throw new TypeError("Hash mismatch");
+      if (t.m !== void 0 && t.m !== t.signatures.length)
+        throw new TypeError("Signature count mismatch");
     }
   }
   return Object.assign(s, t);
 }
-const dr = E, ge = h.alloc(0);
-function Kt(t) {
-  return !!(h.isBuffer(t) && t.length === 65 && t[0] === 4 && W(t));
-}
-function bt(t, e) {
-  if (!t.address && !t.hash && !t.output && !t.redeem && !t.witness)
+const br = E;
+function De(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({
     network: c.maybe(c.Object),
-    address: c.maybe(c.String),
-    hash: c.maybe(c.BufferN(32)),
-    output: c.maybe(c.BufferN(34)),
-    redeem: c.maybe({
-      input: c.maybe(c.Buffer),
-      network: c.maybe(c.Object),
-      output: c.maybe(c.Buffer),
-      witness: c.maybe(c.arrayOf(c.Buffer))
-    }),
-    input: c.maybe(c.BufferN(0)),
-    witness: c.maybe(c.arrayOf(c.Buffer))
+    output: c.maybe(c.Buffer),
+    pubkey: c.maybe(W),
+    signature: c.maybe(Q),
+    input: c.maybe(c.Buffer)
   }, t);
-  const r = B(() => {
-    const o = I.bech32.decode(t.address), u = o.words.shift(), f = I.bech32.fromWords(o.words);
-    return {
-      version: u,
-      prefix: o.prefix,
-      data: h.from(f)
-    };
-  }), n = B(() => A(t.redeem.input));
-  let s = t.network;
-  s || (s = t.redeem && t.redeem.network || M);
-  const i = {
-    network: s,
-    name: K.P2WSH
+  const r = B(() => A(t.input)), n = t.network || M, s = {
+    name: K.P2PK,
+    network: n,
+    pubkey: void 0
   };
-  if (y(i, "address", () => {
-    if (!i.hash)
-      return;
-    const o = I.bech32.toWords(i.hash);
-    return o.unshift(0), I.bech32.encode(s.bech32, o);
-  }), y(i, "hash", () => {
+  if (y(s, "output", () => {
+    if (t.pubkey)
+      return v([t.pubkey, br.OP_CHECKSIG]);
+  }), y(s, "pubkey", () => {
     if (t.output)
-      return t.output.subarray(2);
-    if (t.address)
-      return r().data;
-    if (i.redeem && i.redeem.output)
-      return D(i.redeem.output);
-  }), y(i, "output", () => {
-    if (i.hash)
-      return v([dr.OP_0, i.hash]);
-  }), y(i, "redeem", () => {
-    if (t.witness)
-      return {
-        output: t.witness[t.witness.length - 1],
-        input: ge,
-        witness: t.witness.slice(0, -1)
-      };
-  }), y(i, "input", () => {
-    if (i.witness)
-      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());
-      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)
-      return [].concat(t.redeem.witness, t.redeem.output);
-  }), y(i, "name", () => {
-    const o = ["p2wsh"];
-    return i.redeem !== void 0 && i.redeem.name !== void 0 && o.push(i.redeem.name), o.join("-");
+      return t.output.subarray(1, -1);
+  }), y(s, "signature", () => {
+    if (t.input)
+      return r()[0];
+  }), y(s, "input", () => {
+    if (t.signature)
+      return v([t.signature]);
+  }), y(s, "witness", () => {
+    if (s.input)
+      return [];
   }), e.validate) {
-    let o = h.from([]);
-    if (t.address) {
-      if (r().prefix !== s.bech32)
-        throw new TypeError("Invalid prefix or Network mismatch");
-      if (r().version !== 0)
-        throw new TypeError("Invalid address version");
-      if (r().data.length !== 32)
-        throw new TypeError("Invalid address data");
-      o = r().data;
-    }
-    if (t.hash) {
-      if (o.length > 0 && !o.equals(t.hash))
-        throw new TypeError("Hash mismatch");
-      o = t.hash;
-    }
     if (t.output) {
-      if (t.output.length !== 34 || t.output[0] !== dr.OP_0 || t.output[1] !== 32)
+      if (t.output[t.output.length - 1] !== br.OP_CHECKSIG)
         throw new TypeError("Output is invalid");
-      const u = t.output.subarray(2);
-      if (o.length > 0 && !o.equals(u))
-        throw new TypeError("Hash mismatch");
-      o = u;
-    }
-    if (t.redeem) {
-      if (t.redeem.network && t.redeem.network !== s)
-        throw new TypeError("Network mismatch");
-      if (t.redeem.input && t.redeem.input.length > 0 && t.redeem.witness && t.redeem.witness.length > 0)
-        throw new TypeError("Ambiguous witness source");
-      if (t.redeem.output) {
-        const u = A(t.redeem.output);
-        if (!u || u.length < 1)
-          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 (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))
-          throw new TypeError("Hash mismatch");
-        o = f;
-      }
-      if (t.redeem.input && !oe(n()))
-        throw new TypeError("Non push-only scriptSig");
-      if (t.witness && t.redeem.witness && !at(t.witness, t.redeem.witness))
-        throw new TypeError("Witness and redeem.witness mismatch");
-      if (t.redeem.input && n().some(Kt) || t.redeem.output && (A(t.redeem.output) || []).some(Kt))
-        throw new TypeError("redeem.input or redeem.output contains uncompressed pubkey");
+      if (!W(s.pubkey))
+        throw new TypeError("Output pubkey is invalid");
+      if (t.pubkey && !t.pubkey.equals(s.pubkey))
+        throw new TypeError("Pubkey mismatch");
     }
-    if (t.witness && t.witness.length > 0) {
-      const u = t.witness[t.witness.length - 1];
-      if (t.redeem && t.redeem.output && !t.redeem.output.equals(u))
-        throw new TypeError("Witness and redeem.output mismatch");
-      if (t.witness.some(Kt) || (A(u) || []).some(Kt))
-        throw new TypeError("Witness contains uncompressed pubkey");
+    if (t.signature && t.input && !t.input.equals(s.input))
+      throw new TypeError("Signature mismatch");
+    if (t.input) {
+      if (r().length !== 1)
+        throw new TypeError("Input is invalid");
+      if (!Q(s.signature))
+        throw new TypeError("Input has invalid signature");
     }
   }
-  return Object.assign(i, t);
+  return Object.assign(s, t);
 }
-const { typeforce: X } = ie;
+const hi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  __proto__: null,
+  LEAF_VERSION_TAPSCRIPT: Ge,
+  MAX_TAPTREE_DEPTH: Tn,
+  get PaymentType() {
+    return K;
+  },
+  findScriptPath: Bt,
+  p2data: ai,
+  p2ms: Vt,
+  p2op: Yr,
+  p2pk: De,
+  p2pkh: yt,
+  p2sh: mt,
+  p2tr: bt,
+  p2wpkh: Lt,
+  p2wsh: Et,
+  prop: y,
+  rootHashFromPath: te,
+  tapleafHash: Z,
+  toHashTree: ee,
+  tweakKey: At,
+  value: B
+}, Symbol.toStringTag, { value: "Module" })), { typeforce: X } = ie;
 function j(t) {
   const e = t.length;
   return kt(e) + e;
 }
-function hi(t) {
+function pi(t) {
   const e = t.length;
   return kt(e) + t.reduce((r, n) => r + j(n), 0);
 }
-const ot = h.allocUnsafe(0), wr = [], ye = h.from("0000000000000000000000000000000000000000000000000000000000000000", "hex"), gr = h.from("0000000000000000000000000000000000000000000000000000000000000001", "hex"), pi = h.from("ffffffffffffffff", "hex"), li = {
+const ot = h.allocUnsafe(0), Er = [], ye = h.from("0000000000000000000000000000000000000000000000000000000000000000", "hex"), Sr = h.from("0000000000000000000000000000000000000000000000000000000000000001", "hex"), li = h.from("ffffffffffffffff", "hex"), di = {
   script: ot,
-  valueBuffer: pi
+  valueBuffer: li
 };
-function di(t) {
+function wi(t) {
   return "value" in t;
 }
 class g {
@@ -2847,7 +3127,7 @@ class g {
     this.version = 1, this.locktime = 0, this.ins = [], this.outs = [];
   }
   static fromBuffer(e, r) {
-    const n = new $s(e), s = new g();
+    const n = new zs(e), s = new g();
     s.version = n.readInt32();
     const i = n.readUInt8(), o = n.readUInt8();
     let u = !1;
@@ -2860,7 +3140,7 @@ class g {
         index: d,
         script: b,
         sequence: w,
-        witness: wr
+        witness: Er
       });
     }
     const a = n.readVarInt();
@@ -2900,7 +3180,7 @@ class g {
       index: r,
       script: s || ot,
       sequence: n,
-      witness: wr
+      witness: Er
     }) - 1;
   }
   addOutput(e, r) {
@@ -2921,7 +3201,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 + hi(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 + pi(s.witness), 0) : 0);
   }
   clone() {
     const e = new g();
@@ -2942,7 +3222,7 @@ class g {
       r,
       n
     ]), e >= this.ins.length)
-      return gr;
+      return Sr;
     const s = A(r);
     if (!s)
       throw new Error("Could not decompile prevOutScript");
@@ -2953,10 +3233,10 @@ class g {
       });
     else if ((n & 31) === g.SIGHASH_SINGLE) {
       if (e >= this.outs.length)
-        return gr;
+        return Sr;
       o.outs.length = e + 1;
       for (let f = 0; f < e; f++)
-        o.outs[f] = li;
+        o.outs[f] = di;
       o.ins.forEach((f, a) => {
         a !== e && (f.sequence = 0);
       });
@@ -2986,7 +3266,7 @@ class g {
     } else {
       if (!this.outs.length)
         throw new Error("Add outputs to the transaction before signing.");
-      const O = this.outs.map((F) => 8 + j(F.script)).reduce((F, Kn) => F + Kn), T = x.withCapacity(O);
+      const O = this.outs.map((F) => 8 + j(F.script)).reduce((F, Gn) => F + Gn), T = x.withCapacity(O);
       this.outs.forEach((F) => {
         T.writeUInt64(F.value), T.writeVarSlice(F.script);
       }), P = D(T.end());
@@ -3032,7 +3312,7 @@ class g {
     return e && this.isCoinbase() ? h.alloc(32, 0) : it(this.__toBuffer(void 0, void 0, e));
   }
   getId() {
-    return Ke(this.getHash(!1)).toString("hex");
+    return We(this.getHash(!1)).toString("hex");
   }
   toBuffer(e, r) {
     return this.__toBuffer(e, r, !0);
@@ -3054,7 +3334,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) => {
-      di(o) ? s.writeUInt64(o.value) : s.writeSlice(o.valueBuffer), s.writeVarSlice(o.script);
+      wi(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;
@@ -3073,259 +3353,6 @@ g.ADVANCED_TRANSACTION_FLAG = 1;
 g.TRUC_VERSION = 3;
 g.TRUC_MAX_VSIZE = 1e4;
 g.TRUC_CHILD_MAX_VSIZE = 1e3;
-const vt = (t) => {
-  const e = t.length === 32 ? t : t.subarray(1, 33);
-  return h.isBuffer(e) ? e : h.from(e);
-};
-function yr(t, e, r) {
-  const n = Hi(e, t, r);
-  try {
-    const i = Pi(e, n).concat(n.script).concat(n.controlBlock);
-    return { finalScriptWitness: xt(i) };
-  } catch (s) {
-    throw new Error(`Can not finalize taproot input #${t}: ${s}`);
-  }
-}
-function Mt(t, e) {
-  const r = e ? h.from([e]) : h.from([]);
-  return h.concat([t, r]);
-}
-function $(t) {
-  return t && !!(t.tapInternalKey || t.tapMerkleRoot || t.tapLeafScript && t.tapLeafScript.length || t.tapBip32Derivation && t.tapBip32Derivation.length || t.witnessUtxo && Pn(t.witnessUtxo.script));
-}
-function me(t, e) {
-  return t && !!(t.tapInternalKey || t.tapTree || t.tapBip32Derivation && t.tapBip32Derivation.length || e);
-}
-function mr(t, e, r) {
-  Ti(t, e, r), Ai(t, e, r);
-}
-function br(t, e, r) {
-  Oi(t, e, r), wi(t, e);
-}
-function wi(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 = gi(r, n);
-    if (s && !s.equals(i))
-      throw new Error("Error adding output. Script or address missmatch.");
-  }
-}
-function gi(t, e) {
-  const r = e && yi(e.leaves), { output: n } = mt({
-    internalPubkey: t,
-    scriptTree: r
-  });
-  if (!n)
-    throw new Error("Failed to generate taproot script pubkey");
-  return n;
-}
-function yi(t = []) {
-  return t.length === 1 && t[0].depth === 0 ? {
-    output: t[0].script,
-    version: t[0].leafVersion
-  } : _i(t);
-}
-function mi(t, e) {
-  return Ei(t).some((n) => Hn(n, bi, e));
-}
-function bi(t) {
-  return {
-    signature: t.subarray(0, 64),
-    hashType: t.subarray(64)[0] || g.SIGHASH_DEFAULT
-  };
-}
-function Ei(t) {
-  const e = [];
-  if (t.tapKeySig && e.push(t.tapKeySig), t.tapScriptSig && e.push(...t.tapScriptSig.map((r) => r.signature)), !e.length) {
-    const r = Si(t.finalScriptWitness);
-    r && e.push(r);
-  }
-  return e;
-}
-function Si(t) {
-  if (!t)
-    return;
-  const e = t.subarray(2);
-  if (e.length === 64 || e.length === 65)
-    return e;
-}
-function _i(t) {
-  let e;
-  for (const r of t)
-    if (e = xe(r, e), !e)
-      throw new Error("No room left to insert tapleaf in tree");
-  return e;
-}
-function xe(t, e, r = 0) {
-  if (r > cn)
-    throw new Error("Max taptree depth exceeded.");
-  if (t.depth === r)
-    return e ? void 0 : {
-      output: t.script,
-      version: t.leafVersion
-    };
-  if (ne(e))
-    return;
-  const n = xe(t, e && e[0], r + 1);
-  if (n)
-    return [n, e && e[1]];
-  const s = xe(t, e && e[1], r + 1);
-  if (s)
-    return [e && e[0], s];
-}
-function Ti(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 Oi(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 Ai(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)
-      throw new Error(`Invalid arguments for Psbt.${r}. Tapleaf not part of taptree.`);
-  } else if (t.tapMerkleRoot && !(e.tapLeafScript || []).every((s) => be(s, t.tapMerkleRoot)))
-    throw new Error(`Invalid arguments for Psbt.${r}. Tapleaf not part of taptree.`);
-}
-function be(t, e) {
-  if (!e)
-    return !0;
-  const r = Z({
-    output: t.script,
-    version: t.leafVersion
-  });
-  return Qt(t.controlBlock, r).equals(e);
-}
-function Pi(t, e) {
-  const r = Z({
-    output: e.script,
-    version: e.leafVersion
-  });
-  return (t.tapScriptSig || []).filter((n) => n.leafHash.equals(r)).map((n) => Ii(e.script, n)).sort((n, s) => s.positionInScript - n.positionInScript).map((n) => n.signature);
-}
-function Ii(t, e) {
-  return Object.assign({
-    positionInScript: In(e.pubkey, t)
-  }, e);
-}
-function Hi(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) => vi(i, n, r));
-  if (!s)
-    throw new Error(`Can not finalize taproot input #${e}. Signature for tapleaf script not found.`);
-  return s;
-}
-function vi(t, e, r) {
-  const n = Z({
-    output: t.script,
-    version: t.leafVersion
-  });
-  return (!r || r.equals(n)) && e.find((i) => i.leafHash.equals(n)) !== void 0;
-}
-function gt(t) {
-  return t && !!(t.redeemScript || t.witnessScript || t.bip32Derivation && t.bip32Derivation.length);
-}
-const Er = E, Sr = 16, _r = 2, Tr = 40;
-function On(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({
-    address: c.maybe(c.String),
-    output: c.maybe(c.Buffer),
-    program: c.maybe(c.Buffer),
-    network: c.maybe(c.Object),
-    deploymentVersion: c.maybe(c.Number),
-    hash160: c.maybe(c.BufferN(20))
-  }, t);
-  const r = () => {
-    if (typeof t.deploymentVersion < "u" && typeof t.hash160 < "u") {
-      if (t.hash160.length !== 20)
-        throw new TypeError("hash160 must be exactly 20 bytes");
-      if (t.deploymentVersion < 0 || t.deploymentVersion > 255)
-        throw new TypeError("deploymentVersion must fit in one byte");
-      return h.concat([h.of(t.deploymentVersion), t.hash160]);
-    }
-  }, n = B(() => Ve(t.address)), s = t.network || M, i = {
-    name: K.P2OP,
-    network: s,
-    deploymentVersion: 0
-  };
-  if (y(i, "program", () => {
-    if (t.program)
-      return t.program;
-    const o = r();
-    if (o)
-      return o;
-    if (t.output) {
-      if (t.output[0] !== Er.OP_16)
-        throw new TypeError("Invalid P2OP script");
-      let u = 1, f;
-      if (t.output[1] < 76)
-        f = t.output[1], u = 2;
-      else if (t.output[1] === 76)
-        f = t.output[2], u = 3;
-      else
-        throw new TypeError("Unsupported push opcode in P2OP script");
-      return t.output.subarray(u, u + f);
-    }
-    if (t.address)
-      return n().data;
-  }), y(i, "deploymentVersion", () => {
-    if (i.program)
-      return i.program[0];
-  }), y(i, "hash160", () => {
-    if (i.program)
-      return i.program.subarray(1);
-  }), y(i, "output", () => {
-    if (i.program)
-      return v([Er.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(Sr), 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 !== Sr)
-        throw new TypeError("Invalid witness version for p2op");
-      if (u.data.length < _r || u.data.length > Tr)
-        throw new TypeError("Invalid witness program length");
-      o = u.data;
-    }
-    if (t.program) {
-      if (o.length && !o.equals(t.program))
-        throw new TypeError("Program mismatch");
-      o = t.program;
-    }
-    if (!o.length && t.deploymentVersion !== void 0 && t.hash160 && (o = r()), t.output) {
-      const u = i.program;
-      if (o.length && !o.equals(u))
-        throw new TypeError("Program mismatch (output vs other source)");
-      o = u;
-    }
-    if (o.length < _r || 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");
-    if (t.hash160 && !t.hash160.equals(o.subarray(1)))
-      throw new TypeError("hash160 mismatch");
-  }
-  return Object.assign(i, t);
-}
 function pt(t) {
   return (e) => {
     try {
@@ -3335,7 +3362,7 @@ function pt(t) {
     }
   };
 }
-const xi = pt(Ft), Ui = pt(De), ki = pt(Et), he = pt(Vt), Or = pt(bt), An = pt(yt), Pn = pt(mt), uo = (t) => t.length === 4 && t[0] === 81 && t[1] === 2 && t[2] === 78 && t[3] === 115;
+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;
 function xt(t) {
   let e = h.allocUnsafe(0);
   function r(o) {
@@ -3351,61 +3378,27 @@ function xt(t) {
   function i(o) {
     n(o.length), o.forEach(s);
   }
-  return i(t), e;
-}
-function Ue(t) {
-  if (t.length === 32)
-    return;
-  if (![33, 65].includes(t.length)) {
-    console.warn(`Unsupported key length=${t.length}. Must be 33 (compressed) or 65 (uncompressed).`);
-    return;
-  }
-  let e;
-  try {
-    e = R.fromHex(t);
-  } catch {
-    throw new Error("Invalid secp256k1 public key bytes. Cannot parse.");
-  }
-  const r = Ar(e.x), n = Ar(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 {
-    hybrid: o,
-    uncompressed: u
-  };
-}
-function Ar(t) {
-  let e = t.toString(16);
-  return e = e.padStart(64, "0"), e.length > 64 && (e = e.slice(-64)), h.from(e, "hex");
-}
-function Dt(t, e) {
-  if (t.equals(e))
-    return !0;
-  if (t.length === 65 && e.length === 65) {
-    const r = h.from(t), n = h.from(e);
-    return (r[0] === 6 || r[0] === 7) && (r[0] = 4), (n[0] === 6 || n[0] === 7) && (n[0] = 4), r.equals(n);
-  }
-  return !1;
+  return i(t), e;
 }
-function In(t, e) {
+function Pn(t, e) {
   const r = A(e);
   if (r === null)
     throw new Error("Unknown script error");
-  const n = C(t), s = vt(t), i = Ue(t), o = i?.hybrid ? C(i.hybrid) : void 0, u = i?.uncompressed ? C(i.uncompressed) : void 0;
+  const n = C(t), s = Ht(t), i = Ie(t), o = i?.hybrid ? C(i.hybrid) : void 0, u = i?.uncompressed ? C(i.uncompressed) : void 0;
   return r.findIndex((f) => {
     if (typeof f == "number")
       return !1;
-    if (Dt(f, t) || Dt(f, s) || f.equals(n) || i && (Dt(f, i.uncompressed) || Dt(f, i.hybrid) || o && f.equals(o) || u && f.equals(u)))
+    if (Gt(f, t) || Gt(f, s) || f.equals(n) || i && (Gt(f, i.uncompressed) || Gt(f, i.hybrid) || o && f.equals(o) || u && f.equals(u)))
       return !0;
   });
 }
 function pe(t, e) {
-  return In(t, e) !== -1;
+  return Pn(t, e) !== -1;
 }
-function Ni(t, e) {
-  return Ci(t).some((n) => Hn(n, dt.decode, e));
+function bi(t, e) {
+  return Ei(t).some((n) => In(n, dt.decode, e));
 }
-function Hn(t, e, r) {
+function In(t, e, r) {
   const { hashType: n } = e(t), s = [];
   switch (n & g.SIGHASH_ANYONECANPAY && s.push("addInput"), n & 31) {
     case g.SIGHASH_ALL:
@@ -3417,175 +3410,183 @@ function Hn(t, e, r) {
   }
   return s.indexOf(r) === -1;
 }
-function Ci(t) {
+function Ei(t) {
   const { partialSig: e } = t;
   let r;
   if (!e || e.length === 0) {
     if (!t.finalScriptSig && !t.finalScriptWitness)
       return [];
-    r = Bi(t);
+    r = Si(t);
   } else
     r = e;
   return r.map((n) => n.signature);
 }
-function Bi(t) {
+function Si(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 }));
 }
-const st = E;
-function Et(t, e) {
-  if (!t.address && !t.hash && !t.output && !t.pubkey && !t.input)
-    throw new TypeError("Not enough data");
-  e = Object.assign({ validate: !0 }, e || {}), c({
-    network: c.maybe(c.Object),
-    address: c.maybe(c.String),
-    hash: c.maybe(c.BufferN(20)),
-    output: c.maybe(c.BufferN(25)),
-    pubkey: c.maybe(W),
-    signature: c.maybe(Q),
-    input: c.maybe(c.Buffer)
-  }, t);
-  const r = B(() => {
-    const o = h.from(Ut.decode(t.address)), u = o.readUInt8(0), f = o.subarray(1);
-    return { version: u, hash: f };
-  }), n = B(() => A(t.input)), s = t.network || M, i = {
-    name: K.P2PKH,
-    network: s,
-    hash: void 0
+function Tr(t, e, r) {
+  const n = Bi(e, t, r);
+  try {
+    const i = Ni(e, n).concat(n.script).concat(n.controlBlock);
+    return { finalScriptWitness: xt(i) };
+  } catch (s) {
+    throw new Error(`Can not finalize taproot input #${t}: ${s}`);
+  }
+}
+function Dt(t, e) {
+  const r = e ? h.from([e]) : h.from([]);
+  return h.concat([t, r]);
+}
+function $(t) {
+  return t && !!(t.tapInternalKey || t.tapMerkleRoot || t.tapLeafScript && t.tapLeafScript.length || t.tapBip32Derivation && t.tapBip32Derivation.length || t.witnessUtxo && An(t.witnessUtxo.script));
+}
+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 Ar(t, e, r) {
+  Ui(t, e, r), _i(t, e);
+}
+function _i(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);
+    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({
+    internalPubkey: t,
+    scriptTree: r
+  });
+  if (!n)
+    throw new Error("Failed to generate taproot script pubkey");
+  return n;
+}
+function Oi(t = []) {
+  return t.length === 1 && t[0].depth === 0 ? {
+    output: t[0].script,
+    version: t[0].leafVersion
+  } : vi(t);
+}
+function Ai(t, e) {
+  return Ii(t).some((n) => In(n, Pi, e));
+}
+function Pi(t) {
+  return {
+    signature: t.subarray(0, 64),
+    hashType: t.subarray(64)[0] || g.SIGHASH_DEFAULT
   };
-  if (y(i, "address", () => {
-    if (!i.hash)
-      return;
-    const o = h.allocUnsafe(21);
-    return o.writeUInt8(s.pubKeyHash, 0), i.hash.copy(o, 1), Ut.encode(o);
-  }), y(i, "hash", () => {
-    if (t.output)
-      return t.output.subarray(3, 23);
-    if (t.address)
-      return r().hash;
-    if (t.pubkey || i.pubkey)
-      return C(t.pubkey || i.pubkey);
-  }), y(i, "output", () => {
-    if (i.hash)
-      return v([
-        st.OP_DUP,
-        st.OP_HASH160,
-        i.hash,
-        st.OP_EQUALVERIFY,
-        st.OP_CHECKSIG
-      ]);
-  }), y(i, "pubkey", () => {
-    if (t.input)
-      return n()[1];
-  }), y(i, "signature", () => {
-    if (t.input)
-      return n()[0];
-  }), y(i, "input", () => {
-    if (!t.pubkey || !t.signature)
-      return;
-    let o = t.pubkey;
-    if (t.useHybrid || t.useUncompressed) {
-      const u = Ue(t.pubkey);
-      u && (t.useUncompressed ? o = u.uncompressed : o = u.hybrid);
-    }
-    return v([t.signature, o]);
-  }), y(i, "witness", () => {
-    if (i.input)
-      return [];
-  }), e.validate) {
-    let o = h.from([]);
-    if (t.address) {
-      if (r().version !== s.pubKeyHash)
-        throw new TypeError("Invalid version or Network mismatch");
-      if (r().hash.length !== 20)
-        throw new TypeError("Invalid address");
-      o = r().hash;
-    }
-    if (t.hash) {
-      if (o.length > 0 && !o.equals(t.hash))
-        throw new TypeError("Hash mismatch");
-      o = t.hash;
-    }
-    if (t.output) {
-      if (t.output.length !== 25 || t.output[0] !== st.OP_DUP || t.output[1] !== st.OP_HASH160 || t.output[2] !== 20 || t.output[23] !== st.OP_EQUALVERIFY || t.output[24] !== st.OP_CHECKSIG)
-        throw new TypeError("Output is invalid");
-      const u = t.output.subarray(3, 23);
-      if (o.length > 0 && !o.equals(u))
-        throw new TypeError("Hash mismatch");
-      o = u;
-    }
-    if (t.pubkey) {
-      const u = C(t.pubkey);
-      let f = o.length > 0 && !o.equals(u);
-      if (f && (t.pubkey.length === 33 && (t.pubkey[0] === 2 || t.pubkey[0] === 3) || t.pubkey.length === 65 && t.pubkey[0] === 4)) {
-        const a = Ue(t.pubkey);
-        if (a) {
-          const p = C(a.uncompressed);
-          if (o.equals(p))
-            f = !1, t.useUncompressed = !0;
-          else {
-            const l = C(a.hybrid);
-            f = !o.equals(l), f || (t.useHybrid = !0);
-          }
-        }
-      }
-      if (f)
-        throw new TypeError("Hash mismatch");
-      o = u;
-    }
-    if (t.input) {
-      const u = n();
-      if (u.length !== 2)
-        throw new TypeError("Input is invalid");
-      if (!Q(u[0]))
-        throw new TypeError("Input has invalid signature");
-      if (!W(u[1]))
-        throw new TypeError("Input has invalid pubkey");
-      if (t.signature && !t.signature.equals(u[0]))
-        throw new TypeError("Signature mismatch");
-      if (t.pubkey && !t.pubkey.equals(u[1]))
-        throw new TypeError("Pubkey mismatch");
-      const f = C(u[1]);
-      if (o.length > 0 && !o.equals(f))
-        throw new TypeError("Hash mismatch (input)");
-    }
+}
+function Ii(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);
+    r && e.push(r);
   }
-  return Object.assign(i, t);
+  return e;
 }
-var K;
-(function(t) {
-  t.P2PK = "p2pk", t.P2PKH = "p2pkh", t.P2SH = "p2sh", t.P2MS = "p2ms", t.P2WPKH = "p2wpkh", t.P2WSH = "p2wsh", t.P2TR = "p2tr", t.P2OP = "p2op", t.Embed = "embed", t.ScriptRedeem = "scriptRedeem";
-})(K || (K = {}));
-const Ri = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
-  __proto__: null,
-  LEAF_VERSION_TAPSCRIPT: Me,
-  MAX_TAPTREE_DEPTH: cn,
-  get PaymentType() {
-    return K;
-  },
-  findScriptPath: Ct,
-  p2data: js,
-  p2ms: Ft,
-  p2op: On,
-  p2pk: De,
-  p2pkh: Et,
-  p2sh: yt,
-  p2tr: mt,
-  p2wpkh: Vt,
-  p2wsh: bt,
-  prop: y,
-  rootHashFromPath: Qt,
-  tapTweakHash: an,
-  tapleafHash: Z,
-  toHashTree: Jt,
-  tweakKey: At,
-  value: B
-}, Symbol.toStringTag, { value: "Module" })), Pr = Se.decode, Fi = {
+function Hi(t) {
+  if (!t)
+    return;
+  const e = t.subarray(2);
+  if (e.length === 64 || e.length === 65)
+    return e;
+}
+function vi(t) {
+  let e;
+  for (const r of t)
+    if (e = Ue(r, e), !e)
+      throw new Error("No room left to insert tapleaf in tree");
+  return e;
+}
+function Ue(t, e, r = 0) {
+  if (r > Tn)
+    throw new Error("Max taptree depth exceeded.");
+  if (t.depth === r)
+    return e ? void 0 : {
+      output: t.script,
+      version: t.leafVersion
+    };
+  if (ne(e))
+    return;
+  const n = Ue(t, e && e[0], r + 1);
+  if (n)
+    return [n, e && e[1]];
+  const s = Ue(t, e && e[1], r + 1);
+  if (s)
+    return [e && e[0], s];
+}
+function xi(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) {
+  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) {
+  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)
+      throw new Error(`Invalid arguments for Psbt.${r}. Tapleaf not part of taptree.`);
+  } else if (t.tapMerkleRoot && !(e.tapLeafScript || []).every((s) => be(s, t.tapMerkleRoot)))
+    throw new Error(`Invalid arguments for Psbt.${r}. Tapleaf not part of taptree.`);
+}
+function be(t, e) {
+  if (!e)
+    return !0;
+  const r = Z({
+    output: t.script,
+    version: t.leafVersion
+  });
+  return te(t.controlBlock, r).equals(e);
+}
+function Ni(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);
+}
+function Ci(t, e) {
+  return Object.assign({
+    positionInScript: Pn(e.pubkey, t)
+  }, e);
+}
+function Bi(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));
+  if (!s)
+    throw new Error(`Can not finalize taproot input #${e}. Signature for tapleaf script not found.`);
+  return s;
+}
+function Ri(t, e, r) {
+  const n = Z({
+    output: t.script,
+    version: t.leafVersion
+  });
+  return (!r || r.equals(n)) && e.find((i) => i.leafHash.equals(n)) !== void 0;
+}
+function gt(t) {
+  return t && !!(t.redeemScript || t.witnessScript || t.bip32Derivation && t.bip32Derivation.length);
+}
+const Pr = Se.decode, Fi = {
   network: M,
   maximumFeeRate: 5e3
 };
 class ke {
-  constructor(e = {}, r = new qe.Psbt(new vn())) {
+  constructor(e = {}, r = new qe.Psbt(new Hn())) {
     this.data = r, this.opts = Object.assign({}, Fi, e), this.__CACHE = {
       __NON_WITNESS_UTXO_TX_CACHE: [],
       __NON_WITNESS_UTXO_BUF_CACHE: [],
@@ -3618,7 +3619,7 @@ class ke {
   }
   get txInputs() {
     return this.__CACHE.__TX.ins.map((e) => ({
-      hash: tr(e.hash),
+      hash: lr(e.hash),
       index: e.index,
       sequence: e.sequence
     }));
@@ -3627,11 +3628,11 @@ class ke {
     return this.__CACHE.__TX.outs.map((e) => {
       let r;
       try {
-        r = Es(e.script, this.opts.network);
+        r = fi(e.script, this.opts.network);
       } catch {
       }
       return {
-        script: tr(e.script),
+        script: lr(e.script),
         value: e.value,
         address: r
       };
@@ -3685,11 +3686,11 @@ 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]");
-    mr(e, e, "addInput"), r && Tt(this.data.inputs, "addInput"), e.witnessScript && re(e.witnessScript);
+    Or(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];
-    kn(n, s);
+    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;
   }
@@ -3701,21 +3702,21 @@ 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 = Ss(i, o);
+      const { address: i } = e, { network: o } = this.opts, u = ci(i, o);
       e = Object.assign({}, e, { script: u });
     }
-    br(e, e, "addOutput");
+    Ar(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;
   }
   extractTransaction(e, r) {
-    if (r && (this.data.inputs = this.data.inputs.filter((i) => !i.partialSig)), !this.data.inputs.every(xn))
+    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)
       return n.__EXTRACTED_TX;
     const s = n.__TX.clone();
-    return Ln(this.data.inputs, s, n, !0, r), s;
+    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);
@@ -3730,14 +3731,14 @@ 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 = yr) {
+  finalizeTaprootInput(e, r, n = Tr) {
     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 = Vn(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 = Gn(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 || to(r.finalScriptWitness)), i = s.type === "raw" ? "" : s.type + "-", o = Wn(s.meaningfulScript);
     return i + o;
   }
   inputHasPubkey(e, r) {
@@ -3887,11 +3888,11 @@ class ke {
     return this.data.updateGlobal(e), this;
   }
   updateInput(e, r) {
-    return r.witnessScript && re(r.witnessScript), mr(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), Or(this.data.inputs[e], r, "updateInput"), this.data.updateInput(e, r), r.nonWitnessUtxo && Ce(this.__CACHE, this.data.inputs[e], e), this;
   }
   updateOutput(e, r) {
     const n = this.data.outputs[e];
-    return br(n, r, "updateOutput"), this.data.updateOutput(e, r), this;
+    return Ar(n, r, "updateOutput"), this.data.updateOutput(e, r), this;
   }
   addUnknownKeyValToGlobal(e) {
     return this.data.addUnknownKeyValToGlobal(e), this;
@@ -3923,11 +3924,11 @@ class ke {
       throw new Error(`Unknown error finalizing input #${e}`);
     return this.data.clearFinalizedInput(e), this;
   }
-  _finalizeTaprootInput(e, r, n, s = yr) {
+  _finalizeTaprootInput(e, r, n, s = Tr) {
     if (!r.witnessUtxo)
       throw new Error(`Cannot finalize input #${e}. Missing witness utxo.`);
     if (r.tapKeySig) {
-      const i = mt({
+      const i = bt({
         output: r.witnessUtxo.script,
         signature: r.tapKeySig
       });
@@ -3953,10 +3954,10 @@ class ke {
     const u = [];
     let f, a, p;
     for (const l of o) {
-      const d = dt.decode(l.signature), { hash: b, script: w } = p !== d.hashType || !f || !a ? Cn(e, Object.assign({}, s, {
+      const d = dt.decode(l.signature), { hash: b, script: w } = p !== d.hashType || !f || !a ? Nn(e, Object.assign({}, s, {
         sighashType: d.hashType
       }), this.__CACHE, !0) : { hash: f, script: a };
-      p = d.hashType, f = b, a = w, Un(l.pubkey, w, "verify"), u.push(r(l.pubkey, b, d.signature));
+      p = d.hashType, f = b, a = w, xn(l.pubkey, w, "verify"), u.push(r(l.pubkey, b, d.signature));
     }
     return u.every((l) => l);
   }
@@ -3966,7 +3967,7 @@ class ke {
       throw new Error("No signatures to validate");
     if (typeof r != "function")
       throw new Error("Need validator function to validate signatures");
-    n = n && vt(n);
+    n = n && Ht(n);
     const u = n ? Ne(e, s, this.data.inputs, n, this.__CACHE) : qi(e, s, this.data.inputs, this.__CACHE);
     if (!u.length)
       throw new Error("No signatures for this pubkey");
@@ -3998,9 +3999,9 @@ class ke {
     return this.data.updateInput(e, { partialSig: f }), this;
   }
   _signTaprootInput(e, r, n, s, i = [g.SIGHASH_DEFAULT]) {
-    const o = h.isBuffer(n.publicKey) ? n.publicKey : h.from(n.publicKey), u = this.checkTaprootHashesForSig(e, r, n, s, i), f = n.signSchnorr.bind(n), a = (d) => h.isBuffer(d) ? d : h.from(d), p = u.filter((d) => !d.leafHash).map((d) => Mt(a(f(d.hash)), r.sighashType))[0], l = u.filter((d) => !!d.leafHash).map((d) => ({
-      pubkey: vt(o),
-      signature: Mt(a(f(d.hash)), r.sighashType),
+    const o = h.isBuffer(n.publicKey) ? n.publicKey : h.from(n.publicKey), u = this.checkTaprootHashesForSig(e, r, n, s, i), f = n.signSchnorr.bind(n), a = (d) => h.isBuffer(d) ? d : h.from(d), p = u.filter((d) => !d.leafHash).map((d) => Dt(a(f(d.hash)), r.sighashType))[0], l = u.filter((d) => !!d.leafHash).map((d) => ({
+      pubkey: Ht(o),
+      signature: Dt(a(f(d.hash)), r.sighashType),
       leafHash: d.leafHash
     }));
     return p && this.data.updateInput(e, { tapKeySig: p }), l.length && this.data.updateInput(e, { tapScriptSig: l }), this;
@@ -4021,7 +4022,7 @@ class ke {
     const o = h.isBuffer(n.publicKey) ? n.publicKey : h.from(n.publicKey), u = this.checkTaprootHashesForSig(e, r, n, s, i), f = n.signSchnorr.bind(n), a = (w) => h.isBuffer(w) ? w : h.from(w), p = [], l = u.filter((w) => !w.leafHash)[0];
     if (l) {
       const w = Promise.resolve(f(l.hash)).then((S) => ({
-        tapKeySig: Mt(a(S), r.sighashType)
+        tapKeySig: Dt(a(S), r.sighashType)
       }));
       p.push(w);
     }
@@ -4031,8 +4032,8 @@ class ke {
         const P = await f(S.hash);
         return { tapScriptSig: [
           {
-            pubkey: vt(o),
-            signature: Mt(a(P), r.sighashType),
+            pubkey: Ht(o),
+            signature: Dt(a(P), r.sighashType),
             leafHash: S.leafHash
           }
         ] };
@@ -4044,8 +4045,8 @@ class ke {
       this.data.updateInput(e, w);
   }
 }
-const Li = (t) => new vn(t);
-class vn {
+const Li = (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", {
       enumerable: !1,
@@ -4061,7 +4062,7 @@ class vn {
   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" ? Ke(h.from(e.hash, "hex")) : e.hash;
+    const r = typeof e.hash == "string" ? We(h.from(e.hash, "hex")) : e.hash;
     this.tx.addInput(r, e.index, e.sequence);
   }
   addOutput(e) {
@@ -4080,7 +4081,7 @@ function Vi(t, e, r) {
     case "witnesspubkeyhash":
       return Ir(1, t.partialSig);
     case "multisig": {
-      const n = Ft({
+      const n = Vt({
         output: e
       });
       return Ir(n.m, t.partialSig, n.pubkeys);
@@ -4106,7 +4107,7 @@ function Ir(t, e, r) {
     throw new Error("Too many signatures");
   return n.length === t;
 }
-function xn(t) {
+function vn(t) {
   return !!t.finalScriptSig || !!t.finalScriptWitness;
 }
 function Hr(t) {
@@ -4129,7 +4130,7 @@ function Wi(t, e, r) {
 }
 function Tt(t, e) {
   t.forEach((r) => {
-    if ($(r) ? mi(r, e) : Ni(r, e))
+    if ($(r) ? Ai(r, e) : bi(r, e))
       throw new Error("Can not modify transaction, signatures exist.");
   });
 }
@@ -4143,7 +4144,7 @@ function Gi(t) {
       throw new Error("Signature sighash does not match input sighash type");
   });
 }
-function Un(t, e, r) {
+function xn(t, e, r) {
   if (!pe(t, e))
     throw new Error(`Can not ${r} for this input with the key ${t.toString("hex")}`);
 }
@@ -4153,16 +4154,16 @@ function Ki(t) {
 }
 function Mi(t, e) {
   t.ins.forEach((r) => {
-    kn(e, r);
+    Un(e, r);
   });
 }
-function kn(t, e) {
-  const r = `${Ke(h.from(e.hash)).toString("hex")}:${e.index}`;
+function Un(t, e) {
+  const r = `${We(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;
 }
-function Nn(t, e) {
+function kn(t, e) {
   return (r, n, s, i) => {
     const o = t({
       redeem: { output: s }
@@ -4171,45 +4172,45 @@ function Nn(t, e) {
       throw new Error(`${e} for ${i} #${r} doesn't match the scriptPubKey in the prevout`);
   };
 }
-const vr = Nn(yt, "Redeem script"), xr = Nn(bt, "Witness script");
+const vr = kn(mt, "Redeem script"), xr = kn(Et, "Witness script");
 function Ur(t, e, r, n, s = !1) {
-  if (!r.every(xn))
+  if (!r.every(vn))
     throw new Error(`PSBT must be finalized to calculate ${e}`);
   if (t === "__FEE_RATE" && n.__FEE_RATE)
     return n.__FEE_RATE;
   if (t === "__FEE" && n.__FEE)
     return n.__FEE;
   let i, o = !0;
-  n.__EXTRACTED_TX ? (i = n.__EXTRACTED_TX, o = !1) : i = n.__TX.clone(), Ln(r, i, n, o, s);
+  n.__EXTRACTED_TX ? (i = n.__EXTRACTED_TX, o = !1) : i = n.__TX.clone(), Fn(r, i, n, o, s);
   const u = t === "__FEE_RATE" ? n.__FEE_RATE : n.__FEE;
   if (u === void 0)
     throw new Error(`Failed to calculate ${e}`);
   return u;
 }
 function Di(t, e, r, n, s, i, o = !0, u) {
-  const f = Gn(r);
+  const f = Wn(r);
   if (!Vi(e, r, f) && o)
     throw new Error(`Can not finalize input #${t}`);
   return $i(r, f, e.partialSig, n, s, i, u);
 }
 function $i(t, e, r, n, s, i, o) {
   let u, f;
-  const a = Xi(t, e, r), p = i ? bt({ redeem: a }) : null, l = s ? yt({ redeem: p || a }) : null;
+  const a = Xi(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) {
-  const i = N.checkForInput(t, e), { hash: o, sighashType: u, script: f } = Cn(e, i, n, !1, s);
-  return Un(r, f, "sign"), {
+  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,
     sighashType: u
   };
 }
-function Cn(t, e, r, n, s) {
+function Nn(t, e, r, n, s) {
   const i = r.__TX, o = e.sighashType || g.SIGHASH_ALL;
-  Rn(o, s);
+  Bn(o, s);
   let u, f;
   if (e.nonWitnessUtxo) {
     const l = le(r, e, t), d = i.ins[t].hash, b = l.getHash();
@@ -4225,7 +4226,7 @@ function Cn(t, e, r, n, s) {
   if (["p2sh-p2wsh", "p2wsh"].indexOf(p) >= 0)
     u = i.hashForWitnessV0(t, a, f.value, o);
   else if (he(a)) {
-    const l = Et({
+    const l = yt({
       hash: a.subarray(2)
     }).output;
     u = i.hashForWitnessV0(t, l, f.value, o);
@@ -4246,7 +4247,7 @@ PROCEED WITH CAUTION!
 function qi(t, e, r, n) {
   const s = [];
   if (e.tapInternalKey) {
-    const o = Bn(t, e, n);
+    const o = Cn(t, e, n);
     o && s.push(o);
   }
   if (e.tapScriptSig) {
@@ -4255,20 +4256,20 @@ function qi(t, e, r, n) {
   }
   return s.map((o) => Ne(t, e, r, o, n)).flat();
 }
-function Bn(t, e, r) {
+function Cn(t, e, r) {
   const { script: n } = $e(t, e, r);
-  return Pn(n) ? h.from(n.subarray(2, 34)) : null;
+  return An(n) ? h.from(n.subarray(2, 34)) : null;
 }
 function Nr(t) {
   return t.length === 64 ? t : h.from(t.subarray(0, 64));
 }
 function Ne(t, e, r, n, s, i, o) {
   const u = s.__TX, f = e.sighashType || g.SIGHASH_DEFAULT;
-  Rn(f, o);
+  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 = [];
   if (e.tapInternalKey && !i) {
-    const w = Bn(t, e, s) || h.from([]);
-    if (vt(n).equals(w)) {
+    const w = Cn(t, e, s) || h.from([]);
+    if (Ht(n).equals(w)) {
       const S = u.hashForWitnessV1(t, p, l, f);
       d.push({ pubkey: n, hash: S });
     }
@@ -4289,7 +4290,7 @@ function Ne(t, e, r, n, s, i, o) {
   });
   return d.concat(b);
 }
-function Rn(t, e) {
+function Bn(t, e) {
   if (e && e.indexOf(t) < 0) {
     const r = Yi(t);
     throw new Error(`Sighash type is not allowed. Retry the sign method passing the sighashTypes array of whitelisted types. Sighash type: ${r}`);
@@ -4300,7 +4301,7 @@ function Xi(t, e, r) {
   switch (e) {
     case "multisig": {
       const s = zi(t, r);
-      n = Ft({
+      n = Vt({
         output: t,
         signatures: s
       });
@@ -4313,14 +4314,14 @@ function Xi(t, e, r) {
       });
       break;
     case "pubkeyhash":
-      n = Et({
+      n = yt({
         output: t,
         pubkey: r[0].pubkey,
         signature: r[0].signature
       });
       break;
     case "witnesspubkeyhash":
-      n = Vt({
+      n = Lt({
         output: t,
         pubkey: r[0].pubkey,
         signature: r[0].signature
@@ -4351,7 +4352,7 @@ function ji(t, e, r) {
       const i = s.script;
       if (!i)
         throw new TypeError("Invalid script for segwit address");
-      s.isSegwit = ws(i);
+      s.isSegwit = ni(i);
     } catch {
     }
   return s;
@@ -4374,9 +4375,9 @@ function Cr(t, e, r) {
   });
 }
 function zi(t, e) {
-  return Ft({ output: t }).pubkeys.map((n) => (e.filter((s) => s.pubkey.equals(n))[0] || {}).signature).filter((n) => !!n);
+  return Vt({ output: t }).pubkeys.map((n) => (e.filter((s) => s.pubkey.equals(n))[0] || {}).signature).filter((n) => !!n);
 }
-function Fn(t) {
+function Rn(t) {
   let e = 0;
   function r(o) {
     return e += o, t.subarray(e - o, e);
@@ -4430,10 +4431,10 @@ function Ce(t, e, r) {
     }
   });
 }
-function Ln(t, e, r, n, s) {
+function Fn(t, e, r, n, s) {
   let i = 0;
   t.forEach((a, p) => {
-    if (n && a.finalScriptSig && (e.ins[p].script = a.finalScriptSig), n && a.finalScriptWitness && (e.ins[p].witness = Fn(a.finalScriptWitness)), a.witnessUtxo)
+    if (n && a.finalScriptSig && (e.ins[p].script = a.finalScriptSig), n && a.finalScriptWitness && (e.ins[p].witness = Rn(a.finalScriptWitness)), a.witnessUtxo)
       i += a.witnessUtxo.value;
     else if (a.nonWitnessUtxo) {
       const l = le(r, a, p), d = e.ins[p].index, b = l.outs[d];
@@ -4450,7 +4451,7 @@ function le(t, e, r) {
   const n = t.__NON_WITNESS_UTXO_TX_CACHE;
   return n[r] || Ce(t, e, r), n[r];
 }
-function Vn(t, e, r) {
+function Ln(t, e, r) {
   const { script: n } = $e(t, e, r);
   return n;
 }
@@ -4467,7 +4468,7 @@ function $e(t, e, r) {
     throw new Error("Can't find pubkey in input without Utxo data");
 }
 function Zi(t, e, r, n) {
-  const s = Vn(r, e, n), { meaningfulScript: i } = de(s, r, "input", e.redeemScript, e.witnessScript);
+  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) {
@@ -4481,14 +4482,14 @@ function Ji(t) {
   if (!e)
     return;
   const r = e[e.length - 1];
-  if (!(!h.isBuffer(r) || Wn(r) || ro(r) || !A(r)))
+  if (!(!h.isBuffer(r) || Vn(r) || ro(r) || !A(r)))
     return r;
 }
 function to(t) {
   if (!t)
     return;
-  const e = Fn(t), r = e[e.length - 1];
-  if (!(Wn(r) || !A(r)))
+  const e = Rn(t), r = e[e.length - 1];
+  if (!(Vn(r) || !A(r)))
     return r;
 }
 function eo(t) {
@@ -4498,14 +4499,14 @@ function eo(t) {
   }
   return h.from(t);
 }
-function Wn(t) {
+function Vn(t) {
   return t.length === 33 && zr(t);
 }
 function ro(t) {
   return Q(t);
 }
 function de(t, e, r, n, s) {
-  const i = An(t), o = i && n && Or(n), u = Or(t);
+  const i = On(t), o = i && n && _r(n), u = _r(t);
   if (i && n === void 0)
     throw new Error("scriptPubkey is P2SH but redeemScript missing");
   if ((u || o) && s === void 0)
@@ -4517,61 +4518,61 @@ function de(t, e, r, n, s) {
   };
 }
 function re(t) {
-  if (he(t) || An(t))
+  if (he(t) || On(t))
     throw new Error("P2WPKH or P2SH can not be contained within P2WSH");
 }
-function Gn(t) {
-  return he(t) ? "witnesspubkeyhash" : ki(t) ? "pubkeyhash" : xi(t) ? "multisig" : Ui(t) ? "pubkey" : "nonstandard";
+function Wn(t) {
+  return he(t) ? "witnesspubkeyhash" : mi(t) ? "pubkeyhash" : gi(t) ? "multisig" : yi(t) ? "pubkey" : "nonstandard";
 }
 function Ot(t) {
   return [...Array(t).keys()];
 }
 const fo = {
-  payments: Ri,
-  script: ps,
-  crypto: Ws
+  payments: hi,
+  script: hs,
+  crypto: xs
 };
 export {
   so as A,
-  Pn as B,
-  In as C,
+  An as B,
+  Pn as C,
   Di as D,
-  ki as E,
+  mi as E,
   he as F,
-  ws as G,
-  Or as H,
-  An as I,
+  ni as G,
+  _r as H,
+  On as I,
   uo as J,
-  Ui as K,
-  xi as L,
+  yi as K,
+  gi as L,
   ke as M,
-  Ls as N,
+  Hs as N,
   K as P,
   g as T,
-  bt as a,
+  Et as a,
   M as b,
-  Vt as c,
-  mt as d,
+  Lt as c,
+  bt as d,
   fo as e,
   v as f,
-  Es as g,
-  Ss as h,
+  fi as g,
+  ci as h,
   oo as i,
-  yt as j,
-  Et as k,
+  mt as j,
+  yt as k,
   De as l,
   A as m,
-  Ve as n,
+  Be as n,
   E as o,
-  Ft as p,
-  ms as q,
-  hs as r,
-  Ue as s,
-  vt as t,
+  Vt as p,
+  oi as q,
+  as as r,
+  Ie as s,
+  Ht as t,
   it as u,
   C as v,
-  Fs as w,
-  an as x,
+  Is as w,
+  Zs as x,
   D as y,
   io as z
 };