npm - @smallwebco/tinypivot-vue - Versions diffs - 1.0.64 → 1.0.65 - Mend

@smallwebco/tinypivot-vue 1.0.64 → 1.0.65

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (13) hide show

package/dist/__vite-browser-external-DYxpcVy9.js +5 -0
package/dist/__vite-browser-external-DYxpcVy9.js.map +1 -0
package/dist/p256-D44eOAG2.js +1395 -0
package/dist/p256-D44eOAG2.js.map +1 -0
package/dist/sha2-BnbuxHg9.js +478 -0
package/dist/sha2-BnbuxHg9.js.map +1 -0
package/dist/sha256-PD7NeEat.js +6 -0
package/dist/sha256-PD7NeEat.js.map +1 -0
package/dist/tinypivot-vue.js +1371 -1324
package/dist/tinypivot-vue.js.map +1 -1
package/dist/tinypivot-vue.umd.cjs +49 -45
package/dist/tinypivot-vue.umd.cjs.map +1 -1
package/package.json +2 -2

package/dist/sha2-BnbuxHg9.js ADDED Viewed

@@ -0,0 +1,478 @@
+const F = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function f0(t) {
+  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
+}
+function Y(t) {
+  if (!Number.isSafeInteger(t) || t < 0)
+    throw new Error("positive integer expected, got " + t);
+}
+function k(t, ...e) {
+  if (!f0(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 L0(t) {
+  if (typeof t != "function" || typeof t.create != "function")
+    throw new Error("Hash should be wrapped by utils.createHasher");
+  Y(t.outputLen), Y(t.blockLen);
+}
+function Z(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 h0(t, e) {
+  k(t);
+  const s = e.outputLen;
+  if (t.length < s)
+    throw new Error("digestInto() expects output buffer of length at least " + s);
+}
+function W(...t) {
+  for (let e = 0; e < t.length; e++)
+    t[e].fill(0);
+}
+function P(t) {
+  return new DataView(t.buffer, t.byteOffset, t.byteLength);
+}
+function H(t, e) {
+  return t << 32 - e | t >>> e;
+}
+const s0 = /* @ts-ignore */ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", a0 = /* @__PURE__ */ Array.from({ length: 256 }, (t, e) => e.toString(16).padStart(2, "0"));
+function D0(t) {
+  if (k(t), s0)
+    return t.toHex();
+  let e = "";
+  for (let s = 0; s < t.length; s++)
+    e += a0[t[s]];
+  return e;
+}
+const m = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
+function $(t) {
+  if (t >= m._0 && t <= m._9)
+    return t - m._0;
+  if (t >= m.A && t <= m.F)
+    return t - (m.A - 10);
+  if (t >= m.a && t <= m.f)
+    return t - (m.a - 10);
+}
+function F0(t) {
+  if (typeof t != "string")
+    throw new Error("hex string expected, got " + typeof t);
+  if (s0)
+    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 n = new Uint8Array(s);
+  for (let c = 0, i = 0; c < s; c++, i += 2) {
+    const o = $(t.charCodeAt(i)), f = $(t.charCodeAt(i + 1));
+    if (o === void 0 || f === void 0) {
+      const h = t[i] + t[i + 1];
+      throw new Error('hex string expected, got non-hex character "' + h + '" at index ' + i);
+    }
+    n[c] = o * 16 + f;
+  }
+  return n;
+}
+function x0(t) {
+  if (typeof t != "string")
+    throw new Error("string expected");
+  return new Uint8Array(new TextEncoder().encode(t));
+}
+function n0(t) {
+  return typeof t == "string" && (t = x0(t)), k(t), t;
+}
+function G0(...t) {
+  let e = 0;
+  for (let n = 0; n < t.length; n++) {
+    const c = t[n];
+    k(c), e += c.length;
+  }
+  const s = new Uint8Array(e);
+  for (let n = 0, c = 0; n < t.length; n++) {
+    const i = t[n];
+    s.set(i, c), c += i.length;
+  }
+  return s;
+}
+class b0 {
+}
+function Q(t) {
+  const e = (n) => t().update(n0(n)).digest(), s = t();
+  return e.outputLen = s.outputLen, e.blockLen = s.blockLen, e.create = () => t(), e;
+}
+function I0(t = 32) {
+  if (F && typeof F.getRandomValues == "function")
+    return F.getRandomValues(new Uint8Array(t));
+  if (F && typeof F.randomBytes == "function")
+    return Uint8Array.from(F.randomBytes(t));
+  throw new Error("crypto.getRandomValues must be defined");
+}
+function d0(t, e, s, n) {
+  if (typeof t.setBigUint64 == "function")
+    return t.setBigUint64(e, s, n);
+  const c = BigInt(32), i = BigInt(4294967295), o = Number(s >> c & i), f = Number(s & i), h = n ? 4 : 0, b = n ? 0 : 4;
+  t.setUint32(e + h, o, n), t.setUint32(e + b, f, n);
+}
+function l0(t, e, s) {
+  return t & e ^ ~t & s;
+}
+function u0(t, e, s) {
+  return t & e ^ t & s ^ e & s;
+}
+class c0 extends b0 {
+  constructor(e, s, n, c) {
+    super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = e, this.outputLen = s, this.padOffset = n, this.isLE = c, this.buffer = new Uint8Array(e), this.view = P(this.buffer);
+  }
+  update(e) {
+    Z(this), e = n0(e), k(e);
+    const { view: s, buffer: n, blockLen: c } = this, i = e.length;
+    for (let o = 0; o < i; ) {
+      const f = Math.min(c - this.pos, i - o);
+      if (f === c) {
+        const h = P(e);
+        for (; c <= i - o; o += c)
+          this.process(h, o);
+        continue;
+      }
+      n.set(e.subarray(o, o + f), this.pos), this.pos += f, o += f, this.pos === c && (this.process(s, 0), this.pos = 0);
+    }
+    return this.length += e.length, this.roundClean(), this;
+  }
+  digestInto(e) {
+    Z(this), h0(e, this), this.finished = !0;
+    const { buffer: s, view: n, blockLen: c, isLE: i } = this;
+    let { pos: o } = this;
+    s[o++] = 128, W(this.buffer.subarray(o)), this.padOffset > c - o && (this.process(n, 0), o = 0);
+    for (let r = o; r < c; r++)
+      s[r] = 0;
+    d0(n, c - 8, BigInt(this.length * 8), i), this.process(n, 0);
+    const f = P(e), h = this.outputLen;
+    if (h % 4)
+      throw new Error("_sha2: outputLen should be aligned to 32bit");
+    const b = h / 4, d = this.get();
+    if (b > d.length)
+      throw new Error("_sha2: outputLen bigger than state");
+    for (let r = 0; r < b; r++)
+      f.setUint32(4 * r, d[r], i);
+  }
+  digest() {
+    const { buffer: e, outputLen: s } = this;
+    this.digestInto(e);
+    const n = e.slice(0, s);
+    return this.destroy(), n;
+  }
+  _cloneInto(e) {
+    e || (e = new this.constructor()), e.set(...this.get());
+    const { blockLen: s, buffer: n, length: c, finished: i, destroyed: o, pos: f } = this;
+    return e.destroyed = o, e.finished = i, e.length = c, e.pos = f, c % s && e.buffer.set(n), e;
+  }
+  clone() {
+    return this._cloneInto();
+  }
+}
+const C = /* @__PURE__ */ Uint32Array.from([
+  1779033703,
+  3144134277,
+  1013904242,
+  2773480762,
+  1359893119,
+  2600822924,
+  528734635,
+  1541459225
+]), u = /* @__PURE__ */ Uint32Array.from([
+  3418070365,
+  3238371032,
+  1654270250,
+  914150663,
+  2438529370,
+  812702999,
+  355462360,
+  4144912697,
+  1731405415,
+  4290775857,
+  2394180231,
+  1750603025,
+  3675008525,
+  1694076839,
+  1203062813,
+  3204075428
+]), g = /* @__PURE__ */ Uint32Array.from([
+  1779033703,
+  4089235720,
+  3144134277,
+  2227873595,
+  1013904242,
+  4271175723,
+  2773480762,
+  1595750129,
+  1359893119,
+  2917565137,
+  2600822924,
+  725511199,
+  528734635,
+  4215389547,
+  1541459225,
+  327033209
+]), K = /* @__PURE__ */ BigInt(2 ** 32 - 1), v = /* @__PURE__ */ BigInt(32);
+function g0(t, e = !1) {
+  return e ? { h: Number(t & K), l: Number(t >> v & K) } : { h: Number(t >> v & K) | 0, l: Number(t & K) | 0 };
+}
+function p0(t, e = !1) {
+  const s = t.length;
+  let n = new Uint32Array(s), c = new Uint32Array(s);
+  for (let i = 0; i < s; i++) {
+    const { h: o, l: f } = g0(t[i], e);
+    [n[i], c[i]] = [o, f];
+  }
+  return [n, c];
+}
+const t0 = (t, e, s) => t >>> s, e0 = (t, e, s) => t << 32 - s | e >>> s, G = (t, e, s) => t >>> s | e << 32 - s, I = (t, e, s) => t << 32 - s | e >>> s, j = (t, e, s) => t << 64 - s | e >>> s - 32, R = (t, e, s) => t >>> s - 32 | e << 64 - s;
+function U(t, e, s, n) {
+  const c = (e >>> 0) + (n >>> 0);
+  return { h: t + s + (c / 2 ** 32 | 0) | 0, l: c | 0 };
+}
+const A0 = (t, e, s) => (t >>> 0) + (e >>> 0) + (s >>> 0), y0 = (t, e, s, n) => e + s + n + (t / 2 ** 32 | 0) | 0, H0 = (t, e, s, n) => (t >>> 0) + (e >>> 0) + (s >>> 0) + (n >>> 0), w0 = (t, e, s, n, c) => e + s + n + c + (t / 2 ** 32 | 0) | 0, B0 = (t, e, s, n, c) => (t >>> 0) + (e >>> 0) + (s >>> 0) + (n >>> 0) + (c >>> 0), m0 = (t, e, s, n, c, i) => e + s + n + c + i + (t / 2 ** 32 | 0) | 0, U0 = /* @__PURE__ */ Uint32Array.from([
+  1116352408,
+  1899447441,
+  3049323471,
+  3921009573,
+  961987163,
+  1508970993,
+  2453635748,
+  2870763221,
+  3624381080,
+  310598401,
+  607225278,
+  1426881987,
+  1925078388,
+  2162078206,
+  2614888103,
+  3248222580,
+  3835390401,
+  4022224774,
+  264347078,
+  604807628,
+  770255983,
+  1249150122,
+  1555081692,
+  1996064986,
+  2554220882,
+  2821834349,
+  2952996808,
+  3210313671,
+  3336571891,
+  3584528711,
+  113926993,
+  338241895,
+  666307205,
+  773529912,
+  1294757372,
+  1396182291,
+  1695183700,
+  1986661051,
+  2177026350,
+  2456956037,
+  2730485921,
+  2820302411,
+  3259730800,
+  3345764771,
+  3516065817,
+  3600352804,
+  4094571909,
+  275423344,
+  430227734,
+  506948616,
+  659060556,
+  883997877,
+  958139571,
+  1322822218,
+  1537002063,
+  1747873779,
+  1955562222,
+  2024104815,
+  2227730452,
+  2361852424,
+  2428436474,
+  2756734187,
+  3204031479,
+  3329325298
+]), S = /* @__PURE__ */ new Uint32Array(64);
+class E0 extends c0 {
+  constructor(e = 32) {
+    super(64, e, 8, !1), this.A = C[0] | 0, this.B = C[1] | 0, this.C = C[2] | 0, this.D = C[3] | 0, this.E = C[4] | 0, this.F = C[5] | 0, this.G = C[6] | 0, this.H = C[7] | 0;
+  }
+  get() {
+    const { A: e, B: s, C: n, D: c, E: i, F: o, G: f, H: h } = this;
+    return [e, s, n, c, i, o, f, h];
+  }
+  // prettier-ignore
+  set(e, s, n, c, i, o, f, h) {
+    this.A = e | 0, this.B = s | 0, this.C = n | 0, this.D = c | 0, this.E = i | 0, this.F = o | 0, this.G = f | 0, this.H = h | 0;
+  }
+  process(e, s) {
+    for (let r = 0; r < 16; r++, s += 4)
+      S[r] = e.getUint32(s, !1);
+    for (let r = 16; r < 64; r++) {
+      const x = S[r - 15], l = S[r - 2], A = H(x, 7) ^ H(x, 18) ^ x >>> 3, p = H(l, 17) ^ H(l, 19) ^ l >>> 10;
+      S[r] = p + S[r - 7] + A + S[r - 16] | 0;
+    }
+    let { A: n, B: c, C: i, D: o, E: f, F: h, G: b, H: d } = this;
+    for (let r = 0; r < 64; r++) {
+      const x = H(f, 6) ^ H(f, 11) ^ H(f, 25), l = d + x + l0(f, h, b) + U0[r] + S[r] | 0, p = (H(n, 2) ^ H(n, 13) ^ H(n, 22)) + u0(n, c, i) | 0;
+      d = b, b = h, h = f, f = o + l | 0, o = i, i = c, c = n, n = l + p | 0;
+    }
+    n = n + this.A | 0, c = c + this.B | 0, i = i + this.C | 0, o = o + this.D | 0, f = f + this.E | 0, h = h + this.F | 0, b = b + this.G | 0, d = d + this.H | 0, this.set(n, c, i, o, f, h, b, d);
+  }
+  roundClean() {
+    W(S);
+  }
+  destroy() {
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), W(this.buffer);
+  }
+}
+const i0 = p0([
+  "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))), _0 = i0[0], C0 = i0[1], L = /* @__PURE__ */ new Uint32Array(80), D = /* @__PURE__ */ new Uint32Array(80);
+class o0 extends c0 {
+  constructor(e = 64) {
+    super(128, e, 16, !1), this.Ah = g[0] | 0, this.Al = g[1] | 0, this.Bh = g[2] | 0, this.Bl = g[3] | 0, this.Ch = g[4] | 0, this.Cl = g[5] | 0, this.Dh = g[6] | 0, this.Dl = g[7] | 0, this.Eh = g[8] | 0, this.El = g[9] | 0, this.Fh = g[10] | 0, this.Fl = g[11] | 0, this.Gh = g[12] | 0, this.Gl = g[13] | 0, this.Hh = g[14] | 0, this.Hl = g[15] | 0;
+  }
+  // prettier-ignore
+  get() {
+    const { Ah: e, Al: s, Bh: n, Bl: c, Ch: i, Cl: o, Dh: f, Dl: h, Eh: b, El: d, Fh: r, Fl: x, Gh: l, Gl: A, Hh: p, Hl: y } = this;
+    return [e, s, n, c, i, o, f, h, b, d, r, x, l, A, p, y];
+  }
+  // prettier-ignore
+  set(e, s, n, c, i, o, f, h, b, d, r, x, l, A, p, y) {
+    this.Ah = e | 0, this.Al = s | 0, this.Bh = n | 0, this.Bl = c | 0, this.Ch = i | 0, this.Cl = o | 0, this.Dh = f | 0, this.Dl = h | 0, this.Eh = b | 0, this.El = d | 0, this.Fh = r | 0, this.Fl = x | 0, this.Gh = l | 0, this.Gl = A | 0, this.Hh = p | 0, this.Hl = y | 0;
+  }
+  process(e, s) {
+    for (let a = 0; a < 16; a++, s += 4)
+      L[a] = e.getUint32(s), D[a] = e.getUint32(s += 4);
+    for (let a = 16; a < 80; a++) {
+      const E = L[a - 15] | 0, _ = D[a - 15] | 0, J = G(E, _, 1) ^ G(E, _, 8) ^ t0(E, _, 7), O = I(E, _, 1) ^ I(E, _, 8) ^ e0(E, _, 7), w = L[a - 2] | 0, B = D[a - 2] | 0, M = G(w, B, 19) ^ j(w, B, 61) ^ t0(w, B, 6), q = I(w, B, 19) ^ R(w, B, 61) ^ e0(w, B, 6), N = H0(O, q, D[a - 7], D[a - 16]), z = w0(N, J, M, L[a - 7], L[a - 16]);
+      L[a] = z | 0, D[a] = N | 0;
+    }
+    let { Ah: n, Al: c, Bh: i, Bl: o, Ch: f, Cl: h, Dh: b, Dl: d, Eh: r, El: x, Fh: l, Fl: A, Gh: p, Gl: y, Hh: T, Hl: V } = this;
+    for (let a = 0; a < 80; a++) {
+      const E = G(r, x, 14) ^ G(r, x, 18) ^ j(r, x, 41), _ = I(r, x, 14) ^ I(r, x, 18) ^ R(r, x, 41), J = r & l ^ ~r & p, O = x & A ^ ~x & y, w = B0(V, _, O, C0[a], D[a]), B = m0(w, T, E, J, _0[a], L[a]), M = w | 0, q = G(n, c, 28) ^ j(n, c, 34) ^ j(n, c, 39), N = I(n, c, 28) ^ R(n, c, 34) ^ R(n, c, 39), z = n & i ^ n & f ^ i & f, r0 = c & o ^ c & h ^ o & h;
+      T = p | 0, V = y | 0, p = l | 0, y = A | 0, l = r | 0, A = x | 0, { h: r, l: x } = U(b | 0, d | 0, B | 0, M | 0), b = f | 0, d = h | 0, f = i | 0, h = o | 0, i = n | 0, o = c | 0;
+      const X = A0(M, N, r0);
+      n = y0(X, B, q, z), c = X | 0;
+    }
+    ({ h: n, l: c } = U(this.Ah | 0, this.Al | 0, n | 0, c | 0)), { h: i, l: o } = U(this.Bh | 0, this.Bl | 0, i | 0, o | 0), { h: f, l: h } = U(this.Ch | 0, this.Cl | 0, f | 0, h | 0), { h: b, l: d } = U(this.Dh | 0, this.Dl | 0, b | 0, d | 0), { h: r, l: x } = U(this.Eh | 0, this.El | 0, r | 0, x | 0), { h: l, l: A } = U(this.Fh | 0, this.Fl | 0, l | 0, A | 0), { h: p, l: y } = U(this.Gh | 0, this.Gl | 0, p | 0, y | 0), { h: T, l: V } = U(this.Hh | 0, this.Hl | 0, T | 0, V | 0), this.set(n, c, i, o, f, h, b, d, r, x, l, A, p, y, T, V);
+  }
+  roundClean() {
+    W(L, D);
+  }
+  destroy() {
+    W(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
+  }
+}
+class S0 extends o0 {
+  constructor() {
+    super(48), this.Ah = u[0] | 0, this.Al = u[1] | 0, this.Bh = u[2] | 0, this.Bl = u[3] | 0, this.Ch = u[4] | 0, this.Cl = u[5] | 0, this.Dh = u[6] | 0, this.Dl = u[7] | 0, this.Eh = u[8] | 0, this.El = u[9] | 0, this.Fh = u[10] | 0, this.Fl = u[11] | 0, this.Gh = u[12] | 0, this.Gl = u[13] | 0, this.Hh = u[14] | 0, this.Hl = u[15] | 0;
+  }
+}
+const T0 = /* @__PURE__ */ Q(() => new E0()), V0 = /* @__PURE__ */ Q(() => new o0()), W0 = /* @__PURE__ */ Q(() => new S0());
+export {
+  b0 as H,
+  k as a,
+  D0 as b,
+  G0 as c,
+  Y as d,
+  L0 as e,
+  W as f,
+  Z as g,
+  F0 as h,
+  f0 as i,
+  W0 as j,
+  V0 as k,
+  I0 as r,
+  T0 as s,
+  n0 as t
+};
+//# sourceMappingURL=sha2-BnbuxHg9.js.map

package/dist/sha2-BnbuxHg9.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"sha2-BnbuxHg9.js","sources":["../../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/esm/crypto.js","../../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/esm/utils.js","../../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/esm/_md.js","../../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/esm/_u64.js","../../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/esm/sha2.js"],"sourcesContent":["export const crypto = typeof globalThis === 'object' && 'crypto' in globalThis ? globalThis.crypto : undefined;\n//# sourceMappingURL=crypto.js.map","/**\n * Utilities for hex, bytes, CSPRNG.\n * @module\n */\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// node.js versions earlier than v19 don't declare it in global scope.\n// For node.js, package.json#exports field mapping rewrites import\n// from `crypto` to `cryptoNode`, which imports native module.\n// Makes the utils un-importable in browsers without a bundler.\n// Once node.js 18 is deprecated (2025-04-30), we can just drop the import.\nimport { crypto } from '@noble/hashes/crypto';\n/** Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. */\nexport function isBytes(a) {\n return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n/** Asserts something is positive integer. */\nexport function anumber(n) {\n if (!Number.isSafeInteger(n) || n < 0)\n throw new Error('positive integer expected, got ' + n);\n}\n/** Asserts something is Uint8Array. */\nexport function abytes(b, ...lengths) {\n if (!isBytes(b))\n throw new Error('Uint8Array expected');\n if (lengths.length > 0 && !lengths.includes(b.length))\n throw new Error('Uint8Array expected of length ' + lengths + ', got length=' + b.length);\n}\n/** Asserts something is hash */\nexport function ahash(h) {\n if (typeof h !== 'function' || typeof h.create !== 'function')\n throw new Error('Hash should be wrapped by utils.createHasher');\n anumber(h.outputLen);\n anumber(h.blockLen);\n}\n/** Asserts a hash instance has not been destroyed / finished */\nexport function aexists(instance, checkFinished = true) {\n if (instance.destroyed)\n throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished)\n throw new Error('Hash#digest() has already been called');\n}\n/** Asserts output is properly-sized byte array */\nexport function aoutput(out, instance) {\n abytes(out);\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error('digestInto() expects output buffer of length at least ' + min);\n }\n}\n/** Cast u8 / u16 / u32 to u8. */\nexport function u8(arr) {\n return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/** Cast u8 / u16 / u32 to u32. */\nexport function u32(arr) {\n return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n/** Zeroize a byte array. Warning: JS provides no guarantees. */\nexport function clean(...arrays) {\n for (let i = 0; i < arrays.length; i++) {\n arrays[i].fill(0);\n }\n}\n/** Create DataView of an array for easy byte-level manipulation. */\nexport function createView(arr) {\n return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/** The rotate right (circular right shift) operation for uint32 */\nexport function rotr(word, shift) {\n return (word << (32 - shift)) | (word >>> shift);\n}\n/** The rotate left (circular left shift) operation for uint32 */\nexport function rotl(word, shift) {\n return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n/** Is current platform little-endian? Most are. Big-Endian platform: IBM */\nexport const isLE = /* @__PURE__ */ (() => new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n/** The byte swap operation for uint32 */\nexport function byteSwap(word) {\n return (((word << 24) & 0xff000000) |\n ((word << 8) & 0xff0000) |\n ((word >>> 8) & 0xff00) |\n ((word >>> 24) & 0xff));\n}\n/** Conditionally byte swap if on a big-endian platform */\nexport const swap8IfBE = isLE\n ? (n) => n\n : (n) => byteSwap(n);\n/** @deprecated */\nexport const byteSwapIfBE = swap8IfBE;\n/** In place byte swap for Uint32Array */\nexport function byteSwap32(arr) {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n return arr;\n}\nexport const swap32IfBE = isLE\n ? (u) => u\n : byteSwap32;\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin = /* @__PURE__ */ (() => \n// @ts-ignore\ntypeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * Convert byte array to hex string. Uses built-in function, when available.\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin)\n return bytes.toHex();\n // pre-caching improves the speed 6x\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += hexes[bytes[i]];\n }\n return hex;\n}\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };\nfunction asciiToBase16(ch) {\n if (ch >= asciis._0 && ch <= asciis._9)\n return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F)\n return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f)\n return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\n/**\n * Convert hex string to byte array. Uses built-in function, when available.\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n if (typeof hex !== 'string')\n throw new Error('hex string expected, got ' + typeof hex);\n // @ts-ignore\n if (hasHexBuiltin)\n return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2)\n throw new Error('hex string expected, got unpadded hex of length ' + hl);\n const array = new Uint8Array(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n const n1 = asciiToBase16(hex.charCodeAt(hi));\n const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n if (n1 === undefined || n2 === undefined) {\n const char = hex[hi] + hex[hi + 1];\n throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n }\n array[ai] = n1 * 16 + n2; // multiply first octet, e.g. 'a3' => 10*16+3 => 160 + 3 => 163\n }\n return array;\n}\n/**\n * There is no setImmediate in browser and setTimeout is slow.\n * Call of async fn will return Promise, which will be fullfiled only on\n * next scheduler queue processing step and this is exactly what we need.\n */\nexport const nextTick = async () => { };\n/** Returns control to thread each 'tick' ms to avoid blocking. */\nexport async function asyncLoop(iters, tick, cb) {\n let ts = Date.now();\n for (let i = 0; i < iters; i++) {\n cb(i);\n // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n const diff = Date.now() - ts;\n if (diff >= 0 && diff < tick)\n continue;\n await nextTick();\n ts += diff;\n }\n}\n/**\n * Converts string to bytes using UTF8 encoding.\n * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n if (typeof str !== 'string')\n throw new Error('string expected');\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/**\n * Converts bytes to string using UTF8 encoding.\n * @example bytesToUtf8(Uint8Array.from([97, 98, 99])) // 'abc'\n */\nexport function bytesToUtf8(bytes) {\n return new TextDecoder().decode(bytes);\n}\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nexport function toBytes(data) {\n if (typeof data === 'string')\n data = utf8ToBytes(data);\n abytes(data);\n return data;\n}\n/**\n * Helper for KDFs: consumes uint8array or string.\n * When string is passed, does utf8 decoding, using TextDecoder.\n */\nexport function kdfInputToBytes(data) {\n if (typeof data === 'string')\n data = utf8ToBytes(data);\n abytes(data);\n return data;\n}\n/** Copies several Uint8Arrays into one. */\nexport function concatBytes(...arrays) {\n let sum = 0;\n for (let i = 0; i < arrays.length; i++) {\n const a = arrays[i];\n abytes(a);\n sum += a.length;\n }\n const res = new Uint8Array(sum);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const a = arrays[i];\n res.set(a, pad);\n pad += a.length;\n }\n return res;\n}\nexport function checkOpts(defaults, opts) {\n if (opts !== undefined && {}.toString.call(opts) !== '[object Object]')\n throw new Error('options should be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged;\n}\n/** For runtime check if class implements interface */\nexport class Hash {\n}\n/** Wraps hash function, creating an interface on top of it */\nexport function createHasher(hashCons) {\n const hashC = (msg) => hashCons().update(toBytes(msg)).digest();\n const tmp = hashCons();\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = () => hashCons();\n return hashC;\n}\nexport function createOptHasher(hashCons) {\n const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n const tmp = hashCons({});\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts) => hashCons(opts);\n return hashC;\n}\nexport function createXOFer(hashCons) {\n const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n const tmp = hashCons({});\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts) => hashCons(opts);\n return hashC;\n}\nexport const wrapConstructor = createHasher;\nexport const wrapConstructorWithOpts = createOptHasher;\nexport const wrapXOFConstructorWithOpts = createXOFer;\n/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */\nexport function randomBytes(bytesLength = 32) {\n if (crypto && typeof crypto.getRandomValues === 'function') {\n return crypto.getRandomValues(new Uint8Array(bytesLength));\n }\n // Legacy Node.js compatibility\n if (crypto && typeof crypto.randomBytes === 'function') {\n return Uint8Array.from(crypto.randomBytes(bytesLength));\n }\n throw new Error('crypto.getRandomValues must be defined');\n}\n//# sourceMappingURL=utils.js.map","/**\n * Internal Merkle-Damgard hash utils.\n * @module\n */\nimport { Hash, abytes, aexists, aoutput, clean, createView, toBytes } from \"./utils.js\";\n/** Polyfill for Safari 14. https://caniuse.com/mdn-javascript_builtins_dataview_setbiguint64 */\nexport function setBigUint64(view, byteOffset, value, isLE) {\n if (typeof view.setBigUint64 === 'function')\n return view.setBigUint64(byteOffset, value, isLE);\n const _32n = BigInt(32);\n const _u32_max = BigInt(0xffffffff);\n const wh = Number((value >> _32n) & _u32_max);\n const wl = Number(value & _u32_max);\n const h = isLE ? 4 : 0;\n const l = isLE ? 0 : 4;\n view.setUint32(byteOffset + h, wh, isLE);\n view.setUint32(byteOffset + l, wl, isLE);\n}\n/** Choice: a ? b : c */\nexport function Chi(a, b, c) {\n return (a & b) ^ (~a & c);\n}\n/** Majority function, true if any two inputs is true. */\nexport function Maj(a, b, c) {\n return (a & b) ^ (a & c) ^ (b & c);\n}\n/**\n * Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n */\nexport class HashMD extends Hash {\n constructor(blockLen, outputLen, padOffset, isLE) {\n super();\n this.finished = false;\n this.length = 0;\n this.pos = 0;\n this.destroyed = false;\n this.blockLen = blockLen;\n this.outputLen = outputLen;\n this.padOffset = padOffset;\n this.isLE = isLE;\n this.buffer = new Uint8Array(blockLen);\n this.view = createView(this.buffer);\n }\n update(data) {\n aexists(this);\n data = toBytes(data);\n abytes(data);\n const { view, buffer, blockLen } = this;\n const len = data.length;\n for (let pos = 0; pos < len;) {\n const take = Math.min(blockLen - this.pos, len - pos);\n // Fast path: we have at least one block in input, cast it to view and process\n if (take === blockLen) {\n const dataView = createView(data);\n for (; blockLen <= len - pos; pos += blockLen)\n this.process(dataView, pos);\n continue;\n }\n buffer.set(data.subarray(pos, pos + take), this.pos);\n this.pos += take;\n pos += take;\n if (this.pos === blockLen) {\n this.process(view, 0);\n this.pos = 0;\n }\n }\n this.length += data.length;\n this.roundClean();\n return this;\n }\n digestInto(out) {\n aexists(this);\n aoutput(out, this);\n this.finished = true;\n // Padding\n // We can avoid allocation of buffer for padding completely if it\n // was previously not allocated here. But it won't change performance.\n const { buffer, view, blockLen, isLE } = this;\n let { pos } = this;\n // append the bit '1' to the message\n buffer[pos++] = 0b10000000;\n clean(this.buffer.subarray(pos));\n // we have less than padOffset left in buffer, so we cannot put length in\n // current block, need process it and pad again\n if (this.padOffset > blockLen - pos) {\n this.process(view, 0);\n pos = 0;\n }\n // Pad until full block byte with zeros\n for (let i = pos; i < blockLen; i++)\n buffer[i] = 0;\n // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n // You need to write around 2 exabytes (u64_max / 8 / (1024**6)) for this to happen.\n // So we just write lowest 64 bits of that value.\n setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE);\n this.process(view, 0);\n const oview = createView(out);\n const len = this.outputLen;\n // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT\n if (len % 4)\n throw new Error('_sha2: outputLen should be aligned to 32bit');\n const outLen = len / 4;\n const state = this.get();\n if (outLen > state.length)\n throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++)\n oview.setUint32(4 * i, state[i], isLE);\n }\n digest() {\n const { buffer, outputLen } = this;\n this.digestInto(buffer);\n const res = buffer.slice(0, outputLen);\n this.destroy();\n return res;\n }\n _cloneInto(to) {\n to || (to = new this.constructor());\n to.set(...this.get());\n const { blockLen, buffer, length, finished, destroyed, pos } = this;\n to.destroyed = destroyed;\n to.finished = finished;\n to.length = length;\n to.pos = pos;\n if (length % blockLen)\n to.buffer.set(buffer);\n return to;\n }\n clone() {\n return this._cloneInto();\n }\n}\n/**\n * Initial SHA-2 state: fractional parts of square roots of first 16 primes 2..53.\n * Check out `test/misc/sha2-gen-iv.js` for recomputation guide.\n */\n/** Initial SHA256 state. Bits 0..32 of frac part of sqrt of primes 2..19 */\nexport const SHA256_IV = /* @__PURE__ */ Uint32Array.from([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,\n]);\n/** Initial SHA224 state. Bits 32..64 of frac part of sqrt of primes 23..53 */\nexport const SHA224_IV = /* @__PURE__ */ Uint32Array.from([\n 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4,\n]);\n/** Initial SHA384 state. Bits 0..64 of frac part of sqrt of primes 23..53 */\nexport const SHA384_IV = /* @__PURE__ */ Uint32Array.from([\n 0xcbbb9d5d, 0xc1059ed8, 0x629a292a, 0x367cd507, 0x9159015a, 0x3070dd17, 0x152fecd8, 0xf70e5939,\n 0x67332667, 0xffc00b31, 0x8eb44a87, 0x68581511, 0xdb0c2e0d, 0x64f98fa7, 0x47b5481d, 0xbefa4fa4,\n]);\n/** Initial SHA512 state. Bits 0..64 of frac part of sqrt of primes 2..19 */\nexport const SHA512_IV = /* @__PURE__ */ Uint32Array.from([\n 0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,\n 0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179,\n]);\n//# sourceMappingURL=_md.js.map","/**\n * Internal helpers for u64. BigUint64Array is too slow as per 2025, so we implement it using Uint32Array.\n * @todo re-check https://issues.chromium.org/issues/42212588\n * @module\n */\nconst U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);\nconst _32n = /* @__PURE__ */ BigInt(32);\nfunction fromBig(n, le = false) {\n if (le)\n return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };\n return { h: Number((n >> _32n) & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };\n}\nfunction split(lst, le = false) {\n const len = lst.length;\n let Ah = new Uint32Array(len);\n let Al = new Uint32Array(len);\n for (let i = 0; i < len; i++) {\n const { h, l } = fromBig(lst[i], le);\n [Ah[i], Al[i]] = [h, l];\n }\n return [Ah, Al];\n}\nconst toBig = (h, l) => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h, _l, s) => h >>> s;\nconst shrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h, l, s) => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h, l, s) => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h, l, s) => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h, l) => l;\nconst rotr32L = (h, _l) => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h, l, s) => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h, l, s) => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h, l, s) => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));\n// JS uses 32-bit signed integers for bitwise operations which means we cannot\n// simple take carry out of low bit sum by shift, we need to use division.\nfunction add(Ah, Al, Bh, Bl) {\n const l = (Al >>> 0) + (Bl >>> 0);\n return { h: (Ah + Bh + ((l / 2 ** 32) | 0)) | 0, l: l | 0 };\n}\n// Addition with more than 2 elements\nconst add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low, Ah, Bh, Ch) => (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low, Ah, Bh, Ch, Dh) => (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low, Ah, Bh, Ch, Dh, Eh) => (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n// prettier-ignore\nexport { add, add3H, add3L, add4H, add4L, add5H, add5L, fromBig, rotlBH, rotlBL, rotlSH, rotlSL, rotr32H, rotr32L, rotrBH, rotrBL, rotrSH, rotrSL, shrSH, shrSL, split, toBig };\n// prettier-ignore\nconst u64 = {\n fromBig, split, toBig,\n shrSH, shrSL,\n rotrSH, rotrSL, rotrBH, rotrBL,\n rotr32H, rotr32L,\n rotlSH, rotlSL, rotlBH, rotlBL,\n add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\nexport default u64;\n//# sourceMappingURL=_u64.js.map","/**\n * SHA2 hash function. A.k.a. sha256, sha384, sha512, sha512_224, sha512_256.\n * SHA256 is the fastest hash implementable in JS, even faster than Blake3.\n * Check out [RFC 4634](https://datatracker.ietf.org/doc/html/rfc4634) and\n * [FIPS 180-4](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf).\n * @module\n */\nimport { Chi, HashMD, Maj, SHA224_IV, SHA256_IV, SHA384_IV, SHA512_IV } from \"./_md.js\";\nimport * as u64 from \"./_u64.js\";\nimport { clean, createHasher, rotr } from \"./utils.js\";\n/**\n * Round constants:\n * First 32 bits of fractional parts of the cube roots of the first 64 primes 2..311)\n */\n// prettier-ignore\nconst SHA256_K = /* @__PURE__ */ Uint32Array.from([\n 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n/** Reusable temporary buffer. \"W\" comes straight from spec. */\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\nexport class SHA256 extends HashMD {\n constructor(outputLen = 32) {\n super(64, outputLen, 8, false);\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n this.A = SHA256_IV[0] | 0;\n this.B = SHA256_IV[1] | 0;\n this.C = SHA256_IV[2] | 0;\n this.D = SHA256_IV[3] | 0;\n this.E = SHA256_IV[4] | 0;\n this.F = SHA256_IV[5] | 0;\n this.G = SHA256_IV[6] | 0;\n this.H = SHA256_IV[7] | 0;\n }\n get() {\n const { A, B, C, D, E, F, G, H } = this;\n return [A, B, C, D, E, F, G, H];\n }\n // prettier-ignore\n set(A, B, C, D, E, F, G, H) {\n this.A = A | 0;\n this.B = B | 0;\n this.C = C | 0;\n this.D = D | 0;\n this.E = E | 0;\n this.F = F | 0;\n this.G = G | 0;\n this.H = H | 0;\n }\n process(view, offset) {\n // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4)\n SHA256_W[i] = view.getUint32(offset, false);\n for (let i = 16; i < 64; i++) {\n const W15 = SHA256_W[i - 15];\n const W2 = SHA256_W[i - 2];\n const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) | 0;\n }\n // Compression function main loop, 64 rounds\n let { A, B, C, D, E, F, G, H } = this;\n for (let i = 0; i < 64; i++) {\n const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n const T2 = (sigma0 + Maj(A, B, C)) | 0;\n H = G;\n G = F;\n F = E;\n E = (D + T1) | 0;\n D = C;\n C = B;\n B = A;\n A = (T1 + T2) | 0;\n }\n // Add the compressed chunk to the current hash value\n A = (A + this.A) | 0;\n B = (B + this.B) | 0;\n C = (C + this.C) | 0;\n D = (D + this.D) | 0;\n E = (E + this.E) | 0;\n F = (F + this.F) | 0;\n G = (G + this.G) | 0;\n H = (H + this.H) | 0;\n this.set(A, B, C, D, E, F, G, H);\n }\n roundClean() {\n clean(SHA256_W);\n }\n destroy() {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n clean(this.buffer);\n }\n}\nexport class SHA224 extends SHA256 {\n constructor() {\n super(28);\n this.A = SHA224_IV[0] | 0;\n this.B = SHA224_IV[1] | 0;\n this.C = SHA224_IV[2] | 0;\n this.D = SHA224_IV[3] | 0;\n this.E = SHA224_IV[4] | 0;\n this.F = SHA224_IV[5] | 0;\n this.G = SHA224_IV[6] | 0;\n this.H = SHA224_IV[7] | 0;\n }\n}\n// SHA2-512 is slower than sha256 in js because u64 operations are slow.\n// Round contants\n// First 32 bits of the fractional parts of the cube roots of the first 80 primes 2..409\n// prettier-ignore\nconst K512 = /* @__PURE__ */ (() => u64.split([\n '0x428a2f98d728ae22', '0x7137449123ef65cd', '0xb5c0fbcfec4d3b2f', '0xe9b5dba58189dbbc',\n '0x3956c25bf348b538', '0x59f111f1b605d019', '0x923f82a4af194f9b', '0xab1c5ed5da6d8118',\n '0xd807aa98a3030242', '0x12835b0145706fbe', '0x243185be4ee4b28c', '0x550c7dc3d5ffb4e2',\n '0x72be5d74f27b896f', '0x80deb1fe3b1696b1', '0x9bdc06a725c71235', '0xc19bf174cf692694',\n '0xe49b69c19ef14ad2', '0xefbe4786384f25e3', '0x0fc19dc68b8cd5b5', '0x240ca1cc77ac9c65',\n '0x2de92c6f592b0275', '0x4a7484aa6ea6e483', '0x5cb0a9dcbd41fbd4', '0x76f988da831153b5',\n '0x983e5152ee66dfab', '0xa831c66d2db43210', '0xb00327c898fb213f', '0xbf597fc7beef0ee4',\n '0xc6e00bf33da88fc2', '0xd5a79147930aa725', '0x06ca6351e003826f', '0x142929670a0e6e70',\n '0x27b70a8546d22ffc', '0x2e1b21385c26c926', '0x4d2c6dfc5ac42aed', '0x53380d139d95b3df',\n '0x650a73548baf63de', '0x766a0abb3c77b2a8', '0x81c2c92e47edaee6', '0x92722c851482353b',\n '0xa2bfe8a14cf10364', '0xa81a664bbc423001', '0xc24b8b70d0f89791', '0xc76c51a30654be30',\n '0xd192e819d6ef5218', '0xd69906245565a910', '0xf40e35855771202a', '0x106aa07032bbd1b8',\n '0x19a4c116b8d2d0c8', '0x1e376c085141ab53', '0x2748774cdf8eeb99', '0x34b0bcb5e19b48a8',\n '0x391c0cb3c5c95a63', '0x4ed8aa4ae3418acb', '0x5b9cca4f7763e373', '0x682e6ff3d6b2b8a3',\n '0x748f82ee5defb2fc', '0x78a5636f43172f60', '0x84c87814a1f0ab72', '0x8cc702081a6439ec',\n '0x90befffa23631e28', '0xa4506cebde82bde9', '0xbef9a3f7b2c67915', '0xc67178f2e372532b',\n '0xca273eceea26619c', '0xd186b8c721c0c207', '0xeada7dd6cde0eb1e', '0xf57d4f7fee6ed178',\n '0x06f067aa72176fba', '0x0a637dc5a2c898a6', '0x113f9804bef90dae', '0x1b710b35131c471b',\n '0x28db77f523047d84', '0x32caab7b40c72493', '0x3c9ebe0a15c9bebc', '0x431d67c49c100d4c',\n '0x4cc5d4becb3e42b6', '0x597f299cfc657e2a', '0x5fcb6fab3ad6faec', '0x6c44198c4a475817'\n].map(n => BigInt(n))))();\nconst SHA512_Kh = /* @__PURE__ */ (() => K512[0])();\nconst SHA512_Kl = /* @__PURE__ */ (() => K512[1])();\n// Reusable temporary buffers\nconst SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);\nconst SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);\nexport class SHA512 extends HashMD {\n constructor(outputLen = 64) {\n super(128, outputLen, 16, false);\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n // h -- high 32 bits, l -- low 32 bits\n this.Ah = SHA512_IV[0] | 0;\n this.Al = SHA512_IV[1] | 0;\n this.Bh = SHA512_IV[2] | 0;\n this.Bl = SHA512_IV[3] | 0;\n this.Ch = SHA512_IV[4] | 0;\n this.Cl = SHA512_IV[5] | 0;\n this.Dh = SHA512_IV[6] | 0;\n this.Dl = SHA512_IV[7] | 0;\n this.Eh = SHA512_IV[8] | 0;\n this.El = SHA512_IV[9] | 0;\n this.Fh = SHA512_IV[10] | 0;\n this.Fl = SHA512_IV[11] | 0;\n this.Gh = SHA512_IV[12] | 0;\n this.Gl = SHA512_IV[13] | 0;\n this.Hh = SHA512_IV[14] | 0;\n this.Hl = SHA512_IV[15] | 0;\n }\n // prettier-ignore\n get() {\n const { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n return [Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl];\n }\n // prettier-ignore\n set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl) {\n this.Ah = Ah | 0;\n this.Al = Al | 0;\n this.Bh = Bh | 0;\n this.Bl = Bl | 0;\n this.Ch = Ch | 0;\n this.Cl = Cl | 0;\n this.Dh = Dh | 0;\n this.Dl = Dl | 0;\n this.Eh = Eh | 0;\n this.El = El | 0;\n this.Fh = Fh | 0;\n this.Fl = Fl | 0;\n this.Gh = Gh | 0;\n this.Gl = Gl | 0;\n this.Hh = Hh | 0;\n this.Hl = Hl | 0;\n }\n process(view, offset) {\n // Extend the first 16 words into the remaining 64 words w[16..79] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4) {\n SHA512_W_H[i] = view.getUint32(offset);\n SHA512_W_L[i] = view.getUint32((offset += 4));\n }\n for (let i = 16; i < 80; i++) {\n // s0 := (w[i-15] rightrotate 1) xor (w[i-15] rightrotate 8) xor (w[i-15] rightshift 7)\n const W15h = SHA512_W_H[i - 15] | 0;\n const W15l = SHA512_W_L[i - 15] | 0;\n const s0h = u64.rotrSH(W15h, W15l, 1) ^ u64.rotrSH(W15h, W15l, 8) ^ u64.shrSH(W15h, W15l, 7);\n const s0l = u64.rotrSL(W15h, W15l, 1) ^ u64.rotrSL(W15h, W15l, 8) ^ u64.shrSL(W15h, W15l, 7);\n // s1 := (w[i-2] rightrotate 19) xor (w[i-2] rightrotate 61) xor (w[i-2] rightshift 6)\n const W2h = SHA512_W_H[i - 2] | 0;\n const W2l = SHA512_W_L[i - 2] | 0;\n const s1h = u64.rotrSH(W2h, W2l, 19) ^ u64.rotrBH(W2h, W2l, 61) ^ u64.shrSH(W2h, W2l, 6);\n const s1l = u64.rotrSL(W2h, W2l, 19) ^ u64.rotrBL(W2h, W2l, 61) ^ u64.shrSL(W2h, W2l, 6);\n // SHA256_W[i] = s0 + s1 + SHA256_W[i - 7] + SHA256_W[i - 16];\n const SUMl = u64.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);\n const SUMh = u64.add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]);\n SHA512_W_H[i] = SUMh | 0;\n SHA512_W_L[i] = SUMl | 0;\n }\n let { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n // Compression function main loop, 80 rounds\n for (let i = 0; i < 80; i++) {\n // S1 := (e rightrotate 14) xor (e rightrotate 18) xor (e rightrotate 41)\n const sigma1h = u64.rotrSH(Eh, El, 14) ^ u64.rotrSH(Eh, El, 18) ^ u64.rotrBH(Eh, El, 41);\n const sigma1l = u64.rotrSL(Eh, El, 14) ^ u64.rotrSL(Eh, El, 18) ^ u64.rotrBL(Eh, El, 41);\n //const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n const CHIh = (Eh & Fh) ^ (~Eh & Gh);\n const CHIl = (El & Fl) ^ (~El & Gl);\n // T1 = H + sigma1 + Chi(E, F, G) + SHA512_K[i] + SHA512_W[i]\n // prettier-ignore\n const T1ll = u64.add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);\n const T1h = u64.add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);\n const T1l = T1ll | 0;\n // S0 := (a rightrotate 28) xor (a rightrotate 34) xor (a rightrotate 39)\n const sigma0h = u64.rotrSH(Ah, Al, 28) ^ u64.rotrBH(Ah, Al, 34) ^ u64.rotrBH(Ah, Al, 39);\n const sigma0l = u64.rotrSL(Ah, Al, 28) ^ u64.rotrBL(Ah, Al, 34) ^ u64.rotrBL(Ah, Al, 39);\n const MAJh = (Ah & Bh) ^ (Ah & Ch) ^ (Bh & Ch);\n const MAJl = (Al & Bl) ^ (Al & Cl) ^ (Bl & Cl);\n Hh = Gh | 0;\n Hl = Gl | 0;\n Gh = Fh | 0;\n Gl = Fl | 0;\n Fh = Eh | 0;\n Fl = El | 0;\n ({ h: Eh, l: El } = u64.add(Dh | 0, Dl | 0, T1h | 0, T1l | 0));\n Dh = Ch | 0;\n Dl = Cl | 0;\n Ch = Bh | 0;\n Cl = Bl | 0;\n Bh = Ah | 0;\n Bl = Al | 0;\n const All = u64.add3L(T1l, sigma0l, MAJl);\n Ah = u64.add3H(All, T1h, sigma0h, MAJh);\n Al = All | 0;\n }\n // Add the compressed chunk to the current hash value\n ({ h: Ah, l: Al } = u64.add(this.Ah | 0, this.Al | 0, Ah | 0, Al | 0));\n ({ h: Bh, l: Bl } = u64.add(this.Bh | 0, this.Bl | 0, Bh | 0, Bl | 0));\n ({ h: Ch, l: Cl } = u64.add(this.Ch | 0, this.Cl | 0, Ch | 0, Cl | 0));\n ({ h: Dh, l: Dl } = u64.add(this.Dh | 0, this.Dl | 0, Dh | 0, Dl | 0));\n ({ h: Eh, l: El } = u64.add(this.Eh | 0, this.El | 0, Eh | 0, El | 0));\n ({ h: Fh, l: Fl } = u64.add(this.Fh | 0, this.Fl | 0, Fh | 0, Fl | 0));\n ({ h: Gh, l: Gl } = u64.add(this.Gh | 0, this.Gl | 0, Gh | 0, Gl | 0));\n ({ h: Hh, l: Hl } = u64.add(this.Hh | 0, this.Hl | 0, Hh | 0, Hl | 0));\n this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);\n }\n roundClean() {\n clean(SHA512_W_H, SHA512_W_L);\n }\n destroy() {\n clean(this.buffer);\n this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);\n }\n}\nexport class SHA384 extends SHA512 {\n constructor() {\n super(48);\n this.Ah = SHA384_IV[0] | 0;\n this.Al = SHA384_IV[1] | 0;\n this.Bh = SHA384_IV[2] | 0;\n this.Bl = SHA384_IV[3] | 0;\n this.Ch = SHA384_IV[4] | 0;\n this.Cl = SHA384_IV[5] | 0;\n this.Dh = SHA384_IV[6] | 0;\n this.Dl = SHA384_IV[7] | 0;\n this.Eh = SHA384_IV[8] | 0;\n this.El = SHA384_IV[9] | 0;\n this.Fh = SHA384_IV[10] | 0;\n this.Fl = SHA384_IV[11] | 0;\n this.Gh = SHA384_IV[12] | 0;\n this.Gl = SHA384_IV[13] | 0;\n this.Hh = SHA384_IV[14] | 0;\n this.Hl = SHA384_IV[15] | 0;\n }\n}\n/**\n * Truncated SHA512/256 and SHA512/224.\n * SHA512_IV is XORed with 0xa5a5a5a5a5a5a5a5, then used as \"intermediary\" IV of SHA512/t.\n * Then t hashes string to produce result IV.\n * See `test/misc/sha2-gen-iv.js`.\n */\n/** SHA512/224 IV */\nconst T224_IV = /* @__PURE__ */ Uint32Array.from([\n 0x8c3d37c8, 0x19544da2, 0x73e19966, 0x89dcd4d6, 0x1dfab7ae, 0x32ff9c82, 0x679dd514, 0x582f9fcf,\n 0x0f6d2b69, 0x7bd44da8, 0x77e36f73, 0x04c48942, 0x3f9d85a8, 0x6a1d36c8, 0x1112e6ad, 0x91d692a1,\n]);\n/** SHA512/256 IV */\nconst T256_IV = /* @__PURE__ */ Uint32Array.from([\n 0x22312194, 0xfc2bf72c, 0x9f555fa3, 0xc84c64c2, 0x2393b86b, 0x6f53b151, 0x96387719, 0x5940eabd,\n 0x96283ee2, 0xa88effe3, 0xbe5e1e25, 0x53863992, 0x2b0199fc, 0x2c85b8aa, 0x0eb72ddc, 0x81c52ca2,\n]);\nexport class SHA512_224 extends SHA512 {\n constructor() {\n super(28);\n this.Ah = T224_IV[0] | 0;\n this.Al = T224_IV[1] | 0;\n this.Bh = T224_IV[2] | 0;\n this.Bl = T224_IV[3] | 0;\n this.Ch = T224_IV[4] | 0;\n this.Cl = T224_IV[5] | 0;\n this.Dh = T224_IV[6] | 0;\n this.Dl = T224_IV[7] | 0;\n this.Eh = T224_IV[8] | 0;\n this.El = T224_IV[9] | 0;\n this.Fh = T224_IV[10] | 0;\n this.Fl = T224_IV[11] | 0;\n this.Gh = T224_IV[12] | 0;\n this.Gl = T224_IV[13] | 0;\n this.Hh = T224_IV[14] | 0;\n this.Hl = T224_IV[15] | 0;\n }\n}\nexport class SHA512_256 extends SHA512 {\n constructor() {\n super(32);\n this.Ah = T256_IV[0] | 0;\n this.Al = T256_IV[1] | 0;\n this.Bh = T256_IV[2] | 0;\n this.Bl = T256_IV[3] | 0;\n this.Ch = T256_IV[4] | 0;\n this.Cl = T256_IV[5] | 0;\n this.Dh = T256_IV[6] | 0;\n this.Dl = T256_IV[7] | 0;\n this.Eh = T256_IV[8] | 0;\n this.El = T256_IV[9] | 0;\n this.Fh = T256_IV[10] | 0;\n this.Fl = T256_IV[11] | 0;\n this.Gh = T256_IV[12] | 0;\n this.Gl = T256_IV[13] | 0;\n this.Hh = T256_IV[14] | 0;\n this.Hl = T256_IV[15] | 0;\n }\n}\n/**\n * SHA2-256 hash function from RFC 4634.\n *\n * It is the fastest JS hash, even faster than Blake3.\n * To break sha256 using birthday attack, attackers need to try 2^128 hashes.\n * BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.\n */\nexport const sha256 = /* @__PURE__ */ createHasher(() => new SHA256());\n/** SHA2-224 hash function from RFC 4634 */\nexport const sha224 = /* @__PURE__ */ createHasher(() => new SHA224());\n/** SHA2-512 hash function from RFC 4634. */\nexport const sha512 = /* @__PURE__ */ createHasher(() => new SHA512());\n/** SHA2-384 hash function from RFC 4634. */\nexport const sha384 = /* @__PURE__ */ createHasher(() => new SHA384());\n/**\n * SHA2-512/256 \"truncated\" hash function, with improved resistance to length extension attacks.\n * See the paper on [truncated SHA512](https://eprint.iacr.org/2010/548.pdf).\n */\nexport const sha512_256 = /* @__PURE__ */ createHasher(() => new SHA512_256());\n/**\n * SHA2-512/224 \"truncated\" hash function, with improved resistance to length extension attacks.\n * See the paper on [truncated SHA512](https://eprint.iacr.org/2010/548.pdf).\n */\nexport const sha512_224 = /* @__PURE__ */ createHasher(() => new SHA512_224());\n//# sourceMappingURL=sha2.js.map"],"names":["crypto","isBytes","a","anumber","n","abytes","b","lengths","ahash","h","aexists","instance","checkFinished","aoutput","out","min","clean","arrays","i","createView","arr","rotr","word","shift","hasHexBuiltin","hexes","_","bytesToHex","bytes","hex","asciis","asciiToBase16","ch","hexToBytes","hl","al","array","ai","hi","n1","n2","char","utf8ToBytes","str","toBytes","data","concatBytes","sum","res","pad","Hash","createHasher","hashCons","hashC","msg","tmp","randomBytes","bytesLength","setBigUint64","view","byteOffset","value","isLE","_32n","_u32_max","wh","wl","l","Chi","c","Maj","HashMD","blockLen","outputLen","padOffset","buffer","len","pos","take","dataView","oview","outLen","state","to","length","finished","destroyed","SHA256_IV","SHA384_IV","SHA512_IV","U32_MASK64","fromBig","le","split","lst","Ah","Al","shrSH","_l","shrSL","rotrSH","rotrSL","rotrBH","rotrBL","add","Bh","Bl","add3L","Cl","add3H","low","Ch","add4L","Dl","add4H","Dh","add5L","El","add5H","Eh","SHA256_K","SHA256_W","SHA256","A","B","C","D","E","F","G","H","offset","W15","W2","s0","s1","sigma1","T1","T2","K512","u64.split","SHA512_Kh","SHA512_Kl","SHA512_W_H","SHA512_W_L","SHA512","Fh","Fl","Gh","Gl","Hh","Hl","W15h","W15l","s0h","u64.rotrSH","u64.shrSH","s0l","u64.rotrSL","u64.shrSL","W2h","W2l","s1h","u64.rotrBH","s1l","u64.rotrBL","SUMl","u64.add4L","SUMh","u64.add4H","sigma1h","sigma1l","CHIh","CHIl","T1ll","u64.add5L","T1h","u64.add5H","T1l","sigma0h","sigma0l","MAJh","MAJl","u64.add","All","u64.add3L","u64.add3H","SHA384","sha256","sha512","sha384"],"mappings":"AAAO,MAAMA,IAAS,OAAO,cAAe,YAAY,YAAY,aAAa,WAAW,SAAS;ACIrG;AASO,SAASC,GAAQC,GAAG;AACvB,SAAOA,aAAa,cAAe,YAAY,OAAOA,CAAC,KAAKA,EAAE,YAAY,SAAS;AACvF;AAEO,SAASC,EAAQC,GAAG;AACvB,MAAI,CAAC,OAAO,cAAcA,CAAC,KAAKA,IAAI;AAChC,UAAM,IAAI,MAAM,oCAAoCA,CAAC;AAC7D;AAEO,SAASC,EAAOC,MAAMC,GAAS;AAClC,MAAI,CAACN,GAAQK,CAAC;AACV,UAAM,IAAI,MAAM,qBAAqB;AACzC,MAAIC,EAAQ,SAAS,KAAK,CAACA,EAAQ,SAASD,EAAE,MAAM;AAChD,UAAM,IAAI,MAAM,mCAAmCC,IAAU,kBAAkBD,EAAE,MAAM;AAC/F;AAEO,SAASE,GAAMC,GAAG;AACrB,MAAI,OAAOA,KAAM,cAAc,OAAOA,EAAE,UAAW;AAC/C,UAAM,IAAI,MAAM,8CAA8C;AAClE,EAAAN,EAAQM,EAAE,SAAS,GACnBN,EAAQM,EAAE,QAAQ;AACtB;AAEO,SAASC,EAAQC,GAAUC,IAAgB,IAAM;AACpD,MAAID,EAAS;AACT,UAAM,IAAI,MAAM,kCAAkC;AACtD,MAAIC,KAAiBD,EAAS;AAC1B,UAAM,IAAI,MAAM,uCAAuC;AAC/D;AAEO,SAASE,GAAQC,GAAKH,GAAU;AACnC,EAAAN,EAAOS,CAAG;AACV,QAAMC,IAAMJ,EAAS;AACrB,MAAIG,EAAI,SAASC;AACb,UAAM,IAAI,MAAM,2DAA2DA,CAAG;AAEtF;AAUO,SAASC,KAASC,GAAQ;AAC7B,WAASC,IAAI,GAAGA,IAAID,EAAO,QAAQC;AAC/B,IAAAD,EAAOC,CAAC,EAAE,KAAK,CAAC;AAExB;AAEO,SAASC,EAAWC,GAAK;AAC5B,SAAO,IAAI,SAASA,EAAI,QAAQA,EAAI,YAAYA,EAAI,UAAU;AAClE;AAEO,SAASC,EAAKC,GAAMC,GAAO;AAC9B,SAAQD,KAAS,KAAKC,IAAWD,MAASC;AAC9C;AA+BA,MAAMC,sBAEN,OAAO,WAAW,KAAK,CAAA,CAAE,EAAE,SAAU,cAAc,OAAO,WAAW,WAAY,YAE3EC,KAAwB,sBAAM,KAAK,EAAE,QAAQ,IAAG,GAAI,CAACC,GAAGR,MAAMA,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAK5F,SAASS,GAAWC,GAAO;AAG9B,MAFAvB,EAAOuB,CAAK,GAERJ;AACA,WAAOI,EAAM,MAAK;AAEtB,MAAIC,IAAM;AACV,WAASX,IAAI,GAAGA,IAAIU,EAAM,QAAQV;AAC9B,IAAAW,KAAOJ,GAAMG,EAAMV,CAAC,CAAC;AAEzB,SAAOW;AACX;AAEA,MAAMC,IAAS,EAAE,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAG;AAC5D,SAASC,EAAcC,GAAI;AACvB,MAAIA,KAAMF,EAAO,MAAME,KAAMF,EAAO;AAChC,WAAOE,IAAKF,EAAO;AACvB,MAAIE,KAAMF,EAAO,KAAKE,KAAMF,EAAO;AAC/B,WAAOE,KAAMF,EAAO,IAAI;AAC5B,MAAIE,KAAMF,EAAO,KAAKE,KAAMF,EAAO;AAC/B,WAAOE,KAAMF,EAAO,IAAI;AAEhC;AAKO,SAASG,GAAWJ,GAAK;AAC5B,MAAI,OAAOA,KAAQ;AACf,UAAM,IAAI,MAAM,8BAA8B,OAAOA,CAAG;AAE5D,MAAIL;AACA,WAAO,WAAW,QAAQK,CAAG;AACjC,QAAMK,IAAKL,EAAI,QACTM,IAAKD,IAAK;AAChB,MAAIA,IAAK;AACL,UAAM,IAAI,MAAM,qDAAqDA,CAAE;AAC3E,QAAME,IAAQ,IAAI,WAAWD,CAAE;AAC/B,WAASE,IAAK,GAAGC,IAAK,GAAGD,IAAKF,GAAIE,KAAMC,KAAM,GAAG;AAC7C,UAAMC,IAAKR,EAAcF,EAAI,WAAWS,CAAE,CAAC,GACrCE,IAAKT,EAAcF,EAAI,WAAWS,IAAK,CAAC,CAAC;AAC/C,QAAIC,MAAO,UAAaC,MAAO,QAAW;AACtC,YAAMC,IAAOZ,EAAIS,CAAE,IAAIT,EAAIS,IAAK,CAAC;AACjC,YAAM,IAAI,MAAM,iDAAiDG,IAAO,gBAAgBH,CAAE;AAAA,IAC9F;AACA,IAAAF,EAAMC,CAAE,IAAIE,IAAK,KAAKC;AAAA,EAC1B;AACA,SAAOJ;AACX;AAwBO,SAASM,GAAYC,GAAK;AAC7B,MAAI,OAAOA,KAAQ;AACf,UAAM,IAAI,MAAM,iBAAiB;AACrC,SAAO,IAAI,WAAW,IAAI,YAAW,EAAG,OAAOA,CAAG,CAAC;AACvD;AAaO,SAASC,GAAQC,GAAM;AAC1B,SAAI,OAAOA,KAAS,aAChBA,IAAOH,GAAYG,CAAI,IAC3BxC,EAAOwC,CAAI,GACJA;AACX;AAYO,SAASC,MAAe7B,GAAQ;AACnC,MAAI8B,IAAM;AACV,WAAS7B,IAAI,GAAGA,IAAID,EAAO,QAAQC,KAAK;AACpC,UAAMhB,IAAIe,EAAOC,CAAC;AAClB,IAAAb,EAAOH,CAAC,GACR6C,KAAO7C,EAAE;AAAA,EACb;AACA,QAAM8C,IAAM,IAAI,WAAWD,CAAG;AAC9B,WAAS7B,IAAI,GAAG+B,IAAM,GAAG/B,IAAID,EAAO,QAAQC,KAAK;AAC7C,UAAMhB,IAAIe,EAAOC,CAAC;AAClB,IAAA8B,EAAI,IAAI9C,GAAG+C,CAAG,GACdA,KAAO/C,EAAE;AAAA,EACb;AACA,SAAO8C;AACX;AAQO,MAAME,GAAK;AAClB;AAEO,SAASC,EAAaC,GAAU;AACnC,QAAMC,IAAQ,CAACC,MAAQF,EAAQ,EAAG,OAAOR,GAAQU,CAAG,CAAC,EAAE,OAAM,GACvDC,IAAMH,EAAQ;AACpB,SAAAC,EAAM,YAAYE,EAAI,WACtBF,EAAM,WAAWE,EAAI,UACrBF,EAAM,SAAS,MAAMD,EAAQ,GACtBC;AACX;AAqBO,SAASG,GAAYC,IAAc,IAAI;AAC1C,MAAIzD,KAAU,OAAOA,EAAO,mBAAoB;AAC5C,WAAOA,EAAO,gBAAgB,IAAI,WAAWyD,CAAW,CAAC;AAG7D,MAAIzD,KAAU,OAAOA,EAAO,eAAgB;AACxC,WAAO,WAAW,KAAKA,EAAO,YAAYyD,CAAW,CAAC;AAE1D,QAAM,IAAI,MAAM,wCAAwC;AAC5D;ACjRO,SAASC,GAAaC,GAAMC,GAAYC,GAAOC,GAAM;AACxD,MAAI,OAAOH,EAAK,gBAAiB;AAC7B,WAAOA,EAAK,aAAaC,GAAYC,GAAOC,CAAI;AACpD,QAAMC,IAAO,OAAO,EAAE,GAChBC,IAAW,OAAO,UAAU,GAC5BC,IAAK,OAAQJ,KAASE,IAAQC,CAAQ,GACtCE,IAAK,OAAOL,IAAQG,CAAQ,GAC5B,IAAIF,IAAO,IAAI,GACfK,IAAIL,IAAO,IAAI;AACrB,EAAAH,EAAK,UAAUC,IAAa,GAAGK,GAAIH,CAAI,GACvCH,EAAK,UAAUC,IAAaO,GAAGD,GAAIJ,CAAI;AAC3C;AAEO,SAASM,GAAIlE,GAAGI,GAAG+D,GAAG;AACzB,SAAQnE,IAAII,IAAM,CAACJ,IAAImE;AAC3B;AAEO,SAASC,GAAIpE,GAAGI,GAAG+D,GAAG;AACzB,SAAQnE,IAAII,IAAMJ,IAAImE,IAAM/D,IAAI+D;AACpC;AAKO,MAAME,WAAerB,GAAK;AAAA,EAC7B,YAAYsB,GAAUC,GAAWC,GAAWZ,GAAM;AAC9C,UAAK,GACL,KAAK,WAAW,IAChB,KAAK,SAAS,GACd,KAAK,MAAM,GACX,KAAK,YAAY,IACjB,KAAK,WAAWU,GAChB,KAAK,YAAYC,GACjB,KAAK,YAAYC,GACjB,KAAK,OAAOZ,GACZ,KAAK,SAAS,IAAI,WAAWU,CAAQ,GACrC,KAAK,OAAOrD,EAAW,KAAK,MAAM;AAAA,EACtC;AAAA,EACA,OAAO0B,GAAM;AACT,IAAAnC,EAAQ,IAAI,GACZmC,IAAOD,GAAQC,CAAI,GACnBxC,EAAOwC,CAAI;AACX,UAAM,EAAE,MAAAc,GAAM,QAAAgB,GAAQ,UAAAH,EAAQ,IAAK,MAC7BI,IAAM/B,EAAK;AACjB,aAASgC,IAAM,GAAGA,IAAMD,KAAM;AAC1B,YAAME,IAAO,KAAK,IAAIN,IAAW,KAAK,KAAKI,IAAMC,CAAG;AAEpD,UAAIC,MAASN,GAAU;AACnB,cAAMO,IAAW5D,EAAW0B,CAAI;AAChC,eAAO2B,KAAYI,IAAMC,GAAKA,KAAOL;AACjC,eAAK,QAAQO,GAAUF,CAAG;AAC9B;AAAA,MACJ;AACA,MAAAF,EAAO,IAAI9B,EAAK,SAASgC,GAAKA,IAAMC,CAAI,GAAG,KAAK,GAAG,GACnD,KAAK,OAAOA,GACZD,KAAOC,GACH,KAAK,QAAQN,MACb,KAAK,QAAQb,GAAM,CAAC,GACpB,KAAK,MAAM;AAAA,IAEnB;AACA,gBAAK,UAAUd,EAAK,QACpB,KAAK,WAAU,GACR;AAAA,EACX;AAAA,EACA,WAAW/B,GAAK;AACZ,IAAAJ,EAAQ,IAAI,GACZG,GAAQC,GAAK,IAAI,GACjB,KAAK,WAAW;AAIhB,UAAM,EAAE,QAAA6D,GAAQ,MAAAhB,GAAM,UAAAa,GAAU,MAAAV,EAAI,IAAK;AACzC,QAAI,EAAE,KAAAe,EAAG,IAAK;AAEd,IAAAF,EAAOE,GAAK,IAAI,KAChB7D,EAAM,KAAK,OAAO,SAAS6D,CAAG,CAAC,GAG3B,KAAK,YAAYL,IAAWK,MAC5B,KAAK,QAAQlB,GAAM,CAAC,GACpBkB,IAAM;AAGV,aAAS3D,IAAI2D,GAAK3D,IAAIsD,GAAUtD;AAC5B,MAAAyD,EAAOzD,CAAC,IAAI;AAIhB,IAAAwC,GAAaC,GAAMa,IAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAGV,CAAI,GAC9D,KAAK,QAAQH,GAAM,CAAC;AACpB,UAAMqB,IAAQ7D,EAAWL,CAAG,GACtB8D,IAAM,KAAK;AAEjB,QAAIA,IAAM;AACN,YAAM,IAAI,MAAM,6CAA6C;AACjE,UAAMK,IAASL,IAAM,GACfM,IAAQ,KAAK,IAAG;AACtB,QAAID,IAASC,EAAM;AACf,YAAM,IAAI,MAAM,oCAAoC;AACxD,aAAShE,IAAI,GAAGA,IAAI+D,GAAQ/D;AACxB,MAAA8D,EAAM,UAAU,IAAI9D,GAAGgE,EAAMhE,CAAC,GAAG4C,CAAI;AAAA,EAC7C;AAAA,EACA,SAAS;AACL,UAAM,EAAE,QAAAa,GAAQ,WAAAF,EAAS,IAAK;AAC9B,SAAK,WAAWE,CAAM;AACtB,UAAM3B,IAAM2B,EAAO,MAAM,GAAGF,CAAS;AACrC,gBAAK,QAAO,GACLzB;AAAA,EACX;AAAA,EACA,WAAWmC,GAAI;AACX,IAAAA,MAAOA,IAAK,IAAI,KAAK,YAAW,IAChCA,EAAG,IAAI,GAAG,KAAK,IAAG,CAAE;AACpB,UAAM,EAAE,UAAAX,GAAU,QAAAG,GAAQ,QAAAS,GAAQ,UAAAC,GAAU,WAAAC,GAAW,KAAAT,EAAG,IAAK;AAC/D,WAAAM,EAAG,YAAYG,GACfH,EAAG,WAAWE,GACdF,EAAG,SAASC,GACZD,EAAG,MAAMN,GACLO,IAASZ,KACTW,EAAG,OAAO,IAAIR,CAAM,GACjBQ;AAAA,EACX;AAAA,EACA,QAAQ;AACJ,WAAO,KAAK,WAAU;AAAA,EAC1B;AACJ;AAMO,MAAMI,IAA4B,4BAAY,KAAK;AAAA,EACtD;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACxF,CAAC,GAMYC,IAA4B,4BAAY,KAAK;AAAA,EACtD;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACxF,CAAC,GAEYC,IAA4B,4BAAY,KAAK;AAAA,EACtD;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACxF,CAAC,GCpJKC,IAA6B,uBAAO,KAAK,KAAK,CAAC,GAC/C3B,IAAuB,uBAAO,EAAE;AACtC,SAAS4B,GAAQvF,GAAGwF,IAAK,IAAO;AAC5B,SAAIA,IACO,EAAE,GAAG,OAAOxF,IAAIsF,CAAU,GAAG,GAAG,OAAQtF,KAAK2D,IAAQ2B,CAAU,EAAC,IACpE,EAAE,GAAG,OAAQtF,KAAK2D,IAAQ2B,CAAU,IAAI,GAAG,GAAG,OAAOtF,IAAIsF,CAAU,IAAI,EAAC;AACnF;AACA,SAASG,GAAMC,GAAKF,IAAK,IAAO;AAC5B,QAAMhB,IAAMkB,EAAI;AAChB,MAAIC,IAAK,IAAI,YAAYnB,CAAG,GACxBoB,IAAK,IAAI,YAAYpB,CAAG;AAC5B,WAAS,IAAI,GAAG,IAAIA,GAAK,KAAK;AAC1B,UAAM,EAAE,GAAAnE,GAAG,GAAA0D,EAAC,IAAKwB,GAAQG,EAAI,CAAC,GAAGF,CAAE;AACnC,KAACG,EAAG,CAAC,GAAGC,EAAG,CAAC,CAAC,IAAI,CAACvF,GAAG0D,CAAC;AAAA,EAC1B;AACA,SAAO,CAAC4B,GAAIC,CAAE;AAClB;AAGA,MAAMC,KAAQ,CAACxF,GAAGyF,GAAI,MAAMzF,MAAM,GAC5B0F,KAAQ,CAAC1F,GAAG0D,GAAG,MAAO1D,KAAM,KAAK,IAAO0D,MAAM,GAE9CiC,IAAS,CAAC3F,GAAG0D,GAAG,MAAO1D,MAAM,IAAM0D,KAAM,KAAK,GAC9CkC,IAAS,CAAC5F,GAAG0D,GAAG,MAAO1D,KAAM,KAAK,IAAO0D,MAAM,GAE/CmC,IAAS,CAAC7F,GAAG0D,GAAG,MAAO1D,KAAM,KAAK,IAAO0D,MAAO,IAAI,IACpDoC,IAAS,CAAC9F,GAAG0D,GAAG,MAAO1D,MAAO,IAAI,KAAQ0D,KAAM,KAAK;AAY3D,SAASqC,EAAIT,GAAIC,GAAIS,GAAIC,GAAI;AACzB,QAAMvC,KAAK6B,MAAO,MAAMU,MAAO;AAC/B,SAAO,EAAE,GAAIX,IAAKU,KAAOtC,IAAI,KAAK,KAAM,KAAM,GAAG,GAAGA,IAAI,EAAC;AAC7D;AAEA,MAAMwC,KAAQ,CAACX,GAAIU,GAAIE,OAAQZ,MAAO,MAAMU,MAAO,MAAME,MAAO,IAC1DC,KAAQ,CAACC,GAAKf,GAAIU,GAAIM,MAAQhB,IAAKU,IAAKM,KAAOD,IAAM,KAAK,KAAM,KAAM,GACtEE,KAAQ,CAAChB,GAAIU,GAAIE,GAAIK,OAAQjB,MAAO,MAAMU,MAAO,MAAME,MAAO,MAAMK,MAAO,IAC3EC,KAAQ,CAACJ,GAAKf,GAAIU,GAAIM,GAAII,MAAQpB,IAAKU,IAAKM,IAAKI,KAAOL,IAAM,KAAK,KAAM,KAAM,GAC/EM,KAAQ,CAACpB,GAAIU,GAAIE,GAAIK,GAAII,OAAQrB,MAAO,MAAMU,MAAO,MAAME,MAAO,MAAMK,MAAO,MAAMI,MAAO,IAC5FC,KAAQ,CAACR,GAAKf,GAAIU,GAAIM,GAAII,GAAII,MAAQxB,IAAKU,IAAKM,IAAKI,IAAKI,KAAOT,IAAM,KAAK,KAAM,KAAM,GCtCxFU,KAA2B,4BAAY,KAAK;AAAA,EAC9C;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACxF,CAAC,GAEKC,IAA2B,oBAAI,YAAY,EAAE;AAC5C,MAAMC,WAAenD,GAAO;AAAA,EAC/B,YAAYE,IAAY,IAAI;AACxB,UAAM,IAAIA,GAAW,GAAG,EAAK,GAG7B,KAAK,IAAIc,EAAU,CAAC,IAAI,GACxB,KAAK,IAAIA,EAAU,CAAC,IAAI,GACxB,KAAK,IAAIA,EAAU,CAAC,IAAI,GACxB,KAAK,IAAIA,EAAU,CAAC,IAAI,GACxB,KAAK,IAAIA,EAAU,CAAC,IAAI,GACxB,KAAK,IAAIA,EAAU,CAAC,IAAI,GACxB,KAAK,IAAIA,EAAU,CAAC,IAAI,GACxB,KAAK,IAAIA,EAAU,CAAC,IAAI;AAAA,EAC5B;AAAA,EACA,MAAM;AACF,UAAM,EAAE,GAAAoC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,EAAC,IAAK;AACnC,WAAO,CAACP,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,CAAC;AAAA,EAClC;AAAA;AAAA,EAEA,IAAIP,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAG;AACxB,SAAK,IAAIP,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI;AAAA,EACjB;AAAA,EACA,QAAQvE,GAAMwE,GAAQ;AAElB,aAASjH,IAAI,GAAGA,IAAI,IAAIA,KAAKiH,KAAU;AACnC,MAAAV,EAASvG,CAAC,IAAIyC,EAAK,UAAUwE,GAAQ,EAAK;AAC9C,aAASjH,IAAI,IAAIA,IAAI,IAAIA,KAAK;AAC1B,YAAMkH,IAAMX,EAASvG,IAAI,EAAE,GACrBmH,IAAKZ,EAASvG,IAAI,CAAC,GACnBoH,IAAKjH,EAAK+G,GAAK,CAAC,IAAI/G,EAAK+G,GAAK,EAAE,IAAKA,MAAQ,GAC7CG,IAAKlH,EAAKgH,GAAI,EAAE,IAAIhH,EAAKgH,GAAI,EAAE,IAAKA,MAAO;AACjD,MAAAZ,EAASvG,CAAC,IAAKqH,IAAKd,EAASvG,IAAI,CAAC,IAAIoH,IAAKb,EAASvG,IAAI,EAAE,IAAK;AAAA,IACnE;AAEA,QAAI,EAAE,GAAAyG,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,EAAC,IAAK;AACjC,aAAShH,IAAI,GAAGA,IAAI,IAAIA,KAAK;AACzB,YAAMsH,IAASnH,EAAK0G,GAAG,CAAC,IAAI1G,EAAK0G,GAAG,EAAE,IAAI1G,EAAK0G,GAAG,EAAE,GAC9CU,IAAMP,IAAIM,IAASpE,GAAI2D,GAAGC,GAAGC,CAAC,IAAIT,GAAStG,CAAC,IAAIuG,EAASvG,CAAC,IAAK,GAE/DwH,KADSrH,EAAKsG,GAAG,CAAC,IAAItG,EAAKsG,GAAG,EAAE,IAAItG,EAAKsG,GAAG,EAAE,KAC/BrD,GAAIqD,GAAGC,GAAGC,CAAC,IAAK;AACrC,MAAAK,IAAID,GACJA,IAAID,GACJA,IAAID,GACJA,IAAKD,IAAIW,IAAM,GACfX,IAAID,GACJA,IAAID,GACJA,IAAID,GACJA,IAAKc,IAAKC,IAAM;AAAA,IACpB;AAEA,IAAAf,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnB,KAAK,IAAIP,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,CAAC;AAAA,EACnC;AAAA,EACA,aAAa;AACT,IAAAlH,EAAMyG,CAAQ;AAAA,EAClB;AAAA,EACA,UAAU;AACN,SAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,GAC/BzG,EAAM,KAAK,MAAM;AAAA,EACrB;AACJ;AAkBA,MAAM2H,KAA8BC,GAAU;AAAA,EAC1C;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AACtE,EAAE,IAAI,CAAAxI,MAAK,OAAOA,CAAC,CAAC,CAAC,GACfyI,KAAmCF,GAAK,CAAC,GACzCG,KAAmCH,GAAK,CAAC,GAEzCI,IAA6B,oBAAI,YAAY,EAAE,GAC/CC,IAA6B,oBAAI,YAAY,EAAE;AAC9C,MAAMC,WAAe1E,GAAO;AAAA,EAC/B,YAAYE,IAAY,IAAI;AACxB,UAAM,KAAKA,GAAW,IAAI,EAAK,GAI/B,KAAK,KAAKgB,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,EAAE,IAAI,GAC1B,KAAK,KAAKA,EAAU,EAAE,IAAI,GAC1B,KAAK,KAAKA,EAAU,EAAE,IAAI,GAC1B,KAAK,KAAKA,EAAU,EAAE,IAAI,GAC1B,KAAK,KAAKA,EAAU,EAAE,IAAI,GAC1B,KAAK,KAAKA,EAAU,EAAE,IAAI;AAAA,EAC9B;AAAA;AAAA,EAEA,MAAM;AACF,UAAM,EAAE,IAAAM,GAAI,IAAAC,GAAI,IAAAS,GAAI,IAAAC,GAAI,IAAAK,GAAI,IAAAH,GAAI,IAAAO,GAAI,IAAAF,GAAI,IAAAM,GAAI,IAAAF,GAAI,IAAA6B,GAAI,IAAAC,GAAI,IAAAC,GAAI,IAAAC,GAAI,IAAAC,GAAI,IAAAC,EAAE,IAAK;AAC3E,WAAO,CAACxD,GAAIC,GAAIS,GAAIC,GAAIK,GAAIH,GAAIO,GAAIF,GAAIM,GAAIF,GAAI6B,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,CAAE;AAAA,EAC1E;AAAA;AAAA,EAEA,IAAIxD,GAAIC,GAAIS,GAAIC,GAAIK,GAAIH,GAAIO,GAAIF,GAAIM,GAAIF,GAAI6B,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAI;AAChE,SAAK,KAAKxD,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKS,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKK,IAAK,GACf,KAAK,KAAKH,IAAK,GACf,KAAK,KAAKO,IAAK,GACf,KAAK,KAAKF,IAAK,GACf,KAAK,KAAKM,IAAK,GACf,KAAK,KAAKF,IAAK,GACf,KAAK,KAAK6B,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKC,IAAK;AAAA,EACnB;AAAA,EACA,QAAQ5F,GAAMwE,GAAQ;AAElB,aAASjH,IAAI,GAAGA,IAAI,IAAIA,KAAKiH,KAAU;AACnC,MAAAY,EAAW7H,CAAC,IAAIyC,EAAK,UAAUwE,CAAM,GACrCa,EAAW9H,CAAC,IAAIyC,EAAK,UAAWwE,KAAU,CAAC;AAE/C,aAASjH,IAAI,IAAIA,IAAI,IAAIA,KAAK;AAE1B,YAAMsI,IAAOT,EAAW7H,IAAI,EAAE,IAAI,GAC5BuI,IAAOT,EAAW9H,IAAI,EAAE,IAAI,GAC5BwI,IAAMC,EAAWH,GAAMC,GAAM,CAAC,IAAIE,EAAWH,GAAMC,GAAM,CAAC,IAAIG,GAAUJ,GAAMC,GAAM,CAAC,GACrFI,IAAMC,EAAWN,GAAMC,GAAM,CAAC,IAAIK,EAAWN,GAAMC,GAAM,CAAC,IAAIM,GAAUP,GAAMC,GAAM,CAAC,GAErFO,IAAMjB,EAAW7H,IAAI,CAAC,IAAI,GAC1B+I,IAAMjB,EAAW9H,IAAI,CAAC,IAAI,GAC1BgJ,IAAMP,EAAWK,GAAKC,GAAK,EAAE,IAAIE,EAAWH,GAAKC,GAAK,EAAE,IAAIL,GAAUI,GAAKC,GAAK,CAAC,GACjFG,IAAMN,EAAWE,GAAKC,GAAK,EAAE,IAAII,EAAWL,GAAKC,GAAK,EAAE,IAAIF,GAAUC,GAAKC,GAAK,CAAC,GAEjFK,IAAOC,GAAUV,GAAKO,GAAKpB,EAAW9H,IAAI,CAAC,GAAG8H,EAAW9H,IAAI,EAAE,CAAC,GAChEsJ,IAAOC,GAAUH,GAAMZ,GAAKQ,GAAKnB,EAAW7H,IAAI,CAAC,GAAG6H,EAAW7H,IAAI,EAAE,CAAC;AAC5E,MAAA6H,EAAW7H,CAAC,IAAIsJ,IAAO,GACvBxB,EAAW9H,CAAC,IAAIoJ,IAAO;AAAA,IAC3B;AACA,QAAI,EAAE,IAAAvE,GAAI,IAAAC,GAAI,IAAAS,GAAI,IAAAC,GAAI,IAAAK,GAAI,IAAAH,GAAI,IAAAO,GAAI,IAAAF,GAAI,IAAAM,GAAI,IAAAF,GAAI,IAAA6B,GAAI,IAAAC,GAAI,IAAAC,GAAI,IAAAC,GAAI,IAAAC,GAAI,IAAAC,EAAE,IAAK;AAEzE,aAASrI,IAAI,GAAGA,IAAI,IAAIA,KAAK;AAEzB,YAAMwJ,IAAUf,EAAWpC,GAAIF,GAAI,EAAE,IAAIsC,EAAWpC,GAAIF,GAAI,EAAE,IAAI8C,EAAW5C,GAAIF,GAAI,EAAE,GACjFsD,IAAUb,EAAWvC,GAAIF,GAAI,EAAE,IAAIyC,EAAWvC,GAAIF,GAAI,EAAE,IAAIgD,EAAW9C,GAAIF,GAAI,EAAE,GAEjFuD,IAAQrD,IAAK2B,IAAO,CAAC3B,IAAK6B,GAC1ByB,IAAQxD,IAAK8B,IAAO,CAAC9B,IAAKgC,GAG1ByB,IAAOC,GAAUxB,GAAIoB,GAASE,GAAM/B,GAAU5H,CAAC,GAAG8H,EAAW9H,CAAC,CAAC,GAC/D8J,IAAMC,GAAUH,GAAMxB,GAAIoB,GAASE,GAAM/B,GAAU3H,CAAC,GAAG6H,EAAW7H,CAAC,CAAC,GACpEgK,IAAMJ,IAAO,GAEbK,IAAUxB,EAAW5D,GAAIC,GAAI,EAAE,IAAImE,EAAWpE,GAAIC,GAAI,EAAE,IAAImE,EAAWpE,GAAIC,GAAI,EAAE,GACjFoF,IAAUtB,EAAW/D,GAAIC,GAAI,EAAE,IAAIqE,EAAWtE,GAAIC,GAAI,EAAE,IAAIqE,EAAWtE,GAAIC,GAAI,EAAE,GACjFqF,IAAQtF,IAAKU,IAAOV,IAAKgB,IAAON,IAAKM,GACrCuE,KAAQtF,IAAKU,IAAOV,IAAKY,IAAOF,IAAKE;AAC3C,MAAA0C,IAAKF,IAAK,GACVG,IAAKF,IAAK,GACVD,IAAKF,IAAK,GACVG,IAAKF,IAAK,GACVD,IAAK3B,IAAK,GACV4B,IAAK9B,IAAK,GACT,EAAE,GAAGE,GAAI,GAAGF,EAAE,IAAKkE,EAAQpE,IAAK,GAAGF,IAAK,GAAG+D,IAAM,GAAGE,IAAM,CAAC,GAC5D/D,IAAKJ,IAAK,GACVE,IAAKL,IAAK,GACVG,IAAKN,IAAK,GACVG,IAAKF,IAAK,GACVD,IAAKV,IAAK,GACVW,IAAKV,IAAK;AACV,YAAMwF,IAAMC,GAAUP,GAAKE,GAASE,EAAI;AACxC,MAAAvF,IAAK2F,GAAUF,GAAKR,GAAKG,GAASE,CAAI,GACtCrF,IAAKwF,IAAM;AAAA,IACf;AAEA,KAAC,EAAE,GAAGzF,GAAI,GAAGC,EAAE,IAAKuF,EAAQ,KAAK,KAAK,GAAG,KAAK,KAAK,GAAGxF,IAAK,GAAGC,IAAK,CAAC,IACnE,EAAE,GAAGS,GAAI,GAAGC,EAAE,IAAK6E,EAAQ,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG9E,IAAK,GAAGC,IAAK,CAAC,GACnE,EAAE,GAAGK,GAAI,GAAGH,EAAE,IAAK2E,EAAQ,KAAK,KAAK,GAAG,KAAK,KAAK,GAAGxE,IAAK,GAAGH,IAAK,CAAC,GACnE,EAAE,GAAGO,GAAI,GAAGF,EAAE,IAAKsE,EAAQ,KAAK,KAAK,GAAG,KAAK,KAAK,GAAGpE,IAAK,GAAGF,IAAK,CAAC,GACnE,EAAE,GAAGM,GAAI,GAAGF,EAAE,IAAKkE,EAAQ,KAAK,KAAK,GAAG,KAAK,KAAK,GAAGhE,IAAK,GAAGF,IAAK,CAAC,GACnE,EAAE,GAAG6B,GAAI,GAAGC,EAAE,IAAKoC,EAAQ,KAAK,KAAK,GAAG,KAAK,KAAK,GAAGrC,IAAK,GAAGC,IAAK,CAAC,GACnE,EAAE,GAAGC,GAAI,GAAGC,EAAE,IAAKkC,EAAQ,KAAK,KAAK,GAAG,KAAK,KAAK,GAAGnC,IAAK,GAAGC,IAAK,CAAC,GACnE,EAAE,GAAGC,GAAI,GAAGC,EAAE,IAAKgC,EAAQ,KAAK,KAAK,GAAG,KAAK,KAAK,GAAGjC,IAAK,GAAGC,IAAK,CAAC,GACpE,KAAK,IAAIxD,GAAIC,GAAIS,GAAIC,GAAIK,GAAIH,GAAIO,GAAIF,GAAIM,GAAIF,GAAI6B,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,CAAE;AAAA,EAC3E;AAAA,EACA,aAAa;AACT,IAAAvI,EAAM+H,GAAYC,CAAU;AAAA,EAChC;AAAA,EACA,UAAU;AACN,IAAAhI,EAAM,KAAK,MAAM,GACjB,KAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,EAC3D;AACJ;AACO,MAAM2K,WAAe1C,GAAO;AAAA,EAC/B,cAAc;AACV,UAAM,EAAE,GACR,KAAK,KAAKzD,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,EAAE,IAAI,GAC1B,KAAK,KAAKA,EAAU,EAAE,IAAI,GAC1B,KAAK,KAAKA,EAAU,EAAE,IAAI,GAC1B,KAAK,KAAKA,EAAU,EAAE,IAAI,GAC1B,KAAK,KAAKA,EAAU,EAAE,IAAI,GAC1B,KAAK,KAAKA,EAAU,EAAE,IAAI;AAAA,EAC9B;AACJ;AAkEY,MAACoG,KAAyB,gBAAAzI,EAAa,MAAM,IAAIuE,GAAM,CAAE,GAIxDmE,KAAyB,gBAAA1I,EAAa,MAAM,IAAI8F,GAAM,CAAE,GAExD6C,KAAyB,gBAAA3I,EAAa,MAAM,IAAIwI,GAAM,CAAE;","x_google_ignoreList":[0,1,2,3,4]}

package/dist/sha256-PD7NeEat.js ADDED Viewed

@@ -0,0 +1,6 @@
+import { s } from "./sha2-BnbuxHg9.js";
+const a = s;
+export {
+  a as sha256
+};
+//# sourceMappingURL=sha256-PD7NeEat.js.map

package/dist/sha256-PD7NeEat.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"sha256-PD7NeEat.js","sources":["../../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/esm/sha256.js"],"sourcesContent":["/**\n * SHA2-256 a.k.a. sha256. In JS, it is the fastest hash, even faster than Blake3.\n *\n * To break sha256 using birthday attack, attackers need to try 2^128 hashes.\n * BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.\n *\n * Check out [FIPS 180-4](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf).\n * @module\n * @deprecated\n */\nimport { SHA224 as SHA224n, sha224 as sha224n, SHA256 as SHA256n, sha256 as sha256n, } from \"./sha2.js\";\n/** @deprecated Use import from `noble/hashes/sha2` module */\nexport const SHA256 = SHA256n;\n/** @deprecated Use import from `noble/hashes/sha2` module */\nexport const sha256 = sha256n;\n/** @deprecated Use import from `noble/hashes/sha2` module */\nexport const SHA224 = SHA224n;\n/** @deprecated Use import from `noble/hashes/sha2` module */\nexport const sha224 = sha224n;\n//# sourceMappingURL=sha256.js.map"],"names":["sha256","sha256n"],"mappings":";AAcY,MAACA,IAASC;","x_google_ignoreList":[0]}