@btc-vision/transaction 1.8.7 → 1.8.8

package/browser/index.js

@@ -326,7 +326,7 @@ var or = /^[0-9a-fA-F]+$/, W = class Me {
   }
   static createSimpleP2WDAWitness(e, t) {
     const i = [e];
-    for (let r = 0; r < 10; r++) i.push(new Uint8Array(0));
+    for (let r = 0; r < 10; r++) i.push(/* @__PURE__ */ new Uint8Array(0));
     return i.push(t), i;
   }
   static validateP2WDASignature(e, t, i) {
@@ -531,7 +531,7 @@ var or = /^[0-9a-fA-F]+$/, W = class Me {
     return e < t ? e : t;
   }
   getHybridPublicKey(e, t) {
-    const i = t % 2n === 0n ? 6 : 7, r = this.bigIntTo32Bytes(e), s = this.bigIntTo32Bytes(t), n = new Uint8Array(65);
+    const i = t % 2n === 0n ? 6 : 7, r = this.bigIntTo32Bytes(e), s = this.bigIntTo32Bytes(t), n = /* @__PURE__ */ new Uint8Array(65);
     return n[0] = i, n.set(r, 1), n.set(s, 33), n;
   }
   isValidX(e) {
@@ -554,7 +554,7 @@ var or = /^[0-9a-fA-F]+$/, W = class Me {
     return t;
   }
   bigIntTo32Bytes(e) {
-    const t = new Uint8Array(32);
+    const t = /* @__PURE__ */ new Uint8Array(32);
     for (let i = 31; i >= 0; i--)
       t[i] = Number(e & 255n), e >>= 8n;
     return t;
@@ -692,18 +692,19 @@ var cr = [
     return new Y(t);
   }
   static uncompressedToCompressed(t) {
-    const i = Uint8Array.from(t), r = i.slice(1, 33), s = i.slice(33), n = new Uint8Array(33);
+    const i = Uint8Array.from(t), r = i.slice(1, 33), s = i.slice(33), n = /* @__PURE__ */ new Uint8Array(33);
     return n[0] = 2 + (s[s.length - 1] & 1), n.set(r, 1), n;
   }
   static fromBigInt(t, i) {
-    return new Y(Y.bigintToUint8Array(t), i !== void 0 ? Y.bigintToUint8Array(i) : void 0);
+    const r = Y.bigintToUint8Array(t), s = i !== void 0 ? Y.bigintToUint8Array(i) : void 0;
+    return new Y(r, s);
   }
   static fromUint64Array(t, i, r, s) {
-    const n = new Uint8Array(32), o = new DataView(n.buffer);
+    const n = /* @__PURE__ */ new Uint8Array(32), o = new DataView(n.buffer);
     return o.setBigUint64(0, t, !1), o.setBigUint64(8, i, !1), o.setBigUint64(16, r, !1), o.setBigUint64(24, s, !1), new Y(n);
   }
   static bigintToUint8Array(t) {
-    const i = new Uint8Array(32), r = new DataView(i.buffer);
+    const i = /* @__PURE__ */ new Uint8Array(32), r = new DataView(i.buffer);
     return r.setBigUint64(0, t >> 192n & 18446744073709551615n, !1), r.setBigUint64(8, t >> 128n & 18446744073709551615n, !1), r.setBigUint64(16, t >> 64n & 18446744073709551615n, !1), r.setBigUint64(24, t & 18446744073709551615n, !1), i;
   }
   [Symbol.dispose]() {
@@ -1619,7 +1620,7 @@ var cr = [
     super(e, t, i);
   }
   static getPubKeyAsBuffer(e, t) {
-    let i = new Uint8Array(0);
+    let i = /* @__PURE__ */ new Uint8Array(0);
     for (const s of e) {
       if (!I.fromPublicKey(s, t).compressed) throw new Error("Public key must be compressed");
       if (s.byteLength !== 33) throw new Error(`Public key must be 33 bytes, got ${s.byteLength} bytes.`);
@@ -1878,10 +1879,10 @@ var cr = [
   }
 }, ur = class extends tt {
   constructor(e, t = y.bitcoin) {
-    super(e, new Uint8Array(0), t);
+    super(e, /* @__PURE__ */ new Uint8Array(0), t);
   }
   static getPubKeyAsBuffer(e, t) {
-    let i = new Uint8Array(0);
+    let i = /* @__PURE__ */ new Uint8Array(0);
     for (const s of e) {
       if (!I.fromPublicKey(s, t).compressed) throw new Error("Public key must be compressed");
       if (s.byteLength !== 33) throw new Error(`Public key must be 33 bytes, got ${s.byteLength} bytes.`);
@@ -1976,7 +1977,7 @@ var cr = [
   }
 };
 function It(e) {
-  let t = new Uint8Array(0);
+  let t = /* @__PURE__ */ new Uint8Array(0);
   function i(a, c) {
     const u = new Uint8Array(a.length + c.length);
     return u.set(a, 0), u.set(c, a.length), u;
@@ -2065,7 +2066,7 @@ var Ut = g("50929b74c1a04954b78b4b6035e97a5e078a5a0f28ec96d547bfee9ace803ac0"),
   }
   static buildDummyWitness(e) {
     const { config: t, tapscript: i, controlBlock: r } = e, s = [];
-    for (let n = 0; n < t.pubkeys.length; n++) t.pubkeys.length - 1 - n < t.threshold ? s.push(new Uint8Array(64)) : s.push(new Uint8Array(0));
+    for (let n = 0; n < t.pubkeys.length; n++) t.pubkeys.length - 1 - n < t.threshold ? s.push(/* @__PURE__ */ new Uint8Array(64)) : s.push(/* @__PURE__ */ new Uint8Array(0));
     return s.push(i), s.push(r), s;
   }
   static buildFinalWitnessFromTapScriptSigs(e, t) {
@@ -2079,7 +2080,7 @@ var Ut = g("50929b74c1a04954b78b4b6035e97a5e078a5a0f28ec96d547bfee9ace803ac0"),
       if (l) {
         if (l.length !== 64 && l.length !== 65) throw new Error(`Invalid Schnorr signature length ${l.length} for CSV multisig spend`);
         o.push(l), a++;
-      } else o.push(new Uint8Array(0));
+      } else o.push(/* @__PURE__ */ new Uint8Array(0));
     }
     if (a < i.threshold) throw new Error(`CSV multisig spend needs ${i.threshold} signatures, got ${a}`);
     const c = [];
@@ -2409,7 +2410,7 @@ var Tt = /* @__PURE__ */ (function(e) {
       else if (c.length === h) p = c.subarray(0, l);
       else throw new Error(`Invalid ML-DSA key length for security level ${s}. Expected ${l} bytes (private only) or ${h} bytes (private+public), got ${c.length} bytes.`);
       if (n && n.length !== 32) throw new Error("Chain code must be 32 bytes");
-      this._chainCode = n || new Uint8Array(32), this._mldsaKeypair = v.QuantumBIP32Factory.fromPrivateKey(p, this._chainCode, this.network, s);
+      this._chainCode = n || /* @__PURE__ */ new Uint8Array(32), this._mldsaKeypair = v.QuantumBIP32Factory.fromPrivateKey(p, this._chainCode, this.network, s);
     } else
       this._mldsaKeypair = v.QuantumBIP32Factory.fromBase58(a), this._chainCode = new Uint8Array(this._mldsaKeypair.chainCode), this._securityLevel = this._mldsaKeypair.securityLevel;
     this._bufferPubKey = this._keypair.publicKey, this._address = new z(this._mldsaKeypair.publicKey, this._keypair.publicKey), this._p2tr = this._address.p2tr(this.network), this._p2wpkh = this._address.p2wpkh(this.network), this._legacy = this._address.p2pkh(this.network), this._segwitLegacy = this._address.p2shp2wpkh(this.network), this._p2wda = this._address.p2wda(this.network), this._tweakedKey = this._address.tweakedPublicKeyToBuffer();
@@ -2566,7 +2567,8 @@ var gr = (0, v.BIP32Factory)(K), Sr = class je {
     return mt.generateMnemonic(t);
   }
   static generate(t = ee.MAXIMUM, i = "", r = y.bitcoin, s = v.MLDSASecurityLevel.LEVEL2) {
-    return new je(mt.generateMnemonic(t), i, r, s);
+    const n = mt.generateMnemonic(t);
+    return new je(n, i, r, s);
   }
   static validate(t) {
     return mt.validateMnemonic(t);
@@ -3777,7 +3779,7 @@ var ke = new Uint8Array([
     await Promise.resolve();
     const t = new N({ network: this.network }), i = this.getInputs(), r = this.getOutputs();
     t.addInputs(i), t.addOutputs(r);
-    const s = new Uint8Array(64), n = new Uint8Array(72), o = new Uint8Array(33).fill(2), a = (h, p) => {
+    const s = /* @__PURE__ */ new Uint8Array(64), n = /* @__PURE__ */ new Uint8Array(72), o = (/* @__PURE__ */ new Uint8Array(33)).fill(2), a = (h, p) => {
       if (p.isPayToAnchor || this.anchorInputIndices.has(h)) return {
         finalScriptSig: void 0,
         finalScriptWitness: Uint8Array.from([0])
@@ -3786,8 +3788,8 @@ var ke = new Uint8Array([
       if (w) return { finalScriptWitness: R.witnessStackToScriptWitness(rt.buildDummyWitness(w)) };
       if (p.witnessScript && X.isP2WDAWitnessScript(p.witnessScript)) {
         const A = [];
-        for (let x = 0; x < 10; x++) A.push(new Uint8Array(0));
-        const k = new Uint8Array(72);
+        for (let x = 0; x < 10; x++) A.push(/* @__PURE__ */ new Uint8Array(0));
+        const k = /* @__PURE__ */ new Uint8Array(72);
         return { finalScriptWitness: R.witnessStackToScriptWitness([
           ...A,
           k,
@@ -3795,7 +3797,7 @@ var ke = new Uint8Array([
         ]) };
       }
       if (h === 0 && this.tapLeafScript) {
-        const A = new Uint8Array(32), k = this.tapLeafScript.script, x = this.useP2MR ? 33 : 65, yt = new Uint8Array(x);
+        const A = /* @__PURE__ */ new Uint8Array(32), k = this.tapLeafScript.script, x = this.useP2MR ? 33 : 65, yt = new Uint8Array(x);
         return { finalScriptWitness: R.witnessStackToScriptWitness([
           A,
           s,
@@ -3827,7 +3829,7 @@ var ke = new Uint8Array([
             const yt = k - d.OP_1 + 1, be = [];
             for (let Ee = 0; Ee < yt; Ee++) be.push(n);
             return { finalScriptWitness: R.witnessStackToScriptWitness([
-              new Uint8Array(0),
+              /* @__PURE__ */ new Uint8Array(0),
               ...be,
               p.witnessScript
             ]) };
@@ -4745,7 +4747,7 @@ var ke = new Uint8Array([
     const r = i.partialSig[0].signature, s = ht([r, this.compiledOperationData]), n = st.signMessage(this.signer, s).signature, o = ht([n, this.compiledOperationData]), a = Z.compress(o), c = this.splitIntoWitnessChunks(a);
     if (c.length > lt.MAX_WITNESS_FIELDS) throw new Error(`Compressed data needs ${c.length} witness fields, max is ${lt.MAX_WITNESS_FIELDS}`);
     const u = [r];
-    for (let l = 0; l < lt.MAX_WITNESS_FIELDS; l++) u.push(l < c.length ? c[l] : new Uint8Array(0));
+    for (let l = 0; l < lt.MAX_WITNESS_FIELDS; l++) u.push(l < c.length ? c[l] : /* @__PURE__ */ new Uint8Array(0));
     return u.push(i.witnessScript), {
       finalScriptSig: void 0,
       finalScriptWitness: B.witnessStackToScriptWitness(u)
@@ -4773,8 +4775,8 @@ var ke = new Uint8Array([
       gasSatFee: 1n,
       isCancellation: !0,
       priorityFee: 1n,
-      calldata: new Uint8Array(0)
-    }), this.contractSecret = new Uint8Array(0), e.compiledTargetScript instanceof Uint8Array ? this.compiledTargetScript = e.compiledTargetScript : this.compiledTargetScript = g(e.compiledTargetScript), this.scriptTree = this.getMinimalScriptTree(), this.internalInit();
+      calldata: /* @__PURE__ */ new Uint8Array(0)
+    }), this.contractSecret = /* @__PURE__ */ new Uint8Array(0), e.compiledTargetScript instanceof Uint8Array ? this.compiledTargetScript = e.compiledTargetScript : this.compiledTargetScript = g(e.compiledTargetScript), this.scriptTree = this.getMinimalScriptTree(), this.internalInit();
   }
   async buildTransaction() {
     if (!this.from) throw new Error("From address is required");
@@ -5043,7 +5045,7 @@ var ke = new Uint8Array([
   }
 }, ni = class {
   debug = !1;
-  DUMMY_PUBKEY = new Uint8Array(32).fill(1);
+  DUMMY_PUBKEY = (/* @__PURE__ */ new Uint8Array(32)).fill(1);
   P2TR_SCRIPT = Uint8Array.from([
     81,
     32,
@@ -5385,7 +5387,7 @@ var ke = new Uint8Array([
       const h = new Xt();
       h.addOutput(this.P2TR_SCRIPT, L(o));
       const p = {
-        transactionId: f(new Uint8Array(32)),
+        transactionId: f(/* @__PURE__ */ new Uint8Array(32)),
         outputIndex: 0,
         scriptPubKey: {
           hex: f(this.P2TR_SCRIPT),
@@ -5545,7 +5547,7 @@ var ke = new Uint8Array([
       for (const u of s) {
         let l = !1;
         for (const h of i.tapScriptSig) C(h.pubkey, O(u)) && (o.push(h.signature), l = !0);
-        l || o.push(new Uint8Array(0));
+        l || o.push(/* @__PURE__ */ new Uint8Array(0));
       }
       o = o.reverse();
     }
@@ -6369,11 +6371,17 @@ var wt = class {
   static sha1(e) {
     return D.sha1(e);
   }
-  static calculatePreimage(e, t, i) {
+  static calculatePreimage(e, t, i, r = !1) {
     if (e.length !== 32 || t.length !== 32 || i.length !== 32) throw new Error("All inputs must be 32 bytes");
-    const r = new Uint8Array(32);
-    for (let s = 0; s < 32; s++) r[s] = e[s] ^ t[s] ^ i[s];
-    return r;
+    if (r) return this.concatenatePreimage(e, t, i);
+    const s = /* @__PURE__ */ new Uint8Array(32);
+    for (let n = 0; n < 32; n++) s[n] = e[n] ^ t[n] ^ i[n];
+    return s;
+  }
+  static concatenatePreimage(e, t, i) {
+    if (e.length !== 32 || t.length !== 32 || i.length !== 32) throw new Error("All inputs must be 32 bytes");
+    const r = /* @__PURE__ */ new Uint8Array(96);
+    return r.set(e, 0), r.set(t, 32), r.set(i, 64), r;
   }
   static countMatchingBits(e, t) {
     let i = 0;
@@ -6387,43 +6395,43 @@ var wt = class {
     }
     return i;
   }
-  static verifySolution(e, t = !1) {
+  static verifySolution(e, t = !1, i = !1) {
     try {
-      const i = e.verification, r = this.calculatePreimage(i.targetChecksum, e.publicKey.toBuffer(), e.salt), s = this.sha1(r);
-      if (!C(s, e.solution) || this.countMatchingBits(s, i.targetHash) !== e.difficulty) return !1;
-      const n = e.epochNumber * this.BLOCKS_PER_EPOCH, o = n + this.BLOCKS_PER_EPOCH - 1n;
-      return !(i.startBlock !== n || i.endBlock !== o);
-    } catch (i) {
-      return t && console.error("Verification error:", i), !1;
+      const r = e.verification, s = this.calculatePreimage(r.targetChecksum, e.publicKey.toBuffer(), e.salt, i), n = this.sha1(s);
+      if (!C(n, e.solution) || this.countMatchingBits(n, r.targetHash) !== e.difficulty) return !1;
+      const o = e.epochNumber * this.BLOCKS_PER_EPOCH, a = o + this.BLOCKS_PER_EPOCH - 1n;
+      return !(r.startBlock !== o || r.endBlock !== a);
+    } catch (r) {
+      return t && console.error("Verification error:", r), !1;
     }
   }
   static getMiningTargetBlock(e) {
     return e === 0n ? null : e * this.BLOCKS_PER_EPOCH - 1n;
   }
-  static validateEpochWinner(e) {
+  static validateEpochWinner(e, t = !1) {
     try {
-      const t = BigInt(e.epochNumber), i = z.fromString(e.mldsaPublicKey, e.legacyPublicKey), r = M(e.solution), s = M(e.salt), n = e.difficulty, o = {
+      const i = BigInt(e.epochNumber), r = z.fromString(e.mldsaPublicKey, e.legacyPublicKey), s = M(e.solution), n = M(e.salt), o = e.difficulty, a = {
         epochHash: M(e.verification.epochHash),
         epochRoot: M(e.verification.epochRoot),
         targetHash: M(e.verification.targetHash),
         targetChecksum: M(e.verification.targetChecksum),
         startBlock: BigInt(e.verification.startBlock),
         endBlock: BigInt(e.verification.endBlock),
-        proofs: Object.freeze(e.verification.proofs.map((h) => M(h)))
-      }, a = this.calculatePreimage(o.targetChecksum, i.toBuffer(), s), c = this.sha1(a);
-      if (!C(c, r) || this.countMatchingBits(c, o.targetHash) !== n) return !1;
-      const u = t * this.BLOCKS_PER_EPOCH, l = u + this.BLOCKS_PER_EPOCH - 1n;
-      return !(o.startBlock !== u || o.endBlock !== l);
+        proofs: Object.freeze(e.verification.proofs.map((p) => M(p)))
+      }, c = this.calculatePreimage(a.targetChecksum, r.toBuffer(), n, t), u = this.sha1(c);
+      if (!C(u, s) || this.countMatchingBits(u, a.targetHash) !== o) return !1;
+      const l = i * this.BLOCKS_PER_EPOCH, h = l + this.BLOCKS_PER_EPOCH - 1n;
+      return !(a.startBlock !== l || a.endBlock !== h);
     } catch {
       return !1;
     }
   }
-  static validateChallengeSolution(e) {
-    return this.verifySolution(e);
+  static validateChallengeSolution(e, t = !1) {
+    return this.verifySolution(e, !1, t);
   }
-  static calculateSolution(e, t, i) {
-    const r = this.calculatePreimage(e, t, i);
-    return this.sha1(r);
+  static calculateSolution(e, t, i, r = !1) {
+    const s = this.calculatePreimage(e, t, i, r);
+    return this.sha1(s);
   }
   static checkDifficulty(e, t, i) {
     const r = this.countMatchingBits(e, t);
@@ -7764,7 +7772,7 @@ var zr = class extends we {
     return !0;
   }
   getBytes(t) {
-    return t instanceof ArrayBuffer ? new Uint8Array(t) : ArrayBuffer.isView(t) ? new Uint8Array(t.buffer, t.byteOffset, t.byteLength) : new Uint8Array(0);
+    return t instanceof ArrayBuffer ? new Uint8Array(t) : ArrayBuffer.isView(t) ? new Uint8Array(t.buffer, t.byteOffset, t.byteLength) : /* @__PURE__ */ new Uint8Array(0);
   }
   findIndex(t) {
     let i = this.hash(t);

package/browser/noble-curves.js

@@ -418,8 +418,8 @@ var St, Qt, Jt, Pt, bt, wt, _t, Ht, ze, Me, Ge, Ke, Xe, We, qn = dt((() => {
     process(t, e) {
       for (let f = 0; f < 16; f++, e += 4) st[f] = t.getUint32(e, !1);
       for (let f = 16; f < 64; f++) {
-        const g = st[f - 15], m = st[f - 2], w = nt(g, 7) ^ nt(g, 18) ^ g >>> 3;
-        st[f] = (nt(m, 17) ^ nt(m, 19) ^ m >>> 10) + st[f - 7] + w + st[f - 16] | 0;
+        const g = st[f - 15], m = st[f - 2], w = nt(g, 7) ^ nt(g, 18) ^ g >>> 3, A = nt(m, 17) ^ nt(m, 19) ^ m >>> 10;
+        st[f] = A + st[f - 7] + w + st[f - 16] | 0;
       }
       let { A: r, B: n, C: o, D: i, E: c, F: s, G: a, H: u } = this;
       for (let f = 0; f < 64; f++) {
@@ -571,8 +571,8 @@ var St, Qt, Jt, Pt, bt, wt, _t, Ht, ze, Me, Ge, Ke, Xe, We, qn = dt((() => {
       for (let x = 0; x < 16; x++, e += 4)
         ct[x] = t.getUint32(e), ft[x] = t.getUint32(e += 4);
       for (let x = 16; x < 80; x++) {
-        const q = ct[x - 15] | 0, Z = ft[x - 15] | 0, T = bt(q, Z, 1) ^ bt(q, Z, 8) ^ Jt(q, Z, 7), Q = wt(q, Z, 1) ^ wt(q, Z, 8) ^ Pt(q, Z, 7), $ = ct[x - 2] | 0, R = ft[x - 2] | 0, C = bt($, R, 19) ^ _t($, R, 61) ^ Jt($, R, 6), X = wt($, R, 19) ^ Ht($, R, 61) ^ Pt($, R, 6), F = Ge(Q, X, ft[x - 7], ft[x - 16]);
-        ct[x] = Ke(F, T, C, ct[x - 7], ct[x - 16]) | 0, ft[x] = F | 0;
+        const q = ct[x - 15] | 0, Z = ft[x - 15] | 0, T = bt(q, Z, 1) ^ bt(q, Z, 8) ^ Jt(q, Z, 7), Q = wt(q, Z, 1) ^ wt(q, Z, 8) ^ Pt(q, Z, 7), $ = ct[x - 2] | 0, R = ft[x - 2] | 0, C = bt($, R, 19) ^ _t($, R, 61) ^ Jt($, R, 6), X = wt($, R, 19) ^ Ht($, R, 61) ^ Pt($, R, 6), F = Ge(Q, X, ft[x - 7], ft[x - 16]), h = Ke(F, T, C, ct[x - 7], ct[x - 16]);
+        ct[x] = h | 0, ft[x] = F | 0;
       }
       let { Ah: r, Al: n, Bh: o, Bl: i, Ch: c, Cl: s, Dh: a, Dl: u, Eh: f, El: g, Fh: m, Fl: w, Gh: A, Gl: _, Hh: H, Hl: O } = this;
       for (let x = 0; x < 80; x++) {