@prosopo/procaptcha-bundle 3.0.8 → 3.0.10

package/dist/bundle/nobleChunk-Xl5XLrx3.js

@@ -1,3635 +0,0 @@
-function Hs(t) {
-  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
-}
-function et(t) {
-  if (!Number.isSafeInteger(t) || t < 0)
-    throw new Error("positive integer expected, got " + t);
-}
-function oe(t, ...e) {
-  if (!Hs(t))
-    throw new Error("Uint8Array expected");
-  if (e.length > 0 && !e.includes(t.length))
-    throw new Error("Uint8Array expected of length " + e + ", got length=" + t.length);
-}
-function kn(t) {
-  if (typeof t != "function" || typeof t.create != "function")
-    throw new Error("Hash should be wrapped by utils.createHasher");
-  et(t.outputLen), et(t.blockLen);
-}
-function te(t, e = !0) {
-  if (t.destroyed)
-    throw new Error("Hash instance has been destroyed");
-  if (e && t.finished)
-    throw new Error("Hash#digest() has already been called");
-}
-function On(t, e) {
-  oe(t);
-  const n = e.outputLen;
-  if (t.length < n)
-    throw new Error("digestInto() expects output buffer of length at least " + n);
-}
-function Gt(t) {
-  return new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4));
-}
-function ot(...t) {
-  for (let e = 0; e < t.length; e++)
-    t[e].fill(0);
-}
-function Ae(t) {
-  return new DataView(t.buffer, t.byteOffset, t.byteLength);
-}
-function ct(t, e) {
-  return t << 32 - e | t >>> e;
-}
-function N(t, e) {
-  return t << e | t >>> 32 - e >>> 0;
-}
-const Rn = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-function Tn(t) {
-  return t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255;
-}
-const xt = Rn ? (t) => t : (t) => Tn(t);
-function Ss(t) {
-  for (let e = 0; e < t.length; e++)
-    t[e] = Tn(t[e]);
-  return t;
-}
-const Dt = Rn ? (t) => t : Ss;
-function Nn(t) {
-  if (typeof t != "string")
-    throw new Error("string expected");
-  return new Uint8Array(new TextEncoder().encode(t));
-}
-function Rt(t) {
-  return typeof t == "string" && (t = Nn(t)), oe(t), t;
-}
-function fn(t) {
-  return typeof t == "string" && (t = Nn(t)), oe(t), t;
-}
-function qn(t, e) {
-  if (e !== void 0 && {}.toString.call(e) !== "[object Object]")
-    throw new Error("options should be object or undefined");
-  return Object.assign(t, e);
-}
-let Fe = class {
-};
-function Gn(t) {
-  const e = (s) => t().update(Rt(s)).digest(), n = t();
-  return e.outputLen = n.outputLen, e.blockLen = n.blockLen, e.create = () => t(), e;
-}
-function Is(t) {
-  const e = (s, r) => t(r).update(Rt(s)).digest(), n = t({});
-  return e.outputLen = n.outputLen, e.blockLen = n.blockLen, e.create = (s) => t(s), e;
-}
-const vs = /* @__PURE__ */ Uint8Array.from([
-  0,
-  1,
-  2,
-  3,
-  4,
-  5,
-  6,
-  7,
-  8,
-  9,
-  10,
-  11,
-  12,
-  13,
-  14,
-  15,
-  14,
-  10,
-  4,
-  8,
-  9,
-  15,
-  13,
-  6,
-  1,
-  12,
-  0,
-  2,
-  11,
-  7,
-  5,
-  3,
-  11,
-  8,
-  12,
-  0,
-  5,
-  2,
-  15,
-  13,
-  10,
-  14,
-  3,
-  6,
-  7,
-  1,
-  9,
-  4,
-  7,
-  9,
-  3,
-  1,
-  13,
-  12,
-  11,
-  14,
-  2,
-  6,
-  5,
-  10,
-  4,
-  0,
-  15,
-  8,
-  9,
-  0,
-  5,
-  7,
-  2,
-  4,
-  10,
-  15,
-  14,
-  1,
-  11,
-  12,
-  6,
-  8,
-  3,
-  13,
-  2,
-  12,
-  6,
-  10,
-  0,
-  11,
-  8,
-  3,
-  4,
-  13,
-  7,
-  5,
-  15,
-  14,
-  1,
-  9,
-  12,
-  5,
-  1,
-  15,
-  14,
-  13,
-  4,
-  10,
-  0,
-  7,
-  6,
-  3,
-  9,
-  2,
-  8,
-  11,
-  13,
-  11,
-  7,
-  14,
-  12,
-  1,
-  3,
-  9,
-  5,
-  0,
-  15,
-  4,
-  8,
-  6,
-  2,
-  10,
-  6,
-  15,
-  14,
-  9,
-  11,
-  3,
-  0,
-  8,
-  12,
-  2,
-  13,
-  7,
-  1,
-  4,
-  10,
-  5,
-  10,
-  2,
-  8,
-  4,
-  7,
-  6,
-  1,
-  5,
-  15,
-  11,
-  9,
-  14,
-  3,
-  12,
-  13,
-  0,
-  0,
-  1,
-  2,
-  3,
-  4,
-  5,
-  6,
-  7,
-  8,
-  9,
-  10,
-  11,
-  12,
-  13,
-  14,
-  15,
-  14,
-  10,
-  4,
-  8,
-  9,
-  15,
-  13,
-  6,
-  1,
-  12,
-  0,
-  2,
-  11,
-  7,
-  5,
-  3,
-  // Blake1, unused in others
-  11,
-  8,
-  12,
-  0,
-  5,
-  2,
-  15,
-  13,
-  10,
-  14,
-  3,
-  6,
-  7,
-  1,
-  9,
-  4,
-  7,
-  9,
-  3,
-  1,
-  13,
-  12,
-  11,
-  14,
-  2,
-  6,
-  5,
-  10,
-  4,
-  0,
-  15,
-  8,
-  9,
-  0,
-  5,
-  7,
-  2,
-  4,
-  10,
-  15,
-  14,
-  1,
-  11,
-  12,
-  6,
-  8,
-  3,
-  13,
-  2,
-  12,
-  6,
-  10,
-  0,
-  11,
-  8,
-  3,
-  4,
-  13,
-  7,
-  5,
-  15,
-  14,
-  1,
-  9
-]);
-function Ls(t, e, n, s) {
-  if (typeof t.setBigUint64 == "function")
-    return t.setBigUint64(e, n, s);
-  const r = BigInt(32), i = BigInt(4294967295), o = Number(n >> r & i), c = Number(n & i), f = s ? 4 : 0, l = s ? 0 : 4;
-  t.setUint32(e + f, o, s), t.setUint32(e + l, c, s);
-}
-function Us(t, e, n) {
-  return t & e ^ ~t & n;
-}
-function $s(t, e, n) {
-  return t & e ^ t & n ^ e & n;
-}
-let Mn = class extends Fe {
-  constructor(e, n, s, r) {
-    super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = e, this.outputLen = n, this.padOffset = s, this.isLE = r, this.buffer = new Uint8Array(e), this.view = Ae(this.buffer);
-  }
-  update(e) {
-    te(this), e = Rt(e), oe(e);
-    const { view: n, buffer: s, blockLen: r } = this, i = e.length;
-    for (let o = 0; o < i; ) {
-      const c = Math.min(r - this.pos, i - o);
-      if (c === r) {
-        const f = Ae(e);
-        for (; r <= i - o; o += r)
-          this.process(f, o);
-        continue;
-      }
-      s.set(e.subarray(o, o + c), this.pos), this.pos += c, o += c, this.pos === r && (this.process(n, 0), this.pos = 0);
-    }
-    return this.length += e.length, this.roundClean(), this;
-  }
-  digestInto(e) {
-    te(this), On(e, this), this.finished = !0;
-    const { buffer: n, view: s, blockLen: r, isLE: i } = this;
-    let { pos: o } = this;
-    n[o++] = 128, ot(this.buffer.subarray(o)), this.padOffset > r - o && (this.process(s, 0), o = 0);
-    for (let a = o; a < r; a++)
-      n[a] = 0;
-    Ls(s, r - 8, BigInt(this.length * 8), i), this.process(s, 0);
-    const c = Ae(e), f = this.outputLen;
-    if (f % 4)
-      throw new Error("_sha2: outputLen should be aligned to 32bit");
-    const l = f / 4, h = this.get();
-    if (l > h.length)
-      throw new Error("_sha2: outputLen bigger than state");
-    for (let a = 0; a < l; a++)
-      c.setUint32(4 * a, h[a], i);
-  }
-  digest() {
-    const { buffer: e, outputLen: n } = this;
-    this.digestInto(e);
-    const s = e.slice(0, n);
-    return this.destroy(), s;
-  }
-  _cloneInto(e) {
-    e || (e = new this.constructor()), e.set(...this.get());
-    const { blockLen: n, buffer: s, length: r, finished: i, destroyed: o, pos: c } = this;
-    return e.destroyed = o, e.finished = i, e.length = r, e.pos = c, r % n && e.buffer.set(s), e;
-  }
-  clone() {
-    return this._cloneInto();
-  }
-};
-const yt = /* @__PURE__ */ Uint32Array.from([
-  1779033703,
-  3144134277,
-  1013904242,
-  2773480762,
-  1359893119,
-  2600822924,
-  528734635,
-  1541459225
-]);
-const F = /* @__PURE__ */ Uint32Array.from([
-  1779033703,
-  4089235720,
-  3144134277,
-  2227873595,
-  1013904242,
-  4271175723,
-  2773480762,
-  1595750129,
-  1359893119,
-  2917565137,
-  2600822924,
-  725511199,
-  528734635,
-  4215389547,
-  1541459225,
-  327033209
-]), xe = /* @__PURE__ */ BigInt(2 ** 32 - 1), an = /* @__PURE__ */ BigInt(32);
-function Vn(t, e = !1) {
-  return e ? { h: Number(t & xe), l: Number(t >> an & xe) } : { h: Number(t >> an & xe) | 0, l: Number(t & xe) | 0 };
-}
-function Ds(t, e = !1) {
-  const n = t.length;
-  let s = new Uint32Array(n), r = new Uint32Array(n);
-  for (let i = 0; i < n; i++) {
-    const { h: o, l: c } = Vn(t[i], e);
-    [s[i], r[i]] = [o, c];
-  }
-  return [s, r];
-}
-const hn = (t, e, n) => t >>> n, ln = (t, e, n) => t << 32 - n | e >>> n, Ct = (t, e, n) => t >>> n | e << 32 - n, kt = (t, e, n) => t << 32 - n | e >>> n, fe = (t, e, n) => t << 64 - n | e >>> n - 32, ae = (t, e, n) => t >>> n - 32 | e << 64 - n, Cs = (t, e) => e, ks = (t, e) => t;
-function rt(t, e, n, s) {
-  const r = (e >>> 0) + (s >>> 0);
-  return { h: t + n + (r / 2 ** 32 | 0) | 0, l: r | 0 };
-}
-const Pe = (t, e, n) => (t >>> 0) + (e >>> 0) + (n >>> 0), Qe = (t, e, n, s) => e + n + s + (t / 2 ** 32 | 0) | 0, Os = (t, e, n, s) => (t >>> 0) + (e >>> 0) + (n >>> 0) + (s >>> 0), Rs = (t, e, n, s, r) => e + n + s + r + (t / 2 ** 32 | 0) | 0, Ts = (t, e, n, s, r) => (t >>> 0) + (e >>> 0) + (n >>> 0) + (s >>> 0) + (r >>> 0), Ns = (t, e, n, s, r, i) => e + n + s + r + i + (t / 2 ** 32 | 0) | 0, j = /* @__PURE__ */ Uint32Array.from([
-  4089235720,
-  1779033703,
-  2227873595,
-  3144134277,
-  4271175723,
-  1013904242,
-  1595750129,
-  2773480762,
-  2917565137,
-  1359893119,
-  725511199,
-  2600822924,
-  4215389547,
-  528734635,
-  327033209,
-  1541459225
-]), v = /* @__PURE__ */ new Uint32Array(32);
-function pt(t, e, n, s, r, i) {
-  const o = r[i], c = r[i + 1];
-  let f = v[2 * t], l = v[2 * t + 1], h = v[2 * e], a = v[2 * e + 1], d = v[2 * n], u = v[2 * n + 1], y = v[2 * s], b = v[2 * s + 1], w = Pe(f, h, o);
-  l = Qe(w, l, a, c), f = w | 0, { Dh: b, Dl: y } = { Dh: b ^ l, Dl: y ^ f }, { Dh: b, Dl: y } = { Dh: Cs(b, y), Dl: ks(b) }, { h: u, l: d } = rt(u, d, b, y), { Bh: a, Bl: h } = { Bh: a ^ u, Bl: h ^ d }, { Bh: a, Bl: h } = { Bh: Ct(a, h, 24), Bl: kt(a, h, 24) }, v[2 * t] = f, v[2 * t + 1] = l, v[2 * e] = h, v[2 * e + 1] = a, v[2 * n] = d, v[2 * n + 1] = u, v[2 * s] = y, v[2 * s + 1] = b;
-}
-function mt(t, e, n, s, r, i) {
-  const o = r[i], c = r[i + 1];
-  let f = v[2 * t], l = v[2 * t + 1], h = v[2 * e], a = v[2 * e + 1], d = v[2 * n], u = v[2 * n + 1], y = v[2 * s], b = v[2 * s + 1], w = Pe(f, h, o);
-  l = Qe(w, l, a, c), f = w | 0, { Dh: b, Dl: y } = { Dh: b ^ l, Dl: y ^ f }, { Dh: b, Dl: y } = { Dh: Ct(b, y, 16), Dl: kt(b, y, 16) }, { h: u, l: d } = rt(u, d, b, y), { Bh: a, Bl: h } = { Bh: a ^ u, Bl: h ^ d }, { Bh: a, Bl: h } = { Bh: fe(a, h, 63), Bl: ae(a, h, 63) }, v[2 * t] = f, v[2 * t + 1] = l, v[2 * e] = h, v[2 * e + 1] = a, v[2 * n] = d, v[2 * n + 1] = u, v[2 * s] = y, v[2 * s + 1] = b;
-}
-function qs(t, e = {}, n, s, r) {
-  if (et(n), t < 0 || t > n)
-    throw new Error("outputLen bigger than keyLen");
-  const { key: i, salt: o, personalization: c } = e;
-  if (i !== void 0 && (i.length < 1 || i.length > n))
-    throw new Error("key length must be undefined or 1.." + n);
-  if (o !== void 0 && o.length !== s)
-    throw new Error("salt must be undefined or " + s);
-  if (c !== void 0 && c.length !== r)
-    throw new Error("personalization must be undefined or " + r);
-}
-class Gs extends Fe {
-  constructor(e, n) {
-    super(), this.finished = !1, this.destroyed = !1, this.length = 0, this.pos = 0, et(e), et(n), this.blockLen = e, this.outputLen = n, this.buffer = new Uint8Array(e), this.buffer32 = Gt(this.buffer);
-  }
-  update(e) {
-    te(this), e = Rt(e), oe(e);
-    const { blockLen: n, buffer: s, buffer32: r } = this, i = e.length, o = e.byteOffset, c = e.buffer;
-    for (let f = 0; f < i; ) {
-      this.pos === n && (Dt(r), this.compress(r, 0, !1), Dt(r), this.pos = 0);
-      const l = Math.min(n - this.pos, i - f), h = o + f;
-      if (l === n && !(h % 4) && f + l < i) {
-        const a = new Uint32Array(c, h, Math.floor((i - f) / 4));
-        Dt(a);
-        for (let d = 0; f + n < i; d += r.length, f += n)
-          this.length += n, this.compress(a, d, !1);
-        Dt(a);
-        continue;
-      }
-      s.set(e.subarray(f, f + l), this.pos), this.pos += l, this.length += l, f += l;
-    }
-    return this;
-  }
-  digestInto(e) {
-    te(this), On(e, this);
-    const { pos: n, buffer32: s } = this;
-    this.finished = !0, ot(this.buffer.subarray(n)), Dt(s), this.compress(s, 0, !0), Dt(s);
-    const r = Gt(e);
-    this.get().forEach((i, o) => r[o] = xt(i));
-  }
-  digest() {
-    const { buffer: e, outputLen: n } = this;
-    this.digestInto(e);
-    const s = e.slice(0, n);
-    return this.destroy(), s;
-  }
-  _cloneInto(e) {
-    const { buffer: n, length: s, finished: r, destroyed: i, outputLen: o, pos: c } = this;
-    return e || (e = new this.constructor({ dkLen: o })), e.set(...this.get()), e.buffer.set(n), e.destroyed = i, e.finished = r, e.length = s, e.pos = c, e.outputLen = o, e;
-  }
-  clone() {
-    return this._cloneInto();
-  }
-}
-class Ms extends Gs {
-  constructor(e = {}) {
-    const n = e.dkLen === void 0 ? 64 : e.dkLen;
-    super(128, n), this.v0l = j[0] | 0, this.v0h = j[1] | 0, this.v1l = j[2] | 0, this.v1h = j[3] | 0, this.v2l = j[4] | 0, this.v2h = j[5] | 0, this.v3l = j[6] | 0, this.v3h = j[7] | 0, this.v4l = j[8] | 0, this.v4h = j[9] | 0, this.v5l = j[10] | 0, this.v5h = j[11] | 0, this.v6l = j[12] | 0, this.v6h = j[13] | 0, this.v7l = j[14] | 0, this.v7h = j[15] | 0, qs(n, e, 64, 16, 16);
-    let { key: s, personalization: r, salt: i } = e, o = 0;
-    if (s !== void 0 && (s = Rt(s), o = s.length), this.v0l ^= this.outputLen | o << 8 | 65536 | 1 << 24, i !== void 0) {
-      i = Rt(i);
-      const c = Gt(i);
-      this.v4l ^= xt(c[0]), this.v4h ^= xt(c[1]), this.v5l ^= xt(c[2]), this.v5h ^= xt(c[3]);
-    }
-    if (r !== void 0) {
-      r = Rt(r);
-      const c = Gt(r);
-      this.v6l ^= xt(c[0]), this.v6h ^= xt(c[1]), this.v7l ^= xt(c[2]), this.v7h ^= xt(c[3]);
-    }
-    if (s !== void 0) {
-      const c = new Uint8Array(this.blockLen);
-      c.set(s), this.update(c);
-    }
-  }
-  // prettier-ignore
-  get() {
-    let { v0l: e, v0h: n, v1l: s, v1h: r, v2l: i, v2h: o, v3l: c, v3h: f, v4l: l, v4h: h, v5l: a, v5h: d, v6l: u, v6h: y, v7l: b, v7h: w } = this;
-    return [e, n, s, r, i, o, c, f, l, h, a, d, u, y, b, w];
-  }
-  // prettier-ignore
-  set(e, n, s, r, i, o, c, f, l, h, a, d, u, y, b, w) {
-    this.v0l = e | 0, this.v0h = n | 0, this.v1l = s | 0, this.v1h = r | 0, this.v2l = i | 0, this.v2h = o | 0, this.v3l = c | 0, this.v3h = f | 0, this.v4l = l | 0, this.v4h = h | 0, this.v5l = a | 0, this.v5h = d | 0, this.v6l = u | 0, this.v6h = y | 0, this.v7l = b | 0, this.v7h = w | 0;
-  }
-  compress(e, n, s) {
-    this.get().forEach((f, l) => v[l] = f), v.set(j, 16);
-    let { h: r, l: i } = Vn(BigInt(this.length));
-    v[24] = j[8] ^ i, v[25] = j[9] ^ r, s && (v[28] = ~v[28], v[29] = ~v[29]);
-    let o = 0;
-    const c = vs;
-    for (let f = 0; f < 12; f++)
-      pt(0, 4, 8, 12, e, n + 2 * c[o++]), mt(0, 4, 8, 12, e, n + 2 * c[o++]), pt(1, 5, 9, 13, e, n + 2 * c[o++]), mt(1, 5, 9, 13, e, n + 2 * c[o++]), pt(2, 6, 10, 14, e, n + 2 * c[o++]), mt(2, 6, 10, 14, e, n + 2 * c[o++]), pt(3, 7, 11, 15, e, n + 2 * c[o++]), mt(3, 7, 11, 15, e, n + 2 * c[o++]), pt(0, 5, 10, 15, e, n + 2 * c[o++]), mt(0, 5, 10, 15, e, n + 2 * c[o++]), pt(1, 6, 11, 12, e, n + 2 * c[o++]), mt(1, 6, 11, 12, e, n + 2 * c[o++]), pt(2, 7, 8, 13, e, n + 2 * c[o++]), mt(2, 7, 8, 13, e, n + 2 * c[o++]), pt(3, 4, 9, 14, e, n + 2 * c[o++]), mt(3, 4, 9, 14, e, n + 2 * c[o++]);
-    this.v0l ^= v[0] ^ v[16], this.v0h ^= v[1] ^ v[17], this.v1l ^= v[2] ^ v[18], this.v1h ^= v[3] ^ v[19], this.v2l ^= v[4] ^ v[20], this.v2h ^= v[5] ^ v[21], this.v3l ^= v[6] ^ v[22], this.v3h ^= v[7] ^ v[23], this.v4l ^= v[8] ^ v[24], this.v4h ^= v[9] ^ v[25], this.v5l ^= v[10] ^ v[26], this.v5h ^= v[11] ^ v[27], this.v6l ^= v[12] ^ v[28], this.v6h ^= v[13] ^ v[29], this.v7l ^= v[14] ^ v[30], this.v7h ^= v[15] ^ v[31], ot(v);
-  }
-  destroy() {
-    this.destroyed = !0, ot(this.buffer32), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
-  }
-}
-const Vs = /* @__PURE__ */ Is((t) => new Ms(t));
-const ri = Vs;
-let Zn = class extends Fe {
-  constructor(e, n) {
-    super(), this.finished = !1, this.destroyed = !1, kn(e);
-    const s = Rt(n);
-    if (this.iHash = e.create(), typeof this.iHash.update != "function")
-      throw new Error("Expected instance of class which extends utils.Hash");
-    this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
-    const r = this.blockLen, i = new Uint8Array(r);
-    i.set(s.length > r ? e.create().update(s).digest() : s);
-    for (let o = 0; o < i.length; o++)
-      i[o] ^= 54;
-    this.iHash.update(i), this.oHash = e.create();
-    for (let o = 0; o < i.length; o++)
-      i[o] ^= 106;
-    this.oHash.update(i), ot(i);
-  }
-  update(e) {
-    return te(this), this.iHash.update(e), this;
-  }
-  digestInto(e) {
-    te(this), oe(e, this.outputLen), this.finished = !0, this.iHash.digestInto(e), this.oHash.update(e), this.oHash.digestInto(e), this.destroy();
-  }
-  digest() {
-    const e = new Uint8Array(this.oHash.outputLen);
-    return this.digestInto(e), e;
-  }
-  _cloneInto(e) {
-    e || (e = Object.create(Object.getPrototypeOf(this), {}));
-    const { oHash: n, iHash: s, finished: r, destroyed: i, blockLen: o, outputLen: c } = this;
-    return e = e, e.finished = r, e.destroyed = i, e.blockLen = o, e.outputLen = c, e.oHash = n._cloneInto(e.oHash), e.iHash = s._cloneInto(e.iHash), e;
-  }
-  clone() {
-    return this._cloneInto();
-  }
-  destroy() {
-    this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
-  }
-};
-const zn = (t, e, n) => new Zn(t, e).update(n).digest();
-zn.create = (t, e) => new Zn(t, e);
-function Zs(t, e, n, s) {
-  kn(t);
-  const r = qn({ dkLen: 32, asyncTick: 10 }, s), { c: i, dkLen: o, asyncTick: c } = r;
-  if (et(i), et(o), et(c), i < 1)
-    throw new Error("iterations (c) should be >= 1");
-  const f = fn(e), l = fn(n), h = new Uint8Array(o), a = zn.create(t, f), d = a._cloneInto().update(l);
-  return { c: i, dkLen: o, asyncTick: c, DK: h, PRF: a, PRFSalt: d };
-}
-function zs(t, e, n, s, r) {
-  return t.destroy(), e.destroy(), s && s.destroy(), ot(r), n;
-}
-function jn(t, e, n, s) {
-  const { c: r, dkLen: i, DK: o, PRF: c, PRFSalt: f } = Zs(t, e, n, s);
-  let l;
-  const h = new Uint8Array(4), a = Ae(h), d = new Uint8Array(c.outputLen);
-  for (let u = 1, y = 0; y < i; u++, y += c.outputLen) {
-    const b = o.subarray(y, y + c.outputLen);
-    a.setInt32(0, u, !1), (l = f._cloneInto(l)).update(h).digestInto(d), b.set(d.subarray(0, b.length));
-    for (let w = 1; w < r; w++) {
-      c._cloneInto(l).update(d).digestInto(d);
-      for (let _ = 0; _ < b.length; _++)
-        b[_] ^= d[_];
-    }
-  }
-  return zs(c, f, o, l, d);
-}
-const js = /* @__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
-]), Bt = /* @__PURE__ */ new Uint32Array(64);
-let Ws = class extends Mn {
-  constructor(e = 32) {
-    super(64, e, 8, !1), this.A = yt[0] | 0, this.B = yt[1] | 0, this.C = yt[2] | 0, this.D = yt[3] | 0, this.E = yt[4] | 0, this.F = yt[5] | 0, this.G = yt[6] | 0, this.H = yt[7] | 0;
-  }
-  get() {
-    const { A: e, B: n, C: s, D: r, E: i, F: o, G: c, H: f } = this;
-    return [e, n, s, r, i, o, c, f];
-  }
-  // prettier-ignore
-  set(e, n, s, r, i, o, c, f) {
-    this.A = e | 0, this.B = n | 0, this.C = s | 0, this.D = r | 0, this.E = i | 0, this.F = o | 0, this.G = c | 0, this.H = f | 0;
-  }
-  process(e, n) {
-    for (let a = 0; a < 16; a++, n += 4)
-      Bt[a] = e.getUint32(n, !1);
-    for (let a = 16; a < 64; a++) {
-      const d = Bt[a - 15], u = Bt[a - 2], y = ct(d, 7) ^ ct(d, 18) ^ d >>> 3, b = ct(u, 17) ^ ct(u, 19) ^ u >>> 10;
-      Bt[a] = b + Bt[a - 7] + y + Bt[a - 16] | 0;
-    }
-    let { A: s, B: r, C: i, D: o, E: c, F: f, G: l, H: h } = this;
-    for (let a = 0; a < 64; a++) {
-      const d = ct(c, 6) ^ ct(c, 11) ^ ct(c, 25), u = h + d + Us(c, f, l) + js[a] + Bt[a] | 0, b = (ct(s, 2) ^ ct(s, 13) ^ ct(s, 22)) + $s(s, r, i) | 0;
-      h = l, l = f, f = c, c = o + u | 0, o = i, i = r, r = s, s = u + b | 0;
-    }
-    s = s + this.A | 0, r = r + this.B | 0, i = i + this.C | 0, o = o + this.D | 0, c = c + this.E | 0, f = f + this.F | 0, l = l + this.G | 0, h = h + this.H | 0, this.set(s, r, i, o, c, f, l, h);
-  }
-  roundClean() {
-    ot(Bt);
-  }
-  destroy() {
-    this.set(0, 0, 0, 0, 0, 0, 0, 0), ot(this.buffer);
-  }
-};
-const Wn = Ds([
-  "0x428a2f98d728ae22",
-  "0x7137449123ef65cd",
-  "0xb5c0fbcfec4d3b2f",
-  "0xe9b5dba58189dbbc",
-  "0x3956c25bf348b538",
-  "0x59f111f1b605d019",
-  "0x923f82a4af194f9b",
-  "0xab1c5ed5da6d8118",
-  "0xd807aa98a3030242",
-  "0x12835b0145706fbe",
-  "0x243185be4ee4b28c",
-  "0x550c7dc3d5ffb4e2",
-  "0x72be5d74f27b896f",
-  "0x80deb1fe3b1696b1",
-  "0x9bdc06a725c71235",
-  "0xc19bf174cf692694",
-  "0xe49b69c19ef14ad2",
-  "0xefbe4786384f25e3",
-  "0x0fc19dc68b8cd5b5",
-  "0x240ca1cc77ac9c65",
-  "0x2de92c6f592b0275",
-  "0x4a7484aa6ea6e483",
-  "0x5cb0a9dcbd41fbd4",
-  "0x76f988da831153b5",
-  "0x983e5152ee66dfab",
-  "0xa831c66d2db43210",
-  "0xb00327c898fb213f",
-  "0xbf597fc7beef0ee4",
-  "0xc6e00bf33da88fc2",
-  "0xd5a79147930aa725",
-  "0x06ca6351e003826f",
-  "0x142929670a0e6e70",
-  "0x27b70a8546d22ffc",
-  "0x2e1b21385c26c926",
-  "0x4d2c6dfc5ac42aed",
-  "0x53380d139d95b3df",
-  "0x650a73548baf63de",
-  "0x766a0abb3c77b2a8",
-  "0x81c2c92e47edaee6",
-  "0x92722c851482353b",
-  "0xa2bfe8a14cf10364",
-  "0xa81a664bbc423001",
-  "0xc24b8b70d0f89791",
-  "0xc76c51a30654be30",
-  "0xd192e819d6ef5218",
-  "0xd69906245565a910",
-  "0xf40e35855771202a",
-  "0x106aa07032bbd1b8",
-  "0x19a4c116b8d2d0c8",
-  "0x1e376c085141ab53",
-  "0x2748774cdf8eeb99",
-  "0x34b0bcb5e19b48a8",
-  "0x391c0cb3c5c95a63",
-  "0x4ed8aa4ae3418acb",
-  "0x5b9cca4f7763e373",
-  "0x682e6ff3d6b2b8a3",
-  "0x748f82ee5defb2fc",
-  "0x78a5636f43172f60",
-  "0x84c87814a1f0ab72",
-  "0x8cc702081a6439ec",
-  "0x90befffa23631e28",
-  "0xa4506cebde82bde9",
-  "0xbef9a3f7b2c67915",
-  "0xc67178f2e372532b",
-  "0xca273eceea26619c",
-  "0xd186b8c721c0c207",
-  "0xeada7dd6cde0eb1e",
-  "0xf57d4f7fee6ed178",
-  "0x06f067aa72176fba",
-  "0x0a637dc5a2c898a6",
-  "0x113f9804bef90dae",
-  "0x1b710b35131c471b",
-  "0x28db77f523047d84",
-  "0x32caab7b40c72493",
-  "0x3c9ebe0a15c9bebc",
-  "0x431d67c49c100d4c",
-  "0x4cc5d4becb3e42b6",
-  "0x597f299cfc657e2a",
-  "0x5fcb6fab3ad6faec",
-  "0x6c44198c4a475817"
-].map((t) => BigInt(t))), Ks = Wn[0], Ys = Wn[1], Et = /* @__PURE__ */ new Uint32Array(80), At = /* @__PURE__ */ new Uint32Array(80);
-let Xs = class extends Mn {
-  constructor(e = 64) {
-    super(128, e, 16, !1), this.Ah = F[0] | 0, this.Al = F[1] | 0, this.Bh = F[2] | 0, this.Bl = F[3] | 0, this.Ch = F[4] | 0, this.Cl = F[5] | 0, this.Dh = F[6] | 0, this.Dl = F[7] | 0, this.Eh = F[8] | 0, this.El = F[9] | 0, this.Fh = F[10] | 0, this.Fl = F[11] | 0, this.Gh = F[12] | 0, this.Gl = F[13] | 0, this.Hh = F[14] | 0, this.Hl = F[15] | 0;
-  }
-  // prettier-ignore
-  get() {
-    const { Ah: e, Al: n, Bh: s, Bl: r, Ch: i, Cl: o, Dh: c, Dl: f, Eh: l, El: h, Fh: a, Fl: d, Gh: u, Gl: y, Hh: b, Hl: w } = this;
-    return [e, n, s, r, i, o, c, f, l, h, a, d, u, y, b, w];
-  }
-  // prettier-ignore
-  set(e, n, s, r, i, o, c, f, l, h, a, d, u, y, b, w) {
-    this.Ah = e | 0, this.Al = n | 0, this.Bh = s | 0, this.Bl = r | 0, this.Ch = i | 0, this.Cl = o | 0, this.Dh = c | 0, this.Dl = f | 0, this.Eh = l | 0, this.El = h | 0, this.Fh = a | 0, this.Fl = d | 0, this.Gh = u | 0, this.Gl = y | 0, this.Hh = b | 0, this.Hl = w | 0;
-  }
-  process(e, n) {
-    for (let p = 0; p < 16; p++, n += 4)
-      Et[p] = e.getUint32(n), At[p] = e.getUint32(n += 4);
-    for (let p = 16; p < 80; p++) {
-      const D = Et[p - 15] | 0, m = At[p - 15] | 0, U = Ct(D, m, 1) ^ Ct(D, m, 8) ^ hn(D, m, 7), C = kt(D, m, 1) ^ kt(D, m, 8) ^ ln(D, m, 7), H = Et[p - 2] | 0, x = At[p - 2] | 0, E = Ct(H, x, 19) ^ fe(H, x, 61) ^ hn(H, x, 6), g = kt(H, x, 19) ^ ae(H, x, 61) ^ ln(H, x, 6), B = Os(C, g, At[p - 7], At[p - 16]), A = Rs(B, U, E, Et[p - 7], Et[p - 16]);
-      Et[p] = A | 0, At[p] = B | 0;
-    }
-    let { Ah: s, Al: r, Bh: i, Bl: o, Ch: c, Cl: f, Dh: l, Dl: h, Eh: a, El: d, Fh: u, Fl: y, Gh: b, Gl: w, Hh: _, Hl: L } = this;
-    for (let p = 0; p < 80; p++) {
-      const D = Ct(a, d, 14) ^ Ct(a, d, 18) ^ fe(a, d, 41), m = kt(a, d, 14) ^ kt(a, d, 18) ^ ae(a, d, 41), U = a & u ^ ~a & b, C = d & y ^ ~d & w, H = Ts(L, m, C, Ys[p], At[p]), x = Ns(H, _, D, U, Ks[p], Et[p]), E = H | 0, g = Ct(s, r, 28) ^ fe(s, r, 34) ^ fe(s, r, 39), B = kt(s, r, 28) ^ ae(s, r, 34) ^ ae(s, r, 39), A = s & i ^ s & c ^ i & c, I = r & o ^ r & f ^ o & f;
-      _ = b | 0, L = w | 0, b = u | 0, w = y | 0, u = a | 0, y = d | 0, { h: a, l: d } = rt(l | 0, h | 0, x | 0, E | 0), l = c | 0, h = f | 0, c = i | 0, f = o | 0, i = s | 0, o = r | 0;
-      const S = Pe(E, B, I);
-      s = Qe(S, x, g, A), r = S | 0;
-    }
-    ({ h: s, l: r } = rt(this.Ah | 0, this.Al | 0, s | 0, r | 0)), { h: i, l: o } = rt(this.Bh | 0, this.Bl | 0, i | 0, o | 0), { h: c, l: f } = rt(this.Ch | 0, this.Cl | 0, c | 0, f | 0), { h: l, l: h } = rt(this.Dh | 0, this.Dl | 0, l | 0, h | 0), { h: a, l: d } = rt(this.Eh | 0, this.El | 0, a | 0, d | 0), { h: u, l: y } = rt(this.Fh | 0, this.Fl | 0, u | 0, y | 0), { h: b, l: w } = rt(this.Gh | 0, this.Gl | 0, b | 0, w | 0), { h: _, l: L } = rt(this.Hh | 0, this.Hl | 0, _ | 0, L | 0), this.set(s, r, i, o, c, f, l, h, a, d, u, y, b, w, _, L);
-  }
-  roundClean() {
-    ot(Et, At);
-  }
-  destroy() {
-    ot(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
-  }
-};
-const Je = /* @__PURE__ */ Gn(() => new Ws()), Fs = /* @__PURE__ */ Gn(() => new Xs());
-function dn(t, e, n, s, r, i) {
-  let o = t[e++] ^ n[s++], c = t[e++] ^ n[s++], f = t[e++] ^ n[s++], l = t[e++] ^ n[s++], h = t[e++] ^ n[s++], a = t[e++] ^ n[s++], d = t[e++] ^ n[s++], u = t[e++] ^ n[s++], y = t[e++] ^ n[s++], b = t[e++] ^ n[s++], w = t[e++] ^ n[s++], _ = t[e++] ^ n[s++], L = t[e++] ^ n[s++], p = t[e++] ^ n[s++], D = t[e++] ^ n[s++], m = t[e++] ^ n[s++], U = o, C = c, H = f, x = l, E = h, g = a, B = d, A = u, I = y, S = b, $ = w, O = _, k = L, q = p, T = D, R = m;
-  for (let M = 0; M < 8; M += 2)
-    E ^= N(U + k | 0, 7), I ^= N(E + U | 0, 9), k ^= N(I + E | 0, 13), U ^= N(k + I | 0, 18), S ^= N(g + C | 0, 7), q ^= N(S + g | 0, 9), C ^= N(q + S | 0, 13), g ^= N(C + q | 0, 18), T ^= N($ + B | 0, 7), H ^= N(T + $ | 0, 9), B ^= N(H + T | 0, 13), $ ^= N(B + H | 0, 18), x ^= N(R + O | 0, 7), A ^= N(x + R | 0, 9), O ^= N(A + x | 0, 13), R ^= N(O + A | 0, 18), C ^= N(U + x | 0, 7), H ^= N(C + U | 0, 9), x ^= N(H + C | 0, 13), U ^= N(x + H | 0, 18), B ^= N(g + E | 0, 7), A ^= N(B + g | 0, 9), E ^= N(A + B | 0, 13), g ^= N(E + A | 0, 18), O ^= N($ + S | 0, 7), I ^= N(O + $ | 0, 9), S ^= N(I + O | 0, 13), $ ^= N(S + I | 0, 18), k ^= N(R + T | 0, 7), q ^= N(k + R | 0, 9), T ^= N(q + k | 0, 13), R ^= N(T + q | 0, 18);
-  r[i++] = o + U | 0, r[i++] = c + C | 0, r[i++] = f + H | 0, r[i++] = l + x | 0, r[i++] = h + E | 0, r[i++] = a + g | 0, r[i++] = d + B | 0, r[i++] = u + A | 0, r[i++] = y + I | 0, r[i++] = b + S | 0, r[i++] = w + $ | 0, r[i++] = _ + O | 0, r[i++] = L + k | 0, r[i++] = p + q | 0, r[i++] = D + T | 0, r[i++] = m + R | 0;
-}
-function Ce(t, e, n, s, r) {
-  let i = s + 0, o = s + 16 * r;
-  for (let c = 0; c < 16; c++)
-    n[o + c] = t[e + (2 * r - 1) * 16 + c];
-  for (let c = 0; c < r; c++, i += 16, e += 16)
-    dn(n, o, t, e, n, i), c > 0 && (o += 16), dn(n, i, t, e += 16, n, o);
-}
-function Ps(t, e, n) {
-  const s = qn({
-    dkLen: 32,
-    asyncTick: 10,
-    maxmem: 1073742848
-  }, n), { N: r, r: i, p: o, dkLen: c, asyncTick: f, maxmem: l, onProgress: h } = s;
-  if (et(r), et(i), et(o), et(c), et(f), et(l), h !== void 0 && typeof h != "function")
-    throw new Error("progressCb should be function");
-  const a = 128 * i, d = a / 4, u = Math.pow(2, 32);
-  if (r <= 1 || (r & r - 1) !== 0 || r > u)
-    throw new Error("Scrypt: N must be larger than 1, a power of 2, and less than 2^32");
-  if (o < 0 || o > (u - 1) * 32 / a)
-    throw new Error("Scrypt: p must be a positive integer less than or equal to ((2^32 - 1) * 32) / (128 * r)");
-  if (c < 0 || c > (u - 1) * 32)
-    throw new Error("Scrypt: dkLen should be positive integer less than or equal to (2^32 - 1) * 32");
-  if (a * (r + o) > l)
-    throw new Error("Scrypt: memused is bigger than maxMem. Expected 128 * r * (N + p) > maxmem of " + l);
-  const b = jn(Je, t, e, { c: 1, dkLen: a * o }), w = Gt(b), _ = Gt(new Uint8Array(a * r)), L = Gt(new Uint8Array(a));
-  let p = () => {
-  };
-  if (h) {
-    const D = 2 * r * o, m = Math.max(Math.floor(D / 1e4), 1);
-    let U = 0;
-    p = () => {
-      U++, h && (!(U % m) || U === D) && h(U / D);
-    };
-  }
-  return { N: r, r: i, p: o, dkLen: c, blockSize32: d, V: _, B32: w, B: b, tmp: L, blockMixCb: p, asyncTick: f };
-}
-function Qs(t, e, n, s, r) {
-  const i = jn(Je, t, n, { c: 1, dkLen: e });
-  return ot(n, s, r), i;
-}
-function fi(t, e, n) {
-  const { N: s, r, p: i, dkLen: o, blockSize32: c, V: f, B32: l, B: h, tmp: a, blockMixCb: d } = Ps(t, e, n);
-  Dt(l);
-  for (let u = 0; u < i; u++) {
-    const y = c * u;
-    for (let b = 0; b < c; b++)
-      f[b] = l[y + b];
-    for (let b = 0, w = 0; b < s - 1; b++)
-      Ce(f, w, f, w += c, r), d();
-    Ce(f, (s - 1) * c, l, y, r), d();
-    for (let b = 0; b < s; b++) {
-      const w = l[y + c - 16] % s;
-      for (let _ = 0; _ < c; _++)
-        a[_] = l[y + _] ^ f[w * c + _];
-      Ce(a, 0, l, y, r), d();
-    }
-  }
-  return Dt(l), Qs(t, o, h, f, a);
-}
-const Wt = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
-function tn(t) {
-  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
-}
-function ze(t) {
-  if (!Number.isSafeInteger(t) || t < 0)
-    throw new Error("positive integer expected, got " + t);
-}
-function it(t, ...e) {
-  if (!tn(t))
-    throw new Error("Uint8Array expected");
-  if (e.length > 0 && !e.includes(t.length))
-    throw new Error("Uint8Array expected of length " + e + ", got length=" + t.length);
-}
-function Js(t) {
-  if (typeof t != "function" || typeof t.create != "function")
-    throw new Error("Hash should be wrapped by utils.createHasher");
-  ze(t.outputLen), ze(t.blockLen);
-}
-function _e(t, e = !0) {
-  if (t.destroyed)
-    throw new Error("Hash instance has been destroyed");
-  if (e && t.finished)
-    throw new Error("Hash#digest() has already been called");
-}
-function tr(t, e) {
-  it(t);
-  const n = e.outputLen;
-  if (t.length < n)
-    throw new Error("digestInto() expects output buffer of length at least " + n);
-}
-function ee(...t) {
-  for (let e = 0; e < t.length; e++)
-    t[e].fill(0);
-}
-function ke(t) {
-  return new DataView(t.buffer, t.byteOffset, t.byteLength);
-}
-function ft(t, e) {
-  return t << 32 - e | t >>> e;
-}
-const Kn = /* @ts-ignore */ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", er = /* @__PURE__ */ Array.from({ length: 256 }, (t, e) => e.toString(16).padStart(2, "0"));
-function Mt(t) {
-  if (it(t), Kn)
-    return t.toHex();
-  let e = "";
-  for (let n = 0; n < t.length; n++)
-    e += er[t[n]];
-  return e;
-}
-const lt = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
-function un(t) {
-  if (t >= lt._0 && t <= lt._9)
-    return t - lt._0;
-  if (t >= lt.A && t <= lt.F)
-    return t - (lt.A - 10);
-  if (t >= lt.a && t <= lt.f)
-    return t - (lt.a - 10);
-}
-function en(t) {
-  if (typeof t != "string")
-    throw new Error("hex string expected, got " + typeof t);
-  if (Kn)
-    return Uint8Array.fromHex(t);
-  const e = t.length, n = e / 2;
-  if (e % 2)
-    throw new Error("hex string expected, got unpadded hex of length " + e);
-  const s = new Uint8Array(n);
-  for (let r = 0, i = 0; r < n; r++, i += 2) {
-    const o = un(t.charCodeAt(i)), c = un(t.charCodeAt(i + 1));
-    if (o === void 0 || c === void 0) {
-      const f = t[i] + t[i + 1];
-      throw new Error('hex string expected, got non-hex character "' + f + '" at index ' + i);
-    }
-    s[r] = o * 16 + c;
-  }
-  return s;
-}
-function nr(t) {
-  if (typeof t != "string")
-    throw new Error("string expected");
-  return new Uint8Array(new TextEncoder().encode(t));
-}
-function nn(t) {
-  return typeof t == "string" && (t = nr(t)), it(t), t;
-}
-function wt(...t) {
-  let e = 0;
-  for (let s = 0; s < t.length; s++) {
-    const r = t[s];
-    it(r), e += r.length;
-  }
-  const n = new Uint8Array(e);
-  for (let s = 0, r = 0; s < t.length; s++) {
-    const i = t[s];
-    n.set(i, r), r += i.length;
-  }
-  return n;
-}
-let Yn = class {
-};
-function Xn(t) {
-  const e = (s) => t().update(nn(s)).digest(), n = t();
-  return e.outputLen = n.outputLen, e.blockLen = n.blockLen, e.create = () => t(), e;
-}
-function Fn(t = 32) {
-  if (Wt && typeof Wt.getRandomValues == "function")
-    return Wt.getRandomValues(new Uint8Array(t));
-  if (Wt && typeof Wt.randomBytes == "function")
-    return Uint8Array.from(Wt.randomBytes(t));
-  throw new Error("crypto.getRandomValues must be defined");
-}
-const sn = /* @__PURE__ */ BigInt(0), je = /* @__PURE__ */ BigInt(1);
-function Vt(t, e) {
-  if (typeof e != "boolean")
-    throw new Error(t + " boolean expected, got " + e);
-}
-function be(t) {
-  const e = t.toString(16);
-  return e.length & 1 ? "0" + e : e;
-}
-function Pn(t) {
-  if (typeof t != "string")
-    throw new Error("hex string expected, got " + typeof t);
-  return t === "" ? sn : BigInt("0x" + t);
-}
-function ve(t) {
-  return Pn(Mt(t));
-}
-function ne(t) {
-  return it(t), Pn(Mt(Uint8Array.from(t).reverse()));
-}
-function rn(t, e) {
-  return en(t.toString(16).padStart(e * 2, "0"));
-}
-function se(t, e) {
-  return rn(t, e).reverse();
-}
-function V(t, e, n) {
-  let s;
-  if (typeof e == "string")
-    try {
-      s = en(e);
-    } catch (i) {
-      throw new Error(t + " must be hex string or Uint8Array, cause: " + i);
-    }
-  else if (tn(e))
-    s = Uint8Array.from(e);
-  else
-    throw new Error(t + " must be hex string or Uint8Array");
-  const r = s.length;
-  if (typeof n == "number" && r !== n)
-    throw new Error(t + " of length " + n + " expected, got " + r);
-  return s;
-}
-function sr(t, e) {
-  if (t.length !== e.length)
-    return !1;
-  let n = 0;
-  for (let s = 0; s < t.length; s++)
-    n |= t[s] ^ e[s];
-  return n === 0;
-}
-const Oe = (t) => typeof t == "bigint" && sn <= t;
-function rr(t, e, n) {
-  return Oe(t) && Oe(e) && Oe(n) && e <= t && t < n;
-}
-function Jt(t, e, n, s) {
-  if (!rr(e, n, s))
-    throw new Error("expected valid " + t + ": " + n + " <= n < " + s + ", got " + e);
-}
-function or(t) {
-  let e;
-  for (e = 0; t > sn; t >>= je, e += 1)
-    ;
-  return e;
-}
-const Le = (t) => (je << BigInt(t)) - je;
-function ir(t, e, n) {
-  if (typeof t != "number" || t < 2)
-    throw new Error("hashLen must be a number");
-  if (typeof e != "number" || e < 2)
-    throw new Error("qByteLen must be a number");
-  if (typeof n != "function")
-    throw new Error("hmacFn must be a function");
-  const s = (u) => new Uint8Array(u), r = (u) => Uint8Array.of(u);
-  let i = s(t), o = s(t), c = 0;
-  const f = () => {
-    i.fill(1), o.fill(0), c = 0;
-  }, l = (...u) => n(o, i, ...u), h = (u = s(0)) => {
-    o = l(r(0), u), i = l(), u.length !== 0 && (o = l(r(1), u), i = l());
-  }, a = () => {
-    if (c++ >= 1e3)
-      throw new Error("drbg: tried 1000 values");
-    let u = 0;
-    const y = [];
-    for (; u < e; ) {
-      i = l();
-      const b = i.slice();
-      y.push(b), u += i.length;
-    }
-    return wt(...y);
-  };
-  return (u, y) => {
-    f(), h(u);
-    let b;
-    for (; !(b = y(a())); )
-      h();
-    return f(), b;
-  };
-}
-function ue(t, e, n = {}) {
-  if (!t || typeof t != "object")
-    throw new Error("expected valid options object");
-  function s(r, i, o) {
-    const c = t[r];
-    if (o && c === void 0)
-      return;
-    const f = typeof c;
-    if (f !== i || c === null)
-      throw new Error(`param "${r}" is invalid: expected ${i}, got ${f}`);
-  }
-  Object.entries(e).forEach(([r, i]) => s(r, i, !1)), Object.entries(n).forEach(([r, i]) => s(r, i, !0));
-}
-function He(t) {
-  const e = /* @__PURE__ */ new WeakMap();
-  return (n, ...s) => {
-    const r = e.get(n);
-    if (r !== void 0)
-      return r;
-    const i = t(n, ...s);
-    return e.set(n, i), i;
-  };
-}
-const nt = BigInt(0), Y = BigInt(1), Nt = /* @__PURE__ */ BigInt(2), cr = /* @__PURE__ */ BigInt(3), Qn = /* @__PURE__ */ BigInt(4), Jn = /* @__PURE__ */ BigInt(5), ts = /* @__PURE__ */ BigInt(8);
-function z(t, e) {
-  const n = t % e;
-  return n >= nt ? n : e + n;
-}
-function Z(t, e, n) {
-  let s = t;
-  for (; e-- > nt; )
-    s *= s, s %= n;
-  return s;
-}
-function xn(t, e) {
-  if (t === nt)
-    throw new Error("invert: expected non-zero number");
-  if (e <= nt)
-    throw new Error("invert: expected positive modulus, got " + e);
-  let n = z(t, e), s = e, r = nt, i = Y;
-  for (; n !== nt; ) {
-    const c = s / n, f = s % n, l = r - i * c;
-    s = n, n = f, r = i, i = l;
-  }
-  if (s !== Y)
-    throw new Error("invert: does not exist");
-  return z(r, e);
-}
-function es(t, e) {
-  const n = (t.ORDER + Y) / Qn, s = t.pow(e, n);
-  if (!t.eql(t.sqr(s), e))
-    throw new Error("Cannot find square root");
-  return s;
-}
-function fr(t, e) {
-  const n = (t.ORDER - Jn) / ts, s = t.mul(e, Nt), r = t.pow(s, n), i = t.mul(e, r), o = t.mul(t.mul(i, Nt), r), c = t.mul(i, t.sub(o, t.ONE));
-  if (!t.eql(t.sqr(c), e))
-    throw new Error("Cannot find square root");
-  return c;
-}
-function ar(t) {
-  if (t < BigInt(3))
-    throw new Error("sqrt is not defined for small field");
-  let e = t - Y, n = 0;
-  for (; e % Nt === nt; )
-    e /= Nt, n++;
-  let s = Nt;
-  const r = Zt(t);
-  for (; bn(r, s) === 1; )
-    if (s++ > 1e3)
-      throw new Error("Cannot find square root: probably non-prime P");
-  if (n === 1)
-    return es;
-  let i = r.pow(s, e);
-  const o = (e + Y) / Nt;
-  return function(f, l) {
-    if (f.is0(l))
-      return l;
-    if (bn(f, l) !== 1)
-      throw new Error("Cannot find square root");
-    let h = n, a = f.mul(f.ONE, i), d = f.pow(l, e), u = f.pow(l, o);
-    for (; !f.eql(d, f.ONE); ) {
-      if (f.is0(d))
-        return f.ZERO;
-      let y = 1, b = f.sqr(d);
-      for (; !f.eql(b, f.ONE); )
-        if (y++, b = f.sqr(b), y === h)
-          throw new Error("Cannot find square root");
-      const w = Y << BigInt(h - y - 1), _ = f.pow(a, w);
-      h = y, a = f.sqr(_), d = f.mul(d, a), u = f.mul(u, _);
-    }
-    return u;
-  };
-}
-function hr(t) {
-  return t % Qn === cr ? es : t % ts === Jn ? fr : ar(t);
-}
-const Ot = (t, e) => (z(t, e) & Y) === Y, lr = [
-  "create",
-  "isValid",
-  "is0",
-  "neg",
-  "inv",
-  "sqrt",
-  "sqr",
-  "eql",
-  "add",
-  "sub",
-  "mul",
-  "pow",
-  "div",
-  "addN",
-  "subN",
-  "mulN",
-  "sqrN"
-];
-function dr(t) {
-  const e = {
-    ORDER: "bigint",
-    MASK: "bigint",
-    BYTES: "number",
-    BITS: "number"
-  }, n = lr.reduce((s, r) => (s[r] = "function", s), e);
-  return ue(t, n), t;
-}
-function ur(t, e, n) {
-  if (n < nt)
-    throw new Error("invalid exponent, negatives unsupported");
-  if (n === nt)
-    return t.ONE;
-  if (n === Y)
-    return e;
-  let s = t.ONE, r = e;
-  for (; n > nt; )
-    n & Y && (s = t.mul(s, r)), r = t.sqr(r), n >>= Y;
-  return s;
-}
-function ns(t, e, n = !1) {
-  const s = new Array(e.length).fill(n ? t.ZERO : void 0), r = e.reduce((o, c, f) => t.is0(c) ? o : (s[f] = o, t.mul(o, c)), t.ONE), i = t.inv(r);
-  return e.reduceRight((o, c, f) => t.is0(c) ? o : (s[f] = t.mul(o, s[f]), t.mul(o, c)), i), s;
-}
-function bn(t, e) {
-  const n = (t.ORDER - Y) / Nt, s = t.pow(e, n), r = t.eql(s, t.ONE), i = t.eql(s, t.ZERO), o = t.eql(s, t.neg(t.ONE));
-  if (!r && !i && !o)
-    throw new Error("invalid Legendre symbol result");
-  return r ? 1 : i ? 0 : -1;
-}
-function xr(t, e) {
-  e !== void 0 && ze(e);
-  const n = e !== void 0 ? e : t.toString(2).length, s = Math.ceil(n / 8);
-  return { nBitLength: n, nByteLength: s };
-}
-function Zt(t, e, n = !1, s = {}) {
-  if (t <= nt)
-    throw new Error("invalid field: expected ORDER > 0, got " + t);
-  let r, i;
-  if (typeof e == "object" && e != null) {
-    if (s.sqrt || n)
-      throw new Error("cannot specify opts in two arguments");
-    const h = e;
-    h.BITS && (r = h.BITS), h.sqrt && (i = h.sqrt), typeof h.isLE == "boolean" && (n = h.isLE);
-  } else
-    typeof e == "number" && (r = e), s.sqrt && (i = s.sqrt);
-  const { nBitLength: o, nByteLength: c } = xr(t, r);
-  if (c > 2048)
-    throw new Error("invalid field: expected ORDER of <= 2048 bytes");
-  let f;
-  const l = Object.freeze({
-    ORDER: t,
-    isLE: n,
-    BITS: o,
-    BYTES: c,
-    MASK: Le(o),
-    ZERO: nt,
-    ONE: Y,
-    create: (h) => z(h, t),
-    isValid: (h) => {
-      if (typeof h != "bigint")
-        throw new Error("invalid field element: expected bigint, got " + typeof h);
-      return nt <= h && h < t;
-    },
-    is0: (h) => h === nt,
-    // is valid and invertible
-    isValidNot0: (h) => !l.is0(h) && l.isValid(h),
-    isOdd: (h) => (h & Y) === Y,
-    neg: (h) => z(-h, t),
-    eql: (h, a) => h === a,
-    sqr: (h) => z(h * h, t),
-    add: (h, a) => z(h + a, t),
-    sub: (h, a) => z(h - a, t),
-    mul: (h, a) => z(h * a, t),
-    pow: (h, a) => ur(l, h, a),
-    div: (h, a) => z(h * xn(a, t), t),
-    // Same as above, but doesn't normalize
-    sqrN: (h) => h * h,
-    addN: (h, a) => h + a,
-    subN: (h, a) => h - a,
-    mulN: (h, a) => h * a,
-    inv: (h) => xn(h, t),
-    sqrt: i || ((h) => (f || (f = hr(t)), f(l, h))),
-    toBytes: (h) => n ? se(h, c) : rn(h, c),
-    fromBytes: (h) => {
-      if (h.length !== c)
-        throw new Error("Field.fromBytes: expected " + c + " bytes, got " + h.length);
-      return n ? ne(h) : ve(h);
-    },
-    // TODO: we don't need it here, move out to separate fn
-    invertBatch: (h) => ns(l, h),
-    // We can't move this out because Fp6, Fp12 implement it
-    // and it's unclear what to return in there.
-    cmov: (h, a, d) => d ? a : h
-  });
-  return Object.freeze(l);
-}
-function ss(t) {
-  if (typeof t != "bigint")
-    throw new Error("field order must be bigint");
-  const e = t.toString(2).length;
-  return Math.ceil(e / 8);
-}
-function rs(t) {
-  const e = ss(t);
-  return e + Math.ceil(e / 2);
-}
-function br(t, e, n = !1) {
-  const s = t.length, r = ss(e), i = rs(e);
-  if (s < 16 || s < i || s > 1024)
-    throw new Error("expected " + i + "-1024 bytes of input, got " + s);
-  const o = n ? ne(t) : ve(t), c = z(o, e - Y) + Y;
-  return n ? se(c, r) : rn(c, r);
-}
-function wr(t, e, n, s) {
-  if (typeof t.setBigUint64 == "function")
-    return t.setBigUint64(e, n, s);
-  const r = BigInt(32), i = BigInt(4294967295), o = Number(n >> r & i), c = Number(n & i), f = s ? 4 : 0, l = s ? 0 : 4;
-  t.setUint32(e + f, o, s), t.setUint32(e + l, c, s);
-}
-function gr(t, e, n) {
-  return t & e ^ ~t & n;
-}
-function yr(t, e, n) {
-  return t & e ^ t & n ^ e & n;
-}
-let os = class extends Yn {
-  constructor(e, n, s, r) {
-    super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = e, this.outputLen = n, this.padOffset = s, this.isLE = r, this.buffer = new Uint8Array(e), this.view = ke(this.buffer);
-  }
-  update(e) {
-    _e(this), e = nn(e), it(e);
-    const { view: n, buffer: s, blockLen: r } = this, i = e.length;
-    for (let o = 0; o < i; ) {
-      const c = Math.min(r - this.pos, i - o);
-      if (c === r) {
-        const f = ke(e);
-        for (; r <= i - o; o += r)
-          this.process(f, o);
-        continue;
-      }
-      s.set(e.subarray(o, o + c), this.pos), this.pos += c, o += c, this.pos === r && (this.process(n, 0), this.pos = 0);
-    }
-    return this.length += e.length, this.roundClean(), this;
-  }
-  digestInto(e) {
-    _e(this), tr(e, this), this.finished = !0;
-    const { buffer: n, view: s, blockLen: r, isLE: i } = this;
-    let { pos: o } = this;
-    n[o++] = 128, ee(this.buffer.subarray(o)), this.padOffset > r - o && (this.process(s, 0), o = 0);
-    for (let a = o; a < r; a++)
-      n[a] = 0;
-    wr(s, r - 8, BigInt(this.length * 8), i), this.process(s, 0);
-    const c = ke(e), f = this.outputLen;
-    if (f % 4)
-      throw new Error("_sha2: outputLen should be aligned to 32bit");
-    const l = f / 4, h = this.get();
-    if (l > h.length)
-      throw new Error("_sha2: outputLen bigger than state");
-    for (let a = 0; a < l; a++)
-      c.setUint32(4 * a, h[a], i);
-  }
-  digest() {
-    const { buffer: e, outputLen: n } = this;
-    this.digestInto(e);
-    const s = e.slice(0, n);
-    return this.destroy(), s;
-  }
-  _cloneInto(e) {
-    e || (e = new this.constructor()), e.set(...this.get());
-    const { blockLen: n, buffer: s, length: r, finished: i, destroyed: o, pos: c } = this;
-    return e.destroyed = o, e.finished = i, e.length = r, e.pos = c, r % n && e.buffer.set(s), e;
-  }
-  clone() {
-    return this._cloneInto();
-  }
-};
-const _t = /* @__PURE__ */ Uint32Array.from([
-  1779033703,
-  3144134277,
-  1013904242,
-  2773480762,
-  1359893119,
-  2600822924,
-  528734635,
-  1541459225
-]);
-const P = /* @__PURE__ */ Uint32Array.from([
-  1779033703,
-  4089235720,
-  3144134277,
-  2227873595,
-  1013904242,
-  4271175723,
-  2773480762,
-  1595750129,
-  1359893119,
-  2917565137,
-  2600822924,
-  725511199,
-  528734635,
-  4215389547,
-  1541459225,
-  327033209
-]), we = /* @__PURE__ */ BigInt(2 ** 32 - 1), wn = /* @__PURE__ */ BigInt(32);
-function pr(t, e = !1) {
-  return e ? { h: Number(t & we), l: Number(t >> wn & we) } : { h: Number(t >> wn & we) | 0, l: Number(t & we) | 0 };
-}
-function mr(t, e = !1) {
-  const n = t.length;
-  let s = new Uint32Array(n), r = new Uint32Array(n);
-  for (let i = 0; i < n; i++) {
-    const { h: o, l: c } = pr(t[i], e);
-    [s[i], r[i]] = [o, c];
-  }
-  return [s, r];
-}
-const gn = (t, e, n) => t >>> n, yn = (t, e, n) => t << 32 - n | e >>> n, Kt = (t, e, n) => t >>> n | e << 32 - n, Yt = (t, e, n) => t << 32 - n | e >>> n, ge = (t, e, n) => t << 64 - n | e >>> n - 32, ye = (t, e, n) => t >>> n - 32 | e << 64 - n;
-function dt(t, e, n, s) {
-  const r = (e >>> 0) + (s >>> 0);
-  return { h: t + n + (r / 2 ** 32 | 0) | 0, l: r | 0 };
-}
-const Br = (t, e, n) => (t >>> 0) + (e >>> 0) + (n >>> 0), Er = (t, e, n, s) => e + n + s + (t / 2 ** 32 | 0) | 0, Ar = (t, e, n, s) => (t >>> 0) + (e >>> 0) + (n >>> 0) + (s >>> 0), _r = (t, e, n, s, r) => e + n + s + r + (t / 2 ** 32 | 0) | 0, Hr = (t, e, n, s, r) => (t >>> 0) + (e >>> 0) + (n >>> 0) + (s >>> 0) + (r >>> 0), Sr = (t, e, n, s, r, i) => e + n + s + r + i + (t / 2 ** 32 | 0) | 0, Ir = /* @__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);
-let vr = class extends os {
-  constructor(e = 32) {
-    super(64, e, 8, !1), this.A = _t[0] | 0, this.B = _t[1] | 0, this.C = _t[2] | 0, this.D = _t[3] | 0, this.E = _t[4] | 0, this.F = _t[5] | 0, this.G = _t[6] | 0, this.H = _t[7] | 0;
-  }
-  get() {
-    const { A: e, B: n, C: s, D: r, E: i, F: o, G: c, H: f } = this;
-    return [e, n, s, r, i, o, c, f];
-  }
-  // prettier-ignore
-  set(e, n, s, r, i, o, c, f) {
-    this.A = e | 0, this.B = n | 0, this.C = s | 0, this.D = r | 0, this.E = i | 0, this.F = o | 0, this.G = c | 0, this.H = f | 0;
-  }
-  process(e, n) {
-    for (let a = 0; a < 16; a++, n += 4)
-      Ht[a] = e.getUint32(n, !1);
-    for (let a = 16; a < 64; a++) {
-      const d = Ht[a - 15], u = Ht[a - 2], y = ft(d, 7) ^ ft(d, 18) ^ d >>> 3, b = ft(u, 17) ^ ft(u, 19) ^ u >>> 10;
-      Ht[a] = b + Ht[a - 7] + y + Ht[a - 16] | 0;
-    }
-    let { A: s, B: r, C: i, D: o, E: c, F: f, G: l, H: h } = this;
-    for (let a = 0; a < 64; a++) {
-      const d = ft(c, 6) ^ ft(c, 11) ^ ft(c, 25), u = h + d + gr(c, f, l) + Ir[a] + Ht[a] | 0, b = (ft(s, 2) ^ ft(s, 13) ^ ft(s, 22)) + yr(s, r, i) | 0;
-      h = l, l = f, f = c, c = o + u | 0, o = i, i = r, r = s, s = u + b | 0;
-    }
-    s = s + this.A | 0, r = r + this.B | 0, i = i + this.C | 0, o = o + this.D | 0, c = c + this.E | 0, f = f + this.F | 0, l = l + this.G | 0, h = h + this.H | 0, this.set(s, r, i, o, c, f, l, h);
-  }
-  roundClean() {
-    ee(Ht);
-  }
-  destroy() {
-    this.set(0, 0, 0, 0, 0, 0, 0, 0), ee(this.buffer);
-  }
-};
-const is = mr([
-  "0x428a2f98d728ae22",
-  "0x7137449123ef65cd",
-  "0xb5c0fbcfec4d3b2f",
-  "0xe9b5dba58189dbbc",
-  "0x3956c25bf348b538",
-  "0x59f111f1b605d019",
-  "0x923f82a4af194f9b",
-  "0xab1c5ed5da6d8118",
-  "0xd807aa98a3030242",
-  "0x12835b0145706fbe",
-  "0x243185be4ee4b28c",
-  "0x550c7dc3d5ffb4e2",
-  "0x72be5d74f27b896f",
-  "0x80deb1fe3b1696b1",
-  "0x9bdc06a725c71235",
-  "0xc19bf174cf692694",
-  "0xe49b69c19ef14ad2",
-  "0xefbe4786384f25e3",
-  "0x0fc19dc68b8cd5b5",
-  "0x240ca1cc77ac9c65",
-  "0x2de92c6f592b0275",
-  "0x4a7484aa6ea6e483",
-  "0x5cb0a9dcbd41fbd4",
-  "0x76f988da831153b5",
-  "0x983e5152ee66dfab",
-  "0xa831c66d2db43210",
-  "0xb00327c898fb213f",
-  "0xbf597fc7beef0ee4",
-  "0xc6e00bf33da88fc2",
-  "0xd5a79147930aa725",
-  "0x06ca6351e003826f",
-  "0x142929670a0e6e70",
-  "0x27b70a8546d22ffc",
-  "0x2e1b21385c26c926",
-  "0x4d2c6dfc5ac42aed",
-  "0x53380d139d95b3df",
-  "0x650a73548baf63de",
-  "0x766a0abb3c77b2a8",
-  "0x81c2c92e47edaee6",
-  "0x92722c851482353b",
-  "0xa2bfe8a14cf10364",
-  "0xa81a664bbc423001",
-  "0xc24b8b70d0f89791",
-  "0xc76c51a30654be30",
-  "0xd192e819d6ef5218",
-  "0xd69906245565a910",
-  "0xf40e35855771202a",
-  "0x106aa07032bbd1b8",
-  "0x19a4c116b8d2d0c8",
-  "0x1e376c085141ab53",
-  "0x2748774cdf8eeb99",
-  "0x34b0bcb5e19b48a8",
-  "0x391c0cb3c5c95a63",
-  "0x4ed8aa4ae3418acb",
-  "0x5b9cca4f7763e373",
-  "0x682e6ff3d6b2b8a3",
-  "0x748f82ee5defb2fc",
-  "0x78a5636f43172f60",
-  "0x84c87814a1f0ab72",
-  "0x8cc702081a6439ec",
-  "0x90befffa23631e28",
-  "0xa4506cebde82bde9",
-  "0xbef9a3f7b2c67915",
-  "0xc67178f2e372532b",
-  "0xca273eceea26619c",
-  "0xd186b8c721c0c207",
-  "0xeada7dd6cde0eb1e",
-  "0xf57d4f7fee6ed178",
-  "0x06f067aa72176fba",
-  "0x0a637dc5a2c898a6",
-  "0x113f9804bef90dae",
-  "0x1b710b35131c471b",
-  "0x28db77f523047d84",
-  "0x32caab7b40c72493",
-  "0x3c9ebe0a15c9bebc",
-  "0x431d67c49c100d4c",
-  "0x4cc5d4becb3e42b6",
-  "0x597f299cfc657e2a",
-  "0x5fcb6fab3ad6faec",
-  "0x6c44198c4a475817"
-].map((t) => BigInt(t))), Lr = is[0], Ur = is[1], St = /* @__PURE__ */ new Uint32Array(80), It = /* @__PURE__ */ new Uint32Array(80);
-let $r = class extends os {
-  constructor(e = 64) {
-    super(128, e, 16, !1), this.Ah = P[0] | 0, this.Al = P[1] | 0, this.Bh = P[2] | 0, this.Bl = P[3] | 0, this.Ch = P[4] | 0, this.Cl = P[5] | 0, this.Dh = P[6] | 0, this.Dl = P[7] | 0, this.Eh = P[8] | 0, this.El = P[9] | 0, this.Fh = P[10] | 0, this.Fl = P[11] | 0, this.Gh = P[12] | 0, this.Gl = P[13] | 0, this.Hh = P[14] | 0, this.Hl = P[15] | 0;
-  }
-  // prettier-ignore
-  get() {
-    const { Ah: e, Al: n, Bh: s, Bl: r, Ch: i, Cl: o, Dh: c, Dl: f, Eh: l, El: h, Fh: a, Fl: d, Gh: u, Gl: y, Hh: b, Hl: w } = this;
-    return [e, n, s, r, i, o, c, f, l, h, a, d, u, y, b, w];
-  }
-  // prettier-ignore
-  set(e, n, s, r, i, o, c, f, l, h, a, d, u, y, b, w) {
-    this.Ah = e | 0, this.Al = n | 0, this.Bh = s | 0, this.Bl = r | 0, this.Ch = i | 0, this.Cl = o | 0, this.Dh = c | 0, this.Dl = f | 0, this.Eh = l | 0, this.El = h | 0, this.Fh = a | 0, this.Fl = d | 0, this.Gh = u | 0, this.Gl = y | 0, this.Hh = b | 0, this.Hl = w | 0;
-  }
-  process(e, n) {
-    for (let p = 0; p < 16; p++, n += 4)
-      St[p] = e.getUint32(n), It[p] = e.getUint32(n += 4);
-    for (let p = 16; p < 80; p++) {
-      const D = St[p - 15] | 0, m = It[p - 15] | 0, U = Kt(D, m, 1) ^ Kt(D, m, 8) ^ gn(D, m, 7), C = Yt(D, m, 1) ^ Yt(D, m, 8) ^ yn(D, m, 7), H = St[p - 2] | 0, x = It[p - 2] | 0, E = Kt(H, x, 19) ^ ge(H, x, 61) ^ gn(H, x, 6), g = Yt(H, x, 19) ^ ye(H, x, 61) ^ yn(H, x, 6), B = Ar(C, g, It[p - 7], It[p - 16]), A = _r(B, U, E, St[p - 7], St[p - 16]);
-      St[p] = A | 0, It[p] = B | 0;
-    }
-    let { Ah: s, Al: r, Bh: i, Bl: o, Ch: c, Cl: f, Dh: l, Dl: h, Eh: a, El: d, Fh: u, Fl: y, Gh: b, Gl: w, Hh: _, Hl: L } = this;
-    for (let p = 0; p < 80; p++) {
-      const D = Kt(a, d, 14) ^ Kt(a, d, 18) ^ ge(a, d, 41), m = Yt(a, d, 14) ^ Yt(a, d, 18) ^ ye(a, d, 41), U = a & u ^ ~a & b, C = d & y ^ ~d & w, H = Hr(L, m, C, Ur[p], It[p]), x = Sr(H, _, D, U, Lr[p], St[p]), E = H | 0, g = Kt(s, r, 28) ^ ge(s, r, 34) ^ ge(s, r, 39), B = Yt(s, r, 28) ^ ye(s, r, 34) ^ ye(s, r, 39), A = s & i ^ s & c ^ i & c, I = r & o ^ r & f ^ o & f;
-      _ = b | 0, L = w | 0, b = u | 0, w = y | 0, u = a | 0, y = d | 0, { h: a, l: d } = dt(l | 0, h | 0, x | 0, E | 0), l = c | 0, h = f | 0, c = i | 0, f = o | 0, i = s | 0, o = r | 0;
-      const S = Br(E, B, I);
-      s = Er(S, x, g, A), r = S | 0;
-    }
-    ({ h: s, l: r } = dt(this.Ah | 0, this.Al | 0, s | 0, r | 0)), { h: i, l: o } = dt(this.Bh | 0, this.Bl | 0, i | 0, o | 0), { h: c, l: f } = dt(this.Ch | 0, this.Cl | 0, c | 0, f | 0), { h: l, l: h } = dt(this.Dh | 0, this.Dl | 0, l | 0, h | 0), { h: a, l: d } = dt(this.Eh | 0, this.El | 0, a | 0, d | 0), { h: u, l: y } = dt(this.Fh | 0, this.Fl | 0, u | 0, y | 0), { h: b, l: w } = dt(this.Gh | 0, this.Gl | 0, b | 0, w | 0), { h: _, l: L } = dt(this.Hh | 0, this.Hl | 0, _ | 0, L | 0), this.set(s, r, i, o, c, f, l, h, a, d, u, y, b, w, _, L);
-  }
-  roundClean() {
-    ee(St, It);
-  }
-  destroy() {
-    ee(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
-  }
-};
-const Dr = /* @__PURE__ */ Xn(() => new vr()), Cr = /* @__PURE__ */ Xn(() => new $r());
-const re = BigInt(0), qt = BigInt(1);
-function he(t, e) {
-  const n = e.negate();
-  return t ? n : e;
-}
-function cs(t, e, n) {
-  const s = e === "pz" ? (o) => o.pz : (o) => o.ez, r = ns(t.Fp, n.map(s));
-  return n.map((o, c) => o.toAffine(r[c])).map(t.fromAffine);
-}
-function fs(t, e) {
-  if (!Number.isSafeInteger(t) || t <= 0 || t > e)
-    throw new Error("invalid window size, expected [1.." + e + "], got W=" + t);
-}
-function Re(t, e) {
-  fs(t, e);
-  const n = Math.ceil(e / t) + 1, s = 2 ** (t - 1), r = 2 ** t, i = Le(t), o = BigInt(t);
-  return { windows: n, windowSize: s, mask: i, maxNumber: r, shiftBy: o };
-}
-function pn(t, e, n) {
-  const { windowSize: s, mask: r, maxNumber: i, shiftBy: o } = n;
-  let c = Number(t & r), f = t >> o;
-  c > s && (c -= i, f += qt);
-  const l = e * s, h = l + Math.abs(c) - 1, a = c === 0, d = c < 0, u = e % 2 !== 0;
-  return { nextN: f, offset: h, isZero: a, isNeg: d, isNegF: u, offsetF: l };
-}
-function kr(t, e) {
-  if (!Array.isArray(t))
-    throw new Error("array expected");
-  t.forEach((n, s) => {
-    if (!(n instanceof e))
-      throw new Error("invalid point at index " + s);
-  });
-}
-function Or(t, e) {
-  if (!Array.isArray(t))
-    throw new Error("array of scalars expected");
-  t.forEach((n, s) => {
-    if (!e.isValid(n))
-      throw new Error("invalid scalar at index " + s);
-  });
-}
-const Te = /* @__PURE__ */ new WeakMap(), as = /* @__PURE__ */ new WeakMap();
-function Ne(t) {
-  return as.get(t) || 1;
-}
-function mn(t) {
-  if (t !== re)
-    throw new Error("invalid wNAF");
-}
-function hs(t, e) {
-  return {
-    constTimeNegate: he,
-    hasPrecomputes(n) {
-      return Ne(n) !== 1;
-    },
-    // non-const time multiplication ladder
-    unsafeLadder(n, s, r = t.ZERO) {
-      let i = n;
-      for (; s > re; )
-        s & qt && (r = r.add(i)), i = i.double(), s >>= qt;
-      return r;
-    },
-    /**
-     * Creates a wNAF precomputation window. Used for caching.
-     * Default window size is set by `utils.precompute()` and is equal to 8.
-     * Number of precomputed points depends on the curve size:
-     * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:
-     * - 𝑊 is the window size
-     * - 𝑛 is the bitlength of the curve order.
-     * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.
-     * @param elm Point instance
-     * @param W window size
-     * @returns precomputed point tables flattened to a single array
-     */
-    precomputeWindow(n, s) {
-      const { windows: r, windowSize: i } = Re(s, e), o = [];
-      let c = n, f = c;
-      for (let l = 0; l < r; l++) {
-        f = c, o.push(f);
-        for (let h = 1; h < i; h++)
-          f = f.add(c), o.push(f);
-        c = f.double();
-      }
-      return o;
-    },
-    /**
-     * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.
-     * @param W window size
-     * @param precomputes precomputed tables
-     * @param n scalar (we don't check here, but should be less than curve order)
-     * @returns real and fake (for const-time) points
-     */
-    wNAF(n, s, r) {
-      let i = t.ZERO, o = t.BASE;
-      const c = Re(n, e);
-      for (let f = 0; f < c.windows; f++) {
-        const { nextN: l, offset: h, isZero: a, isNeg: d, isNegF: u, offsetF: y } = pn(r, f, c);
-        r = l, a ? o = o.add(he(u, s[y])) : i = i.add(he(d, s[h]));
-      }
-      return mn(r), { p: i, f: o };
-    },
-    /**
-     * Implements ec unsafe (non const-time) multiplication using precomputed tables and w-ary non-adjacent form.
-     * @param W window size
-     * @param precomputes precomputed tables
-     * @param n scalar (we don't check here, but should be less than curve order)
-     * @param acc accumulator point to add result of multiplication
-     * @returns point
-     */
-    wNAFUnsafe(n, s, r, i = t.ZERO) {
-      const o = Re(n, e);
-      for (let c = 0; c < o.windows && r !== re; c++) {
-        const { nextN: f, offset: l, isZero: h, isNeg: a } = pn(r, c, o);
-        if (r = f, !h) {
-          const d = s[l];
-          i = i.add(a ? d.negate() : d);
-        }
-      }
-      return mn(r), i;
-    },
-    getPrecomputes(n, s, r) {
-      let i = Te.get(s);
-      return i || (i = this.precomputeWindow(s, n), n !== 1 && (typeof r == "function" && (i = r(i)), Te.set(s, i))), i;
-    },
-    wNAFCached(n, s, r) {
-      const i = Ne(n);
-      return this.wNAF(i, this.getPrecomputes(i, n, r), s);
-    },
-    wNAFCachedUnsafe(n, s, r, i) {
-      const o = Ne(n);
-      return o === 1 ? this.unsafeLadder(n, s, i) : this.wNAFUnsafe(o, this.getPrecomputes(o, n, r), s, i);
-    },
-    // We calculate precomputes for elliptic curve point multiplication
-    // using windowed method. This specifies window size and
-    // stores precomputed values. Usually only base point would be precomputed.
-    setWindowSize(n, s) {
-      fs(s, e), as.set(n, s), Te.delete(n);
-    }
-  };
-}
-function Rr(t, e, n, s) {
-  let r = e, i = t.ZERO, o = t.ZERO;
-  for (; n > re || s > re; )
-    n & qt && (i = i.add(r)), s & qt && (o = o.add(r)), r = r.double(), n >>= qt, s >>= qt;
-  return { p1: i, p2: o };
-}
-function on(t, e, n, s) {
-  kr(n, t), Or(s, e);
-  const r = n.length, i = s.length;
-  if (r !== i)
-    throw new Error("arrays of points and scalars must have equal length");
-  const o = t.ZERO, c = or(BigInt(r));
-  let f = 1;
-  c > 12 ? f = c - 3 : c > 4 ? f = c - 2 : c > 0 && (f = 2);
-  const l = Le(f), h = new Array(Number(l) + 1).fill(o), a = Math.floor((e.BITS - 1) / f) * f;
-  let d = o;
-  for (let u = a; u >= 0; u -= f) {
-    h.fill(o);
-    for (let b = 0; b < i; b++) {
-      const w = s[b], _ = Number(w >> BigInt(u) & l);
-      h[_] = h[_].add(n[b]);
-    }
-    let y = o;
-    for (let b = h.length - 1, w = o; b > 0; b--)
-      w = w.add(h[b]), y = y.add(w);
-    if (d = d.add(y), u !== 0)
-      for (let b = 0; b < f; b++)
-        d = d.double();
-  }
-  return d;
-}
-function Bn(t, e) {
-  if (e) {
-    if (e.ORDER !== t)
-      throw new Error("Field.ORDER must match order: Fp == p, Fn == n");
-    return dr(e), e;
-  } else
-    return Zt(t);
-}
-function ls(t, e, n = {}) {
-  if (!e || typeof e != "object")
-    throw new Error(`expected valid ${t} CURVE object`);
-  for (const c of ["p", "n", "h"]) {
-    const f = e[c];
-    if (!(typeof f == "bigint" && f > re))
-      throw new Error(`CURVE.${c} must be positive bigint`);
-  }
-  const s = Bn(e.p, n.Fp), r = Bn(e.n, n.Fn), o = ["Gx", "Gy", "a", t === "weierstrass" ? "b" : "d"];
-  for (const c of o)
-    if (!s.isValid(e[c]))
-      throw new Error(`CURVE.${c} must be valid field element of CURVE.Fp`);
-  return { Fp: s, Fn: r };
-}
-const ht = BigInt(0), tt = BigInt(1), qe = BigInt(2), Tr = BigInt(8), Nr = { zip215: !0 };
-function qr(t, e, n, s) {
-  const r = t.sqr(n), i = t.sqr(s), o = t.add(t.mul(e.a, r), i), c = t.add(t.ONE, t.mul(e.d, t.mul(r, i)));
-  return t.eql(o, c);
-}
-function Gr(t, e = {}) {
-  const { Fp: n, Fn: s } = ls("edwards", t, e), { h: r, n: i } = t;
-  ue(e, {}, { uvRatio: "function" });
-  const o = qe << BigInt(s.BYTES * 8) - tt, c = (b) => n.create(b), f = e.uvRatio || ((b, w) => {
-    try {
-      return { isValid: !0, value: n.sqrt(n.div(b, w)) };
-    } catch {
-      return { isValid: !1, value: ht };
-    }
-  });
-  if (!qr(n, t, t.Gx, t.Gy))
-    throw new Error("bad curve params: generator point");
-  function l(b, w, _ = !1) {
-    const L = _ ? tt : ht;
-    return Jt("coordinate " + b, w, L, o), w;
-  }
-  function h(b) {
-    if (!(b instanceof u))
-      throw new Error("ExtendedPoint expected");
-  }
-  const a = He((b, w) => {
-    const { ex: _, ey: L, ez: p } = b, D = b.is0();
-    w == null && (w = D ? Tr : n.inv(p));
-    const m = c(_ * w), U = c(L * w), C = c(p * w);
-    if (D)
-      return { x: ht, y: tt };
-    if (C !== tt)
-      throw new Error("invZ was invalid");
-    return { x: m, y: U };
-  }), d = He((b) => {
-    const { a: w, d: _ } = t;
-    if (b.is0())
-      throw new Error("bad point: ZERO");
-    const { ex: L, ey: p, ez: D, et: m } = b, U = c(L * L), C = c(p * p), H = c(D * D), x = c(H * H), E = c(U * w), g = c(H * c(E + C)), B = c(x + c(_ * c(U * C)));
-    if (g !== B)
-      throw new Error("bad point: equation left != right (1)");
-    const A = c(L * p), I = c(D * m);
-    if (A !== I)
-      throw new Error("bad point: equation left != right (2)");
-    return !0;
-  });
-  class u {
-    constructor(w, _, L, p) {
-      this.ex = l("x", w), this.ey = l("y", _), this.ez = l("z", L, !0), this.et = l("t", p), Object.freeze(this);
-    }
-    get x() {
-      return this.toAffine().x;
-    }
-    get y() {
-      return this.toAffine().y;
-    }
-    static fromAffine(w) {
-      if (w instanceof u)
-        throw new Error("extended point not allowed");
-      const { x: _, y: L } = w || {};
-      return l("x", _), l("y", L), new u(_, L, tt, c(_ * L));
-    }
-    static normalizeZ(w) {
-      return cs(u, "ez", w);
-    }
-    // Multiscalar Multiplication
-    static msm(w, _) {
-      return on(u, s, w, _);
-    }
-    // "Private method", don't use it directly
-    _setWindowSize(w) {
-      this.precompute(w);
-    }
-    precompute(w = 8, _ = !0) {
-      return y.setWindowSize(this, w), _ || this.multiply(qe), this;
-    }
-    // Not required for fromHex(), which always creates valid points.
-    // Could be useful for fromAffine().
-    assertValidity() {
-      d(this);
-    }
-    // Compare one point to another.
-    equals(w) {
-      h(w);
-      const { ex: _, ey: L, ez: p } = this, { ex: D, ey: m, ez: U } = w, C = c(_ * U), H = c(D * p), x = c(L * U), E = c(m * p);
-      return C === H && x === E;
-    }
-    is0() {
-      return this.equals(u.ZERO);
-    }
-    negate() {
-      return new u(c(-this.ex), this.ey, this.ez, c(-this.et));
-    }
-    // Fast algo for doubling Extended Point.
-    // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#doubling-dbl-2008-hwcd
-    // Cost: 4M + 4S + 1*a + 6add + 1*2.
-    double() {
-      const { a: w } = t, { ex: _, ey: L, ez: p } = this, D = c(_ * _), m = c(L * L), U = c(qe * c(p * p)), C = c(w * D), H = _ + L, x = c(c(H * H) - D - m), E = C + m, g = E - U, B = C - m, A = c(x * g), I = c(E * B), S = c(x * B), $ = c(g * E);
-      return new u(A, I, $, S);
-    }
-    // Fast algo for adding 2 Extended Points.
-    // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#addition-add-2008-hwcd
-    // Cost: 9M + 1*a + 1*d + 7add.
-    add(w) {
-      h(w);
-      const { a: _, d: L } = t, { ex: p, ey: D, ez: m, et: U } = this, { ex: C, ey: H, ez: x, et: E } = w, g = c(p * C), B = c(D * H), A = c(U * L * E), I = c(m * x), S = c((p + D) * (C + H) - g - B), $ = I - A, O = I + A, k = c(B - _ * g), q = c(S * $), T = c(O * k), R = c(S * k), M = c($ * O);
-      return new u(q, T, M, R);
-    }
-    subtract(w) {
-      return this.add(w.negate());
-    }
-    // Constant-time multiplication.
-    multiply(w) {
-      const _ = w;
-      Jt("scalar", _, tt, i);
-      const { p: L, f: p } = y.wNAFCached(this, _, u.normalizeZ);
-      return u.normalizeZ([L, p])[0];
-    }
-    // Non-constant-time multiplication. Uses double-and-add algorithm.
-    // It's faster, but should only be used when you don't care about
-    // an exposed private key e.g. sig verification.
-    // Does NOT allow scalars higher than CURVE.n.
-    // Accepts optional accumulator to merge with multiply (important for sparse scalars)
-    multiplyUnsafe(w, _ = u.ZERO) {
-      const L = w;
-      return Jt("scalar", L, ht, i), L === ht ? u.ZERO : this.is0() || L === tt ? this : y.wNAFCachedUnsafe(this, L, u.normalizeZ, _);
-    }
-    // Checks if point is of small order.
-    // If you add something to small order point, you will have "dirty"
-    // point with torsion component.
-    // Multiplies point by cofactor and checks if the result is 0.
-    isSmallOrder() {
-      return this.multiplyUnsafe(r).is0();
-    }
-    // Multiplies point by curve order and checks if the result is 0.
-    // Returns `false` is the point is dirty.
-    isTorsionFree() {
-      return y.wNAFCachedUnsafe(this, i).is0();
-    }
-    // Converts Extended point to default (x, y) coordinates.
-    // Can accept precomputed Z^-1 - for example, from invertBatch.
-    toAffine(w) {
-      return a(this, w);
-    }
-    clearCofactor() {
-      return r === tt ? this : this.multiplyUnsafe(r);
-    }
-    static fromBytes(w, _ = !1) {
-      return it(w), this.fromHex(w, _);
-    }
-    // Converts hash string or Uint8Array to Point.
-    // Uses algo from RFC8032 5.1.3.
-    static fromHex(w, _ = !1) {
-      const { d: L, a: p } = t, D = n.BYTES;
-      w = V("pointHex", w, D), Vt("zip215", _);
-      const m = w.slice(), U = w[D - 1];
-      m[D - 1] = U & -129;
-      const C = ne(m), H = _ ? o : n.ORDER;
-      Jt("pointHex.y", C, ht, H);
-      const x = c(C * C), E = c(x - tt), g = c(L * x - p);
-      let { isValid: B, value: A } = f(E, g);
-      if (!B)
-        throw new Error("Point.fromHex: invalid y coordinate");
-      const I = (A & tt) === tt, S = (U & 128) !== 0;
-      if (!_ && A === ht && S)
-        throw new Error("Point.fromHex: x=0 and x_0=1");
-      return S !== I && (A = c(-A)), u.fromAffine({ x: A, y: C });
-    }
-    static fromPrivateScalar(w) {
-      return u.BASE.multiply(w);
-    }
-    toBytes() {
-      const { x: w, y: _ } = this.toAffine(), L = se(_, n.BYTES);
-      return L[L.length - 1] |= w & tt ? 128 : 0, L;
-    }
-    /** @deprecated use `toBytes` */
-    toRawBytes() {
-      return this.toBytes();
-    }
-    toHex() {
-      return Mt(this.toBytes());
-    }
-    toString() {
-      return `<Point ${this.is0() ? "ZERO" : this.toHex()}>`;
-    }
-  }
-  u.BASE = new u(t.Gx, t.Gy, tt, c(t.Gx * t.Gy)), u.ZERO = new u(ht, tt, tt, ht), u.Fp = n, u.Fn = s;
-  const y = hs(u, s.BYTES * 8);
-  return u;
-}
-function Mr(t, e) {
-  ue(e, {
-    hash: "function"
-  }, {
-    adjustScalarBytes: "function",
-    randomBytes: "function",
-    domain: "function",
-    prehash: "function",
-    mapToCurve: "function"
-  });
-  const { prehash: n, hash: s } = e, { BASE: r, Fp: i, Fn: o } = t, c = o.ORDER, f = e.randomBytes || Fn, l = e.adjustScalarBytes || ((m) => m), h = e.domain || ((m, U, C) => {
-    if (Vt("phflag", C), U.length || C)
-      throw new Error("Contexts/pre-hash are not supported");
-    return m;
-  });
-  function a(m) {
-    return o.create(m);
-  }
-  function d(m) {
-    return a(ne(m));
-  }
-  function u(m) {
-    const U = i.BYTES;
-    m = V("private key", m, U);
-    const C = V("hashed private key", s(m), 2 * U), H = l(C.slice(0, U)), x = C.slice(U, 2 * U), E = d(H);
-    return { head: H, prefix: x, scalar: E };
-  }
-  function y(m) {
-    const { head: U, prefix: C, scalar: H } = u(m), x = r.multiply(H), E = x.toBytes();
-    return { head: U, prefix: C, scalar: H, point: x, pointBytes: E };
-  }
-  function b(m) {
-    return y(m).pointBytes;
-  }
-  function w(m = Uint8Array.of(), ...U) {
-    const C = wt(...U);
-    return d(s(h(C, V("context", m), !!n)));
-  }
-  function _(m, U, C = {}) {
-    m = V("message", m), n && (m = n(m));
-    const { prefix: H, scalar: x, pointBytes: E } = y(U), g = w(C.context, H, m), B = r.multiply(g).toBytes(), A = w(C.context, B, E, m), I = a(g + A * x);
-    Jt("signature.s", I, ht, c);
-    const S = i.BYTES, $ = wt(B, se(I, S));
-    return V("result", $, S * 2);
-  }
-  const L = Nr;
-  function p(m, U, C, H = L) {
-    const { context: x, zip215: E } = H, g = i.BYTES;
-    m = V("signature", m, 2 * g), U = V("message", U), C = V("publicKey", C, g), E !== void 0 && Vt("zip215", E), n && (U = n(U));
-    const B = ne(m.slice(g, 2 * g));
-    let A, I, S;
-    try {
-      A = t.fromHex(C, E), I = t.fromHex(m.slice(0, g), E), S = r.multiplyUnsafe(B);
-    } catch {
-      return !1;
-    }
-    if (!E && A.isSmallOrder())
-      return !1;
-    const $ = w(x, I.toBytes(), A.toBytes(), U);
-    return I.add(A.multiplyUnsafe($)).subtract(S).clearCofactor().is0();
-  }
-  return r.precompute(8), { getPublicKey: b, sign: _, verify: p, utils: {
-    getExtendedPublicKey: y,
-    /** ed25519 priv keys are uniform 32b. No need to check for modulo bias, like in secp256k1. */
-    randomPrivateKey: () => f(i.BYTES),
-    /**
-     * We're doing scalar multiplication (used in getPublicKey etc) with precomputed BASE_POINT
-     * values. This slows down first getPublicKey() by milliseconds (see Speed section),
-     * but allows to speed-up subsequent getPublicKey() calls up to 20x.
-     * @param windowSize 2, 4, 8, 16
-     */
-    precompute(m = 8, U = t.BASE) {
-      return U.precompute(m, !1);
-    }
-  }, Point: t };
-}
-function Vr(t) {
-  const e = {
-    a: t.a,
-    d: t.d,
-    p: t.Fp.ORDER,
-    n: t.n,
-    h: t.h,
-    Gx: t.Gx,
-    Gy: t.Gy
-  }, n = t.Fp, s = Zt(e.n, t.nBitLength, !0), r = { Fp: n, Fn: s, uvRatio: t.uvRatio }, i = {
-    hash: t.hash,
-    randomBytes: t.randomBytes,
-    adjustScalarBytes: t.adjustScalarBytes,
-    domain: t.domain,
-    prehash: t.prehash,
-    mapToCurve: t.mapToCurve
-  };
-  return { CURVE: e, curveOpts: r, eddsaOpts: i };
-}
-function Zr(t, e) {
-  return Object.assign({}, e, { ExtendedPoint: e.Point, CURVE: t });
-}
-function zr(t) {
-  const { CURVE: e, curveOpts: n, eddsaOpts: s } = Vr(t), r = Gr(e, n), i = Mr(r, s);
-  return Zr(t, i);
-}
-const ui = BigInt(0), xi = BigInt(1), bi = BigInt(2);
-const jr = BigInt(0), gt = BigInt(1), En = BigInt(2), wi = BigInt(3), Wr = BigInt(5), Kr = BigInt(8), Ue = {
-  p: BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffed"),
-  n: BigInt("0x1000000000000000000000000000000014def9dea2f79cd65812631a5cf5d3ed"),
-  h: Kr,
-  a: BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffec"),
-  d: BigInt("0x52036cee2b6ffe738cc740797779e89800700a4d4141d8ab75eb4dca135978a3"),
-  Gx: BigInt("0x216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a"),
-  Gy: BigInt("0x6666666666666666666666666666666666666666666666666666666666666658")
-};
-function Yr(t) {
-  const e = BigInt(10), n = BigInt(20), s = BigInt(40), r = BigInt(80), i = Ue.p, c = t * t % i * t % i, f = Z(c, En, i) * c % i, l = Z(f, gt, i) * t % i, h = Z(l, Wr, i) * l % i, a = Z(h, e, i) * h % i, d = Z(a, n, i) * a % i, u = Z(d, s, i) * d % i, y = Z(u, r, i) * u % i, b = Z(y, r, i) * u % i, w = Z(b, e, i) * h % i;
-  return { pow_p_5_8: Z(w, En, i) * t % i, b2: c };
-}
-function Xr(t) {
-  return t[0] &= 248, t[31] &= 127, t[31] |= 64, t;
-}
-const We = /* @__PURE__ */ BigInt("19681161376707505956807079304988542015446066515923890162744021073123829784752");
-function cn(t, e) {
-  const n = Ue.p, s = z(e * e * e, n), r = z(s * s * e, n), i = Yr(t * r).pow_p_5_8;
-  let o = z(t * s * i, n);
-  const c = z(e * o * o, n), f = o, l = z(o * We, n), h = c === t, a = c === z(-t, n), d = c === z(-t * We, n);
-  return h && (o = f), (a || d) && (o = l), Ot(o, n) && (o = z(-o, n)), { isValid: h || a, value: o };
-}
-const Qt = Zt(Ue.p, void 0, !0), Fr = {
-  ...Ue,
-  Fp: Qt,
-  hash: Cr,
-  adjustScalarBytes: Xr,
-  // dom2
-  // Ratio of u to v. Allows us to combine inversion and square root. Uses algo from RFC8032 5.1.3.
-  // Constant-time, u/√v
-  uvRatio: cn
-}, st = zr(Fr);
-function Ge(t) {
-  if (!(t instanceof W))
-    throw new Error("RistrettoPoint expected");
-}
-const Ke = We, Pr = /* @__PURE__ */ BigInt("25063068953384623474111414158702152701244531502492656460079210482610430750235"), Qr = /* @__PURE__ */ BigInt("54469307008909316920995813868745141605393597292927456921205312896311721017578"), Jr = /* @__PURE__ */ BigInt("1159843021668779879193775521855586647937357759715417654439879720876111806838"), to = /* @__PURE__ */ BigInt("40440834346308536858101042469323190826248399146238708352240133220865137265952"), An = (t) => cn(gt, t), eo = /* @__PURE__ */ BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff"), Me = (t) => st.CURVE.Fp.create(ne(t) & eo);
-function _n(t) {
-  const { d: e } = st.CURVE, n = st.CURVE.Fp.ORDER, s = st.CURVE.Fp.create, r = s(Ke * t * t), i = s((r + gt) * Jr);
-  let o = BigInt(-1);
-  const c = s((o - e * r) * s(r + e));
-  let { isValid: f, value: l } = cn(i, c), h = s(l * t);
-  Ot(h, n) || (h = s(-h)), f || (l = h), f || (o = r);
-  const a = s(o * (r - gt) * to - c), d = l * l, u = s((l + l) * c), y = s(a * Pr), b = s(gt - d), w = s(gt + d);
-  return new st.Point(s(u * w), s(b * y), s(y * w), s(u * b));
-}
-class W {
-  // Private property to discourage combining ExtendedPoint + RistrettoPoint
-  // Always use Ristretto encoding/decoding instead.
-  constructor(e) {
-    this.ep = e;
-  }
-  static fromAffine(e) {
-    return new W(st.Point.fromAffine(e));
-  }
-  /**
-   * Takes uniform output of 64-byte hash function like sha512 and converts it to `RistrettoPoint`.
-   * The hash-to-group operation applies Elligator twice and adds the results.
-   * **Note:** this is one-way map, there is no conversion from point to hash.
-   * Described in [RFC9380](https://www.rfc-editor.org/rfc/rfc9380#appendix-B) and on
-   * the [website](https://ristretto.group/formulas/elligator.html).
-   * @param hex 64-byte output of a hash function
-   */
-  static hashToCurve(e) {
-    e = V("ristrettoHash", e, 64);
-    const n = Me(e.slice(0, 32)), s = _n(n), r = Me(e.slice(32, 64)), i = _n(r);
-    return new W(s.add(i));
-  }
-  static fromBytes(e) {
-    return it(e), this.fromHex(e);
-  }
-  /**
-   * Converts ristretto-encoded string to ristretto point.
-   * Described in [RFC9496](https://www.rfc-editor.org/rfc/rfc9496#name-decode).
-   * @param hex Ristretto-encoded 32 bytes. Not every 32-byte string is valid ristretto encoding
-   */
-  static fromHex(e) {
-    e = V("ristrettoHex", e, 32);
-    const { a: n, d: s } = st.CURVE, r = Qt.ORDER, i = Qt.create, o = "RistrettoPoint.fromHex: the hex is not valid encoding of RistrettoPoint", c = Me(e);
-    if (!sr(se(c, 32), e) || Ot(c, r))
-      throw new Error(o);
-    const f = i(c * c), l = i(gt + n * f), h = i(gt - n * f), a = i(l * l), d = i(h * h), u = i(n * s * a - d), { isValid: y, value: b } = An(i(u * d)), w = i(b * h), _ = i(b * w * u);
-    let L = i((c + c) * w);
-    Ot(L, r) && (L = i(-L));
-    const p = i(l * _), D = i(L * p);
-    if (!y || Ot(D, r) || p === jr)
-      throw new Error(o);
-    return new W(new st.Point(L, p, gt, D));
-  }
-  static msm(e, n) {
-    const s = Zt(st.CURVE.n, st.CURVE.nBitLength);
-    return on(W, s, e, n);
-  }
-  /**
-   * Encodes ristretto point to Uint8Array.
-   * Described in [RFC9496](https://www.rfc-editor.org/rfc/rfc9496#name-encode).
-   */
-  toBytes() {
-    let { ex: e, ey: n, ez: s, et: r } = this.ep;
-    const i = Qt.ORDER, o = Qt.create, c = o(o(s + n) * o(s - n)), f = o(e * n), l = o(f * f), { value: h } = An(o(c * l)), a = o(h * c), d = o(h * f), u = o(a * d * r);
-    let y;
-    if (Ot(r * u, i)) {
-      let w = o(n * Ke), _ = o(e * Ke);
-      e = w, n = _, y = o(a * Qr);
-    } else
-      y = d;
-    Ot(e * u, i) && (n = o(-n));
-    let b = o((s - n) * y);
-    return Ot(b, i) && (b = o(-b)), se(b, 32);
-  }
-  /** @deprecated use `toBytes` */
-  toRawBytes() {
-    return this.toBytes();
-  }
-  toHex() {
-    return Mt(this.toBytes());
-  }
-  toString() {
-    return this.toHex();
-  }
-  /**
-   * Compares two Ristretto points.
-   * Described in [RFC9496](https://www.rfc-editor.org/rfc/rfc9496#name-equals).
-   */
-  equals(e) {
-    Ge(e);
-    const { ex: n, ey: s } = this.ep, { ex: r, ey: i } = e.ep, o = Qt.create, c = o(n * i) === o(s * r), f = o(s * i) === o(n * r);
-    return c || f;
-  }
-  add(e) {
-    return Ge(e), new W(this.ep.add(e.ep));
-  }
-  subtract(e) {
-    return Ge(e), new W(this.ep.subtract(e.ep));
-  }
-  multiply(e) {
-    return new W(this.ep.multiply(e));
-  }
-  multiplyUnsafe(e) {
-    return new W(this.ep.multiplyUnsafe(e));
-  }
-  double() {
-    return new W(this.ep.double());
-  }
-  negate() {
-    return new W(this.ep.negate());
-  }
-}
-const gi = (W.BASE || (W.BASE = new W(st.Point.BASE)), W.ZERO || (W.ZERO = new W(st.Point.ZERO)), W), pe = /* @__PURE__ */ BigInt(2 ** 32 - 1), Hn = /* @__PURE__ */ BigInt(32);
-function no(t, e = !1) {
-  return e ? { h: Number(t & pe), l: Number(t >> Hn & pe) } : { h: Number(t >> Hn & pe) | 0, l: Number(t & pe) | 0 };
-}
-function ds(t, e = !1) {
-  const n = t.length;
-  let s = new Uint32Array(n), r = new Uint32Array(n);
-  for (let i = 0; i < n; i++) {
-    const { h: o, l: c } = no(t[i], e);
-    [s[i], r[i]] = [o, c];
-  }
-  return [s, r];
-}
-const Sn = (t, e, n) => t >>> n, In = (t, e, n) => t << 32 - n | e >>> n, Xt = (t, e, n) => t >>> n | e << 32 - n, Ft = (t, e, n) => t << 32 - n | e >>> n, me = (t, e, n) => t << 64 - n | e >>> n - 32, Be = (t, e, n) => t >>> n - 32 | e << 64 - n, so = (t, e, n) => t << n | e >>> 32 - n, ro = (t, e, n) => e << n | t >>> 32 - n, oo = (t, e, n) => e << n - 32 | t >>> 64 - n, io = (t, e, n) => t << n - 32 | e >>> 64 - n;
-function ut(t, e, n, s) {
-  const r = (e >>> 0) + (s >>> 0);
-  return { h: t + n + (r / 2 ** 32 | 0) | 0, l: r | 0 };
-}
-const co = (t, e, n) => (t >>> 0) + (e >>> 0) + (n >>> 0), fo = (t, e, n, s) => e + n + s + (t / 2 ** 32 | 0) | 0, ao = (t, e, n, s) => (t >>> 0) + (e >>> 0) + (n >>> 0) + (s >>> 0), ho = (t, e, n, s, r) => e + n + s + r + (t / 2 ** 32 | 0) | 0, lo = (t, e, n, s, r) => (t >>> 0) + (e >>> 0) + (n >>> 0) + (s >>> 0) + (r >>> 0), uo = (t, e, n, s, r, i) => e + n + s + r + i + (t / 2 ** 32 | 0) | 0, Pt = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
-function xo(t) {
-  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
-}
-function $e(t, ...e) {
-  if (!xo(t))
-    throw new Error("Uint8Array expected");
-  if (e.length > 0 && !e.includes(t.length))
-    throw new Error("Uint8Array expected of length " + e + ", got length=" + t.length);
-}
-function vn(t, e = !0) {
-  if (t.destroyed)
-    throw new Error("Hash instance has been destroyed");
-  if (e && t.finished)
-    throw new Error("Hash#digest() has already been called");
-}
-function bo(t, e) {
-  $e(t);
-  const n = e.outputLen;
-  if (t.length < n)
-    throw new Error("digestInto() expects output buffer of length at least " + n);
-}
-function yi(t) {
-  return new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4));
-}
-function Se(...t) {
-  for (let e = 0; e < t.length; e++)
-    t[e].fill(0);
-}
-function Ve(t) {
-  return new DataView(t.buffer, t.byteOffset, t.byteLength);
-}
-function wo(t) {
-  if (typeof t != "string")
-    throw new Error("string expected");
-  return new Uint8Array(new TextEncoder().encode(t));
-}
-function us(t) {
-  return typeof t == "string" && (t = wo(t)), $e(t), t;
-}
-function pi(...t) {
-  let e = 0;
-  for (let s = 0; s < t.length; s++) {
-    const r = t[s];
-    $e(r), e += r.length;
-  }
-  const n = new Uint8Array(e);
-  for (let s = 0, r = 0; s < t.length; s++) {
-    const i = t[s];
-    n.set(i, r), r += i.length;
-  }
-  return n;
-}
-let go = class {
-};
-function yo(t) {
-  const e = (s) => t().update(us(s)).digest(), n = t();
-  return e.outputLen = n.outputLen, e.blockLen = n.blockLen, e.create = () => t(), e;
-}
-function Bi(t = 32) {
-  if (Pt && typeof Pt.getRandomValues == "function")
-    return Pt.getRandomValues(new Uint8Array(t));
-  if (Pt && typeof Pt.randomBytes == "function")
-    return Uint8Array.from(Pt.randomBytes(t));
-  throw new Error("crypto.getRandomValues must be defined");
-}
-const po = BigInt(0), ce = BigInt(1), mo = BigInt(2), Bo = BigInt(7), Eo = BigInt(256), Ao = BigInt(113), xs = [], bs = [], ws = [];
-for (let t = 0, e = ce, n = 1, s = 0; t < 24; t++) {
-  [n, s] = [s, (2 * n + 3 * s) % 5], xs.push(2 * (5 * s + n)), bs.push((t + 1) * (t + 2) / 2 % 64);
-  let r = po;
-  for (let i = 0; i < 7; i++)
-    e = (e << ce ^ (e >> Bo) * Ao) % Eo, e & mo && (r ^= ce << (ce << /* @__PURE__ */ BigInt(i)) - ce);
-  ws.push(r);
-}
-const gs = ds(ws, !0), _o = gs[0], Ho = gs[1], Ln = (t, e, n) => n > 32 ? oo(t, e, n) : so(t, e, n), Un = (t, e, n) => n > 32 ? io(t, e, n) : ro(t, e, n);
-function Ei(t, e = 24) {
-  const n = new Uint32Array(10);
-  for (let s = 24 - e; s < 24; s++) {
-    for (let o = 0; o < 10; o++)
-      n[o] = t[o] ^ t[o + 10] ^ t[o + 20] ^ t[o + 30] ^ t[o + 40];
-    for (let o = 0; o < 10; o += 2) {
-      const c = (o + 8) % 10, f = (o + 2) % 10, l = n[f], h = n[f + 1], a = Ln(l, h, 1) ^ n[c], d = Un(l, h, 1) ^ n[c + 1];
-      for (let u = 0; u < 50; u += 10)
-        t[o + u] ^= a, t[o + u + 1] ^= d;
-    }
-    let r = t[2], i = t[3];
-    for (let o = 0; o < 24; o++) {
-      const c = bs[o], f = Ln(r, i, c), l = Un(r, i, c), h = xs[o];
-      r = t[h], i = t[h + 1], t[h] = f, t[h + 1] = l;
-    }
-    for (let o = 0; o < 50; o += 10) {
-      for (let c = 0; c < 10; c++)
-        n[c] = t[o + c];
-      for (let c = 0; c < 10; c++)
-        t[o + c] ^= ~n[(c + 2) % 10] & n[(c + 4) % 10];
-    }
-    t[0] ^= _o[s], t[1] ^= Ho[s];
-  }
-  Se(n);
-}
-function So(t, e, n, s) {
-  if (typeof t.setBigUint64 == "function")
-    return t.setBigUint64(e, n, s);
-  const r = BigInt(32), i = BigInt(4294967295), o = Number(n >> r & i), c = Number(n & i), f = s ? 4 : 0, l = s ? 0 : 4;
-  t.setUint32(e + f, o, s), t.setUint32(e + l, c, s);
-}
-let Io = class extends go {
-  constructor(e, n, s, r) {
-    super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = e, this.outputLen = n, this.padOffset = s, this.isLE = r, this.buffer = new Uint8Array(e), this.view = Ve(this.buffer);
-  }
-  update(e) {
-    vn(this), e = us(e), $e(e);
-    const { view: n, buffer: s, blockLen: r } = this, i = e.length;
-    for (let o = 0; o < i; ) {
-      const c = Math.min(r - this.pos, i - o);
-      if (c === r) {
-        const f = Ve(e);
-        for (; r <= i - o; o += r)
-          this.process(f, o);
-        continue;
-      }
-      s.set(e.subarray(o, o + c), this.pos), this.pos += c, o += c, this.pos === r && (this.process(n, 0), this.pos = 0);
-    }
-    return this.length += e.length, this.roundClean(), this;
-  }
-  digestInto(e) {
-    vn(this), bo(e, this), this.finished = !0;
-    const { buffer: n, view: s, blockLen: r, isLE: i } = this;
-    let { pos: o } = this;
-    n[o++] = 128, Se(this.buffer.subarray(o)), this.padOffset > r - o && (this.process(s, 0), o = 0);
-    for (let a = o; a < r; a++)
-      n[a] = 0;
-    So(s, r - 8, BigInt(this.length * 8), i), this.process(s, 0);
-    const c = Ve(e), f = this.outputLen;
-    if (f % 4)
-      throw new Error("_sha2: outputLen should be aligned to 32bit");
-    const l = f / 4, h = this.get();
-    if (l > h.length)
-      throw new Error("_sha2: outputLen bigger than state");
-    for (let a = 0; a < l; a++)
-      c.setUint32(4 * a, h[a], i);
-  }
-  digest() {
-    const { buffer: e, outputLen: n } = this;
-    this.digestInto(e);
-    const s = e.slice(0, n);
-    return this.destroy(), s;
-  }
-  _cloneInto(e) {
-    e || (e = new this.constructor()), e.set(...this.get());
-    const { blockLen: n, buffer: s, length: r, finished: i, destroyed: o, pos: c } = this;
-    return e.destroyed = o, e.finished = i, e.length = r, e.pos = c, r % n && e.buffer.set(s), e;
-  }
-  clone() {
-    return this._cloneInto();
-  }
-};
-const Q = /* @__PURE__ */ Uint32Array.from([
-  1779033703,
-  4089235720,
-  3144134277,
-  2227873595,
-  1013904242,
-  4271175723,
-  2773480762,
-  1595750129,
-  1359893119,
-  2917565137,
-  2600822924,
-  725511199,
-  528734635,
-  4215389547,
-  1541459225,
-  327033209
-]);
-const ys = ds([
-  "0x428a2f98d728ae22",
-  "0x7137449123ef65cd",
-  "0xb5c0fbcfec4d3b2f",
-  "0xe9b5dba58189dbbc",
-  "0x3956c25bf348b538",
-  "0x59f111f1b605d019",
-  "0x923f82a4af194f9b",
-  "0xab1c5ed5da6d8118",
-  "0xd807aa98a3030242",
-  "0x12835b0145706fbe",
-  "0x243185be4ee4b28c",
-  "0x550c7dc3d5ffb4e2",
-  "0x72be5d74f27b896f",
-  "0x80deb1fe3b1696b1",
-  "0x9bdc06a725c71235",
-  "0xc19bf174cf692694",
-  "0xe49b69c19ef14ad2",
-  "0xefbe4786384f25e3",
-  "0x0fc19dc68b8cd5b5",
-  "0x240ca1cc77ac9c65",
-  "0x2de92c6f592b0275",
-  "0x4a7484aa6ea6e483",
-  "0x5cb0a9dcbd41fbd4",
-  "0x76f988da831153b5",
-  "0x983e5152ee66dfab",
-  "0xa831c66d2db43210",
-  "0xb00327c898fb213f",
-  "0xbf597fc7beef0ee4",
-  "0xc6e00bf33da88fc2",
-  "0xd5a79147930aa725",
-  "0x06ca6351e003826f",
-  "0x142929670a0e6e70",
-  "0x27b70a8546d22ffc",
-  "0x2e1b21385c26c926",
-  "0x4d2c6dfc5ac42aed",
-  "0x53380d139d95b3df",
-  "0x650a73548baf63de",
-  "0x766a0abb3c77b2a8",
-  "0x81c2c92e47edaee6",
-  "0x92722c851482353b",
-  "0xa2bfe8a14cf10364",
-  "0xa81a664bbc423001",
-  "0xc24b8b70d0f89791",
-  "0xc76c51a30654be30",
-  "0xd192e819d6ef5218",
-  "0xd69906245565a910",
-  "0xf40e35855771202a",
-  "0x106aa07032bbd1b8",
-  "0x19a4c116b8d2d0c8",
-  "0x1e376c085141ab53",
-  "0x2748774cdf8eeb99",
-  "0x34b0bcb5e19b48a8",
-  "0x391c0cb3c5c95a63",
-  "0x4ed8aa4ae3418acb",
-  "0x5b9cca4f7763e373",
-  "0x682e6ff3d6b2b8a3",
-  "0x748f82ee5defb2fc",
-  "0x78a5636f43172f60",
-  "0x84c87814a1f0ab72",
-  "0x8cc702081a6439ec",
-  "0x90befffa23631e28",
-  "0xa4506cebde82bde9",
-  "0xbef9a3f7b2c67915",
-  "0xc67178f2e372532b",
-  "0xca273eceea26619c",
-  "0xd186b8c721c0c207",
-  "0xeada7dd6cde0eb1e",
-  "0xf57d4f7fee6ed178",
-  "0x06f067aa72176fba",
-  "0x0a637dc5a2c898a6",
-  "0x113f9804bef90dae",
-  "0x1b710b35131c471b",
-  "0x28db77f523047d84",
-  "0x32caab7b40c72493",
-  "0x3c9ebe0a15c9bebc",
-  "0x431d67c49c100d4c",
-  "0x4cc5d4becb3e42b6",
-  "0x597f299cfc657e2a",
-  "0x5fcb6fab3ad6faec",
-  "0x6c44198c4a475817"
-].map((t) => BigInt(t))), vo = ys[0], Lo = ys[1], vt = /* @__PURE__ */ new Uint32Array(80), Lt = /* @__PURE__ */ new Uint32Array(80);
-class Uo extends Io {
-  constructor(e = 64) {
-    super(128, e, 16, !1), this.Ah = Q[0] | 0, this.Al = Q[1] | 0, this.Bh = Q[2] | 0, this.Bl = Q[3] | 0, this.Ch = Q[4] | 0, this.Cl = Q[5] | 0, this.Dh = Q[6] | 0, this.Dl = Q[7] | 0, this.Eh = Q[8] | 0, this.El = Q[9] | 0, this.Fh = Q[10] | 0, this.Fl = Q[11] | 0, this.Gh = Q[12] | 0, this.Gl = Q[13] | 0, this.Hh = Q[14] | 0, this.Hl = Q[15] | 0;
-  }
-  // prettier-ignore
-  get() {
-    const { Ah: e, Al: n, Bh: s, Bl: r, Ch: i, Cl: o, Dh: c, Dl: f, Eh: l, El: h, Fh: a, Fl: d, Gh: u, Gl: y, Hh: b, Hl: w } = this;
-    return [e, n, s, r, i, o, c, f, l, h, a, d, u, y, b, w];
-  }
-  // prettier-ignore
-  set(e, n, s, r, i, o, c, f, l, h, a, d, u, y, b, w) {
-    this.Ah = e | 0, this.Al = n | 0, this.Bh = s | 0, this.Bl = r | 0, this.Ch = i | 0, this.Cl = o | 0, this.Dh = c | 0, this.Dl = f | 0, this.Eh = l | 0, this.El = h | 0, this.Fh = a | 0, this.Fl = d | 0, this.Gh = u | 0, this.Gl = y | 0, this.Hh = b | 0, this.Hl = w | 0;
-  }
-  process(e, n) {
-    for (let p = 0; p < 16; p++, n += 4)
-      vt[p] = e.getUint32(n), Lt[p] = e.getUint32(n += 4);
-    for (let p = 16; p < 80; p++) {
-      const D = vt[p - 15] | 0, m = Lt[p - 15] | 0, U = Xt(D, m, 1) ^ Xt(D, m, 8) ^ Sn(D, m, 7), C = Ft(D, m, 1) ^ Ft(D, m, 8) ^ In(D, m, 7), H = vt[p - 2] | 0, x = Lt[p - 2] | 0, E = Xt(H, x, 19) ^ me(H, x, 61) ^ Sn(H, x, 6), g = Ft(H, x, 19) ^ Be(H, x, 61) ^ In(H, x, 6), B = ao(C, g, Lt[p - 7], Lt[p - 16]), A = ho(B, U, E, vt[p - 7], vt[p - 16]);
-      vt[p] = A | 0, Lt[p] = B | 0;
-    }
-    let { Ah: s, Al: r, Bh: i, Bl: o, Ch: c, Cl: f, Dh: l, Dl: h, Eh: a, El: d, Fh: u, Fl: y, Gh: b, Gl: w, Hh: _, Hl: L } = this;
-    for (let p = 0; p < 80; p++) {
-      const D = Xt(a, d, 14) ^ Xt(a, d, 18) ^ me(a, d, 41), m = Ft(a, d, 14) ^ Ft(a, d, 18) ^ Be(a, d, 41), U = a & u ^ ~a & b, C = d & y ^ ~d & w, H = lo(L, m, C, Lo[p], Lt[p]), x = uo(H, _, D, U, vo[p], vt[p]), E = H | 0, g = Xt(s, r, 28) ^ me(s, r, 34) ^ me(s, r, 39), B = Ft(s, r, 28) ^ Be(s, r, 34) ^ Be(s, r, 39), A = s & i ^ s & c ^ i & c, I = r & o ^ r & f ^ o & f;
-      _ = b | 0, L = w | 0, b = u | 0, w = y | 0, u = a | 0, y = d | 0, { h: a, l: d } = ut(l | 0, h | 0, x | 0, E | 0), l = c | 0, h = f | 0, c = i | 0, f = o | 0, i = s | 0, o = r | 0;
-      const S = co(E, B, I);
-      s = fo(S, x, g, A), r = S | 0;
-    }
-    ({ h: s, l: r } = ut(this.Ah | 0, this.Al | 0, s | 0, r | 0)), { h: i, l: o } = ut(this.Bh | 0, this.Bl | 0, i | 0, o | 0), { h: c, l: f } = ut(this.Ch | 0, this.Cl | 0, c | 0, f | 0), { h: l, l: h } = ut(this.Dh | 0, this.Dl | 0, l | 0, h | 0), { h: a, l: d } = ut(this.Eh | 0, this.El | 0, a | 0, d | 0), { h: u, l: y } = ut(this.Fh | 0, this.Fl | 0, u | 0, y | 0), { h: b, l: w } = ut(this.Gh | 0, this.Gl | 0, b | 0, w | 0), { h: _, l: L } = ut(this.Hh | 0, this.Hl | 0, _ | 0, L | 0), this.set(s, r, i, o, c, f, l, h, a, d, u, y, b, w, _, L);
-  }
-  roundClean() {
-    Se(vt, Lt);
-  }
-  destroy() {
-    Se(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
-  }
-}
-const $o = /* @__PURE__ */ yo(() => new Uo()), _i = $o, Hi = Fs, Si = Je;
-class ps extends Yn {
-  constructor(e, n) {
-    super(), this.finished = !1, this.destroyed = !1, Js(e);
-    const s = nn(n);
-    if (this.iHash = e.create(), typeof this.iHash.update != "function")
-      throw new Error("Expected instance of class which extends utils.Hash");
-    this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
-    const r = this.blockLen, i = new Uint8Array(r);
-    i.set(s.length > r ? e.create().update(s).digest() : s);
-    for (let o = 0; o < i.length; o++)
-      i[o] ^= 54;
-    this.iHash.update(i), this.oHash = e.create();
-    for (let o = 0; o < i.length; o++)
-      i[o] ^= 106;
-    this.oHash.update(i), ee(i);
-  }
-  update(e) {
-    return _e(this), this.iHash.update(e), this;
-  }
-  digestInto(e) {
-    _e(this), it(e, this.outputLen), this.finished = !0, this.iHash.digestInto(e), this.oHash.update(e), this.oHash.digestInto(e), this.destroy();
-  }
-  digest() {
-    const e = new Uint8Array(this.oHash.outputLen);
-    return this.digestInto(e), e;
-  }
-  _cloneInto(e) {
-    e || (e = Object.create(Object.getPrototypeOf(this), {}));
-    const { oHash: n, iHash: s, finished: r, destroyed: i, blockLen: o, outputLen: c } = this;
-    return e = e, e.finished = r, e.destroyed = i, e.blockLen = o, e.outputLen = c, e.oHash = n._cloneInto(e.oHash), e.iHash = s._cloneInto(e.iHash), e;
-  }
-  clone() {
-    return this._cloneInto();
-  }
-  destroy() {
-    this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
-  }
-}
-const ms = (t, e, n) => new ps(t, e).update(n).digest();
-ms.create = (t, e) => new ps(t, e);
-function $n(t) {
-  t.lowS !== void 0 && Vt("lowS", t.lowS), t.prehash !== void 0 && Vt("prehash", t.prehash);
-}
-class Do extends Error {
-  constructor(e = "") {
-    super(e);
-  }
-}
-const bt = {
-  // asn.1 DER encoding utils
-  Err: Do,
-  // Basic building block is TLV (Tag-Length-Value)
-  _tlv: {
-    encode: (t, e) => {
-      const { Err: n } = bt;
-      if (t < 0 || t > 256)
-        throw new n("tlv.encode: wrong tag");
-      if (e.length & 1)
-        throw new n("tlv.encode: unpadded data");
-      const s = e.length / 2, r = be(s);
-      if (r.length / 2 & 128)
-        throw new n("tlv.encode: long form length too big");
-      const i = s > 127 ? be(r.length / 2 | 128) : "";
-      return be(t) + i + r + e;
-    },
-    // v - value, l - left bytes (unparsed)
-    decode(t, e) {
-      const { Err: n } = bt;
-      let s = 0;
-      if (t < 0 || t > 256)
-        throw new n("tlv.encode: wrong tag");
-      if (e.length < 2 || e[s++] !== t)
-        throw new n("tlv.decode: wrong tlv");
-      const r = e[s++], i = !!(r & 128);
-      let o = 0;
-      if (!i)
-        o = r;
-      else {
-        const f = r & 127;
-        if (!f)
-          throw new n("tlv.decode(long): indefinite length not supported");
-        if (f > 4)
-          throw new n("tlv.decode(long): byte length is too big");
-        const l = e.subarray(s, s + f);
-        if (l.length !== f)
-          throw new n("tlv.decode: length bytes not complete");
-        if (l[0] === 0)
-          throw new n("tlv.decode(long): zero leftmost byte");
-        for (const h of l)
-          o = o << 8 | h;
-        if (s += f, o < 128)
-          throw new n("tlv.decode(long): not minimal encoding");
-      }
-      const c = e.subarray(s, s + o);
-      if (c.length !== o)
-        throw new n("tlv.decode: wrong value length");
-      return { v: c, l: e.subarray(s + o) };
-    }
-  },
-  // https://crypto.stackexchange.com/a/57734 Leftmost bit of first byte is 'negative' flag,
-  // since we always use positive integers here. It must always be empty:
-  // - add zero byte if exists
-  // - if next byte doesn't have a flag, leading zero is not allowed (minimal encoding)
-  _int: {
-    encode(t) {
-      const { Err: e } = bt;
-      if (t < le)
-        throw new e("integer: negative integers are not allowed");
-      let n = be(t);
-      if (Number.parseInt(n[0], 16) & 8 && (n = "00" + n), n.length & 1)
-        throw new e("unexpected DER parsing assertion: unpadded hex");
-      return n;
-    },
-    decode(t) {
-      const { Err: e } = bt;
-      if (t[0] & 128)
-        throw new e("invalid signature integer: negative");
-      if (t[0] === 0 && !(t[1] & 128))
-        throw new e("invalid signature integer: unnecessary leading zero");
-      return ve(t);
-    }
-  },
-  toSig(t) {
-    const { Err: e, _int: n, _tlv: s } = bt, r = V("signature", t), { v: i, l: o } = s.decode(48, r);
-    if (o.length)
-      throw new e("invalid signature: left bytes after parsing");
-    const { v: c, l: f } = s.decode(2, i), { v: l, l: h } = s.decode(2, f);
-    if (h.length)
-      throw new e("invalid signature: left bytes after parsing");
-    return { r: n.decode(c), s: n.decode(l) };
-  },
-  hexFromSig(t) {
-    const { _tlv: e, _int: n } = bt, s = e.encode(2, n.encode(t.r)), r = e.encode(2, n.encode(t.s)), i = s + r;
-    return e.encode(48, i);
-  }
-}, le = BigInt(0), de = BigInt(1), Co = BigInt(2), Ee = BigInt(3), ko = BigInt(4);
-function Oo(t, e, n) {
-  function s(r) {
-    const i = t.sqr(r), o = t.mul(i, r);
-    return t.add(t.add(o, t.mul(r, e)), n);
-  }
-  return s;
-}
-function Bs(t, e, n) {
-  const { BYTES: s } = t;
-  function r(i) {
-    let o;
-    if (typeof i == "bigint")
-      o = i;
-    else {
-      let c = V("private key", i);
-      if (e) {
-        if (!e.includes(c.length * 2))
-          throw new Error("invalid private key");
-        const f = new Uint8Array(s);
-        f.set(c, f.length - c.length), c = f;
-      }
-      try {
-        o = t.fromBytes(c);
-      } catch {
-        throw new Error(`invalid private key: expected ui8a of size ${s}, got ${typeof i}`);
-      }
-    }
-    if (n && (o = t.create(o)), !t.isValidNot0(o))
-      throw new Error("invalid private key: out of range [1..N-1]");
-    return o;
-  }
-  return r;
-}
-function Ro(t, e = {}) {
-  const { Fp: n, Fn: s } = ls("weierstrass", t, e), { h: r, n: i } = t;
-  ue(e, {}, {
-    allowInfinityPoint: "boolean",
-    clearCofactor: "function",
-    isTorsionFree: "function",
-    fromBytes: "function",
-    toBytes: "function",
-    endo: "object",
-    wrapPrivateKey: "boolean"
-  });
-  const { endo: o } = e;
-  if (o && (!n.is0(t.a) || typeof o.beta != "bigint" || typeof o.splitScalar != "function"))
-    throw new Error('invalid endo: expected "beta": bigint and "splitScalar": function');
-  function c() {
-    if (!n.isOdd)
-      throw new Error("compression is not supported: Field does not have .isOdd()");
-  }
-  function f(H, x, E) {
-    const { x: g, y: B } = x.toAffine(), A = n.toBytes(g);
-    if (Vt("isCompressed", E), E) {
-      c();
-      const I = !n.isOdd(B);
-      return wt(Es(I), A);
-    } else
-      return wt(Uint8Array.of(4), A, n.toBytes(B));
-  }
-  function l(H) {
-    it(H);
-    const x = n.BYTES, E = x + 1, g = 2 * x + 1, B = H.length, A = H[0], I = H.subarray(1);
-    if (B === E && (A === 2 || A === 3)) {
-      const S = n.fromBytes(I);
-      if (!n.isValid(S))
-        throw new Error("bad point: is not on curve, wrong x");
-      const $ = d(S);
-      let O;
-      try {
-        O = n.sqrt($);
-      } catch (T) {
-        const R = T instanceof Error ? ": " + T.message : "";
-        throw new Error("bad point: is not on curve, sqrt error" + R);
-      }
-      c();
-      const k = n.isOdd(O);
-      return (A & 1) === 1 !== k && (O = n.neg(O)), { x: S, y: O };
-    } else if (B === g && A === 4) {
-      const S = n.fromBytes(I.subarray(x * 0, x * 1)), $ = n.fromBytes(I.subarray(x * 1, x * 2));
-      if (!u(S, $))
-        throw new Error("bad point: is not on curve");
-      return { x: S, y: $ };
-    } else
-      throw new Error(`bad point: got length ${B}, expected compressed=${E} or uncompressed=${g}`);
-  }
-  const h = e.toBytes || f, a = e.fromBytes || l, d = Oo(n, t.a, t.b);
-  function u(H, x) {
-    const E = n.sqr(x), g = d(H);
-    return n.eql(E, g);
-  }
-  if (!u(t.Gx, t.Gy))
-    throw new Error("bad curve params: generator point");
-  const y = n.mul(n.pow(t.a, Ee), ko), b = n.mul(n.sqr(t.b), BigInt(27));
-  if (n.is0(n.add(y, b)))
-    throw new Error("bad curve params: a or b");
-  function w(H, x, E = !1) {
-    if (!n.isValid(x) || E && n.is0(x))
-      throw new Error(`bad point coordinate ${H}`);
-    return x;
-  }
-  function _(H) {
-    if (!(H instanceof m))
-      throw new Error("ProjectivePoint expected");
-  }
-  const L = He((H, x) => {
-    const { px: E, py: g, pz: B } = H;
-    if (n.eql(B, n.ONE))
-      return { x: E, y: g };
-    const A = H.is0();
-    x == null && (x = A ? n.ONE : n.inv(B));
-    const I = n.mul(E, x), S = n.mul(g, x), $ = n.mul(B, x);
-    if (A)
-      return { x: n.ZERO, y: n.ZERO };
-    if (!n.eql($, n.ONE))
-      throw new Error("invZ was invalid");
-    return { x: I, y: S };
-  }), p = He((H) => {
-    if (H.is0()) {
-      if (e.allowInfinityPoint && !n.is0(H.py))
-        return;
-      throw new Error("bad point: ZERO");
-    }
-    const { x, y: E } = H.toAffine();
-    if (!n.isValid(x) || !n.isValid(E))
-      throw new Error("bad point: x or y not field elements");
-    if (!u(x, E))
-      throw new Error("bad point: equation left != right");
-    if (!H.isTorsionFree())
-      throw new Error("bad point: not in prime-order subgroup");
-    return !0;
-  });
-  function D(H, x, E, g, B) {
-    return E = new m(n.mul(E.px, H), E.py, E.pz), x = he(g, x), E = he(B, E), x.add(E);
-  }
-  class m {
-    /** Does NOT validate if the point is valid. Use `.assertValidity()`. */
-    constructor(x, E, g) {
-      this.px = w("x", x), this.py = w("y", E, !0), this.pz = w("z", g), Object.freeze(this);
-    }
-    /** Does NOT validate if the point is valid. Use `.assertValidity()`. */
-    static fromAffine(x) {
-      const { x: E, y: g } = x || {};
-      if (!x || !n.isValid(E) || !n.isValid(g))
-        throw new Error("invalid affine point");
-      if (x instanceof m)
-        throw new Error("projective point not allowed");
-      return n.is0(E) && n.is0(g) ? m.ZERO : new m(E, g, n.ONE);
-    }
-    get x() {
-      return this.toAffine().x;
-    }
-    get y() {
-      return this.toAffine().y;
-    }
-    static normalizeZ(x) {
-      return cs(m, "pz", x);
-    }
-    static fromBytes(x) {
-      return it(x), m.fromHex(x);
-    }
-    /** Converts hash string or Uint8Array to Point. */
-    static fromHex(x) {
-      const E = m.fromAffine(a(V("pointHex", x)));
-      return E.assertValidity(), E;
-    }
-    /** Multiplies generator point by privateKey. */
-    static fromPrivateKey(x) {
-      const E = Bs(s, e.allowedPrivateKeyLengths, e.wrapPrivateKey);
-      return m.BASE.multiply(E(x));
-    }
-    /** Multiscalar Multiplication */
-    static msm(x, E) {
-      return on(m, s, x, E);
-    }
-    /**
-     *
-     * @param windowSize
-     * @param isLazy true will defer table computation until the first multiplication
-     * @returns
-     */
-    precompute(x = 8, E = !0) {
-      return C.setWindowSize(this, x), E || this.multiply(Ee), this;
-    }
-    /** "Private method", don't use it directly */
-    _setWindowSize(x) {
-      this.precompute(x);
-    }
-    // TODO: return `this`
-    /** A point on curve is valid if it conforms to equation. */
-    assertValidity() {
-      p(this);
-    }
-    hasEvenY() {
-      const { y: x } = this.toAffine();
-      if (!n.isOdd)
-        throw new Error("Field doesn't support isOdd");
-      return !n.isOdd(x);
-    }
-    /** Compare one point to another. */
-    equals(x) {
-      _(x);
-      const { px: E, py: g, pz: B } = this, { px: A, py: I, pz: S } = x, $ = n.eql(n.mul(E, S), n.mul(A, B)), O = n.eql(n.mul(g, S), n.mul(I, B));
-      return $ && O;
-    }
-    /** Flips point to one corresponding to (x, -y) in Affine coordinates. */
-    negate() {
-      return new m(this.px, n.neg(this.py), this.pz);
-    }
-    // Renes-Costello-Batina exception-free doubling formula.
-    // There is 30% faster Jacobian formula, but it is not complete.
-    // https://eprint.iacr.org/2015/1060, algorithm 3
-    // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
-    double() {
-      const { a: x, b: E } = t, g = n.mul(E, Ee), { px: B, py: A, pz: I } = this;
-      let S = n.ZERO, $ = n.ZERO, O = n.ZERO, k = n.mul(B, B), q = n.mul(A, A), T = n.mul(I, I), R = n.mul(B, A);
-      return R = n.add(R, R), O = n.mul(B, I), O = n.add(O, O), S = n.mul(x, O), $ = n.mul(g, T), $ = n.add(S, $), S = n.sub(q, $), $ = n.add(q, $), $ = n.mul(S, $), S = n.mul(R, S), O = n.mul(g, O), T = n.mul(x, T), R = n.sub(k, T), R = n.mul(x, R), R = n.add(R, O), O = n.add(k, k), k = n.add(O, k), k = n.add(k, T), k = n.mul(k, R), $ = n.add($, k), T = n.mul(A, I), T = n.add(T, T), k = n.mul(T, R), S = n.sub(S, k), O = n.mul(T, q), O = n.add(O, O), O = n.add(O, O), new m(S, $, O);
-    }
-    // Renes-Costello-Batina exception-free addition formula.
-    // There is 30% faster Jacobian formula, but it is not complete.
-    // https://eprint.iacr.org/2015/1060, algorithm 1
-    // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
-    add(x) {
-      _(x);
-      const { px: E, py: g, pz: B } = this, { px: A, py: I, pz: S } = x;
-      let $ = n.ZERO, O = n.ZERO, k = n.ZERO;
-      const q = t.a, T = n.mul(t.b, Ee);
-      let R = n.mul(E, A), M = n.mul(g, I), K = n.mul(B, S), X = n.add(E, g), G = n.add(A, I);
-      X = n.mul(X, G), G = n.add(R, M), X = n.sub(X, G), G = n.add(E, B);
-      let J = n.add(A, S);
-      return G = n.mul(G, J), J = n.add(R, K), G = n.sub(G, J), J = n.add(g, B), $ = n.add(I, S), J = n.mul(J, $), $ = n.add(M, K), J = n.sub(J, $), k = n.mul(q, G), $ = n.mul(T, K), k = n.add($, k), $ = n.sub(M, k), k = n.add(M, k), O = n.mul($, k), M = n.add(R, R), M = n.add(M, R), K = n.mul(q, K), G = n.mul(T, G), M = n.add(M, K), K = n.sub(R, K), K = n.mul(q, K), G = n.add(G, K), R = n.mul(M, G), O = n.add(O, R), R = n.mul(J, G), $ = n.mul(X, $), $ = n.sub($, R), R = n.mul(X, M), k = n.mul(J, k), k = n.add(k, R), new m($, O, k);
-    }
-    subtract(x) {
-      return this.add(x.negate());
-    }
-    is0() {
-      return this.equals(m.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(x) {
-      const { endo: E } = e;
-      if (!s.isValidNot0(x))
-        throw new Error("invalid scalar: out of range");
-      let g, B;
-      const A = (I) => C.wNAFCached(this, I, m.normalizeZ);
-      if (E) {
-        const { k1neg: I, k1: S, k2neg: $, k2: O } = E.splitScalar(x), { p: k, f: q } = A(S), { p: T, f: R } = A(O);
-        B = q.add(R), g = D(E.beta, k, T, I, $);
-      } else {
-        const { p: I, f: S } = A(x);
-        g = I, B = S;
-      }
-      return m.normalizeZ([g, B])[0];
-    }
-    /**
-     * Non-constant-time multiplication. Uses double-and-add algorithm.
-     * It's faster, but should only be used when you don't care about
-     * an exposed private key e.g. sig verification, which works over *public* keys.
-     */
-    multiplyUnsafe(x) {
-      const { endo: E } = e, g = this;
-      if (!s.isValid(x))
-        throw new Error("invalid scalar: out of range");
-      if (x === le || g.is0())
-        return m.ZERO;
-      if (x === de)
-        return g;
-      if (C.hasPrecomputes(this))
-        return this.multiply(x);
-      if (E) {
-        const { k1neg: B, k1: A, k2neg: I, k2: S } = E.splitScalar(x), { p1: $, p2: O } = Rr(m, g, A, S);
-        return D(E.beta, $, O, B, I);
-      } else
-        return C.wNAFCachedUnsafe(g, x);
-    }
-    multiplyAndAddUnsafe(x, E, g) {
-      const B = this.multiplyUnsafe(E).add(x.multiplyUnsafe(g));
-      return B.is0() ? void 0 : B;
-    }
-    /**
-     * Converts Projective point to affine (x, y) coordinates.
-     * @param invertedZ Z^-1 (inverted zero) - optional, precomputation is useful for invertBatch
-     */
-    toAffine(x) {
-      return L(this, x);
-    }
-    /**
-     * Checks whether Point is free of torsion elements (is in prime subgroup).
-     * Always torsion-free for cofactor=1 curves.
-     */
-    isTorsionFree() {
-      const { isTorsionFree: x } = e;
-      return r === de ? !0 : x ? x(m, this) : C.wNAFCachedUnsafe(this, i).is0();
-    }
-    clearCofactor() {
-      const { clearCofactor: x } = e;
-      return r === de ? this : x ? x(m, this) : this.multiplyUnsafe(r);
-    }
-    toBytes(x = !0) {
-      return Vt("isCompressed", x), this.assertValidity(), h(m, this, x);
-    }
-    /** @deprecated use `toBytes` */
-    toRawBytes(x = !0) {
-      return this.toBytes(x);
-    }
-    toHex(x = !0) {
-      return Mt(this.toBytes(x));
-    }
-    toString() {
-      return `<Point ${this.is0() ? "ZERO" : this.toHex()}>`;
-    }
-  }
-  m.BASE = new m(t.Gx, t.Gy, n.ONE), m.ZERO = new m(n.ZERO, n.ONE, n.ZERO), m.Fp = n, m.Fn = s;
-  const U = s.BITS, C = hs(m, e.endo ? Math.ceil(U / 2) : U);
-  return m;
-}
-function Es(t) {
-  return Uint8Array.of(t ? 2 : 3);
-}
-function To(t, e, n = {}) {
-  ue(e, { hash: "function" }, {
-    hmac: "function",
-    lowS: "boolean",
-    randomBytes: "function",
-    bits2int: "function",
-    bits2int_modN: "function"
-  });
-  const s = e.randomBytes || Fn, r = e.hmac || ((g, ...B) => ms(e.hash, g, wt(...B))), { Fp: i, Fn: o } = t, { ORDER: c, BITS: f } = o;
-  function l(g) {
-    const B = c >> de;
-    return g > B;
-  }
-  function h(g) {
-    return l(g) ? o.neg(g) : g;
-  }
-  function a(g, B) {
-    if (!o.isValidNot0(B))
-      throw new Error(`invalid signature ${g}: out of range 1..CURVE.n`);
-  }
-  class d {
-    constructor(B, A, I) {
-      a("r", B), a("s", A), this.r = B, this.s = A, I != null && (this.recovery = I), Object.freeze(this);
-    }
-    // pair (bytes of r, bytes of s)
-    static fromCompact(B) {
-      const A = o.BYTES, I = V("compactSignature", B, A * 2);
-      return new d(o.fromBytes(I.subarray(0, A)), o.fromBytes(I.subarray(A, A * 2)));
-    }
-    // DER encoded ECDSA signature
-    // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script
-    static fromDER(B) {
-      const { r: A, s: I } = bt.toSig(V("DER", B));
-      return new d(A, I);
-    }
-    /**
-     * @todo remove
-     * @deprecated
-     */
-    assertValidity() {
-    }
-    addRecoveryBit(B) {
-      return new d(this.r, this.s, B);
-    }
-    // ProjPointType<bigint>
-    recoverPublicKey(B) {
-      const A = i.ORDER, { r: I, s: S, recovery: $ } = this;
-      if ($ == null || ![0, 1, 2, 3].includes($))
-        throw new Error("recovery id invalid");
-      if (c * Co < A && $ > 1)
-        throw new Error("recovery id is ambiguous for h>1 curve");
-      const k = $ === 2 || $ === 3 ? I + c : I;
-      if (!i.isValid(k))
-        throw new Error("recovery id 2 or 3 invalid");
-      const q = i.toBytes(k), T = t.fromHex(wt(Es(($ & 1) === 0), q)), R = o.inv(k), M = p(V("msgHash", B)), K = o.create(-M * R), X = o.create(S * R), G = t.BASE.multiplyUnsafe(K).add(T.multiplyUnsafe(X));
-      if (G.is0())
-        throw new Error("point at infinify");
-      return G.assertValidity(), G;
-    }
-    // Signatures should be low-s, to prevent malleability.
-    hasHighS() {
-      return l(this.s);
-    }
-    normalizeS() {
-      return this.hasHighS() ? new d(this.r, o.neg(this.s), this.recovery) : this;
-    }
-    toBytes(B) {
-      if (B === "compact")
-        return wt(o.toBytes(this.r), o.toBytes(this.s));
-      if (B === "der")
-        return en(bt.hexFromSig(this));
-      throw new Error("invalid format");
-    }
-    // DER-encoded
-    toDERRawBytes() {
-      return this.toBytes("der");
-    }
-    toDERHex() {
-      return Mt(this.toBytes("der"));
-    }
-    // padded bytes of r, then padded bytes of s
-    toCompactRawBytes() {
-      return this.toBytes("compact");
-    }
-    toCompactHex() {
-      return Mt(this.toBytes("compact"));
-    }
-  }
-  const u = Bs(o, n.allowedPrivateKeyLengths, n.wrapPrivateKey), y = {
-    isValidPrivateKey(g) {
-      try {
-        return u(g), !0;
-      } catch {
-        return !1;
-      }
-    },
-    normPrivateKeyToScalar: u,
-    /**
-     * Produces cryptographically secure private key from random of size
-     * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.
-     */
-    randomPrivateKey: () => {
-      const g = c;
-      return br(s(rs(g)), g);
-    },
-    precompute(g = 8, B = t.BASE) {
-      return B.precompute(g, !1);
-    }
-  };
-  function b(g, B = !0) {
-    return t.fromPrivateKey(g).toBytes(B);
-  }
-  function w(g) {
-    if (typeof g == "bigint")
-      return !1;
-    if (g instanceof t)
-      return !0;
-    const A = V("key", g).length, I = i.BYTES, S = I + 1, $ = 2 * I + 1;
-    if (!(n.allowedPrivateKeyLengths || o.BYTES === S))
-      return A === S || A === $;
-  }
-  function _(g, B, A = !0) {
-    if (w(g) === !0)
-      throw new Error("first arg must be private key");
-    if (w(B) === !1)
-      throw new Error("second arg must be public key");
-    return t.fromHex(B).multiply(u(g)).toBytes(A);
-  }
-  const L = e.bits2int || function(g) {
-    if (g.length > 8192)
-      throw new Error("input is too large");
-    const B = ve(g), A = g.length * 8 - f;
-    return A > 0 ? B >> BigInt(A) : B;
-  }, p = e.bits2int_modN || function(g) {
-    return o.create(L(g));
-  }, D = Le(f);
-  function m(g) {
-    return Jt("num < 2^" + f, g, le, D), o.toBytes(g);
-  }
-  function U(g, B, A = C) {
-    if (["recovered", "canonical"].some((X) => X in A))
-      throw new Error("sign() legacy options not supported");
-    const { hash: I } = e;
-    let { lowS: S, prehash: $, extraEntropy: O } = A;
-    S == null && (S = !0), g = V("msgHash", g), $n(A), $ && (g = V("prehashed msgHash", I(g)));
-    const k = p(g), q = u(B), T = [m(q), m(k)];
-    if (O != null && O !== !1) {
-      const X = O === !0 ? s(i.BYTES) : O;
-      T.push(V("extraEntropy", X));
-    }
-    const R = wt(...T), M = k;
-    function K(X) {
-      const G = L(X);
-      if (!o.isValidNot0(G))
-        return;
-      const J = o.inv(G), ie = t.BASE.multiply(G).toAffine(), zt = o.create(ie.x);
-      if (zt === le)
-        return;
-      const Tt = o.create(J * o.create(M + zt * q));
-      if (Tt === le)
-        return;
-      let De = (ie.x === zt ? 0 : 2) | Number(ie.y & de), jt = Tt;
-      return S && l(Tt) && (jt = h(Tt), De ^= 1), new d(zt, jt, De);
-    }
-    return { seed: R, k2sig: K };
-  }
-  const C = { lowS: e.lowS, prehash: !1 }, H = { lowS: e.lowS, prehash: !1 };
-  function x(g, B, A = C) {
-    const { seed: I, k2sig: S } = U(g, B, A);
-    return ir(e.hash.outputLen, o.BYTES, r)(I, S);
-  }
-  t.BASE.precompute(8);
-  function E(g, B, A, I = H) {
-    const S = g;
-    B = V("msgHash", B), A = V("publicKey", A), $n(I);
-    const { lowS: $, prehash: O, format: k } = I;
-    if ("strict" in I)
-      throw new Error("options.strict was renamed to lowS");
-    if (k !== void 0 && !["compact", "der", "js"].includes(k))
-      throw new Error('format must be "compact", "der" or "js"');
-    const q = typeof S == "string" || tn(S), T = !q && !k && typeof S == "object" && S !== null && typeof S.r == "bigint" && typeof S.s == "bigint";
-    if (!q && !T)
-      throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");
-    let R, M;
-    try {
-      if (T)
-        if (k === void 0 || k === "js")
-          R = new d(S.r, S.s);
-        else
-          throw new Error("invalid format");
-      if (q) {
-        try {
-          k !== "compact" && (R = d.fromDER(S));
-        } catch (jt) {
-          if (!(jt instanceof bt.Err))
-            throw jt;
-        }
-        !R && k !== "der" && (R = d.fromCompact(S));
-      }
-      M = t.fromHex(A);
-    } catch {
-      return !1;
-    }
-    if (!R || $ && R.hasHighS())
-      return !1;
-    O && (B = e.hash(B));
-    const { r: K, s: X } = R, G = p(B), J = o.inv(X), ie = o.create(G * J), zt = o.create(K * J), Tt = t.BASE.multiplyUnsafe(ie).add(M.multiplyUnsafe(zt));
-    return Tt.is0() ? !1 : o.create(Tt.x) === K;
-  }
-  return Object.freeze({
-    getPublicKey: b,
-    getSharedSecret: _,
-    sign: x,
-    verify: E,
-    utils: y,
-    Point: t,
-    Signature: d
-  });
-}
-function No(t) {
-  const e = {
-    a: t.a,
-    b: t.b,
-    p: t.Fp.ORDER,
-    n: t.n,
-    h: t.h,
-    Gx: t.Gx,
-    Gy: t.Gy
-  }, n = t.Fp, s = Zt(e.n, t.nBitLength), r = {
-    Fp: n,
-    Fn: s,
-    allowedPrivateKeyLengths: t.allowedPrivateKeyLengths,
-    allowInfinityPoint: t.allowInfinityPoint,
-    endo: t.endo,
-    wrapPrivateKey: t.wrapPrivateKey,
-    isTorsionFree: t.isTorsionFree,
-    clearCofactor: t.clearCofactor,
-    fromBytes: t.fromBytes,
-    toBytes: t.toBytes
-  };
-  return { CURVE: e, curveOpts: r };
-}
-function qo(t) {
-  const { CURVE: e, curveOpts: n } = No(t), s = {
-    hash: t.hash,
-    hmac: t.hmac,
-    randomBytes: t.randomBytes,
-    lowS: t.lowS,
-    bits2int: t.bits2int,
-    bits2int_modN: t.bits2int_modN
-  };
-  return { CURVE: e, curveOpts: n, ecdsaOpts: s };
-}
-function Go(t, e) {
-  return Object.assign({}, e, {
-    ProjectivePoint: e.Point,
-    CURVE: t
-  });
-}
-function Mo(t) {
-  const { CURVE: e, curveOpts: n, ecdsaOpts: s } = qo(t), r = Ro(e, n), i = To(r, s, n);
-  return Go(t, i);
-}
-function Vo(t, e) {
-  const n = (s) => Mo({ ...t, hash: s });
-  return { ...n(e), create: n };
-}
-const Ie = {
-  p: BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),
-  n: BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),
-  h: BigInt(1),
-  a: BigInt(0),
-  b: BigInt(7),
-  Gx: BigInt("0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"),
-  Gy: BigInt("0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8")
-};
-BigInt(0);
-const Zo = BigInt(1), Ye = BigInt(2), Dn = (t, e) => (t + e / Ye) / e;
-function zo(t) {
-  const e = Ie.p, n = BigInt(3), s = BigInt(6), r = BigInt(11), i = BigInt(22), o = BigInt(23), c = BigInt(44), f = BigInt(88), l = t * t * t % e, h = l * l * t % e, a = Z(h, n, e) * h % e, d = Z(a, n, e) * h % e, u = Z(d, Ye, e) * l % e, y = Z(u, r, e) * u % e, b = Z(y, i, e) * y % e, w = Z(b, c, e) * b % e, _ = Z(w, f, e) * w % e, L = Z(_, c, e) * b % e, p = Z(L, n, e) * h % e, D = Z(p, o, e) * y % e, m = Z(D, s, e) * l % e, U = Z(m, Ye, e);
-  if (!Xe.eql(Xe.sqr(U), t))
-    throw new Error("Cannot find square root");
-  return U;
-}
-const Xe = Zt(Ie.p, void 0, void 0, { sqrt: zo }), Ii = Vo({
-  ...Ie,
-  Fp: Xe,
-  lowS: !0,
-  // Allow only low-S signatures by default in sign() and verify()
-  endo: {
-    // Endomorphism, see above
-    beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
-    splitScalar: (t) => {
-      const e = Ie.n, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), s = -Zo * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), r = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), i = n, o = BigInt("0x100000000000000000000000000000000"), c = Dn(i * t, e), f = Dn(-s * t, e);
-      let l = z(t - c * n - f * r, e), h = z(-c * s - f * i, e);
-      const a = l > o, d = h > o;
-      if (a && (l = e - l), d && (h = e - h), l > o || h > o)
-        throw new Error("splitScalar: Endomorphism failed, k=" + t);
-      return { k1neg: a, k1: l, k2neg: d, k2: h };
-    }
-  }
-}, Dr);
-function jo(t) {
-  return t instanceof Uint8Array || t != null && typeof t == "object" && t.constructor.name === "Uint8Array";
-}
-function As(t, ...e) {
-  if (!jo(t))
-    throw new Error("Uint8Array expected");
-  if (e.length > 0 && !e.includes(t.length))
-    throw new Error(`Uint8Array expected of length ${e}, not of length=${t.length}`);
-}
-function Cn(t, e = !0) {
-  if (t.destroyed)
-    throw new Error("Hash instance has been destroyed");
-  if (e && t.finished)
-    throw new Error("Hash#digest() has already been called");
-}
-function Wo(t, e) {
-  As(t);
-  const n = e.outputLen;
-  if (t.length < n)
-    throw new Error(`digestInto() expects output buffer of length at least ${n}`);
-}
-const Ze = (t) => new DataView(t.buffer, t.byteOffset, t.byteLength), at = (t, e) => t << 32 - e | t >>> e;
-function Ko(t) {
-  if (typeof t != "string")
-    throw new Error(`utf8ToBytes expected string, got ${typeof t}`);
-  return new Uint8Array(new TextEncoder().encode(t));
-}
-function _s(t) {
-  return typeof t == "string" && (t = Ko(t)), As(t), t;
-}
-class Yo {
-  // Safe version that clones internal state
-  clone() {
-    return this._cloneInto();
-  }
-}
-function Xo(t) {
-  const e = (s) => t().update(_s(s)).digest(), n = t();
-  return e.outputLen = n.outputLen, e.blockLen = n.blockLen, e.create = () => t(), e;
-}
-function Fo(t, e, n, s) {
-  if (typeof t.setBigUint64 == "function")
-    return t.setBigUint64(e, n, s);
-  const r = BigInt(32), i = BigInt(4294967295), o = Number(n >> r & i), c = Number(n & i), f = s ? 4 : 0, l = s ? 0 : 4;
-  t.setUint32(e + f, o, s), t.setUint32(e + l, c, s);
-}
-const Po = (t, e, n) => t & e ^ ~t & n, Qo = (t, e, n) => t & e ^ t & n ^ e & n;
-class Jo extends Yo {
-  constructor(e, n, s, r) {
-    super(), this.blockLen = e, this.outputLen = n, this.padOffset = s, this.isLE = r, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(e), this.view = Ze(this.buffer);
-  }
-  update(e) {
-    Cn(this);
-    const { view: n, buffer: s, blockLen: r } = this;
-    e = _s(e);
-    const i = e.length;
-    for (let o = 0; o < i; ) {
-      const c = Math.min(r - this.pos, i - o);
-      if (c === r) {
-        const f = Ze(e);
-        for (; r <= i - o; o += r)
-          this.process(f, o);
-        continue;
-      }
-      s.set(e.subarray(o, o + c), this.pos), this.pos += c, o += c, this.pos === r && (this.process(n, 0), this.pos = 0);
-    }
-    return this.length += e.length, this.roundClean(), this;
-  }
-  digestInto(e) {
-    Cn(this), Wo(e, this), this.finished = !0;
-    const { buffer: n, view: s, blockLen: r, isLE: i } = this;
-    let { pos: o } = this;
-    n[o++] = 128, this.buffer.subarray(o).fill(0), this.padOffset > r - o && (this.process(s, 0), o = 0);
-    for (let a = o; a < r; a++)
-      n[a] = 0;
-    Fo(s, r - 8, BigInt(this.length * 8), i), this.process(s, 0);
-    const c = Ze(e), f = this.outputLen;
-    if (f % 4)
-      throw new Error("_sha2: outputLen should be aligned to 32bit");
-    const l = f / 4, h = this.get();
-    if (l > h.length)
-      throw new Error("_sha2: outputLen bigger than state");
-    for (let a = 0; a < l; a++)
-      c.setUint32(4 * a, h[a], i);
-  }
-  digest() {
-    const { buffer: e, outputLen: n } = this;
-    this.digestInto(e);
-    const s = e.slice(0, n);
-    return this.destroy(), s;
-  }
-  _cloneInto(e) {
-    e || (e = new this.constructor()), e.set(...this.get());
-    const { blockLen: n, buffer: s, length: r, finished: i, destroyed: o, pos: c } = this;
-    return e.length = r, e.pos = c, e.finished = i, e.destroyed = o, r % n && e.buffer.set(s), e;
-  }
-}
-const ti = /* @__PURE__ */ new Uint32Array([
-  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
-]), Ut = /* @__PURE__ */ new Uint32Array([
-  1779033703,
-  3144134277,
-  1013904242,
-  2773480762,
-  1359893119,
-  2600822924,
-  528734635,
-  1541459225
-]), $t = /* @__PURE__ */ new Uint32Array(64);
-class ei extends Jo {
-  constructor() {
-    super(64, 32, 8, !1), this.A = Ut[0] | 0, this.B = Ut[1] | 0, this.C = Ut[2] | 0, this.D = Ut[3] | 0, this.E = Ut[4] | 0, this.F = Ut[5] | 0, this.G = Ut[6] | 0, this.H = Ut[7] | 0;
-  }
-  get() {
-    const { A: e, B: n, C: s, D: r, E: i, F: o, G: c, H: f } = this;
-    return [e, n, s, r, i, o, c, f];
-  }
-  // prettier-ignore
-  set(e, n, s, r, i, o, c, f) {
-    this.A = e | 0, this.B = n | 0, this.C = s | 0, this.D = r | 0, this.E = i | 0, this.F = o | 0, this.G = c | 0, this.H = f | 0;
-  }
-  process(e, n) {
-    for (let a = 0; a < 16; a++, n += 4)
-      $t[a] = e.getUint32(n, !1);
-    for (let a = 16; a < 64; a++) {
-      const d = $t[a - 15], u = $t[a - 2], y = at(d, 7) ^ at(d, 18) ^ d >>> 3, b = at(u, 17) ^ at(u, 19) ^ u >>> 10;
-      $t[a] = b + $t[a - 7] + y + $t[a - 16] | 0;
-    }
-    let { A: s, B: r, C: i, D: o, E: c, F: f, G: l, H: h } = this;
-    for (let a = 0; a < 64; a++) {
-      const d = at(c, 6) ^ at(c, 11) ^ at(c, 25), u = h + d + Po(c, f, l) + ti[a] + $t[a] | 0, b = (at(s, 2) ^ at(s, 13) ^ at(s, 22)) + Qo(s, r, i) | 0;
-      h = l, l = f, f = c, c = o + u | 0, o = i, i = r, r = s, s = u + b | 0;
-    }
-    s = s + this.A | 0, r = r + this.B | 0, i = i + this.C | 0, o = o + this.D | 0, c = c + this.E | 0, f = f + this.F | 0, l = l + this.G | 0, h = h + this.H | 0, this.set(s, r, i, o, c, f, l, h);
-  }
-  roundClean() {
-    $t.fill(0);
-  }
-  destroy() {
-    this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
-  }
-}
-const vi = /* @__PURE__ */ Xo(() => new ei());
-export {
-  gi as R,
-  _i as a,
-  ri as b,
-  pi as c,
-  ne as d,
-  Jt as e,
-  st as f,
-  yi as g,
-  Le as h,
-  tn as i,
-  Hi as j,
-  Ei as k,
-  Si as l,
-  z as m,
-  se as n,
-  Ii as o,
-  jn as p,
-  vi as q,
-  Bi as r,
-  fi as s,
-  wo as u
-};