@prosopo/procaptcha-bundle 2.5.3 → 2.5.5

package/dist/bundle/{index-BMjJnq60.js → index-nNwZuute.js}

@@ -1,20 +1,20 @@
 var go = Object.defineProperty;
 var mo = (t, e, r) => e in t ? go(t, e, { enumerable: !0, configurable: !0, writable: !0, value: r }) : t[e] = r;
-var Kt = (t, e, r) => mo(t, typeof e != "symbol" ? e + "" : e, r);
-import { x as hi, s as ee, r as ci, d as po, f as b0, g as yo, h as vo, H as bo, n as Ft, u as Ve, i as Xe, b as je, e as kn, t as xo, j as Eo, o as Mo, k as _o, l as G } from "./toU8a-BWKf-2UU.js";
-import { b as Yr, B as W, c as Se, d as te, u as V, R as Bo, e as So, f as he, g as oe, j as Ht, i as Vt, s as Ao, k as Io, l as ko, m as Uo, n as No, o as Ro, p as Oo, q as Lo, r as To, v as $o, t as qo, x as Po, y as Co, z as Zo, A as Do, C as Ho, D as Vo, E as zo, F as Yo, G as Xo, H as jo, I as Ko, J as Go, K as Wo, L as Jo, M as Qo, N as Fo, O as ts, P as es, Q as rs } from "./hash-CtL1HOjf.js";
-import { g as ns, c as is } from "./_commonjsHelpers-DaMA6jEr.js";
+var jt = (t, e, r) => mo(t, typeof e != "symbol" ? e + "" : e, r);
+import { x as ci, s as ee, r as li, d as po, f as b0, g as yo, h as vo, H as bo, n as Ft, u as Ve, i as Xe, b as Ke, e as Un, t as xo, j as Eo, o as Mo, k as _o, l as G } from "./toU8a-BWKf-2UU.js";
+import { b as Yr, B as W, c as Se, d as te, u as V, R as Bo, e as So, f as he, g as oe, j as Ht, i as Vt, s as Ao, k as Io, l as ko, m as Uo, n as No, o as Ro, p as Oo, q as Lo, r as To, v as $o, t as qo, x as Po, y as Co, z as Zo, A as Do, C as Ho, D as Vo, E as zo, F as Yo, G as Xo, H as Ko, I as jo, J as Go, K as Wo, L as Jo, M as Qo, N as Fo, O as ts, P as es, Q as rs } from "./hash-D-64Vz5z.js";
+import { g as ns } from "./_commonjsHelpers-DaMA6jEr.js";
 import { s as rr } from "./sha256-Cxc9Hrlx.js";
-import { h as li, s as ui, m as os, v as ss, a as Un, p as fs, b as di } from "./bip39-CFjno8fK.js";
-import { a as wi } from "./asU8a-JliaME7-.js";
+import { h as ui, s as di, m as is, v as os, a as Nn, p as ss, b as wi } from "./bip39-DCaMcFzo.js";
+import { a as gi } from "./asU8a-CAsEnbuP.js";
 import { o as on } from "./spread-DEmVz7RJ.js";
