@invisi-labs/primitives 0.0.0-stage → 1.2.1

package/dist/chunk-Q3NNEKKR.js

@@ -0,0 +1,147 @@
+// src/fmd/fmd.ts
+import { blake2b as blake2b2 } from "@noble/hashes/blake2b";
+import { concatBytes, utf8ToBytes } from "@noble/hashes/utils";
+
+// src/fmd/decaf377.ts
+import { twistedEdwards } from "@noble/curves/abstract/edwards";
+import { Field, mod } from "@noble/curves/abstract/modular";
+import { blake2b } from "@noble/hashes/blake2b";
+var FQ = 8444461749428370424248824938781546531375899335154063827935233455917409239041n;
+var FR = 2111115437357092606062206234695386632838870926408408195193685246394721360383n;
+var field = Field(FQ, 253, true);
+var f = (n) => mod(n, FQ);
+var abs = (n) => (n & 1n) === 0n ? n : f(-n);
+function secureRandomBytes(length) {
+  const webCrypto = globalThis.crypto;
+  if (!webCrypto?.getRandomValues) throw new Error("WebCrypto secure randomness is unavailable");
+  return webCrypto.getRandomValues(new Uint8Array(length));
+}
+var curve = twistedEdwards({
+  a: FQ - 1n,
+  d: 3021n,
+  Fp: field,
+  n: FR,
+  h: 4n,
+  Gx: 4959445789346820725352484487855828915252512307947624787834978378872129235627n,
+  Gy: 6060471950081851567114691557659790004756535011754163002297540472747064943288n,
+  hash: blake2b,
+  randomBytes: (length = 32) => secureRandomBytes(length)
+});
+var generator = curve.ExtendedPoint.BASE;
+function readLE(bytes) {
+  let n = 0n;
+  for (let i = bytes.length - 1; i >= 0; i--) n = n << 8n | BigInt(bytes[i]);
+  return n;
+}
+function writeLE(n) {
+  const bytes = new Uint8Array(32);
+  for (let i = 0; i < 32; i++) {
+    bytes[i] = Number(n & 255n);
+    n >>= 8n;
+  }
+  return bytes;
+}
+function multiply(point, scalar) {
+  return scalar === 0n ? curve.ExtendedPoint.ZERO : point.multiply(scalar);
+}
+function inverseScalar(scalar) {
+  return Field(FR).inv(scalar);
+}
+function decodePoint(bytes) {
+  if (!(bytes instanceof Uint8Array) || bytes.length !== 32)
+    throw new Error("Invalid Decaf377 encoding length");
+  const s = readLE(bytes);
+  if (s >= FQ || (s & 1n) !== 0n || bytes[31] >> 5 !== 0)
+    throw new Error("Invalid Decaf377 encoding");
+  const ss = f(s * s);
+  const u1 = f(1n - ss);
+  const u2 = f(u1 * u1 - 4n * 3021n * ss);
+  const denominator = f(u2 * u1 * u1);
+  if (denominator === 0n) throw new Error("Invalid Decaf377 encoding");
+  let v;
+  try {
+    v = field.sqrt(field.inv(denominator));
+  } catch {
+    throw new Error("Invalid Decaf377 encoding");
+  }
+  const twoSU1 = f(2n * s * u1);
+  if ((f(twoSU1 * v) & 1n) !== 0n) v = f(-v);
+  const x = f(twoSU1 * v * v * u2);
+  const y = f((1n + ss) * v * u1);
+  return curve.ExtendedPoint.fromAffine({ x, y });
+}
+function encodePoint(point) {
+  const { ex: x, ez: z, et: t } = point;
+  if (x === 0n) return new Uint8Array(32);
+  const aMinusD = -3022n;
+  const u1 = f((x + t) * (x - t));
+  const denominator = f(u1 * aMinusD * x * x);
+  const v = field.sqrt(field.inv(denominator));
+  const u2 = abs(f(v * u1));
+  const u3 = f(u2 * z - t);
+  return writeLE(abs(f(aMinusD * v * u3 * x)));
+}
+function isIdentity(point) {
+  return point.ex === 0n;
+}
+
+// src/fmd/fmd.ts
+var PRECISION = 24;
+function requireBytes(value, length, name) {
+  if (!(value instanceof Uint8Array) || value.length !== length)
+    throw new TypeError(`${name} must be a ${length}-byte Uint8Array`);
+}
+function detectionScalar(key) {
+  requireBytes(key, 32, "Detection key");
+  const scalar = readLE(key);
+  if (scalar === 0n || scalar >= FR)
+    throw new Error("Detection key must be a canonical nonzero Decaf377 scalar");
+  return scalar;
+}
+function hash(domain, ...parts) {
+  const personalization = new Uint8Array(16);
+  personalization.set(utf8ToBytes(`decaf377-fmd.${domain}`));
+  return blake2b2(concatBytes(...parts), { dkLen: 64, personalization });
+}
+var hashScalar = (domain, ...parts) => readLE(hash(domain, ...parts)) % FR;
+var childOffset = (clueKey, index) => hashScalar("hkd", clueKey, Uint8Array.of(index));
+var hashBit = (p, shared, q) => hash("bit", p, shared, q)[0] & 1;
+function deriveClueKey(detectionKey) {
+  return encodePoint(multiply(generator, detectionScalar(detectionKey)));
+}
+function validateClueKey(clueKey) {
+  requireBytes(clueKey, 32, "Clue key");
+  if (isIdentity(decodePoint(clueKey))) throw new Error("Clue key must not be the identity");
+}
+function createClue(clueKey) {
+  validateClueKey(clueKey);
+  return createClueFromSeed(clueKey, secureRandomBytes(32));
+}
+function createClueFromSeed(clueKey, seed32) {
+  validateClueKey(clueKey);
+  requireBytes(seed32, 32, "Clue seed");
+  const root = decodePoint(clueKey);
+  const r = hashScalar("rdv", clueKey, seed32);
+  const z = hashScalar("zdv", clueKey, seed32);
+  if (r === 0n) throw new Error("Degenerate clue seed");
+  const p = encodePoint(multiply(generator, r));
+  const q = encodePoint(multiply(generator, z));
+  const ciphertext = new Uint8Array(3);
+  for (let i = 0; i < PRECISION; i++) {
+    const child = root.add(multiply(generator, childOffset(clueKey, i)));
+    const shared = encodePoint(multiply(child, r));
+    ciphertext[i >> 3] = ciphertext[i >> 3] | (hashBit(p, shared, q) ^ 1) << (i & 7);
+  }
+  const m = hashScalar("sca", p, Uint8Array.of(PRECISION), ciphertext);
+  const y = (z - m + FR) * inverseScalar(r) % FR;
+  if (y === 0n) throw new Error("Degenerate clue seed");
+  return concatBytes(p, writeLE(y), Uint8Array.of(PRECISION), ciphertext);
+}
+
+export {
+  deriveClueKey,
+  validateClueKey,
+  createClue,
+  createClueFromSeed
+};
+//# sourceMappingURL=chunk-Q3NNEKKR.js.map

