@babylonlabs-io/ts-sdk 0.27.0 → 0.28.0

package/dist/{context-CClNOyD3.js → deriveVaultRoot-DAMZDqg-.js}

@@ -1,20 +1,21 @@
-var te = Object.defineProperty;
-var ee = (e, t, n) => t in e ? te(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
-var b = (e, t, n) => ee(e, typeof t != "symbol" ? t + "" : t, n);
-import * as ne from "bitcoinjs-lib";
-import { Transaction as se, Psbt as yt } from "bitcoinjs-lib";
-import { Buffer as it } from "buffer";
-import { isAddressEqual as bt, createPublicClient as q, http as Z, encodeFunctionData as xt, zeroAddress as oe } from "viem";
-import { c as re } from "./signing-BZigafm0.js";
-import { deriveVaultId as Pt } from "@babylonlabs-io/babylon-tbv-rust-wasm";
-import { b as ie, a as ae, d as ce, e as le, f as ue } from "./challengeAssert-j2Vwqo0-.js";
-import { s as v, g as kt, e as I, i as he, p as de } from "./bitcoin-B-Y0DlqR.js";
-import { M as Et } from "./validation-CxqROCno.js";
-import { b as fe, f as G, i as ge } from "./psbtInputFields-C3dqKWjQ.js";
-import { p as pe, f as me } from "./fundPeginTransaction-oV-dNJOU.js";
-import { p as we, f as ye } from "./vault-registry-reader-CpCOte7w.js";
-import { B as O, e as ht, f as U, g as S, h as V, i as Ut, H as be, r as F, j as xe, k as C, u as Pe, l as Tt, m as ke, n as Ee, o as Te, p as Ie, q as _e, t as ve, v as Be, w as It, x as Wt, s as W } from "./sha2-ZzfZqQSw.js";
-const H = {
+var zt = Object.defineProperty;
+var Yt = (e, t, n) => t in e ? zt(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
+var p = (e, t, n) => Yt(e, typeof t != "symbol" ? t + "" : t, n);
+import * as Jt from "bitcoinjs-lib";
+import { Transaction as Qt, Psbt as dt } from "bitcoinjs-lib";
+import { Buffer as et } from "buffer";
+import { isAddressEqual as ft, createPublicClient as j, http as q, encodeFunctionData as gt, zeroAddress as te } from "viem";
+import { c as ee } from "./signing-BZigafm0.js";
+import { deriveVaultId as pt } from "@babylonlabs-io/babylon-tbv-rust-wasm";
+import { b as ne, a as se, d as oe, e as re, f as ie } from "./challengeAssert-j2Vwqo0-.js";
+import { s as v, g as mt, e as _, i as ae, p as ce, u as le, h as he } from "./bitcoin-B-Y0DlqR.js";
+import { M as bt } from "./validation-CxqROCno.js";
+import { b as ue, f as G, i as de } from "./psbtInputFields-DeTFSJOq.js";
+import { p as fe, f as ge } from "./fundPeginTransaction-oV-dNJOU.js";
+import { p as pe, f as me } from "./vault-registry-reader-CshEgmS0.js";
+import { B as S } from "./types-CQ86O7NX.js";
+import { c as St, H as be, r as W, a as H, b as nt, u as we, d as wt, e as F, f as U, g as ye, s as L, h as Ot } from "./sha2-CPdTLk1u.js";
+const C = {
   // VaultAlreadyExists()
   "0x04aabf33": "Vault already exists: This Bitcoin transaction has already been registered. Please select different UTXOs or use a different amount to create a unique transaction.",
   // ScriptPubKeyMismatch() - taproot output doesn't match expected script
@@ -48,7 +49,7 @@ const H = {
   // PeginTransactionAlreadyUsed()
   "0x7ed061c9": "This pegin transaction has already been used to activate another vault."
 };
-function dt(e) {
+function it(e) {
   if (!e || typeof e != "object") return;
   const t = e;
   if (typeof t.data == "string" && t.data.startsWith("0x"))
@@ -67,24 +68,24 @@ function dt(e) {
   if (i)
     return i[1];
 }
-function Fn(e) {
-  const t = dt(e);
+function An(e) {
+  const t = it(e);
   if (t) {
     const n = t.substring(0, 10);
-    return H[t] ?? H[n];
+    return C[t] ?? C[n];
   }
 }
-function Mn(e) {
-  const t = dt(e);
+function Hn(e) {
+  const t = it(e);
   if (t === void 0) return !1;
   const n = t.substring(0, 10);
-  return t in H || n in H;
+  return t in C || n in C;
 }
 function A(e) {
   console.error("[Contract Error] Raw error:", e);
-  const t = dt(e);
+  const t = it(e);
   if (console.error("[Contract Error] Extracted error data:", t), t) {
-    const s = t.substring(0, 10), o = H[t] ?? H[s];
+    const s = t.substring(0, 10), o = C[t] ?? C[s];
     if (o)
       throw console.error("[Contract Error] Known error:", o), new Error(o);
   }
@@ -102,50 +103,50 @@ function A(e) {
   }
   throw e instanceof Error ? (console.error("[Contract Error] Unhandled error:", e.message), e) : new Error(`Contract call failed: ${String(e)}`);
 }
-const Se = 0, Ae = /^0x[0-9a-f]+$/i, Ce = /^[0-9a-f]+$/i, He = /^[A-Za-z0-9+/]+={0,2}$/;
-function $(e) {
+const xe = 0, Pe = /^0x[0-9a-f]+$/i, Ee = /^[0-9a-f]+$/i, Te = /^[A-Za-z0-9+/]+={0,2}$/;
+function O(e) {
   if (typeof e != "string" || e.length === 0)
     throw new Error("BTC wallet returned empty public key");
-  return de(e).toLowerCase();
+  return ce(e).toLowerCase();
 }
-function Oe(e) {
+function ke(e) {
   if (typeof e != "string" || e.length === 0)
     throw new Error("BTC wallet returned empty BIP-322 signature");
   if (e.startsWith("0x") || e.startsWith("0X")) {
-    if (!Ae.test(e) || e.length < 4 || e.length % 2 !== 0)
+    if (!Pe.test(e) || e.length < 4 || e.length % 2 !== 0)
       throw new Error("BTC wallet returned malformed hex BIP-322 signature");
     return e.toLowerCase();
   }
-  if (Ce.test(e)) {
+  if (Ee.test(e)) {
     if (e.length % 2 !== 0)
       throw new Error("BTC wallet returned malformed hex BIP-322 signature");
     return `0x${e.toLowerCase()}`;
   }
-  if (!He.test(e) || e.length % 4 !== 0)
+  if (!Te.test(e) || e.length % 4 !== 0)
     throw new Error("BTC wallet returned malformed base64 BIP-322 signature");
-  const t = it.from(e, "base64");
+  const t = et.from(e, "base64");
   if (t.length === 0 || t.toString("base64") !== e)
     throw new Error("BTC wallet returned malformed base64 BIP-322 signature");
   return `0x${t.toString("hex")}`;
 }
-function $e(e, t, n, s) {
+function _e(e, t, n, s) {
   const o = n == null ? void 0 : n[`${e}:${t}`];
   return o ? Promise.resolve({
     txid: e,
     vout: t,
     value: o.value,
     scriptPubKey: o.scriptPubKey
-  }) : ye(e, t, s);
+  }) : me(e, t, s);
 }
-const _t = 12e4;
-class Nn {
+const yt = 12e4;
+class Cn {
   /**
    * Creates a new PeginManager instance.
    *
    * @param config - Manager configuration including wallets and contract addresses
    */
   constructor(t) {
-    b(this, "config");
+    p(this, "config");
     this.config = t;
   }
   /**
@@ -169,14 +170,14 @@ class Nn {
    * @throws Error if wallet operations fail or insufficient funds
    */
   async preparePegin(t) {
-    const n = await this.config.btcWallet.getPublicKeyHex(), s = $(n), o = v(t.vaultProviderBtcPubkey), r = t.vaultKeeperBtcPubkeys.map(v), i = t.universalChallengerBtcPubkeys.map(v);
+    const n = await this.config.btcWallet.getPublicKeyHex(), s = O(n), o = v(t.vaultProviderBtcPubkey), r = t.vaultKeeperBtcPubkeys.map(v), i = t.universalChallengerBtcPubkeys.map(v);
     if (t.hashlocks.length !== t.amounts.length)
       throw new Error(
         `hashlocks.length (${t.hashlocks.length}) must equal amounts.length (${t.amounts.length})`
       );
     if (t.hashlocks.length === 0)
       throw new Error("hashlocks must contain at least one entry");
-    const a = r.length, h = {
+    const a = r.length, l = {
       depositorPubkey: s,
       vaultProviderPubkey: o,
       vaultKeeperPubkeys: r,
@@ -189,64 +190,64 @@ class Nn {
       councilQuorum: t.councilQuorum,
       councilSize: t.councilSize,
       network: this.config.btcNetwork
-    }, u = await ie(h), c = fe(
+    }, h = await ne(l), c = ue(
       [...t.availableUTXOs],
-      u.totalOutputValue,
+      h.totalOutputValue,
       t.mempoolFeeRate,
-      pe(
-        u.htlcValues.length,
-        h.authAnchorHash
+      fe(
+        h.htlcValues.length,
+        l.authAnchorHash
       )
-    ), m = kt(this.config.btcNetwork), l = me({
-      unfundedTxHex: u.psbtHex,
+    ), b = mt(this.config.btcNetwork), m = ge({
+      unfundedTxHex: h.psbtHex,
       selectedUTXOs: c.selectedUTXOs,
       changeAddress: t.changeAddress,
       changeAmount: c.changeAmount,
-      network: m
-    }), y = v(G(l)), f = [], x = [], P = [];
-    for (let g = 0; g < t.hashlocks.length; g++) {
-      const p = await ae({
-        prePeginParams: h,
+      network: b
+    }), w = v(G(m)), g = [], E = [], P = [];
+    for (let u = 0; u < t.hashlocks.length; u++) {
+      const d = await se({
+        prePeginParams: l,
         timelockPegin: t.timelockPegin,
-        fundedPrePeginTxHex: l,
-        htlcVout: g
-      }), E = await ce({
-        peginTxHex: p.txHex,
-        fundedPrePeginTxHex: l,
+        fundedPrePeginTxHex: m,
+        htlcVout: u
+      }), x = await oe({
+        peginTxHex: d.txHex,
+        fundedPrePeginTxHex: m,
         depositorPubkey: s,
         vaultProviderPubkey: o,
         vaultKeeperPubkeys: r,
         universalChallengerPubkeys: i,
-        hashlock: t.hashlocks[g],
+        hashlock: t.hashlocks[u],
         timelockRefund: t.timelockRefund,
         network: this.config.btcNetwork
       });
-      f.push(p), x.push(E.psbtHex), P.push(
-        re(n, 1)
+      g.push(d), E.push(x.psbtHex), P.push(
+        ee(n, 1)
       );
     }
-    const w = await this.signPsbtsWithFallback(
-      x,
+    const k = await this.signPsbtsWithFallback(
+      E,
       P
-    ), d = [];
-    for (let g = 0; g < w.length; g++) {
-      const p = le(
-        w[g],
+    ), f = [];
+    for (let u = 0; u < k.length; u++) {
+      const d = re(
+        k[u],
         s
-      ), E = ue(w[g]);
-      d.push({
-        htlcVout: g,
-        htlcValue: u.htlcValues[g],
-        peginTxHex: E,
-        peginTxid: f[g].txid,
-        peginInputSignature: p,
-        vaultScriptPubKey: f[g].vaultScriptPubKey
+      ), x = ie(k[u]);
+      f.push({
+        htlcVout: u,
+        htlcValue: h.htlcValues[u],
+        peginTxHex: x,
+        peginTxid: g[u].txid,
+        peginInputSignature: d,
+        vaultScriptPubKey: g[u].vaultScriptPubKey
       });
     }
     return {
-      fundedPrePeginTxHex: l,
-      prePeginTxid: y,
-      perVault: d,
+      fundedPrePeginTxHex: m,
+      prePeginTxid: w,
+      perVault: f,
       selectedUTXOs: c.selectedUTXOs,
       fee: c.fee,
       changeAmount: c.changeAmount
@@ -297,68 +298,68 @@ class Nn {
    * @throws Error if signing or broadcasting fails
    */
   async signAndBroadcast(t) {
-    const { fundedPrePeginTxHex: n, depositorBtcPubkey: s } = t, o = n.startsWith("0x") ? n.slice(2) : n, r = se.fromHex(o);
+    const { fundedPrePeginTxHex: n, depositorBtcPubkey: s } = t, o = n.startsWith("0x") ? n.slice(2) : n, r = Qt.fromHex(o);
     if (r.ins.length === 0)
       throw new Error("Transaction has no inputs");
-    const i = new yt();
+    const i = new dt();
     i.setVersion(r.version), i.setLocktime(r.locktime);
-    const a = it.from(
-      $(s),
+    const a = et.from(
+      O(s),
       "hex"
-    ), h = this.config.mempoolApiUrl, u = r.ins.map((d) => {
-      const g = it.from(d.hash).reverse().toString("hex"), p = d.index;
-      return $e(g, p, t.localPrevouts, h).then(
-        (E) => ({ input: d, utxoData: E, txid: g, vout: p })
+    ), l = this.config.mempoolApiUrl, h = r.ins.map((f) => {
+      const u = et.from(f.hash).reverse().toString("hex"), d = f.index;
+      return _e(u, d, t.localPrevouts, l).then(
+        (x) => ({ input: f, utxoData: x, txid: u, vout: d })
       );
-    }), c = await Promise.all(u), m = c.reduce(
-      (d, g) => d + BigInt(g.utxoData.value),
+    }), c = await Promise.all(h), b = c.reduce(
+      (f, u) => f + BigInt(u.utxoData.value),
       0n
-    ), l = r.outs.reduce(
-      (d, g) => d + BigInt(g.value),
+    ), m = r.outs.reduce(
+      (f, u) => f + BigInt(u.value),
       0n
     );
-    if (m < l)
+    if (b < m)
       throw new Error(
-        `UTXO value mismatch: total input value (${m} sat) is less than total output value (${l} sat). This may indicate the mempool API returned manipulated UTXO data.`
+        `UTXO value mismatch: total input value (${b} sat) is less than total output value (${m} sat). This may indicate the mempool API returned manipulated UTXO data.`
       );
-    const y = m - l;
-    if (y > Et)
+    const w = b - m;
+    if (w > bt)
       throw new Error(
-        `Implied transaction fee (${y} sat) exceeds maximum reasonable fee (${Et} sat). This may indicate manipulated UTXO data.`
+        `Implied transaction fee (${w} sat) exceeds maximum reasonable fee (${bt} sat). This may indicate manipulated UTXO data.`
       );
-    for (const { input: d, utxoData: g, txid: p, vout: E } of c) {
-      const k = ge(
+    for (const { input: f, utxoData: u, txid: d, vout: x } of c) {
+      const y = de(
         {
-          value: g.value,
-          scriptPubKey: g.scriptPubKey
+          value: u.value,
+          scriptPubKey: u.scriptPubKey
         },
         a
       );
       i.addInput({
-        hash: d.hash,
-        index: d.index,
-        sequence: d.sequence,
-        ...k
+        hash: f.hash,
+        index: f.index,
+        sequence: f.sequence,
+        ...y
       });
     }
-    for (const d of r.outs)
+    for (const f of r.outs)
       i.addOutput({
-        script: d.script,
-        value: d.value
+        script: f.script,
+        value: f.value
       });
-    const f = await this.config.btcWallet.signPsbt(i.toHex()), x = yt.fromHex(f);
+    const g = await this.config.btcWallet.signPsbt(i.toHex()), E = dt.fromHex(g);
     try {
-      x.finalizeAllInputs();
-    } catch (d) {
-      if (!x.data.inputs.every(
-        (p) => p.finalScriptWitness || p.finalScriptSig
+      E.finalizeAllInputs();
+    } catch (f) {
+      if (!E.data.inputs.every(
+        (d) => d.finalScriptWitness || d.finalScriptSig
       ))
         throw new Error(
-          `PSBT finalization failed and wallet did not auto-finalize: ${d}`
+          `PSBT finalization failed and wallet did not auto-finalize: ${f}`
         );
     }
-    const P = x.extractTransaction().toHex();
-    return await we(P, h);
+    const P = E.extractTransaction().toHex();
+    return await pe(P, l);
   }
   /**
    * Registers a peg-in on Ethereum by calling the BTCVaultRegistry contract.
@@ -392,36 +393,36 @@ class Nn {
       hashlock: r,
       htlcVout: i,
       depositorPayoutBtcAddress: a,
-      depositorWotsPkHash: h,
-      popSignature: u
+      depositorWotsPkHash: l,
+      popSignature: h
     } = t;
     if (!this.config.ethWallet.account)
       throw new Error("Ethereum wallet account not found");
     const c = this.config.ethWallet.account.address;
-    if (!bt(u.depositorEthAddress, c))
+    if (!ft(h.depositorEthAddress, c))
       throw new Error(
-        `Proof of possession was signed for ${u.depositorEthAddress} but the Ethereum wallet is currently connected to ${c}. Reconnect the original account or call signProofOfPossession() again.`
+        `Proof of possession was signed for ${h.depositorEthAddress} but the Ethereum wallet is currently connected to ${c}. Reconnect the original account or call signProofOfPossession() again.`
       );
-    await this.assertPopMatchesBtcWallet(u);
-    const m = u.btcPopSignature, l = I(u.depositorBtcPubkey), y = I(n), f = I(s), x = await this.resolvePayoutScriptPubKey(
+    await this.assertPopMatchesBtcWallet(h);
+    const b = h.btcPopSignature, m = _(h.depositorBtcPubkey), w = _(n), g = _(s), E = await this.resolvePayoutScriptPubKey(
       a
-    ), P = G(f), w = await Pt(
+    ), P = G(g), k = await pt(
       v(P),
       v(c)
-    ), d = I(w);
-    if (await this.checkVaultExists(d))
+    ), f = _(k);
+    if (await this.checkVaultExists(f))
       throw new Error(
-        `Vault already exists (ID: ${d}, peginTxHash: ${P}). Vault IDs are derived from the pegin transaction hash and depositor address. To create a new vault, use different UTXOs or a different amount to generate a unique transaction.`
+        `Vault already exists (ID: ${f}, peginTxHash: ${P}). Vault IDs are derived from the pegin transaction hash and depositor address. To create a new vault, use different UTXOs or a different amount to generate a unique transaction.`
       );
-    const p = q({
+    const d = j({
       chain: this.config.ethChain,
-      transport: Z()
+      transport: q()
     });
-    let E;
+    let x;
     try {
-      E = await p.readContract({
+      x = await d.readContract({
         address: this.config.vaultContracts.btcVaultRegistry,
-        abi: O,
+        abi: S,
         functionName: "getPegInFee",
         args: [o]
       });
@@ -430,57 +431,57 @@ class Nn {
         "Failed to query pegin fee from the contract. Please check your network connection and that the contract address is correct."
       );
     }
-    const k = xt({
-      abi: O,
+    const y = gt({
+      abi: S,
       functionName: "submitPeginRequest",
       args: [
         c,
-        l,
         m,
-        y,
-        f,
+        b,
+        w,
+        g,
         o,
         r,
         i,
-        x,
-        h
+        E,
+        l
       ]
     });
-    let _;
+    let I;
     try {
-      _ = await p.estimateGas({
+      I = await d.estimateGas({
         to: this.config.vaultContracts.btcVaultRegistry,
-        data: k,
-        value: E,
+        data: y,
+        value: x,
         account: this.config.ethWallet.account.address
       });
-    } catch (j) {
-      A(j);
+    } catch (K) {
+      A(K);
     }
     let B;
     try {
       B = await this.config.ethWallet.sendTransaction({
         to: this.config.vaultContracts.btcVaultRegistry,
-        data: k,
-        value: E,
+        data: y,
+        value: x,
         account: this.config.ethWallet.account,
         chain: this.config.ethChain,
-        gas: _
+        gas: I
       });
-    } catch (j) {
-      A(j);
+    } catch (K) {
+      A(K);
     }
-    const X = await p.waitForTransactionReceipt({
+    const D = await d.waitForTransactionReceipt({
       hash: B,
-      timeout: _t
+      timeout: yt
     });
-    return X.status === "reverted" && A(
+    return D.status === "reverted" && A(
       new Error(
         `Transaction reverted. Hash: ${B}. Check the transaction on block explorer for details.`
       )
     ), {
-      ethTxHash: X.transactionHash,
-      vaultId: d,
+      ethTxHash: D.transactionHash,
+      vaultId: f,
       peginTxHash: P
     };
   }
@@ -501,39 +502,39 @@ class Nn {
     if (!this.config.ethWallet.account)
       throw new Error("Ethereum wallet account not found");
     const i = this.config.ethWallet.account.address;
-    if (!bt(r.depositorEthAddress, i))
+    if (!ft(r.depositorEthAddress, i))
       throw new Error(
         `Proof of possession was signed for ${r.depositorEthAddress} but the Ethereum wallet is currently connected to ${i}. Reconnect the original account or call signProofOfPossession() again.`
       );
     await this.assertPopMatchesBtcWallet(r);
-    const a = r.btcPopSignature, h = [];
-    for (const p of o)
-      h.push(
-        await this.resolvePayoutScriptPubKey(p.depositorPayoutBtcAddress)
+    const a = r.btcPopSignature, l = [];
+    for (const d of o)
+      l.push(
+        await this.resolvePayoutScriptPubKey(d.depositorPayoutBtcAddress)
       );
-    const u = [];
-    for (const p of o) {
-      const E = I(
-        p.depositorSignedPeginTx
-      ), k = G(E), _ = await Pt(
-        v(k),
+    const h = [];
+    for (const d of o) {
+      const x = _(
+        d.depositorSignedPeginTx
+      ), y = G(x), I = await pt(
+        v(y),
         v(i)
-      ), B = I(_);
+      ), B = _(I);
       if (await this.checkVaultExists(B))
         throw new Error(
-          `Vault already exists (ID: ${B}, peginTxHash: ${k}). To create a new vault, use different UTXOs or a different amount.`
+          `Vault already exists (ID: ${B}, peginTxHash: ${y}). To create a new vault, use different UTXOs or a different amount.`
         );
-      u.push({ vaultId: B, peginTxHash: k });
+      h.push({ vaultId: B, peginTxHash: y });
     }
-    const c = q({
+    const c = j({
       chain: this.config.ethChain,
-      transport: Z()
+      transport: q()
     });
-    let m;
+    let b;
     try {
-      m = await c.readContract({
+      b = await c.readContract({
         address: this.config.vaultContracts.btcVaultRegistry,
-        abi: O,
+        abi: S,
         functionName: "getPegInFee",
         args: [n]
       });
@@ -542,60 +543,60 @@ class Nn {
         "Failed to query pegin fee from the contract. Please check your network connection and that the contract address is correct."
       );
     }
-    const l = m * BigInt(o.length), y = I(
+    const m = b * BigInt(o.length), w = _(
       r.depositorBtcPubkey
-    ), f = I(s), x = o.map((p, E) => ({
-      depositorBtcPubKey: y,
+    ), g = _(s), E = o.map((d, x) => ({
+      depositorBtcPubKey: w,
       btcPopSignature: a,
-      unsignedPrePeginTx: f,
-      depositorSignedPeginTx: I(
-        p.depositorSignedPeginTx
+      unsignedPrePeginTx: g,
+      depositorSignedPeginTx: _(
+        d.depositorSignedPeginTx
       ),
-      hashlock: p.hashlock,
-      htlcVout: p.htlcVout,
-      referralCode: Se,
-      depositorPayoutBtcAddress: h[E],
-      depositorWotsPkHash: p.depositorWotsPkHash
-    })), P = xt({
-      abi: O,
+      hashlock: d.hashlock,
+      htlcVout: d.htlcVout,
+      referralCode: xe,
+      depositorPayoutBtcAddress: l[x],
+      depositorWotsPkHash: d.depositorWotsPkHash
+    })), P = gt({
+      abi: S,
       functionName: "submitPeginRequestBatch",
-      args: [i, n, x]
+      args: [i, n, E]
     });
-    let w;
+    let k;
     try {
-      w = await c.estimateGas({
+      k = await c.estimateGas({
         to: this.config.vaultContracts.btcVaultRegistry,
         data: P,
-        value: l,
+        value: m,
         account: this.config.ethWallet.account.address
       });
-    } catch (p) {
-      A(p);
+    } catch (d) {
+      A(d);
     }
-    let d;
+    let f;
     try {
-      d = await this.config.ethWallet.sendTransaction({
+      f = await this.config.ethWallet.sendTransaction({
         to: this.config.vaultContracts.btcVaultRegistry,
         data: P,
-        value: l,
+        value: m,
         account: this.config.ethWallet.account,
         chain: this.config.ethChain,
-        gas: w
+        gas: k
       });
-    } catch (p) {
-      A(p);
+    } catch (d) {
+      A(d);
     }
-    const g = await c.waitForTransactionReceipt({
-      hash: d,
-      timeout: _t
+    const u = await c.waitForTransactionReceipt({
+      hash: f,
+      timeout: yt
     });
-    return g.status === "reverted" && A(
+    return u.status === "reverted" && A(
       new Error(
-        `Batch transaction reverted. Hash: ${d}. Check the transaction on block explorer for details.`
+        `Batch transaction reverted. Hash: ${f}. Check the transaction on block explorer for details.`
       )
     ), {
-      ethTxHash: g.transactionHash,
-      vaults: u
+      ethTxHash: u.transactionHash,
+      vaults: h
     };
   }
   /**
@@ -606,15 +607,15 @@ class Nn {
    */
   async checkVaultExists(t) {
     try {
-      return (await q({
+      return (await j({
         chain: this.config.ethChain,
-        transport: Z()
+        transport: q()
       }).readContract({
         address: this.config.vaultContracts.btcVaultRegistry,
-        abi: O,
+        abi: S,
         functionName: "getBtcVaultBasicInfo",
         args: [t]
-      }))[0] !== oe;
+      }))[0] !== te;
     } catch {
       return !1;
     }
@@ -633,7 +634,7 @@ class Nn {
     else {
       n = await this.config.btcWallet.getAddress();
       const o = await this.config.btcWallet.getPublicKeyHex();
-      if (!he(
+      if (!ae(
         n,
         o,
         this.config.btcNetwork
@@ -642,9 +643,9 @@ class Nn {
           "The BTC address from your wallet does not match the wallet's public key. Please ensure your wallet is using a supported address type (Taproot or Native SegWit)."
         );
     }
-    const s = kt(this.config.btcNetwork);
+    const s = mt(this.config.btcNetwork);
     try {
-      return `0x${ne.address.toOutputScript(n, s).toString("hex")}`;
+      return `0x${Jt.address.toOutputScript(n, s).toString("hex")}`;
     } catch {
       throw new Error(
         `Invalid BTC payout address: "${n}". Please provide a valid Bitcoin address for the ${this.config.btcNetwork} network.`
@@ -660,22 +661,22 @@ class Nn {
   async signProofOfPossession() {
     if (!this.config.ethWallet.account)
       throw new Error("Ethereum wallet account not found");
-    const t = this.config.ethWallet.account.address, n = $(
+    const t = this.config.ethWallet.account.address, n = O(
       await this.config.btcWallet.getPublicKeyHex()
     ), s = this.config.vaultContracts.btcVaultRegistry, o = `${t.toLowerCase()}:${this.config.ethChain.id}:pegin:${s.toLowerCase()}`, r = await this.config.btcWallet.signMessage(
       o,
       "bip322-simple"
     );
     return {
-      btcPopSignature: Oe(r),
+      btcPopSignature: ke(r),
       depositorEthAddress: t,
       depositorBtcPubkey: n
     };
   }
   async assertPopMatchesBtcWallet(t) {
-    const n = $(
+    const n = O(
       await this.config.btcWallet.getPublicKeyHex()
-    ), s = $(t.depositorBtcPubkey);
+    ), s = O(t.depositorBtcPubkey);
     if (n !== s)
       throw new Error(
         `Proof of possession was signed with BTC pubkey ${s} but the BTC wallet is currently connected to ${n}. Reconnect the original wallet or call signProofOfPossession() again.`
@@ -698,51 +699,20 @@ class Nn {
     return this.config.vaultContracts.btcVaultRegistry;
   }
 }
-class Ft {
-  constructor(t, n) {
-    b(this, "oHash");
-    b(this, "iHash");
-    b(this, "blockLen");
-    b(this, "outputLen");
-    b(this, "finished", !1);
-    b(this, "destroyed", !1);
-    if (ht(t), U(n, void 0, "key"), this.iHash = t.create(), typeof this.iHash.update != "function")
-      throw new Error("Expected instance of class which extends utils.Hash");
-    this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
-    const s = this.blockLen, o = new Uint8Array(s);
-    o.set(n.length > s ? t.create().update(n).digest() : n);
-    for (let r = 0; r < o.length; r++)
-      o[r] ^= 54;
-    this.iHash.update(o), this.oHash = t.create();
-    for (let r = 0; r < o.length; r++)
-      o[r] ^= 106;
-    this.oHash.update(o), S(o);
-  }
-  update(t) {
-    return V(this), this.iHash.update(t), this;
-  }
-  digestInto(t) {
-    V(this), U(t, this.outputLen, "output"), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
-  }
-  digest() {
-    const t = new Uint8Array(this.oHash.outputLen);
-    return this.digestInto(t), t;
-  }
-  _cloneInto(t) {
-    t || (t = Object.create(Object.getPrototypeOf(this), {}));
-    const { oHash: n, iHash: s, finished: o, destroyed: r, blockLen: i, outputLen: a } = this;
-    return t = t, t.finished = o, t.destroyed = r, t.blockLen = i, t.outputLen = a, t.oHash = n._cloneInto(t.oHash), t.iHash = s._cloneInto(t.iHash), t;
-  }
-  clone() {
-    return this._cloneInto();
-  }
-  destroy() {
-    this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
+const M = /* @__PURE__ */ BigInt(2 ** 32 - 1), xt = /* @__PURE__ */ BigInt(32);
+function Ie(e, t = !1) {
+  return t ? { h: Number(e & M), l: Number(e >> xt & M) } : { h: Number(e >> xt & M) | 0, l: Number(e & M) | 0 };
+}
+function ve(e, t = !1) {
+  const n = e.length;
+  let s = new Uint32Array(n), o = new Uint32Array(n);
+  for (let r = 0; r < n; r++) {
+    const { h: i, l: a } = Ie(e[r], t);
+    [s[r], o[r]] = [i, a];
   }
+  return [s, o];
 }
-const K = (e, t, n) => new Ft(e, t).update(n).digest();
-K.create = (e, t) => new Ft(e, t);
-const Le = /* @__PURE__ */ Uint8Array.from([
+const Be = (e, t, n) => e << n | t >>> 32 - n, Ae = (e, t, n) => t << n | e >>> 32 - n, He = (e, t, n) => t << n - 32 | e >>> 64 - n, Ce = (e, t, n) => e << n - 32 | t >>> 64 - n, Se = /* @__PURE__ */ Uint8Array.from([
   7,
   4,
   13,
@@ -759,43 +729,43 @@ const Le = /* @__PURE__ */ Uint8Array.from([
   14,
   11,
   8
-]), Mt = Uint8Array.from(new Array(16).fill(0).map((e, t) => t)), Re = Mt.map((e) => (9 * e + 5) % 16), Nt = /* @__PURE__ */ (() => {
-  const n = [[Mt], [Re]];
+]), $t = Uint8Array.from(new Array(16).fill(0).map((e, t) => t)), Oe = $t.map((e) => (9 * e + 5) % 16), Rt = /* @__PURE__ */ (() => {
+  const n = [[$t], [Oe]];
   for (let s = 0; s < 4; s++)
     for (let o of n)
-      o.push(o[s].map((r) => Le[r]));
+      o.push(o[s].map((r) => Se[r]));
   return n;
-})(), Vt = Nt[0], Dt = Nt[1], Kt = /* @__PURE__ */ [
+})(), Ut = Rt[0], Lt = Rt[1], Wt = /* @__PURE__ */ [
   [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],
   [12, 13, 11, 15, 6, 9, 9, 7, 12, 15, 11, 13, 7, 8, 7, 7],
   [13, 15, 14, 11, 7, 7, 6, 8, 13, 14, 13, 12, 5, 5, 6, 9],
   [14, 11, 12, 14, 8, 6, 5, 5, 15, 12, 15, 14, 9, 9, 8, 6],
   [15, 12, 13, 13, 9, 5, 8, 6, 14, 11, 12, 11, 8, 6, 5, 5]
-].map((e) => Uint8Array.from(e)), Ue = /* @__PURE__ */ Vt.map((e, t) => e.map((n) => Kt[t][n])), We = /* @__PURE__ */ Dt.map((e, t) => e.map((n) => Kt[t][n])), Fe = /* @__PURE__ */ Uint32Array.from([
+].map((e) => Uint8Array.from(e)), $e = /* @__PURE__ */ Ut.map((e, t) => e.map((n) => Wt[t][n])), Re = /* @__PURE__ */ Lt.map((e, t) => e.map((n) => Wt[t][n])), Ue = /* @__PURE__ */ Uint32Array.from([
   0,
   1518500249,
   1859775393,
   2400959708,
   2840853838
-]), Me = /* @__PURE__ */ Uint32Array.from([
+]), Le = /* @__PURE__ */ Uint32Array.from([
   1352829926,
   1548603684,
   1836072691,
   2053994217,
   0
 ]);
-function vt(e, t, n, s) {
+function Pt(e, t, n, s) {
   return e === 0 ? t ^ n ^ s : e === 1 ? t & n | ~t & s : e === 2 ? (t | ~n) ^ s : e === 3 ? t & s | n & ~s : t ^ (n | ~s);
 }
-const M = /* @__PURE__ */ new Uint32Array(16);
-class Ne extends be {
+const N = /* @__PURE__ */ new Uint32Array(16);
+class We extends be {
   constructor() {
     super(64, 20, 8, !0);
-    b(this, "h0", 1732584193);
-    b(this, "h1", -271733879);
-    b(this, "h2", -1732584194);
-    b(this, "h3", 271733878);
-    b(this, "h4", -1009589776);
+    p(this, "h0", 1732584193);
+    p(this, "h1", -271733879);
+    p(this, "h2", -1732584194);
+    p(this, "h3", 271733878);
+    p(this, "h4", -1009589776);
   }
   get() {
     const { h0: n, h1: s, h2: o, h3: r, h4: i } = this;
@@ -805,52 +775,52 @@ class Ne extends be {
     this.h0 = n | 0, this.h1 = s | 0, this.h2 = o | 0, this.h3 = r | 0, this.h4 = i | 0;
   }
   process(n, s) {
-    for (let f = 0; f < 16; f++, s += 4)
-      M[f] = n.getUint32(s, !0);
-    let o = this.h0 | 0, r = o, i = this.h1 | 0, a = i, h = this.h2 | 0, u = h, c = this.h3 | 0, m = c, l = this.h4 | 0, y = l;
-    for (let f = 0; f < 5; f++) {
-      const x = 4 - f, P = Fe[f], w = Me[f], d = Vt[f], g = Dt[f], p = Ue[f], E = We[f];
-      for (let k = 0; k < 16; k++) {
-        const _ = F(o + vt(f, i, h, c) + M[d[k]] + P, p[k]) + l | 0;
-        o = l, l = c, c = F(h, 10) | 0, h = i, i = _;
+    for (let g = 0; g < 16; g++, s += 4)
+      N[g] = n.getUint32(s, !0);
+    let o = this.h0 | 0, r = o, i = this.h1 | 0, a = i, l = this.h2 | 0, h = l, c = this.h3 | 0, b = c, m = this.h4 | 0, w = m;
+    for (let g = 0; g < 5; g++) {
+      const E = 4 - g, P = Ue[g], k = Le[g], f = Ut[g], u = Lt[g], d = $e[g], x = Re[g];
+      for (let y = 0; y < 16; y++) {
+        const I = W(o + Pt(g, i, l, c) + N[f[y]] + P, d[y]) + m | 0;
+        o = m, m = c, c = W(l, 10) | 0, l = i, i = I;
       }
-      for (let k = 0; k < 16; k++) {
-        const _ = F(r + vt(x, a, u, m) + M[g[k]] + w, E[k]) + y | 0;
-        r = y, y = m, m = F(u, 10) | 0, u = a, a = _;
+      for (let y = 0; y < 16; y++) {
+        const I = W(r + Pt(E, a, h, b) + N[u[y]] + k, x[y]) + w | 0;
+        r = w, w = b, b = W(h, 10) | 0, h = a, a = I;
       }
     }
-    this.set(this.h1 + h + m | 0, this.h2 + c + y | 0, this.h3 + l + r | 0, this.h4 + o + a | 0, this.h0 + i + u | 0);
+    this.set(this.h1 + l + b | 0, this.h2 + c + w | 0, this.h3 + m + r | 0, this.h4 + o + a | 0, this.h0 + i + h | 0);
   }
   roundClean() {
-    S(M);
+    H(N);
   }
   destroy() {
-    this.destroyed = !0, S(this.buffer), this.set(0, 0, 0, 0, 0);
+    this.destroyed = !0, H(this.buffer), this.set(0, 0, 0, 0, 0);
   }
 }
-const Ve = /* @__PURE__ */ Ut(() => new Ne()), De = BigInt(0), L = BigInt(1), Ke = BigInt(2), Xe = BigInt(7), je = BigInt(256), qe = BigInt(113), Xt = [], jt = [], qt = [];
-for (let e = 0, t = L, n = 1, s = 0; e < 24; e++) {
-  [n, s] = [s, (2 * n + 3 * s) % 5], Xt.push(2 * (5 * s + n)), jt.push((e + 1) * (e + 2) / 2 % 64);
-  let o = De;
+const Me = /* @__PURE__ */ St(() => new We()), Ne = BigInt(0), $ = BigInt(1), Ve = BigInt(2), Fe = BigInt(7), Xe = BigInt(256), De = BigInt(113), Mt = [], Nt = [], Vt = [];
+for (let e = 0, t = $, n = 1, s = 0; e < 24; e++) {
+  [n, s] = [s, (2 * n + 3 * s) % 5], Mt.push(2 * (5 * s + n)), Nt.push((e + 1) * (e + 2) / 2 % 64);
+  let o = Ne;
   for (let r = 0; r < 7; r++)
-    t = (t << L ^ (t >> Xe) * qe) % je, t & Ke && (o ^= L << (L << BigInt(r)) - L);
-  qt.push(o);
+    t = (t << $ ^ (t >> Fe) * De) % Xe, t & Ve && (o ^= $ << ($ << BigInt(r)) - $);
+  Vt.push(o);
 }
-const Zt = xe(qt, !0), Ze = Zt[0], Ge = Zt[1], Bt = (e, t, n) => n > 32 ? Ie(e, t, n) : Ee(e, t, n), St = (e, t, n) => n > 32 ? _e(e, t, n) : Te(e, t, n);
-function ze(e, t = 24) {
+const Ft = ve(Vt, !0), Ke = Ft[0], je = Ft[1], Et = (e, t, n) => n > 32 ? He(e, t, n) : Be(e, t, n), Tt = (e, t, n) => n > 32 ? Ce(e, t, n) : Ae(e, t, n);
+function qe(e, t = 24) {
   const n = new Uint32Array(10);
   for (let s = 24 - t; s < 24; s++) {
     for (let i = 0; i < 10; i++)
       n[i] = e[i] ^ e[i + 10] ^ e[i + 20] ^ e[i + 30] ^ e[i + 40];
     for (let i = 0; i < 10; i += 2) {
-      const a = (i + 8) % 10, h = (i + 2) % 10, u = n[h], c = n[h + 1], m = Bt(u, c, 1) ^ n[a], l = St(u, c, 1) ^ n[a + 1];
-      for (let y = 0; y < 50; y += 10)
-        e[i + y] ^= m, e[i + y + 1] ^= l;
+      const a = (i + 8) % 10, l = (i + 2) % 10, h = n[l], c = n[l + 1], b = Et(h, c, 1) ^ n[a], m = Tt(h, c, 1) ^ n[a + 1];
+      for (let w = 0; w < 50; w += 10)
+        e[i + w] ^= b, e[i + w + 1] ^= m;
     }
     let o = e[2], r = e[3];
     for (let i = 0; i < 24; i++) {
-      const a = jt[i], h = Bt(o, r, a), u = St(o, r, a), c = Xt[i];
-      o = e[c], r = e[c + 1], e[c] = h, e[c + 1] = u;
+      const a = Nt[i], l = Et(o, r, a), h = Tt(o, r, a), c = Mt[i];
+      o = e[c], r = e[c + 1], e[c] = l, e[c + 1] = h;
     }
     for (let i = 0; i < 50; i += 10) {
       for (let a = 0; a < 10; a++)
@@ -858,36 +828,36 @@ function ze(e, t = 24) {
       for (let a = 0; a < 10; a++)
         e[i + a] ^= ~n[(a + 2) % 10] & n[(a + 4) % 10];
     }
-    e[0] ^= Ze[s], e[1] ^= Ge[s];
+    e[0] ^= Ke[s], e[1] ^= je[s];
   }
-  S(n);
+  H(n);
 }
-class ft {
+class at {
   // NOTE: we accept arguments in bytes instead of bits here.
   constructor(t, n, s, o = !1, r = 24) {
-    b(this, "state");
-    b(this, "pos", 0);
-    b(this, "posOut", 0);
-    b(this, "finished", !1);
-    b(this, "state32");
-    b(this, "destroyed", !1);
-    b(this, "blockLen");
-    b(this, "suffix");
-    b(this, "outputLen");
-    b(this, "enableXOF", !1);
-    b(this, "rounds");
-    if (this.blockLen = t, this.suffix = n, this.outputLen = s, this.enableXOF = o, this.rounds = r, C(s, "outputLen"), !(0 < t && t < 200))
+    p(this, "state");
+    p(this, "pos", 0);
+    p(this, "posOut", 0);
+    p(this, "finished", !1);
+    p(this, "state32");
+    p(this, "destroyed", !1);
+    p(this, "blockLen");
+    p(this, "suffix");
+    p(this, "outputLen");
+    p(this, "enableXOF", !1);
+    p(this, "rounds");
+    if (this.blockLen = t, this.suffix = n, this.outputLen = s, this.enableXOF = o, this.rounds = r, nt(s, "outputLen"), !(0 < t && t < 200))
       throw new Error("only keccak-f1600 function is supported");
-    this.state = new Uint8Array(200), this.state32 = Pe(this.state);
+    this.state = new Uint8Array(200), this.state32 = we(this.state);
   }
   clone() {
     return this._cloneInto();
   }
   keccak() {
-    Tt(this.state32), ze(this.state32, this.rounds), Tt(this.state32), this.posOut = 0, this.pos = 0;
+    wt(this.state32), qe(this.state32, this.rounds), wt(this.state32), this.posOut = 0, this.pos = 0;
   }
   update(t) {
-    V(this), U(t);
+    F(this), U(t);
     const { blockLen: n, state: s } = this, o = t.length;
     for (let r = 0; r < o; ) {
       const i = Math.min(n - this.pos, o - r);
@@ -905,7 +875,7 @@ class ft {
     t[s] ^= n, (n & 128) !== 0 && s === o - 1 && this.keccak(), t[o - 1] ^= 128, this.keccak();
   }
   writeInto(t) {
-    V(this, !1), U(t), this.finish();
+    F(this, !1), U(t), this.finish();
     const n = this.state, { blockLen: s } = this;
     for (let o = 0, r = t.length; o < r; ) {
       this.posOut >= s && this.keccak();
@@ -920,10 +890,10 @@ class ft {
     return this.writeInto(t);
   }
   xof(t) {
-    return C(t), this.xofInto(new Uint8Array(t));
+    return nt(t), this.xofInto(new Uint8Array(t));
   }
   digestInto(t) {
-    if (ke(t, this), this.finished)
+    if (ye(t, this), this.finished)
       throw new Error("digest() was already called");
     return this.writeInto(t), this.destroy(), t;
   }
@@ -931,93 +901,30 @@ class ft {
     return this.digestInto(new Uint8Array(this.outputLen));
   }
   destroy() {
-    this.destroyed = !0, S(this.state);
+    this.destroyed = !0, H(this.state);
   }
   _cloneInto(t) {
     const { blockLen: n, suffix: s, outputLen: o, rounds: r, enableXOF: i } = this;
-    return t || (t = new ft(n, s, o, i, r)), t.state32.set(this.state32), t.pos = this.pos, t.posOut = this.posOut, t.finished = this.finished, t.rounds = r, t.suffix = s, t.outputLen = o, t.enableXOF = i, t.destroyed = this.destroyed, t;
-  }
-}
-const Ye = (e, t, n, s = {}) => Ut(() => new ft(t, e, n), s), Je = /* @__PURE__ */ Ye(1, 136, 32);
-function Qe(e, t, n, s) {
-  ht(e);
-  const o = Be({ dkLen: 32, asyncTick: 10 }, s), { c: r, dkLen: i, asyncTick: a } = o;
-  if (C(r, "c"), C(i, "dkLen"), C(a, "asyncTick"), r < 1)
-    throw new Error("iterations (c) must be >= 1");
-  const h = It(t, "password"), u = It(n, "salt"), c = new Uint8Array(i), m = K.create(e, h), l = m._cloneInto().update(u);
-  return { c: r, dkLen: i, asyncTick: a, DK: c, PRF: m, PRFSalt: l };
-}
-function tn(e, t, n, s, o) {
-  return e.destroy(), t.destroy(), s && s.destroy(), S(o), n;
-}
-function en(e, t, n, s) {
-  const { c: o, dkLen: r, DK: i, PRF: a, PRFSalt: h } = Qe(e, t, n, s);
-  let u;
-  const c = new Uint8Array(4), m = ve(c), l = new Uint8Array(a.outputLen);
-  for (let y = 1, f = 0; f < r; y++, f += a.outputLen) {
-    const x = i.subarray(f, f + a.outputLen);
-    m.setInt32(0, y, !1), (u = h._cloneInto(u)).update(c).digestInto(l), x.set(l.subarray(0, x.length));
-    for (let P = 1; P < o; P++) {
-      a._cloneInto(u).update(l).digestInto(l);
-      for (let w = 0; w < x.length; w++)
-        x[w] ^= l[w];
-    }
+    return t || (t = new at(n, s, o, i, r)), t.state32.set(this.state32), t.pos = this.pos, t.posOut = this.posOut, t.finished = this.finished, t.rounds = r, t.suffix = s, t.outputLen = o, t.enableXOF = i, t.destroyed = this.destroyed, t;
   }
-  return tn(a, h, i, u, l);
 }
-function Gt(e) {
-  if (typeof e != "string")
-    throw new TypeError("invalid mnemonic type: " + typeof e);
-  return e.normalize("NFKD");
+const Ge = (e, t, n, s = {}) => St(() => new at(t, e, n), s), Ze = /* @__PURE__ */ Ge(1, 136, 32), kt = 64, T = 20, st = 4, Xt = 2, ze = 0, Ye = 1, V = [64, 64], Je = (e) => Array.from(e).map((t) => t.toString(16).padStart(2, "0")).join("");
+function ct(e) {
+  return Me(L(e));
 }
-function nn(e) {
-  const t = Gt(e), n = t.split(" ");
-  if (![12, 15, 18, 21, 24].includes(n.length))
-    throw new Error("Invalid mnemonic");
-  return { nfkd: t, words: n };
-}
-const sn = (e) => Gt("mnemonic" + e);
-function on(e, t = "") {
-  return en(Wt, nn(e).nfkd, sn(t), { c: 2048, dkLen: 64 });
-}
-const z = 32, Y = 64, rn = 4, T = 20, at = 4, zt = 2, an = 0, cn = 1, N = [64, 64];
-function ct(...e) {
-  const t = e.reduce((o, r) => o + r.length, 0), n = new Uint8Array(t);
-  let s = 0;
-  for (const o of e)
-    n.set(o, s), s += o.length;
-  return n;
-}
-function J(e) {
-  return new TextEncoder().encode(e);
-}
-function Q(e) {
-  const t = new Uint8Array(rn);
-  return new DataView(t.buffer).setUint32(0, e.length, !1), ct(t, e);
-}
-function At(e) {
-  return e.startsWith("0x") || e.startsWith("0X") ? e.slice(2) : e;
-}
-const ln = (e) => Array.from(e).map((t) => t.toString(16).padStart(2, "0")).join("");
-function un(e, t) {
-  return K(Wt, e, t);
-}
-function gt(e) {
-  return Ve(W(e));
-}
-function Yt(e) {
+function Dt(e) {
   return (1 << e) - 1;
 }
-function hn(e) {
+function Qe(e) {
   let t = 1;
   for (; t * t < e + 1; ) t++;
   return Math.max(t, 2);
 }
-function dn(e) {
-  const t = at, n = Yt(t), s = e * n;
-  return { d: t, n: e, checksum_radix: hn(s) };
+function tn(e) {
+  const t = st, n = e * Dt(t);
+  return { d: t, n: e, checksum_radix: Qe(n) };
 }
-function tt(e, t) {
+function Z(e, t) {
   const n = [];
   let s = t;
   for (; s > 0; )
@@ -1026,93 +933,93 @@ function tt(e, t) {
   o.set(e);
   for (let r = 0; r < n.length; r++)
     o[e.length + r] = n[r];
-  return gt(o);
+  return ct(o);
 }
-function et(e, t) {
+function z(e, t) {
   let n = e;
   for (let s = 0; s < t; s++)
-    n = gt(n);
+    n = ct(n);
   return n;
 }
-function fn(e, t) {
-  const n = Yt(t.d), s = t.checksum_radix - 1, o = Math.floor(t.n * n / t.checksum_radix), r = [];
+function en(e, t) {
+  const n = Dt(t.d), s = t.checksum_radix - 1, o = Math.floor(t.n * n / t.checksum_radix), r = [];
   for (let c = 0; c < t.n; c++) {
-    const m = tt(e, c + zt), l = et(m, n);
-    r.push(Array.from(l));
+    const b = Z(e, c + Xt), m = z(b, n);
+    r.push(Array.from(m));
   }
-  const i = tt(
+  const i = Z(
     e,
-    an
-  ), a = et(
+    ze
+  ), a = z(
     i,
     s
-  ), h = tt(
+  ), l = Z(
     e,
-    cn
-  ), u = et(
-    h,
+    Ye
+  ), h = z(
+    l,
     o
   );
   return {
     config: t,
     message_terminals: r,
-    checksum_major_terminal: Array.from(u),
+    checksum_major_terminal: Array.from(h),
     checksum_minor_terminal: Array.from(a)
   };
 }
-function gn(e) {
-  const t = on(e), n = new Uint8Array(t);
-  return t.fill(0), n;
-}
-async function pn(e, t, n, s) {
-  if (e.length !== Y)
-    throw new Error(
-      `WOTS seed must be exactly ${Y} bytes, got ${e.length}`
-    );
-  const o = At(t).toLowerCase(), r = At(n).toLowerCase(), i = e.slice(z, Y), a = e.slice(0, z), h = ct(
-    a,
-    ct(
-      Q(J(o)),
-      Q(J(r)),
-      Q(J(s.toLowerCase()))
-    )
-  ), u = un(i, h), c = u.slice(0, z);
+async function Sn(e) {
   try {
-    const m = [];
-    for (let l = 0; l < N.length; l++) {
-      const y = N[l], f = dn(y), x = new Uint8Array(c.length + 1);
-      x.set(c), x[c.length] = l;
-      const P = gt(x);
+    if (e.length !== kt)
+      throw new Error(
+        `WOTS seed must be exactly ${kt} bytes, got ${e.length}`
+      );
+    const t = [];
+    for (let n = 0; n < V.length; n++) {
+      const s = V[n], o = tn(s), r = new Uint8Array(e.length + 1);
+      r.set(e), r[e.length] = n;
+      const i = ct(r);
       try {
-        const w = fn(P, f);
-        if (w.config.d !== at)
-          throw new Error(`Block ${l}: expected d=${at}, got d=${w.config.d}`);
-        if (w.config.n !== y)
-          throw new Error(`Block ${l}: expected n=${y}, got n=${w.config.n}`);
-        if (w.message_terminals.length !== y)
-          throw new Error(`Block ${l}: expected ${y} message terminals, got ${w.message_terminals.length}`);
-        for (let d = 0; d < w.message_terminals.length; d++)
-          if (w.message_terminals[d].length !== T)
-            throw new Error(`Block ${l} terminal ${d}: expected ${T} bytes, got ${w.message_terminals[d].length}`);
-        if (w.checksum_minor_terminal.length !== T)
-          throw new Error(`Block ${l} checksum_minor: expected ${T} bytes`);
-        if (w.checksum_major_terminal.length !== T)
-          throw new Error(`Block ${l} checksum_major: expected ${T} bytes`);
-        m.push(w);
+        const a = en(i, o);
+        if (a.config.d !== st)
+          throw new Error(
+            `Block ${n}: expected d=${st}, got d=${a.config.d}`
+          );
+        if (a.config.n !== s)
+          throw new Error(
+            `Block ${n}: expected n=${s}, got n=${a.config.n}`
+          );
+        if (a.message_terminals.length !== s)
+          throw new Error(
+            `Block ${n}: expected ${s} message terminals, got ${a.message_terminals.length}`
+          );
+        for (let l = 0; l < a.message_terminals.length; l++)
+          if (a.message_terminals[l].length !== T)
+            throw new Error(
+              `Block ${n} terminal ${l}: expected ${T} bytes, got ${a.message_terminals[l].length}`
+            );
+        if (a.checksum_minor_terminal.length !== T)
+          throw new Error(
+            `Block ${n} checksum_minor: expected ${T} bytes`
+          );
+        if (a.checksum_major_terminal.length !== T)
+          throw new Error(
+            `Block ${n} checksum_major: expected ${T} bytes`
+          );
+        t.push(a);
       } finally {
-        x.fill(0), P.fill(0);
+        r.fill(0), i.fill(0);
       }
     }
-    if (m.length !== N.length)
+    if (t.length !== V.length)
       throw new Error(
-        `Expected ${N.length} blocks, got ${m.length}`
+        `Expected ${V.length} blocks, got ${t.length}`
       );
-    return m;
+    return t;
   } finally {
-    h.fill(0), i.fill(0), a.fill(0), u.fill(0), c.fill(0), e.fill(0);
+    e.fill(0);
   }
 }
-function nt(e, t, n) {
+function Y(e, t, n) {
   if (e.length !== T)
     throw new Error(
       `Block ${t} ${n}: expected ${T} bytes, got ${e.length}`
@@ -1125,18 +1032,18 @@ function nt(e, t, n) {
       );
   }
 }
-function mn(e) {
+function On(e) {
   if (e.length === 0)
     throw new Error("Public keys array must not be empty");
   for (let r = 0; r < e.length; r++) {
     const i = e[r];
-    nt(i.checksum_minor_terminal, r, "checksum_minor_terminal"), nt(i.checksum_major_terminal, r, "checksum_major_terminal");
+    Y(i.checksum_minor_terminal, r, "checksum_minor_terminal"), Y(i.checksum_major_terminal, r, "checksum_major_terminal");
     for (let a = 0; a < i.message_terminals.length; a++)
-      nt(i.message_terminals[a], r, `message_terminal[${a}]`);
+      Y(i.message_terminals[a], r, `message_terminal[${a}]`);
   }
   let t = 0;
   for (const r of e)
-    t += zt + r.message_terminals.length;
+    t += Xt + r.message_terminals.length;
   const n = new Uint8Array(t * T);
   let s = 0;
   for (const r of e) {
@@ -1144,154 +1051,201 @@ function mn(e) {
     for (const i of r.message_terminals)
       n.set(i, s), s += T;
   }
-  const o = Je(n);
-  return `0x${ln(o)}`;
-}
-async function Vn(e, t, n, s) {
-  const o = gn(e);
-  try {
-    const r = await pn(
-      o,
-      t,
-      n,
-      s
-    );
-    return mn(r);
-  } finally {
-    o.fill(0);
-  }
+  const o = Ze(n);
+  return `0x${Je(o)}`;
 }
-function Dn(e) {
+function $n(e) {
   const t = (e instanceof Error ? e.message : typeof e == "string" ? e : "").toLowerCase();
   return t.includes("wots") && t.includes("hash") && t.includes("does not match");
 }
-const st = /* @__PURE__ */ Uint8Array.of(0), Ct = /* @__PURE__ */ Uint8Array.of();
-function pt(e, t, n, s = 32) {
-  ht(e), C(s, "length");
+class Kt {
+  constructor(t, n) {
+    p(this, "oHash");
+    p(this, "iHash");
+    p(this, "blockLen");
+    p(this, "outputLen");
+    p(this, "finished", !1);
+    p(this, "destroyed", !1);
+    if (Ot(t), U(n, void 0, "key"), this.iHash = t.create(), typeof this.iHash.update != "function")
+      throw new Error("Expected instance of class which extends utils.Hash");
+    this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
+    const s = this.blockLen, o = new Uint8Array(s);
+    o.set(n.length > s ? t.create().update(n).digest() : n);
+    for (let r = 0; r < o.length; r++)
+      o[r] ^= 54;
+    this.iHash.update(o), this.oHash = t.create();
+    for (let r = 0; r < o.length; r++)
+      o[r] ^= 106;
+    this.oHash.update(o), H(o);
+  }
+  update(t) {
+    return F(this), this.iHash.update(t), this;
+  }
+  digestInto(t) {
+    F(this), U(t, this.outputLen, "output"), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
+  }
+  digest() {
+    const t = new Uint8Array(this.oHash.outputLen);
+    return this.digestInto(t), t;
+  }
+  _cloneInto(t) {
+    t || (t = Object.create(Object.getPrototypeOf(this), {}));
+    const { oHash: n, iHash: s, finished: o, destroyed: r, blockLen: i, outputLen: a } = this;
+    return t = t, t.finished = o, t.destroyed = r, t.blockLen = i, t.outputLen = a, t.oHash = n._cloneInto(t.oHash), t.iHash = s._cloneInto(t.iHash), t;
+  }
+  clone() {
+    return this._cloneInto();
+  }
+  destroy() {
+    this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
+  }
+}
+const jt = (e, t, n) => new Kt(e, t).update(n).digest();
+jt.create = (e, t) => new Kt(e, t);
+const J = /* @__PURE__ */ Uint8Array.of(0), _t = /* @__PURE__ */ Uint8Array.of();
+function lt(e, t, n, s = 32) {
+  Ot(e), nt(s, "length");
   const o = e.outputLen;
   if (s > 255 * o)
     throw new Error("Length must be <= 255*HashLen");
   const r = Math.ceil(s / o);
-  n === void 0 ? n = Ct : U(n, void 0, "info");
-  const i = new Uint8Array(r * o), a = K.create(e, t), h = a._cloneInto(), u = new Uint8Array(a.outputLen);
+  n === void 0 ? n = _t : U(n, void 0, "info");
+  const i = new Uint8Array(r * o), a = jt.create(e, t), l = a._cloneInto(), h = new Uint8Array(a.outputLen);
   for (let c = 0; c < r; c++)
-    st[0] = c + 1, h.update(c === 0 ? Ct : u).update(n).update(st).digestInto(u), i.set(u, o * c), a._cloneInto(h);
-  return a.destroy(), h.destroy(), S(u, st), i.slice(0, s);
+    J[0] = c + 1, l.update(c === 0 ? _t : h).update(n).update(J).digestInto(h), i.set(h, o * c), a._cloneInto(l);
+  return a.destroy(), l.destroy(), H(h, J), i.slice(0, s);
 }
-const ot = new TextEncoder().encode("babylonvault"), Ht = 255, Ot = 65535, $t = 2, wn = "hashlock", yn = "auth-anchor", bn = "wots-seed";
-function Jt(e) {
+const Q = new TextEncoder().encode("babylonvault"), It = 255, vt = 65535, Bt = 2, nn = "hashlock", sn = "auth-anchor", on = "wots-seed";
+function qt(e) {
   if (!Number.isInteger(e) || e < 0 || e > 4294967295)
     throw new Error(`i2osp4: value must be a u32, got ${e}`);
   const t = new Uint8Array(4);
   return t[0] = e >>> 24 & 255, t[1] = e >>> 16 & 255, t[2] = e >>> 8 & 255, t[3] = e & 255, t;
 }
-function mt(e, t = new Uint8Array(0)) {
+function ht(e, t = new Uint8Array(0)) {
   const n = new TextEncoder().encode(e);
-  if (n.length === 0 || n.length > Ht)
+  if (n.length === 0 || n.length > It)
     throw new Error(
-      `info: label length must be in [1, ${Ht}], got ${n.length}`
+      `info: label length must be in [1, ${It}], got ${n.length}`
     );
-  if (t.length > Ot)
+  if (t.length > vt)
     throw new Error(
-      `info: ctx length must be in [0, ${Ot}], got ${t.length}`
+      `info: ctx length must be in [0, ${vt}], got ${t.length}`
     );
-  const s = ot.length + 1 + n.length + $t + t.length, o = new Uint8Array(s);
+  const s = Q.length + 1 + n.length + Bt + t.length, o = new Uint8Array(s);
   let r = 0;
-  return o.set(ot, r), r += ot.length, o[r] = n.length, r += 1, o.set(n, r), r += n.length, o[r] = t.length >>> 8 & 255, o[r + 1] = t.length & 255, r += $t, o.set(t, r), o;
+  return o.set(Q, r), r += Q.length, o[r] = n.length, r += 1, o.set(n, r), r += n.length, o[r] = t.length >>> 8 & 255, o[r + 1] = t.length & 255, r += Bt, o.set(t, r), o;
 }
-const Lt = 32, xn = 32, Pn = 32, kn = 64;
-function wt(e) {
-  if (e.length !== Lt)
+const At = 32, rn = 32, an = 32, cn = 64;
+function ut(e) {
+  if (e.length !== At)
     throw new Error(
-      `vault-secrets: root must be exactly ${Lt} bytes, got ${e.length}`
+      `vault-secrets: root must be exactly ${At} bytes, got ${e.length}`
     );
 }
-function Kn(e) {
-  return wt(e), pt(
-    W,
+function Rn(e) {
+  return ut(e), lt(
+    L,
     e,
-    mt(yn),
-    xn
+    ht(sn),
+    rn
   );
 }
-function Xn(e, t) {
-  return wt(e), pt(
-    W,
+function Un(e, t) {
+  return ut(e), lt(
+    L,
     e,
-    mt(wn, Jt(t)),
-    Pn
+    ht(nn, qt(t)),
+    an
   );
 }
-function jn(e, t) {
-  return wt(e), pt(
-    W,
+function Ln(e, t) {
+  return ut(e), lt(
+    L,
     e,
-    mt(bn, Jt(t)),
-    kn
+    ht(on, qt(t)),
+    cn
   );
 }
-const R = 32, rt = 32, lt = 36, Qt = 32, D = 4, En = D + R + D + Qt;
-function ut(e, t, n) {
+const R = 32, tt = 32, ot = 36, Gt = 32, X = 4, ln = X + R + X + Gt;
+function rt(e, t, n) {
   e[t] = n >>> 24 & 255, e[t + 1] = n >>> 16 & 255, e[t + 2] = n >>> 8 & 255, e[t + 3] = n & 255;
 }
-function Tn(e) {
-  if (e.txid.length !== rt)
+function hn(e) {
+  if (e.txid.length !== tt)
     throw new Error(
-      `outpoint.txid must be exactly ${rt} bytes, got ${e.txid.length}`
+      `outpoint.txid must be exactly ${tt} bytes, got ${e.txid.length}`
     );
   if (!Number.isInteger(e.vout) || e.vout < 0 || e.vout > 4294967295)
     throw new Error(`outpoint.vout must be a u32, got ${e.vout}`);
-  const t = new Uint8Array(lt);
-  return t.set(e.txid, 0), ut(t, rt, e.vout), t;
+  const t = new Uint8Array(ot);
+  return t.set(e.txid, 0), rt(t, tt, e.vout), t;
 }
-function Rt(e, t) {
+function Ht(e, t) {
   const n = Math.min(e.length, t.length);
   for (let s = 0; s < n; s++)
     if (e[s] !== t[s]) return e[s] - t[s];
   return e.length - t.length;
 }
-function In(e) {
+function un(e) {
   if (e.length === 0)
     throw new Error(
       "buildFundingOutpointsCommitment: outpoints must be non-empty"
     );
-  const t = e.map(Tn);
-  t.sort(Rt);
+  const t = e.map(hn);
+  t.sort(Ht);
   for (let s = 1; s < t.length; s++)
-    if (Rt(t[s - 1], t[s]) === 0)
+    if (Ht(t[s - 1], t[s]) === 0)
       throw new Error(
         "buildFundingOutpointsCommitment: duplicate outpoint detected"
       );
-  const n = new Uint8Array(t.length * lt);
+  const n = new Uint8Array(t.length * ot);
   for (let s = 0; s < t.length; s++)
-    n.set(t[s], s * lt);
-  return W(n);
+    n.set(t[s], s * ot);
+  return L(n);
 }
-function qn(e) {
+function dn(e) {
   if (e.depositorBtcPubkey.length !== R)
     throw new Error(
       `vaultContext: depositorBtcPubkey must be exactly ${R} bytes, got ${e.depositorBtcPubkey.length}`
     );
-  const t = In(e.fundingOutpoints), n = new Uint8Array(En);
+  const t = un(e.fundingOutpoints), n = new Uint8Array(ln);
   let s = 0;
-  return ut(n, s, R), s += D, n.set(e.depositorBtcPubkey, s), s += R, ut(n, s, Qt), s += D, n.set(t, s), n;
+  return rt(n, s, R), s += X, n.set(e.depositorBtcPubkey, s), s += R, rt(n, s, Gt), s += X, n.set(t, s), n;
+}
+const fn = "babylon-vault", Zt = 32, Ct = Zt * 2, gn = /^[0-9a-f]+$/;
+async function Wn(e, t) {
+  const n = dn(t), s = le(n), o = await e.deriveContextHash(fn, s);
+  if (typeof o != "string")
+    throw new Error(
+      `deriveVaultRoot: wallet must return a string, got ${typeof o}`
+    );
+  if (o.length !== Ct)
+    throw new Error(
+      `deriveVaultRoot: wallet must return a ${Ct}-character hex string (${Zt} bytes), got length ${o.length}`
+    );
+  if (!gn.test(o))
+    throw new Error(
+      "deriveVaultRoot: wallet must return lowercase hex per derive-context-hash.md §2.1; got value with non-lowercase or non-hex characters"
+    );
+  return he(o);
 }
 export {
-  H as C,
-  Nn as P,
-  Vn as a,
-  Dn as b,
-  mn as c,
-  pn as d,
-  dt as e,
-  Kn as f,
-  Fn as g,
+  C,
+  Cn as P,
+  fn as V,
+  $n as a,
+  Rn as b,
+  On as c,
+  Sn as d,
+  it as e,
+  Un as f,
+  An as g,
   A as h,
-  Mn as i,
-  Xn as j,
-  jn as k,
-  In as l,
-  gn as m,
-  qn as n
+  Hn as i,
+  Ln as j,
+  un as k,
+  dn as l,
+  Wn as m
 };
-//# sourceMappingURL=context-CClNOyD3.js.map
+//# sourceMappingURL=deriveVaultRoot-DAMZDqg-.js.map