@btc-vision/bitcoin 6.5.1 → 6.5.3

package/browser/chunks/{script-COWGdiOo.js → script-CROJPzz_.js}

@@ -1,5 +1,5 @@
-import { B as _ } from "./crypto-C6FlKKmp.js";
-import { u as C, k as d, U as H, v as y, x as L, A as f, y as h, z as M, o as I, C as V, D as w, E as B, j as F, G as m, p as K } from "./utils-BKmkTzNZ.js";
+import { B as _ } from "./crypto-0PweVewC.js";
+import { u as y, k as d, U as C, v as H, x as L, A as u, y as h, z as M, o as I, C as V, D as w, E as B, j as F, G as m, p as K } from "./utils-CO5kmxe9.js";
 const o = {
   OP_FALSE: 0,
   OP_0: 0,
@@ -122,84 +122,84 @@ const o = {
   OP_INVALIDOPCODE: 255
 }, T = {};
 for (const t of Object.keys(o)) {
-  const e = o[t];
-  T[e] = t;
+  const n = o[t];
+  T[n] = t;
 }
-function G(t, e, n) {
-  e = e || 4, n = n === void 0 ? !0 : n;
-  const O = t.length;
-  if (O === 0) return 0;
-  if (O > e) throw new TypeError("Script number overflow");
-  if (n && (t[O - 1] & 127) === 0 && (O <= 1 || (t[O - 2] & 128) === 0))
+function G(t, n, e) {
+  n = n || 4, e = e === void 0 ? !0 : e;
+  const r = t.length;
+  if (r === 0) return 0;
+  if (r > n) throw new TypeError("Script number overflow");
+  if (e && (t[r - 1] & 127) === 0 && (r <= 1 || (t[r - 2] & 128) === 0))
     throw new Error("Non-minimally encoded script number");
-  if (O === 5) {
+  if (r === 5) {
     const P = t.readUInt32LE(0), i = t.readUInt8(4);
     return i & 128 ? -((i & -129) * 4294967296 + P) : i * 4294967296 + P;
   }
-  let r = 0;
-  for (let P = 0; P < O; ++P)
-    r |= t[P] << 8 * P;
-  return t[O - 1] & 128 ? -(r & ~(128 << 8 * (O - 1))) : r;
+  let O = 0;
+  for (let P = 0; P < r; ++P)
+    O |= t[P] << 8 * P;
+  return t[r - 1] & 128 ? -(O & ~(128 << 8 * (r - 1))) : O;
 }
 function v(t) {
   return t > 2147483647 ? 5 : t > 8388607 ? 4 : t > 32767 ? 3 : t > 127 ? 2 : t > 0 ? 1 : 0;
 }
 function R(t) {
-  let e = Math.abs(t);
-  const n = v(e), O = _.allocUnsafe(n), r = t < 0;
-  for (let P = 0; P < n; ++P)
-    O.writeUInt8(e & 255, P), e >>= 8;
-  return O[n - 1] & 128 ? O.writeUInt8(r ? 128 : 0, n - 1) : r && (O[n - 1] |= 128), O;
+  let n = Math.abs(t);
+  const e = v(n), r = _.allocUnsafe(e), O = t < 0;
+  for (let P = 0; P < e; ++P)
+    r.writeUInt8(n & 255, P), n >>= 8;
+  return r[e - 1] & 128 ? r.writeUInt8(O ? 128 : 0, e - 1) : O && (r[e - 1] |= 128), r;
 }
-const j = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const b = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   decode: G,
   encode: R
-}, Symbol.toStringTag, { value: "Module" })), { typeforce: Q } = d, u = _.alloc(1, 0);
+}, Symbol.toStringTag, { value: "Module" })), { typeforce: $ } = d, f = _.alloc(1, 0);
 function A(t) {
-  let e = 0;
-  for (; t[e] === 0; ) ++e;
-  return e === t.length ? u : (t = t.slice(e), t[0] & 128 ? _.concat([u, t], 1 + t.length) : t);
+  let n = 0;
+  for (; t[n] === 0; ) ++n;
+  return n === t.length ? f : (t = t.subarray(n), t[0] & 128 ? _.concat([f, t], 1 + t.length) : t);
 }
 function S(t) {
-  t[0] === 0 && (t = t.slice(1));
-  const e = _.alloc(32, 0), n = Math.max(0, 32 - t.length);
-  return t.copy(e, n), e;
+  t[0] === 0 && (t = t.subarray(1));
+  const n = _.alloc(32, 0), e = Math.max(0, 32 - t.length);
+  return t.copy(n, e), n;
 }
