@babylonlabs-io/ts-sdk 0.10.0 → 0.12.0

package/dist/{errors-fLxe1eml.js → errors-DOJdtNTD.js}

@@ -1,55 +1,59 @@
-var ue = Object.defineProperty;
-var le = (e, t, n) => t in e ? ue(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
-var f = (e, t, n) => le(e, typeof t != "symbol" ? t + "" : t, n);
-import * as he from "bitcoinjs-lib";
-import { script as fe, Transaction as st, address as de, Psbt as dt } from "bitcoinjs-lib";
+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);
+import * as le from "bitcoinjs-lib";
+import { script as he, Transaction as st, address as fe, Psbt as dt } from "bitcoinjs-lib";
 import { Buffer as S } from "buffer";
-import { P as pe, x as be, D as Dt, M as Tt, B as xe, T as ge, A as pt, t as W, b as ye, z as me, a as we, d as Pe, e as Te, f as ve, r as at, p as ke, w as vt, g as kt, h as Ht } from "./challengeAssert-D50t_Qyo.js";
+import { P as de, x as pe, D as Wt, M as Tt, B as be, T as ge, E as pt, t as D, b as xe, z as ye, C as me, a as we, d as Pe, e as Te, f as ve, r as at, p as ke, w as vt, g as kt, h as Ht } from "./challengeAssert-DnnliaRt.js";
 import { createPublicClient as It, http as Et, encodeFunctionData as He, zeroAddress as Ie } from "viem";
