@btc-vision/walletconnect 1.9.12 → 1.9.13

package/browser/noble-hashes.js

@@ -0,0 +1,3097 @@
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function b0(t) {
+  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
+}
+function ie(t, ...e) {
+  if (!b0(t))
+    throw new Error("Uint8Array expected");
+  if (e.length > 0 && !e.includes(t.length))
+    throw new Error("Uint8Array expected of length " + e + ", got length=" + t.length);
+}
+function le(t, e = !0) {
+  if (t.destroyed)
+    throw new Error("Hash instance has been destroyed");
+  if (e && t.finished)
+    throw new Error("Hash#digest() has already been called");
+}
+function x0(t, e) {
+  ie(t);
+  const s = e.outputLen;
+  if (t.length < s)
+    throw new Error("digestInto() expects output buffer of length at least " + s);
+}
+function ne(...t) {
+  for (let e = 0; e < t.length; e++)
+    t[e].fill(0);
+}
+function Jt(t) {
+  return new DataView(t.buffer, t.byteOffset, t.byteLength);
+}
+function z(t, e) {
+  return t << 32 - e | t >>> e;
+}
+function H0(t) {
+  if (typeof t != "string")
+    throw new Error("string expected");
+  return new Uint8Array(new TextEncoder().encode(t));
+}
+function We(t) {
+  return typeof t == "string" && (t = H0(t)), ie(t), t;
+}
+let p0 = class {
+};
+function A0(t) {
+  const e = (r) => t().update(We(r)).digest(), s = t();
+  return e.outputLen = s.outputLen, e.blockLen = s.blockLen, e.create = () => t(), e;
+}
+function y0(t, e, s, r) {
+  if (typeof t.setBigUint64 == "function")
+    return t.setBigUint64(e, s, r);
+  const c = BigInt(32), n = BigInt(4294967295), i = Number(s >> c & n), h = Number(s & n), f = r ? 4 : 0, u = r ? 0 : 4;
+  t.setUint32(e + f, i, r), t.setUint32(e + u, h, r);
+}
+function g0(t, e, s) {
+  return t & e ^ ~t & s;
+}
+function _0(t, e, s) {
+  return t & e ^ t & s ^ e & s;
+}
+let w0 = class extends p0 {
+  constructor(e, s, r, c) {
+    super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = e, this.outputLen = s, this.padOffset = r, this.isLE = c, this.buffer = new Uint8Array(e), this.view = Jt(this.buffer);
+  }
+  update(e) {
+    le(this), e = We(e), ie(e);
+    const { view: s, buffer: r, blockLen: c } = this, n = e.length;
+    for (let i = 0; i < n; ) {
+      const h = Math.min(c - this.pos, n - i);
+      if (h === c) {
+        const f = Jt(e);
+        for (; c <= n - i; i += c)
+          this.process(f, i);
+        continue;
+      }
+      r.set(e.subarray(i, i + h), this.pos), this.pos += h, i += h, this.pos === c && (this.process(s, 0), this.pos = 0);
+    }
+    return this.length += e.length, this.roundClean(), this;
+  }
+  digestInto(e) {
+    le(this), x0(e, this), this.finished = !0;
+    const { buffer: s, view: r, blockLen: c, isLE: n } = this;
+    let { pos: i } = this;
+    s[i++] = 128, ne(this.buffer.subarray(i)), this.padOffset > c - i && (this.process(r, 0), i = 0);
+    for (let a = i; a < c; a++)
+      s[a] = 0;
+    y0(r, c - 8, BigInt(this.length * 8), n), this.process(r, 0);
+    const h = Jt(e), f = this.outputLen;
+    if (f % 4)
+      throw new Error("_sha2: outputLen should be aligned to 32bit");
+    const u = f / 4, l = this.get();
+    if (u > l.length)
+      throw new Error("_sha2: outputLen bigger than state");
+    for (let a = 0; a < u; a++)
+      h.setUint32(4 * a, l[a], n);
+  }
+  digest() {
+    const { buffer: e, outputLen: s } = this;
+    this.digestInto(e);
+    const r = e.slice(0, s);
+    return this.destroy(), r;
+  }
+  _cloneInto(e) {
+    e || (e = new this.constructor()), e.set(...this.get());
+    const { blockLen: s, buffer: r, length: c, finished: n, destroyed: i, pos: h } = this;
+    return e.destroyed = i, e.finished = n, e.length = c, e.pos = h, c % s && e.buffer.set(r), e;
+  }
+  clone() {
+    return this._cloneInto();
+  }
+};
+const ht = /* @__PURE__ */ Uint32Array.from([
+  1779033703,
+  3144134277,
+  1013904242,
+  2773480762,
+  1359893119,
+  2600822924,
+  528734635,
+  1541459225
+]), S0 = /* @__PURE__ */ Uint32Array.from([
+  1116352408,
+  1899447441,
+  3049323471,
+  3921009573,
+  961987163,
+  1508970993,
+  2453635748,
+  2870763221,
+  3624381080,
+  310598401,
+  607225278,
+  1426881987,
+  1925078388,
+  2162078206,
+  2614888103,
+  3248222580,
+  3835390401,
+  4022224774,
+  264347078,
+  604807628,
+  770255983,
+  1249150122,
+  1555081692,
+  1996064986,
+  2554220882,
+  2821834349,
+  2952996808,
+  3210313671,
+  3336571891,
+  3584528711,
+  113926993,
+  338241895,
+  666307205,
+  773529912,
+  1294757372,
+  1396182291,
+  1695183700,
+  1986661051,
+  2177026350,
+  2456956037,
+  2730485921,
+  2820302411,
+  3259730800,
+  3345764771,
+  3516065817,
+  3600352804,
+  4094571909,
+  275423344,
+  430227734,
+  506948616,
+  659060556,
+  883997877,
+  958139571,
+  1322822218,
+  1537002063,
+  1747873779,
+  1955562222,
+  2024104815,
+  2227730452,
+  2361852424,
+  2428436474,
+  2756734187,
+  3204031479,
+  3329325298
+]), at = /* @__PURE__ */ new Uint32Array(64);
+let L0 = class extends w0 {
+  constructor(e = 32) {
+    super(64, e, 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: e, B: s, C: r, D: c, E: n, F: i, G: h, H: f } = this;
+    return [e, s, r, c, n, i, h, f];
+  }
+  // prettier-ignore
+  set(e, s, r, c, n, i, h, f) {
+    this.A = e | 0, this.B = s | 0, this.C = r | 0, this.D = c | 0, this.E = n | 0, this.F = i | 0, this.G = h | 0, this.H = f | 0;
+  }
+  process(e, s) {
+    for (let a = 0; a < 16; a++, s += 4)
+      at[a] = e.getUint32(s, !1);
+    for (let a = 16; a < 64; a++) {
+      const y = at[a - 15], p = at[a - 2], S = z(y, 7) ^ z(y, 18) ^ y >>> 3, L = z(p, 17) ^ z(p, 19) ^ p >>> 10;
+      at[a] = L + at[a - 7] + S + at[a - 16] | 0;
+    }
+    let { A: r, B: c, C: n, D: i, E: h, F: f, G: u, H: l } = this;
+    for (let a = 0; a < 64; a++) {
+      const y = z(h, 6) ^ z(h, 11) ^ z(h, 25), p = l + y + g0(h, f, u) + S0[a] + at[a] | 0, L = (z(r, 2) ^ z(r, 13) ^ z(r, 22)) + _0(r, c, n) | 0;
+      l = u, u = f, f = h, h = i + p | 0, i = n, n = c, c = r, r = p + L | 0;
+    }
+    r = r + this.A | 0, c = c + this.B | 0, n = n + this.C | 0, i = i + this.D | 0, h = h + this.E | 0, f = f + this.F | 0, u = u + this.G | 0, l = l + this.H | 0, this.set(r, c, n, i, h, f, u, l);
+  }
+  roundClean() {
+    ne(at);
+  }
+  destroy() {
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), ne(this.buffer);
+  }
+};
+const I0 = /* @__PURE__ */ A0(() => new L0()), sn = I0;
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function B0(t) {
+  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
+}
+function be(t, e = "") {
+  if (!Number.isSafeInteger(t) || t < 0) {
+    const s = e && `"${e}" `;
+    throw new Error(`${s}expected integer >= 0, got ${t}`);
+  }
+}
+function Dt(t, e, s = "") {
+  const r = B0(t), c = t?.length, n = e !== void 0;
+  if (!r || n && c !== e) {
+    const i = s && `"${s}" `, h = n ? ` of length ${e}` : "", f = r ? `length=${c}` : `type=${typeof t}`;
+    throw new Error(i + "expected Uint8Array" + h + ", got " + f);
+  }
+  return t;
+}
+function Rt(t, e = !0) {
+  if (t.destroyed)
+    throw new Error("Hash instance has been destroyed");
+  if (e && t.finished)
+    throw new Error("Hash#digest() has already been called");
+}
+function Pe(t, e) {
+  Dt(t, void 0, "digestInto() output");
+  const s = e.outputLen;
+  if (t.length < s)
+    throw new Error('"digestInto() output" expected to be of length >=' + s);
+}
+function m0(t) {
+  return new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4));
+}
+function ot(...t) {
+  for (let e = 0; e < t.length; e++)
+    t[e].fill(0);
+}
+function Qt(t) {
+  return new DataView(t.buffer, t.byteOffset, t.byteLength);
+}
+function tt(t, e) {
+  return t << 32 - e | t >>> e;
+}
+function wt(t, e) {
+  return t << e | t >>> 32 - e >>> 0;
+}
+const U0 = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+function E0(t) {
+  return t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255;
+}
+function V0(t) {
+  for (let e = 0; e < t.length; e++)
+    t[e] = E0(t[e]);
+  return t;
+}
+const xe = U0 ? (t) => t : V0;
+function nn(...t) {
+  let e = 0;
+  for (let r = 0; r < t.length; r++) {
+    const c = t[r];
+    Dt(c), e += c.length;
+  }
+  const s = new Uint8Array(e);
+  for (let r = 0, c = 0; r < t.length; r++) {
+    const n = t[r];
+    s.set(n, c), c += n.length;
+  }
+  return s;
+}
+function qt(t, e = {}) {
+  const s = (c, n) => t(n).update(c).digest(), r = t(void 0);
+  return s.outputLen = r.outputLen, s.blockLen = r.blockLen, s.create = (c) => t(c), Object.assign(s, e), Object.freeze(s);
+}
+function rn(t = 32) {
+  const e = typeof globalThis == "object" ? globalThis.crypto : null;
+  if (typeof e?.getRandomValues != "function")
+    throw new Error("crypto.getRandomValues must be defined");
+  return e.getRandomValues(new Uint8Array(t));
+}
+const re = (t) => ({
+  oid: Uint8Array.from([6, 9, 96, 134, 72, 1, 101, 3, 4, 2, t])
+});
+function Ne(t, e, s) {
+  return t & e ^ ~t & s;
+}
+function qe(t, e, s) {
+  return t & e ^ t & s ^ e & s;
+}
+let ce = class {
+  blockLen;
+  outputLen;
+  padOffset;
+  isLE;
+  // For partial updates less than block size
+  buffer;
+  view;
+  finished = !1;
+  length = 0;
+  pos = 0;
+  destroyed = !1;
+  constructor(e, s, r, c) {
+    this.blockLen = e, this.outputLen = s, this.padOffset = r, this.isLE = c, this.buffer = new Uint8Array(e), this.view = Qt(this.buffer);
+  }
+  update(e) {
+    Rt(this), Dt(e);
+    const { view: s, buffer: r, blockLen: c } = this, n = e.length;
+    for (let i = 0; i < n; ) {
+      const h = Math.min(c - this.pos, n - i);
+      if (h === c) {
+        const f = Qt(e);
+        for (; c <= n - i; i += c)
+          this.process(f, i);
+        continue;
+      }
+      r.set(e.subarray(i, i + h), this.pos), this.pos += h, i += h, this.pos === c && (this.process(s, 0), this.pos = 0);
+    }
+    return this.length += e.length, this.roundClean(), this;
+  }
+  digestInto(e) {
+    Rt(this), Pe(e, this), this.finished = !0;
+    const { buffer: s, view: r, blockLen: c, isLE: n } = this;
+    let { pos: i } = this;
+    s[i++] = 128, ot(this.buffer.subarray(i)), this.padOffset > c - i && (this.process(r, 0), i = 0);
+    for (let a = i; a < c; a++)
+      s[a] = 0;
+    r.setBigUint64(c - 8, BigInt(this.length * 8), n), this.process(r, 0);
+    const h = Qt(e), f = this.outputLen;
+    if (f % 4)
+      throw new Error("_sha2: outputLen must be aligned to 32bit");
+    const u = f / 4, l = this.get();
+    if (u > l.length)
+      throw new Error("_sha2: outputLen bigger than state");
+    for (let a = 0; a < u; a++)
+      h.setUint32(4 * a, l[a], n);
+  }
+  digest() {
+    const { buffer: e, outputLen: s } = this;
+    this.digestInto(e);
+    const r = e.slice(0, s);
+    return this.destroy(), r;
+  }
+  _cloneInto(e) {
+    e ||= new this.constructor(), e.set(...this.get());
+    const { blockLen: s, buffer: r, length: c, finished: n, destroyed: i, pos: h } = this;
+    return e.destroyed = i, e.finished = n, e.length = c, e.pos = h, c % s && e.buffer.set(r), e;
+  }
+  clone() {
+    return this._cloneInto();
+  }
+};
+const ft = /* @__PURE__ */ Uint32Array.from([
+  1779033703,
+  3144134277,
+  1013904242,
+  2773480762,
+  1359893119,
+  2600822924,
+  528734635,
+  1541459225
+]), Ut = /* @__PURE__ */ Uint32Array.from([
+  1732584193,
+  4023233417,
+  2562383102,
+  271733878,
+  3285377520
+]), dt = /* @__PURE__ */ new Uint32Array(80);
+class k0 extends ce {
+  A = Ut[0] | 0;
+  B = Ut[1] | 0;
+  C = Ut[2] | 0;
+  D = Ut[3] | 0;
+  E = Ut[4] | 0;
+  constructor() {
+    super(64, 20, 8, !1);
+  }
+  get() {
+    const { A: e, B: s, C: r, D: c, E: n } = this;
+    return [e, s, r, c, n];
+  }
+  set(e, s, r, c, n) {
+    this.A = e | 0, this.B = s | 0, this.C = r | 0, this.D = c | 0, this.E = n | 0;
+  }
+  process(e, s) {
+    for (let f = 0; f < 16; f++, s += 4)
+      dt[f] = e.getUint32(s, !1);
+    for (let f = 16; f < 80; f++)
+      dt[f] = wt(dt[f - 3] ^ dt[f - 8] ^ dt[f - 14] ^ dt[f - 16], 1);
+    let { A: r, B: c, C: n, D: i, E: h } = this;
+    for (let f = 0; f < 80; f++) {
+      let u, l;
+      f < 20 ? (u = Ne(c, n, i), l = 1518500249) : f < 40 ? (u = c ^ n ^ i, l = 1859775393) : f < 60 ? (u = qe(c, n, i), l = 2400959708) : (u = c ^ n ^ i, l = 3395469782);
+      const a = wt(r, 5) + u + h + l + dt[f] | 0;
+      h = i, i = n, n = wt(c, 30), c = r, r = a;
+    }
+    r = r + this.A | 0, c = c + this.B | 0, n = n + this.C | 0, i = i + this.D | 0, h = h + this.E | 0, this.set(r, c, n, i, h);
+  }
+  roundClean() {
+    ot(dt);
+  }
+  destroy() {
+    this.set(0, 0, 0, 0, 0), ot(this.buffer);
+  }
+}
+const on = /* @__PURE__ */ qt(() => new k0()), C0 = /* @__PURE__ */ Uint8Array.from([
+  7,
+  4,
+  13,
+  1,
+  10,
+  6,
+  15,
+  3,
+  12,
+  0,
+  9,
+  5,
+  2,
+  14,
+  11,
+  8
+]), Ke = Uint8Array.from(new Array(16).fill(0).map((t, e) => e)), D0 = Ke.map((t) => (9 * t + 5) % 16), Xe = /* @__PURE__ */ (() => {
+  const s = [[Ke], [D0]];
+  for (let r = 0; r < 4; r++)
+    for (let c of s)
+      c.push(c[r].map((n) => C0[n]));
+  return s;
+})(), $e = Xe[0], Je = Xe[1], Qe = /* @__PURE__ */ [
+  [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],
+  [12, 13, 11, 15, 6, 9, 9, 7, 12, 15, 11, 13, 7, 8, 7, 7],
+  [13, 15, 14, 11, 7, 7, 6, 8, 13, 14, 13, 12, 5, 5, 6, 9],
+  [14, 11, 12, 14, 8, 6, 5, 5, 15, 12, 15, 14, 9, 9, 8, 6],
+  [15, 12, 13, 13, 9, 5, 8, 6, 14, 11, 12, 11, 8, 6, 5, 5]
+].map((t) => Uint8Array.from(t)), F0 = /* @__PURE__ */ $e.map((t, e) => t.map((s) => Qe[e][s])), T0 = /* @__PURE__ */ Je.map((t, e) => t.map((s) => Qe[e][s])), O0 = /* @__PURE__ */ Uint32Array.from([
+  0,
+  1518500249,
+  1859775393,
+  2400959708,
+  2840853838
+]), M0 = /* @__PURE__ */ Uint32Array.from([
+  1352829926,
+  1548603684,
+  1836072691,
+  2053994217,
+  0
+]);
+function He(t, e, s, r) {
+  return t === 0 ? e ^ s ^ r : t === 1 ? e & s | ~e & r : t === 2 ? (e | ~s) ^ r : t === 3 ? e & r | s & ~r : e ^ (s | ~r);
+}
+const Ft = /* @__PURE__ */ new Uint32Array(16);
+class G0 extends ce {
+  h0 = 1732584193;
+  h1 = -271733879;
+  h2 = -1732584194;
+  h3 = 271733878;
+  h4 = -1009589776;
+  constructor() {
+    super(64, 20, 8, !0);
+  }
+  get() {
+    const { h0: e, h1: s, h2: r, h3: c, h4: n } = this;
+    return [e, s, r, c, n];
+  }
+  set(e, s, r, c, n) {
+    this.h0 = e | 0, this.h1 = s | 0, this.h2 = r | 0, this.h3 = c | 0, this.h4 = n | 0;
+  }
+  process(e, s) {
+    for (let p = 0; p < 16; p++, s += 4)
+      Ft[p] = e.getUint32(s, !0);
+    let r = this.h0 | 0, c = r, n = this.h1 | 0, i = n, h = this.h2 | 0, f = h, u = this.h3 | 0, l = u, a = this.h4 | 0, y = a;
+    for (let p = 0; p < 5; p++) {
+      const S = 4 - p, L = O0[p], C = M0[p], R = $e[p], T = Je[p], w = F0[p], k = T0[p];
+      for (let A = 0; A < 16; A++) {
+        const I = wt(r + He(p, n, h, u) + Ft[R[A]] + L, w[A]) + a | 0;
+        r = a, a = u, u = wt(h, 10) | 0, h = n, n = I;
+      }
+      for (let A = 0; A < 16; A++) {
+        const I = wt(c + He(S, i, f, l) + Ft[T[A]] + C, k[A]) + y | 0;
+        c = y, y = l, l = wt(f, 10) | 0, f = i, i = I;
+      }
+    }
+    this.set(this.h1 + h + l | 0, this.h2 + u + y | 0, this.h3 + a + c | 0, this.h4 + r + i | 0, this.h0 + n + f | 0);
+  }
+  roundClean() {
+    ot(Ft);
+  }
+  destroy() {
+    this.destroyed = !0, ot(this.buffer), this.set(0, 0, 0, 0, 0);
+  }
+}
+const hn = /* @__PURE__ */ qt(() => new G0()), Tt = /* @__PURE__ */ BigInt(2 ** 32 - 1), pe = /* @__PURE__ */ BigInt(32);
+function v0(t, e = !1) {
+  return e ? { h: Number(t & Tt), l: Number(t >> pe & Tt) } : { h: Number(t >> pe & Tt) | 0, l: Number(t & Tt) | 0 };
+}
+function j0(t, e = !1) {
+  const s = t.length;
+  let r = new Uint32Array(s), c = new Uint32Array(s);
+  for (let n = 0; n < s; n++) {
+    const { h: i, l: h } = v0(t[n], e);
+    [r[n], c[n]] = [i, h];
+  }
+  return [r, c];
+}
+const R0 = (t, e, s) => t << s | e >>> 32 - s, W0 = (t, e, s) => e << s | t >>> 32 - s, P0 = (t, e, s) => e << s - 32 | t >>> 64 - s, N0 = (t, e, s) => t << s - 32 | e >>> 64 - s, q0 = /* @__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
+]), ut = /* @__PURE__ */ new Uint32Array(64);
+class K0 extends ce {
+  constructor(e) {
+    super(64, e, 8, !1);
+  }
+  get() {
+    const { A: e, B: s, C: r, D: c, E: n, F: i, G: h, H: f } = this;
+    return [e, s, r, c, n, i, h, f];
+  }
+  // prettier-ignore
+  set(e, s, r, c, n, i, h, f) {
+    this.A = e | 0, this.B = s | 0, this.C = r | 0, this.D = c | 0, this.E = n | 0, this.F = i | 0, this.G = h | 0, this.H = f | 0;
+  }
+  process(e, s) {
+    for (let a = 0; a < 16; a++, s += 4)
+      ut[a] = e.getUint32(s, !1);
+    for (let a = 16; a < 64; a++) {
+      const y = ut[a - 15], p = ut[a - 2], S = tt(y, 7) ^ tt(y, 18) ^ y >>> 3, L = tt(p, 17) ^ tt(p, 19) ^ p >>> 10;
+      ut[a] = L + ut[a - 7] + S + ut[a - 16] | 0;
+    }
+    let { A: r, B: c, C: n, D: i, E: h, F: f, G: u, H: l } = this;
+    for (let a = 0; a < 64; a++) {
+      const y = tt(h, 6) ^ tt(h, 11) ^ tt(h, 25), p = l + y + Ne(h, f, u) + q0[a] + ut[a] | 0, L = (tt(r, 2) ^ tt(r, 13) ^ tt(r, 22)) + qe(r, c, n) | 0;
+      l = u, u = f, f = h, h = i + p | 0, i = n, n = c, c = r, r = p + L | 0;
+    }
+    r = r + this.A | 0, c = c + this.B | 0, n = n + this.C | 0, i = i + this.D | 0, h = h + this.E | 0, f = f + this.F | 0, u = u + this.G | 0, l = l + this.H | 0, this.set(r, c, n, i, h, f, u, l);
+  }
+  roundClean() {
+    ot(ut);
+  }
+  destroy() {
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), ot(this.buffer);
+  }
+}
+class X0 extends K0 {
+  // We cannot use array here since array allows indexing by variable
+  // which means optimizer/compiler cannot use registers.
+  A = ft[0] | 0;
+  B = ft[1] | 0;
+  C = ft[2] | 0;
+  D = ft[3] | 0;
+  E = ft[4] | 0;
+  F = ft[5] | 0;
+  G = ft[6] | 0;
+  H = ft[7] | 0;
+  constructor() {
+    super(32);
+  }
+}
+const an = /* @__PURE__ */ qt(
+  () => new X0(),
+  /* @__PURE__ */ re(1)
+);
+var W = {}, $ = {}, Yt = {}, Et = {}, Ae;
+function $0() {
+  return Ae || (Ae = 1, Object.defineProperty(Et, "__esModule", { value: !0 }), Et.crypto = void 0, Et.crypto = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0), Et;
+}
+var ye;
+function oe() {
+  return ye || (ye = 1, (function(t) {
+    /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+    Object.defineProperty(t, "__esModule", { value: !0 }), t.wrapXOFConstructorWithOpts = t.wrapConstructorWithOpts = t.wrapConstructor = t.Hash = t.nextTick = t.swap32IfBE = t.byteSwapIfBE = t.swap8IfBE = t.isLE = void 0, t.isBytes = s, t.anumber = r, t.abytes = c, t.ahash = n, t.aexists = i, t.aoutput = h, t.u8 = f, t.u32 = u, t.clean = l, t.createView = a, t.rotr = y, t.rotl = p, t.byteSwap = S, t.byteSwap32 = L, t.bytesToHex = T, t.hexToBytes = A, t.asyncLoop = m, t.utf8ToBytes = E, t.bytesToUtf8 = d, t.toBytes = b, t.kdfInputToBytes = x, t.concatBytes = B, t.checkOpts = g, t.createHasher = F, t.createOptHasher = G, t.createXOFer = v, t.randomBytes = N;
+    const e = /* @__PURE__ */ $0();
+    function s(o) {
+      return o instanceof Uint8Array || ArrayBuffer.isView(o) && o.constructor.name === "Uint8Array";
+    }
+    function r(o) {
+      if (!Number.isSafeInteger(o) || o < 0)
+        throw new Error("positive integer expected, got " + o);
+    }
+    function c(o, ...H) {
+      if (!s(o))
+        throw new Error("Uint8Array expected");
+      if (H.length > 0 && !H.includes(o.length))
+        throw new Error("Uint8Array expected of length " + H + ", got length=" + o.length);
+    }
+    function n(o) {
+      if (typeof o != "function" || typeof o.create != "function")
+        throw new Error("Hash should be wrapped by utils.createHasher");
+      r(o.outputLen), r(o.blockLen);
+    }
+    function i(o, H = !0) {
+      if (o.destroyed)
+        throw new Error("Hash instance has been destroyed");
+      if (H && o.finished)
+        throw new Error("Hash#digest() has already been called");
+    }
+    function h(o, H) {
+      c(o);
+      const _ = H.outputLen;
+      if (o.length < _)
+        throw new Error("digestInto() expects output buffer of length at least " + _);
+    }
+    function f(o) {
+      return new Uint8Array(o.buffer, o.byteOffset, o.byteLength);
+    }
+    function u(o) {
+      return new Uint32Array(o.buffer, o.byteOffset, Math.floor(o.byteLength / 4));
+    }
+    function l(...o) {
+      for (let H = 0; H < o.length; H++)
+        o[H].fill(0);
+    }
+    function a(o) {
+      return new DataView(o.buffer, o.byteOffset, o.byteLength);
+    }
+    function y(o, H) {
+      return o << 32 - H | o >>> H;
+    }
+    function p(o, H) {
+      return o << H | o >>> 32 - H >>> 0;
+    }
+    t.isLE = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+    function S(o) {
+      return o << 24 & 4278190080 | o << 8 & 16711680 | o >>> 8 & 65280 | o >>> 24 & 255;
+    }
+    t.swap8IfBE = t.isLE ? (o) => o : (o) => S(o), t.byteSwapIfBE = t.swap8IfBE;
+    function L(o) {
+      for (let H = 0; H < o.length; H++)
+        o[H] = S(o[H]);
+      return o;
+    }
+    t.swap32IfBE = t.isLE ? (o) => o : L;
+    const C = /* @ts-ignore */ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", R = /* @__PURE__ */ Array.from({ length: 256 }, (o, H) => H.toString(16).padStart(2, "0"));
+    function T(o) {
+      if (c(o), C)
+        return o.toHex();
+      let H = "";
+      for (let _ = 0; _ < o.length; _++)
+        H += R[o[_]];
+      return H;
+    }
+    const w = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
+    function k(o) {
+      if (o >= w._0 && o <= w._9)
+        return o - w._0;
+      if (o >= w.A && o <= w.F)
+        return o - (w.A - 10);
+      if (o >= w.a && o <= w.f)
+        return o - (w.a - 10);
+    }
+    function A(o) {
+      if (typeof o != "string")
+        throw new Error("hex string expected, got " + typeof o);
+      if (C)
+        return Uint8Array.fromHex(o);
+      const H = o.length, _ = H / 2;
+      if (H % 2)
+        throw new Error("hex string expected, got unpadded hex of length " + H);
+      const V = new Uint8Array(_);
+      for (let D = 0, j = 0; D < _; D++, j += 2) {
+        const Y = k(o.charCodeAt(j)), q = k(o.charCodeAt(j + 1));
+        if (Y === void 0 || q === void 0) {
+          const K = o[j] + o[j + 1];
+          throw new Error('hex string expected, got non-hex character "' + K + '" at index ' + j);
+        }
+        V[D] = Y * 16 + q;
+      }
+      return V;
+    }
+    const I = async () => {
+    };
+    t.nextTick = I;
+    async function m(o, H, _) {
+      let V = Date.now();
+      for (let D = 0; D < o; D++) {
+        _(D);
+        const j = Date.now() - V;
+        j >= 0 && j < H || (await (0, t.nextTick)(), V += j);
+      }
+    }
+    function E(o) {
+      if (typeof o != "string")
+        throw new Error("string expected");
+      return new Uint8Array(new TextEncoder().encode(o));
+    }
+    function d(o) {
+      return new TextDecoder().decode(o);
+    }
+    function b(o) {
+      return typeof o == "string" && (o = E(o)), c(o), o;
+    }
+    function x(o) {
+      return typeof o == "string" && (o = E(o)), c(o), o;
+    }
+    function B(...o) {
+      let H = 0;
+      for (let V = 0; V < o.length; V++) {
+        const D = o[V];
+        c(D), H += D.length;
+      }
+      const _ = new Uint8Array(H);
+      for (let V = 0, D = 0; V < o.length; V++) {
+        const j = o[V];
+        _.set(j, D), D += j.length;
+      }
+      return _;
+    }
+    function g(o, H) {
+      if (H !== void 0 && {}.toString.call(H) !== "[object Object]")
+        throw new Error("options should be object or undefined");
+      return Object.assign(o, H);
+    }
+    class U {
+    }
+    t.Hash = U;
+    function F(o) {
+      const H = (V) => o().update(b(V)).digest(), _ = o();
+      return H.outputLen = _.outputLen, H.blockLen = _.blockLen, H.create = () => o(), H;
+    }
+    function G(o) {
+      const H = (V, D) => o(D).update(b(V)).digest(), _ = o({});
+      return H.outputLen = _.outputLen, H.blockLen = _.blockLen, H.create = (V) => o(V), H;
+    }
+    function v(o) {
+      const H = (V, D) => o(D).update(b(V)).digest(), _ = o({});
+      return H.outputLen = _.outputLen, H.blockLen = _.blockLen, H.create = (V) => o(V), H;
+    }
+    t.wrapConstructor = F, t.wrapConstructorWithOpts = G, t.wrapXOFConstructorWithOpts = v;
+    function N(o = 32) {
+      if (e.crypto && typeof e.crypto.getRandomValues == "function")
+        return e.crypto.getRandomValues(new Uint8Array(o));
+      if (e.crypto && typeof e.crypto.randomBytes == "function")
+        return Uint8Array.from(e.crypto.randomBytes(o));
+      throw new Error("crypto.getRandomValues must be defined");
+    }
+  })(Yt)), Yt;
+}
+var ge;
+function J0() {
+  if (ge) return $;
+  ge = 1, Object.defineProperty($, "__esModule", { value: !0 }), $.SHA512_IV = $.SHA384_IV = $.SHA224_IV = $.SHA256_IV = $.HashMD = void 0, $.setBigUint64 = e, $.Chi = s, $.Maj = r;
+  const t = /* @__PURE__ */ oe();
+  function e(n, i, h, f) {
+    if (typeof n.setBigUint64 == "function")
+      return n.setBigUint64(i, h, f);
+    const u = BigInt(32), l = BigInt(4294967295), a = Number(h >> u & l), y = Number(h & l), p = f ? 4 : 0, S = f ? 0 : 4;
+    n.setUint32(i + p, a, f), n.setUint32(i + S, y, f);
+  }
+  function s(n, i, h) {
+    return n & i ^ ~n & h;
+  }
+  function r(n, i, h) {
+    return n & i ^ n & h ^ i & h;
+  }
+  class c extends t.Hash {
+    constructor(i, h, f, u) {
+      super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = i, this.outputLen = h, this.padOffset = f, this.isLE = u, this.buffer = new Uint8Array(i), this.view = (0, t.createView)(this.buffer);
+    }
+    update(i) {
+      (0, t.aexists)(this), i = (0, t.toBytes)(i), (0, t.abytes)(i);
+      const { view: h, buffer: f, blockLen: u } = this, l = i.length;
+      for (let a = 0; a < l; ) {
+        const y = Math.min(u - this.pos, l - a);
+        if (y === u) {
+          const p = (0, t.createView)(i);
+          for (; u <= l - a; a += u)
+            this.process(p, a);
+          continue;
+        }
+        f.set(i.subarray(a, a + y), this.pos), this.pos += y, a += y, this.pos === u && (this.process(h, 0), this.pos = 0);
+      }
+      return this.length += i.length, this.roundClean(), this;
+    }
+    digestInto(i) {
+      (0, t.aexists)(this), (0, t.aoutput)(i, this), this.finished = !0;
+      const { buffer: h, view: f, blockLen: u, isLE: l } = this;
+      let { pos: a } = this;
+      h[a++] = 128, (0, t.clean)(this.buffer.subarray(a)), this.padOffset > u - a && (this.process(f, 0), a = 0);
+      for (let C = a; C < u; C++)
+        h[C] = 0;
+      e(f, u - 8, BigInt(this.length * 8), l), this.process(f, 0);
+      const y = (0, t.createView)(i), p = this.outputLen;
+      if (p % 4)
+        throw new Error("_sha2: outputLen should be aligned to 32bit");
+      const S = p / 4, L = this.get();
+      if (S > L.length)
+        throw new Error("_sha2: outputLen bigger than state");
+      for (let C = 0; C < S; C++)
+        y.setUint32(4 * C, L[C], l);
+    }
+    digest() {
+      const { buffer: i, outputLen: h } = this;
+      this.digestInto(i);
+      const f = i.slice(0, h);
+      return this.destroy(), f;
+    }
+    _cloneInto(i) {
+      i || (i = new this.constructor()), i.set(...this.get());
+      const { blockLen: h, buffer: f, length: u, finished: l, destroyed: a, pos: y } = this;
+      return i.destroyed = a, i.finished = l, i.length = u, i.pos = y, u % h && i.buffer.set(f), i;
+    }
+    clone() {
+      return this._cloneInto();
+    }
+  }
+  return $.HashMD = c, $.SHA256_IV = Uint32Array.from([
+    1779033703,
+    3144134277,
+    1013904242,
+    2773480762,
+    1359893119,
+    2600822924,
+    528734635,
+    1541459225
+  ]), $.SHA224_IV = Uint32Array.from([
+    3238371032,
+    914150663,
+    812702999,
+    4144912697,
+    4290775857,
+    1750603025,
+    1694076839,
+    3204075428
+  ]), $.SHA384_IV = Uint32Array.from([
+    3418070365,
+    3238371032,
+    1654270250,
+    914150663,
+    2438529370,
+    812702999,
+    355462360,
+    4144912697,
+    1731405415,
+    4290775857,
+    2394180231,
+    1750603025,
+    3675008525,
+    1694076839,
+    1203062813,
+    3204075428
+  ]), $.SHA512_IV = Uint32Array.from([
+    1779033703,
+    4089235720,
+    3144134277,
+    2227873595,
+    1013904242,
+    4271175723,
+    2773480762,
+    1595750129,
+    1359893119,
+    2917565137,
+    2600822924,
+    725511199,
+    528734635,
+    4215389547,
+    1541459225,
+    327033209
+  ]), $;
+}
+var O = {}, _e;
+function Q0() {
+  if (_e) return O;
+  _e = 1, Object.defineProperty(O, "__esModule", { value: !0 }), O.toBig = O.shrSL = O.shrSH = O.rotrSL = O.rotrSH = O.rotrBL = O.rotrBH = O.rotr32L = O.rotr32H = O.rotlSL = O.rotlSH = O.rotlBL = O.rotlBH = O.add5L = O.add5H = O.add4L = O.add4H = O.add3L = O.add3H = void 0, O.add = R, O.fromBig = s, O.split = r;
+  const t = /* @__PURE__ */ BigInt(2 ** 32 - 1), e = /* @__PURE__ */ BigInt(32);
+  function s(d, b = !1) {
+    return b ? { h: Number(d & t), l: Number(d >> e & t) } : { h: Number(d >> e & t) | 0, l: Number(d & t) | 0 };
+  }
+  function r(d, b = !1) {
+    const x = d.length;
+    let B = new Uint32Array(x), g = new Uint32Array(x);
+    for (let U = 0; U < x; U++) {
+      const { h: F, l: G } = s(d[U], b);
+      [B[U], g[U]] = [F, G];
+    }
+    return [B, g];
+  }
+  const c = (d, b) => BigInt(d >>> 0) << e | BigInt(b >>> 0);
+  O.toBig = c;
+  const n = (d, b, x) => d >>> x;
+  O.shrSH = n;
+  const i = (d, b, x) => d << 32 - x | b >>> x;
+  O.shrSL = i;
+  const h = (d, b, x) => d >>> x | b << 32 - x;
+  O.rotrSH = h;
+  const f = (d, b, x) => d << 32 - x | b >>> x;
+  O.rotrSL = f;
+  const u = (d, b, x) => d << 64 - x | b >>> x - 32;
+  O.rotrBH = u;
+  const l = (d, b, x) => d >>> x - 32 | b << 64 - x;
+  O.rotrBL = l;
+  const a = (d, b) => b;
+  O.rotr32H = a;
+  const y = (d, b) => d;
+  O.rotr32L = y;
+  const p = (d, b, x) => d << x | b >>> 32 - x;
+  O.rotlSH = p;
+  const S = (d, b, x) => b << x | d >>> 32 - x;
+  O.rotlSL = S;
+  const L = (d, b, x) => b << x - 32 | d >>> 64 - x;
+  O.rotlBH = L;
+  const C = (d, b, x) => d << x - 32 | b >>> 64 - x;
+  O.rotlBL = C;
+  function R(d, b, x, B) {
+    const g = (b >>> 0) + (B >>> 0);
+    return { h: d + x + (g / 2 ** 32 | 0) | 0, l: g | 0 };
+  }
+  const T = (d, b, x) => (d >>> 0) + (b >>> 0) + (x >>> 0);
+  O.add3L = T;
+  const w = (d, b, x, B) => b + x + B + (d / 2 ** 32 | 0) | 0;
+  O.add3H = w;
+  const k = (d, b, x, B) => (d >>> 0) + (b >>> 0) + (x >>> 0) + (B >>> 0);
+  O.add4L = k;
+  const A = (d, b, x, B, g) => b + x + B + g + (d / 2 ** 32 | 0) | 0;
+  O.add4H = A;
+  const I = (d, b, x, B, g) => (d >>> 0) + (b >>> 0) + (x >>> 0) + (B >>> 0) + (g >>> 0);
+  O.add5L = I;
+  const m = (d, b, x, B, g, U) => b + x + B + g + U + (d / 2 ** 32 | 0) | 0;
+  O.add5H = m;
+  const E = {
+    fromBig: s,
+    split: r,
+    toBig: c,
+    shrSH: n,
+    shrSL: i,
+    rotrSH: h,
+    rotrSL: f,
+    rotrBH: u,
+    rotrBL: l,
+    rotr32H: a,
+    rotr32L: y,
+    rotlSH: p,
+    rotlSL: S,
+    rotlBH: L,
+    rotlBL: C,
+    add: R,
+    add3L: T,
+    add3H: w,
+    add4L: k,
+    add4H: A,
+    add5H: m,
+    add5L: I
+  };
+  return O.default = E, O;
+}
+var we;
+function fn() {
+  if (we) return W;
+  we = 1, Object.defineProperty(W, "__esModule", { value: !0 }), W.sha512_224 = W.sha512_256 = W.sha384 = W.sha512 = W.sha224 = W.sha256 = W.SHA512_256 = W.SHA512_224 = W.SHA384 = W.SHA512 = W.SHA224 = W.SHA256 = void 0;
+  const t = /* @__PURE__ */ J0(), e = /* @__PURE__ */ Q0(), s = /* @__PURE__ */ oe(), r = /* @__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
+  ]), c = /* @__PURE__ */ new Uint32Array(64);
+  class n extends t.HashMD {
+    constructor(w = 32) {
+      super(64, w, 8, !1), this.A = t.SHA256_IV[0] | 0, this.B = t.SHA256_IV[1] | 0, this.C = t.SHA256_IV[2] | 0, this.D = t.SHA256_IV[3] | 0, this.E = t.SHA256_IV[4] | 0, this.F = t.SHA256_IV[5] | 0, this.G = t.SHA256_IV[6] | 0, this.H = t.SHA256_IV[7] | 0;
+    }
+    get() {
+      const { A: w, B: k, C: A, D: I, E: m, F: E, G: d, H: b } = this;
+      return [w, k, A, I, m, E, d, b];
+    }
+    // prettier-ignore
+    set(w, k, A, I, m, E, d, b) {
+      this.A = w | 0, this.B = k | 0, this.C = A | 0, this.D = I | 0, this.E = m | 0, this.F = E | 0, this.G = d | 0, this.H = b | 0;
+    }
+    process(w, k) {
+      for (let g = 0; g < 16; g++, k += 4)
+        c[g] = w.getUint32(k, !1);
+      for (let g = 16; g < 64; g++) {
+        const U = c[g - 15], F = c[g - 2], G = (0, s.rotr)(U, 7) ^ (0, s.rotr)(U, 18) ^ U >>> 3, v = (0, s.rotr)(F, 17) ^ (0, s.rotr)(F, 19) ^ F >>> 10;
+        c[g] = v + c[g - 7] + G + c[g - 16] | 0;
+      }
+      let { A, B: I, C: m, D: E, E: d, F: b, G: x, H: B } = this;
+      for (let g = 0; g < 64; g++) {
+        const U = (0, s.rotr)(d, 6) ^ (0, s.rotr)(d, 11) ^ (0, s.rotr)(d, 25), F = B + U + (0, t.Chi)(d, b, x) + r[g] + c[g] | 0, v = ((0, s.rotr)(A, 2) ^ (0, s.rotr)(A, 13) ^ (0, s.rotr)(A, 22)) + (0, t.Maj)(A, I, m) | 0;
+        B = x, x = b, b = d, d = E + F | 0, E = m, m = I, I = A, A = F + v | 0;
+      }
+      A = A + this.A | 0, I = I + this.B | 0, m = m + this.C | 0, E = E + this.D | 0, d = d + this.E | 0, b = b + this.F | 0, x = x + this.G | 0, B = B + this.H | 0, this.set(A, I, m, E, d, b, x, B);
+    }
+    roundClean() {
+      (0, s.clean)(c);
+    }
+    destroy() {
+      this.set(0, 0, 0, 0, 0, 0, 0, 0), (0, s.clean)(this.buffer);
+    }
+  }
+  W.SHA256 = n;
+  class i extends n {
+    constructor() {
+      super(28), this.A = t.SHA224_IV[0] | 0, this.B = t.SHA224_IV[1] | 0, this.C = t.SHA224_IV[2] | 0, this.D = t.SHA224_IV[3] | 0, this.E = t.SHA224_IV[4] | 0, this.F = t.SHA224_IV[5] | 0, this.G = t.SHA224_IV[6] | 0, this.H = t.SHA224_IV[7] | 0;
+    }
+  }
+  W.SHA224 = i;
+  const h = e.split([
+    "0x428a2f98d728ae22",
+    "0x7137449123ef65cd",
+    "0xb5c0fbcfec4d3b2f",
+    "0xe9b5dba58189dbbc",
+    "0x3956c25bf348b538",
+    "0x59f111f1b605d019",
+    "0x923f82a4af194f9b",
+    "0xab1c5ed5da6d8118",
+    "0xd807aa98a3030242",
+    "0x12835b0145706fbe",
+    "0x243185be4ee4b28c",
+    "0x550c7dc3d5ffb4e2",
+    "0x72be5d74f27b896f",
+    "0x80deb1fe3b1696b1",
+    "0x9bdc06a725c71235",
+    "0xc19bf174cf692694",
+    "0xe49b69c19ef14ad2",
+    "0xefbe4786384f25e3",
+    "0x0fc19dc68b8cd5b5",
+    "0x240ca1cc77ac9c65",
+    "0x2de92c6f592b0275",
+    "0x4a7484aa6ea6e483",
+    "0x5cb0a9dcbd41fbd4",
+    "0x76f988da831153b5",
+    "0x983e5152ee66dfab",
+    "0xa831c66d2db43210",
+    "0xb00327c898fb213f",
+    "0xbf597fc7beef0ee4",
+    "0xc6e00bf33da88fc2",
+    "0xd5a79147930aa725",
+    "0x06ca6351e003826f",
+    "0x142929670a0e6e70",
+    "0x27b70a8546d22ffc",
+    "0x2e1b21385c26c926",
+    "0x4d2c6dfc5ac42aed",
+    "0x53380d139d95b3df",
+    "0x650a73548baf63de",
+    "0x766a0abb3c77b2a8",
+    "0x81c2c92e47edaee6",
+    "0x92722c851482353b",
+    "0xa2bfe8a14cf10364",
+    "0xa81a664bbc423001",
+    "0xc24b8b70d0f89791",
+    "0xc76c51a30654be30",
+    "0xd192e819d6ef5218",
+    "0xd69906245565a910",
+    "0xf40e35855771202a",
+    "0x106aa07032bbd1b8",
+    "0x19a4c116b8d2d0c8",
+    "0x1e376c085141ab53",
+    "0x2748774cdf8eeb99",
+    "0x34b0bcb5e19b48a8",
+    "0x391c0cb3c5c95a63",
+    "0x4ed8aa4ae3418acb",
+    "0x5b9cca4f7763e373",
+    "0x682e6ff3d6b2b8a3",
+    "0x748f82ee5defb2fc",
+    "0x78a5636f43172f60",
+    "0x84c87814a1f0ab72",
+    "0x8cc702081a6439ec",
+    "0x90befffa23631e28",
+    "0xa4506cebde82bde9",
+    "0xbef9a3f7b2c67915",
+    "0xc67178f2e372532b",
+    "0xca273eceea26619c",
+    "0xd186b8c721c0c207",
+    "0xeada7dd6cde0eb1e",
+    "0xf57d4f7fee6ed178",
+    "0x06f067aa72176fba",
+    "0x0a637dc5a2c898a6",
+    "0x113f9804bef90dae",
+    "0x1b710b35131c471b",
+    "0x28db77f523047d84",
+    "0x32caab7b40c72493",
+    "0x3c9ebe0a15c9bebc",
+    "0x431d67c49c100d4c",
+    "0x4cc5d4becb3e42b6",
+    "0x597f299cfc657e2a",
+    "0x5fcb6fab3ad6faec",
+    "0x6c44198c4a475817"
+  ].map((T) => BigInt(T))), f = h[0], u = h[1], l = /* @__PURE__ */ new Uint32Array(80), a = /* @__PURE__ */ new Uint32Array(80);
+  class y extends t.HashMD {
+    constructor(w = 64) {
+      super(128, w, 16, !1), this.Ah = t.SHA512_IV[0] | 0, this.Al = t.SHA512_IV[1] | 0, this.Bh = t.SHA512_IV[2] | 0, this.Bl = t.SHA512_IV[3] | 0, this.Ch = t.SHA512_IV[4] | 0, this.Cl = t.SHA512_IV[5] | 0, this.Dh = t.SHA512_IV[6] | 0, this.Dl = t.SHA512_IV[7] | 0, this.Eh = t.SHA512_IV[8] | 0, this.El = t.SHA512_IV[9] | 0, this.Fh = t.SHA512_IV[10] | 0, this.Fl = t.SHA512_IV[11] | 0, this.Gh = t.SHA512_IV[12] | 0, this.Gl = t.SHA512_IV[13] | 0, this.Hh = t.SHA512_IV[14] | 0, this.Hl = t.SHA512_IV[15] | 0;
+    }
+    // prettier-ignore
+    get() {
+      const { Ah: w, Al: k, Bh: A, Bl: I, Ch: m, Cl: E, Dh: d, Dl: b, Eh: x, El: B, Fh: g, Fl: U, Gh: F, Gl: G, Hh: v, Hl: N } = this;
+      return [w, k, A, I, m, E, d, b, x, B, g, U, F, G, v, N];
+    }
+    // prettier-ignore
+    set(w, k, A, I, m, E, d, b, x, B, g, U, F, G, v, N) {
+      this.Ah = w | 0, this.Al = k | 0, this.Bh = A | 0, this.Bl = I | 0, this.Ch = m | 0, this.Cl = E | 0, this.Dh = d | 0, this.Dl = b | 0, this.Eh = x | 0, this.El = B | 0, this.Fh = g | 0, this.Fl = U | 0, this.Gh = F | 0, this.Gl = G | 0, this.Hh = v | 0, this.Hl = N | 0;
+    }
+    process(w, k) {
+      for (let _ = 0; _ < 16; _++, k += 4)
+        l[_] = w.getUint32(k), a[_] = w.getUint32(k += 4);
+      for (let _ = 16; _ < 80; _++) {
+        const V = l[_ - 15] | 0, D = a[_ - 15] | 0, j = e.rotrSH(V, D, 1) ^ e.rotrSH(V, D, 8) ^ e.shrSH(V, D, 7), Y = e.rotrSL(V, D, 1) ^ e.rotrSL(V, D, 8) ^ e.shrSL(V, D, 7), q = l[_ - 2] | 0, K = a[_ - 2] | 0, nt = e.rotrSH(q, K, 19) ^ e.rotrBH(q, K, 61) ^ e.shrSH(q, K, 6), gt = e.rotrSL(q, K, 19) ^ e.rotrBL(q, K, 61) ^ e.shrSL(q, K, 6), it = e.add4L(Y, gt, a[_ - 7], a[_ - 16]), _t = e.add4H(it, j, nt, l[_ - 7], l[_ - 16]);
+        l[_] = _t | 0, a[_] = it | 0;
+      }
+      let { Ah: A, Al: I, Bh: m, Bl: E, Ch: d, Cl: b, Dh: x, Dl: B, Eh: g, El: U, Fh: F, Fl: G, Gh: v, Gl: N, Hh: o, Hl: H } = this;
+      for (let _ = 0; _ < 80; _++) {
+        const V = e.rotrSH(g, U, 14) ^ e.rotrSH(g, U, 18) ^ e.rotrBH(g, U, 41), D = e.rotrSL(g, U, 14) ^ e.rotrSL(g, U, 18) ^ e.rotrBL(g, U, 41), j = g & F ^ ~g & v, Y = U & G ^ ~U & N, q = e.add5L(H, D, Y, u[_], a[_]), K = e.add5H(q, o, V, j, f[_], l[_]), nt = q | 0, gt = e.rotrSH(A, I, 28) ^ e.rotrBH(A, I, 34) ^ e.rotrBH(A, I, 39), it = e.rotrSL(A, I, 28) ^ e.rotrBL(A, I, 34) ^ e.rotrBL(A, I, 39), _t = A & m ^ A & d ^ m & d, $t = I & E ^ I & b ^ E & b;
+        o = v | 0, H = N | 0, v = F | 0, N = G | 0, F = g | 0, G = U | 0, { h: g, l: U } = e.add(x | 0, B | 0, K | 0, nt | 0), x = d | 0, B = b | 0, d = m | 0, b = E | 0, m = A | 0, E = I | 0;
+        const mt = e.add3L(nt, it, $t);
+        A = e.add3H(mt, K, gt, _t), I = mt | 0;
+      }
+      ({ h: A, l: I } = e.add(this.Ah | 0, this.Al | 0, A | 0, I | 0)), { h: m, l: E } = e.add(this.Bh | 0, this.Bl | 0, m | 0, E | 0), { h: d, l: b } = e.add(this.Ch | 0, this.Cl | 0, d | 0, b | 0), { h: x, l: B } = e.add(this.Dh | 0, this.Dl | 0, x | 0, B | 0), { h: g, l: U } = e.add(this.Eh | 0, this.El | 0, g | 0, U | 0), { h: F, l: G } = e.add(this.Fh | 0, this.Fl | 0, F | 0, G | 0), { h: v, l: N } = e.add(this.Gh | 0, this.Gl | 0, v | 0, N | 0), { h: o, l: H } = e.add(this.Hh | 0, this.Hl | 0, o | 0, H | 0), this.set(A, I, m, E, d, b, x, B, g, U, F, G, v, N, o, H);
+    }
+    roundClean() {
+      (0, s.clean)(l, a);
+    }
+    destroy() {
+      (0, s.clean)(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
+    }
+  }
+  W.SHA512 = y;
+  class p extends y {
+    constructor() {
+      super(48), this.Ah = t.SHA384_IV[0] | 0, this.Al = t.SHA384_IV[1] | 0, this.Bh = t.SHA384_IV[2] | 0, this.Bl = t.SHA384_IV[3] | 0, this.Ch = t.SHA384_IV[4] | 0, this.Cl = t.SHA384_IV[5] | 0, this.Dh = t.SHA384_IV[6] | 0, this.Dl = t.SHA384_IV[7] | 0, this.Eh = t.SHA384_IV[8] | 0, this.El = t.SHA384_IV[9] | 0, this.Fh = t.SHA384_IV[10] | 0, this.Fl = t.SHA384_IV[11] | 0, this.Gh = t.SHA384_IV[12] | 0, this.Gl = t.SHA384_IV[13] | 0, this.Hh = t.SHA384_IV[14] | 0, this.Hl = t.SHA384_IV[15] | 0;
+    }
+  }
+  W.SHA384 = p;
+  const S = /* @__PURE__ */ Uint32Array.from([
+    2352822216,
+    424955298,
+    1944164710,
+    2312950998,
+    502970286,
+    855612546,
+    1738396948,
+    1479516111,
+    258812777,
+    2077511080,
+    2011393907,
+    79989058,
+    1067287976,
+    1780299464,
+    286451373,
+    2446758561
+  ]), L = /* @__PURE__ */ Uint32Array.from([
+    573645204,
+    4230739756,
+    2673172387,
+    3360449730,
+    596883563,
+    1867755857,
+    2520282905,
+    1497426621,
+    2519219938,
+    2827943907,
+    3193839141,
+    1401305490,
+    721525244,
+    746961066,
+    246885852,
+    2177182882
+  ]);
+  class C extends y {
+    constructor() {
+      super(28), this.Ah = S[0] | 0, this.Al = S[1] | 0, this.Bh = S[2] | 0, this.Bl = S[3] | 0, this.Ch = S[4] | 0, this.Cl = S[5] | 0, this.Dh = S[6] | 0, this.Dl = S[7] | 0, this.Eh = S[8] | 0, this.El = S[9] | 0, this.Fh = S[10] | 0, this.Fl = S[11] | 0, this.Gh = S[12] | 0, this.Gl = S[13] | 0, this.Hh = S[14] | 0, this.Hl = S[15] | 0;
+    }
+  }
+  W.SHA512_224 = C;
+  class R extends y {
+    constructor() {
+      super(32), this.Ah = L[0] | 0, this.Al = L[1] | 0, this.Bh = L[2] | 0, this.Bl = L[3] | 0, this.Ch = L[4] | 0, this.Cl = L[5] | 0, this.Dh = L[6] | 0, this.Dl = L[7] | 0, this.Eh = L[8] | 0, this.El = L[9] | 0, this.Fh = L[10] | 0, this.Fl = L[11] | 0, this.Gh = L[12] | 0, this.Gl = L[13] | 0, this.Hh = L[14] | 0, this.Hl = L[15] | 0;
+    }
+  }
+  return W.SHA512_256 = R, W.sha256 = (0, s.createHasher)(() => new n()), W.sha224 = (0, s.createHasher)(() => new i()), W.sha512 = (0, s.createHasher)(() => new y()), W.sha384 = (0, s.createHasher)(() => new p()), W.sha512_256 = (0, s.createHasher)(() => new R()), W.sha512_224 = (0, s.createHasher)(() => new C()), W;
+}
+var Zt = {}, Se;
+function dn() {
+  return Se || (Se = 1, (function(t) {
+    Object.defineProperty(t, "__esModule", { value: !0 }), t.hmac = t.HMAC = void 0;
+    const e = /* @__PURE__ */ oe();
+    class s extends e.Hash {
+      constructor(n, i) {
+        super(), this.finished = !1, this.destroyed = !1, (0, e.ahash)(n);
+        const h = (0, e.toBytes)(i);
+        if (this.iHash = n.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 f = this.blockLen, u = new Uint8Array(f);
+        u.set(h.length > f ? n.create().update(h).digest() : h);
+        for (let l = 0; l < u.length; l++)
+          u[l] ^= 54;
+        this.iHash.update(u), this.oHash = n.create();
+        for (let l = 0; l < u.length; l++)
+          u[l] ^= 106;
+        this.oHash.update(u), (0, e.clean)(u);
+      }
+      update(n) {
+        return (0, e.aexists)(this), this.iHash.update(n), this;
+      }
+      digestInto(n) {
+        (0, e.aexists)(this), (0, e.abytes)(n, this.outputLen), this.finished = !0, this.iHash.digestInto(n), this.oHash.update(n), this.oHash.digestInto(n), this.destroy();
+      }
+      digest() {
+        const n = new Uint8Array(this.oHash.outputLen);
+        return this.digestInto(n), n;
+      }
+      _cloneInto(n) {
+        n || (n = Object.create(Object.getPrototypeOf(this), {}));
+        const { oHash: i, iHash: h, finished: f, destroyed: u, blockLen: l, outputLen: a } = this;
+        return n = n, n.finished = f, n.destroyed = u, n.blockLen = l, n.outputLen = a, n.oHash = i._cloneInto(n.oHash), n.iHash = h._cloneInto(n.iHash), n;
+      }
+      clone() {
+        return this._cloneInto();
+      }
+      destroy() {
+        this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
+      }
+    }
+    t.HMAC = s;
+    const r = (c, n, i) => new s(c, n).update(i).digest();
+    t.hmac = r, t.hmac.create = (c, n) => new s(c, n);
+  })(Zt)), Zt;
+}
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function Y0(t) {
+  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
+}
+function Le(t) {
+  if (!Number.isSafeInteger(t) || t < 0)
+    throw new Error("positive integer expected, got " + t);
+}
+function Kt(t, ...e) {
+  if (!Y0(t))
+    throw new Error("Uint8Array expected");
+  if (e.length > 0 && !e.includes(t.length))
+    throw new Error("Uint8Array expected of length " + e + ", got length=" + t.length);
+}
+function Z0(t) {
+  if (typeof t != "function" || typeof t.create != "function")
+    throw new Error("Hash should be wrapped by utils.createHasher");
+  Le(t.outputLen), Le(t.blockLen);
+}
+function Wt(t, e = !0) {
+  if (t.destroyed)
+    throw new Error("Hash instance has been destroyed");
+  if (e && t.finished)
+    throw new Error("Hash#digest() has already been called");
+}
+function z0(t, e) {
+  Kt(t);
+  const s = e.outputLen;
+  if (t.length < s)
+    throw new Error("digestInto() expects output buffer of length at least " + s);
+}
+function yt(...t) {
+  for (let e = 0; e < t.length; e++)
+    t[e].fill(0);
+}
+function zt(t) {
+  return new DataView(t.buffer, t.byteOffset, t.byteLength);
+}
+function et(t, e) {
+  return t << 32 - e | t >>> e;
+}
+function Ot(t, e) {
+  return t << e | t >>> 32 - e >>> 0;
+}
+function ts(t) {
+  if (typeof t != "string")
+    throw new Error("string expected");
+  return new Uint8Array(new TextEncoder().encode(t));
+}
+function he(t) {
+  return typeof t == "string" && (t = ts(t)), Kt(t), t;
+}
+let Ye = class {
+};
+function ae(t) {
+  const e = (r) => t().update(he(r)).digest(), s = t();
+  return e.outputLen = s.outputLen, e.blockLen = s.blockLen, e.create = () => t(), e;
+}
+let Ze = class extends Ye {
+  constructor(e, s) {
+    super(), this.finished = !1, this.destroyed = !1, Z0(e);
+    const r = he(s);
+    if (this.iHash = e.create(), typeof this.iHash.update != "function")
+      throw new Error("Expected instance of class which extends utils.Hash");
+    this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
+    const c = this.blockLen, n = new Uint8Array(c);
+    n.set(r.length > c ? e.create().update(r).digest() : r);
+    for (let i = 0; i < n.length; i++)
+      n[i] ^= 54;
+    this.iHash.update(n), this.oHash = e.create();
+    for (let i = 0; i < n.length; i++)
+      n[i] ^= 106;
+    this.oHash.update(n), yt(n);
+  }
+  update(e) {
+    return Wt(this), this.iHash.update(e), this;
+  }
+  digestInto(e) {
+    Wt(this), Kt(e, this.outputLen), this.finished = !0, this.iHash.digestInto(e), this.oHash.update(e), this.oHash.digestInto(e), this.destroy();
+  }
+  digest() {
+    const e = new Uint8Array(this.oHash.outputLen);
+    return this.digestInto(e), e;
+  }
+  _cloneInto(e) {
+    e || (e = Object.create(Object.getPrototypeOf(this), {}));
+    const { oHash: s, iHash: r, finished: c, destroyed: n, blockLen: i, outputLen: h } = this;
+    return e = e, e.finished = c, e.destroyed = n, e.blockLen = i, e.outputLen = h, e.oHash = s._cloneInto(e.oHash), e.iHash = r._cloneInto(e.iHash), e;
+  }
+  clone() {
+    return this._cloneInto();
+  }
+  destroy() {
+    this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
+  }
+};
+const es = (t, e, s) => new Ze(t, e).update(s).digest();
+es.create = (t, e) => new Ze(t, e);
+function ss(t, e, s, r) {
+  if (typeof t.setBigUint64 == "function")
+    return t.setBigUint64(e, s, r);
+  const c = BigInt(32), n = BigInt(4294967295), i = Number(s >> c & n), h = Number(s & n), f = r ? 4 : 0, u = r ? 0 : 4;
+  t.setUint32(e + f, i, r), t.setUint32(e + u, h, r);
+}
+function ns(t, e, s) {
+  return t & e ^ ~t & s;
+}
+function is(t, e, s) {
+  return t & e ^ t & s ^ e & s;
+}
+let fe = class extends Ye {
+  constructor(e, s, r, c) {
+    super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = e, this.outputLen = s, this.padOffset = r, this.isLE = c, this.buffer = new Uint8Array(e), this.view = zt(this.buffer);
+  }
+  update(e) {
+    Wt(this), e = he(e), Kt(e);
+    const { view: s, buffer: r, blockLen: c } = this, n = e.length;
+    for (let i = 0; i < n; ) {
+      const h = Math.min(c - this.pos, n - i);
+      if (h === c) {
+        const f = zt(e);
+        for (; c <= n - i; i += c)
+          this.process(f, i);
+        continue;
+      }
+      r.set(e.subarray(i, i + h), this.pos), this.pos += h, i += h, this.pos === c && (this.process(s, 0), this.pos = 0);
+    }
+    return this.length += e.length, this.roundClean(), this;
+  }
+  digestInto(e) {
+    Wt(this), z0(e, this), this.finished = !0;
+    const { buffer: s, view: r, blockLen: c, isLE: n } = this;
+    let { pos: i } = this;
+    s[i++] = 128, yt(this.buffer.subarray(i)), this.padOffset > c - i && (this.process(r, 0), i = 0);
+    for (let a = i; a < c; a++)
+      s[a] = 0;
+    ss(r, c - 8, BigInt(this.length * 8), n), this.process(r, 0);
+    const h = zt(e), f = this.outputLen;
+    if (f % 4)
+      throw new Error("_sha2: outputLen should be aligned to 32bit");
+    const u = f / 4, l = this.get();
+    if (u > l.length)
+      throw new Error("_sha2: outputLen bigger than state");
+    for (let a = 0; a < u; a++)
+      h.setUint32(4 * a, l[a], n);
+  }
+  digest() {
+    const { buffer: e, outputLen: s } = this;
+    this.digestInto(e);
+    const r = e.slice(0, s);
+    return this.destroy(), r;
+  }
+  _cloneInto(e) {
+    e || (e = new this.constructor()), e.set(...this.get());
+    const { blockLen: s, buffer: r, length: c, finished: n, destroyed: i, pos: h } = this;
+    return e.destroyed = i, e.finished = n, e.length = c, e.pos = h, c % s && e.buffer.set(r), e;
+  }
+  clone() {
+    return this._cloneInto();
+  }
+};
+const lt = /* @__PURE__ */ Uint32Array.from([
+  1779033703,
+  3144134277,
+  1013904242,
+  2773480762,
+  1359893119,
+  2600822924,
+  528734635,
+  1541459225
+]), J = /* @__PURE__ */ Uint32Array.from([
+  1779033703,
+  4089235720,
+  3144134277,
+  2227873595,
+  1013904242,
+  4271175723,
+  2773480762,
+  1595750129,
+  1359893119,
+  2917565137,
+  2600822924,
+  725511199,
+  528734635,
+  4215389547,
+  1541459225,
+  327033209
+]), rs = /* @__PURE__ */ Uint8Array.from([
+  7,
+  4,
+  13,
+  1,
+  10,
+  6,
+  15,
+  3,
+  12,
+  0,
+  9,
+  5,
+  2,
+  14,
+  11,
+  8
+]), ze = Uint8Array.from(new Array(16).fill(0).map((t, e) => e)), cs = ze.map((t) => (9 * t + 5) % 16), t0 = /* @__PURE__ */ (() => {
+  const s = [[ze], [cs]];
+  for (let r = 0; r < 4; r++)
+    for (let c of s)
+      c.push(c[r].map((n) => rs[n]));
+  return s;
+})(), e0 = t0[0], s0 = t0[1], n0 = /* @__PURE__ */ [
+  [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],
+  [12, 13, 11, 15, 6, 9, 9, 7, 12, 15, 11, 13, 7, 8, 7, 7],
+  [13, 15, 14, 11, 7, 7, 6, 8, 13, 14, 13, 12, 5, 5, 6, 9],
+  [14, 11, 12, 14, 8, 6, 5, 5, 15, 12, 15, 14, 9, 9, 8, 6],
+  [15, 12, 13, 13, 9, 5, 8, 6, 14, 11, 12, 11, 8, 6, 5, 5]
+].map((t) => Uint8Array.from(t)), os = /* @__PURE__ */ e0.map((t, e) => t.map((s) => n0[e][s])), hs = /* @__PURE__ */ s0.map((t, e) => t.map((s) => n0[e][s])), as = /* @__PURE__ */ Uint32Array.from([
+  0,
+  1518500249,
+  1859775393,
+  2400959708,
+  2840853838
+]), fs = /* @__PURE__ */ Uint32Array.from([
+  1352829926,
+  1548603684,
+  1836072691,
+  2053994217,
+  0
+]);
+function Ie(t, e, s, r) {
+  return t === 0 ? e ^ s ^ r : t === 1 ? e & s | ~e & r : t === 2 ? (e | ~s) ^ r : t === 3 ? e & r | s & ~r : e ^ (s | ~r);
+}
+const Mt = /* @__PURE__ */ new Uint32Array(16);
+class ds extends fe {
+  constructor() {
+    super(64, 20, 8, !0), this.h0 = 1732584193, this.h1 = -271733879, this.h2 = -1732584194, this.h3 = 271733878, this.h4 = -1009589776;
+  }
+  get() {
+    const { h0: e, h1: s, h2: r, h3: c, h4: n } = this;
+    return [e, s, r, c, n];
+  }
+  set(e, s, r, c, n) {
+    this.h0 = e | 0, this.h1 = s | 0, this.h2 = r | 0, this.h3 = c | 0, this.h4 = n | 0;
+  }
+  process(e, s) {
+    for (let p = 0; p < 16; p++, s += 4)
+      Mt[p] = e.getUint32(s, !0);
+    let r = this.h0 | 0, c = r, n = this.h1 | 0, i = n, h = this.h2 | 0, f = h, u = this.h3 | 0, l = u, a = this.h4 | 0, y = a;
+    for (let p = 0; p < 5; p++) {
+      const S = 4 - p, L = as[p], C = fs[p], R = e0[p], T = s0[p], w = os[p], k = hs[p];
+      for (let A = 0; A < 16; A++) {
+        const I = Ot(r + Ie(p, n, h, u) + Mt[R[A]] + L, w[A]) + a | 0;
+        r = a, a = u, u = Ot(h, 10) | 0, h = n, n = I;
+      }
+      for (let A = 0; A < 16; A++) {
+        const I = Ot(c + Ie(S, i, f, l) + Mt[T[A]] + C, k[A]) + y | 0;
+        c = y, y = l, l = Ot(f, 10) | 0, f = i, i = I;
+      }
+    }
+    this.set(this.h1 + h + l | 0, this.h2 + u + y | 0, this.h3 + a + c | 0, this.h4 + r + i | 0, this.h0 + n + f | 0);
+  }
+  roundClean() {
+    yt(Mt);
+  }
+  destroy() {
+    this.destroyed = !0, yt(this.buffer), this.set(0, 0, 0, 0, 0);
+  }
+}
+const us = /* @__PURE__ */ ae(() => new ds()), xn = us, Gt = /* @__PURE__ */ BigInt(2 ** 32 - 1), Be = /* @__PURE__ */ BigInt(32);
+function ls(t, e = !1) {
+  return e ? { h: Number(t & Gt), l: Number(t >> Be & Gt) } : { h: Number(t >> Be & Gt) | 0, l: Number(t & Gt) | 0 };
+}
+function bs(t, e = !1) {
+  const s = t.length;
+  let r = new Uint32Array(s), c = new Uint32Array(s);
+  for (let n = 0; n < s; n++) {
+    const { h: i, l: h } = ls(t[n], e);
+    [r[n], c[n]] = [i, h];
+  }
+  return [r, c];
+}
+const me = (t, e, s) => t >>> s, Ue = (t, e, s) => t << 32 - s | e >>> s, St = (t, e, s) => t >>> s | e << 32 - s, Lt = (t, e, s) => t << 32 - s | e >>> s, vt = (t, e, s) => t << 64 - s | e >>> s - 32, jt = (t, e, s) => t >>> s - 32 | e << 64 - s;
+function rt(t, e, s, r) {
+  const c = (e >>> 0) + (r >>> 0);
+  return { h: t + s + (c / 2 ** 32 | 0) | 0, l: c | 0 };
+}
+const xs = (t, e, s) => (t >>> 0) + (e >>> 0) + (s >>> 0), Hs = (t, e, s, r) => e + s + r + (t / 2 ** 32 | 0) | 0, ps = (t, e, s, r) => (t >>> 0) + (e >>> 0) + (s >>> 0) + (r >>> 0), As = (t, e, s, r, c) => e + s + r + c + (t / 2 ** 32 | 0) | 0, ys = (t, e, s, r, c) => (t >>> 0) + (e >>> 0) + (s >>> 0) + (r >>> 0) + (c >>> 0), gs = (t, e, s, r, c, n) => e + s + r + c + n + (t / 2 ** 32 | 0) | 0, _s = /* @__PURE__ */ Uint32Array.from([
+  1116352408,
+  1899447441,
+  3049323471,
+  3921009573,
+  961987163,
+  1508970993,
+  2453635748,
+  2870763221,
+  3624381080,
+  310598401,
+  607225278,
+  1426881987,
+  1925078388,
+  2162078206,
+  2614888103,
+  3248222580,
+  3835390401,
+  4022224774,
+  264347078,
+  604807628,
+  770255983,
+  1249150122,
+  1555081692,
+  1996064986,
+  2554220882,
+  2821834349,
+  2952996808,
+  3210313671,
+  3336571891,
+  3584528711,
+  113926993,
+  338241895,
+  666307205,
+  773529912,
+  1294757372,
+  1396182291,
+  1695183700,
+  1986661051,
+  2177026350,
+  2456956037,
+  2730485921,
+  2820302411,
+  3259730800,
+  3345764771,
+  3516065817,
+  3600352804,
+  4094571909,
+  275423344,
+  430227734,
+  506948616,
+  659060556,
+  883997877,
+  958139571,
+  1322822218,
+  1537002063,
+  1747873779,
+  1955562222,
+  2024104815,
+  2227730452,
+  2361852424,
+  2428436474,
+  2756734187,
+  3204031479,
+  3329325298
+]), bt = /* @__PURE__ */ new Uint32Array(64);
+let ws = class extends fe {
+  constructor(e = 32) {
+    super(64, e, 8, !1), this.A = lt[0] | 0, this.B = lt[1] | 0, this.C = lt[2] | 0, this.D = lt[3] | 0, this.E = lt[4] | 0, this.F = lt[5] | 0, this.G = lt[6] | 0, this.H = lt[7] | 0;
+  }
+  get() {
+    const { A: e, B: s, C: r, D: c, E: n, F: i, G: h, H: f } = this;
+    return [e, s, r, c, n, i, h, f];
+  }
+  // prettier-ignore
+  set(e, s, r, c, n, i, h, f) {
+    this.A = e | 0, this.B = s | 0, this.C = r | 0, this.D = c | 0, this.E = n | 0, this.F = i | 0, this.G = h | 0, this.H = f | 0;
+  }
+  process(e, s) {
+    for (let a = 0; a < 16; a++, s += 4)
+      bt[a] = e.getUint32(s, !1);
+    for (let a = 16; a < 64; a++) {
+      const y = bt[a - 15], p = bt[a - 2], S = et(y, 7) ^ et(y, 18) ^ y >>> 3, L = et(p, 17) ^ et(p, 19) ^ p >>> 10;
+      bt[a] = L + bt[a - 7] + S + bt[a - 16] | 0;
+    }
+    let { A: r, B: c, C: n, D: i, E: h, F: f, G: u, H: l } = this;
+    for (let a = 0; a < 64; a++) {
+      const y = et(h, 6) ^ et(h, 11) ^ et(h, 25), p = l + y + ns(h, f, u) + _s[a] + bt[a] | 0, L = (et(r, 2) ^ et(r, 13) ^ et(r, 22)) + is(r, c, n) | 0;
+      l = u, u = f, f = h, h = i + p | 0, i = n, n = c, c = r, r = p + L | 0;
+    }
+    r = r + this.A | 0, c = c + this.B | 0, n = n + this.C | 0, i = i + this.D | 0, h = h + this.E | 0, f = f + this.F | 0, u = u + this.G | 0, l = l + this.H | 0, this.set(r, c, n, i, h, f, u, l);
+  }
+  roundClean() {
+    yt(bt);
+  }
+  destroy() {
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), yt(this.buffer);
+  }
+};
+const i0 = bs([
+  "0x428a2f98d728ae22",
+  "0x7137449123ef65cd",
+  "0xb5c0fbcfec4d3b2f",
+  "0xe9b5dba58189dbbc",
+  "0x3956c25bf348b538",
+  "0x59f111f1b605d019",
+  "0x923f82a4af194f9b",
+  "0xab1c5ed5da6d8118",
+  "0xd807aa98a3030242",
+  "0x12835b0145706fbe",
+  "0x243185be4ee4b28c",
+  "0x550c7dc3d5ffb4e2",
+  "0x72be5d74f27b896f",
+  "0x80deb1fe3b1696b1",
+  "0x9bdc06a725c71235",
+  "0xc19bf174cf692694",
+  "0xe49b69c19ef14ad2",
+  "0xefbe4786384f25e3",
+  "0x0fc19dc68b8cd5b5",
+  "0x240ca1cc77ac9c65",
+  "0x2de92c6f592b0275",
+  "0x4a7484aa6ea6e483",
+  "0x5cb0a9dcbd41fbd4",
+  "0x76f988da831153b5",
+  "0x983e5152ee66dfab",
+  "0xa831c66d2db43210",
+  "0xb00327c898fb213f",
+  "0xbf597fc7beef0ee4",
+  "0xc6e00bf33da88fc2",
+  "0xd5a79147930aa725",
+  "0x06ca6351e003826f",
+  "0x142929670a0e6e70",
+  "0x27b70a8546d22ffc",
+  "0x2e1b21385c26c926",
+  "0x4d2c6dfc5ac42aed",
+  "0x53380d139d95b3df",
+  "0x650a73548baf63de",
+  "0x766a0abb3c77b2a8",
+  "0x81c2c92e47edaee6",
+  "0x92722c851482353b",
+  "0xa2bfe8a14cf10364",
+  "0xa81a664bbc423001",
+  "0xc24b8b70d0f89791",
+  "0xc76c51a30654be30",
+  "0xd192e819d6ef5218",
+  "0xd69906245565a910",
+  "0xf40e35855771202a",
+  "0x106aa07032bbd1b8",
+  "0x19a4c116b8d2d0c8",
+  "0x1e376c085141ab53",
+  "0x2748774cdf8eeb99",
+  "0x34b0bcb5e19b48a8",
+  "0x391c0cb3c5c95a63",
+  "0x4ed8aa4ae3418acb",
+  "0x5b9cca4f7763e373",
+  "0x682e6ff3d6b2b8a3",
+  "0x748f82ee5defb2fc",
+  "0x78a5636f43172f60",
+  "0x84c87814a1f0ab72",
+  "0x8cc702081a6439ec",
+  "0x90befffa23631e28",
+  "0xa4506cebde82bde9",
+  "0xbef9a3f7b2c67915",
+  "0xc67178f2e372532b",
+  "0xca273eceea26619c",
+  "0xd186b8c721c0c207",
+  "0xeada7dd6cde0eb1e",
+  "0xf57d4f7fee6ed178",
+  "0x06f067aa72176fba",
+  "0x0a637dc5a2c898a6",
+  "0x113f9804bef90dae",
+  "0x1b710b35131c471b",
+  "0x28db77f523047d84",
+  "0x32caab7b40c72493",
+  "0x3c9ebe0a15c9bebc",
+  "0x431d67c49c100d4c",
+  "0x4cc5d4becb3e42b6",
+  "0x597f299cfc657e2a",
+  "0x5fcb6fab3ad6faec",
+  "0x6c44198c4a475817"
+].map((t) => BigInt(t))), Ss = i0[0], Ls = i0[1], xt = /* @__PURE__ */ new Uint32Array(80), Ht = /* @__PURE__ */ new Uint32Array(80);
+class Is extends fe {
+  constructor(e = 64) {
+    super(128, e, 16, !1), this.Ah = J[0] | 0, this.Al = J[1] | 0, this.Bh = J[2] | 0, this.Bl = J[3] | 0, this.Ch = J[4] | 0, this.Cl = J[5] | 0, this.Dh = J[6] | 0, this.Dl = J[7] | 0, this.Eh = J[8] | 0, this.El = J[9] | 0, this.Fh = J[10] | 0, this.Fl = J[11] | 0, this.Gh = J[12] | 0, this.Gl = J[13] | 0, this.Hh = J[14] | 0, this.Hl = J[15] | 0;
+  }
+  // prettier-ignore
+  get() {
+    const { Ah: e, Al: s, Bh: r, Bl: c, Ch: n, Cl: i, Dh: h, Dl: f, Eh: u, El: l, Fh: a, Fl: y, Gh: p, Gl: S, Hh: L, Hl: C } = this;
+    return [e, s, r, c, n, i, h, f, u, l, a, y, p, S, L, C];
+  }
+  // prettier-ignore
+  set(e, s, r, c, n, i, h, f, u, l, a, y, p, S, L, C) {
+    this.Ah = e | 0, this.Al = s | 0, this.Bh = r | 0, this.Bl = c | 0, this.Ch = n | 0, this.Cl = i | 0, this.Dh = h | 0, this.Dl = f | 0, this.Eh = u | 0, this.El = l | 0, this.Fh = a | 0, this.Fl = y | 0, this.Gh = p | 0, this.Gl = S | 0, this.Hh = L | 0, this.Hl = C | 0;
+  }
+  process(e, s) {
+    for (let w = 0; w < 16; w++, s += 4)
+      xt[w] = e.getUint32(s), Ht[w] = e.getUint32(s += 4);
+    for (let w = 16; w < 80; w++) {
+      const k = xt[w - 15] | 0, A = Ht[w - 15] | 0, I = St(k, A, 1) ^ St(k, A, 8) ^ me(k, A, 7), m = Lt(k, A, 1) ^ Lt(k, A, 8) ^ Ue(k, A, 7), E = xt[w - 2] | 0, d = Ht[w - 2] | 0, b = St(E, d, 19) ^ vt(E, d, 61) ^ me(E, d, 6), x = Lt(E, d, 19) ^ jt(E, d, 61) ^ Ue(E, d, 6), B = ps(m, x, Ht[w - 7], Ht[w - 16]), g = As(B, I, b, xt[w - 7], xt[w - 16]);
+      xt[w] = g | 0, Ht[w] = B | 0;
+    }
+    let { Ah: r, Al: c, Bh: n, Bl: i, Ch: h, Cl: f, Dh: u, Dl: l, Eh: a, El: y, Fh: p, Fl: S, Gh: L, Gl: C, Hh: R, Hl: T } = this;
+    for (let w = 0; w < 80; w++) {
+      const k = St(a, y, 14) ^ St(a, y, 18) ^ vt(a, y, 41), A = Lt(a, y, 14) ^ Lt(a, y, 18) ^ jt(a, y, 41), I = a & p ^ ~a & L, m = y & S ^ ~y & C, E = ys(T, A, m, Ls[w], Ht[w]), d = gs(E, R, k, I, Ss[w], xt[w]), b = E | 0, x = St(r, c, 28) ^ vt(r, c, 34) ^ vt(r, c, 39), B = Lt(r, c, 28) ^ jt(r, c, 34) ^ jt(r, c, 39), g = r & n ^ r & h ^ n & h, U = c & i ^ c & f ^ i & f;
+      R = L | 0, T = C | 0, L = p | 0, C = S | 0, p = a | 0, S = y | 0, { h: a, l: y } = rt(u | 0, l | 0, d | 0, b | 0), u = h | 0, l = f | 0, h = n | 0, f = i | 0, n = r | 0, i = c | 0;
+      const F = xs(b, B, U);
+      r = Hs(F, d, x, g), c = F | 0;
+    }
+    ({ h: r, l: c } = rt(this.Ah | 0, this.Al | 0, r | 0, c | 0)), { h: n, l: i } = rt(this.Bh | 0, this.Bl | 0, n | 0, i | 0), { h, l: f } = rt(this.Ch | 0, this.Cl | 0, h | 0, f | 0), { h: u, l } = rt(this.Dh | 0, this.Dl | 0, u | 0, l | 0), { h: a, l: y } = rt(this.Eh | 0, this.El | 0, a | 0, y | 0), { h: p, l: S } = rt(this.Fh | 0, this.Fl | 0, p | 0, S | 0), { h: L, l: C } = rt(this.Gh | 0, this.Gl | 0, L | 0, C | 0), { h: R, l: T } = rt(this.Hh | 0, this.Hl | 0, R | 0, T | 0), this.set(r, c, n, i, h, f, u, l, a, y, p, S, L, C, R, T);
+  }
+  roundClean() {
+    yt(xt, Ht);
+  }
+  destroy() {
+    yt(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
+  }
+}
+const Bs = /* @__PURE__ */ ae(() => new ws()), ms = /* @__PURE__ */ ae(() => new Is()), pn = Bs, An = ms, Us = BigInt(0), Vt = BigInt(1), Es = BigInt(2), Vs = BigInt(7), ks = BigInt(256), Cs = BigInt(113), r0 = [], c0 = [], o0 = [];
+for (let t = 0, e = Vt, s = 1, r = 0; t < 24; t++) {
+  [s, r] = [r, (2 * s + 3 * r) % 5], r0.push(2 * (5 * r + s)), c0.push((t + 1) * (t + 2) / 2 % 64);
+  let c = Us;
+  for (let n = 0; n < 7; n++)
+    e = (e << Vt ^ (e >> Vs) * Cs) % ks, e & Es && (c ^= Vt << (Vt << BigInt(n)) - Vt);
+  o0.push(c);
+}
+const h0 = j0(o0, !0), Ds = h0[0], Fs = h0[1], Ee = (t, e, s) => s > 32 ? P0(t, e, s) : R0(t, e, s), Ve = (t, e, s) => s > 32 ? N0(t, e, s) : W0(t, e, s);
+function Ts(t, e = 24) {
+  const s = new Uint32Array(10);
+  for (let r = 24 - e; r < 24; r++) {
+    for (let i = 0; i < 10; i++)
+      s[i] = t[i] ^ t[i + 10] ^ t[i + 20] ^ t[i + 30] ^ t[i + 40];
+    for (let i = 0; i < 10; i += 2) {
+      const h = (i + 8) % 10, f = (i + 2) % 10, u = s[f], l = s[f + 1], a = Ee(u, l, 1) ^ s[h], y = Ve(u, l, 1) ^ s[h + 1];
+      for (let p = 0; p < 50; p += 10)
+        t[i + p] ^= a, t[i + p + 1] ^= y;
+    }
+    let c = t[2], n = t[3];
+    for (let i = 0; i < 24; i++) {
+      const h = c0[i], f = Ee(c, n, h), u = Ve(c, n, h), l = r0[i];
+      c = t[l], n = t[l + 1], t[l] = f, t[l + 1] = u;
+    }
+    for (let i = 0; i < 50; i += 10) {
+      for (let h = 0; h < 10; h++)
+        s[h] = t[i + h];
+      for (let h = 0; h < 10; h++)
+        t[i + h] ^= ~s[(h + 2) % 10] & s[(h + 4) % 10];
+    }
+    t[0] ^= Ds[r], t[1] ^= Fs[r];
+  }
+  ot(s);
+}
+class de {
+  state;
+  pos = 0;
+  posOut = 0;
+  finished = !1;
+  state32;
+  destroyed = !1;
+  blockLen;
+  suffix;
+  outputLen;
+  enableXOF = !1;
+  rounds;
+  // NOTE: we accept arguments in bytes instead of bits here.
+  constructor(e, s, r, c = !1, n = 24) {
+    if (this.blockLen = e, this.suffix = s, this.outputLen = r, this.enableXOF = c, this.rounds = n, be(r, "outputLen"), !(0 < e && e < 200))
+      throw new Error("only keccak-f1600 function is supported");
+    this.state = new Uint8Array(200), this.state32 = m0(this.state);
+  }
+  clone() {
+    return this._cloneInto();
+  }
+  keccak() {
+    xe(this.state32), Ts(this.state32, this.rounds), xe(this.state32), this.posOut = 0, this.pos = 0;
+  }
+  update(e) {
+    Rt(this), Dt(e);
+    const { blockLen: s, state: r } = this, c = e.length;
+    for (let n = 0; n < c; ) {
+      const i = Math.min(s - this.pos, c - n);
+      for (let h = 0; h < i; h++)
+        r[this.pos++] ^= e[n++];
+      this.pos === s && this.keccak();
+    }
+    return this;
+  }
+  finish() {
+    if (this.finished)
+      return;
+    this.finished = !0;
+    const { state: e, suffix: s, pos: r, blockLen: c } = this;
+    e[r] ^= s, (s & 128) !== 0 && r === c - 1 && this.keccak(), e[c - 1] ^= 128, this.keccak();
+  }
+  writeInto(e) {
+    Rt(this, !1), Dt(e), this.finish();
+    const s = this.state, { blockLen: r } = this;
+    for (let c = 0, n = e.length; c < n; ) {
+      this.posOut >= r && this.keccak();
+      const i = Math.min(r - this.posOut, n - c);
+      e.set(s.subarray(this.posOut, this.posOut + i), c), this.posOut += i, c += i;
+    }
+    return e;
+  }
+  xofInto(e) {
+    if (!this.enableXOF)
+      throw new Error("XOF is not possible for this instance");
+    return this.writeInto(e);
+  }
+  xof(e) {
+    return be(e), this.xofInto(new Uint8Array(e));
+  }
+  digestInto(e) {
+    if (Pe(e, this), this.finished)
+      throw new Error("digest() was already called");
+    return this.writeInto(e), this.destroy(), e;
+  }
+  digest() {
+    return this.digestInto(new Uint8Array(this.outputLen));
+  }
+  destroy() {
+    this.destroyed = !0, ot(this.state);
+  }
+  _cloneInto(e) {
+    const { blockLen: s, suffix: r, outputLen: c, rounds: n, enableXOF: i } = this;
+    return e ||= new de(s, r, c, i, n), e.state32.set(this.state32), e.pos = this.pos, e.posOut = this.posOut, e.finished = this.finished, e.rounds = n, e.suffix = r, e.outputLen = c, e.enableXOF = i, e.destroyed = this.destroyed, e;
+  }
+}
+const a0 = (t, e, s, r = {}) => qt((c = {}) => new de(e, t, c.dkLen === void 0 ? s : c.dkLen, !0), r), yn = /* @__PURE__ */ a0(31, 168, 16, /* @__PURE__ */ re(11)), gn = /* @__PURE__ */ a0(31, 136, 32, /* @__PURE__ */ re(12)), It = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function Os(t) {
+  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
+}
+function ke(t) {
+  if (!Number.isSafeInteger(t) || t < 0)
+    throw new Error("positive integer expected, got " + t);
+}
+function Bt(t, ...e) {
+  if (!Os(t))
+    throw new Error("Uint8Array expected");
+  if (e.length > 0 && !e.includes(t.length))
+    throw new Error("Uint8Array expected of length " + e + ", got length=" + t.length);
+}
+function Ms(t) {
+  if (typeof t != "function" || typeof t.create != "function")
+    throw new Error("Hash should be wrapped by utils.createHasher");
+  ke(t.outputLen), ke(t.blockLen);
+}
+function Pt(t, e = !0) {
+  if (t.destroyed)
+    throw new Error("Hash instance has been destroyed");
+  if (e && t.finished)
+    throw new Error("Hash#digest() has already been called");
+}
+function Gs(t, e) {
+  Bt(t);
+  const s = e.outputLen;
+  if (t.length < s)
+    throw new Error("digestInto() expects output buffer of length at least " + s);
+}
+function Nt(...t) {
+  for (let e = 0; e < t.length; e++)
+    t[e].fill(0);
+}
+function te(t) {
+  return new DataView(t.buffer, t.byteOffset, t.byteLength);
+}
+function st(t, e) {
+  return t << 32 - e | t >>> e;
+}
+const f0 = /* @ts-ignore */ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", vs = /* @__PURE__ */ Array.from({ length: 256 }, (t, e) => e.toString(16).padStart(2, "0"));
+function _n(t) {
+  if (Bt(t), f0)
+    return t.toHex();
+  let e = "";
+  for (let s = 0; s < t.length; s++)
+    e += vs[t[s]];
+  return e;
+}
+const ct = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
+function Ce(t) {
+  if (t >= ct._0 && t <= ct._9)
+    return t - ct._0;
+  if (t >= ct.A && t <= ct.F)
+    return t - (ct.A - 10);
+  if (t >= ct.a && t <= ct.f)
+    return t - (ct.a - 10);
+}
+function wn(t) {
+  if (typeof t != "string")
+    throw new Error("hex string expected, got " + typeof t);
+  if (f0)
+    return Uint8Array.fromHex(t);
+  const e = t.length, s = e / 2;
+  if (e % 2)
+    throw new Error("hex string expected, got unpadded hex of length " + e);
+  const r = new Uint8Array(s);
+  for (let c = 0, n = 0; c < s; c++, n += 2) {
+    const i = Ce(t.charCodeAt(n)), h = Ce(t.charCodeAt(n + 1));
+    if (i === void 0 || h === void 0) {
+      const f = t[n] + t[n + 1];
+      throw new Error('hex string expected, got non-hex character "' + f + '" at index ' + n);
+    }
+    r[c] = i * 16 + h;
+  }
+  return r;
+}
+function js(t) {
+  if (typeof t != "string")
+    throw new Error("string expected");
+  return new Uint8Array(new TextEncoder().encode(t));
+}
+function ue(t) {
+  return typeof t == "string" && (t = js(t)), Bt(t), t;
+}
+function Sn(...t) {
+  let e = 0;
+  for (let r = 0; r < t.length; r++) {
+    const c = t[r];
+    Bt(c), e += c.length;
+  }
+  const s = new Uint8Array(e);
+  for (let r = 0, c = 0; r < t.length; r++) {
+    const n = t[r];
+    s.set(n, c), c += n.length;
+  }
+  return s;
+}
+class d0 {
+}
+function Rs(t) {
+  const e = (r) => t().update(ue(r)).digest(), s = t();
+  return e.outputLen = s.outputLen, e.blockLen = s.blockLen, e.create = () => t(), e;
+}
+function Ln(t = 32) {
+  if (It && typeof It.getRandomValues == "function")
+    return It.getRandomValues(new Uint8Array(t));
+  if (It && typeof It.randomBytes == "function")
+    return Uint8Array.from(It.randomBytes(t));
+  throw new Error("crypto.getRandomValues must be defined");
+}
+function Ws(t, e, s, r) {
+  if (typeof t.setBigUint64 == "function")
+    return t.setBigUint64(e, s, r);
+  const c = BigInt(32), n = BigInt(4294967295), i = Number(s >> c & n), h = Number(s & n), f = r ? 4 : 0, u = r ? 0 : 4;
+  t.setUint32(e + f, i, r), t.setUint32(e + u, h, r);
+}
+function Ps(t, e, s) {
+  return t & e ^ ~t & s;
+}
+function Ns(t, e, s) {
+  return t & e ^ t & s ^ e & s;
+}
+class qs extends d0 {
+  constructor(e, s, r, c) {
+    super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = e, this.outputLen = s, this.padOffset = r, this.isLE = c, this.buffer = new Uint8Array(e), this.view = te(this.buffer);
+  }
+  update(e) {
+    Pt(this), e = ue(e), Bt(e);
+    const { view: s, buffer: r, blockLen: c } = this, n = e.length;
+    for (let i = 0; i < n; ) {
+      const h = Math.min(c - this.pos, n - i);
+      if (h === c) {
+        const f = te(e);
+        for (; c <= n - i; i += c)
+          this.process(f, i);
+        continue;
+      }
+      r.set(e.subarray(i, i + h), this.pos), this.pos += h, i += h, this.pos === c && (this.process(s, 0), this.pos = 0);
+    }
+    return this.length += e.length, this.roundClean(), this;
+  }
+  digestInto(e) {
+    Pt(this), Gs(e, this), this.finished = !0;
+    const { buffer: s, view: r, blockLen: c, isLE: n } = this;
+    let { pos: i } = this;
+    s[i++] = 128, Nt(this.buffer.subarray(i)), this.padOffset > c - i && (this.process(r, 0), i = 0);
+    for (let a = i; a < c; a++)
+      s[a] = 0;
+    Ws(r, c - 8, BigInt(this.length * 8), n), this.process(r, 0);
+    const h = te(e), f = this.outputLen;
+    if (f % 4)
+      throw new Error("_sha2: outputLen should be aligned to 32bit");
+    const u = f / 4, l = this.get();
+    if (u > l.length)
+      throw new Error("_sha2: outputLen bigger than state");
+    for (let a = 0; a < u; a++)
+      h.setUint32(4 * a, l[a], n);
+  }
+  digest() {
+    const { buffer: e, outputLen: s } = this;
+    this.digestInto(e);
+    const r = e.slice(0, s);
+    return this.destroy(), r;
+  }
+  _cloneInto(e) {
+    e || (e = new this.constructor()), e.set(...this.get());
+    const { blockLen: s, buffer: r, length: c, finished: n, destroyed: i, pos: h } = this;
+    return e.destroyed = i, e.finished = n, e.length = c, e.pos = h, c % s && e.buffer.set(r), e;
+  }
+  clone() {
+    return this._cloneInto();
+  }
+}
+const pt = /* @__PURE__ */ Uint32Array.from([
+  1779033703,
+  3144134277,
+  1013904242,
+  2773480762,
+  1359893119,
+  2600822924,
+  528734635,
+  1541459225
+]), Ks = /* @__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
+]), At = /* @__PURE__ */ new Uint32Array(64);
+class Xs extends qs {
+  constructor(e = 32) {
+    super(64, e, 8, !1), this.A = pt[0] | 0, this.B = pt[1] | 0, this.C = pt[2] | 0, this.D = pt[3] | 0, this.E = pt[4] | 0, this.F = pt[5] | 0, this.G = pt[6] | 0, this.H = pt[7] | 0;
+  }
+  get() {
+    const { A: e, B: s, C: r, D: c, E: n, F: i, G: h, H: f } = this;
+    return [e, s, r, c, n, i, h, f];
+  }
+  // prettier-ignore
+  set(e, s, r, c, n, i, h, f) {
+    this.A = e | 0, this.B = s | 0, this.C = r | 0, this.D = c | 0, this.E = n | 0, this.F = i | 0, this.G = h | 0, this.H = f | 0;
+  }
+  process(e, s) {
+    for (let a = 0; a < 16; a++, s += 4)
+      At[a] = e.getUint32(s, !1);
+    for (let a = 16; a < 64; a++) {
+      const y = At[a - 15], p = At[a - 2], S = st(y, 7) ^ st(y, 18) ^ y >>> 3, L = st(p, 17) ^ st(p, 19) ^ p >>> 10;
+      At[a] = L + At[a - 7] + S + At[a - 16] | 0;
+    }
+    let { A: r, B: c, C: n, D: i, E: h, F: f, G: u, H: l } = this;
+    for (let a = 0; a < 64; a++) {
+      const y = st(h, 6) ^ st(h, 11) ^ st(h, 25), p = l + y + Ps(h, f, u) + Ks[a] + At[a] | 0, L = (st(r, 2) ^ st(r, 13) ^ st(r, 22)) + Ns(r, c, n) | 0;
+      l = u, u = f, f = h, h = i + p | 0, i = n, n = c, c = r, r = p + L | 0;
+    }
+    r = r + this.A | 0, c = c + this.B | 0, n = n + this.C | 0, i = i + this.D | 0, h = h + this.E | 0, f = f + this.F | 0, u = u + this.G | 0, l = l + this.H | 0, this.set(r, c, n, i, h, f, u, l);
+  }
+  roundClean() {
+    Nt(At);
+  }
+  destroy() {
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), Nt(this.buffer);
+  }
+}
+const In = /* @__PURE__ */ Rs(() => new Xs());
+class u0 extends d0 {
+  constructor(e, s) {
+    super(), this.finished = !1, this.destroyed = !1, Ms(e);
+    const r = ue(s);
+    if (this.iHash = e.create(), typeof this.iHash.update != "function")
+      throw new Error("Expected instance of class which extends utils.Hash");
+    this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
+    const c = this.blockLen, n = new Uint8Array(c);
+    n.set(r.length > c ? e.create().update(r).digest() : r);
+    for (let i = 0; i < n.length; i++)
+      n[i] ^= 54;
+    this.iHash.update(n), this.oHash = e.create();
+    for (let i = 0; i < n.length; i++)
+      n[i] ^= 106;
+    this.oHash.update(n), Nt(n);
+  }
+  update(e) {
+    return Pt(this), this.iHash.update(e), this;
+  }
+  digestInto(e) {
+    Pt(this), Bt(e, this.outputLen), this.finished = !0, this.iHash.digestInto(e), this.oHash.update(e), this.oHash.digestInto(e), this.destroy();
+  }
+  digest() {
+    const e = new Uint8Array(this.oHash.outputLen);
+    return this.digestInto(e), e;
+  }
+  _cloneInto(e) {
+    e || (e = Object.create(Object.getPrototypeOf(this), {}));
+    const { oHash: s, iHash: r, finished: c, destroyed: n, blockLen: i, outputLen: h } = this;
+    return e = e, e.finished = c, e.destroyed = n, e.blockLen = i, e.outputLen = h, e.oHash = s._cloneInto(e.oHash), e.iHash = r._cloneInto(e.iHash), e;
+  }
+  clone() {
+    return this._cloneInto();
+  }
+  destroy() {
+    this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
+  }
+}
+const $s = (t, e, s) => new u0(t, e).update(s).digest();
+$s.create = (t, e) => new u0(t, e);
+var Z = {}, P = {}, Q = {}, ee = {}, kt = {}, De;
+function Js() {
+  return De || (De = 1, Object.defineProperty(kt, "__esModule", { value: !0 }), kt.crypto = void 0, kt.crypto = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0), kt;
+}
+var Fe;
+function Xt() {
+  return Fe || (Fe = 1, (function(t) {
+    /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+    Object.defineProperty(t, "__esModule", { value: !0 }), t.wrapXOFConstructorWithOpts = t.wrapConstructorWithOpts = t.wrapConstructor = t.Hash = t.nextTick = t.swap32IfBE = t.byteSwapIfBE = t.swap8IfBE = t.isLE = void 0, t.isBytes = s, t.anumber = r, t.abytes = c, t.ahash = n, t.aexists = i, t.aoutput = h, t.u8 = f, t.u32 = u, t.clean = l, t.createView = a, t.rotr = y, t.rotl = p, t.byteSwap = S, t.byteSwap32 = L, t.bytesToHex = T, t.hexToBytes = A, t.asyncLoop = m, t.utf8ToBytes = E, t.bytesToUtf8 = d, t.toBytes = b, t.kdfInputToBytes = x, t.concatBytes = B, t.checkOpts = g, t.createHasher = F, t.createOptHasher = G, t.createXOFer = v, t.randomBytes = N;
+    const e = /* @__PURE__ */ Js();
+    function s(o) {
+      return o instanceof Uint8Array || ArrayBuffer.isView(o) && o.constructor.name === "Uint8Array";
+    }
+    function r(o) {
+      if (!Number.isSafeInteger(o) || o < 0)
+        throw new Error("positive integer expected, got " + o);
+    }
+    function c(o, ...H) {
+      if (!s(o))
+        throw new Error("Uint8Array expected");
+      if (H.length > 0 && !H.includes(o.length))
+        throw new Error("Uint8Array expected of length " + H + ", got length=" + o.length);
+    }
+    function n(o) {
+      if (typeof o != "function" || typeof o.create != "function")
+        throw new Error("Hash should be wrapped by utils.createHasher");
+      r(o.outputLen), r(o.blockLen);
+    }
+    function i(o, H = !0) {
+      if (o.destroyed)
+        throw new Error("Hash instance has been destroyed");
+      if (H && o.finished)
+        throw new Error("Hash#digest() has already been called");
+    }
+    function h(o, H) {
+      c(o);
+      const _ = H.outputLen;
+      if (o.length < _)
+        throw new Error("digestInto() expects output buffer of length at least " + _);
+    }
+    function f(o) {
+      return new Uint8Array(o.buffer, o.byteOffset, o.byteLength);
+    }
+    function u(o) {
+      return new Uint32Array(o.buffer, o.byteOffset, Math.floor(o.byteLength / 4));
+    }
+    function l(...o) {
+      for (let H = 0; H < o.length; H++)
+        o[H].fill(0);
+    }
+    function a(o) {
+      return new DataView(o.buffer, o.byteOffset, o.byteLength);
+    }
+    function y(o, H) {
+      return o << 32 - H | o >>> H;
+    }
+    function p(o, H) {
+      return o << H | o >>> 32 - H >>> 0;
+    }
+    t.isLE = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+    function S(o) {
+      return o << 24 & 4278190080 | o << 8 & 16711680 | o >>> 8 & 65280 | o >>> 24 & 255;
+    }
+    t.swap8IfBE = t.isLE ? (o) => o : (o) => S(o), t.byteSwapIfBE = t.swap8IfBE;
+    function L(o) {
+      for (let H = 0; H < o.length; H++)
+        o[H] = S(o[H]);
+      return o;
+    }
+    t.swap32IfBE = t.isLE ? (o) => o : L;
+    const C = /* @ts-ignore */ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", R = /* @__PURE__ */ Array.from({ length: 256 }, (o, H) => H.toString(16).padStart(2, "0"));
+    function T(o) {
+      if (c(o), C)
+        return o.toHex();
+      let H = "";
+      for (let _ = 0; _ < o.length; _++)
+        H += R[o[_]];
+      return H;
+    }
+    const w = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
+    function k(o) {
+      if (o >= w._0 && o <= w._9)
+        return o - w._0;
+      if (o >= w.A && o <= w.F)
+        return o - (w.A - 10);
+      if (o >= w.a && o <= w.f)
+        return o - (w.a - 10);
+    }
+    function A(o) {
+      if (typeof o != "string")
+        throw new Error("hex string expected, got " + typeof o);
+      if (C)
+        return Uint8Array.fromHex(o);
+      const H = o.length, _ = H / 2;
+      if (H % 2)
+        throw new Error("hex string expected, got unpadded hex of length " + H);
+      const V = new Uint8Array(_);
+      for (let D = 0, j = 0; D < _; D++, j += 2) {
+        const Y = k(o.charCodeAt(j)), q = k(o.charCodeAt(j + 1));
+        if (Y === void 0 || q === void 0) {
+          const K = o[j] + o[j + 1];
+          throw new Error('hex string expected, got non-hex character "' + K + '" at index ' + j);
+        }
+        V[D] = Y * 16 + q;
+      }
+      return V;
+    }
+    const I = async () => {
+    };
+    t.nextTick = I;
+    async function m(o, H, _) {
+      let V = Date.now();
+      for (let D = 0; D < o; D++) {
+        _(D);
+        const j = Date.now() - V;
+        j >= 0 && j < H || (await (0, t.nextTick)(), V += j);
+      }
+    }
+    function E(o) {
+      if (typeof o != "string")
+        throw new Error("string expected");
+      return new Uint8Array(new TextEncoder().encode(o));
+    }
+    function d(o) {
+      return new TextDecoder().decode(o);
+    }
+    function b(o) {
+      return typeof o == "string" && (o = E(o)), c(o), o;
+    }
+    function x(o) {
+      return typeof o == "string" && (o = E(o)), c(o), o;
+    }
+    function B(...o) {
+      let H = 0;
+      for (let V = 0; V < o.length; V++) {
+        const D = o[V];
+        c(D), H += D.length;
+      }
+      const _ = new Uint8Array(H);
+      for (let V = 0, D = 0; V < o.length; V++) {
+        const j = o[V];
+        _.set(j, D), D += j.length;
+      }
+      return _;
+    }
+    function g(o, H) {
+      if (H !== void 0 && {}.toString.call(H) !== "[object Object]")
+        throw new Error("options should be object or undefined");
+      return Object.assign(o, H);
+    }
+    class U {
+    }
+    t.Hash = U;
+    function F(o) {
+      const H = (V) => o().update(b(V)).digest(), _ = o();
+      return H.outputLen = _.outputLen, H.blockLen = _.blockLen, H.create = () => o(), H;
+    }
+    function G(o) {
+      const H = (V, D) => o(D).update(b(V)).digest(), _ = o({});
+      return H.outputLen = _.outputLen, H.blockLen = _.blockLen, H.create = (V) => o(V), H;
+    }
+    function v(o) {
+      const H = (V, D) => o(D).update(b(V)).digest(), _ = o({});
+      return H.outputLen = _.outputLen, H.blockLen = _.blockLen, H.create = (V) => o(V), H;
+    }
+    t.wrapConstructor = F, t.wrapConstructorWithOpts = G, t.wrapXOFConstructorWithOpts = v;
+    function N(o = 32) {
+      if (e.crypto && typeof e.crypto.getRandomValues == "function")
+        return e.crypto.getRandomValues(new Uint8Array(o));
+      if (e.crypto && typeof e.crypto.randomBytes == "function")
+        return Uint8Array.from(e.crypto.randomBytes(o));
+      throw new Error("crypto.getRandomValues must be defined");
+    }
+  })(ee)), ee;
+}
+var Te;
+function Qs() {
+  if (Te) return Q;
+  Te = 1, Object.defineProperty(Q, "__esModule", { value: !0 }), Q.SHA512_IV = Q.SHA384_IV = Q.SHA224_IV = Q.SHA256_IV = Q.HashMD = void 0, Q.setBigUint64 = e, Q.Chi = s, Q.Maj = r;
+  const t = /* @__PURE__ */ Xt();
+  function e(n, i, h, f) {
+    if (typeof n.setBigUint64 == "function")
+      return n.setBigUint64(i, h, f);
+    const u = BigInt(32), l = BigInt(4294967295), a = Number(h >> u & l), y = Number(h & l), p = f ? 4 : 0, S = f ? 0 : 4;
+    n.setUint32(i + p, a, f), n.setUint32(i + S, y, f);
+  }
+  function s(n, i, h) {
+    return n & i ^ ~n & h;
+  }
+  function r(n, i, h) {
+    return n & i ^ n & h ^ i & h;
+  }
+  class c extends t.Hash {
+    constructor(i, h, f, u) {
+      super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = i, this.outputLen = h, this.padOffset = f, this.isLE = u, this.buffer = new Uint8Array(i), this.view = (0, t.createView)(this.buffer);
+    }
+    update(i) {
+      (0, t.aexists)(this), i = (0, t.toBytes)(i), (0, t.abytes)(i);
+      const { view: h, buffer: f, blockLen: u } = this, l = i.length;
+      for (let a = 0; a < l; ) {
+        const y = Math.min(u - this.pos, l - a);
+        if (y === u) {
+          const p = (0, t.createView)(i);
+          for (; u <= l - a; a += u)
+            this.process(p, a);
+          continue;
+        }
+        f.set(i.subarray(a, a + y), this.pos), this.pos += y, a += y, this.pos === u && (this.process(h, 0), this.pos = 0);
+      }
+      return this.length += i.length, this.roundClean(), this;
+    }
+    digestInto(i) {
+      (0, t.aexists)(this), (0, t.aoutput)(i, this), this.finished = !0;
+      const { buffer: h, view: f, blockLen: u, isLE: l } = this;
+      let { pos: a } = this;
+      h[a++] = 128, (0, t.clean)(this.buffer.subarray(a)), this.padOffset > u - a && (this.process(f, 0), a = 0);
+      for (let C = a; C < u; C++)
+        h[C] = 0;
+      e(f, u - 8, BigInt(this.length * 8), l), this.process(f, 0);
+      const y = (0, t.createView)(i), p = this.outputLen;
+      if (p % 4)
+        throw new Error("_sha2: outputLen should be aligned to 32bit");
+      const S = p / 4, L = this.get();
+      if (S > L.length)
+        throw new Error("_sha2: outputLen bigger than state");
+      for (let C = 0; C < S; C++)
+        y.setUint32(4 * C, L[C], l);
+    }
+    digest() {
+      const { buffer: i, outputLen: h } = this;
+      this.digestInto(i);
+      const f = i.slice(0, h);
+      return this.destroy(), f;
+    }
+    _cloneInto(i) {
+      i || (i = new this.constructor()), i.set(...this.get());
+      const { blockLen: h, buffer: f, length: u, finished: l, destroyed: a, pos: y } = this;
+      return i.destroyed = a, i.finished = l, i.length = u, i.pos = y, u % h && i.buffer.set(f), i;
+    }
+    clone() {
+      return this._cloneInto();
+    }
+  }
+  return Q.HashMD = c, Q.SHA256_IV = Uint32Array.from([
+    1779033703,
+    3144134277,
+    1013904242,
+    2773480762,
+    1359893119,
+    2600822924,
+    528734635,
+    1541459225
+  ]), Q.SHA224_IV = Uint32Array.from([
+    3238371032,
+    914150663,
+    812702999,
+    4144912697,
+    4290775857,
+    1750603025,
+    1694076839,
+    3204075428
+  ]), Q.SHA384_IV = Uint32Array.from([
+    3418070365,
+    3238371032,
+    1654270250,
+    914150663,
+    2438529370,
+    812702999,
+    355462360,
+    4144912697,
+    1731405415,
+    4290775857,
+    2394180231,
+    1750603025,
+    3675008525,
+    1694076839,
+    1203062813,
+    3204075428
+  ]), Q.SHA512_IV = Uint32Array.from([
+    1779033703,
+    4089235720,
+    3144134277,
+    2227873595,
+    1013904242,
+    4271175723,
+    2773480762,
+    1595750129,
+    1359893119,
+    2917565137,
+    2600822924,
+    725511199,
+    528734635,
+    4215389547,
+    1541459225,
+    327033209
+  ]), Q;
+}
+var M = {}, Oe;
+function Ys() {
+  if (Oe) return M;
+  Oe = 1, Object.defineProperty(M, "__esModule", { value: !0 }), M.toBig = M.shrSL = M.shrSH = M.rotrSL = M.rotrSH = M.rotrBL = M.rotrBH = M.rotr32L = M.rotr32H = M.rotlSL = M.rotlSH = M.rotlBL = M.rotlBH = M.add5L = M.add5H = M.add4L = M.add4H = M.add3L = M.add3H = void 0, M.add = R, M.fromBig = s, M.split = r;
+  const t = /* @__PURE__ */ BigInt(2 ** 32 - 1), e = /* @__PURE__ */ BigInt(32);
+  function s(d, b = !1) {
+    return b ? { h: Number(d & t), l: Number(d >> e & t) } : { h: Number(d >> e & t) | 0, l: Number(d & t) | 0 };
+  }
+  function r(d, b = !1) {
+    const x = d.length;
+    let B = new Uint32Array(x), g = new Uint32Array(x);
+    for (let U = 0; U < x; U++) {
+      const { h: F, l: G } = s(d[U], b);
+      [B[U], g[U]] = [F, G];
+    }
+    return [B, g];
+  }
+  const c = (d, b) => BigInt(d >>> 0) << e | BigInt(b >>> 0);
+  M.toBig = c;
+  const n = (d, b, x) => d >>> x;
+  M.shrSH = n;
+  const i = (d, b, x) => d << 32 - x | b >>> x;
+  M.shrSL = i;
+  const h = (d, b, x) => d >>> x | b << 32 - x;
+  M.rotrSH = h;
+  const f = (d, b, x) => d << 32 - x | b >>> x;
+  M.rotrSL = f;
+  const u = (d, b, x) => d << 64 - x | b >>> x - 32;
+  M.rotrBH = u;
+  const l = (d, b, x) => d >>> x - 32 | b << 64 - x;
+  M.rotrBL = l;
+  const a = (d, b) => b;
+  M.rotr32H = a;
+  const y = (d, b) => d;
+  M.rotr32L = y;
+  const p = (d, b, x) => d << x | b >>> 32 - x;
+  M.rotlSH = p;
+  const S = (d, b, x) => b << x | d >>> 32 - x;
+  M.rotlSL = S;
+  const L = (d, b, x) => b << x - 32 | d >>> 64 - x;
+  M.rotlBH = L;
+  const C = (d, b, x) => d << x - 32 | b >>> 64 - x;
+  M.rotlBL = C;
+  function R(d, b, x, B) {
+    const g = (b >>> 0) + (B >>> 0);
+    return { h: d + x + (g / 2 ** 32 | 0) | 0, l: g | 0 };
+  }
+  const T = (d, b, x) => (d >>> 0) + (b >>> 0) + (x >>> 0);
+  M.add3L = T;
+  const w = (d, b, x, B) => b + x + B + (d / 2 ** 32 | 0) | 0;
+  M.add3H = w;
+  const k = (d, b, x, B) => (d >>> 0) + (b >>> 0) + (x >>> 0) + (B >>> 0);
+  M.add4L = k;
+  const A = (d, b, x, B, g) => b + x + B + g + (d / 2 ** 32 | 0) | 0;
+  M.add4H = A;
+  const I = (d, b, x, B, g) => (d >>> 0) + (b >>> 0) + (x >>> 0) + (B >>> 0) + (g >>> 0);
+  M.add5L = I;
+  const m = (d, b, x, B, g, U) => b + x + B + g + U + (d / 2 ** 32 | 0) | 0;
+  M.add5H = m;
+  const E = {
+    fromBig: s,
+    split: r,
+    toBig: c,
+    shrSH: n,
+    shrSL: i,
+    rotrSH: h,
+    rotrSL: f,
+    rotrBH: u,
+    rotrBL: l,
+    rotr32H: a,
+    rotr32L: y,
+    rotlSH: p,
+    rotlSL: S,
+    rotlBH: L,
+    rotlBL: C,
+    add: R,
+    add3L: T,
+    add3H: w,
+    add4L: k,
+    add4H: A,
+    add5H: m,
+    add5L: I
+  };
+  return M.default = E, M;
+}
+var Me;
+function l0() {
+  if (Me) return P;
+  Me = 1, Object.defineProperty(P, "__esModule", { value: !0 }), P.sha512_224 = P.sha512_256 = P.sha384 = P.sha512 = P.sha224 = P.sha256 = P.SHA512_256 = P.SHA512_224 = P.SHA384 = P.SHA512 = P.SHA224 = P.SHA256 = void 0;
+  const t = /* @__PURE__ */ Qs(), e = /* @__PURE__ */ Ys(), s = /* @__PURE__ */ Xt(), r = /* @__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
+  ]), c = /* @__PURE__ */ new Uint32Array(64);
+  class n extends t.HashMD {
+    constructor(w = 32) {
+      super(64, w, 8, !1), this.A = t.SHA256_IV[0] | 0, this.B = t.SHA256_IV[1] | 0, this.C = t.SHA256_IV[2] | 0, this.D = t.SHA256_IV[3] | 0, this.E = t.SHA256_IV[4] | 0, this.F = t.SHA256_IV[5] | 0, this.G = t.SHA256_IV[6] | 0, this.H = t.SHA256_IV[7] | 0;
+    }
+    get() {
+      const { A: w, B: k, C: A, D: I, E: m, F: E, G: d, H: b } = this;
+      return [w, k, A, I, m, E, d, b];
+    }
+    // prettier-ignore
+    set(w, k, A, I, m, E, d, b) {
+      this.A = w | 0, this.B = k | 0, this.C = A | 0, this.D = I | 0, this.E = m | 0, this.F = E | 0, this.G = d | 0, this.H = b | 0;
+    }
+    process(w, k) {
+      for (let g = 0; g < 16; g++, k += 4)
+        c[g] = w.getUint32(k, !1);
+      for (let g = 16; g < 64; g++) {
+        const U = c[g - 15], F = c[g - 2], G = (0, s.rotr)(U, 7) ^ (0, s.rotr)(U, 18) ^ U >>> 3, v = (0, s.rotr)(F, 17) ^ (0, s.rotr)(F, 19) ^ F >>> 10;
+        c[g] = v + c[g - 7] + G + c[g - 16] | 0;
+      }
+      let { A, B: I, C: m, D: E, E: d, F: b, G: x, H: B } = this;
+      for (let g = 0; g < 64; g++) {
+        const U = (0, s.rotr)(d, 6) ^ (0, s.rotr)(d, 11) ^ (0, s.rotr)(d, 25), F = B + U + (0, t.Chi)(d, b, x) + r[g] + c[g] | 0, v = ((0, s.rotr)(A, 2) ^ (0, s.rotr)(A, 13) ^ (0, s.rotr)(A, 22)) + (0, t.Maj)(A, I, m) | 0;
+        B = x, x = b, b = d, d = E + F | 0, E = m, m = I, I = A, A = F + v | 0;
+      }
+      A = A + this.A | 0, I = I + this.B | 0, m = m + this.C | 0, E = E + this.D | 0, d = d + this.E | 0, b = b + this.F | 0, x = x + this.G | 0, B = B + this.H | 0, this.set(A, I, m, E, d, b, x, B);
+    }
+    roundClean() {
+      (0, s.clean)(c);
+    }
+    destroy() {
+      this.set(0, 0, 0, 0, 0, 0, 0, 0), (0, s.clean)(this.buffer);
+    }
+  }
+  P.SHA256 = n;
+  class i extends n {
+    constructor() {
+      super(28), this.A = t.SHA224_IV[0] | 0, this.B = t.SHA224_IV[1] | 0, this.C = t.SHA224_IV[2] | 0, this.D = t.SHA224_IV[3] | 0, this.E = t.SHA224_IV[4] | 0, this.F = t.SHA224_IV[5] | 0, this.G = t.SHA224_IV[6] | 0, this.H = t.SHA224_IV[7] | 0;
+    }
+  }
+  P.SHA224 = i;
+  const h = e.split([
+    "0x428a2f98d728ae22",
+    "0x7137449123ef65cd",
+    "0xb5c0fbcfec4d3b2f",
+    "0xe9b5dba58189dbbc",
+    "0x3956c25bf348b538",
+    "0x59f111f1b605d019",
+    "0x923f82a4af194f9b",
+    "0xab1c5ed5da6d8118",
+    "0xd807aa98a3030242",
+    "0x12835b0145706fbe",
+    "0x243185be4ee4b28c",
+    "0x550c7dc3d5ffb4e2",
+    "0x72be5d74f27b896f",
+    "0x80deb1fe3b1696b1",
+    "0x9bdc06a725c71235",
+    "0xc19bf174cf692694",
+    "0xe49b69c19ef14ad2",
+    "0xefbe4786384f25e3",
+    "0x0fc19dc68b8cd5b5",
+    "0x240ca1cc77ac9c65",
+    "0x2de92c6f592b0275",
+    "0x4a7484aa6ea6e483",
+    "0x5cb0a9dcbd41fbd4",
+    "0x76f988da831153b5",
+    "0x983e5152ee66dfab",
+    "0xa831c66d2db43210",
+    "0xb00327c898fb213f",
+    "0xbf597fc7beef0ee4",
+    "0xc6e00bf33da88fc2",
+    "0xd5a79147930aa725",
+    "0x06ca6351e003826f",
+    "0x142929670a0e6e70",
+    "0x27b70a8546d22ffc",
+    "0x2e1b21385c26c926",
+    "0x4d2c6dfc5ac42aed",
+    "0x53380d139d95b3df",
+    "0x650a73548baf63de",
+    "0x766a0abb3c77b2a8",
+    "0x81c2c92e47edaee6",
+    "0x92722c851482353b",
+    "0xa2bfe8a14cf10364",
+    "0xa81a664bbc423001",
+    "0xc24b8b70d0f89791",
+    "0xc76c51a30654be30",
+    "0xd192e819d6ef5218",
+    "0xd69906245565a910",
+    "0xf40e35855771202a",
+    "0x106aa07032bbd1b8",
+    "0x19a4c116b8d2d0c8",
+    "0x1e376c085141ab53",
+    "0x2748774cdf8eeb99",
+    "0x34b0bcb5e19b48a8",
+    "0x391c0cb3c5c95a63",
+    "0x4ed8aa4ae3418acb",
+    "0x5b9cca4f7763e373",
+    "0x682e6ff3d6b2b8a3",
+    "0x748f82ee5defb2fc",
+    "0x78a5636f43172f60",
+    "0x84c87814a1f0ab72",
+    "0x8cc702081a6439ec",
+    "0x90befffa23631e28",
+    "0xa4506cebde82bde9",
+    "0xbef9a3f7b2c67915",
+    "0xc67178f2e372532b",
+    "0xca273eceea26619c",
+    "0xd186b8c721c0c207",
+    "0xeada7dd6cde0eb1e",
+    "0xf57d4f7fee6ed178",
+    "0x06f067aa72176fba",
+    "0x0a637dc5a2c898a6",
+    "0x113f9804bef90dae",
+    "0x1b710b35131c471b",
+    "0x28db77f523047d84",
+    "0x32caab7b40c72493",
+    "0x3c9ebe0a15c9bebc",
+    "0x431d67c49c100d4c",
+    "0x4cc5d4becb3e42b6",
+    "0x597f299cfc657e2a",
+    "0x5fcb6fab3ad6faec",
+    "0x6c44198c4a475817"
+  ].map((T) => BigInt(T))), f = h[0], u = h[1], l = /* @__PURE__ */ new Uint32Array(80), a = /* @__PURE__ */ new Uint32Array(80);
+  class y extends t.HashMD {
+    constructor(w = 64) {
+      super(128, w, 16, !1), this.Ah = t.SHA512_IV[0] | 0, this.Al = t.SHA512_IV[1] | 0, this.Bh = t.SHA512_IV[2] | 0, this.Bl = t.SHA512_IV[3] | 0, this.Ch = t.SHA512_IV[4] | 0, this.Cl = t.SHA512_IV[5] | 0, this.Dh = t.SHA512_IV[6] | 0, this.Dl = t.SHA512_IV[7] | 0, this.Eh = t.SHA512_IV[8] | 0, this.El = t.SHA512_IV[9] | 0, this.Fh = t.SHA512_IV[10] | 0, this.Fl = t.SHA512_IV[11] | 0, this.Gh = t.SHA512_IV[12] | 0, this.Gl = t.SHA512_IV[13] | 0, this.Hh = t.SHA512_IV[14] | 0, this.Hl = t.SHA512_IV[15] | 0;
+    }
+    // prettier-ignore
+    get() {
+      const { Ah: w, Al: k, Bh: A, Bl: I, Ch: m, Cl: E, Dh: d, Dl: b, Eh: x, El: B, Fh: g, Fl: U, Gh: F, Gl: G, Hh: v, Hl: N } = this;
+      return [w, k, A, I, m, E, d, b, x, B, g, U, F, G, v, N];
+    }
+    // prettier-ignore
+    set(w, k, A, I, m, E, d, b, x, B, g, U, F, G, v, N) {
+      this.Ah = w | 0, this.Al = k | 0, this.Bh = A | 0, this.Bl = I | 0, this.Ch = m | 0, this.Cl = E | 0, this.Dh = d | 0, this.Dl = b | 0, this.Eh = x | 0, this.El = B | 0, this.Fh = g | 0, this.Fl = U | 0, this.Gh = F | 0, this.Gl = G | 0, this.Hh = v | 0, this.Hl = N | 0;
+    }
+    process(w, k) {
+      for (let _ = 0; _ < 16; _++, k += 4)
+        l[_] = w.getUint32(k), a[_] = w.getUint32(k += 4);
+      for (let _ = 16; _ < 80; _++) {
+        const V = l[_ - 15] | 0, D = a[_ - 15] | 0, j = e.rotrSH(V, D, 1) ^ e.rotrSH(V, D, 8) ^ e.shrSH(V, D, 7), Y = e.rotrSL(V, D, 1) ^ e.rotrSL(V, D, 8) ^ e.shrSL(V, D, 7), q = l[_ - 2] | 0, K = a[_ - 2] | 0, nt = e.rotrSH(q, K, 19) ^ e.rotrBH(q, K, 61) ^ e.shrSH(q, K, 6), gt = e.rotrSL(q, K, 19) ^ e.rotrBL(q, K, 61) ^ e.shrSL(q, K, 6), it = e.add4L(Y, gt, a[_ - 7], a[_ - 16]), _t = e.add4H(it, j, nt, l[_ - 7], l[_ - 16]);
+        l[_] = _t | 0, a[_] = it | 0;
+      }
+      let { Ah: A, Al: I, Bh: m, Bl: E, Ch: d, Cl: b, Dh: x, Dl: B, Eh: g, El: U, Fh: F, Fl: G, Gh: v, Gl: N, Hh: o, Hl: H } = this;
+      for (let _ = 0; _ < 80; _++) {
+        const V = e.rotrSH(g, U, 14) ^ e.rotrSH(g, U, 18) ^ e.rotrBH(g, U, 41), D = e.rotrSL(g, U, 14) ^ e.rotrSL(g, U, 18) ^ e.rotrBL(g, U, 41), j = g & F ^ ~g & v, Y = U & G ^ ~U & N, q = e.add5L(H, D, Y, u[_], a[_]), K = e.add5H(q, o, V, j, f[_], l[_]), nt = q | 0, gt = e.rotrSH(A, I, 28) ^ e.rotrBH(A, I, 34) ^ e.rotrBH(A, I, 39), it = e.rotrSL(A, I, 28) ^ e.rotrBL(A, I, 34) ^ e.rotrBL(A, I, 39), _t = A & m ^ A & d ^ m & d, $t = I & E ^ I & b ^ E & b;
+        o = v | 0, H = N | 0, v = F | 0, N = G | 0, F = g | 0, G = U | 0, { h: g, l: U } = e.add(x | 0, B | 0, K | 0, nt | 0), x = d | 0, B = b | 0, d = m | 0, b = E | 0, m = A | 0, E = I | 0;
+        const mt = e.add3L(nt, it, $t);
+        A = e.add3H(mt, K, gt, _t), I = mt | 0;
+      }
+      ({ h: A, l: I } = e.add(this.Ah | 0, this.Al | 0, A | 0, I | 0)), { h: m, l: E } = e.add(this.Bh | 0, this.Bl | 0, m | 0, E | 0), { h: d, l: b } = e.add(this.Ch | 0, this.Cl | 0, d | 0, b | 0), { h: x, l: B } = e.add(this.Dh | 0, this.Dl | 0, x | 0, B | 0), { h: g, l: U } = e.add(this.Eh | 0, this.El | 0, g | 0, U | 0), { h: F, l: G } = e.add(this.Fh | 0, this.Fl | 0, F | 0, G | 0), { h: v, l: N } = e.add(this.Gh | 0, this.Gl | 0, v | 0, N | 0), { h: o, l: H } = e.add(this.Hh | 0, this.Hl | 0, o | 0, H | 0), this.set(A, I, m, E, d, b, x, B, g, U, F, G, v, N, o, H);
+    }
+    roundClean() {
+      (0, s.clean)(l, a);
+    }
+    destroy() {
+      (0, s.clean)(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
+    }
+  }
+  P.SHA512 = y;
+  class p extends y {
+    constructor() {
+      super(48), this.Ah = t.SHA384_IV[0] | 0, this.Al = t.SHA384_IV[1] | 0, this.Bh = t.SHA384_IV[2] | 0, this.Bl = t.SHA384_IV[3] | 0, this.Ch = t.SHA384_IV[4] | 0, this.Cl = t.SHA384_IV[5] | 0, this.Dh = t.SHA384_IV[6] | 0, this.Dl = t.SHA384_IV[7] | 0, this.Eh = t.SHA384_IV[8] | 0, this.El = t.SHA384_IV[9] | 0, this.Fh = t.SHA384_IV[10] | 0, this.Fl = t.SHA384_IV[11] | 0, this.Gh = t.SHA384_IV[12] | 0, this.Gl = t.SHA384_IV[13] | 0, this.Hh = t.SHA384_IV[14] | 0, this.Hl = t.SHA384_IV[15] | 0;
+    }
+  }
+  P.SHA384 = p;
+  const S = /* @__PURE__ */ Uint32Array.from([
+    2352822216,
+    424955298,
+    1944164710,
+    2312950998,
+    502970286,
+    855612546,
+    1738396948,
+    1479516111,
+    258812777,
+    2077511080,
+    2011393907,
+    79989058,
+    1067287976,
+    1780299464,
+    286451373,
+    2446758561
+  ]), L = /* @__PURE__ */ Uint32Array.from([
+    573645204,
+    4230739756,
+    2673172387,
+    3360449730,
+    596883563,
+    1867755857,
+    2520282905,
+    1497426621,
+    2519219938,
+    2827943907,
+    3193839141,
+    1401305490,
+    721525244,
+    746961066,
+    246885852,
+    2177182882
+  ]);
+  class C extends y {
+    constructor() {
+      super(28), this.Ah = S[0] | 0, this.Al = S[1] | 0, this.Bh = S[2] | 0, this.Bl = S[3] | 0, this.Ch = S[4] | 0, this.Cl = S[5] | 0, this.Dh = S[6] | 0, this.Dl = S[7] | 0, this.Eh = S[8] | 0, this.El = S[9] | 0, this.Fh = S[10] | 0, this.Fl = S[11] | 0, this.Gh = S[12] | 0, this.Gl = S[13] | 0, this.Hh = S[14] | 0, this.Hl = S[15] | 0;
+    }
+  }
+  P.SHA512_224 = C;
+  class R extends y {
+    constructor() {
+      super(32), this.Ah = L[0] | 0, this.Al = L[1] | 0, this.Bh = L[2] | 0, this.Bl = L[3] | 0, this.Ch = L[4] | 0, this.Cl = L[5] | 0, this.Dh = L[6] | 0, this.Dl = L[7] | 0, this.Eh = L[8] | 0, this.El = L[9] | 0, this.Fh = L[10] | 0, this.Fl = L[11] | 0, this.Gh = L[12] | 0, this.Gl = L[13] | 0, this.Hh = L[14] | 0, this.Hl = L[15] | 0;
+    }
+  }
+  return P.SHA512_256 = R, P.sha256 = (0, s.createHasher)(() => new n()), P.sha224 = (0, s.createHasher)(() => new i()), P.sha512 = (0, s.createHasher)(() => new y()), P.sha384 = (0, s.createHasher)(() => new p()), P.sha512_256 = (0, s.createHasher)(() => new R()), P.sha512_224 = (0, s.createHasher)(() => new C()), P;
+}
+var Ge;
+function Bn() {
+  if (Ge) return Z;
+  Ge = 1, Object.defineProperty(Z, "__esModule", { value: !0 }), Z.sha224 = Z.SHA224 = Z.sha256 = Z.SHA256 = void 0;
+  const t = /* @__PURE__ */ l0();
+  return Z.SHA256 = t.SHA256, Z.sha256 = t.sha256, Z.SHA224 = t.SHA224, Z.sha224 = t.sha224, Z;
+}
+var X = {}, ve;
+function mn() {
+  if (ve) return X;
+  ve = 1, Object.defineProperty(X, "__esModule", { value: !0 }), X.sha512_256 = X.SHA512_256 = X.sha512_224 = X.SHA512_224 = X.sha384 = X.SHA384 = X.sha512 = X.SHA512 = void 0;
+  const t = /* @__PURE__ */ l0();
+  return X.SHA512 = t.SHA512, X.sha512 = t.sha512, X.SHA384 = t.SHA384, X.sha384 = t.sha384, X.SHA512_224 = t.SHA512_224, X.sha512_224 = t.sha512_224, X.SHA512_256 = t.SHA512_256, X.sha512_256 = t.sha512_256, X;
+}
+var Ct = {}, se = {}, je;
+function Zs() {
+  return je || (je = 1, (function(t) {
+    Object.defineProperty(t, "__esModule", { value: !0 }), t.hmac = t.HMAC = void 0;
+    const e = /* @__PURE__ */ Xt();
+    class s extends e.Hash {
+      constructor(n, i) {
+        super(), this.finished = !1, this.destroyed = !1, (0, e.ahash)(n);
+        const h = (0, e.toBytes)(i);
+        if (this.iHash = n.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 f = this.blockLen, u = new Uint8Array(f);
+        u.set(h.length > f ? n.create().update(h).digest() : h);
+        for (let l = 0; l < u.length; l++)
+          u[l] ^= 54;
+        this.iHash.update(u), this.oHash = n.create();
+        for (let l = 0; l < u.length; l++)
+          u[l] ^= 106;
+        this.oHash.update(u), (0, e.clean)(u);
+      }
+      update(n) {
+        return (0, e.aexists)(this), this.iHash.update(n), this;
+      }
+      digestInto(n) {
+        (0, e.aexists)(this), (0, e.abytes)(n, this.outputLen), this.finished = !0, this.iHash.digestInto(n), this.oHash.update(n), this.oHash.digestInto(n), this.destroy();
+      }
+      digest() {
+        const n = new Uint8Array(this.oHash.outputLen);
+        return this.digestInto(n), n;
+      }
+      _cloneInto(n) {
+        n || (n = Object.create(Object.getPrototypeOf(this), {}));
+        const { oHash: i, iHash: h, finished: f, destroyed: u, blockLen: l, outputLen: a } = this;
+        return n = n, n.finished = f, n.destroyed = u, n.blockLen = l, n.outputLen = a, n.oHash = i._cloneInto(n.oHash), n.iHash = h._cloneInto(n.iHash), n;
+      }
+      clone() {
+        return this._cloneInto();
+      }
+      destroy() {
+        this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
+      }
+    }
+    t.HMAC = s;
+    const r = (c, n, i) => new s(c, n).update(i).digest();
+    t.hmac = r, t.hmac.create = (c, n) => new s(c, n);
+  })(se)), se;
+}
+var Re;
+function Un() {
+  if (Re) return Ct;
+  Re = 1, Object.defineProperty(Ct, "__esModule", { value: !0 }), Ct.pbkdf2 = c, Ct.pbkdf2Async = n;
+  const t = /* @__PURE__ */ Zs(), e = /* @__PURE__ */ Xt();
+  function s(i, h, f, u) {
+    (0, e.ahash)(i);
+    const l = (0, e.checkOpts)({ dkLen: 32, asyncTick: 10 }, u), { c: a, dkLen: y, asyncTick: p } = l;
+    if ((0, e.anumber)(a), (0, e.anumber)(y), (0, e.anumber)(p), a < 1)
+      throw new Error("iterations (c) should be >= 1");
+    const S = (0, e.kdfInputToBytes)(h), L = (0, e.kdfInputToBytes)(f), C = new Uint8Array(y), R = t.hmac.create(i, S), T = R._cloneInto().update(L);
+    return { c: a, dkLen: y, asyncTick: p, DK: C, PRF: R, PRFSalt: T };
+  }
+  function r(i, h, f, u, l) {
+    return i.destroy(), h.destroy(), u && u.destroy(), (0, e.clean)(l), f;
+  }
+  function c(i, h, f, u) {
+    const { c: l, dkLen: a, DK: y, PRF: p, PRFSalt: S } = s(i, h, f, u);
+    let L;
+    const C = new Uint8Array(4), R = (0, e.createView)(C), T = new Uint8Array(p.outputLen);
+    for (let w = 1, k = 0; k < a; w++, k += p.outputLen) {
+      const A = y.subarray(k, k + p.outputLen);
+      R.setInt32(0, w, !1), (L = S._cloneInto(L)).update(C).digestInto(T), A.set(T.subarray(0, A.length));
+      for (let I = 1; I < l; I++) {
+        p._cloneInto(L).update(T).digestInto(T);
+        for (let m = 0; m < A.length; m++)
+          A[m] ^= T[m];
+      }
+    }
+    return r(p, S, y, L, T);
+  }
+  async function n(i, h, f, u) {
+    const { c: l, dkLen: a, asyncTick: y, DK: p, PRF: S, PRFSalt: L } = s(i, h, f, u);
+    let C;
+    const R = new Uint8Array(4), T = (0, e.createView)(R), w = new Uint8Array(S.outputLen);
+    for (let k = 1, A = 0; A < a; k++, A += S.outputLen) {
+      const I = p.subarray(A, A + S.outputLen);
+      T.setInt32(0, k, !1), (C = L._cloneInto(C)).update(R).digestInto(w), I.set(w.subarray(0, I.length)), await (0, e.asyncLoop)(l - 1, y, () => {
+        S._cloneInto(C).update(w).digestInto(w);
+        for (let m = 0; m < I.length; m++)
+          I[m] ^= w[m];
+      });
+    }
+    return r(S, L, p, C, w);
+  }
+  return Ct;
+}
+export {
+  gn as A,
+  js as B,
+  Un as C,
+  mn as D,
+  Bn as E,
+  Xt as F,
+  dn as a,
+  fn as b,
+  _n as c,
+  Bt as d,
+  Sn as e,
+  ke as f,
+  Ms as g,
+  wn as h,
+  Os as i,
+  Ln as j,
+  $s as k,
+  sn as l,
+  an as m,
+  hn as n,
+  on as o,
+  es as p,
+  xn as q,
+  oe as r,
+  In as s,
+  pn as t,
+  An as u,
+  rn as v,
+  Dt as w,
+  nn as x,
+  B0 as y,
+  yn as z
+};