@xylabs/aries 0.1.1 → 0.1.7

package/dist/actions/hash/algorithms/index.mjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../../../src/actions/hash/algorithms/blockhash.ts","../../../../src/actions/hash/lib/hamming.ts","../../../../src/actions/hash/lib/runBinary.ts","../../../../src/actions/hash/lib/which.ts","../../../../src/actions/hash/lib/withTempfile.ts","../../../../src/actions/hash/algorithms/chromaprint.ts","../../../../src/actions/hash/algorithms/dhash.ts","../../../../src/actions/hash/algorithms/nilsimsa.ts","../../../../src/actions/hash/algorithms/pdq.ts","../../../../src/actions/hash/algorithms/phash.ts","../../../../src/actions/hash/algorithms/sha256.ts","../../../../src/actions/hash/lib/levenshtein.ts","../../../../src/actions/hash/algorithms/ssdeep.ts","../../../../src/actions/hash/algorithms/tlsh.ts","../../../../src/actions/hash/algorithms/videoFrames.ts","../../../../src/actions/hash/algorithms/xyo.ts","../../../../src/actions/hash/algorithms/index.ts"],"sourcesContent":["import imghash from 'imghash'\n\nimport { hammingHex } from '../lib/hamming.ts'\nimport type { Algorithm } from './types.ts'\n\nconst { hash: imghashFn } = imghash\n\n/**\n * blockhash via the imghash package — defaults to 8×8 = 64-bit for cross-comparability\n * with phash/dhash. Imghash accepts both filepath and Buffer natively.\n */\nexport const blockhashAlgorithm: Algorithm = {\n  name: 'blockhash',\n  family: 'perceptual-image',\n  inputType: 'image',\n  async hash(input) {\n    if (input.path !== undefined) {\n      return await imghashFn(input.path, 8, 'hex')\n    }\n    if (input.bytes !== undefined) {\n      return await imghashFn(input.bytes, 8, 'hex')\n    }\n    throw new Error('blockhash requires bytes or a path.')\n  },\n  async compare(a, b) {\n    const dist = hammingHex(a, b)\n    const bits = (a.length / 2) * 8\n    return {\n      distance: dist, similarity: 1 - dist / bits, metric: `hamming-${bits}`,\n    }\n  },\n}\n","/**\n * Population count for an 8-bit value (number of set bits).\n */\nfunction popcount8(byte: number): number {\n  let count = 0\n  let value = byte & 0xff\n  while (value !== 0) {\n    count += value & 1\n    value >>>= 1\n  }\n  return count\n}\n\n/**\n * Hamming distance between two equal-length lowercase-hex strings.\n * Throws when the lengths differ.\n */\nexport function hammingHex(a: string, b: string): number {\n  if (a.length !== b.length) {\n    throw new Error(`Hash length mismatch: ${a.length} vs ${b.length}`)\n  }\n  if (a.length % 2 !== 0) {\n    throw new Error(`Hash hex length must be even, got ${a.length}`)\n  }\n  let dist = 0\n  for (let i = 0; i < a.length; i += 2) {\n    const xa = Number.parseInt(a.slice(i, i + 2), 16)\n    const xb = Number.parseInt(b.slice(i, i + 2), 16)\n    if (Number.isNaN(xa) || Number.isNaN(xb)) {\n      throw new TypeError(`Invalid hex at position ${i}: '${a.slice(i, i + 2)}' / '${b.slice(i, i + 2)}'`)\n    }\n    dist += popcount8(xa ^ xb)\n  }\n  return dist\n}\n\n/**\n * Bit-length of an even-length hex string.\n */\nexport function bitLengthHex(hex: string): number {\n  return (hex.length / 2) * 8\n}\n\n/**\n * Population count for a 32-bit unsigned value (number of set bits).\n * Uses the parallel-prefix bit trick.\n */\nexport function popcount32(value: number): number {\n  let v = Math.trunc(value)\n  v = v - ((v >>> 1) & 0x55_55_55_55)\n  v = (v & 0x33_33_33_33) + ((v >>> 2) & 0x33_33_33_33)\n  v = (v + (v >>> 4)) & 0x0f_0f_0f_0f\n  return ((v * 0x01_01_01_01) >>> 24) & 0xff\n}\n","import { spawn } from 'node:child_process'\n\nexport interface RunBinaryOptions {\n  binary: string\n  args?: readonly string[]\n  /** When provided, written to the child's stdin and stdin is closed. */\n  stdin?: Buffer\n  /** When true, the child's stdout is captured as a Buffer. Otherwise as utf8. */\n  binaryOutput?: boolean\n  /** Cap stdout capture at this many bytes. Default 64 MiB. */\n  maxBytes?: number\n}\n\nexport interface RunBinaryResult {\n  stdout: Buffer\n  stderr: string\n  exitCode: number\n}\n\n/**\n * Spawn a binary, optionally write to its stdin, and capture stdout/stderr.\n * Throws if the child exits non-zero.\n */\nexport async function runBinary(options: RunBinaryOptions): Promise<RunBinaryResult> {\n  const maxBytes = options.maxBytes ?? 64 * 1024 * 1024\n  return await new Promise((resolve, reject) => {\n    const child = spawn(options.binary, [...(options.args ?? [])], { stdio: ['pipe', 'pipe', 'pipe'] })\n\n    const stdoutChunks: Buffer[] = []\n    let stdoutBytes = 0\n    let stderr = ''\n    let killedForOverflow = false\n\n    child.stdout.on('data', (chunk: Buffer) => {\n      stdoutBytes += chunk.length\n      if (stdoutBytes > maxBytes) {\n        if (!killedForOverflow) {\n          killedForOverflow = true\n          child.kill('SIGKILL')\n        }\n        return\n      }\n      stdoutChunks.push(chunk)\n    })\n    child.stderr.on('data', (chunk: Buffer) => {\n      stderr += chunk.toString('utf8')\n    })\n\n    child.on('error', err => reject(err))\n    child.on('close', (code) => {\n      if (killedForOverflow) {\n        reject(new Error(`${options.binary} stdout exceeded ${maxBytes} bytes`))\n        return\n      }\n      const exitCode = code ?? -1\n      const stdout = Buffer.concat(stdoutChunks)\n      if (exitCode !== 0) {\n        const tail = stderr.trim().split(/\\r?\\n/).slice(-3).join('\\n')\n        reject(new Error(`${options.binary} exited ${exitCode}${tail.length > 0 ? `: ${tail}` : ''}`))\n        return\n      }\n      resolve({\n        stdout, stderr, exitCode,\n      })\n    })\n\n    if (options.stdin === undefined) {\n      child.stdin.end()\n    } else {\n      child.stdin.end(options.stdin)\n    }\n  })\n}\n","import { spawn } from 'node:child_process'\n\nimport type { RequiredBinary } from '../algorithms/types.ts'\n\n/**\n * Resolve a binary name to its absolute path on the user's PATH.\n * Returns null if not found.\n */\nexport async function which(binary: string): Promise<string | null> {\n  return await new Promise((resolve) => {\n    const cmd = process.platform === 'win32' ? 'where' : 'command'\n    const args = process.platform === 'win32' ? [binary] : ['-v', binary]\n    const child = spawn(cmd, args, { shell: process.platform !== 'win32' })\n\n    let stdout = ''\n    child.stdout.on('data', (chunk: Buffer) => {\n      stdout += chunk.toString('utf8')\n    })\n    child.on('error', () => resolve(null))\n    child.on('close', (code) => {\n      if (code === 0) {\n        const path = stdout.split(/\\r?\\n/).find(line => line.trim().length > 0)?.trim() ?? null\n        resolve(path)\n      } else {\n        resolve(null)\n      }\n    })\n  })\n}\n\n/**\n * Throw a clearly-actionable error when a required binary is missing.\n */\nexport async function requireBinary(req: RequiredBinary): Promise<string> {\n  const path = await which(req.binary)\n  if (path !== null) return path\n  const lines = [`${req.binary} binary not found on PATH. Install with:`]\n  if (req.install.brew !== undefined) lines.push(`  macOS:   brew install ${req.install.brew}`)\n  if (req.install.apt !== undefined) lines.push(`  Debian:  apt install ${req.install.apt}`)\n  if (req.install.choco !== undefined) lines.push(`  Windows: choco install ${req.install.choco}`)\n  throw new Error(lines.join('\\n'))\n}\n","import { randomBytes } from 'node:crypto'\nimport { rm, writeFile } from 'node:fs/promises'\nimport OS from 'node:os'\nimport PATH from 'node:path'\n\n/**\n * Write a buffer to a tempfile, run `fn` with its path, and unlink afterwards.\n * `extension` is included in the filename when provided (no leading dot).\n */\nexport async function withTempfile<T>(\n  bytes: Buffer,\n  extension: string | undefined,\n  fn: (path: string) => Promise<T>,\n): Promise<T> {\n  const ext = extension !== undefined && extension.length > 0 ? `.${extension}` : ''\n  const path = PATH.join(OS.tmpdir(), `aries-hash-${randomBytes(8).toString('hex')}${ext}`)\n  await writeFile(path, bytes)\n  try {\n    return await fn(path)\n  } finally {\n    await rm(path, { force: true })\n  }\n}\n","import { popcount32 } from '../lib/hamming.ts'\nimport { runBinary } from '../lib/runBinary.ts'\nimport { requireBinary } from '../lib/which.ts'\nimport { withTempfile } from '../lib/withTempfile.ts'\nimport type { Algorithm, RequiredBinary } from './types.ts'\n\nconst FPCALC_BIN: RequiredBinary = {\n  binary: 'fpcalc',\n  install: {\n    brew: 'chromaprint',\n    apt: 'libchromaprint-tools',\n    choco: 'chromaprint',\n  },\n}\n\ninterface ChromaprintFingerprint {\n  algorithm: 'chromaprint'\n  duration: number\n  fingerprint: number[]\n}\n\ninterface FpcalcJsonRaw {\n  duration: number\n  fingerprint: number[]\n}\n\nasync function runFpcalc(path: string): Promise<ChromaprintFingerprint> {\n  await requireBinary(FPCALC_BIN)\n  // -raw: output the fingerprint as a comma-separated list of 32-bit integers.\n  // -json: combine with -raw to get JSON whose `fingerprint` is an int[].\n  const { stdout } = await runBinary({ binary: 'fpcalc', args: ['-raw', '-json', path] })\n  const parsed = JSON.parse(stdout.toString('utf8')) as FpcalcJsonRaw\n  if (typeof parsed.duration !== 'number' || !Array.isArray(parsed.fingerprint)) {\n    throw new TypeError('fpcalc returned unexpected JSON shape.')\n  }\n  return {\n    algorithm: 'chromaprint',\n    duration: parsed.duration,\n    fingerprint: parsed.fingerprint,\n  }\n}\n\nfunction parseChromaprintHash(raw: string): ChromaprintFingerprint {\n  let parsed: unknown\n  try {\n    parsed = JSON.parse(raw)\n  } catch {\n    throw new Error('chromaprint hash must be a JSON document produced by `aries hash --algorithm chromaprint`.')\n  }\n  const obj = parsed as Partial<ChromaprintFingerprint>\n  if (obj.algorithm !== 'chromaprint' || typeof obj.duration !== 'number' || !Array.isArray(obj.fingerprint)) {\n    throw new Error('chromaprint hash JSON missing required fields (algorithm, duration, fingerprint).')\n  }\n  return obj as ChromaprintFingerprint\n}\n\n/**\n * Compare two chromaprint fingerprints by windowed Hamming distance over their 32-bit\n * frame integers. We slide one fingerprint over the other to find the best alignment\n * offset; bits matching across the overlap → similarity, lower is better.\n */\nfunction compareFingerprints(a: number[], b: number[]): { similarity: number; distance: number; offset: number } {\n  if (a.length === 0 || b.length === 0) {\n    return {\n      similarity: 0, distance: Number.NaN, offset: 0,\n    }\n  }\n\n  const span = Math.min(a.length, b.length)\n  const maxOffset = Math.max(a.length, b.length) - span\n  let best = {\n    similarity: 0,\n    distance: 32 * span,\n    offset: 0,\n  }\n\n  for (let offset = -maxOffset; offset <= maxOffset; offset++) {\n    const aStart = Math.max(0, -offset)\n    const bStart = Math.max(0, offset)\n    const overlap = Math.min(a.length - aStart, b.length - bStart)\n    if (overlap < Math.max(8, span / 4)) continue\n    let bits = 0\n    for (let i = 0; i < overlap; i++) {\n      bits += popcount32(a[aStart + i] ^ b[bStart + i])\n    }\n    const similarity = 1 - bits / (32 * overlap)\n    if (similarity > best.similarity) {\n      best = {\n        similarity, distance: bits, offset,\n      }\n    }\n  }\n  return best\n}\n\nexport const chromaprintAlgorithm: Algorithm = {\n  name: 'chromaprint',\n  family: 'audio',\n  inputType: 'audio',\n  requires: [FPCALC_BIN],\n  async hash(input) {\n    const fp = input.path === undefined\n      ? input.bytes === undefined\n        ? null\n        : await withTempfile(input.bytes, 'audio.bin', async path => await runFpcalc(path))\n      : await runFpcalc(input.path)\n    if (fp === null) {\n      throw new Error('chromaprint requires bytes or a path.')\n    }\n    return JSON.stringify(fp)\n  },\n  async compare(a, b) {\n    const fpA = parseChromaprintHash(a)\n    const fpB = parseChromaprintHash(b)\n    const result = compareFingerprints(fpA.fingerprint, fpB.fingerprint)\n    return {\n      similarity: result.similarity,\n      distance: Number.isFinite(result.distance) ? result.distance : undefined,\n      metric: 'chromaprint-windowed-hamming',\n    }\n  },\n}\n","import { readFile } from 'node:fs/promises'\n\nimport sharp from 'sharp'\n\nimport { hammingHex } from '../lib/hamming.ts'\nimport type { Algorithm } from './types.ts'\n\n/**\n * dHash (difference hash): resize to 9×8 grayscale, then for each row produce 8 bits\n * representing whether pixel[i] > pixel[i+1]. 8 rows × 8 bits = 64 bits → 16 hex chars.\n */\nexport const dhashAlgorithm: Algorithm = {\n  name: 'dhash',\n  family: 'perceptual-image',\n  inputType: 'image',\n  async hash(input) {\n    const source = input.bytes ?? (input.path === undefined ? undefined : await readFile(input.path))\n    if (source === undefined) {\n      throw new Error('dhash requires bytes or a path.')\n    }\n    const raw = await sharp(source)\n      .resize(9, 8, { fit: 'fill' })\n      .grayscale()\n      .raw()\n      .toBuffer()\n    if (raw.length !== 9 * 8) {\n      throw new Error(`dhash unexpected raw buffer length ${raw.length}`)\n    }\n    let bits = ''\n    for (let row = 0; row < 8; row++) {\n      for (let col = 0; col < 8; col++) {\n        const left = raw[row * 9 + col]\n        const right = raw[row * 9 + col + 1]\n        bits += left > right ? '1' : '0'\n      }\n    }\n    let hex = ''\n    for (let i = 0; i < bits.length; i += 4) {\n      hex += Number.parseInt(bits.slice(i, i + 4), 2).toString(16)\n    }\n    return hex\n  },\n  async compare(a, b) {\n    const dist = hammingHex(a, b)\n    const bits = (a.length / 2) * 8\n    return {\n      distance: dist, similarity: 1 - dist / bits, metric: `hamming-${bits}`,\n    }\n  },\n}\n","import { Nilsimsa } from 'nilsimsa'\n\nimport type { Algorithm } from './types.ts'\n\nexport const nilsimsaAlgorithm: Algorithm = {\n  name: 'nilsimsa',\n  family: 'fuzzy-byte',\n  inputType: 'bytes',\n  async hash(input) {\n    if (input.bytes === undefined) {\n      throw new Error('nilsimsa requires loaded bytes.')\n    }\n    const n = new Nilsimsa(input.bytes)\n    return n.digest('hex')\n  },\n  async compare(a, b) {\n    // Nilsimsa.compare returns a similarity score in [-128, 128].\n    // 128 = identical; 0 ≈ unrelated; -128 = perfectly anti-correlated.\n    const raw = Nilsimsa.compare(a, b, 'hex')\n    const similarity = Math.max(0, Math.min(1, (raw + 128) / 256))\n    return {\n      distance: 128 - raw, similarity, metric: 'nilsimsa-score',\n    }\n  },\n}\n","import { createRequire } from 'node:module'\n\nimport sharp from 'sharp'\n\nimport { hammingHex } from '../lib/hamming.ts'\nimport type { Algorithm } from './types.ts'\n\n/**\n * pdq-wasm ships a CommonJS entry that uses `require` to load its bundled WASM file.\n * Aries is ESM, so we use `createRequire` to bridge — this picks the CJS dist via the\n * package's `exports.require` condition, which can resolve the relative WASM path.\n */\nconst require = createRequire(import.meta.url)\ninterface PDQHashResult { hash: Uint8Array; quality: number }\ninterface PDQModule {\n  init(): Promise<void>\n  hash(input: { data: Uint8Array; width: number; height: number; channels: 1 | 3 }): PDQHashResult\n  toHex(hash: Uint8Array): string\n}\nconst { PDQ } = require('pdq-wasm') as { PDQ: PDQModule }\n\nlet initialized = false\nasync function ensureInit(): Promise<void> {\n  if (initialized) return\n  await PDQ.init()\n  initialized = true\n}\n\n/**\n * Decode the input image to RGB raw bytes that pdq-wasm can consume directly.\n * sharp handles JPEG/PNG/WebP/AVIF/etc. transparently.\n */\nasync function toRgbRaw(source: Buffer | string): Promise<{ data: Uint8Array; width: number; height: number }> {\n  const { data, info } = await sharp(source).removeAlpha().raw().toBuffer({ resolveWithObject: true })\n  return {\n    data: new Uint8Array(data.buffer, data.byteOffset, data.byteLength),\n    width: info.width,\n    height: info.height,\n  }\n}\n\nexport const pdqAlgorithm: Algorithm = {\n  name: 'pdq',\n  family: 'perceptual-image',\n  inputType: 'image',\n  async hash(input) {\n    const source = input.path ?? input.bytes\n    if (source === undefined) {\n      throw new Error('pdq requires bytes or a path.')\n    }\n    await ensureInit()\n    const rgb = await toRgbRaw(source)\n    const result = PDQ.hash({\n      data: rgb.data, width: rgb.width, height: rgb.height, channels: 3,\n    })\n    return PDQ.toHex(result.hash)\n  },\n  async compare(a, b) {\n    const dist = hammingHex(a, b)\n    const bits = (a.length / 2) * 8\n    return {\n      distance: dist, similarity: 1 - dist / bits, metric: `hamming-${bits}`,\n    }\n  },\n}\n","import phashLib from 'sharp-phash'\n\nimport { hammingHex } from '../lib/hamming.ts'\nimport type { Algorithm } from './types.ts'\n\nconst phash = phashLib as unknown as (image: Buffer | string) => Promise<string>\n\n/**\n * sharp-phash returns a 64-character '01' binary string. We pack it into 16-char hex\n * for parity with the other perceptual image algorithms.\n */\nfunction binaryToHex(bin: string): string {\n  if (!/^[01]+$/.test(bin)) {\n    throw new TypeError(`phash returned unexpected output: ${bin.slice(0, 20)}…`)\n  }\n  const padded = bin.padStart(Math.ceil(bin.length / 4) * 4, '0')\n  let hex = ''\n  for (let i = 0; i < padded.length; i += 4) {\n    hex += Number.parseInt(padded.slice(i, i + 4), 2).toString(16)\n  }\n  return hex\n}\n\nexport const phashAlgorithm: Algorithm = {\n  name: 'phash',\n  family: 'perceptual-image',\n  inputType: 'image',\n  async hash(input) {\n    const source = input.path ?? input.bytes\n    if (source === undefined) {\n      throw new Error('phash requires bytes or a path.')\n    }\n    const bin = await phash(source)\n    return binaryToHex(bin)\n  },\n  async compare(a, b) {\n    const dist = hammingHex(a, b)\n    const bits = (a.length / 2) * 8\n    return {\n      distance: dist, similarity: 1 - dist / bits, metric: `hamming-${bits}`,\n    }\n  },\n}\n","import { createHash } from 'node:crypto'\n\nimport type { Algorithm } from './types.ts'\n\nexport const sha256Algorithm: Algorithm = {\n  name: 'sha256',\n  family: 'strict',\n  inputType: 'bytes',\n  async hash(input) {\n    if (input.bytes === undefined) {\n      throw new Error('sha256 requires loaded bytes.')\n    }\n    return createHash('sha256').update(input.bytes).digest('hex')\n  },\n  async compare(a, b) {\n    return {\n      similarity: a === b ? 1 : 0,\n      distance: a === b ? 0 : 1,\n      metric: 'exact-match',\n    }\n  },\n}\n","/**\n * Standard Levenshtein edit distance between two strings.\n * O(m·n) time, O(min(m,n)) space.\n */\nexport function levenshtein(a: string, b: string): number {\n  if (a === b) return 0\n  if (a.length === 0) return b.length\n  if (b.length === 0) return a.length\n\n  // Make `s1` the longer string so the row width is min(m,n)+1.\n  let s1 = a\n  let s2 = b\n  if (s1.length < s2.length) {\n    const tmp = s1\n    s1 = s2\n    s2 = tmp\n  }\n\n  const m = s1.length\n  const n = s2.length\n  let prev: number[] = Array.from({ length: n + 1 }, (_, j) => j)\n  let curr: number[] = Array.from({ length: n + 1 }, () => 0)\n\n  for (let i = 1; i <= m; i++) {\n    curr[0] = i\n    const cp1 = s1.codePointAt(i - 1)\n    for (let j = 1; j <= n; j++) {\n      const cost = cp1 === s2.codePointAt(j - 1) ? 0 : 1\n      const del = prev[j] + 1\n      const ins = curr[j - 1] + 1\n      const sub = prev[j - 1] + cost\n      curr[j] = Math.min(del, ins, sub)\n    }\n    const tmp = prev\n    prev = curr\n    curr = tmp\n  }\n  return prev[n]\n}\n","import { levenshtein } from '../lib/levenshtein.ts'\nimport { runBinary } from '../lib/runBinary.ts'\nimport { requireBinary } from '../lib/which.ts'\nimport type { Algorithm, RequiredBinary } from './types.ts'\n\nconst SSDEEP_BIN: RequiredBinary = {\n  binary: 'ssdeep',\n  install: {\n    brew: 'ssdeep',\n    apt: 'ssdeep',\n    choco: 'ssdeep',\n  },\n}\n\n/**\n * Parse an ssdeep hash of the form `<block_size>:<h1>:<h2>` (filename suffix is dropped).\n */\nfunction parseSsdeepHash(raw: string): { blockSize: number; h1: string; h2: string } {\n  const cleaned = raw.replace(/,.*$/u, '').trim()\n  const parts = cleaned.split(':')\n  if (parts.length < 3) {\n    throw new Error(`Invalid ssdeep hash: ${raw}`)\n  }\n  const blockSize = Number.parseInt(parts[0], 10)\n  if (!Number.isFinite(blockSize) || blockSize <= 0) {\n    throw new Error(`Invalid ssdeep block size: ${parts[0]}`)\n  }\n  return {\n    blockSize, h1: parts[1], h2: parts[2],\n  }\n}\n\nfunction levenshteinSimilarity(a: string, b: string): number {\n  if (a.length === 0 && b.length === 0) return 1\n  const dist = levenshtein(a, b)\n  const maxLen = Math.max(a.length, b.length, 1)\n  return Math.max(0, 1 - dist / maxLen)\n}\n\n/**\n * Approximate ssdeep similarity using Levenshtein on whichever sub-hash pair shares a\n * compatible block size (1×, 2×, or 0.5×). Returns 0 if block sizes are incompatible.\n *\n * This is NOT the canonical ssdeep score — that algorithm applies a block-size\n * attenuation curve we don't replicate here. The metric label `ssdeep-levenshtein`\n * makes that explicit.\n */\nfunction ssdeepSimilarity(rawA: string, rawB: string): { similarity: number; distance: number } {\n  const a = parseSsdeepHash(rawA)\n  const b = parseSsdeepHash(rawB)\n  if (a.blockSize === b.blockSize) {\n    const s1 = levenshteinSimilarity(a.h1, b.h1)\n    const s2 = levenshteinSimilarity(a.h2, b.h2)\n    const similarity = Math.max(s1, s2)\n    const distance = Math.round((1 - similarity) * Math.max(a.h1.length, b.h1.length, a.h2.length, b.h2.length))\n    return { similarity, distance }\n  }\n  if (a.blockSize === b.blockSize * 2) {\n    const similarity = levenshteinSimilarity(a.h2, b.h1)\n    return { similarity, distance: Math.round((1 - similarity) * Math.max(a.h2.length, b.h1.length)) }\n  }\n  if (b.blockSize === a.blockSize * 2) {\n    const similarity = levenshteinSimilarity(a.h1, b.h2)\n    return { similarity, distance: Math.round((1 - similarity) * Math.max(a.h1.length, b.h2.length)) }\n  }\n  return { similarity: 0, distance: Number.NaN }\n}\n\nexport const ssdeepAlgorithm: Algorithm = {\n  name: 'ssdeep',\n  family: 'fuzzy-byte',\n  inputType: 'bytes',\n  requires: [SSDEEP_BIN],\n  async hash(input) {\n    if (input.bytes === undefined) {\n      throw new Error('ssdeep requires loaded bytes.')\n    }\n    await requireBinary(SSDEEP_BIN)\n    // -b: bare output (no header line, no filename column)\n    // -s: silent — suppress warnings/banner\n    // We still get a header, so parse defensively.\n    const { stdout } = await runBinary({\n      binary: 'ssdeep', args: ['-b', '-s'], stdin: input.bytes,\n    })\n    const text = stdout.toString('utf8')\n    const lines = text.split(/\\r?\\n/).map(l => l.trim()).filter(l => l.length > 0)\n    // Skip the \"ssdeep,1.1--blocksize:hash:hash,filename\" header if present.\n    const hashLine = lines.find(l => !l.startsWith('ssdeep,')) ?? lines.at(-1)\n    if (hashLine === undefined) {\n      throw new Error('ssdeep produced no output.')\n    }\n    return hashLine.replace(/,.*$/u, '')\n  },\n  async compare(a, b) {\n    const { similarity, distance } = ssdeepSimilarity(a, b)\n    return {\n      similarity, distance: Number.isFinite(distance) ? distance : undefined, metric: 'ssdeep-levenshtein',\n    }\n  },\n}\n","import tlsh from 'tlsh'\n\nimport { hammingHex } from '../lib/hamming.ts'\nimport type { Algorithm } from './types.ts'\n\n/**\n * The `tlsh` npm package exports a single function: `tlsh(data: string): string`.\n * It does NOT expose the canonical diff algorithm publicly. We use a Hamming-distance\n * proxy over the hash bytes for `compare`. This is a reasonable approximation, not the\n * canonical TLSH-diff score — the metric label `tlsh-bit-hamming` makes that explicit.\n */\n\nexport const tlshAlgorithm: Algorithm = {\n  name: 'tlsh',\n  family: 'fuzzy-byte',\n  inputType: 'bytes',\n  async hash(input) {\n    if (input.bytes === undefined) {\n      throw new Error('tlsh requires loaded bytes.')\n    }\n    if (input.bytes.length < 50) {\n      throw new Error(`tlsh requires at least 50 bytes of input (got ${input.bytes.length}).`)\n    }\n    return tlsh(input.bytes.toString('binary'))\n  },\n  async compare(a, b) {\n    if (a.length !== b.length) {\n      throw new Error(`tlsh hash length mismatch: ${a.length} vs ${b.length}`)\n    }\n    // TLSH hashes carry a leading version/type byte that's identical for hashes\n    // produced by the same library — skip 4 hex chars (version+checksum bytes)\n    // before measuring distance for slightly more meaningful comparison.\n    const skip = a.length >= 8 ? 4 : 0\n    const aBody = a.slice(skip)\n    const bBody = b.slice(skip)\n    const distance = hammingHex(aBody, bBody)\n    const bits = (aBody.length / 2) * 8\n    return {\n      distance,\n      similarity: 1 - distance / bits,\n      metric: 'tlsh-bit-hamming',\n    }\n  },\n}\n","import { randomBytes } from 'node:crypto'\nimport {\n  mkdtemp, readdir, readFile, rm,\n} from 'node:fs/promises'\nimport OS from 'node:os'\nimport PATH from 'node:path'\n\nimport { hammingHex } from '../lib/hamming.ts'\nimport { runBinary } from '../lib/runBinary.ts'\nimport { requireBinary } from '../lib/which.ts'\nimport { withTempfile } from '../lib/withTempfile.ts'\nimport { pdqAlgorithm } from './pdq.ts'\nimport { phashAlgorithm } from './phash.ts'\nimport type { Algorithm, RequiredBinary } from './types.ts'\n\nconst FFMPEG_BIN: RequiredBinary = {\n  binary: 'ffmpeg',\n  install: {\n    brew: 'ffmpeg',\n    apt: 'ffmpeg',\n    choco: 'ffmpeg',\n  },\n}\n\nexport type FrameAlgorithmName = 'phash' | 'pdq'\nexport const SUPPORTED_FRAME_ALGORITHMS = ['phash', 'pdq'] as const\n\ninterface VideoFramesFingerprint {\n  algorithm: 'video-frames'\n  fps: number\n  frameAlgorithm: FrameAlgorithmName\n  duration: number\n  frames: { t: number; hash: string }[]\n}\n\nexport const DEFAULT_FPS = 1\nexport const DEFAULT_FRAME_ALGORITHM: FrameAlgorithmName = 'phash'\n\nasync function extractFrames(videoPath: string, fps: number): Promise<{ frames: Buffer[] }> {\n  await requireBinary(FFMPEG_BIN)\n  const dir = await mkdtemp(PATH.join(OS.tmpdir(), `aries-vframes-${randomBytes(6).toString('hex')}-`))\n  try {\n    await runBinary({\n      binary: 'ffmpeg',\n      args: [\n        '-hide_banner',\n        '-loglevel',\n        'error',\n        '-i',\n        videoPath,\n        '-vf',\n        `fps=${fps},scale=128:128:force_original_aspect_ratio=disable`,\n        '-q:v',\n        '5',\n        PATH.join(dir, 'frame-%05d.jpg'),\n      ],\n    })\n    const entries = (await readdir(dir)).filter(name => name.endsWith('.jpg')).toSorted()\n    const frames = await Promise.all(entries.map(async name => await readFile(PATH.join(dir, name))))\n    return { frames }\n  } finally {\n    await rm(dir, { recursive: true, force: true })\n  }\n}\n\nfunction frameHasher(name: FrameAlgorithmName): (bytes: Buffer) => Promise<string> {\n  switch (name) {\n    case 'phash': { return async bytes => await phashAlgorithm.hash({ bytes })\n    }\n    case 'pdq': { return async bytes => await pdqAlgorithm.hash({ bytes })\n    }\n  }\n}\n\nasync function fingerprintVideo(\n  videoPath: string,\n  fps: number,\n  frameAlgorithm: FrameAlgorithmName,\n): Promise<VideoFramesFingerprint> {\n  const { frames } = await extractFrames(videoPath, fps)\n  const hashFrame = frameHasher(frameAlgorithm)\n  const hashes = await Promise.all(frames.map(async (frame, idx) => ({\n    t: idx / fps,\n    hash: await hashFrame(frame),\n  })))\n  return {\n    algorithm: 'video-frames',\n    fps,\n    frameAlgorithm,\n    duration: frames.length / fps,\n    frames: hashes,\n  }\n}\n\nfunction parseVideoFramesHash(raw: string): VideoFramesFingerprint {\n  let parsed: unknown\n  try {\n    parsed = JSON.parse(raw)\n  } catch {\n    throw new Error('video-frames hash must be JSON produced by `aries hash --algorithm video-frames`.')\n  }\n  const obj = parsed as Partial<VideoFramesFingerprint>\n  if (\n    obj.algorithm !== 'video-frames'\n    || typeof obj.fps !== 'number'\n    || typeof obj.duration !== 'number'\n    || !Array.isArray(obj.frames)\n  ) {\n    throw new Error('video-frames hash JSON missing required fields.')\n  }\n  // frameAlgorithm was added in a later revision; default to phash when older hashes lack it.\n  if (obj.frameAlgorithm === undefined) {\n    return { ...obj, frameAlgorithm: 'phash' } as VideoFramesFingerprint\n  }\n  return obj as VideoFramesFingerprint\n}\n\ninterface VideoFramesCompareDetails {\n  similarity: number\n  distance: number\n  bestOffsetSeconds: number\n  overlapSeconds: number\n}\n\n/** Sliding-window Hamming distance over the two frame sequences. */\nfunction compareFrameSequences(\n  a: VideoFramesFingerprint,\n  b: VideoFramesFingerprint,\n): VideoFramesCompareDetails {\n  const fps = Math.min(a.fps, b.fps)\n  if (a.frames.length === 0 || b.frames.length === 0) {\n    return {\n      similarity: 0, distance: Number.NaN, bestOffsetSeconds: 0, overlapSeconds: 0,\n    }\n  }\n  const minLen = Math.min(a.frames.length, b.frames.length)\n  const maxOffset = Math.max(a.frames.length, b.frames.length) - 1\n  let best: VideoFramesCompareDetails = {\n    similarity: 0,\n    distance: Number.NaN,\n    bestOffsetSeconds: 0,\n    overlapSeconds: 0,\n  }\n  const minOverlap = Math.max(2, Math.floor(minLen / 4))\n  for (let offset = -maxOffset; offset <= maxOffset; offset++) {\n    const aStart = Math.max(0, -offset)\n    const bStart = Math.max(0, offset)\n    const overlap = Math.min(a.frames.length - aStart, b.frames.length - bStart)\n    if (overlap < minOverlap) continue\n    let totalBits = 0\n    let bitWidth = 0\n    for (let i = 0; i < overlap; i++) {\n      const ah = a.frames[aStart + i].hash\n      const bh = b.frames[bStart + i].hash\n      if (ah.length !== bh.length) continue\n      totalBits += hammingHex(ah, bh)\n      bitWidth += (ah.length / 2) * 8\n    }\n    if (bitWidth === 0) continue\n    const similarity = 1 - totalBits / bitWidth\n    if (similarity > best.similarity) {\n      best = {\n        similarity,\n        distance: totalBits,\n        bestOffsetSeconds: offset / fps,\n        overlapSeconds: overlap / fps,\n      }\n    }\n  }\n  return best\n}\n\nfunction parseFps(options: Record<string, unknown> | undefined): number {\n  const raw = options?.fps\n  if (raw === undefined) return DEFAULT_FPS\n  const value = typeof raw === 'string' ? Number.parseFloat(raw) : Number(raw)\n  if (!Number.isFinite(value) || value <= 0 || value > 60) {\n    const display = typeof raw === 'string' || typeof raw === 'number' ? String(raw) : '<non-scalar>'\n    throw new RangeError(`Invalid --fps ${display}: expected a number in (0, 60].`)\n  }\n  return value\n}\n\nfunction parseFrameAlgorithm(options: Record<string, unknown> | undefined): FrameAlgorithmName {\n  const raw = options?.frameAlgorithm\n  if (raw === undefined) return DEFAULT_FRAME_ALGORITHM\n  if (typeof raw !== 'string' || !(SUPPORTED_FRAME_ALGORITHMS as readonly string[]).includes(raw)) {\n    const display = typeof raw === 'string' ? raw : `<${typeof raw}>`\n    throw new RangeError(`Invalid --frame-algorithm ${display}: expected one of ${SUPPORTED_FRAME_ALGORITHMS.join(', ')}.`)\n  }\n  return raw as FrameAlgorithmName\n}\n\nexport const videoFramesAlgorithm: Algorithm = {\n  name: 'video-frames',\n  family: 'video',\n  inputType: 'video',\n  requires: [FFMPEG_BIN],\n  async hash(input) {\n    const fps = parseFps(input.options)\n    const frameAlgorithm = parseFrameAlgorithm(input.options)\n    const fp = input.path === undefined\n      ? input.bytes === undefined\n        ? null\n        : await withTempfile(input.bytes, 'video.bin', async path => await fingerprintVideo(path, fps, frameAlgorithm))\n      : await fingerprintVideo(input.path, fps, frameAlgorithm)\n    if (fp === null) {\n      throw new Error('video-frames requires bytes or a path.')\n    }\n    return JSON.stringify(fp)\n  },\n  async compare(a, b) {\n    const fpA = parseVideoFramesHash(a)\n    const fpB = parseVideoFramesHash(b)\n    if (fpA.frameAlgorithm !== fpB.frameAlgorithm) {\n      throw new Error(`Cannot compare video-frames hashes with different frame algorithms (${fpA.frameAlgorithm} vs ${fpB.frameAlgorithm}).`)\n    }\n    const result = compareFrameSequences(fpA, fpB)\n    return {\n      similarity: result.similarity,\n      distance: Number.isFinite(result.distance) ? result.distance : undefined,\n      metric: `frame-sequence-${fpA.frameAlgorithm}@${fpA.fps}fps`,\n    }\n  },\n}\n","import { ObjectHasher } from '@xyo-network/hash'\n\nimport type { Algorithm } from './types.ts'\n\nexport const xyoAlgorithm: Algorithm = {\n  name: 'xyo',\n  family: 'strict',\n  inputType: 'bytes',\n  async hash(input) {\n    if (input.bytes === undefined) {\n      throw new Error('xyo requires loaded bytes.')\n    }\n    let parsed: unknown\n    try {\n      parsed = JSON.parse(input.bytes.toString('utf8'))\n    } catch {\n      throw new Error('xyo requires valid JSON input.')\n    }\n    return await ObjectHasher.hash(parsed as Record<string, unknown>)\n  },\n  async compare(a, b) {\n    return {\n      similarity: a === b ? 1 : 0,\n      distance: a === b ? 0 : 1,\n      metric: 'exact-match',\n    }\n  },\n}\n","import { blockhashAlgorithm } from './blockhash.ts'\nimport { chromaprintAlgorithm } from './chromaprint.ts'\nimport { dhashAlgorithm } from './dhash.ts'\nimport { nilsimsaAlgorithm } from './nilsimsa.ts'\nimport { pdqAlgorithm } from './pdq.ts'\nimport { phashAlgorithm } from './phash.ts'\nimport { sha256Algorithm } from './sha256.ts'\nimport { ssdeepAlgorithm } from './ssdeep.ts'\nimport { tlshAlgorithm } from './tlsh.ts'\nimport type { Algorithm } from './types.ts'\nimport { videoFramesAlgorithm } from './videoFrames.ts'\nimport { xyoAlgorithm } from './xyo.ts'\n\nconst REGISTRY: ReadonlyMap<string, Algorithm> = new Map([\n  sha256Algorithm,\n  xyoAlgorithm,\n  tlshAlgorithm,\n  nilsimsaAlgorithm,\n  ssdeepAlgorithm,\n  phashAlgorithm,\n  dhashAlgorithm,\n  blockhashAlgorithm,\n  pdqAlgorithm,\n  chromaprintAlgorithm,\n  videoFramesAlgorithm,\n].map(algo => [algo.name, algo]))\n\nexport function getAlgorithm(name: string): Algorithm {\n  const algo = REGISTRY.get(name)\n  if (algo === undefined) {\n    const known = [...REGISTRY.keys()].join(', ')\n    throw new Error(`Unknown algorithm '${name}'. Known: ${known}`)\n  }\n  return algo\n}\n\nexport function listAlgorithms(): readonly string[] {\n  return [...REGISTRY.keys()]\n}\n\nexport type {\n  Algorithm, AlgorithmFamily, AlgorithmInputType, CompareResult, HashInput,\n} from './types.ts'\n"],"mappings":";AAAA,OAAO,aAAa;;;ACGpB,SAAS,UAAU,MAAsB;AACvC,MAAI,QAAQ;AACZ,MAAI,QAAQ,OAAO;AACnB,SAAO,UAAU,GAAG;AAClB,aAAS,QAAQ;AACjB,eAAW;AAAA,EACb;AACA,SAAO;AACT;AAMO,SAAS,WAAW,GAAW,GAAmB;AACvD,MAAI,EAAE,WAAW,EAAE,QAAQ;AACzB,UAAM,IAAI,MAAM,yBAAyB,EAAE,MAAM,OAAO,EAAE,MAAM,EAAE;AAAA,EACpE;AACA,MAAI,EAAE,SAAS,MAAM,GAAG;AACtB,UAAM,IAAI,MAAM,qCAAqC,EAAE,MAAM,EAAE;AAAA,EACjE;AACA,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,GAAG;AACpC,UAAM,KAAK,OAAO,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE;AAChD,UAAM,KAAK,OAAO,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE;AAChD,QAAI,OAAO,MAAM,EAAE,KAAK,OAAO,MAAM,EAAE,GAAG;AACxC,YAAM,IAAI,UAAU,2BAA2B,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC,GAAG;AAAA,IACrG;AACA,YAAQ,UAAU,KAAK,EAAE;AAAA,EAC3B;AACA,SAAO;AACT;AAaO,SAAS,WAAW,OAAuB;AAChD,MAAI,IAAI,KAAK,MAAM,KAAK;AACxB,MAAI,KAAM,MAAM,IAAK;AACrB,OAAK,IAAI,cAAmB,MAAM,IAAK;AACvC,MAAK,KAAK,MAAM,KAAM;AACtB,SAAS,IAAI,aAAmB,KAAM;AACxC;;;ADhDA,IAAM,EAAE,MAAM,UAAU,IAAI;AAMrB,IAAM,qBAAgC;AAAA,EAC3C,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,MAAM,KAAK,OAAO;AAChB,QAAI,MAAM,SAAS,QAAW;AAC5B,aAAO,MAAM,UAAU,MAAM,MAAM,GAAG,KAAK;AAAA,IAC7C;AACA,QAAI,MAAM,UAAU,QAAW;AAC7B,aAAO,MAAM,UAAU,MAAM,OAAO,GAAG,KAAK;AAAA,IAC9C;AACA,UAAM,IAAI,MAAM,qCAAqC;AAAA,EACvD;AAAA,EACA,MAAM,QAAQ,GAAG,GAAG;AAClB,UAAM,OAAO,WAAW,GAAG,CAAC;AAC5B,UAAM,OAAQ,EAAE,SAAS,IAAK;AAC9B,WAAO;AAAA,MACL,UAAU;AAAA,MAAM,YAAY,IAAI,OAAO;AAAA,MAAM,QAAQ,WAAW,IAAI;AAAA,IACtE;AAAA,EACF;AACF;;;AE/BA,SAAS,aAAa;AAuBtB,eAAsB,UAAU,SAAqD;AACnF,QAAM,WAAW,QAAQ,YAAY,KAAK,OAAO;AACjD,SAAO,MAAM,IAAI,QAAQ,CAAC,SAAS,WAAW;AAC5C,UAAM,QAAQ,MAAM,QAAQ,QAAQ,CAAC,GAAI,QAAQ,QAAQ,CAAC,CAAE,GAAG,EAAE,OAAO,CAAC,QAAQ,QAAQ,MAAM,EAAE,CAAC;AAElG,UAAM,eAAyB,CAAC;AAChC,QAAI,cAAc;AAClB,QAAI,SAAS;AACb,QAAI,oBAAoB;AAExB,UAAM,OAAO,GAAG,QAAQ,CAAC,UAAkB;AACzC,qBAAe,MAAM;AACrB,UAAI,cAAc,UAAU;AAC1B,YAAI,CAAC,mBAAmB;AACtB,8BAAoB;AACpB,gBAAM,KAAK,SAAS;AAAA,QACtB;AACA;AAAA,MACF;AACA,mBAAa,KAAK,KAAK;AAAA,IACzB,CAAC;AACD,UAAM,OAAO,GAAG,QAAQ,CAAC,UAAkB;AACzC,gBAAU,MAAM,SAAS,MAAM;AAAA,IACjC,CAAC;AAED,UAAM,GAAG,SAAS,SAAO,OAAO,GAAG,CAAC;AACpC,UAAM,GAAG,SAAS,CAAC,SAAS;AAC1B,UAAI,mBAAmB;AACrB,eAAO,IAAI,MAAM,GAAG,QAAQ,MAAM,oBAAoB,QAAQ,QAAQ,CAAC;AACvE;AAAA,MACF;AACA,YAAM,WAAW,QAAQ;AACzB,YAAM,SAAS,OAAO,OAAO,YAAY;AACzC,UAAI,aAAa,GAAG;AAClB,cAAM,OAAO,OAAO,KAAK,EAAE,MAAM,OAAO,EAAE,MAAM,EAAE,EAAE,KAAK,IAAI;AAC7D,eAAO,IAAI,MAAM,GAAG,QAAQ,MAAM,WAAW,QAAQ,GAAG,KAAK,SAAS,IAAI,KAAK,IAAI,KAAK,EAAE,EAAE,CAAC;AAC7F;AAAA,MACF;AACA,cAAQ;AAAA,QACN;AAAA,QAAQ;AAAA,QAAQ;AAAA,MAClB,CAAC;AAAA,IACH,CAAC;AAED,QAAI,QAAQ,UAAU,QAAW;AAC/B,YAAM,MAAM,IAAI;AAAA,IAClB,OAAO;AACL,YAAM,MAAM,IAAI,QAAQ,KAAK;AAAA,IAC/B;AAAA,EACF,CAAC;AACH;;;ACxEA,SAAS,SAAAA,cAAa;AAQtB,eAAsB,MAAM,QAAwC;AAClE,SAAO,MAAM,IAAI,QAAQ,CAAC,YAAY;AACpC,UAAM,MAAM,QAAQ,aAAa,UAAU,UAAU;AACrD,UAAM,OAAO,QAAQ,aAAa,UAAU,CAAC,MAAM,IAAI,CAAC,MAAM,MAAM;AACpE,UAAM,QAAQA,OAAM,KAAK,MAAM,EAAE,OAAO,QAAQ,aAAa,QAAQ,CAAC;AAEtE,QAAI,SAAS;AACb,UAAM,OAAO,GAAG,QAAQ,CAAC,UAAkB;AACzC,gBAAU,MAAM,SAAS,MAAM;AAAA,IACjC,CAAC;AACD,UAAM,GAAG,SAAS,MAAM,QAAQ,IAAI,CAAC;AACrC,UAAM,GAAG,SAAS,CAAC,SAAS;AAC1B,UAAI,SAAS,GAAG;AACd,cAAM,OAAO,OAAO,MAAM,OAAO,EAAE,KAAK,UAAQ,KAAK,KAAK,EAAE,SAAS,CAAC,GAAG,KAAK,KAAK;AACnF,gBAAQ,IAAI;AAAA,MACd,OAAO;AACL,gBAAQ,IAAI;AAAA,MACd;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AACH;AAKA,eAAsB,cAAc,KAAsC;AACxE,QAAM,OAAO,MAAM,MAAM,IAAI,MAAM;AACnC,MAAI,SAAS,KAAM,QAAO;AAC1B,QAAM,QAAQ,CAAC,GAAG,IAAI,MAAM,0CAA0C;AACtE,MAAI,IAAI,QAAQ,SAAS,OAAW,OAAM,KAAK,2BAA2B,IAAI,QAAQ,IAAI,EAAE;AAC5F,MAAI,IAAI,QAAQ,QAAQ,OAAW,OAAM,KAAK,0BAA0B,IAAI,QAAQ,GAAG,EAAE;AACzF,MAAI,IAAI,QAAQ,UAAU,OAAW,OAAM,KAAK,4BAA4B,IAAI,QAAQ,KAAK,EAAE;AAC/F,QAAM,IAAI,MAAM,MAAM,KAAK,IAAI,CAAC;AAClC;;;ACzCA,SAAS,mBAAmB;AAC5B,SAAS,IAAI,iBAAiB;AAC9B,OAAO,QAAQ;AACf,OAAO,UAAU;AAMjB,eAAsB,aACpB,OACA,WACA,IACY;AACZ,QAAM,MAAM,cAAc,UAAa,UAAU,SAAS,IAAI,IAAI,SAAS,KAAK;AAChF,QAAM,OAAO,KAAK,KAAK,GAAG,OAAO,GAAG,cAAc,YAAY,CAAC,EAAE,SAAS,KAAK,CAAC,GAAG,GAAG,EAAE;AACxF,QAAM,UAAU,MAAM,KAAK;AAC3B,MAAI;AACF,WAAO,MAAM,GAAG,IAAI;AAAA,EACtB,UAAE;AACA,UAAM,GAAG,MAAM,EAAE,OAAO,KAAK,CAAC;AAAA,EAChC;AACF;;;AChBA,IAAM,aAA6B;AAAA,EACjC,QAAQ;AAAA,EACR,SAAS;AAAA,IACP,MAAM;AAAA,IACN,KAAK;AAAA,IACL,OAAO;AAAA,EACT;AACF;AAaA,eAAe,UAAU,MAA+C;AACtE,QAAM,cAAc,UAAU;AAG9B,QAAM,EAAE,OAAO,IAAI,MAAM,UAAU,EAAE,QAAQ,UAAU,MAAM,CAAC,QAAQ,SAAS,IAAI,EAAE,CAAC;AACtF,QAAM,SAAS,KAAK,MAAM,OAAO,SAAS,MAAM,CAAC;AACjD,MAAI,OAAO,OAAO,aAAa,YAAY,CAAC,MAAM,QAAQ,OAAO,WAAW,GAAG;AAC7E,UAAM,IAAI,UAAU,wCAAwC;AAAA,EAC9D;AACA,SAAO;AAAA,IACL,WAAW;AAAA,IACX,UAAU,OAAO;AAAA,IACjB,aAAa,OAAO;AAAA,EACtB;AACF;AAEA,SAAS,qBAAqB,KAAqC;AACjE,MAAI;AACJ,MAAI;AACF,aAAS,KAAK,MAAM,GAAG;AAAA,EACzB,QAAQ;AACN,UAAM,IAAI,MAAM,4FAA4F;AAAA,EAC9G;AACA,QAAM,MAAM;AACZ,MAAI,IAAI,cAAc,iBAAiB,OAAO,IAAI,aAAa,YAAY,CAAC,MAAM,QAAQ,IAAI,WAAW,GAAG;AAC1G,UAAM,IAAI,MAAM,mFAAmF;AAAA,EACrG;AACA,SAAO;AACT;AAOA,SAAS,oBAAoB,GAAa,GAAuE;AAC/G,MAAI,EAAE,WAAW,KAAK,EAAE,WAAW,GAAG;AACpC,WAAO;AAAA,MACL,YAAY;AAAA,MAAG,UAAU,OAAO;AAAA,MAAK,QAAQ;AAAA,IAC/C;AAAA,EACF;AAEA,QAAM,OAAO,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM;AACxC,QAAM,YAAY,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM,IAAI;AACjD,MAAI,OAAO;AAAA,IACT,YAAY;AAAA,IACZ,UAAU,KAAK;AAAA,IACf,QAAQ;AAAA,EACV;AAEA,WAAS,SAAS,CAAC,WAAW,UAAU,WAAW,UAAU;AAC3D,UAAM,SAAS,KAAK,IAAI,GAAG,CAAC,MAAM;AAClC,UAAM,SAAS,KAAK,IAAI,GAAG,MAAM;AACjC,UAAM,UAAU,KAAK,IAAI,EAAE,SAAS,QAAQ,EAAE,SAAS,MAAM;AAC7D,QAAI,UAAU,KAAK,IAAI,GAAG,OAAO,CAAC,EAAG;AACrC,QAAI,OAAO;AACX,aAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,cAAQ,WAAW,EAAE,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;AAAA,IAClD;AACA,UAAM,aAAa,IAAI,QAAQ,KAAK;AACpC,QAAI,aAAa,KAAK,YAAY;AAChC,aAAO;AAAA,QACL;AAAA,QAAY,UAAU;AAAA,QAAM;AAAA,MAC9B;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEO,IAAM,uBAAkC;AAAA,EAC7C,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,UAAU,CAAC,UAAU;AAAA,EACrB,MAAM,KAAK,OAAO;AAChB,UAAM,KAAK,MAAM,SAAS,SACtB,MAAM,UAAU,SACd,OACA,MAAM,aAAa,MAAM,OAAO,aAAa,OAAM,SAAQ,MAAM,UAAU,IAAI,CAAC,IAClF,MAAM,UAAU,MAAM,IAAI;AAC9B,QAAI,OAAO,MAAM;AACf,YAAM,IAAI,MAAM,uCAAuC;AAAA,IACzD;AACA,WAAO,KAAK,UAAU,EAAE;AAAA,EAC1B;AAAA,EACA,MAAM,QAAQ,GAAG,GAAG;AAClB,UAAM,MAAM,qBAAqB,CAAC;AAClC,UAAM,MAAM,qBAAqB,CAAC;AAClC,UAAM,SAAS,oBAAoB,IAAI,aAAa,IAAI,WAAW;AACnE,WAAO;AAAA,MACL,YAAY,OAAO;AAAA,MACnB,UAAU,OAAO,SAAS,OAAO,QAAQ,IAAI,OAAO,WAAW;AAAA,MAC/D,QAAQ;AAAA,IACV;AAAA,EACF;AACF;;;ACzHA,SAAS,gBAAgB;AAEzB,OAAO,WAAW;AASX,IAAM,iBAA4B;AAAA,EACvC,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,MAAM,KAAK,OAAO;AAChB,UAAM,SAAS,MAAM,UAAU,MAAM,SAAS,SAAY,SAAY,MAAM,SAAS,MAAM,IAAI;AAC/F,QAAI,WAAW,QAAW;AACxB,YAAM,IAAI,MAAM,iCAAiC;AAAA,IACnD;AACA,UAAM,MAAM,MAAM,MAAM,MAAM,EAC3B,OAAO,GAAG,GAAG,EAAE,KAAK,OAAO,CAAC,EAC5B,UAAU,EACV,IAAI,EACJ,SAAS;AACZ,QAAI,IAAI,WAAW,IAAI,GAAG;AACxB,YAAM,IAAI,MAAM,sCAAsC,IAAI,MAAM,EAAE;AAAA,IACpE;AACA,QAAI,OAAO;AACX,aAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,eAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,cAAM,OAAO,IAAI,MAAM,IAAI,GAAG;AAC9B,cAAM,QAAQ,IAAI,MAAM,IAAI,MAAM,CAAC;AACnC,gBAAQ,OAAO,QAAQ,MAAM;AAAA,MAC/B;AAAA,IACF;AACA,QAAI,MAAM;AACV,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,GAAG;AACvC,aAAO,OAAO,SAAS,KAAK,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,SAAS,EAAE;AAAA,IAC7D;AACA,WAAO;AAAA,EACT;AAAA,EACA,MAAM,QAAQ,GAAG,GAAG;AAClB,UAAM,OAAO,WAAW,GAAG,CAAC;AAC5B,UAAM,OAAQ,EAAE,SAAS,IAAK;AAC9B,WAAO;AAAA,MACL,UAAU;AAAA,MAAM,YAAY,IAAI,OAAO;AAAA,MAAM,QAAQ,WAAW,IAAI;AAAA,IACtE;AAAA,EACF;AACF;;;ACjDA,SAAS,gBAAgB;AAIlB,IAAM,oBAA+B;AAAA,EAC1C,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,MAAM,KAAK,OAAO;AAChB,QAAI,MAAM,UAAU,QAAW;AAC7B,YAAM,IAAI,MAAM,iCAAiC;AAAA,IACnD;AACA,UAAM,IAAI,IAAI,SAAS,MAAM,KAAK;AAClC,WAAO,EAAE,OAAO,KAAK;AAAA,EACvB;AAAA,EACA,MAAM,QAAQ,GAAG,GAAG;AAGlB,UAAM,MAAM,SAAS,QAAQ,GAAG,GAAG,KAAK;AACxC,UAAM,aAAa,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,MAAM,OAAO,GAAG,CAAC;AAC7D,WAAO;AAAA,MACL,UAAU,MAAM;AAAA,MAAK;AAAA,MAAY,QAAQ;AAAA,IAC3C;AAAA,EACF;AACF;;;ACxBA,SAAS,qBAAqB;AAE9B,OAAOC,YAAW;AAUlB,IAAMC,WAAU,cAAc,YAAY,GAAG;AAO7C,IAAM,EAAE,IAAI,IAAIA,SAAQ,UAAU;AAElC,IAAI,cAAc;AAClB,eAAe,aAA4B;AACzC,MAAI,YAAa;AACjB,QAAM,IAAI,KAAK;AACf,gBAAc;AAChB;AAMA,eAAe,SAAS,QAAuF;AAC7G,QAAM,EAAE,MAAM,KAAK,IAAI,MAAMC,OAAM,MAAM,EAAE,YAAY,EAAE,IAAI,EAAE,SAAS,EAAE,mBAAmB,KAAK,CAAC;AACnG,SAAO;AAAA,IACL,MAAM,IAAI,WAAW,KAAK,QAAQ,KAAK,YAAY,KAAK,UAAU;AAAA,IAClE,OAAO,KAAK;AAAA,IACZ,QAAQ,KAAK;AAAA,EACf;AACF;AAEO,IAAM,eAA0B;AAAA,EACrC,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,MAAM,KAAK,OAAO;AAChB,UAAM,SAAS,MAAM,QAAQ,MAAM;AACnC,QAAI,WAAW,QAAW;AACxB,YAAM,IAAI,MAAM,+BAA+B;AAAA,IACjD;AACA,UAAM,WAAW;AACjB,UAAM,MAAM,MAAM,SAAS,MAAM;AACjC,UAAM,SAAS,IAAI,KAAK;AAAA,MACtB,MAAM,IAAI;AAAA,MAAM,OAAO,IAAI;AAAA,MAAO,QAAQ,IAAI;AAAA,MAAQ,UAAU;AAAA,IAClE,CAAC;AACD,WAAO,IAAI,MAAM,OAAO,IAAI;AAAA,EAC9B;AAAA,EACA,MAAM,QAAQ,GAAG,GAAG;AAClB,UAAM,OAAO,WAAW,GAAG,CAAC;AAC5B,UAAM,OAAQ,EAAE,SAAS,IAAK;AAC9B,WAAO;AAAA,MACL,UAAU;AAAA,MAAM,YAAY,IAAI,OAAO;AAAA,MAAM,QAAQ,WAAW,IAAI;AAAA,IACtE;AAAA,EACF;AACF;;;AChEA,OAAO,cAAc;AAKrB,IAAM,QAAQ;AAMd,SAAS,YAAY,KAAqB;AACxC,MAAI,CAAC,UAAU,KAAK,GAAG,GAAG;AACxB,UAAM,IAAI,UAAU,qCAAqC,IAAI,MAAM,GAAG,EAAE,CAAC,QAAG;AAAA,EAC9E;AACA,QAAM,SAAS,IAAI,SAAS,KAAK,KAAK,IAAI,SAAS,CAAC,IAAI,GAAG,GAAG;AAC9D,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG;AACzC,WAAO,OAAO,SAAS,OAAO,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,SAAS,EAAE;AAAA,EAC/D;AACA,SAAO;AACT;AAEO,IAAM,iBAA4B;AAAA,EACvC,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,MAAM,KAAK,OAAO;AAChB,UAAM,SAAS,MAAM,QAAQ,MAAM;AACnC,QAAI,WAAW,QAAW;AACxB,YAAM,IAAI,MAAM,iCAAiC;AAAA,IACnD;AACA,UAAM,MAAM,MAAM,MAAM,MAAM;AAC9B,WAAO,YAAY,GAAG;AAAA,EACxB;AAAA,EACA,MAAM,QAAQ,GAAG,GAAG;AAClB,UAAM,OAAO,WAAW,GAAG,CAAC;AAC5B,UAAM,OAAQ,EAAE,SAAS,IAAK;AAC9B,WAAO;AAAA,MACL,UAAU;AAAA,MAAM,YAAY,IAAI,OAAO;AAAA,MAAM,QAAQ,WAAW,IAAI;AAAA,IACtE;AAAA,EACF;AACF;;;AC1CA,SAAS,kBAAkB;AAIpB,IAAM,kBAA6B;AAAA,EACxC,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,MAAM,KAAK,OAAO;AAChB,QAAI,MAAM,UAAU,QAAW;AAC7B,YAAM,IAAI,MAAM,+BAA+B;AAAA,IACjD;AACA,WAAO,WAAW,QAAQ,EAAE,OAAO,MAAM,KAAK,EAAE,OAAO,KAAK;AAAA,EAC9D;AAAA,EACA,MAAM,QAAQ,GAAG,GAAG;AAClB,WAAO;AAAA,MACL,YAAY,MAAM,IAAI,IAAI;AAAA,MAC1B,UAAU,MAAM,IAAI,IAAI;AAAA,MACxB,QAAQ;AAAA,IACV;AAAA,EACF;AACF;;;ACjBO,SAAS,YAAY,GAAW,GAAmB;AACxD,MAAI,MAAM,EAAG,QAAO;AACpB,MAAI,EAAE,WAAW,EAAG,QAAO,EAAE;AAC7B,MAAI,EAAE,WAAW,EAAG,QAAO,EAAE;AAG7B,MAAI,KAAK;AACT,MAAI,KAAK;AACT,MAAI,GAAG,SAAS,GAAG,QAAQ;AACzB,UAAM,MAAM;AACZ,SAAK;AACL,SAAK;AAAA,EACP;AAEA,QAAM,IAAI,GAAG;AACb,QAAM,IAAI,GAAG;AACb,MAAI,OAAiB,MAAM,KAAK,EAAE,QAAQ,IAAI,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC;AAC9D,MAAI,OAAiB,MAAM,KAAK,EAAE,QAAQ,IAAI,EAAE,GAAG,MAAM,CAAC;AAE1D,WAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC3B,SAAK,CAAC,IAAI;AACV,UAAM,MAAM,GAAG,YAAY,IAAI,CAAC;AAChC,aAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC3B,YAAM,OAAO,QAAQ,GAAG,YAAY,IAAI,CAAC,IAAI,IAAI;AACjD,YAAM,MAAM,KAAK,CAAC,IAAI;AACtB,YAAM,MAAM,KAAK,IAAI,CAAC,IAAI;AAC1B,YAAM,MAAM,KAAK,IAAI,CAAC,IAAI;AAC1B,WAAK,CAAC,IAAI,KAAK,IAAI,KAAK,KAAK,GAAG;AAAA,IAClC;AACA,UAAM,MAAM;AACZ,WAAO;AACP,WAAO;AAAA,EACT;AACA,SAAO,KAAK,CAAC;AACf;;;ACjCA,IAAM,aAA6B;AAAA,EACjC,QAAQ;AAAA,EACR,SAAS;AAAA,IACP,MAAM;AAAA,IACN,KAAK;AAAA,IACL,OAAO;AAAA,EACT;AACF;AAKA,SAAS,gBAAgB,KAA4D;AACnF,QAAM,UAAU,IAAI,QAAQ,SAAS,EAAE,EAAE,KAAK;AAC9C,QAAM,QAAQ,QAAQ,MAAM,GAAG;AAC/B,MAAI,MAAM,SAAS,GAAG;AACpB,UAAM,IAAI,MAAM,wBAAwB,GAAG,EAAE;AAAA,EAC/C;AACA,QAAM,YAAY,OAAO,SAAS,MAAM,CAAC,GAAG,EAAE;AAC9C,MAAI,CAAC,OAAO,SAAS,SAAS,KAAK,aAAa,GAAG;AACjD,UAAM,IAAI,MAAM,8BAA8B,MAAM,CAAC,CAAC,EAAE;AAAA,EAC1D;AACA,SAAO;AAAA,IACL;AAAA,IAAW,IAAI,MAAM,CAAC;AAAA,IAAG,IAAI,MAAM,CAAC;AAAA,EACtC;AACF;AAEA,SAAS,sBAAsB,GAAW,GAAmB;AAC3D,MAAI,EAAE,WAAW,KAAK,EAAE,WAAW,EAAG,QAAO;AAC7C,QAAM,OAAO,YAAY,GAAG,CAAC;AAC7B,QAAM,SAAS,KAAK,IAAI,EAAE,QAAQ,EAAE,QAAQ,CAAC;AAC7C,SAAO,KAAK,IAAI,GAAG,IAAI,OAAO,MAAM;AACtC;AAUA,SAAS,iBAAiB,MAAc,MAAwD;AAC9F,QAAM,IAAI,gBAAgB,IAAI;AAC9B,QAAM,IAAI,gBAAgB,IAAI;AAC9B,MAAI,EAAE,cAAc,EAAE,WAAW;AAC/B,UAAM,KAAK,sBAAsB,EAAE,IAAI,EAAE,EAAE;AAC3C,UAAM,KAAK,sBAAsB,EAAE,IAAI,EAAE,EAAE;AAC3C,UAAM,aAAa,KAAK,IAAI,IAAI,EAAE;AAClC,UAAM,WAAW,KAAK,OAAO,IAAI,cAAc,KAAK,IAAI,EAAE,GAAG,QAAQ,EAAE,GAAG,QAAQ,EAAE,GAAG,QAAQ,EAAE,GAAG,MAAM,CAAC;AAC3G,WAAO,EAAE,YAAY,SAAS;AAAA,EAChC;AACA,MAAI,EAAE,cAAc,EAAE,YAAY,GAAG;AACnC,UAAM,aAAa,sBAAsB,EAAE,IAAI,EAAE,EAAE;AACnD,WAAO,EAAE,YAAY,UAAU,KAAK,OAAO,IAAI,cAAc,KAAK,IAAI,EAAE,GAAG,QAAQ,EAAE,GAAG,MAAM,CAAC,EAAE;AAAA,EACnG;AACA,MAAI,EAAE,cAAc,EAAE,YAAY,GAAG;AACnC,UAAM,aAAa,sBAAsB,EAAE,IAAI,EAAE,EAAE;AACnD,WAAO,EAAE,YAAY,UAAU,KAAK,OAAO,IAAI,cAAc,KAAK,IAAI,EAAE,GAAG,QAAQ,EAAE,GAAG,MAAM,CAAC,EAAE;AAAA,EACnG;AACA,SAAO,EAAE,YAAY,GAAG,UAAU,OAAO,IAAI;AAC/C;AAEO,IAAM,kBAA6B;AAAA,EACxC,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,UAAU,CAAC,UAAU;AAAA,EACrB,MAAM,KAAK,OAAO;AAChB,QAAI,MAAM,UAAU,QAAW;AAC7B,YAAM,IAAI,MAAM,+BAA+B;AAAA,IACjD;AACA,UAAM,cAAc,UAAU;AAI9B,UAAM,EAAE,OAAO,IAAI,MAAM,UAAU;AAAA,MACjC,QAAQ;AAAA,MAAU,MAAM,CAAC,MAAM,IAAI;AAAA,MAAG,OAAO,MAAM;AAAA,IACrD,CAAC;AACD,UAAM,OAAO,OAAO,SAAS,MAAM;AACnC,UAAM,QAAQ,KAAK,MAAM,OAAO,EAAE,IAAI,OAAK,EAAE,KAAK,CAAC,EAAE,OAAO,OAAK,EAAE,SAAS,CAAC;AAE7E,UAAM,WAAW,MAAM,KAAK,OAAK,CAAC,EAAE,WAAW,SAAS,CAAC,KAAK,MAAM,GAAG,EAAE;AACzE,QAAI,aAAa,QAAW;AAC1B,YAAM,IAAI,MAAM,4BAA4B;AAAA,IAC9C;AACA,WAAO,SAAS,QAAQ,SAAS,EAAE;AAAA,EACrC;AAAA,EACA,MAAM,QAAQ,GAAG,GAAG;AAClB,UAAM,EAAE,YAAY,SAAS,IAAI,iBAAiB,GAAG,CAAC;AACtD,WAAO;AAAA,MACL;AAAA,MAAY,UAAU,OAAO,SAAS,QAAQ,IAAI,WAAW;AAAA,MAAW,QAAQ;AAAA,IAClF;AAAA,EACF;AACF;;;ACnGA,OAAO,UAAU;AAYV,IAAM,gBAA2B;AAAA,EACtC,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,MAAM,KAAK,OAAO;AAChB,QAAI,MAAM,UAAU,QAAW;AAC7B,YAAM,IAAI,MAAM,6BAA6B;AAAA,IAC/C;AACA,QAAI,MAAM,MAAM,SAAS,IAAI;AAC3B,YAAM,IAAI,MAAM,iDAAiD,MAAM,MAAM,MAAM,IAAI;AAAA,IACzF;AACA,WAAO,KAAK,MAAM,MAAM,SAAS,QAAQ,CAAC;AAAA,EAC5C;AAAA,EACA,MAAM,QAAQ,GAAG,GAAG;AAClB,QAAI,EAAE,WAAW,EAAE,QAAQ;AACzB,YAAM,IAAI,MAAM,8BAA8B,EAAE,MAAM,OAAO,EAAE,MAAM,EAAE;AAAA,IACzE;AAIA,UAAM,OAAO,EAAE,UAAU,IAAI,IAAI;AACjC,UAAM,QAAQ,EAAE,MAAM,IAAI;AAC1B,UAAM,QAAQ,EAAE,MAAM,IAAI;AAC1B,UAAM,WAAW,WAAW,OAAO,KAAK;AACxC,UAAM,OAAQ,MAAM,SAAS,IAAK;AAClC,WAAO;AAAA,MACL;AAAA,MACA,YAAY,IAAI,WAAW;AAAA,MAC3B,QAAQ;AAAA,IACV;AAAA,EACF;AACF;;;AC3CA,SAAS,eAAAC,oBAAmB;AAC5B;AAAA,EACE;AAAA,EAAS;AAAA,EAAS,YAAAC;AAAA,EAAU,MAAAC;AAAA,OACvB;AACP,OAAOC,SAAQ;AACf,OAAOC,WAAU;AAUjB,IAAM,aAA6B;AAAA,EACjC,QAAQ;AAAA,EACR,SAAS;AAAA,IACP,MAAM;AAAA,IACN,KAAK;AAAA,IACL,OAAO;AAAA,EACT;AACF;AAGO,IAAM,6BAA6B,CAAC,SAAS,KAAK;AAUlD,IAAM,cAAc;AACpB,IAAM,0BAA8C;AAE3D,eAAe,cAAc,WAAmB,KAA4C;AAC1F,QAAM,cAAc,UAAU;AAC9B,QAAM,MAAM,MAAM,QAAQC,MAAK,KAAKC,IAAG,OAAO,GAAG,iBAAiBC,aAAY,CAAC,EAAE,SAAS,KAAK,CAAC,GAAG,CAAC;AACpG,MAAI;AACF,UAAM,UAAU;AAAA,MACd,QAAQ;AAAA,MACR,MAAM;AAAA,QACJ;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,OAAO,GAAG;AAAA,QACV;AAAA,QACA;AAAA,QACAF,MAAK,KAAK,KAAK,gBAAgB;AAAA,MACjC;AAAA,IACF,CAAC;AACD,UAAM,WAAW,MAAM,QAAQ,GAAG,GAAG,OAAO,UAAQ,KAAK,SAAS,MAAM,CAAC,EAAE,SAAS;AACpF,UAAM,SAAS,MAAM,QAAQ,IAAI,QAAQ,IAAI,OAAM,SAAQ,MAAMG,UAASH,MAAK,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC;AAChG,WAAO,EAAE,OAAO;AAAA,EAClB,UAAE;AACA,UAAMI,IAAG,KAAK,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AAAA,EAChD;AACF;AAEA,SAAS,YAAY,MAA8D;AACjF,UAAQ,MAAM;AAAA,IACZ,KAAK,SAAS;AAAE,aAAO,OAAM,UAAS,MAAM,eAAe,KAAK,EAAE,MAAM,CAAC;AAAA,IACzE;AAAA,IACA,KAAK,OAAO;AAAE,aAAO,OAAM,UAAS,MAAM,aAAa,KAAK,EAAE,MAAM,CAAC;AAAA,IACrE;AAAA,EACF;AACF;AAEA,eAAe,iBACb,WACA,KACA,gBACiC;AACjC,QAAM,EAAE,OAAO,IAAI,MAAM,cAAc,WAAW,GAAG;AACrD,QAAM,YAAY,YAAY,cAAc;AAC5C,QAAM,SAAS,MAAM,QAAQ,IAAI,OAAO,IAAI,OAAO,OAAO,SAAS;AAAA,IACjE,GAAG,MAAM;AAAA,IACT,MAAM,MAAM,UAAU,KAAK;AAAA,EAC7B,EAAE,CAAC;AACH,SAAO;AAAA,IACL,WAAW;AAAA,IACX;AAAA,IACA;AAAA,IACA,UAAU,OAAO,SAAS;AAAA,IAC1B,QAAQ;AAAA,EACV;AACF;AAEA,SAAS,qBAAqB,KAAqC;AACjE,MAAI;AACJ,MAAI;AACF,aAAS,KAAK,MAAM,GAAG;AAAA,EACzB,QAAQ;AACN,UAAM,IAAI,MAAM,mFAAmF;AAAA,EACrG;AACA,QAAM,MAAM;AACZ,MACE,IAAI,cAAc,kBACf,OAAO,IAAI,QAAQ,YACnB,OAAO,IAAI,aAAa,YACxB,CAAC,MAAM,QAAQ,IAAI,MAAM,GAC5B;AACA,UAAM,IAAI,MAAM,iDAAiD;AAAA,EACnE;AAEA,MAAI,IAAI,mBAAmB,QAAW;AACpC,WAAO,EAAE,GAAG,KAAK,gBAAgB,QAAQ;AAAA,EAC3C;AACA,SAAO;AACT;AAUA,SAAS,sBACP,GACA,GAC2B;AAC3B,QAAM,MAAM,KAAK,IAAI,EAAE,KAAK,EAAE,GAAG;AACjC,MAAI,EAAE,OAAO,WAAW,KAAK,EAAE,OAAO,WAAW,GAAG;AAClD,WAAO;AAAA,MACL,YAAY;AAAA,MAAG,UAAU,OAAO;AAAA,MAAK,mBAAmB;AAAA,MAAG,gBAAgB;AAAA,IAC7E;AAAA,EACF;AACA,QAAM,SAAS,KAAK,IAAI,EAAE,OAAO,QAAQ,EAAE,OAAO,MAAM;AACxD,QAAM,YAAY,KAAK,IAAI,EAAE,OAAO,QAAQ,EAAE,OAAO,MAAM,IAAI;AAC/D,MAAI,OAAkC;AAAA,IACpC,YAAY;AAAA,IACZ,UAAU,OAAO;AAAA,IACjB,mBAAmB;AAAA,IACnB,gBAAgB;AAAA,EAClB;AACA,QAAM,aAAa,KAAK,IAAI,GAAG,KAAK,MAAM,SAAS,CAAC,CAAC;AACrD,WAAS,SAAS,CAAC,WAAW,UAAU,WAAW,UAAU;AAC3D,UAAM,SAAS,KAAK,IAAI,GAAG,CAAC,MAAM;AAClC,UAAM,SAAS,KAAK,IAAI,GAAG,MAAM;AACjC,UAAM,UAAU,KAAK,IAAI,EAAE,OAAO,SAAS,QAAQ,EAAE,OAAO,SAAS,MAAM;AAC3E,QAAI,UAAU,WAAY;AAC1B,QAAI,YAAY;AAChB,QAAI,WAAW;AACf,aAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,YAAM,KAAK,EAAE,OAAO,SAAS,CAAC,EAAE;AAChC,YAAM,KAAK,EAAE,OAAO,SAAS,CAAC,EAAE;AAChC,UAAI,GAAG,WAAW,GAAG,OAAQ;AAC7B,mBAAa,WAAW,IAAI,EAAE;AAC9B,kBAAa,GAAG,SAAS,IAAK;AAAA,IAChC;AACA,QAAI,aAAa,EAAG;AACpB,UAAM,aAAa,IAAI,YAAY;AACnC,QAAI,aAAa,KAAK,YAAY;AAChC,aAAO;AAAA,QACL;AAAA,QACA,UAAU;AAAA,QACV,mBAAmB,SAAS;AAAA,QAC5B,gBAAgB,UAAU;AAAA,MAC5B;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,SAAS,SAAsD;AACtE,QAAM,MAAM,SAAS;AACrB,MAAI,QAAQ,OAAW,QAAO;AAC9B,QAAM,QAAQ,OAAO,QAAQ,WAAW,OAAO,WAAW,GAAG,IAAI,OAAO,GAAG;AAC3E,MAAI,CAAC,OAAO,SAAS,KAAK,KAAK,SAAS,KAAK,QAAQ,IAAI;AACvD,UAAM,UAAU,OAAO,QAAQ,YAAY,OAAO,QAAQ,WAAW,OAAO,GAAG,IAAI;AACnF,UAAM,IAAI,WAAW,iBAAiB,OAAO,iCAAiC;AAAA,EAChF;AACA,SAAO;AACT;AAEA,SAAS,oBAAoB,SAAkE;AAC7F,QAAM,MAAM,SAAS;AACrB,MAAI,QAAQ,OAAW,QAAO;AAC9B,MAAI,OAAO,QAAQ,YAAY,CAAE,2BAAiD,SAAS,GAAG,GAAG;AAC/F,UAAM,UAAU,OAAO,QAAQ,WAAW,MAAM,IAAI,OAAO,GAAG;AAC9D,UAAM,IAAI,WAAW,6BAA6B,OAAO,qBAAqB,2BAA2B,KAAK,IAAI,CAAC,GAAG;AAAA,EACxH;AACA,SAAO;AACT;AAEO,IAAM,uBAAkC;AAAA,EAC7C,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,UAAU,CAAC,UAAU;AAAA,EACrB,MAAM,KAAK,OAAO;AAChB,UAAM,MAAM,SAAS,MAAM,OAAO;AAClC,UAAM,iBAAiB,oBAAoB,MAAM,OAAO;AACxD,UAAM,KAAK,MAAM,SAAS,SACtB,MAAM,UAAU,SACd,OACA,MAAM,aAAa,MAAM,OAAO,aAAa,OAAM,SAAQ,MAAM,iBAAiB,MAAM,KAAK,cAAc,CAAC,IAC9G,MAAM,iBAAiB,MAAM,MAAM,KAAK,cAAc;AAC1D,QAAI,OAAO,MAAM;AACf,YAAM,IAAI,MAAM,wCAAwC;AAAA,IAC1D;AACA,WAAO,KAAK,UAAU,EAAE;AAAA,EAC1B;AAAA,EACA,MAAM,QAAQ,GAAG,GAAG;AAClB,UAAM,MAAM,qBAAqB,CAAC;AAClC,UAAM,MAAM,qBAAqB,CAAC;AAClC,QAAI,IAAI,mBAAmB,IAAI,gBAAgB;AAC7C,YAAM,IAAI,MAAM,uEAAuE,IAAI,cAAc,OAAO,IAAI,cAAc,IAAI;AAAA,IACxI;AACA,UAAM,SAAS,sBAAsB,KAAK,GAAG;AAC7C,WAAO;AAAA,MACL,YAAY,OAAO;AAAA,MACnB,UAAU,OAAO,SAAS,OAAO,QAAQ,IAAI,OAAO,WAAW;AAAA,MAC/D,QAAQ,kBAAkB,IAAI,cAAc,IAAI,IAAI,GAAG;AAAA,IACzD;AAAA,EACF;AACF;;;AChOA,SAAS,oBAAoB;AAItB,IAAM,eAA0B;AAAA,EACrC,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,MAAM,KAAK,OAAO;AAChB,QAAI,MAAM,UAAU,QAAW;AAC7B,YAAM,IAAI,MAAM,4BAA4B;AAAA,IAC9C;AACA,QAAI;AACJ,QAAI;AACF,eAAS,KAAK,MAAM,MAAM,MAAM,SAAS,MAAM,CAAC;AAAA,IAClD,QAAQ;AACN,YAAM,IAAI,MAAM,gCAAgC;AAAA,IAClD;AACA,WAAO,MAAM,aAAa,KAAK,MAAiC;AAAA,EAClE;AAAA,EACA,MAAM,QAAQ,GAAG,GAAG;AAClB,WAAO;AAAA,MACL,YAAY,MAAM,IAAI,IAAI;AAAA,MAC1B,UAAU,MAAM,IAAI,IAAI;AAAA,MACxB,QAAQ;AAAA,IACV;AAAA,EACF;AACF;;;ACdA,IAAM,WAA2C,IAAI,IAAI;AAAA,EACvD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,EAAE,IAAI,UAAQ,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC;AAEzB,SAAS,aAAa,MAAyB;AACpD,QAAM,OAAO,SAAS,IAAI,IAAI;AAC9B,MAAI,SAAS,QAAW;AACtB,UAAM,QAAQ,CAAC,GAAG,SAAS,KAAK,CAAC,EAAE,KAAK,IAAI;AAC5C,UAAM,IAAI,MAAM,sBAAsB,IAAI,aAAa,KAAK,EAAE;AAAA,EAChE;AACA,SAAO;AACT;AAEO,SAAS,iBAAoC;AAClD,SAAO,CAAC,GAAG,SAAS,KAAK,CAAC;AAC5B;","names":["spawn","sharp","require","sharp","randomBytes","readFile","rm","OS","PATH","PATH","OS","randomBytes","readFile","rm"]}

package/dist/actions/hash/algorithms/nilsimsa.mjs

@@ -1,27 +0,0 @@
-// src/actions/hash/algorithms/nilsimsa.ts
-import { Nilsimsa } from "nilsimsa";
-var nilsimsaAlgorithm = {
-  name: "nilsimsa",
-  family: "fuzzy-byte",
-  inputType: "bytes",
-  async hash(input) {
-    if (input.bytes === void 0) {
-      throw new Error("nilsimsa requires loaded bytes.");
-    }
-    const n = new Nilsimsa(input.bytes);
-    return n.digest("hex");
-  },
-  async compare(a, b) {
-    const raw = Nilsimsa.compare(a, b, "hex");
-    const similarity = Math.max(0, Math.min(1, (raw + 128) / 256));
-    return {
-      distance: 128 - raw,
-      similarity,
-      metric: "nilsimsa-score"
-    };
-  }
-};
-export {
-  nilsimsaAlgorithm
-};
-//# sourceMappingURL=nilsimsa.mjs.map

package/dist/actions/hash/algorithms/nilsimsa.mjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../../../src/actions/hash/algorithms/nilsimsa.ts"],"sourcesContent":["import { Nilsimsa } from 'nilsimsa'\n\nimport type { Algorithm } from './types.ts'\n\nexport const nilsimsaAlgorithm: Algorithm = {\n  name: 'nilsimsa',\n  family: 'fuzzy-byte',\n  inputType: 'bytes',\n  async hash(input) {\n    if (input.bytes === undefined) {\n      throw new Error('nilsimsa requires loaded bytes.')\n    }\n    const n = new Nilsimsa(input.bytes)\n    return n.digest('hex')\n  },\n  async compare(a, b) {\n    // Nilsimsa.compare returns a similarity score in [-128, 128].\n    // 128 = identical; 0 ≈ unrelated; -128 = perfectly anti-correlated.\n    const raw = Nilsimsa.compare(a, b, 'hex')\n    const similarity = Math.max(0, Math.min(1, (raw + 128) / 256))\n    return {\n      distance: 128 - raw, similarity, metric: 'nilsimsa-score',\n    }\n  },\n}\n"],"mappings":";AAAA,SAAS,gBAAgB;AAIlB,IAAM,oBAA+B;AAAA,EAC1C,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,MAAM,KAAK,OAAO;AAChB,QAAI,MAAM,UAAU,QAAW;AAC7B,YAAM,IAAI,MAAM,iCAAiC;AAAA,IACnD;AACA,UAAM,IAAI,IAAI,SAAS,MAAM,KAAK;AAClC,WAAO,EAAE,OAAO,KAAK;AAAA,EACvB;AAAA,EACA,MAAM,QAAQ,GAAG,GAAG;AAGlB,UAAM,MAAM,SAAS,QAAQ,GAAG,GAAG,KAAK;AACxC,UAAM,aAAa,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,MAAM,OAAO,GAAG,CAAC;AAC7D,WAAO;AAAA,MACL,UAAU,MAAM;AAAA,MAAK;AAAA,MAAY,QAAQ;AAAA,IAC3C;AAAA,EACF;AACF;","names":[]}

package/dist/actions/hash/algorithms/pdq.mjs

@@ -1,83 +0,0 @@
-// src/actions/hash/algorithms/pdq.ts
-import { createRequire } from "module";
-import sharp from "sharp";
-
-// src/actions/hash/lib/hamming.ts
-function popcount8(byte) {
-  let count = 0;
-  let value = byte & 255;
-  while (value !== 0) {
-    count += value & 1;
-    value >>>= 1;
-  }
-  return count;
-}
-function hammingHex(a, b) {
-  if (a.length !== b.length) {
-    throw new Error(`Hash length mismatch: ${a.length} vs ${b.length}`);
-  }
-  if (a.length % 2 !== 0) {
-    throw new Error(`Hash hex length must be even, got ${a.length}`);
-  }
-  let dist = 0;
-  for (let i = 0; i < a.length; i += 2) {
-    const xa = Number.parseInt(a.slice(i, i + 2), 16);
-    const xb = Number.parseInt(b.slice(i, i + 2), 16);
-    if (Number.isNaN(xa) || Number.isNaN(xb)) {
-      throw new TypeError(`Invalid hex at position ${i}: '${a.slice(i, i + 2)}' / '${b.slice(i, i + 2)}'`);
-    }
-    dist += popcount8(xa ^ xb);
-  }
-  return dist;
-}
-
-// src/actions/hash/algorithms/pdq.ts
-var require2 = createRequire(import.meta.url);
-var { PDQ } = require2("pdq-wasm");
-var initialized = false;
-async function ensureInit() {
-  if (initialized) return;
-  await PDQ.init();
-  initialized = true;
-}
-async function toRgbRaw(source) {
-  const { data, info } = await sharp(source).removeAlpha().raw().toBuffer({ resolveWithObject: true });
-  return {
-    data: new Uint8Array(data.buffer, data.byteOffset, data.byteLength),
-    width: info.width,
-    height: info.height
-  };
-}
-var pdqAlgorithm = {
-  name: "pdq",
-  family: "perceptual-image",
-  inputType: "image",
-  async hash(input) {
-    const source = input.path ?? input.bytes;
-    if (source === void 0) {
-      throw new Error("pdq requires bytes or a path.");
-    }
-    await ensureInit();
-    const rgb = await toRgbRaw(source);
-    const result = PDQ.hash({
-      data: rgb.data,
-      width: rgb.width,
-      height: rgb.height,
-      channels: 3
-    });
-    return PDQ.toHex(result.hash);
-  },
-  async compare(a, b) {
-    const dist = hammingHex(a, b);
-    const bits = a.length / 2 * 8;
-    return {
-      distance: dist,
-      similarity: 1 - dist / bits,
-      metric: `hamming-${bits}`
-    };
-  }
-};
-export {
-  pdqAlgorithm
-};
-//# sourceMappingURL=pdq.mjs.map

package/dist/actions/hash/algorithms/pdq.mjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../../../src/actions/hash/algorithms/pdq.ts","../../../../src/actions/hash/lib/hamming.ts"],"sourcesContent":["import { createRequire } from 'node:module'\n\nimport sharp from 'sharp'\n\nimport { hammingHex } from '../lib/hamming.ts'\nimport type { Algorithm } from './types.ts'\n\n/**\n * pdq-wasm ships a CommonJS entry that uses `require` to load its bundled WASM file.\n * Aries is ESM, so we use `createRequire` to bridge — this picks the CJS dist via the\n * package's `exports.require` condition, which can resolve the relative WASM path.\n */\nconst require = createRequire(import.meta.url)\ninterface PDQHashResult { hash: Uint8Array; quality: number }\ninterface PDQModule {\n  init(): Promise<void>\n  hash(input: { data: Uint8Array; width: number; height: number; channels: 1 | 3 }): PDQHashResult\n  toHex(hash: Uint8Array): string\n}\nconst { PDQ } = require('pdq-wasm') as { PDQ: PDQModule }\n\nlet initialized = false\nasync function ensureInit(): Promise<void> {\n  if (initialized) return\n  await PDQ.init()\n  initialized = true\n}\n\n/**\n * Decode the input image to RGB raw bytes that pdq-wasm can consume directly.\n * sharp handles JPEG/PNG/WebP/AVIF/etc. transparently.\n */\nasync function toRgbRaw(source: Buffer | string): Promise<{ data: Uint8Array; width: number; height: number }> {\n  const { data, info } = await sharp(source).removeAlpha().raw().toBuffer({ resolveWithObject: true })\n  return {\n    data: new Uint8Array(data.buffer, data.byteOffset, data.byteLength),\n    width: info.width,\n    height: info.height,\n  }\n}\n\nexport const pdqAlgorithm: Algorithm = {\n  name: 'pdq',\n  family: 'perceptual-image',\n  inputType: 'image',\n  async hash(input) {\n    const source = input.path ?? input.bytes\n    if (source === undefined) {\n      throw new Error('pdq requires bytes or a path.')\n    }\n    await ensureInit()\n    const rgb = await toRgbRaw(source)\n    const result = PDQ.hash({\n      data: rgb.data, width: rgb.width, height: rgb.height, channels: 3,\n    })\n    return PDQ.toHex(result.hash)\n  },\n  async compare(a, b) {\n    const dist = hammingHex(a, b)\n    const bits = (a.length / 2) * 8\n    return {\n      distance: dist, similarity: 1 - dist / bits, metric: `hamming-${bits}`,\n    }\n  },\n}\n","/**\n * Population count for an 8-bit value (number of set bits).\n */\nfunction popcount8(byte: number): number {\n  let count = 0\n  let value = byte & 0xff\n  while (value !== 0) {\n    count += value & 1\n    value >>>= 1\n  }\n  return count\n}\n\n/**\n * Hamming distance between two equal-length lowercase-hex strings.\n * Throws when the lengths differ.\n */\nexport function hammingHex(a: string, b: string): number {\n  if (a.length !== b.length) {\n    throw new Error(`Hash length mismatch: ${a.length} vs ${b.length}`)\n  }\n  if (a.length % 2 !== 0) {\n    throw new Error(`Hash hex length must be even, got ${a.length}`)\n  }\n  let dist = 0\n  for (let i = 0; i < a.length; i += 2) {\n    const xa = Number.parseInt(a.slice(i, i + 2), 16)\n    const xb = Number.parseInt(b.slice(i, i + 2), 16)\n    if (Number.isNaN(xa) || Number.isNaN(xb)) {\n      throw new TypeError(`Invalid hex at position ${i}: '${a.slice(i, i + 2)}' / '${b.slice(i, i + 2)}'`)\n    }\n    dist += popcount8(xa ^ xb)\n  }\n  return dist\n}\n\n/**\n * Bit-length of an even-length hex string.\n */\nexport function bitLengthHex(hex: string): number {\n  return (hex.length / 2) * 8\n}\n\n/**\n * Population count for a 32-bit unsigned value (number of set bits).\n * Uses the parallel-prefix bit trick.\n */\nexport function popcount32(value: number): number {\n  let v = Math.trunc(value)\n  v = v - ((v >>> 1) & 0x55_55_55_55)\n  v = (v & 0x33_33_33_33) + ((v >>> 2) & 0x33_33_33_33)\n  v = (v + (v >>> 4)) & 0x0f_0f_0f_0f\n  return ((v * 0x01_01_01_01) >>> 24) & 0xff\n}\n"],"mappings":";AAAA,SAAS,qBAAqB;AAE9B,OAAO,WAAW;;;ACClB,SAAS,UAAU,MAAsB;AACvC,MAAI,QAAQ;AACZ,MAAI,QAAQ,OAAO;AACnB,SAAO,UAAU,GAAG;AAClB,aAAS,QAAQ;AACjB,eAAW;AAAA,EACb;AACA,SAAO;AACT;AAMO,SAAS,WAAW,GAAW,GAAmB;AACvD,MAAI,EAAE,WAAW,EAAE,QAAQ;AACzB,UAAM,IAAI,MAAM,yBAAyB,EAAE,MAAM,OAAO,EAAE,MAAM,EAAE;AAAA,EACpE;AACA,MAAI,EAAE,SAAS,MAAM,GAAG;AACtB,UAAM,IAAI,MAAM,qCAAqC,EAAE,MAAM,EAAE;AAAA,EACjE;AACA,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,GAAG;AACpC,UAAM,KAAK,OAAO,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE;AAChD,UAAM,KAAK,OAAO,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE;AAChD,QAAI,OAAO,MAAM,EAAE,KAAK,OAAO,MAAM,EAAE,GAAG;AACxC,YAAM,IAAI,UAAU,2BAA2B,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC,GAAG;AAAA,IACrG;AACA,YAAQ,UAAU,KAAK,EAAE;AAAA,EAC3B;AACA,SAAO;AACT;;;ADtBA,IAAMA,WAAU,cAAc,YAAY,GAAG;AAO7C,IAAM,EAAE,IAAI,IAAIA,SAAQ,UAAU;AAElC,IAAI,cAAc;AAClB,eAAe,aAA4B;AACzC,MAAI,YAAa;AACjB,QAAM,IAAI,KAAK;AACf,gBAAc;AAChB;AAMA,eAAe,SAAS,QAAuF;AAC7G,QAAM,EAAE,MAAM,KAAK,IAAI,MAAM,MAAM,MAAM,EAAE,YAAY,EAAE,IAAI,EAAE,SAAS,EAAE,mBAAmB,KAAK,CAAC;AACnG,SAAO;AAAA,IACL,MAAM,IAAI,WAAW,KAAK,QAAQ,KAAK,YAAY,KAAK,UAAU;AAAA,IAClE,OAAO,KAAK;AAAA,IACZ,QAAQ,KAAK;AAAA,EACf;AACF;AAEO,IAAM,eAA0B;AAAA,EACrC,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,MAAM,KAAK,OAAO;AAChB,UAAM,SAAS,MAAM,QAAQ,MAAM;AACnC,QAAI,WAAW,QAAW;AACxB,YAAM,IAAI,MAAM,+BAA+B;AAAA,IACjD;AACA,UAAM,WAAW;AACjB,UAAM,MAAM,MAAM,SAAS,MAAM;AACjC,UAAM,SAAS,IAAI,KAAK;AAAA,MACtB,MAAM,IAAI;AAAA,MAAM,OAAO,IAAI;AAAA,MAAO,QAAQ,IAAI;AAAA,MAAQ,UAAU;AAAA,IAClE,CAAC;AACD,WAAO,IAAI,MAAM,OAAO,IAAI;AAAA,EAC9B;AAAA,EACA,MAAM,QAAQ,GAAG,GAAG;AAClB,UAAM,OAAO,WAAW,GAAG,CAAC;AAC5B,UAAM,OAAQ,EAAE,SAAS,IAAK;AAC9B,WAAO;AAAA,MACL,UAAU;AAAA,MAAM,YAAY,IAAI,OAAO;AAAA,MAAM,QAAQ,WAAW,IAAI;AAAA,IACtE;AAAA,EACF;AACF;","names":["require"]}

package/dist/actions/hash/algorithms/phash.mjs

@@ -1,71 +0,0 @@
-// src/actions/hash/algorithms/phash.ts
-import phashLib from "sharp-phash";
-
-// src/actions/hash/lib/hamming.ts
-function popcount8(byte) {
-  let count = 0;
-  let value = byte & 255;
-  while (value !== 0) {
-    count += value & 1;
-    value >>>= 1;
-  }
-  return count;
-}
-function hammingHex(a, b) {
-  if (a.length !== b.length) {
-    throw new Error(`Hash length mismatch: ${a.length} vs ${b.length}`);
-  }
-  if (a.length % 2 !== 0) {
-    throw new Error(`Hash hex length must be even, got ${a.length}`);
-  }
-  let dist = 0;
-  for (let i = 0; i < a.length; i += 2) {
-    const xa = Number.parseInt(a.slice(i, i + 2), 16);
-    const xb = Number.parseInt(b.slice(i, i + 2), 16);
-    if (Number.isNaN(xa) || Number.isNaN(xb)) {
-      throw new TypeError(`Invalid hex at position ${i}: '${a.slice(i, i + 2)}' / '${b.slice(i, i + 2)}'`);
-    }
-    dist += popcount8(xa ^ xb);
-  }
-  return dist;
-}
-
-// src/actions/hash/algorithms/phash.ts
-var phash = phashLib;
-function binaryToHex(bin) {
-  if (!/^[01]+$/.test(bin)) {
-    throw new TypeError(`phash returned unexpected output: ${bin.slice(0, 20)}\u2026`);
-  }
-  const padded = bin.padStart(Math.ceil(bin.length / 4) * 4, "0");
-  let hex = "";
-  for (let i = 0; i < padded.length; i += 4) {
-    hex += Number.parseInt(padded.slice(i, i + 4), 2).toString(16);
-  }
-  return hex;
-}
-var phashAlgorithm = {
-  name: "phash",
-  family: "perceptual-image",
-  inputType: "image",
-  async hash(input) {
-    const source = input.path ?? input.bytes;
-    if (source === void 0) {
-      throw new Error("phash requires bytes or a path.");
-    }
-    const bin = await phash(source);
-    return binaryToHex(bin);
-  },
-  async compare(a, b) {
-    const dist = hammingHex(a, b);
-    const bits = a.length / 2 * 8;
-    return {
-      distance: dist,
-      similarity: 1 - dist / bits,
-      metric: `hamming-${bits}`
-    };
-  }
-};
-export {
-  phashAlgorithm
-};
-//# sourceMappingURL=phash.mjs.map

package/dist/actions/hash/algorithms/phash.mjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../../../src/actions/hash/algorithms/phash.ts","../../../../src/actions/hash/lib/hamming.ts"],"sourcesContent":["import phashLib from 'sharp-phash'\n\nimport { hammingHex } from '../lib/hamming.ts'\nimport type { Algorithm } from './types.ts'\n\nconst phash = phashLib as unknown as (image: Buffer | string) => Promise<string>\n\n/**\n * sharp-phash returns a 64-character '01' binary string. We pack it into 16-char hex\n * for parity with the other perceptual image algorithms.\n */\nfunction binaryToHex(bin: string): string {\n  if (!/^[01]+$/.test(bin)) {\n    throw new TypeError(`phash returned unexpected output: ${bin.slice(0, 20)}…`)\n  }\n  const padded = bin.padStart(Math.ceil(bin.length / 4) * 4, '0')\n  let hex = ''\n  for (let i = 0; i < padded.length; i += 4) {\n    hex += Number.parseInt(padded.slice(i, i + 4), 2).toString(16)\n  }\n  return hex\n}\n\nexport const phashAlgorithm: Algorithm = {\n  name: 'phash',\n  family: 'perceptual-image',\n  inputType: 'image',\n  async hash(input) {\n    const source = input.path ?? input.bytes\n    if (source === undefined) {\n      throw new Error('phash requires bytes or a path.')\n    }\n    const bin = await phash(source)\n    return binaryToHex(bin)\n  },\n  async compare(a, b) {\n    const dist = hammingHex(a, b)\n    const bits = (a.length / 2) * 8\n    return {\n      distance: dist, similarity: 1 - dist / bits, metric: `hamming-${bits}`,\n    }\n  },\n}\n","/**\n * Population count for an 8-bit value (number of set bits).\n */\nfunction popcount8(byte: number): number {\n  let count = 0\n  let value = byte & 0xff\n  while (value !== 0) {\n    count += value & 1\n    value >>>= 1\n  }\n  return count\n}\n\n/**\n * Hamming distance between two equal-length lowercase-hex strings.\n * Throws when the lengths differ.\n */\nexport function hammingHex(a: string, b: string): number {\n  if (a.length !== b.length) {\n    throw new Error(`Hash length mismatch: ${a.length} vs ${b.length}`)\n  }\n  if (a.length % 2 !== 0) {\n    throw new Error(`Hash hex length must be even, got ${a.length}`)\n  }\n  let dist = 0\n  for (let i = 0; i < a.length; i += 2) {\n    const xa = Number.parseInt(a.slice(i, i + 2), 16)\n    const xb = Number.parseInt(b.slice(i, i + 2), 16)\n    if (Number.isNaN(xa) || Number.isNaN(xb)) {\n      throw new TypeError(`Invalid hex at position ${i}: '${a.slice(i, i + 2)}' / '${b.slice(i, i + 2)}'`)\n    }\n    dist += popcount8(xa ^ xb)\n  }\n  return dist\n}\n\n/**\n * Bit-length of an even-length hex string.\n */\nexport function bitLengthHex(hex: string): number {\n  return (hex.length / 2) * 8\n}\n\n/**\n * Population count for a 32-bit unsigned value (number of set bits).\n * Uses the parallel-prefix bit trick.\n */\nexport function popcount32(value: number): number {\n  let v = Math.trunc(value)\n  v = v - ((v >>> 1) & 0x55_55_55_55)\n  v = (v & 0x33_33_33_33) + ((v >>> 2) & 0x33_33_33_33)\n  v = (v + (v >>> 4)) & 0x0f_0f_0f_0f\n  return ((v * 0x01_01_01_01) >>> 24) & 0xff\n}\n"],"mappings":";AAAA,OAAO,cAAc;;;ACGrB,SAAS,UAAU,MAAsB;AACvC,MAAI,QAAQ;AACZ,MAAI,QAAQ,OAAO;AACnB,SAAO,UAAU,GAAG;AAClB,aAAS,QAAQ;AACjB,eAAW;AAAA,EACb;AACA,SAAO;AACT;AAMO,SAAS,WAAW,GAAW,GAAmB;AACvD,MAAI,EAAE,WAAW,EAAE,QAAQ;AACzB,UAAM,IAAI,MAAM,yBAAyB,EAAE,MAAM,OAAO,EAAE,MAAM,EAAE;AAAA,EACpE;AACA,MAAI,EAAE,SAAS,MAAM,GAAG;AACtB,UAAM,IAAI,MAAM,qCAAqC,EAAE,MAAM,EAAE;AAAA,EACjE;AACA,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,GAAG;AACpC,UAAM,KAAK,OAAO,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE;AAChD,UAAM,KAAK,OAAO,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE;AAChD,QAAI,OAAO,MAAM,EAAE,KAAK,OAAO,MAAM,EAAE,GAAG;AACxC,YAAM,IAAI,UAAU,2BAA2B,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC,GAAG;AAAA,IACrG;AACA,YAAQ,UAAU,KAAK,EAAE;AAAA,EAC3B;AACA,SAAO;AACT;;;AD7BA,IAAM,QAAQ;AAMd,SAAS,YAAY,KAAqB;AACxC,MAAI,CAAC,UAAU,KAAK,GAAG,GAAG;AACxB,UAAM,IAAI,UAAU,qCAAqC,IAAI,MAAM,GAAG,EAAE,CAAC,QAAG;AAAA,EAC9E;AACA,QAAM,SAAS,IAAI,SAAS,KAAK,KAAK,IAAI,SAAS,CAAC,IAAI,GAAG,GAAG;AAC9D,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG;AACzC,WAAO,OAAO,SAAS,OAAO,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,SAAS,EAAE;AAAA,EAC/D;AACA,SAAO;AACT;AAEO,IAAM,iBAA4B;AAAA,EACvC,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,MAAM,KAAK,OAAO;AAChB,UAAM,SAAS,MAAM,QAAQ,MAAM;AACnC,QAAI,WAAW,QAAW;AACxB,YAAM,IAAI,MAAM,iCAAiC;AAAA,IACnD;AACA,UAAM,MAAM,MAAM,MAAM,MAAM;AAC9B,WAAO,YAAY,GAAG;AAAA,EACxB;AAAA,EACA,MAAM,QAAQ,GAAG,GAAG;AAClB,UAAM,OAAO,WAAW,GAAG,CAAC;AAC5B,UAAM,OAAQ,EAAE,SAAS,IAAK;AAC9B,WAAO;AAAA,MACL,UAAU;AAAA,MAAM,YAAY,IAAI,OAAO;AAAA,MAAM,QAAQ,WAAW,IAAI;AAAA,IACtE;AAAA,EACF;AACF;","names":[]}

package/dist/actions/hash/algorithms/sha256.mjs

@@ -1,24 +0,0 @@
-// src/actions/hash/algorithms/sha256.ts
-import { createHash } from "crypto";
-var sha256Algorithm = {
-  name: "sha256",
-  family: "strict",
-  inputType: "bytes",
-  async hash(input) {
-    if (input.bytes === void 0) {
-      throw new Error("sha256 requires loaded bytes.");
-    }
-    return createHash("sha256").update(input.bytes).digest("hex");
-  },
-  async compare(a, b) {
-    return {
-      similarity: a === b ? 1 : 0,
-      distance: a === b ? 0 : 1,
-      metric: "exact-match"
-    };
-  }
-};
-export {
-  sha256Algorithm
-};
-//# sourceMappingURL=sha256.mjs.map

package/dist/actions/hash/algorithms/sha256.mjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../../../src/actions/hash/algorithms/sha256.ts"],"sourcesContent":["import { createHash } from 'node:crypto'\n\nimport type { Algorithm } from './types.ts'\n\nexport const sha256Algorithm: Algorithm = {\n  name: 'sha256',\n  family: 'strict',\n  inputType: 'bytes',\n  async hash(input) {\n    if (input.bytes === undefined) {\n      throw new Error('sha256 requires loaded bytes.')\n    }\n    return createHash('sha256').update(input.bytes).digest('hex')\n  },\n  async compare(a, b) {\n    return {\n      similarity: a === b ? 1 : 0,\n      distance: a === b ? 0 : 1,\n      metric: 'exact-match',\n    }\n  },\n}\n"],"mappings":";AAAA,SAAS,kBAAkB;AAIpB,IAAM,kBAA6B;AAAA,EACxC,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,MAAM,KAAK,OAAO;AAChB,QAAI,MAAM,UAAU,QAAW;AAC7B,YAAM,IAAI,MAAM,+BAA+B;AAAA,IACjD;AACA,WAAO,WAAW,QAAQ,EAAE,OAAO,MAAM,KAAK,EAAE,OAAO,KAAK;AAAA,EAC9D;AAAA,EACA,MAAM,QAAQ,GAAG,GAAG;AAClB,WAAO;AAAA,MACL,YAAY,MAAM,IAAI,IAAI;AAAA,MAC1B,UAAU,MAAM,IAAI,IAAI;AAAA,MACxB,QAAQ;AAAA,IACV;AAAA,EACF;AACF;","names":[]}

package/dist/actions/hash/algorithms/ssdeep.mjs

@@ -1,203 +0,0 @@
-// src/actions/hash/lib/levenshtein.ts
-function levenshtein(a, b) {
-  if (a === b) return 0;
-  if (a.length === 0) return b.length;
-  if (b.length === 0) return a.length;
-  let s1 = a;
-  let s2 = b;
-  if (s1.length < s2.length) {
-    const tmp = s1;
-    s1 = s2;
-    s2 = tmp;
-  }
-  const m = s1.length;
-  const n = s2.length;
-  let prev = Array.from({ length: n + 1 }, (_, j) => j);
-  let curr = Array.from({ length: n + 1 }, () => 0);
-  for (let i = 1; i <= m; i++) {
-    curr[0] = i;
-    const cp1 = s1.codePointAt(i - 1);
-    for (let j = 1; j <= n; j++) {
-      const cost = cp1 === s2.codePointAt(j - 1) ? 0 : 1;
-      const del = prev[j] + 1;
-      const ins = curr[j - 1] + 1;
-      const sub = prev[j - 1] + cost;
-      curr[j] = Math.min(del, ins, sub);
-    }
-    const tmp = prev;
-    prev = curr;
-    curr = tmp;
-  }
-  return prev[n];
-}
-
-// src/actions/hash/lib/runBinary.ts
-import { spawn } from "child_process";
-async function runBinary(options) {
-  const maxBytes = options.maxBytes ?? 64 * 1024 * 1024;
-  return await new Promise((resolve, reject) => {
-    const child = spawn(options.binary, [...options.args ?? []], { stdio: ["pipe", "pipe", "pipe"] });
-    const stdoutChunks = [];
-    let stdoutBytes = 0;
-    let stderr = "";
-    let killedForOverflow = false;
-    child.stdout.on("data", (chunk) => {
-      stdoutBytes += chunk.length;
-      if (stdoutBytes > maxBytes) {
-        if (!killedForOverflow) {
-          killedForOverflow = true;
-          child.kill("SIGKILL");
-        }
-        return;
-      }
-      stdoutChunks.push(chunk);
-    });
-    child.stderr.on("data", (chunk) => {
-      stderr += chunk.toString("utf8");
-    });
-    child.on("error", (err) => reject(err));
-    child.on("close", (code) => {
-      if (killedForOverflow) {
-        reject(new Error(`${options.binary} stdout exceeded ${maxBytes} bytes`));
-        return;
-      }
-      const exitCode = code ?? -1;
-      const stdout = Buffer.concat(stdoutChunks);
-      if (exitCode !== 0) {
-        const tail = stderr.trim().split(/\r?\n/).slice(-3).join("\n");
-        reject(new Error(`${options.binary} exited ${exitCode}${tail.length > 0 ? `: ${tail}` : ""}`));
-        return;
-      }
-      resolve({
-        stdout,
-        stderr,
-        exitCode
-      });
-    });
-    if (options.stdin === void 0) {
-      child.stdin.end();
-    } else {
-      child.stdin.end(options.stdin);
-    }
-  });
-}
-
-// src/actions/hash/lib/which.ts
-import { spawn as spawn2 } from "child_process";
-async function which(binary) {
-  return await new Promise((resolve) => {
-    const cmd = process.platform === "win32" ? "where" : "command";
-    const args = process.platform === "win32" ? [binary] : ["-v", binary];
-    const child = spawn2(cmd, args, { shell: process.platform !== "win32" });
-    let stdout = "";
-    child.stdout.on("data", (chunk) => {
-      stdout += chunk.toString("utf8");
-    });
-    child.on("error", () => resolve(null));
-    child.on("close", (code) => {
-      if (code === 0) {
-        const path = stdout.split(/\r?\n/).find((line) => line.trim().length > 0)?.trim() ?? null;
-        resolve(path);
-      } else {
-        resolve(null);
-      }
-    });
-  });
-}
-async function requireBinary(req) {
-  const path = await which(req.binary);
-  if (path !== null) return path;
-  const lines = [`${req.binary} binary not found on PATH. Install with:`];
-  if (req.install.brew !== void 0) lines.push(`  macOS:   brew install ${req.install.brew}`);
-  if (req.install.apt !== void 0) lines.push(`  Debian:  apt install ${req.install.apt}`);
-  if (req.install.choco !== void 0) lines.push(`  Windows: choco install ${req.install.choco}`);
-  throw new Error(lines.join("\n"));
-}
-
-// src/actions/hash/algorithms/ssdeep.ts
-var SSDEEP_BIN = {
-  binary: "ssdeep",
-  install: {
-    brew: "ssdeep",
-    apt: "ssdeep",
-    choco: "ssdeep"
-  }
-};
-function parseSsdeepHash(raw) {
-  const cleaned = raw.replace(/,.*$/u, "").trim();
-  const parts = cleaned.split(":");
-  if (parts.length < 3) {
-    throw new Error(`Invalid ssdeep hash: ${raw}`);
-  }
-  const blockSize = Number.parseInt(parts[0], 10);
-  if (!Number.isFinite(blockSize) || blockSize <= 0) {
-    throw new Error(`Invalid ssdeep block size: ${parts[0]}`);
-  }
-  return {
-    blockSize,
-    h1: parts[1],
-    h2: parts[2]
-  };
-}
-function levenshteinSimilarity(a, b) {
-  if (a.length === 0 && b.length === 0) return 1;
-  const dist = levenshtein(a, b);
-  const maxLen = Math.max(a.length, b.length, 1);
-  return Math.max(0, 1 - dist / maxLen);
-}
-function ssdeepSimilarity(rawA, rawB) {
-  const a = parseSsdeepHash(rawA);
-  const b = parseSsdeepHash(rawB);
-  if (a.blockSize === b.blockSize) {
-    const s1 = levenshteinSimilarity(a.h1, b.h1);
-    const s2 = levenshteinSimilarity(a.h2, b.h2);
-    const similarity = Math.max(s1, s2);
-    const distance = Math.round((1 - similarity) * Math.max(a.h1.length, b.h1.length, a.h2.length, b.h2.length));
-    return { similarity, distance };
-  }
-  if (a.blockSize === b.blockSize * 2) {
-    const similarity = levenshteinSimilarity(a.h2, b.h1);
-    return { similarity, distance: Math.round((1 - similarity) * Math.max(a.h2.length, b.h1.length)) };
-  }
-  if (b.blockSize === a.blockSize * 2) {
-    const similarity = levenshteinSimilarity(a.h1, b.h2);
-    return { similarity, distance: Math.round((1 - similarity) * Math.max(a.h1.length, b.h2.length)) };
-  }
-  return { similarity: 0, distance: Number.NaN };
-}
-var ssdeepAlgorithm = {
-  name: "ssdeep",
-  family: "fuzzy-byte",
-  inputType: "bytes",
-  requires: [SSDEEP_BIN],
-  async hash(input) {
-    if (input.bytes === void 0) {
-      throw new Error("ssdeep requires loaded bytes.");
-    }
-    await requireBinary(SSDEEP_BIN);
-    const { stdout } = await runBinary({
-      binary: "ssdeep",
-      args: ["-b", "-s"],
-      stdin: input.bytes
-    });
-    const text = stdout.toString("utf8");
-    const lines = text.split(/\r?\n/).map((l) => l.trim()).filter((l) => l.length > 0);
-    const hashLine = lines.find((l) => !l.startsWith("ssdeep,")) ?? lines.at(-1);
-    if (hashLine === void 0) {
-      throw new Error("ssdeep produced no output.");
-    }
-    return hashLine.replace(/,.*$/u, "");
-  },
-  async compare(a, b) {
-    const { similarity, distance } = ssdeepSimilarity(a, b);
-    return {
-      similarity,
-      distance: Number.isFinite(distance) ? distance : void 0,
-      metric: "ssdeep-levenshtein"
-    };
-  }
-};
-export {
-  ssdeepAlgorithm
-};
-//# sourceMappingURL=ssdeep.mjs.map

package/dist/actions/hash/algorithms/ssdeep.mjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../../../src/actions/hash/lib/levenshtein.ts","../../../../src/actions/hash/lib/runBinary.ts","../../../../src/actions/hash/lib/which.ts","../../../../src/actions/hash/algorithms/ssdeep.ts"],"sourcesContent":["/**\n * Standard Levenshtein edit distance between two strings.\n * O(m·n) time, O(min(m,n)) space.\n */\nexport function levenshtein(a: string, b: string): number {\n  if (a === b) return 0\n  if (a.length === 0) return b.length\n  if (b.length === 0) return a.length\n\n  // Make `s1` the longer string so the row width is min(m,n)+1.\n  let s1 = a\n  let s2 = b\n  if (s1.length < s2.length) {\n    const tmp = s1\n    s1 = s2\n    s2 = tmp\n  }\n\n  const m = s1.length\n  const n = s2.length\n  let prev: number[] = Array.from({ length: n + 1 }, (_, j) => j)\n  let curr: number[] = Array.from({ length: n + 1 }, () => 0)\n\n  for (let i = 1; i <= m; i++) {\n    curr[0] = i\n    const cp1 = s1.codePointAt(i - 1)\n    for (let j = 1; j <= n; j++) {\n      const cost = cp1 === s2.codePointAt(j - 1) ? 0 : 1\n      const del = prev[j] + 1\n      const ins = curr[j - 1] + 1\n      const sub = prev[j - 1] + cost\n      curr[j] = Math.min(del, ins, sub)\n    }\n    const tmp = prev\n    prev = curr\n    curr = tmp\n  }\n  return prev[n]\n}\n","import { spawn } from 'node:child_process'\n\nexport interface RunBinaryOptions {\n  binary: string\n  args?: readonly string[]\n  /** When provided, written to the child's stdin and stdin is closed. */\n  stdin?: Buffer\n  /** When true, the child's stdout is captured as a Buffer. Otherwise as utf8. */\n  binaryOutput?: boolean\n  /** Cap stdout capture at this many bytes. Default 64 MiB. */\n  maxBytes?: number\n}\n\nexport interface RunBinaryResult {\n  stdout: Buffer\n  stderr: string\n  exitCode: number\n}\n\n/**\n * Spawn a binary, optionally write to its stdin, and capture stdout/stderr.\n * Throws if the child exits non-zero.\n */\nexport async function runBinary(options: RunBinaryOptions): Promise<RunBinaryResult> {\n  const maxBytes = options.maxBytes ?? 64 * 1024 * 1024\n  return await new Promise((resolve, reject) => {\n    const child = spawn(options.binary, [...(options.args ?? [])], { stdio: ['pipe', 'pipe', 'pipe'] })\n\n    const stdoutChunks: Buffer[] = []\n    let stdoutBytes = 0\n    let stderr = ''\n    let killedForOverflow = false\n\n    child.stdout.on('data', (chunk: Buffer) => {\n      stdoutBytes += chunk.length\n      if (stdoutBytes > maxBytes) {\n        if (!killedForOverflow) {\n          killedForOverflow = true\n          child.kill('SIGKILL')\n        }\n        return\n      }\n      stdoutChunks.push(chunk)\n    })\n    child.stderr.on('data', (chunk: Buffer) => {\n      stderr += chunk.toString('utf8')\n    })\n\n    child.on('error', err => reject(err))\n    child.on('close', (code) => {\n      if (killedForOverflow) {\n        reject(new Error(`${options.binary} stdout exceeded ${maxBytes} bytes`))\n        return\n      }\n      const exitCode = code ?? -1\n      const stdout = Buffer.concat(stdoutChunks)\n      if (exitCode !== 0) {\n        const tail = stderr.trim().split(/\\r?\\n/).slice(-3).join('\\n')\n        reject(new Error(`${options.binary} exited ${exitCode}${tail.length > 0 ? `: ${tail}` : ''}`))\n        return\n      }\n      resolve({\n        stdout, stderr, exitCode,\n      })\n    })\n\n    if (options.stdin === undefined) {\n      child.stdin.end()\n    } else {\n      child.stdin.end(options.stdin)\n    }\n  })\n}\n","import { spawn } from 'node:child_process'\n\nimport type { RequiredBinary } from '../algorithms/types.ts'\n\n/**\n * Resolve a binary name to its absolute path on the user's PATH.\n * Returns null if not found.\n */\nexport async function which(binary: string): Promise<string | null> {\n  return await new Promise((resolve) => {\n    const cmd = process.platform === 'win32' ? 'where' : 'command'\n    const args = process.platform === 'win32' ? [binary] : ['-v', binary]\n    const child = spawn(cmd, args, { shell: process.platform !== 'win32' })\n\n    let stdout = ''\n    child.stdout.on('data', (chunk: Buffer) => {\n      stdout += chunk.toString('utf8')\n    })\n    child.on('error', () => resolve(null))\n    child.on('close', (code) => {\n      if (code === 0) {\n        const path = stdout.split(/\\r?\\n/).find(line => line.trim().length > 0)?.trim() ?? null\n        resolve(path)\n      } else {\n        resolve(null)\n      }\n    })\n  })\n}\n\n/**\n * Throw a clearly-actionable error when a required binary is missing.\n */\nexport async function requireBinary(req: RequiredBinary): Promise<string> {\n  const path = await which(req.binary)\n  if (path !== null) return path\n  const lines = [`${req.binary} binary not found on PATH. Install with:`]\n  if (req.install.brew !== undefined) lines.push(`  macOS:   brew install ${req.install.brew}`)\n  if (req.install.apt !== undefined) lines.push(`  Debian:  apt install ${req.install.apt}`)\n  if (req.install.choco !== undefined) lines.push(`  Windows: choco install ${req.install.choco}`)\n  throw new Error(lines.join('\\n'))\n}\n","import { levenshtein } from '../lib/levenshtein.ts'\nimport { runBinary } from '../lib/runBinary.ts'\nimport { requireBinary } from '../lib/which.ts'\nimport type { Algorithm, RequiredBinary } from './types.ts'\n\nconst SSDEEP_BIN: RequiredBinary = {\n  binary: 'ssdeep',\n  install: {\n    brew: 'ssdeep',\n    apt: 'ssdeep',\n    choco: 'ssdeep',\n  },\n}\n\n/**\n * Parse an ssdeep hash of the form `<block_size>:<h1>:<h2>` (filename suffix is dropped).\n */\nfunction parseSsdeepHash(raw: string): { blockSize: number; h1: string; h2: string } {\n  const cleaned = raw.replace(/,.*$/u, '').trim()\n  const parts = cleaned.split(':')\n  if (parts.length < 3) {\n    throw new Error(`Invalid ssdeep hash: ${raw}`)\n  }\n  const blockSize = Number.parseInt(parts[0], 10)\n  if (!Number.isFinite(blockSize) || blockSize <= 0) {\n    throw new Error(`Invalid ssdeep block size: ${parts[0]}`)\n  }\n  return {\n    blockSize, h1: parts[1], h2: parts[2],\n  }\n}\n\nfunction levenshteinSimilarity(a: string, b: string): number {\n  if (a.length === 0 && b.length === 0) return 1\n  const dist = levenshtein(a, b)\n  const maxLen = Math.max(a.length, b.length, 1)\n  return Math.max(0, 1 - dist / maxLen)\n}\n\n/**\n * Approximate ssdeep similarity using Levenshtein on whichever sub-hash pair shares a\n * compatible block size (1×, 2×, or 0.5×). Returns 0 if block sizes are incompatible.\n *\n * This is NOT the canonical ssdeep score — that algorithm applies a block-size\n * attenuation curve we don't replicate here. The metric label `ssdeep-levenshtein`\n * makes that explicit.\n */\nfunction ssdeepSimilarity(rawA: string, rawB: string): { similarity: number; distance: number } {\n  const a = parseSsdeepHash(rawA)\n  const b = parseSsdeepHash(rawB)\n  if (a.blockSize === b.blockSize) {\n    const s1 = levenshteinSimilarity(a.h1, b.h1)\n    const s2 = levenshteinSimilarity(a.h2, b.h2)\n    const similarity = Math.max(s1, s2)\n    const distance = Math.round((1 - similarity) * Math.max(a.h1.length, b.h1.length, a.h2.length, b.h2.length))\n    return { similarity, distance }\n  }\n  if (a.blockSize === b.blockSize * 2) {\n    const similarity = levenshteinSimilarity(a.h2, b.h1)\n    return { similarity, distance: Math.round((1 - similarity) * Math.max(a.h2.length, b.h1.length)) }\n  }\n  if (b.blockSize === a.blockSize * 2) {\n    const similarity = levenshteinSimilarity(a.h1, b.h2)\n    return { similarity, distance: Math.round((1 - similarity) * Math.max(a.h1.length, b.h2.length)) }\n  }\n  return { similarity: 0, distance: Number.NaN }\n}\n\nexport const ssdeepAlgorithm: Algorithm = {\n  name: 'ssdeep',\n  family: 'fuzzy-byte',\n  inputType: 'bytes',\n  requires: [SSDEEP_BIN],\n  async hash(input) {\n    if (input.bytes === undefined) {\n      throw new Error('ssdeep requires loaded bytes.')\n    }\n    await requireBinary(SSDEEP_BIN)\n    // -b: bare output (no header line, no filename column)\n    // -s: silent — suppress warnings/banner\n    // We still get a header, so parse defensively.\n    const { stdout } = await runBinary({\n      binary: 'ssdeep', args: ['-b', '-s'], stdin: input.bytes,\n    })\n    const text = stdout.toString('utf8')\n    const lines = text.split(/\\r?\\n/).map(l => l.trim()).filter(l => l.length > 0)\n    // Skip the \"ssdeep,1.1--blocksize:hash:hash,filename\" header if present.\n    const hashLine = lines.find(l => !l.startsWith('ssdeep,')) ?? lines.at(-1)\n    if (hashLine === undefined) {\n      throw new Error('ssdeep produced no output.')\n    }\n    return hashLine.replace(/,.*$/u, '')\n  },\n  async compare(a, b) {\n    const { similarity, distance } = ssdeepSimilarity(a, b)\n    return {\n      similarity, distance: Number.isFinite(distance) ? distance : undefined, metric: 'ssdeep-levenshtein',\n    }\n  },\n}\n"],"mappings":";AAIO,SAAS,YAAY,GAAW,GAAmB;AACxD,MAAI,MAAM,EAAG,QAAO;AACpB,MAAI,EAAE,WAAW,EAAG,QAAO,EAAE;AAC7B,MAAI,EAAE,WAAW,EAAG,QAAO,EAAE;AAG7B,MAAI,KAAK;AACT,MAAI,KAAK;AACT,MAAI,GAAG,SAAS,GAAG,QAAQ;AACzB,UAAM,MAAM;AACZ,SAAK;AACL,SAAK;AAAA,EACP;AAEA,QAAM,IAAI,GAAG;AACb,QAAM,IAAI,GAAG;AACb,MAAI,OAAiB,MAAM,KAAK,EAAE,QAAQ,IAAI,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC;AAC9D,MAAI,OAAiB,MAAM,KAAK,EAAE,QAAQ,IAAI,EAAE,GAAG,MAAM,CAAC;AAE1D,WAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC3B,SAAK,CAAC,IAAI;AACV,UAAM,MAAM,GAAG,YAAY,IAAI,CAAC;AAChC,aAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC3B,YAAM,OAAO,QAAQ,GAAG,YAAY,IAAI,CAAC,IAAI,IAAI;AACjD,YAAM,MAAM,KAAK,CAAC,IAAI;AACtB,YAAM,MAAM,KAAK,IAAI,CAAC,IAAI;AAC1B,YAAM,MAAM,KAAK,IAAI,CAAC,IAAI;AAC1B,WAAK,CAAC,IAAI,KAAK,IAAI,KAAK,KAAK,GAAG;AAAA,IAClC;AACA,UAAM,MAAM;AACZ,WAAO;AACP,WAAO;AAAA,EACT;AACA,SAAO,KAAK,CAAC;AACf;;;ACtCA,SAAS,aAAa;AAuBtB,eAAsB,UAAU,SAAqD;AACnF,QAAM,WAAW,QAAQ,YAAY,KAAK,OAAO;AACjD,SAAO,MAAM,IAAI,QAAQ,CAAC,SAAS,WAAW;AAC5C,UAAM,QAAQ,MAAM,QAAQ,QAAQ,CAAC,GAAI,QAAQ,QAAQ,CAAC,CAAE,GAAG,EAAE,OAAO,CAAC,QAAQ,QAAQ,MAAM,EAAE,CAAC;AAElG,UAAM,eAAyB,CAAC;AAChC,QAAI,cAAc;AAClB,QAAI,SAAS;AACb,QAAI,oBAAoB;AAExB,UAAM,OAAO,GAAG,QAAQ,CAAC,UAAkB;AACzC,qBAAe,MAAM;AACrB,UAAI,cAAc,UAAU;AAC1B,YAAI,CAAC,mBAAmB;AACtB,8BAAoB;AACpB,gBAAM,KAAK,SAAS;AAAA,QACtB;AACA;AAAA,MACF;AACA,mBAAa,KAAK,KAAK;AAAA,IACzB,CAAC;AACD,UAAM,OAAO,GAAG,QAAQ,CAAC,UAAkB;AACzC,gBAAU,MAAM,SAAS,MAAM;AAAA,IACjC,CAAC;AAED,UAAM,GAAG,SAAS,SAAO,OAAO,GAAG,CAAC;AACpC,UAAM,GAAG,SAAS,CAAC,SAAS;AAC1B,UAAI,mBAAmB;AACrB,eAAO,IAAI,MAAM,GAAG,QAAQ,MAAM,oBAAoB,QAAQ,QAAQ,CAAC;AACvE;AAAA,MACF;AACA,YAAM,WAAW,QAAQ;AACzB,YAAM,SAAS,OAAO,OAAO,YAAY;AACzC,UAAI,aAAa,GAAG;AAClB,cAAM,OAAO,OAAO,KAAK,EAAE,MAAM,OAAO,EAAE,MAAM,EAAE,EAAE,KAAK,IAAI;AAC7D,eAAO,IAAI,MAAM,GAAG,QAAQ,MAAM,WAAW,QAAQ,GAAG,KAAK,SAAS,IAAI,KAAK,IAAI,KAAK,EAAE,EAAE,CAAC;AAC7F;AAAA,MACF;AACA,cAAQ;AAAA,QACN;AAAA,QAAQ;AAAA,QAAQ;AAAA,MAClB,CAAC;AAAA,IACH,CAAC;AAED,QAAI,QAAQ,UAAU,QAAW;AAC/B,YAAM,MAAM,IAAI;AAAA,IAClB,OAAO;AACL,YAAM,MAAM,IAAI,QAAQ,KAAK;AAAA,IAC/B;AAAA,EACF,CAAC;AACH;;;ACxEA,SAAS,SAAAA,cAAa;AAQtB,eAAsB,MAAM,QAAwC;AAClE,SAAO,MAAM,IAAI,QAAQ,CAAC,YAAY;AACpC,UAAM,MAAM,QAAQ,aAAa,UAAU,UAAU;AACrD,UAAM,OAAO,QAAQ,aAAa,UAAU,CAAC,MAAM,IAAI,CAAC,MAAM,MAAM;AACpE,UAAM,QAAQA,OAAM,KAAK,MAAM,EAAE,OAAO,QAAQ,aAAa,QAAQ,CAAC;AAEtE,QAAI,SAAS;AACb,UAAM,OAAO,GAAG,QAAQ,CAAC,UAAkB;AACzC,gBAAU,MAAM,SAAS,MAAM;AAAA,IACjC,CAAC;AACD,UAAM,GAAG,SAAS,MAAM,QAAQ,IAAI,CAAC;AACrC,UAAM,GAAG,SAAS,CAAC,SAAS;AAC1B,UAAI,SAAS,GAAG;AACd,cAAM,OAAO,OAAO,MAAM,OAAO,EAAE,KAAK,UAAQ,KAAK,KAAK,EAAE,SAAS,CAAC,GAAG,KAAK,KAAK;AACnF,gBAAQ,IAAI;AAAA,MACd,OAAO;AACL,gBAAQ,IAAI;AAAA,MACd;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AACH;AAKA,eAAsB,cAAc,KAAsC;AACxE,QAAM,OAAO,MAAM,MAAM,IAAI,MAAM;AACnC,MAAI,SAAS,KAAM,QAAO;AAC1B,QAAM,QAAQ,CAAC,GAAG,IAAI,MAAM,0CAA0C;AACtE,MAAI,IAAI,QAAQ,SAAS,OAAW,OAAM,KAAK,2BAA2B,IAAI,QAAQ,IAAI,EAAE;AAC5F,MAAI,IAAI,QAAQ,QAAQ,OAAW,OAAM,KAAK,0BAA0B,IAAI,QAAQ,GAAG,EAAE;AACzF,MAAI,IAAI,QAAQ,UAAU,OAAW,OAAM,KAAK,4BAA4B,IAAI,QAAQ,KAAK,EAAE;AAC/F,QAAM,IAAI,MAAM,MAAM,KAAK,IAAI,CAAC;AAClC;;;ACpCA,IAAM,aAA6B;AAAA,EACjC,QAAQ;AAAA,EACR,SAAS;AAAA,IACP,MAAM;AAAA,IACN,KAAK;AAAA,IACL,OAAO;AAAA,EACT;AACF;AAKA,SAAS,gBAAgB,KAA4D;AACnF,QAAM,UAAU,IAAI,QAAQ,SAAS,EAAE,EAAE,KAAK;AAC9C,QAAM,QAAQ,QAAQ,MAAM,GAAG;AAC/B,MAAI,MAAM,SAAS,GAAG;AACpB,UAAM,IAAI,MAAM,wBAAwB,GAAG,EAAE;AAAA,EAC/C;AACA,QAAM,YAAY,OAAO,SAAS,MAAM,CAAC,GAAG,EAAE;AAC9C,MAAI,CAAC,OAAO,SAAS,SAAS,KAAK,aAAa,GAAG;AACjD,UAAM,IAAI,MAAM,8BAA8B,MAAM,CAAC,CAAC,EAAE;AAAA,EAC1D;AACA,SAAO;AAAA,IACL;AAAA,IAAW,IAAI,MAAM,CAAC;AAAA,IAAG,IAAI,MAAM,CAAC;AAAA,EACtC;AACF;AAEA,SAAS,sBAAsB,GAAW,GAAmB;AAC3D,MAAI,EAAE,WAAW,KAAK,EAAE,WAAW,EAAG,QAAO;AAC7C,QAAM,OAAO,YAAY,GAAG,CAAC;AAC7B,QAAM,SAAS,KAAK,IAAI,EAAE,QAAQ,EAAE,QAAQ,CAAC;AAC7C,SAAO,KAAK,IAAI,GAAG,IAAI,OAAO,MAAM;AACtC;AAUA,SAAS,iBAAiB,MAAc,MAAwD;AAC9F,QAAM,IAAI,gBAAgB,IAAI;AAC9B,QAAM,IAAI,gBAAgB,IAAI;AAC9B,MAAI,EAAE,cAAc,EAAE,WAAW;AAC/B,UAAM,KAAK,sBAAsB,EAAE,IAAI,EAAE,EAAE;AAC3C,UAAM,KAAK,sBAAsB,EAAE,IAAI,EAAE,EAAE;AAC3C,UAAM,aAAa,KAAK,IAAI,IAAI,EAAE;AAClC,UAAM,WAAW,KAAK,OAAO,IAAI,cAAc,KAAK,IAAI,EAAE,GAAG,QAAQ,EAAE,GAAG,QAAQ,EAAE,GAAG,QAAQ,EAAE,GAAG,MAAM,CAAC;AAC3G,WAAO,EAAE,YAAY,SAAS;AAAA,EAChC;AACA,MAAI,EAAE,cAAc,EAAE,YAAY,GAAG;AACnC,UAAM,aAAa,sBAAsB,EAAE,IAAI,EAAE,EAAE;AACnD,WAAO,EAAE,YAAY,UAAU,KAAK,OAAO,IAAI,cAAc,KAAK,IAAI,EAAE,GAAG,QAAQ,EAAE,GAAG,MAAM,CAAC,EAAE;AAAA,EACnG;AACA,MAAI,EAAE,cAAc,EAAE,YAAY,GAAG;AACnC,UAAM,aAAa,sBAAsB,EAAE,IAAI,EAAE,EAAE;AACnD,WAAO,EAAE,YAAY,UAAU,KAAK,OAAO,IAAI,cAAc,KAAK,IAAI,EAAE,GAAG,QAAQ,EAAE,GAAG,MAAM,CAAC,EAAE;AAAA,EACnG;AACA,SAAO,EAAE,YAAY,GAAG,UAAU,OAAO,IAAI;AAC/C;AAEO,IAAM,kBAA6B;AAAA,EACxC,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,UAAU,CAAC,UAAU;AAAA,EACrB,MAAM,KAAK,OAAO;AAChB,QAAI,MAAM,UAAU,QAAW;AAC7B,YAAM,IAAI,MAAM,+BAA+B;AAAA,IACjD;AACA,UAAM,cAAc,UAAU;AAI9B,UAAM,EAAE,OAAO,IAAI,MAAM,UAAU;AAAA,MACjC,QAAQ;AAAA,MAAU,MAAM,CAAC,MAAM,IAAI;AAAA,MAAG,OAAO,MAAM;AAAA,IACrD,CAAC;AACD,UAAM,OAAO,OAAO,SAAS,MAAM;AACnC,UAAM,QAAQ,KAAK,MAAM,OAAO,EAAE,IAAI,OAAK,EAAE,KAAK,CAAC,EAAE,OAAO,OAAK,EAAE,SAAS,CAAC;AAE7E,UAAM,WAAW,MAAM,KAAK,OAAK,CAAC,EAAE,WAAW,SAAS,CAAC,KAAK,MAAM,GAAG,EAAE;AACzE,QAAI,aAAa,QAAW;AAC1B,YAAM,IAAI,MAAM,4BAA4B;AAAA,IAC9C;AACA,WAAO,SAAS,QAAQ,SAAS,EAAE;AAAA,EACrC;AAAA,EACA,MAAM,QAAQ,GAAG,GAAG;AAClB,UAAM,EAAE,YAAY,SAAS,IAAI,iBAAiB,GAAG,CAAC;AACtD,WAAO;AAAA,MACL;AAAA,MAAY,UAAU,OAAO,SAAS,QAAQ,IAAI,WAAW;AAAA,MAAW,QAAQ;AAAA,IAClF;AAAA,EACF;AACF;","names":["spawn"]}