@tangle-network/agent-eval 0.216.0 → 0.217.1

package/dist/journal-DvKCvjty.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"journal-DvKCvjty.js","names":[],"sources":["../src/ledger-core/atomic-file-lock.ts","../src/concurrency.ts","../src/ledger-core/journal-file.ts","../src/ledger-core/projector-snapshot.ts","../src/ledger-core/trusted-head.ts","../src/ledger-core/journal.ts"],"sourcesContent":["/** Crash-safe filesystem lock shared by campaign persistence and run exclusion. */\n\nimport { randomUUID } from 'node:crypto'\nimport {\n  closeSync,\n  constants,\n  existsSync,\n  fsyncSync,\n  linkSync,\n  openSync,\n  readFileSync,\n  renameSync,\n  unlinkSync,\n  writeFileSync,\n} from 'node:fs'\nimport { hostname } from 'node:os'\n\nexport interface AtomicFileLockOwner {\n  readonly pid: number\n  readonly host: string\n  readonly nonce: string\n}\n\nexport interface AtomicFileLock {\n  readonly owner: AtomicFileLockOwner\n  release(): void\n}\n\nexport type AtomicFileLockUnavailable =\n  | { readonly acquired: false; readonly reason: 'held'; readonly holder: AtomicFileLockOwner }\n  | { readonly acquired: false; readonly reason: 'recovery' }\n\nexport type AtomicFileLockAcquisition =\n  | { readonly acquired: true; readonly lock: AtomicFileLock }\n  | AtomicFileLockUnavailable\n\nexport interface AtomicFileLockOptions {\n  readonly lockPath: string\n  readonly pid?: number\n}\n\nexport class AtomicFileLockError extends Error {\n  override readonly name = 'AtomicFileLockError'\n}\n\ntype OwnerState =\n  | { readonly state: 'missing' }\n  | { readonly state: 'stale'; readonly owner: AtomicFileLockOwner }\n  | { readonly state: 'held'; readonly owner: AtomicFileLockOwner }\n\n/** Report whether another lock path prevents acquisition without modifying it. */\nexport function probeAtomicFileLock(\n  options: AtomicFileLockOptions,\n): AtomicFileLockUnavailable | null {\n  if (existsSync(recoveryPath(options.lockPath))) return { acquired: false, reason: 'recovery' }\n  const state = ownerState(options.lockPath)\n  if (state.state === 'held') {\n    return { acquired: false, reason: 'held', holder: state.owner }\n  }\n  return null\n}\n\n/**\n * Try to acquire a complete, uniquely-owned lock inode.\n *\n * A hard link publishes fully-written owner metadata atomically. Stale-owner\n * removal is serialized so one reclaimer cannot delete a new owner's lock.\n */\nexport function tryAcquireAtomicFileLock(\n  options: AtomicFileLockOptions,\n): AtomicFileLockAcquisition {\n  const pid = options.pid ?? process.pid\n  if (!Number.isSafeInteger(pid) || pid <= 0) {\n    throw new AtomicFileLockError('atomic file lock pid must be a positive integer')\n  }\n  const owner: AtomicFileLockOwner = { pid, host: hostname(), nonce: randomUUID() }\n  for (let attempt = 0; attempt < 8; attempt += 1) {\n    if (existsSync(recoveryPath(options.lockPath))) {\n      const recovery = tryAcquireRecoveryLease(options.lockPath, owner, attempt)\n      if (!recovery) return { acquired: false, reason: 'recovery' }\n      try {\n        return recoverLock(options.lockPath, owner, attempt)\n      } finally {\n        recovery.release()\n      }\n    }\n    if (tryLinkOwner(options.lockPath, owner, `acquire.${attempt}`)) {\n      return acquired(options.lockPath, owner)\n    }\n\n    const holder = ownerState(options.lockPath)\n    if (holder.state === 'missing') continue\n    if (holder.state === 'held') {\n      return { acquired: false, reason: 'held', holder: holder.owner }\n    }\n\n    const recovery = tryAcquireRecoveryLease(options.lockPath, owner, attempt)\n    if (!recovery) return { acquired: false, reason: 'recovery' }\n    try {\n      return recoverLock(options.lockPath, owner, attempt)\n    } finally {\n      recovery.release()\n    }\n  }\n\n  throw new AtomicFileLockError(`could not acquire atomic file lock ${options.lockPath}`)\n}\n\ninterface RecoveryLease {\n  release(): void\n}\n\nfunction tryAcquireRecoveryLease(\n  lockPath: string,\n  owner: AtomicFileLockOwner,\n  attempt: number,\n): RecoveryLease | null {\n  let leasePath = recoveryPath(lockPath)\n  const staleOwners: Array<{ path: string; owner: AtomicFileLockOwner }> = []\n\n  for (let depth = 0; depth < 64; depth += 1) {\n    const state = ownerState(leasePath)\n    if (state.state === 'missing') {\n      if (!tryLinkOwner(leasePath, owner, `reclaim.${attempt}.${depth}`)) continue\n      return {\n        release: () => {\n          for (const stale of staleOwners) releaseOwnedPath(stale.path, stale.owner)\n          releaseOwnedPath(leasePath, owner)\n        },\n      }\n    }\n    if (state.state === 'held') return null\n    staleOwners.push({ path: leasePath, owner: state.owner })\n    leasePath = `${leasePath}.next.${state.owner.nonce}`\n  }\n\n  throw new AtomicFileLockError(`atomic file lock recovery chain is too deep (${lockPath})`)\n}\n\nfunction recoverLock(\n  lockPath: string,\n  owner: AtomicFileLockOwner,\n  attempt: number,\n): AtomicFileLockAcquisition {\n  const current = ownerState(lockPath)\n  if (current.state === 'held') {\n    return { acquired: false, reason: 'held', holder: current.owner }\n  }\n  if (current.state === 'stale') {\n    const tombstone = `${lockPath}.stale.${owner.nonce}.${attempt}`\n    try {\n      renameSync(lockPath, tombstone)\n      unlinkSync(tombstone)\n    } catch (error) {\n      if (!isMissing(error)) throw error\n    }\n  }\n  if (tryLinkOwner(lockPath, owner, `recovered.${attempt}`)) {\n    return acquired(lockPath, owner)\n  }\n  const holder = ownerState(lockPath)\n  if (holder.state === 'held') {\n    return { acquired: false, reason: 'held', holder: holder.owner }\n  }\n  return { acquired: false, reason: 'recovery' }\n}\n\nfunction acquired(lockPath: string, owner: AtomicFileLockOwner): AtomicFileLockAcquisition {\n  return {\n    acquired: true,\n    lock: {\n      owner,\n      release: () => releaseOwnedPath(lockPath, owner),\n    },\n  }\n}\n\nfunction tryLinkOwner(lockPath: string, owner: AtomicFileLockOwner, suffix: string): boolean {\n  const ownerPath = `${lockPath}.${owner.pid}.${owner.nonce}.${suffix}.owner`\n  const descriptor = openSync(\n    ownerPath,\n    constants.O_CREAT | constants.O_EXCL | constants.O_WRONLY,\n    0o600,\n  )\n  try {\n    writeFileSync(descriptor, `${canonicalOwner(owner)}\\n`, 'utf8')\n    fsyncSync(descriptor)\n  } catch (error) {\n    closeSync(descriptor)\n    unlinkIfExists(ownerPath)\n    throw error\n  }\n  closeSync(descriptor)\n\n  try {\n    linkSync(ownerPath, lockPath)\n    return true\n  } catch (error) {\n    if (!isAlreadyExists(error)) throw error\n    return false\n  } finally {\n    unlinkIfExists(ownerPath)\n  }\n}\n\nfunction ownerState(lockPath: string): OwnerState {\n  const owner = readOwner(lockPath)\n  if (!owner) return { state: 'missing' }\n  if (owner.host !== hostname()) return { state: 'held', owner }\n  try {\n    process.kill(owner.pid, 0)\n    return { state: 'held', owner }\n  } catch (error) {\n    if (isNoSuchProcess(error)) return { state: 'stale', owner }\n    return { state: 'held', owner }\n  }\n}\n\nfunction readOwner(lockPath: string): AtomicFileLockOwner | undefined {\n  let contents: string\n  try {\n    contents = readFileSync(lockPath, 'utf8').trim()\n  } catch (error) {\n    if (isMissing(error)) return undefined\n    throw error\n  }\n\n  let value: unknown\n  try {\n    value = JSON.parse(contents)\n  } catch (error) {\n    throw invalidOwner(lockPath, error)\n  }\n  if (!isOwner(value)) throw invalidOwner(lockPath)\n  return value\n}\n\nfunction isOwner(value: unknown): value is AtomicFileLockOwner {\n  if (typeof value !== 'object' || value === null || Array.isArray(value)) return false\n  const record = value as Record<string, unknown>\n  return (\n    Object.keys(record).length === 3 &&\n    Number.isSafeInteger(record.pid) &&\n    Number(record.pid) > 0 &&\n    typeof record.host === 'string' &&\n    record.host.trim().length > 0 &&\n    typeof record.nonce === 'string' &&\n    record.nonce.trim().length > 0\n  )\n}\n\nfunction invalidOwner(lockPath: string, cause?: unknown): AtomicFileLockError {\n  const error = new AtomicFileLockError(\n    `atomic file lock has an invalid owner (${lockPath}); refusing unsafe recovery`,\n  )\n  if (cause !== undefined) Object.defineProperty(error, 'cause', { value: cause })\n  return error\n}\n\nfunction releaseOwnedPath(lockPath: string, owner: AtomicFileLockOwner): void {\n  const current = readOwner(lockPath)\n  if (!current) return\n  if (canonicalOwner(current) !== canonicalOwner(owner)) {\n    throw new AtomicFileLockError(`atomic file lock owner changed before release (${lockPath})`)\n  }\n  try {\n    unlinkSync(lockPath)\n  } catch (error) {\n    if (!isMissing(error)) throw error\n  }\n}\n\nfunction canonicalOwner(owner: AtomicFileLockOwner): string {\n  return JSON.stringify({ host: owner.host, nonce: owner.nonce, pid: owner.pid })\n}\n\nfunction recoveryPath(lockPath: string): string {\n  return `${lockPath}.reclaim`\n}\n\nfunction isAlreadyExists(error: unknown): boolean {\n  return error instanceof Error && 'code' in error && error.code === 'EEXIST'\n}\n\nfunction isMissing(error: unknown): boolean {\n  return error instanceof Error && 'code' in error && error.code === 'ENOENT'\n}\n\nfunction isNoSuchProcess(error: unknown): boolean {\n  return error instanceof Error && 'code' in error && error.code === 'ESRCH'\n}\n\nfunction unlinkIfExists(path: string): void {\n  try {\n    unlinkSync(path)\n  } catch (error) {\n    if (!isMissing(error)) throw error\n  }\n}\n","/**\n * concurrency — small primitives the evolution loop needs.\n *\n * `Mutex` is a zero-dep async lock with FIFO fairness. The evolution loop\n * uses it to serialise checkout/build/commit sequences inside a single\n * pool slot, and to gate concurrent JSONL writers (see\n * `lockedJsonlReferenceReplayStore`).\n *\n * Deliberately minimal — no priority queue, no timeouts. If you need\n * those, swap to `async-mutex` at the call site.\n */\n\nexport class Mutex {\n  private locked = false\n  private readonly waiters: Array<() => void> = []\n\n  async acquire(): Promise<() => void> {\n    if (!this.locked) {\n      this.locked = true\n      return () => this.release()\n    }\n    return new Promise<() => void>((resolve) => {\n      this.waiters.push(() => {\n        resolve(() => this.release())\n      })\n    })\n  }\n\n  private release(): void {\n    const next = this.waiters.shift()\n    if (next) {\n      next()\n    } else {\n      this.locked = false\n    }\n  }\n\n  async runExclusive<T>(fn: () => Promise<T> | T): Promise<T> {\n    const release = await this.acquire()\n    try {\n      return await fn()\n    } finally {\n      release()\n    }\n  }\n\n  /** True iff someone holds the lock right now. Diagnostics only. */\n  get isLocked(): boolean {\n    return this.locked\n  }\n\n  /** Pending waiter count. Diagnostics only. */\n  get pending(): number {\n    return this.waiters.length\n  }\n}\n\nexport interface MapConcurrentRangeOptions<R> {\n  count: number\n  maxConcurrency: number\n  label: string\n  signal?: AbortSignal\n  map(index: number, signal: AbortSignal): Promise<R>\n}\n\n/** Map an integer range with bounded work, cancellation, and first-error cleanup. */\nexport async function mapConcurrentRange<R>(options: MapConcurrentRangeOptions<R>): Promise<R[]> {\n  if (!Number.isSafeInteger(options.count) || options.count < 0) {\n    throw new Error(`${options.label} count must be a non-negative integer`)\n  }\n  if (!Number.isSafeInteger(options.maxConcurrency) || options.maxConcurrency < 1) {\n    throw new Error(`${options.label} maxConcurrency must be a positive integer`)\n  }\n\n  const controller = new AbortController()\n  const abortFromCaller = () => controller.abort(options.signal?.reason)\n  if (options.signal?.aborted) abortFromCaller()\n  else options.signal?.addEventListener('abort', abortFromCaller, { once: true })\n\n  const results = new Array<R>(options.count)\n  let nextIndex = 0\n  let failed = false\n  let firstFailure: unknown\n  const workers = Array.from(\n    { length: Math.min(options.maxConcurrency, options.count) },\n    async () => {\n      while (!controller.signal.aborted) {\n        const index = nextIndex\n        nextIndex += 1\n        if (index >= options.count) return\n        try {\n          results[index] = await options.map(index, controller.signal)\n        } catch (error) {\n          if (!failed) {\n            failed = true\n            firstFailure = error\n            controller.abort(error)\n          }\n          return\n        }\n      }\n    },\n  )\n\n  try {\n    await Promise.all(workers)\n    if (options.signal?.aborted) throw abortError(options.signal, options.label)\n    if (failed) throw firstFailure\n    if (controller.signal.aborted) throw abortError(controller.signal, options.label)\n    return results\n  } finally {\n    options.signal?.removeEventListener('abort', abortFromCaller)\n  }\n}\n\n/**\n * Map independent work with a fixed worker count while preserving input order.\n * After the first rejection, no new items start; already-running work is allowed\n * to settle before the returned promise rejects. Partial results are discarded.\n */\nexport async function mapConcurrent<T, R>(\n  items: readonly T[],\n  concurrency: number,\n  map: (item: T, index: number, signal: AbortSignal) => Promise<R>,\n  signal?: AbortSignal,\n): Promise<R[]> {\n  return mapConcurrentRange({\n    count: items.length,\n    maxConcurrency: concurrency,\n    label: 'mapConcurrent',\n    signal,\n    map(index, signal) {\n      return map(items[index]!, index, signal)\n    },\n  })\n}\n\nfunction abortError(signal: AbortSignal, label: string): Error {\n  return signal.reason instanceof Error ? signal.reason : new Error(`${label} aborted`)\n}\n","/** Filesystem durability and cross-process exclusion for append-only journal files. */\n\nimport {\n  closeSync,\n  constants,\n  fstatSync,\n  fsyncSync,\n  mkdirSync,\n  openSync,\n  readSync,\n  renameSync,\n  rmSync,\n  writeSync,\n} from 'node:fs'\nimport { dirname } from 'node:path'\nimport { AtomicFileLockError, tryAcquireAtomicFileLock } from './atomic-file-lock'\n\n/** How a journal binding reports file-layer faults in its own error taxonomy. */\nexport interface LedgerFileContext {\n  /** Noun used in error messages, e.g. 'search ledger'. */\n  subject: string\n  integrityError(message: string, options?: { cause?: unknown }): Error\n}\n\n/** Append one already-serialized line; the write is fsynced (file and directory)\n * before returning so an acknowledged append survives a crash. */\nexport function appendLedgerLine(path: string, line: string, context: LedgerFileContext): void {\n  mkdirSync(dirname(path), { recursive: true })\n  recoverTornFinalWrite(path, context)\n  const fd = openSync(path, constants.O_CREAT | constants.O_WRONLY | constants.O_APPEND, 0o600)\n  try {\n    writeAll(fd, Buffer.from(line, 'utf8'), context)\n    fsyncSync(fd)\n  } finally {\n    closeSync(fd)\n  }\n  fsyncDirectory(dirname(path))\n}\n\nfunction recoverTornFinalWrite(path: string, context: LedgerFileContext): void {\n  let fd: number\n  try {\n    fd = openSync(path, constants.O_RDWR)\n  } catch (error) {\n    if ((error as NodeJS.ErrnoException).code === 'ENOENT') return\n    throw context.integrityError(`${context.subject} ${path} could not be opened for recovery`, {\n      cause: error,\n    })\n  }\n\n  try {\n    const size = fstatSync(fd).size\n    if (size === 0 || readByte(fd, size - 1) === 0x0a) return\n    const tailStart = findFinalLineStart(fd, size)\n    const replacement = Buffer.alloc(size - tailStart, 0x20)\n    replacement[replacement.length - 1] = 0x0a\n    writeAllAt(fd, replacement, tailStart, context)\n    fsyncSync(fd)\n  } catch (error) {\n    throw context.integrityError(\n      `${context.subject} ${path} has an unrecoverable final journal write`,\n      { cause: error },\n    )\n  } finally {\n    closeSync(fd)\n  }\n}\n\n/** Replace a small sidecar file whole: write a temporary sibling, fsync it,\n * then rename over the target. A reader therefore sees the previous contents\n * or the new ones, never a partial file. */\nexport function writeLedgerFileAtomically(\n  path: string,\n  contents: string,\n  context: LedgerFileContext,\n): void {\n  const directory = dirname(path)\n  mkdirSync(directory, { recursive: true })\n  const temporaryPath = `${path}.tmp`\n  const fd = openSync(\n    temporaryPath,\n    constants.O_CREAT | constants.O_WRONLY | constants.O_TRUNC,\n    0o600,\n  )\n  try {\n    writeAll(fd, Buffer.from(contents, 'utf8'), context)\n    fsyncSync(fd)\n  } finally {\n    closeSync(fd)\n  }\n  renameSync(temporaryPath, path)\n  fsyncDirectory(directory)\n}\n\n/** Remove whatever occupies a sidecar path and fsync its directory, so the\n * removal is as durable as the write that created it. False when the path was\n * already empty. Recursive because a sidecar path holding a directory is one of\n * the states this has to be able to clear, not one it can refuse. */\nexport function removeLedgerFile(path: string, context: LedgerFileContext): boolean {\n  try {\n    rmSync(path, { recursive: true })\n  } catch (error) {\n    if ((error as NodeJS.ErrnoException).code === 'ENOENT') return false\n    throw context.integrityError(`${context.subject} ${path} could not be removed`, {\n      cause: error,\n    })\n  }\n  fsyncDirectory(dirname(path))\n  return true\n}\n\nexport function withLedgerFileLock<T>(path: string, context: LedgerFileContext, run: () => T): T {\n  const result = tryWithLedgerFileLock(path, context, run)\n  if (!result.acquired) {\n    throw context.integrityError(`${context.subject} lock is held (${path})`)\n  }\n  return result.value\n}\n\nexport type FileLockResult<T> = { acquired: true; value: T } | { acquired: false }\n\nexport function tryWithLedgerFileLock<T>(\n  path: string,\n  context: LedgerFileContext,\n  run: () => T,\n): FileLockResult<T> {\n  mkdirSync(dirname(path), { recursive: true })\n  const lockPath = `${path}.lock`\n  try {\n    const acquisition = tryAcquireAtomicFileLock({ lockPath })\n    if (!acquisition.acquired) return { acquired: false }\n    try {\n      return { acquired: true, value: run() }\n    } finally {\n      acquisition.lock.release()\n    }\n  } catch (error) {\n    if (error instanceof AtomicFileLockError) {\n      throw context.integrityError(error.message, { cause: error })\n    }\n    throw error\n  }\n}\n\nfunction writeAll(fd: number, bytes: Buffer, context: LedgerFileContext): void {\n  let offset = 0\n  while (offset < bytes.byteLength) {\n    const written = writeSync(fd, bytes, offset, bytes.byteLength - offset)\n    if (written <= 0) throw context.integrityError('filesystem wrote zero bytes')\n    offset += written\n  }\n}\n\nfunction writeAllAt(fd: number, bytes: Buffer, position: number, context: LedgerFileContext): void {\n  let offset = 0\n  while (offset < bytes.byteLength) {\n    const written = writeSync(fd, bytes, offset, bytes.byteLength - offset, position + offset)\n    if (written <= 0) throw context.integrityError('filesystem wrote zero bytes')\n    offset += written\n  }\n}\n\nfunction findFinalLineStart(fd: number, size: number): number {\n  const chunk = Buffer.alloc(Math.min(4_096, size))\n  let cursor = size\n  while (cursor > 0) {\n    const length = Math.min(chunk.byteLength, cursor)\n    cursor -= length\n    const read = readSync(fd, chunk, 0, length, cursor)\n    for (let index = read - 1; index >= 0; index -= 1) {\n      if (chunk[index] === 0x0a) return cursor + index + 1\n    }\n  }\n  return 0\n}\n\nfunction readByte(fd: number, position: number): number {\n  const byte = Buffer.allocUnsafe(1)\n  const read = readSync(fd, byte, 0, 1, position)\n  return read === 1 ? byte[0]! : -1\n}\n\nfunction fsyncDirectory(path: string): void {\n  const fd = openSync(path, constants.O_RDONLY)\n  try {\n    fsyncSync(fd)\n  } finally {\n    closeSync(fd)\n  }\n}\n","/**\n * Projector snapshot — the cache that lets opening a large journal replay\n * only its tail.\n *\n * `trusted-head.ts`'s pin proves a journal's length and prefix content\n * without trusting a producer's summary; it does not make PROVING that\n * cheap. Every open still walks every row from sequence 0, parses it through\n * the domain codec, and applies it to a fresh projector, because that was the\n * only way this module knew to rebuild `Projection`.\n *\n * This file adds one more sidecar: `<journal>.snapshot` holds a `Projection`\n * a codec that opts in (`snapshotProjection` on its `LedgerJournalCodec`)\n * serialized, alongside the `(sequence, entryHash)` it was taken after. A\n * reader that finds one still verifies the generic hash chain of every row up\n * to that checkpoint — self-consistency and chain linkage, the same two\n * checks `journal.ts`'s `admitEntry` runs on every row — because that\n * verification is what the pin's guarantee actually rests on (see\n * `trusted-head.ts`'s module comment: an entry hash commits to its whole\n * prefix, so there is no way to prove a prefix unchanged without touching\n * every byte of it at least once). What the cache lets a reader skip is the\n * codec's OWN parsing (`parseEntry`, typically zod validation) and the domain\n * projector's `apply` for every row before the checkpoint: rows that already\n * passed both once, at write time, and whose bytes the chain walk has just\n * proven are unchanged since. Only the checkpoint row itself, and every row\n * after it, go through the full domain path — exactly as an already-open\n * instance that had verified up to there would already do.\n *\n * A snapshot that does not match the journal's actual bytes — a chain that\n * does not reach the claimed hash, a wrong entry count for its byte range —\n * fails loudly with the same kind of `integrityError` a full replay would\n * raise for the same tampered bytes; the tampering is real regardless of\n * which path found it, so it is never swallowed in favor of a fallback that\n * would silently re-read the same bytes a different way. Only a MISSING\n * cache file, or one this journal's current pin cannot vouch for at all\n * (§`journal.ts`'s `seedFromSnapshot`), is treated as \"no cache\" and falls\n * back to full verification.\n */\n\nimport { readFileSync } from 'node:fs'\nimport { LEDGER_HASH_PATTERN, type LedgerHash } from './canonical'\nimport { type LedgerFileContext, removeLedgerFile, writeLedgerFileAtomically } from './journal-file'\nimport type { LedgerTrustedHead } from './trusted-head'\n\n/** A cached projection and the pinned entry it was taken after. */\nexport interface LedgerProjectorSnapshot {\n  head: LedgerTrustedHead\n  /** Byte length of the journal file up to and including the pinned entry's\n   * own row. Where the rows this snapshot covers end and the tail it did not\n   * cover begins. */\n  byteLength: number\n  /** The codec's serialized projection. Opaque to this module. */\n  projection: unknown\n}\n\n/** Sibling cache file for a journal, alongside its `.head` pin. */\nexport function projectorSnapshotPathFor(journalPath: string): string {\n  return `${journalPath}.snapshot`\n}\n\nconst RECOVERY =\n  ' Restore the file, or remove it and let the journal rebuild it at its next checkpoint.'\n\n/** The cached snapshot, or null when none has been written. Present but\n * unparseable is corruption of the cache itself, not its absence, and fails\n * loudly for the same reason `readTrustedHeadFile` does: silently treating it\n * as \"no cache\" would just make the next read replay from scratch without\n * ever explaining why the cache stopped working. */\nexport function readProjectorSnapshotFile(\n  path: string,\n  context: LedgerFileContext,\n): LedgerProjectorSnapshot | null {\n  let text: string\n  try {\n    text = readFileSync(path, 'utf8')\n  } catch (error) {\n    if ((error as NodeJS.ErrnoException).code === 'ENOENT') return null\n    throw context.integrityError(\n      `${context.subject} projector snapshot ${path} could not be read.${RECOVERY}`,\n      { cause: error },\n    )\n  }\n  let raw: unknown\n  try {\n    raw = JSON.parse(text)\n  } catch (error) {\n    throw context.integrityError(\n      `${context.subject} projector snapshot ${path} is not valid JSON.${RECOVERY}`,\n      { cause: error },\n    )\n  }\n  if (typeof raw !== 'object' || raw === null || Array.isArray(raw)) {\n    throw context.integrityError(\n      `${context.subject} projector snapshot ${path} is not an object.${RECOVERY}`,\n    )\n  }\n  const record = raw as Record<string, unknown>\n  const keys = Object.keys(record).sort()\n  if (\n    keys.length !== 3 ||\n    keys[0] !== 'byteLength' ||\n    keys[1] !== 'head' ||\n    keys[2] !== 'projection'\n  ) {\n    throw context.integrityError(\n      `${context.subject} projector snapshot ${path} has keys [${keys.join(', ')}], expected [byteLength, head, projection].${RECOVERY}`,\n    )\n  }\n  const { byteLength, head, projection } = record\n  if (typeof byteLength !== 'number' || !Number.isSafeInteger(byteLength) || byteLength <= 0) {\n    throw context.integrityError(\n      `${context.subject} projector snapshot ${path} byteLength is not a positive integer.${RECOVERY}`,\n    )\n  }\n  if (typeof head !== 'object' || head === null || Array.isArray(head)) {\n    throw context.integrityError(\n      `${context.subject} projector snapshot ${path} head is not an object.${RECOVERY}`,\n    )\n  }\n  const headRecord = head as Record<string, unknown>\n  const headKeys = Object.keys(headRecord).sort()\n  if (headKeys.length !== 2 || headKeys[0] !== 'entryHash' || headKeys[1] !== 'sequence') {\n    throw context.integrityError(\n      `${context.subject} projector snapshot ${path} head has keys [${headKeys.join(', ')}], expected [entryHash, sequence].${RECOVERY}`,\n    )\n  }\n  const { sequence, entryHash } = headRecord\n  if (typeof sequence !== 'number' || !Number.isSafeInteger(sequence) || sequence < 0) {\n    throw context.integrityError(\n      `${context.subject} projector snapshot ${path} head.sequence is not a non-negative integer.${RECOVERY}`,\n    )\n  }\n  if (typeof entryHash !== 'string' || !LEDGER_HASH_PATTERN.test(entryHash)) {\n    throw context.integrityError(\n      `${context.subject} projector snapshot ${path} head.entryHash is not a sha256 digest.${RECOVERY}`,\n    )\n  }\n  return {\n    head: { sequence, entryHash: entryHash as LedgerHash },\n    byteLength,\n    projection,\n  }\n}\n\n/** Publish a snapshot by write-then-rename, so a crash leaves either the\n * previous cache or the new one and never a torn file a reader would have to\n * refuse. Not re-exported from the package's public surface, for the same\n * reason `writeTrustedHeadFile` is not: it takes no lock and enforces no\n * monotonicity against the journal it caches. `FileLedgerJournal` is the only\n * writer, always immediately after its own `sync()` has verified the exact\n * state it is about to cache. */\nexport function writeProjectorSnapshotFile(\n  path: string,\n  snapshot: LedgerProjectorSnapshot,\n  context: LedgerFileContext,\n): void {\n  const body = JSON.stringify({\n    byteLength: snapshot.byteLength,\n    head: snapshot.head,\n    projection: snapshot.projection,\n  })\n  try {\n    writeLedgerFileAtomically(path, `${body}\\n`, context)\n  } catch (error) {\n    throw context.integrityError(\n      `${context.subject} projector snapshot ${path} could not be written`,\n      { cause: error },\n    )\n  }\n}\n\n/** Discard a journal's cached snapshot. A missing cache is not an error: this\n * is how `clearTrustedHead()` keeps the two sidecars from disagreeing about\n * what the journal's writer has vouched for, and it is safe to call whether\n * or not a cache ever existed. */\nexport function removeProjectorSnapshotFile(path: string, context: LedgerFileContext): void {\n  removeLedgerFile(path, context)\n  removeLedgerFile(`${path}.tmp`, context)\n}\n","/**\n * Trusted head — the pin that makes deletion detectable.\n *\n * ## What the chain binds\n *\n * Every entry hashes the journal header, its sequence, the previous entry's\n * hash, and its event, so editing, reordering, or removing an entry in the\n * middle of a journal invalidates every hash after it. What a hash chain\n * cannot bind is its own length. Dropping entries off the END leaves a shorter\n * journal that is internally perfect, and rebuilding a journal from sequence 0\n * with recomputed hashes produces a different, equally perfect chain. For an\n * audit log of candidate registrations and promotion decisions that is the\n * difference between a record of a search that happened and a record of one\n * that did not.\n *\n * ## What the pin binds\n *\n * `<journal>.head` holds `{sequence, entryHash}` for one entry a writer\n * actually appended, in a file separate from the journal it attests. Each\n * entry hash commits to the entire prefix before it, so checking that the\n * entry at exactly `sequence` still carries `entryHash` proves two things at\n * once: the journal is at least `sequence + 1` entries long, and those entries\n * are byte-for-byte the ones the writer saw. A journal that merely grew past\n * the pin still verifies; a truncated, rolled-back, or wholesale-rewritten one\n * cannot.\n *\n * ## What the pin does NOT defend against\n *\n * The pin is a second file, not a signature. A writer with access to BOTH the\n * journal and its pin can rewrite both consistently, and the result verifies.\n * Pinning raises the cost of undetected tampering from one file to two and\n * nothing more; defending against a writer who holds both requires an anchor\n * outside this store entirely — a signed head, or a digest published to an\n * append-only service the tamperer does not control.\n *\n * Deleting the pin file downgrades a pinned journal to an unpinned one, which\n * cannot be distinguished from a journal written before pinning existed. That\n * is what `requireTrustedHead` is for: a journal opened under it refuses to\n * read at all once a non-empty journal has no pin.\n *\n * ## Abandoning a pin\n *\n * A pin outlives the journal it attests: deleting or rebuilding the journal\n * leaves a pin naming history the file no longer carries, and every read is\n * refused because that is precisely the deletion the pin exists to catch. The\n * refusal names the pin file, and `clearTrustedHeadFile` is the explicit way to\n * discard it — the same downgrade a writer with filesystem access could already\n * perform with `rm`, made reachable through the API so it is a decision in the\n * code rather than an undocumented manual step. It returns the guarantee it\n * gave up and writes no record of its own; a caller that needs the discard on\n * the record has to write one.\n */\n\nimport { readFileSync } from 'node:fs'\nimport { canonicalString, LEDGER_HASH_PATTERN, type LedgerHash } from './canonical'\nimport { type LedgerFileContext, removeLedgerFile, writeLedgerFileAtomically } from './journal-file'\n\n/** A `(sequence, entryHash)` pair a writer pinned outside the journal. */\nexport interface LedgerTrustedHead {\n  sequence: number\n  entryHash: LedgerHash\n}\n\n/** Minimum entry shape the anchor check needs. */\nexport interface LedgerAnchoredEntry {\n  sequence: number\n  entryHash: LedgerHash\n}\n\n/** Sibling pin file for a journal — deliberately NOT the journal, so rewriting\n * the log is not enough to rewrite the trust recorded about it. */\nexport function trustedHeadPathFor(journalPath: string): string {\n  return `${journalPath}.head`\n}\n\nconst TRUSTED_HEAD_RECOVERY =\n  ' Restore the file, or discard the pin it held with clearTrustedHead().'\n\n/** The pin, or null when this journal has never been pinned. A pin that exists\n * but does not parse is corruption or tamper of the trust record itself and\n * fails loudly: reporting it as \"no pin\" would silently downgrade what the\n * journal can prove. */\nexport function readTrustedHeadFile(\n  path: string,\n  context: LedgerFileContext,\n): LedgerTrustedHead | null {\n  let text: string\n  try {\n    text = readFileSync(path, 'utf8')\n  } catch (error) {\n    if ((error as NodeJS.ErrnoException).code === 'ENOENT') return null\n    throw context.integrityError(\n      `${context.subject} trusted head ${path} could not be read.${TRUSTED_HEAD_RECOVERY}`,\n      { cause: error },\n    )\n  }\n  let raw: unknown\n  try {\n    raw = JSON.parse(text)\n  } catch (error) {\n    throw context.integrityError(\n      `${context.subject} trusted head ${path} is not valid JSON.${TRUSTED_HEAD_RECOVERY}`,\n      { cause: error },\n    )\n  }\n  if (typeof raw !== 'object' || raw === null || Array.isArray(raw)) {\n    throw context.integrityError(\n      `${context.subject} trusted head ${path} is not an object.${TRUSTED_HEAD_RECOVERY}`,\n    )\n  }\n  const record = raw as Record<string, unknown>\n  const keys = Object.keys(record).sort()\n  if (keys.length !== 2 || keys[0] !== 'entryHash' || keys[1] !== 'sequence') {\n    throw context.integrityError(\n      `${context.subject} trusted head ${path} has keys [${keys.join(', ')}], expected [entryHash, sequence].${TRUSTED_HEAD_RECOVERY}`,\n    )\n  }\n  const { sequence, entryHash } = record\n  if (typeof sequence !== 'number' || !Number.isSafeInteger(sequence) || sequence < 0) {\n    throw context.integrityError(\n      `${context.subject} trusted head ${path} sequence is not a non-negative integer.${TRUSTED_HEAD_RECOVERY}`,\n    )\n  }\n  if (typeof entryHash !== 'string' || !LEDGER_HASH_PATTERN.test(entryHash)) {\n    throw context.integrityError(\n      `${context.subject} trusted head ${path} entryHash is not a sha256 digest.${TRUSTED_HEAD_RECOVERY}`,\n    )\n  }\n  return { sequence, entryHash: entryHash as LedgerHash }\n}\n\n/** Publish a pin by write-then-rename, so a crash leaves either the previous\n * pin or the new one and never a torn file that would lock a journal out of\n * its own trust record.\n *\n * Not re-exported from the package's public surface. It takes no lock, checks no\n * chain, and enforces no monotonicity, so a public form would be the one call\n * able to move a pin BACKWARD onto a journal it never read — which is the\n * truncation the pin exists to refuse. `FileLedgerJournal.pinTrustedHead` is\n * the public writer: locked, chain-verified, forward-only. */\nexport function writeTrustedHeadFile(\n  path: string,\n  head: LedgerTrustedHead,\n  context: LedgerFileContext,\n): void {\n  try {\n    writeLedgerFileAtomically(path, `${canonicalString(head)}\\n`, context)\n  } catch (error) {\n    throw context.integrityError(`${context.subject} trusted head ${path} could not be written`, {\n      cause: error,\n    })\n  }\n}\n\n/** Outcome of discarding a pin: the guarantee that was given up. `unreadable`\n * carries why the discarded pin could not be named — corruption, a permission\n * fault, a wrong file type — so a caller recording the decision never has to\n * treat \"no pin was there\" and \"the pin could not be read\" as one state.\n * `cleanupError` reports a stale atomic-write sibling that remains after the\n * actual pin was cleared. */\nexport type LedgerTrustedHeadRemoval =\n  | { removed: true; head: LedgerTrustedHead; cleanupError?: string }\n  | { removed: true; head: null; unreadable: string; cleanupError?: string }\n  | { removed: false; cleanupError?: string }\n\n/** Discard a journal's pin, reporting what was discarded. The journal file is\n * untouched and reads as unpinned afterwards, so the next pinning append opens\n * a new pin at the entry it writes. This gives up the deletion guarantee for\n * every entry the pin covered; it is the recovery for a pin whose journal was\n * deliberately deleted or rebuilt, and the only way past a pin file that can no\n * longer be read at all. */\nexport function clearTrustedHeadFile(\n  path: string,\n  context: LedgerFileContext,\n): LedgerTrustedHeadRemoval {\n  let head: LedgerTrustedHead | null = null\n  let unreadable = ''\n  try {\n    head = readTrustedHeadFile(path, context)\n  } catch (error) {\n    // A pin nobody can read is precisely what clearing has to get past, so the\n    // fault is reported on a removal that still happens rather than raised —\n    // but it is reported, never flattened into \"there was no pin\".\n    unreadable = error instanceof Error ? error.message : String(error)\n  }\n  const removed = removeLedgerFile(path, context)\n  let cleanupError: string | undefined\n  try {\n    // Cleanup cannot block the requested trust-state change. Report a stale\n    // atomic-write sibling so the caller can repair it before the next write.\n    removeLedgerFile(`${path}.tmp`, context)\n  } catch (error) {\n    cleanupError = error instanceof Error ? error.message : String(error)\n  }\n  const cleanup = cleanupError === undefined ? {} : { cleanupError }\n  if (!removed) return { removed: false, ...cleanup }\n  if (head === null) return { removed: true, head: null, unreadable, ...cleanup }\n  return { removed: true, head, ...cleanup }\n}\n\n/** How a journal is named when a trusted-head check refuses it. */\nexport interface LedgerTrustedHeadSubject {\n  /** The journal in error messages, e.g. `search ledger /runs/a/ledger.jsonl`. */\n  subject: string\n  /** The sibling pin file, named in every refusal so the operator can see which\n   * of the two files carries the claim being enforced. */\n  trustedHeadPath: string\n}\n\n/** The entry at exactly `head.sequence` must still carry `head.entryHash`.\n * Entries must already have passed chain verification, which is what makes\n * index and sequence interchangeable here. An array serves as `entries`; a\n * journal that keeps no entries in memory passes a reader with the same\n * `length` and `at`. */\nexport function verifyEntriesAgainstTrustedHead(\n  entries: Pick<readonly LedgerAnchoredEntry[], 'length' | 'at'>,\n  head: LedgerTrustedHead,\n  context: LedgerFileContext,\n  naming: LedgerTrustedHeadSubject,\n): void {\n  // A caller passing the bare subject string an untyped build would accept\n  // destructures into two undefineds, which would corrupt the text of a\n  // security refusal rather than fail. Refuse instead.\n  if (typeof naming !== 'object' || naming === null) {\n    throw new TypeError(\n      'verifyEntriesAgainstTrustedHead expects { subject, trustedHeadPath } as its fourth argument',\n    )\n  }\n  const { subject, trustedHeadPath } = naming\n  const pinned = entries.at(head.sequence)\n  if (pinned === undefined) {\n    throw context.integrityError(\n      `${subject} trusted head ${trustedHeadPath} pins sequence ${head.sequence} (${head.entryHash}) but the journal has ${entries.length} entries — pinned history is missing (truncation, rollback, or rewrite). Restore the journal, or abandon the pinned history on purpose with clearTrustedHead().`,\n    )\n  }\n  if (pinned.sequence !== head.sequence) {\n    throw context.integrityError(\n      `${subject} entry at index ${head.sequence} carries sequence ${pinned.sequence}; the chain was not verified before the trusted head ${trustedHeadPath}`,\n    )\n  }\n  if (pinned.entryHash !== head.entryHash) {\n    throw context.integrityError(\n      `${subject} entry at pinned sequence ${head.sequence} carries ${pinned.entryHash} but the trusted head ${trustedHeadPath} recorded ${head.entryHash} — the journal was rewritten. Restore the journal, or abandon the pinned history on purpose with clearTrustedHead().`,\n    )\n  }\n}\n","/**\n * Generic durable append-only journal with a SHA-256 hash chain.\n *\n * The file format is canonical JSONL: every row is the canonical JSON encoding\n * (RFC 8785, object keys sorted recursively) of one entry, and every entry\n * hashes the previous entry's hash so the log is tamper-evident. Appends are\n * serialized in-process per path and across processes via a lock file, fsynced\n * before acknowledgement, and idempotent by `eventId`. A malformed,\n * non-canonical, truncated, reordered, or conflicting log fails loudly; a bad\n * row is never skipped.\n *\n * A hash chain binds each entry to its predecessor, which cannot prove that no\n * entry was removed from the end: a valid shorter prefix is still a valid\n * chain. `pinHead` records the appended entry in a sibling `<journal>.head`\n * file and every read re-verifies the journal against a pin that is present,\n * so truncation and wholesale rewrite are refused. `trusted-head.ts` carries\n * the full threat model, including what a pin does not defend against.\n *\n * Verification is incremental. A journal instance verifies its whole file once,\n * on its first call, and keeps the verified head, the live projector, and an\n * eventId index. Every later call checks that the head line it verified is\n * still in place, then reads, verifies, and projects only the bytes past it, so\n * an append reads one entry however long the journal is. Rows another writer\n * appended are verified as that tail. A file that was replaced, shrank, or no\n * longer carries the verified head is verified whole again. What an open\n * instance cannot see is a same-length rewrite of rows before its head; a new\n * instance verifies every row and refuses one.\n *\n * That \"whole file once\" is still every row, however long ago it was already\n * proven unchanged. A codec that opts into `snapshotProjection` lets a fresh\n * instance shortcut it: `projector-snapshot.ts`'s cache still walks the whole\n * hash chain up to its checkpoint — nothing is exempted from tamper detection\n * — but only the checkpoint row and the true tail after it go through the\n * codec's own parsing and projector; the FileLedgerJournalOptions.projectorSnapshot\n * option controls how often a pinning append refreshes it.\n *\n * Domain vocabulary lives entirely in the consumer's codec: entry schema\n * validation, the constant header fields stamped into every entry, the error\n * taxonomy, and the state machine replayed over verified entries.\n */\n\nimport { closeSync, constants, fstatSync, openSync, readSync } from 'node:fs'\nimport { resolve } from 'node:path'\nimport { Mutex } from '../concurrency'\nimport { canonicalString, hashCanonical, type LedgerHash } from './canonical'\nimport { deepFreezeCanonicalJson } from './deep-freeze'\nimport { appendLedgerLine, type LedgerFileContext, withLedgerFileLock } from './journal-file'\nimport {\n  type LedgerProjectorSnapshot,\n  projectorSnapshotPathFor,\n  readProjectorSnapshotFile,\n  removeProjectorSnapshotFile,\n  writeProjectorSnapshotFile,\n} from './projector-snapshot'\nimport {\n  clearTrustedHeadFile,\n  type LedgerTrustedHead,\n  type LedgerTrustedHeadRemoval,\n  readTrustedHeadFile,\n  trustedHeadPathFor,\n  verifyEntriesAgainstTrustedHead,\n  writeTrustedHeadFile,\n} from './trusted-head'\n\n/** Minimum shape of a journal event: the idempotency key. */\nexport interface LedgerEventBase {\n  eventId: string\n}\n\n/** Chain envelope every entry carries in addition to the journal's constant\n * header fields. `entryHash` covers the header, sequence, previous hash, and\n * event, so any rewrite of history invalidates every later entry. */\nexport interface LedgerChainFields<Event extends LedgerEventBase> {\n  sequence: number\n  previousHash: LedgerHash | null\n  event: Event\n  entryHash: LedgerHash\n}\n\nexport type LedgerEntryOf<Header extends object, Event extends LedgerEventBase> = Header &\n  LedgerChainFields<Event>\n\nexport interface LedgerLineContext {\n  path: string\n  line: number\n}\n\n/** Domain state machine applied to chain-verified entries in order.\n *\n * One projector lives as long as its journal instance's verified state: the\n * journal applies each entry once, including entries appended later, and asks\n * for `snapshot()` after any number of them. `apply` throws (via the codec's\n * error taxonomy) on an invalid transition; after a throw the journal discards\n * the projector and replays the file into a new one, so `apply` need not undo\n * a partial update. Entries are deep-frozen before `apply` sees them. */\nexport interface LedgerProjector<Entry, Projection> {\n  apply(entry: Entry, index: number): void\n  /** The projection of every entry applied so far. A later `apply` must not\n   * change a projection already returned, so a snapshot copies any state the\n   * projector keeps mutating. */\n  snapshot(): Projection\n}\n\n/** Serialize a projection into JSON-safe cache data, and rebuild a projector\n * from it whose next `apply` continues right after the entry it was taken\n * after — as if that projector had been live since sequence 0. Supplying\n * both opts a codec into the projector snapshot cache (`projector-snapshot.ts`):\n * a fresh journal open can then verify the generic hash chain of the rows\n * before a cached checkpoint without parsing or applying any of them through\n * this codec. Omit to disable the cache for this codec; every open then\n * fully replays through `createProjector`, exactly as before. */\nexport interface LedgerProjectorSnapshotCodec<Entry, Projection> {\n  serialize(projection: Projection): unknown\n  restore(serialized: unknown): LedgerProjector<Entry, Projection>\n}\n\nexport interface LedgerJournalCodec<\n  Header extends object,\n  Event extends LedgerEventBase,\n  Projection,\n> extends LedgerFileContext {\n  /** Constant fields stamped into every entry and covered by its hash. */\n  header: Header\n  conflictError(message: string): Error\n  /** Validate one parsed JSON row into a typed entry. Must reject malformed\n   * rows and non-canonical event encodings with the binding's own errors;\n   * the journal itself verifies the stored bytes and the hash chain. A new\n   * entry passes through the same parse before it is written, so the journal\n   * never writes a row it would refuse to read. */\n  parseEntry(raw: unknown, context: LedgerLineContext): LedgerEntryOf<Header, Event>\n  /** Reject an entry whose constant header fields do not match this journal. */\n  checkEntryHeader(entry: LedgerEntryOf<Header, Event>, index: number): void\n  createProjector(): LedgerProjector<LedgerEntryOf<Header, Event>, Projection>\n  snapshotProjection?: LedgerProjectorSnapshotCodec<LedgerEntryOf<Header, Event>, Projection>\n}\n\nexport interface LedgerAppendResult<Entry, Projection> {\n  entry: Entry\n  /** False when the exact event was already durably present. */\n  appended: boolean\n  projection: Projection\n}\n\nexport interface LedgerAppendOptions {\n  /** Record the appended entry as this journal's trusted head, so a later read\n   * can prove nothing was deleted from the end.\n   *\n   * On the idempotent path — the event is already durable — the pin moves up to\n   * that entry only when the entry is ahead of it, along a chain this call has\n   * just verified. So a pin write that failed after its row was fsynced is\n   * repaired by the retry that idempotency already asks the caller for, and the\n   * pin still only ever moves forward over history it has checked.\n   *\n   * A strict journal whose first pin write failed still refuses the retry\n   * because it cannot distinguish that failure from a deleted pin. Recover it\n   * explicitly with `pinTrustedHead()`; silently adopting the current file\n   * would defeat `requireTrustedHead`. */\n  pinHead?: boolean\n}\n\nexport interface FileLedgerJournalOptions {\n  /** Refuse to read a non-empty journal that has no trusted head.\n   *\n   * Off by default because journals written before pinning have no pin and\n   * must keep opening. Turn it on for a journal this process pins: without it,\n   * deleting the sibling pin file silently downgrades the journal back to a\n   * chain that cannot detect deletion. */\n  requireTrustedHead?: boolean\n  /** Cache a projector snapshot at the trusted head, refreshed once at least\n   * this many entries have appended past the last cached one, so the cost\n   * amortizes and a fresh open's tail stays bounded by this interval however\n   * large the journal grows. Requires the codec's `snapshotProjection`; a\n   * codec without it ignores this option and every open fully replays. */\n  projectorSnapshot?: { everyEntries: number }\n}\n\n/** The part of a journal file one instance has verified. It is valid only\n * between successful locked calls: any failure discards it, and the next call\n * verifies the whole file again. */\ninterface VerifiedJournal<Entry, Projection> {\n  /** Device and inode of the verified file; null until the file exists. */\n  identity: { dev: bigint; ino: bigint } | null\n  /** Verified byte length, which is where the next entry starts. */\n  size: number\n  /** Byte offset of each entry's row, indexed by sequence. */\n  offsets: number[]\n  /** The last entry and its row bytes, newline included. Finding these bytes\n   * at the end of the verified length is what lets a call trust every row\n   * before them without reading them. */\n  head: { entry: Entry; row: Buffer } | null\n  sequenceByEventId: Map<string, number>\n  projector: LedgerProjector<Entry, Projection>\n  /** The pin last verified against this chain, or null when there was none. */\n  pin: LedgerTrustedHead | null\n  /** Sequence of the last projector snapshot this instance wrote or seeded\n   * from, or null when it has not cached one. Tracked in memory so a run of\n   * pinning appends checks whether a refresh is due without re-reading the\n   * cache file on every one of them. */\n  snapshotSequence: number | null\n}\n\n// One async mutex per resolved journal path so concurrent appends from a single\n// process queue up instead of failing on the held cross-process lock file.\nconst journalMutexes = new Map<string, Mutex>()\n\nfunction mutexFor(path: string): Mutex {\n  const existing = journalMutexes.get(path)\n  if (existing) return existing\n  const mutex = new Mutex()\n  journalMutexes.set(path, mutex)\n  return mutex\n}\n\n/** Durable filesystem journal. Construction performs no I/O. The first call\n * verifies the complete file under the locks; later calls verify the retained\n * head and only the bytes past it (see the module comment). */\nexport class FileLedgerJournal<Header extends object, Event extends LedgerEventBase, Projection> {\n  readonly path: string\n  /** Sibling file holding this journal's trusted head. */\n  readonly trustedHeadPath: string\n  /** Sibling file holding this journal's cached projector snapshot, if its\n   * codec opts in. */\n  readonly projectorSnapshotPath: string\n  private readonly codec: LedgerJournalCodec<Header, Event, Projection>\n  private readonly mutex: Mutex\n  private readonly requireTrustedHead: boolean\n  private readonly snapshotEvery: number | null\n  private verified: VerifiedJournal<LedgerEntryOf<Header, Event>, Projection> | null = null\n\n  constructor(\n    path: string,\n    codec: LedgerJournalCodec<Header, Event, Projection>,\n    options: FileLedgerJournalOptions = {},\n  ) {\n    this.path = resolve(path)\n    this.trustedHeadPath = trustedHeadPathFor(this.path)\n    this.projectorSnapshotPath = projectorSnapshotPathFor(this.path)\n    this.codec = codec\n    this.mutex = mutexFor(this.path)\n    this.requireTrustedHead = options.requireTrustedHead === true\n    this.snapshotEvery =\n      codec.snapshotProjection !== undefined && options.projectorSnapshot !== undefined\n        ? options.projectorSnapshot.everyEntries\n        : null\n  }\n\n  async replay(): Promise<Projection> {\n    return this.locked(() => this.sync(this.requireTrustedHead).projector.snapshot())\n  }\n\n  async append(\n    event: Event,\n    options: LedgerAppendOptions = {},\n  ): Promise<LedgerAppendResult<LedgerEntryOf<Header, Event>, Projection>> {\n    return this.locked(() => {\n      const state = this.sync(this.requireTrustedHead)\n      const existingSequence = state.sequenceByEventId.get(event.eventId)\n      if (existingSequence !== undefined) {\n        const existing = this.entryAt(state, existingSequence)!\n        if (canonicalString(existing.event) !== canonicalString(event)) {\n          throw this.codec.conflictError(\n            `eventId ${event.eventId} already exists with different content`,\n          )\n        }\n        if (options.pinHead === true) this.pinAcknowledged(state, existing)\n        return { entry: existing, appended: false, projection: state.projector.snapshot() }\n      }\n\n      const sequence = state.offsets.length\n      const material = {\n        ...this.codec.header,\n        sequence,\n        previousHash: state.head?.entry.entryHash ?? null,\n        event,\n      }\n      const text = canonicalString({ ...material, entryHash: hashCanonical(material) })\n      // The new row goes through the reader's own parse and the projector's\n      // transition before it is written: a row the journal would refuse to\n      // read, or an entry the projector rejects, never reaches the file.\n      const entry = parseRow(text, { path: this.path, line: sequence + 1 }, this.codec)\n      const row = Buffer.from(`${text}\\n`, 'utf8')\n      admitEntry(state, entry, row, this.codec)\n      appendLedgerLine(this.path, `${text}\\n`, this.codec)\n      if (options.pinHead === true) {\n        // Journal first, pin second: a crash or a failed pin write between\n        // them leaves the pin one entry behind, which still verifies and is\n        // repaired by the next pinning append, including the idempotent\n        // retry of this same event. The reverse order would leave a pin\n        // naming an entry the journal does not carry, locking the journal\n        // out of its own history.\n        const head = { sequence: entry.sequence, entryHash: entry.entryHash }\n        writeTrustedHeadFile(this.trustedHeadPath, head, this.codec)\n        state.pin = head\n        this.maybeWriteProjectorSnapshot(state)\n      }\n      return { entry, appended: true, projection: state.projector.snapshot() }\n    })\n  }\n\n  /** The pinned head, or null when this journal has never been pinned. */\n  async trustedHead(): Promise<LedgerTrustedHead | null> {\n    return this.mutex.runExclusive(() =>\n      withLedgerFileLock(this.path, this.codec, () =>\n        readTrustedHeadFile(this.trustedHeadPath, this.codec),\n      ),\n    )\n  }\n\n  /** Pin the current verified head. The chain and any existing pin are checked\n   * first, so the pin only ever moves forward along a journal that still\n   * carries the history it already recorded. */\n  async pinTrustedHead(): Promise<LedgerTrustedHead> {\n    return this.locked(() => {\n      // `requireTrustedHead` is deliberately not applied here: pinning is how\n      // a journal that lacks a pin acquires one.\n      const state = this.sync(false)\n      if (state.head === null) {\n        throw this.codec.integrityError(\n          `${this.codec.subject} ${this.path} is empty; there is no head to pin`,\n        )\n      }\n      const head: LedgerTrustedHead = {\n        sequence: state.head.entry.sequence,\n        entryHash: state.head.entry.entryHash,\n      }\n      writeTrustedHeadFile(this.trustedHeadPath, head, this.codec)\n      state.pin = head\n      // An explicit pin is already a deliberate, infrequent checkpoint call,\n      // so — when the caller opted into the cache at all — it always\n      // refreshes it rather than waiting for the interval. Gated on\n      // `snapshotEvery`, not just the codec's support, so a journal that\n      // never asked for `projectorSnapshot` never gets a cache file from\n      // this path either; caching stays one on/off decision, not two.\n      if (this.snapshotEvery !== null) this.writeProjectorSnapshotNow(state)\n      return head\n    })\n  }\n\n  /** Discard this journal's pin, reporting what was discarded. The journal file\n   * is untouched and reads as unpinned afterwards, so the next pinning append\n   * opens a new pin at the entry it writes. It is the way out of a pin whose\n   * journal was deliberately deleted or rebuilt — every read of such a path is\n   * refused, correctly, because a pin naming history the file no longer carries\n   * is indistinguishable from a deletion. Clearing removes the deletion\n   * guarantee for every entry the pin covered. */\n  async clearTrustedHead(): Promise<LedgerTrustedHeadRemoval> {\n    return this.locked(() => {\n      const removal = clearTrustedHeadFile(this.trustedHeadPath, this.codec)\n      // A cached snapshot that survived would be pinned to a head this\n      // journal no longer vouches for, indistinguishable from a stale one a\n      // future re-pin could seed from without earning it. It is not\n      // security-critical to remove it — a reader only ever trusts a cached\n      // checkpoint the current pin can vouch for — but keeping the sidecars\n      // in agreement about what has been given up is the honest state to\n      // leave on disk.\n      removeProjectorSnapshotFile(this.projectorSnapshotPath, this.codec)\n      if (this.verified !== null) {\n        this.verified.pin = null\n        this.verified.snapshotSequence = null\n      }\n      return removal\n    })\n  }\n\n  /** Run under both locks. Any failure discards the verified state, because a\n   * throw can leave it describing bytes the file does not hold: a projector\n   * half way through a rejected transition, or a row whose write failed. */\n  private locked<T>(run: () => T): Promise<T> {\n    return this.mutex.runExclusive(() =>\n      withLedgerFileLock(this.path, this.codec, () => {\n        try {\n          return run()\n        } catch (error) {\n          this.verified = null\n          throw error\n        }\n      }),\n    )\n  }\n\n  /** Bring the verified state up to the file: keep it when its head row is\n   * still where it was verified, else start over from byte 0; then verify and\n   * apply every row past it, and check the pin. */\n  private sync(requirePin: boolean): VerifiedJournal<LedgerEntryOf<Header, Event>, Projection> {\n    let state = this.verified\n    const fd = openForReading(this.path, this.codec)\n    if (fd === null) {\n      // A missing file is an empty journal, whatever this instance saw before.\n      if (state === null || state.size > 0) state = emptyJournal(this.codec)\n      this.verified = state\n      this.verifyPin(state, requirePin)\n      return state\n    }\n    try {\n      const stats = fstatSync(fd, { bigint: true })\n      const size = Number(stats.size)\n      const identity = { dev: stats.dev, ino: stats.ino }\n      if (\n        state === null ||\n        (state.identity !== null &&\n          (state.identity.dev !== identity.dev || state.identity.ino !== identity.ino)) ||\n        size < state.size ||\n        !headInPlace(fd, state.size, state.head?.row ?? null)\n      ) {\n        // This is the case a full verification exists to catch — a fresh\n        // instance, or one whose retained head is no longer where it was\n        // verified — so a cached checkpoint is only ever a shortcut to the\n        // SAME conclusion a full replay would reach, never a substitute for\n        // reaching it.\n        state = (size > 0 ? this.seedFromSnapshot(fd, size) : null) ?? emptyJournal(this.codec)\n      }\n      state.identity = identity\n      this.verified = state\n      if (size > state.size) {\n        extendJournal(state, readRange(fd, state.size, size), this.path, this.codec)\n      }\n    } finally {\n      closeSync(fd)\n    }\n    this.verifyPin(state, requirePin)\n    return state\n  }\n\n  private verifyPin(\n    state: VerifiedJournal<LedgerEntryOf<Header, Event>, Projection>,\n    requirePin: boolean,\n  ): void {\n    const pinned = readTrustedHeadFile(this.trustedHeadPath, this.codec)\n    const count = state.offsets.length\n    if (pinned === null) {\n      state.pin = null\n      if (requirePin && count > 0) {\n        throw this.codec.integrityError(\n          `${this.codec.subject} ${this.path} has ${count} entries but no trusted head at ${this.trustedHeadPath} — without its pin the journal cannot prove nothing was deleted. Restore the pin file, or adopt the current head with pinTrustedHead().`,\n        )\n      }\n      return\n    }\n    // A pin already verified against this chain stays verified while the\n    // chain's head is in place; sync has just checked that.\n    if (state.pin?.sequence === pinned.sequence && state.pin.entryHash === pinned.entryHash) {\n      return\n    }\n    // The anchor is meaningful only over a chain that already verified, so it\n    // is checked after sync — and on every call, so a violated pin is refused\n    // before an append can extend the journal over it.\n    const chain = { length: count, at: (sequence: number) => this.entryAt(state, sequence) }\n    verifyEntriesAgainstTrustedHead(chain, pinned, this.codec, {\n      subject: `${this.codec.subject} ${this.path}`,\n      trustedHeadPath: this.trustedHeadPath,\n    })\n    state.pin = pinned\n  }\n\n  /** Move the pin up to an entry this caller just acknowledged on the\n   * idempotent path, when a pin write that failed after its row was already\n   * fsynced left the pin behind. The move is safe because it is forward-only\n   * along a chain `sync` has just verified: every entry up to this one is bound\n   * to it by hash, so the pin can only ever come to name more history than it\n   * did, never different history.\n   *\n   * With no pin at all this only pins the journal's current head. An entry in\n   * the middle would publish a pin that reads as protection while leaving every\n   * later entry silently truncatable, which is a worse state to hand an auditor\n   * than the honest absence of a pin; `pinTrustedHead()` is the way to pin an\n   * unpinned journal on purpose. */\n  private pinAcknowledged(\n    state: VerifiedJournal<LedgerEntryOf<Header, Event>, Projection>,\n    entry: LedgerEntryOf<Header, Event>,\n  ): void {\n    const pinned = state.pin\n    if (pinned === null) {\n      if (entry.sequence !== state.offsets.length - 1) return\n    } else if (pinned.sequence >= entry.sequence) {\n      return\n    }\n    const head = { sequence: entry.sequence, entryHash: entry.entryHash }\n    writeTrustedHeadFile(this.trustedHeadPath, head, this.codec)\n    state.pin = head\n    this.maybeWriteProjectorSnapshot(state)\n  }\n\n  /** Refresh the cached projector snapshot once the current pin has moved at\n   * least `snapshotEvery` entries past the last one cached, so the write cost\n   * amortizes across many appends and a fresh open's uncached tail stays\n   * bounded by that interval no matter how large the journal grows. A no-op\n   * when the codec does not support the cache, the option is off, or the\n   * head this call just pinned is not actually new (the idempotent-append\n   * path can call this after re-acknowledging an already-durable entry). */\n  private maybeWriteProjectorSnapshot(\n    state: VerifiedJournal<LedgerEntryOf<Header, Event>, Projection>,\n  ): void {\n    if (this.codec.snapshotProjection === undefined || this.snapshotEvery === null) return\n    if (state.pin === null || state.pin.sequence !== state.head?.entry.sequence) return\n    if (\n      state.snapshotSequence !== null &&\n      state.pin.sequence - state.snapshotSequence < this.snapshotEvery\n    ) {\n      return\n    }\n    this.writeProjectorSnapshotNow(state)\n  }\n\n  /** Serialize the live projector and write it as the cache, unconditionally.\n   * Callers have already established that `state.pin` names `state.head`, so\n   * the cache and the pin agree on the checkpoint by construction. */\n  private writeProjectorSnapshotNow(\n    state: VerifiedJournal<LedgerEntryOf<Header, Event>, Projection>,\n  ): void {\n    const head = state.pin!\n    const projection = this.codec.snapshotProjection!.serialize(state.projector.snapshot())\n    const snapshot: LedgerProjectorSnapshot = { head, byteLength: state.size, projection }\n    writeProjectorSnapshotFile(this.projectorSnapshotPath, snapshot, this.codec)\n    state.snapshotSequence = head.sequence\n  }\n\n  /** Seed a fresh verified state from the cached projector snapshot, or null\n   * when there is none this reader can use — a missing or out-of-reach\n   * cache, never something this instance found actually wrong. Everything it\n   * DOES accept is checked against the real bytes: rows 0 through the\n   * checkpoint are read and chain-verified exactly as `admitEntry` would\n   * verify them (self-consistent hash, correct sequence, linked previousHash,\n   * unique eventId), just without this codec's own `parseEntry` or\n   * `apply` — the checkpoint row itself still goes through both, through the\n   * ordinary `parseRow`, so it is exactly as trustworthy as any entry a full\n   * replay would produce. Any mismatch found along the way throws the same\n   * `integrityError` a full replay of the same bytes would raise, because it\n   * is the same tampering either path would have found; this is never turned\n   * into a quiet fallback that would just re-read the same bytes differently\n   * and risk reporting a different, more confusing failure — or none. */\n  private seedFromSnapshot(\n    fd: number,\n    size: number,\n  ): VerifiedJournal<LedgerEntryOf<Header, Event>, Projection> | null {\n    const restore = this.codec.snapshotProjection\n    if (restore === undefined) return null\n    const cached = readProjectorSnapshotFile(this.projectorSnapshotPath, this.codec)\n    if (cached === null) return null\n    // Only a cache the CURRENT pin can vouch for is trusted. A pin moves\n    // forward only past history that has already chain-verified (sync\n    // verifies every appended row before a pinning append can move it), so a\n    // cache at or behind the pin names a real, already-proven checkpoint; one\n    // ahead of it — or present with no pin at all — names history nothing\n    // external currently vouches for, and is ignored rather than trusted.\n    const pin = readTrustedHeadFile(this.trustedHeadPath, this.codec)\n    if (pin === null || cached.head.sequence > pin.sequence) return null\n    if (cached.byteLength <= 0 || cached.byteLength > size) return null\n\n    const prefix = readRange(fd, 0, cached.byteLength)\n    const rows = splitRows(prefix, this.path, this.codec)\n    if (rows.length !== cached.head.sequence + 1) {\n      throw this.codec.integrityError(\n        `${this.codec.subject} ${this.path} projector snapshot ${this.projectorSnapshotPath} expects ${cached.head.sequence + 1} entries in its first ${cached.byteLength} bytes but the journal has ${rows.length}`,\n      )\n    }\n\n    const offsets: number[] = []\n    const sequenceByEventId = new Map<string, number>()\n    let previousHash: LedgerHash | null = null\n    for (let index = 0; index < rows.length - 1; index += 1) {\n      const row = rows[index]!\n      offsets.push(row.start)\n      let raw: unknown\n      try {\n        raw = JSON.parse(row.text)\n      } catch (error) {\n        throw this.codec.integrityError(\n          `${this.codec.subject} ${this.path} has invalid JSON at line ${index + 1}`,\n          { cause: error },\n        )\n      }\n      if (canonicalString(raw) !== row.text) {\n        throw this.codec.integrityError(\n          `${this.codec.subject} ${this.path} has non-canonical bytes at line ${index + 1}`,\n        )\n      }\n      const fields = raw as {\n        sequence?: unknown\n        previousHash?: unknown\n        entryHash?: unknown\n        event?: { eventId?: unknown }\n      }\n      if (fields.sequence !== index) {\n        throw this.codec.integrityError(\n          `entry at line ${index + 1} has sequence ${String(fields.sequence)}, expected ${index}`,\n        )\n      }\n      if ((fields.previousHash ?? null) !== previousHash) {\n        throw this.codec.integrityError(\n          `entry at line ${index + 1} does not extend the previous hash`,\n        )\n      }\n      const { entryHash, ...material } = raw as Record<string, unknown>\n      const expected = hashCanonical(material)\n      if (entryHash !== expected) {\n        throw this.codec.integrityError(\n          `entry at line ${index + 1} hash mismatch: expected ${expected}, got ${String(entryHash)}`,\n        )\n      }\n      const eventId = fields.event?.eventId\n      if (typeof eventId !== 'string' || eventId === '') {\n        throw this.codec.integrityError(`entry at line ${index + 1} has no eventId`)\n      }\n      if (sequenceByEventId.has(eventId)) {\n        throw this.codec.integrityError(`duplicate eventId ${eventId} in durable ledger`)\n      }\n      sequenceByEventId.set(eventId, index)\n      previousHash = entryHash as LedgerHash\n    }\n\n    // The checkpoint row itself carries this codec's own validation, exactly\n    // like any other entry — the cache never substitutes for parsing it.\n    const boundary = rows[rows.length - 1]!\n    offsets.push(boundary.start)\n    const entry = parseRow(\n      boundary.text,\n      { path: this.path, line: cached.head.sequence + 1 },\n      this.codec,\n    )\n    const { entryHash: _boundaryHash, ...boundaryMaterial } = entry\n    if (\n      entry.sequence !== cached.head.sequence ||\n      entry.previousHash !== previousHash ||\n      entry.entryHash !== cached.head.entryHash ||\n      hashCanonical(boundaryMaterial) !== cached.head.entryHash\n    ) {\n      throw this.codec.integrityError(\n        `${this.codec.subject} ${this.path} projector snapshot ${this.projectorSnapshotPath} does not match the journal at sequence ${cached.head.sequence}`,\n      )\n    }\n    this.codec.checkEntryHeader(entry, cached.head.sequence)\n    if (sequenceByEventId.has(entry.event.eventId)) {\n      throw this.codec.integrityError(`duplicate eventId ${entry.event.eventId} in durable ledger`)\n    }\n    sequenceByEventId.set(entry.event.eventId, entry.sequence)\n\n    let projector: LedgerProjector<LedgerEntryOf<Header, Event>, Projection>\n    try {\n      projector = restore.restore(cached.projection)\n    } catch (error) {\n      throw this.codec.integrityError(\n        `${this.codec.subject} ${this.path} projector snapshot ${this.projectorSnapshotPath} could not be restored`,\n        { cause: error },\n      )\n    }\n\n    return {\n      identity: null,\n      size: cached.byteLength,\n      offsets,\n      head: { entry, row: Buffer.from(`${boundary.text}\\n`, 'utf8') },\n      sequenceByEventId,\n      projector,\n      pin: null,\n      snapshotSequence: cached.head.sequence,\n    }\n  }\n\n  /** The verified entry at `sequence`, read back from the file. The rows from\n   * it to the head are re-read and must chain to the verified head hash, which\n   * binds the returned entry to the history this instance verified. Callers ask\n   * for recent entries — an idempotent retry, a pin one entry behind — so this\n   * usually reads nothing or one row. */\n  private entryAt(\n    state: VerifiedJournal<LedgerEntryOf<Header, Event>, Projection>,\n    sequence: number,\n  ): LedgerEntryOf<Header, Event> | undefined {\n    const count = state.offsets.length\n    if (!Number.isSafeInteger(sequence) || sequence < 0 || sequence >= count) return undefined\n    if (sequence === count - 1) return state.head!.entry\n    const changed = () =>\n      this.codec.integrityError(\n        `${this.codec.subject} ${this.path} changed at or after sequence ${sequence} since this reader verified it`,\n      )\n    const fd = openForReading(this.path, this.codec)\n    if (fd === null) throw changed()\n    let bytes: Buffer\n    try {\n      bytes = readRange(fd, state.offsets[sequence]!, state.size)\n    } finally {\n      closeSync(fd)\n    }\n    const rows = splitRows(bytes, this.path, this.codec)\n    if (rows.length !== count - sequence) throw changed()\n    let first: LedgerEntryOf<Header, Event> | undefined\n    let previous: LedgerEntryOf<Header, Event> | undefined\n    for (let index = 0; index < rows.length; index += 1) {\n      const entry = parseRow(\n        rows[index]!.text,\n        { path: this.path, line: sequence + index + 1 },\n        this.codec,\n      )\n      const { entryHash, ...material } = entry\n      if (\n        entry.sequence !== sequence + index ||\n        hashCanonical(material) !== entryHash ||\n        (previous !== undefined && entry.previousHash !== previous.entryHash)\n      ) {\n        throw changed()\n      }\n      first ??= entry\n      previous = entry\n    }\n    if (previous?.entryHash !== state.head!.entry.entryHash) throw changed()\n    return first\n  }\n}\n\n/** Where a memory journal keeps its text: an in-process store keyed by path,\n * such as an in-memory `CampaignStorage`. */\nexport interface LedgerTextStore {\n  read(path: string): string | undefined\n  write(path: string, text: string): void\n}\n\n/**\n * A journal for runs without a filesystem. It keeps its rows as text in a\n * store and applies the file journal's rules: the same row parse, hash chain,\n * idempotent append by `eventId`, and projector transition before a row is\n * kept. It has no lock, fsync or trusted head, because its rows live and die\n * with the process that holds the store.\n */\nexport class MemoryLedgerJournal<Header extends object, Event extends LedgerEventBase, Projection> {\n  readonly path: string\n  private readonly codec: LedgerJournalCodec<Header, Event, Projection>\n  private readonly store: LedgerTextStore\n  private verified: {\n    text: string\n    journal: VerifiedJournal<LedgerEntryOf<Header, Event>, Projection>\n    entries: LedgerEntryOf<Header, Event>[]\n  } | null = null\n\n  constructor(\n    path: string,\n    codec: LedgerJournalCodec<Header, Event, Projection>,\n    store: LedgerTextStore,\n  ) {\n    this.path = path\n    this.codec = codec\n    this.store = store\n  }\n\n  async replay(): Promise<Projection> {\n    return this.guarded(() => this.sync().journal.projector.snapshot())\n  }\n\n  async append(\n    event: Event,\n  ): Promise<LedgerAppendResult<LedgerEntryOf<Header, Event>, Projection>> {\n    return this.guarded(() => {\n      const verified = this.sync()\n      const { journal, entries } = verified\n      const existingSequence = journal.sequenceByEventId.get(event.eventId)\n      if (existingSequence !== undefined) {\n        const existing = entries[existingSequence]!\n        if (canonicalString(existing.event) !== canonicalString(event)) {\n          throw this.codec.conflictError(\n            `eventId ${event.eventId} already exists with different content`,\n          )\n        }\n        return { entry: existing, appended: false, projection: journal.projector.snapshot() }\n      }\n      const sequence = entries.length\n      const material = {\n        ...this.codec.header,\n        sequence,\n        previousHash: journal.head?.entry.entryHash ?? null,\n        event,\n      }\n      const text = canonicalString({ ...material, entryHash: hashCanonical(material) })\n      const entry = parseRow(text, { path: this.path, line: sequence + 1 }, this.codec)\n      admitEntry(journal, entry, Buffer.from(`${text}\\n`, 'utf8'), this.codec)\n      entries.push(entry)\n      verified.text = `${verified.text}${text}\\n`\n      this.store.write(this.path, verified.text)\n      return { entry, appended: true, projection: journal.projector.snapshot() }\n    })\n  }\n\n  /** Verify the stored text again whenever it is not the text this instance wrote. */\n  private sync(): NonNullable<MemoryLedgerJournal<Header, Event, Projection>['verified']> {\n    const text = this.store.read(this.path) ?? ''\n    if (this.verified?.text === text) return this.verified\n    const journal = emptyJournal(this.codec)\n    const entries: LedgerEntryOf<Header, Event>[] = []\n    const bytes = Buffer.from(text, 'utf8')\n    for (const row of splitRows(bytes, this.path, this.codec)) {\n      const entry = parseRow(row.text, { path: this.path, line: entries.length + 1 }, this.codec)\n      admitEntry(journal, entry, Buffer.from(bytes.subarray(row.start, row.end)), this.codec)\n      entries.push(entry)\n    }\n    this.verified = { text, journal, entries }\n    return this.verified\n  }\n\n  /** A refused transition can leave the projector half applied; discard it. */\n  private async guarded<T>(run: () => T): Promise<T> {\n    try {\n      return run()\n    } catch (error) {\n      this.verified = null\n      throw error\n    }\n  }\n}\n\n/** Verify and replay resolved immutable journal bytes without filesystem I/O. */\nexport function replayLedgerText<Header extends object, Event extends LedgerEventBase, Projection>(\n  text: string,\n  path: string,\n  codec: LedgerJournalCodec<Header, Event, Projection>,\n): Projection {\n  const state = emptyJournal(codec)\n  extendJournal(state, Buffer.from(text, 'utf8'), path, codec)\n  return state.projector.snapshot()\n}\n\nfunction emptyJournal<Header extends object, Event extends LedgerEventBase, Projection>(\n  codec: LedgerJournalCodec<Header, Event, Projection>,\n): VerifiedJournal<LedgerEntryOf<Header, Event>, Projection> {\n  return {\n    identity: null,\n    size: 0,\n    offsets: [],\n    head: null,\n    sequenceByEventId: new Map(),\n    projector: codec.createProjector(),\n    pin: null,\n    snapshotSequence: null,\n  }\n}\n\n/** Verify and apply the rows in `bytes`, which start at the state's verified\n * length. */\nfunction extendJournal<Header extends object, Event extends LedgerEventBase, Projection>(\n  state: VerifiedJournal<LedgerEntryOf<Header, Event>, Projection>,\n  bytes: Buffer,\n  path: string,\n  codec: LedgerJournalCodec<Header, Event, Projection>,\n): void {\n  const rows = splitRows(bytes, path, codec)\n  for (const { text, start, end } of rows) {\n    const entry = parseRow(text, { path, line: state.offsets.length + 1 }, codec)\n    // Copy the row: a view would keep the whole read buffer alive.\n    admitEntry(state, entry, Buffer.from(bytes.subarray(start, end)), codec)\n  }\n}\n\n/** Check one parsed entry against the chain and apply it. Every row, read or\n * about to be written, enters the verified state here. */\nfunction admitEntry<Header extends object, Event extends LedgerEventBase, Projection>(\n  state: VerifiedJournal<LedgerEntryOf<Header, Event>, Projection>,\n  entry: LedgerEntryOf<Header, Event>,\n  row: Buffer,\n  codec: LedgerJournalCodec<Header, Event, Projection>,\n): void {\n  const index = state.offsets.length\n  codec.checkEntryHeader(entry, index)\n  if (entry.sequence !== index) {\n    throw codec.integrityError(\n      `entry ${entry.event.eventId} has sequence ${entry.sequence}, expected ${index}`,\n    )\n  }\n  if (entry.previousHash !== (state.head?.entry.entryHash ?? null)) {\n    throw codec.integrityError(`entry ${entry.event.eventId} does not extend the previous hash`)\n  }\n  const { entryHash: _entryHash, ...material } = entry\n  const expectedHash = hashCanonical(material)\n  if (entry.entryHash !== expectedHash) {\n    throw codec.integrityError(\n      `entry ${entry.event.eventId} hash mismatch: expected ${expectedHash}, got ${entry.entryHash}`,\n    )\n  }\n  if (state.sequenceByEventId.has(entry.event.eventId)) {\n    throw codec.integrityError(`duplicate eventId ${entry.event.eventId} in durable ledger`)\n  }\n  state.projector.apply(entry, index)\n  state.sequenceByEventId.set(entry.event.eventId, index)\n  state.offsets.push(state.size)\n  state.size += row.byteLength\n  state.head = { entry, row }\n}\n\n/** Parse one canonical row into a frozen entry. The projector and every caller\n * share entries, so none of them can change what the journal verified. */\nfunction parseRow<Header extends object, Event extends LedgerEventBase, Projection>(\n  text: string,\n  context: LedgerLineContext,\n  codec: LedgerJournalCodec<Header, Event, Projection>,\n): LedgerEntryOf<Header, Event> {\n  const { path, line } = context\n  let raw: unknown\n  try {\n    raw = JSON.parse(text)\n  } catch (error) {\n    throw codec.integrityError(`${codec.subject} ${path} has invalid JSON at line ${line}`, {\n      cause: error,\n    })\n  }\n  const entry = codec.parseEntry(raw, context)\n  let canonical: string\n  try {\n    canonical = canonicalString(entry)\n  } catch (error) {\n    throw codec.integrityError(\n      `${codec.subject} ${path} has a row with no canonical JSON form at line ${line}`,\n      { cause: error },\n    )\n  }\n  if (text !== canonical) {\n    throw codec.integrityError(`${codec.subject} ${path} has non-canonical bytes at line ${line}`)\n  }\n  return deepFreezeCanonicalJson(entry)\n}\n\ninterface JournalRow {\n  text: string\n  /** Byte range of the row in the buffer, newline included. */\n  start: number\n  end: number\n}\n\nfunction splitRows(bytes: Buffer, path: string, context: LedgerFileContext): JournalRow[] {\n  if (bytes.byteLength === 0) return []\n  if (bytes[bytes.byteLength - 1] !== 0x0a) {\n    throw context.integrityError(\n      `${context.subject} ${path} has a truncated final record (missing newline)`,\n    )\n  }\n  const rows: JournalRow[] = []\n  let start = 0\n  while (start < bytes.byteLength) {\n    const newline = bytes.indexOf(0x0a, start)\n    if (newline === start) {\n      throw context.integrityError(\n        `${context.subject} ${path} has a blank row at line ${rows.length + 1}`,\n      )\n    }\n    rows.push({ text: bytes.toString('utf8', start, newline), start, end: newline + 1 })\n    start = newline + 1\n  }\n  return rows\n}\n\n/** True when the verified head row still ends the verified length of the file. */\nfunction headInPlace(fd: number, size: number, row: Buffer | null): boolean {\n  return row === null || readRange(fd, size - row.byteLength, size).equals(row)\n}\n\n/** A read-only descriptor, or null when the file does not exist. */\nfunction openForReading(path: string, context: LedgerFileContext): number | null {\n  try {\n    return openSync(path, constants.O_RDONLY)\n  } catch (error) {\n    if ((error as NodeJS.ErrnoException).code === 'ENOENT') return null\n    throw context.integrityError(`${context.subject} ${path} could not be opened for reading`, {\n      cause: error,\n    })\n  }\n}\n\nfunction readRange(fd: number, start: number, end: number): Buffer {\n  const bytes = Buffer.allocUnsafe(end - start)\n  let offset = 0\n  while (offset < bytes.byteLength) {\n    const read = readSync(fd, bytes, offset, bytes.byteLength - offset, start + offset)\n    if (read === 0) return bytes.subarray(0, offset)\n    offset += read\n  }\n  return bytes\n}\n"],"mappings":";;;;;;;;AAyCA,IAAa,sBAAb,cAAyC,MAAM;CAC7C,OAAyB;AAC3B;;AAQA,SAAgB,oBACd,SACkC;CAClC,IAAI,WAAW,aAAa,QAAQ,QAAQ,CAAC,GAAG,OAAO;EAAE,UAAU;EAAO,QAAQ;CAAW;CAC7F,MAAM,QAAQ,WAAW,QAAQ,QAAQ;CACzC,IAAI,MAAM,UAAU,QAClB,OAAO;EAAE,UAAU;EAAO,QAAQ;EAAQ,QAAQ,MAAM;CAAM;CAEhE,OAAO;AACT;;;;;;;AAQA,SAAgB,yBACd,SAC2B;CAC3B,MAAM,MAAM,QAAQ,OAAO,QAAQ;CACnC,IAAI,CAAC,OAAO,cAAc,GAAG,KAAK,OAAO,GACvC,MAAM,IAAI,oBAAoB,iDAAiD;CAEjF,MAAM,QAA6B;EAAE;EAAK,MAAM,SAAS;EAAG,OAAO,WAAW;CAAE;CAChF,KAAK,IAAI,UAAU,GAAG,UAAU,GAAG,WAAW,GAAG;EAC/C,IAAI,WAAW,aAAa,QAAQ,QAAQ,CAAC,GAAG;GAC9C,MAAM,WAAW,wBAAwB,QAAQ,UAAU,OAAO,OAAO;GACzE,IAAI,CAAC,UAAU,OAAO;IAAE,UAAU;IAAO,QAAQ;GAAW;GAC5D,IAAI;IACF,OAAO,YAAY,QAAQ,UAAU,OAAO,OAAO;GACrD,UAAU;IACR,SAAS,QAAQ;GACnB;EACF;EACA,IAAI,aAAa,QAAQ,UAAU,OAAO,WAAW,SAAS,GAC5D,OAAO,SAAS,QAAQ,UAAU,KAAK;EAGzC,MAAM,SAAS,WAAW,QAAQ,QAAQ;EAC1C,IAAI,OAAO,UAAU,WAAW;EAChC,IAAI,OAAO,UAAU,QACnB,OAAO;GAAE,UAAU;GAAO,QAAQ;GAAQ,QAAQ,OAAO;EAAM;EAGjE,MAAM,WAAW,wBAAwB,QAAQ,UAAU,OAAO,OAAO;EACzE,IAAI,CAAC,UAAU,OAAO;GAAE,UAAU;GAAO,QAAQ;EAAW;EAC5D,IAAI;GACF,OAAO,YAAY,QAAQ,UAAU,OAAO,OAAO;EACrD,UAAU;GACR,SAAS,QAAQ;EACnB;CACF;CAEA,MAAM,IAAI,oBAAoB,sCAAsC,QAAQ,UAAU;AACxF;AAMA,SAAS,wBACP,UACA,OACA,SACsB;CACtB,IAAI,YAAY,aAAa,QAAQ;CACrC,MAAM,cAAmE,CAAC;CAE1E,KAAK,IAAI,QAAQ,GAAG,QAAQ,IAAI,SAAS,GAAG;EAC1C,MAAM,QAAQ,WAAW,SAAS;EAClC,IAAI,MAAM,UAAU,WAAW;GAC7B,IAAI,CAAC,aAAa,WAAW,OAAO,WAAW,QAAQ,GAAG,OAAO,GAAG;GACpE,OAAO,EACL,eAAe;IACb,KAAK,MAAM,SAAS,aAAa,iBAAiB,MAAM,MAAM,MAAM,KAAK;IACzE,iBAAiB,WAAW,KAAK;GACnC,EACF;EACF;EACA,IAAI,MAAM,UAAU,QAAQ,OAAO;EACnC,YAAY,KAAK;GAAE,MAAM;GAAW,OAAO,MAAM;EAAM,CAAC;EACxD,YAAY,GAAG,UAAU,QAAQ,MAAM,MAAM;CAC/C;CAEA,MAAM,IAAI,oBAAoB,gDAAgD,SAAS,EAAE;AAC3F;AAEA,SAAS,YACP,UACA,OACA,SAC2B;CAC3B,MAAM,UAAU,WAAW,QAAQ;CACnC,IAAI,QAAQ,UAAU,QACpB,OAAO;EAAE,UAAU;EAAO,QAAQ;EAAQ,QAAQ,QAAQ;CAAM;CAElE,IAAI,QAAQ,UAAU,SAAS;EAC7B,MAAM,YAAY,GAAG,SAAS,SAAS,MAAM,MAAM,GAAG;EACtD,IAAI;GACF,WAAW,UAAU,SAAS;GAC9B,WAAW,SAAS;EACtB,SAAS,OAAO;GACd,IAAI,CAAC,UAAU,KAAK,GAAG,MAAM;EAC/B;CACF;CACA,IAAI,aAAa,UAAU,OAAO,aAAa,SAAS,GACtD,OAAO,SAAS,UAAU,KAAK;CAEjC,MAAM,SAAS,WAAW,QAAQ;CAClC,IAAI,OAAO,UAAU,QACnB,OAAO;EAAE,UAAU;EAAO,QAAQ;EAAQ,QAAQ,OAAO;CAAM;CAEjE,OAAO;EAAE,UAAU;EAAO,QAAQ;CAAW;AAC/C;AAEA,SAAS,SAAS,UAAkB,OAAuD;CACzF,OAAO;EACL,UAAU;EACV,MAAM;GACJ;GACA,eAAe,iBAAiB,UAAU,KAAK;EACjD;CACF;AACF;AAEA,SAAS,aAAa,UAAkB,OAA4B,QAAyB;CAC3F,MAAM,YAAY,GAAG,SAAS,GAAG,MAAM,IAAI,GAAG,MAAM,MAAM,GAAG,OAAO;CACpE,MAAM,aAAa,SACjB,WACA,UAAU,UAAU,UAAU,SAAS,UAAU,UACjD,GACF;CACA,IAAI;EACF,cAAc,YAAY,GAAG,eAAe,KAAK,EAAE,KAAK,MAAM;EAC9D,UAAU,UAAU;CACtB,SAAS,OAAO;EACd,UAAU,UAAU;EACpB,eAAe,SAAS;EACxB,MAAM;CACR;CACA,UAAU,UAAU;CAEpB,IAAI;EACF,SAAS,WAAW,QAAQ;EAC5B,OAAO;CACT,SAAS,OAAO;EACd,IAAI,CAAC,gBAAgB,KAAK,GAAG,MAAM;EACnC,OAAO;CACT,UAAU;EACR,eAAe,SAAS;CAC1B;AACF;AAEA,SAAS,WAAW,UAA8B;CAChD,MAAM,QAAQ,UAAU,QAAQ;CAChC,IAAI,CAAC,OAAO,OAAO,EAAE,OAAO,UAAU;CACtC,IAAI,MAAM,SAAS,SAAS,GAAG,OAAO;EAAE,OAAO;EAAQ;CAAM;CAC7D,IAAI;EACF,QAAQ,KAAK,MAAM,KAAK,CAAC;EACzB,OAAO;GAAE,OAAO;GAAQ;EAAM;CAChC,SAAS,OAAO;EACd,IAAI,gBAAgB,KAAK,GAAG,OAAO;GAAE,OAAO;GAAS;EAAM;EAC3D,OAAO;GAAE,OAAO;GAAQ;EAAM;CAChC;AACF;AAEA,SAAS,UAAU,UAAmD;CACpE,IAAI;CACJ,IAAI;EACF,WAAW,aAAa,UAAU,MAAM,CAAC,CAAC,KAAK;CACjD,SAAS,OAAO;EACd,IAAI,UAAU,KAAK,GAAG,OAAO,KAAA;EAC7B,MAAM;CACR;CAEA,IAAI;CACJ,IAAI;EACF,QAAQ,KAAK,MAAM,QAAQ;CAC7B,SAAS,OAAO;EACd,MAAM,aAAa,UAAU,KAAK;CACpC;CACA,IAAI,CAAC,QAAQ,KAAK,GAAG,MAAM,aAAa,QAAQ;CAChD,OAAO;AACT;AAEA,SAAS,QAAQ,OAA8C;CAC7D,IAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,KAAK,GAAG,OAAO;CAChF,MAAM,SAAS;CACf,OACE,OAAO,KAAK,MAAM,CAAC,CAAC,WAAW,KAC/B,OAAO,cAAc,OAAO,GAAG,KAC/B,OAAO,OAAO,GAAG,IAAI,KACrB,OAAO,OAAO,SAAS,YACvB,OAAO,KAAK,KAAK,CAAC,CAAC,SAAS,KAC5B,OAAO,OAAO,UAAU,YACxB,OAAO,MAAM,KAAK,CAAC,CAAC,SAAS;AAEjC;AAEA,SAAS,aAAa,UAAkB,OAAsC;CAC5E,MAAM,QAAQ,IAAI,oBAChB,0CAA0C,SAAS,4BACrD;CACA,IAAI,UAAU,KAAA,GAAW,OAAO,eAAe,OAAO,SAAS,EAAE,OAAO,MAAM,CAAC;CAC/E,OAAO;AACT;AAEA,SAAS,iBAAiB,UAAkB,OAAkC;CAC5E,MAAM,UAAU,UAAU,QAAQ;CAClC,IAAI,CAAC,SAAS;CACd,IAAI,eAAe,OAAO,MAAM,eAAe,KAAK,GAClD,MAAM,IAAI,oBAAoB,kDAAkD,SAAS,EAAE;CAE7F,IAAI;EACF,WAAW,QAAQ;CACrB,SAAS,OAAO;EACd,IAAI,CAAC,UAAU,KAAK,GAAG,MAAM;CAC/B;AACF;AAEA,SAAS,eAAe,OAAoC;CAC1D,OAAO,KAAK,UAAU;EAAE,MAAM,MAAM;EAAM,OAAO,MAAM;EAAO,KAAK,MAAM;CAAI,CAAC;AAChF;AAEA,SAAS,aAAa,UAA0B;CAC9C,OAAO,GAAG,SAAS;AACrB;AAEA,SAAS,gBAAgB,OAAyB;CAChD,OAAO,iBAAiB,SAAS,UAAU,SAAS,MAAM,SAAS;AACrE;AAEA,SAAS,UAAU,OAAyB;CAC1C,OAAO,iBAAiB,SAAS,UAAU,SAAS,MAAM,SAAS;AACrE;AAEA,SAAS,gBAAgB,OAAyB;CAChD,OAAO,iBAAiB,SAAS,UAAU,SAAS,MAAM,SAAS;AACrE;AAEA,SAAS,eAAe,MAAoB;CAC1C,IAAI;EACF,WAAW,IAAI;CACjB,SAAS,OAAO;EACd,IAAI,CAAC,UAAU,KAAK,GAAG,MAAM;CAC/B;AACF;;;;;;;;;;;;;;AC9RA,IAAa,QAAb,MAAmB;CACjB,SAAiB;CACjB,UAA8C,CAAC;CAE/C,MAAM,UAA+B;EACnC,IAAI,CAAC,KAAK,QAAQ;GAChB,KAAK,SAAS;GACd,aAAa,KAAK,QAAQ;EAC5B;EACA,OAAO,IAAI,SAAqB,YAAY;GAC1C,KAAK,QAAQ,WAAW;IACtB,cAAc,KAAK,QAAQ,CAAC;GAC9B,CAAC;EACH,CAAC;CACH;CAEA,UAAwB;EACtB,MAAM,OAAO,KAAK,QAAQ,MAAM;EAChC,IAAI,MACF,KAAK;OAEL,KAAK,SAAS;CAElB;CAEA,MAAM,aAAgB,IAAsC;EAC1D,MAAM,UAAU,MAAM,KAAK,QAAQ;EACnC,IAAI;GACF,OAAO,MAAM,GAAG;EAClB,UAAU;GACR,QAAQ;EACV;CACF;;CAGA,IAAI,WAAoB;EACtB,OAAO,KAAK;CACd;;CAGA,IAAI,UAAkB;EACpB,OAAO,KAAK,QAAQ;CACtB;AACF;;AAWA,eAAsB,mBAAsB,SAAqD;CAC/F,IAAI,CAAC,OAAO,cAAc,QAAQ,KAAK,KAAK,QAAQ,QAAQ,GAC1D,MAAM,IAAI,MAAM,GAAG,QAAQ,MAAM,sCAAsC;CAEzE,IAAI,CAAC,OAAO,cAAc,QAAQ,cAAc,KAAK,QAAQ,iBAAiB,GAC5E,MAAM,IAAI,MAAM,GAAG,QAAQ,MAAM,2CAA2C;CAG9E,MAAM,aAAa,IAAI,gBAAgB;CACvC,MAAM,wBAAwB,WAAW,MAAM,QAAQ,QAAQ,MAAM;CACrE,IAAI,QAAQ,QAAQ,SAAS,gBAAgB;MACxC,QAAQ,QAAQ,iBAAiB,SAAS,iBAAiB,EAAE,MAAM,KAAK,CAAC;CAE9E,MAAM,UAAU,IAAI,MAAS,QAAQ,KAAK;CAC1C,IAAI,YAAY;CAChB,IAAI,SAAS;CACb,IAAI;CACJ,MAAM,UAAU,MAAM,KACpB,EAAE,QAAQ,KAAK,IAAI,QAAQ,gBAAgB,QAAQ,KAAK,EAAE,GAC1D,YAAY;EACV,OAAO,CAAC,WAAW,OAAO,SAAS;GACjC,MAAM,QAAQ;GACd,aAAa;GACb,IAAI,SAAS,QAAQ,OAAO;GAC5B,IAAI;IACF,QAAQ,SAAS,MAAM,QAAQ,IAAI,OAAO,WAAW,MAAM;GAC7D,SAAS,OAAO;IACd,IAAI,CAAC,QAAQ;KACX,SAAS;KACT,eAAe;KACf,WAAW,MAAM,KAAK;IACxB;IACA;GACF;EACF;CACF,CACF;CAEA,IAAI;EACF,MAAM,QAAQ,IAAI,OAAO;EACzB,IAAI,QAAQ,QAAQ,SAAS,MAAM,WAAW,QAAQ,QAAQ,QAAQ,KAAK;EAC3E,IAAI,QAAQ,MAAM;EAClB,IAAI,WAAW,OAAO,SAAS,MAAM,WAAW,WAAW,QAAQ,QAAQ,KAAK;EAChF,OAAO;CACT,UAAU;EACR,QAAQ,QAAQ,oBAAoB,SAAS,eAAe;CAC9D;AACF;;;;;;AAOA,eAAsB,cACpB,OACA,aACA,KACA,QACc;CACd,OAAO,mBAAmB;EACxB,OAAO,MAAM;EACb,gBAAgB;EAChB,OAAO;EACP;EACA,IAAI,OAAO,QAAQ;GACjB,OAAO,IAAI,MAAM,QAAS,OAAO,MAAM;EACzC;CACF,CAAC;AACH;AAEA,SAAS,WAAW,QAAqB,OAAsB;CAC7D,OAAO,OAAO,kBAAkB,QAAQ,OAAO,yBAAS,IAAI,MAAM,GAAG,MAAM,SAAS;AACtF;;;;;;ACjHA,SAAgB,iBAAiB,MAAc,MAAc,SAAkC;CAC7F,UAAU,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;CAC5C,sBAAsB,MAAM,OAAO;CACnC,MAAM,KAAK,SAAS,MAAM,UAAU,UAAU,UAAU,WAAW,UAAU,UAAU,GAAK;CAC5F,IAAI;EACF,SAAS,IAAI,OAAO,KAAK,MAAM,MAAM,GAAG,OAAO;EAC/C,UAAU,EAAE;CACd,UAAU;EACR,UAAU,EAAE;CACd;CACA,eAAe,QAAQ,IAAI,CAAC;AAC9B;AAEA,SAAS,sBAAsB,MAAc,SAAkC;CAC7E,IAAI;CACJ,IAAI;EACF,KAAK,SAAS,MAAM,UAAU,MAAM;CACtC,SAAS,OAAO;EACd,IAAK,MAAgC,SAAS,UAAU;EACxD,MAAM,QAAQ,eAAe,GAAG,QAAQ,QAAQ,GAAG,KAAK,oCAAoC,EAC1F,OAAO,MACT,CAAC;CACH;CAEA,IAAI;EACF,MAAM,OAAO,UAAU,EAAE,CAAC,CAAC;EAC3B,IAAI,SAAS,KAAK,SAAS,IAAI,OAAO,CAAC,MAAM,IAAM;EACnD,MAAM,YAAY,mBAAmB,IAAI,IAAI;EAC7C,MAAM,cAAc,OAAO,MAAM,OAAO,WAAW,EAAI;EACvD,YAAY,YAAY,SAAS,KAAK;EACtC,WAAW,IAAI,aAAa,WAAW,OAAO;EAC9C,UAAU,EAAE;CACd,SAAS,OAAO;EACd,MAAM,QAAQ,eACZ,GAAG,QAAQ,QAAQ,GAAG,KAAK,4CAC3B,EAAE,OAAO,MAAM,CACjB;CACF,UAAU;EACR,UAAU,EAAE;CACd;AACF;;;;AAKA,SAAgB,0BACd,MACA,UACA,SACM;CACN,MAAM,YAAY,QAAQ,IAAI;CAC9B,UAAU,WAAW,EAAE,WAAW,KAAK,CAAC;CACxC,MAAM,gBAAgB,GAAG,KAAK;CAC9B,MAAM,KAAK,SACT,eACA,UAAU,UAAU,UAAU,WAAW,UAAU,SACnD,GACF;CACA,IAAI;EACF,SAAS,IAAI,OAAO,KAAK,UAAU,MAAM,GAAG,OAAO;EACnD,UAAU,EAAE;CACd,UAAU;EACR,UAAU,EAAE;CACd;CACA,WAAW,eAAe,IAAI;CAC9B,eAAe,SAAS;AAC1B;;;;;AAMA,SAAgB,iBAAiB,MAAc,SAAqC;CAClF,IAAI;EACF,OAAO,MAAM,EAAE,WAAW,KAAK,CAAC;CAClC,SAAS,OAAO;EACd,IAAK,MAAgC,SAAS,UAAU,OAAO;EAC/D,MAAM,QAAQ,eAAe,GAAG,QAAQ,QAAQ,GAAG,KAAK,wBAAwB,EAC9E,OAAO,MACT,CAAC;CACH;CACA,eAAe,QAAQ,IAAI,CAAC;CAC5B,OAAO;AACT;AAEA,SAAgB,mBAAsB,MAAc,SAA4B,KAAiB;CAC/F,MAAM,SAAS,sBAAsB,MAAM,SAAS,GAAG;CACvD,IAAI,CAAC,OAAO,UACV,MAAM,QAAQ,eAAe,GAAG,QAAQ,QAAQ,iBAAiB,KAAK,EAAE;CAE1E,OAAO,OAAO;AAChB;AAIA,SAAgB,sBACd,MACA,SACA,KACmB;CACnB,UAAU,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;CAC5C,MAAM,WAAW,GAAG,KAAK;CACzB,IAAI;EACF,MAAM,cAAc,yBAAyB,EAAE,SAAS,CAAC;EACzD,IAAI,CAAC,YAAY,UAAU,OAAO,EAAE,UAAU,MAAM;EACpD,IAAI;GACF,OAAO;IAAE,UAAU;IAAM,OAAO,IAAI;GAAE;EACxC,UAAU;GACR,YAAY,KAAK,QAAQ;EAC3B;CACF,SAAS,OAAO;EACd,IAAI,iBAAiB,qBACnB,MAAM,QAAQ,eAAe,MAAM,SAAS,EAAE,OAAO,MAAM,CAAC;EAE9D,MAAM;CACR;AACF;AAEA,SAAS,SAAS,IAAY,OAAe,SAAkC;CAC7E,IAAI,SAAS;CACb,OAAO,SAAS,MAAM,YAAY;EAChC,MAAM,UAAU,UAAU,IAAI,OAAO,QAAQ,MAAM,aAAa,MAAM;EACtE,IAAI,WAAW,GAAG,MAAM,QAAQ,eAAe,6BAA6B;EAC5E,UAAU;CACZ;AACF;AAEA,SAAS,WAAW,IAAY,OAAe,UAAkB,SAAkC;CACjG,IAAI,SAAS;CACb,OAAO,SAAS,MAAM,YAAY;EAChC,MAAM,UAAU,UAAU,IAAI,OAAO,QAAQ,MAAM,aAAa,QAAQ,WAAW,MAAM;EACzF,IAAI,WAAW,GAAG,MAAM,QAAQ,eAAe,6BAA6B;EAC5E,UAAU;CACZ;AACF;AAEA,SAAS,mBAAmB,IAAY,MAAsB;CAC5D,MAAM,QAAQ,OAAO,MAAM,KAAK,IAAI,MAAO,IAAI,CAAC;CAChD,IAAI,SAAS;CACb,OAAO,SAAS,GAAG;EACjB,MAAM,SAAS,KAAK,IAAI,MAAM,YAAY,MAAM;EAChD,UAAU;EACV,MAAM,OAAO,SAAS,IAAI,OAAO,GAAG,QAAQ,MAAM;EAClD,KAAK,IAAI,QAAQ,OAAO,GAAG,SAAS,GAAG,SAAS,GAC9C,IAAI,MAAM,WAAW,IAAM,OAAO,SAAS,QAAQ;CAEvD;CACA,OAAO;AACT;AAEA,SAAS,SAAS,IAAY,UAA0B;CACtD,MAAM,OAAO,OAAO,YAAY,CAAC;CAEjC,OADa,SAAS,IAAI,MAAM,GAAG,GAAG,QAC5B,MAAM,IAAI,KAAK,KAAM;AACjC;AAEA,SAAS,eAAe,MAAoB;CAC1C,MAAM,KAAK,SAAS,MAAM,UAAU,QAAQ;CAC5C,IAAI;EACF,UAAU,EAAE;CACd,UAAU;EACR,UAAU,EAAE;CACd;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACtIA,SAAgB,yBAAyB,aAA6B;CACpE,OAAO,GAAG,YAAY;AACxB;AAEA,MAAM,WACJ;;;;;;AAOF,SAAgB,0BACd,MACA,SACgC;CAChC,IAAI;CACJ,IAAI;EACF,OAAO,aAAa,MAAM,MAAM;CAClC,SAAS,OAAO;EACd,IAAK,MAAgC,SAAS,UAAU,OAAO;EAC/D,MAAM,QAAQ,eACZ,GAAG,QAAQ,QAAQ,sBAAsB,KAAK,qBAAqB,YACnE,EAAE,OAAO,MAAM,CACjB;CACF;CACA,IAAI;CACJ,IAAI;EACF,MAAM,KAAK,MAAM,IAAI;CACvB,SAAS,OAAO;EACd,MAAM,QAAQ,eACZ,GAAG,QAAQ,QAAQ,sBAAsB,KAAK,qBAAqB,YACnE,EAAE,OAAO,MAAM,CACjB;CACF;CACA,IAAI,OAAO,QAAQ,YAAY,QAAQ,QAAQ,MAAM,QAAQ,GAAG,GAC9D,MAAM,QAAQ,eACZ,GAAG,QAAQ,QAAQ,sBAAsB,KAAK,oBAAoB,UACpE;CAEF,MAAM,SAAS;CACf,MAAM,OAAO,OAAO,KAAK,MAAM,CAAC,CAAC,KAAK;CACtC,IACE,KAAK,WAAW,KAChB,KAAK,OAAO,gBACZ,KAAK,OAAO,UACZ,KAAK,OAAO,cAEZ,MAAM,QAAQ,eACZ,GAAG,QAAQ,QAAQ,sBAAsB,KAAK,aAAa,KAAK,KAAK,IAAI,EAAE,6CAA6C,UAC1H;CAEF,MAAM,EAAE,YAAY,MAAM,eAAe;CACzC,IAAI,OAAO,eAAe,YAAY,CAAC,OAAO,cAAc,UAAU,KAAK,cAAc,GACvF,MAAM,QAAQ,eACZ,GAAG,QAAQ,QAAQ,sBAAsB,KAAK,wCAAwC,UACxF;CAEF,IAAI,OAAO,SAAS,YAAY,SAAS,QAAQ,MAAM,QAAQ,IAAI,GACjE,MAAM,QAAQ,eACZ,GAAG,QAAQ,QAAQ,sBAAsB,KAAK,yBAAyB,UACzE;CAEF,MAAM,aAAa;CACnB,MAAM,WAAW,OAAO,KAAK,UAAU,CAAC,CAAC,KAAK;CAC9C,IAAI,SAAS,WAAW,KAAK,SAAS,OAAO,eAAe,SAAS,OAAO,YAC1E,MAAM,QAAQ,eACZ,GAAG,QAAQ,QAAQ,sBAAsB,KAAK,kBAAkB,SAAS,KAAK,IAAI,EAAE,oCAAoC,UAC1H;CAEF,MAAM,EAAE,UAAU,cAAc;CAChC,IAAI,OAAO,aAAa,YAAY,CAAC,OAAO,cAAc,QAAQ,KAAK,WAAW,GAChF,MAAM,QAAQ,eACZ,GAAG,QAAQ,QAAQ,sBAAsB,KAAK,+CAA+C,UAC/F;CAEF,IAAI,OAAO,cAAc,YAAY,CAAC,oBAAoB,KAAK,SAAS,GACtE,MAAM,QAAQ,eACZ,GAAG,QAAQ,QAAQ,sBAAsB,KAAK,yCAAyC,UACzF;CAEF,OAAO;EACL,MAAM;GAAE;GAAqB;EAAwB;EACrD;EACA;CACF;AACF;;;;;;;;AASA,SAAgB,2BACd,MACA,UACA,SACM;CACN,MAAM,OAAO,KAAK,UAAU;EAC1B,YAAY,SAAS;EACrB,MAAM,SAAS;EACf,YAAY,SAAS;CACvB,CAAC;CACD,IAAI;EACF,0BAA0B,MAAM,GAAG,KAAK,KAAK,OAAO;CACtD,SAAS,OAAO;EACd,MAAM,QAAQ,eACZ,GAAG,QAAQ,QAAQ,sBAAsB,KAAK,wBAC9C,EAAE,OAAO,MAAM,CACjB;CACF;AACF;;;;;AAMA,SAAgB,4BAA4B,MAAc,SAAkC;CAC1F,iBAAiB,MAAM,OAAO;CAC9B,iBAAiB,GAAG,KAAK,OAAO,OAAO;AACzC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC1GA,SAAgB,mBAAmB,aAA6B;CAC9D,OAAO,GAAG,YAAY;AACxB;AAEA,MAAM,wBACJ;;;;;AAMF,SAAgB,oBACd,MACA,SAC0B;CAC1B,IAAI;CACJ,IAAI;EACF,OAAO,aAAa,MAAM,MAAM;CAClC,SAAS,OAAO;EACd,IAAK,MAAgC,SAAS,UAAU,OAAO;EAC/D,MAAM,QAAQ,eACZ,GAAG,QAAQ,QAAQ,gBAAgB,KAAK,qBAAqB,yBAC7D,EAAE,OAAO,MAAM,CACjB;CACF;CACA,IAAI;CACJ,IAAI;EACF,MAAM,KAAK,MAAM,IAAI;CACvB,SAAS,OAAO;EACd,MAAM,QAAQ,eACZ,GAAG,QAAQ,QAAQ,gBAAgB,KAAK,qBAAqB,yBAC7D,EAAE,OAAO,MAAM,CACjB;CACF;CACA,IAAI,OAAO,QAAQ,YAAY,QAAQ,QAAQ,MAAM,QAAQ,GAAG,GAC9D,MAAM,QAAQ,eACZ,GAAG,QAAQ,QAAQ,gBAAgB,KAAK,oBAAoB,uBAC9D;CAEF,MAAM,SAAS;CACf,MAAM,OAAO,OAAO,KAAK,MAAM,CAAC,CAAC,KAAK;CACtC,IAAI,KAAK,WAAW,KAAK,KAAK,OAAO,eAAe,KAAK,OAAO,YAC9D,MAAM,QAAQ,eACZ,GAAG,QAAQ,QAAQ,gBAAgB,KAAK,aAAa,KAAK,KAAK,IAAI,EAAE,oCAAoC,uBAC3G;CAEF,MAAM,EAAE,UAAU,cAAc;CAChC,IAAI,OAAO,aAAa,YAAY,CAAC,OAAO,cAAc,QAAQ,KAAK,WAAW,GAChF,MAAM,QAAQ,eACZ,GAAG,QAAQ,QAAQ,gBAAgB,KAAK,0CAA0C,uBACpF;CAEF,IAAI,OAAO,cAAc,YAAY,CAAC,oBAAoB,KAAK,SAAS,GACtE,MAAM,QAAQ,eACZ,GAAG,QAAQ,QAAQ,gBAAgB,KAAK,oCAAoC,uBAC9E;CAEF,OAAO;EAAE;EAAqB;CAAwB;AACxD;;;;;;;;;;AAWA,SAAgB,qBACd,MACA,MACA,SACM;CACN,IAAI;EACF,0BAA0B,MAAM,GAAG,gBAAgB,IAAI,EAAE,KAAK,OAAO;CACvE,SAAS,OAAO;EACd,MAAM,QAAQ,eAAe,GAAG,QAAQ,QAAQ,gBAAgB,KAAK,wBAAwB,EAC3F,OAAO,MACT,CAAC;CACH;AACF;;;;;;;AAmBA,SAAgB,qBACd,MACA,SAC0B;CAC1B,IAAI,OAAiC;CACrC,IAAI,aAAa;CACjB,IAAI;EACF,OAAO,oBAAoB,MAAM,OAAO;CAC1C,SAAS,OAAO;EAId,aAAa,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;CACpE;CACA,MAAM,UAAU,iBAAiB,MAAM,OAAO;CAC9C,IAAI;CACJ,IAAI;EAGF,iBAAiB,GAAG,KAAK,OAAO,OAAO;CACzC,SAAS,OAAO;EACd,eAAe,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;CACtE;CACA,MAAM,UAAU,iBAAiB,KAAA,IAAY,CAAC,IAAI,EAAE,aAAa;CACjE,IAAI,CAAC,SAAS,OAAO;EAAE,SAAS;EAAO,GAAG;CAAQ;CAClD,IAAI,SAAS,MAAM,OAAO;EAAE,SAAS;EAAM,MAAM;EAAM;EAAY,GAAG;CAAQ;CAC9E,OAAO;EAAE,SAAS;EAAM;EAAM,GAAG;CAAQ;AAC3C;;;;;;AAgBA,SAAgB,gCACd,SACA,MACA,SACA,QACM;CAIN,IAAI,OAAO,WAAW,YAAY,WAAW,MAC3C,MAAM,IAAI,UACR,6FACF;CAEF,MAAM,EAAE,SAAS,oBAAoB;CACrC,MAAM,SAAS,QAAQ,GAAG,KAAK,QAAQ;CACvC,IAAI,WAAW,KAAA,GACb,MAAM,QAAQ,eACZ,GAAG,QAAQ,gBAAgB,gBAAgB,iBAAiB,KAAK,SAAS,IAAI,KAAK,UAAU,wBAAwB,QAAQ,OAAO,gKACtI;CAEF,IAAI,OAAO,aAAa,KAAK,UAC3B,MAAM,QAAQ,eACZ,GAAG,QAAQ,kBAAkB,KAAK,SAAS,oBAAoB,OAAO,SAAS,uDAAuD,iBACxI;CAEF,IAAI,OAAO,cAAc,KAAK,WAC5B,MAAM,QAAQ,eACZ,GAAG,QAAQ,4BAA4B,KAAK,SAAS,WAAW,OAAO,UAAU,wBAAwB,gBAAgB,YAAY,KAAK,UAAU,qHACtJ;AAEJ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC1CA,MAAM,iCAAiB,IAAI,IAAmB;AAE9C,SAAS,SAAS,MAAqB;CACrC,MAAM,WAAW,eAAe,IAAI,IAAI;CACxC,IAAI,UAAU,OAAO;CACrB,MAAM,QAAQ,IAAI,MAAM;CACxB,eAAe,IAAI,MAAM,KAAK;CAC9B,OAAO;AACT;;;;AAKA,IAAa,oBAAb,MAAiG;CAC/F;;CAEA;;;CAGA;CACA;CACA;CACA;CACA;CACA,WAAqF;CAErF,YACE,MACA,OACA,UAAoC,CAAC,GACrC;EACA,KAAK,OAAO,QAAQ,IAAI;EACxB,KAAK,kBAAkB,mBAAmB,KAAK,IAAI;EACnD,KAAK,wBAAwB,yBAAyB,KAAK,IAAI;EAC/D,KAAK,QAAQ;EACb,KAAK,QAAQ,SAAS,KAAK,IAAI;EAC/B,KAAK,qBAAqB,QAAQ,uBAAuB;EACzD,KAAK,gBACH,MAAM,uBAAuB,KAAA,KAAa,QAAQ,sBAAsB,KAAA,IACpE,QAAQ,kBAAkB,eAC1B;CACR;CAEA,MAAM,SAA8B;EAClC,OAAO,KAAK,aAAa,KAAK,KAAK,KAAK,kBAAkB,CAAC,CAAC,UAAU,SAAS,CAAC;CAClF;CAEA,MAAM,OACJ,OACA,UAA+B,CAAC,GACuC;EACvE,OAAO,KAAK,aAAa;GACvB,MAAM,QAAQ,KAAK,KAAK,KAAK,kBAAkB;GAC/C,MAAM,mBAAmB,MAAM,kBAAkB,IAAI,MAAM,OAAO;GAClE,IAAI,qBAAqB,KAAA,GAAW;IAClC,MAAM,WAAW,KAAK,QAAQ,OAAO,gBAAgB;IACrD,IAAI,gBAAgB,SAAS,KAAK,MAAM,gBAAgB,KAAK,GAC3D,MAAM,KAAK,MAAM,cACf,WAAW,MAAM,QAAQ,uCAC3B;IAEF,IAAI,QAAQ,YAAY,MAAM,KAAK,gBAAgB,OAAO,QAAQ;IAClE,OAAO;KAAE,OAAO;KAAU,UAAU;KAAO,YAAY,MAAM,UAAU,SAAS;IAAE;GACpF;GAEA,MAAM,WAAW,MAAM,QAAQ;GAC/B,MAAM,WAAW;IACf,GAAG,KAAK,MAAM;IACd;IACA,cAAc,MAAM,MAAM,MAAM,aAAa;IAC7C;GACF;GACA,MAAM,OAAO,gBAAgB;IAAE,GAAG;IAAU,WAAW,cAAc,QAAQ;GAAE,CAAC;GAIhF,MAAM,QAAQ,SAAS,MAAM;IAAE,MAAM,KAAK;IAAM,MAAM,WAAW;GAAE,GAAG,KAAK,KAAK;GAEhF,WAAW,OAAO,OADN,OAAO,KAAK,GAAG,KAAK,KAAK,MACV,GAAG,KAAK,KAAK;GACxC,iBAAiB,KAAK,MAAM,GAAG,KAAK,KAAK,KAAK,KAAK;GACnD,IAAI,QAAQ,YAAY,MAAM;IAO5B,MAAM,OAAO;KAAE,UAAU,MAAM;KAAU,WAAW,MAAM;IAAU;IACpE,qBAAqB,KAAK,iBAAiB,MAAM,KAAK,KAAK;IAC3D,MAAM,MAAM;IACZ,KAAK,4BAA4B,KAAK;GACxC;GACA,OAAO;IAAE;IAAO,UAAU;IAAM,YAAY,MAAM,UAAU,SAAS;GAAE;EACzE,CAAC;CACH;;CAGA,MAAM,cAAiD;EACrD,OAAO,KAAK,MAAM,mBAChB,mBAAmB,KAAK,MAAM,KAAK,aACjC,oBAAoB,KAAK,iBAAiB,KAAK,KAAK,CACtD,CACF;CACF;;;;CAKA,MAAM,iBAA6C;EACjD,OAAO,KAAK,aAAa;GAGvB,MAAM,QAAQ,KAAK,KAAK,KAAK;GAC7B,IAAI,MAAM,SAAS,MACjB,MAAM,KAAK,MAAM,eACf,GAAG,KAAK,MAAM,QAAQ,GAAG,KAAK,KAAK,mCACrC;GAEF,MAAM,OAA0B;IAC9B,UAAU,MAAM,KAAK,MAAM;IAC3B,WAAW,MAAM,KAAK,MAAM;GAC9B;GACA,qBAAqB,KAAK,iBAAiB,MAAM,KAAK,KAAK;GAC3D,MAAM,MAAM;GAOZ,IAAI,KAAK,kBAAkB,MAAM,KAAK,0BAA0B,KAAK;GACrE,OAAO;EACT,CAAC;CACH;;;;;;;;CASA,MAAM,mBAAsD;EAC1D,OAAO,KAAK,aAAa;GACvB,MAAM,UAAU,qBAAqB,KAAK,iBAAiB,KAAK,KAAK;GAQrE,4BAA4B,KAAK,uBAAuB,KAAK,KAAK;GAClE,IAAI,KAAK,aAAa,MAAM;IAC1B,KAAK,SAAS,MAAM;IACpB,KAAK,SAAS,mBAAmB;GACnC;GACA,OAAO;EACT,CAAC;CACH;;;;CAKA,OAAkB,KAA0B;EAC1C,OAAO,KAAK,MAAM,mBAChB,mBAAmB,KAAK,MAAM,KAAK,aAAa;GAC9C,IAAI;IACF,OAAO,IAAI;GACb,SAAS,OAAO;IACd,KAAK,WAAW;IAChB,MAAM;GACR;EACF,CAAC,CACH;CACF;;;;CAKA,KAAa,YAAgF;EAC3F,IAAI,QAAQ,KAAK;EACjB,MAAM,KAAK,eAAe,KAAK,MAAM,KAAK,KAAK;EAC/C,IAAI,OAAO,MAAM;GAEf,IAAI,UAAU,QAAQ,MAAM,OAAO,GAAG,QAAQ,aAAa,KAAK,KAAK;GACrE,KAAK,WAAW;GAChB,KAAK,UAAU,OAAO,UAAU;GAChC,OAAO;EACT;EACA,IAAI;GACF,MAAM,QAAQ,UAAU,IAAI,EAAE,QAAQ,KAAK,CAAC;GAC5C,MAAM,OAAO,OAAO,MAAM,IAAI;GAC9B,MAAM,WAAW;IAAE,KAAK,MAAM;IAAK,KAAK,MAAM;GAAI;GAClD,IACE,UAAU,QACT,MAAM,aAAa,SACjB,MAAM,SAAS,QAAQ,SAAS,OAAO,MAAM,SAAS,QAAQ,SAAS,QAC1E,OAAO,MAAM,QACb,CAAC,YAAY,IAAI,MAAM,MAAM,MAAM,MAAM,OAAO,IAAI,GAOpD,SAAS,OAAO,IAAI,KAAK,iBAAiB,IAAI,IAAI,IAAI,SAAS,aAAa,KAAK,KAAK;GAExF,MAAM,WAAW;GACjB,KAAK,WAAW;GAChB,IAAI,OAAO,MAAM,MACf,cAAc,OAAO,UAAU,IAAI,MAAM,MAAM,IAAI,GAAG,KAAK,MAAM,KAAK,KAAK;EAE/E,UAAU;GACR,UAAU,EAAE;EACd;EACA,KAAK,UAAU,OAAO,UAAU;EAChC,OAAO;CACT;CAEA,UACE,OACA,YACM;EACN,MAAM,SAAS,oBAAoB,KAAK,iBAAiB,KAAK,KAAK;EACnE,MAAM,QAAQ,MAAM,QAAQ;EAC5B,IAAI,WAAW,MAAM;GACnB,MAAM,MAAM;GACZ,IAAI,cAAc,QAAQ,GACxB,MAAM,KAAK,MAAM,eACf,GAAG,KAAK,MAAM,QAAQ,GAAG,KAAK,KAAK,OAAO,MAAM,kCAAkC,KAAK,gBAAgB,wIACzG;GAEF;EACF;EAGA,IAAI,MAAM,KAAK,aAAa,OAAO,YAAY,MAAM,IAAI,cAAc,OAAO,WAC5E;EAMF,gCAAgC;GADhB,QAAQ;GAAO,KAAK,aAAqB,KAAK,QAAQ,OAAO,QAAQ;EACjD,GAAG,QAAQ,KAAK,OAAO;GACzD,SAAS,GAAG,KAAK,MAAM,QAAQ,GAAG,KAAK;GACvC,iBAAiB,KAAK;EACxB,CAAC;EACD,MAAM,MAAM;CACd;;;;;;;;;;;;;CAcA,gBACE,OACA,OACM;EACN,MAAM,SAAS,MAAM;EACrB,IAAI,WAAW,MACT;OAAA,MAAM,aAAa,MAAM,QAAQ,SAAS,GAAG;EAAA,OAC5C,IAAI,OAAO,YAAY,MAAM,UAClC;EAEF,MAAM,OAAO;GAAE,UAAU,MAAM;GAAU,WAAW,MAAM;EAAU;EACpE,qBAAqB,KAAK,iBAAiB,MAAM,KAAK,KAAK;EAC3D,MAAM,MAAM;EACZ,KAAK,4BAA4B,KAAK;CACxC;;;;;;;;CASA,4BACE,OACM;EACN,IAAI,KAAK,MAAM,uBAAuB,KAAA,KAAa,KAAK,kBAAkB,MAAM;EAChF,IAAI,MAAM,QAAQ,QAAQ,MAAM,IAAI,aAAa,MAAM,MAAM,MAAM,UAAU;EAC7E,IACE,MAAM,qBAAqB,QAC3B,MAAM,IAAI,WAAW,MAAM,mBAAmB,KAAK,eAEnD;EAEF,KAAK,0BAA0B,KAAK;CACtC;;;;CAKA,0BACE,OACM;EACN,MAAM,OAAO,MAAM;EACnB,MAAM,aAAa,KAAK,MAAM,mBAAoB,UAAU,MAAM,UAAU,SAAS,CAAC;EACtF,MAAM,WAAoC;GAAE;GAAM,YAAY,MAAM;GAAM;EAAW;EACrF,2BAA2B,KAAK,uBAAuB,UAAU,KAAK,KAAK;EAC3E,MAAM,mBAAmB,KAAK;CAChC;;;;;;;;;;;;;;;CAgBA,iBACE,IACA,MACkE;EAClE,MAAM,UAAU,KAAK,MAAM;EAC3B,IAAI,YAAY,KAAA,GAAW,OAAO;EAClC,MAAM,SAAS,0BAA0B,KAAK,uBAAuB,KAAK,KAAK;EAC/E,IAAI,WAAW,MAAM,OAAO;EAO5B,MAAM,MAAM,oBAAoB,KAAK,iBAAiB,KAAK,KAAK;EAChE,IAAI,QAAQ,QAAQ,OAAO,KAAK,WAAW,IAAI,UAAU,OAAO;EAChE,IAAI,OAAO,cAAc,KAAK,OAAO,aAAa,MAAM,OAAO;EAG/D,MAAM,OAAO,UADE,UAAU,IAAI,GAAG,OAAO,UACX,GAAG,KAAK,MAAM,KAAK,KAAK;EACpD,IAAI,KAAK,WAAW,OAAO,KAAK,WAAW,GACzC,MAAM,KAAK,MAAM,eACf,GAAG,KAAK,MAAM,QAAQ,GAAG,KAAK,KAAK,sBAAsB,KAAK,sBAAsB,WAAW,OAAO,KAAK,WAAW,EAAE,wBAAwB,OAAO,WAAW,6BAA6B,KAAK,QACtM;EAGF,MAAM,UAAoB,CAAC;EAC3B,MAAM,oCAAoB,IAAI,IAAoB;EAClD,IAAI,eAAkC;EACtC,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,GAAG,SAAS,GAAG;GACvD,MAAM,MAAM,KAAK;GACjB,QAAQ,KAAK,IAAI,KAAK;GACtB,IAAI;GACJ,IAAI;IACF,MAAM,KAAK,MAAM,IAAI,IAAI;GAC3B,SAAS,OAAO;IACd,MAAM,KAAK,MAAM,eACf,GAAG,KAAK,MAAM,QAAQ,GAAG,KAAK,KAAK,4BAA4B,QAAQ,KACvE,EAAE,OAAO,MAAM,CACjB;GACF;GACA,IAAI,gBAAgB,GAAG,MAAM,IAAI,MAC/B,MAAM,KAAK,MAAM,eACf,GAAG,KAAK,MAAM,QAAQ,GAAG,KAAK,KAAK,mCAAmC,QAAQ,GAChF;GAEF,MAAM,SAAS;GAMf,IAAI,OAAO,aAAa,OACtB,MAAM,KAAK,MAAM,eACf,iBAAiB,QAAQ,EAAE,gBAAgB,OAAO,OAAO,QAAQ,EAAE,aAAa,OAClF;GAEF,KAAK,OAAO,gBAAgB,UAAU,cACpC,MAAM,KAAK,MAAM,eACf,iBAAiB,QAAQ,EAAE,mCAC7B;GAEF,MAAM,EAAE,WAAW,GAAG,aAAa;GACnC,MAAM,WAAW,cAAc,QAAQ;GACvC,IAAI,cAAc,UAChB,MAAM,KAAK,MAAM,eACf,iBAAiB,QAAQ,EAAE,2BAA2B,SAAS,QAAQ,OAAO,SAAS,GACzF;GAEF,MAAM,UAAU,OAAO,OAAO;GAC9B,IAAI,OAAO,YAAY,YAAY,YAAY,IAC7C,MAAM,KAAK,MAAM,eAAe,iBAAiB,QAAQ,EAAE,gBAAgB;GAE7E,IAAI,kBAAkB,IAAI,OAAO,GAC/B,MAAM,KAAK,MAAM,eAAe,qBAAqB,QAAQ,mBAAmB;GAElF,kBAAkB,IAAI,SAAS,KAAK;GACpC,eAAe;EACjB;EAIA,MAAM,WAAW,KAAK,KAAK,SAAS;EACpC,QAAQ,KAAK,SAAS,KAAK;EAC3B,MAAM,QAAQ,SACZ,SAAS,MACT;GAAE,MAAM,KAAK;GAAM,MAAM,OAAO,KAAK,WAAW;EAAE,GAClD,KAAK,KACP;EACA,MAAM,EAAE,WAAW,eAAe,GAAG,qBAAqB;EAC1D,IACE,MAAM,aAAa,OAAO,KAAK,YAC/B,MAAM,iBAAiB,gBACvB,MAAM,cAAc,OAAO,KAAK,aAChC,cAAc,gBAAgB,MAAM,OAAO,KAAK,WAEhD,MAAM,KAAK,MAAM,eACf,GAAG,KAAK,MAAM,QAAQ,GAAG,KAAK,KAAK,sBAAsB,KAAK,sBAAsB,0CAA0C,OAAO,KAAK,UAC5I;EAEF,KAAK,MAAM,iBAAiB,OAAO,OAAO,KAAK,QAAQ;EACvD,IAAI,kBAAkB,IAAI,MAAM,MAAM,OAAO,GAC3C,MAAM,KAAK,MAAM,eAAe,qBAAqB,MAAM,MAAM,QAAQ,mBAAmB;EAE9F,kBAAkB,IAAI,MAAM,MAAM,SAAS,MAAM,QAAQ;EAEzD,IAAI;EACJ,IAAI;GACF,YAAY,QAAQ,QAAQ,OAAO,UAAU;EAC/C,SAAS,OAAO;GACd,MAAM,KAAK,MAAM,eACf,GAAG,KAAK,MAAM,QAAQ,GAAG,KAAK,KAAK,sBAAsB,KAAK,sBAAsB,yBACpF,EAAE,OAAO,MAAM,CACjB;EACF;EAEA,OAAO;GACL,UAAU;GACV,MAAM,OAAO;GACb;GACA,MAAM;IAAE;IAAO,KAAK,OAAO,KAAK,GAAG,SAAS,KAAK,KAAK,MAAM;GAAE;GAC9D;GACA;GACA,KAAK;GACL,kBAAkB,OAAO,KAAK;EAChC;CACF;;;;;;CAOA,QACE,OACA,UAC0C;EAC1C,MAAM,QAAQ,MAAM,QAAQ;EAC5B,IAAI,CAAC,OAAO,cAAc,QAAQ,KAAK,WAAW,KAAK,YAAY,OAAO,OAAO,KAAA;EACjF,IAAI,aAAa,QAAQ,GAAG,OAAO,MAAM,KAAM;EAC/C,MAAM,gBACJ,KAAK,MAAM,eACT,GAAG,KAAK,MAAM,QAAQ,GAAG,KAAK,KAAK,gCAAgC,SAAS,+BAC9E;EACF,MAAM,KAAK,eAAe,KAAK,MAAM,KAAK,KAAK;EAC/C,IAAI,OAAO,MAAM,MAAM,QAAQ;EAC/B,IAAI;EACJ,IAAI;GACF,QAAQ,UAAU,IAAI,MAAM,QAAQ,WAAY,MAAM,IAAI;EAC5D,UAAU;GACR,UAAU,EAAE;EACd;EACA,MAAM,OAAO,UAAU,OAAO,KAAK,MAAM,KAAK,KAAK;EACnD,IAAI,KAAK,WAAW,QAAQ,UAAU,MAAM,QAAQ;EACpD,IAAI;EACJ,IAAI;EACJ,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,QAAQ,SAAS,GAAG;GACnD,MAAM,QAAQ,SACZ,KAAK,MAAM,CAAE,MACb;IAAE,MAAM,KAAK;IAAM,MAAM,WAAW,QAAQ;GAAE,GAC9C,KAAK,KACP;GACA,MAAM,EAAE,WAAW,GAAG,aAAa;GACnC,IACE,MAAM,aAAa,WAAW,SAC9B,cAAc,QAAQ,MAAM,aAC3B,aAAa,KAAA,KAAa,MAAM,iBAAiB,SAAS,WAE3D,MAAM,QAAQ;GAEhB,UAAU;GACV,WAAW;EACb;EACA,IAAI,UAAU,cAAc,MAAM,KAAM,MAAM,WAAW,MAAM,QAAQ;EACvE,OAAO;CACT;AACF;;;;;;;;AAgBA,IAAa,sBAAb,MAAmG;CACjG;CACA;CACA;CACA,WAIW;CAEX,YACE,MACA,OACA,OACA;EACA,KAAK,OAAO;EACZ,KAAK,QAAQ;EACb,KAAK,QAAQ;CACf;CAEA,MAAM,SAA8B;EAClC,OAAO,KAAK,cAAc,KAAK,KAAK,CAAC,CAAC,QAAQ,UAAU,SAAS,CAAC;CACpE;CAEA,MAAM,OACJ,OACuE;EACvE,OAAO,KAAK,cAAc;GACxB,MAAM,WAAW,KAAK,KAAK;GAC3B,MAAM,EAAE,SAAS,YAAY;GAC7B,MAAM,mBAAmB,QAAQ,kBAAkB,IAAI,MAAM,OAAO;GACpE,IAAI,qBAAqB,KAAA,GAAW;IAClC,MAAM,WAAW,QAAQ;IACzB,IAAI,gBAAgB,SAAS,KAAK,MAAM,gBAAgB,KAAK,GAC3D,MAAM,KAAK,MAAM,cACf,WAAW,MAAM,QAAQ,uCAC3B;IAEF,OAAO;KAAE,OAAO;KAAU,UAAU;KAAO,YAAY,QAAQ,UAAU,SAAS;IAAE;GACtF;GACA,MAAM,WAAW,QAAQ;GACzB,MAAM,WAAW;IACf,GAAG,KAAK,MAAM;IACd;IACA,cAAc,QAAQ,MAAM,MAAM,aAAa;IAC/C;GACF;GACA,MAAM,OAAO,gBAAgB;IAAE,GAAG;IAAU,WAAW,cAAc,QAAQ;GAAE,CAAC;GAChF,MAAM,QAAQ,SAAS,MAAM;IAAE,MAAM,KAAK;IAAM,MAAM,WAAW;GAAE,GAAG,KAAK,KAAK;GAChF,WAAW,SAAS,OAAO,OAAO,KAAK,GAAG,KAAK,KAAK,MAAM,GAAG,KAAK,KAAK;GACvE,QAAQ,KAAK,KAAK;GAClB,SAAS,OAAO,GAAG,SAAS,OAAO,KAAK;GACxC,KAAK,MAAM,MAAM,KAAK,MAAM,SAAS,IAAI;GACzC,OAAO;IAAE;IAAO,UAAU;IAAM,YAAY,QAAQ,UAAU,SAAS;GAAE;EAC3E,CAAC;CACH;;CAGA,OAAwF;EACtF,MAAM,OAAO,KAAK,MAAM,KAAK,KAAK,IAAI,KAAK;EAC3C,IAAI,KAAK,UAAU,SAAS,MAAM,OAAO,KAAK;EAC9C,MAAM,UAAU,aAAa,KAAK,KAAK;EACvC,MAAM,UAA0C,CAAC;EACjD,MAAM,QAAQ,OAAO,KAAK,MAAM,MAAM;EACtC,KAAK,MAAM,OAAO,UAAU,OAAO,KAAK,MAAM,KAAK,KAAK,GAAG;GACzD,MAAM,QAAQ,SAAS,IAAI,MAAM;IAAE,MAAM,KAAK;IAAM,MAAM,QAAQ,SAAS;GAAE,GAAG,KAAK,KAAK;GAC1F,WAAW,SAAS,OAAO,OAAO,KAAK,MAAM,SAAS,IAAI,OAAO,IAAI,GAAG,CAAC,GAAG,KAAK,KAAK;GACtF,QAAQ,KAAK,KAAK;EACpB;EACA,KAAK,WAAW;GAAE;GAAM;GAAS;EAAQ;EACzC,OAAO,KAAK;CACd;;CAGA,MAAc,QAAW,KAA0B;EACjD,IAAI;GACF,OAAO,IAAI;EACb,SAAS,OAAO;GACd,KAAK,WAAW;GAChB,MAAM;EACR;CACF;AACF;;AAGA,SAAgB,iBACd,MACA,MACA,OACY;CACZ,MAAM,QAAQ,aAAa,KAAK;CAChC,cAAc,OAAO,OAAO,KAAK,MAAM,MAAM,GAAG,MAAM,KAAK;CAC3D,OAAO,MAAM,UAAU,SAAS;AAClC;AAEA,SAAS,aACP,OAC2D;CAC3D,OAAO;EACL,UAAU;EACV,MAAM;EACN,SAAS,CAAC;EACV,MAAM;EACN,mCAAmB,IAAI,IAAI;EAC3B,WAAW,MAAM,gBAAgB;EACjC,KAAK;EACL,kBAAkB;CACpB;AACF;;;AAIA,SAAS,cACP,OACA,OACA,MACA,OACM;CACN,MAAM,OAAO,UAAU,OAAO,MAAM,KAAK;CACzC,KAAK,MAAM,EAAE,MAAM,OAAO,SAAS,MAGjC,WAAW,OAFG,SAAS,MAAM;EAAE;EAAM,MAAM,MAAM,QAAQ,SAAS;CAAE,GAAG,KAEjD,GAAG,OAAO,KAAK,MAAM,SAAS,OAAO,GAAG,CAAC,GAAG,KAAK;AAE3E;;;AAIA,SAAS,WACP,OACA,OACA,KACA,OACM;CACN,MAAM,QAAQ,MAAM,QAAQ;CAC5B,MAAM,iBAAiB,OAAO,KAAK;CACnC,IAAI,MAAM,aAAa,OACrB,MAAM,MAAM,eACV,SAAS,MAAM,MAAM,QAAQ,gBAAgB,MAAM,SAAS,aAAa,OAC3E;CAEF,IAAI,MAAM,kBAAkB,MAAM,MAAM,MAAM,aAAa,OACzD,MAAM,MAAM,eAAe,SAAS,MAAM,MAAM,QAAQ,mCAAmC;CAE7F,MAAM,EAAE,WAAW,YAAY,GAAG,aAAa;CAC/C,MAAM,eAAe,cAAc,QAAQ;CAC3C,IAAI,MAAM,cAAc,cACtB,MAAM,MAAM,eACV,SAAS,MAAM,MAAM,QAAQ,2BAA2B,aAAa,QAAQ,MAAM,WACrF;CAEF,IAAI,MAAM,kBAAkB,IAAI,MAAM,MAAM,OAAO,GACjD,MAAM,MAAM,eAAe,qBAAqB,MAAM,MAAM,QAAQ,mBAAmB;CAEzF,MAAM,UAAU,MAAM,OAAO,KAAK;CAClC,MAAM,kBAAkB,IAAI,MAAM,MAAM,SAAS,KAAK;CACtD,MAAM,QAAQ,KAAK,MAAM,IAAI;CAC7B,MAAM,QAAQ,IAAI;CAClB,MAAM,OAAO;EAAE;EAAO;CAAI;AAC5B;;;AAIA,SAAS,SACP,MACA,SACA,OAC8B;CAC9B,MAAM,EAAE,MAAM,SAAS;CACvB,IAAI;CACJ,IAAI;EACF,MAAM,KAAK,MAAM,IAAI;CACvB,SAAS,OAAO;EACd,MAAM,MAAM,eAAe,GAAG,MAAM,QAAQ,GAAG,KAAK,4BAA4B,QAAQ,EACtF,OAAO,MACT,CAAC;CACH;CACA,MAAM,QAAQ,MAAM,WAAW,KAAK,OAAO;CAC3C,IAAI;CACJ,IAAI;EACF,YAAY,gBAAgB,KAAK;CACnC,SAAS,OAAO;EACd,MAAM,MAAM,eACV,GAAG,MAAM,QAAQ,GAAG,KAAK,iDAAiD,QAC1E,EAAE,OAAO,MAAM,CACjB;CACF;CACA,IAAI,SAAS,WACX,MAAM,MAAM,eAAe,GAAG,MAAM,QAAQ,GAAG,KAAK,mCAAmC,MAAM;CAE/F,OAAO,wBAAwB,KAAK;AACtC;AASA,SAAS,UAAU,OAAe,MAAc,SAA0C;CACxF,IAAI,MAAM,eAAe,GAAG,OAAO,CAAC;CACpC,IAAI,MAAM,MAAM,aAAa,OAAO,IAClC,MAAM,QAAQ,eACZ,GAAG,QAAQ,QAAQ,GAAG,KAAK,gDAC7B;CAEF,MAAM,OAAqB,CAAC;CAC5B,IAAI,QAAQ;CACZ,OAAO,QAAQ,MAAM,YAAY;EAC/B,MAAM,UAAU,MAAM,QAAQ,IAAM,KAAK;EACzC,IAAI,YAAY,OACd,MAAM,QAAQ,eACZ,GAAG,QAAQ,QAAQ,GAAG,KAAK,2BAA2B,KAAK,SAAS,GACtE;EAEF,KAAK,KAAK;GAAE,MAAM,MAAM,SAAS,QAAQ,OAAO,OAAO;GAAG;GAAO,KAAK,UAAU;EAAE,CAAC;EACnF,QAAQ,UAAU;CACpB;CACA,OAAO;AACT;;AAGA,SAAS,YAAY,IAAY,MAAc,KAA6B;CAC1E,OAAO,QAAQ,QAAQ,UAAU,IAAI,OAAO,IAAI,YAAY,IAAI,CAAC,CAAC,OAAO,GAAG;AAC9E;;AAGA,SAAS,eAAe,MAAc,SAA2C;CAC/E,IAAI;EACF,OAAO,SAAS,MAAM,UAAU,QAAQ;CAC1C,SAAS,OAAO;EACd,IAAK,MAAgC,SAAS,UAAU,OAAO;EAC/D,MAAM,QAAQ,eAAe,GAAG,QAAQ,QAAQ,GAAG,KAAK,mCAAmC,EACzF,OAAO,MACT,CAAC;CACH;AACF;AAEA,SAAS,UAAU,IAAY,OAAe,KAAqB;CACjE,MAAM,QAAQ,OAAO,YAAY,MAAM,KAAK;CAC5C,IAAI,SAAS;CACb,OAAO,SAAS,MAAM,YAAY;EAChC,MAAM,OAAO,SAAS,IAAI,OAAO,QAAQ,MAAM,aAAa,QAAQ,QAAQ,MAAM;EAClF,IAAI,SAAS,GAAG,OAAO,MAAM,SAAS,GAAG,MAAM;EAC/C,UAAU;CACZ;CACA,OAAO;AACT"}

