@babylonlabs-io/ts-sdk 0.13.0 → 0.13.2

package/dist/{errors-ZoUEvcDE.js → errors-D19BQSaj.js}

@@ -1,13 +1,13 @@
 var ce = Object.defineProperty;
 var ue = (e, t, n) => t in e ? ce(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
-var f = (e, t, n) => ue(e, typeof t != "symbol" ? t + "" : t, n);
+var d = (e, t, n) => ue(e, typeof t != "symbol" ? t + "" : t, n);
 import * as le from "bitcoinjs-lib";
-import { script as he, Transaction as st, address as fe, Psbt as dt } from "bitcoinjs-lib";
+import { script as he, Transaction as q, address as fe, Psbt as dt } from "bitcoinjs-lib";
 import { Buffer as S } from "buffer";
-import { P as de, y as pe, D as Vt, M as Tt, B as be, T as ge, G as pt, u as D, b as xe, A as ye, E as we, a as me, d as Pe, e as Te, f as ve, s as at, q as ke, x as vt, h as kt, i as Ht } from "./challengeAssert-CenzzhZU.js";
-import { createPublicClient as It, http as Et, encodeFunctionData as He, zeroAddress as Ie } from "viem";
-import "@babylonlabs-io/babylon-tbv-rust-wasm";
-function Ee(e, t, n, s) {
+import { P as de, y as pe, D as Vt, M as Tt, B as be, T as ge, G as pt, u as $, b as xe, A as ye, E as we, a as me, d as Pe, e as Te, f as ve, s as z, q as ke, x as vt, h as kt, i as Ht, r as He } from "./challengeAssert-CenzzhZU.js";
+import { createPublicClient as It, http as Et, encodeFunctionData as Ie, zeroAddress as Ee } from "viem";
+import { deriveVaultId as Se } from "@babylonlabs-io/babylon-tbv-rust-wasm";
+function Ae(e, t, n, s) {
   if (!Number.isInteger(s) || s < 1)
     throw new Error(
       `Invalid numOutputs: expected a positive integer, got ${s}`
@@ -26,20 +26,20 @@ function Ee(e, t, n, s) {
   let a = 0n, c = 0n;
   for (const u of o) {
     i.push(u), a += BigInt(u.value);
-    const h = i.length * de, l = s * Tt, d = h + l + ge;
-    if (c = BigInt(Math.ceil(d * n)) + BigInt(pe(n)), a - t - c > Vt) {
-      const p = BigInt(
+    const h = i.length * de, l = s * Tt, f = h + l + ge;
+    if (c = BigInt(Math.ceil(f * n)) + BigInt(pe(n)), a - t - c > Vt) {
+      const b = BigInt(
         Math.ceil(Tt * n)
       );
-      c += p;
+      c += b;
     }
     if (a >= t + c) {
-      const p = a - t - c;
+      const b = a - t - c;
       return {
         selectedUTXOs: i,
         totalValue: a,
         fee: c,
-        changeAmount: p
+        changeAmount: b
       };
     }
   }
@@ -47,17 +47,17 @@ function Ee(e, t, n, s) {
     `Insufficient funds: need ${t + c} sats (${t} pegin + ${c} fee), have ${a} sats`
   );
 }
-function qn(e) {
+function Zn(e) {
   return e > Vt;
 }
-function zn() {
+function Jn() {
   return be;
 }
 function St(e) {
   const t = e.startsWith("0x") ? e.slice(2) : e;
-  return `0x${st.fromHex(t).getId()}`;
+  return `0x${q.fromHex(t).getId()}`;
 }
-function Zn(e, t, n) {
+function Yn(e, t, n) {
   if (e.length === 0)
     throw new Error("No input UTXOs provided for split transaction");
   if (t.length === 0)
@@ -67,7 +67,7 @@ function Zn(e, t, n) {
       throw new Error(
         `Invalid output amount for ${c.address}: ${c.amount} satoshis. Amount must be greater than zero.`
       );
-  const s = pt(n), r = new st();
+  const s = pt(n), r = new q();
   r.version = 2;
   for (const c of e) {
     const u = S.from(c.txid, "hex").reverse();
@@ -101,8 +101,8 @@ function Zn(e, t, n) {
     outputs: o
   };
 }
-function Jn(e, t, n) {
-  const s = st.fromHex(e), r = new dt();
+function Qn(e, t, n) {
+  const s = q.fromHex(e), r = new dt();
   if (r.setVersion(s.version), r.setLocktime(s.locktime), !S.isBuffer(n) || n.length !== 32)
     throw new Error(
       `Invalid publicKeyNoCoord: expected 32-byte Buffer (x-only pubkey), got ${S.isBuffer(n) ? `${n.length}-byte Buffer` : typeof n}`
@@ -126,7 +126,7 @@ function Jn(e, t, n) {
       throw new Error(
         `Input ${o} must be P2TR (Taproot). createSplitTransactionPsbt() requires P2TR inputs because it uses tapInternalKey for Taproot signing. ScriptPubKey: ${a.scriptPubKey.substring(0, 20)}...`
       );
-    const d = {
+    const f = {
       script: S.from(a.scriptPubKey, "hex"),
       value: a.value
     };
@@ -134,7 +134,7 @@ function Jn(e, t, n) {
       hash: i.hash,
       index: i.index,
       sequence: i.sequence,
-      witnessUtxo: d,
+      witnessUtxo: f,
       tapInternalKey: n
     });
   }
@@ -145,8 +145,8 @@ function Jn(e, t, n) {
     });
   return r.toHex();
 }
-var tt = /* @__PURE__ */ ((e) => (e.P2PKH = "P2PKH", e.P2SH = "P2SH", e.P2WPKH = "P2WPKH", e.P2WSH = "P2WSH", e.P2TR = "P2TR", e.UNKNOWN = "UNKNOWN", e))(tt || {});
-function Se(e) {
+var st = /* @__PURE__ */ ((e) => (e.P2PKH = "P2PKH", e.P2SH = "P2SH", e.P2WPKH = "P2WPKH", e.P2WSH = "P2WSH", e.P2TR = "P2TR", e.UNKNOWN = "UNKNOWN", e))(st || {});
+function Be(e) {
   const t = e.length;
   return t === 25 && e[0] === 118 && // OP_DUP
   e[1] === 169 && // OP_HASH160
@@ -159,17 +159,17 @@ function Se(e) {
   e[1] === 32 ? "P2WSH" : t === 34 && e[0] === 81 && // OP_1
   e[1] === 32 ? "P2TR" : "UNKNOWN";
 }
-function Ae(e, t) {
-  const n = S.from(e.scriptPubKey, "hex"), s = Se(n);
+function $e(e, t) {
+  const n = S.from(e.scriptPubKey, "hex"), s = Be(n);
   switch (s) {
-    case tt.P2WPKH:
+    case st.P2WPKH:
       return {
         witnessUtxo: {
           script: n,
           value: e.value
         }
       };
-    case tt.P2WSH: {
+    case st.P2WSH: {
       if (!e.witnessScript)
         throw new Error("Missing witnessScript for P2WSH input");
       return {
@@ -180,7 +180,7 @@ function Ae(e, t) {
         witnessScript: S.from(e.witnessScript, "hex")
       };
     }
-    case tt.P2TR: {
+    case st.P2TR: {
       if (t && t.length !== 32)
         throw new Error(
           `Invalid tapInternalKey length: expected 32 bytes, got ${t.length}`
@@ -210,22 +210,22 @@ function bt(e, t) {
     }))
   };
 }
-const Be = 21e6 * 1e8, Dt = 1e4;
-function Kt(e) {
-  return Number.isInteger(e) && e > 0 && e <= Be;
+const Ue = 21e6 * 1e8, Kt = 1e4;
+function Dt(e) {
+  return Number.isInteger(e) && e > 0 && e <= Ue;
 }
-function $e(e) {
-  return Number.isInteger(e) && e > 0 && e <= Dt;
+function Fe(e) {
+  return Number.isInteger(e) && e > 0 && e <= Kt;
 }
 function Mt(e, t) {
   return !Number.isInteger(e) || e < 0 ? !1 : t === void 0 || e < t;
 }
-const Ue = {
+const Oe = {
   mainnet: "https://mempool.space/api",
   testnet: "https://mempool.space/testnet/api",
   signet: "https://mempool.space/signet/api"
 };
-async function nt(e, t) {
+async function ot(e, t) {
   try {
     const n = await fetch(e, t);
     if (!n.ok) {
@@ -240,7 +240,7 @@ async function nt(e, t) {
     throw n instanceof Error ? new Error(`Failed to fetch from mempool API: ${n.message}`) : new Error("Failed to fetch from mempool API: Unknown error");
   }
 }
-async function Fe(e, t) {
+async function Le(e, t) {
   try {
     const n = await fetch(`${t}/tx`, {
       method: "POST",
@@ -266,10 +266,10 @@ async function Fe(e, t) {
     throw n instanceof Error ? new Error(`Failed to broadcast BTC transaction: ${n.message}`) : new Error("Failed to broadcast BTC transaction: Unknown error");
   }
 }
-async function Le(e, t) {
-  return nt(`${t}/tx/${e}`);
+async function Ce(e, t) {
+  return ot(`${t}/tx/${e}`);
 }
-async function Yn(e, t) {
+async function ts(e, t) {
   try {
     const n = await fetch(`${t}/tx/${e}/hex`);
     if (!n.ok) {
@@ -283,14 +283,14 @@ async function Yn(e, t) {
     throw n instanceof Error ? new Error(`Failed to get transaction hex for ${e}: ${n.message}`) : new Error(`Failed to get transaction hex for ${e}: Unknown error`);
   }
 }
-async function Oe(e, t, n) {
-  const s = await Le(e, n);
+async function _e(e, t, n) {
+  const s = await Ce(e, n);
   if (!Mt(t, s.vout.length))
     throw new Error(
       `Invalid vout ${t} for transaction ${e} (has ${s.vout.length} outputs)`
     );
   const r = s.vout[t];
-  if (!Kt(r.value))
+  if (!Dt(r.value))
     throw new Error(`Invalid UTXO value ${r.value} for ${e}:${t}`);
   return {
     txid: e,
@@ -299,9 +299,9 @@ async function Oe(e, t, n) {
     scriptPubKey: r.scriptpubkey
   };
 }
-async function Qn(e, t) {
+async function es(e, t) {
   try {
-    const n = await nt(`${t}/address/${e}/utxo`), s = await nt(`${t}/v1/validate-address/${e}`);
+    const n = await ot(`${t}/address/${e}/utxo`), s = await ot(`${t}/v1/validate-address/${e}`);
     if (!s.isvalid)
       throw new Error(
         `Invalid Bitcoin address: ${e}. Mempool API validation failed.`
@@ -309,7 +309,7 @@ async function Qn(e, t) {
     for (const o of n) {
       if (!Mt(o.vout))
         throw new Error(`Invalid vout ${o.vout} for ${o.txid}`);
-      if (!Kt(o.value))
+      if (!Dt(o.value))
         throw new Error(
           `Invalid UTXO value ${o.value} for ${o.txid}:${o.vout}`
         );
@@ -329,13 +329,13 @@ async function Qn(e, t) {
     );
   }
 }
-function ts(e) {
-  return Ue[e];
+function ns(e) {
+  return Oe[e];
 }
-async function es(e, t) {
-  return nt(`${t}/address/${e}/txs`);
+async function ss(e, t) {
+  return ot(`${t}/address/${e}/txs`);
 }
-async function ns(e) {
+async function rs(e) {
   const t = await fetch(`${e}/v1/fees/recommended`);
   if (!t.ok)
     throw new Error(
@@ -349,9 +349,9 @@ async function ns(e) {
     "minimumFee"
   ];
   for (const r of s)
-    if (!$e(n[r]))
+    if (!Fe(n[r]))
       throw new Error(
-        `Invalid fee rate ${r}=${n[r]} from mempool API: expected a positive number ≤ ${Dt}`
+        `Invalid fee rate ${r}=${n[r]} from mempool API: expected a positive number ≤ ${Kt}`
       );
   if (n.minimumFee > n.economyFee || n.economyFee > n.hourFee || n.hourFee > n.halfHourFee || n.halfHourFee > n.fastestFee)
     throw new Error(
@@ -624,7 +624,7 @@ const ct = [
     name: "PeginSignaturesIncomplete",
     inputs: []
   }
-], K = {
+], N = {
   // 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
@@ -673,24 +673,24 @@ function xt(e) {
   if (i)
     return i[1];
 }
-function ss(e) {
+function os(e) {
   const t = xt(e);
   if (t) {
     const n = t.substring(0, 10);
-    return K[t] ?? K[n];
+    return N[t] ?? N[n];
   }
 }
-function rs(e) {
+function is(e) {
   const t = xt(e);
   if (t === void 0) return !1;
   const n = t.substring(0, 10);
-  return t in K || n in K;
+  return t in N || n in N;
 }
 function ut(e) {
   console.error("[Contract Error] Raw error:", e);
   const t = xt(e);
   if (console.error("[Contract Error] Extracted error data:", t), t) {
-    const s = t.substring(0, 10), r = K[t] ?? K[s];
+    const s = t.substring(0, 10), r = N[t] ?? N[s];
     if (r)
       throw console.error("[Contract Error] Known error:", r), new Error(r);
   }
@@ -708,24 +708,24 @@ function ut(e) {
   }
   throw e instanceof Error ? (console.error("[Contract Error] Unhandled error:", e.message), e) : new Error(`Contract call failed: ${String(e)}`);
 }
-function Ce(e, t, n, s) {
+function We(e, t, n, s) {
   const r = n == null ? void 0 : n[`${e}:${t}`];
   return r ? Promise.resolve({
     txid: e,
     vout: t,
     value: r.value,
     scriptPubKey: r.scriptPubKey
-  }) : Oe(e, t, s);
+  }) : _e(e, t, s);
 }
-const _e = 12e4;
-class os {
+const Re = 12e4;
+class as {
   /**
    * Creates a new PeginManager instance.
    *
    * @param config - Manager configuration including wallets and contract addresses
    */
   constructor(t) {
-    f(this, "config");
+    d(this, "config");
     this.config = t;
   }
   /**
@@ -749,7 +749,7 @@ class os {
    * @throws Error if wallet operations fail or insufficient funds
    */
   async preparePegin(t) {
-    const n = await this.config.btcWallet.getPublicKeyHex(), s = n.length === 66 ? n.slice(2) : n, r = D(t.vaultProviderBtcPubkey), o = t.vaultKeeperBtcPubkeys.map(D), i = t.universalChallengerBtcPubkeys.map(D);
+    const n = await this.config.btcWallet.getPublicKeyHex(), s = n.length === 66 ? n.slice(2) : n, r = $(t.vaultProviderBtcPubkey), o = t.vaultKeeperBtcPubkeys.map($), i = t.universalChallengerBtcPubkeys.map($);
     if (t.hashlocks.length !== t.amounts.length)
       throw new Error(
         `hashlocks.length (${t.hashlocks.length}) must equal amounts.length (${t.amounts.length})`
@@ -769,36 +769,36 @@ class os {
       councilQuorum: t.councilQuorum,
       councilSize: t.councilSize,
       network: this.config.btcNetwork
-    }, u = await xe(c), h = Ee(
+    }, u = await xe(c), h = Ae(
       [...t.availableUTXOs],
       u.totalOutputValue,
       t.mempoolFeeRate,
       ye(u.htlcValues.length)
-    ), l = pt(this.config.btcNetwork), d = we({
+    ), l = pt(this.config.btcNetwork), f = we({
       unfundedTxHex: u.psbtHex,
       selectedUTXOs: h.selectedUTXOs,
       changeAddress: t.changeAddress,
       changeAmount: h.changeAmount,
       network: l
-    }), g = D(St(d)), p = [], w = [], x = [];
-    for (let b = 0; b < t.hashlocks.length; b++) {
+    }), g = $(St(f)), b = [], w = [], x = [];
+    for (let p = 0; p < t.hashlocks.length; p++) {
       const P = await me({
         prePeginParams: c,
         timelockPegin: t.timelockPegin,
-        fundedPrePeginTxHex: d,
-        htlcVout: b
-      }), T = await Pe({
+        fundedPrePeginTxHex: f,
+        htlcVout: p
+      }), v = await Pe({
         peginTxHex: P.txHex,
-        fundedPrePeginTxHex: d,
+        fundedPrePeginTxHex: f,
         depositorPubkey: s,
         vaultProviderPubkey: r,
         vaultKeeperPubkeys: o,
         universalChallengerPubkeys: i,
-        hashlock: t.hashlocks[b],
+        hashlock: t.hashlocks[p],
         timelockRefund: t.timelockRefund,
         network: this.config.btcNetwork
       });
-      p.push(P), w.push(T.psbtHex), x.push(
+      b.push(P), w.push(v.psbtHex), x.push(
         bt(n, 1)
       );
     }
@@ -806,22 +806,22 @@ class os {
       w,
       x
     ), m = [];
-    for (let b = 0; b < y.length; b++) {
+    for (let p = 0; p < y.length; p++) {
       const P = Te(
-        y[b],
+        y[p],
         s
-      ), T = ve(y[b]);
+      ), v = ve(y[p]);
       m.push({
-        htlcVout: b,
-        htlcValue: u.htlcValues[b],
-        peginTxHex: T,
-        peginTxid: p[b].txid,
+        htlcVout: p,
+        htlcValue: u.htlcValues[p],
+        peginTxHex: v,
+        peginTxid: b[p].txid,
         peginInputSignature: P,
-        vaultScriptPubKey: p[b].vaultScriptPubKey
+        vaultScriptPubKey: b[p].vaultScriptPubKey
       });
     }
     return {
-      fundedPrePeginTxHex: d,
+      fundedPrePeginTxHex: f,
       prePeginTxid: g,
       unsignedPrePeginTxHex: u.psbtHex,
       perVault: m,
@@ -875,7 +875,7 @@ class os {
    * @throws Error if signing or broadcasting fails
    */
   async signAndBroadcast(t) {
-    const { fundedPrePeginTxHex: n, depositorBtcPubkey: s } = t, r = n.startsWith("0x") ? n.slice(2) : n, o = st.fromHex(r);
+    const { fundedPrePeginTxHex: n, depositorBtcPubkey: s } = t, r = n.startsWith("0x") ? n.slice(2) : n, o = q.fromHex(r);
     if (o.ins.length === 0)
       throw new Error("Transaction has no inputs");
     const i = new dt();
@@ -892,12 +892,12 @@ class os {
       );
     const u = this.config.mempoolApiUrl, h = o.ins.map((x) => {
       const y = S.from(x.hash).reverse().toString("hex"), m = x.index;
-      return Ce(y, m, t.localPrevouts, u).then(
-        (b) => ({ input: x, utxoData: b, txid: y, vout: m })
+      return We(y, m, t.localPrevouts, u).then(
+        (p) => ({ input: x, utxoData: p, txid: y, vout: m })
       );
     }), l = await Promise.all(h);
-    for (const { input: x, utxoData: y, txid: m, vout: b } of l) {
-      const P = Ae(
+    for (const { input: x, utxoData: y, txid: m, vout: p } of l) {
+      const P = $e(
         {
           value: y.value,
           scriptPubKey: y.scriptPubKey
@@ -916,7 +916,7 @@ class os {
         script: x.script,
         value: x.value
       });
-    const d = await this.config.btcWallet.signPsbt(i.toHex()), g = dt.fromHex(d);
+    const f = await this.config.btcWallet.signPsbt(i.toHex()), g = dt.fromHex(f);
     try {
       g.finalizeAllInputs();
     } catch (x) {
@@ -927,8 +927,8 @@ class os {
           `PSBT finalization failed and wallet did not auto-finalize: ${x}`
         );
     }
-    const p = g.extractTransaction().toHex();
-    return await Fe(p, u);
+    const b = g.extractTransaction().toHex();
+    return await Le(b, u);
   }
   /**
    * Registers a peg-in on Ethereum by calling the BTCVaultRegistry contract.
@@ -962,25 +962,28 @@ class os {
     } = t;
     if (!this.config.ethWallet.account)
       throw new Error("Ethereum wallet account not found");
-    const d = this.config.ethWallet.account.address, g = await this.resolvePopSignature(
-      d,
+    const f = this.config.ethWallet.account.address, g = await this.resolvePopSignature(
+      f,
       l
     );
     c && await c();
-    const p = at(n), w = at(s), x = at(r), y = await this.resolvePayoutScriptPubKey(
+    const b = z(n), w = z(s), x = z(r), y = await this.resolvePayoutScriptPubKey(
       u
-    ), m = St(x);
-    if (await this.checkVaultExists(m))
+    ), m = St(x), p = await Se(
+      $(m),
+      $(f)
+    ), P = z(p);
+    if (await this.checkVaultExists(P))
       throw new Error(
-        `Vault already exists for this transaction (ID: ${m}). Vault IDs are deterministically derived from the unsigned Bitcoin transaction, so using the same UTXOs and amount will always produce the same vault. To create a new vault, please use different UTXOs or a different amount to generate a unique transaction.`
+        `Vault already exists (ID: ${P}, peginTxHash: ${m}). 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 = It({
+    const T = It({
       chain: this.config.ethChain,
       transport: Et()
     });
-    let T;
+    let E;
     try {
-      T = await P.readContract({
+      E = await T.readContract({
         address: this.config.vaultContracts.btcVaultRegistry,
         abi: ct,
         functionName: "getPegInFee",
@@ -991,12 +994,12 @@ class os {
         "Failed to query pegin fee from the contract. Please check your network connection and that the contract address is correct."
       );
     }
-    const v = He({
+    const H = Ie({
       abi: ct,
       functionName: "submitPeginRequest",
       args: [
-        d,
-        p,
+        f,
+        b,
         g,
         w,
         x,
@@ -1007,41 +1010,42 @@ class os {
         h
       ]
     });
-    let E;
+    let I;
     try {
-      E = await P.estimateGas({
+      I = await T.estimateGas({
         to: this.config.vaultContracts.btcVaultRegistry,
-        data: v,
-        value: T,
+        data: H,
+        value: E,
         account: this.config.ethWallet.account.address
       });
-    } catch (U) {
-      ut(U);
+    } catch (O) {
+      ut(O);
     }
-    let k;
+    let F;
     try {
-      k = await this.config.ethWallet.sendTransaction({
+      F = await this.config.ethWallet.sendTransaction({
         to: this.config.vaultContracts.btcVaultRegistry,
-        data: v,
-        value: T,
+        data: H,
+        value: E,
         account: this.config.ethWallet.account,
         chain: this.config.ethChain,
-        gas: E
+        gas: I
       });
-    } catch (U) {
-      ut(U);
+    } catch (O) {
+      ut(O);
     }
-    const I = await P.waitForTransactionReceipt({
-      hash: k,
-      timeout: _e
+    const K = await T.waitForTransactionReceipt({
+      hash: F,
+      timeout: Re
     });
-    return I.status === "reverted" && ut(
+    return K.status === "reverted" && ut(
       new Error(
-        `Transaction reverted. Hash: ${k}. Check the transaction on block explorer for details.`
+        `Transaction reverted. Hash: ${F}. Check the transaction on block explorer for details.`
       )
     ), {
-      ethTxHash: I.transactionHash,
-      vaultId: m,
+      ethTxHash: K.transactionHash,
+      vaultId: P,
+      peginTxHash: m,
       btcPopSignature: g
     };
   }
@@ -1061,7 +1065,7 @@ class os {
         abi: ct,
         functionName: "getBTCVault",
         args: [t]
-      })).depositor !== Ie;
+      })).depositor !== Ee;
     } catch {
       return !1;
     }
@@ -1130,14 +1134,14 @@ class os {
     return this.config.vaultContracts.btcVaultRegistry;
   }
 }
-class is {
+class cs {
   /**
    * Creates a new PayoutManager instance.
    *
    * @param config - Manager configuration including wallet
    */
   constructor(t) {
-    f(this, "config");
+    d(this, "config");
     this.config = t;
   }
   /**
@@ -1163,6 +1167,10 @@ class is {
    * @throws Error if wallet operations fail or signature extraction fails
    */
   async signPayoutTransaction(t) {
+    this.validatePayoutOutputs(
+      t.payoutTxHex,
+      t.registeredPayoutScriptPubKey
+    );
     const n = await this.config.btcWallet.getPublicKeyHex(), { depositorPubkey: s } = vt(
       n,
       t.depositorBtcPubkey
@@ -1217,6 +1225,10 @@ class is {
       );
     const n = await this.config.btcWallet.getPublicKeyHex(), s = [], r = [], o = [];
     for (const c of t) {
+      this.validatePayoutOutputs(
+        c.payoutTxHex,
+        c.registeredPayoutScriptPubKey
+      );
       const { depositorPubkey: u } = vt(
         n,
         c.depositorBtcPubkey
@@ -1256,18 +1268,50 @@ class is {
     }
     return a;
   }
+  /**
+   * Validates that the payout transaction's largest output pays to the
+   * registered depositor payout address (scriptPubKey).
+   *
+   * This prevents two attack vectors from a malicious vault provider:
+   * 1. Substituting a completely different payout address
+   * 2. Including a dust output to the correct address while routing
+   *    the actual funds to an attacker-controlled address
+   *
+   * @param payoutTxHex - Raw payout transaction hex
+   * @param registeredPayoutScriptPubKey - On-chain registered scriptPubKey (hex, with or without 0x prefix)
+   * @throws Error if scriptPubKey is invalid hex
+   * @throws Error if the largest output does not pay to the registered address
+   */
+  validatePayoutOutputs(t, n) {
+    if (!He(n))
+      throw new Error(
+        "Invalid registeredPayoutScriptPubKey: not valid hex"
+      );
+    const s = S.from(
+      $(n),
+      "hex"
+    ), r = q.fromHex($(t));
+    if (r.outs.length === 0)
+      throw new Error("Payout transaction has no outputs");
+    if (!r.outs.reduce(
+      (i, a) => a.value > i.value ? a : i
+    ).script.equals(s))
+      throw new Error(
+        "Payout transaction does not pay to the registered depositor payout address"
+      );
+  }
 }
-function We(e) {
+function Ve(e) {
   return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
 }
-function _(e, t = "") {
+function R(e, t = "") {
   if (!Number.isSafeInteger(e) || e < 0) {
     const n = t && `"${t}" `;
     throw new Error(`${n}expected integer >= 0, got ${e}`);
   }
 }
-function W(e, t, n = "") {
-  const s = We(e), r = e == null ? void 0 : e.length, o = t !== void 0;
+function V(e, t, n = "") {
+  const s = Ve(e), r = e == null ? void 0 : e.length, o = t !== void 0;
   if (!s || o && r !== t) {
     const i = n && `"${n}" `, a = o ? ` of length ${t}` : "", c = s ? `length=${r}` : `type=${typeof e}`;
     throw new Error(i + "expected Uint8Array" + a + ", got " + c);
@@ -1277,60 +1321,60 @@ function W(e, t, n = "") {
 function Nt(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash must wrapped by utils.createHasher");
-  _(e.outputLen), _(e.blockLen);
+  R(e.outputLen), R(e.blockLen);
 }
-function M(e, t = !0) {
+function X(e, t = !0) {
   if (e.destroyed)
     throw new Error("Hash instance has been destroyed");
   if (t && e.finished)
     throw new Error("Hash#digest() has already been called");
 }
 function Xt(e, t) {
-  W(e, void 0, "digestInto() output");
+  V(e, void 0, "digestInto() output");
   const n = t.outputLen;
   if (e.length < n)
     throw new Error('"digestInto() output" expected to be of length >=' + n);
 }
-function Re(e) {
+function Ke(e) {
   return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
 }
 function A(...e) {
   for (let t = 0; t < e.length; t++)
     e[t].fill(0);
 }
-function et(e) {
+function rt(e) {
   return new DataView(e.buffer, e.byteOffset, e.byteLength);
 }
 function B(e, t) {
   return e << 32 - t | e >>> t;
 }
-function j(e, t) {
+function Z(e, t) {
   return e << t | e >>> 32 - t >>> 0;
 }
-const Ve = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-function De(e) {
+const De = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+function Me(e) {
   return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
 }
-function Ke(e) {
+function Ne(e) {
   for (let t = 0; t < e.length; t++)
-    e[t] = De(e[t]);
+    e[t] = Me(e[t]);
   return e;
 }
-const At = Ve ? (e) => e : Ke;
-function Me(e) {
+const At = De ? (e) => e : Ne;
+function Xe(e) {
   if (typeof e != "string")
     throw new Error("string expected");
   return new Uint8Array(new TextEncoder().encode(e));
 }
 function Bt(e, t = "") {
-  return typeof e == "string" ? Me(e) : W(e, void 0, t);
+  return typeof e == "string" ? Xe(e) : V(e, void 0, t);
 }
-function Ne(e, t) {
+function Ge(e, t) {
   if (t !== void 0 && {}.toString.call(t) !== "[object Object]")
     throw new Error("options must be object or undefined");
   return Object.assign(e, t);
 }
-function rt(e, t = {}) {
+function it(e, t = {}) {
   const n = (r, o) => e(o).update(r).digest(), s = e(void 0);
   return n.outputLen = s.outputLen, n.blockLen = s.blockLen, n.create = (r) => e(r), Object.assign(n, t), Object.freeze(n);
 }
@@ -1339,13 +1383,13 @@ const Gt = (e) => ({
 });
 class jt {
   constructor(t, n) {
-    f(this, "oHash");
-    f(this, "iHash");
-    f(this, "blockLen");
-    f(this, "outputLen");
-    f(this, "finished", !1);
-    f(this, "destroyed", !1);
-    if (Nt(t), W(n, void 0, "key"), this.iHash = t.create(), typeof this.iHash.update != "function")
+    d(this, "oHash");
+    d(this, "iHash");
+    d(this, "blockLen");
+    d(this, "outputLen");
+    d(this, "finished", !1);
+    d(this, "destroyed", !1);
+    if (Nt(t), V(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, r = new Uint8Array(s);
@@ -1358,10 +1402,10 @@ class jt {
     this.oHash.update(r), A(r);
   }
   update(t) {
-    return M(this), this.iHash.update(t), this;
+    return X(this), this.iHash.update(t), this;
   }
   digestInto(t) {
-    M(this), W(t, this.outputLen, "output"), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
+    X(this), V(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);
@@ -1381,34 +1425,34 @@ class jt {
 }
 const yt = (e, t, n) => new jt(e, t).update(n).digest();
 yt.create = (e, t) => new jt(e, t);
-function Xe(e, t, n) {
+function je(e, t, n) {
   return e & t ^ ~e & n;
 }
-function Ge(e, t, n) {
+function qe(e, t, n) {
   return e & t ^ e & n ^ t & n;
 }
 class wt {
   constructor(t, n, s, r) {
-    f(this, "blockLen");
-    f(this, "outputLen");
-    f(this, "padOffset");
-    f(this, "isLE");
+    d(this, "blockLen");
+    d(this, "outputLen");
+    d(this, "padOffset");
+    d(this, "isLE");
     // For partial updates less than block size
-    f(this, "buffer");
-    f(this, "view");
-    f(this, "finished", !1);
-    f(this, "length", 0);
-    f(this, "pos", 0);
-    f(this, "destroyed", !1);
-    this.blockLen = t, this.outputLen = n, this.padOffset = s, this.isLE = r, this.buffer = new Uint8Array(t), this.view = et(this.buffer);
+    d(this, "buffer");
+    d(this, "view");
+    d(this, "finished", !1);
+    d(this, "length", 0);
+    d(this, "pos", 0);
+    d(this, "destroyed", !1);
+    this.blockLen = t, this.outputLen = n, this.padOffset = s, this.isLE = r, this.buffer = new Uint8Array(t), this.view = rt(this.buffer);
   }
   update(t) {
-    M(this), W(t);
+    X(this), V(t);
     const { view: n, buffer: s, blockLen: r } = this, o = t.length;
     for (let i = 0; i < o; ) {
       const a = Math.min(r - this.pos, o - i);
       if (a === r) {
-        const c = et(t);
+        const c = rt(t);
         for (; r <= o - i; i += r)
           this.process(c, i);
         continue;
@@ -1418,14 +1462,14 @@ class wt {
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
-    M(this), Xt(t, this), this.finished = !0;
+    X(this), Xt(t, this), this.finished = !0;
     const { buffer: n, view: s, blockLen: r, isLE: o } = this;
     let { pos: i } = this;
     n[i++] = 128, A(this.buffer.subarray(i)), this.padOffset > r - i && (this.process(s, 0), i = 0);
     for (let l = i; l < r; l++)
       n[l] = 0;
     s.setBigUint64(r - 8, BigInt(this.length * 8), o), this.process(s, 0);
-    const a = et(t), c = this.outputLen;
+    const a = rt(t), c = this.outputLen;
     if (c % 4)
       throw new Error("_sha2: outputLen must be aligned to 32bit");
     const u = c / 4, h = this.get();
@@ -1449,7 +1493,7 @@ class wt {
     return this._cloneInto();
   }
 }
-const F = /* @__PURE__ */ Uint32Array.from([
+const L = /* @__PURE__ */ Uint32Array.from([
   1779033703,
   3144134277,
   1013904242,
@@ -1458,7 +1502,7 @@ const F = /* @__PURE__ */ Uint32Array.from([
   2600822924,
   528734635,
   1541459225
-]), H = /* @__PURE__ */ Uint32Array.from([
+]), k = /* @__PURE__ */ Uint32Array.from([
   1779033703,
   4089235720,
   3144134277,
@@ -1475,7 +1519,7 @@ const F = /* @__PURE__ */ Uint32Array.from([
   4215389547,
   1541459225,
   327033209
-]), je = /* @__PURE__ */ Uint8Array.from([
+]), ze = /* @__PURE__ */ Uint8Array.from([
   7,
   4,
   13,
@@ -1492,11 +1536,11 @@ const F = /* @__PURE__ */ Uint32Array.from([
   14,
   11,
   8
-]), qt = Uint8Array.from(new Array(16).fill(0).map((e, t) => t)), qe = qt.map((e) => (9 * e + 5) % 16), zt = /* @__PURE__ */ (() => {
-  const n = [[qt], [qe]];
+]), qt = Uint8Array.from(new Array(16).fill(0).map((e, t) => t)), Ze = qt.map((e) => (9 * e + 5) % 16), zt = /* @__PURE__ */ (() => {
+  const n = [[qt], [Ze]];
   for (let s = 0; s < 4; s++)
     for (let r of n)
-      r.push(r[s].map((o) => je[o]));
+      r.push(r[s].map((o) => ze[o]));
   return n;
 })(), Zt = zt[0], Jt = zt[1], Yt = /* @__PURE__ */ [
   [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],
@@ -1504,13 +1548,13 @@ const F = /* @__PURE__ */ Uint32Array.from([
   [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)), ze = /* @__PURE__ */ Zt.map((e, t) => e.map((n) => Yt[t][n])), Ze = /* @__PURE__ */ Jt.map((e, t) => e.map((n) => Yt[t][n])), Je = /* @__PURE__ */ Uint32Array.from([
+].map((e) => Uint8Array.from(e)), Je = /* @__PURE__ */ Zt.map((e, t) => e.map((n) => Yt[t][n])), Ye = /* @__PURE__ */ Jt.map((e, t) => e.map((n) => Yt[t][n])), Qe = /* @__PURE__ */ Uint32Array.from([
   0,
   1518500249,
   1859775393,
   2400959708,
   2840853838
-]), Ye = /* @__PURE__ */ Uint32Array.from([
+]), tn = /* @__PURE__ */ Uint32Array.from([
   1352829926,
   1548603684,
   1836072691,
@@ -1520,15 +1564,15 @@ const F = /* @__PURE__ */ Uint32Array.from([
 function $t(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 q = /* @__PURE__ */ new Uint32Array(16);
-class Qe extends wt {
+const J = /* @__PURE__ */ new Uint32Array(16);
+class en extends wt {
   constructor() {
     super(64, 20, 8, !0);
-    f(this, "h0", 1732584193);
-    f(this, "h1", -271733879);
-    f(this, "h2", -1732584194);
-    f(this, "h3", 271733878);
-    f(this, "h4", -1009589776);
+    d(this, "h0", 1732584193);
+    d(this, "h1", -271733879);
+    d(this, "h2", -1732584194);
+    d(this, "h3", 271733878);
+    d(this, "h4", -1009589776);
   }
   get() {
     const { h0: n, h1: s, h2: r, h3: o, h4: i } = this;
@@ -1538,48 +1582,48 @@ class Qe extends wt {
     this.h0 = n | 0, this.h1 = s | 0, this.h2 = r | 0, this.h3 = o | 0, this.h4 = i | 0;
   }
   process(n, s) {
-    for (let p = 0; p < 16; p++, s += 4)
-      q[p] = n.getUint32(s, !0);
-    let r = this.h0 | 0, o = r, i = this.h1 | 0, a = i, c = this.h2 | 0, u = c, h = this.h3 | 0, l = h, d = this.h4 | 0, g = d;
-    for (let p = 0; p < 5; p++) {
-      const w = 4 - p, x = Je[p], y = Ye[p], m = Zt[p], b = Jt[p], P = ze[p], T = Ze[p];
-      for (let v = 0; v < 16; v++) {
-        const E = j(r + $t(p, i, c, h) + q[m[v]] + x, P[v]) + d | 0;
-        r = d, d = h, h = j(c, 10) | 0, c = i, i = E;
+    for (let b = 0; b < 16; b++, s += 4)
+      J[b] = n.getUint32(s, !0);
+    let r = this.h0 | 0, o = r, i = this.h1 | 0, a = i, c = this.h2 | 0, u = c, h = this.h3 | 0, l = h, f = this.h4 | 0, g = f;
+    for (let b = 0; b < 5; b++) {
+      const w = 4 - b, x = Qe[b], y = tn[b], m = Zt[b], p = Jt[b], P = Je[b], v = Ye[b];
+      for (let T = 0; T < 16; T++) {
+        const E = Z(r + $t(b, i, c, h) + J[m[T]] + x, P[T]) + f | 0;
+        r = f, f = h, h = Z(c, 10) | 0, c = i, i = E;
       }
-      for (let v = 0; v < 16; v++) {
-        const E = j(o + $t(w, a, u, l) + q[b[v]] + y, T[v]) + g | 0;
-        o = g, g = l, l = j(u, 10) | 0, u = a, a = E;
+      for (let T = 0; T < 16; T++) {
+        const E = Z(o + $t(w, a, u, l) + J[p[T]] + y, v[T]) + g | 0;
+        o = g, g = l, l = Z(u, 10) | 0, u = a, a = E;
       }
     }
-    this.set(this.h1 + c + l | 0, this.h2 + h + g | 0, this.h3 + d + o | 0, this.h4 + r + a | 0, this.h0 + i + u | 0);
+    this.set(this.h1 + c + l | 0, this.h2 + h + g | 0, this.h3 + f + o | 0, this.h4 + r + a | 0, this.h0 + i + u | 0);
   }
   roundClean() {
-    A(q);
+    A(J);
   }
   destroy() {
     this.destroyed = !0, A(this.buffer), this.set(0, 0, 0, 0, 0);
   }
 }
-const tn = /* @__PURE__ */ rt(() => new Qe()), z = /* @__PURE__ */ BigInt(2 ** 32 - 1), Ut = /* @__PURE__ */ BigInt(32);
-function en(e, t = !1) {
-  return t ? { h: Number(e & z), l: Number(e >> Ut & z) } : { h: Number(e >> Ut & z) | 0, l: Number(e & z) | 0 };
+const nn = /* @__PURE__ */ it(() => new en()), Y = /* @__PURE__ */ BigInt(2 ** 32 - 1), Ut = /* @__PURE__ */ BigInt(32);
+function sn(e, t = !1) {
+  return t ? { h: Number(e & Y), l: Number(e >> Ut & Y) } : { h: Number(e >> Ut & Y) | 0, l: Number(e & Y) | 0 };
 }
 function Qt(e, t = !1) {
   const n = e.length;
   let s = new Uint32Array(n), r = new Uint32Array(n);
   for (let o = 0; o < n; o++) {
-    const { h: i, l: a } = en(e[o], t);
+    const { h: i, l: a } = sn(e[o], t);
     [s[o], r[o]] = [i, a];
   }
   return [s, r];
 }
-const Ft = (e, t, n) => e >>> n, Lt = (e, t, n) => e << 32 - n | t >>> n, R = (e, t, n) => e >>> n | t << 32 - n, V = (e, t, n) => e << 32 - n | t >>> n, Z = (e, t, n) => e << 64 - n | t >>> n - 32, J = (e, t, n) => e >>> n - 32 | t << 64 - n, nn = (e, t, n) => e << n | t >>> 32 - n, sn = (e, t, n) => t << n | e >>> 32 - n, rn = (e, t, n) => t << n - 32 | e >>> 64 - n, on = (e, t, n) => e << n - 32 | t >>> 64 - n;
-function $(e, t, n, s) {
+const Ft = (e, t, n) => e >>> n, Ot = (e, t, n) => e << 32 - n | t >>> n, D = (e, t, n) => e >>> n | t << 32 - n, M = (e, t, n) => e << 32 - n | t >>> n, Q = (e, t, n) => e << 64 - n | t >>> n - 32, tt = (e, t, n) => e >>> n - 32 | t << 64 - n, rn = (e, t, n) => e << n | t >>> 32 - n, on = (e, t, n) => t << n | e >>> 32 - n, an = (e, t, n) => t << n - 32 | e >>> 64 - n, cn = (e, t, n) => e << n - 32 | t >>> 64 - n;
+function U(e, t, n, s) {
   const r = (t >>> 0) + (s >>> 0);
   return { h: e + n + (r / 2 ** 32 | 0) | 0, l: r | 0 };
 }
-const an = (e, t, n) => (e >>> 0) + (t >>> 0) + (n >>> 0), cn = (e, t, n, s) => t + n + s + (e / 2 ** 32 | 0) | 0, un = (e, t, n, s) => (e >>> 0) + (t >>> 0) + (n >>> 0) + (s >>> 0), ln = (e, t, n, s, r) => t + n + s + r + (e / 2 ** 32 | 0) | 0, hn = (e, t, n, s, r) => (e >>> 0) + (t >>> 0) + (n >>> 0) + (s >>> 0) + (r >>> 0), fn = (e, t, n, s, r, o) => t + n + s + r + o + (e / 2 ** 32 | 0) | 0, dn = /* @__PURE__ */ Uint32Array.from([
+const un = (e, t, n) => (e >>> 0) + (t >>> 0) + (n >>> 0), ln = (e, t, n, s) => t + n + s + (e / 2 ** 32 | 0) | 0, hn = (e, t, n, s) => (e >>> 0) + (t >>> 0) + (n >>> 0) + (s >>> 0), fn = (e, t, n, s, r) => t + n + s + r + (e / 2 ** 32 | 0) | 0, dn = (e, t, n, s, r) => (e >>> 0) + (t >>> 0) + (n >>> 0) + (s >>> 0) + (r >>> 0), pn = (e, t, n, s, r, o) => t + n + s + r + o + (e / 2 ** 32 | 0) | 0, bn = /* @__PURE__ */ Uint32Array.from([
   1116352408,
   1899447441,
   3049323471,
@@ -1644,8 +1688,8 @@ const an = (e, t, n) => (e >>> 0) + (t >>> 0) + (n >>> 0), cn = (e, t, n, s) =>
   2756734187,
   3204031479,
   3329325298
-]), L = /* @__PURE__ */ new Uint32Array(64);
-class pn extends wt {
+]), C = /* @__PURE__ */ new Uint32Array(64);
+class gn extends wt {
   constructor(t) {
     super(64, t, 8, !1);
   }
@@ -1659,38 +1703,38 @@ class pn extends wt {
   }
   process(t, n) {
     for (let l = 0; l < 16; l++, n += 4)
-      L[l] = t.getUint32(n, !1);
+      C[l] = t.getUint32(n, !1);
     for (let l = 16; l < 64; l++) {
-      const d = L[l - 15], g = L[l - 2], p = B(d, 7) ^ B(d, 18) ^ d >>> 3, w = B(g, 17) ^ B(g, 19) ^ g >>> 10;
-      L[l] = w + L[l - 7] + p + L[l - 16] | 0;
+      const f = C[l - 15], g = C[l - 2], b = B(f, 7) ^ B(f, 18) ^ f >>> 3, w = B(g, 17) ^ B(g, 19) ^ g >>> 10;
+      C[l] = w + C[l - 7] + b + C[l - 16] | 0;
     }
     let { A: s, B: r, C: o, D: i, E: a, F: c, G: u, H: h } = this;
     for (let l = 0; l < 64; l++) {
-      const d = B(a, 6) ^ B(a, 11) ^ B(a, 25), g = h + d + Xe(a, c, u) + dn[l] + L[l] | 0, w = (B(s, 2) ^ B(s, 13) ^ B(s, 22)) + Ge(s, r, o) | 0;
+      const f = B(a, 6) ^ B(a, 11) ^ B(a, 25), g = h + f + je(a, c, u) + bn[l] + C[l] | 0, w = (B(s, 2) ^ B(s, 13) ^ B(s, 22)) + qe(s, r, o) | 0;
       h = u, u = c, c = a, a = i + g | 0, i = o, o = r, r = s, s = g + w | 0;
     }
     s = s + this.A | 0, r = r + this.B | 0, o = o + this.C | 0, i = i + this.D | 0, a = a + this.E | 0, c = c + this.F | 0, u = u + this.G | 0, h = h + this.H | 0, this.set(s, r, o, i, a, c, u, h);
   }
   roundClean() {
-    A(L);
+    A(C);
   }
   destroy() {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), A(this.buffer);
   }
 }
-class bn extends pn {
+class xn extends gn {
   constructor() {
     super(32);
     // We cannot use array here since array allows indexing by variable
     // which means optimizer/compiler cannot use registers.
-    f(this, "A", F[0] | 0);
-    f(this, "B", F[1] | 0);
-    f(this, "C", F[2] | 0);
-    f(this, "D", F[3] | 0);
-    f(this, "E", F[4] | 0);
-    f(this, "F", F[5] | 0);
-    f(this, "G", F[6] | 0);
-    f(this, "H", F[7] | 0);
+    d(this, "A", L[0] | 0);
+    d(this, "B", L[1] | 0);
+    d(this, "C", L[2] | 0);
+    d(this, "D", L[3] | 0);
+    d(this, "E", L[4] | 0);
+    d(this, "F", L[5] | 0);
+    d(this, "G", L[6] | 0);
+    d(this, "H", L[7] | 0);
   }
 }
 const te = Qt([
@@ -1774,92 +1818,92 @@ const te = Qt([
   "0x597f299cfc657e2a",
   "0x5fcb6fab3ad6faec",
   "0x6c44198c4a475817"
-].map((e) => BigInt(e))), gn = te[0], xn = te[1], O = /* @__PURE__ */ new Uint32Array(80), C = /* @__PURE__ */ new Uint32Array(80);
-class yn extends wt {
+].map((e) => BigInt(e))), yn = te[0], wn = te[1], _ = /* @__PURE__ */ new Uint32Array(80), W = /* @__PURE__ */ new Uint32Array(80);
+class mn extends wt {
   constructor(t) {
     super(128, t, 16, !1);
   }
   // prettier-ignore
   get() {
-    const { Ah: t, Al: n, Bh: s, Bl: r, Ch: o, Cl: i, Dh: a, Dl: c, Eh: u, El: h, Fh: l, Fl: d, Gh: g, Gl: p, Hh: w, Hl: x } = this;
-    return [t, n, s, r, o, i, a, c, u, h, l, d, g, p, w, x];
+    const { Ah: t, Al: n, Bh: s, Bl: r, Ch: o, Cl: i, Dh: a, Dl: c, Eh: u, El: h, Fh: l, Fl: f, Gh: g, Gl: b, Hh: w, Hl: x } = this;
+    return [t, n, s, r, o, i, a, c, u, h, l, f, g, b, w, x];
   }
   // prettier-ignore
-  set(t, n, s, r, o, i, a, c, u, h, l, d, g, p, w, x) {
-    this.Ah = t | 0, this.Al = n | 0, this.Bh = s | 0, this.Bl = r | 0, this.Ch = o | 0, this.Cl = i | 0, this.Dh = a | 0, this.Dl = c | 0, this.Eh = u | 0, this.El = h | 0, this.Fh = l | 0, this.Fl = d | 0, this.Gh = g | 0, this.Gl = p | 0, this.Hh = w | 0, this.Hl = x | 0;
+  set(t, n, s, r, o, i, a, c, u, h, l, f, g, b, w, x) {
+    this.Ah = t | 0, this.Al = n | 0, this.Bh = s | 0, this.Bl = r | 0, this.Ch = o | 0, this.Cl = i | 0, this.Dh = a | 0, this.Dl = c | 0, this.Eh = u | 0, this.El = h | 0, this.Fh = l | 0, this.Fl = f | 0, this.Gh = g | 0, this.Gl = b | 0, this.Hh = w | 0, this.Hl = x | 0;
   }
   process(t, n) {
-    for (let b = 0; b < 16; b++, n += 4)
-      O[b] = t.getUint32(n), C[b] = t.getUint32(n += 4);
-    for (let b = 16; b < 80; b++) {
-      const P = O[b - 15] | 0, T = C[b - 15] | 0, v = R(P, T, 1) ^ R(P, T, 8) ^ Ft(P, T, 7), E = V(P, T, 1) ^ V(P, T, 8) ^ Lt(P, T, 7), k = O[b - 2] | 0, I = C[b - 2] | 0, U = R(k, I, 19) ^ Z(k, I, 61) ^ Ft(k, I, 6), ot = V(k, I, 19) ^ J(k, I, 61) ^ Lt(k, I, 6), G = un(E, ot, C[b - 7], C[b - 16]), it = ln(G, v, U, O[b - 7], O[b - 16]);
-      O[b] = it | 0, C[b] = G | 0;
+    for (let p = 0; p < 16; p++, n += 4)
+      _[p] = t.getUint32(n), W[p] = t.getUint32(n += 4);
+    for (let p = 16; p < 80; p++) {
+      const P = _[p - 15] | 0, v = W[p - 15] | 0, T = D(P, v, 1) ^ D(P, v, 8) ^ Ft(P, v, 7), E = M(P, v, 1) ^ M(P, v, 8) ^ Ot(P, v, 7), H = _[p - 2] | 0, I = W[p - 2] | 0, F = D(H, I, 19) ^ Q(H, I, 61) ^ Ft(H, I, 6), K = M(H, I, 19) ^ tt(H, I, 61) ^ Ot(H, I, 6), O = hn(E, K, W[p - 7], W[p - 16]), at = fn(O, T, F, _[p - 7], _[p - 16]);
+      _[p] = at | 0, W[p] = O | 0;
     }
-    let { Ah: s, Al: r, Bh: o, Bl: i, Ch: a, Cl: c, Dh: u, Dl: h, Eh: l, El: d, Fh: g, Fl: p, Gh: w, Gl: x, Hh: y, Hl: m } = this;
-    for (let b = 0; b < 80; b++) {
-      const P = R(l, d, 14) ^ R(l, d, 18) ^ Z(l, d, 41), T = V(l, d, 14) ^ V(l, d, 18) ^ J(l, d, 41), v = l & g ^ ~l & w, E = d & p ^ ~d & x, k = hn(m, T, E, xn[b], C[b]), I = fn(k, y, P, v, gn[b], O[b]), U = k | 0, ot = R(s, r, 28) ^ Z(s, r, 34) ^ Z(s, r, 39), G = V(s, r, 28) ^ J(s, r, 34) ^ J(s, r, 39), it = s & o ^ s & a ^ o & a, ae = r & i ^ r & c ^ i & c;
-      y = w | 0, m = x | 0, w = g | 0, x = p | 0, g = l | 0, p = d | 0, { h: l, l: d } = $(u | 0, h | 0, I | 0, U | 0), u = a | 0, h = c | 0, a = o | 0, c = i | 0, o = s | 0, i = r | 0;
-      const Pt = an(U, G, ae);
-      s = cn(Pt, I, ot, it), r = Pt | 0;
+    let { Ah: s, Al: r, Bh: o, Bl: i, Ch: a, Cl: c, Dh: u, Dl: h, Eh: l, El: f, Fh: g, Fl: b, Gh: w, Gl: x, Hh: y, Hl: m } = this;
+    for (let p = 0; p < 80; p++) {
+      const P = D(l, f, 14) ^ D(l, f, 18) ^ Q(l, f, 41), v = M(l, f, 14) ^ M(l, f, 18) ^ tt(l, f, 41), T = l & g ^ ~l & w, E = f & b ^ ~f & x, H = dn(m, v, E, wn[p], W[p]), I = pn(H, y, P, T, yn[p], _[p]), F = H | 0, K = D(s, r, 28) ^ Q(s, r, 34) ^ Q(s, r, 39), O = M(s, r, 28) ^ tt(s, r, 34) ^ tt(s, r, 39), at = s & o ^ s & a ^ o & a, ae = r & i ^ r & c ^ i & c;
+      y = w | 0, m = x | 0, w = g | 0, x = b | 0, g = l | 0, b = f | 0, { h: l, l: f } = U(u | 0, h | 0, I | 0, F | 0), u = a | 0, h = c | 0, a = o | 0, c = i | 0, o = s | 0, i = r | 0;
+      const Pt = un(F, O, ae);
+      s = ln(Pt, I, K, at), r = Pt | 0;
     }
-    ({ h: s, l: r } = $(this.Ah | 0, this.Al | 0, s | 0, r | 0)), { h: o, l: i } = $(this.Bh | 0, this.Bl | 0, o | 0, i | 0), { h: a, l: c } = $(this.Ch | 0, this.Cl | 0, a | 0, c | 0), { h: u, l: h } = $(this.Dh | 0, this.Dl | 0, u | 0, h | 0), { h: l, l: d } = $(this.Eh | 0, this.El | 0, l | 0, d | 0), { h: g, l: p } = $(this.Fh | 0, this.Fl | 0, g | 0, p | 0), { h: w, l: x } = $(this.Gh | 0, this.Gl | 0, w | 0, x | 0), { h: y, l: m } = $(this.Hh | 0, this.Hl | 0, y | 0, m | 0), this.set(s, r, o, i, a, c, u, h, l, d, g, p, w, x, y, m);
+    ({ h: s, l: r } = U(this.Ah | 0, this.Al | 0, s | 0, r | 0)), { h: o, l: i } = U(this.Bh | 0, this.Bl | 0, o | 0, i | 0), { h: a, l: c } = U(this.Ch | 0, this.Cl | 0, a | 0, c | 0), { h: u, l: h } = U(this.Dh | 0, this.Dl | 0, u | 0, h | 0), { h: l, l: f } = U(this.Eh | 0, this.El | 0, l | 0, f | 0), { h: g, l: b } = U(this.Fh | 0, this.Fl | 0, g | 0, b | 0), { h: w, l: x } = U(this.Gh | 0, this.Gl | 0, w | 0, x | 0), { h: y, l: m } = U(this.Hh | 0, this.Hl | 0, y | 0, m | 0), this.set(s, r, o, i, a, c, u, h, l, f, g, b, w, x, y, m);
   }
   roundClean() {
-    A(O, C);
+    A(_, W);
   }
   destroy() {
     A(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
   }
 }
-class wn extends yn {
+class Pn extends mn {
   constructor() {
     super(64);
-    f(this, "Ah", H[0] | 0);
-    f(this, "Al", H[1] | 0);
-    f(this, "Bh", H[2] | 0);
-    f(this, "Bl", H[3] | 0);
-    f(this, "Ch", H[4] | 0);
-    f(this, "Cl", H[5] | 0);
-    f(this, "Dh", H[6] | 0);
-    f(this, "Dl", H[7] | 0);
-    f(this, "Eh", H[8] | 0);
-    f(this, "El", H[9] | 0);
-    f(this, "Fh", H[10] | 0);
-    f(this, "Fl", H[11] | 0);
-    f(this, "Gh", H[12] | 0);
-    f(this, "Gl", H[13] | 0);
-    f(this, "Hh", H[14] | 0);
-    f(this, "Hl", H[15] | 0);
-  }
-}
-const mn = /* @__PURE__ */ rt(
-  () => new bn(),
+    d(this, "Ah", k[0] | 0);
+    d(this, "Al", k[1] | 0);
+    d(this, "Bh", k[2] | 0);
+    d(this, "Bl", k[3] | 0);
+    d(this, "Ch", k[4] | 0);
+    d(this, "Cl", k[5] | 0);
+    d(this, "Dh", k[6] | 0);
+    d(this, "Dl", k[7] | 0);
+    d(this, "Eh", k[8] | 0);
+    d(this, "El", k[9] | 0);
+    d(this, "Fh", k[10] | 0);
+    d(this, "Fl", k[11] | 0);
+    d(this, "Gh", k[12] | 0);
+    d(this, "Gl", k[13] | 0);
+    d(this, "Hh", k[14] | 0);
+    d(this, "Hl", k[15] | 0);
+  }
+}
+const Tn = /* @__PURE__ */ it(
+  () => new xn(),
   /* @__PURE__ */ Gt(1)
-), ee = /* @__PURE__ */ rt(
-  () => new wn(),
+), ee = /* @__PURE__ */ it(
+  () => new Pn(),
   /* @__PURE__ */ Gt(3)
-), Pn = BigInt(0), N = BigInt(1), Tn = BigInt(2), vn = BigInt(7), kn = BigInt(256), Hn = BigInt(113), ne = [], se = [], re = [];
-for (let e = 0, t = N, n = 1, s = 0; e < 24; e++) {
+), vn = BigInt(0), G = BigInt(1), kn = BigInt(2), Hn = BigInt(7), In = BigInt(256), En = BigInt(113), ne = [], se = [], re = [];
+for (let e = 0, t = G, n = 1, s = 0; e < 24; e++) {
   [n, s] = [s, (2 * n + 3 * s) % 5], ne.push(2 * (5 * s + n)), se.push((e + 1) * (e + 2) / 2 % 64);
-  let r = Pn;
+  let r = vn;
   for (let o = 0; o < 7; o++)
-    t = (t << N ^ (t >> vn) * Hn) % kn, t & Tn && (r ^= N << (N << BigInt(o)) - N);
+    t = (t << G ^ (t >> Hn) * En) % In, t & kn && (r ^= G << (G << BigInt(o)) - G);
   re.push(r);
 }
-const oe = Qt(re, !0), In = oe[0], En = oe[1], Ot = (e, t, n) => n > 32 ? rn(e, t, n) : nn(e, t, n), Ct = (e, t, n) => n > 32 ? on(e, t, n) : sn(e, t, n);
-function Sn(e, t = 24) {
+const oe = Qt(re, !0), Sn = oe[0], An = oe[1], Lt = (e, t, n) => n > 32 ? an(e, t, n) : rn(e, t, n), Ct = (e, t, n) => n > 32 ? cn(e, t, n) : on(e, t, n);
+function Bn(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, c = (i + 2) % 10, u = n[c], h = n[c + 1], l = Ot(u, h, 1) ^ n[a], d = Ct(u, h, 1) ^ n[a + 1];
+      const a = (i + 8) % 10, c = (i + 2) % 10, u = n[c], h = n[c + 1], l = Lt(u, h, 1) ^ n[a], f = Ct(u, h, 1) ^ n[a + 1];
       for (let g = 0; g < 50; g += 10)
-        e[i + g] ^= l, e[i + g + 1] ^= d;
+        e[i + g] ^= l, e[i + g + 1] ^= f;
     }
     let r = e[2], o = e[3];
     for (let i = 0; i < 24; i++) {
-      const a = se[i], c = Ot(r, o, a), u = Ct(r, o, a), h = ne[i];
+      const a = se[i], c = Lt(r, o, a), u = Ct(r, o, a), h = ne[i];
       r = e[h], o = e[h + 1], e[h] = c, e[h + 1] = u;
     }
     for (let i = 0; i < 50; i += 10) {
@@ -1868,36 +1912,36 @@ function Sn(e, t = 24) {
       for (let a = 0; a < 10; a++)
         e[i + a] ^= ~n[(a + 2) % 10] & n[(a + 4) % 10];
     }
-    e[0] ^= In[s], e[1] ^= En[s];
+    e[0] ^= Sn[s], e[1] ^= An[s];
   }
   A(n);
 }
 class mt {
   // NOTE: we accept arguments in bytes instead of bits here.
   constructor(t, n, s, r = !1, o = 24) {
-    f(this, "state");
-    f(this, "pos", 0);
-    f(this, "posOut", 0);
-    f(this, "finished", !1);
-    f(this, "state32");
-    f(this, "destroyed", !1);
-    f(this, "blockLen");
-    f(this, "suffix");
-    f(this, "outputLen");
-    f(this, "enableXOF", !1);
-    f(this, "rounds");
-    if (this.blockLen = t, this.suffix = n, this.outputLen = s, this.enableXOF = r, this.rounds = o, _(s, "outputLen"), !(0 < t && t < 200))
+    d(this, "state");
+    d(this, "pos", 0);
+    d(this, "posOut", 0);
+    d(this, "finished", !1);
+    d(this, "state32");
+    d(this, "destroyed", !1);
+    d(this, "blockLen");
+    d(this, "suffix");
+    d(this, "outputLen");
+    d(this, "enableXOF", !1);
+    d(this, "rounds");
+    if (this.blockLen = t, this.suffix = n, this.outputLen = s, this.enableXOF = r, this.rounds = o, R(s, "outputLen"), !(0 < t && t < 200))
       throw new Error("only keccak-f1600 function is supported");
-    this.state = new Uint8Array(200), this.state32 = Re(this.state);
+    this.state = new Uint8Array(200), this.state32 = Ke(this.state);
   }
   clone() {
     return this._cloneInto();
   }
   keccak() {
-    At(this.state32), Sn(this.state32, this.rounds), At(this.state32), this.posOut = 0, this.pos = 0;
+    At(this.state32), Bn(this.state32, this.rounds), At(this.state32), this.posOut = 0, this.pos = 0;
   }
   update(t) {
-    M(this), W(t);
+    X(this), V(t);
     const { blockLen: n, state: s } = this, r = t.length;
     for (let o = 0; o < r; ) {
       const i = Math.min(n - this.pos, r - o);
@@ -1915,7 +1959,7 @@ class mt {
     t[s] ^= n, (n & 128) !== 0 && s === r - 1 && this.keccak(), t[r - 1] ^= 128, this.keccak();
   }
   writeInto(t) {
-    M(this, !1), W(t), this.finish();
+    X(this, !1), V(t), this.finish();
     const n = this.state, { blockLen: s } = this;
     for (let r = 0, o = t.length; r < o; ) {
       this.posOut >= s && this.keccak();
@@ -1930,7 +1974,7 @@ class mt {
     return this.writeInto(t);
   }
   xof(t) {
-    return _(t), this.xofInto(new Uint8Array(t));
+    return R(t), this.xofInto(new Uint8Array(t));
   }
   digestInto(t) {
     if (Xt(t, this), this.finished)
@@ -1948,50 +1992,50 @@ class mt {
     return t || (t = new mt(n, s, r, i, o)), t.state32.set(this.state32), t.pos = this.pos, t.posOut = this.posOut, t.finished = this.finished, t.rounds = o, t.suffix = s, t.outputLen = r, t.enableXOF = i, t.destroyed = this.destroyed, t;
   }
 }
-const An = (e, t, n, s = {}) => rt(() => new mt(t, e, n), s), Bn = /* @__PURE__ */ An(1, 136, 32);
-function $n(e, t, n, s) {
+const $n = (e, t, n, s = {}) => it(() => new mt(t, e, n), s), Un = /* @__PURE__ */ $n(1, 136, 32);
+function Fn(e, t, n, s) {
   Nt(e);
-  const r = Ne({ dkLen: 32, asyncTick: 10 }, s), { c: o, dkLen: i, asyncTick: a } = r;
-  if (_(o, "c"), _(i, "dkLen"), _(a, "asyncTick"), o < 1)
+  const r = Ge({ dkLen: 32, asyncTick: 10 }, s), { c: o, dkLen: i, asyncTick: a } = r;
+  if (R(o, "c"), R(i, "dkLen"), R(a, "asyncTick"), o < 1)
     throw new Error("iterations (c) must be >= 1");
-  const c = Bt(t, "password"), u = Bt(n, "salt"), h = new Uint8Array(i), l = yt.create(e, c), d = l._cloneInto().update(u);
-  return { c: o, dkLen: i, asyncTick: a, DK: h, PRF: l, PRFSalt: d };
+  const c = Bt(t, "password"), u = Bt(n, "salt"), h = new Uint8Array(i), l = yt.create(e, c), f = l._cloneInto().update(u);
+  return { c: o, dkLen: i, asyncTick: a, DK: h, PRF: l, PRFSalt: f };
 }
-function Un(e, t, n, s, r) {
+function On(e, t, n, s, r) {
   return e.destroy(), t.destroy(), s && s.destroy(), A(r), n;
 }
-function Fn(e, t, n, s) {
-  const { c: r, dkLen: o, DK: i, PRF: a, PRFSalt: c } = $n(e, t, n, s);
+function Ln(e, t, n, s) {
+  const { c: r, dkLen: o, DK: i, PRF: a, PRFSalt: c } = Fn(e, t, n, s);
   let u;
-  const h = new Uint8Array(4), l = et(h), d = new Uint8Array(a.outputLen);
-  for (let g = 1, p = 0; p < o; g++, p += a.outputLen) {
-    const w = i.subarray(p, p + a.outputLen);
-    l.setInt32(0, g, !1), (u = c._cloneInto(u)).update(h).digestInto(d), w.set(d.subarray(0, w.length));
+  const h = new Uint8Array(4), l = rt(h), f = new Uint8Array(a.outputLen);
+  for (let g = 1, b = 0; b < o; g++, b += a.outputLen) {
+    const w = i.subarray(b, b + a.outputLen);
+    l.setInt32(0, g, !1), (u = c._cloneInto(u)).update(h).digestInto(f), w.set(f.subarray(0, w.length));
     for (let x = 1; x < r; x++) {
-      a._cloneInto(u).update(d).digestInto(d);
+      a._cloneInto(u).update(f).digestInto(f);
       for (let y = 0; y < w.length; y++)
-        w[y] ^= d[y];
+        w[y] ^= f[y];
     }
   }
-  return Un(a, c, i, u, d);
+  return On(a, c, i, u, f);
 }
 function ie(e) {
   if (typeof e != "string")
     throw new TypeError("invalid mnemonic type: " + typeof e);
   return e.normalize("NFKD");
 }
-function Ln(e) {
+function Cn(e) {
   const t = ie(e), n = t.split(" ");
   if (![12, 15, 18, 21, 24].includes(n.length))
     throw new Error("Invalid mnemonic");
   return { nfkd: t, words: n };
 }
-const On = (e) => ie("mnemonic" + e);
-function Cn(e, t = "") {
-  return Fn(ee, Ln(e).nfkd, On(t), { c: 2048, dkLen: 64 });
+const _n = (e) => ie("mnemonic" + e);
+function Wn(e, t = "") {
+  return Ln(ee, Cn(e).nfkd, _n(t), { c: 2048, dkLen: 64 });
 }
-const _n = 508, _t = 16, Y = 32, Q = 64, Wt = 5, Wn = 4;
-function X(...e) {
+const Rn = 508, _t = 16, et = 32, nt = 64, Wt = 5, Vn = 4;
+function j(...e) {
   const t = e.reduce((r, o) => r + o.length, 0), n = new Uint8Array(t);
   let s = 0;
   for (const r of e)
@@ -2002,58 +2046,58 @@ function lt(e) {
   return new TextEncoder().encode(e);
 }
 function ht(e) {
-  const t = new Uint8Array(Wn);
-  return new DataView(t.buffer).setUint32(0, e.length, !1), X(t, e);
+  const t = new Uint8Array(Vn);
+  return new DataView(t.buffer).setUint32(0, e.length, !1), j(t, e);
 }
 function ft(e, t) {
   return yt(ee, e, t);
 }
 function Rt(e) {
-  return tn(mn(e));
+  return nn(Tn(e));
 }
 const gt = (e) => Array.from(e).map((t) => t.toString(16).padStart(2, "0")).join("");
-function Rn(e) {
-  const t = Cn(e), n = new Uint8Array(t);
+function Kn(e) {
+  const t = Wn(e), n = new Uint8Array(t);
   return t.fill(0), n;
 }
-async function Vn(e, t, n, s) {
-  if (e.length !== Q)
+async function Dn(e, t, n, s) {
+  if (e.length !== nt)
     throw new Error(
-      `WOTS seed must be ${Q} bytes, got ${e.length}`
+      `WOTS seed must be ${nt} bytes, got ${e.length}`
     );
-  t = D(t), n = D(n);
-  const r = e.slice(Y, Q), o = e.slice(0, Y), i = [r, o];
+  t = $(t), n = $(n);
+  const r = e.slice(et, nt), o = e.slice(0, et), i = [r, o];
   try {
-    const a = X(
+    const a = j(
       ht(lt(t)),
       ht(lt(n)),
       ht(lt(s))
-    ), c = X(o, a);
+    ), c = j(o, a);
     i.push(c);
     const u = ft(r, c);
     i.push(u);
-    const h = u.slice(0, Y), l = u.slice(Y, Q);
+    const h = u.slice(0, et), l = u.slice(et, nt);
     i.push(h, l);
-    const d = [], g = [], p = [], w = [];
+    const f = [], g = [], b = [], w = [];
     let x = !1;
     try {
-      for (let y = 0; y < _n; y++) {
+      for (let y = 0; y < Rn; y++) {
         const m = new Uint8Array(Wt);
         m[0] = 0, new DataView(m.buffer).setUint32(1, y, !1);
-        const b = new Uint8Array(Wt);
-        b[0] = 1, new DataView(b.buffer).setUint32(1, y, !1);
-        const P = X(h, m), T = X(h, b), v = ft(l, P), E = ft(l, T);
+        const p = new Uint8Array(Wt);
+        p[0] = 1, new DataView(p.buffer).setUint32(1, y, !1);
+        const P = j(h, m), v = j(h, p), T = ft(l, P), E = ft(l, v);
         try {
-          const k = v.slice(0, _t), I = E.slice(0, _t);
-          d.push(k), g.push(I), p.push(Rt(k)), w.push(Rt(I));
+          const H = T.slice(0, _t), I = E.slice(0, _t);
+          f.push(H), g.push(I), b.push(Rt(H)), w.push(Rt(I));
         } finally {
-          P.fill(0), T.fill(0), v.fill(0), E.fill(0);
+          P.fill(0), v.fill(0), T.fill(0), E.fill(0);
         }
       }
-      return x = !0, { falsePreimages: d, truePreimages: g, falseHashes: p, trueHashes: w };
+      return x = !0, { falsePreimages: f, truePreimages: g, falseHashes: b, trueHashes: w };
     } finally {
       if (!x) {
-        for (const y of d) y.fill(0);
+        for (const y of f) y.fill(0);
         for (const y of g) y.fill(0);
       }
     }
@@ -2062,13 +2106,13 @@ async function Vn(e, t, n, s) {
       a.fill(0);
   }
 }
-function as(e) {
+function us(e) {
   return {
     false_list: e.falseHashes.map(gt),
     true_list: e.trueHashes.map(gt)
   };
 }
-function Dn(e) {
+function Mn(e) {
   if (e.falseHashes.length === 0 || e.trueHashes.length === 0)
     throw new Error(
       "computeWotsPkHash: keypair hash arrays must not be empty"
@@ -2079,20 +2123,20 @@ function Dn(e) {
     s.set(i, r), r += t;
   for (const i of e.trueHashes)
     s.set(i, r), r += t;
-  const o = Bn(s);
+  const o = Un(s);
   return `0x${gt(o)}`;
 }
-async function cs(e, t, n, s) {
-  const r = Rn(e);
+async function ls(e, t, n, s) {
+  const r = Kn(e);
   try {
-    const o = await Vn(
+    const o = await Dn(
       r,
       t,
       n,
       s
     );
     try {
-      return Dn(o);
+      return Mn(o);
     } finally {
       for (const i of o.falsePreimages) i.fill(0);
       for (const i of o.truePreimages) i.fill(0);
@@ -2101,43 +2145,43 @@ async function cs(e, t, n, s) {
     r.fill(0);
   }
 }
-function us(e) {
+function hs(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");
 }
 export {
-  Dn as A,
-  tt as B,
-  K as C,
-  cs as D,
-  us as E,
-  Ue as M,
-  os as P,
-  qn as a,
-  Zn as b,
+  Mn as A,
+  st as B,
+  N as C,
+  ls as D,
+  hs as E,
+  Oe as M,
+  as as P,
+  Zn as a,
+  Yn as b,
   St as c,
-  Jn as d,
-  Se as e,
-  Ae as f,
-  zn as g,
+  Qn as d,
+  Be as e,
+  $e as f,
+  Jn as g,
   bt as h,
-  is as i,
-  es as j,
-  Qn as k,
-  ts as l,
-  ns as m,
-  Yn as n,
-  Le as o,
-  Oe as p,
-  Fe as q,
+  cs as i,
+  ss as j,
+  es as k,
+  ns as l,
+  rs as m,
+  ts as n,
+  Ce as o,
+  _e as p,
+  Le as q,
   ct as r,
-  Ee as s,
+  Ae as s,
   xt as t,
-  ss as u,
-  rs as v,
+  os as u,
+  is as v,
   ut as w,
-  Rn as x,
-  Vn as y,
-  as as z
+  Kn as x,
+  Dn as y,
+  us as z
 };
-//# sourceMappingURL=errors-ZoUEvcDE.js.map
+//# sourceMappingURL=errors-D19BQSaj.js.map