@tangle-network/agent-eval 0.216.0 → 0.216.1

package/dist/{run-record-DlTZ_lqe.js.map → run-record-Boc5IUTp.js.map}

@@ -1 +1 @@
-{"version":3,"file":"run-record-DlTZ_lqe.js","names":[],"sources":["../src/run-record.ts"],"sourcesContent":["/**\n * Paper-grade RunRecord schema + runtime validator.\n *\n * Every run that participates in a promotion gate, paper table, or\n * researcher loop SHOULD be recorded as a `RunRecord`. The mandatory\n * fields are exactly those the paper \"Two Loops, Three Roles\" requires\n * for reproducibility: who/what/when/cost/seed/hash, plus the search vs\n * holdout split tag. A task score is optional because execution-only records\n * must preserve missing labels instead of converting errors into zero quality.\n *\n * This is intentionally NOT a replacement for the rich `Run` /\n * `ProposeReviewReport` / `ScenarioResult` types already in the\n * package. Those are runtime structures with full provenance. A\n * `RunRecord` is the analysis-time projection — the JSON-friendly\n * row you'd put in a parquet file or paste into a notebook.\n *\n * Validate at the boundary:\n *\n *   const rec = validateRunRecord(rawJson)         // throws on missing\n *   const ok  = isRunRecord(rawJson)               // boolean check\n *   const rec = parseRunRecordSafe(rawJson)        // { ok, value | error }\n *\n * The validator runs in pure TS — zod is intentionally NOT a\n * dependency.\n */\n\nimport type { AgentProfileCell } from './agent-profile-cell'\nimport { validateAgentProfileCell } from './agent-profile-cell'\nimport type { CostProvenance } from './cost-ledger'\nimport { ValidationError } from './errors'\n// Value import of a leaf module that itself imports only this file's TYPES —\n// no runtime cycle. It keeps the raw split-score derivation spelled in exactly\n// one place (see `rollout/score-derivation-guard`).\nimport { observedScore } from './rollout/reward'\nimport { FAILURE_CLASSES, type FailureClass } from './trace/schema'\n\n/** Search/dev/holdout split tag. 'search' is the paper-grade alias for the\n *  combined train+test pool that the optimizer is allowed to read. */\nexport type RunSplitTag = 'search' | 'dev' | 'holdout'\n\n/**\n * Explicit execution-lifecycle result for a run.\n *\n * This is separate from task quality (`outcome`) and failure classification.\n * Producers set it only from root-run or process evidence.\n */\nexport type RunTerminalOutcome = 'succeeded' | 'failed' | 'cancelled' | 'incomplete' | 'unknown'\n\n/** Explicit model value for a row that never produced a served model snapshot. */\nexport const UNKNOWN_MODEL = 'unknown'\n\nexport interface RunTokenUsage {\n  input: number\n  /** All generated tokens charged as output, including reasoning tokens. */\n  output: number\n  /** Present only when one or more paid calls did not report token usage.\n   *  In that case, every numeric field is a known subtotal, not a measured total. */\n  tokensKnown?: false\n  /** Reasoning-token subset of `output`, when the provider reports it. */\n  reasoning?: number\n  /** Prompt tokens served from a provider cache. */\n  cached?: number\n  /** Prompt tokens written into a provider cache. */\n  cacheWrite?: number\n}\n\n/**\n * How a run's USD amount was obtained.\n *\n * `costUsd` is the run's total, or null when the total is unknown. A run whose\n * receipts prove only part of its spend is a `lower-bound`: its total is\n * unknown, so `costUsd` and `usd` stay null, and the proven part is\n * `knownLowerBoundUsd`. A reader of the total therefore never takes a floor\n * for a total. A floor of $0 proves nothing, so it is written `uncaptured`.\n *\n * Only a RunRecord needs this kind. Every other cost shape keeps a known\n * subtotal beside `CostProvenance`, where `uncaptured` already means \"at\n * least the subtotal\"; a RunRecord's nullable `costUsd` cannot hold one.\n */\nexport type RunCostProvenance =\n  | CostProvenance\n  | { kind: 'lower-bound'; usd: null; knownLowerBoundUsd: number }\n\n/**\n * The run's place in a search: one attempt at one cell. The search ledger\n * holds the lineage (the node's parents, depth and order); a RunRecord only\n * points at it.\n */\nexport interface RunSearchCoordinates {\n  searchId: string\n  nodeId: string\n  /** The cell id hashes the search, node, task, split and repeat, so it is\n   *  unique across candidates. */\n  cellId: string\n  /** Attempt number within the cell, counted from 1. */\n  attempt: number\n}\n\n/** Where the run's execution record lives. */\nexport interface RunTraceRef {\n  /** Trace id shared by every span of the run. */\n  traceId: string\n  /** Root run of the execution tree the run spawned, when one exists. */\n  execRunId?: string\n}\n\n/**\n * The run id of one attempt at a search cell. It is unique across candidates\n * and attempts, unlike a `${scenario}:${rep}` id, which every candidate that\n * ran the same scenario shares.\n */\nexport function searchCellRunId(search: Pick<RunSearchCoordinates, 'cellId' | 'attempt'>): string {\n  return `${search.cellId}:${search.attempt}`\n}\n\nexport interface RunJudgeMetadata {\n  model: string\n  promptVersion: string\n  /** [0,1] confidence the judge declared. Constant judge confidence\n   *  across many runs is a fallback signal (see `canary.ts`). */\n  confidence: number\n  /** True if the judge degraded to a fallback path (rules-only,\n   *  prior-call cache, etc.). The canary uses this to alert. */\n  fallback: boolean\n}\n\n/**\n * Per-judge / per-dimension breakdown for runs scored by an ensemble of\n * judges over a multi-dimensional rubric.\n *\n * The collapsed `outcome.searchScore` / `holdoutScore` carries the\n * composite the gate uses. The full breakdown belongs here so consumers\n * can answer \"which judge disagreed?\", \"which dimension dragged the\n * composite down?\", and \"did half the panel fail?\" without re-running.\n *\n * `perJudge[judgeId][dim]` is the canonical source; `perDimMean` and\n * `composite` are convenience projections — derivable but precomputed so\n * downstream IRR primitives (`interRaterReliability`,\n * `corpusInterRaterAgreement`) and reporters don't pay the same\n * aggregation twice.\n *\n * Fail-loud discipline: judges that errored out land in `failedJudges`\n * by id. A missing key in `perJudge` is ambiguous (silent zero vs not\n * run); the explicit list makes a partial-failure recorded as such.\n */\nexport interface JudgeScoresRecord {\n  /** Per-judge per-dimension scores. `{ \"kimi-k2.6\": { helpfulness: 0.8, clarity: 0.7 }, ... }`. */\n  perJudge: Record<string, Record<string, number>>\n  /** Per-dim mean across judges. Convenience — derivable from `perJudge`. */\n  perDimMean: Record<string, number>\n  /** Composite mean across successful judges. Mirrors the task score only\n   *  when `failedJudges` is empty. */\n  composite: number\n  /** Judges that errored or returned an unparseable verdict. Recorded\n   *  by id (e.g. `['glm-5.1']`) so a partial-failure case is explicit,\n   *  not inferred from missing keys in `perJudge`. */\n  failedJudges?: string[]\n  /** Free-form notes the judges emitted (joined across judges or\n   *  first-judge only — consumer's choice). */\n  notes?: string\n}\n\nexport interface RunOutcome {\n  /** Score on the search/optimization split. Optional for holdout-only and\n   *  execution-only records. */\n  searchScore?: number\n  /** Score on the held-out split. Optional for search-only and execution-only\n   *  records. When both scores are absent, the run is explicitly unlabeled. */\n  holdoutScore?: number\n  /** Bag of any other metric the run produced — judge dimensions,\n   *  pass/fail counters, latency stats, etc. Numeric only — keeps\n   *  reporters honest. */\n  raw: Record<string, number>\n  /** Per-judge / per-dim breakdown. Consumers writing ensemble\n   *  judgements populate this; substrate primitives like\n   *  `interRaterReliability` and `corpusInterRaterAgreement` accept\n   *  these records as input. Optional — single-judge or scalar-only\n   *  runs leave it unset. */\n  judgeScores?: JudgeScoresRecord\n  /** Authenticity / realness verdict — did the run build the REAL thing on the\n   *  intended infra, or fake it (see `./authenticity`)? Optional: only domains\n   *  with an authenticity config populate it. Carried in the corpus so the\n   *  flywheel / off-policy learning can optimize for real completion, not gamed\n   *  pass-rate. `score` is 0-1; `gated` is the anti-Goodhart flag — a gated run\n   *  must not count as a real success regardless of `score`. */\n  realness?: { score: number; gated: boolean; reason?: string }\n}\n\n/**\n * Mandatory paper-grade fields for a single evaluation run. Optional\n * fields are extension points; mandatory fields throw if missing.\n *\n * Hash discipline:\n *   - `promptHash` is the sha256 of the EFFECTIVE prompt sent to the\n *     model (after any steering bundle merge).\n *   - `configHash` is the sha256 of the effective run config (model,\n *     temperature, tools, judges, splits). The pair (promptHash,\n *     configHash) uniquely identifies an experiment cell.\n *\n * Model snapshot discipline:\n *   - successful rows MUST encode a snapshot version. Bare aliases like\n *     `claude-sonnet-4` or `gpt-4o` are banned — they remap silently.\n *     Use `claude-sonnet-4-6@2025-04-15` or `gpt-4o-2024-11-20`.\n *   - a failed, cancelled, incomplete, or otherwise unknown row may use\n *     `UNKNOWN_MODEL` when no served model was observed. This is an explicit\n *     absence marker, not a fabricated snapshot.\n */\nexport interface RunRecord {\n  /** UUID for the run. */\n  runId: string\n  /** Logical experiment grouping (a treatment vs a baseline within\n   *  the same sweep should share `experimentId`). */\n  experimentId: string\n  /** Stable identifier for the candidate (variant) being run. The\n   *  promotion gate compares two `candidateId`s on matched items. */\n  candidateId: string\n  /** RNG seed for the run. Always recorded — silent re-seeding is\n   *  the most common cause of non-reproducible numbers. */\n  seed: number\n  /** Model identifier WITH snapshot version. */\n  model: string\n  /** sha256 of the effective prompt (post-steering). */\n  promptHash: string\n  /** sha256 of the effective config. */\n  configHash: string\n  /** Git SHA the harness was run from. */\n  commitSha: string\n  /** End-to-end wall-clock duration in milliseconds. */\n  wallMs: number\n  /** Time spent queued before execution started, if known. */\n  queueMs?: number\n  /** Total USD cost, or null when the total is unknown. */\n  costUsd: number | null\n  /** Whether `costUsd` came from billing data or a price calculation, is only\n   *  proven down to a floor, or is unavailable. */\n  costProvenance: RunCostProvenance\n  /** Token usage breakdown. */\n  tokenUsage: RunTokenUsage\n  /** Root-run or process terminal result. Never inferred from a child span. */\n  terminalOutcome: RunTerminalOutcome\n  /** Root-run or process failure reason. Valid only for a failed, cancelled,\n   *  or incomplete terminal result; never populated from a child span. */\n  terminalFailureReason?: string\n  /** Judge-side metadata, if a judge was used. */\n  judgeMetadata?: RunJudgeMetadata\n  /** Per-split scores + raw bag. */\n  outcome: RunOutcome\n  /** Canonical task-failure class drawn from the shared\n   *  `FAILURE_CLASSES` taxonomy. Producers set it only from task-result\n   *  evidence. Execution errors belong in\n   *  `outcome.raw.execution_error_count`. */\n  failureClass?: FailureClass\n  /** Free-form task-failure detail scoped under a non-success\n   *  `failureClass`. It is invalid without that class. */\n  failureMode?: string\n  /** Which split this run was drawn from. */\n  splitTag: RunSplitTag\n  /**\n   * Stable scenario identifier the run observed or was scored against.\n   * Comparison primitives match this identity rather than input order.\n   */\n  scenarioId: string\n  /**\n   * Canonical identity for the agent profile cell that produced this row:\n   * profile artifact hash plus optional harness/model/prompt/reporting\n   * dimensions. Use `agentProfile.cellId` to group persona sweeps and\n   * longitudinal reports by the complete source profile, not by a loose\n   * candidate label or opaque config hash.\n   */\n  agentProfile?: AgentProfileCell\n  /** The search cell this run settled. When present, `runId` is\n   *  `searchCellRunId(search)`. */\n  search?: RunSearchCoordinates\n  /** The run's trace and execution tree. Absent means the producer did not\n   *  record where they are. */\n  traceRef?: RunTraceRef\n}\n\n/**\n * Canonical task-result classification.\n *\n * A producer may omit classification, record explicit success, or attach\n * domain-specific detail to a non-success class. Detail can never stand alone.\n * Execution errors belong in `outcome.raw.execution_error_count`.\n */\nexport type RunTaskFailure =\n  | { failureClass?: undefined; failureMode?: undefined }\n  | { failureClass: 'success'; failureMode?: undefined }\n  | {\n      failureClass: Exclude<FailureClass, 'success'>\n      failureMode?: string\n    }\n\n/**\n * Return task quality, preferring held-out evidence when both scores exist.\n *\n * RAW: no realness protection is applied. Built on `observedScore` rather\n * than repeating the split derivation, so only `rollout/reward.ts` reads the\n * raw fields. Anything that becomes training data must use `trainingScore` or\n * `trainingReward` instead.\n */\nexport function runTaskScore(record: RunRecord): number | undefined {\n  const score = observedScore(record)\n  return typeof score === 'number' && Number.isFinite(score) ? score : undefined\n}\n\n// ── Validation ───────────────────────────────────────────────────────\n\nconst MANDATORY_TOP_LEVEL = [\n  'runId',\n  'experimentId',\n  'candidateId',\n  'seed',\n  'model',\n  'promptHash',\n  'configHash',\n  'commitSha',\n  'wallMs',\n  'costUsd',\n  'costProvenance',\n  'tokenUsage',\n  'terminalOutcome',\n  'outcome',\n  'splitTag',\n  'scenarioId',\n] as const\n\nconst SPLIT_TAGS: ReadonlyArray<RunSplitTag> = ['search', 'dev', 'holdout']\nconst TERMINAL_OUTCOMES: ReadonlyArray<RunTerminalOutcome> = [\n  'succeeded',\n  'failed',\n  'cancelled',\n  'incomplete',\n  'unknown',\n]\n\nexport class RunRecordValidationError extends ValidationError {\n  readonly path: string\n  constructor(message: string, path = '') {\n    super(path ? `${message} (at ${path})` : message)\n    this.path = path\n  }\n}\n\n/**\n * Strict validator. Throws `RunRecordValidationError` on the first\n * missing or wrongly-typed field. Returns the input cast to\n * `RunRecord` on success — the validator does not coerce.\n */\nexport function validateRunRecord(input: unknown): RunRecord {\n  if (input === null || typeof input !== 'object') {\n    throw new RunRecordValidationError('expected object')\n  }\n  const obj = input as Record<string, unknown>\n\n  for (const key of MANDATORY_TOP_LEVEL) {\n    if (!(key in obj)) {\n      throw new RunRecordValidationError(`missing mandatory field \"${key}\"`)\n    }\n  }\n\n  expectString(obj.runId, 'runId')\n  expectString(obj.experimentId, 'experimentId')\n  expectString(obj.candidateId, 'candidateId')\n  expectFiniteNumber(obj.seed, 'seed')\n  expectString(obj.model, 'model')\n  expectString(obj.promptHash, 'promptHash')\n  expectString(obj.configHash, 'configHash')\n  expectString(obj.commitSha, 'commitSha')\n  expectNonNegativeNumber(obj.wallMs, 'wallMs')\n  if (obj.queueMs !== undefined) expectNonNegativeNumber(obj.queueMs, 'queueMs')\n  validateCost(obj.costUsd, obj.costProvenance)\n\n  // Snapshot discipline: successful rows require a served model snapshot.\n  // Non-success rows may carry the explicit absence marker when execution\n  // stopped before a model identity was observed.\n  if (\n    !modelHasSnapshot(obj.model as string) &&\n    !(obj.model === UNKNOWN_MODEL && obj.terminalOutcome !== 'succeeded')\n  ) {\n    throw new RunRecordValidationError(\n      `model \"${obj.model}\" lacks a snapshot version (use 'name@YYYY-MM-DD' or 'name-YYYYMMDD', or '${UNKNOWN_MODEL}' for a non-success row without a served model)`,\n      'model',\n    )\n  }\n\n  // Token usage.\n  const tu = obj.tokenUsage\n  if (tu === null || typeof tu !== 'object') {\n    throw new RunRecordValidationError('tokenUsage must be an object', 'tokenUsage')\n  }\n  const tuRec = tu as Record<string, unknown>\n  expectNonNegativeNumber(tuRec.input, 'tokenUsage.input')\n  expectNonNegativeNumber(tuRec.output, 'tokenUsage.output')\n  if (tuRec.tokensKnown !== undefined && tuRec.tokensKnown !== false) {\n    throw new RunRecordValidationError(\n      'tokensKnown must be false when present; omit it when token usage is complete',\n      'tokenUsage.tokensKnown',\n    )\n  }\n  if (tuRec.reasoning !== undefined) {\n    expectNonNegativeNumber(tuRec.reasoning, 'tokenUsage.reasoning')\n    if ((tuRec.reasoning as number) > (tuRec.output as number)) {\n      throw new RunRecordValidationError(\n        'reasoning tokens must be a subset of output tokens',\n        'tokenUsage.reasoning',\n      )\n    }\n  }\n  if (tuRec.cached !== undefined) expectNonNegativeNumber(tuRec.cached, 'tokenUsage.cached')\n  if (tuRec.cacheWrite !== undefined) {\n    expectNonNegativeNumber(tuRec.cacheWrite, 'tokenUsage.cacheWrite')\n  }\n\n  // Judge metadata, optional.\n  if (obj.judgeMetadata !== undefined) {\n    const jm = obj.judgeMetadata\n    if (jm === null || typeof jm !== 'object') {\n      throw new RunRecordValidationError('judgeMetadata must be an object', 'judgeMetadata')\n    }\n    const jmRec = jm as Record<string, unknown>\n    expectString(jmRec.model, 'judgeMetadata.model')\n    expectString(jmRec.promptVersion, 'judgeMetadata.promptVersion')\n    expectFiniteNumber(jmRec.confidence, 'judgeMetadata.confidence')\n    if (typeof jmRec.fallback !== 'boolean') {\n      throw new RunRecordValidationError(\n        'judgeMetadata.fallback must be boolean',\n        'judgeMetadata.fallback',\n      )\n    }\n  }\n\n  // Outcome.\n  const out = obj.outcome\n  if (out === null || typeof out !== 'object') {\n    throw new RunRecordValidationError('outcome must be an object', 'outcome')\n  }\n  const outRec = out as Record<string, unknown>\n  if (outRec.searchScore !== undefined)\n    expectFiniteNumber(outRec.searchScore, 'outcome.searchScore')\n  if (outRec.holdoutScore !== undefined)\n    expectFiniteNumber(outRec.holdoutScore, 'outcome.holdoutScore')\n  const raw = outRec.raw\n  if (raw === null || typeof raw !== 'object') {\n    throw new RunRecordValidationError('outcome.raw must be an object', 'outcome.raw')\n  }\n  for (const [k, v] of Object.entries(raw as Record<string, unknown>)) {\n    expectFiniteNumber(v, `outcome.raw.${k}`)\n  }\n  // Realness verdict, optional.\n  if (outRec.realness !== undefined) {\n    const r = outRec.realness\n    if (r === null || typeof r !== 'object') {\n      throw new RunRecordValidationError('outcome.realness must be an object', 'outcome.realness')\n    }\n    const rr = r as Record<string, unknown>\n    expectFiniteNumber(rr.score, 'outcome.realness.score')\n    if (typeof rr.gated !== 'boolean') {\n      throw new RunRecordValidationError(\n        'outcome.realness.gated must be a boolean',\n        'outcome.realness.gated',\n      )\n    }\n  }\n\n  // Per-judge / per-dim breakdown, optional.\n  if (outRec.judgeScores !== undefined) {\n    validateJudgeScores(outRec.judgeScores, 'outcome.judgeScores')\n  }\n\n  // Failure mode optional.\n  if (\n    obj.failureClass !== undefined &&\n    (typeof obj.failureClass !== 'string' ||\n      !FAILURE_CLASSES.includes(obj.failureClass as FailureClass))\n  ) {\n    throw new RunRecordValidationError(\n      `failureClass must be one of ${FAILURE_CLASSES.join(', ')}`,\n      'failureClass',\n    )\n  }\n  if (obj.failureMode !== undefined) {\n    expectString(obj.failureMode, 'failureMode')\n    if (obj.failureClass === undefined || obj.failureClass === 'success') {\n      throw new RunRecordValidationError(\n        'failureMode requires a non-success failureClass',\n        'failureMode',\n      )\n    }\n  }\n\n  if (\n    typeof obj.terminalOutcome !== 'string' ||\n    !TERMINAL_OUTCOMES.includes(obj.terminalOutcome as RunTerminalOutcome)\n  ) {\n    throw new RunRecordValidationError(\n      `terminalOutcome must be one of ${TERMINAL_OUTCOMES.join(', ')}`,\n      'terminalOutcome',\n    )\n  }\n  if (obj.terminalFailureReason !== undefined) {\n    expectString(obj.terminalFailureReason, 'terminalFailureReason')\n    if (\n      obj.terminalOutcome !== 'failed' &&\n      obj.terminalOutcome !== 'cancelled' &&\n      obj.terminalOutcome !== 'incomplete'\n    ) {\n      throw new RunRecordValidationError(\n        'terminalFailureReason requires terminalOutcome failed, cancelled, or incomplete',\n        'terminalFailureReason',\n      )\n    }\n  }\n\n  if (obj.agentProfile !== undefined) {\n    try {\n      const profile = validateAgentProfileCell(obj.agentProfile)\n      if (profile.model !== undefined && profile.model !== obj.model) {\n        throw new RunRecordValidationError(\n          `agentProfile.model \"${profile.model}\" does not match model \"${obj.model}\"`,\n          'agentProfile.model',\n        )\n      }\n      if (profile.promptHash !== undefined && profile.promptHash !== obj.promptHash) {\n        throw new RunRecordValidationError(\n          `agentProfile.promptHash \"${profile.promptHash}\" does not match promptHash \"${obj.promptHash}\"`,\n          'agentProfile.promptHash',\n        )\n      }\n    } catch (error) {\n      if (error instanceof RunRecordValidationError) throw error\n      if (error instanceof Error) {\n        throw new RunRecordValidationError(error.message, 'agentProfile')\n      }\n      throw error\n    }\n  }\n\n  expectString(obj.scenarioId, 'scenarioId')\n\n  if (obj.search !== undefined) validateSearchCoordinates(obj.search, obj.runId as string)\n  if (obj.traceRef !== undefined) validateTraceRef(obj.traceRef)\n\n  // Split tag.\n  if (typeof obj.splitTag !== 'string' || !SPLIT_TAGS.includes(obj.splitTag as RunSplitTag)) {\n    throw new RunRecordValidationError(\n      `splitTag must be one of ${SPLIT_TAGS.join(', ')}, got ${String(obj.splitTag)}`,\n      'splitTag',\n    )\n  }\n\n  return input as RunRecord\n}\n\nfunction validateCost(costUsd: unknown, provenance: unknown): void {\n  if (provenance === null || typeof provenance !== 'object') {\n    throw new RunRecordValidationError('costProvenance must be an object', 'costProvenance')\n  }\n  const value = provenance as Record<string, unknown>\n  if (\n    value.kind !== 'observed' &&\n    value.kind !== 'estimated' &&\n    value.kind !== 'lower-bound' &&\n    value.kind !== 'uncaptured'\n  ) {\n    throw new RunRecordValidationError(\n      'costProvenance.kind must be observed, estimated, lower-bound, or uncaptured',\n      'costProvenance.kind',\n    )\n  }\n  if (value.kind === 'lower-bound') {\n    if (value.usd !== null) {\n      throw new RunRecordValidationError(\n        'lower-bound costProvenance.usd must be null; the floor is knownLowerBoundUsd',\n        'costProvenance.usd',\n      )\n    }\n    if (costUsd !== null) {\n      throw new RunRecordValidationError(\n        'lower-bound cost requires costUsd to be null; a floor is not a total',\n        'costUsd',\n      )\n    }\n    expectFiniteNumber(value.knownLowerBoundUsd, 'costProvenance.knownLowerBoundUsd')\n    if ((value.knownLowerBoundUsd as number) <= 0) {\n      throw new RunRecordValidationError(\n        \"a lower bound must be positive; write a $0 floor as { kind: 'uncaptured', usd: null }\",\n        'costProvenance.knownLowerBoundUsd',\n      )\n    }\n    return\n  }\n  // A record must never read as a total it cannot support, so an uncaptured\n  // cost carries no number at all. A matrix `CellResult` keeps its known\n  // subtotal instead, because a cost ceiling must charge the part it can see;\n  // converting one to the other drops that subtotal.\n  if (value.kind === 'uncaptured') {\n    if (value.usd !== null) {\n      throw new RunRecordValidationError(\n        'uncaptured costProvenance.usd must be null',\n        'costProvenance.usd',\n      )\n    }\n    if (costUsd !== null) {\n      throw new RunRecordValidationError('uncaptured cost requires costUsd to be null', 'costUsd')\n    }\n    return\n  }\n  expectNonNegativeNumber(costUsd, 'costUsd')\n  expectNonNegativeNumber(value.usd, 'costProvenance.usd')\n  if (value.usd !== costUsd) {\n    throw new RunRecordValidationError(\n      'costProvenance.usd must equal costUsd',\n      'costProvenance.usd',\n    )\n  }\n}\n\nfunction validateSearchCoordinates(value: unknown, runId: string): void {\n  if (value === null || typeof value !== 'object') {\n    throw new RunRecordValidationError('search must be an object', 'search')\n  }\n  const search = value as Record<string, unknown>\n  expectString(search.searchId, 'search.searchId')\n  expectString(search.nodeId, 'search.nodeId')\n  expectString(search.cellId, 'search.cellId')\n  if (!Number.isSafeInteger(search.attempt) || (search.attempt as number) < 1) {\n    throw new RunRecordValidationError('expected an integer from 1', 'search.attempt')\n  }\n  const expected = searchCellRunId(search as unknown as RunSearchCoordinates)\n  if (runId !== expected) {\n    throw new RunRecordValidationError(\n      `runId \"${runId}\" must be \"${expected}\", the search cell and attempt it settled`,\n      'runId',\n    )\n  }\n}\n\nfunction validateTraceRef(value: unknown): void {\n  if (value === null || typeof value !== 'object') {\n    throw new RunRecordValidationError('traceRef must be an object', 'traceRef')\n  }\n  const ref = value as Record<string, unknown>\n  expectString(ref.traceId, 'traceRef.traceId')\n  if (ref.execRunId !== undefined) expectString(ref.execRunId, 'traceRef.execRunId')\n}\n\n/** Boolean validator — convenience for filtering arrays. */\nexport function isRunRecord(input: unknown): input is RunRecord {\n  try {\n    validateRunRecord(input)\n    return true\n  } catch {\n    return false\n  }\n}\n\n/** Non-throwing validator — returns a discriminated union. */\nexport function parseRunRecordSafe(\n  input: unknown,\n): { ok: true; value: RunRecord } | { ok: false; error: RunRecordValidationError } {\n  try {\n    return { ok: true, value: validateRunRecord(input) }\n  } catch (e) {\n    if (e instanceof RunRecordValidationError) return { ok: false, error: e }\n    throw e\n  }\n}\n\n// ── Internals ────────────────────────────────────────────────────────\n\nfunction expectString(value: unknown, path: string): void {\n  if (typeof value !== 'string' || value.length === 0) {\n    throw new RunRecordValidationError(`expected non-empty string`, path)\n  }\n}\n\nfunction expectFiniteNumber(value: unknown, path: string): void {\n  if (typeof value !== 'number' || !Number.isFinite(value)) {\n    throw new RunRecordValidationError(`expected finite number`, path)\n  }\n}\n\nfunction expectNonNegativeNumber(value: unknown, path: string): void {\n  expectFiniteNumber(value, path)\n  if ((value as number) < 0) {\n    throw new RunRecordValidationError('expected non-negative number', path)\n  }\n}\n\nfunction validateJudgeScores(value: unknown, path: string): void {\n  if (value === null || typeof value !== 'object') {\n    throw new RunRecordValidationError('judgeScores must be an object', path)\n  }\n  const rec = value as Record<string, unknown>\n\n  const perJudge = rec.perJudge\n  if (perJudge === null || typeof perJudge !== 'object') {\n    throw new RunRecordValidationError('perJudge must be an object', `${path}.perJudge`)\n  }\n  for (const [judgeId, dims] of Object.entries(perJudge as Record<string, unknown>)) {\n    if (dims === null || typeof dims !== 'object') {\n      throw new RunRecordValidationError(\n        'per-judge entry must be an object of dimension scores',\n        `${path}.perJudge.${judgeId}`,\n      )\n    }\n    for (const [dim, score] of Object.entries(dims as Record<string, unknown>)) {\n      expectFiniteNumber(score, `${path}.perJudge.${judgeId}.${dim}`)\n    }\n  }\n\n  const perDimMean = rec.perDimMean\n  if (perDimMean === null || typeof perDimMean !== 'object') {\n    throw new RunRecordValidationError('perDimMean must be an object', `${path}.perDimMean`)\n  }\n  for (const [dim, mean] of Object.entries(perDimMean as Record<string, unknown>)) {\n    expectFiniteNumber(mean, `${path}.perDimMean.${dim}`)\n  }\n\n  expectFiniteNumber(rec.composite, `${path}.composite`)\n\n  if (rec.failedJudges !== undefined) {\n    if (!Array.isArray(rec.failedJudges)) {\n      throw new RunRecordValidationError(\n        'failedJudges must be an array of strings',\n        `${path}.failedJudges`,\n      )\n    }\n    for (let i = 0; i < rec.failedJudges.length; i++) {\n      const id = rec.failedJudges[i]\n      if (typeof id !== 'string' || id.length === 0) {\n        throw new RunRecordValidationError(\n          'failedJudges entry must be a non-empty string',\n          `${path}.failedJudges[${i}]`,\n        )\n      }\n    }\n  }\n\n  if (rec.notes !== undefined && typeof rec.notes !== 'string') {\n    throw new RunRecordValidationError('notes must be a string', `${path}.notes`)\n  }\n}\n\n/**\n * Snapshot check for provider model identifiers. Accepts ISO and compact\n * dates, Router's `-MMDD` snapshots, one opaque `@token`, and Vertex-style\n * `:date-token` suffixes. Routing selectors such as `@preset/name` are not\n * immutable model identities.\n */\nexport function modelHasSnapshot(model: string): boolean {\n  if (model.length === 0 || model.trim() !== model) return false\n\n  const opaqueAt = model.lastIndexOf('@')\n  if (opaqueAt > 0) {\n    const base = model.slice(0, opaqueAt)\n    const token = model.slice(opaqueAt + 1)\n    if (!base.includes('@') && /^[A-Za-z0-9](?:[A-Za-z0-9._-]*[A-Za-z0-9])?$/u.test(token)) {\n      return true\n    }\n  }\n\n  const isoDate = model.match(/-(\\d{4})-(\\d{2})-(\\d{2})$/u)\n  if (isoDate && validSnapshotDate(isoDate[1]!, isoDate[2]!, isoDate[3]!)) return true\n\n  const compactDate = model.match(/-(\\d{4})(\\d{2})(\\d{2})$/u)\n  if (compactDate && validSnapshotDate(compactDate[1]!, compactDate[2]!, compactDate[3]!)) {\n    return true\n  }\n\n  const routerDate = model.match(/-(\\d{2})(\\d{2})$/u)\n  if (routerDate && validSnapshotDate(undefined, routerDate[1]!, routerDate[2]!)) return true\n\n  return /:date-[A-Za-z0-9](?:[A-Za-z0-9._-]*[A-Za-z0-9])?$/u.test(model)\n}\n\nfunction validSnapshotDate(year: string | undefined, month: string, day: string): boolean {\n  const monthNumber = Number(month)\n  const dayNumber = Number(day)\n  if (!Number.isInteger(monthNumber) || monthNumber < 1 || monthNumber > 12) return false\n\n  const yearNumber = year === undefined ? undefined : Number(year)\n  const leapYear =\n    yearNumber === undefined ||\n    (yearNumber % 4 === 0 && (yearNumber % 100 !== 0 || yearNumber % 400 === 0))\n  const daysInMonth = [31, leapYear ? 29 : 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\n  return Number.isInteger(dayNumber) && dayNumber >= 1 && dayNumber <= daysInMonth[monthNumber - 1]!\n}\n"],"mappings":";;;;;;AAiDA,MAAa,gBAAgB;;;;;;AA8D7B,SAAgB,gBAAgB,QAAkE;CAChG,OAAO,GAAG,OAAO,OAAO,GAAG,OAAO;AACpC;;;;;;;;;AA4LA,SAAgB,aAAa,QAAuC;CAClE,MAAM,QAAQ,cAAc,MAAM;CAClC,OAAO,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK,IAAI,QAAQ,KAAA;AACvE;AAIA,MAAM,sBAAsB;CAC1B;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;AAEA,MAAM,aAAyC;CAAC;CAAU;CAAO;AAAS;AAC1E,MAAM,oBAAuD;CAC3D;CACA;CACA;CACA;CACA;AACF;AAEA,IAAa,2BAAb,cAA8C,gBAAgB;CAC5D;CACA,YAAY,SAAiB,OAAO,IAAI;EACtC,MAAM,OAAO,GAAG,QAAQ,OAAO,KAAK,KAAK,OAAO;EAChD,KAAK,OAAO;CACd;AACF;;;;;;AAOA,SAAgB,kBAAkB,OAA2B;CAC3D,IAAI,UAAU,QAAQ,OAAO,UAAU,UACrC,MAAM,IAAI,yBAAyB,iBAAiB;CAEtD,MAAM,MAAM;CAEZ,KAAK,MAAM,OAAO,qBAChB,IAAI,EAAE,OAAO,MACX,MAAM,IAAI,yBAAyB,4BAA4B,IAAI,EAAE;CAIzE,aAAa,IAAI,OAAO,OAAO;CAC/B,aAAa,IAAI,cAAc,cAAc;CAC7C,aAAa,IAAI,aAAa,aAAa;CAC3C,mBAAmB,IAAI,MAAM,MAAM;CACnC,aAAa,IAAI,OAAO,OAAO;CAC/B,aAAa,IAAI,YAAY,YAAY;CACzC,aAAa,IAAI,YAAY,YAAY;CACzC,aAAa,IAAI,WAAW,WAAW;CACvC,wBAAwB,IAAI,QAAQ,QAAQ;CAC5C,IAAI,IAAI,YAAY,KAAA,GAAW,wBAAwB,IAAI,SAAS,SAAS;CAC7E,aAAa,IAAI,SAAS,IAAI,cAAc;CAK5C,IACE,CAAC,iBAAiB,IAAI,KAAe,KACrC,EAAE,IAAI,UAAA,aAA2B,IAAI,oBAAoB,cAEzD,MAAM,IAAI,yBACR,UAAU,IAAI,MAAM,4EAA4E,cAAc,kDAC9G,OACF;CAIF,MAAM,KAAK,IAAI;CACf,IAAI,OAAO,QAAQ,OAAO,OAAO,UAC/B,MAAM,IAAI,yBAAyB,gCAAgC,YAAY;CAEjF,MAAM,QAAQ;CACd,wBAAwB,MAAM,OAAO,kBAAkB;CACvD,wBAAwB,MAAM,QAAQ,mBAAmB;CACzD,IAAI,MAAM,gBAAgB,KAAA,KAAa,MAAM,gBAAgB,OAC3D,MAAM,IAAI,yBACR,gFACA,wBACF;CAEF,IAAI,MAAM,cAAc,KAAA,GAAW;EACjC,wBAAwB,MAAM,WAAW,sBAAsB;EAC/D,IAAK,MAAM,YAAwB,MAAM,QACvC,MAAM,IAAI,yBACR,sDACA,sBACF;CAEJ;CACA,IAAI,MAAM,WAAW,KAAA,GAAW,wBAAwB,MAAM,QAAQ,mBAAmB;CACzF,IAAI,MAAM,eAAe,KAAA,GACvB,wBAAwB,MAAM,YAAY,uBAAuB;CAInE,IAAI,IAAI,kBAAkB,KAAA,GAAW;EACnC,MAAM,KAAK,IAAI;EACf,IAAI,OAAO,QAAQ,OAAO,OAAO,UAC/B,MAAM,IAAI,yBAAyB,mCAAmC,eAAe;EAEvF,MAAM,QAAQ;EACd,aAAa,MAAM,OAAO,qBAAqB;EAC/C,aAAa,MAAM,eAAe,6BAA6B;EAC/D,mBAAmB,MAAM,YAAY,0BAA0B;EAC/D,IAAI,OAAO,MAAM,aAAa,WAC5B,MAAM,IAAI,yBACR,0CACA,wBACF;CAEJ;CAGA,MAAM,MAAM,IAAI;CAChB,IAAI,QAAQ,QAAQ,OAAO,QAAQ,UACjC,MAAM,IAAI,yBAAyB,6BAA6B,SAAS;CAE3E,MAAM,SAAS;CACf,IAAI,OAAO,gBAAgB,KAAA,GACzB,mBAAmB,OAAO,aAAa,qBAAqB;CAC9D,IAAI,OAAO,iBAAiB,KAAA,GAC1B,mBAAmB,OAAO,cAAc,sBAAsB;CAChE,MAAM,MAAM,OAAO;CACnB,IAAI,QAAQ,QAAQ,OAAO,QAAQ,UACjC,MAAM,IAAI,yBAAyB,iCAAiC,aAAa;CAEnF,KAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,GAA8B,GAChE,mBAAmB,GAAG,eAAe,GAAG;CAG1C,IAAI,OAAO,aAAa,KAAA,GAAW;EACjC,MAAM,IAAI,OAAO;EACjB,IAAI,MAAM,QAAQ,OAAO,MAAM,UAC7B,MAAM,IAAI,yBAAyB,sCAAsC,kBAAkB;EAE7F,MAAM,KAAK;EACX,mBAAmB,GAAG,OAAO,wBAAwB;EACrD,IAAI,OAAO,GAAG,UAAU,WACtB,MAAM,IAAI,yBACR,4CACA,wBACF;CAEJ;CAGA,IAAI,OAAO,gBAAgB,KAAA,GACzB,oBAAoB,OAAO,aAAa,qBAAqB;CAI/D,IACE,IAAI,iBAAiB,KAAA,MACpB,OAAO,IAAI,iBAAiB,YAC3B,CAAC,gBAAgB,SAAS,IAAI,YAA4B,IAE5D,MAAM,IAAI,yBACR,+BAA+B,gBAAgB,KAAK,IAAI,KACxD,cACF;CAEF,IAAI,IAAI,gBAAgB,KAAA,GAAW;EACjC,aAAa,IAAI,aAAa,aAAa;EAC3C,IAAI,IAAI,iBAAiB,KAAA,KAAa,IAAI,iBAAiB,WACzD,MAAM,IAAI,yBACR,mDACA,aACF;CAEJ;CAEA,IACE,OAAO,IAAI,oBAAoB,YAC/B,CAAC,kBAAkB,SAAS,IAAI,eAAqC,GAErE,MAAM,IAAI,yBACR,kCAAkC,kBAAkB,KAAK,IAAI,KAC7D,iBACF;CAEF,IAAI,IAAI,0BAA0B,KAAA,GAAW;EAC3C,aAAa,IAAI,uBAAuB,uBAAuB;EAC/D,IACE,IAAI,oBAAoB,YACxB,IAAI,oBAAoB,eACxB,IAAI,oBAAoB,cAExB,MAAM,IAAI,yBACR,mFACA,uBACF;CAEJ;CAEA,IAAI,IAAI,iBAAiB,KAAA,GACvB,IAAI;EACF,MAAM,UAAU,yBAAyB,IAAI,YAAY;EACzD,IAAI,QAAQ,UAAU,KAAA,KAAa,QAAQ,UAAU,IAAI,OACvD,MAAM,IAAI,yBACR,uBAAuB,QAAQ,MAAM,0BAA0B,IAAI,MAAM,IACzE,oBACF;EAEF,IAAI,QAAQ,eAAe,KAAA,KAAa,QAAQ,eAAe,IAAI,YACjE,MAAM,IAAI,yBACR,4BAA4B,QAAQ,WAAW,+BAA+B,IAAI,WAAW,IAC7F,yBACF;CAEJ,SAAS,OAAO;EACd,IAAI,iBAAiB,0BAA0B,MAAM;EACrD,IAAI,iBAAiB,OACnB,MAAM,IAAI,yBAAyB,MAAM,SAAS,cAAc;EAElE,MAAM;CACR;CAGF,aAAa,IAAI,YAAY,YAAY;CAEzC,IAAI,IAAI,WAAW,KAAA,GAAW,0BAA0B,IAAI,QAAQ,IAAI,KAAe;CACvF,IAAI,IAAI,aAAa,KAAA,GAAW,iBAAiB,IAAI,QAAQ;CAG7D,IAAI,OAAO,IAAI,aAAa,YAAY,CAAC,WAAW,SAAS,IAAI,QAAuB,GACtF,MAAM,IAAI,yBACR,2BAA2B,WAAW,KAAK,IAAI,EAAE,QAAQ,OAAO,IAAI,QAAQ,KAC5E,UACF;CAGF,OAAO;AACT;AAEA,SAAS,aAAa,SAAkB,YAA2B;CACjE,IAAI,eAAe,QAAQ,OAAO,eAAe,UAC/C,MAAM,IAAI,yBAAyB,oCAAoC,gBAAgB;CAEzF,MAAM,QAAQ;CACd,IACE,MAAM,SAAS,cACf,MAAM,SAAS,eACf,MAAM,SAAS,iBACf,MAAM,SAAS,cAEf,MAAM,IAAI,yBACR,+EACA,qBACF;CAEF,IAAI,MAAM,SAAS,eAAe;EAChC,IAAI,MAAM,QAAQ,MAChB,MAAM,IAAI,yBACR,gFACA,oBACF;EAEF,IAAI,YAAY,MACd,MAAM,IAAI,yBACR,wEACA,SACF;EAEF,mBAAmB,MAAM,oBAAoB,mCAAmC;EAChF,IAAK,MAAM,sBAAiC,GAC1C,MAAM,IAAI,yBACR,yFACA,mCACF;EAEF;CACF;CAKA,IAAI,MAAM,SAAS,cAAc;EAC/B,IAAI,MAAM,QAAQ,MAChB,MAAM,IAAI,yBACR,8CACA,oBACF;EAEF,IAAI,YAAY,MACd,MAAM,IAAI,yBAAyB,+CAA+C,SAAS;EAE7F;CACF;CACA,wBAAwB,SAAS,SAAS;CAC1C,wBAAwB,MAAM,KAAK,oBAAoB;CACvD,IAAI,MAAM,QAAQ,SAChB,MAAM,IAAI,yBACR,yCACA,oBACF;AAEJ;AAEA,SAAS,0BAA0B,OAAgB,OAAqB;CACtE,IAAI,UAAU,QAAQ,OAAO,UAAU,UACrC,MAAM,IAAI,yBAAyB,4BAA4B,QAAQ;CAEzE,MAAM,SAAS;CACf,aAAa,OAAO,UAAU,iBAAiB;CAC/C,aAAa,OAAO,QAAQ,eAAe;CAC3C,aAAa,OAAO,QAAQ,eAAe;CAC3C,IAAI,CAAC,OAAO,cAAc,OAAO,OAAO,KAAM,OAAO,UAAqB,GACxE,MAAM,IAAI,yBAAyB,8BAA8B,gBAAgB;CAEnF,MAAM,WAAW,gBAAgB,MAAyC;CAC1E,IAAI,UAAU,UACZ,MAAM,IAAI,yBACR,UAAU,MAAM,aAAa,SAAS,4CACtC,OACF;AAEJ;AAEA,SAAS,iBAAiB,OAAsB;CAC9C,IAAI,UAAU,QAAQ,OAAO,UAAU,UACrC,MAAM,IAAI,yBAAyB,8BAA8B,UAAU;CAE7E,MAAM,MAAM;CACZ,aAAa,IAAI,SAAS,kBAAkB;CAC5C,IAAI,IAAI,cAAc,KAAA,GAAW,aAAa,IAAI,WAAW,oBAAoB;AACnF;;AAGA,SAAgB,YAAY,OAAoC;CAC9D,IAAI;EACF,kBAAkB,KAAK;EACvB,OAAO;CACT,QAAQ;EACN,OAAO;CACT;AACF;;AAGA,SAAgB,mBACd,OACiF;CACjF,IAAI;EACF,OAAO;GAAE,IAAI;GAAM,OAAO,kBAAkB,KAAK;EAAE;CACrD,SAAS,GAAG;EACV,IAAI,aAAa,0BAA0B,OAAO;GAAE,IAAI;GAAO,OAAO;EAAE;EACxE,MAAM;CACR;AACF;AAIA,SAAS,aAAa,OAAgB,MAAoB;CACxD,IAAI,OAAO,UAAU,YAAY,MAAM,WAAW,GAChD,MAAM,IAAI,yBAAyB,6BAA6B,IAAI;AAExE;AAEA,SAAS,mBAAmB,OAAgB,MAAoB;CAC9D,IAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,GACrD,MAAM,IAAI,yBAAyB,0BAA0B,IAAI;AAErE;AAEA,SAAS,wBAAwB,OAAgB,MAAoB;CACnE,mBAAmB,OAAO,IAAI;CAC9B,IAAK,QAAmB,GACtB,MAAM,IAAI,yBAAyB,gCAAgC,IAAI;AAE3E;AAEA,SAAS,oBAAoB,OAAgB,MAAoB;CAC/D,IAAI,UAAU,QAAQ,OAAO,UAAU,UACrC,MAAM,IAAI,yBAAyB,iCAAiC,IAAI;CAE1E,MAAM,MAAM;CAEZ,MAAM,WAAW,IAAI;CACrB,IAAI,aAAa,QAAQ,OAAO,aAAa,UAC3C,MAAM,IAAI,yBAAyB,8BAA8B,GAAG,KAAK,UAAU;CAErF,KAAK,MAAM,CAAC,SAAS,SAAS,OAAO,QAAQ,QAAmC,GAAG;EACjF,IAAI,SAAS,QAAQ,OAAO,SAAS,UACnC,MAAM,IAAI,yBACR,yDACA,GAAG,KAAK,YAAY,SACtB;EAEF,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,IAA+B,GACvE,mBAAmB,OAAO,GAAG,KAAK,YAAY,QAAQ,GAAG,KAAK;CAElE;CAEA,MAAM,aAAa,IAAI;CACvB,IAAI,eAAe,QAAQ,OAAO,eAAe,UAC/C,MAAM,IAAI,yBAAyB,gCAAgC,GAAG,KAAK,YAAY;CAEzF,KAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAAQ,UAAqC,GAC5E,mBAAmB,MAAM,GAAG,KAAK,cAAc,KAAK;CAGtD,mBAAmB,IAAI,WAAW,GAAG,KAAK,WAAW;CAErD,IAAI,IAAI,iBAAiB,KAAA,GAAW;EAClC,IAAI,CAAC,MAAM,QAAQ,IAAI,YAAY,GACjC,MAAM,IAAI,yBACR,4CACA,GAAG,KAAK,cACV;EAEF,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,aAAa,QAAQ,KAAK;GAChD,MAAM,KAAK,IAAI,aAAa;GAC5B,IAAI,OAAO,OAAO,YAAY,GAAG,WAAW,GAC1C,MAAM,IAAI,yBACR,iDACA,GAAG,KAAK,gBAAgB,EAAE,EAC5B;EAEJ;CACF;CAEA,IAAI,IAAI,UAAU,KAAA,KAAa,OAAO,IAAI,UAAU,UAClD,MAAM,IAAI,yBAAyB,0BAA0B,GAAG,KAAK,OAAO;AAEhF;;;;;;;AAQA,SAAgB,iBAAiB,OAAwB;CACvD,IAAI,MAAM,WAAW,KAAK,MAAM,KAAK,MAAM,OAAO,OAAO;CAEzD,MAAM,WAAW,MAAM,YAAY,GAAG;CACtC,IAAI,WAAW,GAAG;EAChB,MAAM,OAAO,MAAM,MAAM,GAAG,QAAQ;EACpC,MAAM,QAAQ,MAAM,MAAM,WAAW,CAAC;EACtC,IAAI,CAAC,KAAK,SAAS,GAAG,KAAK,gDAAgD,KAAK,KAAK,GACnF,OAAO;CAEX;CAEA,MAAM,UAAU,MAAM,MAAM,4BAA4B;CACxD,IAAI,WAAW,kBAAkB,QAAQ,IAAK,QAAQ,IAAK,QAAQ,EAAG,GAAG,OAAO;CAEhF,MAAM,cAAc,MAAM,MAAM,0BAA0B;CAC1D,IAAI,eAAe,kBAAkB,YAAY,IAAK,YAAY,IAAK,YAAY,EAAG,GACpF,OAAO;CAGT,MAAM,aAAa,MAAM,MAAM,mBAAmB;CAClD,IAAI,cAAc,kBAAkB,KAAA,GAAW,WAAW,IAAK,WAAW,EAAG,GAAG,OAAO;CAEvF,OAAO,qDAAqD,KAAK,KAAK;AACxE;AAEA,SAAS,kBAAkB,MAA0B,OAAe,KAAsB;CACxF,MAAM,cAAc,OAAO,KAAK;CAChC,MAAM,YAAY,OAAO,GAAG;CAC5B,IAAI,CAAC,OAAO,UAAU,WAAW,KAAK,cAAc,KAAK,cAAc,IAAI,OAAO;CAElF,MAAM,aAAa,SAAS,KAAA,IAAY,KAAA,IAAY,OAAO,IAAI;CAI/D,MAAM,cAAc;EAAC;EAFnB,eAAe,KAAA,KACd,aAAa,MAAM,MAAM,aAAa,QAAQ,KAAK,aAAa,QAAQ,KACvC,KAAK;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;CAAE;CACnF,OAAO,OAAO,UAAU,SAAS,KAAK,aAAa,KAAK,aAAa,YAAY,cAAc;AACjG"}
+{"version":3,"file":"run-record-Boc5IUTp.js","names":[],"sources":["../src/run-record.ts"],"sourcesContent":["/**\n * Paper-grade RunRecord schema + runtime validator.\n *\n * Every run that participates in a promotion gate, paper table, or\n * researcher loop SHOULD be recorded as a `RunRecord`. The mandatory\n * fields are exactly those the paper \"Two Loops, Three Roles\" requires\n * for reproducibility: who/what/when/cost/seed/hash, plus the search vs\n * holdout split tag. A task score is optional because execution-only records\n * must preserve missing labels instead of converting errors into zero quality.\n *\n * This is intentionally NOT a replacement for the rich `Run` /\n * `ProposeReviewReport` / `ScenarioResult` types already in the\n * package. Those are runtime structures with full provenance. A\n * `RunRecord` is the analysis-time projection — the JSON-friendly\n * row you'd put in a parquet file or paste into a notebook.\n *\n * Validate at the boundary:\n *\n *   const rec = validateRunRecord(rawJson)         // throws on missing\n *   const ok  = isRunRecord(rawJson)               // boolean check\n *   const rec = parseRunRecordSafe(rawJson)        // { ok, value | error }\n *\n * The validator runs in pure TS — zod is intentionally NOT a\n * dependency.\n */\n\nimport type { AgentProfileCell } from './agent-profile-cell'\nimport { validateAgentProfileCell } from './agent-profile-cell'\nimport type { CostProvenance } from './cost-ledger'\nimport { ValidationError } from './errors'\n// Value import of a leaf module that itself imports only this file's TYPES —\n// no runtime cycle. It keeps the raw split-score derivation spelled in exactly\n// one place (see `rollout/score-derivation-guard`).\nimport { observedScore } from './rollout/reward'\nimport { FAILURE_CLASSES, type FailureClass } from './trace/schema'\n\n/** Search/dev/holdout split tag. 'search' is the paper-grade alias for the\n *  combined train+test pool that the optimizer is allowed to read. */\nexport type RunSplitTag = 'search' | 'dev' | 'holdout'\n\n/**\n * Explicit execution-lifecycle result for a run.\n *\n * This is separate from task quality (`outcome`) and failure classification.\n * Producers set it only from root-run or process evidence.\n */\nexport type RunTerminalOutcome = 'succeeded' | 'failed' | 'cancelled' | 'incomplete' | 'unknown'\n\n/** Explicit model value for a row that never produced a served model snapshot. */\nexport const UNKNOWN_MODEL = 'unknown'\n\nexport interface RunTokenUsage {\n  input: number\n  /** All generated tokens charged as output, including reasoning tokens. */\n  output: number\n  /** Present only when one or more paid calls did not report token usage.\n   *  In that case, every numeric field is a known subtotal, not a measured total. */\n  tokensKnown?: false\n  /** Reasoning-token subset of `output`, when the provider reports it. */\n  reasoning?: number\n  /** Prompt tokens served from a provider cache. */\n  cached?: number\n  /** Prompt tokens written into a provider cache. */\n  cacheWrite?: number\n}\n\n/**\n * How a run's USD amount was obtained.\n *\n * `costUsd` is the run's total, or null when the total is unknown. A run whose\n * receipts prove only part of its spend is a `lower-bound`: its total is\n * unknown, so `costUsd` and `usd` stay null, and the proven part is\n * `knownLowerBoundUsd`. A reader of the total therefore never takes a floor\n * for a total. A floor of $0 proves nothing, so it is written `uncaptured`.\n *\n * Only a RunRecord needs this kind. Every other cost shape keeps a known\n * subtotal beside `CostProvenance`, where `uncaptured` already means \"at\n * least the subtotal\"; a RunRecord's nullable `costUsd` cannot hold one.\n */\nexport type RunCostProvenance =\n  | CostProvenance\n  | { kind: 'lower-bound'; usd: null; knownLowerBoundUsd: number }\n\n/**\n * The run's place in a search: one attempt at one cell. The search ledger\n * holds the lineage (the node's parents, depth and order); a RunRecord only\n * points at it.\n */\nexport interface RunSearchCoordinates {\n  searchId: string\n  nodeId: string\n  /** The cell id hashes the search, node, task, split and repeat, so it is\n   *  unique across candidates. */\n  cellId: string\n  /** Attempt number within the cell, counted from 1. */\n  attempt: number\n}\n\n/** Where the run's execution record lives. */\nexport interface RunTraceRef {\n  /** Trace id shared by every span of the run. */\n  traceId: string\n  /** Root run of the execution tree the run spawned, when one exists. */\n  execRunId?: string\n}\n\n/**\n * The run id of one attempt at a search cell. It is unique across candidates\n * and attempts, unlike a `${scenario}:${rep}` id, which every candidate that\n * ran the same scenario shares.\n */\nexport function searchCellRunId(search: Pick<RunSearchCoordinates, 'cellId' | 'attempt'>): string {\n  return `${search.cellId}:${search.attempt}`\n}\n\nexport interface RunJudgeMetadata {\n  model: string\n  promptVersion: string\n  /** [0,1] confidence the judge declared. Constant judge confidence\n   *  across many runs is a fallback signal (see `canary.ts`). */\n  confidence: number\n  /** True if the judge degraded to a fallback path (rules-only,\n   *  prior-call cache, etc.). The canary uses this to alert. */\n  fallback: boolean\n}\n\n/**\n * Per-judge / per-dimension breakdown for runs scored by an ensemble of\n * judges over a multi-dimensional rubric.\n *\n * The collapsed `outcome.searchScore` / `holdoutScore` carries the\n * composite the gate uses. The full breakdown belongs here so consumers\n * can answer \"which judge disagreed?\", \"which dimension dragged the\n * composite down?\", and \"did half the panel fail?\" without re-running.\n *\n * `perJudge[judgeId][dim]` is the canonical source; `perDimMean` and\n * `composite` are convenience projections — derivable but precomputed so\n * downstream IRR primitives (`interRaterReliability`,\n * `corpusInterRaterAgreement`) and reporters don't pay the same\n * aggregation twice.\n *\n * Fail-loud discipline: judges that errored out land in `failedJudges`\n * by id. A missing key in `perJudge` is ambiguous (silent zero vs not\n * run); the explicit list makes a partial-failure recorded as such.\n */\nexport interface JudgeScoresRecord {\n  /** Per-judge per-dimension scores. `{ \"kimi-k2.6\": { helpfulness: 0.8, clarity: 0.7 }, ... }`. */\n  perJudge: Record<string, Record<string, number>>\n  /** Per-dim mean across judges. Convenience — derivable from `perJudge`. */\n  perDimMean: Record<string, number>\n  /** Composite mean across successful judges. Mirrors the task score only\n   *  when `failedJudges` is empty. */\n  composite: number\n  /** Judges that errored or returned an unparseable verdict. Recorded\n   *  by id (e.g. `['glm-5.1']`) so a partial-failure case is explicit,\n   *  not inferred from missing keys in `perJudge`. */\n  failedJudges?: string[]\n  /** Free-form notes the judges emitted (joined across judges or\n   *  first-judge only — consumer's choice). */\n  notes?: string\n}\n\nexport interface RunOutcome {\n  /** Score on the search/optimization split. Optional for holdout-only and\n   *  execution-only records. */\n  searchScore?: number\n  /** Score on the held-out split. Optional for search-only and execution-only\n   *  records. When both scores are absent, the run is explicitly unlabeled. */\n  holdoutScore?: number\n  /** Bag of any other metric the run produced — judge dimensions,\n   *  pass/fail counters, latency stats, etc. Numeric only — keeps\n   *  reporters honest. */\n  raw: Record<string, number>\n  /** Per-judge / per-dim breakdown. Consumers writing ensemble\n   *  judgements populate this; substrate primitives like\n   *  `interRaterReliability` and `corpusInterRaterAgreement` accept\n   *  these records as input. Optional — single-judge or scalar-only\n   *  runs leave it unset. */\n  judgeScores?: JudgeScoresRecord\n  /** Authenticity / realness verdict — did the run build the REAL thing on the\n   *  intended infra, or fake it (see `./authenticity`)? Optional: only domains\n   *  with an authenticity config populate it. Carried in the corpus so the\n   *  flywheel / off-policy learning can optimize for real completion, not gamed\n   *  pass-rate. `score` is 0-1; `gated` is the anti-Goodhart flag — a gated run\n   *  must not count as a real success regardless of `score`. */\n  realness?: { score: number; gated: boolean; reason?: string }\n}\n\n/**\n * Mandatory paper-grade fields for a single evaluation run. Optional\n * fields are extension points; mandatory fields throw if missing.\n *\n * Hash discipline:\n *   - `promptHash` is the sha256 of the EFFECTIVE prompt sent to the\n *     model (after any steering bundle merge).\n *   - `configHash` is the sha256 of the effective run config (model,\n *     temperature, tools, judges, splits). The pair (promptHash,\n *     configHash) uniquely identifies an experiment cell.\n *\n * Model snapshot discipline:\n *   - successful rows MUST encode a snapshot version. Bare aliases like\n *     `claude-sonnet-4` or `gpt-4o` are banned — they remap silently.\n *     Use `claude-sonnet-4-6@2025-04-15` or `gpt-4o-2024-11-20`.\n *   - a failed, cancelled, incomplete, or otherwise unknown row may use\n *     `UNKNOWN_MODEL` when no served model was observed. This is an explicit\n *     absence marker, not a fabricated snapshot.\n */\nexport interface RunRecord {\n  /** UUID for the run. */\n  runId: string\n  /** Logical experiment grouping (a treatment vs a baseline within\n   *  the same sweep should share `experimentId`). */\n  experimentId: string\n  /** Stable identifier for the candidate (variant) being run. The\n   *  promotion gate compares two `candidateId`s on matched items. */\n  candidateId: string\n  /** RNG seed for the run. Always recorded — silent re-seeding is\n   *  the most common cause of non-reproducible numbers. */\n  seed: number\n  /** Model identifier WITH snapshot version. */\n  model: string\n  /** sha256 of the effective prompt (post-steering). */\n  promptHash: string\n  /** sha256 of the effective config. */\n  configHash: string\n  /** Git SHA the harness was run from. */\n  commitSha: string\n  /** End-to-end wall-clock duration in milliseconds. */\n  wallMs: number\n  /** Time spent queued before execution started, if known. */\n  queueMs?: number\n  /** Total USD cost, or null when the total is unknown. */\n  costUsd: number | null\n  /** Whether `costUsd` came from billing data or a price calculation, is only\n   *  proven down to a floor, or is unavailable. */\n  costProvenance: RunCostProvenance\n  /** Token usage breakdown. */\n  tokenUsage: RunTokenUsage\n  /** Root-run or process terminal result. Never inferred from a child span. */\n  terminalOutcome: RunTerminalOutcome\n  /** Root-run or process failure reason. Valid only for a failed, cancelled,\n   *  or incomplete terminal result; never populated from a child span. */\n  terminalFailureReason?: string\n  /** Judge-side metadata, if a judge was used. */\n  judgeMetadata?: RunJudgeMetadata\n  /** Per-split scores + raw bag. */\n  outcome: RunOutcome\n  /** Canonical task-failure class drawn from the shared\n   *  `FAILURE_CLASSES` taxonomy. Producers set it only from task-result\n   *  evidence. Execution errors belong in\n   *  `outcome.raw.execution_error_count`. */\n  failureClass?: FailureClass\n  /** Free-form task-failure detail scoped under a non-success\n   *  `failureClass`. It is invalid without that class. */\n  failureMode?: string\n  /** Which split this run was drawn from. */\n  splitTag: RunSplitTag\n  /**\n   * Stable scenario identifier the run observed or was scored against.\n   * Comparison primitives match this identity rather than input order.\n   */\n  scenarioId: string\n  /**\n   * Canonical identity for the agent profile cell that produced this row:\n   * profile artifact hash plus optional harness/model/prompt/reporting\n   * dimensions. Use `agentProfile.cellId` to group persona sweeps and\n   * longitudinal reports by the complete source profile, not by a loose\n   * candidate label or opaque config hash.\n   */\n  agentProfile?: AgentProfileCell\n  /** The search cell this run settled. When present, `runId` is\n   *  `searchCellRunId(search)`. */\n  search?: RunSearchCoordinates\n  /** The run's trace and execution tree. Absent means the producer did not\n   *  record where they are. */\n  traceRef?: RunTraceRef\n}\n\n/**\n * Canonical task-result classification.\n *\n * A producer may omit classification, record explicit success, or attach\n * domain-specific detail to a non-success class. Detail can never stand alone.\n * Execution errors belong in `outcome.raw.execution_error_count`.\n */\nexport type RunTaskFailure =\n  | { failureClass?: undefined; failureMode?: undefined }\n  | { failureClass: 'success'; failureMode?: undefined }\n  | {\n      failureClass: Exclude<FailureClass, 'success'>\n      failureMode?: string\n    }\n\n/**\n * Return task quality, preferring held-out evidence when both scores exist.\n *\n * RAW: no realness protection is applied. Built on `observedScore` rather\n * than repeating the split derivation, so only `rollout/reward.ts` reads the\n * raw fields. Anything that becomes training data must use `trainingScore` or\n * `trainingReward` instead.\n */\nexport function runTaskScore(record: RunRecord): number | undefined {\n  const score = observedScore(record)\n  return typeof score === 'number' && Number.isFinite(score) ? score : undefined\n}\n\n// ── Validation ───────────────────────────────────────────────────────\n\nconst MANDATORY_TOP_LEVEL = [\n  'runId',\n  'experimentId',\n  'candidateId',\n  'seed',\n  'model',\n  'promptHash',\n  'configHash',\n  'commitSha',\n  'wallMs',\n  'costUsd',\n  'costProvenance',\n  'tokenUsage',\n  'terminalOutcome',\n  'outcome',\n  'splitTag',\n  'scenarioId',\n] as const\n\nconst SPLIT_TAGS: ReadonlyArray<RunSplitTag> = ['search', 'dev', 'holdout']\nconst TERMINAL_OUTCOMES: ReadonlyArray<RunTerminalOutcome> = [\n  'succeeded',\n  'failed',\n  'cancelled',\n  'incomplete',\n  'unknown',\n]\n\nexport class RunRecordValidationError extends ValidationError {\n  readonly path: string\n  constructor(message: string, path = '') {\n    super(path ? `${message} (at ${path})` : message)\n    this.path = path\n  }\n}\n\n/**\n * Strict validator. Throws `RunRecordValidationError` on the first\n * missing or wrongly-typed field. Returns the input cast to\n * `RunRecord` on success — the validator does not coerce.\n */\nexport function validateRunRecord(input: unknown): RunRecord {\n  if (input === null || typeof input !== 'object') {\n    throw new RunRecordValidationError('expected object')\n  }\n  const obj = input as Record<string, unknown>\n\n  for (const key of MANDATORY_TOP_LEVEL) {\n    if (!(key in obj)) {\n      throw new RunRecordValidationError(`missing mandatory field \"${key}\"`)\n    }\n  }\n\n  expectString(obj.runId, 'runId')\n  expectString(obj.experimentId, 'experimentId')\n  expectString(obj.candidateId, 'candidateId')\n  expectFiniteNumber(obj.seed, 'seed')\n  expectString(obj.model, 'model')\n  expectString(obj.promptHash, 'promptHash')\n  expectString(obj.configHash, 'configHash')\n  expectString(obj.commitSha, 'commitSha')\n  expectNonNegativeNumber(obj.wallMs, 'wallMs')\n  if (obj.queueMs !== undefined) expectNonNegativeNumber(obj.queueMs, 'queueMs')\n  validateCost(obj.costUsd, obj.costProvenance)\n\n  // Snapshot discipline: successful rows require a served model snapshot.\n  // Non-success rows may carry the explicit absence marker when execution\n  // stopped before a model identity was observed.\n  if (\n    !modelHasSnapshot(obj.model as string) &&\n    !(obj.model === UNKNOWN_MODEL && obj.terminalOutcome !== 'succeeded')\n  ) {\n    throw new RunRecordValidationError(\n      `model \"${obj.model}\" lacks a snapshot version (use 'name@YYYY-MM-DD' or 'name-YYYYMMDD', or '${UNKNOWN_MODEL}' for a non-success row without a served model)`,\n      'model',\n    )\n  }\n\n  // Token usage.\n  const tu = obj.tokenUsage\n  if (tu === null || typeof tu !== 'object') {\n    throw new RunRecordValidationError('tokenUsage must be an object', 'tokenUsage')\n  }\n  const tuRec = tu as Record<string, unknown>\n  expectNonNegativeNumber(tuRec.input, 'tokenUsage.input')\n  expectNonNegativeNumber(tuRec.output, 'tokenUsage.output')\n  if (tuRec.tokensKnown !== undefined && tuRec.tokensKnown !== false) {\n    throw new RunRecordValidationError(\n      'tokensKnown must be false when present; omit it when token usage is complete',\n      'tokenUsage.tokensKnown',\n    )\n  }\n  if (tuRec.reasoning !== undefined) {\n    expectNonNegativeNumber(tuRec.reasoning, 'tokenUsage.reasoning')\n    if ((tuRec.reasoning as number) > (tuRec.output as number)) {\n      throw new RunRecordValidationError(\n        'reasoning tokens must be a subset of output tokens',\n        'tokenUsage.reasoning',\n      )\n    }\n  }\n  if (tuRec.cached !== undefined) expectNonNegativeNumber(tuRec.cached, 'tokenUsage.cached')\n  if (tuRec.cacheWrite !== undefined) {\n    expectNonNegativeNumber(tuRec.cacheWrite, 'tokenUsage.cacheWrite')\n  }\n\n  // Judge metadata, optional.\n  if (obj.judgeMetadata !== undefined) {\n    const jm = obj.judgeMetadata\n    if (jm === null || typeof jm !== 'object') {\n      throw new RunRecordValidationError('judgeMetadata must be an object', 'judgeMetadata')\n    }\n    const jmRec = jm as Record<string, unknown>\n    expectString(jmRec.model, 'judgeMetadata.model')\n    expectString(jmRec.promptVersion, 'judgeMetadata.promptVersion')\n    expectFiniteNumber(jmRec.confidence, 'judgeMetadata.confidence')\n    if (typeof jmRec.fallback !== 'boolean') {\n      throw new RunRecordValidationError(\n        'judgeMetadata.fallback must be boolean',\n        'judgeMetadata.fallback',\n      )\n    }\n  }\n\n  // Outcome.\n  const out = obj.outcome\n  if (out === null || typeof out !== 'object') {\n    throw new RunRecordValidationError('outcome must be an object', 'outcome')\n  }\n  const outRec = out as Record<string, unknown>\n  if (outRec.searchScore !== undefined)\n    expectFiniteNumber(outRec.searchScore, 'outcome.searchScore')\n  if (outRec.holdoutScore !== undefined)\n    expectFiniteNumber(outRec.holdoutScore, 'outcome.holdoutScore')\n  const raw = outRec.raw\n  if (raw === null || typeof raw !== 'object') {\n    throw new RunRecordValidationError('outcome.raw must be an object', 'outcome.raw')\n  }\n  for (const [k, v] of Object.entries(raw as Record<string, unknown>)) {\n    expectFiniteNumber(v, `outcome.raw.${k}`)\n  }\n  // Realness verdict, optional.\n  if (outRec.realness !== undefined) {\n    const r = outRec.realness\n    if (r === null || typeof r !== 'object') {\n      throw new RunRecordValidationError('outcome.realness must be an object', 'outcome.realness')\n    }\n    const rr = r as Record<string, unknown>\n    expectFiniteNumber(rr.score, 'outcome.realness.score')\n    if (typeof rr.gated !== 'boolean') {\n      throw new RunRecordValidationError(\n        'outcome.realness.gated must be a boolean',\n        'outcome.realness.gated',\n      )\n    }\n  }\n\n  // Per-judge / per-dim breakdown, optional.\n  if (outRec.judgeScores !== undefined) {\n    validateJudgeScores(outRec.judgeScores, 'outcome.judgeScores')\n  }\n\n  // Failure mode optional.\n  if (\n    obj.failureClass !== undefined &&\n    (typeof obj.failureClass !== 'string' ||\n      !FAILURE_CLASSES.includes(obj.failureClass as FailureClass))\n  ) {\n    throw new RunRecordValidationError(\n      `failureClass must be one of ${FAILURE_CLASSES.join(', ')}`,\n      'failureClass',\n    )\n  }\n  if (obj.failureMode !== undefined) {\n    expectString(obj.failureMode, 'failureMode')\n    if (obj.failureClass === undefined || obj.failureClass === 'success') {\n      throw new RunRecordValidationError(\n        'failureMode requires a non-success failureClass',\n        'failureMode',\n      )\n    }\n  }\n\n  if (\n    typeof obj.terminalOutcome !== 'string' ||\n    !TERMINAL_OUTCOMES.includes(obj.terminalOutcome as RunTerminalOutcome)\n  ) {\n    throw new RunRecordValidationError(\n      `terminalOutcome must be one of ${TERMINAL_OUTCOMES.join(', ')}`,\n      'terminalOutcome',\n    )\n  }\n  if (obj.terminalFailureReason !== undefined) {\n    expectString(obj.terminalFailureReason, 'terminalFailureReason')\n    if (\n      obj.terminalOutcome !== 'failed' &&\n      obj.terminalOutcome !== 'cancelled' &&\n      obj.terminalOutcome !== 'incomplete'\n    ) {\n      throw new RunRecordValidationError(\n        'terminalFailureReason requires terminalOutcome failed, cancelled, or incomplete',\n        'terminalFailureReason',\n      )\n    }\n  }\n\n  if (obj.agentProfile !== undefined) {\n    try {\n      const profile = validateAgentProfileCell(obj.agentProfile)\n      if (profile.model !== undefined && profile.model !== obj.model) {\n        throw new RunRecordValidationError(\n          `agentProfile.model \"${profile.model}\" does not match model \"${obj.model}\"`,\n          'agentProfile.model',\n        )\n      }\n      if (profile.promptHash !== undefined && profile.promptHash !== obj.promptHash) {\n        throw new RunRecordValidationError(\n          `agentProfile.promptHash \"${profile.promptHash}\" does not match promptHash \"${obj.promptHash}\"`,\n          'agentProfile.promptHash',\n        )\n      }\n    } catch (error) {\n      if (error instanceof RunRecordValidationError) throw error\n      if (error instanceof Error) {\n        throw new RunRecordValidationError(error.message, 'agentProfile')\n      }\n      throw error\n    }\n  }\n\n  expectString(obj.scenarioId, 'scenarioId')\n\n  if (obj.search !== undefined) validateSearchCoordinates(obj.search, obj.runId as string)\n  if (obj.traceRef !== undefined) validateTraceRef(obj.traceRef)\n\n  // Split tag.\n  if (typeof obj.splitTag !== 'string' || !SPLIT_TAGS.includes(obj.splitTag as RunSplitTag)) {\n    throw new RunRecordValidationError(\n      `splitTag must be one of ${SPLIT_TAGS.join(', ')}, got ${String(obj.splitTag)}`,\n      'splitTag',\n    )\n  }\n\n  return input as RunRecord\n}\n\nfunction validateCost(costUsd: unknown, provenance: unknown): void {\n  if (provenance === null || typeof provenance !== 'object') {\n    throw new RunRecordValidationError('costProvenance must be an object', 'costProvenance')\n  }\n  const value = provenance as Record<string, unknown>\n  if (\n    value.kind !== 'observed' &&\n    value.kind !== 'estimated' &&\n    value.kind !== 'lower-bound' &&\n    value.kind !== 'uncaptured'\n  ) {\n    throw new RunRecordValidationError(\n      'costProvenance.kind must be observed, estimated, lower-bound, or uncaptured',\n      'costProvenance.kind',\n    )\n  }\n  if (value.kind === 'lower-bound') {\n    if (value.usd !== null) {\n      throw new RunRecordValidationError(\n        'lower-bound costProvenance.usd must be null; the floor is knownLowerBoundUsd',\n        'costProvenance.usd',\n      )\n    }\n    if (costUsd !== null) {\n      throw new RunRecordValidationError(\n        'lower-bound cost requires costUsd to be null; a floor is not a total',\n        'costUsd',\n      )\n    }\n    expectFiniteNumber(value.knownLowerBoundUsd, 'costProvenance.knownLowerBoundUsd')\n    if ((value.knownLowerBoundUsd as number) <= 0) {\n      throw new RunRecordValidationError(\n        \"a lower bound must be positive; write a $0 floor as { kind: 'uncaptured', usd: null }\",\n        'costProvenance.knownLowerBoundUsd',\n      )\n    }\n    return\n  }\n  // A record must never read as a total it cannot support, so an uncaptured\n  // cost carries no number at all. A matrix `CellResult` keeps its known\n  // subtotal instead, because a cost ceiling must charge the part it can see;\n  // converting one to the other drops that subtotal.\n  if (value.kind === 'uncaptured') {\n    if (value.usd !== null) {\n      throw new RunRecordValidationError(\n        'uncaptured costProvenance.usd must be null',\n        'costProvenance.usd',\n      )\n    }\n    if (costUsd !== null) {\n      throw new RunRecordValidationError('uncaptured cost requires costUsd to be null', 'costUsd')\n    }\n    return\n  }\n  expectNonNegativeNumber(costUsd, 'costUsd')\n  expectNonNegativeNumber(value.usd, 'costProvenance.usd')\n  if (value.usd !== costUsd) {\n    throw new RunRecordValidationError(\n      'costProvenance.usd must equal costUsd',\n      'costProvenance.usd',\n    )\n  }\n}\n\nfunction validateSearchCoordinates(value: unknown, runId: string): void {\n  if (value === null || typeof value !== 'object') {\n    throw new RunRecordValidationError('search must be an object', 'search')\n  }\n  const search = value as Record<string, unknown>\n  expectString(search.searchId, 'search.searchId')\n  expectString(search.nodeId, 'search.nodeId')\n  expectString(search.cellId, 'search.cellId')\n  if (!Number.isSafeInteger(search.attempt) || (search.attempt as number) < 1) {\n    throw new RunRecordValidationError('expected an integer from 1', 'search.attempt')\n  }\n  const expected = searchCellRunId(search as unknown as RunSearchCoordinates)\n  if (runId !== expected) {\n    throw new RunRecordValidationError(\n      `runId \"${runId}\" must be \"${expected}\", the search cell and attempt it settled`,\n      'runId',\n    )\n  }\n}\n\nfunction validateTraceRef(value: unknown): void {\n  if (value === null || typeof value !== 'object') {\n    throw new RunRecordValidationError('traceRef must be an object', 'traceRef')\n  }\n  const ref = value as Record<string, unknown>\n  expectString(ref.traceId, 'traceRef.traceId')\n  if (ref.execRunId !== undefined) expectString(ref.execRunId, 'traceRef.execRunId')\n}\n\n/** Boolean validator — convenience for filtering arrays. */\nexport function isRunRecord(input: unknown): input is RunRecord {\n  try {\n    validateRunRecord(input)\n    return true\n  } catch {\n    return false\n  }\n}\n\n/** Non-throwing validator — returns a discriminated union. */\nexport function parseRunRecordSafe(\n  input: unknown,\n): { ok: true; value: RunRecord } | { ok: false; error: RunRecordValidationError } {\n  try {\n    return { ok: true, value: validateRunRecord(input) }\n  } catch (e) {\n    if (e instanceof RunRecordValidationError) return { ok: false, error: e }\n    throw e\n  }\n}\n\n// ── Internals ────────────────────────────────────────────────────────\n\nfunction expectString(value: unknown, path: string): void {\n  if (typeof value !== 'string' || value.length === 0) {\n    throw new RunRecordValidationError(`expected non-empty string`, path)\n  }\n}\n\nfunction expectFiniteNumber(value: unknown, path: string): void {\n  if (typeof value !== 'number' || !Number.isFinite(value)) {\n    throw new RunRecordValidationError(`expected finite number`, path)\n  }\n}\n\nfunction expectNonNegativeNumber(value: unknown, path: string): void {\n  expectFiniteNumber(value, path)\n  if ((value as number) < 0) {\n    throw new RunRecordValidationError('expected non-negative number', path)\n  }\n}\n\nfunction validateJudgeScores(value: unknown, path: string): void {\n  if (value === null || typeof value !== 'object') {\n    throw new RunRecordValidationError('judgeScores must be an object', path)\n  }\n  const rec = value as Record<string, unknown>\n\n  const perJudge = rec.perJudge\n  if (perJudge === null || typeof perJudge !== 'object') {\n    throw new RunRecordValidationError('perJudge must be an object', `${path}.perJudge`)\n  }\n  for (const [judgeId, dims] of Object.entries(perJudge as Record<string, unknown>)) {\n    if (dims === null || typeof dims !== 'object') {\n      throw new RunRecordValidationError(\n        'per-judge entry must be an object of dimension scores',\n        `${path}.perJudge.${judgeId}`,\n      )\n    }\n    for (const [dim, score] of Object.entries(dims as Record<string, unknown>)) {\n      expectFiniteNumber(score, `${path}.perJudge.${judgeId}.${dim}`)\n    }\n  }\n\n  const perDimMean = rec.perDimMean\n  if (perDimMean === null || typeof perDimMean !== 'object') {\n    throw new RunRecordValidationError('perDimMean must be an object', `${path}.perDimMean`)\n  }\n  for (const [dim, mean] of Object.entries(perDimMean as Record<string, unknown>)) {\n    expectFiniteNumber(mean, `${path}.perDimMean.${dim}`)\n  }\n\n  expectFiniteNumber(rec.composite, `${path}.composite`)\n\n  if (rec.failedJudges !== undefined) {\n    if (!Array.isArray(rec.failedJudges)) {\n      throw new RunRecordValidationError(\n        'failedJudges must be an array of strings',\n        `${path}.failedJudges`,\n      )\n    }\n    for (let i = 0; i < rec.failedJudges.length; i++) {\n      const id = rec.failedJudges[i]\n      if (typeof id !== 'string' || id.length === 0) {\n        throw new RunRecordValidationError(\n          'failedJudges entry must be a non-empty string',\n          `${path}.failedJudges[${i}]`,\n        )\n      }\n    }\n  }\n\n  if (rec.notes !== undefined && typeof rec.notes !== 'string') {\n    throw new RunRecordValidationError('notes must be a string', `${path}.notes`)\n  }\n}\n\n/**\n * Snapshot check for provider model identifiers. Accepts ISO and compact\n * dates, Router's `-MMDD` snapshots, one opaque `@token`, and Vertex-style\n * `:date-token` suffixes. Routing selectors such as `@preset/name` are not\n * immutable model identities.\n */\nexport function modelHasSnapshot(model: string): boolean {\n  if (model.length === 0 || model.trim() !== model) return false\n\n  const opaqueAt = model.lastIndexOf('@')\n  if (opaqueAt > 0) {\n    const base = model.slice(0, opaqueAt)\n    const token = model.slice(opaqueAt + 1)\n    if (!base.includes('@') && /^[A-Za-z0-9](?:[A-Za-z0-9._-]*[A-Za-z0-9])?$/u.test(token)) {\n      return true\n    }\n  }\n\n  const isoDate = model.match(/-(\\d{4})-(\\d{2})-(\\d{2})$/u)\n  if (isoDate && validSnapshotDate(isoDate[1]!, isoDate[2]!, isoDate[3]!)) return true\n\n  const compactDate = model.match(/-(\\d{4})(\\d{2})(\\d{2})$/u)\n  if (compactDate && validSnapshotDate(compactDate[1]!, compactDate[2]!, compactDate[3]!)) {\n    return true\n  }\n\n  const routerDate = model.match(/-(\\d{2})(\\d{2})$/u)\n  if (routerDate && validSnapshotDate(undefined, routerDate[1]!, routerDate[2]!)) return true\n\n  return /:date-[A-Za-z0-9](?:[A-Za-z0-9._-]*[A-Za-z0-9])?$/u.test(model)\n}\n\nfunction validSnapshotDate(year: string | undefined, month: string, day: string): boolean {\n  const monthNumber = Number(month)\n  const dayNumber = Number(day)\n  if (!Number.isInteger(monthNumber) || monthNumber < 1 || monthNumber > 12) return false\n\n  const yearNumber = year === undefined ? undefined : Number(year)\n  const leapYear =\n    yearNumber === undefined ||\n    (yearNumber % 4 === 0 && (yearNumber % 100 !== 0 || yearNumber % 400 === 0))\n  const daysInMonth = [31, leapYear ? 29 : 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\n  return Number.isInteger(dayNumber) && dayNumber >= 1 && dayNumber <= daysInMonth[monthNumber - 1]!\n}\n"],"mappings":";;;;;;AAiDA,MAAa,gBAAgB;;;;;;AA8D7B,SAAgB,gBAAgB,QAAkE;CAChG,OAAO,GAAG,OAAO,OAAO,GAAG,OAAO;AACpC;;;;;;;;;AA4LA,SAAgB,aAAa,QAAuC;CAClE,MAAM,QAAQ,cAAc,MAAM;CAClC,OAAO,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK,IAAI,QAAQ,KAAA;AACvE;AAIA,MAAM,sBAAsB;CAC1B;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;AAEA,MAAM,aAAyC;CAAC;CAAU;CAAO;AAAS;AAC1E,MAAM,oBAAuD;CAC3D;CACA;CACA;CACA;CACA;AACF;AAEA,IAAa,2BAAb,cAA8C,gBAAgB;CAC5D;CACA,YAAY,SAAiB,OAAO,IAAI;EACtC,MAAM,OAAO,GAAG,QAAQ,OAAO,KAAK,KAAK,OAAO;EAChD,KAAK,OAAO;CACd;AACF;;;;;;AAOA,SAAgB,kBAAkB,OAA2B;CAC3D,IAAI,UAAU,QAAQ,OAAO,UAAU,UACrC,MAAM,IAAI,yBAAyB,iBAAiB;CAEtD,MAAM,MAAM;CAEZ,KAAK,MAAM,OAAO,qBAChB,IAAI,EAAE,OAAO,MACX,MAAM,IAAI,yBAAyB,4BAA4B,IAAI,EAAE;CAIzE,aAAa,IAAI,OAAO,OAAO;CAC/B,aAAa,IAAI,cAAc,cAAc;CAC7C,aAAa,IAAI,aAAa,aAAa;CAC3C,mBAAmB,IAAI,MAAM,MAAM;CACnC,aAAa,IAAI,OAAO,OAAO;CAC/B,aAAa,IAAI,YAAY,YAAY;CACzC,aAAa,IAAI,YAAY,YAAY;CACzC,aAAa,IAAI,WAAW,WAAW;CACvC,wBAAwB,IAAI,QAAQ,QAAQ;CAC5C,IAAI,IAAI,YAAY,KAAA,GAAW,wBAAwB,IAAI,SAAS,SAAS;CAC7E,aAAa,IAAI,SAAS,IAAI,cAAc;CAK5C,IACE,CAAC,iBAAiB,IAAI,KAAe,KACrC,EAAE,IAAI,UAAA,aAA2B,IAAI,oBAAoB,cAEzD,MAAM,IAAI,yBACR,UAAU,IAAI,MAAM,4EAA4E,cAAc,kDAC9G,OACF;CAIF,MAAM,KAAK,IAAI;CACf,IAAI,OAAO,QAAQ,OAAO,OAAO,UAC/B,MAAM,IAAI,yBAAyB,gCAAgC,YAAY;CAEjF,MAAM,QAAQ;CACd,wBAAwB,MAAM,OAAO,kBAAkB;CACvD,wBAAwB,MAAM,QAAQ,mBAAmB;CACzD,IAAI,MAAM,gBAAgB,KAAA,KAAa,MAAM,gBAAgB,OAC3D,MAAM,IAAI,yBACR,gFACA,wBACF;CAEF,IAAI,MAAM,cAAc,KAAA,GAAW;EACjC,wBAAwB,MAAM,WAAW,sBAAsB;EAC/D,IAAK,MAAM,YAAwB,MAAM,QACvC,MAAM,IAAI,yBACR,sDACA,sBACF;CAEJ;CACA,IAAI,MAAM,WAAW,KAAA,GAAW,wBAAwB,MAAM,QAAQ,mBAAmB;CACzF,IAAI,MAAM,eAAe,KAAA,GACvB,wBAAwB,MAAM,YAAY,uBAAuB;CAInE,IAAI,IAAI,kBAAkB,KAAA,GAAW;EACnC,MAAM,KAAK,IAAI;EACf,IAAI,OAAO,QAAQ,OAAO,OAAO,UAC/B,MAAM,IAAI,yBAAyB,mCAAmC,eAAe;EAEvF,MAAM,QAAQ;EACd,aAAa,MAAM,OAAO,qBAAqB;EAC/C,aAAa,MAAM,eAAe,6BAA6B;EAC/D,mBAAmB,MAAM,YAAY,0BAA0B;EAC/D,IAAI,OAAO,MAAM,aAAa,WAC5B,MAAM,IAAI,yBACR,0CACA,wBACF;CAEJ;CAGA,MAAM,MAAM,IAAI;CAChB,IAAI,QAAQ,QAAQ,OAAO,QAAQ,UACjC,MAAM,IAAI,yBAAyB,6BAA6B,SAAS;CAE3E,MAAM,SAAS;CACf,IAAI,OAAO,gBAAgB,KAAA,GACzB,mBAAmB,OAAO,aAAa,qBAAqB;CAC9D,IAAI,OAAO,iBAAiB,KAAA,GAC1B,mBAAmB,OAAO,cAAc,sBAAsB;CAChE,MAAM,MAAM,OAAO;CACnB,IAAI,QAAQ,QAAQ,OAAO,QAAQ,UACjC,MAAM,IAAI,yBAAyB,iCAAiC,aAAa;CAEnF,KAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,GAA8B,GAChE,mBAAmB,GAAG,eAAe,GAAG;CAG1C,IAAI,OAAO,aAAa,KAAA,GAAW;EACjC,MAAM,IAAI,OAAO;EACjB,IAAI,MAAM,QAAQ,OAAO,MAAM,UAC7B,MAAM,IAAI,yBAAyB,sCAAsC,kBAAkB;EAE7F,MAAM,KAAK;EACX,mBAAmB,GAAG,OAAO,wBAAwB;EACrD,IAAI,OAAO,GAAG,UAAU,WACtB,MAAM,IAAI,yBACR,4CACA,wBACF;CAEJ;CAGA,IAAI,OAAO,gBAAgB,KAAA,GACzB,oBAAoB,OAAO,aAAa,qBAAqB;CAI/D,IACE,IAAI,iBAAiB,KAAA,MACpB,OAAO,IAAI,iBAAiB,YAC3B,CAAC,gBAAgB,SAAS,IAAI,YAA4B,IAE5D,MAAM,IAAI,yBACR,+BAA+B,gBAAgB,KAAK,IAAI,KACxD,cACF;CAEF,IAAI,IAAI,gBAAgB,KAAA,GAAW;EACjC,aAAa,IAAI,aAAa,aAAa;EAC3C,IAAI,IAAI,iBAAiB,KAAA,KAAa,IAAI,iBAAiB,WACzD,MAAM,IAAI,yBACR,mDACA,aACF;CAEJ;CAEA,IACE,OAAO,IAAI,oBAAoB,YAC/B,CAAC,kBAAkB,SAAS,IAAI,eAAqC,GAErE,MAAM,IAAI,yBACR,kCAAkC,kBAAkB,KAAK,IAAI,KAC7D,iBACF;CAEF,IAAI,IAAI,0BAA0B,KAAA,GAAW;EAC3C,aAAa,IAAI,uBAAuB,uBAAuB;EAC/D,IACE,IAAI,oBAAoB,YACxB,IAAI,oBAAoB,eACxB,IAAI,oBAAoB,cAExB,MAAM,IAAI,yBACR,mFACA,uBACF;CAEJ;CAEA,IAAI,IAAI,iBAAiB,KAAA,GACvB,IAAI;EACF,MAAM,UAAU,yBAAyB,IAAI,YAAY;EACzD,IAAI,QAAQ,UAAU,KAAA,KAAa,QAAQ,UAAU,IAAI,OACvD,MAAM,IAAI,yBACR,uBAAuB,QAAQ,MAAM,0BAA0B,IAAI,MAAM,IACzE,oBACF;EAEF,IAAI,QAAQ,eAAe,KAAA,KAAa,QAAQ,eAAe,IAAI,YACjE,MAAM,IAAI,yBACR,4BAA4B,QAAQ,WAAW,+BAA+B,IAAI,WAAW,IAC7F,yBACF;CAEJ,SAAS,OAAO;EACd,IAAI,iBAAiB,0BAA0B,MAAM;EACrD,IAAI,iBAAiB,OACnB,MAAM,IAAI,yBAAyB,MAAM,SAAS,cAAc;EAElE,MAAM;CACR;CAGF,aAAa,IAAI,YAAY,YAAY;CAEzC,IAAI,IAAI,WAAW,KAAA,GAAW,0BAA0B,IAAI,QAAQ,IAAI,KAAe;CACvF,IAAI,IAAI,aAAa,KAAA,GAAW,iBAAiB,IAAI,QAAQ;CAG7D,IAAI,OAAO,IAAI,aAAa,YAAY,CAAC,WAAW,SAAS,IAAI,QAAuB,GACtF,MAAM,IAAI,yBACR,2BAA2B,WAAW,KAAK,IAAI,EAAE,QAAQ,OAAO,IAAI,QAAQ,KAC5E,UACF;CAGF,OAAO;AACT;AAEA,SAAS,aAAa,SAAkB,YAA2B;CACjE,IAAI,eAAe,QAAQ,OAAO,eAAe,UAC/C,MAAM,IAAI,yBAAyB,oCAAoC,gBAAgB;CAEzF,MAAM,QAAQ;CACd,IACE,MAAM,SAAS,cACf,MAAM,SAAS,eACf,MAAM,SAAS,iBACf,MAAM,SAAS,cAEf,MAAM,IAAI,yBACR,+EACA,qBACF;CAEF,IAAI,MAAM,SAAS,eAAe;EAChC,IAAI,MAAM,QAAQ,MAChB,MAAM,IAAI,yBACR,gFACA,oBACF;EAEF,IAAI,YAAY,MACd,MAAM,IAAI,yBACR,wEACA,SACF;EAEF,mBAAmB,MAAM,oBAAoB,mCAAmC;EAChF,IAAK,MAAM,sBAAiC,GAC1C,MAAM,IAAI,yBACR,yFACA,mCACF;EAEF;CACF;CAKA,IAAI,MAAM,SAAS,cAAc;EAC/B,IAAI,MAAM,QAAQ,MAChB,MAAM,IAAI,yBACR,8CACA,oBACF;EAEF,IAAI,YAAY,MACd,MAAM,IAAI,yBAAyB,+CAA+C,SAAS;EAE7F;CACF;CACA,wBAAwB,SAAS,SAAS;CAC1C,wBAAwB,MAAM,KAAK,oBAAoB;CACvD,IAAI,MAAM,QAAQ,SAChB,MAAM,IAAI,yBACR,yCACA,oBACF;AAEJ;AAEA,SAAS,0BAA0B,OAAgB,OAAqB;CACtE,IAAI,UAAU,QAAQ,OAAO,UAAU,UACrC,MAAM,IAAI,yBAAyB,4BAA4B,QAAQ;CAEzE,MAAM,SAAS;CACf,aAAa,OAAO,UAAU,iBAAiB;CAC/C,aAAa,OAAO,QAAQ,eAAe;CAC3C,aAAa,OAAO,QAAQ,eAAe;CAC3C,IAAI,CAAC,OAAO,cAAc,OAAO,OAAO,KAAM,OAAO,UAAqB,GACxE,MAAM,IAAI,yBAAyB,8BAA8B,gBAAgB;CAEnF,MAAM,WAAW,gBAAgB,MAAyC;CAC1E,IAAI,UAAU,UACZ,MAAM,IAAI,yBACR,UAAU,MAAM,aAAa,SAAS,4CACtC,OACF;AAEJ;AAEA,SAAS,iBAAiB,OAAsB;CAC9C,IAAI,UAAU,QAAQ,OAAO,UAAU,UACrC,MAAM,IAAI,yBAAyB,8BAA8B,UAAU;CAE7E,MAAM,MAAM;CACZ,aAAa,IAAI,SAAS,kBAAkB;CAC5C,IAAI,IAAI,cAAc,KAAA,GAAW,aAAa,IAAI,WAAW,oBAAoB;AACnF;;AAGA,SAAgB,YAAY,OAAoC;CAC9D,IAAI;EACF,kBAAkB,KAAK;EACvB,OAAO;CACT,QAAQ;EACN,OAAO;CACT;AACF;;AAGA,SAAgB,mBACd,OACiF;CACjF,IAAI;EACF,OAAO;GAAE,IAAI;GAAM,OAAO,kBAAkB,KAAK;EAAE;CACrD,SAAS,GAAG;EACV,IAAI,aAAa,0BAA0B,OAAO;GAAE,IAAI;GAAO,OAAO;EAAE;EACxE,MAAM;CACR;AACF;AAIA,SAAS,aAAa,OAAgB,MAAoB;CACxD,IAAI,OAAO,UAAU,YAAY,MAAM,WAAW,GAChD,MAAM,IAAI,yBAAyB,6BAA6B,IAAI;AAExE;AAEA,SAAS,mBAAmB,OAAgB,MAAoB;CAC9D,IAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,GACrD,MAAM,IAAI,yBAAyB,0BAA0B,IAAI;AAErE;AAEA,SAAS,wBAAwB,OAAgB,MAAoB;CACnE,mBAAmB,OAAO,IAAI;CAC9B,IAAK,QAAmB,GACtB,MAAM,IAAI,yBAAyB,gCAAgC,IAAI;AAE3E;AAEA,SAAS,oBAAoB,OAAgB,MAAoB;CAC/D,IAAI,UAAU,QAAQ,OAAO,UAAU,UACrC,MAAM,IAAI,yBAAyB,iCAAiC,IAAI;CAE1E,MAAM,MAAM;CAEZ,MAAM,WAAW,IAAI;CACrB,IAAI,aAAa,QAAQ,OAAO,aAAa,UAC3C,MAAM,IAAI,yBAAyB,8BAA8B,GAAG,KAAK,UAAU;CAErF,KAAK,MAAM,CAAC,SAAS,SAAS,OAAO,QAAQ,QAAmC,GAAG;EACjF,IAAI,SAAS,QAAQ,OAAO,SAAS,UACnC,MAAM,IAAI,yBACR,yDACA,GAAG,KAAK,YAAY,SACtB;EAEF,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,IAA+B,GACvE,mBAAmB,OAAO,GAAG,KAAK,YAAY,QAAQ,GAAG,KAAK;CAElE;CAEA,MAAM,aAAa,IAAI;CACvB,IAAI,eAAe,QAAQ,OAAO,eAAe,UAC/C,MAAM,IAAI,yBAAyB,gCAAgC,GAAG,KAAK,YAAY;CAEzF,KAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAAQ,UAAqC,GAC5E,mBAAmB,MAAM,GAAG,KAAK,cAAc,KAAK;CAGtD,mBAAmB,IAAI,WAAW,GAAG,KAAK,WAAW;CAErD,IAAI,IAAI,iBAAiB,KAAA,GAAW;EAClC,IAAI,CAAC,MAAM,QAAQ,IAAI,YAAY,GACjC,MAAM,IAAI,yBACR,4CACA,GAAG,KAAK,cACV;EAEF,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,aAAa,QAAQ,KAAK;GAChD,MAAM,KAAK,IAAI,aAAa;GAC5B,IAAI,OAAO,OAAO,YAAY,GAAG,WAAW,GAC1C,MAAM,IAAI,yBACR,iDACA,GAAG,KAAK,gBAAgB,EAAE,EAC5B;EAEJ;CACF;CAEA,IAAI,IAAI,UAAU,KAAA,KAAa,OAAO,IAAI,UAAU,UAClD,MAAM,IAAI,yBAAyB,0BAA0B,GAAG,KAAK,OAAO;AAEhF;;;;;;;AAQA,SAAgB,iBAAiB,OAAwB;CACvD,IAAI,MAAM,WAAW,KAAK,MAAM,KAAK,MAAM,OAAO,OAAO;CAEzD,MAAM,WAAW,MAAM,YAAY,GAAG;CACtC,IAAI,WAAW,GAAG;EAChB,MAAM,OAAO,MAAM,MAAM,GAAG,QAAQ;EACpC,MAAM,QAAQ,MAAM,MAAM,WAAW,CAAC;EACtC,IAAI,CAAC,KAAK,SAAS,GAAG,KAAK,gDAAgD,KAAK,KAAK,GACnF,OAAO;CAEX;CAEA,MAAM,UAAU,MAAM,MAAM,4BAA4B;CACxD,IAAI,WAAW,kBAAkB,QAAQ,IAAK,QAAQ,IAAK,QAAQ,EAAG,GAAG,OAAO;CAEhF,MAAM,cAAc,MAAM,MAAM,0BAA0B;CAC1D,IAAI,eAAe,kBAAkB,YAAY,IAAK,YAAY,IAAK,YAAY,EAAG,GACpF,OAAO;CAGT,MAAM,aAAa,MAAM,MAAM,mBAAmB;CAClD,IAAI,cAAc,kBAAkB,KAAA,GAAW,WAAW,IAAK,WAAW,EAAG,GAAG,OAAO;CAEvF,OAAO,qDAAqD,KAAK,KAAK;AACxE;AAEA,SAAS,kBAAkB,MAA0B,OAAe,KAAsB;CACxF,MAAM,cAAc,OAAO,KAAK;CAChC,MAAM,YAAY,OAAO,GAAG;CAC5B,IAAI,CAAC,OAAO,UAAU,WAAW,KAAK,cAAc,KAAK,cAAc,IAAI,OAAO;CAElF,MAAM,aAAa,SAAS,KAAA,IAAY,KAAA,IAAY,OAAO,IAAI;CAI/D,MAAM,cAAc;EAAC;EAFnB,eAAe,KAAA,KACd,aAAa,MAAM,MAAM,aAAa,QAAQ,KAAK,aAAa,QAAQ,KACvC,KAAK;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;CAAE;CACnF,OAAO,OAAO,UAAU,SAAS,KAAK,aAAa,KAAK,aAAa,YAAY,cAAc;AACjG"}

