@tangle-network/agent-eval 0.115.3 → 0.117.0

package/dist/chunk-FAOEFFRT.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/campaign/run-campaign.ts","../src/integrity/backend-integrity.ts","../src/verdict-cache.ts","../src/campaign/run-dir.ts","../src/campaign/storage.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 { BackendIntegrityError, type BackendIntegrityReport } from '../integrity/backend-integrity'\nimport { confidenceInterval } from '../statistics'\nimport { contentHash } from '../verdict-cache'\nimport { resolveRunDir } from './run-dir'\nimport { type CampaignStorage, 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  /** Wall-clock cost cap across all cells. Cells beyond ceiling are skipped. */\n  costCeiling?: number\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 maxConcurrency = opts.maxConcurrency ?? 2\n  const now = opts.now ?? (() => new Date())\n  const judges = opts.judges ?? []\n  const storage = opts.storage ?? fsCampaignStorage()\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\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\n  const startedAt = now()\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  let totalCostUsd = 0\n  let costCeilingReached = false\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          if (costCeilingReached) {\n            cellsRef.push(skippedCell(slot, 'cost_ceiling_reached'))\n            continue\n          }\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          })\n          cellsRef.push(result.cell)\n          enforceCellUsage(result.cell, opts.expectUsage ?? 'warn')\n          totalCostUsd += result.cell.costUsd\n          Object.assign(artifactsByPath, result.artifactsByPath)\n          if (opts.costCeiling !== undefined && totalCostUsd >= opts.costCeiling) {\n            costCeilingReached = true\n          }\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 aggregates = computeAggregates(\n    cellsRef,\n    judges as unknown as JudgeConfig<TArtifact>[],\n    seed,\n  )\n\n  return {\n    manifestHash,\n    seed,\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((s) => ({ id: s.id, kind: s.kind })),\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}\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\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      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  let costSoFar = 0\n  const tokensSoFar: CampaignTokenUsage = { input: 0, output: 0 }\n  let resolvedModel: string | undefined\n  const cost: CampaignCostMeter = {\n    observe(amount, source) {\n      costSoFar += amount\n      trace.span(`cost.${source}`, { amountUsd: amount }).end()\n    },\n    observeTokens(usage) {\n      tokensSoFar.input += usage.input\n      tokensSoFar.output += usage.output\n      if (usage.cached) tokensSoFar.cached = (tokensSoFar.cached ?? 0) + usage.cached\n    },\n    observeModel(model) {\n      const trimmed = model?.trim()\n      if (trimmed) resolvedModel = trimmed\n    },\n    current() {\n      return costSoFar\n    },\n    tokens() {\n      return { ...tokensSoFar }\n    },\n    resolvedModel() {\n      return resolvedModel\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  // 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        judgeScores[judge.name] = await runJudgeCell(judge, {\n          artifact,\n          scenario: args.slot.scenario,\n          signal: args.signal,\n        })\n      } catch (err) {\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 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: costSoFar,\n    tokenUsage: { ...tokensSoFar },\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  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  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\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    totalCells: cells.length,\n    cellsCached,\n    cellsToRun: cells.length - cellsCached,\n    cells,\n  }\n}\n\n/**\n * Per-cell stub guard. A cell that produced an artifact (no error) but reported\n * `costUsd === 0` AND zero 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), `'off'` skips. An errored/skipped cell or a\n * deterministic judge-only run that genuinely made no LLM call is not flagged.\n */\nfunction enforceCellUsage<TArtifact>(\n  cell: CampaignCellResult<TArtifact>,\n  mode: 'assert' | 'warn' | 'off',\n): void {\n  if (mode === 'off' || cell.error) 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 never reported LLM usage via ctx.cost.observe/observeTokens (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: { artifact: TArtifact; scenario: TScenario; signal: AbortSignal },\n): Promise<JudgeScore> {\n  return judge.score(input)\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 skippedCell<TScenario extends Scenario, TArtifact>(\n  slot: { scenario: TScenario; rep: number; cellId: string; cellSeed: number },\n  reason: string,\n): CampaignCellResult<TArtifact> {\n  return {\n    cellId: slot.cellId,\n    scenarioId: slot.scenario.id,\n    rep: slot.rep,\n    artifact: null as unknown as TArtifact,\n    judgeScores: {},\n    costUsd: 0,\n    tokenUsage: { input: 0, output: 0 },\n    durationMs: 0,\n    seed: slot.cellSeed,\n    cached: false,\n    error: `skipped: ${reason}`,\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((j) => ({ name: j.name, dims: j.dimensions })),\n    dispatch: input.dispatchRef,\n    seed: input.seed,\n    reps: input.reps,\n  })\n}\n\nfunction computeAggregates<TArtifact>(\n  cells: CampaignCellResult<TArtifact>[],\n  judges: JudgeConfig<TArtifact>[],\n  seed: number,\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    totalCostUsd: cells.reduce((a, c) => a + c.costUsd, 0),\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 { 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\nfunction isStubRecord(rec: RunRecord): boolean {\n  return rec.tokenUsage.input === 0 && rec.tokenUsage.output === 0\n}\n\nfunction isUncostedRecord(rec: RunRecord): boolean {\n  return rec.tokenUsage.output > 0 && rec.costUsd === 0\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  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.tokenUsage.input\n    totalOutputTokens += rec.tokenUsage.output\n    totalCostUsd += rec.costUsd\n    if (isStubRecord(rec)) stubRecords++\n    else realRecords++\n    if (isUncostedRecord(rec)) 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  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    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 { 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)) 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'\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}\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, 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  }\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  }\n}\n"],"mappings":";;;;;;;;AAWA,SAAS,QAAAA,aAAY;;;AC0Cd,IAAM,wBAAN,cAAoC,eAAe;AAAA,EACxD,YACE,SACgB,QAChB;AACA,UAAM,qBAAqB,OAAO;AAFlB;AAAA,EAGlB;AAAA,EAHkB;AAIpB;AAEA,SAAS,aAAa,KAAyB;AAC7C,SAAO,IAAI,WAAW,UAAU,KAAK,IAAI,WAAW,WAAW;AACjE;AAEA,SAAS,iBAAiB,KAAyB;AACjD,SAAO,IAAI,WAAW,SAAS,KAAK,IAAI,YAAY;AACtD;AAOO,SAAS,0BACd,SACwB;AACxB,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,WAAW;AACnC,yBAAqB,IAAI,WAAW;AACpC,oBAAgB,IAAI;AACpB,QAAI,aAAa,GAAG,EAAG;AAAA,QAClB;AACL,QAAI,iBAAiB,GAAG,EAAG;AAAA,EAC7B;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,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;;;ACjKA,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,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;;;AC5OA,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,EAAG,QAAO;AAC/B,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;AAmCvB,SAAS,oBAAqC;AACnD,QAAM,cAAc,cAAc,YAAY,GAAG;AACjD,QAAM,EAAE,YAAAC,aAAY,WAAW,cAAAC,eAAc,cAAc,IAAI;AAAA,IAC7D;AAAA,EACF;AACA,SAAO;AAAA,IACL,UAAU,KAAK;AACb,UAAI,CAACD,YAAW,GAAG,EAAG,WAAU,KAAK,EAAE,WAAW,KAAK,CAAC;AAAA,IAC1D;AAAA,IACA,OAAO,MAAM;AACX,aAAOA,YAAW,IAAI;AAAA,IACxB;AAAA,IACA,KAAK,MAAM;AACT,UAAI;AACF,eAAOC,cAAa,MAAM,MAAM;AAAA,MAClC,QAAQ;AACN,eAAO;AAAA,MACT;AAAA,IACF;AAAA,IACA,MAAM,MAAM,SAAS;AACnB,oBAAc,MAAM,OAAqB;AAAA,IAC3C;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,EACF;AACF;;;AJ6CA,eAAsB,YACpB,MAC+C;AAC/C,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,YAAY,KAAK,aAAa;AACpC,QAAM,iBAAiB,KAAK,kBAAkB;AAC9C,QAAM,MAAM,KAAK,QAAQ,MAAM,oBAAI,KAAK;AACxC,QAAM,SAAS,KAAK,UAAU,CAAC;AAC/B,QAAM,UAAU,KAAK,WAAW,kBAAkB;AAElD,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;AAE7B,QAAM,eAAe,oBAAoB;AAAA,IACvC,WAAW,KAAK;AAAA,IAChB;AAAA,IACA,aAAa,eAAe,KAAK,UAAU,KAAK,WAAW;AAAA,IAC3D;AAAA,IACA;AAAA,EACF,CAAC;AAED,QAAM,YAAY,IAAI;AACtB,QAAM,QAAyC,CAAC;AAChD,QAAM,kBAA0C,CAAC;AAGjD,QAAM,WAAW,kBAAkB,KAAK,WAAW,MAAM,IAAI;AAG7D,MAAI,eAAe;AACnB,MAAI,qBAAqB;AACzB,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,cAAI,oBAAoB;AACtB,qBAAS,KAAK,YAAY,MAAM,sBAAsB,CAAC;AACvD;AAAA,UACF;AACA,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,UAC1B,CAAC;AACD,mBAAS,KAAK,OAAO,IAAI;AACzB,2BAAiB,OAAO,MAAM,KAAK,eAAe,MAAM;AACxD,0BAAgB,OAAO,KAAK;AAC5B,iBAAO,OAAO,iBAAiB,OAAO,eAAe;AACrD,cAAI,KAAK,gBAAgB,UAAa,gBAAgB,KAAK,aAAa;AACtE,iCAAqB;AAAA,UACvB;AAEA,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,aAAa;AAAA,IACjB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,SAAO;AAAA,IACL;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,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,MAAM,EAAE,KAAK,EAAE;AAAA,EACnE;AACF;AAgBA,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;AAGzB,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,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,MAAI,YAAY;AAChB,QAAM,cAAkC,EAAE,OAAO,GAAG,QAAQ,EAAE;AAC9D,MAAI;AACJ,QAAM,OAA0B;AAAA,IAC9B,QAAQ,QAAQ,QAAQ;AACtB,mBAAa;AACb,YAAM,KAAK,QAAQ,MAAM,IAAI,EAAE,WAAW,OAAO,CAAC,EAAE,IAAI;AAAA,IAC1D;AAAA,IACA,cAAc,OAAO;AACnB,kBAAY,SAAS,MAAM;AAC3B,kBAAY,UAAU,MAAM;AAC5B,UAAI,MAAM,OAAQ,aAAY,UAAU,YAAY,UAAU,KAAK,MAAM;AAAA,IAC3E;AAAA,IACA,aAAa,OAAO;AAClB,YAAM,UAAU,OAAO,KAAK;AAC5B,UAAI,QAAS,iBAAgB;AAAA,IAC/B;AAAA,IACA,UAAU;AACR,aAAO;AAAA,IACT;AAAA,IACA,SAAS;AACP,aAAO,EAAE,GAAG,YAAY;AAAA,IAC1B;AAAA,IACA,gBAAgB;AACd,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;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,oBAAY,MAAM,IAAI,IAAI,MAAM,aAAa,OAAO;AAAA,UAClD;AAAA,UACA,UAAU,KAAK,KAAK;AAAA,UACpB,QAAQ,KAAK;AAAA,QACf,CAAC;AAAA,MACH,SAAS,KAAK;AACZ,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,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;AAAA,IACT,YAAY,EAAE,GAAG,YAAY;AAAA,IAC7B,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;AAsCO,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,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;AAED,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,YAAY,MAAM;AAAA,IAClB;AAAA,IACA,YAAY,MAAM,SAAS;AAAA,IAC3B;AAAA,EACF;AACF;AASA,SAAS,iBACP,MACA,MACM;AACN,MAAI,SAAS,SAAS,KAAK,MAAO;AAClC,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,SAAO,MAAM,MAAM,KAAK;AAC1B;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,YACP,MACA,QAC+B;AAC/B,SAAO;AAAA,IACL,QAAQ,KAAK;AAAA,IACb,YAAY,KAAK,SAAS;AAAA,IAC1B,KAAK,KAAK;AAAA,IACV,UAAU;AAAA,IACV,aAAa,CAAC;AAAA,IACd,SAAS;AAAA,IACT,YAAY,EAAE,OAAO,GAAG,QAAQ,EAAE;AAAA,IAClC,YAAY;AAAA,IACZ,MAAM,KAAK;AAAA,IACX,QAAQ;AAAA,IACR,OAAO,YAAY,MAAM;AAAA,EAC3B;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,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,EAAE,WAAW,EAAE;AAAA,IACtE,UAAU,MAAM;AAAA,IAChB,MAAM,MAAM;AAAA,IACZ,MAAM,MAAM;AAAA,EACd,CAAC;AACH;AAEA,SAAS,kBACP,OACA,QACA,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,cAAc,MAAM,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,SAAS,CAAC;AAAA,IACrD,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","existsSync","readFileSync","join"]}

package/dist/chunk-GY4SYVPJ.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/llm-client.ts"],"sourcesContent":["/**\n * LLM client with graceful degrade.\n *\n * OpenAI-compatible `/v1/chat/completions` client with:\n *   - Exponential-backoff retry on 429 + 5xx gateway errors (502/503/504).\n *   - Retry on transient network errors (fetch failed, AbortError, ECONNRESET).\n *   - Graceful json_schema → json_object degrade on 400 with schema-reject body.\n *   - Fenced-JSON stripping (```json ... ```) for models that wrap structured output.\n *   - Configurable base URL + api key / bearer, works with LiteLLM proxies, OpenAI\n *     directly, cli-bridge subscriptions, and any router that speaks the spec.\n *\n * Usage:\n *   const { value, result } = await callLlmJson<MyType>(\n *     { model: 'gpt-4o', messages: [...], jsonSchema: { name: 'x', schema: {...} } },\n *     { baseUrl: 'https://router.tangle.tools/v1', apiKey: process.env.KEY },\n *   )\n *\n * This is THE llm-calling seam for agent-eval primitives that need structured\n * output (semantic concept judge, reviewer directives, critic scores). Primitives\n * that need free-form text use `callLlm` and parse output themselves.\n */\n\nimport { AgentEvalError, CaptureIntegrityError } from './errors'\nimport {\n  defaultProviderRedactor,\n  type ProviderRedactor,\n  providerFromBaseUrl,\n  type RawProviderEvent,\n  type RawProviderSink,\n} from './trace/raw-provider-sink'\n\n// ─── Types ──────────────────────────────────────────────────────────────\n\nexport interface LlmMessage {\n  role: 'system' | 'user' | 'assistant'\n  /**\n   * Either a plain text content string OR a multimodal content array\n   * (text + image_url parts) for vision-capable models.\n   */\n  content:\n    | string\n    | Array<\n        | { type: 'text'; text: string }\n        | { type: 'image_url'; image_url: { url: string; detail?: 'auto' | 'low' | 'high' } }\n      >\n}\n\nexport interface LlmCallRequest {\n  model: string\n  messages: LlmMessage[]\n  /** Optional JSON-mode response format (response_format: json_object). */\n  jsonMode?: boolean\n  /** Optional structured output via JSON Schema. Falls back to json_object on 400. */\n  jsonSchema?: { name: string; schema: Record<string, unknown> }\n  temperature?: number\n  maxTokens?: number\n  /** Per-call timeout, default 300s. */\n  timeoutMs?: number\n}\n\nexport interface LlmUsage {\n  promptTokens: number\n  completionTokens: number\n  totalTokens: number\n  /** Proxies populate this when prompt caching is on. */\n  cachedPromptTokens?: number\n}\n\nexport interface LlmCallResult {\n  /** The text content of the first choice. Empty string if none. */\n  content: string\n  usage: LlmUsage\n  /**\n   * Cost in USD. Pulled from proxy's `_response_cost` field when present;\n   * `null` when neither the proxy nor the caller can derive it.\n   */\n  costUsd: number | null\n  /** Model name actually used (echoed from response). */\n  model: string\n  /** Wall-clock duration of the HTTP call (last attempt, if retried). */\n  durationMs: number\n  /**\n   * `finish_reason` echoed from the first choice (`stop`, `length`,\n   * `content_filter`, `tool_calls`, ...). `null` when the provider omits it.\n   * Exposed so a free-form `callLlm` caller CAN detect a truncated answer\n   * (`length`) instead of treating a cut-off completion as complete. Note:\n   * `callLlm` does not itself reject on it — acting on this signal is the\n   * caller's responsibility (in-repo free-form drivers do not yet enforce it).\n   */\n  finishReason?: string | null\n  /**\n   * True when `content.trim()` is empty. An empty completion is a silent zero\n   * for free-form `callLlm` callers; this flag is the signal a caller can\n   * inspect to fail loud rather than proceed on an empty string. `callLlm`\n   * surfaces it but does not throw on it.\n   */\n  contentEmpty?: boolean\n  /** Raw response body. */\n  raw: Record<string, unknown>\n}\n\nexport class LlmCallError extends AgentEvalError {\n  constructor(\n    message: string,\n    public readonly status: number,\n    public readonly body: string,\n    public readonly model: string,\n  ) {\n    super('judge', message)\n  }\n}\n\nexport interface LlmClientOptions {\n  /** Base URL (without trailing slash). Must end at the `/v1` prefix. */\n  baseUrl?: string\n  /** Bearer token — either `apiKey` or `bearer` populates `Authorization: Bearer ...`. */\n  apiKey?: string\n  bearer?: string\n  /** Override for the `Authorization` header (e.g. `X-Auth: ...`). Takes precedence over apiKey/bearer. */\n  authHeader?: { name: string; value: string }\n  /** Default timeout in ms. Per-call can override. */\n  defaultTimeoutMs?: number\n  /**\n   * Caller-supplied abort signal — e.g. a campaign-wide cancel. Linked to\n   * each attempt's per-attempt timeout controller, so aborting it cancels\n   * the in-flight fetch. A caller abort is FATAL: it is not retried even\n   * though an AbortError otherwise matches the transient patterns.\n   */\n  signal?: AbortSignal\n  /**\n   * Cross-attempt wall-clock budget in ms, measured from the first attempt.\n   * Before launching each attempt the loop checks the remaining budget and\n   * stops retrying once it is exhausted, rather than waiting the full\n   * per-attempt timeout on every retry. Bounds total time independent of\n   * `maxRetries` × `timeoutMs`.\n   */\n  deadlineMs?: number\n  /** Max retry attempts on retriable errors. Default 3 (1 initial + 2 retries). */\n  maxRetries?: number\n  /** Fetch implementation — defaults to global `fetch`. Override for custom transport (e.g. tests). */\n  fetch?: typeof fetch\n  /**\n   * Optional raw HTTP capture sink. When provided, every request, response,\n   * and error (across all retry attempts) is recorded to the sink, with auth\n   * headers and credential-shaped body fields redacted by default. This is\n   * the layer-1 forensics primitive: structured `LlmSpan`s record intent,\n   * raw events record what actually crossed the wire.\n   */\n  rawSink?: RawProviderSink\n  /**\n   * Logical provider id attached to raw events. When omitted, derived from\n   * `baseUrl` via `providerFromBaseUrl`.\n   */\n  provider?: string\n  /** Trace context attached to raw events; populated by emitter-aware callers. */\n  traceContext?: { runId?: string; spanId?: string }\n  /** Override the redaction strategy for this call. Defaults to `defaultProviderRedactor`. */\n  redactor?: ProviderRedactor\n}\n\n// ─── Internals ──────────────────────────────────────────────────────────\n\nconst DEFAULT_BASE_URL = 'https://router.tangle.tools/v1'\n// Flagship / reasoning models routinely take several minutes on large prompts (a\n// reflection over many failures, a long tool transcript). A tight cap aborts a\n// legitimately-slow but healthy call — and because every retry attempt re-uses\n// the same window, such a model aborts on ALL attempts and the loop throws. The\n// default is generous enough to let those complete, bounded enough that a truly\n// hung call still fails over after retries, and tunable per deployment via\n// TANGLE_LLM_TIMEOUT_MS. Per-call `req.timeoutMs` / `opts.defaultTimeoutMs`\n// still win for callers that know their model's latency.\nconst DEFAULT_TIMEOUT_MS = Number(process.env.TANGLE_LLM_TIMEOUT_MS) || 300_000\nconst DEFAULT_MAX_RETRIES = Number(process.env.TANGLE_LLM_MAX_RETRIES) || 3\n\nconst RETRYABLE_STATUS = new Set([429, 502, 503, 504])\n\n/**\n * Transient transport/network error signatures, matched against an error's\n * name, message, and `code`. Covers fetch/undici network failures, aborts\n * and timeouts, and — critically — HTTP/2 transport faults a keep-alive\n * connection raises mid-response: `terminated`, `NGHTTP2_INTERNAL_ERROR`,\n * `UND_ERR_*`, `other side closed`. Those last ones carry no clean HTTP\n * status; unrecognised, they escape the retry loop and surface as an\n * uncaught rejection.\n */\nconst TRANSIENT_ERROR_PATTERNS: readonly RegExp[] = [\n  /AbortError/i,\n  /TimeoutError/i,\n  /this operation was aborted/i,\n  /fetch failed/i,\n  /ECONNRESET/i,\n  /ETIMEDOUT/i,\n  /EAI_AGAIN/i,\n  /socket hang up/i,\n  /stream.*ended.*unexpectedly/i,\n  /terminated/i,\n  /other side closed/i,\n  /NGHTTP2/i,\n  /UND_ERR/i,\n]\n\n/**\n * True when an error is a transient transport/network fault worth retrying,\n * as opposed to a deterministic failure (4xx schema reject, JSON parse) that\n * a retry cannot fix. Inspects `LlmCallError.status`, then the error's\n * name/message/code, then recurses into `error.cause` — undici nests the\n * real socket fault one or more levels under `.cause`.\n *\n * This is THE retry classifier for the package: `callLlm` and\n * `withJudgeRetry` both route through it, so a connection-class error is\n * treated identically whether it surfaces in the HTTP client or a\n * TCloud-backed judge.\n */\nexport function isTransientLlmError(err: unknown): boolean {\n  return classifyTransient(err, 0)\n}\n\nfunction classifyTransient(err: unknown, depth: number): boolean {\n  if (err instanceof LlmCallError) return RETRYABLE_STATUS.has(err.status)\n  if (!(err instanceof Error)) return false\n  // Foreign errors (e.g. a TCloud judge SDK error) can carry a numeric HTTP\n  // status without being an LlmCallError — a retryable status is decisive.\n  const status = (err as { status?: unknown }).status\n  if (typeof status === 'number' && RETRYABLE_STATUS.has(status)) return true\n  const code = (err as { code?: unknown }).code\n  const haystack = `${err.name}\\n${err.message}\\n${typeof code === 'string' ? code : ''}`\n  if (TRANSIENT_ERROR_PATTERNS.some((p) => p.test(haystack))) return true\n  const cause = (err as { cause?: unknown }).cause\n  if (depth < 4 && cause instanceof Error && cause !== err) {\n    return classifyTransient(cause, depth + 1)\n  }\n  return false\n}\n\nfunction parseRetryAfter(headers: Headers): number | null {\n  const h = headers.get('retry-after')\n  if (!h) return null\n  const asNumber = Number(h)\n  if (Number.isFinite(asNumber) && asNumber > 0) return asNumber * 1000\n  const asDate = Date.parse(h)\n  if (Number.isFinite(asDate)) return Math.max(0, asDate - Date.now())\n  return null\n}\n\n/** Exponential backoff: 500ms, 1s, 2s, 4s, ... capped at 16s. Attempt is 0-indexed. */\nexport function backoffMs(attempt: number): number {\n  return Math.min(500 * 2 ** attempt, 16_000)\n}\n\nfunction buildHeaders(opts: LlmClientOptions): Record<string, string> {\n  const headers: Record<string, string> = {\n    'Content-Type': 'application/json',\n    Accept: 'application/json',\n  }\n  if (opts.authHeader) {\n    headers[opts.authHeader.name] = opts.authHeader.value\n  } else if (opts.bearer || opts.apiKey) {\n    headers.Authorization = `Bearer ${opts.bearer ?? opts.apiKey}`\n  }\n  return headers\n}\n\nfunction isSchemaRejection(status: number, body: string): boolean {\n  if (status !== 400) return false\n  const lower = body.toLowerCase()\n  return (\n    lower.includes('response_format') ||\n    lower.includes('json_schema') ||\n    lower.includes('is unavailable') ||\n    lower.includes('not supported')\n  )\n}\n\nfunction buildBody(req: LlmCallRequest, forceJsonObject: boolean): Record<string, unknown> {\n  const body: Record<string, unknown> = {\n    model: req.model,\n    messages: req.messages,\n    temperature: req.temperature ?? 0,\n  }\n  if (req.maxTokens != null) {\n    if (usesMaxCompletionTokens(req.model)) body.max_completion_tokens = req.maxTokens\n    else body.max_tokens = req.maxTokens\n  }\n\n  if (req.jsonSchema && !forceJsonObject) {\n    body.response_format = {\n      type: 'json_schema',\n      json_schema: { name: req.jsonSchema.name, schema: req.jsonSchema.schema, strict: true },\n    }\n  } else if (req.jsonMode || req.jsonSchema) {\n    body.response_format = { type: 'json_object' }\n  }\n\n  return body\n}\n\nfunction usesMaxCompletionTokens(model: string): boolean {\n  return /^gpt-5(?:[.-]|$)/i.test(model)\n}\n\nasync function sleep(ms: number): Promise<void> {\n  return new Promise((resolve) => setTimeout(resolve, ms))\n}\n\n/**\n * Combine the per-attempt timeout signal with an optional caller signal into\n * one signal the fetch listens on. Prefers the native `AbortSignal.any`; falls\n * back to manual wiring on runtimes that predate it. The caller signal is also\n * propagated to the timeout controller so aborting it cancels the in-flight\n * fetch immediately.\n */\nfunction linkSignals(timeoutController: AbortController, caller?: AbortSignal): AbortSignal {\n  if (!caller) return timeoutController.signal\n  if (typeof (AbortSignal as { any?: unknown }).any === 'function') {\n    return AbortSignal.any([timeoutController.signal, caller])\n  }\n  if (caller.aborted) {\n    timeoutController.abort()\n  } else {\n    caller.addEventListener('abort', () => timeoutController.abort(), { once: true })\n  }\n  return timeoutController.signal\n}\n\n/** True once the cross-attempt wall-clock budget (if any) is exhausted. */\nfunction deadlineExceeded(start: number, deadlineMs: number | undefined): boolean {\n  return deadlineMs != null && Date.now() - start >= deadlineMs\n}\n\n// ─── Public API ─────────────────────────────────────────────────────────\n\n/**\n * Strip a ```json / ``` code fence if the model emitted one.\n * Idempotent for naked JSON. Some models (claude-code via router, certain\n * deepseek models) wrap output even under json_object.\n */\nexport function stripFencedJson(raw: string): string {\n  const trimmed = raw.trim()\n  const m = trimmed.match(/^```(?:json)?\\s*\\n?([\\s\\S]*?)\\n?```\\s*$/)\n  return m ? m[1]!.trim() : trimmed\n}\n\nexport function extractJsonPayload(raw: string): string {\n  const stripped = stripFencedJson(raw)\n  try {\n    JSON.parse(stripped)\n    return stripped\n  } catch {\n    // A response that declares a JSON root must parse as that complete root.\n    // Scanning onward could turn a truncated object into one of its valid nested\n    // arrays or objects and silently change the response schema.\n    if (stripped.startsWith('{') || stripped.startsWith('[')) return stripped\n  }\n\n  // Only prose-leading responses may contain a recoverable JSON payload.\n  const starts = [...stripped.matchAll(/[[{]/g)]\n    .map((match) => match.index)\n    .filter((index) => index != null)\n  for (const start of starts) {\n    const candidate = extractBalancedJson(stripped, start)\n    if (!candidate) continue\n    try {\n      JSON.parse(candidate)\n      return candidate\n    } catch {\n      // Keep scanning; earlier braces may belong to prose.\n    }\n  }\n\n  return stripped\n}\n\nfunction extractBalancedJson(input: string, start: number): string | null {\n  const opener = input[start]\n  const closer = opener === '{' ? '}' : opener === '[' ? ']' : null\n  if (!closer) return null\n\n  const stack: string[] = [closer]\n  let isInString = false\n  let isEscaped = false\n\n  for (let i = start + 1; i < input.length; i++) {\n    const char = input[i]!\n    if (isEscaped) {\n      isEscaped = false\n      continue\n    }\n    if (char === '\\\\') {\n      isEscaped = isInString\n      continue\n    }\n    if (char === '\"') {\n      isInString = !isInString\n      continue\n    }\n    if (isInString) continue\n\n    if (char === '{') stack.push('}')\n    else if (char === '[') stack.push(']')\n    else if (char === stack[stack.length - 1]) {\n      stack.pop()\n      if (stack.length === 0) return input.slice(start, i + 1)\n    }\n  }\n\n  return null\n}\n\n/**\n * Low-level call. Returns raw content + usage + cost. Retries on transient\n * failures; does NOT degrade schema here — callers that want graceful\n * degrade use `callLlmJson`.\n */\nexport async function callLlm(\n  req: LlmCallRequest,\n  opts: LlmClientOptions = {},\n): Promise<LlmCallResult> {\n  const baseUrl = (opts.baseUrl ?? DEFAULT_BASE_URL).replace(/\\/+$/, '')\n  const url = `${baseUrl}/chat/completions`\n  const endpoint = '/chat/completions'\n  const timeoutMs = req.timeoutMs ?? opts.defaultTimeoutMs ?? DEFAULT_TIMEOUT_MS\n  const maxRetries = opts.maxRetries ?? DEFAULT_MAX_RETRIES\n  const fetchFn = opts.fetch ?? globalThis.fetch\n  const headers = buildHeaders(opts)\n  const provider = opts.provider ?? providerFromBaseUrl(baseUrl)\n  const sink = opts.rawSink\n  const redactor = opts.redactor ?? defaultProviderRedactor\n  const traceContext = opts.traceContext\n  const callerSignal = opts.signal\n  const deadlineMs = opts.deadlineMs\n  const deadlineStart = Date.now()\n\n  let lastErr: unknown\n  for (let attempt = 0; attempt < maxRetries; attempt++) {\n    // A caller cancel is fatal — never retried. Checking before each attempt\n    // means an already-aborted signal short-circuits without firing fetch.\n    if (callerSignal?.aborted) {\n      throw new DOMException('callLlm aborted by caller signal', 'AbortError')\n    }\n    // Stop retrying once the cross-attempt budget is spent rather than burning\n    // a full per-attempt timeout on each remaining retry.\n    if (attempt > 0 && deadlineExceeded(deadlineStart, deadlineMs)) {\n      throw lastErr instanceof Error ? lastErr : new Error(String(lastErr))\n    }\n    const controller = new AbortController()\n    const attemptSignal = linkSignals(controller, callerSignal)\n    const timeoutHandle = setTimeout(() => controller.abort(), timeoutMs)\n    const started = Date.now()\n    const requestBody = buildBody(req, false)\n    let attemptErrorRecorded = false\n    if (sink) {\n      await recordRaw(sink, redactor, {\n        eventId: cryptoEventId(),\n        runId: traceContext?.runId,\n        spanId: traceContext?.spanId,\n        provider,\n        model: req.model,\n        endpoint,\n        baseUrl,\n        attemptIndex: attempt,\n        direction: 'request',\n        timestamp: started,\n        requestHeaders: headers,\n        requestBody,\n        redactedFields: [],\n      })\n    }\n\n    try {\n      const res = await fetchFn(url, {\n        method: 'POST',\n        headers,\n        body: JSON.stringify(requestBody),\n        signal: attemptSignal,\n      })\n      clearTimeout(timeoutHandle)\n      const responseHeaders = sink ? headersToObject(res.headers) : undefined\n\n      if (!res.ok) {\n        const body = await res.text()\n        if (sink) {\n          await recordRaw(sink, redactor, {\n            eventId: cryptoEventId(),\n            runId: traceContext?.runId,\n            spanId: traceContext?.spanId,\n            provider,\n            model: req.model,\n            endpoint,\n            baseUrl,\n            attemptIndex: attempt,\n            direction: 'error',\n            timestamp: Date.now(),\n            durationMs: Date.now() - started,\n            statusCode: res.status,\n            responseHeaders,\n            responseBody: body,\n            errorMessage: `HTTP ${res.status}`,\n            redactedFields: [],\n          })\n          attemptErrorRecorded = true\n        }\n        const err = new LlmCallError(\n          `LLM call ${res.status}: ${body.slice(0, 300)}`,\n          res.status,\n          body,\n          req.model,\n        )\n        if (\n          RETRYABLE_STATUS.has(res.status) &&\n          attempt < maxRetries - 1 &&\n          !deadlineExceeded(deadlineStart, deadlineMs)\n        ) {\n          lastErr = err\n          const retryAfter = parseRetryAfter(res.headers)\n          await sleep(retryAfter ?? backoffMs(attempt))\n          continue\n        }\n        throw err\n      }\n\n      const text = await res.text()\n      let json: Record<string, unknown>\n      try {\n        json = JSON.parse(text) as Record<string, unknown>\n      } catch (parseErr) {\n        if (sink) {\n          await recordRaw(sink, redactor, {\n            eventId: cryptoEventId(),\n            runId: traceContext?.runId,\n            spanId: traceContext?.spanId,\n            provider,\n            model: req.model,\n            endpoint,\n            baseUrl,\n            attemptIndex: attempt,\n            direction: 'error',\n            timestamp: Date.now(),\n            durationMs: Date.now() - started,\n            statusCode: res.status,\n            responseHeaders,\n            responseBody: text,\n            errorMessage: `non-JSON response: ${parseErr instanceof Error ? parseErr.message : String(parseErr)}`,\n            redactedFields: [],\n          })\n          attemptErrorRecorded = true\n        }\n        throw parseErr\n      }\n      if (sink) {\n        await recordRaw(sink, redactor, {\n          eventId: cryptoEventId(),\n          runId: traceContext?.runId,\n          spanId: traceContext?.spanId,\n          provider,\n          model: req.model,\n          endpoint,\n          baseUrl,\n          attemptIndex: attempt,\n          direction: 'response',\n          timestamp: Date.now(),\n          durationMs: Date.now() - started,\n          statusCode: res.status,\n          responseHeaders,\n          responseBody: json,\n          redactedFields: [],\n        })\n      }\n      const choice = (\n        json.choices as\n          | Array<{ message?: { content?: string }; finish_reason?: string | null }>\n          | undefined\n      )?.[0]\n      const usageRaw = (json.usage as Record<string, unknown> | undefined) ?? {}\n      const costFromProxy = (json._response_cost ?? json.cost_usd) as number | undefined\n      const content = choice?.message?.content ?? ''\n\n      return {\n        content,\n        finishReason: choice?.finish_reason ?? null,\n        contentEmpty: content.trim().length === 0,\n        usage: {\n          promptTokens: Number(usageRaw.prompt_tokens ?? 0),\n          completionTokens: Number(usageRaw.completion_tokens ?? 0),\n          totalTokens: Number(usageRaw.total_tokens ?? 0),\n          cachedPromptTokens:\n            usageRaw.prompt_tokens_details && typeof usageRaw.prompt_tokens_details === 'object'\n              ? Number(\n                  (usageRaw.prompt_tokens_details as Record<string, unknown>).cached_tokens ?? 0,\n                )\n              : undefined,\n        },\n        costUsd: typeof costFromProxy === 'number' ? costFromProxy : null,\n        model: (json.model as string) ?? req.model,\n        durationMs: Date.now() - started,\n        raw: json,\n      }\n    } catch (err) {\n      clearTimeout(timeoutHandle)\n      lastErr = err\n      // A caller cancel is fatal even though an AbortError matches the\n      // transient patterns — a cancelled call must surface immediately, not\n      // be retried against the same dead intent.\n      if (callerSignal?.aborted) {\n        if (sink && !attemptErrorRecorded) {\n          await recordRaw(sink, redactor, {\n            eventId: cryptoEventId(),\n            runId: traceContext?.runId,\n            spanId: traceContext?.spanId,\n            provider,\n            model: req.model,\n            endpoint,\n            baseUrl,\n            attemptIndex: attempt,\n            direction: 'error',\n            timestamp: Date.now(),\n            durationMs: Date.now() - started,\n            errorMessage: err instanceof Error ? err.message : String(err),\n            redactedFields: [],\n          })\n        }\n        throw err\n      }\n      if (sink && !attemptErrorRecorded) {\n        // Record only if neither the !res.ok branch nor the JSON.parse catch\n        // already produced an error event for this attempt. Covers network\n        // failures, timeouts, and aborts.\n        await recordRaw(sink, redactor, {\n          eventId: cryptoEventId(),\n          runId: traceContext?.runId,\n          spanId: traceContext?.spanId,\n          provider,\n          model: req.model,\n          endpoint,\n          baseUrl,\n          attemptIndex: attempt,\n          direction: 'error',\n          timestamp: Date.now(),\n          durationMs: Date.now() - started,\n          errorMessage: err instanceof Error ? err.message : String(err),\n          redactedFields: [],\n        })\n      }\n      if (\n        attempt < maxRetries - 1 &&\n        isTransientLlmError(err) &&\n        !deadlineExceeded(deadlineStart, deadlineMs)\n      ) {\n        await sleep(backoffMs(attempt))\n        continue\n      }\n      throw err\n    }\n  }\n  throw lastErr instanceof Error ? lastErr : new Error(String(lastErr))\n}\n\nasync function recordRaw(\n  sink: RawProviderSink,\n  redactor: ProviderRedactor,\n  event: RawProviderEvent,\n): Promise<void> {\n  // Errors from sinks must not crash the LLM call. Forensic capture is\n  // best-effort; the structured trace is the system of record.\n  try {\n    await sink.record(redactor(event))\n  } catch {\n    // Intentionally swallowed.\n  }\n}\n\nfunction headersToObject(h: Headers): Record<string, string> {\n  const out: Record<string, string> = {}\n  h.forEach((value, key) => {\n    out[key] = value\n  })\n  return out\n}\n\nfunction cryptoEventId(): string {\n  if (typeof globalThis.crypto?.randomUUID === 'function') return globalThis.crypto.randomUUID()\n  return `${Date.now().toString(36)}-${Math.random().toString(36).slice(2, 10)}`\n}\n\n/**\n * Structured-output call. Returns parsed JSON plus the raw result envelope.\n * Degrades `jsonSchema` → `jsonMode` on a 400 that names the schema param —\n * critical for deepseek-v3/v4, kimi-k2.6, and other models that don't accept\n * the `response_format.json_schema` shape but DO accept `json_object`.\n */\nexport async function callLlmJson<T = unknown>(\n  req: LlmCallRequest,\n  opts: LlmClientOptions = {},\n): Promise<{ value: T; result: LlmCallResult }> {\n  try {\n    const result = await callLlm({ ...req, jsonMode: req.jsonMode ?? !req.jsonSchema }, opts)\n    const value = parseJsonResult<T>(result)\n    return { value, result }\n  } catch (err) {\n    if (err instanceof LlmCallError && isSchemaRejection(err.status, err.body) && req.jsonSchema) {\n      // Degrade to json_object + retry.\n      const degradedReq: LlmCallRequest = { ...req, jsonMode: true, jsonSchema: undefined }\n      const result = await callLlm(degradedReq, opts)\n      const value = parseJsonResult<T>(result)\n      return { value, result }\n    }\n    throw err\n  }\n}\n\nfunction parseJsonResult<T>(result: LlmCallResult): T {\n  if (result.finishReason === 'length') {\n    throw new Error(\n      `LLM returned truncated JSON content (model=${result.model}, finishReason=length)`,\n    )\n  }\n  return parseJsonSafely<T>(result.content, result.model)\n}\n\nfunction parseJsonSafely<T>(content: string, model: string): T {\n  const stripped = extractJsonPayload(content)\n  try {\n    return JSON.parse(stripped) as T\n  } catch (err) {\n    throw new Error(\n      `LLM returned non-JSON content (model=${model}): ${\n        err instanceof Error ? err.message : String(err)\n      }\\n--- raw content ---\\n${content.slice(0, 800)}`,\n    )\n  }\n}\n\n// ─── Route assertion ────────────────────────────────────────────────────\n\nexport type LlmRouteAssertionReason =\n  | 'no_explicit_base_url'\n  | 'base_url_blocked'\n  | 'base_url_not_allowed'\n  | 'no_auth'\n  | 'wrong_provider'\n\nexport class LlmRouteAssertionError extends CaptureIntegrityError {\n  constructor(\n    message: string,\n    public readonly reason: LlmRouteAssertionReason,\n    public readonly baseUrl: string,\n  ) {\n    super(message)\n  }\n}\n\nexport interface LlmRouteRequirements {\n  /**\n   * Throw if `opts.baseUrl` is undefined, i.e. the call would fall back to\n   * `DEFAULT_BASE_URL`. Set this for evaluation runs where silently using\n   * the public/free-tier router is a defect — the launch reviewer needs to\n   * know exactly which provider answered.\n   */\n  requireExplicitBaseUrl?: boolean\n  /**\n   * Allowlist of acceptable base URLs. Strings match by prefix\n   * (case-insensitive); RegExps test against the full base URL.\n   */\n  allowedBaseUrls?: Array<string | RegExp>\n  /** Blocklist that takes precedence over `allowedBaseUrls`. */\n  blockedBaseUrls?: Array<string | RegExp>\n  /** Throw if no auth header / api key is configured. */\n  requireAuth?: boolean\n  /**\n   * Logical provider id the configured `baseUrl` is expected to match (via\n   * `providerFromBaseUrl`). Mainly useful when paired with `requireExplicitBaseUrl`.\n   */\n  expectedProvider?: string\n}\n\n/**\n * Fail-loud assertion that the configured LLM client points at the route\n * the caller intends. Designed for the matrix-runner preflight: invoke\n * once before any LLM call to catch misconfiguration before a sweep burns\n * dollars on the wrong provider.\n *\n * Throws `LlmRouteAssertionError`. Pure — no I/O — so it's safe to call\n * from constructors and CI gates.\n */\nexport function assertLlmRoute(opts: LlmClientOptions, req: LlmRouteRequirements = {}): void {\n  const baseUrlExplicit = opts.baseUrl !== undefined\n  const baseUrl = (opts.baseUrl ?? DEFAULT_BASE_URL).replace(/\\/+$/, '')\n\n  if (req.requireExplicitBaseUrl && !baseUrlExplicit) {\n    throw new LlmRouteAssertionError(\n      `assertLlmRoute: requireExplicitBaseUrl set but opts.baseUrl is undefined; would fall back to ${DEFAULT_BASE_URL}.`,\n      'no_explicit_base_url',\n      baseUrl,\n    )\n  }\n\n  if (req.blockedBaseUrls?.some((p) => matchUrl(baseUrl, p))) {\n    throw new LlmRouteAssertionError(\n      `assertLlmRoute: baseUrl ${baseUrl} matches a blocked pattern.`,\n      'base_url_blocked',\n      baseUrl,\n    )\n  }\n\n  if (req.allowedBaseUrls && req.allowedBaseUrls.length > 0) {\n    const ok = req.allowedBaseUrls.some((p) => matchUrl(baseUrl, p))\n    if (!ok) {\n      throw new LlmRouteAssertionError(\n        `assertLlmRoute: baseUrl ${baseUrl} is not in the allowed list (${req.allowedBaseUrls.map(describePattern).join(', ')}).`,\n        'base_url_not_allowed',\n        baseUrl,\n      )\n    }\n  }\n\n  if (req.requireAuth && !opts.apiKey && !opts.bearer && !opts.authHeader) {\n    throw new LlmRouteAssertionError(\n      `assertLlmRoute: requireAuth set but no apiKey, bearer, or authHeader was supplied.`,\n      'no_auth',\n      baseUrl,\n    )\n  }\n\n  if (req.expectedProvider) {\n    const actual = opts.provider ?? providerFromBaseUrl(baseUrl)\n    if (actual !== req.expectedProvider) {\n      throw new LlmRouteAssertionError(\n        `assertLlmRoute: expected provider ${req.expectedProvider} but baseUrl ${baseUrl} resolves to ${actual}.`,\n        'wrong_provider',\n        baseUrl,\n      )\n    }\n  }\n}\n\nfunction matchUrl(url: string, pattern: string | RegExp): boolean {\n  if (pattern instanceof RegExp) return pattern.test(url)\n  return url.toLowerCase().startsWith(pattern.toLowerCase())\n}\n\nfunction describePattern(p: string | RegExp): string {\n  return p instanceof RegExp ? p.source : p\n}\n\n/**\n * Probe whether a model is reachable. Returns latency + null error on\n * success; `ok=false` + error message on any failure (HTTP, timeout,\n * network, parse). Designed for sweep preflights — fail loud at the\n * boundary before burning a 30-leaf run on a misconfigured router.\n *\n * Sends a tiny `ping` message with `maxTokens=64`. Reasoning models\n * (glm-5.1, deepseek-v4) can burn the entire budget on internal reasoning\n * for short prompts, so don't tighten this further. We don't validate\n * content; HTTP 200 means reachable.\n */\nexport async function probeLlm(\n  model: string,\n  opts: LlmClientOptions & { timeoutMs?: number } = {},\n): Promise<{ ok: boolean; latencyMs: number; error: string | null }> {\n  const start = Date.now()\n  try {\n    await callLlm(\n      {\n        model,\n        messages: [{ role: 'user', content: 'ping' }],\n        maxTokens: 64,\n        timeoutMs: opts.timeoutMs ?? 30_000,\n      },\n      opts,\n    )\n    return { ok: true, latencyMs: Date.now() - start, error: null }\n  } catch (err) {\n    return {\n      ok: false,\n      latencyMs: Date.now() - start,\n      error: err instanceof Error ? err.message : String(err),\n    }\n  }\n}\n\n/**\n * Stateful client — construct once with defaults, call many times.\n * Thin wrapper around the free functions; exists for callers that want\n * to inject a single configured instance into multiple primitives.\n */\nexport class LlmClient {\n  constructor(private readonly opts: LlmClientOptions = {}) {}\n\n  call(req: LlmCallRequest, per?: LlmClientOptions): Promise<LlmCallResult> {\n    return callLlm(req, { ...this.opts, ...per })\n  }\n\n  callJson<T = unknown>(\n    req: LlmCallRequest,\n    per?: LlmClientOptions,\n  ): Promise<{ value: T; result: LlmCallResult }> {\n    return callLlmJson<T>(req, { ...this.opts, ...per })\n  }\n}\n"],"mappings":";;;;;;;;;;AAqGO,IAAM,eAAN,cAA2B,eAAe;AAAA,EAC/C,YACE,SACgB,QACA,MACA,OAChB;AACA,UAAM,SAAS,OAAO;AAJN;AACA;AACA;AAAA,EAGlB;AAAA,EALkB;AAAA,EACA;AAAA,EACA;AAIpB;AAoDA,IAAM,mBAAmB;AASzB,IAAM,qBAAqB,OAAO,QAAQ,IAAI,qBAAqB,KAAK;AACxE,IAAM,sBAAsB,OAAO,QAAQ,IAAI,sBAAsB,KAAK;AAE1E,IAAM,mBAAmB,oBAAI,IAAI,CAAC,KAAK,KAAK,KAAK,GAAG,CAAC;AAWrD,IAAM,2BAA8C;AAAA,EAClD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAcO,SAAS,oBAAoB,KAAuB;AACzD,SAAO,kBAAkB,KAAK,CAAC;AACjC;AAEA,SAAS,kBAAkB,KAAc,OAAwB;AAC/D,MAAI,eAAe,aAAc,QAAO,iBAAiB,IAAI,IAAI,MAAM;AACvE,MAAI,EAAE,eAAe,OAAQ,QAAO;AAGpC,QAAM,SAAU,IAA6B;AAC7C,MAAI,OAAO,WAAW,YAAY,iBAAiB,IAAI,MAAM,EAAG,QAAO;AACvE,QAAM,OAAQ,IAA2B;AACzC,QAAM,WAAW,GAAG,IAAI,IAAI;AAAA,EAAK,IAAI,OAAO;AAAA,EAAK,OAAO,SAAS,WAAW,OAAO,EAAE;AACrF,MAAI,yBAAyB,KAAK,CAAC,MAAM,EAAE,KAAK,QAAQ,CAAC,EAAG,QAAO;AACnE,QAAM,QAAS,IAA4B;AAC3C,MAAI,QAAQ,KAAK,iBAAiB,SAAS,UAAU,KAAK;AACxD,WAAO,kBAAkB,OAAO,QAAQ,CAAC;AAAA,EAC3C;AACA,SAAO;AACT;AAEA,SAAS,gBAAgB,SAAiC;AACxD,QAAM,IAAI,QAAQ,IAAI,aAAa;AACnC,MAAI,CAAC,EAAG,QAAO;AACf,QAAM,WAAW,OAAO,CAAC;AACzB,MAAI,OAAO,SAAS,QAAQ,KAAK,WAAW,EAAG,QAAO,WAAW;AACjE,QAAM,SAAS,KAAK,MAAM,CAAC;AAC3B,MAAI,OAAO,SAAS,MAAM,EAAG,QAAO,KAAK,IAAI,GAAG,SAAS,KAAK,IAAI,CAAC;AACnE,SAAO;AACT;AAGO,SAAS,UAAU,SAAyB;AACjD,SAAO,KAAK,IAAI,MAAM,KAAK,SAAS,IAAM;AAC5C;AAEA,SAAS,aAAa,MAAgD;AACpE,QAAM,UAAkC;AAAA,IACtC,gBAAgB;AAAA,IAChB,QAAQ;AAAA,EACV;AACA,MAAI,KAAK,YAAY;AACnB,YAAQ,KAAK,WAAW,IAAI,IAAI,KAAK,WAAW;AAAA,EAClD,WAAW,KAAK,UAAU,KAAK,QAAQ;AACrC,YAAQ,gBAAgB,UAAU,KAAK,UAAU,KAAK,MAAM;AAAA,EAC9D;AACA,SAAO;AACT;AAEA,SAAS,kBAAkB,QAAgB,MAAuB;AAChE,MAAI,WAAW,IAAK,QAAO;AAC3B,QAAM,QAAQ,KAAK,YAAY;AAC/B,SACE,MAAM,SAAS,iBAAiB,KAChC,MAAM,SAAS,aAAa,KAC5B,MAAM,SAAS,gBAAgB,KAC/B,MAAM,SAAS,eAAe;AAElC;AAEA,SAAS,UAAU,KAAqB,iBAAmD;AACzF,QAAM,OAAgC;AAAA,IACpC,OAAO,IAAI;AAAA,IACX,UAAU,IAAI;AAAA,IACd,aAAa,IAAI,eAAe;AAAA,EAClC;AACA,MAAI,IAAI,aAAa,MAAM;AACzB,QAAI,wBAAwB,IAAI,KAAK,EAAG,MAAK,wBAAwB,IAAI;AAAA,QACpE,MAAK,aAAa,IAAI;AAAA,EAC7B;AAEA,MAAI,IAAI,cAAc,CAAC,iBAAiB;AACtC,SAAK,kBAAkB;AAAA,MACrB,MAAM;AAAA,MACN,aAAa,EAAE,MAAM,IAAI,WAAW,MAAM,QAAQ,IAAI,WAAW,QAAQ,QAAQ,KAAK;AAAA,IACxF;AAAA,EACF,WAAW,IAAI,YAAY,IAAI,YAAY;AACzC,SAAK,kBAAkB,EAAE,MAAM,cAAc;AAAA,EAC/C;AAEA,SAAO;AACT;AAEA,SAAS,wBAAwB,OAAwB;AACvD,SAAO,oBAAoB,KAAK,KAAK;AACvC;AAEA,eAAe,MAAM,IAA2B;AAC9C,SAAO,IAAI,QAAQ,CAAC,YAAY,WAAW,SAAS,EAAE,CAAC;AACzD;AASA,SAAS,YAAY,mBAAoC,QAAmC;AAC1F,MAAI,CAAC,OAAQ,QAAO,kBAAkB;AACtC,MAAI,OAAQ,YAAkC,QAAQ,YAAY;AAChE,WAAO,YAAY,IAAI,CAAC,kBAAkB,QAAQ,MAAM,CAAC;AAAA,EAC3D;AACA,MAAI,OAAO,SAAS;AAClB,sBAAkB,MAAM;AAAA,EAC1B,OAAO;AACL,WAAO,iBAAiB,SAAS,MAAM,kBAAkB,MAAM,GAAG,EAAE,MAAM,KAAK,CAAC;AAAA,EAClF;AACA,SAAO,kBAAkB;AAC3B;AAGA,SAAS,iBAAiB,OAAe,YAAyC;AAChF,SAAO,cAAc,QAAQ,KAAK,IAAI,IAAI,SAAS;AACrD;AASO,SAAS,gBAAgB,KAAqB;AACnD,QAAM,UAAU,IAAI,KAAK;AACzB,QAAM,IAAI,QAAQ,MAAM,yCAAyC;AACjE,SAAO,IAAI,EAAE,CAAC,EAAG,KAAK,IAAI;AAC5B;AAEO,SAAS,mBAAmB,KAAqB;AACtD,QAAM,WAAW,gBAAgB,GAAG;AACpC,MAAI;AACF,SAAK,MAAM,QAAQ;AACnB,WAAO;AAAA,EACT,QAAQ;AAIN,QAAI,SAAS,WAAW,GAAG,KAAK,SAAS,WAAW,GAAG,EAAG,QAAO;AAAA,EACnE;AAGA,QAAM,SAAS,CAAC,GAAG,SAAS,SAAS,OAAO,CAAC,EAC1C,IAAI,CAAC,UAAU,MAAM,KAAK,EAC1B,OAAO,CAAC,UAAU,SAAS,IAAI;AAClC,aAAW,SAAS,QAAQ;AAC1B,UAAM,YAAY,oBAAoB,UAAU,KAAK;AACrD,QAAI,CAAC,UAAW;AAChB,QAAI;AACF,WAAK,MAAM,SAAS;AACpB,aAAO;AAAA,IACT,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,oBAAoB,OAAe,OAA8B;AACxE,QAAM,SAAS,MAAM,KAAK;AAC1B,QAAM,SAAS,WAAW,MAAM,MAAM,WAAW,MAAM,MAAM;AAC7D,MAAI,CAAC,OAAQ,QAAO;AAEpB,QAAM,QAAkB,CAAC,MAAM;AAC/B,MAAI,aAAa;AACjB,MAAI,YAAY;AAEhB,WAAS,IAAI,QAAQ,GAAG,IAAI,MAAM,QAAQ,KAAK;AAC7C,UAAM,OAAO,MAAM,CAAC;AACpB,QAAI,WAAW;AACb,kBAAY;AACZ;AAAA,IACF;AACA,QAAI,SAAS,MAAM;AACjB,kBAAY;AACZ;AAAA,IACF;AACA,QAAI,SAAS,KAAK;AAChB,mBAAa,CAAC;AACd;AAAA,IACF;AACA,QAAI,WAAY;AAEhB,QAAI,SAAS,IAAK,OAAM,KAAK,GAAG;AAAA,aACvB,SAAS,IAAK,OAAM,KAAK,GAAG;AAAA,aAC5B,SAAS,MAAM,MAAM,SAAS,CAAC,GAAG;AACzC,YAAM,IAAI;AACV,UAAI,MAAM,WAAW,EAAG,QAAO,MAAM,MAAM,OAAO,IAAI,CAAC;AAAA,IACzD;AAAA,EACF;AAEA,SAAO;AACT;AAOA,eAAsB,QACpB,KACA,OAAyB,CAAC,GACF;AACxB,QAAM,WAAW,KAAK,WAAW,kBAAkB,QAAQ,QAAQ,EAAE;AACrE,QAAM,MAAM,GAAG,OAAO;AACtB,QAAM,WAAW;AACjB,QAAM,YAAY,IAAI,aAAa,KAAK,oBAAoB;AAC5D,QAAM,aAAa,KAAK,cAAc;AACtC,QAAM,UAAU,KAAK,SAAS,WAAW;AACzC,QAAM,UAAU,aAAa,IAAI;AACjC,QAAM,WAAW,KAAK,YAAY,oBAAoB,OAAO;AAC7D,QAAM,OAAO,KAAK;AAClB,QAAM,WAAW,KAAK,YAAY;AAClC,QAAM,eAAe,KAAK;AAC1B,QAAM,eAAe,KAAK;AAC1B,QAAM,aAAa,KAAK;AACxB,QAAM,gBAAgB,KAAK,IAAI;AAE/B,MAAI;AACJ,WAAS,UAAU,GAAG,UAAU,YAAY,WAAW;AAGrD,QAAI,cAAc,SAAS;AACzB,YAAM,IAAI,aAAa,oCAAoC,YAAY;AAAA,IACzE;AAGA,QAAI,UAAU,KAAK,iBAAiB,eAAe,UAAU,GAAG;AAC9D,YAAM,mBAAmB,QAAQ,UAAU,IAAI,MAAM,OAAO,OAAO,CAAC;AAAA,IACtE;AACA,UAAM,aAAa,IAAI,gBAAgB;AACvC,UAAM,gBAAgB,YAAY,YAAY,YAAY;AAC1D,UAAM,gBAAgB,WAAW,MAAM,WAAW,MAAM,GAAG,SAAS;AACpE,UAAM,UAAU,KAAK,IAAI;AACzB,UAAM,cAAc,UAAU,KAAK,KAAK;AACxC,QAAI,uBAAuB;AAC3B,QAAI,MAAM;AACR,YAAM,UAAU,MAAM,UAAU;AAAA,QAC9B,SAAS,cAAc;AAAA,QACvB,OAAO,cAAc;AAAA,QACrB,QAAQ,cAAc;AAAA,QACtB;AAAA,QACA,OAAO,IAAI;AAAA,QACX;AAAA,QACA;AAAA,QACA,cAAc;AAAA,QACd,WAAW;AAAA,QACX,WAAW;AAAA,QACX,gBAAgB;AAAA,QAChB;AAAA,QACA,gBAAgB,CAAC;AAAA,MACnB,CAAC;AAAA,IACH;AAEA,QAAI;AACF,YAAM,MAAM,MAAM,QAAQ,KAAK;AAAA,QAC7B,QAAQ;AAAA,QACR;AAAA,QACA,MAAM,KAAK,UAAU,WAAW;AAAA,QAChC,QAAQ;AAAA,MACV,CAAC;AACD,mBAAa,aAAa;AAC1B,YAAM,kBAAkB,OAAO,gBAAgB,IAAI,OAAO,IAAI;AAE9D,UAAI,CAAC,IAAI,IAAI;AACX,cAAM,OAAO,MAAM,IAAI,KAAK;AAC5B,YAAI,MAAM;AACR,gBAAM,UAAU,MAAM,UAAU;AAAA,YAC9B,SAAS,cAAc;AAAA,YACvB,OAAO,cAAc;AAAA,YACrB,QAAQ,cAAc;AAAA,YACtB;AAAA,YACA,OAAO,IAAI;AAAA,YACX;AAAA,YACA;AAAA,YACA,cAAc;AAAA,YACd,WAAW;AAAA,YACX,WAAW,KAAK,IAAI;AAAA,YACpB,YAAY,KAAK,IAAI,IAAI;AAAA,YACzB,YAAY,IAAI;AAAA,YAChB;AAAA,YACA,cAAc;AAAA,YACd,cAAc,QAAQ,IAAI,MAAM;AAAA,YAChC,gBAAgB,CAAC;AAAA,UACnB,CAAC;AACD,iCAAuB;AAAA,QACzB;AACA,cAAM,MAAM,IAAI;AAAA,UACd,YAAY,IAAI,MAAM,KAAK,KAAK,MAAM,GAAG,GAAG,CAAC;AAAA,UAC7C,IAAI;AAAA,UACJ;AAAA,UACA,IAAI;AAAA,QACN;AACA,YACE,iBAAiB,IAAI,IAAI,MAAM,KAC/B,UAAU,aAAa,KACvB,CAAC,iBAAiB,eAAe,UAAU,GAC3C;AACA,oBAAU;AACV,gBAAM,aAAa,gBAAgB,IAAI,OAAO;AAC9C,gBAAM,MAAM,cAAc,UAAU,OAAO,CAAC;AAC5C;AAAA,QACF;AACA,cAAM;AAAA,MACR;AAEA,YAAM,OAAO,MAAM,IAAI,KAAK;AAC5B,UAAI;AACJ,UAAI;AACF,eAAO,KAAK,MAAM,IAAI;AAAA,MACxB,SAAS,UAAU;AACjB,YAAI,MAAM;AACR,gBAAM,UAAU,MAAM,UAAU;AAAA,YAC9B,SAAS,cAAc;AAAA,YACvB,OAAO,cAAc;AAAA,YACrB,QAAQ,cAAc;AAAA,YACtB;AAAA,YACA,OAAO,IAAI;AAAA,YACX;AAAA,YACA;AAAA,YACA,cAAc;AAAA,YACd,WAAW;AAAA,YACX,WAAW,KAAK,IAAI;AAAA,YACpB,YAAY,KAAK,IAAI,IAAI;AAAA,YACzB,YAAY,IAAI;AAAA,YAChB;AAAA,YACA,cAAc;AAAA,YACd,cAAc,sBAAsB,oBAAoB,QAAQ,SAAS,UAAU,OAAO,QAAQ,CAAC;AAAA,YACnG,gBAAgB,CAAC;AAAA,UACnB,CAAC;AACD,iCAAuB;AAAA,QACzB;AACA,cAAM;AAAA,MACR;AACA,UAAI,MAAM;AACR,cAAM,UAAU,MAAM,UAAU;AAAA,UAC9B,SAAS,cAAc;AAAA,UACvB,OAAO,cAAc;AAAA,UACrB,QAAQ,cAAc;AAAA,UACtB;AAAA,UACA,OAAO,IAAI;AAAA,UACX;AAAA,UACA;AAAA,UACA,cAAc;AAAA,UACd,WAAW;AAAA,UACX,WAAW,KAAK,IAAI;AAAA,UACpB,YAAY,KAAK,IAAI,IAAI;AAAA,UACzB,YAAY,IAAI;AAAA,UAChB;AAAA,UACA,cAAc;AAAA,UACd,gBAAgB,CAAC;AAAA,QACnB,CAAC;AAAA,MACH;AACA,YAAM,SACJ,KAAK,UAGH,CAAC;AACL,YAAM,WAAY,KAAK,SAAiD,CAAC;AACzE,YAAM,gBAAiB,KAAK,kBAAkB,KAAK;AACnD,YAAM,UAAU,QAAQ,SAAS,WAAW;AAE5C,aAAO;AAAA,QACL;AAAA,QACA,cAAc,QAAQ,iBAAiB;AAAA,QACvC,cAAc,QAAQ,KAAK,EAAE,WAAW;AAAA,QACxC,OAAO;AAAA,UACL,cAAc,OAAO,SAAS,iBAAiB,CAAC;AAAA,UAChD,kBAAkB,OAAO,SAAS,qBAAqB,CAAC;AAAA,UACxD,aAAa,OAAO,SAAS,gBAAgB,CAAC;AAAA,UAC9C,oBACE,SAAS,yBAAyB,OAAO,SAAS,0BAA0B,WACxE;AAAA,YACG,SAAS,sBAAkD,iBAAiB;AAAA,UAC/E,IACA;AAAA,QACR;AAAA,QACA,SAAS,OAAO,kBAAkB,WAAW,gBAAgB;AAAA,QAC7D,OAAQ,KAAK,SAAoB,IAAI;AAAA,QACrC,YAAY,KAAK,IAAI,IAAI;AAAA,QACzB,KAAK;AAAA,MACP;AAAA,IACF,SAAS,KAAK;AACZ,mBAAa,aAAa;AAC1B,gBAAU;AAIV,UAAI,cAAc,SAAS;AACzB,YAAI,QAAQ,CAAC,sBAAsB;AACjC,gBAAM,UAAU,MAAM,UAAU;AAAA,YAC9B,SAAS,cAAc;AAAA,YACvB,OAAO,cAAc;AAAA,YACrB,QAAQ,cAAc;AAAA,YACtB;AAAA,YACA,OAAO,IAAI;AAAA,YACX;AAAA,YACA;AAAA,YACA,cAAc;AAAA,YACd,WAAW;AAAA,YACX,WAAW,KAAK,IAAI;AAAA,YACpB,YAAY,KAAK,IAAI,IAAI;AAAA,YACzB,cAAc,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAAA,YAC7D,gBAAgB,CAAC;AAAA,UACnB,CAAC;AAAA,QACH;AACA,cAAM;AAAA,MACR;AACA,UAAI,QAAQ,CAAC,sBAAsB;AAIjC,cAAM,UAAU,MAAM,UAAU;AAAA,UAC9B,SAAS,cAAc;AAAA,UACvB,OAAO,cAAc;AAAA,UACrB,QAAQ,cAAc;AAAA,UACtB;AAAA,UACA,OAAO,IAAI;AAAA,UACX;AAAA,UACA;AAAA,UACA,cAAc;AAAA,UACd,WAAW;AAAA,UACX,WAAW,KAAK,IAAI;AAAA,UACpB,YAAY,KAAK,IAAI,IAAI;AAAA,UACzB,cAAc,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAAA,UAC7D,gBAAgB,CAAC;AAAA,QACnB,CAAC;AAAA,MACH;AACA,UACE,UAAU,aAAa,KACvB,oBAAoB,GAAG,KACvB,CAAC,iBAAiB,eAAe,UAAU,GAC3C;AACA,cAAM,MAAM,UAAU,OAAO,CAAC;AAC9B;AAAA,MACF;AACA,YAAM;AAAA,IACR;AAAA,EACF;AACA,QAAM,mBAAmB,QAAQ,UAAU,IAAI,MAAM,OAAO,OAAO,CAAC;AACtE;AAEA,eAAe,UACb,MACA,UACA,OACe;AAGf,MAAI;AACF,UAAM,KAAK,OAAO,SAAS,KAAK,CAAC;AAAA,EACnC,QAAQ;AAAA,EAER;AACF;AAEA,SAAS,gBAAgB,GAAoC;AAC3D,QAAM,MAA8B,CAAC;AACrC,IAAE,QAAQ,CAAC,OAAO,QAAQ;AACxB,QAAI,GAAG,IAAI;AAAA,EACb,CAAC;AACD,SAAO;AACT;AAEA,SAAS,gBAAwB;AAC/B,MAAI,OAAO,WAAW,QAAQ,eAAe,WAAY,QAAO,WAAW,OAAO,WAAW;AAC7F,SAAO,GAAG,KAAK,IAAI,EAAE,SAAS,EAAE,CAAC,IAAI,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,MAAM,GAAG,EAAE,CAAC;AAC9E;AAQA,eAAsB,YACpB,KACA,OAAyB,CAAC,GACoB;AAC9C,MAAI;AACF,UAAM,SAAS,MAAM,QAAQ,EAAE,GAAG,KAAK,UAAU,IAAI,YAAY,CAAC,IAAI,WAAW,GAAG,IAAI;AACxF,UAAM,QAAQ,gBAAmB,MAAM;AACvC,WAAO,EAAE,OAAO,OAAO;AAAA,EACzB,SAAS,KAAK;AACZ,QAAI,eAAe,gBAAgB,kBAAkB,IAAI,QAAQ,IAAI,IAAI,KAAK,IAAI,YAAY;AAE5F,YAAM,cAA8B,EAAE,GAAG,KAAK,UAAU,MAAM,YAAY,OAAU;AACpF,YAAM,SAAS,MAAM,QAAQ,aAAa,IAAI;AAC9C,YAAM,QAAQ,gBAAmB,MAAM;AACvC,aAAO,EAAE,OAAO,OAAO;AAAA,IACzB;AACA,UAAM;AAAA,EACR;AACF;AAEA,SAAS,gBAAmB,QAA0B;AACpD,MAAI,OAAO,iBAAiB,UAAU;AACpC,UAAM,IAAI;AAAA,MACR,8CAA8C,OAAO,KAAK;AAAA,IAC5D;AAAA,EACF;AACA,SAAO,gBAAmB,OAAO,SAAS,OAAO,KAAK;AACxD;AAEA,SAAS,gBAAmB,SAAiB,OAAkB;AAC7D,QAAM,WAAW,mBAAmB,OAAO;AAC3C,MAAI;AACF,WAAO,KAAK,MAAM,QAAQ;AAAA,EAC5B,SAAS,KAAK;AACZ,UAAM,IAAI;AAAA,MACR,wCAAwC,KAAK,MAC3C,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CACjD;AAAA;AAAA,EAA0B,QAAQ,MAAM,GAAG,GAAG,CAAC;AAAA,IACjD;AAAA,EACF;AACF;AAWO,IAAM,yBAAN,cAAqC,sBAAsB;AAAA,EAChE,YACE,SACgB,QACA,SAChB;AACA,UAAM,OAAO;AAHG;AACA;AAAA,EAGlB;AAAA,EAJkB;AAAA,EACA;AAIpB;AAmCO,SAAS,eAAe,MAAwB,MAA4B,CAAC,GAAS;AAC3F,QAAM,kBAAkB,KAAK,YAAY;AACzC,QAAM,WAAW,KAAK,WAAW,kBAAkB,QAAQ,QAAQ,EAAE;AAErE,MAAI,IAAI,0BAA0B,CAAC,iBAAiB;AAClD,UAAM,IAAI;AAAA,MACR,gGAAgG,gBAAgB;AAAA,MAChH;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAEA,MAAI,IAAI,iBAAiB,KAAK,CAAC,MAAM,SAAS,SAAS,CAAC,CAAC,GAAG;AAC1D,UAAM,IAAI;AAAA,MACR,2BAA2B,OAAO;AAAA,MAClC;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAEA,MAAI,IAAI,mBAAmB,IAAI,gBAAgB,SAAS,GAAG;AACzD,UAAM,KAAK,IAAI,gBAAgB,KAAK,CAAC,MAAM,SAAS,SAAS,CAAC,CAAC;AAC/D,QAAI,CAAC,IAAI;AACP,YAAM,IAAI;AAAA,QACR,2BAA2B,OAAO,gCAAgC,IAAI,gBAAgB,IAAI,eAAe,EAAE,KAAK,IAAI,CAAC;AAAA,QACrH;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,MAAI,IAAI,eAAe,CAAC,KAAK,UAAU,CAAC,KAAK,UAAU,CAAC,KAAK,YAAY;AACvE,UAAM,IAAI;AAAA,MACR;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAEA,MAAI,IAAI,kBAAkB;AACxB,UAAM,SAAS,KAAK,YAAY,oBAAoB,OAAO;AAC3D,QAAI,WAAW,IAAI,kBAAkB;AACnC,YAAM,IAAI;AAAA,QACR,qCAAqC,IAAI,gBAAgB,gBAAgB,OAAO,gBAAgB,MAAM;AAAA,QACtG;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,SAAS,KAAa,SAAmC;AAChE,MAAI,mBAAmB,OAAQ,QAAO,QAAQ,KAAK,GAAG;AACtD,SAAO,IAAI,YAAY,EAAE,WAAW,QAAQ,YAAY,CAAC;AAC3D;AAEA,SAAS,gBAAgB,GAA4B;AACnD,SAAO,aAAa,SAAS,EAAE,SAAS;AAC1C;AAaA,eAAsB,SACpB,OACA,OAAkD,CAAC,GACgB;AACnE,QAAM,QAAQ,KAAK,IAAI;AACvB,MAAI;AACF,UAAM;AAAA,MACJ;AAAA,QACE;AAAA,QACA,UAAU,CAAC,EAAE,MAAM,QAAQ,SAAS,OAAO,CAAC;AAAA,QAC5C,WAAW;AAAA,QACX,WAAW,KAAK,aAAa;AAAA,MAC/B;AAAA,MACA;AAAA,IACF;AACA,WAAO,EAAE,IAAI,MAAM,WAAW,KAAK,IAAI,IAAI,OAAO,OAAO,KAAK;AAAA,EAChE,SAAS,KAAK;AACZ,WAAO;AAAA,MACL,IAAI;AAAA,MACJ,WAAW,KAAK,IAAI,IAAI;AAAA,MACxB,OAAO,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAAA,IACxD;AAAA,EACF;AACF;AAOO,IAAM,YAAN,MAAgB;AAAA,EACrB,YAA6B,OAAyB,CAAC,GAAG;AAA7B;AAAA,EAA8B;AAAA,EAA9B;AAAA,EAE7B,KAAK,KAAqB,KAAgD;AACxE,WAAO,QAAQ,KAAK,EAAE,GAAG,KAAK,MAAM,GAAG,IAAI,CAAC;AAAA,EAC9C;AAAA,EAEA,SACE,KACA,KAC8C;AAC9C,WAAO,YAAe,KAAK,EAAE,GAAG,KAAK,MAAM,GAAG,IAAI,CAAC;AAAA,EACrD;AACF;","names":[]}

package/dist/chunk-I6LVHOV3.js

@@ -1,205 +0,0 @@
-import {
-  AnalystRegistry,
-  DEFAULT_TRACE_ANALYST_KINDS,
-  createTraceAnalystKind,
-  makeFinding
-} from "./chunk-5S5NJ63F.js";
-import {
-  LLM_INPUT_TOKEN_ATTR_KEYS,
-  LLM_OUTPUT_TOKEN_ATTR_KEYS,
-  TOOL_NAME_ATTR_KEYS
-} from "./chunk-LNQEP766.js";
-
-// src/trace-analyst/behavioral-metrics.ts
-var INPUT_GROWTH_FACTOR = 3;
-var MIN_TOOL_CALLS = 3;
-var VERIFY_RE = /verif|eval|inspect|check|assert|validat|review|confirm|read|grep|glob|search|view|\blist\b|\bls\b|\bcat\b|\bfind\b|diff|status|\btest|lint|typecheck/i;
-function num(v) {
-  return typeof v === "number" && Number.isFinite(v) ? v : null;
-}
-function numAttr(attrs, keys) {
-  for (const key of keys) {
-    const value = num(attrs[key]);
-    if (value !== null) return value;
-  }
-  return null;
-}
-function inputTokensOf(s) {
-  return numAttr(s.attributes, LLM_INPUT_TOKEN_ATTR_KEYS) ?? num(s.attributes["llm.usage.input_tokens"]);
-}
-function outputTokensOf(s) {
-  return numAttr(s.attributes, LLM_OUTPUT_TOKEN_ATTR_KEYS) ?? num(s.attributes["llm.usage.output_tokens"]);
-}
-function stepOf(s) {
-  return num(s.attributes.step);
-}
-function toolNameOf(s) {
-  if (s.tool_name) return s.tool_name;
-  for (const key of TOOL_NAME_ATTR_KEYS) {
-    const t = s.attributes[key];
-    if (typeof t === "string" && t.length > 0) return t;
-  }
-  return null;
-}
-function computeTraceMetrics(spans) {
-  const ordered = [...spans].sort((a, b) => {
-    const sa = stepOf(a);
-    const sb = stepOf(b);
-    if (sa !== null && sb !== null && sa !== sb) return sa - sb;
-    return a.start_time.localeCompare(b.start_time);
-  });
-  const inputTokenTrajectory = [];
-  const outputTokenTrajectory = [];
-  const toolHistogram = {};
-  let hasSelfVerification = false;
-  for (const s of ordered) {
-    const inT = inputTokensOf(s);
-    if (inT !== null) inputTokenTrajectory.push(inT);
-    const outT = outputTokensOf(s);
-    if (outT !== null) outputTokenTrajectory.push(outT);
-    const tool = toolNameOf(s);
-    if (tool) {
-      toolHistogram[tool] = (toolHistogram[tool] ?? 0) + 1;
-      if (VERIFY_RE.test(tool)) hasSelfVerification = true;
-    }
-  }
-  const totalToolCalls = Object.values(toolHistogram).reduce((a, b) => a + b, 0);
-  const distinctTools = Object.keys(toolHistogram).length;
-  const toolDiversityRatio = totalToolCalls === 0 ? 1 : distinctTools / totalToolCalls;
-  const signals = [];
-  if (inputTokenTrajectory.length >= 3) {
-    const first = inputTokenTrajectory[0];
-    const last = inputTokenTrajectory[inputTokenTrajectory.length - 1];
-    const growthFromZero = first === 0 && last > 0;
-    const growth = growthFromZero ? Infinity : first > 0 ? last / first : 0;
-    if (last > first && growth >= INPUT_GROWTH_FACTOR) {
-      const growthLabel = growthFromZero ? "0\u2192nonzero (unbounded)" : `${growth.toFixed(1)}x`;
-      signals.push({
-        code: "monotonic-input-growth",
-        severity: "high",
-        detail: `LLM input tokens grew ${growthLabel} (${first}\u2192${last}) across ${inputTokenTrajectory.length} calls \u2014 full history re-sent each step with no compression.`,
-        evidence: {
-          first,
-          last,
-          growth_x: growthFromZero ? "unbounded" : Number(growth.toFixed(2)),
-          calls: inputTokenTrajectory.length
-        }
-      });
-    }
-  }
-  if (outputTokenTrajectory.length >= 3) {
-    const first = outputTokenTrajectory[0];
-    const last = outputTokenTrajectory[outputTokenTrajectory.length - 1];
-    if (last < first) {
-      signals.push({
-        code: "output-length-decay",
-        severity: "medium",
-        detail: `LLM output tokens shrank ${first}\u2192${last} over ${outputTokenTrajectory.length} calls \u2014 less planning/reasoning per step as context grows.`,
-        evidence: { first, last, calls: outputTokenTrajectory.length }
-      });
-    }
-  }
-  if (totalToolCalls >= MIN_TOOL_CALLS && distinctTools === 1) {
-    const only = Object.keys(toolHistogram)[0];
-    signals.push({
-      code: "single-tool-dependency",
-      severity: "medium",
-      detail: `All ${totalToolCalls} tool calls are \`${only}\` \u2014 no tool diversity and no fallback path.`,
-      evidence: { tool: only, calls: totalToolCalls, distinct_tools: 1 }
-    });
-  }
-  if (totalToolCalls >= MIN_TOOL_CALLS && !hasSelfVerification) {
-    signals.push({
-      code: "no-self-verification",
-      severity: "medium",
-      detail: `${totalToolCalls} tool calls and none verify/inspect/check state \u2014 the agent never validates its own actions.`,
-      evidence: { tool_calls: totalToolCalls, verification_calls: 0 }
-    });
-  }
-  return {
-    llmCallCount: inputTokenTrajectory.length,
-    inputTokenTrajectory,
-    outputTokenTrajectory,
-    toolHistogram,
-    totalToolCalls,
-    distinctTools,
-    toolDiversityRatio,
-    hasSelfVerification,
-    signals
-  };
-}
-
-// src/analyst/behavioral-analyst.ts
-var RECOMMENDED_ACTION = {
-  "monotonic-input-growth": "Add a context-budget instruction: once prior context exceeds a threshold, summarize earlier steps into a short status line instead of re-sending full history.",
-  "output-length-decay": "Require a minimum planning/reasoning budget per step so late steps do not degrade into terse, error-prone commands.",
-  "single-tool-dependency": "Direct the agent to use the full toolset (verify / inspect / alternate actions), not a single execute call, and to plan a fallback when a call returns an unexpected result.",
-  "no-self-verification": "After every state-mutating action, verify the result (eval / inspect / assert) before proceeding."
-};
-var ANALYST_ID = "efficiency-behavioral";
-function deriveEfficiencyFindings(metrics, opts = {}) {
-  const analystId = opts.analystId ?? ANALYST_ID;
-  return metrics.signals.map(
-    (sig) => makeFinding({
-      analyst_id: analystId,
-      area: "efficiency",
-      subject: sig.code,
-      // kebab — passes the cluster grammar; stable key for diffFindings
-      claim: sig.detail,
-      severity: sig.severity,
-      // Deterministic arithmetic over spans, not a model judgment → certain.
-      confidence: 1,
-      evidence_refs: [
-        {
-          kind: "metric",
-          uri: `metric://efficiency/${sig.code}`,
-          excerpt: JSON.stringify(sig.evidence)
-        }
-      ],
-      recommended_action: RECOMMENDED_ACTION[sig.code],
-      metadata: { deterministic: true, evidence: sig.evidence },
-      ...opts.producedAt ? { produced_at: opts.producedAt } : {}
-    })
-  );
-}
-function behavioralAnalyst() {
-  return {
-    id: ANALYST_ID,
-    description: "Deterministic behavioral/efficiency findings over OTLP spans \u2014 token-growth, output-decay, tool-monoculture, missing self-verification. Zero LLM; model-agnostic by construction.",
-    inputKind: "trace-store",
-    cost: { kind: "deterministic" },
-    version: "1.0.0",
-    async analyze(store) {
-      const overview = await store.getOverview();
-      const spans = [];
-      for (const traceId of overview.sample_trace_ids) {
-        const viewed = await store.viewTrace({ trace_id: traceId });
-        if (viewed.spans) spans.push(...viewed.spans);
-      }
-      return deriveEfficiencyFindings(computeTraceMetrics(spans));
-    }
-  };
-}
-
-// src/analyst/default-registry.ts
-function buildDefaultAnalystRegistry(opts = {}) {
-  const registry = new AnalystRegistry(opts.registry);
-  if (opts.includeBehavioral !== false) {
-    registry.register(behavioralAnalyst());
-  }
-  if (opts.ai) {
-    const kinds = opts.kinds ?? DEFAULT_TRACE_ANALYST_KINDS;
-    for (const spec of kinds) {
-      registry.register(createTraceAnalystKind(spec, { ai: opts.ai, model: opts.model }));
-    }
-  }
-  return registry;
-}
-
-export {
-  computeTraceMetrics,
-  deriveEfficiencyFindings,
-  behavioralAnalyst,
-  buildDefaultAnalystRegistry
-};
-//# sourceMappingURL=chunk-I6LVHOV3.js.map

package/dist/chunk-I6LVHOV3.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/trace-analyst/behavioral-metrics.ts","../src/analyst/behavioral-analyst.ts","../src/analyst/default-registry.ts"],"sourcesContent":["/**\n * Deterministic behavioral metrics over OTLP spans — pure arithmetic, no LLM.\n *\n * These are the model-independent multiplier: the four trace-quality signals a\n * tolerant analyzer (e.g. HALO) re-derives per run inside the model — token\n * growth, output decay, tool monoculture, missing self-verification — computed\n * here once, in TypeScript, with zero model judgment. A finding that falls out\n * of arithmetic is trivially model-agnostic and cannot hallucinate the trend.\n *\n * General, not trace-specific: the detectors key off token trajectories and\n * tool usage present in any agentic OTLP trace, not any one benchmark.\n */\n\nimport {\n  LLM_INPUT_TOKEN_ATTR_KEYS,\n  LLM_OUTPUT_TOKEN_ATTR_KEYS,\n  TOOL_NAME_ATTR_KEYS,\n} from '../trace/otlp-attributes'\nimport type { TraceAnalystSpan } from './types'\n\nexport type SuboptimalCode =\n  | 'monotonic-input-growth'\n  | 'output-length-decay'\n  | 'single-tool-dependency'\n  | 'no-self-verification'\n\nexport interface SuboptimalSignal {\n  code: SuboptimalCode\n  severity: 'high' | 'medium' | 'low'\n  /** Human-readable claim, with the backing numbers inlined. */\n  detail: string\n  /** The exact figures the detector fired on — auditable, no model in the loop. */\n  evidence: Record<string, number | string | boolean>\n}\n\nexport interface BehavioralMetrics {\n  llmCallCount: number\n  inputTokenTrajectory: number[]\n  outputTokenTrajectory: number[]\n  toolHistogram: Record<string, number>\n  totalToolCalls: number\n  distinctTools: number\n  /** distinct/total tool calls; 1.0 when there are no tool calls. */\n  toolDiversityRatio: number\n  hasSelfVerification: boolean\n  signals: SuboptimalSignal[]\n}\n\n/** ≥ this input-token growth ratio across a run, with no compression, fires. */\nconst INPUT_GROWTH_FACTOR = 3\n/** Tool-usage signals need at least this many calls to be meaningful. */\nconst MIN_TOOL_CALLS = 3\n/** Tool names that read or check state count as self-verification, not mutation.\n *  Covers the inspect verbs plus the read/search tools real harnesses use to\n *  verify (Claude Code Read/Grep/Glob, codex read_file/ls/cat, git status/diff,\n *  test/lint). A pure shell tool (Bash/exec_command) is intentionally NOT matched\n *  — its name can't tell a `pytest` from an `rm`. */\nconst VERIFY_RE =\n  /verif|eval|inspect|check|assert|validat|review|confirm|read|grep|glob|search|view|\\blist\\b|\\bls\\b|\\bcat\\b|\\bfind\\b|diff|status|\\btest|lint|typecheck/i\n\nfunction num(v: unknown): number | null {\n  return typeof v === 'number' && Number.isFinite(v) ? v : null\n}\nfunction numAttr(attrs: Record<string, unknown>, keys: readonly string[]): number | null {\n  for (const key of keys) {\n    const value = num(attrs[key])\n    if (value !== null) return value\n  }\n  return null\n}\nfunction inputTokensOf(s: TraceAnalystSpan): number | null {\n  return (\n    numAttr(s.attributes, LLM_INPUT_TOKEN_ATTR_KEYS) ?? num(s.attributes['llm.usage.input_tokens'])\n  )\n}\nfunction outputTokensOf(s: TraceAnalystSpan): number | null {\n  return (\n    numAttr(s.attributes, LLM_OUTPUT_TOKEN_ATTR_KEYS) ??\n    num(s.attributes['llm.usage.output_tokens'])\n  )\n}\nfunction stepOf(s: TraceAnalystSpan): number | null {\n  return num(s.attributes.step)\n}\nfunction toolNameOf(s: TraceAnalystSpan): string | null {\n  if (s.tool_name) return s.tool_name\n  for (const key of TOOL_NAME_ATTR_KEYS) {\n    const t = s.attributes[key]\n    if (typeof t === 'string' && t.length > 0) return t\n  }\n  return null\n}\n\n/**\n * Reduce a span list to behavioral metrics + fired suboptimality signals.\n * Pure + deterministic: same spans → same output, on any machine, no model.\n */\nexport function computeTraceMetrics(spans: readonly TraceAnalystSpan[]): BehavioralMetrics {\n  // Order by step (when present) then start_time so trajectories reflect run order.\n  const ordered = [...spans].sort((a, b) => {\n    const sa = stepOf(a)\n    const sb = stepOf(b)\n    if (sa !== null && sb !== null && sa !== sb) return sa - sb\n    return a.start_time.localeCompare(b.start_time)\n  })\n\n  const inputTokenTrajectory: number[] = []\n  const outputTokenTrajectory: number[] = []\n  const toolHistogram: Record<string, number> = {}\n  let hasSelfVerification = false\n\n  for (const s of ordered) {\n    const inT = inputTokensOf(s)\n    if (inT !== null) inputTokenTrajectory.push(inT)\n    const outT = outputTokensOf(s)\n    if (outT !== null) outputTokenTrajectory.push(outT)\n    const tool = toolNameOf(s)\n    if (tool) {\n      toolHistogram[tool] = (toolHistogram[tool] ?? 0) + 1\n      if (VERIFY_RE.test(tool)) hasSelfVerification = true\n    }\n  }\n\n  const totalToolCalls = Object.values(toolHistogram).reduce((a, b) => a + b, 0)\n  const distinctTools = Object.keys(toolHistogram).length\n  const toolDiversityRatio = totalToolCalls === 0 ? 1 : distinctTools / totalToolCalls\n\n  const signals: SuboptimalSignal[] = []\n\n  if (inputTokenTrajectory.length >= 3) {\n    const first = inputTokenTrajectory[0]!\n    const last = inputTokenTrajectory[inputTokenTrajectory.length - 1]!\n    // first === 0 with later growth is an unbounded ratio (0→huge context blowup);\n    // treat it as infinite so the signal fires, and report it as such instead of\n    // dividing by zero for the displayed factor.\n    const growthFromZero = first === 0 && last > 0\n    const growth = growthFromZero ? Infinity : first > 0 ? last / first : 0\n    if (last > first && growth >= INPUT_GROWTH_FACTOR) {\n      const growthLabel = growthFromZero ? '0→nonzero (unbounded)' : `${growth.toFixed(1)}x`\n      signals.push({\n        code: 'monotonic-input-growth',\n        severity: 'high',\n        detail: `LLM input tokens grew ${growthLabel} (${first}→${last}) across ${inputTokenTrajectory.length} calls — full history re-sent each step with no compression.`,\n        evidence: {\n          first,\n          last,\n          growth_x: growthFromZero ? 'unbounded' : Number(growth.toFixed(2)),\n          calls: inputTokenTrajectory.length,\n        },\n      })\n    }\n  }\n\n  if (outputTokenTrajectory.length >= 3) {\n    const first = outputTokenTrajectory[0]!\n    const last = outputTokenTrajectory[outputTokenTrajectory.length - 1]!\n    if (last < first) {\n      signals.push({\n        code: 'output-length-decay',\n        severity: 'medium',\n        detail: `LLM output tokens shrank ${first}→${last} over ${outputTokenTrajectory.length} calls — less planning/reasoning per step as context grows.`,\n        evidence: { first, last, calls: outputTokenTrajectory.length },\n      })\n    }\n  }\n\n  if (totalToolCalls >= MIN_TOOL_CALLS && distinctTools === 1) {\n    const only = Object.keys(toolHistogram)[0]!\n    signals.push({\n      code: 'single-tool-dependency',\n      severity: 'medium',\n      detail: `All ${totalToolCalls} tool calls are \\`${only}\\` — no tool diversity and no fallback path.`,\n      evidence: { tool: only, calls: totalToolCalls, distinct_tools: 1 },\n    })\n  }\n\n  if (totalToolCalls >= MIN_TOOL_CALLS && !hasSelfVerification) {\n    signals.push({\n      code: 'no-self-verification',\n      severity: 'medium',\n      detail: `${totalToolCalls} tool calls and none verify/inspect/check state — the agent never validates its own actions.`,\n      evidence: { tool_calls: totalToolCalls, verification_calls: 0 },\n    })\n  }\n\n  return {\n    llmCallCount: inputTokenTrajectory.length,\n    inputTokenTrajectory,\n    outputTokenTrajectory,\n    toolHistogram,\n    totalToolCalls,\n    distinctTools,\n    toolDiversityRatio,\n    hasSelfVerification,\n    signals,\n  }\n}\n","/**\n * `behavioralAnalyst` — a DETERMINISTIC analyst (cost.kind = 'deterministic',\n * never calls the LLM). It produces the efficiency/behavioral findings a\n * tolerant agentic analyzer (HALO) re-derives per run inside the model —\n * context bloat, output decay, tool monoculture, missing self-verification —\n * directly from arithmetic over spans (`computeTraceMetrics`).\n *\n * Why it matters: these findings are model-agnostic BY CONSTRUCTION (no model\n * in the loop), so they cannot return 0 on a weak model the way the Ax-RLM\n * does — and they are strictly more reliable than HALO, which spends tokens\n * re-deriving the same numbers and can hallucinate the trend. The agentic\n * RLM kinds remain for SEMANTIC findings that genuinely need a model; this\n * analyst owns the behavioral class.\n */\n\nimport {\n  type BehavioralMetrics,\n  computeTraceMetrics,\n  type SuboptimalCode,\n} from '../trace-analyst/behavioral-metrics'\nimport type { TraceAnalysisStore } from '../trace-analyst/store'\nimport type { TraceAnalystSpan } from '../trace-analyst/types'\nimport { type Analyst, type AnalystFinding, makeFinding } from './types'\n\nconst RECOMMENDED_ACTION: Record<SuboptimalCode, string> = {\n  'monotonic-input-growth':\n    'Add a context-budget instruction: once prior context exceeds a threshold, summarize earlier steps into a short status line instead of re-sending full history.',\n  'output-length-decay':\n    'Require a minimum planning/reasoning budget per step so late steps do not degrade into terse, error-prone commands.',\n  'single-tool-dependency':\n    'Direct the agent to use the full toolset (verify / inspect / alternate actions), not a single execute call, and to plan a fallback when a call returns an unexpected result.',\n  'no-self-verification':\n    'After every state-mutating action, verify the result (eval / inspect / assert) before proceeding.',\n}\n\nconst ANALYST_ID = 'efficiency-behavioral'\n\n/**\n * Map computed signals → structured AnalystFindings. Pure: no LLM, no clock\n * dependence beyond `produced_at` (overridable for deterministic tests).\n */\nexport function deriveEfficiencyFindings(\n  metrics: BehavioralMetrics,\n  opts: { analystId?: string; producedAt?: string } = {},\n): AnalystFinding[] {\n  const analystId = opts.analystId ?? ANALYST_ID\n  return metrics.signals.map((sig) =>\n    makeFinding({\n      analyst_id: analystId,\n      area: 'efficiency',\n      subject: sig.code, // kebab — passes the cluster grammar; stable key for diffFindings\n      claim: sig.detail,\n      severity: sig.severity,\n      // Deterministic arithmetic over spans, not a model judgment → certain.\n      confidence: 1,\n      evidence_refs: [\n        {\n          kind: 'metric',\n          uri: `metric://efficiency/${sig.code}`,\n          excerpt: JSON.stringify(sig.evidence),\n        },\n      ],\n      recommended_action: RECOMMENDED_ACTION[sig.code],\n      metadata: { deterministic: true, evidence: sig.evidence },\n      ...(opts.producedAt ? { produced_at: opts.producedAt } : {}),\n    }),\n  )\n}\n\n/** The deterministic behavioral/efficiency analyst (no LLM, any-model). */\nexport function behavioralAnalyst(): Analyst<TraceAnalysisStore> {\n  return {\n    id: ANALYST_ID,\n    description:\n      'Deterministic behavioral/efficiency findings over OTLP spans — token-growth, output-decay, tool-monoculture, missing self-verification. Zero LLM; model-agnostic by construction.',\n    inputKind: 'trace-store',\n    cost: { kind: 'deterministic' },\n    version: '1.0.0',\n    async analyze(store) {\n      const overview = await store.getOverview()\n      const spans: TraceAnalystSpan[] = []\n      for (const traceId of overview.sample_trace_ids) {\n        const viewed = await store.viewTrace({ trace_id: traceId })\n        if (viewed.spans) spans.push(...viewed.spans)\n      }\n      return deriveEfficiencyFindings(computeTraceMetrics(spans))\n    },\n  }\n}\n","/**\n * `buildDefaultAnalystRegistry` — the canonical analyst suite, so consumers\n * stop hand-wiring `new AnalystRegistry()` + per-kind `createTraceAnalystKind`.\n *\n * The deterministic `behavioralAnalyst` is ALWAYS registered (it needs no\n * model and is model-agnostic by construction). The agentic RLM kinds are\n * registered only when an `ai` service is supplied — so a caller with no LLM\n * still gets the full behavioral/efficiency diagnosis, and the substrate's\n * \"any model (including no model)\" guarantee holds at the suite level.\n */\n\nimport type { AxAIService } from '@ax-llm/ax'\nimport { behavioralAnalyst } from './behavioral-analyst'\nimport { createTraceAnalystKind, type TraceAnalystKindSpec } from './kind-factory'\nimport { DEFAULT_TRACE_ANALYST_KINDS } from './kinds'\nimport { AnalystRegistry, type AnalystRegistryOptions } from './registry'\n\nexport interface DefaultAnalystRegistryOptions {\n  /** Ax service for the agentic RLM kinds. Omit → only the deterministic analyst. */\n  ai?: AxAIService\n  /** Model for the agentic kinds (falls back to the ai service default). */\n  model?: string\n  /** Which agentic kinds to register when `ai` is present. Default = the shipped suite. */\n  kinds?: readonly TraceAnalystKindSpec[]\n  /** Set false to omit the deterministic behavioral analyst (default: include). */\n  includeBehavioral?: boolean\n  /** Forwarded to the AnalystRegistry constructor (signal, tags, priorFindings). */\n  registry?: AnalystRegistryOptions\n}\n\nexport function buildDefaultAnalystRegistry(\n  opts: DefaultAnalystRegistryOptions = {},\n): AnalystRegistry {\n  const registry = new AnalystRegistry(opts.registry)\n  if (opts.includeBehavioral !== false) {\n    registry.register(behavioralAnalyst())\n  }\n  if (opts.ai) {\n    const kinds = opts.kinds ?? DEFAULT_TRACE_ANALYST_KINDS\n    for (const spec of kinds) {\n      registry.register(createTraceAnalystKind(spec, { ai: opts.ai, model: opts.model }))\n    }\n  }\n  return registry\n}\n"],"mappings":";;;;;;;;;;;;;AAiDA,IAAM,sBAAsB;AAE5B,IAAM,iBAAiB;AAMvB,IAAM,YACJ;AAEF,SAAS,IAAI,GAA2B;AACtC,SAAO,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,IAAI,IAAI;AAC3D;AACA,SAAS,QAAQ,OAAgC,MAAwC;AACvF,aAAW,OAAO,MAAM;AACtB,UAAM,QAAQ,IAAI,MAAM,GAAG,CAAC;AAC5B,QAAI,UAAU,KAAM,QAAO;AAAA,EAC7B;AACA,SAAO;AACT;AACA,SAAS,cAAc,GAAoC;AACzD,SACE,QAAQ,EAAE,YAAY,yBAAyB,KAAK,IAAI,EAAE,WAAW,wBAAwB,CAAC;AAElG;AACA,SAAS,eAAe,GAAoC;AAC1D,SACE,QAAQ,EAAE,YAAY,0BAA0B,KAChD,IAAI,EAAE,WAAW,yBAAyB,CAAC;AAE/C;AACA,SAAS,OAAO,GAAoC;AAClD,SAAO,IAAI,EAAE,WAAW,IAAI;AAC9B;AACA,SAAS,WAAW,GAAoC;AACtD,MAAI,EAAE,UAAW,QAAO,EAAE;AAC1B,aAAW,OAAO,qBAAqB;AACrC,UAAM,IAAI,EAAE,WAAW,GAAG;AAC1B,QAAI,OAAO,MAAM,YAAY,EAAE,SAAS,EAAG,QAAO;AAAA,EACpD;AACA,SAAO;AACT;AAMO,SAAS,oBAAoB,OAAuD;AAEzF,QAAM,UAAU,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM;AACxC,UAAM,KAAK,OAAO,CAAC;AACnB,UAAM,KAAK,OAAO,CAAC;AACnB,QAAI,OAAO,QAAQ,OAAO,QAAQ,OAAO,GAAI,QAAO,KAAK;AACzD,WAAO,EAAE,WAAW,cAAc,EAAE,UAAU;AAAA,EAChD,CAAC;AAED,QAAM,uBAAiC,CAAC;AACxC,QAAM,wBAAkC,CAAC;AACzC,QAAM,gBAAwC,CAAC;AAC/C,MAAI,sBAAsB;AAE1B,aAAW,KAAK,SAAS;AACvB,UAAM,MAAM,cAAc,CAAC;AAC3B,QAAI,QAAQ,KAAM,sBAAqB,KAAK,GAAG;AAC/C,UAAM,OAAO,eAAe,CAAC;AAC7B,QAAI,SAAS,KAAM,uBAAsB,KAAK,IAAI;AAClD,UAAM,OAAO,WAAW,CAAC;AACzB,QAAI,MAAM;AACR,oBAAc,IAAI,KAAK,cAAc,IAAI,KAAK,KAAK;AACnD,UAAI,UAAU,KAAK,IAAI,EAAG,uBAAsB;AAAA,IAClD;AAAA,EACF;AAEA,QAAM,iBAAiB,OAAO,OAAO,aAAa,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AAC7E,QAAM,gBAAgB,OAAO,KAAK,aAAa,EAAE;AACjD,QAAM,qBAAqB,mBAAmB,IAAI,IAAI,gBAAgB;AAEtE,QAAM,UAA8B,CAAC;AAErC,MAAI,qBAAqB,UAAU,GAAG;AACpC,UAAM,QAAQ,qBAAqB,CAAC;AACpC,UAAM,OAAO,qBAAqB,qBAAqB,SAAS,CAAC;AAIjE,UAAM,iBAAiB,UAAU,KAAK,OAAO;AAC7C,UAAM,SAAS,iBAAiB,WAAW,QAAQ,IAAI,OAAO,QAAQ;AACtE,QAAI,OAAO,SAAS,UAAU,qBAAqB;AACjD,YAAM,cAAc,iBAAiB,+BAA0B,GAAG,OAAO,QAAQ,CAAC,CAAC;AACnF,cAAQ,KAAK;AAAA,QACX,MAAM;AAAA,QACN,UAAU;AAAA,QACV,QAAQ,yBAAyB,WAAW,KAAK,KAAK,SAAI,IAAI,YAAY,qBAAqB,MAAM;AAAA,QACrG,UAAU;AAAA,UACR;AAAA,UACA;AAAA,UACA,UAAU,iBAAiB,cAAc,OAAO,OAAO,QAAQ,CAAC,CAAC;AAAA,UACjE,OAAO,qBAAqB;AAAA,QAC9B;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AAEA,MAAI,sBAAsB,UAAU,GAAG;AACrC,UAAM,QAAQ,sBAAsB,CAAC;AACrC,UAAM,OAAO,sBAAsB,sBAAsB,SAAS,CAAC;AACnE,QAAI,OAAO,OAAO;AAChB,cAAQ,KAAK;AAAA,QACX,MAAM;AAAA,QACN,UAAU;AAAA,QACV,QAAQ,4BAA4B,KAAK,SAAI,IAAI,SAAS,sBAAsB,MAAM;AAAA,QACtF,UAAU,EAAE,OAAO,MAAM,OAAO,sBAAsB,OAAO;AAAA,MAC/D,CAAC;AAAA,IACH;AAAA,EACF;AAEA,MAAI,kBAAkB,kBAAkB,kBAAkB,GAAG;AAC3D,UAAM,OAAO,OAAO,KAAK,aAAa,EAAE,CAAC;AACzC,YAAQ,KAAK;AAAA,MACX,MAAM;AAAA,MACN,UAAU;AAAA,MACV,QAAQ,OAAO,cAAc,qBAAqB,IAAI;AAAA,MACtD,UAAU,EAAE,MAAM,MAAM,OAAO,gBAAgB,gBAAgB,EAAE;AAAA,IACnE,CAAC;AAAA,EACH;AAEA,MAAI,kBAAkB,kBAAkB,CAAC,qBAAqB;AAC5D,YAAQ,KAAK;AAAA,MACX,MAAM;AAAA,MACN,UAAU;AAAA,MACV,QAAQ,GAAG,cAAc;AAAA,MACzB,UAAU,EAAE,YAAY,gBAAgB,oBAAoB,EAAE;AAAA,IAChE,CAAC;AAAA,EACH;AAEA,SAAO;AAAA,IACL,cAAc,qBAAqB;AAAA,IACnC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;AC5KA,IAAM,qBAAqD;AAAA,EACzD,0BACE;AAAA,EACF,uBACE;AAAA,EACF,0BACE;AAAA,EACF,wBACE;AACJ;AAEA,IAAM,aAAa;AAMZ,SAAS,yBACd,SACA,OAAoD,CAAC,GACnC;AAClB,QAAM,YAAY,KAAK,aAAa;AACpC,SAAO,QAAQ,QAAQ;AAAA,IAAI,CAAC,QAC1B,YAAY;AAAA,MACV,YAAY;AAAA,MACZ,MAAM;AAAA,MACN,SAAS,IAAI;AAAA;AAAA,MACb,OAAO,IAAI;AAAA,MACX,UAAU,IAAI;AAAA;AAAA,MAEd,YAAY;AAAA,MACZ,eAAe;AAAA,QACb;AAAA,UACE,MAAM;AAAA,UACN,KAAK,uBAAuB,IAAI,IAAI;AAAA,UACpC,SAAS,KAAK,UAAU,IAAI,QAAQ;AAAA,QACtC;AAAA,MACF;AAAA,MACA,oBAAoB,mBAAmB,IAAI,IAAI;AAAA,MAC/C,UAAU,EAAE,eAAe,MAAM,UAAU,IAAI,SAAS;AAAA,MACxD,GAAI,KAAK,aAAa,EAAE,aAAa,KAAK,WAAW,IAAI,CAAC;AAAA,IAC5D,CAAC;AAAA,EACH;AACF;AAGO,SAAS,oBAAiD;AAC/D,SAAO;AAAA,IACL,IAAI;AAAA,IACJ,aACE;AAAA,IACF,WAAW;AAAA,IACX,MAAM,EAAE,MAAM,gBAAgB;AAAA,IAC9B,SAAS;AAAA,IACT,MAAM,QAAQ,OAAO;AACnB,YAAM,WAAW,MAAM,MAAM,YAAY;AACzC,YAAM,QAA4B,CAAC;AACnC,iBAAW,WAAW,SAAS,kBAAkB;AAC/C,cAAM,SAAS,MAAM,MAAM,UAAU,EAAE,UAAU,QAAQ,CAAC;AAC1D,YAAI,OAAO,MAAO,OAAM,KAAK,GAAG,OAAO,KAAK;AAAA,MAC9C;AACA,aAAO,yBAAyB,oBAAoB,KAAK,CAAC;AAAA,IAC5D;AAAA,EACF;AACF;;;AC1DO,SAAS,4BACd,OAAsC,CAAC,GACtB;AACjB,QAAM,WAAW,IAAI,gBAAgB,KAAK,QAAQ;AAClD,MAAI,KAAK,sBAAsB,OAAO;AACpC,aAAS,SAAS,kBAAkB,CAAC;AAAA,EACvC;AACA,MAAI,KAAK,IAAI;AACX,UAAM,QAAQ,KAAK,SAAS;AAC5B,eAAW,QAAQ,OAAO;AACxB,eAAS,SAAS,uBAAuB,MAAM,EAAE,IAAI,KAAK,IAAI,OAAO,KAAK,MAAM,CAAC,CAAC;AAAA,IACpF;AAAA,EACF;AACA,SAAO;AACT;","names":[]}