-function Y(t) {
-  const e = t.readUInt8(t.length - 1);
-  if (!l(e))
-    throw new Error("Invalid hashType " + e);
-  const n = C(t.slice(0, -1)), O = S(n.r), r = S(n.s);
-  return { signature: _.concat([O, r], 64), hashType: e };
+function j(t) {
+  const n = t.readUInt8(t.length - 1);
+  if (!a(n))
+    throw new Error(`Invalid hashType ${n}`);
+  const e = y(t.subarray(0, -1)), r = S(e.r), O = S(e.s);
+  return { signature: _.concat([r, O], 64), hashType: n };
 }
-function z(t, e) {
-  if (Q(
+function Q(t, n) {
+  if ($(
     {
-      signature: y(64),
-      hashType: H
+      signature: H(64),
+      hashType: C
     },
-    { signature: t, hashType: e }
-  ), !l(e))
-    throw new Error("Invalid hashType " + e);
-  const n = _.allocUnsafe(1);
-  n.writeUInt8(e, 0);
-  const O = A(t.slice(0, 32)), r = A(t.slice(32, 64));
-  return _.concat([L(O, r), n]);
+    { signature: t, hashType: n }
+  ), !a(n))
+    throw new Error(`Invalid hashType ${n}`);
+  const e = _.allocUnsafe(1);
+  e.writeUInt8(n, 0);
+  const r = A(t.subarray(0, 32)), O = A(t.subarray(32, 64));
+  return _.concat([L(r, O), e]);
 }
-const $ = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Y = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  decode: Y,
-  encode: z
+  decode: j,
+  encode: Q
 }, Symbol.toStringTag, { value: "Module" })), { typeforce: s } = d, U = o.OP_RESERVED;
