@babylonlabs-io/ts-sdk 0.15.2 → 0.15.3

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

@@ -1,13 +1,13 @@
-var he = Object.defineProperty;
-var de = (e, t, n) => t in e ? he(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
-var p = (e, t, n) => de(e, typeof t != "symbol" ? t + "" : t, n);
-import * as fe from "bitcoinjs-lib";
-import { script as pe, Transaction as J, address as ge, Psbt as bt } from "bitcoinjs-lib";
+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 be, y as ye, D as Mt, M as Ht, B as xe, T as we, G as yt, u as B, b as me, A as Pe, E as Te, a as ve, d as ke, e as He, f as Ee, s as U, q as Ie, x as Et, h as It, i as St, r as Se } from "./challengeAssert-CenzzhZU.js";
-import { createPublicClient as lt, http as ht, encodeFunctionData as Bt, zeroAddress as Be } from "viem";
+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";
 import { deriveVaultId as At } from "@babylonlabs-io/babylon-tbv-rust-wasm";
-function Ae(e, t, n, s) {
+function $e(e, t, n, s) {
   if (!Number.isInteger(s) || s < 1)
     throw new Error(
       `Invalid numOutputs: expected a positive integer, got ${s}`
@@ -16,7 +16,7 @@ function Ae(e, t, n, s) {
     throw new Error("Insufficient funds: no UTXOs available");
   const o = e.filter((l) => {
     const h = S.from(l.scriptPubKey, "hex");
-    return !!pe.decompile(h);
+    return !!ge.decompile(h);
   });
   if (o.length === 0)
     throw new Error(
@@ -26,8 +26,8 @@ function Ae(e, t, n, s) {
   let a = 0n, c = 0n;
   for (const l of r) {
     i.push(l), a += BigInt(l.value);
-    const h = i.length * be, u = s * Ht, d = h + u + we;
-    if (c = BigInt(Math.ceil(d * n)) + BigInt(ye(n)), a - t - c > Mt) {
+    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(
         Math.ceil(Ht * n)
       );
@@ -47,18 +47,18 @@ function Ae(e, t, n, s) {
     `Insufficient funds: need ${t + c} sats (${t} pegin + ${c} fee), have ${a} sats`
   );
 }
-function Jn(e) {
+function Yn(e) {
   return e > Mt;
 }
-function Yn() {
-  return xe;
+function Qn() {
+  return we;
 }
 function dt(e) {
   const t = e.startsWith("0x") ? e.slice(2) : e;
   return `0x${J.fromHex(t).getId()}`;
 }
-function Qn(e, t, n) {
-  if (e.length === 0)
+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");
@@ -78,7 +78,7 @@ function Qn(e, t, n) {
     const l = t[c];
     let h;
     try {
-      h = ge.toOutputScript(l.address, s);
+      h = be.toOutputScript(l.address, s);
     } catch (u) {
       throw new Error(
         `Failed to decode address "${l.address}": ${u instanceof Error ? u.message : String(u)}`
@@ -101,7 +101,7 @@ function Qn(e, t, n) {
     outputs: r
   };
 }
-function ts(e, t, n) {
+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(
@@ -146,7 +146,7 @@ function ts(e, t, n) {
   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 $e(e) {
+function Ue(e) {
   const t = e.length;
   return t === 25 && e[0] === 118 && // OP_DUP
   e[1] === 169 && // OP_HASH160
@@ -159,8 +159,8 @@ function $e(e) {
   e[1] === 32 ? "P2WSH" : t === 34 && e[0] === 81 && // OP_1
   e[1] === 32 ? "P2TR" : "UNKNOWN";
 }
-function Ue(e, t) {
-  const n = S.from(e.scriptPubKey, "hex"), s = $e(n);
+function Fe(e, t) {
+  const n = S.from(e.scriptPubKey, "hex"), s = Ue(n);
   switch (s) {
     case rt.P2WPKH:
       return {
@@ -210,17 +210,17 @@ function xt(e, t) {
     }))
   };
 }
-const Fe = 21e6 * 1e8, Nt = 1e4;
-function Xt(e) {
-  return Number.isInteger(e) && e > 0 && e <= Fe;
+const Ce = 21e6 * 1e8, Xt = 1e4;
+function qt(e) {
+  return Number.isInteger(e) && e > 0 && e <= Ce;
 }
-function Ce(e) {
-  return Number.isInteger(e) && e > 0 && e <= Nt;
+function Oe(e) {
+  return Number.isInteger(e) && e > 0 && e <= Xt;
 }
-function qt(e, t) {
+function Gt(e, t) {
   return !Number.isInteger(e) || e < 0 ? !1 : t === void 0 || e < t;
 }
-const Oe = {
+const Le = {
   mainnet: "https://mempool.space/api",
   testnet: "https://mempool.space/testnet/api",
   signet: "https://mempool.space/signet/api"
@@ -240,7 +240,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 Le(e, t) {
+async function _e(e, t) {
   try {
     const n = await fetch(`${t}/tx`, {
       method: "POST",
@@ -266,10 +266,10 @@ async function Le(e, t) {
     throw n instanceof Error ? new Error(`Failed to broadcast BTC transaction: ${n.message}`) : new Error("Failed to broadcast BTC transaction: Unknown error");
   }
 }
-async function _e(e, t) {
+async function Re(e, t) {
   return at(`${t}/tx/${e}`);
 }
-async function es(e, t) {
+async function ns(e, t) {
   try {
     const n = await fetch(`${t}/tx/${e}/hex`);
     if (!n.ok) {
@@ -283,14 +283,14 @@ async function es(e, t) {
     throw n instanceof Error ? new Error(`Failed to get transaction hex for ${e}: ${n.message}`) : new Error(`Failed to get transaction hex for ${e}: Unknown error`);
   }
 }
-async function Re(e, t, n) {
-  const s = await _e(e, n);
-  if (!qt(t, s.vout.length))
+async function We(e, t, n) {
+  const s = await Re(e, n);
+  if (!Gt(t, s.vout.length))
     throw new Error(
       `Invalid vout ${t} for transaction ${e} (has ${s.vout.length} outputs)`
     );
   const o = s.vout[t];
-  if (!Xt(o.value))
+  if (!qt(o.value))
     throw new Error(`Invalid UTXO value ${o.value} for ${e}:${t}`);
   return {
     txid: e,
@@ -299,7 +299,7 @@ async function Re(e, t, n) {
     scriptPubKey: o.scriptpubkey
   };
 }
-async function ns(e, t) {
+async function ss(e, t) {
   try {
     const n = await at(`${t}/address/${e}/utxo`), s = await at(`${t}/v1/validate-address/${e}`);
     if (!s.isvalid)
@@ -307,9 +307,9 @@ async function ns(e, t) {
         `Invalid Bitcoin address: ${e}. Mempool API validation failed.`
       );
     for (const r of n) {
-      if (!qt(r.vout))
+      if (!Gt(r.vout))
         throw new Error(`Invalid vout ${r.vout} for ${r.txid}`);
-      if (!Xt(r.value))
+      if (!qt(r.value))
         throw new Error(
           `Invalid UTXO value ${r.value} for ${r.txid}:${r.vout}`
         );
@@ -329,13 +329,13 @@ async function ns(e, t) {
     );
   }
 }
-function ss(e) {
-  return Oe[e];
+function os(e) {
+  return Le[e];
 }
-async function os(e, t) {
+async function rs(e, t) {
   return at(`${t}/address/${e}/txs`);
 }
-async function rs(e) {
+async function is(e) {
   const t = await fetch(`${e}/v1/fees/recommended`);
   if (!t.ok)
     throw new Error(
@@ -349,9 +349,9 @@ async function rs(e) {
     "minimumFee"
   ];
   for (const o of s)
-    if (!Ce(n[o]))
+    if (!Oe(n[o]))
       throw new Error(
-        `Invalid fee rate ${o}=${n[o]} from mempool API: expected a positive number ≤ ${Nt}`
+        `Invalid fee rate ${o}=${n[o]} from mempool API: expected a positive number ≤ ${Xt}`
       );
   if (n.minimumFee > n.economyFee || n.economyFee > n.hourFee || n.hourFee > n.halfHourFee || n.halfHourFee > n.fastestFee)
     throw new Error(
@@ -701,14 +701,14 @@ function mt(e) {
   if (i)
     return i[1];
 }
-function is(e) {
+function as(e) {
   const t = mt(e);
   if (t) {
     const n = t.substring(0, 10);
     return q[t] ?? q[n];
   }
 }
-function as(e) {
+function cs(e) {
   const t = mt(e);
   if (t === void 0) return !1;
   const n = t.substring(0, 10);
@@ -736,18 +736,18 @@ function M(e) {
   }
   throw e instanceof Error ? (console.error("[Contract Error] Unhandled error:", e.message), e) : new Error(`Contract call failed: ${String(e)}`);
 }
-const We = 0;
-function Ve(e, t, n, s) {
+const Ve = 0;
+function Ke(e, t, n, s) {
   const o = n == null ? void 0 : n[`${e}:${t}`];
   return o ? Promise.resolve({
     txid: e,
     vout: t,
     value: o.value,
     scriptPubKey: o.scriptPubKey
-  }) : Re(e, t, s);
+  }) : We(e, t, s);
 }
 const $t = 12e4;
-class cs {
+class us {
   /**
    * Creates a new PeginManager instance.
    *
@@ -798,12 +798,12 @@ class cs {
       councilQuorum: t.councilQuorum,
       councilSize: t.councilSize,
       network: this.config.btcNetwork
-    }, l = await me(c), h = Ae(
+    }, l = await Pe(c), h = $e(
       [...t.availableUTXOs],
       l.totalOutputValue,
       t.mempoolFeeRate,
-      Pe(l.htlcValues.length)
-    ), u = yt(this.config.btcNetwork), d = Te({
+      Te(l.htlcValues.length)
+    ), u = yt(this.config.btcNetwork), d = ve({
       unfundedTxHex: l.psbtHex,
       selectedUTXOs: h.selectedUTXOs,
       changeAddress: t.changeAddress,
@@ -811,12 +811,12 @@ class cs {
       network: u
     }), y = B(dt(d)), g = [], x = [], P = [];
     for (let f = 0; f < t.hashlocks.length; f++) {
-      const w = await ve({
+      const w = await ke({
         prePeginParams: c,
         timelockPegin: t.timelockPegin,
         fundedPrePeginTxHex: d,
         htlcVout: f
-      }), v = await ke({
+      }), v = await He({
         peginTxHex: w.txHex,
         fundedPrePeginTxHex: d,
         depositorPubkey: s,
@@ -836,10 +836,10 @@ class cs {
       P
     ), b = [];
     for (let f = 0; f < m.length; f++) {
-      const w = He(
+      const w = Ee(
         m[f],
         s
-      ), v = Ee(m[f]);
+      ), v = Ie(m[f]);
       b.push({
         htlcVout: f,
         htlcValue: l.htlcValues[f],
@@ -921,7 +921,7 @@ class cs {
       );
     const l = this.config.mempoolApiUrl, h = r.ins.map((b) => {
       const f = S.from(b.hash).reverse().toString("hex"), w = b.index;
-      return Ve(f, w, t.localPrevouts, l).then(
+      return Ke(f, w, t.localPrevouts, l).then(
         (v) => ({ input: b, utxoData: v, txid: f, vout: w })
       );
     }), u = await Promise.all(h), d = u.reduce(
@@ -936,7 +936,7 @@ class cs {
         `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.`
       );
     for (const { input: b, utxoData: f, txid: w, vout: v } of u) {
-      const T = Ue(
+      const T = Fe(
         {
           value: f.value,
           scriptPubKey: f.scriptPubKey
@@ -967,7 +967,7 @@ class cs {
         );
     }
     const P = x.extractTransaction().toHex();
-    return await Le(P, l);
+    return await _e(P, l);
   }
   /**
    * Registers a peg-in on Ethereum by calling the BTCVaultRegistry contract.
@@ -1154,7 +1154,7 @@ class cs {
       ),
       hashlock: b.hashlock,
       htlcVout: b.htlcVout,
-      referralCode: We,
+      referralCode: Ve,
       depositorPayoutBtcAddress: c[f],
       depositorWotsPkHash: b.depositorWotsPkHash
     })), g = Bt({
@@ -1216,7 +1216,7 @@ class cs {
         abi: j,
         functionName: "getBTCVault",
         args: [t]
-      })).depositor !== Be;
+      })).depositor !== Ae;
     } catch {
       return !1;
     }
@@ -1229,13 +1229,14 @@ class cs {
    * wallet's public key to guard against a compromised wallet provider.
    */
   async resolvePayoutScriptPubKey(t) {
+    Nt();
     let n;
     if (t)
       n = t;
     else {
       n = await this.config.btcWallet.getAddress();
       const o = await this.config.btcWallet.getPublicKeyHex();
-      if (!Ie(
+      if (!Se(
         n,
         o,
         this.config.btcNetwork
@@ -1246,7 +1247,7 @@ class cs {
     }
     const s = yt(this.config.btcNetwork);
     try {
-      return `0x${fe.address.toOutputScript(n, s).toString("hex")}`;
+      return `0x${pe.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.`
@@ -1285,7 +1286,7 @@ class cs {
     return this.config.vaultContracts.btcVaultRegistry;
   }
 }
-class us {
+class ls {
   /**
    * Creates a new PayoutManager instance.
    *
@@ -1434,7 +1435,7 @@ class us {
    * @throws Error if the largest output does not pay to the registered address
    */
   validatePayoutOutputs(t, n) {
-    if (!Se(n))
+    if (!Be(n))
       throw new Error(
         "Invalid registeredPayoutScriptPubKey: not valid hex"
       );
@@ -1452,7 +1453,7 @@ class us {
       );
   }
 }
-function Ke(e) {
+function De(e) {
   return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
 }
 function V(e, t = "") {
@@ -1462,14 +1463,14 @@ function V(e, t = "") {
   }
 }
 function K(e, t, n = "") {
-  const s = Ke(e), o = e == null ? void 0 : e.length, r = t !== void 0;
+  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}`;
     throw new Error(i + "expected Uint8Array" + a + ", got " + c);
   }
   return e;
 }
-function Gt(e) {
+function jt(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash must wrapped by utils.createHasher");
   V(e.outputLen), V(e.blockLen);
@@ -1480,13 +1481,13 @@ function G(e, t = !0) {
   if (t && e.finished)
     throw new Error("Hash#digest() has already been called");
 }
-function jt(e, t) {
+function zt(e, t) {
   K(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 De(e) {
+function Me(e) {
   return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
 }
 function A(...e) {
@@ -1502,25 +1503,25 @@ function $(e, t) {
 function Y(e, t) {
   return e << t | e >>> 32 - t >>> 0;
 }
-const Me = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-function Ne(e) {
+const Ne = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+function Xe(e) {
   return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
 }
-function Xe(e) {
+function qe(e) {
   for (let t = 0; t < e.length; t++)
-    e[t] = Ne(e[t]);
+    e[t] = Xe(e[t]);
   return e;
 }
-const Ut = Me ? (e) => e : Xe;
-function qe(e) {
+const Ut = Ne ? (e) => e : qe;
+function Ge(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" ? qe(e) : K(e, void 0, t);
+  return typeof e == "string" ? Ge(e) : K(e, void 0, t);
 }
-function Ge(e, t) {
+function je(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);
@@ -1529,10 +1530,10 @@ function ct(e, t = {}) {
   const n = (o, r) => e(r).update(o).digest(), s = e(void 0);
   return n.outputLen = s.outputLen, n.blockLen = s.blockLen, n.create = (o) => e(o), Object.assign(n, t), Object.freeze(n);
 }
-const zt = (e) => ({
+const Zt = (e) => ({
   oid: Uint8Array.from([6, 9, 96, 134, 72, 1, 101, 3, 4, 2, e])
 });
-class Zt {
+class Jt {
   constructor(t, n) {
     p(this, "oHash");
     p(this, "iHash");
@@ -1540,7 +1541,7 @@ class Zt {
     p(this, "outputLen");
     p(this, "finished", !1);
     p(this, "destroyed", !1);
-    if (Gt(t), K(n, void 0, "key"), this.iHash = t.create(), typeof this.iHash.update != "function")
+    if (jt(t), K(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);
@@ -1574,12 +1575,12 @@ class Zt {
     this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
   }
 }
-const Pt = (e, t, n) => new Zt(e, t).update(n).digest();
-Pt.create = (e, t) => new Zt(e, t);
-function je(e, t, n) {
+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) {
   return e & t ^ ~e & n;
 }
-function ze(e, t, n) {
+function Ze(e, t, n) {
   return e & t ^ e & n ^ t & n;
 }
 class Tt {
@@ -1613,7 +1614,7 @@ class Tt {
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
-    G(this), jt(t, this), this.finished = !0;
+    G(this), zt(t, this), this.finished = !0;
     const { buffer: n, view: s, blockLen: o, isLE: r } = this;
     let { pos: i } = this;
     n[i++] = 128, A(this.buffer.subarray(i)), this.padOffset > o - i && (this.process(s, 0), i = 0);
@@ -1670,7 +1671,7 @@ const L = /* @__PURE__ */ Uint32Array.from([
   4215389547,
   1541459225,
   327033209
-]), Ze = /* @__PURE__ */ Uint8Array.from([
+]), Je = /* @__PURE__ */ Uint8Array.from([
   7,
   4,
   13,
@@ -1687,25 +1688,25 @@ const L = /* @__PURE__ */ Uint32Array.from([
   14,
   11,
   8
-]), Jt = Uint8Array.from(new Array(16).fill(0).map((e, t) => t)), Je = Jt.map((e) => (9 * e + 5) % 16), Yt = /* @__PURE__ */ (() => {
-  const n = [[Jt], [Je]];
+]), Yt = Uint8Array.from(new Array(16).fill(0).map((e, t) => t)), Ye = Yt.map((e) => (9 * e + 5) % 16), Qt = /* @__PURE__ */ (() => {
+  const n = [[Yt], [Ye]];
   for (let s = 0; s < 4; s++)
     for (let o of n)
-      o.push(o[s].map((r) => Ze[r]));
+      o.push(o[s].map((r) => Je[r]));
   return n;
-})(), Qt = Yt[0], te = Yt[1], ee = /* @__PURE__ */ [
+})(), te = Qt[0], ee = Qt[1], ne = /* @__PURE__ */ [
   [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],
   [12, 13, 11, 15, 6, 9, 9, 7, 12, 15, 11, 13, 7, 8, 7, 7],
   [13, 15, 14, 11, 7, 7, 6, 8, 13, 14, 13, 12, 5, 5, 6, 9],
   [14, 11, 12, 14, 8, 6, 5, 5, 15, 12, 15, 14, 9, 9, 8, 6],
   [15, 12, 13, 13, 9, 5, 8, 6, 14, 11, 12, 11, 8, 6, 5, 5]
-].map((e) => Uint8Array.from(e)), Ye = /* @__PURE__ */ Qt.map((e, t) => e.map((n) => ee[t][n])), Qe = /* @__PURE__ */ te.map((e, t) => e.map((n) => ee[t][n])), tn = /* @__PURE__ */ Uint32Array.from([
+].map((e) => Uint8Array.from(e)), 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([
   0,
   1518500249,
   1859775393,
   2400959708,
   2840853838
-]), en = /* @__PURE__ */ Uint32Array.from([
+]), nn = /* @__PURE__ */ Uint32Array.from([
   1352829926,
   1548603684,
   1836072691,
@@ -1716,7 +1717,7 @@ function Ct(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 nn extends Tt {
+class sn extends Tt {
   constructor() {
     super(64, 20, 8, !0);
     p(this, "h0", 1732584193);
@@ -1737,7 +1738,7 @@ class nn extends Tt {
       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 = tn[g], m = en[g], b = Qt[g], f = te[g], w = Ye[g], v = Qe[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 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;
@@ -1756,25 +1757,25 @@ class nn extends Tt {
     this.destroyed = !0, A(this.buffer), this.set(0, 0, 0, 0, 0);
   }
 }
-const sn = /* @__PURE__ */ ct(() => new nn()), tt = /* @__PURE__ */ BigInt(2 ** 32 - 1), Ot = /* @__PURE__ */ BigInt(32);
-function on(e, t = !1) {
+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 };
 }
-function ne(e, t = !1) {
+function se(e, t = !1) {
   const n = e.length;
   let s = new Uint32Array(n), o = new Uint32Array(n);
   for (let r = 0; r < n; r++) {
-    const { h: i, l: a } = on(e[r], t);
+    const { h: i, l: a } = rn(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, 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;
+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;
 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 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), gn = (e, t, n, s, o, r) => t + n + s + o + r + (e / 2 ** 32 | 0) | 0, bn = /* @__PURE__ */ Uint32Array.from([
+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([
   1116352408,
   1899447441,
   3049323471,
@@ -1840,7 +1841,7 @@ const ln = (e, t, n) => (e >>> 0) + (t >>> 0) + (n >>> 0), hn = (e, t, n, s) =>
   3204031479,
   3329325298
 ]), _ = /* @__PURE__ */ new Uint32Array(64);
-class yn extends Tt {
+class xn extends Tt {
   constructor(t) {
     super(64, t, 8, !1);
   }
@@ -1861,7 +1862,7 @@ class yn extends Tt {
     }
     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 + je(a, c, l) + bn[u] + _[u] | 0, x = ($(s, 2) ^ $(s, 13) ^ $(s, 22)) + ze(s, o, r) | 0;
+      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;
     }
     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);
@@ -1873,7 +1874,7 @@ class yn extends Tt {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), A(this.buffer);
   }
 }
-class xn extends yn {
+class wn extends xn {
   constructor() {
     super(32);
     // We cannot use array here since array allows indexing by variable
@@ -1888,7 +1889,7 @@ class xn extends yn {
     p(this, "H", L[7] | 0);
   }
 }
-const se = ne([
+const oe = se([
   "0x428a2f98d728ae22",
   "0x7137449123ef65cd",
   "0xb5c0fbcfec4d3b2f",
@@ -1969,8 +1970,8 @@ const se = ne([
   "0x597f299cfc657e2a",
   "0x5fcb6fab3ad6faec",
   "0x6c44198c4a475817"
-].map((e) => BigInt(e))), wn = se[0], mn = se[1], R = /* @__PURE__ */ new Uint32Array(80), W = /* @__PURE__ */ new Uint32Array(80);
-class Pn extends Tt {
+].map((e) => BigInt(e))), mn = oe[0], Pn = oe[1], R = /* @__PURE__ */ new Uint32Array(80), W = /* @__PURE__ */ new Uint32Array(80);
+class Tn extends Tt {
   constructor(t) {
     super(128, t, 16, !1);
   }
@@ -1987,15 +1988,15 @@ class Pn extends Tt {
     for (let f = 0; f < 16; f++, n += 4)
       R[f] = t.getUint32(n), W[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 = dn(H, D, W[f - 7], W[f - 16]), ut = fn(O, T, C, R[f - 7], R[f - 16]);
+      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;
     }
     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;
     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 = pn(b, v, H, mn[f], W[f]), I = gn(E, m, w, T, wn[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, le = o & i ^ o & c ^ i & c;
+      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 = ln(C, O, le);
-      s = hn(kt, I, D, ut), o = kt | 0;
+      const kt = hn(C, O, he);
+      s = dn(kt, I, D, ut), o = kt | 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);
   }
@@ -2006,7 +2007,7 @@ class Pn extends Tt {
     A(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
   }
 }
-class Tn extends Pn {
+class vn extends Tn {
   constructor() {
     super(64);
     p(this, "Ah", k[0] | 0);
@@ -2027,22 +2028,22 @@ class Tn extends Pn {
     p(this, "Hl", k[15] | 0);
   }
 }
-const vn = /* @__PURE__ */ ct(
-  () => new xn(),
-  /* @__PURE__ */ zt(1)
-), oe = /* @__PURE__ */ ct(
-  () => new Tn(),
-  /* @__PURE__ */ zt(3)
-), kn = BigInt(0), z = BigInt(1), Hn = BigInt(2), En = BigInt(7), In = BigInt(256), Sn = BigInt(113), re = [], ie = [], ae = [];
+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 = [];
 for (let e = 0, t = z, n = 1, s = 0; e < 24; e++) {
-  [n, s] = [s, (2 * n + 3 * s) % 5], re.push(2 * (5 * s + n)), ie.push((e + 1) * (e + 2) / 2 % 64);
-  let o = kn;
+  [n, s] = [s, (2 * n + 3 * s) % 5], ie.push(2 * (5 * s + n)), ae.push((e + 1) * (e + 2) / 2 % 64);
+  let o = Hn;
   for (let r = 0; r < 7; r++)
-    t = (t << z ^ (t >> En) * Sn) % In, t & Hn && (o ^= z << (z << BigInt(r)) - z);
-  ae.push(o);
+    t = (t << z ^ (t >> In) * Bn) % Sn, t & En && (o ^= z << (z << BigInt(r)) - z);
+  ce.push(o);
 }
-const ce = ne(ae, !0), Bn = 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 $n(e, t = 24) {
+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 n = new Uint32Array(10);
   for (let s = 24 - t; s < 24; s++) {
     for (let i = 0; i < 10; i++)
@@ -2054,7 +2055,7 @@ function $n(e, t = 24) {
     }
     let o = e[2], r = e[3];
     for (let i = 0; i < 24; i++) {
-      const a = ie[i], c = Rt(o, r, a), l = Wt(o, r, a), h = re[i];
+      const a = ae[i], c = Rt(o, r, a), l = Wt(o, r, a), h = ie[i];
       o = e[h], r = e[h + 1], e[h] = c, e[h + 1] = l;
     }
     for (let i = 0; i < 50; i += 10) {
@@ -2063,7 +2064,7 @@ function $n(e, t = 24) {
       for (let a = 0; a < 10; a++)
         e[i + a] ^= ~n[(a + 2) % 10] & n[(a + 4) % 10];
     }
-    e[0] ^= Bn[s], e[1] ^= An[s];
+    e[0] ^= An[s], e[1] ^= $n[s];
   }
   A(n);
 }
@@ -2083,13 +2084,13 @@ 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 = De(this.state);
+    this.state = new Uint8Array(200), this.state32 = Me(this.state);
   }
   clone() {
     return this._cloneInto();
   }
   keccak() {
-    Ut(this.state32), $n(this.state32, this.rounds), Ut(this.state32), this.posOut = 0, this.pos = 0;
+    Ut(this.state32), Un(this.state32, this.rounds), Ut(this.state32), this.posOut = 0, this.pos = 0;
   }
   update(t) {
     G(this), K(t);
@@ -2128,7 +2129,7 @@ class vt {
     return V(t), this.xofInto(new Uint8Array(t));
   }
   digestInto(t) {
-    if (jt(t, this), this.finished)
+    if (zt(t, this), this.finished)
       throw new Error("digest() was already called");
     return this.writeInto(t), this.destroy(), t;
   }
@@ -2143,20 +2144,20 @@ class vt {
     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;
   }
 }
-const Un = (e, t, n, s = {}) => ct(() => new vt(t, e, n), s), Fn = /* @__PURE__ */ Un(1, 136, 32);
-function Cn(e, t, n, s) {
-  Gt(e);
-  const o = Ge({ dkLen: 32, asyncTick: 10 }, s), { c: r, dkLen: i, asyncTick: a } = o;
+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;
   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);
   return { c: r, dkLen: i, asyncTick: a, DK: h, PRF: u, PRFSalt: d };
 }
-function On(e, t, n, s, o) {
+function Ln(e, t, n, s, o) {
   return e.destroy(), t.destroy(), s && s.destroy(), A(o), n;
 }
-function Ln(e, t, n, s) {
-  const { c: o, dkLen: r, DK: i, PRF: a, PRFSalt: c } = Cn(e, t, n, s);
+function _n(e, t, n, s) {
+  const { c: o, dkLen: r, DK: i, PRF: a, PRFSalt: c } = On(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) {
@@ -2168,24 +2169,24 @@ function Ln(e, t, n, s) {
         x[m] ^= d[m];
     }
   }
-  return On(a, c, i, l, d);
+  return Ln(a, c, i, l, d);
 }
-function ue(e) {
+function le(e) {
   if (typeof e != "string")
     throw new TypeError("invalid mnemonic type: " + typeof e);
   return e.normalize("NFKD");
 }
-function _n(e) {
-  const t = ue(e), n = t.split(" ");
+function Rn(e) {
+  const t = le(e), n = t.split(" ");
   if (![12, 15, 18, 21, 24].includes(n.length))
     throw new Error("Invalid mnemonic");
   return { nfkd: t, words: n };
 }
-const Rn = (e) => ue("mnemonic" + e);
-function Wn(e, t = "") {
-  return Ln(oe, _n(e).nfkd, Rn(t), { c: 2048, dkLen: 64 });
+const Wn = (e) => le("mnemonic" + e);
+function Vn(e, t = "") {
+  return _n(re, Rn(e).nfkd, Wn(t), { c: 2048, dkLen: 64 });
 }
-const Vn = 508, Vt = 16, st = 32, ot = 64, Kt = 5, Kn = 4;
+const Kn = 508, Vt = 16, st = 32, ot = 64, Kt = 5, Dn = 4;
 function Z(...e) {
   const t = e.reduce((o, r) => o + r.length, 0), n = new Uint8Array(t);
   let s = 0;
@@ -2197,21 +2198,21 @@ function ft(e) {
   return new TextEncoder().encode(e);
 }
 function pt(e) {
-  const t = new Uint8Array(Kn);
+  const t = new Uint8Array(Dn);
   return new DataView(t.buffer).setUint32(0, e.length, !1), Z(t, e);
 }
 function gt(e, t) {
-  return Pt(oe, e, t);
+  return Pt(re, e, t);
 }
 function Dt(e) {
-  return sn(vn(e));
+  return on(kn(e));
 }
 const wt = (e) => Array.from(e).map((t) => t.toString(16).padStart(2, "0")).join("");
-function Dn(e) {
-  const t = Wn(e), n = new Uint8Array(t);
+function Mn(e) {
+  const t = Vn(e), n = new Uint8Array(t);
   return t.fill(0), n;
 }
-async function Mn(e, t, n, s) {
+async function Nn(e, t, n, s) {
   if (e.length !== ot)
     throw new Error(
       `WOTS seed must be ${ot} bytes, got ${e.length}`
@@ -2232,7 +2233,7 @@ async function Mn(e, t, n, s) {
     const d = [], y = [], g = [], x = [];
     let P = !1;
     try {
-      for (let m = 0; m < Vn; m++) {
+      for (let m = 0; m < Kn; m++) {
         const b = new Uint8Array(Kt);
         b[0] = 0, new DataView(b.buffer).setUint32(1, m, !1);
         const f = new Uint8Array(Kt);
@@ -2257,13 +2258,13 @@ async function Mn(e, t, n, s) {
       a.fill(0);
   }
 }
-function ls(e) {
+function hs(e) {
   return {
     false_list: e.falseHashes.map(wt),
     true_list: e.trueHashes.map(wt)
   };
 }
-function Nn(e) {
+function Xn(e) {
   if (e.falseHashes.length === 0 || e.trueHashes.length === 0)
     throw new Error(
       "computeWotsPkHash: keypair hash arrays must not be empty"
@@ -2274,20 +2275,20 @@ function Nn(e) {
     s.set(i, o), o += t;
   for (const i of e.trueHashes)
     s.set(i, o), o += t;
-  const r = Fn(s);
+  const r = Cn(s);
   return `0x${wt(r)}`;
 }
-async function hs(e, t, n, s) {
-  const o = Dn(e);
+async function ds(e, t, n, s) {
+  const o = Mn(e);
   try {
-    const r = await Mn(
+    const r = await Nn(
       o,
       t,
       n,
       s
     );
     try {
-      return Nn(r);
+      return Xn(r);
     } finally {
       for (const i of r.falsePreimages) i.fill(0);
       for (const i of r.truePreimages) i.fill(0);
@@ -2296,43 +2297,43 @@ async function hs(e, t, n, s) {
     o.fill(0);
   }
 }
-function ds(e) {
+function fs(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 {
-  Nn as A,
+  Xn as A,
   rt as B,
   q as C,
-  hs as D,
-  ds as E,
-  Oe as M,
-  cs as P,
-  Jn as a,
-  Qn as b,
+  ds as D,
+  fs as E,
+  Le as M,
+  us as P,
+  Yn as a,
+  ts as b,
   dt as c,
-  ts as d,
-  $e as e,
-  Ue as f,
-  Yn as g,
+  es as d,
+  Ue as e,
+  Fe as f,
+  Qn as g,
   xt as h,
-  us as i,
-  os as j,
-  ns as k,
-  ss as l,
-  rs as m,
-  es as n,
-  _e as o,
-  Re as p,
-  Le as q,
+  ls as i,
+  rs 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,
-  Ae as s,
+  $e as s,
   mt as t,
-  is as u,
-  as as v,
+  as as u,
+  cs as v,
   M as w,
-  Dn as x,
-  Mn as y,
-  ls as z
+  Mn as x,
+  Nn as y,
+  hs as z
 };
-//# sourceMappingURL=errors-C5aW6wrA.js.map
+//# sourceMappingURL=errors-UqmtfBtv.js.map