@btc-vision/bitcoin 6.5.1 → 6.5.3

package/browser/chunks/{payments-BE4vwHhV.js → payments-CgasufRS.js}

@@ -1,116 +1,115 @@
-import { t as C, f as g, B as c, h as E, b as M } from "./crypto-C6FlKKmp.js";
-import { g as ne, b as P, i as x, d as b, f as se, a as G } from "./psbt-Dlosf9CT.js";
-import { b as me, g as ce, h as ae, t, s as N, j as T, i as we, T as W } from "./utils-BKmkTzNZ.js";
-import { d as a, o as v, c as l, i as S, e as ie, f as ue, g as le } from "./script-COWGdiOo.js";
-const F = 192, ye = 128, be = (e) => "left" in e && "right" in e;
-function K(e, o) {
+import { t as F, e as g, B as m, h as E, a as G } from "./crypto-0PweVewC.js";
+import { g as K, b as P, i as x, d as b, f as se, a as X } from "./psbt-BIwOrKer.js";
+import { b as ae, g as me, h as we, t as r, s as N, j as T, i as ce, T as W } from "./utils-CO5kmxe9.js";
+import { d as w, o as v, c as y, i as S, e as ue, f as ie, g as ye } from "./script-CROJPzz_.js";
+const M = 192, le = 128, be = (e) => "left" in e && "right" in e;
+function L(e, o) {
   if (e.length < 33)
     throw new TypeError(
       `The control-block length is too small. Got ${e.length}, expected min 33.`
     );
   const p = (e.length - 33) / 32;
-  let u = o;
+  let i = o;
   for (let s = 0; s < p; s++) {
-    const i = e.slice(33 + 32 * s, 65 + 32 * s);
-    u.compare(i) < 0 ? u = L(u, i) : u = L(i, u);
+    const u = e.subarray(33 + 32 * s, 65 + 32 * s);
+    i.compare(u) < 0 ? i = C(i, u) : i = C(u, i);
   }
-  return u;
+  return i;
 }
 function A(e) {
-  if (me(e)) return { hash: H(e) };
+  if (ae(e)) return { hash: H(e) };
   const o = [A(e[0]), A(e[1])];
-  o.sort((s, i) => s.hash.compare(i.hash));
-  const [p, u] = o;
+  o.sort((s, u) => s.hash.compare(u.hash));
+  const [p, i] = o;
   return {
-    hash: L(p.hash, u.hash),
+    hash: C(p.hash, i.hash),
     left: p,
-    right: u
+    right: i
   };
 }
 function q(e, o) {
   if (be(e)) {
     const p = q(e.left, o);
     if (p !== void 0) return [...p, e.right.hash];
-    const u = q(e.right, o);
-    if (u !== void 0) return [...u, e.left.hash];
+    const i = q(e.right, o);
+    if (i !== void 0) return [...i, e.left.hash];
   } else if (e.hash.equals(o))
     return [];
 }
 function H(e) {
-  const o = e.version || F;
-  return C(
+  const o = e.version || M;
+  return F(
     "TapLeaf",
     g.concat([g.from([o]), ge(e.output)])
   );
 }
 function oe(e, o) {
-  return C("TapTweak", g.concat(o ? [e, o] : [e]));
+  return F("TapTweak", g.concat(o ? [e, o] : [e]));
 }
 function j(e, o) {
   if (!g.isBuffer(e) || e.length !== 32 || o && o.length !== 32) return null;
-  const p = oe(e, o), u = ne().xOnlyPointAddTweak(e, p);
-  return !u || u.xOnlyPubkey === null ? null : {
-    parity: u.parity,
-    x: g.from(u.xOnlyPubkey)
+  const p = oe(e, o), i = K().xOnlyPointAddTweak(e, p);
+  return !i || i.xOnlyPubkey === null ? null : {
+    parity: i.parity,
+    x: g.from(i.xOnlyPubkey)
   };
 }
-function L(e, o) {
-  return C("TapBranch", g.concat([e, o]));
+function C(e, o) {
+  return F("TapBranch", g.concat([e, o]));
 }
 function ge(e) {
-  const o = ce(e.length), p = g.allocUnsafe(o);
-  return ae(e.length, p), g.concat([p, e]);
+  const o = me(e.length), p = g.allocUnsafe(o);
+  return we(e.length, p), g.concat([p, e]);
 }
 function h(e, o, p) {
   Object.defineProperty(e, o, {
     configurable: !0,
     enumerable: !0,
     get() {
-      const u = p.call(this);
-      return this[o] = u, u;
+      const i = p.call(this);
+      return this[o] = i, i;
     },
-    set(u) {
+    set(i) {
       Object.defineProperty(this, o, {
         configurable: !0,
         enumerable: !0,
-        value: u,
+        value: i,
         writable: !0
       });
     }
   });
 }
-function y(e) {
+function l(e) {
   let o;
   return () => (o !== void 0 || (o = e()), o);
 }
 const D = v;
 function ke(e, o) {
   if (!e.data && !e.output) throw new TypeError("Not enough data");
-  o = Object.assign({ validate: !0 }, o || {}), t(
+  o = Object.assign({ validate: !0 }, o || {}), r(
     {
-      network: t.maybe(t.Object),
-      output: t.maybe(t.Buffer),
-      data: t.maybe(t.arrayOf(t.Buffer))
+      network: r.maybe(r.Object),
+      output: r.maybe(r.Buffer),
+      data: r.maybe(r.arrayOf(r.Buffer))
     },
     e
   );
-  const p = e.network || P, u = { name: k.Embed, network: p, data: [] };
-  if (h(u, "output", () => {
+  const p = e.network || P, i = { name: k.Embed, network: p, data: [] };
+  if (h(i, "output", () => {
     if (e.data)
-      return l([D.OP_RETURN].concat(e.data));
-  }), h(u, "data", () => {
+      return y([D.OP_RETURN].concat(e.data));
+  }), h(i, "data", () => {
     if (!e.output) return;
-    const s = a(e.output);
+    const s = w(e.output);
     if (s != null)
       return s.slice(1);
   }), o.validate && e.output) {
-    const s = a(e.output);
+    const s = w(e.output);
     if (s[0] !== D.OP_RETURN) throw new TypeError("Output is invalid");
-    if (!s.slice(1).every(t.Buffer)) throw new TypeError("Output is invalid");
-    if (e.data && !N(e.data, u.data))
-      throw new TypeError("Data mismatch");
+    if (!s.slice(1).every(r.Buffer)) throw new TypeError("Output is invalid");
+    if (e.data && !N(e.data, i.data)) throw new TypeError("Data mismatch");
   }
-  return Object.assign(u, e);
+  return Object.assign(i, e);
 }
 const I = v, V = I.OP_RESERVED;
 function Ee(e, o) {
@@ -120,15 +119,15 @@ function Ee(e, o) {
   function p(f) {
     return S(f) || (o.allowIncomplete && f === I.OP_0) !== void 0;
   }
-  t(
+  r(
     {
-      network: t.maybe(t.Object),
-      m: t.maybe(t.Number),
-      n: t.maybe(t.Number),
-      output: t.maybe(t.Buffer),
-      pubkeys: t.maybe(t.arrayOf(T)),
-      signatures: t.maybe(t.arrayOf(p)),
-      input: t.maybe(t.Buffer)
+      network: r.maybe(r.Object),
+      m: r.maybe(r.Number),
+      n: r.maybe(r.Number),
+      output: r.maybe(r.Buffer),
+      pubkeys: r.maybe(r.arrayOf(T)),
+      signatures: r.maybe(r.arrayOf(p)),
+      input: r.maybe(r.Buffer)
     },
     e
   );
@@ -136,13 +135,13 @@ function Ee(e, o) {
     network: e.network || P,
     name: k.P2MS
   };
-  let i = [], n = !1;
-  function r(f) {
-    n || (n = !0, i = a(f), s.m = i[0] - V, s.n = i[i.length - 2] - V, s.pubkeys = i.slice(1, -2));
+  let u = [], n = !1;
+  function t(f) {
+    n || (n = !0, u = w(f), s.m = u[0] - V, s.n = u[u.length - 2] - V, s.pubkeys = u.slice(1, -2));
   }
   if (h(s, "output", () => {
     if (e.m && s.n && e.pubkeys)
-      return l(
+      return y(
         [].concat(
           V + e.m,
           e.pubkeys,
@@ -152,21 +151,21 @@ function Ee(e, o) {
       );
   }), h(s, "m", () => {
     if (s.output)
-      return r(s.output), s.m;
+      return t(s.output), s.m;
   }), h(s, "n", () => {
     if (s.pubkeys)
       return s.pubkeys.length;
   }), h(s, "pubkeys", () => {
     if (e.output)
-      return r(e.output), s.pubkeys;
+      return t(e.output), s.pubkeys;
   }), h(s, "signatures", () => {
     if (!e.input) return;
-    const f = a(e.input);
+    const f = w(e.input);
     if (f != null)
       return f.slice(1);
   }), h(s, "input", () => {
     if (e.signatures)
-      return l([I.OP_0].concat(e.signatures));
+      return y([I.OP_0].concat(e.signatures));
   }), h(s, "witness", () => {
     if (s.input)
       return [];
@@ -175,11 +174,11 @@ function Ee(e, o) {
       return `p2ms(${s.m} of ${s.n})`;
   }), o.validate) {
     if (e.output) {
-      if (r(e.output), !t.Number(i[0])) throw new TypeError("Output is invalid");
-      if (!t.Number(i[i.length - 2])) throw new TypeError("Output is invalid");
-      if (i[i.length - 1] !== I.OP_CHECKMULTISIG)
+      if (t(e.output), !r.Number(u[0])) throw new TypeError("Output is invalid");
+      if (!r.Number(u[u.length - 2])) throw new TypeError("Output is invalid");
+      if (u[u.length - 1] !== I.OP_CHECKMULTISIG)
         throw new TypeError("Output is invalid");
-      if (s.m <= 0 || s.n > 16 || s.m > s.n || s.n !== i.length - 3)
+      if (s.m <= 0 || s.n > 16 || s.m > s.n || s.n !== u.length - 3)
         throw new TypeError("Output is invalid");
       if (!s.pubkeys.every((f) => T(f))) throw new TypeError("Output is invalid");
       if (e.m !== void 0 && e.m !== s.m) throw new TypeError("m mismatch");
@@ -208,43 +207,43 @@ function Ee(e, o) {
   }
   return Object.assign(s, e);
 }
-const X = v;
+const Q = v;
 function Te(e, o) {
   if (!e.input && !e.output && !e.pubkey && !e.input && !e.signature)
     throw new TypeError("Not enough data");
-  o = Object.assign({ validate: !0 }, o || {}), t(
+  o = Object.assign({ validate: !0 }, o || {}), r(
     {
-      network: t.maybe(t.Object),
-      output: t.maybe(t.Buffer),
-      pubkey: t.maybe(T),
-      signature: t.maybe(S),
-      input: t.maybe(t.Buffer)
+      network: r.maybe(r.Object),
+      output: r.maybe(r.Buffer),
+      pubkey: r.maybe(T),
+      signature: r.maybe(S),
+      input: r.maybe(r.Buffer)
     },
     e
   );
-  const p = y(() => a(e.input)), u = e.network || P, s = {
+  const p = l(() => w(e.input)), i = e.network || P, s = {
     name: k.P2PK,
-    network: u,
+    network: i,
     pubkey: void 0
   };
   if (h(s, "output", () => {
     if (e.pubkey)
-      return l([e.pubkey, X.OP_CHECKSIG]);
+      return y([e.pubkey, Q.OP_CHECKSIG]);
   }), h(s, "pubkey", () => {
     if (e.output)
-      return e.output.slice(1, -1);
+      return e.output.subarray(1, -1);
   }), h(s, "signature", () => {
     if (e.input)
       return p()[0];
   }), h(s, "input", () => {
     if (e.signature)
-      return l([e.signature]);
+      return y([e.signature]);
   }), h(s, "witness", () => {
     if (s.input)
       return [];
   }), o.validate) {
     if (e.output) {
-      if (e.output[e.output.length - 1] !== X.OP_CHECKSIG)
+      if (e.output[e.output.length - 1] !== Q.OP_CHECKSIG)
         throw new TypeError("Output is invalid");
       if (!T(s.pubkey)) throw new TypeError("Output pubkey is invalid");
       if (e.pubkey && !e.pubkey.equals(s.pubkey)) throw new TypeError("Pubkey mismatch");
@@ -263,114 +262,114 @@ const B = v;
 function Pe(e, o) {
   if (!e.address && !e.hash && !e.output && !e.redeem && !e.input)
     throw new TypeError("Not enough data");
-  o = Object.assign({ validate: !0 }, o || {}), t(
+  o = Object.assign({ validate: !0 }, o || {}), r(
     {
-      network: t.maybe(t.Object),
-      address: t.maybe(t.String),
-      hash: t.maybe(t.BufferN(20)),
-      output: t.maybe(t.BufferN(23)),
-      redeem: t.maybe({
-        network: t.maybe(t.Object),
-        output: t.maybe(t.Buffer),
-        input: t.maybe(t.Buffer),
-        witness: t.maybe(t.arrayOf(t.Buffer))
+      network: r.maybe(r.Object),
+      address: r.maybe(r.String),
+      hash: r.maybe(r.BufferN(20)),
+      output: r.maybe(r.BufferN(23)),
+      redeem: r.maybe({
+        network: r.maybe(r.Object),
+        output: r.maybe(r.Buffer),
+        input: r.maybe(r.Buffer),
+        witness: r.maybe(r.arrayOf(r.Buffer))
       }),
-      input: t.maybe(t.Buffer),
-      witness: t.maybe(t.arrayOf(t.Buffer))
+      input: r.maybe(r.Buffer),
+      witness: r.maybe(r.arrayOf(r.Buffer))
     },
     e
   );
   let p = e.network;
   p || (p = e.redeem && e.redeem.network || P);
-  const u = {
+  const i = {
     network: p,
     name: k.P2SH
-  }, s = y(() => {
-    const r = c.from(x.decode(e.address)), f = r.readUInt8(0), d = r.slice(1);
+  }, s = l(() => {
+    const t = m.from(x.decode(e.address)), f = t.readUInt8(0), d = t.subarray(1);
     return { version: f, hash: d };
-  }), i = y(() => a(e.input)), n = y(() => {
-    const r = i(), f = r[r.length - 1];
+  }), u = l(() => w(e.input)), n = l(() => {
+    const t = u(), f = t[t.length - 1];
     return {
       network: p,
-      output: f === B.OP_FALSE ? c.from([]) : f,
-      input: l(r.slice(0, -1)),
+      output: f === B.OP_FALSE ? m.from([]) : f,
+      input: y(t.slice(0, -1)),
       witness: e.witness || []
     };
   });
-  if (h(u, "address", () => {
-    if (!u.hash) return;
-    const r = c.allocUnsafe(21);
-    return r.writeUInt8(u.network.scriptHash, 0), u.hash.copy(r, 1), x.encode(r);
-  }), h(u, "hash", () => {
-    if (e.output) return e.output.slice(2, 22);
+  if (h(i, "address", () => {
+    if (!i.hash) return;
+    const t = m.allocUnsafe(21);
+    return t.writeUInt8(i.network.scriptHash, 0), i.hash.copy(t, 1), x.encode(t);
+  }), h(i, "hash", () => {
+    if (e.output) return e.output.subarray(2, 22);
     if (e.address) return s().hash;
-    if (u.redeem && u.redeem.output) return E(u.redeem.output);
-  }), h(u, "output", () => {
-    if (u.hash)
-      return l([B.OP_HASH160, u.hash, B.OP_EQUAL]);
-  }), h(u, "redeem", () => {
+    if (i.redeem && i.redeem.output) return E(i.redeem.output);
+  }), h(i, "output", () => {
+    if (i.hash)
+      return y([B.OP_HASH160, i.hash, B.OP_EQUAL]);
+  }), h(i, "redeem", () => {
     if (e.input)
       return n();
-  }), h(u, "input", () => {
+  }), h(i, "input", () => {
     if (!(!e.redeem || !e.redeem.input || !e.redeem.output))
-      return l(
-        [].concat(a(e.redeem.input), e.redeem.output)
+      return y(
+        [].concat(w(e.redeem.input), e.redeem.output)
       );
-  }), h(u, "witness", () => {
-    if (u.redeem && u.redeem.witness) return u.redeem.witness;
-    if (u.input) return [];
-  }), h(u, "name", () => {
-    const r = ["p2sh"];
-    return u.redeem !== void 0 && u.redeem.name !== void 0 && r.push(u.redeem.name), r.join("-");
+  }), h(i, "witness", () => {
+    if (i.redeem && i.redeem.witness) return i.redeem.witness;
+    if (i.input) return [];
+  }), h(i, "name", () => {
+    const t = ["p2sh"];
+    return i.redeem !== void 0 && i.redeem.name !== void 0 && t.push(i.redeem.name), t.join("-");
   }), o.validate) {
-    let r = c.from([]);
+    let t = m.from([]);
     if (e.address) {
       if (s().version !== p.scriptHash)
         throw new TypeError("Invalid version or Network mismatch");
       if (s().hash.length !== 20) throw new TypeError("Invalid address");
-      r = s().hash;
+      t = s().hash;
     }
     if (e.hash) {
-      if (r.length > 0 && !r.equals(e.hash)) throw new TypeError("Hash mismatch");
-      r = e.hash;
+      if (t.length > 0 && !t.equals(e.hash)) throw new TypeError("Hash mismatch");
+      t = e.hash;
     }
     if (e.output) {
       if (e.output.length !== 23 || e.output[0] !== B.OP_HASH160 || e.output[1] !== 20 || e.output[22] !== B.OP_EQUAL)
         throw new TypeError("Output is invalid");
-      const d = e.output.slice(2, 22);
-      if (r.length > 0 && !r.equals(d)) throw new TypeError("Hash mismatch");
-      r = d;
+      const d = e.output.subarray(2, 22);
+      if (t.length > 0 && !t.equals(d)) throw new TypeError("Hash mismatch");
+      t = d;
     }
     const f = (d) => {
       if (d.output) {
-        const m = a(d.output);
-        if (!m || m.length < 1)
+        const a = w(d.output);
+        if (!a || a.length < 1)
           throw new TypeError("Redeem.output too short");
         if (d.output.byteLength > 520)
           throw new TypeError("Redeem.output unspendable if larger than 520 bytes");
-        if (ie(m) > 201)
+        if (ue(a) > 201)
           throw new TypeError(
             "Redeem.output unspendable with more than 201 non-push ops"
           );
-        const w = E(d.output);
-        if (r.length > 0 && !r.equals(w)) throw new TypeError("Hash mismatch");
-        r = w;
+        const c = E(d.output);
+        if (t.length > 0 && !t.equals(c)) throw new TypeError("Hash mismatch");
+        t = c;
       }
       if (d.input) {
-        const m = d.input.length > 0, w = d.witness && d.witness.length > 0;
-        if (!m && !w) throw new TypeError("Empty input");
-        if (m && w) throw new TypeError("Input and witness provided");
-        if (m) {
-          const _ = a(d.input);
-          if (!ue(_))
+        const a = d.input.length > 0, c = d.witness && d.witness.length > 0;
+        if (!a && !c) throw new TypeError("Empty input");
+        if (a && c) throw new TypeError("Input and witness provided");
+        if (a) {
+          const _ = w(d.input);
+          if (!ie(_))
             throw new TypeError("Non push-only scriptSig");
         }
       }
     };
     if (e.input) {
-      const d = i();
+      const d = u();
       if (!d || d.length < 1) throw new TypeError("Input too short");
-      if (!c.isBuffer(n().output)) throw new TypeError("Input is invalid");
+      if (!m.isBuffer(n().output)) throw new TypeError("Input is invalid");
       f(n());
     }
     if (e.redeem) {
@@ -388,154 +387,156 @@ function Pe(e, o) {
     if (e.witness && e.redeem && e.redeem.witness && !N(e.redeem.witness, e.witness))
       throw new TypeError("Witness and redeem.witness mismatch");
   }
-  return Object.assign(u, e);
+  return Object.assign(i, e);
 }
-const Q = v, Y = 1, ve = 80;
+const Y = v, z = 1, ve = 80;
 function Oe(e, o) {
   if (!e.address && !e.output && !e.pubkey && !e.internalPubkey && !(e.witness && e.witness.length > 1))
     throw new TypeError("Not enough data");
-  o = Object.assign({ validate: !0 }, o || {}), t(
+  o = Object.assign({ validate: !0 }, o || {}), r(
     {
-      address: t.maybe(t.String),
-      input: t.maybe(t.BufferN(0)),
-      network: t.maybe(t.Object),
-      output: t.maybe(t.BufferN(34)),
-      internalPubkey: t.maybe(t.BufferN(32)),
-      hash: t.maybe(t.BufferN(32)),
+      address: r.maybe(r.String),
+      input: r.maybe(r.BufferN(0)),
+      network: r.maybe(r.Object),
+      output: r.maybe(r.BufferN(34)),
+      internalPubkey: r.maybe(r.BufferN(32)),
+      hash: r.maybe(r.BufferN(32)),
       // merkle root hash, the tweak
-      pubkey: t.maybe(t.BufferN(32)),
+      pubkey: r.maybe(r.BufferN(32)),
       // tweaked with `hash` from `internalPubkey`
-      signature: t.maybe(t.anyOf(t.BufferN(64), t.BufferN(65))),
-      witness: t.maybe(t.arrayOf(t.Buffer)),
-      scriptTree: t.maybe(we),
-      redeem: t.maybe({
-        output: t.maybe(t.Buffer),
+      signature: r.maybe(r.anyOf(r.BufferN(64), r.BufferN(65))),
+      witness: r.maybe(r.arrayOf(r.Buffer)),
+      scriptTree: r.maybe(ce),
+      redeem: r.maybe({
+        output: r.maybe(r.Buffer),
         // tapleaf script
-        redeemVersion: t.maybe(t.Number),
+        redeemVersion: r.maybe(r.Number),
         // tapleaf version
-        witness: t.maybe(t.arrayOf(t.Buffer))
+        witness: r.maybe(r.arrayOf(r.Buffer))
       }),
-      redeemVersion: t.maybe(t.Number)
+      redeemVersion: r.maybe(r.Number)
     },
     e
   );
-  const p = y(() => se(e.address)), u = y(() => {
+  const p = l(() => se(e.address)), i = l(() => {
     if (!(!e.witness || !e.witness.length))
       return e.witness.length >= 2 && e.witness[e.witness.length - 1][0] === ve ? e.witness.slice(0, -1) : e.witness.slice();
-  }), s = y(() => {
+  }), s = l(() => {
     if (e.scriptTree) return A(e.scriptTree);
     if (e.hash) return { hash: e.hash };
-  }), i = e.network || P, n = {
+  }), u = e.network || P, n = {
     name: k.P2TR,
-    network: i
+    network: u
   };
   if (h(n, "address", () => {
     if (!n.pubkey) return;
-    const r = b.bech32m.toWords(n.pubkey);
-    return r.unshift(Y), b.bech32m.encode(i.bech32, r);
+    const t = b.bech32m.toWords(n.pubkey);
+    return t.unshift(z), b.bech32m.encode(u.bech32, t);
   }), h(n, "hash", () => {
-    const r = s();
-    if (r) return r.hash;
-    const f = u();
+    const t = s();
+    if (t) return t.hash;
+    const f = i();
     if (f && f.length > 1) {
-      const d = f[f.length - 1], m = d[0] & W, w = f[f.length - 2], _ = H({
-        output: w,
-        version: m
+      const d = f[f.length - 1], a = d[0] & W, c = f[f.length - 2], _ = H({
+        output: c,
+        version: a
       });
-      return K(d, _);
+      return L(d, _);
     }
   }), h(n, "output", () => {
     if (n.pubkey)
-      return l([Q.OP_1, n.pubkey]);
-  }), h(n, "redeemVersion", () => e.redeemVersion ? e.redeemVersion : e.redeem && e.redeem.redeemVersion !== void 0 && e.redeem.redeemVersion !== null ? e.redeem.redeemVersion : F), h(n, "redeem", () => {
-    const r = u();
-    if (!(!r || r.length < 2))
+      return y([Y.OP_1, n.pubkey]);
+  }), h(n, "redeemVersion", () => e.redeemVersion ? e.redeemVersion : e.redeem && e.redeem.redeemVersion !== void 0 && e.redeem.redeemVersion !== null ? e.redeem.redeemVersion : M), h(n, "redeem", () => {
+    const t = i();
+    if (!(!t || t.length < 2))
       return {
-        output: r[r.length - 2],
-        witness: r.slice(0, -2),
-        redeemVersion: r[r.length - 1][0] & W
+        output: t[t.length - 2],
+        witness: t.slice(0, -2),
+        redeemVersion: t[t.length - 1][0] & W
       };
   }), h(n, "pubkey", () => {
     if (e.pubkey) return e.pubkey;
-    if (e.output) return e.output.slice(2);
+    if (e.output) return e.output.subarray(2);
     if (e.address) return p().data;
     if (n.internalPubkey) {
-      const r = j(n.internalPubkey, n.hash);
-      if (r) return r.x;
+      const t = j(n.internalPubkey, n.hash);
+      if (t) return t.x;
     }
   }), h(n, "internalPubkey", () => {
     if (e.internalPubkey) return e.internalPubkey;
-    const r = u();
-    if (r && r.length > 1) return r[r.length - 1].slice(1, 33);
+    const t = i();
+    if (t && t.length > 1) return t[t.length - 1].subarray(1, 33);
   }), h(n, "signature", () => {
     if (e.signature) return e.signature;
-    const r = u();
-    if (!(!r || r.length !== 1))
-      return r[0];
+    const t = i();
+    if (!(!t || t.length !== 1))
+      return t[0];
   }), h(n, "witness", () => {
     if (e.witness) return e.witness;
-    const r = s();
-    if (r && e.redeem && e.redeem.output && e.internalPubkey) {
+    const t = s();
+    if (t && e.redeem && e.redeem.output && e.internalPubkey) {
       const f = H({
         output: e.redeem.output,
         version: n.redeemVersion
-      }), d = q(r, f);
+      }), d = q(t, f);
       if (!d) return;
-      const m = j(e.internalPubkey, r.hash);
-      if (!m) return;
-      const w = g.concat(
-        [g.from([n.redeemVersion | m.parity]), e.internalPubkey].concat(
+      const a = j(e.internalPubkey, t.hash);
+      if (!a) return;
+      const c = g.concat(
+        [g.from([n.redeemVersion | a.parity]), e.internalPubkey].concat(
           d
         )
       );
-      return [e.redeem.output, w];
+      return [e.redeem.output, c];
     }
     if (e.signature) return [e.signature];
   }), o.validate) {
-    let r = g.from([]);
+    let t = g.from([]);
     if (e.address) {
-      if (i && i.bech32 !== p().prefix)
+      if (u && u.bech32 !== p().prefix)
         throw new TypeError("Invalid prefix or Network mismatch");
-      if (p().version !== Y)
+      if (p().version !== z)
         throw new TypeError("Invalid address version");
       if (p().data.length !== 32) throw new TypeError("Invalid address data");
-      r = p().data;
+      t = p().data;
     }
     if (e.pubkey) {
-      if (r.length > 0 && !r.equals(e.pubkey))
+      if (t.length > 0 && !t.equals(e.pubkey))
         throw new TypeError("Pubkey mismatch");
-      r = e.pubkey;
+      t = e.pubkey;
     }
     if (e.output) {
-      if (e.output.length !== 34 || e.output[0] !== Q.OP_1 || e.output[1] !== 32)
+      if (e.output.length !== 34 || e.output[0] !== Y.OP_1 || e.output[1] !== 32)
         throw new TypeError("Output is invalid");
-      if (r.length > 0 && !r.equals(e.output.slice(2)))
+      if (t.length > 0 && !t.equals(e.output.subarray(2)))
         throw new TypeError("Pubkey mismatch");
-      r = e.output.slice(2);
+      t = e.output.subarray(2);
     }
     if (e.internalPubkey) {
-      const m = j(e.internalPubkey, n.hash);
-      if (r.length > 0 && !r.equals(m.x))
+      const a = j(e.internalPubkey, n.hash);
+      if (t.length > 0 && !t.equals(a.x))
         throw new TypeError("Pubkey mismatch");
-      r = m.x;
+      t = a.x;
     }
+    if (t && t.length && !K().isXOnlyPoint(t))
+      throw new TypeError("Invalid pubkey for p2tr");
     const f = s();
     if (e.hash && f && !e.hash.equals(f.hash))
       throw new TypeError("Hash mismatch");
     if (e.redeem && e.redeem.output && f) {
-      const m = H({
+      const a = H({
         output: e.redeem.output,
         version: n.redeemVersion
       });
-      if (!q(f, m))
+      if (!q(f, a))
         throw new TypeError("Redeem script not in tree");
     }
-    const d = u();
+    const d = i();
     if (e.redeem && n.redeem) {
       if (e.redeem.redeemVersion && e.redeem.redeemVersion !== n.redeem.redeemVersion)
         throw new TypeError("Redeem.redeemVersion and witness mismatch");
       if (e.redeem.output) {
-        if (a(e.redeem.output).length === 0)
+        if (w(e.redeem.output).length === 0)
           throw new TypeError("Redeem.output is invalid");
         if (n.redeem.output && !e.redeem.output.equals(n.redeem.output))
           throw new TypeError("Redeem.output and witness mismatch");
@@ -548,75 +549,75 @@ function Oe(e, o) {
         if (e.signature && !e.signature.equals(d[0]))
           throw new TypeError("Signature mismatch");
       } else {
-        const m = d[d.length - 1];
-        if (m.length < 33)
+        const a = d[d.length - 1];
+        if (a.length < 33)
           throw new TypeError(
-            `The control-block length is too small. Got ${m.length}, expected min 33.`
+            `The control-block length is too small. Got ${a.length}, expected min 33.`
           );
-        if ((m.length - 33) % 32 !== 0)
+        if ((a.length - 33) % 32 !== 0)
           throw new TypeError(
-            `The control-block length of ${m.length} is incorrect!`
+            `The control-block length of ${a.length} is incorrect!`
           );
-        const w = (m.length - 33) / 32;
-        if (w > 128)
-          throw new TypeError(`The script path is too long. Got ${w}, expected max 128.`);
-        const _ = m.slice(1, 33);
+        const c = (a.length - 33) / 32;
+        if (c > 128)
+          throw new TypeError(`The script path is too long. Got ${c}, expected max 128.`);
+        const _ = a.subarray(1, 33);
         if (e.internalPubkey && !e.internalPubkey.equals(_))
           throw new TypeError("Internal pubkey mismatch");
-        if (!ne().isXOnlyPoint(_))
+        if (!K().isXOnlyPoint(_))
           throw new TypeError("Invalid internalPubkey for p2tr witness");
-        const he = m[0] & W, pe = d[d.length - 2], fe = H({
+        const he = a[0] & W, pe = d[d.length - 2], fe = H({
           output: pe,
           version: he
-        }), de = K(m, fe), U = j(_, de);
+        }), de = L(a, fe), U = j(_, de);
         if (!U)
           throw new TypeError("Invalid outputKey for p2tr witness");
-        if (r.length && !r.equals(U.x))
+        if (t.length && !t.equals(U.x))
           throw new TypeError("Pubkey mismatch for p2tr witness");
-        if (U.parity !== (m[0] & 1)) throw new Error("Incorrect parity");
+        if (U.parity !== (a[0] & 1)) throw new Error("Incorrect parity");
       }
   }
   return Object.assign(n, e);
 }
-const z = v, _e = c.alloc(0);
+const Z = v, _e = m.alloc(0);
 function Se(e, o) {
   if (!e.address && !e.hash && !e.output && !e.pubkey && !e.witness)
     throw new TypeError("Not enough data");
-  o = Object.assign({ validate: !0 }, o || {}), t(
+  o = Object.assign({ validate: !0 }, o || {}), r(
     {
-      address: t.maybe(t.String),
-      hash: t.maybe(t.BufferN(20)),
-      input: t.maybe(t.BufferN(0)),
-      network: t.maybe(t.Object),
-      output: t.maybe(t.BufferN(22)),
-      pubkey: t.maybe(T),
-      signature: t.maybe(S),
-      witness: t.maybe(t.arrayOf(t.Buffer))
+      address: r.maybe(r.String),
+      hash: r.maybe(r.BufferN(20)),
+      input: r.maybe(r.BufferN(0)),
+      network: r.maybe(r.Object),
+      output: r.maybe(r.BufferN(22)),
+      pubkey: r.maybe(T),
+      signature: r.maybe(S),
+      witness: r.maybe(r.arrayOf(r.Buffer))
     },
     e
   );
-  const p = y(() => {
-    const i = b.bech32.decode(e.address), n = i.words.shift(), r = b.bech32.fromWords(i.words);
+  const p = l(() => {
+    const u = b.bech32.decode(e.address), n = u.words.shift(), t = b.bech32.fromWords(u.words);
     return {
       version: n,
-      prefix: i.prefix,
-      data: c.from(r)
+      prefix: u.prefix,
+      data: m.from(t)
     };
-  }), u = e.network || P, s = {
+  }), i = e.network || P, s = {
     name: k.P2WPKH,
-    network: u
+    network: i
   };
   if (h(s, "address", () => {
     if (!s.hash) return;
-    const i = b.bech32.toWords(s.hash);
-    return i.unshift(0), b.bech32.encode(u.bech32, i);
+    const u = b.bech32.toWords(s.hash);
+    return u.unshift(0), b.bech32.encode(i.bech32, u);
   }), h(s, "hash", () => {
-    if (e.output) return e.output.slice(2, 22);
+    if (e.output) return e.output.subarray(2, 22);
     if (e.address) return p().data;
     if (e.pubkey || s.pubkey) return E(e.pubkey || s.pubkey);
   }), h(s, "output", () => {
     if (s.hash)
-      return l([z.OP_0, s.hash]);
+      return y([Z.OP_0, s.hash]);
   }), h(s, "pubkey", () => {
     if (e.pubkey) return e.pubkey;
     if (e.witness)
@@ -631,29 +632,29 @@ function Se(e, o) {
     if (e.pubkey && e.signature)
       return [e.signature, e.pubkey];
   }), o.validate) {
-    let i = c.from([]);
+    let u = m.from([]);
     if (e.address) {
-      if (u && u.bech32 !== p().prefix)
+      if (i && i.bech32 !== p().prefix)
         throw new TypeError("Invalid prefix or Network mismatch");
       if (p().version !== 0) throw new TypeError("Invalid address version");
       if (p().data.length !== 20) throw new TypeError("Invalid address data");
-      i = p().data;
+      u = p().data;
     }
     if (e.hash) {
-      if (i.length > 0 && !i.equals(e.hash)) throw new TypeError("Hash mismatch");
-      i = e.hash;
+      if (u.length > 0 && !u.equals(e.hash)) throw new TypeError("Hash mismatch");
+      u = e.hash;
     }
     if (e.output) {
-      if (e.output.length !== 22 || e.output[0] !== z.OP_0 || e.output[1] !== 20)
+      if (e.output.length !== 22 || e.output[0] !== Z.OP_0 || e.output[1] !== 20)
         throw new TypeError("Output is invalid");
-      if (i.length > 0 && !i.equals(e.output.slice(2)))
+      if (u.length > 0 && !u.equals(e.output.subarray(2)))
         throw new TypeError("Hash mismatch");
-      i = e.output.slice(2);
+      u = e.output.subarray(2);
     }
     if (e.pubkey) {
       const n = E(e.pubkey);
-      if (i.length > 0 && !i.equals(n)) throw new TypeError("Hash mismatch");
-      if (i = n, !T(e.pubkey) || e.pubkey.length !== 33)
+      if (u.length > 0 && !u.equals(n)) throw new TypeError("Hash mismatch");
+      if (u = n, !T(e.pubkey) || e.pubkey.length !== 33)
         throw new TypeError("Invalid pubkey for p2wpkh");
     }
     if (e.witness) {
@@ -666,82 +667,82 @@ function Se(e, o) {
         throw new TypeError("Signature mismatch");
       if (e.pubkey && !e.pubkey.equals(e.witness[1])) throw new TypeError("Pubkey mismatch");
       const n = E(e.witness[1]);
-      if (i.length > 0 && !i.equals(n)) throw new TypeError("Hash mismatch");
+      if (u.length > 0 && !u.equals(n)) throw new TypeError("Hash mismatch");
     }
   }
   return Object.assign(s, e);
 }
-const Z = v, $ = c.alloc(0);
+const J = v, $ = m.alloc(0);
 function R(e) {
-  return !!(c.isBuffer(e) && e.length === 65 && e[0] === 4 && T(e));
+  return !!(m.isBuffer(e) && e.length === 65 && e[0] === 4 && T(e));
 }
 function Ie(e, o) {
   if (!e.address && !e.hash && !e.output && !e.redeem && !e.witness)
     throw new TypeError("Not enough data");
-  o = Object.assign({ validate: !0 }, o || {}), t(
+  o = Object.assign({ validate: !0 }, o || {}), r(
     {
-      network: t.maybe(t.Object),
-      address: t.maybe(t.String),
-      hash: t.maybe(t.BufferN(32)),
-      output: t.maybe(t.BufferN(34)),
-      redeem: t.maybe({
-        input: t.maybe(t.Buffer),
-        network: t.maybe(t.Object),
-        output: t.maybe(t.Buffer),
-        witness: t.maybe(t.arrayOf(t.Buffer))
+      network: r.maybe(r.Object),
+      address: r.maybe(r.String),
+      hash: r.maybe(r.BufferN(32)),
+      output: r.maybe(r.BufferN(34)),
+      redeem: r.maybe({
+        input: r.maybe(r.Buffer),
+        network: r.maybe(r.Object),
+        output: r.maybe(r.Buffer),
+        witness: r.maybe(r.arrayOf(r.Buffer))
       }),
-      input: t.maybe(t.BufferN(0)),
-      witness: t.maybe(t.arrayOf(t.Buffer))
+      input: r.maybe(r.BufferN(0)),
+      witness: r.maybe(r.arrayOf(r.Buffer))
     },
     e
   );
-  const p = y(() => {
-    const n = b.bech32.decode(e.address), r = n.words.shift(), f = b.bech32.fromWords(n.words);
+  const p = l(() => {
+    const n = b.bech32.decode(e.address), t = n.words.shift(), f = b.bech32.fromWords(n.words);
     return {
-      version: r,
+      version: t,
       prefix: n.prefix,
-      data: c.from(f)
+      data: m.from(f)
     };
-  }), u = y(() => a(e.redeem.input));
+  }), i = l(() => w(e.redeem.input));
   let s = e.network;
   s || (s = e.redeem && e.redeem.network || P);
-  const i = {
+  const u = {
     network: s,
     name: k.P2WSH
   };
-  if (h(i, "address", () => {
-    if (!i.hash) return;
-    const n = b.bech32.toWords(i.hash);
+  if (h(u, "address", () => {
+    if (!u.hash) return;
+    const n = b.bech32.toWords(u.hash);
     return n.unshift(0), b.bech32.encode(s.bech32, n);
-  }), h(i, "hash", () => {
-    if (e.output) return e.output.slice(2);
+  }), h(u, "hash", () => {
+    if (e.output) return e.output.subarray(2);
     if (e.address) return p().data;
-    if (i.redeem && i.redeem.output) return M(i.redeem.output);
-  }), h(i, "output", () => {
-    if (i.hash)
-      return l([Z.OP_0, i.hash]);
-  }), h(i, "redeem", () => {
+    if (u.redeem && u.redeem.output) return G(u.redeem.output);
+  }), h(u, "output", () => {
+    if (u.hash)
+      return y([J.OP_0, u.hash]);
+  }), h(u, "redeem", () => {
     if (e.witness)
       return {
         output: e.witness[e.witness.length - 1],
         input: $,
         witness: e.witness.slice(0, -1)
       };
-  }), h(i, "input", () => {
-    if (i.witness)
+  }), h(u, "input", () => {
+    if (u.witness)
       return $;
-  }), h(i, "witness", () => {
+  }), h(u, "witness", () => {
     if (e.redeem && e.redeem.input && e.redeem.input.length > 0 && e.redeem.output && e.redeem.output.length > 0) {
-      const n = le(u());
-      return i.redeem = Object.assign({ witness: n }, e.redeem), i.redeem.input = $, [].concat(n, e.redeem.output);
+      const n = ye(i());
+      return u.redeem = Object.assign({ witness: n }, e.redeem), u.redeem.input = $, [].concat(n, e.redeem.output);
     }
     if (e.redeem && e.redeem.output && e.redeem.witness)
       return [].concat(e.redeem.witness, e.redeem.output);
-  }), h(i, "name", () => {
+  }), h(u, "name", () => {
     const n = ["p2wsh"];
-    return i.redeem !== void 0 && i.redeem.name !== void 0 && n.push(i.redeem.name), n.join("-");
+    return u.redeem !== void 0 && u.redeem.name !== void 0 && n.push(u.redeem.name), n.join("-");
   }), o.validate) {
-    let n = c.from([]);
+    let n = m.from([]);
     if (e.address) {
       if (p().prefix !== s.bech32)
         throw new TypeError("Invalid prefix or Network mismatch");
@@ -754,11 +755,11 @@ function Ie(e, o) {
       n = e.hash;
     }
     if (e.output) {
-      if (e.output.length !== 34 || e.output[0] !== Z.OP_0 || e.output[1] !== 32)
+      if (e.output.length !== 34 || e.output[0] !== J.OP_0 || e.output[1] !== 32)
         throw new TypeError("Output is invalid");
-      const r = e.output.slice(2);
-      if (n.length > 0 && !n.equals(r)) throw new TypeError("Hash mismatch");
-      n = r;
+      const t = e.output.subarray(2);
+      if (n.length > 0 && !n.equals(t)) throw new TypeError("Hash mismatch");
+      n = t;
     }
     if (e.redeem) {
       if (e.redeem.network && e.redeem.network !== s)
@@ -766,48 +767,48 @@ function Ie(e, o) {
       if (e.redeem.input && e.redeem.input.length > 0 && e.redeem.witness && e.redeem.witness.length > 0)
         throw new TypeError("Ambiguous witness source");
       if (e.redeem.output) {
-        const r = a(e.redeem.output);
-        if (!r || r.length < 1)
+        const t = w(e.redeem.output);
+        if (!t || t.length < 1)
           throw new TypeError("Redeem.output is invalid");
         if (e.redeem.output.byteLength > 3600)
           throw new TypeError("Redeem.output unspendable if larger than 3600 bytes");
-        if (ie(r) > 201)
+        if (ue(t) > 201)
           throw new TypeError(
             "Redeem.output unspendable with more than 201 non-push ops"
           );
-        const f = M(e.redeem.output);
+        const f = G(e.redeem.output);
         if (n.length > 0 && !n.equals(f)) throw new TypeError("Hash mismatch");
         n = f;
       }
-      if (e.redeem.input && !ue(u()))
+      if (e.redeem.input && !ie(i()))
         throw new TypeError("Non push-only scriptSig");
       if (e.witness && e.redeem.witness && !N(e.witness, e.redeem.witness))
         throw new TypeError("Witness and redeem.witness mismatch");
-      if (e.redeem.input && u().some(R) || e.redeem.output && (a(e.redeem.output) || []).some(R))
+      if (e.redeem.input && i().some(R) || e.redeem.output && (w(e.redeem.output) || []).some(R))
         throw new TypeError("redeem.input or redeem.output contains uncompressed pubkey");
     }
     if (e.witness && e.witness.length > 0) {
-      const r = e.witness[e.witness.length - 1];
-      if (e.redeem && e.redeem.output && !e.redeem.output.equals(r))
+      const t = e.witness[e.witness.length - 1];
+      if (e.redeem && e.redeem.output && !e.redeem.output.equals(t))
         throw new TypeError("Witness and redeem.output mismatch");
-      if (e.witness.some(R) || (a(r) || []).some(R))
+      if (e.witness.some(R) || (w(t) || []).some(R))
         throw new TypeError("Witness contains uncompressed pubkey");
     }
   }
-  return Object.assign(i, e);
+  return Object.assign(u, e);
 }
-const J = v, ee = 16, te = 2, re = 40;
+const ee = v, re = 16, te = 2, ne = 40;
 function He(e, o) {
   if (!e.address && !e.output && !e.program && (typeof e.deploymentVersion > "u" || !e.hash160))
     throw new TypeError("At least one of address, output or program must be provided");
-  o = Object.assign({ validate: !0 }, o || {}), t(
+  o = Object.assign({ validate: !0 }, o || {}), r(
     {
-      address: t.maybe(t.String),
-      output: t.maybe(t.Buffer),
-      program: t.maybe(t.Buffer),
-      network: t.maybe(t.Object),
-      deploymentVersion: t.maybe(t.Number),
-      hash160: t.maybe(t.BufferN(20))
+      address: r.maybe(r.String),
+      output: r.maybe(r.Buffer),
+      program: r.maybe(r.Buffer),
+      network: r.maybe(r.Object),
+      deploymentVersion: r.maybe(r.Number),
+      hash160: r.maybe(r.BufferN(20))
     },
     e
   );
@@ -816,135 +817,136 @@ function He(e, o) {
       if (e.hash160.length !== 20) throw new TypeError("hash160 must be exactly 20 bytes");
       if (e.deploymentVersion < 0 || e.deploymentVersion > 255)
         throw new TypeError("deploymentVersion must fit in one byte");
-      return c.concat([c.of(e.deploymentVersion), e.hash160]);
+      return m.concat([m.of(e.deploymentVersion), e.hash160]);
     }
-  }, u = y(() => se(e.address)), s = e.network || P, i = {
+  }, i = l(() => se(e.address)), s = e.network || P, u = {
     name: k.P2OP,
     network: s,
     deploymentVersion: 0
   };
-  if (h(i, "program", () => {
+  if (h(u, "program", () => {
     if (e.program) return e.program;
     const n = p();
     if (n) return n;
     if (e.output) {
-      if (e.output[0] !== J.OP_16) throw new TypeError("Invalid P2OP script");
-      let r = 1, f;
+      if (e.output[0] !== ee.OP_16) throw new TypeError("Invalid P2OP script");
+      let t = 1, f;
       if (e.output[1] < 76)
-        f = e.output[1], r = 2;
+        f = e.output[1], t = 2;
       else if (e.output[1] === 76)
-        f = e.output[2], r = 3;
+        f = e.output[2], t = 3;
       else
         throw new TypeError("Unsupported push opcode in P2OP script");
-      return e.output.slice(r, r + f);
+      return e.output.subarray(t, t + f);
     }
     if (e.address)
-      return u().data;
-  }), h(i, "deploymentVersion", () => {
-    if (i.program)
-      return i.program[0];
-  }), h(i, "hash160", () => {
-    if (i.program)
-      return i.program.slice(1);
-  }), h(i, "output", () => {
-    if (i.program)
-      return l([J.OP_16, i.program]);
-  }), h(i, "address", () => {
-    if (!i.program) return;
+      return i().data;
+  }), h(u, "deploymentVersion", () => {
+    if (u.program)
+      return u.program[0];
+  }), h(u, "hash160", () => {
+    if (u.program)
+      return u.program.subarray(1);
+  }), h(u, "output", () => {
+    if (u.program)
+      return y([ee.OP_16, u.program]);
+  }), h(u, "address", () => {
+    if (!u.program) return;
     if (!s.bech32Opnet)
       throw new TypeError("Network does not support opnet");
-    const n = b.bech32m.toWords(i.program);
-    return n.unshift(ee), b.bech32m.encode(s.bech32Opnet, n);
+    const n = b.bech32m.toWords(u.program);
+    return n.unshift(re), b.bech32m.encode(s.bech32Opnet, n);
   }), o.validate) {
     let n = g.alloc(0);
     if (e.address) {
-      const r = u();
-      if (s.bech32Opnet !== r.prefix)
+      const t = i();
+      if (s.bech32Opnet !== t.prefix)
         throw new TypeError("Invalid prefix or network mismatch");
-      if (r.version !== ee)
+      if (t.version !== re)
         throw new TypeError("Invalid witness version for p2op");
-      if (r.data.length < te || r.data.length > re)
+      if (t.data.length < te || t.data.length > ne)
         throw new TypeError("Invalid witness program length");
-      n = r.data;
+      n = t.data;
     }
     if (e.program) {
       if (n.length && !n.equals(e.program)) throw new TypeError("Program mismatch");
       n = e.program;
     }
     if (!n.length && e.deploymentVersion !== void 0 && e.hash160 && (n = p()), e.output) {
-      const r = i.program;
-      if (n.length && !n.equals(r))
+      const t = u.program;
+      if (n.length && !n.equals(t))
         throw new TypeError("Program mismatch (output vs other source)");
-      n = r;
+      n = t;
     }
-    if (n.length < te || n.length > re)
+    if (n.length < te || n.length > ne)
       throw new TypeError(`Witness program must be 2–40 bytes. Was ${n.length} bytes`);
     if (e.deploymentVersion !== void 0 && e.deploymentVersion !== n[0])
       throw new TypeError("deploymentVersion mismatch");
-    if (e.hash160 && !e.hash160.equals(n.slice(1))) throw new TypeError("hash160 mismatch");
+    if (e.hash160 && !e.hash160.equals(n.subarray(1)))
+      throw new TypeError("hash160 mismatch");
   }
-  return Object.assign(i, e);
+  return Object.assign(u, e);
 }
 const O = v;
 function Ne(e, o) {
   if (!e.address && !e.hash && !e.output && !e.pubkey && !e.input)
     throw new TypeError("Not enough data");
-  o = Object.assign({ validate: !0 }, o || {}), t(
+  o = Object.assign({ validate: !0 }, o || {}), r(
     {
-      network: t.maybe(t.Object),
-      address: t.maybe(t.String),
-      hash: t.maybe(t.BufferN(20)),
-      output: t.maybe(t.BufferN(25)),
-      pubkey: t.maybe(T),
-      signature: t.maybe(S),
-      input: t.maybe(t.Buffer)
+      network: r.maybe(r.Object),
+      address: r.maybe(r.String),
+      hash: r.maybe(r.BufferN(20)),
+      output: r.maybe(r.BufferN(25)),
+      pubkey: r.maybe(T),
+      signature: r.maybe(S),
+      input: r.maybe(r.Buffer)
     },
     e
   );
-  const p = y(() => {
-    const n = c.from(x.decode(e.address)), r = n.readUInt8(0), f = n.slice(1);
-    return { version: r, hash: f };
-  }), u = y(() => a(e.input)), s = e.network || P, i = {
+  const p = l(() => {
+    const n = m.from(x.decode(e.address)), t = n.readUInt8(0), f = n.subarray(1);
+    return { version: t, hash: f };
+  }), i = l(() => w(e.input)), s = e.network || P, u = {
     name: k.P2PKH,
     network: s,
     hash: void 0
   };
-  if (h(i, "address", () => {
-    if (!i.hash) return;
-    const n = c.allocUnsafe(21);
-    return n.writeUInt8(s.pubKeyHash, 0), i.hash.copy(n, 1), x.encode(n);
-  }), h(i, "hash", () => {
-    if (e.output) return e.output.slice(3, 23);
+  if (h(u, "address", () => {
+    if (!u.hash) return;
+    const n = m.allocUnsafe(21);
+    return n.writeUInt8(s.pubKeyHash, 0), u.hash.copy(n, 1), x.encode(n);
+  }), h(u, "hash", () => {
+    if (e.output) return e.output.subarray(3, 23);
     if (e.address) return p().hash;
-    if (e.pubkey || i.pubkey) return E(e.pubkey || i.pubkey);
-  }), h(i, "output", () => {
-    if (i.hash)
-      return l([
+    if (e.pubkey || u.pubkey) return E(e.pubkey || u.pubkey);
+  }), h(u, "output", () => {
+    if (u.hash)
+      return y([
         O.OP_DUP,
         O.OP_HASH160,
-        i.hash,
+        u.hash,
         O.OP_EQUALVERIFY,
         O.OP_CHECKSIG
       ]);
-  }), h(i, "pubkey", () => {
+  }), h(u, "pubkey", () => {
     if (e.input)
-      return u()[1];
-  }), h(i, "signature", () => {
+      return i()[1];
+  }), h(u, "signature", () => {
     if (e.input)
-      return u()[0];
-  }), h(i, "input", () => {
+      return i()[0];
+  }), h(u, "input", () => {
     if (!e.pubkey || !e.signature) return;
     let n = e.pubkey;
     if (e.useHybrid || e.useUncompressed) {
-      const r = G(e.pubkey);
-      r && (e.useUncompressed ? n = r.uncompressed : n = r.hybrid);
+      const t = X(e.pubkey);
+      t && (e.useUncompressed ? n = t.uncompressed : n = t.hybrid);
     }
-    return l([e.signature, n]);
-  }), h(i, "witness", () => {
-    if (i.input)
+    return y([e.signature, n]);
+  }), h(u, "witness", () => {
+    if (u.input)
       return [];
   }), o.validate) {
-    let n = c.from([]);
+    let n = m.from([]);
     if (e.address) {
       if (p().version !== s.pubKeyHash)
         throw new TypeError("Invalid version or Network mismatch");
@@ -960,50 +962,50 @@ function Ne(e, o) {
     if (e.output) {
       if (e.output.length !== 25 || e.output[0] !== O.OP_DUP || e.output[1] !== O.OP_HASH160 || e.output[2] !== 20 || e.output[23] !== O.OP_EQUALVERIFY || e.output[24] !== O.OP_CHECKSIG)
         throw new TypeError("Output is invalid");
-      const r = e.output.slice(3, 23);
-      if (n.length > 0 && !n.equals(r)) throw new TypeError("Hash mismatch");
-      n = r;
+      const t = e.output.subarray(3, 23);
+      if (n.length > 0 && !n.equals(t)) throw new TypeError("Hash mismatch");
+      n = t;
     }
     if (e.pubkey) {
-      const r = E(e.pubkey);
-      let f = n.length > 0 && !n.equals(r);
+      const t = E(e.pubkey);
+      let f = n.length > 0 && !n.equals(t);
       if (f && (e.pubkey.length === 33 && (e.pubkey[0] === 2 || e.pubkey[0] === 3) || e.pubkey.length === 65 && e.pubkey[0] === 4)) {
-        const d = G(e.pubkey);
+        const d = X(e.pubkey);
         if (d) {
-          const m = E(d.uncompressed);
-          if (n.equals(m))
+          const a = E(d.uncompressed);
+          if (n.equals(a))
             f = !1, e.useUncompressed = !0;
           else {
-            const w = E(d.hybrid);
-            f = !n.equals(w), f || (e.useHybrid = !0);
+            const c = E(d.hybrid);
+            f = !n.equals(c), f || (e.useHybrid = !0);
           }
         }
       }
       if (f)
         throw new TypeError("Hash mismatch");
-      n = r;
+      n = t;
     }
     if (e.input) {
-      const r = u();
-      if (r.length !== 2) throw new TypeError("Input is invalid");
-      if (!S(r[0]))
+      const t = i();
+      if (t.length !== 2) throw new TypeError("Input is invalid");
+      if (!S(t[0]))
         throw new TypeError("Input has invalid signature");
-      if (!T(r[1])) throw new TypeError("Input has invalid pubkey");
-      if (e.signature && !e.signature.equals(r[0]))
+      if (!T(t[1])) throw new TypeError("Input has invalid pubkey");
+      if (e.signature && !e.signature.equals(t[0]))
         throw new TypeError("Signature mismatch");
-      if (e.pubkey && !e.pubkey.equals(r[1]))
+      if (e.pubkey && !e.pubkey.equals(t[1]))
         throw new TypeError("Pubkey mismatch");
-      const f = E(r[1]);
+      const f = E(t[1]);
       if (n.length > 0 && !n.equals(f)) throw new TypeError("Hash mismatch (input)");
     }
   }
-  return Object.assign(i, e);
+  return Object.assign(u, e);
 }
 var k = /* @__PURE__ */ ((e) => (e.P2PK = "p2pk", e.P2PKH = "p2pkh", e.P2SH = "p2sh", e.P2MS = "p2ms", e.P2WPKH = "p2wpkh", e.P2WSH = "p2wsh", e.P2TR = "p2tr", e.P2OP = "p2op", e.Embed = "embed", e.ScriptRedeem = "scriptRedeem", e))(k || {});
 const Re = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  LEAF_VERSION_TAPSCRIPT: F,
-  MAX_TAPTREE_DEPTH: ye,
+  LEAF_VERSION_TAPSCRIPT: M,
+  MAX_TAPTREE_DEPTH: le,
   PaymentType: k,
   findScriptPath: q,
   p2data: ke,
@@ -1016,16 +1018,16 @@ const Re = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   p2wpkh: Se,
   p2wsh: Ie,
   prop: h,
-  rootHashFromPath: K,
+  rootHashFromPath: L,
   tapTweakHash: oe,
   tapleafHash: H,
   toHashTree: A,
   tweakKey: j,
-  value: y
+  value: l
 }, Symbol.toStringTag, { value: "Module" }));
 export {
-  F as L,
-  ye as M,
+  M as L,
+  le as M,
   k as P,
   Pe as a,
   Se as b,
@@ -1040,6 +1042,6 @@ export {
   q as k,
   oe as l,
   Ne as p,
-  K as r,
+  L as r,
   j as t
 };