package/dist/chunk-Q3NNEKKR.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/fmd/fmd.ts","../src/fmd/decaf377.ts"],"sourcesContent":["/**\n * Frozen S-FMD profile: decaf377-fmd 2.1.1, 24-bit clues (68 bytes).\n * Only FMD detection keys belong here; these are not transaction ownership keys.\n *\n * SECURITY: the noble Edwards arithmetic and this exact Decaf codec port use\n * JavaScript BigInt. They do not provide constant-time execution or reliable\n * secret erasure. This new composition has not received an independent audit.\n */\nimport { blake2b } from \"@noble/hashes/blake2b\";\nimport { concatBytes, utf8ToBytes } from \"@noble/hashes/utils\";\nimport {\n    FR,\n    decodePoint,\n    encodePoint,\n    generator,\n    inverseScalar,\n    isIdentity,\n    multiply,\n    readLE,\n    secureRandomBytes,\n    writeLE,\n} from \"./decaf377.js\";\n\nconst PRECISION = 24;\nfunction requireBytes(value: Uint8Array, length: number, name: string): void {\n    if (!(value instanceof Uint8Array) || value.length !== length)\n        throw new TypeError(`${name} must be a ${length}-byte Uint8Array`);\n}\nfunction detectionScalar(key: Uint8Array): bigint {\n    requireBytes(key, 32, \"Detection key\");\n    const scalar = readLE(key);\n    if (scalar === 0n || scalar >= FR)\n        throw new Error(\"Detection key must be a canonical nonzero Decaf377 scalar\");\n    return scalar;\n}\nfunction hash(domain: string, ...parts: Uint8Array[]): Uint8Array {\n    // Rust blake2b_simd defaults to 64 output bytes and zero-pads personalization.\n    const personalization = new Uint8Array(16);\n    personalization.set(utf8ToBytes(`decaf377-fmd.${domain}`));\n    return blake2b(concatBytes(...parts), { dkLen: 64, personalization });\n}\nconst hashScalar = (domain: string, ...parts: Uint8Array[]) => readLE(hash(domain, ...parts)) % FR;\nconst childOffset = (clueKey: Uint8Array, index: number) =>\n    hashScalar(\"hkd\", clueKey, Uint8Array.of(index));\nconst hashBit = (p: Uint8Array, shared: Uint8Array, q: Uint8Array) =>\n    hash(\"bit\", p, shared, q)[0]! & 1;\n\n/** Derive the canonical 32-byte Decaf377 clue key from a nonzero FMD scalar. */\nexport function deriveClueKey(detectionKey: Uint8Array): Uint8Array {\n    return encodePoint(multiply(generator, detectionScalar(detectionKey)));\n}\n/** Reject malformed, noncanonical, or identity clue keys. */\nexport function validateClueKey(clueKey: Uint8Array): void {\n    requireBytes(clueKey, 32, \"Clue key\");\n    if (isIdentity(decodePoint(clueKey))) throw new Error(\"Clue key must not be the identity\");\n}\n/** Create a fixed 24-bit clue using a fresh WebCrypto random seed. */\nexport function createClue(clueKey: Uint8Array): Uint8Array {\n    validateClueKey(clueKey);\n    return createClueFromSeed(clueKey, secureRandomBytes(32));\n}\n/**\n * Deterministic interoperability/backend entry point. Seed must be independently\n * generated with a CSPRNG for every production clue; never reuse a fixed seed.\n */\nexport function createClueFromSeed(clueKey: Uint8Array, seed32: Uint8Array): Uint8Array {\n    validateClueKey(clueKey);\n    requireBytes(seed32, 32, \"Clue seed\");\n    const root = decodePoint(clueKey);\n    const r = hashScalar(\"rdv\", clueKey, seed32);\n    const z = hashScalar(\"zdv\", clueKey, seed32);\n    if (r === 0n) throw new Error(\"Degenerate clue seed\");\n    const p = encodePoint(multiply(generator, r));\n    const q = encodePoint(multiply(generator, z));\n    const ciphertext = new Uint8Array(3);\n    for (let i = 0; i < PRECISION; i++) {\n        const child = root.add(multiply(generator, childOffset(clueKey, i)));\n        const shared = encodePoint(multiply(child, r));\n        ciphertext[i >> 3] = ciphertext[i >> 3]! | ((hashBit(p, shared, q) ^ 1) << (i & 7));\n    }\n    const m = hashScalar(\"sca\", p, Uint8Array.of(PRECISION), ciphertext);\n    const y = ((z - m + FR) * inverseScalar(r)) % FR;\n    if (y === 0n) throw new Error(\"Degenerate clue seed\");\n    return concatBytes(p, writeLE(y), Uint8Array.of(PRECISION), ciphertext);\n}\n\n/** Check a full-precision clue locally without exporting the detection key. */\nexport function detectClue(detectionKey: Uint8Array, clue: Uint8Array): boolean {\n    const scalar = detectionScalar(detectionKey);\n    requireBytes(clue, 68, \"Clue\");\n    if (clue[64] !== PRECISION) return false;\n    const p = clue.slice(0, 32),\n        y = readLE(clue.slice(32, 64));\n    if (y === 0n || y >= FR) return false;\n    let point;\n    try {\n        point = decodePoint(p);\n    } catch {\n        return false;\n    }\n    if (isIdentity(point)) return false;\n    const ciphertext = clue.slice(65);\n    const m = hashScalar(\"sca\", p, Uint8Array.of(PRECISION), ciphertext);\n    const q = encodePoint(multiply(generator, m).add(multiply(point, y)));\n    const clueKey = deriveClueKey(detectionKey);\n    for (let i = 0; i < PRECISION; i++) {\n        const child = (scalar + childOffset(clueKey, i)) % FR;\n        const bit = hashBit(p, encodePoint(multiply(point, child)), q);\n        if ((bit ^ ((ciphertext[i >> 3]! >> (i & 7)) & 1)) !== 1) return false;\n    }\n    return true;\n}\n","/**\n * Internal Decaf377 codec, ported from decaf377 0.10.1 min_curve/element.rs.\n * Edwards group/field arithmetic is supplied by @noble/curves 1.9.1. The\n * Montgomery constants below are converted to ordinary field integers.\n * This JavaScript BigInt backend is NOT constant-time and has not been audited.\n */\nimport { twistedEdwards, type ExtPointType } from \"@noble/curves/abstract/edwards\";\nimport { Field, mod } from \"@noble/curves/abstract/modular\";\nimport { blake2b } from \"@noble/hashes/blake2b\";\n\nexport const FQ = 8444461749428370424248824938781546531375899335154063827935233455917409239041n;\nexport const FR = 2111115437357092606062206234695386632838870926408408195193685246394721360383n;\nconst field = Field(FQ, 253, true);\nconst f = (n: bigint) => mod(n, FQ);\nconst abs = (n: bigint) => ((n & 1n) === 0n ? n : f(-n));\n\nexport function secureRandomBytes(length: number): Uint8Array {\n    const webCrypto = (\n        globalThis as { crypto?: { getRandomValues(array: Uint8Array): Uint8Array } }\n    ).crypto;\n    if (!webCrypto?.getRandomValues) throw new Error(\"WebCrypto secure randomness is unavailable\");\n    return webCrypto.getRandomValues(new Uint8Array(length));\n}\n\nconst curve = twistedEdwards({\n    a: FQ - 1n,\n    d: 3021n,\n    Fp: field,\n    n: FR,\n    h: 4n,\n    Gx: 4959445789346820725352484487855828915252512307947624787834978378872129235627n,\n    Gy: 6060471950081851567114691557659790004756535011754163002297540472747064943288n,\n    hash: blake2b,\n    randomBytes: (length = 32) => secureRandomBytes(length),\n});\nexport type DecafPoint = ExtPointType;\nexport const generator: DecafPoint = curve.ExtendedPoint.BASE;\n\nexport function readLE(bytes: Uint8Array): bigint {\n    let n = 0n;\n    for (let i = bytes.length - 1; i >= 0; i--) n = (n << 8n) | BigInt(bytes[i]!);\n    return n;\n}\nexport function writeLE(n: bigint): Uint8Array {\n    const bytes = new Uint8Array(32);\n    for (let i = 0; i < 32; i++) {\n        bytes[i] = Number(n & 255n);\n        n >>= 8n;\n    }\n    return bytes;\n}\nexport function multiply(point: DecafPoint, scalar: bigint): DecafPoint {\n    return scalar === 0n ? curve.ExtendedPoint.ZERO : point.multiply(scalar);\n}\nexport function inverseScalar(scalar: bigint): bigint {\n    // Noble's field inversion uses Euclid. Neither this nor BigInt is constant-time.\n    return Field(FR).inv(scalar);\n}\n\n/** Canonical Decaf decoding, including the low-bit sign convention. */\nexport function decodePoint(bytes: Uint8Array): DecafPoint {\n    if (!(bytes instanceof Uint8Array) || bytes.length !== 32)\n        throw new Error(\"Invalid Decaf377 encoding length\");\n    const s = readLE(bytes);\n    if (s >= FQ || (s & 1n) !== 0n || bytes[31]! >> 5 !== 0)\n        throw new Error(\"Invalid Decaf377 encoding\");\n    const ss = f(s * s);\n    const u1 = f(1n - ss);\n    const u2 = f(u1 * u1 - 4n * 3021n * ss);\n    const denominator = f(u2 * u1 * u1);\n    // This is the square branch of Rust sqrt_ratio_zeta(1, denominator).\n    // Decompression rejects the nonsquare branch; root sign is fixed below.\n    if (denominator === 0n) throw new Error(\"Invalid Decaf377 encoding\");\n    let v: bigint;\n    try {\n        v = field.sqrt(field.inv(denominator));\n    } catch {\n        throw new Error(\"Invalid Decaf377 encoding\");\n    }\n    const twoSU1 = f(2n * s * u1);\n    if ((f(twoSU1 * v) & 1n) !== 0n) v = f(-v);\n    const x = f(twoSU1 * v * v * u2);\n    const y = f((1n + ss) * v * u1);\n    return curve.ExtendedPoint.fromAffine({ x, y });\n}\nexport function encodePoint(point: DecafPoint): Uint8Array {\n    const { ex: x, ez: z, et: t } = point;\n    if (x === 0n) return new Uint8Array(32);\n    const aMinusD = -3022n;\n    const u1 = f((x + t) * (x - t));\n    const denominator = f(u1 * aMinusD * x * x);\n    const v = field.sqrt(field.inv(denominator));\n    const u2 = abs(f(v * u1));\n    const u3 = f(u2 * z - t);\n    return writeLE(abs(f(aMinusD * v * u3 * x)));\n}\nexport function isIdentity(point: DecafPoint): boolean {\n    return point.ex === 0n;\n}\n"],"mappings":";AAQA,SAAS,WAAAA,gBAAe;AACxB,SAAS,aAAa,mBAAmB;;;ACHzC,SAAS,sBAAyC;AAClD,SAAS,OAAO,WAAW;AAC3B,SAAS,eAAe;AAEjB,IAAM,KAAK;AACX,IAAM,KAAK;AAClB,IAAM,QAAQ,MAAM,IAAI,KAAK,IAAI;AACjC,IAAM,IAAI,CAAC,MAAc,IAAI,GAAG,EAAE;AAClC,IAAM,MAAM,CAAC,OAAgB,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC,CAAC;AAE/C,SAAS,kBAAkB,QAA4B;AAC1D,QAAM,YACF,WACF;AACF,MAAI,CAAC,WAAW,gBAAiB,OAAM,IAAI,MAAM,4CAA4C;AAC7F,SAAO,UAAU,gBAAgB,IAAI,WAAW,MAAM,CAAC;AAC3D;AAEA,IAAM,QAAQ,eAAe;AAAA,EACzB,GAAG,KAAK;AAAA,EACR,GAAG;AAAA,EACH,IAAI;AAAA,EACJ,GAAG;AAAA,EACH,GAAG;AAAA,EACH,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,aAAa,CAAC,SAAS,OAAO,kBAAkB,MAAM;AAC1D,CAAC;AAEM,IAAM,YAAwB,MAAM,cAAc;AAElD,SAAS,OAAO,OAA2B;AAC9C,MAAI,IAAI;AACR,WAAS,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,IAAK,KAAK,KAAK,KAAM,OAAO,MAAM,CAAC,CAAE;AAC5E,SAAO;AACX;AACO,SAAS,QAAQ,GAAuB;AAC3C,QAAM,QAAQ,IAAI,WAAW,EAAE;AAC/B,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AACzB,UAAM,CAAC,IAAI,OAAO,IAAI,IAAI;AAC1B,UAAM;AAAA,EACV;AACA,SAAO;AACX;AACO,SAAS,SAAS,OAAmB,QAA4B;AACpE,SAAO,WAAW,KAAK,MAAM,cAAc,OAAO,MAAM,SAAS,MAAM;AAC3E;AACO,SAAS,cAAc,QAAwB;AAElD,SAAO,MAAM,EAAE,EAAE,IAAI,MAAM;AAC/B;AAGO,SAAS,YAAY,OAA+B;AACvD,MAAI,EAAE,iBAAiB,eAAe,MAAM,WAAW;AACnD,UAAM,IAAI,MAAM,kCAAkC;AACtD,QAAM,IAAI,OAAO,KAAK;AACtB,MAAI,KAAK,OAAO,IAAI,QAAQ,MAAM,MAAM,EAAE,KAAM,MAAM;AAClD,UAAM,IAAI,MAAM,2BAA2B;AAC/C,QAAM,KAAK,EAAE,IAAI,CAAC;AAClB,QAAM,KAAK,EAAE,KAAK,EAAE;AACpB,QAAM,KAAK,EAAE,KAAK,KAAK,KAAK,QAAQ,EAAE;AACtC,QAAM,cAAc,EAAE,KAAK,KAAK,EAAE;AAGlC,MAAI,gBAAgB,GAAI,OAAM,IAAI,MAAM,2BAA2B;AACnE,MAAI;AACJ,MAAI;AACA,QAAI,MAAM,KAAK,MAAM,IAAI,WAAW,CAAC;AAAA,EACzC,QAAQ;AACJ,UAAM,IAAI,MAAM,2BAA2B;AAAA,EAC/C;AACA,QAAM,SAAS,EAAE,KAAK,IAAI,EAAE;AAC5B,OAAK,EAAE,SAAS,CAAC,IAAI,QAAQ,GAAI,KAAI,EAAE,CAAC,CAAC;AACzC,QAAM,IAAI,EAAE,SAAS,IAAI,IAAI,EAAE;AAC/B,QAAM,IAAI,GAAG,KAAK,MAAM,IAAI,EAAE;AAC9B,SAAO,MAAM,cAAc,WAAW,EAAE,GAAG,EAAE,CAAC;AAClD;AACO,SAAS,YAAY,OAA+B;AACvD,QAAM,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,EAAE,IAAI;AAChC,MAAI,MAAM,GAAI,QAAO,IAAI,WAAW,EAAE;AACtC,QAAM,UAAU,CAAC;AACjB,QAAM,KAAK,GAAG,IAAI,MAAM,IAAI,EAAE;AAC9B,QAAM,cAAc,EAAE,KAAK,UAAU,IAAI,CAAC;AAC1C,QAAM,IAAI,MAAM,KAAK,MAAM,IAAI,WAAW,CAAC;AAC3C,QAAM,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC;AACxB,QAAM,KAAK,EAAE,KAAK,IAAI,CAAC;AACvB,SAAO,QAAQ,IAAI,EAAE,UAAU,IAAI,KAAK,CAAC,CAAC,CAAC;AAC/C;AACO,SAAS,WAAW,OAA4B;AACnD,SAAO,MAAM,OAAO;AACxB;;;AD3EA,IAAM,YAAY;AAClB,SAAS,aAAa,OAAmB,QAAgB,MAAoB;AACzE,MAAI,EAAE,iBAAiB,eAAe,MAAM,WAAW;AACnD,UAAM,IAAI,UAAU,GAAG,IAAI,cAAc,MAAM,kBAAkB;AACzE;AACA,SAAS,gBAAgB,KAAyB;AAC9C,eAAa,KAAK,IAAI,eAAe;AACrC,QAAM,SAAS,OAAO,GAAG;AACzB,MAAI,WAAW,MAAM,UAAU;AAC3B,UAAM,IAAI,MAAM,2DAA2D;AAC/E,SAAO;AACX;AACA,SAAS,KAAK,WAAmB,OAAiC;AAE9D,QAAM,kBAAkB,IAAI,WAAW,EAAE;AACzC,kBAAgB,IAAI,YAAY,gBAAgB,MAAM,EAAE,CAAC;AACzD,SAAOC,SAAQ,YAAY,GAAG,KAAK,GAAG,EAAE,OAAO,IAAI,gBAAgB,CAAC;AACxE;AACA,IAAM,aAAa,CAAC,WAAmB,UAAwB,OAAO,KAAK,QAAQ,GAAG,KAAK,CAAC,IAAI;AAChG,IAAM,cAAc,CAAC,SAAqB,UACtC,WAAW,OAAO,SAAS,WAAW,GAAG,KAAK,CAAC;AACnD,IAAM,UAAU,CAAC,GAAe,QAAoB,MAChD,KAAK,OAAO,GAAG,QAAQ,CAAC,EAAE,CAAC,IAAK;AAG7B,SAAS,cAAc,cAAsC;AAChE,SAAO,YAAY,SAAS,WAAW,gBAAgB,YAAY,CAAC,CAAC;AACzE;AAEO,SAAS,gBAAgB,SAA2B;AACvD,eAAa,SAAS,IAAI,UAAU;AACpC,MAAI,WAAW,YAAY,OAAO,CAAC,EAAG,OAAM,IAAI,MAAM,mCAAmC;AAC7F;AAEO,SAAS,WAAW,SAAiC;AACxD,kBAAgB,OAAO;AACvB,SAAO,mBAAmB,SAAS,kBAAkB,EAAE,CAAC;AAC5D;AAKO,SAAS,mBAAmB,SAAqB,QAAgC;AACpF,kBAAgB,OAAO;AACvB,eAAa,QAAQ,IAAI,WAAW;AACpC,QAAM,OAAO,YAAY,OAAO;AAChC,QAAM,IAAI,WAAW,OAAO,SAAS,MAAM;AAC3C,QAAM,IAAI,WAAW,OAAO,SAAS,MAAM;AAC3C,MAAI,MAAM,GAAI,OAAM,IAAI,MAAM,sBAAsB;AACpD,QAAM,IAAI,YAAY,SAAS,WAAW,CAAC,CAAC;AAC5C,QAAM,IAAI,YAAY,SAAS,WAAW,CAAC,CAAC;AAC5C,QAAM,aAAa,IAAI,WAAW,CAAC;AACnC,WAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAChC,UAAM,QAAQ,KAAK,IAAI,SAAS,WAAW,YAAY,SAAS,CAAC,CAAC,CAAC;AACnE,UAAM,SAAS,YAAY,SAAS,OAAO,CAAC,CAAC;AAC7C,eAAW,KAAK,CAAC,IAAI,WAAW,KAAK,CAAC,KAAO,QAAQ,GAAG,QAAQ,CAAC,IAAI,OAAO,IAAI;AAAA,EACpF;AACA,QAAM,IAAI,WAAW,OAAO,GAAG,WAAW,GAAG,SAAS,GAAG,UAAU;AACnE,QAAM,KAAM,IAAI,IAAI,MAAM,cAAc,CAAC,IAAK;AAC9C,MAAI,MAAM,GAAI,OAAM,IAAI,MAAM,sBAAsB;AACpD,SAAO,YAAY,GAAG,QAAQ,CAAC,GAAG,WAAW,GAAG,SAAS,GAAG,UAAU;AAC1E;","names":["blake2b","blake2b"]}