@babylonlabs-io/ts-sdk 3.3.0 → 3.3.1

package/dist/{PeginManager-BJnUgW8C.js → PeginManager-CQ9bVPR3.js}

@@ -9,8 +9,8 @@ import { isAddressEqual as J } from "viem";
 import { c as Be, V as _e } from "./pegin-registration-client-Cvjk4ILq.js";
 import { pushTx as Ce, getUtxoInfo as Ae } from "./tbv/core/clients/mempool/index.js";
 import { expandWotsSeed as Ie, expandHashlockSecret as He, expandAuthAnchor as $e } from "./tbv/core/wasm/index.js";
-import { a as ee, b as Oe, i as te, j as Re } from "./verifyScriptPathSchnorrSignature-owu3BfyT.js";
-import { d as We, b as Fe, e as Ve, f as Me, c as Ke } from "./verifyKeyPathSchnorrSignature-IIj3Z2se.js";
+import { a as ee, b as Re, i as te, j as Oe } from "./verifyScriptPathSchnorrSignature-owu3BfyT.js";
+import { d as We, b as Fe, e as Ve, f as Ke, c as Me } from "./verifyKeyPathSchnorrSignature-IIj3Z2se.js";
 import { p as De, h as L, u as U, e as Ne, i as oe, s as x, k as se } from "./bitcoin-C-TuHb-v.js";
 import { c as Le } from "./signing-C1rR4tqs.js";
 import { M as ne, X as Ue } from "./validation-OSC0xTHB.js";
@@ -24,9 +24,9 @@ import { c as tt } from "./btcTxHash-BRZ8_EZq.js";
 import { p as ot } from "./parseFundingOutpoints-GSM-IaaK.js";
 import * as st from "@bitcoin-js/tiny-secp256k1-asmjs";
 import { v as nt, P as it, a as rt, b as at } from "./bip322Verify-BXYrHBh8.js";
-const O = /* @__PURE__ */ BigInt(2 ** 32 - 1), re = /* @__PURE__ */ BigInt(32);
+const R = /* @__PURE__ */ BigInt(2 ** 32 - 1), re = /* @__PURE__ */ BigInt(32);
 function ct(o, e = !1) {
-  return e ? { h: Number(o & O), l: Number(o >> re & O) } : { h: Number(o >> re & O) | 0, l: Number(o & O) | 0 };
+  return e ? { h: Number(o & R), l: Number(o >> re & R) } : { h: Number(o >> re & R) | 0, l: Number(o & R) | 0 };
 }
 function lt(o, e = !1) {
   const t = o.length;
@@ -79,13 +79,13 @@ function ft(o) {
     vaults: s
   };
 }
-const mt = /^0x[0-9a-f]+$/i, Pt = /^[0-9a-f]+$/i, bt = /^[A-Za-z0-9+/]+={0,2}$/;
+const mt = /^0x[0-9a-f]+$/i, Pt = /^[0-9a-f]+$/i, wt = /^[A-Za-z0-9+/]+={0,2}$/;
 function B(o) {
   if (typeof o != "string" || o.length === 0)
     throw new Error("BTC wallet returned empty public key");
   return De(o).toLowerCase();
 }
