@prosopo/procaptcha-bundle 3.0.9 → 3.0.11

package/dist/bundle/{utilCryptoChunk-CIPUtfoO.js → utilCryptoChunk-qm-BM2eT.js}

@@ -1,19 +1,24 @@
-import { u as h, a as hr, b as D, s as q, i as $e, c as De, x as fr, o as pr, d as Y, e as z, f as gr, g as yr, h as mr, j as wr, k as br, l as vr, m as kr, n as ye, p as Er, q as xr } from "./utilChunk-sqstc6C5.js";
-import { b as me, s as Ar, r as x, a as Ur, n as m, c as I, R as g, u as ie, i as Ie, d as A, e as Ne, m as Sr, f as Br, g as _r, k as Rr, h as $r, p as Dr, j as Ir, l as Nr, o as Pr } from "./nobleChunk-Xl5XLrx3.js";
-import { B as Tr } from "./bnChunk-DRlDxTFg.js";
-function ce(r) {
+var Ee = (r) => {
+  throw TypeError(r);
+};
+var xe = (r, e, t) => e.has(r) || Ee("Cannot " + t);
+var k = (r, e, t) => (xe(r, e, "read from private field"), t ? t.call(r) : e.get(r)), W = (r, e, t) => e.has(r) ? Ee("Cannot add the same private member more than once") : e instanceof WeakSet ? e.add(r) : e.set(r, t), J = (r, e, t, n) => (xe(r, e, "write to private field"), n ? n.call(r, t) : e.set(r, t), t);
+import { b as Ae, s as jr, r as U, a as Tr, n as y, c as D, R as g, u as he, i as Te, d as S, e as _e, m as _r, f as zr, g as Cr, k as Lr, h as Hr, p as Or, j as Fr, l as Mr, o as qr } from "./nobleChunk-Qozzkbsq.js";
+import { u as h, a as Vr, b as I, s as V, i as ze, c as Ce, x as Kr, o as Yr, d as Z, e as C, f as Wr, g as Jr, h as Zr, j as Gr, k as Xr, l as Qr, m as et, n as Ue, p as rt, q as tt } from "./utilChunk-sqstc6C5.js";
+import { B as nt } from "./bnChunk-DRlDxTFg.js";
+function fe(r) {
   return r instanceof Uint8Array || ArrayBuffer.isView(r) && r.constructor.name === "Uint8Array";
 }
-function jr(r, ...e) {
-  if (!ce(r))
+function ot(r, ...e) {
+  if (!fe(r))
     throw new Error("Uint8Array expected");
   if (e.length > 0 && !e.includes(r.length))
     throw new Error("Uint8Array expected of length " + e + ", got length=" + r.length);
 }
-function Pe(r, e) {
+function Le(r, e) {
   return Array.isArray(e) ? e.length === 0 ? !0 : r ? e.every((t) => typeof t == "string") : e.every((t) => Number.isSafeInteger(t)) : !1;
 }
-function N(r, e) {
+function P(r, e) {
   if (typeof e != "string")
     throw new Error(`${r}: string expected`);
   return !0;
@@ -22,60 +27,60 @@ function T(r) {
   if (!Number.isSafeInteger(r))
     throw new Error(`invalid integer: ${r}`);
 }
-function L(r) {
+function O(r) {
   if (!Array.isArray(r))
     throw new Error("array expected");
 }
-function H(r, e) {
-  if (!Pe(!0, e))
+function F(r, e) {
+  if (!Le(!0, e))
     throw new Error(`${r}: array of strings expected`);
 }
-function Te(r, e) {
-  if (!Pe(!1, e))
+function He(r, e) {
+  if (!Le(!1, e))
     throw new Error(`${r}: array of numbers expected`);
 }
 // @__NO_SIDE_EFFECTS__
-function je(...r) {
-  const e = (a) => a, t = (a, s) => (i) => a(s(i)), n = r.map((a) => a.encode).reduceRight(t, e), o = r.map((a) => a.decode).reduce(t, e);
+function Oe(...r) {
+  const e = (s) => s, t = (s, i) => (a) => s(i(a)), n = r.map((s) => s.encode).reduceRight(t, e), o = r.map((s) => s.decode).reduce(t, e);
   return { encode: n, decode: o };
 }
 // @__NO_SIDE_EFFECTS__
-function ze(r) {
+function Fe(r) {
   const e = typeof r == "string" ? r.split("") : r, t = e.length;
-  H("alphabet", e);
-  const n = new Map(e.map((o, a) => [o, a]));
+  F("alphabet", e);
+  const n = new Map(e.map((o, s) => [o, s]));
   return {
-    encode: (o) => (L(o), o.map((a) => {
-      if (!Number.isSafeInteger(a) || a < 0 || a >= t)
-        throw new Error(`alphabet.encode: digit index outside alphabet "${a}". Allowed: ${r}`);
-      return e[a];
+    encode: (o) => (O(o), o.map((s) => {
+      if (!Number.isSafeInteger(s) || s < 0 || s >= t)
+        throw new Error(`alphabet.encode: digit index outside alphabet "${s}". Allowed: ${r}`);
+      return e[s];
     })),
-    decode: (o) => (L(o), o.map((a) => {
-      N("alphabet.decode", a);
-      const s = n.get(a);
-      if (s === void 0)
-        throw new Error(`Unknown letter: "${a}". Allowed: ${r}`);
-      return s;
+    decode: (o) => (O(o), o.map((s) => {
+      P("alphabet.decode", s);
+      const i = n.get(s);
+      if (i === void 0)
+        throw new Error(`Unknown letter: "${s}". Allowed: ${r}`);
+      return i;
     }))
   };
 }
 // @__NO_SIDE_EFFECTS__
-function Ce(r = "") {
-  return N("join", r), {
-    encode: (e) => (H("join.decode", e), e.join(r)),
-    decode: (e) => (N("join.decode", e), e.split(r))
+function Me(r = "") {
+  return P("join", r), {
+    encode: (e) => (F("join.decode", e), e.join(r)),
+    decode: (e) => (P("join.decode", e), e.split(r))
   };
 }
 // @__NO_SIDE_EFFECTS__
-function zr(r, e = "=") {
-  return T(r), N("padding", e), {
+function st(r, e = "=") {
+  return T(r), P("padding", e), {
     encode(t) {
-      for (H("padding.encode", t); t.length * r % 8; )
+      for (F("padding.encode", t); t.length * r % 8; )
         t.push(e);
       return t;
     },
     decode(t) {
-      H("padding.decode", t);
+      F("padding.decode", t);
       let n = t.length;
       if (n * r % 8)
         throw new Error("padding: invalid, string should have whole number of bytes");
@@ -86,258 +91,277 @@ function zr(r, e = "=") {
     }
   };
 }
-function we(r, e, t) {
+function Se(r, e, t) {
   if (e < 2)
     throw new Error(`convertRadix: invalid from=${e}, base cannot be less than 2`);
   if (t < 2)
     throw new Error(`convertRadix: invalid to=${t}, base cannot be less than 2`);
-  if (L(r), !r.length)
+  if (O(r), !r.length)
     return [];
   let n = 0;
-  const o = [], a = Array.from(r, (i) => {
-    if (T(i), i < 0 || i >= e)
-      throw new Error(`invalid integer: ${i}`);
-    return i;
-  }), s = a.length;
+  const o = [], s = Array.from(r, (a) => {
+    if (T(a), a < 0 || a >= e)
+      throw new Error(`invalid integer: ${a}`);
+    return a;
+  }), i = s.length;
   for (; ; ) {
-    let i = 0, l = !0;
-    for (let c = n; c < s; c++) {
-      const u = a[c], d = e * i, p = d + u;
-      if (!Number.isSafeInteger(p) || d / e !== i || p - u !== d)
+    let a = 0, l = !0;
+    for (let c = n; c < i; c++) {
+      const u = s[c], d = e * a, p = d + u;
+      if (!Number.isSafeInteger(p) || d / e !== a || p - u !== d)
         throw new Error("convertRadix: carry overflow");
       const b = p / t;
-      i = p % t;
+      a = p % t;
       const w = Math.floor(b);
-      if (a[c] = w, !Number.isSafeInteger(w) || w * t + i !== p)
+      if (s[c] = w, !Number.isSafeInteger(w) || w * t + a !== p)
         throw new Error("convertRadix: carry overflow");
       if (l)
         w ? l = !1 : n = c;
       else continue;
     }
-    if (o.push(i), l)
+    if (o.push(a), l)
       break;
   }
-  for (let i = 0; i < r.length - 1 && r[i] === 0; i++)
+  for (let a = 0; a < r.length - 1 && r[a] === 0; a++)
     o.push(0);
   return o.reverse();
 }
-const Oe = (r, e) => e === 0 ? r : Oe(e, r % e), F = /* @__NO_SIDE_EFFECTS__ */ (r, e) => r + (e - Oe(r, e)), W = /* @__PURE__ */ (() => {
+const qe = (r, e) => e === 0 ? r : qe(e, r % e), M = /* @__NO_SIDE_EFFECTS__ */ (r, e) => r + (e - qe(r, e)), G = /* @__PURE__ */ (() => {
   let r = [];
   for (let e = 0; e < 40; e++)
     r.push(2 ** e);
   return r;
 })();
-function be(r, e, t, n) {
-  if (L(r), e <= 0 || e > 32)
+function Be(r, e, t, n) {
+  if (O(r), e <= 0 || e > 32)
     throw new Error(`convertRadix2: wrong from=${e}`);
   if (t <= 0 || t > 32)
     throw new Error(`convertRadix2: wrong to=${t}`);
-  if (/* @__PURE__ */ F(e, t) > 32)
-    throw new Error(`convertRadix2: carry overflow from=${e} to=${t} carryBits=${/* @__PURE__ */ F(e, t)}`);
-  let o = 0, a = 0;
-  const s = W[e], i = W[t] - 1, l = [];
+  if (/* @__PURE__ */ M(e, t) > 32)
+    throw new Error(`convertRadix2: carry overflow from=${e} to=${t} carryBits=${/* @__PURE__ */ M(e, t)}`);
+  let o = 0, s = 0;
+  const i = G[e], a = G[t] - 1, l = [];
   for (const c of r) {
-    if (T(c), c >= s)
+    if (T(c), c >= i)
       throw new Error(`convertRadix2: invalid data word=${c} from=${e}`);
-    if (o = o << e | c, a + e > 32)
-      throw new Error(`convertRadix2: carry overflow pos=${a} from=${e}`);
-    for (a += e; a >= t; a -= t)
-      l.push((o >> a - t & i) >>> 0);
-    const u = W[a];
+    if (o = o << e | c, s + e > 32)
+      throw new Error(`convertRadix2: carry overflow pos=${s} from=${e}`);
+    for (s += e; s >= t; s -= t)
+      l.push((o >> s - t & a) >>> 0);
+    const u = G[s];
     if (u === void 0)
       throw new Error("invalid carry");
     o &= u - 1;
   }
-  if (o = o << t - a & i, !n && a >= e)
+  if (o = o << t - s & a, !n && s >= e)
     throw new Error("Excess padding");
   if (!n && o > 0)
     throw new Error(`Non-zero padding: ${o}`);
-  return n && a > 0 && l.push(o >>> 0), l;
+  return n && s > 0 && l.push(o >>> 0), l;
 }
 // @__NO_SIDE_EFFECTS__
-function Cr(r) {
+function at(r) {
   T(r);
   const e = 2 ** 8;
   return {
     encode: (t) => {
-      if (!ce(t))
+      if (!fe(t))
         throw new Error("radix.encode input should be Uint8Array");
-      return we(Array.from(t), e, r);
+      return Se(Array.from(t), e, r);
     },
-    decode: (t) => (Te("radix.decode", t), Uint8Array.from(we(t, r, e)))
+    decode: (t) => (He("radix.decode", t), Uint8Array.from(Se(t, r, e)))
   };
 }
 // @__NO_SIDE_EFFECTS__
-function Or(r, e = !1) {
+function it(r, e = !1) {
   if (T(r), r <= 0 || r > 32)
     throw new Error("radix2: bits should be in (0..32]");
-  if (/* @__PURE__ */ F(8, r) > 32 || /* @__PURE__ */ F(r, 8) > 32)
+  if (/* @__PURE__ */ M(8, r) > 32 || /* @__PURE__ */ M(r, 8) > 32)
     throw new Error("radix2: carry overflow");
   return {
     encode: (t) => {
-      if (!ce(t))
+      if (!fe(t))
         throw new Error("radix2.encode input should be Uint8Array");
-      return be(Array.from(t), 8, r, !e);
+      return Be(Array.from(t), 8, r, !e);
     },
-    decode: (t) => (Te("radix2.decode", t), Uint8Array.from(be(t, r, 8, e)))
+    decode: (t) => (He("radix2.decode", t), Uint8Array.from(Be(t, r, 8, e)))
   };
 }
-const Lr = typeof Uint8Array.from([]).toBase64 == "function" && typeof Uint8Array.fromBase64 == "function", Hr = (r, e) => {
-  N("base64", r);
+const ct = typeof Uint8Array.from([]).toBase64 == "function" && typeof Uint8Array.fromBase64 == "function", lt = (r, e) => {
+  P("base64", r);
   const t = /^[A-Za-z0-9=+/]+$/, n = "base64";
   if (r.length > 0 && !t.test(r))
     throw new Error("invalid base64");
   return Uint8Array.fromBase64(r, { alphabet: n, lastChunkHandling: "strict" });
-}, Fr = Lr ? {
+}, ut = ct ? {
   encode(r) {
-    return jr(r), r.toBase64();
+    return ot(r), r.toBase64();
   },
   decode(r) {
-    return Hr(r);
+    return lt(r);
   }
-} : /* @__PURE__ */ je(/* @__PURE__ */ Or(6), /* @__PURE__ */ ze("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), /* @__PURE__ */ zr(6), /* @__PURE__ */ Ce("")), Mr = /* @__NO_SIDE_EFFECTS__ */ (r) => /* @__PURE__ */ je(/* @__PURE__ */ Cr(58), /* @__PURE__ */ ze(r), /* @__PURE__ */ Ce("")), qr = /* @__PURE__ */ Mr("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
-function Le({ coder: r, ipfs: e }, t) {
+} : /* @__PURE__ */ Oe(/* @__PURE__ */ it(6), /* @__PURE__ */ Fe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), /* @__PURE__ */ st(6), /* @__PURE__ */ Me("")), dt = /* @__NO_SIDE_EFFECTS__ */ (r) => /* @__PURE__ */ Oe(/* @__PURE__ */ at(58), /* @__PURE__ */ Fe(r), /* @__PURE__ */ Me("")), ht = /* @__PURE__ */ dt("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
+function Ve({ coder: r, ipfs: e }, t) {
   return (n, o) => (t(n, o), r.decode(e && o ? n.substring(1) : n));
 }
-function He({ coder: r, ipfs: e }) {
+function Ke({ coder: r, ipfs: e }) {
   return (t, n) => {
     const o = r.encode(h(t));
     return e && n ? `${e}${o}` : o;
   };
 }
-function Fe({ chars: r, ipfs: e, type: t, withPadding: n }) {
-  return (o, a) => {
+function Ye({
+  chars: r,
+  ipfs: e,
+  type: t,
+  withPadding: n
+}) {
+  return (o, s) => {
     if (typeof o != "string")
       throw new Error(`Expected ${t} string input`);
-    if (e && a && !o.startsWith(e))
-      throw new Error(`Expected ipfs-compatible ${t} to start with '${e}'`);
-    for (let s = a ? 1 : 0, i = o.length; s < i; s++) {
-      const l = o[s];
+    if (e && s && !o.startsWith(e))
+      throw new Error(
+        `Expected ipfs-compatible ${t} to start with '${e}'`
+      );
+    for (let i = s ? 1 : 0, a = o.length; i < a; i++) {
+      const l = o[i];
       if (l === void 0)
-        throw new Error(`Invalid undefined value at index ${s}`);
-      if (!r.includes(l)) if (n && o[s] === "=") {
-        if (s !== i - 1) {
-          if (o[s + 1] !== "=") throw new Error(`Invalid ${t} padding sequence "${o[s]}${o[s + 1]}" at index ${s}`);
+        throw new Error(`Invalid undefined value at index ${i}`);
+      if (!r.includes(l)) if (n && o[i] === "=") {
+        if (i !== a - 1) {
+          if (o[i + 1] !== "=") throw new Error(
+            `Invalid ${t} padding sequence "${o[i]}${o[i + 1]}" at index ${i}`
+          );
         }
       } else
-        throw new Error(`Invalid ${t} character "${o[s]}" (0x${o.charCodeAt(s).toString(16)}) at index ${s}`);
+        throw new Error(
+          `Invalid ${t} character "${o[i]}" (0x${o.charCodeAt(i).toString(16)}) at index ${i}`
+        );
     }
     return !0;
   };
 }
-const le = {
+const pe = {
   chars: "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz",
-  coder: qr,
+  coder: ht,
   ipfs: "z",
   type: "base58"
-}, Vr = Fe(le), Kr = Le(le, Vr), Yr = He(le);
-function Me(r) {
-  return (...e) => hr(r(...e));
+}, We = /* @__PURE__ */ Ye(pe), Je = /* @__PURE__ */ Ve(pe, We), Ze = /* @__PURE__ */ Ke(pe);
+function Ge(r) {
+  return (...e) => Vr(r(...e));
 }
-function ue(r, e = 256, t, n) {
-  const o = Math.ceil(e / 8), a = h(r);
-  return t ? me(a, { dkLen: o, key: t }) : me(a, { dkLen: o });
+function K(r, e = 256, t, n) {
+  const o = Math.ceil(e / 8), s = h(r);
+  return t ? Ae(s, { dkLen: o, key: t }) : Ae(s, { dkLen: o });
 }
-const Wt = Me(ue), Wr = q("SS58PRE");
-function qe(r) {
-  return ue(D(Wr, r), 512);
+const ft = /* @__PURE__ */ Ge(K), pt = V("SS58PRE");
+function Xe(r) {
+  return K(I(pt, r), 512);
 }
-function Jr(r) {
+function gt(r) {
   if (r[0] === void 0)
     throw new Error("Invalid address: first byte cannot be undefined");
   if (r[1] === void 0)
     throw new Error("Invalid address: second byte cannot be undefined");
-  const e = r[0] & 64 ? 2 : 1, t = e === 1 ? r[0] : (r[0] & 63) << 2 | r[1] >> 6 | (r[1] & 63) << 8, n = [34 + e, 35 + e].includes(r.length), o = r.length - (n ? 2 : 1), a = qe(r.subarray(0, o));
-  return [(r[0] & 128) === 0 && ![46, 47].includes(r[0]) && (n ? r[r.length - 2] === a[0] && r[r.length - 1] === a[1] : r[r.length - 1] === a[0]), o, e, t];
+  const e = r[0] & 64 ? 2 : 1, t = e === 1 ? r[0] : (r[0] & 63) << 2 | r[1] >> 6 | (r[1] & 63) << 8, n = [34 + e, 35 + e].includes(
+    r.length
+  ), o = r.length - (n ? 2 : 1), s = Xe(r.subarray(0, o));
+  return [(r[0] & 128) === 0 && ![46, 47].includes(r[0]) && (n ? r[r.length - 2] === s[0] && r[r.length - 1] === s[1] : r[r.length - 1] === s[0]), o, e, t];
 }
-const C = {
+const L = {
   allowedDecodedLengths: [1, 2, 4, 8, 32, 33],
+  // publicKey has prefix + 2 checksum bytes, short only prefix + 1 checksum byte
   allowedEncodedLengths: [3, 4, 6, 10, 35, 36, 37, 38],
   prefix: 42
 };
-function Ve(r, e, t = -1) {
+function ge(r, e, t = -1) {
   if (!r)
     throw new Error("Invalid empty address passed");
-  if ($e(r) || De(r))
+  if (ze(r) || Ce(r))
     return h(r);
   try {
-    const n = Kr(r);
-    if (!C.allowedEncodedLengths.includes(n.length))
+    const n = Je(r);
+    if (!L.allowedEncodedLengths.includes(n.length))
       throw new Error("Invalid decoded address length");
-    const [o, a, s, i] = Jr(n);
+    const [o, s, i, a] = gt(n);
     if (!o && !e)
       throw new Error("Invalid decoded address checksum");
-    if (t !== -1 && t !== i)
-      throw new Error(`Expected ss58Format ${t}, received ${i}`);
-    return n.slice(s, a);
+    if (t !== -1 && t !== a)
+      throw new Error(
+        `Expected ss58Format ${t}, received ${a}`
+      );
+    return n.slice(i, s);
   } catch (n) {
     throw new Error(`Decoding ${r}: ${n.message}`);
   }
 }
-function Jt(r, e = C.prefix) {
-  const t = Ve(r);
+function mt(r, e = L.prefix) {
+  const t = ge(r);
   if (e < 0 || e > 16383 || [46, 47].includes(e))
     throw new Error("Out of range ss58Format specified");
-  if (!C.allowedDecodedLengths.includes(t.length))
-    throw new Error(`Expected a valid key to convert, with length ${C.allowedDecodedLengths.join(", ")}`);
-  const n = D(e < 64 ? [e] : [
-    (e & 252) >> 2 | 64,
-    e >> 8 | (e & 3) << 6
-  ], t);
-  return Yr(D(n, qe(n).subarray(0, [32, 33].includes(t.length) ? 2 : 1)));
-}
-const de = {
+  if (!L.allowedDecodedLengths.includes(t.length))
+    throw new Error(
+      `Expected a valid key to convert, with length ${L.allowedDecodedLengths.join(", ")}`
+    );
+  const n = I(
+    e < 64 ? [e] : [
+      (e & 252) >> 2 | 64,
+      e >> 8 | (e & 3) << 6
+    ],
+    t
+  );
+  return Ze(
+    I(
+      n,
+      Xe(n).subarray(0, [32, 33].includes(t.length) ? 2 : 1)
+    )
+  );
+}
+const me = {
   chars: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/",
-  coder: Fr,
+  coder: ut,
   type: "base64",
   withPadding: !0
-}, Gr = Fe(de), Gt = Le(de, Gr), Zr = He(de);
-function j(r, e) {
+}, Qe = /* @__PURE__ */ Ye(me), yt = /* @__PURE__ */ Ve(me, Qe), er = /* @__PURE__ */ Ke(me);
+function z(r, e) {
   return r << e | r >>> 32 - e;
 }
-function v(r, e) {
+function E(r, e) {
   let t = r[e + 3] & 255;
   return t = t << 8 | r[e + 2] & 255, t = t << 8 | r[e + 1] & 255, t << 8 | r[e + 0] & 255;
 }
-function J(r, e, t) {
+function X(r, e, t) {
   for (let n = 0; n < 4; n++)
     r[e + n] = t & 255, t >>>= 8;
 }
-function Xr(r, e, t, n, o) {
-  let a = 0;
-  for (let s = 0; s < o; s++)
-    a |= r[e + s] ^ t[n + s];
-  return (1 & a - 1 >>> 8) - 1;
+function wt(r, e, t, n, o) {
+  let s = 0;
+  for (let i = 0; i < o; i++) s |= r[e + i] ^ t[n + i];
+  return (1 & s - 1 >>> 8) - 1;
 }
-function re(r, e, t, n, o) {
-  const a = new Uint32Array(16), s = new Uint32Array(16), i = new Uint32Array(16), l = new Uint32Array(4);
+function oe(r, e, t, n, o) {
+  const s = new Uint32Array(16), i = new Uint32Array(16), a = new Uint32Array(16), l = new Uint32Array(4);
   let c, u, d;
   for (c = 0; c < 4; c++)
-    s[5 * c] = v(n, 4 * c), s[1 + c] = v(t, 4 * c), s[6 + c] = v(e, 4 * c), s[11 + c] = v(t, 16 + 4 * c);
-  for (c = 0; c < 16; c++)
-    i[c] = s[c];
+    i[5 * c] = E(n, 4 * c), i[1 + c] = E(t, 4 * c), i[6 + c] = E(e, 4 * c), i[11 + c] = E(t, 16 + 4 * c);
+  for (c = 0; c < 16; c++) a[c] = i[c];
   for (c = 0; c < 20; c++) {
     for (u = 0; u < 4; u++) {
-      for (d = 0; d < 4; d++)
-        l[d] = s[(5 * u + 4 * d) % 16];
-      for (l[1] ^= j(l[0] + l[3] | 0, 7), l[2] ^= j(l[1] + l[0] | 0, 9), l[3] ^= j(l[2] + l[1] | 0, 13), l[0] ^= j(l[3] + l[2] | 0, 18), d = 0; d < 4; d++)
-        a[4 * u + (u + d) % 4] = l[d];
+      for (d = 0; d < 4; d++) l[d] = i[(5 * u + 4 * d) % 16];
+      for (l[1] ^= z(l[0] + l[3] | 0, 7), l[2] ^= z(l[1] + l[0] | 0, 9), l[3] ^= z(l[2] + l[1] | 0, 13), l[0] ^= z(l[3] + l[2] | 0, 18), d = 0; d < 4; d++) s[4 * u + (u + d) % 4] = l[d];
     }
-    for (d = 0; d < 16; d++)
-      s[d] = a[d];
+    for (d = 0; d < 16; d++) i[d] = s[d];
   }
   if (o) {
-    for (c = 0; c < 16; c++)
-      s[c] = s[c] + i[c] | 0;
+    for (c = 0; c < 16; c++) i[c] = i[c] + a[c] | 0;
     for (c = 0; c < 4; c++)
-      s[5 * c] = s[5 * c] - v(n, 4 * c) | 0, s[6 + c] = s[6 + c] - v(e, 4 * c) | 0;
+      i[5 * c] = i[5 * c] - E(n, 4 * c) | 0, i[6 + c] = i[6 + c] - E(e, 4 * c) | 0;
     for (c = 0; c < 4; c++)
-      J(r, 4 * c, s[5 * c]), J(r, 16 + 4 * c, s[6 + c]);
+      X(r, 4 * c, i[5 * c]), X(r, 16 + 4 * c, i[6 + c]);
   } else
-    for (c = 0; c < 16; c++)
-      J(r, 4 * c, s[c] + i[c] | 0);
+    for (c = 0; c < 16; c++) X(r, 4 * c, i[c] + a[c] | 0);
 }
-const te = new Uint8Array([
+const se = new Uint8Array([
   101,
   120,
   112,
@@ -355,37 +379,32 @@ const te = new Uint8Array([
   32,
   107
 ]);
-function Qr(r, e, t, n, o, a, s) {
-  const i = new Uint8Array(16), l = new Uint8Array(64);
+function bt(r, e, t, n, o, s, i) {
+  const a = new Uint8Array(16), l = new Uint8Array(64);
   let c, u;
-  if (!o)
-    return 0;
-  for (u = 0; u < 16; u++)
-    i[u] = 0;
-  for (u = 0; u < 8; u++)
-    i[u] = a[u];
+  if (!o) return 0;
+  for (u = 0; u < 16; u++) a[u] = 0;
+  for (u = 0; u < 8; u++) a[u] = s[u];
   for (; o >= 64; ) {
-    for (re(l, i, s, te, !1), u = 0; u < 64; u++)
-      r[e + u] = (t ? t[n + u] : 0) ^ l[u];
+    for (oe(l, a, i, se, !1), u = 0; u < 64; u++) r[e + u] = (t ? t[n + u] : 0) ^ l[u];
     for (c = 1, u = 8; u < 16; u++)
-      c = c + (i[u] & 255) | 0, i[u] = c & 255, c >>>= 8;
+      c = c + (a[u] & 255) | 0, a[u] = c & 255, c >>>= 8;
     o -= 64, e += 64, t && (n += 64);
   }
   if (o > 0)
-    for (re(l, i, s, te, !1), u = 0; u < o; u++)
-      r[e + u] = (t ? t[n + u] : 0) ^ l[u];
+    for (oe(l, a, i, se, !1), u = 0; u < o; u++) r[e + u] = (t ? t[n + u] : 0) ^ l[u];
   return 0;
 }
-function ne(r, e, t, n, o, a, s) {
-  const i = new Uint8Array(32);
-  return re(i, a, s, te, !0), Qr(r, e, t, n, o, a.subarray(16), i);
+function ae(r, e, t, n, o, s, i) {
+  const a = new Uint8Array(32);
+  return oe(a, s, i, se, !0), bt(r, e, t, n, o, s.subarray(16), a);
 }
-function G(r, e) {
+function Q(r, e) {
   let t = 0;
   for (let n = 0; n < 17; n++)
     t = t + (r[n] + e[n] | 0) | 0, r[n] = t & 255, t >>>= 8;
 }
-const et = new Uint32Array([
+const vt = new Uint32Array([
   5,
   0,
   0,
@@ -404,133 +423,124 @@ const et = new Uint32Array([
   0,
   252
 ]);
-function Ke(r, e, t, n, o, a) {
-  let s, i, l;
+function rr(r, e, t, n, o, s) {
+  let i, a, l;
   const c = new Uint32Array(17), u = new Uint32Array(17), d = new Uint32Array(17), p = new Uint32Array(17), b = new Uint32Array(17);
-  for (i = 0; i < 17; i++)
-    u[i] = d[i] = 0;
-  for (i = 0; i < 16; i++)
-    u[i] = a[i];
+  for (a = 0; a < 17; a++) u[a] = d[a] = 0;
+  for (a = 0; a < 16; a++) u[a] = s[a];
   for (u[3] &= 15, u[4] &= 252, u[7] &= 15, u[8] &= 252, u[11] &= 15, u[12] &= 252, u[15] &= 15; o > 0; ) {
-    for (i = 0; i < 17; i++)
-      p[i] = 0;
-    for (i = 0; i < 16 && i < o; ++i)
-      p[i] = t[n + i];
-    for (p[i] = 1, n += i, o -= i, G(d, p), s = 0; s < 17; s++)
-      for (c[s] = 0, i = 0; i < 17; i++)
-        c[s] = c[s] + d[i] * (i <= s ? u[s - i] : 320 * u[s + 17 - i] | 0) | 0 | 0;
-    for (s = 0; s < 17; s++)
-      d[s] = c[s];
-    for (l = 0, i = 0; i < 16; i++)
-      l = l + d[i] | 0, d[i] = l & 255, l >>>= 8;
-    for (l = l + d[16] | 0, d[16] = l & 3, l = 5 * (l >>> 2) | 0, i = 0; i < 16; i++)
-      l = l + d[i] | 0, d[i] = l & 255, l >>>= 8;
+    for (a = 0; a < 17; a++) p[a] = 0;
+    for (a = 0; a < 16 && a < o; ++a) p[a] = t[n + a];
+    for (p[a] = 1, n += a, o -= a, Q(d, p), i = 0; i < 17; i++)
+      for (c[i] = 0, a = 0; a < 17; a++)
+        c[i] = c[i] + d[a] * (a <= i ? u[i - a] : 320 * u[i + 17 - a] | 0) | 0 | 0;
+    for (i = 0; i < 17; i++) d[i] = c[i];
+    for (l = 0, a = 0; a < 16; a++)
+      l = l + d[a] | 0, d[a] = l & 255, l >>>= 8;
+    for (l = l + d[16] | 0, d[16] = l & 3, l = 5 * (l >>> 2) | 0, a = 0; a < 16; a++)
+      l = l + d[a] | 0, d[a] = l & 255, l >>>= 8;
     l = l + d[16] | 0, d[16] = l;
   }
-  for (i = 0; i < 17; i++)
-    b[i] = d[i];
-  G(d, et);
+  for (a = 0; a < 17; a++) b[a] = d[a];
+  Q(d, vt);
   const w = -(d[16] >>> 7) | 0;
-  for (i = 0; i < 17; i++)
-    d[i] ^= w & (b[i] ^ d[i]);
-  for (i = 0; i < 16; i++)
-    p[i] = a[i + 16];
-  for (p[16] = 0, G(d, p), i = 0; i < 16; i++)
-    r[e + i] = d[i];
+  for (a = 0; a < 17; a++) d[a] ^= w & (b[a] ^ d[a]);
+  for (a = 0; a < 16; a++) p[a] = s[a + 16];
+  for (p[16] = 0, Q(d, p), a = 0; a < 16; a++) r[e + a] = d[a];
   return 0;
 }
-function rt(r, e, t, n, o, a) {
-  const s = new Uint8Array(16);
-  return Ke(s, 0, t, n, o, a), Xr(r, e, s, 0, 16);
+function kt(r, e, t, n, o, s) {
+  const i = new Uint8Array(16);
+  return rr(i, 0, t, n, o, s), wt(r, e, i, 0, 16);
 }
-function tt(r, e, t, n, o) {
-  if (t < 32)
-    return -1;
-  ne(r, 0, e, 0, t, n, o), Ke(r, 16, r, 32, t - 32, r);
-  for (let a = 0; a < 16; a++)
-    r[a] = 0;
+function Et(r, e, t, n, o) {
+  if (t < 32) return -1;
+  ae(r, 0, e, 0, t, n, o), rr(r, 16, r, 32, t - 32, r);
+  for (let s = 0; s < 16; s++) r[s] = 0;
   return 0;
 }
-function nt(r, e, t, n, o) {
-  const a = new Uint8Array(32);
-  if (t < 32 || (ne(a, 0, null, 0, 32, n, o), rt(e, 16, e, 32, t - 32, a) !== 0))
-    return -1;
-  ne(r, 0, e, 0, t, n, o);
-  for (let s = 0; s < 32; s++)
-    r[s] = 0;
+function xt(r, e, t, n, o) {
+  const s = new Uint8Array(32);
+  if (t < 32 || (ae(s, 0, null, 0, 32, n, o), kt(e, 16, e, 32, t - 32, s) !== 0)) return -1;
+  ae(r, 0, e, 0, t, n, o);
+  for (let i = 0; i < 32; i++) r[i] = 0;
   return 0;
 }
-const ot = 32, at = 24, oe = 32, ae = 16;
-function Ye(r, e) {
-  if (r.length !== ot)
-    throw new Error("bad key size");
-  if (e.length !== at)
+const At = 32, Ut = 24, ie = 32, ce = 16;
+function tr(r, e) {
+  if (r.length !== At) throw new Error("bad key size");
+  if (e.length !== Ut)
     throw new Error("bad nonce size");
 }
-function We(...r) {
+function nr(...r) {
   for (let e = 0, t = r.length; e < t; e++)
     if (!(r[e] instanceof Uint8Array))
       throw new TypeError("unexpected type, use Uint8Array");
 }
-function st(r, e, t) {
-  We(r, e, t), Ye(t, e);
-  const n = new Uint8Array(oe + r.length), o = new Uint8Array(n.length);
-  for (let a = 0; a < r.length; a++)
-    n[a + oe] = r[a];
-  return tt(o, n, n.length, e, t), o.subarray(ae);
+function St(r, e, t) {
+  nr(r, e, t), tr(t, e);
+  const n = new Uint8Array(ie + r.length), o = new Uint8Array(n.length);
+  for (let s = 0; s < r.length; s++)
+    n[s + ie] = r[s];
+  return Et(o, n, n.length, e, t), o.subarray(ce);
 }
-function it(r, e, t) {
-  We(r, e, t), Ye(t, e);
-  const n = new Uint8Array(ae + r.length), o = new Uint8Array(n.length);
-  for (let a = 0; a < r.length; a++)
-    n[a + ae] = r[a];
-  return n.length < 32 || nt(o, n, n.length, e, t) !== 0 ? null : o.subarray(oe);
+function Bt(r, e, t) {
+  nr(r, e, t), tr(t, e);
+  const n = new Uint8Array(ce + r.length), o = new Uint8Array(n.length);
+  for (let s = 0; s < r.length; s++)
+    n[s + ce] = r[s];
+  return n.length < 32 || xt(o, n, n.length, e, t) !== 0 ? null : o.subarray(ie);
 }
-function ct(r, e, t) {
-  return it(r, e, t);
+function or(r, e, t) {
+  return Bt(r, e, t);
 }
-const lt = fr.crypto;
-function ut(r) {
-  return lt.getRandomValues(r);
+const Rt = Kr.crypto;
+function $t(r) {
+  return Rt.getRandomValues(r);
 }
-function V(r = 32) {
-  return ut(new Uint8Array(r));
+function _(r = 32) {
+  return $t(new Uint8Array(r));
 }
-const Zt = Me(V);
-function Xt(r, e, t = V(24)) {
+const Nt = /* @__PURE__ */ Ge(_);
+function Dt(r, e, t = _(24)) {
   return {
-    encrypted: st(r, t, e),
+    encrypted: St(r, t, e),
     nonce: t
   };
 }
-const O = {
+const H = {
   N: 32768,
   p: 1,
   r: 8
 };
-function dt(r, e = V(), t = O, n) {
+function sr(r, e = _(), t = H, n) {
   const o = h(r);
   return {
     params: t,
-    password: Ar(o, e, pr({ dkLen: 64 }, t)),
+    password: jr(o, e, Yr({ dkLen: 64 }, t)),
     salt: e
   };
 }
-const Z = { isLe: !0 }, X = { bitLength: 32, isLe: !0 }, ht = { bitLength: 256, isLe: !0 };
-function ft(r) {
-  const e = r.subarray(0, 32), t = Y(r.subarray(32, 36), Z).toNumber(), n = Y(r.subarray(36, 40), Z).toNumber(), o = Y(r.subarray(40, 44), Z).toNumber();
-  if (t !== O.N || n !== O.p || o !== O.r)
+const ee = { isLe: !0 }, re = { bitLength: 32, isLe: !0 }, It = { bitLength: 256, isLe: !0 };
+function ar(r) {
+  const e = r.subarray(0, 32), t = Z(r.subarray(32, 36), ee).toNumber(), n = Z(r.subarray(36, 40), ee).toNumber(), o = Z(r.subarray(40, 44), ee).toNumber();
+  if (t !== H.N || n !== H.p || o !== H.r)
     throw new Error("Invalid injected scrypt params found");
   return { params: { N: t, p: n, r: o }, salt: e };
 }
-function Qt(r, { N: e, p: t, r: n }) {
-  return D(r, z(e, X), z(t, X), z(n, X));
+function Pt(r, { N: e, p: t, r: n }) {
+  return I(
+    r,
+    C(e, re),
+    C(t, re),
+    C(n, re)
+  );
 }
-const Je = [
+const ye = [
   "scrypt",
   "xsalsa20-poly1305"
-], pt = ["none"], gt = "3", ve = 24, yt = 32 + 3 * 4;
-function en(r, e, t = Je) {
+], ir = ["none"], cr = "3", le = 24, lr = 32 + 3 * 4;
+function jt(r, e, t = ye) {
   if (!r)
     throw new Error("No encrypted data available to decode");
   if (t.includes("xsalsa20-poly1305") && !e)
@@ -539,233 +549,129 @@ function en(r, e, t = Je) {
   if (e) {
     let o;
     if (t.includes("scrypt")) {
-      const { params: a, salt: s } = ft(r);
-      o = dt(e, s, a).password, r = r.subarray(yt);
+      const { params: s, salt: i } = ar(r);
+      o = sr(e, i, s).password, r = r.subarray(lr);
     } else
-      o = q(e);
-    n = ct(r.subarray(ve), r.subarray(0, ve), gr(o, 256, !0));
+      o = V(e);
+    n = or(
+      r.subarray(le),
+      r.subarray(0, le),
+      Wr(o, 256, !0)
+    );
   }
   if (!n)
     throw new Error("Unable to decode using the supplied passphrase");
   return n;
 }
-function rn(r, e, t) {
+function Tt(r, e, t) {
   return {
-    encoded: Zr(r),
+    encoded: er(r),
     encoding: {
       content: e,
-      type: t ? Je : pt,
-      version: gt
+      type: t ? ye : ir,
+      version: cr
     }
   };
 }
-var ke = function() {
-  return ke = Object.assign || function(e) {
-    for (var t, n = 1, o = arguments.length; n < o; n++) {
-      t = arguments[n];
-      for (var a in t) Object.prototype.hasOwnProperty.call(t, a) && (e[a] = t[a]);
-    }
-    return e;
-  }, ke.apply(this, arguments);
-};
-function tn(r, e, t, n) {
-  function o(a) {
-    return a instanceof t ? a : new t(function(s) {
-      s(a);
-    });
-  }
-  return new (t || (t = Promise))(function(a, s) {
-    function i(u) {
-      try {
-        c(n.next(u));
-      } catch (d) {
-        s(d);
-      }
-    }
-    function l(u) {
-      try {
-        c(n.throw(u));
-      } catch (d) {
-        s(d);
-      }
-    }
-    function c(u) {
-      u.done ? a(u.value) : o(u.value).then(i, l);
-    }
-    c((n = n.apply(r, e || [])).next());
-  });
-}
-function nn(r, e) {
-  var t = { label: 0, sent: function() {
-    if (a[0] & 1) throw a[1];
-    return a[1];
-  }, trys: [], ops: [] }, n, o, a, s = Object.create((typeof Iterator == "function" ? Iterator : Object).prototype);
-  return s.next = i(0), s.throw = i(1), s.return = i(2), typeof Symbol == "function" && (s[Symbol.iterator] = function() {
-    return this;
-  }), s;
-  function i(c) {
-    return function(u) {
-      return l([c, u]);
-    };
-  }
-  function l(c) {
-    if (n) throw new TypeError("Generator is already executing.");
-    for (; s && (s = 0, c[0] && (t = 0)), t; ) try {
-      if (n = 1, o && (a = c[0] & 2 ? o.return : c[0] ? o.throw || ((a = o.return) && a.call(o), 0) : o.next) && !(a = a.call(o, c[1])).done) return a;
-      switch (o = 0, a && (c = [c[0] & 2, a.value]), c[0]) {
-        case 0:
-        case 1:
-          a = c;
-          break;
-        case 4:
-          return t.label++, { value: c[1], done: !1 };
-        case 5:
-          t.label++, o = c[1], c = [0];
-          continue;
-        case 7:
-          c = t.ops.pop(), t.trys.pop();
-          continue;
-        default:
-          if (a = t.trys, !(a = a.length > 0 && a[a.length - 1]) && (c[0] === 6 || c[0] === 2)) {
-            t = 0;
-            continue;
-          }
-          if (c[0] === 3 && (!a || c[1] > a[0] && c[1] < a[3])) {
-            t.label = c[1];
-            break;
-          }
-          if (c[0] === 6 && t.label < a[1]) {
-            t.label = a[1], a = c;
-            break;
-          }
-          if (a && t.label < a[2]) {
-            t.label = a[2], t.ops.push(c);
-            break;
-          }
-          a[2] && t.ops.pop(), t.trys.pop();
-          continue;
-      }
-      c = e.call(r, t);
-    } catch (u) {
-      c = [6, u], o = 0;
-    } finally {
-      n = a = 0;
-    }
-    if (c[0] & 5) throw c[1];
-    return { value: c[0] ? c[1] : void 0, done: !0 };
-  }
-}
-function on(r, e, t) {
-  if (t || arguments.length === 2) for (var n = 0, o = e.length, a; n < o; n++)
-    (a || !(n in e)) && (a || (a = Array.prototype.slice.call(e, 0, n)), a[n] = e[n]);
-  return r.concat(a || Array.prototype.slice.call(e));
-}
-function _(r, e, t, n) {
-  if (t === "a" && !n) throw new TypeError("Private accessor was defined without a getter");
-  if (typeof e == "function" ? r !== e || !n : !e.has(r)) throw new TypeError("Cannot read private member from an object whose class did not declare it");
-  return t === "m" ? n : t === "a" ? n.call(r) : n ? n.value : e.get(r);
-}
-function Ee(r, e, t, n, o) {
-  if (n === "m") throw new TypeError("Private method is not writable");
-  if (n === "a" && !o) throw new TypeError("Private accessor was defined without a setter");
-  if (typeof e == "function" ? r !== e || !o : !e.has(r)) throw new TypeError("Cannot write private member to an object whose class did not declare it");
-  return n === "a" ? o.call(r, t) : o ? o.value = t : e.set(r, t), t;
-}
-var $, k;
-const mt = /^\d+$/, wt = 32;
-class he {
+const _t = /^\d+$/, zt = 32;
+var A, v;
+const ke = class ke {
   constructor() {
-    $.set(this, new Uint8Array(32)), k.set(this, !1);
+    W(this, A, new Uint8Array(32));
+    W(this, v, !1);
   }
   static from(e) {
-    const t = new he(), [n, o] = e.startsWith("/") ? [e.substring(1), !0] : [e, !1];
-    return t.soft(mt.test(n) ? new Tr(n, 10) : n), o ? t.harden() : t;
+    const t = new ke(), [n, o] = e.startsWith("/") ? [e.substring(1), !0] : [e, !1];
+    return t.soft(_t.test(n) ? new nt(n, 10) : n), o ? t.harden() : t;
   }
   get chainCode() {
-    return _(this, $, "f");
+    return k(this, A);
   }
   get isHard() {
-    return _(this, k, "f");
+    return k(this, v);
   }
   get isSoft() {
-    return !_(this, k, "f");
+    return !k(this, v);
   }
   hard(e) {
     return this.soft(e).harden();
   }
   harden() {
-    return Ee(this, k, !0, "f"), this;
+    return J(this, v, !0), this;
   }
   soft(e) {
-    return yr(e) || mr(e) || wr(e) ? this.soft(z(e, ht)) : De(e) ? this.soft(br(e)) : vr(e) ? this.soft(kr(q(e))) : e.length > wt ? this.soft(ue(e)) : (_(this, $, "f").fill(0), _(this, $, "f").set(e, 0), this);
+    return Jr(e) || Zr(e) || Gr(e) ? this.soft(C(e, It)) : Ce(e) ? this.soft(Xr(e)) : Qr(e) ? this.soft(et(V(e))) : e.length > zt ? this.soft(K(e)) : (k(this, A).fill(0), k(this, A).set(e, 0), this);
   }
   soften() {
-    return Ee(this, k, !1, "f"), this;
+    return J(this, v, !1), this;
   }
-}
-$ = /* @__PURE__ */ new WeakMap(), k = /* @__PURE__ */ new WeakMap();
-const bt = /\/(\/?)([^/]+)/g;
-function vt(r) {
-  const e = r.match(bt), t = [];
+};
+A = new WeakMap(), v = new WeakMap();
+let ue = ke;
+const Ct = /\/(\/?)([^/]+)/g;
+function ur(r) {
+  const e = r.match(Ct), t = [];
   let n = "";
   if (e) {
     n = e.join("");
     for (const o of e)
-      t.push(he.from(o.substring(1)));
+      t.push(ue.from(o.substring(1)));
   }
   if (n !== r)
-    throw new Error(`Re-constructed path "${n}" does not match input`);
+    throw new Error(
+      `Re-constructed path "${n}" does not match input`
+    );
   return {
     parts: e,
     path: t
   };
 }
-const kt = /^(\w+( \w+)*)((\/\/?[^/]+)*)(\/\/\/(.*))?$/;
-function an(r) {
-  const e = r.match(kt);
+const Lt = /^(\w+( \w+)*)((\/\/?[^/]+)*)(\/\/\/(.*))?$/;
+function Ht(r) {
+  const e = r.match(Lt);
   if (e === null)
     throw new Error("Unable to match provided value to a secret URI");
   const [, t, , n, , , o] = e;
   if (!t)
     throw new Error("Unable to extract phrase from provided value");
-  const { path: a } = vt(n || "");
+  const { path: s } = ur(n || "");
   return {
     derivePath: n || "",
     password: o,
-    path: a,
+    path: s,
     phrase: t
   };
 }
-const Ge = BigInt(0), Ze = BigInt(3);
-function Q(r) {
+const dr = BigInt(0), hr = BigInt(3);
+function te(r) {
   if (typeof r == "string")
-    return ie(r);
-  if (Ie(r))
+    return he(r);
+  if (Te(r))
     return r;
   throw new Error("Wrong data");
 }
 function f(r, e, ...t) {
-  if (!Ie(e))
+  if (!Te(e))
     throw new Error(`${r}: Uint8Array expected`);
   if (t.length && !t.includes(e.length))
     throw new Error(`${r}: Uint8Array expected of length ${t}, not of length=${e.length}`);
 }
-function M(r, e) {
+function q(r, e) {
   if (!Number.isSafeInteger(e) || e < 0 || e > 4294967295)
     throw new Error(`${r}: wrong u32 integer: ${e}`);
   return e;
 }
-function U(...r) {
+function B(...r) {
   for (const e of r)
     e.fill(0);
 }
-const E = Uint8Array.of(), fe = Br.CURVE.n;
-function xe(r, e) {
+const x = Uint8Array.of(), we = zr.CURVE.n;
+function Re(r, e) {
   f(r, e, 32);
-  const t = A(e);
-  return Ne(r, t, Ge, fe), t;
+  const t = S(e);
+  return _e(r, t, dr, we), t;
 }
-const P = (r) => Sr(r, fe), R = 166, y = {
+const j = (r) => _r(r, we), N = 166, m = {
   I: 1,
   A: 2,
   C: 4,
@@ -773,31 +679,31 @@ const P = (r) => Sr(r, fe), R = 166, y = {
   M: 16,
   K: 32
 };
-class pe {
+class be {
   constructor(e) {
-    this.state = new Uint8Array(200), this.pos = 0, this.posBegin = 0, this.curFlags = 0, this.state.set([1, R + 2, 1, 0, 1, 96], 0), this.state.set(ie("STROBEv1.0.2"), 6), this.state32 = _r(this.state), this.keccakF1600(), this.metaAD(e, !1);
+    this.state = new Uint8Array(200), this.pos = 0, this.posBegin = 0, this.curFlags = 0, this.state.set([1, N + 2, 1, 0, 1, 96], 0), this.state.set(he("STROBEv1.0.2"), 6), this.state32 = Cr(this.state), this.keccakF1600(), this.metaAD(e, !1);
   }
   keccakF1600() {
-    Rr(this.state32);
+    Lr(this.state32);
   }
   runF() {
-    this.state[this.pos] ^= this.posBegin, this.state[this.pos + 1] ^= 4, this.state[R + 1] ^= 128, this.keccakF1600(), this.pos = 0, this.posBegin = 0;
+    this.state[this.pos] ^= this.posBegin, this.state[this.pos + 1] ^= 4, this.state[N + 1] ^= 128, this.keccakF1600(), this.pos = 0, this.posBegin = 0;
   }
   // keccak.update()
   absorb(e) {
     for (let t = 0; t < e.length; t++)
-      this.state[this.pos++] ^= e[t], this.pos === R && this.runF();
+      this.state[this.pos++] ^= e[t], this.pos === N && this.runF();
   }
   // keccak.xof()
   squeeze(e) {
     const t = new Uint8Array(e);
     for (let n = 0; n < t.length; n++)
-      t[n] = this.state[this.pos], this.state[this.pos++] = 0, this.pos === R && this.runF();
+      t[n] = this.state[this.pos], this.state[this.pos++] = 0, this.pos === N && this.runF();
     return t;
   }
   overwrite(e) {
     for (let t = 0; t < e.length; t++)
-      this.state[this.pos++] = e[t], this.pos === R && this.runF();
+      this.state[this.pos++] = e[t], this.pos === N && this.runF();
   }
   beginOp(e, t) {
     if (t) {
@@ -805,49 +711,49 @@ class pe {
         throw new Error(`Continued op with changed flags from ${this.curFlags.toString(2)} to ${e.toString(2)}`);
       return;
     }
-    if ((e & y.T) !== 0)
+    if ((e & m.T) !== 0)
       throw new Error("T flag is not supported");
     const n = this.posBegin;
-    this.posBegin = this.pos + 1, this.curFlags = e, this.absorb(new Uint8Array([n, e])), (e & (y.C | y.K)) !== 0 && this.pos !== 0 && this.runF();
+    this.posBegin = this.pos + 1, this.curFlags = e, this.absorb(new Uint8Array([n, e])), (e & (m.C | m.K)) !== 0 && this.pos !== 0 && this.runF();
   }
   // Public API
   metaAD(e, t) {
-    this.beginOp(y.M | y.A, t), this.absorb(Q(e));
+    this.beginOp(m.M | m.A, t), this.absorb(te(e));
   }
   AD(e, t) {
-    this.beginOp(y.A, t), this.absorb(Q(e));
+    this.beginOp(m.A, t), this.absorb(te(e));
   }
   PRF(e, t) {
-    return this.beginOp(y.I | y.A | y.C, t), this.squeeze(e);
+    return this.beginOp(m.I | m.A | m.C, t), this.squeeze(e);
   }
   KEY(e, t) {
-    this.beginOp(y.A | y.C, t), this.overwrite(Q(e));
+    this.beginOp(m.A | m.C, t), this.overwrite(te(e));
   }
   // Utils
   clone() {
-    const e = new pe("0");
+    const e = new be("0");
     return e.pos = this.pos, e.posBegin = this.posBegin, e.state.set(this.state), e.curFlags = this.curFlags, e;
   }
   clean() {
     this.state.fill(0), this.pos = 0, this.curFlags = 0, this.posBegin = 0;
   }
 }
-class Et {
+class Ot {
   constructor(e) {
-    this.strobe = new pe("Merlin v1.0"), this.appendMessage("dom-sep", e);
+    this.strobe = new be("Merlin v1.0"), this.appendMessage("dom-sep", e);
   }
   appendMessage(e, t) {
-    this.strobe.metaAD(e, !1), M("Merlin.appendMessage", t.length), this.strobe.metaAD(m(t.length, 4), !0), this.strobe.AD(t, !1);
+    this.strobe.metaAD(e, !1), q("Merlin.appendMessage", t.length), this.strobe.metaAD(y(t.length, 4), !0), this.strobe.AD(t, !1);
   }
   challengeBytes(e, t) {
-    return this.strobe.metaAD(e, !1), M("Merlin.challengeBytes", t), this.strobe.metaAD(m(t, 4), !0), this.strobe.PRF(t, !1);
+    return this.strobe.metaAD(e, !1), q("Merlin.challengeBytes", t), this.strobe.metaAD(y(t, 4), !0), this.strobe.PRF(t, !1);
   }
   clean() {
     this.strobe.clean();
   }
 }
-class S extends Et {
-  constructor(e, t = x) {
+class R extends Ot {
+  constructor(e, t = U) {
     super(e), this.rng = t;
   }
   label(e) {
@@ -863,149 +769,151 @@ class S extends Et {
     this.appendMessage(e, t.toRawBytes());
   }
   challengeScalar(e) {
-    return P(A(this.challengeBytes(e, 64)));
+    return j(S(this.challengeBytes(e, 64)));
   }
   witnessScalar(e, t = []) {
-    return P(A(this.witnessBytes(e, 64, t)));
+    return j(S(this.witnessBytes(e, 64, t)));
   }
   witnessBytes(e, t, n = []) {
-    M("SigningContext.witnessBytes", t);
+    q("SigningContext.witnessBytes", t);
     const o = this.strobe.clone();
-    for (const s of n)
-      o.metaAD(e, !1), M("SigningContext.witnessBytes nonce length", s.length), o.metaAD(m(s.length, 4), !0), o.KEY(s, !1);
-    const a = this.rng(32);
-    return o.metaAD("rng", !1), o.KEY(a, !1), o.metaAD(m(t, 4), !1), o.PRF(t, !1);
+    for (const i of n)
+      o.metaAD(e, !1), q("SigningContext.witnessBytes nonce length", i.length), o.metaAD(y(i.length, 4), !0), o.KEY(i, !1);
+    const s = this.rng(32);
+    return o.metaAD("rng", !1), o.KEY(s, !1), o.metaAD(y(t, 4), !1), o.PRF(t, !1);
   }
 }
-const xt = $r(256), Xe = (r) => m(r << Ze & xt, 32), B = (r) => A(r) >> Ze;
-function K(r) {
+const Ft = Hr(256), fr = (r) => y(r << hr & Ft, 32), $ = (r) => S(r) >> hr;
+function Y(r) {
   f("secretKey", r, 64);
-  const e = B(r.subarray(0, 32));
+  const e = $(r.subarray(0, 32));
   return g.BASE.multiply(e).toRawBytes();
 }
-function Qe(r) {
+function pr(r) {
   f("seed", r, 32);
-  const e = Ur(r);
+  const e = Tr(r);
   e[0] &= 248, e[31] &= 63, e[31] |= 64;
-  const t = Xe(B(e.subarray(0, 32))), n = e.subarray(32, 64), o = I(t, n);
-  return U(t, n, e), o;
+  const t = fr($(e.subarray(0, 32))), n = e.subarray(32, 64), o = D(t, n);
+  return B(t, n, e), o;
 }
-const er = ie("substrate");
-function At(r, e, t = x) {
+const gr = he("substrate");
+function Mt(r, e, t = U) {
   f("message", e), f("secretKey", r, 64);
-  const n = new S("SigningContext", t);
-  n.label(er), n.bytes(e);
-  const o = B(r.subarray(0, 32)), a = r.subarray(32, 64), s = g.fromHex(K(r));
-  n.protoName("Schnorr-sig"), n.commitPoint("sign:pk", s);
-  const i = n.witnessScalar("signing", [a]), l = g.BASE.multiply(i);
+  const n = new R("SigningContext", t);
+  n.label(gr), n.bytes(e);
+  const o = $(r.subarray(0, 32)), s = r.subarray(32, 64), i = g.fromHex(Y(r));
+  n.protoName("Schnorr-sig"), n.commitPoint("sign:pk", i);
+  const a = n.witnessScalar("signing", [s]), l = g.BASE.multiply(a);
   n.commitPoint("sign:R", l);
-  const c = n.challengeScalar("sign:c"), u = P(c * o + i), d = I(l.toRawBytes(), m(u, 32));
+  const c = n.challengeScalar("sign:c"), u = j(c * o + a), d = D(l.toRawBytes(), y(u, 32));
   return d[63] |= 128, n.clean(), d;
 }
-function Ut(r, e, t) {
+function qt(r, e, t) {
   if (f("message", r), f("signature", e, 64), f("publicKey", t, 32), (e[63] & 128) === 0)
     throw new Error("Schnorrkel marker missing");
   const n = Uint8Array.from(e.subarray(32, 64));
   n[31] &= 127;
-  const o = g.fromHex(e.subarray(0, 32)), a = A(n);
-  Ne("s", a, Ge, fe);
-  const s = new S("SigningContext");
-  s.label(er), s.bytes(r);
-  const i = g.fromHex(t);
-  if (i.equals(g.ZERO))
+  const o = g.fromHex(e.subarray(0, 32)), s = S(n);
+  _e("s", s, dr, we);
+  const i = new R("SigningContext");
+  i.label(gr), i.bytes(r);
+  const a = g.fromHex(t);
+  if (a.equals(g.ZERO))
     return !1;
-  s.protoName("Schnorr-sig"), s.commitPoint("sign:pk", i), s.commitPoint("sign:R", o);
-  const l = s.challengeScalar("sign:c"), c = g.BASE.multiply(a), u = i.negate().multiply(l).add(c);
-  return s.clean(), U(n), u.equals(o);
+  i.protoName("Schnorr-sig"), i.commitPoint("sign:pk", a), i.commitPoint("sign:R", o);
+  const l = i.challengeScalar("sign:c"), c = g.BASE.multiply(s), u = a.negate().multiply(l).add(c);
+  return i.clean(), B(n), u.equals(o);
 }
-const rr = {
-  secretSoft(r, e, t = x) {
+const mr = {
+  secretSoft(r, e, t = U) {
     f("secretKey", r, 64), f("chainCode", e, 32);
-    const n = B(r.subarray(0, 32)), o = r.subarray(32, 64), a = g.fromHex(K(r)), s = new S("SchnorrRistrettoHDKD", t);
-    s.bytes(E), s.appendMessage("chain-code", e), s.commitPoint("public-key", a);
-    const i = s.challengeScalar("HDKD-scalar"), l = s.challengeBytes("HDKD-chaincode", 32), c = I(m(n, 32), o), u = s.witnessBytes("HDKD-nonce", 32, [o, c]), d = Xe(P(n + i)), p = I(d, u);
-    return U(d, u, c, l), s.clean(), p;
+    const n = $(r.subarray(0, 32)), o = r.subarray(32, 64), s = g.fromHex(Y(r)), i = new R("SchnorrRistrettoHDKD", t);
+    i.bytes(x), i.appendMessage("chain-code", e), i.commitPoint("public-key", s);
+    const a = i.challengeScalar("HDKD-scalar"), l = i.challengeBytes("HDKD-chaincode", 32), c = D(y(n, 32), o), u = i.witnessBytes("HDKD-nonce", 32, [o, c]), d = fr(j(n + a)), p = D(d, u);
+    return B(d, u, c, l), i.clean(), p;
   },
   secretHard(r, e) {
     f("secretKey", r, 64), f("chainCode", e, 32);
-    const t = m(B(r.subarray(0, 32)), 32), n = new S("SchnorrRistrettoHDKD");
-    n.bytes(E), n.appendMessage("chain-code", e), n.appendMessage("secret-key", t);
-    const o = n.challengeBytes("HDKD-hard", 32), a = n.challengeBytes("HDKD-chaincode", 32);
+    const t = y($(r.subarray(0, 32)), 32), n = new R("SchnorrRistrettoHDKD");
+    n.bytes(x), n.appendMessage("chain-code", e), n.appendMessage("secret-key", t);
+    const o = n.challengeBytes("HDKD-hard", 32), s = n.challengeBytes("HDKD-chaincode", 32);
     n.clean();
-    const s = Qe(o);
-    return U(t, o, a), n.clean(), s;
+    const i = pr(o);
+    return B(t, o, s), n.clean(), i;
   }
-}, Ae = {
-  proove(r, e, t, n, o, a) {
+}, $e = {
+  proove(r, e, t, n, o, s) {
     n.protoName("DLEQProof"), n.commitPoint("vrf:h", o);
-    const s = n.witnessScalar("proving\x000", [e]), i = g.BASE.multiply(s);
-    n.commitPoint("vrf:R=g^r", i);
-    const l = o.multiply(s);
-    n.commitPoint("vrf:h^r", l), n.commitPoint("vrf:pk", t), n.commitPoint("vrf:h^sk", a);
-    const c = n.challengeScalar("prove"), u = P(s - c * r);
-    return { proof: { c, s: u }, proofBatchable: { R: i, Hr: l, s: u } };
+    const i = n.witnessScalar("proving\x000", [e]), a = g.BASE.multiply(i);
+    n.commitPoint("vrf:R=g^r", a);
+    const l = o.multiply(i);
+    n.commitPoint("vrf:h^r", l), n.commitPoint("vrf:pk", t), n.commitPoint("vrf:h^sk", s);
+    const c = n.challengeScalar("prove"), u = j(i - c * r);
+    return { proof: { c, s: u }, proofBatchable: { R: a, Hr: l, s: u } };
   },
   verify(r, e, t, n, o) {
     if (r.equals(g.ZERO))
       return !1;
     e.protoName("DLEQProof"), e.commitPoint("vrf:h", t);
-    const a = r.multiply(o.c).add(g.BASE.multiply(o.s));
-    e.commitPoint("vrf:R=g^r", a);
-    const s = n.multiply(o.c).add(t.multiply(o.s));
-    e.commitPoint("vrf:h^r", s), e.commitPoint("vrf:pk", r), e.commitPoint("vrf:h^sk", n);
-    const i = e.challengeScalar("prove");
-    return o.c === i ? { R: a, Hr: s, s: o.s } : !1;
+    const s = r.multiply(o.c).add(g.BASE.multiply(o.s));
+    e.commitPoint("vrf:R=g^r", s);
+    const i = n.multiply(o.c).add(t.multiply(o.s));
+    e.commitPoint("vrf:h^r", i), e.commitPoint("vrf:pk", r), e.commitPoint("vrf:h^sk", n);
+    const a = e.challengeScalar("prove");
+    return o.c === a ? { R: s, Hr: i, s: o.s } : !1;
   }
 };
-function Ue(r, e, t, n, o = x) {
-  const a = new S("SigningContext", o);
-  a.label(r), a.bytes(e), a.commitPoint("vrf-nm-pk", n);
-  const s = a.challengeBytes("VRFHash", 64), i = g.hashToCurve(s), l = new S("VRF", o);
-  return t.length && l.label(t), a.clean(), U(s), { input: i, t: l };
-}
-const tr = {
-  sign(r, e, t = E, n = E, o = x) {
+function Ne(r, e, t, n, o = U) {
+  const s = new R("SigningContext", o);
+  s.label(r), s.bytes(e), s.commitPoint("vrf-nm-pk", n);
+  const i = s.challengeBytes("VRFHash", 64), a = g.hashToCurve(i), l = new R("VRF", o);
+  return t.length && l.label(t), s.clean(), B(i), { input: a, t: l };
+}
+const yr = {
+  sign(r, e, t = x, n = x, o = U) {
     f("msg", r), f("secretKey", e, 64), f("ctx", t), f("extra", n);
-    const a = B(e.subarray(0, 32)), s = e.subarray(32, 64), i = g.fromHex(K(e)), { input: l, t: c } = Ue(t, r, n, i, o), u = l.multiply(a), d = { output: u }, { proof: p } = Ae.proove(a, s, i, c, l, u), b = m(p.c, 32), w = m(p.s, 32), dr = I(d.output.toRawBytes(), b, w);
-    return U(s, b, w), dr;
+    const s = $(e.subarray(0, 32)), i = e.subarray(32, 64), a = g.fromHex(Y(e)), { input: l, t: c } = Ne(t, r, n, a, o), u = l.multiply(s), d = { output: u }, { proof: p } = $e.proove(s, i, a, c, l, u), b = y(p.c, 32), w = y(p.s, 32), Pr = D(d.output.toRawBytes(), b, w);
+    return B(i, b, w), Pr;
   },
-  verify(r, e, t, n = E, o = E, a = x) {
+  verify(r, e, t, n = x, o = x, s = U) {
     f("msg", r), f("signature", e, 96), f("pubkey", t, 32), f("ctx", n), f("extra", o);
-    const s = g.fromHex(t);
-    if (s.equals(g.ZERO))
+    const i = g.fromHex(t);
+    if (i.equals(g.ZERO))
       return !1;
-    const i = {
-      c: xe("signature.c", e.subarray(32, 64)),
-      s: xe("signature.s", e.subarray(64, 96))
-    }, { input: l, t: c } = Ue(n, r, o, s, a), u = g.fromHex(e.subarray(0, 32));
+    const a = {
+      c: Re("signature.c", e.subarray(32, 64)),
+      s: Re("signature.s", e.subarray(64, 96))
+    }, { input: l, t: c } = Ne(n, r, o, i, s), u = g.fromHex(e.subarray(0, 32));
     if (u.equals(g.ZERO))
       throw new Error("vrf.verify: wrong output point (identity)");
-    return Ae.verify(s, c, l, u, i) !== !1;
+    return $e.verify(i, c, l, u, a) !== !1;
   }
-}, se = 64, St = 32, ee = se + St;
-function Bt(r) {
+}, de = 64, Vt = 32, ne = de + Vt;
+function Kt(r) {
   const e = h(r);
-  if (e.length !== ee)
-    throw new Error(`Expected keypair with ${ee} bytes, found ${e.length}`);
+  if (e.length !== ne)
+    throw new Error(
+      `Expected keypair with ${ne} bytes, found ${e.length}`
+    );
   return {
-    publicKey: e.slice(se, ee),
-    secretKey: e.slice(0, se)
+    publicKey: e.slice(de, ne),
+    secretKey: e.slice(0, de)
   };
 }
-function nr(r) {
+function wr(r) {
   return (e, t) => {
-    if (!$e(t) || t.length !== 32)
+    if (!ze(t) || t.length !== 32)
       throw new Error("Invalid chainCode passed to derive");
-    const n = r(e.secretKey, t), o = K(n);
-    return Bt(D(n, o));
+    const n = r(e.secretKey, t), o = Y(n);
+    return Kt(I(n, o));
   };
 }
-const _t = nr(rr.secretHard), Rt = nr(rr.secretSoft);
-function $t(r, { chainCode: e, isSoft: t }) {
-  return t ? Rt(r, e) : _t(r, e);
+const br = /* @__PURE__ */ wr(mr.secretHard), vr = /* @__PURE__ */ wr(mr.secretSoft);
+function kr(r, { chainCode: e, isSoft: t }) {
+  return t ? vr(r, e) : br(r, e);
 }
-const Se = {
-  sr25519: $t,
+const De = {
+  sr25519: kr,
   ecdsa: () => {
     throw new Error("ECDSA key derivation not implemented yet");
   },
@@ -1016,103 +924,108 @@ const Se = {
     throw new Error("Ethereum key derivation not implemented yet");
   }
 };
-function sn(r, e, t) {
+function Yt(r, e, t) {
   if (!t)
     throw new Error("Invalid type provided");
-  if (!Se[t])
+  if (!De[t])
     throw new Error(`Unsupported keypair type: ${t}`);
-  const n = Se[t];
+  const n = De[t];
   let o = r;
-  for (const a of e)
-    o = n(o, a);
+  for (const s of e)
+    o = n(o, s);
   return o;
 }
-function Dt(r, e = V(), t = 2048, n) {
-  const o = h(r), a = h(e);
+function Er(r, e = _(), t = 2048, n) {
+  const o = h(r), s = h(e);
   return {
-    password: Dr(Ir, o, a, { c: t, dkLen: 64 }),
+    password: Or(Fr, o, s, { c: t, dkLen: 64 }),
     rounds: t,
     salt: e
   };
 }
-const It = { 256: Nr }, Nt = It[256], or = "abandon|ability|able|about|above|absent|absorb|abstract|absurd|abuse|access|accident|account|accuse|achieve|acid|acoustic|acquire|across|act|action|actor|actress|actual|adapt|add|addict|address|adjust|admit|adult|advance|advice|aerobic|affair|afford|afraid|again|age|agent|agree|ahead|aim|air|airport|aisle|alarm|album|alcohol|alert|alien|all|alley|allow|almost|alone|alpha|already|also|alter|always|amateur|amazing|among|amount|amused|analyst|anchor|ancient|anger|angle|angry|animal|ankle|announce|annual|another|answer|antenna|antique|anxiety|any|apart|apology|appear|apple|approve|april|arch|arctic|area|arena|argue|arm|armed|armor|army|around|arrange|arrest|arrive|arrow|art|artefact|artist|artwork|ask|aspect|assault|asset|assist|assume|asthma|athlete|atom|attack|attend|attitude|attract|auction|audit|august|aunt|author|auto|autumn|average|avocado|avoid|awake|aware|away|awesome|awful|awkward|axis|baby|bachelor|bacon|badge|bag|balance|balcony|ball|bamboo|banana|banner|bar|barely|bargain|barrel|base|basic|basket|battle|beach|bean|beauty|because|become|beef|before|begin|behave|behind|believe|below|belt|bench|benefit|best|betray|better|between|beyond|bicycle|bid|bike|bind|biology|bird|birth|bitter|black|blade|blame|blanket|blast|bleak|bless|blind|blood|blossom|blouse|blue|blur|blush|board|boat|body|boil|bomb|bone|bonus|book|boost|border|boring|borrow|boss|bottom|bounce|box|boy|bracket|brain|brand|brass|brave|bread|breeze|brick|bridge|brief|bright|bring|brisk|broccoli|broken|bronze|broom|brother|brown|brush|bubble|buddy|budget|buffalo|build|bulb|bulk|bullet|bundle|bunker|burden|burger|burst|bus|business|busy|butter|buyer|buzz|cabbage|cabin|cable|cactus|cage|cake|call|calm|camera|camp|can|canal|cancel|candy|cannon|canoe|canvas|canyon|capable|capital|captain|car|carbon|card|cargo|carpet|carry|cart|case|cash|casino|castle|casual|cat|catalog|catch|category|cattle|caught|cause|caution|cave|ceiling|celery|cement|census|century|cereal|certain|chair|chalk|champion|change|chaos|chapter|charge|chase|chat|cheap|check|cheese|chef|cherry|chest|chicken|chief|child|chimney|choice|choose|chronic|chuckle|chunk|churn|cigar|cinnamon|circle|citizen|city|civil|claim|clap|clarify|claw|clay|clean|clerk|clever|click|client|cliff|climb|clinic|clip|clock|clog|close|cloth|cloud|clown|club|clump|cluster|clutch|coach|coast|coconut|code|coffee|coil|coin|collect|color|column|combine|come|comfort|comic|common|company|concert|conduct|confirm|congress|connect|consider|control|convince|cook|cool|copper|copy|coral|core|corn|correct|cost|cotton|couch|country|couple|course|cousin|cover|coyote|crack|cradle|craft|cram|crane|crash|crater|crawl|crazy|cream|credit|creek|crew|cricket|crime|crisp|critic|crop|cross|crouch|crowd|crucial|cruel|cruise|crumble|crunch|crush|cry|crystal|cube|culture|cup|cupboard|curious|current|curtain|curve|cushion|custom|cute|cycle|dad|damage|damp|dance|danger|daring|dash|daughter|dawn|day|deal|debate|debris|decade|december|decide|decline|decorate|decrease|deer|defense|define|defy|degree|delay|deliver|demand|demise|denial|dentist|deny|depart|depend|deposit|depth|deputy|derive|describe|desert|design|desk|despair|destroy|detail|detect|develop|device|devote|diagram|dial|diamond|diary|dice|diesel|diet|differ|digital|dignity|dilemma|dinner|dinosaur|direct|dirt|disagree|discover|disease|dish|dismiss|disorder|display|distance|divert|divide|divorce|dizzy|doctor|document|dog|doll|dolphin|domain|donate|donkey|donor|door|dose|double|dove|draft|dragon|drama|drastic|draw|dream|dress|drift|drill|drink|drip|drive|drop|drum|dry|duck|dumb|dune|during|dust|dutch|duty|dwarf|dynamic|eager|eagle|early|earn|earth|easily|east|easy|echo|ecology|economy|edge|edit|educate|effort|egg|eight|either|elbow|elder|electric|elegant|element|elephant|elevator|elite|else|embark|embody|embrace|emerge|emotion|employ|empower|empty|enable|enact|end|endless|endorse|enemy|energy|enforce|engage|engine|enhance|enjoy|enlist|enough|enrich|enroll|ensure|enter|entire|entry|envelope|episode|equal|equip|era|erase|erode|erosion|error|erupt|escape|essay|essence|estate|eternal|ethics|evidence|evil|evoke|evolve|exact|example|excess|exchange|excite|exclude|excuse|execute|exercise|exhaust|exhibit|exile|exist|exit|exotic|expand|expect|expire|explain|expose|express|extend|extra|eye|eyebrow|fabric|face|faculty|fade|faint|faith|fall|false|fame|family|famous|fan|fancy|fantasy|farm|fashion|fat|fatal|father|fatigue|fault|favorite|feature|february|federal|fee|feed|feel|female|fence|festival|fetch|fever|few|fiber|fiction|field|figure|file|film|filter|final|find|fine|finger|finish|fire|firm|first|fiscal|fish|fit|fitness|fix|flag|flame|flash|flat|flavor|flee|flight|flip|float|flock|floor|flower|fluid|flush|fly|foam|focus|fog|foil|fold|follow|food|foot|force|forest|forget|fork|fortune|forum|forward|fossil|foster|found|fox|fragile|frame|frequent|fresh|friend|fringe|frog|front|frost|frown|frozen|fruit|fuel|fun|funny|furnace|fury|future|gadget|gain|galaxy|gallery|game|gap|garage|garbage|garden|garlic|garment|gas|gasp|gate|gather|gauge|gaze|general|genius|genre|gentle|genuine|gesture|ghost|giant|gift|giggle|ginger|giraffe|girl|give|glad|glance|glare|glass|glide|glimpse|globe|gloom|glory|glove|glow|glue|goat|goddess|gold|good|goose|gorilla|gospel|gossip|govern|gown|grab|grace|grain|grant|grape|grass|gravity|great|green|grid|grief|grit|grocery|group|grow|grunt|guard|guess|guide|guilt|guitar|gun|gym|habit|hair|half|hammer|hamster|hand|happy|harbor|hard|harsh|harvest|hat|have|hawk|hazard|head|health|heart|heavy|hedgehog|height|hello|helmet|help|hen|hero|hidden|high|hill|hint|hip|hire|history|hobby|hockey|hold|hole|holiday|hollow|home|honey|hood|hope|horn|horror|horse|hospital|host|hotel|hour|hover|hub|huge|human|humble|humor|hundred|hungry|hunt|hurdle|hurry|hurt|husband|hybrid|ice|icon|idea|identify|idle|ignore|ill|illegal|illness|image|imitate|immense|immune|impact|impose|improve|impulse|inch|include|income|increase|index|indicate|indoor|industry|infant|inflict|inform|inhale|inherit|initial|inject|injury|inmate|inner|innocent|input|inquiry|insane|insect|inside|inspire|install|intact|interest|into|invest|invite|involve|iron|island|isolate|issue|item|ivory|jacket|jaguar|jar|jazz|jealous|jeans|jelly|jewel|job|join|joke|journey|joy|judge|juice|jump|jungle|junior|junk|just|kangaroo|keen|keep|ketchup|key|kick|kid|kidney|kind|kingdom|kiss|kit|kitchen|kite|kitten|kiwi|knee|knife|knock|know|lab|label|labor|ladder|lady|lake|lamp|language|laptop|large|later|latin|laugh|laundry|lava|law|lawn|lawsuit|layer|lazy|leader|leaf|learn|leave|lecture|left|leg|legal|legend|leisure|lemon|lend|length|lens|leopard|lesson|letter|level|liar|liberty|library|license|life|lift|light|like|limb|limit|link|lion|liquid|list|little|live|lizard|load|loan|lobster|local|lock|logic|lonely|long|loop|lottery|loud|lounge|love|loyal|lucky|luggage|lumber|lunar|lunch|luxury|lyrics|machine|mad|magic|magnet|maid|mail|main|major|make|mammal|man|manage|mandate|mango|mansion|manual|maple|marble|march|margin|marine|market|marriage|mask|mass|master|match|material|math|matrix|matter|maximum|maze|meadow|mean|measure|meat|mechanic|medal|media|melody|melt|member|memory|mention|menu|mercy|merge|merit|merry|mesh|message|metal|method|middle|midnight|milk|million|mimic|mind|minimum|minor|minute|miracle|mirror|misery|miss|mistake|mix|mixed|mixture|mobile|model|modify|mom|moment|monitor|monkey|monster|month|moon|moral|more|morning|mosquito|mother|motion|motor|mountain|mouse|move|movie|much|muffin|mule|multiply|muscle|museum|mushroom|music|must|mutual|myself|mystery|myth|naive|name|napkin|narrow|nasty|nation|nature|near|neck|need|negative|neglect|neither|nephew|nerve|nest|net|network|neutral|never|news|next|nice|night|noble|noise|nominee|noodle|normal|north|nose|notable|note|nothing|notice|novel|now|nuclear|number|nurse|nut|oak|obey|object|oblige|obscure|observe|obtain|obvious|occur|ocean|october|odor|off|offer|office|often|oil|okay|old|olive|olympic|omit|once|one|onion|online|only|open|opera|opinion|oppose|option|orange|orbit|orchard|order|ordinary|organ|orient|original|orphan|ostrich|other|outdoor|outer|output|outside|oval|oven|over|own|owner|oxygen|oyster|ozone|pact|paddle|page|pair|palace|palm|panda|panel|panic|panther|paper|parade|parent|park|parrot|party|pass|patch|path|patient|patrol|pattern|pause|pave|payment|peace|peanut|pear|peasant|pelican|pen|penalty|pencil|people|pepper|perfect|permit|person|pet|phone|photo|phrase|physical|piano|picnic|picture|piece|pig|pigeon|pill|pilot|pink|pioneer|pipe|pistol|pitch|pizza|place|planet|plastic|plate|play|please|pledge|pluck|plug|plunge|poem|poet|point|polar|pole|police|pond|pony|pool|popular|portion|position|possible|post|potato|pottery|poverty|powder|power|practice|praise|predict|prefer|prepare|present|pretty|prevent|price|pride|primary|print|priority|prison|private|prize|problem|process|produce|profit|program|project|promote|proof|property|prosper|protect|proud|provide|public|pudding|pull|pulp|pulse|pumpkin|punch|pupil|puppy|purchase|purity|purpose|purse|push|put|puzzle|pyramid|quality|quantum|quarter|question|quick|quit|quiz|quote|rabbit|raccoon|race|rack|radar|radio|rail|rain|raise|rally|ramp|ranch|random|range|rapid|rare|rate|rather|raven|raw|razor|ready|real|reason|rebel|rebuild|recall|receive|recipe|record|recycle|reduce|reflect|reform|refuse|region|regret|regular|reject|relax|release|relief|rely|remain|remember|remind|remove|render|renew|rent|reopen|repair|repeat|replace|report|require|rescue|resemble|resist|resource|response|result|retire|retreat|return|reunion|reveal|review|reward|rhythm|rib|ribbon|rice|rich|ride|ridge|rifle|right|rigid|ring|riot|ripple|risk|ritual|rival|river|road|roast|robot|robust|rocket|romance|roof|rookie|room|rose|rotate|rough|round|route|royal|rubber|rude|rug|rule|run|runway|rural|sad|saddle|sadness|safe|sail|salad|salmon|salon|salt|salute|same|sample|sand|satisfy|satoshi|sauce|sausage|save|say|scale|scan|scare|scatter|scene|scheme|school|science|scissors|scorpion|scout|scrap|screen|script|scrub|sea|search|season|seat|second|secret|section|security|seed|seek|segment|select|sell|seminar|senior|sense|sentence|series|service|session|settle|setup|seven|shadow|shaft|shallow|share|shed|shell|sheriff|shield|shift|shine|ship|shiver|shock|shoe|shoot|shop|short|shoulder|shove|shrimp|shrug|shuffle|shy|sibling|sick|side|siege|sight|sign|silent|silk|silly|silver|similar|simple|since|sing|siren|sister|situate|six|size|skate|sketch|ski|skill|skin|skirt|skull|slab|slam|sleep|slender|slice|slide|slight|slim|slogan|slot|slow|slush|small|smart|smile|smoke|smooth|snack|snake|snap|sniff|snow|soap|soccer|social|sock|soda|soft|solar|soldier|solid|solution|solve|someone|song|soon|sorry|sort|soul|sound|soup|source|south|space|spare|spatial|spawn|speak|special|speed|spell|spend|sphere|spice|spider|spike|spin|spirit|split|spoil|sponsor|spoon|sport|spot|spray|spread|spring|spy|square|squeeze|squirrel|stable|stadium|staff|stage|stairs|stamp|stand|start|state|stay|steak|steel|stem|step|stereo|stick|still|sting|stock|stomach|stone|stool|story|stove|strategy|street|strike|strong|struggle|student|stuff|stumble|style|subject|submit|subway|success|such|sudden|suffer|sugar|suggest|suit|summer|sun|sunny|sunset|super|supply|supreme|sure|surface|surge|surprise|surround|survey|suspect|sustain|swallow|swamp|swap|swarm|swear|sweet|swift|swim|swing|switch|sword|symbol|symptom|syrup|system|table|tackle|tag|tail|talent|talk|tank|tape|target|task|taste|tattoo|taxi|teach|team|tell|ten|tenant|tennis|tent|term|test|text|thank|that|theme|then|theory|there|they|thing|this|thought|three|thrive|throw|thumb|thunder|ticket|tide|tiger|tilt|timber|time|tiny|tip|tired|tissue|title|toast|tobacco|today|toddler|toe|together|toilet|token|tomato|tomorrow|tone|tongue|tonight|tool|tooth|top|topic|topple|torch|tornado|tortoise|toss|total|tourist|toward|tower|town|toy|track|trade|traffic|tragic|train|transfer|trap|trash|travel|tray|treat|tree|trend|trial|tribe|trick|trigger|trim|trip|trophy|trouble|truck|true|truly|trumpet|trust|truth|try|tube|tuition|tumble|tuna|tunnel|turkey|turn|turtle|twelve|twenty|twice|twin|twist|two|type|typical|ugly|umbrella|unable|unaware|uncle|uncover|under|undo|unfair|unfold|unhappy|uniform|unique|unit|universe|unknown|unlock|until|unusual|unveil|update|upgrade|uphold|upon|upper|upset|urban|urge|usage|use|used|useful|useless|usual|utility|vacant|vacuum|vague|valid|valley|valve|van|vanish|vapor|various|vast|vault|vehicle|velvet|vendor|venture|venue|verb|verify|version|very|vessel|veteran|viable|vibrant|vicious|victory|video|view|village|vintage|violin|virtual|virus|visa|visit|visual|vital|vivid|vocal|voice|void|volcano|volume|vote|voyage|wage|wagon|wait|walk|wall|walnut|want|warfare|warm|warrior|wash|wasp|waste|water|wave|way|wealth|weapon|wear|weasel|weather|web|wedding|weekend|weird|welcome|west|wet|whale|what|wheat|wheel|when|where|whip|whisper|wide|width|wife|wild|will|win|window|wine|wing|wink|winner|winter|wire|wisdom|wise|wish|witness|wolf|woman|wonder|wood|wool|word|work|world|worry|worth|wrap|wreck|wrestle|wrist|write|wrong|yard|year|yellow|you|young|youth|zebra|zero|zone|zoo".split("|"), Be = "Invalid mnemonic", ar = "Invalid entropy", Pt = "Invalid mnemonic checksum";
-function Tt(r) {
+const xr = { 256: Mr }, Ar = xr[256], Ur = "abandon|ability|able|about|above|absent|absorb|abstract|absurd|abuse|access|accident|account|accuse|achieve|acid|acoustic|acquire|across|act|action|actor|actress|actual|adapt|add|addict|address|adjust|admit|adult|advance|advice|aerobic|affair|afford|afraid|again|age|agent|agree|ahead|aim|air|airport|aisle|alarm|album|alcohol|alert|alien|all|alley|allow|almost|alone|alpha|already|also|alter|always|amateur|amazing|among|amount|amused|analyst|anchor|ancient|anger|angle|angry|animal|ankle|announce|annual|another|answer|antenna|antique|anxiety|any|apart|apology|appear|apple|approve|april|arch|arctic|area|arena|argue|arm|armed|armor|army|around|arrange|arrest|arrive|arrow|art|artefact|artist|artwork|ask|aspect|assault|asset|assist|assume|asthma|athlete|atom|attack|attend|attitude|attract|auction|audit|august|aunt|author|auto|autumn|average|avocado|avoid|awake|aware|away|awesome|awful|awkward|axis|baby|bachelor|bacon|badge|bag|balance|balcony|ball|bamboo|banana|banner|bar|barely|bargain|barrel|base|basic|basket|battle|beach|bean|beauty|because|become|beef|before|begin|behave|behind|believe|below|belt|bench|benefit|best|betray|better|between|beyond|bicycle|bid|bike|bind|biology|bird|birth|bitter|black|blade|blame|blanket|blast|bleak|bless|blind|blood|blossom|blouse|blue|blur|blush|board|boat|body|boil|bomb|bone|bonus|book|boost|border|boring|borrow|boss|bottom|bounce|box|boy|bracket|brain|brand|brass|brave|bread|breeze|brick|bridge|brief|bright|bring|brisk|broccoli|broken|bronze|broom|brother|brown|brush|bubble|buddy|budget|buffalo|build|bulb|bulk|bullet|bundle|bunker|burden|burger|burst|bus|business|busy|butter|buyer|buzz|cabbage|cabin|cable|cactus|cage|cake|call|calm|camera|camp|can|canal|cancel|candy|cannon|canoe|canvas|canyon|capable|capital|captain|car|carbon|card|cargo|carpet|carry|cart|case|cash|casino|castle|casual|cat|catalog|catch|category|cattle|caught|cause|caution|cave|ceiling|celery|cement|census|century|cereal|certain|chair|chalk|champion|change|chaos|chapter|charge|chase|chat|cheap|check|cheese|chef|cherry|chest|chicken|chief|child|chimney|choice|choose|chronic|chuckle|chunk|churn|cigar|cinnamon|circle|citizen|city|civil|claim|clap|clarify|claw|clay|clean|clerk|clever|click|client|cliff|climb|clinic|clip|clock|clog|close|cloth|cloud|clown|club|clump|cluster|clutch|coach|coast|coconut|code|coffee|coil|coin|collect|color|column|combine|come|comfort|comic|common|company|concert|conduct|confirm|congress|connect|consider|control|convince|cook|cool|copper|copy|coral|core|corn|correct|cost|cotton|couch|country|couple|course|cousin|cover|coyote|crack|cradle|craft|cram|crane|crash|crater|crawl|crazy|cream|credit|creek|crew|cricket|crime|crisp|critic|crop|cross|crouch|crowd|crucial|cruel|cruise|crumble|crunch|crush|cry|crystal|cube|culture|cup|cupboard|curious|current|curtain|curve|cushion|custom|cute|cycle|dad|damage|damp|dance|danger|daring|dash|daughter|dawn|day|deal|debate|debris|decade|december|decide|decline|decorate|decrease|deer|defense|define|defy|degree|delay|deliver|demand|demise|denial|dentist|deny|depart|depend|deposit|depth|deputy|derive|describe|desert|design|desk|despair|destroy|detail|detect|develop|device|devote|diagram|dial|diamond|diary|dice|diesel|diet|differ|digital|dignity|dilemma|dinner|dinosaur|direct|dirt|disagree|discover|disease|dish|dismiss|disorder|display|distance|divert|divide|divorce|dizzy|doctor|document|dog|doll|dolphin|domain|donate|donkey|donor|door|dose|double|dove|draft|dragon|drama|drastic|draw|dream|dress|drift|drill|drink|drip|drive|drop|drum|dry|duck|dumb|dune|during|dust|dutch|duty|dwarf|dynamic|eager|eagle|early|earn|earth|easily|east|easy|echo|ecology|economy|edge|edit|educate|effort|egg|eight|either|elbow|elder|electric|elegant|element|elephant|elevator|elite|else|embark|embody|embrace|emerge|emotion|employ|empower|empty|enable|enact|end|endless|endorse|enemy|energy|enforce|engage|engine|enhance|enjoy|enlist|enough|enrich|enroll|ensure|enter|entire|entry|envelope|episode|equal|equip|era|erase|erode|erosion|error|erupt|escape|essay|essence|estate|eternal|ethics|evidence|evil|evoke|evolve|exact|example|excess|exchange|excite|exclude|excuse|execute|exercise|exhaust|exhibit|exile|exist|exit|exotic|expand|expect|expire|explain|expose|express|extend|extra|eye|eyebrow|fabric|face|faculty|fade|faint|faith|fall|false|fame|family|famous|fan|fancy|fantasy|farm|fashion|fat|fatal|father|fatigue|fault|favorite|feature|february|federal|fee|feed|feel|female|fence|festival|fetch|fever|few|fiber|fiction|field|figure|file|film|filter|final|find|fine|finger|finish|fire|firm|first|fiscal|fish|fit|fitness|fix|flag|flame|flash|flat|flavor|flee|flight|flip|float|flock|floor|flower|fluid|flush|fly|foam|focus|fog|foil|fold|follow|food|foot|force|forest|forget|fork|fortune|forum|forward|fossil|foster|found|fox|fragile|frame|frequent|fresh|friend|fringe|frog|front|frost|frown|frozen|fruit|fuel|fun|funny|furnace|fury|future|gadget|gain|galaxy|gallery|game|gap|garage|garbage|garden|garlic|garment|gas|gasp|gate|gather|gauge|gaze|general|genius|genre|gentle|genuine|gesture|ghost|giant|gift|giggle|ginger|giraffe|girl|give|glad|glance|glare|glass|glide|glimpse|globe|gloom|glory|glove|glow|glue|goat|goddess|gold|good|goose|gorilla|gospel|gossip|govern|gown|grab|grace|grain|grant|grape|grass|gravity|great|green|grid|grief|grit|grocery|group|grow|grunt|guard|guess|guide|guilt|guitar|gun|gym|habit|hair|half|hammer|hamster|hand|happy|harbor|hard|harsh|harvest|hat|have|hawk|hazard|head|health|heart|heavy|hedgehog|height|hello|helmet|help|hen|hero|hidden|high|hill|hint|hip|hire|history|hobby|hockey|hold|hole|holiday|hollow|home|honey|hood|hope|horn|horror|horse|hospital|host|hotel|hour|hover|hub|huge|human|humble|humor|hundred|hungry|hunt|hurdle|hurry|hurt|husband|hybrid|ice|icon|idea|identify|idle|ignore|ill|illegal|illness|image|imitate|immense|immune|impact|impose|improve|impulse|inch|include|income|increase|index|indicate|indoor|industry|infant|inflict|inform|inhale|inherit|initial|inject|injury|inmate|inner|innocent|input|inquiry|insane|insect|inside|inspire|install|intact|interest|into|invest|invite|involve|iron|island|isolate|issue|item|ivory|jacket|jaguar|jar|jazz|jealous|jeans|jelly|jewel|job|join|joke|journey|joy|judge|juice|jump|jungle|junior|junk|just|kangaroo|keen|keep|ketchup|key|kick|kid|kidney|kind|kingdom|kiss|kit|kitchen|kite|kitten|kiwi|knee|knife|knock|know|lab|label|labor|ladder|lady|lake|lamp|language|laptop|large|later|latin|laugh|laundry|lava|law|lawn|lawsuit|layer|lazy|leader|leaf|learn|leave|lecture|left|leg|legal|legend|leisure|lemon|lend|length|lens|leopard|lesson|letter|level|liar|liberty|library|license|life|lift|light|like|limb|limit|link|lion|liquid|list|little|live|lizard|load|loan|lobster|local|lock|logic|lonely|long|loop|lottery|loud|lounge|love|loyal|lucky|luggage|lumber|lunar|lunch|luxury|lyrics|machine|mad|magic|magnet|maid|mail|main|major|make|mammal|man|manage|mandate|mango|mansion|manual|maple|marble|march|margin|marine|market|marriage|mask|mass|master|match|material|math|matrix|matter|maximum|maze|meadow|mean|measure|meat|mechanic|medal|media|melody|melt|member|memory|mention|menu|mercy|merge|merit|merry|mesh|message|metal|method|middle|midnight|milk|million|mimic|mind|minimum|minor|minute|miracle|mirror|misery|miss|mistake|mix|mixed|mixture|mobile|model|modify|mom|moment|monitor|monkey|monster|month|moon|moral|more|morning|mosquito|mother|motion|motor|mountain|mouse|move|movie|much|muffin|mule|multiply|muscle|museum|mushroom|music|must|mutual|myself|mystery|myth|naive|name|napkin|narrow|nasty|nation|nature|near|neck|need|negative|neglect|neither|nephew|nerve|nest|net|network|neutral|never|news|next|nice|night|noble|noise|nominee|noodle|normal|north|nose|notable|note|nothing|notice|novel|now|nuclear|number|nurse|nut|oak|obey|object|oblige|obscure|observe|obtain|obvious|occur|ocean|october|odor|off|offer|office|often|oil|okay|old|olive|olympic|omit|once|one|onion|online|only|open|opera|opinion|oppose|option|orange|orbit|orchard|order|ordinary|organ|orient|original|orphan|ostrich|other|outdoor|outer|output|outside|oval|oven|over|own|owner|oxygen|oyster|ozone|pact|paddle|page|pair|palace|palm|panda|panel|panic|panther|paper|parade|parent|park|parrot|party|pass|patch|path|patient|patrol|pattern|pause|pave|payment|peace|peanut|pear|peasant|pelican|pen|penalty|pencil|people|pepper|perfect|permit|person|pet|phone|photo|phrase|physical|piano|picnic|picture|piece|pig|pigeon|pill|pilot|pink|pioneer|pipe|pistol|pitch|pizza|place|planet|plastic|plate|play|please|pledge|pluck|plug|plunge|poem|poet|point|polar|pole|police|pond|pony|pool|popular|portion|position|possible|post|potato|pottery|poverty|powder|power|practice|praise|predict|prefer|prepare|present|pretty|prevent|price|pride|primary|print|priority|prison|private|prize|problem|process|produce|profit|program|project|promote|proof|property|prosper|protect|proud|provide|public|pudding|pull|pulp|pulse|pumpkin|punch|pupil|puppy|purchase|purity|purpose|purse|push|put|puzzle|pyramid|quality|quantum|quarter|question|quick|quit|quiz|quote|rabbit|raccoon|race|rack|radar|radio|rail|rain|raise|rally|ramp|ranch|random|range|rapid|rare|rate|rather|raven|raw|razor|ready|real|reason|rebel|rebuild|recall|receive|recipe|record|recycle|reduce|reflect|reform|refuse|region|regret|regular|reject|relax|release|relief|rely|remain|remember|remind|remove|render|renew|rent|reopen|repair|repeat|replace|report|require|rescue|resemble|resist|resource|response|result|retire|retreat|return|reunion|reveal|review|reward|rhythm|rib|ribbon|rice|rich|ride|ridge|rifle|right|rigid|ring|riot|ripple|risk|ritual|rival|river|road|roast|robot|robust|rocket|romance|roof|rookie|room|rose|rotate|rough|round|route|royal|rubber|rude|rug|rule|run|runway|rural|sad|saddle|sadness|safe|sail|salad|salmon|salon|salt|salute|same|sample|sand|satisfy|satoshi|sauce|sausage|save|say|scale|scan|scare|scatter|scene|scheme|school|science|scissors|scorpion|scout|scrap|screen|script|scrub|sea|search|season|seat|second|secret|section|security|seed|seek|segment|select|sell|seminar|senior|sense|sentence|series|service|session|settle|setup|seven|shadow|shaft|shallow|share|shed|shell|sheriff|shield|shift|shine|ship|shiver|shock|shoe|shoot|shop|short|shoulder|shove|shrimp|shrug|shuffle|shy|sibling|sick|side|siege|sight|sign|silent|silk|silly|silver|similar|simple|since|sing|siren|sister|situate|six|size|skate|sketch|ski|skill|skin|skirt|skull|slab|slam|sleep|slender|slice|slide|slight|slim|slogan|slot|slow|slush|small|smart|smile|smoke|smooth|snack|snake|snap|sniff|snow|soap|soccer|social|sock|soda|soft|solar|soldier|solid|solution|solve|someone|song|soon|sorry|sort|soul|sound|soup|source|south|space|spare|spatial|spawn|speak|special|speed|spell|spend|sphere|spice|spider|spike|spin|spirit|split|spoil|sponsor|spoon|sport|spot|spray|spread|spring|spy|square|squeeze|squirrel|stable|stadium|staff|stage|stairs|stamp|stand|start|state|stay|steak|steel|stem|step|stereo|stick|still|sting|stock|stomach|stone|stool|story|stove|strategy|street|strike|strong|struggle|student|stuff|stumble|style|subject|submit|subway|success|such|sudden|suffer|sugar|suggest|suit|summer|sun|sunny|sunset|super|supply|supreme|sure|surface|surge|surprise|surround|survey|suspect|sustain|swallow|swamp|swap|swarm|swear|sweet|swift|swim|swing|switch|sword|symbol|symptom|syrup|system|table|tackle|tag|tail|talent|talk|tank|tape|target|task|taste|tattoo|taxi|teach|team|tell|ten|tenant|tennis|tent|term|test|text|thank|that|theme|then|theory|there|they|thing|this|thought|three|thrive|throw|thumb|thunder|ticket|tide|tiger|tilt|timber|time|tiny|tip|tired|tissue|title|toast|tobacco|today|toddler|toe|together|toilet|token|tomato|tomorrow|tone|tongue|tonight|tool|tooth|top|topic|topple|torch|tornado|tortoise|toss|total|tourist|toward|tower|town|toy|track|trade|traffic|tragic|train|transfer|trap|trash|travel|tray|treat|tree|trend|trial|tribe|trick|trigger|trim|trip|trophy|trouble|truck|true|truly|trumpet|trust|truth|try|tube|tuition|tumble|tuna|tunnel|turkey|turn|turtle|twelve|twenty|twice|twin|twist|two|type|typical|ugly|umbrella|unable|unaware|uncle|uncover|under|undo|unfair|unfold|unhappy|uniform|unique|unit|universe|unknown|unlock|until|unusual|unveil|update|upgrade|uphold|upon|upper|upset|urban|urge|usage|use|used|useful|useless|usual|utility|vacant|vacuum|vague|valid|valley|valve|van|vanish|vapor|various|vast|vault|vehicle|velvet|vendor|venture|venue|verb|verify|version|very|vessel|veteran|viable|vibrant|vicious|victory|video|view|village|vintage|violin|virtual|virus|visa|visit|visual|vital|vivid|vocal|voice|void|volcano|volume|vote|voyage|wage|wagon|wait|walk|wall|walnut|want|warfare|warm|warrior|wash|wasp|waste|water|wave|way|wealth|weapon|wear|weasel|weather|web|wedding|weekend|weird|welcome|west|wet|whale|what|wheat|wheel|when|where|whip|whisper|wide|width|wife|wild|will|win|window|wine|wing|wink|winner|winter|wire|wisdom|wise|wish|witness|wolf|woman|wonder|wood|wool|word|work|world|worry|worth|wrap|wreck|wrestle|wrist|write|wrong|yard|year|yellow|you|young|youth|zebra|zero|zone|zoo".split(
+  "|"
+), Ie = "Invalid mnemonic", Sr = "Invalid entropy", Wt = "Invalid mnemonic checksum";
+function Jt(r) {
   return (r || "").normalize("NFKD");
 }
-function sr(r) {
+function Br(r) {
   return Number.parseInt(r, 2);
 }
-function ir(r) {
+function Rr(r) {
   return r.map((e) => e.toString(2).padStart(8, "0")).join("");
 }
-function cr(r) {
-  return ir(Array.from(Nt(r))).slice(0, r.length * 8 / 32);
+function $r(r) {
+  return Rr(Array.from(Ar(r))).slice(
+    0,
+    r.length * 8 / 32
+  );
 }
-function ge(r, e = or) {
-  const t = Tt(r).split(" ");
+function Nr(r, e = Ur) {
+  const t = Jt(r).split(" ");
   if (t.length % 3 !== 0)
-    throw new Error(Be);
+    throw new Error(Ie);
   const n = t.map((u) => {
     const d = e.indexOf(u);
     if (d === -1)
-      throw new Error(Be);
+      throw new Error(Ie);
     return d.toString(2).padStart(11, "0");
-  }).join(""), o = Math.floor(n.length / 33) * 32, a = n.slice(0, o), s = n.slice(o), i = a.match(/(.{1,8})/g), l = i == null ? void 0 : i.map(sr);
+  }).join(""), o = Math.floor(n.length / 33) * 32, s = n.slice(0, o), i = n.slice(o), a = s.match(/(.{1,8})/g), l = a == null ? void 0 : a.map(Br);
   if (!l || l.length % 4 !== 0 || l.length < 16 || l.length > 32)
-    throw new Error(ar);
+    throw new Error(Sr);
   const c = h(l);
-  if (cr(c) !== s)
-    throw new Error(Pt);
+  if ($r(c) !== i)
+    throw new Error(Wt);
   return c;
 }
-function jt(r, e = or) {
+function Zt(r, e = Ur) {
   if (r.length % 4 !== 0 || r.length < 16 || r.length > 32)
-    throw new Error(ar);
-  const t = `${ir(Array.from(r))}${cr(r)}`.match(/(.{1,11})/g), n = t == null ? void 0 : t.map((o) => e[sr(o)]);
+    throw new Error(Sr);
+  const t = `${Rr(Array.from(r))}${$r(r)}`.match(
+    /(.{1,11})/g
+  ), n = t == null ? void 0 : t.map((o) => e[Br(o)]);
   if (!n || n.length < 12)
     throw new Error("Unable to map entropy to mnemonic");
   return n.join(" ");
 }
-function lr(r, e) {
+function Gt(r, e) {
   try {
-    ge(r, e);
+    Nr(r, e);
   } catch {
     return !1;
   }
   return !0;
 }
-const cn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
-  __proto__: null,
-  entropyToMnemonic: jt,
-  mnemonicToEntropy: ge,
-  validateMnemonic: lr
-}, Symbol.toStringTag, { value: "Module" }));
-function zt(r, e, t) {
-  return ge(r, e);
+function Dr(r, e, t) {
+  return Nr(r, e);
 }
-function Ct(r, e) {
-  return lr(r, e);
+function Ir(r, e) {
+  return Gt(r, e);
 }
-function ln(r, e = "", t, n) {
-  if (!Ct(r, t))
+function Xt(r, e = "", t, n) {
+  if (!Ir(r, t))
     throw new Error("Invalid bip39 mnemonic specified");
-  const o = zt(r, t), a = q(`mnemonic${e}`);
-  return Dt(o, a).password.slice(0, 32);
+  const o = Dr(r, t), s = V(`mnemonic${e}`);
+  return Er(o, s).password.slice(0, 32);
 }
-function un(r, e) {
+function Qt(r, e) {
   if (![33, 65].includes(r.length))
-    throw new Error(`Invalid publicKey provided, received ${r.length} bytes input`);
-  return r.length === 33 ? r : Pr.ProjectivePoint.fromHex(r).toRawBytes(!0);
-}
-function ur(r, e, t) {
-  const n = h(r), o = h(e), a = h(t);
-  if (a.length !== 32)
+    throw new Error(
+      `Invalid publicKey provided, received ${r.length} bytes input`
+    );
+  return r.length === 33 ? r : qr.ProjectivePoint.fromHex(r).toRawBytes(!0);
+}
+function ve(r, e, t) {
+  const n = h(r), o = h(e), s = h(t);
+  if (s.length !== 32)
     throw new Error("Invalid publicKey length, expected 32 bytes");
   if (o.length !== 64)
     throw new Error("Invalid signature length, expected 64 bytes");
-  return Ut(n, o, a);
+  return qt(n, o, s);
 }
-const Ot = [
+const en = [
+  //["ecdsa", secp256k1VerifyHasher("blake2")],
+  //["ethereum", secp256k1VerifyHasher("keccak")],
   [
     "ecdsa",
     () => {
@@ -1125,132 +1038,190 @@ const Ot = [
       throw new Error("Not Implemented");
     }
   ]
-], Lt = [
+], rn = [
+  //["ed25519", ed25519Verify],
   [
     "ed25519",
     () => {
       throw new Error("Not Implemented");
     }
   ],
-  ["sr25519", ur],
-  ...Ot
-], Ht = [
+  ["sr25519", ve],
+  ...en
+], tn = [
   "ed25519",
   "sr25519",
   "ecdsa"
 ];
-function Ft(r, { message: e, publicKey: t, signature: n }, o = Lt) {
-  return r.isValid = o.some(([a, s]) => {
+function nn(r, { message: e, publicKey: t, signature: n }, o = rn) {
+  return r.isValid = o.some(([s, i]) => {
     try {
-      if (s(e, n, t))
-        return r.crypto = a, !0;
+      if (i(e, n, t))
+        return r.crypto = s, !0;
     } catch {
     }
     return !1;
   }), r;
 }
-function Mt(r, { message: e, publicKey: t, signature: n }) {
+function on(r, { message: e, publicKey: t, signature: n }) {
   const o = n[0];
   if (o === void 0)
-    throw new Error("Invalid signature, expected first byte to indicate crypto type");
+    throw new Error(
+      "Invalid signature, expected first byte to indicate crypto type"
+    );
   if (![0, 1, 2].includes(o))
-    throw new Error(`Unknown crypto type, expected signature prefix [0..2], found ${n[0]}`);
-  const a = Ht[o];
-  if (!a)
+    throw new Error(
+      `Unknown crypto type, expected signature prefix [0..2], found ${n[0]}`
+    );
+  const s = tn[o];
+  if (!s)
     throw new Error(`Unknown crypto type, found ${o}`);
-  r.crypto = a;
+  r.crypto = s;
   try {
     r.isValid = {
-      sr25519: () => ur(e, n.subarray(1), t),
+      sr25519: () => ve(e, n.subarray(1), t),
       ecdsa: () => !1,
       ethereum: () => !1,
       ed25519: () => !1
-    }[a]();
+    }[s]();
   } catch {
   }
   return r;
 }
-function qt(r) {
+function sn(r) {
   const e = r[0];
-  if (!e)
-    throw new Error("Invalid signature, expected first byte to indicate crypto type");
-  return [0, 1, 2].includes(e) && [65, 66].includes(r.length) ? Mt : Ft;
+  if (e === void 0)
+    throw new Error(
+      "Invalid signature, expected first byte to indicate crypto type"
+    );
+  return [0, 1, 2].includes(e) && [65, 66].includes(r.length) ? on : nn;
 }
-function dn(r, e, t) {
+function an(r, e, t) {
   const n = h(e);
   if (![64, 65, 66].includes(n.length))
-    throw new Error(`Invalid signature length, expected [64..66] bytes, found ${n.length}`);
-  const o = Ve(t), a = {
+    throw new Error(
+      `Invalid signature length, expected [64..66] bytes, found ${n.length}`
+    );
+  const o = ge(t), s = {
     message: h(r),
     publicKey: o,
     signature: n
-  }, s = {
+  }, i = {
     crypto: "none",
     isValid: !1,
-    isWrapped: ye(a.message, !0),
+    isWrapped: Ue(s.message, !0),
     publicKey: o
-  }, i = ye(a.message, !1), l = qt(n);
-  return l(s, a), s.crypto !== "none" || s.isWrapped && !i ? s : (a.message = i ? Er(a.message) : xr(a.message), l(s, a));
+  }, a = Ue(s.message, !1), l = sn(n);
+  return l(i, s), i.crypto !== "none" || i.isWrapped && !a ? i : (s.message = a ? rt(s.message) : tt(s.message), l(i, s));
 }
-function hn(r) {
+function cn(r) {
   const e = h(r);
   if (e.length !== 32)
     throw new Error(`Expected a seed of 32 bytes, found ${e.length}`);
-  const t = Qe(e), n = A(t.subarray(0, 32)) >> 3n, o = g.BASE.multiply(n).toRawBytes();
+  const t = pr(e), n = S(t.subarray(0, 32)) >> 3n, o = g.BASE.multiply(n).toRawBytes();
   return {
     publicKey: new Uint8Array(o),
     secretKey: new Uint8Array(t)
   };
 }
-function fn(r, { publicKey: e, secretKey: t }) {
+function ln(r, { publicKey: e, secretKey: t }) {
   const n = typeof r == "string" ? new TextEncoder().encode(r) : r, o = h(t);
   if (o.length !== 64)
-    throw new Error(`Expected secretKey to be 64 bytes, found ${o.length}`);
-  return At(o, n);
-}
-const _e = new Uint8Array();
-function pn(r, { secretKey: e }, t = _e, n = _e) {
-  const o = h(r), a = h(e), s = h(t), i = h(n);
-  if (a.length !== 64)
+    throw new Error(
+      `Expected secretKey to be 64 bytes, found ${o.length}`
+    );
+  return Mt(o, n);
+}
+const Pe = new Uint8Array();
+function un(r, { secretKey: e }, t = Pe, n = Pe) {
+  const o = h(r), s = h(e), i = h(t), a = h(n);
+  if (s.length !== 64)
     throw new Error("Invalid secretKey length, expected 64 bytes");
-  return tr.sign(o, a, s, i);
+  return yr.sign(o, s, i, a);
 }
-const Re = new Uint8Array();
-function gn(r, e, t, n = Re, o = Re) {
-  const a = h(r), s = h(e), i = h(t), l = h(n), c = h(o);
-  if (i.length !== 32)
+const je = new Uint8Array();
+function dn(r, e, t, n = je, o = je) {
+  const s = h(r), i = h(e), a = h(t), l = h(n), c = h(o);
+  if (a.length !== 32)
     throw new Error("Invalid publicKey length, expected 32 bytes");
-  if (s.length !== 96)
+  if (i.length !== 96)
     throw new Error("Invalid vrfSign output length, expected 96 bytes");
-  return tr.verify(a, s, i, l, c);
-}
+  return yr.verify(
+    s,
+    i,
+    a,
+    l,
+    c
+  );
+}
+const mn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  __proto__: null,
+  ENCODING: ye,
+  ENCODING_NONE: ir,
+  ENCODING_VERSION: cr,
+  NONCE_LENGTH: le,
+  SCRYPT_LENGTH: lr,
+  base58Decode: Je,
+  base58Encode: Ze,
+  base58Validate: We,
+  base64Decode: yt,
+  base64Encode: er,
+  base64Validate: Qe,
+  blake2AsHex: ft,
+  blake2AsU8a: K,
+  decodeAddress: ge,
+  encodeAddress: mt,
+  entropyToMnemonic: Zt,
+  jsonDecryptData: jt,
+  jsonEncryptFormat: Tt,
+  keyExtractPath: ur,
+  keyExtractSuri: Ht,
+  keyFromPath: Yt,
+  keyHdkdSr25519: kr,
+  mnemonicToEntropy: Dr,
+  mnemonicToMiniSecret: Xt,
+  mnemonicValidate: Ir,
+  naclDecrypt: or,
+  naclEncrypt: Dt,
+  pbkdf2Encode: Er,
+  randomAsHex: Nt,
+  randomAsU8a: _,
+  scryptEncode: sr,
+  scryptFromU8a: ar,
+  scryptToU8a: Pt,
+  secp256k1Compress: Qt,
+  sha256AsU8a: Ar,
+  shaAsU8a: xr,
+  signatureVerify: an,
+  sr25519DeriveHard: br,
+  sr25519DeriveSoft: vr,
+  sr25519FromSeed: cn,
+  sr25519Sign: ln,
+  sr25519Verify: ve,
+  sr25519VrfSign: un,
+  sr25519VrfVerify: dn
+}, Symbol.toStringTag, { value: "Module" }));
 export {
-  cn as A,
-  _,
-  Qt as a,
-  Wt as b,
-  rn as c,
-  gn as d,
-  pn as e,
-  dn as f,
-  un as g,
-  fn as h,
-  sn as i,
-  en as j,
-  vt as k,
-  hn as l,
-  Ve as m,
-  Xt as n,
-  Jt as o,
-  Ee as p,
-  Gt as q,
-  an as r,
-  dt as s,
-  ln as t,
-  ut as u,
-  Zt as v,
-  tn as w,
-  ke as x,
-  nn as y,
-  on as z
+  Pt as a,
+  ft as b,
+  Tt as c,
+  dn as d,
+  un as e,
+  an as f,
+  Qt as g,
+  ln as h,
+  Yt as i,
+  jt as j,
+  ur as k,
+  cn as l,
+  ge as m,
+  Dt as n,
+  mt as o,
+  yt as p,
+  Ht as q,
+  Xt as r,
+  sr as s,
+  $t as t,
+  Nt as u,
+  mn as v
 };