-import { SINGLE_DEPOSIT_HTLC_VOUT as St } from "@babylonlabs-io/babylon-tbv-rust-wasm";
-function Ee(e, t, n) {
+import "@babylonlabs-io/babylon-tbv-rust-wasm";
+function Ee(e, t, n, s) {
+  if (!Number.isInteger(s) || s < 1)
+    throw new Error(
+      `Invalid numOutputs: expected a positive integer, got ${s}`
+    );
   if (e.length === 0)
     throw new Error("Insufficient funds: no UTXOs available");
-  const s = e.filter((c) => {
-    const l = S.from(c.scriptPubKey, "hex");
-    return !!fe.decompile(l);
+  const r = e.filter((u) => {
+    const h = S.from(u.scriptPubKey, "hex");
+    return !!he.decompile(h);
   });
-  if (s.length === 0)
+  if (r.length === 0)
     throw new Error(
       "Insufficient funds: no valid UTXOs available (all have invalid scripts)"
     );
-  const r = [...s].sort((c, l) => l.value - c.value), o = [];
-  let i = 0n, a = 0n;
-  for (const c of r) {
-    o.push(c), i += BigInt(c.value);
-    const l = o.length * pe, h = 2 * Tt, u = l + h + ge;
-    if (a = BigInt(Math.ceil(u * n)) + BigInt(be(n)), i - t - a > Dt) {
+  const o = [...r].sort((u, h) => h.value - u.value), i = [];
+  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 > Wt) {
       const p = BigInt(
         Math.ceil(Tt * n)
       );
-      a += p;
+      c += p;
     }
-    if (i >= t + a) {
-      const p = i - t - a;
+    if (a >= t + c) {
+      const p = a - t - c;
       return {
-        selectedUTXOs: o,
-        totalValue: i,
-        fee: a,
+        selectedUTXOs: i,
+        totalValue: a,
+        fee: c,
         changeAmount: p
       };
     }
   }
   throw new Error(
-    `Insufficient funds: need ${t + a} sats (${t} pegin + ${a} fee), have ${i} sats`
+    `Insufficient funds: need ${t + c} sats (${t} pegin + ${c} fee), have ${a} sats`
   );
 }
 function zn(e) {
-  return e > Dt;
+  return e > Wt;
 }
 function qn() {
-  return xe;
+  return be;
 }
-function At(e) {
+function St(e) {
   const t = e.startsWith("0x") ? e.slice(2) : e;
   return `0x${st.fromHex(t).getId()}`;
 }
@@ -66,25 +70,25 @@ function Zn(e, t, n) {
   const s = pt(n), r = new st();
   r.version = 2;
   for (const c of e) {
-    const l = S.from(c.txid, "hex").reverse();
-    r.addInput(l, c.vout);
+    const u = S.from(c.txid, "hex").reverse();
+    r.addInput(u, c.vout);
   }
   const o = [];
   for (let c = 0; c < t.length; c++) {
-    const l = t[c];
+    const u = t[c];
     let h;
     try {
-      h = de.toOutputScript(l.address, s);
-    } catch (u) {
+      h = fe.toOutputScript(u.address, s);
+    } catch (l) {
       throw new Error(
-        `Failed to decode address "${l.address}": ${u instanceof Error ? u.message : String(u)}`
+        `Failed to decode address "${u.address}": ${l instanceof Error ? l.message : String(l)}`
       );
     }
-    r.addOutput(h, Number(l.amount)), o.push({
+    r.addOutput(h, Number(u.amount)), o.push({
       txid: "",
       // Will be set after txid calculation
       vout: c,
-      value: Number(l.amount),
+      value: Number(u.amount),
       scriptPubKey: h.toString("hex")
     });
   }
@@ -111,10 +115,10 @@ function Jn(e, t, n) {
     const i = s.ins[o], a = t[o];
     if (!a)
       throw new Error(`Missing UTXO data for input ${o}`);
-    const c = S.from(i.hash).reverse().toString("hex"), l = i.index;
-    if (a.txid !== c || a.vout !== l)
+    const c = S.from(i.hash).reverse().toString("hex"), u = i.index;
+    if (a.txid !== c || a.vout !== u)
       throw new Error(
-        `Input ${o} outpoint mismatch: transaction expects ${c}:${l}, but UTXO ${a.txid}:${a.vout} was provided. Ensure inputs array matches the order used in createSplitTransaction().`
+        `Input ${o} outpoint mismatch: transaction expects ${c}:${u}, but UTXO ${a.txid}:${a.vout} was provided. Ensure inputs array matches the order used in createSplitTransaction().`
       );
     const h = S.from(a.scriptPubKey, "hex");
     if (!(h.length === 34 && h[0] === 81 && // OP_1 (witness version 1)
@@ -206,17 +210,17 @@ function bt(e, t) {
     }))
   };
 }
-const Be = 21e6 * 1e8, Kt = 1e4;
-function Mt(e) {
+const Be = 21e6 * 1e8, Dt = 1e4;
+function Kt(e) {
   return Number.isInteger(e) && e > 0 && e <= Be;
 }
-function Ue(e) {
-  return Number.isInteger(e) && e > 0 && e <= Kt;
+function $e(e) {
+  return Number.isInteger(e) && e > 0 && e <= Dt;
 }
-function Nt(e, t) {
+function Mt(e, t) {
   return !Number.isInteger(e) || e < 0 ? !1 : t === void 0 || e < t;
 }
-const $e = {
+const Ue = {
   mainnet: "https://mempool.space/api",
   testnet: "https://mempool.space/testnet/api",
   signet: "https://mempool.space/signet/api"
@@ -279,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) {
+async function Ce(e, t, n) {
   const s = await Fe(e, n);
-  if (!Nt(t, s.vout.length))
+  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 (!Mt(r.value))
+  if (!Kt(r.value))
     throw new Error(`Invalid UTXO value ${r.value} for ${e}:${t}`);
   return {
     txid: e,
@@ -303,9 +307,9 @@ async function Qn(e, t) {
         `Invalid Bitcoin address: ${e}. Mempool API validation failed.`
       );
     for (const o of n) {
-      if (!Nt(o.vout))
+      if (!Mt(o.vout))
         throw new Error(`Invalid vout ${o.vout} for ${o.txid}`);
-      if (!Mt(o.value))
+      if (!Kt(o.value))
         throw new Error(
           `Invalid UTXO value ${o.value} for ${o.txid}:${o.vout}`
         );
@@ -326,7 +330,7 @@ async function Qn(e, t) {
   }
 }
 function ts(e) {
-  return $e[e];
+  return Ue[e];
 }
 async function es(e, t) {
   return nt(`${t}/address/${e}/txs`);
@@ -345,9 +349,9 @@ async function ns(e) {
     "minimumFee"
   ];
   for (const r of s)
-    if (!Ue(n[r]))
+    if (!$e(n[r]))
       throw new Error(
-        `Invalid fee rate ${r}=${n[r]} from mempool API: expected a positive number ≤ ${Kt}`
+        `Invalid fee rate ${r}=${n[r]} from mempool API: expected a positive number ≤ ${Dt}`
       );
   if (n.minimumFee > n.economyFee || n.economyFee > n.hourFee || n.hourFee > n.halfHourFee || n.halfHourFee > n.fastestFee)
     throw new Error(
@@ -614,7 +618,7 @@ const ct = [
     name: "PeginSignaturesIncomplete",
     inputs: []
   }
-], D = {
+], K = {
   // 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
@@ -644,7 +648,7 @@ const ct = [
   // 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 gt(e) {
+function xt(e) {
   if (!e || typeof e != "object") return;
   const t = e;
   if (typeof t.data == "string" && t.data.startsWith("0x"))
@@ -664,23 +668,23 @@ function gt(e) {
     return i[1];
 }
 function ss(e) {
-  const t = gt(e);
+  const t = xt(e);
   if (t) {
     const n = t.substring(0, 10);
-    return D[t] ?? D[n];
+    return K[t] ?? K[n];
   }
 }
 function rs(e) {
-  const t = gt(e);
+  const t = xt(e);
   if (t === void 0) return !1;
   const n = t.substring(0, 10);
-  return t in D || n in D;
+  return t in K || n in K;
 }
 function ut(e) {
   console.error("[Contract Error] Raw error:", e);
-  const t = gt(e);
+  const t = xt(e);
   if (console.error("[Contract Error] Extracted error data:", t), t) {
-    const s = t.substring(0, 10), r = D[t] ?? D[s];
+    const s = t.substring(0, 10), r = K[t] ?? K[s];
     if (r)
       throw console.error("[Contract Error] Known error:", r), new Error(r);
   }
@@ -698,14 +702,14 @@ 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 Oe(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);
+  }) : Ce(e, t, s);
 }
 const _e = 12e4;
 class os {
@@ -739,11 +743,13 @@ 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 = W(t.vaultProviderBtcPubkey), o = t.vaultKeeperBtcPubkeys.map(W), i = t.universalChallengerBtcPubkeys.map(W);
-    if (t.hashlocks.length !== 1)
+    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);
+    if (t.hashlocks.length !== t.amounts.length)
       throw new Error(
-        "hashlocks must contain exactly one entry (batched deposits not yet supported)"
+        `hashlocks.length (${t.hashlocks.length}) must equal amounts.length (${t.amounts.length})`
       );
+    if (t.hashlocks.length === 0)
+      throw new Error("hashlocks must contain at least one entry");
     const a = o.length, c = {
       depositorPubkey: s,
       vaultProviderPubkey: r,
@@ -751,58 +757,102 @@ class os {
       universalChallengerPubkeys: i,
       hashlocks: t.hashlocks,
       timelockRefund: t.timelockRefund,
-      pegInAmount: t.amount,
+      pegInAmounts: t.amounts,
       feeRate: t.protocolFeeRate,
       numLocalChallengers: a,
       councilQuorum: t.councilQuorum,
       councilSize: t.councilSize,
       network: this.config.btcNetwork
-    }, l = await ye(c), h = Ee(
+    }, u = await xe(c), h = Ee(
       [...t.availableUTXOs],
-      l.totalOutputValue,
-      t.mempoolFeeRate
-    ), u = pt(this.config.btcNetwork), d = me({
-      unfundedTxHex: l.psbtHex,
+      u.totalOutputValue,
+      t.mempoolFeeRate,
+      ye(u.htlcValues.length)
+    ), l = pt(this.config.btcNetwork), d = me({
+      unfundedTxHex: u.psbtHex,
       selectedUTXOs: h.selectedUTXOs,
       changeAddress: t.changeAddress,
       changeAmount: h.changeAmount,
-      network: u
-    }), p = W(At(d)), b = await we({
-      prePeginParams: c,
-      timelockPegin: t.timelockPegin,
-      fundedPrePeginTxHex: d,
-      htlcVout: St
-    }), m = await Pe({
-      peginTxHex: b.txHex,
-      fundedPrePeginTxHex: d,
-      depositorPubkey: s,
-      vaultProviderPubkey: r,
-      vaultKeeperPubkeys: o,
-      universalChallengerPubkeys: i,
-      hashlock: t.hashlocks[0],
-      timelockRefund: t.timelockRefund,
-      network: this.config.btcNetwork
-    }), x = await this.config.btcWallet.signPsbt(
-      m.psbtHex,
-      bt(n, 1)
-    ), y = Te(
-      x,
-      s
-    ), w = ve(x);
+      network: l
+    }), g = D(St(d)), p = [], m = [], x = [];
+    for (let b = 0; b < t.hashlocks.length; b++) {
+      const P = await we({
+        prePeginParams: c,
+        timelockPegin: t.timelockPegin,
+        fundedPrePeginTxHex: d,
+        htlcVout: b
+      }), T = await Pe({
+        peginTxHex: P.txHex,
+        fundedPrePeginTxHex: d,
+        depositorPubkey: s,
+        vaultProviderPubkey: r,
+        vaultKeeperPubkeys: o,
+        universalChallengerPubkeys: i,
+        hashlock: t.hashlocks[b],
+        timelockRefund: t.timelockRefund,
+        network: this.config.btcNetwork
+      });
+      p.push(P), m.push(T.psbtHex), x.push(
+        bt(n, 1)
+      );
+    }
+    const y = await this.signPsbtsWithFallback(
+      m,
+      x
+    ), w = [];
+    for (let b = 0; b < y.length; b++) {
+      const P = Te(
+        y[b],
+        s
+      ), T = ve(y[b]);
+      w.push({
+        htlcVout: b,
+        htlcValue: u.htlcValues[b],
+        peginTxHex: T,
+        peginTxid: p[b].txid,
+        peginInputSignature: P,
+        vaultScriptPubKey: p[b].vaultScriptPubKey
+      });
+    }
     return {
       fundedPrePeginTxHex: d,
-      htlcValue: l.htlcValue,
-      signedPeginInputPsbtHex: x,
-      peginInputSignature: y,
-      vaultScriptPubKey: b.vaultScriptPubKey,
-      peginTxHex: w,
-      prePeginTxid: p,
-      peginTxid: b.txid,
+      prePeginTxid: g,
+      unsignedPrePeginTxHex: u.psbtHex,
+      perVault: w,
       selectedUTXOs: h.selectedUTXOs,
       fee: h.fee,
       changeAmount: h.changeAmount
     };
   }
+  /**
+   * Signs multiple PSBTs using batch signing if available, falling back to sequential signing.
+   *
+   * Wallets that support native batch signing (e.g. UniSat) will sign all PSBTs
+   * in a single interaction. Others (e.g. Ledger, AppKit) implement signPsbts
+   * by looping signPsbt internally, so the UX depends on the wallet adapter.
+   */
+  async signPsbtsWithFallback(t, n) {
+    if (typeof this.config.btcWallet.signPsbts == "function") {
+      const r = await this.config.btcWallet.signPsbts(
+        t,
+        n
+      );
+      if (r.length !== t.length)
+        throw new Error(
+          `Expected ${t.length} signed PSBTs but received ${r.length}`
+        );
+      return r;
+    }
+    const s = [];
+    for (let r = 0; r < t.length; r++) {
+      const o = await this.config.btcWallet.signPsbt(
+        t[r],
+        n[r]
+      );
+      s.push(o);
+    }
+    return s;
+  }
   /**
    * Signs and broadcasts a funded peg-in transaction to the Bitcoin network.
    *
@@ -834,13 +884,13 @@ class os {
       throw new Error(
         `Invalid depositorBtcPubkey length: expected 32 bytes, got ${c.length}`
       );
-    const l = this.config.mempoolApiUrl, h = o.ins.map((x) => {
+    const u = this.config.mempoolApiUrl, h = o.ins.map((x) => {
       const y = S.from(x.hash).reverse().toString("hex"), w = x.index;
-      return Ce(y, w, t.localPrevouts, l).then(
-        (g) => ({ input: x, utxoData: g, txid: y, vout: w })
+      return Oe(y, w, t.localPrevouts, u).then(
+        (b) => ({ input: x, utxoData: b, txid: y, vout: w })
       );
-    }), u = await Promise.all(h);
-    for (const { input: x, utxoData: y, txid: w, vout: g } of u) {
+    }), l = await Promise.all(h);
+    for (const { input: x, utxoData: y, txid: w, vout: b } of l) {
       const P = Ae(
         {
           value: y.value,
@@ -860,19 +910,19 @@ class os {
         script: x.script,
         value: x.value
       });
-    const d = await this.config.btcWallet.signPsbt(i.toHex()), p = dt.fromHex(d);
+    const d = await this.config.btcWallet.signPsbt(i.toHex()), g = dt.fromHex(d);
     try {
-      p.finalizeAllInputs();
+      g.finalizeAllInputs();
     } catch (x) {
-      if (!p.data.inputs.every(
+      if (!g.data.inputs.every(
         (w) => w.finalScriptWitness || w.finalScriptSig
       ))
         throw new Error(
           `PSBT finalization failed and wallet did not auto-finalize: ${x}`
         );
     }
-    const b = p.extractTransaction().toHex();
-    return await Le(b, l);
+    const p = g.extractTransaction().toHex();
+    return await Le(p, u);
   }
   /**
    * Registers a peg-in on Ethereum by calling the BTCVaultRegistry contract.
@@ -898,32 +948,33 @@ class os {
       depositorSignedPeginTx: r,
       vaultProvider: o,
       hashlock: i,
-      onPopSigned: a,
-      depositorPayoutBtcAddress: c,
-      depositorLamportPkHash: l,
-      preSignedBtcPopSignature: h
+      htlcVout: a,
+      onPopSigned: c,
+      depositorPayoutBtcAddress: u,
+      depositorLamportPkHash: h,
+      preSignedBtcPopSignature: l
     } = t;
     if (!this.config.ethWallet.account)
       throw new Error("Ethereum wallet account not found");
-    const u = this.config.ethWallet.account.address, d = await this.resolvePopSignature(
-      u,
-      h
+    const d = this.config.ethWallet.account.address, g = await this.resolvePopSignature(
+      d,
+      l
     );
-    a && await a();
-    const p = at(n), b = at(s), m = at(r), x = await this.resolvePayoutScriptPubKey(
-      c
-    ), y = At(m);
-    if (await this.checkVaultExists(y))
+    c && await c();
+    const p = at(n), m = at(s), x = at(r), y = await this.resolvePayoutScriptPubKey(
+      u
+    ), w = St(x);
+    if (await this.checkVaultExists(w))
       throw new Error(
-        `Vault already exists for this transaction (ID: ${y}). 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 for this transaction (ID: ${w}). 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.`
       );
-    const g = It({
+    const P = It({
       chain: this.config.ethChain,
       transport: Et()
     });
-    let P;
+    let T;
     try {
-      P = await g.readContract({
+      T = await P.readContract({
         address: this.config.vaultContracts.btcVaultRegistry,
         abi: ct,
         functionName: "getPegInFee",
@@ -938,54 +989,54 @@ class os {
       abi: ct,
       functionName: "submitPeginRequest",
       args: [
-        u,
-        p,
         d,
-        b,
+        p,
+        g,
         m,
+        x,
         o,
         i,
-        St,
-        x,
-        l
+        a,
+        y,
+        h
       ]
     });
-    let T;
+    let E;
     try {
-      T = await g.estimateGas({
+      E = await P.estimateGas({
         to: this.config.vaultContracts.btcVaultRegistry,
         data: v,
-        value: P,
+        value: T,
         account: this.config.ethWallet.account.address
       });
-    } catch (k) {
-      ut(k);
+    } catch (U) {
+      ut(U);
     }
-    let E;
+    let k;
     try {
-      E = await this.config.ethWallet.sendTransaction({
+      k = await this.config.ethWallet.sendTransaction({
         to: this.config.vaultContracts.btcVaultRegistry,
         data: v,
-        value: P,
+        value: T,
         account: this.config.ethWallet.account,
         chain: this.config.ethChain,
-        gas: T
+        gas: E
       });
-    } catch (k) {
-      ut(k);
+    } catch (U) {
+      ut(U);
     }
-    const I = await g.waitForTransactionReceipt({
-      hash: E,
+    const I = await P.waitForTransactionReceipt({
+      hash: k,
       timeout: _e
     });
     return I.status === "reverted" && ut(
       new Error(
-        `Transaction reverted. Hash: ${E}. Check the transaction on block explorer for details.`
+        `Transaction reverted. Hash: ${k}. Check the transaction on block explorer for details.`
       )
     ), {
       ethTxHash: I.transactionHash,
-      vaultId: y,
-      btcPopSignature: d
+      vaultId: w,
+      btcPopSignature: g
     };
   }
   /**
@@ -1034,7 +1085,7 @@ class os {
     }
     const s = pt(this.config.btcNetwork);
     try {
-      return `0x${he.address.toOutputScript(n, s).toString("hex")}`;
+      return `0x${le.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.`
@@ -1160,16 +1211,16 @@ class is {
       );
     const n = await this.config.btcWallet.getPublicKeyHex(), s = [], r = [], o = [];
     for (const c of t) {
-      const { depositorPubkey: l } = vt(
+      const { depositorPubkey: u } = vt(
         n,
         c.depositorBtcPubkey
       );
-      o.push(l);
+      o.push(u);
       const h = await kt({
         payoutTxHex: c.payoutTxHex,
         peginTxHex: c.peginTxHex,
         assertTxHex: c.assertTxHex,
-        depositorBtcPubkey: l,
+        depositorBtcPubkey: u,
         vaultProviderBtcPubkey: c.vaultProviderBtcPubkey,
         vaultKeeperBtcPubkeys: c.vaultKeeperBtcPubkeys,
         universalChallengerBtcPubkeys: c.universalChallengerBtcPubkeys,
@@ -1188,13 +1239,13 @@ class is {
       );
     const a = [];
     for (let c = 0; c < t.length; c++) {
-      const l = o[c], h = Ht(
+      const u = o[c], h = Ht(
         i[c],
-        l
+        u
       );
       a.push({
         payoutSignature: h,
-        depositorBtcPubkey: l
+        depositorBtcPubkey: u
       });
     }
     return a;
@@ -1203,13 +1254,13 @@ class is {
 function Re(e) {
   return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
 }
-function C(e, t = "") {
+function _(e, t = "") {
   if (!Number.isSafeInteger(e) || e < 0) {
     const n = t && `"${t}" `;
     throw new Error(`${n}expected integer >= 0, got ${e}`);
   }
 }
-function _(e, t, n = "") {
+function R(e, t, n = "") {
   const s = Re(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}`;
@@ -1217,19 +1268,19 @@ function _(e, t, n = "") {
   }
   return e;
 }
-function Xt(e) {
+function Nt(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash must wrapped by utils.createHasher");
-  C(e.outputLen), C(e.blockLen);
+  _(e.outputLen), _(e.blockLen);
 }
-function K(e, t = !0) {
+function M(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 Gt(e, t) {
-  _(e, void 0, "digestInto() output");
+function Xt(e, t) {
+  R(e, void 0, "digestInto() output");
   const n = t.outputLen;
   if (e.length < n)
     throw new Error('"digestInto() output" expected to be of length >=' + n);
@@ -1247,7 +1298,7 @@ function et(e) {
 function B(e, t) {
   return e << 32 - t | e >>> t;
 }
-function j(e, t) {
+function G(e, t) {
   return e << t | e >>> 32 - t >>> 0;
 }
 const We = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
@@ -1259,14 +1310,14 @@ function Ke(e) {
     e[t] = De(e[t]);
   return e;
 }
-const Bt = We ? (e) => e : Ke;
+const At = We ? (e) => e : Ke;
 function Me(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" ? Me(e) : _(e, void 0, t);
+function Bt(e, t = "") {
+  return typeof e == "string" ? Me(e) : R(e, void 0, t);
 }
 function Ne(e, t) {
   if (t !== void 0 && {}.toString.call(t) !== "[object Object]")
@@ -1280,7 +1331,7 @@ function rt(e, t = {}) {
 const jt = (e) => ({
   oid: Uint8Array.from([6, 9, 96, 134, 72, 1, 101, 3, 4, 2, e])
 });
-class zt {
+class Gt {
   constructor(t, n) {
     f(this, "oHash");
     f(this, "iHash");
@@ -1288,7 +1339,7 @@ class zt {
     f(this, "outputLen");
     f(this, "finished", !1);
     f(this, "destroyed", !1);
-    if (Xt(t), _(n, void 0, "key"), this.iHash = t.create(), typeof this.iHash.update != "function")
+    if (Nt(t), R(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);
@@ -1301,10 +1352,10 @@ class zt {
     this.oHash.update(r), A(r);
   }
   update(t) {
-    return K(this), this.iHash.update(t), this;
+    return M(this), this.iHash.update(t), this;
   }
   digestInto(t) {
-    K(this), _(t, this.outputLen, "output"), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
+    M(this), R(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);
@@ -1322,12 +1373,12 @@ class zt {
     this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
   }
 }
-const yt = (e, t, n) => new zt(e, t).update(n).digest();
-yt.create = (e, t) => new zt(e, t);
+const yt = (e, t, n) => new Gt(e, t).update(n).digest();
+yt.create = (e, t) => new Gt(e, t);
 function Xe(e, t, n) {
   return e & t ^ ~e & n;
 }
-function Ge(e, t, n) {
+function je(e, t, n) {
   return e & t ^ e & n ^ t & n;
 }
 class mt {
@@ -1346,7 +1397,7 @@ class mt {
     this.blockLen = t, this.outputLen = n, this.padOffset = s, this.isLE = r, this.buffer = new Uint8Array(t), this.view = et(this.buffer);
   }
   update(t) {
-    K(this), _(t);
+    M(this), R(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);
@@ -1361,21 +1412,21 @@ class mt {
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
-    K(this), Gt(t, this), this.finished = !0;
+    M(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 u = i; u < r; u++)
-      n[u] = 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;
     if (c % 4)
       throw new Error("_sha2: outputLen must be aligned to 32bit");
-    const l = c / 4, h = this.get();
-    if (l > h.length)
+    const u = c / 4, h = this.get();
+    if (u > h.length)
       throw new Error("_sha2: outputLen bigger than state");
-    for (let u = 0; u < l; u++)
-      a.setUint32(4 * u, h[u], o);
+    for (let l = 0; l < u; l++)
+      a.setUint32(4 * l, h[l], o);
   }
   digest() {
     const { buffer: t, outputLen: n } = this;
@@ -1392,7 +1443,7 @@ class mt {
     return this._cloneInto();
   }
 }
-const $ = /* @__PURE__ */ Uint32Array.from([
+const L = /* @__PURE__ */ Uint32Array.from([
   1779033703,
   3144134277,
   1013904242,
@@ -1418,7 +1469,7 @@ const $ = /* @__PURE__ */ Uint32Array.from([
   4215389547,
   1541459225,
   327033209
-]), je = /* @__PURE__ */ Uint8Array.from([
+]), Ge = /* @__PURE__ */ Uint8Array.from([
   7,
   4,
   13,
@@ -1435,19 +1486,19 @@ const $ = /* @__PURE__ */ Uint32Array.from([
   14,
   11,
   8
-]), 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]];
+]), zt = Uint8Array.from(new Array(16).fill(0).map((e, t) => t)), ze = zt.map((e) => (9 * e + 5) % 16), qt = /* @__PURE__ */ (() => {
+  const n = [[zt], [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) => Ge[o]));
   return n;
-})(), Jt = Zt[0], Yt = Zt[1], Qt = /* @__PURE__ */ [
+})(), Zt = qt[0], Jt = qt[1], Yt = /* @__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)), qe = /* @__PURE__ */ Jt.map((e, t) => e.map((n) => Qt[t][n])), Ze = /* @__PURE__ */ Yt.map((e, t) => e.map((n) => Qt[t][n])), Je = /* @__PURE__ */ Uint32Array.from([
+].map((e) => Uint8Array.from(e)), qe = /* @__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([
   0,
   1518500249,
   1859775393,
@@ -1481,21 +1532,21 @@ class Qe extends mt {
     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 b = 0; b < 16; b++, s += 4)
-      z[b] = n.getUint32(s, !0);
-    let r = this.h0 | 0, o = r, i = this.h1 | 0, a = i, c = this.h2 | 0, l = c, h = this.h3 | 0, u = h, d = this.h4 | 0, p = d;
-    for (let b = 0; b < 5; b++) {
-      const m = 4 - b, x = Je[b], y = Ye[b], w = Jt[b], g = Yt[b], P = qe[b], v = Ze[b];
-      for (let T = 0; T < 16; T++) {
-        const E = j(r + $t(b, i, c, h) + z[w[T]] + x, P[T]) + d | 0;
-        r = d, d = h, h = j(c, 10) | 0, c = i, i = E;
+    for (let p = 0; p < 16; p++, s += 4)
+      z[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 m = 4 - p, x = Je[p], y = Ye[p], w = Zt[p], b = Jt[p], P = qe[p], T = Ze[p];
+      for (let v = 0; v < 16; v++) {
+        const E = G(r + $t(p, i, c, h) + z[w[v]] + x, P[v]) + d | 0;
+        r = d, d = h, h = G(c, 10) | 0, c = i, i = E;
       }
-      for (let T = 0; T < 16; T++) {
-        const E = j(o + $t(m, a, l, u) + z[g[T]] + y, v[T]) + p | 0;
-        o = p, p = u, u = j(l, 10) | 0, l = a, a = E;
+      for (let v = 0; v < 16; v++) {
+        const E = G(o + $t(m, a, u, l) + z[b[v]] + y, T[v]) + g | 0;
+        o = g, g = l, l = G(u, 10) | 0, u = a, a = E;
       }
     }
-    this.set(this.h1 + c + u | 0, this.h2 + h + p | 0, this.h3 + d + o | 0, this.h4 + r + a | 0, this.h0 + i + l | 0);
+    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);
   }
   roundClean() {
     A(z);
@@ -1504,11 +1555,11 @@ class Qe extends mt {
     this.destroyed = !0, A(this.buffer), this.set(0, 0, 0, 0, 0);
   }
 }
-const tn = /* @__PURE__ */ rt(() => new Qe()), q = /* @__PURE__ */ BigInt(2 ** 32 - 1), Lt = /* @__PURE__ */ BigInt(32);
+const tn = /* @__PURE__ */ rt(() => new Qe()), q = /* @__PURE__ */ BigInt(2 ** 32 - 1), Ut = /* @__PURE__ */ BigInt(32);
 function en(e, t = !1) {
-  return t ? { h: Number(e & q), l: Number(e >> Lt & q) } : { h: Number(e >> Lt & q) | 0, l: Number(e & q) | 0 };
+  return t ? { h: Number(e & q), l: Number(e >> Ut & q) } : { h: Number(e >> Ut & q) | 0, l: Number(e & q) | 0 };
 }
-function te(e, t = !1) {
+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++) {
@@ -1517,8 +1568,8 @@ function te(e, t = !1) {
   }
   return [s, r];
 }
-const Ft = (e, t, n) => e >>> n, Ot = (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 U(e, t, n, s) {
+const Lt = (e, t, n) => e >>> n, Ft = (e, t, n) => e << 32 - n | t >>> n, V = (e, t, n) => e >>> n | t << 32 - n, W = (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 r = (t >>> 0) + (s >>> 0);
   return { h: e + n + (r / 2 ** 32 | 0) | 0, l: r | 0 };
 }
@@ -1587,7 +1638,7 @@ const an = (e, t, n) => (e >>> 0) + (t >>> 0) + (n >>> 0), cn = (e, t, n, s) =>
   2756734187,
   3204031479,
   3329325298
-]), L = /* @__PURE__ */ new Uint32Array(64);
+]), F = /* @__PURE__ */ new Uint32Array(64);
 class pn extends mt {
   constructor(t) {
     super(64, t, 8, !1);
@@ -1601,21 +1652,21 @@ class pn extends mt {
     this.A = t | 0, this.B = n | 0, this.C = s | 0, this.D = r | 0, this.E = o | 0, this.F = i | 0, this.G = a | 0, this.H = c | 0;
   }
   process(t, n) {
-    for (let u = 0; u < 16; u++, n += 4)
-      L[u] = t.getUint32(n, !1);
-    for (let u = 16; u < 64; u++) {
-      const d = L[u - 15], p = L[u - 2], b = B(d, 7) ^ B(d, 18) ^ d >>> 3, m = B(p, 17) ^ B(p, 19) ^ p >>> 10;
-      L[u] = m + L[u - 7] + b + L[u - 16] | 0;
+    for (let l = 0; l < 16; l++, n += 4)
+      F[l] = t.getUint32(n, !1);
+    for (let l = 16; l < 64; l++) {
+      const d = F[l - 15], g = F[l - 2], p = B(d, 7) ^ B(d, 18) ^ d >>> 3, m = B(g, 17) ^ B(g, 19) ^ g >>> 10;
+      F[l] = m + F[l - 7] + p + F[l - 16] | 0;
     }
-    let { A: s, B: r, C: o, D: i, E: a, F: c, G: l, H: h } = this;
-    for (let u = 0; u < 64; u++) {
-      const d = B(a, 6) ^ B(a, 11) ^ B(a, 25), p = h + d + Xe(a, c, l) + dn[u] + L[u] | 0, m = (B(s, 2) ^ B(s, 13) ^ B(s, 22)) + Ge(s, r, o) | 0;
-      h = l, l = c, c = a, a = i + p | 0, i = o, o = r, r = s, s = p + m | 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] + F[l] | 0, m = (B(s, 2) ^ B(s, 13) ^ B(s, 22)) + je(s, r, o) | 0;
+      h = u, u = c, c = a, a = i + g | 0, i = o, o = r, r = s, s = g + m | 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, l = l + this.G | 0, h = h + this.H | 0, this.set(s, r, o, i, a, c, l, h);
+    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(F);
   }
   destroy() {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), A(this.buffer);
@@ -1626,17 +1677,17 @@ class bn extends pn {
     super(32);
     // We cannot use array here since array allows indexing by variable
     // which means optimizer/compiler cannot use registers.
-    f(this, "A", $[0] | 0);
-    f(this, "B", $[1] | 0);
-    f(this, "C", $[2] | 0);
-    f(this, "D", $[3] | 0);
-    f(this, "E", $[4] | 0);
-    f(this, "F", $[5] | 0);
-    f(this, "G", $[6] | 0);
-    f(this, "H", $[7] | 0);
+    f(this, "A", L[0] | 0);
+    f(this, "B", L[1] | 0);
+    f(this, "C", L[2] | 0);
+    f(this, "D", L[3] | 0);
+    f(this, "E", L[4] | 0);
+    f(this, "F", L[5] | 0);
+    f(this, "G", L[6] | 0);
+    f(this, "H", L[7] | 0);
   }
 }
-const ee = te([
+const te = Qt([
   "0x428a2f98d728ae22",
   "0x7137449123ef65cd",
   "0xb5c0fbcfec4d3b2f",
@@ -1717,38 +1768,38 @@ const ee = te([
   "0x597f299cfc657e2a",
   "0x5fcb6fab3ad6faec",
   "0x6c44198c4a475817"
-].map((e) => BigInt(e))), xn = ee[0], gn = ee[1], F = /* @__PURE__ */ new Uint32Array(80), O = /* @__PURE__ */ new Uint32Array(80);
+].map((e) => BigInt(e))), gn = te[0], xn = te[1], C = /* @__PURE__ */ new Uint32Array(80), O = /* @__PURE__ */ new Uint32Array(80);
 class yn extends mt {
   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: l, El: h, Fh: u, Fl: d, Gh: p, Gl: b, Hh: m, Hl: x } = this;
-    return [t, n, s, r, o, i, a, c, l, h, u, d, p, b, m, 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: d, Gh: g, Gl: p, Hh: m, Hl: x } = this;
+    return [t, n, s, r, o, i, a, c, u, h, l, d, g, p, m, x];
   }
   // prettier-ignore
-  set(t, n, s, r, o, i, a, c, l, h, u, d, p, b, m, 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 = l | 0, this.El = h | 0, this.Fh = u | 0, this.Fl = d | 0, this.Gh = p | 0, this.Gl = b | 0, this.Hh = m | 0, this.Hl = x | 0;
+  set(t, n, s, r, o, i, a, c, u, h, l, d, g, p, m, 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 = m | 0, this.Hl = x | 0;
   }
   process(t, n) {
-    for (let g = 0; g < 16; g++, n += 4)
-      F[g] = t.getUint32(n), O[g] = t.getUint32(n += 4);
-    for (let g = 16; g < 80; g++) {
-      const P = F[g - 15] | 0, v = O[g - 15] | 0, T = R(P, v, 1) ^ R(P, v, 8) ^ Ft(P, v, 7), E = V(P, v, 1) ^ V(P, v, 8) ^ Ot(P, v, 7), I = F[g - 2] | 0, k = O[g - 2] | 0, X = R(I, k, 19) ^ Z(I, k, 61) ^ Ft(I, k, 6), ot = V(I, k, 19) ^ J(I, k, 61) ^ Ot(I, k, 6), G = un(E, ot, O[g - 7], O[g - 16]), it = ln(G, T, X, F[g - 7], F[g - 16]);
-      F[g] = it | 0, O[g] = G | 0;
+    for (let b = 0; b < 16; b++, n += 4)
+      C[b] = t.getUint32(n), O[b] = t.getUint32(n += 4);
+    for (let b = 16; b < 80; b++) {
+      const P = C[b - 15] | 0, T = O[b - 15] | 0, v = V(P, T, 1) ^ V(P, T, 8) ^ Lt(P, T, 7), E = W(P, T, 1) ^ W(P, T, 8) ^ Ft(P, T, 7), k = C[b - 2] | 0, I = O[b - 2] | 0, U = V(k, I, 19) ^ Z(k, I, 61) ^ Lt(k, I, 6), ot = W(k, I, 19) ^ J(k, I, 61) ^ Ft(k, I, 6), j = un(E, ot, O[b - 7], O[b - 16]), it = ln(j, v, U, C[b - 7], C[b - 16]);
+      C[b] = it | 0, O[b] = j | 0;
     }
-    let { Ah: s, Al: r, Bh: o, Bl: i, Ch: a, Cl: c, Dh: l, Dl: h, Eh: u, El: d, Fh: p, Fl: b, Gh: m, Gl: x, Hh: y, Hl: w } = this;
-    for (let g = 0; g < 80; g++) {
-      const P = R(u, d, 14) ^ R(u, d, 18) ^ Z(u, d, 41), v = V(u, d, 14) ^ V(u, d, 18) ^ J(u, d, 41), T = u & p ^ ~u & m, E = d & b ^ ~d & x, I = hn(w, v, E, gn[g], O[g]), k = fn(I, y, P, T, xn[g], F[g]), X = I | 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, ce = r & i ^ r & c ^ i & c;
-      y = m | 0, w = x | 0, m = p | 0, x = b | 0, p = u | 0, b = d | 0, { h: u, l: d } = U(l | 0, h | 0, k | 0, X | 0), l = a | 0, h = c | 0, a = o | 0, c = i | 0, o = s | 0, i = r | 0;
-      const Pt = an(X, G, ce);
-      s = cn(Pt, k, 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: d, Fh: g, Fl: p, Gh: m, Gl: x, Hh: y, Hl: w } = this;
+    for (let b = 0; b < 80; b++) {
+      const P = V(l, d, 14) ^ V(l, d, 18) ^ Z(l, d, 41), T = W(l, d, 14) ^ W(l, d, 18) ^ J(l, d, 41), v = l & g ^ ~l & m, E = d & p ^ ~d & x, k = hn(w, T, E, xn[b], O[b]), I = fn(k, y, P, v, gn[b], C[b]), U = k | 0, ot = V(s, r, 28) ^ Z(s, r, 34) ^ Z(s, r, 39), j = W(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 = m | 0, w = x | 0, m = 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, j, ae);
+      s = cn(Pt, I, ot, it), r = Pt | 0;
     }
-    ({ 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: 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: p, l: b } = U(this.Fh | 0, this.Fl | 0, p | 0, b | 0), { h: m, l: x } = U(this.Gh | 0, this.Gl | 0, m | 0, x | 0), { h: y, l: w } = U(this.Hh | 0, this.Hl | 0, y | 0, w | 0), this.set(s, r, o, i, a, c, l, h, u, d, p, b, m, x, y, w);
+    ({ 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: m, l: x } = $(this.Gh | 0, this.Gl | 0, m | 0, x | 0), { h: y, l: w } = $(this.Hh | 0, this.Hl | 0, y | 0, w | 0), this.set(s, r, o, i, a, c, u, h, l, d, g, p, m, x, y, w);
   }
   roundClean() {
-    A(F, O);
+    A(C, O);
   }
   destroy() {
     A(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
@@ -1778,32 +1829,32 @@ class mn extends yn {
 const wn = /* @__PURE__ */ rt(
   () => new bn(),
   /* @__PURE__ */ jt(1)
-), ne = /* @__PURE__ */ rt(
+), ee = /* @__PURE__ */ rt(
   () => new mn(),
   /* @__PURE__ */ jt(3)
-), Pn = BigInt(0), M = BigInt(1), Tn = BigInt(2), vn = BigInt(7), kn = BigInt(256), Hn = BigInt(113), se = [], re = [], oe = [];
-for (let e = 0, t = M, n = 1, s = 0; e < 24; e++) {
-  [n, s] = [s, (2 * n + 3 * s) % 5], se.push(2 * (5 * s + n)), re.push((e + 1) * (e + 2) / 2 % 64);
+), 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++) {
+  [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;
   for (let o = 0; o < 7; o++)
-    t = (t << M ^ (t >> vn) * Hn) % kn, t & Tn && (r ^= M << (M << BigInt(o)) - M);
-  oe.push(r);
+    t = (t << N ^ (t >> vn) * Hn) % kn, t & Tn && (r ^= N << (N << BigInt(o)) - N);
+  re.push(r);
 }
-const ie = te(oe, !0), In = ie[0], En = ie[1], Ct = (e, t, n) => n > 32 ? rn(e, t, n) : nn(e, t, n), _t = (e, t, n) => n > 32 ? on(e, t, n) : sn(e, t, n);
+const oe = Qt(re, !0), In = oe[0], En = oe[1], Ct = (e, t, n) => n > 32 ? rn(e, t, n) : nn(e, t, n), Ot = (e, t, n) => n > 32 ? on(e, t, n) : sn(e, t, n);
 function Sn(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 = Ct(l, h, 1) ^ n[a], d = _t(l, h, 1) ^ n[a + 1];
-      for (let p = 0; p < 50; p += 10)
-        e[i + p] ^= u, e[i + p + 1] ^= d;
+      const a = (i + 8) % 10, c = (i + 2) % 10, u = n[c], h = n[c + 1], l = Ct(u, h, 1) ^ n[a], d = Ot(u, h, 1) ^ n[a + 1];
+      for (let g = 0; g < 50; g += 10)
+        e[i + g] ^= l, e[i + g + 1] ^= d;
     }
     let r = e[2], o = e[3];
     for (let i = 0; i < 24; i++) {
-      const a = re[i], c = Ct(r, o, a), l = _t(r, o, a), h = se[i];
-      r = e[h], o = e[h + 1], e[h] = c, e[h + 1] = l;
+      const a = se[i], c = Ct(r, o, a), u = Ot(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) {
       for (let a = 0; a < 10; a++)
@@ -1829,7 +1880,7 @@ class wt {
     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, C(s, "outputLen"), !(0 < t && t < 200))
+    if (this.blockLen = t, this.suffix = n, this.outputLen = s, this.enableXOF = r, this.rounds = o, _(s, "outputLen"), !(0 < t && t < 200))
       throw new Error("only keccak-f1600 function is supported");
     this.state = new Uint8Array(200), this.state32 = Ve(this.state);
   }
@@ -1837,10 +1888,10 @@ class wt {
     return this._cloneInto();
   }
   keccak() {
-    Bt(this.state32), Sn(this.state32, this.rounds), Bt(this.state32), this.posOut = 0, this.pos = 0;
+    At(this.state32), Sn(this.state32, this.rounds), At(this.state32), this.posOut = 0, this.pos = 0;
   }
   update(t) {
-    K(this), _(t);
+    M(this), R(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);
@@ -1858,7 +1909,7 @@ class wt {
     t[s] ^= n, (n & 128) !== 0 && s === r - 1 && this.keccak(), t[r - 1] ^= 128, this.keccak();
   }
   writeInto(t) {
-    K(this, !1), _(t), this.finish();
+    M(this, !1), R(t), this.finish();
     const n = this.state, { blockLen: s } = this;
     for (let r = 0, o = t.length; r < o; ) {
       this.posOut >= s && this.keccak();
@@ -1873,10 +1924,10 @@ class wt {
     return this.writeInto(t);
   }
   xof(t) {
-    return C(t), this.xofInto(new Uint8Array(t));
+    return _(t), this.xofInto(new Uint8Array(t));
   }
   digestInto(t) {
-    if (Gt(t, this), this.finished)
+    if (Xt(t, this), this.finished)
       throw new Error("digest() was already called");
     return this.writeInto(t), this.destroy(), t;
   }
@@ -1892,49 +1943,49 @@ class wt {
   }
 }
 const An = (e, t, n, s = {}) => rt(() => new wt(t, e, n), s), Bn = /* @__PURE__ */ An(1, 136, 32);
-function Un(e, t, n, s) {
-  Xt(e);
+function $n(e, t, n, s) {
+  Nt(e);
   const r = Ne({ dkLen: 32, asyncTick: 10 }, s), { c: o, dkLen: i, asyncTick: a } = r;
-  if (C(o, "c"), C(i, "dkLen"), C(a, "asyncTick"), o < 1)
+  if (_(o, "c"), _(i, "dkLen"), _(a, "asyncTick"), o < 1)
     throw new Error("iterations (c) must be >= 1");
-  const c = Ut(t, "password"), l = Ut(n, "salt"), h = new Uint8Array(i), u = yt.create(e, c), d = u._cloneInto().update(l);
-  return { c: o, dkLen: i, asyncTick: a, DK: h, PRF: u, PRFSalt: d };
+  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 };
 }
-function $n(e, t, n, s, r) {
+function Un(e, t, n, s, r) {
   return e.destroy(), t.destroy(), s && s.destroy(), A(r), n;
 }
 function Ln(e, t, n, s) {
-  const { c: r, dkLen: o, DK: i, PRF: a, PRFSalt: c } = Un(e, t, n, s);
-  let l;
-  const h = new Uint8Array(4), u = et(h), d = new Uint8Array(a.outputLen);
-  for (let p = 1, b = 0; b < o; p++, b += a.outputLen) {
-    const m = i.subarray(b, b + a.outputLen);
-    u.setInt32(0, p, !1), (l = c._cloneInto(l)).update(h).digestInto(d), m.set(d.subarray(0, m.length));
+  const { c: r, dkLen: o, DK: i, PRF: a, PRFSalt: c } = $n(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 m = i.subarray(p, p + a.outputLen);
+    l.setInt32(0, g, !1), (u = c._cloneInto(u)).update(h).digestInto(d), m.set(d.subarray(0, m.length));
     for (let x = 1; x < r; x++) {
-      a._cloneInto(l).update(d).digestInto(d);
+      a._cloneInto(u).update(d).digestInto(d);
       for (let y = 0; y < m.length; y++)
         m[y] ^= d[y];
     }
   }
-  return $n(a, c, i, l, d);
+  return Un(a, c, i, u, d);
 }
-function ae(e) {
+function ie(e) {
   if (typeof e != "string")
     throw new TypeError("invalid mnemonic type: " + typeof e);
   return e.normalize("NFKD");
 }
 function Fn(e) {
-  const t = ae(e), n = t.split(" ");
+  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) => ae("mnemonic" + e);
-function Cn(e, t = "") {
-  return Ln(ne, Fn(e).nfkd, On(t), { c: 2048, dkLen: 64 });
+const Cn = (e) => ie("mnemonic" + e);
+function On(e, t = "") {
+  return Ln(ee, Fn(e).nfkd, Cn(t), { c: 2048, dkLen: 64 });
 }
-const _n = 508, Rt = 16, Y = 32, Q = 64, Vt = 5, Rn = 4;
-function N(...e) {
+const _n = 508, _t = 16, Y = 32, Q = 64, Rt = 5, Rn = 4;
+function X(...e) {
   const t = e.reduce((r, o) => r + o.length, 0), n = new Uint8Array(t);
   let s = 0;
   for (const r of e)
@@ -1946,17 +1997,17 @@ function lt(e) {
 }
 function ht(e) {
   const t = new Uint8Array(Rn);
-  return new DataView(t.buffer).setUint32(0, e.length, !1), N(t, e);
+  return new DataView(t.buffer).setUint32(0, e.length, !1), X(t, e);
 }
 function ft(e, t) {
-  return yt(ne, e, t);
+  return yt(ee, e, t);
 }
-function Wt(e) {
+function Vt(e) {
   return tn(wn(e));
 }
-const xt = (e) => Array.from(e).map((t) => t.toString(16).padStart(2, "0")).join("");
+const gt = (e) => Array.from(e).map((t) => t.toString(16).padStart(2, "0")).join("");
 function Vn(e) {
-  const t = Cn(e);
+  const t = On(e);
   return new Uint8Array(t);
 }
 async function Wn(e, t, n, s) {
@@ -1964,40 +2015,40 @@ async function Wn(e, t, n, s) {
     throw new Error(
       `Lamport seed must be ${Q} bytes, got ${e.length}`
     );
-  t = W(t), n = W(n);
+  t = D(t), n = D(n);
   const r = e.slice(Y, Q), o = e.slice(0, Y), i = [r, o];
   try {
-    const a = N(
+    const a = X(
       ht(lt(t)),
       ht(lt(n)),
       ht(lt(s))
-    ), c = N(o, a);
+    ), c = X(o, a);
     i.push(c);
-    const l = ft(r, c);
-    i.push(l);
-    const h = l.slice(0, Y), u = l.slice(Y, Q);
-    i.push(h, u);
-    const d = [], p = [], b = [], m = [];
+    const u = ft(r, c);
+    i.push(u);
+    const h = u.slice(0, Y), l = u.slice(Y, Q);
+    i.push(h, l);
+    const d = [], g = [], p = [], m = [];
     let x = !1;
     try {
       for (let y = 0; y < _n; y++) {
-        const w = new Uint8Array(Vt);
+        const w = new Uint8Array(Rt);
         w[0] = 0, new DataView(w.buffer).setUint32(1, y, !1);
-        const g = new Uint8Array(Vt);
-        g[0] = 1, new DataView(g.buffer).setUint32(1, y, !1);
-        const P = N(h, w), v = N(h, g), T = ft(u, P), E = ft(u, v);
+        const b = new Uint8Array(Rt);
+        b[0] = 1, new DataView(b.buffer).setUint32(1, y, !1);
+        const P = X(h, w), T = X(h, b), v = ft(l, P), E = ft(l, T);
         try {
-          const I = T.slice(0, Rt), k = E.slice(0, Rt);
-          d.push(I), p.push(k), b.push(Wt(I)), m.push(Wt(k));
+          const k = v.slice(0, _t), I = E.slice(0, _t);
+          d.push(k), g.push(I), p.push(Vt(k)), m.push(Vt(I));
         } finally {
-          P.fill(0), v.fill(0), T.fill(0), E.fill(0);
+          P.fill(0), T.fill(0), v.fill(0), E.fill(0);
         }
       }
-      return x = !0, { falsePreimages: d, truePreimages: p, falseHashes: b, trueHashes: m };
+      return x = !0, { falsePreimages: d, truePreimages: g, falseHashes: p, trueHashes: m };
     } finally {
       if (!x) {
         for (const y of d) y.fill(0);
-        for (const y of p) y.fill(0);
+        for (const y of g) y.fill(0);
       }
     }
   } finally {
@@ -2007,8 +2058,8 @@ async function Wn(e, t, n, s) {
 }
 function as(e) {
   return {
-    false_list: e.falseHashes.map(xt),
-    true_list: e.trueHashes.map(xt)
+    false_list: e.falseHashes.map(gt),
+    true_list: e.trueHashes.map(gt)
   };
 }
 function Dn(e) {
@@ -2023,7 +2074,7 @@ function Dn(e) {
   for (const i of e.trueHashes)
     s.set(i, r), r += t;
   const o = Bn(s);
-  return `0x${xt(o)}`;
+  return `0x${gt(o)}`;
 }
 async function cs(e, t, n, s) {
   const r = Vn(e);
@@ -2051,14 +2102,14 @@ function us(e) {
 export {
   Dn as A,
   tt as B,
-  D as C,
+  K as C,
   cs as D,
   us as E,
-  $e as M,
+  Ue as M,
   os as P,
   zn as a,
   Zn as b,
-  At as c,
+  St as c,
   Jn as d,
   Se as e,
   Ae as f,
@@ -2071,11 +2122,11 @@ export {
   ns as m,
   Yn as n,
   Fe as o,
-  Oe as p,
+  Ce as p,
   Le as q,
   ct as r,
   Ee as s,
-  gt as t,
+  xt as t,
   ss as u,
   rs as v,
   ut as w,
@@ -2083,4 +2134,4 @@ export {
   Wn as y,
   as as z
 };
-//# sourceMappingURL=errors-fLxe1eml.js.map
+//# sourceMappingURL=errors-DOJdtNTD.js.map