package/dist/judge-gate-B1qYnkpi.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"judge-gate-B1qYnkpi.js","names":["parseIso"],"sources":["../src/series-convergence.ts","../src/meta-eval/sentinel.ts","../src/meta-eval/judge-gate.ts"],"sourcesContent":["/**\n * Series convergence — detects whether a sequence of scalar measurements\n * is stabilizing, drifting, or noisy. It reads drift *across* runs, e.g.\n * \"are my nightly eval scores stabilizing?\".\n *\n * Three signals:\n *   - stabilized: last K values have low variance (< epsilon) — done\n *   - drifting:   recent trend is monotonic and beyond noise — regressing or improving\n *   - noisy:      neither — keep iterating, but flag as untrustworthy for gating\n */\n\nexport interface SeriesConvergenceOptions {\n  /** Window size for \"recent\" analysis (default 5). */\n  window?: number\n  /** Coefficient-of-variation threshold below which the window is stabilized (default 0.05 = 5%). */\n  stableCv?: number\n  /** Minimum monotone run length to call drift (default 3). */\n  driftRun?: number\n}\n\nexport interface SeriesConvergenceResult {\n  state: 'stabilized' | 'drifting-up' | 'drifting-down' | 'noisy' | 'insufficient-data'\n  windowMean: number\n  windowCv: number\n  /** Longest monotonic run at the tail of the series (positive for up, negative for down). */\n  tailRun: number\n  /** True when n ≥ window AND windowCv ≤ stableCv. */\n  stable: boolean\n}\n\nexport function analyzeSeries(\n  values: number[],\n  options: SeriesConvergenceOptions = {},\n): SeriesConvergenceResult {\n  const window = options.window ?? 5\n  const stableCv = options.stableCv ?? 0.05\n  const driftRun = options.driftRun ?? 3\n\n  if (values.length < Math.max(2, Math.min(window, 3))) {\n    return { state: 'insufficient-data', windowMean: 0, windowCv: 0, tailRun: 0, stable: false }\n  }\n\n  const tail = values.slice(-window)\n  const mean = tail.reduce((a, b) => a + b, 0) / tail.length\n  const variance = tail.reduce((acc, v) => acc + (v - mean) ** 2, 0) / tail.length\n  const stdDev = Math.sqrt(variance)\n  const refMean = Math.abs(mean) > 1e-9 ? Math.abs(mean) : 1\n  const cv = stdDev / refMean\n  const stable = tail.length >= window && cv <= stableCv\n\n  // Tail monotonic run: count how many consecutive strictly-increasing (or decreasing)\n  // steps end at the final value.\n  let tailRun = 0\n  let direction: 1 | -1 | 0 = 0\n  for (let i = values.length - 1; i > 0; i--) {\n    const delta = values[i]! - values[i - 1]!\n    if (delta === 0) break\n    const dir = delta > 0 ? 1 : -1\n    if (direction === 0) direction = dir\n    if (dir !== direction) break\n    tailRun += dir\n  }\n\n  let state: SeriesConvergenceResult['state']\n  if (stable) {\n    state = 'stabilized'\n  } else if (Math.abs(tailRun) >= driftRun) {\n    state = tailRun > 0 ? 'drifting-up' : 'drifting-down'\n  } else {\n    state = 'noisy'\n  }\n\n  return { state, windowMean: mean, windowCv: cv, tailRun, stable }\n}\n","/**\n * Judge sentinel — eval trustworthiness as a continuously measured,\n * alarmed trend.\n *\n * Judges are models; models change underneath us; calibration decays.\n * This module composes three existing instruments into one loop:\n *\n *   snapshot — adapters turn real instrument outputs (`calibrateJudge` /\n *              `calibrateJudgeContinuous`, `corpusInterRaterAgreement` /\n *              `continuousAgreement`, a rerun sentinel golden set) into\n *              `SentinelSnapshot`s\n *   series   — `analyzeSeries` (src/series-convergence) classifies each\n *              judge×metric history as stabilized / drifting / noisy\n *   alarm    — `judgeSentinelReport` turns trends + thresholds into named\n *              alarms; `evalHealthStamp` is the tiny object a campaign\n *              attaches to its verdicts\n *\n * Alarm conditions:\n *   - convergence state `drifting-down` on any tracked metric\n *   - irr below `minIrr`\n *   - calibrationKappa / sentinelPassRate dropped vs the series baseline\n *     beyond `maxKappaDrop` / `maxSentinelDrop`\n *   - judge model changed with no post-change golden-grounded snapshot\n *     (the silent-upgrade trap: judges agreeing with each other after a\n *     model swap proves nothing — only re-measuring against gold does)\n *   - newest snapshot older than `staleAfterDays` relative to `asOf`\n *\n * Wire-in: run the snapshot adapters from a post-campaign hook or a\n * nightly job, append to a `SentinelStore`, then compute\n * `judgeSentinelReport(await store.history(), { asOf })` with `asOf` =\n * the campaign timestamp. Attach `evalHealthStamp(report)` to campaign\n * verdicts: an alarmed sentinel means every downstream verdict carries\n * an integrity warning until the judge is recalibrated.\n *\n * The module is clock-free — every timestamp (`at`, `asOf`) is\n * caller-supplied ISO-8601, so reports are reproducible.\n */\n\nimport { ValidationError } from '../errors'\nimport type {\n  CalibrationResult,\n  CandidateScore,\n  ContinuousAgreement,\n  ContinuousCalibrationResult,\n  GoldenItem,\n} from '../judge-calibration'\nimport {\n  analyzeSeries,\n  type SeriesConvergenceOptions,\n  type SeriesConvergenceResult,\n} from '../series-convergence'\nimport type { CorpusAgreementReport } from '../statistics'\n\nconst SENTINEL_METRIC_NAMES = ['irr', 'calibrationKappa', 'sentinelPassRate'] as const\n\nexport type SentinelMetricName = (typeof SENTINEL_METRIC_NAMES)[number]\n\nexport interface SentinelMetrics {\n  /** Inter-rater reliability — ICC(2,1) from agreement instruments. */\n  irr?: number\n  /** Weighted κ vs the human golden set (`calibrateJudge*`). */\n  calibrationKappa?: number\n  /** Fraction of a fixed sentinel golden set the judge still scores within tolerance. */\n  sentinelPassRate?: number\n}\n\nexport interface SentinelSnapshot {\n  /** Caller-supplied ISO-8601 timestamp — the module never reads a clock. */\n  at: string\n  judgeId: string\n  /** Exact model identity behind the judge (pin the full version string). */\n  judgeModel: string\n  /**\n   * Metrics measured at `at`. May be empty: an empty-metrics snapshot is a\n   * model-change marker — it records the new `judgeModel` immediately and\n   * the silent-upgrade alarm stays raised until a golden-grounded snapshot\n   * (calibrationKappa or sentinelPassRate) follows.\n   */\n  metrics: SentinelMetrics\n}\n\n/** Identity + timestamp the caller supplies alongside an instrument output. */\nexport interface SnapshotMeta {\n  at: string\n  judgeId: string\n  judgeModel: string\n}\n\nfunction parseIso(value: string, label: string): number {\n  const ms = typeof value === 'string' ? Date.parse(value) : NaN\n  if (!Number.isFinite(ms)) {\n    throw new ValidationError(\n      `judge-sentinel: ${label} is not a parseable ISO timestamp: ${JSON.stringify(value)}`,\n    )\n  }\n  return ms\n}\n\n/** Shape guard for snapshots crossing a boundary (store append, JSONL load, report input). */\nexport function validateSentinelSnapshot(snapshot: SentinelSnapshot, source = 'snapshot'): void {\n  parseIso(snapshot.at, `${source}.at`)\n  if (typeof snapshot.judgeId !== 'string' || snapshot.judgeId.length === 0) {\n    throw new ValidationError(`judge-sentinel: ${source}.judgeId must be a non-empty string`)\n  }\n  if (typeof snapshot.judgeModel !== 'string' || snapshot.judgeModel.length === 0) {\n    throw new ValidationError(`judge-sentinel: ${source}.judgeModel must be a non-empty string`)\n  }\n  if (snapshot.metrics === null || typeof snapshot.metrics !== 'object') {\n    throw new ValidationError(`judge-sentinel: ${source}.metrics must be an object (may be empty)`)\n  }\n  for (const [key, value] of Object.entries(snapshot.metrics)) {\n    if (!(SENTINEL_METRIC_NAMES as readonly string[]).includes(key)) {\n      // A typo'd key would silently never trend — reject instead.\n      throw new ValidationError(\n        `judge-sentinel: ${source}.metrics carries unknown key \"${key}\" — known: ${SENTINEL_METRIC_NAMES.join(', ')}`,\n      )\n    }\n    if (value !== undefined && !Number.isFinite(value)) {\n      throw new ValidationError(\n        `judge-sentinel: ${source}.metrics.${key} is not a finite number: ${String(value)}`,\n      )\n    }\n  }\n}\n\n// ── Snapshot adapters — real instrument output → SentinelSnapshot ───\n\n/**\n * From `calibrateJudge` / `calibrateJudgeContinuous` output. Prefers the\n * un-rounded continuous κ_w when the report carries one (integer κ\n * discards information for [0,1] judges).\n */\nexport function snapshotFromCalibration(\n  report: CalibrationResult | ContinuousCalibrationResult,\n  meta: SnapshotMeta,\n): SentinelSnapshot {\n  const kappa = 'weightedKappaContinuous' in report ? report.weightedKappaContinuous : report.kappa\n  if (!Number.isFinite(kappa)) {\n    throw new ValidationError(\n      `snapshotFromCalibration: κ is not finite (n=${report.n}) — calibrate against ≥2 joined golden items before snapshotting`,\n    )\n  }\n  const snapshot: SentinelSnapshot = { ...meta, metrics: { calibrationKappa: kappa } }\n  validateSentinelSnapshot(snapshot)\n  return snapshot\n}\n\n/**\n * From `corpusInterRaterAgreement` (statistics.ts) or `continuousAgreement`\n * (judge-calibration.ts) output. IRR = ICC(2,1) — the reliability\n * coefficient both instruments compute. For ensemble-level agreement,\n * `meta.judgeId` names the ensemble and `meta.judgeModel` pins its\n * composition (e.g. a joined list of member model strings).\n */\nexport function snapshotFromAgreement(\n  report: CorpusAgreementReport | ContinuousAgreement,\n  meta: SnapshotMeta,\n): SentinelSnapshot {\n  const irr = 'overallIcc' in report ? report.overallIcc : report.icc\n  if (!Number.isFinite(irr)) {\n    throw new ValidationError(\n      'snapshotFromAgreement: ICC is not finite — agreement needs ≥2 raters and ≥2 complete items',\n    )\n  }\n  const snapshot: SentinelSnapshot = { ...meta, metrics: { irr } }\n  validateSentinelSnapshot(snapshot)\n  return snapshot\n}\n\nexport interface SentinelSetOptions {\n  /** Max |judge − human| for an item to count as passed. Default 0.1 (tuned for [0,1] scores). */\n  tolerance?: number\n}\n\n/**\n * From a rerun of a fixed sentinel golden set: the same `GoldenItem`s the\n * judge was originally calibrated on, re-scored periodically. Pass rate =\n * fraction of joined items where the judge stays within `tolerance` of the\n * human score. Items the judge didn't score are excluded from the\n * denominator; zero joined items is an error, not a 0% pass rate.\n */\nexport function snapshotFromSentinelSet(\n  scores: CandidateScore[],\n  golden: GoldenItem[],\n  meta: SnapshotMeta,\n  options: SentinelSetOptions = {},\n): SentinelSnapshot {\n  const tolerance = options.tolerance ?? 0.1\n  if (!Number.isFinite(tolerance) || tolerance < 0) {\n    throw new ValidationError(\n      `snapshotFromSentinelSet: tolerance must be a finite number ≥ 0, got ${tolerance}`,\n    )\n  }\n  const goldenById = new Map<string, number>()\n  for (const item of golden) {\n    if (!Number.isFinite(item.humanScore)) {\n      throw new ValidationError(\n        `snapshotFromSentinelSet: golden item \"${item.itemId}\" has a non-finite humanScore`,\n      )\n    }\n    if (goldenById.has(item.itemId)) {\n      throw new ValidationError(`snapshotFromSentinelSet: duplicate golden itemId \"${item.itemId}\"`)\n    }\n    goldenById.set(item.itemId, item.humanScore)\n  }\n  let joined = 0\n  let passed = 0\n  for (const s of scores) {\n    const human = goldenById.get(s.itemId)\n    if (human === undefined) continue\n    if (!Number.isFinite(s.score)) {\n      throw new ValidationError(\n        `snapshotFromSentinelSet: judge score for item \"${s.itemId}\" is not finite`,\n      )\n    }\n    joined++\n    if (Math.abs(s.score - human) <= tolerance) passed++\n  }\n  if (joined === 0) {\n    throw new ValidationError(\n      'snapshotFromSentinelSet: no judge scores joined the golden set — itemIds mismatch or empty sentinel run',\n    )\n  }\n  const snapshot: SentinelSnapshot = { ...meta, metrics: { sentinelPassRate: passed / joined } }\n  validateSentinelSnapshot(snapshot)\n  return snapshot\n}\n\n// ── Persistence ──────────────────────────────────────────────────────\n\nexport interface SentinelStore {\n  append(snapshot: SentinelSnapshot): Promise<void>\n  /** All snapshots (optionally for one judge), in append order. */\n  history(judgeId?: string): Promise<SentinelSnapshot[]>\n}\n\nexport function inMemorySentinelStore(initial: SentinelSnapshot[] = []): SentinelStore {\n  for (const s of initial) validateSentinelSnapshot(s)\n  const items = initial.map((s) => ({ ...s, metrics: { ...s.metrics } }))\n  return {\n    async append(snapshot) {\n      validateSentinelSnapshot(snapshot)\n      items.push({ ...snapshot, metrics: { ...snapshot.metrics } })\n    },\n    async history(judgeId) {\n      const all = items.map((s) => ({ ...s, metrics: { ...s.metrics } }))\n      return judgeId === undefined ? all : all.filter((s) => s.judgeId === judgeId)\n    },\n  }\n}\n\n/**\n * JSONL store — one snapshot per line, appended atomically per call.\n * A corrupt or shape-invalid line is a loud error naming the file and\n * line number: a sentinel history that silently drops records would\n * defeat the drift detection it exists to provide.\n */\nexport function fileSentinelStore(path: string): SentinelStore {\n  return {\n    async append(snapshot) {\n      validateSentinelSnapshot(snapshot)\n      const fs = await import('node:fs/promises')\n      const pathMod = await import('node:path')\n      await fs.mkdir(pathMod.dirname(path), { recursive: true })\n      await fs.appendFile(path, `${JSON.stringify(snapshot)}\\n`, 'utf8')\n    },\n    async history(judgeId) {\n      const fs = await import('node:fs/promises')\n      let raw: string\n      try {\n        raw = await fs.readFile(path, 'utf8')\n      } catch (err) {\n        if ((err as NodeJS.ErrnoException).code === 'ENOENT') return []\n        throw err\n      }\n      const lines = raw.split('\\n')\n      const snapshots: SentinelSnapshot[] = []\n      for (let i = 0; i < lines.length; i++) {\n        const line = lines[i]!\n        if (line.trim().length === 0) continue\n        let parsed: unknown\n        try {\n          parsed = JSON.parse(line)\n        } catch (err) {\n          throw new ValidationError(\n            `judge-sentinel: store at ${path} has a corrupt JSONL line ${i + 1}: ${(err as Error).message}`,\n          )\n        }\n        const snapshot = parsed as SentinelSnapshot\n        validateSentinelSnapshot(snapshot, `${path}:${i + 1}`)\n        snapshots.push(snapshot)\n      }\n      return judgeId === undefined ? snapshots : snapshots.filter((s) => s.judgeId === judgeId)\n    },\n  }\n}\n\n// ── Trend report ─────────────────────────────────────────────────────\n\nexport interface SentinelThresholds {\n  /** Floor for irr — below it the judge ensemble is unreliable regardless of trend. Default 0.6. */\n  minIrr?: number\n  /** Max tolerated calibrationKappa drop vs the series baseline. Default 0.15. */\n  maxKappaDrop?: number\n  /** Max tolerated sentinelPassRate drop vs the series baseline. Default 0.1. */\n  maxSentinelDrop?: number\n  /** Newest snapshot older than this (days, vs asOf) = the sentinel itself went blind. Default 30. */\n  staleAfterDays?: number\n}\n\nexport interface JudgeSentinelOptions {\n  /** Caller-supplied ISO timestamp staleness is measured against. */\n  asOf: string\n  thresholds?: SentinelThresholds\n  /** Forwarded to `analyzeSeries` (window, stableCv, driftRun). */\n  convergence?: SeriesConvergenceOptions\n}\n\nexport interface SentinelTrend {\n  judgeId: string\n  metric: SentinelMetricName\n  /** Verbatim `analyzeSeries` state for this judge×metric history. */\n  state: SeriesConvergenceResult['state']\n  /** Newest value in the series. */\n  current: number\n  /** Oldest value in the series — the reference the drop thresholds compare against. */\n  baseline: number\n  /** current − baseline (signed; negative = decayed). */\n  drift: number\n  alarmed: boolean\n  reason?: string\n}\n\nexport interface SentinelReport {\n  perJudge: SentinelTrend[]\n  alarms: string[]\n  healthy: boolean\n  /**\n   * `judgeId:metric` pairs with too few snapshots for the convergence\n   * machine. Named, not counted — a blind spot you can't see is a blind\n   * spot you won't fix. Floor/drop checks still apply to thin series, so\n   * insufficient history alone never masks an alarm.\n   */\n  insufficientHistory: string[]\n}\n\nconst MS_PER_DAY = 86_400_000\n\nexport function judgeSentinelReport(\n  history: SentinelSnapshot[],\n  opts: JudgeSentinelOptions,\n): SentinelReport {\n  const asOfMs = parseIso(opts.asOf, 'asOf')\n  const minIrr = opts.thresholds?.minIrr ?? 0.6\n  const maxKappaDrop = opts.thresholds?.maxKappaDrop ?? 0.15\n  const maxSentinelDrop = opts.thresholds?.maxSentinelDrop ?? 0.1\n  const staleAfterDays = opts.thresholds?.staleAfterDays ?? 30\n\n  const byJudge = new Map<string, Array<SentinelSnapshot & { atMs: number }>>()\n  for (const snapshot of history) {\n    validateSentinelSnapshot(snapshot)\n    const atMs = parseIso(snapshot.at, `snapshot.at (judge \"${snapshot.judgeId}\")`)\n    const arr = byJudge.get(snapshot.judgeId) ?? []\n    arr.push({ ...snapshot, atMs })\n    byJudge.set(snapshot.judgeId, arr)\n  }\n\n  const perJudge: SentinelTrend[] = []\n  const alarms: string[] = []\n  const insufficientHistory: string[] = []\n\n  for (const judgeId of [...byJudge.keys()].sort()) {\n    const snaps = byJudge.get(judgeId)!.sort((a, b) => a.atMs - b.atMs)\n    const newest = snaps[snaps.length - 1]!\n\n    const ageDays = (asOfMs - newest.atMs) / MS_PER_DAY\n    if (ageDays > staleAfterDays) {\n      alarms.push(\n        `judge \"${judgeId}\": stale — newest snapshot ${newest.at} is ${ageDays.toFixed(1)}d old vs asOf (limit ${staleAfterDays}d)`,\n      )\n    }\n\n    // Silent-upgrade trap: only the latest model change matters for current\n    // trust, and only golden-grounded metrics clear it — irr alone proves\n    // judges still agree with each other, not that they're still right.\n    let changeIdx = -1\n    for (let i = 1; i < snaps.length; i++) {\n      if (snaps[i]!.judgeModel !== snaps[i - 1]!.judgeModel) changeIdx = i\n    }\n    if (changeIdx >= 0) {\n      const recalibrated = snaps\n        .slice(changeIdx)\n        .some(\n          (s) =>\n            Number.isFinite(s.metrics.calibrationKappa) ||\n            Number.isFinite(s.metrics.sentinelPassRate),\n        )\n      if (!recalibrated) {\n        alarms.push(\n          `judge \"${judgeId}\": model changed \"${snaps[changeIdx - 1]!.judgeModel}\" → \"${snaps[changeIdx]!.judgeModel}\" at ${snaps[changeIdx]!.at} with no post-change calibration snapshot — silent-upgrade trap; rerun calibrateJudge or the sentinel set against the new model`,\n        )\n      }\n    }\n\n    for (const metric of SENTINEL_METRIC_NAMES) {\n      const values = snaps\n        .filter((s) => typeof s.metrics[metric] === 'number')\n        .map((s) => s.metrics[metric]!)\n      if (values.length === 0) continue\n\n      const convergence = analyzeSeries(values, opts.convergence)\n      if (convergence.state === 'insufficient-data')\n        insufficientHistory.push(`${judgeId}:${metric}`)\n\n      const current = values[values.length - 1]!\n      const baseline = values[0]!\n      const drift = current - baseline\n      const reasons: string[] = []\n      if (convergence.state === 'drifting-down') {\n        reasons.push(\n          `convergence state drifting-down (tail run ${convergence.tailRun}, window mean ${convergence.windowMean.toFixed(3)})`,\n        )\n      }\n      if (metric === 'irr' && current < minIrr) {\n        reasons.push(`irr ${current.toFixed(3)} below floor ${minIrr}`)\n      }\n      if (metric === 'calibrationKappa' && baseline - current > maxKappaDrop) {\n        reasons.push(\n          `calibrationKappa dropped ${(baseline - current).toFixed(3)} from baseline ${baseline.toFixed(3)} (limit ${maxKappaDrop})`,\n        )\n      }\n      if (metric === 'sentinelPassRate' && baseline - current > maxSentinelDrop) {\n        reasons.push(\n          `sentinelPassRate dropped ${(baseline - current).toFixed(3)} from baseline ${baseline.toFixed(3)} (limit ${maxSentinelDrop})`,\n        )\n      }\n\n      const alarmed = reasons.length > 0\n      const trend: SentinelTrend = {\n        judgeId,\n        metric,\n        state: convergence.state,\n        current,\n        baseline,\n        drift,\n        alarmed,\n      }\n      if (alarmed) {\n        trend.reason = reasons.join('; ')\n        alarms.push(`judge \"${judgeId}\" ${metric}: ${trend.reason}`)\n      }\n      perJudge.push(trend)\n    }\n  }\n\n  return { perJudge, alarms, healthy: alarms.length === 0, insufficientHistory }\n}\n\n// ── Verdict stamp ────────────────────────────────────────────────────\n\nexport interface EvalHealthStamp {\n  healthy: boolean\n  alarms: string[]\n}\n\n/**\n * The object a campaign attaches to its verdicts. Compute it from the\n * sentinel report in a post-campaign hook (or a nightly job feeding the\n * next day's campaigns) and store it alongside the verdict payload.\n * `healthy: false` means the judges that produced those verdicts have an\n * unresolved drift / decay / silent-upgrade / staleness alarm — treat the\n * verdicts as carrying an integrity warning until recalibration clears it.\n */\nexport function evalHealthStamp(report: SentinelReport): EvalHealthStamp {\n  return { healthy: report.healthy, alarms: [...report.alarms] }\n}\n","/**\n * Judge calibration gate: a judge may gate only while its measured agreement\n * with its owner's verdicts holds.\n *\n * A judge (a model judge or a deterministic grader) registers a calibration\n * set: items its owner has decided, each verdict with its provenance. A\n * calibration run replays the judge on those items, once or several times, and\n * `measureJudgeAgreement` reports how often it reached the owner's verdict\n * (accuracy, and Cohen's κ for the pass/fail pair), how much its own verdict\n * moves between runs and between samples, and where it disagreed.\n *\n * `judgeGateDecision` turns that report into the one decision a consumer acts\n * on. A judge either decides (`decides: 'verdict'`, the default: it passes and\n * blocks, so it must reach the owner's verdict) or only vetoes\n * (`decides: 'veto'`: a necessary-condition check such as a copy or policy\n * check, which blocks but never passes work on its own; owners also reject\n * for reasons it does not cover, so its error is blocking what they approved).\n * It refuses when the judge has no measured agreement, too few decided\n * items of either verdict, a report measured on a different model or rubric\n * than the one the judge now runs, a report older than the policy allows,\n * agreement below the policy floors, or an alarmed drift history. A refused\n * judge's verdict is advisory: the consumer reports it but does not let it\n * pass or block anything.\n *\n * Drift is the judge sentinel (`./sentinel`): `snapshotFromJudgeAgreement`\n * records accuracy as `sentinelPassRate` and κ as `calibrationKappa`, so each\n * calibration run appends one snapshot to a `SentinelStore` and the gate reads\n * the alarms `judgeSentinelReport` raises over that history.\n *\n * Every timestamp is caller-supplied ISO-8601, so decisions are reproducible.\n */\n\nimport { JudgeError, ValidationError } from '../errors'\nimport { type ComputedInterval, computeInterval } from '../experiment/ast'\nimport {\n  judgeSentinelReport,\n  type SentinelSnapshot,\n  type SentinelThresholds,\n  validateSentinelSnapshot,\n} from './sentinel'\n\nexport type OwnerVerdict = 'pass' | 'fail'\n\n/** One item the owner decided, with where that decision is recorded. */\nexport interface CalibrationExample {\n  /** Stable id of the decided item; a judge run names it in `exampleId`. */\n  id: string\n  verdict: OwnerVerdict\n  /** The person whose verdict this is. Never a model. */\n  labeledBy: string\n  /** ISO-8601 time the verdict was given. */\n  labeledAt: string\n  /** Where the verdict is recorded, e.g. `gtm:asset_decision:<id>`. */\n  source: string\n  /** What the owner judged (an image digest, a run id), so a replay judges the same thing. */\n  evidenceRef?: string\n  note?: string\n}\n\nexport interface JudgeCalibrationSet {\n  judgeId: string\n  /** Whose verdicts the judge stands in for. */\n  owner: string\n  examples: readonly CalibrationExample[]\n}\n\nfunction parseIso(value: unknown, label: string): number {\n  const ms = typeof value === 'string' ? Date.parse(value) : Number.NaN\n  if (!Number.isFinite(ms)) {\n    throw new ValidationError(\n      `judge-gate: ${label} is not a parseable ISO timestamp: ${JSON.stringify(value)}`,\n    )\n  }\n  return ms\n}\n\nfunction requireText(value: unknown, label: string): string {\n  if (typeof value !== 'string' || value.trim().length === 0) {\n    throw new ValidationError(`judge-gate: ${label} must be a non-empty string`)\n  }\n  return value\n}\n\nfunction requireVerdict(value: unknown, label: string): OwnerVerdict {\n  if (value !== 'pass' && value !== 'fail') {\n    throw new ValidationError(\n      `judge-gate: ${label} must be 'pass' or 'fail', got ${JSON.stringify(value)}`,\n    )\n  }\n  return value\n}\n\nfunction checkExample(example: CalibrationExample, label: string): CalibrationExample {\n  if (example === null || typeof example !== 'object') {\n    throw new ValidationError(`judge-gate: ${label} must be an object`)\n  }\n  requireText(example.id, `${label}.id`)\n  requireVerdict(example.verdict, `${label}.verdict`)\n  requireText(example.labeledBy, `${label}.labeledBy`)\n  parseIso(example.labeledAt, `${label}.labeledAt`)\n  requireText(example.source, `${label}.source`)\n  if (example.evidenceRef !== undefined) requireText(example.evidenceRef, `${label}.evidenceRef`)\n  const copy: CalibrationExample = {\n    id: example.id,\n    verdict: example.verdict,\n    labeledBy: example.labeledBy,\n    labeledAt: example.labeledAt,\n    source: example.source,\n  }\n  if (example.evidenceRef !== undefined) copy.evidenceRef = example.evidenceRef\n  if (example.note !== undefined) copy.note = example.note\n  return copy\n}\n\n/**\n * Validate a calibration set and return a normalized copy ordered by example\n * id. Every verdict needs its person, time and source; ids are unique.\n */\nexport function registerCalibrationSet(set: JudgeCalibrationSet): JudgeCalibrationSet {\n  if (set === null || typeof set !== 'object') {\n    throw new ValidationError('judge-gate: calibration set must be an object')\n  }\n  const judgeId = requireText(set.judgeId, 'calibration set judgeId')\n  const owner = requireText(set.owner, `calibration set \"${judgeId}\" owner`)\n  if (!Array.isArray(set.examples)) {\n    throw new ValidationError(`judge-gate: calibration set \"${judgeId}\" examples must be an array`)\n  }\n  const seen = new Set<string>()\n  const examples = set.examples.map((example, index) => {\n    const checked = checkExample(example, `calibration set \"${judgeId}\" example ${index}`)\n    if (seen.has(checked.id)) {\n      throw new ValidationError(\n        `judge-gate: calibration set \"${judgeId}\" has duplicate example id \"${checked.id}\"`,\n      )\n    }\n    seen.add(checked.id)\n    return checked\n  })\n  examples.sort((a, b) => (a.id < b.id ? -1 : a.id > b.id ? 1 : 0))\n  return { judgeId, owner, examples }\n}\n\nexport interface CalibrationMerge {\n  set: JudgeCalibrationSet\n  /** Ids that joined the set. */\n  added: string[]\n  /** Ids whose verdict a later decision replaced. */\n  superseded: string[]\n  /** Ids whose incoming verdict was already recorded, or older than the recorded one. */\n  unchanged: string[]\n}\n\n/**\n * Join new owner verdicts to a set. A verdict already recorded from the same\n * source is unchanged, so ingestion can rerun. A later verdict on an item\n * replaces an earlier one: the owner changed their mind, and the set keeps\n * what they decided last.\n */\nexport function addCalibrationVerdicts(\n  set: JudgeCalibrationSet,\n  verdicts: readonly CalibrationExample[],\n): CalibrationMerge {\n  const base = registerCalibrationSet(set)\n  const byId = new Map(base.examples.map((example) => [example.id, example]))\n  const added: string[] = []\n  const superseded: string[] = []\n  const unchanged: string[] = []\n  for (const [index, verdict] of verdicts.entries()) {\n    const incoming = checkExample(verdict, `incoming verdict ${index} for \"${base.judgeId}\"`)\n    const current = byId.get(incoming.id)\n    if (!current) {\n      byId.set(incoming.id, incoming)\n      added.push(incoming.id)\n      continue\n    }\n    const sameDecision = current.source === incoming.source && current.verdict === incoming.verdict\n    if (\n      sameDecision ||\n      parseIso(incoming.labeledAt, 'labeledAt') <= parseIso(current.labeledAt, 'labeledAt')\n    ) {\n      unchanged.push(incoming.id)\n      continue\n    }\n    byId.set(incoming.id, incoming)\n    superseded.push(incoming.id)\n  }\n  return {\n    set: registerCalibrationSet({ ...base, examples: [...byId.values()] }),\n    added,\n    superseded,\n    unchanged,\n  }\n}\n\n/** One gate decision the judge made on a calibration example. */\nexport interface JudgeRun {\n  exampleId: string\n  /** The judge's decision after its own sample aggregation (median, majority). */\n  verdict: OwnerVerdict\n  /** The per-sample verdicts behind that decision, when the judge samples. */\n  samples?: readonly OwnerVerdict[]\n}\n\nexport interface JudgeRunMeta {\n  judgeId: string\n  /** Exact model identity, or `deterministic` for a grader without one. */\n  judgeModel: string\n  rubricVersion: string\n  measuredAt: string\n}\n\nexport interface JudgeConfusion {\n  /** Judge pass, owner pass. */\n  truePass: number\n  /** Judge fail, owner fail. */\n  trueFail: number\n  /** Judge pass, owner fail: the judge let through what the owner rejected. */\n  falsePass: number\n  /** Judge fail, owner pass: the judge blocked what the owner accepted. */\n  falseFail: number\n}\n\nexport interface JudgeExampleAgreement {\n  id: string\n  verdict: OwnerVerdict\n  runs: number\n  /** Share of runs that passed. */\n  passRate: number\n  /** Share of runs that reached the owner's verdict. */\n  agreement: number\n}\n\nexport interface JudgeAgreement extends JudgeRunMeta {\n  owner: string\n  /** Examples in the calibration set. */\n  examples: number\n  /** Examples the judge ran on at least once. */\n  judged: number\n  /** Judged examples per owner verdict. */\n  judgedByVerdict: Record<OwnerVerdict, number>\n  runs: number\n  /** Runs that reached the owner's verdict, over all runs; null with no runs. */\n  accuracy: number | null\n  /**\n   * Exact (Clopper-Pearson) 95% interval for the share of judged examples on\n   * which every run reached the owner's verdict. Examples, not runs, are the\n   * independent units.\n   */\n  exampleAccuracy: { agreed: number; judged: number; interval: ComputedInterval } | null\n  /**\n   * Cohen's κ between the judge and the owner over runs. Null when undefined:\n   * no runs, or both sides used a single verdict.\n   */\n  kappa: number | null\n  /** Runs that failed what the owner passed, over runs on owner passes; null with none. A veto judge is held to this. */\n  falseFailRate: number | null\n  /** Runs that failed what the owner failed, over runs on owner fails; null with none. */\n  catchRate: number | null\n  confusion: JudgeConfusion\n  variance: {\n    /** Mean over judged examples of p(1 − p), p the example's run pass rate. 0 = no run changed its mind. */\n    betweenRuns: number | null\n    /** Mean over runs that reported samples of p(1 − p) across those samples; null when none did. */\n    withinRun: number | null\n    /** Examples whose runs disagree with each other. */\n    unstable: string[]\n  }\n  /** Examples with at least one run against the owner, least agreement first. */\n  disagreements: JudgeExampleAgreement[]\n  /** Examples without any run. */\n  unjudged: string[]\n}\n\nfunction bernoulliVariance(passes: number, n: number): number {\n  const p = passes / n\n  return p * (1 - p)\n}\n\n/** Cohen's κ for two raters over a binary pass/fail table. */\nfunction binaryKappa(confusion: JudgeConfusion): number | null {\n  const n = confusion.truePass + confusion.trueFail + confusion.falsePass + confusion.falseFail\n  if (n === 0) return null\n  const observed = (confusion.truePass + confusion.trueFail) / n\n  const judgePass = (confusion.truePass + confusion.falsePass) / n\n  const ownerPass = (confusion.truePass + confusion.falseFail) / n\n  const expected = judgePass * ownerPass + (1 - judgePass) * (1 - ownerPass)\n  if (expected === 1) return null\n  return (observed - expected) / (1 - expected)\n}\n\n/**\n * Agreement between a judge's runs and the owner's verdicts on one\n * calibration set. A run that names an example outside the set is an error:\n * a silently dropped run would overstate agreement.\n */\nexport function measureJudgeAgreement(\n  set: JudgeCalibrationSet,\n  runs: readonly JudgeRun[],\n  meta: JudgeRunMeta,\n): JudgeAgreement {\n  const registered = registerCalibrationSet(set)\n  if (meta.judgeId !== registered.judgeId) {\n    throw new ValidationError(\n      `judge-gate: runs are for judge \"${meta.judgeId}\" but the set belongs to \"${registered.judgeId}\"`,\n    )\n  }\n  requireText(meta.judgeModel, 'judgeModel')\n  requireText(meta.rubricVersion, 'rubricVersion')\n  parseIso(meta.measuredAt, 'measuredAt')\n  const byId = new Map(registered.examples.map((example) => [example.id, example]))\n  const runsById = new Map<string, JudgeRun[]>()\n  const confusion: JudgeConfusion = { truePass: 0, trueFail: 0, falsePass: 0, falseFail: 0 }\n  const withinRun: number[] = []\n  for (const [index, run] of runs.entries()) {\n    const example = byId.get(run?.exampleId)\n    if (!example) {\n      throw new ValidationError(\n        `judge-gate: run ${index} names example ${JSON.stringify(run?.exampleId)}, which is not in \"${registered.judgeId}\"'s calibration set`,\n      )\n    }\n    const verdict = requireVerdict(run.verdict, `run ${index} verdict`)\n    if (run.samples !== undefined) {\n      if (!Array.isArray(run.samples) || run.samples.length === 0) {\n        throw new ValidationError(`judge-gate: run ${index} samples must be a non-empty array`)\n      }\n      const samples = run.samples.map((sample, s) =>\n        requireVerdict(sample, `run ${index} sample ${s}`),\n      )\n      withinRun.push(\n        bernoulliVariance(samples.filter((sample) => sample === 'pass').length, samples.length),\n      )\n    }\n    const list = runsById.get(example.id) ?? []\n    list.push({ ...run, verdict })\n    runsById.set(example.id, list)\n    if (verdict === 'pass') {\n      if (example.verdict === 'pass') confusion.truePass++\n      else confusion.falsePass++\n    } else if (example.verdict === 'fail') confusion.trueFail++\n    else confusion.falseFail++\n  }\n\n  const perExample: JudgeExampleAgreement[] = []\n  const unjudged: string[] = []\n  const judgedByVerdict: Record<OwnerVerdict, number> = { pass: 0, fail: 0 }\n  for (const example of registered.examples) {\n    const list = runsById.get(example.id)\n    if (!list) {\n      unjudged.push(example.id)\n      continue\n    }\n    judgedByVerdict[example.verdict]++\n    const passes = list.filter((run) => run.verdict === 'pass').length\n    perExample.push({\n      id: example.id,\n      verdict: example.verdict,\n      runs: list.length,\n      passRate: passes / list.length,\n      agreement: list.filter((run) => run.verdict === example.verdict).length / list.length,\n    })\n  }\n\n  const total = runs.length\n  const agreedRuns = confusion.truePass + confusion.trueFail\n  const agreedExamples = perExample.filter((example) => example.agreement === 1).length\n  const mean = (values: readonly number[]) =>\n    values.length === 0 ? null : values.reduce((sum, value) => sum + value, 0) / values.length\n  return {\n    ...meta,\n    owner: registered.owner,\n    examples: registered.examples.length,\n    judged: perExample.length,\n    judgedByVerdict,\n    runs: total,\n    accuracy: total === 0 ? null : agreedRuns / total,\n    exampleAccuracy:\n      perExample.length === 0\n        ? null\n        : {\n            agreed: agreedExamples,\n            judged: perExample.length,\n            interval: computeInterval(\n              { kind: 'clopper-pearson', level: 0.95 },\n              { kind: 'binomial', successes: agreedExamples, trials: perExample.length },\n            ),\n          },\n    kappa: binaryKappa(confusion),\n    falseFailRate:\n      confusion.truePass + confusion.falseFail === 0\n        ? null\n        : confusion.falseFail / (confusion.truePass + confusion.falseFail),\n    catchRate:\n      confusion.trueFail + confusion.falsePass === 0\n        ? null\n        : confusion.trueFail / (confusion.trueFail + confusion.falsePass),\n    confusion,\n    variance: {\n      betweenRuns: mean(perExample.map((example) => example.passRate * (1 - example.passRate))),\n      withinRun: mean(withinRun),\n      unstable: perExample\n        .filter((example) => example.passRate > 0 && example.passRate < 1)\n        .map((example) => example.id),\n    },\n    disagreements: perExample\n      .filter((example) => example.agreement < 1)\n      .sort((a, b) => a.agreement - b.agreement || (a.id < b.id ? -1 : 1)),\n    unjudged,\n  }\n}\n\nexport interface JudgeGatePolicy {\n  /**\n   * `verdict`: the judge passes and blocks, so accuracy and κ must hold.\n   * `veto`: it only blocks, so its false-fail rate on owner passes must hold.\n   */\n  decides: 'verdict' | 'veto'\n  /** Judged examples required before the judge may gate; for a veto judge, owner passes. */\n  minExamples: number\n  /** Judged examples required of each owner verdict, so κ is defined. */\n  minPerVerdict: number\n  /** Floor on run accuracy. */\n  minAccuracy: number\n  /** Floor on Cohen's κ. */\n  minKappa: number\n  /** Ceiling on a veto judge's false-fail rate. */\n  maxFalseFailRate: number\n  /** A report older than this (days, vs `asOf`) no longer calibrates the judge. */\n  maxAgeDays: number\n  /** Drift thresholds forwarded to `judgeSentinelReport` over the history. */\n  drift?: SentinelThresholds\n}\n\nexport const DEFAULT_JUDGE_GATE_POLICY: Readonly<JudgeGatePolicy> = Object.freeze({\n  decides: 'verdict',\n  minExamples: 10,\n  minPerVerdict: 1,\n  minAccuracy: 0.9,\n  minKappa: 0.6,\n  maxFalseFailRate: 0.1,\n  maxAgeDays: 30,\n})\n\nexport type JudgeGateStatus = 'calibrated' | 'uncalibrated' | 'below-threshold' | 'drifted'\n\nexport interface JudgeGateDecision {\n  judgeId: string\n  judgeModel: string\n  rubricVersion: string\n  /** True only for `calibrated`. */\n  mayGate: boolean\n  status: JudgeGateStatus\n  /** Why the judge may not gate; empty when it may. */\n  reasons: string[]\n  agreement: JudgeAgreement | null\n  policy: JudgeGatePolicy\n}\n\nexport interface JudgeGateInput {\n  judgeId: string\n  /** The model the judge runs now. */\n  judgeModel: string\n  /** The rubric the judge runs now. */\n  rubricVersion: string\n  /** The latest calibration report; null when the judge was never measured. */\n  agreement: JudgeAgreement | null\n  asOf: string\n  /** Sentinel snapshots for this judge, oldest first or in any order. */\n  history?: readonly SentinelSnapshot[]\n  policy?: Partial<JudgeGatePolicy>\n}\n\nconst DAY_MS = 86_400_000\n\nfunction percent(value: number): string {\n  return `${(value * 100).toFixed(1)}%`\n}\n\n/** Whether a judge may gate now, and every reason it may not. */\nexport function judgeGateDecision(input: JudgeGateInput): JudgeGateDecision {\n  const judgeId = requireText(input.judgeId, 'judgeId')\n  const judgeModel = requireText(input.judgeModel, 'judgeModel')\n  const rubricVersion = requireText(input.rubricVersion, 'rubricVersion')\n  const asOf = parseIso(input.asOf, 'asOf')\n  const policy: JudgeGatePolicy = {\n    ...DEFAULT_JUDGE_GATE_POLICY,\n    ...Object.fromEntries(\n      Object.entries(input.policy ?? {}).filter(([, value]) => value !== undefined),\n    ),\n  }\n  if (policy.decides !== 'verdict' && policy.decides !== 'veto') {\n    throw new ValidationError(\n      `judge-gate: policy.decides must be 'verdict' or 'veto', got ${JSON.stringify(policy.decides)}`,\n    )\n  }\n  const agreement = input.agreement\n  const decide = (status: JudgeGateStatus, reasons: string[]): JudgeGateDecision => ({\n    judgeId,\n    judgeModel,\n    rubricVersion,\n    mayGate: status === 'calibrated',\n    status,\n    reasons,\n    agreement,\n    policy,\n  })\n\n  if (!agreement) return decide('uncalibrated', ['no measured agreement with owner verdicts'])\n  if (agreement.judgeId !== judgeId) {\n    throw new ValidationError(\n      `judge-gate: agreement belongs to \"${agreement.judgeId}\", not \"${judgeId}\"`,\n    )\n  }\n\n  const uncalibrated: string[] = []\n  if (agreement.judgeModel !== judgeModel) {\n    uncalibrated.push(\n      `agreement was measured on model ${agreement.judgeModel}; the judge now runs ${judgeModel}`,\n    )\n  }\n  if (agreement.rubricVersion !== rubricVersion) {\n    uncalibrated.push(\n      `agreement was measured on rubric ${agreement.rubricVersion}; the judge now runs ${rubricVersion}`,\n    )\n  }\n  const ageDays = (asOf - parseIso(agreement.measuredAt, 'agreement.measuredAt')) / DAY_MS\n  if (ageDays > policy.maxAgeDays) {\n    uncalibrated.push(`agreement is ${ageDays.toFixed(1)} days old (limit ${policy.maxAgeDays})`)\n  }\n  if (policy.decides === 'veto') {\n    // Only owner passes can show a veto judge blocking what it should not.\n    if (agreement.judgedByVerdict.pass < policy.minExamples) {\n      uncalibrated.push(\n        `${agreement.judgedByVerdict.pass} judged examples the owner marked pass; a veto judge needs at least ${policy.minExamples}`,\n      )\n    }\n  } else {\n    if (agreement.judged < policy.minExamples) {\n      uncalibrated.push(\n        `${agreement.judged} judged ${agreement.judged === 1 ? 'example' : 'examples'}; at least ${policy.minExamples} required`,\n      )\n    }\n    for (const verdict of ['pass', 'fail'] as const) {\n      if (agreement.judgedByVerdict[verdict] < policy.minPerVerdict) {\n        uncalibrated.push(\n          `${agreement.judgedByVerdict[verdict]} judged examples the owner marked ${verdict}; at least ${policy.minPerVerdict} required`,\n        )\n      }\n    }\n  }\n  if (uncalibrated.length > 0) return decide('uncalibrated', uncalibrated)\n\n  const below: string[] = []\n  if (policy.decides === 'veto') {\n    if (agreement.falseFailRate === null || agreement.falseFailRate > policy.maxFalseFailRate) {\n      below.push(\n        `it fails ${agreement.falseFailRate === null ? 'an unmeasured share' : percent(agreement.falseFailRate)} of what the owner passed (limit ${percent(policy.maxFalseFailRate)})`,\n      )\n    }\n  } else if (agreement.accuracy === null || agreement.accuracy < policy.minAccuracy) {\n    below.push(\n      `accuracy ${agreement.accuracy === null ? 'unmeasured' : percent(agreement.accuracy)} is below ${percent(policy.minAccuracy)}`,\n    )\n  }\n  if (\n    policy.decides === 'verdict' &&\n    (agreement.kappa === null || agreement.kappa < policy.minKappa)\n  ) {\n    below.push(\n      `kappa ${agreement.kappa === null ? 'undefined' : agreement.kappa.toFixed(2)} is below ${policy.minKappa}`,\n    )\n  }\n  if (below.length > 0) return decide('below-threshold', below)\n\n  const history = (input.history ?? []).filter((snapshot) => snapshot.judgeId === judgeId)\n  if (history.length > 0) {\n    const report = judgeSentinelReport([...history], {\n      asOf: input.asOf,\n      ...(policy.drift ? { thresholds: policy.drift } : {}),\n    })\n    if (!report.healthy) return decide('drifted', report.alarms)\n  }\n  return decide('calibrated', [])\n}\n\n/** Thrown by `assertJudgeMayGate`; carries the refused decision. */\nexport class JudgeGateRefusedError extends JudgeError {\n  readonly decision: JudgeGateDecision\n\n  constructor(decision: JudgeGateDecision) {\n    super(\n      `judge \"${decision.judgeId}\" may not gate (${decision.status}): ${decision.reasons.join('; ')}`,\n    )\n    this.decision = decision\n  }\n}\n\n/** Throw unless the decision lets the judge gate. */\nexport function assertJudgeMayGate(decision: JudgeGateDecision): void {\n  if (!decision.mayGate) throw new JudgeGateRefusedError(decision)\n}\n\n/**\n * The sentinel snapshot for one calibration run. A deciding judge records\n * accuracy as `sentinelPassRate` and κ as `calibrationKappa` when it is\n * defined; a veto judge records the share of owner passes it let through as\n * `sentinelPassRate`. Append it to the judge's `SentinelStore`; the gate reads\n * drift from that history.\n */\nexport function snapshotFromJudgeAgreement(\n  agreement: JudgeAgreement,\n  options: { decides?: JudgeGatePolicy['decides'] } = {},\n): SentinelSnapshot {\n  const veto = options.decides === 'veto'\n  const rate = veto\n    ? agreement.falseFailRate === null\n      ? null\n      : 1 - agreement.falseFailRate\n    : agreement.accuracy\n  if (rate === null) {\n    throw new ValidationError(\n      `snapshotFromJudgeAgreement: judge \"${agreement.judgeId}\" has no ${veto ? 'runs on owner passes' : 'runs'} to snapshot`,\n    )\n  }\n  const snapshot: SentinelSnapshot = {\n    at: agreement.measuredAt,\n    judgeId: agreement.judgeId,\n    judgeModel: agreement.judgeModel,\n    metrics: {\n      sentinelPassRate: rate,\n      ...(veto || agreement.kappa === null ? {} : { calibrationKappa: agreement.kappa }),\n    },\n  }\n  validateSentinelSnapshot(snapshot)\n  return snapshot\n}\n"],"mappings":";;;AA8BA,SAAgB,cACd,QACA,UAAoC,CAAC,GACZ;CACzB,MAAM,SAAS,QAAQ,UAAU;CACjC,MAAM,WAAW,QAAQ,YAAY;CACrC,MAAM,WAAW,QAAQ,YAAY;CAErC,IAAI,OAAO,SAAS,KAAK,IAAI,GAAG,KAAK,IAAI,QAAQ,CAAC,CAAC,GACjD,OAAO;EAAE,OAAO;EAAqB,YAAY;EAAG,UAAU;EAAG,SAAS;EAAG,QAAQ;CAAM;CAG7F,MAAM,OAAO,OAAO,MAAM,CAAC,MAAM;CACjC,MAAM,OAAO,KAAK,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,KAAK;CACpD,MAAM,WAAW,KAAK,QAAQ,KAAK,MAAM,OAAO,IAAI,SAAS,GAAG,CAAC,IAAI,KAAK;CAG1E,MAAM,KAFS,KAAK,KAAK,QAET,KADA,KAAK,IAAI,IAAI,IAAI,OAAO,KAAK,IAAI,IAAI,IAAI;CAEzD,MAAM,SAAS,KAAK,UAAU,UAAU,MAAM;CAI9C,IAAI,UAAU;CACd,IAAI,YAAwB;CAC5B,KAAK,IAAI,IAAI,OAAO,SAAS,GAAG,IAAI,GAAG,KAAK;EAC1C,MAAM,QAAQ,OAAO,KAAM,OAAO,IAAI;EACtC,IAAI,UAAU,GAAG;EACjB,MAAM,MAAM,QAAQ,IAAI,IAAI;EAC5B,IAAI,cAAc,GAAG,YAAY;EACjC,IAAI,QAAQ,WAAW;EACvB,WAAW;CACb;CAEA,IAAI;CACJ,IAAI,QACF,QAAQ;MACH,IAAI,KAAK,IAAI,OAAO,KAAK,UAC9B,QAAQ,UAAU,IAAI,gBAAgB;MAEtC,QAAQ;CAGV,OAAO;EAAE;EAAO,YAAY;EAAM,UAAU;EAAI;EAAS;CAAO;AAClE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACpBA,MAAM,wBAAwB;CAAC;CAAO;CAAoB;AAAkB;AAmC5E,SAASA,WAAS,OAAe,OAAuB;CACtD,MAAM,KAAK,OAAO,UAAU,WAAW,KAAK,MAAM,KAAK,IAAI;CAC3D,IAAI,CAAC,OAAO,SAAS,EAAE,GACrB,MAAM,IAAI,gBACR,mBAAmB,MAAM,qCAAqC,KAAK,UAAU,KAAK,GACpF;CAEF,OAAO;AACT;;AAGA,SAAgB,yBAAyB,UAA4B,SAAS,YAAkB;CAC9F,WAAS,SAAS,IAAI,GAAG,OAAO,IAAI;CACpC,IAAI,OAAO,SAAS,YAAY,YAAY,SAAS,QAAQ,WAAW,GACtE,MAAM,IAAI,gBAAgB,mBAAmB,OAAO,oCAAoC;CAE1F,IAAI,OAAO,SAAS,eAAe,YAAY,SAAS,WAAW,WAAW,GAC5E,MAAM,IAAI,gBAAgB,mBAAmB,OAAO,uCAAuC;CAE7F,IAAI,SAAS,YAAY,QAAQ,OAAO,SAAS,YAAY,UAC3D,MAAM,IAAI,gBAAgB,mBAAmB,OAAO,0CAA0C;CAEhG,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,SAAS,OAAO,GAAG;EAC3D,IAAI,CAAE,sBAA4C,SAAS,GAAG,GAE5D,MAAM,IAAI,gBACR,mBAAmB,OAAO,gCAAgC,IAAI,aAAa,sBAAsB,KAAK,IAAI,GAC5G;EAEF,IAAI,UAAU,KAAA,KAAa,CAAC,OAAO,SAAS,KAAK,GAC/C,MAAM,IAAI,gBACR,mBAAmB,OAAO,WAAW,IAAI,2BAA2B,OAAO,KAAK,GAClF;CAEJ;AACF;;;;;;AASA,SAAgB,wBACd,QACA,MACkB;CAClB,MAAM,QAAQ,6BAA6B,SAAS,OAAO,0BAA0B,OAAO;CAC5F,IAAI,CAAC,OAAO,SAAS,KAAK,GACxB,MAAM,IAAI,gBACR,+CAA+C,OAAO,EAAE,iEAC1D;CAEF,MAAM,WAA6B;EAAE,GAAG;EAAM,SAAS,EAAE,kBAAkB,MAAM;CAAE;CACnF,yBAAyB,QAAQ;CACjC,OAAO;AACT;;;;;;;;AASA,SAAgB,sBACd,QACA,MACkB;CAClB,MAAM,MAAM,gBAAgB,SAAS,OAAO,aAAa,OAAO;CAChE,IAAI,CAAC,OAAO,SAAS,GAAG,GACtB,MAAM,IAAI,gBACR,4FACF;CAEF,MAAM,WAA6B;EAAE,GAAG;EAAM,SAAS,EAAE,IAAI;CAAE;CAC/D,yBAAyB,QAAQ;CACjC,OAAO;AACT;;;;;;;;AAcA,SAAgB,wBACd,QACA,QACA,MACA,UAA8B,CAAC,GACb;CAClB,MAAM,YAAY,QAAQ,aAAa;CACvC,IAAI,CAAC,OAAO,SAAS,SAAS,KAAK,YAAY,GAC7C,MAAM,IAAI,gBACR,uEAAuE,WACzE;CAEF,MAAM,6BAAa,IAAI,IAAoB;CAC3C,KAAK,MAAM,QAAQ,QAAQ;EACzB,IAAI,CAAC,OAAO,SAAS,KAAK,UAAU,GAClC,MAAM,IAAI,gBACR,yCAAyC,KAAK,OAAO,8BACvD;EAEF,IAAI,WAAW,IAAI,KAAK,MAAM,GAC5B,MAAM,IAAI,gBAAgB,qDAAqD,KAAK,OAAO,EAAE;EAE/F,WAAW,IAAI,KAAK,QAAQ,KAAK,UAAU;CAC7C;CACA,IAAI,SAAS;CACb,IAAI,SAAS;CACb,KAAK,MAAM,KAAK,QAAQ;EACtB,MAAM,QAAQ,WAAW,IAAI,EAAE,MAAM;EACrC,IAAI,UAAU,KAAA,GAAW;EACzB,IAAI,CAAC,OAAO,SAAS,EAAE,KAAK,GAC1B,MAAM,IAAI,gBACR,kDAAkD,EAAE,OAAO,gBAC7D;EAEF;EACA,IAAI,KAAK,IAAI,EAAE,QAAQ,KAAK,KAAK,WAAW;CAC9C;CACA,IAAI,WAAW,GACb,MAAM,IAAI,gBACR,yGACF;CAEF,MAAM,WAA6B;EAAE,GAAG;EAAM,SAAS,EAAE,kBAAkB,SAAS,OAAO;CAAE;CAC7F,yBAAyB,QAAQ;CACjC,OAAO;AACT;AAUA,SAAgB,sBAAsB,UAA8B,CAAC,GAAkB;CACrF,KAAK,MAAM,KAAK,SAAS,yBAAyB,CAAC;CACnD,MAAM,QAAQ,QAAQ,KAAK,OAAO;EAAE,GAAG;EAAG,SAAS,EAAE,GAAG,EAAE,QAAQ;CAAE,EAAE;CACtE,OAAO;EACL,MAAM,OAAO,UAAU;GACrB,yBAAyB,QAAQ;GACjC,MAAM,KAAK;IAAE,GAAG;IAAU,SAAS,EAAE,GAAG,SAAS,QAAQ;GAAE,CAAC;EAC9D;EACA,MAAM,QAAQ,SAAS;GACrB,MAAM,MAAM,MAAM,KAAK,OAAO;IAAE,GAAG;IAAG,SAAS,EAAE,GAAG,EAAE,QAAQ;GAAE,EAAE;GAClE,OAAO,YAAY,KAAA,IAAY,MAAM,IAAI,QAAQ,MAAM,EAAE,YAAY,OAAO;EAC9E;CACF;AACF;;;;;;;AAQA,SAAgB,kBAAkB,MAA6B;CAC7D,OAAO;EACL,MAAM,OAAO,UAAU;GACrB,yBAAyB,QAAQ;GACjC,MAAM,KAAK,MAAM,OAAO;GACxB,MAAM,UAAU,MAAM,OAAO;GAC7B,MAAM,GAAG,MAAM,QAAQ,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;GACzD,MAAM,GAAG,WAAW,MAAM,GAAG,KAAK,UAAU,QAAQ,EAAE,KAAK,MAAM;EACnE;EACA,MAAM,QAAQ,SAAS;GACrB,MAAM,KAAK,MAAM,OAAO;GACxB,IAAI;GACJ,IAAI;IACF,MAAM,MAAM,GAAG,SAAS,MAAM,MAAM;GACtC,SAAS,KAAK;IACZ,IAAK,IAA8B,SAAS,UAAU,OAAO,CAAC;IAC9D,MAAM;GACR;GACA,MAAM,QAAQ,IAAI,MAAM,IAAI;GAC5B,MAAM,YAAgC,CAAC;GACvC,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;IACrC,MAAM,OAAO,MAAM;IACnB,IAAI,KAAK,KAAK,CAAC,CAAC,WAAW,GAAG;IAC9B,IAAI;IACJ,IAAI;KACF,SAAS,KAAK,MAAM,IAAI;IAC1B,SAAS,KAAK;KACZ,MAAM,IAAI,gBACR,4BAA4B,KAAK,4BAA4B,IAAI,EAAE,IAAK,IAAc,SACxF;IACF;IACA,MAAM,WAAW;IACjB,yBAAyB,UAAU,GAAG,KAAK,GAAG,IAAI,GAAG;IACrD,UAAU,KAAK,QAAQ;GACzB;GACA,OAAO,YAAY,KAAA,IAAY,YAAY,UAAU,QAAQ,MAAM,EAAE,YAAY,OAAO;EAC1F;CACF;AACF;AAmDA,MAAM,aAAa;AAEnB,SAAgB,oBACd,SACA,MACgB;CAChB,MAAM,SAASA,WAAS,KAAK,MAAM,MAAM;CACzC,MAAM,SAAS,KAAK,YAAY,UAAU;CAC1C,MAAM,eAAe,KAAK,YAAY,gBAAgB;CACtD,MAAM,kBAAkB,KAAK,YAAY,mBAAmB;CAC5D,MAAM,iBAAiB,KAAK,YAAY,kBAAkB;CAE1D,MAAM,0BAAU,IAAI,IAAwD;CAC5E,KAAK,MAAM,YAAY,SAAS;EAC9B,yBAAyB,QAAQ;EACjC,MAAM,OAAOA,WAAS,SAAS,IAAI,uBAAuB,SAAS,QAAQ,GAAG;EAC9E,MAAM,MAAM,QAAQ,IAAI,SAAS,OAAO,KAAK,CAAC;EAC9C,IAAI,KAAK;GAAE,GAAG;GAAU;EAAK,CAAC;EAC9B,QAAQ,IAAI,SAAS,SAAS,GAAG;CACnC;CAEA,MAAM,WAA4B,CAAC;CACnC,MAAM,SAAmB,CAAC;CAC1B,MAAM,sBAAgC,CAAC;CAEvC,KAAK,MAAM,WAAW,CAAC,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG;EAChD,MAAM,QAAQ,QAAQ,IAAI,OAAO,CAAC,CAAE,MAAM,GAAG,MAAM,EAAE,OAAO,EAAE,IAAI;EAClE,MAAM,SAAS,MAAM,MAAM,SAAS;EAEpC,MAAM,WAAW,SAAS,OAAO,QAAQ;EACzC,IAAI,UAAU,gBACZ,OAAO,KACL,UAAU,QAAQ,6BAA6B,OAAO,GAAG,MAAM,QAAQ,QAAQ,CAAC,EAAE,uBAAuB,eAAe,GAC1H;EAMF,IAAI,YAAY;EAChB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAChC,IAAI,MAAM,EAAE,CAAE,eAAe,MAAM,IAAI,EAAE,CAAE,YAAY,YAAY;EAErE,IAAI,aAAa,GAQX;OAAA,CAPiB,MAClB,MAAM,SAAS,CAAC,CAChB,MACE,MACC,OAAO,SAAS,EAAE,QAAQ,gBAAgB,KAC1C,OAAO,SAAS,EAAE,QAAQ,gBAAgB,CAEhC,GACd,OAAO,KACL,UAAU,QAAQ,oBAAoB,MAAM,YAAY,EAAE,CAAE,WAAW,OAAO,MAAM,UAAU,CAAE,WAAW,OAAO,MAAM,UAAU,CAAE,GAAG,gIACzI;EAAA;EAIJ,KAAK,MAAM,UAAU,uBAAuB;GAC1C,MAAM,SAAS,MACZ,QAAQ,MAAM,OAAO,EAAE,QAAQ,YAAY,QAAQ,CAAC,CACpD,KAAK,MAAM,EAAE,QAAQ,OAAQ;GAChC,IAAI,OAAO,WAAW,GAAG;GAEzB,MAAM,cAAc,cAAc,QAAQ,KAAK,WAAW;GAC1D,IAAI,YAAY,UAAU,qBACxB,oBAAoB,KAAK,GAAG,QAAQ,GAAG,QAAQ;GAEjD,MAAM,UAAU,OAAO,OAAO,SAAS;GACvC,MAAM,WAAW,OAAO;GACxB,MAAM,QAAQ,UAAU;GACxB,MAAM,UAAoB,CAAC;GAC3B,IAAI,YAAY,UAAU,iBACxB,QAAQ,KACN,6CAA6C,YAAY,QAAQ,gBAAgB,YAAY,WAAW,QAAQ,CAAC,EAAE,EACrH;GAEF,IAAI,WAAW,SAAS,UAAU,QAChC,QAAQ,KAAK,OAAO,QAAQ,QAAQ,CAAC,EAAE,eAAe,QAAQ;GAEhE,IAAI,WAAW,sBAAsB,WAAW,UAAU,cACxD,QAAQ,KACN,6BAA6B,WAAW,QAAA,CAAS,QAAQ,CAAC,EAAE,iBAAiB,SAAS,QAAQ,CAAC,EAAE,UAAU,aAAa,EAC1H;GAEF,IAAI,WAAW,sBAAsB,WAAW,UAAU,iBACxD,QAAQ,KACN,6BAA6B,WAAW,QAAA,CAAS,QAAQ,CAAC,EAAE,iBAAiB,SAAS,QAAQ,CAAC,EAAE,UAAU,gBAAgB,EAC7H;GAGF,MAAM,UAAU,QAAQ,SAAS;GACjC,MAAM,QAAuB;IAC3B;IACA;IACA,OAAO,YAAY;IACnB;IACA;IACA;IACA;GACF;GACA,IAAI,SAAS;IACX,MAAM,SAAS,QAAQ,KAAK,IAAI;IAChC,OAAO,KAAK,UAAU,QAAQ,IAAI,OAAO,IAAI,MAAM,QAAQ;GAC7D;GACA,SAAS,KAAK,KAAK;EACrB;CACF;CAEA,OAAO;EAAE;EAAU;EAAQ,SAAS,OAAO,WAAW;EAAG;CAAoB;AAC/E;;;;;;;;;AAiBA,SAAgB,gBAAgB,QAAyC;CACvE,OAAO;EAAE,SAAS,OAAO;EAAS,QAAQ,CAAC,GAAG,OAAO,MAAM;CAAE;AAC/D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACzZA,SAAS,SAAS,OAAgB,OAAuB;CACvD,MAAM,KAAK,OAAO,UAAU,WAAW,KAAK,MAAM,KAAK,IAAI;CAC3D,IAAI,CAAC,OAAO,SAAS,EAAE,GACrB,MAAM,IAAI,gBACR,eAAe,MAAM,qCAAqC,KAAK,UAAU,KAAK,GAChF;CAEF,OAAO;AACT;AAEA,SAAS,YAAY,OAAgB,OAAuB;CAC1D,IAAI,OAAO,UAAU,YAAY,MAAM,KAAK,CAAC,CAAC,WAAW,GACvD,MAAM,IAAI,gBAAgB,eAAe,MAAM,4BAA4B;CAE7E,OAAO;AACT;AAEA,SAAS,eAAe,OAAgB,OAA6B;CACnE,IAAI,UAAU,UAAU,UAAU,QAChC,MAAM,IAAI,gBACR,eAAe,MAAM,iCAAiC,KAAK,UAAU,KAAK,GAC5E;CAEF,OAAO;AACT;AAEA,SAAS,aAAa,SAA6B,OAAmC;CACpF,IAAI,YAAY,QAAQ,OAAO,YAAY,UACzC,MAAM,IAAI,gBAAgB,eAAe,MAAM,mBAAmB;CAEpE,YAAY,QAAQ,IAAI,GAAG,MAAM,IAAI;CACrC,eAAe,QAAQ,SAAS,GAAG,MAAM,SAAS;CAClD,YAAY,QAAQ,WAAW,GAAG,MAAM,WAAW;CACnD,SAAS,QAAQ,WAAW,GAAG,MAAM,WAAW;CAChD,YAAY,QAAQ,QAAQ,GAAG,MAAM,QAAQ;CAC7C,IAAI,QAAQ,gBAAgB,KAAA,GAAW,YAAY,QAAQ,aAAa,GAAG,MAAM,aAAa;CAC9F,MAAM,OAA2B;EAC/B,IAAI,QAAQ;EACZ,SAAS,QAAQ;EACjB,WAAW,QAAQ;EACnB,WAAW,QAAQ;EACnB,QAAQ,QAAQ;CAClB;CACA,IAAI,QAAQ,gBAAgB,KAAA,GAAW,KAAK,cAAc,QAAQ;CAClE,IAAI,QAAQ,SAAS,KAAA,GAAW,KAAK,OAAO,QAAQ;CACpD,OAAO;AACT;;;;;AAMA,SAAgB,uBAAuB,KAA+C;CACpF,IAAI,QAAQ,QAAQ,OAAO,QAAQ,UACjC,MAAM,IAAI,gBAAgB,+CAA+C;CAE3E,MAAM,UAAU,YAAY,IAAI,SAAS,yBAAyB;CAClE,MAAM,QAAQ,YAAY,IAAI,OAAO,oBAAoB,QAAQ,QAAQ;CACzE,IAAI,CAAC,MAAM,QAAQ,IAAI,QAAQ,GAC7B,MAAM,IAAI,gBAAgB,gCAAgC,QAAQ,4BAA4B;CAEhG,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,WAAW,IAAI,SAAS,KAAK,SAAS,UAAU;EACpD,MAAM,UAAU,aAAa,SAAS,oBAAoB,QAAQ,YAAY,OAAO;EACrF,IAAI,KAAK,IAAI,QAAQ,EAAE,GACrB,MAAM,IAAI,gBACR,gCAAgC,QAAQ,8BAA8B,QAAQ,GAAG,EACnF;EAEF,KAAK,IAAI,QAAQ,EAAE;EACnB,OAAO;CACT,CAAC;CACD,SAAS,MAAM,GAAG,MAAO,EAAE,KAAK,EAAE,KAAK,KAAK,EAAE,KAAK,EAAE,KAAK,IAAI,CAAE;CAChE,OAAO;EAAE;EAAS;EAAO;CAAS;AACpC;;;;;;;AAkBA,SAAgB,uBACd,KACA,UACkB;CAClB,MAAM,OAAO,uBAAuB,GAAG;CACvC,MAAM,OAAO,IAAI,IAAI,KAAK,SAAS,KAAK,YAAY,CAAC,QAAQ,IAAI,OAAO,CAAC,CAAC;CAC1E,MAAM,QAAkB,CAAC;CACzB,MAAM,aAAuB,CAAC;CAC9B,MAAM,YAAsB,CAAC;CAC7B,KAAK,MAAM,CAAC,OAAO,YAAY,SAAS,QAAQ,GAAG;EACjD,MAAM,WAAW,aAAa,SAAS,oBAAoB,MAAM,QAAQ,KAAK,QAAQ,EAAE;EACxF,MAAM,UAAU,KAAK,IAAI,SAAS,EAAE;EACpC,IAAI,CAAC,SAAS;GACZ,KAAK,IAAI,SAAS,IAAI,QAAQ;GAC9B,MAAM,KAAK,SAAS,EAAE;GACtB;EACF;EAEA,IADqB,QAAQ,WAAW,SAAS,UAAU,QAAQ,YAAY,SAAS,WAGtF,SAAS,SAAS,WAAW,WAAW,KAAK,SAAS,QAAQ,WAAW,WAAW,GACpF;GACA,UAAU,KAAK,SAAS,EAAE;GAC1B;EACF;EACA,KAAK,IAAI,SAAS,IAAI,QAAQ;EAC9B,WAAW,KAAK,SAAS,EAAE;CAC7B;CACA,OAAO;EACL,KAAK,uBAAuB;GAAE,GAAG;GAAM,UAAU,CAAC,GAAG,KAAK,OAAO,CAAC;EAAE,CAAC;EACrE;EACA;EACA;CACF;AACF;AAiFA,SAAS,kBAAkB,QAAgB,GAAmB;CAC5D,MAAM,IAAI,SAAS;CACnB,OAAO,KAAK,IAAI;AAClB;;AAGA,SAAS,YAAY,WAA0C;CAC7D,MAAM,IAAI,UAAU,WAAW,UAAU,WAAW,UAAU,YAAY,UAAU;CACpF,IAAI,MAAM,GAAG,OAAO;CACpB,MAAM,YAAY,UAAU,WAAW,UAAU,YAAY;CAC7D,MAAM,aAAa,UAAU,WAAW,UAAU,aAAa;CAC/D,MAAM,aAAa,UAAU,WAAW,UAAU,aAAa;CAC/D,MAAM,WAAW,YAAY,aAAa,IAAI,cAAc,IAAI;CAChE,IAAI,aAAa,GAAG,OAAO;CAC3B,QAAQ,WAAW,aAAa,IAAI;AACtC;;;;;;AAOA,SAAgB,sBACd,KACA,MACA,MACgB;CAChB,MAAM,aAAa,uBAAuB,GAAG;CAC7C,IAAI,KAAK,YAAY,WAAW,SAC9B,MAAM,IAAI,gBACR,mCAAmC,KAAK,QAAQ,4BAA4B,WAAW,QAAQ,EACjG;CAEF,YAAY,KAAK,YAAY,YAAY;CACzC,YAAY,KAAK,eAAe,eAAe;CAC/C,SAAS,KAAK,YAAY,YAAY;CACtC,MAAM,OAAO,IAAI,IAAI,WAAW,SAAS,KAAK,YAAY,CAAC,QAAQ,IAAI,OAAO,CAAC,CAAC;CAChF,MAAM,2BAAW,IAAI,IAAwB;CAC7C,MAAM,YAA4B;EAAE,UAAU;EAAG,UAAU;EAAG,WAAW;EAAG,WAAW;CAAE;CACzF,MAAM,YAAsB,CAAC;CAC7B,KAAK,MAAM,CAAC,OAAO,QAAQ,KAAK,QAAQ,GAAG;EACzC,MAAM,UAAU,KAAK,IAAI,KAAK,SAAS;EACvC,IAAI,CAAC,SACH,MAAM,IAAI,gBACR,mBAAmB,MAAM,iBAAiB,KAAK,UAAU,KAAK,SAAS,EAAE,qBAAqB,WAAW,QAAQ,oBACnH;EAEF,MAAM,UAAU,eAAe,IAAI,SAAS,OAAO,MAAM,SAAS;EAClE,IAAI,IAAI,YAAY,KAAA,GAAW;GAC7B,IAAI,CAAC,MAAM,QAAQ,IAAI,OAAO,KAAK,IAAI,QAAQ,WAAW,GACxD,MAAM,IAAI,gBAAgB,mBAAmB,MAAM,mCAAmC;GAExF,MAAM,UAAU,IAAI,QAAQ,KAAK,QAAQ,MACvC,eAAe,QAAQ,OAAO,MAAM,UAAU,GAAG,CACnD;GACA,UAAU,KACR,kBAAkB,QAAQ,QAAQ,WAAW,WAAW,MAAM,CAAC,CAAC,QAAQ,QAAQ,MAAM,CACxF;EACF;EACA,MAAM,OAAO,SAAS,IAAI,QAAQ,EAAE,KAAK,CAAC;EAC1C,KAAK,KAAK;GAAE,GAAG;GAAK;EAAQ,CAAC;EAC7B,SAAS,IAAI,QAAQ,IAAI,IAAI;EAC7B,IAAI,YAAY,QAAQ;GACtB,IAAI,QAAQ,YAAY,QAAQ,UAAU;QACrC,UAAU;EACjB,OAAO,IAAI,QAAQ,YAAY,QAAQ,UAAU;OAC5C,UAAU;CACjB;CAEA,MAAM,aAAsC,CAAC;CAC7C,MAAM,WAAqB,CAAC;CAC5B,MAAM,kBAAgD;EAAE,MAAM;EAAG,MAAM;CAAE;CACzE,KAAK,MAAM,WAAW,WAAW,UAAU;EACzC,MAAM,OAAO,SAAS,IAAI,QAAQ,EAAE;EACpC,IAAI,CAAC,MAAM;GACT,SAAS,KAAK,QAAQ,EAAE;GACxB;EACF;EACA,gBAAgB,QAAQ,QAAQ;EAChC,MAAM,SAAS,KAAK,QAAQ,QAAQ,IAAI,YAAY,MAAM,CAAC,CAAC;EAC5D,WAAW,KAAK;GACd,IAAI,QAAQ;GACZ,SAAS,QAAQ;GACjB,MAAM,KAAK;GACX,UAAU,SAAS,KAAK;GACxB,WAAW,KAAK,QAAQ,QAAQ,IAAI,YAAY,QAAQ,OAAO,CAAC,CAAC,SAAS,KAAK;EACjF,CAAC;CACH;CAEA,MAAM,QAAQ,KAAK;CACnB,MAAM,aAAa,UAAU,WAAW,UAAU;CAClD,MAAM,iBAAiB,WAAW,QAAQ,YAAY,QAAQ,cAAc,CAAC,CAAC,CAAC;CAC/E,MAAM,QAAQ,WACZ,OAAO,WAAW,IAAI,OAAO,OAAO,QAAQ,KAAK,UAAU,MAAM,OAAO,CAAC,IAAI,OAAO;CACtF,OAAO;EACL,GAAG;EACH,OAAO,WAAW;EAClB,UAAU,WAAW,SAAS;EAC9B,QAAQ,WAAW;EACnB;EACA,MAAM;EACN,UAAU,UAAU,IAAI,OAAO,aAAa;EAC5C,iBACE,WAAW,WAAW,IAClB,OACA;GACE,QAAQ;GACR,QAAQ,WAAW;GACnB,UAAU,gBACR;IAAE,MAAM;IAAmB,OAAO;GAAK,GACvC;IAAE,MAAM;IAAY,WAAW;IAAgB,QAAQ,WAAW;GAAO,CAC3E;EACF;EACN,OAAO,YAAY,SAAS;EAC5B,eACE,UAAU,WAAW,UAAU,cAAc,IACzC,OACA,UAAU,aAAa,UAAU,WAAW,UAAU;EAC5D,WACE,UAAU,WAAW,UAAU,cAAc,IACzC,OACA,UAAU,YAAY,UAAU,WAAW,UAAU;EAC3D;EACA,UAAU;GACR,aAAa,KAAK,WAAW,KAAK,YAAY,QAAQ,YAAY,IAAI,QAAQ,SAAS,CAAC;GACxF,WAAW,KAAK,SAAS;GACzB,UAAU,WACP,QAAQ,YAAY,QAAQ,WAAW,KAAK,QAAQ,WAAW,CAAC,CAAC,CACjE,KAAK,YAAY,QAAQ,EAAE;EAChC;EACA,eAAe,WACZ,QAAQ,YAAY,QAAQ,YAAY,CAAC,CAAC,CAC1C,MAAM,GAAG,MAAM,EAAE,YAAY,EAAE,cAAc,EAAE,KAAK,EAAE,KAAK,KAAK,EAAE;EACrE;CACF;AACF;AAwBA,MAAa,4BAAuD,OAAO,OAAO;CAChF,SAAS;CACT,aAAa;CACb,eAAe;CACf,aAAa;CACb,UAAU;CACV,kBAAkB;CAClB,YAAY;AACd,CAAC;AA+BD,MAAM,SAAS;AAEf,SAAS,QAAQ,OAAuB;CACtC,OAAO,IAAI,QAAQ,IAAA,CAAK,QAAQ,CAAC,EAAE;AACrC;;AAGA,SAAgB,kBAAkB,OAA0C;CAC1E,MAAM,UAAU,YAAY,MAAM,SAAS,SAAS;CACpD,MAAM,aAAa,YAAY,MAAM,YAAY,YAAY;CAC7D,MAAM,gBAAgB,YAAY,MAAM,eAAe,eAAe;CACtE,MAAM,OAAO,SAAS,MAAM,MAAM,MAAM;CACxC,MAAM,SAA0B;EAC9B,GAAG;EACH,GAAG,OAAO,YACR,OAAO,QAAQ,MAAM,UAAU,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,WAAW,UAAU,KAAA,CAAS,CAC9E;CACF;CACA,IAAI,OAAO,YAAY,aAAa,OAAO,YAAY,QACrD,MAAM,IAAI,gBACR,+DAA+D,KAAK,UAAU,OAAO,OAAO,GAC9F;CAEF,MAAM,YAAY,MAAM;CACxB,MAAM,UAAU,QAAyB,aAA0C;EACjF;EACA;EACA;EACA,SAAS,WAAW;EACpB;EACA;EACA;EACA;CACF;CAEA,IAAI,CAAC,WAAW,OAAO,OAAO,gBAAgB,CAAC,2CAA2C,CAAC;CAC3F,IAAI,UAAU,YAAY,SACxB,MAAM,IAAI,gBACR,qCAAqC,UAAU,QAAQ,UAAU,QAAQ,EAC3E;CAGF,MAAM,eAAyB,CAAC;CAChC,IAAI,UAAU,eAAe,YAC3B,aAAa,KACX,mCAAmC,UAAU,WAAW,uBAAuB,YACjF;CAEF,IAAI,UAAU,kBAAkB,eAC9B,aAAa,KACX,oCAAoC,UAAU,cAAc,uBAAuB,eACrF;CAEF,MAAM,WAAW,OAAO,SAAS,UAAU,YAAY,sBAAsB,KAAK;CAClF,IAAI,UAAU,OAAO,YACnB,aAAa,KAAK,gBAAgB,QAAQ,QAAQ,CAAC,EAAE,mBAAmB,OAAO,WAAW,EAAE;CAE9F,IAAI,OAAO,YAAY,QAEjB;MAAA,UAAU,gBAAgB,OAAO,OAAO,aAC1C,aAAa,KACX,GAAG,UAAU,gBAAgB,KAAK,sEAAsE,OAAO,aACjH;CAAA,OAEG;EACL,IAAI,UAAU,SAAS,OAAO,aAC5B,aAAa,KACX,GAAG,UAAU,OAAO,UAAU,UAAU,WAAW,IAAI,YAAY,WAAW,aAAa,OAAO,YAAY,UAChH;EAEF,KAAK,MAAM,WAAW,CAAC,QAAQ,MAAM,GACnC,IAAI,UAAU,gBAAgB,WAAW,OAAO,eAC9C,aAAa,KACX,GAAG,UAAU,gBAAgB,SAAS,oCAAoC,QAAQ,aAAa,OAAO,cAAc,UACtH;CAGN;CACA,IAAI,aAAa,SAAS,GAAG,OAAO,OAAO,gBAAgB,YAAY;CAEvE,MAAM,QAAkB,CAAC;CACzB,IAAI,OAAO,YAAY,QACjB;MAAA,UAAU,kBAAkB,QAAQ,UAAU,gBAAgB,OAAO,kBACvE,MAAM,KACJ,YAAY,UAAU,kBAAkB,OAAO,wBAAwB,QAAQ,UAAU,aAAa,EAAE,mCAAmC,QAAQ,OAAO,gBAAgB,EAAE,EAC9K;CAAA,OAEG,IAAI,UAAU,aAAa,QAAQ,UAAU,WAAW,OAAO,aACpE,MAAM,KACJ,YAAY,UAAU,aAAa,OAAO,eAAe,QAAQ,UAAU,QAAQ,EAAE,YAAY,QAAQ,OAAO,WAAW,GAC7H;CAEF,IACE,OAAO,YAAY,cAClB,UAAU,UAAU,QAAQ,UAAU,QAAQ,OAAO,WAEtD,MAAM,KACJ,SAAS,UAAU,UAAU,OAAO,cAAc,UAAU,MAAM,QAAQ,CAAC,EAAE,YAAY,OAAO,UAClG;CAEF,IAAI,MAAM,SAAS,GAAG,OAAO,OAAO,mBAAmB,KAAK;CAE5D,MAAM,WAAW,MAAM,WAAW,CAAC,EAAA,CAAG,QAAQ,aAAa,SAAS,YAAY,OAAO;CACvF,IAAI,QAAQ,SAAS,GAAG;EACtB,MAAM,SAAS,oBAAoB,CAAC,GAAG,OAAO,GAAG;GAC/C,MAAM,MAAM;GACZ,GAAI,OAAO,QAAQ,EAAE,YAAY,OAAO,MAAM,IAAI,CAAC;EACrD,CAAC;EACD,IAAI,CAAC,OAAO,SAAS,OAAO,OAAO,WAAW,OAAO,MAAM;CAC7D;CACA,OAAO,OAAO,cAAc,CAAC,CAAC;AAChC;;AAGA,IAAa,wBAAb,cAA2C,WAAW;CACpD;CAEA,YAAY,UAA6B;EACvC,MACE,UAAU,SAAS,QAAQ,kBAAkB,SAAS,OAAO,KAAK,SAAS,QAAQ,KAAK,IAAI,GAC9F;EACA,KAAK,WAAW;CAClB;AACF;;AAGA,SAAgB,mBAAmB,UAAmC;CACpE,IAAI,CAAC,SAAS,SAAS,MAAM,IAAI,sBAAsB,QAAQ;AACjE;;;;;;;;AASA,SAAgB,2BACd,WACA,UAAoD,CAAC,GACnC;CAClB,MAAM,OAAO,QAAQ,YAAY;CACjC,MAAM,OAAO,OACT,UAAU,kBAAkB,OAC1B,OACA,IAAI,UAAU,gBAChB,UAAU;CACd,IAAI,SAAS,MACX,MAAM,IAAI,gBACR,sCAAsC,UAAU,QAAQ,WAAW,OAAO,yBAAyB,OAAO,aAC5G;CAEF,MAAM,WAA6B;EACjC,IAAI,UAAU;EACd,SAAS,UAAU;EACnB,YAAY,UAAU;EACtB,SAAS;GACP,kBAAkB;GAClB,GAAI,QAAQ,UAAU,UAAU,OAAO,CAAC,IAAI,EAAE,kBAAkB,UAAU,MAAM;EAClF;CACF;CACA,yBAAyB,QAAQ;CACjC,OAAO;AACT"}