package/dist/{run-record-D1Hw-Jml.d.ts → run-record-C1E24G2A.d.ts}

@@ -1,5 +1,5 @@
+import { l as CostProvenance } from "./cost-ledger-Jk62OBfF.js";
 import { c as ValidationError } from "./errors-DEE6u6ot.js";
-import { p as CostProvenance } from "./cost-ledger-CO7UyEcQ.js";
 import { r as AgentProfileCell } from "./agent-profile-cell-BNp-Js9F.js";
 import { o as FailureClass } from "./schema-2g7trUwH.js";
 //#region src/run-record.d.ts
@@ -292,4 +292,4 @@ declare function parseRunRecordSafe(input: unknown): {
 declare function modelHasSnapshot(model: string): boolean;
 //#endregion
 export { runTaskScore as _, RunRecord as a, RunSplitTag as c, RunTokenUsage as d, RunTraceRef as f, parseRunRecordSafe as g, modelHasSnapshot as h, RunOutcome as i, RunTaskFailure as l, isRunRecord as m, RunCostProvenance as n, RunRecordValidationError as o, UNKNOWN_MODEL as p, RunJudgeMetadata as r, RunSearchCoordinates as s, JudgeScoresRecord as t, RunTerminalOutcome as u, searchCellRunId as v, validateRunRecord as y };
-//# sourceMappingURL=run-record-D1Hw-Jml.d.ts.map
+//# sourceMappingURL=run-record-C1E24G2A.d.ts.map

package/dist/{run-record-D1Hw-Jml.d.ts.map → run-record-C1E24G2A.d.ts.map}

@@ -1 +1 @@
-{"version":3,"file":"run-record-D1Hw-Jml.d.ts","names":[],"sources":["../src/run-record.ts"],"mappings":";;;;;;;KAsCY;;;;;;;KAQA;;cAGC;UAEI;EACf;;EAEA;;;EAGA;;EAEA;;EAEA;;EAEA;;;;;;;;;;;;;;;KAgBU,oBACR;EACE;EAAqB;EAAW;;;;;;;UAOrB;EACf;EACA;;;EAGA;;EAEA;;;UAIe;;EAEf;;EAEA;;;;;;;iBAQc,gBAAgB,QAAQ,KAAK;UAI5B;EACf;EACA;;;EAGA;;;EAGA;;;;;;;;;;;;;;;;;;;;;UAsBe;;EAEf,UAAU,eAAe;;EAEzB,YAAY;;;EAGZ;;;;EAIA;;;EAGA;;UAGe;;;EAGf;;;EAGA;;;;EAIA,KAAK;;;;;;EAML,cAAc;;;;;;;EAOd;IAAa;IAAe;IAAgB;;;;;;;;;;;;;;;;;;;;;;UAsB7B;;EAEf;;;EAGA;;;EAGA;;;EAGA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;;EAGA,gBAAgB;;EAEhB,YAAY;;EAEZ,iBAAiB;;;EAGjB;;EAEA,gBAAgB;;EAEhB,SAAS;;;;;EAKT,eAAe;;;EAGf;;EAEA,UAAU;;;;;EAKV;;;;;;;;EAQA,eAAe;;;EAGf,SAAS;;;EAGT,WAAW;;;;;;;;;KAUD;EACN;EAA0B;;EAC1B;EAAyB;;EAEzB,cAAc,QAAQ;EACtB;;;;;;;;;;iBAWU,aAAa,QAAQ;cAmCxB,iCAAiC;WACnC;EACT,YAAY,iBAAiB;;;;;;;iBAWf,kBAAkB,iBAAiB;;iBA2SnC,YAAY,iBAAiB,SAAS;;iBAUtC,mBACd;EACG;EAAU,OAAO;;EAAgB;EAAW,OAAO;;;;;;;;iBA2FxC,iBAAiB"}
+{"version":3,"file":"run-record-C1E24G2A.d.ts","names":[],"sources":["../src/run-record.ts"],"mappings":";;;;;;;KAsCY;;;;;;;KAQA;;cAGC;UAEI;EACf;;EAEA;;;EAGA;;EAEA;;EAEA;;EAEA;;;;;;;;;;;;;;;KAgBU,oBACR;EACE;EAAqB;EAAW;;;;;;;UAOrB;EACf;EACA;;;EAGA;;EAEA;;;UAIe;;EAEf;;EAEA;;;;;;;iBAQc,gBAAgB,QAAQ,KAAK;UAI5B;EACf;EACA;;;EAGA;;;EAGA;;;;;;;;;;;;;;;;;;;;;UAsBe;;EAEf,UAAU,eAAe;;EAEzB,YAAY;;;EAGZ;;;;EAIA;;;EAGA;;UAGe;;;EAGf;;;EAGA;;;;EAIA,KAAK;;;;;;EAML,cAAc;;;;;;;EAOd;IAAa;IAAe;IAAgB;;;;;;;;;;;;;;;;;;;;;;UAsB7B;;EAEf;;;EAGA;;;EAGA;;;EAGA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;;EAGA,gBAAgB;;EAEhB,YAAY;;EAEZ,iBAAiB;;;EAGjB;;EAEA,gBAAgB;;EAEhB,SAAS;;;;;EAKT,eAAe;;;EAGf;;EAEA,UAAU;;;;;EAKV;;;;;;;;EAQA,eAAe;;;EAGf,SAAS;;;EAGT,WAAW;;;;;;;;;KAUD;EACN;EAA0B;;EAC1B;EAAyB;;EAEzB,cAAc,QAAQ;EACtB;;;;;;;;;;iBAWU,aAAa,QAAQ;cAmCxB,iCAAiC;WACnC;EACT,YAAY,iBAAiB;;;;;;;iBAWf,kBAAkB,iBAAiB;;iBA2SnC,YAAY,iBAAiB,SAAS;;iBAUtC,mBACd;EACG;EAAU,OAAO;;EAAgB;EAAW,OAAO;;;;;;;;iBA2FxC,iBAAiB"}

package/dist/{run-record-ES07wfz9.js → run-record-C5e7FjhJ.js}

@@ -1,4 +1,5 @@
-import { c as validateRunRecord } from "./run-record-DlTZ_lqe.js";
+import { c as validateRunRecord } from "./run-record-Boc5IUTp.js";
+import { t as mean } from "./mean-DHoMiudD.js";
 //#region src/campaign/run-record.ts
 /**
 * A campaign cell carried a judge score without a `dimensions` record.
@@ -214,10 +215,7 @@ function finiteMetrics(metrics) {
 	for (const [key, value] of Object.entries(metrics ?? {})) if (Number.isFinite(value)) finite[key] = value;
 	return finite;
 }
-function mean(values) {
-	return values.reduce((sum, value) => sum + value, 0) / values.length;
-}
 //#endregion
 export { campaignCellToRunRecord as n, projectCampaignCellQuality as r, campaignCellCostProvenance as t };
 
-//# sourceMappingURL=run-record-ES07wfz9.js.map
+//# sourceMappingURL=run-record-C5e7FjhJ.js.map

package/dist/run-record-C5e7FjhJ.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"run-record-C5e7FjhJ.js","names":[],"sources":["../src/campaign/run-record.ts"],"sourcesContent":["import type { AgentProfileCell } from '../agent-profile-cell'\nimport type { CostProvenance } from '../cost-ledger'\nimport type {\n  JudgeScoresRecord,\n  RunCostProvenance,\n  RunOutcome,\n  RunRecord,\n  RunSearchCoordinates,\n  RunSplitTag,\n  RunTerminalOutcome,\n  RunTraceRef,\n} from '../run-record'\nimport { validateRunRecord } from '../run-record'\nimport { mean } from '../statistics/mean'\nimport type { CampaignCellResult, JudgeScore } from './types'\n\nexport interface CampaignCellRunRecordOptions {\n  /** With `search`, this must be `searchCellRunId(search)`. */\n  runId: string\n  experimentId: string\n  candidateId: string\n  model: string\n  promptHash: string\n  configHash: string\n  commitSha: string\n  splitTag: RunSplitTag\n  seed?: number\n  scenarioId?: string\n  /** Estimated total for a cell that proved no spend at all. A cell that\n   *  proved part of its spend keeps that floor instead. */\n  defaultCostUsd?: number\n  agentProfile?: AgentProfileCell\n  raw?: Record<string, number>\n  search?: RunSearchCoordinates\n  traceRef?: RunTraceRef\n}\n\nexport interface CampaignCellQualityProjection {\n  score?: number\n  judgeScores?: JudgeScoresRecord\n  successfulJudgeScores: Record<string, JudgeScore>\n  failedJudges: string[]\n  raw: Record<string, number>\n}\n\n/**\n * A campaign cell carried a judge score without a `dimensions` record.\n *\n * Two exported types share the name `JudgeScore`: the campaign verdict\n * (`{ dimensions, composite, notes }` from `@tangle-network/agent-eval/campaign`)\n * and the root export's flat per-dimension row (`{ judgeName, dimension, score }`\n * from `@tangle-network/agent-eval`). Campaign aggregation accepts only the\n * campaign shape; the flat shape previously crashed here with an opaque\n * TypeError deep inside aggregation.\n */\nexport class CampaignJudgeScoreShapeError extends TypeError {\n  constructor(judgeName: string) {\n    super(\n      `campaign cell judge '${judgeName}' carries a score without a 'dimensions' record. ` +\n        `Use the campaign JudgeScore ({ dimensions, composite, notes }) from ` +\n        `'@tangle-network/agent-eval/campaign'; the root export's JudgeScore ` +\n        `({ judgeName, dimension, score }) is a different type with the same name.`,\n    )\n    this.name = 'CampaignJudgeScoreShapeError'\n  }\n}\n\nexport interface CampaignCellExecutionEvidence {\n  terminalOutcome: RunTerminalOutcome\n  executionErrorCount?: number\n  judgeErrorCount?: number\n  unclassifiedErrorCount?: number\n  terminalFailureReason?: string\n}\n\n/**\n * Project one campaign cell into the canonical run format.\n *\n * A dispatch error establishes terminal execution failure. A judge error only\n * establishes that quality measurement failed after dispatch completed.\n * Failures without a stage remain unknown. No failure becomes a zero-quality\n * label.\n */\nexport function campaignCellToRunRecord<TArtifact>(\n  cell: CampaignCellResult<TArtifact>,\n  options: CampaignCellRunRecordOptions,\n): RunRecord {\n  const quality = projectCampaignCellQuality(cell)\n  const execution = campaignCellExecutionEvidence(cell)\n  const judgeErrorCount = Math.max(\n    quality.raw.judge_error_count ?? 0,\n    execution.judgeErrorCount ?? 0,\n  )\n  const costProvenance = campaignCellRunCostProvenance(cell, options.defaultCostUsd)\n  const costUsd = costProvenance.usd\n  const raw: Record<string, number> = {\n    ...finiteMetrics(options.raw),\n    ...quality.raw,\n    rep: cell.rep,\n    duration_ms: cell.durationMs,\n    ...(costUsd === null ? {} : { cost_usd: costUsd }),\n    tokens_input: cell.tokenUsage.input,\n    tokens_output: cell.tokenUsage.output,\n    tokens_known: cell.tokenUsage.tokensKnown === false ? 0 : 1,\n    latency_ms: cell.durationMs,\n    ...(execution.executionErrorCount === undefined\n      ? {}\n      : { execution_error_count: execution.executionErrorCount }),\n    ...(judgeErrorCount > 0 ? { judge_error_count: judgeErrorCount } : {}),\n    ...(execution.unclassifiedErrorCount === undefined\n      ? {}\n      : { unclassified_error_count: execution.unclassifiedErrorCount }),\n  }\n  if (typeof cell.generation === 'number') raw.generation = cell.generation\n  if (cell.tokenUsage.reasoning !== undefined) {\n    raw.tokens_reasoning = cell.tokenUsage.reasoning\n  }\n  if (cell.tokenUsage.cached !== undefined) raw.tokens_cached = cell.tokenUsage.cached\n  if (cell.tokenUsage.cacheWrite !== undefined) {\n    raw.tokens_cache_write = cell.tokenUsage.cacheWrite\n  }\n  if (cell.tokenUsage.tokensKnown !== false && costUsd !== null && costUsd > 0) {\n    raw.tokens_per_dollar = (cell.tokenUsage.input + cell.tokenUsage.output) / costUsd\n  }\n  if (costUsd !== null && quality.score !== undefined && quality.score > 0.01) {\n    raw.cost_per_quality = costUsd / quality.score\n  }\n\n  const outcome: RunOutcome = {\n    raw,\n    ...(quality.judgeScores ? { judgeScores: quality.judgeScores } : {}),\n  }\n  if (quality.score !== undefined) {\n    if (options.splitTag === 'holdout') outcome.holdoutScore = quality.score\n    else outcome.searchScore = quality.score\n  }\n\n  return validateRunRecord({\n    runId: options.runId,\n    experimentId: options.experimentId,\n    candidateId: options.candidateId,\n    seed: options.seed ?? cell.seed,\n    model: options.model,\n    promptHash: options.promptHash,\n    configHash: options.configHash,\n    commitSha: options.commitSha,\n    wallMs: cell.durationMs,\n    costUsd,\n    costProvenance,\n    tokenUsage: { ...cell.tokenUsage },\n    terminalOutcome: execution.terminalOutcome,\n    ...(execution.terminalFailureReason\n      ? { terminalFailureReason: execution.terminalFailureReason }\n      : {}),\n    outcome,\n    splitTag: options.splitTag,\n    scenarioId: options.scenarioId ?? cell.scenarioId,\n    ...(options.agentProfile ? { agentProfile: options.agentProfile } : {}),\n    ...(options.search ? { search: options.search } : {}),\n    ...(options.traceRef ? { traceRef: options.traceRef } : {}),\n  })\n}\n\n/**\n * A cell's cost as a RunRecord states it. An uncaptured cell's `costUsd` is\n * the spend its receipts proved, so a positive one is the run's floor. The\n * caller's `defaultCostUsd` stands in only when nothing was proved: a proven\n * floor is never replaced by a guess.\n */\nfunction campaignCellRunCostProvenance<TArtifact>(\n  cell: CampaignCellResult<TArtifact>,\n  defaultCostUsd: number | undefined,\n): RunCostProvenance {\n  const provenance = campaignCellCostProvenance(cell)\n  if (provenance.kind !== 'uncaptured') return provenance\n  if (cell.costUsd > 0) return { kind: 'lower-bound', usd: null, knownLowerBoundUsd: cell.costUsd }\n  return defaultCostUsd === undefined ? provenance : { kind: 'estimated', usd: defaultCostUsd }\n}\n\n/**\n * Validate the cost fields that cross campaign cache and RunRecord boundaries.\n * `costUsd` is a known subtotal for uncaptured cells, but it must equal the\n * authoritative total whenever that total is observed or estimated.\n */\nexport function campaignCellCostProvenance<TArtifact>(\n  cell: Pick<CampaignCellResult<TArtifact>, 'cellId' | 'costUsd' | 'costProvenance'>,\n): CostProvenance {\n  if (!Number.isFinite(cell.costUsd) || cell.costUsd < 0) {\n    throw new Error(`campaign cell '${cell.cellId}' has invalid costUsd`)\n  }\n  const provenance = cell.costProvenance\n  if (!provenance || typeof provenance !== 'object') {\n    throw new Error(`campaign cell '${cell.cellId}' has no costProvenance`)\n  }\n  if (provenance.kind === 'uncaptured') {\n    if (provenance.usd !== null) {\n      throw new Error(`campaign cell '${cell.cellId}' has invalid uncaptured costProvenance`)\n    }\n    return { kind: 'uncaptured', usd: null }\n  }\n  if (\n    (provenance.kind !== 'observed' && provenance.kind !== 'estimated') ||\n    !Number.isFinite(provenance.usd) ||\n    provenance.usd < 0\n  ) {\n    throw new Error(`campaign cell '${cell.cellId}' has invalid costProvenance`)\n  }\n  if (provenance.usd !== cell.costUsd) {\n    throw new Error(`campaign cell '${cell.cellId}' has costUsd inconsistent with costProvenance`)\n  }\n  return { kind: provenance.kind, usd: provenance.usd }\n}\n\nexport function campaignCellExecutionEvidence<TArtifact>(\n  cell: CampaignCellResult<TArtifact>,\n): CampaignCellExecutionEvidence {\n  if (cell.errorStage === 'dispatch') {\n    return {\n      terminalOutcome: 'failed',\n      executionErrorCount: 1,\n      ...(cell.error ? { terminalFailureReason: cell.error } : {}),\n    }\n  }\n  if (cell.errorStage === 'judge') {\n    return {\n      terminalOutcome: 'succeeded',\n      executionErrorCount: 0,\n      judgeErrorCount: 1,\n    }\n  }\n  if (!cell.error) {\n    return { terminalOutcome: 'succeeded', executionErrorCount: 0 }\n  }\n  return {\n    terminalOutcome: 'unknown',\n    unclassifiedErrorCount: 1,\n  }\n}\n\n/**\n * Produce the only task-quality view used by campaign aggregates and exports.\n *\n * Successful judge results remain available for diagnosis after another judge\n * fails, but a task score exists only for an error-free cell whose reported\n * judge values are all finite.\n */\nexport function projectCampaignCellQuality<TArtifact>(\n  cell: CampaignCellResult<TArtifact>,\n): CampaignCellQualityProjection {\n  if (cell.errorStage === 'dispatch') {\n    return { successfulJudgeScores: {}, failedJudges: [], raw: {} }\n  }\n\n  const perJudge: Record<string, Record<string, number>> = {}\n  const successfulJudgeScores: Record<string, JudgeScore> = {}\n  const dimensionValues = new Map<string, number[]>()\n  const composites: number[] = []\n  const notes: string[] = []\n  const failedJudges = new Set<string>(\n    cell.errorStage === 'judge' ? [cell.errorJudge ?? 'unknown-judge'] : [],\n  )\n  const raw: Record<string, number> = {}\n\n  for (const [judgeName, score] of Object.entries(cell.judgeScores)) {\n    const dimensionsShape = (score as { dimensions?: unknown }).dimensions\n    if (\n      typeof dimensionsShape !== 'object' ||\n      dimensionsShape === null ||\n      Array.isArray(dimensionsShape)\n    ) {\n      throw new CampaignJudgeScoreShapeError(judgeName)\n    }\n    const finiteDimensions = Object.values(score.dimensions).every(Number.isFinite)\n    if (score.failed || !Number.isFinite(score.composite) || !finiteDimensions) {\n      failedJudges.add(judgeName)\n      continue\n    }\n\n    composites.push(score.composite)\n    successfulJudgeScores[judgeName] = score\n    const dimensions = { ...score.dimensions }\n    perJudge[judgeName] = dimensions\n    for (const [dimension, value] of Object.entries(dimensions)) {\n      raw[`${judgeName}.${dimension}`] = value\n      const values = dimensionValues.get(dimension) ?? []\n      values.push(value)\n      dimensionValues.set(dimension, values)\n    }\n    if (score.notes) notes.push(`${judgeName}: ${score.notes}`)\n    for (const failedJudge of score.failedJudges ?? []) {\n      failedJudges.add(`${judgeName}/${failedJudge}`)\n    }\n  }\n\n  if (failedJudges.size > 0) raw.judge_error_count = failedJudges.size\n  const sortedFailedJudges = [...failedJudges].sort()\n  if (composites.length === 0) {\n    return {\n      successfulJudgeScores,\n      failedJudges: sortedFailedJudges,\n      raw,\n    }\n  }\n\n  const composite = mean(composites)\n  const perDimMean = Object.fromEntries(\n    [...dimensionValues.entries()].map(([dimension, values]) => [dimension, mean(values)]),\n  )\n  const complete =\n    cell.error === undefined && cell.errorStage === undefined && failedJudges.size === 0\n  if (complete) raw.composite = composite\n\n  return {\n    ...(complete ? { score: composite } : {}),\n    raw,\n    successfulJudgeScores,\n    failedJudges: sortedFailedJudges,\n    judgeScores: {\n      perJudge,\n      perDimMean,\n      composite,\n      ...(sortedFailedJudges.length > 0 ? { failedJudges: sortedFailedJudges } : {}),\n      ...(notes.length > 0 ? { notes: notes.join(' | ') } : {}),\n    },\n  }\n}\n\nfunction finiteMetrics(metrics: Record<string, number> | undefined): Record<string, number> {\n  const finite: Record<string, number> = {}\n  for (const [key, value] of Object.entries(metrics ?? {})) {\n    if (Number.isFinite(value)) finite[key] = value\n  }\n  return finite\n}\n"],"mappings":";;;;;;;;;;;;;AAuDA,IAAa,+BAAb,cAAkD,UAAU;CAC1D,YAAY,WAAmB;EAC7B,MACE,wBAAwB,UAAU,mQAIpC;EACA,KAAK,OAAO;CACd;AACF;;;;;;;;;AAkBA,SAAgB,wBACd,MACA,SACW;CACX,MAAM,UAAU,2BAA2B,IAAI;CAC/C,MAAM,YAAY,8BAA8B,IAAI;CACpD,MAAM,kBAAkB,KAAK,IAC3B,QAAQ,IAAI,qBAAqB,GACjC,UAAU,mBAAmB,CAC/B;CACA,MAAM,iBAAiB,8BAA8B,MAAM,QAAQ,cAAc;CACjF,MAAM,UAAU,eAAe;CAC/B,MAAM,MAA8B;EAClC,GAAG,cAAc,QAAQ,GAAG;EAC5B,GAAG,QAAQ;EACX,KAAK,KAAK;EACV,aAAa,KAAK;EAClB,GAAI,YAAY,OAAO,CAAC,IAAI,EAAE,UAAU,QAAQ;EAChD,cAAc,KAAK,WAAW;EAC9B,eAAe,KAAK,WAAW;EAC/B,cAAc,KAAK,WAAW,gBAAgB,QAAQ,IAAI;EAC1D,YAAY,KAAK;EACjB,GAAI,UAAU,wBAAwB,KAAA,IAClC,CAAC,IACD,EAAE,uBAAuB,UAAU,oBAAoB;EAC3D,GAAI,kBAAkB,IAAI,EAAE,mBAAmB,gBAAgB,IAAI,CAAC;EACpE,GAAI,UAAU,2BAA2B,KAAA,IACrC,CAAC,IACD,EAAE,0BAA0B,UAAU,uBAAuB;CACnE;CACA,IAAI,OAAO,KAAK,eAAe,UAAU,IAAI,aAAa,KAAK;CAC/D,IAAI,KAAK,WAAW,cAAc,KAAA,GAChC,IAAI,mBAAmB,KAAK,WAAW;CAEzC,IAAI,KAAK,WAAW,WAAW,KAAA,GAAW,IAAI,gBAAgB,KAAK,WAAW;CAC9E,IAAI,KAAK,WAAW,eAAe,KAAA,GACjC,IAAI,qBAAqB,KAAK,WAAW;CAE3C,IAAI,KAAK,WAAW,gBAAgB,SAAS,YAAY,QAAQ,UAAU,GACzE,IAAI,qBAAqB,KAAK,WAAW,QAAQ,KAAK,WAAW,UAAU;CAE7E,IAAI,YAAY,QAAQ,QAAQ,UAAU,KAAA,KAAa,QAAQ,QAAQ,KACrE,IAAI,mBAAmB,UAAU,QAAQ;CAG3C,MAAM,UAAsB;EAC1B;EACA,GAAI,QAAQ,cAAc,EAAE,aAAa,QAAQ,YAAY,IAAI,CAAC;CACpE;CACA,IAAI,QAAQ,UAAU,KAAA,GAAW;EAC/B,IAAI,QAAQ,aAAa,WAAW,QAAQ,eAAe,QAAQ;OAC9D,QAAQ,cAAc,QAAQ;CACrC;CAEA,OAAO,kBAAkB;EACvB,OAAO,QAAQ;EACf,cAAc,QAAQ;EACtB,aAAa,QAAQ;EACrB,MAAM,QAAQ,QAAQ,KAAK;EAC3B,OAAO,QAAQ;EACf,YAAY,QAAQ;EACpB,YAAY,QAAQ;EACpB,WAAW,QAAQ;EACnB,QAAQ,KAAK;EACb;EACA;EACA,YAAY,EAAE,GAAG,KAAK,WAAW;EACjC,iBAAiB,UAAU;EAC3B,GAAI,UAAU,wBACV,EAAE,uBAAuB,UAAU,sBAAsB,IACzD,CAAC;EACL;EACA,UAAU,QAAQ;EAClB,YAAY,QAAQ,cAAc,KAAK;EACvC,GAAI,QAAQ,eAAe,EAAE,cAAc,QAAQ,aAAa,IAAI,CAAC;EACrE,GAAI,QAAQ,SAAS,EAAE,QAAQ,QAAQ,OAAO,IAAI,CAAC;EACnD,GAAI,QAAQ,WAAW,EAAE,UAAU,QAAQ,SAAS,IAAI,CAAC;CAC3D,CAAC;AACH;;;;;;;AAQA,SAAS,8BACP,MACA,gBACmB;CACnB,MAAM,aAAa,2BAA2B,IAAI;CAClD,IAAI,WAAW,SAAS,cAAc,OAAO;CAC7C,IAAI,KAAK,UAAU,GAAG,OAAO;EAAE,MAAM;EAAe,KAAK;EAAM,oBAAoB,KAAK;CAAQ;CAChG,OAAO,mBAAmB,KAAA,IAAY,aAAa;EAAE,MAAM;EAAa,KAAK;CAAe;AAC9F;;;;;;AAOA,SAAgB,2BACd,MACgB;CAChB,IAAI,CAAC,OAAO,SAAS,KAAK,OAAO,KAAK,KAAK,UAAU,GACnD,MAAM,IAAI,MAAM,kBAAkB,KAAK,OAAO,sBAAsB;CAEtE,MAAM,aAAa,KAAK;CACxB,IAAI,CAAC,cAAc,OAAO,eAAe,UACvC,MAAM,IAAI,MAAM,kBAAkB,KAAK,OAAO,wBAAwB;CAExE,IAAI,WAAW,SAAS,cAAc;EACpC,IAAI,WAAW,QAAQ,MACrB,MAAM,IAAI,MAAM,kBAAkB,KAAK,OAAO,wCAAwC;EAExF,OAAO;GAAE,MAAM;GAAc,KAAK;EAAK;CACzC;CACA,IACG,WAAW,SAAS,cAAc,WAAW,SAAS,eACvD,CAAC,OAAO,SAAS,WAAW,GAAG,KAC/B,WAAW,MAAM,GAEjB,MAAM,IAAI,MAAM,kBAAkB,KAAK,OAAO,6BAA6B;CAE7E,IAAI,WAAW,QAAQ,KAAK,SAC1B,MAAM,IAAI,MAAM,kBAAkB,KAAK,OAAO,+CAA+C;CAE/F,OAAO;EAAE,MAAM,WAAW;EAAM,KAAK,WAAW;CAAI;AACtD;AAEA,SAAgB,8BACd,MAC+B;CAC/B,IAAI,KAAK,eAAe,YACtB,OAAO;EACL,iBAAiB;EACjB,qBAAqB;EACrB,GAAI,KAAK,QAAQ,EAAE,uBAAuB,KAAK,MAAM,IAAI,CAAC;CAC5D;CAEF,IAAI,KAAK,eAAe,SACtB,OAAO;EACL,iBAAiB;EACjB,qBAAqB;EACrB,iBAAiB;CACnB;CAEF,IAAI,CAAC,KAAK,OACR,OAAO;EAAE,iBAAiB;EAAa,qBAAqB;CAAE;CAEhE,OAAO;EACL,iBAAiB;EACjB,wBAAwB;CAC1B;AACF;;;;;;;;AASA,SAAgB,2BACd,MAC+B;CAC/B,IAAI,KAAK,eAAe,YACtB,OAAO;EAAE,uBAAuB,CAAC;EAAG,cAAc,CAAC;EAAG,KAAK,CAAC;CAAE;CAGhE,MAAM,WAAmD,CAAC;CAC1D,MAAM,wBAAoD,CAAC;CAC3D,MAAM,kCAAkB,IAAI,IAAsB;CAClD,MAAM,aAAuB,CAAC;CAC9B,MAAM,QAAkB,CAAC;CACzB,MAAM,eAAe,IAAI,IACvB,KAAK,eAAe,UAAU,CAAC,KAAK,cAAc,eAAe,IAAI,CAAC,CACxE;CACA,MAAM,MAA8B,CAAC;CAErC,KAAK,MAAM,CAAC,WAAW,UAAU,OAAO,QAAQ,KAAK,WAAW,GAAG;EACjE,MAAM,kBAAmB,MAAmC;EAC5D,IACE,OAAO,oBAAoB,YAC3B,oBAAoB,QACpB,MAAM,QAAQ,eAAe,GAE7B,MAAM,IAAI,6BAA6B,SAAS;EAElD,MAAM,mBAAmB,OAAO,OAAO,MAAM,UAAU,CAAC,CAAC,MAAM,OAAO,QAAQ;EAC9E,IAAI,MAAM,UAAU,CAAC,OAAO,SAAS,MAAM,SAAS,KAAK,CAAC,kBAAkB;GAC1E,aAAa,IAAI,SAAS;GAC1B;EACF;EAEA,WAAW,KAAK,MAAM,SAAS;EAC/B,sBAAsB,aAAa;EACnC,MAAM,aAAa,EAAE,GAAG,MAAM,WAAW;EACzC,SAAS,aAAa;EACtB,KAAK,MAAM,CAAC,WAAW,UAAU,OAAO,QAAQ,UAAU,GAAG;GAC3D,IAAI,GAAG,UAAU,GAAG,eAAe;GACnC,MAAM,SAAS,gBAAgB,IAAI,SAAS,KAAK,CAAC;GAClD,OAAO,KAAK,KAAK;GACjB,gBAAgB,IAAI,WAAW,MAAM;EACvC;EACA,IAAI,MAAM,OAAO,MAAM,KAAK,GAAG,UAAU,IAAI,MAAM,OAAO;EAC1D,KAAK,MAAM,eAAe,MAAM,gBAAgB,CAAC,GAC/C,aAAa,IAAI,GAAG,UAAU,GAAG,aAAa;CAElD;CAEA,IAAI,aAAa,OAAO,GAAG,IAAI,oBAAoB,aAAa;CAChE,MAAM,qBAAqB,CAAC,GAAG,YAAY,CAAC,CAAC,KAAK;CAClD,IAAI,WAAW,WAAW,GACxB,OAAO;EACL;EACA,cAAc;EACd;CACF;CAGF,MAAM,YAAY,KAAK,UAAU;CACjC,MAAM,aAAa,OAAO,YACxB,CAAC,GAAG,gBAAgB,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,YAAY,CAAC,WAAW,KAAK,MAAM,CAAC,CAAC,CACvF;CACA,MAAM,WACJ,KAAK,UAAU,KAAA,KAAa,KAAK,eAAe,KAAA,KAAa,aAAa,SAAS;CACrF,IAAI,UAAU,IAAI,YAAY;CAE9B,OAAO;EACL,GAAI,WAAW,EAAE,OAAO,UAAU,IAAI,CAAC;EACvC;EACA;EACA,cAAc;EACd,aAAa;GACX;GACA;GACA;GACA,GAAI,mBAAmB,SAAS,IAAI,EAAE,cAAc,mBAAmB,IAAI,CAAC;GAC5E,GAAI,MAAM,SAAS,IAAI,EAAE,OAAO,MAAM,KAAK,KAAK,EAAE,IAAI,CAAC;EACzD;CACF;AACF;AAEA,SAAS,cAAc,SAAqE;CAC1F,MAAM,SAAiC,CAAC;CACxC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,WAAW,CAAC,CAAC,GACrD,IAAI,OAAO,SAAS,KAAK,GAAG,OAAO,OAAO;CAE5C,OAAO;AACT"}

