@prosopo/procaptcha-bundle 2.6.12 → 3.0.6

package/dist/bundle/index-BeN3et18.js

@@ -1,4844 +0,0 @@
-var Jo = Object.defineProperty;
-var Fo = (t, e, r) => e in t ? Jo(t, e, { enumerable: !0, configurable: !0, writable: !0, value: r }) : t[e] = r;
-var Jt = (t, e, r) => Fo(t, typeof e != "symbol" ? e + "" : e, r);
-import { x as qi, s as ce, d as Qo, f as ts, H as es, n as se, u as Je, i as tr, b as er, e as Qn, t as rs, g as ns, o as is, h as os, r as j } from "./toU8a-CPMbkkSw.js";
-import { b as on, B as F, c as ke, d as fe, u as G, R as ss, e as fs, f as we, g as de, j as Vt, i as zt, s as as, k as cs, l as hs, m as ls, n as us, o as ds, p as ws, q as gs, r as ms, v as ps, t as ys, x as xs, y as vs, z as bs, A as Es, C as _s, D as Ms, E as As, F as Bs, G as Ss, H as Is, I as Us, J as ks, K as Ns, L as Rs, M as Ls, N as Os, O as Ts, P as Hs, Q as qs } from "./hash-CrwduMDb.js";
-import { g as $s } from "./_commonjsHelpers-DaMA6jEr.js";
-import { s as vn } from "./sha256-CGE_4eEY.js";
-import { h as Cs, s as Ds, m as Ps, v as Zs, a as ti, p as Vs, b as $i } from "./bip39-D7YSihxf.js";
-import { a as Ci } from "./asU8a-BixKX-w0.js";
-import { o as bn } from "./spread-DEmVz7RJ.js";
-import { n as Re } from "./emotion-element-5486c51c.browser.esm-Bjt1gs1F.js";
-const zs = { 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" }, Gs = "POLKADOTJS_DISABLE_ESM_CJS_WARNING";
-function Ys(t) {
-  const e = qi;
-  return e.__polkadotjs || (e.__polkadotjs = {}), e.__polkadotjs[t] || (e.__polkadotjs[t] = []), e.__polkadotjs[t];
-}
-function Ws(t, e) {
-  if (t)
-    return t;
-  if (on(e))
-    try {
-      return e() || "";
-    } catch {
-      return "";
-    }
-  return e || "";
-}
-function Xs({ name: t, path: e, type: r, version: i }, a, o = []) {
-  var E, M;
-  if (!t.startsWith("@polkadot"))
-    throw new Error(`Invalid package descriptor ${t}`);
-  const l = Ys(t);
-  l.push({ path: Ws(e, a), type: r, version: i });
-  const u = l.every((S) => S.version === i), m = ((M = (E = qi.process) == null ? void 0 : E.env) == null ? void 0 : M[Gs]) === "1";
-  l.length !== 1 && !(m && u) || o.filter((S) => S && S.version !== i);
-}
-const rr = /* @__PURE__ */ F(0), nr = /* @__PURE__ */ F(1);
-Number.MAX_SAFE_INTEGER;
-const ei = F(256), ri = F(256 * 256), Ks = F("0x10000000000000000");
-function sn(t, { isLe: e = !0, isNegative: r = !1 } = {}) {
-  e || (t = t.slice().reverse());
-  const i = t.length;
-  if (r && i && t[i - 1] & 128) {
-    switch (i) {
-      case 0:
-        return F(0);
-      case 1:
-        return F((t[0] ^ 255) * -1 - 1);
-      case 2:
-        return F((t[0] + (t[1] << 8) ^ 65535) * -1 - 1);
-      case 4:
-        return F((t[0] + (t[1] << 8) + (t[2] << 16) + t[3] * 16777216 ^ 4294967295) * -1 - 1);
-    }
-    const o = new DataView(t.buffer, t.byteOffset);
-    if (i === 8)
-      return o.getBigInt64(0, !0);
-    let l = F(0);
-    const u = i % 2;
-    for (let m = i - 2; m >= u; m -= 2)
-      l = l * ri + F(o.getUint16(m, !0) ^ 65535);
-    return u && (l = l * ei + F(t[0] ^ 255)), l * -nr - nr;
-  }
-  switch (i) {
-    case 0:
-      return F(0);
-    case 1:
-      return F(t[0]);
-    case 2:
-      return F(t[0] + (t[1] << 8));
-    case 4:
-      return F(t[0] + (t[1] << 8) + (t[2] << 16) + t[3] * 16777216);
-  }
-  const a = new DataView(t.buffer, t.byteOffset);
-  switch (i) {
-    case 8:
-      return a.getBigUint64(0, !0);
-    case 16:
-      return a.getBigUint64(8, !0) * Ks + a.getBigUint64(0, !0);
-    default: {
-      let o = F(0);
-      const l = i % 2;
-      for (let u = i - 2; u >= l; u -= 2)
-        o = o * ri + F(a.getUint16(u, !0));
-      return l && (o = o * ei + F(t[0])), o;
-    }
-  }
-}
-function js(t, { isLe: e = !1, isNegative: r = !1 } = {}) {
-  return !t || t === "0x" ? F(0) : sn(ke(t), { isLe: e, isNegative: r });
-}
-var En = { exports: {} }, Js = En.exports;
-(function(t) {
-  (function(e, r) {
-    function i(y, n) {
-      if (!y) throw new Error(n || "Assertion failed");
-    }
-    function a(y, n) {
-      y.super_ = n;
-      var f = function() {
-      };
-      f.prototype = n.prototype, y.prototype = new f(), y.prototype.constructor = y;
-    }
-    function o(y, n, f) {
-      if (o.isBN(y))
-        return y;
-      this.negative = 0, this.words = null, this.length = 0, this.red = null, y !== null && ((n === "le" || n === "be") && (f = n, n = 10), this._init(y || 0, n || 10, f || "be"));
-    }
-    typeof e == "object" ? e.exports = o : r.BN = o, o.BN = o, o.wordSize = 26;
-    var l;
-    try {
-      typeof window < "u" && typeof window.Buffer < "u" ? l = window.Buffer : l = require("buffer").Buffer;
-    } catch {
-    }
-    o.isBN = function(n) {
-      return n instanceof o ? !0 : n !== null && typeof n == "object" && n.constructor.wordSize === o.wordSize && Array.isArray(n.words);
-    }, o.max = function(n, f) {
-      return n.cmp(f) > 0 ? n : f;
-    }, o.min = function(n, f) {
-      return n.cmp(f) < 0 ? n : f;
-    }, o.prototype._init = function(n, f, c) {
-      if (typeof n == "number")
-        return this._initNumber(n, f, c);
-      if (typeof n == "object")
-        return this._initArray(n, f, c);
-      f === "hex" && (f = 16), i(f === (f | 0) && f >= 2 && f <= 36), n = n.toString().replace(/\s+/g, "");
-      var g = 0;
-      n[0] === "-" && (g++, this.negative = 1), g < n.length && (f === 16 ? this._parseHex(n, g, c) : (this._parseBase(n, f, g), c === "le" && this._initArray(this.toArray(), f, c)));
-    }, o.prototype._initNumber = function(n, f, c) {
-      n < 0 && (this.negative = 1, n = -n), n < 67108864 ? (this.words = [n & 67108863], this.length = 1) : n < 4503599627370496 ? (this.words = [
-        n & 67108863,
-        n / 67108864 & 67108863
-      ], this.length = 2) : (i(n < 9007199254740992), this.words = [
-        n & 67108863,
-        n / 67108864 & 67108863,
-        1
-      ], this.length = 3), c === "le" && this._initArray(this.toArray(), f, c);
-    }, o.prototype._initArray = function(n, f, c) {
-      if (i(typeof n.length == "number"), n.length <= 0)
-        return this.words = [0], this.length = 1, this;
-      this.length = Math.ceil(n.length / 3), this.words = new Array(this.length);
-      for (var g = 0; g < this.length; g++)
-        this.words[g] = 0;
-      var d, w, x = 0;
-      if (c === "be")
-        for (g = n.length - 1, d = 0; g >= 0; g -= 3)
-          w = n[g] | n[g - 1] << 8 | n[g - 2] << 16, this.words[d] |= w << x & 67108863, this.words[d + 1] = w >>> 26 - x & 67108863, x += 24, x >= 26 && (x -= 26, d++);
-      else if (c === "le")
-        for (g = 0, d = 0; g < n.length; g += 3)
-          w = n[g] | n[g + 1] << 8 | n[g + 2] << 16, this.words[d] |= w << x & 67108863, this.words[d + 1] = w >>> 26 - x & 67108863, x += 24, x >= 26 && (x -= 26, d++);
-      return this._strip();
-    };
-    function u(y, n) {
-      var f = y.charCodeAt(n);
-      if (f >= 48 && f <= 57)
-        return f - 48;
-      if (f >= 65 && f <= 70)
-        return f - 55;
-      if (f >= 97 && f <= 102)
-        return f - 87;
-      i(!1, "Invalid character in " + y);
-    }
-    function m(y, n, f) {
-      var c = u(y, f);
-      return f - 1 >= n && (c |= u(y, f - 1) << 4), c;
-    }
-    o.prototype._parseHex = function(n, f, c) {
-      this.length = Math.ceil((n.length - f) / 6), this.words = new Array(this.length);
-      for (var g = 0; g < this.length; g++)
-        this.words[g] = 0;
-      var d = 0, w = 0, x;
-      if (c === "be")
-        for (g = n.length - 1; g >= f; g -= 2)
-          x = m(n, f, g) << d, this.words[w] |= x & 67108863, d >= 18 ? (d -= 18, w += 1, this.words[w] |= x >>> 26) : d += 8;
-      else {
-        var h = n.length - f;
-        for (g = h % 2 === 0 ? f + 1 : f; g < n.length; g += 2)
-          x = m(n, f, g) << d, this.words[w] |= x & 67108863, d >= 18 ? (d -= 18, w += 1, this.words[w] |= x >>> 26) : d += 8;
-      }
-      this._strip();
-    };
-    function b(y, n, f, c) {
-      for (var g = 0, d = 0, w = Math.min(y.length, f), x = n; x < w; x++) {
-        var h = y.charCodeAt(x) - 48;
-        g *= c, h >= 49 ? d = h - 49 + 10 : h >= 17 ? d = h - 17 + 10 : d = h, i(h >= 0 && d < c, "Invalid character"), g += d;
-      }
-      return g;
-    }
-    o.prototype._parseBase = function(n, f, c) {
-      this.words = [0], this.length = 1;
-      for (var g = 0, d = 1; d <= 67108863; d *= f)
-        g++;
-      g--, d = d / f | 0;
-      for (var w = n.length - c, x = w % g, h = Math.min(w, w - x) + c, s = 0, p = c; p < h; p += g)
-        s = b(n, p, p + g, f), this.imuln(d), this.words[0] + s < 67108864 ? this.words[0] += s : this._iaddn(s);
-      if (x !== 0) {
-        var k = 1;
-        for (s = b(n, p, n.length, f), p = 0; p < x; p++)
-          k *= f;
-        this.imuln(k), this.words[0] + s < 67108864 ? this.words[0] += s : this._iaddn(s);
-      }
-      this._strip();
-    }, o.prototype.copy = function(n) {
-      n.words = new Array(this.length);
-      for (var f = 0; f < this.length; f++)
-        n.words[f] = this.words[f];
-      n.length = this.length, n.negative = this.negative, n.red = this.red;
-    };
-    function v(y, n) {
-      y.words = n.words, y.length = n.length, y.negative = n.negative, y.red = n.red;
-    }
-    if (o.prototype._move = function(n) {
-      v(n, this);
-    }, o.prototype.clone = function() {
-      var n = new o(null);
-      return this.copy(n), n;
-    }, o.prototype._expand = function(n) {
-      for (; this.length < n; )
-        this.words[this.length++] = 0;
-      return this;
-    }, o.prototype._strip = function() {
-      for (; this.length > 1 && this.words[this.length - 1] === 0; )
-        this.length--;
-      return this._normSign();
-    }, o.prototype._normSign = function() {
-      return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;
-    }, typeof Symbol < "u" && typeof Symbol.for == "function")
-      try {
-        o.prototype[Symbol.for("nodejs.util.inspect.custom")] = E;
-      } catch {
-        o.prototype.inspect = E;
-      }
-    else
-      o.prototype.inspect = E;
-    function E() {
-      return (this.red ? "<BN-R: " : "<BN: ") + this.toString(16) + ">";
-    }
-    var M = [
-      "",
-      "0",
-      "00",
-      "000",
-      "0000",
-      "00000",
-      "000000",
-      "0000000",
-      "00000000",
-      "000000000",
-      "0000000000",
-      "00000000000",
-      "000000000000",
-      "0000000000000",
-      "00000000000000",
-      "000000000000000",
-      "0000000000000000",
-      "00000000000000000",
-      "000000000000000000",
-      "0000000000000000000",
-      "00000000000000000000",
-      "000000000000000000000",
-      "0000000000000000000000",
-      "00000000000000000000000",
-      "000000000000000000000000",
-      "0000000000000000000000000"
-    ], S = [
-      0,
-      0,
-      25,
-      16,
-      12,
-      11,
-      10,
-      9,
-      8,
-      8,
-      7,
-      7,
-      7,
-      7,
-      6,
-      6,
-      6,
-      6,
-      6,
-      6,
-      6,
-      5,
-      5,
-      5,
-      5,
-      5,
-      5,
-      5,
-      5,
-      5,
-      5,
-      5,
-      5,
-      5,
-      5,
-      5,
-      5
-    ], O = [
-      0,
-      0,
-      33554432,
-      43046721,
-      16777216,
-      48828125,
-      60466176,
-      40353607,
-      16777216,
-      43046721,
-      1e7,
-      19487171,
-      35831808,
-      62748517,
-      7529536,
-      11390625,
-      16777216,
-      24137569,
-      34012224,
-      47045881,
-      64e6,
-      4084101,
-      5153632,
-      6436343,
-      7962624,
-      9765625,
-      11881376,
-      14348907,
-      17210368,
-      20511149,
-      243e5,
-      28629151,
-      33554432,
-      39135393,
-      45435424,
-      52521875,
-      60466176
-    ];
-    o.prototype.toString = function(n, f) {
-      n = n || 10, f = f | 0 || 1;
-      var c;
-      if (n === 16 || n === "hex") {
-        c = "";
-        for (var g = 0, d = 0, w = 0; w < this.length; w++) {
-          var x = this.words[w], h = ((x << g | d) & 16777215).toString(16);
-          d = x >>> 24 - g & 16777215, g += 2, g >= 26 && (g -= 26, w--), d !== 0 || w !== this.length - 1 ? c = M[6 - h.length] + h + c : c = h + c;
-        }
-        for (d !== 0 && (c = d.toString(16) + c); c.length % f !== 0; )
-          c = "0" + c;
-        return this.negative !== 0 && (c = "-" + c), c;
-      }
-      if (n === (n | 0) && n >= 2 && n <= 36) {
-        var s = S[n], p = O[n];
-        c = "";
-        var k = this.clone();
-        for (k.negative = 0; !k.isZero(); ) {
-          var I = k.modrn(p).toString(n);
-          k = k.idivn(p), k.isZero() ? c = I + c : c = M[s - I.length] + I + c;
-        }
-        for (this.isZero() && (c = "0" + c); c.length % f !== 0; )
-          c = "0" + c;
-        return this.negative !== 0 && (c = "-" + c), c;
-      }
-      i(!1, "Base should be between 2 and 36");
-    }, o.prototype.toNumber = function() {
-      var n = this.words[0];
-      return this.length === 2 ? n += this.words[1] * 67108864 : this.length === 3 && this.words[2] === 1 ? n += 4503599627370496 + this.words[1] * 67108864 : this.length > 2 && i(!1, "Number can only safely store up to 53 bits"), this.negative !== 0 ? -n : n;
-    }, o.prototype.toJSON = function() {
-      return this.toString(16, 2);
-    }, l && (o.prototype.toBuffer = function(n, f) {
-      return this.toArrayLike(l, n, f);
-    }), o.prototype.toArray = function(n, f) {
-      return this.toArrayLike(Array, n, f);
-    };
-    var A = function(n, f) {
-      return n.allocUnsafe ? n.allocUnsafe(f) : new n(f);
-    };
-    o.prototype.toArrayLike = function(n, f, c) {
-      this._strip();
-      var g = this.byteLength(), d = c || Math.max(1, g);
-      i(g <= d, "byte array longer than desired length"), i(d > 0, "Requested array length <= 0");
-      var w = A(n, d), x = f === "le" ? "LE" : "BE";
-      return this["_toArrayLike" + x](w, g), w;
-    }, o.prototype._toArrayLikeLE = function(n, f) {
-      for (var c = 0, g = 0, d = 0, w = 0; d < this.length; d++) {
-        var x = this.words[d] << w | g;
-        n[c++] = x & 255, c < n.length && (n[c++] = x >> 8 & 255), c < n.length && (n[c++] = x >> 16 & 255), w === 6 ? (c < n.length && (n[c++] = x >> 24 & 255), g = 0, w = 0) : (g = x >>> 24, w += 2);
-      }
-      if (c < n.length)
-        for (n[c++] = g; c < n.length; )
-          n[c++] = 0;
-    }, o.prototype._toArrayLikeBE = function(n, f) {
-      for (var c = n.length - 1, g = 0, d = 0, w = 0; d < this.length; d++) {
-        var x = this.words[d] << w | g;
-        n[c--] = x & 255, c >= 0 && (n[c--] = x >> 8 & 255), c >= 0 && (n[c--] = x >> 16 & 255), w === 6 ? (c >= 0 && (n[c--] = x >> 24 & 255), g = 0, w = 0) : (g = x >>> 24, w += 2);
-      }
-      if (c >= 0)
-        for (n[c--] = g; c >= 0; )
-          n[c--] = 0;
-    }, Math.clz32 ? o.prototype._countBits = function(n) {
-      return 32 - Math.clz32(n);
-    } : o.prototype._countBits = function(n) {
-      var f = n, c = 0;
-      return f >= 4096 && (c += 13, f >>>= 13), f >= 64 && (c += 7, f >>>= 7), f >= 8 && (c += 4, f >>>= 4), f >= 2 && (c += 2, f >>>= 2), c + f;
-    }, o.prototype._zeroBits = function(n) {
-      if (n === 0) return 26;
-      var f = n, c = 0;
-      return (f & 8191) === 0 && (c += 13, f >>>= 13), (f & 127) === 0 && (c += 7, f >>>= 7), (f & 15) === 0 && (c += 4, f >>>= 4), (f & 3) === 0 && (c += 2, f >>>= 2), (f & 1) === 0 && c++, c;
-    }, o.prototype.bitLength = function() {
-      var n = this.words[this.length - 1], f = this._countBits(n);
-      return (this.length - 1) * 26 + f;
-    };
-    function D(y) {
-      for (var n = new Array(y.bitLength()), f = 0; f < n.length; f++) {
-        var c = f / 26 | 0, g = f % 26;
-        n[f] = y.words[c] >>> g & 1;
-      }
-      return n;
-    }
-    o.prototype.zeroBits = function() {
-      if (this.isZero()) return 0;
-      for (var n = 0, f = 0; f < this.length; f++) {
-        var c = this._zeroBits(this.words[f]);
-        if (n += c, c !== 26) break;
-      }
-      return n;
-    }, o.prototype.byteLength = function() {
-      return Math.ceil(this.bitLength() / 8);
-    }, o.prototype.toTwos = function(n) {
-      return this.negative !== 0 ? this.abs().inotn(n).iaddn(1) : this.clone();
-    }, o.prototype.fromTwos = function(n) {
-      return this.testn(n - 1) ? this.notn(n).iaddn(1).ineg() : this.clone();
-    }, o.prototype.isNeg = function() {
-      return this.negative !== 0;
-    }, o.prototype.neg = function() {
-      return this.clone().ineg();
-    }, o.prototype.ineg = function() {
-      return this.isZero() || (this.negative ^= 1), this;
-    }, o.prototype.iuor = function(n) {
-      for (; this.length < n.length; )
-        this.words[this.length++] = 0;
-      for (var f = 0; f < n.length; f++)
-        this.words[f] = this.words[f] | n.words[f];
-      return this._strip();
-    }, o.prototype.ior = function(n) {
-      return i((this.negative | n.negative) === 0), this.iuor(n);
-    }, o.prototype.or = function(n) {
-      return this.length > n.length ? this.clone().ior(n) : n.clone().ior(this);
-    }, o.prototype.uor = function(n) {
-      return this.length > n.length ? this.clone().iuor(n) : n.clone().iuor(this);
-    }, o.prototype.iuand = function(n) {
-      var f;
-      this.length > n.length ? f = n : f = this;
-      for (var c = 0; c < f.length; c++)
-        this.words[c] = this.words[c] & n.words[c];
-      return this.length = f.length, this._strip();
-    }, o.prototype.iand = function(n) {
-      return i((this.negative | n.negative) === 0), this.iuand(n);
-    }, o.prototype.and = function(n) {
-      return this.length > n.length ? this.clone().iand(n) : n.clone().iand(this);
-    }, o.prototype.uand = function(n) {
-      return this.length > n.length ? this.clone().iuand(n) : n.clone().iuand(this);
-    }, o.prototype.iuxor = function(n) {
-      var f, c;
-      this.length > n.length ? (f = this, c = n) : (f = n, c = this);
-      for (var g = 0; g < c.length; g++)
-        this.words[g] = f.words[g] ^ c.words[g];
-      if (this !== f)
-        for (; g < f.length; g++)
-          this.words[g] = f.words[g];
-      return this.length = f.length, this._strip();
-    }, o.prototype.ixor = function(n) {
-      return i((this.negative | n.negative) === 0), this.iuxor(n);
-    }, o.prototype.xor = function(n) {
-      return this.length > n.length ? this.clone().ixor(n) : n.clone().ixor(this);
-    }, o.prototype.uxor = function(n) {
-      return this.length > n.length ? this.clone().iuxor(n) : n.clone().iuxor(this);
-    }, o.prototype.inotn = function(n) {
-      i(typeof n == "number" && n >= 0);
-      var f = Math.ceil(n / 26) | 0, c = n % 26;
-      this._expand(f), c > 0 && f--;
-      for (var g = 0; g < f; g++)
-        this.words[g] = ~this.words[g] & 67108863;
-      return c > 0 && (this.words[g] = ~this.words[g] & 67108863 >> 26 - c), this._strip();
-    }, o.prototype.notn = function(n) {
-      return this.clone().inotn(n);
-    }, o.prototype.setn = function(n, f) {
-      i(typeof n == "number" && n >= 0);
-      var c = n / 26 | 0, g = n % 26;
-      return this._expand(c + 1), f ? this.words[c] = this.words[c] | 1 << g : this.words[c] = this.words[c] & ~(1 << g), this._strip();
-    }, o.prototype.iadd = function(n) {
-      var f;
-      if (this.negative !== 0 && n.negative === 0)
-        return this.negative = 0, f = this.isub(n), this.negative ^= 1, this._normSign();
-      if (this.negative === 0 && n.negative !== 0)
-        return n.negative = 0, f = this.isub(n), n.negative = 1, f._normSign();
-      var c, g;
-      this.length > n.length ? (c = this, g = n) : (c = n, g = this);
-      for (var d = 0, w = 0; w < g.length; w++)
-        f = (c.words[w] | 0) + (g.words[w] | 0) + d, this.words[w] = f & 67108863, d = f >>> 26;
-      for (; d !== 0 && w < c.length; w++)
-        f = (c.words[w] | 0) + d, this.words[w] = f & 67108863, d = f >>> 26;
-      if (this.length = c.length, d !== 0)
-        this.words[this.length] = d, this.length++;
-      else if (c !== this)
-        for (; w < c.length; w++)
-          this.words[w] = c.words[w];
-      return this;
-    }, o.prototype.add = function(n) {
-      var f;
-      return n.negative !== 0 && this.negative === 0 ? (n.negative = 0, f = this.sub(n), n.negative ^= 1, f) : n.negative === 0 && this.negative !== 0 ? (this.negative = 0, f = n.sub(this), this.negative = 1, f) : this.length > n.length ? this.clone().iadd(n) : n.clone().iadd(this);
-    }, o.prototype.isub = function(n) {
-      if (n.negative !== 0) {
-        n.negative = 0;
-        var f = this.iadd(n);
-        return n.negative = 1, f._normSign();
-      } else if (this.negative !== 0)
-        return this.negative = 0, this.iadd(n), this.negative = 1, this._normSign();
-      var c = this.cmp(n);
-      if (c === 0)
-        return this.negative = 0, this.length = 1, this.words[0] = 0, this;
-      var g, d;
-      c > 0 ? (g = this, d = n) : (g = n, d = this);
-      for (var w = 0, x = 0; x < d.length; x++)
-        f = (g.words[x] | 0) - (d.words[x] | 0) + w, w = f >> 26, this.words[x] = f & 67108863;
-      for (; w !== 0 && x < g.length; x++)
-        f = (g.words[x] | 0) + w, w = f >> 26, this.words[x] = f & 67108863;
-      if (w === 0 && x < g.length && g !== this)
-        for (; x < g.length; x++)
-          this.words[x] = g.words[x];
-      return this.length = Math.max(this.length, x), g !== this && (this.negative = 1), this._strip();
-    }, o.prototype.sub = function(n) {
-      return this.clone().isub(n);
-    };
-    function V(y, n, f) {
-      f.negative = n.negative ^ y.negative;
-      var c = y.length + n.length | 0;
-      f.length = c, c = c - 1 | 0;
-      var g = y.words[0] | 0, d = n.words[0] | 0, w = g * d, x = w & 67108863, h = w / 67108864 | 0;
-      f.words[0] = x;
-      for (var s = 1; s < c; s++) {
-        for (var p = h >>> 26, k = h & 67108863, I = Math.min(s, n.length - 1), N = Math.max(0, s - y.length + 1); N <= I; N++) {
-          var P = s - N | 0;
-          g = y.words[P] | 0, d = n.words[N] | 0, w = g * d + k, p += w / 67108864 | 0, k = w & 67108863;
-        }
-        f.words[s] = k | 0, h = p | 0;
-      }
-      return h !== 0 ? f.words[s] = h | 0 : f.length--, f._strip();
-    }
-    var Q = function(n, f, c) {
-      var g = n.words, d = f.words, w = c.words, x = 0, h, s, p, k = g[0] | 0, I = k & 8191, N = k >>> 13, P = g[1] | 0, Z = P & 8191, z = P >>> 13, ft = g[2] | 0, W = ft & 8191, Y = ft >>> 13, Ht = g[3] | 0, K = Ht & 8191, J = Ht >>> 13, Yt = g[4] | 0, et = Yt & 8191, rt = Yt >>> 13, ze = g[5] | 0, nt = ze & 8191, it = ze >>> 13, Cn = g[6] | 0, at = Cn & 8191, ct = Cn >>> 13, Dn = g[7] | 0, ht = Dn & 8191, lt = Dn >>> 13, Pn = g[8] | 0, ut = Pn & 8191, dt = Pn >>> 13, Zn = g[9] | 0, wt = Zn & 8191, gt = Zn >>> 13, Vn = d[0] | 0, mt = Vn & 8191, pt = Vn >>> 13, zn = d[1] | 0, yt = zn & 8191, xt = zn >>> 13, Gn = d[2] | 0, vt = Gn & 8191, bt = Gn >>> 13, Yn = d[3] | 0, Et = Yn & 8191, _t = Yn >>> 13, Wn = d[4] | 0, Mt = Wn & 8191, At = Wn >>> 13, Xn = d[5] | 0, Bt = Xn & 8191, St = Xn >>> 13, Kn = d[6] | 0, It = Kn & 8191, Ut = Kn >>> 13, jn = d[7] | 0, kt = jn & 8191, Nt = jn >>> 13, Jn = d[8] | 0, Rt = Jn & 8191, Lt = Jn >>> 13, Fn = d[9] | 0, Ot = Fn & 8191, Tt = Fn >>> 13;
-      c.negative = n.negative ^ f.negative, c.length = 19, h = Math.imul(I, mt), s = Math.imul(I, pt), s = s + Math.imul(N, mt) | 0, p = Math.imul(N, pt);
-      var yr = (x + h | 0) + ((s & 8191) << 13) | 0;
-      x = (p + (s >>> 13) | 0) + (yr >>> 26) | 0, yr &= 67108863, h = Math.imul(Z, mt), s = Math.imul(Z, pt), s = s + Math.imul(z, mt) | 0, p = Math.imul(z, pt), h = h + Math.imul(I, yt) | 0, s = s + Math.imul(I, xt) | 0, s = s + Math.imul(N, yt) | 0, p = p + Math.imul(N, xt) | 0;
-      var xr = (x + h | 0) + ((s & 8191) << 13) | 0;
-      x = (p + (s >>> 13) | 0) + (xr >>> 26) | 0, xr &= 67108863, h = Math.imul(W, mt), s = Math.imul(W, pt), s = s + Math.imul(Y, mt) | 0, p = Math.imul(Y, pt), h = h + Math.imul(Z, yt) | 0, s = s + Math.imul(Z, xt) | 0, s = s + Math.imul(z, yt) | 0, p = p + Math.imul(z, xt) | 0, h = h + Math.imul(I, vt) | 0, s = s + Math.imul(I, bt) | 0, s = s + Math.imul(N, vt) | 0, p = p + Math.imul(N, bt) | 0;
-      var vr = (x + h | 0) + ((s & 8191) << 13) | 0;
-      x = (p + (s >>> 13) | 0) + (vr >>> 26) | 0, vr &= 67108863, h = Math.imul(K, mt), s = Math.imul(K, pt), s = s + Math.imul(J, mt) | 0, p = Math.imul(J, pt), h = h + Math.imul(W, yt) | 0, s = s + Math.imul(W, xt) | 0, s = s + Math.imul(Y, yt) | 0, p = p + Math.imul(Y, xt) | 0, h = h + Math.imul(Z, vt) | 0, s = s + Math.imul(Z, bt) | 0, s = s + Math.imul(z, vt) | 0, p = p + Math.imul(z, bt) | 0, h = h + Math.imul(I, Et) | 0, s = s + Math.imul(I, _t) | 0, s = s + Math.imul(N, Et) | 0, p = p + Math.imul(N, _t) | 0;
-      var br = (x + h | 0) + ((s & 8191) << 13) | 0;
-      x = (p + (s >>> 13) | 0) + (br >>> 26) | 0, br &= 67108863, h = Math.imul(et, mt), s = Math.imul(et, pt), s = s + Math.imul(rt, mt) | 0, p = Math.imul(rt, pt), h = h + Math.imul(K, yt) | 0, s = s + Math.imul(K, xt) | 0, s = s + Math.imul(J, yt) | 0, p = p + Math.imul(J, xt) | 0, h = h + Math.imul(W, vt) | 0, s = s + Math.imul(W, bt) | 0, s = s + Math.imul(Y, vt) | 0, p = p + Math.imul(Y, bt) | 0, h = h + Math.imul(Z, Et) | 0, s = s + Math.imul(Z, _t) | 0, s = s + Math.imul(z, Et) | 0, p = p + Math.imul(z, _t) | 0, h = h + Math.imul(I, Mt) | 0, s = s + Math.imul(I, At) | 0, s = s + Math.imul(N, Mt) | 0, p = p + Math.imul(N, At) | 0;
-      var Er = (x + h | 0) + ((s & 8191) << 13) | 0;
-      x = (p + (s >>> 13) | 0) + (Er >>> 26) | 0, Er &= 67108863, h = Math.imul(nt, mt), s = Math.imul(nt, pt), s = s + Math.imul(it, mt) | 0, p = Math.imul(it, pt), h = h + Math.imul(et, yt) | 0, s = s + Math.imul(et, xt) | 0, s = s + Math.imul(rt, yt) | 0, p = p + Math.imul(rt, xt) | 0, h = h + Math.imul(K, vt) | 0, s = s + Math.imul(K, bt) | 0, s = s + Math.imul(J, vt) | 0, p = p + Math.imul(J, bt) | 0, h = h + Math.imul(W, Et) | 0, s = s + Math.imul(W, _t) | 0, s = s + Math.imul(Y, Et) | 0, p = p + Math.imul(Y, _t) | 0, h = h + Math.imul(Z, Mt) | 0, s = s + Math.imul(Z, At) | 0, s = s + Math.imul(z, Mt) | 0, p = p + Math.imul(z, At) | 0, h = h + Math.imul(I, Bt) | 0, s = s + Math.imul(I, St) | 0, s = s + Math.imul(N, Bt) | 0, p = p + Math.imul(N, St) | 0;
-      var _r = (x + h | 0) + ((s & 8191) << 13) | 0;
-      x = (p + (s >>> 13) | 0) + (_r >>> 26) | 0, _r &= 67108863, h = Math.imul(at, mt), s = Math.imul(at, pt), s = s + Math.imul(ct, mt) | 0, p = Math.imul(ct, pt), h = h + Math.imul(nt, yt) | 0, s = s + Math.imul(nt, xt) | 0, s = s + Math.imul(it, yt) | 0, p = p + Math.imul(it, xt) | 0, h = h + Math.imul(et, vt) | 0, s = s + Math.imul(et, bt) | 0, s = s + Math.imul(rt, vt) | 0, p = p + Math.imul(rt, bt) | 0, h = h + Math.imul(K, Et) | 0, s = s + Math.imul(K, _t) | 0, s = s + Math.imul(J, Et) | 0, p = p + Math.imul(J, _t) | 0, h = h + Math.imul(W, Mt) | 0, s = s + Math.imul(W, At) | 0, s = s + Math.imul(Y, Mt) | 0, p = p + Math.imul(Y, At) | 0, h = h + Math.imul(Z, Bt) | 0, s = s + Math.imul(Z, St) | 0, s = s + Math.imul(z, Bt) | 0, p = p + Math.imul(z, St) | 0, h = h + Math.imul(I, It) | 0, s = s + Math.imul(I, Ut) | 0, s = s + Math.imul(N, It) | 0, p = p + Math.imul(N, Ut) | 0;
-      var Mr = (x + h | 0) + ((s & 8191) << 13) | 0;
-      x = (p + (s >>> 13) | 0) + (Mr >>> 26) | 0, Mr &= 67108863, h = Math.imul(ht, mt), s = Math.imul(ht, pt), s = s + Math.imul(lt, mt) | 0, p = Math.imul(lt, pt), h = h + Math.imul(at, yt) | 0, s = s + Math.imul(at, xt) | 0, s = s + Math.imul(ct, yt) | 0, p = p + Math.imul(ct, xt) | 0, h = h + Math.imul(nt, vt) | 0, s = s + Math.imul(nt, bt) | 0, s = s + Math.imul(it, vt) | 0, p = p + Math.imul(it, bt) | 0, h = h + Math.imul(et, Et) | 0, s = s + Math.imul(et, _t) | 0, s = s + Math.imul(rt, Et) | 0, p = p + Math.imul(rt, _t) | 0, h = h + Math.imul(K, Mt) | 0, s = s + Math.imul(K, At) | 0, s = s + Math.imul(J, Mt) | 0, p = p + Math.imul(J, At) | 0, h = h + Math.imul(W, Bt) | 0, s = s + Math.imul(W, St) | 0, s = s + Math.imul(Y, Bt) | 0, p = p + Math.imul(Y, St) | 0, h = h + Math.imul(Z, It) | 0, s = s + Math.imul(Z, Ut) | 0, s = s + Math.imul(z, It) | 0, p = p + Math.imul(z, Ut) | 0, h = h + Math.imul(I, kt) | 0, s = s + Math.imul(I, Nt) | 0, s = s + Math.imul(N, kt) | 0, p = p + Math.imul(N, Nt) | 0;
-      var Ar = (x + h | 0) + ((s & 8191) << 13) | 0;
-      x = (p + (s >>> 13) | 0) + (Ar >>> 26) | 0, Ar &= 67108863, h = Math.imul(ut, mt), s = Math.imul(ut, pt), s = s + Math.imul(dt, mt) | 0, p = Math.imul(dt, pt), h = h + Math.imul(ht, yt) | 0, s = s + Math.imul(ht, xt) | 0, s = s + Math.imul(lt, yt) | 0, p = p + Math.imul(lt, xt) | 0, h = h + Math.imul(at, vt) | 0, s = s + Math.imul(at, bt) | 0, s = s + Math.imul(ct, vt) | 0, p = p + Math.imul(ct, bt) | 0, h = h + Math.imul(nt, Et) | 0, s = s + Math.imul(nt, _t) | 0, s = s + Math.imul(it, Et) | 0, p = p + Math.imul(it, _t) | 0, h = h + Math.imul(et, Mt) | 0, s = s + Math.imul(et, At) | 0, s = s + Math.imul(rt, Mt) | 0, p = p + Math.imul(rt, At) | 0, h = h + Math.imul(K, Bt) | 0, s = s + Math.imul(K, St) | 0, s = s + Math.imul(J, Bt) | 0, p = p + Math.imul(J, St) | 0, h = h + Math.imul(W, It) | 0, s = s + Math.imul(W, Ut) | 0, s = s + Math.imul(Y, It) | 0, p = p + Math.imul(Y, Ut) | 0, h = h + Math.imul(Z, kt) | 0, s = s + Math.imul(Z, Nt) | 0, s = s + Math.imul(z, kt) | 0, p = p + Math.imul(z, Nt) | 0, h = h + Math.imul(I, Rt) | 0, s = s + Math.imul(I, Lt) | 0, s = s + Math.imul(N, Rt) | 0, p = p + Math.imul(N, Lt) | 0;
-      var Br = (x + h | 0) + ((s & 8191) << 13) | 0;
-      x = (p + (s >>> 13) | 0) + (Br >>> 26) | 0, Br &= 67108863, h = Math.imul(wt, mt), s = Math.imul(wt, pt), s = s + Math.imul(gt, mt) | 0, p = Math.imul(gt, pt), h = h + Math.imul(ut, yt) | 0, s = s + Math.imul(ut, xt) | 0, s = s + Math.imul(dt, yt) | 0, p = p + Math.imul(dt, xt) | 0, h = h + Math.imul(ht, vt) | 0, s = s + Math.imul(ht, bt) | 0, s = s + Math.imul(lt, vt) | 0, p = p + Math.imul(lt, bt) | 0, h = h + Math.imul(at, Et) | 0, s = s + Math.imul(at, _t) | 0, s = s + Math.imul(ct, Et) | 0, p = p + Math.imul(ct, _t) | 0, h = h + Math.imul(nt, Mt) | 0, s = s + Math.imul(nt, At) | 0, s = s + Math.imul(it, Mt) | 0, p = p + Math.imul(it, At) | 0, h = h + Math.imul(et, Bt) | 0, s = s + Math.imul(et, St) | 0, s = s + Math.imul(rt, Bt) | 0, p = p + Math.imul(rt, St) | 0, h = h + Math.imul(K, It) | 0, s = s + Math.imul(K, Ut) | 0, s = s + Math.imul(J, It) | 0, p = p + Math.imul(J, Ut) | 0, h = h + Math.imul(W, kt) | 0, s = s + Math.imul(W, Nt) | 0, s = s + Math.imul(Y, kt) | 0, p = p + Math.imul(Y, Nt) | 0, h = h + Math.imul(Z, Rt) | 0, s = s + Math.imul(Z, Lt) | 0, s = s + Math.imul(z, Rt) | 0, p = p + Math.imul(z, Lt) | 0, h = h + Math.imul(I, Ot) | 0, s = s + Math.imul(I, Tt) | 0, s = s + Math.imul(N, Ot) | 0, p = p + Math.imul(N, Tt) | 0;
-      var Sr = (x + h | 0) + ((s & 8191) << 13) | 0;
-      x = (p + (s >>> 13) | 0) + (Sr >>> 26) | 0, Sr &= 67108863, h = Math.imul(wt, yt), s = Math.imul(wt, xt), s = s + Math.imul(gt, yt) | 0, p = Math.imul(gt, xt), h = h + Math.imul(ut, vt) | 0, s = s + Math.imul(ut, bt) | 0, s = s + Math.imul(dt, vt) | 0, p = p + Math.imul(dt, bt) | 0, h = h + Math.imul(ht, Et) | 0, s = s + Math.imul(ht, _t) | 0, s = s + Math.imul(lt, Et) | 0, p = p + Math.imul(lt, _t) | 0, h = h + Math.imul(at, Mt) | 0, s = s + Math.imul(at, At) | 0, s = s + Math.imul(ct, Mt) | 0, p = p + Math.imul(ct, At) | 0, h = h + Math.imul(nt, Bt) | 0, s = s + Math.imul(nt, St) | 0, s = s + Math.imul(it, Bt) | 0, p = p + Math.imul(it, St) | 0, h = h + Math.imul(et, It) | 0, s = s + Math.imul(et, Ut) | 0, s = s + Math.imul(rt, It) | 0, p = p + Math.imul(rt, Ut) | 0, h = h + Math.imul(K, kt) | 0, s = s + Math.imul(K, Nt) | 0, s = s + Math.imul(J, kt) | 0, p = p + Math.imul(J, Nt) | 0, h = h + Math.imul(W, Rt) | 0, s = s + Math.imul(W, Lt) | 0, s = s + Math.imul(Y, Rt) | 0, p = p + Math.imul(Y, Lt) | 0, h = h + Math.imul(Z, Ot) | 0, s = s + Math.imul(Z, Tt) | 0, s = s + Math.imul(z, Ot) | 0, p = p + Math.imul(z, Tt) | 0;
-      var Ir = (x + h | 0) + ((s & 8191) << 13) | 0;
-      x = (p + (s >>> 13) | 0) + (Ir >>> 26) | 0, Ir &= 67108863, h = Math.imul(wt, vt), s = Math.imul(wt, bt), s = s + Math.imul(gt, vt) | 0, p = Math.imul(gt, bt), h = h + Math.imul(ut, Et) | 0, s = s + Math.imul(ut, _t) | 0, s = s + Math.imul(dt, Et) | 0, p = p + Math.imul(dt, _t) | 0, h = h + Math.imul(ht, Mt) | 0, s = s + Math.imul(ht, At) | 0, s = s + Math.imul(lt, Mt) | 0, p = p + Math.imul(lt, At) | 0, h = h + Math.imul(at, Bt) | 0, s = s + Math.imul(at, St) | 0, s = s + Math.imul(ct, Bt) | 0, p = p + Math.imul(ct, St) | 0, h = h + Math.imul(nt, It) | 0, s = s + Math.imul(nt, Ut) | 0, s = s + Math.imul(it, It) | 0, p = p + Math.imul(it, Ut) | 0, h = h + Math.imul(et, kt) | 0, s = s + Math.imul(et, Nt) | 0, s = s + Math.imul(rt, kt) | 0, p = p + Math.imul(rt, Nt) | 0, h = h + Math.imul(K, Rt) | 0, s = s + Math.imul(K, Lt) | 0, s = s + Math.imul(J, Rt) | 0, p = p + Math.imul(J, Lt) | 0, h = h + Math.imul(W, Ot) | 0, s = s + Math.imul(W, Tt) | 0, s = s + Math.imul(Y, Ot) | 0, p = p + Math.imul(Y, Tt) | 0;
-      var Ur = (x + h | 0) + ((s & 8191) << 13) | 0;
-      x = (p + (s >>> 13) | 0) + (Ur >>> 26) | 0, Ur &= 67108863, h = Math.imul(wt, Et), s = Math.imul(wt, _t), s = s + Math.imul(gt, Et) | 0, p = Math.imul(gt, _t), h = h + Math.imul(ut, Mt) | 0, s = s + Math.imul(ut, At) | 0, s = s + Math.imul(dt, Mt) | 0, p = p + Math.imul(dt, At) | 0, h = h + Math.imul(ht, Bt) | 0, s = s + Math.imul(ht, St) | 0, s = s + Math.imul(lt, Bt) | 0, p = p + Math.imul(lt, St) | 0, h = h + Math.imul(at, It) | 0, s = s + Math.imul(at, Ut) | 0, s = s + Math.imul(ct, It) | 0, p = p + Math.imul(ct, Ut) | 0, h = h + Math.imul(nt, kt) | 0, s = s + Math.imul(nt, Nt) | 0, s = s + Math.imul(it, kt) | 0, p = p + Math.imul(it, Nt) | 0, h = h + Math.imul(et, Rt) | 0, s = s + Math.imul(et, Lt) | 0, s = s + Math.imul(rt, Rt) | 0, p = p + Math.imul(rt, Lt) | 0, h = h + Math.imul(K, Ot) | 0, s = s + Math.imul(K, Tt) | 0, s = s + Math.imul(J, Ot) | 0, p = p + Math.imul(J, Tt) | 0;
-      var kr = (x + h | 0) + ((s & 8191) << 13) | 0;
-      x = (p + (s >>> 13) | 0) + (kr >>> 26) | 0, kr &= 67108863, h = Math.imul(wt, Mt), s = Math.imul(wt, At), s = s + Math.imul(gt, Mt) | 0, p = Math.imul(gt, At), h = h + Math.imul(ut, Bt) | 0, s = s + Math.imul(ut, St) | 0, s = s + Math.imul(dt, Bt) | 0, p = p + Math.imul(dt, St) | 0, h = h + Math.imul(ht, It) | 0, s = s + Math.imul(ht, Ut) | 0, s = s + Math.imul(lt, It) | 0, p = p + Math.imul(lt, Ut) | 0, h = h + Math.imul(at, kt) | 0, s = s + Math.imul(at, Nt) | 0, s = s + Math.imul(ct, kt) | 0, p = p + Math.imul(ct, Nt) | 0, h = h + Math.imul(nt, Rt) | 0, s = s + Math.imul(nt, Lt) | 0, s = s + Math.imul(it, Rt) | 0, p = p + Math.imul(it, Lt) | 0, h = h + Math.imul(et, Ot) | 0, s = s + Math.imul(et, Tt) | 0, s = s + Math.imul(rt, Ot) | 0, p = p + Math.imul(rt, Tt) | 0;
-      var Nr = (x + h | 0) + ((s & 8191) << 13) | 0;
-      x = (p + (s >>> 13) | 0) + (Nr >>> 26) | 0, Nr &= 67108863, h = Math.imul(wt, Bt), s = Math.imul(wt, St), s = s + Math.imul(gt, Bt) | 0, p = Math.imul(gt, St), h = h + Math.imul(ut, It) | 0, s = s + Math.imul(ut, Ut) | 0, s = s + Math.imul(dt, It) | 0, p = p + Math.imul(dt, Ut) | 0, h = h + Math.imul(ht, kt) | 0, s = s + Math.imul(ht, Nt) | 0, s = s + Math.imul(lt, kt) | 0, p = p + Math.imul(lt, Nt) | 0, h = h + Math.imul(at, Rt) | 0, s = s + Math.imul(at, Lt) | 0, s = s + Math.imul(ct, Rt) | 0, p = p + Math.imul(ct, Lt) | 0, h = h + Math.imul(nt, Ot) | 0, s = s + Math.imul(nt, Tt) | 0, s = s + Math.imul(it, Ot) | 0, p = p + Math.imul(it, Tt) | 0;
-      var Rr = (x + h | 0) + ((s & 8191) << 13) | 0;
-      x = (p + (s >>> 13) | 0) + (Rr >>> 26) | 0, Rr &= 67108863, h = Math.imul(wt, It), s = Math.imul(wt, Ut), s = s + Math.imul(gt, It) | 0, p = Math.imul(gt, Ut), h = h + Math.imul(ut, kt) | 0, s = s + Math.imul(ut, Nt) | 0, s = s + Math.imul(dt, kt) | 0, p = p + Math.imul(dt, Nt) | 0, h = h + Math.imul(ht, Rt) | 0, s = s + Math.imul(ht, Lt) | 0, s = s + Math.imul(lt, Rt) | 0, p = p + Math.imul(lt, Lt) | 0, h = h + Math.imul(at, Ot) | 0, s = s + Math.imul(at, Tt) | 0, s = s + Math.imul(ct, Ot) | 0, p = p + Math.imul(ct, Tt) | 0;
-      var Lr = (x + h | 0) + ((s & 8191) << 13) | 0;
-      x = (p + (s >>> 13) | 0) + (Lr >>> 26) | 0, Lr &= 67108863, h = Math.imul(wt, kt), s = Math.imul(wt, Nt), s = s + Math.imul(gt, kt) | 0, p = Math.imul(gt, Nt), h = h + Math.imul(ut, Rt) | 0, s = s + Math.imul(ut, Lt) | 0, s = s + Math.imul(dt, Rt) | 0, p = p + Math.imul(dt, Lt) | 0, h = h + Math.imul(ht, Ot) | 0, s = s + Math.imul(ht, Tt) | 0, s = s + Math.imul(lt, Ot) | 0, p = p + Math.imul(lt, Tt) | 0;
-      var Or = (x + h | 0) + ((s & 8191) << 13) | 0;
-      x = (p + (s >>> 13) | 0) + (Or >>> 26) | 0, Or &= 67108863, h = Math.imul(wt, Rt), s = Math.imul(wt, Lt), s = s + Math.imul(gt, Rt) | 0, p = Math.imul(gt, Lt), h = h + Math.imul(ut, Ot) | 0, s = s + Math.imul(ut, Tt) | 0, s = s + Math.imul(dt, Ot) | 0, p = p + Math.imul(dt, Tt) | 0;
-      var Tr = (x + h | 0) + ((s & 8191) << 13) | 0;
-      x = (p + (s >>> 13) | 0) + (Tr >>> 26) | 0, Tr &= 67108863, h = Math.imul(wt, Ot), s = Math.imul(wt, Tt), s = s + Math.imul(gt, Ot) | 0, p = Math.imul(gt, Tt);
-      var Hr = (x + h | 0) + ((s & 8191) << 13) | 0;
-      return x = (p + (s >>> 13) | 0) + (Hr >>> 26) | 0, Hr &= 67108863, w[0] = yr, w[1] = xr, w[2] = vr, w[3] = br, w[4] = Er, w[5] = _r, w[6] = Mr, w[7] = Ar, w[8] = Br, w[9] = Sr, w[10] = Ir, w[11] = Ur, w[12] = kr, w[13] = Nr, w[14] = Rr, w[15] = Lr, w[16] = Or, w[17] = Tr, w[18] = Hr, x !== 0 && (w[19] = x, c.length++), c;
-    };
-    Math.imul || (Q = V);
-    function R(y, n, f) {
-      f.negative = n.negative ^ y.negative, f.length = y.length + n.length;
-      for (var c = 0, g = 0, d = 0; d < f.length - 1; d++) {
-        var w = g;
-        g = 0;
-        for (var x = c & 67108863, h = Math.min(d, n.length - 1), s = Math.max(0, d - y.length + 1); s <= h; s++) {
-          var p = d - s, k = y.words[p] | 0, I = n.words[s] | 0, N = k * I, P = N & 67108863;
-          w = w + (N / 67108864 | 0) | 0, P = P + x | 0, x = P & 67108863, w = w + (P >>> 26) | 0, g += w >>> 26, w &= 67108863;
-        }
-        f.words[d] = x, c = w, w = g;
-      }
-      return c !== 0 ? f.words[d] = c : f.length--, f._strip();
-    }
-    function _(y, n, f) {
-      return R(y, n, f);
-    }
-    o.prototype.mulTo = function(n, f) {
-      var c, g = this.length + n.length;
-      return this.length === 10 && n.length === 10 ? c = Q(this, n, f) : g < 63 ? c = V(this, n, f) : g < 1024 ? c = R(this, n, f) : c = _(this, n, f), c;
-    }, o.prototype.mul = function(n) {
-      var f = new o(null);
-      return f.words = new Array(this.length + n.length), this.mulTo(n, f);
-    }, o.prototype.mulf = function(n) {
-      var f = new o(null);
-      return f.words = new Array(this.length + n.length), _(this, n, f);
-    }, o.prototype.imul = function(n) {
-      return this.clone().mulTo(n, this);
-    }, o.prototype.imuln = function(n) {
-      var f = n < 0;
-      f && (n = -n), i(typeof n == "number"), i(n < 67108864);
-      for (var c = 0, g = 0; g < this.length; g++) {
-        var d = (this.words[g] | 0) * n, w = (d & 67108863) + (c & 67108863);
-        c >>= 26, c += d / 67108864 | 0, c += w >>> 26, this.words[g] = w & 67108863;
-      }
-      return c !== 0 && (this.words[g] = c, this.length++), this.length = n === 0 ? 1 : this.length, f ? this.ineg() : this;
-    }, o.prototype.muln = function(n) {
-      return this.clone().imuln(n);
-    }, o.prototype.sqr = function() {
-      return this.mul(this);
-    }, o.prototype.isqr = function() {
-      return this.imul(this.clone());
-    }, o.prototype.pow = function(n) {
-      var f = D(n);
-      if (f.length === 0) return new o(1);
-      for (var c = this, g = 0; g < f.length && f[g] === 0; g++, c = c.sqr())
-        ;
-      if (++g < f.length)
-        for (var d = c.sqr(); g < f.length; g++, d = d.sqr())
-          f[g] !== 0 && (c = c.mul(d));
-      return c;
-    }, o.prototype.iushln = function(n) {
-      i(typeof n == "number" && n >= 0);
-      var f = n % 26, c = (n - f) / 26, g = 67108863 >>> 26 - f << 26 - f, d;
-      if (f !== 0) {
-        var w = 0;
-        for (d = 0; d < this.length; d++) {
-          var x = this.words[d] & g, h = (this.words[d] | 0) - x << f;
-          this.words[d] = h | w, w = x >>> 26 - f;
-        }
-        w && (this.words[d] = w, this.length++);
-      }
-      if (c !== 0) {
-        for (d = this.length - 1; d >= 0; d--)
-          this.words[d + c] = this.words[d];
-        for (d = 0; d < c; d++)
-          this.words[d] = 0;
-        this.length += c;
-      }
-      return this._strip();
-    }, o.prototype.ishln = function(n) {
-      return i(this.negative === 0), this.iushln(n);
-    }, o.prototype.iushrn = function(n, f, c) {
-      i(typeof n == "number" && n >= 0);
-      var g;
-      f ? g = (f - f % 26) / 26 : g = 0;
-      var d = n % 26, w = Math.min((n - d) / 26, this.length), x = 67108863 ^ 67108863 >>> d << d, h = c;
-      if (g -= w, g = Math.max(0, g), h) {
-        for (var s = 0; s < w; s++)
-          h.words[s] = this.words[s];
-        h.length = w;
-      }
-      if (w !== 0) if (this.length > w)
-        for (this.length -= w, s = 0; s < this.length; s++)
-          this.words[s] = this.words[s + w];
-      else
-        this.words[0] = 0, this.length = 1;
-      var p = 0;
-      for (s = this.length - 1; s >= 0 && (p !== 0 || s >= g); s--) {
-        var k = this.words[s] | 0;
-        this.words[s] = p << 26 - d | k >>> d, p = k & x;
-      }
-      return h && p !== 0 && (h.words[h.length++] = p), this.length === 0 && (this.words[0] = 0, this.length = 1), this._strip();
-    }, o.prototype.ishrn = function(n, f, c) {
-      return i(this.negative === 0), this.iushrn(n, f, c);
-    }, o.prototype.shln = function(n) {
-      return this.clone().ishln(n);
-    }, o.prototype.ushln = function(n) {
-      return this.clone().iushln(n);
-    }, o.prototype.shrn = function(n) {
-      return this.clone().ishrn(n);
-    }, o.prototype.ushrn = function(n) {
-      return this.clone().iushrn(n);
-    }, o.prototype.testn = function(n) {
-      i(typeof n == "number" && n >= 0);
-      var f = n % 26, c = (n - f) / 26, g = 1 << f;
-      if (this.length <= c) return !1;
-      var d = this.words[c];
-      return !!(d & g);
-    }, o.prototype.imaskn = function(n) {
-      i(typeof n == "number" && n >= 0);
-      var f = n % 26, c = (n - f) / 26;
-      if (i(this.negative === 0, "imaskn works only with positive numbers"), this.length <= c)
-        return this;
-      if (f !== 0 && c++, this.length = Math.min(c, this.length), f !== 0) {
-        var g = 67108863 ^ 67108863 >>> f << f;
-        this.words[this.length - 1] &= g;
-      }
-      return this._strip();
-    }, o.prototype.maskn = function(n) {
-      return this.clone().imaskn(n);
-    }, o.prototype.iaddn = function(n) {
-      return i(typeof n == "number"), i(n < 67108864), n < 0 ? this.isubn(-n) : this.negative !== 0 ? this.length === 1 && (this.words[0] | 0) <= n ? (this.words[0] = n - (this.words[0] | 0), this.negative = 0, this) : (this.negative = 0, this.isubn(n), this.negative = 1, this) : this._iaddn(n);
-    }, o.prototype._iaddn = function(n) {
-      this.words[0] += n;
-      for (var f = 0; f < this.length && this.words[f] >= 67108864; f++)
-        this.words[f] -= 67108864, f === this.length - 1 ? this.words[f + 1] = 1 : this.words[f + 1]++;
-      return this.length = Math.max(this.length, f + 1), this;
-    }, o.prototype.isubn = function(n) {
-      if (i(typeof n == "number"), i(n < 67108864), n < 0) return this.iaddn(-n);
-      if (this.negative !== 0)
-        return this.negative = 0, this.iaddn(n), this.negative = 1, this;
-      if (this.words[0] -= n, this.length === 1 && this.words[0] < 0)
-        this.words[0] = -this.words[0], this.negative = 1;
-      else
-        for (var f = 0; f < this.length && this.words[f] < 0; f++)
-          this.words[f] += 67108864, this.words[f + 1] -= 1;
-      return this._strip();
-    }, o.prototype.addn = function(n) {
-      return this.clone().iaddn(n);
-    }, o.prototype.subn = function(n) {
-      return this.clone().isubn(n);
-    }, o.prototype.iabs = function() {
-      return this.negative = 0, this;
-    }, o.prototype.abs = function() {
-      return this.clone().iabs();
-    }, o.prototype._ishlnsubmul = function(n, f, c) {
-      var g = n.length + c, d;
-      this._expand(g);
-      var w, x = 0;
-      for (d = 0; d < n.length; d++) {
-        w = (this.words[d + c] | 0) + x;
-        var h = (n.words[d] | 0) * f;
-        w -= h & 67108863, x = (w >> 26) - (h / 67108864 | 0), this.words[d + c] = w & 67108863;
-      }
-      for (; d < this.length - c; d++)
-        w = (this.words[d + c] | 0) + x, x = w >> 26, this.words[d + c] = w & 67108863;
-      if (x === 0) return this._strip();
-      for (i(x === -1), x = 0, d = 0; d < this.length; d++)
-        w = -(this.words[d] | 0) + x, x = w >> 26, this.words[d] = w & 67108863;
-      return this.negative = 1, this._strip();
-    }, o.prototype._wordDiv = function(n, f) {
-      var c = this.length - n.length, g = this.clone(), d = n, w = d.words[d.length - 1] | 0, x = this._countBits(w);
-      c = 26 - x, c !== 0 && (d = d.ushln(c), g.iushln(c), w = d.words[d.length - 1] | 0);
-      var h = g.length - d.length, s;
-      if (f !== "mod") {
-        s = new o(null), s.length = h + 1, s.words = new Array(s.length);
-        for (var p = 0; p < s.length; p++)
-          s.words[p] = 0;
-      }
-      var k = g.clone()._ishlnsubmul(d, 1, h);
-      k.negative === 0 && (g = k, s && (s.words[h] = 1));
-      for (var I = h - 1; I >= 0; I--) {
-        var N = (g.words[d.length + I] | 0) * 67108864 + (g.words[d.length + I - 1] | 0);
-        for (N = Math.min(N / w | 0, 67108863), g._ishlnsubmul(d, N, I); g.negative !== 0; )
-          N--, g.negative = 0, g._ishlnsubmul(d, 1, I), g.isZero() || (g.negative ^= 1);
-        s && (s.words[I] = N);
-      }
-      return s && s._strip(), g._strip(), f !== "div" && c !== 0 && g.iushrn(c), {
-        div: s || null,
-        mod: g
-      };
-    }, o.prototype.divmod = function(n, f, c) {
-      if (i(!n.isZero()), this.isZero())
-        return {
-          div: new o(0),
-          mod: new o(0)
-        };
-      var g, d, w;
-      return this.negative !== 0 && n.negative === 0 ? (w = this.neg().divmod(n, f), f !== "mod" && (g = w.div.neg()), f !== "div" && (d = w.mod.neg(), c && d.negative !== 0 && d.iadd(n)), {
-        div: g,
-        mod: d
-      }) : this.negative === 0 && n.negative !== 0 ? (w = this.divmod(n.neg(), f), f !== "mod" && (g = w.div.neg()), {
-        div: g,
-        mod: w.mod
-      }) : (this.negative & n.negative) !== 0 ? (w = this.neg().divmod(n.neg(), f), f !== "div" && (d = w.mod.neg(), c && d.negative !== 0 && d.isub(n)), {
-        div: w.div,
-        mod: d
-      }) : n.length > this.length || this.cmp(n) < 0 ? {
-        div: new o(0),
-        mod: this
-      } : n.length === 1 ? f === "div" ? {
-        div: this.divn(n.words[0]),
-        mod: null
-      } : f === "mod" ? {
-        div: null,
-        mod: new o(this.modrn(n.words[0]))
-      } : {
-        div: this.divn(n.words[0]),
-        mod: new o(this.modrn(n.words[0]))
-      } : this._wordDiv(n, f);
-    }, o.prototype.div = function(n) {
-      return this.divmod(n, "div", !1).div;
-    }, o.prototype.mod = function(n) {
-      return this.divmod(n, "mod", !1).mod;
-    }, o.prototype.umod = function(n) {
-      return this.divmod(n, "mod", !0).mod;
-    }, o.prototype.divRound = function(n) {
-      var f = this.divmod(n);
-      if (f.mod.isZero()) return f.div;
-      var c = f.div.negative !== 0 ? f.mod.isub(n) : f.mod, g = n.ushrn(1), d = n.andln(1), w = c.cmp(g);
-      return w < 0 || d === 1 && w === 0 ? f.div : f.div.negative !== 0 ? f.div.isubn(1) : f.div.iaddn(1);
-    }, o.prototype.modrn = function(n) {
-      var f = n < 0;
-      f && (n = -n), i(n <= 67108863);
-      for (var c = (1 << 26) % n, g = 0, d = this.length - 1; d >= 0; d--)
-        g = (c * g + (this.words[d] | 0)) % n;
-      return f ? -g : g;
-    }, o.prototype.modn = function(n) {
-      return this.modrn(n);
-    }, o.prototype.idivn = function(n) {
-      var f = n < 0;
-      f && (n = -n), i(n <= 67108863);
-      for (var c = 0, g = this.length - 1; g >= 0; g--) {
-        var d = (this.words[g] | 0) + c * 67108864;
-        this.words[g] = d / n | 0, c = d % n;
-      }
-      return this._strip(), f ? this.ineg() : this;
-    }, o.prototype.divn = function(n) {
-      return this.clone().idivn(n);
-    }, o.prototype.egcd = function(n) {
-      i(n.negative === 0), i(!n.isZero());
-      var f = this, c = n.clone();
-      f.negative !== 0 ? f = f.umod(n) : f = f.clone();
-      for (var g = new o(1), d = new o(0), w = new o(0), x = new o(1), h = 0; f.isEven() && c.isEven(); )
-        f.iushrn(1), c.iushrn(1), ++h;
-      for (var s = c.clone(), p = f.clone(); !f.isZero(); ) {
-        for (var k = 0, I = 1; (f.words[0] & I) === 0 && k < 26; ++k, I <<= 1) ;
-        if (k > 0)
-          for (f.iushrn(k); k-- > 0; )
-            (g.isOdd() || d.isOdd()) && (g.iadd(s), d.isub(p)), g.iushrn(1), d.iushrn(1);
-        for (var N = 0, P = 1; (c.words[0] & P) === 0 && N < 26; ++N, P <<= 1) ;
-        if (N > 0)
-          for (c.iushrn(N); N-- > 0; )
-            (w.isOdd() || x.isOdd()) && (w.iadd(s), x.isub(p)), w.iushrn(1), x.iushrn(1);
-        f.cmp(c) >= 0 ? (f.isub(c), g.isub(w), d.isub(x)) : (c.isub(f), w.isub(g), x.isub(d));
-      }
-      return {
-        a: w,
-        b: x,
-        gcd: c.iushln(h)
-      };
-    }, o.prototype._invmp = function(n) {
-      i(n.negative === 0), i(!n.isZero());
-      var f = this, c = n.clone();
-      f.negative !== 0 ? f = f.umod(n) : f = f.clone();
-      for (var g = new o(1), d = new o(0), w = c.clone(); f.cmpn(1) > 0 && c.cmpn(1) > 0; ) {
-        for (var x = 0, h = 1; (f.words[0] & h) === 0 && x < 26; ++x, h <<= 1) ;
-        if (x > 0)
-          for (f.iushrn(x); x-- > 0; )
-            g.isOdd() && g.iadd(w), g.iushrn(1);
-        for (var s = 0, p = 1; (c.words[0] & p) === 0 && s < 26; ++s, p <<= 1) ;
-        if (s > 0)
-          for (c.iushrn(s); s-- > 0; )
-            d.isOdd() && d.iadd(w), d.iushrn(1);
-        f.cmp(c) >= 0 ? (f.isub(c), g.isub(d)) : (c.isub(f), d.isub(g));
-      }
-      var k;
-      return f.cmpn(1) === 0 ? k = g : k = d, k.cmpn(0) < 0 && k.iadd(n), k;
-    }, o.prototype.gcd = function(n) {
-      if (this.isZero()) return n.abs();
-      if (n.isZero()) return this.abs();
-      var f = this.clone(), c = n.clone();
-      f.negative = 0, c.negative = 0;
-      for (var g = 0; f.isEven() && c.isEven(); g++)
-        f.iushrn(1), c.iushrn(1);
-      do {
-        for (; f.isEven(); )
-          f.iushrn(1);
-        for (; c.isEven(); )
-          c.iushrn(1);
-        var d = f.cmp(c);
-        if (d < 0) {
-          var w = f;
-          f = c, c = w;
-        } else if (d === 0 || c.cmpn(1) === 0)
-          break;
-        f.isub(c);
-      } while (!0);
-      return c.iushln(g);
-    }, o.prototype.invm = function(n) {
-      return this.egcd(n).a.umod(n);
-    }, o.prototype.isEven = function() {
-      return (this.words[0] & 1) === 0;
-    }, o.prototype.isOdd = function() {
-      return (this.words[0] & 1) === 1;
-    }, o.prototype.andln = function(n) {
-      return this.words[0] & n;
-    }, o.prototype.bincn = function(n) {
-      i(typeof n == "number");
-      var f = n % 26, c = (n - f) / 26, g = 1 << f;
-      if (this.length <= c)
-        return this._expand(c + 1), this.words[c] |= g, this;
-      for (var d = g, w = c; d !== 0 && w < this.length; w++) {
-        var x = this.words[w] | 0;
-        x += d, d = x >>> 26, x &= 67108863, this.words[w] = x;
-      }
-      return d !== 0 && (this.words[w] = d, this.length++), this;
-    }, o.prototype.isZero = function() {
-      return this.length === 1 && this.words[0] === 0;
-    }, o.prototype.cmpn = function(n) {
-      var f = n < 0;
-      if (this.negative !== 0 && !f) return -1;
-      if (this.negative === 0 && f) return 1;
-      this._strip();
-      var c;
-      if (this.length > 1)
-        c = 1;
-      else {
-        f && (n = -n), i(n <= 67108863, "Number is too big");
-        var g = this.words[0] | 0;
-        c = g === n ? 0 : g < n ? -1 : 1;
-      }
-      return this.negative !== 0 ? -c | 0 : c;
-    }, o.prototype.cmp = function(n) {
-      if (this.negative !== 0 && n.negative === 0) return -1;
-      if (this.negative === 0 && n.negative !== 0) return 1;
-      var f = this.ucmp(n);
-      return this.negative !== 0 ? -f | 0 : f;
-    }, o.prototype.ucmp = function(n) {
-      if (this.length > n.length) return 1;
-      if (this.length < n.length) return -1;
-      for (var f = 0, c = this.length - 1; c >= 0; c--) {
-        var g = this.words[c] | 0, d = n.words[c] | 0;
-        if (g !== d) {
-          g < d ? f = -1 : g > d && (f = 1);
-          break;
-        }
-      }
-      return f;
-    }, o.prototype.gtn = function(n) {
-      return this.cmpn(n) === 1;
-    }, o.prototype.gt = function(n) {
-      return this.cmp(n) === 1;
-    }, o.prototype.gten = function(n) {
-      return this.cmpn(n) >= 0;
-    }, o.prototype.gte = function(n) {
-      return this.cmp(n) >= 0;
-    }, o.prototype.ltn = function(n) {
-      return this.cmpn(n) === -1;
-    }, o.prototype.lt = function(n) {
-      return this.cmp(n) === -1;
-    }, o.prototype.lten = function(n) {
-      return this.cmpn(n) <= 0;
-    }, o.prototype.lte = function(n) {
-      return this.cmp(n) <= 0;
-    }, o.prototype.eqn = function(n) {
-      return this.cmpn(n) === 0;
-    }, o.prototype.eq = function(n) {
-      return this.cmp(n) === 0;
-    }, o.red = function(n) {
-      return new U(n);
-    }, o.prototype.toRed = function(n) {
-      return i(!this.red, "Already a number in reduction context"), i(this.negative === 0, "red works only with positives"), n.convertTo(this)._forceRed(n);
-    }, o.prototype.fromRed = function() {
-      return i(this.red, "fromRed works only with numbers in reduction context"), this.red.convertFrom(this);
-    }, o.prototype._forceRed = function(n) {
-      return this.red = n, this;
-    }, o.prototype.forceRed = function(n) {
-      return i(!this.red, "Already a number in reduction context"), this._forceRed(n);
-    }, o.prototype.redAdd = function(n) {
-      return i(this.red, "redAdd works only with red numbers"), this.red.add(this, n);
-    }, o.prototype.redIAdd = function(n) {
-      return i(this.red, "redIAdd works only with red numbers"), this.red.iadd(this, n);
-    }, o.prototype.redSub = function(n) {
-      return i(this.red, "redSub works only with red numbers"), this.red.sub(this, n);
-    }, o.prototype.redISub = function(n) {
-      return i(this.red, "redISub works only with red numbers"), this.red.isub(this, n);
-    }, o.prototype.redShl = function(n) {
-      return i(this.red, "redShl works only with red numbers"), this.red.shl(this, n);
-    }, o.prototype.redMul = function(n) {
-      return i(this.red, "redMul works only with red numbers"), this.red._verify2(this, n), this.red.mul(this, n);
-    }, o.prototype.redIMul = function(n) {
-      return i(this.red, "redMul works only with red numbers"), this.red._verify2(this, n), this.red.imul(this, n);
-    }, o.prototype.redSqr = function() {
-      return i(this.red, "redSqr works only with red numbers"), this.red._verify1(this), this.red.sqr(this);
-    }, o.prototype.redISqr = function() {
-      return i(this.red, "redISqr works only with red numbers"), this.red._verify1(this), this.red.isqr(this);
-    }, o.prototype.redSqrt = function() {
-      return i(this.red, "redSqrt works only with red numbers"), this.red._verify1(this), this.red.sqrt(this);
-    }, o.prototype.redInvm = function() {
-      return i(this.red, "redInvm works only with red numbers"), this.red._verify1(this), this.red.invm(this);
-    }, o.prototype.redNeg = function() {
-      return i(this.red, "redNeg works only with red numbers"), this.red._verify1(this), this.red.neg(this);
-    }, o.prototype.redPow = function(n) {
-      return i(this.red && !n.red, "redPow(normalNum)"), this.red._verify1(this), this.red.pow(this, n);
-    };
-    var B = {
-      k256: null,
-      p224: null,
-      p192: null,
-      p25519: null
-    };
-    function L(y, n) {
-      this.name = y, this.p = new o(n, 16), this.n = this.p.bitLength(), this.k = new o(1).iushln(this.n).isub(this.p), this.tmp = this._tmp();
-    }
-    L.prototype._tmp = function() {
-      var n = new o(null);
-      return n.words = new Array(Math.ceil(this.n / 13)), n;
-    }, L.prototype.ireduce = function(n) {
-      var f = n, c;
-      do
-        this.split(f, this.tmp), f = this.imulK(f), f = f.iadd(this.tmp), c = f.bitLength();
-      while (c > this.n);
-      var g = c < this.n ? -1 : f.ucmp(this.p);
-      return g === 0 ? (f.words[0] = 0, f.length = 1) : g > 0 ? f.isub(this.p) : f.strip !== void 0 ? f.strip() : f._strip(), f;
-    }, L.prototype.split = function(n, f) {
-      n.iushrn(this.n, 0, f);
-    }, L.prototype.imulK = function(n) {
-      return n.imul(this.k);
-    };
-    function T() {
-      L.call(
-        this,
-        "k256",
-        "ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f"
-      );
-    }
-    a(T, L), T.prototype.split = function(n, f) {
-      for (var c = 4194303, g = Math.min(n.length, 9), d = 0; d < g; d++)
-        f.words[d] = n.words[d];
-      if (f.length = g, n.length <= 9) {
-        n.words[0] = 0, n.length = 1;
-        return;
-      }
-      var w = n.words[9];
-      for (f.words[f.length++] = w & c, d = 10; d < n.length; d++) {
-        var x = n.words[d] | 0;
-        n.words[d - 10] = (x & c) << 4 | w >>> 22, w = x;
-      }
-      w >>>= 22, n.words[d - 10] = w, w === 0 && n.length > 10 ? n.length -= 10 : n.length -= 9;
-    }, T.prototype.imulK = function(n) {
-      n.words[n.length] = 0, n.words[n.length + 1] = 0, n.length += 2;
-      for (var f = 0, c = 0; c < n.length; c++) {
-        var g = n.words[c] | 0;
-        f += g * 977, n.words[c] = f & 67108863, f = g * 64 + (f / 67108864 | 0);
-      }
-      return n.words[n.length - 1] === 0 && (n.length--, n.words[n.length - 1] === 0 && n.length--), n;
-    };
-    function q() {
-      L.call(
-        this,
-        "p224",
-        "ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001"
-      );
-    }
-    a(q, L);
-    function $() {
-      L.call(
-        this,
-        "p192",
-        "ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff"
-      );
-    }
-    a($, L);
-    function C() {
-      L.call(
-        this,
-        "25519",
-        "7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed"
-      );
-    }
-    a(C, L), C.prototype.imulK = function(n) {
-      for (var f = 0, c = 0; c < n.length; c++) {
-        var g = (n.words[c] | 0) * 19 + f, d = g & 67108863;
-        g >>>= 26, n.words[c] = d, f = g;
-      }
-      return f !== 0 && (n.words[n.length++] = f), n;
-    }, o._prime = function(n) {
-      if (B[n]) return B[n];
-      var f;
-      if (n === "k256")
-        f = new T();
-      else if (n === "p224")
-        f = new q();
-      else if (n === "p192")
-        f = new $();
-      else if (n === "p25519")
-        f = new C();
-      else
-        throw new Error("Unknown prime " + n);
-      return B[n] = f, f;
-    };
-    function U(y) {
-      if (typeof y == "string") {
-        var n = o._prime(y);
-        this.m = n.p, this.prime = n;
-      } else
-        i(y.gtn(1), "modulus must be greater than 1"), this.m = y, this.prime = null;
-    }
-    U.prototype._verify1 = function(n) {
-      i(n.negative === 0, "red works only with positives"), i(n.red, "red works only with red numbers");
-    }, U.prototype._verify2 = function(n, f) {
-      i((n.negative | f.negative) === 0, "red works only with positives"), i(
-        n.red && n.red === f.red,
-        "red works only with red numbers"
-      );
-    }, U.prototype.imod = function(n) {
-      return this.prime ? this.prime.ireduce(n)._forceRed(this) : (v(n, n.umod(this.m)._forceRed(this)), n);
-    }, U.prototype.neg = function(n) {
-      return n.isZero() ? n.clone() : this.m.sub(n)._forceRed(this);
-    }, U.prototype.add = function(n, f) {
-      this._verify2(n, f);
-      var c = n.add(f);
-      return c.cmp(this.m) >= 0 && c.isub(this.m), c._forceRed(this);
-    }, U.prototype.iadd = function(n, f) {
-      this._verify2(n, f);
-      var c = n.iadd(f);
-      return c.cmp(this.m) >= 0 && c.isub(this.m), c;
-    }, U.prototype.sub = function(n, f) {
-      this._verify2(n, f);
-      var c = n.sub(f);
-      return c.cmpn(0) < 0 && c.iadd(this.m), c._forceRed(this);
-    }, U.prototype.isub = function(n, f) {
-      this._verify2(n, f);
-      var c = n.isub(f);
-      return c.cmpn(0) < 0 && c.iadd(this.m), c;
-    }, U.prototype.shl = function(n, f) {
-      return this._verify1(n), this.imod(n.ushln(f));
-    }, U.prototype.imul = function(n, f) {
-      return this._verify2(n, f), this.imod(n.imul(f));
-    }, U.prototype.mul = function(n, f) {
-      return this._verify2(n, f), this.imod(n.mul(f));
-    }, U.prototype.isqr = function(n) {
-      return this.imul(n, n.clone());
-    }, U.prototype.sqr = function(n) {
-      return this.mul(n, n);
-    }, U.prototype.sqrt = function(n) {
-      if (n.isZero()) return n.clone();
-      var f = this.m.andln(3);
-      if (i(f % 2 === 1), f === 3) {
-        var c = this.m.add(new o(1)).iushrn(2);
-        return this.pow(n, c);
-      }
-      for (var g = this.m.subn(1), d = 0; !g.isZero() && g.andln(1) === 0; )
-        d++, g.iushrn(1);
-      i(!g.isZero());
-      var w = new o(1).toRed(this), x = w.redNeg(), h = this.m.subn(1).iushrn(1), s = this.m.bitLength();
-      for (s = new o(2 * s * s).toRed(this); this.pow(s, h).cmp(x) !== 0; )
-        s.redIAdd(x);
-      for (var p = this.pow(s, g), k = this.pow(n, g.addn(1).iushrn(1)), I = this.pow(n, g), N = d; I.cmp(w) !== 0; ) {
-        for (var P = I, Z = 0; P.cmp(w) !== 0; Z++)
-          P = P.redSqr();
-        i(Z < N);
-        var z = this.pow(p, new o(1).iushln(N - Z - 1));
-        k = k.redMul(z), p = z.redSqr(), I = I.redMul(p), N = Z;
-      }
-      return k;
-    }, U.prototype.invm = function(n) {
-      var f = n._invmp(this.m);
-      return f.negative !== 0 ? (f.negative = 0, this.imod(f).redNeg()) : this.imod(f);
-    }, U.prototype.pow = function(n, f) {
-      if (f.isZero()) return new o(1).toRed(this);
-      if (f.cmpn(1) === 0) return n.clone();
-      var c = 4, g = new Array(1 << c);
-      g[0] = new o(1).toRed(this), g[1] = n;
-      for (var d = 2; d < g.length; d++)
-        g[d] = this.mul(g[d - 1], n);
-      var w = g[0], x = 0, h = 0, s = f.bitLength() % 26;
-      for (s === 0 && (s = 26), d = f.length - 1; d >= 0; d--) {
-        for (var p = f.words[d], k = s - 1; k >= 0; k--) {
-          var I = p >> k & 1;
-          if (w !== g[0] && (w = this.sqr(w)), I === 0 && x === 0) {
-            h = 0;
-            continue;
-          }
-          x <<= 1, x |= I, h++, !(h !== c && (d !== 0 || k !== 0)) && (w = this.mul(w, g[x]), h = 0, x = 0);
-        }
-        s = 26;
-      }
-      return w;
-    }, U.prototype.convertTo = function(n) {
-      var f = n.umod(this.m);
-      return f === n ? f.clone() : f;
-    }, U.prototype.convertFrom = function(n) {
-      var f = n.clone();
-      return f.red = null, f;
-    }, o.mont = function(n) {
-      return new H(n);
-    };
-    function H(y) {
-      U.call(this, y), this.shift = this.m.bitLength(), this.shift % 26 !== 0 && (this.shift += 26 - this.shift % 26), this.r = new o(1).iushln(this.shift), this.r2 = this.imod(this.r.sqr()), this.rinv = this.r._invmp(this.m), this.minv = this.rinv.mul(this.r).isubn(1).div(this.m), this.minv = this.minv.umod(this.r), this.minv = this.r.sub(this.minv);
-    }
-    a(H, U), H.prototype.convertTo = function(n) {
-      return this.imod(n.ushln(this.shift));
-    }, H.prototype.convertFrom = function(n) {
-      var f = this.imod(n.mul(this.rinv));
-      return f.red = null, f;
-    }, H.prototype.imul = function(n, f) {
-      if (n.isZero() || f.isZero())
-        return n.words[0] = 0, n.length = 1, n;
-      var c = n.imul(f), g = c.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), d = c.isub(g).iushrn(this.shift), w = d;
-      return d.cmp(this.m) >= 0 ? w = d.isub(this.m) : d.cmpn(0) < 0 && (w = d.iadd(this.m)), w._forceRed(this);
-    }, H.prototype.mul = function(n, f) {
-      if (n.isZero() || f.isZero()) return new o(0)._forceRed(this);
-      var c = n.mul(f), g = c.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), d = c.isub(g).iushrn(this.shift), w = d;
-      return d.cmp(this.m) >= 0 ? w = d.isub(this.m) : d.cmpn(0) < 0 && (w = d.iadd(this.m)), w._forceRed(this);
-    }, H.prototype.invm = function(n) {
-      var f = this.imod(n._invmp(this.m).mul(this.r2));
-      return f._forceRed(this);
-    };
-  })(t, Js);
-})(En);
-var Fs = En.exports;
-const X = /* @__PURE__ */ $s(Fs);
-function Di(t) {
-  return X.isBN(t);
-}
-function Qs(t) {
-  return !!t && typeof t == "object";
-}
-function Pi(...t) {
-  return (e) => (Qs(e) || on(e)) && t.every((r) => on(e[r]));
-}
-const Zi = /* @__PURE__ */ Pi("toBigInt"), Vi = /* @__PURE__ */ Pi("toBn");
-function tf(t) {
-  return typeof t == "bigint" ? t : t ? fe(t) ? js(t.toString()) : Di(t) ? F(t.toString()) : Zi(t) ? t.toBigInt() : Vi(t) ? F(t.toBn().toString()) : F(t) : F(0);
-}
-function $t(...t) {
-  const e = t.length, r = new Array(e);
-  let i = 0;
-  for (let a = 0; a < e; a++)
-    r[a] = G(t[a]), i += r[a].length;
-  return He(r, i);
-}
-function He(t, e = 0) {
-  const r = t.length;
-  let i = 0;
-  if (!e)
-    for (let o = 0; o < r; o++)
-      e += t[o].length;
-  const a = new Uint8Array(e);
-  for (let o = 0; o < r; o++)
-    a.set(t[o], i), i += t[o].length;
-  return a;
-}
-function zi(t) {
-  const e = t.length | 0;
-  for (let r = 0; r < e; r++)
-    if (t[r] | 0)
-      return !1;
-  return !0;
-}
-function jt(t, e) {
-  const r = G(t), i = G(e);
-  if (r.length === i.length) {
-    const a = new DataView(r.buffer, r.byteOffset), o = new DataView(i.buffer, i.byteOffset), l = r.length % 4 | 0, u = r.length - l | 0;
-    for (let m = 0; m < u; m += 4)
-      if (a.getUint32(m) !== o.getUint32(m))
-        return !1;
-    for (let m = u, b = r.length; m < b; m++)
-      if (r[m] !== i[m])
-        return !1;
-    return !0;
-  }
-  return !1;
-}
-function ef(t, e = -1, r = !1) {
-  const i = Math.ceil(e / 8);
-  if (e === -1 || t.length === i)
-    return t;
-  if (t.length > i)
-    return t.subarray(0, i);
-  const a = new Uint8Array(i);
-  return a.set(t, r ? 0 : i - t.length), a;
-}
-function qr(t, { isLe: e = !0, isNegative: r = !1 } = {}) {
-  e || (t = t.slice().reverse());
-  const i = t.length;
-  if (r && i && t[i - 1] & 128)
-    switch (i) {
-      case 0:
-        return new X(0);
-      case 1:
-        return new X((t[0] ^ 255) * -1 - 1);
-      case 2:
-        return new X((t[0] + (t[1] << 8) ^ 65535) * -1 - 1);
-      case 3:
-        return new X((t[0] + (t[1] << 8) + (t[2] << 16) ^ 16777215) * -1 - 1);
-      case 4:
-        return new X((t[0] + (t[1] << 8) + (t[2] << 16) + t[3] * 16777216 ^ 4294967295) * -1 - 1);
-      case 5:
-        return new X(((t[0] + (t[1] << 8) + (t[2] << 16) + t[3] * 16777216 ^ 4294967295) + (t[4] ^ 255) * 4294967296) * -1 - 1);
-      case 6:
-        return new X(((t[0] + (t[1] << 8) + (t[2] << 16) + t[3] * 16777216 ^ 4294967295) + (t[4] + (t[5] << 8) ^ 65535) * 4294967296) * -1 - 1);
-      default:
-        return new X(t, "le").fromTwos(i * 8);
-    }
-  switch (i) {
-    case 0:
-      return new X(0);
-    case 1:
-      return new X(t[0]);
-    case 2:
-      return new X(t[0] + (t[1] << 8));
-    case 3:
-      return new X(t[0] + (t[1] << 8) + (t[2] << 16));
-    case 4:
-      return new X(t[0] + (t[1] << 8) + (t[2] << 16) + t[3] * 16777216);
-    case 5:
-      return new X(t[0] + (t[1] << 8) + (t[2] << 16) + (t[3] + (t[4] << 8)) * 16777216);
-    case 6:
-      return new X(t[0] + (t[1] << 8) + (t[2] << 16) + (t[3] + (t[4] << 8) + (t[5] << 16)) * 16777216);
-    default:
-      return new X(t, "le");
-  }
-}
-const $r = /* @__PURE__ */ G(`Ethereum Signed Message:
-`), Le = /* @__PURE__ */ G("<Bytes>"), Oe = /* @__PURE__ */ G("</Bytes>"), rf = Le.length + Oe.length;
-function ir(t, e) {
-  return t.length >= rf && jt(t.subarray(0, Le.length), Le) && jt(t.slice(-Oe.length), Oe) || e && t.length >= $r.length && jt(t.subarray(0, $r.length), $r);
-}
-function nf(t) {
-  const e = G(t);
-  return ir(e, !1) ? e.subarray(Le.length, e.length - Oe.length) : e;
-}
-function of(t) {
-  const e = G(t);
-  return ir(e, !0) ? e : He([Le, e, Oe]);
-}
-const ni = F(256), sf = F(255);
-function ff(t, e, r) {
-  const i = [], a = r && t < rr;
-  for (a && (t = (t + nr) * -nr); t !== rr; ) {
-    const o = t % ni, l = Number(a ? o ^ sf : o);
-    e ? i.push(l) : i.unshift(l), t = (t - o) / ni;
-  }
-  return Uint8Array.from(i);
-}
-function af(t, { bitLength: e = -1, isLe: r = !0, isNegative: i = !1 } = {}) {
-  const a = tf(t);
-  if (a === rr)
-    return e === -1 ? new Uint8Array(1) : new Uint8Array(Math.ceil((e || 0) / 8));
-  const o = ff(a, r, i);
-  if (e === -1)
-    return o;
-  const l = Math.ceil((e || 0) / 8), u = new Uint8Array(l);
-  return i && u.fill(255), u.set(o, r ? 0 : l - o.length), u;
-}
-function cf(t) {
-  if (!t || t === "0x")
-    return "";
-  if (ss.test(t))
-    return t.substring(2);
-  if (fs.test(t))
-    return t;
-  throw new Error(`Expected hex value to convert, found '${t}'`);
-}
-function hf(t, { isLe: e = !1, isNegative: r = !1 } = {}) {
-  if (!t || t === "0x")
-    return new X(0);
-  const i = cf(t), a = new X(i, 16, e ? "le" : "be");
-  return r ? a.fromTwos(i.length * 4) : a;
-}
-const dr = /* @__PURE__ */ new X(1), wr = /* @__PURE__ */ new X(2), ii = /* @__PURE__ */ new X(1e9);
-ii.mul(ii);
-Number.MAX_SAFE_INTEGER;
-function Gi(t) {
-  return typeof t == "bigint";
-}
-function Yi(t) {
-  return t ? X.isBN(t) ? t : fe(t) ? hf(t.toString()) : Gi(t) ? new X(t.toString()) : Vi(t) ? t.toBn() : Zi(t) ? new X(t.toBigInt().toString()) : new X(t) : new X(0);
-}
-const lf = { bitLength: -1, isLe: !0, isNegative: !1 };
-function Gt(t, { bitLength: e = -1, isLe: r = !0, isNegative: i = !1 } = lf) {
-  const a = Yi(t), o = Math.ceil(e === -1 ? a.bitLength() / 8 : (e || 0) / 8);
-  if (!t)
-    return e === -1 ? new Uint8Array(1) : new Uint8Array(o);
-  const l = new Uint8Array(o), u = i ? a.toTwos(o * 8) : a;
-  return l.set(u.toArray(r ? "le" : "be", o), 0), l;
-}
-const uf = wr.pow(new X(6)).isub(dr), df = wr.pow(new X(14)).isub(dr), wf = wr.pow(new X(30)).isub(dr), gf = { bitLength: 16 }, mf = { bitLength: 32 };
-function pf(t) {
-  const e = Yi(t);
-  if (e.lte(uf))
-    return new Uint8Array([e.toNumber() << 2]);
-  if (e.lte(df))
-    return Gt(e.shln(2).iadd(dr), gf);
-  if (e.lte(wf))
-    return Gt(e.shln(2).iadd(wr), mf);
-  const r = Gt(e);
-  let i = r.length;
-  for (; r[i - 1] === 0; )
-    i--;
-  if (i < 4)
-    throw new Error("Invalid length, previous checks match anything less than 2^30");
-  return He([
-    // subtract 4 as minimum (also catered for in decoding)
-    new Uint8Array([(i - 4 << 2) + 3]),
-    r.subarray(0, i)
-  ]);
-}
-function _n(t) {
-  return He([
-    pf(t.length),
-    t
-  ]);
-}
-function yf(t) {
-  return typeof t == "string" || t instanceof String;
-}
-function xf(t) {
-  return typeof t == "number";
-}
-const vf = { name: "@polkadot/util-crypto", 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" };
-function Mn(t) {
-  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
-}
-function bf(t, ...e) {
-  if (!Mn(t))
-    throw new Error("Uint8Array expected");
-  if (e.length > 0 && !e.includes(t.length))
-    throw new Error("Uint8Array expected of length " + e + ", got length=" + t.length);
-}
-function Wi(t, e) {
-  return Array.isArray(e) ? e.length === 0 ? !0 : t ? e.every((r) => typeof r == "string") : e.every((r) => Number.isSafeInteger(r)) : !1;
-}
-function Te(t, e) {
-  if (typeof e != "string")
-    throw new Error(`${t}: string expected`);
-  return !0;
-}
-function qe(t) {
-  if (!Number.isSafeInteger(t))
-    throw new Error(`invalid integer: ${t}`);
-}
-function or(t) {
-  if (!Array.isArray(t))
-    throw new Error("array expected");
-}
-function sr(t, e) {
-  if (!Wi(!0, e))
-    throw new Error(`${t}: array of strings expected`);
-}
-function Xi(t, e) {
-  if (!Wi(!1, e))
-    throw new Error(`${t}: array of numbers expected`);
-}
-// @__NO_SIDE_EFFECTS__
-function Ki(...t) {
-  const e = (o) => o, r = (o, l) => (u) => o(l(u)), i = t.map((o) => o.encode).reduceRight(r, e), a = t.map((o) => o.decode).reduce(r, e);
-  return { encode: i, decode: a };
-}
-// @__NO_SIDE_EFFECTS__
-function ji(t) {
-  const e = typeof t == "string" ? t.split("") : t, r = e.length;
-  sr("alphabet", e);
-  const i = new Map(e.map((a, o) => [a, o]));
-  return {
-    encode: (a) => (or(a), a.map((o) => {
-      if (!Number.isSafeInteger(o) || o < 0 || o >= r)
-        throw new Error(`alphabet.encode: digit index outside alphabet "${o}". Allowed: ${t}`);
-      return e[o];
-    })),
-    decode: (a) => (or(a), a.map((o) => {
-      Te("alphabet.decode", o);
-      const l = i.get(o);
-      if (l === void 0)
-        throw new Error(`Unknown letter: "${o}". Allowed: ${t}`);
-      return l;
-    }))
-  };
-}
-// @__NO_SIDE_EFFECTS__
-function Ji(t = "") {
-  return Te("join", t), {
-    encode: (e) => (sr("join.decode", e), e.join(t)),
-    decode: (e) => (Te("join.decode", e), e.split(t))
-  };
-}
-// @__NO_SIDE_EFFECTS__
-function Ef(t, e = "=") {
-  return qe(t), Te("padding", e), {
-    encode(r) {
-      for (sr("padding.encode", r); r.length * t % 8; )
-        r.push(e);
-      return r;
-    },
-    decode(r) {
-      sr("padding.decode", r);
-      let i = r.length;
-      if (i * t % 8)
-        throw new Error("padding: invalid, string should have whole number of bytes");
-      for (; i > 0 && r[i - 1] === e; i--)
-        if ((i - 1) * t % 8 === 0)
-          throw new Error("padding: invalid, string has too much padding");
-      return r.slice(0, i);
-    }
-  };
-}
-function oi(t, e, r) {
-  if (e < 2)
-    throw new Error(`convertRadix: invalid from=${e}, base cannot be less than 2`);
-  if (r < 2)
-    throw new Error(`convertRadix: invalid to=${r}, base cannot be less than 2`);
-  if (or(t), !t.length)
-    return [];
-  let i = 0;
-  const a = [], o = Array.from(t, (u) => {
-    if (qe(u), u < 0 || u >= e)
-      throw new Error(`invalid integer: ${u}`);
-    return u;
-  }), l = o.length;
-  for (; ; ) {
-    let u = 0, m = !0;
-    for (let b = i; b < l; b++) {
-      const v = o[b], E = e * u, M = E + v;
-      if (!Number.isSafeInteger(M) || E / e !== u || M - v !== E)
-        throw new Error("convertRadix: carry overflow");
-      const S = M / r;
-      u = M % r;
-      const O = Math.floor(S);
-      if (o[b] = O, !Number.isSafeInteger(O) || O * r + u !== M)
-        throw new Error("convertRadix: carry overflow");
-      if (m)
-        O ? m = !1 : i = b;
-      else continue;
-    }
-    if (a.push(u), m)
-      break;
-  }
-  for (let u = 0; u < t.length - 1 && t[u] === 0; u++)
-    a.push(0);
-  return a.reverse();
-}
-const Fi = (t, e) => e === 0 ? t : Fi(e, t % e), fr = /* @__NO_SIDE_EFFECTS__ */ (t, e) => t + (e - Fi(t, e)), Cr = /* @__PURE__ */ (() => {
-  let t = [];
-  for (let e = 0; e < 40; e++)
-    t.push(2 ** e);
-  return t;
-})();
-function si(t, e, r, i) {
-  if (or(t), e <= 0 || e > 32)
-    throw new Error(`convertRadix2: wrong from=${e}`);
-  if (r <= 0 || r > 32)
-    throw new Error(`convertRadix2: wrong to=${r}`);
-  if (/* @__PURE__ */ fr(e, r) > 32)
-    throw new Error(`convertRadix2: carry overflow from=${e} to=${r} carryBits=${/* @__PURE__ */ fr(e, r)}`);
-  let a = 0, o = 0;
-  const l = Cr[e], u = Cr[r] - 1, m = [];
-  for (const b of t) {
-    if (qe(b), b >= l)
-      throw new Error(`convertRadix2: invalid data word=${b} from=${e}`);
-    if (a = a << e | b, o + e > 32)
-      throw new Error(`convertRadix2: carry overflow pos=${o} from=${e}`);
-    for (o += e; o >= r; o -= r)
-      m.push((a >> o - r & u) >>> 0);
-    const v = Cr[o];
-    if (v === void 0)
-      throw new Error("invalid carry");
-    a &= v - 1;
-  }
-  if (a = a << r - o & u, !i && o >= e)
-    throw new Error("Excess padding");
-  if (!i && a > 0)
-    throw new Error(`Non-zero padding: ${a}`);
-  return i && o > 0 && m.push(a >>> 0), m;
-}
-// @__NO_SIDE_EFFECTS__
-function _f(t) {
-  qe(t);
-  const e = 2 ** 8;
-  return {
-    encode: (r) => {
-      if (!Mn(r))
-        throw new Error("radix.encode input should be Uint8Array");
-      return oi(Array.from(r), e, t);
-    },
-    decode: (r) => (Xi("radix.decode", r), Uint8Array.from(oi(r, t, e)))
-  };
-}
-// @__NO_SIDE_EFFECTS__
-function Mf(t, e = !1) {
-  if (qe(t), t <= 0 || t > 32)
-    throw new Error("radix2: bits should be in (0..32]");
-  if (/* @__PURE__ */ fr(8, t) > 32 || /* @__PURE__ */ fr(t, 8) > 32)
-    throw new Error("radix2: carry overflow");
-  return {
-    encode: (r) => {
-      if (!Mn(r))
-        throw new Error("radix2.encode input should be Uint8Array");
-      return si(Array.from(r), 8, t, !e);
-    },
-    decode: (r) => (Xi("radix2.decode", r), Uint8Array.from(si(r, t, 8, e)))
-  };
-}
-const Af = typeof Uint8Array.from([]).toBase64 == "function" && typeof Uint8Array.fromBase64 == "function", Bf = (t, e) => {
-  Te("base64", t);
-  const r = /^[A-Za-z0-9=+/]+$/, i = "base64";
-  if (t.length > 0 && !r.test(t))
-    throw new Error("invalid base64");
-  return Uint8Array.fromBase64(t, { alphabet: i, lastChunkHandling: "strict" });
-}, Sf = Af ? {
-  encode(t) {
-    return bf(t), t.toBase64();
-  },
-  decode(t) {
-    return Bf(t);
-  }
-} : /* @__PURE__ */ Ki(/* @__PURE__ */ Mf(6), /* @__PURE__ */ ji("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), /* @__PURE__ */ Ef(6), /* @__PURE__ */ Ji("")), If = /* @__NO_SIDE_EFFECTS__ */ (t) => /* @__PURE__ */ Ki(/* @__PURE__ */ _f(58), /* @__PURE__ */ ji(t), /* @__PURE__ */ Ji("")), Uf = /* @__PURE__ */ If("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
-function Qi({ coder: t, ipfs: e }, r) {
-  return (i, a) => (r(i, a), t.decode(e && a ? i.substring(1) : i));
-}
-function to({ coder: t, ipfs: e }) {
-  return (r, i) => {
-    const a = t.encode(G(r));
-    return e && i ? `${e}${a}` : a;
-  };
-}
-function eo({ chars: t, ipfs: e, type: r, withPadding: i }) {
-  return (a, o) => {
-    if (typeof a != "string")
-      throw new Error(`Expected ${r} string input`);
-    if (e && o && !a.startsWith(e))
-      throw new Error(`Expected ipfs-compatible ${r} to start with '${e}'`);
-    for (let l = o ? 1 : 0, u = a.length; l < u; l++)
-      if (!t.includes(a[l])) if (i && a[l] === "=") {
-        if (l !== u - 1) {
-          if (a[l + 1] !== "=") throw new Error(`Invalid ${r} padding sequence "${a[l]}${a[l + 1]}" at index ${l}`);
-        }
-      } else
-        throw new Error(`Invalid ${r} character "${a[l]}" (0x${a.charCodeAt(l).toString(16)}) at index ${l}`);
-    return !0;
-  };
-}
-const An = {
-  chars: "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz",
-  coder: Uf,
-  ipfs: "z",
-  type: "base58"
-}, kf = /* @__PURE__ */ eo(An), Nf = /* @__PURE__ */ Qi(An, kf), Rf = /* @__PURE__ */ to(An), Lf = ce("SS58PRE");
-function ro(t) {
-  return we($t(Lf, t), 512);
-}
-function Of(t) {
-  const e = t[0] & 64 ? 2 : 1, r = e === 1 ? t[0] : (t[0] & 63) << 2 | t[1] >> 6 | (t[1] & 63) << 8, i = [34 + e, 35 + e].includes(t.length), a = t.length - (i ? 2 : 1), o = ro(t.subarray(0, a));
-  return [(t[0] & 128) === 0 && ![46, 47].includes(t[0]) && (i ? t[t.length - 2] === o[0] && t[t.length - 1] === o[1] : t[t.length - 1] === o[0]), a, e, r];
-}
-const Fe = {
-  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 be(t, e, r = -1) {
-  if (!t)
-    throw new Error("Invalid empty address passed");
-  if (de(t) || fe(t))
-    return G(t);
-  try {
-    const i = Nf(t);
-    if (!Fe.allowedEncodedLengths.includes(i.length))
-      throw new Error("Invalid decoded address length");
-    const [a, o, l, u] = Of(i);
-    if (!a && !e)
-      throw new Error("Invalid decoded address checksum");
-    if (r !== -1 && r !== u)
-      throw new Error(`Expected ss58Format ${r}, received ${u}`);
-    return i.slice(l, o);
-  } catch (i) {
-    throw new Error(`Decoding ${t}: ${i.message}`);
-  }
-}
-const fi = { isLe: !1 }, Dr = { isLe: !0 }, Tf = { bitLength: 32, isLe: !1 }, Pr = { bitLength: 32, isLe: !0 }, Ee = { bitLength: 256, isLe: !1 }, Hf = { bitLength: 256, isLe: !0 }, qf = /^\d+$/, $f = 32;
-class Bn {
-  constructor() {
-    Jt(this, "__internal__chainCode", new Uint8Array(32));
-    Jt(this, "__internal__isHard", !1);
-  }
-  static from(e) {
-    const r = new Bn(), [i, a] = e.startsWith("/") ? [e.substring(1), !0] : [e, !1];
-    return r.soft(qf.test(i) ? new X(i, 10) : i), a ? r.harden() : r;
-  }
-  get chainCode() {
-    return this.__internal__chainCode;
-  }
-  get isHard() {
-    return this.__internal__isHard;
-  }
-  get isSoft() {
-    return !this.__internal__isHard;
-  }
-  hard(e) {
-    return this.soft(e).harden();
-  }
-  harden() {
-    return this.__internal__isHard = !0, this;
-  }
-  soft(e) {
-    return xf(e) || Di(e) || Gi(e) ? this.soft(Gt(e, Hf)) : fe(e) ? this.soft(ke(e)) : yf(e) ? this.soft(_n(ce(e))) : e.length > $f ? this.soft(we(e)) : (this.__internal__chainCode.fill(0), this.__internal__chainCode.set(e, 0), this);
-  }
-  soften() {
-    return this.__internal__isHard = !1, this;
-  }
-}
-const Cf = /\/(\/?)([^/]+)/g;
-function no(t) {
-  const e = t.match(Cf), r = [];
-  let i = "";
-  if (e) {
-    i = e.join("");
-    for (const a of e)
-      r.push(Bn.from(a.substring(1)));
-  }
-  if (i !== t)
-    throw new Error(`Re-constructed path "${i}" does not match input`);
-  return {
-    parts: e,
-    path: r
-  };
-}
-const Df = /^(\w+( \w+)*)((\/\/?[^/]+)*)(\/\/\/(.*))?$/;
-function Pf(t) {
-  const e = t.match(Df);
-  if (e === null)
-    throw new Error("Unable to match provided value to a secret URI");
-  const [, r, , i, , , a] = e, { path: o } = no(i);
-  return {
-    derivePath: i,
-    password: a,
-    path: o,
-    phrase: r
-  };
-}
-const Zf = _n(ce("Secp256k1HDKD"));
-function Vf(t, e) {
-  if (!de(e) || e.length !== 32)
-    throw new Error("Invalid chainCode passed to derive");
-  return we($t(Zf, t, e), 256);
-}
-const ge = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
-function zf(t) {
-  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
-}
-function fn(t) {
-  if (!Number.isSafeInteger(t) || t < 0)
-    throw new Error("positive integer expected, got " + t);
-}
-function $e(t, ...e) {
-  if (!zf(t))
-    throw new Error("Uint8Array expected");
-  if (e.length > 0 && !e.includes(t.length))
-    throw new Error("Uint8Array expected of length " + e + ", got length=" + t.length);
-}
-function Gf(t) {
-  if (typeof t != "function" || typeof t.create != "function")
-    throw new Error("Hash should be wrapped by utils.createHasher");
-  fn(t.outputLen), fn(t.blockLen);
-}
-function ar(t, e = !0) {
-  if (t.destroyed)
-    throw new Error("Hash instance has been destroyed");
-  if (e && t.finished)
-    throw new Error("Hash#digest() has already been called");
-}
-function Yf(t, e) {
-  $e(t);
-  const r = e.outputLen;
-  if (t.length < r)
-    throw new Error("digestInto() expects output buffer of length at least " + r);
-}
-function _e(...t) {
-  for (let e = 0; e < t.length; e++)
-    t[e].fill(0);
-}
-function Zr(t) {
-  return new DataView(t.buffer, t.byteOffset, t.byteLength);
-}
-function Xt(t, e) {
-  return t << 32 - e | t >>> e;
-}
-function Wf(t) {
-  if (typeof t != "string")
-    throw new Error("string expected");
-  return new Uint8Array(new TextEncoder().encode(t));
-}
-function Sn(t) {
-  return typeof t == "string" && (t = Wf(t)), $e(t), t;
-}
-function Xf(...t) {
-  let e = 0;
-  for (let i = 0; i < t.length; i++) {
-    const a = t[i];
-    $e(a), e += a.length;
-  }
-  const r = new Uint8Array(e);
-  for (let i = 0, a = 0; i < t.length; i++) {
-    const o = t[i];
-    r.set(o, a), a += o.length;
-  }
-  return r;
-}
-class io {
-}
-function oo(t) {
-  const e = (i) => t().update(Sn(i)).digest(), r = t();
-  return e.outputLen = r.outputLen, e.blockLen = r.blockLen, e.create = () => t(), e;
-}
-function so(t = 32) {
-  if (ge && typeof ge.getRandomValues == "function")
-    return ge.getRandomValues(new Uint8Array(t));
-  if (ge && typeof ge.randomBytes == "function")
-    return Uint8Array.from(ge.randomBytes(t));
-  throw new Error("crypto.getRandomValues must be defined");
-}
-function Kf(t, e, r, i) {
-  if (typeof t.setBigUint64 == "function")
-    return t.setBigUint64(e, r, i);
-  const a = BigInt(32), o = BigInt(4294967295), l = Number(r >> a & o), u = Number(r & o), m = i ? 4 : 0, b = i ? 0 : 4;
-  t.setUint32(e + m, l, i), t.setUint32(e + b, u, i);
-}
-function jf(t, e, r) {
-  return t & e ^ ~t & r;
-}
-function Jf(t, e, r) {
-  return t & e ^ t & r ^ e & r;
-}
-class fo extends io {
-  constructor(e, r, i, a) {
-    super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = e, this.outputLen = r, this.padOffset = i, this.isLE = a, this.buffer = new Uint8Array(e), this.view = Zr(this.buffer);
-  }
-  update(e) {
-    ar(this), e = Sn(e), $e(e);
-    const { view: r, buffer: i, blockLen: a } = this, o = e.length;
-    for (let l = 0; l < o; ) {
-      const u = Math.min(a - this.pos, o - l);
-      if (u === a) {
-        const m = Zr(e);
-        for (; a <= o - l; l += a)
-          this.process(m, l);
-        continue;
-      }
-      i.set(e.subarray(l, l + u), this.pos), this.pos += u, l += u, this.pos === a && (this.process(r, 0), this.pos = 0);
-    }
-    return this.length += e.length, this.roundClean(), this;
-  }
-  digestInto(e) {
-    ar(this), Yf(e, this), this.finished = !0;
-    const { buffer: r, view: i, blockLen: a, isLE: o } = this;
-    let { pos: l } = this;
-    r[l++] = 128, _e(this.buffer.subarray(l)), this.padOffset > a - l && (this.process(i, 0), l = 0);
-    for (let E = l; E < a; E++)
-      r[E] = 0;
-    Kf(i, a - 8, BigInt(this.length * 8), o), this.process(i, 0);
-    const u = Zr(e), m = this.outputLen;
-    if (m % 4)
-      throw new Error("_sha2: outputLen should be aligned to 32bit");
-    const b = m / 4, v = this.get();
-    if (b > v.length)
-      throw new Error("_sha2: outputLen bigger than state");
-    for (let E = 0; E < b; E++)
-      u.setUint32(4 * E, v[E], o);
-  }
-  digest() {
-    const { buffer: e, outputLen: r } = this;
-    this.digestInto(e);
-    const i = e.slice(0, r);
-    return this.destroy(), i;
-  }
-  _cloneInto(e) {
-    e || (e = new this.constructor()), e.set(...this.get());
-    const { blockLen: r, buffer: i, length: a, finished: o, destroyed: l, pos: u } = this;
-    return e.destroyed = l, e.finished = o, e.length = a, e.pos = u, a % r && e.buffer.set(i), e;
-  }
-  clone() {
-    return this._cloneInto();
-  }
-}
-const re = /* @__PURE__ */ Uint32Array.from([
-  1779033703,
-  3144134277,
-  1013904242,
-  2773480762,
-  1359893119,
-  2600822924,
-  528734635,
-  1541459225
-]);
-const Dt = /* @__PURE__ */ Uint32Array.from([
-  1779033703,
-  4089235720,
-  3144134277,
-  2227873595,
-  1013904242,
-  4271175723,
-  2773480762,
-  1595750129,
-  1359893119,
-  2917565137,
-  2600822924,
-  725511199,
-  528734635,
-  4215389547,
-  1541459225,
-  327033209
-]), Ge = /* @__PURE__ */ BigInt(2 ** 32 - 1), ai = /* @__PURE__ */ BigInt(32);
-function Ff(t, e = !1) {
-  return e ? { h: Number(t & Ge), l: Number(t >> ai & Ge) } : { h: Number(t >> ai & Ge) | 0, l: Number(t & Ge) | 0 };
-}
-function Qf(t, e = !1) {
-  const r = t.length;
-  let i = new Uint32Array(r), a = new Uint32Array(r);
-  for (let o = 0; o < r; o++) {
-    const { h: l, l: u } = Ff(t[o], e);
-    [i[o], a[o]] = [l, u];
-  }
-  return [i, a];
-}
-const ci = (t, e, r) => t >>> r, hi = (t, e, r) => t << 32 - r | e >>> r, me = (t, e, r) => t >>> r | e << 32 - r, pe = (t, e, r) => t << 32 - r | e >>> r, Ye = (t, e, r) => t << 64 - r | e >>> r - 32, We = (t, e, r) => t >>> r - 32 | e << 64 - r;
-function Ft(t, e, r, i) {
-  const a = (e >>> 0) + (i >>> 0);
-  return { h: t + r + (a / 2 ** 32 | 0) | 0, l: a | 0 };
-}
-const t0 = (t, e, r) => (t >>> 0) + (e >>> 0) + (r >>> 0), e0 = (t, e, r, i) => e + r + i + (t / 2 ** 32 | 0) | 0, r0 = (t, e, r, i) => (t >>> 0) + (e >>> 0) + (r >>> 0) + (i >>> 0), n0 = (t, e, r, i, a) => e + r + i + a + (t / 2 ** 32 | 0) | 0, i0 = (t, e, r, i, a) => (t >>> 0) + (e >>> 0) + (r >>> 0) + (i >>> 0) + (a >>> 0), o0 = (t, e, r, i, a, o) => e + r + i + a + o + (t / 2 ** 32 | 0) | 0, s0 = /* @__PURE__ */ Uint32Array.from([
-  1116352408,
-  1899447441,
-  3049323471,
-  3921009573,
-  961987163,
-  1508970993,
-  2453635748,
-  2870763221,
-  3624381080,
-  310598401,
-  607225278,
-  1426881987,
-  1925078388,
-  2162078206,
-  2614888103,
-  3248222580,
-  3835390401,
-  4022224774,
-  264347078,
-  604807628,
-  770255983,
-  1249150122,
-  1555081692,
-  1996064986,
-  2554220882,
-  2821834349,
-  2952996808,
-  3210313671,
-  3336571891,
-  3584528711,
-  113926993,
-  338241895,
-  666307205,
-  773529912,
-  1294757372,
-  1396182291,
-  1695183700,
-  1986661051,
-  2177026350,
-  2456956037,
-  2730485921,
-  2820302411,
-  3259730800,
-  3345764771,
-  3516065817,
-  3600352804,
-  4094571909,
-  275423344,
-  430227734,
-  506948616,
-  659060556,
-  883997877,
-  958139571,
-  1322822218,
-  1537002063,
-  1747873779,
-  1955562222,
-  2024104815,
-  2227730452,
-  2361852424,
-  2428436474,
-  2756734187,
-  3204031479,
-  3329325298
-]), ne = /* @__PURE__ */ new Uint32Array(64);
-class f0 extends fo {
-  constructor(e = 32) {
-    super(64, e, 8, !1), this.A = re[0] | 0, this.B = re[1] | 0, this.C = re[2] | 0, this.D = re[3] | 0, this.E = re[4] | 0, this.F = re[5] | 0, this.G = re[6] | 0, this.H = re[7] | 0;
-  }
-  get() {
-    const { A: e, B: r, C: i, D: a, E: o, F: l, G: u, H: m } = this;
-    return [e, r, i, a, o, l, u, m];
-  }
-  // prettier-ignore
-  set(e, r, i, a, o, l, u, m) {
-    this.A = e | 0, this.B = r | 0, this.C = i | 0, this.D = a | 0, this.E = o | 0, this.F = l | 0, this.G = u | 0, this.H = m | 0;
-  }
-  process(e, r) {
-    for (let E = 0; E < 16; E++, r += 4)
-      ne[E] = e.getUint32(r, !1);
-    for (let E = 16; E < 64; E++) {
-      const M = ne[E - 15], S = ne[E - 2], O = Xt(M, 7) ^ Xt(M, 18) ^ M >>> 3, A = Xt(S, 17) ^ Xt(S, 19) ^ S >>> 10;
-      ne[E] = A + ne[E - 7] + O + ne[E - 16] | 0;
-    }
-    let { A: i, B: a, C: o, D: l, E: u, F: m, G: b, H: v } = this;
-    for (let E = 0; E < 64; E++) {
-      const M = Xt(u, 6) ^ Xt(u, 11) ^ Xt(u, 25), S = v + M + jf(u, m, b) + s0[E] + ne[E] | 0, A = (Xt(i, 2) ^ Xt(i, 13) ^ Xt(i, 22)) + Jf(i, a, o) | 0;
-      v = b, b = m, m = u, u = l + S | 0, l = o, o = a, a = i, i = S + A | 0;
-    }
-    i = i + this.A | 0, a = a + this.B | 0, o = o + this.C | 0, l = l + this.D | 0, u = u + this.E | 0, m = m + this.F | 0, b = b + this.G | 0, v = v + this.H | 0, this.set(i, a, o, l, u, m, b, v);
-  }
-  roundClean() {
-    _e(ne);
-  }
-  destroy() {
-    this.set(0, 0, 0, 0, 0, 0, 0, 0), _e(this.buffer);
-  }
-}
-const ao = Qf([
-  "0x428a2f98d728ae22",
-  "0x7137449123ef65cd",
-  "0xb5c0fbcfec4d3b2f",
-  "0xe9b5dba58189dbbc",
-  "0x3956c25bf348b538",
-  "0x59f111f1b605d019",
-  "0x923f82a4af194f9b",
-  "0xab1c5ed5da6d8118",
-  "0xd807aa98a3030242",
-  "0x12835b0145706fbe",
-  "0x243185be4ee4b28c",
-  "0x550c7dc3d5ffb4e2",
-  "0x72be5d74f27b896f",
-  "0x80deb1fe3b1696b1",
-  "0x9bdc06a725c71235",
-  "0xc19bf174cf692694",
-  "0xe49b69c19ef14ad2",
-  "0xefbe4786384f25e3",
-  "0x0fc19dc68b8cd5b5",
-  "0x240ca1cc77ac9c65",
-  "0x2de92c6f592b0275",
-  "0x4a7484aa6ea6e483",
-  "0x5cb0a9dcbd41fbd4",
-  "0x76f988da831153b5",
-  "0x983e5152ee66dfab",
-  "0xa831c66d2db43210",
-  "0xb00327c898fb213f",
-  "0xbf597fc7beef0ee4",
-  "0xc6e00bf33da88fc2",
-  "0xd5a79147930aa725",
-  "0x06ca6351e003826f",
-  "0x142929670a0e6e70",
-  "0x27b70a8546d22ffc",
-  "0x2e1b21385c26c926",
-  "0x4d2c6dfc5ac42aed",
-  "0x53380d139d95b3df",
-  "0x650a73548baf63de",
-  "0x766a0abb3c77b2a8",
-  "0x81c2c92e47edaee6",
-  "0x92722c851482353b",
-  "0xa2bfe8a14cf10364",
-  "0xa81a664bbc423001",
-  "0xc24b8b70d0f89791",
-  "0xc76c51a30654be30",
-  "0xd192e819d6ef5218",
-  "0xd69906245565a910",
-  "0xf40e35855771202a",
-  "0x106aa07032bbd1b8",
-  "0x19a4c116b8d2d0c8",
-  "0x1e376c085141ab53",
-  "0x2748774cdf8eeb99",
-  "0x34b0bcb5e19b48a8",
-  "0x391c0cb3c5c95a63",
-  "0x4ed8aa4ae3418acb",
-  "0x5b9cca4f7763e373",
-  "0x682e6ff3d6b2b8a3",
-  "0x748f82ee5defb2fc",
-  "0x78a5636f43172f60",
-  "0x84c87814a1f0ab72",
-  "0x8cc702081a6439ec",
-  "0x90befffa23631e28",
-  "0xa4506cebde82bde9",
-  "0xbef9a3f7b2c67915",
-  "0xc67178f2e372532b",
-  "0xca273eceea26619c",
-  "0xd186b8c721c0c207",
-  "0xeada7dd6cde0eb1e",
-  "0xf57d4f7fee6ed178",
-  "0x06f067aa72176fba",
-  "0x0a637dc5a2c898a6",
-  "0x113f9804bef90dae",
-  "0x1b710b35131c471b",
-  "0x28db77f523047d84",
-  "0x32caab7b40c72493",
-  "0x3c9ebe0a15c9bebc",
-  "0x431d67c49c100d4c",
-  "0x4cc5d4becb3e42b6",
-  "0x597f299cfc657e2a",
-  "0x5fcb6fab3ad6faec",
-  "0x6c44198c4a475817"
-].map((t) => BigInt(t))), a0 = ao[0], c0 = ao[1], ie = /* @__PURE__ */ new Uint32Array(80), oe = /* @__PURE__ */ new Uint32Array(80);
-class h0 extends fo {
-  constructor(e = 64) {
-    super(128, e, 16, !1), this.Ah = Dt[0] | 0, this.Al = Dt[1] | 0, this.Bh = Dt[2] | 0, this.Bl = Dt[3] | 0, this.Ch = Dt[4] | 0, this.Cl = Dt[5] | 0, this.Dh = Dt[6] | 0, this.Dl = Dt[7] | 0, this.Eh = Dt[8] | 0, this.El = Dt[9] | 0, this.Fh = Dt[10] | 0, this.Fl = Dt[11] | 0, this.Gh = Dt[12] | 0, this.Gl = Dt[13] | 0, this.Hh = Dt[14] | 0, this.Hl = Dt[15] | 0;
-  }
-  // prettier-ignore
-  get() {
-    const { Ah: e, Al: r, Bh: i, Bl: a, Ch: o, Cl: l, Dh: u, Dl: m, Eh: b, El: v, Fh: E, Fl: M, Gh: S, Gl: O, Hh: A, Hl: D } = this;
-    return [e, r, i, a, o, l, u, m, b, v, E, M, S, O, A, D];
-  }
-  // prettier-ignore
-  set(e, r, i, a, o, l, u, m, b, v, E, M, S, O, A, D) {
-    this.Ah = e | 0, this.Al = r | 0, this.Bh = i | 0, this.Bl = a | 0, this.Ch = o | 0, this.Cl = l | 0, this.Dh = u | 0, this.Dl = m | 0, this.Eh = b | 0, this.El = v | 0, this.Fh = E | 0, this.Fl = M | 0, this.Gh = S | 0, this.Gl = O | 0, this.Hh = A | 0, this.Hl = D | 0;
-  }
-  process(e, r) {
-    for (let R = 0; R < 16; R++, r += 4)
-      ie[R] = e.getUint32(r), oe[R] = e.getUint32(r += 4);
-    for (let R = 16; R < 80; R++) {
-      const _ = ie[R - 15] | 0, B = oe[R - 15] | 0, L = me(_, B, 1) ^ me(_, B, 8) ^ ci(_, B, 7), T = pe(_, B, 1) ^ pe(_, B, 8) ^ hi(_, B, 7), q = ie[R - 2] | 0, $ = oe[R - 2] | 0, C = me(q, $, 19) ^ Ye(q, $, 61) ^ ci(q, $, 6), U = pe(q, $, 19) ^ We(q, $, 61) ^ hi(q, $, 6), H = r0(T, U, oe[R - 7], oe[R - 16]), y = n0(H, L, C, ie[R - 7], ie[R - 16]);
-      ie[R] = y | 0, oe[R] = H | 0;
-    }
-    let { Ah: i, Al: a, Bh: o, Bl: l, Ch: u, Cl: m, Dh: b, Dl: v, Eh: E, El: M, Fh: S, Fl: O, Gh: A, Gl: D, Hh: V, Hl: Q } = this;
-    for (let R = 0; R < 80; R++) {
-      const _ = me(E, M, 14) ^ me(E, M, 18) ^ Ye(E, M, 41), B = pe(E, M, 14) ^ pe(E, M, 18) ^ We(E, M, 41), L = E & S ^ ~E & A, T = M & O ^ ~M & D, q = i0(Q, B, T, c0[R], oe[R]), $ = o0(q, V, _, L, a0[R], ie[R]), C = q | 0, U = me(i, a, 28) ^ Ye(i, a, 34) ^ Ye(i, a, 39), H = pe(i, a, 28) ^ We(i, a, 34) ^ We(i, a, 39), y = i & o ^ i & u ^ o & u, n = a & l ^ a & m ^ l & m;
-      V = A | 0, Q = D | 0, A = S | 0, D = O | 0, S = E | 0, O = M | 0, { h: E, l: M } = Ft(b | 0, v | 0, $ | 0, C | 0), b = u | 0, v = m | 0, u = o | 0, m = l | 0, o = i | 0, l = a | 0;
-      const f = t0(C, H, n);
-      i = e0(f, $, U, y), a = f | 0;
-    }
-    ({ h: i, l: a } = Ft(this.Ah | 0, this.Al | 0, i | 0, a | 0)), { h: o, l } = Ft(this.Bh | 0, this.Bl | 0, o | 0, l | 0), { h: u, l: m } = Ft(this.Ch | 0, this.Cl | 0, u | 0, m | 0), { h: b, l: v } = Ft(this.Dh | 0, this.Dl | 0, b | 0, v | 0), { h: E, l: M } = Ft(this.Eh | 0, this.El | 0, E | 0, M | 0), { h: S, l: O } = Ft(this.Fh | 0, this.Fl | 0, S | 0, O | 0), { h: A, l: D } = Ft(this.Gh | 0, this.Gl | 0, A | 0, D | 0), { h: V, l: Q } = Ft(this.Hh | 0, this.Hl | 0, V | 0, Q | 0), this.set(i, a, o, l, u, m, b, v, E, M, S, O, A, D, V, Q);
-  }
-  roundClean() {
-    _e(ie, oe);
-  }
-  destroy() {
-    _e(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
-  }
-}
-const l0 = /* @__PURE__ */ oo(() => new f0()), u0 = /* @__PURE__ */ oo(() => new h0());
-class co extends io {
-  constructor(e, r) {
-    super(), this.finished = !1, this.destroyed = !1, Gf(e);
-    const i = Sn(r);
-    if (this.iHash = e.create(), typeof this.iHash.update != "function")
-      throw new Error("Expected instance of class which extends utils.Hash");
-    this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
-    const a = this.blockLen, o = new Uint8Array(a);
-    o.set(i.length > a ? e.create().update(i).digest() : i);
-    for (let l = 0; l < o.length; l++)
-      o[l] ^= 54;
-    this.iHash.update(o), this.oHash = e.create();
-    for (let l = 0; l < o.length; l++)
-      o[l] ^= 106;
-    this.oHash.update(o), _e(o);
-  }
-  update(e) {
-    return ar(this), this.iHash.update(e), this;
-  }
-  digestInto(e) {
-    ar(this), $e(e, this.outputLen), this.finished = !0, this.iHash.digestInto(e), this.oHash.update(e), this.oHash.digestInto(e), this.destroy();
-  }
-  digest() {
-    const e = new Uint8Array(this.oHash.outputLen);
-    return this.digestInto(e), e;
-  }
-  _cloneInto(e) {
-    e || (e = Object.create(Object.getPrototypeOf(this), {}));
-    const { oHash: r, iHash: i, finished: a, destroyed: o, blockLen: l, outputLen: u } = this;
-    return e = e, e.finished = a, e.destroyed = o, e.blockLen = l, e.outputLen = u, e.oHash = r._cloneInto(e.oHash), e.iHash = i._cloneInto(e.iHash), e;
-  }
-  clone() {
-    return this._cloneInto();
-  }
-  destroy() {
-    this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
-  }
-}
-const ho = (t, e, r) => new co(t, e).update(r).digest();
-ho.create = (t, e) => new co(t, e);
-const In = /* @__PURE__ */ BigInt(0), an = /* @__PURE__ */ BigInt(1);
-function Ce(t) {
-  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
-}
-function Un(t) {
-  if (!Ce(t))
-    throw new Error("Uint8Array expected");
-}
-function ae(t, e) {
-  if (typeof e != "boolean")
-    throw new Error(t + " boolean expected, got " + e);
-}
-function Xe(t) {
-  const e = t.toString(16);
-  return e.length & 1 ? "0" + e : e;
-}
-function lo(t) {
-  if (typeof t != "string")
-    throw new Error("hex string expected, got " + typeof t);
-  return t === "" ? In : BigInt("0x" + t);
-}
-const uo = (
-  // @ts-ignore
-  typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function"
-), d0 = /* @__PURE__ */ Array.from({ length: 256 }, (t, e) => e.toString(16).padStart(2, "0"));
-function Me(t) {
-  if (Un(t), uo)
-    return t.toHex();
-  let e = "";
-  for (let r = 0; r < t.length; r++)
-    e += d0[t[r]];
-  return e;
-}
-const Qt = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
-function li(t) {
-  if (t >= Qt._0 && t <= Qt._9)
-    return t - Qt._0;
-  if (t >= Qt.A && t <= Qt.F)
-    return t - (Qt.A - 10);
-  if (t >= Qt.a && t <= Qt.f)
-    return t - (Qt.a - 10);
-}
-function cr(t) {
-  if (typeof t != "string")
-    throw new Error("hex string expected, got " + typeof t);
-  if (uo)
-    return Uint8Array.fromHex(t);
-  const e = t.length, r = e / 2;
-  if (e % 2)
-    throw new Error("hex string expected, got unpadded hex of length " + e);
-  const i = new Uint8Array(r);
-  for (let a = 0, o = 0; a < r; a++, o += 2) {
-    const l = li(t.charCodeAt(o)), u = li(t.charCodeAt(o + 1));
-    if (l === void 0 || u === void 0) {
-      const m = t[o] + t[o + 1];
-      throw new Error('hex string expected, got non-hex character "' + m + '" at index ' + o);
-    }
-    i[a] = l * 16 + u;
-  }
-  return i;
-}
-function ue(t) {
-  return lo(Me(t));
-}
-function Ne(t) {
-  return Un(t), lo(Me(Uint8Array.from(t).reverse()));
-}
-function De(t, e) {
-  return cr(t.toString(16).padStart(e * 2, "0"));
-}
-function hr(t, e) {
-  return De(t, e).reverse();
-}
-function st(t, e, r) {
-  let i;
-  if (typeof e == "string")
-    try {
-      i = cr(e);
-    } catch (o) {
-      throw new Error(t + " must be hex string or Uint8Array, cause: " + o);
-    }
-  else if (Ce(e))
-    i = Uint8Array.from(e);
-  else
-    throw new Error(t + " must be hex string or Uint8Array");
-  const a = i.length;
-  if (typeof r == "number" && a !== r)
-    throw new Error(t + " of length " + r + " expected, got " + a);
-  return i;
-}
-function Ae(...t) {
-  let e = 0;
-  for (let i = 0; i < t.length; i++) {
-    const a = t[i];
-    Un(a), e += a.length;
-  }
-  const r = new Uint8Array(e);
-  for (let i = 0, a = 0; i < t.length; i++) {
-    const o = t[i];
-    r.set(o, a), a += o.length;
-  }
-  return r;
-}
-const Vr = (t) => typeof t == "bigint" && In <= t;
-function kn(t, e, r) {
-  return Vr(t) && Vr(e) && Vr(r) && e <= t && t < r;
-}
-function Wt(t, e, r, i) {
-  if (!kn(e, r, i))
-    throw new Error("expected valid " + t + ": " + r + " <= n < " + i + ", got " + e);
-}
-function w0(t) {
-  let e;
-  for (e = 0; t > In; t >>= an, e += 1)
-    ;
-  return e;
-}
-const gr = (t) => (an << BigInt(t)) - an, zr = (t) => new Uint8Array(t), ui = (t) => Uint8Array.from(t);
-function g0(t, e, r) {
-  if (typeof t != "number" || t < 2)
-    throw new Error("hashLen must be a number");
-  if (typeof e != "number" || e < 2)
-    throw new Error("qByteLen must be a number");
-  if (typeof r != "function")
-    throw new Error("hmacFn must be a function");
-  let i = zr(t), a = zr(t), o = 0;
-  const l = () => {
-    i.fill(1), a.fill(0), o = 0;
-  }, u = (...E) => r(a, i, ...E), m = (E = zr(0)) => {
-    a = u(ui([0]), E), i = u(), E.length !== 0 && (a = u(ui([1]), E), i = u());
-  }, b = () => {
-    if (o++ >= 1e3)
-      throw new Error("drbg: tried 1000 values");
-    let E = 0;
-    const M = [];
-    for (; E < e; ) {
-      i = u();
-      const S = i.slice();
-      M.push(S), E += i.length;
-    }
-    return Ae(...M);
-  };
-  return (E, M) => {
-    l(), m(E);
-    let S;
-    for (; !(S = M(b())); )
-      m();
-    return l(), S;
-  };
-}
-const m0 = {
-  bigint: (t) => typeof t == "bigint",
-  function: (t) => typeof t == "function",
-  boolean: (t) => typeof t == "boolean",
-  string: (t) => typeof t == "string",
-  stringOrUint8Array: (t) => typeof t == "string" || Ce(t),
-  isSafeInteger: (t) => Number.isSafeInteger(t),
-  array: (t) => Array.isArray(t),
-  field: (t, e) => e.Fp.isValid(t),
-  hash: (t) => typeof t == "function" && Number.isSafeInteger(t.outputLen)
-};
-function Pe(t, e, r = {}) {
-  const i = (a, o, l) => {
-    const u = m0[o];
-    if (typeof u != "function")
-      throw new Error("invalid validator function");
-    const m = t[a];
-    if (!(l && m === void 0) && !u(m, t))
-      throw new Error("param " + String(a) + " is invalid. Expected " + o + ", got " + m);
-  };
-  for (const [a, o] of Object.entries(e))
-    i(a, o, !1);
-  for (const [a, o] of Object.entries(r))
-    i(a, o, !0);
-  return t;
-}
-function lr(t) {
-  const e = /* @__PURE__ */ new WeakMap();
-  return (r, ...i) => {
-    const a = e.get(r);
-    if (a !== void 0)
-      return a;
-    const o = t(r, ...i);
-    return e.set(r, o), o;
-  };
-}
-const Zt = BigInt(0), Ct = BigInt(1), le = /* @__PURE__ */ BigInt(2), p0 = /* @__PURE__ */ BigInt(3), wo = /* @__PURE__ */ BigInt(4), go = /* @__PURE__ */ BigInt(5), mo = /* @__PURE__ */ BigInt(8);
-function tt(t, e) {
-  const r = t % e;
-  return r >= Zt ? r : e + r;
-}
-function ot(t, e, r) {
-  let i = t;
-  for (; e-- > Zt; )
-    i *= i, i %= r;
-  return i;
-}
-function cn(t, e) {
-  if (t === Zt)
-    throw new Error("invert: expected non-zero number");
-  if (e <= Zt)
-    throw new Error("invert: expected positive modulus, got " + e);
-  let r = tt(t, e), i = e, a = Zt, o = Ct;
-  for (; r !== Zt; ) {
-    const u = i / r, m = i % r, b = a - o * u;
-    i = r, r = m, a = o, o = b;
-  }
-  if (i !== Ct)
-    throw new Error("invert: does not exist");
-  return tt(a, e);
-}
-function po(t, e) {
-  const r = (t.ORDER + Ct) / wo, i = t.pow(e, r);
-  if (!t.eql(t.sqr(i), e))
-    throw new Error("Cannot find square root");
-  return i;
-}
-function y0(t, e) {
-  const r = (t.ORDER - go) / mo, i = t.mul(e, le), a = t.pow(i, r), o = t.mul(e, a), l = t.mul(t.mul(o, le), a), u = t.mul(o, t.sub(l, t.ONE));
-  if (!t.eql(t.sqr(u), e))
-    throw new Error("Cannot find square root");
-  return u;
-}
-function x0(t) {
-  if (t < BigInt(3))
-    throw new Error("sqrt is not defined for small field");
-  let e = t - Ct, r = 0;
-  for (; e % le === Zt; )
-    e /= le, r++;
-  let i = le;
-  const a = Ze(t);
-  for (; di(a, i) === 1; )
-    if (i++ > 1e3)
-      throw new Error("Cannot find square root: probably non-prime P");
-  if (r === 1)
-    return po;
-  let o = a.pow(i, e);
-  const l = (e + Ct) / le;
-  return function(m, b) {
-    if (m.is0(b))
-      return b;
-    if (di(m, b) !== 1)
-      throw new Error("Cannot find square root");
-    let v = r, E = m.mul(m.ONE, o), M = m.pow(b, e), S = m.pow(b, l);
-    for (; !m.eql(M, m.ONE); ) {
-      if (m.is0(M))
-        return m.ZERO;
-      let O = 1, A = m.sqr(M);
-      for (; !m.eql(A, m.ONE); )
-        if (O++, A = m.sqr(A), O === v)
-          throw new Error("Cannot find square root");
-      const D = Ct << BigInt(v - O - 1), V = m.pow(E, D);
-      v = O, E = m.sqr(V), M = m.mul(M, E), S = m.mul(S, V);
-    }
-    return S;
-  };
-}
-function v0(t) {
-  return t % wo === p0 ? po : t % mo === go ? y0 : x0(t);
-}
-const b0 = (t, e) => (tt(t, e) & Ct) === Ct, E0 = [
-  "create",
-  "isValid",
-  "is0",
-  "neg",
-  "inv",
-  "sqrt",
-  "sqr",
-  "eql",
-  "add",
-  "sub",
-  "mul",
-  "pow",
-  "div",
-  "addN",
-  "subN",
-  "mulN",
-  "sqrN"
-];
-function _0(t) {
-  const e = {
-    ORDER: "bigint",
-    MASK: "bigint",
-    BYTES: "isSafeInteger",
-    BITS: "isSafeInteger"
-  }, r = E0.reduce((i, a) => (i[a] = "function", i), e);
-  return Pe(t, r);
-}
-function M0(t, e, r) {
-  if (r < Zt)
-    throw new Error("invalid exponent, negatives unsupported");
-  if (r === Zt)
-    return t.ONE;
-  if (r === Ct)
-    return e;
-  let i = t.ONE, a = e;
-  for (; r > Zt; )
-    r & Ct && (i = t.mul(i, a)), a = t.sqr(a), r >>= Ct;
-  return i;
-}
-function Nn(t, e, r = !1) {
-  const i = new Array(e.length).fill(r ? t.ZERO : void 0), a = e.reduce((l, u, m) => t.is0(u) ? l : (i[m] = l, t.mul(l, u)), t.ONE), o = t.inv(a);
-  return e.reduceRight((l, u, m) => t.is0(u) ? l : (i[m] = t.mul(l, i[m]), t.mul(l, u)), o), i;
-}
-function di(t, e) {
-  const r = (t.ORDER - Ct) / le, i = t.pow(e, r), a = t.eql(i, t.ONE), o = t.eql(i, t.ZERO), l = t.eql(i, t.neg(t.ONE));
-  if (!a && !o && !l)
-    throw new Error("invalid Legendre symbol result");
-  return a ? 1 : o ? 0 : -1;
-}
-function yo(t, e) {
-  e !== void 0 && fn(e);
-  const r = e !== void 0 ? e : t.toString(2).length, i = Math.ceil(r / 8);
-  return { nBitLength: r, nByteLength: i };
-}
-function Ze(t, e, r = !1, i = {}) {
-  if (t <= Zt)
-    throw new Error("invalid field: expected ORDER > 0, got " + t);
-  const { nBitLength: a, nByteLength: o } = yo(t, e);
-  if (o > 2048)
-    throw new Error("invalid field: expected ORDER of <= 2048 bytes");
-  let l;
-  const u = Object.freeze({
-    ORDER: t,
-    isLE: r,
-    BITS: a,
-    BYTES: o,
-    MASK: gr(a),
-    ZERO: Zt,
-    ONE: Ct,
-    create: (m) => tt(m, t),
-    isValid: (m) => {
-      if (typeof m != "bigint")
-        throw new Error("invalid field element: expected bigint, got " + typeof m);
-      return Zt <= m && m < t;
-    },
-    is0: (m) => m === Zt,
-    isOdd: (m) => (m & Ct) === Ct,
-    neg: (m) => tt(-m, t),
-    eql: (m, b) => m === b,
-    sqr: (m) => tt(m * m, t),
-    add: (m, b) => tt(m + b, t),
-    sub: (m, b) => tt(m - b, t),
-    mul: (m, b) => tt(m * b, t),
-    pow: (m, b) => M0(u, m, b),
-    div: (m, b) => tt(m * cn(b, t), t),
-    // Same as above, but doesn't normalize
-    sqrN: (m) => m * m,
-    addN: (m, b) => m + b,
-    subN: (m, b) => m - b,
-    mulN: (m, b) => m * b,
-    inv: (m) => cn(m, t),
-    sqrt: i.sqrt || ((m) => (l || (l = v0(t)), l(u, m))),
-    toBytes: (m) => r ? hr(m, o) : De(m, o),
-    fromBytes: (m) => {
-      if (m.length !== o)
-        throw new Error("Field.fromBytes: expected " + o + " bytes, got " + m.length);
-      return r ? Ne(m) : ue(m);
-    },
-    // TODO: we don't need it here, move out to separate fn
-    invertBatch: (m) => Nn(u, m),
-    // We can't move this out because Fp6, Fp12 implement it
-    // and it's unclear what to return in there.
-    cmov: (m, b, v) => v ? b : m
-  });
-  return Object.freeze(u);
-}
-function xo(t) {
-  if (typeof t != "bigint")
-    throw new Error("field order must be bigint");
-  const e = t.toString(2).length;
-  return Math.ceil(e / 8);
-}
-function vo(t) {
-  const e = xo(t);
-  return e + Math.ceil(e / 2);
-}
-function A0(t, e, r = !1) {
-  const i = t.length, a = xo(e), o = vo(e);
-  if (i < 16 || i < o || i > 1024)
-    throw new Error("expected " + o + "-1024 bytes of input, got " + i);
-  const l = r ? Ne(t) : ue(t), u = tt(l, e - Ct) + Ct;
-  return r ? hr(u, a) : De(u, a);
-}
-const wi = BigInt(0), hn = BigInt(1);
-function Gr(t, e) {
-  const r = e.negate();
-  return t ? r : e;
-}
-function bo(t, e) {
-  if (!Number.isSafeInteger(t) || t <= 0 || t > e)
-    throw new Error("invalid window size, expected [1.." + e + "], got W=" + t);
-}
-function Yr(t, e) {
-  bo(t, e);
-  const r = Math.ceil(e / t) + 1, i = 2 ** (t - 1), a = 2 ** t, o = gr(t), l = BigInt(t);
-  return { windows: r, windowSize: i, mask: o, maxNumber: a, shiftBy: l };
-}
-function gi(t, e, r) {
-  const { windowSize: i, mask: a, maxNumber: o, shiftBy: l } = r;
-  let u = Number(t & a), m = t >> l;
-  u > i && (u -= o, m += hn);
-  const b = e * i, v = b + Math.abs(u) - 1, E = u === 0, M = u < 0, S = e % 2 !== 0;
-  return { nextN: m, offset: v, isZero: E, isNeg: M, isNegF: S, offsetF: b };
-}
-function B0(t, e) {
-  if (!Array.isArray(t))
-    throw new Error("array expected");
-  t.forEach((r, i) => {
-    if (!(r instanceof e))
-      throw new Error("invalid point at index " + i);
-  });
-}
-function S0(t, e) {
-  if (!Array.isArray(t))
-    throw new Error("array of scalars expected");
-  t.forEach((r, i) => {
-    if (!e.isValid(r))
-      throw new Error("invalid scalar at index " + i);
-  });
-}
-const Wr = /* @__PURE__ */ new WeakMap(), Eo = /* @__PURE__ */ new WeakMap();
-function Xr(t) {
-  return Eo.get(t) || 1;
-}
-function _o(t, e) {
-  return {
-    constTimeNegate: Gr,
-    hasPrecomputes(r) {
-      return Xr(r) !== 1;
-    },
-    // non-const time multiplication ladder
-    unsafeLadder(r, i, a = t.ZERO) {
-      let o = r;
-      for (; i > wi; )
-        i & hn && (a = a.add(o)), o = o.double(), i >>= hn;
-      return a;
-    },
-    /**
-     * Creates a wNAF precomputation window. Used for caching.
-     * Default window size is set by `utils.precompute()` and is equal to 8.
-     * Number of precomputed points depends on the curve size:
-     * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:
-     * - 𝑊 is the window size
-     * - 𝑛 is the bitlength of the curve order.
-     * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.
-     * @param elm Point instance
-     * @param W window size
-     * @returns precomputed point tables flattened to a single array
-     */
-    precomputeWindow(r, i) {
-      const { windows: a, windowSize: o } = Yr(i, e), l = [];
-      let u = r, m = u;
-      for (let b = 0; b < a; b++) {
-        m = u, l.push(m);
-        for (let v = 1; v < o; v++)
-          m = m.add(u), l.push(m);
-        u = m.double();
-      }
-      return l;
-    },
-    /**
-     * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.
-     * @param W window size
-     * @param precomputes precomputed tables
-     * @param n scalar (we don't check here, but should be less than curve order)
-     * @returns real and fake (for const-time) points
-     */
-    wNAF(r, i, a) {
-      let o = t.ZERO, l = t.BASE;
-      const u = Yr(r, e);
-      for (let m = 0; m < u.windows; m++) {
-        const { nextN: b, offset: v, isZero: E, isNeg: M, isNegF: S, offsetF: O } = gi(a, m, u);
-        a = b, E ? l = l.add(Gr(S, i[O])) : o = o.add(Gr(M, i[v]));
-      }
-      return { p: o, f: l };
-    },
-    /**
-     * Implements ec unsafe (non const-time) multiplication using precomputed tables and w-ary non-adjacent form.
-     * @param W window size
-     * @param precomputes precomputed tables
-     * @param n scalar (we don't check here, but should be less than curve order)
-     * @param acc accumulator point to add result of multiplication
-     * @returns point
-     */
-    wNAFUnsafe(r, i, a, o = t.ZERO) {
-      const l = Yr(r, e);
-      for (let u = 0; u < l.windows && a !== wi; u++) {
-        const { nextN: m, offset: b, isZero: v, isNeg: E } = gi(a, u, l);
-        if (a = m, !v) {
-          const M = i[b];
-          o = o.add(E ? M.negate() : M);
-        }
-      }
-      return o;
-    },
-    getPrecomputes(r, i, a) {
-      let o = Wr.get(i);
-      return o || (o = this.precomputeWindow(i, r), r !== 1 && Wr.set(i, a(o))), o;
-    },
-    wNAFCached(r, i, a) {
-      const o = Xr(r);
-      return this.wNAF(o, this.getPrecomputes(o, r, a), i);
-    },
-    wNAFCachedUnsafe(r, i, a, o) {
-      const l = Xr(r);
-      return l === 1 ? this.unsafeLadder(r, i, o) : this.wNAFUnsafe(l, this.getPrecomputes(l, r, a), i, o);
-    },
-    // We calculate precomputes for elliptic curve point multiplication
-    // using windowed method. This specifies window size and
-    // stores precomputed values. Usually only base point would be precomputed.
-    setWindowSize(r, i) {
-      bo(i, e), Eo.set(r, i), Wr.delete(r);
-    }
-  };
-}
-function Mo(t, e, r, i) {
-  B0(r, t), S0(i, e);
-  const a = r.length, o = i.length;
-  if (a !== o)
-    throw new Error("arrays of points and scalars must have equal length");
-  const l = t.ZERO, u = w0(BigInt(a));
-  let m = 1;
-  u > 12 ? m = u - 3 : u > 4 ? m = u - 2 : u > 0 && (m = 2);
-  const b = gr(m), v = new Array(Number(b) + 1).fill(l), E = Math.floor((e.BITS - 1) / m) * m;
-  let M = l;
-  for (let S = E; S >= 0; S -= m) {
-    v.fill(l);
-    for (let A = 0; A < o; A++) {
-      const D = i[A], V = Number(D >> BigInt(S) & b);
-      v[V] = v[V].add(r[A]);
-    }
-    let O = l;
-    for (let A = v.length - 1, D = l; A > 0; A--)
-      D = D.add(v[A]), O = O.add(D);
-    if (M = M.add(O), S !== 0)
-      for (let A = 0; A < m; A++)
-        M = M.double();
-  }
-  return M;
-}
-function Rn(t) {
-  return _0(t.Fp), Pe(t, {
-    n: "bigint",
-    h: "bigint",
-    Gx: "field",
-    Gy: "field"
-  }, {
-    nBitLength: "isSafeInteger",
-    nByteLength: "isSafeInteger"
-  }), Object.freeze({
-    ...yo(t.n, t.nBitLength),
-    ...t,
-    p: t.Fp.ORDER
-  });
-}
-function mi(t) {
-  t.lowS !== void 0 && ae("lowS", t.lowS), t.prehash !== void 0 && ae("prehash", t.prehash);
-}
-function I0(t) {
-  const e = Rn(t);
-  Pe(e, {
-    a: "field",
-    b: "field"
-  }, {
-    allowInfinityPoint: "boolean",
-    allowedPrivateKeyLengths: "array",
-    clearCofactor: "function",
-    fromBytes: "function",
-    isTorsionFree: "function",
-    toBytes: "function",
-    wrapPrivateKey: "boolean"
-  });
-  const { endo: r, Fp: i, a } = e;
-  if (r) {
-    if (!i.eql(a, i.ZERO))
-      throw new Error("invalid endo: CURVE.a must be 0");
-    if (typeof r != "object" || typeof r.beta != "bigint" || typeof r.splitScalar != "function")
-      throw new Error('invalid endo: expected "beta": bigint and "splitScalar": function');
-  }
-  return Object.freeze({ ...e });
-}
-class U0 extends Error {
-  constructor(e = "") {
-    super(e);
-  }
-}
-const te = {
-  // asn.1 DER encoding utils
-  Err: U0,
-  // Basic building block is TLV (Tag-Length-Value)
-  _tlv: {
-    encode: (t, e) => {
-      const { Err: r } = te;
-      if (t < 0 || t > 256)
-        throw new r("tlv.encode: wrong tag");
-      if (e.length & 1)
-        throw new r("tlv.encode: unpadded data");
-      const i = e.length / 2, a = Xe(i);
-      if (a.length / 2 & 128)
-        throw new r("tlv.encode: long form length too big");
-      const o = i > 127 ? Xe(a.length / 2 | 128) : "";
-      return Xe(t) + o + a + e;
-    },
-    // v - value, l - left bytes (unparsed)
-    decode(t, e) {
-      const { Err: r } = te;
-      let i = 0;
-      if (t < 0 || t > 256)
-        throw new r("tlv.encode: wrong tag");
-      if (e.length < 2 || e[i++] !== t)
-        throw new r("tlv.decode: wrong tlv");
-      const a = e[i++], o = !!(a & 128);
-      let l = 0;
-      if (!o)
-        l = a;
-      else {
-        const m = a & 127;
-        if (!m)
-          throw new r("tlv.decode(long): indefinite length not supported");
-        if (m > 4)
-          throw new r("tlv.decode(long): byte length is too big");
-        const b = e.subarray(i, i + m);
-        if (b.length !== m)
-          throw new r("tlv.decode: length bytes not complete");
-        if (b[0] === 0)
-          throw new r("tlv.decode(long): zero leftmost byte");
-        for (const v of b)
-          l = l << 8 | v;
-        if (i += m, l < 128)
-          throw new r("tlv.decode(long): not minimal encoding");
-      }
-      const u = e.subarray(i, i + l);
-      if (u.length !== l)
-        throw new r("tlv.decode: wrong value length");
-      return { v: u, l: e.subarray(i + l) };
-    }
-  },
-  // https://crypto.stackexchange.com/a/57734 Leftmost bit of first byte is 'negative' flag,
-  // since we always use positive integers here. It must always be empty:
-  // - add zero byte if exists
-  // - if next byte doesn't have a flag, leading zero is not allowed (minimal encoding)
-  _int: {
-    encode(t) {
-      const { Err: e } = te;
-      if (t < ee)
-        throw new e("integer: negative integers are not allowed");
-      let r = Xe(t);
-      if (Number.parseInt(r[0], 16) & 8 && (r = "00" + r), r.length & 1)
-        throw new e("unexpected DER parsing assertion: unpadded hex");
-      return r;
-    },
-    decode(t) {
-      const { Err: e } = te;
-      if (t[0] & 128)
-        throw new e("invalid signature integer: negative");
-      if (t[0] === 0 && !(t[1] & 128))
-        throw new e("invalid signature integer: unnecessary leading zero");
-      return ue(t);
-    }
-  },
-  toSig(t) {
-    const { Err: e, _int: r, _tlv: i } = te, a = st("signature", t), { v: o, l } = i.decode(48, a);
-    if (l.length)
-      throw new e("invalid signature: left bytes after parsing");
-    const { v: u, l: m } = i.decode(2, o), { v: b, l: v } = i.decode(2, m);
-    if (v.length)
-      throw new e("invalid signature: left bytes after parsing");
-    return { r: r.decode(u), s: r.decode(b) };
-  },
-  hexFromSig(t) {
-    const { _tlv: e, _int: r } = te, i = e.encode(2, r.encode(t.r)), a = e.encode(2, r.encode(t.s)), o = i + a;
-    return e.encode(48, o);
-  }
-};
-function Kr(t, e) {
-  return Me(De(t, e));
-}
-const ee = BigInt(0), qt = BigInt(1), kc = BigInt(2), jr = BigInt(3), k0 = BigInt(4);
-function N0(t) {
-  const e = I0(t), { Fp: r } = e, i = Ze(e.n, e.nBitLength), a = e.toBytes || ((R, _, B) => {
-    const L = _.toAffine();
-    return Ae(Uint8Array.from([4]), r.toBytes(L.x), r.toBytes(L.y));
-  }), o = e.fromBytes || ((R) => {
-    const _ = R.subarray(1), B = r.fromBytes(_.subarray(0, r.BYTES)), L = r.fromBytes(_.subarray(r.BYTES, 2 * r.BYTES));
-    return { x: B, y: L };
-  });
-  function l(R) {
-    const { a: _, b: B } = e, L = r.sqr(R), T = r.mul(L, R);
-    return r.add(r.add(T, r.mul(R, _)), B);
-  }
-  function u(R, _) {
-    const B = r.sqr(_), L = l(R);
-    return r.eql(B, L);
-  }
-  if (!u(e.Gx, e.Gy))
-    throw new Error("bad curve params: generator point");
-  const m = r.mul(r.pow(e.a, jr), k0), b = r.mul(r.sqr(e.b), BigInt(27));
-  if (r.is0(r.add(m, b)))
-    throw new Error("bad curve params: a or b");
-  function v(R) {
-    return kn(R, qt, e.n);
-  }
-  function E(R) {
-    const { allowedPrivateKeyLengths: _, nByteLength: B, wrapPrivateKey: L, n: T } = e;
-    if (_ && typeof R != "bigint") {
-      if (Ce(R) && (R = Me(R)), typeof R != "string" || !_.includes(R.length))
-        throw new Error("invalid private key");
-      R = R.padStart(B * 2, "0");
-    }
-    let q;
-    try {
-      q = typeof R == "bigint" ? R : ue(st("private key", R, B));
-    } catch {
-      throw new Error("invalid private key, expected hex or " + B + " bytes, got " + typeof R);
-    }
-    return L && (q = tt(q, T)), Wt("private key", q, qt, T), q;
-  }
-  function M(R) {
-    if (!(R instanceof A))
-      throw new Error("ProjectivePoint expected");
-  }
-  const S = lr((R, _) => {
-    const { px: B, py: L, pz: T } = R;
-    if (r.eql(T, r.ONE))
-      return { x: B, y: L };
-    const q = R.is0();
-    _ == null && (_ = q ? r.ONE : r.inv(T));
-    const $ = r.mul(B, _), C = r.mul(L, _), U = r.mul(T, _);
-    if (q)
-      return { x: r.ZERO, y: r.ZERO };
-    if (!r.eql(U, r.ONE))
-      throw new Error("invZ was invalid");
-    return { x: $, y: C };
-  }), O = lr((R) => {
-    if (R.is0()) {
-      if (e.allowInfinityPoint && !r.is0(R.py))
-        return;
-      throw new Error("bad point: ZERO");
-    }
-    const { x: _, y: B } = R.toAffine();
-    if (!r.isValid(_) || !r.isValid(B))
-      throw new Error("bad point: x or y not FE");
-    if (!u(_, B))
-      throw new Error("bad point: equation left != right");
-    if (!R.isTorsionFree())
-      throw new Error("bad point: not in prime-order subgroup");
-    return !0;
-  });
-  class A {
-    constructor(_, B, L) {
-      if (_ == null || !r.isValid(_))
-        throw new Error("x required");
-      if (B == null || !r.isValid(B) || r.is0(B))
-        throw new Error("y required");
-      if (L == null || !r.isValid(L))
-        throw new Error("z required");
-      this.px = _, this.py = B, this.pz = L, Object.freeze(this);
-    }
-    // Does not validate if the point is on-curve.
-    // Use fromHex instead, or call assertValidity() later.
-    static fromAffine(_) {
-      const { x: B, y: L } = _ || {};
-      if (!_ || !r.isValid(B) || !r.isValid(L))
-        throw new Error("invalid affine point");
-      if (_ instanceof A)
-        throw new Error("projective point not allowed");
-      const T = (q) => r.eql(q, r.ZERO);
-      return T(B) && T(L) ? A.ZERO : new A(B, L, r.ONE);
-    }
-    get x() {
-      return this.toAffine().x;
-    }
-    get y() {
-      return this.toAffine().y;
-    }
-    /**
-     * Takes a bunch of Projective Points but executes only one
-     * inversion on all of them. Inversion is very slow operation,
-     * so this improves performance massively.
-     * Optimization: converts a list of projective points to a list of identical points with Z=1.
-     */
-    static normalizeZ(_) {
-      const B = Nn(r, _.map((L) => L.pz));
-      return _.map((L, T) => L.toAffine(B[T])).map(A.fromAffine);
-    }
-    /**
-     * Converts hash string or Uint8Array to Point.
-     * @param hex short/long ECDSA hex
-     */
-    static fromHex(_) {
-      const B = A.fromAffine(o(st("pointHex", _)));
-      return B.assertValidity(), B;
-    }
-    // Multiplies generator point by privateKey.
-    static fromPrivateKey(_) {
-      return A.BASE.multiply(E(_));
-    }
-    // Multiscalar Multiplication
-    static msm(_, B) {
-      return Mo(A, i, _, B);
-    }
-    // "Private method", don't use it directly
-    _setWindowSize(_) {
-      Q.setWindowSize(this, _);
-    }
-    // A point on curve is valid if it conforms to equation.
-    assertValidity() {
-      O(this);
-    }
-    hasEvenY() {
-      const { y: _ } = this.toAffine();
-      if (r.isOdd)
-        return !r.isOdd(_);
-      throw new Error("Field doesn't support isOdd");
-    }
-    /**
-     * Compare one point to another.
-     */
-    equals(_) {
-      M(_);
-      const { px: B, py: L, pz: T } = this, { px: q, py: $, pz: C } = _, U = r.eql(r.mul(B, C), r.mul(q, T)), H = r.eql(r.mul(L, C), r.mul($, T));
-      return U && H;
-    }
-    /**
-     * Flips point to one corresponding to (x, -y) in Affine coordinates.
-     */
-    negate() {
-      return new A(this.px, r.neg(this.py), this.pz);
-    }
-    // Renes-Costello-Batina exception-free doubling formula.
-    // There is 30% faster Jacobian formula, but it is not complete.
-    // https://eprint.iacr.org/2015/1060, algorithm 3
-    // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
-    double() {
-      const { a: _, b: B } = e, L = r.mul(B, jr), { px: T, py: q, pz: $ } = this;
-      let C = r.ZERO, U = r.ZERO, H = r.ZERO, y = r.mul(T, T), n = r.mul(q, q), f = r.mul($, $), c = r.mul(T, q);
-      return c = r.add(c, c), H = r.mul(T, $), H = r.add(H, H), C = r.mul(_, H), U = r.mul(L, f), U = r.add(C, U), C = r.sub(n, U), U = r.add(n, U), U = r.mul(C, U), C = r.mul(c, C), H = r.mul(L, H), f = r.mul(_, f), c = r.sub(y, f), c = r.mul(_, c), c = r.add(c, H), H = r.add(y, y), y = r.add(H, y), y = r.add(y, f), y = r.mul(y, c), U = r.add(U, y), f = r.mul(q, $), f = r.add(f, f), y = r.mul(f, c), C = r.sub(C, y), H = r.mul(f, n), H = r.add(H, H), H = r.add(H, H), new A(C, U, H);
-    }
-    // Renes-Costello-Batina exception-free addition formula.
-    // There is 30% faster Jacobian formula, but it is not complete.
-    // https://eprint.iacr.org/2015/1060, algorithm 1
-    // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
-    add(_) {
-      M(_);
-      const { px: B, py: L, pz: T } = this, { px: q, py: $, pz: C } = _;
-      let U = r.ZERO, H = r.ZERO, y = r.ZERO;
-      const n = e.a, f = r.mul(e.b, jr);
-      let c = r.mul(B, q), g = r.mul(L, $), d = r.mul(T, C), w = r.add(B, L), x = r.add(q, $);
-      w = r.mul(w, x), x = r.add(c, g), w = r.sub(w, x), x = r.add(B, T);
-      let h = r.add(q, C);
-      return x = r.mul(x, h), h = r.add(c, d), x = r.sub(x, h), h = r.add(L, T), U = r.add($, C), h = r.mul(h, U), U = r.add(g, d), h = r.sub(h, U), y = r.mul(n, x), U = r.mul(f, d), y = r.add(U, y), U = r.sub(g, y), y = r.add(g, y), H = r.mul(U, y), g = r.add(c, c), g = r.add(g, c), d = r.mul(n, d), x = r.mul(f, x), g = r.add(g, d), d = r.sub(c, d), d = r.mul(n, d), x = r.add(x, d), c = r.mul(g, x), H = r.add(H, c), c = r.mul(h, x), U = r.mul(w, U), U = r.sub(U, c), c = r.mul(w, g), y = r.mul(h, y), y = r.add(y, c), new A(U, H, y);
-    }
-    subtract(_) {
-      return this.add(_.negate());
-    }
-    is0() {
-      return this.equals(A.ZERO);
-    }
-    wNAF(_) {
-      return Q.wNAFCached(this, _, A.normalizeZ);
-    }
-    /**
-     * Non-constant-time multiplication. Uses double-and-add algorithm.
-     * It's faster, but should only be used when you don't care about
-     * an exposed private key e.g. sig verification, which works over *public* keys.
-     */
-    multiplyUnsafe(_) {
-      const { endo: B, n: L } = e;
-      Wt("scalar", _, ee, L);
-      const T = A.ZERO;
-      if (_ === ee)
-        return T;
-      if (this.is0() || _ === qt)
-        return this;
-      if (!B || Q.hasPrecomputes(this))
-        return Q.wNAFCachedUnsafe(this, _, A.normalizeZ);
-      let { k1neg: q, k1: $, k2neg: C, k2: U } = B.splitScalar(_), H = T, y = T, n = this;
-      for (; $ > ee || U > ee; )
-        $ & qt && (H = H.add(n)), U & qt && (y = y.add(n)), n = n.double(), $ >>= qt, U >>= qt;
-      return q && (H = H.negate()), C && (y = y.negate()), y = new A(r.mul(y.px, B.beta), y.py, y.pz), H.add(y);
-    }
-    /**
-     * Constant time multiplication.
-     * Uses wNAF method. Windowed method may be 10% faster,
-     * but takes 2x longer to generate and consumes 2x memory.
-     * Uses precomputes when available.
-     * Uses endomorphism for Koblitz curves.
-     * @param scalar by which the point would be multiplied
-     * @returns New point
-     */
-    multiply(_) {
-      const { endo: B, n: L } = e;
-      Wt("scalar", _, qt, L);
-      let T, q;
-      if (B) {
-        const { k1neg: $, k1: C, k2neg: U, k2: H } = B.splitScalar(_);
-        let { p: y, f: n } = this.wNAF(C), { p: f, f: c } = this.wNAF(H);
-        y = Q.constTimeNegate($, y), f = Q.constTimeNegate(U, f), f = new A(r.mul(f.px, B.beta), f.py, f.pz), T = y.add(f), q = n.add(c);
-      } else {
-        const { p: $, f: C } = this.wNAF(_);
-        T = $, q = C;
-      }
-      return A.normalizeZ([T, q])[0];
-    }
-    /**
-     * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.
-     * Not using Strauss-Shamir trick: precomputation tables are faster.
-     * The trick could be useful if both P and Q are not G (not in our case).
-     * @returns non-zero affine point
-     */
-    multiplyAndAddUnsafe(_, B, L) {
-      const T = A.BASE, q = (C, U) => U === ee || U === qt || !C.equals(T) ? C.multiplyUnsafe(U) : C.multiply(U), $ = q(this, B).add(q(_, L));
-      return $.is0() ? void 0 : $;
-    }
-    // Converts Projective point to affine (x, y) coordinates.
-    // Can accept precomputed Z^-1 - for example, from invertBatch.
-    // (x, y, z) ∋ (x=x/z, y=y/z)
-    toAffine(_) {
-      return S(this, _);
-    }
-    isTorsionFree() {
-      const { h: _, isTorsionFree: B } = e;
-      if (_ === qt)
-        return !0;
-      if (B)
-        return B(A, this);
-      throw new Error("isTorsionFree() has not been declared for the elliptic curve");
-    }
-    clearCofactor() {
-      const { h: _, clearCofactor: B } = e;
-      return _ === qt ? this : B ? B(A, this) : this.multiplyUnsafe(e.h);
-    }
-    toRawBytes(_ = !0) {
-      return ae("isCompressed", _), this.assertValidity(), a(A, this, _);
-    }
-    toHex(_ = !0) {
-      return ae("isCompressed", _), Me(this.toRawBytes(_));
-    }
-  }
-  A.BASE = new A(e.Gx, e.Gy, r.ONE), A.ZERO = new A(r.ZERO, r.ONE, r.ZERO);
-  const { endo: D, nBitLength: V } = e, Q = _o(A, D ? Math.ceil(V / 2) : V);
-  return {
-    CURVE: e,
-    ProjectivePoint: A,
-    normPrivateKeyToScalar: E,
-    weierstrassEquation: l,
-    isWithinCurveOrder: v
-  };
-}
-function R0(t) {
-  const e = Rn(t);
-  return Pe(e, {
-    hash: "hash",
-    hmac: "function",
-    randomBytes: "function"
-  }, {
-    bits2int: "function",
-    bits2int_modN: "function",
-    lowS: "boolean"
-  }), Object.freeze({ lowS: !0, ...e });
-}
-function L0(t) {
-  const e = R0(t), { Fp: r, n: i, nByteLength: a, nBitLength: o } = e, l = r.BYTES + 1, u = 2 * r.BYTES + 1;
-  function m(f) {
-    return tt(f, i);
-  }
-  function b(f) {
-    return cn(f, i);
-  }
-  const { ProjectivePoint: v, normPrivateKeyToScalar: E, weierstrassEquation: M, isWithinCurveOrder: S } = N0({
-    ...e,
-    toBytes(f, c, g) {
-      const d = c.toAffine(), w = r.toBytes(d.x), x = Ae;
-      return ae("isCompressed", g), g ? x(Uint8Array.from([c.hasEvenY() ? 2 : 3]), w) : x(Uint8Array.from([4]), w, r.toBytes(d.y));
-    },
-    fromBytes(f) {
-      const c = f.length, g = f[0], d = f.subarray(1);
-      if (c === l && (g === 2 || g === 3)) {
-        const w = ue(d);
-        if (!kn(w, qt, r.ORDER))
-          throw new Error("Point is not on curve");
-        const x = M(w);
-        let h;
-        try {
-          h = r.sqrt(x);
-        } catch (k) {
-          const I = k instanceof Error ? ": " + k.message : "";
-          throw new Error("Point is not on curve" + I);
-        }
-        const s = (h & qt) === qt;
-        return (g & 1) === 1 !== s && (h = r.neg(h)), { x: w, y: h };
-      } else if (c === u && g === 4) {
-        const w = r.fromBytes(d.subarray(0, r.BYTES)), x = r.fromBytes(d.subarray(r.BYTES, 2 * r.BYTES));
-        return { x: w, y: x };
-      } else {
-        const w = l, x = u;
-        throw new Error("invalid Point, expected length of " + w + ", or uncompressed " + x + ", got " + c);
-      }
-    }
-  });
-  function O(f) {
-    const c = i >> qt;
-    return f > c;
-  }
-  function A(f) {
-    return O(f) ? m(-f) : f;
-  }
-  const D = (f, c, g) => ue(f.slice(c, g));
-  class V {
-    constructor(c, g, d) {
-      Wt("r", c, qt, i), Wt("s", g, qt, i), this.r = c, this.s = g, d != null && (this.recovery = d), Object.freeze(this);
-    }
-    // pair (bytes of r, bytes of s)
-    static fromCompact(c) {
-      const g = a;
-      return c = st("compactSignature", c, g * 2), new V(D(c, 0, g), D(c, g, 2 * g));
-    }
-    // DER encoded ECDSA signature
-    // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script
-    static fromDER(c) {
-      const { r: g, s: d } = te.toSig(st("DER", c));
-      return new V(g, d);
-    }
-    /**
-     * @todo remove
-     * @deprecated
-     */
-    assertValidity() {
-    }
-    addRecoveryBit(c) {
-      return new V(this.r, this.s, c);
-    }
-    recoverPublicKey(c) {
-      const { r: g, s: d, recovery: w } = this, x = T(st("msgHash", c));
-      if (w == null || ![0, 1, 2, 3].includes(w))
-        throw new Error("recovery id invalid");
-      const h = w === 2 || w === 3 ? g + e.n : g;
-      if (h >= r.ORDER)
-        throw new Error("recovery id 2 or 3 invalid");
-      const s = (w & 1) === 0 ? "02" : "03", p = v.fromHex(s + Kr(h, r.BYTES)), k = b(h), I = m(-x * k), N = m(d * k), P = v.BASE.multiplyAndAddUnsafe(p, I, N);
-      if (!P)
-        throw new Error("point at infinify");
-      return P.assertValidity(), P;
-    }
-    // Signatures should be low-s, to prevent malleability.
-    hasHighS() {
-      return O(this.s);
-    }
-    normalizeS() {
-      return this.hasHighS() ? new V(this.r, m(-this.s), this.recovery) : this;
-    }
-    // DER-encoded
-    toDERRawBytes() {
-      return cr(this.toDERHex());
-    }
-    toDERHex() {
-      return te.hexFromSig(this);
-    }
-    // padded bytes of r, then padded bytes of s
-    toCompactRawBytes() {
-      return cr(this.toCompactHex());
-    }
-    toCompactHex() {
-      const c = a;
-      return Kr(this.r, c) + Kr(this.s, c);
-    }
-  }
-  const Q = {
-    isValidPrivateKey(f) {
-      try {
-        return E(f), !0;
-      } catch {
-        return !1;
-      }
-    },
-    normPrivateKeyToScalar: E,
-    /**
-     * Produces cryptographically secure private key from random of size
-     * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.
-     */
-    randomPrivateKey: () => {
-      const f = vo(e.n);
-      return A0(e.randomBytes(f), e.n);
-    },
-    /**
-     * Creates precompute table for an arbitrary EC point. Makes point "cached".
-     * Allows to massively speed-up `point.multiply(scalar)`.
-     * @returns cached point
-     * @example
-     * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey));
-     * fast.multiply(privKey); // much faster ECDH now
-     */
-    precompute(f = 8, c = v.BASE) {
-      return c._setWindowSize(f), c.multiply(BigInt(3)), c;
-    }
-  };
-  function R(f, c = !0) {
-    return v.fromPrivateKey(f).toRawBytes(c);
-  }
-  function _(f) {
-    if (typeof f == "bigint")
-      return !1;
-    if (f instanceof v)
-      return !0;
-    const g = st("key", f).length, d = r.BYTES, w = d + 1, x = 2 * d + 1;
-    if (!(e.allowedPrivateKeyLengths || a === w))
-      return g === w || g === x;
-  }
-  function B(f, c, g = !0) {
-    if (_(f) === !0)
-      throw new Error("first arg must be private key");
-    if (_(c) === !1)
-      throw new Error("second arg must be public key");
-    return v.fromHex(c).multiply(E(f)).toRawBytes(g);
-  }
-  const L = e.bits2int || function(f) {
-    if (f.length > 8192)
-      throw new Error("input is too large");
-    const c = ue(f), g = f.length * 8 - o;
-    return g > 0 ? c >> BigInt(g) : c;
-  }, T = e.bits2int_modN || function(f) {
-    return m(L(f));
-  }, q = gr(o);
-  function $(f) {
-    return Wt("num < 2^" + o, f, ee, q), De(f, a);
-  }
-  function C(f, c, g = U) {
-    if (["recovered", "canonical"].some((z) => z in g))
-      throw new Error("sign() legacy options not supported");
-    const { hash: d, randomBytes: w } = e;
-    let { lowS: x, prehash: h, extraEntropy: s } = g;
-    x == null && (x = !0), f = st("msgHash", f), mi(g), h && (f = st("prehashed msgHash", d(f)));
-    const p = T(f), k = E(c), I = [$(k), $(p)];
-    if (s != null && s !== !1) {
-      const z = s === !0 ? w(r.BYTES) : s;
-      I.push(st("extraEntropy", z));
-    }
-    const N = Ae(...I), P = p;
-    function Z(z) {
-      const ft = L(z);
-      if (!S(ft))
-        return;
-      const W = b(ft), Y = v.BASE.multiply(ft).toAffine(), Ht = m(Y.x);
-      if (Ht === ee)
-        return;
-      const K = m(W * m(P + Ht * k));
-      if (K === ee)
-        return;
-      let J = (Y.x === Ht ? 0 : 2) | Number(Y.y & qt), Yt = K;
-      return x && O(K) && (Yt = A(K), J ^= 1), new V(Ht, Yt, J);
-    }
-    return { seed: N, k2sig: Z };
-  }
-  const U = { lowS: e.lowS, prehash: !1 }, H = { lowS: e.lowS, prehash: !1 };
-  function y(f, c, g = U) {
-    const { seed: d, k2sig: w } = C(f, c, g), x = e;
-    return g0(x.hash.outputLen, x.nByteLength, x.hmac)(d, w);
-  }
-  v.BASE._setWindowSize(8);
-  function n(f, c, g, d = H) {
-    var J;
-    const w = f;
-    c = st("msgHash", c), g = st("publicKey", g);
-    const { lowS: x, prehash: h, format: s } = d;
-    if (mi(d), "strict" in d)
-      throw new Error("options.strict was renamed to lowS");
-    if (s !== void 0 && s !== "compact" && s !== "der")
-      throw new Error("format must be compact or der");
-    const p = typeof w == "string" || Ce(w), k = !p && !s && typeof w == "object" && w !== null && typeof w.r == "bigint" && typeof w.s == "bigint";
-    if (!p && !k)
-      throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");
-    let I, N;
-    try {
-      if (k && (I = new V(w.r, w.s)), p) {
-        try {
-          s !== "compact" && (I = V.fromDER(w));
-        } catch (Yt) {
-          if (!(Yt instanceof te.Err))
-            throw Yt;
-        }
-        !I && s !== "der" && (I = V.fromCompact(w));
-      }
-      N = v.fromHex(g);
-    } catch {
-      return !1;
-    }
-    if (!I || x && I.hasHighS())
-      return !1;
-    h && (c = e.hash(c));
-    const { r: P, s: Z } = I, z = T(c), ft = b(Z), W = m(z * ft), Y = m(P * ft), Ht = (J = v.BASE.multiplyAndAddUnsafe(N, W, Y)) == null ? void 0 : J.toAffine();
-    return Ht ? m(Ht.x) === P : !1;
-  }
-  return {
-    CURVE: e,
-    getPublicKey: R,
-    getSharedSecret: B,
-    sign: y,
-    verify: n,
-    ProjectivePoint: v,
-    Signature: V,
-    utils: Q
-  };
-}
-function O0(t) {
-  return {
-    hash: t,
-    hmac: (e, ...r) => ho(t, e, Xf(...r)),
-    randomBytes: so
-  };
-}
-function T0(t, e) {
-  const r = (i) => L0({ ...t, ...O0(i) });
-  return { ...r(e), create: r };
-}
-const Ao = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), pi = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), H0 = BigInt(0), q0 = BigInt(1), ln = BigInt(2), yi = (t, e) => (t + e / ln) / e;
-function $0(t) {
-  const e = Ao, r = BigInt(3), i = BigInt(6), a = BigInt(11), o = BigInt(22), l = BigInt(23), u = BigInt(44), m = BigInt(88), b = t * t * t % e, v = b * b * t % e, E = ot(v, r, e) * v % e, M = ot(E, r, e) * v % e, S = ot(M, ln, e) * b % e, O = ot(S, a, e) * S % e, A = ot(O, o, e) * O % e, D = ot(A, u, e) * A % e, V = ot(D, m, e) * D % e, Q = ot(V, u, e) * A % e, R = ot(Q, r, e) * v % e, _ = ot(R, l, e) * O % e, B = ot(_, i, e) * b % e, L = ot(B, ln, e);
-  if (!un.eql(un.sqr(L), t))
-    throw new Error("Cannot find square root");
-  return L;
-}
-const un = Ze(Ao, void 0, void 0, { sqrt: $0 }), Ve = T0({
-  a: H0,
-  b: BigInt(7),
-  Fp: un,
-  n: pi,
-  Gx: BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),
-  Gy: BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),
-  h: BigInt(1),
-  lowS: !0,
-  // Allow only low-S signatures by default in sign() and verify()
-  endo: {
-    // Endomorphism, see above
-    beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
-    splitScalar: (t) => {
-      const e = pi, r = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), i = -q0 * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), a = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), o = r, l = BigInt("0x100000000000000000000000000000000"), u = yi(o * t, e), m = yi(-i * t, e);
-      let b = tt(t - u * r - m * a, e), v = tt(-u * i - m * o, e);
-      const E = b > l, M = v > l;
-      if (E && (b = e - b), M && (v = e - v), b > l || v > l)
-        throw new Error("splitScalar: Endomorphism failed, k=" + t);
-      return { k1neg: E, k1: b, k2neg: M, k2: v };
-    }
-  }
-}, l0);
-function Be(t, e) {
-  if (t.length !== 32)
-    throw new Error("Expected valid 32-byte private key as a seed");
-  if (!Vt || !e && zt()) {
-    const r = as(t), i = r.slice(32);
-    if (zi(i))
-      throw new Error("Invalid publicKey generated from WASM interface");
-    return {
-      publicKey: i,
-      secretKey: r.slice(0, 32)
-    };
-  }
-  return {
-    publicKey: Ve.getPublicKey(t, !0),
-    secretKey: t
-  };
-}
-function Bo(t, e) {
-  return (r, { chainCode: i, isHard: a }) => {
-    if (!a)
-      throw new Error("A soft key was found in the path and is not supported");
-    return t(e(r.secretKey.subarray(0, 32), i));
-  };
-}
-const xi = /* @__PURE__ */ Bo(Be, Vf), C0 = _n(ce("Ed25519HDKD"));
-function D0(t, e) {
-  if (!de(e) || e.length !== 32)
-    throw new Error("Invalid chainCode passed to derive");
-  return we($t(C0, t, e));
-}
-const Kt = BigInt(0), Pt = BigInt(1), vi = BigInt(2), P0 = BigInt(8), Z0 = { zip215: !0 };
-function V0(t) {
-  const e = Rn(t);
-  return Pe(t, {
-    hash: "function",
-    a: "bigint",
-    d: "bigint",
-    randomBytes: "function"
-  }, {
-    adjustScalarBytes: "function",
-    domain: "function",
-    uvRatio: "function",
-    mapToCurve: "function"
-  }), Object.freeze({ ...e });
-}
-function z0(t) {
-  const e = V0(t), { Fp: r, n: i, prehash: a, hash: o, randomBytes: l, nByteLength: u, h: m } = e, b = vi << BigInt(u * 8) - Pt, v = r.create, E = Ze(e.n, e.nBitLength);
-  function M(d, w) {
-    const x = r.sqr(d), h = r.sqr(w), s = r.add(r.mul(e.a, x), h), p = r.add(r.ONE, r.mul(e.d, r.mul(x, h)));
-    return r.eql(s, p);
-  }
-  if (!M(e.Gx, e.Gy))
-    throw new Error("bad curve params: generator point");
-  const S = e.uvRatio || ((d, w) => {
-    try {
-      return { isValid: !0, value: r.sqrt(d * r.inv(w)) };
-    } catch {
-      return { isValid: !1, value: Kt };
-    }
-  }), O = e.adjustScalarBytes || ((d) => d), A = e.domain || ((d, w, x) => {
-    if (ae("phflag", x), w.length || x)
-      throw new Error("Contexts/pre-hash are not supported");
-    return d;
-  });
-  function D(d, w, x = !1) {
-    const h = x ? Pt : Kt;
-    Wt("coordinate " + d, w, h, b);
-  }
-  function V(d) {
-    if (!(d instanceof _))
-      throw new Error("ExtendedPoint expected");
-  }
-  const Q = lr((d, w) => {
-    const { ex: x, ey: h, ez: s } = d, p = d.is0();
-    w == null && (w = p ? P0 : r.inv(s));
-    const k = v(x * w), I = v(h * w), N = v(s * w);
-    if (p)
-      return { x: Kt, y: Pt };
-    if (N !== Pt)
-      throw new Error("invZ was invalid");
-    return { x: k, y: I };
-  }), R = lr((d) => {
-    const { a: w, d: x } = e;
-    if (d.is0())
-      throw new Error("bad point: ZERO");
-    const { ex: h, ey: s, ez: p, et: k } = d, I = v(h * h), N = v(s * s), P = v(p * p), Z = v(P * P), z = v(I * w), ft = v(P * v(z + N)), W = v(Z + v(x * v(I * N)));
-    if (ft !== W)
-      throw new Error("bad point: equation left != right (1)");
-    const Y = v(h * s), Ht = v(p * k);
-    if (Y !== Ht)
-      throw new Error("bad point: equation left != right (2)");
-    return !0;
-  });
-  class _ {
-    constructor(w, x, h, s) {
-      D("x", w), D("y", x), D("z", h, !0), D("t", s), this.ex = w, this.ey = x, this.ez = h, this.et = s, Object.freeze(this);
-    }
-    get x() {
-      return this.toAffine().x;
-    }
-    get y() {
-      return this.toAffine().y;
-    }
-    static fromAffine(w) {
-      if (w instanceof _)
-        throw new Error("extended point not allowed");
-      const { x, y: h } = w || {};
-      return D("x", x), D("y", h), new _(x, h, Pt, v(x * h));
-    }
-    static normalizeZ(w) {
-      const x = Nn(r, w.map((h) => h.ez));
-      return w.map((h, s) => h.toAffine(x[s])).map(_.fromAffine);
-    }
-    // Multiscalar Multiplication
-    static msm(w, x) {
-      return Mo(_, E, w, x);
-    }
-    // "Private method", don't use it directly
-    _setWindowSize(w) {
-      T.setWindowSize(this, w);
-    }
-    // Not required for fromHex(), which always creates valid points.
-    // Could be useful for fromAffine().
-    assertValidity() {
-      R(this);
-    }
-    // Compare one point to another.
-    equals(w) {
-      V(w);
-      const { ex: x, ey: h, ez: s } = this, { ex: p, ey: k, ez: I } = w, N = v(x * I), P = v(p * s), Z = v(h * I), z = v(k * s);
-      return N === P && Z === z;
-    }
-    is0() {
-      return this.equals(_.ZERO);
-    }
-    negate() {
-      return new _(v(-this.ex), this.ey, this.ez, v(-this.et));
-    }
-    // Fast algo for doubling Extended Point.
-    // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#doubling-dbl-2008-hwcd
-    // Cost: 4M + 4S + 1*a + 6add + 1*2.
-    double() {
-      const { a: w } = e, { ex: x, ey: h, ez: s } = this, p = v(x * x), k = v(h * h), I = v(vi * v(s * s)), N = v(w * p), P = x + h, Z = v(v(P * P) - p - k), z = N + k, ft = z - I, W = N - k, Y = v(Z * ft), Ht = v(z * W), K = v(Z * W), J = v(ft * z);
-      return new _(Y, Ht, J, K);
-    }
-    // Fast algo for adding 2 Extended Points.
-    // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#addition-add-2008-hwcd
-    // Cost: 9M + 1*a + 1*d + 7add.
-    add(w) {
-      V(w);
-      const { a: x, d: h } = e, { ex: s, ey: p, ez: k, et: I } = this, { ex: N, ey: P, ez: Z, et: z } = w, ft = v(s * N), W = v(p * P), Y = v(I * h * z), Ht = v(k * Z), K = v((s + p) * (N + P) - ft - W), J = Ht - Y, Yt = Ht + Y, et = v(W - x * ft), rt = v(K * J), ze = v(Yt * et), nt = v(K * et), it = v(J * Yt);
-      return new _(rt, ze, it, nt);
-    }
-    subtract(w) {
-      return this.add(w.negate());
-    }
-    wNAF(w) {
-      return T.wNAFCached(this, w, _.normalizeZ);
-    }
-    // Constant-time multiplication.
-    multiply(w) {
-      const x = w;
-      Wt("scalar", x, Pt, i);
-      const { p: h, f: s } = this.wNAF(x);
-      return _.normalizeZ([h, s])[0];
-    }
-    // Non-constant-time multiplication. Uses double-and-add algorithm.
-    // It's faster, but should only be used when you don't care about
-    // an exposed private key e.g. sig verification.
-    // Does NOT allow scalars higher than CURVE.n.
-    // Accepts optional accumulator to merge with multiply (important for sparse scalars)
-    multiplyUnsafe(w, x = _.ZERO) {
-      const h = w;
-      return Wt("scalar", h, Kt, i), h === Kt ? L : this.is0() || h === Pt ? this : T.wNAFCachedUnsafe(this, h, _.normalizeZ, x);
-    }
-    // Checks if point is of small order.
-    // If you add something to small order point, you will have "dirty"
-    // point with torsion component.
-    // Multiplies point by cofactor and checks if the result is 0.
-    isSmallOrder() {
-      return this.multiplyUnsafe(m).is0();
-    }
-    // Multiplies point by curve order and checks if the result is 0.
-    // Returns `false` is the point is dirty.
-    isTorsionFree() {
-      return T.unsafeLadder(this, i).is0();
-    }
-    // Converts Extended point to default (x, y) coordinates.
-    // Can accept precomputed Z^-1 - for example, from invertBatch.
-    toAffine(w) {
-      return Q(this, w);
-    }
-    clearCofactor() {
-      const { h: w } = e;
-      return w === Pt ? this : this.multiplyUnsafe(w);
-    }
-    // Converts hash string or Uint8Array to Point.
-    // Uses algo from RFC8032 5.1.3.
-    static fromHex(w, x = !1) {
-      const { d: h, a: s } = e, p = r.BYTES;
-      w = st("pointHex", w, p), ae("zip215", x);
-      const k = w.slice(), I = w[p - 1];
-      k[p - 1] = I & -129;
-      const N = Ne(k), P = x ? b : r.ORDER;
-      Wt("pointHex.y", N, Kt, P);
-      const Z = v(N * N), z = v(Z - Pt), ft = v(h * Z - s);
-      let { isValid: W, value: Y } = S(z, ft);
-      if (!W)
-        throw new Error("Point.fromHex: invalid y coordinate");
-      const Ht = (Y & Pt) === Pt, K = (I & 128) !== 0;
-      if (!x && Y === Kt && K)
-        throw new Error("Point.fromHex: x=0 and x_0=1");
-      return K !== Ht && (Y = v(-Y)), _.fromAffine({ x: Y, y: N });
-    }
-    static fromPrivateKey(w) {
-      const { scalar: x } = C(w);
-      return B.multiply(x);
-    }
-    toRawBytes() {
-      const { x: w, y: x } = this.toAffine(), h = hr(x, r.BYTES);
-      return h[h.length - 1] |= w & Pt ? 128 : 0, h;
-    }
-    toHex() {
-      return Me(this.toRawBytes());
-    }
-  }
-  _.BASE = new _(e.Gx, e.Gy, Pt, v(e.Gx * e.Gy)), _.ZERO = new _(Kt, Pt, Pt, Kt);
-  const { BASE: B, ZERO: L } = _, T = _o(_, u * 8);
-  function q(d) {
-    return tt(d, i);
-  }
-  function $(d) {
-    return q(Ne(d));
-  }
-  function C(d) {
-    const w = r.BYTES;
-    d = st("private key", d, w);
-    const x = st("hashed private key", o(d), 2 * w), h = O(x.slice(0, w)), s = x.slice(w, 2 * w), p = $(h);
-    return { head: h, prefix: s, scalar: p };
-  }
-  function U(d) {
-    const { head: w, prefix: x, scalar: h } = C(d), s = B.multiply(h), p = s.toRawBytes();
-    return { head: w, prefix: x, scalar: h, point: s, pointBytes: p };
-  }
-  function H(d) {
-    return U(d).pointBytes;
-  }
-  function y(d = Uint8Array.of(), ...w) {
-    const x = Ae(...w);
-    return $(o(A(x, st("context", d), !!a)));
-  }
-  function n(d, w, x = {}) {
-    d = st("message", d), a && (d = a(d));
-    const { prefix: h, scalar: s, pointBytes: p } = U(w), k = y(x.context, h, d), I = B.multiply(k).toRawBytes(), N = y(x.context, I, p, d), P = q(k + N * s);
-    Wt("signature.s", P, Kt, i);
-    const Z = Ae(I, hr(P, r.BYTES));
-    return st("result", Z, r.BYTES * 2);
-  }
-  const f = Z0;
-  function c(d, w, x, h = f) {
-    const { context: s, zip215: p } = h, k = r.BYTES;
-    d = st("signature", d, 2 * k), w = st("message", w), x = st("publicKey", x, k), p !== void 0 && ae("zip215", p), a && (w = a(w));
-    const I = Ne(d.slice(k, 2 * k));
-    let N, P, Z;
-    try {
-      N = _.fromHex(x, p), P = _.fromHex(d.slice(0, k), p), Z = B.multiplyUnsafe(I);
-    } catch {
-      return !1;
-    }
-    if (!p && N.isSmallOrder())
-      return !1;
-    const z = y(s, P.toRawBytes(), N.toRawBytes(), w);
-    return P.add(N.multiplyUnsafe(z)).subtract(Z).clearCofactor().equals(_.ZERO);
-  }
-  return B._setWindowSize(8), {
-    CURVE: e,
-    getPublicKey: H,
-    sign: n,
-    verify: c,
-    ExtendedPoint: _,
-    utils: {
-      getExtendedPublicKey: U,
-      /** ed25519 priv keys are uniform 32b. No need to check for modulo bias, like in secp256k1. */
-      randomPrivateKey: () => l(r.BYTES),
-      /**
-       * We're doing scalar multiplication (used in getPublicKey etc) with precomputed BASE_POINT
-       * values. This slows down first getPublicKey() by milliseconds (see Speed section),
-       * but allows to speed-up subsequent getPublicKey() calls up to 20x.
-       * @param windowSize 2, 4, 8, 16
-       */
-      precompute(d = 8, w = _.BASE) {
-        return w._setWindowSize(d), w.multiply(BigInt(3)), w;
-      }
-    }
-  };
-}
-const Nc = BigInt(0), Rc = BigInt(1), Lc = BigInt(2);
-const Ln = BigInt("57896044618658097711785492504343953926634992332820282019728792003956564819949"), bi = /* @__PURE__ */ BigInt("19681161376707505956807079304988542015446066515923890162744021073123829784752");
-BigInt(0);
-const G0 = BigInt(1), Ei = BigInt(2), Oc = BigInt(3), Y0 = BigInt(5), W0 = BigInt(8);
-function X0(t) {
-  const e = BigInt(10), r = BigInt(20), i = BigInt(40), a = BigInt(80), o = Ln, u = t * t % o * t % o, m = ot(u, Ei, o) * u % o, b = ot(m, G0, o) * t % o, v = ot(b, Y0, o) * b % o, E = ot(v, e, o) * v % o, M = ot(E, r, o) * E % o, S = ot(M, i, o) * M % o, O = ot(S, a, o) * S % o, A = ot(O, a, o) * S % o, D = ot(A, e, o) * v % o;
-  return { pow_p_5_8: ot(D, Ei, o) * t % o, b2: u };
-}
-function K0(t) {
-  return t[0] &= 248, t[31] &= 127, t[31] |= 64, t;
-}
-function j0(t, e) {
-  const r = Ln, i = tt(e * e * e, r), a = tt(i * i * e, r), o = X0(t * a).pow_p_5_8;
-  let l = tt(t * i * o, r);
-  const u = tt(e * l * l, r), m = l, b = tt(l * bi, r), v = u === t, E = u === tt(-t, r), M = u === tt(-t * bi, r);
-  return v && (l = m), (E || M) && (l = b), b0(l, r) && (l = tt(-l, r)), { isValid: v || E, value: l };
-}
-const _i = Ze(Ln, void 0, !0), J0 = {
-  // Removing Fp.create() will still work, and is 10% faster on sign
-  a: _i.create(BigInt(-1)),
-  // d is -121665/121666 a.k.a. Fp.neg(121665 * Fp.inv(121666))
-  d: BigInt("37095705934669439343138083508754565189542113879843219016388785533085940283555"),
-  // Finite field 2n**255n - 19n
-  Fp: _i,
-  // Subgroup order 2n**252n + 27742317777372353535851937790883648493n;
-  n: BigInt("7237005577332262213973186563042994240857116359379907606001950938285454250989"),
-  h: W0,
-  Gx: BigInt("15112221349535400772501151409588531511454012693041857206046113283949847762202"),
-  Gy: BigInt("46316835694926478169428394003475163141307993866256225615783033603165251855960"),
-  hash: u0,
-  randomBytes: so,
-  adjustScalarBytes: K0,
-  // 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: j0
-}, On = z0(J0);
-function Tn(t, e) {
-  if (!Vt || !e && zt()) {
-    const i = cs(t);
-    return {
-      publicKey: i.slice(32),
-      secretKey: i.slice(0, 64)
-    };
-  }
-  const r = On.getPublicKey(t);
-  return {
-    publicKey: r,
-    secretKey: He([t, r])
-  };
-}
-function F0(t, { publicKey: e, secretKey: r }, i) {
-  if (r) {
-    if (!e)
-      throw new Error("Expected a valid publicKey");
-  } else throw new Error("Expected a valid secretKey");
-  const a = G(t), o = r.subarray(0, 32);
-  return !Vt || !i && zt() ? hs(e, o, a) : On.sign(a, o);
-}
-function So(t, e, r, i) {
-  const a = G(t), o = G(r), l = G(e);
-  if (o.length !== 32)
-    throw new Error(`Invalid publicKey, received ${o.length}, expected 32`);
-  if (l.length !== 64)
-    throw new Error(`Invalid signature, received ${l.length} bytes, expected 64`);
-  try {
-    return !Vt || !i && zt() ? ls(l, a, o) : On.verify(l, a, o);
-  } catch {
-    return !1;
-  }
-}
-const Q0 = /* @__PURE__ */ Bo(Tn, D0), dn = 64, ta = 32, Jr = dn + ta;
-function Io(t) {
-  const e = G(t);
-  if (e.length !== Jr)
-    throw new Error(`Expected keypair with ${Jr} bytes, found ${e.length}`);
-  return {
-    publicKey: e.slice(dn, Jr),
-    secretKey: e.slice(0, dn)
-  };
-}
-function ea({ publicKey: t, secretKey: e }) {
-  return $t(e, t).slice();
-}
-function Uo(t) {
-  return (e, r) => {
-    if (!de(r) || r.length !== 32)
-      throw new Error("Invalid chainCode passed to derive");
-    return Io(t(ea(e), r));
-  };
-}
-const ra = /* @__PURE__ */ Uo(us), na = /* @__PURE__ */ Uo(ds);
-function ia(t, { chainCode: e, isSoft: r }) {
-  return r ? na(t, e) : ra(t, e);
-}
-const oa = {
-  ecdsa: xi,
-  ed25519: Q0,
-  // FIXME This is Substrate-compatible, not Ethereum-compatible
-  ethereum: xi,
-  sr25519: ia
-};
-function ko(t, e, r) {
-  const i = oa[r];
-  let a = t;
-  for (const o of e)
-    a = i(a, o);
-  return a;
-}
-function No(t) {
-  const e = G(t);
-  if (e.length !== 32)
-    throw new Error(`Expected a seed matching 32 bytes, found ${e.length}`);
-  return Io(ws(e));
-}
-function sa(t, { publicKey: e, secretKey: r }) {
-  if ((e == null ? void 0 : e.length) !== 32)
-    throw new Error("Expected a valid publicKey, 32-bytes");
-  if ((r == null ? void 0 : r.length) !== 64)
-    throw new Error("Expected a valid secretKey, 64-bytes");
-  return gs(e, r, G(t));
-}
-function Ro(t, e, r) {
-  const i = G(r), a = G(e);
-  if (i.length !== 32)
-    throw new Error(`Invalid publicKey, received ${i.length} bytes, expected 32`);
-  if (a.length !== 64)
-    throw new Error(`Invalid signature, received ${a.length} bytes, expected 64`);
-  return ms(a, G(t), i);
-}
-const Mi = new Uint8Array();
-function fa(t, { secretKey: e }, r = Mi, i = Mi) {
-  if ((e == null ? void 0 : e.length) !== 64)
-    throw new Error("Invalid secretKey, expected 64-bytes");
-  return ps(e, G(r), G(t), G(i));
-}
-const Ai = new Uint8Array();
-function aa(t, e, r, i = Ai, a = Ai) {
-  const o = G(r), l = G(e);
-  if (o.length !== 32)
-    throw new Error("Invalid publicKey, expected 32-bytes");
-  if (l.length !== 96)
-    throw new Error("Invalid vrfSign output, expected 96 bytes");
-  return ys(o, G(i), G(t), G(a), l);
-}
-function ca(t, e = Fe.prefix) {
-  const r = be(t);
-  if (e < 0 || e > 16383 || [46, 47].includes(e))
-    throw new Error("Out of range ss58Format specified");
-  if (!Fe.allowedDecodedLengths.includes(r.length))
-    throw new Error(`Expected a valid key to convert, with length ${Fe.allowedDecodedLengths.join(", ")}`);
-  const i = $t(e < 64 ? [e] : [
-    (e & 252) >> 2 | 64,
-    e >> 8 | (e & 3) << 6
-  ], r);
-  return Rf($t(i, ro(i).subarray(0, [32, 33].includes(r.length) ? 2 : 1)));
-}
-const Lo = [], Oo = [], To = [], ha = /* @__PURE__ */ BigInt(0), Se = /* @__PURE__ */ BigInt(1), la = /* @__PURE__ */ BigInt(2), ua = /* @__PURE__ */ BigInt(7), da = /* @__PURE__ */ BigInt(256), wa = /* @__PURE__ */ BigInt(113);
-for (let t = 0, e = Se, r = 1, i = 0; t < 24; t++) {
-  [r, i] = [i, (2 * r + 3 * i) % 5], Lo.push(2 * (5 * i + r)), Oo.push((t + 1) * (t + 2) / 2 % 64);
-  let a = ha;
-  for (let o = 0; o < 7; o++)
-    e = (e << Se ^ (e >> ua) * wa) % da, e & la && (a ^= Se << (Se << /* @__PURE__ */ BigInt(o)) - Se);
-  To.push(a);
-}
-const [ga, ma] = /* @__PURE__ */ xs(To, !0), Bi = (t, e, r) => r > 32 ? vs(t, e, r) : bs(t, e, r), Si = (t, e, r) => r > 32 ? Es(t, e, r) : _s(t, e, r);
-function pa(t, e = 24) {
-  const r = new Uint32Array(10);
-  for (let i = 24 - e; i < 24; i++) {
-    for (let l = 0; l < 10; l++)
-      r[l] = t[l] ^ t[l + 10] ^ t[l + 20] ^ t[l + 30] ^ t[l + 40];
-    for (let l = 0; l < 10; l += 2) {
-      const u = (l + 8) % 10, m = (l + 2) % 10, b = r[m], v = r[m + 1], E = Bi(b, v, 1) ^ r[u], M = Si(b, v, 1) ^ r[u + 1];
-      for (let S = 0; S < 50; S += 10)
-        t[l + S] ^= E, t[l + S + 1] ^= M;
-    }
-    let a = t[2], o = t[3];
-    for (let l = 0; l < 24; l++) {
-      const u = Oo[l], m = Bi(a, o, u), b = Si(a, o, u), v = Lo[l];
-      a = t[v], o = t[v + 1], t[v] = m, t[v + 1] = b;
-    }
-    for (let l = 0; l < 50; l += 10) {
-      for (let u = 0; u < 10; u++)
-        r[u] = t[l + u];
-      for (let u = 0; u < 10; u++)
-        t[l + u] ^= ~r[(u + 2) % 10] & r[(u + 4) % 10];
-    }
-    t[0] ^= ga[i], t[1] ^= ma[i];
-  }
-  r.fill(0);
-}
-class mr extends es {
-  // NOTE: we accept arguments in bytes instead of bits here.
-  constructor(e, r, i, a = !1, o = 24) {
-    if (super(), this.blockLen = e, this.suffix = r, this.outputLen = i, this.enableXOF = a, this.rounds = o, this.pos = 0, this.posOut = 0, this.finished = !1, this.destroyed = !1, se(i), 0 >= this.blockLen || this.blockLen >= 200)
-      throw new Error("Sha3 supports only keccak-f1600 function");
-    this.state = new Uint8Array(200), this.state32 = Je(this.state);
-  }
-  keccak() {
-    tr || er(this.state32), pa(this.state32, this.rounds), tr || er(this.state32), this.posOut = 0, this.pos = 0;
-  }
-  update(e) {
-    Qn(this);
-    const { blockLen: r, state: i } = this;
-    e = rs(e);
-    const a = e.length;
-    for (let o = 0; o < a; ) {
-      const l = Math.min(r - this.pos, a - o);
-      for (let u = 0; u < l; u++)
-        i[this.pos++] ^= e[o++];
-      this.pos === r && this.keccak();
-    }
-    return this;
-  }
-  finish() {
-    if (this.finished)
-      return;
-    this.finished = !0;
-    const { state: e, suffix: r, pos: i, blockLen: a } = this;
-    e[i] ^= r, (r & 128) !== 0 && i === a - 1 && this.keccak(), e[a - 1] ^= 128, this.keccak();
-  }
-  writeInto(e) {
-    Qn(this, !1), ns(e), this.finish();
-    const r = this.state, { blockLen: i } = this;
-    for (let a = 0, o = e.length; a < o; ) {
-      this.posOut >= i && this.keccak();
-      const l = Math.min(i - this.posOut, o - a);
-      e.set(r.subarray(this.posOut, this.posOut + l), a), this.posOut += l, a += l;
-    }
-    return e;
-  }
-  xofInto(e) {
-    if (!this.enableXOF)
-      throw new Error("XOF is not possible for this instance");
-    return this.writeInto(e);
-  }
-  xof(e) {
-    return se(e), this.xofInto(new Uint8Array(e));
-  }
-  digestInto(e) {
-    if (is(e, this), this.finished)
-      throw new Error("digest() was already called");
-    return this.writeInto(e), this.destroy(), e;
-  }
-  digest() {
-    return this.digestInto(new Uint8Array(this.outputLen));
-  }
-  destroy() {
-    this.destroyed = !0, this.state.fill(0);
-  }
-  _cloneInto(e) {
-    const { blockLen: r, suffix: i, outputLen: a, rounds: o, enableXOF: l } = this;
-    return e || (e = new mr(r, i, a, l, o)), e.state32.set(this.state32), e.pos = this.pos, e.posOut = this.posOut, e.finished = this.finished, e.rounds = o, e.suffix = i, e.outputLen = a, e.enableXOF = l, e.destroyed = this.destroyed, e;
-  }
-}
-const he = (t, e, r) => Qo(() => new mr(e, t, r));
-224 / 8;
-256 / 8;
-384 / 8;
-512 / 8;
-224 / 8;
-const ya = /* @__PURE__ */ he(1, 136, 256 / 8);
-384 / 8;
-const xa = /* @__PURE__ */ he(1, 72, 512 / 8), Ho = (t, e, r) => ts((i = {}) => new mr(e, t, i.dkLen === void 0 ? r : i.dkLen, !0));
-128 / 8;
-256 / 8;
-const pr = /* @__PURE__ */ Ms({ 256: Bs, 512: As }, { 256: ya, 512: xa });
-function wn(t, e, r) {
-  return t === "keccak" ? pr(e, void 0, r) : we(e, void 0, void 0, r);
-}
-const Hn = {
-  chars: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/",
-  coder: Sf,
-  type: "base64",
-  withPadding: !0
-}, va = /* @__PURE__ */ eo(Hn), ba = /* @__PURE__ */ Qi(Hn, va), Ea = /* @__PURE__ */ to(Hn);
-function qo(t, e) {
-  if (![33, 65].includes(t.length))
-    throw new Error(`Invalid publicKey provided, received ${t.length} bytes input`);
-  return t.length === 33 ? t : !Vt || zt() ? Ss(t) : Ve.ProjectivePoint.fromHex(t).toRawBytes(!0);
-}
-function qn(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 (!Vt || zt())
-    return Is(t).subarray(1);
-  const { px: r, py: i } = Ve.ProjectivePoint.fromHex(t);
-  return $t(Gt(r, Ee), Gt(i, Ee));
-}
-function _a(t, e, r, i = "blake2", a) {
-  const o = G(e).subarray(0, 64), l = G(t), u = !Vt || zt() ? Us(l, o, r) : Ve.Signature.fromCompact(o).addRecoveryBit(r).recoverPublicKey(l).toRawBytes();
-  if (!u)
-    throw new Error("Unable to recover publicKey from signature");
-  return i === "keccak" ? qn(u) : qo(u);
-}
-function Ii(t, { secretKey: e }, r = "blake2", i) {
-  if ((e == null ? void 0 : e.length) !== 32)
-    throw new Error("Expected valid secp256k1 secretKey, 32-bytes");
-  const a = wn(r, t, i);
-  if (!Vt || zt())
-    return ks(a, e);
-  const o = Ve.sign(a, e, { lowS: !0 });
-  return $t(Gt(o.r, Ee), Gt(o.s, Ee), new Uint8Array([o.recovery || 0]));
-}
-const $o = "ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141".replace(/ /g, ""), Fr = F(`0x${$o}`), Qr = new X($o, "hex");
-function Ma(t, e) {
-  let r = sn(e, fi);
-  if (r >= Fr)
-    throw new Error("Tweak parameter is out of range");
-  if (r += sn(t, fi), r >= Fr && (r -= Fr), r === rr)
-    throw new Error("Invalid resulting private key");
-  return af(r, Ee);
-}
-function Aa(t, e) {
-  const r = new X(e);
-  if (r.cmp(Qr) >= 0)
-    throw new Error("Tweak parameter is out of range");
-  if (r.iadd(new X(t)), r.cmp(Qr) >= 0 && r.isub(Qr), r.isZero())
-    throw new Error("Invalid resulting private key");
-  return Gt(r, Ee);
-}
-function Ba(t, e, r) {
-  if (!de(t) || t.length !== 32)
-    throw new Error("Expected seckey to be an Uint8Array with length 32");
-  if (!de(e) || e.length !== 32)
-    throw new Error("Expected tweak to be an Uint8Array with length 32");
-  return !Vt || r ? Aa(t, e) : Ma(t, e);
-}
-function Sa(t, e, r, i = "blake2", a) {
-  const o = G(e);
-  if (o.length !== 65)
-    throw new Error(`Expected signature with 65 bytes, ${o.length} found instead`);
-  const l = _a(wn(i, t), o, o[64], i), u = wn(i, l, a), m = G(r);
-  return jt(l, m) || (i === "keccak" ? jt(u.slice(-20), m.slice(-20)) : jt(u, m));
-}
-function Ia(t) {
-  return [33, 65].includes(t.length) && (t = pr(qn(t))), t.slice(-20);
-}
-function Co(t) {
-  if (!t)
-    return "0x";
-  const e = G(t);
-  if (![20, 32, 33, 65].includes(e.length))
-    throw new Error(`Invalid address or publicKey provided, received ${e.length} bytes input`);
-  const r = Re(Ia(e), -1, !1), i = Re(pr(r), -1, !1);
-  let a = "";
-  for (let o = 0; o < 40; o++)
-    a = `${a}${parseInt(i[o], 16) > 7 ? r[o].toUpperCase() : r[o]}`;
-  return `0x${a}`;
-}
-const Ua = {
-  256: vn,
-  512: Ds
-}, ka = {
-  256: Rs,
-  512: Ns
-};
-function Do(t, e, r = 256, i) {
-  const a = G(t);
-  return !Vt || zt() ? ka[r](a, e) : Cs(Ua[r], a, e);
-}
-const $n = 2147483648;
-function Na(t) {
-  if (!t.startsWith("m/"))
-    return !1;
-  const e = t.split("/").slice(1);
-  for (const r of e) {
-    const i = /^\d+'?$/.test(r) ? parseInt(r.replace(/'$/, ""), 10) : Number.NaN;
-    if (isNaN(i) || i >= $n || i < 0)
-      return !1;
-  }
-  return !0;
-}
-const Ra = ce("Bitcoin seed");
-function Po(t, e) {
-  return {
-    chainCode: e,
-    publicKey: Be(t).publicKey,
-    secretKey: t
-  };
-}
-function Zo(t, e) {
-  const r = Gt(e, Tf), i = e >= $n ? $t(new Uint8Array(1), t.secretKey, r) : $t(t.publicKey, r);
-  try {
-    const a = Do(t.chainCode, i, 512);
-    return Po(Ba(t.secretKey, a.slice(0, 32)), a.slice(32));
-  } catch {
-    return Zo(t, e + 1);
-  }
-}
-function La(t, e = "") {
-  const r = Do(Ra, t, 512);
-  let i = Po(r.slice(0, 32), r.slice(32));
-  if (!e || e === "m" || e === "M" || e === "m'" || e === "M'")
-    return i;
-  if (!Na(e))
-    throw new Error("Invalid derivation path");
-  const a = e.split("/").slice(1);
-  for (const o of a)
-    i = Zo(i, parseInt(o, 10) + (o.length > 1 && o.endsWith("'") ? $n : 0));
-  return i;
-}
-function Oa(t, e, r) {
-  return !Vt || zt() ? Ls(t) : Ps(t, e);
-}
-function Vo(t, e, r) {
-  return !Vt || zt() ? Os(t) : Zs(t, e);
-}
-function Ta(t, e = "", r, i = 32) {
-  if (Vo(t)) {
-    if (![32, 64].includes(i))
-      throw new Error(`Invalid seed length ${i}, expected 32 or 64`);
-  } else throw new Error("Invalid bip39 mnemonic specified");
-  return i === 32 ? !Vt || zt() ? Ts(t, e) : ti(t, e).subarray(0, 32) : ti(t, e);
-}
-function Ha(t, e = "", r, i) {
-  if (Vo(t, r)) {
-    if (zt())
-      return Hs(t, e);
-  } else throw new Error("Invalid bip39 mnemonic specified");
-  const a = Oa(t, r), o = ce(`mnemonic${e}`);
-  return Vs(a, o).password.slice(0, 32);
-}
-function Ke(t, e) {
-  return t << e | t >>> 32 - e;
-}
-function ye(t, e) {
-  let r = t[e + 3] & 255;
-  return r = r << 8 | t[e + 2] & 255, r = r << 8 | t[e + 1] & 255, r << 8 | t[e + 0] & 255;
-}
-function tn(t, e, r) {
-  for (let i = 0; i < 4; i++)
-    t[e + i] = r & 255, r >>>= 8;
-}
-function qa(t, e, r, i, a) {
-  let o = 0;
-  for (let l = 0; l < a; l++)
-    o |= t[e + l] ^ r[i + l];
-  return (1 & o - 1 >>> 8) - 1;
-}
-function gn(t, e, r, i, a) {
-  const o = new Uint32Array(16), l = new Uint32Array(16), u = new Uint32Array(16), m = new Uint32Array(4);
-  let b, v, E;
-  for (b = 0; b < 4; b++)
-    l[5 * b] = ye(i, 4 * b), l[1 + b] = ye(r, 4 * b), l[6 + b] = ye(e, 4 * b), l[11 + b] = ye(r, 16 + 4 * b);
-  for (b = 0; b < 16; b++)
-    u[b] = l[b];
-  for (b = 0; b < 20; b++) {
-    for (v = 0; v < 4; v++) {
-      for (E = 0; E < 4; E++)
-        m[E] = l[(5 * v + 4 * E) % 16];
-      for (m[1] ^= Ke(m[0] + m[3] | 0, 7), m[2] ^= Ke(m[1] + m[0] | 0, 9), m[3] ^= Ke(m[2] + m[1] | 0, 13), m[0] ^= Ke(m[3] + m[2] | 0, 18), E = 0; E < 4; E++)
-        o[4 * v + (v + E) % 4] = m[E];
-    }
-    for (E = 0; E < 16; E++)
-      l[E] = o[E];
-  }
-  if (a) {
-    for (b = 0; b < 16; b++)
-      l[b] = l[b] + u[b] | 0;
-    for (b = 0; b < 4; b++)
-      l[5 * b] = l[5 * b] - ye(i, 4 * b) | 0, l[6 + b] = l[6 + b] - ye(e, 4 * b) | 0;
-    for (b = 0; b < 4; b++)
-      tn(t, 4 * b, l[5 * b]), tn(t, 16 + 4 * b, l[6 + b]);
-  } else
-    for (b = 0; b < 16; b++)
-      tn(t, 4 * b, l[b] + u[b] | 0);
-}
-const mn = new Uint8Array([101, 120, 112, 97, 110, 100, 32, 51, 50, 45, 98, 121, 116, 101, 32, 107]);
-function $a(t, e, r, i, a, o, l) {
-  const u = new Uint8Array(16), m = new Uint8Array(64);
-  let b, v;
-  if (!a)
-    return 0;
-  for (v = 0; v < 16; v++)
-    u[v] = 0;
-  for (v = 0; v < 8; v++)
-    u[v] = o[v];
-  for (; a >= 64; ) {
-    for (gn(m, u, l, mn, !1), v = 0; v < 64; v++)
-      t[e + v] = (r ? r[i + v] : 0) ^ m[v];
-    for (b = 1, v = 8; v < 16; v++)
-      b = b + (u[v] & 255) | 0, u[v] = b & 255, b >>>= 8;
-    a -= 64, e += 64, r && (i += 64);
-  }
-  if (a > 0)
-    for (gn(m, u, l, mn, !1), v = 0; v < a; v++)
-      t[e + v] = (r ? r[i + v] : 0) ^ m[v];
-  return 0;
-}
-function pn(t, e, r, i, a, o, l) {
-  const u = new Uint8Array(32);
-  return gn(u, o, l, mn, !0), $a(t, e, r, i, a, o.subarray(16), u);
-}
-function en(t, e) {
-  let r = 0;
-  for (let i = 0; i < 17; i++)
-    r = r + (t[i] + e[i] | 0) | 0, t[i] = r & 255, r >>>= 8;
-}
-const Ca = new Uint32Array([5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 252]);
-function zo(t, e, r, i, a, o) {
-  let l, u, m;
-  const b = new Uint32Array(17), v = new Uint32Array(17), E = new Uint32Array(17), M = new Uint32Array(17), S = new Uint32Array(17);
-  for (u = 0; u < 17; u++)
-    v[u] = E[u] = 0;
-  for (u = 0; u < 16; u++)
-    v[u] = o[u];
-  for (v[3] &= 15, v[4] &= 252, v[7] &= 15, v[8] &= 252, v[11] &= 15, v[12] &= 252, v[15] &= 15; a > 0; ) {
-    for (u = 0; u < 17; u++)
-      M[u] = 0;
-    for (u = 0; u < 16 && u < a; ++u)
-      M[u] = r[i + u];
-    for (M[u] = 1, i += u, a -= u, en(E, M), l = 0; l < 17; l++)
-      for (b[l] = 0, u = 0; u < 17; u++)
-        b[l] = b[l] + E[u] * (u <= l ? v[l - u] : 320 * v[l + 17 - u] | 0) | 0 | 0;
-    for (l = 0; l < 17; l++)
-      E[l] = b[l];
-    for (m = 0, u = 0; u < 16; u++)
-      m = m + E[u] | 0, E[u] = m & 255, m >>>= 8;
-    for (m = m + E[16] | 0, E[16] = m & 3, m = 5 * (m >>> 2) | 0, u = 0; u < 16; u++)
-      m = m + E[u] | 0, E[u] = m & 255, m >>>= 8;
-    m = m + E[16] | 0, E[16] = m;
-  }
-  for (u = 0; u < 17; u++)
-    S[u] = E[u];
-  en(E, Ca);
-  const O = -(E[16] >>> 7) | 0;
-  for (u = 0; u < 17; u++)
-    E[u] ^= O & (S[u] ^ E[u]);
-  for (u = 0; u < 16; u++)
-    M[u] = o[u + 16];
-  for (M[16] = 0, en(E, M), u = 0; u < 16; u++)
-    t[e + u] = E[u];
-  return 0;
-}
-function Da(t, e, r, i, a, o) {
-  const l = new Uint8Array(16);
-  return zo(l, 0, r, i, a, o), qa(t, e, l, 0, 16);
-}
-function Pa(t, e, r, i, a) {
-  if (r < 32)
-    return -1;
-  pn(t, 0, e, 0, r, i, a), zo(t, 16, t, 32, r - 32, t);
-  for (let o = 0; o < 16; o++)
-    t[o] = 0;
-  return 0;
-}
-function Za(t, e, r, i, a) {
-  const o = new Uint8Array(32);
-  if (r < 32 || (pn(o, 0, null, 0, 32, i, a), Da(e, 16, e, 32, r - 32, o) !== 0))
-    return -1;
-  pn(t, 0, e, 0, r, i, a);
-  for (let l = 0; l < 32; l++)
-    t[l] = 0;
-  return 0;
-}
-const Va = 32, za = 24, yn = 32, xn = 16;
-function Go(t, e) {
-  if (t.length !== Va)
-    throw new Error("bad key size");
-  if (e.length !== za)
-    throw new Error("bad nonce size");
-}
-function Yo(...t) {
-  for (let e = 0, r = t.length; e < r; e++)
-    if (!(t[e] instanceof Uint8Array))
-      throw new TypeError("unexpected type, use Uint8Array");
-}
-function Ga(t, e, r) {
-  Yo(t, e, r), Go(r, e);
-  const i = new Uint8Array(yn + t.length), a = new Uint8Array(i.length);
-  for (let o = 0; o < t.length; o++)
-    i[o + yn] = t[o];
-  return Pa(a, i, i.length, e, r), a.subarray(xn);
-}
-function Ya(t, e, r) {
-  Yo(t, e, r), Go(r, e);
-  const i = new Uint8Array(xn + t.length), a = new Uint8Array(i.length);
-  for (let o = 0; o < t.length; o++)
-    i[o + xn] = t[o];
-  return i.length < 32 || Za(a, i, i.length, e, r) !== 0 ? null : a.subarray(yn);
-}
-function Wa(t, e, r) {
-  return Ya(t, e, r);
-}
-function Xa(t, e, r = Ci(24)) {
-  return {
-    encrypted: Ga(t, r, e),
-    nonce: r
-  };
-}
-function Ui(t, e, r, i, a, o) {
-  let l = t[e++] ^ r[i++], u = t[e++] ^ r[i++], m = t[e++] ^ r[i++], b = t[e++] ^ r[i++], v = t[e++] ^ r[i++], E = t[e++] ^ r[i++], M = t[e++] ^ r[i++], S = t[e++] ^ r[i++], O = t[e++] ^ r[i++], A = t[e++] ^ r[i++], D = t[e++] ^ r[i++], V = t[e++] ^ r[i++], Q = t[e++] ^ r[i++], R = t[e++] ^ r[i++], _ = t[e++] ^ r[i++], B = t[e++] ^ r[i++], L = l, T = u, q = m, $ = b, C = v, U = E, H = M, y = S, n = O, f = A, c = D, g = V, d = Q, w = R, x = _, h = B;
-  for (let s = 0; s < 8; s += 2)
-    C ^= j(L + d | 0, 7), n ^= j(C + L | 0, 9), d ^= j(n + C | 0, 13), L ^= j(d + n | 0, 18), f ^= j(U + T | 0, 7), w ^= j(f + U | 0, 9), T ^= j(w + f | 0, 13), U ^= j(T + w | 0, 18), x ^= j(c + H | 0, 7), q ^= j(x + c | 0, 9), H ^= j(q + x | 0, 13), c ^= j(H + q | 0, 18), $ ^= j(h + g | 0, 7), y ^= j($ + h | 0, 9), g ^= j(y + $ | 0, 13), h ^= j(g + y | 0, 18), T ^= j(L + $ | 0, 7), q ^= j(T + L | 0, 9), $ ^= j(q + T | 0, 13), L ^= j($ + q | 0, 18), H ^= j(U + C | 0, 7), y ^= j(H + U | 0, 9), C ^= j(y + H | 0, 13), U ^= j(C + y | 0, 18), g ^= j(c + f | 0, 7), n ^= j(g + c | 0, 9), f ^= j(n + g | 0, 13), c ^= j(f + n | 0, 18), d ^= j(h + x | 0, 7), w ^= j(d + h | 0, 9), x ^= j(w + d | 0, 13), h ^= j(x + w | 0, 18);
-  a[o++] = l + L | 0, a[o++] = u + T | 0, a[o++] = m + q | 0, a[o++] = b + $ | 0, a[o++] = v + C | 0, a[o++] = E + U | 0, a[o++] = M + H | 0, a[o++] = S + y | 0, a[o++] = O + n | 0, a[o++] = A + f | 0, a[o++] = D + c | 0, a[o++] = V + g | 0, a[o++] = Q + d | 0, a[o++] = R + w | 0, a[o++] = _ + x | 0, a[o++] = B + h | 0;
-}
-function rn(t, e, r, i, a) {
-  let o = i + 0, l = i + 16 * a;
-  for (let u = 0; u < 16; u++)
-    r[l + u] = t[e + (2 * a - 1) * 16 + u];
-  for (let u = 0; u < a; u++, o += 16, e += 16)
-    Ui(r, l, t, e, r, o), u > 0 && (l += 16), Ui(r, o, t, e += 16, r, l);
-}
-function Ka(t, e, r) {
-  const i = os({
-    dkLen: 32,
-    asyncTick: 10,
-    maxmem: 1073742848
-  }, r), { N: a, r: o, p: l, dkLen: u, asyncTick: m, maxmem: b, onProgress: v } = i;
-  if (se(a), se(o), se(l), se(u), se(m), se(b), v !== void 0 && typeof v != "function")
-    throw new Error("progressCb should be function");
-  const E = 128 * o, M = E / 4;
-  if (a <= 1 || (a & a - 1) !== 0 || a > 2 ** 32)
-    throw new Error("Scrypt: N must be larger than 1, a power of 2, and less than 2^32");
-  if (l < 0 || l > (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)");
-  if (u < 0 || u > (2 ** 32 - 1) * 32)
-    throw new Error("Scrypt: dkLen should be positive integer less than or equal to (2^32 - 1) * 32");
-  const S = E * (a + l);
-  if (S > b)
-    throw new Error(`Scrypt: parameters too large, ${S} (128 * r * (N + p)) > ${b} (maxmem)`);
-  const O = $i(vn, t, e, { c: 1, dkLen: E * l }), A = Je(O), D = Je(new Uint8Array(E * a)), V = Je(new Uint8Array(E));
-  let Q = () => {
-  };
-  if (v) {
-    const R = 2 * a * l, _ = Math.max(Math.floor(R / 1e4), 1);
-    let B = 0;
-    Q = () => {
-      B++, v && (!(B % _) || B === R) && v(B / R);
-    };
-  }
-  return { N: a, r: o, p: l, dkLen: u, blockSize32: M, V: D, B32: A, B: O, tmp: V, blockMixCb: Q, asyncTick: m };
-}
-function ja(t, e, r, i, a) {
-  const o = $i(vn, t, r, { c: 1, dkLen: e });
-  return r.fill(0), i.fill(0), a.fill(0), o;
-}
-function Ja(t, e, r) {
-  const { N: i, r: a, p: o, dkLen: l, blockSize32: u, V: m, B32: b, B: v, tmp: E, blockMixCb: M } = Ka(t, e, r);
-  tr || er(b);
-  for (let S = 0; S < o; S++) {
-    const O = u * S;
-    for (let A = 0; A < u; A++)
-      m[A] = b[O + A];
-    for (let A = 0, D = 0; A < i - 1; A++)
-      rn(m, D, m, D += u, a), M();
-    rn(m, (i - 1) * u, b, O, a), M();
-    for (let A = 0; A < i; A++) {
-      const D = b[O + u - 16] % i;
-      for (let V = 0; V < u; V++)
-        E[V] = b[O + V] ^ m[D * u + V];
-      rn(E, 0, b, O, a), M();
-    }
-  }
-  return tr || er(b), ja(t, l, v, m, E);
-}
-const Qe = {
-  N: 32768,
-  p: 1,
-  r: 8
-};
-function Wo(t, e = Ci(), r = Qe, i) {
-  const a = G(t);
-  return {
-    params: r,
-    password: !Vt || zt() ? qs(a, e, Math.log2(r.N), r.r, r.p) : Ja(a, e, bn({ dkLen: 64 }, r)),
-    salt: e
-  };
-}
-function Fa(t) {
-  const e = t.subarray(0, 32), r = qr(t.subarray(32, 36), Dr).toNumber(), i = qr(t.subarray(36, 40), Dr).toNumber(), a = qr(t.subarray(40, 44), Dr).toNumber();
-  if (r !== Qe.N || i !== Qe.p || a !== Qe.r)
-    throw new Error("Invalid injected scrypt params found");
-  return { params: { N: r, p: i, r: a }, salt: e };
-}
-function Qa(t, { N: e, p: r, r: i }) {
-  return $t(t, Gt(e, Pr), Gt(r, Pr), Gt(i, Pr));
-}
-const Xo = ["scrypt", "xsalsa20-poly1305"], tc = ["none"], ec = "3", ki = 24, rc = 32 + 3 * 4;
-function nc(t, e, r = Xo) {
-  if (t) {
-    if (r.includes("xsalsa20-poly1305") && !e)
-      throw new Error("Password required to decode encrypted data");
-  } else throw new Error("No encrypted data available to decode");
-  let i = t;
-  if (e) {
-    let a;
-    if (r.includes("scrypt")) {
-      const { params: o, salt: l } = Fa(t);
-      a = Wo(e, l, o).password, t = t.subarray(rc);
-    } else
-      a = ce(e);
-    i = Wa(t.subarray(ki), t.subarray(0, ki), ef(a, 256, !0));
-  }
-  if (!i)
-    throw new Error("Unable to decode using the supplied passphrase");
-  return i;
-}
-function ic(t, e, r) {
-  return {
-    encoded: Ea(t),
-    encoding: {
-      content: e,
-      type: r ? Xo : tc,
-      version: ec
-    }
-  };
-}
-const Ni = (t) => (e, r, i) => Sa(e, r, i, t), Ko = [
-  ["ecdsa", Ni("blake2")],
-  ["ethereum", Ni("keccak")]
-], oc = [
-  ["ed25519", So],
-  ["sr25519", Ro],
-  ...Ko
-], sc = ["ed25519", "sr25519", "ecdsa"];
-function jo(t, { message: e, publicKey: r, signature: i }, a = oc) {
-  return t.isValid = a.some(([o, l]) => {
-    try {
-      if (l(e, i, r))
-        return t.crypto = o, !0;
-    } catch {
-    }
-    return !1;
-  }), t;
-}
-function fc(t, { message: e, publicKey: r, signature: i }) {
-  if (![0, 1, 2].includes(i[0]))
-    throw new Error(`Unknown crypto type, expected signature prefix [0..2], found ${i[0]}`);
-  const a = sc[i[0]] || "none";
-  t.crypto = a;
-  try {
-    t.isValid = {
-      ecdsa: () => jo(t, { message: e, publicKey: r, signature: i.subarray(1) }, Ko).isValid,
-      ed25519: () => So(e, i.subarray(1), r),
-      none: () => {
-        throw Error("no verify for `none` crypto type");
-      },
-      sr25519: () => Ro(e, i.subarray(1), r)
-    }[a]();
-  } catch {
-  }
-  return t;
-}
-function ac(t) {
-  return [0, 1, 2].includes(t[0]) && [65, 66].includes(t.length) ? fc : jo;
-}
-function Ri(t, e, r) {
-  const i = G(e);
-  if (![64, 65, 66].includes(i.length))
-    throw new Error(`Invalid signature length, expected [64..66] bytes, found ${i.length}`);
-  const a = be(r), o = { message: G(t), publicKey: a, signature: i }, l = { crypto: "none", isValid: !1, isWrapped: ir(o.message, !0), publicKey: a }, u = ir(o.message, !1), m = ac(i);
-  return m(l, o), l.crypto !== "none" || l.isWrapped && !u ? l : (o.message = u ? nf(o.message) : of(o.message), m(l, o));
-}
-const cc = [zs, vf], hc = { 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" };
-Xs(hc, null, cc);
-const xe = new Uint8Array([161, 35, 3, 33, 0]), ur = new Uint8Array([48, 83, 2, 1, 1, 48, 5, 6, 3, 43, 101, 112, 4, 34, 4, 32]), lc = 32, Li = 64, uc = 32, Ie = ur.length;
-function dc(t, e, r) {
-  const i = Array.isArray(r) || r === void 0 ? r : [r], a = nc(e, t, i), o = a.subarray(0, ur.length);
-  if (!jt(o, ur))
-    throw new Error("Invalid Pkcs8 header found in body");
-  let l = a.subarray(Ie, Ie + Li), u = Ie + Li, m = a.subarray(u, u + xe.length);
-  if (!jt(m, xe) && (u = Ie + uc, l = a.subarray(Ie, u), m = a.subarray(u, u + xe.length), !jt(m, xe)))
-    throw new Error("Invalid Pkcs8 divider found in body");
-  const b = u + xe.length;
-  return {
-    publicKey: a.subarray(b, b + lc),
-    secretKey: l
-  };
-}
-function wc({ publicKey: t, secretKey: e }, r) {
-  if (!e)
-    throw new Error("Expected a valid secretKey to be passed to encode");
-  const i = $t(ur, e, xe, t);
-  if (!r)
-    return i;
-  const { params: a, password: o, salt: l } = Wo(r), { encrypted: u, nonce: m } = Xa(i, o.subarray(0, 32));
-  return $t(Qa(l, a), m, u);
-}
-function gc(t, { address: e, meta: r }, i, a) {
-  return bn(ic(i, ["pkcs8", t], a), {
-    address: e,
-    meta: r
-  });
-}
-const mc = new Uint8Array(), pc = {
-  ecdsa: Be,
-  ed25519: Tn,
-  ethereum: Be,
-  sr25519: No
-}, Oi = {
-  ecdsa: new Uint8Array([2]),
-  ed25519: new Uint8Array([0]),
-  ethereum: new Uint8Array([2]),
-  sr25519: new Uint8Array([1])
-}, Ti = {
-  ecdsa: (t, e) => Ii(t, e, "blake2"),
-  ed25519: F0,
-  ethereum: (t, e) => Ii(t, e, "keccak"),
-  sr25519: sa
-}, je = {
-  ecdsa: (t) => t.length > 32 ? we(t) : t,
-  ed25519: (t) => t,
-  ethereum: (t) => t.length === 20 ? t : pr(qn(t)),
-  sr25519: (t) => t
-};
-function Ue(t) {
-  return !t || zi(t);
-}
-function Hi(t, e, r) {
-  return we($t(e || "", r || "", t));
-}
-function ve({ toSS58: t, type: e }, { publicKey: r, secretKey: i }, a = {}, o = null, l) {
-  const u = (v, E) => {
-    const M = dc(v, E || o, l);
-    if (M.secretKey.length === 64)
-      r = M.publicKey, i = M.secretKey;
-    else {
-      const S = pc[e](M.secretKey);
-      r = S.publicKey, i = S.secretKey;
-    }
-  }, m = (v) => (Ue(i) && o && u(v, o), o = wc({ publicKey: r, secretKey: i }, v), l = void 0, o), b = () => {
-    const v = je[e](r);
-    return e === "ethereum" ? Co(v) : t(v);
-  };
-  return {
-    get address() {
-      return b();
-    },
-    get addressRaw() {
-      const v = je[e](r);
-      return e === "ethereum" ? v.slice(-20) : v;
-    },
-    get isLocked() {
-      return Ue(i);
-    },
-    get meta() {
-      return a;
-    },
-    get publicKey() {
-      return r;
-    },
-    get type() {
-      return e;
-    },
-    // eslint-disable-next-line sort-keys
-    decodePkcs8: u,
-    derive: (v, E) => {
-      if (e === "ethereum")
-        throw new Error("Unable to derive on this keypair");
-      if (Ue(i))
-        throw new Error("Cannot derive on a locked keypair");
-      const { path: M } = no(v), S = ko({ publicKey: r, secretKey: i }, M, e);
-      return ve({ toSS58: t, type: e }, S, E, null);
-    },
-    encodePkcs8: (v) => m(v),
-    lock: () => {
-      i = new Uint8Array();
-    },
-    setMeta: (v) => {
-      a = bn({}, a, v);
-    },
-    sign: (v, E = {}) => {
-      if (Ue(i))
-        throw new Error("Cannot sign with a locked key pair");
-      return $t(E.withType ? Oi[e] : mc, Ti[e](G(v), { publicKey: r, secretKey: i }));
-    },
-    toJson: (v) => {
-      const E = ["ecdsa", "ethereum"].includes(e) ? r.length === 20 ? Re(r) : Re(qo(r)) : b();
-      return gc(e, { address: E, meta: a }, m(v), !!v);
-    },
-    unlock: (v) => u(v),
-    verify: (v, E, M) => Ri(v, E, je[e](G(M))).isValid,
-    vrfSign: (v, E, M) => {
-      if (Ue(i))
-        throw new Error("Cannot sign with a locked key pair");
-      if (e === "sr25519")
-        return fa(v, { secretKey: i }, E, M);
-      const S = Ti[e](G(v), { publicKey: r, secretKey: i });
-      return $t(Hi(S, E, M), S);
-    },
-    vrfVerify: (v, E, M, S, O) => e === "sr25519" ? aa(v, E, r, S, O) : Ri(v, $t(Oi[e], E.subarray(32)), je[e](G(M))).isValid && jt(E.subarray(0, 32), Hi(E.subarray(32), S, O))
-  };
-}
-const yc = "bottom drive obey lake curtain smoke basket hold race lonely fit walk";
-class xc {
-  constructor() {
-    Jt(this, "__internal__map", {});
-  }
-  add(e) {
-    return this.__internal__map[be(e.address).toString()] = e, e;
-  }
-  all() {
-    return Object.values(this.__internal__map);
-  }
-  get(e) {
-    const r = this.__internal__map[be(e).toString()];
-    if (!r)
-      throw new Error(`Unable to retrieve keypair '${de(e) || fe(e) ? Re(G(e)) : e}'`);
-    return r;
-  }
-  remove(e) {
-    delete this.__internal__map[be(e).toString()];
-  }
-}
-const nn = {
-  ecdsa: (t) => Be(t),
-  ed25519: (t) => Tn(t),
-  ethereum: (t) => Be(t),
-  sr25519: (t) => No(t)
-};
-function vc({ publicKey: t }) {
-  return t;
-}
-class Tc {
-  constructor(e = {}) {
-    Jt(this, "__internal__pairs");
-    Jt(this, "__internal__type");
-    Jt(this, "__internal__ss58");
-    Jt(this, "decodeAddress", be);
-    /**
-     * @name encodeAddress
-     * @description Encodes the input into an ss58 representation
-     */
-    Jt(this, "encodeAddress", (e, r) => this.type === "ethereum" ? Co(e) : ca(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 xc(), this.__internal__ss58 = e.ss58Format, this.__internal__type = e.type;
-  }
-  /**
-   * @description retrieve the pairs (alias for getPairs)
-   */
-  get pairs() {
-    return this.getPairs();
-  }
-  /**
-   * @description retrieve the publicKeys (alias for getPublicKeys)
-   */
-  get publicKeys() {
-    return this.getPublicKeys();
-  }
-  /**
-   * @description Returns the type of the keyring, ed25519, sr25519 or ecdsa
-   */
-  get type() {
-    return this.__internal__type;
-  }
-  /**
-   * @name addPair
-   * @summary Stores an account, given a keyring pair, as a Key/Value (public key, pair) in Keyring Pair Dictionary
-   */
-  addPair(e) {
-    return this.__internal__pairs.add(e);
-  }
-  /**
-   * @name addFromAddress
-   * @summary Stores an account, given an account address, as a Key/Value (public key, pair) in Keyring Pair Dictionary
-   * @description Allows user to explicitly provide separate inputs including account address or public key, and optionally
-   * the associated account metadata, and the default encoded value as arguments (that may be obtained from the json file
-   * of an account backup), and then generates a keyring pair from them that it passes to
-   * `addPair` to stores in a keyring pair dictionary the public key of the generated pair as a key and the pair as the associated value.
-   */
-  addFromAddress(e, r = {}, i = null, a = this.type, o, l) {
-    const u = this.decodeAddress(e, o);
-    return this.addPair(ve({ toSS58: this.encodeAddress, type: a }, { publicKey: u, secretKey: new Uint8Array() }, r, i, l));
-  }
-  /**
-   * @name addFromJson
-   * @summary Stores an account, given JSON data, as a Key/Value (public key, pair) in Keyring Pair Dictionary
-   * @description Allows user to provide a json object argument that contains account information (that may be obtained from the json file
-   * of an account backup), and then generates a keyring pair from it that it passes to
-   * `addPair` to stores in a keyring pair dictionary the public key of the generated pair as a key and the pair as the associated value.
-   */
-  addFromJson(e, r) {
-    return this.addPair(this.createFromJson(e, r));
-  }
-  /**
-   * @name addFromMnemonic
-   * @summary Stores an account, given a mnemonic, as a Key/Value (public key, pair) in Keyring Pair Dictionary
-   * @description Allows user to provide a mnemonic (seed phrase that is provided when account is originally created)
-   * argument and a metadata argument that contains account information (that may be obtained from the json file
-   * of an account backup), and then generates a keyring pair from it that it passes to
-   * `addPair` to stores in a keyring pair dictionary the public key of the generated pair as a key and the pair as the associated value.
-   */
-  addFromMnemonic(e, r = {}, i = this.type) {
-    return this.addFromUri(e, r, i);
-  }
-  /**
-   * @name addFromPair
-   * @summary Stores an account created from an explicit publicKey/secreteKey combination
-   */
-  addFromPair(e, r = {}, i = this.type) {
-    return this.addPair(this.createFromPair(e, r, i));
-  }
-  /**
-   * @name addFromSeed
-   * @summary Stores an account, given seed data, as a Key/Value (public key, pair) in Keyring Pair Dictionary
-   * @description Stores in a keyring pair dictionary the public key of the pair as a key and the pair as the associated value.
-   * Allows user to provide the account seed as an argument, and then generates a keyring pair from it that it passes to
-   * `addPair` to store in a keyring pair dictionary the public key of the generated pair as a key and the pair as the associated value.
-   */
-  addFromSeed(e, r = {}, i = this.type) {
-    return this.addPair(ve({ toSS58: this.encodeAddress, type: i }, nn[i](e), r, null));
-  }
-  /**
-   * @name addFromUri
-   * @summary Creates an account via an suri
-   * @description Extracts the phrase, path and password from a SURI format for specifying secret keys `<secret>/<soft-key>//<hard-key>///<password>` (the `///password` may be omitted, and `/<soft-key>` and `//<hard-key>` maybe repeated and mixed). The secret can be a hex string, mnemonic phrase or a string (to be padded)
-   */
-  addFromUri(e, r = {}, i = this.type) {
-    return this.addPair(this.createFromUri(e, r, i));
-  }
-  /**
-   * @name createFromJson
-   * @description Creates a pair from a JSON keyfile
-   */
-  createFromJson({ address: e, encoded: r, encoding: { content: i, type: a, version: o }, meta: l }, u) {
-    if (o === "3" && i[0] !== "pkcs8")
-      throw new Error(`Unable to decode non-pkcs8 type, [${i.join(",")}] found}`);
-    const m = o === "0" || !Array.isArray(i) ? this.type : i[1], b = Array.isArray(a) ? a : [a];
-    if (!["ed25519", "sr25519", "ecdsa", "ethereum"].includes(m))
-      throw new Error(`Unknown crypto type ${m}`);
-    const v = fe(e) ? ke(e) : this.decodeAddress(e, u), E = fe(r) ? ke(r) : ba(r);
-    return ve({ toSS58: this.encodeAddress, type: m }, { publicKey: v, secretKey: new Uint8Array() }, l, E, b);
-  }
-  /**
-   * @name createFromPair
-   * @summary Creates a pair from an explicit publicKey/secreteKey combination
-   */
-  createFromPair(e, r = {}, i = this.type) {
-    return ve({ toSS58: this.encodeAddress, type: i }, e, r, null);
-  }
-  /**
-   * @name createFromUri
-   * @summary Creates a Keypair from an suri
-   * @description This creates a pair from the suri, but does not add it to the keyring
-   */
-  createFromUri(e, r = {}, i = this.type) {
-    const a = e.startsWith("//") ? `${yc}${e}` : e, { derivePath: o, password: l, path: u, phrase: m } = Pf(a);
-    let b;
-    const v = fe(m, 256);
-    if (v)
-      b = ke(m);
-    else {
-      const M = m.split(" ");
-      if ([12, 15, 18, 21, 24].includes(M.length))
-        b = i === "ethereum" ? Ta(m, "", !1, 64) : Ha(m, l);
-      else {
-        if (m.length > 32)
-          throw new Error("specified phrase is not a valid mnemonic and is invalid as a raw seed at > 32 bytes");
-        b = ce(m.padEnd(32));
-      }
-    }
-    const E = i === "ethereum" ? v ? nn[i](b) : La(b, o.substring(1)) : ko(nn[i](b), u, i);
-    return ve({ toSS58: this.encodeAddress, type: i }, E, r, null);
-  }
-  /**
-   * @name getPair
-   * @summary Retrieves an account keyring pair from the Keyring Pair Dictionary, given an account address
-   * @description Returns a keyring pair value from the keyring pair dictionary by performing
-   * a key lookup using the provided account address or public key (after decoding it).
-   */
-  getPair(e) {
-    return this.__internal__pairs.get(e);
-  }
-  /**
-   * @name getPairs
-   * @summary Retrieves all account keyring pairs from the Keyring Pair Dictionary
-   * @description Returns an array list of all the keyring pair values that are stored in the keyring pair dictionary.
-   */
-  getPairs() {
-    return this.__internal__pairs.all();
-  }
-  /**
-   * @name getPublicKeys
-   * @summary Retrieves Public Keys of all Keyring Pairs stored in the Keyring Pair Dictionary
-   * @description Returns an array list of all the public keys associated with each of the keyring pair values that are stored in the keyring pair dictionary.
-   */
-  getPublicKeys() {
-    return this.__internal__pairs.all().map(vc);
-  }
-  /**
-   * @name removePair
-   * @description Deletes the provided input address or public key from the stored Keyring Pair Dictionary.
-   */
-  removePair(e) {
-    this.__internal__pairs.remove(e);
-  }
-  /**
-   * @name setSS58Format;
-   * @description Sets the ss58 format for the keyring
-   */
-  setSS58Format(e) {
-    this.__internal__ss58 = e;
-  }
-  /**
-   * @name toJson
-   * @summary Returns a JSON object associated with the input argument that contains metadata assocated with an account
-   * @description Returns a JSON object containing the metadata associated with an account
-   * when valid address or public key and when the account passphrase is provided if the account secret
-   * is not already unlocked and available in memory. Note that in [Polkadot-JS Apps](https://github.com/polkadot-js/apps) the user
-   * may backup their account to a JSON file that contains this information.
-   */
-  toJson(e, r) {
-    return this.__internal__pairs.get(e).toJson(r);
-  }
-}
-export {
-  yc as DEV_PHRASE,
-  Tc as Keyring,
-  ve as createPair,
-  be as decodeAddress,
-  Tc as default,
-  ca as encodeAddress,
-  hc as packageInfo
-};