@tangle-network/agent-eval 0.119.0 → 0.120.0

package/dist/chunk-XDIRG3TO.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/campaign/run-campaign.ts","../src/integrity/backend-integrity.ts","../src/verdict-cache.ts","../src/campaign/coverage.ts","../src/campaign/run-dir.ts","../src/campaign/storage.ts","../src/campaign/search-ledger-file.ts","../src/campaign/search-ledger-errors.ts"],"sourcesContent":["/**\n * `runCampaign` — Pass A substrate primitive. ONE function that orchestrates\n * scenarios → dispatch → artifacts → judges → aggregates, with full\n * reproducibility (seed + manifest hash), cell-level resumability, bootstrap\n * CIs, and the `LabeledScenarioStore` capture flywheel.\n *\n * Improvement loops (optimizer / gate / autoOnPromote) ride on top of this\n * primitive but live in `presets/run-improvement-loop.ts`. This file keeps\n * the core orchestrator minimal — Phase 1 of the Pass A track.\n */\n\nimport { join } from 'node:path'\nimport {\n  CostAccountingIncompleteError,\n  type CostLedgerHandle,\n  type CostLedgerSummary,\n} from '../cost-ledger'\nimport { BackendIntegrityError, type BackendIntegrityReport } from '../integrity/backend-integrity'\nimport { confidenceInterval } from '../statistics'\nimport { contentHash } from '../verdict-cache'\nimport { assertCampaignDesign, campaignScenarioIdentity, campaignSplitDigest } from './coverage'\nimport { resolveRunDir } from './run-dir'\nimport { type CampaignStorage, createRunCostLedger, fsCampaignStorage } from './storage'\nimport type {\n  CampaignAggregates,\n  CampaignArtifactWriter,\n  CampaignCellResult,\n  CampaignCostMeter,\n  CampaignResult,\n  CampaignTokenUsage,\n  CampaignTraceWriter,\n  DispatchContext,\n  DispatchFn,\n  JudgeAggregate,\n  JudgeConfig,\n  JudgeScore,\n  LabeledScenarioStore,\n  Scenario,\n  ScenarioAggregate,\n  TraceSpan,\n} from './types'\n\nexport interface RunCampaignOptions<TScenario extends Scenario, TArtifact> {\n  scenarios: TScenario[]\n  dispatch: DispatchFn<TScenario, TArtifact>\n  /**\n   * Stable identity for the dispatch behavior, included in the manifest/cache\n   * key. Set this when the same function name can run different models,\n   * prompts, tools, or external config.\n   */\n  dispatchRef?: string\n  judges?: JudgeConfig<TArtifact, TScenario>[]\n  /** Required for reproducibility. Default 42. */\n  seed?: number\n  /** Per-scenario replicates for CI bands. Default 1; raise to 5+ for\n   *  bootstrap-tight intervals on critical eval. */\n  reps?: number\n  /** When true (default), completed cells are cached by\n   *  (manifestHash, scenarioId, rep, generation). Re-runs skip cached cells. */\n  resumable?: boolean\n  /** Optional store — when present, every artifact + judge score is captured\n   *  with the configured `captureSource`. Capture is default ON; pass `'off'`\n   *  to disable. */\n  labeledStore?: LabeledScenarioStore | 'off'\n  captureSource?: 'production-trace' | 'eval-run' | 'manual' | 'red-team' | 'synthetic'\n  captureSourceVersionHash?: string\n  /** Hard spend cap. Each paid call reserves its enforced maximum before dispatch. */\n  costCeiling?: number\n  /** Shared spend account. Improvement loops pass one ledger through every\n   *  campaign so the ceiling and returned total are run-wide. */\n  costLedger?: CostLedgerHandle\n  /** Attribution label for receipts recorded by this campaign. */\n  costPhase?: string\n  /** Max concurrent cells. Default 2. */\n  maxConcurrency?: number\n  /**\n   * Per-cell dispatch deadline in ms. A `dispatch` that neither resolves nor\n   * rejects within this window is a hang (a stalled model request, an\n   * exhausted runtime resource, a backend that never closes its stream). When\n   * set, the cell's `ctx.signal` is aborted and the cell is recorded as a LOUD\n   * error (`dispatch exceeded <N>ms`) so the campaign proceeds and the failure\n   * is visible — instead of one wedged cell silently hanging the whole run (and\n   * every loop/CI job above it) forever. `undefined`/`0` = unbounded (legacy).\n   */\n  dispatchTimeoutMs?: number\n  /** Required: where artifacts + traces land. A bare name (not an absolute path)\n   *  resolves to the shared `~/.tangle/traces/<repo>/runs/<name>` root so run\n   *  bundles never pollute a repo working tree. Pass an absolute path to override. */\n  runDir: string\n  /** Subject repo for the shared run-dir root (defaults to the CWD basename).\n   *  Only consulted when `runDir` is a bare name. */\n  repo?: string\n  /** Tracing posture. Default is the substrate's `FileSystemTraceStore` rooted\n   *  at `<runDir>/traces/`. `'off'` disables capture entirely — substrate\n   *  refuses this when the caller wires `autoOnPromote !== 'none'`. */\n  tracing?: 'on' | 'off'\n  /**\n   * Per-cell usage expectation — the early, fine-grained sibling of the\n   * batch `assertRealBackend` guard. A cell that produced an artifact (no\n   * error) but reported `costUsd === 0` AND zero tokens is a stub: the\n   * dispatch never reported LLM activity via `ctx.cost`. Modes:\n   *   - `'warn'` (default) — log the offending cell loudly, keep going.\n   *   - `'assert'` — throw `BackendIntegrityError` on the first such cell\n   *     (fail-fast; recommended for CI campaigns expecting real LLM calls).\n   *   - `'off'` — no check (replay / deterministic-only / offline analysis).\n   */\n  expectUsage?: 'assert' | 'warn' | 'off'\n  /** Test seam — override the wall clock for deterministic tests. */\n  now?: () => Date\n  /** Test seam — override per-cell trace writer factory. */\n  buildTraceWriter?: (cellId: string, dir: string) => CampaignTraceWriter\n  /** Storage backend for run/cell dirs, the resumability cache, artifacts,\n   *  and trace spans. Default: the Node filesystem (`fsCampaignStorage`).\n   *  Pass `inMemoryCampaignStorage()` to run in a filesystem-less runtime\n   *  (Cloudflare Workers, Deno, edge) — the `CampaignResult` is still\n   *  produced; artifacts/traces just aren't persisted to disk. */\n  storage?: CampaignStorage\n  /**\n   * Optional per-cell placement strategy. Returns an opaque string the\n   * substrate forwards as `ctx.placement` to the Dispatch — placement-aware\n   * Dispatches (e.g. `httpDispatch` from `/adapters/http`) use it to route\n   * each cell to the right worker, region, or sandbox. When unset, every\n   * cell receives `ctx.placement = undefined` and behaves identically to\n   * the in-process case.\n   *\n   * @example\n   *   cellPlacement: ({ scenario }) => scenario.tags?.includes('eu') ? 'eu-west' : 'us-east'\n   */\n  cellPlacement?: (input: {\n    scenario: TScenario\n    rep: number\n    generation?: number\n  }) => string | undefined\n}\n\n/**\n * Core campaign orchestrator: fan scenarios through dispatch, score with judges, aggregate bootstrap CIs, and persist reproducible `CampaignResult` records.\n */\nexport async function runCampaign<TScenario extends Scenario, TArtifact>(\n  opts: RunCampaignOptions<TScenario, TArtifact>,\n): Promise<CampaignResult<TArtifact, TScenario>> {\n  const seed = opts.seed ?? 42\n  const reps = opts.reps ?? 1\n  const resumable = opts.resumable ?? true\n  const now = opts.now ?? (() => new Date())\n  const judges = opts.judges ?? []\n  const storage = opts.storage ?? fsCampaignStorage()\n  const costPhase = opts.costPhase ?? 'campaign'\n\n  assertCampaignDesign(opts.scenarios, reps)\n\n  if (typeof opts.runDir !== 'string' || opts.runDir.trim().length === 0) {\n    throw new Error('runCampaign: runDir is required and must be a non-empty string')\n  }\n  opts.runDir = resolveRunDir(opts.runDir, opts.repo)\n  storage.ensureDir(opts.runDir)\n  const costLedger =\n    opts.costLedger ??\n    createRunCostLedger({\n      storage,\n      runDir: opts.runDir,\n      costCeilingUsd: opts.costCeiling,\n    })\n  if (opts.costCeiling !== undefined && costLedger.costCeilingUsd !== opts.costCeiling) {\n    throw new Error('runCampaign: costCeiling must match the shared CostLedger ceiling')\n  }\n  const maxConcurrency = opts.maxConcurrency ?? 2\n\n  const manifestHash = computeManifestHash({\n    scenarios: opts.scenarios,\n    judges: judges as unknown as JudgeConfig<unknown>[],\n    dispatchRef: dispatchRefFor(opts.dispatch, opts.dispatchRef),\n    seed,\n    reps,\n  })\n  const splitDigest = campaignSplitDigest(opts.scenarios, reps)\n\n  const startedAt = now()\n  const runAttemptId = globalThis.crypto.randomUUID()\n  const cells: CampaignCellResult<TArtifact>[] = []\n  const artifactsByPath: Record<string, string> = {}\n\n  // Build the cell schedule (scenario × rep).\n  const schedule = buildCellSchedule(opts.scenarios, seed, reps)\n\n  // Concurrency-limited execution.\n  const abortController = new AbortController()\n  // Concurrency lanes that drain the cell schedule. Named \"lanes\" — not\n  // \"workers\" — to avoid clashing with the taxonomy's worker (= the agent\n  // harness in a sandbox, invoked behind `dispatch`). See loop-taxonomy.md.\n  const lanes: Promise<void>[] = []\n  let nextIdx = 0\n  const cellsRef = cells\n\n  for (let i = 0; i < maxConcurrency; i++) {\n    lanes.push(\n      (async () => {\n        while (true) {\n          const myIdx = nextIdx++\n          if (myIdx >= schedule.length) return\n          const slot = schedule[myIdx]!\n          const result = await executeCell({\n            slot,\n            opts,\n            manifestHash,\n            resumable,\n            now,\n            storage,\n            buildTraceWriter: opts.buildTraceWriter ?? defaultBuildTraceWriter(storage),\n            signal: abortController.signal,\n            dispatchTimeoutMs: opts.dispatchTimeoutMs,\n            costLedger,\n            costPhase,\n            runAttemptId,\n          })\n          cellsRef.push(result.cell)\n          Object.assign(artifactsByPath, result.artifactsByPath)\n          // Capture into LabeledScenarioStore unless explicitly disabled.\n          if (opts.labeledStore && opts.labeledStore !== 'off' && !result.cell.error) {\n            await captureToStore({\n              store: opts.labeledStore,\n              cell: result.cell,\n              scenario: slot.scenario,\n              opts,\n              now,\n            }).catch((err) => {\n              // Capture failures are non-fatal — log but don't crash the campaign.\n              // (Trace would normally land here.)\n              console.warn(\n                `[runCampaign] capture failed for ${result.cell.cellId}: ${err instanceof Error ? err.message : String(err)}`,\n              )\n            })\n          }\n        }\n      })(),\n    )\n  }\n  await Promise.all(lanes)\n\n  const endedAt = now()\n  cellsRef.sort((a, b) => a.cellId.localeCompare(b.cellId))\n\n  const campaignCost = costLedger.summary({ tags: { runDir: opts.runDir } })\n  const aggregates = computeAggregates(\n    cellsRef,\n    judges as unknown as JudgeConfig<TArtifact>[],\n    seed,\n    campaignCost,\n  )\n\n  return {\n    manifestHash,\n    splitDigest,\n    seed,\n    reps,\n    startedAt: startedAt.toISOString(),\n    endedAt: endedAt.toISOString(),\n    durationMs: endedAt.getTime() - startedAt.getTime(),\n    cells: cellsRef,\n    aggregates,\n    runDir: opts.runDir,\n    artifactsByPath,\n    scenarios: opts.scenarios.map(campaignScenarioIdentity),\n  }\n}\n\n// ── Internals ─────────────────────────────────────────────────────────\n\ninterface ExecuteCellArgs<TScenario extends Scenario, TArtifact> {\n  slot: { scenario: TScenario; rep: number; cellId: string; cellSeed: number }\n  opts: RunCampaignOptions<TScenario, TArtifact>\n  manifestHash: string\n  resumable: boolean\n  now: () => Date\n  storage: CampaignStorage\n  buildTraceWriter: (cellId: string, dir: string) => CampaignTraceWriter\n  signal: AbortSignal\n  dispatchTimeoutMs?: number\n  costLedger: CostLedgerHandle\n  costPhase: string\n  runAttemptId: string\n}\n\nasync function executeCell<TScenario extends Scenario, TArtifact>(\n  args: ExecuteCellArgs<TScenario, TArtifact>,\n): Promise<{ cell: CampaignCellResult<TArtifact>; artifactsByPath: Record<string, string> }> {\n  const storage = args.storage\n  const cellDir = join(args.opts.runDir, args.slot.cellId.replace(/[^a-zA-Z0-9_-]/g, '_'))\n  storage.ensureDir(cellDir)\n  const stableCostTags = {\n    runDir: args.opts.runDir,\n    cellId: args.slot.cellId,\n    scenarioId: args.slot.scenario.id,\n    rep: String(args.slot.rep),\n  }\n  const costTags = { ...stableCostTags, runAttemptId: args.runAttemptId }\n\n  // Resumability: cache key = (manifestHash, scenarioId, rep)\n  const cachePath = join(cellDir, 'cached-result.json')\n  if (args.resumable) {\n    const cached = readCachedCell<TArtifact>({\n      storage,\n      cachePath,\n      cellId: args.slot.cellId,\n      manifestHash: args.manifestHash,\n    })\n    if (cached.status === 'hit') {\n      enforceDispatchUsage(cached.cell, args.opts.expectUsage ?? 'warn')\n      const cachedHasUsage =\n        cached.cell.costUsd > 0 ||\n        cached.cell.tokenUsage.input > 0 ||\n        cached.cell.tokenUsage.output > 0\n      if (cached.cell.costCallIds === undefined) {\n        if (cachedHasUsage || Object.keys(cached.cell.judgeScores).length > 0) {\n          throw new CostAccountingIncompleteError(\n            `runCampaign: cached cell '${args.slot.cellId}' does not identify its ledger receipts`,\n          )\n        }\n      } else if (\n        !Array.isArray(cached.cell.costCallIds) ||\n        cached.cell.costCallIds.some(\n          (callId) => typeof callId !== 'string' || callId.trim().length === 0,\n        ) ||\n        new Set(cached.cell.costCallIds).size !== cached.cell.costCallIds.length\n      ) {\n        throw new CostAccountingIncompleteError(\n          `runCampaign: cached cell '${args.slot.cellId}' has invalid ledger receipt IDs`,\n        )\n      } else {\n        const restoredCallIds = new Set(\n          args.costLedger.list({ tags: stableCostTags }).map((receipt) => receipt.callId),\n        )\n        const missingCallIds = cached.cell.costCallIds.filter(\n          (callId) => !restoredCallIds.has(callId),\n        )\n        if (missingCallIds.length > 0) {\n          throw new CostAccountingIncompleteError(\n            `runCampaign: cached cell '${args.slot.cellId}' is missing ledger receipt(s): ${missingCallIds.join(', ')}`,\n          )\n        }\n      }\n      return { cell: { ...cached.cell, cached: true }, artifactsByPath: {} }\n    }\n  }\n\n  const startMs = Date.now()\n  const trace = args.buildTraceWriter(args.slot.cellId, cellDir)\n  const artifactsByPath: Record<string, string> = {}\n  const artifacts: CampaignArtifactWriter = {\n    async write(path, content) {\n      const fullPath = join(cellDir, path)\n      storage.ensureDir(join(fullPath, '..'))\n      storage.write(fullPath, content)\n      artifactsByPath[`${args.slot.cellId}/${path}`] = fullPath\n      return fullPath\n    },\n    async writeJson(path, value) {\n      return artifacts.write(path, JSON.stringify(value, null, 2))\n    },\n  }\n  const cost: CampaignCostMeter = {\n    async runPaidCall(input) {\n      const result = await args.costLedger.runPaidCall({\n        ...input,\n        channel: input.channel ?? 'agent',\n        phase: args.costPhase,\n        actor: input.actor,\n        tags: costTags,\n        signal: cellAbort.signal,\n      })\n      if (result.receipt) {\n        trace.span(`cost.${result.receipt.actor}`, { amountUsd: result.receipt.costUsd }).end()\n      }\n      return result\n    },\n  }\n\n  const placement = args.opts.cellPlacement?.({\n    scenario: args.slot.scenario,\n    rep: args.slot.rep,\n  })\n\n  // Per-cell abort signal, chained to the campaign signal. The dispatch sees\n  // THIS signal so a timeout (below) can abort just this cell's in-flight work\n  // without tearing down sibling cells — and a signal-honoring dispatch\n  // releases its open request instead of leaking it past the deadline.\n  const cellAbort = new AbortController()\n  const onCampaignAbort = () => cellAbort.abort((args.signal as { reason?: unknown }).reason)\n  if (args.signal.aborted) cellAbort.abort((args.signal as { reason?: unknown }).reason)\n  else args.signal.addEventListener('abort', onCampaignAbort, { once: true })\n\n  const ctx: DispatchContext = {\n    cellId: args.slot.cellId,\n    rep: args.slot.rep,\n    seed: args.slot.cellSeed,\n    signal: cellAbort.signal,\n    trace,\n    artifacts,\n    cost,\n    placement,\n  }\n\n  let artifact: TArtifact | undefined\n  let errorMessage: string | undefined\n  const timeoutMs = args.dispatchTimeoutMs\n  let timeoutTimer: ReturnType<typeof setTimeout> | undefined\n  try {\n    const dispatched = args.opts.dispatch(args.slot.scenario, ctx)\n    if (timeoutMs !== undefined && timeoutMs > 0) {\n      // A dispatch that never settles (stalled model request, exhausted runtime\n      // resource, a stream that never closes) must NOT hang the cell — and with\n      // it the lane, the campaign, the loop, the CI job — forever. Race it\n      // against the deadline; on timeout, abort the cell and fail it LOUD.\n      artifact = await Promise.race([\n        dispatched,\n        new Promise<never>((_, reject) => {\n          timeoutTimer = setTimeout(() => {\n            cellAbort.abort(new Error('dispatch timeout'))\n            reject(\n              new Error(\n                `dispatch exceeded ${timeoutMs}ms for cell '${args.slot.cellId}' — aborted and failed loud (no silent hang)`,\n              ),\n            )\n          }, timeoutMs)\n          if (typeof (timeoutTimer as { unref?: () => void }).unref === 'function')\n            (timeoutTimer as { unref: () => void }).unref()\n        }),\n      ])\n    } else {\n      artifact = await dispatched\n    }\n  } catch (err) {\n    errorMessage = err instanceof Error ? err.message : String(err)\n  } finally {\n    if (timeoutTimer) clearTimeout(timeoutTimer)\n    args.signal.removeEventListener('abort', onCampaignAbort)\n  }\n\n  const agentReceipts = args.costLedger.list({ channel: 'agent', tags: costTags })\n  const agentCost = args.costLedger.summary({ channel: 'agent', tags: costTags })\n  const tokenUsage: CampaignTokenUsage = {\n    input: agentCost.inputTokens,\n    output: agentCost.outputTokens,\n    ...(agentCost.cachedTokens > 0 ? { cached: agentCost.cachedTokens } : {}),\n  }\n  const resolvedModel = agentReceipts.at(-1)?.model\n  const dispatchResult = {\n    cellId: args.slot.cellId,\n    artifact,\n    error: errorMessage,\n    costUsd: agentCost.totalCostUsd,\n    tokenUsage,\n  }\n  try {\n    enforceDispatchUsage(dispatchResult, args.opts.expectUsage ?? 'warn')\n  } catch (error) {\n    await trace.flush()\n    throw error\n  }\n\n  // Run judges (only if we have an artifact). A judge that throws invalidates\n  // the cell — recorded as `error`, NOT folded into a fake composite:0 (a fake\n  // zero is indistinguishable from a real zero and poisons every aggregate).\n  const judgeScores: Record<string, JudgeScore> = {}\n  if (artifact !== undefined) {\n    for (const judge of args.opts.judges ?? []) {\n      if (judge.appliesTo && !judge.appliesTo(args.slot.scenario)) continue\n      try {\n        const score = await runJudgeCell(judge, {\n          artifact,\n          scenario: args.slot.scenario,\n          signal: args.signal,\n          costLedger: args.costLedger,\n          costPhase: args.costPhase,\n          costTags,\n        })\n        judgeScores[judge.name] = score\n      } catch (err) {\n        if (err instanceof CostAccountingIncompleteError) {\n          await trace.flush()\n          throw err\n        }\n        errorMessage = `judge '${judge.name}' failed: ${err instanceof Error ? err.message : String(err)}`\n        break\n      }\n    }\n  }\n\n  await trace.flush()\n\n  const costCallIds = args.costLedger\n    .list({ tags: costTags })\n    .map((receipt) => receipt.callId)\n    .sort()\n\n  const cell: CampaignCellResult<TArtifact> = {\n    manifestHash: args.manifestHash,\n    cellId: args.slot.cellId,\n    scenarioId: args.slot.scenario.id,\n    rep: args.slot.rep,\n    artifact: (artifact ?? null) as TArtifact,\n    judgeScores,\n    costUsd: agentCost.totalCostUsd,\n    costEstimated: agentReceipts.some(\n      (receipt) => receipt.actualCostUsd === undefined && !receipt.costUnknown,\n    ),\n    costCallIds,\n    tokenUsage,\n    ...(resolvedModel ? { resolvedModel } : {}),\n    durationMs: Date.now() - startMs,\n    seed: args.slot.cellSeed,\n    cached: false,\n    error: errorMessage,\n  }\n\n  if (!errorMessage && args.resumable) {\n    storage.write(cachePath, JSON.stringify(cell))\n  }\n\n  return { cell, artifactsByPath }\n}\n\nexport interface CampaignRunPlanCell {\n  cellId: string\n  scenarioId: string\n  rep: number\n  seed: number\n  cachePath: string\n  status: 'cached' | 'run'\n  reason?: 'missing' | 'manifest-mismatch' | 'cell-mismatch' | 'corrupt' | 'resumable-off'\n}\n\nexport interface CampaignRunPlan {\n  manifestHash: string\n  splitDigest: `sha256:${string}`\n  totalCells: number\n  cellsCached: number\n  cellsToRun: number\n  cells: CampaignRunPlanCell[]\n}\n\nexport interface PlanCampaignRunOptions<TScenario extends Scenario, TArtifact> {\n  scenarios: TScenario[]\n  dispatch?: DispatchFn<TScenario, TArtifact>\n  dispatchRef?: string\n  judges?: JudgeConfig<TArtifact, TScenario>[]\n  seed?: number\n  reps?: number\n  resumable?: boolean\n  runDir: string\n  /** Subject repo for the shared run-dir root (see RunCampaignOptions.repo). */\n  repo?: string\n  storage?: CampaignStorage\n}\n\n/**\n * Plan a campaign WITHOUT dispatching: computes the manifest hash and the per-cell\n * run-vs-cached schedule so callers can preview cost and resumability before spending.\n */\nexport function planCampaignRun<TScenario extends Scenario, TArtifact>(\n  opts: PlanCampaignRunOptions<TScenario, TArtifact>,\n): CampaignRunPlan {\n  const seed = opts.seed ?? 42\n  const reps = opts.reps ?? 1\n  const resumable = opts.resumable ?? true\n  const storage = opts.storage ?? fsCampaignStorage()\n\n  assertCampaignDesign(opts.scenarios, reps)\n\n  if (typeof opts.runDir !== 'string' || opts.runDir.trim().length === 0) {\n    throw new Error('planCampaignRun: runDir is required and must be a non-empty string')\n  }\n  opts.runDir = resolveRunDir(opts.runDir, opts.repo)\n\n  const manifestHash = computeManifestHash({\n    scenarios: opts.scenarios,\n    judges: (opts.judges ?? []) as unknown as JudgeConfig<unknown>[],\n    dispatchRef: dispatchRefFor(opts.dispatch, opts.dispatchRef),\n    seed,\n    reps,\n  })\n  const splitDigest = campaignSplitDigest(opts.scenarios, reps)\n\n  const cells = buildCellSchedule(opts.scenarios, seed, reps).map((slot): CampaignRunPlanCell => {\n    const cachePath = join(\n      opts.runDir,\n      slot.cellId.replace(/[^a-zA-Z0-9_-]/g, '_'),\n      'cached-result.json',\n    )\n    if (!resumable) {\n      return {\n        cellId: slot.cellId,\n        scenarioId: slot.scenario.id,\n        rep: slot.rep,\n        seed: slot.cellSeed,\n        cachePath,\n        status: 'run',\n        reason: 'resumable-off',\n      }\n    }\n\n    const cached = readCachedCell<unknown>({\n      storage,\n      cachePath,\n      cellId: slot.cellId,\n      manifestHash,\n    })\n    if (cached.status === 'hit') {\n      return {\n        cellId: slot.cellId,\n        scenarioId: slot.scenario.id,\n        rep: slot.rep,\n        seed: slot.cellSeed,\n        cachePath,\n        status: 'cached',\n      }\n    }\n\n    return {\n      cellId: slot.cellId,\n      scenarioId: slot.scenario.id,\n      rep: slot.rep,\n      seed: slot.cellSeed,\n      cachePath,\n      status: 'run',\n      reason: cached.reason,\n    }\n  })\n\n  const cellsCached = cells.filter((cell) => cell.status === 'cached').length\n  return {\n    manifestHash,\n    splitDigest,\n    totalCells: cells.length,\n    cellsCached,\n    cellsToRun: cells.length - cellsCached,\n    cells,\n  }\n}\n\n/**\n * Per-dispatch stub guard. An artifact produced with `costUsd === 0` AND zero\n * tokens means the dispatch never called `ctx.cost` —\n * i.e. it ran against a stub or silently dropped its usage. `'warn'` logs it,\n * `'assert'` throws (fail-fast), and `'off'` skips the check.\n */\nfunction enforceDispatchUsage(\n  cell: Pick<\n    CampaignCellResult<unknown>,\n    'cellId' | 'artifact' | 'error' | 'costUsd' | 'tokenUsage'\n  >,\n  mode: 'assert' | 'warn' | 'off',\n): void {\n  if (mode === 'off') return\n  if (cell.artifact === null || cell.artifact === undefined) return\n  const zeroTokens = cell.tokenUsage.input === 0 && cell.tokenUsage.output === 0\n  if (cell.costUsd !== 0 || !zeroTokens) return\n  const msg = `cell '${cell.cellId}' produced an artifact but reported zero cost and zero tokens — the dispatch made no paid call through ctx.cost.runPaidCall (a stub cell)`\n  if (mode === 'assert') {\n    const report: BackendIntegrityReport = {\n      totalRecords: 1,\n      stubRecords: 1,\n      realRecords: 0,\n      uncostedRecords: 0,\n      totalInputTokens: 0,\n      totalOutputTokens: 0,\n      totalCostUsd: 0,\n      verdict: 'stub',\n      diagnosis: msg,\n    }\n    throw new BackendIntegrityError(`expectUsage: ${msg}`, report)\n  }\n  // eslint-disable-next-line no-console\n  console.warn(`[runCampaign] expectUsage: ${msg}`)\n}\n\nasync function runJudgeCell<TArtifact, TScenario extends Scenario>(\n  judge: JudgeConfig<TArtifact, TScenario>,\n  input: Parameters<JudgeConfig<TArtifact, TScenario>['score']>[0],\n): Promise<JudgeScore> {\n  const previousJudgeCalls = new Set(\n    input.costLedger\n      ?.list({ channel: 'judge', tags: input.costTags })\n      .map((receipt) => receipt.callId) ?? [],\n  )\n  try {\n    const score = await judge.score(input)\n    assertReportedJudgeCallRecorded(judge.name, score, input, previousJudgeCalls)\n    return score\n  } catch (error) {\n    assertReportedJudgeCallRecorded(judge.name, error, input, previousJudgeCalls, error)\n    throw error\n  }\n}\n\nfunction assertReportedJudgeCallRecorded(\n  judgeName: string,\n  value: unknown,\n  input: Parameters<JudgeConfig<unknown>['score']>[0],\n  previousCallIds: ReadonlySet<string>,\n  cause?: unknown,\n): void {\n  if (!hasLlmCall(value)) return\n  const recorded = input.costLedger\n    ?.list({ channel: 'judge', tags: input.costTags })\n    .some((receipt) => !previousCallIds.has(receipt.callId))\n  if (recorded) return\n  throw new CostAccountingIncompleteError(\n    `runCampaign: judge '${judgeName}' reported a paid LLM call without a CostLedger receipt`,\n    cause === undefined ? undefined : { cause },\n  )\n}\n\nfunction hasLlmCall(value: unknown): value is { llmCall: unknown } {\n  return (\n    typeof value === 'object' &&\n    value !== null &&\n    'llmCall' in value &&\n    (value as { llmCall?: unknown }).llmCall !== undefined\n  )\n}\n\nfunction defaultBuildTraceWriter(\n  storage: CampaignStorage,\n): (cellId: string, dir: string) => CampaignTraceWriter {\n  return (cellId, dir) => {\n    const spans: Array<Record<string, unknown>> = []\n    return {\n      span(name, attributes) {\n        const startMs = Date.now()\n        const record: Record<string, unknown> = { name, cellId, startMs, ...(attributes ?? {}) }\n        const finish: TraceSpan = {\n          end(endAttrs) {\n            record.durationMs = Date.now() - startMs\n            if (endAttrs) Object.assign(record, endAttrs)\n            spans.push(record)\n          },\n          setAttribute(key, value) {\n            record[key] = value\n          },\n        }\n        return finish\n      },\n      async flush() {\n        storage.write(join(dir, 'spans.jsonl'), spans.map((s) => JSON.stringify(s)).join('\\n'))\n      },\n    }\n  }\n}\n\nfunction buildCellSchedule<TScenario extends Scenario>(\n  scenarios: TScenario[],\n  seed: number,\n  reps: number,\n): Array<{ scenario: TScenario; rep: number; cellId: string; cellSeed: number }> {\n  const schedule: Array<{ scenario: TScenario; rep: number; cellId: string; cellSeed: number }> = []\n  let cellIndex = 0\n  for (const scenario of scenarios) {\n    for (let rep = 0; rep < reps; rep++) {\n      const cellId = `${scenario.id}:${rep}`\n      const cellSeed = seed + cellIndex\n      schedule.push({ scenario, rep, cellId, cellSeed })\n      cellIndex += 1\n    }\n  }\n  return schedule\n}\n\nfunction dispatchRefFor<TScenario extends Scenario, TArtifact>(\n  dispatch: DispatchFn<TScenario, TArtifact> | undefined,\n  override: string | undefined,\n): string {\n  const ref = override ?? dispatch?.name ?? 'anonymous'\n  if (typeof ref !== 'string' || ref.trim().length === 0) {\n    throw new Error('runCampaign: dispatchRef must be a non-empty string when provided')\n  }\n  return ref\n}\n\ntype CacheRead<TArtifact> =\n  | { status: 'hit'; cell: CampaignCellResult<TArtifact> }\n  | { status: 'miss'; reason: 'missing' | 'manifest-mismatch' | 'cell-mismatch' | 'corrupt' }\n\nfunction readCachedCell<TArtifact>(args: {\n  storage: CampaignStorage\n  cachePath: string\n  cellId: string\n  manifestHash: string\n}): CacheRead<TArtifact> {\n  const raw = args.storage.read(args.cachePath)\n  if (raw === undefined) return { status: 'miss', reason: 'missing' }\n\n  try {\n    const cached = JSON.parse(raw) as CampaignCellResult<TArtifact>\n    if (cached.cellId !== args.cellId) return { status: 'miss', reason: 'cell-mismatch' }\n    if (cached.manifestHash !== args.manifestHash) {\n      return { status: 'miss', reason: 'manifest-mismatch' }\n    }\n    return { status: 'hit', cell: cached }\n  } catch {\n    return { status: 'miss', reason: 'corrupt' }\n  }\n}\n\ninterface CaptureArgs<TScenario extends Scenario, TArtifact> {\n  store: LabeledScenarioStore\n  cell: CampaignCellResult<TArtifact>\n  scenario: TScenario\n  opts: RunCampaignOptions<TScenario, TArtifact>\n  now: () => Date\n}\n\nasync function captureToStore<TScenario extends Scenario, TArtifact>(\n  args: CaptureArgs<TScenario, TArtifact>,\n): Promise<void> {\n  await args.store.observe({\n    scenario: args.scenario,\n    artifact: args.cell.artifact,\n    judgeScores: args.cell.judgeScores,\n    source: args.opts.captureSource ?? 'eval-run',\n    sourceVersionHash: args.opts.captureSourceVersionHash ?? 'unknown',\n    capturedAt: args.now().toISOString(),\n    redactionStatus: 'raw',\n  })\n}\n\n// ── Aggregates + manifest hash ────────────────────────────────────────\n\nfunction computeManifestHash(input: {\n  scenarios: Scenario[]\n  judges: JudgeConfig<unknown>[]\n  dispatchRef: string\n  seed: number\n  reps: number\n}): string {\n  return contentHash({\n    scenarios: input.scenarios,\n    judges: input.judges.map((judge) => ({\n      name: judge.name,\n      dims: judge.dimensions,\n      version: judgeVersionFor(judge),\n    })),\n    dispatch: input.dispatchRef,\n    seed: input.seed,\n    reps: input.reps,\n  })\n}\n\nfunction judgeVersionFor(judge: JudgeConfig<unknown>): string {\n  if (judge.judgeVersion !== undefined) {\n    const version = judge.judgeVersion.trim()\n    if (version.length === 0) {\n      throw new Error(`runCampaign: judge '${judge.name}' has an empty judgeVersion`)\n    }\n    return version\n  }\n  return contentHash({\n    score: judge.score.toString(),\n    appliesTo: judge.appliesTo?.toString() ?? null,\n  })\n}\n\nfunction computeAggregates<TArtifact>(\n  cells: CampaignCellResult<TArtifact>[],\n  judges: JudgeConfig<TArtifact>[],\n  seed: number,\n  cost: CostLedgerSummary,\n): CampaignAggregates {\n  const byJudge: Record<string, JudgeAggregate> = {}\n  for (const judge of judges) {\n    const scores: number[] = []\n    for (const cell of cells) {\n      const s = cell.judgeScores[judge.name]\n      if (s !== undefined) scores.push(s.composite)\n    }\n    byJudge[judge.name] = aggregate(scores, seed)\n  }\n  const byScenario: Record<string, ScenarioAggregate> = {}\n  const scenarioGroups = new Map<string, number[]>()\n  for (const cell of cells) {\n    const composites = Object.values(cell.judgeScores).map((s) => s.composite)\n    if (composites.length === 0) continue\n    const mean = composites.reduce((a, b) => a + b, 0) / composites.length\n    const arr = scenarioGroups.get(cell.scenarioId) ?? []\n    arr.push(mean)\n    scenarioGroups.set(cell.scenarioId, arr)\n  }\n  for (const [scenarioId, samples] of scenarioGroups) {\n    const ag = aggregate(samples, seed)\n    byScenario[scenarioId] = { meanComposite: ag.mean, ci95: ag.ci95, n: ag.n }\n  }\n  return {\n    byJudge,\n    byScenario,\n    cost,\n    totalCostUsd: cost.totalCostUsd,\n    cellsExecuted: cells.filter((c) => !c.error).length,\n    cellsSkipped: cells.filter((c) => c.error?.startsWith('skipped:')).length,\n    cellsCached: cells.filter((c) => c.cached).length,\n    cellsFailed: cells.filter((c) => c.error && !c.error.startsWith('skipped:')).length,\n  }\n}\n\n// Percentile bootstrap CI95 via seeded resampling. Deterministic for a given\n// seed — same campaign re-run produces identical CI bands. Falls back to\n// degenerate intervals at n<=1 (the bootstrap is undefined there).\nfunction aggregate(samples: number[], seed: number): JudgeAggregate {\n  const n = samples.length\n  if (n === 0) return { mean: 0, stdev: 0, ci95: [0, 0], n: 0 }\n  const mean = samples.reduce((a, b) => a + b, 0) / n\n  const variance = samples.reduce((a, b) => a + (b - mean) ** 2, 0) / Math.max(1, n - 1)\n  const stdev = Math.sqrt(variance)\n  const ci = confidenceInterval(samples, 0.95, { seed, resamples: 1000 })\n  return { mean, stdev, ci95: [ci.lower, ci.upper], n }\n}\n","/**\n * Backend-integrity guard: distinguish \"agent failed\" from \"eval ran against\n * a stub / unconfigured backend.\" Without this guard a canonical eval can\n * silently report `0/N passed` and look like an agent-quality problem when\n * the LLM was never actually called — the failure mode we just hit running\n * the 4-vertical parallel eval (legal-sandbox-stub returned hard-coded 33-104\n * char strings; gtm/creative defaulted to a cli-bridge that wasn't running).\n *\n * The shape:\n *\n *   const report = summarizeBackendIntegrity(records)\n *   assertRealBackend(records)   // throws BackendIntegrityError if 100% stub\n *\n * A record is \"stub-mode\" if its `tokenUsage.input === 0 && tokenUsage.output === 0`.\n * (`costUsd` alone is unreliable — some backends successfully call LLMs but\n *  don't propagate pricing, producing real tokens with $0 cost.)\n *\n * Verdicts:\n *   - `real`   — at least one record has nonzero token usage\n *   - `stub`   — every record is stub-mode (eval ran blind)\n *   - `mixed`  — some records real, some stub (partial backend failure;\n *                often the 429-cascade or auth-half-failed case)\n */\n\nimport type { CostReceipt } from '../cost-ledger'\nimport { AgentEvalError } from '../errors'\nimport type { RunRecord } from '../run-record'\n\nexport interface BackendIntegrityReport {\n  /** Total records inspected. */\n  totalRecords: number\n  /** Records with input=0 AND output=0 (a stub fingerprint). */\n  stubRecords: number\n  /** Records with nonzero token usage (real LLM activity). */\n  realRecords: number\n  /** Records where output>0 but costUsd=0 (real LLM, broken cost ledger). */\n  uncostedRecords: number\n  /** Sum of input tokens across all records. */\n  totalInputTokens: number\n  /** Sum of output tokens across all records. */\n  totalOutputTokens: number\n  /** Sum of costUsd across all records. */\n  totalCostUsd: number\n  /** Worst-case integrity verdict. */\n  verdict: 'real' | 'mixed' | 'stub'\n  /** Human-readable diagnosis suitable for terminal output. */\n  diagnosis: string\n}\n\n/**\n * Error thrown when an integrity assertion fails. Caller can pattern-match\n * by `code === 'AGENT_EVAL_BACKEND_STUB'` to differentiate from other\n * errors.\n */\nexport class BackendIntegrityError extends AgentEvalError {\n  constructor(\n    message: string,\n    public readonly report: BackendIntegrityReport,\n  ) {\n    super('backend_integrity', message)\n  }\n}\n\n/**\n * Inspect a batch of RunRecords and return an integrity report. Pure\n * function — no I/O, no logging. The caller decides what to do with the\n * verdict (print warning, throw, gate CI, etc.).\n */\nexport function summarizeBackendIntegrity(\n  records: ReadonlyArray<RunRecord>,\n): BackendIntegrityReport {\n  return summarizeBackendUsage(\n    records.map((record) => ({\n      inputTokens: record.tokenUsage.input,\n      outputTokens: record.tokenUsage.output,\n      costUsd: record.costUsd,\n    })),\n  )\n}\n\n/** Inspect settled agent calls from the canonical cost ledger. */\nexport function summarizeAgentReceiptIntegrity(\n  receipts: ReadonlyArray<CostReceipt>,\n): BackendIntegrityReport {\n  return summarizeBackendUsage(\n    receipts\n      .filter((receipt) => receipt.channel === 'agent')\n      .map((receipt) => ({\n        inputTokens: receipt.inputTokens,\n        outputTokens: receipt.outputTokens,\n        costUsd: receipt.costUsd,\n      })),\n  )\n}\n\ninterface BackendUsage {\n  inputTokens: number\n  outputTokens: number\n  costUsd: number\n}\n\nfunction summarizeBackendUsage(records: readonly BackendUsage[]): BackendIntegrityReport {\n  const totalRecords = records.length\n  let stubRecords = 0\n  let realRecords = 0\n  let uncostedRecords = 0\n  let totalInputTokens = 0\n  let totalOutputTokens = 0\n  let totalCostUsd = 0\n  for (const rec of records) {\n    totalInputTokens += rec.inputTokens\n    totalOutputTokens += rec.outputTokens\n    totalCostUsd += rec.costUsd\n    if (rec.inputTokens === 0 && rec.outputTokens === 0) stubRecords++\n    else realRecords++\n    if (rec.outputTokens > 0 && rec.costUsd === 0) uncostedRecords++\n  }\n  const verdict: BackendIntegrityReport['verdict'] =\n    totalRecords === 0\n      ? 'stub'\n      : stubRecords === totalRecords\n        ? 'stub'\n        : stubRecords === 0\n          ? 'real'\n          : 'mixed'\n  const diagnosis = buildDiagnosis({\n    totalRecords,\n    stubRecords,\n    realRecords,\n    uncostedRecords,\n    totalInputTokens,\n    totalOutputTokens,\n    totalCostUsd,\n    verdict,\n  })\n  return {\n    totalRecords,\n    stubRecords,\n    realRecords,\n    uncostedRecords,\n    totalInputTokens,\n    totalOutputTokens,\n    totalCostUsd,\n    verdict,\n    diagnosis,\n  }\n}\n\nfunction buildDiagnosis(r: Omit<BackendIntegrityReport, 'diagnosis'>): string {\n  if (r.totalRecords === 0) {\n    return 'no records — eval produced zero runs; backend likely failed before first turn'\n  }\n  if (r.verdict === 'stub') {\n    return [\n      `all ${r.totalRecords} records have zero token usage — the LLM backend was never called.`,\n      'common causes: --backend sandbox without a sandbox bridge running; stub model returning hard-coded strings;',\n      'auth misconfigured so requests were silently dropped before the LLM. Re-run with --backend tcloud and TANGLE_API_KEY set,',\n      'or boot the cli-bridge / sandbox before invoking the eval.',\n    ].join(' ')\n  }\n  if (r.verdict === 'mixed') {\n    const pct = ((r.stubRecords / r.totalRecords) * 100).toFixed(0)\n    return [\n      `${r.stubRecords}/${r.totalRecords} records (${pct}%) have zero token usage — the backend partially failed.`,\n      'common causes: rate-limit cascade (429s after the first N personas);',\n      'transient auth expiry mid-run; provider outage. Treat the affected records as missing data, not agent failures.',\n    ].join(' ')\n  }\n  // verdict === 'real'\n  if (r.uncostedRecords > 0) {\n    const pct = ((r.uncostedRecords / r.totalRecords) * 100).toFixed(0)\n    return [\n      `${r.totalRecords} records with real LLM activity (in=${r.totalInputTokens}, out=${r.totalOutputTokens} tokens).`,\n      `${r.uncostedRecords} (${pct}%) have output tokens but costUsd=0. Two distinct roots:`,\n      '(a) cost ledger mis-wired — no usage propagation from the runtime stream into RunRecord; or',\n      '(b) the model is unpriced at the source (sandbox/router returned $0 despite real tokens).',\n      'For (b), price the measured tokens against the substrate table (estimateCost) instead of leaving $0.',\n    ].join(' ')\n  }\n  return `${r.totalRecords} records with real LLM activity (in=${r.totalInputTokens}, out=${r.totalOutputTokens} tokens, $${r.totalCostUsd.toFixed(4)}).`\n}\n\n/**\n * Throw BackendIntegrityError if the verdict is 'stub' — i.e. every record\n * shows zero LLM activity. Non-strict callers can pass `{ allowMixed: false }`\n * to also reject mixed verdicts (recommended for CI gates).\n *\n * Real backends pass through silently.\n */\nexport function assertRealBackend(\n  records: ReadonlyArray<RunRecord>,\n  opts: { allowMixed?: boolean } = {},\n): BackendIntegrityReport {\n  const report = summarizeBackendIntegrity(records)\n  return assertBackendReport(report, opts)\n}\n\n/** Reject a cost ledger with no real agent call or a partial stub run. */\nexport function assertRealAgentReceipts(\n  receipts: ReadonlyArray<CostReceipt>,\n  opts: { allowMixed?: boolean } = {},\n): BackendIntegrityReport {\n  const report = summarizeAgentReceiptIntegrity(receipts)\n  return assertBackendReport(report, opts)\n}\n\nfunction assertBackendReport(\n  report: BackendIntegrityReport,\n  opts: { allowMixed?: boolean },\n): BackendIntegrityReport {\n  const allowMixed = opts.allowMixed ?? true\n  if (report.verdict === 'stub') {\n    throw new BackendIntegrityError(\n      `backend-integrity: ran against a stub or unconfigured backend — ${report.diagnosis}`,\n      report,\n    )\n  }\n  if (!allowMixed && report.verdict === 'mixed') {\n    throw new BackendIntegrityError(\n      `backend-integrity: partial backend failure rejected — ${report.diagnosis}`,\n      report,\n    )\n  }\n  return report\n}\n","/**\n * Content-addressed judge-verdict caching.\n *\n * LAW: cache JUDGE VERDICTS only — judging the same artifact with the same\n * judge+rubric is pure. NEVER cache agent rollouts. (A router that cached\n * identical fanout prompts silently destroyed best-of-N diversity; rollout\n * caching reintroduces that failure class. Judging has no diversity to\n * destroy — same artifact + same rubric ⇒ same verdict is the desired\n * property, not a bug.)\n *\n * The cache key is a sha-256 over the canonical JSON of everything that can\n * change a verdict: the artifact content, the scenario id, the judge name,\n * the full dimension list (key + description — the description IS the rubric\n * text shown to the judge), and a caller-supplied `judgeVersion`.\n * `judgeVersion` is REQUIRED: a judge whose prompt/model/ensemble changes\n * without a version bump would otherwise silently serve stale verdicts.\n *\n * Strict canonicalization (`canonicalJson`) throws on undefined / function /\n * symbol / non-finite numbers — an artifact that cannot be unambiguously\n * serialized cannot be content-addressed, and coercing it would let two\n * different artifacts collide on one key.\n */\n\nimport { createHash } from 'node:crypto'\nimport { appendFileSync, existsSync, readFileSync } from 'node:fs'\nimport type { JudgeConfig, JudgeScore, Scenario } from './campaign/types'\n\n// ── canonical JSON + content hash ─────────────────────────────────────────\n\nfunction canonicalizeAt(value: unknown, path: string): string {\n  if (value === null) return 'null'\n  switch (typeof value) {\n    case 'boolean':\n      return value ? 'true' : 'false'\n    case 'number':\n      if (!Number.isFinite(value)) {\n        throw new Error(\n          `canonicalJson: non-finite number (${value}) at ${path} — ambiguity is an error, not a coercion`,\n        )\n      }\n      return JSON.stringify(value)\n    case 'string':\n      return JSON.stringify(value)\n    case 'undefined':\n    case 'function':\n    case 'symbol':\n      throw new Error(\n        `canonicalJson: ${typeof value} at ${path} — ambiguity is an error, not a coercion`,\n      )\n    case 'bigint':\n      throw new Error(`canonicalJson: bigint at ${path} — not representable in JSON`)\n    case 'object':\n      break\n  }\n  const obj = value as Record<string, unknown>\n  // Honor toJSON (Date → ISO string) before structural checks — without it a\n  // Date would canonicalize to '{}' and every timestamp would collide.\n  if (typeof obj.toJSON === 'function') {\n    return canonicalizeAt((obj as { toJSON(): unknown }).toJSON(), path)\n  }\n  if (Array.isArray(obj)) {\n    return `[${obj.map((item, i) => canonicalizeAt(item, `${path}[${i}]`)).join(',')}]`\n  }\n  if (obj instanceof Map || obj instanceof Set) {\n    throw new Error(\n      `canonicalJson: ${obj instanceof Map ? 'Map' : 'Set'} at ${path} — would serialize as '{}'; convert to a plain object/array first`,\n    )\n  }\n  const keys = Object.keys(obj).sort()\n  const parts = keys.map((k) => `${JSON.stringify(k)}:${canonicalizeAt(obj[k], `${path}.${k}`)}`)\n  return `{${parts.join(',')}}`\n}\n\n/**\n * Stable JSON stringify: object keys sorted recursively, so two semantically\n * equal values produce byte-identical output regardless of key insertion\n * order. Throws on undefined / function / symbol / NaN / ±Infinity / bigint /\n * Map / Set — anything JSON.stringify would coerce or drop silently.\n *\n * Distinct from `pre-registration.ts`'s `canonicalize`/`hashJson`, which are\n * permissive (coercion allowed) and async (web-crypto). Use THIS pair when a\n * hash collision or silent coercion would corrupt a cache key or attestation.\n */\nexport function canonicalJson(value: unknown): string {\n  return canonicalizeAt(value, '$')\n}\n\n/** Hex sha-256 over `canonicalJson(value)`. The content address used by the\n *  verdict cache and report attestation. */\nexport function contentHash(value: unknown): string {\n  return createHash('sha256').update(canonicalJson(value)).digest('hex')\n}\n\n// ── store contract ─────────────────────────────────────────────────────────\n\n/** Pluggable verdict store. Sync or async on both legs — `cachedJudge`\n *  awaits the results either way. */\nexport interface VerdictCacheStore {\n  get(key: string): Promise<JudgeScore | undefined> | JudgeScore | undefined\n  set(key: string, score: JudgeScore): Promise<void> | void\n}\n\n/** Process-local Map-backed store. */\nexport function inMemoryVerdictCache(): VerdictCacheStore {\n  const entries = new Map<string, JudgeScore>()\n  return {\n    get: (key) => entries.get(key),\n    set: (key, score) => {\n      entries.set(key, score)\n    },\n  }\n}\n\ninterface VerdictCacheLine {\n  key: string\n  score: JudgeScore\n}\n\nfunction parseCacheLine(line: string, path: string, lineNo: number): VerdictCacheLine {\n  let parsed: unknown\n  try {\n    parsed = JSON.parse(line)\n  } catch (err) {\n    throw new Error(\n      `fileVerdictCache: corrupt JSONL at ${path}:${lineNo} — ${err instanceof Error ? err.message : String(err)}`,\n    )\n  }\n  const rec = parsed as Partial<VerdictCacheLine>\n  if (\n    typeof rec !== 'object' ||\n    rec === null ||\n    typeof rec.key !== 'string' ||\n    typeof rec.score !== 'object' ||\n    rec.score === null ||\n    typeof rec.score.composite !== 'number' ||\n    typeof rec.score.dimensions !== 'object'\n  ) {\n    throw new Error(\n      `fileVerdictCache: invalid record shape at ${path}:${lineNo} — expected {key, score:{dimensions, composite, notes}}`,\n    )\n  }\n  return rec as VerdictCacheLine\n}\n\n/**\n * JSONL-file-backed store: the full file is loaded into an in-memory index at\n * construction; every `set` appends one line synchronously (durable before\n * the verdict is returned). A corrupt or malformed line throws at load with\n * file:line — a skipped line would silently re-judge (cost) or, worse, mask\n * a half-written file that needs operator attention.\n */\nexport function fileVerdictCache(path: string): VerdictCacheStore {\n  const entries = new Map<string, JudgeScore>()\n  if (existsSync(path)) {\n    const lines = readFileSync(path, 'utf8').split('\\n')\n    for (let i = 0; i < lines.length; i++) {\n      const line = lines[i]\n      if (line === undefined || line.trim() === '') continue\n      const rec = parseCacheLine(line, path, i + 1)\n      entries.set(rec.key, rec.score)\n    }\n  }\n  return {\n    get: (key) => entries.get(key),\n    set: (key, score) => {\n      appendFileSync(path, `${JSON.stringify({ key, score })}\\n`, 'utf8')\n      entries.set(key, score)\n    },\n  }\n}\n\n// ── cached judge wrapper ───────────────────────────────────────────────────\n\nexport interface VerdictCacheStats {\n  hits: number\n  misses: number\n}\n\nexport interface CachedJudgeOptions {\n  /** REQUIRED — part of the cache key. Bump on any change to the judge's\n   *  prompt, model, ensemble, or scoring logic; silent judge upgrades must\n   *  never serve stale verdicts. */\n  judgeVersion: string\n}\n\n/** The wrapped judge: same `JudgeConfig` seam, plus hit/miss observability. */\nexport type CachedJudge<TArtifact, TScenario extends Scenario = Scenario> = JudgeConfig<\n  TArtifact,\n  TScenario\n> & {\n  stats(): VerdictCacheStats\n}\n\n/**\n * Wrap a `JudgeConfig` so repeat judgments of the same artifact are served\n * from the store instead of re-invoking `score()`. The wrapper is generic\n * over the judge's own type parameters and preserves `appliesTo` — it is a\n * drop-in replacement anywhere a `JudgeConfig` is accepted.\n *\n * A judge that throws is NOT cached: the error propagates and the next\n * attempt re-judges (caching a failure would pin a transient outage forever).\n */\nexport function cachedJudge<TArtifact, TScenario extends Scenario = Scenario>(\n  judge: JudgeConfig<TArtifact, TScenario>,\n  store: VerdictCacheStore,\n  options: CachedJudgeOptions,\n): CachedJudge<TArtifact, TScenario> {\n  if (typeof options.judgeVersion !== 'string' || options.judgeVersion.trim() === '') {\n    throw new Error('cachedJudge: judgeVersion is required and must be a non-empty string')\n  }\n  const stats: VerdictCacheStats = { hits: 0, misses: 0 }\n  const wrapped: CachedJudge<TArtifact, TScenario> = {\n    name: judge.name,\n    dimensions: judge.dimensions,\n    judgeVersion: options.judgeVersion,\n    async score(input) {\n      const key = contentHash({\n        artifact: canonicalJson(input.artifact),\n        scenarioId: input.scenario.id,\n        judgeName: judge.name,\n        dimensions: judge.dimensions,\n        judgeVersion: options.judgeVersion,\n      })\n      const cached = await store.get(key)\n      if (cached !== undefined) {\n        stats.hits += 1\n        return cached\n      }\n      const score = await judge.score(input)\n      await store.set(key, score)\n      stats.misses += 1\n      return score\n    },\n    stats: () => ({ ...stats }),\n  }\n  if (judge.appliesTo) wrapped.appliesTo = judge.appliesTo\n  return wrapped\n}\n","import { contentHash } from '../verdict-cache'\nimport type { CampaignCellResult, CampaignScenarioIdentity, Scenario } from './types'\n\nexport interface CampaignCoverage {\n  complete: boolean\n  expectedCellIds: string[]\n  scorableCellIds: string[]\n  unscorableCells: Array<{ cellId: string; reason: string }>\n}\n\n/** Reject campaign designs whose denominator cannot be identified exactly. */\nexport function assertCampaignDesign<TScenario extends Scenario>(\n  scenarios: readonly TScenario[],\n  reps: number,\n): void {\n  if (!Number.isSafeInteger(reps) || reps < 1) {\n    throw new Error('campaign design requires reps to be a positive safe integer')\n  }\n  const scenarioIds = new Set<string>()\n  for (const scenario of scenarios) {\n    if (typeof scenario.id !== 'string' || scenario.id.trim().length === 0) {\n      throw new Error('campaign design requires every scenario to have a non-empty id')\n    }\n    if (scenarioIds.has(scenario.id)) {\n      throw new Error(`campaign design contains duplicate scenario id '${scenario.id}'`)\n    }\n    if (typeof scenario.kind !== 'string' || scenario.kind.trim().length === 0) {\n      throw new Error('campaign design requires every scenario to have a non-empty kind')\n    }\n    scenarioIds.add(scenario.id)\n  }\n}\n\n/** Redacted but independently verifiable identity of one complete scenario. */\nexport function campaignScenarioIdentity<TScenario extends Scenario>(\n  scenario: TScenario,\n): CampaignScenarioIdentity & Pick<TScenario, 'id' | 'kind'> {\n  assertCampaignDesign([scenario], 1)\n  return {\n    id: scenario.id,\n    kind: scenario.kind,\n    scenarioDigest: `sha256:${contentHash(scenario)}`,\n  }\n}\n\n/** Canonical split identity reconstructed from redacted scenario identities. */\nexport function campaignSplitDigestFromIdentities(\n  scenarios: readonly CampaignScenarioIdentity[],\n  reps: number,\n): `sha256:${string}` {\n  assertCampaignDesign(scenarios, reps)\n  for (const scenario of scenarios) {\n    if (!/^sha256:[a-f0-9]{64}$/.test(scenario.scenarioDigest)) {\n      throw new Error(`campaign scenario '${scenario.id}' has an invalid digest`)\n    }\n  }\n  return `sha256:${contentHash({\n    schema: 'tangle.campaign-split',\n    scenarios: scenarios.map(({ id, kind, scenarioDigest }) => ({ id, kind, scenarioDigest })),\n    reps,\n  })}`\n}\n\n/** Canonical identity of the exact scenario payloads and replicate count. */\nexport function campaignSplitDigest<TScenario extends Scenario>(\n  scenarios: readonly TScenario[],\n  reps: number,\n): `sha256:${string}` {\n  assertCampaignDesign(scenarios, reps)\n  return campaignSplitDigestFromIdentities(scenarios.map(campaignScenarioIdentity), reps)\n}\n\n/** Refuse a campaign whose retained task identities contradict its split digest. */\nexport function assertCampaignSplitIdentity(\n  scenarios: readonly CampaignScenarioIdentity[],\n  reps: number,\n  splitDigest: string,\n): void {\n  if (campaignSplitDigestFromIdentities(scenarios, reps) !== splitDigest) {\n    throw new Error('campaign split digest does not match its retained scenario identities')\n  }\n}\n\n/** Exact designed-denominator receipt for one campaign. */\nexport function campaignCoverage<TArtifact, TScenario extends Scenario>(\n  cells: readonly CampaignCellResult<TArtifact>[],\n  scenarios: readonly TScenario[],\n  reps: number,\n  requireJudgeScore: boolean,\n): CampaignCoverage {\n  assertCampaignDesign(scenarios, reps)\n  const expectedCellIds = designedCellIds(scenarios, reps)\n  const cellsById = new Map<string, CampaignCellResult<TArtifact>[]>()\n  for (const cell of cells) {\n    const matches = cellsById.get(cell.cellId) ?? []\n    matches.push(cell)\n    cellsById.set(cell.cellId, matches)\n  }\n\n  const scorableCellIds: string[] = []\n  const unscorableCells: Array<{ cellId: string; reason: string }> = []\n  for (const cellId of expectedCellIds) {\n    const matches = cellsById.get(cellId) ?? []\n    if (matches.length === 0) {\n      unscorableCells.push({ cellId, reason: 'missing campaign cell' })\n      continue\n    }\n    if (matches.length > 1) {\n      unscorableCells.push({ cellId, reason: `duplicate campaign cell (${matches.length})` })\n      continue\n    }\n\n    const cell = matches[0]!\n    const scoreEntries = Object.entries(cell.judgeScores)\n    const successfulScores = scoreEntries\n      .map(([, score]) => score)\n      .filter((score) => score.failed !== true && Number.isFinite(score.composite))\n    const nonFiniteScores = scoreEntries.filter(\n      ([, score]) =>\n        score.failed !== true &&\n        (!Number.isFinite(score.composite) ||\n          Object.values(score.dimensions).some((value) => !Number.isFinite(value))),\n    )\n    const reasons: string[] = []\n    if (cell.error) reasons.push(cell.error)\n    if (cell.artifact === null || cell.artifact === undefined) reasons.push('missing artifact')\n    if (!cell.error && requireJudgeScore && successfulScores.length === 0) {\n      reasons.push('no successful finite judge score')\n    }\n    if (scoreEntries.some(([, score]) => score.failed === true)) {\n      reasons.push('judge score marked failed')\n    }\n    if (nonFiniteScores.length > 0) {\n      reasons.push(\n        `non-finite judge score: ${nonFiniteScores\n          .map(([name]) => name)\n          .sort()\n          .join(', ')}`,\n      )\n    }\n\n    if (reasons.length > 0) {\n      unscorableCells.push({ cellId, reason: reasons.join('; ') })\n    } else {\n      scorableCellIds.push(cellId)\n    }\n  }\n\n  const expected = new Set(expectedCellIds)\n  for (const cell of cells) {\n    if (cell.cellId !== `${cell.scenarioId}:${cell.rep}`) {\n      unscorableCells.push({\n        cellId: cell.cellId,\n        reason: 'campaign cell id does not match scenario id and rep',\n      })\n      continue\n    }\n    if (!expected.has(cell.cellId)) {\n      unscorableCells.push({ cellId: cell.cellId, reason: 'unexpected campaign cell' })\n    }\n  }\n\n  return {\n    complete: unscorableCells.length === 0 && scorableCellIds.length === expectedCellIds.length,\n    expectedCellIds,\n    scorableCellIds,\n    unscorableCells,\n  }\n}\n\nexport function formatCoverageFailures(coverage: CampaignCoverage): string {\n  const shown = coverage.unscorableCells\n    .slice(0, 3)\n    .map((cell) => `${cell.cellId}: ${cell.reason}`)\n    .join('; ')\n  const remainder = coverage.unscorableCells.length - Math.min(3, coverage.unscorableCells.length)\n  return remainder > 0 ? `${shown}; +${remainder} more` : shown || 'unknown coverage failure'\n}\n\nfunction designedCellIds<TScenario extends Scenario>(\n  scenarios: readonly TScenario[],\n  reps: number,\n): string[] {\n  const ids: string[] = []\n  for (const scenario of scenarios) {\n    for (let rep = 0; rep < reps; rep++) ids.push(`${scenario.id}:${rep}`)\n  }\n  return ids\n}\n","import { homedir } from 'node:os'\nimport { basename, isAbsolute, join } from 'node:path'\n\n/** The shared, out-of-repo root for campaign/benchmark run bundles. Keeping run\n *  outputs here means they never land in a repo working tree (no per-repo\n *  gitignore, no clutter, no accidental commits). Layout:\n *    ~/.tangle/traces/<repo>/runs/<runName>/\n *  where <repo> disambiguates runs across repos in one place. */\nexport function tangleTracesRoot(): string {\n  return join(homedir(), '.tangle', 'traces')\n}\n\n/** Resolve a campaign `runDir`. An absolute path is honored as-is (the caller\n *  chose an explicit location). A bare name is placed under the shared home root\n *  so bundles never pollute a repo working tree — the default the harness should\n *  compute so callers pass a *name*, not a path. */\nexport function resolveRunDir(runDir: string, repo?: string): string {\n  if (isAbsolute(runDir) || runDir.startsWith('mem://')) return runDir\n  const r = repo && repo.trim().length > 0 ? repo : basename(process.cwd())\n  return join(tangleTracesRoot(), r, 'runs', runDir)\n}\n","import { createRequire } from 'node:module'\nimport { join } from 'node:path'\nimport { CostLedger } from '../cost-ledger'\nimport { appendSearchLedgerLine, tryWithSearchLedgerFileLock } from './search-ledger-file'\n\n/**\n * `CampaignStorage` — the filesystem seam `runCampaign` writes through\n * (run/cell dirs, the resumability cache, per-cell artifacts, trace spans).\n *\n * The default (`fsCampaignStorage`) is the Node filesystem — identical\n * behavior to the inline `node:fs` calls it replaces, so existing CLI\n * consumers are unaffected. `inMemoryCampaignStorage` keeps everything in a\n * `Map`, so the substrate runs in environments WITHOUT a filesystem\n * (Cloudflare Workers, Deno Deploy, other edge runtimes) — the campaign\n * still produces its `CampaignResult` (cells + aggregates) in memory;\n * artifacts/traces simply aren't persisted to disk.\n *\n * Paths are opaque keys to the in-memory adapter — it does not parse them,\n * so the same `join(...)`-built paths work unchanged across both adapters.\n */\nexport interface CampaignStorage {\n  /** Ensure a directory exists (recursive). No-op for in-memory. */\n  ensureDir(dir: string): void\n  /** Does this path exist (as a written file or an ensured dir)? */\n  exists(path: string): boolean\n  /** Read a UTF-8 file; `undefined` when missing or unreadable. */\n  read(path: string): string | undefined\n  /** Write a file (string or bytes). Parent dir is assumed ensured. */\n  write(path: string, content: string | Uint8Array): void\n  /** Append only when the current UTF-8 byte length matches `expectedBytes`.\n   * Returns the new length, or undefined when another writer won. */\n  append?(path: string, content: string, expectedBytes: number): number | undefined\n}\n\n/** Node-filesystem storage — the default. Lazily requires `node:fs` so the\n *  module imports cleanly in non-Node runtimes (where the caller passes\n *  `inMemoryCampaignStorage` instead and never constructs this).\n *\n *  `createRequire(import.meta.url)` is the ESM-native lazy require — a bare\n *  `require` is a ReferenceError under `\"type\": \"module\"`, which is exactly\n *  the shape this package publishes. */\nexport function fsCampaignStorage(): CampaignStorage {\n  const nodeRequire = createRequire(import.meta.url)\n  const { existsSync, mkdirSync, readFileSync, statSync, writeFileSync } = nodeRequire(\n    'node:fs',\n  ) as typeof import('node:fs')\n  return {\n    ensureDir(dir) {\n      if (!existsSync(dir)) mkdirSync(dir, { recursive: true })\n    },\n    exists(path) {\n      return existsSync(path)\n    },\n    read(path) {\n      try {\n        return readFileSync(path, 'utf8')\n      } catch {\n        return undefined\n      }\n    },\n    write(path, content) {\n      writeFileSync(path, content as Uint8Array)\n    },\n    append(path, content, expectedBytes) {\n      const result = tryWithSearchLedgerFileLock(path, () => {\n        let actualBytes = 0\n        try {\n          actualBytes = statSync(path).size\n        } catch (error) {\n          if ((error as NodeJS.ErrnoException).code !== 'ENOENT') throw error\n        }\n        if (actualBytes !== expectedBytes) return undefined\n        appendSearchLedgerLine(path, content)\n        return expectedBytes + Buffer.byteLength(content)\n      })\n      return result.acquired ? result.value : undefined\n    },\n  }\n}\n\n/** In-memory storage for filesystem-less runtimes. Artifacts + trace spans\n *  live in a `Map` for the duration of the run; the `CampaignResult` is\n *  fully populated, but nothing is persisted to disk. */\nexport function inMemoryCampaignStorage(): CampaignStorage {\n  const files = new Map<string, string | Uint8Array>()\n  const dirs = new Set<string>()\n  return {\n    ensureDir(dir) {\n      dirs.add(dir)\n    },\n    exists(path) {\n      return files.has(path) || dirs.has(path)\n    },\n    read(path) {\n      const value = files.get(path)\n      if (value === undefined) return undefined\n      return typeof value === 'string' ? value : new TextDecoder().decode(value)\n    },\n    write(path, content) {\n      files.set(path, content)\n    },\n    append(path, content, expectedBytes) {\n      const current = files.get(path)\n      const currentText =\n        current === undefined\n          ? ''\n          : typeof current === 'string'\n            ? current\n            : new TextDecoder().decode(current)\n      const currentBytes = new TextEncoder().encode(currentText).byteLength\n      if (currentBytes !== expectedBytes) return undefined\n      files.set(path, `${currentText}${content}`)\n      return currentBytes + new TextEncoder().encode(content).byteLength\n    },\n  }\n}\n\n/** Open the durable spend account stored beside a logical run. */\nexport function createRunCostLedger(input: {\n  storage: CampaignStorage\n  runDir: string\n  costCeilingUsd?: number\n}): CostLedger {\n  const path = join(input.runDir, 'cost-ledger.jsonl')\n  input.storage.ensureDir(input.runDir)\n  return new CostLedger({\n    costCeilingUsd: input.costCeilingUsd,\n    persistence: {\n      read: () => {\n        const stored = input.storage.read(path)\n        if (stored === undefined && input.storage.exists(path)) {\n          throw new Error(`CostLedger: cannot read existing event log '${path}'`)\n        }\n        const events = stored ?? ''\n        return {\n          revision: String(new TextEncoder().encode(events).byteLength),\n          events,\n        }\n      },\n      append: (expectedRevision, event) => {\n        const expectedBytes = Number(expectedRevision)\n        if (!Number.isSafeInteger(expectedBytes) || expectedBytes < 0) {\n          throw new Error(`CostLedger: invalid storage revision '${expectedRevision}'`)\n        }\n        if (!input.storage.append) {\n          throw new Error('CostLedger: CampaignStorage.append is required for paid calls')\n        }\n        const next = input.storage.append(path, event, expectedBytes)\n        return next === undefined ? undefined : String(next)\n      },\n    },\n  })\n}\n","/** Filesystem durability and cross-process exclusion for the search ledger. */\n\nimport { randomUUID } from 'node:crypto'\nimport {\n  closeSync,\n  constants,\n  existsSync,\n  fsyncSync,\n  linkSync,\n  mkdirSync,\n  openSync,\n  readFileSync,\n  renameSync,\n  unlinkSync,\n  writeSync,\n} from 'node:fs'\nimport { hostname } from 'node:os'\nimport { dirname } from 'node:path'\nimport { z } from 'zod'\nimport { SearchLedgerIntegrityError } from './search-ledger-errors'\n\nexport function appendSearchLedgerLine(path: string, line: string): void {\n  mkdirSync(dirname(path), { recursive: true })\n  const fd = openSync(path, constants.O_CREAT | constants.O_WRONLY | constants.O_APPEND, 0o600)\n  try {\n    writeAll(fd, Buffer.from(line, 'utf8'))\n    fsyncSync(fd)\n  } finally {\n    closeSync(fd)\n  }\n  fsyncDirectory(dirname(path))\n}\n\nexport function withSearchLedgerFileLock<T>(ledgerPath: string, run: () => T): T {\n  const result = tryWithSearchLedgerFileLock(ledgerPath, run)\n  if (!result.acquired) {\n    throw new SearchLedgerIntegrityError(`search ledger lock is held (${ledgerPath})`)\n  }\n  return result.value\n}\n\nexport type FileLockResult<T> = { acquired: true; value: T } | { acquired: false }\n\nexport function tryWithSearchLedgerFileLock<T>(\n  ledgerPath: string,\n  run: () => T,\n): FileLockResult<T> {\n  mkdirSync(dirname(ledgerPath), { recursive: true })\n  const lockPath = `${ledgerPath}.lock`\n  const owner = acquireLock(lockPath)\n  if (!owner) return { acquired: false }\n  try {\n    return { acquired: true, value: run() }\n  } finally {\n    releaseLock(lockPath, owner)\n  }\n}\n\nfunction writeAll(fd: number, bytes: Buffer): 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 new SearchLedgerIntegrityError('filesystem wrote zero bytes')\n    offset += written\n  }\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\ninterface LockOwner {\n  pid: number\n  host: string\n  nonce: string\n}\n\n/** Create a complete owner inode first, then hard-link it into the fixed lock\n * path. `link` is the atomic compare-and-set; a crash can never leave an empty\n * or partially-written lock owner. */\nfunction acquireLock(lockPath: string): LockOwner | undefined {\n  const owner: LockOwner = { pid: process.pid, host: hostname(), nonce: randomUUID() }\n  const ownerBytes = `${canonicalOwner(owner)}\\n`\n  for (let attempt = 0; attempt < 8; attempt += 1) {\n    const ownerPath = `${lockPath}.${owner.pid}.${owner.nonce}.${attempt}.owner`\n    const fd = openSync(ownerPath, constants.O_CREAT | constants.O_EXCL | constants.O_WRONLY, 0o600)\n    try {\n      writeAll(fd, Buffer.from(ownerBytes, 'utf8'))\n      fsyncSync(fd)\n    } finally {\n      closeSync(fd)\n    }\n\n    try {\n      linkSync(ownerPath, lockPath)\n      unlinkSync(ownerPath)\n      return owner\n    } catch (error) {\n      unlinkIfExists(ownerPath)\n      if ((error as NodeJS.ErrnoException).code !== 'EEXIST') throw error\n    }\n\n    const holder = readOwner(lockPath)\n    if (holder.host !== owner.host || isProcessAlive(holder.pid)) {\n      return undefined\n    }\n\n    const tombstone = `${lockPath}.stale.${owner.nonce}.${attempt}`\n    try {\n      renameSync(lockPath, tombstone)\n      unlinkSync(tombstone)\n    } catch (error) {\n      if ((error as NodeJS.ErrnoException).code !== 'ENOENT') throw error\n    }\n  }\n  throw new SearchLedgerIntegrityError(`could not acquire search ledger lock ${lockPath}`)\n}\n\nfunction releaseLock(lockPath: string, owner: LockOwner): void {\n  if (!existsSync(lockPath)) return\n  const holder = readOwner(lockPath)\n  if (canonicalOwner(holder) !== canonicalOwner(owner)) {\n    throw new SearchLedgerIntegrityError(\n      `search ledger lock owner changed before release (${lockPath})`,\n    )\n  }\n  unlinkSync(lockPath)\n}\n\nfunction readOwner(lockPath: string): LockOwner {\n  let raw: unknown\n  try {\n    raw = JSON.parse(readFileSync(lockPath, 'utf8'))\n  } catch (error) {\n    throw new SearchLedgerIntegrityError(`search ledger lock ${lockPath} is malformed`, {\n      cause: error,\n    })\n  }\n  const parsed = z\n    .object({\n      pid: z.number().int().positive().safe(),\n      host: z.string().trim().min(1),\n      nonce: z.string().trim().min(1),\n    })\n    .strict()\n    .safeParse(raw)\n  if (!parsed.success) {\n    throw new SearchLedgerIntegrityError(\n      `search ledger lock ${lockPath} is malformed: ${parsed.error.issues\n        .map((issue) => `${issue.path.join('.') || '<root>'}: ${issue.message}`)\n        .join('; ')}`,\n    )\n  }\n  return parsed.data\n}\n\nfunction canonicalOwner(owner: LockOwner): string {\n  return JSON.stringify({ host: owner.host, nonce: owner.nonce, pid: owner.pid })\n}\n\nfunction isProcessAlive(pid: number): boolean {\n  try {\n    process.kill(pid, 0)\n    return true\n  } catch (error) {\n    return (error as NodeJS.ErrnoException).code !== 'ESRCH'\n  }\n}\n\nfunction unlinkIfExists(path: string): void {\n  try {\n    unlinkSync(path)\n  } catch (error) {\n    if ((error as NodeJS.ErrnoException).code !== 'ENOENT') throw error\n  }\n}\n","import { ValidationError } from '../errors'\n\nexport class SearchLedgerError extends ValidationError {}\n\nexport class SearchLedgerIntegrityError extends SearchLedgerError {}\n\nexport class SearchLedgerConflictError extends SearchLedgerError {}\n"],"mappings":";;;;;;;;;;;;;AAWA,SAAS,QAAAA,aAAY;;;AC2Cd,IAAM,wBAAN,cAAoC,eAAe;AAAA,EACxD,YACE,SACgB,QAChB;AACA,UAAM,qBAAqB,OAAO;AAFlB;AAAA,EAGlB;AAAA,EAHkB;AAIpB;AAOO,SAAS,0BACd,SACwB;AACxB,SAAO;AAAA,IACL,QAAQ,IAAI,CAAC,YAAY;AAAA,MACvB,aAAa,OAAO,WAAW;AAAA,MAC/B,cAAc,OAAO,WAAW;AAAA,MAChC,SAAS,OAAO;AAAA,IAClB,EAAE;AAAA,EACJ;AACF;AAGO,SAAS,+BACd,UACwB;AACxB,SAAO;AAAA,IACL,SACG,OAAO,CAAC,YAAY,QAAQ,YAAY,OAAO,EAC/C,IAAI,CAAC,aAAa;AAAA,MACjB,aAAa,QAAQ;AAAA,MACrB,cAAc,QAAQ;AAAA,MACtB,SAAS,QAAQ;AAAA,IACnB,EAAE;AAAA,EACN;AACF;AAQA,SAAS,sBAAsB,SAA0D;AACvF,QAAM,eAAe,QAAQ;AAC7B,MAAI,cAAc;AAClB,MAAI,cAAc;AAClB,MAAI,kBAAkB;AACtB,MAAI,mBAAmB;AACvB,MAAI,oBAAoB;AACxB,MAAI,eAAe;AACnB,aAAW,OAAO,SAAS;AACzB,wBAAoB,IAAI;AACxB,yBAAqB,IAAI;AACzB,oBAAgB,IAAI;AACpB,QAAI,IAAI,gBAAgB,KAAK,IAAI,iBAAiB,EAAG;AAAA,QAChD;AACL,QAAI,IAAI,eAAe,KAAK,IAAI,YAAY,EAAG;AAAA,EACjD;AACA,QAAM,UACJ,iBAAiB,IACb,SACA,gBAAgB,eACd,SACA,gBAAgB,IACd,SACA;AACV,QAAM,YAAY,eAAe;AAAA,IAC/B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AACD,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,eAAe,GAAsD;AAC5E,MAAI,EAAE,iBAAiB,GAAG;AACxB,WAAO;AAAA,EACT;AACA,MAAI,EAAE,YAAY,QAAQ;AACxB,WAAO;AAAA,MACL,OAAO,EAAE,YAAY;AAAA,MACrB;AAAA,MACA;AAAA,MACA;AAAA,IACF,EAAE,KAAK,GAAG;AAAA,EACZ;AACA,MAAI,EAAE,YAAY,SAAS;AACzB,UAAM,OAAQ,EAAE,cAAc,EAAE,eAAgB,KAAK,QAAQ,CAAC;AAC9D,WAAO;AAAA,MACL,GAAG,EAAE,WAAW,IAAI,EAAE,YAAY,aAAa,GAAG;AAAA,MAClD;AAAA,MACA;AAAA,IACF,EAAE,KAAK,GAAG;AAAA,EACZ;AAEA,MAAI,EAAE,kBAAkB,GAAG;AACzB,UAAM,OAAQ,EAAE,kBAAkB,EAAE,eAAgB,KAAK,QAAQ,CAAC;AAClE,WAAO;AAAA,MACL,GAAG,EAAE,YAAY,uCAAuC,EAAE,gBAAgB,SAAS,EAAE,iBAAiB;AAAA,MACtG,GAAG,EAAE,eAAe,KAAK,GAAG;AAAA,MAC5B;AAAA,MACA;AAAA,MACA;AAAA,IACF,EAAE,KAAK,GAAG;AAAA,EACZ;AACA,SAAO,GAAG,EAAE,YAAY,uCAAuC,EAAE,gBAAgB,SAAS,EAAE,iBAAiB,aAAa,EAAE,aAAa,QAAQ,CAAC,CAAC;AACrJ;AASO,SAAS,kBACd,SACA,OAAiC,CAAC,GACV;AACxB,QAAM,SAAS,0BAA0B,OAAO;AAChD,SAAO,oBAAoB,QAAQ,IAAI;AACzC;AAGO,SAAS,wBACd,UACA,OAAiC,CAAC,GACV;AACxB,QAAM,SAAS,+BAA+B,QAAQ;AACtD,SAAO,oBAAoB,QAAQ,IAAI;AACzC;AAEA,SAAS,oBACP,QACA,MACwB;AACxB,QAAM,aAAa,KAAK,cAAc;AACtC,MAAI,OAAO,YAAY,QAAQ;AAC7B,UAAM,IAAI;AAAA,MACR,wEAAmE,OAAO,SAAS;AAAA,MACnF;AAAA,IACF;AAAA,EACF;AACA,MAAI,CAAC,cAAc,OAAO,YAAY,SAAS;AAC7C,UAAM,IAAI;AAAA,MACR,8DAAyD,OAAO,SAAS;AAAA,MACzE;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;;;ACzMA,SAAS,kBAAkB;AAC3B,SAAS,gBAAgB,YAAY,oBAAoB;AAKzD,SAAS,eAAe,OAAgB,MAAsB;AAC5D,MAAI,UAAU,KAAM,QAAO;AAC3B,UAAQ,OAAO,OAAO;AAAA,IACpB,KAAK;AACH,aAAO,QAAQ,SAAS;AAAA,IAC1B,KAAK;AACH,UAAI,CAAC,OAAO,SAAS,KAAK,GAAG;AAC3B,cAAM,IAAI;AAAA,UACR,qCAAqC,KAAK,QAAQ,IAAI;AAAA,QACxD;AAAA,MACF;AACA,aAAO,KAAK,UAAU,KAAK;AAAA,IAC7B,KAAK;AACH,aAAO,KAAK,UAAU,KAAK;AAAA,IAC7B,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,YAAM,IAAI;AAAA,QACR,kBAAkB,OAAO,KAAK,OAAO,IAAI;AAAA,MAC3C;AAAA,IACF,KAAK;AACH,YAAM,IAAI,MAAM,4BAA4B,IAAI,mCAA8B;AAAA,IAChF,KAAK;AACH;AAAA,EACJ;AACA,QAAM,MAAM;AAGZ,MAAI,OAAO,IAAI,WAAW,YAAY;AACpC,WAAO,eAAgB,IAA8B,OAAO,GAAG,IAAI;AAAA,EACrE;AACA,MAAI,MAAM,QAAQ,GAAG,GAAG;AACtB,WAAO,IAAI,IAAI,IAAI,CAAC,MAAM,MAAM,eAAe,MAAM,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC;AAAA,EAClF;AACA,MAAI,eAAe,OAAO,eAAe,KAAK;AAC5C,UAAM,IAAI;AAAA,MACR,kBAAkB,eAAe,MAAM,QAAQ,KAAK,OAAO,IAAI;AAAA,IACjE;AAAA,EACF;AACA,QAAM,OAAO,OAAO,KAAK,GAAG,EAAE,KAAK;AACnC,QAAM,QAAQ,KAAK,IAAI,CAAC,MAAM,GAAG,KAAK,UAAU,CAAC,CAAC,IAAI,eAAe,IAAI,CAAC,GAAG,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC,EAAE;AAC9F,SAAO,IAAI,MAAM,KAAK,GAAG,CAAC;AAC5B;AAYO,SAAS,cAAc,OAAwB;AACpD,SAAO,eAAe,OAAO,GAAG;AAClC;AAIO,SAAS,YAAY,OAAwB;AAClD,SAAO,WAAW,QAAQ,EAAE,OAAO,cAAc,KAAK,CAAC,EAAE,OAAO,KAAK;AACvE;AAYO,SAAS,uBAA0C;AACxD,QAAM,UAAU,oBAAI,IAAwB;AAC5C,SAAO;AAAA,IACL,KAAK,CAAC,QAAQ,QAAQ,IAAI,GAAG;AAAA,IAC7B,KAAK,CAAC,KAAK,UAAU;AACnB,cAAQ,IAAI,KAAK,KAAK;AAAA,IACxB;AAAA,EACF;AACF;AAOA,SAAS,eAAe,MAAc,MAAc,QAAkC;AACpF,MAAI;AACJ,MAAI;AACF,aAAS,KAAK,MAAM,IAAI;AAAA,EAC1B,SAAS,KAAK;AACZ,UAAM,IAAI;AAAA,MACR,sCAAsC,IAAI,IAAI,MAAM,WAAM,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,IAC5G;AAAA,EACF;AACA,QAAM,MAAM;AACZ,MACE,OAAO,QAAQ,YACf,QAAQ,QACR,OAAO,IAAI,QAAQ,YACnB,OAAO,IAAI,UAAU,YACrB,IAAI,UAAU,QACd,OAAO,IAAI,MAAM,cAAc,YAC/B,OAAO,IAAI,MAAM,eAAe,UAChC;AACA,UAAM,IAAI;AAAA,MACR,6CAA6C,IAAI,IAAI,MAAM;AAAA,IAC7D;AAAA,EACF;AACA,SAAO;AACT;AASO,SAAS,iBAAiB,MAAiC;AAChE,QAAM,UAAU,oBAAI,IAAwB;AAC5C,MAAI,WAAW,IAAI,GAAG;AACpB,UAAM,QAAQ,aAAa,MAAM,MAAM,EAAE,MAAM,IAAI;AACnD,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,YAAM,OAAO,MAAM,CAAC;AACpB,UAAI,SAAS,UAAa,KAAK,KAAK,MAAM,GAAI;AAC9C,YAAM,MAAM,eAAe,MAAM,MAAM,IAAI,CAAC;AAC5C,cAAQ,IAAI,IAAI,KAAK,IAAI,KAAK;AAAA,IAChC;AAAA,EACF;AACA,SAAO;AAAA,IACL,KAAK,CAAC,QAAQ,QAAQ,IAAI,GAAG;AAAA,IAC7B,KAAK,CAAC,KAAK,UAAU;AACnB,qBAAe,MAAM,GAAG,KAAK,UAAU,EAAE,KAAK,MAAM,CAAC,CAAC;AAAA,GAAM,MAAM;AAClE,cAAQ,IAAI,KAAK,KAAK;AAAA,IACxB;AAAA,EACF;AACF;AAiCO,SAAS,YACd,OACA,OACA,SACmC;AACnC,MAAI,OAAO,QAAQ,iBAAiB,YAAY,QAAQ,aAAa,KAAK,MAAM,IAAI;AAClF,UAAM,IAAI,MAAM,sEAAsE;AAAA,EACxF;AACA,QAAM,QAA2B,EAAE,MAAM,GAAG,QAAQ,EAAE;AACtD,QAAM,UAA6C;AAAA,IACjD,MAAM,MAAM;AAAA,IACZ,YAAY,MAAM;AAAA,IAClB,cAAc,QAAQ;AAAA,IACtB,MAAM,MAAM,OAAO;AACjB,YAAM,MAAM,YAAY;AAAA,QACtB,UAAU,cAAc,MAAM,QAAQ;AAAA,QACtC,YAAY,MAAM,SAAS;AAAA,QAC3B,WAAW,MAAM;AAAA,QACjB,YAAY,MAAM;AAAA,QAClB,cAAc,QAAQ;AAAA,MACxB,CAAC;AACD,YAAM,SAAS,MAAM,MAAM,IAAI,GAAG;AAClC,UAAI,WAAW,QAAW;AACxB,cAAM,QAAQ;AACd,eAAO;AAAA,MACT;AACA,YAAM,QAAQ,MAAM,MAAM,MAAM,KAAK;AACrC,YAAM,MAAM,IAAI,KAAK,KAAK;AAC1B,YAAM,UAAU;AAChB,aAAO;AAAA,IACT;AAAA,IACA,OAAO,OAAO,EAAE,GAAG,MAAM;AAAA,EAC3B;AACA,MAAI,MAAM,UAAW,SAAQ,YAAY,MAAM;AAC/C,SAAO;AACT;;;AClOO,SAAS,qBACd,WACA,MACM;AACN,MAAI,CAAC,OAAO,cAAc,IAAI,KAAK,OAAO,GAAG;AAC3C,UAAM,IAAI,MAAM,6DAA6D;AAAA,EAC/E;AACA,QAAM,cAAc,oBAAI,IAAY;AACpC,aAAW,YAAY,WAAW;AAChC,QAAI,OAAO,SAAS,OAAO,YAAY,SAAS,GAAG,KAAK,EAAE,WAAW,GAAG;AACtE,YAAM,IAAI,MAAM,gEAAgE;AAAA,IAClF;AACA,QAAI,YAAY,IAAI,SAAS,EAAE,GAAG;AAChC,YAAM,IAAI,MAAM,mDAAmD,SAAS,EAAE,GAAG;AAAA,IACnF;AACA,QAAI,OAAO,SAAS,SAAS,YAAY,SAAS,KAAK,KAAK,EAAE,WAAW,GAAG;AAC1E,YAAM,IAAI,MAAM,kEAAkE;AAAA,IACpF;AACA,gBAAY,IAAI,SAAS,EAAE;AAAA,EAC7B;AACF;AAGO,SAAS,yBACd,UAC2D;AAC3D,uBAAqB,CAAC,QAAQ,GAAG,CAAC;AAClC,SAAO;AAAA,IACL,IAAI,SAAS;AAAA,IACb,MAAM,SAAS;AAAA,IACf,gBAAgB,UAAU,YAAY,QAAQ,CAAC;AAAA,EACjD;AACF;AAGO,SAAS,kCACd,WACA,MACoB;AACpB,uBAAqB,WAAW,IAAI;AACpC,aAAW,YAAY,WAAW;AAChC,QAAI,CAAC,wBAAwB,KAAK,SAAS,cAAc,GAAG;AAC1D,YAAM,IAAI,MAAM,sBAAsB,SAAS,EAAE,yBAAyB;AAAA,IAC5E;AAAA,EACF;AACA,SAAO,UAAU,YAAY;AAAA,IAC3B,QAAQ;AAAA,IACR,WAAW,UAAU,IAAI,CAAC,EAAE,IAAI,MAAM,eAAe,OAAO,EAAE,IAAI,MAAM,eAAe,EAAE;AAAA,IACzF;AAAA,EACF,CAAC,CAAC;AACJ;AAGO,SAAS,oBACd,WACA,MACoB;AACpB,uBAAqB,WAAW,IAAI;AACpC,SAAO,kCAAkC,UAAU,IAAI,wBAAwB,GAAG,IAAI;AACxF;AAGO,SAAS,4BACd,WACA,MACA,aACM;AACN,MAAI,kCAAkC,WAAW,IAAI,MAAM,aAAa;AACtE,UAAM,IAAI,MAAM,uEAAuE;AAAA,EACzF;AACF;AAGO,SAAS,iBACd,OACA,WACA,MACA,mBACkB;AAClB,uBAAqB,WAAW,IAAI;AACpC,QAAM,kBAAkB,gBAAgB,WAAW,IAAI;AACvD,QAAM,YAAY,oBAAI,IAA6C;AACnE,aAAW,QAAQ,OAAO;AACxB,UAAM,UAAU,UAAU,IAAI,KAAK,MAAM,KAAK,CAAC;AAC/C,YAAQ,KAAK,IAAI;AACjB,cAAU,IAAI,KAAK,QAAQ,OAAO;AAAA,EACpC;AAEA,QAAM,kBAA4B,CAAC;AACnC,QAAM,kBAA6D,CAAC;AACpE,aAAW,UAAU,iBAAiB;AACpC,UAAM,UAAU,UAAU,IAAI,MAAM,KAAK,CAAC;AAC1C,QAAI,QAAQ,WAAW,GAAG;AACxB,sBAAgB,KAAK,EAAE,QAAQ,QAAQ,wBAAwB,CAAC;AAChE;AAAA,IACF;AACA,QAAI,QAAQ,SAAS,GAAG;AACtB,sBAAgB,KAAK,EAAE,QAAQ,QAAQ,4BAA4B,QAAQ,MAAM,IAAI,CAAC;AACtF;AAAA,IACF;AAEA,UAAM,OAAO,QAAQ,CAAC;AACtB,UAAM,eAAe,OAAO,QAAQ,KAAK,WAAW;AACpD,UAAM,mBAAmB,aACtB,IAAI,CAAC,CAAC,EAAE,KAAK,MAAM,KAAK,EACxB,OAAO,CAAC,UAAU,MAAM,WAAW,QAAQ,OAAO,SAAS,MAAM,SAAS,CAAC;AAC9E,UAAM,kBAAkB,aAAa;AAAA,MACnC,CAAC,CAAC,EAAE,KAAK,MACP,MAAM,WAAW,SAChB,CAAC,OAAO,SAAS,MAAM,SAAS,KAC/B,OAAO,OAAO,MAAM,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,OAAO,SAAS,KAAK,CAAC;AAAA,IAC7E;AACA,UAAM,UAAoB,CAAC;AAC3B,QAAI,KAAK,MAAO,SAAQ,KAAK,KAAK,KAAK;AACvC,QAAI,KAAK,aAAa,QAAQ,KAAK,aAAa,OAAW,SAAQ,KAAK,kBAAkB;AAC1F,QAAI,CAAC,KAAK,SAAS,qBAAqB,iBAAiB,WAAW,GAAG;AACrE,cAAQ,KAAK,kCAAkC;AAAA,IACjD;AACA,QAAI,aAAa,KAAK,CAAC,CAAC,EAAE,KAAK,MAAM,MAAM,WAAW,IAAI,GAAG;AAC3D,cAAQ,KAAK,2BAA2B;AAAA,IAC1C;AACA,QAAI,gBAAgB,SAAS,GAAG;AAC9B,cAAQ;AAAA,QACN,2BAA2B,gBACxB,IAAI,CAAC,CAAC,IAAI,MAAM,IAAI,EACpB,KAAK,EACL,KAAK,IAAI,CAAC;AAAA,MACf;AAAA,IACF;AAEA,QAAI,QAAQ,SAAS,GAAG;AACtB,sBAAgB,KAAK,EAAE,QAAQ,QAAQ,QAAQ,KAAK,IAAI,EAAE,CAAC;AAAA,IAC7D,OAAO;AACL,sBAAgB,KAAK,MAAM;AAAA,IAC7B;AAAA,EACF;AAEA,QAAM,WAAW,IAAI,IAAI,eAAe;AACxC,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,WAAW,GAAG,KAAK,UAAU,IAAI,KAAK,GAAG,IAAI;AACpD,sBAAgB,KAAK;AAAA,QACnB,QAAQ,KAAK;AAAA,QACb,QAAQ;AAAA,MACV,CAAC;AACD;AAAA,IACF;AACA,QAAI,CAAC,SAAS,IAAI,KAAK,MAAM,GAAG;AAC9B,sBAAgB,KAAK,EAAE,QAAQ,KAAK,QAAQ,QAAQ,2BAA2B,CAAC;AAAA,IAClF;AAAA,EACF;AAEA,SAAO;AAAA,IACL,UAAU,gBAAgB,WAAW,KAAK,gBAAgB,WAAW,gBAAgB;AAAA,IACrF;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEO,SAAS,uBAAuB,UAAoC;AACzE,QAAM,QAAQ,SAAS,gBACpB,MAAM,GAAG,CAAC,EACV,IAAI,CAAC,SAAS,GAAG,KAAK,MAAM,KAAK,KAAK,MAAM,EAAE,EAC9C,KAAK,IAAI;AACZ,QAAM,YAAY,SAAS,gBAAgB,SAAS,KAAK,IAAI,GAAG,SAAS,gBAAgB,MAAM;AAC/F,SAAO,YAAY,IAAI,GAAG,KAAK,MAAM,SAAS,UAAU,SAAS;AACnE;AAEA,SAAS,gBACP,WACA,MACU;AACV,QAAM,MAAgB,CAAC;AACvB,aAAW,YAAY,WAAW;AAChC,aAAS,MAAM,GAAG,MAAM,MAAM,MAAO,KAAI,KAAK,GAAG,SAAS,EAAE,IAAI,GAAG,EAAE;AAAA,EACvE;AACA,SAAO;AACT;;;AC5LA,SAAS,eAAe;AACxB,SAAS,UAAU,YAAY,YAAY;AAOpC,SAAS,mBAA2B;AACzC,SAAO,KAAK,QAAQ,GAAG,WAAW,QAAQ;AAC5C;AAMO,SAAS,cAAc,QAAgB,MAAuB;AACnE,MAAI,WAAW,MAAM,KAAK,OAAO,WAAW,QAAQ,EAAG,QAAO;AAC9D,QAAM,IAAI,QAAQ,KAAK,KAAK,EAAE,SAAS,IAAI,OAAO,SAAS,QAAQ,IAAI,CAAC;AACxE,SAAO,KAAK,iBAAiB,GAAG,GAAG,QAAQ,MAAM;AACnD;;;ACpBA,SAAS,qBAAqB;AAC9B,SAAS,QAAAC,aAAY;;;ACCrB,SAAS,kBAAkB;AAC3B;AAAA,EACE;AAAA,EACA;AAAA,EACA,cAAAC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,gBAAAC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP,SAAS,gBAAgB;AACzB,SAAS,eAAe;AACxB,SAAS,SAAS;;;AChBX,IAAM,oBAAN,cAAgC,gBAAgB;AAAC;AAEjD,IAAM,6BAAN,cAAyC,kBAAkB;AAAC;AAE5D,IAAM,4BAAN,cAAwC,kBAAkB;AAAC;;;ADe3D,SAAS,uBAAuB,MAAc,MAAoB;AACvE,YAAU,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC5C,QAAM,KAAK,SAAS,MAAM,UAAU,UAAU,UAAU,WAAW,UAAU,UAAU,GAAK;AAC5F,MAAI;AACF,aAAS,IAAI,OAAO,KAAK,MAAM,MAAM,CAAC;AACtC,cAAU,EAAE;AAAA,EACd,UAAE;AACA,cAAU,EAAE;AAAA,EACd;AACA,iBAAe,QAAQ,IAAI,CAAC;AAC9B;AAEO,SAAS,yBAA4B,YAAoB,KAAiB;AAC/E,QAAM,SAAS,4BAA4B,YAAY,GAAG;AAC1D,MAAI,CAAC,OAAO,UAAU;AACpB,UAAM,IAAI,2BAA2B,+BAA+B,UAAU,GAAG;AAAA,EACnF;AACA,SAAO,OAAO;AAChB;AAIO,SAAS,4BACd,YACA,KACmB;AACnB,YAAU,QAAQ,UAAU,GAAG,EAAE,WAAW,KAAK,CAAC;AAClD,QAAM,WAAW,GAAG,UAAU;AAC9B,QAAM,QAAQ,YAAY,QAAQ;AAClC,MAAI,CAAC,MAAO,QAAO,EAAE,UAAU,MAAM;AACrC,MAAI;AACF,WAAO,EAAE,UAAU,MAAM,OAAO,IAAI,EAAE;AAAA,EACxC,UAAE;AACA,gBAAY,UAAU,KAAK;AAAA,EAC7B;AACF;AAEA,SAAS,SAAS,IAAY,OAAqB;AACjD,MAAI,SAAS;AACb,SAAO,SAAS,MAAM,YAAY;AAChC,UAAM,UAAU,UAAU,IAAI,OAAO,QAAQ,MAAM,aAAa,MAAM;AACtE,QAAI,WAAW,EAAG,OAAM,IAAI,2BAA2B,6BAA6B;AACpF,cAAU;AAAA,EACZ;AACF;AAEA,SAAS,eAAe,MAAoB;AAC1C,QAAM,KAAK,SAAS,MAAM,UAAU,QAAQ;AAC5C,MAAI;AACF,cAAU,EAAE;AAAA,EACd,UAAE;AACA,cAAU,EAAE;AAAA,EACd;AACF;AAWA,SAAS,YAAY,UAAyC;AAC5D,QAAM,QAAmB,EAAE,KAAK,QAAQ,KAAK,MAAM,SAAS,GAAG,OAAO,WAAW,EAAE;AACnF,QAAM,aAAa,GAAG,eAAe,KAAK,CAAC;AAAA;AAC3C,WAAS,UAAU,GAAG,UAAU,GAAG,WAAW,GAAG;AAC/C,UAAM,YAAY,GAAG,QAAQ,IAAI,MAAM,GAAG,IAAI,MAAM,KAAK,IAAI,OAAO;AACpE,UAAM,KAAK,SAAS,WAAW,UAAU,UAAU,UAAU,SAAS,UAAU,UAAU,GAAK;AAC/F,QAAI;AACF,eAAS,IAAI,OAAO,KAAK,YAAY,MAAM,CAAC;AAC5C,gBAAU,EAAE;AAAA,IACd,UAAE;AACA,gBAAU,EAAE;AAAA,IACd;AAEA,QAAI;AACF,eAAS,WAAW,QAAQ;AAC5B,iBAAW,SAAS;AACpB,aAAO;AAAA,IACT,SAAS,OAAO;AACd,qBAAe,SAAS;AACxB,UAAK,MAAgC,SAAS,SAAU,OAAM;AAAA,IAChE;AAEA,UAAM,SAAS,UAAU,QAAQ;AACjC,QAAI,OAAO,SAAS,MAAM,QAAQ,eAAe,OAAO,GAAG,GAAG;AAC5D,aAAO;AAAA,IACT;AAEA,UAAM,YAAY,GAAG,QAAQ,UAAU,MAAM,KAAK,IAAI,OAAO;AAC7D,QAAI;AACF,iBAAW,UAAU,SAAS;AAC9B,iBAAW,SAAS;AAAA,IACtB,SAAS,OAAO;AACd,UAAK,MAAgC,SAAS,SAAU,OAAM;AAAA,IAChE;AAAA,EACF;AACA,QAAM,IAAI,2BAA2B,wCAAwC,QAAQ,EAAE;AACzF;AAEA,SAAS,YAAY,UAAkB,OAAwB;AAC7D,MAAI,CAACC,YAAW,QAAQ,EAAG;AAC3B,QAAM,SAAS,UAAU,QAAQ;AACjC,MAAI,eAAe,MAAM,MAAM,eAAe,KAAK,GAAG;AACpD,UAAM,IAAI;AAAA,MACR,oDAAoD,QAAQ;AAAA,IAC9D;AAAA,EACF;AACA,aAAW,QAAQ;AACrB;AAEA,SAAS,UAAU,UAA6B;AAC9C,MAAI;AACJ,MAAI;AACF,UAAM,KAAK,MAAMC,cAAa,UAAU,MAAM,CAAC;AAAA,EACjD,SAAS,OAAO;AACd,UAAM,IAAI,2BAA2B,sBAAsB,QAAQ,iBAAiB;AAAA,MAClF,OAAO;AAAA,IACT,CAAC;AAAA,EACH;AACA,QAAM,SAAS,EACZ,OAAO;AAAA,IACN,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK;AAAA,IACtC,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC;AAAA,IAC7B,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC;AAAA,EAChC,CAAC,EACA,OAAO,EACP,UAAU,GAAG;AAChB,MAAI,CAAC,OAAO,SAAS;AACnB,UAAM,IAAI;AAAA,MACR,sBAAsB,QAAQ,kBAAkB,OAAO,MAAM,OAC1D,IAAI,CAAC,UAAU,GAAG,MAAM,KAAK,KAAK,GAAG,KAAK,QAAQ,KAAK,MAAM,OAAO,EAAE,EACtE,KAAK,IAAI,CAAC;AAAA,IACf;AAAA,EACF;AACA,SAAO,OAAO;AAChB;AAEA,SAAS,eAAe,OAA0B;AAChD,SAAO,KAAK,UAAU,EAAE,MAAM,MAAM,MAAM,OAAO,MAAM,OAAO,KAAK,MAAM,IAAI,CAAC;AAChF;AAEA,SAAS,eAAe,KAAsB;AAC5C,MAAI;AACF,YAAQ,KAAK,KAAK,CAAC;AACnB,WAAO;AAAA,EACT,SAAS,OAAO;AACd,WAAQ,MAAgC,SAAS;AAAA,EACnD;AACF;AAEA,SAAS,eAAe,MAAoB;AAC1C,MAAI;AACF,eAAW,IAAI;AAAA,EACjB,SAAS,OAAO;AACd,QAAK,MAAgC,SAAS,SAAU,OAAM;AAAA,EAChE;AACF;;;AD3IO,SAAS,oBAAqC;AACnD,QAAM,cAAc,cAAc,YAAY,GAAG;AACjD,QAAM,EAAE,YAAAC,aAAY,WAAAC,YAAW,cAAAC,eAAc,UAAU,cAAc,IAAI;AAAA,IACvE;AAAA,EACF;AACA,SAAO;AAAA,IACL,UAAU,KAAK;AACb,UAAI,CAACF,YAAW,GAAG,EAAG,CAAAC,WAAU,KAAK,EAAE,WAAW,KAAK,CAAC;AAAA,IAC1D;AAAA,IACA,OAAO,MAAM;AACX,aAAOD,YAAW,IAAI;AAAA,IACxB;AAAA,IACA,KAAK,MAAM;AACT,UAAI;AACF,eAAOE,cAAa,MAAM,MAAM;AAAA,MAClC,QAAQ;AACN,eAAO;AAAA,MACT;AAAA,IACF;AAAA,IACA,MAAM,MAAM,SAAS;AACnB,oBAAc,MAAM,OAAqB;AAAA,IAC3C;AAAA,IACA,OAAO,MAAM,SAAS,eAAe;AACnC,YAAM,SAAS,4BAA4B,MAAM,MAAM;AACrD,YAAI,cAAc;AAClB,YAAI;AACF,wBAAc,SAAS,IAAI,EAAE;AAAA,QAC/B,SAAS,OAAO;AACd,cAAK,MAAgC,SAAS,SAAU,OAAM;AAAA,QAChE;AACA,YAAI,gBAAgB,cAAe,QAAO;AAC1C,+BAAuB,MAAM,OAAO;AACpC,eAAO,gBAAgB,OAAO,WAAW,OAAO;AAAA,MAClD,CAAC;AACD,aAAO,OAAO,WAAW,OAAO,QAAQ;AAAA,IAC1C;AAAA,EACF;AACF;AAKO,SAAS,0BAA2C;AACzD,QAAM,QAAQ,oBAAI,IAAiC;AACnD,QAAM,OAAO,oBAAI,IAAY;AAC7B,SAAO;AAAA,IACL,UAAU,KAAK;AACb,WAAK,IAAI,GAAG;AAAA,IACd;AAAA,IACA,OAAO,MAAM;AACX,aAAO,MAAM,IAAI,IAAI,KAAK,KAAK,IAAI,IAAI;AAAA,IACzC;AAAA,IACA,KAAK,MAAM;AACT,YAAM,QAAQ,MAAM,IAAI,IAAI;AAC5B,UAAI,UAAU,OAAW,QAAO;AAChC,aAAO,OAAO,UAAU,WAAW,QAAQ,IAAI,YAAY,EAAE,OAAO,KAAK;AAAA,IAC3E;AAAA,IACA,MAAM,MAAM,SAAS;AACnB,YAAM,IAAI,MAAM,OAAO;AAAA,IACzB;AAAA,IACA,OAAO,MAAM,SAAS,eAAe;AACnC,YAAM,UAAU,MAAM,IAAI,IAAI;AAC9B,YAAM,cACJ,YAAY,SACR,KACA,OAAO,YAAY,WACjB,UACA,IAAI,YAAY,EAAE,OAAO,OAAO;AACxC,YAAM,eAAe,IAAI,YAAY,EAAE,OAAO,WAAW,EAAE;AAC3D,UAAI,iBAAiB,cAAe,QAAO;AAC3C,YAAM,IAAI,MAAM,GAAG,WAAW,GAAG,OAAO,EAAE;AAC1C,aAAO,eAAe,IAAI,YAAY,EAAE,OAAO,OAAO,EAAE;AAAA,IAC1D;AAAA,EACF;AACF;AAGO,SAAS,oBAAoB,OAIrB;AACb,QAAM,OAAOC,MAAK,MAAM,QAAQ,mBAAmB;AACnD,QAAM,QAAQ,UAAU,MAAM,MAAM;AACpC,SAAO,IAAI,WAAW;AAAA,IACpB,gBAAgB,MAAM;AAAA,IACtB,aAAa;AAAA,MACX,MAAM,MAAM;AACV,cAAM,SAAS,MAAM,QAAQ,KAAK,IAAI;AACtC,YAAI,WAAW,UAAa,MAAM,QAAQ,OAAO,IAAI,GAAG;AACtD,gBAAM,IAAI,MAAM,+CAA+C,IAAI,GAAG;AAAA,QACxE;AACA,cAAM,SAAS,UAAU;AACzB,eAAO;AAAA,UACL,UAAU,OAAO,IAAI,YAAY,EAAE,OAAO,MAAM,EAAE,UAAU;AAAA,UAC5D;AAAA,QACF;AAAA,MACF;AAAA,MACA,QAAQ,CAAC,kBAAkB,UAAU;AACnC,cAAM,gBAAgB,OAAO,gBAAgB;AAC7C,YAAI,CAAC,OAAO,cAAc,aAAa,KAAK,gBAAgB,GAAG;AAC7D,gBAAM,IAAI,MAAM,yCAAyC,gBAAgB,GAAG;AAAA,QAC9E;AACA,YAAI,CAAC,MAAM,QAAQ,QAAQ;AACzB,gBAAM,IAAI,MAAM,+DAA+D;AAAA,QACjF;AACA,cAAM,OAAO,MAAM,QAAQ,OAAO,MAAM,OAAO,aAAa;AAC5D,eAAO,SAAS,SAAY,SAAY,OAAO,IAAI;AAAA,MACrD;AAAA,IACF;AAAA,EACF,CAAC;AACH;;;ALdA,eAAsB,YACpB,MAC+C;AAC/C,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,YAAY,KAAK,aAAa;AACpC,QAAM,MAAM,KAAK,QAAQ,MAAM,oBAAI,KAAK;AACxC,QAAM,SAAS,KAAK,UAAU,CAAC;AAC/B,QAAM,UAAU,KAAK,WAAW,kBAAkB;AAClD,QAAM,YAAY,KAAK,aAAa;AAEpC,uBAAqB,KAAK,WAAW,IAAI;AAEzC,MAAI,OAAO,KAAK,WAAW,YAAY,KAAK,OAAO,KAAK,EAAE,WAAW,GAAG;AACtE,UAAM,IAAI,MAAM,gEAAgE;AAAA,EAClF;AACA,OAAK,SAAS,cAAc,KAAK,QAAQ,KAAK,IAAI;AAClD,UAAQ,UAAU,KAAK,MAAM;AAC7B,QAAM,aACJ,KAAK,cACL,oBAAoB;AAAA,IAClB;AAAA,IACA,QAAQ,KAAK;AAAA,IACb,gBAAgB,KAAK;AAAA,EACvB,CAAC;AACH,MAAI,KAAK,gBAAgB,UAAa,WAAW,mBAAmB,KAAK,aAAa;AACpF,UAAM,IAAI,MAAM,mEAAmE;AAAA,EACrF;AACA,QAAM,iBAAiB,KAAK,kBAAkB;AAE9C,QAAM,eAAe,oBAAoB;AAAA,IACvC,WAAW,KAAK;AAAA,IAChB;AAAA,IACA,aAAa,eAAe,KAAK,UAAU,KAAK,WAAW;AAAA,IAC3D;AAAA,IACA;AAAA,EACF,CAAC;AACD,QAAM,cAAc,oBAAoB,KAAK,WAAW,IAAI;AAE5D,QAAM,YAAY,IAAI;AACtB,QAAM,eAAe,WAAW,OAAO,WAAW;AAClD,QAAM,QAAyC,CAAC;AAChD,QAAM,kBAA0C,CAAC;AAGjD,QAAM,WAAW,kBAAkB,KAAK,WAAW,MAAM,IAAI;AAG7D,QAAM,kBAAkB,IAAI,gBAAgB;AAI5C,QAAM,QAAyB,CAAC;AAChC,MAAI,UAAU;AACd,QAAM,WAAW;AAEjB,WAAS,IAAI,GAAG,IAAI,gBAAgB,KAAK;AACvC,UAAM;AAAA,OACH,YAAY;AACX,eAAO,MAAM;AACX,gBAAM,QAAQ;AACd,cAAI,SAAS,SAAS,OAAQ;AAC9B,gBAAM,OAAO,SAAS,KAAK;AAC3B,gBAAM,SAAS,MAAM,YAAY;AAAA,YAC/B;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA,kBAAkB,KAAK,oBAAoB,wBAAwB,OAAO;AAAA,YAC1E,QAAQ,gBAAgB;AAAA,YACxB,mBAAmB,KAAK;AAAA,YACxB;AAAA,YACA;AAAA,YACA;AAAA,UACF,CAAC;AACD,mBAAS,KAAK,OAAO,IAAI;AACzB,iBAAO,OAAO,iBAAiB,OAAO,eAAe;AAErD,cAAI,KAAK,gBAAgB,KAAK,iBAAiB,SAAS,CAAC,OAAO,KAAK,OAAO;AAC1E,kBAAM,eAAe;AAAA,cACnB,OAAO,KAAK;AAAA,cACZ,MAAM,OAAO;AAAA,cACb,UAAU,KAAK;AAAA,cACf;AAAA,cACA;AAAA,YACF,CAAC,EAAE,MAAM,CAAC,QAAQ;AAGhB,sBAAQ;AAAA,gBACN,oCAAoC,OAAO,KAAK,MAAM,KAAK,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,cAC7G;AAAA,YACF,CAAC;AAAA,UACH;AAAA,QACF;AAAA,MACF,GAAG;AAAA,IACL;AAAA,EACF;AACA,QAAM,QAAQ,IAAI,KAAK;AAEvB,QAAM,UAAU,IAAI;AACpB,WAAS,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,cAAc,EAAE,MAAM,CAAC;AAExD,QAAM,eAAe,WAAW,QAAQ,EAAE,MAAM,EAAE,QAAQ,KAAK,OAAO,EAAE,CAAC;AACzE,QAAM,aAAa;AAAA,IACjB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,WAAW,UAAU,YAAY;AAAA,IACjC,SAAS,QAAQ,YAAY;AAAA,IAC7B,YAAY,QAAQ,QAAQ,IAAI,UAAU,QAAQ;AAAA,IAClD,OAAO;AAAA,IACP;AAAA,IACA,QAAQ,KAAK;AAAA,IACb;AAAA,IACA,WAAW,KAAK,UAAU,IAAI,wBAAwB;AAAA,EACxD;AACF;AAmBA,eAAe,YACb,MAC2F;AAC3F,QAAM,UAAU,KAAK;AACrB,QAAM,UAAUC,MAAK,KAAK,KAAK,QAAQ,KAAK,KAAK,OAAO,QAAQ,mBAAmB,GAAG,CAAC;AACvF,UAAQ,UAAU,OAAO;AACzB,QAAM,iBAAiB;AAAA,IACrB,QAAQ,KAAK,KAAK;AAAA,IAClB,QAAQ,KAAK,KAAK;AAAA,IAClB,YAAY,KAAK,KAAK,SAAS;AAAA,IAC/B,KAAK,OAAO,KAAK,KAAK,GAAG;AAAA,EAC3B;AACA,QAAM,WAAW,EAAE,GAAG,gBAAgB,cAAc,KAAK,aAAa;AAGtE,QAAM,YAAYA,MAAK,SAAS,oBAAoB;AACpD,MAAI,KAAK,WAAW;AAClB,UAAM,SAAS,eAA0B;AAAA,MACvC;AAAA,MACA;AAAA,MACA,QAAQ,KAAK,KAAK;AAAA,MAClB,cAAc,KAAK;AAAA,IACrB,CAAC;AACD,QAAI,OAAO,WAAW,OAAO;AAC3B,2BAAqB,OAAO,MAAM,KAAK,KAAK,eAAe,MAAM;AACjE,YAAM,iBACJ,OAAO,KAAK,UAAU,KACtB,OAAO,KAAK,WAAW,QAAQ,KAC/B,OAAO,KAAK,WAAW,SAAS;AAClC,UAAI,OAAO,KAAK,gBAAgB,QAAW;AACzC,YAAI,kBAAkB,OAAO,KAAK,OAAO,KAAK,WAAW,EAAE,SAAS,GAAG;AACrE,gBAAM,IAAI;AAAA,YACR,6BAA6B,KAAK,KAAK,MAAM;AAAA,UAC/C;AAAA,QACF;AAAA,MACF,WACE,CAAC,MAAM,QAAQ,OAAO,KAAK,WAAW,KACtC,OAAO,KAAK,YAAY;AAAA,QACtB,CAAC,WAAW,OAAO,WAAW,YAAY,OAAO,KAAK,EAAE,WAAW;AAAA,MACrE,KACA,IAAI,IAAI,OAAO,KAAK,WAAW,EAAE,SAAS,OAAO,KAAK,YAAY,QAClE;AACA,cAAM,IAAI;AAAA,UACR,6BAA6B,KAAK,KAAK,MAAM;AAAA,QAC/C;AAAA,MACF,OAAO;AACL,cAAM,kBAAkB,IAAI;AAAA,UAC1B,KAAK,WAAW,KAAK,EAAE,MAAM,eAAe,CAAC,EAAE,IAAI,CAAC,YAAY,QAAQ,MAAM;AAAA,QAChF;AACA,cAAM,iBAAiB,OAAO,KAAK,YAAY;AAAA,UAC7C,CAAC,WAAW,CAAC,gBAAgB,IAAI,MAAM;AAAA,QACzC;AACA,YAAI,eAAe,SAAS,GAAG;AAC7B,gBAAM,IAAI;AAAA,YACR,6BAA6B,KAAK,KAAK,MAAM,mCAAmC,eAAe,KAAK,IAAI,CAAC;AAAA,UAC3G;AAAA,QACF;AAAA,MACF;AACA,aAAO,EAAE,MAAM,EAAE,GAAG,OAAO,MAAM,QAAQ,KAAK,GAAG,iBAAiB,CAAC,EAAE;AAAA,IACvE;AAAA,EACF;AAEA,QAAM,UAAU,KAAK,IAAI;AACzB,QAAM,QAAQ,KAAK,iBAAiB,KAAK,KAAK,QAAQ,OAAO;AAC7D,QAAM,kBAA0C,CAAC;AACjD,QAAM,YAAoC;AAAA,IACxC,MAAM,MAAM,MAAM,SAAS;AACzB,YAAM,WAAWA,MAAK,SAAS,IAAI;AACnC,cAAQ,UAAUA,MAAK,UAAU,IAAI,CAAC;AACtC,cAAQ,MAAM,UAAU,OAAO;AAC/B,sBAAgB,GAAG,KAAK,KAAK,MAAM,IAAI,IAAI,EAAE,IAAI;AACjD,aAAO;AAAA,IACT;AAAA,IACA,MAAM,UAAU,MAAM,OAAO;AAC3B,aAAO,UAAU,MAAM,MAAM,KAAK,UAAU,OAAO,MAAM,CAAC,CAAC;AAAA,IAC7D;AAAA,EACF;AACA,QAAM,OAA0B;AAAA,IAC9B,MAAM,YAAY,OAAO;AACvB,YAAM,SAAS,MAAM,KAAK,WAAW,YAAY;AAAA,QAC/C,GAAG;AAAA,QACH,SAAS,MAAM,WAAW;AAAA,QAC1B,OAAO,KAAK;AAAA,QACZ,OAAO,MAAM;AAAA,QACb,MAAM;AAAA,QACN,QAAQ,UAAU;AAAA,MACpB,CAAC;AACD,UAAI,OAAO,SAAS;AAClB,cAAM,KAAK,QAAQ,OAAO,QAAQ,KAAK,IAAI,EAAE,WAAW,OAAO,QAAQ,QAAQ,CAAC,EAAE,IAAI;AAAA,MACxF;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAEA,QAAM,YAAY,KAAK,KAAK,gBAAgB;AAAA,IAC1C,UAAU,KAAK,KAAK;AAAA,IACpB,KAAK,KAAK,KAAK;AAAA,EACjB,CAAC;AAMD,QAAM,YAAY,IAAI,gBAAgB;AACtC,QAAM,kBAAkB,MAAM,UAAU,MAAO,KAAK,OAAgC,MAAM;AAC1F,MAAI,KAAK,OAAO,QAAS,WAAU,MAAO,KAAK,OAAgC,MAAM;AAAA,MAChF,MAAK,OAAO,iBAAiB,SAAS,iBAAiB,EAAE,MAAM,KAAK,CAAC;AAE1E,QAAM,MAAuB;AAAA,IAC3B,QAAQ,KAAK,KAAK;AAAA,IAClB,KAAK,KAAK,KAAK;AAAA,IACf,MAAM,KAAK,KAAK;AAAA,IAChB,QAAQ,UAAU;AAAA,IAClB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,MAAI;AACJ,MAAI;AACJ,QAAM,YAAY,KAAK;AACvB,MAAI;AACJ,MAAI;AACF,UAAM,aAAa,KAAK,KAAK,SAAS,KAAK,KAAK,UAAU,GAAG;AAC7D,QAAI,cAAc,UAAa,YAAY,GAAG;AAK5C,iBAAW,MAAM,QAAQ,KAAK;AAAA,QAC5B;AAAA,QACA,IAAI,QAAe,CAAC,GAAG,WAAW;AAChC,yBAAe,WAAW,MAAM;AAC9B,sBAAU,MAAM,IAAI,MAAM,kBAAkB,CAAC;AAC7C;AAAA,cACE,IAAI;AAAA,gBACF,qBAAqB,SAAS,gBAAgB,KAAK,KAAK,MAAM;AAAA,cAChE;AAAA,YACF;AAAA,UACF,GAAG,SAAS;AACZ,cAAI,OAAQ,aAAwC,UAAU;AAC5D,YAAC,aAAuC,MAAM;AAAA,QAClD,CAAC;AAAA,MACH,CAAC;AAAA,IACH,OAAO;AACL,iBAAW,MAAM;AAAA,IACnB;AAAA,EACF,SAAS,KAAK;AACZ,mBAAe,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAAA,EAChE,UAAE;AACA,QAAI,aAAc,cAAa,YAAY;AAC3C,SAAK,OAAO,oBAAoB,SAAS,eAAe;AAAA,EAC1D;AAEA,QAAM,gBAAgB,KAAK,WAAW,KAAK,EAAE,SAAS,SAAS,MAAM,SAAS,CAAC;AAC/E,QAAM,YAAY,KAAK,WAAW,QAAQ,EAAE,SAAS,SAAS,MAAM,SAAS,CAAC;AAC9E,QAAM,aAAiC;AAAA,IACrC,OAAO,UAAU;AAAA,IACjB,QAAQ,UAAU;AAAA,IAClB,GAAI,UAAU,eAAe,IAAI,EAAE,QAAQ,UAAU,aAAa,IAAI,CAAC;AAAA,EACzE;AACA,QAAM,gBAAgB,cAAc,GAAG,EAAE,GAAG;AAC5C,QAAM,iBAAiB;AAAA,IACrB,QAAQ,KAAK,KAAK;AAAA,IAClB;AAAA,IACA,OAAO;AAAA,IACP,SAAS,UAAU;AAAA,IACnB;AAAA,EACF;AACA,MAAI;AACF,yBAAqB,gBAAgB,KAAK,KAAK,eAAe,MAAM;AAAA,EACtE,SAAS,OAAO;AACd,UAAM,MAAM,MAAM;AAClB,UAAM;AAAA,EACR;AAKA,QAAM,cAA0C,CAAC;AACjD,MAAI,aAAa,QAAW;AAC1B,eAAW,SAAS,KAAK,KAAK,UAAU,CAAC,GAAG;AAC1C,UAAI,MAAM,aAAa,CAAC,MAAM,UAAU,KAAK,KAAK,QAAQ,EAAG;AAC7D,UAAI;AACF,cAAM,QAAQ,MAAM,aAAa,OAAO;AAAA,UACtC;AAAA,UACA,UAAU,KAAK,KAAK;AAAA,UACpB,QAAQ,KAAK;AAAA,UACb,YAAY,KAAK;AAAA,UACjB,WAAW,KAAK;AAAA,UAChB;AAAA,QACF,CAAC;AACD,oBAAY,MAAM,IAAI,IAAI;AAAA,MAC5B,SAAS,KAAK;AACZ,YAAI,eAAe,+BAA+B;AAChD,gBAAM,MAAM,MAAM;AAClB,gBAAM;AAAA,QACR;AACA,uBAAe,UAAU,MAAM,IAAI,aAAa,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAChG;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,QAAM,MAAM,MAAM;AAElB,QAAM,cAAc,KAAK,WACtB,KAAK,EAAE,MAAM,SAAS,CAAC,EACvB,IAAI,CAAC,YAAY,QAAQ,MAAM,EAC/B,KAAK;AAER,QAAM,OAAsC;AAAA,IAC1C,cAAc,KAAK;AAAA,IACnB,QAAQ,KAAK,KAAK;AAAA,IAClB,YAAY,KAAK,KAAK,SAAS;AAAA,IAC/B,KAAK,KAAK,KAAK;AAAA,IACf,UAAW,YAAY;AAAA,IACvB;AAAA,IACA,SAAS,UAAU;AAAA,IACnB,eAAe,cAAc;AAAA,MAC3B,CAAC,YAAY,QAAQ,kBAAkB,UAAa,CAAC,QAAQ;AAAA,IAC/D;AAAA,IACA;AAAA,IACA;AAAA,IACA,GAAI,gBAAgB,EAAE,cAAc,IAAI,CAAC;AAAA,IACzC,YAAY,KAAK,IAAI,IAAI;AAAA,IACzB,MAAM,KAAK,KAAK;AAAA,IAChB,QAAQ;AAAA,IACR,OAAO;AAAA,EACT;AAEA,MAAI,CAAC,gBAAgB,KAAK,WAAW;AACnC,YAAQ,MAAM,WAAW,KAAK,UAAU,IAAI,CAAC;AAAA,EAC/C;AAEA,SAAO,EAAE,MAAM,gBAAgB;AACjC;AAuCO,SAAS,gBACd,MACiB;AACjB,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,YAAY,KAAK,aAAa;AACpC,QAAM,UAAU,KAAK,WAAW,kBAAkB;AAElD,uBAAqB,KAAK,WAAW,IAAI;AAEzC,MAAI,OAAO,KAAK,WAAW,YAAY,KAAK,OAAO,KAAK,EAAE,WAAW,GAAG;AACtE,UAAM,IAAI,MAAM,oEAAoE;AAAA,EACtF;AACA,OAAK,SAAS,cAAc,KAAK,QAAQ,KAAK,IAAI;AAElD,QAAM,eAAe,oBAAoB;AAAA,IACvC,WAAW,KAAK;AAAA,IAChB,QAAS,KAAK,UAAU,CAAC;AAAA,IACzB,aAAa,eAAe,KAAK,UAAU,KAAK,WAAW;AAAA,IAC3D;AAAA,IACA;AAAA,EACF,CAAC;AACD,QAAM,cAAc,oBAAoB,KAAK,WAAW,IAAI;AAE5D,QAAM,QAAQ,kBAAkB,KAAK,WAAW,MAAM,IAAI,EAAE,IAAI,CAAC,SAA8B;AAC7F,UAAM,YAAYA;AAAA,MAChB,KAAK;AAAA,MACL,KAAK,OAAO,QAAQ,mBAAmB,GAAG;AAAA,MAC1C;AAAA,IACF;AACA,QAAI,CAAC,WAAW;AACd,aAAO;AAAA,QACL,QAAQ,KAAK;AAAA,QACb,YAAY,KAAK,SAAS;AAAA,QAC1B,KAAK,KAAK;AAAA,QACV,MAAM,KAAK;AAAA,QACX;AAAA,QACA,QAAQ;AAAA,QACR,QAAQ;AAAA,MACV;AAAA,IACF;AAEA,UAAM,SAAS,eAAwB;AAAA,MACrC;AAAA,MACA;AAAA,MACA,QAAQ,KAAK;AAAA,MACb;AAAA,IACF,CAAC;AACD,QAAI,OAAO,WAAW,OAAO;AAC3B,aAAO;AAAA,QACL,QAAQ,KAAK;AAAA,QACb,YAAY,KAAK,SAAS;AAAA,QAC1B,KAAK,KAAK;AAAA,QACV,MAAM,KAAK;AAAA,QACX;AAAA,QACA,QAAQ;AAAA,MACV;AAAA,IACF;AAEA,WAAO;AAAA,MACL,QAAQ,KAAK;AAAA,MACb,YAAY,KAAK,SAAS;AAAA,MAC1B,KAAK,KAAK;AAAA,MACV,MAAM,KAAK;AAAA,MACX;AAAA,MACA,QAAQ;AAAA,MACR,QAAQ,OAAO;AAAA,IACjB;AAAA,EACF,CAAC;AAED,QAAM,cAAc,MAAM,OAAO,CAAC,SAAS,KAAK,WAAW,QAAQ,EAAE;AACrE,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,YAAY,MAAM;AAAA,IAClB;AAAA,IACA,YAAY,MAAM,SAAS;AAAA,IAC3B;AAAA,EACF;AACF;AAQA,SAAS,qBACP,MAIA,MACM;AACN,MAAI,SAAS,MAAO;AACpB,MAAI,KAAK,aAAa,QAAQ,KAAK,aAAa,OAAW;AAC3D,QAAM,aAAa,KAAK,WAAW,UAAU,KAAK,KAAK,WAAW,WAAW;AAC7E,MAAI,KAAK,YAAY,KAAK,CAAC,WAAY;AACvC,QAAM,MAAM,SAAS,KAAK,MAAM;AAChC,MAAI,SAAS,UAAU;AACrB,UAAM,SAAiC;AAAA,MACrC,cAAc;AAAA,MACd,aAAa;AAAA,MACb,aAAa;AAAA,MACb,iBAAiB;AAAA,MACjB,kBAAkB;AAAA,MAClB,mBAAmB;AAAA,MACnB,cAAc;AAAA,MACd,SAAS;AAAA,MACT,WAAW;AAAA,IACb;AACA,UAAM,IAAI,sBAAsB,gBAAgB,GAAG,IAAI,MAAM;AAAA,EAC/D;AAEA,UAAQ,KAAK,8BAA8B,GAAG,EAAE;AAClD;AAEA,eAAe,aACb,OACA,OACqB;AACrB,QAAM,qBAAqB,IAAI;AAAA,IAC7B,MAAM,YACF,KAAK,EAAE,SAAS,SAAS,MAAM,MAAM,SAAS,CAAC,EAChD,IAAI,CAAC,YAAY,QAAQ,MAAM,KAAK,CAAC;AAAA,EAC1C;AACA,MAAI;AACF,UAAM,QAAQ,MAAM,MAAM,MAAM,KAAK;AACrC,oCAAgC,MAAM,MAAM,OAAO,OAAO,kBAAkB;AAC5E,WAAO;AAAA,EACT,SAAS,OAAO;AACd,oCAAgC,MAAM,MAAM,OAAO,OAAO,oBAAoB,KAAK;AACnF,UAAM;AAAA,EACR;AACF;AAEA,SAAS,gCACP,WACA,OACA,OACA,iBACA,OACM;AACN,MAAI,CAAC,WAAW,KAAK,EAAG;AACxB,QAAM,WAAW,MAAM,YACnB,KAAK,EAAE,SAAS,SAAS,MAAM,MAAM,SAAS,CAAC,EAChD,KAAK,CAAC,YAAY,CAAC,gBAAgB,IAAI,QAAQ,MAAM,CAAC;AACzD,MAAI,SAAU;AACd,QAAM,IAAI;AAAA,IACR,uBAAuB,SAAS;AAAA,IAChC,UAAU,SAAY,SAAY,EAAE,MAAM;AAAA,EAC5C;AACF;AAEA,SAAS,WAAW,OAA+C;AACjE,SACE,OAAO,UAAU,YACjB,UAAU,QACV,aAAa,SACZ,MAAgC,YAAY;AAEjD;AAEA,SAAS,wBACP,SACsD;AACtD,SAAO,CAAC,QAAQ,QAAQ;AACtB,UAAM,QAAwC,CAAC;AAC/C,WAAO;AAAA,MACL,KAAK,MAAM,YAAY;AACrB,cAAM,UAAU,KAAK,IAAI;AACzB,cAAM,SAAkC,EAAE,MAAM,QAAQ,SAAS,GAAI,cAAc,CAAC,EAAG;AACvF,cAAM,SAAoB;AAAA,UACxB,IAAI,UAAU;AACZ,mBAAO,aAAa,KAAK,IAAI,IAAI;AACjC,gBAAI,SAAU,QAAO,OAAO,QAAQ,QAAQ;AAC5C,kBAAM,KAAK,MAAM;AAAA,UACnB;AAAA,UACA,aAAa,KAAK,OAAO;AACvB,mBAAO,GAAG,IAAI;AAAA,UAChB;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAAA,MACA,MAAM,QAAQ;AACZ,gBAAQ,MAAMA,MAAK,KAAK,aAAa,GAAG,MAAM,IAAI,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC;AAAA,MACxF;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,kBACP,WACA,MACA,MAC+E;AAC/E,QAAM,WAA0F,CAAC;AACjG,MAAI,YAAY;AAChB,aAAW,YAAY,WAAW;AAChC,aAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,YAAM,SAAS,GAAG,SAAS,EAAE,IAAI,GAAG;AACpC,YAAM,WAAW,OAAO;AACxB,eAAS,KAAK,EAAE,UAAU,KAAK,QAAQ,SAAS,CAAC;AACjD,mBAAa;AAAA,IACf;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,eACP,UACA,UACQ;AACR,QAAM,MAAM,YAAY,UAAU,QAAQ;AAC1C,MAAI,OAAO,QAAQ,YAAY,IAAI,KAAK,EAAE,WAAW,GAAG;AACtD,UAAM,IAAI,MAAM,mEAAmE;AAAA,EACrF;AACA,SAAO;AACT;AAMA,SAAS,eAA0B,MAKV;AACvB,QAAM,MAAM,KAAK,QAAQ,KAAK,KAAK,SAAS;AAC5C,MAAI,QAAQ,OAAW,QAAO,EAAE,QAAQ,QAAQ,QAAQ,UAAU;AAElE,MAAI;AACF,UAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,QAAI,OAAO,WAAW,KAAK,OAAQ,QAAO,EAAE,QAAQ,QAAQ,QAAQ,gBAAgB;AACpF,QAAI,OAAO,iBAAiB,KAAK,cAAc;AAC7C,aAAO,EAAE,QAAQ,QAAQ,QAAQ,oBAAoB;AAAA,IACvD;AACA,WAAO,EAAE,QAAQ,OAAO,MAAM,OAAO;AAAA,EACvC,QAAQ;AACN,WAAO,EAAE,QAAQ,QAAQ,QAAQ,UAAU;AAAA,EAC7C;AACF;AAUA,eAAe,eACb,MACe;AACf,QAAM,KAAK,MAAM,QAAQ;AAAA,IACvB,UAAU,KAAK;AAAA,IACf,UAAU,KAAK,KAAK;AAAA,IACpB,aAAa,KAAK,KAAK;AAAA,IACvB,QAAQ,KAAK,KAAK,iBAAiB;AAAA,IACnC,mBAAmB,KAAK,KAAK,4BAA4B;AAAA,IACzD,YAAY,KAAK,IAAI,EAAE,YAAY;AAAA,IACnC,iBAAiB;AAAA,EACnB,CAAC;AACH;AAIA,SAAS,oBAAoB,OAMlB;AACT,SAAO,YAAY;AAAA,IACjB,WAAW,MAAM;AAAA,IACjB,QAAQ,MAAM,OAAO,IAAI,CAAC,WAAW;AAAA,MACnC,MAAM,MAAM;AAAA,MACZ,MAAM,MAAM;AAAA,MACZ,SAAS,gBAAgB,KAAK;AAAA,IAChC,EAAE;AAAA,IACF,UAAU,MAAM;AAAA,IAChB,MAAM,MAAM;AAAA,IACZ,MAAM,MAAM;AAAA,EACd,CAAC;AACH;AAEA,SAAS,gBAAgB,OAAqC;AAC5D,MAAI,MAAM,iBAAiB,QAAW;AACpC,UAAM,UAAU,MAAM,aAAa,KAAK;AACxC,QAAI,QAAQ,WAAW,GAAG;AACxB,YAAM,IAAI,MAAM,uBAAuB,MAAM,IAAI,6BAA6B;AAAA,IAChF;AACA,WAAO;AAAA,EACT;AACA,SAAO,YAAY;AAAA,IACjB,OAAO,MAAM,MAAM,SAAS;AAAA,IAC5B,WAAW,MAAM,WAAW,SAAS,KAAK;AAAA,EAC5C,CAAC;AACH;AAEA,SAAS,kBACP,OACA,QACA,MACA,MACoB;AACpB,QAAM,UAA0C,CAAC;AACjD,aAAW,SAAS,QAAQ;AAC1B,UAAM,SAAmB,CAAC;AAC1B,eAAW,QAAQ,OAAO;AACxB,YAAM,IAAI,KAAK,YAAY,MAAM,IAAI;AACrC,UAAI,MAAM,OAAW,QAAO,KAAK,EAAE,SAAS;AAAA,IAC9C;AACA,YAAQ,MAAM,IAAI,IAAI,UAAU,QAAQ,IAAI;AAAA,EAC9C;AACA,QAAM,aAAgD,CAAC;AACvD,QAAM,iBAAiB,oBAAI,IAAsB;AACjD,aAAW,QAAQ,OAAO;AACxB,UAAM,aAAa,OAAO,OAAO,KAAK,WAAW,EAAE,IAAI,CAAC,MAAM,EAAE,SAAS;AACzE,QAAI,WAAW,WAAW,EAAG;AAC7B,UAAM,OAAO,WAAW,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,WAAW;AAChE,UAAM,MAAM,eAAe,IAAI,KAAK,UAAU,KAAK,CAAC;AACpD,QAAI,KAAK,IAAI;AACb,mBAAe,IAAI,KAAK,YAAY,GAAG;AAAA,EACzC;AACA,aAAW,CAAC,YAAY,OAAO,KAAK,gBAAgB;AAClD,UAAM,KAAK,UAAU,SAAS,IAAI;AAClC,eAAW,UAAU,IAAI,EAAE,eAAe,GAAG,MAAM,MAAM,GAAG,MAAM,GAAG,GAAG,EAAE;AAAA,EAC5E;AACA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,cAAc,KAAK;AAAA,IACnB,eAAe,MAAM,OAAO,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE;AAAA,IAC7C,cAAc,MAAM,OAAO,CAAC,MAAM,EAAE,OAAO,WAAW,UAAU,CAAC,EAAE;AAAA,IACnE,aAAa,MAAM,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE;AAAA,IAC3C,aAAa,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,WAAW,UAAU,CAAC,EAAE;AAAA,EAC/E;AACF;AAKA,SAAS,UAAU,SAAmB,MAA8B;AAClE,QAAM,IAAI,QAAQ;AAClB,MAAI,MAAM,EAAG,QAAO,EAAE,MAAM,GAAG,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE;AAC5D,QAAM,OAAO,QAAQ,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;AAClD,QAAM,WAAW,QAAQ,OAAO,CAAC,GAAG,MAAM,KAAK,IAAI,SAAS,GAAG,CAAC,IAAI,KAAK,IAAI,GAAG,IAAI,CAAC;AACrF,QAAM,QAAQ,KAAK,KAAK,QAAQ;AAChC,QAAM,KAAK,mBAAmB,SAAS,MAAM,EAAE,MAAM,WAAW,IAAK,CAAC;AACtE,SAAO,EAAE,MAAM,OAAO,MAAM,CAAC,GAAG,OAAO,GAAG,KAAK,GAAG,EAAE;AACtD;","names":["join","join","existsSync","readFileSync","existsSync","readFileSync","existsSync","mkdirSync","readFileSync","join","join"]}

package/dist/contract/index.d.ts

@@ -1,3 +1,4 @@
+import { AgentImprovementMeasuredComparison, Sha256Digest } from '@tangle-network/agent-interface';
 import { AxFunction, AxAIService } from '@ax-llm/ax';
 import { z } from 'zod';
 
@@ -1122,6 +1123,8 @@ interface AnalystCost {
     est_usd_per_run?: number;
     /** Models the analyst expects to use (informational). */
     models?: string[];
+    /** Maximum post-cancellation wait for provider usage. Model analysts default to 5 seconds. */
+    settlement_timeout_ms?: number;
 }
 interface AnalystRequirements {
     /** Min number of shots / samples the analyst needs to produce signal. */
@@ -1145,7 +1148,7 @@ interface AnalystContext {
     runId: string;
     /** Stable correlation id so logs from a single registry.run() share a tag. */
     correlationId: string;
-    /** Wall-clock deadline (epoch ms). Analysts SHOULD honor for graceful cancel. */
+    /** Enforced wall-clock deadline (epoch ms). */
     deadlineMs?: number;
     /** Per-analyst USD budget. Analysts MAY check before issuing LLM calls. */
     budgetUsd?: number;
@@ -1384,6 +1387,10 @@ interface Scenario {
     kind: string;
     tags?: string[];
 }
+/** Redacted identity of a complete scenario payload retained in campaign results. */
+interface CampaignScenarioIdentity extends Pick<Scenario, 'id' | 'kind'> {
+    scenarioDigest: `sha256:${string}`;
+}
 /** Context handed to every dispatch invocation. Scoped — every
  *  trace/span carries the cellId, every artifact write lands under the cell's
  *  artifact root, the cost meter accumulates per cell. */
@@ -1961,7 +1968,11 @@ interface CampaignAggregates {
 interface CampaignResult<TArtifact = unknown, TScenario extends Scenario = Scenario> {
     /** sha256(scenarios, judges, dispatch source ref, optimizer config, seed). Stable identity for reruns. */
     manifestHash: string;
+    /** Canonical identity of the exact scenario payloads and replicate count. */
+    splitDigest: `sha256:${string}`;
     seed: number;
+    /** Replicates designed for every scenario in this campaign. */
+    reps: number;
     startedAt: string;
     endedAt: string;
     durationMs: number;
@@ -1975,13 +1986,14 @@ interface CampaignResult<TArtifact = unknown, TScenario extends Scenario = Scena
     prUrl?: string;
     runDir: string;
     artifactsByPath: Record<string, string>;
-    /** Substrate strips the input scenarios to id+kind for the result manifest;
-     *  consumers needing full payload look it up via the original input. The
-     *  type parameter `TScenario` is propagated for downstream consumers that
-     *  want narrowed types when extending `CampaignResult`. */
-    scenarios: Array<Pick<TScenario, 'id' | 'kind'>>;
+    /** Redacted identities that let consumers verify the exact scenario payloads
+     *  without retaining customer task content in the result. */
+    scenarios: Array<CampaignScenarioIdentity & Pick<TScenario, 'id' | 'kind'>>;
 }
 
+/** Canonical identity of the exact scenario payloads and replicate count. */
+declare function campaignSplitDigest<TScenario extends Scenario>(scenarios: readonly TScenario[], reps: number): `sha256:${string}`;
+
 /**
  * `CampaignStorage` — the filesystem seam `runCampaign` writes through
  * (run/cell dirs, the resumability cache, per-cell artifacts, trace spans).
@@ -2316,8 +2328,8 @@ interface RunOptimizationResult<TArtifact, TScenario extends Scenario> {
  *
  * Hard-refuses unsafe configurations:
  *   - `tracing: 'off'` when a proposer is wired (improvement is unattributable)
- *   - `autoOnPromote: 'config'` — DEFERRED to Pass B; v0.40 only ships
- *     `'pr'` and `'none'`.
+ *   - `autoOnPromote: 'config'` — live mutation is unsupported without
+ *     isolated deployment, rollback, and independent validation.
  */
 
 type RunImprovementLoopOptions<TScenario extends Scenario, TArtifact> = RunOptimizationOptions<TScenario, TArtifact> & {
@@ -2331,15 +2343,11 @@ type RunImprovementLoopOptions<TScenario extends Scenario, TArtifact> = RunOptim
     /** What to do when the gate ships:
      *   - `'pr'`: open a PR via `openAutoPr`
      *   - `'none'`: just report — caller decides what to do with the winner
-     *  v0.40 does NOT support `'config'` (live-runtime self-mutation) —
-     *  deferred to Pass B behind safety stack. */
+     *  Live-runtime self-mutation is intentionally unsupported. */
     autoOnPromote: 'pr' | 'none';
     /** GH owner / repo for the auto-PR. Required when autoOnPromote === 'pr'. */
     ghOwner?: string;
     ghRepo?: string;
-    /** Optional render override — substrate writes a diff-shaped surface; pass
-     *  a function to format the promoted surface differently. */
-    renderPromotedDiff?: (winnerSurface: MutableSurface, baselineSurface: MutableSurface) => string;
     /** Placebo control. When supplied AND the winner differs from baseline, the
      *  loop scores a THIRD holdout arm: the winner surface with its content
      *  footprint-matched-blanked by this function (typically via `neutralizeText`).
@@ -2352,6 +2360,8 @@ type RunImprovementLoopOptions<TScenario extends Scenario, TArtifact> = RunOptim
 interface RunImprovementLoopResult<TArtifact, TScenario extends Scenario> extends RunOptimizationResult<TArtifact, TScenario> {
     baselineOnHoldout: CampaignResult<TArtifact, TScenario>;
     winnerOnHoldout: CampaignResult<TArtifact, TScenario>;
+    neutralizedOnHoldout?: CampaignResult<TArtifact, TScenario>;
+    neutralizedSurface?: MutableSurface;
     gateResult: Awaited<ReturnType<Gate<TArtifact, TScenario>['decide']>>;
     /** Unified baseline→winner surface diff. Computed UNCONDITIONALLY (not only
      *  when `autoOnPromote === 'pr'`) so the diff that the gate decided on is
@@ -3554,9 +3564,8 @@ interface PowerPreflight {
  *      reads). The hosted `/v1/ingest/traces` endpoint receives the FULL loop,
  *      not just the `cost.*` spans `runCampaign` already emits per cell.
  *
- * The record is built from the substrate's own loop result + the per-call
- * `RunRecord`s the worker emitted — no new measurement, no recomputation that
- * could drift from what the gate actually saw.
+ * The record is built from the loop result and its settled cost receipts — no
+ * second usage collector can contradict what the measured cells recorded.
  */
 
 interface LoopProvenanceCandidate {
@@ -3566,6 +3575,8 @@ interface LoopProvenanceCandidate {
     surfaceHash: string;
     /** Full sha256 content hash — byte-identical-verifiable. */
     contentHash: string;
+    /** Exact scored rows that produced this candidate's search result. */
+    campaignDigest: `sha256:${string}`;
     /** Proposer label, when the proposer returned a `ProposedCandidate`. */
     label?: string;
     /** Proposer rationale — the "because Z". When the proposer returned a bare
@@ -3599,13 +3610,33 @@ interface LoopProvenanceBackend {
     totalOutputTokens: number;
     totalCostUsd: number;
 }
+interface LoopProvenanceEvidence {
+    search: {
+        splitDigest: `sha256:${string}`;
+        baselineCampaignDigest: `sha256:${string}`;
+    };
+    holdout: {
+        splitDigest: `sha256:${string}`;
+        baselineCampaignDigest: `sha256:${string}`;
+        winnerCampaignDigest: `sha256:${string}`;
+        neutralized?: {
+            contentHash: `sha256:${string}`;
+            campaignDigest: `sha256:${string}`;
+            composite: number;
+            lift: number;
+        };
+    };
+    costReceiptsDigest: `sha256:${string}`;
+}
 /**
  * The durable provenance record. Aligns to the hosted `EvalRunEvent` path but
  * ADDS the rationale + the explicit baseline→candidate diff (both omitted from
  * the bare hosted event) + backend provenance.
  */
 interface LoopProvenanceRecord {
-    schema: 'tangle.loop-provenance.v3';
+    schema: 'tangle.loop-provenance';
+    /** SHA-256 over the canonical record with this field omitted. */
+    recordDigest: `sha256:${string}`;
     runId: string;
     runDir: string;
     timestamp: string;
@@ -3619,6 +3650,8 @@ interface LoopProvenanceRecord {
     diff: string;
     /** Every candidate across every generation, with its rationale and structured cause. */
     candidates: LoopProvenanceCandidate[];
+    /** Exact campaign, split, surface, and receipt identities behind every summary. */
+    evidence: LoopProvenanceEvidence;
     /** Baseline composite on the search split that generated the candidates. */
     baselineSearchComposite: number;
     /** The gate verdict — decision + reasons + contributing gates + delta. */
@@ -3629,6 +3662,7 @@ interface LoopProvenanceRecord {
         contributingGates: Array<{
             name: string;
             passed: boolean;
+            detail: unknown;
         }>;
     };
     /** baseline-on-holdout composite mean. */
@@ -3781,17 +3815,6 @@ interface SelfImproveOptions<TScenario extends Scenario, TArtifact> {
      *  Default `mem://selfImprove-<timestamp>` (in-memory, non-durable). Pass a
      *  real path to persist the provenance record + spans. */
     runDir?: string;
-    /**
-     * Worker call records for backend provenance. The agent is opaque to the
-     * substrate (it returns an artifact, not token usage), so to capture an
-     * `assertRealBackend`-grade verdict + worker call count + model in the
-     * provenance record, the agent reports its per-call `RunRecord`s here.
-     * Called once after the loop; return the records the agent accumulated.
-     * When unset, backend provenance is derived from campaign cells (cost only;
-     * verdict will read `stub` without token usage — the honest signal that no
-     * token channel was wired).
-     */
-    collectWorkerRecords?: () => RunRecord[];
     /** Fires once the durable provenance record + OTel spans are emitted.
      *  Receives the structured record for inline assertions / custom routing. */
     onProvenance?: (record: LoopProvenanceRecord) => void;
@@ -4000,6 +4023,19 @@ interface DefinedAgentEval<TScenario extends Scenario, TArtifact> {
  */
 declare function defineAgentEval<TScenario extends Scenario, TArtifact>(defaults: DefineAgentEvalOptions<TScenario, TArtifact>): DefinedAgentEval<TScenario, TArtifact>;
 
+interface MeasuredComparisonFromSelfImproveResultOptions<TScenario extends Scenario, TArtifact> {
+    result: SelfImproveResult<TScenario, TArtifact>;
+    benchmark: AgentImprovementMeasuredComparison['benchmark'];
+    /** Canonical digest verified by the runtime that owns the baseline profile. */
+    baselineProfileDigest: Sha256Digest;
+    /** Canonical digest verified by the runtime that owns candidate sealing. */
+    candidateBundleDigest: Sha256Digest;
+    /** Exact baseline surface; contradictory recorded provenance is rejected. */
+    baselineSurface: MutableSurface;
+}
+/** Convert one paired self-improvement result into the portable Interface evidence record. */
+declare function measuredComparisonFromSelfImproveResult<TScenario extends Scenario, TArtifact>(options: MeasuredComparisonFromSelfImproveResultOptions<TScenario, TArtifact>): AgentImprovementMeasuredComparison;
+
 /**
  * Typed Ax output for analyst findings.
  *
@@ -4065,8 +4101,8 @@ type CanonicalRawAnalystFinding = z.infer<typeof CanonicalRawAnalystFindingSchem
  * Analyst-kind factory — the typed way to define trace analysts.
  *
  * A "kind" is a specialized analyst whose actor prompt, tool subset,
- * and Ax recursion config target one failure-mode lens (failure-mode
- * classification, knowledge gap discovery, knowledge poisoning, recursive
+ * and bounded Ax subqueries target one failure-mode lens (failure-mode
+ * classification, knowledge gap discovery, knowledge poisoning,
  * self-improvement, ...). Kinds emit findings in the typed
  * `CanonicalRawAnalystFinding` shape via a JSON-array Ax output; the factory
  * validates each row with Zod and lifts it into `AnalystFinding[]`.
@@ -4077,12 +4113,11 @@ type CanonicalRawAnalystFinding = z.infer<typeof CanonicalRawAnalystFindingSchem
  *   - Each kind picks a narrow tool subset from `ANALYST_TOOL_GROUPS`.
  *     A kind that never needs full-trace dumps can drop `viewTrace` /
  *     `viewSpans` and stay cheap.
- *   - Each kind declares its recursion + parallelism budget. Discovery-
- *     heavy kinds (failure-mode) get higher `maxDepth`; lens kinds
- *     (poisoning) usually stay at 0 since they have a tighter brief.
+ *   - Each kind declares its subquery + parallelism budget. Discovery-heavy
+ *     kinds can fan out more bounded semantic questions than narrow lenses.
  *
  * Optimizer hook: kinds may declare `goldens` — labeled examples used
- * by `AxMiPRO` / `AxBootstrapFewShot` / `AxGEPA` to fit the actor
+ * by `AxBootstrapFewShot` / `AxGEPA` to fit the actor
  * description programmatically. Stored on the kind, not the registry,
  * because the right metric is kind-specific.
  */
@@ -4102,20 +4137,18 @@ interface TraceAnalystKindSpec {
     version: string;
     /** Actor system prompt. Must instruct the LLM to emit `findings` per the schema. */
     actorDescription: string;
-    /** Responder system prompt; falls back to a minimal "format the findings" instruction. */
-    responderDescription?: string;
     /** Tool functions the actor may call. Pick narrow subsets via `ANALYST_TOOL_GROUPS`. */
     buildTools: (store: TraceAnalysisStore) => AxFunction[];
-    /** Recursion budget. `maxDepth: 0` disables subagents. */
-    recursion?: {
-        maxDepth: number;
-        maxParallelSubagents?: number;
+    /** Bounded semantic subqueries. `maxCalls: 0` disables model fan-out. */
+    subqueries?: {
+        maxCalls: number;
+        maxParallel?: number;
     };
     /** Actor turn cap. Default 12. */
     maxTurns?: number;
     /** Runtime char cap. Default 6000. */
     maxRuntimeChars?: number;
-    /** Maximum output tokens for every actor, responder, and recursive model call. Default 4096. */
+    /** Maximum output tokens for every actor and subquery model call. Default 4096. */
     maxOutputTokens?: number;
     /** Cost classification surfaced in `registry.list()` and budget enforcement. */
     cost: AnalystCost;
@@ -4219,7 +4252,7 @@ interface RegistryRunOpts {
     skip?: string[];
     /** Budget policy — totalUsd + optional weights/allocator. Falls back to options.defaultBudget. */
     budget?: BudgetPolicy;
-    /** Wall-clock cap. Analysts SHOULD honor `ctx.deadlineMs`. */
+    /** Active-work cap for the complete registry run. Model receipt settlement may follow. */
     timeoutMs?: number;
     /** Abort signal — forwarded into every analyst's context. */
     signal?: AbortSignal;
@@ -4933,4 +4966,4 @@ interface FromOtelSpansOptions {
 }
 declare function fromOtelSpans(opts: FromOtelSpansOptions): RunRecord[];
 
-export { type AgentEvalAgent, type AgentEvalEvaluateOptions, type AgentEvalImproveOptions, type AgentTraceContributor, type AgentTraceContributorType, type AgentTraceConversation, type AgentTraceFile, type AgentTraceIndex, type AgentTraceRange, type AgentTraceRecord, type AnalystFinding, type AnalyzeRunsOptions, type AuthoringProvenance, type AxisEvidence, type AxisVerdict, type BuildEvidenceVectorOptions, type CampaignAggregates, type CampaignArtifactWriter, type CampaignCellResult, type CampaignCostMeter, type CampaignResult, type CampaignStorage, type CampaignTraceWriter, type ChatClient, type CodeAgentSessionDiagnostic, type CodeAgentSessionIntakeOptions, type CodeAgentSessionIntakeResult, type CodeAgentSessionMetrics, type CodeAgentSessionSource, type CodeSurface, type CostLedgerHandle, type CostProvenanceSummary, type CreateChatClientOpts, type DefaultAnalystRegistryOptions, type DefaultProductionGateOptions, type DefineAgentEvalOptions, type DefinedAgentEval, type DeploymentOutcome, type DispatchFn as Dispatch, type DispatchContext, type EvalCellScoreDelta, type EvalDimensionDelta, type EvalGenerationDiff, type EvalReportingSuiteInput, type EvalReportingSuiteOptions, type EvalReportingSuiteResult, type EvalRunDiff, type EvidenceVector, type EvolutionaryProposerOptions, type ExecutionInsight, type ExecutionReport, type FailureClusterInsight, type FeedbackTableMeta, type FeedbackTableRow, FileSystemOutcomeStore, type FileSystemOutcomeStoreOptions, type FromFeedbackTableOptions, type FromFeedbackTableResult, type FromOtelSpansOptions, type FromRunRecordDirOptions, type FromRunRecordDirResult, type Gate, type GateContext, type GateDecision, type GateResult, type GenerationCandidate, type GenerationRecord, type GepaProposerOptions, type HeldOutGateOptions, type HostedTenant, InMemoryOutcomeStore, type InsightReport, type InterRaterInsight, type JudgeConfig, type JudgeDimension, type JudgeInsight, type JudgeScore, type LiftInsight, type MutableSurface, type Mutator, type ObjectiveSource, type OptimizationProposer, type OptimizerConfig, type OutcomeCorrelationInsight, type OutcomeStore, type ParetoSignificanceGateOptions, type ParsedCodeAgentJsonl, type PartitionByAuthoringModelResult, type PromotionObjective, type PromotionPolicy, REFERENCE_EQUIVALENCE_INPUT_LIMITS, REFERENCE_EQUIVALENCE_JUDGE_VERSION, type Recommendation, type ReferenceEquivalenceJudgeInput, type ReferenceEquivalenceJudgeOptions, type ReferenceEquivalenceJudgeResult, type ReferenceEquivalenceScenario, type ReleaseSummary, type RunCampaignOptions, type RunEvalOptions, type RunImprovementLoopOptions, type RunImprovementLoopResult, type RunRecordRejection, type ScalarDistribution, type Scenario, type SelfImproveBudget, type SelfImproveLlm, type SelfImproveOptions, type SelfImproveProgressEvent, type SelfImproveResult, SelfImproveRunError, type SessionScript, type SummarizeExecutionOptions, type SurfaceProposer, type TokenUsageInsight, analyzeRuns, buildDefaultAnalystRegistry, buildEvidenceVector, composeGate, createChatClient, createReferenceEquivalenceJudge, defaultProductionGate, defineAgentEval, diffGenerations, diffRunBaselineToWinner, diffRuns, evalReportingSuite, evolutionaryProposer, fromClaudeCodeSession, fromCodexSession, fromFeedbackTable, fromKimiCodeSession, fromOpenCodeSession, fromOtelSpans, fromPiSession, fromPigraphSession, fromRunRecordDir, fsCampaignStorage, gepaProposer, heldOutGate, inMemoryCampaignStorage, paretoPolicy, paretoSignificanceGate, parseAgentTrace, parseCodeAgentJsonl, partitionRunsByAuthoringModel, runCampaign, runEval, runImprovementLoop, runReferenceEquivalenceJudge, selfImprove, summarizeExecution };
+export { type AgentEvalAgent, type AgentEvalEvaluateOptions, type AgentEvalImproveOptions, type AgentTraceContributor, type AgentTraceContributorType, type AgentTraceConversation, type AgentTraceFile, type AgentTraceIndex, type AgentTraceRange, type AgentTraceRecord, type AnalystFinding, type AnalyzeRunsOptions, type AuthoringProvenance, type AxisEvidence, type AxisVerdict, type BuildEvidenceVectorOptions, type CampaignAggregates, type CampaignArtifactWriter, type CampaignCellResult, type CampaignCostMeter, type CampaignResult, type CampaignStorage, type CampaignTraceWriter, type ChatClient, type CodeAgentSessionDiagnostic, type CodeAgentSessionIntakeOptions, type CodeAgentSessionIntakeResult, type CodeAgentSessionMetrics, type CodeAgentSessionSource, type CodeSurface, type CostLedgerHandle, type CostProvenanceSummary, type CreateChatClientOpts, type DefaultAnalystRegistryOptions, type DefaultProductionGateOptions, type DefineAgentEvalOptions, type DefinedAgentEval, type DeploymentOutcome, type DispatchFn as Dispatch, type DispatchContext, type EvalCellScoreDelta, type EvalDimensionDelta, type EvalGenerationDiff, type EvalReportingSuiteInput, type EvalReportingSuiteOptions, type EvalReportingSuiteResult, type EvalRunDiff, type EvidenceVector, type EvolutionaryProposerOptions, type ExecutionInsight, type ExecutionReport, type FailureClusterInsight, type FeedbackTableMeta, type FeedbackTableRow, FileSystemOutcomeStore, type FileSystemOutcomeStoreOptions, type FromFeedbackTableOptions, type FromFeedbackTableResult, type FromOtelSpansOptions, type FromRunRecordDirOptions, type FromRunRecordDirResult, type Gate, type GateContext, type GateDecision, type GateResult, type GenerationCandidate, type GenerationRecord, type GepaProposerOptions, type HeldOutGateOptions, type HostedTenant, InMemoryOutcomeStore, type InsightReport, type InterRaterInsight, type JudgeConfig, type JudgeDimension, type JudgeInsight, type JudgeScore, type LiftInsight, type MeasuredComparisonFromSelfImproveResultOptions, type MutableSurface, type Mutator, type ObjectiveSource, type OptimizationProposer, type OptimizerConfig, type OutcomeCorrelationInsight, type OutcomeStore, type ParetoSignificanceGateOptions, type ParsedCodeAgentJsonl, type PartitionByAuthoringModelResult, type PromotionObjective, type PromotionPolicy, REFERENCE_EQUIVALENCE_INPUT_LIMITS, REFERENCE_EQUIVALENCE_JUDGE_VERSION, type Recommendation, type ReferenceEquivalenceJudgeInput, type ReferenceEquivalenceJudgeOptions, type ReferenceEquivalenceJudgeResult, type ReferenceEquivalenceScenario, type ReleaseSummary, type RunCampaignOptions, type RunEvalOptions, type RunImprovementLoopOptions, type RunImprovementLoopResult, type RunRecordRejection, type ScalarDistribution, type Scenario, type SelfImproveBudget, type SelfImproveLlm, type SelfImproveOptions, type SelfImproveProgressEvent, type SelfImproveResult, SelfImproveRunError, type SessionScript, type SummarizeExecutionOptions, type SurfaceProposer, type TokenUsageInsight, analyzeRuns, buildDefaultAnalystRegistry, buildEvidenceVector, campaignSplitDigest, composeGate, createChatClient, createReferenceEquivalenceJudge, defaultProductionGate, defineAgentEval, diffGenerations, diffRunBaselineToWinner, diffRuns, evalReportingSuite, evolutionaryProposer, fromClaudeCodeSession, fromCodexSession, fromFeedbackTable, fromKimiCodeSession, fromOpenCodeSession, fromOtelSpans, fromPiSession, fromPigraphSession, fromRunRecordDir, fsCampaignStorage, gepaProposer, heldOutGate, inMemoryCampaignStorage, measuredComparisonFromSelfImproveResult, paretoPolicy, paretoSignificanceGate, parseAgentTrace, parseCodeAgentJsonl, partitionRunsByAuthoringModel, runCampaign, runEval, runImprovementLoop, runReferenceEquivalenceJudge, selfImprove, summarizeExecution };