bitcoin-wallet-connector 0.1.0 → 0.2.0

package/lib/{index-D7YwhNAG.mjs → index-DM4G-LJz.mjs}

@@ -1,4 +1,4 @@
-import { a as dt, B as Nt, b as zt, W as er } from "./WalletAdapters.types-CnvOqHFH.mjs";
+import { W as Be, a as dt, b as zt } from "./WalletAdapters.types-DBvhI1hu.mjs";
 function Pt({
   getPrecondition: t,
   initializer: e,
@@ -9,18 +9,18 @@ function Pt({
     o != null && (clearInterval(o), o = null);
   }, a = (u) => {
     r = u;
-    for (const g of i)
-      g(u);
+    for (const y of i)
+      y(u);
   }, f = async () => {
     if (r != null || s) return;
     const u = t();
     if (u != null) {
       s = !0;
       try {
-        const g = await e(u.value);
-        a(g), c();
-      } catch (g) {
-        console.warn("[WalletAdapter] Failed to initialize adapter", g);
+        const y = await e(u.value);
+        a(y), c();
+      } catch (y) {
+        console.warn("[WalletAdapter] Failed to initialize adapter", y);
       } finally {
         s = !1;
       }
@@ -39,134 +39,83 @@ function Pt({
     })
   };
 }
-const Pn = "bitget.bitcoin", _n = {
+const _n = "bitget.bitcoin", Hn = {
   name: "Bitget",
-  iconUrl: import("./bitget-C7oB4Ffq.mjs").then((t) => t.default),
+  iconUrl: () => import("./bitget-C7oB4Ffq.mjs").then((t) => t.default),
   websiteUrl: "https://web3.bitget.com/",
   downloadUrl: "https://web3.bitget.com/en/wallet-download"
-}, Hn = Pt({
+}, Ln = Pt({
   getPrecondition: () => window.bitkeep?.unisat == null ? null : { value: window.bitkeep.unisat },
   initializer: async (t) => {
-    const { BitgetWalletAdapterImpl: e } = await import("./BitgetWalletAdapter.impl-C_HLO7Oi.mjs");
+    const { BitgetWalletAdapterImpl: e } = await import("./BitgetWalletAdapter.impl-D8kqiYDi.mjs");
     return new e(t);
   }
-}), Qs = {
-  adapterId: Pn,
-  metadata: _n,
-  getAdapter: () => Hn
-}, Ln = "LeatherProvider.BitcoinProvider", Tn = {
+});
+function ei() {
+  return {
+    adapterId: _n,
+    metadata: Hn,
+    getAdapter: () => Ln
+  };
+}
+const Tn = "LeatherProvider.BitcoinProvider", Nn = {
   name: "Leather",
-  iconUrl: import("./leather-BoQG_CPn.mjs").then((t) => t.default),
+  iconUrl: () => import("./leather-BoQG_CPn.mjs").then((t) => t.default),
   websiteUrl: "https://leather.io/",
   downloadUrl: "https://leather.io/wallet"
-}, Nn = Pt({
+}, Cn = Pt({
   getPrecondition: () => {
     const t = window.LeatherProvider?.request;
     return t == null ? null : { value: t };
   },
   initializer: async (t) => {
-    const { LeatherWalletAdapterImpl: e } = await import("./LeatherWalletAdapter.impl-RUYx555r.mjs");
+    const { LeatherWalletAdapterImpl: e } = await import("./LeatherWalletAdapter.impl-B1PoZS7z.mjs");
     return new e(t);
   }
-}), Js = {
-  adapterId: Ln,
-  metadata: Tn,
-  getAdapter: () => Nn
-}, Cn = "magiceden.bitcoin", Dn = (t) => Pt({
+});
+function ri() {
+  return {
+    adapterId: Tn,
+    metadata: Nn,
+    getAdapter: () => Cn
+  };
+}
+const Dn = "magiceden.bitcoin", Kn = {
+  name: "Magic Eden",
+  /**
+   * https://docs-wallet.magiceden.io/resources/logos-and-brand-assets
+   */
+  iconUrl: () => import("./magiceden-Cg7d3agI.mjs").then((t) => t.default),
+  websiteUrl: "https://wallet.magiceden.io/",
+  downloadUrl: "https://wallet.magiceden.io/download"
+}, Vn = (t) => Pt({
   getPrecondition: () => {
     const e = window.magicEden?.bitcoin;
     return e?.isMagicEden ? { value: e } : null;
   },
   initializer: async (e) => {
-    const { MagicEdenWalletAdapterImpl: n } = await import("./MagicEdenWalletAdapter.impl-CrA6SGvG.mjs");
+    const { MagicEdenWalletAdapterImpl: n } = await import("./MagicEdenWalletAdapter.impl-B3d5lbkD.mjs");
     return new n(t, e);
   }
-}), ti = (t) => {
-  const e = Dn(t);
+}), ni = (t) => {
+  const e = Vn(t.network);
   return {
-    adapterId: Cn,
-    /**
-     * https://docs-wallet.magiceden.io/resources/logos-and-brand-assets
-     */
-    metadata: {
-      name: "Magic Eden",
-      iconUrl: import("./magiceden-Cg7d3agI.mjs").then((n) => n.default),
-      websiteUrl: "https://wallet.magiceden.io/",
-      downloadUrl: "https://wallet.magiceden.io/download"
-    },
+    adapterId: Dn,
+    metadata: Kn,
     getAdapter: () => e
   };
-}, Kn = "okxwallet.bitcoin", Vn = {
-  name: "OKX Wallet",
-  iconUrl: import("./okx-DWbHwazu.mjs").then((t) => t.default),
-  websiteUrl: "https://web3.okx.com/",
-  downloadUrl: "https://web3.okx.com/download"
-}, Mn = Pt({
-  getPrecondition: () => {
-    const t = window.okxwallet?.bitcoin;
-    return t == null ? null : { value: t };
-  },
-  initializer: async (t) => {
-    const { OkxWalletAdapterImpl: e } = await import("./OkxWalletAdapter.impl-BepoUL1B.mjs");
-    return new e(t);
-  }
-}), ei = {
-  adapterId: Kn,
-  metadata: Vn,
-  getAdapter: () => Mn
-}, Wn = "unisat", qn = {
-  name: "UniSat",
-  /**
-   * https://next-cdn.unisat.io/_/2025-v965/UniSat%20Logo.zip
-   */
-  iconUrl: import("./unisat-pLgab4nG.mjs").then((t) => t.default),
-  websiteUrl: "https://unisat.io/",
-  downloadUrl: "https://unisat.io/download"
-}, jn = Pt({
-  getPrecondition: () => {
-    const t = window.unisat;
-    return t == null ? null : { value: t };
-  },
-  initializer: async (t) => {
-    const { UnisatWalletAdapterImpl: e } = await import("./UnisatWalletAdapter.impl-CJB22se8.mjs");
-    return new e(t);
-  }
-}), ri = {
-  adapterId: Wn,
-  metadata: qn,
-  getAdapter: () => jn
-}, Sr = "XverseProviders.BitcoinProvider", Fn = {
-  name: "Xverse",
-  iconUrl: import("./xverse-iHLNanCB.mjs").then((t) => t.default),
-  websiteUrl: "https://xverse.app/",
-  downloadUrl: "https://www.xverse.app/download"
-}, Zn = Pt({
-  getPrecondition: () => {
-    const t = (window.btc_providers ?? []).find(
-      (e) => e.id === Sr
-    );
-    return t == null ? null : { value: t };
-  },
-  initializer: async () => {
-    const { XverseWalletAdapterImpl: t } = await import("./XverseWalletAdapter.impl-CZO0RQva.mjs");
-    return new t();
-  }
-}), ni = {
-  adapterId: Sr,
-  metadata: Fn,
-  getAdapter: () => Zn
 };
-function $t(t) {
+function It(t) {
   return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
 }
 function vr(t) {
-  if (!$t(t))
+  if (!It(t))
     throw new Error("Uint8Array expected");
 }
-function Ir(t, e) {
+function $r(t, e) {
   return Array.isArray(e) ? e.length === 0 ? !0 : t ? e.every((n) => typeof n == "string") : e.every((n) => Number.isSafeInteger(n)) : !1;
 }
-function Ne(t) {
+function Ce(t) {
   if (typeof t != "function")
     throw new Error("function expected");
   return !0;
@@ -185,11 +134,11 @@ function ee(t) {
     throw new Error("array expected");
 }
 function re(t, e) {
-  if (!Ir(!0, e))
+  if (!$r(!0, e))
     throw new Error(`${t}: array of strings expected`);
 }
-function Ce(t, e) {
-  if (!Ir(!1, e))
+function De(t, e) {
+  if (!$r(!1, e))
     throw new Error(`${t}: array of numbers expected`);
 }
 // @__NO_SIDE_EFFECTS__
@@ -225,7 +174,7 @@ function he(t = "") {
   };
 }
 // @__NO_SIDE_EFFECTS__
-function zn(t, e = "=") {
+function Mn(t, e = "=") {
   return _t(t), wt("padding", e), {
     encode(n) {
       for (re("padding.encode", n); n.length * t % 8; )
@@ -245,8 +194,8 @@ function zn(t, e = "=") {
   };
 }
 // @__NO_SIDE_EFFECTS__
-function Gn(t) {
-  return Ne(t), { encode: (e) => e, decode: (e) => t(e) };
+function Wn(t) {
+  return Ce(t), { encode: (e) => e, decode: (e) => t(e) };
 }
 function rr(t, e, n) {
   if (e < 2)
@@ -264,13 +213,13 @@ function rr(t, e, n) {
   for (; ; ) {
     let c = 0, a = !0;
     for (let f = r; f < i; f++) {
-      const d = s[f], u = e * c, g = u + d;
-      if (!Number.isSafeInteger(g) || u / e !== c || g - d !== u)
+      const d = s[f], u = e * c, y = u + d;
+      if (!Number.isSafeInteger(y) || u / e !== c || y - d !== u)
         throw new Error("convertRadix: carry overflow");
-      const l = g / n;
-      c = g % n;
+      const l = y / n;
+      c = y % n;
       const b = Math.floor(l);
-      if (s[f] = b, !Number.isSafeInteger(b) || b * n + c !== g)
+      if (s[f] = b, !Number.isSafeInteger(b) || b * n + c !== y)
         throw new Error("convertRadix: carry overflow");
       if (a)
         b ? a = !1 : r = f;
@@ -283,13 +232,13 @@ function rr(t, e, n) {
     o.push(0);
   return o.reverse();
 }
-const $r = (t, e) => e === 0 ? t : $r(e, t % e), ne = /* @__NO_SIDE_EFFECTS__ */ (t, e) => t + (e - $r(t, e)), Jt = /* @__PURE__ */ (() => {
+const Ir = (t, e) => e === 0 ? t : Ir(e, t % e), ne = /* @__NO_SIDE_EFFECTS__ */ (t, e) => t + (e - Ir(t, e)), Jt = /* @__PURE__ */ (() => {
   let t = [];
   for (let e = 0; e < 40; e++)
     t.push(2 ** e);
   return t;
 })();
-function Re(t, e, n, r) {
+function Ue(t, e, n, r) {
   if (ee(t), e <= 0 || e > 32)
     throw new Error(`convertRadix2: wrong from=${e}`);
   if (n <= 0 || n > 32)
@@ -317,51 +266,51 @@ function Re(t, e, n, r) {
   return r && s > 0 && a.push(o >>> 0), a;
 }
 // @__NO_SIDE_EFFECTS__
-function Yn(t) {
+function qn(t) {
   _t(t);
   const e = 2 ** 8;
   return {
     encode: (n) => {
-      if (!$t(n))
+      if (!It(n))
         throw new Error("radix.encode input should be Uint8Array");
       return rr(Array.from(n), e, t);
     },
-    decode: (n) => (Ce("radix.decode", n), Uint8Array.from(rr(n, t, e)))
+    decode: (n) => (De("radix.decode", n), Uint8Array.from(rr(n, t, e)))
   };
 }
 // @__NO_SIDE_EFFECTS__
-function De(t, e = !1) {
+function Ke(t, e = !1) {
   if (_t(t), t <= 0 || t > 32)
     throw new Error("radix2: bits should be in (0..32]");
   if (/* @__PURE__ */ ne(8, t) > 32 || /* @__PURE__ */ ne(t, 8) > 32)
     throw new Error("radix2: carry overflow");
   return {
     encode: (n) => {
-      if (!$t(n))
+      if (!It(n))
         throw new Error("radix2.encode input should be Uint8Array");
-      return Re(Array.from(n), 8, t, !e);
+      return Ue(Array.from(n), 8, t, !e);
     },
-    decode: (n) => (Ce("radix2.decode", n), Uint8Array.from(Re(n, t, 8, e)))
+    decode: (n) => (De("radix2.decode", n), Uint8Array.from(Ue(n, t, 8, e)))
   };
 }
 function nr(t) {
-  return Ne(t), function(...e) {
+  return Ce(t), function(...e) {
     try {
       return t.apply(null, e);
     } catch {
     }
   };
 }
-function Xn(t, e) {
-  return _t(t), Ne(e), {
+function jn(t, e) {
+  return _t(t), Ce(e), {
     encode(n) {
-      if (!$t(n))
+      if (!It(n))
         throw new Error("checksum.encode: input should be Uint8Array");
       const r = e(n).slice(0, t), o = new Uint8Array(n.length + t);
       return o.set(n), o.set(r, n.length), o;
     },
     decode(n) {
-      if (!$t(n))
+      if (!It(n))
         throw new Error("checksum.decode: input should be Uint8Array");
       const r = n.slice(0, -t), o = n.slice(-t), s = e(r).slice(0, t);
       for (let i = 0; i < t; i++)
@@ -371,21 +320,21 @@ function Xn(t, e) {
     }
   };
 }
-const Qn = typeof Uint8Array.from([]).toBase64 == "function" && typeof Uint8Array.fromBase64 == "function", Jn = (t, e) => {
+const Fn = typeof Uint8Array.from([]).toBase64 == "function" && typeof Uint8Array.fromBase64 == "function", Zn = (t, e) => {
   wt("base64", t);
   const n = /^[A-Za-z0-9=+/]+$/, r = "base64";
   if (t.length > 0 && !n.test(t))
     throw new Error("invalid base64");
   return Uint8Array.fromBase64(t, { alphabet: r, lastChunkHandling: "strict" });
-}, oi = Qn ? {
+}, oi = Fn ? {
   encode(t) {
     return vr(t), t.toBase64();
   },
   decode(t) {
-    return Jn(t);
+    return Zn(t);
   }
-} : /* @__PURE__ */ Mt(/* @__PURE__ */ De(6), /* @__PURE__ */ de("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), /* @__PURE__ */ zn(6), /* @__PURE__ */ he("")), to = /* @__NO_SIDE_EFFECTS__ */ (t) => /* @__PURE__ */ Mt(/* @__PURE__ */ Yn(58), /* @__PURE__ */ de(t), /* @__PURE__ */ he("")), eo = /* @__PURE__ */ to("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"), ro = (t) => /* @__PURE__ */ Mt(Xn(4, (e) => t(t(e))), eo), Ue = /* @__PURE__ */ Mt(/* @__PURE__ */ de("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), /* @__PURE__ */ he("")), or = [996825010, 642813549, 513874426, 1027748829, 705979059];
-function Ct(t) {
+} : /* @__PURE__ */ Mt(/* @__PURE__ */ Ke(6), /* @__PURE__ */ de("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), /* @__PURE__ */ Mn(6), /* @__PURE__ */ he("")), zn = /* @__NO_SIDE_EFFECTS__ */ (t) => /* @__PURE__ */ Mt(/* @__PURE__ */ qn(58), /* @__PURE__ */ de(t), /* @__PURE__ */ he("")), Gn = /* @__PURE__ */ zn("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"), Yn = (t) => /* @__PURE__ */ Mt(jn(4, (e) => t(t(e))), Gn), ke = /* @__PURE__ */ Mt(/* @__PURE__ */ de("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), /* @__PURE__ */ he("")), or = [996825010, 642813549, 513874426, 1027748829, 705979059];
+function Nt(t) {
   const e = t >> 25;
   let n = (t & 33554431) << 5;
   for (let r = 0; r < or.length; r++)
@@ -399,36 +348,36 @@ function sr(t, e, n = 1) {
     const i = t.charCodeAt(s);
     if (i < 33 || i > 126)
       throw new Error(`Invalid prefix (${t})`);
-    o = Ct(o) ^ i >> 5;
+    o = Nt(o) ^ i >> 5;
   }
-  o = Ct(o);
+  o = Nt(o);
   for (let s = 0; s < r; s++)
-    o = Ct(o) ^ t.charCodeAt(s) & 31;
+    o = Nt(o) ^ t.charCodeAt(s) & 31;
   for (let s of e)
-    o = Ct(o) ^ s;
+    o = Nt(o) ^ s;
   for (let s = 0; s < 6; s++)
-    o = Ct(o);
-  return o ^= n, Ue.encode(Re([o % Jt[30]], 30, 5, !1));
+    o = Nt(o);
+  return o ^= n, ke.encode(Ue([o % Jt[30]], 30, 5, !1));
 }
 // @__NO_SIDE_EFFECTS__
 function Or(t) {
-  const e = t === "bech32" ? 1 : 734539939, n = /* @__PURE__ */ De(5), r = n.decode, o = n.encode, s = nr(r);
-  function i(u, g, l = 90) {
-    wt("bech32.encode prefix", u), $t(g) && (g = Array.from(g)), Ce("bech32.encode", g);
+  const e = t === "bech32" ? 1 : 734539939, n = /* @__PURE__ */ Ke(5), r = n.decode, o = n.encode, s = nr(r);
+  function i(u, y, l = 90) {
+    wt("bech32.encode prefix", u), It(y) && (y = Array.from(y)), De("bech32.encode", y);
     const b = u.length;
     if (b === 0)
       throw new TypeError(`Invalid prefix length ${b}`);
-    const v = b + 7 + g.length;
+    const v = b + 7 + y.length;
     if (l !== !1 && v > l)
       throw new TypeError(`Length ${v} exceeds limit ${l}`);
-    const S = u.toLowerCase(), O = sr(S, g, e);
-    return `${S}1${Ue.encode(g)}${O}`;
+    const S = u.toLowerCase(), O = sr(S, y, e);
+    return `${S}1${ke.encode(y)}${O}`;
   }
-  function c(u, g = 90) {
+  function c(u, y = 90) {
     wt("bech32.decode input", u);
     const l = u.length;
-    if (l < 8 || g !== !1 && l > g)
-      throw new TypeError(`invalid string length: ${l} (${u}). Expected (8..${g})`);
+    if (l < 8 || y !== !1 && l > y)
+      throw new TypeError(`invalid string length: ${l} (${u}). Expected (8..${y})`);
     const b = u.toLowerCase();
     if (u !== b && u !== u.toUpperCase())
       throw new Error("String must be lowercase or uppercase");
@@ -438,18 +387,18 @@ function Or(t) {
     const S = b.slice(0, v), O = b.slice(v + 1);
     if (O.length < 6)
       throw new Error("Data must be at least 6 characters long");
-    const V = Ue.decode(O).slice(0, -6), F = sr(S, V, e);
+    const V = ke.decode(O).slice(0, -6), F = sr(S, V, e);
     if (!O.endsWith(F))
       throw new Error(`Invalid checksum in ${u}: expected "${F}"`);
     return { prefix: S, words: V };
   }
   const a = nr(c);
   function f(u) {
-    const { prefix: g, words: l } = c(u, !1);
-    return { prefix: g, words: l, bytes: r(l) };
+    const { prefix: y, words: l } = c(u, !1);
+    return { prefix: y, words: l, bytes: r(l) };
   }
-  function d(u, g) {
-    return i(u, o(g));
+  function d(u, y) {
+    return i(u, o(y));
   }
   return {
     encode: i,
@@ -462,22 +411,22 @@ function Or(t) {
     toWords: o
   };
 }
-const ke = /* @__PURE__ */ Or("bech32"), Rr = /* @__PURE__ */ Or("bech32m"), no = {
+const Pe = /* @__PURE__ */ Or("bech32"), Rr = /* @__PURE__ */ Or("bech32m"), Xn = {
   encode: (t) => new TextDecoder().decode(t),
   decode: (t) => new TextEncoder().encode(t)
-}, oo = typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", so = {
+}, Qn = typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", Jn = {
   encode(t) {
     return vr(t), t.toHex();
   },
   decode(t) {
     return wt("hex", t), Uint8Array.fromHex(t);
   }
-}, rt = oo ? so : /* @__PURE__ */ Mt(/* @__PURE__ */ De(4), /* @__PURE__ */ de("0123456789abcdef"), /* @__PURE__ */ he(""), /* @__PURE__ */ Gn((t) => {
+}, rt = Qn ? Jn : /* @__PURE__ */ Mt(/* @__PURE__ */ Ke(4), /* @__PURE__ */ de("0123456789abcdef"), /* @__PURE__ */ he(""), /* @__PURE__ */ Wn((t) => {
   if (typeof t != "string" || t.length % 2 !== 0)
     throw new TypeError(`hex.decode: expected string, got ${typeof t} with length ${t.length}`);
   return t.toLowerCase();
 }));
-function Ke(t) {
+function Ve(t) {
   return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
 }
 function mt(t, e = "") {
@@ -487,7 +436,7 @@ function mt(t, e = "") {
   }
 }
 function k(t, e, n = "") {
-  const r = Ke(t), o = t?.length, s = e !== void 0;
+  const r = Ve(t), o = t?.length, s = e !== void 0;
   if (!r || s && o !== e) {
     const i = n && `"${n}" `, c = s ? ` of length ${e}` : "", a = r ? `length=${o}` : `type=${typeof t}`;
     throw new Error(i + "expected Uint8Array" + c + ", got " + a);
@@ -505,7 +454,7 @@ function oe(t, e = !0) {
   if (e && t.finished)
     throw new Error("Hash#digest() has already been called");
 }
-function io(t, e) {
+function to(t, e) {
   k(t, void 0, "digestInto() output");
   const n = e.outputLen;
   if (t.length < n)
@@ -515,7 +464,7 @@ function Ot(...t) {
   for (let e = 0; e < t.length; e++)
     t[e].fill(0);
 }
-function Be(t) {
+function Se(t) {
   return new DataView(t.buffer, t.byteOffset, t.byteLength);
 }
 function tt(t, e) {
@@ -524,13 +473,13 @@ function tt(t, e) {
 function Gt(t, e) {
   return t << e | t >>> 32 - e >>> 0;
 }
-const kr = /* @ts-ignore */ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", co = /* @__PURE__ */ Array.from({ length: 256 }, (t, e) => e.toString(16).padStart(2, "0"));
+const kr = /* @ts-ignore */ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", eo = /* @__PURE__ */ Array.from({ length: 256 }, (t, e) => e.toString(16).padStart(2, "0"));
 function le(t) {
   if (k(t), kr)
     return t.toHex();
   let e = "";
   for (let n = 0; n < t.length; n++)
-    e += co[t[n]];
+    e += eo[t[n]];
   return e;
 }
 const st = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
@@ -584,13 +533,13 @@ function pe(t = 32) {
     throw new Error("crypto.getRandomValues must be defined");
   return e.getRandomValues(new Uint8Array(t));
 }
-const ao = (t) => ({
+const ro = (t) => ({
   oid: Uint8Array.from([6, 9, 96, 134, 72, 1, 101, 3, 4, 2, t])
 });
-function fo(t, e, n) {
+function no(t, e, n) {
   return t & e ^ ~t & n;
 }
-function uo(t, e, n) {
+function oo(t, e, n) {
   return t & e ^ t & n ^ e & n;
 }
 class _r {
@@ -606,7 +555,7 @@ class _r {
   pos = 0;
   destroyed = !1;
   constructor(e, n, r, o) {
-    this.blockLen = e, this.outputLen = n, this.padOffset = r, this.isLE = o, this.buffer = new Uint8Array(e), this.view = Be(this.buffer);
+    this.blockLen = e, this.outputLen = n, this.padOffset = r, this.isLE = o, this.buffer = new Uint8Array(e), this.view = Se(this.buffer);
   }
   update(e) {
     oe(this), k(e);
@@ -614,7 +563,7 @@ class _r {
     for (let i = 0; i < s; ) {
       const c = Math.min(o - this.pos, s - i);
       if (c === o) {
-        const a = Be(e);
+        const a = Se(e);
         for (; o <= s - i; i += o)
           this.process(a, i);
         continue;
@@ -624,14 +573,14 @@ class _r {
     return this.length += e.length, this.roundClean(), this;
   }
   digestInto(e) {
-    oe(this), io(e, this), this.finished = !0;
+    oe(this), to(e, this), this.finished = !0;
     const { buffer: n, view: r, blockLen: o, isLE: s } = this;
     let { pos: i } = this;
     n[i++] = 128, Ot(this.buffer.subarray(i)), this.padOffset > o - i && (this.process(r, 0), i = 0);
     for (let u = i; u < o; u++)
       n[u] = 0;
     r.setBigUint64(o - 8, BigInt(this.length * 8), s), this.process(r, 0);
-    const c = Be(e), a = this.outputLen;
+    const c = Se(e), a = this.outputLen;
     if (a % 4)
       throw new Error("_sha2: outputLen must be aligned to 32bit");
     const f = a / 4, d = this.get();
@@ -664,7 +613,7 @@ const ht = /* @__PURE__ */ Uint32Array.from([
   2600822924,
   528734635,
   1541459225
-]), ho = /* @__PURE__ */ Uint32Array.from([
+]), so = /* @__PURE__ */ Uint32Array.from([
   1116352408,
   1899447441,
   3049323471,
@@ -730,7 +679,7 @@ const ht = /* @__PURE__ */ Uint32Array.from([
   3204031479,
   3329325298
 ]), lt = /* @__PURE__ */ new Uint32Array(64);
-class lo extends _r {
+class io extends _r {
   constructor(e) {
     super(64, e, 8, !1);
   }
@@ -746,12 +695,12 @@ class lo extends _r {
     for (let u = 0; u < 16; u++, n += 4)
       lt[u] = e.getUint32(n, !1);
     for (let u = 16; u < 64; u++) {
-      const g = lt[u - 15], l = lt[u - 2], b = tt(g, 7) ^ tt(g, 18) ^ g >>> 3, v = tt(l, 17) ^ tt(l, 19) ^ l >>> 10;
+      const y = lt[u - 15], l = lt[u - 2], b = tt(y, 7) ^ tt(y, 18) ^ y >>> 3, v = tt(l, 17) ^ tt(l, 19) ^ l >>> 10;
       lt[u] = v + lt[u - 7] + b + lt[u - 16] | 0;
     }
     let { A: r, B: o, C: s, D: i, E: c, F: a, G: f, H: d } = this;
     for (let u = 0; u < 64; u++) {
-      const g = tt(c, 6) ^ tt(c, 11) ^ tt(c, 25), l = d + g + fo(c, a, f) + ho[u] + lt[u] | 0, v = (tt(r, 2) ^ tt(r, 13) ^ tt(r, 22)) + uo(r, o, s) | 0;
+      const y = tt(c, 6) ^ tt(c, 11) ^ tt(c, 25), l = d + y + no(c, a, f) + so[u] + lt[u] | 0, v = (tt(r, 2) ^ tt(r, 13) ^ tt(r, 22)) + oo(r, o, s) | 0;
       d = f, f = a, a = c, c = i + l | 0, i = s, s = o, o = r, r = l + v | 0;
     }
     r = r + this.A | 0, o = o + this.B | 0, s = s + this.C | 0, i = i + this.D | 0, c = c + this.E | 0, a = a + this.F | 0, f = f + this.G | 0, d = d + this.H | 0, this.set(r, o, s, i, c, a, f, d);
@@ -763,7 +712,7 @@ class lo extends _r {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), Ot(this.buffer);
   }
 }
-class po extends lo {
+class co extends io {
   // We cannot use array here since array allows indexing by variable
   // which means optimizer/compiler cannot use registers.
   A = ht[0] | 0;
@@ -779,10 +728,10 @@ class po extends lo {
   }
 }
 const at = /* @__PURE__ */ Pr(
-  () => new po(),
-  /* @__PURE__ */ ao(1)
+  () => new co(),
+  /* @__PURE__ */ ro(1)
 );
-const Ve = /* @__PURE__ */ BigInt(0), Pe = /* @__PURE__ */ BigInt(1);
+const Me = /* @__PURE__ */ BigInt(0), _e = /* @__PURE__ */ BigInt(1);
 function ie(t, e = "") {
   if (typeof t != "boolean") {
     const n = e && `"${e}" `;
@@ -805,13 +754,13 @@ function Yt(t) {
 function Lr(t) {
   if (typeof t != "string")
     throw new Error("hex string expected, got " + typeof t);
-  return t === "" ? Ve : BigInt("0x" + t);
+  return t === "" ? Me : BigInt("0x" + t);
 }
 function ut(t) {
   return Lr(le(t));
 }
 function Tr(t) {
-  return Lr(le(wo(k(t)).reverse()));
+  return Lr(le(ao(k(t)).reverse()));
 }
 function we(t, e) {
   mt(e), t = Hr(t);
@@ -823,10 +772,10 @@ function we(t, e) {
 function Nr(t, e) {
   return we(t, e).reverse();
 }
-function wo(t) {
+function ao(t) {
   return Uint8Array.from(t);
 }
-function go(t) {
+function fo(t) {
   return Uint8Array.from(t, (e, n) => {
     const r = e.charCodeAt(0);
     if (e.length !== 1 || r > 127)
@@ -834,37 +783,37 @@ function go(t) {
     return r;
   });
 }
-const te = (t) => typeof t == "bigint" && Ve <= t;
-function yo(t, e, n) {
+const te = (t) => typeof t == "bigint" && Me <= t;
+function uo(t, e, n) {
   return te(t) && te(e) && te(n) && e <= t && t < n;
 }
-function bo(t, e, n, r) {
-  if (!yo(e, n, r))
+function ho(t, e, n, r) {
+  if (!uo(e, n, r))
     throw new Error("expected valid " + t + ": " + n + " <= n < " + r + ", got " + e);
 }
-function Eo(t) {
+function lo(t) {
   let e;
-  for (e = 0; t > Ve; t >>= Pe, e += 1)
+  for (e = 0; t > Me; t >>= _e, e += 1)
     ;
   return e;
 }
-const Me = (t) => (Pe << BigInt(t)) - Pe;
-function mo(t, e, n) {
+const We = (t) => (_e << BigInt(t)) - _e;
+function po(t, e, n) {
   if (mt(t, "hashLen"), mt(e, "qByteLen"), typeof n != "function")
     throw new Error("hmacFn must be a function");
   const r = (S) => new Uint8Array(S), o = Uint8Array.of(), s = Uint8Array.of(0), i = Uint8Array.of(1), c = 1e3;
   let a = r(t), f = r(t), d = 0;
   const u = () => {
     a.fill(1), f.fill(0), d = 0;
-  }, g = (...S) => n(f, et(a, ...S)), l = (S = o) => {
-    f = g(s, S), a = g(), S.length !== 0 && (f = g(i, S), a = g());
+  }, y = (...S) => n(f, et(a, ...S)), l = (S = o) => {
+    f = y(s, S), a = y(), S.length !== 0 && (f = y(i, S), a = y());
   }, b = () => {
     if (d++ >= c)
       throw new Error("drbg: tried max amount of iterations");
     let S = 0;
     const O = [];
     for (; S < e; ) {
-      a = g();
+      a = y();
       const V = a.slice();
       O.push(V), S += a.length;
     }
@@ -878,7 +827,7 @@ function mo(t, e, n) {
     return u(), V;
   };
 }
-function We(t, e = {}, n = {}) {
+function qe(t, e = {}, n = {}) {
   if (!t || typeof t != "object")
     throw new Error("expected valid options object");
   function r(s, i, c) {
@@ -902,7 +851,7 @@ function cr(t) {
     return e.set(n, s), s;
   };
 }
-const j = /* @__PURE__ */ BigInt(0), q = /* @__PURE__ */ BigInt(1), yt = /* @__PURE__ */ BigInt(2), Cr = /* @__PURE__ */ BigInt(3), Dr = /* @__PURE__ */ BigInt(4), Kr = /* @__PURE__ */ BigInt(5), xo = /* @__PURE__ */ BigInt(7), Vr = /* @__PURE__ */ BigInt(8), Ao = /* @__PURE__ */ BigInt(9), Mr = /* @__PURE__ */ BigInt(16);
+const j = /* @__PURE__ */ BigInt(0), q = /* @__PURE__ */ BigInt(1), gt = /* @__PURE__ */ BigInt(2), Cr = /* @__PURE__ */ BigInt(3), Dr = /* @__PURE__ */ BigInt(4), Kr = /* @__PURE__ */ BigInt(5), wo = /* @__PURE__ */ BigInt(7), Vr = /* @__PURE__ */ BigInt(8), yo = /* @__PURE__ */ BigInt(9), Mr = /* @__PURE__ */ BigInt(16);
 function X(t, e) {
   const n = t % e;
   return n >= j ? n : e + n;
@@ -927,66 +876,66 @@ function ar(t, e) {
     throw new Error("invert: does not exist");
   return X(o, e);
 }
-function qe(t, e, n) {
+function je(t, e, n) {
   if (!t.eql(t.sqr(e), n))
     throw new Error("Cannot find square root");
 }
 function Wr(t, e) {
   const n = (t.ORDER + q) / Dr, r = t.pow(e, n);
-  return qe(t, r, e), r;
+  return je(t, r, e), r;
 }
-function Bo(t, e) {
-  const n = (t.ORDER - Kr) / Vr, r = t.mul(e, yt), o = t.pow(r, n), s = t.mul(e, o), i = t.mul(t.mul(s, yt), o), c = t.mul(s, t.sub(i, t.ONE));
-  return qe(t, c, e), c;
+function go(t, e) {
+  const n = (t.ORDER - Kr) / Vr, r = t.mul(e, gt), o = t.pow(r, n), s = t.mul(e, o), i = t.mul(t.mul(s, gt), o), c = t.mul(s, t.sub(i, t.ONE));
+  return je(t, c, e), c;
 }
-function So(t) {
-  const e = ge(t), n = qr(t), r = n(e, e.neg(e.ONE)), o = n(e, r), s = n(e, e.neg(r)), i = (t + xo) / Mr;
+function bo(t) {
+  const e = ye(t), n = qr(t), r = n(e, e.neg(e.ONE)), o = n(e, r), s = n(e, e.neg(r)), i = (t + wo) / Mr;
   return (c, a) => {
     let f = c.pow(a, i), d = c.mul(f, r);
-    const u = c.mul(f, o), g = c.mul(f, s), l = c.eql(c.sqr(d), a), b = c.eql(c.sqr(u), a);
-    f = c.cmov(f, d, l), d = c.cmov(g, u, b);
+    const u = c.mul(f, o), y = c.mul(f, s), l = c.eql(c.sqr(d), a), b = c.eql(c.sqr(u), a);
+    f = c.cmov(f, d, l), d = c.cmov(y, u, b);
     const v = c.eql(c.sqr(d), a), S = c.cmov(f, d, v);
-    return qe(c, S, a), S;
+    return je(c, S, a), S;
   };
 }
 function qr(t) {
   if (t < Cr)
     throw new Error("sqrt is not defined for small field");
   let e = t - q, n = 0;
-  for (; e % yt === j; )
-    e /= yt, n++;
-  let r = yt;
-  const o = ge(t);
+  for (; e % gt === j; )
+    e /= gt, n++;
+  let r = gt;
+  const o = ye(t);
   for (; fr(o, r) === 1; )
     if (r++ > 1e3)
       throw new Error("Cannot find square root: probably non-prime P");
   if (n === 1)
     return Wr;
   let s = o.pow(r, e);
-  const i = (e + q) / yt;
+  const i = (e + q) / gt;
   return function(a, f) {
     if (a.is0(f))
       return f;
     if (fr(a, f) !== 1)
       throw new Error("Cannot find square root");
-    let d = n, u = a.mul(a.ONE, s), g = a.pow(f, e), l = a.pow(f, i);
-    for (; !a.eql(g, a.ONE); ) {
-      if (a.is0(g))
+    let d = n, u = a.mul(a.ONE, s), y = a.pow(f, e), l = a.pow(f, i);
+    for (; !a.eql(y, a.ONE); ) {
+      if (a.is0(y))
         return a.ZERO;
-      let b = 1, v = a.sqr(g);
+      let b = 1, v = a.sqr(y);
       for (; !a.eql(v, a.ONE); )
         if (b++, v = a.sqr(v), b === d)
           throw new Error("Cannot find square root");
       const S = q << BigInt(d - b - 1), O = a.pow(u, S);
-      d = b, u = a.sqr(O), g = a.mul(g, u), l = a.mul(l, O);
+      d = b, u = a.sqr(O), y = a.mul(y, u), l = a.mul(l, O);
     }
     return l;
   };
 }
-function vo(t) {
-  return t % Dr === Cr ? Wr : t % Vr === Kr ? Bo : t % Mr === Ao ? So(t) : qr(t);
+function Eo(t) {
+  return t % Dr === Cr ? Wr : t % Vr === Kr ? go : t % Mr === yo ? bo(t) : qr(t);
 }
-const Io = [
+const mo = [
   "create",
   "isValid",
   "is0",
@@ -1005,15 +954,15 @@ const Io = [
   "mulN",
   "sqrN"
 ];
-function $o(t) {
+function xo(t) {
   const e = {
     ORDER: "bigint",
     BYTES: "number",
     BITS: "number"
-  }, n = Io.reduce((r, o) => (r[o] = "function", r), e);
-  return We(t, n), t;
+  }, n = mo.reduce((r, o) => (r[o] = "function", r), e);
+  return qe(t, n), t;
 }
-function Oo(t, e, n) {
+function Ao(t, e, n) {
   if (n < j)
     throw new Error("invalid exponent, negatives unsupported");
   if (n === j)
@@ -1030,17 +979,17 @@ function jr(t, e, n = !1) {
   return e.reduceRight((i, c, a) => t.is0(c) ? i : (r[a] = t.mul(i, r[a]), t.mul(i, c)), s), r;
 }
 function fr(t, e) {
-  const n = (t.ORDER - q) / yt, r = t.pow(e, n), o = t.eql(r, t.ONE), s = t.eql(r, t.ZERO), i = t.eql(r, t.neg(t.ONE));
+  const n = (t.ORDER - q) / gt, r = t.pow(e, n), o = t.eql(r, t.ONE), s = t.eql(r, t.ZERO), i = t.eql(r, t.neg(t.ONE));
   if (!o && !s && !i)
     throw new Error("invalid Legendre symbol result");
   return o ? 1 : s ? 0 : -1;
 }
-function Ro(t, e) {
+function Bo(t, e) {
   e !== void 0 && mt(e);
   const n = e !== void 0 ? e : t.toString(2).length, r = Math.ceil(n / 8);
   return { nBitLength: n, nByteLength: r };
 }
-class Uo {
+class So {
   ORDER;
   BITS;
   BYTES;
@@ -1056,7 +1005,7 @@ class Uo {
       throw new Error("invalid field: expected ORDER > 0, got " + e);
     let r;
     this.isLE = !1, n != null && typeof n == "object" && (typeof n.BITS == "number" && (r = n.BITS), typeof n.sqrt == "function" && (this.sqrt = n.sqrt), typeof n.isLE == "boolean" && (this.isLE = n.isLE), n.allowedLengths && (this._lengths = n.allowedLengths?.slice()), typeof n.modFromBytes == "boolean" && (this._mod = n.modFromBytes));
-    const { nBitLength: o, nByteLength: s } = Ro(e, r);
+    const { nBitLength: o, nByteLength: s } = Bo(e, r);
     if (s > 2048)
       throw new Error("invalid field: expected ORDER of <= 2048 bytes");
     this.ORDER = e, this.BITS = o, this.BYTES = s, this._sqrt = void 0, Object.preventExtensions(this);
@@ -1098,7 +1047,7 @@ class Uo {
     return X(e * n, this.ORDER);
   }
   pow(e, n) {
-    return Oo(this, e, n);
+    return Ao(this, e, n);
   }
   div(e, n) {
     return X(e * ar(n, this.ORDER), this.ORDER);
@@ -1120,7 +1069,7 @@ class Uo {
     return ar(e, this.ORDER);
   }
   sqrt(e) {
-    return this._sqrt || (this._sqrt = vo(this.ORDER)), this._sqrt(this, e);
+    return this._sqrt || (this._sqrt = Eo(this.ORDER)), this._sqrt(this, e);
   }
   toBytes(e) {
     return this.isLE ? Nr(e, this.BYTES) : we(e, this.BYTES);
@@ -1151,8 +1100,8 @@ class Uo {
     return r ? n : e;
   }
 }
-function ge(t, e = {}) {
-  return new Uo(t, e);
+function ye(t, e = {}) {
+  return new So(t, e);
 }
 function Fr(t) {
   if (typeof t != "bigint")
@@ -1185,19 +1134,19 @@ function Gr(t, e) {
   if (!Number.isSafeInteger(t) || t <= 0 || t > e)
     throw new Error("invalid window size, expected [1.." + e + "], got W=" + t);
 }
-function Se(t, e) {
+function ve(t, e) {
   Gr(t, e);
-  const n = Math.ceil(e / t) + 1, r = 2 ** (t - 1), o = 2 ** t, s = Me(t), i = BigInt(t);
+  const n = Math.ceil(e / t) + 1, r = 2 ** (t - 1), o = 2 ** t, s = We(t), i = BigInt(t);
   return { windows: n, windowSize: r, mask: s, maxNumber: o, shiftBy: i };
 }
 function dr(t, e, n) {
   const { windowSize: r, mask: o, maxNumber: s, shiftBy: i } = n;
   let c = Number(t & o), a = t >> i;
   c > r && (c -= s, a += bt);
-  const f = e * r, d = f + Math.abs(c) - 1, u = c === 0, g = c < 0, l = e % 2 !== 0;
-  return { nextN: a, offset: d, isZero: u, isNeg: g, isNegF: l, offsetF: f };
+  const f = e * r, d = f + Math.abs(c) - 1, u = c === 0, y = c < 0, l = e % 2 !== 0;
+  return { nextN: a, offset: d, isZero: u, isNeg: y, isNegF: l, offsetF: f };
 }
-const ve = /* @__PURE__ */ new WeakMap(), Yr = /* @__PURE__ */ new WeakMap();
+const $e = /* @__PURE__ */ new WeakMap(), Yr = /* @__PURE__ */ new WeakMap();
 function Ie(t) {
   return Yr.get(t) || 1;
 }
@@ -1205,7 +1154,7 @@ function hr(t) {
   if (t !== Rt)
     throw new Error("invalid wNAF");
 }
-class ko {
+class vo {
   BASE;
   ZERO;
   Fn;
@@ -1234,7 +1183,7 @@ class ko {
    * @returns precomputed point tables flattened to a single array
    */
   precomputeWindow(e, n) {
-    const { windows: r, windowSize: o } = Se(n, this.bits), s = [];
+    const { windows: r, windowSize: o } = ve(n, this.bits), s = [];
     let i = e, c = i;
     for (let a = 0; a < r; a++) {
       c = i, s.push(c);
@@ -1254,10 +1203,10 @@ class ko {
     if (!this.Fn.isValid(r))
       throw new Error("invalid scalar");
     let o = this.ZERO, s = this.BASE;
-    const i = Se(e, this.bits);
+    const i = ve(e, this.bits);
     for (let c = 0; c < i.windows; c++) {
-      const { nextN: a, offset: f, isZero: d, isNeg: u, isNegF: g, offsetF: l } = dr(r, c, i);
-      r = a, d ? s = s.add(ce(g, n[l])) : o = o.add(ce(u, n[f]));
+      const { nextN: a, offset: f, isZero: d, isNeg: u, isNegF: y, offsetF: l } = dr(r, c, i);
+      r = a, d ? s = s.add(ce(y, n[l])) : o = o.add(ce(u, n[f]));
     }
     return hr(r), { p: o, f: s };
   }
@@ -1267,7 +1216,7 @@ class ko {
    * @returns point
    */
   wNAFUnsafe(e, n, r, o = this.ZERO) {
-    const s = Se(e, this.bits);
+    const s = ve(e, this.bits);
     for (let i = 0; i < s.windows && r !== Rt; i++) {
       const { nextN: c, offset: a, isZero: f, isNeg: d } = dr(r, i, s);
       if (r = c, !f) {
@@ -1278,8 +1227,8 @@ class ko {
     return hr(r), o;
   }
   getPrecomputes(e, n, r) {
-    let o = ve.get(n);
-    return o || (o = this.precomputeWindow(n, e), e !== 1 && (typeof r == "function" && (o = r(o)), ve.set(n, o))), o;
+    let o = $e.get(n);
+    return o || (o = this.precomputeWindow(n, e), e !== 1 && (typeof r == "function" && (o = r(o)), $e.set(n, o))), o;
   }
   cached(e, n, r) {
     const o = Ie(e);
@@ -1293,13 +1242,13 @@ class ko {
   // using windowed method. This specifies window size and
   // stores precomputed values. Usually only base point would be precomputed.
   createCache(e, n) {
-    Gr(n, this.bits), Yr.set(e, n), ve.delete(e);
+    Gr(n, this.bits), Yr.set(e, n), $e.delete(e);
   }
   hasCache(e) {
     return Ie(e) !== 1;
   }
 }
-function Po(t, e, n, r) {
+function $o(t, e, n, r) {
   let o = e, s = t.ZERO, i = t.ZERO;
   for (; n > Rt || r > Rt; )
     n & bt && (s = s.add(o)), r & bt && (i = i.add(o)), o = o.double(), n >>= bt, r >>= bt;
@@ -1309,11 +1258,11 @@ function lr(t, e, n) {
   if (e) {
     if (e.ORDER !== t)
       throw new Error("Field.ORDER must match order: Fp == p, Fn == n");
-    return $o(e), e;
+    return xo(e), e;
   } else
-    return ge(t, { isLE: n });
+    return ye(t, { isLE: n });
 }
-function _o(t, e, n = {}, r) {
+function Io(t, e, n = {}, r) {
   if (r === void 0 && (r = t === "edwards"), !e || typeof e != "object")
     throw new Error(`expected valid ${t} CURVE object`);
   for (const a of ["p", "n", "h"]) {
@@ -1378,35 +1327,35 @@ class Qr {
 const Jr = (t, e, n) => new Qr(t, e).update(n).digest();
 Jr.create = (t, e) => new Qr(t, e);
 const pr = (t, e) => (t + (t >= 0 ? e : -e) / tn) / e;
-function Ho(t, e, n) {
+function Oo(t, e, n) {
   const [[r, o], [s, i]] = e, c = pr(i * t, n), a = pr(-o * t, n);
   let f = t - c * r - a * s, d = -c * o - a * i;
-  const u = f < it, g = d < it;
-  u && (f = -f), g && (d = -d);
-  const l = Me(Math.ceil(Eo(n) / 2)) + It;
+  const u = f < it, y = d < it;
+  u && (f = -f), y && (d = -d);
+  const l = We(Math.ceil(lo(n) / 2)) + $t;
   if (f < it || f >= l || d < it || d >= l)
     throw new Error("splitScalar (endomorphism): failed, k=" + t);
-  return { k1neg: u, k1: f, k2neg: g, k2: d };
+  return { k1neg: u, k1: f, k2neg: y, k2: d };
 }
-function _e(t) {
+function He(t) {
   if (!["compact", "recovered", "der"].includes(t))
     throw new Error('Signature format must be "compact", "recovered", or "der"');
   return t;
 }
-function $e(t, e) {
+function Oe(t, e) {
   const n = {};
   for (let r of Object.keys(e))
     n[r] = t[r] === void 0 ? e[r] : t[r];
-  return ie(n.lowS, "lowS"), ie(n.prehash, "prehash"), n.format !== void 0 && _e(n.format), n;
+  return ie(n.lowS, "lowS"), ie(n.prehash, "prehash"), n.format !== void 0 && He(n.format), n;
 }
-class Lo extends Error {
+class Ro extends Error {
   constructor(e = "") {
     super(e);
   }
 }
 const pt = {
   // asn.1 DER encoding utils
-  Err: Lo,
+  Err: Ro,
   // Basic building block is TLV (Tag-Length-Value)
   _tlv: {
     encode: (t, e) => {
@@ -1491,12 +1440,12 @@ const pt = {
     const { _tlv: e, _int: n } = pt, r = e.encode(2, n.encode(t.r)), o = e.encode(2, n.encode(t.s)), s = r + o;
     return e.encode(48, s);
   }
-}, it = BigInt(0), It = BigInt(1), tn = BigInt(2), Xt = BigInt(3), To = BigInt(4);
-function No(t, e = {}) {
-  const n = _o("weierstrass", t, e), { Fp: r, Fn: o } = n;
+}, it = BigInt(0), $t = BigInt(1), tn = BigInt(2), Xt = BigInt(3), Uo = BigInt(4);
+function ko(t, e = {}) {
+  const n = Io("weierstrass", t, e), { Fp: r, Fn: o } = n;
   let s = n.CURVE;
   const { h: i, n: c } = s;
-  We(e, {}, {
+  qe(e, {}, {
     allowInfinityPoint: "boolean",
     clearCofactor: "function",
     isTorsionFree: "function",
@@ -1513,18 +1462,18 @@ function No(t, e = {}) {
       throw new Error("compression is not supported: Field does not have .isOdd()");
   }
   function u(R, w, p) {
-    const { x: h, y } = w.toAffine(), m = r.toBytes(h);
+    const { x: h, y: g } = w.toAffine(), m = r.toBytes(h);
     if (ie(p, "isCompressed"), p) {
       d();
-      const A = !r.isOdd(y);
+      const A = !r.isOdd(g);
       return et(en(A), m);
     } else
-      return et(Uint8Array.of(4), m, r.toBytes(y));
+      return et(Uint8Array.of(4), m, r.toBytes(g));
   }
-  function g(R) {
+  function y(R) {
     k(R, void 0, "Point");
-    const { publicKey: w, publicKeyUncompressed: p } = f, h = R.length, y = R[0], m = R.subarray(1);
-    if (h === w && (y === 2 || y === 3)) {
+    const { publicKey: w, publicKeyUncompressed: p } = f, h = R.length, g = R[0], m = R.subarray(1);
+    if (h === w && (g === 2 || g === 3)) {
       const A = r.fromBytes(m);
       if (!r.isValid(A))
         throw new Error("bad point: is not on curve, wrong x");
@@ -1538,8 +1487,8 @@ function No(t, e = {}) {
       }
       d();
       const B = r.isOdd(E);
-      return (y & 1) === 1 !== B && (E = r.neg(E)), { x: A, y: E };
-    } else if (h === p && y === 4) {
+      return (g & 1) === 1 !== B && (E = r.neg(E)), { x: A, y: E };
+    } else if (h === p && g === 4) {
       const A = r.BYTES, x = r.fromBytes(m.subarray(0, A)), E = r.fromBytes(m.subarray(A, A * 2));
       if (!S(x, E))
         throw new Error("bad point: is not on curve");
@@ -1547,7 +1496,7 @@ function No(t, e = {}) {
     } else
       throw new Error(`bad point: got length ${h}, expected compressed=${w} or uncompressed=${p}`);
   }
-  const l = e.toBytes || u, b = e.fromBytes || g;
+  const l = e.toBytes || u, b = e.fromBytes || y;
   function v(R) {
     const w = r.sqr(R), p = r.mul(w, R);
     return r.add(r.add(p, r.mul(R, s.a)), s.b);
@@ -1558,7 +1507,7 @@ function No(t, e = {}) {
   }
   if (!S(s.Gx, s.Gy))
     throw new Error("bad curve params: generator point");
-  const O = r.mul(r.pow(s.a, Xt), To), V = r.mul(r.sqr(s.b), BigInt(27));
+  const O = r.mul(r.pow(s.a, Xt), Uo), V = r.mul(r.sqr(s.b), BigInt(27));
   if (r.is0(r.add(O, V)))
     throw new Error("bad curve params: a or b");
   function F(R, w, p = !1) {
@@ -1573,15 +1522,15 @@ function No(t, e = {}) {
   function C(R) {
     if (!a || !a.basises)
       throw new Error("no endo");
-    return Ho(R, a.basises, o.ORDER);
+    return Oo(R, a.basises, o.ORDER);
   }
   const z = cr((R, w) => {
-    const { X: p, Y: h, Z: y } = R;
-    if (r.eql(y, r.ONE))
+    const { X: p, Y: h, Z: g } = R;
+    if (r.eql(g, r.ONE))
       return { x: p, y: h };
     const m = R.is0();
-    w == null && (w = m ? r.ONE : r.inv(y));
-    const A = r.mul(p, w), x = r.mul(h, w), E = r.mul(y, w);
+    w == null && (w = m ? r.ONE : r.inv(g));
+    const A = r.mul(p, w), x = r.mul(h, w), E = r.mul(g, w);
     if (m)
       return { x: r.ZERO, y: r.ZERO };
     if (!r.eql(E, r.ONE))
@@ -1602,8 +1551,8 @@ function No(t, e = {}) {
       throw new Error("bad point: not in prime-order subgroup");
     return !0;
   });
-  function Tt(R, w, p, h, y) {
-    return p = new U(r.mul(p.X, R), p.Y, p.Z), w = ce(h, w), p = ce(y, p), w.add(p);
+  function Tt(R, w, p, h, g) {
+    return p = new U(r.mul(p.X, R), p.Y, p.Z), w = ce(h, w), p = ce(g, p), w.add(p);
   }
   class U {
     // base / generator point
@@ -1654,7 +1603,7 @@ function No(t, e = {}) {
      * @returns
      */
     precompute(w = 8, p = !0) {
-      return gt.createCache(this, w), p || this.multiply(Xt), this;
+      return yt.createCache(this, w), p || this.multiply(Xt), this;
     }
     // TODO: return `this`
     /** A point on curve is valid if it conforms to equation. */
@@ -1670,7 +1619,7 @@ function No(t, e = {}) {
     /** Compare one point to another. */
     equals(w) {
       M(w);
-      const { X: p, Y: h, Z: y } = this, { X: m, Y: A, Z: x } = w, E = r.eql(r.mul(p, x), r.mul(m, y)), B = r.eql(r.mul(h, x), r.mul(A, y));
+      const { X: p, Y: h, Z: g } = this, { X: m, Y: A, Z: x } = w, E = r.eql(r.mul(p, x), r.mul(m, g)), B = r.eql(r.mul(h, x), r.mul(A, g));
       return E && B;
     }
     /** Flips point to one corresponding to (x, -y) in Affine coordinates. */
@@ -1682,9 +1631,9 @@ function No(t, e = {}) {
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: w, b: p } = s, h = r.mul(p, Xt), { X: y, Y: m, Z: A } = this;
-      let x = r.ZERO, E = r.ZERO, B = r.ZERO, I = r.mul(y, y), L = r.mul(m, m), P = r.mul(A, A), $ = r.mul(y, m);
-      return $ = r.add($, $), B = r.mul(y, A), B = r.add(B, B), x = r.mul(w, B), E = r.mul(h, P), E = r.add(x, E), x = r.sub(L, E), E = r.add(L, E), E = r.mul(x, E), x = r.mul($, x), B = r.mul(h, B), P = r.mul(w, P), $ = r.sub(I, P), $ = r.mul(w, $), $ = r.add($, B), B = r.add(I, I), I = r.add(B, I), I = r.add(I, P), I = r.mul(I, $), E = r.add(E, I), P = r.mul(m, A), P = r.add(P, P), I = r.mul(P, $), x = r.sub(x, I), B = r.mul(P, L), B = r.add(B, B), B = r.add(B, B), new U(x, E, B);
+      const { a: w, b: p } = s, h = r.mul(p, Xt), { X: g, Y: m, Z: A } = this;
+      let x = r.ZERO, E = r.ZERO, B = r.ZERO, $ = r.mul(g, g), L = r.mul(m, m), P = r.mul(A, A), I = r.mul(g, m);
+      return I = r.add(I, I), B = r.mul(g, A), B = r.add(B, B), x = r.mul(w, B), E = r.mul(h, P), E = r.add(x, E), x = r.sub(L, E), E = r.add(L, E), E = r.mul(x, E), x = r.mul(I, x), B = r.mul(h, B), P = r.mul(w, P), I = r.sub($, P), I = r.mul(w, I), I = r.add(I, B), B = r.add($, $), $ = r.add(B, $), $ = r.add($, P), $ = r.mul($, I), E = r.add(E, $), P = r.mul(m, A), P = r.add(P, P), $ = r.mul(P, I), x = r.sub(x, $), B = r.mul(P, L), B = r.add(B, B), B = r.add(B, B), new U(x, E, B);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -1692,13 +1641,13 @@ function No(t, e = {}) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(w) {
       M(w);
-      const { X: p, Y: h, Z: y } = this, { X: m, Y: A, Z: x } = w;
-      let E = r.ZERO, B = r.ZERO, I = r.ZERO;
+      const { X: p, Y: h, Z: g } = this, { X: m, Y: A, Z: x } = w;
+      let E = r.ZERO, B = r.ZERO, $ = r.ZERO;
       const L = s.a, P = r.mul(s.b, Xt);
-      let $ = r.mul(p, m), _ = r.mul(h, A), D = r.mul(y, x), J = r.add(p, h), H = r.add(m, A);
-      J = r.mul(J, H), H = r.add($, _), J = r.sub(J, H), H = r.add(p, y);
+      let I = r.mul(p, m), _ = r.mul(h, A), D = r.mul(g, x), J = r.add(p, h), H = r.add(m, A);
+      J = r.mul(J, H), H = r.add(I, _), J = r.sub(J, H), H = r.add(p, g);
       let W = r.add(m, x);
-      return H = r.mul(H, W), W = r.add($, D), H = r.sub(H, W), W = r.add(h, y), E = r.add(A, x), W = r.mul(W, E), E = r.add(_, D), W = r.sub(W, E), I = r.mul(L, H), E = r.mul(P, D), I = r.add(E, I), E = r.sub(_, I), I = r.add(_, I), B = r.mul(E, I), _ = r.add($, $), _ = r.add(_, $), D = r.mul(L, D), H = r.mul(P, H), _ = r.add(_, D), D = r.sub($, D), D = r.mul(L, D), H = r.add(H, D), $ = r.mul(_, H), B = r.add(B, $), $ = r.mul(W, H), E = r.mul(J, E), E = r.sub(E, $), $ = r.mul(J, _), I = r.mul(W, I), I = r.add(I, $), new U(E, B, I);
+      return H = r.mul(H, W), W = r.add(I, D), H = r.sub(H, W), W = r.add(h, g), E = r.add(A, x), W = r.mul(W, E), E = r.add(_, D), W = r.sub(W, E), $ = r.mul(L, H), E = r.mul(P, D), $ = r.add(E, $), E = r.sub(_, $), $ = r.add(_, $), B = r.mul(E, $), _ = r.add(I, I), _ = r.add(_, I), D = r.mul(L, D), H = r.mul(P, H), _ = r.add(_, D), D = r.sub(I, D), D = r.mul(L, D), H = r.add(H, D), I = r.mul(_, H), B = r.add(B, I), I = r.mul(W, H), E = r.mul(J, E), E = r.sub(E, I), I = r.mul(J, _), $ = r.mul(W, $), $ = r.add($, I), new U(E, B, $);
     }
     subtract(w) {
       return this.add(w.negate());
@@ -1719,16 +1668,16 @@ function No(t, e = {}) {
       const { endo: p } = e;
       if (!o.isValidNot0(w))
         throw new Error("invalid scalar: out of range");
-      let h, y;
-      const m = (A) => gt.cached(this, A, (x) => ur(U, x));
+      let h, g;
+      const m = (A) => yt.cached(this, A, (x) => ur(U, x));
       if (p) {
-        const { k1neg: A, k1: x, k2neg: E, k2: B } = C(w), { p: I, f: L } = m(x), { p: P, f: $ } = m(B);
-        y = L.add($), h = Tt(p.beta, I, P, A, E);
+        const { k1neg: A, k1: x, k2neg: E, k2: B } = C(w), { p: $, f: L } = m(x), { p: P, f: I } = m(B);
+        g = L.add(I), h = Tt(p.beta, $, P, A, E);
       } else {
         const { p: A, f: x } = m(w);
-        h = A, y = x;
+        h = A, g = x;
       }
-      return ur(U, [h, y])[0];
+      return ur(U, [h, g])[0];
     }
     /**
      * Non-constant-time multiplication. Uses double-and-add algorithm.
@@ -1741,15 +1690,15 @@ function No(t, e = {}) {
         throw new Error("invalid scalar: out of range");
       if (w === it || h.is0())
         return U.ZERO;
-      if (w === It)
+      if (w === $t)
         return h;
-      if (gt.hasCache(this))
+      if (yt.hasCache(this))
         return this.multiply(w);
       if (p) {
-        const { k1neg: y, k1: m, k2neg: A, k2: x } = C(w), { p1: E, p2: B } = Po(U, h, m, x);
-        return Tt(p.beta, E, B, y, A);
+        const { k1neg: g, k1: m, k2neg: A, k2: x } = C(w), { p1: E, p2: B } = $o(U, h, m, x);
+        return Tt(p.beta, E, B, g, A);
       } else
-        return gt.unsafe(h, w);
+        return yt.unsafe(h, w);
     }
     /**
      * Converts Projective point to affine (x, y) coordinates.
@@ -1764,11 +1713,11 @@ function No(t, e = {}) {
      */
     isTorsionFree() {
       const { isTorsionFree: w } = e;
-      return i === It ? !0 : w ? w(U, this) : gt.unsafe(this, c).is0();
+      return i === $t ? !0 : w ? w(U, this) : yt.unsafe(this, c).is0();
     }
     clearCofactor() {
       const { clearCofactor: w } = e;
-      return i === It ? this : w ? w(U, this) : this.multiplyUnsafe(i);
+      return i === $t ? this : w ? w(U, this) : this.multiplyUnsafe(i);
     }
     isSmallOrder() {
       return this.multiplyUnsafe(i).is0();
@@ -1783,7 +1732,7 @@ function No(t, e = {}) {
       return `<Point ${this.is0() ? "ZERO" : this.toHex()}>`;
     }
   }
-  const Ft = o.BITS, gt = new ko(U, e.endo ? Math.ceil(Ft / 2) : Ft);
+  const Ft = o.BITS, yt = new vo(U, e.endo ? Math.ceil(Ft / 2) : Ft);
   return U.BASE.precompute(8), U;
 }
 function en(t) {
@@ -1798,7 +1747,7 @@ function rn(t, e) {
     signature: 2 * e.BYTES
   };
 }
-function Co(t, e = {}) {
+function Po(t, e = {}) {
   const { Fn: n } = t, r = e.randomBytes || pe, o = Object.assign(rn(t.Fp, n), { seed: Zr(n.ORDER) });
   function s(l) {
     try {
@@ -1825,7 +1774,7 @@ function Co(t, e = {}) {
   }
   function f(l) {
     const { secretKey: b, publicKey: v, publicKeyUncompressed: S } = o;
-    if (!Ke(l) || "_lengths" in n && n._lengths || b === v)
+    if (!Ve(l) || "_lengths" in n && n._lengths || b === v)
       return;
     const O = k(l, void 0, "key").length;
     return O === v || O === S;
@@ -1842,25 +1791,25 @@ function Co(t, e = {}) {
     isValidSecretKey: s,
     isValidPublicKey: i,
     randomSecretKey: c
-  }, g = Xr(c, a);
-  return Object.freeze({ getPublicKey: a, getSharedSecret: d, keygen: g, Point: t, utils: u, lengths: o });
+  }, y = Xr(c, a);
+  return Object.freeze({ getPublicKey: a, getSharedSecret: d, keygen: y, Point: t, utils: u, lengths: o });
 }
-function Do(t, e, n = {}) {
-  Ur(e), We(n, {}, {
+function _o(t, e, n = {}) {
+  Ur(e), qe(n, {}, {
     hmac: "function",
     lowS: "boolean",
     randomBytes: "function",
     bits2int: "function",
     bits2int_modN: "function"
   }), n = Object.assign({}, n);
-  const r = n.randomBytes || pe, o = n.hmac || ((p, h) => Jr(e, p, h)), { Fp: s, Fn: i } = t, { ORDER: c, BITS: a } = i, { keygen: f, getPublicKey: d, getSharedSecret: u, utils: g, lengths: l } = Co(t, n), b = {
+  const r = n.randomBytes || pe, o = n.hmac || ((p, h) => Jr(e, p, h)), { Fp: s, Fn: i } = t, { ORDER: c, BITS: a } = i, { keygen: f, getPublicKey: d, getSharedSecret: u, utils: y, lengths: l } = Po(t, n), b = {
     prehash: !0,
     lowS: typeof n.lowS == "boolean" ? n.lowS : !0,
     format: "compact",
     extraEntropy: !1
   }, v = c * tn < s.ORDER;
   function S(p) {
-    const h = c >> It;
+    const h = c >> $t;
     return p > h;
   }
   function O(p, h) {
@@ -1873,35 +1822,35 @@ function Do(t, e, n = {}) {
       throw new Error('"recovered" sig type is not supported for cofactor >2 curves');
   }
   function F(p, h) {
-    _e(h);
-    const y = l.signature, m = h === "compact" ? y : h === "recovered" ? y + 1 : void 0;
+    He(h);
+    const g = l.signature, m = h === "compact" ? g : h === "recovered" ? g + 1 : void 0;
     return k(p, m);
   }
   class M {
     r;
     s;
     recovery;
-    constructor(h, y, m) {
-      if (this.r = O("r", h), this.s = O("s", y), m != null) {
+    constructor(h, g, m) {
+      if (this.r = O("r", h), this.s = O("s", g), m != null) {
         if (V(), ![0, 1, 2, 3].includes(m))
           throw new Error("invalid recovery id");
         this.recovery = m;
       }
       Object.freeze(this);
     }
-    static fromBytes(h, y = b.format) {
-      F(h, y);
+    static fromBytes(h, g = b.format) {
+      F(h, g);
       let m;
-      if (y === "der") {
-        const { r: B, s: I } = pt.toSig(k(h));
-        return new M(B, I);
+      if (g === "der") {
+        const { r: B, s: $ } = pt.toSig(k(h));
+        return new M(B, $);
       }
-      y === "recovered" && (m = h[0], y = "compact", h = h.subarray(1));
+      g === "recovered" && (m = h[0], g = "compact", h = h.subarray(1));
       const A = l.signature / 2, x = h.subarray(0, A), E = h.subarray(A, A * 2);
       return new M(i.fromBytes(x), i.fromBytes(E), m);
     }
-    static fromHex(h, y) {
-      return this.fromBytes(se(h), y);
+    static fromHex(h, g) {
+      return this.fromBytes(se(h), g);
     }
     assertRecovery() {
       const { recovery: h } = this;
@@ -1913,10 +1862,10 @@ function Do(t, e, n = {}) {
       return new M(this.r, this.s, h);
     }
     recoverPublicKey(h) {
-      const { r: y, s: m } = this, A = this.assertRecovery(), x = A === 2 || A === 3 ? y + c : y;
+      const { r: g, s: m } = this, A = this.assertRecovery(), x = A === 2 || A === 3 ? g + c : g;
       if (!s.isValid(x))
         throw new Error("invalid recovery id: sig.r+curve.n != R.x");
-      const E = s.toBytes(x), B = t.fromBytes(et(en((A & 1) === 0), E)), I = i.inv(x), L = z(k(h, void 0, "msgHash")), P = i.create(-L * I), $ = i.create(m * I), _ = t.BASE.multiplyUnsafe(P).add(B.multiplyUnsafe($));
+      const E = s.toBytes(x), B = t.fromBytes(et(en((A & 1) === 0), E)), $ = i.inv(x), L = z(k(h, void 0, "msgHash")), P = i.create(-L * $), I = i.create(m * $), _ = t.BASE.multiplyUnsafe(P).add(B.multiplyUnsafe(I));
       if (_.is0())
         throw new Error("invalid recovery: point at infinify");
       return _.assertValidity(), _;
@@ -1926,9 +1875,9 @@ function Do(t, e, n = {}) {
       return S(this.s);
     }
     toBytes(h = b.format) {
-      if (_e(h), h === "der")
+      if (He(h), h === "der")
         return se(pt.hexFromSig(this));
-      const { r: y, s: m } = this, A = i.toBytes(y), x = i.toBytes(m);
+      const { r: g, s: m } = this, A = i.toBytes(g), x = i.toBytes(m);
       return h === "recovered" ? (V(), et(Uint8Array.of(this.assertRecovery()), A, x)) : et(A, x);
     }
     toHex(h) {
@@ -1938,30 +1887,30 @@ function Do(t, e, n = {}) {
   const C = n.bits2int || function(h) {
     if (h.length > 8192)
       throw new Error("input is too large");
-    const y = ut(h), m = h.length * 8 - a;
-    return m > 0 ? y >> BigInt(m) : y;
+    const g = ut(h), m = h.length * 8 - a;
+    return m > 0 ? g >> BigInt(m) : g;
   }, z = n.bits2int_modN || function(h) {
     return i.create(C(h));
-  }, Ae = Me(a);
+  }, Ae = We(a);
   function Tt(p) {
-    return bo("num < 2^" + a, p, it, Ae), i.toBytes(p);
+    return ho("num < 2^" + a, p, it, Ae), i.toBytes(p);
   }
   function U(p, h) {
     return k(p, void 0, "message"), h ? k(e(p), void 0, "prehashed message") : p;
   }
-  function Ft(p, h, y) {
-    const { lowS: m, prehash: A, extraEntropy: x } = $e(y, b);
+  function Ft(p, h, g) {
+    const { lowS: m, prehash: A, extraEntropy: x } = Oe(g, b);
     p = U(p, A);
     const E = z(p), B = i.fromBytes(h);
     if (!i.isValidNot0(B))
       throw new Error("invalid private key");
-    const I = [Tt(B), Tt(E)];
+    const $ = [Tt(B), Tt(E)];
     if (x != null && x !== !1) {
       const _ = x === !0 ? r(l.secretKey) : x;
-      I.push(k(_, void 0, "extraEntropy"));
+      $.push(k(_, void 0, "extraEntropy"));
     }
-    const L = et(...I), P = E;
-    function $(_) {
+    const L = et(...$), P = E;
+    function I(_) {
       const D = C(_);
       if (!i.isValidNot0(D))
         return;
@@ -1971,51 +1920,51 @@ function Do(t, e, n = {}) {
       const Zt = i.create(J * i.create(P + W * B));
       if (Zt === it)
         return;
-      let Je = (H.x === W ? 0 : 2) | Number(H.y & It), tr = Zt;
-      return m && S(Zt) && (tr = i.neg(Zt), Je ^= 1), new M(W, tr, v ? void 0 : Je);
+      let tr = (H.x === W ? 0 : 2) | Number(H.y & $t), er = Zt;
+      return m && S(Zt) && (er = i.neg(Zt), tr ^= 1), new M(W, er, v ? void 0 : tr);
     }
-    return { seed: L, k2sig: $ };
+    return { seed: L, k2sig: I };
   }
-  function gt(p, h, y = {}) {
-    const { seed: m, k2sig: A } = Ft(p, h, y);
-    return mo(e.outputLen, i.BYTES, o)(m, A).toBytes(y.format);
+  function yt(p, h, g = {}) {
+    const { seed: m, k2sig: A } = Ft(p, h, g);
+    return po(e.outputLen, i.BYTES, o)(m, A).toBytes(g.format);
   }
-  function R(p, h, y, m = {}) {
-    const { lowS: A, prehash: x, format: E } = $e(m, b);
-    if (y = k(y, void 0, "publicKey"), h = U(h, x), !Ke(p)) {
+  function R(p, h, g, m = {}) {
+    const { lowS: A, prehash: x, format: E } = Oe(m, b);
+    if (g = k(g, void 0, "publicKey"), h = U(h, x), !Ve(p)) {
       const B = p instanceof M ? ", use sig.toBytes()" : "";
       throw new Error("verify expects Uint8Array signature" + B);
     }
     F(p, E);
     try {
-      const B = M.fromBytes(p, E), I = t.fromBytes(y);
+      const B = M.fromBytes(p, E), $ = t.fromBytes(g);
       if (A && B.hasHighS())
         return !1;
-      const { r: L, s: P } = B, $ = z(h), _ = i.inv(P), D = i.create($ * _), J = i.create(L * _), H = t.BASE.multiplyUnsafe(D).add(I.multiplyUnsafe(J));
+      const { r: L, s: P } = B, I = z(h), _ = i.inv(P), D = i.create(I * _), J = i.create(L * _), H = t.BASE.multiplyUnsafe(D).add($.multiplyUnsafe(J));
       return H.is0() ? !1 : i.create(H.x) === L;
     } catch {
       return !1;
     }
   }
-  function w(p, h, y = {}) {
-    const { prehash: m } = $e(y, b);
+  function w(p, h, g = {}) {
+    const { prehash: m } = Oe(g, b);
     return h = U(h, m), M.fromBytes(p, "recovered").recoverPublicKey(h).toBytes();
   }
   return Object.freeze({
     keygen: f,
     getPublicKey: d,
     getSharedSecret: u,
-    utils: g,
+    utils: y,
     lengths: l,
     Point: t,
-    sign: gt,
+    sign: yt,
     verify: R,
     recoverPublicKey: w,
     Signature: M,
     hash: e
   });
 }
-const ye = {
+const ge = {
   p: BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),
   n: BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),
   h: BigInt(1),
@@ -2023,35 +1972,35 @@ const ye = {
   b: BigInt(7),
   Gx: BigInt("0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"),
   Gy: BigInt("0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8")
-}, Ko = {
+}, Ho = {
   beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
   basises: [
     [BigInt("0x3086d221a7d46bcde86c90e49284eb15"), -BigInt("0xe4437ed6010e88286f547fa90abfe4c3")],
     [BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), BigInt("0x3086d221a7d46bcde86c90e49284eb15")]
   ]
-}, Vo = /* @__PURE__ */ BigInt(0), He = /* @__PURE__ */ BigInt(2);
-function Mo(t) {
-  const e = ye.p, n = BigInt(3), r = BigInt(6), o = BigInt(11), s = BigInt(22), i = BigInt(23), c = BigInt(44), a = BigInt(88), f = t * t * t % e, d = f * f * t % e, u = G(d, n, e) * d % e, g = G(u, n, e) * d % e, l = G(g, He, e) * f % e, b = G(l, o, e) * l % e, v = G(b, s, e) * b % e, S = G(v, c, e) * v % e, O = G(S, a, e) * S % e, V = G(O, c, e) * v % e, F = G(V, n, e) * d % e, M = G(F, i, e) * b % e, C = G(M, r, e) * f % e, z = G(C, He, e);
+}, Lo = /* @__PURE__ */ BigInt(0), Le = /* @__PURE__ */ BigInt(2);
+function To(t) {
+  const e = ge.p, n = BigInt(3), r = BigInt(6), o = BigInt(11), s = BigInt(22), i = BigInt(23), c = BigInt(44), a = BigInt(88), f = t * t * t % e, d = f * f * t % e, u = G(d, n, e) * d % e, y = G(u, n, e) * d % e, l = G(y, Le, e) * f % e, b = G(l, o, e) * l % e, v = G(b, s, e) * b % e, S = G(v, c, e) * v % e, O = G(S, a, e) * S % e, V = G(O, c, e) * v % e, F = G(V, n, e) * d % e, M = G(F, i, e) * b % e, C = G(M, r, e) * f % e, z = G(C, Le, e);
   if (!ae.eql(ae.sqr(z), t))
     throw new Error("Cannot find square root");
   return z;
 }
-const ae = ge(ye.p, { sqrt: Mo }), Bt = /* @__PURE__ */ No(ye, {
+const ae = ye(ge.p, { sqrt: To }), Bt = /* @__PURE__ */ ko(ge, {
   Fp: ae,
-  endo: Ko
-}), vt = /* @__PURE__ */ Do(Bt, at), wr = {};
+  endo: Ho
+}), vt = /* @__PURE__ */ _o(Bt, at), wr = {};
 function fe(t, ...e) {
   let n = wr[t];
   if (n === void 0) {
-    const r = at(go(t));
+    const r = at(fo(t));
     n = et(r, r), wr[t] = n;
   }
   return at(et(n, ...e));
 }
-const je = (t) => t.toBytes(!0).slice(1), Fe = (t) => t % He === Vo;
-function Le(t) {
+const Fe = (t) => t.toBytes(!0).slice(1), Ze = (t) => t % Le === Lo;
+function Te(t) {
   const { Fn: e, BASE: n } = Bt, r = e.fromBytes(t), o = n.multiply(r);
-  return { scalar: Fe(o.y) ? r : e.neg(r), bytes: je(o) };
+  return { scalar: Ze(o.y) ? r : e.neg(r), bytes: Fe(o) };
 }
 function nn(t) {
   const e = ae;
@@ -2059,7 +2008,7 @@ function nn(t) {
     throw new Error("invalid x: Fail if x ≥ p");
   const n = e.create(t * t), r = e.create(n * t + BigInt(7));
   let o = e.sqrt(r);
-  Fe(o) || (o = e.neg(o));
+  Ze(o) || (o = e.neg(o));
   const s = Bt.fromAffine({ x: t, y: o });
   return s.assertValidity(), s;
 }
@@ -2067,12 +2016,12 @@ const Dt = ut;
 function on(...t) {
   return Bt.Fn.create(Dt(fe("BIP0340/challenge", ...t)));
 }
-function gr(t) {
-  return Le(t).bytes;
+function yr(t) {
+  return Te(t).bytes;
 }
-function Wo(t, e, n = pe(32)) {
-  const { Fn: r } = Bt, o = k(t, void 0, "message"), { bytes: s, scalar: i } = Le(e), c = k(n, 32, "auxRand"), a = r.toBytes(i ^ Dt(fe("BIP0340/aux", c))), f = fe("BIP0340/nonce", a, s, o), { bytes: d, scalar: u } = Le(f), g = on(d, s, o), l = new Uint8Array(64);
-  if (l.set(d, 0), l.set(r.toBytes(r.create(u + g * i)), 32), !sn(l, o, s))
+function No(t, e, n = pe(32)) {
+  const { Fn: r } = Bt, o = k(t, void 0, "message"), { bytes: s, scalar: i } = Te(e), c = k(n, 32, "auxRand"), a = r.toBytes(i ^ Dt(fe("BIP0340/aux", c))), f = fe("BIP0340/nonce", a, s, o), { bytes: d, scalar: u } = Te(f), y = on(d, s, o), l = new Uint8Array(64);
+  if (l.set(d, 0), l.set(r.toBytes(r.create(u + y * i)), 32), !sn(l, o, s))
     throw new Error("sign: Invalid signature produced");
   return l;
 }
@@ -2085,25 +2034,25 @@ function sn(t, e, n) {
     const u = Dt(i.subarray(32, 64));
     if (!o.isValidNot0(u))
       return !1;
-    const g = on(o.toBytes(d), je(f), c), l = s.multiplyUnsafe(u).add(f.multiplyUnsafe(o.neg(g))), { x: b, y: v } = l.toAffine();
-    return !(l.is0() || !Fe(v) || b !== d);
+    const y = on(o.toBytes(d), Fe(f), c), l = s.multiplyUnsafe(u).add(f.multiplyUnsafe(o.neg(y))), { x: b, y: v } = l.toAffine();
+    return !(l.is0() || !Ze(v) || b !== d);
   } catch {
     return !1;
   }
 }
 const St = /* @__PURE__ */ (() => {
-  const n = (r = pe(48)) => zr(r, ye.n);
+  const n = (r = pe(48)) => zr(r, ge.n);
   return {
-    keygen: Xr(n, gr),
-    getPublicKey: gr,
-    sign: Wo,
+    keygen: Xr(n, yr),
+    getPublicKey: yr,
+    sign: No,
     verify: sn,
     Point: Bt,
     utils: {
       randomSecretKey: n,
       taggedHash: fe,
       lift_x: nn,
-      pointToBytes: je
+      pointToBytes: Fe
     },
     lengths: {
       secretKey: 32,
@@ -2113,7 +2062,7 @@ const St = /* @__PURE__ */ (() => {
       seed: 48
     }
   };
-})(), qo = /* @__PURE__ */ Uint8Array.from([
+})(), Co = /* @__PURE__ */ Uint8Array.from([
   7,
   4,
   13,
@@ -2130,11 +2079,11 @@ const St = /* @__PURE__ */ (() => {
   14,
   11,
   8
-]), cn = Uint8Array.from(new Array(16).fill(0).map((t, e) => e)), jo = cn.map((t) => (9 * t + 5) % 16), an = /* @__PURE__ */ (() => {
-  const n = [[cn], [jo]];
+]), cn = Uint8Array.from(new Array(16).fill(0).map((t, e) => e)), Do = cn.map((t) => (9 * t + 5) % 16), an = /* @__PURE__ */ (() => {
+  const n = [[cn], [Do]];
   for (let r = 0; r < 4; r++)
     for (let o of n)
-      o.push(o[r].map((s) => qo[s]));
+      o.push(o[r].map((s) => Co[s]));
   return n;
 })(), fn = an[0], un = an[1], dn = /* @__PURE__ */ [
   [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],
@@ -2142,24 +2091,24 @@ const St = /* @__PURE__ */ (() => {
   [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((t) => Uint8Array.from(t)), Fo = /* @__PURE__ */ fn.map((t, e) => t.map((n) => dn[e][n])), Zo = /* @__PURE__ */ un.map((t, e) => t.map((n) => dn[e][n])), zo = /* @__PURE__ */ Uint32Array.from([
+].map((t) => Uint8Array.from(t)), Ko = /* @__PURE__ */ fn.map((t, e) => t.map((n) => dn[e][n])), Vo = /* @__PURE__ */ un.map((t, e) => t.map((n) => dn[e][n])), Mo = /* @__PURE__ */ Uint32Array.from([
   0,
   1518500249,
   1859775393,
   2400959708,
   2840853838
-]), Go = /* @__PURE__ */ Uint32Array.from([
+]), Wo = /* @__PURE__ */ Uint32Array.from([
   1352829926,
   1548603684,
   1836072691,
   2053994217,
   0
 ]);
-function yr(t, e, n, r) {
+function gr(t, e, n, r) {
   return t === 0 ? e ^ n ^ r : t === 1 ? e & n | ~e & r : t === 2 ? (e | ~n) ^ r : t === 3 ? e & r | n & ~r : e ^ (n | ~r);
 }
 const Qt = /* @__PURE__ */ new Uint32Array(16);
-class Yo extends _r {
+class qo extends _r {
   h0 = 1732584193;
   h1 = -271733879;
   h2 = -1732584194;
@@ -2178,19 +2127,19 @@ class Yo extends _r {
   process(e, n) {
     for (let l = 0; l < 16; l++, n += 4)
       Qt[l] = e.getUint32(n, !0);
-    let r = this.h0 | 0, o = r, s = this.h1 | 0, i = s, c = this.h2 | 0, a = c, f = this.h3 | 0, d = f, u = this.h4 | 0, g = u;
+    let r = this.h0 | 0, o = r, s = this.h1 | 0, i = s, c = this.h2 | 0, a = c, f = this.h3 | 0, d = f, u = this.h4 | 0, y = u;
     for (let l = 0; l < 5; l++) {
-      const b = 4 - l, v = zo[l], S = Go[l], O = fn[l], V = un[l], F = Fo[l], M = Zo[l];
+      const b = 4 - l, v = Mo[l], S = Wo[l], O = fn[l], V = un[l], F = Ko[l], M = Vo[l];
       for (let C = 0; C < 16; C++) {
-        const z = Gt(r + yr(l, s, c, f) + Qt[O[C]] + v, F[C]) + u | 0;
+        const z = Gt(r + gr(l, s, c, f) + Qt[O[C]] + v, F[C]) + u | 0;
         r = u, u = f, f = Gt(c, 10) | 0, c = s, s = z;
       }
       for (let C = 0; C < 16; C++) {
-        const z = Gt(o + yr(b, i, a, d) + Qt[V[C]] + S, M[C]) + g | 0;
-        o = g, g = d, d = Gt(a, 10) | 0, a = i, i = z;
+        const z = Gt(o + gr(b, i, a, d) + Qt[V[C]] + S, M[C]) + y | 0;
+        o = y, y = d, d = Gt(a, 10) | 0, a = i, i = z;
       }
     }
-    this.set(this.h1 + c + d | 0, this.h2 + f + g | 0, this.h3 + u + o | 0, this.h4 + r + i | 0, this.h0 + s + a | 0);
+    this.set(this.h1 + c + d | 0, this.h2 + f + y | 0, this.h3 + u + o | 0, this.h4 + r + i | 0, this.h0 + s + a | 0);
   }
   roundClean() {
     Ot(Qt);
@@ -2199,7 +2148,7 @@ class Yo extends _r {
     this.destroyed = !0, Ot(this.buffer), this.set(0, 0, 0, 0, 0);
   }
 }
-const Xo = /* @__PURE__ */ Pr(() => new Yo()), Qo = /* @__PURE__ */ Uint8Array.of(), si = /* @__PURE__ */ Uint8Array.of(0);
+const jo = /* @__PURE__ */ Pr(() => new qo()), Fo = /* @__PURE__ */ Uint8Array.of(), si = /* @__PURE__ */ Uint8Array.of(0);
 function Ut(t, e) {
   if (t.length !== e.length)
     return !1;
@@ -2211,7 +2160,7 @@ function Ut(t, e) {
 function Y(t) {
   return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
 }
-function Jo(...t) {
+function Zo(...t) {
   let e = 0;
   for (let r = 0; r < t.length; r++) {
     const o = t[r];
@@ -2233,10 +2182,10 @@ function Wt(t) {
 function ot(t) {
   return Number.isSafeInteger(t);
 }
-const Ze = {
+const ze = {
   equalBytes: Ut,
   isBytes: Y,
-  concatBytes: Jo
+  concatBytes: Zo
 }, ln = (t) => {
   if (t !== null && typeof t != "string" && !Q(t) && !Y(t) && !ot(t))
     throw new Error(`lengthCoder: expected null | number | Uint8Array | CoderType, got ${t} (${typeof t})`);
@@ -2309,8 +2258,8 @@ const Ze = {
     if (c !== void 0 && !T.set(t, c, s >>> n % i, o))
       return !1;
     const d = c !== void 0 ? c + 1 : n / i, u = f !== void 0 ? f : a / i;
-    for (let g = d; g < u; g++)
-      if (!T.set(t, g, s, o))
+    for (let y = d; y < u; y++)
+      if (!T.set(t, y, s, o))
         return !1;
     return !(f !== void 0 && c !== f && !T.set(t, f, s << i - a % i, o));
   }
@@ -2353,7 +2302,7 @@ const Ze = {
     return s;
   }
 };
-class ze {
+class Ge {
   pos = 0;
   data;
   opts;
@@ -2425,7 +2374,7 @@ class ze {
   offsetReader(e) {
     if (e > this.data.length)
       throw this.err("offsetReader: Unexpected end of buffer");
-    return new ze(this.absBytes(e), this.opts, this.stack, this, e);
+    return new Ge(this.absBytes(e), this.opts, this.stack, this, e);
   }
   bytes(e, n = !1) {
     if (this.bitPos)
@@ -2481,7 +2430,7 @@ class ze {
     }
   }
 }
-class ts {
+class zo {
   pos = 0;
   stack;
   // We could have a single buffer here and re-alloc it with
@@ -2560,8 +2509,8 @@ class ts {
     }
   }
 }
-const Te = (t) => Uint8Array.from(t).reverse();
-function es(t, e, n) {
+const Ne = (t) => Uint8Array.from(t).reverse();
+function Go(t, e, n) {
   if (n) {
     const r = 2n ** (e - 1n);
     if (t < -r || t >= r)
@@ -2576,11 +2525,11 @@ function pn(t) {
     decodeStream: t.decodeStream,
     size: t.size,
     encode: (e) => {
-      const n = new ts();
+      const n = new zo();
       return t.encodeStream(n, e), n.finish();
     },
     decode: (e, n = {}) => {
-      const r = new ze(e, n), o = t.decodeStream(r);
+      const r = new Ge(e, n), o = t.decodeStream(r);
       return r.finish(), o;
     }
   };
@@ -2618,7 +2567,7 @@ const Z = (t) => {
 function Q(t) {
   return Wt(t) && Ee(t) && typeof t.encodeStream == "function" && typeof t.decodeStream == "function" && (t.size === void 0 || ot(t.size));
 }
-function rs() {
+function Yo() {
   return {
     encode: (t) => {
       if (!Array.isArray(t))
@@ -2641,7 +2590,7 @@ function rs() {
     }
   };
 }
-const ns = {
+const Xo = {
   encode: (t) => {
     if (typeof t != "bigint")
       throw new Error(`expected bigint, got ${typeof t}`);
@@ -2655,7 +2604,7 @@ const ns = {
     return BigInt(t);
   }
 };
-function os(t) {
+function Qo(t) {
   if (!Wt(t))
     throw new Error("plain object expected");
   return {
@@ -2671,7 +2620,7 @@ function os(t) {
     }
   };
 }
-function ss(t, e = !1) {
+function Jo(t, e = !1) {
   if (!ot(t))
     throw new Error(`decimal/precision: wrong value ${t}`);
   if (typeof e != "boolean")
@@ -2707,7 +2656,7 @@ function ss(t, e = !1) {
     }
   };
 }
-function is(t) {
+function ts(t) {
   if (!Array.isArray(t))
     throw new Error(`expected array, got ${typeof t}`);
   for (const e of t)
@@ -2736,7 +2685,7 @@ const wn = (t) => {
   if (!Ee(t))
     throw new Error("BaseCoder expected");
   return { encode: t.decode, decode: t.encode };
-}, gn = { dict: rs, numberBigint: ns, tsEnum: os, decimal: ss, match: is, reverse: wn }, Ge = (t, e = !1, n = !1, r = !0) => {
+}, yn = { dict: Yo, numberBigint: Xo, tsEnum: Qo, decimal: Jo, match: ts, reverse: wn }, Ye = (t, e = !1, n = !1, r = !0) => {
   if (!ot(t))
     throw new Error(`bigint/size: wrong value ${t}`);
   if (typeof e != "boolean")
@@ -2763,7 +2712,7 @@ const wn = (t) => {
       i.bytes(e ? f.reverse() : f);
     },
     decodeStream: (i) => {
-      const c = i.bytes(r ? t : Math.min(t, i.leftBytes)), a = e ? c : Te(c);
+      const c = i.bytes(r ? t : Math.min(t, i.leftBytes)), a = e ? c : Ne(c);
       let f = 0n;
       for (let d = 0; d < a.length; d++)
         f |= BigInt(a[d]) << 8n * BigInt(d);
@@ -2772,10 +2721,10 @@ const wn = (t) => {
     validate: (i) => {
       if (typeof i != "bigint")
         throw new Error(`bigint: invalid value: ${i}`);
-      return es(i, 8n * o, !!n), i;
+      return Go(i, 8n * o, !!n), i;
     }
   });
-}, ii = /* @__PURE__ */ Ge(32, !1), cs = /* @__PURE__ */ Ge(8, !0), ci = /* @__PURE__ */ Ge(8, !0, !0), as = (t, e) => Z({
+}, ii = /* @__PURE__ */ Ye(32, !1), es = /* @__PURE__ */ Ye(8, !0), ci = /* @__PURE__ */ Ye(8, !0, !0), rs = (t, e) => Z({
   size: t,
   encodeStream: (n, r) => n.writeView(t, (o) => e.write(o, r)),
   decodeStream: (n) => n.readView(t, e.read),
@@ -2796,7 +2745,7 @@ const wn = (t) => {
     if (0 > a || a >= i)
       throw new Error(`uintView: value out of bounds. Expected 0 <= ${a} < ${i}`);
   };
-  return as(t, {
+  return rs(t, {
     write: n.write,
     read: n.read,
     validate: e ? s : c
@@ -2807,13 +2756,13 @@ const wn = (t) => {
 }), ai = /* @__PURE__ */ qt(4, !1, {
   read: (t, e) => t.getUint32(e, !1),
   write: (t, e) => t.setUint32(0, e, !1)
-}), yn = /* @__PURE__ */ qt(4, !0, {
+}), gn = /* @__PURE__ */ qt(4, !0, {
   read: (t, e) => t.getInt32(e, !0),
   write: (t, e) => t.setInt32(0, e, !0)
 }), br = /* @__PURE__ */ qt(2, !1, {
   read: (t, e) => t.getUint16(e, !0),
   write: (t, e) => t.setUint16(0, e, !0)
-}), fs = /* @__PURE__ */ qt(1, !1, {
+}), ns = /* @__PURE__ */ qt(1, !1, {
   read: (t, e) => t.getUint8(e),
   write: (t, e) => t.setUint8(0, e)
 }), jt = (t, e = !1) => {
@@ -2823,7 +2772,7 @@ const wn = (t) => {
   return Z({
     size: typeof t == "number" ? t : void 0,
     encodeStream: (o, s) => {
-      r || n.encodeStream(o, s.length), o.bytes(e ? Te(s) : s), r && o.bytes(t);
+      r || n.encodeStream(o, s.length), o.bytes(e ? Ne(s) : s), r && o.bytes(t);
     },
     decodeStream: (o) => {
       let s;
@@ -2834,7 +2783,7 @@ const wn = (t) => {
         s = o.bytes(i - o.pos), o.bytes(t.length);
       } else
         s = o.bytes(t === null ? o.leftBytes : n.decodeStream(o));
-      return e ? Te(s) : s;
+      return e ? Ne(s) : s;
     },
     validate: (o) => {
       if (!Y(o))
@@ -2848,7 +2797,7 @@ function fi(t, e) {
     throw new Error(`prefix: invalid inner value ${e}`);
   return kt(jt(t), wn(e));
 }
-const ui = (t, e = !1) => be(kt(jt(t, e), no), (n) => {
+const ui = (t, e = !1) => be(kt(jt(t, e), Xn), (n) => {
   if (typeof n != "string")
     throw new Error(`expected string, got ${typeof n}`);
   return n;
@@ -2892,7 +2841,7 @@ function kt(t, e) {
     }
   });
 }
-const us = (t, e = !1) => {
+const os = (t, e = !1) => {
   if (!Y(t))
     throw new Error(`flag/flagValue: expected Uint8Array, got ${typeof t}`);
   if (typeof e != "boolean")
@@ -2913,7 +2862,7 @@ const us = (t, e = !1) => {
     }
   });
 };
-function ds(t, e, n) {
+function ss(t, e, n) {
   if (!Q(e))
     throw new Error(`flagged: invalid inner value ${e}`);
   return Z({
@@ -3018,7 +2967,7 @@ function li(t) {
     }
   });
 }
-function Ye(t, e) {
+function Xe(t, e) {
   if (!Q(e))
     throw new Error(`array: invalid inner value ${e}`);
   const n = ln(typeof t == "string" ? `../${t}` : t);
@@ -3070,8 +3019,8 @@ function Ye(t, e) {
     }
   });
 }
-const Ht = vt.Point, Er = Ht.Fn, En = Ht.Fn.ORDER, mn = (t) => t % 2n === 0n, N = Ze.isBytes, xn = Ze.concatBytes, An = Ze.equalBytes, Xe = (t) => Xo(at(t)), pi = (...t) => at(at(xn(...t))), wi = St.getPublicKey, gi = vt.getPublicKey, mr = (t) => t.r < En / 2n;
-function yi(t, e, n = !1) {
+const Ht = vt.Point, Er = Ht.Fn, En = Ht.Fn.ORDER, mn = (t) => t % 2n === 0n, N = ze.isBytes, xn = ze.concatBytes, An = ze.equalBytes, Qe = (t) => jo(at(t)), pi = (...t) => at(at(xn(...t))), wi = St.getPublicKey, yi = vt.getPublicKey, mr = (t) => t.r < En / 2n;
+function gi(t, e, n = !1) {
   let r = vt.Signature.fromBytes(vt.sign(t, e, { prehash: !1 }));
   if (n && !mr(r)) {
     const o = new Uint8Array(32);
@@ -3082,11 +3031,11 @@ function yi(t, e, n = !1) {
   }
   return r.toBytes("der");
 }
-const bi = St.sign, hs = St.utils.taggedHash, ct = {
+const bi = St.sign, is = St.utils.taggedHash, ct = {
   ecdsa: 0,
   schnorr: 1
 };
-function ls(t, e) {
+function cs(t, e) {
   const n = t.length;
   if (e === ct.ecdsa) {
     if (n === 32)
@@ -3109,16 +3058,16 @@ function Ei(t, e = Uint8Array.of()) {
   const n = St.utils, r = ut(t), o = Ht.BASE.multiply(r), s = mn(o.y) ? r : Er.neg(r), i = n.pointToBytes(o), c = Bn(i, e);
   return we(Er.add(s, c), 32);
 }
-function ps(t, e) {
+function as(t, e) {
   const n = St.utils, r = Bn(t, e), s = n.lift_x(ut(t)).add(Ht.BASE.multiply(r)), i = mn(s.y) ? 0 : 1;
   return [n.pointToBytes(s), i];
 }
-const ws = at(Ht.BASE.toBytes(!1)), At = {
+const fs = at(Ht.BASE.toBytes(!1)), At = {
   bech32: "bc",
   pubKeyHash: 0,
   scriptHash: 5,
   wif: 128
-}, gs = {
+}, us = {
   bech32: "tb",
   pubKeyHash: 111,
   scriptHash: 196,
@@ -3133,7 +3082,7 @@ function mi(t, e) {
       return Math.sign(t[r] - e[r]);
   return Math.sign(t.length - e.length);
 }
-function ys(t) {
+function ds(t) {
   const e = {};
   for (const n in t) {
     if (e[t[n]] !== void 0)
@@ -3265,7 +3214,7 @@ const K = {
   CHECKSIGADD: 186,
   // Invalid
   INVALID: 255
-}, bs = ys(K);
+}, hs = ds(K);
 function Sn(t = 6, e = !1) {
   return Z({
     encodeStream: (n, r) => {
@@ -3294,7 +3243,7 @@ function Sn(t = 6, e = !1) {
     }
   });
 }
-function Es(t, e = 4, n = !0) {
+function ls(t, e = 4, n = !0) {
   if (typeof t == "number")
     return t;
   if (N(t))
@@ -3337,7 +3286,7 @@ const Kt = Z({
         if (n < K.PUSHDATA1)
           r = n;
         else if (n === K.PUSHDATA1)
-          r = fs.decodeStream(t);
+          r = ns.decodeStream(t);
         else if (n === K.PUSHDATA2)
           r = br.decodeStream(t);
         else if (n === K.PUSHDATA4)
@@ -3350,7 +3299,7 @@ const Kt = Z({
       else if (K.OP_1 <= n && n <= K.OP_16)
         e.push(n - (K.OP_1 - 1));
       else {
-        const r = bs[n];
+        const r = hs[n];
         if (r === void 0)
           throw new Error(`Unknown opcode=${n.toString(16)}`);
         e.push(r);
@@ -3362,7 +3311,7 @@ const Kt = Z({
   253: [253, 2, 253n, 65535n],
   254: [254, 4, 65536n, 4294967295n],
   255: [255, 8, 4294967296n, 18446744073709551615n]
-}, Qe = Z({
+}, Je = Z({
   encodeStream: (t, e) => {
     if (typeof e == "number" && (e = BigInt(e)), 0n <= e && e <= 252n)
       return t.byte(Number(e));
@@ -3387,7 +3336,7 @@ const Kt = Z({
       throw t.err(`Wrong CompactSize(${8 * r})`);
     return s;
   }
-}), ms = kt(Qe, gn.numberBigint), xe = jt(Qe), xs = Ye(ms, xe), ue = (t) => Ye(Qe, t), vn = me({
+}), ps = kt(Je, yn.numberBigint), xe = jt(Je), ws = Xe(ps, xe), ue = (t) => Xe(Je, t), vn = me({
   txid: jt(32, !0),
   // hash(prev_tx),
   index: xt,
@@ -3396,28 +3345,28 @@ const Kt = Z({
   // btc merges input and output script, executes it. If ok = tx passes
   sequence: xt
   // ?
-}), In = me({ amount: cs, script: xe }), As = me({
-  version: yn,
-  segwitFlag: us(new Uint8Array([0, 1])),
+}), $n = me({ amount: es, script: xe }), ys = me({
+  version: gn,
+  segwitFlag: os(new Uint8Array([0, 1])),
   inputs: ue(vn),
-  outputs: ue(In),
-  witnesses: ds("segwitFlag", Ye("inputs/length", xs)),
+  outputs: ue($n),
+  witnesses: ss("segwitFlag", Xe("inputs/length", ws)),
   // < 500000000	Block number at which this transaction is unlocked
   // >= 500000000	UNIX timestamp at which this transaction is unlocked
   // Handled as part of PSBTv2
   lockTime: xt
 });
-function Bs(t) {
+function gs(t) {
   if (t.segwitFlag && t.witnesses && !t.witnesses.length)
     throw new Error("Segwit flag with empty witnesses array");
   return t;
 }
-const xi = be(As, Bs), Ai = me({
-  version: yn,
+const xi = be(ys, gs), Ai = me({
+  version: gn,
   inputs: ue(vn),
-  outputs: ue(In),
+  outputs: ue($n),
   lockTime: xt
-}), Ss = {
+}), bs = {
   encode(t) {
     if (!(t.length !== 2 || t[0] !== 1 || !N(t[1]) || rt.encode(t[1]) !== "4e73"))
       return { type: "p2a", script: Kt.encode(t) };
@@ -3429,42 +3378,42 @@ const xi = be(As, Bs), Ai = me({
 };
 function Et(t, e) {
   try {
-    return ls(t, e), !0;
+    return cs(t, e), !0;
   } catch {
     return !1;
   }
 }
-const vs = {
+const Es = {
   encode(t) {
     if (!(t.length !== 2 || !N(t[0]) || !Et(t[0], ct.ecdsa) || t[1] !== "CHECKSIG"))
       return { type: "pk", pubkey: t[0] };
   },
   decode: (t) => t.type === "pk" ? [t.pubkey, "CHECKSIG"] : void 0
-}, Is = {
+}, ms = {
   encode(t) {
     if (!(t.length !== 5 || t[0] !== "DUP" || t[1] !== "HASH160" || !N(t[2])) && !(t[3] !== "EQUALVERIFY" || t[4] !== "CHECKSIG"))
       return { type: "pkh", hash: t[2] };
   },
   decode: (t) => t.type === "pkh" ? ["DUP", "HASH160", t.hash, "EQUALVERIFY", "CHECKSIG"] : void 0
-}, $s = {
+}, xs = {
   encode(t) {
     if (!(t.length !== 3 || t[0] !== "HASH160" || !N(t[1]) || t[2] !== "EQUAL"))
       return { type: "sh", hash: t[1] };
   },
   decode: (t) => t.type === "sh" ? ["HASH160", t.hash, "EQUAL"] : void 0
-}, Os = {
+}, As = {
   encode(t) {
     if (!(t.length !== 2 || t[0] !== 0 || !N(t[1])) && t[1].length === 32)
       return { type: "wsh", hash: t[1] };
   },
   decode: (t) => t.type === "wsh" ? [0, t.hash] : void 0
-}, Rs = {
+}, Bs = {
   encode(t) {
     if (!(t.length !== 2 || t[0] !== 0 || !N(t[1])) && t[1].length === 20)
       return { type: "wpkh", hash: t[1] };
   },
   decode: (t) => t.type === "wpkh" ? [0, t.hash] : void 0
-}, Us = {
+}, Ss = {
   encode(t) {
     const e = t.length - 1;
     if (t[e] !== "CHECKMULTISIG")
@@ -3482,13 +3431,13 @@ const vs = {
   },
   // checkmultisig(n, ..pubkeys, m)
   decode: (t) => t.type === "ms" ? [t.m, ...t.pubkeys, t.pubkeys.length, "CHECKMULTISIG"] : void 0
-}, ks = {
+}, vs = {
   encode(t) {
     if (!(t.length !== 2 || t[0] !== 1 || !N(t[1])))
       return { type: "tr", pubkey: t[1] };
   },
   decode: (t) => t.type === "tr" ? [1, t.pubkey] : void 0
-}, Ps = {
+}, $s = {
   encode(t) {
     const e = t.length - 1;
     if (t[e] !== "CHECKSIG")
@@ -3515,12 +3464,12 @@ const vs = {
       e.push(t.pubkeys[n], "CHECKSIGVERIFY");
     return e.push(t.pubkeys[t.pubkeys.length - 1], "CHECKSIG"), e;
   }
-}, _s = {
+}, Is = {
   encode(t) {
     const e = t.length - 1;
     if (t[e] !== "NUMEQUAL" || t[1] !== "CHECKSIG")
       return;
-    const n = [], r = Es(t[e - 1]);
+    const n = [], r = ls(t[e - 1]);
     if (typeof r == "number") {
       for (let o = 0; o < e - 1; o++) {
         const s = t[o];
@@ -3544,24 +3493,24 @@ const vs = {
       e.push(t.pubkeys[n], "CHECKSIGADD");
     return e.push(t.m, "NUMEQUAL"), e;
   }
-}, Hs = {
+}, Os = {
   encode(t) {
     return { type: "unknown", script: Kt.encode(t) };
   },
   decode: (t) => t.type === "unknown" ? Kt.decode(t.script) : void 0
-}, Ls = [
+}, Rs = [
+  bs,
+  Es,
+  ms,
+  xs,
+  As,
+  Bs,
   Ss,
   vs,
-  Is,
   $s,
-  Os,
-  Rs,
-  Us,
-  ks,
-  Ps,
-  _s,
-  Hs
-], Ts = kt(Kt, gn.match(Ls)), nt = be(Ts, (t) => {
+  Is,
+  Os
+], Us = kt(Kt, yn.match(Rs)), nt = be(Us, (t) => {
   if (t.type === "pk" && !Et(t.pubkey, ct.ecdsa))
     throw new Error("OutScript/pk: wrong key");
   if ((t.type === "pkh" || t.type === "sh" || t.type === "wpkh") && (!N(t.hash) || t.hash.length !== 20))
@@ -3601,13 +3550,13 @@ function Ar(t, e) {
   if (n.type === "wpkh" || n.type === "sh")
     throw new Error(`checkScript: P2${n.type} cannot be wrapped in P2WSH`);
 }
-function Ns(t, e, n) {
+function ks(t, e, n) {
   if (t) {
     const r = nt.decode(t);
     if (r.type === "tr_ns" || r.type === "tr_ms" || r.type === "ms" || r.type == "pk")
       throw new Error(`checkScript: non-wrapped ${r.type}`);
     if (r.type === "sh" && e) {
-      if (!An(r.hash, Xe(e)))
+      if (!An(r.hash, Qe(e)))
         throw new Error("checkScript: sh wrong redeemScript hash");
       const o = nt.decode(e);
       if (o.type === "tr" || o.type === "tr_ns" || o.type === "tr_ms")
@@ -3622,12 +3571,12 @@ function Ns(t, e, n) {
     r.type === "wsh" && n && Ar(r, n);
   }
 }
-const Cs = (t, e = At) => {
+const Ps = (t, e = At) => {
   const n = t.script;
   if (!N(n))
     throw new Error(`Wrong script: ${typeof t.script}, expected Uint8Array`);
-  const r = Xe(n), o = nt.encode({ type: "sh", hash: r });
-  return Ns(o, n, t.witnessScript), t.witnessScript ? {
+  const r = Qe(n), o = nt.encode({ type: "sh", hash: r });
+  return ks(o, n, t.witnessScript), t.witnessScript ? {
     type: "sh",
     redeemScript: n,
     script: nt.encode({ type: "sh", hash: r }),
@@ -3641,27 +3590,27 @@ const Cs = (t, e = At) => {
     address: Vt(e).encode({ type: "sh", hash: r }),
     hash: r
   };
-}, Ds = (t, e = At) => {
+}, _s = (t, e = At) => {
   if (!Et(t, ct.ecdsa))
     throw new Error("P2WPKH: invalid publicKey");
   if (t.length === 65)
     throw new Error("P2WPKH: uncompressed public key");
-  const n = Xe(t);
+  const n = Qe(t);
   return {
     type: "wpkh",
     script: nt.encode({ type: "wpkh", hash: n }),
     address: Vt(e).encode({ type: "wpkh", hash: n }),
     hash: n
   };
-}, Ks = 192, Bi = (t, e = Ks) => hs("TapLeaf", new Uint8Array([e]), xe.encode(t));
-function Vs(t, e, n = At, r = !1, o) {
+}, Hs = 192, Bi = (t, e = Hs) => is("TapLeaf", new Uint8Array([e]), xe.encode(t));
+function Ls(t, e, n = At, r = !1, o) {
   if (!t)
     throw new Error("p2tr: should have pubKey or scriptTree (or both)");
-  const s = typeof t == "string" ? rt.decode(t) : t || ws;
+  const s = typeof t == "string" ? rt.decode(t) : t || fs;
   if (!Et(s, ct.schnorr))
     throw new Error("p2tr: non-schnorr pubkey");
   {
-    const i = ps(s, Qo)[0];
+    const i = as(s, Fo)[0];
     return {
       type: "tr",
       script: nt.encode({ type: "tr", pubkey: i }),
@@ -3673,7 +3622,7 @@ function Vs(t, e, n = At, r = !1, o) {
     };
   }
 }
-const $n = ro(at);
+const In = Yn(at);
 function On(t, e) {
   if (e.length < 2 || e.length > 40)
     throw new Error("Witness: invalid length");
@@ -3682,24 +3631,24 @@ function On(t, e) {
   if (t === 0 && !(e.length === 20 || e.length === 32))
     throw new Error("Witness: invalid length for version");
 }
-function Oe(t, e, n = At) {
+function Re(t, e, n = At) {
   On(t, e);
-  const r = t === 0 ? ke : Rr;
+  const r = t === 0 ? Pe : Rr;
   return r.encode(n.bech32, [t].concat(r.toWords(e)));
 }
 function Br(t, e) {
-  return $n.encode(xn(Uint8Array.from(e), t));
+  return In.encode(xn(Uint8Array.from(e), t));
 }
 function Vt(t = At) {
   return {
     encode(e) {
       const { type: n } = e;
       if (n === "wpkh")
-        return Oe(0, e.hash, t);
+        return Re(0, e.hash, t);
       if (n === "wsh")
-        return Oe(0, e.hash, t);
+        return Re(0, e.hash, t);
       if (n === "tr")
-        return Oe(1, e.pubkey, t);
+        return Re(1, e.pubkey, t);
       if (n === "pkh")
         return Br(e.hash, [t.pubKeyHash]);
       if (n === "sh")
@@ -3712,7 +3661,7 @@ function Vt(t = At) {
       if (t.bech32 && e.toLowerCase().startsWith(`${t.bech32}1`)) {
         let r;
         try {
-          if (r = ke.decode(e), r.words[0] !== 0)
+          if (r = Pe.decode(e), r.words[0] !== 0)
             throw new Error(`bech32: wrong version=${r.words[0]}`);
         } catch {
           if (r = Rr.decode(e), r.words[0] === 0)
@@ -3720,7 +3669,7 @@ function Vt(t = At) {
         }
         if (r.prefix !== t.bech32)
           throw new Error(`wrong bech32 prefix=${r.prefix}`);
-        const [o, ...s] = r.words, i = ke.fromWords(s);
+        const [o, ...s] = r.words, i = Pe.fromWords(s);
         if (On(o, i), o === 0 && i.length === 32)
           return { type: "wsh", hash: i };
         if (o === 0 && i.length === 20)
@@ -3729,7 +3678,7 @@ function Vt(t = At) {
           return { type: "tr", pubkey: i };
         throw new Error("Unknown witness program");
       }
-      const n = $n.decode(e);
+      const n = In.decode(e);
       if (n.length !== 21)
         throw new Error("Invalid base58 address");
       if (n[0] === t.pubKeyHash)
@@ -3743,19 +3692,19 @@ function Vt(t = At) {
     }
   };
 }
-function Si(t) {
-  return t === "mainnet" ? At : t === "testnet" ? gs : At;
+function Sr(t) {
+  return t === "mainnet" ? At : t === "testnet" ? us : At;
 }
 function Lt(t) {
   return t.bech32 === "bc";
 }
-function Ms(t, e) {
-  return Ws(t, e) ? "p2pkh" : qs(t, e) ? "p2sh" : Rn(t, e) ? "p2wpkh" : js(t, e) ? "p2wsh" : Un(t, e) ? "p2tr" : "unknown";
+function Ts(t, e) {
+  return Ns(t, e) ? "p2pkh" : Cs(t, e) ? "p2sh" : Rn(t, e) ? "p2wpkh" : Ds(t, e) ? "p2wsh" : Un(t, e) ? "p2tr" : "unknown";
 }
-function Ws(t, e) {
+function Ns(t, e) {
   return Lt(t) ? e.startsWith("1") : e.startsWith("m") || e.startsWith("n");
 }
-function qs(t, e) {
+function Cs(t, e) {
   return Lt(t) ? e.startsWith("3") : e.startsWith("2");
 }
 function Rn(t, e) {
@@ -3764,38 +3713,67 @@ function Rn(t, e) {
 function Un(t, e) {
   return Lt(t) ? e.startsWith("bc1p") : e.startsWith("tb1p");
 }
-function js(t, e) {
+function Ds(t, e) {
   return Un(t, e) || Rn(t, e) ? !1 : Lt(t) ? e.startsWith("bc1") : e.startsWith("tb1");
 }
-function Fs(t, e) {
+function Ks(t, e) {
   if (e.byteLength !== 33)
     throw new Error("Invalid public key length");
   return e.slice(1);
 }
-function vi(t, e) {
-  return Vs(
-    Fs(t, e),
+function Si(t, e) {
+  return Ls(
+    Ks(t, e),
     void 0,
     t
   ).tapInternalKey;
 }
-function Ii(t, e) {
-  return Cs(Ds(e, t), t).redeemScript;
+function vi(t, e) {
+  return Ps(_s(e, t), t).redeemScript;
 }
-function Zs(t, e) {
+function Vs(t, e) {
   const n = Vt(t).decode(e);
   return nt.encode(n);
 }
-function zs(t, e) {
-  return rt.encode(Zs(t, e));
+function Ms(t, e) {
+  return rt.encode(Vs(t, e));
+}
+class Ct extends Error {
+  constructor(e, n) {
+    super(e, n), this.name = "BitcoinWalletAdapterError";
+  }
+}
+class $i extends Ct {
+  constructor(e, n) {
+    super(e, n), this.name = "UserRejectError";
+  }
 }
-const Gs = "0000000000000000000000000000000000000000000000000000000000000000", kn = "0000000000000000000000000000000000000000000000000000000000000000", Ys = rt.encode(
+const Ws = "0000000000000000000000000000000000000000000000000000000000000000", kn = "0000000000000000000000000000000000000000000000000000000000000000", qs = rt.encode(
   Kt.encode(["OP_1", rt.decode(kn), "OP_1", "CHECKMULTISIG"])
-);
-class $i {
+), Ii = (t, e, n) => ({
+  adapterId: `mocked.${e.adapterId}`,
+  metadata: {
+    ...e.metadata,
+    name: `Mocked ${e.metadata.name}`
+  },
+  getAdapter() {
+    const r = e.getAdapter();
+    return {
+      subscribe(o) {
+        return r.subscribe((s) => {
+          o(
+            new js(t, s, n)
+          );
+        });
+      }
+    };
+  }
+});
+class js {
   constructor(e, n, r) {
-    this.network = e, this.inner = n, this.addresses = r;
+    this.inner = n, this.addresses = r, this.network = e === Be.TESTNET ? Sr("testnet") : Sr("mainnet");
   }
+  network;
   async connect() {
     await this.inner.connect();
   }
@@ -3804,20 +3782,20 @@ class $i {
   }
   async getAddresses() {
     const e = await this.inner.getAddresses(), n = (s, i) => {
-      const c = Ms(this.network, i.address), a = c === "p2tr" ? zt.P2TR : c === "p2sh" ? zt.P2SH_P2WPKH : c === "p2wpkh" ? zt.P2WPKH : c === "p2pkh" ? zt.P2PKH : void 0;
+      const c = Ts(this.network, i.address), a = c === "p2tr" ? zt.P2TR : c === "p2sh" ? zt.P2SH_P2WPKH : c === "p2wpkh" ? zt.P2WPKH : c === "p2pkh" ? zt.P2PKH : void 0;
       if (a == null)
-        throw new Nt(
+        throw new Ct(
           `[MockAddressWalletAdapter] Please provide a supported ${s} address`
         );
       return {
-        network: Lt(this.network) ? er.MAINNET : er.TESTNET,
+        network: Lt(this.network) ? Be.MAINNET : Be.TESTNET,
         purposes: i.purposes,
         addressType: a,
         address: i.address,
-        scriptPubKey: zs(this.network, i.address),
+        scriptPubKey: Ms(this.network, i.address),
         publicKey: kn,
-        redeemScript: Ys,
-        tapInternalKey: Gs
+        redeemScript: qs,
+        tapInternalKey: Ws
       };
     };
     let r, o;
@@ -3842,28 +3820,12 @@ class $i {
     });
   }
   async signMessage(e, n) {
-    throw new Nt(
-      "[MockAddressWalletAdapter] it's a mock adapter, can't send inscription"
-    );
-  }
-  get sendBitcoinFeeRateCapability() {
-    return this.inner.sendBitcoinFeeRateCapability;
-  }
-  get sendInscriptionFeeRateCapability() {
-    return this.inner.sendInscriptionFeeRateCapability;
-  }
-  sendBitcoin(e, n, r) {
-    throw new Nt(
-      "[MockAddressWalletAdapter] it's a mock adapter, can't send bitcoin"
-    );
-  }
-  sendInscription(e, n, r) {
-    throw new Nt(
+    throw new Ct(
       "[MockAddressWalletAdapter] it's a mock adapter, can't send inscription"
     );
   }
   signAndFinalizePsbt(e) {
-    throw new Nt(
+    throw new Ct(
       "[MockAddressWalletAdapter] it's a mock adapter, can't sign transaction"
     );
   }
@@ -3873,74 +3835,161 @@ class $i {
       }
     };
   }
+  get sendBitcoinFeeRateCapability() {
+    return this.inner.sendBitcoinFeeRateCapability;
+  }
+  sendBitcoin(e, n, r) {
+    throw new Ct(
+      "[MockAddressWalletAdapter] it's a mock adapter, can't send bitcoin"
+    );
+  }
+}
+const Fs = "okxwallet.bitcoin", Zs = {
+  name: "OKX Wallet",
+  iconUrl: () => import("./okx-DWbHwazu.mjs").then((t) => t.default),
+  websiteUrl: "https://web3.okx.com/",
+  downloadUrl: "https://web3.okx.com/download"
+}, zs = Pt({
+  getPrecondition: () => {
+    const t = window.okxwallet?.bitcoin;
+    return t == null ? null : { value: t };
+  },
+  initializer: async (t) => {
+    const { OkxWalletAdapterImpl: e } = await import("./OkxWalletAdapter.impl-nRgHsPTn.mjs");
+    return new e(t);
+  }
+});
+function Oi() {
+  return {
+    adapterId: Fs,
+    metadata: Zs,
+    getAdapter: () => zs
+  };
+}
+const Gs = "unisat", Ys = {
+  name: "UniSat",
+  /**
+   * https://next-cdn.unisat.io/_/2025-v965/UniSat%20Logo.zip
+   */
+  iconUrl: () => import("./unisat-pLgab4nG.mjs").then((t) => t.default),
+  websiteUrl: "https://unisat.io/",
+  downloadUrl: "https://unisat.io/download"
+}, Xs = Pt({
+  getPrecondition: () => {
+    const t = window.unisat;
+    return t == null ? null : { value: t };
+  },
+  initializer: async (t) => {
+    const { UnisatWalletAdapterImpl: e } = await import("./UnisatWalletAdapter.impl-DvA33Ikj.mjs");
+    return new e(t);
+  }
+});
+function Ri() {
+  return {
+    adapterId: Gs,
+    metadata: Ys,
+    getAdapter: () => Xs
+  };
+}
+const Pn = "XverseProviders.BitcoinProvider", Qs = {
+  name: "Xverse",
+  iconUrl: () => import("./xverse-iHLNanCB.mjs").then((t) => t.default),
+  websiteUrl: "https://xverse.app/",
+  downloadUrl: "https://www.xverse.app/download"
+}, Js = Pt({
+  getPrecondition: () => {
+    const t = (window.btc_providers ?? []).find(
+      (e) => e.id === Pn
+    );
+    return t == null ? null : { value: t };
+  },
+  initializer: async () => {
+    const { XverseWalletAdapterImpl: t } = await import("./XverseWalletAdapter.impl-BOpY4Vf8.mjs");
+    return new t();
+  }
+});
+function Ui() {
+  return {
+    adapterId: Pn,
+    metadata: Qs,
+    getAdapter: () => Js
+  };
 }
 export {
-  cs as $,
-  mi as A,
-  Qs as B,
-  ms as C,
-  kt as D,
-  Qo as E,
-  gn as F,
-  li as G,
-  di as H,
+  pi as $,
+  cs as A,
+  ei as B,
+  hi as C,
+  ui as D,
+  ps as E,
+  ai as F,
+  ns as G,
+  Z as H,
   ci as I,
-  Qe as J,
-  pi as K,
-  Js as L,
-  ti as M,
+  Ai as J,
+  fi as K,
+  ri as L,
+  ni as M,
   si as N,
-  ei as O,
+  Oi as O,
   ct as P,
-  At as Q,
-  xs as R,
-  Vt as S,
-  nt as T,
-  ri as U,
+  Fo as Q,
+  ws as R,
+  mi as S,
+  kt as T,
+  Ri as U,
   xe as V,
-  Ns as W,
-  ni as X,
-  ii as Y,
-  Kt as Z,
-  yn as _,
-  $i as a,
-  at as a0,
-  xn as a1,
-  Bi as a2,
-  hs as a3,
-  N as a4,
-  wi as a5,
-  ps as a6,
-  bi as a7,
-  gi as a8,
-  Xe as a9,
-  yi as aa,
-  ys as ab,
-  Ei as ac,
-  Si as b,
-  Zs as c,
-  Ms as d,
-  Ii as e,
-  Sr as f,
-  vi as g,
+  yn as W,
+  Ui as X,
+  li as Y,
+  di as Z,
+  Je as _,
+  Ii as a,
+  At as a0,
+  Vt as a1,
+  nt as a2,
+  ks as a3,
+  ii as a4,
+  Kt as a5,
+  gn as a6,
+  es as a7,
+  at as a8,
+  xn as a9,
+  Bi as aa,
+  is as ab,
+  N as ac,
+  wi as ad,
+  as as ae,
+  bi as af,
+  yi as ag,
+  Qe as ah,
+  gi as ai,
+  ds as aj,
+  Ei as ak,
+  Tn as b,
+  Nn as c,
+  Sr as d,
+  Vs as e,
+  Ct as f,
+  Si as g,
   rt as h,
-  oi as i,
-  Cn as j,
-  jt as k,
-  xt as l,
-  In as m,
-  xi as n,
-  Ye as o,
-  An as p,
-  ls as q,
-  hi as r,
+  $i as i,
+  Ys as j,
+  Ts as k,
+  vi as l,
+  Hn as m,
+  Qs as n,
+  Pn as o,
+  oi as p,
+  Kn as q,
+  Dn as r,
   me as s,
-  ui as t,
-  ai as u,
+  jt as t,
+  xt as u,
   be as v,
-  fs as w,
-  Z as x,
-  Ai as y,
-  fi as z
+  $n as w,
+  xi as x,
+  Xe as y,
+  An as z
 };
-//# sourceMappingURL=index-D7YwhNAG.mjs.map
+//# sourceMappingURL=index-DM4G-LJz.mjs.map