package/dist/judge-gate-DNcUrRFA.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"judge-gate-DNcUrRFA.d.ts","names":[],"sources":["../src/statistics/agreement-irr.ts","../src/series-convergence.ts","../src/meta-eval/sentinel.ts","../src/meta-eval/judge-gate.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;;;iBAyBgB,sBAAsB,aAAa;UA0ElC;;EAEf;;EAEA;;EAEA;;EAEA;;UAGe,oCAAoC;EACnD;;EAEA;;EAEA;;UAGe;;EAEf,cAAc;;EAEd;;EAEA;;EAEA;;EAEA;;UAGe,+BAA+B;;;;;;EAM9C;;;;;;EAMA;;;;;;;;;;;;;;;;;;iBAmBc,0BACd,SAAS,qBACT,OAAM,yBACL;;;;;;;;;iBA0Ha,yCACd,aAAa;EAAQ;EAAgB,QAAQ;IAC7C,OAAM,yBACL;;;;;;;;;;;;;UCvRc;;EAEf;;EAEA;;EAEA;;UAGe;EACf;EACA;EACA;;EAEA;;EAEA;;iBAGc,cACd,kBACA,UAAS,2BACR;;;cCoBG;KAEM,6BAA6B;UAExB;;EAEf;;EAEA;;EAEA;;UAGe;;EAEf;EACA;;EAEA;;;;;;;EAOA,SAAS;;;UAIM;EACf;EACA;EACA;;;iBAcc,yBAAyB,UAAU,kBAAkB;;;;;;iBAiCrD,wBACd,QAAQ,oBAAoB,6BAC5B,MAAM,eACL;;;;;;;;iBAmBa,sBACd,QAAQ,wBAAwB,qBAChC,MAAM,eACL;UAYc;;EAEf;;;;;;;;;iBAUc,wBACd,QAAQ,kBACR,QAAQ,cACR,MAAM,cACN,UAAS,qBACR;UA4Cc;EACf,OAAO,UAAU,mBAAmB;;EAEpC,QAAQ,mBAAmB,QAAQ;;iBAGrB,sBAAsB,UAAS,qBAA0B;;;;;;;iBAqBzD,kBAAkB,eAAe;UA0ChC;;EAEf;;EAEA;;EAEA;;EAEA;;UAGe;;EAEf;EACA,aAAa;;EAEb,cAAc;;UAGC;EACf;EACA,QAAQ;;EAER,OAAO;;EAEP;;EAEA;;EAEA;EACA;EACA;;UAGe;EACf,UAAU;EACV;EACA;;;;;;;EAOA;;iBAKc,oBACd,SAAS,oBACT,MAAM,uBACL;UA6Gc;EACf;EACA;;;;;;;;;;iBAWc,gBAAgB,QAAQ,iBAAiB;;;KChb7C;;UAGK;;EAEf;EACA,SAAS;;EAET;;EAEA;;EAEA;;EAEA;EACA;;UAGe;EACf;;EAEA;EACA,mBAAmB;;;;;;iBAuDL,uBAAuB,KAAK,sBAAsB;UAwBjD;EACf,KAAK;;EAEL;;EAEA;;EAEA;;;;;;;;iBASc,uBACd,KAAK,qBACL,mBAAmB,uBAClB;;UAkCc;EACf;;EAEA,SAAS;;EAET,mBAAmB;;UAGJ;EACf;;EAEA;EACA;EACA;;UAGe;;EAEf;;EAEA;;EAEA;;EAEA;;UAGe;EACf;EACA,SAAS;EACT;;EAEA;;EAEA;;UAGe,uBAAuB;EACtC;;EAEA;;EAEA;;EAEA,iBAAiB,OAAO;EACxB;;EAEA;;;;;;EAMA;IAAmB;IAAgB;IAAgB,UAAU;;;;;;EAK7D;;EAEA;;EAEA;EACA,WAAW;EACX;;IAEE;;IAEA;;IAEA;;;EAGF,eAAe;;EAEf;;;;;;;iBAyBc,sBACd,KAAK,qBACL,eAAe,YACf,MAAM,eACL;UA+Gc;;;;;EAKf;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA,QAAQ;;cAGG,2BAA2B,SAAS;KAUrC;UAEK;EACf;EACA;EACA;;EAEA;EACA,QAAQ;;EAER;EACA,WAAW;EACX,QAAQ;;UAGO;EACf;;EAEA;;EAEA;;EAEA,WAAW;EACX;;EAEA,mBAAmB;EACnB,SAAS,QAAQ;;;iBAUH,kBAAkB,OAAO,iBAAiB;;cA2G7C,8BAA8B;WAChC,UAAU;EAEnB,YAAY,UAAU;;;iBASR,mBAAmB,UAAU;;;;;;;;iBAW7B,2BACd,WAAW,gBACX;EAAW,UAAU;IACpB"}