@babylonlabs-io/ts-sdk 0.12.0 → 0.13.0

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

@@ -4,7 +4,7 @@ var f = (e, t, n) => ue(e, typeof t != "symbol" ? t + "" : t, n);
 import * as le from "bitcoinjs-lib";
 import { script as he, Transaction as st, address as fe, Psbt as dt } from "bitcoinjs-lib";
 import { Buffer as S } from "buffer";
-import { P as de, x as pe, D as Wt, M as Tt, B as be, T as ge, E as pt, t as D, b as xe, z as ye, C as me, a as we, d as Pe, e as Te, f as ve, r as at, p as ke, w as vt, g as kt, h as Ht } from "./challengeAssert-DnnliaRt.js";
+import { P as de, y as pe, D as Vt, M as Tt, B as be, T as ge, G as pt, u as D, b as xe, A as ye, E as we, a as me, d as Pe, e as Te, f as ve, s as at, q as ke, x as vt, h as kt, i as Ht } from "./challengeAssert-CenzzhZU.js";
 import { createPublicClient as It, http as Et, encodeFunctionData as He, zeroAddress as Ie } from "viem";
 import "@babylonlabs-io/babylon-tbv-rust-wasm";
 function Ee(e, t, n, s) {
@@ -27,7 +27,7 @@ function Ee(e, t, n, s) {
   for (const u of o) {
     i.push(u), a += BigInt(u.value);
     const h = i.length * de, l = s * Tt, d = h + l + ge;
-    if (c = BigInt(Math.ceil(d * n)) + BigInt(pe(n)), a - t - c > Wt) {
+    if (c = BigInt(Math.ceil(d * n)) + BigInt(pe(n)), a - t - c > Vt) {
       const p = BigInt(
         Math.ceil(Tt * n)
       );
@@ -47,10 +47,10 @@ function Ee(e, t, n, s) {
     `Insufficient funds: need ${t + c} sats (${t} pegin + ${c} fee), have ${a} sats`
   );
 }
-function zn(e) {
-  return e > Wt;
+function qn(e) {
+  return e > Vt;
 }
-function qn() {
+function zn() {
   return be;
 }
 function St(e) {
@@ -240,7 +240,7 @@ async function nt(e, t) {
     throw n instanceof Error ? new Error(`Failed to fetch from mempool API: ${n.message}`) : new Error("Failed to fetch from mempool API: Unknown error");
   }
 }
-async function Le(e, t) {
+async function Fe(e, t) {
   try {
     const n = await fetch(`${t}/tx`, {
       method: "POST",
@@ -266,7 +266,7 @@ 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 Fe(e, t) {
+async function Le(e, t) {
   return nt(`${t}/tx/${e}`);
 }
 async function Yn(e, t) {
@@ -283,8 +283,8 @@ async function Yn(e, t) {
     throw n instanceof Error ? new Error(`Failed to get transaction hex for ${e}: ${n.message}`) : new Error(`Failed to get transaction hex for ${e}: Unknown error`);
   }
 }
-async function Ce(e, t, n) {
-  const s = await Fe(e, n);
+async function Oe(e, t, n) {
+  const s = await Le(e, n);
   if (!Mt(t, s.vout.length))
     throw new Error(
       `Invalid vout ${t} for transaction ${e} (has ${s.vout.length} outputs)`
@@ -410,7 +410,7 @@ const ct = [
         internalType: "bytes"
       },
       {
-        name: "depositorLamportPkHash",
+        name: "depositorWotsPkHash",
         type: "bytes32",
         internalType: "bytes32"
       }
@@ -479,7 +479,7 @@ const ct = [
         internalType: "bytes"
       },
       {
-        name: "depositorLamportPkHash",
+        name: "depositorWotsPkHash",
         type: "bytes32",
         internalType: "bytes32"
       }
@@ -506,6 +506,11 @@ const ct = [
         name: "s",
         type: "bytes32",
         internalType: "bytes32"
+      },
+      {
+        name: "activationMetadata",
+        type: "bytes",
+        internalType: "bytes"
       }
     ],
     outputs: [],
@@ -556,12 +561,13 @@ const ct = [
           { name: "universalChallengersVersion", type: "uint16", internalType: "uint16" },
           { name: "appVaultKeepersVersion", type: "uint16", internalType: "uint16" },
           { name: "offchainParamsVersion", type: "uint16", internalType: "uint16" },
-          { name: "proverProgramVersion", type: "uint16", internalType: "uint16" },
           { name: "createdAt", type: "uint256", internalType: "uint256" },
           { name: "verifiedAt", type: "uint256", internalType: "uint256" },
-          { name: "depositorLamportPkHash", type: "bytes32", internalType: "bytes32" },
+          { name: "depositorWotsPkHash", type: "bytes32", internalType: "bytes32" },
           { name: "hashlock", type: "bytes32", internalType: "bytes32" },
-          { name: "htlcVout", type: "uint8", internalType: "uint8" }
+          { name: "htlcVout", type: "uint8", internalType: "uint8" },
+          { name: "depositorPopSignature", type: "bytes", internalType: "bytes" },
+          { name: "prePeginTxHash", type: "bytes32", internalType: "bytes32" }
         ]
       }
     ],
@@ -702,14 +708,14 @@ function ut(e) {
   }
   throw e instanceof Error ? (console.error("[Contract Error] Unhandled error:", e.message), e) : new Error(`Contract call failed: ${String(e)}`);
 }
-function Oe(e, t, n, s) {
+function Ce(e, t, n, s) {
   const r = n == null ? void 0 : n[`${e}:${t}`];
   return r ? Promise.resolve({
     txid: e,
     vout: t,
     value: r.value,
     scriptPubKey: r.scriptPubKey
-  }) : Ce(e, t, s);
+  }) : Oe(e, t, s);
 }
 const _e = 12e4;
 class os {
@@ -768,15 +774,15 @@ class os {
       u.totalOutputValue,
       t.mempoolFeeRate,
       ye(u.htlcValues.length)
-    ), l = pt(this.config.btcNetwork), d = me({
+    ), l = pt(this.config.btcNetwork), d = we({
       unfundedTxHex: u.psbtHex,
       selectedUTXOs: h.selectedUTXOs,
       changeAddress: t.changeAddress,
       changeAmount: h.changeAmount,
       network: l
-    }), g = D(St(d)), p = [], m = [], x = [];
+    }), g = D(St(d)), p = [], w = [], x = [];
     for (let b = 0; b < t.hashlocks.length; b++) {
-      const P = await we({
+      const P = await me({
         prePeginParams: c,
         timelockPegin: t.timelockPegin,
         fundedPrePeginTxHex: d,
@@ -792,20 +798,20 @@ class os {
         timelockRefund: t.timelockRefund,
         network: this.config.btcNetwork
       });
-      p.push(P), m.push(T.psbtHex), x.push(
+      p.push(P), w.push(T.psbtHex), x.push(
         bt(n, 1)
       );
     }
     const y = await this.signPsbtsWithFallback(
-      m,
+      w,
       x
-    ), w = [];
+    ), m = [];
     for (let b = 0; b < y.length; b++) {
       const P = Te(
         y[b],
         s
       ), T = ve(y[b]);
-      w.push({
+      m.push({
         htlcVout: b,
         htlcValue: u.htlcValues[b],
         peginTxHex: T,
@@ -818,7 +824,7 @@ class os {
       fundedPrePeginTxHex: d,
       prePeginTxid: g,
       unsignedPrePeginTxHex: u.psbtHex,
-      perVault: w,
+      perVault: m,
       selectedUTXOs: h.selectedUTXOs,
       fee: h.fee,
       changeAmount: h.changeAmount
@@ -885,12 +891,12 @@ class os {
         `Invalid depositorBtcPubkey length: expected 32 bytes, got ${c.length}`
       );
     const u = this.config.mempoolApiUrl, h = o.ins.map((x) => {
-      const y = S.from(x.hash).reverse().toString("hex"), w = x.index;
-      return Oe(y, w, t.localPrevouts, u).then(
-        (b) => ({ input: x, utxoData: b, txid: y, vout: w })
+      const y = S.from(x.hash).reverse().toString("hex"), m = x.index;
+      return Ce(y, m, t.localPrevouts, u).then(
+        (b) => ({ input: x, utxoData: b, txid: y, vout: m })
       );
     }), l = await Promise.all(h);
-    for (const { input: x, utxoData: y, txid: w, vout: b } of l) {
+    for (const { input: x, utxoData: y, txid: m, vout: b } of l) {
       const P = Ae(
         {
           value: y.value,
@@ -915,14 +921,14 @@ class os {
       g.finalizeAllInputs();
     } catch (x) {
       if (!g.data.inputs.every(
-        (w) => w.finalScriptWitness || w.finalScriptSig
+        (m) => m.finalScriptWitness || m.finalScriptSig
       ))
         throw new Error(
           `PSBT finalization failed and wallet did not auto-finalize: ${x}`
         );
     }
     const p = g.extractTransaction().toHex();
-    return await Le(p, u);
+    return await Fe(p, u);
   }
   /**
    * Registers a peg-in on Ethereum by calling the BTCVaultRegistry contract.
@@ -951,7 +957,7 @@ class os {
       htlcVout: a,
       onPopSigned: c,
       depositorPayoutBtcAddress: u,
-      depositorLamportPkHash: h,
+      depositorWotsPkHash: h,
       preSignedBtcPopSignature: l
     } = t;
     if (!this.config.ethWallet.account)
@@ -961,12 +967,12 @@ class os {
       l
     );
     c && await c();
-    const p = at(n), m = at(s), x = at(r), y = await this.resolvePayoutScriptPubKey(
+    const p = at(n), w = at(s), x = at(r), y = await this.resolvePayoutScriptPubKey(
       u
-    ), w = St(x);
-    if (await this.checkVaultExists(w))
+    ), m = St(x);
+    if (await this.checkVaultExists(m))
       throw new Error(
-        `Vault already exists for this transaction (ID: ${w}). Vault IDs are deterministically derived from the unsigned Bitcoin transaction, so using the same UTXOs and amount will always produce the same vault. To create a new vault, please use different UTXOs or a different amount to generate a unique transaction.`
+        `Vault already exists for this transaction (ID: ${m}). Vault IDs are deterministically derived from the unsigned Bitcoin transaction, so using the same UTXOs and amount will always produce the same vault. To create a new vault, please use different UTXOs or a different amount to generate a unique transaction.`
       );
     const P = It({
       chain: this.config.ethChain,
@@ -992,7 +998,7 @@ class os {
         d,
         p,
         g,
-        m,
+        w,
         x,
         o,
         i,
@@ -1035,7 +1041,7 @@ class os {
       )
     ), {
       ethTxHash: I.transactionHash,
-      vaultId: w,
+      vaultId: m,
       btcPopSignature: g
     };
   }
@@ -1251,7 +1257,7 @@ class is {
     return a;
   }
 }
-function Re(e) {
+function We(e) {
   return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
 }
 function _(e, t = "") {
@@ -1260,8 +1266,8 @@ function _(e, t = "") {
     throw new Error(`${n}expected integer >= 0, got ${e}`);
   }
 }
-function R(e, t, n = "") {
-  const s = Re(e), r = e == null ? void 0 : e.length, o = t !== void 0;
+function W(e, t, n = "") {
+  const s = We(e), r = e == null ? void 0 : e.length, o = t !== void 0;
   if (!s || o && r !== t) {
     const i = n && `"${n}" `, a = o ? ` of length ${t}` : "", c = s ? `length=${r}` : `type=${typeof e}`;
     throw new Error(i + "expected Uint8Array" + a + ", got " + c);
@@ -1280,12 +1286,12 @@ function M(e, t = !0) {
     throw new Error("Hash#digest() has already been called");
 }
 function Xt(e, t) {
-  R(e, void 0, "digestInto() output");
+  W(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 Ve(e) {
+function Re(e) {
   return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
 }
 function A(...e) {
@@ -1298,10 +1304,10 @@ function et(e) {
 function B(e, t) {
   return e << 32 - t | e >>> t;
 }
-function G(e, t) {
+function j(e, t) {
   return e << t | e >>> 32 - t >>> 0;
 }
-const We = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+const Ve = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 function De(e) {
   return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
 }
@@ -1310,14 +1316,14 @@ function Ke(e) {
     e[t] = De(e[t]);
   return e;
 }
-const At = We ? (e) => e : Ke;
+const At = Ve ? (e) => e : Ke;
 function Me(e) {
   if (typeof e != "string")
     throw new Error("string expected");
   return new Uint8Array(new TextEncoder().encode(e));
 }
 function Bt(e, t = "") {
-  return typeof e == "string" ? Me(e) : R(e, void 0, t);
+  return typeof e == "string" ? Me(e) : W(e, void 0, t);
 }
 function Ne(e, t) {
   if (t !== void 0 && {}.toString.call(t) !== "[object Object]")
@@ -1328,10 +1334,10 @@ function rt(e, t = {}) {
   const n = (r, o) => e(o).update(r).digest(), s = e(void 0);
   return n.outputLen = s.outputLen, n.blockLen = s.blockLen, n.create = (r) => e(r), Object.assign(n, t), Object.freeze(n);
 }
-const jt = (e) => ({
+const Gt = (e) => ({
   oid: Uint8Array.from([6, 9, 96, 134, 72, 1, 101, 3, 4, 2, e])
 });
-class Gt {
+class jt {
   constructor(t, n) {
     f(this, "oHash");
     f(this, "iHash");
@@ -1339,7 +1345,7 @@ class Gt {
     f(this, "outputLen");
     f(this, "finished", !1);
     f(this, "destroyed", !1);
-    if (Nt(t), R(n, void 0, "key"), this.iHash = t.create(), typeof this.iHash.update != "function")
+    if (Nt(t), W(n, void 0, "key"), this.iHash = t.create(), typeof this.iHash.update != "function")
       throw new Error("Expected instance of class which extends utils.Hash");
     this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
     const s = this.blockLen, r = new Uint8Array(s);
@@ -1355,7 +1361,7 @@ class Gt {
     return M(this), this.iHash.update(t), this;
   }
   digestInto(t) {
-    M(this), R(t, this.outputLen, "output"), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
+    M(this), W(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);
@@ -1373,15 +1379,15 @@ class Gt {
     this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
   }
 }
-const yt = (e, t, n) => new Gt(e, t).update(n).digest();
-yt.create = (e, t) => new Gt(e, t);
+const yt = (e, t, n) => new jt(e, t).update(n).digest();
+yt.create = (e, t) => new jt(e, t);
 function Xe(e, t, n) {
   return e & t ^ ~e & n;
 }
-function je(e, t, n) {
+function Ge(e, t, n) {
   return e & t ^ e & n ^ t & n;
 }
-class mt {
+class wt {
   constructor(t, n, s, r) {
     f(this, "blockLen");
     f(this, "outputLen");
@@ -1397,7 +1403,7 @@ class mt {
     this.blockLen = t, this.outputLen = n, this.padOffset = s, this.isLE = r, this.buffer = new Uint8Array(t), this.view = et(this.buffer);
   }
   update(t) {
-    M(this), R(t);
+    M(this), W(t);
     const { view: n, buffer: s, blockLen: r } = this, o = t.length;
     for (let i = 0; i < o; ) {
       const a = Math.min(r - this.pos, o - i);
@@ -1443,7 +1449,7 @@ class mt {
     return this._cloneInto();
   }
 }
-const L = /* @__PURE__ */ Uint32Array.from([
+const F = /* @__PURE__ */ Uint32Array.from([
   1779033703,
   3144134277,
   1013904242,
@@ -1469,7 +1475,7 @@ const L = /* @__PURE__ */ Uint32Array.from([
   4215389547,
   1541459225,
   327033209
-]), Ge = /* @__PURE__ */ Uint8Array.from([
+]), je = /* @__PURE__ */ Uint8Array.from([
   7,
   4,
   13,
@@ -1486,19 +1492,19 @@ const L = /* @__PURE__ */ Uint32Array.from([
   14,
   11,
   8
-]), zt = Uint8Array.from(new Array(16).fill(0).map((e, t) => t)), ze = zt.map((e) => (9 * e + 5) % 16), qt = /* @__PURE__ */ (() => {
-  const n = [[zt], [ze]];
+]), qt = Uint8Array.from(new Array(16).fill(0).map((e, t) => t)), qe = qt.map((e) => (9 * e + 5) % 16), zt = /* @__PURE__ */ (() => {
+  const n = [[qt], [qe]];
   for (let s = 0; s < 4; s++)
     for (let r of n)
-      r.push(r[s].map((o) => Ge[o]));
+      r.push(r[s].map((o) => je[o]));
   return n;
-})(), Zt = qt[0], Jt = qt[1], Yt = /* @__PURE__ */ [
+})(), Zt = zt[0], Jt = zt[1], Yt = /* @__PURE__ */ [
   [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],
   [12, 13, 11, 15, 6, 9, 9, 7, 12, 15, 11, 13, 7, 8, 7, 7],
   [13, 15, 14, 11, 7, 7, 6, 8, 13, 14, 13, 12, 5, 5, 6, 9],
   [14, 11, 12, 14, 8, 6, 5, 5, 15, 12, 15, 14, 9, 9, 8, 6],
   [15, 12, 13, 13, 9, 5, 8, 6, 14, 11, 12, 11, 8, 6, 5, 5]
-].map((e) => Uint8Array.from(e)), qe = /* @__PURE__ */ Zt.map((e, t) => e.map((n) => Yt[t][n])), Ze = /* @__PURE__ */ Jt.map((e, t) => e.map((n) => Yt[t][n])), Je = /* @__PURE__ */ Uint32Array.from([
+].map((e) => Uint8Array.from(e)), ze = /* @__PURE__ */ Zt.map((e, t) => e.map((n) => Yt[t][n])), Ze = /* @__PURE__ */ Jt.map((e, t) => e.map((n) => Yt[t][n])), Je = /* @__PURE__ */ Uint32Array.from([
   0,
   1518500249,
   1859775393,
@@ -1514,8 +1520,8 @@ const L = /* @__PURE__ */ Uint32Array.from([
 function $t(e, t, n, s) {
   return e === 0 ? t ^ n ^ s : e === 1 ? t & n | ~t & s : e === 2 ? (t | ~n) ^ s : e === 3 ? t & s | n & ~s : t ^ (n | ~s);
 }
-const z = /* @__PURE__ */ new Uint32Array(16);
-class Qe extends mt {
+const q = /* @__PURE__ */ new Uint32Array(16);
+class Qe extends wt {
   constructor() {
     super(64, 20, 8, !0);
     f(this, "h0", 1732584193);
@@ -1533,31 +1539,31 @@ class Qe extends mt {
   }
   process(n, s) {
     for (let p = 0; p < 16; p++, s += 4)
-      z[p] = n.getUint32(s, !0);
+      q[p] = n.getUint32(s, !0);
     let r = this.h0 | 0, o = r, i = this.h1 | 0, a = i, c = this.h2 | 0, u = c, h = this.h3 | 0, l = h, d = this.h4 | 0, g = d;
     for (let p = 0; p < 5; p++) {
-      const m = 4 - p, x = Je[p], y = Ye[p], w = Zt[p], b = Jt[p], P = qe[p], T = Ze[p];
+      const w = 4 - p, x = Je[p], y = Ye[p], m = Zt[p], b = Jt[p], P = ze[p], T = Ze[p];
       for (let v = 0; v < 16; v++) {
-        const E = G(r + $t(p, i, c, h) + z[w[v]] + x, P[v]) + d | 0;
-        r = d, d = h, h = G(c, 10) | 0, c = i, i = E;
+        const E = j(r + $t(p, i, c, h) + q[m[v]] + x, P[v]) + d | 0;
+        r = d, d = h, h = j(c, 10) | 0, c = i, i = E;
       }
       for (let v = 0; v < 16; v++) {
-        const E = G(o + $t(m, a, u, l) + z[b[v]] + y, T[v]) + g | 0;
-        o = g, g = l, l = G(u, 10) | 0, u = a, a = E;
+        const E = j(o + $t(w, a, u, l) + q[b[v]] + y, T[v]) + g | 0;
+        o = g, g = l, l = j(u, 10) | 0, u = a, a = E;
       }
     }
     this.set(this.h1 + c + l | 0, this.h2 + h + g | 0, this.h3 + d + o | 0, this.h4 + r + a | 0, this.h0 + i + u | 0);
   }
   roundClean() {
-    A(z);
+    A(q);
   }
   destroy() {
     this.destroyed = !0, A(this.buffer), this.set(0, 0, 0, 0, 0);
   }
 }
-const tn = /* @__PURE__ */ rt(() => new Qe()), q = /* @__PURE__ */ BigInt(2 ** 32 - 1), Ut = /* @__PURE__ */ BigInt(32);
+const tn = /* @__PURE__ */ rt(() => new Qe()), z = /* @__PURE__ */ BigInt(2 ** 32 - 1), Ut = /* @__PURE__ */ BigInt(32);
 function en(e, t = !1) {
-  return t ? { h: Number(e & q), l: Number(e >> Ut & q) } : { h: Number(e >> Ut & q) | 0, l: Number(e & q) | 0 };
+  return t ? { h: Number(e & z), l: Number(e >> Ut & z) } : { h: Number(e >> Ut & z) | 0, l: Number(e & z) | 0 };
 }
 function Qt(e, t = !1) {
   const n = e.length;
@@ -1568,7 +1574,7 @@ function Qt(e, t = !1) {
   }
   return [s, r];
 }
-const Lt = (e, t, n) => e >>> n, Ft = (e, t, n) => e << 32 - n | t >>> n, V = (e, t, n) => e >>> n | t << 32 - n, W = (e, t, n) => e << 32 - n | t >>> n, Z = (e, t, n) => e << 64 - n | t >>> n - 32, J = (e, t, n) => e >>> n - 32 | t << 64 - n, nn = (e, t, n) => e << n | t >>> 32 - n, sn = (e, t, n) => t << n | e >>> 32 - n, rn = (e, t, n) => t << n - 32 | e >>> 64 - n, on = (e, t, n) => e << n - 32 | t >>> 64 - n;
+const Ft = (e, t, n) => e >>> n, Lt = (e, t, n) => e << 32 - n | t >>> n, R = (e, t, n) => e >>> n | t << 32 - n, V = (e, t, n) => e << 32 - n | t >>> n, Z = (e, t, n) => e << 64 - n | t >>> n - 32, J = (e, t, n) => e >>> n - 32 | t << 64 - n, nn = (e, t, n) => e << n | t >>> 32 - n, sn = (e, t, n) => t << n | e >>> 32 - n, rn = (e, t, n) => t << n - 32 | e >>> 64 - n, on = (e, t, n) => e << n - 32 | t >>> 64 - n;
 function $(e, t, n, s) {
   const r = (t >>> 0) + (s >>> 0);
   return { h: e + n + (r / 2 ** 32 | 0) | 0, l: r | 0 };
@@ -1638,8 +1644,8 @@ const an = (e, t, n) => (e >>> 0) + (t >>> 0) + (n >>> 0), cn = (e, t, n, s) =>
   2756734187,
   3204031479,
   3329325298
-]), F = /* @__PURE__ */ new Uint32Array(64);
-class pn extends mt {
+]), L = /* @__PURE__ */ new Uint32Array(64);
+class pn extends wt {
   constructor(t) {
     super(64, t, 8, !1);
   }
@@ -1653,20 +1659,20 @@ class pn extends mt {
   }
   process(t, n) {
     for (let l = 0; l < 16; l++, n += 4)
-      F[l] = t.getUint32(n, !1);
+      L[l] = t.getUint32(n, !1);
     for (let l = 16; l < 64; l++) {
-      const d = F[l - 15], g = F[l - 2], p = B(d, 7) ^ B(d, 18) ^ d >>> 3, m = B(g, 17) ^ B(g, 19) ^ g >>> 10;
-      F[l] = m + F[l - 7] + p + F[l - 16] | 0;
+      const d = L[l - 15], g = L[l - 2], p = B(d, 7) ^ B(d, 18) ^ d >>> 3, w = B(g, 17) ^ B(g, 19) ^ g >>> 10;
+      L[l] = w + L[l - 7] + p + L[l - 16] | 0;
     }
     let { A: s, B: r, C: o, D: i, E: a, F: c, G: u, H: h } = this;
     for (let l = 0; l < 64; l++) {
-      const d = B(a, 6) ^ B(a, 11) ^ B(a, 25), g = h + d + Xe(a, c, u) + dn[l] + F[l] | 0, m = (B(s, 2) ^ B(s, 13) ^ B(s, 22)) + je(s, r, o) | 0;
-      h = u, u = c, c = a, a = i + g | 0, i = o, o = r, r = s, s = g + m | 0;
+      const d = B(a, 6) ^ B(a, 11) ^ B(a, 25), g = h + d + Xe(a, c, u) + dn[l] + L[l] | 0, w = (B(s, 2) ^ B(s, 13) ^ B(s, 22)) + Ge(s, r, o) | 0;
+      h = u, u = c, c = a, a = i + g | 0, i = o, o = r, r = s, s = g + w | 0;
     }
     s = s + this.A | 0, r = r + this.B | 0, o = o + this.C | 0, i = i + this.D | 0, a = a + this.E | 0, c = c + this.F | 0, u = u + this.G | 0, h = h + this.H | 0, this.set(s, r, o, i, a, c, u, h);
   }
   roundClean() {
-    A(F);
+    A(L);
   }
   destroy() {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), A(this.buffer);
@@ -1677,14 +1683,14 @@ class bn extends pn {
     super(32);
     // We cannot use array here since array allows indexing by variable
     // which means optimizer/compiler cannot use registers.
-    f(this, "A", L[0] | 0);
-    f(this, "B", L[1] | 0);
-    f(this, "C", L[2] | 0);
-    f(this, "D", L[3] | 0);
-    f(this, "E", L[4] | 0);
-    f(this, "F", L[5] | 0);
-    f(this, "G", L[6] | 0);
-    f(this, "H", L[7] | 0);
+    f(this, "A", F[0] | 0);
+    f(this, "B", F[1] | 0);
+    f(this, "C", F[2] | 0);
+    f(this, "D", F[3] | 0);
+    f(this, "E", F[4] | 0);
+    f(this, "F", F[5] | 0);
+    f(this, "G", F[6] | 0);
+    f(this, "H", F[7] | 0);
   }
 }
 const te = Qt([
@@ -1768,44 +1774,44 @@ const te = Qt([
   "0x597f299cfc657e2a",
   "0x5fcb6fab3ad6faec",
   "0x6c44198c4a475817"
-].map((e) => BigInt(e))), gn = te[0], xn = te[1], C = /* @__PURE__ */ new Uint32Array(80), O = /* @__PURE__ */ new Uint32Array(80);
-class yn extends mt {
+].map((e) => BigInt(e))), gn = te[0], xn = te[1], O = /* @__PURE__ */ new Uint32Array(80), C = /* @__PURE__ */ new Uint32Array(80);
+class yn extends wt {
   constructor(t) {
     super(128, t, 16, !1);
   }
   // prettier-ignore
   get() {
-    const { Ah: t, Al: n, Bh: s, Bl: r, Ch: o, Cl: i, Dh: a, Dl: c, Eh: u, El: h, Fh: l, Fl: d, Gh: g, Gl: p, Hh: m, Hl: x } = this;
-    return [t, n, s, r, o, i, a, c, u, h, l, d, g, p, m, x];
+    const { Ah: t, Al: n, Bh: s, Bl: r, Ch: o, Cl: i, Dh: a, Dl: c, Eh: u, El: h, Fh: l, Fl: d, Gh: g, Gl: p, Hh: w, Hl: x } = this;
+    return [t, n, s, r, o, i, a, c, u, h, l, d, g, p, w, x];
   }
   // prettier-ignore
-  set(t, n, s, r, o, i, a, c, u, h, l, d, g, p, m, x) {
-    this.Ah = t | 0, this.Al = n | 0, this.Bh = s | 0, this.Bl = r | 0, this.Ch = o | 0, this.Cl = i | 0, this.Dh = a | 0, this.Dl = c | 0, this.Eh = u | 0, this.El = h | 0, this.Fh = l | 0, this.Fl = d | 0, this.Gh = g | 0, this.Gl = p | 0, this.Hh = m | 0, this.Hl = x | 0;
+  set(t, n, s, r, o, i, a, c, u, h, l, d, g, p, w, x) {
+    this.Ah = t | 0, this.Al = n | 0, this.Bh = s | 0, this.Bl = r | 0, this.Ch = o | 0, this.Cl = i | 0, this.Dh = a | 0, this.Dl = c | 0, this.Eh = u | 0, this.El = h | 0, this.Fh = l | 0, this.Fl = d | 0, this.Gh = g | 0, this.Gl = p | 0, this.Hh = w | 0, this.Hl = x | 0;
   }
   process(t, n) {
     for (let b = 0; b < 16; b++, n += 4)
-      C[b] = t.getUint32(n), O[b] = t.getUint32(n += 4);
+      O[b] = t.getUint32(n), C[b] = t.getUint32(n += 4);
     for (let b = 16; b < 80; b++) {
-      const P = C[b - 15] | 0, T = O[b - 15] | 0, v = V(P, T, 1) ^ V(P, T, 8) ^ Lt(P, T, 7), E = W(P, T, 1) ^ W(P, T, 8) ^ Ft(P, T, 7), k = C[b - 2] | 0, I = O[b - 2] | 0, U = V(k, I, 19) ^ Z(k, I, 61) ^ Lt(k, I, 6), ot = W(k, I, 19) ^ J(k, I, 61) ^ Ft(k, I, 6), j = un(E, ot, O[b - 7], O[b - 16]), it = ln(j, v, U, C[b - 7], C[b - 16]);
-      C[b] = it | 0, O[b] = j | 0;
+      const P = O[b - 15] | 0, T = C[b - 15] | 0, v = R(P, T, 1) ^ R(P, T, 8) ^ Ft(P, T, 7), E = V(P, T, 1) ^ V(P, T, 8) ^ Lt(P, T, 7), k = O[b - 2] | 0, I = C[b - 2] | 0, U = R(k, I, 19) ^ Z(k, I, 61) ^ Ft(k, I, 6), ot = V(k, I, 19) ^ J(k, I, 61) ^ Lt(k, I, 6), G = un(E, ot, C[b - 7], C[b - 16]), it = ln(G, v, U, O[b - 7], O[b - 16]);
+      O[b] = it | 0, C[b] = G | 0;
     }
-    let { Ah: s, Al: r, Bh: o, Bl: i, Ch: a, Cl: c, Dh: u, Dl: h, Eh: l, El: d, Fh: g, Fl: p, Gh: m, Gl: x, Hh: y, Hl: w } = this;
+    let { Ah: s, Al: r, Bh: o, Bl: i, Ch: a, Cl: c, Dh: u, Dl: h, Eh: l, El: d, Fh: g, Fl: p, Gh: w, Gl: x, Hh: y, Hl: m } = this;
     for (let b = 0; b < 80; b++) {
-      const P = V(l, d, 14) ^ V(l, d, 18) ^ Z(l, d, 41), T = W(l, d, 14) ^ W(l, d, 18) ^ J(l, d, 41), v = l & g ^ ~l & m, E = d & p ^ ~d & x, k = hn(w, T, E, xn[b], O[b]), I = fn(k, y, P, v, gn[b], C[b]), U = k | 0, ot = V(s, r, 28) ^ Z(s, r, 34) ^ Z(s, r, 39), j = W(s, r, 28) ^ J(s, r, 34) ^ J(s, r, 39), it = s & o ^ s & a ^ o & a, ae = r & i ^ r & c ^ i & c;
-      y = m | 0, w = x | 0, m = g | 0, x = p | 0, g = l | 0, p = d | 0, { h: l, l: d } = $(u | 0, h | 0, I | 0, U | 0), u = a | 0, h = c | 0, a = o | 0, c = i | 0, o = s | 0, i = r | 0;
-      const Pt = an(U, j, ae);
+      const P = R(l, d, 14) ^ R(l, d, 18) ^ Z(l, d, 41), T = V(l, d, 14) ^ V(l, d, 18) ^ J(l, d, 41), v = l & g ^ ~l & w, E = d & p ^ ~d & x, k = hn(m, T, E, xn[b], C[b]), I = fn(k, y, P, v, gn[b], O[b]), U = k | 0, ot = R(s, r, 28) ^ Z(s, r, 34) ^ Z(s, r, 39), G = V(s, r, 28) ^ J(s, r, 34) ^ J(s, r, 39), it = s & o ^ s & a ^ o & a, ae = r & i ^ r & c ^ i & c;
+      y = w | 0, m = x | 0, w = g | 0, x = p | 0, g = l | 0, p = d | 0, { h: l, l: d } = $(u | 0, h | 0, I | 0, U | 0), u = a | 0, h = c | 0, a = o | 0, c = i | 0, o = s | 0, i = r | 0;
+      const Pt = an(U, G, ae);
       s = cn(Pt, I, ot, it), r = Pt | 0;
     }
-    ({ h: s, l: r } = $(this.Ah | 0, this.Al | 0, s | 0, r | 0)), { h: o, l: i } = $(this.Bh | 0, this.Bl | 0, o | 0, i | 0), { h: a, l: c } = $(this.Ch | 0, this.Cl | 0, a | 0, c | 0), { h: u, l: h } = $(this.Dh | 0, this.Dl | 0, u | 0, h | 0), { h: l, l: d } = $(this.Eh | 0, this.El | 0, l | 0, d | 0), { h: g, l: p } = $(this.Fh | 0, this.Fl | 0, g | 0, p | 0), { h: m, l: x } = $(this.Gh | 0, this.Gl | 0, m | 0, x | 0), { h: y, l: w } = $(this.Hh | 0, this.Hl | 0, y | 0, w | 0), this.set(s, r, o, i, a, c, u, h, l, d, g, p, m, x, y, w);
+    ({ h: s, l: r } = $(this.Ah | 0, this.Al | 0, s | 0, r | 0)), { h: o, l: i } = $(this.Bh | 0, this.Bl | 0, o | 0, i | 0), { h: a, l: c } = $(this.Ch | 0, this.Cl | 0, a | 0, c | 0), { h: u, l: h } = $(this.Dh | 0, this.Dl | 0, u | 0, h | 0), { h: l, l: d } = $(this.Eh | 0, this.El | 0, l | 0, d | 0), { h: g, l: p } = $(this.Fh | 0, this.Fl | 0, g | 0, p | 0), { h: w, l: x } = $(this.Gh | 0, this.Gl | 0, w | 0, x | 0), { h: y, l: m } = $(this.Hh | 0, this.Hl | 0, y | 0, m | 0), this.set(s, r, o, i, a, c, u, h, l, d, g, p, w, x, y, m);
   }
   roundClean() {
-    A(C, O);
+    A(O, C);
   }
   destroy() {
     A(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
   }
 }
-class mn extends yn {
+class wn extends yn {
   constructor() {
     super(64);
     f(this, "Ah", H[0] | 0);
@@ -1826,12 +1832,12 @@ class mn extends yn {
     f(this, "Hl", H[15] | 0);
   }
 }
-const wn = /* @__PURE__ */ rt(
+const mn = /* @__PURE__ */ rt(
   () => new bn(),
-  /* @__PURE__ */ jt(1)
+  /* @__PURE__ */ Gt(1)
 ), ee = /* @__PURE__ */ rt(
-  () => new mn(),
-  /* @__PURE__ */ jt(3)
+  () => new wn(),
+  /* @__PURE__ */ Gt(3)
 ), Pn = BigInt(0), N = BigInt(1), Tn = BigInt(2), vn = BigInt(7), kn = BigInt(256), Hn = BigInt(113), ne = [], se = [], re = [];
 for (let e = 0, t = N, n = 1, s = 0; e < 24; e++) {
   [n, s] = [s, (2 * n + 3 * s) % 5], ne.push(2 * (5 * s + n)), se.push((e + 1) * (e + 2) / 2 % 64);
@@ -1840,20 +1846,20 @@ for (let e = 0, t = N, n = 1, s = 0; e < 24; e++) {
     t = (t << N ^ (t >> vn) * Hn) % kn, t & Tn && (r ^= N << (N << BigInt(o)) - N);
   re.push(r);
 }
-const oe = Qt(re, !0), In = oe[0], En = oe[1], Ct = (e, t, n) => n > 32 ? rn(e, t, n) : nn(e, t, n), Ot = (e, t, n) => n > 32 ? on(e, t, n) : sn(e, t, n);
+const oe = Qt(re, !0), In = oe[0], En = oe[1], Ot = (e, t, n) => n > 32 ? rn(e, t, n) : nn(e, t, n), Ct = (e, t, n) => n > 32 ? on(e, t, n) : sn(e, t, n);
 function Sn(e, t = 24) {
   const n = new Uint32Array(10);
   for (let s = 24 - t; s < 24; s++) {
     for (let i = 0; i < 10; i++)
       n[i] = e[i] ^ e[i + 10] ^ e[i + 20] ^ e[i + 30] ^ e[i + 40];
     for (let i = 0; i < 10; i += 2) {
-      const a = (i + 8) % 10, c = (i + 2) % 10, u = n[c], h = n[c + 1], l = Ct(u, h, 1) ^ n[a], d = Ot(u, h, 1) ^ n[a + 1];
+      const a = (i + 8) % 10, c = (i + 2) % 10, u = n[c], h = n[c + 1], l = Ot(u, h, 1) ^ n[a], d = Ct(u, h, 1) ^ n[a + 1];
       for (let g = 0; g < 50; g += 10)
         e[i + g] ^= l, e[i + g + 1] ^= d;
     }
     let r = e[2], o = e[3];
     for (let i = 0; i < 24; i++) {
-      const a = se[i], c = Ct(r, o, a), u = Ot(r, o, a), h = ne[i];
+      const a = se[i], c = Ot(r, o, a), u = Ct(r, o, a), h = ne[i];
       r = e[h], o = e[h + 1], e[h] = c, e[h + 1] = u;
     }
     for (let i = 0; i < 50; i += 10) {
@@ -1866,7 +1872,7 @@ function Sn(e, t = 24) {
   }
   A(n);
 }
-class wt {
+class mt {
   // NOTE: we accept arguments in bytes instead of bits here.
   constructor(t, n, s, r = !1, o = 24) {
     f(this, "state");
@@ -1882,7 +1888,7 @@ class wt {
     f(this, "rounds");
     if (this.blockLen = t, this.suffix = n, this.outputLen = s, this.enableXOF = r, this.rounds = o, _(s, "outputLen"), !(0 < t && t < 200))
       throw new Error("only keccak-f1600 function is supported");
-    this.state = new Uint8Array(200), this.state32 = Ve(this.state);
+    this.state = new Uint8Array(200), this.state32 = Re(this.state);
   }
   clone() {
     return this._cloneInto();
@@ -1891,7 +1897,7 @@ class wt {
     At(this.state32), Sn(this.state32, this.rounds), At(this.state32), this.posOut = 0, this.pos = 0;
   }
   update(t) {
-    M(this), R(t);
+    M(this), W(t);
     const { blockLen: n, state: s } = this, r = t.length;
     for (let o = 0; o < r; ) {
       const i = Math.min(n - this.pos, r - o);
@@ -1909,7 +1915,7 @@ class wt {
     t[s] ^= n, (n & 128) !== 0 && s === r - 1 && this.keccak(), t[r - 1] ^= 128, this.keccak();
   }
   writeInto(t) {
-    M(this, !1), R(t), this.finish();
+    M(this, !1), W(t), this.finish();
     const n = this.state, { blockLen: s } = this;
     for (let r = 0, o = t.length; r < o; ) {
       this.posOut >= s && this.keccak();
@@ -1939,10 +1945,10 @@ class wt {
   }
   _cloneInto(t) {
     const { blockLen: n, suffix: s, outputLen: r, rounds: o, enableXOF: i } = this;
-    return t || (t = new wt(n, s, r, i, o)), t.state32.set(this.state32), t.pos = this.pos, t.posOut = this.posOut, t.finished = this.finished, t.rounds = o, t.suffix = s, t.outputLen = r, t.enableXOF = i, t.destroyed = this.destroyed, t;
+    return t || (t = new mt(n, s, r, i, o)), t.state32.set(this.state32), t.pos = this.pos, t.posOut = this.posOut, t.finished = this.finished, t.rounds = o, t.suffix = s, t.outputLen = r, t.enableXOF = i, t.destroyed = this.destroyed, t;
   }
 }
-const An = (e, t, n, s = {}) => rt(() => new wt(t, e, n), s), Bn = /* @__PURE__ */ An(1, 136, 32);
+const An = (e, t, n, s = {}) => rt(() => new mt(t, e, n), s), Bn = /* @__PURE__ */ An(1, 136, 32);
 function $n(e, t, n, s) {
   Nt(e);
   const r = Ne({ dkLen: 32, asyncTick: 10 }, s), { c: o, dkLen: i, asyncTick: a } = r;
@@ -1954,17 +1960,17 @@ function $n(e, t, n, s) {
 function Un(e, t, n, s, r) {
   return e.destroy(), t.destroy(), s && s.destroy(), A(r), n;
 }
-function Ln(e, t, n, s) {
+function Fn(e, t, n, s) {
   const { c: r, dkLen: o, DK: i, PRF: a, PRFSalt: c } = $n(e, t, n, s);
   let u;
   const h = new Uint8Array(4), l = et(h), d = new Uint8Array(a.outputLen);
   for (let g = 1, p = 0; p < o; g++, p += a.outputLen) {
-    const m = i.subarray(p, p + a.outputLen);
-    l.setInt32(0, g, !1), (u = c._cloneInto(u)).update(h).digestInto(d), m.set(d.subarray(0, m.length));
+    const w = i.subarray(p, p + a.outputLen);
+    l.setInt32(0, g, !1), (u = c._cloneInto(u)).update(h).digestInto(d), w.set(d.subarray(0, w.length));
     for (let x = 1; x < r; x++) {
       a._cloneInto(u).update(d).digestInto(d);
-      for (let y = 0; y < m.length; y++)
-        m[y] ^= d[y];
+      for (let y = 0; y < w.length; y++)
+        w[y] ^= d[y];
     }
   }
   return Un(a, c, i, u, d);
@@ -1974,17 +1980,17 @@ function ie(e) {
     throw new TypeError("invalid mnemonic type: " + typeof e);
   return e.normalize("NFKD");
 }
-function Fn(e) {
+function Ln(e) {
   const t = ie(e), n = t.split(" ");
   if (![12, 15, 18, 21, 24].includes(n.length))
     throw new Error("Invalid mnemonic");
   return { nfkd: t, words: n };
 }
-const Cn = (e) => ie("mnemonic" + e);
-function On(e, t = "") {
-  return Ln(ee, Fn(e).nfkd, Cn(t), { c: 2048, dkLen: 64 });
+const On = (e) => ie("mnemonic" + e);
+function Cn(e, t = "") {
+  return Fn(ee, Ln(e).nfkd, On(t), { c: 2048, dkLen: 64 });
 }
-const _n = 508, _t = 16, Y = 32, Q = 64, Rt = 5, Rn = 4;
+const _n = 508, _t = 16, Y = 32, Q = 64, Wt = 5, Wn = 4;
 function X(...e) {
   const t = e.reduce((r, o) => r + o.length, 0), n = new Uint8Array(t);
   let s = 0;
@@ -1996,24 +2002,24 @@ function lt(e) {
   return new TextEncoder().encode(e);
 }
 function ht(e) {
-  const t = new Uint8Array(Rn);
+  const t = new Uint8Array(Wn);
   return new DataView(t.buffer).setUint32(0, e.length, !1), X(t, e);
 }
 function ft(e, t) {
   return yt(ee, e, t);
 }
-function Vt(e) {
-  return tn(wn(e));
+function Rt(e) {
+  return tn(mn(e));
 }
 const gt = (e) => Array.from(e).map((t) => t.toString(16).padStart(2, "0")).join("");
-function Vn(e) {
-  const t = On(e);
-  return new Uint8Array(t);
+function Rn(e) {
+  const t = Cn(e), n = new Uint8Array(t);
+  return t.fill(0), n;
 }
-async function Wn(e, t, n, s) {
+async function Vn(e, t, n, s) {
   if (e.length !== Q)
     throw new Error(
-      `Lamport seed must be ${Q} bytes, got ${e.length}`
+      `WOTS seed must be ${Q} bytes, got ${e.length}`
     );
   t = D(t), n = D(n);
   const r = e.slice(Y, Q), o = e.slice(0, Y), i = [r, o];
@@ -2028,23 +2034,23 @@ async function Wn(e, t, n, s) {
     i.push(u);
     const h = u.slice(0, Y), l = u.slice(Y, Q);
     i.push(h, l);
-    const d = [], g = [], p = [], m = [];
+    const d = [], g = [], p = [], w = [];
     let x = !1;
     try {
       for (let y = 0; y < _n; y++) {
-        const w = new Uint8Array(Rt);
-        w[0] = 0, new DataView(w.buffer).setUint32(1, y, !1);
-        const b = new Uint8Array(Rt);
+        const m = new Uint8Array(Wt);
+        m[0] = 0, new DataView(m.buffer).setUint32(1, y, !1);
+        const b = new Uint8Array(Wt);
         b[0] = 1, new DataView(b.buffer).setUint32(1, y, !1);
-        const P = X(h, w), T = X(h, b), v = ft(l, P), E = ft(l, T);
+        const P = X(h, m), T = X(h, b), v = ft(l, P), E = ft(l, T);
         try {
           const k = v.slice(0, _t), I = E.slice(0, _t);
-          d.push(k), g.push(I), p.push(Vt(k)), m.push(Vt(I));
+          d.push(k), g.push(I), p.push(Rt(k)), w.push(Rt(I));
         } finally {
           P.fill(0), T.fill(0), v.fill(0), E.fill(0);
         }
       }
-      return x = !0, { falsePreimages: d, truePreimages: g, falseHashes: p, trueHashes: m };
+      return x = !0, { falsePreimages: d, truePreimages: g, falseHashes: p, trueHashes: w };
     } finally {
       if (!x) {
         for (const y of d) y.fill(0);
@@ -2065,7 +2071,7 @@ function as(e) {
 function Dn(e) {
   if (e.falseHashes.length === 0 || e.trueHashes.length === 0)
     throw new Error(
-      "computeLamportPkHash: keypair hash arrays must not be empty"
+      "computeWotsPkHash: keypair hash arrays must not be empty"
     );
   const t = e.falseHashes[0].length, n = (e.falseHashes.length + e.trueHashes.length) * t, s = new Uint8Array(n);
   let r = 0;
@@ -2077,9 +2083,9 @@ function Dn(e) {
   return `0x${gt(o)}`;
 }
 async function cs(e, t, n, s) {
-  const r = Vn(e);
+  const r = Rn(e);
   try {
-    const o = await Wn(
+    const o = await Vn(
       r,
       t,
       n,
@@ -2097,7 +2103,7 @@ async function cs(e, t, n, s) {
 }
 function us(e) {
   const t = (e instanceof Error ? e.message : typeof e == "string" ? e : "").toLowerCase();
-  return t.includes("lamport") && t.includes("hash") && t.includes("does not match");
+  return t.includes("wots") && t.includes("hash") && t.includes("does not match");
 }
 export {
   Dn as A,
@@ -2107,13 +2113,13 @@ export {
   us as E,
   Ue as M,
   os as P,
-  zn as a,
+  qn as a,
   Zn as b,
   St as c,
   Jn as d,
   Se as e,
   Ae as f,
-  qn as g,
+  zn as g,
   bt as h,
   is as i,
   es as j,
@@ -2121,17 +2127,17 @@ export {
   ts as l,
   ns as m,
   Yn as n,
-  Fe as o,
-  Ce as p,
-  Le as q,
+  Le as o,
+  Oe as p,
+  Fe as q,
   ct as r,
   Ee as s,
   xt as t,
   ss as u,
   rs as v,
   ut as w,
-  Vn as x,
-  Wn as y,
+  Rn as x,
+  Vn as y,
   as as z
 };
-//# sourceMappingURL=errors-DOJdtNTD.js.map
+//# sourceMappingURL=errors-ZoUEvcDE.js.map