-import { p as Ae } from "./emotion-element-5486c51c.browser.esm-Bywq83R5.js";
-const as = { name: "@polkadot/util", path: import.meta && import.meta.url ? new URL(import.meta.url).pathname.substring(0, new URL(import.meta.url).pathname.lastIndexOf("/") + 1) : "auto", type: "esm", version: "12.6.2" }, hs = "POLKADOTJS_DISABLE_ESM_CJS_WARNING";
-function cs(t) {
-  const e = hi;
+import { m as Ae } from "./emotion-element-5486c51c.browser.esm-CQHFV-dS.js";
+const fs = { name: "@polkadot/util", path: import.meta && import.meta.url ? new URL(import.meta.url).pathname.substring(0, new URL(import.meta.url).pathname.lastIndexOf("/") + 1) : "auto", type: "esm", version: "12.6.2" }, as = "POLKADOTJS_DISABLE_ESM_CJS_WARNING";
+function hs(t) {
+  const e = ci;
   return e.__polkadotjs || (e.__polkadotjs = {}), e.__polkadotjs[t] || (e.__polkadotjs[t] = []), e.__polkadotjs[t];
 }
-function ls(t, e) {
+function cs(t, e) {
   if (t)
     return t;
   if (Yr(e))
@@ -25,18 +25,18 @@ function ls(t, e) {
     }
   return e || "";
 }
-function us({ name: t, path: e, type: r, version: o }, c, i = []) {
+function ls({ name: t, path: e, type: r, version: o }, c, i = []) {
   var E, M;
   if (!t.startsWith("@polkadot"))
     throw new Error(`Invalid package descriptor ${t}`);
-  const w = cs(t);
-  w.push({ path: ls(e, c), type: r, version: o });
-  const d = w.every((U) => U.version === o), y = ((M = (E = hi.process) == null ? void 0 : E.env) == null ? void 0 : M[hs]) === "1";
+  const w = hs(t);
+  w.push({ path: cs(e, c), type: r, version: o });
+  const d = w.every((U) => U.version === o), y = ((M = (E = ci.process) == null ? void 0 : E.env) == null ? void 0 : M[as]) === "1";
   w.length !== 1 && !(y && d) || i.filter((U) => U && U.version !== o);
 }
-const Ke = /* @__PURE__ */ W(0), Ge = /* @__PURE__ */ W(1);
+const je = /* @__PURE__ */ W(0), Ge = /* @__PURE__ */ W(1);
 Number.MAX_SAFE_INTEGER;
-const Nn = W(256), Rn = W(256 * 256), ds = W("0x10000000000000000");
+const Rn = W(256), On = W(256 * 256), us = W("0x10000000000000000");
 function Xr(t, { isLe: e = !0, isNegative: r = !1 } = {}) {
   e || (t = t.slice().reverse());
   const o = t.length;
@@ -57,8 +57,8 @@ function Xr(t, { isLe: e = !0, isNegative: r = !1 } = {}) {
     let w = W(0);
     const d = o % 2;
     for (let y = o - 2; y >= d; y -= 2)
-      w = w * Rn + W(i.getUint16(y, !0) ^ 65535);
-    return d && (w = w * Nn + W(t[0] ^ 255)), w * -Ge - Ge;
+      w = w * On + W(i.getUint16(y, !0) ^ 65535);
+    return d && (w = w * Rn + W(t[0] ^ 255)), w * -Ge - Ge;
   }
   switch (o) {
     case 0:
@@ -75,20 +75,20 @@ function Xr(t, { isLe: e = !0, isNegative: r = !1 } = {}) {
     case 8:
       return c.getBigUint64(0, !0);
     case 16:
-      return c.getBigUint64(8, !0) * ds + c.getBigUint64(0, !0);
+      return c.getBigUint64(8, !0) * us + c.getBigUint64(0, !0);
     default: {
       let i = W(0);
       const w = o % 2;
       for (let d = o - 2; d >= w; d -= 2)
-        i = i * Rn + W(c.getUint16(d, !0));
-      return w && (i = i * Nn + W(t[0])), i;
+        i = i * On + W(c.getUint16(d, !0));
+      return w && (i = i * Rn + W(t[0])), i;
     }
   }
 }
-function ws(t, { isLe: e = !1, isNegative: r = !1 } = {}) {
+function ds(t, { isLe: e = !1, isNegative: r = !1 } = {}) {
   return !t || t === "0x" ? W(0) : Xr(Se(t), { isLe: e, isNegative: r });
 }
-var gi = { exports: {} };
+var sn = { exports: {} }, ws = sn.exports;
 (function(t) {
   (function(e, r) {
     function o(p, n) {
@@ -407,7 +407,7 @@ var gi = { exports: {} };
     }, i.prototype._zeroBits = function(n) {
       if (n === 0) return 26;
       var f = n, a = 0;
-      return f & 8191 || (a += 13, f >>>= 13), f & 127 || (a += 7, f >>>= 7), f & 15 || (a += 4, f >>>= 4), f & 3 || (a += 2, f >>>= 2), f & 1 || a++, a;
+      return (f & 8191) === 0 && (a += 13, f >>>= 13), (f & 127) === 0 && (a += 7, f >>>= 7), (f & 15) === 0 && (a += 4, f >>>= 4), (f & 3) === 0 && (a += 2, f >>>= 2), (f & 1) === 0 && a++, a;
     }, i.prototype.bitLength = function() {
       var n = this.words[this.length - 1], f = this._countBits(n);
       return (this.length - 1) * 26 + f;
@@ -542,15 +542,15 @@ var gi = { exports: {} };
       f.words[0] = b;
       for (var s = 1; s < a; s++) {
         for (var g = u >>> 26, B = u & 67108863, I = Math.min(s, n.length - 1), N = Math.max(0, s - p.length + 1); N <= I; N++) {
-          var j = s - N | 0;
-          h = p.words[j] | 0, l = n.words[N] | 0, m = h * l + B, g += m / 67108864 | 0, B = m & 67108863;
+          var K = s - N | 0;
+          h = p.words[K] | 0, l = n.words[N] | 0, m = h * l + B, g += m / 67108864 | 0, B = m & 67108863;
         }
         f.words[s] = B | 0, u = g | 0;
       }
       return u !== 0 ? f.words[s] = u | 0 : f.length--, f._strip();
     }
     var L = function(n, f, a) {
-      var h = n.words, l = f.words, m = a.words, b = 0, u, s, g, B = h[0] | 0, I = B & 8191, N = B >>> 13, j = h[1] | 0, H = j & 8191, z = j >>> 13, $t = h[2] | 0, X = $t & 8191, Y = $t >>> 13, Zt = h[3] | 0, Q = Zt & 8191, F = Zt >>> 13, $e = h[4] | 0, at = $e & 8191, ht = $e >>> 13, qe = h[5] | 0, et = qe & 8191, rt = qe >>> 13, ce = h[6] | 0, nt = ce & 8191, it = ce >>> 13, Ee = h[7] | 0, ot = Ee & 8191, st = Ee >>> 13, Pe = h[8] | 0, ct = Pe & 8191, lt = Pe >>> 13, Ce = h[9] | 0, dt = Ce & 8191, wt = Ce >>> 13, vn = l[0] | 0, gt = vn & 8191, mt = vn >>> 13, bn = l[1] | 0, pt = bn & 8191, yt = bn >>> 13, xn = l[2] | 0, vt = xn & 8191, bt = xn >>> 13, En = l[3] | 0, xt = En & 8191, Et = En >>> 13, Mn = l[4] | 0, Mt = Mn & 8191, _t = Mn >>> 13, _n = l[5] | 0, Bt = _n & 8191, St = _n >>> 13, Bn = l[6] | 0, At = Bn & 8191, It = Bn >>> 13, Sn = l[7] | 0, kt = Sn & 8191, Ut = Sn >>> 13, An = l[8] | 0, Nt = An & 8191, Rt = An >>> 13, In = l[9] | 0, Ot = In & 8191, Lt = In >>> 13;
+      var h = n.words, l = f.words, m = a.words, b = 0, u, s, g, B = h[0] | 0, I = B & 8191, N = B >>> 13, K = h[1] | 0, H = K & 8191, z = K >>> 13, $t = h[2] | 0, X = $t & 8191, Y = $t >>> 13, Zt = h[3] | 0, Q = Zt & 8191, F = Zt >>> 13, $e = h[4] | 0, at = $e & 8191, ht = $e >>> 13, qe = h[5] | 0, et = qe & 8191, rt = qe >>> 13, ce = h[6] | 0, nt = ce & 8191, it = ce >>> 13, Ee = h[7] | 0, ot = Ee & 8191, st = Ee >>> 13, Pe = h[8] | 0, ct = Pe & 8191, lt = Pe >>> 13, Ce = h[9] | 0, dt = Ce & 8191, wt = Ce >>> 13, bn = l[0] | 0, gt = bn & 8191, mt = bn >>> 13, xn = l[1] | 0, pt = xn & 8191, yt = xn >>> 13, En = l[2] | 0, vt = En & 8191, bt = En >>> 13, Mn = l[3] | 0, xt = Mn & 8191, Et = Mn >>> 13, _n = l[4] | 0, Mt = _n & 8191, _t = _n >>> 13, Bn = l[5] | 0, Bt = Bn & 8191, St = Bn >>> 13, Sn = l[6] | 0, At = Sn & 8191, It = Sn >>> 13, An = l[7] | 0, kt = An & 8191, Ut = An >>> 13, In = l[8] | 0, Nt = In & 8191, Rt = In >>> 13, kn = l[9] | 0, Ot = kn & 8191, Lt = kn >>> 13;
       a.negative = n.negative ^ f.negative, a.length = 19, u = Math.imul(I, gt), s = Math.imul(I, mt), s = s + Math.imul(N, gt) | 0, g = Math.imul(N, mt);
       var cr = (b + u | 0) + ((s & 8191) << 13) | 0;
       b = (g + (s >>> 13) | 0) + (cr >>> 26) | 0, cr &= 67108863, u = Math.imul(H, gt), s = Math.imul(H, mt), s = s + Math.imul(z, gt) | 0, g = Math.imul(z, mt), u = u + Math.imul(I, pt) | 0, s = s + Math.imul(I, yt) | 0, s = s + Math.imul(N, pt) | 0, g = g + Math.imul(N, yt) | 0;
@@ -598,8 +598,8 @@ var gi = { exports: {} };
         var m = h;
         h = 0;
         for (var b = a & 67108863, u = Math.min(l, n.length - 1), s = Math.max(0, l - p.length + 1); s <= u; s++) {
-          var g = l - s, B = p.words[g] | 0, I = n.words[s] | 0, N = B * I, j = N & 67108863;
-          m = m + (N / 67108864 | 0) | 0, j = j + b | 0, b = j & 67108863, m = m + (j >>> 26) | 0, h += m >>> 26, m &= 67108863;
+          var g = l - s, B = p.words[g] | 0, I = n.words[s] | 0, N = B * I, K = N & 67108863;
+          m = m + (N / 67108864 | 0) | 0, K = K + b | 0, b = K & 67108863, m = m + (K >>> 26) | 0, h += m >>> 26, m &= 67108863;
         }
         f.words[l] = b, a = m, m = h;
       }
@@ -786,7 +786,7 @@ var gi = { exports: {} };
       }) : this.negative === 0 && n.negative !== 0 ? (m = this.divmod(n.neg(), f), f !== "mod" && (h = m.div.neg()), {
         div: h,
         mod: m.mod
-      }) : this.negative & n.negative ? (m = this.neg().divmod(n.neg(), f), f !== "div" && (l = m.mod.neg(), a && l.negative !== 0 && l.isub(n)), {
+      }) : (this.negative & n.negative) !== 0 ? (m = this.neg().divmod(n.neg(), f), f !== "div" && (l = m.mod.neg(), a && l.negative !== 0 && l.isub(n)), {
         div: m.div,
         mod: l
       }) : n.length > this.length || this.cmp(n) < 0 ? {
@@ -838,11 +838,11 @@ var gi = { exports: {} };
       for (var h = new i(1), l = new i(0), m = new i(0), b = new i(1), u = 0; f.isEven() && a.isEven(); )
         f.iushrn(1), a.iushrn(1), ++u;
       for (var s = a.clone(), g = f.clone(); !f.isZero(); ) {
-        for (var B = 0, I = 1; !(f.words[0] & I) && B < 26; ++B, I <<= 1) ;
+        for (var B = 0, I = 1; (f.words[0] & I) === 0 && B < 26; ++B, I <<= 1) ;
         if (B > 0)
           for (f.iushrn(B); B-- > 0; )
             (h.isOdd() || l.isOdd()) && (h.iadd(s), l.isub(g)), h.iushrn(1), l.iushrn(1);
-        for (var N = 0, j = 1; !(a.words[0] & j) && N < 26; ++N, j <<= 1) ;
+        for (var N = 0, K = 1; (a.words[0] & K) === 0 && N < 26; ++N, K <<= 1) ;
         if (N > 0)
           for (a.iushrn(N); N-- > 0; )
             (m.isOdd() || b.isOdd()) && (m.iadd(s), b.isub(g)), m.iushrn(1), b.iushrn(1);
@@ -858,11 +858,11 @@ var gi = { exports: {} };
       var f = this, a = n.clone();
       f.negative !== 0 ? f = f.umod(n) : f = f.clone();
       for (var h = new i(1), l = new i(0), m = a.clone(); f.cmpn(1) > 0 && a.cmpn(1) > 0; ) {
-        for (var b = 0, u = 1; !(f.words[0] & u) && b < 26; ++b, u <<= 1) ;
+        for (var b = 0, u = 1; (f.words[0] & u) === 0 && b < 26; ++b, u <<= 1) ;
         if (b > 0)
           for (f.iushrn(b); b-- > 0; )
             h.isOdd() && h.iadd(m), h.iushrn(1);
-        for (var s = 0, g = 1; !(a.words[0] & g) && s < 26; ++s, g <<= 1) ;
+        for (var s = 0, g = 1; (a.words[0] & g) === 0 && s < 26; ++s, g <<= 1) ;
         if (s > 0)
           for (a.iushrn(s); s-- > 0; )
             l.isOdd() && l.iadd(m), l.iushrn(1);
@@ -1152,8 +1152,8 @@ var gi = { exports: {} };
       for (s = new i(2 * s * s).toRed(this); this.pow(s, u).cmp(b) !== 0; )
         s.redIAdd(b);
       for (var g = this.pow(s, h), B = this.pow(n, h.addn(1).iushrn(1)), I = this.pow(n, h), N = l; I.cmp(m) !== 0; ) {
-        for (var j = I, H = 0; j.cmp(m) !== 0; H++)
-          j = j.redSqr();
+        for (var K = I, H = 0; K.cmp(m) !== 0; H++)
+          K = K.redSqr();
         o(H < N);
         var z = this.pow(g, new i(1).iushln(N - H - 1));
         B = B.redMul(z), g = z.redSqr(), I = I.redMul(g), N = H;
@@ -1212,12 +1212,12 @@ var gi = { exports: {} };
       var f = this.imod(n._invmp(this.m).mul(this.r2));
       return f._forceRed(this);
     };
-  })(t, is);
-})(gi);
-var gs = gi.exports;
-const K = /* @__PURE__ */ ns(gs);
+  })(t, ws);
+})(sn);
+var gs = sn.exports;
+const j = /* @__PURE__ */ ns(gs);
 function mi(t) {
-  return K.isBN(t);
+  return j.isBN(t);
 }
 function ms(t) {
   return !!t && typeof t == "object";
@@ -1227,7 +1227,7 @@ function pi(...t) {
 }
 const yi = /* @__PURE__ */ pi("toBigInt"), vi = /* @__PURE__ */ pi("toBn");
 function ps(t) {
-  return typeof t == "bigint" ? t : t ? te(t) ? ws(t.toString()) : mi(t) ? W(t.toString()) : yi(t) ? t.toBigInt() : vi(t) ? W(t.toBn().toString()) : W(t) : W(0);
+  return typeof t == "bigint" ? t : t ? te(t) ? ds(t.toString()) : mi(t) ? W(t.toString()) : yi(t) ? t.toBigInt() : vi(t) ? W(t.toBn().toString()) : W(t) : W(0);
 }
 function Ct(...t) {
   const e = t.length, r = new Array(e);
@@ -1254,7 +1254,7 @@ function bi(t) {
       return !1;
   return !0;
 }
-function jt(t, e) {
+function Kt(t, e) {
   const r = V(t), o = V(e);
   if (r.length === o.length) {
     const c = new DataView(r.buffer, r.byteOffset), i = new DataView(o.buffer, o.byteOffset), w = r.length % 4 | 0, d = r.length - w | 0;
@@ -1283,45 +1283,45 @@ function kr(t, { isLe: e = !0, isNegative: r = !1 } = {}) {
   if (r && o && t[o - 1] & 128)
     switch (o) {
       case 0:
-        return new K(0);
+        return new j(0);
       case 1:
-        return new K((t[0] ^ 255) * -1 - 1);
+        return new j((t[0] ^ 255) * -1 - 1);
       case 2:
-        return new K((t[0] + (t[1] << 8) ^ 65535) * -1 - 1);
+        return new j((t[0] + (t[1] << 8) ^ 65535) * -1 - 1);
       case 3:
-        return new K((t[0] + (t[1] << 8) + (t[2] << 16) ^ 16777215) * -1 - 1);
+        return new j((t[0] + (t[1] << 8) + (t[2] << 16) ^ 16777215) * -1 - 1);
       case 4:
-        return new K((t[0] + (t[1] << 8) + (t[2] << 16) + t[3] * 16777216 ^ 4294967295) * -1 - 1);
+        return new j((t[0] + (t[1] << 8) + (t[2] << 16) + t[3] * 16777216 ^ 4294967295) * -1 - 1);
       case 5:
-        return new K(((t[0] + (t[1] << 8) + (t[2] << 16) + t[3] * 16777216 ^ 4294967295) + (t[4] ^ 255) * 4294967296) * -1 - 1);
+        return new j(((t[0] + (t[1] << 8) + (t[2] << 16) + t[3] * 16777216 ^ 4294967295) + (t[4] ^ 255) * 4294967296) * -1 - 1);
       case 6:
-        return new K(((t[0] + (t[1] << 8) + (t[2] << 16) + t[3] * 16777216 ^ 4294967295) + (t[4] + (t[5] << 8) ^ 65535) * 4294967296) * -1 - 1);
+        return new j(((t[0] + (t[1] << 8) + (t[2] << 16) + t[3] * 16777216 ^ 4294967295) + (t[4] + (t[5] << 8) ^ 65535) * 4294967296) * -1 - 1);
       default:
-        return new K(t, "le").fromTwos(o * 8);
+        return new j(t, "le").fromTwos(o * 8);
     }
   switch (o) {
     case 0:
-      return new K(0);
+      return new j(0);
     case 1:
-      return new K(t[0]);
+      return new j(t[0]);
     case 2:
-      return new K(t[0] + (t[1] << 8));
+      return new j(t[0] + (t[1] << 8));
     case 3:
-      return new K(t[0] + (t[1] << 8) + (t[2] << 16));
+      return new j(t[0] + (t[1] << 8) + (t[2] << 16));
     case 4:
-      return new K(t[0] + (t[1] << 8) + (t[2] << 16) + t[3] * 16777216);
+      return new j(t[0] + (t[1] << 8) + (t[2] << 16) + t[3] * 16777216);
     case 5:
-      return new K(t[0] + (t[1] << 8) + (t[2] << 16) + (t[3] + (t[4] << 8)) * 16777216);
+      return new j(t[0] + (t[1] << 8) + (t[2] << 16) + (t[3] + (t[4] << 8)) * 16777216);
     case 6:
-      return new K(t[0] + (t[1] << 8) + (t[2] << 16) + (t[3] + (t[4] << 8) + (t[5] << 16)) * 16777216);
+      return new j(t[0] + (t[1] << 8) + (t[2] << 16) + (t[3] + (t[4] << 8) + (t[5] << 16)) * 16777216);
     default:
-      return new K(t, "le");
+      return new j(t, "le");
   }
 }
 const Ur = /* @__PURE__ */ V(`Ethereum Signed Message:
 `), Ie = /* @__PURE__ */ V("<Bytes>"), ke = /* @__PURE__ */ V("</Bytes>"), vs = Ie.length + ke.length;
 function We(t, e) {
-  return t.length >= vs && jt(t.subarray(0, Ie.length), Ie) && jt(t.slice(-ke.length), ke) || e && t.length >= Ur.length && jt(t.subarray(0, Ur.length), Ur);
+  return t.length >= vs && Kt(t.subarray(0, Ie.length), Ie) && Kt(t.slice(-ke.length), ke) || e && t.length >= Ur.length && Kt(t.subarray(0, Ur.length), Ur);
 }
 function bs(t) {
   const e = V(t);
@@ -1331,18 +1331,18 @@ function xs(t) {
   const e = V(t);
   return We(e, !0) ? e : Re([Ie, e, ke]);
 }
-const On = W(256), Es = W(255);
+const Ln = W(256), Es = W(255);
 function Ms(t, e, r) {
-  const o = [], c = r && t < Ke;
-  for (c && (t = (t + Ge) * -Ge); t !== Ke; ) {
-    const i = t % On, w = Number(c ? i ^ Es : i);
-    e ? o.push(w) : o.unshift(w), t = (t - i) / On;
+  const o = [], c = r && t < je;
+  for (c && (t = (t + Ge) * -Ge); t !== je; ) {
+    const i = t % Ln, w = Number(c ? i ^ Es : i);
+    e ? o.push(w) : o.unshift(w), t = (t - i) / Ln;
   }
   return Uint8Array.from(o);
 }
 function _s(t, { bitLength: e = -1, isLe: r = !0, isNegative: o = !1 } = {}) {
   const c = ps(t);
-  if (c === Ke)
+  if (c === je)
     return e === -1 ? new Uint8Array(1) : new Uint8Array(Math.ceil((e || 0) / 8));
   const i = Ms(c, r, o);
   if (e === -1)
@@ -1361,18 +1361,18 @@ function Bs(t) {
 }
 function Ss(t, { isLe: e = !1, isNegative: r = !1 } = {}) {
   if (!t || t === "0x")
-    return new K(0);
-  const o = Bs(t), c = new K(o, 16, e ? "le" : "be");
+    return new j(0);
+  const o = Bs(t), c = new j(o, 16, e ? "le" : "be");
   return r ? c.fromTwos(o.length * 4) : c;
 }
-const nr = /* @__PURE__ */ new K(1), ir = /* @__PURE__ */ new K(2), Ln = /* @__PURE__ */ new K(1e9);
-Ln.mul(Ln);
+const nr = /* @__PURE__ */ new j(1), ir = /* @__PURE__ */ new j(2), Tn = /* @__PURE__ */ new j(1e9);
+Tn.mul(Tn);
 Number.MAX_SAFE_INTEGER;
 function xi(t) {
   return typeof t == "bigint";
 }
 function Ei(t) {
-  return t ? K.isBN(t) ? t : te(t) ? Ss(t.toString()) : xi(t) ? new K(t.toString()) : vi(t) ? t.toBn() : yi(t) ? new K(t.toBigInt().toString()) : new K(t) : new K(0);
+  return t ? j.isBN(t) ? t : te(t) ? Ss(t.toString()) : xi(t) ? new j(t.toString()) : vi(t) ? t.toBn() : yi(t) ? new j(t.toBigInt().toString()) : new j(t) : new j(0);
 }
 const As = { bitLength: -1, isLe: !0, isNegative: !1 };
 function zt(t, { bitLength: e = -1, isLe: r = !0, isNegative: o = !1 } = As) {
@@ -1382,7 +1382,7 @@ function zt(t, { bitLength: e = -1, isLe: r = !0, isNegative: o = !1 } = As) {
   const w = new Uint8Array(i), d = o ? c.toTwos(i * 8) : c;
   return w.set(d.toArray(r ? "le" : "be", i), 0), w;
 }
-const Is = ir.pow(new K(6)).isub(nr), ks = ir.pow(new K(14)).isub(nr), Us = ir.pow(new K(30)).isub(nr), Ns = { bitLength: 16 }, Rs = { bitLength: 32 };
+const Is = ir.pow(new j(6)).isub(nr), ks = ir.pow(new j(14)).isub(nr), Us = ir.pow(new j(30)).isub(nr), Ns = { bitLength: 16 }, Rs = { bitLength: 32 };
 function Os(t) {
   const e = Ei(t);
   if (e.lte(Is))
@@ -1403,7 +1403,7 @@ function Os(t) {
     r.subarray(0, o)
   ]);
 }
-function sn(t) {
+function fn(t) {
   return Re([
     Os(t.length),
     t
@@ -1495,7 +1495,7 @@ function qs(t, e = "=") {
     }
   };
 }
-function Tn(t, e, r) {
+function $n(t, e, r) {
   if (e < 2)
     throw new Error(`convertRadix: invalid from=${e}, base cannot be less than 2`);
   if (r < 2)
@@ -1536,7 +1536,7 @@ const ki = (t, e) => e === 0 ? t : ki(e, t % e), tr = /* @__NO_SIDE_EFFECTS__ */
     t.push(2 ** e);
   return t;
 })();
-function $n(t, e, r, o) {
+function qn(t, e, r, o) {
   if (Qe(t), e <= 0 || e > 32)
     throw new Error(`convertRadix2: wrong from=${e}`);
   if (r <= 0 || r > 32)
@@ -1571,9 +1571,9 @@ function Ps(t) {
     encode: (r) => {
       if (!Mi(r))
         throw new Error("radix.encode input should be Uint8Array");
-      return Tn(Array.from(r), e, t);
+      return $n(Array.from(r), e, t);
     },
-    decode: (r) => (Bi("radix.decode", r), Uint8Array.from(Tn(r, t, e)))
+    decode: (r) => (Bi("radix.decode", r), Uint8Array.from($n(r, t, e)))
   };
 }
 // @__NO_SIDE_EFFECTS__
@@ -1586,9 +1586,9 @@ function Cs(t, e = !1) {
     encode: (r) => {
       if (!Mi(r))
         throw new Error("radix2.encode input should be Uint8Array");
-      return $n(Array.from(r), 8, t, !e);
+      return qn(Array.from(r), 8, t, !e);
     },
-    decode: (r) => (Bi("radix2.decode", r), Uint8Array.from($n(r, t, 8, e)))
+    decode: (r) => (Bi("radix2.decode", r), Uint8Array.from(qn(r, t, 8, e)))
   };
 }
 const Zs = /* @__PURE__ */ Si(/* @__PURE__ */ Cs(6), /* @__PURE__ */ Ai("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), /* @__PURE__ */ qs(6), /* @__PURE__ */ Ii("")), Ds = /* @__NO_SIDE_EFFECTS__ */ (t) => /* @__PURE__ */ Si(/* @__PURE__ */ Ps(58), /* @__PURE__ */ Ai(t), /* @__PURE__ */ Ii("")), Hs = /* @__PURE__ */ Ds("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
@@ -1617,16 +1617,16 @@ function Ri({ chars: t, ipfs: e, type: r, withPadding: o }) {
     return !0;
   };
 }
-const fn = {
+const an = {
   chars: "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz",
   coder: Hs,
   ipfs: "z",
   type: "base58"
-}, Vs = /* @__PURE__ */ Ri(fn), zs = /* @__PURE__ */ Ui(fn, Vs), Ys = /* @__PURE__ */ Ni(fn), Xs = ee("SS58PRE");
+}, Vs = /* @__PURE__ */ Ri(an), zs = /* @__PURE__ */ Ui(an, Vs), Ys = /* @__PURE__ */ Ni(an), Xs = ee("SS58PRE");
 function Oi(t) {
   return he(Ct(Xs, t), 512);
 }
-function js(t) {
+function Ks(t) {
   const e = t[0] & 64 ? 2 : 1, r = e === 1 ? t[0] : (t[0] & 63) << 2 | t[1] >> 6 | (t[1] & 63) << 8, o = [34 + e, 35 + e].includes(t.length), c = t.length - (o ? 2 : 1), i = Oi(t.subarray(0, c));
   return [(t[0] & 128) === 0 && ![46, 47].includes(t[0]) && (o ? t[t.length - 2] === i[0] && t[t.length - 1] === i[1] : t[t.length - 1] === i[0]), c, e, r];
 }
@@ -1645,7 +1645,7 @@ function ge(t, e, r = -1) {
     const o = zs(t);
     if (!ze.allowedEncodedLengths.includes(o.length))
       throw new Error("Invalid decoded address length");
-    const [c, i, w, d] = js(o);
+    const [c, i, w, d] = Ks(o);
     if (!c && !e)
       throw new Error("Invalid decoded address checksum");
     if (r !== -1 && r !== d)
@@ -1655,15 +1655,15 @@ function ge(t, e, r = -1) {
     throw new Error(`Decoding ${t}: ${o.message}`);
   }
 }
-const qn = { isLe: !1 }, Rr = { isLe: !0 }, Ks = { bitLength: 32, isLe: !1 }, Or = { bitLength: 32, isLe: !0 }, pe = { bitLength: 256, isLe: !1 }, Gs = { bitLength: 256, isLe: !0 }, Ws = /^\d+$/, Js = 32;
-class an {
+const Pn = { isLe: !1 }, Rr = { isLe: !0 }, js = { bitLength: 32, isLe: !1 }, Or = { bitLength: 32, isLe: !0 }, pe = { bitLength: 256, isLe: !1 }, Gs = { bitLength: 256, isLe: !0 }, Ws = /^\d+$/, Js = 32;
+class hn {
   constructor() {
-    Kt(this, "__internal__chainCode", new Uint8Array(32));
-    Kt(this, "__internal__isHard", !1);
+    jt(this, "__internal__chainCode", new Uint8Array(32));
+    jt(this, "__internal__isHard", !1);
   }
   static from(e) {
-    const r = new an(), [o, c] = e.startsWith("/") ? [e.substring(1), !0] : [e, !1];
-    return r.soft(Ws.test(o) ? new K(o, 10) : o), c ? r.harden() : r;
+    const r = new hn(), [o, c] = e.startsWith("/") ? [e.substring(1), !0] : [e, !1];
+    return r.soft(Ws.test(o) ? new j(o, 10) : o), c ? r.harden() : r;
   }
   get chainCode() {
     return this.__internal__chainCode;
@@ -1681,7 +1681,7 @@ class an {
     return this.__internal__isHard = !0, this;
   }
   soft(e) {
-    return Ts(e) || mi(e) || xi(e) ? this.soft(zt(e, Gs)) : te(e) ? this.soft(Se(e)) : Ls(e) ? this.soft(sn(ee(e))) : e.length > Js ? this.soft(he(e)) : (this.__internal__chainCode.fill(0), this.__internal__chainCode.set(e, 0), this);
+    return Ts(e) || mi(e) || xi(e) ? this.soft(zt(e, Gs)) : te(e) ? this.soft(Se(e)) : Ls(e) ? this.soft(fn(ee(e))) : e.length > Js ? this.soft(he(e)) : (this.__internal__chainCode.fill(0), this.__internal__chainCode.set(e, 0), this);
   }
   soften() {
     return this.__internal__isHard = !1, this;
@@ -1694,7 +1694,7 @@ function Li(t) {
   if (e) {
     o = e.join("");
     for (const c of e)
-      r.push(an.from(c.substring(1)));
+      r.push(hn.from(c.substring(1)));
   }
   if (o !== t)
     throw new Error(`Re-constructed path "${o}" does not match input`);
@@ -1716,13 +1716,13 @@ function tf(t) {
     phrase: r
   };
 }
-const ef = sn(ee("Secp256k1HDKD"));
+const ef = fn(ee("Secp256k1HDKD"));
 function rf(t, e) {
   if (!oe(e) || e.length !== 32)
     throw new Error("Invalid chainCode passed to derive");
   return he(Ct(ef, t, e), 256);
 }
-const hn = /* @__PURE__ */ BigInt(0), or = /* @__PURE__ */ BigInt(1), nf = /* @__PURE__ */ BigInt(2);
+const cn = /* @__PURE__ */ BigInt(0), or = /* @__PURE__ */ BigInt(1), nf = /* @__PURE__ */ BigInt(2);
 function se(t) {
   return t instanceof Uint8Array || t != null && typeof t == "object" && t.constructor.name === "Uint8Array";
 }
@@ -1746,13 +1746,13 @@ function we(t) {
   const e = t.toString(16);
   return e.length & 1 ? `0${e}` : e;
 }
-function cn(t) {
+function ln(t) {
   if (typeof t != "string")
     throw new Error("hex string expected, got " + typeof t);
   return BigInt(t === "" ? "0" : `0x${t}`);
 }
 const Gt = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 };
-function Pn(t) {
+function Cn(t) {
   if (t >= Gt._0 && t <= Gt._9)
     return t - Gt._0;
   if (t >= Gt._A && t <= Gt._F)
@@ -1768,7 +1768,7 @@ function ye(t) {
     throw new Error("padded hex string expected, got unpadded hex of length " + e);
   const o = new Uint8Array(r);
   for (let c = 0, i = 0; c < r; c++, i += 2) {
-    const w = Pn(t.charCodeAt(i)), d = Pn(t.charCodeAt(i + 1));
+    const w = Cn(t.charCodeAt(i)), d = Cn(t.charCodeAt(i + 1));
     if (w === void 0 || d === void 0) {
       const y = t[i] + t[i + 1];
       throw new Error('hex string expected, got non-hex character "' + y + '" at index ' + i);
@@ -1778,10 +1778,10 @@ function ye(t) {
   return o;
 }
 function ie(t) {
-  return cn(fe(t));
+  return ln(fe(t));
 }
 function me(t) {
-  return Le(t), cn(fe(Uint8Array.from(t).reverse()));
+  return Le(t), ln(fe(Uint8Array.from(t).reverse()));
 }
 function ve(t, e) {
   return ye(t.toString(16).padStart(e * 2, "0"));
@@ -1835,7 +1835,7 @@ function af(t) {
     throw new Error(`utf8ToBytes expected string, got ${typeof t}`);
   return new Uint8Array(new TextEncoder().encode(t));
 }
-const Lr = (t) => typeof t == "bigint" && hn <= t;
+const Lr = (t) => typeof t == "bigint" && cn <= t;
 function sr(t, e, r) {
   return Lr(t) && Lr(e) && Lr(r) && e <= t && t < r;
 }
@@ -1845,7 +1845,7 @@ function Yt(t, e, r, o) {
 }
 function Ti(t) {
   let e;
-  for (e = 0; t > hn; t >>= or, e += 1)
+  for (e = 0; t > cn; t >>= or, e += 1)
     ;
   return e;
 }
@@ -1853,9 +1853,9 @@ function hf(t, e) {
   return t >> BigInt(e) & or;
 }
 function cf(t, e, r) {
-  return t | (r ? or : hn) << BigInt(e);
+  return t | (r ? or : cn) << BigInt(e);
 }
-const ln = (t) => (nf << BigInt(t - 1)) - or, Tr = (t) => new Uint8Array(t), Cn = (t) => Uint8Array.from(t);
+const un = (t) => (nf << BigInt(t - 1)) - or, Tr = (t) => new Uint8Array(t), Zn = (t) => Uint8Array.from(t);
 function $i(t, e, r) {
   if (typeof t != "number" || t < 2)
     throw new Error("hashLen must be a number");
@@ -1867,7 +1867,7 @@ function $i(t, e, r) {
   const w = () => {
     o.fill(1), c.fill(0), i = 0;
   }, d = (...E) => r(c, o, ...E), y = (E = Tr()) => {
-    c = d(Cn([0]), E), o = d(), E.length !== 0 && (c = d(Cn([1]), E), o = d());
+    c = d(Zn([0]), E), o = d(), E.length !== 0 && (c = d(Zn([1]), E), o = d());
   }, x = () => {
     if (i++ >= 1e3)
       throw new Error("drbg: tried 1000 values");
@@ -1934,7 +1934,7 @@ const df = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   abytes: Le,
   bitGet: hf,
   bitLen: Ti,
-  bitMask: ln,
+  bitMask: un,
   bitSet: cf,
   bytesToHex: fe,
   bytesToNumberBE: ie,
@@ -1944,7 +1944,7 @@ const df = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   ensureBytes: Tt,
   equalBytes: ff,
   hexToBytes: ye,
-  hexToNumber: cn,
+  hexToNumber: ln,
   inRange: sr,
   isBytes: se,
   memoized: Ne,
@@ -1956,7 +1956,7 @@ const df = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   utf8ToBytes: af,
   validateObject: xe
 }, Symbol.toStringTag, { value: "Module" }));
-const Pt = BigInt(0), ft = BigInt(1), ne = BigInt(2), wf = BigInt(3), jr = BigInt(4), Zn = BigInt(5), Dn = BigInt(8);
+const Pt = BigInt(0), ft = BigInt(1), ne = BigInt(2), wf = BigInt(3), Kr = BigInt(4), Dn = BigInt(5), Hn = BigInt(8);
 BigInt(9);
 BigInt(16);
 function tt(t, e) {
@@ -1979,7 +1979,7 @@ function ut(t, e, r) {
     o *= o, o %= r;
   return o;
 }
-function Kr(t, e) {
+function jr(t, e) {
   if (t === Pt || e <= Pt)
     throw new Error(`invert: expected positive integers, got n=${t} mod=${e}`);
   let r = tt(t, e), o = e, c = Pt, i = ft;
@@ -1999,7 +1999,7 @@ function mf(t) {
   for (c = ne; c < t && gf(c, e, t) !== t - ft; c++)
     ;
   if (o === 1) {
-    const w = (t + ft) / jr;
+    const w = (t + ft) / Kr;
     return function(y, x) {
       const v = y.pow(x, w);
       if (!y.eql(y.sqr(v), x))
@@ -2025,8 +2025,8 @@ function mf(t) {
   };
 }
 function pf(t) {
-  if (t % jr === wf) {
-    const e = (t + ft) / jr;
+  if (t % Kr === wf) {
+    const e = (t + ft) / Kr;
     return function(o, c) {
       const i = o.pow(c, e);
       if (!o.eql(o.sqr(i), c))
@@ -2034,8 +2034,8 @@ function pf(t) {
       return i;
     };
   }
-  if (t % Dn === Zn) {
-    const e = (t - Zn) / Dn;
+  if (t % Hn === Dn) {
+    const e = (t - Dn) / Hn;
     return function(o, c) {
       const i = o.mul(c, ne), w = o.pow(i, e), d = o.mul(c, w), y = o.mul(o.mul(d, ne), w), x = o.mul(d, o.sub(y, o.ONE));
       if (!o.eql(o.sqr(x), c))
@@ -2103,7 +2103,7 @@ function fr(t, e, r = !1, o = {}) {
     ORDER: t,
     BITS: c,
     BYTES: i,
-    MASK: ln(c),
+    MASK: un(c),
     ZERO: Pt,
     ONE: ft,
     create: (y) => tt(y, t),
@@ -2121,13 +2121,13 @@ function fr(t, e, r = !1, o = {}) {
     sub: (y, x) => tt(y - x, t),
     mul: (y, x) => tt(y * x, t),
     pow: (y, x) => xf(d, y, x),
-    div: (y, x) => tt(y * Kr(x, t), t),
+    div: (y, x) => tt(y * jr(x, t), t),
     // Same as above, but doesn't normalize
     sqrN: (y) => y * y,
     addN: (y, x) => y + x,
     subN: (y, x) => y - x,
     mulN: (y, x) => y * x,
-    inv: (y) => Kr(y, t),
+    inv: (y) => jr(y, t),
     sqrt: o.sqrt || ((y) => w(d, y)),
     invertBatch: (y) => Ef(d, y),
     // TODO: do we really need constant cmov?
@@ -2159,7 +2159,7 @@ function Mf(t, e, r = !1) {
   const w = r ? ie(t) : me(t), d = tt(w, e - ft) + ft;
   return r ? Ue(d, c) : ve(d, c);
 }
-const _f = BigInt(0), $r = BigInt(1), qr = /* @__PURE__ */ new WeakMap(), Hn = /* @__PURE__ */ new WeakMap();
+const _f = BigInt(0), $r = BigInt(1), qr = /* @__PURE__ */ new WeakMap(), Vn = /* @__PURE__ */ new WeakMap();
 function Zi(t, e) {
   const r = (i, w) => {
     const d = w.negate();
@@ -2223,7 +2223,7 @@ function Zi(t, e) {
       return { p: v, f: E };
     },
     wNAFCached(i, w, d) {
-      const y = Hn.get(i) || 1;
+      const y = Vn.get(i) || 1;
       let x = qr.get(i);
       return x || (x = this.precomputeWindow(i, y), y !== 1 && qr.set(i, d(x))), this.wNAF(y, x, w);
     },
@@ -2231,7 +2231,7 @@ function Zi(t, e) {
     // using windowed method. This specifies window size and
     // stores precomputed values. Usually only base point would be precomputed.
     setWindowSize(i, w) {
-      o(w), Hn.set(i, w), qr.delete(i);
+      o(w), Vn.set(i, w), qr.delete(i);
     }
   };
 }
@@ -2262,7 +2262,7 @@ function Di(t, e, r, o) {
   }
   return x;
 }
-function un(t) {
+function dn(t) {
   return bf(t.Fp), xe(t, {
     n: "bigint",
     h: "bigint",
@@ -2277,11 +2277,11 @@ function un(t) {
     p: t.Fp.ORDER
   });
 }
-function Vn(t) {
+function zn(t) {
   t.lowS !== void 0 && Qt("lowS", t.lowS), t.prehash !== void 0 && Qt("prehash", t.prehash);
 }
 function Bf(t) {
-  const e = un(t);
+  const e = dn(t);
   xe(e, {
     a: "field",
     b: "field"
@@ -2396,7 +2396,7 @@ const { bytesToNumberBE: Sf, hexToBytes: Af } = df, Wt = {
     const { _tlv: e, _int: r } = Wt, o = `${e.encode(2, r.encode(t.r))}${e.encode(2, r.encode(t.s))}`;
     return e.encode(48, o);
   }
-}, Jt = BigInt(0), qt = BigInt(1), k0 = BigInt(2), zn = BigInt(3), U0 = BigInt(4);
+}, Jt = BigInt(0), qt = BigInt(1), k0 = BigInt(2), Yn = BigInt(3), U0 = BigInt(4);
 function If(t) {
   const e = Bf(t), { Fp: r } = e, o = fr(e.n, e.nBitLength), c = e.toBytes || ((k, _, S) => {
     const L = _.toAffine();
@@ -2547,7 +2547,7 @@ function If(t) {
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: _, b: S } = e, L = r.mul(S, zn), { px: A, py: q, pz: D } = this;
+      const { a: _, b: S } = e, L = r.mul(S, Yn), { px: A, py: q, pz: D } = this;
       let R = r.ZERO, O = r.ZERO, $ = r.ZERO, P = r.mul(A, A), J = r.mul(q, q), T = r.mul(D, D), Z = r.mul(A, q);
       return Z = r.add(Z, Z), $ = r.mul(A, D), $ = r.add($, $), R = r.mul(_, $), O = r.mul(L, T), O = r.add(R, O), R = r.sub(J, O), O = r.add(J, O), O = r.mul(R, O), R = r.mul(Z, R), $ = r.mul(L, $), T = r.mul(_, T), Z = r.sub(P, T), Z = r.mul(_, Z), Z = r.add(Z, $), $ = r.add(P, P), P = r.add($, P), P = r.add(P, T), P = r.mul(P, Z), O = r.add(O, P), T = r.mul(q, D), T = r.add(T, T), P = r.mul(T, Z), R = r.sub(R, P), $ = r.mul(T, J), $ = r.add($, $), $ = r.add($, $), new M(R, O, $);
     }
@@ -2559,7 +2559,7 @@ function If(t) {
       x(_);
       const { px: S, py: L, pz: A } = this, { px: q, py: D, pz: R } = _;
       let O = r.ZERO, $ = r.ZERO, P = r.ZERO;
-      const J = e.a, T = r.mul(e.b, zn);
+      const J = e.a, T = r.mul(e.b, Yn);
       let Z = r.mul(S, q), p = r.mul(L, D), n = r.mul(A, R), f = r.add(S, L), a = r.add(q, D);
       f = r.mul(f, a), a = r.add(Z, p), f = r.sub(f, a), a = r.add(S, A);
       let h = r.add(q, R);
@@ -2663,7 +2663,7 @@ function If(t) {
   };
 }
 function kf(t) {
-  const e = un(t);
+  const e = dn(t);
   return xe(e, {
     hash: "hash",
     hmac: "function",
@@ -2680,7 +2680,7 @@ function Uf(t) {
     return tt(n, o);
   }
   function d(n) {
-    return Kr(n, o);
+    return jr(n, o);
   }
   const { ProjectivePoint: y, normPrivateKeyToScalar: x, weierstrassEquation: v, isWithinCurveOrder: E } = If({
     ...e,
@@ -2747,7 +2747,7 @@ function Uf(t) {
       const b = l === 2 || l === 3 ? a + e.n : a;
       if (b >= r.ORDER)
         throw new Error("recovery id 2 or 3 invalid");
-      const u = l & 1 ? "03" : "02", s = y.fromHex(u + M(b)), g = d(b), B = w(-m * g), I = w(h * g), N = y.BASE.multiplyAndAddUnsafe(s, B, I);
+      const u = (l & 1) === 0 ? "02" : "03", s = y.fromHex(u + M(b)), g = d(b), B = w(-m * g), I = w(h * g), N = y.BASE.multiplyAndAddUnsafe(s, B, I);
       if (!N)
         throw new Error("point at infinify");
       return N.assertValidity(), N;
@@ -2822,7 +2822,7 @@ function Uf(t) {
     return a > 0 ? f >> BigInt(a) : f;
   }, R = e.bits2int_modN || function(n) {
     return w(D(n));
-  }, O = ln(e.nBitLength);
+  }, O = un(e.nBitLength);
   function $(n) {
     return Yt(`num < 2^${e.nBitLength}`, n, Jt, O), ve(n, e.nByteLength);
   }
@@ -2831,14 +2831,14 @@ function Uf(t) {
       throw new Error("sign() legacy options not supported");
     const { hash: h, randomBytes: l } = e;
     let { lowS: m, prehash: b, extraEntropy: u } = a;
-    m == null && (m = !0), n = Tt("msgHash", n), Vn(a), b && (n = Tt("prehashed msgHash", h(n)));
+    m == null && (m = !0), n = Tt("msgHash", n), zn(a), b && (n = Tt("prehashed msgHash", h(n)));
     const s = R(n), g = x(f), B = [$(g), $(s)];
     if (u != null && u !== !1) {
       const H = u === !0 ? l(r.BYTES) : u;
       B.push(Tt("extraEntropy", H));
     }
     const I = ae(...B), N = s;
-    function j(H) {
+    function K(H) {
       const z = D(H);
       if (!E(z))
         return;
@@ -2851,7 +2851,7 @@ function Uf(t) {
       let Q = (X.x === Y ? 0 : 2) | Number(X.y & qt), F = Zt;
       return m && U(Zt) && (F = C(Zt), Q ^= 1), new _(Y, F, Q);
     }
-    return { seed: I, k2sig: j };
+    return { seed: I, k2sig: K };
   }
   const J = { lowS: e.lowS, prehash: !1 }, T = { lowS: e.lowS, prehash: !1 };
   function Z(n, f, a = J) {
@@ -2864,7 +2864,7 @@ function Uf(t) {
     const l = n;
     if (f = Tt("msgHash", f), a = Tt("publicKey", a), "strict" in h)
       throw new Error("options.strict was renamed to lowS");
-    Vn(h);
+    zn(h);
     const { lowS: m, prehash: b } = h;
     let u, s;
     try {
@@ -2890,7 +2890,7 @@ function Uf(t) {
     if (m && u.hasHighS())
       return !1;
     b && (f = e.hash(f));
-    const { r: g, s: B } = u, I = R(f), N = d(B), j = w(I * N), H = w(g * N), z = (X = y.BASE.multiplyAndAddUnsafe(s, j, H)) == null ? void 0 : X.toAffine();
+    const { r: g, s: B } = u, I = R(f), N = d(B), K = w(I * N), H = w(g * N), z = (X = y.BASE.multiplyAndAddUnsafe(s, K, H)) == null ? void 0 : X.toAffine();
     return z ? w(z.x) === g : !1;
   }
   return {
@@ -2907,15 +2907,15 @@ function Uf(t) {
 function Nf(t) {
   return {
     hash: t,
-    hmac: (e, ...r) => li(t, e, po(...r)),
-    randomBytes: ci
+    hmac: (e, ...r) => ui(t, e, po(...r)),
+    randomBytes: li
   };
 }
 function Rf(t, e) {
   const r = (o) => Uf({ ...t, ...Nf(o) });
   return Object.freeze({ ...r(e), create: r });
 }
-const Hi = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), Yn = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), Of = BigInt(1), Gr = BigInt(2), Xn = (t, e) => (t + e / Gr) / e;
+const Hi = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), Xn = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), Of = BigInt(1), Gr = BigInt(2), Kn = (t, e) => (t + e / Gr) / e;
 function Lf(t) {
   const e = Hi, r = BigInt(3), o = BigInt(6), c = BigInt(11), i = BigInt(22), w = BigInt(23), d = BigInt(44), y = BigInt(88), x = t * t * t % e, v = x * x * t % e, E = ut(v, r, e) * v % e, M = ut(E, r, e) * v % e, U = ut(M, Gr, e) * x % e, C = ut(U, c, e) * U % e, k = ut(C, i, e) * C % e, _ = ut(k, d, e) * k % e, S = ut(_, y, e) * _ % e, L = ut(S, d, e) * k % e, A = ut(L, r, e) * v % e, q = ut(A, w, e) * C % e, D = ut(q, o, e) * x % e, R = ut(D, Gr, e);
   if (!Wr.eql(Wr.sqr(R), t))
@@ -2929,7 +2929,7 @@ const Wr = fr(Hi, void 0, void 0, { sqrt: Lf }), Te = Rf({
   // Seem to be rigid: bitcointalk.org/index.php?topic=289795.msg3183975#msg3183975
   Fp: Wr,
   // Field's prime: 2n**256n - 2n**32n - 2n**9n - 2n**8n - 2n**7n - 2n**6n - 2n**4n - 1n
-  n: Yn,
+  n: Xn,
   // Curve order, total count of valid points in the field
   // Base point (x, y) aka generator point
   Gx: BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),
@@ -2947,7 +2947,7 @@ const Wr = fr(Hi, void 0, void 0, { sqrt: Lf }), Te = Rf({
   endo: {
     beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
     splitScalar: (t) => {
-      const e = Yn, r = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), o = -Of * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), c = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), i = r, w = BigInt("0x100000000000000000000000000000000"), d = Xn(i * t, e), y = Xn(-o * t, e);
+      const e = Xn, r = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), o = -Of * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), c = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), i = r, w = BigInt("0x100000000000000000000000000000000"), d = Kn(i * t, e), y = Kn(-o * t, e);
       let x = tt(t - d * r - y * c, e), v = tt(-d * o - y * i, e);
       const E = x > w, M = v > w;
       if (E && (x = e - x), M && (v = e - v), x > w || v > w)
@@ -2981,7 +2981,7 @@ function Vi(t, e) {
     return t(e(r.secretKey.subarray(0, 32), o));
   };
 }
-const jn = /* @__PURE__ */ Vi(be, rf), Tf = sn(ee("Ed25519HDKD"));
+const jn = /* @__PURE__ */ Vi(be, rf), Tf = fn(ee("Ed25519HDKD"));
 function $f(t, e) {
   if (!oe(e) || e.length !== 32)
     throw new Error("Invalid chainCode passed to derive");
@@ -2989,7 +2989,7 @@ function $f(t, e) {
 }
 const Xt = BigInt(0), Dt = BigInt(1), Ze = BigInt(2), qf = BigInt(8), Pf = { zip215: !0 };
 function Cf(t) {
-  const e = un(t);
+  const e = dn(t);
   return xe(t, {
     hash: "function",
     a: "bigint",
@@ -3034,7 +3034,7 @@ function Zf(t) {
     const { a: h, d: l } = e;
     if (a.is0())
       throw new Error("bad point: ZERO");
-    const { ex: m, ey: b, ez: u, et: s } = a, g = v(m * m), B = v(b * b), I = v(u * u), N = v(I * I), j = v(g * h), H = v(I * v(j + B)), z = v(N + v(l * v(g * B)));
+    const { ex: m, ey: b, ez: u, et: s } = a, g = v(m * m), B = v(b * b), I = v(u * u), N = v(I * I), K = v(g * h), H = v(I * v(K + B)), z = v(N + v(l * v(g * B)));
     if (H !== z)
       throw new Error("bad point: equation left != right (1)");
     const $t = v(m * b), X = v(u * s);
@@ -3078,8 +3078,8 @@ function Zf(t) {
     // Compare one point to another.
     equals(h) {
       _(h);
-      const { ex: l, ey: m, ez: b } = this, { ex: u, ey: s, ez: g } = h, B = v(l * g), I = v(u * b), N = v(m * g), j = v(s * b);
-      return B === I && N === j;
+      const { ex: l, ey: m, ez: b } = this, { ex: u, ey: s, ez: g } = h, B = v(l * g), I = v(u * b), N = v(m * g), K = v(s * b);
+      return B === I && N === K;
     }
     is0() {
       return this.equals(A.ZERO);
@@ -3091,7 +3091,7 @@ function Zf(t) {
     // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#doubling-dbl-2008-hwcd
     // Cost: 4M + 4S + 1*a + 6add + 1*2.
     double() {
-      const { a: h } = e, { ex: l, ey: m, ez: b } = this, u = v(l * l), s = v(m * m), g = v(Ze * v(b * b)), B = v(h * u), I = l + m, N = v(v(I * I) - u - s), j = B + s, H = j - g, z = B - s, $t = v(N * H), X = v(j * z), Y = v(N * z), Zt = v(H * j);
+      const { a: h } = e, { ex: l, ey: m, ez: b } = this, u = v(l * l), s = v(m * m), g = v(Ze * v(b * b)), B = v(h * u), I = l + m, N = v(v(I * I) - u - s), K = B + s, H = K - g, z = B - s, $t = v(N * H), X = v(K * z), Y = v(N * z), Zt = v(H * K);
       return new A($t, X, Zt, Y);
     }
     // Fast algo for adding 2 Extended Points.
@@ -3099,15 +3099,15 @@ function Zf(t) {
     // Cost: 9M + 1*a + 1*d + 7add.
     add(h) {
       _(h);
-      const { a: l, d: m } = e, { ex: b, ey: u, ez: s, et: g } = this, { ex: B, ey: I, ez: N, et: j } = h;
+      const { a: l, d: m } = e, { ex: b, ey: u, ez: s, et: g } = this, { ex: B, ey: I, ez: N, et: K } = h;
       if (l === BigInt(-1)) {
         const et = v((u - b) * (I + B)), rt = v((u + b) * (I - B)), ce = v(rt - et);
         if (ce === Xt)
           return this.double();
-        const nt = v(s * Ze * j), it = v(g * Ze * N), Ee = it + nt, ot = rt + et, st = it - nt, Pe = v(Ee * ce), ct = v(ot * st), lt = v(Ee * st), Ce = v(ce * ot);
+        const nt = v(s * Ze * K), it = v(g * Ze * N), Ee = it + nt, ot = rt + et, st = it - nt, Pe = v(Ee * ce), ct = v(ot * st), lt = v(Ee * st), Ce = v(ce * ot);
         return new A(Pe, ct, Ce, lt);
       }
-      const H = v(b * B), z = v(u * I), $t = v(g * m * j), X = v(s * N), Y = v((b + u) * (B + I) - H - z), Zt = X - $t, Q = X + $t, F = v(z - l * H), $e = v(Y * Zt), at = v(Q * F), ht = v(Y * F), qe = v(Zt * Q);
+      const H = v(b * B), z = v(u * I), $t = v(g * m * K), X = v(s * N), Y = v((b + u) * (B + I) - H - z), Zt = X - $t, Q = X + $t, F = v(z - l * H), $e = v(Y * Zt), at = v(Q * F), ht = v(Y * F), qe = v(Zt * Q);
       return new A($e, at, qe, ht);
     }
     subtract(h) {
@@ -3161,8 +3161,8 @@ function Zf(t) {
       s[u - 1] = g & -129;
       const B = me(s), I = l ? x : r.ORDER;
       Yt("pointHex.y", B, Xt, I);
-      const N = v(B * B), j = v(N - Dt), H = v(m * N - b);
-      let { isValid: z, value: $t } = M(j, H);
+      const N = v(B * B), K = v(N - Dt), H = v(m * N - b);
+      let { isValid: z, value: $t } = M(K, H);
       if (!z)
         throw new Error("Point.fromHex: invalid y coordinate");
       const X = ($t & Dt) === Dt, Y = (g & 128) !== 0;
@@ -3222,8 +3222,8 @@ function Zf(t) {
     }
     if (!u && B.isSmallOrder())
       return !1;
-    const j = T(b, I.toRawBytes(), B.toRawBytes(), h);
-    return I.add(B.multiplyUnsafe(j)).subtract(N).clearCofactor().equals(A.ZERO);
+    const K = T(b, I.toRawBytes(), B.toRawBytes(), h);
+    return I.add(B.multiplyUnsafe(K)).subtract(N).clearCofactor().equals(A.ZERO);
   }
   return q._setWindowSize(8), {
     CURVE: e,
@@ -3248,23 +3248,23 @@ function Zf(t) {
   };
 }
 const N0 = BigInt(0), R0 = BigInt(1);
-const dn = BigInt("57896044618658097711785492504343953926634992332820282019728792003956564819949"), Kn = /* @__PURE__ */ BigInt("19681161376707505956807079304988542015446066515923890162744021073123829784752");
+const wn = BigInt("57896044618658097711785492504343953926634992332820282019728792003956564819949"), Gn = /* @__PURE__ */ BigInt("19681161376707505956807079304988542015446066515923890162744021073123829784752");
 BigInt(0);
-const Df = BigInt(1), Gn = BigInt(2), O0 = BigInt(3), Hf = BigInt(5), Vf = BigInt(8);
+const Df = BigInt(1), Wn = BigInt(2), O0 = BigInt(3), Hf = BigInt(5), Vf = BigInt(8);
 function zf(t) {
-  const e = BigInt(10), r = BigInt(20), o = BigInt(40), c = BigInt(80), i = dn, d = t * t % i * t % i, y = ut(d, Gn, i) * d % i, x = ut(y, Df, i) * t % i, v = ut(x, Hf, i) * x % i, E = ut(v, e, i) * v % i, M = ut(E, r, i) * E % i, U = ut(M, o, i) * M % i, C = ut(U, c, i) * U % i, k = ut(C, c, i) * U % i, _ = ut(k, e, i) * v % i;
-  return { pow_p_5_8: ut(_, Gn, i) * t % i, b2: d };
+  const e = BigInt(10), r = BigInt(20), o = BigInt(40), c = BigInt(80), i = wn, d = t * t % i * t % i, y = ut(d, Wn, i) * d % i, x = ut(y, Df, i) * t % i, v = ut(x, Hf, i) * x % i, E = ut(v, e, i) * v % i, M = ut(E, r, i) * E % i, U = ut(M, o, i) * M % i, C = ut(U, c, i) * U % i, k = ut(C, c, i) * U % i, _ = ut(k, e, i) * v % i;
+  return { pow_p_5_8: ut(_, Wn, i) * t % i, b2: d };
 }
 function Yf(t) {
   return t[0] &= 248, t[31] &= 127, t[31] |= 64, t;
 }
 function Xf(t, e) {
-  const r = dn, o = tt(e * e * e, r), c = tt(o * o * e, r), i = zf(t * c).pow_p_5_8;
+  const r = wn, o = tt(e * e * e, r), c = tt(o * o * e, r), i = zf(t * c).pow_p_5_8;
   let w = tt(t * o * i, r);
-  const d = tt(e * w * w, r), y = w, x = tt(w * Kn, r), v = d === t, E = d === tt(-t, r), M = d === tt(-t * Kn, r);
+  const d = tt(e * w * w, r), y = w, x = tt(w * Gn, r), v = d === t, E = d === tt(-t, r), M = d === tt(-t * Gn, r);
   return v && (w = y), (E || M) && (w = x), yf(w, r) && (w = tt(-w, r)), { isValid: v || E, value: w };
 }
-const jf = fr(dn, void 0, !0), Kf = {
+const Kf = fr(wn, void 0, !0), jf = {
   // Param: a
   a: BigInt(-1),
   // Fp.create(-1) is proper; our way still works and is faster
@@ -3272,7 +3272,7 @@ const jf = fr(dn, void 0, !0), Kf = {
   // Negative number is P - number, and division is invert(number, P)
   d: BigInt("37095705934669439343138083508754565189542113879843219016388785533085940283555"),
   // Finite field 𝔽p over which we'll do calculations; 2n**255n - 19n
-  Fp: jf,
+  Fp: Kf,
   // Subgroup order: how many points curve has
   // 2n**252n + 27742317777372353535851937790883648493n;
   n: BigInt("7237005577332262213973186563042994240857116359379907606001950938285454250989"),
@@ -3281,15 +3281,15 @@ const jf = fr(dn, void 0, !0), Kf = {
   // Base point (x, y) aka generator point
   Gx: BigInt("15112221349535400772501151409588531511454012693041857206046113283949847762202"),
   Gy: BigInt("46316835694926478169428394003475163141307993866256225615783033603165251855960"),
-  hash: ui,
-  randomBytes: ci,
+  hash: di,
+  randomBytes: li,
   adjustScalarBytes: Yf,
   // dom2
   // Ratio of u to v. Allows us to combine inversion and square root. Uses algo from RFC8032 5.1.3.
   // Constant-time, u/√v
   uvRatio: Xf
-}, wn = Zf(Kf);
-function gn(t, e) {
+}, gn = Zf(jf);
+function mn(t, e) {
   if (!Ht || !e && Vt()) {
     const o = Io(t);
     return {
@@ -3297,7 +3297,7 @@ function gn(t, e) {
       secretKey: o.slice(0, 64)
     };
   }
-  const r = wn.getPublicKey(t);
+  const r = gn.getPublicKey(t);
   return {
     publicKey: r,
     secretKey: Re([t, r])
@@ -3309,7 +3309,7 @@ function Gf(t, { publicKey: e, secretKey: r }, o) {
       throw new Error("Expected a valid publicKey");
   } else throw new Error("Expected a valid secretKey");
   const c = V(t), i = r.subarray(0, 32);
-  return !Ht || !o && Vt() ? ko(e, i, c) : wn.sign(c, i);
+  return !Ht || !o && Vt() ? ko(e, i, c) : gn.sign(c, i);
 }
 function zi(t, e, r, o) {
   const c = V(t), i = V(r), w = V(e);
@@ -3318,12 +3318,12 @@ function zi(t, e, r, o) {
   if (w.length !== 64)
     throw new Error(`Invalid signature, received ${w.length} bytes, expected 64`);
   try {
-    return !Ht || !o && Vt() ? Uo(w, c, i) : wn.verify(w, c, i);
+    return !Ht || !o && Vt() ? Uo(w, c, i) : gn.verify(w, c, i);
   } catch {
     return !1;
   }
 }
-const Wf = /* @__PURE__ */ Vi(gn, $f), Jr = 64, Jf = 32, Pr = Jr + Jf;
+const Wf = /* @__PURE__ */ Vi(mn, $f), Jr = 64, Jf = 32, Pr = Jr + Jf;
 function Yi(t) {
   const e = V(t);
   if (e.length !== Pr)
@@ -3354,14 +3354,14 @@ const ra = {
   ethereum: jn,
   sr25519: ea
 };
-function ji(t, e, r) {
+function Ki(t, e, r) {
   const o = ra[r];
   let c = t;
   for (const i of e)
     c = o(c, i);
   return c;
 }
-function Ki(t) {
+function ji(t) {
   const e = V(t);
   if (e.length !== 32)
     throw new Error(`Expected a seed matching 32 bytes, found ${e.length}`);
@@ -3382,14 +3382,14 @@ function Gi(t, e, r) {
     throw new Error(`Invalid signature, received ${c.length} bytes, expected 64`);
   return To(c, V(t), o);
 }
-const Wn = new Uint8Array();
-function ia(t, { secretKey: e }, r = Wn, o = Wn) {
+const Jn = new Uint8Array();
+function ia(t, { secretKey: e }, r = Jn, o = Jn) {
   if ((e == null ? void 0 : e.length) !== 64)
     throw new Error("Invalid secretKey, expected 64-bytes");
   return $o(e, V(r), V(t), V(o));
 }
-const Jn = new Uint8Array();
-function oa(t, e, r, o = Jn, c = Jn) {
+const Qn = new Uint8Array();
+function oa(t, e, r, o = Qn, c = Qn) {
   const i = V(r), w = V(e);
   if (i.length !== 32)
     throw new Error("Invalid publicKey, expected 32-bytes");
@@ -3417,20 +3417,20 @@ for (let t = 0, e = Me, r = 1, o = 0; t < 24; t++) {
     e = (e << Me ^ (e >> ha) * la) % ca, e & aa && (c ^= Me << (Me << /* @__PURE__ */ BigInt(i)) - Me);
   Qi.push(c);
 }
-const [ua, da] = /* @__PURE__ */ Po(Qi, !0), Qn = (t, e, r) => r > 32 ? Co(t, e, r) : Zo(t, e, r), Fn = (t, e, r) => r > 32 ? Do(t, e, r) : Ho(t, e, r);
+const [ua, da] = /* @__PURE__ */ Po(Qi, !0), Fn = (t, e, r) => r > 32 ? Co(t, e, r) : Zo(t, e, r), ti = (t, e, r) => r > 32 ? Do(t, e, r) : Ho(t, e, r);
 function wa(t, e = 24) {
   const r = new Uint32Array(10);
   for (let o = 24 - e; o < 24; o++) {
     for (let w = 0; w < 10; w++)
       r[w] = t[w] ^ t[w + 10] ^ t[w + 20] ^ t[w + 30] ^ t[w + 40];
     for (let w = 0; w < 10; w += 2) {
-      const d = (w + 8) % 10, y = (w + 2) % 10, x = r[y], v = r[y + 1], E = Qn(x, v, 1) ^ r[d], M = Fn(x, v, 1) ^ r[d + 1];
+      const d = (w + 8) % 10, y = (w + 2) % 10, x = r[y], v = r[y + 1], E = Fn(x, v, 1) ^ r[d], M = ti(x, v, 1) ^ r[d + 1];
       for (let U = 0; U < 50; U += 10)
         t[w + U] ^= E, t[w + U + 1] ^= M;
     }
     let c = t[2], i = t[3];
     for (let w = 0; w < 24; w++) {
-      const d = Ji[w], y = Qn(c, i, d), x = Fn(c, i, d), v = Wi[w];
+      const d = Ji[w], y = Fn(c, i, d), x = ti(c, i, d), v = Wi[w];
       c = t[v], i = t[v + 1], t[v] = y, t[v + 1] = x;
     }
     for (let w = 0; w < 50; w += 10) {
@@ -3451,10 +3451,10 @@ class ar extends bo {
     this.state = new Uint8Array(200), this.state32 = Ve(this.state);
   }
   keccak() {
-    Xe || je(this.state32), wa(this.state32, this.rounds), Xe || je(this.state32), this.posOut = 0, this.pos = 0;
+    Xe || Ke(this.state32), wa(this.state32, this.rounds), Xe || Ke(this.state32), this.posOut = 0, this.pos = 0;
   }
   update(e) {
-    kn(this);
+    Un(this);
     const { blockLen: r, state: o } = this;
     e = xo(e);
     const c = e.length;
@@ -3471,10 +3471,10 @@ class ar extends bo {
       return;
     this.finished = !0;
     const { state: e, suffix: r, pos: o, blockLen: c } = this;
-    e[o] ^= r, r & 128 && o === c - 1 && this.keccak(), e[c - 1] ^= 128, this.keccak();
+    e[o] ^= r, (r & 128) !== 0 && o === c - 1 && this.keccak(), e[c - 1] ^= 128, this.keccak();
   }
   writeInto(e) {
-    kn(this, !1), Eo(e), this.finish();
+    Un(this, !1), Eo(e), this.finish();
     const r = this.state, { blockLen: o } = this;
     for (let c = 0, i = e.length; c < i; ) {
       this.posOut >= o && this.keccak();
@@ -3522,34 +3522,34 @@ const hr = /* @__PURE__ */ Vo({ 256: Yo, 512: zo }, { 256: ga, 512: ma });
 function Qr(t, e, r) {
   return t === "keccak" ? hr(e, void 0, r) : he(e, void 0, void 0, r);
 }
-const mn = {
+const pn = {
   chars: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/",
   coder: Zs,
   type: "base64",
   withPadding: !0
-}, pa = /* @__PURE__ */ Ri(mn), ya = /* @__PURE__ */ Ui(mn, pa), va = /* @__PURE__ */ Ni(mn);
+}, pa = /* @__PURE__ */ Ri(pn), ya = /* @__PURE__ */ Ui(pn, pa), va = /* @__PURE__ */ Ni(pn);
 function to(t, e) {
   if (![33, 65].includes(t.length))
     throw new Error(`Invalid publicKey provided, received ${t.length} bytes input`);
   return t.length === 33 ? t : !Ht || Vt() ? Xo(t) : Te.ProjectivePoint.fromHex(t).toRawBytes(!0);
 }
-function pn(t, e) {
+function yn(t, e) {
   if (![33, 65].includes(t.length))
     throw new Error(`Invalid publicKey provided, received ${t.length} bytes input`);
   if (t.length === 65)
     return t.subarray(1);
   if (!Ht || Vt())
-    return jo(t).subarray(1);
+    return Ko(t).subarray(1);
   const { px: r, py: o } = Te.ProjectivePoint.fromHex(t);
   return Ct(zt(r, pe), zt(o, pe));
 }
 function ba(t, e, r, o = "blake2", c) {
-  const i = V(e).subarray(0, 64), w = V(t), d = !Ht || Vt() ? Ko(w, i, r) : Te.Signature.fromCompact(i).addRecoveryBit(r).recoverPublicKey(w).toRawBytes();
+  const i = V(e).subarray(0, 64), w = V(t), d = !Ht || Vt() ? jo(w, i, r) : Te.Signature.fromCompact(i).addRecoveryBit(r).recoverPublicKey(w).toRawBytes();
   if (!d)
     throw new Error("Unable to recover publicKey from signature");
-  return o === "keccak" ? pn(d) : to(d);
+  return o === "keccak" ? yn(d) : to(d);
 }
-function ti(t, { secretKey: e }, r = "blake2", o) {
+function ei(t, { secretKey: e }, r = "blake2", o) {
   if ((e == null ? void 0 : e.length) !== 32)
     throw new Error("Expected valid secp256k1 secretKey, 32-bytes");
   const c = Qr(r, t, o);
@@ -3558,20 +3558,20 @@ function ti(t, { secretKey: e }, r = "blake2", o) {
   const i = Te.sign(c, e, { lowS: !0 });
   return Ct(zt(i.r, pe), zt(i.s, pe), new Uint8Array([i.recovery || 0]));
 }
-const eo = "ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141".replace(/ /g, ""), Cr = W(`0x${eo}`), Zr = new K(eo, "hex");
+const eo = "ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141".replace(/ /g, ""), Cr = W(`0x${eo}`), Zr = new j(eo, "hex");
 function xa(t, e) {
-  let r = Xr(e, qn);
+  let r = Xr(e, Pn);
   if (r >= Cr)
     throw new Error("Tweak parameter is out of range");
-  if (r += Xr(t, qn), r >= Cr && (r -= Cr), r === Ke)
+  if (r += Xr(t, Pn), r >= Cr && (r -= Cr), r === je)
     throw new Error("Invalid resulting private key");
   return _s(r, pe);
 }
 function Ea(t, e) {
-  const r = new K(e);
+  const r = new j(e);
   if (r.cmp(Zr) >= 0)
     throw new Error("Tweak parameter is out of range");
-  if (r.iadd(new K(t)), r.cmp(Zr) >= 0 && r.isub(Zr), r.isZero())
+  if (r.iadd(new j(t)), r.cmp(Zr) >= 0 && r.isub(Zr), r.isZero())
     throw new Error("Invalid resulting private key");
   return zt(r, pe);
 }
@@ -3587,10 +3587,10 @@ function _a(t, e, r, o = "blake2", c) {
   if (i.length !== 65)
     throw new Error(`Expected signature with 65 bytes, ${i.length} found instead`);
   const w = ba(Qr(o, t), i, i[64], o), d = Qr(o, w, c), y = V(r);
-  return jt(w, y) || (o === "keccak" ? jt(d.slice(-20), y.slice(-20)) : jt(d, y));
+  return Kt(w, y) || (o === "keccak" ? Kt(d.slice(-20), y.slice(-20)) : Kt(d, y));
 }
 function Ba(t) {
-  return [33, 65].includes(t.length) && (t = hr(pn(t))), t.slice(-20);
+  return [33, 65].includes(t.length) && (t = hr(yn(t))), t.slice(-20);
 }
 function ro(t) {
   if (!t)
@@ -3606,23 +3606,23 @@ function ro(t) {
 }
 const Sa = {
   256: rr,
-  512: ui
+  512: di
 }, Aa = {
   256: Jo,
   512: Wo
 };
 function no(t, e, r = 256, o) {
   const c = V(t);
-  return !Ht || Vt() ? Aa[r](c, e) : li(Sa[r], c, e);
+  return !Ht || Vt() ? Aa[r](c, e) : ui(Sa[r], c, e);
 }
-const yn = 2147483648;
+const vn = 2147483648;
 function Ia(t) {
   if (!t.startsWith("m/"))
     return !1;
   const e = t.split("/").slice(1);
   for (const r of e) {
     const o = /^\d+'?$/.test(r) ? parseInt(r.replace(/'$/, ""), 10) : Number.NaN;
-    if (isNaN(o) || o >= yn || o < 0)
+    if (isNaN(o) || o >= vn || o < 0)
       return !1;
   }
   return !0;
@@ -3636,7 +3636,7 @@ function io(t, e) {
   };
 }
 function oo(t, e) {
-  const r = zt(e, Ks), o = e >= yn ? Ct(new Uint8Array(1), t.secretKey, r) : Ct(t.publicKey, r);
+  const r = zt(e, js), o = e >= vn ? Ct(new Uint8Array(1), t.secretKey, r) : Ct(t.publicKey, r);
   try {
     const c = no(t.chainCode, o, 512);
     return io(Ma(t.secretKey, c.slice(0, 32)), c.slice(32));
@@ -3653,21 +3653,21 @@ function Ua(t, e = "") {
     throw new Error("Invalid derivation path");
   const c = e.split("/").slice(1);
   for (const i of c)
-    o = oo(o, parseInt(i, 10) + (i.length > 1 && i.endsWith("'") ? yn : 0));
+    o = oo(o, parseInt(i, 10) + (i.length > 1 && i.endsWith("'") ? vn : 0));
   return o;
 }
 function Na(t, e, r) {
-  return !Ht || Vt() ? Qo(t) : os(t, e);
+  return !Ht || Vt() ? Qo(t) : is(t, e);
 }
 function so(t, e, r) {
-  return !Ht || Vt() ? Fo(t) : ss(t, e);
+  return !Ht || Vt() ? Fo(t) : os(t, e);
 }
 function Ra(t, e = "", r, o = 32) {
   if (so(t)) {
     if (![32, 64].includes(o))
       throw new Error(`Invalid seed length ${o}, expected 32 or 64`);
   } else throw new Error("Invalid bip39 mnemonic specified");
-  return o === 32 ? !Ht || Vt() ? ts(t, e) : Un(t, e).subarray(0, 32) : Un(t, e);
+  return o === 32 ? !Ht || Vt() ? ts(t, e) : Nn(t, e).subarray(0, 32) : Nn(t, e);
 }
 function Oa(t, e = "", r, o) {
   if (so(t, r)) {
@@ -3675,7 +3675,7 @@ function Oa(t, e = "", r, o) {
       return es(t, e);
   } else throw new Error("Invalid bip39 mnemonic specified");
   const c = Na(t, r), i = ee(`mnemonic${e}`);
-  return fs(c, i).password.slice(0, 32);
+  return ss(c, i).password.slice(0, 32);
 }
 function De(t, e) {
   return t << e | t >>> 32 - e;
@@ -3839,13 +3839,13 @@ function Va(t, e, r) {
 function za(t, e, r) {
   return Va(t, e, r);
 }
-function Ya(t, e, r = wi(24)) {
+function Ya(t, e, r = gi(24)) {
   return {
     encrypted: Ha(t, r, e),
     nonce: r
   };
 }
-function ei(t, e, r, o, c, i) {
+function ri(t, e, r, o, c, i) {
   let w = t[e++] ^ r[o++], d = t[e++] ^ r[o++], y = t[e++] ^ r[o++], x = t[e++] ^ r[o++], v = t[e++] ^ r[o++], E = t[e++] ^ r[o++], M = t[e++] ^ r[o++], U = t[e++] ^ r[o++], C = t[e++] ^ r[o++], k = t[e++] ^ r[o++], _ = t[e++] ^ r[o++], S = t[e++] ^ r[o++], L = t[e++] ^ r[o++], A = t[e++] ^ r[o++], q = t[e++] ^ r[o++], D = t[e++] ^ r[o++], R = w, O = d, $ = y, P = x, J = v, T = E, Z = M, p = U, n = C, f = k, a = _, h = S, l = L, m = A, b = q, u = D;
   for (let s = 0; s < 8; s += 2)
     J ^= G(R + l | 0, 7), n ^= G(J + R | 0, 9), l ^= G(n + J | 0, 13), R ^= G(l + n | 0, 18), f ^= G(T + O | 0, 7), m ^= G(f + T | 0, 9), O ^= G(m + f | 0, 13), T ^= G(O + m | 0, 18), b ^= G(a + Z | 0, 7), $ ^= G(b + a | 0, 9), Z ^= G($ + b | 0, 13), a ^= G(Z + $ | 0, 18), P ^= G(u + h | 0, 7), p ^= G(P + u | 0, 9), h ^= G(p + P | 0, 13), u ^= G(h + p | 0, 18), O ^= G(R + P | 0, 7), $ ^= G(O + R | 0, 9), P ^= G($ + O | 0, 13), R ^= G(P + $ | 0, 18), Z ^= G(T + J | 0, 7), p ^= G(Z + T | 0, 9), J ^= G(p + Z | 0, 13), T ^= G(J + p | 0, 18), h ^= G(a + f | 0, 7), n ^= G(h + a | 0, 9), f ^= G(n + h | 0, 13), a ^= G(f + n | 0, 18), l ^= G(u + b | 0, 7), m ^= G(l + u | 0, 9), b ^= G(m + l | 0, 13), u ^= G(b + m | 0, 18);
@@ -3856,7 +3856,7 @@ function Vr(t, e, r, o, c) {
   for (let d = 0; d < 16; d++)
     r[w + d] = t[e + (2 * c - 1) * 16 + d];
   for (let d = 0; d < c; d++, i += 16, e += 16)
-    ei(r, w, t, e, r, i), d > 0 && (w += 16), ei(r, i, t, e += 16, r, w);
+    ri(r, w, t, e, r, i), d > 0 && (w += 16), ri(r, i, t, e += 16, r, w);
 }
 function Xa(t, e, r) {
   const o = _o({
@@ -3867,7 +3867,7 @@ function Xa(t, e, r) {
   if (Ft(c), Ft(i), Ft(w), Ft(d), Ft(y), Ft(x), v !== void 0 && typeof v != "function")
     throw new Error("progressCb should be function");
   const E = 128 * i, M = E / 4;
-  if (c <= 1 || c & c - 1 || c > 2 ** 32)
+  if (c <= 1 || (c & c - 1) !== 0 || c > 2 ** 32)
     throw new Error("Scrypt: N must be larger than 1, a power of 2, and less than 2^32");
   if (w < 0 || w > (2 ** 32 - 1) * 32 / E)
     throw new Error("Scrypt: p must be a positive integer less than or equal to ((2^32 - 1) * 32) / (128 * r)");
@@ -3876,7 +3876,7 @@ function Xa(t, e, r) {
   const U = E * (c + w);
   if (U > x)
     throw new Error(`Scrypt: parameters too large, ${U} (128 * r * (N + p)) > ${x} (maxmem)`);
-  const C = di(rr, t, e, { c: 1, dkLen: E * w }), k = Ve(C), _ = Ve(new Uint8Array(E * c)), S = Ve(new Uint8Array(E));
+  const C = wi(rr, t, e, { c: 1, dkLen: E * w }), k = Ve(C), _ = Ve(new Uint8Array(E * c)), S = Ve(new Uint8Array(E));
   let L = () => {
   };
   if (v) {
@@ -3888,13 +3888,13 @@ function Xa(t, e, r) {
   }
   return { N: c, r: i, p: w, dkLen: d, blockSize32: M, V: _, B32: k, B: C, tmp: S, blockMixCb: L, asyncTick: y };
 }
-function ja(t, e, r, o, c) {
-  const i = di(rr, t, r, { c: 1, dkLen: e });
+function Ka(t, e, r, o, c) {
+  const i = wi(rr, t, r, { c: 1, dkLen: e });
   return r.fill(0), o.fill(0), c.fill(0), i;
 }
-function Ka(t, e, r) {
+function ja(t, e, r) {
   const { N: o, r: c, p: i, dkLen: w, blockSize32: d, V: y, B32: x, B: v, tmp: E, blockMixCb: M } = Xa(t, e, r);
-  Xe || je(x);
+  Xe || Ke(x);
   for (let U = 0; U < i; U++) {
     const C = d * U;
     for (let k = 0; k < d; k++)
@@ -3909,18 +3909,18 @@ function Ka(t, e, r) {
       Vr(E, 0, x, C, c), M();
     }
   }
-  return Xe || je(x), ja(t, w, v, y, E);
+  return Xe || Ke(x), Ka(t, w, v, y, E);
 }
 const Ye = {
   N: 32768,
   p: 1,
   r: 8
 };
-function co(t, e = wi(), r = Ye, o) {
+function co(t, e = gi(), r = Ye, o) {
   const c = V(t);
   return {
     params: r,
-    password: !Ht || Vt() ? rs(c, e, Math.log2(r.N), r.r, r.p) : Ka(c, e, on({ dkLen: 64 }, r)),
+    password: !Ht || Vt() ? rs(c, e, Math.log2(r.N), r.r, r.p) : ja(c, e, on({ dkLen: 64 }, r)),
     salt: e
   };
 }
@@ -3933,7 +3933,7 @@ function Ga(t) {
 function Wa(t, { N: e, p: r, r: o }) {
   return Ct(t, zt(e, Or), zt(r, Or), zt(o, Or));
 }
-const lo = ["scrypt", "xsalsa20-poly1305"], Ja = ["none"], Qa = "3", ri = 24, Fa = 32 + 3 * 4;
+const lo = ["scrypt", "xsalsa20-poly1305"], Ja = ["none"], Qa = "3", ni = 24, Fa = 32 + 3 * 4;
 function t0(t, e, r = lo) {
   if (t) {
     if (r.includes("xsalsa20-poly1305") && !e)
@@ -3947,7 +3947,7 @@ function t0(t, e, r = lo) {
       c = co(e, w, i).password, t = t.subarray(Fa);
     } else
       c = ee(e);
-    o = za(t.subarray(ri), t.subarray(0, ri), ys(c, 256, !0));
+    o = za(t.subarray(ni), t.subarray(0, ni), ys(c, 256, !0));
   }
   if (!o)
     throw new Error("Unable to decode using the supplied passphrase");
@@ -3963,9 +3963,9 @@ function e0(t, e, r) {
     }
   };
 }
-const ni = (t) => (e, r, o) => _a(e, r, o, t), uo = [
-  ["ecdsa", ni("blake2")],
-  ["ethereum", ni("keccak")]
+const ii = (t) => (e, r, o) => _a(e, r, o, t), uo = [
+  ["ecdsa", ii("blake2")],
+  ["ethereum", ii("keccak")]
 ], r0 = [
   ["ed25519", zi],
   ["sr25519", Gi],
@@ -4002,22 +4002,22 @@ function i0(t, { message: e, publicKey: r, signature: o }) {
 function o0(t) {
   return [0, 1, 2].includes(t[0]) && [65, 66].includes(t.length) ? i0 : wo;
 }
-function ii(t, e, r) {
+function oi(t, e, r) {
   const o = V(e);
   if (![64, 65, 66].includes(o.length))
     throw new Error(`Invalid signature length, expected [64..66] bytes, found ${o.length}`);
   const c = ge(r), i = { message: V(t), publicKey: c, signature: o }, w = { crypto: "none", isValid: !1, isWrapped: We(i.message, !0), publicKey: c }, d = We(i.message, !1), y = o0(o);
   return y(w, i), w.crypto !== "none" || w.isWrapped && !d ? w : (i.message = d ? bs(i.message) : xs(i.message), y(w, i));
 }
-const s0 = [as, $s], f0 = { name: "@polkadot/keyring", path: import.meta && import.meta.url ? new URL(import.meta.url).pathname.substring(0, new URL(import.meta.url).pathname.lastIndexOf("/") + 1) : "auto", type: "esm", version: "12.6.2" };
-us(f0, null, s0);
-const ue = new Uint8Array([161, 35, 3, 33, 0]), er = new Uint8Array([48, 83, 2, 1, 1, 48, 5, 6, 3, 43, 101, 112, 4, 34, 4, 32]), a0 = 32, oi = 64, h0 = 32, _e = er.length;
+const s0 = [fs, $s], f0 = { name: "@polkadot/keyring", path: import.meta && import.meta.url ? new URL(import.meta.url).pathname.substring(0, new URL(import.meta.url).pathname.lastIndexOf("/") + 1) : "auto", type: "esm", version: "12.6.2" };
+ls(f0, null, s0);
+const ue = new Uint8Array([161, 35, 3, 33, 0]), er = new Uint8Array([48, 83, 2, 1, 1, 48, 5, 6, 3, 43, 101, 112, 4, 34, 4, 32]), a0 = 32, si = 64, h0 = 32, _e = er.length;
 function c0(t, e, r) {
   const o = Array.isArray(r) || r === void 0 ? r : [r], c = t0(e, t, o), i = c.subarray(0, er.length);
-  if (!jt(i, er))
+  if (!Kt(i, er))
     throw new Error("Invalid Pkcs8 header found in body");
-  let w = c.subarray(_e, _e + oi), d = _e + oi, y = c.subarray(d, d + ue.length);
-  if (!jt(y, ue) && (d = _e + h0, w = c.subarray(_e, d), y = c.subarray(d, d + ue.length), !jt(y, ue)))
+  let w = c.subarray(_e, _e + si), d = _e + si, y = c.subarray(d, d + ue.length);
+  if (!Kt(y, ue) && (d = _e + h0, w = c.subarray(_e, d), y = c.subarray(d, d + ue.length), !Kt(y, ue)))
     throw new Error("Invalid Pkcs8 divider found in body");
   const x = d + ue.length;
   return {
@@ -4042,29 +4042,29 @@ function u0(t, { address: e, meta: r }, o, c) {
 }
 const d0 = new Uint8Array(), w0 = {
   ecdsa: be,
-  ed25519: gn,
+  ed25519: mn,
   ethereum: be,
-  sr25519: Ki
-}, si = {
+  sr25519: ji
+}, fi = {
   ecdsa: new Uint8Array([2]),
   ed25519: new Uint8Array([0]),
   ethereum: new Uint8Array([2]),
   sr25519: new Uint8Array([1])
-}, fi = {
-  ecdsa: (t, e) => ti(t, e, "blake2"),
+}, ai = {
+  ecdsa: (t, e) => ei(t, e, "blake2"),
   ed25519: Gf,
-  ethereum: (t, e) => ti(t, e, "keccak"),
+  ethereum: (t, e) => ei(t, e, "keccak"),
   sr25519: na
 }, He = {
   ecdsa: (t) => t.length > 32 ? he(t) : t,
   ed25519: (t) => t,
-  ethereum: (t) => t.length === 20 ? t : hr(pn(t)),
+  ethereum: (t) => t.length === 20 ? t : hr(yn(t)),
   sr25519: (t) => t
 };
 function Be(t) {
   return !t || bi(t);
 }
-function ai(t, e, r) {
+function hi(t, e, r) {
   return he(Ct(e || "", r || "", t));
 }
 function de({ toSS58: t, type: e }, { publicKey: r, secretKey: o }, c = {}, i = null, w) {
@@ -4107,7 +4107,7 @@ function de({ toSS58: t, type: e }, { publicKey: r, secretKey: o }, c = {}, i =
         throw new Error("Unable to derive on this keypair");
       if (Be(o))
         throw new Error("Cannot derive on a locked keypair");
-      const { path: M } = Li(v), U = ji({ publicKey: r, secretKey: o }, M, e);
+      const { path: M } = Li(v), U = Ki({ publicKey: r, secretKey: o }, M, e);
       return de({ toSS58: t, type: e }, U, E, null);
     },
     encodePkcs8: (v) => y(v),
@@ -4120,29 +4120,29 @@ function de({ toSS58: t, type: e }, { publicKey: r, secretKey: o }, c = {}, i =
     sign: (v, E = {}) => {
       if (Be(o))
         throw new Error("Cannot sign with a locked key pair");
-      return Ct(E.withType ? si[e] : d0, fi[e](V(v), { publicKey: r, secretKey: o }));
+      return Ct(E.withType ? fi[e] : d0, ai[e](V(v), { publicKey: r, secretKey: o }));
     },
     toJson: (v) => {
       const E = ["ecdsa", "ethereum"].includes(e) ? r.length === 20 ? Ae(r) : Ae(to(r)) : x();
       return u0(e, { address: E, meta: c }, y(v), !!v);
     },
     unlock: (v) => d(v),
-    verify: (v, E, M) => ii(v, E, He[e](V(M))).isValid,
+    verify: (v, E, M) => oi(v, E, He[e](V(M))).isValid,
     vrfSign: (v, E, M) => {
       if (Be(o))
         throw new Error("Cannot sign with a locked key pair");
       if (e === "sr25519")
         return ia(v, { secretKey: o }, E, M);
-      const U = fi[e](V(v), { publicKey: r, secretKey: o });
-      return Ct(ai(U, E, M), U);
+      const U = ai[e](V(v), { publicKey: r, secretKey: o });
+      return Ct(hi(U, E, M), U);
     },
-    vrfVerify: (v, E, M, U, C) => e === "sr25519" ? oa(v, E, r, U, C) : ii(v, Ct(si[e], E.subarray(32)), He[e](V(M))).isValid && jt(E.subarray(0, 32), ai(E.subarray(32), U, C))
+    vrfVerify: (v, E, M, U, C) => e === "sr25519" ? oa(v, E, r, U, C) : oi(v, Ct(fi[e], E.subarray(32)), He[e](V(M))).isValid && Kt(E.subarray(0, 32), hi(E.subarray(32), U, C))
   };
 }
 const g0 = "bottom drive obey lake curtain smoke basket hold race lonely fit walk";
 class m0 {
   constructor() {
-    Kt(this, "__internal__map", {});
+    jt(this, "__internal__map", {});
   }
   add(e) {
     return this.__internal__map[ge(e.address).toString()] = e, e;
@@ -4162,24 +4162,24 @@ class m0 {
 }
 const zr = {
   ecdsa: (t) => be(t),
-  ed25519: (t) => gn(t),
+  ed25519: (t) => mn(t),
   ethereum: (t) => be(t),
-  sr25519: (t) => Ki(t)
+  sr25519: (t) => ji(t)
 };
 function p0({ publicKey: t }) {
   return t;
 }
 class L0 {
   constructor(e = {}) {
-    Kt(this, "__internal__pairs");
-    Kt(this, "__internal__type");
-    Kt(this, "__internal__ss58");
-    Kt(this, "decodeAddress", ge);
+    jt(this, "__internal__pairs");
+    jt(this, "__internal__type");
+    jt(this, "__internal__ss58");
+    jt(this, "decodeAddress", ge);
     /**
      * @name encodeAddress
      * @description Encodes the input into an ss58 representation
      */
-    Kt(this, "encodeAddress", (e, r) => this.type === "ethereum" ? ro(e) : sa(e, r ?? this.__internal__ss58));
+    jt(this, "encodeAddress", (e, r) => this.type === "ethereum" ? ro(e) : sa(e, r ?? this.__internal__ss58));
     if (e.type = e.type || "ed25519", !["ecdsa", "ethereum", "ed25519", "sr25519"].includes(e.type || "undefined"))
       throw new Error(`Expected a keyring type of either 'ed25519', 'sr25519', 'ethereum' or 'ecdsa', found '${e.type || "unknown"}`);
     this.__internal__pairs = new m0(), this.__internal__ss58 = e.ss58Format, this.__internal__type = e.type;
@@ -4308,7 +4308,7 @@ class L0 {
         x = ee(y.padEnd(32));
       }
     }
-    const E = o === "ethereum" ? v ? zr[o](x) : Ua(x, i.substring(1)) : ji(zr[o](x), d, o);
+    const E = o === "ethereum" ? v ? zr[o](x) : Ua(x, i.substring(1)) : Ki(zr[o](x), d, o);
     return de({ toSS58: this.encodeAddress, type: o }, E, r, null);
   }
   /**