package/dist/search/index.d.ts

@@ -1,8 +1,8 @@
 import { A as SearchLedgerHash, C as SearchEdgeOperator, G as SearchSplit, H as SearchProposerKind, I as SearchNodeStatus, L as SearchOpenedEvent, T as SearchEstimateMethod, W as SearchSourceRef, i as SearchArtifactRef, j as SearchModelIdentity, l as SearchCandidateSurface, m as SearchClaim, t as NodeEstimate, y as SearchCloseReason } from "../search-ledger-types-p2xKfiDJ.js";
-import { $ as SearchNode, it as SearchStateView } from "../types-B4C5nFw6.js";
-import { B as SearchPolicyView, N as SearchUnitExtension, R as SearchPolicy, at as OperatorYieldData, ct as OperatorYieldSignal, dt as LensSignal, ft as SampleSummary, it as OperatorOutcomeCounts, lt as operatorYield, mt as summarizeSamples, nt as ExpansionOperator, ot as OperatorYieldOptions, p as SearchRunResult, pt as rankingSplit, r as SearchArtifactCodec, rt as MIN_OUTCOMES_FOR_WEIGHT, s as SearchLane, st as OperatorYieldRow, t as RunSearchOptions, tt as EXPANSION_OPERATORS, ut as LensResult } from "../search-kernel-CpcKH5Ih.js";
+import { Z as SearchStateView, nt as SearchNode } from "../types-Cq8mSbq8.js";
+import { B as SearchPolicyView, N as SearchUnitExtension, R as SearchPolicy, at as OperatorYieldData, ct as OperatorYieldSignal, dt as LensSignal, ft as SampleSummary, g as SearchRunResult, i as RunSearchOptions, it as OperatorOutcomeCounts, lt as operatorYield, mt as summarizeSamples, nt as ExpansionOperator, o as SearchArtifactCodec, ot as OperatorYieldOptions, pt as rankingSplit, rt as MIN_OUTCOMES_FOR_WEIGHT, st as OperatorYieldRow, tt as EXPANSION_OPERATORS, u as SearchLane, ut as LensResult } from "../search-kernel-DyNEa6IU.js";
 import { AgentProfileResourceRef } from "@tangle-network/agent-interface";
