@babylonlabs-io/ts-sdk 0.16.0 → 0.16.1

package/dist/{errors-BEUjAw2k.js → errors-Ld-2tiK3.js}

@@ -1,13 +1,13 @@
-var he = Object.defineProperty;
-var de = (e, t, n) => t in e ? he(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
-var p = (e, t, n) => de(e, typeof t != "symbol" ? t + "" : t, n);
-import * as fe from "bitcoinjs-lib";
-import { script as pe, Transaction as gt, Psbt as vt } from "bitcoinjs-lib";
+var fe = Object.defineProperty;
+var pe = (e, t, n) => t in e ? fe(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
+var p = (e, t, n) => pe(e, typeof t != "symbol" ? t + "" : t, n);
+import * as ye from "bitcoinjs-lib";
+import { script as be, Transaction as xt, Psbt as kt } from "bitcoinjs-lib";
 import { Buffer as W } from "buffer";
-import { createPublicClient as ut, http as lt, encodeFunctionData as kt, zeroAddress as ye } from "viem";
-import { P as be, y as ge, D as Mt, M as Ht, B as xe, T as we, u as B, b as me, A as Pe, G as It, E as Te, a as ve, d as ke, e as He, f as Ie, s as C, H as Ee, q as Be, x as Et, h as Bt, i as St, r as Se } from "./challengeAssert-C5DQSUnp.js";
-import { deriveVaultId as At } from "@babylonlabs-io/babylon-tbv-rust-wasm";
-function Ae(e, t, n, s) {
+import { createPublicClient as lt, http as ht, encodeFunctionData as Ht, zeroAddress as ge } from "viem";
+import { P as xe, y as me, D as Xt, M as Et, B as we, T as Pe, u as S, b as Te, A as ve, G as It, E as ke, a as He, d as Ee, e as Ie, f as Se, s as C, H as Be, q as Ae, x as St, h as Bt, i as At, r as Ce } from "./challengeAssert-C5DQSUnp.js";
+import { deriveVaultId as Ct } from "@babylonlabs-io/babylon-tbv-rust-wasm";
+function Ue(e, t, n, s) {
   if (!Number.isInteger(s) || s < 1)
     throw new Error(
       `Invalid numOutputs: expected a positive integer, got ${s}`
@@ -16,7 +16,7 @@ function Ae(e, t, n, s) {
     throw new Error("Insufficient funds: no UTXOs available");
   const o = e.filter((l) => {
     const h = W.from(l.scriptPubKey, "hex");
-    return !!pe.decompile(h);
+    return !!be.decompile(h);
   });
   if (o.length === 0)
     throw new Error(
@@ -26,10 +26,10 @@ function Ae(e, t, n, s) {
   let a = 0n, c = 0n;
   for (const l of r) {
     i.push(l), a += BigInt(l.value);
-    const h = i.length * be, u = s * Ht, d = h + u + we;
-    if (c = BigInt(Math.ceil(d * n)) + BigInt(ge(n)), a - t - c > Mt) {
+    const h = i.length * xe, u = s * Et, d = h + u + Pe;
+    if (c = BigInt(Math.ceil(d * n)) + BigInt(me(n)), a - t - c > Xt) {
       const y = BigInt(
-        Math.ceil(Ht * n)
+        Math.ceil(Et * n)
       );
       c += y;
     }
@@ -47,18 +47,18 @@ function Ae(e, t, n, s) {
     `Insufficient funds: need ${t + c} sats (${t} pegin + ${c} fee), have ${a} sats`
   );
 }
-function Jn(e) {
-  return e > Mt;
+function Yn(e) {
+  return e > Xt;
 }
-function Yn() {
-  return xe;
+function ts() {
+  return we;
 }
-function ht(e) {
+function dt(e) {
   const t = e.startsWith("0x") ? e.slice(2) : e;
-  return `0x${gt.fromHex(t).getId()}`;
+  return `0x${xt.fromHex(t).getId()}`;
 }
 var ot = /* @__PURE__ */ ((e) => (e.P2PKH = "P2PKH", e.P2SH = "P2SH", e.P2WPKH = "P2WPKH", e.P2WSH = "P2WSH", e.P2TR = "P2TR", e.UNKNOWN = "UNKNOWN", e))(ot || {});
-function Ce(e) {
+function Fe(e) {
   const t = e.length;
   return t === 25 && e[0] === 118 && // OP_DUP
   e[1] === 169 && // OP_HASH160
@@ -71,8 +71,8 @@ function Ce(e) {
   e[1] === 32 ? "P2WSH" : t === 34 && e[0] === 81 && // OP_1
   e[1] === 32 ? "P2TR" : "UNKNOWN";
 }
-function Fe(e, t) {
-  const n = W.from(e.scriptPubKey, "hex"), s = Ce(n);
+function $e(e, t) {
+  const n = W.from(e.scriptPubKey, "hex"), s = Fe(n);
   switch (s) {
     case ot.P2WPKH:
       return {
@@ -110,7 +110,7 @@ function Fe(e, t) {
       throw new Error(`Unsupported script type: ${s}`);
   }
 }
-function yt(e, t) {
+function bt(e, t) {
   if (!Number.isInteger(t) || t < 1)
     throw new Error(`inputCount must be a positive integer, got ${t}`);
   return {
@@ -122,24 +122,43 @@ function yt(e, t) {
     }))
   };
 }
-const Ue = 21e6 * 1e8, Nt = 1e4;
-function Xt(e) {
-  return Number.isInteger(e) && e > 0 && e <= Ue;
+const Oe = 21e6 * 1e8, Ut = 3e4;
+async function at(e, t) {
+  const n = new AbortController(), s = setTimeout(
+    () => n.abort(),
+    Ut
+  ), o = [n.signal, t == null ? void 0 : t.signal].filter(
+    Boolean
+  );
+  try {
+    return await fetch(e, {
+      ...t,
+      signal: AbortSignal.any(o)
+    });
+  } catch (r) {
+    throw clearTimeout(s), r != null && typeof r == "object" && "name" in r && r.name === "AbortError" ? new Error(
+      `Mempool API request timed out after ${Ut}ms: ${e}`
+    ) : r;
+  }
+}
+const qt = 1e4;
+function Gt(e) {
+  return Number.isInteger(e) && e > 0 && e <= Oe;
 }
-function $e(e) {
-  return Number.isInteger(e) && e > 0 && e <= Nt;
+function Le(e) {
+  return Number.isInteger(e) && e > 0 && e <= qt;
 }
-function qt(e, t) {
+function jt(e, t) {
   return !Number.isInteger(e) || e < 0 ? !1 : t === void 0 || e < t;
 }
-const Oe = {
+const _e = {
   mainnet: "https://mempool.space/api",
   testnet: "https://mempool.space/testnet/api",
   signet: "https://mempool.space/signet/api"
 };
 async function it(e, t) {
   try {
-    const n = await fetch(e, t);
+    const n = await at(e, t);
     if (!n.ok) {
       const o = await n.text();
       throw new Error(
@@ -152,9 +171,9 @@ async function it(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 Le(e, t) {
+async function Re(e, t) {
   try {
-    const n = await fetch(`${t}/tx`, {
+    const n = await at(`${t}/tx`, {
       method: "POST",
       body: e,
       headers: {
@@ -178,12 +197,12 @@ async function Le(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 _e(e, t) {
+async function We(e, t) {
   return it(`${t}/tx/${e}`);
 }
-async function Qn(e, t) {
+async function es(e, t) {
   try {
-    const n = await fetch(`${t}/tx/${e}/hex`);
+    const n = await at(`${t}/tx/${e}/hex`);
     if (!n.ok) {
       const s = await n.text();
       throw new Error(
@@ -195,14 +214,14 @@ async function Qn(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 Re(e, t, n) {
-  const s = await _e(e, n);
-  if (!qt(t, s.vout.length))
+async function Ve(e, t, n) {
+  const s = await We(e, n);
+  if (!jt(t, s.vout.length))
     throw new Error(
       `Invalid vout ${t} for transaction ${e} (has ${s.vout.length} outputs)`
     );
   const o = s.vout[t];
-  if (!Xt(o.value))
+  if (!Gt(o.value))
     throw new Error(`Invalid UTXO value ${o.value} for ${e}:${t}`);
   return {
     txid: e,
@@ -211,7 +230,7 @@ async function Re(e, t, n) {
     scriptPubKey: o.scriptpubkey
   };
 }
-async function ts(e, t) {
+async function ns(e, t) {
   try {
     const n = await it(`${t}/address/${e}/utxo`), s = await it(`${t}/v1/validate-address/${e}`);
     if (!s.isvalid)
@@ -219,9 +238,9 @@ async function ts(e, t) {
         `Invalid Bitcoin address: ${e}. Mempool API validation failed.`
       );
     for (const r of n) {
-      if (!qt(r.vout))
+      if (!jt(r.vout))
         throw new Error(`Invalid vout ${r.vout} for ${r.txid}`);
-      if (!Xt(r.value))
+      if (!Gt(r.value))
         throw new Error(
           `Invalid UTXO value ${r.value} for ${r.txid}:${r.vout}`
         );
@@ -241,14 +260,14 @@ async function ts(e, t) {
     );
   }
 }
-function es(e) {
-  return Oe[e];
+function ss(e) {
+  return _e[e];
 }
-async function ns(e, t) {
+async function os(e, t) {
   return it(`${t}/address/${e}/txs`);
 }
-async function ss(e) {
-  const t = await fetch(`${e}/v1/fees/recommended`);
+async function rs(e) {
+  const t = await at(`${e}/v1/fees/recommended`);
   if (!t.ok)
     throw new Error(
       `Failed to fetch network fees: ${t.status} ${t.statusText}`
@@ -261,9 +280,9 @@ async function ss(e) {
     "minimumFee"
   ];
   for (const o of s)
-    if (!$e(n[o]))
+    if (!Le(n[o]))
       throw new Error(
-        `Invalid fee rate ${o}=${n[o]} from mempool API: expected a positive number ≤ ${Nt}`
+        `Invalid fee rate ${o}=${n[o]} from mempool API: expected a positive number ≤ ${qt}`
       );
   if (n.minimumFee > n.economyFee || n.economyFee > n.hourFee || n.hourFee > n.halfHourFee || n.halfHourFee > n.fastestFee)
     throw new Error(
@@ -594,7 +613,7 @@ const j = [
   // InvalidPeginFee(uint256,uint256)
   "0x979f4518": "Invalid pegin fee: The ETH fee sent does not match the required amount. This may indicate a fee rate change during the transaction."
 };
-function xt(e) {
+function mt(e) {
   if (!e || typeof e != "object") return;
   const t = e;
   if (typeof t.data == "string" && t.data.startsWith("0x"))
@@ -613,22 +632,22 @@ function xt(e) {
   if (i)
     return i[1];
 }
-function os(e) {
-  const t = xt(e);
+function is(e) {
+  const t = mt(e);
   if (t) {
     const n = t.substring(0, 10);
     return q[t] ?? q[n];
   }
 }
-function rs(e) {
-  const t = xt(e);
+function as(e) {
+  const t = mt(e);
   if (t === void 0) return !1;
   const n = t.substring(0, 10);
   return t in q || n in q;
 }
 function M(e) {
   console.error("[Contract Error] Raw error:", e);
-  const t = xt(e);
+  const t = mt(e);
   if (console.error("[Contract Error] Extracted error data:", t), t) {
     const s = t.substring(0, 10), o = q[t] ?? q[s];
     if (o)
@@ -648,18 +667,18 @@ function M(e) {
   }
   throw e instanceof Error ? (console.error("[Contract Error] Unhandled error:", e.message), e) : new Error(`Contract call failed: ${String(e)}`);
 }
-const We = 0;
-function Ve(e, t, n, s) {
+const De = 0;
+function Ke(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
-  }) : Re(e, t, s);
+  }) : Ve(e, t, s);
 }
-const Ct = 12e4;
-class is {
+const Ft = 12e4;
+class cs {
   /**
    * Creates a new PeginManager instance.
    *
@@ -690,7 +709,7 @@ class is {
    * @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, o = B(t.vaultProviderBtcPubkey), r = t.vaultKeeperBtcPubkeys.map(B), i = t.universalChallengerBtcPubkeys.map(B);
+    const n = await this.config.btcWallet.getPublicKeyHex(), s = n.length === 66 ? n.slice(2) : n, o = S(t.vaultProviderBtcPubkey), r = t.vaultKeeperBtcPubkeys.map(S), i = t.universalChallengerBtcPubkeys.map(S);
     if (t.hashlocks.length !== t.amounts.length)
       throw new Error(
         `hashlocks.length (${t.hashlocks.length}) must equal amounts.length (${t.amounts.length})`
@@ -710,26 +729,26 @@ class is {
       councilQuorum: t.councilQuorum,
       councilSize: t.councilSize,
       network: this.config.btcNetwork
-    }, l = await me(c), h = Ae(
+    }, l = await Te(c), h = Ue(
       [...t.availableUTXOs],
       l.totalOutputValue,
       t.mempoolFeeRate,
-      Pe(l.htlcValues.length)
-    ), u = It(this.config.btcNetwork), d = Te({
+      ve(l.htlcValues.length)
+    ), u = It(this.config.btcNetwork), d = ke({
       unfundedTxHex: l.psbtHex,
       selectedUTXOs: h.selectedUTXOs,
       changeAddress: t.changeAddress,
       changeAmount: h.changeAmount,
       network: u
-    }), g = B(ht(d)), y = [], x = [], P = [];
+    }), g = S(dt(d)), y = [], x = [], P = [];
     for (let f = 0; f < t.hashlocks.length; f++) {
-      const w = await ve({
+      const m = await He({
         prePeginParams: c,
         timelockPegin: t.timelockPegin,
         fundedPrePeginTxHex: d,
         htlcVout: f
-      }), v = await ke({
-        peginTxHex: w.txHex,
+      }), v = await Ee({
+        peginTxHex: m.txHex,
         fundedPrePeginTxHex: d,
         depositorPubkey: s,
         vaultProviderPubkey: o,
@@ -739,25 +758,25 @@ class is {
         timelockRefund: t.timelockRefund,
         network: this.config.btcNetwork
       });
-      y.push(w), x.push(v.psbtHex), P.push(
-        yt(n, 1)
+      y.push(m), x.push(v.psbtHex), P.push(
+        bt(n, 1)
       );
     }
-    const m = await this.signPsbtsWithFallback(
+    const w = await this.signPsbtsWithFallback(
       x,
       P
     ), b = [];
-    for (let f = 0; f < m.length; f++) {
-      const w = He(
-        m[f],
+    for (let f = 0; f < w.length; f++) {
+      const m = Ie(
+        w[f],
         s
-      ), v = Ie(m[f]);
+      ), v = Se(w[f]);
       b.push({
         htlcVout: f,
         htlcValue: l.htlcValues[f],
         peginTxHex: v,
         peginTxid: y[f].txid,
-        peginInputSignature: w,
+        peginInputSignature: m,
         vaultScriptPubKey: y[f].vaultScriptPubKey
       });
     }
@@ -816,10 +835,10 @@ class is {
    * @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 = gt.fromHex(o);
+    const { fundedPrePeginTxHex: n, depositorBtcPubkey: s } = t, o = n.startsWith("0x") ? n.slice(2) : n, r = xt.fromHex(o);
     if (r.ins.length === 0)
       throw new Error("Transaction has no inputs");
-    const i = new vt();
+    const i = new kt();
     i.setVersion(r.version), i.setLocktime(r.locktime);
     const a = s.startsWith("0x") ? s.slice(2) : s;
     if (a.length !== 64 || !/^[0-9a-fA-F]+$/.test(a))
@@ -832,9 +851,9 @@ class is {
         `Invalid depositorBtcPubkey length: expected 32 bytes, got ${c.length}`
       );
     const l = this.config.mempoolApiUrl, h = r.ins.map((b) => {
-      const f = W.from(b.hash).reverse().toString("hex"), w = b.index;
-      return Ve(f, w, t.localPrevouts, l).then(
-        (v) => ({ input: b, utxoData: v, txid: f, vout: w })
+      const f = W.from(b.hash).reverse().toString("hex"), m = b.index;
+      return Ke(f, m, t.localPrevouts, l).then(
+        (v) => ({ input: b, utxoData: v, txid: f, vout: m })
       );
     }), u = await Promise.all(h), d = u.reduce(
       (b, f) => b + BigInt(f.utxoData.value),
@@ -847,8 +866,8 @@ class is {
       throw new Error(
         `UTXO value mismatch: total input value (${d} sat) is less than total output value (${g} sat). This may indicate the mempool API returned manipulated UTXO data.`
       );
-    for (const { input: b, utxoData: f, txid: w, vout: v } of u) {
-      const T = Fe(
+    for (const { input: b, utxoData: f, txid: m, vout: v } of u) {
+      const T = $e(
         {
           value: f.value,
           scriptPubKey: f.scriptPubKey
@@ -867,19 +886,19 @@ class is {
         script: b.script,
         value: b.value
       });
-    const y = await this.config.btcWallet.signPsbt(i.toHex()), x = vt.fromHex(y);
+    const y = await this.config.btcWallet.signPsbt(i.toHex()), x = kt.fromHex(y);
     try {
       x.finalizeAllInputs();
     } catch (b) {
       if (!x.data.inputs.every(
-        (w) => w.finalScriptWitness || w.finalScriptSig
+        (m) => m.finalScriptWitness || m.finalScriptSig
       ))
         throw new Error(
           `PSBT finalization failed and wallet did not auto-finalize: ${b}`
         );
     }
     const P = x.extractTransaction().toHex();
-    return await Le(P, l);
+    return await Re(P, l);
   }
   /**
    * Registers a peg-in on Ethereum by calling the BTCVaultRegistry contract.
@@ -918,19 +937,19 @@ class is {
       u
     );
     c && await c();
-    const y = C(n), x = C(s), P = C(o), m = await this.resolvePayoutScriptPubKey(
+    const y = C(n), x = C(s), P = C(o), w = await this.resolvePayoutScriptPubKey(
       l
-    ), b = ht(P), f = await At(
-      B(b),
-      B(d)
-    ), w = C(f);
-    if (await this.checkVaultExists(w))
+    ), b = dt(P), f = await Ct(
+      S(b),
+      S(d)
+    ), m = C(f);
+    if (await this.checkVaultExists(m))
       throw new Error(
-        `Vault already exists (ID: ${w}, peginTxHash: ${b}). 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: ${m}, peginTxHash: ${b}). 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 T = ut({
+    const T = lt({
       chain: this.config.ethChain,
-      transport: lt()
+      transport: ht()
     });
     let H;
     try {
@@ -945,7 +964,7 @@ class is {
         "Failed to query pegin fee from the contract. Please check your network connection and that the contract address is correct."
       );
     }
-    const I = kt({
+    const E = Ht({
       abi: j,
       functionName: "submitPeginRequest",
       args: [
@@ -957,45 +976,45 @@ class is {
         r,
         i,
         a,
-        m,
+        w,
         h
       ]
     });
-    let E;
+    let I;
     try {
-      E = await T.estimateGas({
+      I = await T.estimateGas({
         to: this.config.vaultContracts.btcVaultRegistry,
-        data: I,
+        data: E,
         value: H,
         account: this.config.ethWallet.account.address
       });
     } catch ($) {
       M($);
     }
-    let U;
+    let F;
     try {
-      U = await this.config.ethWallet.sendTransaction({
+      F = await this.config.ethWallet.sendTransaction({
         to: this.config.vaultContracts.btcVaultRegistry,
-        data: I,
+        data: E,
         value: H,
         account: this.config.ethWallet.account,
         chain: this.config.ethChain,
-        gas: E
+        gas: I
       });
     } catch ($) {
       M($);
     }
     const K = await T.waitForTransactionReceipt({
-      hash: U,
-      timeout: Ct
+      hash: F,
+      timeout: Ft
     });
     return K.status === "reverted" && M(
       new Error(
-        `Transaction reverted. Hash: ${U}. Check the transaction on block explorer for details.`
+        `Transaction reverted. Hash: ${F}. Check the transaction on block explorer for details.`
       )
     ), {
       ethTxHash: K.transactionHash,
-      vaultId: w,
+      vaultId: m,
       peginTxHash: b,
       btcPopSignature: g
     };
@@ -1030,19 +1049,19 @@ class is {
     for (const b of s) {
       const f = C(
         b.depositorSignedPeginTx
-      ), w = ht(f), v = await At(
-        B(w),
-        B(i)
+      ), m = dt(f), v = await Ct(
+        S(m),
+        S(i)
       ), T = C(v);
       if (await this.checkVaultExists(T))
         throw new Error(
-          `Vault already exists (ID: ${T}, peginTxHash: ${w}). To create a new vault, use different UTXOs or a different amount.`
+          `Vault already exists (ID: ${T}, peginTxHash: ${m}). To create a new vault, use different UTXOs or a different amount.`
         );
-      l.push({ vaultId: T, peginTxHash: w });
+      l.push({ vaultId: T, peginTxHash: m });
     }
-    const h = ut({
+    const h = lt({
       chain: this.config.ethChain,
-      transport: lt()
+      transport: ht()
     });
     let u;
     try {
@@ -1066,10 +1085,10 @@ class is {
       ),
       hashlock: b.hashlock,
       htlcVout: b.htlcVout,
-      referralCode: We,
+      referralCode: De,
       depositorPayoutBtcAddress: c[f],
       depositorWotsPkHash: b.depositorWotsPkHash
-    })), y = kt({
+    })), y = Ht({
       abi: j,
       functionName: "submitPeginRequestBatch",
       args: [i, n, g]
@@ -1098,16 +1117,16 @@ class is {
     } catch (b) {
       M(b);
     }
-    const m = await h.waitForTransactionReceipt({
+    const w = await h.waitForTransactionReceipt({
       hash: P,
-      timeout: Ct
+      timeout: Ft
     });
-    return m.status === "reverted" && M(
+    return w.status === "reverted" && M(
       new Error(
         `Batch transaction reverted. Hash: ${P}. Check the transaction on block explorer for details.`
       )
     ), {
-      ethTxHash: m.transactionHash,
+      ethTxHash: w.transactionHash,
       vaults: l,
       btcPopSignature: a
     };
@@ -1120,15 +1139,15 @@ class is {
    */
   async checkVaultExists(t) {
     try {
-      return (await ut({
+      return (await lt({
         chain: this.config.ethChain,
-        transport: lt()
+        transport: ht()
       }).readContract({
         address: this.config.vaultContracts.btcVaultRegistry,
         abi: j,
         functionName: "getBTCVault",
         args: [t]
-      })).depositor !== ye;
+      })).depositor !== ge;
     } catch {
       return !1;
     }
@@ -1141,14 +1160,14 @@ class is {
    * wallet's public key to guard against a compromised wallet provider.
    */
   async resolvePayoutScriptPubKey(t) {
-    Ee();
+    Be();
     let n;
     if (t)
       n = t;
     else {
       n = await this.config.btcWallet.getAddress();
       const o = await this.config.btcWallet.getPublicKeyHex();
-      if (!Be(
+      if (!Ae(
         n,
         o,
         this.config.btcNetwork
@@ -1159,7 +1178,7 @@ class is {
     }
     const s = It(this.config.btcNetwork);
     try {
-      return `0x${fe.address.toOutputScript(n, s).toString("hex")}`;
+      return `0x${ye.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.`
@@ -1198,7 +1217,7 @@ class is {
     return this.config.vaultContracts.btcVaultRegistry;
   }
 }
-class as {
+class us {
   /**
    * Creates a new PayoutManager instance.
    *
@@ -1235,7 +1254,7 @@ class as {
       t.payoutTxHex,
       t.registeredPayoutScriptPubKey
     );
-    const n = await this.config.btcWallet.getPublicKeyHex(), { depositorPubkey: s } = Et(
+    const n = await this.config.btcWallet.getPublicKeyHex(), { depositorPubkey: s } = St(
       n,
       t.depositorBtcPubkey
     ), o = await Bt({
@@ -1250,10 +1269,10 @@ class as {
       network: this.config.network
     }), r = await this.config.btcWallet.signPsbt(
       o.psbtHex,
-      yt(n, 1)
+      bt(n, 1)
     );
     return {
-      signature: St(r, s),
+      signature: At(r, s),
       depositorBtcPubkey: s
     };
   }
@@ -1293,7 +1312,7 @@ class as {
         c.payoutTxHex,
         c.registeredPayoutScriptPubKey
       );
-      const { depositorPubkey: l } = Et(
+      const { depositorPubkey: l } = St(
         n,
         c.depositorBtcPubkey
       );
@@ -1309,7 +1328,7 @@ class as {
         timelockPegin: c.timelockPegin,
         network: this.config.network
       });
-      s.push(h.psbtHex), o.push(yt(n, 1));
+      s.push(h.psbtHex), o.push(bt(n, 1));
     }
     const i = await this.config.btcWallet.signPsbts(
       s,
@@ -1321,7 +1340,7 @@ class as {
       );
     const a = [];
     for (let c = 0; c < t.length; c++) {
-      const l = r[c], h = St(
+      const l = r[c], h = At(
         i[c],
         l
       );
@@ -1347,14 +1366,14 @@ class as {
    * @throws Error if the largest output does not pay to the registered address
    */
   validatePayoutOutputs(t, n) {
-    if (!Se(n))
+    if (!Ce(n))
       throw new Error(
         "Invalid registeredPayoutScriptPubKey: not valid hex"
       );
     const s = W.from(
-      B(n),
+      S(n),
       "hex"
-    ), o = gt.fromHex(B(t));
+    ), o = xt.fromHex(S(t));
     if (o.outs.length === 0)
       throw new Error("Payout transaction has no outputs");
     if (!o.outs.reduce(
@@ -1365,7 +1384,7 @@ class as {
       );
   }
 }
-function De(e) {
+function Me(e) {
   return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
 }
 function V(e, t = "") {
@@ -1375,14 +1394,14 @@ function V(e, t = "") {
   }
 }
 function D(e, t, n = "") {
-  const s = De(e), o = e == null ? void 0 : e.length, r = t !== void 0;
+  const s = Me(e), o = e == null ? void 0 : e.length, r = t !== void 0;
   if (!s || r && o !== t) {
     const i = n && `"${n}" `, a = r ? ` of length ${t}` : "", c = s ? `length=${o}` : `type=${typeof e}`;
     throw new Error(i + "expected Uint8Array" + a + ", got " + c);
   }
   return e;
 }
-function Gt(e) {
+function zt(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash must wrapped by utils.createHasher");
   V(e.outputLen), V(e.blockLen);
@@ -1393,16 +1412,16 @@ function G(e, t = !0) {
   if (t && e.finished)
     throw new Error("Hash#digest() has already been called");
 }
-function jt(e, t) {
+function Zt(e, t) {
   D(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 Ke(e) {
+function Ne(e) {
   return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
 }
-function S(...e) {
+function B(...e) {
   for (let t = 0; t < e.length; t++)
     e[t].fill(0);
 }
@@ -1415,37 +1434,37 @@ function A(e, t) {
 function J(e, t) {
   return e << t | e >>> 32 - t >>> 0;
 }
-const Me = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-function Ne(e) {
+const Xe = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+function qe(e) {
   return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
 }
-function Xe(e) {
+function Ge(e) {
   for (let t = 0; t < e.length; t++)
-    e[t] = Ne(e[t]);
+    e[t] = qe(e[t]);
   return e;
 }
-const Ft = Me ? (e) => e : Xe;
-function qe(e) {
+const $t = Xe ? (e) => e : Ge;
+function je(e) {
   if (typeof e != "string")
     throw new Error("string expected");
   return new Uint8Array(new TextEncoder().encode(e));
 }
-function Ut(e, t = "") {
-  return typeof e == "string" ? qe(e) : D(e, void 0, t);
+function Ot(e, t = "") {
+  return typeof e == "string" ? je(e) : D(e, void 0, t);
 }
-function Ge(e, t) {
+function ze(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 at(e, t = {}) {
+function ct(e, t = {}) {
   const n = (o, r) => e(r).update(o).digest(), s = e(void 0);
   return n.outputLen = s.outputLen, n.blockLen = s.blockLen, n.create = (o) => e(o), Object.assign(n, t), Object.freeze(n);
 }
-const zt = (e) => ({
+const Jt = (e) => ({
   oid: Uint8Array.from([6, 9, 96, 134, 72, 1, 101, 3, 4, 2, e])
 });
-class Zt {
+class Qt {
   constructor(t, n) {
     p(this, "oHash");
     p(this, "iHash");
@@ -1453,7 +1472,7 @@ class Zt {
     p(this, "outputLen");
     p(this, "finished", !1);
     p(this, "destroyed", !1);
-    if (Gt(t), D(n, void 0, "key"), this.iHash = t.create(), typeof this.iHash.update != "function")
+    if (zt(t), D(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);
@@ -1463,7 +1482,7 @@ class Zt {
     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);
+    this.oHash.update(o), B(o);
   }
   update(t) {
     return G(this), this.iHash.update(t), this;
@@ -1487,15 +1506,15 @@ class Zt {
     this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
   }
 }
-const wt = (e, t, n) => new Zt(e, t).update(n).digest();
-wt.create = (e, t) => new Zt(e, t);
-function je(e, t, n) {
+const wt = (e, t, n) => new Qt(e, t).update(n).digest();
+wt.create = (e, t) => new Qt(e, t);
+function Ze(e, t, n) {
   return e & t ^ ~e & n;
 }
-function ze(e, t, n) {
+function Je(e, t, n) {
   return e & t ^ e & n ^ t & n;
 }
-class mt {
+class Pt {
   constructor(t, n, s, o) {
     p(this, "blockLen");
     p(this, "outputLen");
@@ -1526,10 +1545,10 @@ class mt {
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
-    G(this), jt(t, this), this.finished = !0;
+    G(this), Zt(t, this), this.finished = !0;
     const { buffer: n, view: s, blockLen: o, isLE: r } = this;
     let { pos: i } = this;
-    n[i++] = 128, S(this.buffer.subarray(i)), this.padOffset > o - i && (this.process(s, 0), i = 0);
+    n[i++] = 128, B(this.buffer.subarray(i)), this.padOffset > o - i && (this.process(s, 0), i = 0);
     for (let u = i; u < o; u++)
       n[u] = 0;
     s.setBigUint64(o - 8, BigInt(this.length * 8), r), this.process(s, 0);
@@ -1583,7 +1602,7 @@ const O = /* @__PURE__ */ Uint32Array.from([
   4215389547,
   1541459225,
   327033209
-]), Ze = /* @__PURE__ */ Uint8Array.from([
+]), Qe = /* @__PURE__ */ Uint8Array.from([
   7,
   4,
   13,
@@ -1600,36 +1619,36 @@ const O = /* @__PURE__ */ Uint32Array.from([
   14,
   11,
   8
-]), Jt = Uint8Array.from(new Array(16).fill(0).map((e, t) => t)), Je = Jt.map((e) => (9 * e + 5) % 16), Yt = /* @__PURE__ */ (() => {
-  const n = [[Jt], [Je]];
+]), Yt = Uint8Array.from(new Array(16).fill(0).map((e, t) => t)), Ye = Yt.map((e) => (9 * e + 5) % 16), te = /* @__PURE__ */ (() => {
+  const n = [[Yt], [Ye]];
   for (let s = 0; s < 4; s++)
     for (let o of n)
-      o.push(o[s].map((r) => Ze[r]));
+      o.push(o[s].map((r) => Qe[r]));
   return n;
-})(), Qt = Yt[0], te = Yt[1], ee = /* @__PURE__ */ [
+})(), ee = te[0], ne = te[1], se = /* @__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)), Ye = /* @__PURE__ */ Qt.map((e, t) => e.map((n) => ee[t][n])), Qe = /* @__PURE__ */ te.map((e, t) => e.map((n) => ee[t][n])), tn = /* @__PURE__ */ Uint32Array.from([
+].map((e) => Uint8Array.from(e)), tn = /* @__PURE__ */ ee.map((e, t) => e.map((n) => se[t][n])), en = /* @__PURE__ */ ne.map((e, t) => e.map((n) => se[t][n])), nn = /* @__PURE__ */ Uint32Array.from([
   0,
   1518500249,
   1859775393,
   2400959708,
   2840853838
-]), en = /* @__PURE__ */ Uint32Array.from([
+]), sn = /* @__PURE__ */ Uint32Array.from([
   1352829926,
   1548603684,
   1836072691,
   2053994217,
   0
 ]);
-function $t(e, t, n, s) {
+function Lt(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 Y = /* @__PURE__ */ new Uint32Array(16);
-class nn extends mt {
+const Q = /* @__PURE__ */ new Uint32Array(16);
+class on extends Pt {
   constructor() {
     super(64, 20, 8, !0);
     p(this, "h0", 1732584193);
@@ -1647,47 +1666,47 @@ class nn extends mt {
   }
   process(n, s) {
     for (let y = 0; y < 16; y++, s += 4)
-      Y[y] = n.getUint32(s, !0);
+      Q[y] = n.getUint32(s, !0);
     let o = this.h0 | 0, r = o, i = this.h1 | 0, a = i, c = this.h2 | 0, l = c, h = this.h3 | 0, u = h, d = this.h4 | 0, g = d;
     for (let y = 0; y < 5; y++) {
-      const x = 4 - y, P = tn[y], m = en[y], b = Qt[y], f = te[y], w = Ye[y], v = Qe[y];
+      const x = 4 - y, P = nn[y], w = sn[y], b = ee[y], f = ne[y], m = tn[y], v = en[y];
       for (let T = 0; T < 16; T++) {
-        const H = J(o + $t(y, i, c, h) + Y[b[T]] + P, w[T]) + d | 0;
+        const H = J(o + Lt(y, i, c, h) + Q[b[T]] + P, m[T]) + d | 0;
         o = d, d = h, h = J(c, 10) | 0, c = i, i = H;
       }
       for (let T = 0; T < 16; T++) {
-        const H = J(r + $t(x, a, l, u) + Y[f[T]] + m, v[T]) + g | 0;
+        const H = J(r + Lt(x, a, l, u) + Q[f[T]] + w, v[T]) + g | 0;
         r = g, g = u, u = J(l, 10) | 0, l = a, a = H;
       }
     }
     this.set(this.h1 + c + u | 0, this.h2 + h + g | 0, this.h3 + d + r | 0, this.h4 + o + a | 0, this.h0 + i + l | 0);
   }
   roundClean() {
-    S(Y);
+    B(Q);
   }
   destroy() {
-    this.destroyed = !0, S(this.buffer), this.set(0, 0, 0, 0, 0);
+    this.destroyed = !0, B(this.buffer), this.set(0, 0, 0, 0, 0);
   }
 }
-const sn = /* @__PURE__ */ at(() => new nn()), Q = /* @__PURE__ */ BigInt(2 ** 32 - 1), Ot = /* @__PURE__ */ BigInt(32);
-function on(e, t = !1) {
-  return t ? { h: Number(e & Q), l: Number(e >> Ot & Q) } : { h: Number(e >> Ot & Q) | 0, l: Number(e & Q) | 0 };
+const rn = /* @__PURE__ */ ct(() => new on()), Y = /* @__PURE__ */ BigInt(2 ** 32 - 1), _t = /* @__PURE__ */ BigInt(32);
+function an(e, t = !1) {
+  return t ? { h: Number(e & Y), l: Number(e >> _t & Y) } : { h: Number(e >> _t & Y) | 0, l: Number(e & Y) | 0 };
 }
-function ne(e, t = !1) {
+function oe(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 } = on(e[r], t);
+    const { h: i, l: a } = an(e[r], t);
     [s[r], o[r]] = [i, a];
   }
   return [s, o];
 }
-const Lt = (e, t, n) => e >>> n, _t = (e, t, n) => e << 32 - n | t >>> n, N = (e, t, n) => e >>> n | t << 32 - n, X = (e, t, n) => e << 32 - n | t >>> n, tt = (e, t, n) => e << 64 - n | t >>> n - 32, et = (e, t, n) => e >>> n - 32 | t << 64 - n, rn = (e, t, n) => e << n | t >>> 32 - n, an = (e, t, n) => t << n | e >>> 32 - n, cn = (e, t, n) => t << n - 32 | e >>> 64 - n, un = (e, t, n) => e << n - 32 | t >>> 64 - n;
-function F(e, t, n, s) {
+const Rt = (e, t, n) => e >>> n, Wt = (e, t, n) => e << 32 - n | t >>> n, N = (e, t, n) => e >>> n | t << 32 - n, X = (e, t, n) => e << 32 - n | t >>> n, tt = (e, t, n) => e << 64 - n | t >>> n - 32, et = (e, t, n) => e >>> n - 32 | t << 64 - n, cn = (e, t, n) => e << n | t >>> 32 - n, un = (e, t, n) => t << n | e >>> 32 - n, ln = (e, t, n) => t << n - 32 | e >>> 64 - n, hn = (e, t, n) => e << n - 32 | t >>> 64 - n;
+function U(e, t, n, s) {
   const o = (t >>> 0) + (s >>> 0);
   return { h: e + n + (o / 2 ** 32 | 0) | 0, l: o | 0 };
 }
-const ln = (e, t, n) => (e >>> 0) + (t >>> 0) + (n >>> 0), hn = (e, t, n, s) => t + n + s + (e / 2 ** 32 | 0) | 0, dn = (e, t, n, s) => (e >>> 0) + (t >>> 0) + (n >>> 0) + (s >>> 0), fn = (e, t, n, s, o) => t + n + s + o + (e / 2 ** 32 | 0) | 0, pn = (e, t, n, s, o) => (e >>> 0) + (t >>> 0) + (n >>> 0) + (s >>> 0) + (o >>> 0), yn = (e, t, n, s, o, r) => t + n + s + o + r + (e / 2 ** 32 | 0) | 0, bn = /* @__PURE__ */ Uint32Array.from([
+const dn = (e, t, n) => (e >>> 0) + (t >>> 0) + (n >>> 0), fn = (e, t, n, s) => t + n + s + (e / 2 ** 32 | 0) | 0, pn = (e, t, n, s) => (e >>> 0) + (t >>> 0) + (n >>> 0) + (s >>> 0), yn = (e, t, n, s, o) => t + n + s + o + (e / 2 ** 32 | 0) | 0, bn = (e, t, n, s, o) => (e >>> 0) + (t >>> 0) + (n >>> 0) + (s >>> 0) + (o >>> 0), gn = (e, t, n, s, o, r) => t + n + s + o + r + (e / 2 ** 32 | 0) | 0, xn = /* @__PURE__ */ Uint32Array.from([
   1116352408,
   1899447441,
   3049323471,
@@ -1753,7 +1772,7 @@ const ln = (e, t, n) => (e >>> 0) + (t >>> 0) + (n >>> 0), hn = (e, t, n, s) =>
   3204031479,
   3329325298
 ]), L = /* @__PURE__ */ new Uint32Array(64);
-class gn extends mt {
+class mn extends Pt {
   constructor(t) {
     super(64, t, 8, !1);
   }
@@ -1774,19 +1793,19 @@ class gn extends mt {
     }
     let { A: s, B: o, C: r, D: i, E: a, F: c, G: l, H: h } = this;
     for (let u = 0; u < 64; u++) {
-      const d = A(a, 6) ^ A(a, 11) ^ A(a, 25), g = h + d + je(a, c, l) + bn[u] + L[u] | 0, x = (A(s, 2) ^ A(s, 13) ^ A(s, 22)) + ze(s, o, r) | 0;
+      const d = A(a, 6) ^ A(a, 11) ^ A(a, 25), g = h + d + Ze(a, c, l) + xn[u] + L[u] | 0, x = (A(s, 2) ^ A(s, 13) ^ A(s, 22)) + Je(s, o, r) | 0;
       h = l, l = c, c = a, a = i + g | 0, i = r, r = o, o = s, s = g + x | 0;
     }
     s = s + this.A | 0, o = o + this.B | 0, r = r + this.C | 0, i = i + this.D | 0, a = a + this.E | 0, c = c + this.F | 0, l = l + this.G | 0, h = h + this.H | 0, this.set(s, o, r, i, a, c, l, h);
   }
   roundClean() {
-    S(L);
+    B(L);
   }
   destroy() {
-    this.set(0, 0, 0, 0, 0, 0, 0, 0), S(this.buffer);
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), B(this.buffer);
   }
 }
-class xn extends gn {
+class wn extends mn {
   constructor() {
     super(32);
     // We cannot use array here since array allows indexing by variable
@@ -1801,7 +1820,7 @@ class xn extends gn {
     p(this, "H", O[7] | 0);
   }
 }
-const se = ne([
+const re = oe([
   "0x428a2f98d728ae22",
   "0x7137449123ef65cd",
   "0xb5c0fbcfec4d3b2f",
@@ -1882,8 +1901,8 @@ const se = ne([
   "0x597f299cfc657e2a",
   "0x5fcb6fab3ad6faec",
   "0x6c44198c4a475817"
-].map((e) => BigInt(e))), wn = se[0], mn = se[1], _ = /* @__PURE__ */ new Uint32Array(80), R = /* @__PURE__ */ new Uint32Array(80);
-class Pn extends mt {
+].map((e) => BigInt(e))), Pn = re[0], Tn = re[1], _ = /* @__PURE__ */ new Uint32Array(80), R = /* @__PURE__ */ new Uint32Array(80);
+class vn extends Pt {
   constructor(t) {
     super(128, t, 16, !1);
   }
@@ -1900,26 +1919,26 @@ class Pn extends mt {
     for (let f = 0; f < 16; f++, n += 4)
       _[f] = t.getUint32(n), R[f] = t.getUint32(n += 4);
     for (let f = 16; f < 80; f++) {
-      const w = _[f - 15] | 0, v = R[f - 15] | 0, T = N(w, v, 1) ^ N(w, v, 8) ^ Lt(w, v, 7), H = X(w, v, 1) ^ X(w, v, 8) ^ _t(w, v, 7), I = _[f - 2] | 0, E = R[f - 2] | 0, U = N(I, E, 19) ^ tt(I, E, 61) ^ Lt(I, E, 6), K = X(I, E, 19) ^ et(I, E, 61) ^ _t(I, E, 6), $ = dn(H, K, R[f - 7], R[f - 16]), ct = fn($, T, U, _[f - 7], _[f - 16]);
-      _[f] = ct | 0, R[f] = $ | 0;
+      const m = _[f - 15] | 0, v = R[f - 15] | 0, T = N(m, v, 1) ^ N(m, v, 8) ^ Rt(m, v, 7), H = X(m, v, 1) ^ X(m, v, 8) ^ Wt(m, v, 7), E = _[f - 2] | 0, I = R[f - 2] | 0, F = N(E, I, 19) ^ tt(E, I, 61) ^ Rt(E, I, 6), K = X(E, I, 19) ^ et(E, I, 61) ^ Wt(E, I, 6), $ = pn(H, K, R[f - 7], R[f - 16]), ut = yn($, T, F, _[f - 7], _[f - 16]);
+      _[f] = ut | 0, R[f] = $ | 0;
     }
-    let { Ah: s, Al: o, Bh: r, Bl: i, Ch: a, Cl: c, Dh: l, Dl: h, Eh: u, El: d, Fh: g, Fl: y, Gh: x, Gl: P, Hh: m, Hl: b } = this;
+    let { Ah: s, Al: o, Bh: r, Bl: i, Ch: a, Cl: c, Dh: l, Dl: h, Eh: u, El: d, Fh: g, Fl: y, Gh: x, Gl: P, Hh: w, Hl: b } = this;
     for (let f = 0; f < 80; f++) {
-      const w = N(u, d, 14) ^ N(u, d, 18) ^ tt(u, d, 41), v = X(u, d, 14) ^ X(u, d, 18) ^ et(u, d, 41), T = u & g ^ ~u & x, H = d & y ^ ~d & P, I = pn(b, v, H, mn[f], R[f]), E = yn(I, m, w, T, wn[f], _[f]), U = I | 0, K = N(s, o, 28) ^ tt(s, o, 34) ^ tt(s, o, 39), $ = X(s, o, 28) ^ et(s, o, 34) ^ et(s, o, 39), ct = s & r ^ s & a ^ r & a, le = o & i ^ o & c ^ i & c;
-      m = x | 0, b = P | 0, x = g | 0, P = y | 0, g = u | 0, y = d | 0, { h: u, l: d } = F(l | 0, h | 0, E | 0, U | 0), l = a | 0, h = c | 0, a = r | 0, c = i | 0, r = s | 0, i = o | 0;
-      const Tt = ln(U, $, le);
-      s = hn(Tt, E, K, ct), o = Tt | 0;
+      const m = N(u, d, 14) ^ N(u, d, 18) ^ tt(u, d, 41), v = X(u, d, 14) ^ X(u, d, 18) ^ et(u, d, 41), T = u & g ^ ~u & x, H = d & y ^ ~d & P, E = bn(b, v, H, Tn[f], R[f]), I = gn(E, w, m, T, Pn[f], _[f]), F = E | 0, K = N(s, o, 28) ^ tt(s, o, 34) ^ tt(s, o, 39), $ = X(s, o, 28) ^ et(s, o, 34) ^ et(s, o, 39), ut = s & r ^ s & a ^ r & a, de = o & i ^ o & c ^ i & c;
+      w = x | 0, b = P | 0, x = g | 0, P = y | 0, g = u | 0, y = d | 0, { h: u, l: d } = U(l | 0, h | 0, I | 0, F | 0), l = a | 0, h = c | 0, a = r | 0, c = i | 0, r = s | 0, i = o | 0;
+      const vt = dn(F, $, de);
+      s = fn(vt, I, K, ut), o = vt | 0;
     }
-    ({ h: s, l: o } = F(this.Ah | 0, this.Al | 0, s | 0, o | 0)), { h: r, l: i } = F(this.Bh | 0, this.Bl | 0, r | 0, i | 0), { h: a, l: c } = F(this.Ch | 0, this.Cl | 0, a | 0, c | 0), { h: l, l: h } = F(this.Dh | 0, this.Dl | 0, l | 0, h | 0), { h: u, l: d } = F(this.Eh | 0, this.El | 0, u | 0, d | 0), { h: g, l: y } = F(this.Fh | 0, this.Fl | 0, g | 0, y | 0), { h: x, l: P } = F(this.Gh | 0, this.Gl | 0, x | 0, P | 0), { h: m, l: b } = F(this.Hh | 0, this.Hl | 0, m | 0, b | 0), this.set(s, o, r, i, a, c, l, h, u, d, g, y, x, P, m, b);
+    ({ h: s, l: o } = U(this.Ah | 0, this.Al | 0, s | 0, o | 0)), { h: r, l: i } = U(this.Bh | 0, this.Bl | 0, r | 0, i | 0), { h: a, l: c } = U(this.Ch | 0, this.Cl | 0, a | 0, c | 0), { h: l, l: h } = U(this.Dh | 0, this.Dl | 0, l | 0, h | 0), { h: u, l: d } = U(this.Eh | 0, this.El | 0, u | 0, d | 0), { h: g, l: y } = U(this.Fh | 0, this.Fl | 0, g | 0, y | 0), { h: x, l: P } = U(this.Gh | 0, this.Gl | 0, x | 0, P | 0), { h: w, l: b } = U(this.Hh | 0, this.Hl | 0, w | 0, b | 0), this.set(s, o, r, i, a, c, l, h, u, d, g, y, x, P, w, b);
   }
   roundClean() {
-    S(_, R);
+    B(_, R);
   }
   destroy() {
-    S(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
+    B(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
   }
 }
-class Tn extends Pn {
+class kn extends vn {
   constructor() {
     super(64);
     p(this, "Ah", k[0] | 0);
@@ -1940,34 +1959,34 @@ class Tn extends Pn {
     p(this, "Hl", k[15] | 0);
   }
 }
-const vn = /* @__PURE__ */ at(
-  () => new xn(),
-  /* @__PURE__ */ zt(1)
-), oe = /* @__PURE__ */ at(
-  () => new Tn(),
-  /* @__PURE__ */ zt(3)
-), kn = BigInt(0), z = BigInt(1), Hn = BigInt(2), In = BigInt(7), En = BigInt(256), Bn = BigInt(113), re = [], ie = [], ae = [];
+const Hn = /* @__PURE__ */ ct(
+  () => new wn(),
+  /* @__PURE__ */ Jt(1)
+), ie = /* @__PURE__ */ ct(
+  () => new kn(),
+  /* @__PURE__ */ Jt(3)
+), En = BigInt(0), z = BigInt(1), In = BigInt(2), Sn = BigInt(7), Bn = BigInt(256), An = BigInt(113), ae = [], ce = [], ue = [];
 for (let e = 0, t = z, n = 1, s = 0; e < 24; e++) {
-  [n, s] = [s, (2 * n + 3 * s) % 5], re.push(2 * (5 * s + n)), ie.push((e + 1) * (e + 2) / 2 % 64);
-  let o = kn;
+  [n, s] = [s, (2 * n + 3 * s) % 5], ae.push(2 * (5 * s + n)), ce.push((e + 1) * (e + 2) / 2 % 64);
+  let o = En;
   for (let r = 0; r < 7; r++)
-    t = (t << z ^ (t >> In) * Bn) % En, t & Hn && (o ^= z << (z << BigInt(r)) - z);
-  ae.push(o);
+    t = (t << z ^ (t >> Sn) * An) % Bn, t & In && (o ^= z << (z << BigInt(r)) - z);
+  ue.push(o);
 }
-const ce = ne(ae, !0), Sn = ce[0], An = ce[1], Rt = (e, t, n) => n > 32 ? cn(e, t, n) : rn(e, t, n), Wt = (e, t, n) => n > 32 ? un(e, t, n) : an(e, t, n);
-function Cn(e, t = 24) {
+const le = oe(ue, !0), Cn = le[0], Un = le[1], Vt = (e, t, n) => n > 32 ? ln(e, t, n) : cn(e, t, n), Dt = (e, t, n) => n > 32 ? hn(e, t, n) : un(e, t, n);
+function Fn(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, l = n[c], h = n[c + 1], u = Rt(l, h, 1) ^ n[a], d = Wt(l, h, 1) ^ n[a + 1];
+      const a = (i + 8) % 10, c = (i + 2) % 10, l = n[c], h = n[c + 1], u = Vt(l, h, 1) ^ n[a], d = Dt(l, h, 1) ^ n[a + 1];
       for (let g = 0; g < 50; g += 10)
         e[i + g] ^= u, e[i + g + 1] ^= d;
     }
     let o = e[2], r = e[3];
     for (let i = 0; i < 24; i++) {
-      const a = ie[i], c = Rt(o, r, a), l = Wt(o, r, a), h = re[i];
+      const a = ce[i], c = Vt(o, r, a), l = Dt(o, r, a), h = ae[i];
       o = e[h], r = e[h + 1], e[h] = c, e[h + 1] = l;
     }
     for (let i = 0; i < 50; i += 10) {
@@ -1976,11 +1995,11 @@ function Cn(e, t = 24) {
       for (let a = 0; a < 10; a++)
         e[i + a] ^= ~n[(a + 2) % 10] & n[(a + 4) % 10];
     }
-    e[0] ^= Sn[s], e[1] ^= An[s];
+    e[0] ^= Cn[s], e[1] ^= Un[s];
   }
-  S(n);
+  B(n);
 }
-class Pt {
+class Tt {
   // NOTE: we accept arguments in bytes instead of bits here.
   constructor(t, n, s, o = !1, r = 24) {
     p(this, "state");
@@ -1996,13 +2015,13 @@ class Pt {
     p(this, "rounds");
     if (this.blockLen = t, this.suffix = n, this.outputLen = s, this.enableXOF = o, this.rounds = r, V(s, "outputLen"), !(0 < t && t < 200))
       throw new Error("only keccak-f1600 function is supported");
-    this.state = new Uint8Array(200), this.state32 = Ke(this.state);
+    this.state = new Uint8Array(200), this.state32 = Ne(this.state);
   }
   clone() {
     return this._cloneInto();
   }
   keccak() {
-    Ft(this.state32), Cn(this.state32, this.rounds), Ft(this.state32), this.posOut = 0, this.pos = 0;
+    $t(this.state32), Fn(this.state32, this.rounds), $t(this.state32), this.posOut = 0, this.pos = 0;
   }
   update(t) {
     G(this), D(t);
@@ -2041,7 +2060,7 @@ class Pt {
     return V(t), this.xofInto(new Uint8Array(t));
   }
   digestInto(t) {
-    if (jt(t, this), this.finished)
+    if (Zt(t, this), this.finished)
       throw new Error("digest() was already called");
     return this.writeInto(t), this.destroy(), t;
   }
@@ -2049,27 +2068,27 @@ class Pt {
     return this.digestInto(new Uint8Array(this.outputLen));
   }
   destroy() {
-    this.destroyed = !0, S(this.state);
+    this.destroyed = !0, B(this.state);
   }
   _cloneInto(t) {
     const { blockLen: n, suffix: s, outputLen: o, rounds: r, enableXOF: i } = this;
-    return t || (t = new Pt(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 t || (t = new Tt(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 Fn = (e, t, n, s = {}) => at(() => new Pt(t, e, n), s), Un = /* @__PURE__ */ Fn(1, 136, 32);
-function $n(e, t, n, s) {
-  Gt(e);
-  const o = Ge({ dkLen: 32, asyncTick: 10 }, s), { c: r, dkLen: i, asyncTick: a } = o;
+const $n = (e, t, n, s = {}) => ct(() => new Tt(t, e, n), s), On = /* @__PURE__ */ $n(1, 136, 32);
+function Ln(e, t, n, s) {
+  zt(e);
+  const o = ze({ dkLen: 32, asyncTick: 10 }, s), { c: r, dkLen: i, asyncTick: a } = o;
   if (V(r, "c"), V(i, "dkLen"), V(a, "asyncTick"), r < 1)
     throw new Error("iterations (c) must be >= 1");
-  const c = Ut(t, "password"), l = Ut(n, "salt"), h = new Uint8Array(i), u = wt.create(e, c), d = u._cloneInto().update(l);
+  const c = Ot(t, "password"), l = Ot(n, "salt"), h = new Uint8Array(i), u = wt.create(e, c), d = u._cloneInto().update(l);
   return { c: r, dkLen: i, asyncTick: a, DK: h, PRF: u, PRFSalt: d };
 }
-function On(e, t, n, s, o) {
-  return e.destroy(), t.destroy(), s && s.destroy(), S(o), n;
+function _n(e, t, n, s, o) {
+  return e.destroy(), t.destroy(), s && s.destroy(), B(o), n;
 }
-function Ln(e, t, n, s) {
-  const { c: o, dkLen: r, DK: i, PRF: a, PRFSalt: c } = $n(e, t, n, s);
+function Rn(e, t, n, s) {
+  const { c: o, dkLen: r, DK: i, PRF: a, PRFSalt: c } = Ln(e, t, n, s);
   let l;
   const h = new Uint8Array(4), u = rt(h), d = new Uint8Array(a.outputLen);
   for (let g = 1, y = 0; y < r; g++, y += a.outputLen) {
@@ -2077,28 +2096,28 @@ function Ln(e, t, n, s) {
     u.setInt32(0, g, !1), (l = c._cloneInto(l)).update(h).digestInto(d), x.set(d.subarray(0, x.length));
     for (let P = 1; P < o; P++) {
       a._cloneInto(l).update(d).digestInto(d);
-      for (let m = 0; m < x.length; m++)
-        x[m] ^= d[m];
+      for (let w = 0; w < x.length; w++)
+        x[w] ^= d[w];
     }
   }
-  return On(a, c, i, l, d);
+  return _n(a, c, i, l, d);
 }
-function ue(e) {
+function he(e) {
   if (typeof e != "string")
     throw new TypeError("invalid mnemonic type: " + typeof e);
   return e.normalize("NFKD");
 }
-function _n(e) {
-  const t = ue(e), n = t.split(" ");
+function Wn(e) {
+  const t = he(e), n = t.split(" ");
   if (![12, 15, 18, 21, 24].includes(n.length))
     throw new Error("Invalid mnemonic");
   return { nfkd: t, words: n };
 }
-const Rn = (e) => ue("mnemonic" + e);
-function Wn(e, t = "") {
-  return Ln(oe, _n(e).nfkd, Rn(t), { c: 2048, dkLen: 64 });
+const Vn = (e) => he("mnemonic" + e);
+function Dn(e, t = "") {
+  return Rn(ie, Wn(e).nfkd, Vn(t), { c: 2048, dkLen: 64 });
 }
-const Vn = 508, Vt = 16, nt = 32, st = 64, Dt = 5, Dn = 4;
+const Kn = 508, Kt = 16, nt = 32, st = 64, Mt = 5, Mn = 4;
 function Z(...e) {
   const t = e.reduce((o, r) => o + r.length, 0), n = new Uint8Array(t);
   let s = 0;
@@ -2106,63 +2125,63 @@ function Z(...e) {
     n.set(o, s), s += o.length;
   return n;
 }
-function dt(e) {
+function ft(e) {
   return new TextEncoder().encode(e);
 }
-function ft(e) {
-  const t = new Uint8Array(Dn);
+function pt(e) {
+  const t = new Uint8Array(Mn);
   return new DataView(t.buffer).setUint32(0, e.length, !1), Z(t, e);
 }
-function pt(e, t) {
-  return wt(oe, e, t);
+function yt(e, t) {
+  return wt(ie, e, t);
 }
-function Kt(e) {
-  return sn(vn(e));
+function Nt(e) {
+  return rn(Hn(e));
 }
-const bt = (e) => Array.from(e).map((t) => t.toString(16).padStart(2, "0")).join("");
-function Kn(e) {
-  const t = Wn(e), n = new Uint8Array(t);
+const gt = (e) => Array.from(e).map((t) => t.toString(16).padStart(2, "0")).join("");
+function Nn(e) {
+  const t = Dn(e), n = new Uint8Array(t);
   return t.fill(0), n;
 }
-async function Mn(e, t, n, s) {
+async function Xn(e, t, n, s) {
   if (e.length !== st)
     throw new Error(
       `WOTS seed must be ${st} bytes, got ${e.length}`
     );
-  t = B(t), n = B(n);
+  t = S(t), n = S(n);
   const o = e.slice(nt, st), r = e.slice(0, nt), i = [o, r];
   try {
     const a = Z(
-      ft(dt(t)),
-      ft(dt(n)),
-      ft(dt(s))
+      pt(ft(t)),
+      pt(ft(n)),
+      pt(ft(s))
     ), c = Z(r, a);
     i.push(c);
-    const l = pt(o, c);
+    const l = yt(o, c);
     i.push(l);
     const h = l.slice(0, nt), u = l.slice(nt, st);
     i.push(h, u);
     const d = [], g = [], y = [], x = [];
     let P = !1;
     try {
-      for (let m = 0; m < Vn; m++) {
-        const b = new Uint8Array(Dt);
-        b[0] = 0, new DataView(b.buffer).setUint32(1, m, !1);
-        const f = new Uint8Array(Dt);
-        f[0] = 1, new DataView(f.buffer).setUint32(1, m, !1);
-        const w = Z(h, b), v = Z(h, f), T = pt(u, w), H = pt(u, v);
+      for (let w = 0; w < Kn; w++) {
+        const b = new Uint8Array(Mt);
+        b[0] = 0, new DataView(b.buffer).setUint32(1, w, !1);
+        const f = new Uint8Array(Mt);
+        f[0] = 1, new DataView(f.buffer).setUint32(1, w, !1);
+        const m = Z(h, b), v = Z(h, f), T = yt(u, m), H = yt(u, v);
         try {
-          const I = T.slice(0, Vt), E = H.slice(0, Vt);
-          d.push(I), g.push(E), y.push(Kt(I)), x.push(Kt(E));
+          const E = T.slice(0, Kt), I = H.slice(0, Kt);
+          d.push(E), g.push(I), y.push(Nt(E)), x.push(Nt(I));
         } finally {
-          w.fill(0), v.fill(0), T.fill(0), H.fill(0);
+          m.fill(0), v.fill(0), T.fill(0), H.fill(0);
         }
       }
       return P = !0, { falsePreimages: d, truePreimages: g, falseHashes: y, trueHashes: x };
     } finally {
       if (!P) {
-        for (const m of d) m.fill(0);
-        for (const m of g) m.fill(0);
+        for (const w of d) w.fill(0);
+        for (const w of g) w.fill(0);
       }
     }
   } finally {
@@ -2170,13 +2189,13 @@ async function Mn(e, t, n, s) {
       a.fill(0);
   }
 }
-function cs(e) {
+function ls(e) {
   return {
-    false_list: e.falseHashes.map(bt),
-    true_list: e.trueHashes.map(bt)
+    false_list: e.falseHashes.map(gt),
+    true_list: e.trueHashes.map(gt)
   };
 }
-function Nn(e) {
+function qn(e) {
   if (e.falseHashes.length === 0 || e.trueHashes.length === 0)
     throw new Error(
       "computeWotsPkHash: keypair hash arrays must not be empty"
@@ -2187,20 +2206,20 @@ function Nn(e) {
     s.set(i, o), o += t;
   for (const i of e.trueHashes)
     s.set(i, o), o += t;
-  const r = Un(s);
-  return `0x${bt(r)}`;
+  const r = On(s);
+  return `0x${gt(r)}`;
 }
-async function us(e, t, n, s) {
-  const o = Kn(e);
+async function hs(e, t, n, s) {
+  const o = Nn(e);
   try {
-    const r = await Mn(
+    const r = await Xn(
       o,
       t,
       n,
       s
     );
     try {
-      return Nn(r);
+      return qn(r);
     } finally {
       for (const i of r.falsePreimages) i.fill(0);
       for (const i of r.truePreimages) i.fill(0);
@@ -2209,41 +2228,41 @@ async function us(e, t, n, s) {
     o.fill(0);
   }
 }
-function ls(e) {
+function ds(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 {
-  ls as A,
+  ds as A,
   ot as B,
   q as C,
-  Oe as M,
-  is as P,
-  Jn as a,
-  Ce as b,
-  ht as c,
-  Fe as d,
-  yt as e,
-  as as f,
-  Yn as g,
-  ns as h,
-  ts as i,
-  es as j,
-  ss as k,
-  Qn as l,
-  _e as m,
-  Re as n,
+  _e as M,
+  cs as P,
+  Yn as a,
+  Fe as b,
+  dt as c,
+  $e as d,
+  bt as e,
+  us as f,
+  ts as g,
+  os as h,
+  ns as i,
+  ss as j,
+  rs as k,
+  es as l,
+  We as m,
+  Ve as n,
   j as o,
-  Le as p,
-  xt as q,
-  os as r,
-  Ae as s,
-  rs as t,
+  Re as p,
+  mt as q,
+  is as r,
+  Ue as s,
+  as as t,
   M as u,
-  Kn as v,
-  Mn as w,
-  cs as x,
-  Nn as y,
-  us as z
+  Nn as v,
+  Xn as w,
+  ls as x,
+  qn as y,
+  hs as z
 };
-//# sourceMappingURL=errors-BEUjAw2k.js.map
+//# sourceMappingURL=errors-Ld-2tiK3.js.map