@prosopo/procaptcha-bundle 2.5.3 → 2.6.1

package/dist/bundle/index-BMjJnq60.js

@@ -1,4373 +0,0 @@
-var go = Object.defineProperty;
-var mo = (t, e, r) => e in t ? go(t, e, { enumerable: !0, configurable: !0, writable: !0, value: r }) : t[e] = r;
-var Kt = (t, e, r) => mo(t, typeof e != "symbol" ? e + "" : e, r);
-import { x as hi, s as ee, r as ci, d as po, f as b0, g as yo, h as vo, H as bo, n as Ft, u as Ve, i as Xe, b as je, e as kn, t as xo, j as Eo, o as Mo, k as _o, l as G } from "./toU8a-BWKf-2UU.js";
-import { b as Yr, B as W, c as Se, d as te, u as V, R as Bo, e as So, f as he, g as oe, j as Ht, i as Vt, s as Ao, k as Io, l as ko, m as Uo, n as No, o as Ro, p as Oo, q as Lo, r as To, v as $o, t as qo, x as Po, y as Co, z as Zo, A as Do, C as Ho, D as Vo, E as zo, F as Yo, G as Xo, H as jo, I as Ko, J as Go, K as Wo, L as Jo, M as Qo, N as Fo, O as ts, P as es, Q as rs } from "./hash-CtL1HOjf.js";
-import { g as ns, c as is } from "./_commonjsHelpers-DaMA6jEr.js";
-import { s as rr } from "./sha256-Cxc9Hrlx.js";
-import { h as li, s as ui, m as os, v as ss, a as Un, p as fs, b as di } from "./bip39-CFjno8fK.js";
-import { a as wi } from "./asU8a-JliaME7-.js";
-import { o as on } from "./spread-DEmVz7RJ.js";
-import { p as Ae } from "./emotion-element-5486c51c.browser.esm-Bywq83R5.js";
-const as = { name: "@polkadot/util", path: import.meta && import.meta.url ? new URL(import.meta.url).pathname.substring(0, new URL(import.meta.url).pathname.lastIndexOf("/") + 1) : "auto", type: "esm", version: "12.6.2" }, hs = "POLKADOTJS_DISABLE_ESM_CJS_WARNING";
-function cs(t) {
-  const e = hi;
-  return e.__polkadotjs || (e.__polkadotjs = {}), e.__polkadotjs[t] || (e.__polkadotjs[t] = []), e.__polkadotjs[t];
-}
-function ls(t, e) {
-  if (t)
-    return t;
-  if (Yr(e))
-    try {
-      return e() || "";
-    } catch {
-      return "";
-    }
-  return e || "";
-}
-function us({ name: t, path: e, type: r, version: o }, c, i = []) {
-  var E, M;
-  if (!t.startsWith("@polkadot"))
-    throw new Error(`Invalid package descriptor ${t}`);
-  const w = cs(t);
-  w.push({ path: ls(e, c), type: r, version: o });
-  const d = w.every((U) => U.version === o), y = ((M = (E = hi.process) == null ? void 0 : E.env) == null ? void 0 : M[hs]) === "1";
-  w.length !== 1 && !(y && d) || i.filter((U) => U && U.version !== o);
-}
-const Ke = /* @__PURE__ */ W(0), Ge = /* @__PURE__ */ W(1);
-Number.MAX_SAFE_INTEGER;
-const Nn = W(256), Rn = W(256 * 256), ds = W("0x10000000000000000");
-function Xr(t, { isLe: e = !0, isNegative: r = !1 } = {}) {
-  e || (t = t.slice().reverse());
-  const o = t.length;
-  if (r && o && t[o - 1] & 128) {
-    switch (o) {
-      case 0:
-        return W(0);
-      case 1:
-        return W((t[0] ^ 255) * -1 - 1);
-      case 2:
-        return W((t[0] + (t[1] << 8) ^ 65535) * -1 - 1);
-      case 4:
-        return W((t[0] + (t[1] << 8) + (t[2] << 16) + t[3] * 16777216 ^ 4294967295) * -1 - 1);
-    }
-    const i = new DataView(t.buffer, t.byteOffset);
-    if (o === 8)
-      return i.getBigInt64(0, !0);
-    let w = W(0);
-    const d = o % 2;
-    for (let y = o - 2; y >= d; y -= 2)
-      w = w * Rn + W(i.getUint16(y, !0) ^ 65535);
-    return d && (w = w * Nn + W(t[0] ^ 255)), w * -Ge - Ge;
-  }
-  switch (o) {
-    case 0:
-      return W(0);
-    case 1:
-      return W(t[0]);
-    case 2:
-      return W(t[0] + (t[1] << 8));
-    case 4:
-      return W(t[0] + (t[1] << 8) + (t[2] << 16) + t[3] * 16777216);
-  }
-  const c = new DataView(t.buffer, t.byteOffset);
-  switch (o) {
-    case 8:
-      return c.getBigUint64(0, !0);
-    case 16:
-      return c.getBigUint64(8, !0) * ds + c.getBigUint64(0, !0);
-    default: {
-      let i = W(0);
-      const w = o % 2;
-      for (let d = o - 2; d >= w; d -= 2)
-        i = i * Rn + W(c.getUint16(d, !0));
-      return w && (i = i * Nn + W(t[0])), i;
-    }
-  }
-}
-function ws(t, { isLe: e = !1, isNegative: r = !1 } = {}) {
-  return !t || t === "0x" ? W(0) : Xr(Se(t), { isLe: e, isNegative: r });
-}
-var gi = { exports: {} };
-(function(t) {
-  (function(e, r) {
-    function o(p, n) {
-      if (!p) throw new Error(n || "Assertion failed");
-    }
-    function c(p, n) {
-      p.super_ = n;
-      var f = function() {
-      };
-      f.prototype = n.prototype, p.prototype = new f(), p.prototype.constructor = p;
-    }
-    function i(p, n, f) {
-      if (i.isBN(p))
-        return p;
-      this.negative = 0, this.words = null, this.length = 0, this.red = null, p !== null && ((n === "le" || n === "be") && (f = n, n = 10), this._init(p || 0, n || 10, f || "be"));
-    }
-    typeof e == "object" ? e.exports = i : r.BN = i, i.BN = i, i.wordSize = 26;
-    var w;
-    try {
-      typeof window < "u" && typeof window.Buffer < "u" ? w = window.Buffer : w = require("buffer").Buffer;
-    } catch {
-    }
-    i.isBN = function(n) {
-      return n instanceof i ? !0 : n !== null && typeof n == "object" && n.constructor.wordSize === i.wordSize && Array.isArray(n.words);
-    }, i.max = function(n, f) {
-      return n.cmp(f) > 0 ? n : f;
-    }, i.min = function(n, f) {
-      return n.cmp(f) < 0 ? n : f;
-    }, i.prototype._init = function(n, f, a) {
-      if (typeof n == "number")
-        return this._initNumber(n, f, a);
-      if (typeof n == "object")
-        return this._initArray(n, f, a);
-      f === "hex" && (f = 16), o(f === (f | 0) && f >= 2 && f <= 36), n = n.toString().replace(/\s+/g, "");
-      var h = 0;
-      n[0] === "-" && (h++, this.negative = 1), h < n.length && (f === 16 ? this._parseHex(n, h, a) : (this._parseBase(n, f, h), a === "le" && this._initArray(this.toArray(), f, a)));
-    }, i.prototype._initNumber = function(n, f, a) {
-      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) : (o(n < 9007199254740992), this.words = [
-        n & 67108863,
-        n / 67108864 & 67108863,
-        1
-      ], this.length = 3), a === "le" && this._initArray(this.toArray(), f, a);
-    }, i.prototype._initArray = function(n, f, a) {
-      if (o(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 h = 0; h < this.length; h++)
-        this.words[h] = 0;
-      var l, m, b = 0;
-      if (a === "be")
-        for (h = n.length - 1, l = 0; h >= 0; h -= 3)
-          m = n[h] | n[h - 1] << 8 | n[h - 2] << 16, this.words[l] |= m << b & 67108863, this.words[l + 1] = m >>> 26 - b & 67108863, b += 24, b >= 26 && (b -= 26, l++);
-      else if (a === "le")
-        for (h = 0, l = 0; h < n.length; h += 3)
-          m = n[h] | n[h + 1] << 8 | n[h + 2] << 16, this.words[l] |= m << b & 67108863, this.words[l + 1] = m >>> 26 - b & 67108863, b += 24, b >= 26 && (b -= 26, l++);
-      return this._strip();
-    };
-    function d(p, n) {
-      var f = p.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;
-      o(!1, "Invalid character in " + p);
-    }
-    function y(p, n, f) {
-      var a = d(p, f);
-      return f - 1 >= n && (a |= d(p, f - 1) << 4), a;
-    }
-    i.prototype._parseHex = function(n, f, a) {
-      this.length = Math.ceil((n.length - f) / 6), this.words = new Array(this.length);
-      for (var h = 0; h < this.length; h++)
-        this.words[h] = 0;
-      var l = 0, m = 0, b;
-      if (a === "be")
-        for (h = n.length - 1; h >= f; h -= 2)
-          b = y(n, f, h) << l, this.words[m] |= b & 67108863, l >= 18 ? (l -= 18, m += 1, this.words[m] |= b >>> 26) : l += 8;
-      else {
-        var u = n.length - f;
-        for (h = u % 2 === 0 ? f + 1 : f; h < n.length; h += 2)
-          b = y(n, f, h) << l, this.words[m] |= b & 67108863, l >= 18 ? (l -= 18, m += 1, this.words[m] |= b >>> 26) : l += 8;
-      }
-      this._strip();
-    };
-    function x(p, n, f, a) {
-      for (var h = 0, l = 0, m = Math.min(p.length, f), b = n; b < m; b++) {
-        var u = p.charCodeAt(b) - 48;
-        h *= a, u >= 49 ? l = u - 49 + 10 : u >= 17 ? l = u - 17 + 10 : l = u, o(u >= 0 && l < a, "Invalid character"), h += l;
-      }
-      return h;
-    }
-    i.prototype._parseBase = function(n, f, a) {
-      this.words = [0], this.length = 1;
-      for (var h = 0, l = 1; l <= 67108863; l *= f)
-        h++;
-      h--, l = l / f | 0;
-      for (var m = n.length - a, b = m % h, u = Math.min(m, m - b) + a, s = 0, g = a; g < u; g += h)
-        s = x(n, g, g + h, f), this.imuln(l), this.words[0] + s < 67108864 ? this.words[0] += s : this._iaddn(s);
-      if (b !== 0) {
-        var B = 1;
-        for (s = x(n, g, n.length, f), g = 0; g < b; g++)
-          B *= f;
-        this.imuln(B), this.words[0] + s < 67108864 ? this.words[0] += s : this._iaddn(s);
-      }
-      this._strip();
-    }, i.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(p, n) {
-      p.words = n.words, p.length = n.length, p.negative = n.negative, p.red = n.red;
-    }
-    if (i.prototype._move = function(n) {
-      v(n, this);
-    }, i.prototype.clone = function() {
-      var n = new i(null);
-      return this.copy(n), n;
-    }, i.prototype._expand = function(n) {
-      for (; this.length < n; )
-        this.words[this.length++] = 0;
-      return this;
-    }, i.prototype._strip = function() {
-      for (; this.length > 1 && this.words[this.length - 1] === 0; )
-        this.length--;
-      return this._normSign();
-    }, i.prototype._normSign = function() {
-      return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;
-    }, typeof Symbol < "u" && typeof Symbol.for == "function")
-      try {
-        i.prototype[Symbol.for("nodejs.util.inspect.custom")] = E;
-      } catch {
-        i.prototype.inspect = E;
-      }
-    else
-      i.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"
-    ], U = [
-      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
-    ], C = [
-      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
-    ];
-    i.prototype.toString = function(n, f) {
-      n = n || 10, f = f | 0 || 1;
-      var a;
-      if (n === 16 || n === "hex") {
-        a = "";
-        for (var h = 0, l = 0, m = 0; m < this.length; m++) {
-          var b = this.words[m], u = ((b << h | l) & 16777215).toString(16);
-          l = b >>> 24 - h & 16777215, h += 2, h >= 26 && (h -= 26, m--), l !== 0 || m !== this.length - 1 ? a = M[6 - u.length] + u + a : a = u + a;
-        }
-        for (l !== 0 && (a = l.toString(16) + a); a.length % f !== 0; )
-          a = "0" + a;
-        return this.negative !== 0 && (a = "-" + a), a;
-      }
-      if (n === (n | 0) && n >= 2 && n <= 36) {
-        var s = U[n], g = C[n];
-        a = "";
-        var B = this.clone();
-        for (B.negative = 0; !B.isZero(); ) {
-          var I = B.modrn(g).toString(n);
-          B = B.idivn(g), B.isZero() ? a = I + a : a = M[s - I.length] + I + a;
-        }
-        for (this.isZero() && (a = "0" + a); a.length % f !== 0; )
-          a = "0" + a;
-        return this.negative !== 0 && (a = "-" + a), a;
-      }
-      o(!1, "Base should be between 2 and 36");
-    }, i.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 && o(!1, "Number can only safely store up to 53 bits"), this.negative !== 0 ? -n : n;
-    }, i.prototype.toJSON = function() {
-      return this.toString(16, 2);
-    }, w && (i.prototype.toBuffer = function(n, f) {
-      return this.toArrayLike(w, n, f);
-    }), i.prototype.toArray = function(n, f) {
-      return this.toArrayLike(Array, n, f);
-    };
-    var k = function(n, f) {
-      return n.allocUnsafe ? n.allocUnsafe(f) : new n(f);
-    };
-    i.prototype.toArrayLike = function(n, f, a) {
-      this._strip();
-      var h = this.byteLength(), l = a || Math.max(1, h);
-      o(h <= l, "byte array longer than desired length"), o(l > 0, "Requested array length <= 0");
-      var m = k(n, l), b = f === "le" ? "LE" : "BE";
-      return this["_toArrayLike" + b](m, h), m;
-    }, i.prototype._toArrayLikeLE = function(n, f) {
-      for (var a = 0, h = 0, l = 0, m = 0; l < this.length; l++) {
-        var b = this.words[l] << m | h;
-        n[a++] = b & 255, a < n.length && (n[a++] = b >> 8 & 255), a < n.length && (n[a++] = b >> 16 & 255), m === 6 ? (a < n.length && (n[a++] = b >> 24 & 255), h = 0, m = 0) : (h = b >>> 24, m += 2);
-      }
-      if (a < n.length)
-        for (n[a++] = h; a < n.length; )
-          n[a++] = 0;
-    }, i.prototype._toArrayLikeBE = function(n, f) {
-      for (var a = n.length - 1, h = 0, l = 0, m = 0; l < this.length; l++) {
-        var b = this.words[l] << m | h;
-        n[a--] = b & 255, a >= 0 && (n[a--] = b >> 8 & 255), a >= 0 && (n[a--] = b >> 16 & 255), m === 6 ? (a >= 0 && (n[a--] = b >> 24 & 255), h = 0, m = 0) : (h = b >>> 24, m += 2);
-      }
-      if (a >= 0)
-        for (n[a--] = h; a >= 0; )
-          n[a--] = 0;
-    }, Math.clz32 ? i.prototype._countBits = function(n) {
-      return 32 - Math.clz32(n);
-    } : i.prototype._countBits = function(n) {
-      var f = n, a = 0;
-      return f >= 4096 && (a += 13, f >>>= 13), f >= 64 && (a += 7, f >>>= 7), f >= 8 && (a += 4, f >>>= 4), f >= 2 && (a += 2, f >>>= 2), a + f;
-    }, i.prototype._zeroBits = function(n) {
-      if (n === 0) return 26;
-      var f = n, a = 0;
-      return f & 8191 || (a += 13, f >>>= 13), f & 127 || (a += 7, f >>>= 7), f & 15 || (a += 4, f >>>= 4), f & 3 || (a += 2, f >>>= 2), f & 1 || a++, a;
-    }, i.prototype.bitLength = function() {
-      var n = this.words[this.length - 1], f = this._countBits(n);
-      return (this.length - 1) * 26 + f;
-    };
-    function _(p) {
-      for (var n = new Array(p.bitLength()), f = 0; f < n.length; f++) {
-        var a = f / 26 | 0, h = f % 26;
-        n[f] = p.words[a] >>> h & 1;
-      }
-      return n;
-    }
-    i.prototype.zeroBits = function() {
-      if (this.isZero()) return 0;
-      for (var n = 0, f = 0; f < this.length; f++) {
-        var a = this._zeroBits(this.words[f]);
-        if (n += a, a !== 26) break;
-      }
-      return n;
-    }, i.prototype.byteLength = function() {
-      return Math.ceil(this.bitLength() / 8);
-    }, i.prototype.toTwos = function(n) {
-      return this.negative !== 0 ? this.abs().inotn(n).iaddn(1) : this.clone();
-    }, i.prototype.fromTwos = function(n) {
-      return this.testn(n - 1) ? this.notn(n).iaddn(1).ineg() : this.clone();
-    }, i.prototype.isNeg = function() {
-      return this.negative !== 0;
-    }, i.prototype.neg = function() {
-      return this.clone().ineg();
-    }, i.prototype.ineg = function() {
-      return this.isZero() || (this.negative ^= 1), this;
-    }, i.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();
-    }, i.prototype.ior = function(n) {
-      return o((this.negative | n.negative) === 0), this.iuor(n);
-    }, i.prototype.or = function(n) {
-      return this.length > n.length ? this.clone().ior(n) : n.clone().ior(this);
-    }, i.prototype.uor = function(n) {
-      return this.length > n.length ? this.clone().iuor(n) : n.clone().iuor(this);
-    }, i.prototype.iuand = function(n) {
-      var f;
-      this.length > n.length ? f = n : f = this;
-      for (var a = 0; a < f.length; a++)
-        this.words[a] = this.words[a] & n.words[a];
-      return this.length = f.length, this._strip();
-    }, i.prototype.iand = function(n) {
-      return o((this.negative | n.negative) === 0), this.iuand(n);
-    }, i.prototype.and = function(n) {
-      return this.length > n.length ? this.clone().iand(n) : n.clone().iand(this);
-    }, i.prototype.uand = function(n) {
-      return this.length > n.length ? this.clone().iuand(n) : n.clone().iuand(this);
-    }, i.prototype.iuxor = function(n) {
-      var f, a;
-      this.length > n.length ? (f = this, a = n) : (f = n, a = this);
-      for (var h = 0; h < a.length; h++)
-        this.words[h] = f.words[h] ^ a.words[h];
-      if (this !== f)
-        for (; h < f.length; h++)
-          this.words[h] = f.words[h];
-      return this.length = f.length, this._strip();
-    }, i.prototype.ixor = function(n) {
-      return o((this.negative | n.negative) === 0), this.iuxor(n);
-    }, i.prototype.xor = function(n) {
-      return this.length > n.length ? this.clone().ixor(n) : n.clone().ixor(this);
-    }, i.prototype.uxor = function(n) {
-      return this.length > n.length ? this.clone().iuxor(n) : n.clone().iuxor(this);
-    }, i.prototype.inotn = function(n) {
-      o(typeof n == "number" && n >= 0);
-      var f = Math.ceil(n / 26) | 0, a = n % 26;
-      this._expand(f), a > 0 && f--;
-      for (var h = 0; h < f; h++)
-        this.words[h] = ~this.words[h] & 67108863;
-      return a > 0 && (this.words[h] = ~this.words[h] & 67108863 >> 26 - a), this._strip();
-    }, i.prototype.notn = function(n) {
-      return this.clone().inotn(n);
-    }, i.prototype.setn = function(n, f) {
-      o(typeof n == "number" && n >= 0);
-      var a = n / 26 | 0, h = n % 26;
-      return this._expand(a + 1), f ? this.words[a] = this.words[a] | 1 << h : this.words[a] = this.words[a] & ~(1 << h), this._strip();
-    }, i.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 a, h;
-      this.length > n.length ? (a = this, h = n) : (a = n, h = this);
-      for (var l = 0, m = 0; m < h.length; m++)
-        f = (a.words[m] | 0) + (h.words[m] | 0) + l, this.words[m] = f & 67108863, l = f >>> 26;
-      for (; l !== 0 && m < a.length; m++)
-        f = (a.words[m] | 0) + l, this.words[m] = f & 67108863, l = f >>> 26;
-      if (this.length = a.length, l !== 0)
-        this.words[this.length] = l, this.length++;
-      else if (a !== this)
-        for (; m < a.length; m++)
-          this.words[m] = a.words[m];
-      return this;
-    }, i.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);
-    }, i.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 a = this.cmp(n);
-      if (a === 0)
-        return this.negative = 0, this.length = 1, this.words[0] = 0, this;
-      var h, l;
-      a > 0 ? (h = this, l = n) : (h = n, l = this);
-      for (var m = 0, b = 0; b < l.length; b++)
-        f = (h.words[b] | 0) - (l.words[b] | 0) + m, m = f >> 26, this.words[b] = f & 67108863;
-      for (; m !== 0 && b < h.length; b++)
-        f = (h.words[b] | 0) + m, m = f >> 26, this.words[b] = f & 67108863;
-      if (m === 0 && b < h.length && h !== this)
-        for (; b < h.length; b++)
-          this.words[b] = h.words[b];
-      return this.length = Math.max(this.length, b), h !== this && (this.negative = 1), this._strip();
-    }, i.prototype.sub = function(n) {
-      return this.clone().isub(n);
-    };
-    function S(p, n, f) {
-      f.negative = n.negative ^ p.negative;
-      var a = p.length + n.length | 0;
-      f.length = a, a = a - 1 | 0;
-      var h = p.words[0] | 0, l = n.words[0] | 0, m = h * l, b = m & 67108863, u = m / 67108864 | 0;
-      f.words[0] = b;
-      for (var s = 1; s < a; s++) {
-        for (var g = u >>> 26, B = u & 67108863, I = Math.min(s, n.length - 1), N = Math.max(0, s - p.length + 1); N <= I; N++) {
-          var j = s - N | 0;
-          h = p.words[j] | 0, l = n.words[N] | 0, m = h * l + B, g += m / 67108864 | 0, B = m & 67108863;
-        }
-        f.words[s] = B | 0, u = g | 0;
-      }
-      return u !== 0 ? f.words[s] = u | 0 : f.length--, f._strip();
-    }
-    var L = function(n, f, a) {
-      var h = n.words, l = f.words, m = a.words, b = 0, u, s, g, B = h[0] | 0, I = B & 8191, N = B >>> 13, j = h[1] | 0, H = j & 8191, z = j >>> 13, $t = h[2] | 0, X = $t & 8191, Y = $t >>> 13, Zt = h[3] | 0, Q = Zt & 8191, F = Zt >>> 13, $e = h[4] | 0, at = $e & 8191, ht = $e >>> 13, qe = h[5] | 0, et = qe & 8191, rt = qe >>> 13, ce = h[6] | 0, nt = ce & 8191, it = ce >>> 13, Ee = h[7] | 0, ot = Ee & 8191, st = Ee >>> 13, Pe = h[8] | 0, ct = Pe & 8191, lt = Pe >>> 13, Ce = h[9] | 0, dt = Ce & 8191, wt = Ce >>> 13, vn = l[0] | 0, gt = vn & 8191, mt = vn >>> 13, bn = l[1] | 0, pt = bn & 8191, yt = bn >>> 13, xn = l[2] | 0, vt = xn & 8191, bt = xn >>> 13, En = l[3] | 0, xt = En & 8191, Et = En >>> 13, Mn = l[4] | 0, Mt = Mn & 8191, _t = Mn >>> 13, _n = l[5] | 0, Bt = _n & 8191, St = _n >>> 13, Bn = l[6] | 0, At = Bn & 8191, It = Bn >>> 13, Sn = l[7] | 0, kt = Sn & 8191, Ut = Sn >>> 13, An = l[8] | 0, Nt = An & 8191, Rt = An >>> 13, In = l[9] | 0, Ot = In & 8191, Lt = In >>> 13;
-      a.negative = n.negative ^ f.negative, a.length = 19, u = Math.imul(I, gt), s = Math.imul(I, mt), s = s + Math.imul(N, gt) | 0, g = Math.imul(N, mt);
-      var cr = (b + u | 0) + ((s & 8191) << 13) | 0;
-      b = (g + (s >>> 13) | 0) + (cr >>> 26) | 0, cr &= 67108863, u = Math.imul(H, gt), s = Math.imul(H, mt), s = s + Math.imul(z, gt) | 0, g = Math.imul(z, mt), u = u + Math.imul(I, pt) | 0, s = s + Math.imul(I, yt) | 0, s = s + Math.imul(N, pt) | 0, g = g + Math.imul(N, yt) | 0;
-      var lr = (b + u | 0) + ((s & 8191) << 13) | 0;
-      b = (g + (s >>> 13) | 0) + (lr >>> 26) | 0, lr &= 67108863, u = Math.imul(X, gt), s = Math.imul(X, mt), s = s + Math.imul(Y, gt) | 0, g = Math.imul(Y, mt), u = u + Math.imul(H, pt) | 0, s = s + Math.imul(H, yt) | 0, s = s + Math.imul(z, pt) | 0, g = g + Math.imul(z, yt) | 0, u = u + Math.imul(I, vt) | 0, s = s + Math.imul(I, bt) | 0, s = s + Math.imul(N, vt) | 0, g = g + Math.imul(N, bt) | 0;
-      var ur = (b + u | 0) + ((s & 8191) << 13) | 0;
-      b = (g + (s >>> 13) | 0) + (ur >>> 26) | 0, ur &= 67108863, u = Math.imul(Q, gt), s = Math.imul(Q, mt), s = s + Math.imul(F, gt) | 0, g = Math.imul(F, mt), u = u + Math.imul(X, pt) | 0, s = s + Math.imul(X, yt) | 0, s = s + Math.imul(Y, pt) | 0, g = g + Math.imul(Y, yt) | 0, u = u + Math.imul(H, vt) | 0, s = s + Math.imul(H, bt) | 0, s = s + Math.imul(z, vt) | 0, g = g + Math.imul(z, bt) | 0, u = u + Math.imul(I, xt) | 0, s = s + Math.imul(I, Et) | 0, s = s + Math.imul(N, xt) | 0, g = g + Math.imul(N, Et) | 0;
-      var dr = (b + u | 0) + ((s & 8191) << 13) | 0;
-      b = (g + (s >>> 13) | 0) + (dr >>> 26) | 0, dr &= 67108863, u = Math.imul(at, gt), s = Math.imul(at, mt), s = s + Math.imul(ht, gt) | 0, g = Math.imul(ht, mt), u = u + Math.imul(Q, pt) | 0, s = s + Math.imul(Q, yt) | 0, s = s + Math.imul(F, pt) | 0, g = g + Math.imul(F, yt) | 0, u = u + Math.imul(X, vt) | 0, s = s + Math.imul(X, bt) | 0, s = s + Math.imul(Y, vt) | 0, g = g + Math.imul(Y, bt) | 0, u = u + Math.imul(H, xt) | 0, s = s + Math.imul(H, Et) | 0, s = s + Math.imul(z, xt) | 0, g = g + Math.imul(z, Et) | 0, u = u + Math.imul(I, Mt) | 0, s = s + Math.imul(I, _t) | 0, s = s + Math.imul(N, Mt) | 0, g = g + Math.imul(N, _t) | 0;
-      var wr = (b + u | 0) + ((s & 8191) << 13) | 0;
-      b = (g + (s >>> 13) | 0) + (wr >>> 26) | 0, wr &= 67108863, u = Math.imul(et, gt), s = Math.imul(et, mt), s = s + Math.imul(rt, gt) | 0, g = Math.imul(rt, mt), u = u + Math.imul(at, pt) | 0, s = s + Math.imul(at, yt) | 0, s = s + Math.imul(ht, pt) | 0, g = g + Math.imul(ht, yt) | 0, u = u + Math.imul(Q, vt) | 0, s = s + Math.imul(Q, bt) | 0, s = s + Math.imul(F, vt) | 0, g = g + Math.imul(F, bt) | 0, u = u + Math.imul(X, xt) | 0, s = s + Math.imul(X, Et) | 0, s = s + Math.imul(Y, xt) | 0, g = g + Math.imul(Y, Et) | 0, u = u + Math.imul(H, Mt) | 0, s = s + Math.imul(H, _t) | 0, s = s + Math.imul(z, Mt) | 0, g = g + Math.imul(z, _t) | 0, u = u + Math.imul(I, Bt) | 0, s = s + Math.imul(I, St) | 0, s = s + Math.imul(N, Bt) | 0, g = g + Math.imul(N, St) | 0;
-      var gr = (b + u | 0) + ((s & 8191) << 13) | 0;
-      b = (g + (s >>> 13) | 0) + (gr >>> 26) | 0, gr &= 67108863, u = Math.imul(nt, gt), s = Math.imul(nt, mt), s = s + Math.imul(it, gt) | 0, g = Math.imul(it, mt), u = u + Math.imul(et, pt) | 0, s = s + Math.imul(et, yt) | 0, s = s + Math.imul(rt, pt) | 0, g = g + Math.imul(rt, yt) | 0, u = u + Math.imul(at, vt) | 0, s = s + Math.imul(at, bt) | 0, s = s + Math.imul(ht, vt) | 0, g = g + Math.imul(ht, bt) | 0, u = u + Math.imul(Q, xt) | 0, s = s + Math.imul(Q, Et) | 0, s = s + Math.imul(F, xt) | 0, g = g + Math.imul(F, Et) | 0, u = u + Math.imul(X, Mt) | 0, s = s + Math.imul(X, _t) | 0, s = s + Math.imul(Y, Mt) | 0, g = g + Math.imul(Y, _t) | 0, u = u + Math.imul(H, Bt) | 0, s = s + Math.imul(H, St) | 0, s = s + Math.imul(z, Bt) | 0, g = g + Math.imul(z, St) | 0, u = u + Math.imul(I, At) | 0, s = s + Math.imul(I, It) | 0, s = s + Math.imul(N, At) | 0, g = g + Math.imul(N, It) | 0;
-      var mr = (b + u | 0) + ((s & 8191) << 13) | 0;
-      b = (g + (s >>> 13) | 0) + (mr >>> 26) | 0, mr &= 67108863, u = Math.imul(ot, gt), s = Math.imul(ot, mt), s = s + Math.imul(st, gt) | 0, g = Math.imul(st, mt), u = u + Math.imul(nt, pt) | 0, s = s + Math.imul(nt, yt) | 0, s = s + Math.imul(it, pt) | 0, g = g + Math.imul(it, yt) | 0, u = u + Math.imul(et, vt) | 0, s = s + Math.imul(et, bt) | 0, s = s + Math.imul(rt, vt) | 0, g = g + Math.imul(rt, bt) | 0, u = u + Math.imul(at, xt) | 0, s = s + Math.imul(at, Et) | 0, s = s + Math.imul(ht, xt) | 0, g = g + Math.imul(ht, Et) | 0, u = u + Math.imul(Q, Mt) | 0, s = s + Math.imul(Q, _t) | 0, s = s + Math.imul(F, Mt) | 0, g = g + Math.imul(F, _t) | 0, u = u + Math.imul(X, Bt) | 0, s = s + Math.imul(X, St) | 0, s = s + Math.imul(Y, Bt) | 0, g = g + Math.imul(Y, St) | 0, u = u + Math.imul(H, At) | 0, s = s + Math.imul(H, It) | 0, s = s + Math.imul(z, At) | 0, g = g + Math.imul(z, It) | 0, u = u + Math.imul(I, kt) | 0, s = s + Math.imul(I, Ut) | 0, s = s + Math.imul(N, kt) | 0, g = g + Math.imul(N, Ut) | 0;
-      var pr = (b + u | 0) + ((s & 8191) << 13) | 0;
-      b = (g + (s >>> 13) | 0) + (pr >>> 26) | 0, pr &= 67108863, u = Math.imul(ct, gt), s = Math.imul(ct, mt), s = s + Math.imul(lt, gt) | 0, g = Math.imul(lt, mt), u = u + Math.imul(ot, pt) | 0, s = s + Math.imul(ot, yt) | 0, s = s + Math.imul(st, pt) | 0, g = g + Math.imul(st, yt) | 0, u = u + Math.imul(nt, vt) | 0, s = s + Math.imul(nt, bt) | 0, s = s + Math.imul(it, vt) | 0, g = g + Math.imul(it, bt) | 0, u = u + Math.imul(et, xt) | 0, s = s + Math.imul(et, Et) | 0, s = s + Math.imul(rt, xt) | 0, g = g + Math.imul(rt, Et) | 0, u = u + Math.imul(at, Mt) | 0, s = s + Math.imul(at, _t) | 0, s = s + Math.imul(ht, Mt) | 0, g = g + Math.imul(ht, _t) | 0, u = u + Math.imul(Q, Bt) | 0, s = s + Math.imul(Q, St) | 0, s = s + Math.imul(F, Bt) | 0, g = g + Math.imul(F, St) | 0, u = u + Math.imul(X, At) | 0, s = s + Math.imul(X, It) | 0, s = s + Math.imul(Y, At) | 0, g = g + Math.imul(Y, It) | 0, u = u + Math.imul(H, kt) | 0, s = s + Math.imul(H, Ut) | 0, s = s + Math.imul(z, kt) | 0, g = g + Math.imul(z, Ut) | 0, u = u + Math.imul(I, Nt) | 0, s = s + Math.imul(I, Rt) | 0, s = s + Math.imul(N, Nt) | 0, g = g + Math.imul(N, Rt) | 0;
-      var yr = (b + u | 0) + ((s & 8191) << 13) | 0;
-      b = (g + (s >>> 13) | 0) + (yr >>> 26) | 0, yr &= 67108863, u = Math.imul(dt, gt), s = Math.imul(dt, mt), s = s + Math.imul(wt, gt) | 0, g = Math.imul(wt, mt), u = u + Math.imul(ct, pt) | 0, s = s + Math.imul(ct, yt) | 0, s = s + Math.imul(lt, pt) | 0, g = g + Math.imul(lt, yt) | 0, u = u + Math.imul(ot, vt) | 0, s = s + Math.imul(ot, bt) | 0, s = s + Math.imul(st, vt) | 0, g = g + Math.imul(st, bt) | 0, u = u + Math.imul(nt, xt) | 0, s = s + Math.imul(nt, Et) | 0, s = s + Math.imul(it, xt) | 0, g = g + Math.imul(it, Et) | 0, u = u + Math.imul(et, Mt) | 0, s = s + Math.imul(et, _t) | 0, s = s + Math.imul(rt, Mt) | 0, g = g + Math.imul(rt, _t) | 0, u = u + Math.imul(at, Bt) | 0, s = s + Math.imul(at, St) | 0, s = s + Math.imul(ht, Bt) | 0, g = g + Math.imul(ht, St) | 0, u = u + Math.imul(Q, At) | 0, s = s + Math.imul(Q, It) | 0, s = s + Math.imul(F, At) | 0, g = g + Math.imul(F, It) | 0, u = u + Math.imul(X, kt) | 0, s = s + Math.imul(X, Ut) | 0, s = s + Math.imul(Y, kt) | 0, g = g + Math.imul(Y, Ut) | 0, u = u + Math.imul(H, Nt) | 0, s = s + Math.imul(H, Rt) | 0, s = s + Math.imul(z, Nt) | 0, g = g + Math.imul(z, Rt) | 0, u = u + Math.imul(I, Ot) | 0, s = s + Math.imul(I, Lt) | 0, s = s + Math.imul(N, Ot) | 0, g = g + Math.imul(N, Lt) | 0;
-      var vr = (b + u | 0) + ((s & 8191) << 13) | 0;
-      b = (g + (s >>> 13) | 0) + (vr >>> 26) | 0, vr &= 67108863, u = Math.imul(dt, pt), s = Math.imul(dt, yt), s = s + Math.imul(wt, pt) | 0, g = Math.imul(wt, yt), u = u + Math.imul(ct, vt) | 0, s = s + Math.imul(ct, bt) | 0, s = s + Math.imul(lt, vt) | 0, g = g + Math.imul(lt, bt) | 0, u = u + Math.imul(ot, xt) | 0, s = s + Math.imul(ot, Et) | 0, s = s + Math.imul(st, xt) | 0, g = g + Math.imul(st, Et) | 0, u = u + Math.imul(nt, Mt) | 0, s = s + Math.imul(nt, _t) | 0, s = s + Math.imul(it, Mt) | 0, g = g + Math.imul(it, _t) | 0, u = u + Math.imul(et, Bt) | 0, s = s + Math.imul(et, St) | 0, s = s + Math.imul(rt, Bt) | 0, g = g + Math.imul(rt, St) | 0, u = u + Math.imul(at, At) | 0, s = s + Math.imul(at, It) | 0, s = s + Math.imul(ht, At) | 0, g = g + Math.imul(ht, It) | 0, u = u + Math.imul(Q, kt) | 0, s = s + Math.imul(Q, Ut) | 0, s = s + Math.imul(F, kt) | 0, g = g + Math.imul(F, Ut) | 0, u = u + Math.imul(X, Nt) | 0, s = s + Math.imul(X, Rt) | 0, s = s + Math.imul(Y, Nt) | 0, g = g + Math.imul(Y, Rt) | 0, u = u + Math.imul(H, Ot) | 0, s = s + Math.imul(H, Lt) | 0, s = s + Math.imul(z, Ot) | 0, g = g + Math.imul(z, Lt) | 0;
-      var br = (b + u | 0) + ((s & 8191) << 13) | 0;
-      b = (g + (s >>> 13) | 0) + (br >>> 26) | 0, br &= 67108863, u = Math.imul(dt, vt), s = Math.imul(dt, bt), s = s + Math.imul(wt, vt) | 0, g = Math.imul(wt, bt), u = u + Math.imul(ct, xt) | 0, s = s + Math.imul(ct, Et) | 0, s = s + Math.imul(lt, xt) | 0, g = g + Math.imul(lt, Et) | 0, u = u + Math.imul(ot, Mt) | 0, s = s + Math.imul(ot, _t) | 0, s = s + Math.imul(st, Mt) | 0, g = g + Math.imul(st, _t) | 0, u = u + Math.imul(nt, Bt) | 0, s = s + Math.imul(nt, St) | 0, s = s + Math.imul(it, Bt) | 0, g = g + Math.imul(it, St) | 0, u = u + Math.imul(et, At) | 0, s = s + Math.imul(et, It) | 0, s = s + Math.imul(rt, At) | 0, g = g + Math.imul(rt, It) | 0, u = u + Math.imul(at, kt) | 0, s = s + Math.imul(at, Ut) | 0, s = s + Math.imul(ht, kt) | 0, g = g + Math.imul(ht, Ut) | 0, u = u + Math.imul(Q, Nt) | 0, s = s + Math.imul(Q, Rt) | 0, s = s + Math.imul(F, Nt) | 0, g = g + Math.imul(F, Rt) | 0, u = u + Math.imul(X, Ot) | 0, s = s + Math.imul(X, Lt) | 0, s = s + Math.imul(Y, Ot) | 0, g = g + Math.imul(Y, Lt) | 0;
-      var xr = (b + u | 0) + ((s & 8191) << 13) | 0;
-      b = (g + (s >>> 13) | 0) + (xr >>> 26) | 0, xr &= 67108863, u = Math.imul(dt, xt), s = Math.imul(dt, Et), s = s + Math.imul(wt, xt) | 0, g = Math.imul(wt, Et), u = u + Math.imul(ct, Mt) | 0, s = s + Math.imul(ct, _t) | 0, s = s + Math.imul(lt, Mt) | 0, g = g + Math.imul(lt, _t) | 0, u = u + Math.imul(ot, Bt) | 0, s = s + Math.imul(ot, St) | 0, s = s + Math.imul(st, Bt) | 0, g = g + Math.imul(st, St) | 0, u = u + Math.imul(nt, At) | 0, s = s + Math.imul(nt, It) | 0, s = s + Math.imul(it, At) | 0, g = g + Math.imul(it, It) | 0, u = u + Math.imul(et, kt) | 0, s = s + Math.imul(et, Ut) | 0, s = s + Math.imul(rt, kt) | 0, g = g + Math.imul(rt, Ut) | 0, u = u + Math.imul(at, Nt) | 0, s = s + Math.imul(at, Rt) | 0, s = s + Math.imul(ht, Nt) | 0, g = g + Math.imul(ht, Rt) | 0, u = u + Math.imul(Q, Ot) | 0, s = s + Math.imul(Q, Lt) | 0, s = s + Math.imul(F, Ot) | 0, g = g + Math.imul(F, Lt) | 0;
-      var Er = (b + u | 0) + ((s & 8191) << 13) | 0;
-      b = (g + (s >>> 13) | 0) + (Er >>> 26) | 0, Er &= 67108863, u = Math.imul(dt, Mt), s = Math.imul(dt, _t), s = s + Math.imul(wt, Mt) | 0, g = Math.imul(wt, _t), u = u + Math.imul(ct, Bt) | 0, s = s + Math.imul(ct, St) | 0, s = s + Math.imul(lt, Bt) | 0, g = g + Math.imul(lt, St) | 0, u = u + Math.imul(ot, At) | 0, s = s + Math.imul(ot, It) | 0, s = s + Math.imul(st, At) | 0, g = g + Math.imul(st, It) | 0, u = u + Math.imul(nt, kt) | 0, s = s + Math.imul(nt, Ut) | 0, s = s + Math.imul(it, kt) | 0, g = g + Math.imul(it, Ut) | 0, u = u + Math.imul(et, Nt) | 0, s = s + Math.imul(et, Rt) | 0, s = s + Math.imul(rt, Nt) | 0, g = g + Math.imul(rt, Rt) | 0, u = u + Math.imul(at, Ot) | 0, s = s + Math.imul(at, Lt) | 0, s = s + Math.imul(ht, Ot) | 0, g = g + Math.imul(ht, Lt) | 0;
-      var Mr = (b + u | 0) + ((s & 8191) << 13) | 0;
-      b = (g + (s >>> 13) | 0) + (Mr >>> 26) | 0, Mr &= 67108863, u = Math.imul(dt, Bt), s = Math.imul(dt, St), s = s + Math.imul(wt, Bt) | 0, g = Math.imul(wt, St), u = u + Math.imul(ct, At) | 0, s = s + Math.imul(ct, It) | 0, s = s + Math.imul(lt, At) | 0, g = g + Math.imul(lt, It) | 0, u = u + Math.imul(ot, kt) | 0, s = s + Math.imul(ot, Ut) | 0, s = s + Math.imul(st, kt) | 0, g = g + Math.imul(st, Ut) | 0, u = u + Math.imul(nt, Nt) | 0, s = s + Math.imul(nt, Rt) | 0, s = s + Math.imul(it, Nt) | 0, g = g + Math.imul(it, Rt) | 0, u = u + Math.imul(et, Ot) | 0, s = s + Math.imul(et, Lt) | 0, s = s + Math.imul(rt, Ot) | 0, g = g + Math.imul(rt, Lt) | 0;
-      var _r = (b + u | 0) + ((s & 8191) << 13) | 0;
-      b = (g + (s >>> 13) | 0) + (_r >>> 26) | 0, _r &= 67108863, u = Math.imul(dt, At), s = Math.imul(dt, It), s = s + Math.imul(wt, At) | 0, g = Math.imul(wt, It), u = u + Math.imul(ct, kt) | 0, s = s + Math.imul(ct, Ut) | 0, s = s + Math.imul(lt, kt) | 0, g = g + Math.imul(lt, Ut) | 0, u = u + Math.imul(ot, Nt) | 0, s = s + Math.imul(ot, Rt) | 0, s = s + Math.imul(st, Nt) | 0, g = g + Math.imul(st, Rt) | 0, u = u + Math.imul(nt, Ot) | 0, s = s + Math.imul(nt, Lt) | 0, s = s + Math.imul(it, Ot) | 0, g = g + Math.imul(it, Lt) | 0;
-      var Br = (b + u | 0) + ((s & 8191) << 13) | 0;
-      b = (g + (s >>> 13) | 0) + (Br >>> 26) | 0, Br &= 67108863, u = Math.imul(dt, kt), s = Math.imul(dt, Ut), s = s + Math.imul(wt, kt) | 0, g = Math.imul(wt, Ut), u = u + Math.imul(ct, Nt) | 0, s = s + Math.imul(ct, Rt) | 0, s = s + Math.imul(lt, Nt) | 0, g = g + Math.imul(lt, Rt) | 0, u = u + Math.imul(ot, Ot) | 0, s = s + Math.imul(ot, Lt) | 0, s = s + Math.imul(st, Ot) | 0, g = g + Math.imul(st, Lt) | 0;
-      var Sr = (b + u | 0) + ((s & 8191) << 13) | 0;
-      b = (g + (s >>> 13) | 0) + (Sr >>> 26) | 0, Sr &= 67108863, u = Math.imul(dt, Nt), s = Math.imul(dt, Rt), s = s + Math.imul(wt, Nt) | 0, g = Math.imul(wt, Rt), u = u + Math.imul(ct, Ot) | 0, s = s + Math.imul(ct, Lt) | 0, s = s + Math.imul(lt, Ot) | 0, g = g + Math.imul(lt, Lt) | 0;
-      var Ar = (b + u | 0) + ((s & 8191) << 13) | 0;
-      b = (g + (s >>> 13) | 0) + (Ar >>> 26) | 0, Ar &= 67108863, u = Math.imul(dt, Ot), s = Math.imul(dt, Lt), s = s + Math.imul(wt, Ot) | 0, g = Math.imul(wt, Lt);
-      var Ir = (b + u | 0) + ((s & 8191) << 13) | 0;
-      return b = (g + (s >>> 13) | 0) + (Ir >>> 26) | 0, Ir &= 67108863, m[0] = cr, m[1] = lr, m[2] = ur, m[3] = dr, m[4] = wr, m[5] = gr, m[6] = mr, m[7] = pr, m[8] = yr, m[9] = vr, m[10] = br, m[11] = xr, m[12] = Er, m[13] = Mr, m[14] = _r, m[15] = Br, m[16] = Sr, m[17] = Ar, m[18] = Ir, b !== 0 && (m[19] = b, a.length++), a;
-    };
-    Math.imul || (L = S);
-    function A(p, n, f) {
-      f.negative = n.negative ^ p.negative, f.length = p.length + n.length;
-      for (var a = 0, h = 0, l = 0; l < f.length - 1; l++) {
-        var m = h;
-        h = 0;
-        for (var b = a & 67108863, u = Math.min(l, n.length - 1), s = Math.max(0, l - p.length + 1); s <= u; s++) {
-          var g = l - s, B = p.words[g] | 0, I = n.words[s] | 0, N = B * I, j = N & 67108863;
-          m = m + (N / 67108864 | 0) | 0, j = j + b | 0, b = j & 67108863, m = m + (j >>> 26) | 0, h += m >>> 26, m &= 67108863;
-        }
-        f.words[l] = b, a = m, m = h;
-      }
-      return a !== 0 ? f.words[l] = a : f.length--, f._strip();
-    }
-    function q(p, n, f) {
-      return A(p, n, f);
-    }
-    i.prototype.mulTo = function(n, f) {
-      var a, h = this.length + n.length;
-      return this.length === 10 && n.length === 10 ? a = L(this, n, f) : h < 63 ? a = S(this, n, f) : h < 1024 ? a = A(this, n, f) : a = q(this, n, f), a;
-    }, i.prototype.mul = function(n) {
-      var f = new i(null);
-      return f.words = new Array(this.length + n.length), this.mulTo(n, f);
-    }, i.prototype.mulf = function(n) {
-      var f = new i(null);
-      return f.words = new Array(this.length + n.length), q(this, n, f);
-    }, i.prototype.imul = function(n) {
-      return this.clone().mulTo(n, this);
-    }, i.prototype.imuln = function(n) {
-      var f = n < 0;
-      f && (n = -n), o(typeof n == "number"), o(n < 67108864);
-      for (var a = 0, h = 0; h < this.length; h++) {
-        var l = (this.words[h] | 0) * n, m = (l & 67108863) + (a & 67108863);
-        a >>= 26, a += l / 67108864 | 0, a += m >>> 26, this.words[h] = m & 67108863;
-      }
-      return a !== 0 && (this.words[h] = a, this.length++), f ? this.ineg() : this;
-    }, i.prototype.muln = function(n) {
-      return this.clone().imuln(n);
-    }, i.prototype.sqr = function() {
-      return this.mul(this);
-    }, i.prototype.isqr = function() {
-      return this.imul(this.clone());
-    }, i.prototype.pow = function(n) {
-      var f = _(n);
-      if (f.length === 0) return new i(1);
-      for (var a = this, h = 0; h < f.length && f[h] === 0; h++, a = a.sqr())
-        ;
-      if (++h < f.length)
-        for (var l = a.sqr(); h < f.length; h++, l = l.sqr())
-          f[h] !== 0 && (a = a.mul(l));
-      return a;
-    }, i.prototype.iushln = function(n) {
-      o(typeof n == "number" && n >= 0);
-      var f = n % 26, a = (n - f) / 26, h = 67108863 >>> 26 - f << 26 - f, l;
-      if (f !== 0) {
-        var m = 0;
-        for (l = 0; l < this.length; l++) {
-          var b = this.words[l] & h, u = (this.words[l] | 0) - b << f;
-          this.words[l] = u | m, m = b >>> 26 - f;
-        }
-        m && (this.words[l] = m, this.length++);
-      }
-      if (a !== 0) {
-        for (l = this.length - 1; l >= 0; l--)
-          this.words[l + a] = this.words[l];
-        for (l = 0; l < a; l++)
-          this.words[l] = 0;
-        this.length += a;
-      }
-      return this._strip();
-    }, i.prototype.ishln = function(n) {
-      return o(this.negative === 0), this.iushln(n);
-    }, i.prototype.iushrn = function(n, f, a) {
-      o(typeof n == "number" && n >= 0);
-      var h;
-      f ? h = (f - f % 26) / 26 : h = 0;
-      var l = n % 26, m = Math.min((n - l) / 26, this.length), b = 67108863 ^ 67108863 >>> l << l, u = a;
-      if (h -= m, h = Math.max(0, h), u) {
-        for (var s = 0; s < m; s++)
-          u.words[s] = this.words[s];
-        u.length = m;
-      }
-      if (m !== 0) if (this.length > m)
-        for (this.length -= m, s = 0; s < this.length; s++)
-          this.words[s] = this.words[s + m];
-      else
-        this.words[0] = 0, this.length = 1;
-      var g = 0;
-      for (s = this.length - 1; s >= 0 && (g !== 0 || s >= h); s--) {
-        var B = this.words[s] | 0;
-        this.words[s] = g << 26 - l | B >>> l, g = B & b;
-      }
-      return u && g !== 0 && (u.words[u.length++] = g), this.length === 0 && (this.words[0] = 0, this.length = 1), this._strip();
-    }, i.prototype.ishrn = function(n, f, a) {
-      return o(this.negative === 0), this.iushrn(n, f, a);
-    }, i.prototype.shln = function(n) {
-      return this.clone().ishln(n);
-    }, i.prototype.ushln = function(n) {
-      return this.clone().iushln(n);
-    }, i.prototype.shrn = function(n) {
-      return this.clone().ishrn(n);
-    }, i.prototype.ushrn = function(n) {
-      return this.clone().iushrn(n);
-    }, i.prototype.testn = function(n) {
-      o(typeof n == "number" && n >= 0);
-      var f = n % 26, a = (n - f) / 26, h = 1 << f;
-      if (this.length <= a) return !1;
-      var l = this.words[a];
-      return !!(l & h);
-    }, i.prototype.imaskn = function(n) {
-      o(typeof n == "number" && n >= 0);
-      var f = n % 26, a = (n - f) / 26;
-      if (o(this.negative === 0, "imaskn works only with positive numbers"), this.length <= a)
-        return this;
-      if (f !== 0 && a++, this.length = Math.min(a, this.length), f !== 0) {
-        var h = 67108863 ^ 67108863 >>> f << f;
-        this.words[this.length - 1] &= h;
-      }
-      return this._strip();
-    }, i.prototype.maskn = function(n) {
-      return this.clone().imaskn(n);
-    }, i.prototype.iaddn = function(n) {
-      return o(typeof n == "number"), o(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);
-    }, i.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;
-    }, i.prototype.isubn = function(n) {
-      if (o(typeof n == "number"), o(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();
-    }, i.prototype.addn = function(n) {
-      return this.clone().iaddn(n);
-    }, i.prototype.subn = function(n) {
-      return this.clone().isubn(n);
-    }, i.prototype.iabs = function() {
-      return this.negative = 0, this;
-    }, i.prototype.abs = function() {
-      return this.clone().iabs();
-    }, i.prototype._ishlnsubmul = function(n, f, a) {
-      var h = n.length + a, l;
-      this._expand(h);
-      var m, b = 0;
-      for (l = 0; l < n.length; l++) {
-        m = (this.words[l + a] | 0) + b;
-        var u = (n.words[l] | 0) * f;
-        m -= u & 67108863, b = (m >> 26) - (u / 67108864 | 0), this.words[l + a] = m & 67108863;
-      }
-      for (; l < this.length - a; l++)
-        m = (this.words[l + a] | 0) + b, b = m >> 26, this.words[l + a] = m & 67108863;
-      if (b === 0) return this._strip();
-      for (o(b === -1), b = 0, l = 0; l < this.length; l++)
-        m = -(this.words[l] | 0) + b, b = m >> 26, this.words[l] = m & 67108863;
-      return this.negative = 1, this._strip();
-    }, i.prototype._wordDiv = function(n, f) {
-      var a = this.length - n.length, h = this.clone(), l = n, m = l.words[l.length - 1] | 0, b = this._countBits(m);
-      a = 26 - b, a !== 0 && (l = l.ushln(a), h.iushln(a), m = l.words[l.length - 1] | 0);
-      var u = h.length - l.length, s;
-      if (f !== "mod") {
-        s = new i(null), s.length = u + 1, s.words = new Array(s.length);
-        for (var g = 0; g < s.length; g++)
-          s.words[g] = 0;
-      }
-      var B = h.clone()._ishlnsubmul(l, 1, u);
-      B.negative === 0 && (h = B, s && (s.words[u] = 1));
-      for (var I = u - 1; I >= 0; I--) {
-        var N = (h.words[l.length + I] | 0) * 67108864 + (h.words[l.length + I - 1] | 0);
-        for (N = Math.min(N / m | 0, 67108863), h._ishlnsubmul(l, N, I); h.negative !== 0; )
-          N--, h.negative = 0, h._ishlnsubmul(l, 1, I), h.isZero() || (h.negative ^= 1);
-        s && (s.words[I] = N);
-      }
-      return s && s._strip(), h._strip(), f !== "div" && a !== 0 && h.iushrn(a), {
-        div: s || null,
-        mod: h
-      };
-    }, i.prototype.divmod = function(n, f, a) {
-      if (o(!n.isZero()), this.isZero())
-        return {
-          div: new i(0),
-          mod: new i(0)
-        };
-      var h, l, m;
-      return this.negative !== 0 && n.negative === 0 ? (m = this.neg().divmod(n, f), f !== "mod" && (h = m.div.neg()), f !== "div" && (l = m.mod.neg(), a && l.negative !== 0 && l.iadd(n)), {
-        div: h,
-        mod: l
-      }) : this.negative === 0 && n.negative !== 0 ? (m = this.divmod(n.neg(), f), f !== "mod" && (h = m.div.neg()), {
-        div: h,
-        mod: m.mod
-      }) : this.negative & n.negative ? (m = this.neg().divmod(n.neg(), f), f !== "div" && (l = m.mod.neg(), a && l.negative !== 0 && l.isub(n)), {
-        div: m.div,
-        mod: l
-      }) : n.length > this.length || this.cmp(n) < 0 ? {
-        div: new i(0),
-        mod: this
-      } : n.length === 1 ? f === "div" ? {
-        div: this.divn(n.words[0]),
-        mod: null
-      } : f === "mod" ? {
-        div: null,
-        mod: new i(this.modrn(n.words[0]))
-      } : {
-        div: this.divn(n.words[0]),
-        mod: new i(this.modrn(n.words[0]))
-      } : this._wordDiv(n, f);
-    }, i.prototype.div = function(n) {
-      return this.divmod(n, "div", !1).div;
-    }, i.prototype.mod = function(n) {
-      return this.divmod(n, "mod", !1).mod;
-    }, i.prototype.umod = function(n) {
-      return this.divmod(n, "mod", !0).mod;
-    }, i.prototype.divRound = function(n) {
-      var f = this.divmod(n);
-      if (f.mod.isZero()) return f.div;
-      var a = f.div.negative !== 0 ? f.mod.isub(n) : f.mod, h = n.ushrn(1), l = n.andln(1), m = a.cmp(h);
-      return m < 0 || l === 1 && m === 0 ? f.div : f.div.negative !== 0 ? f.div.isubn(1) : f.div.iaddn(1);
-    }, i.prototype.modrn = function(n) {
-      var f = n < 0;
-      f && (n = -n), o(n <= 67108863);
-      for (var a = (1 << 26) % n, h = 0, l = this.length - 1; l >= 0; l--)
-        h = (a * h + (this.words[l] | 0)) % n;
-      return f ? -h : h;
-    }, i.prototype.modn = function(n) {
-      return this.modrn(n);
-    }, i.prototype.idivn = function(n) {
-      var f = n < 0;
-      f && (n = -n), o(n <= 67108863);
-      for (var a = 0, h = this.length - 1; h >= 0; h--) {
-        var l = (this.words[h] | 0) + a * 67108864;
-        this.words[h] = l / n | 0, a = l % n;
-      }
-      return this._strip(), f ? this.ineg() : this;
-    }, i.prototype.divn = function(n) {
-      return this.clone().idivn(n);
-    }, i.prototype.egcd = function(n) {
-      o(n.negative === 0), o(!n.isZero());
-      var f = this, a = n.clone();
-      f.negative !== 0 ? f = f.umod(n) : f = f.clone();
-      for (var h = new i(1), l = new i(0), m = new i(0), b = new i(1), u = 0; f.isEven() && a.isEven(); )
-        f.iushrn(1), a.iushrn(1), ++u;
-      for (var s = a.clone(), g = f.clone(); !f.isZero(); ) {
-        for (var B = 0, I = 1; !(f.words[0] & I) && B < 26; ++B, I <<= 1) ;
-        if (B > 0)
-          for (f.iushrn(B); B-- > 0; )
-            (h.isOdd() || l.isOdd()) && (h.iadd(s), l.isub(g)), h.iushrn(1), l.iushrn(1);
-        for (var N = 0, j = 1; !(a.words[0] & j) && N < 26; ++N, j <<= 1) ;
-        if (N > 0)
-          for (a.iushrn(N); N-- > 0; )
-            (m.isOdd() || b.isOdd()) && (m.iadd(s), b.isub(g)), m.iushrn(1), b.iushrn(1);
-        f.cmp(a) >= 0 ? (f.isub(a), h.isub(m), l.isub(b)) : (a.isub(f), m.isub(h), b.isub(l));
-      }
-      return {
-        a: m,
-        b,
-        gcd: a.iushln(u)
-      };
-    }, i.prototype._invmp = function(n) {
-      o(n.negative === 0), o(!n.isZero());
-      var f = this, a = n.clone();
-      f.negative !== 0 ? f = f.umod(n) : f = f.clone();
-      for (var h = new i(1), l = new i(0), m = a.clone(); f.cmpn(1) > 0 && a.cmpn(1) > 0; ) {
-        for (var b = 0, u = 1; !(f.words[0] & u) && b < 26; ++b, u <<= 1) ;
-        if (b > 0)
-          for (f.iushrn(b); b-- > 0; )
-            h.isOdd() && h.iadd(m), h.iushrn(1);
-        for (var s = 0, g = 1; !(a.words[0] & g) && s < 26; ++s, g <<= 1) ;
-        if (s > 0)
-          for (a.iushrn(s); s-- > 0; )
-            l.isOdd() && l.iadd(m), l.iushrn(1);
-        f.cmp(a) >= 0 ? (f.isub(a), h.isub(l)) : (a.isub(f), l.isub(h));
-      }
-      var B;
-      return f.cmpn(1) === 0 ? B = h : B = l, B.cmpn(0) < 0 && B.iadd(n), B;
-    }, i.prototype.gcd = function(n) {
-      if (this.isZero()) return n.abs();
-      if (n.isZero()) return this.abs();
-      var f = this.clone(), a = n.clone();
-      f.negative = 0, a.negative = 0;
-      for (var h = 0; f.isEven() && a.isEven(); h++)
-        f.iushrn(1), a.iushrn(1);
-      do {
-        for (; f.isEven(); )
-          f.iushrn(1);
-        for (; a.isEven(); )
-          a.iushrn(1);
-        var l = f.cmp(a);
-        if (l < 0) {
-          var m = f;
-          f = a, a = m;
-        } else if (l === 0 || a.cmpn(1) === 0)
-          break;
-        f.isub(a);
-      } while (!0);
-      return a.iushln(h);
-    }, i.prototype.invm = function(n) {
-      return this.egcd(n).a.umod(n);
-    }, i.prototype.isEven = function() {
-      return (this.words[0] & 1) === 0;
-    }, i.prototype.isOdd = function() {
-      return (this.words[0] & 1) === 1;
-    }, i.prototype.andln = function(n) {
-      return this.words[0] & n;
-    }, i.prototype.bincn = function(n) {
-      o(typeof n == "number");
-      var f = n % 26, a = (n - f) / 26, h = 1 << f;
-      if (this.length <= a)
-        return this._expand(a + 1), this.words[a] |= h, this;
-      for (var l = h, m = a; l !== 0 && m < this.length; m++) {
-        var b = this.words[m] | 0;
-        b += l, l = b >>> 26, b &= 67108863, this.words[m] = b;
-      }
-      return l !== 0 && (this.words[m] = l, this.length++), this;
-    }, i.prototype.isZero = function() {
-      return this.length === 1 && this.words[0] === 0;
-    }, i.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 a;
-      if (this.length > 1)
-        a = 1;
-      else {
-        f && (n = -n), o(n <= 67108863, "Number is too big");
-        var h = this.words[0] | 0;
-        a = h === n ? 0 : h < n ? -1 : 1;
-      }
-      return this.negative !== 0 ? -a | 0 : a;
-    }, i.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;
-    }, i.prototype.ucmp = function(n) {
-      if (this.length > n.length) return 1;
-      if (this.length < n.length) return -1;
-      for (var f = 0, a = this.length - 1; a >= 0; a--) {
-        var h = this.words[a] | 0, l = n.words[a] | 0;
-        if (h !== l) {
-          h < l ? f = -1 : h > l && (f = 1);
-          break;
-        }
-      }
-      return f;
-    }, i.prototype.gtn = function(n) {
-      return this.cmpn(n) === 1;
-    }, i.prototype.gt = function(n) {
-      return this.cmp(n) === 1;
-    }, i.prototype.gten = function(n) {
-      return this.cmpn(n) >= 0;
-    }, i.prototype.gte = function(n) {
-      return this.cmp(n) >= 0;
-    }, i.prototype.ltn = function(n) {
-      return this.cmpn(n) === -1;
-    }, i.prototype.lt = function(n) {
-      return this.cmp(n) === -1;
-    }, i.prototype.lten = function(n) {
-      return this.cmpn(n) <= 0;
-    }, i.prototype.lte = function(n) {
-      return this.cmp(n) <= 0;
-    }, i.prototype.eqn = function(n) {
-      return this.cmpn(n) === 0;
-    }, i.prototype.eq = function(n) {
-      return this.cmp(n) === 0;
-    }, i.red = function(n) {
-      return new T(n);
-    }, i.prototype.toRed = function(n) {
-      return o(!this.red, "Already a number in reduction context"), o(this.negative === 0, "red works only with positives"), n.convertTo(this)._forceRed(n);
-    }, i.prototype.fromRed = function() {
-      return o(this.red, "fromRed works only with numbers in reduction context"), this.red.convertFrom(this);
-    }, i.prototype._forceRed = function(n) {
-      return this.red = n, this;
-    }, i.prototype.forceRed = function(n) {
-      return o(!this.red, "Already a number in reduction context"), this._forceRed(n);
-    }, i.prototype.redAdd = function(n) {
-      return o(this.red, "redAdd works only with red numbers"), this.red.add(this, n);
-    }, i.prototype.redIAdd = function(n) {
-      return o(this.red, "redIAdd works only with red numbers"), this.red.iadd(this, n);
-    }, i.prototype.redSub = function(n) {
-      return o(this.red, "redSub works only with red numbers"), this.red.sub(this, n);
-    }, i.prototype.redISub = function(n) {
-      return o(this.red, "redISub works only with red numbers"), this.red.isub(this, n);
-    }, i.prototype.redShl = function(n) {
-      return o(this.red, "redShl works only with red numbers"), this.red.shl(this, n);
-    }, i.prototype.redMul = function(n) {
-      return o(this.red, "redMul works only with red numbers"), this.red._verify2(this, n), this.red.mul(this, n);
-    }, i.prototype.redIMul = function(n) {
-      return o(this.red, "redMul works only with red numbers"), this.red._verify2(this, n), this.red.imul(this, n);
-    }, i.prototype.redSqr = function() {
-      return o(this.red, "redSqr works only with red numbers"), this.red._verify1(this), this.red.sqr(this);
-    }, i.prototype.redISqr = function() {
-      return o(this.red, "redISqr works only with red numbers"), this.red._verify1(this), this.red.isqr(this);
-    }, i.prototype.redSqrt = function() {
-      return o(this.red, "redSqrt works only with red numbers"), this.red._verify1(this), this.red.sqrt(this);
-    }, i.prototype.redInvm = function() {
-      return o(this.red, "redInvm works only with red numbers"), this.red._verify1(this), this.red.invm(this);
-    }, i.prototype.redNeg = function() {
-      return o(this.red, "redNeg works only with red numbers"), this.red._verify1(this), this.red.neg(this);
-    }, i.prototype.redPow = function(n) {
-      return o(this.red && !n.red, "redPow(normalNum)"), this.red._verify1(this), this.red.pow(this, n);
-    };
-    var D = {
-      k256: null,
-      p224: null,
-      p192: null,
-      p25519: null
-    };
-    function R(p, n) {
-      this.name = p, this.p = new i(n, 16), this.n = this.p.bitLength(), this.k = new i(1).iushln(this.n).isub(this.p), this.tmp = this._tmp();
-    }
-    R.prototype._tmp = function() {
-      var n = new i(null);
-      return n.words = new Array(Math.ceil(this.n / 13)), n;
-    }, R.prototype.ireduce = function(n) {
-      var f = n, a;
-      do
-        this.split(f, this.tmp), f = this.imulK(f), f = f.iadd(this.tmp), a = f.bitLength();
-      while (a > this.n);
-      var h = a < this.n ? -1 : f.ucmp(this.p);
-      return h === 0 ? (f.words[0] = 0, f.length = 1) : h > 0 ? f.isub(this.p) : f.strip !== void 0 ? f.strip() : f._strip(), f;
-    }, R.prototype.split = function(n, f) {
-      n.iushrn(this.n, 0, f);
-    }, R.prototype.imulK = function(n) {
-      return n.imul(this.k);
-    };
-    function O() {
-      R.call(
-        this,
-        "k256",
-        "ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f"
-      );
-    }
-    c(O, R), O.prototype.split = function(n, f) {
-      for (var a = 4194303, h = Math.min(n.length, 9), l = 0; l < h; l++)
-        f.words[l] = n.words[l];
-      if (f.length = h, n.length <= 9) {
-        n.words[0] = 0, n.length = 1;
-        return;
-      }
-      var m = n.words[9];
-      for (f.words[f.length++] = m & a, l = 10; l < n.length; l++) {
-        var b = n.words[l] | 0;
-        n.words[l - 10] = (b & a) << 4 | m >>> 22, m = b;
-      }
-      m >>>= 22, n.words[l - 10] = m, m === 0 && n.length > 10 ? n.length -= 10 : n.length -= 9;
-    }, O.prototype.imulK = function(n) {
-      n.words[n.length] = 0, n.words[n.length + 1] = 0, n.length += 2;
-      for (var f = 0, a = 0; a < n.length; a++) {
-        var h = n.words[a] | 0;
-        f += h * 977, n.words[a] = f & 67108863, f = h * 64 + (f / 67108864 | 0);
-      }
-      return n.words[n.length - 1] === 0 && (n.length--, n.words[n.length - 1] === 0 && n.length--), n;
-    };
-    function $() {
-      R.call(
-        this,
-        "p224",
-        "ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001"
-      );
-    }
-    c($, R);
-    function P() {
-      R.call(
-        this,
-        "p192",
-        "ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff"
-      );
-    }
-    c(P, R);
-    function J() {
-      R.call(
-        this,
-        "25519",
-        "7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed"
-      );
-    }
-    c(J, R), J.prototype.imulK = function(n) {
-      for (var f = 0, a = 0; a < n.length; a++) {
-        var h = (n.words[a] | 0) * 19 + f, l = h & 67108863;
-        h >>>= 26, n.words[a] = l, f = h;
-      }
-      return f !== 0 && (n.words[n.length++] = f), n;
-    }, i._prime = function(n) {
-      if (D[n]) return D[n];
-      var f;
-      if (n === "k256")
-        f = new O();
-      else if (n === "p224")
-        f = new $();
-      else if (n === "p192")
-        f = new P();
-      else if (n === "p25519")
-        f = new J();
-      else
-        throw new Error("Unknown prime " + n);
-      return D[n] = f, f;
-    };
-    function T(p) {
-      if (typeof p == "string") {
-        var n = i._prime(p);
-        this.m = n.p, this.prime = n;
-      } else
-        o(p.gtn(1), "modulus must be greater than 1"), this.m = p, this.prime = null;
-    }
-    T.prototype._verify1 = function(n) {
-      o(n.negative === 0, "red works only with positives"), o(n.red, "red works only with red numbers");
-    }, T.prototype._verify2 = function(n, f) {
-      o((n.negative | f.negative) === 0, "red works only with positives"), o(
-        n.red && n.red === f.red,
-        "red works only with red numbers"
-      );
-    }, T.prototype.imod = function(n) {
-      return this.prime ? this.prime.ireduce(n)._forceRed(this) : (v(n, n.umod(this.m)._forceRed(this)), n);
-    }, T.prototype.neg = function(n) {
-      return n.isZero() ? n.clone() : this.m.sub(n)._forceRed(this);
-    }, T.prototype.add = function(n, f) {
-      this._verify2(n, f);
-      var a = n.add(f);
-      return a.cmp(this.m) >= 0 && a.isub(this.m), a._forceRed(this);
-    }, T.prototype.iadd = function(n, f) {
-      this._verify2(n, f);
-      var a = n.iadd(f);
-      return a.cmp(this.m) >= 0 && a.isub(this.m), a;
-    }, T.prototype.sub = function(n, f) {
-      this._verify2(n, f);
-      var a = n.sub(f);
-      return a.cmpn(0) < 0 && a.iadd(this.m), a._forceRed(this);
-    }, T.prototype.isub = function(n, f) {
-      this._verify2(n, f);
-      var a = n.isub(f);
-      return a.cmpn(0) < 0 && a.iadd(this.m), a;
-    }, T.prototype.shl = function(n, f) {
-      return this._verify1(n), this.imod(n.ushln(f));
-    }, T.prototype.imul = function(n, f) {
-      return this._verify2(n, f), this.imod(n.imul(f));
-    }, T.prototype.mul = function(n, f) {
-      return this._verify2(n, f), this.imod(n.mul(f));
-    }, T.prototype.isqr = function(n) {
-      return this.imul(n, n.clone());
-    }, T.prototype.sqr = function(n) {
-      return this.mul(n, n);
-    }, T.prototype.sqrt = function(n) {
-      if (n.isZero()) return n.clone();
-      var f = this.m.andln(3);
-      if (o(f % 2 === 1), f === 3) {
-        var a = this.m.add(new i(1)).iushrn(2);
-        return this.pow(n, a);
-      }
-      for (var h = this.m.subn(1), l = 0; !h.isZero() && h.andln(1) === 0; )
-        l++, h.iushrn(1);
-      o(!h.isZero());
-      var m = new i(1).toRed(this), b = m.redNeg(), u = this.m.subn(1).iushrn(1), s = this.m.bitLength();
-      for (s = new i(2 * s * s).toRed(this); this.pow(s, u).cmp(b) !== 0; )
-        s.redIAdd(b);
-      for (var g = this.pow(s, h), B = this.pow(n, h.addn(1).iushrn(1)), I = this.pow(n, h), N = l; I.cmp(m) !== 0; ) {
-        for (var j = I, H = 0; j.cmp(m) !== 0; H++)
-          j = j.redSqr();
-        o(H < N);
-        var z = this.pow(g, new i(1).iushln(N - H - 1));
-        B = B.redMul(z), g = z.redSqr(), I = I.redMul(g), N = H;
-      }
-      return B;
-    }, T.prototype.invm = function(n) {
-      var f = n._invmp(this.m);
-      return f.negative !== 0 ? (f.negative = 0, this.imod(f).redNeg()) : this.imod(f);
-    }, T.prototype.pow = function(n, f) {
-      if (f.isZero()) return new i(1).toRed(this);
-      if (f.cmpn(1) === 0) return n.clone();
-      var a = 4, h = new Array(1 << a);
-      h[0] = new i(1).toRed(this), h[1] = n;
-      for (var l = 2; l < h.length; l++)
-        h[l] = this.mul(h[l - 1], n);
-      var m = h[0], b = 0, u = 0, s = f.bitLength() % 26;
-      for (s === 0 && (s = 26), l = f.length - 1; l >= 0; l--) {
-        for (var g = f.words[l], B = s - 1; B >= 0; B--) {
-          var I = g >> B & 1;
-          if (m !== h[0] && (m = this.sqr(m)), I === 0 && b === 0) {
-            u = 0;
-            continue;
-          }
-          b <<= 1, b |= I, u++, !(u !== a && (l !== 0 || B !== 0)) && (m = this.mul(m, h[b]), u = 0, b = 0);
-        }
-        s = 26;
-      }
-      return m;
-    }, T.prototype.convertTo = function(n) {
-      var f = n.umod(this.m);
-      return f === n ? f.clone() : f;
-    }, T.prototype.convertFrom = function(n) {
-      var f = n.clone();
-      return f.red = null, f;
-    }, i.mont = function(n) {
-      return new Z(n);
-    };
-    function Z(p) {
-      T.call(this, p), this.shift = this.m.bitLength(), this.shift % 26 !== 0 && (this.shift += 26 - this.shift % 26), this.r = new i(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);
-    }
-    c(Z, T), Z.prototype.convertTo = function(n) {
-      return this.imod(n.ushln(this.shift));
-    }, Z.prototype.convertFrom = function(n) {
-      var f = this.imod(n.mul(this.rinv));
-      return f.red = null, f;
-    }, Z.prototype.imul = function(n, f) {
-      if (n.isZero() || f.isZero())
-        return n.words[0] = 0, n.length = 1, n;
-      var a = n.imul(f), h = a.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), l = a.isub(h).iushrn(this.shift), m = l;
-      return l.cmp(this.m) >= 0 ? m = l.isub(this.m) : l.cmpn(0) < 0 && (m = l.iadd(this.m)), m._forceRed(this);
-    }, Z.prototype.mul = function(n, f) {
-      if (n.isZero() || f.isZero()) return new i(0)._forceRed(this);
-      var a = n.mul(f), h = a.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), l = a.isub(h).iushrn(this.shift), m = l;
-      return l.cmp(this.m) >= 0 ? m = l.isub(this.m) : l.cmpn(0) < 0 && (m = l.iadd(this.m)), m._forceRed(this);
-    }, Z.prototype.invm = function(n) {
-      var f = this.imod(n._invmp(this.m).mul(this.r2));
-      return f._forceRed(this);
-    };
-  })(t, is);
-})(gi);
-var gs = gi.exports;
-const K = /* @__PURE__ */ ns(gs);
-function mi(t) {
-  return K.isBN(t);
-}
-function ms(t) {
-  return !!t && typeof t == "object";
-}
-function pi(...t) {
-  return (e) => (ms(e) || Yr(e)) && t.every((r) => Yr(e[r]));
-}
-const yi = /* @__PURE__ */ pi("toBigInt"), vi = /* @__PURE__ */ pi("toBn");
-function ps(t) {
-  return typeof t == "bigint" ? t : t ? te(t) ? ws(t.toString()) : mi(t) ? W(t.toString()) : yi(t) ? t.toBigInt() : vi(t) ? W(t.toBn().toString()) : W(t) : W(0);
-}
-function Ct(...t) {
-  const e = t.length, r = new Array(e);
-  let o = 0;
-  for (let c = 0; c < e; c++)
-    r[c] = V(t[c]), o += r[c].length;
-  return Re(r, o);
-}
-function Re(t, e = 0) {
-  const r = t.length;
-  let o = 0;
-  if (!e)
-    for (let i = 0; i < r; i++)
-      e += t[i].length;
-  const c = new Uint8Array(e);
-  for (let i = 0; i < r; i++)
-    c.set(t[i], o), o += t[i].length;
-  return c;
-}
-function bi(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 = V(t), o = V(e);
-  if (r.length === o.length) {
-    const c = new DataView(r.buffer, r.byteOffset), i = new DataView(o.buffer, o.byteOffset), w = r.length % 4 | 0, d = r.length - w | 0;
-    for (let y = 0; y < d; y += 4)
-      if (c.getUint32(y) !== i.getUint32(y))
-        return !1;
-    for (let y = d, x = r.length; y < x; y++)
-      if (r[y] !== o[y])
-        return !1;
-    return !0;
-  }
-  return !1;
-}
-function ys(t, e = -1, r = !1) {
-  const o = Math.ceil(e / 8);
-  if (e === -1 || t.length === o)
-    return t;
-  if (t.length > o)
-    return t.subarray(0, o);
-  const c = new Uint8Array(o);
-  return c.set(t, r ? 0 : o - t.length), c;
-}
-function kr(t, { isLe: e = !0, isNegative: r = !1 } = {}) {
-  e || (t = t.slice().reverse());
-  const o = t.length;
-  if (r && o && t[o - 1] & 128)
-    switch (o) {
-      case 0:
-        return new K(0);
-      case 1:
-        return new K((t[0] ^ 255) * -1 - 1);
-      case 2:
-        return new K((t[0] + (t[1] << 8) ^ 65535) * -1 - 1);
-      case 3:
-        return new K((t[0] + (t[1] << 8) + (t[2] << 16) ^ 16777215) * -1 - 1);
-      case 4:
-        return new K((t[0] + (t[1] << 8) + (t[2] << 16) + t[3] * 16777216 ^ 4294967295) * -1 - 1);
-      case 5:
-        return new K(((t[0] + (t[1] << 8) + (t[2] << 16) + t[3] * 16777216 ^ 4294967295) + (t[4] ^ 255) * 4294967296) * -1 - 1);
-      case 6:
-        return new K(((t[0] + (t[1] << 8) + (t[2] << 16) + t[3] * 16777216 ^ 4294967295) + (t[4] + (t[5] << 8) ^ 65535) * 4294967296) * -1 - 1);
-      default:
-        return new K(t, "le").fromTwos(o * 8);
-    }
-  switch (o) {
-    case 0:
-      return new K(0);
-    case 1:
-      return new K(t[0]);
-    case 2:
-      return new K(t[0] + (t[1] << 8));
-    case 3:
-      return new K(t[0] + (t[1] << 8) + (t[2] << 16));
-    case 4:
-      return new K(t[0] + (t[1] << 8) + (t[2] << 16) + t[3] * 16777216);
-    case 5:
-      return new K(t[0] + (t[1] << 8) + (t[2] << 16) + (t[3] + (t[4] << 8)) * 16777216);
-    case 6:
-      return new K(t[0] + (t[1] << 8) + (t[2] << 16) + (t[3] + (t[4] << 8) + (t[5] << 16)) * 16777216);
-    default:
-      return new K(t, "le");
-  }
-}
-const Ur = /* @__PURE__ */ V(`Ethereum Signed Message:
-`), Ie = /* @__PURE__ */ V("<Bytes>"), ke = /* @__PURE__ */ V("</Bytes>"), vs = Ie.length + ke.length;
-function We(t, e) {
-  return t.length >= vs && jt(t.subarray(0, Ie.length), Ie) && jt(t.slice(-ke.length), ke) || e && t.length >= Ur.length && jt(t.subarray(0, Ur.length), Ur);
-}
-function bs(t) {
-  const e = V(t);
-  return We(e, !1) ? e.subarray(Ie.length, e.length - ke.length) : e;
-}
-function xs(t) {
-  const e = V(t);
-  return We(e, !0) ? e : Re([Ie, e, ke]);
-}
-const On = W(256), Es = W(255);
-function Ms(t, e, r) {
-  const o = [], c = r && t < Ke;
-  for (c && (t = (t + Ge) * -Ge); t !== Ke; ) {
-    const i = t % On, w = Number(c ? i ^ Es : i);
-    e ? o.push(w) : o.unshift(w), t = (t - i) / On;
-  }
-  return Uint8Array.from(o);
-}
-function _s(t, { bitLength: e = -1, isLe: r = !0, isNegative: o = !1 } = {}) {
-  const c = ps(t);
-  if (c === Ke)
-    return e === -1 ? new Uint8Array(1) : new Uint8Array(Math.ceil((e || 0) / 8));
-  const i = Ms(c, r, o);
-  if (e === -1)
-    return i;
-  const w = Math.ceil((e || 0) / 8), d = new Uint8Array(w);
-  return o && d.fill(255), d.set(i, r ? 0 : w - i.length), d;
-}
-function Bs(t) {
-  if (!t || t === "0x")
-    return "";
-  if (Bo.test(t))
-    return t.substring(2);
-  if (So.test(t))
-    return t;
-  throw new Error(`Expected hex value to convert, found '${t}'`);
-}
-function Ss(t, { isLe: e = !1, isNegative: r = !1 } = {}) {
-  if (!t || t === "0x")
-    return new K(0);
-  const o = Bs(t), c = new K(o, 16, e ? "le" : "be");
-  return r ? c.fromTwos(o.length * 4) : c;
-}
-const nr = /* @__PURE__ */ new K(1), ir = /* @__PURE__ */ new K(2), Ln = /* @__PURE__ */ new K(1e9);
-Ln.mul(Ln);
-Number.MAX_SAFE_INTEGER;
-function xi(t) {
-  return typeof t == "bigint";
-}
-function Ei(t) {
-  return t ? K.isBN(t) ? t : te(t) ? Ss(t.toString()) : xi(t) ? new K(t.toString()) : vi(t) ? t.toBn() : yi(t) ? new K(t.toBigInt().toString()) : new K(t) : new K(0);
-}
-const As = { bitLength: -1, isLe: !0, isNegative: !1 };
-function zt(t, { bitLength: e = -1, isLe: r = !0, isNegative: o = !1 } = As) {
-  const c = Ei(t), i = Math.ceil(e === -1 ? c.bitLength() / 8 : (e || 0) / 8);
-  if (!t)
-    return e === -1 ? new Uint8Array(1) : new Uint8Array(i);
-  const w = new Uint8Array(i), d = o ? c.toTwos(i * 8) : c;
-  return w.set(d.toArray(r ? "le" : "be", i), 0), w;
-}
-const Is = ir.pow(new K(6)).isub(nr), ks = ir.pow(new K(14)).isub(nr), Us = ir.pow(new K(30)).isub(nr), Ns = { bitLength: 16 }, Rs = { bitLength: 32 };
-function Os(t) {
-  const e = Ei(t);
-  if (e.lte(Is))
-    return new Uint8Array([e.toNumber() << 2]);
-  if (e.lte(ks))
-    return zt(e.shln(2).iadd(nr), Ns);
-  if (e.lte(Us))
-    return zt(e.shln(2).iadd(ir), Rs);
-  const r = zt(e);
-  let o = r.length;
-  for (; r[o - 1] === 0; )
-    o--;
-  if (o < 4)
-    throw new Error("Invalid length, previous checks match anything less than 2^30");
-  return Re([
-    // subtract 4 as minimum (also catered for in decoding)
-    new Uint8Array([(o - 4 << 2) + 3]),
-    r.subarray(0, o)
-  ]);
-}
-function sn(t) {
-  return Re([
-    Os(t.length),
-    t
-  ]);
-}
-function Ls(t) {
-  return typeof t == "string" || t instanceof String;
-}
-function Ts(t) {
-  return typeof t == "number";
-}
-const $s = { 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 Mi(t) {
-  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
-}
-function _i(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 Je(t, e) {
-  if (typeof e != "string")
-    throw new Error(`${t}: string expected`);
-  return !0;
-}
-function Oe(t) {
-  if (!Number.isSafeInteger(t))
-    throw new Error(`invalid integer: ${t}`);
-}
-function Qe(t) {
-  if (!Array.isArray(t))
-    throw new Error("array expected");
-}
-function Fe(t, e) {
-  if (!_i(!0, e))
-    throw new Error(`${t}: array of strings expected`);
-}
-function Bi(t, e) {
-  if (!_i(!1, e))
-    throw new Error(`${t}: array of numbers expected`);
-}
-// @__NO_SIDE_EFFECTS__
-function Si(...t) {
-  const e = (i) => i, r = (i, w) => (d) => i(w(d)), o = t.map((i) => i.encode).reduceRight(r, e), c = t.map((i) => i.decode).reduce(r, e);
-  return { encode: o, decode: c };
-}
-// @__NO_SIDE_EFFECTS__
-function Ai(t) {
-  const e = typeof t == "string" ? t.split("") : t, r = e.length;
-  Fe("alphabet", e);
-  const o = new Map(e.map((c, i) => [c, i]));
-  return {
-    encode: (c) => (Qe(c), c.map((i) => {
-      if (!Number.isSafeInteger(i) || i < 0 || i >= r)
-        throw new Error(`alphabet.encode: digit index outside alphabet "${i}". Allowed: ${t}`);
-      return e[i];
-    })),
-    decode: (c) => (Qe(c), c.map((i) => {
-      Je("alphabet.decode", i);
-      const w = o.get(i);
-      if (w === void 0)
-        throw new Error(`Unknown letter: "${i}". Allowed: ${t}`);
-      return w;
-    }))
-  };
-}
-// @__NO_SIDE_EFFECTS__
-function Ii(t = "") {
-  return Je("join", t), {
-    encode: (e) => (Fe("join.decode", e), e.join(t)),
-    decode: (e) => (Je("join.decode", e), e.split(t))
-  };
-}
-// @__NO_SIDE_EFFECTS__
-function qs(t, e = "=") {
-  return Oe(t), Je("padding", e), {
-    encode(r) {
-      for (Fe("padding.encode", r); r.length * t % 8; )
-        r.push(e);
-      return r;
-    },
-    decode(r) {
-      Fe("padding.decode", r);
-      let o = r.length;
-      if (o * t % 8)
-        throw new Error("padding: invalid, string should have whole number of bytes");
-      for (; o > 0 && r[o - 1] === e; o--)
-        if ((o - 1) * t % 8 === 0)
-          throw new Error("padding: invalid, string has too much padding");
-      return r.slice(0, o);
-    }
-  };
-}
-function Tn(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 (Qe(t), !t.length)
-    return [];
-  let o = 0;
-  const c = [], i = Array.from(t, (d) => {
-    if (Oe(d), d < 0 || d >= e)
-      throw new Error(`invalid integer: ${d}`);
-    return d;
-  }), w = i.length;
-  for (; ; ) {
-    let d = 0, y = !0;
-    for (let x = o; x < w; x++) {
-      const v = i[x], E = e * d, M = E + v;
-      if (!Number.isSafeInteger(M) || E / e !== d || M - v !== E)
-        throw new Error("convertRadix: carry overflow");
-      const U = M / r;
-      d = M % r;
-      const C = Math.floor(U);
-      if (i[x] = C, !Number.isSafeInteger(C) || C * r + d !== M)
-        throw new Error("convertRadix: carry overflow");
-      if (y)
-        C ? y = !1 : o = x;
-      else continue;
-    }
-    if (c.push(d), y)
-      break;
-  }
-  for (let d = 0; d < t.length - 1 && t[d] === 0; d++)
-    c.push(0);
-  return c.reverse();
-}
-const ki = (t, e) => e === 0 ? t : ki(e, t % e), tr = /* @__NO_SIDE_EFFECTS__ */ (t, e) => t + (e - ki(t, e)), Nr = /* @__PURE__ */ (() => {
-  let t = [];
-  for (let e = 0; e < 40; e++)
-    t.push(2 ** e);
-  return t;
-})();
-function $n(t, e, r, o) {
-  if (Qe(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__ */ tr(e, r) > 32)
-    throw new Error(`convertRadix2: carry overflow from=${e} to=${r} carryBits=${/* @__PURE__ */ tr(e, r)}`);
-  let c = 0, i = 0;
-  const w = Nr[e], d = Nr[r] - 1, y = [];
-  for (const x of t) {
-    if (Oe(x), x >= w)
-      throw new Error(`convertRadix2: invalid data word=${x} from=${e}`);
-    if (c = c << e | x, i + e > 32)
-      throw new Error(`convertRadix2: carry overflow pos=${i} from=${e}`);
-    for (i += e; i >= r; i -= r)
-      y.push((c >> i - r & d) >>> 0);
-    const v = Nr[i];
-    if (v === void 0)
-      throw new Error("invalid carry");
-    c &= v - 1;
-  }
-  if (c = c << r - i & d, !o && i >= e)
-    throw new Error("Excess padding");
-  if (!o && c > 0)
-    throw new Error(`Non-zero padding: ${c}`);
-  return o && i > 0 && y.push(c >>> 0), y;
-}
-// @__NO_SIDE_EFFECTS__
-function Ps(t) {
-  Oe(t);
-  const e = 2 ** 8;
-  return {
-    encode: (r) => {
-      if (!Mi(r))
-        throw new Error("radix.encode input should be Uint8Array");
-      return Tn(Array.from(r), e, t);
-    },
-    decode: (r) => (Bi("radix.decode", r), Uint8Array.from(Tn(r, t, e)))
-  };
-}
-// @__NO_SIDE_EFFECTS__
-function Cs(t, e = !1) {
-  if (Oe(t), t <= 0 || t > 32)
-    throw new Error("radix2: bits should be in (0..32]");
-  if (/* @__PURE__ */ tr(8, t) > 32 || /* @__PURE__ */ tr(t, 8) > 32)
-    throw new Error("radix2: carry overflow");
-  return {
-    encode: (r) => {
-      if (!Mi(r))
-        throw new Error("radix2.encode input should be Uint8Array");
-      return $n(Array.from(r), 8, t, !e);
-    },
-    decode: (r) => (Bi("radix2.decode", r), Uint8Array.from($n(r, t, 8, e)))
-  };
-}
-const Zs = /* @__PURE__ */ Si(/* @__PURE__ */ Cs(6), /* @__PURE__ */ Ai("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), /* @__PURE__ */ qs(6), /* @__PURE__ */ Ii("")), Ds = /* @__NO_SIDE_EFFECTS__ */ (t) => /* @__PURE__ */ Si(/* @__PURE__ */ Ps(58), /* @__PURE__ */ Ai(t), /* @__PURE__ */ Ii("")), Hs = /* @__PURE__ */ Ds("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
-function Ui({ coder: t, ipfs: e }, r) {
-  return (o, c) => (r(o, c), t.decode(e && c ? o.substring(1) : o));
-}
-function Ni({ coder: t, ipfs: e }) {
-  return (r, o) => {
-    const c = t.encode(V(r));
-    return e && o ? `${e}${c}` : c;
-  };
-}
-function Ri({ chars: t, ipfs: e, type: r, withPadding: o }) {
-  return (c, i) => {
-    if (typeof c != "string")
-      throw new Error(`Expected ${r} string input`);
-    if (e && i && !c.startsWith(e))
-      throw new Error(`Expected ipfs-compatible ${r} to start with '${e}'`);
-    for (let w = i ? 1 : 0, d = c.length; w < d; w++)
-      if (!t.includes(c[w])) if (o && c[w] === "=") {
-        if (w !== d - 1) {
-          if (c[w + 1] !== "=") throw new Error(`Invalid ${r} padding sequence "${c[w]}${c[w + 1]}" at index ${w}`);
-        }
-      } else
-        throw new Error(`Invalid ${r} character "${c[w]}" (0x${c.charCodeAt(w).toString(16)}) at index ${w}`);
-    return !0;
-  };
-}
-const fn = {
-  chars: "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz",
-  coder: Hs,
-  ipfs: "z",
-  type: "base58"
-}, Vs = /* @__PURE__ */ Ri(fn), zs = /* @__PURE__ */ Ui(fn, Vs), Ys = /* @__PURE__ */ Ni(fn), Xs = ee("SS58PRE");
-function Oi(t) {
-  return he(Ct(Xs, t), 512);
-}
-function js(t) {
-  const e = t[0] & 64 ? 2 : 1, r = e === 1 ? t[0] : (t[0] & 63) << 2 | t[1] >> 6 | (t[1] & 63) << 8, o = [34 + e, 35 + e].includes(t.length), c = t.length - (o ? 2 : 1), i = Oi(t.subarray(0, c));
-  return [(t[0] & 128) === 0 && ![46, 47].includes(t[0]) && (o ? t[t.length - 2] === i[0] && t[t.length - 1] === i[1] : t[t.length - 1] === i[0]), c, e, r];
-}
-const ze = {
-  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 ge(t, e, r = -1) {
-  if (!t)
-    throw new Error("Invalid empty address passed");
-  if (oe(t) || te(t))
-    return V(t);
-  try {
-    const o = zs(t);
-    if (!ze.allowedEncodedLengths.includes(o.length))
-      throw new Error("Invalid decoded address length");
-    const [c, i, w, d] = js(o);
-    if (!c && !e)
-      throw new Error("Invalid decoded address checksum");
-    if (r !== -1 && r !== d)
-      throw new Error(`Expected ss58Format ${r}, received ${d}`);
-    return o.slice(w, i);
-  } catch (o) {
-    throw new Error(`Decoding ${t}: ${o.message}`);
-  }
-}
-const qn = { isLe: !1 }, Rr = { isLe: !0 }, Ks = { bitLength: 32, isLe: !1 }, Or = { bitLength: 32, isLe: !0 }, pe = { bitLength: 256, isLe: !1 }, Gs = { bitLength: 256, isLe: !0 }, Ws = /^\d+$/, Js = 32;
-class an {
-  constructor() {
-    Kt(this, "__internal__chainCode", new Uint8Array(32));
-    Kt(this, "__internal__isHard", !1);
-  }
-  static from(e) {
-    const r = new an(), [o, c] = e.startsWith("/") ? [e.substring(1), !0] : [e, !1];
-    return r.soft(Ws.test(o) ? new K(o, 10) : o), c ? r.harden() : r;
-  }
-  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 Ts(e) || mi(e) || xi(e) ? this.soft(zt(e, Gs)) : te(e) ? this.soft(Se(e)) : Ls(e) ? this.soft(sn(ee(e))) : e.length > Js ? this.soft(he(e)) : (this.__internal__chainCode.fill(0), this.__internal__chainCode.set(e, 0), this);
-  }
-  soften() {
-    return this.__internal__isHard = !1, this;
-  }
-}
-const Qs = /\/(\/?)([^/]+)/g;
-function Li(t) {
-  const e = t.match(Qs), r = [];
-  let o = "";
-  if (e) {
-    o = e.join("");
-    for (const c of e)
-      r.push(an.from(c.substring(1)));
-  }
-  if (o !== t)
-    throw new Error(`Re-constructed path "${o}" does not match input`);
-  return {
-    parts: e,
-    path: r
-  };
-}
-const Fs = /^(\w+( \w+)*)((\/\/?[^/]+)*)(\/\/\/(.*))?$/;
-function tf(t) {
-  const e = t.match(Fs);
-  if (e === null)
-    throw new Error("Unable to match provided value to a secret URI");
-  const [, r, , o, , , c] = e, { path: i } = Li(o);
-  return {
-    derivePath: o,
-    password: c,
-    path: i,
-    phrase: r
-  };
-}
-const ef = sn(ee("Secp256k1HDKD"));
-function rf(t, e) {
-  if (!oe(e) || e.length !== 32)
-    throw new Error("Invalid chainCode passed to derive");
-  return he(Ct(ef, t, e), 256);
-}
-const hn = /* @__PURE__ */ BigInt(0), or = /* @__PURE__ */ BigInt(1), nf = /* @__PURE__ */ BigInt(2);
-function se(t) {
-  return t instanceof Uint8Array || t != null && typeof t == "object" && t.constructor.name === "Uint8Array";
-}
-function Le(t) {
-  if (!se(t))
-    throw new Error("Uint8Array expected");
-}
-function Qt(t, e) {
-  if (typeof e != "boolean")
-    throw new Error(`${t} must be valid boolean, got "${e}".`);
-}
-const of = /* @__PURE__ */ Array.from({ length: 256 }, (t, e) => e.toString(16).padStart(2, "0"));
-function fe(t) {
-  Le(t);
-  let e = "";
-  for (let r = 0; r < t.length; r++)
-    e += of[t[r]];
-  return e;
-}
-function we(t) {
-  const e = t.toString(16);
-  return e.length & 1 ? `0${e}` : e;
-}
-function cn(t) {
-  if (typeof t != "string")
-    throw new Error("hex string expected, got " + typeof t);
-  return BigInt(t === "" ? "0" : `0x${t}`);
-}
-const Gt = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 };
-function Pn(t) {
-  if (t >= Gt._0 && t <= Gt._9)
-    return t - Gt._0;
-  if (t >= Gt._A && t <= Gt._F)
-    return t - (Gt._A - 10);
-  if (t >= Gt._a && t <= Gt._f)
-    return t - (Gt._a - 10);
-}
-function ye(t) {
-  if (typeof t != "string")
-    throw new Error("hex string expected, got " + typeof t);
-  const e = t.length, r = e / 2;
-  if (e % 2)
-    throw new Error("padded hex string expected, got unpadded hex of length " + e);
-  const o = new Uint8Array(r);
-  for (let c = 0, i = 0; c < r; c++, i += 2) {
-    const w = Pn(t.charCodeAt(i)), d = Pn(t.charCodeAt(i + 1));
-    if (w === void 0 || d === void 0) {
-      const y = t[i] + t[i + 1];
-      throw new Error('hex string expected, got non-hex character "' + y + '" at index ' + i);
-    }
-    o[c] = w * 16 + d;
-  }
-  return o;
-}
-function ie(t) {
-  return cn(fe(t));
-}
-function me(t) {
-  return Le(t), cn(fe(Uint8Array.from(t).reverse()));
-}
-function ve(t, e) {
-  return ye(t.toString(16).padStart(e * 2, "0"));
-}
-function Ue(t, e) {
-  return ve(t, e).reverse();
-}
-function sf(t) {
-  return ye(we(t));
-}
-function Tt(t, e, r) {
-  let o;
-  if (typeof e == "string")
-    try {
-      o = ye(e);
-    } catch (i) {
-      throw new Error(`${t} must be valid hex string, got "${e}". Cause: ${i}`);
-    }
-  else if (se(e))
-    o = Uint8Array.from(e);
-  else
-    throw new Error(`${t} must be hex string or Uint8Array`);
-  const c = o.length;
-  if (typeof r == "number" && c !== r)
-    throw new Error(`${t} expected ${r} bytes, got ${c}`);
-  return o;
-}
-function ae(...t) {
-  let e = 0;
-  for (let o = 0; o < t.length; o++) {
-    const c = t[o];
-    Le(c), e += c.length;
-  }
-  const r = new Uint8Array(e);
-  for (let o = 0, c = 0; o < t.length; o++) {
-    const i = t[o];
-    r.set(i, c), c += i.length;
-  }
-  return r;
-}
-function ff(t, e) {
-  if (t.length !== e.length)
-    return !1;
-  let r = 0;
-  for (let o = 0; o < t.length; o++)
-    r |= t[o] ^ e[o];
-  return r === 0;
-}
-function af(t) {
-  if (typeof t != "string")
-    throw new Error(`utf8ToBytes expected string, got ${typeof t}`);
-  return new Uint8Array(new TextEncoder().encode(t));
-}
-const Lr = (t) => typeof t == "bigint" && hn <= t;
-function sr(t, e, r) {
-  return Lr(t) && Lr(e) && Lr(r) && e <= t && t < r;
-}
-function Yt(t, e, r, o) {
-  if (!sr(e, r, o))
-    throw new Error(`expected valid ${t}: ${r} <= n < ${o}, got ${typeof e} ${e}`);
-}
-function Ti(t) {
-  let e;
-  for (e = 0; t > hn; t >>= or, e += 1)
-    ;
-  return e;
-}
-function hf(t, e) {
-  return t >> BigInt(e) & or;
-}
-function cf(t, e, r) {
-  return t | (r ? or : hn) << BigInt(e);
-}
-const ln = (t) => (nf << BigInt(t - 1)) - or, Tr = (t) => new Uint8Array(t), Cn = (t) => Uint8Array.from(t);
-function $i(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 o = Tr(t), c = Tr(t), i = 0;
-  const w = () => {
-    o.fill(1), c.fill(0), i = 0;
-  }, d = (...E) => r(c, o, ...E), y = (E = Tr()) => {
-    c = d(Cn([0]), E), o = d(), E.length !== 0 && (c = d(Cn([1]), E), o = d());
-  }, x = () => {
-    if (i++ >= 1e3)
-      throw new Error("drbg: tried 1000 values");
-    let E = 0;
-    const M = [];
-    for (; E < e; ) {
-      o = d();
-      const U = o.slice();
-      M.push(U), E += o.length;
-    }
-    return ae(...M);
-  };
-  return (E, M) => {
-    w(), y(E);
-    let U;
-    for (; !(U = M(x())); )
-      y();
-    return w(), U;
-  };
-}
-const lf = {
-  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" || se(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 xe(t, e, r = {}) {
-  const o = (c, i, w) => {
-    const d = lf[i];
-    if (typeof d != "function")
-      throw new Error(`Invalid validator "${i}", expected function`);
-    const y = t[c];
-    if (!(w && y === void 0) && !d(y, t))
-      throw new Error(`Invalid param ${String(c)}=${y} (${typeof y}), expected ${i}`);
-  };
-  for (const [c, i] of Object.entries(e))
-    o(c, i, !1);
-  for (const [c, i] of Object.entries(r))
-    o(c, i, !0);
-  return t;
-}
-const uf = () => {
-  throw new Error("not implemented");
-};
-function Ne(t) {
-  const e = /* @__PURE__ */ new WeakMap();
-  return (r, ...o) => {
-    const c = e.get(r);
-    if (c !== void 0)
-      return c;
-    const i = t(r, ...o);
-    return e.set(r, i), i;
-  };
-}
-const df = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
-  __proto__: null,
-  aInRange: Yt,
-  abool: Qt,
-  abytes: Le,
-  bitGet: hf,
-  bitLen: Ti,
-  bitMask: ln,
-  bitSet: cf,
-  bytesToHex: fe,
-  bytesToNumberBE: ie,
-  bytesToNumberLE: me,
-  concatBytes: ae,
-  createHmacDrbg: $i,
-  ensureBytes: Tt,
-  equalBytes: ff,
-  hexToBytes: ye,
-  hexToNumber: cn,
-  inRange: sr,
-  isBytes: se,
-  memoized: Ne,
-  notImplemented: uf,
-  numberToBytesBE: ve,
-  numberToBytesLE: Ue,
-  numberToHexUnpadded: we,
-  numberToVarBytesBE: sf,
-  utf8ToBytes: af,
-  validateObject: xe
-}, Symbol.toStringTag, { value: "Module" }));
-const Pt = BigInt(0), ft = BigInt(1), ne = BigInt(2), wf = BigInt(3), jr = BigInt(4), Zn = BigInt(5), Dn = BigInt(8);
-BigInt(9);
-BigInt(16);
-function tt(t, e) {
-  const r = t % e;
-  return r >= Pt ? r : e + r;
-}
-function gf(t, e, r) {
-  if (r <= Pt || e < Pt)
-    throw new Error("Expected power/modulo > 0");
-  if (r === ft)
-    return Pt;
-  let o = ft;
-  for (; e > Pt; )
-    e & ft && (o = o * t % r), t = t * t % r, e >>= ft;
-  return o;
-}
-function ut(t, e, r) {
-  let o = t;
-  for (; e-- > Pt; )
-    o *= o, o %= r;
-  return o;
-}
-function Kr(t, e) {
-  if (t === Pt || e <= Pt)
-    throw new Error(`invert: expected positive integers, got n=${t} mod=${e}`);
-  let r = tt(t, e), o = e, c = Pt, i = ft;
-  for (; r !== Pt; ) {
-    const d = o / r, y = o % r, x = c - i * d;
-    o = r, r = y, c = i, i = x;
-  }
-  if (o !== ft)
-    throw new Error("invert: does not exist");
-  return tt(c, e);
-}
-function mf(t) {
-  const e = (t - ft) / ne;
-  let r, o, c;
-  for (r = t - ft, o = 0; r % ne === Pt; r /= ne, o++)
-    ;
-  for (c = ne; c < t && gf(c, e, t) !== t - ft; c++)
-    ;
-  if (o === 1) {
-    const w = (t + ft) / jr;
-    return function(y, x) {
-      const v = y.pow(x, w);
-      if (!y.eql(y.sqr(v), x))
-        throw new Error("Cannot find square root");
-      return v;
-    };
-  }
-  const i = (r + ft) / ne;
-  return function(d, y) {
-    if (d.pow(y, e) === d.neg(d.ONE))
-      throw new Error("Cannot find square root");
-    let x = o, v = d.pow(d.mul(d.ONE, c), r), E = d.pow(y, i), M = d.pow(y, r);
-    for (; !d.eql(M, d.ONE); ) {
-      if (d.eql(M, d.ZERO))
-        return d.ZERO;
-      let U = 1;
-      for (let k = d.sqr(M); U < x && !d.eql(k, d.ONE); U++)
-        k = d.sqr(k);
-      const C = d.pow(v, ft << BigInt(x - U - 1));
-      v = d.sqr(C), E = d.mul(E, C), M = d.mul(M, v), x = U;
-    }
-    return E;
-  };
-}
-function pf(t) {
-  if (t % jr === wf) {
-    const e = (t + ft) / jr;
-    return function(o, c) {
-      const i = o.pow(c, e);
-      if (!o.eql(o.sqr(i), c))
-        throw new Error("Cannot find square root");
-      return i;
-    };
-  }
-  if (t % Dn === Zn) {
-    const e = (t - Zn) / Dn;
-    return function(o, c) {
-      const i = o.mul(c, ne), w = o.pow(i, e), d = o.mul(c, w), y = o.mul(o.mul(d, ne), w), x = o.mul(d, o.sub(y, o.ONE));
-      if (!o.eql(o.sqr(x), c))
-        throw new Error("Cannot find square root");
-      return x;
-    };
-  }
-  return mf(t);
-}
-const yf = (t, e) => (tt(t, e) & ft) === ft, vf = [
-  "create",
-  "isValid",
-  "is0",
-  "neg",
-  "inv",
-  "sqrt",
-  "sqr",
-  "eql",
-  "add",
-  "sub",
-  "mul",
-  "pow",
-  "div",
-  "addN",
-  "subN",
-  "mulN",
-  "sqrN"
-];
-function bf(t) {
-  const e = {
-    ORDER: "bigint",
-    MASK: "bigint",
-    BYTES: "isSafeInteger",
-    BITS: "isSafeInteger"
-  }, r = vf.reduce((o, c) => (o[c] = "function", o), e);
-  return xe(t, r);
-}
-function xf(t, e, r) {
-  if (r < Pt)
-    throw new Error("Expected power > 0");
-  if (r === Pt)
-    return t.ONE;
-  if (r === ft)
-    return e;
-  let o = t.ONE, c = e;
-  for (; r > Pt; )
-    r & ft && (o = t.mul(o, c)), c = t.sqr(c), r >>= ft;
-  return o;
-}
-function Ef(t, e) {
-  const r = new Array(e.length), o = e.reduce((i, w, d) => t.is0(w) ? i : (r[d] = i, t.mul(i, w)), t.ONE), c = t.inv(o);
-  return e.reduceRight((i, w, d) => t.is0(w) ? i : (r[d] = t.mul(i, r[d]), t.mul(i, w)), c), r;
-}
-function qi(t, e) {
-  const r = e !== void 0 ? e : t.toString(2).length, o = Math.ceil(r / 8);
-  return { nBitLength: r, nByteLength: o };
-}
-function fr(t, e, r = !1, o = {}) {
-  if (t <= Pt)
-    throw new Error(`Expected Field ORDER > 0, got ${t}`);
-  const { nBitLength: c, nByteLength: i } = qi(t, e);
-  if (i > 2048)
-    throw new Error("Field lengths over 2048 bytes are not supported");
-  const w = pf(t), d = Object.freeze({
-    ORDER: t,
-    BITS: c,
-    BYTES: i,
-    MASK: ln(c),
-    ZERO: Pt,
-    ONE: ft,
-    create: (y) => tt(y, t),
-    isValid: (y) => {
-      if (typeof y != "bigint")
-        throw new Error(`Invalid field element: expected bigint, got ${typeof y}`);
-      return Pt <= y && y < t;
-    },
-    is0: (y) => y === Pt,
-    isOdd: (y) => (y & ft) === ft,
-    neg: (y) => tt(-y, t),
-    eql: (y, x) => y === x,
-    sqr: (y) => tt(y * y, t),
-    add: (y, x) => tt(y + x, t),
-    sub: (y, x) => tt(y - x, t),
-    mul: (y, x) => tt(y * x, t),
-    pow: (y, x) => xf(d, y, x),
-    div: (y, x) => tt(y * Kr(x, t), t),
-    // Same as above, but doesn't normalize
-    sqrN: (y) => y * y,
-    addN: (y, x) => y + x,
-    subN: (y, x) => y - x,
-    mulN: (y, x) => y * x,
-    inv: (y) => Kr(y, t),
-    sqrt: o.sqrt || ((y) => w(d, y)),
-    invertBatch: (y) => Ef(d, y),
-    // TODO: do we really need constant cmov?
-    // We don't have const-time bigints anyway, so probably will be not very useful
-    cmov: (y, x, v) => v ? x : y,
-    toBytes: (y) => r ? Ue(y, i) : ve(y, i),
-    fromBytes: (y) => {
-      if (y.length !== i)
-        throw new Error(`Fp.fromBytes: expected ${i}, got ${y.length}`);
-      return r ? me(y) : ie(y);
-    }
-  });
-  return Object.freeze(d);
-}
-function Pi(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 Ci(t) {
-  const e = Pi(t);
-  return e + Math.ceil(e / 2);
-}
-function Mf(t, e, r = !1) {
-  const o = t.length, c = Pi(e), i = Ci(e);
-  if (o < 16 || o < i || o > 1024)
-    throw new Error(`expected ${i}-1024 bytes of input, got ${o}`);
-  const w = r ? ie(t) : me(t), d = tt(w, e - ft) + ft;
-  return r ? Ue(d, c) : ve(d, c);
-}
-const _f = BigInt(0), $r = BigInt(1), qr = /* @__PURE__ */ new WeakMap(), Hn = /* @__PURE__ */ new WeakMap();
-function Zi(t, e) {
-  const r = (i, w) => {
-    const d = w.negate();
-    return i ? d : w;
-  }, o = (i) => {
-    if (!Number.isSafeInteger(i) || i <= 0 || i > e)
-      throw new Error(`Wrong window size=${i}, should be [1..${e}]`);
-  }, c = (i) => {
-    o(i);
-    const w = Math.ceil(e / i) + 1, d = 2 ** (i - 1);
-    return { windows: w, windowSize: d };
-  };
-  return {
-    constTimeNegate: r,
-    // non-const time multiplication ladder
-    unsafeLadder(i, w) {
-      let d = t.ZERO, y = i;
-      for (; w > _f; )
-        w & $r && (d = d.add(y)), y = y.double(), w >>= $r;
-      return d;
-    },
-    /**
-     * 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.
-     * @returns precomputed point tables flattened to a single array
-     */
-    precomputeWindow(i, w) {
-      const { windows: d, windowSize: y } = c(w), x = [];
-      let v = i, E = v;
-      for (let M = 0; M < d; M++) {
-        E = v, x.push(E);
-        for (let U = 1; U < y; U++)
-          E = E.add(v), x.push(E);
-        v = E.double();
-      }
-      return x;
-    },
-    /**
-     * 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(i, w, d) {
-      const { windows: y, windowSize: x } = c(i);
-      let v = t.ZERO, E = t.BASE;
-      const M = BigInt(2 ** i - 1), U = 2 ** i, C = BigInt(i);
-      for (let k = 0; k < y; k++) {
-        const _ = k * x;
-        let S = Number(d & M);
-        d >>= C, S > x && (S -= U, d += $r);
-        const L = _, A = _ + Math.abs(S) - 1, q = k % 2 !== 0, D = S < 0;
-        S === 0 ? E = E.add(r(q, w[L])) : v = v.add(r(D, w[A]));
-      }
-      return { p: v, f: E };
-    },
-    wNAFCached(i, w, d) {
-      const y = Hn.get(i) || 1;
-      let x = qr.get(i);
-      return x || (x = this.precomputeWindow(i, y), y !== 1 && qr.set(i, d(x))), this.wNAF(y, x, w);
-    },
-    // 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(i, w) {
-      o(w), Hn.set(i, w), qr.delete(i);
-    }
-  };
-}
-function Di(t, e, r, o) {
-  if (!Array.isArray(r) || !Array.isArray(o) || o.length !== r.length)
-    throw new Error("arrays of points and scalars must have equal length");
-  o.forEach((v, E) => {
-    if (!e.isValid(v))
-      throw new Error(`wrong scalar at index ${E}`);
-  }), r.forEach((v, E) => {
-    if (!(v instanceof t))
-      throw new Error(`wrong point at index ${E}`);
-  });
-  const c = Ti(BigInt(r.length)), i = c > 12 ? c - 3 : c > 4 ? c - 2 : c ? 2 : 1, w = (1 << i) - 1, d = new Array(w + 1).fill(t.ZERO), y = Math.floor((e.BITS - 1) / i) * i;
-  let x = t.ZERO;
-  for (let v = y; v >= 0; v -= i) {
-    d.fill(t.ZERO);
-    for (let M = 0; M < o.length; M++) {
-      const U = o[M], C = Number(U >> BigInt(v) & BigInt(w));
-      d[C] = d[C].add(r[M]);
-    }
-    let E = t.ZERO;
-    for (let M = d.length - 1, U = t.ZERO; M > 0; M--)
-      U = U.add(d[M]), E = E.add(U);
-    if (x = x.add(E), v !== 0)
-      for (let M = 0; M < i; M++)
-        x = x.double();
-  }
-  return x;
-}
-function un(t) {
-  return bf(t.Fp), xe(t, {
-    n: "bigint",
-    h: "bigint",
-    Gx: "field",
-    Gy: "field"
-  }, {
-    nBitLength: "isSafeInteger",
-    nByteLength: "isSafeInteger"
-  }), Object.freeze({
-    ...qi(t.n, t.nBitLength),
-    ...t,
-    p: t.Fp.ORDER
-  });
-}
-function Vn(t) {
-  t.lowS !== void 0 && Qt("lowS", t.lowS), t.prehash !== void 0 && Qt("prehash", t.prehash);
-}
-function Bf(t) {
-  const e = un(t);
-  xe(e, {
-    a: "field",
-    b: "field"
-  }, {
-    allowedPrivateKeyLengths: "array",
-    wrapPrivateKey: "boolean",
-    isTorsionFree: "function",
-    clearCofactor: "function",
-    allowInfinityPoint: "boolean",
-    fromBytes: "function",
-    toBytes: "function"
-  });
-  const { endo: r, Fp: o, a: c } = e;
-  if (r) {
-    if (!o.eql(c, o.ZERO))
-      throw new Error("Endomorphism can only be defined for Koblitz curves that have a=0");
-    if (typeof r != "object" || typeof r.beta != "bigint" || typeof r.splitScalar != "function")
-      throw new Error("Expected endomorphism with beta: bigint and splitScalar: function");
-  }
-  return Object.freeze({ ...e });
-}
-const { bytesToNumberBE: Sf, hexToBytes: Af } = df, Wt = {
-  // asn.1 DER encoding utils
-  Err: class extends Error {
-    constructor(e = "") {
-      super(e);
-    }
-  },
-  // Basic building block is TLV (Tag-Length-Value)
-  _tlv: {
-    encode: (t, e) => {
-      const { Err: r } = Wt;
-      if (t < 0 || t > 256)
-        throw new r("tlv.encode: wrong tag");
-      if (e.length & 1)
-        throw new r("tlv.encode: unpadded data");
-      const o = e.length / 2, c = we(o);
-      if (c.length / 2 & 128)
-        throw new r("tlv.encode: long form length too big");
-      const i = o > 127 ? we(c.length / 2 | 128) : "";
-      return `${we(t)}${i}${c}${e}`;
-    },
-    // v - value, l - left bytes (unparsed)
-    decode(t, e) {
-      const { Err: r } = Wt;
-      let o = 0;
-      if (t < 0 || t > 256)
-        throw new r("tlv.encode: wrong tag");
-      if (e.length < 2 || e[o++] !== t)
-        throw new r("tlv.decode: wrong tlv");
-      const c = e[o++], i = !!(c & 128);
-      let w = 0;
-      if (!i)
-        w = c;
-      else {
-        const y = c & 127;
-        if (!y)
-          throw new r("tlv.decode(long): indefinite length not supported");
-        if (y > 4)
-          throw new r("tlv.decode(long): byte length is too big");
-        const x = e.subarray(o, o + y);
-        if (x.length !== y)
-          throw new r("tlv.decode: length bytes not complete");
-        if (x[0] === 0)
-          throw new r("tlv.decode(long): zero leftmost byte");
-        for (const v of x)
-          w = w << 8 | v;
-        if (o += y, w < 128)
-          throw new r("tlv.decode(long): not minimal encoding");
-      }
-      const d = e.subarray(o, o + w);
-      if (d.length !== w)
-        throw new r("tlv.decode: wrong value length");
-      return { v: d, l: e.subarray(o + w) };
-    }
-  },
-  // 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 } = Wt;
-      if (t < Jt)
-        throw new e("integer: negative integers are not allowed");
-      let r = we(t);
-      if (Number.parseInt(r[0], 16) & 8 && (r = "00" + r), r.length & 1)
-        throw new e("unexpected assertion");
-      return r;
-    },
-    decode(t) {
-      const { Err: e } = Wt;
-      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 Sf(t);
-    }
-  },
-  toSig(t) {
-    const { Err: e, _int: r, _tlv: o } = Wt, c = typeof t == "string" ? Af(t) : t;
-    Le(c);
-    const { v: i, l: w } = o.decode(48, c);
-    if (w.length)
-      throw new e("Invalid signature: left bytes after parsing");
-    const { v: d, l: y } = o.decode(2, i), { v: x, l: v } = o.decode(2, y);
-    if (v.length)
-      throw new e("Invalid signature: left bytes after parsing");
-    return { r: r.decode(d), s: r.decode(x) };
-  },
-  hexFromSig(t) {
-    const { _tlv: e, _int: r } = Wt, o = `${e.encode(2, r.encode(t.r))}${e.encode(2, r.encode(t.s))}`;
-    return e.encode(48, o);
-  }
-}, Jt = BigInt(0), qt = BigInt(1), k0 = BigInt(2), zn = BigInt(3), U0 = BigInt(4);
-function If(t) {
-  const e = Bf(t), { Fp: r } = e, o = fr(e.n, e.nBitLength), c = e.toBytes || ((k, _, S) => {
-    const L = _.toAffine();
-    return ae(Uint8Array.from([4]), r.toBytes(L.x), r.toBytes(L.y));
-  }), i = e.fromBytes || ((k) => {
-    const _ = k.subarray(1), S = r.fromBytes(_.subarray(0, r.BYTES)), L = r.fromBytes(_.subarray(r.BYTES, 2 * r.BYTES));
-    return { x: S, y: L };
-  });
-  function w(k) {
-    const { a: _, b: S } = e, L = r.sqr(k), A = r.mul(L, k);
-    return r.add(r.add(A, r.mul(k, _)), S);
-  }
-  if (!r.eql(r.sqr(e.Gy), w(e.Gx)))
-    throw new Error("bad generator point: equation left != right");
-  function d(k) {
-    return sr(k, qt, e.n);
-  }
-  function y(k) {
-    const { allowedPrivateKeyLengths: _, nByteLength: S, wrapPrivateKey: L, n: A } = e;
-    if (_ && typeof k != "bigint") {
-      if (se(k) && (k = fe(k)), typeof k != "string" || !_.includes(k.length))
-        throw new Error("Invalid key");
-      k = k.padStart(S * 2, "0");
-    }
-    let q;
-    try {
-      q = typeof k == "bigint" ? k : ie(Tt("private key", k, S));
-    } catch {
-      throw new Error(`private key must be ${S} bytes, hex or bigint, not ${typeof k}`);
-    }
-    return L && (q = tt(q, A)), Yt("private key", q, qt, A), q;
-  }
-  function x(k) {
-    if (!(k instanceof M))
-      throw new Error("ProjectivePoint expected");
-  }
-  const v = Ne((k, _) => {
-    const { px: S, py: L, pz: A } = k;
-    if (r.eql(A, r.ONE))
-      return { x: S, y: L };
-    const q = k.is0();
-    _ == null && (_ = q ? r.ONE : r.inv(A));
-    const D = r.mul(S, _), R = r.mul(L, _), O = r.mul(A, _);
-    if (q)
-      return { x: r.ZERO, y: r.ZERO };
-    if (!r.eql(O, r.ONE))
-      throw new Error("invZ was invalid");
-    return { x: D, y: R };
-  }), E = Ne((k) => {
-    if (k.is0()) {
-      if (e.allowInfinityPoint && !r.is0(k.py))
-        return;
-      throw new Error("bad point: ZERO");
-    }
-    const { x: _, y: S } = k.toAffine();
-    if (!r.isValid(_) || !r.isValid(S))
-      throw new Error("bad point: x or y not FE");
-    const L = r.sqr(S), A = w(_);
-    if (!r.eql(L, A))
-      throw new Error("bad point: equation left != right");
-    if (!k.isTorsionFree())
-      throw new Error("bad point: not in prime-order subgroup");
-    return !0;
-  });
-  class M {
-    constructor(_, S, L) {
-      if (this.px = _, this.py = S, this.pz = L, _ == null || !r.isValid(_))
-        throw new Error("x required");
-      if (S == null || !r.isValid(S))
-        throw new Error("y required");
-      if (L == null || !r.isValid(L))
-        throw new Error("z required");
-      Object.freeze(this);
-    }
-    // Does not validate if the point is on-curve.
-    // Use fromHex instead, or call assertValidity() later.
-    static fromAffine(_) {
-      const { x: S, y: L } = _ || {};
-      if (!_ || !r.isValid(S) || !r.isValid(L))
-        throw new Error("invalid affine point");
-      if (_ instanceof M)
-        throw new Error("projective point not allowed");
-      const A = (q) => r.eql(q, r.ZERO);
-      return A(S) && A(L) ? M.ZERO : new M(S, 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 S = r.invertBatch(_.map((L) => L.pz));
-      return _.map((L, A) => L.toAffine(S[A])).map(M.fromAffine);
-    }
-    /**
-     * Converts hash string or Uint8Array to Point.
-     * @param hex short/long ECDSA hex
-     */
-    static fromHex(_) {
-      const S = M.fromAffine(i(Tt("pointHex", _)));
-      return S.assertValidity(), S;
-    }
-    // Multiplies generator point by privateKey.
-    static fromPrivateKey(_) {
-      return M.BASE.multiply(y(_));
-    }
-    // Multiscalar Multiplication
-    static msm(_, S) {
-      return Di(M, o, _, S);
-    }
-    // "Private method", don't use it directly
-    _setWindowSize(_) {
-      C.setWindowSize(this, _);
-    }
-    // A point on curve is valid if it conforms to equation.
-    assertValidity() {
-      E(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(_) {
-      x(_);
-      const { px: S, py: L, pz: A } = this, { px: q, py: D, pz: R } = _, O = r.eql(r.mul(S, R), r.mul(q, A)), $ = r.eql(r.mul(L, R), r.mul(D, A));
-      return O && $;
-    }
-    /**
-     * Flips point to one corresponding to (x, -y) in Affine coordinates.
-     */
-    negate() {
-      return new M(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: S } = e, L = r.mul(S, zn), { px: A, py: q, pz: D } = this;
-      let R = r.ZERO, O = r.ZERO, $ = r.ZERO, P = r.mul(A, A), J = r.mul(q, q), T = r.mul(D, D), Z = r.mul(A, q);
-      return Z = r.add(Z, Z), $ = r.mul(A, D), $ = r.add($, $), R = r.mul(_, $), O = r.mul(L, T), O = r.add(R, O), R = r.sub(J, O), O = r.add(J, O), O = r.mul(R, O), R = r.mul(Z, R), $ = r.mul(L, $), T = r.mul(_, T), Z = r.sub(P, T), Z = r.mul(_, Z), Z = r.add(Z, $), $ = r.add(P, P), P = r.add($, P), P = r.add(P, T), P = r.mul(P, Z), O = r.add(O, P), T = r.mul(q, D), T = r.add(T, T), P = r.mul(T, Z), R = r.sub(R, P), $ = r.mul(T, J), $ = r.add($, $), $ = r.add($, $), new M(R, O, $);
-    }
-    // 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(_) {
-      x(_);
-      const { px: S, py: L, pz: A } = this, { px: q, py: D, pz: R } = _;
-      let O = r.ZERO, $ = r.ZERO, P = r.ZERO;
-      const J = e.a, T = r.mul(e.b, zn);
-      let Z = r.mul(S, q), p = r.mul(L, D), n = r.mul(A, R), f = r.add(S, L), a = r.add(q, D);
-      f = r.mul(f, a), a = r.add(Z, p), f = r.sub(f, a), a = r.add(S, A);
-      let h = r.add(q, R);
-      return a = r.mul(a, h), h = r.add(Z, n), a = r.sub(a, h), h = r.add(L, A), O = r.add(D, R), h = r.mul(h, O), O = r.add(p, n), h = r.sub(h, O), P = r.mul(J, a), O = r.mul(T, n), P = r.add(O, P), O = r.sub(p, P), P = r.add(p, P), $ = r.mul(O, P), p = r.add(Z, Z), p = r.add(p, Z), n = r.mul(J, n), a = r.mul(T, a), p = r.add(p, n), n = r.sub(Z, n), n = r.mul(J, n), a = r.add(a, n), Z = r.mul(p, a), $ = r.add($, Z), Z = r.mul(h, a), O = r.mul(f, O), O = r.sub(O, Z), Z = r.mul(f, p), P = r.mul(h, P), P = r.add(P, Z), new M(O, $, P);
-    }
-    subtract(_) {
-      return this.add(_.negate());
-    }
-    is0() {
-      return this.equals(M.ZERO);
-    }
-    wNAF(_) {
-      return C.wNAFCached(this, _, M.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(_) {
-      Yt("scalar", _, Jt, e.n);
-      const S = M.ZERO;
-      if (_ === Jt)
-        return S;
-      if (_ === qt)
-        return this;
-      const { endo: L } = e;
-      if (!L)
-        return C.unsafeLadder(this, _);
-      let { k1neg: A, k1: q, k2neg: D, k2: R } = L.splitScalar(_), O = S, $ = S, P = this;
-      for (; q > Jt || R > Jt; )
-        q & qt && (O = O.add(P)), R & qt && ($ = $.add(P)), P = P.double(), q >>= qt, R >>= qt;
-      return A && (O = O.negate()), D && ($ = $.negate()), $ = new M(r.mul($.px, L.beta), $.py, $.pz), O.add($);
-    }
-    /**
-     * 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: S, n: L } = e;
-      Yt("scalar", _, qt, L);
-      let A, q;
-      if (S) {
-        const { k1neg: D, k1: R, k2neg: O, k2: $ } = S.splitScalar(_);
-        let { p: P, f: J } = this.wNAF(R), { p: T, f: Z } = this.wNAF($);
-        P = C.constTimeNegate(D, P), T = C.constTimeNegate(O, T), T = new M(r.mul(T.px, S.beta), T.py, T.pz), A = P.add(T), q = J.add(Z);
-      } else {
-        const { p: D, f: R } = this.wNAF(_);
-        A = D, q = R;
-      }
-      return M.normalizeZ([A, 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(_, S, L) {
-      const A = M.BASE, q = (R, O) => O === Jt || O === qt || !R.equals(A) ? R.multiplyUnsafe(O) : R.multiply(O), D = q(this, S).add(q(_, L));
-      return D.is0() ? void 0 : D;
-    }
-    // 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 v(this, _);
-    }
-    isTorsionFree() {
-      const { h: _, isTorsionFree: S } = e;
-      if (_ === qt)
-        return !0;
-      if (S)
-        return S(M, this);
-      throw new Error("isTorsionFree() has not been declared for the elliptic curve");
-    }
-    clearCofactor() {
-      const { h: _, clearCofactor: S } = e;
-      return _ === qt ? this : S ? S(M, this) : this.multiplyUnsafe(e.h);
-    }
-    toRawBytes(_ = !0) {
-      return Qt("isCompressed", _), this.assertValidity(), c(M, this, _);
-    }
-    toHex(_ = !0) {
-      return Qt("isCompressed", _), fe(this.toRawBytes(_));
-    }
-  }
-  M.BASE = new M(e.Gx, e.Gy, r.ONE), M.ZERO = new M(r.ZERO, r.ONE, r.ZERO);
-  const U = e.nBitLength, C = Zi(M, e.endo ? Math.ceil(U / 2) : U);
-  return {
-    CURVE: e,
-    ProjectivePoint: M,
-    normPrivateKeyToScalar: y,
-    weierstrassEquation: w,
-    isWithinCurveOrder: d
-  };
-}
-function kf(t) {
-  const e = un(t);
-  return xe(e, {
-    hash: "hash",
-    hmac: "function",
-    randomBytes: "function"
-  }, {
-    bits2int: "function",
-    bits2int_modN: "function",
-    lowS: "boolean"
-  }), Object.freeze({ lowS: !0, ...e });
-}
-function Uf(t) {
-  const e = kf(t), { Fp: r, n: o } = e, c = r.BYTES + 1, i = 2 * r.BYTES + 1;
-  function w(n) {
-    return tt(n, o);
-  }
-  function d(n) {
-    return Kr(n, o);
-  }
-  const { ProjectivePoint: y, normPrivateKeyToScalar: x, weierstrassEquation: v, isWithinCurveOrder: E } = If({
-    ...e,
-    toBytes(n, f, a) {
-      const h = f.toAffine(), l = r.toBytes(h.x), m = ae;
-      return Qt("isCompressed", a), a ? m(Uint8Array.from([f.hasEvenY() ? 2 : 3]), l) : m(Uint8Array.from([4]), l, r.toBytes(h.y));
-    },
-    fromBytes(n) {
-      const f = n.length, a = n[0], h = n.subarray(1);
-      if (f === c && (a === 2 || a === 3)) {
-        const l = ie(h);
-        if (!sr(l, qt, r.ORDER))
-          throw new Error("Point is not on curve");
-        const m = v(l);
-        let b;
-        try {
-          b = r.sqrt(m);
-        } catch (g) {
-          const B = g instanceof Error ? ": " + g.message : "";
-          throw new Error("Point is not on curve" + B);
-        }
-        const u = (b & qt) === qt;
-        return (a & 1) === 1 !== u && (b = r.neg(b)), { x: l, y: b };
-      } else if (f === i && a === 4) {
-        const l = r.fromBytes(h.subarray(0, r.BYTES)), m = r.fromBytes(h.subarray(r.BYTES, 2 * r.BYTES));
-        return { x: l, y: m };
-      } else
-        throw new Error(`Point of length ${f} was invalid. Expected ${c} compressed bytes or ${i} uncompressed bytes`);
-    }
-  }), M = (n) => fe(ve(n, e.nByteLength));
-  function U(n) {
-    const f = o >> qt;
-    return n > f;
-  }
-  function C(n) {
-    return U(n) ? w(-n) : n;
-  }
-  const k = (n, f, a) => ie(n.slice(f, a));
-  class _ {
-    constructor(f, a, h) {
-      this.r = f, this.s = a, this.recovery = h, this.assertValidity();
-    }
-    // pair (bytes of r, bytes of s)
-    static fromCompact(f) {
-      const a = e.nByteLength;
-      return f = Tt("compactSignature", f, a * 2), new _(k(f, 0, a), k(f, a, 2 * a));
-    }
-    // DER encoded ECDSA signature
-    // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script
-    static fromDER(f) {
-      const { r: a, s: h } = Wt.toSig(Tt("DER", f));
-      return new _(a, h);
-    }
-    assertValidity() {
-      Yt("r", this.r, qt, o), Yt("s", this.s, qt, o);
-    }
-    addRecoveryBit(f) {
-      return new _(this.r, this.s, f);
-    }
-    recoverPublicKey(f) {
-      const { r: a, s: h, recovery: l } = this, m = R(Tt("msgHash", f));
-      if (l == null || ![0, 1, 2, 3].includes(l))
-        throw new Error("recovery id invalid");
-      const b = l === 2 || l === 3 ? a + e.n : a;
-      if (b >= r.ORDER)
-        throw new Error("recovery id 2 or 3 invalid");
-      const u = l & 1 ? "03" : "02", s = y.fromHex(u + M(b)), g = d(b), B = w(-m * g), I = w(h * g), N = y.BASE.multiplyAndAddUnsafe(s, B, I);
-      if (!N)
-        throw new Error("point at infinify");
-      return N.assertValidity(), N;
-    }
-    // Signatures should be low-s, to prevent malleability.
-    hasHighS() {
-      return U(this.s);
-    }
-    normalizeS() {
-      return this.hasHighS() ? new _(this.r, w(-this.s), this.recovery) : this;
-    }
-    // DER-encoded
-    toDERRawBytes() {
-      return ye(this.toDERHex());
-    }
-    toDERHex() {
-      return Wt.hexFromSig({ r: this.r, s: this.s });
-    }
-    // padded bytes of r, then padded bytes of s
-    toCompactRawBytes() {
-      return ye(this.toCompactHex());
-    }
-    toCompactHex() {
-      return M(this.r) + M(this.s);
-    }
-  }
-  const S = {
-    isValidPrivateKey(n) {
-      try {
-        return x(n), !0;
-      } catch {
-        return !1;
-      }
-    },
-    normPrivateKeyToScalar: x,
-    /**
-     * Produces cryptographically secure private key from random of size
-     * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.
-     */
-    randomPrivateKey: () => {
-      const n = Ci(e.n);
-      return Mf(e.randomBytes(n), 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(n = 8, f = y.BASE) {
-      return f._setWindowSize(n), f.multiply(BigInt(3)), f;
-    }
-  };
-  function L(n, f = !0) {
-    return y.fromPrivateKey(n).toRawBytes(f);
-  }
-  function A(n) {
-    const f = se(n), a = typeof n == "string", h = (f || a) && n.length;
-    return f ? h === c || h === i : a ? h === 2 * c || h === 2 * i : n instanceof y;
-  }
-  function q(n, f, a = !0) {
-    if (A(n))
-      throw new Error("first arg must be private key");
-    if (!A(f))
-      throw new Error("second arg must be public key");
-    return y.fromHex(f).multiply(x(n)).toRawBytes(a);
-  }
-  const D = e.bits2int || function(n) {
-    const f = ie(n), a = n.length * 8 - e.nBitLength;
-    return a > 0 ? f >> BigInt(a) : f;
-  }, R = e.bits2int_modN || function(n) {
-    return w(D(n));
-  }, O = ln(e.nBitLength);
-  function $(n) {
-    return Yt(`num < 2^${e.nBitLength}`, n, Jt, O), ve(n, e.nByteLength);
-  }
-  function P(n, f, a = J) {
-    if (["recovered", "canonical"].some((H) => H in a))
-      throw new Error("sign() legacy options not supported");
-    const { hash: h, randomBytes: l } = e;
-    let { lowS: m, prehash: b, extraEntropy: u } = a;
-    m == null && (m = !0), n = Tt("msgHash", n), Vn(a), b && (n = Tt("prehashed msgHash", h(n)));
-    const s = R(n), g = x(f), B = [$(g), $(s)];
-    if (u != null && u !== !1) {
-      const H = u === !0 ? l(r.BYTES) : u;
-      B.push(Tt("extraEntropy", H));
-    }
-    const I = ae(...B), N = s;
-    function j(H) {
-      const z = D(H);
-      if (!E(z))
-        return;
-      const $t = d(z), X = y.BASE.multiply(z).toAffine(), Y = w(X.x);
-      if (Y === Jt)
-        return;
-      const Zt = w($t * w(N + Y * g));
-      if (Zt === Jt)
-        return;
-      let Q = (X.x === Y ? 0 : 2) | Number(X.y & qt), F = Zt;
-      return m && U(Zt) && (F = C(Zt), Q ^= 1), new _(Y, F, Q);
-    }
-    return { seed: I, k2sig: j };
-  }
-  const J = { lowS: e.lowS, prehash: !1 }, T = { lowS: e.lowS, prehash: !1 };
-  function Z(n, f, a = J) {
-    const { seed: h, k2sig: l } = P(n, f, a), m = e;
-    return $i(m.hash.outputLen, m.nByteLength, m.hmac)(h, l);
-  }
-  y.BASE._setWindowSize(8);
-  function p(n, f, a, h = T) {
-    var X;
-    const l = n;
-    if (f = Tt("msgHash", f), a = Tt("publicKey", a), "strict" in h)
-      throw new Error("options.strict was renamed to lowS");
-    Vn(h);
-    const { lowS: m, prehash: b } = h;
-    let u, s;
-    try {
-      if (typeof l == "string" || se(l))
-        try {
-          u = _.fromDER(l);
-        } catch (Y) {
-          if (!(Y instanceof Wt.Err))
-            throw Y;
-          u = _.fromCompact(l);
-        }
-      else if (typeof l == "object" && typeof l.r == "bigint" && typeof l.s == "bigint") {
-        const { r: Y, s: Zt } = l;
-        u = new _(Y, Zt);
-      } else
-        throw new Error("PARSE");
-      s = y.fromHex(a);
-    } catch (Y) {
-      if (Y.message === "PARSE")
-        throw new Error("signature must be Signature instance, Uint8Array or hex string");
-      return !1;
-    }
-    if (m && u.hasHighS())
-      return !1;
-    b && (f = e.hash(f));
-    const { r: g, s: B } = u, I = R(f), N = d(B), j = w(I * N), H = w(g * N), z = (X = y.BASE.multiplyAndAddUnsafe(s, j, H)) == null ? void 0 : X.toAffine();
-    return z ? w(z.x) === g : !1;
-  }
-  return {
-    CURVE: e,
-    getPublicKey: L,
-    getSharedSecret: q,
-    sign: Z,
-    verify: p,
-    ProjectivePoint: y,
-    Signature: _,
-    utils: S
-  };
-}
-function Nf(t) {
-  return {
-    hash: t,
-    hmac: (e, ...r) => li(t, e, po(...r)),
-    randomBytes: ci
-  };
-}
-function Rf(t, e) {
-  const r = (o) => Uf({ ...t, ...Nf(o) });
-  return Object.freeze({ ...r(e), create: r });
-}
-const Hi = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), Yn = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), Of = BigInt(1), Gr = BigInt(2), Xn = (t, e) => (t + e / Gr) / e;
-function Lf(t) {
-  const e = Hi, r = BigInt(3), o = BigInt(6), c = BigInt(11), i = BigInt(22), w = BigInt(23), d = BigInt(44), y = BigInt(88), x = t * t * t % e, v = x * x * t % e, E = ut(v, r, e) * v % e, M = ut(E, r, e) * v % e, U = ut(M, Gr, e) * x % e, C = ut(U, c, e) * U % e, k = ut(C, i, e) * C % e, _ = ut(k, d, e) * k % e, S = ut(_, y, e) * _ % e, L = ut(S, d, e) * k % e, A = ut(L, r, e) * v % e, q = ut(A, w, e) * C % e, D = ut(q, o, e) * x % e, R = ut(D, Gr, e);
-  if (!Wr.eql(Wr.sqr(R), t))
-    throw new Error("Cannot find square root");
-  return R;
-}
-const Wr = fr(Hi, void 0, void 0, { sqrt: Lf }), Te = Rf({
-  a: BigInt(0),
-  // equation params: a, b
-  b: BigInt(7),
-  // Seem to be rigid: bitcointalk.org/index.php?topic=289795.msg3183975#msg3183975
-  Fp: Wr,
-  // Field's prime: 2n**256n - 2n**32n - 2n**9n - 2n**8n - 2n**7n - 2n**6n - 2n**4n - 1n
-  n: Yn,
-  // Curve order, total count of valid points in the field
-  // Base point (x, y) aka generator point
-  Gx: BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),
-  Gy: BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),
-  h: BigInt(1),
-  // Cofactor
-  lowS: !0,
-  // Allow only low-S signatures by default in sign() and verify()
-  /**
-   * secp256k1 belongs to Koblitz curves: it has efficiently computable endomorphism.
-   * Endomorphism uses 2x less RAM, speeds up precomputation by 2x and ECDH / key recovery by 20%.
-   * For precomputed wNAF it trades off 1/2 init time & 1/3 ram for 20% perf hit.
-   * Explanation: https://gist.github.com/paulmillr/eb670806793e84df628a7c434a873066
-   */
-  endo: {
-    beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
-    splitScalar: (t) => {
-      const e = Yn, r = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), o = -Of * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), c = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), i = r, w = BigInt("0x100000000000000000000000000000000"), d = Xn(i * t, e), y = Xn(-o * t, e);
-      let x = tt(t - d * r - y * c, e), v = tt(-d * o - y * i, e);
-      const E = x > w, M = v > w;
-      if (E && (x = e - x), M && (v = e - v), x > w || v > w)
-        throw new Error("splitScalar: Endomorphism failed, k=" + t);
-      return { k1neg: E, k1: x, k2neg: M, k2: v };
-    }
-  }
-}, rr);
-BigInt(0);
-function be(t, e) {
-  if (t.length !== 32)
-    throw new Error("Expected valid 32-byte private key as a seed");
-  if (!Ht || !e && Vt()) {
-    const r = Ao(t), o = r.slice(32);
-    if (bi(o))
-      throw new Error("Invalid publicKey generated from WASM interface");
-    return {
-      publicKey: o,
-      secretKey: r.slice(0, 32)
-    };
-  }
-  return {
-    publicKey: Te.getPublicKey(t, !0),
-    secretKey: t
-  };
-}
-function Vi(t, e) {
-  return (r, { chainCode: o, isHard: c }) => {
-    if (!c)
-      throw new Error("A soft key was found in the path and is not supported");
-    return t(e(r.secretKey.subarray(0, 32), o));
-  };
-}
-const jn = /* @__PURE__ */ Vi(be, rf), Tf = sn(ee("Ed25519HDKD"));
-function $f(t, e) {
-  if (!oe(e) || e.length !== 32)
-    throw new Error("Invalid chainCode passed to derive");
-  return he(Ct(Tf, t, e));
-}
-const Xt = BigInt(0), Dt = BigInt(1), Ze = BigInt(2), qf = BigInt(8), Pf = { zip215: !0 };
-function Cf(t) {
-  const e = un(t);
-  return xe(t, {
-    hash: "function",
-    a: "bigint",
-    d: "bigint",
-    randomBytes: "function"
-  }, {
-    adjustScalarBytes: "function",
-    domain: "function",
-    uvRatio: "function",
-    mapToCurve: "function"
-  }), Object.freeze({ ...e });
-}
-function Zf(t) {
-  const e = Cf(t), { Fp: r, n: o, prehash: c, hash: i, randomBytes: w, nByteLength: d, h: y } = e, x = Ze << BigInt(d * 8) - Dt, v = r.create, E = fr(e.n, e.nBitLength), M = e.uvRatio || ((a, h) => {
-    try {
-      return { isValid: !0, value: r.sqrt(a * r.inv(h)) };
-    } catch {
-      return { isValid: !1, value: Xt };
-    }
-  }), U = e.adjustScalarBytes || ((a) => a), C = e.domain || ((a, h, l) => {
-    if (Qt("phflag", l), h.length || l)
-      throw new Error("Contexts/pre-hash are not supported");
-    return a;
-  });
-  function k(a, h) {
-    Yt("coordinate " + a, h, Xt, x);
-  }
-  function _(a) {
-    if (!(a instanceof A))
-      throw new Error("ExtendedPoint expected");
-  }
-  const S = Ne((a, h) => {
-    const { ex: l, ey: m, ez: b } = a, u = a.is0();
-    h == null && (h = u ? qf : r.inv(b));
-    const s = v(l * h), g = v(m * h), B = v(b * h);
-    if (u)
-      return { x: Xt, y: Dt };
-    if (B !== Dt)
-      throw new Error("invZ was invalid");
-    return { x: s, y: g };
-  }), L = Ne((a) => {
-    const { a: h, d: l } = e;
-    if (a.is0())
-      throw new Error("bad point: ZERO");
-    const { ex: m, ey: b, ez: u, et: s } = a, g = v(m * m), B = v(b * b), I = v(u * u), N = v(I * I), j = v(g * h), H = v(I * v(j + B)), z = v(N + v(l * v(g * B)));
-    if (H !== z)
-      throw new Error("bad point: equation left != right (1)");
-    const $t = v(m * b), X = v(u * s);
-    if ($t !== X)
-      throw new Error("bad point: equation left != right (2)");
-    return !0;
-  });
-  class A {
-    constructor(h, l, m, b) {
-      this.ex = h, this.ey = l, this.ez = m, this.et = b, k("x", h), k("y", l), k("z", m), k("t", b), Object.freeze(this);
-    }
-    get x() {
-      return this.toAffine().x;
-    }
-    get y() {
-      return this.toAffine().y;
-    }
-    static fromAffine(h) {
-      if (h instanceof A)
-        throw new Error("extended point not allowed");
-      const { x: l, y: m } = h || {};
-      return k("x", l), k("y", m), new A(l, m, Dt, v(l * m));
-    }
-    static normalizeZ(h) {
-      const l = r.invertBatch(h.map((m) => m.ez));
-      return h.map((m, b) => m.toAffine(l[b])).map(A.fromAffine);
-    }
-    // Multiscalar Multiplication
-    static msm(h, l) {
-      return Di(A, E, h, l);
-    }
-    // "Private method", don't use it directly
-    _setWindowSize(h) {
-      R.setWindowSize(this, h);
-    }
-    // Not required for fromHex(), which always creates valid points.
-    // Could be useful for fromAffine().
-    assertValidity() {
-      L(this);
-    }
-    // Compare one point to another.
-    equals(h) {
-      _(h);
-      const { ex: l, ey: m, ez: b } = this, { ex: u, ey: s, ez: g } = h, B = v(l * g), I = v(u * b), N = v(m * g), j = v(s * b);
-      return B === I && N === j;
-    }
-    is0() {
-      return this.equals(A.ZERO);
-    }
-    negate() {
-      return new A(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: h } = e, { ex: l, ey: m, ez: b } = this, u = v(l * l), s = v(m * m), g = v(Ze * v(b * b)), B = v(h * u), I = l + m, N = v(v(I * I) - u - s), j = B + s, H = j - g, z = B - s, $t = v(N * H), X = v(j * z), Y = v(N * z), Zt = v(H * j);
-      return new A($t, X, Zt, Y);
-    }
-    // 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(h) {
-      _(h);
-      const { a: l, d: m } = e, { ex: b, ey: u, ez: s, et: g } = this, { ex: B, ey: I, ez: N, et: j } = h;
-      if (l === BigInt(-1)) {
-        const et = v((u - b) * (I + B)), rt = v((u + b) * (I - B)), ce = v(rt - et);
-        if (ce === Xt)
-          return this.double();
-        const nt = v(s * Ze * j), it = v(g * Ze * N), Ee = it + nt, ot = rt + et, st = it - nt, Pe = v(Ee * ce), ct = v(ot * st), lt = v(Ee * st), Ce = v(ce * ot);
-        return new A(Pe, ct, Ce, lt);
-      }
-      const H = v(b * B), z = v(u * I), $t = v(g * m * j), X = v(s * N), Y = v((b + u) * (B + I) - H - z), Zt = X - $t, Q = X + $t, F = v(z - l * H), $e = v(Y * Zt), at = v(Q * F), ht = v(Y * F), qe = v(Zt * Q);
-      return new A($e, at, qe, ht);
-    }
-    subtract(h) {
-      return this.add(h.negate());
-    }
-    wNAF(h) {
-      return R.wNAFCached(this, h, A.normalizeZ);
-    }
-    // Constant-time multiplication.
-    multiply(h) {
-      const l = h;
-      Yt("scalar", l, Dt, o);
-      const { p: m, f: b } = this.wNAF(l);
-      return A.normalizeZ([m, b])[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.
-    multiplyUnsafe(h) {
-      const l = h;
-      return Yt("scalar", l, Xt, o), l === Xt ? D : this.equals(D) || l === Dt ? this : this.equals(q) ? this.wNAF(l).p : R.unsafeLadder(this, l);
-    }
-    // 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(y).is0();
-    }
-    // Multiplies point by curve order and checks if the result is 0.
-    // Returns `false` is the point is dirty.
-    isTorsionFree() {
-      return R.unsafeLadder(this, o).is0();
-    }
-    // Converts Extended point to default (x, y) coordinates.
-    // Can accept precomputed Z^-1 - for example, from invertBatch.
-    toAffine(h) {
-      return S(this, h);
-    }
-    clearCofactor() {
-      const { h } = e;
-      return h === Dt ? this : this.multiplyUnsafe(h);
-    }
-    // Converts hash string or Uint8Array to Point.
-    // Uses algo from RFC8032 5.1.3.
-    static fromHex(h, l = !1) {
-      const { d: m, a: b } = e, u = r.BYTES;
-      h = Tt("pointHex", h, u), Qt("zip215", l);
-      const s = h.slice(), g = h[u - 1];
-      s[u - 1] = g & -129;
-      const B = me(s), I = l ? x : r.ORDER;
-      Yt("pointHex.y", B, Xt, I);
-      const N = v(B * B), j = v(N - Dt), H = v(m * N - b);
-      let { isValid: z, value: $t } = M(j, H);
-      if (!z)
-        throw new Error("Point.fromHex: invalid y coordinate");
-      const X = ($t & Dt) === Dt, Y = (g & 128) !== 0;
-      if (!l && $t === Xt && Y)
-        throw new Error("Point.fromHex: x=0 and x_0=1");
-      return Y !== X && ($t = v(-$t)), A.fromAffine({ x: $t, y: B });
-    }
-    static fromPrivateKey(h) {
-      return P(h).point;
-    }
-    toRawBytes() {
-      const { x: h, y: l } = this.toAffine(), m = Ue(l, r.BYTES);
-      return m[m.length - 1] |= h & Dt ? 128 : 0, m;
-    }
-    toHex() {
-      return fe(this.toRawBytes());
-    }
-  }
-  A.BASE = new A(e.Gx, e.Gy, Dt, v(e.Gx * e.Gy)), A.ZERO = new A(Xt, Dt, Dt, Xt);
-  const { BASE: q, ZERO: D } = A, R = Zi(A, d * 8);
-  function O(a) {
-    return tt(a, o);
-  }
-  function $(a) {
-    return O(me(a));
-  }
-  function P(a) {
-    const h = d;
-    a = Tt("private key", a, h);
-    const l = Tt("hashed private key", i(a), 2 * h), m = U(l.slice(0, h)), b = l.slice(h, 2 * h), u = $(m), s = q.multiply(u), g = s.toRawBytes();
-    return { head: m, prefix: b, scalar: u, point: s, pointBytes: g };
-  }
-  function J(a) {
-    return P(a).pointBytes;
-  }
-  function T(a = new Uint8Array(), ...h) {
-    const l = ae(...h);
-    return $(i(C(l, Tt("context", a), !!c)));
-  }
-  function Z(a, h, l = {}) {
-    a = Tt("message", a), c && (a = c(a));
-    const { prefix: m, scalar: b, pointBytes: u } = P(h), s = T(l.context, m, a), g = q.multiply(s).toRawBytes(), B = T(l.context, g, u, a), I = O(s + B * b);
-    Yt("signature.s", I, Xt, o);
-    const N = ae(g, Ue(I, r.BYTES));
-    return Tt("result", N, d * 2);
-  }
-  const p = Pf;
-  function n(a, h, l, m = p) {
-    const { context: b, zip215: u } = m, s = r.BYTES;
-    a = Tt("signature", a, 2 * s), h = Tt("message", h), u !== void 0 && Qt("zip215", u), c && (h = c(h));
-    const g = me(a.slice(s, 2 * s));
-    let B, I, N;
-    try {
-      B = A.fromHex(l, u), I = A.fromHex(a.slice(0, s), u), N = q.multiplyUnsafe(g);
-    } catch {
-      return !1;
-    }
-    if (!u && B.isSmallOrder())
-      return !1;
-    const j = T(b, I.toRawBytes(), B.toRawBytes(), h);
-    return I.add(B.multiplyUnsafe(j)).subtract(N).clearCofactor().equals(A.ZERO);
-  }
-  return q._setWindowSize(8), {
-    CURVE: e,
-    getPublicKey: J,
-    sign: Z,
-    verify: n,
-    ExtendedPoint: A,
-    utils: {
-      getExtendedPublicKey: P,
-      // ed25519 private keys are uniform 32b. No need to check for modulo bias, like in secp256k1.
-      randomPrivateKey: () => w(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(a = 8, h = A.BASE) {
-        return h._setWindowSize(a), h.multiply(BigInt(3)), h;
-      }
-    }
-  };
-}
-const N0 = BigInt(0), R0 = BigInt(1);
-const dn = BigInt("57896044618658097711785492504343953926634992332820282019728792003956564819949"), Kn = /* @__PURE__ */ BigInt("19681161376707505956807079304988542015446066515923890162744021073123829784752");
-BigInt(0);
-const Df = BigInt(1), Gn = BigInt(2), O0 = BigInt(3), Hf = BigInt(5), Vf = BigInt(8);
-function zf(t) {
-  const e = BigInt(10), r = BigInt(20), o = BigInt(40), c = BigInt(80), i = dn, d = t * t % i * t % i, y = ut(d, Gn, i) * d % i, x = ut(y, Df, i) * t % i, v = ut(x, Hf, i) * x % i, E = ut(v, e, i) * v % i, M = ut(E, r, i) * E % i, U = ut(M, o, i) * M % i, C = ut(U, c, i) * U % i, k = ut(C, c, i) * U % i, _ = ut(k, e, i) * v % i;
-  return { pow_p_5_8: ut(_, Gn, i) * t % i, b2: d };
-}
-function Yf(t) {
-  return t[0] &= 248, t[31] &= 127, t[31] |= 64, t;
-}
-function Xf(t, e) {
-  const r = dn, o = tt(e * e * e, r), c = tt(o * o * e, r), i = zf(t * c).pow_p_5_8;
-  let w = tt(t * o * i, r);
-  const d = tt(e * w * w, r), y = w, x = tt(w * Kn, r), v = d === t, E = d === tt(-t, r), M = d === tt(-t * Kn, r);
-  return v && (w = y), (E || M) && (w = x), yf(w, r) && (w = tt(-w, r)), { isValid: v || E, value: w };
-}
-const jf = fr(dn, void 0, !0), Kf = {
-  // Param: a
-  a: BigInt(-1),
-  // Fp.create(-1) is proper; our way still works and is faster
-  // d is equal to -121665/121666 over finite field.
-  // Negative number is P - number, and division is invert(number, P)
-  d: BigInt("37095705934669439343138083508754565189542113879843219016388785533085940283555"),
-  // Finite field 𝔽p over which we'll do calculations; 2n**255n - 19n
-  Fp: jf,
-  // Subgroup order: how many points curve has
-  // 2n**252n + 27742317777372353535851937790883648493n;
-  n: BigInt("7237005577332262213973186563042994240857116359379907606001950938285454250989"),
-  // Cofactor
-  h: Vf,
-  // Base point (x, y) aka generator point
-  Gx: BigInt("15112221349535400772501151409588531511454012693041857206046113283949847762202"),
-  Gy: BigInt("46316835694926478169428394003475163141307993866256225615783033603165251855960"),
-  hash: ui,
-  randomBytes: ci,
-  adjustScalarBytes: Yf,
-  // dom2
-  // Ratio of u to v. Allows us to combine inversion and square root. Uses algo from RFC8032 5.1.3.
-  // Constant-time, u/√v
-  uvRatio: Xf
-}, wn = Zf(Kf);
-function gn(t, e) {
-  if (!Ht || !e && Vt()) {
-    const o = Io(t);
-    return {
-      publicKey: o.slice(32),
-      secretKey: o.slice(0, 64)
-    };
-  }
-  const r = wn.getPublicKey(t);
-  return {
-    publicKey: r,
-    secretKey: Re([t, r])
-  };
-}
-function Gf(t, { publicKey: e, secretKey: r }, o) {
-  if (r) {
-    if (!e)
-      throw new Error("Expected a valid publicKey");
-  } else throw new Error("Expected a valid secretKey");
-  const c = V(t), i = r.subarray(0, 32);
-  return !Ht || !o && Vt() ? ko(e, i, c) : wn.sign(c, i);
-}
-function zi(t, e, r, o) {
-  const c = V(t), i = V(r), w = V(e);
-  if (i.length !== 32)
-    throw new Error(`Invalid publicKey, received ${i.length}, expected 32`);
-  if (w.length !== 64)
-    throw new Error(`Invalid signature, received ${w.length} bytes, expected 64`);
-  try {
-    return !Ht || !o && Vt() ? Uo(w, c, i) : wn.verify(w, c, i);
-  } catch {
-    return !1;
-  }
-}
-const Wf = /* @__PURE__ */ Vi(gn, $f), Jr = 64, Jf = 32, Pr = Jr + Jf;
-function Yi(t) {
-  const e = V(t);
-  if (e.length !== Pr)
-    throw new Error(`Expected keypair with ${Pr} bytes, found ${e.length}`);
-  return {
-    publicKey: e.slice(Jr, Pr),
-    secretKey: e.slice(0, Jr)
-  };
-}
-function Qf({ publicKey: t, secretKey: e }) {
-  return Ct(e, t).slice();
-}
-function Xi(t) {
-  return (e, r) => {
-    if (!oe(r) || r.length !== 32)
-      throw new Error("Invalid chainCode passed to derive");
-    return Yi(t(Qf(e), r));
-  };
-}
-const Ff = /* @__PURE__ */ Xi(No), ta = /* @__PURE__ */ Xi(Ro);
-function ea(t, { chainCode: e, isSoft: r }) {
-  return r ? ta(t, e) : Ff(t, e);
-}
-const ra = {
-  ecdsa: jn,
-  ed25519: Wf,
-  // FIXME This is Substrate-compatible, not Ethereum-compatible
-  ethereum: jn,
-  sr25519: ea
-};
-function ji(t, e, r) {
-  const o = ra[r];
-  let c = t;
-  for (const i of e)
-    c = o(c, i);
-  return c;
-}
-function Ki(t) {
-  const e = V(t);
-  if (e.length !== 32)
-    throw new Error(`Expected a seed matching 32 bytes, found ${e.length}`);
-  return Yi(Oo(e));
-}
-function na(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 Lo(e, r, V(t));
-}
-function Gi(t, e, r) {
-  const o = V(r), c = V(e);
-  if (o.length !== 32)
-    throw new Error(`Invalid publicKey, received ${o.length} bytes, expected 32`);
-  if (c.length !== 64)
-    throw new Error(`Invalid signature, received ${c.length} bytes, expected 64`);
-  return To(c, V(t), o);
-}
-const Wn = new Uint8Array();
-function ia(t, { secretKey: e }, r = Wn, o = Wn) {
-  if ((e == null ? void 0 : e.length) !== 64)
-    throw new Error("Invalid secretKey, expected 64-bytes");
-  return $o(e, V(r), V(t), V(o));
-}
-const Jn = new Uint8Array();
-function oa(t, e, r, o = Jn, c = Jn) {
-  const i = V(r), w = V(e);
-  if (i.length !== 32)
-    throw new Error("Invalid publicKey, expected 32-bytes");
-  if (w.length !== 96)
-    throw new Error("Invalid vrfSign output, expected 96 bytes");
-  return qo(i, V(o), V(t), V(c), w);
-}
-function sa(t, e = ze.prefix) {
-  const r = ge(t);
-  if (e < 0 || e > 16383 || [46, 47].includes(e))
-    throw new Error("Out of range ss58Format specified");
-  if (!ze.allowedDecodedLengths.includes(r.length))
-    throw new Error(`Expected a valid key to convert, with length ${ze.allowedDecodedLengths.join(", ")}`);
-  const o = Ct(e < 64 ? [e] : [
-    (e & 252) >> 2 | 64,
-    e >> 8 | (e & 3) << 6
-  ], r);
-  return Ys(Ct(o, Oi(o).subarray(0, [32, 33].includes(r.length) ? 2 : 1)));
-}
-const Wi = [], Ji = [], Qi = [], fa = /* @__PURE__ */ BigInt(0), Me = /* @__PURE__ */ BigInt(1), aa = /* @__PURE__ */ BigInt(2), ha = /* @__PURE__ */ BigInt(7), ca = /* @__PURE__ */ BigInt(256), la = /* @__PURE__ */ BigInt(113);
-for (let t = 0, e = Me, r = 1, o = 0; t < 24; t++) {
-  [r, o] = [o, (2 * r + 3 * o) % 5], Wi.push(2 * (5 * o + r)), Ji.push((t + 1) * (t + 2) / 2 % 64);
-  let c = fa;
-  for (let i = 0; i < 7; i++)
-    e = (e << Me ^ (e >> ha) * la) % ca, e & aa && (c ^= Me << (Me << /* @__PURE__ */ BigInt(i)) - Me);
-  Qi.push(c);
-}
-const [ua, da] = /* @__PURE__ */ Po(Qi, !0), Qn = (t, e, r) => r > 32 ? Co(t, e, r) : Zo(t, e, r), Fn = (t, e, r) => r > 32 ? Do(t, e, r) : Ho(t, e, r);
-function wa(t, e = 24) {
-  const r = new Uint32Array(10);
-  for (let o = 24 - e; o < 24; o++) {
-    for (let w = 0; w < 10; w++)
-      r[w] = t[w] ^ t[w + 10] ^ t[w + 20] ^ t[w + 30] ^ t[w + 40];
-    for (let w = 0; w < 10; w += 2) {
-      const d = (w + 8) % 10, y = (w + 2) % 10, x = r[y], v = r[y + 1], E = Qn(x, v, 1) ^ r[d], M = Fn(x, v, 1) ^ r[d + 1];
-      for (let U = 0; U < 50; U += 10)
-        t[w + U] ^= E, t[w + U + 1] ^= M;
-    }
-    let c = t[2], i = t[3];
-    for (let w = 0; w < 24; w++) {
-      const d = Ji[w], y = Qn(c, i, d), x = Fn(c, i, d), v = Wi[w];
-      c = t[v], i = t[v + 1], t[v] = y, t[v + 1] = x;
-    }
-    for (let w = 0; w < 50; w += 10) {
-      for (let d = 0; d < 10; d++)
-        r[d] = t[w + d];
-      for (let d = 0; d < 10; d++)
-        t[w + d] ^= ~r[(d + 2) % 10] & r[(d + 4) % 10];
-    }
-    t[0] ^= ua[o], t[1] ^= da[o];
-  }
-  r.fill(0);
-}
-class ar extends bo {
-  // NOTE: we accept arguments in bytes instead of bits here.
-  constructor(e, r, o, c = !1, i = 24) {
-    if (super(), this.blockLen = e, this.suffix = r, this.outputLen = o, this.enableXOF = c, this.rounds = i, this.pos = 0, this.posOut = 0, this.finished = !1, this.destroyed = !1, Ft(o), 0 >= this.blockLen || this.blockLen >= 200)
-      throw new Error("Sha3 supports only keccak-f1600 function");
-    this.state = new Uint8Array(200), this.state32 = Ve(this.state);
-  }
-  keccak() {
-    Xe || je(this.state32), wa(this.state32, this.rounds), Xe || je(this.state32), this.posOut = 0, this.pos = 0;
-  }
-  update(e) {
-    kn(this);
-    const { blockLen: r, state: o } = this;
-    e = xo(e);
-    const c = e.length;
-    for (let i = 0; i < c; ) {
-      const w = Math.min(r - this.pos, c - i);
-      for (let d = 0; d < w; d++)
-        o[this.pos++] ^= e[i++];
-      this.pos === r && this.keccak();
-    }
-    return this;
-  }
-  finish() {
-    if (this.finished)
-      return;
-    this.finished = !0;
-    const { state: e, suffix: r, pos: o, blockLen: c } = this;
-    e[o] ^= r, r & 128 && o === c - 1 && this.keccak(), e[c - 1] ^= 128, this.keccak();
-  }
-  writeInto(e) {
-    kn(this, !1), Eo(e), this.finish();
-    const r = this.state, { blockLen: o } = this;
-    for (let c = 0, i = e.length; c < i; ) {
-      this.posOut >= o && this.keccak();
-      const w = Math.min(o - this.posOut, i - c);
-      e.set(r.subarray(this.posOut, this.posOut + w), c), this.posOut += w, c += w;
-    }
-    return e;
-  }
-  xofInto(e) {
-    if (!this.enableXOF)
-      throw new Error("XOF is not possible for this instance");
-    return this.writeInto(e);
-  }
-  xof(e) {
-    return Ft(e), this.xofInto(new Uint8Array(e));
-  }
-  digestInto(e) {
-    if (Mo(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: o, outputLen: c, rounds: i, enableXOF: w } = this;
-    return e || (e = new ar(r, o, c, w, i)), e.state32.set(this.state32), e.pos = this.pos, e.posOut = this.posOut, e.finished = this.finished, e.rounds = i, e.suffix = o, e.outputLen = c, e.enableXOF = w, e.destroyed = this.destroyed, e;
-  }
-}
-const re = (t, e, r) => yo(() => new ar(e, t, r));
-224 / 8;
-256 / 8;
-384 / 8;
-512 / 8;
-224 / 8;
-const ga = /* @__PURE__ */ re(1, 136, 256 / 8);
-384 / 8;
-const ma = /* @__PURE__ */ re(1, 72, 512 / 8), Fi = (t, e, r) => vo((o = {}) => new ar(e, t, o.dkLen === void 0 ? r : o.dkLen, !0));
-128 / 8;
-256 / 8;
-const hr = /* @__PURE__ */ Vo({ 256: Yo, 512: zo }, { 256: ga, 512: ma });
-function Qr(t, e, r) {
-  return t === "keccak" ? hr(e, void 0, r) : he(e, void 0, void 0, r);
-}
-const mn = {
-  chars: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/",
-  coder: Zs,
-  type: "base64",
-  withPadding: !0
-}, pa = /* @__PURE__ */ Ri(mn), ya = /* @__PURE__ */ Ui(mn, pa), va = /* @__PURE__ */ Ni(mn);
-function to(t, e) {
-  if (![33, 65].includes(t.length))
-    throw new Error(`Invalid publicKey provided, received ${t.length} bytes input`);
-  return t.length === 33 ? t : !Ht || Vt() ? Xo(t) : Te.ProjectivePoint.fromHex(t).toRawBytes(!0);
-}
-function pn(t, e) {
-  if (![33, 65].includes(t.length))
-    throw new Error(`Invalid publicKey provided, received ${t.length} bytes input`);
-  if (t.length === 65)
-    return t.subarray(1);
-  if (!Ht || Vt())
-    return jo(t).subarray(1);
-  const { px: r, py: o } = Te.ProjectivePoint.fromHex(t);
-  return Ct(zt(r, pe), zt(o, pe));
-}
-function ba(t, e, r, o = "blake2", c) {
-  const i = V(e).subarray(0, 64), w = V(t), d = !Ht || Vt() ? Ko(w, i, r) : Te.Signature.fromCompact(i).addRecoveryBit(r).recoverPublicKey(w).toRawBytes();
-  if (!d)
-    throw new Error("Unable to recover publicKey from signature");
-  return o === "keccak" ? pn(d) : to(d);
-}
-function ti(t, { secretKey: e }, r = "blake2", o) {
-  if ((e == null ? void 0 : e.length) !== 32)
-    throw new Error("Expected valid secp256k1 secretKey, 32-bytes");
-  const c = Qr(r, t, o);
-  if (!Ht || Vt())
-    return Go(c, e);
-  const i = Te.sign(c, e, { lowS: !0 });
-  return Ct(zt(i.r, pe), zt(i.s, pe), new Uint8Array([i.recovery || 0]));
-}
-const eo = "ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141".replace(/ /g, ""), Cr = W(`0x${eo}`), Zr = new K(eo, "hex");
-function xa(t, e) {
-  let r = Xr(e, qn);
-  if (r >= Cr)
-    throw new Error("Tweak parameter is out of range");
-  if (r += Xr(t, qn), r >= Cr && (r -= Cr), r === Ke)
-    throw new Error("Invalid resulting private key");
-  return _s(r, pe);
-}
-function Ea(t, e) {
-  const r = new K(e);
-  if (r.cmp(Zr) >= 0)
-    throw new Error("Tweak parameter is out of range");
-  if (r.iadd(new K(t)), r.cmp(Zr) >= 0 && r.isub(Zr), r.isZero())
-    throw new Error("Invalid resulting private key");
-  return zt(r, pe);
-}
-function Ma(t, e, r) {
-  if (!oe(t) || t.length !== 32)
-    throw new Error("Expected seckey to be an Uint8Array with length 32");
-  if (!oe(e) || e.length !== 32)
-    throw new Error("Expected tweak to be an Uint8Array with length 32");
-  return !Ht || r ? Ea(t, e) : xa(t, e);
-}
-function _a(t, e, r, o = "blake2", c) {
-  const i = V(e);
-  if (i.length !== 65)
-    throw new Error(`Expected signature with 65 bytes, ${i.length} found instead`);
-  const w = ba(Qr(o, t), i, i[64], o), d = Qr(o, w, c), y = V(r);
-  return jt(w, y) || (o === "keccak" ? jt(d.slice(-20), y.slice(-20)) : jt(d, y));
-}
-function Ba(t) {
-  return [33, 65].includes(t.length) && (t = hr(pn(t))), t.slice(-20);
-}
-function ro(t) {
-  if (!t)
-    return "0x";
-  const e = V(t);
-  if (![20, 32, 33, 65].includes(e.length))
-    throw new Error(`Invalid address or publicKey provided, received ${e.length} bytes input`);
-  const r = Ae(Ba(e), -1, !1), o = Ae(hr(r), -1, !1);
-  let c = "";
-  for (let i = 0; i < 40; i++)
-    c = `${c}${parseInt(o[i], 16) > 7 ? r[i].toUpperCase() : r[i]}`;
-  return `0x${c}`;
-}
-const Sa = {
-  256: rr,
-  512: ui
-}, Aa = {
-  256: Jo,
-  512: Wo
-};
-function no(t, e, r = 256, o) {
-  const c = V(t);
-  return !Ht || Vt() ? Aa[r](c, e) : li(Sa[r], c, e);
-}
-const yn = 2147483648;
-function Ia(t) {
-  if (!t.startsWith("m/"))
-    return !1;
-  const e = t.split("/").slice(1);
-  for (const r of e) {
-    const o = /^\d+'?$/.test(r) ? parseInt(r.replace(/'$/, ""), 10) : Number.NaN;
-    if (isNaN(o) || o >= yn || o < 0)
-      return !1;
-  }
-  return !0;
-}
-const ka = ee("Bitcoin seed");
-function io(t, e) {
-  return {
-    chainCode: e,
-    publicKey: be(t).publicKey,
-    secretKey: t
-  };
-}
-function oo(t, e) {
-  const r = zt(e, Ks), o = e >= yn ? Ct(new Uint8Array(1), t.secretKey, r) : Ct(t.publicKey, r);
-  try {
-    const c = no(t.chainCode, o, 512);
-    return io(Ma(t.secretKey, c.slice(0, 32)), c.slice(32));
-  } catch {
-    return oo(t, e + 1);
-  }
-}
-function Ua(t, e = "") {
-  const r = no(ka, t, 512);
-  let o = io(r.slice(0, 32), r.slice(32));
-  if (!e || e === "m" || e === "M" || e === "m'" || e === "M'")
-    return o;
-  if (!Ia(e))
-    throw new Error("Invalid derivation path");
-  const c = e.split("/").slice(1);
-  for (const i of c)
-    o = oo(o, parseInt(i, 10) + (i.length > 1 && i.endsWith("'") ? yn : 0));
-  return o;
-}
-function Na(t, e, r) {
-  return !Ht || Vt() ? Qo(t) : os(t, e);
-}
-function so(t, e, r) {
-  return !Ht || Vt() ? Fo(t) : ss(t, e);
-}
-function Ra(t, e = "", r, o = 32) {
-  if (so(t)) {
-    if (![32, 64].includes(o))
-      throw new Error(`Invalid seed length ${o}, expected 32 or 64`);
-  } else throw new Error("Invalid bip39 mnemonic specified");
-  return o === 32 ? !Ht || Vt() ? ts(t, e) : Un(t, e).subarray(0, 32) : Un(t, e);
-}
-function Oa(t, e = "", r, o) {
-  if (so(t, r)) {
-    if (Vt())
-      return es(t, e);
-  } else throw new Error("Invalid bip39 mnemonic specified");
-  const c = Na(t, r), i = ee(`mnemonic${e}`);
-  return fs(c, i).password.slice(0, 32);
-}
-function De(t, e) {
-  return t << e | t >>> 32 - e;
-}
-function le(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 Dr(t, e, r) {
-  for (let o = 0; o < 4; o++)
-    t[e + o] = r & 255, r >>>= 8;
-}
-function La(t, e, r, o, c) {
-  let i = 0;
-  for (let w = 0; w < c; w++)
-    i |= t[e + w] ^ r[o + w];
-  return (1 & i - 1 >>> 8) - 1;
-}
-function Fr(t, e, r, o, c) {
-  const i = new Uint32Array(16), w = new Uint32Array(16), d = new Uint32Array(16), y = new Uint32Array(4);
-  let x, v, E;
-  for (x = 0; x < 4; x++)
-    w[5 * x] = le(o, 4 * x), w[1 + x] = le(r, 4 * x), w[6 + x] = le(e, 4 * x), w[11 + x] = le(r, 16 + 4 * x);
-  for (x = 0; x < 16; x++)
-    d[x] = w[x];
-  for (x = 0; x < 20; x++) {
-    for (v = 0; v < 4; v++) {
-      for (E = 0; E < 4; E++)
-        y[E] = w[(5 * v + 4 * E) % 16];
-      for (y[1] ^= De(y[0] + y[3] | 0, 7), y[2] ^= De(y[1] + y[0] | 0, 9), y[3] ^= De(y[2] + y[1] | 0, 13), y[0] ^= De(y[3] + y[2] | 0, 18), E = 0; E < 4; E++)
-        i[4 * v + (v + E) % 4] = y[E];
-    }
-    for (E = 0; E < 16; E++)
-      w[E] = i[E];
-  }
-  if (c) {
-    for (x = 0; x < 16; x++)
-      w[x] = w[x] + d[x] | 0;
-    for (x = 0; x < 4; x++)
-      w[5 * x] = w[5 * x] - le(o, 4 * x) | 0, w[6 + x] = w[6 + x] - le(e, 4 * x) | 0;
-    for (x = 0; x < 4; x++)
-      Dr(t, 4 * x, w[5 * x]), Dr(t, 16 + 4 * x, w[6 + x]);
-  } else
-    for (x = 0; x < 16; x++)
-      Dr(t, 4 * x, w[x] + d[x] | 0);
-}
-const tn = new Uint8Array([101, 120, 112, 97, 110, 100, 32, 51, 50, 45, 98, 121, 116, 101, 32, 107]);
-function Ta(t, e, r, o, c, i, w) {
-  const d = new Uint8Array(16), y = new Uint8Array(64);
-  let x, v;
-  if (!c)
-    return 0;
-  for (v = 0; v < 16; v++)
-    d[v] = 0;
-  for (v = 0; v < 8; v++)
-    d[v] = i[v];
-  for (; c >= 64; ) {
-    for (Fr(y, d, w, tn, !1), v = 0; v < 64; v++)
-      t[e + v] = (r ? r[o + v] : 0) ^ y[v];
-    for (x = 1, v = 8; v < 16; v++)
-      x = x + (d[v] & 255) | 0, d[v] = x & 255, x >>>= 8;
-    c -= 64, e += 64, r && (o += 64);
-  }
-  if (c > 0)
-    for (Fr(y, d, w, tn, !1), v = 0; v < c; v++)
-      t[e + v] = (r ? r[o + v] : 0) ^ y[v];
-  return 0;
-}
-function en(t, e, r, o, c, i, w) {
-  const d = new Uint8Array(32);
-  return Fr(d, i, w, tn, !0), Ta(t, e, r, o, c, i.subarray(16), d);
-}
-function Hr(t, e) {
-  let r = 0;
-  for (let o = 0; o < 17; o++)
-    r = r + (t[o] + e[o] | 0) | 0, t[o] = r & 255, r >>>= 8;
-}
-const $a = new Uint32Array([5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 252]);
-function fo(t, e, r, o, c, i) {
-  let w, d, y;
-  const x = new Uint32Array(17), v = new Uint32Array(17), E = new Uint32Array(17), M = new Uint32Array(17), U = new Uint32Array(17);
-  for (d = 0; d < 17; d++)
-    v[d] = E[d] = 0;
-  for (d = 0; d < 16; d++)
-    v[d] = i[d];
-  for (v[3] &= 15, v[4] &= 252, v[7] &= 15, v[8] &= 252, v[11] &= 15, v[12] &= 252, v[15] &= 15; c > 0; ) {
-    for (d = 0; d < 17; d++)
-      M[d] = 0;
-    for (d = 0; d < 16 && d < c; ++d)
-      M[d] = r[o + d];
-    for (M[d] = 1, o += d, c -= d, Hr(E, M), w = 0; w < 17; w++)
-      for (x[w] = 0, d = 0; d < 17; d++)
-        x[w] = x[w] + E[d] * (d <= w ? v[w - d] : 320 * v[w + 17 - d] | 0) | 0 | 0;
-    for (w = 0; w < 17; w++)
-      E[w] = x[w];
-    for (y = 0, d = 0; d < 16; d++)
-      y = y + E[d] | 0, E[d] = y & 255, y >>>= 8;
-    for (y = y + E[16] | 0, E[16] = y & 3, y = 5 * (y >>> 2) | 0, d = 0; d < 16; d++)
-      y = y + E[d] | 0, E[d] = y & 255, y >>>= 8;
-    y = y + E[16] | 0, E[16] = y;
-  }
-  for (d = 0; d < 17; d++)
-    U[d] = E[d];
-  Hr(E, $a);
-  const C = -(E[16] >>> 7) | 0;
-  for (d = 0; d < 17; d++)
-    E[d] ^= C & (U[d] ^ E[d]);
-  for (d = 0; d < 16; d++)
-    M[d] = i[d + 16];
-  for (M[16] = 0, Hr(E, M), d = 0; d < 16; d++)
-    t[e + d] = E[d];
-  return 0;
-}
-function qa(t, e, r, o, c, i) {
-  const w = new Uint8Array(16);
-  return fo(w, 0, r, o, c, i), La(t, e, w, 0, 16);
-}
-function Pa(t, e, r, o, c) {
-  if (r < 32)
-    return -1;
-  en(t, 0, e, 0, r, o, c), fo(t, 16, t, 32, r - 32, t);
-  for (let i = 0; i < 16; i++)
-    t[i] = 0;
-  return 0;
-}
-function Ca(t, e, r, o, c) {
-  const i = new Uint8Array(32);
-  if (r < 32 || (en(i, 0, null, 0, 32, o, c), qa(e, 16, e, 32, r - 32, i) !== 0))
-    return -1;
-  en(t, 0, e, 0, r, o, c);
-  for (let w = 0; w < 32; w++)
-    t[w] = 0;
-  return 0;
-}
-const Za = 32, Da = 24, rn = 32, nn = 16;
-function ao(t, e) {
-  if (t.length !== Za)
-    throw new Error("bad key size");
-  if (e.length !== Da)
-    throw new Error("bad nonce size");
-}
-function ho(...t) {
-  for (let e = 0, r = t.length; e < r; e++)
-    if (!(t[e] instanceof Uint8Array))
-      throw new TypeError("unexpected type, use Uint8Array");
-}
-function Ha(t, e, r) {
-  ho(t, e, r), ao(r, e);
-  const o = new Uint8Array(rn + t.length), c = new Uint8Array(o.length);
-  for (let i = 0; i < t.length; i++)
-    o[i + rn] = t[i];
-  return Pa(c, o, o.length, e, r), c.subarray(nn);
-}
-function Va(t, e, r) {
-  ho(t, e, r), ao(r, e);
-  const o = new Uint8Array(nn + t.length), c = new Uint8Array(o.length);
-  for (let i = 0; i < t.length; i++)
-    o[i + nn] = t[i];
-  return o.length < 32 || Ca(c, o, o.length, e, r) !== 0 ? null : c.subarray(rn);
-}
-function za(t, e, r) {
-  return Va(t, e, r);
-}
-function Ya(t, e, r = wi(24)) {
-  return {
-    encrypted: Ha(t, r, e),
-    nonce: r
-  };
-}
-function ei(t, e, r, o, c, i) {
-  let w = t[e++] ^ r[o++], d = t[e++] ^ r[o++], y = t[e++] ^ r[o++], x = t[e++] ^ r[o++], v = t[e++] ^ r[o++], E = t[e++] ^ r[o++], M = t[e++] ^ r[o++], U = t[e++] ^ r[o++], C = t[e++] ^ r[o++], k = t[e++] ^ r[o++], _ = t[e++] ^ r[o++], S = t[e++] ^ r[o++], L = t[e++] ^ r[o++], A = t[e++] ^ r[o++], q = t[e++] ^ r[o++], D = t[e++] ^ r[o++], R = w, O = d, $ = y, P = x, J = v, T = E, Z = M, p = U, n = C, f = k, a = _, h = S, l = L, m = A, b = q, u = D;
-  for (let s = 0; s < 8; s += 2)
-    J ^= G(R + l | 0, 7), n ^= G(J + R | 0, 9), l ^= G(n + J | 0, 13), R ^= G(l + n | 0, 18), f ^= G(T + O | 0, 7), m ^= G(f + T | 0, 9), O ^= G(m + f | 0, 13), T ^= G(O + m | 0, 18), b ^= G(a + Z | 0, 7), $ ^= G(b + a | 0, 9), Z ^= G($ + b | 0, 13), a ^= G(Z + $ | 0, 18), P ^= G(u + h | 0, 7), p ^= G(P + u | 0, 9), h ^= G(p + P | 0, 13), u ^= G(h + p | 0, 18), O ^= G(R + P | 0, 7), $ ^= G(O + R | 0, 9), P ^= G($ + O | 0, 13), R ^= G(P + $ | 0, 18), Z ^= G(T + J | 0, 7), p ^= G(Z + T | 0, 9), J ^= G(p + Z | 0, 13), T ^= G(J + p | 0, 18), h ^= G(a + f | 0, 7), n ^= G(h + a | 0, 9), f ^= G(n + h | 0, 13), a ^= G(f + n | 0, 18), l ^= G(u + b | 0, 7), m ^= G(l + u | 0, 9), b ^= G(m + l | 0, 13), u ^= G(b + m | 0, 18);
-  c[i++] = w + R | 0, c[i++] = d + O | 0, c[i++] = y + $ | 0, c[i++] = x + P | 0, c[i++] = v + J | 0, c[i++] = E + T | 0, c[i++] = M + Z | 0, c[i++] = U + p | 0, c[i++] = C + n | 0, c[i++] = k + f | 0, c[i++] = _ + a | 0, c[i++] = S + h | 0, c[i++] = L + l | 0, c[i++] = A + m | 0, c[i++] = q + b | 0, c[i++] = D + u | 0;
-}
-function Vr(t, e, r, o, c) {
-  let i = o + 0, w = o + 16 * c;
-  for (let d = 0; d < 16; d++)
-    r[w + d] = t[e + (2 * c - 1) * 16 + d];
-  for (let d = 0; d < c; d++, i += 16, e += 16)
-    ei(r, w, t, e, r, i), d > 0 && (w += 16), ei(r, i, t, e += 16, r, w);
-}
-function Xa(t, e, r) {
-  const o = _o({
-    dkLen: 32,
-    asyncTick: 10,
-    maxmem: 1073742848
-  }, r), { N: c, r: i, p: w, dkLen: d, asyncTick: y, maxmem: x, onProgress: v } = o;
-  if (Ft(c), Ft(i), Ft(w), Ft(d), Ft(y), Ft(x), v !== void 0 && typeof v != "function")
-    throw new Error("progressCb should be function");
-  const E = 128 * i, M = E / 4;
-  if (c <= 1 || c & c - 1 || c > 2 ** 32)
-    throw new Error("Scrypt: N must be larger than 1, a power of 2, and less than 2^32");
-  if (w < 0 || w > (2 ** 32 - 1) * 32 / E)
-    throw new Error("Scrypt: p must be a positive integer less than or equal to ((2^32 - 1) * 32) / (128 * r)");
-  if (d < 0 || d > (2 ** 32 - 1) * 32)
-    throw new Error("Scrypt: dkLen should be positive integer less than or equal to (2^32 - 1) * 32");
-  const U = E * (c + w);
-  if (U > x)
-    throw new Error(`Scrypt: parameters too large, ${U} (128 * r * (N + p)) > ${x} (maxmem)`);
-  const C = di(rr, t, e, { c: 1, dkLen: E * w }), k = Ve(C), _ = Ve(new Uint8Array(E * c)), S = Ve(new Uint8Array(E));
-  let L = () => {
-  };
-  if (v) {
-    const A = 2 * c * w, q = Math.max(Math.floor(A / 1e4), 1);
-    let D = 0;
-    L = () => {
-      D++, v && (!(D % q) || D === A) && v(D / A);
-    };
-  }
-  return { N: c, r: i, p: w, dkLen: d, blockSize32: M, V: _, B32: k, B: C, tmp: S, blockMixCb: L, asyncTick: y };
-}
-function ja(t, e, r, o, c) {
-  const i = di(rr, t, r, { c: 1, dkLen: e });
-  return r.fill(0), o.fill(0), c.fill(0), i;
-}
-function Ka(t, e, r) {
-  const { N: o, r: c, p: i, dkLen: w, blockSize32: d, V: y, B32: x, B: v, tmp: E, blockMixCb: M } = Xa(t, e, r);
-  Xe || je(x);
-  for (let U = 0; U < i; U++) {
-    const C = d * U;
-    for (let k = 0; k < d; k++)
-      y[k] = x[C + k];
-    for (let k = 0, _ = 0; k < o - 1; k++)
-      Vr(y, _, y, _ += d, c), M();
-    Vr(y, (o - 1) * d, x, C, c), M();
-    for (let k = 0; k < o; k++) {
-      const _ = x[C + d - 16] % o;
-      for (let S = 0; S < d; S++)
-        E[S] = x[C + S] ^ y[_ * d + S];
-      Vr(E, 0, x, C, c), M();
-    }
-  }
-  return Xe || je(x), ja(t, w, v, y, E);
-}
-const Ye = {
-  N: 32768,
-  p: 1,
-  r: 8
-};
-function co(t, e = wi(), r = Ye, o) {
-  const c = V(t);
-  return {
-    params: r,
-    password: !Ht || Vt() ? rs(c, e, Math.log2(r.N), r.r, r.p) : Ka(c, e, on({ dkLen: 64 }, r)),
-    salt: e
-  };
-}
-function Ga(t) {
-  const e = t.subarray(0, 32), r = kr(t.subarray(32, 36), Rr).toNumber(), o = kr(t.subarray(36, 40), Rr).toNumber(), c = kr(t.subarray(40, 44), Rr).toNumber();
-  if (r !== Ye.N || o !== Ye.p || c !== Ye.r)
-    throw new Error("Invalid injected scrypt params found");
-  return { params: { N: r, p: o, r: c }, salt: e };
-}
-function Wa(t, { N: e, p: r, r: o }) {
-  return Ct(t, zt(e, Or), zt(r, Or), zt(o, Or));
-}
-const lo = ["scrypt", "xsalsa20-poly1305"], Ja = ["none"], Qa = "3", ri = 24, Fa = 32 + 3 * 4;
-function t0(t, e, r = lo) {
-  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 o = t;
-  if (e) {
-    let c;
-    if (r.includes("scrypt")) {
-      const { params: i, salt: w } = Ga(t);
-      c = co(e, w, i).password, t = t.subarray(Fa);
-    } else
-      c = ee(e);
-    o = za(t.subarray(ri), t.subarray(0, ri), ys(c, 256, !0));
-  }
-  if (!o)
-    throw new Error("Unable to decode using the supplied passphrase");
-  return o;
-}
-function e0(t, e, r) {
-  return {
-    encoded: va(t),
-    encoding: {
-      content: e,
-      type: r ? lo : Ja,
-      version: Qa
-    }
-  };
-}
-const ni = (t) => (e, r, o) => _a(e, r, o, t), uo = [
-  ["ecdsa", ni("blake2")],
-  ["ethereum", ni("keccak")]
-], r0 = [
-  ["ed25519", zi],
-  ["sr25519", Gi],
-  ...uo
-], n0 = ["ed25519", "sr25519", "ecdsa"];
-function wo(t, { message: e, publicKey: r, signature: o }, c = r0) {
-  return t.isValid = c.some(([i, w]) => {
-    try {
-      if (w(e, o, r))
-        return t.crypto = i, !0;
-    } catch {
-    }
-    return !1;
-  }), t;
-}
-function i0(t, { message: e, publicKey: r, signature: o }) {
-  if (![0, 1, 2].includes(o[0]))
-    throw new Error(`Unknown crypto type, expected signature prefix [0..2], found ${o[0]}`);
-  const c = n0[o[0]] || "none";
-  t.crypto = c;
-  try {
-    t.isValid = {
-      ecdsa: () => wo(t, { message: e, publicKey: r, signature: o.subarray(1) }, uo).isValid,
-      ed25519: () => zi(e, o.subarray(1), r),
-      none: () => {
-        throw Error("no verify for `none` crypto type");
-      },
-      sr25519: () => Gi(e, o.subarray(1), r)
-    }[c]();
-  } catch {
-  }
-  return t;
-}
-function o0(t) {
-  return [0, 1, 2].includes(t[0]) && [65, 66].includes(t.length) ? i0 : wo;
-}
-function ii(t, e, r) {
-  const o = V(e);
-  if (![64, 65, 66].includes(o.length))
-    throw new Error(`Invalid signature length, expected [64..66] bytes, found ${o.length}`);
-  const c = ge(r), i = { message: V(t), publicKey: c, signature: o }, w = { crypto: "none", isValid: !1, isWrapped: We(i.message, !0), publicKey: c }, d = We(i.message, !1), y = o0(o);
-  return y(w, i), w.crypto !== "none" || w.isWrapped && !d ? w : (i.message = d ? bs(i.message) : xs(i.message), y(w, i));
-}
-const s0 = [as, $s], f0 = { name: "@polkadot/keyring", path: import.meta && import.meta.url ? new URL(import.meta.url).pathname.substring(0, new URL(import.meta.url).pathname.lastIndexOf("/") + 1) : "auto", type: "esm", version: "12.6.2" };
-us(f0, null, s0);
-const ue = new Uint8Array([161, 35, 3, 33, 0]), er = new Uint8Array([48, 83, 2, 1, 1, 48, 5, 6, 3, 43, 101, 112, 4, 34, 4, 32]), a0 = 32, oi = 64, h0 = 32, _e = er.length;
-function c0(t, e, r) {
-  const o = Array.isArray(r) || r === void 0 ? r : [r], c = t0(e, t, o), i = c.subarray(0, er.length);
-  if (!jt(i, er))
-    throw new Error("Invalid Pkcs8 header found in body");
-  let w = c.subarray(_e, _e + oi), d = _e + oi, y = c.subarray(d, d + ue.length);
-  if (!jt(y, ue) && (d = _e + h0, w = c.subarray(_e, d), y = c.subarray(d, d + ue.length), !jt(y, ue)))
-    throw new Error("Invalid Pkcs8 divider found in body");
-  const x = d + ue.length;
-  return {
-    publicKey: c.subarray(x, x + a0),
-    secretKey: w
-  };
-}
-function l0({ publicKey: t, secretKey: e }, r) {
-  if (!e)
-    throw new Error("Expected a valid secretKey to be passed to encode");
-  const o = Ct(er, e, ue, t);
-  if (!r)
-    return o;
-  const { params: c, password: i, salt: w } = co(r), { encrypted: d, nonce: y } = Ya(o, i.subarray(0, 32));
-  return Ct(Wa(w, c), y, d);
-}
-function u0(t, { address: e, meta: r }, o, c) {
-  return on(e0(o, ["pkcs8", t], c), {
-    address: e,
-    meta: r
-  });
-}
-const d0 = new Uint8Array(), w0 = {
-  ecdsa: be,
-  ed25519: gn,
-  ethereum: be,
-  sr25519: Ki
-}, si = {
-  ecdsa: new Uint8Array([2]),
-  ed25519: new Uint8Array([0]),
-  ethereum: new Uint8Array([2]),
-  sr25519: new Uint8Array([1])
-}, fi = {
-  ecdsa: (t, e) => ti(t, e, "blake2"),
-  ed25519: Gf,
-  ethereum: (t, e) => ti(t, e, "keccak"),
-  sr25519: na
-}, He = {
-  ecdsa: (t) => t.length > 32 ? he(t) : t,
-  ed25519: (t) => t,
-  ethereum: (t) => t.length === 20 ? t : hr(pn(t)),
-  sr25519: (t) => t
-};
-function Be(t) {
-  return !t || bi(t);
-}
-function ai(t, e, r) {
-  return he(Ct(e || "", r || "", t));
-}
-function de({ toSS58: t, type: e }, { publicKey: r, secretKey: o }, c = {}, i = null, w) {
-  const d = (v, E) => {
-    const M = c0(v, E || i, w);
-    if (M.secretKey.length === 64)
-      r = M.publicKey, o = M.secretKey;
-    else {
-      const U = w0[e](M.secretKey);
-      r = U.publicKey, o = U.secretKey;
-    }
-  }, y = (v) => (Be(o) && i && d(v, i), i = l0({ publicKey: r, secretKey: o }, v), w = void 0, i), x = () => {
-    const v = He[e](r);
-    return e === "ethereum" ? ro(v) : t(v);
-  };
-  return {
-    get address() {
-      return x();
-    },
-    get addressRaw() {
-      const v = He[e](r);
-      return e === "ethereum" ? v.slice(-20) : v;
-    },
-    get isLocked() {
-      return Be(o);
-    },
-    get meta() {
-      return c;
-    },
-    get publicKey() {
-      return r;
-    },
-    get type() {
-      return e;
-    },
-    // eslint-disable-next-line sort-keys
-    decodePkcs8: d,
-    derive: (v, E) => {
-      if (e === "ethereum")
-        throw new Error("Unable to derive on this keypair");
-      if (Be(o))
-        throw new Error("Cannot derive on a locked keypair");
-      const { path: M } = Li(v), U = ji({ publicKey: r, secretKey: o }, M, e);
-      return de({ toSS58: t, type: e }, U, E, null);
-    },
-    encodePkcs8: (v) => y(v),
-    lock: () => {
-      o = new Uint8Array();
-    },
-    setMeta: (v) => {
-      c = on({}, c, v);
-    },
-    sign: (v, E = {}) => {
-      if (Be(o))
-        throw new Error("Cannot sign with a locked key pair");
-      return Ct(E.withType ? si[e] : d0, fi[e](V(v), { publicKey: r, secretKey: o }));
-    },
-    toJson: (v) => {
-      const E = ["ecdsa", "ethereum"].includes(e) ? r.length === 20 ? Ae(r) : Ae(to(r)) : x();
-      return u0(e, { address: E, meta: c }, y(v), !!v);
-    },
-    unlock: (v) => d(v),
-    verify: (v, E, M) => ii(v, E, He[e](V(M))).isValid,
-    vrfSign: (v, E, M) => {
-      if (Be(o))
-        throw new Error("Cannot sign with a locked key pair");
-      if (e === "sr25519")
-        return ia(v, { secretKey: o }, E, M);
-      const U = fi[e](V(v), { publicKey: r, secretKey: o });
-      return Ct(ai(U, E, M), U);
-    },
-    vrfVerify: (v, E, M, U, C) => e === "sr25519" ? oa(v, E, r, U, C) : ii(v, Ct(si[e], E.subarray(32)), He[e](V(M))).isValid && jt(E.subarray(0, 32), ai(E.subarray(32), U, C))
-  };
-}
-const g0 = "bottom drive obey lake curtain smoke basket hold race lonely fit walk";
-class m0 {
-  constructor() {
-    Kt(this, "__internal__map", {});
-  }
-  add(e) {
-    return this.__internal__map[ge(e.address).toString()] = e, e;
-  }
-  all() {
-    return Object.values(this.__internal__map);
-  }
-  get(e) {
-    const r = this.__internal__map[ge(e).toString()];
-    if (!r)
-      throw new Error(`Unable to retrieve keypair '${oe(e) || te(e) ? Ae(V(e)) : e}'`);
-    return r;
-  }
-  remove(e) {
-    delete this.__internal__map[ge(e).toString()];
-  }
-}
-const zr = {
-  ecdsa: (t) => be(t),
-  ed25519: (t) => gn(t),
-  ethereum: (t) => be(t),
-  sr25519: (t) => Ki(t)
-};
-function p0({ publicKey: t }) {
-  return t;
-}
-class L0 {
-  constructor(e = {}) {
-    Kt(this, "__internal__pairs");
-    Kt(this, "__internal__type");
-    Kt(this, "__internal__ss58");
-    Kt(this, "decodeAddress", ge);
-    /**
-     * @name encodeAddress
-     * @description Encodes the input into an ss58 representation
-     */
-    Kt(this, "encodeAddress", (e, r) => this.type === "ethereum" ? ro(e) : sa(e, r ?? this.__internal__ss58));
-    if (e.type = e.type || "ed25519", !["ecdsa", "ethereum", "ed25519", "sr25519"].includes(e.type || "undefined"))
-      throw new Error(`Expected a keyring type of either 'ed25519', 'sr25519', 'ethereum' or 'ecdsa', found '${e.type || "unknown"}`);
-    this.__internal__pairs = new m0(), this.__internal__ss58 = e.ss58Format, this.__internal__type = e.type;
-  }
-  /**
-   * @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 = {}, o = null, c = this.type, i, w) {
-    const d = this.decodeAddress(e, i);
-    return this.addPair(de({ toSS58: this.encodeAddress, type: c }, { publicKey: d, secretKey: new Uint8Array() }, r, o, w));
-  }
-  /**
-   * @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 = {}, o = this.type) {
-    return this.addFromUri(e, r, o);
-  }
-  /**
-   * @name addFromPair
-   * @summary Stores an account created from an explicit publicKey/secreteKey combination
-   */
-  addFromPair(e, r = {}, o = this.type) {
-    return this.addPair(this.createFromPair(e, r, o));
-  }
-  /**
-   * @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 = {}, o = this.type) {
-    return this.addPair(de({ toSS58: this.encodeAddress, type: o }, zr[o](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 = {}, o = this.type) {
-    return this.addPair(this.createFromUri(e, r, o));
-  }
-  /**
-   * @name createFromJson
-   * @description Creates a pair from a JSON keyfile
-   */
-  createFromJson({ address: e, encoded: r, encoding: { content: o, type: c, version: i }, meta: w }, d) {
-    if (i === "3" && o[0] !== "pkcs8")
-      throw new Error(`Unable to decode non-pkcs8 type, [${o.join(",")}] found}`);
-    const y = i === "0" || !Array.isArray(o) ? this.type : o[1], x = Array.isArray(c) ? c : [c];
-    if (!["ed25519", "sr25519", "ecdsa", "ethereum"].includes(y))
-      throw new Error(`Unknown crypto type ${y}`);
-    const v = te(e) ? Se(e) : this.decodeAddress(e, d), E = te(r) ? Se(r) : ya(r);
-    return de({ toSS58: this.encodeAddress, type: y }, { publicKey: v, secretKey: new Uint8Array() }, w, E, x);
-  }
-  /**
-   * @name createFromPair
-   * @summary Creates a pair from an explicit publicKey/secreteKey combination
-   */
-  createFromPair(e, r = {}, o = this.type) {
-    return de({ toSS58: this.encodeAddress, type: o }, 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 = {}, o = this.type) {
-    const c = e.startsWith("//") ? `${g0}${e}` : e, { derivePath: i, password: w, path: d, phrase: y } = tf(c);
-    let x;
-    const v = te(y, 256);
-    if (v)
-      x = Se(y);
-    else {
-      const M = y.split(" ");
-      if ([12, 15, 18, 21, 24].includes(M.length))
-        x = o === "ethereum" ? Ra(y, "", !1, 64) : Oa(y, w);
-      else {
-        if (y.length > 32)
-          throw new Error("specified phrase is not a valid mnemonic and is invalid as a raw seed at > 32 bytes");
-        x = ee(y.padEnd(32));
-      }
-    }
-    const E = o === "ethereum" ? v ? zr[o](x) : Ua(x, i.substring(1)) : ji(zr[o](x), d, o);
-    return de({ toSS58: this.encodeAddress, type: o }, 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(p0);
-  }
-  /**
-   * @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 {
-  g0 as DEV_PHRASE,
-  L0 as Keyring,
-  de as createPair,
-  ge as decodeAddress,
-  L0 as default,
-  sa as encodeAddress,
-  f0 as packageInfo
-};