-function b(t) {
+function z(t) {
   return K(t) && (t === o.OP_0 || t >= o.OP_1 && t <= o.OP_16 || t === o.OP_1NEGATE);
 }
 function N(t) {
-  return I(t) || b(t);
+  return I(t) || z(t);
 }
 function p(t) {
-  return f(t) && t.every(N);
+  return u(t) && t.every(N);
 }
 function W(t) {
   return t.length - t.filter(N).length;
@@ -215,104 +215,104 @@ function D(t) {
   return _.isBuffer(t);
 }
 function X(t) {
-  return f(t);
+  return u(t);
 }
 function E(t) {
   return _.isBuffer(t);
 }
 function g(t) {
   if (D(t)) return t;
-  s(f, t);
-  const e = t.reduce((r, P) => E(P) ? P.length === 1 && c(P) !== void 0 ? r + 1 : r + h(P.length) + P.length : r + 1, 0), n = _.allocUnsafe(e);
-  let O = 0;
-  if (t.forEach((r) => {
-    if (E(r)) {
-      const P = c(r);
+  s(u, t);
+  const n = t.reduce((O, P) => E(P) ? P.length === 1 && c(P) !== void 0 ? O + 1 : O + h(P.length) + P.length : O + 1, 0), e = _.allocUnsafe(n);
+  let r = 0;
+  if (t.forEach((O) => {
+    if (E(O)) {
+      const P = c(O);
       if (P !== void 0) {
-        n.writeUInt8(P, O), O += 1;
+        e.writeUInt8(P, r), r += 1;
         return;
       }
-      O += M(n, r.length, O), r.copy(n, O), O += r.length;
+      r += M(e, O.length, r), O.copy(e, r), r += O.length;
     } else
-      n.writeUInt8(r, O), O += 1;
-  }), O !== n.length) throw new Error("Could not decode chunks");
-  return n;
+      e.writeUInt8(O, r), r += 1;
+  }), r !== e.length) throw new Error("Could not decode chunks");
+  return e;
 }
-function a(t) {
+function l(t) {
   if (X(t)) return t;
   s(I, t);
-  const e = [];
-  let n = 0;
-  for (; n < t.length; ) {
-    const O = t[n];
-    if (O > o.OP_0 && O <= o.OP_PUSHDATA4) {
-      const r = V(t, n);
-      if (r === null || (n += r.size, n + r.number > t.length)) return null;
-      const P = t.slice(n, n + r.number);
-      n += r.number;
+  const n = [];
+  let e = 0;
+  for (; e < t.length; ) {
+    const r = t[e];
+    if (r > o.OP_0 && r <= o.OP_PUSHDATA4) {
+      const O = V(t, e);
+      if (O === null || (e += O.size, e + O.number > t.length)) return null;
+      const P = t.subarray(e, e + O.number);
+      e += O.number;
       const i = c(P);
-      i !== void 0 ? e.push(i) : e.push(P);
+      i !== void 0 ? n.push(i) : n.push(P);
     } else
-      e.push(O), n += 1;
+      n.push(r), e += 1;
   }
-  return e;
+  return n;
 }
 function Z(t) {
-  if (D(t) && (t = a(t)), !t)
+  if (D(t) && (t = l(t)), !t)
     throw new Error("Could not convert invalid chunks to ASM");
-  return t.map((e) => {
-    if (E(e)) {
-      const n = c(e);
-      if (n === void 0) return e.toString("hex");
-      e = n;
+  return t.map((n) => {
+    if (E(n)) {
+      const e = c(n);
+      if (e === void 0) return n.toString("hex");
+      n = e;
     }
-    return T[e];
+    return T[n];
   }).join(" ");
 }
 function q(t) {
   return s(w, t), g(
-    t.split(" ").map((e) => o[e] !== void 0 ? o[e] : (s(B, e), _.from(e, "hex")))
+    t.split(" ").map((n) => o[n] !== void 0 ? o[n] : (s(B, n), _.from(n, "hex")))
   );
 }
 function J(t) {
-  return t = a(t), s(p, t), t.map((e) => E(e) ? e : e === o.OP_0 ? _.allocUnsafe(0) : R(e - U));
+  return t = l(t), s(p, t), t.map((n) => E(n) ? n : n === o.OP_0 ? _.allocUnsafe(0) : R(n - U));
 }
 function x(t) {
   return F(t);
 }
-function l(t) {
-  const e = t & -129;
-  return e > 0 && e < 4;
+function a(t) {
+  const n = t & -129;
+  return n > 0 && n < 4;
 }
 function k(t) {
-  return !_.isBuffer(t) || !l(t[t.length - 1]) ? !1 : m(t.slice(0, -1));
+  return !_.isBuffer(t) || !a(t[t.length - 1]) ? !1 : m(t.subarray(0, -1));
 }
-const tt = j, et = $, rt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const tt = b, nt = Y, Ot = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   compile: g,
   countNonPushOnlyOPs: W,
-  decompile: a,
+  decompile: l,
   fromASM: q,
   isCanonicalPubKey: x,
   isCanonicalScriptSignature: k,
-  isDefinedHashType: l,
+  isDefinedHashType: a,
   isPushOnly: p,
   number: tt,
   opcodes: o,
-  signature: et,
+  signature: nt,
   toASM: Z,
   toStack: J
 }, Symbol.toStringTag, { value: "Module" }));
 export {
   x as a,
-  rt as b,
+  Ot as b,
   g as c,
-  a as d,
+  l as d,
   W as e,
   p as f,
   J as g,
   k as i,
   o,
-  et as s,
+  nt as s,
   Z as t
 };