@icp-sdk/vetkeys 0.6.0 → 0.7.0

package/dist/lib/index.es.js

@@ -1,3739 +1,20 @@
-const Tt = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
-function ce(e) {
-  return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
-}
-function Ut(e) {
-  if (!Number.isSafeInteger(e) || e < 0)
-    throw new Error("positive integer expected, got " + e);
-}
-function Q(e, ...t) {
-  if (!ce(e))
-    throw new Error("Uint8Array expected");
-  if (t.length > 0 && !t.includes(e.length))
-    throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
-}
-function Ue(e) {
-  if (typeof e != "function" || typeof e.create != "function")
-    throw new Error("Hash should be wrapped by utils.createHasher");
-  Ut(e.outputLen), Ut(e.blockLen);
-}
-function Lt(e, t = !0) {
-  if (e.destroyed)
-    throw new Error("Hash instance has been destroyed");
-  if (t && e.finished)
-    throw new Error("Hash#digest() has already been called");
-}
-function xn(e, t) {
-  Q(e);
-  const r = t.outputLen;
-  if (e.length < r)
-    throw new Error("digestInto() expects output buffer of length at least " + r);
-}
-function Qn(e) {
-  return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
-}
-function St(...e) {
-  for (let t = 0; t < e.length; t++)
-    e[t].fill(0);
-}
-function be(e) {
-  return new DataView(e.buffer, e.byteOffset, e.byteLength);
-}
-function at(e, t) {
-  return e << 32 - t | e >>> t;
-}
-const Jn = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-function tr(e) {
-  return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
-}
-function er(e) {
-  for (let t = 0; t < e.length; t++)
-    e[t] = tr(e[t]);
-  return e;
-}
-const Ve = Jn ? (e) => e : er, Bn = /* @ts-ignore */ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", nr = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
-function Yt(e) {
-  if (Q(e), Bn)
-    return e.toHex();
-  let t = "";
-  for (let r = 0; r < e.length; r++)
-    t += nr[e[r]];
-  return t;
-}
-const ut = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
-function Fe(e) {
-  if (e >= ut._0 && e <= ut._9)
-    return e - ut._0;
-  if (e >= ut.A && e <= ut.F)
-    return e - (ut.A - 10);
-  if (e >= ut.a && e <= ut.f)
-    return e - (ut.a - 10);
-}
-function _n(e) {
-  if (typeof e != "string")
-    throw new Error("hex string expected, got " + typeof e);
-  if (Bn)
-    return Uint8Array.fromHex(e);
-  const t = e.length, r = t / 2;
-  if (t % 2)
-    throw new Error("hex string expected, got unpadded hex of length " + t);
-  const n = new Uint8Array(r);
-  for (let s = 0, o = 0; s < r; s++, o += 2) {
-    const i = Fe(e.charCodeAt(o)), c = Fe(e.charCodeAt(o + 1));
-    if (i === void 0 || c === void 0) {
-      const a = e[o] + e[o + 1];
-      throw new Error('hex string expected, got non-hex character "' + a + '" at index ' + o);
-    }
-    n[s] = i * 16 + c;
-  }
-  return n;
-}
-function $t(e) {
-  if (typeof e != "string")
-    throw new Error("string expected");
-  return new Uint8Array(new TextEncoder().encode(e));
-}
-function vt(e) {
-  return typeof e == "string" && (e = $t(e)), Q(e), e;
-}
-function V(...e) {
-  let t = 0;
-  for (let n = 0; n < e.length; n++) {
-    const s = e[n];
-    Q(s), t += s.length;
-  }
-  const r = new Uint8Array(t);
-  for (let n = 0, s = 0; n < e.length; n++) {
-    const o = e[n];
-    r.set(o, s), s += o.length;
-  }
-  return r;
-}
-class Le {
-}
-function rr(e) {
-  const t = (n) => e().update(vt(n)).digest(), r = e();
-  return t.outputLen = r.outputLen, t.blockLen = r.blockLen, t.create = () => e(), t;
-}
-function sr(e) {
-  const t = (n, s) => e(s).update(vt(n)).digest(), r = e({});
-  return t.outputLen = r.outputLen, t.blockLen = r.blockLen, t.create = (n) => e(n), t;
-}
-function or(e = 32) {
-  if (Tt && typeof Tt.getRandomValues == "function")
-    return Tt.getRandomValues(new Uint8Array(e));
-  if (Tt && typeof Tt.randomBytes == "function")
-    return Uint8Array.from(Tt.randomBytes(e));
-  throw new Error("crypto.getRandomValues must be defined");
-}
-function ir(e, t, r, n) {
-  if (typeof e.setBigUint64 == "function")
-    return e.setBigUint64(t, r, n);
-  const s = BigInt(32), o = BigInt(4294967295), i = Number(r >> s & o), c = Number(r & o), a = n ? 4 : 0, u = n ? 0 : 4;
-  e.setUint32(t + a, i, n), e.setUint32(t + u, c, n);
-}
-function cr(e, t, r) {
-  return e & t ^ ~e & r;
-}
-function ar(e, t, r) {
-  return e & t ^ e & r ^ t & r;
-}
-class fr extends Le {
-  constructor(t, r, n, s) {
-    super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = t, this.outputLen = r, this.padOffset = n, this.isLE = s, this.buffer = new Uint8Array(t), this.view = be(this.buffer);
-  }
-  update(t) {
-    Lt(this), t = vt(t), Q(t);
-    const { view: r, buffer: n, blockLen: s } = this, o = t.length;
-    for (let i = 0; i < o; ) {
-      const c = Math.min(s - this.pos, o - i);
-      if (c === s) {
-        const a = be(t);
-        for (; s <= o - i; i += s)
-          this.process(a, i);
-        continue;
-      }
-      n.set(t.subarray(i, i + c), this.pos), this.pos += c, i += c, this.pos === s && (this.process(r, 0), this.pos = 0);
-    }
-    return this.length += t.length, this.roundClean(), this;
-  }
-  digestInto(t) {
-    Lt(this), xn(t, this), this.finished = !0;
-    const { buffer: r, view: n, blockLen: s, isLE: o } = this;
-    let { pos: i } = this;
-    r[i++] = 128, St(this.buffer.subarray(i)), this.padOffset > s - i && (this.process(n, 0), i = 0);
-    for (let d = i; d < s; d++)
-      r[d] = 0;
-    ir(n, s - 8, BigInt(this.length * 8), o), this.process(n, 0);
-    const c = be(t), a = this.outputLen;
-    if (a % 4)
-      throw new Error("_sha2: outputLen should be aligned to 32bit");
-    const u = a / 4, l = this.get();
-    if (u > l.length)
-      throw new Error("_sha2: outputLen bigger than state");
-    for (let d = 0; d < u; d++)
-      c.setUint32(4 * d, l[d], o);
-  }
-  digest() {
-    const { buffer: t, outputLen: r } = this;
-    this.digestInto(t);
-    const n = t.slice(0, r);
-    return this.destroy(), n;
-  }
-  _cloneInto(t) {
-    t || (t = new this.constructor()), t.set(...this.get());
-    const { blockLen: r, buffer: n, length: s, finished: o, destroyed: i, pos: c } = this;
-    return t.destroyed = i, t.finished = o, t.length = s, t.pos = c, s % r && t.buffer.set(n), t;
-  }
-  clone() {
-    return this._cloneInto();
-  }
-}
-const bt = /* @__PURE__ */ Uint32Array.from([
-  1779033703,
-  3144134277,
-  1013904242,
-  2773480762,
-  1359893119,
-  2600822924,
-  528734635,
-  1541459225
-]), Wt = /* @__PURE__ */ BigInt(2 ** 32 - 1), Ce = /* @__PURE__ */ BigInt(32);
-function ur(e, t = !1) {
-  return t ? { h: Number(e & Wt), l: Number(e >> Ce & Wt) } : { h: Number(e >> Ce & Wt) | 0, l: Number(e & Wt) | 0 };
-}
-function dr(e, t = !1) {
-  const r = e.length;
-  let n = new Uint32Array(r), s = new Uint32Array(r);
-  for (let o = 0; o < r; o++) {
-    const { h: i, l: c } = ur(e[o], t);
-    [n[o], s[o]] = [i, c];
-  }
-  return [n, s];
-}
-const lr = (e, t, r) => e << r | t >>> 32 - r, br = (e, t, r) => t << r | e >>> 32 - r, hr = (e, t, r) => t << r - 32 | e >>> 64 - r, mr = (e, t, r) => e << r - 32 | t >>> 64 - r, gr = /* @__PURE__ */ Uint32Array.from([
-  1116352408,
-  1899447441,
-  3049323471,
-  3921009573,
-  961987163,
-  1508970993,
-  2453635748,
-  2870763221,
-  3624381080,
-  310598401,
-  607225278,
-  1426881987,
-  1925078388,
-  2162078206,
-  2614888103,
-  3248222580,
-  3835390401,
-  4022224774,
-  264347078,
-  604807628,
-  770255983,
-  1249150122,
-  1555081692,
-  1996064986,
-  2554220882,
-  2821834349,
-  2952996808,
-  3210313671,
-  3336571891,
-  3584528711,
-  113926993,
-  338241895,
-  666307205,
-  773529912,
-  1294757372,
-  1396182291,
-  1695183700,
-  1986661051,
-  2177026350,
-  2456956037,
-  2730485921,
-  2820302411,
-  3259730800,
-  3345764771,
-  3516065817,
-  3600352804,
-  4094571909,
-  275423344,
-  430227734,
-  506948616,
-  659060556,
-  883997877,
-  958139571,
-  1322822218,
-  1537002063,
-  1747873779,
-  1955562222,
-  2024104815,
-  2227730452,
-  2361852424,
-  2428436474,
-  2756734187,
-  3204031479,
-  3329325298
-]), ht = /* @__PURE__ */ new Uint32Array(64);
-class yr extends fr {
-  constructor(t = 32) {
-    super(64, t, 8, !1), this.A = bt[0] | 0, this.B = bt[1] | 0, this.C = bt[2] | 0, this.D = bt[3] | 0, this.E = bt[4] | 0, this.F = bt[5] | 0, this.G = bt[6] | 0, this.H = bt[7] | 0;
-  }
-  get() {
-    const { A: t, B: r, C: n, D: s, E: o, F: i, G: c, H: a } = this;
-    return [t, r, n, s, o, i, c, a];
-  }
-  // prettier-ignore
-  set(t, r, n, s, o, i, c, a) {
-    this.A = t | 0, this.B = r | 0, this.C = n | 0, this.D = s | 0, this.E = o | 0, this.F = i | 0, this.G = c | 0, this.H = a | 0;
-  }
-  process(t, r) {
-    for (let d = 0; d < 16; d++, r += 4)
-      ht[d] = t.getUint32(r, !1);
-    for (let d = 16; d < 64; d++) {
-      const f = ht[d - 15], b = ht[d - 2], m = at(f, 7) ^ at(f, 18) ^ f >>> 3, g = at(b, 17) ^ at(b, 19) ^ b >>> 10;
-      ht[d] = g + ht[d - 7] + m + ht[d - 16] | 0;
-    }
-    let { A: n, B: s, C: o, D: i, E: c, F: a, G: u, H: l } = this;
-    for (let d = 0; d < 64; d++) {
-      const f = at(c, 6) ^ at(c, 11) ^ at(c, 25), b = l + f + cr(c, a, u) + gr[d] + ht[d] | 0, g = (at(n, 2) ^ at(n, 13) ^ at(n, 22)) + ar(n, s, o) | 0;
-      l = u, u = a, a = c, c = i + b | 0, i = o, o = s, s = n, n = b + g | 0;
-    }
-    n = n + this.A | 0, s = s + this.B | 0, o = o + this.C | 0, i = i + this.D | 0, c = c + this.E | 0, a = a + this.F | 0, u = u + this.G | 0, l = l + this.H | 0, this.set(n, s, o, i, c, a, u, l);
-  }
-  roundClean() {
-    St(ht);
-  }
-  destroy() {
-    this.set(0, 0, 0, 0, 0, 0, 0, 0), St(this.buffer);
-  }
-}
-const Sn = /* @__PURE__ */ rr(() => new yr());
-const He = /* @__PURE__ */ BigInt(0), ee = /* @__PURE__ */ BigInt(1);
-function ze(e, t = "") {
-  if (typeof e != "boolean") {
-    const r = t && `"${t}"`;
-    throw new Error(r + "expected boolean, got type=" + typeof e);
-  }
-  return e;
-}
-function $e(e, t, r = "") {
-  const n = ce(e), s = e?.length;
-  if (!n || t !== void 0) {
-    const i = r && `"${r}" `, c = "", a = n ? `length=${s}` : `type=${typeof e}`;
-    throw new Error(i + "expected Uint8Array" + c + ", got " + a);
-  }
-  return e;
-}
-function vn(e) {
-  if (typeof e != "string")
-    throw new Error("hex string expected, got " + typeof e);
-  return e === "" ? He : BigInt("0x" + e);
-}
-function ft(e) {
-  return vn(Yt(e));
-}
-function An(e) {
-  return Q(e), vn(Yt(Uint8Array.from(e).reverse()));
-}
-function C(e, t) {
-  return _n(e.toString(16).padStart(t * 2, "0"));
-}
-function On(e, t) {
-  return C(e, t).reverse();
-}
-function Ht(e, t, r) {
-  let n;
-  if (typeof t == "string")
-    try {
-      n = _n(t);
-    } catch (o) {
-      throw new Error(e + " must be hex string or Uint8Array, cause: " + o);
-    }
-  else if (ce(t))
-    n = Uint8Array.from(t);
-  else
-    throw new Error(e + " must be hex string or Uint8Array");
-  const s = n.length;
-  if (typeof r == "number" && s !== r)
-    throw new Error(e + " of length " + r + " expected, got " + s);
-  return n;
-}
-const he = (e) => typeof e == "bigint" && He <= e;
-function pr(e, t, r) {
-  return he(e) && he(t) && he(r) && t <= e && e < r;
-}
-function Vt(e) {
-  let t;
-  for (t = 0; e > He; e >>= ee, t += 1)
-    ;
-  return t;
-}
-function wr(e, t) {
-  return e >> BigInt(t) & ee;
-}
-const Ot = (e) => (ee << BigInt(e)) - ee;
-function Er(e) {
-  return typeof e == "function" && Number.isSafeInteger(e.outputLen);
-}
-function ke(e, t, r = {}) {
-  if (!e || typeof e != "object")
-    throw new Error("expected valid options object");
-  function n(s, o, i) {
-    const c = e[s];
-    if (i && c === void 0)
-      return;
-    const a = typeof c;
-    if (a !== o || c === null)
-      throw new Error(`param "${s}" is invalid: expected ${o}, got ${a}`);
-  }
-  Object.entries(t).forEach(([s, o]) => n(s, o, !1)), Object.entries(r).forEach(([s, o]) => n(s, o, !0));
-}
-const In = () => {
-  throw new Error("not implemented");
-};
-function Ae(e) {
-  const t = /* @__PURE__ */ new WeakMap();
-  return (r, ...n) => {
-    const s = t.get(r);
-    if (s !== void 0)
-      return s;
-    const o = e(r, ...n);
-    return t.set(r, o), o;
-  };
-}
-const tt = BigInt(0), W = BigInt(1), Et = /* @__PURE__ */ BigInt(2), Nn = /* @__PURE__ */ BigInt(3), Tn = /* @__PURE__ */ BigInt(4), qn = /* @__PURE__ */ BigInt(5), xr = /* @__PURE__ */ BigInt(7), Rn = /* @__PURE__ */ BigInt(8), Br = /* @__PURE__ */ BigInt(9), Gn = /* @__PURE__ */ BigInt(16);
-function et(e, t) {
-  const r = e % t;
-  return r >= tt ? r : t + r;
-}
-function je(e, t) {
-  if (e === tt)
-    throw new Error("invert: expected non-zero number");
-  if (t <= tt)
-    throw new Error("invert: expected positive modulus, got " + t);
-  let r = et(e, t), n = t, s = tt, o = W;
-  for (; r !== tt; ) {
-    const c = n / r, a = n % r, u = s - o * c;
-    n = r, r = a, s = o, o = u;
-  }
-  if (n !== W)
-    throw new Error("invert: does not exist");
-  return et(s, t);
-}
-function Pe(e, t, r) {
-  if (!e.eql(e.sqr(t), r))
-    throw new Error("Cannot find square root");
-}
-function Un(e, t) {
-  const r = (e.ORDER + W) / Tn, n = e.pow(t, r);
-  return Pe(e, n, t), n;
-}
-function _r(e, t) {
-  const r = (e.ORDER - qn) / Rn, n = e.mul(t, Et), s = e.pow(n, r), o = e.mul(t, s), i = e.mul(e.mul(o, Et), s), c = e.mul(o, e.sub(i, e.ONE));
-  return Pe(e, c, t), c;
-}
-function Sr(e) {
-  const t = Pt(e), r = Ln(e), n = r(t, t.neg(t.ONE)), s = r(t, n), o = r(t, t.neg(n)), i = (e + xr) / Gn;
-  return (c, a) => {
-    let u = c.pow(a, i), l = c.mul(u, n);
-    const d = c.mul(u, s), f = c.mul(u, o), b = c.eql(c.sqr(l), a), m = c.eql(c.sqr(d), a);
-    u = c.cmov(u, l, b), l = c.cmov(f, d, m);
-    const g = c.eql(c.sqr(l), a), w = c.cmov(u, l, g);
-    return Pe(c, w, a), w;
-  };
-}
-function Ln(e) {
-  if (e < Nn)
-    throw new Error("sqrt is not defined for small field");
-  let t = e - W, r = 0;
-  for (; t % Et === tt; )
-    t /= Et, r++;
-  let n = Et;
-  const s = Pt(e);
-  for (; ne(s, n) === 1; )
-    if (n++ > 1e3)
-      throw new Error("Cannot find square root: probably non-prime P");
-  if (r === 1)
-    return Un;
-  let o = s.pow(n, t);
-  const i = (t + W) / Et;
-  return function(a, u) {
-    if (a.is0(u))
-      return u;
-    if (ne(a, u) !== 1)
-      throw new Error("Cannot find square root");
-    let l = r, d = a.mul(a.ONE, o), f = a.pow(u, t), b = a.pow(u, i);
-    for (; !a.eql(f, a.ONE); ) {
-      if (a.is0(f))
-        return a.ZERO;
-      let m = 1, g = a.sqr(f);
-      for (; !a.eql(g, a.ONE); )
-        if (m++, g = a.sqr(g), m === l)
-          throw new Error("Cannot find square root");
-      const w = W << BigInt(l - m - 1), T = a.pow(d, w);
-      l = m, d = a.sqr(T), f = a.mul(f, d), b = a.mul(b, T);
-    }
-    return b;
-  };
-}
-function vr(e) {
-  return e % Tn === Nn ? Un : e % Rn === qn ? _r : e % Gn === Br ? Sr(e) : Ln(e);
-}
-const Ar = [
-  "create",
-  "isValid",
-  "is0",
-  "neg",
-  "inv",
-  "sqrt",
-  "sqr",
-  "eql",
-  "add",
-  "sub",
-  "mul",
-  "pow",
-  "div",
-  "addN",
-  "subN",
-  "mulN",
-  "sqrN"
-];
-function Hn(e) {
-  const t = {
-    ORDER: "bigint",
-    MASK: "bigint",
-    BYTES: "number",
-    BITS: "number"
-  }, r = Ar.reduce((n, s) => (n[s] = "function", n), t);
-  return ke(e, r), e;
-}
-function ae(e, t, r) {
-  if (r < tt)
-    throw new Error("invalid exponent, negatives unsupported");
-  if (r === tt)
-    return e.ONE;
-  if (r === W)
-    return t;
-  let n = e.ONE, s = t;
-  for (; r > tt; )
-    r & W && (n = e.mul(n, s)), s = e.sqr(s), r >>= W;
-  return n;
-}
-function It(e, t, r = !1) {
-  const n = new Array(t.length).fill(r ? e.ZERO : void 0), s = t.reduce((i, c, a) => e.is0(c) ? i : (n[a] = i, e.mul(i, c)), e.ONE), o = e.inv(s);
-  return t.reduceRight((i, c, a) => e.is0(c) ? i : (n[a] = e.mul(i, n[a]), e.mul(i, c)), o), n;
-}
-function ne(e, t) {
-  const r = (e.ORDER - W) / Et, n = e.pow(t, r), s = e.eql(n, e.ONE), o = e.eql(n, e.ZERO), i = e.eql(n, e.neg(e.ONE));
-  if (!s && !o && !i)
-    throw new Error("invalid Legendre symbol result");
-  return s ? 1 : o ? 0 : -1;
-}
-function Or(e, t) {
-  t !== void 0 && Ut(t);
-  const r = t !== void 0 ? t : e.toString(2).length, n = Math.ceil(r / 8);
-  return { nBitLength: r, nByteLength: n };
-}
-function Pt(e, t, r = !1, n = {}) {
-  if (e <= tt)
-    throw new Error("invalid field: expected ORDER > 0, got " + e);
-  let s, o, i = !1, c;
-  if (typeof t == "object" && t != null) {
-    if (n.sqrt || r)
-      throw new Error("cannot specify opts in two arguments");
-    const f = t;
-    f.BITS && (s = f.BITS), f.sqrt && (o = f.sqrt), typeof f.isLE == "boolean" && (r = f.isLE), typeof f.modFromBytes == "boolean" && (i = f.modFromBytes), c = f.allowedLengths;
-  } else
-    typeof t == "number" && (s = t), n.sqrt && (o = n.sqrt);
-  const { nBitLength: a, nByteLength: u } = Or(e, s);
-  if (u > 2048)
-    throw new Error("invalid field: expected ORDER of <= 2048 bytes");
-  let l;
-  const d = Object.freeze({
-    ORDER: e,
-    isLE: r,
-    BITS: a,
-    BYTES: u,
-    MASK: Ot(a),
-    ZERO: tt,
-    ONE: W,
-    allowedLengths: c,
-    create: (f) => et(f, e),
-    isValid: (f) => {
-      if (typeof f != "bigint")
-        throw new Error("invalid field element: expected bigint, got " + typeof f);
-      return tt <= f && f < e;
-    },
-    is0: (f) => f === tt,
-    // is valid and invertible
-    isValidNot0: (f) => !d.is0(f) && d.isValid(f),
-    isOdd: (f) => (f & W) === W,
-    neg: (f) => et(-f, e),
-    eql: (f, b) => f === b,
-    sqr: (f) => et(f * f, e),
-    add: (f, b) => et(f + b, e),
-    sub: (f, b) => et(f - b, e),
-    mul: (f, b) => et(f * b, e),
-    pow: (f, b) => ae(d, f, b),
-    div: (f, b) => et(f * je(b, e), e),
-    // Same as above, but doesn't normalize
-    sqrN: (f) => f * f,
-    addN: (f, b) => f + b,
-    subN: (f, b) => f - b,
-    mulN: (f, b) => f * b,
-    inv: (f) => je(f, e),
-    sqrt: o || ((f) => (l || (l = vr(e)), l(d, f))),
-    toBytes: (f) => r ? On(f, u) : C(f, u),
-    fromBytes: (f, b = !0) => {
-      if (c) {
-        if (!c.includes(f.length) || f.length > u)
-          throw new Error("Field.fromBytes: expected " + c + " bytes, got " + f.length);
-        const g = new Uint8Array(u);
-        g.set(f, r ? 0 : g.length - f.length), f = g;
-      }
-      if (f.length !== u)
-        throw new Error("Field.fromBytes: expected " + u + " bytes, got " + f.length);
-      let m = r ? An(f) : ft(f);
-      if (i && (m = et(m, e)), !b && !d.isValid(m))
-        throw new Error("invalid field element: outside of range 0..ORDER");
-      return m;
-    },
-    // TODO: we don't need it here, move out to separate fn
-    invertBatch: (f) => It(d, f),
-    // We can't move this out because Fp6, Fp12 implement it
-    // and it's unclear what to return in there.
-    cmov: (f, b, m) => m ? b : f
-  });
-  return Object.freeze(d);
-}
-function kn(e) {
-  if (typeof e != "bigint")
-    throw new Error("field order must be bigint");
-  const t = e.toString(2).length;
-  return Math.ceil(t / 8);
-}
-function Pn(e) {
-  const t = kn(e);
-  return t + Math.ceil(t / 2);
-}
-function Ir(e, t, r = !1) {
-  const n = e.length, s = kn(t), o = Pn(t);
-  if (n < 16 || n < o || n > 1024)
-    throw new Error("expected " + o + "-1024 bytes of input, got " + n);
-  const i = r ? An(e) : ft(e), c = et(i, t - W) + W;
-  return r ? On(c, s) : C(c, s);
-}
-const kt = BigInt(0), xt = BigInt(1);
-function re(e, t) {
-  const r = t.negate();
-  return e ? r : t;
-}
-function Kt(e, t) {
-  const r = It(e.Fp, t.map((n) => n.Z));
-  return t.map((n, s) => e.fromAffine(n.toAffine(r[s])));
-}
-function Dn(e, t) {
-  if (!Number.isSafeInteger(e) || e <= 0 || e > t)
-    throw new Error("invalid window size, expected [1.." + t + "], got W=" + e);
-}
-function me(e, t) {
-  Dn(e, t);
-  const r = Math.ceil(t / e) + 1, n = 2 ** (e - 1), s = 2 ** e, o = Ot(e), i = BigInt(e);
-  return { windows: r, windowSize: n, mask: o, maxNumber: s, shiftBy: i };
-}
-function Xe(e, t, r) {
-  const { windowSize: n, mask: s, maxNumber: o, shiftBy: i } = r;
-  let c = Number(e & s), a = e >> i;
-  c > n && (c -= o, a += xt);
-  const u = t * n, l = u + Math.abs(c) - 1, d = c === 0, f = c < 0, b = t % 2 !== 0;
-  return { nextN: a, offset: l, isZero: d, isNeg: f, isNegF: b, offsetF: u };
-}
-function Nr(e, t) {
-  if (!Array.isArray(e))
-    throw new Error("array expected");
-  e.forEach((r, n) => {
-    if (!(r instanceof t))
-      throw new Error("invalid point at index " + n);
-  });
-}
-function Tr(e, t) {
-  if (!Array.isArray(e))
-    throw new Error("array of scalars expected");
-  e.forEach((r, n) => {
-    if (!t.isValid(r))
-      throw new Error("invalid scalar at index " + n);
-  });
-}
-const ge = /* @__PURE__ */ new WeakMap(), Mn = /* @__PURE__ */ new WeakMap();
-function ye(e) {
-  return Mn.get(e) || 1;
-}
-function We(e) {
-  if (e !== kt)
-    throw new Error("invalid wNAF");
-}
-class qr {
-  // Parametrized with a given Point class (not individual point)
-  constructor(t, r) {
-    this.BASE = t.BASE, this.ZERO = t.ZERO, this.Fn = t.Fn, this.bits = r;
-  }
-  // non-const time multiplication ladder
-  _unsafeLadder(t, r, n = this.ZERO) {
-    let s = t;
-    for (; r > kt; )
-      r & xt && (n = n.add(s)), s = s.double(), r >>= xt;
-    return n;
-  }
-  /**
-   * Creates a wNAF precomputation window. Used for caching.
-   * Default window size is set by `utils.precompute()` and is equal to 8.
-   * Number of precomputed points depends on the curve size:
-   * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:
-   * - 𝑊 is the window size
-   * - 𝑛 is the bitlength of the curve order.
-   * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.
-   * @param point Point instance
-   * @param W window size
-   * @returns precomputed point tables flattened to a single array
-   */
-  precomputeWindow(t, r) {
-    const { windows: n, windowSize: s } = me(r, this.bits), o = [];
-    let i = t, c = i;
-    for (let a = 0; a < n; a++) {
-      c = i, o.push(c);
-      for (let u = 1; u < s; u++)
-        c = c.add(i), o.push(c);
-      i = c.double();
-    }
-    return o;
-  }
-  /**
-   * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.
-   * More compact implementation:
-   * https://github.com/paulmillr/noble-secp256k1/blob/47cb1669b6e506ad66b35fe7d76132ae97465da2/index.ts#L502-L541
-   * @returns real and fake (for const-time) points
-   */
-  wNAF(t, r, n) {
-    if (!this.Fn.isValid(n))
-      throw new Error("invalid scalar");
-    let s = this.ZERO, o = this.BASE;
-    const i = me(t, this.bits);
-    for (let c = 0; c < i.windows; c++) {
-      const { nextN: a, offset: u, isZero: l, isNeg: d, isNegF: f, offsetF: b } = Xe(n, c, i);
-      n = a, l ? o = o.add(re(f, r[b])) : s = s.add(re(d, r[u]));
-    }
-    return We(n), { p: s, f: o };
-  }
-  /**
-   * Implements ec unsafe (non const-time) multiplication using precomputed tables and w-ary non-adjacent form.
-   * @param acc accumulator point to add result of multiplication
-   * @returns point
-   */
-  wNAFUnsafe(t, r, n, s = this.ZERO) {
-    const o = me(t, this.bits);
-    for (let i = 0; i < o.windows && n !== kt; i++) {
-      const { nextN: c, offset: a, isZero: u, isNeg: l } = Xe(n, i, o);
-      if (n = c, !u) {
-        const d = r[a];
-        s = s.add(l ? d.negate() : d);
-      }
-    }
-    return We(n), s;
-  }
-  getPrecomputes(t, r, n) {
-    let s = ge.get(r);
-    return s || (s = this.precomputeWindow(r, t), t !== 1 && (typeof n == "function" && (s = n(s)), ge.set(r, s))), s;
-  }
-  cached(t, r, n) {
-    const s = ye(t);
-    return this.wNAF(s, this.getPrecomputes(s, t, n), r);
-  }
-  unsafe(t, r, n, s) {
-    const o = ye(t);
-    return o === 1 ? this._unsafeLadder(t, r, s) : this.wNAFUnsafe(o, this.getPrecomputes(o, t, n), r, s);
-  }
-  // 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.
-  createCache(t, r) {
-    Dn(r, this.bits), Mn.set(t, r), ge.delete(t);
-  }
-  hasCache(t) {
-    return ye(t) !== 1;
-  }
-}
-function Rr(e, t, r, n) {
-  let s = t, o = e.ZERO, i = e.ZERO;
-  for (; r > kt || n > kt; )
-    r & xt && (o = o.add(s)), n & xt && (i = i.add(s)), s = s.double(), r >>= xt, n >>= xt;
-  return { p1: o, p2: i };
-}
-function Gr(e, t, r, n) {
-  Nr(r, e), Tr(n, t);
-  const s = r.length, o = n.length;
-  if (s !== o)
-    throw new Error("arrays of points and scalars must have equal length");
-  const i = e.ZERO, c = Vt(BigInt(s));
-  let a = 1;
-  c > 12 ? a = c - 3 : c > 4 ? a = c - 2 : c > 0 && (a = 2);
-  const u = Ot(a), l = new Array(Number(u) + 1).fill(i), d = Math.floor((t.BITS - 1) / a) * a;
-  let f = i;
-  for (let b = d; b >= 0; b -= a) {
-    l.fill(i);
-    for (let g = 0; g < o; g++) {
-      const w = n[g], T = Number(w >> BigInt(b) & u);
-      l[T] = l[T].add(r[g]);
-    }
-    let m = i;
-    for (let g = l.length - 1, w = i; g > 0; g--)
-      w = w.add(l[g]), m = m.add(w);
-    if (f = f.add(m), b !== 0)
-      for (let g = 0; g < a; g++)
-        f = f.double();
-  }
-  return f;
-}
-function Qe(e, t, r) {
-  if (t) {
-    if (t.ORDER !== e)
-      throw new Error("Field.ORDER must match order: Fp == p, Fn == n");
-    return Hn(t), t;
-  } else
-    return Pt(e, { isLE: r });
-}
-function Ur(e, t, r = {}, n) {
-  if (n === void 0 && (n = e === "edwards"), !t || typeof t != "object")
-    throw new Error(`expected valid ${e} CURVE object`);
-  for (const a of ["p", "n", "h"]) {
-    const u = t[a];
-    if (!(typeof u == "bigint" && u > kt))
-      throw new Error(`CURVE.${a} must be positive bigint`);
-  }
-  const s = Qe(t.p, r.Fp, n), o = Qe(t.n, r.Fn, n), c = ["Gx", "Gy", "a", "b"];
-  for (const a of c)
-    if (!s.isValid(t[a]))
-      throw new Error(`CURVE.${a} must be valid field element of CURVE.Fp`);
-  return t = Object.freeze(Object.assign({}, t)), { CURVE: t, Fp: s, Fn: o };
-}
-const Lr = ft;
-function gt(e, t) {
-  if (Ft(e), Ft(t), e < 0 || e >= 1 << 8 * t)
-    throw new Error("invalid I2OSP input: " + e);
-  const r = Array.from({ length: t }).fill(0);
-  for (let n = t - 1; n >= 0; n--)
-    r[n] = e & 255, e >>>= 8;
-  return new Uint8Array(r);
-}
-function Hr(e, t) {
-  const r = new Uint8Array(e.length);
-  for (let n = 0; n < e.length; n++)
-    r[n] = e[n] ^ t[n];
-  return r;
-}
-function Ft(e) {
-  if (!Number.isSafeInteger(e))
-    throw new Error("number expected");
-}
-function Zn(e) {
-  if (!ce(e) && typeof e != "string")
-    throw new Error("DST must be Uint8Array or string");
-  return typeof e == "string" ? $t(e) : e;
-}
-function kr(e, t, r, n) {
-  Q(e), Ft(r), t = Zn(t), t.length > 255 && (t = n(V($t("H2C-OVERSIZE-DST-"), t)));
-  const { outputLen: s, blockLen: o } = n, i = Math.ceil(r / s);
-  if (r > 65535 || i > 255)
-    throw new Error("expand_message_xmd: invalid lenInBytes");
-  const c = V(t, gt(t.length, 1)), a = gt(0, o), u = gt(r, 2), l = new Array(i), d = n(V(a, e, u, gt(0, 1), c));
-  l[0] = n(V(d, gt(1, 1), c));
-  for (let b = 1; b <= i; b++) {
-    const m = [Hr(d, l[b - 1]), gt(b + 1, 1), c];
-    l[b] = n(V(...m));
-  }
-  return V(...l).slice(0, r);
-}
-function Pr(e, t, r, n, s) {
-  if (Q(e), Ft(r), t = Zn(t), t.length > 255) {
-    const o = Math.ceil(2 * n / 8);
-    t = s.create({ dkLen: o }).update($t("H2C-OVERSIZE-DST-")).update(t).digest();
-  }
-  if (r > 65535 || t.length > 255)
-    throw new Error("expand_message_xof: invalid lenInBytes");
-  return s.create({ dkLen: r }).update(e).update(gt(r, 2)).update(t).update(gt(t.length, 1)).digest();
-}
-function pe(e, t, r) {
-  ke(r, {
-    p: "bigint",
-    m: "number",
-    k: "number",
-    hash: "function"
-  });
-  const { p: n, k: s, m: o, hash: i, expand: c, DST: a } = r;
-  if (!Er(r.hash))
-    throw new Error("expected valid hash");
-  Q(e), Ft(t);
-  const u = n.toString(2).length, l = Math.ceil((u + s) / 8), d = t * o * l;
-  let f;
-  if (c === "xmd")
-    f = kr(e, a, d, i);
-  else if (c === "xof")
-    f = Pr(e, a, d, s, i);
-  else if (c === "_internal_pass")
-    f = e;
-  else
-    throw new Error('expand must be "xmd" or "xof"');
-  const b = new Array(t);
-  for (let m = 0; m < t; m++) {
-    const g = new Array(o);
-    for (let w = 0; w < o; w++) {
-      const T = l * (w + m * o), H = f.subarray(T, T + l);
-      g[w] = et(Lr(H), n);
-    }
-    b[m] = g;
-  }
-  return b;
-}
-function Kn(e, t) {
-  const r = t.map((n) => Array.from(n).reverse());
-  return (n, s) => {
-    const [o, i, c, a] = r.map((d) => d.reduce((f, b) => e.add(e.mul(f, n), b))), [u, l] = It(e, [i, a], !0);
-    return n = e.mul(o, u), s = e.mul(s, e.mul(c, l)), { x: n, y: s };
-  };
-}
-const Dr = $t("HashToScalar-");
-function Je(e, t, r) {
-  if (typeof t != "function")
-    throw new Error("mapToCurve() must be defined");
-  function n(o) {
-    return e.fromAffine(t(o));
-  }
-  function s(o) {
-    const i = o.clearCofactor();
-    return i.equals(e.ZERO) ? e.ZERO : (i.assertValidity(), i);
-  }
-  return {
-    defaults: r,
-    hashToCurve(o, i) {
-      const c = Object.assign({}, r, i), a = pe(o, 2, c), u = n(a[0]), l = n(a[1]);
-      return s(u.add(l));
-    },
-    encodeToCurve(o, i) {
-      const c = r.encodeDST ? { DST: r.encodeDST } : {}, a = Object.assign({}, r, c, i), u = pe(o, 1, a), l = n(u[0]);
-      return s(l);
-    },
-    /** See {@link H2CHasher} */
-    mapToCurve(o) {
-      if (!Array.isArray(o))
-        throw new Error("expected array of bigints");
-      for (const i of o)
-        if (typeof i != "bigint")
-          throw new Error("expected array of bigints");
-      return s(n(o));
-    },
-    // hash_to_scalar can produce 0: https://www.rfc-editor.org/errata/eid8393
-    // RFC 9380, draft-irtf-cfrg-bbs-signatures-08
-    hashToScalar(o, i) {
-      const c = e.Fn.ORDER, a = Object.assign({}, r, { p: c, m: 1, DST: Dr }, i);
-      return pe(o, 1, a)[0][0];
-    }
-  };
-}
-class Yn extends Le {
-  constructor(t, r) {
-    super(), this.finished = !1, this.destroyed = !1, Ue(t);
-    const n = vt(r);
-    if (this.iHash = t.create(), typeof this.iHash.update != "function")
-      throw new Error("Expected instance of class which extends utils.Hash");
-    this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
-    const s = this.blockLen, o = new Uint8Array(s);
-    o.set(n.length > s ? t.create().update(n).digest() : n);
-    for (let i = 0; i < o.length; i++)
-      o[i] ^= 54;
-    this.iHash.update(o), this.oHash = t.create();
-    for (let i = 0; i < o.length; i++)
-      o[i] ^= 106;
-    this.oHash.update(o), St(o);
-  }
-  update(t) {
-    return Lt(this), this.iHash.update(t), this;
-  }
-  digestInto(t) {
-    Lt(this), Q(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
-  }
-  digest() {
-    const t = new Uint8Array(this.oHash.outputLen);
-    return this.digestInto(t), t;
-  }
-  _cloneInto(t) {
-    t || (t = Object.create(Object.getPrototypeOf(this), {}));
-    const { oHash: r, iHash: n, finished: s, destroyed: o, blockLen: i, outputLen: c } = this;
-    return t = t, t.finished = s, t.destroyed = o, t.blockLen = i, t.outputLen = c, t.oHash = r._cloneInto(t.oHash), t.iHash = n._cloneInto(t.iHash), t;
-  }
-  clone() {
-    return this._cloneInto();
-  }
-  destroy() {
-    this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
-  }
-}
-const De = (e, t, r) => new Yn(e, t).update(r).digest();
-De.create = (e, t) => new Yn(e, t);
-const tn = (e, t) => (e + (e >= 0 ? t : -t) / dt) / t;
-function Mr(e, t, r) {
-  const [[n, s], [o, i]] = t, c = tn(i * e, r), a = tn(-s * e, r);
-  let u = e - c * n - a * o, l = -c * s - a * i;
-  const d = u < Bt, f = l < Bt;
-  d && (u = -u), f && (l = -l);
-  const b = Ot(Math.ceil(Vt(r) / 2)) + j;
-  if (u < Bt || u >= b || l < Bt || l >= b)
-    throw new Error("splitScalar (endomorphism): failed, k=" + e);
-  return { k1neg: d, k1: u, k2neg: f, k2: l };
-}
-const Bt = BigInt(0), j = BigInt(1), dt = BigInt(2), Rt = BigInt(3), Oe = BigInt(4);
-function se(e, t) {
-  const { BYTES: r } = e;
-  let n;
-  if (typeof t == "bigint")
-    n = t;
-  else {
-    let s = Ht("private key", t);
-    try {
-      n = e.fromBytes(s);
-    } catch {
-      throw new Error(`invalid private key: expected ui8a of size ${r}, got ${typeof t}`);
-    }
-  }
-  if (!e.isValidNot0(n))
-    throw new Error("invalid private key: out of range [1..N-1]");
-  return n;
-}
-function Zr(e, t = {}) {
-  const r = Ur("weierstrass", e, t), { Fp: n, Fn: s } = r;
-  let o = r.CURVE;
-  const { h: i, n: c } = o;
-  ke(t, {}, {
-    allowInfinityPoint: "boolean",
-    clearCofactor: "function",
-    isTorsionFree: "function",
-    fromBytes: "function",
-    toBytes: "function",
-    endo: "object",
-    wrapPrivateKey: "boolean"
-  });
-  const { endo: a } = t;
-  if (a && (!n.is0(o.a) || typeof a.beta != "bigint" || !Array.isArray(a.basises)))
-    throw new Error('invalid endo: expected "beta": bigint and "basises": array');
-  const u = Vr(n, s);
-  function l() {
-    if (!n.isOdd)
-      throw new Error("compression is not supported: Field does not have .isOdd()");
-  }
-  function d(q, h, y) {
-    const { x: v, y: U } = h.toAffine(), M = n.toBytes(v);
-    if (ze(y, "isCompressed"), y) {
-      l();
-      const p = !n.isOdd(U);
-      return V(Kr(p), M);
-    } else
-      return V(Uint8Array.of(4), M, n.toBytes(U));
-  }
-  function f(q) {
-    $e(q, void 0, "Point");
-    const { publicKey: h, publicKeyUncompressed: y } = u, v = q.length, U = q[0], M = q.subarray(1);
-    if (v === h && (U === 2 || U === 3)) {
-      const p = n.fromBytes(M);
-      if (!n.isValid(p))
-        throw new Error("bad point: is not on curve, wrong x");
-      const E = g(p);
-      let B;
-      try {
-        B = n.sqrt(E);
-      } catch (J) {
-        const F = J instanceof Error ? ": " + J.message : "";
-        throw new Error("bad point: is not on curve, sqrt error" + F);
-      }
-      l();
-      const R = n.isOdd(B);
-      return (U & 1) === 1 !== R && (B = n.neg(B)), { x: p, y: B };
-    } else if (v === y && U === 4) {
-      const p = n.BYTES, E = n.fromBytes(M.subarray(0, p)), B = n.fromBytes(M.subarray(p, p * 2));
-      if (!w(E, B))
-        throw new Error("bad point: is not on curve");
-      return { x: E, y: B };
-    } else
-      throw new Error(`bad point: got length ${v}, expected compressed=${h} or uncompressed=${y}`);
-  }
-  const b = t.toBytes || d, m = t.fromBytes || f;
-  function g(q) {
-    const h = n.sqr(q), y = n.mul(h, q);
-    return n.add(n.add(y, n.mul(q, o.a)), o.b);
-  }
-  function w(q, h) {
-    const y = n.sqr(h), v = g(q);
-    return n.eql(y, v);
-  }
-  if (!w(o.Gx, o.Gy))
-    throw new Error("bad curve params: generator point");
-  const T = n.mul(n.pow(o.a, Rt), Oe), H = n.mul(n.sqr(o.b), BigInt(27));
-  if (n.is0(n.add(T, H)))
-    throw new Error("bad curve params: a or b");
-  function O(q, h, y = !1) {
-    if (!n.isValid(h) || y && n.is0(h))
-      throw new Error(`bad point coordinate ${q}`);
-    return h;
-  }
-  function _(q) {
-    if (!(q instanceof S))
-      throw new Error("ProjectivePoint expected");
-  }
-  function A(q) {
-    if (!a || !a.basises)
-      throw new Error("no endo");
-    return Mr(q, a.basises, s.ORDER);
-  }
-  const I = Ae((q, h) => {
-    const { X: y, Y: v, Z: U } = q;
-    if (n.eql(U, n.ONE))
-      return { x: y, y: v };
-    const M = q.is0();
-    h == null && (h = M ? n.ONE : n.inv(U));
-    const p = n.mul(y, h), E = n.mul(v, h), B = n.mul(U, h);
-    if (M)
-      return { x: n.ZERO, y: n.ZERO };
-    if (!n.eql(B, n.ONE))
-      throw new Error("invZ was invalid");
-    return { x: p, y: E };
-  }), N = Ae((q) => {
-    if (q.is0()) {
-      if (t.allowInfinityPoint && !n.is0(q.Y))
-        return;
-      throw new Error("bad point: ZERO");
-    }
-    const { x: h, y } = q.toAffine();
-    if (!n.isValid(h) || !n.isValid(y))
-      throw new Error("bad point: x or y not field elements");
-    if (!w(h, y))
-      throw new Error("bad point: equation left != right");
-    if (!q.isTorsionFree())
-      throw new Error("bad point: not in prime-order subgroup");
-    return !0;
-  });
-  function D(q, h, y, v, U) {
-    return y = new S(n.mul(y.X, q), y.Y, y.Z), h = re(v, h), y = re(U, y), h.add(y);
-  }
-  class S {
-    /** Does NOT validate if the point is valid. Use `.assertValidity()`. */
-    constructor(h, y, v) {
-      this.X = O("x", h), this.Y = O("y", y, !0), this.Z = O("z", v), Object.freeze(this);
-    }
-    static CURVE() {
-      return o;
-    }
-    /** Does NOT validate if the point is valid. Use `.assertValidity()`. */
-    static fromAffine(h) {
-      const { x: y, y: v } = h || {};
-      if (!h || !n.isValid(y) || !n.isValid(v))
-        throw new Error("invalid affine point");
-      if (h instanceof S)
-        throw new Error("projective point not allowed");
-      return n.is0(y) && n.is0(v) ? S.ZERO : new S(y, v, n.ONE);
-    }
-    static fromBytes(h) {
-      const y = S.fromAffine(m($e(h, void 0, "point")));
-      return y.assertValidity(), y;
-    }
-    static fromHex(h) {
-      return S.fromBytes(Ht("pointHex", h));
-    }
-    get x() {
-      return this.toAffine().x;
-    }
-    get y() {
-      return this.toAffine().y;
-    }
-    /**
-     *
-     * @param windowSize
-     * @param isLazy true will defer table computation until the first multiplication
-     * @returns
-     */
-    precompute(h = 8, y = !0) {
-      return Y.createCache(this, h), y || this.multiply(Rt), this;
-    }
-    // TODO: return `this`
-    /** A point on curve is valid if it conforms to equation. */
-    assertValidity() {
-      N(this);
-    }
-    hasEvenY() {
-      const { y: h } = this.toAffine();
-      if (!n.isOdd)
-        throw new Error("Field doesn't support isOdd");
-      return !n.isOdd(h);
-    }
-    /** Compare one point to another. */
-    equals(h) {
-      _(h);
-      const { X: y, Y: v, Z: U } = this, { X: M, Y: p, Z: E } = h, B = n.eql(n.mul(y, E), n.mul(M, U)), R = n.eql(n.mul(v, E), n.mul(p, U));
-      return B && R;
-    }
-    /** Flips point to one corresponding to (x, -y) in Affine coordinates. */
-    negate() {
-      return new S(this.X, n.neg(this.Y), this.Z);
-    }
-    // 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: h, b: y } = o, v = n.mul(y, Rt), { X: U, Y: M, Z: p } = this;
-      let E = n.ZERO, B = n.ZERO, R = n.ZERO, G = n.mul(U, U), J = n.mul(M, M), F = n.mul(p, p), Z = n.mul(U, M);
-      return Z = n.add(Z, Z), R = n.mul(U, p), R = n.add(R, R), E = n.mul(h, R), B = n.mul(v, F), B = n.add(E, B), E = n.sub(J, B), B = n.add(J, B), B = n.mul(E, B), E = n.mul(Z, E), R = n.mul(v, R), F = n.mul(h, F), Z = n.sub(G, F), Z = n.mul(h, Z), Z = n.add(Z, R), R = n.add(G, G), G = n.add(R, G), G = n.add(G, F), G = n.mul(G, Z), B = n.add(B, G), F = n.mul(M, p), F = n.add(F, F), G = n.mul(F, Z), E = n.sub(E, G), R = n.mul(F, J), R = n.add(R, R), R = n.add(R, R), new S(E, B, R);
-    }
-    // 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(h) {
-      _(h);
-      const { X: y, Y: v, Z: U } = this, { X: M, Y: p, Z: E } = h;
-      let B = n.ZERO, R = n.ZERO, G = n.ZERO;
-      const J = o.a, F = n.mul(o.b, Rt);
-      let Z = n.mul(y, M), st = n.mul(v, p), ot = n.mul(U, E), Nt = n.add(y, v), $ = n.add(M, p);
-      Nt = n.mul(Nt, $), $ = n.add(Z, st), Nt = n.sub(Nt, $), $ = n.add(y, U);
-      let ct = n.add(M, E);
-      return $ = n.mul($, ct), ct = n.add(Z, ot), $ = n.sub($, ct), ct = n.add(v, U), B = n.add(p, E), ct = n.mul(ct, B), B = n.add(st, ot), ct = n.sub(ct, B), G = n.mul(J, $), B = n.mul(F, ot), G = n.add(B, G), B = n.sub(st, G), G = n.add(st, G), R = n.mul(B, G), st = n.add(Z, Z), st = n.add(st, Z), ot = n.mul(J, ot), $ = n.mul(F, $), st = n.add(st, ot), ot = n.sub(Z, ot), ot = n.mul(J, ot), $ = n.add($, ot), Z = n.mul(st, $), R = n.add(R, Z), Z = n.mul(ct, $), B = n.mul(Nt, B), B = n.sub(B, Z), Z = n.mul(Nt, st), G = n.mul(ct, G), G = n.add(G, Z), new S(B, R, G);
-    }
-    subtract(h) {
-      return this.add(h.negate());
-    }
-    is0() {
-      return this.equals(S.ZERO);
-    }
-    /**
-     * 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(h) {
-      const { endo: y } = t;
-      if (!s.isValidNot0(h))
-        throw new Error("invalid scalar: out of range");
-      let v, U;
-      const M = (p) => Y.cached(this, p, (E) => Kt(S, E));
-      if (y) {
-        const { k1neg: p, k1: E, k2neg: B, k2: R } = A(h), { p: G, f: J } = M(E), { p: F, f: Z } = M(R);
-        U = J.add(Z), v = D(y.beta, G, F, p, B);
-      } else {
-        const { p, f: E } = M(h);
-        v = p, U = E;
-      }
-      return Kt(S, [v, U])[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 secret key e.g. sig verification, which works over *public* keys.
-     */
-    multiplyUnsafe(h) {
-      const { endo: y } = t, v = this;
-      if (!s.isValid(h))
-        throw new Error("invalid scalar: out of range");
-      if (h === Bt || v.is0())
-        return S.ZERO;
-      if (h === j)
-        return v;
-      if (Y.hasCache(this))
-        return this.multiply(h);
-      if (y) {
-        const { k1neg: U, k1: M, k2neg: p, k2: E } = A(h), { p1: B, p2: R } = Rr(S, v, M, E);
-        return D(y.beta, B, R, U, p);
-      } else
-        return Y.unsafe(v, h);
-    }
-    multiplyAndAddUnsafe(h, y, v) {
-      const U = this.multiplyUnsafe(y).add(h.multiplyUnsafe(v));
-      return U.is0() ? void 0 : U;
-    }
-    /**
-     * Converts Projective point to affine (x, y) coordinates.
-     * @param invertedZ Z^-1 (inverted zero) - optional, precomputation is useful for invertBatch
-     */
-    toAffine(h) {
-      return I(this, h);
-    }
-    /**
-     * Checks whether Point is free of torsion elements (is in prime subgroup).
-     * Always torsion-free for cofactor=1 curves.
-     */
-    isTorsionFree() {
-      const { isTorsionFree: h } = t;
-      return i === j ? !0 : h ? h(S, this) : Y.unsafe(this, c).is0();
-    }
-    clearCofactor() {
-      const { clearCofactor: h } = t;
-      return i === j ? this : h ? h(S, this) : this.multiplyUnsafe(i);
-    }
-    isSmallOrder() {
-      return this.multiplyUnsafe(i).is0();
-    }
-    toBytes(h = !0) {
-      return ze(h, "isCompressed"), this.assertValidity(), b(S, this, h);
-    }
-    toHex(h = !0) {
-      return Yt(this.toBytes(h));
-    }
-    toString() {
-      return `<Point ${this.is0() ? "ZERO" : this.toHex()}>`;
-    }
-    // TODO: remove
-    get px() {
-      return this.X;
-    }
-    get py() {
-      return this.X;
-    }
-    get pz() {
-      return this.Z;
-    }
-    toRawBytes(h = !0) {
-      return this.toBytes(h);
-    }
-    _setWindowSize(h) {
-      this.precompute(h);
-    }
-    static normalizeZ(h) {
-      return Kt(S, h);
-    }
-    static msm(h, y) {
-      return Gr(S, s, h, y);
-    }
-    static fromPrivateKey(h) {
-      return S.BASE.multiply(se(s, h));
-    }
-  }
-  S.BASE = new S(o.Gx, o.Gy, n.ONE), S.ZERO = new S(n.ZERO, n.ONE, n.ZERO), S.Fp = n, S.Fn = s;
-  const K = s.BITS, Y = new qr(S, t.endo ? Math.ceil(K / 2) : K);
-  return S.BASE.precompute(8), S;
-}
-function Kr(e) {
-  return Uint8Array.of(e ? 2 : 3);
-}
-function Yr(e, t) {
-  const r = e.ORDER;
-  let n = Bt;
-  for (let m = r - j; m % dt === Bt; m /= dt)
-    n += j;
-  const s = n, o = dt << s - j - j, i = o * dt, c = (r - j) / i, a = (c - j) / dt, u = i - j, l = o, d = e.pow(t, c), f = e.pow(t, (c + j) / dt);
-  let b = (m, g) => {
-    let w = d, T = e.pow(g, u), H = e.sqr(T);
-    H = e.mul(H, g);
-    let O = e.mul(m, H);
-    O = e.pow(O, a), O = e.mul(O, T), T = e.mul(O, g), H = e.mul(O, m);
-    let _ = e.mul(H, T);
-    O = e.pow(_, l);
-    let A = e.eql(O, e.ONE);
-    T = e.mul(H, f), O = e.mul(_, w), H = e.cmov(T, H, A), _ = e.cmov(O, _, A);
-    for (let I = s; I > j; I--) {
-      let N = I - dt;
-      N = dt << N - j;
-      let D = e.pow(_, N);
-      const S = e.eql(D, e.ONE);
-      T = e.mul(H, w), w = e.mul(w, w), D = e.mul(_, w), H = e.cmov(T, H, S), _ = e.cmov(D, _, S);
-    }
-    return { isValid: A, value: H };
-  };
-  if (e.ORDER % Oe === Rt) {
-    const m = (e.ORDER - Rt) / Oe, g = e.sqrt(e.neg(t));
-    b = (w, T) => {
-      let H = e.sqr(T);
-      const O = e.mul(w, T);
-      H = e.mul(H, O);
-      let _ = e.pow(H, m);
-      _ = e.mul(_, O);
-      const A = e.mul(_, g), I = e.mul(e.sqr(_), T), N = e.eql(I, w);
-      let D = e.cmov(A, _, N);
-      return { isValid: N, value: D };
-    };
-  }
-  return b;
-}
-function Vn(e, t) {
-  Hn(e);
-  const { A: r, B: n, Z: s } = t;
-  if (!e.isValid(r) || !e.isValid(n) || !e.isValid(s))
-    throw new Error("mapToCurveSimpleSWU: invalid opts");
-  const o = Yr(e, s);
-  if (!e.isOdd)
-    throw new Error("Field does not have .isOdd()");
-  return (i) => {
-    let c, a, u, l, d, f, b, m;
-    c = e.sqr(i), c = e.mul(c, s), a = e.sqr(c), a = e.add(a, c), u = e.add(a, e.ONE), u = e.mul(u, n), l = e.cmov(s, e.neg(a), !e.eql(a, e.ZERO)), l = e.mul(l, r), a = e.sqr(u), f = e.sqr(l), d = e.mul(f, r), a = e.add(a, d), a = e.mul(a, u), f = e.mul(f, l), d = e.mul(f, n), a = e.add(a, d), b = e.mul(c, u);
-    const { isValid: g, value: w } = o(a, f);
-    m = e.mul(c, i), m = e.mul(m, w), b = e.cmov(b, u, g), m = e.cmov(m, w, g);
-    const T = e.isOdd(i) === e.isOdd(m);
-    m = e.cmov(e.neg(m), m, T);
-    const H = It(e, [l], !0)[0];
-    return b = e.mul(b, H), { x: b, y: m };
-  };
-}
-function Vr(e, t) {
-  return {
-    secretKey: t.BYTES,
-    publicKey: 1 + e.BYTES,
-    publicKeyUncompressed: 1 + 2 * e.BYTES,
-    publicKeyHasPrefix: !0,
-    signature: 2 * t.BYTES
-  };
-}
-function en(e) {
-  const { CURVE: t, curveOpts: r } = Fr(e), n = Zr(t, r);
-  return zr(e, n);
-}
-function Fr(e) {
-  const t = {
-    a: e.a,
-    b: e.b,
-    p: e.Fp.ORDER,
-    n: e.n,
-    h: e.h,
-    Gx: e.Gx,
-    Gy: e.Gy
-  }, r = e.Fp;
-  let n = e.allowedPrivateKeyLengths ? Array.from(new Set(e.allowedPrivateKeyLengths.map((i) => Math.ceil(i / 2)))) : void 0;
-  const s = Pt(t.n, {
-    BITS: e.nBitLength,
-    allowedLengths: n,
-    modFromBytes: e.wrapPrivateKey
-  }), o = {
-    Fp: r,
-    Fn: s,
-    allowInfinityPoint: e.allowInfinityPoint,
-    endo: e.endo,
-    isTorsionFree: e.isTorsionFree,
-    clearCofactor: e.clearCofactor,
-    fromBytes: e.fromBytes,
-    toBytes: e.toBytes
-  };
-  return { CURVE: t, curveOpts: o };
-}
-function Cr(e, t, r) {
-  function n(s) {
-    const o = e.sqr(s), i = e.mul(o, s);
-    return e.add(e.add(i, e.mul(s, t)), r);
-  }
-  return n;
-}
-function zr(e, t) {
-  const { Fp: r, Fn: n } = t;
-  function s(i) {
-    return pr(i, j, n.ORDER);
-  }
-  const o = Cr(r, e.a, e.b);
-  return Object.assign({}, {
-    CURVE: e,
-    Point: t,
-    ProjectivePoint: t,
-    normPrivateKeyToScalar: (i) => se(n, i),
-    weierstrassEquation: o,
-    isWithinCurveOrder: s
-  });
-}
-const $r = BigInt(0), Qt = BigInt(1), nn = BigInt(2), Gt = BigInt(3);
-function jr(e) {
-  const t = [];
-  for (; e > Qt; e >>= Qt)
-    (e & Qt) === $r ? t.unshift(0) : (e & Gt) === Gt ? (t.unshift(-1), e += Qt) : t.unshift(1);
-  return t;
-}
-function we(e) {
-  if (!Array.isArray(e) || e.length === 0)
-    throw new Error("expected non-empty array");
-}
-function Xr(e, t, r, n) {
-  const { Fp2: s, Fp12: o } = e, { twistType: i, ateLoopSize: c, xNegative: a, postPrecompute: u } = n;
-  let l;
-  if (i === "multiplicative")
-    l = (O, _, A, I, N, D) => o.mul014(I, O, s.mul(_, N), s.mul(A, D));
-  else if (i === "divisive")
-    l = (O, _, A, I, N, D) => o.mul034(I, s.mul(A, D), s.mul(_, N), O);
-  else
-    throw new Error("bls: unknown twist type");
-  const d = s.div(s.ONE, s.mul(s.ONE, nn));
-  function f(O, _, A, I) {
-    const N = s.sqr(A), D = s.sqr(I), S = s.mulByB(s.mul(D, Gt)), K = s.mul(S, Gt), Y = s.sub(s.sub(s.sqr(s.add(A, I)), D), N), q = s.sub(S, N), h = s.mul(s.sqr(_), Gt), y = s.neg(Y);
-    return O.push([q, h, y]), _ = s.mul(s.mul(s.mul(s.sub(N, K), _), A), d), A = s.sub(s.sqr(s.mul(s.add(N, K), d)), s.mul(s.sqr(S), Gt)), I = s.mul(N, Y), { Rx: _, Ry: A, Rz: I };
-  }
-  function b(O, _, A, I, N, D) {
-    const S = s.sub(A, s.mul(D, I)), K = s.sub(_, s.mul(N, I)), Y = s.sub(s.mul(S, N), s.mul(K, D)), q = s.neg(S), h = K;
-    O.push([Y, q, h]);
-    const y = s.sqr(K), v = s.mul(y, K), U = s.mul(y, _), M = s.add(s.sub(v, s.mul(U, nn)), s.mul(s.sqr(S), I));
-    return _ = s.mul(K, M), A = s.sub(s.mul(s.sub(U, M), S), s.mul(v, A)), I = s.mul(I, v), { Rx: _, Ry: A, Rz: I };
-  }
-  const m = jr(c), g = Ae((O) => {
-    const _ = O, { x: A, y: I } = _.toAffine(), N = A, D = I, S = s.neg(I);
-    let K = N, Y = D, q = s.ONE;
-    const h = [];
-    for (const y of m) {
-      const v = [];
-      ({ Rx: K, Ry: Y, Rz: q } = f(v, K, Y, q)), y && ({ Rx: K, Ry: Y, Rz: q } = b(v, K, Y, q, N, y === -1 ? S : D)), h.push(v);
-    }
-    if (u) {
-      const y = h[h.length - 1];
-      u(K, Y, q, N, D, b.bind(null, y));
-    }
-    return h;
-  });
-  function w(O, _ = !1) {
-    let A = o.ONE;
-    if (O.length) {
-      const I = O[0][0].length;
-      for (let N = 0; N < I; N++) {
-        A = o.sqr(A);
-        for (const [D, S, K] of O)
-          for (const [Y, q, h] of D[N])
-            A = l(Y, q, h, A, S, K);
-      }
-    }
-    return a && (A = o.conjugate(A)), _ ? o.finalExponentiate(A) : A;
-  }
-  function T(O, _ = !0) {
-    const A = [];
-    Kt(t, O.map(({ g1: I }) => I)), Kt(r, O.map(({ g2: I }) => I));
-    for (const { g1: I, g2: N } of O) {
-      if (I.is0() || N.is0())
-        throw new Error("pairing is not available for ZERO point");
-      I.assertValidity(), N.assertValidity();
-      const D = I.toAffine();
-      A.push([g(N), D.x, D.y]);
-    }
-    return w(A, _);
-  }
-  function H(O, _, A = !0) {
-    return T([{ g1: O, g2: _ }], A);
-  }
-  return {
-    Fp12: o,
-    // NOTE: we re-export Fp12 here because pairing results are Fp12!
-    millerLoopBatch: w,
-    pairing: H,
-    pairingBatch: T,
-    calcPairingPrecomputes: g
-  };
-}
-function rn(e, t, r, n, s) {
-  const { Fp12: o, pairingBatch: i } = e;
-  function c(d) {
-    return d instanceof t.Point ? d : t.Point.fromHex(d);
-  }
-  function a(d) {
-    return d instanceof r.Point ? d : r.Point.fromHex(d);
-  }
-  function u(d) {
-    if (!(d instanceof r.Point))
-      throw new Error(`expected valid message hashed to ${s ? "G1" : "G2"} curve`);
-    return d;
-  }
-  const l = s ? (d, f) => ({ g1: f, g2: d }) : (d, f) => ({ g1: d, g2: f });
-  return {
-    // P = pk x G
-    getPublicKey(d) {
-      const f = se(t.Point.Fn, d);
-      return t.Point.BASE.multiply(f);
-    },
-    // S = pk x H(m)
-    sign(d, f, b) {
-      if (b != null)
-        throw new Error("sign() expects 2 arguments");
-      const m = se(t.Point.Fn, f);
-      return u(d).assertValidity(), d.multiply(m);
-    },
-    // Checks if pairing of public key & hash is equal to pairing of generator & signature.
-    // e(P, H(m)) == e(G, S)
-    // e(S, G) == e(H(m), P)
-    verify(d, f, b, m) {
-      if (m != null)
-        throw new Error("verify() expects 3 arguments");
-      d = a(d), b = c(b);
-      const g = b.negate(), w = t.Point.BASE, T = u(f), H = d, O = i([l(g, T), l(w, H)]);
-      return o.eql(O, o.ONE);
-    },
-    // https://ethresear.ch/t/fast-verification-of-multiple-bls-signatures/5407
-    // e(G, S) = e(G, SUM(n)(Si)) = MUL(n)(e(G, Si))
-    // TODO: maybe `{message: G2Hex, publicKey: G1Hex}[]` instead?
-    verifyBatch(d, f, b) {
-      if (we(f), b.length !== f.length)
-        throw new Error("amount of public keys and messages should be equal");
-      const m = a(d), g = f, w = b.map(c), T = /* @__PURE__ */ new Map();
-      for (let _ = 0; _ < w.length; _++) {
-        const A = w[_], I = g[_];
-        let N = T.get(I);
-        N === void 0 && (N = [], T.set(I, N)), N.push(A);
-      }
-      const H = [], O = t.Point.BASE;
-      try {
-        for (const [_, A] of T) {
-          const I = A.reduce((N, D) => N.add(D));
-          H.push(l(I, _));
-        }
-        return H.push(l(O.negate(), m)), o.eql(i(H), o.ONE);
-      } catch {
-        return !1;
-      }
-    },
-    // Adds a bunch of public key points together.
-    // pk1 + pk2 + pk3 = pkA
-    aggregatePublicKeys(d) {
-      we(d), d = d.map((b) => c(b));
-      const f = d.reduce((b, m) => b.add(m), t.Point.ZERO);
-      return f.assertValidity(), f;
-    },
-    // Adds a bunch of signature points together.
-    // pk1 + pk2 + pk3 = pkA
-    aggregateSignatures(d) {
-      we(d), d = d.map((b) => a(b));
-      const f = d.reduce((b, m) => b.add(m), r.Point.ZERO);
-      return f.assertValidity(), f;
-    },
-    hash(d, f) {
-      Q(d);
-      const b = f ? { DST: f } : void 0;
-      return r.hashToCurve(d, b);
-    },
-    Signature: n
-  };
-}
-function Wr(e) {
-  const { Fp: t, Fr: r, Fp2: n, Fp6: s, Fp12: o } = e.fields, i = en(e.G1), c = Object.assign(i, Je(i.Point, e.G1.mapToCurve, {
-    ...e.htfDefaults,
-    ...e.G1.htfDefaults
-  })), a = en(e.G2), u = Object.assign(a, Je(a.Point, e.G2.mapToCurve, {
-    ...e.htfDefaults,
-    ...e.G2.htfDefaults
-  })), l = Xr(e.fields, c.Point, u.Point, {
-    ...e.params,
-    postPrecompute: e.postPrecompute
-  }), { millerLoopBatch: d, pairing: f, pairingBatch: b, calcPairingPrecomputes: m } = l, g = rn(l, c, u, e.G2.Signature, !1), w = rn(l, u, c, e.G1.ShortSignature, !0), T = e.randomBytes || or, H = () => {
-    const p = Pn(r.ORDER);
-    return Ir(T(p), r.ORDER);
-  }, O = {
-    randomSecretKey: H,
-    randomPrivateKey: H,
-    calcPairingPrecomputes: m
-  }, { ShortSignature: _ } = e.G1, { Signature: A } = e.G2;
-  function I(p, E) {
-    return p instanceof c.Point ? p : w.hash(Ht("point", p), E?.DST);
-  }
-  function N(p, E) {
-    return p instanceof u.Point ? p : g.hash(Ht("point", p), E?.DST);
-  }
-  function D(p) {
-    return g.getPublicKey(p).toBytes(!0);
-  }
-  function S(p) {
-    return w.getPublicKey(p).toBytes(!0);
-  }
-  function K(p, E, B) {
-    const R = N(p, B), G = g.sign(R, E);
-    return p instanceof u.Point ? G : A.toBytes(G);
-  }
-  function Y(p, E, B) {
-    const R = I(p, B), G = w.sign(R, E);
-    return p instanceof c.Point ? G : _.toBytes(G);
-  }
-  function q(p, E, B, R) {
-    const G = N(E, R);
-    return g.verify(p, G, B);
-  }
-  function h(p, E, B, R) {
-    const G = I(E, R);
-    return w.verify(p, G, B);
-  }
-  function y(p) {
-    const E = g.aggregatePublicKeys(p);
-    return p[0] instanceof c.Point ? E : E.toBytes(!0);
-  }
-  function v(p) {
-    const E = g.aggregateSignatures(p);
-    return p[0] instanceof u.Point ? E : A.toBytes(E);
-  }
-  function U(p) {
-    const E = w.aggregateSignatures(p);
-    return p[0] instanceof c.Point ? E : _.toBytes(E);
-  }
-  function M(p, E, B, R) {
-    const G = E.map((J) => N(J, R));
-    return g.verifyBatch(p, G, B);
-  }
-  return c.Point.BASE.precompute(4), {
-    longSignatures: g,
-    shortSignatures: w,
-    millerLoopBatch: d,
-    pairing: f,
-    pairingBatch: b,
-    verifyBatch: M,
-    fields: {
-      Fr: r,
-      Fp: t,
-      Fp2: n,
-      Fp6: s,
-      Fp12: o
-    },
-    params: {
-      ateLoopSize: e.params.ateLoopSize,
-      twistType: e.params.twistType,
-      // deprecated
-      r: e.params.r,
-      G1b: e.G1.b,
-      G2b: e.G2.b
-    },
-    utils: O,
-    // deprecated
-    getPublicKey: D,
-    getPublicKeyForShortSignatures: S,
-    sign: K,
-    signShortSignature: Y,
-    verify: q,
-    verifyShortSignature: h,
-    aggregatePublicKeys: y,
-    aggregateSignatures: v,
-    aggregateShortSignatures: U,
-    G1: c,
-    G2: u,
-    Signature: A,
-    ShortSignature: _
-  };
-}
-const sn = BigInt(0), lt = BigInt(1), X = BigInt(2), on = BigInt(3);
-function Me(e, t, r, n, s = 1, o) {
-  const i = BigInt(o === void 0 ? n : o), c = r ** BigInt(n), a = [];
-  for (let u = 0; u < s; u++) {
-    const l = BigInt(u + 1), d = [];
-    for (let f = 0, b = lt; f < n; f++) {
-      const m = (l * b - l) / i % c;
-      d.push(e.pow(t, m)), b *= r;
-    }
-    a.push(d);
-  }
-  return a;
-}
-function Qr(e, t, r) {
-  const n = t.pow(r, (e.ORDER - lt) / on), s = t.pow(r, (e.ORDER - lt) / X);
-  function o(f, b) {
-    const m = t.mul(t.frobeniusMap(f, 1), n), g = t.mul(t.frobeniusMap(b, 1), s);
-    return [m, g];
-  }
-  const i = t.pow(r, (e.ORDER ** X - lt) / on), c = t.pow(r, (e.ORDER ** X - lt) / X);
-  if (!t.eql(c, t.neg(t.ONE)))
-    throw new Error("psiFrobenius: PSI2_Y!==-1");
-  function a(f, b) {
-    return [t.mul(f, i), t.neg(b)];
-  }
-  const u = (f) => (b, m) => {
-    const g = m.toAffine(), w = f(g.x, g.y);
-    return b.fromAffine({ x: w[0], y: w[1] });
-  }, l = u(o), d = u(a);
-  return { psi: o, psi2: a, G2psi: l, G2psi2: d, PSI_X: n, PSI_Y: s, PSI2_X: i, PSI2_Y: c };
-}
-const cn = (e, t) => {
-  if (t.length !== 2)
-    throw new Error("invalid tuple");
-  const r = t.map((n) => e.create(n));
-  return { c0: r[0], c1: r[1] };
-};
-class Jr {
-  constructor(t, r = {}) {
-    this.MASK = lt;
-    const n = t.ORDER, s = n * n;
-    this.Fp = t, this.ORDER = s, this.BITS = Vt(s), this.BYTES = Math.ceil(Vt(s) / 8), this.isLE = t.isLE, this.ZERO = { c0: t.ZERO, c1: t.ZERO }, this.ONE = { c0: t.ONE, c1: t.ZERO }, this.Fp_NONRESIDUE = t.create(r.NONRESIDUE || BigInt(-1)), this.Fp_div2 = t.div(t.ONE, X), this.NONRESIDUE = cn(t, r.FP2_NONRESIDUE), this.FROBENIUS_COEFFICIENTS = Me(t, this.Fp_NONRESIDUE, t.ORDER, 2)[0], this.mulByB = r.Fp2mulByB, Object.seal(this);
-  }
-  fromBigTuple(t) {
-    return cn(this.Fp, t);
-  }
-  create(t) {
-    return t;
-  }
-  isValid({ c0: t, c1: r }) {
-    function n(s, o) {
-      return typeof s == "bigint" && sn <= s && s < o;
-    }
-    return n(t, this.ORDER) && n(r, this.ORDER);
-  }
-  is0({ c0: t, c1: r }) {
-    return this.Fp.is0(t) && this.Fp.is0(r);
-  }
-  isValidNot0(t) {
-    return !this.is0(t) && this.isValid(t);
-  }
-  eql({ c0: t, c1: r }, { c0: n, c1: s }) {
-    return this.Fp.eql(t, n) && this.Fp.eql(r, s);
-  }
-  neg({ c0: t, c1: r }) {
-    return { c0: this.Fp.neg(t), c1: this.Fp.neg(r) };
-  }
-  pow(t, r) {
-    return ae(this, t, r);
-  }
-  invertBatch(t) {
-    return It(this, t);
-  }
-  // Normalized
-  add(t, r) {
-    const { c0: n, c1: s } = t, { c0: o, c1: i } = r;
-    return {
-      c0: this.Fp.add(n, o),
-      c1: this.Fp.add(s, i)
-    };
-  }
-  sub({ c0: t, c1: r }, { c0: n, c1: s }) {
-    return {
-      c0: this.Fp.sub(t, n),
-      c1: this.Fp.sub(r, s)
-    };
-  }
-  mul({ c0: t, c1: r }, n) {
-    const { Fp: s } = this;
-    if (typeof n == "bigint")
-      return { c0: s.mul(t, n), c1: s.mul(r, n) };
-    const { c0: o, c1: i } = n;
-    let c = s.mul(t, o), a = s.mul(r, i);
-    const u = s.sub(c, a), l = s.sub(s.mul(s.add(t, r), s.add(o, i)), s.add(c, a));
-    return { c0: u, c1: l };
-  }
-  sqr({ c0: t, c1: r }) {
-    const { Fp: n } = this, s = n.add(t, r), o = n.sub(t, r), i = n.add(t, t);
-    return { c0: n.mul(s, o), c1: n.mul(i, r) };
-  }
-  // NonNormalized stuff
-  addN(t, r) {
-    return this.add(t, r);
-  }
-  subN(t, r) {
-    return this.sub(t, r);
-  }
-  mulN(t, r) {
-    return this.mul(t, r);
-  }
-  sqrN(t) {
-    return this.sqr(t);
-  }
-  // Why inversion for bigint inside Fp instead of Fp2? it is even used in that context?
-  div(t, r) {
-    const { Fp: n } = this;
-    return this.mul(t, typeof r == "bigint" ? n.inv(n.create(r)) : this.inv(r));
-  }
-  inv({ c0: t, c1: r }) {
-    const { Fp: n } = this, s = n.inv(n.create(t * t + r * r));
-    return { c0: n.mul(s, n.create(t)), c1: n.mul(s, n.create(-r)) };
-  }
-  sqrt(t) {
-    const { Fp: r } = this, n = this, { c0: s, c1: o } = t;
-    if (r.is0(o))
-      return ne(r, s) === 1 ? n.create({ c0: r.sqrt(s), c1: r.ZERO }) : n.create({ c0: r.ZERO, c1: r.sqrt(r.div(s, this.Fp_NONRESIDUE)) });
-    const i = r.sqrt(r.sub(r.sqr(s), r.mul(r.sqr(o), this.Fp_NONRESIDUE)));
-    let c = r.mul(r.add(i, s), this.Fp_div2);
-    ne(r, c) === -1 && (c = r.sub(c, i));
-    const u = r.sqrt(c), l = n.create({ c0: u, c1: r.div(r.mul(o, this.Fp_div2), u) });
-    if (!n.eql(n.sqr(l), t))
-      throw new Error("Cannot find square root");
-    const d = l, f = n.neg(d), { re: b, im: m } = n.reim(d), { re: g, im: w } = n.reim(f);
-    return m > w || m === w && b > g ? d : f;
-  }
-  // Same as sgn0_m_eq_2 in RFC 9380
-  isOdd(t) {
-    const { re: r, im: n } = this.reim(t), s = r % X, o = r === sn, i = n % X;
-    return BigInt(s || o && i) == lt;
-  }
-  // Bytes util
-  fromBytes(t) {
-    const { Fp: r } = this;
-    if (t.length !== this.BYTES)
-      throw new Error("fromBytes invalid length=" + t.length);
-    return { c0: r.fromBytes(t.subarray(0, r.BYTES)), c1: r.fromBytes(t.subarray(r.BYTES)) };
-  }
-  toBytes({ c0: t, c1: r }) {
-    return V(this.Fp.toBytes(t), this.Fp.toBytes(r));
-  }
-  cmov({ c0: t, c1: r }, { c0: n, c1: s }, o) {
-    return {
-      c0: this.Fp.cmov(t, n, o),
-      c1: this.Fp.cmov(r, s, o)
-    };
-  }
-  reim({ c0: t, c1: r }) {
-    return { re: t, im: r };
-  }
-  Fp4Square(t, r) {
-    const n = this, s = n.sqr(t), o = n.sqr(r);
-    return {
-      first: n.add(n.mulByNonresidue(o), s),
-      // b² * Nonresidue + a²
-      second: n.sub(n.sub(n.sqr(n.add(t, r)), s), o)
-      // (a + b)² - a² - b²
-    };
-  }
-  // multiply by u + 1
-  mulByNonresidue({ c0: t, c1: r }) {
-    return this.mul({ c0: t, c1: r }, this.NONRESIDUE);
-  }
-  frobeniusMap({ c0: t, c1: r }, n) {
-    return {
-      c0: t,
-      c1: this.Fp.mul(r, this.FROBENIUS_COEFFICIENTS[n % 2])
-    };
-  }
-}
-class ts {
-  constructor(t) {
-    this.MASK = lt, this.Fp2 = t, this.ORDER = t.ORDER, this.BITS = 3 * t.BITS, this.BYTES = 3 * t.BYTES, this.isLE = t.isLE, this.ZERO = { c0: t.ZERO, c1: t.ZERO, c2: t.ZERO }, this.ONE = { c0: t.ONE, c1: t.ZERO, c2: t.ZERO };
-    const { Fp: r } = t, n = Me(t, t.NONRESIDUE, r.ORDER, 6, 2, 3);
-    this.FROBENIUS_COEFFICIENTS_1 = n[0], this.FROBENIUS_COEFFICIENTS_2 = n[1], Object.seal(this);
-  }
-  add({ c0: t, c1: r, c2: n }, { c0: s, c1: o, c2: i }) {
-    const { Fp2: c } = this;
-    return {
-      c0: c.add(t, s),
-      c1: c.add(r, o),
-      c2: c.add(n, i)
-    };
-  }
-  sub({ c0: t, c1: r, c2: n }, { c0: s, c1: o, c2: i }) {
-    const { Fp2: c } = this;
-    return {
-      c0: c.sub(t, s),
-      c1: c.sub(r, o),
-      c2: c.sub(n, i)
-    };
-  }
-  mul({ c0: t, c1: r, c2: n }, s) {
-    const { Fp2: o } = this;
-    if (typeof s == "bigint")
-      return {
-        c0: o.mul(t, s),
-        c1: o.mul(r, s),
-        c2: o.mul(n, s)
-      };
-    const { c0: i, c1: c, c2: a } = s, u = o.mul(t, i), l = o.mul(r, c), d = o.mul(n, a);
-    return {
-      // t0 + (c1 + c2) * (r1 * r2) - (T1 + T2) * (u + 1)
-      c0: o.add(u, o.mulByNonresidue(o.sub(o.mul(o.add(r, n), o.add(c, a)), o.add(l, d)))),
-      // (c0 + c1) * (r0 + r1) - (T0 + T1) + T2 * (u + 1)
-      c1: o.add(o.sub(o.mul(o.add(t, r), o.add(i, c)), o.add(u, l)), o.mulByNonresidue(d)),
-      // T1 + (c0 + c2) * (r0 + r2) - T0 + T2
-      c2: o.sub(o.add(l, o.mul(o.add(t, n), o.add(i, a))), o.add(u, d))
-    };
-  }
-  sqr({ c0: t, c1: r, c2: n }) {
-    const { Fp2: s } = this;
-    let o = s.sqr(t), i = s.mul(s.mul(t, r), X), c = s.mul(s.mul(r, n), X), a = s.sqr(n);
-    return {
-      c0: s.add(s.mulByNonresidue(c), o),
-      // T3 * (u + 1) + T0
-      c1: s.add(s.mulByNonresidue(a), i),
-      // T4 * (u + 1) + T1
-      // T1 + (c0 - c1 + c2)² + T3 - T0 - T4
-      c2: s.sub(s.sub(s.add(s.add(i, s.sqr(s.add(s.sub(t, r), n))), c), o), a)
-    };
-  }
-  addN(t, r) {
-    return this.add(t, r);
-  }
-  subN(t, r) {
-    return this.sub(t, r);
-  }
-  mulN(t, r) {
-    return this.mul(t, r);
-  }
-  sqrN(t) {
-    return this.sqr(t);
-  }
-  create(t) {
-    return t;
-  }
-  isValid({ c0: t, c1: r, c2: n }) {
-    const { Fp2: s } = this;
-    return s.isValid(t) && s.isValid(r) && s.isValid(n);
-  }
-  is0({ c0: t, c1: r, c2: n }) {
-    const { Fp2: s } = this;
-    return s.is0(t) && s.is0(r) && s.is0(n);
-  }
-  isValidNot0(t) {
-    return !this.is0(t) && this.isValid(t);
-  }
-  neg({ c0: t, c1: r, c2: n }) {
-    const { Fp2: s } = this;
-    return { c0: s.neg(t), c1: s.neg(r), c2: s.neg(n) };
-  }
-  eql({ c0: t, c1: r, c2: n }, { c0: s, c1: o, c2: i }) {
-    const { Fp2: c } = this;
-    return c.eql(t, s) && c.eql(r, o) && c.eql(n, i);
-  }
-  sqrt(t) {
-    return In();
-  }
-  // Do we need division by bigint at all? Should be done via order:
-  div(t, r) {
-    const { Fp2: n } = this, { Fp: s } = n;
-    return this.mul(t, typeof r == "bigint" ? s.inv(s.create(r)) : this.inv(r));
-  }
-  pow(t, r) {
-    return ae(this, t, r);
-  }
-  invertBatch(t) {
-    return It(this, t);
-  }
-  inv({ c0: t, c1: r, c2: n }) {
-    const { Fp2: s } = this;
-    let o = s.sub(s.sqr(t), s.mulByNonresidue(s.mul(n, r))), i = s.sub(s.mulByNonresidue(s.sqr(n)), s.mul(t, r)), c = s.sub(s.sqr(r), s.mul(t, n)), a = s.inv(s.add(s.mulByNonresidue(s.add(s.mul(n, i), s.mul(r, c))), s.mul(t, o)));
-    return { c0: s.mul(a, o), c1: s.mul(a, i), c2: s.mul(a, c) };
-  }
-  // Bytes utils
-  fromBytes(t) {
-    const { Fp2: r } = this;
-    if (t.length !== this.BYTES)
-      throw new Error("fromBytes invalid length=" + t.length);
-    const n = r.BYTES;
-    return {
-      c0: r.fromBytes(t.subarray(0, n)),
-      c1: r.fromBytes(t.subarray(n, n * 2)),
-      c2: r.fromBytes(t.subarray(2 * n))
-    };
-  }
-  toBytes({ c0: t, c1: r, c2: n }) {
-    const { Fp2: s } = this;
-    return V(s.toBytes(t), s.toBytes(r), s.toBytes(n));
-  }
-  cmov({ c0: t, c1: r, c2: n }, { c0: s, c1: o, c2: i }, c) {
-    const { Fp2: a } = this;
-    return {
-      c0: a.cmov(t, s, c),
-      c1: a.cmov(r, o, c),
-      c2: a.cmov(n, i, c)
-    };
-  }
-  fromBigSix(t) {
-    const { Fp2: r } = this;
-    if (!Array.isArray(t) || t.length !== 6)
-      throw new Error("invalid Fp6 usage");
-    return {
-      c0: r.fromBigTuple(t.slice(0, 2)),
-      c1: r.fromBigTuple(t.slice(2, 4)),
-      c2: r.fromBigTuple(t.slice(4, 6))
-    };
-  }
-  frobeniusMap({ c0: t, c1: r, c2: n }, s) {
-    const { Fp2: o } = this;
-    return {
-      c0: o.frobeniusMap(t, s),
-      c1: o.mul(o.frobeniusMap(r, s), this.FROBENIUS_COEFFICIENTS_1[s % 6]),
-      c2: o.mul(o.frobeniusMap(n, s), this.FROBENIUS_COEFFICIENTS_2[s % 6])
-    };
-  }
-  mulByFp2({ c0: t, c1: r, c2: n }, s) {
-    const { Fp2: o } = this;
-    return {
-      c0: o.mul(t, s),
-      c1: o.mul(r, s),
-      c2: o.mul(n, s)
-    };
-  }
-  mulByNonresidue({ c0: t, c1: r, c2: n }) {
-    const { Fp2: s } = this;
-    return { c0: s.mulByNonresidue(n), c1: t, c2: r };
-  }
-  // Sparse multiplication
-  mul1({ c0: t, c1: r, c2: n }, s) {
-    const { Fp2: o } = this;
-    return {
-      c0: o.mulByNonresidue(o.mul(n, s)),
-      c1: o.mul(t, s),
-      c2: o.mul(r, s)
-    };
-  }
-  // Sparse multiplication
-  mul01({ c0: t, c1: r, c2: n }, s, o) {
-    const { Fp2: i } = this;
-    let c = i.mul(t, s), a = i.mul(r, o);
-    return {
-      // ((c1 + c2) * b1 - T1) * (u + 1) + T0
-      c0: i.add(i.mulByNonresidue(i.sub(i.mul(i.add(r, n), o), a)), c),
-      // (b0 + b1) * (c0 + c1) - T0 - T1
-      c1: i.sub(i.sub(i.mul(i.add(s, o), i.add(t, r)), c), a),
-      // (c0 + c2) * b0 - T0 + T1
-      c2: i.add(i.sub(i.mul(i.add(t, n), s), c), a)
-    };
-  }
-}
-class es {
-  constructor(t, r) {
-    this.MASK = lt;
-    const { Fp2: n } = t, { Fp: s } = n;
-    this.Fp6 = t, this.ORDER = n.ORDER, this.BITS = 2 * t.BITS, this.BYTES = 2 * t.BYTES, this.isLE = t.isLE, this.ZERO = { c0: t.ZERO, c1: t.ZERO }, this.ONE = { c0: t.ONE, c1: t.ZERO }, this.FROBENIUS_COEFFICIENTS = Me(n, n.NONRESIDUE, s.ORDER, 12, 1, 6)[0], this.X_LEN = r.X_LEN, this.finalExponentiate = r.Fp12finalExponentiate;
-  }
-  create(t) {
-    return t;
-  }
-  isValid({ c0: t, c1: r }) {
-    const { Fp6: n } = this;
-    return n.isValid(t) && n.isValid(r);
-  }
-  is0({ c0: t, c1: r }) {
-    const { Fp6: n } = this;
-    return n.is0(t) && n.is0(r);
-  }
-  isValidNot0(t) {
-    return !this.is0(t) && this.isValid(t);
-  }
-  neg({ c0: t, c1: r }) {
-    const { Fp6: n } = this;
-    return { c0: n.neg(t), c1: n.neg(r) };
-  }
-  eql({ c0: t, c1: r }, { c0: n, c1: s }) {
-    const { Fp6: o } = this;
-    return o.eql(t, n) && o.eql(r, s);
-  }
-  sqrt(t) {
-    In();
-  }
-  inv({ c0: t, c1: r }) {
-    const { Fp6: n } = this;
-    let s = n.inv(n.sub(n.sqr(t), n.mulByNonresidue(n.sqr(r))));
-    return { c0: n.mul(t, s), c1: n.neg(n.mul(r, s)) };
-  }
-  div(t, r) {
-    const { Fp6: n } = this, { Fp2: s } = n, { Fp: o } = s;
-    return this.mul(t, typeof r == "bigint" ? o.inv(o.create(r)) : this.inv(r));
-  }
-  pow(t, r) {
-    return ae(this, t, r);
-  }
-  invertBatch(t) {
-    return It(this, t);
-  }
-  // Normalized
-  add({ c0: t, c1: r }, { c0: n, c1: s }) {
-    const { Fp6: o } = this;
-    return {
-      c0: o.add(t, n),
-      c1: o.add(r, s)
-    };
-  }
-  sub({ c0: t, c1: r }, { c0: n, c1: s }) {
-    const { Fp6: o } = this;
-    return {
-      c0: o.sub(t, n),
-      c1: o.sub(r, s)
-    };
-  }
-  mul({ c0: t, c1: r }, n) {
-    const { Fp6: s } = this;
-    if (typeof n == "bigint")
-      return { c0: s.mul(t, n), c1: s.mul(r, n) };
-    let { c0: o, c1: i } = n, c = s.mul(t, o), a = s.mul(r, i);
-    return {
-      c0: s.add(c, s.mulByNonresidue(a)),
-      // T1 + T2 * v
-      // (c0 + c1) * (r0 + r1) - (T1 + T2)
-      c1: s.sub(s.mul(s.add(t, r), s.add(o, i)), s.add(c, a))
-    };
-  }
-  sqr({ c0: t, c1: r }) {
-    const { Fp6: n } = this;
-    let s = n.mul(t, r);
-    return {
-      // (c1 * v + c0) * (c0 + c1) - AB - AB * v
-      c0: n.sub(n.sub(n.mul(n.add(n.mulByNonresidue(r), t), n.add(t, r)), s), n.mulByNonresidue(s)),
-      c1: n.add(s, s)
-    };
-  }
-  // NonNormalized stuff
-  addN(t, r) {
-    return this.add(t, r);
-  }
-  subN(t, r) {
-    return this.sub(t, r);
-  }
-  mulN(t, r) {
-    return this.mul(t, r);
-  }
-  sqrN(t) {
-    return this.sqr(t);
-  }
-  // Bytes utils
-  fromBytes(t) {
-    const { Fp6: r } = this;
-    if (t.length !== this.BYTES)
-      throw new Error("fromBytes invalid length=" + t.length);
-    return {
-      c0: r.fromBytes(t.subarray(0, r.BYTES)),
-      c1: r.fromBytes(t.subarray(r.BYTES))
-    };
-  }
-  toBytes({ c0: t, c1: r }) {
-    const { Fp6: n } = this;
-    return V(n.toBytes(t), n.toBytes(r));
-  }
-  cmov({ c0: t, c1: r }, { c0: n, c1: s }, o) {
-    const { Fp6: i } = this;
-    return {
-      c0: i.cmov(t, n, o),
-      c1: i.cmov(r, s, o)
-    };
-  }
-  // Utils
-  // toString() {
-  //   return '' + 'Fp12(' + this.c0 + this.c1 + '* w');
-  // },
-  // fromTuple(c: [Fp6, Fp6]) {
-  //   return new Fp12(...c);
-  // }
-  fromBigTwelve(t) {
-    const { Fp6: r } = this;
-    return {
-      c0: r.fromBigSix(t.slice(0, 6)),
-      c1: r.fromBigSix(t.slice(6, 12))
-    };
-  }
-  // Raises to q**i -th power
-  frobeniusMap(t, r) {
-    const { Fp6: n } = this, { Fp2: s } = n, { c0: o, c1: i, c2: c } = n.frobeniusMap(t.c1, r), a = this.FROBENIUS_COEFFICIENTS[r % 12];
-    return {
-      c0: n.frobeniusMap(t.c0, r),
-      c1: n.create({
-        c0: s.mul(o, a),
-        c1: s.mul(i, a),
-        c2: s.mul(c, a)
-      })
-    };
-  }
-  mulByFp2({ c0: t, c1: r }, n) {
-    const { Fp6: s } = this;
-    return {
-      c0: s.mulByFp2(t, n),
-      c1: s.mulByFp2(r, n)
-    };
-  }
-  conjugate({ c0: t, c1: r }) {
-    return { c0: t, c1: this.Fp6.neg(r) };
-  }
-  // Sparse multiplication
-  mul014({ c0: t, c1: r }, n, s, o) {
-    const { Fp6: i } = this, { Fp2: c } = i;
-    let a = i.mul01(t, n, s), u = i.mul1(r, o);
-    return {
-      c0: i.add(i.mulByNonresidue(u), a),
-      // T1 * v + T0
-      // (c1 + c0) * [o0, o1+o4] - T0 - T1
-      c1: i.sub(i.sub(i.mul01(i.add(r, t), n, c.add(s, o)), a), u)
-    };
-  }
-  mul034({ c0: t, c1: r }, n, s, o) {
-    const { Fp6: i } = this, { Fp2: c } = i, a = i.create({
-      c0: c.mul(t.c0, n),
-      c1: c.mul(t.c1, n),
-      c2: c.mul(t.c2, n)
-    }), u = i.mul01(r, s, o), l = i.mul01(i.add(t, r), c.add(n, s), o);
-    return {
-      c0: i.add(i.mulByNonresidue(u), a),
-      c1: i.sub(l, i.add(a, u))
-    };
-  }
-  // A cyclotomic group is a subgroup of Fp^n defined by
-  //   GΦₙ(p) = {α ∈ Fpⁿ : α^Φₙ(p) = 1}
-  // The result of any pairing is in a cyclotomic subgroup
-  // https://eprint.iacr.org/2009/565.pdf
-  // https://eprint.iacr.org/2010/354.pdf
-  _cyclotomicSquare({ c0: t, c1: r }) {
-    const { Fp6: n } = this, { Fp2: s } = n, { c0: o, c1: i, c2: c } = t, { c0: a, c1: u, c2: l } = r, { first: d, second: f } = s.Fp4Square(o, u), { first: b, second: m } = s.Fp4Square(a, c), { first: g, second: w } = s.Fp4Square(i, l), T = s.mulByNonresidue(w);
-    return {
-      c0: n.create({
-        c0: s.add(s.mul(s.sub(d, o), X), d),
-        // 2 * (T3 - c0c0)  + T3
-        c1: s.add(s.mul(s.sub(b, i), X), b),
-        // 2 * (T5 - c0c1)  + T5
-        c2: s.add(s.mul(s.sub(g, c), X), g)
-      }),
-      // 2 * (T7 - c0c2)  + T7
-      c1: n.create({
-        c0: s.add(s.mul(s.add(T, a), X), T),
-        // 2 * (T9 + c1c0) + T9
-        c1: s.add(s.mul(s.add(f, u), X), f),
-        // 2 * (T4 + c1c1) + T4
-        c2: s.add(s.mul(s.add(m, l), X), m)
-      })
-    };
-  }
-  // https://eprint.iacr.org/2009/565.pdf
-  _cyclotomicExp(t, r) {
-    let n = this.ONE;
-    for (let s = this.X_LEN - 1; s >= 0; s--)
-      n = this._cyclotomicSquare(n), wr(r, s) && (n = this.mul(n, t));
-    return n;
-  }
-}
-function ns(e) {
-  const t = Pt(e.ORDER), r = new Jr(t, e), n = new ts(r), s = new es(n, e);
-  return { Fp: t, Fp2: r, Fp6: n, Fp12: s };
-}
-const z = BigInt(0), oe = BigInt(1), rt = BigInt(2), fe = BigInt(3), Ct = BigInt(4), yt = BigInt("0xd201000000010000"), rs = Vt(yt), At = {
-  p: BigInt("0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab"),
-  n: BigInt("0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001"),
-  h: BigInt("0x396c8c005555e1568c00aaab0000aaab"),
-  a: z,
-  b: Ct,
-  Gx: BigInt("0x17f1d3a73197d7942695638c4fa9ac0fc3688c4f9774b905a14e3a3f171bac586c55e83ff97a1aeffb3af00adb22c6bb"),
-  Gy: BigInt("0x08b3f481e3aaa0f1a09e30ed741d8ae4fcf5e095d5d00af600db18cb2c04b3edd03cc744a2888ae40caa232946c5e7e1")
-}, ss = Pt(At.n, {
-  modFromBytes: !0,
-  isLE: !0
-}), { Fp: x, Fp2: L, Fp6: os, Fp12: k } = ns({
-  ORDER: At.p,
-  X_LEN: rs,
-  // Finite extension field over irreducible polynominal.
-  // Fp(u) / (u² - β) where β = -1
-  FP2_NONRESIDUE: [oe, oe],
-  Fp2mulByB: ({ c0: e, c1: t }) => {
-    const r = x.mul(e, Ct), n = x.mul(t, Ct);
-    return { c0: x.sub(r, n), c1: x.add(r, n) };
-  },
-  Fp12finalExponentiate: (e) => {
-    const t = yt, r = k.div(k.frobeniusMap(e, 6), e), n = k.mul(k.frobeniusMap(r, 2), r), s = k.conjugate(k._cyclotomicExp(n, t)), o = k.mul(k.conjugate(k._cyclotomicSquare(n)), s), i = k.conjugate(k._cyclotomicExp(o, t)), c = k.conjugate(k._cyclotomicExp(i, t)), a = k.mul(k.conjugate(k._cyclotomicExp(c, t)), k._cyclotomicSquare(s)), u = k.conjugate(k._cyclotomicExp(a, t)), l = k.frobeniusMap(k.mul(s, c), 2), d = k.frobeniusMap(k.mul(i, n), 3), f = k.frobeniusMap(k.mul(a, k.conjugate(n)), 1), b = k.mul(k.mul(u, k.conjugate(o)), n);
-    return k.mul(k.mul(k.mul(l, d), f), b);
-  }
-}), { G2psi: an, G2psi2: is } = Qr(x, L, L.div(L.ONE, L.NONRESIDUE)), Ee = Object.freeze({
-  DST: "BLS_SIG_BLS12381G2_XMD:SHA-256_SSWU_RO_NUL_",
-  encodeDST: "BLS_SIG_BLS12381G2_XMD:SHA-256_SSWU_RO_NUL_",
-  p: x.ORDER,
-  m: 2,
-  k: 128,
-  expand: "xmd",
-  hash: Sn
-}), Ze = {
-  p: L.ORDER,
-  n: At.n,
-  h: BigInt("0x5d543a95414e7f1091d50792876a202cd91de4547085abaa68a205b2e5a7ddfa628f1cb4d9e82ef21537e293a6691ae1616ec6e786f0c70cf1c38e31c7238e5"),
-  a: L.ZERO,
-  b: L.fromBigTuple([Ct, Ct]),
-  Gx: L.fromBigTuple([
-    BigInt("0x024aa2b2f08f0a91260805272dc51051c6e47ad4fa403b02b4510b647ae3d1770bac0326a805bbefd48056c8c121bdb8"),
-    BigInt("0x13e02b6052719f607dacd3a088274f65596bd0d09920b61ab5da61bbdc7f5049334cf11213945d57e5ac7d055d042b7e")
-  ]),
-  Gy: L.fromBigTuple([
-    BigInt("0x0ce5d527727d6e118cc9cdc6da2e351aadfd9baa8cbdd3a76d429a695160d12c923ac9cc3baca289e193548608b82801"),
-    BigInt("0x0606c4a02ea734cc32acd2b02bc28b99cb3e287e85a763af267492ab572e99ab3f370d275cec1da1aaa9075ff05f79be")
-  ])
-}, ue = jt(x.toBytes(z), { infinity: !0, compressed: !0 });
-function de(e) {
-  e = e.slice();
-  const t = e[0] & 224, r = !!(t >> 7 & 1), n = !!(t >> 6 & 1), s = !!(t >> 5 & 1);
-  return e[0] &= 31, { compressed: r, infinity: n, sort: s, value: e };
-}
-function jt(e, t) {
-  if (e[0] & 224)
-    throw new Error("setMask: non-empty mask");
-  return t.compressed && (e[0] |= 128), t.infinity && (e[0] |= 64), t.sort && (e[0] |= 32), e;
-}
-function cs(e, t, r) {
-  const { BYTES: n, ORDER: s } = x, o = t.is0(), { x: i, y: c } = t.toAffine();
-  if (r) {
-    if (o)
-      return ue.slice();
-    const a = !!(c * rt / s);
-    return jt(C(i, n), { compressed: !0, sort: a });
-  } else
-    return o ? V(Uint8Array.of(64), new Uint8Array(2 * n - 1)) : V(C(i, n), C(c, n));
-}
-function xe(e) {
-  e.assertValidity();
-  const { BYTES: t, ORDER: r } = x, { x: n, y: s } = e.toAffine();
-  if (e.is0())
-    return ue.slice();
-  const o = !!(s * rt / r);
-  return jt(C(n, t), { compressed: !0, sort: o });
-}
-function as(e) {
-  const { compressed: t, infinity: r, sort: n, value: s } = de(e), { BYTES: o, ORDER: i } = x;
-  if (s.length === 48 && t) {
-    const c = ft(s), a = x.create(c & Ot(x.BITS));
-    if (r) {
-      if (a !== z)
-        throw new Error("invalid G1 point: non-empty, at infinity, with compression");
-      return { x: z, y: z };
-    }
-    const u = x.add(x.pow(a, fe), x.create(At.b));
-    let l = x.sqrt(u);
-    if (!l)
-      throw new Error("invalid G1 point: compressed point");
-    return l * rt / i !== BigInt(n) && (l = x.neg(l)), { x: x.create(a), y: x.create(l) };
-  } else if (s.length === 96 && !t) {
-    const c = ft(s.subarray(0, o)), a = ft(s.subarray(o));
-    if (r) {
-      if (c !== z || a !== z)
-        throw new Error("G1: non-empty point at infinity");
-      return P.G1.Point.ZERO.toAffine();
-    }
-    return { x: x.create(c), y: x.create(a) };
-  } else
-    throw new Error("invalid G1 point: expected 48/96 bytes");
-}
-function fn(e) {
-  const { infinity: t, sort: r, value: n } = de(Ht("signatureHex", e, 48)), s = x.ORDER, o = P.G1.Point, i = ft(n);
-  if (t)
-    return o.ZERO;
-  const c = x.create(i & Ot(x.BITS)), a = x.add(x.pow(c, fe), x.create(At.b));
-  let u = x.sqrt(a);
-  if (!u)
-    throw new Error("invalid G1 point: compressed");
-  const l = BigInt(r);
-  u * rt / s !== l && (u = x.neg(u));
-  const d = o.fromAffine({ x: c, y: u });
-  return d.assertValidity(), d;
-}
-function fs(e, t, r) {
-  const { BYTES: n, ORDER: s } = x, o = t.is0(), { x: i, y: c } = t.toAffine();
-  if (r) {
-    if (o)
-      return V(ue, C(z, n));
-    const a = !!(c.c1 === z ? c.c0 * rt / s : c.c1 * rt / s);
-    return V(jt(C(i.c1, n), { compressed: !0, sort: a }), C(i.c0, n));
-  } else {
-    if (o)
-      return V(Uint8Array.of(64), new Uint8Array(4 * n - 1));
-    const { re: a, im: u } = L.reim(i), { re: l, im: d } = L.reim(c);
-    return V(C(u, n), C(a, n), C(d, n), C(l, n));
-  }
-}
-function Be(e) {
-  e.assertValidity();
-  const { BYTES: t } = x;
-  if (e.is0())
-    return V(ue, C(z, t));
-  const { x: r, y: n } = e.toAffine(), { re: s, im: o } = L.reim(r), { re: i, im: c } = L.reim(n), u = !!((c > z ? c * rt : i * rt) / x.ORDER & oe), l = s;
-  return V(jt(C(o, t), { sort: u, compressed: !0 }), C(l, t));
-}
-function us(e) {
-  const { BYTES: t, ORDER: r } = x, { compressed: n, infinity: s, sort: o, value: i } = de(e);
-  if (!n && !s && o || // 00100000
-  !n && s && o || // 01100000
-  o && s && n)
-    throw new Error("invalid encoding flag: " + (e[0] & 224));
-  const c = (a, u, l) => ft(a.slice(u, l));
-  if (i.length === 96 && n) {
-    if (s) {
-      if (i.reduce((m, g) => m !== 0 ? g + 1 : g, 0) > 0)
-        throw new Error("invalid G2 point: compressed");
-      return { x: L.ZERO, y: L.ZERO };
-    }
-    const a = c(i, 0, t), u = c(i, t, 2 * t), l = L.create({ c0: x.create(u), c1: x.create(a) }), d = L.add(L.pow(l, fe), Ze.b);
-    let f = L.sqrt(d);
-    const b = f.c1 === z ? f.c0 * rt / r : f.c1 * rt / r ? oe : z;
-    return f = o && b > 0 ? f : L.neg(f), { x: l, y: f };
-  } else if (i.length === 192 && !n) {
-    if (s) {
-      if (i.reduce((f, b) => f !== 0 ? b + 1 : b, 0) > 0)
-        throw new Error("invalid G2 point: uncompressed");
-      return { x: L.ZERO, y: L.ZERO };
-    }
-    const a = c(i, 0 * t, 1 * t), u = c(i, 1 * t, 2 * t), l = c(i, 2 * t, 3 * t), d = c(i, 3 * t, 4 * t);
-    return { x: L.fromBigTuple([u, a]), y: L.fromBigTuple([d, l]) };
-  } else
-    throw new Error("invalid G2 point: expected 96/192 bytes");
-}
-function un(e) {
-  const { ORDER: t } = x, { infinity: r, sort: n, value: s } = de(Ht("signatureHex", e)), o = P.G2.Point, i = s.length / 2;
-  if (i !== 48 && i !== 96)
-    throw new Error("invalid compressed signature length, expected 96/192 bytes");
-  const c = ft(s.slice(0, i)), a = ft(s.slice(i));
-  if (r)
-    return o.ZERO;
-  const u = x.create(c & Ot(x.BITS)), l = x.create(a), d = L.create({ c0: l, c1: u }), f = L.add(L.pow(d, fe), Ze.b);
-  let b = L.sqrt(f);
-  if (!b)
-    throw new Error("Failed to find a square root");
-  const { re: m, im: g } = L.reim(b), w = BigInt(n), T = g > z && g * rt / t !== w, H = g === z && m * rt / t !== w;
-  (T || H) && (b = L.neg(b));
-  const O = o.fromAffine({ x: d, y: b });
-  return O.assertValidity(), O;
-}
-const P = Wr({
-  // Fields
-  fields: {
-    Fp: x,
-    Fp2: L,
-    Fp6: os,
-    Fp12: k,
-    Fr: ss
-  },
-  // G1: y² = x³ + 4
-  G1: {
-    ...At,
-    Fp: x,
-    htfDefaults: { ...Ee, m: 1, DST: "BLS_SIG_BLS12381G1_XMD:SHA-256_SSWU_RO_NUL_" },
-    wrapPrivateKey: !0,
-    allowInfinityPoint: !0,
-    // Checks is the point resides in prime-order subgroup.
-    // point.isTorsionFree() should return true for valid points
-    // It returns false for shitty points.
-    // https://eprint.iacr.org/2021/1130.pdf
-    isTorsionFree: (e, t) => {
-      const r = BigInt("0x5f19672fdf76ce51ba69c6076a0f77eaddb3a93be6f89688de17d813620a00022e01fffffffefffe"), n = new e(x.mul(t.X, r), t.Y, t.Z);
-      return t.multiplyUnsafe(yt).negate().multiplyUnsafe(yt).equals(n);
-    },
-    // Clear cofactor of G1
-    // https://eprint.iacr.org/2019/403
-    clearCofactor: (e, t) => t.multiplyUnsafe(yt).add(t),
-    mapToCurve: ms,
-    fromBytes: as,
-    toBytes: cs,
-    ShortSignature: {
-      fromBytes(e) {
-        return Q(e), fn(e);
-      },
-      fromHex(e) {
-        return fn(e);
-      },
-      toBytes(e) {
-        return xe(e);
-      },
-      toRawBytes(e) {
-        return xe(e);
-      },
-      toHex(e) {
-        return Yt(xe(e));
-      }
-    }
-  },
-  G2: {
-    ...Ze,
-    Fp: L,
-    // https://datatracker.ietf.org/doc/html/rfc9380#name-clearing-the-cofactor
-    // https://datatracker.ietf.org/doc/html/rfc9380#name-cofactor-clearing-for-bls12
-    hEff: BigInt("0xbc69f08f2ee75b3584c6a0ea91b352888e2a8e9145ad7689986ff031508ffe1329c2f178731db956d82bf015d1212b02ec0ec69d7477c1ae954cbc06689f6a359894c0adebbf6b4e8020005aaa95551"),
-    htfDefaults: { ...Ee },
-    wrapPrivateKey: !0,
-    allowInfinityPoint: !0,
-    mapToCurve: gs,
-    // Checks is the point resides in prime-order subgroup.
-    // point.isTorsionFree() should return true for valid points
-    // It returns false for shitty points.
-    // https://eprint.iacr.org/2021/1130.pdf
-    // Older version: https://eprint.iacr.org/2019/814.pdf
-    isTorsionFree: (e, t) => t.multiplyUnsafe(yt).negate().equals(an(e, t)),
-    // Maps the point into the prime-order subgroup G2.
-    // clear_cofactor_bls12381_g2 from RFC 9380.
-    // https://eprint.iacr.org/2017/419.pdf
-    // prettier-ignore
-    clearCofactor: (e, t) => {
-      const r = yt;
-      let n = t.multiplyUnsafe(r).negate(), s = an(e, t), o = t.double();
-      return o = is(e, o), o = o.subtract(s), s = n.add(s), s = s.multiplyUnsafe(r).negate(), o = o.add(s), o = o.subtract(n), o.subtract(t);
-    },
-    fromBytes: us,
-    toBytes: fs,
-    Signature: {
-      fromBytes(e) {
-        return Q(e), un(e);
-      },
-      fromHex(e) {
-        return un(e);
-      },
-      toBytes(e) {
-        return Be(e);
-      },
-      toRawBytes(e) {
-        return Be(e);
-      },
-      toHex(e) {
-        return Yt(Be(e));
-      }
-    }
-  },
-  params: {
-    ateLoopSize: yt,
-    // The BLS parameter x for BLS12-381
-    r: At.n,
-    // order; z⁴ − z² + 1; CURVE.n from other curves
-    xNegative: !0,
-    twistType: "multiplicative"
-  },
-  htfDefaults: Ee
-}), ds = Kn(L, [
-  // xNum
-  [
-    [
-      "0x5c759507e8e333ebb5b7a9a47d7ed8532c52d39fd3a042a88b58423c50ae15d5c2638e343d9c71c6238aaaaaaaa97d6",
-      "0x5c759507e8e333ebb5b7a9a47d7ed8532c52d39fd3a042a88b58423c50ae15d5c2638e343d9c71c6238aaaaaaaa97d6"
-    ],
-    [
-      "0x0",
-      "0x11560bf17baa99bc32126fced787c88f984f87adf7ae0c7f9a208c6b4f20a4181472aaa9cb8d555526a9ffffffffc71a"
-    ],
-    [
-      "0x11560bf17baa99bc32126fced787c88f984f87adf7ae0c7f9a208c6b4f20a4181472aaa9cb8d555526a9ffffffffc71e",
-      "0x8ab05f8bdd54cde190937e76bc3e447cc27c3d6fbd7063fcd104635a790520c0a395554e5c6aaaa9354ffffffffe38d"
-    ],
-    [
-      "0x171d6541fa38ccfaed6dea691f5fb614cb14b4e7f4e810aa22d6108f142b85757098e38d0f671c7188e2aaaaaaaa5ed1",
-      "0x0"
-    ]
-  ],
-  // xDen
-  [
-    [
-      "0x0",
-      "0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaa63"
-    ],
-    [
-      "0xc",
-      "0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaa9f"
-    ],
-    ["0x1", "0x0"]
-    // LAST 1
-  ],
-  // yNum
-  [
-    [
-      "0x1530477c7ab4113b59a4c18b076d11930f7da5d4a07f649bf54439d87d27e500fc8c25ebf8c92f6812cfc71c71c6d706",
-      "0x1530477c7ab4113b59a4c18b076d11930f7da5d4a07f649bf54439d87d27e500fc8c25ebf8c92f6812cfc71c71c6d706"
-    ],
-    [
-      "0x0",
-      "0x5c759507e8e333ebb5b7a9a47d7ed8532c52d39fd3a042a88b58423c50ae15d5c2638e343d9c71c6238aaaaaaaa97be"
-    ],
-    [
-      "0x11560bf17baa99bc32126fced787c88f984f87adf7ae0c7f9a208c6b4f20a4181472aaa9cb8d555526a9ffffffffc71c",
-      "0x8ab05f8bdd54cde190937e76bc3e447cc27c3d6fbd7063fcd104635a790520c0a395554e5c6aaaa9354ffffffffe38f"
-    ],
-    [
-      "0x124c9ad43b6cf79bfbf7043de3811ad0761b0f37a1e26286b0e977c69aa274524e79097a56dc4bd9e1b371c71c718b10",
-      "0x0"
-    ]
-  ],
-  // yDen
-  [
-    [
-      "0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffa8fb",
-      "0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffa8fb"
-    ],
-    [
-      "0x0",
-      "0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffa9d3"
-    ],
-    [
-      "0x12",
-      "0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaa99"
-    ],
-    ["0x1", "0x0"]
-    // LAST 1
-  ]
-].map((e) => e.map((t) => L.fromBigTuple(t.map(BigInt))))), ls = Kn(x, [
-  // xNum
-  [
-    "0x11a05f2b1e833340b809101dd99815856b303e88a2d7005ff2627b56cdb4e2c85610c2d5f2e62d6eaeac1662734649b7",
-    "0x17294ed3e943ab2f0588bab22147a81c7c17e75b2f6a8417f565e33c70d1e86b4838f2a6f318c356e834eef1b3cb83bb",
-    "0xd54005db97678ec1d1048c5d10a9a1bce032473295983e56878e501ec68e25c958c3e3d2a09729fe0179f9dac9edcb0",
-    "0x1778e7166fcc6db74e0609d307e55412d7f5e4656a8dbf25f1b33289f1b330835336e25ce3107193c5b388641d9b6861",
-    "0xe99726a3199f4436642b4b3e4118e5499db995a1257fb3f086eeb65982fac18985a286f301e77c451154ce9ac8895d9",
-    "0x1630c3250d7313ff01d1201bf7a74ab5db3cb17dd952799b9ed3ab9097e68f90a0870d2dcae73d19cd13c1c66f652983",
-    "0xd6ed6553fe44d296a3726c38ae652bfb11586264f0f8ce19008e218f9c86b2a8da25128c1052ecaddd7f225a139ed84",
-    "0x17b81e7701abdbe2e8743884d1117e53356de5ab275b4db1a682c62ef0f2753339b7c8f8c8f475af9ccb5618e3f0c88e",
-    "0x80d3cf1f9a78fc47b90b33563be990dc43b756ce79f5574a2c596c928c5d1de4fa295f296b74e956d71986a8497e317",
-    "0x169b1f8e1bcfa7c42e0c37515d138f22dd2ecb803a0c5c99676314baf4bb1b7fa3190b2edc0327797f241067be390c9e",
-    "0x10321da079ce07e272d8ec09d2565b0dfa7dccdde6787f96d50af36003b14866f69b771f8c285decca67df3f1605fb7b",
-    "0x6e08c248e260e70bd1e962381edee3d31d79d7e22c837bc23c0bf1bc24c6b68c24b1b80b64d391fa9c8ba2e8ba2d229"
-  ],
-  // xDen
-  [
-    "0x8ca8d548cff19ae18b2e62f4bd3fa6f01d5ef4ba35b48ba9c9588617fc8ac62b558d681be343df8993cf9fa40d21b1c",
-    "0x12561a5deb559c4348b4711298e536367041e8ca0cf0800c0126c2588c48bf5713daa8846cb026e9e5c8276ec82b3bff",
-    "0xb2962fe57a3225e8137e629bff2991f6f89416f5a718cd1fca64e00b11aceacd6a3d0967c94fedcfcc239ba5cb83e19",
-    "0x3425581a58ae2fec83aafef7c40eb545b08243f16b1655154cca8abc28d6fd04976d5243eecf5c4130de8938dc62cd8",
-    "0x13a8e162022914a80a6f1d5f43e7a07dffdfc759a12062bb8d6b44e833b306da9bd29ba81f35781d539d395b3532a21e",
-    "0xe7355f8e4e667b955390f7f0506c6e9395735e9ce9cad4d0a43bcef24b8982f7400d24bc4228f11c02df9a29f6304a5",
-    "0x772caacf16936190f3e0c63e0596721570f5799af53a1894e2e073062aede9cea73b3538f0de06cec2574496ee84a3a",
-    "0x14a7ac2a9d64a8b230b3f5b074cf01996e7f63c21bca68a81996e1cdf9822c580fa5b9489d11e2d311f7d99bbdcc5a5e",
-    "0xa10ecf6ada54f825e920b3dafc7a3cce07f8d1d7161366b74100da67f39883503826692abba43704776ec3a79a1d641",
-    "0x95fc13ab9e92ad4476d6e3eb3a56680f682b4ee96f7d03776df533978f31c1593174e4b4b7865002d6384d168ecdd0a",
-    "0x000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001"
-    // LAST 1
-  ],
-  // yNum
-  [
-    "0x90d97c81ba24ee0259d1f094980dcfa11ad138e48a869522b52af6c956543d3cd0c7aee9b3ba3c2be9845719707bb33",
-    "0x134996a104ee5811d51036d776fb46831223e96c254f383d0f906343eb67ad34d6c56711962fa8bfe097e75a2e41c696",
-    "0xcc786baa966e66f4a384c86a3b49942552e2d658a31ce2c344be4b91400da7d26d521628b00523b8dfe240c72de1f6",
-    "0x1f86376e8981c217898751ad8746757d42aa7b90eeb791c09e4a3ec03251cf9de405aba9ec61deca6355c77b0e5f4cb",
-    "0x8cc03fdefe0ff135caf4fe2a21529c4195536fbe3ce50b879833fd221351adc2ee7f8dc099040a841b6daecf2e8fedb",
-    "0x16603fca40634b6a2211e11db8f0a6a074a7d0d4afadb7bd76505c3d3ad5544e203f6326c95a807299b23ab13633a5f0",
-    "0x4ab0b9bcfac1bbcb2c977d027796b3ce75bb8ca2be184cb5231413c4d634f3747a87ac2460f415ec961f8855fe9d6f2",
-    "0x987c8d5333ab86fde9926bd2ca6c674170a05bfe3bdd81ffd038da6c26c842642f64550fedfe935a15e4ca31870fb29",
-    "0x9fc4018bd96684be88c9e221e4da1bb8f3abd16679dc26c1e8b6e6a1f20cabe69d65201c78607a360370e577bdba587",
-    "0xe1bba7a1186bdb5223abde7ada14a23c42a0ca7915af6fe06985e7ed1e4d43b9b3f7055dd4eba6f2bafaaebca731c30",
-    "0x19713e47937cd1be0dfd0b8f1d43fb93cd2fcbcb6caf493fd1183e416389e61031bf3a5cce3fbafce813711ad011c132",
-    "0x18b46a908f36f6deb918c143fed2edcc523559b8aaf0c2462e6bfe7f911f643249d9cdf41b44d606ce07c8a4d0074d8e",
-    "0xb182cac101b9399d155096004f53f447aa7b12a3426b08ec02710e807b4633f06c851c1919211f20d4c04f00b971ef8",
-    "0x245a394ad1eca9b72fc00ae7be315dc757b3b080d4c158013e6632d3c40659cc6cf90ad1c232a6442d9d3f5db980133",
-    "0x5c129645e44cf1102a159f748c4a3fc5e673d81d7e86568d9ab0f5d396a7ce46ba1049b6579afb7866b1e715475224b",
-    "0x15e6be4e990f03ce4ea50b3b42df2eb5cb181d8f84965a3957add4fa95af01b2b665027efec01c7704b456be69c8b604"
-  ],
-  // yDen
-  [
-    "0x16112c4c3a9c98b252181140fad0eae9601a6de578980be6eec3232b5be72e7a07f3688ef60c206d01479253b03663c1",
-    "0x1962d75c2381201e1a0cbd6c43c348b885c84ff731c4d59ca4a10356f453e01f78a4260763529e3532f6102c2e49a03d",
-    "0x58df3306640da276faaae7d6e8eb15778c4855551ae7f310c35a5dd279cd2eca6757cd636f96f891e2538b53dbf67f2",
-    "0x16b7d288798e5395f20d23bf89edb4d1d115c5dbddbcd30e123da489e726af41727364f2c28297ada8d26d98445f5416",
-    "0xbe0e079545f43e4b00cc912f8228ddcc6d19c9f0f69bbb0542eda0fc9dec916a20b15dc0fd2ededda39142311a5001d",
-    "0x8d9e5297186db2d9fb266eaac783182b70152c65550d881c5ecd87b6f0f5a6449f38db9dfa9cce202c6477faaf9b7ac",
-    "0x166007c08a99db2fc3ba8734ace9824b5eecfdfa8d0cf8ef5dd365bc400a0051d5fa9c01a58b1fb93d1a1399126a775c",
-    "0x16a3ef08be3ea7ea03bcddfabba6ff6ee5a4375efa1f4fd7feb34fd206357132b920f5b00801dee460ee415a15812ed9",
-    "0x1866c8ed336c61231a1be54fd1d74cc4f9fb0ce4c6af5920abc5750c4bf39b4852cfe2f7bb9248836b233d9d55535d4a",
-    "0x167a55cda70a6e1cea820597d94a84903216f763e13d87bb5308592e7ea7d4fbc7385ea3d529b35e346ef48bb8913f55",
-    "0x4d2f259eea405bd48f010a01ad2911d9c6dd039bb61a6290e591b36e636a5c871a5c29f4f83060400f8b49cba8f6aa8",
-    "0xaccbb67481d033ff5852c1e48c50c477f94ff8aefce42d28c0f9a88cea7913516f968986f7ebbea9684b529e2561092",
-    "0xad6b9514c767fe3c3613144b45f1496543346d98adf02267d5ceef9a00d9b8693000763e3b90ac11e99b138573345cc",
-    "0x2660400eb2e4f3b628bdd0d53cd76f2bf565b94e72927c1cb748df27942480e420517bd8714cc80d1fadc1326ed06f7",
-    "0xe0fa1d816ddc03e6b24255e0d7819c171c40f65e273b853324efcd6356caa205ca2f570f13497804415473a1d634b8f",
-    "0x000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001"
-    // LAST 1
-  ]
-].map((e) => e.map((t) => BigInt(t)))), bs = Vn(x, {
-  A: x.create(BigInt("0x144698a3b8e9433d693a02c96d4982b0ea985383ee66a8d8e8981aefd881ac98936f8da0e0f97f5cf428082d584c1d")),
-  B: x.create(BigInt("0x12e2908d11688030018b12e8753eee3b2016c1f0f24f4070a0b9c14fcef35ef55a23215a316ceaa5d1cc48e98e172be0")),
-  Z: x.create(BigInt(11))
-}), hs = Vn(L, {
-  A: L.create({ c0: x.create(z), c1: x.create(BigInt(240)) }),
-  // A' = 240 * I
-  B: L.create({ c0: x.create(BigInt(1012)), c1: x.create(BigInt(1012)) }),
-  // B' = 1012 * (1 + I)
-  Z: L.create({ c0: x.create(BigInt(-2)), c1: x.create(BigInt(-1)) })
-  // Z: -(2 + I)
-});
-function ms(e) {
-  const { x: t, y: r } = bs(x.create(e[0]));
-  return ls(t, r);
-}
-function gs(e) {
-  const { x: t, y: r } = hs(L.fromBigTuple(e));
-  return ds(t, r);
-}
-const ys = BigInt(0), Dt = BigInt(1), ps = BigInt(2), ws = BigInt(7), Es = BigInt(256), xs = BigInt(113), Fn = [], Cn = [], zn = [];
-for (let e = 0, t = Dt, r = 1, n = 0; e < 24; e++) {
-  [r, n] = [n, (2 * r + 3 * n) % 5], Fn.push(2 * (5 * n + r)), Cn.push((e + 1) * (e + 2) / 2 % 64);
-  let s = ys;
-  for (let o = 0; o < 7; o++)
-    t = (t << Dt ^ (t >> ws) * xs) % Es, t & ps && (s ^= Dt << (Dt << /* @__PURE__ */ BigInt(o)) - Dt);
-  zn.push(s);
-}
-const $n = dr(zn, !0), Bs = $n[0], _s = $n[1], dn = (e, t, r) => r > 32 ? hr(e, t, r) : lr(e, t, r), ln = (e, t, r) => r > 32 ? mr(e, t, r) : br(e, t, r);
-function Ss(e, t = 24) {
-  const r = new Uint32Array(10);
-  for (let n = 24 - t; n < 24; n++) {
-    for (let i = 0; i < 10; i++)
-      r[i] = e[i] ^ e[i + 10] ^ e[i + 20] ^ e[i + 30] ^ e[i + 40];
-    for (let i = 0; i < 10; i += 2) {
-      const c = (i + 8) % 10, a = (i + 2) % 10, u = r[a], l = r[a + 1], d = dn(u, l, 1) ^ r[c], f = ln(u, l, 1) ^ r[c + 1];
-      for (let b = 0; b < 50; b += 10)
-        e[i + b] ^= d, e[i + b + 1] ^= f;
-    }
-    let s = e[2], o = e[3];
-    for (let i = 0; i < 24; i++) {
-      const c = Cn[i], a = dn(s, o, c), u = ln(s, o, c), l = Fn[i];
-      s = e[l], o = e[l + 1], e[l] = a, e[l + 1] = u;
-    }
-    for (let i = 0; i < 50; i += 10) {
-      for (let c = 0; c < 10; c++)
-        r[c] = e[i + c];
-      for (let c = 0; c < 10; c++)
-        e[i + c] ^= ~r[(c + 2) % 10] & r[(c + 4) % 10];
-    }
-    e[0] ^= Bs[n], e[1] ^= _s[n];
-  }
-  St(r);
-}
-class Ke extends Le {
-  // NOTE: we accept arguments in bytes instead of bits here.
-  constructor(t, r, n, s = !1, o = 24) {
-    if (super(), this.pos = 0, this.posOut = 0, this.finished = !1, this.destroyed = !1, this.enableXOF = !1, this.blockLen = t, this.suffix = r, this.outputLen = n, this.enableXOF = s, this.rounds = o, Ut(n), !(0 < t && t < 200))
-      throw new Error("only keccak-f1600 function is supported");
-    this.state = new Uint8Array(200), this.state32 = Qn(this.state);
-  }
-  clone() {
-    return this._cloneInto();
-  }
-  keccak() {
-    Ve(this.state32), Ss(this.state32, this.rounds), Ve(this.state32), this.posOut = 0, this.pos = 0;
-  }
-  update(t) {
-    Lt(this), t = vt(t), Q(t);
-    const { blockLen: r, state: n } = this, s = t.length;
-    for (let o = 0; o < s; ) {
-      const i = Math.min(r - this.pos, s - o);
-      for (let c = 0; c < i; c++)
-        n[this.pos++] ^= t[o++];
-      this.pos === r && this.keccak();
-    }
-    return this;
-  }
-  finish() {
-    if (this.finished)
-      return;
-    this.finished = !0;
-    const { state: t, suffix: r, pos: n, blockLen: s } = this;
-    t[n] ^= r, (r & 128) !== 0 && n === s - 1 && this.keccak(), t[s - 1] ^= 128, this.keccak();
-  }
-  writeInto(t) {
-    Lt(this, !1), Q(t), this.finish();
-    const r = this.state, { blockLen: n } = this;
-    for (let s = 0, o = t.length; s < o; ) {
-      this.posOut >= n && this.keccak();
-      const i = Math.min(n - this.posOut, o - s);
-      t.set(r.subarray(this.posOut, this.posOut + i), s), this.posOut += i, s += i;
-    }
-    return t;
-  }
-  xofInto(t) {
-    if (!this.enableXOF)
-      throw new Error("XOF is not possible for this instance");
-    return this.writeInto(t);
-  }
-  xof(t) {
-    return Ut(t), this.xofInto(new Uint8Array(t));
-  }
-  digestInto(t) {
-    if (xn(t, this), this.finished)
-      throw new Error("digest() was already called");
-    return this.writeInto(t), this.destroy(), t;
-  }
-  digest() {
-    return this.digestInto(new Uint8Array(this.outputLen));
-  }
-  destroy() {
-    this.destroyed = !0, St(this.state);
-  }
-  _cloneInto(t) {
-    const { blockLen: r, suffix: n, outputLen: s, rounds: o, enableXOF: i } = this;
-    return t || (t = new Ke(r, n, s, i, o)), t.state32.set(this.state32), t.pos = this.pos, t.posOut = this.posOut, t.finished = this.finished, t.rounds = o, t.suffix = n, t.outputLen = s, t.enableXOF = i, t.destroyed = this.destroyed, t;
-  }
-}
-const vs = (e, t, r) => sr((n = {}) => new Ke(t, e, n.dkLen === void 0 ? r : n.dkLen, !0)), As = vs(31, 136, 256 / 8);
-function Os(e, t, r) {
-  return Ue(e), r === void 0 && (r = new Uint8Array(e.outputLen)), De(e, vt(r), vt(t));
-}
-const _e = /* @__PURE__ */ Uint8Array.from([0]), bn = /* @__PURE__ */ Uint8Array.of();
-function Is(e, t, r, n = 32) {
-  Ue(e), Ut(n);
-  const s = e.outputLen;
-  if (n > 255 * s)
-    throw new Error("Length should be <= 255*HashLen");
-  const o = Math.ceil(n / s);
-  r === void 0 && (r = bn);
-  const i = new Uint8Array(o * s), c = De.create(e, t), a = c._cloneInto(), u = new Uint8Array(c.outputLen);
-  for (let l = 0; l < o; l++)
-    _e[0] = l + 1, a.update(l === 0 ? bn : u).update(r).update(_e).digestInto(u), i.set(u, s * l), c._cloneInto(a);
-  return c.destroy(), a.destroy(), St(u, _e), i.slice(0, n);
-}
-const Ns = (e, t, r, n, s) => Is(e, Os(e, t, r), n, s), it = 48, nt = 96;
-class Ie {
-  #t;
-  #e;
-  /**
-   * Create a random transport secret key
-   */
-  static random() {
-    return new Ie(P.utils.randomSecretKey());
-  }
-  /**
-   * Deserialize TransportSecretKey from a bytestring
-   *
-   * The passed value would typically be a string previously returned
-   * by calling serialize on a randomly-created TransportSecretKey.
-   */
-  static deserialize(t) {
-    if (t.length !== 32)
-      throw new Error("Invalid size for transport secret key");
-    return new Ie(t);
-  }
-  /**
-   * Return the encoding of the transport public key; this value is
-   * sent to the IC
-   */
-  publicKeyBytes() {
-    return this.#e.toBytes(!0);
-  }
-  /**
-   * Return the transport secret key value
-   *
-   * Applications would not normally need to call this
-   */
-  serialize() {
-    return this.#t;
-  }
-  /**
-   * @internal constructor
-   */
-  constructor(t) {
-    this.#t = t;
-    const r = P.G1.Point.BASE.multiply(
-      P.G1.Point.Fn.fromBytes(this.#t)
-    );
-    this.#e = r;
-  }
-}
-function Us(e) {
-  if (e.length != 48)
-    return !1;
-  try {
-    return P.G1.Point.fromHex(e), !0;
-  } catch {
-    return !1;
-  }
-}
-function _t(e) {
-  let t = e.length;
-  const r = new Uint8Array(8 + t);
-  for (let n = 7; n >= 0; n--)
-    r[n] = t & 255, t >>>= 8;
-  return r.set(e, 8), r;
-}
-var Ts = /* @__PURE__ */ ((e) => (e.KEY_1 = "key_1", e.TEST_KEY_1 = "test_key_1", e))(Ts || {}), qs = /* @__PURE__ */ ((e) => (e.KEY_1 = "key_1", e.TEST_KEY_1 = "test_key_1", e.DFX_TEST_KEY = "dfx_test_key", e))(qs || {});
-function Mt(e) {
-  const t = new Uint8Array(e.length / 2);
-  for (let r = 0; r < e.length; r += 2)
-    t[r / 2] = parseInt(e.substring(r, r + 2), 16);
-  return t;
-}
-class wt {
-  #t;
-  /**
-   * Read a MasterPublicKey from the bytestring encoding
-   *
-   * Normally the bytes provided here will have been returned by
-   * the `vetkd_public_key` management canister interface.
-   */
-  static deserialize(t) {
-    return new wt(P.G2.Point.fromHex(t));
-  }
-  /**
-   * Derive a canister master key from the subnet master key
-   *
-   * To create the derived public key in VetKD, a two step derivation is performed. The first step
-   * creates a key that is specific to the canister that is making VetKD requests to the
-   * management canister, sometimes called canister master key.
-   *
-   * This function can be used to compute canister master keys knowing just the subnet master key
-   * plus the canister identity. This avoids having to interact with the IC for performing this
-   * computation.
-   */
-  deriveCanisterKey(t) {
-    const r = "ic-vetkd-bls12-381-g2-canister-id", n = this.publicKeyBytes(), s = new Uint8Array([
-      ..._t(n),
-      ..._t(t)
-    ]), o = Ye(s, r), i = P.G2.Point.BASE.multiply(o);
-    return new zt(this.#t.add(i));
-  }
-  /**
-   * Return the bytestring encoding of the master public key
-   */
-  publicKeyBytes() {
-    return this.#t.toBytes(!0);
-  }
-  /**
-   * Return the hardcoded master public key used on IC
-   *
-   * This allows performing public key derivation offline
-   */
-  static productionKey(t = "key_1") {
-    if (t == "key_1")
-      return wt.deserialize(
-        Mt(
-          "a9caf9ae8af0c7c7272f8a122133e2e0c7c0899b75e502bda9e109ca8193ded3ef042ed96db1125e1bdaad77d8cc60d917e122fe2501c45b96274f43705edf0cfd455bc66c3c060faa2fcd15486e76351edf91fecb993797273bbc8beaa47404"
-        )
-      );
-    if (t == "test_key_1")
-      return wt.deserialize(
-        Mt(
-          "ad86e8ff845912f022a0838a502d763fdea547c9948f8cb20ea7738dd52c1c38dcb4c6ca9ac29f9ac690fc5ad7681cb41922b8dffbd65d94bff141f5fb5b6624eccc03bf850f222052df888cf9b1e47203556d7522271cbb879b2ef4b8c2bfb1"
-        )
-      );
-    throw new Error(
-      "Unknown MasterPublicKeyId value for productionKey"
-    );
-  }
-  /**
-   * Return the hardcoded master public key used in PocketIC
-   *
-   * This allows performing public key derivation offline
-   */
-  static pocketicKey(t = "key_1") {
-    if (t == "key_1")
-      return wt.deserialize(
-        Mt(
-          "8c800b5cff00463d26e8167369168827f1e48f4d8d60f71dd6a295580f65275b5f5f8e6a792c876b2c72492136530d0710a27522ee63977a76216c3cef9e70bfcb45b88736fc62142e7e0737848ce06cbb1f45a4a6a349b142ae5cf7853561e0"
-        )
-      );
-    if (t == "test_key_1")
-      return wt.deserialize(
-        Mt(
-          "9069b82c7aae418cef27678291e7f2cb1a008a500eceba7199bffca12421b07c158987c6a22618af3d1958738b2835691028801f7663d311799733286c557c8979184bb62cb559a4d582fca7d2e48b860f08ed6641aef66a059ec891889a6218"
-        )
-      );
-    if (t == "dfx_test_key")
-      return wt.deserialize(
-        Mt(
-          "b181c14cf9d04ba45d782c0067a44b0aaa9fc2acf94f1a875f0dae801af4f80339a7e6bf8b09fcf993824c8df3080b3f1409b688ca08cbd44d2cb28db9899f4aa3b5f06b9174240448e10be2f01f9f80079ea5431ce2d11d1c8d1c775333315f"
-        )
-      );
-    throw new Error(
-      "Unknown PocketIcMasterPublicKeyId value for pocketicKey"
-    );
-  }
-  /**
-   * @internal constructor
-   */
-  constructor(t) {
-    this.#t = t;
-  }
-}
-class zt {
-  #t;
-  /**
-   * Read a DerivedPublicKey from the bytestring encoding
-   *
-   * Normally the bytes provided here will have been returned by
-   * the `vetkd_public_key` management canister interface.
-   */
-  static deserialize(t) {
-    return new zt(P.G2.Point.fromHex(t));
-  }
-  /**
-   * Perform second-stage derivation of a public key
-   *
-   * To create the derived public key in VetKD, a two step derivation is performed. The first step
-   * creates a key that is specific to the canister that is making VetKD requests to the
-   * management canister, sometimes called canister master key. The second step incorporates the
-   * "derivation context" value provided to the `vetkd_public_key` management canister interface.
-   *
-   * If `vetkd_public_key` is invoked with an empty derivation context, it simply returns the
-   * canister master key. Then the second derivation step can be done offline, using this
-   * function. This is useful if you wish to derive multiple keys without having to interact with
-   * the IC each time.
-   *
-   * If `context` is empty, then this simply returns the underlying key. This matches the behavior
-   * of `vetkd_public_key`
-   */
-  deriveSubKey(t) {
-    if (t.length === 0)
-      return this;
-    {
-      const r = "ic-vetkd-bls12-381-g2-context", n = this.publicKeyBytes(), s = new Uint8Array([
-        ..._t(n),
-        ..._t(t)
-      ]), o = Ye(s, r), i = P.G2.Point.BASE.multiply(o);
-      return new zt(this.getPoint().add(i));
-    }
-  }
-  /**
-   * Return the bytestring encoding of the derived public key
-   *
-   * Applications would not normally need to call this, unless they
-   * are using VetKD for creating a random beacon, in which case
-   * these bytes are used by anyone verifying the beacon.
-   */
-  publicKeyBytes() {
-    return this.#t.toBytes(!0);
-  }
-  /**
-   * @internal getter returning the point element of the derived public key
-   *
-   * Applications would not normally need to call this
-   */
-  getPoint() {
-    return this.#t;
-  }
-  /**
-   * @internal constructor
-   *
-   * This is public for typing reasons but there should be no need
-   * for an application to call this.
-   */
-  constructor(t) {
-    this.#t = t;
-  }
-}
-function Ye(e, t) {
-  return P.G2.hashToScalar(e, { DST: t });
-}
-function Ne(e) {
-  if (typeof e == "string")
-    return new TextEncoder().encode(e);
-  const t = new Uint8Array(e.length);
-  return t.set(e), t;
-}
-function Se(e, t) {
-  const r = new TextEncoder().encode(e), n = Ne(t), s = new Uint8Array(r.length + n.length);
-  return s.set(r, 0), s.set(n, r.length), s;
-}
-function Xt(e, t, r) {
-  const n = new Uint8Array();
-  return Ns(Sn, e, n, t, r);
-}
-function Rs(e, t) {
-  const r = "BLS_SIG_BLS12381G1_XMD:SHA-256_SSWU_RO_AUG_", n = e.publicKeyBytes(), s = new Uint8Array([...n, ...t]);
-  return P.G1.Point.fromAffine(
-    P.G1.hashToCurve(s, {
-      DST: r
-    }).toAffine()
-  );
-}
-function jn(e, t, r) {
-  const n = e.publicKeyBytes(), s = new Uint8Array([...n, ...t]), i = P.shortSignatures.hash(
-    s,
-    "BLS_SIG_BLS12381G1_XMD:SHA-256_SSWU_RO_AUG_"
-  );
-  return P.shortSignatures.verify(
-    r,
-    i,
-    e.getPoint()
-  );
-}
-class le {
-  #t;
-  #e;
-  /**
-   * Return the VetKey bytes, aka the BLS signature
-   *
-   * Use the raw bytes only if your design makes use of the fact that VetKeys
-   * are BLS signatures (eg for random beacon or threshold BLS signature
-   * generation). If you are using VetKD for key distribution, instead use
-   * deriveSymmetricKey or asHkdfCryptoKey
-   */
-  signatureBytes() {
-    return this.#e;
-  }
-  /**
-   * Return the serialization of the VetKey
-   *
-   * This is the byte encoding of the unencrypted VetKey.
-   */
-  serialize() {
-    return this.#e;
-  }
-  /**
-   * Derive a symmetric key of the requested length from the VetKey
-   *
-   * As an alternative to this function consider using asDerivedKeyMaterial,
-   * which uses the WebCrypto API and prevents export of the underlying key.
-   *
-   * The `domainSep` parameter should be a string unique to your application and
-   * also your usage of the resulting key. For example say your application
-   * "my-app" is deriving two keys, one for usage "foo" and the other for
-   * "bar". You might use as domain separators "my-app-foo" and "my-app-bar".
-   *
-   * The returned Uint8Array will be `outputLength` bytes long.
-   */
-  deriveSymmetricKey(t, r) {
-    return Xt(this.#e, t, r);
-  }
-  /**
-   * Return a DerivedKeyMaterial type which is suitable for further key derivation
-   */
-  async asDerivedKeyMaterial() {
-    return ie.setup(this.#e);
-  }
-  /**
-   * Deserialize a VetKey from the 48 byte encoding of the BLS signature
-   *
-   * This deserializes the same value as returned by serialize (or signatureBytes)
-   */
-  static deserialize(t) {
-    return new le(P.G1.Point.fromHex(t));
-  }
-  /**
-   * @internal getter returning the point object of the VetKey
-   *
-   * Applications would not usually need to call this
-   */
-  getPoint() {
-    return this.#t;
-  }
-  /**
-   * @internal constructor
-   *
-   * This is public for typing reasons but there is no reason for an application
-   * to call this constructor.
-   */
-  constructor(t) {
-    this.#t = t, this.#e = new Uint8Array(t.toBytes(!0));
-  }
-}
-const qt = 12, hn = 2, Te = "IC GCMv2", mn = new TextEncoder().encode(
-  Te
-), Zt = 8;
-class ie {
-  #t;
-  #e;
-  /**
-   * @internal constructor
-   */
-  constructor(t, r) {
-    this.#t = t, this.#e = r;
-  }
-  static async fromCryptoKey(t) {
-    const r = {
-      name: "HKDF",
-      hash: "SHA-256",
-      info: new TextEncoder().encode(
-        "ic-vetkd-bls12-381-g2-derived-key-material"
-      ),
-      salt: new Uint8Array()
-    }, n = {
-      name: "AES-GCM",
-      length: 256
-    }, s = await crypto.subtle.deriveKey(
-      r,
-      t,
-      n,
-      !0,
-      // exportable
-      ["encrypt"]
-    ), o = await crypto.subtle.exportKey(
-      "raw",
-      s
-    ), i = await crypto.subtle.importKey(
-      "raw",
-      o,
-      { name: "HKDF" },
-      !1,
-      ["deriveKey", "deriveBits"]
-    );
-    return new ie(i, t);
-  }
-  /**
-   * @internal constructor
-   */
-  static async setup(t) {
-    const n = await globalThis.crypto.subtle.importKey(
-      "raw",
-      t,
-      "HKDF",
-      !1,
-      ["deriveKey", "deriveBits"]
-    );
-    return ie.fromCryptoKey(n);
-  }
-  /**
-   * Return the CryptoKey
-   */
-  getCryptoKey() {
-    return this.#e;
-  }
-  /**
-   * Return a WebCrypto CryptoKey handle suitable for AES-GCM encryption/decryption
-   *
-   * The key is derived using HKDF with the provided domain separator
-   *
-   * The CryptoKey is not exportable
-   */
-  async deriveAesGcmCryptoKey(t, r) {
-    const n = {
-      name: "HKDF",
-      hash: "SHA-256",
-      length: 256,
-      info: Se(
-        "ic-vetkd-bls12-381-g2-aes-gcm-v" + r.toString() + "-",
-        t
-      ),
-      salt: new Uint8Array()
-    }, s = {
-      name: "AES-GCM",
-      length: 256
-    };
-    return globalThis.crypto.subtle.deriveKey(
-      n,
-      this.#t,
-      s,
-      !1,
-      ["encrypt", "decrypt"]
-    );
-  }
-  /**
-   * Encrypt the provided message using AES-GCM and a key derived using HKDF
-   *
-   * The GCM key is derived using HKDF with the provided domain separator
-   */
-  async encryptMessage(t, r, n) {
-    const s = await this.deriveAesGcmCryptoKey(
-      r,
-      hn
-    ), o = globalThis.crypto.getRandomValues(
-      new Uint8Array(qt)
-    ), i = Se(Te, n), c = new Uint8Array(
-      await globalThis.crypto.subtle.encrypt(
-        { name: "AES-GCM", iv: o, additionalData: i },
-        s,
-        Ne(t)
-      )
-    );
-    return new Uint8Array([
-      ...mn,
-      ...o,
-      ...c
-    ]);
-  }
-  /**
-   * Decrypt the provided ciphertext using AES-GCM and a key derived using HKDF
-   *
-   * The GCM key is derived using HKDF with the provided domain separator
-   */
-  async decryptMessage(t, r, n) {
-    const o = Zt + qt + 16;
-    if (t.length < o)
-      throw new Error(
-        "Invalid ciphertext, too short to possibly be valid"
-      );
-    const i = t.slice(0, Zt);
-    if (!qe(i, mn))
-      if (n.length == 0) {
-        const d = t.slice(
-          0,
-          qt
-        ), f = t.slice(
-          qt
-        ), b = {
-          name: "HKDF",
-          hash: "SHA-256",
-          length: 256,
-          info: Ne(r),
-          salt: new Uint8Array()
-        }, m = {
-          name: "AES-GCM",
-          length: 256
-        }, g = await globalThis.crypto.subtle.deriveKey(
-          b,
-          this.#e,
-          m,
-          !1,
-          ["decrypt"]
-        );
-        try {
-          const w = await globalThis.crypto.subtle.decrypt(
-            { name: "AES-GCM", iv: d },
-            g,
-            f
-          );
-          return new Uint8Array(w);
-        } catch {
-          throw new Error("Decryption failed");
-        }
-      } else
-        throw new Error(
-          "Unknown header for AES-GCM encrypted ciphertext"
-        );
-    const c = Se(Te, n), a = t.slice(
-      Zt,
-      Zt + qt
-    ), u = t.slice(
-      Zt + qt
-    ), l = await this.deriveAesGcmCryptoKey(
-      r,
-      hn
-    );
-    try {
-      const d = await globalThis.crypto.subtle.decrypt(
-        { name: "AES-GCM", iv: a, additionalData: c },
-        l,
-        u
-      );
-      return new Uint8Array(d);
-    } catch {
-      throw new Error("Decryption failed");
-    }
-  }
-}
-class Xn {
-  #t;
-  #e;
-  #n;
-  /**
-   * Parse an encrypted key returned by the `vetkd_derive_encrypted_key`
-   * managment canister interface
-   */
-  static deserialize(t) {
-    if (t.length !== it + nt + it)
-      throw new Error("Invalid EncryptedVetKey serialization");
-    const r = P.G1.Point.fromHex(t.subarray(0, it)), n = P.G2.Point.fromHex(
-      t.subarray(it, it + nt)
-    ), s = P.G1.Point.fromHex(
-      t.subarray(it + nt)
-    );
-    return new Xn(r, n, s);
-  }
-  /**
-   * Decrypt the encrypted key returning a VetKey
-   */
-  decryptAndVerify(t, r, n) {
-    const s = P.G1.Point.BASE, o = P.G2.Point.BASE.negate(), i = P.fields.Fp12.ONE, c = P.pairingBatch([
-      { g1: this.#t, g2: o },
-      { g1: s, g2: this.#e }
-    ]);
-    if (!P.fields.Fp12.eql(c, i))
-      throw new Error("Invalid VetKey");
-    const a = this.#n.subtract(
-      this.#t.multiply(P.G1.Point.Fn.fromBytes(t.serialize()))
-    );
-    if (jn(r, n, a))
-      return new le(a);
-    throw new Error("Invalid VetKey");
-  }
-  /**
-   * @internal constructor
-   */
-  constructor(t, r, n) {
-    this.#t = t, this.#e = r, this.#n = n;
-  }
-}
-const gn = new Uint8Array([
-  73,
-  67,
-  32,
-  73,
-  66,
-  69,
-  0,
-  1
-]), mt = 8;
-function yn(e, t, r) {
-  const n = new Uint8Array([...e, ...t, ...r]);
-  return Ye(
-    n,
-    "ic-vetkd-bls12-381-ibe-hash-to-mask"
-    /* HashToMask */
-  );
-}
-function Wn(e, t) {
-  if (e.length !== t.length)
-    throw new Error("xorBuf arguments should have the same length");
-  const r = new Uint8Array(e.length);
-  for (let n = 0; n < e.length; n++)
-    r[n] = e[n] ^ t[n];
-  return r;
-}
-function pn(e, t) {
-  if (t.length !== 576)
-    throw new Error("Unexpected size for Gt element");
-  const r = Xt(
-    t,
-    "ic-vetkd-bls12-381-ibe-mask-seed",
-    e.length
-  );
-  return Wn(r, e);
-}
-function wn(e, t) {
-  const r = "ic-vetkd-bls12-381-ibe-mask-msg-".concat(
-    e.length.toString().padStart(20, "0")
-  ), n = Xt(t, r, 32), s = As(n, { dkLen: e.length });
-  return Wn(e, s);
-}
-function En(e) {
-  const t = P.fields.Fp12.toBytes(e), r = new Uint8Array(576), n = [11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0];
-  for (let s = 0; s < 12; ++s)
-    for (let o = 0; o < 48; ++o)
-      r[48 * s + o] = t[48 * n[s] + o];
-  return r;
-}
-function qe(e, t) {
-  if (e.length !== t.length)
-    return !1;
-  let r = 0;
-  for (let n = 0; n < e.length; ++n)
-    r |= e[n] ^ t[n];
-  return r == 0;
-}
-class Jt {
-  #t;
-  constructor(t) {
-    this.#t = t;
-  }
-  /**
-   * Create an identity from a byte string
-   */
-  static fromBytes(t) {
-    return new Jt(t);
-  }
-  /**
-   * Create an identity from a string
-   */
-  static fromString(t) {
-    return Jt.fromBytes(new TextEncoder().encode(t));
-  }
-  /**
-   * Create an identity from a Principal
-   */
-  static fromPrincipal(t) {
-    return Jt.fromBytes(t.toUint8Array());
-  }
-  /**
-   * @internal getter returning the encoded
-   */
-  getBytes() {
-    return this.#t;
-  }
-}
-const pt = 32;
-class te {
-  #t;
-  constructor(t) {
-    if (t.length !== pt)
-      throw new Error("IBE seed must be exactly IBE_SEED_BYTES long");
-    this.#t = t;
-  }
-  /**
-   * Create a seed for IBE encryption from a byte string
-   *
-   * This input should be randomly chosen by a secure random number generator.
-   * If the seed is not securely generated the IBE scheme will be insecure.
-   *
-   * At least 128 bits (16 bytes) must be provided.
-   *
-   * If the input is exactly 256 bits it is used directly. Otherwise the input
-   * is hashed with HKDF to produce a 256 bit seed.
-   */
-  static fromBytes(t) {
-    if (t.length < 16)
-      throw new Error(
-        "Insufficient input material for IbeSeed derivation"
-      );
-    return t.length == pt ? new te(t) : new te(
-      Xt(
-        t,
-        "ic-vetkd-bls12-381-ibe-hash-seed",
-        pt
-      )
-    );
-  }
-  /**
-   * Create a random seed for IBE encryption
-   */
-  static random() {
-    return new te(
-      globalThis.crypto.getRandomValues(new Uint8Array(pt))
-    );
-  }
-  /**
-   * @internal getter returning the seed bytes
-   */
-  getBytes() {
-    return this.#t;
-  }
-}
-const ve = mt + pt + nt;
-class Re {
-  #t;
-  #e;
-  #n;
-  #r;
-  /**
-   * Helper function for determining the size of an IBE ciphertext in bytes.
-   */
-  static ciphertextSize(t) {
-    if (t < 0)
-      throw new Error(
-        "IbeCiphertext.ciphertextSize argument cannot be negative"
-      );
-    return t + ve;
-  }
-  /**
-   * Helper function for determining the size of an IBE plaintext in bytes.
-   */
-  static plaintextSize(t) {
-    if (t < ve)
-      throw new Error(
-        "IbeCiphertext.plaintextSize given ciphertext size is too small to be valid"
-      );
-    return t - ve;
-  }
-  /**
-   * Serialize the IBE ciphertext to a bytestring
-   */
-  serialize() {
-    const t = this.#e.toBytes(!0);
-    return new Uint8Array([
-      ...this.#t,
-      ...t,
-      ...this.#n,
-      ...this.#r
-    ]);
-  }
-  /**
-   * Deserialize an IBE ciphertext
-   */
-  static deserialize(t) {
-    if (t.length < mt + nt + pt)
-      throw new Error("Invalid IBE ciphertext");
-    const r = t.subarray(0, mt), n = P.G2.Point.fromHex(
-      t.subarray(mt, mt + nt)
-    ), s = t.subarray(
-      mt + nt,
-      mt + nt + pt
-    ), o = t.subarray(mt + nt + pt);
-    if (!qe(r, gn))
-      throw new Error("Unexpected header for IBE ciphertext");
-    return new Re(r, n, s, o);
-  }
-  /**
-   * Encrypt a message using IBE, returning the ciphertext
-   *
-   * Any user who is able to retrieve the VetKey for the specified derived public key and
-   * identity will be able to decrypt this message.
-   *
-   * There is no fixed upper bound on the size of the message that can be encrypted using
-   * this scheme. However, internally during the encryption process several heap allocations
-   * are performed which are approximately the same length as the message itself, so
-   * encrypting or decrypting very large messages may result in memory allocation errors.
-   *
-   * If you anticipate using IBE to encrypt very large messages, consider using IBE just to
-   * encrypt a symmetric key, and then using a standard cipher such as AES-GCM to encrypt the
-   * data.
-   *
-   * The seed parameter must be a randomly generated value that was generated just for this
-   * one message. Using it for a second message, or for any other purpose, compromises the
-   * security of the IBE scheme.
-   */
-  static encrypt(t, r, n, s) {
-    const o = gn, i = yn(o, s.getBytes(), n), c = Rs(t, r.getBytes()), a = P.fields.Fp12.pow(
-      P.pairing(c, t.getPoint()),
-      i
-    ), u = P.G2.Point.BASE.multiply(i), l = pn(s.getBytes(), En(a)), d = wn(n, s.getBytes());
-    return new Re(o, u, l, d);
-  }
-  /**
-   * Decrypt an IBE ciphertext, returning the message
-   *
-   * There is no fixed upper bound on the size of the message that can be encrypted using
-   * this scheme. However, internally during the encryption process several heap allocations
-   * are performed which are approximately the same length as the message itself, so
-   * encrypting or decrypting very large messages may result in memory allocation errors.
-   */
-  decrypt(t) {
-    const r = pn(
-      this.#n,
-      En(P.pairing(t.getPoint(), this.#e))
-    ), n = wn(this.#r, r), s = yn(this.#t, r, n);
-    if (qe(
-      P.G2.Point.BASE.multiply(s).toBytes(!0),
-      this.#e.toBytes(!0)
-    ))
-      return n;
-    throw new Error("Decryption failed");
-  }
-  /**
-   * Private constructor
-   */
-  constructor(t, r, n, s) {
-    this.#t = t, this.#e = r, this.#n = n, this.#r = s;
-  }
-}
-const Gs = 32;
-class Ge {
-  #t;
-  #e;
-  #n;
-  #r;
-  static computeVrfHash(t, r, n) {
-    const s = new Uint8Array([
-      ..._t(t.serialize()),
-      ..._t(r.publicKeyBytes()),
-      ..._t(n)
-    ]);
-    return Xt(
-      s,
-      "ic-vetkd-bls12-381-g2-vrf",
-      Gs
-    );
-  }
-  /**
-   * Serialize a VrfOutput to a byte string
-   */
-  serialize() {
-    return new Uint8Array([
-      ...this.#t.serialize(),
-      ...this.#e.publicKeyBytes(),
-      ...this.#n
-    ]);
-  }
-  /**
-   * Deserialize and verify a VrfOutput
-   *
-   * Note this verifies the VrfOutput with respect to the derived public key
-   * and VRF input which are included in the struct. It is the responsibility
-   * of the application to examine the return value of `publicKey` and `input`
-   * and ensure these values make sense in the context where this VRF is being
-   * used.
-   */
-  static deserialize(t) {
-    if (t.length < it + nt)
-      throw new Error(
-        "VrfOutput.deserialize input too short to possibly be valid"
-      );
-    const r = le.deserialize(t.slice(0, it)), n = zt.deserialize(
-      t.slice(it, it + nt)
-    ), s = t.slice(it + nt);
-    if (!jn(n, s, r.getPoint()))
-      throw new Error("VrfOutput.deserialize proof is invalid");
-    return new Ge(r, n, s);
-  }
-  /**
-   * Return the public key under which this VRF output was derived
-   */
-  publicKey() {
-    return this.#e;
-  }
-  /**
-   * Return the input that was used to create this VRF output
-   */
-  input() {
-    return this.#n;
-  }
-  /**
-   * Return the VRF output
-   *
-   * This is a random-looking value which was provably generated by some party with
-   * access to the VRF secret key.
-   */
-  output() {
-    return this.#r;
-  }
-  /**
-   * Private constructor
-   */
-  constructor(t, r, n) {
-    this.#t = t, this.#e = r, this.#n = n, this.#r = Ge.computeVrfHash(t, r, n);
-  }
-}
+import { D as s, a as r, E as t, I as i, b as y, c, M as d, d as K, P as b, T as l, V as u, e as I, f as o, g as P, h as n, i as p, v as h } from "./utils-CiynM__c.mjs";
 export {
-  ie as DerivedKeyMaterial,
-  zt as DerivedPublicKey,
-  Xn as EncryptedVetKey,
-  Re as IbeCiphertext,
-  Jt as IbeIdentity,
-  te as IbeSeed,
-  wt as MasterPublicKey,
-  Ts as MasterPublicKeyId,
-  qs as PocketIcMasterPublicKeyId,
-  Ie as TransportSecretKey,
-  le as VetKey,
-  Ge as VrfOutput,
-  Rs as augmentedHashToG1,
-  Xt as deriveSymmetricKey,
-  Ye as hashToScalar,
-  Us as isValidTransportPublicKey,
-  jn as verifyBlsSignature
+  s as DerivedKeyMaterial,
+  r as DerivedPublicKey,
+  t as EncryptedVetKey,
+  i as IbeCiphertext,
+  y as IbeIdentity,
+  c as IbeSeed,
+  d as MasterPublicKey,
+  K as MasterPublicKeyId,
+  b as PocketIcMasterPublicKeyId,
+  l as TransportSecretKey,
+  u as VetKey,
+  I as VrfOutput,
+  o as augmentedHashToG1,
+  P as deriveSymmetricKey,
+  n as hashToScalar,
+  p as isValidTransportPublicKey,
+  h as verifyBlsSignature
 };