-//#region src/search/lenses/edit-credit.d.ts
+//#region src/search/lenses/edit-credit-contract.d.ts
 interface EditCreditOptions {
   /**
    * The parsed content a node's artifact reference names, or undefined when
@@ -203,17 +203,21 @@ interface EditCreditSignal extends LensSignal<number | null> {
 type EditCreditResult = LensResult<EditCreditData, number | null> & {
   signal: EditCreditSignal;
 };
-/**
- * The edit-credit lens. Pure: the result depends only on `state` and what
- * `readArtifact` returns for its references.
- */
-export declare function editCredit(state: SearchStateView, options: EditCreditOptions): EditCreditResult;
+//#endregion
+//#region src/search/lenses/edit-credit-text.d.ts
 /** The lens as compact text: what `agent-eval search show --edit-credit`
  * prints and a proposer can read. */
 export declare function editCreditText(result: EditCreditResult, options?: {
   limit?: number;
 }): string;
 //#endregion
+//#region src/search/lenses/edit-credit.d.ts
+/**
+ * The edit-credit lens. Pure: the result depends only on `state` and what
+ * `readArtifact` returns for its references.
+ */
+export declare function editCredit(state: SearchStateView, options: EditCreditOptions): EditCreditResult;
+//#endregion
 //#region src/search/lenses/front.d.ts
 interface FrontExtraAxis {
   name: string;
@@ -378,7 +382,7 @@ interface DraftOnPlateauOptions {
  */
 export declare function draftOnPlateau(base: SearchPolicy, options?: DraftOnPlateauOptions): SearchPolicy;
 //#endregion
-//#region src/search/lenses/landscape.d.ts
+//#region src/search/lenses/landscape-contract.d.ts
 /**
  * How the lens measures the distance between two nodes' profiles.
  *
@@ -405,22 +409,6 @@ type LandscapeEmbedding = {
   method: string;
   vector(node: SearchNode): readonly number[] | null;
 };
-/** The default: edits recorded between two profiles along the lineage. */
-export declare function lineageEdits(): LandscapeEmbedding;
-/**
- * Line edits between the surfaces' texts: for each declared surface, the
- * fewest line insertions and deletions that turn one text into the other
- * (Myers, 1986), summed over surfaces. `read` returns a surface's content:
- * a string, parsed JSON (flattened with `profileTextLines`), or null when it
- * cannot be read, which leaves every distance of that node unknown. The lens
- * stays pure; the caller owns the I/O and its verification.
- */
-export declare function surfaceTextEdits(read: (surface: SearchCandidateSurface) => unknown): LandscapeEmbedding;
-/** A caller's vector per node, for example a model embedding of its profile. */
-export declare function vectorEmbedding(name: string, vector: (node: SearchNode) => readonly number[] | null): LandscapeEmbedding;
-/** Fewest line insertions plus deletions turning `a` into `b` (Myers' O(ND)
- * greedy algorithm, which is fast when the texts are close). */
-export declare function lineEditDistance(a: readonly string[], b: readonly string[]): number;
 interface LandscapeOptions {
   /** The split scores come from. Default: the ranked split. */
   split?: 'selection' | 'train';
@@ -561,15 +549,37 @@ interface LandscapeData {
   };
   plateau: SearchPlateau;
 }
+//#endregion
+//#region src/search/lenses/landscape-embeddings.d.ts
+/** The default: edits recorded between two profiles along the lineage. */
+export declare function lineageEdits(): LandscapeEmbedding;
+/**
+ * Line edits between the surfaces' texts: for each declared surface, the
+ * fewest line insertions and deletions that turn one text into the other
+ * (Myers, 1986), summed over surfaces. `read` returns a surface's content:
+ * a string, parsed JSON (flattened with `profileTextLines`), or null when it
+ * cannot be read, which leaves every distance of that node unknown. The lens
+ * stays pure; the caller owns the I/O and its verification.
+ */
+export declare function surfaceTextEdits(read: (surface: SearchCandidateSurface) => unknown): LandscapeEmbedding;
+/** A caller's vector per node, for example a model embedding of its profile. */
+export declare function vectorEmbedding(name: string, vector: (node: SearchNode) => readonly number[] | null): LandscapeEmbedding;
+/** Fewest line insertions plus deletions turning `a` into `b` (Myers' O(ND)
+ * greedy algorithm, which is fast when the texts are close). */
+export declare function lineEditDistance(a: readonly string[], b: readonly string[]): number;
+//#endregion
+//#region src/search/lenses/landscape-text.d.ts
+/** The landscape as text for a terminal or a proposer's context: the same
+ * numbers the view draws, with a coarse shaded map. */
+export declare function formatLandscape(lens: GeometryLensResult<LandscapeData>): string;
+//#endregion
+//#region src/search/lenses/landscape.d.ts
 /**
  * The landscape of a search: every node placed by `embed`, the interpolated
  * score over the placement, the basins of that surface, and the plateau
  * signal. Pure: it reads the state and calls `embed`.
  */
 export declare function landscape(state: SearchStateView, embed?: LandscapeEmbedding, options?: LandscapeOptions): GeometryLensResult<LandscapeData>;
-/** The landscape as text for a terminal or a proposer's context: the same
- * numbers the view draws, with a coarse shaded map. */
-export declare function formatLandscape(lens: GeometryLensResult<LandscapeData>): string;
 //#endregion
 //#region src/search/lenses/meta-search.d.ts
 /** The configuration that ran a search, as its ledger records it. */
@@ -796,15 +806,15 @@ interface MetaSearchOptions {
    * null until one is named. */
   objective?: string;
 }
-/** The per-search score `metaSearchScore` computes. An outer search names it
- * as its objective's judge. */
-export declare const META_SEARCH_SCORE_SOURCE: SearchSourceRef;
 /**
  * The genome of a search: the configuration its ledger records. Declared
  * parts come from the header; the proposer comes from what the edges and
  * candidate-generation operations name, because the header declares none.
  */
 export declare function searchPolicyGenome(state: SearchStateView): SearchPolicyGenome;
+/** The per-search score `metaSearchScore` computes. An outer search names it
+ * as its objective's judge. */
+export declare const META_SEARCH_SCORE_SOURCE: SearchSourceRef;
 /**
  * A search's held-out lift per known dollar, from its claim and its test
  * cells. Pure; it reads the test split, so a policy view (which holds no test
@@ -815,6 +825,8 @@ export declare function metaSearchScore(state: SearchStateView): MetaSearchScore
 export declare function metaSearch(searches: readonly SearchStateView[], options?: MetaSearchOptions): LensResult<MetaSearchData, BestPolicyConfiguration>;
 /** `subject · metric (direction)`: the key searches are compared within. */
 export declare function objectiveKey(header: NonNullable<SearchStateView['header']>): string;
+//#endregion
+//#region src/search/lenses/meta-search-text.d.ts
 interface MetaSearchTextOptions {
   /** Searches listed under each outer node or parent before the rest are
    * counted. Default 5. */
@@ -828,7 +840,7 @@ interface MetaSearchTextOptions {
  */
 export declare function renderMetaSearchText(result: LensResult<MetaSearchData, BestPolicyConfiguration>, options?: MetaSearchTextOptions): string;
 //#endregion
-//#region src/search/lenses/skill-manifold.d.ts
+//#region src/search/lenses/skill-manifold-contract.d.ts
 interface SkillManifoldOptions {
   /** The split scores come from. Default: the ranked split. */
   split?: 'selection' | 'train';
@@ -996,6 +1008,8 @@ interface SkillManifoldData {
   batch: string[] | null;
   insufficient: string | null;
 }
+//#endregion
+//#region src/search/lenses/skill-manifold.d.ts
 /**
  * The skill manifold of a search at rank `k` (`auto`: the cross-validated
  * intrinsic dimension, at least 1, and 1 when too few nodes cross-validate).

package/dist/search/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","names":[],"sources":["../../src/search/lenses/edit-credit.ts","../../src/search/lenses/front.ts","../../src/search/lenses/geometry.ts","../../src/search/lenses/plateau.ts","../../src/search/lenses/landscape.ts","../../src/search/lenses/meta-search.ts","../../src/search/lenses/skill-manifold.ts","../../src/search/lenses/task-matrix.ts","../../src/search/lenses/tree.ts","../../src/search/nested-search.ts"],"mappings":";;;;;UA+FiB;;;;;;EAMf,aAAa,KAAK;;;EAGlB,QAAQ;;;EAGR;;KAGU;UAEK;EACf;EACA;EACA,UAAU;EACV;;EAEA;;UAGe;EACf;EACA;;;EAGA;;EAEA;;EAEA;;;;EAIA,YAAY;;EAEZ;;;EAGA;;EAEA;;;EAGA;EACA;;IAEE;;IAEA;;IAEA;;IAEA;;;;EAIF,QAAQ;EACR,SAAS;;;;EAIT;;UAGe;EACf;;EAEA;IACE;IACA;IACA;IACA;;;EAGF;EACA,QAAQ;;;;EAIR;;;EAGA;EACA;;EAEA;;EAEA;EACA;;;EAGA;;UAGe;;;;EAIf,UAAU,QAAQ;IAA2B;;EAC7C;IAAkB;IAAmB;MAAU;;;;EAE/C;EACA;EACA,QAAQ;;UAGO;EACf;EACA;EACA;EACA;EACA;EACA,UAAU;EACV,QAAQ;;EAER;EACA;;UAGe;EACf,OAAO;EACP;EACA;;IAEE;;IAEA;;IAEA,SAAS;;;;EAIX;IAAS;IAAe;;EACxB;IAAS;IAAe;IAAwB;;;EAEhD,OAAO;EACP,QAAQ,OAAO;;;EAGf,YAAY,OAAO;EACnB;IACE;;IAEA;;IAEA;IACA;IACA;;IAEA,OAAO;;EAET,iBAAiB;;;EAGjB;;IAEE;;;IAGA;IACA;;;;EAIF,SAAS;EACT;IACE,WAAW;IACX;IACA;IACA;IACA;;IAEA;;;;;UAMa,yBAAyB;;EAExC;;;EAGA;;KAGU,mBAAmB,WAAW;EACxC,QAAQ;;;;;;wBA0CM,WAAW,OAAO,iBAAiB,SAAS,oBAAoB;;;wBAs8BhE,eAAe,QAAQ,kBAAkB;EAAW;;;;UCtvCnD;EACf;EACA;;;;EAIA,MAAM,OAAO,iBAAiB;;UAGf;EACf;;;EAGA;;EAEA;EACA,QAAQ;;;EAGR;;;EAGA;;;EAGA;;;EAGA;;EAEA,UAAU;;KAGA;UAEK;EACf;EACA;EACA,MAAM;EACN;;EAEA;;EAEA,YAAY,OAAO;;UAGJ;EACf;EACA,OAAO;;;;;KAMG,cAAc;wBAEV,MACd,OAAO,iBACP,UAAS;EACN,MAAM;EAAW;IAAU;IAAc,OAAO;;;;;;;UClEpC,uBAAuB;;;EAGtC;;EAEA;;EAEA;;EAEA;;UAGe,mBAAmB,eAAe,WAAW;;EAE5D;EACA;;EAEA;EACA,QAAQ;;;;;;;;;wBAaM,cACd,OAAO,iBACP;EAAW;;;;;KCtCD,oBAAoB,KAC9B;UAIe;;EAEf;;UAGe;;;EAGf;EACA;;;;EAIA;;EAEA;;;EAGA;;;EAGA;EACA;IAAQ;IAAgB;IAAc;;;;EAGtC;EACA;EACA;EACA;;;;;;;wBAUc,cACd,MAAM,mBACN,UAAS,uBACR;UA6Ec;;;EAGf;;;EAGA;;;;;;;;;;;;;;;;;;;;;;wBAuBc,eACd,MAAM,cACN,UAAS,wBACR;;;;;;;;;;;;;;KCzGS;EACN;EAAiB;EAAc;;EAE/B;EACA;EACA;EACA,SAAS,GAAG,YAAY,GAAG;;EAG3B;EACA;EACA;EACA,OAAO,MAAM;;;wBAIH,gBAAgB;;;;;;;;;wBAiBhB,iBACd,OAAO,SAAS,qCACf;;wBAoDa,gBACd,cACA,SAAS,MAAM,0CACd;;;wBAsCa,iBAAiB,sBAAsB;UA2BtC;;EAEf;;EAEA;;EAEA;;;EAGA;;EAEA;;EAEA;;UAGe;EACf;EACA;EACA;EACA,QAAQ;;EAER;;EAEA;EACA;EACA;;;EAGA;;;EAGA;EACA;EACA,QAAQ;;;EAGR;;UAGe;EACf;EACA;EACA;EACA;;;;EAIA;;EAEA;EACA;;;;EAIA;IACE;IACA;IACA;;IAEA;;;;IAIA;;IAEA;;EAEF;;UAGe;;EAEf;IAAQ;IAAgB;IAAW;IAAW;IAAe;;;;;EAI7D;;;EAGA;EACA;EACA;;UAGe;EACf;EACA;EACA;IACE;IACA;IACA;;;IAGA;MAAoB;MAAgB;;;IAEpC;;IAEA;;;IAGA;IACA;IACA;;EAEF,OAAO;;EAEP,SAAS;IAAQ;IAAgB;IAAe;;EAChD,MAAM;EACN;EACA;IACE;;IAEA;;IAEA;;;IAGA;;IAEA;;;IAGA;IACA;IACA;IACA;IACA,OAAO;;EAET,SAAS;;;;;;;wBAmBK,UACd,OAAO,iBACP,QAAO,oBACP,UAAS,mBACR,mBAAmB;;;wBAi5BN,gBAAgB,MAAM,mBAAmB;;;;UCrsCxC;;;;EAIf;;EAEA;EACA;IACE;IACA;IACA;IACA;IACA;;;;EAIF,WACI;IAAQ,MAAM;IAAoB;IAAc,QAAQ;;IAEtD;;;;EAIN,mBACI;IACM;IAAe,OAAO;;IACtB;IAAuB,QAAQ;;IAEnC;;;;KAII;UAQK;EACf;;EAEA;;EAEA;;;;KAKU;EAEN;EACA;;EAEA;;EAGA;;;;EAIA;EACA;EACA;;EAEA;EAAmB;;KAEb;EAEN;EACA;;EAEA;;EAEA,UAAU;;EAEV;;EAEA;EACA,OAAO;EACP,YAAY;;EAGZ;EACA,UAAU;EACV,QAAQ;EACR;EACA,OAAO;;;KAID;EAEN;EACA;;EAEA;;EAEA;;EAGA;EACA;EACA;EACA;;;EAGA;EACA;;UAGW;EACf;EACA;EACA;IAAa;IAAgB;;;EAE7B;EACA;EACA,aAAa;EACb,QAAQ;EACR,cAAc;EACd;EACA;EACA;EACA;IAAS;IAAiB;;EAC1B;IACE,UAAU;IACV;IACA;IACA;;EAEF,OAAO;EACP,QAAQ;EACR;;EAEA;;;EAGA;IAAS,OAAO;IAA+C;;;;UAIhD;;;EAGf;EACA;EACA;EACA,QAAQ;EACR;;EAEA;;UAGe;EACf,cAAc;EACd;EACA,QAAQ;EACR;EACA;IAAa;IAAc;IAAc;IAA+B;;;EAExE;;EAEA;EACA,UAAU,QAAQ,OAAO;EACzB,UAAU;;;;EAIV,YAAY;IACV;IACA;IACA;IACA,oBAAoB;IACpB,eAAe;;;UAIF;EACf,UAAU;EACV;;EAEA,gBAAgB;EAChB;;EAEA;;;;UAKe;;EAEf;EACA;EACA,cAAc;EACd,QAAQ;EACR;EACA,QAAQ;EACR,gBAAgB;EAChB,OAAO;EACP;;;EAGA;EACA;;;;EAIA;IAAa;IAAkB;;;EAE/B;;UAGe;;EAEf;;;;EAIA;;;;qBA+BW,0BAA0B;;;;;;wBAUvB,mBAAmB,OAAO,kBAAkB;;;;;;wBAkD5C,gBAAgB,OAAO,kBAAkB;;wBAgFzC,WACd,mBAAmB,mBACnB,UAAS,oBACR,WAAW,gBAAgB;;wBA8Fd,aAAa,QAAQ,YAAY;UA+QhC;;;EAGf;;;;;;;;wBASc,qBACd,QAAQ,WAAW,gBAAgB,0BACnC,UAAS;;;UC9wBM;;EAEf;;EAEA;;EAEA;;EAEA;;EAEA;;;EAGA;;;;;;EAMA;;;;EAIA;;;EAGA,cAAc;;;;EAId;;;;EAIA;IAAU;IAAe;;;;UAIV;;EAEf;;;EAGA,MAAM;;;EAGN;EACA;EACA;EACA;;;EAGA;;EAEA,OAAO;IAAQ;IAAgB;IAAc;;;KAGnC;UAEK;EACf;EACA;EACA,QAAQ;;EAER;;;EAGA;;EAEA;EACA;;UAGe;EACf;;EAEA;;;EAGA;;;EAGA;;;EAGA;;EAEA;;UAGe;EACf;;;EAGA;;EAEA;;UAGe;EACf;EACA;;EAEA;EACA;EACA;IACE;IACA;;IAEA;IACA;;IAEA;;IAEA;IACA;;EAEF;IACE;IACA,MAAM;IACN;IACA;IACA;IACA;IACA;IACA;;;EAGF;IACE,QAAQ;MAAQ;MAAc;;;IAE9B;IACA;;EAEF;IACE;IACA;;IAEA;IACA;IACA,OAAO;MAAQ;MAAc;MAAe;;IAC5C;;;EAGF;EACA;EACA,OAAO;EACP,OAAO;EACP,SAAS;IAAQ;IAAgB;IAAuB;;EACxD,WAAW;;;EAGX;EACA;;;;;;;wBA8Cc,cACd,OAAO,iBACP,qBACA,UAAS,uBACR,mBAAmB;;;;;;wBA0SN,iBACd,MAAM,mBAAmB,qBACxB;;;;;;;;;wBAg3Ba,kBACd,aAAa,kBACb;EAAW;IACV;;wBAsEa,oBAAoB,MAAM,mBAAmB;;;UCn8C5C;EACf;EACA;;;EAGA;;UAGe;;EAEf;EACA;;UAGe;EACf;EACA;;;;;EAKA;;EAEA;;EAEA;;EAEA;;UAGe;EACf;EACA;;EAEA;;EAEA;IACE;IACA;IACA;;EAEF;EACA;EACA,cAAc;EACd,cAAc;EACd,OAAO;EACP,gBAAgB;;UAGD;EACf;;;;KAKU,mBAAmB;wBAEf,WACd,OAAO,iBACP,UAAS;EACN,MAAM;EAAgB;IAAU;IAAc,OAAO;;;;;UClFzC;EACf;EACA,QAAQ;EACR;;;EAGA;EACA;;;EAGA;EACA;EACA;;;EAGA,UAAU;EACV,UAAU;;UAGK;;;;;EAKf,OAAO;EACP;EACA;;wBAGc,KAAK,OAAO;EAC1B,MAAM;EACN;IAAU;IAAc;;;;;;KCId,0BAA0B,YAAY;;UAGjC,qBAAqB;EACpC,QAAQ;;EAER,aAAa;;;;EAIb;EACA;IAAQ;IAAgB;IAAgB,OAAO;IAAa;;EAC5D,QAAQ;;UAGO,uBAAuB,iBAC9B,KAAK,iBAAiB;;;EAG9B,QAAQ,oBAAoB;;;EAG5B,MAAM;;;EAGN,SAAS,OAAO,qBAAqB,WAAW,QAAQ;;;EAGxD,YAAY,OAAO,qBAAqB,WAAW,QAAQ;;;wBAI7C,eAAe,aAAa;;;;;wBAS5B,kBAAkB,YAAY,oBAAoB;;;;;;;wBA6B5C,gBAAgB,SACpC,SAAS,uBAAuB,WAC/B,QAAQ"}
+{"version":3,"file":"index.d.ts","names":[],"sources":["../../src/search/lenses/edit-credit-contract.ts","../../src/search/lenses/edit-credit-text.ts","../../src/search/lenses/edit-credit.ts","../../src/search/lenses/front.ts","../../src/search/lenses/geometry.ts","../../src/search/lenses/plateau.ts","../../src/search/lenses/landscape-contract.ts","../../src/search/lenses/landscape-embeddings.ts","../../src/search/lenses/landscape-text.ts","../../src/search/lenses/landscape.ts","../../src/search/lenses/meta-search.ts","../../src/search/lenses/meta-search-text.ts","../../src/search/lenses/skill-manifold-contract.ts","../../src/search/lenses/skill-manifold.ts","../../src/search/lenses/task-matrix.ts","../../src/search/lenses/tree.ts","../../src/search/nested-search.ts"],"mappings":";;;;;UAyDiB;;;;;;EAMf,aAAa,KAAK;;;EAGlB,QAAQ;;;EAGR;;KAGU;UAEK;EACf;EACA;EACA,UAAU;EACV;;EAEA;;UAGe;EACf;EACA;;;EAGA;;EAEA;;EAEA;;;;EAIA,YAAY;;EAEZ;;;EAGA;;EAEA;;;EAGA;EACA;;IAEE;;IAEA;;IAEA;;IAEA;;;;EAIF,QAAQ;EACR,SAAS;;;;EAIT;;UAGe;EACf;;EAEA;IACE;IACA;IACA;IACA;;;EAGF;EACA,QAAQ;;;;EAIR;;;EAGA;EACA;;EAEA;;EAEA;EACA;;;EAGA;;UAGe;;;;EAIf,UAAU,QAAQ;IAA2B;;EAC7C;IAAkB;IAAmB;MAAU;;;;EAE/C;EACA;EACA,QAAQ;;UAGO;EACf;EACA;EACA;EACA;EACA;EACA,UAAU;EACV,QAAQ;;EAER;EACA;;UAGe;EACf,OAAO;EACP;EACA;;IAEE;;IAEA;;IAEA,SAAS;;;;EAIX;IAAS;IAAe;;EACxB;IAAS;IAAe;IAAwB;;;EAEhD,OAAO;EACP,QAAQ,OAAO;;;EAGf,YAAY,OAAO;EACnB;IACE;;IAEA;;IAEA;IACA;IACA;;IAEA,OAAO;;EAET,iBAAiB;;;EAGjB;;IAEE;;;IAGA;IACA;;;;EAIF,SAAS;EACT;IACE,WAAW;IACX;IACA;IACA;IACA;;IAEA;;;;;UAMa,yBAAyB;;EAExC;;;EAGA;;KAGU,mBAAmB,WAAW;EACxC,QAAQ;;;;;;wBCnPM,eAAe,QAAQ,kBAAkB;EAAW;;;;;;;;wBCkFpD,WAAW,OAAO,iBAAiB,SAAS,oBAAoB;;;UC/D/D;EACf;EACA;;;;EAIA,MAAM,OAAO,iBAAiB;;UAGf;EACf;;;EAGA;;EAEA;EACA,QAAQ;;;EAGR;;;EAGA;;;EAGA;;;EAGA;;EAEA,UAAU;;KAGA;UAEK;EACf;EACA;EACA,MAAM;EACN;;EAEA;;EAEA,YAAY,OAAO;;UAGJ;EACf;EACA,OAAO;;;;;KAMG,cAAc;wBAEV,MACd,OAAO,iBACP,UAAS;EACN,MAAM;EAAW;IAAU;IAAc,OAAO;;;;;;;UClEpC,uBAAuB;;;EAGtC;;EAEA;;EAEA;;EAEA;;UAGe,mBAAmB,eAAe,WAAW;;EAE5D;EACA;;EAEA;EACA,QAAQ;;;;;;;;;wBAaM,cACd,OAAO,iBACP;EAAW;;;;;KCtCD,oBAAoB,KAC9B;UAIe;;EAEf;;UAGe;;;EAGf;EACA;;;;EAIA;;EAEA;;;EAGA;;;EAGA;EACA;IAAQ;IAAgB;IAAc;;;;EAGtC;EACA;EACA;EACA;;;;;;;wBAUc,cACd,MAAM,mBACN,UAAS,uBACR;UA6Ec;;;EAGf;;;EAGA;;;;;;;;;;;;;;;;;;;;;;wBAuBc,eACd,MAAM,cACN,UAAS,wBACR;;;;;;;;;;;;;;KCxJS;EACN;EAAiB;EAAc;;EAE/B;EACA;EACA;EACA,SAAS,GAAG,YAAY,GAAG;;EAG3B;EACA;EACA;EACA,OAAO,MAAM;;UAGF;;EAEf;;EAEA;;EAEA;;;EAGA;;EAEA;;EAEA;;UAGe;EACf;EACA;EACA;EACA,QAAQ;;EAER;;EAEA;EACA;EACA;;;EAGA;;;EAGA;EACA;EACA,QAAQ;;;EAGR;;UAGe;EACf;EACA;EACA;EACA;;;;EAIA;;EAEA;EACA;;;;EAIA;IACE;IACA;IACA;;IAEA;;;;IAIA;;IAEA;;EAEF;;UAGe;;EAEf;IAAQ;IAAgB;IAAW;IAAW;IAAe;;;;;EAI7D;;;EAGA;EACA;EACA;;UAGe;EACf;EACA;EACA;IACE;IACA;IACA;;;IAGA;MAAoB;MAAgB;;;IAEpC;;IAEA;;;IAGA;IACA;IACA;;EAEF,OAAO;;EAEP,SAAS;IAAQ;IAAgB;IAAe;;EAChD,MAAM;EACN;EACA;IACE;;IAEA;;IAEA;;;IAGA;;IAEA;;;IAGA;IACA;IACA;IACA;IACA,OAAO;;EAET,SAAS;;;;;wBC1JK,gBAAgB;;;;;;;;;wBAiBhB,iBACd,OAAO,SAAS,qCACf;;wBAoDa,gBACd,cACA,SAAS,MAAM,0CACd;;;wBAsCa,iBAAiB,sBAAsB;;;;;wBC/GvC,gBAAgB,MAAM,mBAAmB;;;;;;;;wBCiEzC,UACd,OAAO,iBACP,QAAO,oBACP,UAAS,mBACR,mBAAmB;;;;UCnBL;;;;EAIf;;EAEA;EACA;IACE;IACA;IACA;IACA;IACA;;;;EAIF,WACI;IAAQ,MAAM;IAAoB;IAAc,QAAQ;;IAEtD;;;;EAIN,mBACI;IACM;IAAe,OAAO;;IACtB;IAAuB,QAAQ;;IAEnC;;;;KAII;UAQK;EACf;;EAEA;;EAEA;;;;KAKU;EAEN;EACA;;EAEA;;EAGA;;;;EAIA;EACA;EACA;;EAEA;EAAmB;;KAEb;EAEN;EACA;;EAEA;;EAEA,UAAU;;EAEV;;EAEA;EACA,OAAO;EACP,YAAY;;EAGZ;EACA,UAAU;EACV,QAAQ;EACR;EACA,OAAO;;;KAID;EAEN;EACA;;EAEA;;EAEA;;EAGA;EACA;EACA;EACA;;;EAGA;EACA;;UAGW;EACf;EACA;EACA;IAAa;IAAgB;;;EAE7B;EACA;EACA,aAAa;EACb,QAAQ;EACR,cAAc;EACd;EACA;EACA;EACA;IAAS;IAAiB;;EAC1B;IACE,UAAU;IACV;IACA;IACA;;EAEF,OAAO;EACP,QAAQ;EACR;;EAEA;;;EAGA;IAAS,OAAO;IAA+C;;;;UAIhD;;;EAGf;EACA;EACA;EACA,QAAQ;EACR;;EAEA;;UAGe;EACf,cAAc;EACd;EACA,QAAQ;EACR;EACA;IAAa;IAAc;IAAc;IAA+B;;;EAExE;;EAEA;EACA,UAAU,QAAQ,OAAO;EACzB,UAAU;;;;EAIV,YAAY;IACV;IACA;IACA;IACA,oBAAoB;IACpB,eAAe;;;UAIF;EACf,UAAU;EACV;;EAEA,gBAAgB;EAChB;;EAEA;;;;UAKe;;EAEf;EACA;EACA,cAAc;EACd,QAAQ;EACR;EACA,QAAQ;EACR,gBAAgB;EAChB,OAAO;EACP;;;EAGA;EACA;;;;EAIA;IAAa;IAAkB;;;EAE/B;;UAGe;;EAEf;;;;EAIA;;;;;;;wBAQc,mBAAmB,OAAO,kBAAkB;;;qBAmF/C,0BAA0B;;;;;;wBAUvB,gBAAgB,OAAO,kBAAkB;;wBAsVzC,WACd,mBAAmB,mBACnB,UAAS,oBACR,WAAW,gBAAgB;;wBA8Fd,aAAa,QAAQ,YAAY;;;UCjyBhC;;;EAGf;;;;;;;;wBASc,qBACd,QAAQ,WAAW,gBAAgB,0BACnC,UAAS;;;UCzBM;;EAEf;;EAEA;;EAEA;;EAEA;;EAEA;;;EAGA;;;;;;EAMA;;;;EAIA;;;EAGA,cAAc;;;;EAId;;;;EAIA;IAAU;IAAe;;;;UAIV;;EAEf;;;EAGA,MAAM;;;EAGN;EACA;EACA;EACA;;;EAGA;;EAEA,OAAO;IAAQ;IAAgB;IAAc;;;KAGnC;UAEK;EACf;EACA;EACA,QAAQ;;EAER;;;EAGA;;EAEA;EACA;;UAGe;EACf;;EAEA;;;EAGA;;;EAGA;;;EAGA;;EAEA;;UAGe;EACf;;;EAGA;;EAEA;;UAGe;EACf;EACA;;EAEA;EACA;EACA;IACE;IACA;;IAEA;IACA;;IAEA;;IAEA;IACA;;EAEF;IACE;IACA,MAAM;IACN;IACA;IACA;IACA;IACA;IACA;;;EAGF;IACE,QAAQ;MAAQ;MAAc;;;IAE9B;IACA;;EAEF;IACE;IACA;;IAEA;IACA;IACA,OAAO;MAAQ;MAAc;MAAe;;IAC5C;;;EAGF;EACA;EACA,OAAO;EACP,OAAO;EACP,SAAS;IAAQ;IAAgB;IAAuB;;EACxD,WAAW;;;EAGX;EACA;;;;;;;;;wBC5Ec,cACd,OAAO,iBACP,qBACA,UAAS,uBACR,mBAAmB;;;;;;wBA0SN,iBACd,MAAM,mBAAmB,qBACxB;;;;;;;;;wBAoEa,kBACd,aAAa,kBACb;EAAW;IACV;;wBAoBa,oBAAoB,MAAM,mBAAmB;;;UC3b5C;EACf;EACA;;;EAGA;;UAGe;;EAEf;EACA;;UAGe;EACf;EACA;;;;;EAKA;;EAEA;;EAEA;;EAEA;;UAGe;EACf;EACA;;EAEA;;EAEA;IACE;IACA;IACA;;EAEF;EACA;EACA,cAAc;EACd,cAAc;EACd,OAAO;EACP,gBAAgB;;UAGD;EACf;;;;KAKU,mBAAmB;wBAEf,WACd,OAAO,iBACP,UAAS;EACN,MAAM;EAAgB;IAAU;IAAc,OAAO;;;;;UClFzC;EACf;EACA,QAAQ;EACR;;;EAGA;EACA;;;EAGA;EACA;EACA;;;EAGA,UAAU;EACV,UAAU;;UAGK;;;;;EAKf,OAAO;EACP;EACA;;wBAGc,KAAK,OAAO;EAC1B,MAAM;EACN;IAAU;IAAc;;;;;;KCId,0BAA0B,YAAY;;UAGjC,qBAAqB;EACpC,QAAQ;;EAER,aAAa;;;;EAIb;EACA;IAAQ;IAAgB;IAAgB,OAAO;IAAa;;EAC5D,QAAQ;;UAGO,uBAAuB,iBAC9B,KAAK,iBAAiB;;;EAG9B,QAAQ,oBAAoB;;;EAG5B,MAAM;;;EAGN,SAAS,OAAO,qBAAqB,WAAW,QAAQ;;;EAGxD,YAAY,OAAO,qBAAqB,WAAW,QAAQ;;;wBAI7C,eAAe,aAAa;;;;;wBAS5B,kBAAkB,YAAY,oBAAoB;;;;;;;wBA6B5C,gBAAgB,SACpC,SAAS,uBAAuB,WAC/B,QAAQ"}

package/dist/search/index.js

@@ -1,6 +1,6 @@
-import { a as hashCanonical } from "../canonical-BsZVgBhW.js";
-import { g as operatorYield, h as MIN_OUTCOMES_FOR_WEIGHT, m as EXPANSION_OPERATORS, n as runSearch, v as rankingSplit, y as summarizeSamples } from "../search-kernel-BztlERLv.js";
-import { C as editCredit, S as front, _ as surfaceTextEdits, a as skillCalibration, b as searchPlateau, c as metaSearch, d as renderMetaSearchText, f as searchPolicyGenome, g as lineageEdits, h as lineEditDistance, i as nextUnitExtension, l as metaSearchScore, m as landscape, n as taskMatrix, o as skillManifold, p as formatLandscape, r as formatSkillManifold, s as META_SEARCH_SCORE_SOURCE, t as tree, u as objectiveKey, v as vectorEmbedding, w as editCreditText, x as screenedNodes, y as draftOnPlateau } from "../tree-rXLW3M_4.js";
+import { a as hashCanonical } from "../canonical-B2RqLofv.js";
+import { c as MIN_OUTCOMES_FOR_WEIGHT, d as rankingSplit, f as summarizeSamples, i as runSearch, l as operatorYield, s as EXPANSION_OPERATORS } from "../pareto-Cm6ndrWN.js";
+import { C as editCredit, S as front, _ as lineEditDistance, a as skillCalibration, b as vectorEmbedding, c as META_SEARCH_SCORE_SOURCE, d as objectiveKey, f as searchPolicyGenome, g as formatLandscape, h as searchPlateau, i as nextUnitExtension, l as metaSearch, m as draftOnPlateau, n as taskMatrix, o as skillManifold, p as landscape, r as formatSkillManifold, s as renderMetaSearchText, t as tree, u as metaSearchScore, v as lineageEdits, w as editCreditText, x as screenedNodes, y as surfaceTextEdits } from "../tree-C1XYeXvy.js";
 //#region src/search/nested-search.ts
 /** The deterministic id of the inner search one outer cell attempt runs. */
 function nestedSearchId(containment) {

package/dist/{search-kernel-CpcKH5Ih.d.ts → search-kernel-DyNEa6IU.d.ts}

@@ -1,9 +1,9 @@
-import { o as CostLedger } from "./cost-ledger-CO7UyEcQ.js";
-import { a as RunRecord } from "./run-record-D1Hw-Jml.js";
+import { t as CostLedger } from "./cost-ledger-Jk62OBfF.js";
+import { a as RunRecord } from "./run-record-C1E24G2A.js";
 import { a as PairedPromotionDecision } from "./paired-promotion-decision-DPKz8ZnF.js";
 import { A as SearchLedgerHash, C as SearchEdgeOperator, E as SearchExecutionIdentity, G as SearchSplit, H as SearchProposerKind, I as SearchNodeStatus, L as SearchOpenedEvent, N as SearchNodeDecision, O as SearchLedgerEntry, P as SearchNodeRef, Q as SearchTaskOutcome, R as SearchOperationKind, S as SearchEdgeAttribution, T as SearchEstimateMethod, U as SearchReservation, V as SearchProposer, W as SearchSourceRef, Y as SearchSurfaceEvidence, Z as SearchTask, _ as SearchClaimPower, a as SearchAttemptAccounting, et as SearchTraceRef, i as SearchArtifactRef, j as SearchModelIdentity, k as SearchLedgerEvent, l as SearchCandidateSurface, m as SearchClaim, nt as EvaluationClaim, o as SearchAudit, p as SearchCellStage, t as NodeEstimate, tt as SearchUnknown, y as SearchCloseReason, z as SearchOperationRecordedEvent } from "./search-ledger-types-p2xKfiDJ.js";
 import { A as LedgerTrustedHead, C as LedgerLineContext, E as LedgerTextStore, j as LedgerTrustedHeadRemoval } from "./index-DHKEAv3s.js";
-import { $ as SearchNode, at as SearchUnitScore, it as SearchStateView, j as MutableSurface, tt as SearchScoredCell } from "./types-B4C5nFw6.js";
+import { Z as SearchStateView, it as SearchScoredCell, j as MutableSurface, nt as SearchNode, ot as SearchUnitScore } from "./types-Cq8mSbq8.js";
 //#region src/campaign/storage.d.ts
 /**
  * `CampaignStorage` — the filesystem seam `runCampaign` writes through
@@ -1015,7 +1015,7 @@ declare function verifySearchClaim(state: SearchStateView): SearchClaimVerificat
  */
 declare function searchClaimDecision(state: SearchStateView, nodeId: string): PairedPromotionDecision | null;
 //#endregion
-//#region src/campaign/search-kernel.d.ts
+//#region src/campaign/search-kernel-contract.d.ts
 /** The kernel every `runSearch` ledger names as its search implementation. */
 declare const SEARCH_KERNEL_SOURCE: SearchSourceRef;
 /** An execution lane: a pool of slots whose cells share a cost rule. */
@@ -1156,10 +1156,6 @@ interface SearchRunResult {
    * revision made; null without a claim. */
   claimVerification: SearchClaimVerification | null;
 }
-/** Run a search to its close, or continue one from its ledger. */
-declare function runSearch<TArtifact>(options: RunSearchOptions<TArtifact>): Promise<SearchRunResult>;
-/** The expansion index a kernel operation id encodes, or null. */
-declare function searchExpansionIndex(operationId: string): number | null;
 /** The stored output of one proposal: enough to register its children again. */
 interface SearchProposalBlob {
   kind: 'search-proposal';
@@ -1178,6 +1174,10 @@ interface SearchProposalBlob {
     invalid: string | null;
   }>;
 }
+/** The expansion index a kernel operation id encodes, or null. */
+declare function searchExpansionIndex(operationId: string): number | null;
+//#endregion
+//#region src/campaign/search-kernel-policy-view.d.ts
 /**
  * A policy's read of a search: `screened` lists the admitted nodes whose screen
  * finished, in registration order; `screening` counts the admitted nodes still
@@ -1204,5 +1204,9 @@ declare function searchDivergence(state: SearchStateView, nodeId: string): {
   reason: string;
 } | null;
 //#endregion
-export { searchEstimateMethod as $, fsCampaignStorage as $t, SearchAllocator as A, SearchHistoryAuditSummary as At, SearchPolicyView as B, verifySearchHistoryArtifact as Bt, decideSearchClaim as C, SettleSearchCellInput as Ct, verifySearchClaim as D, surfaceNode as Dt, searchClaimReserveUsd as E, surfaceDiff as Et, uniform as F, SearchHistoryRequiredError as Ft, incumbentWithOperatorBandit as G, SearchLedgerAppendResult as Gt, beam as H, FileSearchLedger as Ht, AideOptions as I, assertCompleteSearchHistory as It, SEARCH_ESTIMATOR as J, parseSearchLedgerLine as Jt, EstimateNodeCellsInput as K, SearchLedgerTrustedHeadMode as Kt, SearchExpansion as L, assertSearchHistoryMatchesState as Lt, SearchRungDecision as M, SearchHistoryCoverageRow as Mt, SearchUnitExtension as N, SearchHistoryPolicy as Nt, AshaOptions as O, CreateSearchHistoryReceiptInput as Ot, asha as P, SearchHistoryReceipt as Pt, searchCellSetDigest as Q, createRunCostLedger as Qt, SearchPolicy as R, createSearchHistoryReceipt as Rt, SearchClaimVerification as S, SearchRunIdentity as St, searchClaimDecision as T, searchEdgeId as Tt, crowdedFrontierParent as U, OpenSearchLedgerOptions as Ut, aide as V, verifySearchHistoryReceipt as Vt, incumbent as W, SearchLedger as Wt, estimateNode as X, validateSearchLedgerEvent as Xt, SearchPosterior as Y, replaySearchLedgerText as Yt, estimateNodeFromCells as Z, CampaignStorage as Zt, searchPolicyView as _, RegisterSearchNodeInput as _t, SearchCellWork as a, OperatorYieldData as at, SearchClaimDecision as b, SearchRecorder as bt, SearchProposalBlob as c, OperatorYieldSignal as ct, SearchProposedChild as d, LensSignal as dt, inMemoryCampaignStorage as en, searchPosterior as et, SearchProposerPort as f, SampleSummary as ft, searchExpansionIndex as g, RecordSearchEdgeInput as gt, searchDivergence as h, AllocateSearchCellInput as ht, SearchCellResult as i, OperatorOutcomeCounts as it, SearchCellPlan as j, SearchHistoryCoverage as jt, SearchAllocationView as k, SearchHistoryAdmissionOptions as kt, SearchProposalRequest as l, operatorYield as lt, runSearch as m, summarizeSamples as mt, SEARCH_KERNEL_SOURCE as n, ExpansionOperator as nt, SearchExecutor as o, OperatorYieldOptions as ot, SearchRunResult as p, rankingSplit as pt, NodePosterior as q, openSearchLedger as qt, SearchArtifactCodec as r, MIN_OUTCOMES_FOR_WEIGHT as rt, SearchLane as s, OperatorYieldRow as st, RunSearchOptions as t, EXPANSION_OPERATORS as tt, SearchProposalResult as u, LensResult as ut, PlanSearchClaimInput as v, SearchLedgerBinding as vt, planSearchClaim as w, developmentClaim as wt, SearchClaimPlan as x, SearchRecorderOptions as xt, SEARCH_CLAIM_RULE as y, SearchOpening as yt, SearchPolicyNode as z, searchHistoryCoverageRow as zt };
-//# sourceMappingURL=search-kernel-CpcKH5Ih.d.ts.map
+//#region src/campaign/search-kernel.d.ts
+/** Run a search to its close, or continue one from its ledger. */
+declare function runSearch<TArtifact>(options: RunSearchOptions<TArtifact>): Promise<SearchRunResult>;
+//#endregion
+export { searchEstimateMethod as $, fsCampaignStorage as $t, SearchAllocator as A, SearchHistoryAuditSummary as At, SearchPolicyView as B, verifySearchHistoryArtifact as Bt, decideSearchClaim as C, SettleSearchCellInput as Ct, verifySearchClaim as D, surfaceNode as Dt, searchClaimReserveUsd as E, surfaceDiff as Et, uniform as F, SearchHistoryRequiredError as Ft, incumbentWithOperatorBandit as G, SearchLedgerAppendResult as Gt, beam as H, FileSearchLedger as Ht, AideOptions as I, assertCompleteSearchHistory as It, SEARCH_ESTIMATOR as J, parseSearchLedgerLine as Jt, EstimateNodeCellsInput as K, SearchLedgerTrustedHeadMode as Kt, SearchExpansion as L, assertSearchHistoryMatchesState as Lt, SearchRungDecision as M, SearchHistoryCoverageRow as Mt, SearchUnitExtension as N, SearchHistoryPolicy as Nt, AshaOptions as O, CreateSearchHistoryReceiptInput as Ot, asha as P, SearchHistoryReceipt as Pt, searchCellSetDigest as Q, createRunCostLedger as Qt, SearchPolicy as R, createSearchHistoryReceipt as Rt, SearchClaimVerification as S, SearchRunIdentity as St, searchClaimDecision as T, searchEdgeId as Tt, crowdedFrontierParent as U, OpenSearchLedgerOptions as Ut, aide as V, verifySearchHistoryReceipt as Vt, incumbent as W, SearchLedger as Wt, estimateNode as X, validateSearchLedgerEvent as Xt, SearchPosterior as Y, replaySearchLedgerText as Yt, estimateNodeFromCells as Z, CampaignStorage as Zt, searchExpansionIndex as _, RegisterSearchNodeInput as _t, SEARCH_KERNEL_SOURCE as a, OperatorYieldData as at, SearchClaimDecision as b, SearchRecorder as bt, SearchCellWork as c, OperatorYieldSignal as ct, SearchProposalBlob as d, LensSignal as dt, inMemoryCampaignStorage as en, searchPosterior as et, SearchProposalRequest as f, SampleSummary as ft, SearchRunResult as g, RecordSearchEdgeInput as gt, SearchProposerPort as h, AllocateSearchCellInput as ht, RunSearchOptions as i, OperatorOutcomeCounts as it, SearchCellPlan as j, SearchHistoryCoverage as jt, SearchAllocationView as k, SearchHistoryAdmissionOptions as kt, SearchExecutor as l, operatorYield as lt, SearchProposedChild as m, summarizeSamples as mt, searchDivergence as n, ExpansionOperator as nt, SearchArtifactCodec as o, OperatorYieldOptions as ot, SearchProposalResult as p, rankingSplit as pt, NodePosterior as q, openSearchLedger as qt, searchPolicyView as r, MIN_OUTCOMES_FOR_WEIGHT as rt, SearchCellResult as s, OperatorYieldRow as st, runSearch as t, EXPANSION_OPERATORS as tt, SearchLane as u, LensResult as ut, PlanSearchClaimInput as v, SearchLedgerBinding as vt, planSearchClaim as w, developmentClaim as wt, SearchClaimPlan as x, SearchRecorderOptions as xt, SEARCH_CLAIM_RULE as y, SearchOpening as yt, SearchPolicyNode as z, searchHistoryCoverageRow as zt };
+//# sourceMappingURL=search-kernel-DyNEa6IU.d.ts.map

package/dist/search-kernel-DyNEa6IU.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"search-kernel-DyNEa6IU.d.ts","names":[],"sources":["../src/campaign/storage.ts","../src/campaign/search-ledger.ts","../src/campaign/search-history-receipt.ts","../src/campaign/search-ledger-recording.ts","../src/search/lenses/shared.ts","../src/search/lenses/operator-yield.ts","../src/campaign/estimate-node.ts","../src/campaign/search-policy.ts","../src/campaign/allocation.ts","../src/campaign/search-claim.ts","../src/campaign/search-kernel-contract.ts","../src/campaign/search-kernel-policy-view.ts","../src/campaign/search-kernel.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;;;UAoBiB;;;;WAIN;;EAET,UAAU;;EAEV,OAAO;;EAEP,KAAK;;EAEL,MAAM,cAAc,kBAAkB;;;EAGtC,OAAO,cAAc,iBAAiB;;;;;;;;;iBAUxB,qBAAqB;;;;iBA2CrB,2BAA2B;;iBAoC3B,oBAAoB;EAClC,SAAS;EACT;EACA;;EAEA;IACE;;;;;iBC2ZY,0BAA0B,iBAAiB;;;;;;;;;;;;;;KAqB/C;UAEK;EACf;EACA;EACA,cAAc;;;;;;;EAOd,QAAQ;;UAGO;EACf,OAAO;;EAEP;EACA,OAAO;;UAGQ;WACN;WACA;;WAEA;EACT,OAAO,OAAO,oBAAoB,QAAQ;;EAE1C,SAAS,QAAQ;;EAEjB,eAAe,QAAQ;;EAEvB,kBAAkB,QAAQ;;;EAG1B,oBAAoB,QAAQ;;;;iBAKd,iBAAiB,SAAS,0BAA0B;;;iBAOpD,uBACd,cACA,kBACA,iBACC;;;;;;;;iBAWa,sBACd,cACA,kBACA,SAAS,oBACR;;cAwDU,4BAA4B;WAC9B;WACA;WACA;mBACQ;mBACA;EAMjB,YAAY,cAAc,kBAAkB,cAAa;EAcnD,SAAS,QAAQ;EAIjB,OAAO,OAAO,oBAAoB,QAAQ;EAU1C,eAAe,QAAQ;EAIvB,kBAAkB,QAAQ;EAI1B,oBAAoB,QAAQ;;;;cCptB9B;cACA;;UAGW;WACN;WACA,UAAU;WACV,QAAQ;WACR,aAAa;WACb;WACA;WACA;WACA;WACA;WACA;WACA;WACA;WACA;WACA;;;;;;;;;;;;UAaM;WACN,sBAAsB;WACtB;WACA,wBAAwB;WACxB,eAAe;;WAEf;;WAEA;;WAEA,QAAQ;;WAER,aAAa;WACb,SAAS;WACT;WACA;;UAGM;WACN;WACA;WACA;aAAmB;aAAuB;;WAC1C,UAAU,KAAK;;KAGd;UAEK;;;EAGf,sBAAsB;;EAEtB;;;;iBAsBc,2BACd,OAAO,kCACN;;;iBAWa,4BACd,SAAS,sBACT,SAAS,KAAK;UAuBC;WACN;WACA;WACA;WACA,kBAAkB;WAClB,UAAU;;WAEV;;UAGM;WACN,QAAQ;WACR;WACA,oBAAoB;;cAGlB,mCAAmC;WACrC;WACA;EAET,YAAY,oBAAoB;;;iBAUlB,2BAA2B,SAAS,uBAAuB;;iBA+B3D,gCACd,SAAS,sBACT,OAAO;;iBAUO,4BACd,oBACA,SAAS,2CACA,WAAW;;iBAcN,yBACd,oBACA,SAAS,mCACR;;;;UC5Jc;;EAEf,OAAO;;EAEP,UAAU;;EAEV,QAAQ;;EAER,OAAO;;EAEP;;EAEA,QAAQ;;;EAGR,QAAQ;;;UAIO;EACf,QAAQ;EACR,UAAU;;;iBAII,iBAAiB,uBAAuB;;KAW5C,gBAAgB,KAC1B;EAGA;IACE,OAAO;IACP,WAAW;IACX,MAAM;IACN;;;UAIa;EACf,QAAQ;;EAER;EACA,UAAU;;EAEV;;UAGe;EACf;EACA,UAAU;EACV,UAAU;;UAGK;EACf;;EAEA,SAAS,eAAe;EACxB,UAAU;EACV,aAAa;EACb,UAAU;;;EAGV;EACA;IAAc;IAAc,UAAU;;;EAEtC,oBAAoB;;EAEpB,OAAO,MAAM,oBAAoB;EACjC;;UAGe;EACf;EACA;EACA,OAAO;EACP;EACA,OAAO;EACP;EACA,cAAc;;UAGC;EACf;;EAEA;EACA,SAAS;EACT,YAAY;EACZ,UAAU;EACV;EACA;EACA;EACA;IAAc;IAAc;;EAC5B,kBAAkB;EAClB,WAAW;;EAEX,YAAY;EACZ,YAAY;;;iBAIE,aAAa,kBAAkB,qBAAqB;;cAQvD;WACF,QAAQ;mBACA;mBACA;mBACA;mBACA;UACT;UAED;;;;;SAuBM,KACX,SAAS,uBACT,SAAS,eACT,YAAW,sBACV,QAAQ;MAuCP;;EAKJ,SAAS,QAAQ;;EAKjB,KAAK,cAAc,gBAAgB;;;;;;EAsBnC,SAAS,KAAK;;EAkBR,aACJ,OAAO,0BACN;IAAU;IAAgB;;;EAmBvB,WAAW,OAAO,wBAAwB;EAmC1C,eAAe;IACnB;IACA,eAAe;IACf,cAAc;;;IAGd,YAAY;MACV;EAcE,gBACJ,OAAO,KAAK;IACV,YAAY;MAEb;;EAaG,aAAa,OAAO,0BAA0B;;EAyB9C,WAAW,OAAO,wBAAwB;EA2C1C,WAAW;IACf;IACA;MACE;;EAgBE,WAAW;IACf;IACA,UAAU;IACV,QAAQ;IACR;IACA;MACE;;;EAqBE,MAAM;IAAS,QAAQ;IAAmB,OAAO;MAAuB;;EAc9E,QAAQ;IAAS;IAAoB;MAAkB;UAIzC;;UAKN;;;iBAQM,YACd,UAAU,gBACV,SAAS,iBACR;;iBAUa,YACd,UAAU,gBACV,QAAQ,gBACR,OAAO,iBACN;;;;;;iBCpiBa,aAAa,OAAO;;;;UAYnB,WAAW;EAC1B;EACA,OAAO;;UAGQ,WAAW,OAAO;EACjC,MAAM;EACN,QAAQ,WAAW;;;;;;;;;;UAWJ;EACf;EACA;EACA;EACA;;;;;EAKA;;iBAGc,iBAAiB,4BAA4B,gBAAgB;;;;;;cCVhE;KACD,4BAA4B;;;;;cAM3B;UAKI;EACf;EACA;EACA;EACA;EACA;EACA;EACA;;UAGe;EACf,UAAU;;EAEV;;EAEA;;EAEA,UAAU;;;;EAIV;EACA,OAAO;;UAGQ;EACf;;EAEA;EACA,MAAM;;UAGS;EACf;;;;;KAMU,sBAAsB,OAAO;iBAEzB,cACd,OAAO,iBACP,UAAS;EACN,MAAM;EAAmB;IAAU;IAAc,OAAO;;;;;;cCvChD,kBAAkB;;;iBAOf,qBAAqB,gBAAgB;UAOpC;EACf;EACA;EACA,OAAO;EACP;;EAEA,oBAAoB;;EAEpB,uBAAuB;;;;;;;iBAQT,oBACd,OAAO,KAAK,uCACX;;;;;;;;;;;;;;;;;;;iBA+Ba,sBAAsB,OAAO,yBAAyB;;;;;;iBAiDtD,aACd,OAAO,iBACP,gBACA;EAAW;EAAiB,OAAO;IAClC;;UAmBc;EACf;;EAEA;;;EAGA;;EAEA;;UAGe;EACf,OAAO;EACP;;;;;;EAMA;;EAEA;;EAEA,OAAO;;;;;;;;;iBAUO,gBACd,OAAO,iBACP;EAAW,QAAQ;IAClB;;;;UClNc;WACN;WACA;WACA;;;WAGA;WACA;;WAEA;;WAEA;;WAEA;;;;EAIT,SAAS;;EAET,WAAW,0BAA0B;;EAErC,SAAS,gBAAgB,kBAAkB;;;EAG3C,kBAAkB;;;WAGT,WAAW;;;;;WAKX,iBAAiB;;;UAIX;WACN;WACA;;WAEA;;WAEA,UAAU;;;WAGV;;WAEA;;WAEA,QAAQ;;WAER;;;;WAIA;;;UAIM;EACf;EACA,UAAU,QAAQ;;EAElB;IAAa;IAAc,UAAU;;;UAGtB;;WAEN;;WAEA;;EAET,OAAO,MAAM,mBAAmB;;EAEhC,OAAO,MAAM;;;;;;;;;;;;;;iBAeC,UACd;EAAW;EAAmB;IAC7B;;;;;;;;;;;;;;;;;;;;;;;iBA+Ca,4BACd;EACE;EACA;EACA,eAAe,QAAQ,OAAO;IAE/B;;;;;;;;;;iBAyEa,sBAAsB;EAAW;IAAiB;UA4BjD;;;EAGf;;EAEA;;EAEA;;;EAGA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBAoCc,KAAK,UAAS,cAAmB;;;;;;;;;;;iBAmIjC,KAAK;EAAW;IAAkB;;;;UCxajC;EACf;EACA,OAAO;EACP;EACA,OAAO;;;UAIQ;WACN,OAAO;;;EAGhB,KAAK;;;UAIU;EACf;EACA;IAAY;IAAoB;;IAAmB;;;EAEnD,OAAO;EACP;EACA;;UAGe;;WAEN;;WAEA;;;EAGT,KAAK,OAAO,iBAAiB,gBAAgB,eAAe;;;EAG5D,WAAW,OAAO;;;EAGlB,QAAQ,MAAM,uBAAuB;;;EAGrC,MAAM,MAAM,sBAAsB,eAAe;;;;;;;;;iBAUnC,QAAQ;EAAW;IAAuB;UA8BzC;;;;EAIf;;;EAGA;;;EAGA;;EAEA;;;EAGA,SAAS;;;;;;;;;;UAWM;;WAEN;;;;;;EAMT,OAAO;IACL,OAAO;IACP;IACA;IACA;;IAEA;IACA;IACA;;;;;;;;;;;;;;;;;;;;;iBAsBY,KAAK,UAAS,cAAmB;;;;cCtFpC,mBAAmB;;;;;;;iBAchB,sBAAsB;EACpC;EACA;EACA;;;;;;UASe;EACf;EACA,MAAM;;EAEN,YAAY;;EAEZ,WAAW;IAAQ;IAAgB;;EACnC,OAAO;;;EAGP;EACA;;UAGe;EACf,YAAY;;EAEZ;;EAEA,WAAW;;;iBAIG,gBACd,OAAO,iBACP,OAAO,uBACN;;UAqGc;EACf;EACA,UAAU;EACV,OAAO;EACP;EACA;;;;;;;iBAQc,kBACd,OAAO,iBACP,MAAM;EACH,OAAO;EAAa,WAAW;;;KA4HxB;EACN;;;;EAEA;EAAoB;;;;;EAGpB;EAAmB;;;;;;;;;;;;;;;;;;;iBAmBT,kBAAkB,OAAO,kBAAkB;;;;;;;;;;;;;;iBAiF3C,oBACd,OAAO,iBACP,iBACC;;;;cC7aU,sBAAsB;;UAuBlB;EACf;;EAEA;;;EAGA;;;EAGA;;;UAIe,eAAe;EAC9B;EACA;EACA;EACA;EACA;EACA,OAAO;EACP;EACA,OAAO;EACP;EACA;;EAEA;EACA,UAAU;EACV,QAAQ;;;;;KAME,mBAAmB,KAAK;;;UAInB,eAAe;EAC9B,kBAAkB;;EAElB,MAAM,MAAM;IAAmB;;EAC/B,IAAI,MAAM,eAAe,aAAa,QAAQ;;;;EAI9C,MAAM,MAAM,eAAe,aAAa,QAAQ;;;UAIjC,oBAAoB;;EAEnC,KAAK,UAAU,gBAAgB,UAAU,YAAY;;EAErD,KACE,UAAU,gBACV,QAAQ,WACR,OAAO,YACN,oBAAoB;;EAEvB,KAAK,UAAU,gBAAgB,MAAM,aAAa;;UAGnC,sBAAsB;EACrC;EACA;EACA,UAAU,QAAQ;;EAElB,SAAS;IAAgB;IAAgB,UAAU;;;EAEnD;EACA,QAAQ;;;UAIO,oBAAoB;EACnC,UAAU;EACV;;EAEA;;;EAGA,cAAc,SAAS;;UAGR,qBAAqB;EACpC,UAAU,cAAc,oBAAoB;;EAE5C;;EAEA,YAAY;EACZ,YAAY;;;UAIG,mBAAmB;WACzB;WACA,MAAM;WACN,QAAQ;WACR,WAAW;;WAEX;;;WAGA;EACT,QAAQ,SAAS,sBAAsB,aAAa,QAAQ,qBAAqB;;UAGlE,iBAAiB;;EAEhC,UAAU;;EAEV,MAAM;EACN,OAAO,oBAAoB;EAC3B,QAAQ;EACR,YAAY;EACZ,UAAU,mBAAmB;EAC7B,UAAU,eAAe;;;EAGzB,SAAS,UAAU;;EAEnB;;EAEA;;;;EAIA,SAAS;;EAET;;UAGe;;EAEf,OAAO;;;EAGP;EACA,QAAQ;;EAER,OAAO;;;;EAIP,mBAAmB;;;UAIJ;EACf;EACA,UAAU;EACV;EACA;IAAa;IAAc,UAAU;;EACrC,UAAU;IACR,MAAM;IACN,OAAO,MAAM,oBAAoB;IACjC;IACA;IACA,aAAa,SAAS;IACtB;;;;iBAKY,qBAAqB;;;;;;;;;;;iBCrOrB,iBACd,OAAO,iBACP;EACE;EACA;EACA;EACA;IAED;;;;;;;;iBA4Fa,iBACd,OAAO,iBACP;EACG,OAAO;EAAc;;;;;iBCnEJ,UAAU,WAC9B,SAAS,iBAAiB,aACzB,QAAQ"}