@babylonlabs-io/ts-sdk 0.15.3 → 0.16.0

package/dist/{errors-UqmtfBtv.js → errors-BEUjAw2k.js}

@@ -1,13 +1,13 @@
-var de = Object.defineProperty;
-var fe = (e, t, n) => t in e ? de(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
-var p = (e, t, n) => fe(e, typeof t != "symbol" ? t + "" : t, n);
-import * as pe from "bitcoinjs-lib";
-import { script as ge, Transaction as J, address as be, Psbt as bt } from "bitcoinjs-lib";
-import { Buffer as S } from "buffer";
-import { P as ye, y as xe, D as Mt, M as Ht, B as we, T as me, H as Nt, G as yt, u as B, b as Pe, A as Te, E as ve, a as ke, d as He, e as Ee, f as Ie, s as U, q as Se, x as Et, h as It, i as St, r as Be } from "./challengeAssert-C5DQSUnp.js";
-import { createPublicClient as lt, http as ht, encodeFunctionData as Bt, zeroAddress as Ae } from "viem";
+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";
+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 $e(e, t, n, s) {
+function Ae(e, t, n, s) {
   if (!Number.isInteger(s) || s < 1)
     throw new Error(
       `Invalid numOutputs: expected a positive integer, got ${s}`
@@ -15,8 +15,8 @@ function $e(e, t, n, s) {
   if (e.length === 0)
     throw new Error("Insufficient funds: no UTXOs available");
   const o = e.filter((l) => {
-    const h = S.from(l.scriptPubKey, "hex");
-    return !!ge.decompile(h);
+    const h = W.from(l.scriptPubKey, "hex");
+    return !!pe.decompile(h);
   });
   if (o.length === 0)
     throw new Error(
@@ -26,20 +26,20 @@ function $e(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 * ye, u = s * Ht, d = h + u + me;
-    if (c = BigInt(Math.ceil(d * n)) + BigInt(xe(n)), a - t - c > Mt) {
-      const g = BigInt(
+    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 y = BigInt(
         Math.ceil(Ht * n)
       );
-      c += g;
+      c += y;
     }
     if (a >= t + c) {
-      const g = a - t - c;
+      const y = a - t - c;
       return {
         selectedUTXOs: i,
         totalValue: a,
         fee: c,
-        changeAmount: g
+        changeAmount: y
       };
     }
   }
@@ -47,106 +47,18 @@ function $e(e, t, n, s) {
     `Insufficient funds: need ${t + c} sats (${t} pegin + ${c} fee), have ${a} sats`
   );
 }
-function Yn(e) {
+function Jn(e) {
   return e > Mt;
 }
-function Qn() {
-  return we;
+function Yn() {
+  return xe;
 }
-function dt(e) {
+function ht(e) {
   const t = e.startsWith("0x") ? e.slice(2) : e;
-  return `0x${J.fromHex(t).getId()}`;
-}
-function ts(e, t, n) {
-  if (Nt(), e.length === 0)
-    throw new Error("No input UTXOs provided for split transaction");
-  if (t.length === 0)
-    throw new Error("No outputs specified for split transaction");
-  for (const c of t)
-    if (c.amount <= 0n)
-      throw new Error(
-        `Invalid output amount for ${c.address}: ${c.amount} satoshis. Amount must be greater than zero.`
-      );
-  const s = yt(n), o = new J();
-  o.version = 2;
-  for (const c of e) {
-    const l = S.from(c.txid, "hex").reverse();
-    o.addInput(l, c.vout);
-  }
-  const r = [];
-  for (let c = 0; c < t.length; c++) {
-    const l = t[c];
-    let h;
-    try {
-      h = be.toOutputScript(l.address, s);
-    } catch (u) {
-      throw new Error(
-        `Failed to decode address "${l.address}": ${u instanceof Error ? u.message : String(u)}`
-      );
-    }
-    o.addOutput(h, Number(l.amount)), r.push({
-      txid: "",
-      // Will be set after txid calculation
-      vout: c,
-      value: Number(l.amount),
-      scriptPubKey: h.toString("hex")
-    });
-  }
-  const i = o.toHex(), a = o.getId();
-  for (const c of r)
-    c.txid = a;
-  return {
-    txHex: i,
-    txid: a,
-    outputs: r
-  };
+  return `0x${gt.fromHex(t).getId()}`;
 }
-function es(e, t, n) {
-  const s = J.fromHex(e), o = new bt();
-  if (o.setVersion(s.version), o.setLocktime(s.locktime), !S.isBuffer(n) || n.length !== 32)
-    throw new Error(
-      `Invalid publicKeyNoCoord: expected 32-byte Buffer (x-only pubkey), got ${S.isBuffer(n) ? `${n.length}-byte Buffer` : typeof n}`
-    );
-  if (t.length !== s.ins.length)
-    throw new Error(
-      `UTXO count mismatch: transaction has ${s.ins.length} input${s.ins.length !== 1 ? "s" : ""}, but ${t.length} UTXO${t.length !== 1 ? "s were" : " was"} provided`
-    );
-  for (let r = 0; r < s.ins.length; r++) {
-    const i = s.ins[r], a = t[r];
-    if (!a)
-      throw new Error(`Missing UTXO data for input ${r}`);
-    const c = S.from(i.hash).reverse().toString("hex"), l = i.index;
-    if (a.txid !== c || a.vout !== l)
-      throw new Error(
-        `Input ${r} outpoint mismatch: transaction expects ${c}:${l}, 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)
-    h[1] === 32))
-      throw new Error(
-        `Input ${r} must be P2TR (Taproot). createSplitTransactionPsbt() requires P2TR inputs because it uses tapInternalKey for Taproot signing. ScriptPubKey: ${a.scriptPubKey.substring(0, 20)}...`
-      );
-    const d = {
-      script: S.from(a.scriptPubKey, "hex"),
-      value: a.value
-    };
-    o.addInput({
-      hash: i.hash,
-      index: i.index,
-      sequence: i.sequence,
-      witnessUtxo: d,
-      tapInternalKey: n
-    });
-  }
-  for (const r of s.outs)
-    o.addOutput({
-      script: r.script,
-      value: r.value
-    });
-  return o.toHex();
-}
-var rt = /* @__PURE__ */ ((e) => (e.P2PKH = "P2PKH", e.P2SH = "P2SH", e.P2WPKH = "P2WPKH", e.P2WSH = "P2WSH", e.P2TR = "P2TR", e.UNKNOWN = "UNKNOWN", e))(rt || {});
-function Ue(e) {
+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) {
   const t = e.length;
   return t === 25 && e[0] === 118 && // OP_DUP
   e[1] === 169 && // OP_HASH160
@@ -160,16 +72,16 @@ function Ue(e) {
   e[1] === 32 ? "P2TR" : "UNKNOWN";
 }
 function Fe(e, t) {
-  const n = S.from(e.scriptPubKey, "hex"), s = Ue(n);
+  const n = W.from(e.scriptPubKey, "hex"), s = Ce(n);
   switch (s) {
-    case rt.P2WPKH:
+    case ot.P2WPKH:
       return {
         witnessUtxo: {
           script: n,
           value: e.value
         }
       };
-    case rt.P2WSH: {
+    case ot.P2WSH: {
       if (!e.witnessScript)
         throw new Error("Missing witnessScript for P2WSH input");
       return {
@@ -177,10 +89,10 @@ function Fe(e, t) {
           script: n,
           value: e.value
         },
-        witnessScript: S.from(e.witnessScript, "hex")
+        witnessScript: W.from(e.witnessScript, "hex")
       };
     }
-    case rt.P2TR: {
+    case ot.P2TR: {
       if (t && t.length !== 32)
         throw new Error(
           `Invalid tapInternalKey length: expected 32 bytes, got ${t.length}`
@@ -198,7 +110,7 @@ function Fe(e, t) {
       throw new Error(`Unsupported script type: ${s}`);
   }
 }
-function xt(e, t) {
+function yt(e, t) {
   if (!Number.isInteger(t) || t < 1)
     throw new Error(`inputCount must be a positive integer, got ${t}`);
   return {
@@ -210,22 +122,22 @@ function xt(e, t) {
     }))
   };
 }
-const Ce = 21e6 * 1e8, Xt = 1e4;
-function qt(e) {
-  return Number.isInteger(e) && e > 0 && e <= Ce;
+const Ue = 21e6 * 1e8, Nt = 1e4;
+function Xt(e) {
+  return Number.isInteger(e) && e > 0 && e <= Ue;
 }
-function Oe(e) {
-  return Number.isInteger(e) && e > 0 && e <= Xt;
+function $e(e) {
+  return Number.isInteger(e) && e > 0 && e <= Nt;
 }
-function Gt(e, t) {
+function qt(e, t) {
   return !Number.isInteger(e) || e < 0 ? !1 : t === void 0 || e < t;
 }
-const Le = {
+const Oe = {
   mainnet: "https://mempool.space/api",
   testnet: "https://mempool.space/testnet/api",
   signet: "https://mempool.space/signet/api"
 };
-async function at(e, t) {
+async function it(e, t) {
   try {
     const n = await fetch(e, t);
     if (!n.ok) {
@@ -240,7 +152,7 @@ async function at(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 _e(e, t) {
+async function Le(e, t) {
   try {
     const n = await fetch(`${t}/tx`, {
       method: "POST",
@@ -266,10 +178,10 @@ async function _e(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 Re(e, t) {
-  return at(`${t}/tx/${e}`);
+async function _e(e, t) {
+  return it(`${t}/tx/${e}`);
 }
-async function ns(e, t) {
+async function Qn(e, t) {
   try {
     const n = await fetch(`${t}/tx/${e}/hex`);
     if (!n.ok) {
@@ -283,14 +195,14 @@ async function ns(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 We(e, t, n) {
-  const s = await Re(e, n);
-  if (!Gt(t, s.vout.length))
+async function Re(e, t, n) {
+  const s = await _e(e, n);
+  if (!qt(t, s.vout.length))
     throw new Error(
       `Invalid vout ${t} for transaction ${e} (has ${s.vout.length} outputs)`
     );
   const o = s.vout[t];
-  if (!qt(o.value))
+  if (!Xt(o.value))
     throw new Error(`Invalid UTXO value ${o.value} for ${e}:${t}`);
   return {
     txid: e,
@@ -299,17 +211,17 @@ async function We(e, t, n) {
     scriptPubKey: o.scriptpubkey
   };
 }
-async function ss(e, t) {
+async function ts(e, t) {
   try {
-    const n = await at(`${t}/address/${e}/utxo`), s = await at(`${t}/v1/validate-address/${e}`);
+    const n = await it(`${t}/address/${e}/utxo`), s = await it(`${t}/v1/validate-address/${e}`);
     if (!s.isvalid)
       throw new Error(
         `Invalid Bitcoin address: ${e}. Mempool API validation failed.`
       );
     for (const r of n) {
-      if (!Gt(r.vout))
+      if (!qt(r.vout))
         throw new Error(`Invalid vout ${r.vout} for ${r.txid}`);
-      if (!qt(r.value))
+      if (!Xt(r.value))
         throw new Error(
           `Invalid UTXO value ${r.value} for ${r.txid}:${r.vout}`
         );
@@ -329,13 +241,13 @@ async function ss(e, t) {
     );
   }
 }
-function os(e) {
-  return Le[e];
+function es(e) {
+  return Oe[e];
 }
-async function rs(e, t) {
-  return at(`${t}/address/${e}/txs`);
+async function ns(e, t) {
+  return it(`${t}/address/${e}/txs`);
 }
-async function is(e) {
+async function ss(e) {
   const t = await fetch(`${e}/v1/fees/recommended`);
   if (!t.ok)
     throw new Error(
@@ -349,9 +261,9 @@ async function is(e) {
     "minimumFee"
   ];
   for (const o of s)
-    if (!Oe(n[o]))
+    if (!$e(n[o]))
       throw new Error(
-        `Invalid fee rate ${o}=${n[o]} from mempool API: expected a positive number ≤ ${Xt}`
+        `Invalid fee rate ${o}=${n[o]} from mempool API: expected a positive number ≤ ${Nt}`
       );
   if (n.minimumFee > n.economyFee || n.economyFee > n.hourFee || n.hourFee > n.halfHourFee || n.halfHourFee > n.fastestFee)
     throw new Error(
@@ -682,7 +594,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 mt(e) {
+function xt(e) {
   if (!e || typeof e != "object") return;
   const t = e;
   if (typeof t.data == "string" && t.data.startsWith("0x"))
@@ -701,22 +613,22 @@ function mt(e) {
   if (i)
     return i[1];
 }
-function as(e) {
-  const t = mt(e);
+function os(e) {
+  const t = xt(e);
   if (t) {
     const n = t.substring(0, 10);
     return q[t] ?? q[n];
   }
 }
-function cs(e) {
-  const t = mt(e);
+function rs(e) {
+  const t = xt(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 = mt(e);
+  const t = xt(e);
   if (console.error("[Contract Error] Extracted error data:", t), t) {
     const s = t.substring(0, 10), o = q[t] ?? q[s];
     if (o)
@@ -736,18 +648,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 Ve = 0;
-function Ke(e, t, n, s) {
+const We = 0;
+function Ve(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
-  }) : We(e, t, s);
+  }) : Re(e, t, s);
 }
-const $t = 12e4;
-class us {
+const Ct = 12e4;
+class is {
   /**
    * Creates a new PeginManager instance.
    *
@@ -798,25 +710,25 @@ class us {
       councilQuorum: t.councilQuorum,
       councilSize: t.councilSize,
       network: this.config.btcNetwork
-    }, l = await Pe(c), h = $e(
+    }, l = await me(c), h = Ae(
       [...t.availableUTXOs],
       l.totalOutputValue,
       t.mempoolFeeRate,
-      Te(l.htlcValues.length)
-    ), u = yt(this.config.btcNetwork), d = ve({
+      Pe(l.htlcValues.length)
+    ), u = It(this.config.btcNetwork), d = Te({
       unfundedTxHex: l.psbtHex,
       selectedUTXOs: h.selectedUTXOs,
       changeAddress: t.changeAddress,
       changeAmount: h.changeAmount,
       network: u
-    }), y = B(dt(d)), g = [], x = [], P = [];
+    }), g = B(ht(d)), y = [], x = [], P = [];
     for (let f = 0; f < t.hashlocks.length; f++) {
-      const w = await ke({
+      const w = await ve({
         prePeginParams: c,
         timelockPegin: t.timelockPegin,
         fundedPrePeginTxHex: d,
         htlcVout: f
-      }), v = await He({
+      }), v = await ke({
         peginTxHex: w.txHex,
         fundedPrePeginTxHex: d,
         depositorPubkey: s,
@@ -827,8 +739,8 @@ class us {
         timelockRefund: t.timelockRefund,
         network: this.config.btcNetwork
       });
-      g.push(w), x.push(v.psbtHex), P.push(
-        xt(n, 1)
+      y.push(w), x.push(v.psbtHex), P.push(
+        yt(n, 1)
       );
     }
     const m = await this.signPsbtsWithFallback(
@@ -836,7 +748,7 @@ class us {
       P
     ), b = [];
     for (let f = 0; f < m.length; f++) {
-      const w = Ee(
+      const w = He(
         m[f],
         s
       ), v = Ie(m[f]);
@@ -844,14 +756,14 @@ class us {
         htlcVout: f,
         htlcValue: l.htlcValues[f],
         peginTxHex: v,
-        peginTxid: g[f].txid,
+        peginTxid: y[f].txid,
         peginInputSignature: w,
-        vaultScriptPubKey: g[f].vaultScriptPubKey
+        vaultScriptPubKey: y[f].vaultScriptPubKey
       });
     }
     return {
       fundedPrePeginTxHex: d,
-      prePeginTxid: y,
+      prePeginTxid: g,
       unsignedPrePeginTxHex: l.psbtHex,
       perVault: b,
       selectedUTXOs: h.selectedUTXOs,
@@ -904,36 +816,36 @@ class us {
    * @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 = J.fromHex(o);
+    const { fundedPrePeginTxHex: n, depositorBtcPubkey: s } = t, o = n.startsWith("0x") ? n.slice(2) : n, r = gt.fromHex(o);
     if (r.ins.length === 0)
       throw new Error("Transaction has no inputs");
-    const i = new bt();
+    const i = new vt();
     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))
       throw new Error(
         "Invalid depositorBtcPubkey: expected 64 hex characters (x-only pubkey)"
       );
-    const c = S.from(a, "hex");
+    const c = W.from(a, "hex");
     if (c.length !== 32)
       throw new Error(
         `Invalid depositorBtcPubkey length: expected 32 bytes, got ${c.length}`
       );
     const l = this.config.mempoolApiUrl, h = r.ins.map((b) => {
-      const f = S.from(b.hash).reverse().toString("hex"), w = b.index;
-      return Ke(f, w, t.localPrevouts, l).then(
+      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 })
       );
     }), u = await Promise.all(h), d = u.reduce(
       (b, f) => b + BigInt(f.utxoData.value),
       0n
-    ), y = r.outs.reduce(
+    ), g = r.outs.reduce(
       (b, f) => b + BigInt(f.value),
       0n
     );
-    if (d < y)
+    if (d < g)
       throw new Error(
-        `UTXO value mismatch: total input value (${d} sat) is less than total output value (${y} sat). This may indicate the mempool API returned manipulated UTXO data.`
+        `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(
@@ -955,7 +867,7 @@ class us {
         script: b.script,
         value: b.value
       });
-    const g = await this.config.btcWallet.signPsbt(i.toHex()), x = bt.fromHex(g);
+    const y = await this.config.btcWallet.signPsbt(i.toHex()), x = vt.fromHex(y);
     try {
       x.finalizeAllInputs();
     } catch (b) {
@@ -967,7 +879,7 @@ class us {
         );
     }
     const P = x.extractTransaction().toHex();
-    return await _e(P, l);
+    return await Le(P, l);
   }
   /**
    * Registers a peg-in on Ethereum by calling the BTCVaultRegistry contract.
@@ -1001,24 +913,24 @@ class us {
     } = t;
     if (!this.config.ethWallet.account)
       throw new Error("Ethereum wallet account not found");
-    const d = this.config.ethWallet.account.address, y = await this.resolvePopSignature(
+    const d = this.config.ethWallet.account.address, g = await this.resolvePopSignature(
       d,
       u
     );
     c && await c();
-    const g = U(n), x = U(s), P = U(o), m = await this.resolvePayoutScriptPubKey(
+    const y = C(n), x = C(s), P = C(o), m = await this.resolvePayoutScriptPubKey(
       l
-    ), b = dt(P), f = await At(
+    ), b = ht(P), f = await At(
       B(b),
       B(d)
-    ), w = U(f);
+    ), w = C(f);
     if (await this.checkVaultExists(w))
       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.`
       );
-    const T = lt({
+    const T = ut({
       chain: this.config.ethChain,
-      transport: ht()
+      transport: lt()
     });
     let H;
     try {
@@ -1033,13 +945,13 @@ class us {
         "Failed to query pegin fee from the contract. Please check your network connection and that the contract address is correct."
       );
     }
-    const E = Bt({
+    const I = kt({
       abi: j,
       functionName: "submitPeginRequest",
       args: [
         d,
-        g,
         y,
+        g,
         x,
         P,
         r,
@@ -1049,43 +961,43 @@ class us {
         h
       ]
     });
-    let I;
+    let E;
     try {
-      I = await T.estimateGas({
+      E = await T.estimateGas({
         to: this.config.vaultContracts.btcVaultRegistry,
-        data: E,
+        data: I,
         value: H,
         account: this.config.ethWallet.account.address
       });
-    } catch (O) {
-      M(O);
+    } catch ($) {
+      M($);
     }
-    let C;
+    let U;
     try {
-      C = await this.config.ethWallet.sendTransaction({
+      U = await this.config.ethWallet.sendTransaction({
         to: this.config.vaultContracts.btcVaultRegistry,
-        data: E,
+        data: I,
         value: H,
         account: this.config.ethWallet.account,
         chain: this.config.ethChain,
-        gas: I
+        gas: E
       });
-    } catch (O) {
-      M(O);
+    } catch ($) {
+      M($);
     }
-    const D = await T.waitForTransactionReceipt({
-      hash: C,
-      timeout: $t
+    const K = await T.waitForTransactionReceipt({
+      hash: U,
+      timeout: Ct
     });
-    return D.status === "reverted" && M(
+    return K.status === "reverted" && M(
       new Error(
-        `Transaction reverted. Hash: ${C}. Check the transaction on block explorer for details.`
+        `Transaction reverted. Hash: ${U}. Check the transaction on block explorer for details.`
       )
     ), {
-      ethTxHash: D.transactionHash,
+      ethTxHash: K.transactionHash,
       vaultId: w,
       peginTxHash: b,
-      btcPopSignature: y
+      btcPopSignature: g
     };
   }
   /**
@@ -1116,21 +1028,21 @@ class us {
       );
     const l = [];
     for (const b of s) {
-      const f = U(
+      const f = C(
         b.depositorSignedPeginTx
-      ), w = dt(f), v = await At(
+      ), w = ht(f), v = await At(
         B(w),
         B(i)
-      ), T = U(v);
+      ), 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.`
         );
       l.push({ vaultId: T, peginTxHash: w });
     }
-    const h = lt({
+    const h = ut({
       chain: this.config.ethChain,
-      transport: ht()
+      transport: lt()
     });
     let u;
     try {
@@ -1145,28 +1057,28 @@ class us {
         "Failed to query pegin fee from the contract. Please check your network connection and that the contract address is correct."
       );
     }
-    const d = u * BigInt(s.length), y = s.map((b, f) => ({
-      depositorBtcPubKey: U(b.depositorBtcPubkey),
+    const d = u * BigInt(s.length), g = s.map((b, f) => ({
+      depositorBtcPubKey: C(b.depositorBtcPubkey),
       btcPopSignature: a,
-      unsignedPrePeginTx: U(b.unsignedPrePeginTx),
-      depositorSignedPeginTx: U(
+      unsignedPrePeginTx: C(b.unsignedPrePeginTx),
+      depositorSignedPeginTx: C(
         b.depositorSignedPeginTx
       ),
       hashlock: b.hashlock,
       htlcVout: b.htlcVout,
-      referralCode: Ve,
+      referralCode: We,
       depositorPayoutBtcAddress: c[f],
       depositorWotsPkHash: b.depositorWotsPkHash
-    })), g = Bt({
+    })), y = kt({
       abi: j,
       functionName: "submitPeginRequestBatch",
-      args: [i, n, y]
+      args: [i, n, g]
     });
     let x;
     try {
       x = await h.estimateGas({
         to: this.config.vaultContracts.btcVaultRegistry,
-        data: g,
+        data: y,
         value: d,
         account: this.config.ethWallet.account.address
       });
@@ -1177,7 +1089,7 @@ class us {
     try {
       P = await this.config.ethWallet.sendTransaction({
         to: this.config.vaultContracts.btcVaultRegistry,
-        data: g,
+        data: y,
         value: d,
         account: this.config.ethWallet.account,
         chain: this.config.ethChain,
@@ -1188,7 +1100,7 @@ class us {
     }
     const m = await h.waitForTransactionReceipt({
       hash: P,
-      timeout: $t
+      timeout: Ct
     });
     return m.status === "reverted" && M(
       new Error(
@@ -1208,15 +1120,15 @@ class us {
    */
   async checkVaultExists(t) {
     try {
-      return (await lt({
+      return (await ut({
         chain: this.config.ethChain,
-        transport: ht()
+        transport: lt()
       }).readContract({
         address: this.config.vaultContracts.btcVaultRegistry,
         abi: j,
         functionName: "getBTCVault",
         args: [t]
-      })).depositor !== Ae;
+      })).depositor !== ye;
     } catch {
       return !1;
     }
@@ -1229,14 +1141,14 @@ class us {
    * wallet's public key to guard against a compromised wallet provider.
    */
   async resolvePayoutScriptPubKey(t) {
-    Nt();
+    Ee();
     let n;
     if (t)
       n = t;
     else {
       n = await this.config.btcWallet.getAddress();
       const o = await this.config.btcWallet.getPublicKeyHex();
-      if (!Se(
+      if (!Be(
         n,
         o,
         this.config.btcNetwork
@@ -1245,9 +1157,9 @@ class us {
           "The BTC address from your wallet does not match the wallet's public key. Please ensure your wallet is using a supported address type (Taproot or Native SegWit)."
         );
     }
-    const s = yt(this.config.btcNetwork);
+    const s = It(this.config.btcNetwork);
     try {
-      return `0x${pe.address.toOutputScript(n, s).toString("hex")}`;
+      return `0x${fe.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.`
@@ -1267,7 +1179,7 @@ class us {
       o,
       "bip322-simple"
     );
-    return r.startsWith("0x") ? r : `0x${S.from(r, "base64").toString("hex")}`;
+    return r.startsWith("0x") ? r : `0x${W.from(r, "base64").toString("hex")}`;
   }
   /**
    * Gets the configured Bitcoin network.
@@ -1286,7 +1198,7 @@ class us {
     return this.config.vaultContracts.btcVaultRegistry;
   }
 }
-class ls {
+class as {
   /**
    * Creates a new PayoutManager instance.
    *
@@ -1326,7 +1238,7 @@ class ls {
     const n = await this.config.btcWallet.getPublicKeyHex(), { depositorPubkey: s } = Et(
       n,
       t.depositorBtcPubkey
-    ), o = await It({
+    ), o = await Bt({
       payoutTxHex: t.payoutTxHex,
       peginTxHex: t.peginTxHex,
       assertTxHex: t.assertTxHex,
@@ -1338,7 +1250,7 @@ class ls {
       network: this.config.network
     }), r = await this.config.btcWallet.signPsbt(
       o.psbtHex,
-      xt(n, 1)
+      yt(n, 1)
     );
     return {
       signature: St(r, s),
@@ -1386,7 +1298,7 @@ class ls {
         c.depositorBtcPubkey
       );
       r.push(l);
-      const h = await It({
+      const h = await Bt({
         payoutTxHex: c.payoutTxHex,
         peginTxHex: c.peginTxHex,
         assertTxHex: c.assertTxHex,
@@ -1397,7 +1309,7 @@ class ls {
         timelockPegin: c.timelockPegin,
         network: this.config.network
       });
-      s.push(h.psbtHex), o.push(xt(n, 1));
+      s.push(h.psbtHex), o.push(yt(n, 1));
     }
     const i = await this.config.btcWallet.signPsbts(
       s,
@@ -1435,14 +1347,14 @@ class ls {
    * @throws Error if the largest output does not pay to the registered address
    */
   validatePayoutOutputs(t, n) {
-    if (!Be(n))
+    if (!Se(n))
       throw new Error(
         "Invalid registeredPayoutScriptPubKey: not valid hex"
       );
-    const s = S.from(
+    const s = W.from(
       B(n),
       "hex"
-    ), o = J.fromHex(B(t));
+    ), o = gt.fromHex(B(t));
     if (o.outs.length === 0)
       throw new Error("Payout transaction has no outputs");
     if (!o.outs.reduce(
@@ -1462,7 +1374,7 @@ function V(e, t = "") {
     throw new Error(`${n}expected integer >= 0, got ${e}`);
   }
 }
-function K(e, t, n = "") {
+function D(e, t, n = "") {
   const s = De(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}`;
@@ -1470,7 +1382,7 @@ function K(e, t, n = "") {
   }
   return e;
 }
-function jt(e) {
+function Gt(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash must wrapped by utils.createHasher");
   V(e.outputLen), V(e.blockLen);
@@ -1481,59 +1393,59 @@ function G(e, t = !0) {
   if (t && e.finished)
     throw new Error("Hash#digest() has already been called");
 }
-function zt(e, t) {
-  K(e, void 0, "digestInto() output");
+function jt(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 Me(e) {
+function Ke(e) {
   return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
 }
-function A(...e) {
+function S(...e) {
   for (let t = 0; t < e.length; t++)
     e[t].fill(0);
 }
-function it(e) {
+function rt(e) {
   return new DataView(e.buffer, e.byteOffset, e.byteLength);
 }
-function $(e, t) {
+function A(e, t) {
   return e << 32 - t | e >>> t;
 }
-function Y(e, t) {
+function J(e, t) {
   return e << t | e >>> 32 - t >>> 0;
 }
-const Ne = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-function Xe(e) {
+const Me = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+function Ne(e) {
   return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
 }
-function qe(e) {
+function Xe(e) {
   for (let t = 0; t < e.length; t++)
-    e[t] = Xe(e[t]);
+    e[t] = Ne(e[t]);
   return e;
 }
-const Ut = Ne ? (e) => e : qe;
-function Ge(e) {
+const Ft = Me ? (e) => e : Xe;
+function qe(e) {
   if (typeof e != "string")
     throw new Error("string expected");
   return new Uint8Array(new TextEncoder().encode(e));
 }
-function Ft(e, t = "") {
-  return typeof e == "string" ? Ge(e) : K(e, void 0, t);
+function Ut(e, t = "") {
+  return typeof e == "string" ? qe(e) : D(e, void 0, t);
 }
-function je(e, t) {
+function Ge(e, t) {
   if (t !== void 0 && {}.toString.call(t) !== "[object Object]")
     throw new Error("options must be object or undefined");
   return Object.assign(e, t);
 }
-function ct(e, t = {}) {
+function at(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 zt = (e) => ({
   oid: Uint8Array.from([6, 9, 96, 134, 72, 1, 101, 3, 4, 2, e])
 });
-class Jt {
+class Zt {
   constructor(t, n) {
     p(this, "oHash");
     p(this, "iHash");
@@ -1541,7 +1453,7 @@ class Jt {
     p(this, "outputLen");
     p(this, "finished", !1);
     p(this, "destroyed", !1);
-    if (jt(t), K(n, void 0, "key"), this.iHash = t.create(), typeof this.iHash.update != "function")
+    if (Gt(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);
@@ -1551,13 +1463,13 @@ class Jt {
     this.iHash.update(o), this.oHash = t.create();
     for (let r = 0; r < o.length; r++)
       o[r] ^= 106;
-    this.oHash.update(o), A(o);
+    this.oHash.update(o), S(o);
   }
   update(t) {
     return G(this), this.iHash.update(t), this;
   }
   digestInto(t) {
-    G(this), K(t, this.outputLen, "output"), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
+    G(this), D(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);
@@ -1575,15 +1487,15 @@ class Jt {
     this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
   }
 }
-const Pt = (e, t, n) => new Jt(e, t).update(n).digest();
-Pt.create = (e, t) => new Jt(e, t);
-function ze(e, t, n) {
+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) {
   return e & t ^ ~e & n;
 }
-function Ze(e, t, n) {
+function ze(e, t, n) {
   return e & t ^ e & n ^ t & n;
 }
-class Tt {
+class mt {
   constructor(t, n, s, o) {
     p(this, "blockLen");
     p(this, "outputLen");
@@ -1596,15 +1508,15 @@ class Tt {
     p(this, "length", 0);
     p(this, "pos", 0);
     p(this, "destroyed", !1);
-    this.blockLen = t, this.outputLen = n, this.padOffset = s, this.isLE = o, this.buffer = new Uint8Array(t), this.view = it(this.buffer);
+    this.blockLen = t, this.outputLen = n, this.padOffset = s, this.isLE = o, this.buffer = new Uint8Array(t), this.view = rt(this.buffer);
   }
   update(t) {
-    G(this), K(t);
+    G(this), D(t);
     const { view: n, buffer: s, blockLen: o } = this, r = t.length;
     for (let i = 0; i < r; ) {
       const a = Math.min(o - this.pos, r - i);
       if (a === o) {
-        const c = it(t);
+        const c = rt(t);
         for (; o <= r - i; i += o)
           this.process(c, i);
         continue;
@@ -1614,14 +1526,14 @@ class Tt {
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
-    G(this), zt(t, this), this.finished = !0;
+    G(this), jt(t, this), this.finished = !0;
     const { buffer: n, view: s, blockLen: o, isLE: r } = this;
     let { pos: i } = this;
-    n[i++] = 128, A(this.buffer.subarray(i)), this.padOffset > o - i && (this.process(s, 0), i = 0);
+    n[i++] = 128, S(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);
-    const a = it(t), c = this.outputLen;
+    const a = rt(t), c = this.outputLen;
     if (c % 4)
       throw new Error("_sha2: outputLen must be aligned to 32bit");
     const l = c / 4, h = this.get();
@@ -1645,7 +1557,7 @@ class Tt {
     return this._cloneInto();
   }
 }
-const L = /* @__PURE__ */ Uint32Array.from([
+const O = /* @__PURE__ */ Uint32Array.from([
   1779033703,
   3144134277,
   1013904242,
@@ -1671,7 +1583,7 @@ const L = /* @__PURE__ */ Uint32Array.from([
   4215389547,
   1541459225,
   327033209
-]), Je = /* @__PURE__ */ Uint8Array.from([
+]), Ze = /* @__PURE__ */ Uint8Array.from([
   7,
   4,
   13,
@@ -1688,36 +1600,36 @@ const L = /* @__PURE__ */ Uint32Array.from([
   14,
   11,
   8
-]), Yt = Uint8Array.from(new Array(16).fill(0).map((e, t) => t)), Ye = Yt.map((e) => (9 * e + 5) % 16), Qt = /* @__PURE__ */ (() => {
-  const n = [[Yt], [Ye]];
+]), 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]];
   for (let s = 0; s < 4; s++)
     for (let o of n)
-      o.push(o[s].map((r) => Je[r]));
+      o.push(o[s].map((r) => Ze[r]));
   return n;
-})(), te = Qt[0], ee = Qt[1], ne = /* @__PURE__ */ [
+})(), Qt = Yt[0], te = Yt[1], ee = /* @__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__ */ te.map((e, t) => e.map((n) => ne[t][n])), tn = /* @__PURE__ */ ee.map((e, t) => e.map((n) => ne[t][n])), en = /* @__PURE__ */ Uint32Array.from([
+].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([
   0,
   1518500249,
   1859775393,
   2400959708,
   2840853838
-]), nn = /* @__PURE__ */ Uint32Array.from([
+]), en = /* @__PURE__ */ Uint32Array.from([
   1352829926,
   1548603684,
   1836072691,
   2053994217,
   0
 ]);
-function Ct(e, t, n, s) {
+function $t(e, t, n, s) {
   return e === 0 ? t ^ n ^ s : e === 1 ? t & n | ~t & s : e === 2 ? (t | ~n) ^ s : e === 3 ? t & s | n & ~s : t ^ (n | ~s);
 }
-const Q = /* @__PURE__ */ new Uint32Array(16);
-class sn extends Tt {
+const Y = /* @__PURE__ */ new Uint32Array(16);
+class nn extends mt {
   constructor() {
     super(64, 20, 8, !0);
     p(this, "h0", 1732584193);
@@ -1734,48 +1646,48 @@ class sn extends Tt {
     this.h0 = n | 0, this.h1 = s | 0, this.h2 = o | 0, this.h3 = r | 0, this.h4 = i | 0;
   }
   process(n, s) {
-    for (let g = 0; g < 16; g++, s += 4)
-      Q[g] = 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, y = d;
-    for (let g = 0; g < 5; g++) {
-      const x = 4 - g, P = en[g], m = nn[g], b = te[g], f = ee[g], w = Qe[g], v = tn[g];
+    for (let y = 0; y < 16; y++, s += 4)
+      Y[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];
       for (let T = 0; T < 16; T++) {
-        const H = Y(o + Ct(g, i, c, h) + Q[b[T]] + P, w[T]) + d | 0;
-        o = d, d = h, h = Y(c, 10) | 0, c = i, i = H;
+        const H = J(o + $t(y, i, c, h) + Y[b[T]] + P, w[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 = Y(r + Ct(x, a, l, u) + Q[f[T]] + m, v[T]) + y | 0;
-        r = y, y = u, u = Y(l, 10) | 0, l = a, a = H;
+        const H = J(r + $t(x, a, l, u) + Y[f[T]] + m, 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 + y | 0, this.h3 + d + r | 0, this.h4 + o + a | 0, this.h0 + i + l | 0);
+    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() {
-    A(Q);
+    S(Y);
   }
   destroy() {
-    this.destroyed = !0, A(this.buffer), this.set(0, 0, 0, 0, 0);
+    this.destroyed = !0, S(this.buffer), this.set(0, 0, 0, 0, 0);
   }
 }
-const on = /* @__PURE__ */ ct(() => new sn()), tt = /* @__PURE__ */ BigInt(2 ** 32 - 1), Ot = /* @__PURE__ */ BigInt(32);
-function rn(e, t = !1) {
-  return t ? { h: Number(e & tt), l: Number(e >> Ot & tt) } : { h: Number(e >> Ot & tt) | 0, l: Number(e & tt) | 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 };
 }
-function se(e, t = !1) {
+function ne(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 } = rn(e[r], t);
+    const { h: i, l: a } = on(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, et = (e, t, n) => e << 64 - n | t >>> n - 32, nt = (e, t, n) => e >>> n - 32 | t << 64 - n, an = (e, t, n) => e << n | t >>> 32 - n, cn = (e, t, n) => t << n | e >>> 32 - n, un = (e, t, n) => t << n - 32 | e >>> 64 - n, ln = (e, t, n) => e << n - 32 | t >>> 64 - n;
+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 o = (t >>> 0) + (s >>> 0);
   return { h: e + n + (o / 2 ** 32 | 0) | 0, l: o | 0 };
 }
-const hn = (e, t, n) => (e >>> 0) + (t >>> 0) + (n >>> 0), dn = (e, t, n, s) => t + n + s + (e / 2 ** 32 | 0) | 0, fn = (e, t, n, s) => (e >>> 0) + (t >>> 0) + (n >>> 0) + (s >>> 0), pn = (e, t, n, s, o) => t + n + s + o + (e / 2 ** 32 | 0) | 0, gn = (e, t, n, s, o) => (e >>> 0) + (t >>> 0) + (n >>> 0) + (s >>> 0) + (o >>> 0), bn = (e, t, n, s, o, r) => t + n + s + o + r + (e / 2 ** 32 | 0) | 0, yn = /* @__PURE__ */ Uint32Array.from([
+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([
   1116352408,
   1899447441,
   3049323471,
@@ -1840,8 +1752,8 @@ const hn = (e, t, n) => (e >>> 0) + (t >>> 0) + (n >>> 0), dn = (e, t, n, s) =>
   2756734187,
   3204031479,
   3329325298
-]), _ = /* @__PURE__ */ new Uint32Array(64);
-class xn extends Tt {
+]), L = /* @__PURE__ */ new Uint32Array(64);
+class gn extends mt {
   constructor(t) {
     super(64, t, 8, !1);
   }
@@ -1855,41 +1767,41 @@ class xn extends Tt {
   }
   process(t, n) {
     for (let u = 0; u < 16; u++, n += 4)
-      _[u] = t.getUint32(n, !1);
+      L[u] = t.getUint32(n, !1);
     for (let u = 16; u < 64; u++) {
-      const d = _[u - 15], y = _[u - 2], g = $(d, 7) ^ $(d, 18) ^ d >>> 3, x = $(y, 17) ^ $(y, 19) ^ y >>> 10;
-      _[u] = x + _[u - 7] + g + _[u - 16] | 0;
+      const d = L[u - 15], g = L[u - 2], y = A(d, 7) ^ A(d, 18) ^ d >>> 3, x = A(g, 17) ^ A(g, 19) ^ g >>> 10;
+      L[u] = x + L[u - 7] + y + L[u - 16] | 0;
     }
     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, 6) ^ $(a, 11) ^ $(a, 25), y = h + d + ze(a, c, l) + yn[u] + _[u] | 0, x = ($(s, 2) ^ $(s, 13) ^ $(s, 22)) + Ze(s, o, r) | 0;
-      h = l, l = c, c = a, a = i + y | 0, i = r, r = o, o = s, s = y + x | 0;
+      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;
+      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() {
-    A(_);
+    S(L);
   }
   destroy() {
-    this.set(0, 0, 0, 0, 0, 0, 0, 0), A(this.buffer);
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), S(this.buffer);
   }
 }
-class wn extends xn {
+class xn extends gn {
   constructor() {
     super(32);
     // We cannot use array here since array allows indexing by variable
     // which means optimizer/compiler cannot use registers.
-    p(this, "A", L[0] | 0);
-    p(this, "B", L[1] | 0);
-    p(this, "C", L[2] | 0);
-    p(this, "D", L[3] | 0);
-    p(this, "E", L[4] | 0);
-    p(this, "F", L[5] | 0);
-    p(this, "G", L[6] | 0);
-    p(this, "H", L[7] | 0);
+    p(this, "A", O[0] | 0);
+    p(this, "B", O[1] | 0);
+    p(this, "C", O[2] | 0);
+    p(this, "D", O[3] | 0);
+    p(this, "E", O[4] | 0);
+    p(this, "F", O[5] | 0);
+    p(this, "G", O[6] | 0);
+    p(this, "H", O[7] | 0);
   }
 }
-const oe = se([
+const se = ne([
   "0x428a2f98d728ae22",
   "0x7137449123ef65cd",
   "0xb5c0fbcfec4d3b2f",
@@ -1970,44 +1882,44 @@ const oe = se([
   "0x597f299cfc657e2a",
   "0x5fcb6fab3ad6faec",
   "0x6c44198c4a475817"
-].map((e) => BigInt(e))), mn = oe[0], Pn = oe[1], R = /* @__PURE__ */ new Uint32Array(80), W = /* @__PURE__ */ new Uint32Array(80);
-class Tn extends Tt {
+].map((e) => BigInt(e))), wn = se[0], mn = se[1], _ = /* @__PURE__ */ new Uint32Array(80), R = /* @__PURE__ */ new Uint32Array(80);
+class Pn extends mt {
   constructor(t) {
     super(128, t, 16, !1);
   }
   // prettier-ignore
   get() {
-    const { Ah: t, Al: n, Bh: s, Bl: o, Ch: r, Cl: i, Dh: a, Dl: c, Eh: l, El: h, Fh: u, Fl: d, Gh: y, Gl: g, Hh: x, Hl: P } = this;
-    return [t, n, s, o, r, i, a, c, l, h, u, d, y, g, x, P];
+    const { Ah: t, Al: n, Bh: s, Bl: o, Ch: r, Cl: i, Dh: a, Dl: c, Eh: l, El: h, Fh: u, Fl: d, Gh: g, Gl: y, Hh: x, Hl: P } = this;
+    return [t, n, s, o, r, i, a, c, l, h, u, d, g, y, x, P];
   }
   // prettier-ignore
-  set(t, n, s, o, r, i, a, c, l, h, u, d, y, g, x, P) {
-    this.Ah = t | 0, this.Al = n | 0, this.Bh = s | 0, this.Bl = o | 0, this.Ch = r | 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 = y | 0, this.Gl = g | 0, this.Hh = x | 0, this.Hl = P | 0;
+  set(t, n, s, o, r, i, a, c, l, h, u, d, g, y, x, P) {
+    this.Ah = t | 0, this.Al = n | 0, this.Bh = s | 0, this.Bl = o | 0, this.Ch = r | 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 = g | 0, this.Gl = y | 0, this.Hh = x | 0, this.Hl = P | 0;
   }
   process(t, n) {
     for (let f = 0; f < 16; f++, n += 4)
-      R[f] = t.getUint32(n), W[f] = t.getUint32(n += 4);
+      _[f] = t.getUint32(n), R[f] = t.getUint32(n += 4);
     for (let f = 16; f < 80; f++) {
-      const w = R[f - 15] | 0, v = W[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), E = R[f - 2] | 0, I = W[f - 2] | 0, C = N(E, I, 19) ^ et(E, I, 61) ^ Lt(E, I, 6), D = X(E, I, 19) ^ nt(E, I, 61) ^ _t(E, I, 6), O = fn(H, D, W[f - 7], W[f - 16]), ut = pn(O, T, C, R[f - 7], R[f - 16]);
-      R[f] = ut | 0, W[f] = O | 0;
+      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;
     }
-    let { Ah: s, Al: o, Bh: r, Bl: i, Ch: a, Cl: c, Dh: l, Dl: h, Eh: u, El: d, Fh: y, Fl: g, 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: m, Hl: b } = this;
     for (let f = 0; f < 80; f++) {
-      const w = N(u, d, 14) ^ N(u, d, 18) ^ et(u, d, 41), v = X(u, d, 14) ^ X(u, d, 18) ^ nt(u, d, 41), T = u & y ^ ~u & x, H = d & g ^ ~d & P, E = gn(b, v, H, Pn[f], W[f]), I = bn(E, m, w, T, mn[f], R[f]), C = E | 0, D = N(s, o, 28) ^ et(s, o, 34) ^ et(s, o, 39), O = X(s, o, 28) ^ nt(s, o, 34) ^ nt(s, o, 39), ut = s & r ^ s & a ^ r & a, he = o & i ^ o & c ^ i & c;
-      m = x | 0, b = P | 0, x = y | 0, P = g | 0, y = u | 0, g = d | 0, { h: u, l: d } = F(l | 0, h | 0, I | 0, C | 0), l = a | 0, h = c | 0, a = r | 0, c = i | 0, r = s | 0, i = o | 0;
-      const kt = hn(C, O, he);
-      s = dn(kt, I, D, ut), o = kt | 0;
+      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;
     }
-    ({ 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: y, l: g } = F(this.Fh | 0, this.Fl | 0, y | 0, g | 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, y, g, x, P, m, b);
+    ({ 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);
   }
   roundClean() {
-    A(R, W);
+    S(_, R);
   }
   destroy() {
-    A(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
+    S(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
   }
 }
-class vn extends Tn {
+class Tn extends Pn {
   constructor() {
     super(64);
     p(this, "Ah", k[0] | 0);
@@ -2028,34 +1940,34 @@ class vn extends Tn {
     p(this, "Hl", k[15] | 0);
   }
 }
-const kn = /* @__PURE__ */ ct(
-  () => new wn(),
-  /* @__PURE__ */ Zt(1)
-), re = /* @__PURE__ */ ct(
-  () => new vn(),
-  /* @__PURE__ */ Zt(3)
-), Hn = BigInt(0), z = BigInt(1), En = BigInt(2), In = BigInt(7), Sn = BigInt(256), Bn = BigInt(113), ie = [], ae = [], ce = [];
+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 = [];
 for (let e = 0, t = z, n = 1, s = 0; e < 24; e++) {
-  [n, s] = [s, (2 * n + 3 * s) % 5], ie.push(2 * (5 * s + n)), ae.push((e + 1) * (e + 2) / 2 % 64);
-  let o = Hn;
+  [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;
   for (let r = 0; r < 7; r++)
-    t = (t << z ^ (t >> In) * Bn) % Sn, t & En && (o ^= z << (z << BigInt(r)) - z);
-  ce.push(o);
+    t = (t << z ^ (t >> In) * Bn) % En, t & Hn && (o ^= z << (z << BigInt(r)) - z);
+  ae.push(o);
 }
-const ue = se(ce, !0), An = ue[0], $n = ue[1], Rt = (e, t, n) => n > 32 ? un(e, t, n) : an(e, t, n), Wt = (e, t, n) => n > 32 ? ln(e, t, n) : cn(e, t, n);
-function Un(e, t = 24) {
+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 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];
-      for (let y = 0; y < 50; y += 10)
-        e[i + y] ^= u, e[i + y + 1] ^= d;
+      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 = ae[i], c = Rt(o, r, a), l = Wt(o, r, a), h = ie[i];
+      const a = ie[i], c = Rt(o, r, a), l = Wt(o, r, a), h = re[i];
       o = e[h], r = e[h + 1], e[h] = c, e[h + 1] = l;
     }
     for (let i = 0; i < 50; i += 10) {
@@ -2064,11 +1976,11 @@ function Un(e, t = 24) {
       for (let a = 0; a < 10; a++)
         e[i + a] ^= ~n[(a + 2) % 10] & n[(a + 4) % 10];
     }
-    e[0] ^= An[s], e[1] ^= $n[s];
+    e[0] ^= Sn[s], e[1] ^= An[s];
   }
-  A(n);
+  S(n);
 }
-class vt {
+class Pt {
   // NOTE: we accept arguments in bytes instead of bits here.
   constructor(t, n, s, o = !1, r = 24) {
     p(this, "state");
@@ -2084,16 +1996,16 @@ class vt {
     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 = Me(this.state);
+    this.state = new Uint8Array(200), this.state32 = Ke(this.state);
   }
   clone() {
     return this._cloneInto();
   }
   keccak() {
-    Ut(this.state32), Un(this.state32, this.rounds), Ut(this.state32), this.posOut = 0, this.pos = 0;
+    Ft(this.state32), Cn(this.state32, this.rounds), Ft(this.state32), this.posOut = 0, this.pos = 0;
   }
   update(t) {
-    G(this), K(t);
+    G(this), D(t);
     const { blockLen: n, state: s } = this, o = t.length;
     for (let r = 0; r < o; ) {
       const i = Math.min(n - this.pos, o - r);
@@ -2111,7 +2023,7 @@ class vt {
     t[s] ^= n, (n & 128) !== 0 && s === o - 1 && this.keccak(), t[o - 1] ^= 128, this.keccak();
   }
   writeInto(t) {
-    G(this, !1), K(t), this.finish();
+    G(this, !1), D(t), this.finish();
     const n = this.state, { blockLen: s } = this;
     for (let o = 0, r = t.length; o < r; ) {
       this.posOut >= s && this.keccak();
@@ -2129,7 +2041,7 @@ class vt {
     return V(t), this.xofInto(new Uint8Array(t));
   }
   digestInto(t) {
-    if (zt(t, this), this.finished)
+    if (jt(t, this), this.finished)
       throw new Error("digest() was already called");
     return this.writeInto(t), this.destroy(), t;
   }
@@ -2137,56 +2049,56 @@ class vt {
     return this.digestInto(new Uint8Array(this.outputLen));
   }
   destroy() {
-    this.destroyed = !0, A(this.state);
+    this.destroyed = !0, S(this.state);
   }
   _cloneInto(t) {
     const { blockLen: n, suffix: s, outputLen: o, rounds: r, enableXOF: i } = this;
-    return t || (t = new vt(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 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;
   }
 }
-const Fn = (e, t, n, s = {}) => ct(() => new vt(t, e, n), s), Cn = /* @__PURE__ */ Fn(1, 136, 32);
-function On(e, t, n, s) {
-  jt(e);
-  const o = je({ dkLen: 32, asyncTick: 10 }, s), { c: r, dkLen: i, asyncTick: a } = o;
+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;
   if (V(r, "c"), V(i, "dkLen"), V(a, "asyncTick"), r < 1)
     throw new Error("iterations (c) must be >= 1");
-  const c = Ft(t, "password"), l = Ft(n, "salt"), h = new Uint8Array(i), u = Pt.create(e, c), d = u._cloneInto().update(l);
+  const c = Ut(t, "password"), l = Ut(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 Ln(e, t, n, s, o) {
-  return e.destroy(), t.destroy(), s && s.destroy(), A(o), n;
+function On(e, t, n, s, o) {
+  return e.destroy(), t.destroy(), s && s.destroy(), S(o), n;
 }
-function _n(e, t, n, s) {
-  const { c: o, dkLen: r, DK: i, PRF: a, PRFSalt: c } = On(e, t, n, s);
+function Ln(e, t, n, s) {
+  const { c: o, dkLen: r, DK: i, PRF: a, PRFSalt: c } = $n(e, t, n, s);
   let l;
-  const h = new Uint8Array(4), u = it(h), d = new Uint8Array(a.outputLen);
-  for (let y = 1, g = 0; g < r; y++, g += a.outputLen) {
-    const x = i.subarray(g, g + a.outputLen);
-    u.setInt32(0, y, !1), (l = c._cloneInto(l)).update(h).digestInto(d), x.set(d.subarray(0, x.length));
+  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) {
+    const x = i.subarray(y, y + a.outputLen);
+    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];
     }
   }
-  return Ln(a, c, i, l, d);
+  return On(a, c, i, l, d);
 }
-function le(e) {
+function ue(e) {
   if (typeof e != "string")
     throw new TypeError("invalid mnemonic type: " + typeof e);
   return e.normalize("NFKD");
 }
-function Rn(e) {
-  const t = le(e), n = t.split(" ");
+function _n(e) {
+  const t = ue(e), n = t.split(" ");
   if (![12, 15, 18, 21, 24].includes(n.length))
     throw new Error("Invalid mnemonic");
   return { nfkd: t, words: n };
 }
-const Wn = (e) => le("mnemonic" + e);
-function Vn(e, t = "") {
-  return _n(re, Rn(e).nfkd, Wn(t), { c: 2048, dkLen: 64 });
+const Rn = (e) => ue("mnemonic" + e);
+function Wn(e, t = "") {
+  return Ln(oe, _n(e).nfkd, Rn(t), { c: 2048, dkLen: 64 });
 }
-const Kn = 508, Vt = 16, st = 32, ot = 64, Kt = 5, Dn = 4;
+const Vn = 508, Vt = 16, nt = 32, st = 64, Dt = 5, Dn = 4;
 function Z(...e) {
   const t = e.reduce((o, r) => o + r.length, 0), n = new Uint8Array(t);
   let s = 0;
@@ -2194,63 +2106,63 @@ function Z(...e) {
     n.set(o, s), s += o.length;
   return n;
 }
-function ft(e) {
+function dt(e) {
   return new TextEncoder().encode(e);
 }
-function pt(e) {
+function ft(e) {
   const t = new Uint8Array(Dn);
   return new DataView(t.buffer).setUint32(0, e.length, !1), Z(t, e);
 }
-function gt(e, t) {
-  return Pt(re, e, t);
+function pt(e, t) {
+  return wt(oe, e, t);
 }
-function Dt(e) {
-  return on(kn(e));
+function Kt(e) {
+  return sn(vn(e));
 }
-const wt = (e) => Array.from(e).map((t) => t.toString(16).padStart(2, "0")).join("");
-function Mn(e) {
-  const t = Vn(e), n = new Uint8Array(t);
+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);
   return t.fill(0), n;
 }
-async function Nn(e, t, n, s) {
-  if (e.length !== ot)
+async function Mn(e, t, n, s) {
+  if (e.length !== st)
     throw new Error(
-      `WOTS seed must be ${ot} bytes, got ${e.length}`
+      `WOTS seed must be ${st} bytes, got ${e.length}`
     );
   t = B(t), n = B(n);
-  const o = e.slice(st, ot), r = e.slice(0, st), i = [o, r];
+  const o = e.slice(nt, st), r = e.slice(0, nt), i = [o, r];
   try {
     const a = Z(
-      pt(ft(t)),
-      pt(ft(n)),
-      pt(ft(s))
+      ft(dt(t)),
+      ft(dt(n)),
+      ft(dt(s))
     ), c = Z(r, a);
     i.push(c);
-    const l = gt(o, c);
+    const l = pt(o, c);
     i.push(l);
-    const h = l.slice(0, st), u = l.slice(st, ot);
+    const h = l.slice(0, nt), u = l.slice(nt, st);
     i.push(h, u);
-    const d = [], y = [], g = [], x = [];
+    const d = [], g = [], y = [], x = [];
     let P = !1;
     try {
-      for (let m = 0; m < Kn; m++) {
-        const b = new Uint8Array(Kt);
+      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(Kt);
+        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 = gt(u, w), H = gt(u, v);
+        const w = Z(h, b), v = Z(h, f), T = pt(u, w), H = pt(u, v);
         try {
-          const E = T.slice(0, Vt), I = H.slice(0, Vt);
-          d.push(E), y.push(I), g.push(Dt(E)), x.push(Dt(I));
+          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));
         } finally {
           w.fill(0), v.fill(0), T.fill(0), H.fill(0);
         }
       }
-      return P = !0, { falsePreimages: d, truePreimages: y, falseHashes: g, trueHashes: x };
+      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 y) m.fill(0);
+        for (const m of g) m.fill(0);
       }
     }
   } finally {
@@ -2258,13 +2170,13 @@ async function Nn(e, t, n, s) {
       a.fill(0);
   }
 }
-function hs(e) {
+function cs(e) {
   return {
-    false_list: e.falseHashes.map(wt),
-    true_list: e.trueHashes.map(wt)
+    false_list: e.falseHashes.map(bt),
+    true_list: e.trueHashes.map(bt)
   };
 }
-function Xn(e) {
+function Nn(e) {
   if (e.falseHashes.length === 0 || e.trueHashes.length === 0)
     throw new Error(
       "computeWotsPkHash: keypair hash arrays must not be empty"
@@ -2275,20 +2187,20 @@ function Xn(e) {
     s.set(i, o), o += t;
   for (const i of e.trueHashes)
     s.set(i, o), o += t;
-  const r = Cn(s);
-  return `0x${wt(r)}`;
+  const r = Un(s);
+  return `0x${bt(r)}`;
 }
-async function ds(e, t, n, s) {
-  const o = Mn(e);
+async function us(e, t, n, s) {
+  const o = Kn(e);
   try {
-    const r = await Nn(
+    const r = await Mn(
       o,
       t,
       n,
       s
     );
     try {
-      return Xn(r);
+      return Nn(r);
     } finally {
       for (const i of r.falsePreimages) i.fill(0);
       for (const i of r.truePreimages) i.fill(0);
@@ -2297,43 +2209,41 @@ async function ds(e, t, n, s) {
     o.fill(0);
   }
 }
-function fs(e) {
+function ls(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 {
-  Xn as A,
-  rt as B,
+  ls as A,
+  ot as B,
   q as C,
-  ds as D,
-  fs as E,
-  Le as M,
-  us as P,
-  Yn as a,
-  ts as b,
-  dt as c,
-  es as d,
-  Ue as e,
-  Fe as f,
-  Qn as g,
-  xt as h,
-  ls as i,
-  rs as j,
+  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,
-  os as l,
-  is as m,
-  ns as n,
-  Re as o,
-  We as p,
-  _e as q,
-  j as r,
-  $e as s,
-  mt as t,
-  as as u,
-  cs as v,
-  M as w,
-  Mn as x,
+  Qn as l,
+  _e as m,
+  Re as n,
+  j as o,
+  Le as p,
+  xt as q,
+  os as r,
+  Ae as s,
+  rs as t,
+  M as u,
+  Kn as v,
+  Mn as w,
+  cs as x,
   Nn as y,
-  hs as z
+  us as z
 };
-//# sourceMappingURL=errors-UqmtfBtv.js.map
+//# sourceMappingURL=errors-BEUjAw2k.js.map