@prosopo/procaptcha-bundle 3.0.12 → 3.1.6

package/dist/bundle/nobleChunk-Qozzkbsq.js

@@ -1,3648 +0,0 @@
-function Ss(e) {
-  return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
-}
-function et(e) {
-  if (!Number.isSafeInteger(e) || e < 0)
-    throw new Error("positive integer expected, got " + e);
-}
-function ie(e, ...t) {
-  if (!Ss(e))
-    throw new Error("Uint8Array expected");
-  if (t.length > 0 && !t.includes(e.length))
-    throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
-}
-function Tn(e) {
-  if (typeof e != "function" || typeof e.create != "function")
-    throw new Error("Hash should be wrapped by utils.createHasher");
-  et(e.outputLen), et(e.blockLen);
-}
-function te(e, t = !0) {
-  if (e.destroyed)
-    throw new Error("Hash instance has been destroyed");
-  if (t && e.finished)
-    throw new Error("Hash#digest() has already been called");
-}
-function Nn(e, t) {
-  ie(e);
-  const n = t.outputLen;
-  if (e.length < n)
-    throw new Error("digestInto() expects output buffer of length at least " + n);
-}
-function qt(e) {
-  return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
-}
-function it(...e) {
-  for (let t = 0; t < e.length; t++)
-    e[t].fill(0);
-}
-function Ee(e) {
-  return new DataView(e.buffer, e.byteOffset, e.byteLength);
-}
-function ct(e, t) {
-  return e << 32 - t | e >>> t;
-}
-function R(e, t) {
-  return e << t | e >>> 32 - t >>> 0;
-}
-const Rn = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-function Gn(e) {
-  return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
-}
-const xt = Rn ? (e) => e : (e) => Gn(e);
-function Is(e) {
-  for (let t = 0; t < e.length; t++)
-    e[t] = Gn(e[t]);
-  return e;
-}
-const Dt = Rn ? (e) => e : Is;
-function qn(e) {
-  if (typeof e != "string")
-    throw new Error("string expected");
-  return new Uint8Array(new TextEncoder().encode(e));
-}
-function Tt(e) {
-  return typeof e == "string" && (e = qn(e)), ie(e), e;
-}
-function hn(e) {
-  return typeof e == "string" && (e = qn(e)), ie(e), e;
-}
-function Mn(e, t) {
-  if (t !== void 0 && {}.toString.call(t) !== "[object Object]")
-    throw new Error("options should be object or undefined");
-  return Object.assign(e, t);
-}
-let Pe = class {
-};
-function Vn(e) {
-  const t = (s) => e().update(Tt(s)).digest(), n = e();
-  return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
-}
-function Us(e) {
-  const t = (s, r) => e(r).update(Tt(s)).digest(), n = e({});
-  return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = (s) => e(s), t;
-}
-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 $s(e, t, n, s) {
-  if (typeof e.setBigUint64 == "function")
-    return e.setBigUint64(t, n, s);
-  const r = BigInt(32), o = BigInt(4294967295), i = Number(n >> r & o), c = Number(n & o), f = s ? 4 : 0, l = s ? 0 : 4;
-  e.setUint32(t + f, i, s), e.setUint32(t + l, c, s);
-}
-function Ls(e, t, n) {
-  return e & t ^ ~e & n;
-}
-function Ds(e, t, n) {
-  return e & t ^ e & n ^ t & n;
-}
-let Zn = class extends Pe {
-  constructor(t, n, s, r) {
-    super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = t, this.outputLen = n, this.padOffset = s, this.isLE = r, this.buffer = new Uint8Array(t), this.view = Ee(this.buffer);
-  }
-  update(t) {
-    te(this), t = Tt(t), ie(t);
-    const { view: n, buffer: s, blockLen: r } = this, o = t.length;
-    for (let i = 0; i < o; ) {
-      const c = Math.min(r - this.pos, o - i);
-      if (c === r) {
-        const f = Ee(t);
-        for (; r <= o - i; i += r)
-          this.process(f, i);
-        continue;
-      }
-      s.set(t.subarray(i, i + c), this.pos), this.pos += c, i += c, this.pos === r && (this.process(n, 0), this.pos = 0);
-    }
-    return this.length += t.length, this.roundClean(), this;
-  }
-  digestInto(t) {
-    te(this), Nn(t, this), this.finished = !0;
-    const { buffer: n, view: s, blockLen: r, isLE: o } = this;
-    let { pos: i } = this;
-    n[i++] = 128, it(this.buffer.subarray(i)), this.padOffset > r - i && (this.process(s, 0), i = 0);
-    for (let a = i; a < r; a++)
-      n[a] = 0;
-    $s(s, r - 8, BigInt(this.length * 8), o), this.process(s, 0);
-    const c = Ee(t), 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], o);
-  }
-  digest() {
-    const { buffer: t, outputLen: n } = this;
-    this.digestInto(t);
-    const s = t.slice(0, n);
-    return this.destroy(), s;
-  }
-  _cloneInto(t) {
-    t || (t = new this.constructor()), t.set(...this.get());
-    const { blockLen: n, buffer: s, length: r, finished: o, destroyed: i, pos: c } = this;
-    return t.destroyed = i, t.finished = o, t.length = r, t.pos = c, r % n && t.buffer.set(s), t;
-  }
-  clone() {
-    return this._cloneInto();
-  }
-};
-const yt = /* @__PURE__ */ Uint32Array.from([
-  1779033703,
-  3144134277,
-  1013904242,
-  2773480762,
-  1359893119,
-  2600822924,
-  528734635,
-  1541459225
-]);
-const X = /* @__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), ln = /* @__PURE__ */ BigInt(32);
-function zn(e, t = !1) {
-  return t ? { h: Number(e & xe), l: Number(e >> ln & xe) } : { h: Number(e >> ln & xe) | 0, l: Number(e & xe) | 0 };
-}
-function Cs(e, t = !1) {
-  const n = e.length;
-  let s = new Uint32Array(n), r = new Uint32Array(n);
-  for (let o = 0; o < n; o++) {
-    const { h: i, l: c } = zn(e[o], t);
-    [s[o], r[o]] = [i, c];
-  }
-  return [s, r];
-}
-const dn = (e, t, n) => e >>> n, un = (e, t, n) => e << 32 - n | t >>> n, Ct = (e, t, n) => e >>> n | t << 32 - n, kt = (e, t, n) => e << 32 - n | t >>> n, fe = (e, t, n) => e << 64 - n | t >>> n - 32, ae = (e, t, n) => e >>> n - 32 | t << 64 - n, ks = (e, t) => t, Os = (e, t) => e;
-function rt(e, t, n, s) {
-  const r = (t >>> 0) + (s >>> 0);
-  return { h: e + n + (r / 2 ** 32 | 0) | 0, l: r | 0 };
-}
-const Qe = (e, t, n) => (e >>> 0) + (t >>> 0) + (n >>> 0), Je = (e, t, n, s) => t + n + s + (e / 2 ** 32 | 0) | 0, Ts = (e, t, n, s) => (e >>> 0) + (t >>> 0) + (n >>> 0) + (s >>> 0), Ns = (e, t, n, s, r) => t + n + s + r + (e / 2 ** 32 | 0) | 0, Rs = (e, t, n, s, r) => (e >>> 0) + (t >>> 0) + (n >>> 0) + (s >>> 0) + (r >>> 0), Gs = (e, t, n, s, r, o) => t + n + s + r + o + (e / 2 ** 32 | 0) | 0, j = /* @__PURE__ */ Uint32Array.from([
-  4089235720,
-  1779033703,
-  2227873595,
-  3144134277,
-  4271175723,
-  1013904242,
-  1595750129,
-  2773480762,
-  2917565137,
-  1359893119,
-  725511199,
-  2600822924,
-  4215389547,
-  528734635,
-  327033209,
-  1541459225
-]), U = /* @__PURE__ */ new Uint32Array(32);
-function pt(e, t, n, s, r, o) {
-  const i = r[o], c = r[o + 1];
-  let f = U[2 * e], l = U[2 * e + 1], h = U[2 * t], a = U[2 * t + 1], d = U[2 * n], u = U[2 * n + 1], y = U[2 * s], b = U[2 * s + 1], w = Qe(f, h, i);
-  l = Je(w, l, a, c), f = w | 0, { Dh: b, Dl: y } = { Dh: b ^ l, Dl: y ^ f }, { Dh: b, Dl: y } = { Dh: ks(b, y), Dl: Os(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) }, U[2 * e] = f, U[2 * e + 1] = l, U[2 * t] = h, U[2 * t + 1] = a, U[2 * n] = d, U[2 * n + 1] = u, U[2 * s] = y, U[2 * s + 1] = b;
-}
-function mt(e, t, n, s, r, o) {
-  const i = r[o], c = r[o + 1];
-  let f = U[2 * e], l = U[2 * e + 1], h = U[2 * t], a = U[2 * t + 1], d = U[2 * n], u = U[2 * n + 1], y = U[2 * s], b = U[2 * s + 1], w = Qe(f, h, i);
-  l = Je(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) }, U[2 * e] = f, U[2 * e + 1] = l, U[2 * t] = h, U[2 * t + 1] = a, U[2 * n] = d, U[2 * n + 1] = u, U[2 * s] = y, U[2 * s + 1] = b;
-}
-function qs(e, t = {}, n, s, r) {
-  if (et(n), e < 0 || e > n)
-    throw new Error("outputLen bigger than keyLen");
-  const { key: o, salt: i, personalization: c } = t;
-  if (o !== void 0 && (o.length < 1 || o.length > n))
-    throw new Error("key length must be undefined or 1.." + n);
-  if (i !== void 0 && i.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 Ms extends Pe {
-  constructor(t, n) {
-    super(), this.finished = !1, this.destroyed = !1, this.length = 0, this.pos = 0, et(t), et(n), this.blockLen = t, this.outputLen = n, this.buffer = new Uint8Array(t), this.buffer32 = qt(this.buffer);
-  }
-  update(t) {
-    te(this), t = Tt(t), ie(t);
-    const { blockLen: n, buffer: s, buffer32: r } = this, o = t.length, i = t.byteOffset, c = t.buffer;
-    for (let f = 0; f < o; ) {
-      this.pos === n && (Dt(r), this.compress(r, 0, !1), Dt(r), this.pos = 0);
-      const l = Math.min(n - this.pos, o - f), h = i + f;
-      if (l === n && !(h % 4) && f + l < o) {
-        const a = new Uint32Array(c, h, Math.floor((o - f) / 4));
-        Dt(a);
-        for (let d = 0; f + n < o; d += r.length, f += n)
-          this.length += n, this.compress(a, d, !1);
-        Dt(a);
-        continue;
-      }
-      s.set(t.subarray(f, f + l), this.pos), this.pos += l, this.length += l, f += l;
-    }
-    return this;
-  }
-  digestInto(t) {
-    te(this), Nn(t, this);
-    const { pos: n, buffer32: s } = this;
-    this.finished = !0, it(this.buffer.subarray(n)), Dt(s), this.compress(s, 0, !0), Dt(s);
-    const r = qt(t);
-    this.get().forEach((o, i) => r[i] = xt(o));
-  }
-  digest() {
-    const { buffer: t, outputLen: n } = this;
-    this.digestInto(t);
-    const s = t.slice(0, n);
-    return this.destroy(), s;
-  }
-  _cloneInto(t) {
-    const { buffer: n, length: s, finished: r, destroyed: o, outputLen: i, pos: c } = this;
-    return t || (t = new this.constructor({ dkLen: i })), t.set(...this.get()), t.buffer.set(n), t.destroyed = o, t.finished = r, t.length = s, t.pos = c, t.outputLen = i, t;
-  }
-  clone() {
-    return this._cloneInto();
-  }
-}
-class Vs extends Ms {
-  constructor(t = {}) {
-    const n = t.dkLen === void 0 ? 64 : t.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, t, 64, 16, 16);
-    let { key: s, personalization: r, salt: o } = t, i = 0;
-    if (s !== void 0 && (s = Tt(s), i = s.length), this.v0l ^= this.outputLen | i << 8 | 65536 | 1 << 24, o !== void 0) {
-      o = Tt(o);
-      const c = qt(o);
-      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 = Tt(r);
-      const c = qt(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: t, v0h: n, v1l: s, v1h: r, v2l: o, v2h: i, v3l: c, v3h: f, v4l: l, v4h: h, v5l: a, v5h: d, v6l: u, v6h: y, v7l: b, v7h: w } = this;
-    return [t, n, s, r, o, i, c, f, l, h, a, d, u, y, b, w];
-  }
-  // prettier-ignore
-  set(t, n, s, r, o, i, c, f, l, h, a, d, u, y, b, w) {
-    this.v0l = t | 0, this.v0h = n | 0, this.v1l = s | 0, this.v1h = r | 0, this.v2l = o | 0, this.v2h = i | 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(t, n, s) {
-    this.get().forEach((f, l) => U[l] = f), U.set(j, 16);
-    let { h: r, l: o } = zn(BigInt(this.length));
-    U[24] = j[8] ^ o, U[25] = j[9] ^ r, s && (U[28] = ~U[28], U[29] = ~U[29]);
-    let i = 0;
-    const c = vs;
-    for (let f = 0; f < 12; f++)
-      pt(0, 4, 8, 12, t, n + 2 * c[i++]), mt(0, 4, 8, 12, t, n + 2 * c[i++]), pt(1, 5, 9, 13, t, n + 2 * c[i++]), mt(1, 5, 9, 13, t, n + 2 * c[i++]), pt(2, 6, 10, 14, t, n + 2 * c[i++]), mt(2, 6, 10, 14, t, n + 2 * c[i++]), pt(3, 7, 11, 15, t, n + 2 * c[i++]), mt(3, 7, 11, 15, t, n + 2 * c[i++]), pt(0, 5, 10, 15, t, n + 2 * c[i++]), mt(0, 5, 10, 15, t, n + 2 * c[i++]), pt(1, 6, 11, 12, t, n + 2 * c[i++]), mt(1, 6, 11, 12, t, n + 2 * c[i++]), pt(2, 7, 8, 13, t, n + 2 * c[i++]), mt(2, 7, 8, 13, t, n + 2 * c[i++]), pt(3, 4, 9, 14, t, n + 2 * c[i++]), mt(3, 4, 9, 14, t, n + 2 * c[i++]);
-    this.v0l ^= U[0] ^ U[16], this.v0h ^= U[1] ^ U[17], this.v1l ^= U[2] ^ U[18], this.v1h ^= U[3] ^ U[19], this.v2l ^= U[4] ^ U[20], this.v2h ^= U[5] ^ U[21], this.v3l ^= U[6] ^ U[22], this.v3h ^= U[7] ^ U[23], this.v4l ^= U[8] ^ U[24], this.v4h ^= U[9] ^ U[25], this.v5l ^= U[10] ^ U[26], this.v5h ^= U[11] ^ U[27], this.v6l ^= U[12] ^ U[28], this.v6h ^= U[13] ^ U[29], this.v7l ^= U[14] ^ U[30], this.v7h ^= U[15] ^ U[31], it(U);
-  }
-  destroy() {
-    this.destroyed = !0, it(this.buffer32), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
-  }
-}
-const Zs = /* @__PURE__ */ Us((e) => new Vs(e));
-const ii = Zs;
-let jn = class extends Pe {
-  constructor(t, n) {
-    super(), this.finished = !1, this.destroyed = !1, Tn(t);
-    const s = Tt(n);
-    if (this.iHash = t.create(), typeof this.iHash.update != "function")
-      throw new Error("Expected instance of class which extends utils.Hash");
-    this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
-    const r = this.blockLen, o = new Uint8Array(r);
-    o.set(s.length > r ? t.create().update(s).digest() : s);
-    for (let i = 0; i < o.length; i++)
-      o[i] ^= 54;
-    this.iHash.update(o), this.oHash = t.create();
-    for (let i = 0; i < o.length; i++)
-      o[i] ^= 106;
-    this.oHash.update(o), it(o);
-  }
-  update(t) {
-    return te(this), this.iHash.update(t), this;
-  }
-  digestInto(t) {
-    te(this), ie(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
-  }
-  digest() {
-    const t = new Uint8Array(this.oHash.outputLen);
-    return this.digestInto(t), t;
-  }
-  _cloneInto(t) {
-    t || (t = Object.create(Object.getPrototypeOf(this), {}));
-    const { oHash: n, iHash: s, finished: r, destroyed: o, blockLen: i, outputLen: c } = this;
-    return t = t, t.finished = r, t.destroyed = o, t.blockLen = i, t.outputLen = c, t.oHash = n._cloneInto(t.oHash), t.iHash = s._cloneInto(t.iHash), t;
-  }
-  clone() {
-    return this._cloneInto();
-  }
-  destroy() {
-    this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
-  }
-};
-const Wn = (e, t, n) => new jn(e, t).update(n).digest();
-Wn.create = (e, t) => new jn(e, t);
-function zs(e, t, n, s) {
-  Tn(e);
-  const r = Mn({ dkLen: 32, asyncTick: 10 }, s), { c: o, dkLen: i, asyncTick: c } = r;
-  if (et(o), et(i), et(c), o < 1)
-    throw new Error("iterations (c) should be >= 1");
-  const f = hn(t), l = hn(n), h = new Uint8Array(i), a = Wn.create(e, f), d = a._cloneInto().update(l);
-  return { c: o, dkLen: i, asyncTick: c, DK: h, PRF: a, PRFSalt: d };
-}
-function js(e, t, n, s, r) {
-  return e.destroy(), t.destroy(), s && s.destroy(), it(r), n;
-}
-function Fn(e, t, n, s) {
-  const { c: r, dkLen: o, DK: i, PRF: c, PRFSalt: f } = zs(e, t, n, s);
-  let l;
-  const h = new Uint8Array(4), a = Ee(h), d = new Uint8Array(c.outputLen);
-  for (let u = 1, y = 0; y < o; u++, y += c.outputLen) {
-    const b = i.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 H = 0; H < b.length; H++)
-        b[H] ^= d[H];
-    }
-  }
-  return js(c, f, i, l, d);
-}
-const Ws = /* @__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 Fs = class extends Zn {
-  constructor(t = 32) {
-    super(64, t, 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: t, B: n, C: s, D: r, E: o, F: i, G: c, H: f } = this;
-    return [t, n, s, r, o, i, c, f];
-  }
-  // prettier-ignore
-  set(t, n, s, r, o, i, c, f) {
-    this.A = t | 0, this.B = n | 0, this.C = s | 0, this.D = r | 0, this.E = o | 0, this.F = i | 0, this.G = c | 0, this.H = f | 0;
-  }
-  process(t, n) {
-    for (let a = 0; a < 16; a++, n += 4)
-      Bt[a] = t.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: o, D: i, 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 + Ls(c, f, l) + Ws[a] + Bt[a] | 0, b = (ct(s, 2) ^ ct(s, 13) ^ ct(s, 22)) + Ds(s, r, o) | 0;
-      h = l, l = f, f = c, c = i + u | 0, i = o, o = r, r = s, s = u + b | 0;
-    }
-    s = s + this.A | 0, r = r + this.B | 0, o = o + this.C | 0, i = i + 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, o, i, c, f, l, h);
-  }
-  roundClean() {
-    it(Bt);
-  }
-  destroy() {
-    this.set(0, 0, 0, 0, 0, 0, 0, 0), it(this.buffer);
-  }
-};
-const Kn = Cs([
-  "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((e) => BigInt(e))), Ks = Kn[0], Ys = Kn[1], At = /* @__PURE__ */ new Uint32Array(80), Et = /* @__PURE__ */ new Uint32Array(80);
-let Xs = class extends Zn {
-  constructor(t = 64) {
-    super(128, t, 16, !1), this.Ah = X[0] | 0, this.Al = X[1] | 0, this.Bh = X[2] | 0, this.Bl = X[3] | 0, this.Ch = X[4] | 0, this.Cl = X[5] | 0, this.Dh = X[6] | 0, this.Dl = X[7] | 0, this.Eh = X[8] | 0, this.El = X[9] | 0, this.Fh = X[10] | 0, this.Fl = X[11] | 0, this.Gh = X[12] | 0, this.Gl = X[13] | 0, this.Hh = X[14] | 0, this.Hl = X[15] | 0;
-  }
-  // prettier-ignore
-  get() {
-    const { Ah: t, Al: n, Bh: s, Bl: r, Ch: o, Cl: i, Dh: c, Dl: f, Eh: l, El: h, Fh: a, Fl: d, Gh: u, Gl: y, Hh: b, Hl: w } = this;
-    return [t, n, s, r, o, i, c, f, l, h, a, d, u, y, b, w];
-  }
-  // prettier-ignore
-  set(t, n, s, r, o, i, c, f, l, h, a, d, u, y, b, w) {
-    this.Ah = t | 0, this.Al = n | 0, this.Bh = s | 0, this.Bl = r | 0, this.Ch = o | 0, this.Cl = i | 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(t, n) {
-    for (let p = 0; p < 16; p++, n += 4)
-      At[p] = t.getUint32(n), Et[p] = t.getUint32(n += 4);
-    for (let p = 16; p < 80; p++) {
-      const D = At[p - 15] | 0, m = Et[p - 15] | 0, $ = Ct(D, m, 1) ^ Ct(D, m, 8) ^ dn(D, m, 7), C = kt(D, m, 1) ^ kt(D, m, 8) ^ un(D, m, 7), _ = At[p - 2] | 0, x = Et[p - 2] | 0, A = Ct(_, x, 19) ^ fe(_, x, 61) ^ dn(_, x, 6), g = kt(_, x, 19) ^ ae(_, x, 61) ^ un(_, x, 6), B = Ts(C, g, Et[p - 7], Et[p - 16]), E = Ns(B, $, A, At[p - 7], At[p - 16]);
-      At[p] = E | 0, Et[p] = B | 0;
-    }
-    let { Ah: s, Al: r, Bh: o, Bl: i, Ch: c, Cl: f, Dh: l, Dl: h, Eh: a, El: d, Fh: u, Fl: y, Gh: b, Gl: w, Hh: H, Hl: v } = 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), $ = a & u ^ ~a & b, C = d & y ^ ~d & w, _ = Rs(v, m, C, Ys[p], Et[p]), x = Gs(_, H, D, $, Ks[p], At[p]), A = _ | 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), E = s & o ^ s & c ^ o & c, I = r & i ^ r & f ^ i & f;
-      H = b | 0, v = 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, A | 0), l = c | 0, h = f | 0, c = o | 0, f = i | 0, o = s | 0, i = r | 0;
-      const S = Qe(A, B, I);
-      s = Je(S, x, g, E), r = S | 0;
-    }
-    ({ h: s, l: r } = rt(this.Ah | 0, this.Al | 0, s | 0, r | 0)), { h: o, l: i } = rt(this.Bh | 0, this.Bl | 0, o | 0, i | 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: H, l: v } = rt(this.Hh | 0, this.Hl | 0, H | 0, v | 0), this.set(s, r, o, i, c, f, l, h, a, d, u, y, b, w, H, v);
-  }
-  roundClean() {
-    it(At, Et);
-  }
-  destroy() {
-    it(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
-  }
-};
-const tn = /* @__PURE__ */ Vn(() => new Fs()), Ps = /* @__PURE__ */ Vn(() => new Xs());
-function xn(e, t, n, s, r, o) {
-  let i = e[t++] ^ n[s++], c = e[t++] ^ n[s++], f = e[t++] ^ n[s++], l = e[t++] ^ n[s++], h = e[t++] ^ n[s++], a = e[t++] ^ n[s++], d = e[t++] ^ n[s++], u = e[t++] ^ n[s++], y = e[t++] ^ n[s++], b = e[t++] ^ n[s++], w = e[t++] ^ n[s++], H = e[t++] ^ n[s++], v = e[t++] ^ n[s++], p = e[t++] ^ n[s++], D = e[t++] ^ n[s++], m = e[t++] ^ n[s++], $ = i, C = c, _ = f, x = l, A = h, g = a, B = d, E = u, I = y, S = b, L = w, O = H, k = v, G = p, N = D, T = m;
-  for (let M = 0; M < 8; M += 2)
-    A ^= R($ + k | 0, 7), I ^= R(A + $ | 0, 9), k ^= R(I + A | 0, 13), $ ^= R(k + I | 0, 18), S ^= R(g + C | 0, 7), G ^= R(S + g | 0, 9), C ^= R(G + S | 0, 13), g ^= R(C + G | 0, 18), N ^= R(L + B | 0, 7), _ ^= R(N + L | 0, 9), B ^= R(_ + N | 0, 13), L ^= R(B + _ | 0, 18), x ^= R(T + O | 0, 7), E ^= R(x + T | 0, 9), O ^= R(E + x | 0, 13), T ^= R(O + E | 0, 18), C ^= R($ + x | 0, 7), _ ^= R(C + $ | 0, 9), x ^= R(_ + C | 0, 13), $ ^= R(x + _ | 0, 18), B ^= R(g + A | 0, 7), E ^= R(B + g | 0, 9), A ^= R(E + B | 0, 13), g ^= R(A + E | 0, 18), O ^= R(L + S | 0, 7), I ^= R(O + L | 0, 9), S ^= R(I + O | 0, 13), L ^= R(S + I | 0, 18), k ^= R(T + N | 0, 7), G ^= R(k + T | 0, 9), N ^= R(G + k | 0, 13), T ^= R(N + G | 0, 18);
-  r[o++] = i + $ | 0, r[o++] = c + C | 0, r[o++] = f + _ | 0, r[o++] = l + x | 0, r[o++] = h + A | 0, r[o++] = a + g | 0, r[o++] = d + B | 0, r[o++] = u + E | 0, r[o++] = y + I | 0, r[o++] = b + S | 0, r[o++] = w + L | 0, r[o++] = H + O | 0, r[o++] = v + k | 0, r[o++] = p + G | 0, r[o++] = D + N | 0, r[o++] = m + T | 0;
-}
-function Ce(e, t, n, s, r) {
-  let o = s + 0, i = s + 16 * r;
-  for (let c = 0; c < 16; c++)
-    n[i + c] = e[t + (2 * r - 1) * 16 + c];
-  for (let c = 0; c < r; c++, o += 16, t += 16)
-    xn(n, i, e, t, n, o), c > 0 && (i += 16), xn(n, o, e, t += 16, n, i);
-}
-function Qs(e, t, n) {
-  const s = Mn({
-    dkLen: 32,
-    asyncTick: 10,
-    maxmem: 1073742848
-  }, n), { N: r, r: o, p: i, dkLen: c, asyncTick: f, maxmem: l, onProgress: h } = s;
-  if (et(r), et(o), et(i), et(c), et(f), et(l), h !== void 0 && typeof h != "function")
-    throw new Error("progressCb should be function");
-  const a = 128 * o, 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 (i < 0 || i > (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 + i) > l)
-    throw new Error("Scrypt: memused is bigger than maxMem. Expected 128 * r * (N + p) > maxmem of " + l);
-  const b = Fn(tn, e, t, { c: 1, dkLen: a * i }), w = qt(b), H = qt(new Uint8Array(a * r)), v = qt(new Uint8Array(a));
-  let p = () => {
-  };
-  if (h) {
-    const D = 2 * r * i, m = Math.max(Math.floor(D / 1e4), 1);
-    let $ = 0;
-    p = () => {
-      $++, h && (!($ % m) || $ === D) && h($ / D);
-    };
-  }
-  return { N: r, r: o, p: i, dkLen: c, blockSize32: d, V: H, B32: w, B: b, tmp: v, blockMixCb: p, asyncTick: f };
-}
-function Js(e, t, n, s, r) {
-  const o = Fn(tn, e, n, { c: 1, dkLen: t });
-  return it(n, s, r), o;
-}
-function ai(e, t, n) {
-  const { N: s, r, p: o, dkLen: i, blockSize32: c, V: f, B32: l, B: h, tmp: a, blockMixCb: d } = Qs(e, t, n);
-  Dt(l);
-  for (let u = 0; u < o; 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 H = 0; H < c; H++)
-        a[H] = l[y + H] ^ f[w * c + H];
-      Ce(a, 0, l, y, r), d();
-    }
-  }
-  return Dt(l), Js(e, i, h, f, a);
-}
-const Wt = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
-function en(e) {
-  return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
-}
-function ze(e) {
-  if (!Number.isSafeInteger(e) || e < 0)
-    throw new Error("positive integer expected, got " + e);
-}
-function ot(e, ...t) {
-  if (!en(e))
-    throw new Error("Uint8Array expected");
-  if (t.length > 0 && !t.includes(e.length))
-    throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
-}
-function t0(e) {
-  if (typeof e != "function" || typeof e.create != "function")
-    throw new Error("Hash should be wrapped by utils.createHasher");
-  ze(e.outputLen), ze(e.blockLen);
-}
-function He(e, t = !0) {
-  if (e.destroyed)
-    throw new Error("Hash instance has been destroyed");
-  if (t && e.finished)
-    throw new Error("Hash#digest() has already been called");
-}
-function e0(e, t) {
-  ot(e);
-  const n = t.outputLen;
-  if (e.length < n)
-    throw new Error("digestInto() expects output buffer of length at least " + n);
-}
-function ee(...e) {
-  for (let t = 0; t < e.length; t++)
-    e[t].fill(0);
-}
-function ke(e) {
-  return new DataView(e.buffer, e.byteOffset, e.byteLength);
-}
-function ft(e, t) {
-  return e << 32 - t | e >>> t;
-}
-const Yn = /* @ts-ignore */ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", n0 = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
-function Mt(e) {
-  if (ot(e), Yn)
-    return e.toHex();
-  let t = "";
-  for (let n = 0; n < e.length; n++)
-    t += n0[e[n]];
-  return t;
-}
-const lt = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
-function bn(e) {
-  if (e >= lt._0 && e <= lt._9)
-    return e - lt._0;
-  if (e >= lt.A && e <= lt.F)
-    return e - (lt.A - 10);
-  if (e >= lt.a && e <= lt.f)
-    return e - (lt.a - 10);
-}
-function nn(e) {
-  if (typeof e != "string")
-    throw new Error("hex string expected, got " + typeof e);
-  if (Yn)
-    return Uint8Array.fromHex(e);
-  const t = e.length, n = t / 2;
-  if (t % 2)
-    throw new Error("hex string expected, got unpadded hex of length " + t);
-  const s = new Uint8Array(n);
-  for (let r = 0, o = 0; r < n; r++, o += 2) {
-    const i = bn(e.charCodeAt(o)), c = bn(e.charCodeAt(o + 1));
-    if (i === void 0 || c === void 0) {
-      const f = e[o] + e[o + 1];
-      throw new Error('hex string expected, got non-hex character "' + f + '" at index ' + o);
-    }
-    s[r] = i * 16 + c;
-  }
-  return s;
-}
-function s0(e) {
-  if (typeof e != "string")
-    throw new Error("string expected");
-  return new Uint8Array(new TextEncoder().encode(e));
-}
-function sn(e) {
-  return typeof e == "string" && (e = s0(e)), ot(e), e;
-}
-function wt(...e) {
-  let t = 0;
-  for (let s = 0; s < e.length; s++) {
-    const r = e[s];
-    ot(r), t += r.length;
-  }
-  const n = new Uint8Array(t);
-  for (let s = 0, r = 0; s < e.length; s++) {
-    const o = e[s];
-    n.set(o, r), r += o.length;
-  }
-  return n;
-}
-let Xn = class {
-};
-function Pn(e) {
-  const t = (s) => e().update(sn(s)).digest(), n = e();
-  return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
-}
-function Qn(e = 32) {
-  if (Wt && typeof Wt.getRandomValues == "function")
-    return Wt.getRandomValues(new Uint8Array(e));
-  if (Wt && typeof Wt.randomBytes == "function")
-    return Uint8Array.from(Wt.randomBytes(e));
-  throw new Error("crypto.getRandomValues must be defined");
-}
-const rn = /* @__PURE__ */ BigInt(0), je = /* @__PURE__ */ BigInt(1);
-function Vt(e, t) {
-  if (typeof t != "boolean")
-    throw new Error(e + " boolean expected, got " + t);
-}
-function be(e) {
-  const t = e.toString(16);
-  return t.length & 1 ? "0" + t : t;
-}
-function Jn(e) {
-  if (typeof e != "string")
-    throw new Error("hex string expected, got " + typeof e);
-  return e === "" ? rn : BigInt("0x" + e);
-}
-function Ue(e) {
-  return Jn(Mt(e));
-}
-function ne(e) {
-  return ot(e), Jn(Mt(Uint8Array.from(e).reverse()));
-}
-function on(e, t) {
-  return nn(e.toString(16).padStart(t * 2, "0"));
-}
-function se(e, t) {
-  return on(e, t).reverse();
-}
-function V(e, t, n) {
-  let s;
-  if (typeof t == "string")
-    try {
-      s = nn(t);
-    } catch (o) {
-      throw new Error(e + " must be hex string or Uint8Array, cause: " + o);
-    }
-  else if (en(t))
-    s = Uint8Array.from(t);
-  else
-    throw new Error(e + " must be hex string or Uint8Array");
-  const r = s.length;
-  if (typeof n == "number" && r !== n)
-    throw new Error(e + " of length " + n + " expected, got " + r);
-  return s;
-}
-function r0(e, t) {
-  if (e.length !== t.length)
-    return !1;
-  let n = 0;
-  for (let s = 0; s < e.length; s++)
-    n |= e[s] ^ t[s];
-  return n === 0;
-}
-const Oe = (e) => typeof e == "bigint" && rn <= e;
-function i0(e, t, n) {
-  return Oe(e) && Oe(t) && Oe(n) && t <= e && e < n;
-}
-function Jt(e, t, n, s) {
-  if (!i0(t, n, s))
-    throw new Error("expected valid " + e + ": " + n + " <= n < " + s + ", got " + t);
-}
-function o0(e) {
-  let t;
-  for (t = 0; e > rn; e >>= je, t += 1)
-    ;
-  return t;
-}
-const ve = (e) => (je << BigInt(e)) - je;
-function c0(e, t, n) {
-  if (typeof e != "number" || e < 2)
-    throw new Error("hashLen must be a number");
-  if (typeof t != "number" || t < 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 o = s(e), i = s(e), c = 0;
-  const f = () => {
-    o.fill(1), i.fill(0), c = 0;
-  }, l = (...u) => n(i, o, ...u), h = (u = s(0)) => {
-    i = l(r(0), u), o = l(), u.length !== 0 && (i = l(r(1), u), o = l());
-  }, a = () => {
-    if (c++ >= 1e3)
-      throw new Error("drbg: tried 1000 values");
-    let u = 0;
-    const y = [];
-    for (; u < t; ) {
-      o = l();
-      const b = o.slice();
-      y.push(b), u += o.length;
-    }
-    return wt(...y);
-  };
-  return (u, y) => {
-    f(), h(u);
-    let b;
-    for (; !(b = y(a())); )
-      h();
-    return f(), b;
-  };
-}
-function ue(e, t, n = {}) {
-  if (!e || typeof e != "object")
-    throw new Error("expected valid options object");
-  function s(r, o, i) {
-    const c = e[r];
-    if (i && c === void 0)
-      return;
-    const f = typeof c;
-    if (f !== o || c === null)
-      throw new Error(`param "${r}" is invalid: expected ${o}, got ${f}`);
-  }
-  Object.entries(t).forEach(([r, o]) => s(r, o, !1)), Object.entries(n).forEach(([r, o]) => s(r, o, !0));
-}
-function _e(e) {
-  const t = /* @__PURE__ */ new WeakMap();
-  return (n, ...s) => {
-    const r = t.get(n);
-    if (r !== void 0)
-      return r;
-    const o = e(n, ...s);
-    return t.set(n, o), o;
-  };
-}
-const nt = BigInt(0), K = BigInt(1), Rt = /* @__PURE__ */ BigInt(2), f0 = /* @__PURE__ */ BigInt(3), ts = /* @__PURE__ */ BigInt(4), es = /* @__PURE__ */ BigInt(5), ns = /* @__PURE__ */ BigInt(8);
-function z(e, t) {
-  const n = e % t;
-  return n >= nt ? n : t + n;
-}
-function Z(e, t, n) {
-  let s = e;
-  for (; t-- > nt; )
-    s *= s, s %= n;
-  return s;
-}
-function wn(e, t) {
-  if (e === nt)
-    throw new Error("invert: expected non-zero number");
-  if (t <= nt)
-    throw new Error("invert: expected positive modulus, got " + t);
-  let n = z(e, t), s = t, r = nt, o = K;
-  for (; n !== nt; ) {
-    const c = s / n, f = s % n, l = r - o * c;
-    s = n, n = f, r = o, o = l;
-  }
-  if (s !== K)
-    throw new Error("invert: does not exist");
-  return z(r, t);
-}
-function ss(e, t) {
-  const n = (e.ORDER + K) / ts, s = e.pow(t, n);
-  if (!e.eql(e.sqr(s), t))
-    throw new Error("Cannot find square root");
-  return s;
-}
-function a0(e, t) {
-  const n = (e.ORDER - es) / ns, s = e.mul(t, Rt), r = e.pow(s, n), o = e.mul(t, r), i = e.mul(e.mul(o, Rt), r), c = e.mul(o, e.sub(i, e.ONE));
-  if (!e.eql(e.sqr(c), t))
-    throw new Error("Cannot find square root");
-  return c;
-}
-function h0(e) {
-  if (e < BigInt(3))
-    throw new Error("sqrt is not defined for small field");
-  let t = e - K, n = 0;
-  for (; t % Rt === nt; )
-    t /= Rt, n++;
-  let s = Rt;
-  const r = Zt(e);
-  for (; gn(r, s) === 1; )
-    if (s++ > 1e3)
-      throw new Error("Cannot find square root: probably non-prime P");
-  if (n === 1)
-    return ss;
-  let o = r.pow(s, t);
-  const i = (t + K) / Rt;
-  return function(f, l) {
-    if (f.is0(l))
-      return l;
-    if (gn(f, l) !== 1)
-      throw new Error("Cannot find square root");
-    let h = n, a = f.mul(f.ONE, o), d = f.pow(l, t), u = f.pow(l, i);
-    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 = K << BigInt(h - y - 1), H = f.pow(a, w);
-      h = y, a = f.sqr(H), d = f.mul(d, a), u = f.mul(u, H);
-    }
-    return u;
-  };
-}
-function l0(e) {
-  return e % ts === f0 ? ss : e % ns === es ? a0 : h0(e);
-}
-const Ot = (e, t) => (z(e, t) & K) === K, d0 = [
-  "create",
-  "isValid",
-  "is0",
-  "neg",
-  "inv",
-  "sqrt",
-  "sqr",
-  "eql",
-  "add",
-  "sub",
-  "mul",
-  "pow",
-  "div",
-  "addN",
-  "subN",
-  "mulN",
-  "sqrN"
-];
-function u0(e) {
-  const t = {
-    ORDER: "bigint",
-    MASK: "bigint",
-    BYTES: "number",
-    BITS: "number"
-  }, n = d0.reduce((s, r) => (s[r] = "function", s), t);
-  return ue(e, n), e;
-}
-function x0(e, t, n) {
-  if (n < nt)
-    throw new Error("invalid exponent, negatives unsupported");
-  if (n === nt)
-    return e.ONE;
-  if (n === K)
-    return t;
-  let s = e.ONE, r = t;
-  for (; n > nt; )
-    n & K && (s = e.mul(s, r)), r = e.sqr(r), n >>= K;
-  return s;
-}
-function rs(e, t, n = !1) {
-  const s = new Array(t.length).fill(n ? e.ZERO : void 0), r = t.reduce((i, c, f) => e.is0(c) ? i : (s[f] = i, e.mul(i, c)), e.ONE), o = e.inv(r);
-  return t.reduceRight((i, c, f) => e.is0(c) ? i : (s[f] = e.mul(i, s[f]), e.mul(i, c)), o), s;
-}
-function gn(e, t) {
-  const n = (e.ORDER - K) / Rt, s = e.pow(t, n), r = e.eql(s, e.ONE), o = e.eql(s, e.ZERO), i = e.eql(s, e.neg(e.ONE));
-  if (!r && !o && !i)
-    throw new Error("invalid Legendre symbol result");
-  return r ? 1 : o ? 0 : -1;
-}
-function b0(e, t) {
-  t !== void 0 && ze(t);
-  const n = t !== void 0 ? t : e.toString(2).length, s = Math.ceil(n / 8);
-  return { nBitLength: n, nByteLength: s };
-}
-function Zt(e, t, n = !1, s = {}) {
-  if (e <= nt)
-    throw new Error("invalid field: expected ORDER > 0, got " + e);
-  let r, o;
-  if (typeof t == "object" && t != null) {
-    if (s.sqrt || n)
-      throw new Error("cannot specify opts in two arguments");
-    const h = t;
-    h.BITS && (r = h.BITS), h.sqrt && (o = h.sqrt), typeof h.isLE == "boolean" && (n = h.isLE);
-  } else
-    typeof t == "number" && (r = t), s.sqrt && (o = s.sqrt);
-  const { nBitLength: i, nByteLength: c } = b0(e, r);
-  if (c > 2048)
-    throw new Error("invalid field: expected ORDER of <= 2048 bytes");
-  let f;
-  const l = Object.freeze({
-    ORDER: e,
-    isLE: n,
-    BITS: i,
-    BYTES: c,
-    MASK: ve(i),
-    ZERO: nt,
-    ONE: K,
-    create: (h) => z(h, e),
-    isValid: (h) => {
-      if (typeof h != "bigint")
-        throw new Error("invalid field element: expected bigint, got " + typeof h);
-      return nt <= h && h < e;
-    },
-    is0: (h) => h === nt,
-    // is valid and invertible
-    isValidNot0: (h) => !l.is0(h) && l.isValid(h),
-    isOdd: (h) => (h & K) === K,
-    neg: (h) => z(-h, e),
-    eql: (h, a) => h === a,
-    sqr: (h) => z(h * h, e),
-    add: (h, a) => z(h + a, e),
-    sub: (h, a) => z(h - a, e),
-    mul: (h, a) => z(h * a, e),
-    pow: (h, a) => x0(l, h, a),
-    div: (h, a) => z(h * wn(a, e), e),
-    // 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) => wn(h, e),
-    sqrt: o || ((h) => (f || (f = l0(e)), f(l, h))),
-    toBytes: (h) => n ? se(h, c) : on(h, c),
-    fromBytes: (h) => {
-      if (h.length !== c)
-        throw new Error("Field.fromBytes: expected " + c + " bytes, got " + h.length);
-      return n ? ne(h) : Ue(h);
-    },
-    // TODO: we don't need it here, move out to separate fn
-    invertBatch: (h) => rs(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 is(e) {
-  if (typeof e != "bigint")
-    throw new Error("field order must be bigint");
-  const t = e.toString(2).length;
-  return Math.ceil(t / 8);
-}
-function os(e) {
-  const t = is(e);
-  return t + Math.ceil(t / 2);
-}
-function w0(e, t, n = !1) {
-  const s = e.length, r = is(t), o = os(t);
-  if (s < 16 || s < o || s > 1024)
-    throw new Error("expected " + o + "-1024 bytes of input, got " + s);
-  const i = n ? ne(e) : Ue(e), c = z(i, t - K) + K;
-  return n ? se(c, r) : on(c, r);
-}
-function g0(e, t, n, s) {
-  if (typeof e.setBigUint64 == "function")
-    return e.setBigUint64(t, n, s);
-  const r = BigInt(32), o = BigInt(4294967295), i = Number(n >> r & o), c = Number(n & o), f = s ? 4 : 0, l = s ? 0 : 4;
-  e.setUint32(t + f, i, s), e.setUint32(t + l, c, s);
-}
-function y0(e, t, n) {
-  return e & t ^ ~e & n;
-}
-function p0(e, t, n) {
-  return e & t ^ e & n ^ t & n;
-}
-let cs = class extends Xn {
-  constructor(t, n, s, r) {
-    super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = t, this.outputLen = n, this.padOffset = s, this.isLE = r, this.buffer = new Uint8Array(t), this.view = ke(this.buffer);
-  }
-  update(t) {
-    He(this), t = sn(t), ot(t);
-    const { view: n, buffer: s, blockLen: r } = this, o = t.length;
-    for (let i = 0; i < o; ) {
-      const c = Math.min(r - this.pos, o - i);
-      if (c === r) {
-        const f = ke(t);
-        for (; r <= o - i; i += r)
-          this.process(f, i);
-        continue;
-      }
-      s.set(t.subarray(i, i + c), this.pos), this.pos += c, i += c, this.pos === r && (this.process(n, 0), this.pos = 0);
-    }
-    return this.length += t.length, this.roundClean(), this;
-  }
-  digestInto(t) {
-    He(this), e0(t, this), this.finished = !0;
-    const { buffer: n, view: s, blockLen: r, isLE: o } = this;
-    let { pos: i } = this;
-    n[i++] = 128, ee(this.buffer.subarray(i)), this.padOffset > r - i && (this.process(s, 0), i = 0);
-    for (let a = i; a < r; a++)
-      n[a] = 0;
-    g0(s, r - 8, BigInt(this.length * 8), o), this.process(s, 0);
-    const c = ke(t), 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], o);
-  }
-  digest() {
-    const { buffer: t, outputLen: n } = this;
-    this.digestInto(t);
-    const s = t.slice(0, n);
-    return this.destroy(), s;
-  }
-  _cloneInto(t) {
-    t || (t = new this.constructor()), t.set(...this.get());
-    const { blockLen: n, buffer: s, length: r, finished: o, destroyed: i, pos: c } = this;
-    return t.destroyed = i, t.finished = o, t.length = r, t.pos = c, r % n && t.buffer.set(s), t;
-  }
-  clone() {
-    return this._cloneInto();
-  }
-};
-const Ht = /* @__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), yn = /* @__PURE__ */ BigInt(32);
-function m0(e, t = !1) {
-  return t ? { h: Number(e & we), l: Number(e >> yn & we) } : { h: Number(e >> yn & we) | 0, l: Number(e & we) | 0 };
-}
-function B0(e, t = !1) {
-  const n = e.length;
-  let s = new Uint32Array(n), r = new Uint32Array(n);
-  for (let o = 0; o < n; o++) {
-    const { h: i, l: c } = m0(e[o], t);
-    [s[o], r[o]] = [i, c];
-  }
-  return [s, r];
-}
-const pn = (e, t, n) => e >>> n, mn = (e, t, n) => e << 32 - n | t >>> n, Ft = (e, t, n) => e >>> n | t << 32 - n, Kt = (e, t, n) => e << 32 - n | t >>> n, ge = (e, t, n) => e << 64 - n | t >>> n - 32, ye = (e, t, n) => e >>> n - 32 | t << 64 - n;
-function dt(e, t, n, s) {
-  const r = (t >>> 0) + (s >>> 0);
-  return { h: e + n + (r / 2 ** 32 | 0) | 0, l: r | 0 };
-}
-const A0 = (e, t, n) => (e >>> 0) + (t >>> 0) + (n >>> 0), E0 = (e, t, n, s) => t + n + s + (e / 2 ** 32 | 0) | 0, H0 = (e, t, n, s) => (e >>> 0) + (t >>> 0) + (n >>> 0) + (s >>> 0), _0 = (e, t, n, s, r) => t + n + s + r + (e / 2 ** 32 | 0) | 0, S0 = (e, t, n, s, r) => (e >>> 0) + (t >>> 0) + (n >>> 0) + (s >>> 0) + (r >>> 0), I0 = (e, t, n, s, r, o) => t + n + s + r + o + (e / 2 ** 32 | 0) | 0, U0 = /* @__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
-]), _t = /* @__PURE__ */ new Uint32Array(64);
-let v0 = class extends cs {
-  constructor(t = 32) {
-    super(64, t, 8, !1), this.A = Ht[0] | 0, this.B = Ht[1] | 0, this.C = Ht[2] | 0, this.D = Ht[3] | 0, this.E = Ht[4] | 0, this.F = Ht[5] | 0, this.G = Ht[6] | 0, this.H = Ht[7] | 0;
-  }
-  get() {
-    const { A: t, B: n, C: s, D: r, E: o, F: i, G: c, H: f } = this;
-    return [t, n, s, r, o, i, c, f];
-  }
-  // prettier-ignore
-  set(t, n, s, r, o, i, c, f) {
-    this.A = t | 0, this.B = n | 0, this.C = s | 0, this.D = r | 0, this.E = o | 0, this.F = i | 0, this.G = c | 0, this.H = f | 0;
-  }
-  process(t, n) {
-    for (let a = 0; a < 16; a++, n += 4)
-      _t[a] = t.getUint32(n, !1);
-    for (let a = 16; a < 64; a++) {
-      const d = _t[a - 15], u = _t[a - 2], y = ft(d, 7) ^ ft(d, 18) ^ d >>> 3, b = ft(u, 17) ^ ft(u, 19) ^ u >>> 10;
-      _t[a] = b + _t[a - 7] + y + _t[a - 16] | 0;
-    }
-    let { A: s, B: r, C: o, D: i, 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 + y0(c, f, l) + U0[a] + _t[a] | 0, b = (ft(s, 2) ^ ft(s, 13) ^ ft(s, 22)) + p0(s, r, o) | 0;
-      h = l, l = f, f = c, c = i + u | 0, i = o, o = r, r = s, s = u + b | 0;
-    }
-    s = s + this.A | 0, r = r + this.B | 0, o = o + this.C | 0, i = i + 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, o, i, c, f, l, h);
-  }
-  roundClean() {
-    ee(_t);
-  }
-  destroy() {
-    this.set(0, 0, 0, 0, 0, 0, 0, 0), ee(this.buffer);
-  }
-};
-const fs = B0([
-  "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((e) => BigInt(e))), $0 = fs[0], L0 = fs[1], St = /* @__PURE__ */ new Uint32Array(80), It = /* @__PURE__ */ new Uint32Array(80);
-let D0 = class extends cs {
-  constructor(t = 64) {
-    super(128, t, 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: t, Al: n, Bh: s, Bl: r, Ch: o, Cl: i, Dh: c, Dl: f, Eh: l, El: h, Fh: a, Fl: d, Gh: u, Gl: y, Hh: b, Hl: w } = this;
-    return [t, n, s, r, o, i, c, f, l, h, a, d, u, y, b, w];
-  }
-  // prettier-ignore
-  set(t, n, s, r, o, i, c, f, l, h, a, d, u, y, b, w) {
-    this.Ah = t | 0, this.Al = n | 0, this.Bh = s | 0, this.Bl = r | 0, this.Ch = o | 0, this.Cl = i | 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(t, n) {
-    for (let p = 0; p < 16; p++, n += 4)
-      St[p] = t.getUint32(n), It[p] = t.getUint32(n += 4);
-    for (let p = 16; p < 80; p++) {
-      const D = St[p - 15] | 0, m = It[p - 15] | 0, $ = Ft(D, m, 1) ^ Ft(D, m, 8) ^ pn(D, m, 7), C = Kt(D, m, 1) ^ Kt(D, m, 8) ^ mn(D, m, 7), _ = St[p - 2] | 0, x = It[p - 2] | 0, A = Ft(_, x, 19) ^ ge(_, x, 61) ^ pn(_, x, 6), g = Kt(_, x, 19) ^ ye(_, x, 61) ^ mn(_, x, 6), B = H0(C, g, It[p - 7], It[p - 16]), E = _0(B, $, A, St[p - 7], St[p - 16]);
-      St[p] = E | 0, It[p] = B | 0;
-    }
-    let { Ah: s, Al: r, Bh: o, Bl: i, Ch: c, Cl: f, Dh: l, Dl: h, Eh: a, El: d, Fh: u, Fl: y, Gh: b, Gl: w, Hh: H, Hl: v } = this;
-    for (let p = 0; p < 80; p++) {
-      const D = Ft(a, d, 14) ^ Ft(a, d, 18) ^ ge(a, d, 41), m = Kt(a, d, 14) ^ Kt(a, d, 18) ^ ye(a, d, 41), $ = a & u ^ ~a & b, C = d & y ^ ~d & w, _ = S0(v, m, C, L0[p], It[p]), x = I0(_, H, D, $, $0[p], St[p]), A = _ | 0, g = Ft(s, r, 28) ^ ge(s, r, 34) ^ ge(s, r, 39), B = Kt(s, r, 28) ^ ye(s, r, 34) ^ ye(s, r, 39), E = s & o ^ s & c ^ o & c, I = r & i ^ r & f ^ i & f;
-      H = b | 0, v = 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, A | 0), l = c | 0, h = f | 0, c = o | 0, f = i | 0, o = s | 0, i = r | 0;
-      const S = A0(A, B, I);
-      s = E0(S, x, g, E), r = S | 0;
-    }
-    ({ h: s, l: r } = dt(this.Ah | 0, this.Al | 0, s | 0, r | 0)), { h: o, l: i } = dt(this.Bh | 0, this.Bl | 0, o | 0, i | 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: H, l: v } = dt(this.Hh | 0, this.Hl | 0, H | 0, v | 0), this.set(s, r, o, i, c, f, l, h, a, d, u, y, b, w, H, v);
-  }
-  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 C0 = /* @__PURE__ */ Pn(() => new v0()), k0 = /* @__PURE__ */ Pn(() => new D0());
-const re = BigInt(0), Gt = BigInt(1);
-function he(e, t) {
-  const n = t.negate();
-  return e ? n : t;
-}
-function as(e, t, n) {
-  const s = t === "pz" ? (i) => i.pz : (i) => i.ez, r = rs(e.Fp, n.map(s));
-  return n.map((i, c) => i.toAffine(r[c])).map(e.fromAffine);
-}
-function hs(e, t) {
-  if (!Number.isSafeInteger(e) || e <= 0 || e > t)
-    throw new Error("invalid window size, expected [1.." + t + "], got W=" + e);
-}
-function Te(e, t) {
-  hs(e, t);
-  const n = Math.ceil(t / e) + 1, s = 2 ** (e - 1), r = 2 ** e, o = ve(e), i = BigInt(e);
-  return { windows: n, windowSize: s, mask: o, maxNumber: r, shiftBy: i };
-}
-function Bn(e, t, n) {
-  const { windowSize: s, mask: r, maxNumber: o, shiftBy: i } = n;
-  let c = Number(e & r), f = e >> i;
-  c > s && (c -= o, f += Gt);
-  const l = t * s, h = l + Math.abs(c) - 1, a = c === 0, d = c < 0, u = t % 2 !== 0;
-  return { nextN: f, offset: h, isZero: a, isNeg: d, isNegF: u, offsetF: l };
-}
-function O0(e, t) {
-  if (!Array.isArray(e))
-    throw new Error("array expected");
-  e.forEach((n, s) => {
-    if (!(n instanceof t))
-      throw new Error("invalid point at index " + s);
-  });
-}
-function T0(e, t) {
-  if (!Array.isArray(e))
-    throw new Error("array of scalars expected");
-  e.forEach((n, s) => {
-    if (!t.isValid(n))
-      throw new Error("invalid scalar at index " + s);
-  });
-}
-const Ne = /* @__PURE__ */ new WeakMap(), ls = /* @__PURE__ */ new WeakMap();
-function Re(e) {
-  return ls.get(e) || 1;
-}
-function An(e) {
-  if (e !== re)
-    throw new Error("invalid wNAF");
-}
-function ds(e, t) {
-  return {
-    constTimeNegate: he,
-    hasPrecomputes(n) {
-      return Re(n) !== 1;
-    },
-    // non-const time multiplication ladder
-    unsafeLadder(n, s, r = e.ZERO) {
-      let o = n;
-      for (; s > re; )
-        s & Gt && (r = r.add(o)), o = o.double(), s >>= Gt;
-      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: o } = Te(s, t), i = [];
-      let c = n, f = c;
-      for (let l = 0; l < r; l++) {
-        f = c, i.push(f);
-        for (let h = 1; h < o; h++)
-          f = f.add(c), i.push(f);
-        c = f.double();
-      }
-      return i;
-    },
-    /**
-     * 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 o = e.ZERO, i = e.BASE;
-      const c = Te(n, t);
-      for (let f = 0; f < c.windows; f++) {
-        const { nextN: l, offset: h, isZero: a, isNeg: d, isNegF: u, offsetF: y } = Bn(r, f, c);
-        r = l, a ? i = i.add(he(u, s[y])) : o = o.add(he(d, s[h]));
-      }
-      return An(r), { p: o, f: i };
-    },
-    /**
-     * 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, o = e.ZERO) {
-      const i = Te(n, t);
-      for (let c = 0; c < i.windows && r !== re; c++) {
-        const { nextN: f, offset: l, isZero: h, isNeg: a } = Bn(r, c, i);
-        if (r = f, !h) {
-          const d = s[l];
-          o = o.add(a ? d.negate() : d);
-        }
-      }
-      return An(r), o;
-    },
-    getPrecomputes(n, s, r) {
-      let o = Ne.get(s);
-      return o || (o = this.precomputeWindow(s, n), n !== 1 && (typeof r == "function" && (o = r(o)), Ne.set(s, o))), o;
-    },
-    wNAFCached(n, s, r) {
-      const o = Re(n);
-      return this.wNAF(o, this.getPrecomputes(o, n, r), s);
-    },
-    wNAFCachedUnsafe(n, s, r, o) {
-      const i = Re(n);
-      return i === 1 ? this.unsafeLadder(n, s, o) : this.wNAFUnsafe(i, this.getPrecomputes(i, n, r), s, o);
-    },
-    // We calculate precomputes for elliptic curve point multiplication
-    // using windowed method. This specifies window size and
-    // stores precomputed values. Usually only base point would be precomputed.
-    setWindowSize(n, s) {
-      hs(s, t), ls.set(n, s), Ne.delete(n);
-    }
-  };
-}
-function N0(e, t, n, s) {
-  let r = t, o = e.ZERO, i = e.ZERO;
-  for (; n > re || s > re; )
-    n & Gt && (o = o.add(r)), s & Gt && (i = i.add(r)), r = r.double(), n >>= Gt, s >>= Gt;
-  return { p1: o, p2: i };
-}
-function cn(e, t, n, s) {
-  O0(n, e), T0(s, t);
-  const r = n.length, o = s.length;
-  if (r !== o)
-    throw new Error("arrays of points and scalars must have equal length");
-  const i = e.ZERO, c = o0(BigInt(r));
-  let f = 1;
-  c > 12 ? f = c - 3 : c > 4 ? f = c - 2 : c > 0 && (f = 2);
-  const l = ve(f), h = new Array(Number(l) + 1).fill(i), a = Math.floor((t.BITS - 1) / f) * f;
-  let d = i;
-  for (let u = a; u >= 0; u -= f) {
-    h.fill(i);
-    for (let b = 0; b < o; b++) {
-      const w = s[b], H = Number(w >> BigInt(u) & l);
-      h[H] = h[H].add(n[b]);
-    }
-    let y = i;
-    for (let b = h.length - 1, w = i; 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 En(e, t) {
-  if (t) {
-    if (t.ORDER !== e)
-      throw new Error("Field.ORDER must match order: Fp == p, Fn == n");
-    return u0(t), t;
-  } else
-    return Zt(e);
-}
-function us(e, t, n = {}) {
-  if (!t || typeof t != "object")
-    throw new Error(`expected valid ${e} CURVE object`);
-  for (const c of ["p", "n", "h"]) {
-    const f = t[c];
-    if (!(typeof f == "bigint" && f > re))
-      throw new Error(`CURVE.${c} must be positive bigint`);
-  }
-  const s = En(t.p, n.Fp), r = En(t.n, n.Fn), i = ["Gx", "Gy", "a", e === "weierstrass" ? "b" : "d"];
-  for (const c of i)
-    if (!s.isValid(t[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), Ge = BigInt(2), R0 = BigInt(8), G0 = { zip215: !0 };
-function q0(e, t, n, s) {
-  const r = e.sqr(n), o = e.sqr(s), i = e.add(e.mul(t.a, r), o), c = e.add(e.ONE, e.mul(t.d, e.mul(r, o)));
-  return e.eql(i, c);
-}
-function M0(e, t = {}) {
-  const { Fp: n, Fn: s } = us("edwards", e, t), { h: r, n: o } = e;
-  ue(t, {}, { uvRatio: "function" });
-  const i = Ge << BigInt(s.BYTES * 8) - tt, c = (b) => n.create(b), f = t.uvRatio || ((b, w) => {
-    try {
-      return { isValid: !0, value: n.sqrt(n.div(b, w)) };
-    } catch {
-      return { isValid: !1, value: ht };
-    }
-  });
-  if (!q0(n, e, e.Gx, e.Gy))
-    throw new Error("bad curve params: generator point");
-  function l(b, w, H = !1) {
-    const v = H ? tt : ht;
-    return Jt("coordinate " + b, w, v, i), w;
-  }
-  function h(b) {
-    if (!(b instanceof u))
-      throw new Error("ExtendedPoint expected");
-  }
-  const a = _e((b, w) => {
-    const { ex: H, ey: v, ez: p } = b, D = b.is0();
-    w == null && (w = D ? R0 : n.inv(p));
-    const m = c(H * w), $ = c(v * 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: $ };
-  }), d = _e((b) => {
-    const { a: w, d: H } = e;
-    if (b.is0())
-      throw new Error("bad point: ZERO");
-    const { ex: v, ey: p, ez: D, et: m } = b, $ = c(v * v), C = c(p * p), _ = c(D * D), x = c(_ * _), A = c($ * w), g = c(_ * c(A + C)), B = c(x + c(H * c($ * C)));
-    if (g !== B)
-      throw new Error("bad point: equation left != right (1)");
-    const E = c(v * p), I = c(D * m);
-    if (E !== I)
-      throw new Error("bad point: equation left != right (2)");
-    return !0;
-  });
-  class u {
-    constructor(w, H, v, p) {
-      this.ex = l("x", w), this.ey = l("y", H), this.ez = l("z", v, !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: H, y: v } = w || {};
-      return l("x", H), l("y", v), new u(H, v, tt, c(H * v));
-    }
-    static normalizeZ(w) {
-      return as(u, "ez", w);
-    }
-    // Multiscalar Multiplication
-    static msm(w, H) {
-      return cn(u, s, w, H);
-    }
-    // "Private method", don't use it directly
-    _setWindowSize(w) {
-      this.precompute(w);
-    }
-    precompute(w = 8, H = !0) {
-      return y.setWindowSize(this, w), H || this.multiply(Ge), 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: H, ey: v, ez: p } = this, { ex: D, ey: m, ez: $ } = w, C = c(H * $), _ = c(D * p), x = c(v * $), A = c(m * p);
-      return C === _ && x === A;
-    }
-    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 } = e, { ex: H, ey: v, ez: p } = this, D = c(H * H), m = c(v * v), $ = c(Ge * c(p * p)), C = c(w * D), _ = H + v, x = c(c(_ * _) - D - m), A = C + m, g = A - $, B = C - m, E = c(x * g), I = c(A * B), S = c(x * B), L = c(g * A);
-      return new u(E, I, L, 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: H, d: v } = e, { ex: p, ey: D, ez: m, et: $ } = this, { ex: C, ey: _, ez: x, et: A } = w, g = c(p * C), B = c(D * _), E = c($ * v * A), I = c(m * x), S = c((p + D) * (C + _) - g - B), L = I - E, O = I + E, k = c(B - H * g), G = c(S * L), N = c(O * k), T = c(S * k), M = c(L * O);
-      return new u(G, N, M, T);
-    }
-    subtract(w) {
-      return this.add(w.negate());
-    }
-    // Constant-time multiplication.
-    multiply(w) {
-      const H = w;
-      Jt("scalar", H, tt, o);
-      const { p: v, f: p } = y.wNAFCached(this, H, u.normalizeZ);
-      return u.normalizeZ([v, 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, H = u.ZERO) {
-      const v = w;
-      return Jt("scalar", v, ht, o), v === ht ? u.ZERO : this.is0() || v === tt ? this : y.wNAFCachedUnsafe(this, v, u.normalizeZ, H);
-    }
-    // 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, o).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, H = !1) {
-      return ot(w), this.fromHex(w, H);
-    }
-    // Converts hash string or Uint8Array to Point.
-    // Uses algo from RFC8032 5.1.3.
-    static fromHex(w, H = !1) {
-      const { d: v, a: p } = e, D = n.BYTES;
-      w = V("pointHex", w, D), Vt("zip215", H);
-      const m = w.slice(), $ = w[D - 1];
-      m[D - 1] = $ & -129;
-      const C = ne(m), _ = H ? i : n.ORDER;
-      Jt("pointHex.y", C, ht, _);
-      const x = c(C * C), A = c(x - tt), g = c(v * x - p);
-      let { isValid: B, value: E } = f(A, g);
-      if (!B)
-        throw new Error("Point.fromHex: invalid y coordinate");
-      const I = (E & tt) === tt, S = ($ & 128) !== 0;
-      if (!H && E === ht && S)
-        throw new Error("Point.fromHex: x=0 and x_0=1");
-      return S !== I && (E = c(-E)), u.fromAffine({ x: E, y: C });
-    }
-    static fromPrivateScalar(w) {
-      return u.BASE.multiply(w);
-    }
-    toBytes() {
-      const { x: w, y: H } = this.toAffine(), v = se(H, n.BYTES);
-      return v[v.length - 1] |= w & tt ? 128 : 0, v;
-    }
-    /** @deprecated use `toBytes` */
-    toRawBytes() {
-      return this.toBytes();
-    }
-    toHex() {
-      return Mt(this.toBytes());
-    }
-    toString() {
-      return `<Point ${this.is0() ? "ZERO" : this.toHex()}>`;
-    }
-  }
-  u.BASE = new u(e.Gx, e.Gy, tt, c(e.Gx * e.Gy)), u.ZERO = new u(ht, tt, tt, ht), u.Fp = n, u.Fn = s;
-  const y = ds(u, s.BYTES * 8);
-  return u;
-}
-function V0(e, t) {
-  ue(t, {
-    hash: "function"
-  }, {
-    adjustScalarBytes: "function",
-    randomBytes: "function",
-    domain: "function",
-    prehash: "function",
-    mapToCurve: "function"
-  });
-  const { prehash: n, hash: s } = t, { BASE: r, Fp: o, Fn: i } = e, c = i.ORDER, f = t.randomBytes || Qn, l = t.adjustScalarBytes || ((m) => m), h = t.domain || ((m, $, C) => {
-    if (Vt("phflag", C), $.length || C)
-      throw new Error("Contexts/pre-hash are not supported");
-    return m;
-  });
-  function a(m) {
-    return i.create(m);
-  }
-  function d(m) {
-    return a(ne(m));
-  }
-  function u(m) {
-    const $ = o.BYTES;
-    m = V("private key", m, $);
-    const C = V("hashed private key", s(m), 2 * $), _ = l(C.slice(0, $)), x = C.slice($, 2 * $), A = d(_);
-    return { head: _, prefix: x, scalar: A };
-  }
-  function y(m) {
-    const { head: $, prefix: C, scalar: _ } = u(m), x = r.multiply(_), A = x.toBytes();
-    return { head: $, prefix: C, scalar: _, point: x, pointBytes: A };
-  }
-  function b(m) {
-    return y(m).pointBytes;
-  }
-  function w(m = Uint8Array.of(), ...$) {
-    const C = wt(...$);
-    return d(s(h(C, V("context", m), !!n)));
-  }
-  function H(m, $, C = {}) {
-    m = V("message", m), n && (m = n(m));
-    const { prefix: _, scalar: x, pointBytes: A } = y($), g = w(C.context, _, m), B = r.multiply(g).toBytes(), E = w(C.context, B, A, m), I = a(g + E * x);
-    Jt("signature.s", I, ht, c);
-    const S = o.BYTES, L = wt(B, se(I, S));
-    return V("result", L, S * 2);
-  }
-  const v = G0;
-  function p(m, $, C, _ = v) {
-    const { context: x, zip215: A } = _, g = o.BYTES;
-    m = V("signature", m, 2 * g), $ = V("message", $), C = V("publicKey", C, g), A !== void 0 && Vt("zip215", A), n && ($ = n($));
-    const B = ne(m.slice(g, 2 * g));
-    let E, I, S;
-    try {
-      E = e.fromHex(C, A), I = e.fromHex(m.slice(0, g), A), S = r.multiplyUnsafe(B);
-    } catch {
-      return !1;
-    }
-    if (!A && E.isSmallOrder())
-      return !1;
-    const L = w(x, I.toBytes(), E.toBytes(), $);
-    return I.add(E.multiplyUnsafe(L)).subtract(S).clearCofactor().is0();
-  }
-  return r.precompute(8), { getPublicKey: b, sign: H, verify: p, utils: {
-    getExtendedPublicKey: y,
-    /** ed25519 priv keys are uniform 32b. No need to check for modulo bias, like in secp256k1. */
-    randomPrivateKey: () => f(o.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, $ = e.BASE) {
-      return $.precompute(m, !1);
-    }
-  }, Point: e };
-}
-function Z0(e) {
-  const t = {
-    a: e.a,
-    d: e.d,
-    p: e.Fp.ORDER,
-    n: e.n,
-    h: e.h,
-    Gx: e.Gx,
-    Gy: e.Gy
-  }, n = e.Fp, s = Zt(t.n, e.nBitLength, !0), r = { Fp: n, Fn: s, uvRatio: e.uvRatio }, o = {
-    hash: e.hash,
-    randomBytes: e.randomBytes,
-    adjustScalarBytes: e.adjustScalarBytes,
-    domain: e.domain,
-    prehash: e.prehash,
-    mapToCurve: e.mapToCurve
-  };
-  return { CURVE: t, curveOpts: r, eddsaOpts: o };
-}
-function z0(e, t) {
-  return Object.assign({}, t, { ExtendedPoint: t.Point, CURVE: e });
-}
-function j0(e) {
-  const { CURVE: t, curveOpts: n, eddsaOpts: s } = Z0(e), r = M0(t, n), o = V0(r, s);
-  return z0(e, o);
-}
-const xi = BigInt(0), bi = BigInt(1), wi = BigInt(2);
-const W0 = BigInt(0), gt = BigInt(1), Hn = BigInt(2), gi = BigInt(3), F0 = BigInt(5), K0 = BigInt(8), $e = {
-  p: BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffed"),
-  n: BigInt("0x1000000000000000000000000000000014def9dea2f79cd65812631a5cf5d3ed"),
-  h: K0,
-  a: BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffec"),
-  d: BigInt("0x52036cee2b6ffe738cc740797779e89800700a4d4141d8ab75eb4dca135978a3"),
-  Gx: BigInt("0x216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a"),
-  Gy: BigInt("0x6666666666666666666666666666666666666666666666666666666666666658")
-};
-function Y0(e) {
-  const t = BigInt(10), n = BigInt(20), s = BigInt(40), r = BigInt(80), o = $e.p, c = e * e % o * e % o, f = Z(c, Hn, o) * c % o, l = Z(f, gt, o) * e % o, h = Z(l, F0, o) * l % o, a = Z(h, t, o) * h % o, d = Z(a, n, o) * a % o, u = Z(d, s, o) * d % o, y = Z(u, r, o) * u % o, b = Z(y, r, o) * u % o, w = Z(b, t, o) * h % o;
-  return { pow_p_5_8: Z(w, Hn, o) * e % o, b2: c };
-}
-function X0(e) {
-  return e[0] &= 248, e[31] &= 127, e[31] |= 64, e;
-}
-const We = /* @__PURE__ */ BigInt("19681161376707505956807079304988542015446066515923890162744021073123829784752");
-function fn(e, t) {
-  const n = $e.p, s = z(t * t * t, n), r = z(s * s * t, n), o = Y0(e * r).pow_p_5_8;
-  let i = z(e * s * o, n);
-  const c = z(t * i * i, n), f = i, l = z(i * We, n), h = c === e, a = c === z(-e, n), d = c === z(-e * We, n);
-  return h && (i = f), (a || d) && (i = l), Ot(i, n) && (i = z(-i, n)), { isValid: h || a, value: i };
-}
-const Qt = Zt($e.p, void 0, !0), P0 = {
-  ...$e,
-  Fp: Qt,
-  hash: k0,
-  adjustScalarBytes: X0,
-  // 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: fn
-}, st = j0(P0);
-function qe(e) {
-  if (!(e instanceof W))
-    throw new Error("RistrettoPoint expected");
-}
-const Fe = We, Q0 = /* @__PURE__ */ BigInt("25063068953384623474111414158702152701244531502492656460079210482610430750235"), J0 = /* @__PURE__ */ BigInt("54469307008909316920995813868745141605393597292927456921205312896311721017578"), tr = /* @__PURE__ */ BigInt("1159843021668779879193775521855586647937357759715417654439879720876111806838"), er = /* @__PURE__ */ BigInt("40440834346308536858101042469323190826248399146238708352240133220865137265952"), _n = (e) => fn(gt, e), nr = /* @__PURE__ */ BigInt("0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff"), Me = (e) => st.CURVE.Fp.create(ne(e) & nr);
-function Sn(e) {
-  const { d: t } = st.CURVE, n = st.CURVE.Fp.ORDER, s = st.CURVE.Fp.create, r = s(Fe * e * e), o = s((r + gt) * tr);
-  let i = BigInt(-1);
-  const c = s((i - t * r) * s(r + t));
-  let { isValid: f, value: l } = fn(o, c), h = s(l * e);
-  Ot(h, n) || (h = s(-h)), f || (l = h), f || (i = r);
-  const a = s(i * (r - gt) * er - c), d = l * l, u = s((l + l) * c), y = s(a * Q0), 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(t) {
-    this.ep = t;
-  }
-  static fromAffine(t) {
-    return new W(st.Point.fromAffine(t));
-  }
-  /**
-   * 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(t) {
-    t = V("ristrettoHash", t, 64);
-    const n = Me(t.slice(0, 32)), s = Sn(n), r = Me(t.slice(32, 64)), o = Sn(r);
-    return new W(s.add(o));
-  }
-  static fromBytes(t) {
-    return ot(t), this.fromHex(t);
-  }
-  /**
-   * 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(t) {
-    t = V("ristrettoHex", t, 32);
-    const { a: n, d: s } = st.CURVE, r = Qt.ORDER, o = Qt.create, i = "RistrettoPoint.fromHex: the hex is not valid encoding of RistrettoPoint", c = Me(t);
-    if (!r0(se(c, 32), t) || Ot(c, r))
-      throw new Error(i);
-    const f = o(c * c), l = o(gt + n * f), h = o(gt - n * f), a = o(l * l), d = o(h * h), u = o(n * s * a - d), { isValid: y, value: b } = _n(o(u * d)), w = o(b * h), H = o(b * w * u);
-    let v = o((c + c) * w);
-    Ot(v, r) && (v = o(-v));
-    const p = o(l * H), D = o(v * p);
-    if (!y || Ot(D, r) || p === W0)
-      throw new Error(i);
-    return new W(new st.Point(v, p, gt, D));
-  }
-  static msm(t, n) {
-    const s = Zt(st.CURVE.n, st.CURVE.nBitLength);
-    return cn(W, s, t, n);
-  }
-  /**
-   * Encodes ristretto point to Uint8Array.
-   * Described in [RFC9496](https://www.rfc-editor.org/rfc/rfc9496#name-encode).
-   */
-  toBytes() {
-    let { ex: t, ey: n, ez: s, et: r } = this.ep;
-    const o = Qt.ORDER, i = Qt.create, c = i(i(s + n) * i(s - n)), f = i(t * n), l = i(f * f), { value: h } = _n(i(c * l)), a = i(h * c), d = i(h * f), u = i(a * d * r);
-    let y;
-    if (Ot(r * u, o)) {
-      let w = i(n * Fe), H = i(t * Fe);
-      t = w, n = H, y = i(a * J0);
-    } else
-      y = d;
-    Ot(t * u, o) && (n = i(-n));
-    let b = i((s - n) * y);
-    return Ot(b, o) && (b = i(-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(t) {
-    qe(t);
-    const { ex: n, ey: s } = this.ep, { ex: r, ey: o } = t.ep, i = Qt.create, c = i(n * o) === i(s * r), f = i(s * o) === i(n * r);
-    return c || f;
-  }
-  add(t) {
-    return qe(t), new W(this.ep.add(t.ep));
-  }
-  subtract(t) {
-    return qe(t), new W(this.ep.subtract(t.ep));
-  }
-  multiply(t) {
-    return new W(this.ep.multiply(t));
-  }
-  multiplyUnsafe(t) {
-    return new W(this.ep.multiplyUnsafe(t));
-  }
-  double() {
-    return new W(this.ep.double());
-  }
-  negate() {
-    return new W(this.ep.negate());
-  }
-}
-const yi = (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), In = /* @__PURE__ */ BigInt(32);
-function sr(e, t = !1) {
-  return t ? { h: Number(e & pe), l: Number(e >> In & pe) } : { h: Number(e >> In & pe) | 0, l: Number(e & pe) | 0 };
-}
-function xs(e, t = !1) {
-  const n = e.length;
-  let s = new Uint32Array(n), r = new Uint32Array(n);
-  for (let o = 0; o < n; o++) {
-    const { h: i, l: c } = sr(e[o], t);
-    [s[o], r[o]] = [i, c];
-  }
-  return [s, r];
-}
-const Un = (e, t, n) => e >>> n, vn = (e, t, n) => e << 32 - n | t >>> n, Yt = (e, t, n) => e >>> n | t << 32 - n, Xt = (e, t, n) => e << 32 - n | t >>> n, me = (e, t, n) => e << 64 - n | t >>> n - 32, Be = (e, t, n) => e >>> n - 32 | t << 64 - n, rr = (e, t, n) => e << n | t >>> 32 - n, ir = (e, t, n) => t << n | e >>> 32 - n, or = (e, t, n) => t << n - 32 | e >>> 64 - n, cr = (e, t, n) => e << n - 32 | t >>> 64 - n;
-function ut(e, t, n, s) {
-  const r = (t >>> 0) + (s >>> 0);
-  return { h: e + n + (r / 2 ** 32 | 0) | 0, l: r | 0 };
-}
-const fr = (e, t, n) => (e >>> 0) + (t >>> 0) + (n >>> 0), ar = (e, t, n, s) => t + n + s + (e / 2 ** 32 | 0) | 0, hr = (e, t, n, s) => (e >>> 0) + (t >>> 0) + (n >>> 0) + (s >>> 0), lr = (e, t, n, s, r) => t + n + s + r + (e / 2 ** 32 | 0) | 0, dr = (e, t, n, s, r) => (e >>> 0) + (t >>> 0) + (n >>> 0) + (s >>> 0) + (r >>> 0), ur = (e, t, n, s, r, o) => t + n + s + r + o + (e / 2 ** 32 | 0) | 0, Pt = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
-function xr(e) {
-  return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
-}
-function Le(e, ...t) {
-  if (!xr(e))
-    throw new Error("Uint8Array expected");
-  if (t.length > 0 && !t.includes(e.length))
-    throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
-}
-function $n(e, t = !0) {
-  if (e.destroyed)
-    throw new Error("Hash instance has been destroyed");
-  if (t && e.finished)
-    throw new Error("Hash#digest() has already been called");
-}
-function br(e, t) {
-  Le(e);
-  const n = t.outputLen;
-  if (e.length < n)
-    throw new Error("digestInto() expects output buffer of length at least " + n);
-}
-function pi(e) {
-  return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
-}
-function Se(...e) {
-  for (let t = 0; t < e.length; t++)
-    e[t].fill(0);
-}
-function Ve(e) {
-  return new DataView(e.buffer, e.byteOffset, e.byteLength);
-}
-function wr(e) {
-  if (typeof e != "string")
-    throw new Error("string expected");
-  return new Uint8Array(new TextEncoder().encode(e));
-}
-function bs(e) {
-  return typeof e == "string" && (e = wr(e)), Le(e), e;
-}
-function mi(...e) {
-  let t = 0;
-  for (let s = 0; s < e.length; s++) {
-    const r = e[s];
-    Le(r), t += r.length;
-  }
-  const n = new Uint8Array(t);
-  for (let s = 0, r = 0; s < e.length; s++) {
-    const o = e[s];
-    n.set(o, r), r += o.length;
-  }
-  return n;
-}
-let gr = class {
-};
-function yr(e) {
-  const t = (s) => e().update(bs(s)).digest(), n = e();
-  return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
-}
-function Ai(e = 32) {
-  if (Pt && typeof Pt.getRandomValues == "function")
-    return Pt.getRandomValues(new Uint8Array(e));
-  if (Pt && typeof Pt.randomBytes == "function")
-    return Uint8Array.from(Pt.randomBytes(e));
-  throw new Error("crypto.getRandomValues must be defined");
-}
-const pr = BigInt(0), ce = BigInt(1), mr = BigInt(2), Br = BigInt(7), Ar = BigInt(256), Er = BigInt(113), ws = [], gs = [], ys = [];
-for (let e = 0, t = ce, n = 1, s = 0; e < 24; e++) {
-  [n, s] = [s, (2 * n + 3 * s) % 5], ws.push(2 * (5 * s + n)), gs.push((e + 1) * (e + 2) / 2 % 64);
-  let r = pr;
-  for (let o = 0; o < 7; o++)
-    t = (t << ce ^ (t >> Br) * Er) % Ar, t & mr && (r ^= ce << (ce << /* @__PURE__ */ BigInt(o)) - ce);
-  ys.push(r);
-}
-const ps = xs(ys, !0), Hr = ps[0], _r = ps[1], Ln = (e, t, n) => n > 32 ? or(e, t, n) : rr(e, t, n), Dn = (e, t, n) => n > 32 ? cr(e, t, n) : ir(e, t, n);
-function Ei(e, t = 24) {
-  const n = new Uint32Array(10);
-  for (let s = 24 - t; s < 24; s++) {
-    for (let i = 0; i < 10; i++)
-      n[i] = e[i] ^ e[i + 10] ^ e[i + 20] ^ e[i + 30] ^ e[i + 40];
-    for (let i = 0; i < 10; i += 2) {
-      const c = (i + 8) % 10, f = (i + 2) % 10, l = n[f], h = n[f + 1], a = Ln(l, h, 1) ^ n[c], d = Dn(l, h, 1) ^ n[c + 1];
-      for (let u = 0; u < 50; u += 10)
-        e[i + u] ^= a, e[i + u + 1] ^= d;
-    }
-    let r = e[2], o = e[3];
-    for (let i = 0; i < 24; i++) {
-      const c = gs[i], f = Ln(r, o, c), l = Dn(r, o, c), h = ws[i];
-      r = e[h], o = e[h + 1], e[h] = f, e[h + 1] = l;
-    }
-    for (let i = 0; i < 50; i += 10) {
-      for (let c = 0; c < 10; c++)
-        n[c] = e[i + c];
-      for (let c = 0; c < 10; c++)
-        e[i + c] ^= ~n[(c + 2) % 10] & n[(c + 4) % 10];
-    }
-    e[0] ^= Hr[s], e[1] ^= _r[s];
-  }
-  Se(n);
-}
-function Sr(e, t, n, s) {
-  if (typeof e.setBigUint64 == "function")
-    return e.setBigUint64(t, n, s);
-  const r = BigInt(32), o = BigInt(4294967295), i = Number(n >> r & o), c = Number(n & o), f = s ? 4 : 0, l = s ? 0 : 4;
-  e.setUint32(t + f, i, s), e.setUint32(t + l, c, s);
-}
-let Ir = class extends gr {
-  constructor(t, n, s, r) {
-    super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = t, this.outputLen = n, this.padOffset = s, this.isLE = r, this.buffer = new Uint8Array(t), this.view = Ve(this.buffer);
-  }
-  update(t) {
-    $n(this), t = bs(t), Le(t);
-    const { view: n, buffer: s, blockLen: r } = this, o = t.length;
-    for (let i = 0; i < o; ) {
-      const c = Math.min(r - this.pos, o - i);
-      if (c === r) {
-        const f = Ve(t);
-        for (; r <= o - i; i += r)
-          this.process(f, i);
-        continue;
-      }
-      s.set(t.subarray(i, i + c), this.pos), this.pos += c, i += c, this.pos === r && (this.process(n, 0), this.pos = 0);
-    }
-    return this.length += t.length, this.roundClean(), this;
-  }
-  digestInto(t) {
-    $n(this), br(t, this), this.finished = !0;
-    const { buffer: n, view: s, blockLen: r, isLE: o } = this;
-    let { pos: i } = this;
-    n[i++] = 128, Se(this.buffer.subarray(i)), this.padOffset > r - i && (this.process(s, 0), i = 0);
-    for (let a = i; a < r; a++)
-      n[a] = 0;
-    Sr(s, r - 8, BigInt(this.length * 8), o), this.process(s, 0);
-    const c = Ve(t), 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], o);
-  }
-  digest() {
-    const { buffer: t, outputLen: n } = this;
-    this.digestInto(t);
-    const s = t.slice(0, n);
-    return this.destroy(), s;
-  }
-  _cloneInto(t) {
-    t || (t = new this.constructor()), t.set(...this.get());
-    const { blockLen: n, buffer: s, length: r, finished: o, destroyed: i, pos: c } = this;
-    return t.destroyed = i, t.finished = o, t.length = r, t.pos = c, r % n && t.buffer.set(s), t;
-  }
-  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 ms = xs([
-  "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((e) => BigInt(e))), Ur = ms[0], vr = ms[1], Ut = /* @__PURE__ */ new Uint32Array(80), vt = /* @__PURE__ */ new Uint32Array(80);
-let $r = class extends Ir {
-  constructor(t = 64) {
-    super(128, t, 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: t, Al: n, Bh: s, Bl: r, Ch: o, Cl: i, Dh: c, Dl: f, Eh: l, El: h, Fh: a, Fl: d, Gh: u, Gl: y, Hh: b, Hl: w } = this;
-    return [t, n, s, r, o, i, c, f, l, h, a, d, u, y, b, w];
-  }
-  // prettier-ignore
-  set(t, n, s, r, o, i, c, f, l, h, a, d, u, y, b, w) {
-    this.Ah = t | 0, this.Al = n | 0, this.Bh = s | 0, this.Bl = r | 0, this.Ch = o | 0, this.Cl = i | 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(t, n) {
-    for (let p = 0; p < 16; p++, n += 4)
-      Ut[p] = t.getUint32(n), vt[p] = t.getUint32(n += 4);
-    for (let p = 16; p < 80; p++) {
-      const D = Ut[p - 15] | 0, m = vt[p - 15] | 0, $ = Yt(D, m, 1) ^ Yt(D, m, 8) ^ Un(D, m, 7), C = Xt(D, m, 1) ^ Xt(D, m, 8) ^ vn(D, m, 7), _ = Ut[p - 2] | 0, x = vt[p - 2] | 0, A = Yt(_, x, 19) ^ me(_, x, 61) ^ Un(_, x, 6), g = Xt(_, x, 19) ^ Be(_, x, 61) ^ vn(_, x, 6), B = hr(C, g, vt[p - 7], vt[p - 16]), E = lr(B, $, A, Ut[p - 7], Ut[p - 16]);
-      Ut[p] = E | 0, vt[p] = B | 0;
-    }
-    let { Ah: s, Al: r, Bh: o, Bl: i, Ch: c, Cl: f, Dh: l, Dl: h, Eh: a, El: d, Fh: u, Fl: y, Gh: b, Gl: w, Hh: H, Hl: v } = this;
-    for (let p = 0; p < 80; p++) {
-      const D = Yt(a, d, 14) ^ Yt(a, d, 18) ^ me(a, d, 41), m = Xt(a, d, 14) ^ Xt(a, d, 18) ^ Be(a, d, 41), $ = a & u ^ ~a & b, C = d & y ^ ~d & w, _ = dr(v, m, C, vr[p], vt[p]), x = ur(_, H, D, $, Ur[p], Ut[p]), A = _ | 0, g = Yt(s, r, 28) ^ me(s, r, 34) ^ me(s, r, 39), B = Xt(s, r, 28) ^ Be(s, r, 34) ^ Be(s, r, 39), E = s & o ^ s & c ^ o & c, I = r & i ^ r & f ^ i & f;
-      H = b | 0, v = 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, A | 0), l = c | 0, h = f | 0, c = o | 0, f = i | 0, o = s | 0, i = r | 0;
-      const S = fr(A, B, I);
-      s = ar(S, x, g, E), r = S | 0;
-    }
-    ({ h: s, l: r } = ut(this.Ah | 0, this.Al | 0, s | 0, r | 0)), { h: o, l: i } = ut(this.Bh | 0, this.Bl | 0, o | 0, i | 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: H, l: v } = ut(this.Hh | 0, this.Hl | 0, H | 0, v | 0), this.set(s, r, o, i, c, f, l, h, a, d, u, y, b, w, H, v);
-  }
-  roundClean() {
-    Se(Ut, vt);
-  }
-  destroy() {
-    Se(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
-  }
-};
-const Lr = /* @__PURE__ */ yr(() => new $r()), Si = Lr, Ii = Ps, Ui = tn;
-class Bs extends Xn {
-  constructor(t, n) {
-    super(), this.finished = !1, this.destroyed = !1, t0(t);
-    const s = sn(n);
-    if (this.iHash = t.create(), typeof this.iHash.update != "function")
-      throw new Error("Expected instance of class which extends utils.Hash");
-    this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
-    const r = this.blockLen, o = new Uint8Array(r);
-    o.set(s.length > r ? t.create().update(s).digest() : s);
-    for (let i = 0; i < o.length; i++)
-      o[i] ^= 54;
-    this.iHash.update(o), this.oHash = t.create();
-    for (let i = 0; i < o.length; i++)
-      o[i] ^= 106;
-    this.oHash.update(o), ee(o);
-  }
-  update(t) {
-    return He(this), this.iHash.update(t), this;
-  }
-  digestInto(t) {
-    He(this), ot(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
-  }
-  digest() {
-    const t = new Uint8Array(this.oHash.outputLen);
-    return this.digestInto(t), t;
-  }
-  _cloneInto(t) {
-    t || (t = Object.create(Object.getPrototypeOf(this), {}));
-    const { oHash: n, iHash: s, finished: r, destroyed: o, blockLen: i, outputLen: c } = this;
-    return t = t, t.finished = r, t.destroyed = o, t.blockLen = i, t.outputLen = c, t.oHash = n._cloneInto(t.oHash), t.iHash = s._cloneInto(t.iHash), t;
-  }
-  clone() {
-    return this._cloneInto();
-  }
-  destroy() {
-    this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
-  }
-}
-const As = (e, t, n) => new Bs(e, t).update(n).digest();
-As.create = (e, t) => new Bs(e, t);
-function Cn(e) {
-  e.lowS !== void 0 && Vt("lowS", e.lowS), e.prehash !== void 0 && Vt("prehash", e.prehash);
-}
-class Dr extends Error {
-  constructor(t = "") {
-    super(t);
-  }
-}
-const bt = {
-  // asn.1 DER encoding utils
-  Err: Dr,
-  // Basic building block is TLV (Tag-Length-Value)
-  _tlv: {
-    encode: (e, t) => {
-      const { Err: n } = bt;
-      if (e < 0 || e > 256)
-        throw new n("tlv.encode: wrong tag");
-      if (t.length & 1)
-        throw new n("tlv.encode: unpadded data");
-      const s = t.length / 2, r = be(s);
-      if (r.length / 2 & 128)
-        throw new n("tlv.encode: long form length too big");
-      const o = s > 127 ? be(r.length / 2 | 128) : "";
-      return be(e) + o + r + t;
-    },
-    // v - value, l - left bytes (unparsed)
-    decode(e, t) {
-      const { Err: n } = bt;
-      let s = 0;
-      if (e < 0 || e > 256)
-        throw new n("tlv.encode: wrong tag");
-      if (t.length < 2 || t[s++] !== e)
-        throw new n("tlv.decode: wrong tlv");
-      const r = t[s++], o = !!(r & 128);
-      let i = 0;
-      if (!o)
-        i = 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 = t.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)
-          i = i << 8 | h;
-        if (s += f, i < 128)
-          throw new n("tlv.decode(long): not minimal encoding");
-      }
-      const c = t.subarray(s, s + i);
-      if (c.length !== i)
-        throw new n("tlv.decode: wrong value length");
-      return { v: c, l: t.subarray(s + i) };
-    }
-  },
-  // 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(e) {
-      const { Err: t } = bt;
-      if (e < le)
-        throw new t("integer: negative integers are not allowed");
-      let n = be(e);
-      if (Number.parseInt(n[0], 16) & 8 && (n = "00" + n), n.length & 1)
-        throw new t("unexpected DER parsing assertion: unpadded hex");
-      return n;
-    },
-    decode(e) {
-      const { Err: t } = bt;
-      if (e[0] & 128)
-        throw new t("invalid signature integer: negative");
-      if (e[0] === 0 && !(e[1] & 128))
-        throw new t("invalid signature integer: unnecessary leading zero");
-      return Ue(e);
-    }
-  },
-  toSig(e) {
-    const { Err: t, _int: n, _tlv: s } = bt, r = V("signature", e), { v: o, l: i } = s.decode(48, r);
-    if (i.length)
-      throw new t("invalid signature: left bytes after parsing");
-    const { v: c, l: f } = s.decode(2, o), { v: l, l: h } = s.decode(2, f);
-    if (h.length)
-      throw new t("invalid signature: left bytes after parsing");
-    return { r: n.decode(c), s: n.decode(l) };
-  },
-  hexFromSig(e) {
-    const { _tlv: t, _int: n } = bt, s = t.encode(2, n.encode(e.r)), r = t.encode(2, n.encode(e.s)), o = s + r;
-    return t.encode(48, o);
-  }
-}, le = BigInt(0), de = BigInt(1), Cr = BigInt(2), Ae = BigInt(3), kr = BigInt(4);
-function Or(e, t, n) {
-  function s(r) {
-    const o = e.sqr(r), i = e.mul(o, r);
-    return e.add(e.add(i, e.mul(r, t)), n);
-  }
-  return s;
-}
-function Es(e, t, n) {
-  const { BYTES: s } = e;
-  function r(o) {
-    let i;
-    if (typeof o == "bigint")
-      i = o;
-    else {
-      let c = V("private key", o);
-      if (t) {
-        if (!t.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 {
-        i = e.fromBytes(c);
-      } catch {
-        throw new Error(`invalid private key: expected ui8a of size ${s}, got ${typeof o}`);
-      }
-    }
-    if (n && (i = e.create(i)), !e.isValidNot0(i))
-      throw new Error("invalid private key: out of range [1..N-1]");
-    return i;
-  }
-  return r;
-}
-function Tr(e, t = {}) {
-  const { Fp: n, Fn: s } = us("weierstrass", e, t), { h: r, n: o } = e;
-  ue(t, {}, {
-    allowInfinityPoint: "boolean",
-    clearCofactor: "function",
-    isTorsionFree: "function",
-    fromBytes: "function",
-    toBytes: "function",
-    endo: "object",
-    wrapPrivateKey: "boolean"
-  });
-  const { endo: i } = t;
-  if (i && (!n.is0(e.a) || typeof i.beta != "bigint" || typeof i.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(_, x, A) {
-    const { x: g, y: B } = x.toAffine(), E = n.toBytes(g);
-    if (Vt("isCompressed", A), A) {
-      c();
-      const I = !n.isOdd(B);
-      return wt(Hs(I), E);
-    } else
-      return wt(Uint8Array.of(4), E, n.toBytes(B));
-  }
-  function l(_) {
-    ot(_);
-    const x = n.BYTES, A = x + 1, g = 2 * x + 1, B = _.length, E = _[0], I = _.subarray(1);
-    if (B === A && (E === 2 || E === 3)) {
-      const S = n.fromBytes(I);
-      if (!n.isValid(S))
-        throw new Error("bad point: is not on curve, wrong x");
-      const L = d(S);
-      let O;
-      try {
-        O = n.sqrt(L);
-      } catch (N) {
-        const T = N instanceof Error ? ": " + N.message : "";
-        throw new Error("bad point: is not on curve, sqrt error" + T);
-      }
-      c();
-      const k = n.isOdd(O);
-      return (E & 1) === 1 !== k && (O = n.neg(O)), { x: S, y: O };
-    } else if (B === g && E === 4) {
-      const S = n.fromBytes(I.subarray(x * 0, x * 1)), L = n.fromBytes(I.subarray(x * 1, x * 2));
-      if (!u(S, L))
-        throw new Error("bad point: is not on curve");
-      return { x: S, y: L };
-    } else
-      throw new Error(`bad point: got length ${B}, expected compressed=${A} or uncompressed=${g}`);
-  }
-  const h = t.toBytes || f, a = t.fromBytes || l, d = Or(n, e.a, e.b);
-  function u(_, x) {
-    const A = n.sqr(x), g = d(_);
-    return n.eql(A, g);
-  }
-  if (!u(e.Gx, e.Gy))
-    throw new Error("bad curve params: generator point");
-  const y = n.mul(n.pow(e.a, Ae), kr), b = n.mul(n.sqr(e.b), BigInt(27));
-  if (n.is0(n.add(y, b)))
-    throw new Error("bad curve params: a or b");
-  function w(_, x, A = !1) {
-    if (!n.isValid(x) || A && n.is0(x))
-      throw new Error(`bad point coordinate ${_}`);
-    return x;
-  }
-  function H(_) {
-    if (!(_ instanceof m))
-      throw new Error("ProjectivePoint expected");
-  }
-  const v = _e((_, x) => {
-    const { px: A, py: g, pz: B } = _;
-    if (n.eql(B, n.ONE))
-      return { x: A, y: g };
-    const E = _.is0();
-    x == null && (x = E ? n.ONE : n.inv(B));
-    const I = n.mul(A, x), S = n.mul(g, x), L = n.mul(B, x);
-    if (E)
-      return { x: n.ZERO, y: n.ZERO };
-    if (!n.eql(L, n.ONE))
-      throw new Error("invZ was invalid");
-    return { x: I, y: S };
-  }), p = _e((_) => {
-    if (_.is0()) {
-      if (t.allowInfinityPoint && !n.is0(_.py))
-        return;
-      throw new Error("bad point: ZERO");
-    }
-    const { x, y: A } = _.toAffine();
-    if (!n.isValid(x) || !n.isValid(A))
-      throw new Error("bad point: x or y not field elements");
-    if (!u(x, A))
-      throw new Error("bad point: equation left != right");
-    if (!_.isTorsionFree())
-      throw new Error("bad point: not in prime-order subgroup");
-    return !0;
-  });
-  function D(_, x, A, g, B) {
-    return A = new m(n.mul(A.px, _), A.py, A.pz), x = he(g, x), A = he(B, A), x.add(A);
-  }
-  class m {
-    /** Does NOT validate if the point is valid. Use `.assertValidity()`. */
-    constructor(x, A, g) {
-      this.px = w("x", x), this.py = w("y", A, !0), this.pz = w("z", g), Object.freeze(this);
-    }
-    /** Does NOT validate if the point is valid. Use `.assertValidity()`. */
-    static fromAffine(x) {
-      const { x: A, y: g } = x || {};
-      if (!x || !n.isValid(A) || !n.isValid(g))
-        throw new Error("invalid affine point");
-      if (x instanceof m)
-        throw new Error("projective point not allowed");
-      return n.is0(A) && n.is0(g) ? m.ZERO : new m(A, g, n.ONE);
-    }
-    get x() {
-      return this.toAffine().x;
-    }
-    get y() {
-      return this.toAffine().y;
-    }
-    static normalizeZ(x) {
-      return as(m, "pz", x);
-    }
-    static fromBytes(x) {
-      return ot(x), m.fromHex(x);
-    }
-    /** Converts hash string or Uint8Array to Point. */
-    static fromHex(x) {
-      const A = m.fromAffine(a(V("pointHex", x)));
-      return A.assertValidity(), A;
-    }
-    /** Multiplies generator point by privateKey. */
-    static fromPrivateKey(x) {
-      const A = Es(s, t.allowedPrivateKeyLengths, t.wrapPrivateKey);
-      return m.BASE.multiply(A(x));
-    }
-    /** Multiscalar Multiplication */
-    static msm(x, A) {
-      return cn(m, s, x, A);
-    }
-    /**
-     *
-     * @param windowSize
-     * @param isLazy true will defer table computation until the first multiplication
-     * @returns
-     */
-    precompute(x = 8, A = !0) {
-      return C.setWindowSize(this, x), A || this.multiply(Ae), 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) {
-      H(x);
-      const { px: A, py: g, pz: B } = this, { px: E, py: I, pz: S } = x, L = n.eql(n.mul(A, S), n.mul(E, B)), O = n.eql(n.mul(g, S), n.mul(I, B));
-      return L && 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: A } = e, g = n.mul(A, Ae), { px: B, py: E, pz: I } = this;
-      let S = n.ZERO, L = n.ZERO, O = n.ZERO, k = n.mul(B, B), G = n.mul(E, E), N = n.mul(I, I), T = n.mul(B, E);
-      return T = n.add(T, T), O = n.mul(B, I), O = n.add(O, O), S = n.mul(x, O), L = n.mul(g, N), L = n.add(S, L), S = n.sub(G, L), L = n.add(G, L), L = n.mul(S, L), S = n.mul(T, S), O = n.mul(g, O), N = n.mul(x, N), T = n.sub(k, N), T = n.mul(x, T), T = n.add(T, O), O = n.add(k, k), k = n.add(O, k), k = n.add(k, N), k = n.mul(k, T), L = n.add(L, k), N = n.mul(E, I), N = n.add(N, N), k = n.mul(N, T), S = n.sub(S, k), O = n.mul(N, G), O = n.add(O, O), O = n.add(O, O), new m(S, L, 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) {
-      H(x);
-      const { px: A, py: g, pz: B } = this, { px: E, py: I, pz: S } = x;
-      let L = n.ZERO, O = n.ZERO, k = n.ZERO;
-      const G = e.a, N = n.mul(e.b, Ae);
-      let T = n.mul(A, E), M = n.mul(g, I), F = n.mul(B, S), Y = n.add(A, g), q = n.add(E, I);
-      Y = n.mul(Y, q), q = n.add(T, M), Y = n.sub(Y, q), q = n.add(A, B);
-      let J = n.add(E, S);
-      return q = n.mul(q, J), J = n.add(T, F), q = n.sub(q, J), J = n.add(g, B), L = n.add(I, S), J = n.mul(J, L), L = n.add(M, F), J = n.sub(J, L), k = n.mul(G, q), L = n.mul(N, F), k = n.add(L, k), L = n.sub(M, k), k = n.add(M, k), O = n.mul(L, k), M = n.add(T, T), M = n.add(M, T), F = n.mul(G, F), q = n.mul(N, q), M = n.add(M, F), F = n.sub(T, F), F = n.mul(G, F), q = n.add(q, F), T = n.mul(M, q), O = n.add(O, T), T = n.mul(J, q), L = n.mul(Y, L), L = n.sub(L, T), T = n.mul(Y, M), k = n.mul(J, k), k = n.add(k, T), new m(L, 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: A } = t;
-      if (!s.isValidNot0(x))
-        throw new Error("invalid scalar: out of range");
-      let g, B;
-      const E = (I) => C.wNAFCached(this, I, m.normalizeZ);
-      if (A) {
-        const { k1neg: I, k1: S, k2neg: L, k2: O } = A.splitScalar(x), { p: k, f: G } = E(S), { p: N, f: T } = E(O);
-        B = G.add(T), g = D(A.beta, k, N, I, L);
-      } else {
-        const { p: I, f: S } = E(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: A } = t, 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 (A) {
-        const { k1neg: B, k1: E, k2neg: I, k2: S } = A.splitScalar(x), { p1: L, p2: O } = N0(m, g, E, S);
-        return D(A.beta, L, O, B, I);
-      } else
-        return C.wNAFCachedUnsafe(g, x);
-    }
-    multiplyAndAddUnsafe(x, A, g) {
-      const B = this.multiplyUnsafe(A).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 v(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 } = t;
-      return r === de ? !0 : x ? x(m, this) : C.wNAFCachedUnsafe(this, o).is0();
-    }
-    clearCofactor() {
-      const { clearCofactor: x } = t;
-      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(e.Gx, e.Gy, n.ONE), m.ZERO = new m(n.ZERO, n.ONE, n.ZERO), m.Fp = n, m.Fn = s;
-  const $ = s.BITS, C = ds(m, t.endo ? Math.ceil($ / 2) : $);
-  return m;
-}
-function Hs(e) {
-  return Uint8Array.of(e ? 2 : 3);
-}
-function Nr(e, t, n = {}) {
-  ue(t, { hash: "function" }, {
-    hmac: "function",
-    lowS: "boolean",
-    randomBytes: "function",
-    bits2int: "function",
-    bits2int_modN: "function"
-  });
-  const s = t.randomBytes || Qn, r = t.hmac || ((g, ...B) => As(t.hash, g, wt(...B))), { Fp: o, Fn: i } = e, { ORDER: c, BITS: f } = i;
-  function l(g) {
-    const B = c >> de;
-    return g > B;
-  }
-  function h(g) {
-    return l(g) ? i.neg(g) : g;
-  }
-  function a(g, B) {
-    if (!i.isValidNot0(B))
-      throw new Error(`invalid signature ${g}: out of range 1..CURVE.n`);
-  }
-  class d {
-    constructor(B, E, I) {
-      a("r", B), a("s", E), this.r = B, this.s = E, I != null && (this.recovery = I), Object.freeze(this);
-    }
-    // pair (bytes of r, bytes of s)
-    static fromCompact(B) {
-      const E = i.BYTES, I = V("compactSignature", B, E * 2);
-      return new d(i.fromBytes(I.subarray(0, E)), i.fromBytes(I.subarray(E, E * 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: E, s: I } = bt.toSig(V("DER", B));
-      return new d(E, I);
-    }
-    /**
-     * @todo remove
-     * @deprecated
-     */
-    assertValidity() {
-    }
-    addRecoveryBit(B) {
-      return new d(this.r, this.s, B);
-    }
-    // ProjPointType<bigint>
-    recoverPublicKey(B) {
-      const E = o.ORDER, { r: I, s: S, recovery: L } = this;
-      if (L == null || ![0, 1, 2, 3].includes(L))
-        throw new Error("recovery id invalid");
-      if (c * Cr < E && L > 1)
-        throw new Error("recovery id is ambiguous for h>1 curve");
-      const k = L === 2 || L === 3 ? I + c : I;
-      if (!o.isValid(k))
-        throw new Error("recovery id 2 or 3 invalid");
-      const G = o.toBytes(k), N = e.fromHex(wt(Hs((L & 1) === 0), G)), T = i.inv(k), M = p(V("msgHash", B)), F = i.create(-M * T), Y = i.create(S * T), q = e.BASE.multiplyUnsafe(F).add(N.multiplyUnsafe(Y));
-      if (q.is0())
-        throw new Error("point at infinify");
-      return q.assertValidity(), q;
-    }
-    // Signatures should be low-s, to prevent malleability.
-    hasHighS() {
-      return l(this.s);
-    }
-    normalizeS() {
-      return this.hasHighS() ? new d(this.r, i.neg(this.s), this.recovery) : this;
-    }
-    toBytes(B) {
-      if (B === "compact")
-        return wt(i.toBytes(this.r), i.toBytes(this.s));
-      if (B === "der")
-        return nn(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 = Es(i, 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 w0(s(os(g)), g);
-    },
-    precompute(g = 8, B = e.BASE) {
-      return B.precompute(g, !1);
-    }
-  };
-  function b(g, B = !0) {
-    return e.fromPrivateKey(g).toBytes(B);
-  }
-  function w(g) {
-    if (typeof g == "bigint")
-      return !1;
-    if (g instanceof e)
-      return !0;
-    const E = V("key", g).length, I = o.BYTES, S = I + 1, L = 2 * I + 1;
-    if (!(n.allowedPrivateKeyLengths || i.BYTES === S))
-      return E === S || E === L;
-  }
-  function H(g, B, E = !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 e.fromHex(B).multiply(u(g)).toBytes(E);
-  }
-  const v = t.bits2int || function(g) {
-    if (g.length > 8192)
-      throw new Error("input is too large");
-    const B = Ue(g), E = g.length * 8 - f;
-    return E > 0 ? B >> BigInt(E) : B;
-  }, p = t.bits2int_modN || function(g) {
-    return i.create(v(g));
-  }, D = ve(f);
-  function m(g) {
-    return Jt("num < 2^" + f, g, le, D), i.toBytes(g);
-  }
-  function $(g, B, E = C) {
-    if (["recovered", "canonical"].some((Y) => Y in E))
-      throw new Error("sign() legacy options not supported");
-    const { hash: I } = t;
-    let { lowS: S, prehash: L, extraEntropy: O } = E;
-    S == null && (S = !0), g = V("msgHash", g), Cn(E), L && (g = V("prehashed msgHash", I(g)));
-    const k = p(g), G = u(B), N = [m(G), m(k)];
-    if (O != null && O !== !1) {
-      const Y = O === !0 ? s(o.BYTES) : O;
-      N.push(V("extraEntropy", Y));
-    }
-    const T = wt(...N), M = k;
-    function F(Y) {
-      const q = v(Y);
-      if (!i.isValidNot0(q))
-        return;
-      const J = i.inv(q), oe = e.BASE.multiply(q).toAffine(), zt = i.create(oe.x);
-      if (zt === le)
-        return;
-      const Nt = i.create(J * i.create(M + zt * G));
-      if (Nt === le)
-        return;
-      let De = (oe.x === zt ? 0 : 2) | Number(oe.y & de), jt = Nt;
-      return S && l(Nt) && (jt = h(Nt), De ^= 1), new d(zt, jt, De);
-    }
-    return { seed: T, k2sig: F };
-  }
-  const C = { lowS: t.lowS, prehash: !1 }, _ = { lowS: t.lowS, prehash: !1 };
-  function x(g, B, E = C) {
-    const { seed: I, k2sig: S } = $(g, B, E);
-    return c0(t.hash.outputLen, i.BYTES, r)(I, S);
-  }
-  e.BASE.precompute(8);
-  function A(g, B, E, I = _) {
-    const S = g;
-    B = V("msgHash", B), E = V("publicKey", E), Cn(I);
-    const { lowS: L, 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 G = typeof S == "string" || en(S), N = !G && !k && typeof S == "object" && S !== null && typeof S.r == "bigint" && typeof S.s == "bigint";
-    if (!G && !N)
-      throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");
-    let T, M;
-    try {
-      if (N)
-        if (k === void 0 || k === "js")
-          T = new d(S.r, S.s);
-        else
-          throw new Error("invalid format");
-      if (G) {
-        try {
-          k !== "compact" && (T = d.fromDER(S));
-        } catch (jt) {
-          if (!(jt instanceof bt.Err))
-            throw jt;
-        }
-        !T && k !== "der" && (T = d.fromCompact(S));
-      }
-      M = e.fromHex(E);
-    } catch {
-      return !1;
-    }
-    if (!T || L && T.hasHighS())
-      return !1;
-    O && (B = t.hash(B));
-    const { r: F, s: Y } = T, q = p(B), J = i.inv(Y), oe = i.create(q * J), zt = i.create(F * J), Nt = e.BASE.multiplyUnsafe(oe).add(M.multiplyUnsafe(zt));
-    return Nt.is0() ? !1 : i.create(Nt.x) === F;
-  }
-  return Object.freeze({
-    getPublicKey: b,
-    getSharedSecret: H,
-    sign: x,
-    verify: A,
-    utils: y,
-    Point: e,
-    Signature: d
-  });
-}
-function Rr(e) {
-  const t = {
-    a: e.a,
-    b: e.b,
-    p: e.Fp.ORDER,
-    n: e.n,
-    h: e.h,
-    Gx: e.Gx,
-    Gy: e.Gy
-  }, n = e.Fp, s = Zt(t.n, e.nBitLength), r = {
-    Fp: n,
-    Fn: s,
-    allowedPrivateKeyLengths: e.allowedPrivateKeyLengths,
-    allowInfinityPoint: e.allowInfinityPoint,
-    endo: e.endo,
-    wrapPrivateKey: e.wrapPrivateKey,
-    isTorsionFree: e.isTorsionFree,
-    clearCofactor: e.clearCofactor,
-    fromBytes: e.fromBytes,
-    toBytes: e.toBytes
-  };
-  return { CURVE: t, curveOpts: r };
-}
-function Gr(e) {
-  const { CURVE: t, curveOpts: n } = Rr(e), s = {
-    hash: e.hash,
-    hmac: e.hmac,
-    randomBytes: e.randomBytes,
-    lowS: e.lowS,
-    bits2int: e.bits2int,
-    bits2int_modN: e.bits2int_modN
-  };
-  return { CURVE: t, curveOpts: n, ecdsaOpts: s };
-}
-function qr(e, t) {
-  return Object.assign({}, t, {
-    ProjectivePoint: t.Point,
-    CURVE: e
-  });
-}
-function Mr(e) {
-  const { CURVE: t, curveOpts: n, ecdsaOpts: s } = Gr(e), r = Tr(t, n), o = Nr(r, s, n);
-  return qr(e, o);
-}
-function Vr(e, t) {
-  const n = (s) => Mr({ ...e, hash: s });
-  return { ...n(t), 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 Zr = BigInt(1), Ke = BigInt(2), kn = (e, t) => (e + t / Ke) / t;
-function zr(e) {
-  const t = Ie.p, n = BigInt(3), s = BigInt(6), r = BigInt(11), o = BigInt(22), i = BigInt(23), c = BigInt(44), f = BigInt(88), l = e * e * e % t, h = l * l * e % t, a = Z(h, n, t) * h % t, d = Z(a, n, t) * h % t, u = Z(d, Ke, t) * l % t, y = Z(u, r, t) * u % t, b = Z(y, o, t) * y % t, w = Z(b, c, t) * b % t, H = Z(w, f, t) * w % t, v = Z(H, c, t) * b % t, p = Z(v, n, t) * h % t, D = Z(p, i, t) * y % t, m = Z(D, s, t) * l % t, $ = Z(m, Ke, t);
-  if (!Ye.eql(Ye.sqr($), e))
-    throw new Error("Cannot find square root");
-  return $;
-}
-const Ye = Zt(Ie.p, void 0, void 0, { sqrt: zr }), vi = Vr({
-  ...Ie,
-  Fp: Ye,
-  lowS: !0,
-  // Allow only low-S signatures by default in sign() and verify()
-  endo: {
-    // Endomorphism, see above
-    beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
-    splitScalar: (e) => {
-      const t = Ie.n, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), s = -Zr * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), r = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), o = n, i = BigInt("0x100000000000000000000000000000000"), c = kn(o * e, t), f = kn(-s * e, t);
-      let l = z(e - c * n - f * r, t), h = z(-c * s - f * o, t);
-      const a = l > i, d = h > i;
-      if (a && (l = t - l), d && (h = t - h), l > i || h > i)
-        throw new Error("splitScalar: Endomorphism failed, k=" + e);
-      return { k1neg: a, k1: l, k2neg: d, k2: h };
-    }
-  }
-}, C0);
-function jr(e) {
-  return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
-}
-function an(e, ...t) {
-  if (!jr(e))
-    throw new Error("Uint8Array expected");
-  if (t.length > 0 && !t.includes(e.length))
-    throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
-}
-function On(e, t = !0) {
-  if (e.destroyed)
-    throw new Error("Hash instance has been destroyed");
-  if (t && e.finished)
-    throw new Error("Hash#digest() has already been called");
-}
-function Wr(e, t) {
-  an(e);
-  const n = t.outputLen;
-  if (e.length < n)
-    throw new Error("digestInto() expects output buffer of length at least " + n);
-}
-function Xe(...e) {
-  for (let t = 0; t < e.length; t++)
-    e[t].fill(0);
-}
-function Ze(e) {
-  return new DataView(e.buffer, e.byteOffset, e.byteLength);
-}
-function at(e, t) {
-  return e << 32 - t | e >>> t;
-}
-function Fr(e) {
-  if (typeof e != "string")
-    throw new Error("string expected");
-  return new Uint8Array(new TextEncoder().encode(e));
-}
-function _s(e) {
-  return typeof e == "string" && (e = Fr(e)), an(e), e;
-}
-class Kr {
-}
-function Yr(e) {
-  const t = (s) => e().update(_s(s)).digest(), n = e();
-  return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
-}
-function Xr(e, t, n, s) {
-  if (typeof e.setBigUint64 == "function")
-    return e.setBigUint64(t, n, s);
-  const r = BigInt(32), o = BigInt(4294967295), i = Number(n >> r & o), c = Number(n & o), f = s ? 4 : 0, l = s ? 0 : 4;
-  e.setUint32(t + f, i, s), e.setUint32(t + l, c, s);
-}
-function Pr(e, t, n) {
-  return e & t ^ ~e & n;
-}
-function Qr(e, t, n) {
-  return e & t ^ e & n ^ t & n;
-}
-class Jr extends Kr {
-  constructor(t, n, s, r) {
-    super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = t, this.outputLen = n, this.padOffset = s, this.isLE = r, this.buffer = new Uint8Array(t), this.view = Ze(this.buffer);
-  }
-  update(t) {
-    On(this), t = _s(t), an(t);
-    const { view: n, buffer: s, blockLen: r } = this, o = t.length;
-    for (let i = 0; i < o; ) {
-      const c = Math.min(r - this.pos, o - i);
-      if (c === r) {
-        const f = Ze(t);
-        for (; r <= o - i; i += r)
-          this.process(f, i);
-        continue;
-      }
-      s.set(t.subarray(i, i + c), this.pos), this.pos += c, i += c, this.pos === r && (this.process(n, 0), this.pos = 0);
-    }
-    return this.length += t.length, this.roundClean(), this;
-  }
-  digestInto(t) {
-    On(this), Wr(t, this), this.finished = !0;
-    const { buffer: n, view: s, blockLen: r, isLE: o } = this;
-    let { pos: i } = this;
-    n[i++] = 128, Xe(this.buffer.subarray(i)), this.padOffset > r - i && (this.process(s, 0), i = 0);
-    for (let a = i; a < r; a++)
-      n[a] = 0;
-    Xr(s, r - 8, BigInt(this.length * 8), o), this.process(s, 0);
-    const c = Ze(t), 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], o);
-  }
-  digest() {
-    const { buffer: t, outputLen: n } = this;
-    this.digestInto(t);
-    const s = t.slice(0, n);
-    return this.destroy(), s;
-  }
-  _cloneInto(t) {
-    t || (t = new this.constructor()), t.set(...this.get());
-    const { blockLen: n, buffer: s, length: r, finished: o, destroyed: i, pos: c } = this;
-    return t.destroyed = i, t.finished = o, t.length = r, t.pos = c, r % n && t.buffer.set(s), t;
-  }
-  clone() {
-    return this._cloneInto();
-  }
-}
-const $t = /* @__PURE__ */ Uint32Array.from([
-  1779033703,
-  3144134277,
-  1013904242,
-  2773480762,
-  1359893119,
-  2600822924,
-  528734635,
-  1541459225
-]);
-const $i = /* @__PURE__ */ BigInt(2 ** 32 - 1);
-const ti = /* @__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
-]), Lt = /* @__PURE__ */ new Uint32Array(64);
-class ei extends Jr {
-  constructor(t = 32) {
-    super(64, t, 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: t, B: n, C: s, D: r, E: o, F: i, G: c, H: f } = this;
-    return [t, n, s, r, o, i, c, f];
-  }
-  // prettier-ignore
-  set(t, n, s, r, o, i, c, f) {
-    this.A = t | 0, this.B = n | 0, this.C = s | 0, this.D = r | 0, this.E = o | 0, this.F = i | 0, this.G = c | 0, this.H = f | 0;
-  }
-  process(t, n) {
-    for (let a = 0; a < 16; a++, n += 4)
-      Lt[a] = t.getUint32(n, !1);
-    for (let a = 16; a < 64; a++) {
-      const d = Lt[a - 15], u = Lt[a - 2], y = at(d, 7) ^ at(d, 18) ^ d >>> 3, b = at(u, 17) ^ at(u, 19) ^ u >>> 10;
-      Lt[a] = b + Lt[a - 7] + y + Lt[a - 16] | 0;
-    }
-    let { A: s, B: r, C: o, D: i, 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 + Pr(c, f, l) + ti[a] + Lt[a] | 0, b = (at(s, 2) ^ at(s, 13) ^ at(s, 22)) + Qr(s, r, o) | 0;
-      h = l, l = f, f = c, c = i + u | 0, i = o, o = r, r = s, s = u + b | 0;
-    }
-    s = s + this.A | 0, r = r + this.B | 0, o = o + this.C | 0, i = i + 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, o, i, c, f, l, h);
-  }
-  roundClean() {
-    Xe(Lt);
-  }
-  destroy() {
-    this.set(0, 0, 0, 0, 0, 0, 0, 0), Xe(this.buffer);
-  }
-}
-const ni = /* @__PURE__ */ Yr(() => new ei()), Li = ni;
-export {
-  yi as R,
-  Si as a,
-  ii as b,
-  mi as c,
-  ne as d,
-  Jt as e,
-  st as f,
-  pi as g,
-  ve as h,
-  en as i,
-  Ii as j,
-  Ei as k,
-  Ui as l,
-  z as m,
-  se as n,
-  vi as o,
-  Fn as p,
-  Li as q,
-  Ai as r,
-  ai as s,
-  wr as u
-};