-function wt(o) {
+function bt(o) {
   if (typeof o != "string" || o.length === 0)
     throw new Error("BTC wallet returned empty BIP-322 signature");
   if (o.startsWith("0x") || o.startsWith("0X")) {
@@ -98,7 +98,7 @@ function wt(o) {
       throw new Error("BTC wallet returned malformed hex BIP-322 signature");
     return `0x${o.toLowerCase()}`;
   }
-  if (!bt.test(o) || o.length % 4 !== 0)
+  if (!wt.test(o) || o.length % 4 !== 0)
     throw new Error("BTC wallet returned malformed base64 BIP-322 signature");
   const e = _.from(o, "base64");
   if (e.length === 0 || e.toString("base64") !== o)
@@ -109,10 +109,10 @@ async function yt(o) {
   const { wallet: e, depositTerms: t, fundedPrePeginTxHex: s, depositorBtcPubkey: r } = o, n = typeof e.approveDepositTerms == "function" ? e.approveDepositTerms : void 0;
   if (!n && !t)
     return;
-  const i = s.startsWith("0x") ? s.slice(2) : s, c = ge.fromHex(i).getId();
-  if (t && t.prepeginTxid.replace(/^0x/, "").toLowerCase() !== c)
+  const i = s.startsWith("0x") ? s.slice(2) : s, l = ge.fromHex(i).getId();
+  if (t && t.prepeginTxid.replace(/^0x/, "").toLowerCase() !== l)
     throw new Error(
-      `Deposit terms do not match the transaction being broadcast: terms are for prepeginTxid ${t.prepeginTxid}, but this transaction is ${c}.`
+      `Deposit terms do not match the transaction being broadcast: terms are for prepeginTxid ${t.prepeginTxid}, but this transaction is ${l}.`
     );
   if (!n)
     return;
@@ -145,29 +145,29 @@ async function yt(o) {
     }
   )).fill(0), await n.call(e, t);
 }
-const xt = BigInt(0), A = BigInt(1), kt = BigInt(2), Tt = BigInt(7), vt = BigInt(256), Et = BigInt(113), me = [], Pe = [], be = [];
+const xt = BigInt(0), A = BigInt(1), kt = BigInt(2), Tt = BigInt(7), vt = BigInt(256), Et = BigInt(113), me = [], Pe = [], we = [];
 for (let o = 0, e = A, t = 1, s = 0; o < 24; o++) {
   [t, s] = [s, (2 * t + 3 * s) % 5], me.push(2 * (5 * s + t)), Pe.push((o + 1) * (o + 2) / 2 % 64);
   let r = xt;
   for (let n = 0; n < 7; n++)
     e = (e << A ^ (e >> Tt) * Et) % vt, e & kt && (r ^= A << (A << BigInt(n)) - A);
-  be.push(r);
+  we.push(r);
 }
-const we = lt(be, !0), St = we[0], Bt = we[1], ae = (o, e, t) => t > 32 ? pt(o, e, t) : ut(o, e, t), ce = (o, e, t) => t > 32 ? dt(o, e, t) : ht(o, e, t);
+const be = lt(we, !0), St = be[0], Bt = be[1], ae = (o, e, t) => t > 32 ? pt(o, e, t) : ut(o, e, t), ce = (o, e, t) => t > 32 ? dt(o, e, t) : ht(o, e, t);
 function _t(o, e = 24) {
   const t = new Uint32Array(10);
   for (let s = 24 - e; s < 24; s++) {
     for (let i = 0; i < 10; i++)
       t[i] = o[i] ^ o[i + 10] ^ o[i + 20] ^ o[i + 30] ^ o[i + 40];
     for (let i = 0; i < 10; i += 2) {
-      const a = (i + 8) % 10, c = (i + 2) % 10, h = t[c], p = t[c + 1], f = ae(h, p, 1) ^ t[a], y = ce(h, p, 1) ^ t[a + 1];
-      for (let b = 0; b < 50; b += 10)
-        o[i + b] ^= f, o[i + b + 1] ^= y;
+      const a = (i + 8) % 10, l = (i + 2) % 10, h = t[l], p = t[l + 1], f = ae(h, p, 1) ^ t[a], y = ce(h, p, 1) ^ t[a + 1];
+      for (let w = 0; w < 50; w += 10)
+        o[i + w] ^= f, o[i + w + 1] ^= y;
     }
     let r = o[2], n = o[3];
     for (let i = 0; i < 24; i++) {
-      const a = Pe[i], c = ae(r, n, a), h = ce(r, n, a), p = me[i];
-      r = o[p], n = o[p + 1], o[p] = c, o[p + 1] = h;
+      const a = Pe[i], l = ae(r, n, a), h = ce(r, n, a), p = me[i];
+      r = o[p], n = o[p + 1], o[p] = l, o[p + 1] = h;
     }
     for (let i = 0; i < 50; i += 10) {
       for (let a = 0; a < 10; a++)
@@ -255,21 +255,21 @@ class z {
     return e || (e = new z(t, s, r, i, n)), e.state32.set(this.state32), e.pos = this.pos, e.posOut = this.posOut, e.finished = this.finished, e.rounds = n, e.suffix = s, e.outputLen = r, e.enableXOF = i, e.destroyed = this.destroyed, e;
   }
 }
-const Ct = (o, e, t, s = {}) => ve(() => new z(e, o, t), s), At = /* @__PURE__ */ Ct(1, 136, 32), le = 64, w = 20, X = 4, ye = 2, It = 0, Ht = 1, R = [64, 64], $t = (o) => Array.from(o).map((e) => e.toString(16).padStart(2, "0")).join("");
+const Ct = (o, e, t, s = {}) => ve(() => new z(e, o, t), s), At = /* @__PURE__ */ Ct(1, 136, 32), le = 64, b = 20, X = 4, ye = 2, It = 0, Ht = 1, O = [64, 64], $t = (o) => Array.from(o).map((e) => e.toString(16).padStart(2, "0")).join("");
 function G(o) {
   return je(pe(o));
 }
 function xe(o) {
   return (1 << o) - 1;
 }
-function Ot(o) {
+function Rt(o) {
   let e = 1;
   for (; e * e < o + 1; ) e++;
   return Math.max(e, 2);
 }
-function Rt(o) {
+function Ot(o) {
   const e = X, t = o * xe(e);
-  return { d: e, n: o, checksum_radix: Ot(t) };
+  return { d: e, n: o, checksum_radix: Rt(t) };
 }
 function V(o, e) {
   const t = [];
@@ -282,7 +282,7 @@ function V(o, e) {
     r[o.length + n] = t[n];
   return G(r);
 }
-function M(o, e) {
+function K(o, e) {
   let t = o;
   for (let s = 0; s < e; s++)
     t = G(t);
@@ -291,20 +291,20 @@ function M(o, e) {
 function Wt(o, e) {
   const t = xe(e.d), s = e.checksum_radix - 1, r = Math.floor(e.n * t / e.checksum_radix), n = [];
   for (let p = 0; p < e.n; p++) {
-    const f = V(o, p + ye), y = M(f, t);
+    const f = V(o, p + ye), y = K(f, t);
     n.push(Array.from(y));
   }
   const i = V(
     o,
     It
-  ), a = M(
+  ), a = K(
     i,
     s
-  ), c = V(
+  ), l = V(
     o,
     Ht
-  ), h = M(
-    c,
+  ), h = K(
+    l,
     r
   );
   return {
@@ -321,8 +321,8 @@ async function Ft(o) {
         `WOTS seed must be exactly ${le} bytes, got ${o.length}`
       );
     const e = [];
-    for (let t = 0; t < R.length; t++) {
-      const s = R[t], r = Rt(s), n = new Uint8Array(o.length + 1);
+    for (let t = 0; t < O.length; t++) {
+      const s = O[t], r = Ot(s), n = new Uint8Array(o.length + 1);
       n.set(o), n[o.length] = t;
       const i = G(n);
       try {
@@ -339,37 +339,37 @@ async function Ft(o) {
           throw new Error(
             `Block ${t}: expected ${s} message terminals, got ${a.message_terminals.length}`
           );
-        for (let c = 0; c < a.message_terminals.length; c++)
-          if (a.message_terminals[c].length !== w)
+        for (let l = 0; l < a.message_terminals.length; l++)
+          if (a.message_terminals[l].length !== b)
             throw new Error(
-              `Block ${t} terminal ${c}: expected ${w} bytes, got ${a.message_terminals[c].length}`
+              `Block ${t} terminal ${l}: expected ${b} bytes, got ${a.message_terminals[l].length}`
             );
-        if (a.checksum_minor_terminal.length !== w)
+        if (a.checksum_minor_terminal.length !== b)
           throw new Error(
-            `Block ${t} checksum_minor: expected ${w} bytes`
+            `Block ${t} checksum_minor: expected ${b} bytes`
           );
-        if (a.checksum_major_terminal.length !== w)
+        if (a.checksum_major_terminal.length !== b)
           throw new Error(
-            `Block ${t} checksum_major: expected ${w} bytes`
+            `Block ${t} checksum_major: expected ${b} bytes`
           );
         e.push(a);
       } finally {
         n.fill(0), i.fill(0);
       }
     }
-    if (e.length !== R.length)
+    if (e.length !== O.length)
       throw new Error(
-        `Expected ${R.length} blocks, got ${e.length}`
+        `Expected ${O.length} blocks, got ${e.length}`
       );
     return e;
   } finally {
     o.fill(0);
   }
 }
-function K(o, e, t) {
-  if (o.length !== w)
+function M(o, e, t) {
+  if (o.length !== b)
     throw new Error(
-      `Block ${e} ${t}: expected ${w} bytes, got ${o.length}`
+      `Block ${e} ${t}: expected ${b} bytes, got ${o.length}`
     );
   for (let s = 0; s < o.length; s++) {
     const r = o[s];
@@ -384,24 +384,24 @@ function Vt(o) {
     throw new Error("Public keys array must not be empty");
   for (let n = 0; n < o.length; n++) {
     const i = o[n];
-    K(i.checksum_minor_terminal, n, "checksum_minor_terminal"), K(i.checksum_major_terminal, n, "checksum_major_terminal");
+    M(i.checksum_minor_terminal, n, "checksum_minor_terminal"), M(i.checksum_major_terminal, n, "checksum_major_terminal");
     for (let a = 0; a < i.message_terminals.length; a++)
-      K(i.message_terminals[a], n, `message_terminal[${a}]`);
+      M(i.message_terminals[a], n, `message_terminal[${a}]`);
   }
   let e = 0;
   for (const n of o)
     e += ye + n.message_terminals.length;
-  const t = new Uint8Array(e * w);
+  const t = new Uint8Array(e * b);
   let s = 0;
   for (const n of o) {
-    t.set(n.checksum_minor_terminal, s), s += w, t.set(n.checksum_major_terminal, s), s += w;
+    t.set(n.checksum_minor_terminal, s), s += b, t.set(n.checksum_major_terminal, s), s += b;
     for (const i of n.message_terminals)
-      t.set(i, s), s += w;
+      t.set(i, s), s += b;
   }
   const r = At(t);
   return `0x${$t(r)}`;
 }
-async function Mt(o, e) {
+async function Kt(o, e) {
   const t = [], s = [], r = [], n = [];
   try {
     for (let i = 0; i < e; i++) {
@@ -412,12 +412,12 @@ async function Mt(o, e) {
       } finally {
         a.fill(0);
       }
-      const c = await He(o, i);
+      const l = await He(o, i);
       try {
-        const h = U(c);
+        const h = U(l);
         r.push(h), n.push(Xe(Ne(h)).slice(2));
       } finally {
-        c.fill(0);
+        l.fill(0);
       }
     }
   } finally {
@@ -425,7 +425,7 @@ async function Mt(o, e) {
   }
   return { perVaultWotsKeys: t, wotsPkHashes: s, htlcSecretHexes: r, hashlocks: n };
 }
-const Kt = 1, Dt = 2, Nt = 33, Lt = 2, Ut = 3, Xt = 1, W = 64, zt = 0, D = 1, ue = /^[0-9a-f]{64}$/i, Gt = /^(?:[0-9a-f]{2})+$/;
+const Mt = 1, Dt = 2, Nt = 33, Lt = 2, Ut = 3, Xt = 1, W = 64, zt = 0, D = 1, ue = /^[0-9a-f]{64}$/i, Gt = /^(?:[0-9a-f]{2})+$/;
 function qt(o) {
   const e = o.slice(2);
   if (!Gt.test(e))
@@ -440,7 +440,7 @@ function qt(o) {
 function jt(o, e, t) {
   var r;
   const s = qt(t);
-  if (s.length === Kt) {
+  if (s.length === Mt) {
     const [n] = s;
     let i, a;
     if (n.length === W)
@@ -455,8 +455,8 @@ function jt(o, e, t) {
       throw new Error(
         `depositor public key must be bare 64-char x-only hex, got "${e}"`
       );
-    const c = Uint8Array.from(_.from(e, "hex"));
-    if (!nt(o, c, i, a))
+    const l = Uint8Array.from(_.from(e, "hex"));
+    if (!nt(o, l, i, a))
       throw new Error(
         "proof of possession signature does not verify against the depositor key"
       );
@@ -542,7 +542,8 @@ class ko {
    * split). Returns broadcast-ready txs, the pubkey snapshot, and the
    * sensitive derived material.
    *
-   * @throws If the wallet rejects, insufficient funds, or an internal
+   * @throws If the wallet rejects, the BTC wallet account changes during
+   *         vault-root derivation, insufficient funds, or an internal
    *         invariant violation.
    */
   async preparePegin(e) {
@@ -550,10 +551,10 @@ class ko {
       throw new Error("amounts must contain at least one entry");
     const t = await this.config.btcWallet.getPublicKeyHex(), s = B(t);
     if (C(this.config.btcWallet)) {
-      const l = (await ze(this.config.btcWallet)).trim();
-      if (e.changeAddress.trim() !== l)
+      const c = (await ze(this.config.btcWallet)).trim();
+      if (e.changeAddress.trim() !== c)
         throw new Error(
-          `Pre-PegIn changeAddress "${e.changeAddress}" is not the approval wallet's change address ("${l}"). Refusing to build a tx the signing device would reject.`
+          `Pre-PegIn changeAddress "${e.changeAddress}" is not the approval wallet's change address ("${c}"). Refusing to build a tx the signing device would reject.`
         );
     } else if (!oe(
       e.changeAddress,
@@ -565,8 +566,8 @@ class ko {
       );
     const r = await this.prepareSizing(s, e);
     if (C(this.config.btcWallet)) {
-      const { validateDepositTerms: l } = this.config.btcWallet;
-      typeof l == "function" && await l.call(
+      const { validateDepositTerms: c } = this.config.btcWallet;
+      typeof c == "function" && await c.call(
         this.config.btcWallet,
         this.buildPeginDepositTerms({
           params: e,
@@ -578,42 +579,52 @@ class ko {
       );
     }
     const n = r.selectedUTXOs.map(
-      (l) => ({
-        txid: L(l.txid),
-        vout: l.vout
+      (c) => ({
+        txid: L(c.txid),
+        vout: c.vout
       })
     ), i = await fe(this.config.btcWallet, {
       depositorBtcPubkey: L(s),
       fundingOutpoints: n
     });
-    let a, c;
     try {
-      const l = await $e(i);
+      if (B(
+        await this.config.btcWallet.getPublicKeyHex()
+      ) !== s)
+        throw new Error(
+          "BTC wallet account changed during vault secret derivation. The wallet no longer reports the account this deposit started with, so the derived secrets cannot be used. Restart the deposit with the original account."
+        );
+    } catch (c) {
+      throw i.fill(0), c;
+    }
+    let a, l;
+    try {
+      const c = await $e(i);
       try {
-        a = U(l), c = U(pe(l));
+        a = U(c), l = U(pe(c));
       } finally {
-        l.fill(0);
+        c.fill(0);
       }
-    } catch (l) {
-      throw i.fill(0), l;
+    } catch (c) {
+      throw i.fill(0), c;
     }
-    const h = await Mt(i, e.amounts.length), { perVaultWotsKeys: p, wotsPkHashes: f, htlcSecretHexes: y, hashlocks: b } = h, g = await this.preparePeginCommit({
+    const h = await Kt(i, e.amounts.length), { perVaultWotsKeys: p, wotsPkHashes: f, htlcSecretHexes: y, hashlocks: w } = h, g = await this.preparePeginCommit({
       depositorBtcPubkeyRaw: t,
       depositorBtcPubkey: s,
-      hashlocks: b,
-      authAnchorHash: c,
+      hashlocks: w,
+      authAnchorHash: l,
       sizing: r,
       params: e
     });
-    for (let l = 0; l < g.perVault.length; l++)
-      if (g.perVault[l].htlcVout !== l)
+    for (let c = 0; c < g.perVault.length; c++)
+      if (g.perVault[c].htlcVout !== c)
         throw new Error(
-          `Internal invariant violation: htlcVout/index mismatch at vault ${l} (expected ${l}, got ${g.perVault[l].htlcVout})`
+          `Internal invariant violation: htlcVout/index mismatch at vault ${c} (expected ${c}, got ${g.perVault[c].htlcVout})`
         );
     Ge(
       g.fundedPrePeginTxHex,
       e.amounts.length,
-      c
+      l
     );
     const { depositTerms: v, ...k } = g;
     return {
@@ -717,19 +728,19 @@ class ko {
       authAnchorHash: n,
       sizing: i,
       params: a
-    } = e, c = N.toLowerCase();
+    } = e, l = N.toLowerCase();
     for (let u = 0; u < r.length; u++)
-      if (r[u].toLowerCase() === c)
+      if (r[u].toLowerCase() === l)
         throw new Error(
           `preparePeginCommit refusing to build with sizing-pass placeholder hashlock at vault ${u} — internal substitution bug`
         );
-    if (n.toLowerCase() === c)
+    if (n.toLowerCase() === l)
       throw new Error(
         "preparePeginCommit refusing to build with sizing-pass placeholder auth-anchor hash — internal substitution bug"
       );
     const h = x(
       a.vaultProviderBtcPubkey
-    ), p = a.vaultKeeperBtcPubkeys.map(x), f = a.universalChallengerBtcPubkeys.map(x), y = p.length, b = {
+    ), p = a.vaultKeeperBtcPubkeys.map(x), f = a.universalChallengerBtcPubkeys.map(x), y = p.length, w = {
       vaultCoreVersion: a.vaultCoreVersion,
       depositorPubkey: s,
       vaultProviderPubkey: h,
@@ -745,7 +756,7 @@ class ko {
       councilSize: a.councilSize,
       network: this.config.btcNetwork,
       authAnchorHash: n
-    }, g = await ee(b);
+    }, g = await ee(w);
     if (g.depositorClaimValue !== i.depositorClaimValue || g.minPeginFee !== i.minPeginFee)
       throw new Error(
         `Pre-PegIn sizing/commit divergence: depositorClaimValue ${i.depositorClaimValue} -> ${g.depositorClaimValue}, minPeginFee ${i.minPeginFee} -> ${g.minPeginFee}. The provisional deposit terms validated before derivation would not match the terms sent for approval; refusing to continue.`
@@ -756,17 +767,17 @@ class ko {
       changeAddress: a.changeAddress,
       changeAmount: i.changeAmount,
       network: v
-    }), l = i.selectedUTXOs.reduce((u, S) => u + BigInt(S.value), 0n) - g.totalOutputValue - i.changeAmount;
-    if (l !== i.fee)
+    }), c = i.selectedUTXOs.reduce((u, S) => u + BigInt(S.value), 0n) - g.totalOutputValue - i.changeAmount;
+    if (c !== i.fee)
       throw new Error(
-        `Pre-PegIn funded fee ${l} does not match the sizing-pass fee ${i.fee}; refusing to publish a deposit-terms fee bound the funded transaction does not pay.`
+        `Pre-PegIn funded fee ${c} does not match the sizing-pass fee ${i.fee}; refusing to publish a deposit-terms fee bound the funded transaction does not pay.`
       );
     const I = x(
       tt(k)
     ), H = [], d = [], m = [];
     for (let u = 0; u < r.length; u++) {
-      const S = await Oe({
-        prePeginParams: b,
+      const S = await Re({
+        prePeginParams: w,
         timelockPegin: a.timelockPegin,
         fundedPrePeginTxHex: k,
         htlcVout: u
@@ -808,13 +819,13 @@ class ko {
         E[u],
         s
       );
-      Re({
+      Oe({
         requestedPsbtHex: d[u],
         signatureHex: S,
         signerXOnlyPubkeyHex: s,
         inputIndex: 0
       });
-      const F = Me(E[u]);
+      const F = Ke(E[u]);
       $.push({
         htlcVout: u,
         htlcValue: g.htlcValues[u],
@@ -863,9 +874,9 @@ class ko {
     const a = _.from(
       B(s),
       "hex"
-    ), c = this.config.mempoolApiUrl, h = n.ins.map((d) => {
+    ), l = this.config.mempoolApiUrl, h = n.ins.map((d) => {
       const m = _.from(d.hash).reverse().toString("hex"), T = d.index;
-      return Zt(m, T, e.localPrevouts, c).then(
+      return Zt(m, T, e.localPrevouts, l).then(
         (E) => ({ input: d, utxoData: E, txid: m, vout: T })
       );
     }), p = await Promise.all(h), f = p.reduce(
@@ -879,10 +890,10 @@ class ko {
       throw new Error(
         `UTXO value mismatch: total input value (${f} sat) is less than total output value (${y} sat). This may indicate the mempool API returned manipulated UTXO data.`
       );
-    const b = f - y;
-    if (b > ne)
+    const w = f - y;
+    if (w > ne)
       throw new Error(
-        `Implied transaction fee (${b} sat) exceeds maximum reasonable fee (${ne} sat). This may indicate manipulated UTXO data.`
+        `Implied transaction fee (${w} sat) exceeds maximum reasonable fee (${ne} sat). This may indicate manipulated UTXO data.`
       );
     for (const { input: d, utxoData: m, txid: T, vout: E } of p) {
       const $ = Qe(
@@ -915,7 +926,7 @@ class ko {
       requestedPsbtHex: g,
       returnedPsbtHex: v
     });
-    const k = Ke({
+    const k = Me({
       requestedPsbtHex: g,
       returnedPsbtHex: v
     });
@@ -923,19 +934,19 @@ class ko {
       throw new Error(
         `Key-path verification covered ${k} of ${i.data.inputs.length} Pre-PegIn inputs; an approval wallet signs every input key-path, so the unverified ones must not be broadcast.`
       );
-    const l = Z.fromHex(v);
+    const c = Z.fromHex(v);
     try {
-      l.finalizeAllInputs();
+      c.finalizeAllInputs();
     } catch (d) {
-      if (!l.data.inputs.every(
+      if (!c.data.inputs.every(
         (T) => T.finalScriptWitness || T.finalScriptSig
       ))
         throw new Error(
           `PSBT finalization failed and wallet did not auto-finalize: ${d}`
         );
     }
-    const I = l.extractTransaction().toHex();
-    return await Ce(I, c);
+    const I = c.extractTransaction().toHex();
+    return await Ce(I, l);
   }
   /**
    * Registers a peg-in on Ethereum by calling the BTCVaultRegistry contract.
@@ -1109,7 +1120,7 @@ class ko {
     ), s = this.config.vaultContracts.btcVaultRegistry, r = `${e.toLowerCase()}:${this.config.ethChain.id}:pegin:${s.toLowerCase()}`, n = await this.config.btcWallet.signMessage(
       r,
       "bip322-simple"
-    ), i = wt(n);
+    ), i = bt(n);
     return jt(
       new TextEncoder().encode(r),
       t,
@@ -1151,10 +1162,10 @@ class ko {
 }
 export {
   ko as P,
-  Mt as a,
+  Kt as a,
   ft as b,
   Vt as c,
   Ft as d,
   yt as e
 };
-//# sourceMappingURL=PeginManager-BJnUgW8C.js.map
+//# sourceMappingURL=PeginManager-CQ9bVPR3.js.map