@tangle-network/agent-eval 0.216.0 → 0.217.1

package/dist/{mint-Csor1BLJ.js.map → mint-zszyYlpA.js.map}

@@ -1 +1 @@
-{"version":3,"file":"mint-Csor1BLJ.js","names":[],"sources":["../src/rollout/mint.ts"],"sourcesContent":["/**\n * Rollout minting — `tangle.rollout.v1` lines joined from the records the\n * substrate ALREADY keeps. There is no separate rollout store: a rollout\n * is the JOIN of a RunRecord (identity, provenance, cost, outcome) with\n * its trace (spans share `runId`), projected into the canonical line.\n *\n * Composition, not duplication:\n *   - identity/provenance     → `RunRecord` (candidateId, splitTag, agentProfile, hashes)\n *   - step structure          → `buildTrajectory` over the shared TraceStore\n *   - preference-pair export  → `feedbackTrajectoryToOptimizerRow` (feedback-trajectory.ts)\n *   - PRM / reward-model      → `reward-model-export.ts`\n *   - search lineage          → `searchLineage`, read from the run's search ledger\n *\n * Anti-Goodhart invariant: a run whose `outcome.realness.gated` is true is\n * never exported with a positive reward OR with any of the numbers that reward\n * was computed from. The gate travels into the training data (`reward` forced\n * to 0, `realness_gated: true`) and the whole outcome is transformed by\n * `gateGamedOutcome` inside `assertMinted` below, which relocates `metrics` and\n * `verdict` to `provenance.gated_evidence`. Mint returns\n * `MintedRolloutLine[]`: the brand the training exporters require, which only\n * this function, `readRolloutLedger`, and an explicit `assertMinted` can mint.\n *\n * A record carrying NEITHER split score is REJECTED (`ValidationError`), never\n * minted at 0 — \"nobody graded this\" is not the same claim as \"graded a total\n * failure\", and a trainer reading 0 learns the second. Lines that already\n * carry `reward: null` (interchange imports, existing ledgers) remain valid on\n * the wire; only the RunRecord→line door refuses.\n *\n * Records without spans or an explicit full capture become labeled GAP LINES (messages: [],\n * provenance.gap) — present in the output AND surfaced in\n * `missingTraces`; a capture gap is a finding, never a silent omission.\n */\n\nimport { ValidationError } from '../errors'\nimport { type RunRecord, type RunSearchCoordinates, runTaskScore } from '../run-record'\nimport type { LlmSpan, Span, ToolSpan } from '../trace/schema'\nimport type { TraceStore } from '../trace/store'\nimport { buildTrajectory } from '../trajectory'\nimport { rolloutRewardFields, scoreOrigin } from './reward'\nimport {\n  assertMinted,\n  type ChatMessage,\n  type MintedRolloutLine,\n  ROLLOUT_SCHEMA,\n  type RolloutEvidenceAttempt,\n  type RolloutRole,\n  type RolloutSplit,\n  type RolloutStep,\n} from './schema'\n\n/** Redactor for transcript/step payload text (secrets, PII), not opaque identity. */\nexport type RolloutScrubber = (text: string) => string\n\n/** A search cell's place in its search tree, read from the search ledger. */\nexport interface RolloutSearchLineage {\n  /** Edges between the cell's node and the search root; the root is 0. */\n  depth: number\n  /** Order in which the node registered in its search; the root is 0. */\n  ordinal: number\n  /** Repeat index of the cell on its task, from 0. */\n  rep: number\n  /** Run id of the cell whose execution contains this search; null for a\n   *  top-level search. */\n  containingRunId: string | null\n}\n\nexport interface MintRolloutOptions {\n  scrub?: RolloutScrubber\n  /**\n   * Full canonical capture, including turns no longer in the model's context.\n   * When supplied, missing/empty capture is refused, never replaced with a\n   * span summary. Use the execution owner's capture or the existing harness\n   * readers; reviewer traces and compacted histories are not full capture.\n   */\n  messagesOf?: (\n    runId: string,\n  ) => readonly ChatMessage[] | undefined | Promise<readonly ChatMessage[] | undefined>\n  /** Provider attempts from a retained receipt bound to the exact run. */\n  evidenceOf?: (\n    runId: string,\n  ) =>\n    | { runId: string; attempts: readonly RolloutEvidenceAttempt[] }\n    | undefined\n    | Promise<{ runId: string; attempts: readonly RolloutEvidenceAttempt[] } | undefined>\n  /** Cap steps per line (longest runs first drop middle steps). Default: no cap. */\n  maxSteps?: number\n  /** Role recorded on every minted line. Default 'agent' (a solo eval run). */\n  role?: RolloutRole\n  /** Task suite label. Default: the record's `experimentId`. */\n  suite?: string\n  /** Injected clock for deterministic output. */\n  now?: () => Date\n  /**\n   * Lineage of a search run, read from its search ledger. It fills the line's\n   * `generation` (node depth), `candidate_index` (node order), `task.rep` and\n   * `parent_rollout_id` (the containing cell's run). Mint refuses a record\n   * that carries `search` when this is absent, because a null `generation`\n   * states that the run is not part of a search.\n   */\n  searchLineage?: (\n    search: RunSearchCoordinates,\n  ) => RolloutSearchLineage | Promise<RolloutSearchLineage>\n}\n\nexport interface MintRolloutResult {\n  rows: MintedRolloutLine[]\n  /** runIds that had a RunRecord but no spans — emitted as gap lines AND listed here. */\n  missingTraces: string[]\n}\n\nconst asText = (v: unknown, scrub: RolloutScrubber): string => {\n  const s = typeof v === 'string' ? v : JSON.stringify(v)\n  return scrub(s ?? '')\n}\n\nfunction projectStep(span: Span, scrub: RolloutScrubber): RolloutStep {\n  const base: RolloutStep = {\n    kind: span.kind,\n    name: scrub(span.name),\n    status: span.status,\n    durationMs: span.endedAt !== undefined ? span.endedAt - span.startedAt : undefined,\n  }\n  if (span.kind === 'llm') {\n    const llm = span as LlmSpan\n    const last = llm.messages[llm.messages.length - 1]\n    if (last && last.content !== null) base.input = scrub(last.content)\n    if (llm.output !== undefined) base.output = scrub(llm.output)\n  } else if (span.kind === 'tool') {\n    const tool = span as ToolSpan\n    base.input = asText(tool.args, scrub)\n    if (tool.result !== undefined) base.output = asText(tool.result, scrub)\n  }\n  return base\n}\n\n/** Preserve captured fields; invocation ids are opaque linkage, not generated text. */\nfunction projectMessage(message: ChatMessage, scrub: RolloutScrubber): ChatMessage {\n  return {\n    role: message.role,\n    content: message.content === null ? null : scrub(message.content),\n    ...(message.reasoning_content !== undefined\n      ? { reasoning_content: scrub(message.reasoning_content) }\n      : {}),\n    ...(message.tool_calls !== undefined\n      ? {\n          tool_calls: message.tool_calls.map((call) => ({\n            id: call.id,\n            type: call.type,\n            function: {\n              name: call.function.name,\n              arguments: scrub(call.function.arguments),\n            },\n          })),\n        }\n      : {}),\n    ...(message.tool_call_id !== undefined ? { tool_call_id: message.tool_call_id } : {}),\n    ...(message.name !== undefined ? { name: message.name } : {}),\n    ...(message.is_copied_context !== undefined\n      ? { is_copied_context: message.is_copied_context }\n      : {}),\n  }\n}\n\n/** Never recover missing calls from tool names, span order or argument summaries. */\nfunction requireToolLinkage(messages: readonly ChatMessage[], runId: string): void {\n  const seen = new Set<string>()\n  const pending = new Map<string, string>()\n  const refuse: (detail: string) => never = (detail) => {\n    throw new ValidationError(`Cannot mint rollout for run ${runId}: ${detail}`)\n  }\n  for (const message of messages) {\n    if (message.tool_calls !== undefined) {\n      if (message.role !== 'assistant' || !Array.isArray(message.tool_calls)) {\n        refuse('tool calls must be captured on an assistant message')\n      }\n      if (pending.size > 0) refuse('new tool calls precede the prior invocation results')\n      for (const call of message.tool_calls) {\n        if (\n          !call ||\n          typeof call.id !== 'string' ||\n          call.id.length === 0 ||\n          seen.has(call.id) ||\n          call.type !== 'function' ||\n          !call.function ||\n          typeof call.function.name !== 'string' ||\n          call.function.name.length === 0 ||\n          typeof call.function.arguments !== 'string'\n        ) {\n          refuse('missing, duplicate or malformed tool invocation')\n        }\n        seen.add(call.id)\n        pending.set(call.id, call.function.name)\n      }\n    }\n    if (message.role === 'tool') {\n      const id = message.tool_call_id\n      if (typeof id !== 'string' || !pending.has(id)) {\n        refuse('tool result has no captured invocation (or answers it more than once)')\n      }\n      if (message.name !== undefined && message.name !== pending.get(id)) {\n        refuse('tool result name does not match its invocation')\n      }\n      pending.delete(id)\n    } else if (message.tool_call_id !== undefined) {\n      refuse('tool_call_id is only valid on a tool result')\n    } else if (pending.size > 0 && message.tool_calls === undefined) {\n      refuse('conversation advances before all tool results were captured')\n    }\n  }\n  if (pending.size > 0) refuse('tool invocation has no captured result')\n}\n\n/** Legacy span history; callers with compacted contexts supply messagesOf instead. */\nfunction finalConversation(spans: Span[]): ChatMessage[] {\n  const llms = spans.filter((s): s is LlmSpan => s.kind === 'llm')\n  const last = llms[llms.length - 1]\n  if (!last) return []\n  const messages: ChatMessage[] = [...last.messages]\n  if (last.output !== undefined && last.output !== '') {\n    messages.push({ role: 'assistant', content: last.output })\n  }\n  return messages\n}\n\n// The reward derivations live in the leaf module `./reward` so gate and\n// reporting code can import them without dragging in the trace store; they are\n// re-exported here because the derivations shipped from this path.\nexport {\n  isRealnessGated,\n  observedScore,\n  observedSplitScore,\n  type ScoreOrigin,\n  type ScorePreference,\n  scoreOrigin,\n  trainingReward,\n  trainingScore,\n} from './reward'\n\nconst REWARD_SOURCE: Record<ReturnType<typeof scoreOrigin>, string> = {\n  holdout: 'run-record/holdout-score',\n  search: 'run-record/search-score',\n  unscored: 'run-record/unscored',\n}\n\n/**\n * The mint door refuses an execution-only record: a missing training label is\n * not a zero reward, and not a mintable line either. Lines that already carry\n * `reward: null` — interchange imports, existing ledgers — stay valid on the\n * wire and keep their labeled gap; this guard is only about the\n * RunRecord→line door, where the producer can still be told to go score the\n * run instead of shipping an unlabeled row.\n */\nfunction requireTaskScore(record: RunRecord): void {\n  if (runTaskScore(record) === undefined) {\n    throw new ValidationError(`Cannot mint rollout for run ${record.runId}: task score is missing`)\n  }\n}\n\nconst isObject = (value: unknown): value is Record<string, unknown> =>\n  typeof value === 'object' && value !== null\n\ninterface MintFieldCheck {\n  /** The RunRecord path, spelled the way the caller has to fix it. */\n  readonly field: string\n  /** True when the record carries something the line can honestly be built from. */\n  readonly present: (bag: Record<string, unknown>) => boolean\n  /** What the caller writes onto the record, and why that value and not another. */\n  readonly remedy: string\n}\n\n/**\n * The RunRecord fields mint reads that a record can be missing even though the\n * TYPE says it cannot. There are exactly two ways that happens:\n *\n *   1. The field was OPTIONAL when the record was serialized. `costProvenance`,\n *      `terminalOutcome` and `scenarioId` were optional through agent-eval\n *      0.125 and became required in 0.126, with no on-disk migration — so every\n *      ledger written before 0.126 is full of records the type calls complete.\n *   2. Mint reads a level DEEPER than the record's own type is checked at:\n *      `outcome.raw`, `tokenUsage.input`, `tokenUsage.output`.\n *\n * Nothing else needs a check here. Every other field mint copies is a top-level\n * scalar landing in a typed slot on the line, where an absent value arrives as\n * `undefined` and `assertMinted` refuses it by name. These are the ones where an\n * absent value instead kills the join with `TypeError: Cannot read properties of\n * undefined`, or — worse — mints a line that reads as measured.\n *\n * This is deliberately NOT `validateRunRecord`. That validator answers \"is this\n * a valid RunRecord\", which is a wider question than \"can a rollout line be\n * built from this one\": it also enforces model-snapshot discipline, the\n * `terminalFailureReason` coupling, and the `costUsd === costProvenance.usd`\n * agreement. Routing the mint door through it would refuse records mint can\n * mint honestly today (a model alias with no snapshot date, for one), which is\n * a policy change with its own blast radius and not this bug. The door asks the\n * narrower question and answers it precisely.\n */\nconst MINT_FIELD_CHECKS: readonly MintFieldCheck[] = [\n  {\n    field: 'costProvenance',\n    present: (bag) => isObject(bag.costProvenance) && typeof bag.costProvenance.kind === 'string',\n    remedy:\n      \"Records written before agent-eval 0.126 predate this field and carry `costUsd: 0` as the documented uncaptured sentinel, which is NOT an observed zero. Backfill it as costProvenance: { kind: 'uncaptured', usd: null } WITH costUsd: null — an uncaptured cost whose costUsd is non-null is rejected by validateRunRecord, so provenance alone leaves the record invalid.\",\n  },\n  {\n    field: 'tokenUsage',\n    present: (bag) => isObject(bag.tokenUsage),\n    remedy:\n      \"The line's cost.tokens_in and cost.tokens_out are read from it. Backfill it from the provider's usage report; mint will not write 0 for tokens nobody counted.\",\n  },\n  {\n    field: 'tokenUsage.input',\n    present: (bag) => !isObject(bag.tokenUsage) || typeof bag.tokenUsage.input === 'number',\n    remedy: \"The line's cost.tokens_in is read from it, and a missing count is not a zero count.\",\n  },\n  {\n    field: 'tokenUsage.output',\n    present: (bag) => !isObject(bag.tokenUsage) || typeof bag.tokenUsage.output === 'number',\n    remedy: \"The line's cost.tokens_out is read from it, and a missing count is not a zero count.\",\n  },\n  {\n    field: 'outcome',\n    present: (bag) => isObject(bag.outcome),\n    remedy:\n      \"The line's reward, reward_source and metrics are all read from it. A record with no outcome carries no training label at all, and mint refuses an unlabeled row.\",\n  },\n  {\n    field: 'outcome.raw',\n    // Reported only when `outcome` itself is present: one absent field should\n    // produce one reason per CAUSE, not one per path that dereferences it.\n    present: (bag) => !isObject(bag.outcome) || isObject(bag.outcome.raw),\n    remedy:\n      'It is the metric bag copied verbatim into the line\\'s outcome.metrics. `{ ...undefined }` spreads to `{}` without complaint, so an absent bag would mint as \"this run reported no metrics\" — a different claim from \"this record predates the field\". Backfill it as {} only when that is what you mean.',\n  },\n  {\n    field: 'terminalOutcome',\n    present: (bag) => typeof bag.terminalOutcome === 'string',\n    remedy:\n      \"It became required in agent-eval 0.126. Backfill it from root-run or process evidence, or as 'unknown' when the producer has none — mint will not decide the line's is_completed and is_truncated for you.\",\n  },\n  {\n    field: 'scenarioId',\n    present: (bag) => typeof bag.scenarioId === 'string' && bag.scenarioId.length > 0,\n    remedy:\n      \"It became required in agent-eval 0.126 and becomes the line's task.instance_id, which must be a non-empty string. Backfill it from the scenario the run was dealt (pre-0.126 producers often left it in outcome.raw.scenario_id).\",\n  },\n]\n\n/**\n * Why a record cannot be minted, one entry per missing field, empty when it can.\n *\n * Exported so a caller can partition a whole ledger — \"which of my 2742 records\n * predate 0.126\" — without catching an exception per record, and without\n * re-deriving the field list on their side. A re-derived list is a list that\n * drifts from the door it is supposed to predict.\n *\n * Takes a `RunRecord` because that is what the caller holds and what the\n * compiler agrees they hold. The type is precisely the thing that is wrong, so\n * the checks read the record as the untyped bag it actually is on disk.\n */\nexport function unmintableReasons(record: RunRecord): string[] {\n  const bag = record as unknown as Record<string, unknown>\n  return MINT_FIELD_CHECKS.filter((check) => !check.present(bag)).map(\n    (check) => `${check.field} is missing. ${check.remedy}`,\n  )\n}\n\n/**\n * The mint door THROWS on a record it cannot build a line from. It does NOT\n * normalise an absent `costProvenance` to `{kind:'uncaptured', usd:null}`, and\n * the choice is not stylistic:\n *\n *   - Normalising cannot cover the record, only part of it. `terminalOutcome`\n *     feeds `is_completed` and `is_truncated`, which the rollout schema requires\n *     to be BOOLEAN — there is no null to fall back to, so every possible\n *     default is a claim about how the run ended. A door that quietly fixes the\n *     cost and invents the ending is a door no caller can predict.\n *   - Normalising the cost requires knowing what `costUsd: 0` meant, and mint\n *     cannot know. A genuinely free run and an uncaptured one are the same bytes\n *     in a pre-0.126 record; only the producer can tell them apart. Guessing is\n *     exactly the failure this guard exists to stop — the 0.125 optional chain\n *     `record.costProvenance?.kind === 'uncaptured'` already made that guess,\n *     silently, and every record it touched minted `cost.usd: 0`: an unmeasured\n *     cost published as a measured zero, into a training dataset.\n *   - `requireTaskScore`, directly above, already refuses an unlabeled record\n *     for the same reason: \"nobody graded this\" is not \"graded zero\". \"Nobody\n *     billed this\" is not \"billed zero\".\n *\n * The caller who wants historical records minted backfills them at their store,\n * in one pass, where `costUsd` can be corrected alongside `costProvenance` —\n * which is the only place that decision can be made correctly. The refusal names\n * the run, names every missing field, and spells the value to write.\n */\nfunction requireMintableRecord(record: RunRecord): void {\n  const reasons = unmintableReasons(record)\n  if (reasons.length === 0) return\n  throw new ValidationError(`Cannot mint rollout for run ${record.runId}: ${reasons.join('\\n  ')}`)\n}\n\n/** The search lineage a record's line is built from; undefined for a record outside a search. */\nasync function resolveSearchLineage(\n  record: RunRecord,\n  options: MintRolloutOptions,\n): Promise<RolloutSearchLineage | undefined> {\n  if (record.search === undefined) return undefined\n  const refuse: (detail: string) => never = (detail) => {\n    throw new ValidationError(`Cannot mint rollout for search run ${record.runId}: ${detail}`)\n  }\n  if (!options.searchLineage) {\n    refuse('pass searchLineage so generation, candidate_index, rep and parent come from its ledger')\n  }\n  const lineage = await options.searchLineage(record.search)\n  const isCount = (value: unknown): boolean => Number.isSafeInteger(value) && (value as number) >= 0\n  if (!isCount(lineage.depth)) refuse('lineage depth must be a non-negative integer')\n  if (!isCount(lineage.ordinal)) refuse('lineage ordinal must be a non-negative integer')\n  if (!isCount(lineage.rep)) refuse('lineage rep must be a non-negative integer')\n  if (\n    lineage.containingRunId !== null &&\n    (typeof lineage.containingRunId !== 'string' || lineage.containingRunId.length === 0)\n  ) {\n    refuse('lineage containingRunId must be null or a non-empty run id')\n  }\n  if (lineage.containingRunId === record.runId) refuse('a run cannot contain itself')\n  return lineage\n}\n\nconst SPLIT_FROM_TAG: Record<RunRecord['splitTag'], RolloutSplit> = {\n  search: 'search',\n  dev: 'dev',\n  holdout: 'holdout',\n}\n\nfunction mintLine(\n  record: RunRecord,\n  lineage: RolloutSearchLineage | undefined,\n  steps: RolloutStep[],\n  messages: ChatMessage[],\n  options: MintRolloutOptions,\n  capturedAt: string,\n  gap?: string,\n  attempts?: readonly RolloutEvidenceAttempt[],\n  lossyProjection = false,\n): MintedRolloutLine {\n  // Field presence first, and BEFORE `requireTaskScore`: that guard reads\n  // `record.outcome.searchScore` on its way to the answer, so an absent\n  // `outcome` would throw a bare TypeError from inside the guard whose whole\n  // job is to produce a clean refusal.\n  //\n  // Both branches of `mintRolloutRows` — the traced line and the gap line —\n  // land here, which is the point: `mintLine` is the only constructor of a\n  // `MintedRolloutLine` from a RunRecord, so there is no path into the waist\n  // that skips the check and no way to get this wrong from the outside.\n  requireMintableRecord(record)\n  // A missing task score is refused before anything is built: an\n  // execution-only record has no training label, and a missing label is\n  // neither a zero reward nor a mintable row.\n  requireTaskScore(record)\n  // `reward` and `realness_gated` come out of one call, so neither door into\n  // the waist can write one and forget the other.\n  const rewardFields = rolloutRewardFields(record)\n  // Only an observed or estimated amount is a total; a lower bound is not.\n  const knownTotal =\n    record.costProvenance.kind === 'observed' || record.costProvenance.kind === 'estimated'\n  const terminalOutcome = record.terminalOutcome\n  const isCompleted = terminalOutcome === 'succeeded' || terminalOutcome === 'failed'\n  const isTruncated = terminalOutcome === 'cancelled' || terminalOutcome === 'incomplete'\n  const terminalError =\n    terminalOutcome === 'failed' ||\n    terminalOutcome === 'cancelled' ||\n    terminalOutcome === 'incomplete'\n      ? (record.terminalFailureReason ?? `run ended ${terminalOutcome}`)\n      : null\n  // `assertMinted` rather than a cast: mint is the producer the whole gate\n  // rests on, so it proves the line it just built is valid instead of asserting\n  // it by fiat. The brand is unforgeable precisely because nobody casts to it.\n  return assertMinted(\n    {\n      schema: ROLLOUT_SCHEMA,\n      rollout_id: record.runId,\n      parent_rollout_id: lineage?.containingRunId ?? null,\n      run_id: record.runId,\n      experiment_id: record.experimentId,\n      candidate_id: record.candidateId,\n      generation: lineage?.depth ?? null,\n      candidate_index: lineage?.ordinal ?? null,\n      role: options.role ?? 'agent',\n      task: {\n        suite: options.suite ?? record.experimentId,\n        instance_id: record.scenarioId,\n        split: SPLIT_FROM_TAG[record.splitTag],\n        seed: record.seed,\n        rep: lineage?.rep ?? 0,\n      },\n      policy: {\n        harness: null,\n        harness_version: null,\n        model: record.model,\n        provider: null,\n        profile_commit: record.commitSha,\n        prompt_hash: record.promptHash,\n        config_hash: record.configHash,\n        agent_profile_cell_id: record.agentProfile?.cellId ?? null,\n        sampling: null,\n      },\n      messages,\n      tool_defs: [],\n      ...(steps.length > 0 ? { steps } : {}),\n      outcome: {\n        ...rewardFields,\n        reward_source: REWARD_SOURCE[scoreOrigin(record)],\n        verdict: null,\n        // A verbatim bulk copy, deliberately UNFILTERED here. `outcome.raw`\n        // holds the per-layer verifier scores (`layer.*`) that the reward was\n        // derived from, so on a gated run this dict is the reward signal in\n        // component form — but filtering it at this call site is the pattern\n        // that has now leaked twice, because the next producer to write a\n        // reward-bearing field forgets. The gate is applied to the whole\n        // outcome once, in `assertMinted` below (`gateGamedOutcome`), which\n        // moves the block to `provenance.gated_evidence` when the run is gated\n        // and leaves it here untouched when it is not.\n        metrics: { ...record.outcome.raw },\n        is_completed: isCompleted,\n        is_truncated: isTruncated,\n        error: terminalError,\n      },\n      cost: {\n        usd: knownTotal ? record.costUsd : null,\n        tokens_in: record.tokenUsage.input,\n        tokens_out: record.tokenUsage.output,\n        tokens_reasoning: record.tokenUsage.reasoning ?? null,\n        cache_read: record.tokenUsage.cached ?? null,\n        cache_write: record.tokenUsage.cacheWrite ?? null,\n        wall_s: Math.round(record.wallMs / 1000),\n      },\n      artifacts: {\n        patch_path: null,\n        run_dir: null,\n        transcript_ref: record.traceRef ? `trace:${record.traceRef.traceId}` : null,\n      },\n      provenance: {\n        captured_at: capturedAt,\n        capture: 'mint',\n        ...(record.search !== undefined ? { search: { ...record.search } } : {}),\n        ...(attempts !== undefined ? { attempts: [...attempts] } : {}),\n        ...(lossyProjection ? { lossy_projection: true } : {}),\n        ...(gap !== undefined ? { gap } : {}),\n      },\n    },\n    `minted rollout line for run ${record.runId}`,\n  )\n}\n\n/**\n * Join RunRecords with their traces into canonical rollout lines. Records\n * without spans or an explicit capture are emitted as labeled gap lines and reported in\n * `missingTraces`. Execution-only records without a task score are rejected\n * because a missing training label is not a zero reward.\n */\nexport async function mintRolloutRows(\n  records: RunRecord[],\n  store: TraceStore,\n  options: MintRolloutOptions = {},\n): Promise<MintRolloutResult> {\n  const scrub = options.scrub ?? ((t) => t)\n  const capturedAt = (options.now?.() ?? new Date()).toISOString()\n  if (\n    options.maxSteps !== undefined &&\n    (!Number.isSafeInteger(options.maxSteps) || options.maxSteps < 1)\n  ) {\n    throw new ValidationError('maxSteps must be a positive integer')\n  }\n  const rows: MintedRolloutLine[] = []\n  const missingTraces: string[] = []\n  for (const record of records) {\n    const trajectory = await buildTrajectory(store, record.runId)\n    const captured = options.messagesOf ? await options.messagesOf(record.runId) : undefined\n    const evidence = options.evidenceOf ? await options.evidenceOf(record.runId) : undefined\n    if (evidence !== undefined && evidence?.runId !== record.runId) {\n      throw new ValidationError(\n        `Cannot mint rollout for run ${record.runId}: capture evidence belongs to another run`,\n      )\n    }\n    if (\n      options.evidenceOf &&\n      (!evidence || !Array.isArray(evidence.attempts) || evidence.attempts.length === 0)\n    ) {\n      throw new ValidationError(\n        `Cannot mint rollout for run ${record.runId}: provider attempt evidence is missing`,\n      )\n    }\n    if (\n      evidence?.attempts.some(\n        (attempt) =>\n          !attempt ||\n          !Array.isArray(attempt.nativeSessionIds) ||\n          !Array.isArray(attempt.processIds) ||\n          !Array.isArray(attempt.missingReasons),\n      )\n    ) {\n      throw new ValidationError(\n        `Cannot mint rollout for run ${record.runId}: malformed provider attempt evidence`,\n      )\n    }\n    const attempts = evidence?.attempts.map((attempt) => ({\n      ...attempt,\n      nativeSessionIds: [...attempt.nativeSessionIds],\n      processIds: [...attempt.processIds],\n      missingReasons: attempt.missingReasons.map(scrub),\n    }))\n    if (options.messagesOf && (!Array.isArray(captured) || captured.length === 0)) {\n      throw new ValidationError(\n        `Cannot mint rollout for run ${record.runId}: full capture is missing`,\n      )\n    }\n    const lineage = await resolveSearchLineage(record, options)\n    if (trajectory.steps.length === 0 && !options.messagesOf) {\n      missingTraces.push(record.runId)\n      rows.push(\n        mintLine(\n          record,\n          lineage,\n          [],\n          [],\n          options,\n          capturedAt,\n          'no trace spans recorded for this runId',\n          attempts,\n        ),\n      )\n      continue\n    }\n    let steps = trajectory.steps.map((s) => projectStep(s.span, scrub))\n    const omittedSteps =\n      options.maxSteps !== undefined && steps.length > options.maxSteps\n        ? steps.length - options.maxSteps\n        : 0\n    if (options.maxSteps !== undefined && omittedSteps > 0) {\n      // Keep the head and tail — the middle of a long run is the least\n      // informative for outcome attribution.\n      const head = Math.ceil(options.maxSteps / 2)\n      const tail = options.maxSteps - head\n      steps = [...steps.slice(0, head), ...steps.slice(steps.length - tail)]\n    }\n    const spans = trajectory.steps.map((s) => s.span)\n    const messages = captured ?? finalConversation(spans)\n    requireToolLinkage(messages, record.runId)\n    const conversation = messages.map((message) => projectMessage(message, scrub))\n    // SFT drops copied context. That projection must not orphan a retained result.\n    requireToolLinkage(\n      conversation.filter((message) => message.is_copied_context !== true),\n      record.runId,\n    )\n    const gaps: string[] = []\n    if (conversation.length === 0) gaps.push('trace has no llm spans; no conversation to inline')\n    else if (!options.messagesOf) {\n      gaps.push('messages project only the last LLM context; full transcript was not captured')\n    }\n    if (omittedSteps > 0) gaps.push(`${omittedSteps} middle trace steps omitted by maxSteps`)\n    for (const attempt of attempts ?? []) {\n      if (attempt.missingReasons.length > 0) {\n        gaps.push(`provider attempt ${attempt.ordinal}: ${attempt.missingReasons.join(', ')}`)\n      }\n    }\n    rows.push(\n      mintLine(\n        record,\n        lineage,\n        steps,\n        conversation,\n        options,\n        capturedAt,\n        gaps.length > 0 ? gaps.join('; ') : undefined,\n        attempts,\n        (conversation.length > 0 && !options.messagesOf) ||\n          omittedSteps > 0 ||\n          (attempts?.some((attempt) => attempt.missingReasons.length > 0) ?? false),\n      ),\n    )\n  }\n  return { rows, missingTraces }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8GA,MAAM,UAAU,GAAY,UAAmC;CAE7D,OAAO,OADG,OAAO,MAAM,WAAW,IAAI,KAAK,UAAU,CAAC,MACpC,EAAE;AACtB;AAEA,SAAS,YAAY,MAAY,OAAqC;CACpE,MAAM,OAAoB;EACxB,MAAM,KAAK;EACX,MAAM,MAAM,KAAK,IAAI;EACrB,QAAQ,KAAK;EACb,YAAY,KAAK,YAAY,KAAA,IAAY,KAAK,UAAU,KAAK,YAAY,KAAA;CAC3E;CACA,IAAI,KAAK,SAAS,OAAO;EACvB,MAAM,MAAM;EACZ,MAAM,OAAO,IAAI,SAAS,IAAI,SAAS,SAAS;EAChD,IAAI,QAAQ,KAAK,YAAY,MAAM,KAAK,QAAQ,MAAM,KAAK,OAAO;EAClE,IAAI,IAAI,WAAW,KAAA,GAAW,KAAK,SAAS,MAAM,IAAI,MAAM;CAC9D,OAAO,IAAI,KAAK,SAAS,QAAQ;EAC/B,MAAM,OAAO;EACb,KAAK,QAAQ,OAAO,KAAK,MAAM,KAAK;EACpC,IAAI,KAAK,WAAW,KAAA,GAAW,KAAK,SAAS,OAAO,KAAK,QAAQ,KAAK;CACxE;CACA,OAAO;AACT;;AAGA,SAAS,eAAe,SAAsB,OAAqC;CACjF,OAAO;EACL,MAAM,QAAQ;EACd,SAAS,QAAQ,YAAY,OAAO,OAAO,MAAM,QAAQ,OAAO;EAChE,GAAI,QAAQ,sBAAsB,KAAA,IAC9B,EAAE,mBAAmB,MAAM,QAAQ,iBAAiB,EAAE,IACtD,CAAC;EACL,GAAI,QAAQ,eAAe,KAAA,IACvB,EACE,YAAY,QAAQ,WAAW,KAAK,UAAU;GAC5C,IAAI,KAAK;GACT,MAAM,KAAK;GACX,UAAU;IACR,MAAM,KAAK,SAAS;IACpB,WAAW,MAAM,KAAK,SAAS,SAAS;GAC1C;EACF,EAAE,EACJ,IACA,CAAC;EACL,GAAI,QAAQ,iBAAiB,KAAA,IAAY,EAAE,cAAc,QAAQ,aAAa,IAAI,CAAC;EACnF,GAAI,QAAQ,SAAS,KAAA,IAAY,EAAE,MAAM,QAAQ,KAAK,IAAI,CAAC;EAC3D,GAAI,QAAQ,sBAAsB,KAAA,IAC9B,EAAE,mBAAmB,QAAQ,kBAAkB,IAC/C,CAAC;CACP;AACF;;AAGA,SAAS,mBAAmB,UAAkC,OAAqB;CACjF,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,0BAAU,IAAI,IAAoB;CACxC,MAAM,UAAqC,WAAW;EACpD,MAAM,IAAI,gBAAgB,+BAA+B,MAAM,IAAI,QAAQ;CAC7E;CACA,KAAK,MAAM,WAAW,UAAU;EAC9B,IAAI,QAAQ,eAAe,KAAA,GAAW;GACpC,IAAI,QAAQ,SAAS,eAAe,CAAC,MAAM,QAAQ,QAAQ,UAAU,GACnE,OAAO,qDAAqD;GAE9D,IAAI,QAAQ,OAAO,GAAG,OAAO,qDAAqD;GAClF,KAAK,MAAM,QAAQ,QAAQ,YAAY;IACrC,IACE,CAAC,QACD,OAAO,KAAK,OAAO,YACnB,KAAK,GAAG,WAAW,KACnB,KAAK,IAAI,KAAK,EAAE,KAChB,KAAK,SAAS,cACd,CAAC,KAAK,YACN,OAAO,KAAK,SAAS,SAAS,YAC9B,KAAK,SAAS,KAAK,WAAW,KAC9B,OAAO,KAAK,SAAS,cAAc,UAEnC,OAAO,iDAAiD;IAE1D,KAAK,IAAI,KAAK,EAAE;IAChB,QAAQ,IAAI,KAAK,IAAI,KAAK,SAAS,IAAI;GACzC;EACF;EACA,IAAI,QAAQ,SAAS,QAAQ;GAC3B,MAAM,KAAK,QAAQ;GACnB,IAAI,OAAO,OAAO,YAAY,CAAC,QAAQ,IAAI,EAAE,GAC3C,OAAO,uEAAuE;GAEhF,IAAI,QAAQ,SAAS,KAAA,KAAa,QAAQ,SAAS,QAAQ,IAAI,EAAE,GAC/D,OAAO,gDAAgD;GAEzD,QAAQ,OAAO,EAAE;EACnB,OAAO,IAAI,QAAQ,iBAAiB,KAAA,GAClC,OAAO,6CAA6C;OAC/C,IAAI,QAAQ,OAAO,KAAK,QAAQ,eAAe,KAAA,GACpD,OAAO,6DAA6D;CAExE;CACA,IAAI,QAAQ,OAAO,GAAG,OAAO,wCAAwC;AACvE;;AAGA,SAAS,kBAAkB,OAA8B;CACvD,MAAM,OAAO,MAAM,QAAQ,MAAoB,EAAE,SAAS,KAAK;CAC/D,MAAM,OAAO,KAAK,KAAK,SAAS;CAChC,IAAI,CAAC,MAAM,OAAO,CAAC;CACnB,MAAM,WAA0B,CAAC,GAAG,KAAK,QAAQ;CACjD,IAAI,KAAK,WAAW,KAAA,KAAa,KAAK,WAAW,IAC/C,SAAS,KAAK;EAAE,MAAM;EAAa,SAAS,KAAK;CAAO,CAAC;CAE3D,OAAO;AACT;AAgBA,MAAM,gBAAgE;CACpE,SAAS;CACT,QAAQ;CACR,UAAU;AACZ;;;;;;;;;AAUA,SAAS,iBAAiB,QAAyB;CACjD,IAAI,aAAa,MAAM,MAAM,KAAA,GAC3B,MAAM,IAAI,gBAAgB,+BAA+B,OAAO,MAAM,wBAAwB;AAElG;AAEA,MAAM,YAAY,UAChB,OAAO,UAAU,YAAY,UAAU;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqCzC,MAAM,oBAA+C;CACnD;EACE,OAAO;EACP,UAAU,QAAQ,SAAS,IAAI,cAAc,KAAK,OAAO,IAAI,eAAe,SAAS;EACrF,QACE;CACJ;CACA;EACE,OAAO;EACP,UAAU,QAAQ,SAAS,IAAI,UAAU;EACzC,QACE;CACJ;CACA;EACE,OAAO;EACP,UAAU,QAAQ,CAAC,SAAS,IAAI,UAAU,KAAK,OAAO,IAAI,WAAW,UAAU;EAC/E,QAAQ;CACV;CACA;EACE,OAAO;EACP,UAAU,QAAQ,CAAC,SAAS,IAAI,UAAU,KAAK,OAAO,IAAI,WAAW,WAAW;EAChF,QAAQ;CACV;CACA;EACE,OAAO;EACP,UAAU,QAAQ,SAAS,IAAI,OAAO;EACtC,QACE;CACJ;CACA;EACE,OAAO;EAGP,UAAU,QAAQ,CAAC,SAAS,IAAI,OAAO,KAAK,SAAS,IAAI,QAAQ,GAAG;EACpE,QACE;CACJ;CACA;EACE,OAAO;EACP,UAAU,QAAQ,OAAO,IAAI,oBAAoB;EACjD,QACE;CACJ;CACA;EACE,OAAO;EACP,UAAU,QAAQ,OAAO,IAAI,eAAe,YAAY,IAAI,WAAW,SAAS;EAChF,QACE;CACJ;AACF;;;;;;;;;;;;;AAcA,SAAgB,kBAAkB,QAA6B;CAC7D,MAAM,MAAM;CACZ,OAAO,kBAAkB,QAAQ,UAAU,CAAC,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAC,KAC7D,UAAU,GAAG,MAAM,MAAM,eAAe,MAAM,QACjD;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA,SAAS,sBAAsB,QAAyB;CACtD,MAAM,UAAU,kBAAkB,MAAM;CACxC,IAAI,QAAQ,WAAW,GAAG;CAC1B,MAAM,IAAI,gBAAgB,+BAA+B,OAAO,MAAM,IAAI,QAAQ,KAAK,MAAM,GAAG;AAClG;;AAGA,eAAe,qBACb,QACA,SAC2C;CAC3C,IAAI,OAAO,WAAW,KAAA,GAAW,OAAO,KAAA;CACxC,MAAM,UAAqC,WAAW;EACpD,MAAM,IAAI,gBAAgB,sCAAsC,OAAO,MAAM,IAAI,QAAQ;CAC3F;CACA,IAAI,CAAC,QAAQ,eACX,OAAO,wFAAwF;CAEjG,MAAM,UAAU,MAAM,QAAQ,cAAc,OAAO,MAAM;CACzD,MAAM,WAAW,UAA4B,OAAO,cAAc,KAAK,KAAM,SAAoB;CACjG,IAAI,CAAC,QAAQ,QAAQ,KAAK,GAAG,OAAO,8CAA8C;CAClF,IAAI,CAAC,QAAQ,QAAQ,OAAO,GAAG,OAAO,gDAAgD;CACtF,IAAI,CAAC,QAAQ,QAAQ,GAAG,GAAG,OAAO,4CAA4C;CAC9E,IACE,QAAQ,oBAAoB,SAC3B,OAAO,QAAQ,oBAAoB,YAAY,QAAQ,gBAAgB,WAAW,IAEnF,OAAO,4DAA4D;CAErE,IAAI,QAAQ,oBAAoB,OAAO,OAAO,OAAO,6BAA6B;CAClF,OAAO;AACT;AAEA,MAAM,iBAA8D;CAClE,QAAQ;CACR,KAAK;CACL,SAAS;AACX;AAEA,SAAS,SACP,QACA,SACA,OACA,UACA,SACA,YACA,KACA,UACA,kBAAkB,OACC;CAUnB,sBAAsB,MAAM;CAI5B,iBAAiB,MAAM;CAGvB,MAAM,eAAe,oBAAoB,MAAM;CAE/C,MAAM,aACJ,OAAO,eAAe,SAAS,cAAc,OAAO,eAAe,SAAS;CAC9E,MAAM,kBAAkB,OAAO;CAC/B,MAAM,cAAc,oBAAoB,eAAe,oBAAoB;CAC3E,MAAM,cAAc,oBAAoB,eAAe,oBAAoB;CAC3E,MAAM,gBACJ,oBAAoB,YACpB,oBAAoB,eACpB,oBAAoB,eACf,OAAO,yBAAyB,aAAa,oBAC9C;CAIN,OAAO,aACL;EACE,QAAQ;EACR,YAAY,OAAO;EACnB,mBAAmB,SAAS,mBAAmB;EAC/C,QAAQ,OAAO;EACf,eAAe,OAAO;EACtB,cAAc,OAAO;EACrB,YAAY,SAAS,SAAS;EAC9B,iBAAiB,SAAS,WAAW;EACrC,MAAM,QAAQ,QAAQ;EACtB,MAAM;GACJ,OAAO,QAAQ,SAAS,OAAO;GAC/B,aAAa,OAAO;GACpB,OAAO,eAAe,OAAO;GAC7B,MAAM,OAAO;GACb,KAAK,SAAS,OAAO;EACvB;EACA,QAAQ;GACN,SAAS;GACT,iBAAiB;GACjB,OAAO,OAAO;GACd,UAAU;GACV,gBAAgB,OAAO;GACvB,aAAa,OAAO;GACpB,aAAa,OAAO;GACpB,uBAAuB,OAAO,cAAc,UAAU;GACtD,UAAU;EACZ;EACA;EACA,WAAW,CAAC;EACZ,GAAI,MAAM,SAAS,IAAI,EAAE,MAAM,IAAI,CAAC;EACpC,SAAS;GACP,GAAG;GACH,eAAe,cAAc,YAAY,MAAM;GAC/C,SAAS;GAUT,SAAS,EAAE,GAAG,OAAO,QAAQ,IAAI;GACjC,cAAc;GACd,cAAc;GACd,OAAO;EACT;EACA,MAAM;GACJ,KAAK,aAAa,OAAO,UAAU;GACnC,WAAW,OAAO,WAAW;GAC7B,YAAY,OAAO,WAAW;GAC9B,kBAAkB,OAAO,WAAW,aAAa;GACjD,YAAY,OAAO,WAAW,UAAU;GACxC,aAAa,OAAO,WAAW,cAAc;GAC7C,QAAQ,KAAK,MAAM,OAAO,SAAS,GAAI;EACzC;EACA,WAAW;GACT,YAAY;GACZ,SAAS;GACT,gBAAgB,OAAO,WAAW,SAAS,OAAO,SAAS,YAAY;EACzE;EACA,YAAY;GACV,aAAa;GACb,SAAS;GACT,GAAI,OAAO,WAAW,KAAA,IAAY,EAAE,QAAQ,EAAE,GAAG,OAAO,OAAO,EAAE,IAAI,CAAC;GACtE,GAAI,aAAa,KAAA,IAAY,EAAE,UAAU,CAAC,GAAG,QAAQ,EAAE,IAAI,CAAC;GAC5D,GAAI,kBAAkB,EAAE,kBAAkB,KAAK,IAAI,CAAC;GACpD,GAAI,QAAQ,KAAA,IAAY,EAAE,IAAI,IAAI,CAAC;EACrC;CACF,GACA,+BAA+B,OAAO,OACxC;AACF;;;;;;;AAQA,eAAsB,gBACpB,SACA,OACA,UAA8B,CAAC,GACH;CAC5B,MAAM,QAAQ,QAAQ,WAAW,MAAM;CACvC,MAAM,cAAc,QAAQ,MAAM,qBAAK,IAAI,KAAK,EAAA,CAAG,YAAY;CAC/D,IACE,QAAQ,aAAa,KAAA,MACpB,CAAC,OAAO,cAAc,QAAQ,QAAQ,KAAK,QAAQ,WAAW,IAE/D,MAAM,IAAI,gBAAgB,qCAAqC;CAEjE,MAAM,OAA4B,CAAC;CACnC,MAAM,gBAA0B,CAAC;CACjC,KAAK,MAAM,UAAU,SAAS;EAC5B,MAAM,aAAa,MAAM,gBAAgB,OAAO,OAAO,KAAK;EAC5D,MAAM,WAAW,QAAQ,aAAa,MAAM,QAAQ,WAAW,OAAO,KAAK,IAAI,KAAA;EAC/E,MAAM,WAAW,QAAQ,aAAa,MAAM,QAAQ,WAAW,OAAO,KAAK,IAAI,KAAA;EAC/E,IAAI,aAAa,KAAA,KAAa,UAAU,UAAU,OAAO,OACvD,MAAM,IAAI,gBACR,+BAA+B,OAAO,MAAM,0CAC9C;EAEF,IACE,QAAQ,eACP,CAAC,YAAY,CAAC,MAAM,QAAQ,SAAS,QAAQ,KAAK,SAAS,SAAS,WAAW,IAEhF,MAAM,IAAI,gBACR,+BAA+B,OAAO,MAAM,uCAC9C;EAEF,IACE,UAAU,SAAS,MAChB,YACC,CAAC,WACD,CAAC,MAAM,QAAQ,QAAQ,gBAAgB,KACvC,CAAC,MAAM,QAAQ,QAAQ,UAAU,KACjC,CAAC,MAAM,QAAQ,QAAQ,cAAc,CACzC,GAEA,MAAM,IAAI,gBACR,+BAA+B,OAAO,MAAM,sCAC9C;EAEF,MAAM,WAAW,UAAU,SAAS,KAAK,aAAa;GACpD,GAAG;GACH,kBAAkB,CAAC,GAAG,QAAQ,gBAAgB;GAC9C,YAAY,CAAC,GAAG,QAAQ,UAAU;GAClC,gBAAgB,QAAQ,eAAe,IAAI,KAAK;EAClD,EAAE;EACF,IAAI,QAAQ,eAAe,CAAC,MAAM,QAAQ,QAAQ,KAAK,SAAS,WAAW,IACzE,MAAM,IAAI,gBACR,+BAA+B,OAAO,MAAM,0BAC9C;EAEF,MAAM,UAAU,MAAM,qBAAqB,QAAQ,OAAO;EAC1D,IAAI,WAAW,MAAM,WAAW,KAAK,CAAC,QAAQ,YAAY;GACxD,cAAc,KAAK,OAAO,KAAK;GAC/B,KAAK,KACH,SACE,QACA,SACA,CAAC,GACD,CAAC,GACD,SACA,YACA,0CACA,QACF,CACF;GACA;EACF;EACA,IAAI,QAAQ,WAAW,MAAM,KAAK,MAAM,YAAY,EAAE,MAAM,KAAK,CAAC;EAClE,MAAM,eACJ,QAAQ,aAAa,KAAA,KAAa,MAAM,SAAS,QAAQ,WACrD,MAAM,SAAS,QAAQ,WACvB;EACN,IAAI,QAAQ,aAAa,KAAA,KAAa,eAAe,GAAG;GAGtD,MAAM,OAAO,KAAK,KAAK,QAAQ,WAAW,CAAC;GAC3C,MAAM,OAAO,QAAQ,WAAW;GAChC,QAAQ,CAAC,GAAG,MAAM,MAAM,GAAG,IAAI,GAAG,GAAG,MAAM,MAAM,MAAM,SAAS,IAAI,CAAC;EACvE;EACA,MAAM,QAAQ,WAAW,MAAM,KAAK,MAAM,EAAE,IAAI;EAChD,MAAM,WAAW,YAAY,kBAAkB,KAAK;EACpD,mBAAmB,UAAU,OAAO,KAAK;EACzC,MAAM,eAAe,SAAS,KAAK,YAAY,eAAe,SAAS,KAAK,CAAC;EAE7E,mBACE,aAAa,QAAQ,YAAY,QAAQ,sBAAsB,IAAI,GACnE,OAAO,KACT;EACA,MAAM,OAAiB,CAAC;EACxB,IAAI,aAAa,WAAW,GAAG,KAAK,KAAK,mDAAmD;OACvF,IAAI,CAAC,QAAQ,YAChB,KAAK,KAAK,8EAA8E;EAE1F,IAAI,eAAe,GAAG,KAAK,KAAK,GAAG,aAAa,wCAAwC;EACxF,KAAK,MAAM,WAAW,YAAY,CAAC,GACjC,IAAI,QAAQ,eAAe,SAAS,GAClC,KAAK,KAAK,oBAAoB,QAAQ,QAAQ,IAAI,QAAQ,eAAe,KAAK,IAAI,GAAG;EAGzF,KAAK,KACH,SACE,QACA,SACA,OACA,cACA,SACA,YACA,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,IAAI,KAAA,GACpC,UACC,aAAa,SAAS,KAAK,CAAC,QAAQ,cACnC,eAAe,MACd,UAAU,MAAM,YAAY,QAAQ,eAAe,SAAS,CAAC,KAAK,MACvE,CACF;CACF;CACA,OAAO;EAAE;EAAM;CAAc;AAC/B"}
+{"version":3,"file":"mint-zszyYlpA.js","names":[],"sources":["../src/rollout/mint.ts"],"sourcesContent":["/**\n * Rollout minting — `tangle.rollout.v1` lines joined from the records the\n * substrate ALREADY keeps. There is no separate rollout store: a rollout\n * is the JOIN of a RunRecord (identity, provenance, cost, outcome) with\n * its trace (spans share `runId`), projected into the canonical line.\n *\n * Composition, not duplication:\n *   - identity/provenance     → `RunRecord` (candidateId, splitTag, agentProfile, hashes)\n *   - step structure          → `buildTrajectory` over the shared TraceStore\n *   - preference-pair export  → `feedbackTrajectoryToOptimizerRow` (feedback-trajectory.ts)\n *   - PRM / reward-model      → `reward-model-export.ts`\n *   - search lineage          → `searchLineage`, read from the run's search ledger\n *\n * Anti-Goodhart invariant: a run whose `outcome.realness.gated` is true is\n * never exported with a positive reward OR with any of the numbers that reward\n * was computed from. The gate travels into the training data (`reward` forced\n * to 0, `realness_gated: true`) and the whole outcome is transformed by\n * `gateGamedOutcome` inside `assertMinted` below, which relocates `metrics` and\n * `verdict` to `provenance.gated_evidence`. Mint returns\n * `MintedRolloutLine[]`: the brand the training exporters require, which only\n * this function, `readRolloutLedger`, and an explicit `assertMinted` can mint.\n *\n * A record carrying NEITHER split score is REJECTED (`ValidationError`), never\n * minted at 0 — \"nobody graded this\" is not the same claim as \"graded a total\n * failure\", and a trainer reading 0 learns the second. Lines that already\n * carry `reward: null` (interchange imports, existing ledgers) remain valid on\n * the wire; only the RunRecord→line door refuses.\n *\n * Records without spans or an explicit full capture become labeled GAP LINES (messages: [],\n * provenance.gap) — present in the output AND surfaced in\n * `missingTraces`; a capture gap is a finding, never a silent omission.\n */\n\nimport { ValidationError } from '../errors'\nimport { type RunRecord, type RunSearchCoordinates, runTaskScore } from '../run-record'\nimport type { LlmSpan, Span, ToolSpan } from '../trace/schema'\nimport type { TraceStore } from '../trace/store'\nimport { buildTrajectory } from '../trajectory'\nimport { rolloutRewardFields, scoreOrigin } from './reward'\nimport {\n  assertMinted,\n  type ChatMessage,\n  type MintedRolloutLine,\n  ROLLOUT_SCHEMA,\n  type RolloutEvidenceAttempt,\n  type RolloutRole,\n  type RolloutSplit,\n  type RolloutStep,\n} from './schema'\n\n/** Redactor for transcript/step payload text (secrets, PII), not opaque identity. */\nexport type RolloutScrubber = (text: string) => string\n\n/** A search cell's place in its search tree, read from the search ledger. */\nexport interface RolloutSearchLineage {\n  /** Edges between the cell's node and the search root; the root is 0. */\n  depth: number\n  /** Order in which the node registered in its search; the root is 0. */\n  ordinal: number\n  /** Repeat index of the cell on its task, from 0. */\n  rep: number\n  /** Run id of the cell whose execution contains this search; null for a\n   *  top-level search. */\n  containingRunId: string | null\n}\n\nexport interface MintRolloutOptions {\n  scrub?: RolloutScrubber\n  /**\n   * Full canonical capture, including turns no longer in the model's context.\n   * When supplied, missing/empty capture is refused, never replaced with a\n   * span summary. Use the execution owner's capture or the existing harness\n   * readers; reviewer traces and compacted histories are not full capture.\n   */\n  messagesOf?: (\n    runId: string,\n  ) => readonly ChatMessage[] | undefined | Promise<readonly ChatMessage[] | undefined>\n  /** Provider attempts from a retained receipt bound to the exact run. */\n  evidenceOf?: (\n    runId: string,\n  ) =>\n    | { runId: string; attempts: readonly RolloutEvidenceAttempt[] }\n    | undefined\n    | Promise<{ runId: string; attempts: readonly RolloutEvidenceAttempt[] } | undefined>\n  /** Cap steps per line (longest runs first drop middle steps). Default: no cap. */\n  maxSteps?: number\n  /** Role recorded on every minted line. Default 'agent' (a solo eval run). */\n  role?: RolloutRole\n  /** Task suite label. Default: the record's `experimentId`. */\n  suite?: string\n  /** Injected clock for deterministic output. */\n  now?: () => Date\n  /**\n   * Lineage of a search run, read from its search ledger. It fills the line's\n   * `generation` (node depth), `candidate_index` (node order), `task.rep` and\n   * `parent_rollout_id` (the containing cell's run). Mint refuses a record\n   * that carries `search` when this is absent, because a null `generation`\n   * states that the run is not part of a search.\n   */\n  searchLineage?: (\n    search: RunSearchCoordinates,\n  ) => RolloutSearchLineage | Promise<RolloutSearchLineage>\n}\n\nexport interface MintRolloutResult {\n  rows: MintedRolloutLine[]\n  /** runIds that had a RunRecord but no spans — emitted as gap lines AND listed here. */\n  missingTraces: string[]\n}\n\nconst asText = (v: unknown, scrub: RolloutScrubber): string => {\n  const s = typeof v === 'string' ? v : JSON.stringify(v)\n  return scrub(s ?? '')\n}\n\nfunction projectStep(span: Span, scrub: RolloutScrubber): RolloutStep {\n  const base: RolloutStep = {\n    kind: span.kind,\n    name: scrub(span.name),\n    status: span.status,\n    durationMs: span.endedAt !== undefined ? span.endedAt - span.startedAt : undefined,\n  }\n  if (span.kind === 'llm') {\n    const llm = span as LlmSpan\n    const last = llm.messages[llm.messages.length - 1]\n    if (last && last.content !== null) base.input = scrub(last.content)\n    if (llm.output !== undefined) base.output = scrub(llm.output)\n  } else if (span.kind === 'tool') {\n    const tool = span as ToolSpan\n    base.input = asText(tool.args, scrub)\n    if (tool.result !== undefined) base.output = asText(tool.result, scrub)\n  }\n  return base\n}\n\n/** Preserve captured fields; invocation ids are opaque linkage, not generated text. */\nfunction projectMessage(message: ChatMessage, scrub: RolloutScrubber): ChatMessage {\n  return {\n    role: message.role,\n    content: message.content === null ? null : scrub(message.content),\n    ...(message.reasoning_content !== undefined\n      ? { reasoning_content: scrub(message.reasoning_content) }\n      : {}),\n    ...(message.tool_calls !== undefined\n      ? {\n          tool_calls: message.tool_calls.map((call) => ({\n            id: call.id,\n            type: call.type,\n            function: {\n              name: call.function.name,\n              arguments: scrub(call.function.arguments),\n            },\n          })),\n        }\n      : {}),\n    ...(message.tool_call_id !== undefined ? { tool_call_id: message.tool_call_id } : {}),\n    ...(message.name !== undefined ? { name: message.name } : {}),\n    ...(message.is_copied_context !== undefined\n      ? { is_copied_context: message.is_copied_context }\n      : {}),\n  }\n}\n\n/** Never recover missing calls from tool names, span order or argument summaries. */\nfunction requireToolLinkage(messages: readonly ChatMessage[], runId: string): void {\n  const seen = new Set<string>()\n  const pending = new Map<string, string>()\n  const refuse: (detail: string) => never = (detail) => {\n    throw new ValidationError(`Cannot mint rollout for run ${runId}: ${detail}`)\n  }\n  for (const message of messages) {\n    if (message.tool_calls !== undefined) {\n      if (message.role !== 'assistant' || !Array.isArray(message.tool_calls)) {\n        refuse('tool calls must be captured on an assistant message')\n      }\n      if (pending.size > 0) refuse('new tool calls precede the prior invocation results')\n      for (const call of message.tool_calls) {\n        if (\n          !call ||\n          typeof call.id !== 'string' ||\n          call.id.length === 0 ||\n          seen.has(call.id) ||\n          call.type !== 'function' ||\n          !call.function ||\n          typeof call.function.name !== 'string' ||\n          call.function.name.length === 0 ||\n          typeof call.function.arguments !== 'string'\n        ) {\n          refuse('missing, duplicate or malformed tool invocation')\n        }\n        seen.add(call.id)\n        pending.set(call.id, call.function.name)\n      }\n    }\n    if (message.role === 'tool') {\n      const id = message.tool_call_id\n      if (typeof id !== 'string' || !pending.has(id)) {\n        refuse('tool result has no captured invocation (or answers it more than once)')\n      }\n      if (message.name !== undefined && message.name !== pending.get(id)) {\n        refuse('tool result name does not match its invocation')\n      }\n      pending.delete(id)\n    } else if (message.tool_call_id !== undefined) {\n      refuse('tool_call_id is only valid on a tool result')\n    } else if (pending.size > 0 && message.tool_calls === undefined) {\n      refuse('conversation advances before all tool results were captured')\n    }\n  }\n  if (pending.size > 0) refuse('tool invocation has no captured result')\n}\n\n/** Legacy span history; callers with compacted contexts supply messagesOf instead. */\nfunction finalConversation(spans: Span[]): ChatMessage[] {\n  const llms = spans.filter((s): s is LlmSpan => s.kind === 'llm')\n  const last = llms[llms.length - 1]\n  if (!last) return []\n  const messages: ChatMessage[] = [...last.messages]\n  if (last.output !== undefined && last.output !== '') {\n    messages.push({ role: 'assistant', content: last.output })\n  }\n  return messages\n}\n\n// The reward derivations live in the leaf module `./reward` so gate and\n// reporting code can import them without dragging in the trace store; they are\n// re-exported here because the derivations shipped from this path.\nexport {\n  isRealnessGated,\n  observedScore,\n  observedSplitScore,\n  type ScoreOrigin,\n  type ScorePreference,\n  scoreOrigin,\n  trainingReward,\n  trainingScore,\n} from './reward'\n\nconst REWARD_SOURCE: Record<ReturnType<typeof scoreOrigin>, string> = {\n  holdout: 'run-record/holdout-score',\n  search: 'run-record/search-score',\n  unscored: 'run-record/unscored',\n}\n\n/**\n * The mint door refuses an execution-only record: a missing training label is\n * not a zero reward, and not a mintable line either. Lines that already carry\n * `reward: null` — interchange imports, existing ledgers — stay valid on the\n * wire and keep their labeled gap; this guard is only about the\n * RunRecord→line door, where the producer can still be told to go score the\n * run instead of shipping an unlabeled row.\n */\nfunction requireTaskScore(record: RunRecord): void {\n  if (runTaskScore(record) === undefined) {\n    throw new ValidationError(`Cannot mint rollout for run ${record.runId}: task score is missing`)\n  }\n}\n\nconst isObject = (value: unknown): value is Record<string, unknown> =>\n  typeof value === 'object' && value !== null\n\ninterface MintFieldCheck {\n  /** The RunRecord path, spelled the way the caller has to fix it. */\n  readonly field: string\n  /** True when the record carries something the line can honestly be built from. */\n  readonly present: (bag: Record<string, unknown>) => boolean\n  /** What the caller writes onto the record, and why that value and not another. */\n  readonly remedy: string\n}\n\n/**\n * The RunRecord fields mint reads that a record can be missing even though the\n * TYPE says it cannot. There are exactly two ways that happens:\n *\n *   1. The field was OPTIONAL when the record was serialized. `costProvenance`,\n *      `terminalOutcome` and `scenarioId` were optional through agent-eval\n *      0.125 and became required in 0.126, with no on-disk migration — so every\n *      ledger written before 0.126 is full of records the type calls complete.\n *   2. Mint reads a level DEEPER than the record's own type is checked at:\n *      `outcome.raw`, `tokenUsage.input`, `tokenUsage.output`.\n *\n * Nothing else needs a check here. Every other field mint copies is a top-level\n * scalar landing in a typed slot on the line, where an absent value arrives as\n * `undefined` and `assertMinted` refuses it by name. These are the ones where an\n * absent value instead kills the join with `TypeError: Cannot read properties of\n * undefined`, or — worse — mints a line that reads as measured.\n *\n * This is deliberately NOT `validateRunRecord`. That validator answers \"is this\n * a valid RunRecord\", which is a wider question than \"can a rollout line be\n * built from this one\": it also enforces model-snapshot discipline, the\n * `terminalFailureReason` coupling, and the `costUsd === costProvenance.usd`\n * agreement. Routing the mint door through it would refuse records mint can\n * mint honestly today (a model alias with no snapshot date, for one), which is\n * a policy change with its own blast radius and not this bug. The door asks the\n * narrower question and answers it precisely.\n */\nconst MINT_FIELD_CHECKS: readonly MintFieldCheck[] = [\n  {\n    field: 'costProvenance',\n    present: (bag) => isObject(bag.costProvenance) && typeof bag.costProvenance.kind === 'string',\n    remedy:\n      \"Records written before agent-eval 0.126 predate this field and carry `costUsd: 0` as the documented uncaptured sentinel, which is NOT an observed zero. Backfill it as costProvenance: { kind: 'uncaptured', usd: null } WITH costUsd: null — an uncaptured cost whose costUsd is non-null is rejected by validateRunRecord, so provenance alone leaves the record invalid.\",\n  },\n  {\n    field: 'tokenUsage',\n    present: (bag) => isObject(bag.tokenUsage),\n    remedy:\n      \"The line's cost.tokens_in and cost.tokens_out are read from it. Backfill it from the provider's usage report; mint will not write 0 for tokens nobody counted.\",\n  },\n  {\n    field: 'tokenUsage.input',\n    present: (bag) => !isObject(bag.tokenUsage) || typeof bag.tokenUsage.input === 'number',\n    remedy: \"The line's cost.tokens_in is read from it, and a missing count is not a zero count.\",\n  },\n  {\n    field: 'tokenUsage.output',\n    present: (bag) => !isObject(bag.tokenUsage) || typeof bag.tokenUsage.output === 'number',\n    remedy: \"The line's cost.tokens_out is read from it, and a missing count is not a zero count.\",\n  },\n  {\n    field: 'outcome',\n    present: (bag) => isObject(bag.outcome),\n    remedy:\n      \"The line's reward, reward_source and metrics are all read from it. A record with no outcome carries no training label at all, and mint refuses an unlabeled row.\",\n  },\n  {\n    field: 'outcome.raw',\n    // Reported only when `outcome` itself is present: one absent field should\n    // produce one reason per CAUSE, not one per path that dereferences it.\n    present: (bag) => !isObject(bag.outcome) || isObject(bag.outcome.raw),\n    remedy:\n      'It is the metric bag copied verbatim into the line\\'s outcome.metrics. `{ ...undefined }` spreads to `{}` without complaint, so an absent bag would mint as \"this run reported no metrics\" — a different claim from \"this record predates the field\". Backfill it as {} only when that is what you mean.',\n  },\n  {\n    field: 'terminalOutcome',\n    present: (bag) => typeof bag.terminalOutcome === 'string',\n    remedy:\n      \"It became required in agent-eval 0.126. Backfill it from root-run or process evidence, or as 'unknown' when the producer has none — mint will not decide the line's is_completed and is_truncated for you.\",\n  },\n  {\n    field: 'scenarioId',\n    present: (bag) => typeof bag.scenarioId === 'string' && bag.scenarioId.length > 0,\n    remedy:\n      \"It became required in agent-eval 0.126 and becomes the line's task.instance_id, which must be a non-empty string. Backfill it from the scenario the run was dealt (pre-0.126 producers often left it in outcome.raw.scenario_id).\",\n  },\n]\n\n/**\n * Why a record cannot be minted, one entry per missing field, empty when it can.\n *\n * Exported so a caller can partition a whole ledger — \"which of my 2742 records\n * predate 0.126\" — without catching an exception per record, and without\n * re-deriving the field list on their side. A re-derived list is a list that\n * drifts from the door it is supposed to predict.\n *\n * Takes a `RunRecord` because that is what the caller holds and what the\n * compiler agrees they hold. The type is precisely the thing that is wrong, so\n * the checks read the record as the untyped bag it actually is on disk.\n */\nexport function unmintableReasons(record: RunRecord): string[] {\n  const bag = record as unknown as Record<string, unknown>\n  return MINT_FIELD_CHECKS.filter((check) => !check.present(bag)).map(\n    (check) => `${check.field} is missing. ${check.remedy}`,\n  )\n}\n\n/**\n * The mint door THROWS on a record it cannot build a line from. It does NOT\n * normalise an absent `costProvenance` to `{kind:'uncaptured', usd:null}`, and\n * the choice is not stylistic:\n *\n *   - Normalising cannot cover the record, only part of it. `terminalOutcome`\n *     feeds `is_completed` and `is_truncated`, which the rollout schema requires\n *     to be BOOLEAN — there is no null to fall back to, so every possible\n *     default is a claim about how the run ended. A door that quietly fixes the\n *     cost and invents the ending is a door no caller can predict.\n *   - Normalising the cost requires knowing what `costUsd: 0` meant, and mint\n *     cannot know. A genuinely free run and an uncaptured one are the same bytes\n *     in a pre-0.126 record; only the producer can tell them apart. Guessing is\n *     exactly the failure this guard exists to stop — the 0.125 optional chain\n *     `record.costProvenance?.kind === 'uncaptured'` already made that guess,\n *     silently, and every record it touched minted `cost.usd: 0`: an unmeasured\n *     cost published as a measured zero, into a training dataset.\n *   - `requireTaskScore`, directly above, already refuses an unlabeled record\n *     for the same reason: \"nobody graded this\" is not \"graded zero\". \"Nobody\n *     billed this\" is not \"billed zero\".\n *\n * The caller who wants historical records minted backfills them at their store,\n * in one pass, where `costUsd` can be corrected alongside `costProvenance` —\n * which is the only place that decision can be made correctly. The refusal names\n * the run, names every missing field, and spells the value to write.\n */\nfunction requireMintableRecord(record: RunRecord): void {\n  const reasons = unmintableReasons(record)\n  if (reasons.length === 0) return\n  throw new ValidationError(`Cannot mint rollout for run ${record.runId}: ${reasons.join('\\n  ')}`)\n}\n\n/** The search lineage a record's line is built from; undefined for a record outside a search. */\nasync function resolveSearchLineage(\n  record: RunRecord,\n  options: MintRolloutOptions,\n): Promise<RolloutSearchLineage | undefined> {\n  if (record.search === undefined) return undefined\n  const refuse: (detail: string) => never = (detail) => {\n    throw new ValidationError(`Cannot mint rollout for search run ${record.runId}: ${detail}`)\n  }\n  if (!options.searchLineage) {\n    refuse('pass searchLineage so generation, candidate_index, rep and parent come from its ledger')\n  }\n  const lineage = await options.searchLineage(record.search)\n  const isCount = (value: unknown): boolean => Number.isSafeInteger(value) && (value as number) >= 0\n  if (!isCount(lineage.depth)) refuse('lineage depth must be a non-negative integer')\n  if (!isCount(lineage.ordinal)) refuse('lineage ordinal must be a non-negative integer')\n  if (!isCount(lineage.rep)) refuse('lineage rep must be a non-negative integer')\n  if (\n    lineage.containingRunId !== null &&\n    (typeof lineage.containingRunId !== 'string' || lineage.containingRunId.length === 0)\n  ) {\n    refuse('lineage containingRunId must be null or a non-empty run id')\n  }\n  if (lineage.containingRunId === record.runId) refuse('a run cannot contain itself')\n  return lineage\n}\n\nconst SPLIT_FROM_TAG: Record<RunRecord['splitTag'], RolloutSplit> = {\n  search: 'search',\n  dev: 'dev',\n  holdout: 'holdout',\n}\n\nfunction mintLine(\n  record: RunRecord,\n  lineage: RolloutSearchLineage | undefined,\n  steps: RolloutStep[],\n  messages: ChatMessage[],\n  options: MintRolloutOptions,\n  capturedAt: string,\n  gap?: string,\n  attempts?: readonly RolloutEvidenceAttempt[],\n  lossyProjection = false,\n): MintedRolloutLine {\n  // Field presence first, and BEFORE `requireTaskScore`: that guard reads\n  // `record.outcome.searchScore` on its way to the answer, so an absent\n  // `outcome` would throw a bare TypeError from inside the guard whose whole\n  // job is to produce a clean refusal.\n  //\n  // Both branches of `mintRolloutRows` — the traced line and the gap line —\n  // land here, which is the point: `mintLine` is the only constructor of a\n  // `MintedRolloutLine` from a RunRecord, so there is no path into the waist\n  // that skips the check and no way to get this wrong from the outside.\n  requireMintableRecord(record)\n  // A missing task score is refused before anything is built: an\n  // execution-only record has no training label, and a missing label is\n  // neither a zero reward nor a mintable row.\n  requireTaskScore(record)\n  // `reward` and `realness_gated` come out of one call, so neither door into\n  // the waist can write one and forget the other.\n  const rewardFields = rolloutRewardFields(record)\n  // Only an observed or estimated amount is a total; a lower bound is not.\n  const knownTotal =\n    record.costProvenance.kind === 'observed' || record.costProvenance.kind === 'estimated'\n  const terminalOutcome = record.terminalOutcome\n  const isCompleted = terminalOutcome === 'succeeded' || terminalOutcome === 'failed'\n  const isTruncated = terminalOutcome === 'cancelled' || terminalOutcome === 'incomplete'\n  const terminalError =\n    terminalOutcome === 'failed' ||\n    terminalOutcome === 'cancelled' ||\n    terminalOutcome === 'incomplete'\n      ? (record.terminalFailureReason ?? `run ended ${terminalOutcome}`)\n      : null\n  // `assertMinted` rather than a cast: mint is the producer the whole gate\n  // rests on, so it proves the line it just built is valid instead of asserting\n  // it by fiat. The brand is unforgeable precisely because nobody casts to it.\n  return assertMinted(\n    {\n      schema: ROLLOUT_SCHEMA,\n      rollout_id: record.runId,\n      parent_rollout_id: lineage?.containingRunId ?? null,\n      run_id: record.runId,\n      experiment_id: record.experimentId,\n      candidate_id: record.candidateId,\n      generation: lineage?.depth ?? null,\n      candidate_index: lineage?.ordinal ?? null,\n      role: options.role ?? 'agent',\n      task: {\n        suite: options.suite ?? record.experimentId,\n        instance_id: record.scenarioId,\n        split: SPLIT_FROM_TAG[record.splitTag],\n        seed: record.seed,\n        rep: lineage?.rep ?? 0,\n      },\n      policy: {\n        harness: null,\n        harness_version: null,\n        model: record.model,\n        provider: null,\n        profile_commit: record.commitSha,\n        prompt_hash: record.promptHash,\n        config_hash: record.configHash,\n        agent_profile_cell_id: record.agentProfile?.cellId ?? null,\n        sampling: null,\n      },\n      messages,\n      tool_defs: [],\n      ...(steps.length > 0 ? { steps } : {}),\n      outcome: {\n        ...rewardFields,\n        reward_source: REWARD_SOURCE[scoreOrigin(record)],\n        verdict: null,\n        // A verbatim bulk copy, deliberately UNFILTERED here. `outcome.raw`\n        // holds the per-layer verifier scores (`layer.*`) that the reward was\n        // derived from, so on a gated run this dict is the reward signal in\n        // component form — but filtering it at this call site is the pattern\n        // that has now leaked twice, because the next producer to write a\n        // reward-bearing field forgets. The gate is applied to the whole\n        // outcome once, in `assertMinted` below (`gateGamedOutcome`), which\n        // moves the block to `provenance.gated_evidence` when the run is gated\n        // and leaves it here untouched when it is not.\n        metrics: { ...record.outcome.raw },\n        is_completed: isCompleted,\n        is_truncated: isTruncated,\n        error: terminalError,\n      },\n      cost: {\n        usd: knownTotal ? record.costUsd : null,\n        tokens_in: record.tokenUsage.input,\n        tokens_out: record.tokenUsage.output,\n        tokens_reasoning: record.tokenUsage.reasoning ?? null,\n        cache_read: record.tokenUsage.cached ?? null,\n        cache_write: record.tokenUsage.cacheWrite ?? null,\n        wall_s: Math.round(record.wallMs / 1000),\n      },\n      artifacts: {\n        patch_path: null,\n        run_dir: null,\n        transcript_ref: record.traceRef ? `trace:${record.traceRef.traceId}` : null,\n      },\n      provenance: {\n        captured_at: capturedAt,\n        capture: 'mint',\n        ...(record.search !== undefined ? { search: { ...record.search } } : {}),\n        ...(attempts !== undefined ? { attempts: [...attempts] } : {}),\n        ...(lossyProjection ? { lossy_projection: true } : {}),\n        ...(gap !== undefined ? { gap } : {}),\n      },\n    },\n    `minted rollout line for run ${record.runId}`,\n  )\n}\n\n/**\n * Join RunRecords with their traces into canonical rollout lines. Records\n * without spans or an explicit capture are emitted as labeled gap lines and reported in\n * `missingTraces`. Execution-only records without a task score are rejected\n * because a missing training label is not a zero reward.\n */\nexport async function mintRolloutRows(\n  records: RunRecord[],\n  store: TraceStore,\n  options: MintRolloutOptions = {},\n): Promise<MintRolloutResult> {\n  const scrub = options.scrub ?? ((t) => t)\n  const capturedAt = (options.now?.() ?? new Date()).toISOString()\n  if (\n    options.maxSteps !== undefined &&\n    (!Number.isSafeInteger(options.maxSteps) || options.maxSteps < 1)\n  ) {\n    throw new ValidationError('maxSteps must be a positive integer')\n  }\n  const rows: MintedRolloutLine[] = []\n  const missingTraces: string[] = []\n  for (const record of records) {\n    const trajectory = await buildTrajectory(store, record.runId)\n    const captured = options.messagesOf ? await options.messagesOf(record.runId) : undefined\n    const evidence = options.evidenceOf ? await options.evidenceOf(record.runId) : undefined\n    if (evidence !== undefined && evidence?.runId !== record.runId) {\n      throw new ValidationError(\n        `Cannot mint rollout for run ${record.runId}: capture evidence belongs to another run`,\n      )\n    }\n    if (\n      options.evidenceOf &&\n      (!evidence || !Array.isArray(evidence.attempts) || evidence.attempts.length === 0)\n    ) {\n      throw new ValidationError(\n        `Cannot mint rollout for run ${record.runId}: provider attempt evidence is missing`,\n      )\n    }\n    if (\n      evidence?.attempts.some(\n        (attempt) =>\n          !attempt ||\n          !Array.isArray(attempt.nativeSessionIds) ||\n          !Array.isArray(attempt.processIds) ||\n          !Array.isArray(attempt.missingReasons),\n      )\n    ) {\n      throw new ValidationError(\n        `Cannot mint rollout for run ${record.runId}: malformed provider attempt evidence`,\n      )\n    }\n    const attempts = evidence?.attempts.map((attempt) => ({\n      ...attempt,\n      nativeSessionIds: [...attempt.nativeSessionIds],\n      processIds: [...attempt.processIds],\n      missingReasons: attempt.missingReasons.map(scrub),\n    }))\n    if (options.messagesOf && (!Array.isArray(captured) || captured.length === 0)) {\n      throw new ValidationError(\n        `Cannot mint rollout for run ${record.runId}: full capture is missing`,\n      )\n    }\n    const lineage = await resolveSearchLineage(record, options)\n    if (trajectory.steps.length === 0 && !options.messagesOf) {\n      missingTraces.push(record.runId)\n      rows.push(\n        mintLine(\n          record,\n          lineage,\n          [],\n          [],\n          options,\n          capturedAt,\n          'no trace spans recorded for this runId',\n          attempts,\n        ),\n      )\n      continue\n    }\n    let steps = trajectory.steps.map((s) => projectStep(s.span, scrub))\n    const omittedSteps =\n      options.maxSteps !== undefined && steps.length > options.maxSteps\n        ? steps.length - options.maxSteps\n        : 0\n    if (options.maxSteps !== undefined && omittedSteps > 0) {\n      // Keep the head and tail — the middle of a long run is the least\n      // informative for outcome attribution.\n      const head = Math.ceil(options.maxSteps / 2)\n      const tail = options.maxSteps - head\n      steps = [...steps.slice(0, head), ...steps.slice(steps.length - tail)]\n    }\n    const spans = trajectory.steps.map((s) => s.span)\n    const messages = captured ?? finalConversation(spans)\n    requireToolLinkage(messages, record.runId)\n    const conversation = messages.map((message) => projectMessage(message, scrub))\n    // SFT drops copied context. That projection must not orphan a retained result.\n    requireToolLinkage(\n      conversation.filter((message) => message.is_copied_context !== true),\n      record.runId,\n    )\n    const gaps: string[] = []\n    if (conversation.length === 0) gaps.push('trace has no llm spans; no conversation to inline')\n    else if (!options.messagesOf) {\n      gaps.push('messages project only the last LLM context; full transcript was not captured')\n    }\n    if (omittedSteps > 0) gaps.push(`${omittedSteps} middle trace steps omitted by maxSteps`)\n    for (const attempt of attempts ?? []) {\n      if (attempt.missingReasons.length > 0) {\n        gaps.push(`provider attempt ${attempt.ordinal}: ${attempt.missingReasons.join(', ')}`)\n      }\n    }\n    rows.push(\n      mintLine(\n        record,\n        lineage,\n        steps,\n        conversation,\n        options,\n        capturedAt,\n        gaps.length > 0 ? gaps.join('; ') : undefined,\n        attempts,\n        (conversation.length > 0 && !options.messagesOf) ||\n          omittedSteps > 0 ||\n          (attempts?.some((attempt) => attempt.missingReasons.length > 0) ?? false),\n      ),\n    )\n  }\n  return { rows, missingTraces }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8GA,MAAM,UAAU,GAAY,UAAmC;CAE7D,OAAO,OADG,OAAO,MAAM,WAAW,IAAI,KAAK,UAAU,CAAC,MACpC,EAAE;AACtB;AAEA,SAAS,YAAY,MAAY,OAAqC;CACpE,MAAM,OAAoB;EACxB,MAAM,KAAK;EACX,MAAM,MAAM,KAAK,IAAI;EACrB,QAAQ,KAAK;EACb,YAAY,KAAK,YAAY,KAAA,IAAY,KAAK,UAAU,KAAK,YAAY,KAAA;CAC3E;CACA,IAAI,KAAK,SAAS,OAAO;EACvB,MAAM,MAAM;EACZ,MAAM,OAAO,IAAI,SAAS,IAAI,SAAS,SAAS;EAChD,IAAI,QAAQ,KAAK,YAAY,MAAM,KAAK,QAAQ,MAAM,KAAK,OAAO;EAClE,IAAI,IAAI,WAAW,KAAA,GAAW,KAAK,SAAS,MAAM,IAAI,MAAM;CAC9D,OAAO,IAAI,KAAK,SAAS,QAAQ;EAC/B,MAAM,OAAO;EACb,KAAK,QAAQ,OAAO,KAAK,MAAM,KAAK;EACpC,IAAI,KAAK,WAAW,KAAA,GAAW,KAAK,SAAS,OAAO,KAAK,QAAQ,KAAK;CACxE;CACA,OAAO;AACT;;AAGA,SAAS,eAAe,SAAsB,OAAqC;CACjF,OAAO;EACL,MAAM,QAAQ;EACd,SAAS,QAAQ,YAAY,OAAO,OAAO,MAAM,QAAQ,OAAO;EAChE,GAAI,QAAQ,sBAAsB,KAAA,IAC9B,EAAE,mBAAmB,MAAM,QAAQ,iBAAiB,EAAE,IACtD,CAAC;EACL,GAAI,QAAQ,eAAe,KAAA,IACvB,EACE,YAAY,QAAQ,WAAW,KAAK,UAAU;GAC5C,IAAI,KAAK;GACT,MAAM,KAAK;GACX,UAAU;IACR,MAAM,KAAK,SAAS;IACpB,WAAW,MAAM,KAAK,SAAS,SAAS;GAC1C;EACF,EAAE,EACJ,IACA,CAAC;EACL,GAAI,QAAQ,iBAAiB,KAAA,IAAY,EAAE,cAAc,QAAQ,aAAa,IAAI,CAAC;EACnF,GAAI,QAAQ,SAAS,KAAA,IAAY,EAAE,MAAM,QAAQ,KAAK,IAAI,CAAC;EAC3D,GAAI,QAAQ,sBAAsB,KAAA,IAC9B,EAAE,mBAAmB,QAAQ,kBAAkB,IAC/C,CAAC;CACP;AACF;;AAGA,SAAS,mBAAmB,UAAkC,OAAqB;CACjF,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,0BAAU,IAAI,IAAoB;CACxC,MAAM,UAAqC,WAAW;EACpD,MAAM,IAAI,gBAAgB,+BAA+B,MAAM,IAAI,QAAQ;CAC7E;CACA,KAAK,MAAM,WAAW,UAAU;EAC9B,IAAI,QAAQ,eAAe,KAAA,GAAW;GACpC,IAAI,QAAQ,SAAS,eAAe,CAAC,MAAM,QAAQ,QAAQ,UAAU,GACnE,OAAO,qDAAqD;GAE9D,IAAI,QAAQ,OAAO,GAAG,OAAO,qDAAqD;GAClF,KAAK,MAAM,QAAQ,QAAQ,YAAY;IACrC,IACE,CAAC,QACD,OAAO,KAAK,OAAO,YACnB,KAAK,GAAG,WAAW,KACnB,KAAK,IAAI,KAAK,EAAE,KAChB,KAAK,SAAS,cACd,CAAC,KAAK,YACN,OAAO,KAAK,SAAS,SAAS,YAC9B,KAAK,SAAS,KAAK,WAAW,KAC9B,OAAO,KAAK,SAAS,cAAc,UAEnC,OAAO,iDAAiD;IAE1D,KAAK,IAAI,KAAK,EAAE;IAChB,QAAQ,IAAI,KAAK,IAAI,KAAK,SAAS,IAAI;GACzC;EACF;EACA,IAAI,QAAQ,SAAS,QAAQ;GAC3B,MAAM,KAAK,QAAQ;GACnB,IAAI,OAAO,OAAO,YAAY,CAAC,QAAQ,IAAI,EAAE,GAC3C,OAAO,uEAAuE;GAEhF,IAAI,QAAQ,SAAS,KAAA,KAAa,QAAQ,SAAS,QAAQ,IAAI,EAAE,GAC/D,OAAO,gDAAgD;GAEzD,QAAQ,OAAO,EAAE;EACnB,OAAO,IAAI,QAAQ,iBAAiB,KAAA,GAClC,OAAO,6CAA6C;OAC/C,IAAI,QAAQ,OAAO,KAAK,QAAQ,eAAe,KAAA,GACpD,OAAO,6DAA6D;CAExE;CACA,IAAI,QAAQ,OAAO,GAAG,OAAO,wCAAwC;AACvE;;AAGA,SAAS,kBAAkB,OAA8B;CACvD,MAAM,OAAO,MAAM,QAAQ,MAAoB,EAAE,SAAS,KAAK;CAC/D,MAAM,OAAO,KAAK,KAAK,SAAS;CAChC,IAAI,CAAC,MAAM,OAAO,CAAC;CACnB,MAAM,WAA0B,CAAC,GAAG,KAAK,QAAQ;CACjD,IAAI,KAAK,WAAW,KAAA,KAAa,KAAK,WAAW,IAC/C,SAAS,KAAK;EAAE,MAAM;EAAa,SAAS,KAAK;CAAO,CAAC;CAE3D,OAAO;AACT;AAgBA,MAAM,gBAAgE;CACpE,SAAS;CACT,QAAQ;CACR,UAAU;AACZ;;;;;;;;;AAUA,SAAS,iBAAiB,QAAyB;CACjD,IAAI,aAAa,MAAM,MAAM,KAAA,GAC3B,MAAM,IAAI,gBAAgB,+BAA+B,OAAO,MAAM,wBAAwB;AAElG;AAEA,MAAM,YAAY,UAChB,OAAO,UAAU,YAAY,UAAU;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqCzC,MAAM,oBAA+C;CACnD;EACE,OAAO;EACP,UAAU,QAAQ,SAAS,IAAI,cAAc,KAAK,OAAO,IAAI,eAAe,SAAS;EACrF,QACE;CACJ;CACA;EACE,OAAO;EACP,UAAU,QAAQ,SAAS,IAAI,UAAU;EACzC,QACE;CACJ;CACA;EACE,OAAO;EACP,UAAU,QAAQ,CAAC,SAAS,IAAI,UAAU,KAAK,OAAO,IAAI,WAAW,UAAU;EAC/E,QAAQ;CACV;CACA;EACE,OAAO;EACP,UAAU,QAAQ,CAAC,SAAS,IAAI,UAAU,KAAK,OAAO,IAAI,WAAW,WAAW;EAChF,QAAQ;CACV;CACA;EACE,OAAO;EACP,UAAU,QAAQ,SAAS,IAAI,OAAO;EACtC,QACE;CACJ;CACA;EACE,OAAO;EAGP,UAAU,QAAQ,CAAC,SAAS,IAAI,OAAO,KAAK,SAAS,IAAI,QAAQ,GAAG;EACpE,QACE;CACJ;CACA;EACE,OAAO;EACP,UAAU,QAAQ,OAAO,IAAI,oBAAoB;EACjD,QACE;CACJ;CACA;EACE,OAAO;EACP,UAAU,QAAQ,OAAO,IAAI,eAAe,YAAY,IAAI,WAAW,SAAS;EAChF,QACE;CACJ;AACF;;;;;;;;;;;;;AAcA,SAAgB,kBAAkB,QAA6B;CAC7D,MAAM,MAAM;CACZ,OAAO,kBAAkB,QAAQ,UAAU,CAAC,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAC,KAC7D,UAAU,GAAG,MAAM,MAAM,eAAe,MAAM,QACjD;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA,SAAS,sBAAsB,QAAyB;CACtD,MAAM,UAAU,kBAAkB,MAAM;CACxC,IAAI,QAAQ,WAAW,GAAG;CAC1B,MAAM,IAAI,gBAAgB,+BAA+B,OAAO,MAAM,IAAI,QAAQ,KAAK,MAAM,GAAG;AAClG;;AAGA,eAAe,qBACb,QACA,SAC2C;CAC3C,IAAI,OAAO,WAAW,KAAA,GAAW,OAAO,KAAA;CACxC,MAAM,UAAqC,WAAW;EACpD,MAAM,IAAI,gBAAgB,sCAAsC,OAAO,MAAM,IAAI,QAAQ;CAC3F;CACA,IAAI,CAAC,QAAQ,eACX,OAAO,wFAAwF;CAEjG,MAAM,UAAU,MAAM,QAAQ,cAAc,OAAO,MAAM;CACzD,MAAM,WAAW,UAA4B,OAAO,cAAc,KAAK,KAAM,SAAoB;CACjG,IAAI,CAAC,QAAQ,QAAQ,KAAK,GAAG,OAAO,8CAA8C;CAClF,IAAI,CAAC,QAAQ,QAAQ,OAAO,GAAG,OAAO,gDAAgD;CACtF,IAAI,CAAC,QAAQ,QAAQ,GAAG,GAAG,OAAO,4CAA4C;CAC9E,IACE,QAAQ,oBAAoB,SAC3B,OAAO,QAAQ,oBAAoB,YAAY,QAAQ,gBAAgB,WAAW,IAEnF,OAAO,4DAA4D;CAErE,IAAI,QAAQ,oBAAoB,OAAO,OAAO,OAAO,6BAA6B;CAClF,OAAO;AACT;AAEA,MAAM,iBAA8D;CAClE,QAAQ;CACR,KAAK;CACL,SAAS;AACX;AAEA,SAAS,SACP,QACA,SACA,OACA,UACA,SACA,YACA,KACA,UACA,kBAAkB,OACC;CAUnB,sBAAsB,MAAM;CAI5B,iBAAiB,MAAM;CAGvB,MAAM,eAAe,oBAAoB,MAAM;CAE/C,MAAM,aACJ,OAAO,eAAe,SAAS,cAAc,OAAO,eAAe,SAAS;CAC9E,MAAM,kBAAkB,OAAO;CAC/B,MAAM,cAAc,oBAAoB,eAAe,oBAAoB;CAC3E,MAAM,cAAc,oBAAoB,eAAe,oBAAoB;CAC3E,MAAM,gBACJ,oBAAoB,YACpB,oBAAoB,eACpB,oBAAoB,eACf,OAAO,yBAAyB,aAAa,oBAC9C;CAIN,OAAO,aACL;EACE,QAAQ;EACR,YAAY,OAAO;EACnB,mBAAmB,SAAS,mBAAmB;EAC/C,QAAQ,OAAO;EACf,eAAe,OAAO;EACtB,cAAc,OAAO;EACrB,YAAY,SAAS,SAAS;EAC9B,iBAAiB,SAAS,WAAW;EACrC,MAAM,QAAQ,QAAQ;EACtB,MAAM;GACJ,OAAO,QAAQ,SAAS,OAAO;GAC/B,aAAa,OAAO;GACpB,OAAO,eAAe,OAAO;GAC7B,MAAM,OAAO;GACb,KAAK,SAAS,OAAO;EACvB;EACA,QAAQ;GACN,SAAS;GACT,iBAAiB;GACjB,OAAO,OAAO;GACd,UAAU;GACV,gBAAgB,OAAO;GACvB,aAAa,OAAO;GACpB,aAAa,OAAO;GACpB,uBAAuB,OAAO,cAAc,UAAU;GACtD,UAAU;EACZ;EACA;EACA,WAAW,CAAC;EACZ,GAAI,MAAM,SAAS,IAAI,EAAE,MAAM,IAAI,CAAC;EACpC,SAAS;GACP,GAAG;GACH,eAAe,cAAc,YAAY,MAAM;GAC/C,SAAS;GAUT,SAAS,EAAE,GAAG,OAAO,QAAQ,IAAI;GACjC,cAAc;GACd,cAAc;GACd,OAAO;EACT;EACA,MAAM;GACJ,KAAK,aAAa,OAAO,UAAU;GACnC,WAAW,OAAO,WAAW;GAC7B,YAAY,OAAO,WAAW;GAC9B,kBAAkB,OAAO,WAAW,aAAa;GACjD,YAAY,OAAO,WAAW,UAAU;GACxC,aAAa,OAAO,WAAW,cAAc;GAC7C,QAAQ,KAAK,MAAM,OAAO,SAAS,GAAI;EACzC;EACA,WAAW;GACT,YAAY;GACZ,SAAS;GACT,gBAAgB,OAAO,WAAW,SAAS,OAAO,SAAS,YAAY;EACzE;EACA,YAAY;GACV,aAAa;GACb,SAAS;GACT,GAAI,OAAO,WAAW,KAAA,IAAY,EAAE,QAAQ,EAAE,GAAG,OAAO,OAAO,EAAE,IAAI,CAAC;GACtE,GAAI,aAAa,KAAA,IAAY,EAAE,UAAU,CAAC,GAAG,QAAQ,EAAE,IAAI,CAAC;GAC5D,GAAI,kBAAkB,EAAE,kBAAkB,KAAK,IAAI,CAAC;GACpD,GAAI,QAAQ,KAAA,IAAY,EAAE,IAAI,IAAI,CAAC;EACrC;CACF,GACA,+BAA+B,OAAO,OACxC;AACF;;;;;;;AAQA,eAAsB,gBACpB,SACA,OACA,UAA8B,CAAC,GACH;CAC5B,MAAM,QAAQ,QAAQ,WAAW,MAAM;CACvC,MAAM,cAAc,QAAQ,MAAM,qBAAK,IAAI,KAAK,EAAA,CAAG,YAAY;CAC/D,IACE,QAAQ,aAAa,KAAA,MACpB,CAAC,OAAO,cAAc,QAAQ,QAAQ,KAAK,QAAQ,WAAW,IAE/D,MAAM,IAAI,gBAAgB,qCAAqC;CAEjE,MAAM,OAA4B,CAAC;CACnC,MAAM,gBAA0B,CAAC;CACjC,KAAK,MAAM,UAAU,SAAS;EAC5B,MAAM,aAAa,MAAM,gBAAgB,OAAO,OAAO,KAAK;EAC5D,MAAM,WAAW,QAAQ,aAAa,MAAM,QAAQ,WAAW,OAAO,KAAK,IAAI,KAAA;EAC/E,MAAM,WAAW,QAAQ,aAAa,MAAM,QAAQ,WAAW,OAAO,KAAK,IAAI,KAAA;EAC/E,IAAI,aAAa,KAAA,KAAa,UAAU,UAAU,OAAO,OACvD,MAAM,IAAI,gBACR,+BAA+B,OAAO,MAAM,0CAC9C;EAEF,IACE,QAAQ,eACP,CAAC,YAAY,CAAC,MAAM,QAAQ,SAAS,QAAQ,KAAK,SAAS,SAAS,WAAW,IAEhF,MAAM,IAAI,gBACR,+BAA+B,OAAO,MAAM,uCAC9C;EAEF,IACE,UAAU,SAAS,MAChB,YACC,CAAC,WACD,CAAC,MAAM,QAAQ,QAAQ,gBAAgB,KACvC,CAAC,MAAM,QAAQ,QAAQ,UAAU,KACjC,CAAC,MAAM,QAAQ,QAAQ,cAAc,CACzC,GAEA,MAAM,IAAI,gBACR,+BAA+B,OAAO,MAAM,sCAC9C;EAEF,MAAM,WAAW,UAAU,SAAS,KAAK,aAAa;GACpD,GAAG;GACH,kBAAkB,CAAC,GAAG,QAAQ,gBAAgB;GAC9C,YAAY,CAAC,GAAG,QAAQ,UAAU;GAClC,gBAAgB,QAAQ,eAAe,IAAI,KAAK;EAClD,EAAE;EACF,IAAI,QAAQ,eAAe,CAAC,MAAM,QAAQ,QAAQ,KAAK,SAAS,WAAW,IACzE,MAAM,IAAI,gBACR,+BAA+B,OAAO,MAAM,0BAC9C;EAEF,MAAM,UAAU,MAAM,qBAAqB,QAAQ,OAAO;EAC1D,IAAI,WAAW,MAAM,WAAW,KAAK,CAAC,QAAQ,YAAY;GACxD,cAAc,KAAK,OAAO,KAAK;GAC/B,KAAK,KACH,SACE,QACA,SACA,CAAC,GACD,CAAC,GACD,SACA,YACA,0CACA,QACF,CACF;GACA;EACF;EACA,IAAI,QAAQ,WAAW,MAAM,KAAK,MAAM,YAAY,EAAE,MAAM,KAAK,CAAC;EAClE,MAAM,eACJ,QAAQ,aAAa,KAAA,KAAa,MAAM,SAAS,QAAQ,WACrD,MAAM,SAAS,QAAQ,WACvB;EACN,IAAI,QAAQ,aAAa,KAAA,KAAa,eAAe,GAAG;GAGtD,MAAM,OAAO,KAAK,KAAK,QAAQ,WAAW,CAAC;GAC3C,MAAM,OAAO,QAAQ,WAAW;GAChC,QAAQ,CAAC,GAAG,MAAM,MAAM,GAAG,IAAI,GAAG,GAAG,MAAM,MAAM,MAAM,SAAS,IAAI,CAAC;EACvE;EACA,MAAM,QAAQ,WAAW,MAAM,KAAK,MAAM,EAAE,IAAI;EAChD,MAAM,WAAW,YAAY,kBAAkB,KAAK;EACpD,mBAAmB,UAAU,OAAO,KAAK;EACzC,MAAM,eAAe,SAAS,KAAK,YAAY,eAAe,SAAS,KAAK,CAAC;EAE7E,mBACE,aAAa,QAAQ,YAAY,QAAQ,sBAAsB,IAAI,GACnE,OAAO,KACT;EACA,MAAM,OAAiB,CAAC;EACxB,IAAI,aAAa,WAAW,GAAG,KAAK,KAAK,mDAAmD;OACvF,IAAI,CAAC,QAAQ,YAChB,KAAK,KAAK,8EAA8E;EAE1F,IAAI,eAAe,GAAG,KAAK,KAAK,GAAG,aAAa,wCAAwC;EACxF,KAAK,MAAM,WAAW,YAAY,CAAC,GACjC,IAAI,QAAQ,eAAe,SAAS,GAClC,KAAK,KAAK,oBAAoB,QAAQ,QAAQ,IAAI,QAAQ,eAAe,KAAK,IAAI,GAAG;EAGzF,KAAK,KACH,SACE,QACA,SACA,OACA,cACA,SACA,YACA,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,IAAI,KAAA,GACpC,UACC,aAAa,SAAS,KAAK,CAAC,QAAQ,cACnC,eAAe,MACd,UAAU,MAAM,YAAY,QAAQ,eAAe,SAAS,CAAC,KAAK,MACvE,CACF;CACF;CACA,OAAO;EAAE;EAAM;CAAc;AAC/B"}

package/dist/{multi-layer-verifier-BUaQ4C17.d.ts → multi-layer-verifier-DEgMUk6v.d.ts}

@@ -1,4 +1,4 @@
-import { t as DefaultVerdict } from "./verdict-E4eRNf7-.js";
+import { t as DefaultVerdict } from "./verdict-C24NELtN.js";
 //#region src/multi-layer-verifier.d.ts
 type LayerStatus = 'pass' | 'fail' | 'skipped' | 'error' | 'timeout';
 type Severity = 'critical' | 'major' | 'minor' | 'info';
@@ -135,4 +135,4 @@ declare class MultiLayerVerifier<Env = unknown> {
 }
 //#endregion
 export { MultiLayerVerifier as a, VerifyOptions as c, LayerStatus as i, gradeSemanticStatus as l, Layer as n, Severity as o, LayerResult as r, VerificationReport as s, Finding as t };
-//# sourceMappingURL=multi-layer-verifier-BUaQ4C17.d.ts.map
+//# sourceMappingURL=multi-layer-verifier-DEgMUk6v.d.ts.map

package/dist/{multi-layer-verifier-BUaQ4C17.d.ts.map → multi-layer-verifier-DEgMUk6v.d.ts.map}

@@ -1 +1 @@
-{"version":3,"file":"multi-layer-verifier-BUaQ4C17.d.ts","names":[],"sources":["../src/multi-layer-verifier.ts"],"mappings":";;KAsBY;KAEA;UAEK;EACf,UAAU;EACV;EACA;;EAEA;;;;;;EAMA,SAAS;;UAGM;EACf;EACA,QAAQ;;EAER;;EAEA;EACA;EACA,UAAU;;EAEV;;;;;;;;;EASA,cAAc;;EAEd,SAAS;;UAGM,cAAc;;EAE7B,KAAK;;EAEL,OAAO,eAAe;;EAEtB,QAAQ;;UAGO,MAAM;EACrB;;EAEA;;EAEA;;;;;EAKA;;;;;;EAMA;;EAEA;EACA,MAAM,KAAK,cAAc,SAAS,QAAQ,eAAe;;UAG1C,cAAc;EAC7B,KAAK;;;;;EAKL;;EAEA,WAAW,QAAQ;;;;UAKJ,2BAA2B;EAC1C,QAAQ;EACR;EACA;EACA;EACA;;EAEA;;;;;EAKA;;;;;;;;EAQA;EACA;EACA;EACA;;;;;;;;;;;;;iBAgBc,oBAAoB;EAClC;EACA,UAAU;IAAQ,UAAU;IAAU;IAAmB;;EACzD;EACA;IACE;;;;cAcS,mBAAmB;mBACD;EAA7B,YAA6B,QAAQ,MAAM;EAiBrC,IAAI,MAAM,cAAc,OAAO,QAAQ"}
+{"version":3,"file":"multi-layer-verifier-DEgMUk6v.d.ts","names":[],"sources":["../src/multi-layer-verifier.ts"],"mappings":";;KAsBY;KAEA;UAEK;EACf,UAAU;EACV;EACA;;EAEA;;;;;;EAMA,SAAS;;UAGM;EACf;EACA,QAAQ;;EAER;;EAEA;EACA;EACA,UAAU;;EAEV;;;;;;;;;EASA,cAAc;;EAEd,SAAS;;UAGM,cAAc;;EAE7B,KAAK;;EAEL,OAAO,eAAe;;EAEtB,QAAQ;;UAGO,MAAM;EACrB;;EAEA;;EAEA;;;;;EAKA;;;;;;EAMA;;EAEA;EACA,MAAM,KAAK,cAAc,SAAS,QAAQ,eAAe;;UAG1C,cAAc;EAC7B,KAAK;;;;;EAKL;;EAEA,WAAW,QAAQ;;;;UAKJ,2BAA2B;EAC1C,QAAQ;EACR;EACA;EACA;EACA;;EAEA;;;;;EAKA;;;;;;;;EAQA;EACA;EACA;EACA;;;;;;;;;;;;;iBAgBc,oBAAoB;EAClC;EACA,UAAU;IAAQ,UAAU;IAAU;IAAmB;;EACzD;EACA;IACE;;;;cAcS,mBAAmB;mBACD;EAA7B,YAA6B,QAAQ,MAAM;EAiBrC,IAAI,MAAM,cAAc,OAAO,QAAQ"}

package/dist/{multiplicity-D9cjmStq.js → multiplicity-Sg0U7h8j.js}

@@ -1,4 +1,4 @@
-import { s as ValidationError } from "./errors-Dngq5h35.js";
+import { s as ValidationError } from "./errors-BcOs5MKW.js";
 //#region src/statistics/multiplicity.ts
 /**
 * Multiple-comparison corrections: family-wise error (Bonferroni, Holm) and
@@ -98,4 +98,4 @@ function assertPValues(fn, pValues) {
 //#endregion
 export { bonferroni as n, holm as r, benjaminiHochberg as t };
 
-//# sourceMappingURL=multiplicity-D9cjmStq.js.map
+//# sourceMappingURL=multiplicity-Sg0U7h8j.js.map

package/dist/{multiplicity-D9cjmStq.js.map → multiplicity-Sg0U7h8j.js.map}

@@ -1 +1 @@
-{"version":3,"file":"multiplicity-D9cjmStq.js","names":[],"sources":["../src/statistics/multiplicity.ts"],"sourcesContent":["/**\n * Multiple-comparison corrections: family-wise error (Bonferroni, Holm) and\n * false discovery rate (Benjamini-Hochberg), with inclusive rejection\n * boundaries throughout.\n */\n\nimport { ValidationError } from '../errors'\n\n/**\n * Bonferroni adjustment: multiply every p-value by the test count, clamp at 1.\n *\n * Rejects at `p_adjusted ≤ alpha` — the boundary is inclusive, matching\n * {@link holm}, which uniformly dominates this correction and must therefore\n * never reject less. Validates its inputs on the same terms.\n */\nexport function bonferroni(\n  pValues: readonly number[],\n  alpha = 0.05,\n): { adjusted: number[]; significant: boolean[] } {\n  assertAlpha('bonferroni', 'alpha', alpha)\n  assertPValues('bonferroni', pValues)\n  const k = pValues.length\n  const adjusted = pValues.map((p) => Math.min(1, p * k))\n  return { adjusted, significant: adjusted.map((p) => p <= alpha) }\n}\n\n/**\n * Holm step-down family-wise error adjustment.\n *\n * P-values are sorted from smallest to largest, multiplied by their remaining\n * hypothesis count, and made monotonically non-decreasing before being mapped\n * back to input order. This uniformly dominates plain Bonferroni while keeping\n * strong family-wise error control under arbitrary dependence.\n */\nexport function holm(\n  pValues: readonly number[],\n  alpha = 0.05,\n): { adjusted: number[]; significant: boolean[] } {\n  assertAlpha('holm', 'alpha', alpha)\n  assertPValues('holm', pValues)\n  const count = pValues.length\n  if (count === 0) return { adjusted: [], significant: [] }\n\n  const ordered = pValues\n    .map((pValue, index) => ({ pValue, index }))\n    .sort((a, b) => a.pValue - b.pValue || a.index - b.index)\n  const adjusted = new Array<number>(count)\n  let previous = 0\n  for (let rank = 0; rank < count; rank++) {\n    const entry = ordered[rank]!\n    const stepAdjusted = Math.min(1, entry.pValue * (count - rank))\n    previous = Math.max(previous, stepAdjusted)\n    adjusted[entry.index] = previous\n  }\n  // Holm's rejection rule is inclusive at the adjusted alpha boundary.\n  return { adjusted, significant: adjusted.map((pValue) => pValue <= alpha) }\n}\n\n/**\n * Benjamini–Hochberg false discovery rate. Returns adjusted q-values and\n * significance at the target FDR; handles ties and preserves q monotonicity.\n *\n * Rejects at `q ≤ fdr` — the BH rule is inclusive at the boundary, so an\n * exactly-`fdr` q-value is a discovery.\n */\nexport function benjaminiHochberg(\n  pValues: readonly number[],\n  fdr = 0.05,\n): { qValues: number[]; significant: boolean[] } {\n  assertAlpha('benjaminiHochberg', 'fdr', fdr)\n  assertPValues('benjaminiHochberg', pValues)\n  const n = pValues.length\n  if (n === 0) return { qValues: [], significant: [] }\n  const indexed = pValues.map((p, i) => ({ p, i })).sort((a, b) => a.p - b.p)\n  const q = new Array<number>(n)\n  let minRight = 1\n  for (let k = n - 1; k >= 0; k--) {\n    const rank = k + 1\n    const entry = indexed[k]!\n    // (n/rank)·p, not (p·n)/rank: the latter lands one ULP above `fdr` at an\n    // exact boundary (p = 0.05, n = 3, rank = 3 gives 0.05000000000000001),\n    // which silently turns a discovery into a non-discovery. This is R's\n    // `p.adjust(method = \"BH\")` formulation.\n    const raw = (n / rank) * entry.p\n    const bounded = Math.min(minRight, raw)\n    minRight = bounded\n    q[entry.i] = Math.min(1, bounded)\n  }\n  return { qValues: q, significant: q.map((v) => v <= fdr) }\n}\n\nfunction assertAlpha(fn: string, label: string, value: number): void {\n  if (!Number.isFinite(value) || value <= 0 || value >= 1) {\n    throw new ValidationError(`${fn}: ${label} must be in (0,1), got ${value}`)\n  }\n}\n\nfunction assertPValues(fn: string, pValues: readonly number[]): void {\n  for (const [index, pValue] of pValues.entries()) {\n    if (!Number.isFinite(pValue) || pValue < 0 || pValue > 1) {\n      throw new ValidationError(`${fn}: pValues[${index}] must be in [0,1], got ${pValue}`)\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;AAeA,SAAgB,WACd,SACA,QAAQ,KACwC;CAChD,YAAY,cAAc,SAAS,KAAK;CACxC,cAAc,cAAc,OAAO;CACnC,MAAM,IAAI,QAAQ;CAClB,MAAM,WAAW,QAAQ,KAAK,MAAM,KAAK,IAAI,GAAG,IAAI,CAAC,CAAC;CACtD,OAAO;EAAE;EAAU,aAAa,SAAS,KAAK,MAAM,KAAK,KAAK;CAAE;AAClE;;;;;;;;;AAUA,SAAgB,KACd,SACA,QAAQ,KACwC;CAChD,YAAY,QAAQ,SAAS,KAAK;CAClC,cAAc,QAAQ,OAAO;CAC7B,MAAM,QAAQ,QAAQ;CACtB,IAAI,UAAU,GAAG,OAAO;EAAE,UAAU,CAAC;EAAG,aAAa,CAAC;CAAE;CAExD,MAAM,UAAU,QACb,KAAK,QAAQ,WAAW;EAAE;EAAQ;CAAM,EAAE,CAAC,CAC3C,MAAM,GAAG,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,KAAK;CAC1D,MAAM,WAAW,IAAI,MAAc,KAAK;CACxC,IAAI,WAAW;CACf,KAAK,IAAI,OAAO,GAAG,OAAO,OAAO,QAAQ;EACvC,MAAM,QAAQ,QAAQ;EACtB,MAAM,eAAe,KAAK,IAAI,GAAG,MAAM,UAAU,QAAQ,KAAK;EAC9D,WAAW,KAAK,IAAI,UAAU,YAAY;EAC1C,SAAS,MAAM,SAAS;CAC1B;CAEA,OAAO;EAAE;EAAU,aAAa,SAAS,KAAK,WAAW,UAAU,KAAK;CAAE;AAC5E;;;;;;;;AASA,SAAgB,kBACd,SACA,MAAM,KACyC;CAC/C,YAAY,qBAAqB,OAAO,GAAG;CAC3C,cAAc,qBAAqB,OAAO;CAC1C,MAAM,IAAI,QAAQ;CAClB,IAAI,MAAM,GAAG,OAAO;EAAE,SAAS,CAAC;EAAG,aAAa,CAAC;CAAE;CACnD,MAAM,UAAU,QAAQ,KAAK,GAAG,OAAO;EAAE;EAAG;CAAE,EAAE,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,IAAI,EAAE,CAAC;CAC1E,MAAM,IAAI,IAAI,MAAc,CAAC;CAC7B,IAAI,WAAW;CACf,KAAK,IAAI,IAAI,IAAI,GAAG,KAAK,GAAG,KAAK;EAC/B,MAAM,OAAO,IAAI;EACjB,MAAM,QAAQ,QAAQ;EAKtB,MAAM,MAAO,IAAI,OAAQ,MAAM;EAC/B,MAAM,UAAU,KAAK,IAAI,UAAU,GAAG;EACtC,WAAW;EACX,EAAE,MAAM,KAAK,KAAK,IAAI,GAAG,OAAO;CAClC;CACA,OAAO;EAAE,SAAS;EAAG,aAAa,EAAE,KAAK,MAAM,KAAK,GAAG;CAAE;AAC3D;AAEA,SAAS,YAAY,IAAY,OAAe,OAAqB;CACnE,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,SAAS,KAAK,SAAS,GACpD,MAAM,IAAI,gBAAgB,GAAG,GAAG,IAAI,MAAM,yBAAyB,OAAO;AAE9E;AAEA,SAAS,cAAc,IAAY,SAAkC;CACnE,KAAK,MAAM,CAAC,OAAO,WAAW,QAAQ,QAAQ,GAC5C,IAAI,CAAC,OAAO,SAAS,MAAM,KAAK,SAAS,KAAK,SAAS,GACrD,MAAM,IAAI,gBAAgB,GAAG,GAAG,YAAY,MAAM,0BAA0B,QAAQ;AAG1F"}
+{"version":3,"file":"multiplicity-Sg0U7h8j.js","names":[],"sources":["../src/statistics/multiplicity.ts"],"sourcesContent":["/**\n * Multiple-comparison corrections: family-wise error (Bonferroni, Holm) and\n * false discovery rate (Benjamini-Hochberg), with inclusive rejection\n * boundaries throughout.\n */\n\nimport { ValidationError } from '../errors'\n\n/**\n * Bonferroni adjustment: multiply every p-value by the test count, clamp at 1.\n *\n * Rejects at `p_adjusted ≤ alpha` — the boundary is inclusive, matching\n * {@link holm}, which uniformly dominates this correction and must therefore\n * never reject less. Validates its inputs on the same terms.\n */\nexport function bonferroni(\n  pValues: readonly number[],\n  alpha = 0.05,\n): { adjusted: number[]; significant: boolean[] } {\n  assertAlpha('bonferroni', 'alpha', alpha)\n  assertPValues('bonferroni', pValues)\n  const k = pValues.length\n  const adjusted = pValues.map((p) => Math.min(1, p * k))\n  return { adjusted, significant: adjusted.map((p) => p <= alpha) }\n}\n\n/**\n * Holm step-down family-wise error adjustment.\n *\n * P-values are sorted from smallest to largest, multiplied by their remaining\n * hypothesis count, and made monotonically non-decreasing before being mapped\n * back to input order. This uniformly dominates plain Bonferroni while keeping\n * strong family-wise error control under arbitrary dependence.\n */\nexport function holm(\n  pValues: readonly number[],\n  alpha = 0.05,\n): { adjusted: number[]; significant: boolean[] } {\n  assertAlpha('holm', 'alpha', alpha)\n  assertPValues('holm', pValues)\n  const count = pValues.length\n  if (count === 0) return { adjusted: [], significant: [] }\n\n  const ordered = pValues\n    .map((pValue, index) => ({ pValue, index }))\n    .sort((a, b) => a.pValue - b.pValue || a.index - b.index)\n  const adjusted = new Array<number>(count)\n  let previous = 0\n  for (let rank = 0; rank < count; rank++) {\n    const entry = ordered[rank]!\n    const stepAdjusted = Math.min(1, entry.pValue * (count - rank))\n    previous = Math.max(previous, stepAdjusted)\n    adjusted[entry.index] = previous\n  }\n  // Holm's rejection rule is inclusive at the adjusted alpha boundary.\n  return { adjusted, significant: adjusted.map((pValue) => pValue <= alpha) }\n}\n\n/**\n * Benjamini–Hochberg false discovery rate. Returns adjusted q-values and\n * significance at the target FDR; handles ties and preserves q monotonicity.\n *\n * Rejects at `q ≤ fdr` — the BH rule is inclusive at the boundary, so an\n * exactly-`fdr` q-value is a discovery.\n */\nexport function benjaminiHochberg(\n  pValues: readonly number[],\n  fdr = 0.05,\n): { qValues: number[]; significant: boolean[] } {\n  assertAlpha('benjaminiHochberg', 'fdr', fdr)\n  assertPValues('benjaminiHochberg', pValues)\n  const n = pValues.length\n  if (n === 0) return { qValues: [], significant: [] }\n  const indexed = pValues.map((p, i) => ({ p, i })).sort((a, b) => a.p - b.p)\n  const q = new Array<number>(n)\n  let minRight = 1\n  for (let k = n - 1; k >= 0; k--) {\n    const rank = k + 1\n    const entry = indexed[k]!\n    // (n/rank)·p, not (p·n)/rank: the latter lands one ULP above `fdr` at an\n    // exact boundary (p = 0.05, n = 3, rank = 3 gives 0.05000000000000001),\n    // which silently turns a discovery into a non-discovery. This is R's\n    // `p.adjust(method = \"BH\")` formulation.\n    const raw = (n / rank) * entry.p\n    const bounded = Math.min(minRight, raw)\n    minRight = bounded\n    q[entry.i] = Math.min(1, bounded)\n  }\n  return { qValues: q, significant: q.map((v) => v <= fdr) }\n}\n\nfunction assertAlpha(fn: string, label: string, value: number): void {\n  if (!Number.isFinite(value) || value <= 0 || value >= 1) {\n    throw new ValidationError(`${fn}: ${label} must be in (0,1), got ${value}`)\n  }\n}\n\nfunction assertPValues(fn: string, pValues: readonly number[]): void {\n  for (const [index, pValue] of pValues.entries()) {\n    if (!Number.isFinite(pValue) || pValue < 0 || pValue > 1) {\n      throw new ValidationError(`${fn}: pValues[${index}] must be in [0,1], got ${pValue}`)\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;AAeA,SAAgB,WACd,SACA,QAAQ,KACwC;CAChD,YAAY,cAAc,SAAS,KAAK;CACxC,cAAc,cAAc,OAAO;CACnC,MAAM,IAAI,QAAQ;CAClB,MAAM,WAAW,QAAQ,KAAK,MAAM,KAAK,IAAI,GAAG,IAAI,CAAC,CAAC;CACtD,OAAO;EAAE;EAAU,aAAa,SAAS,KAAK,MAAM,KAAK,KAAK;CAAE;AAClE;;;;;;;;;AAUA,SAAgB,KACd,SACA,QAAQ,KACwC;CAChD,YAAY,QAAQ,SAAS,KAAK;CAClC,cAAc,QAAQ,OAAO;CAC7B,MAAM,QAAQ,QAAQ;CACtB,IAAI,UAAU,GAAG,OAAO;EAAE,UAAU,CAAC;EAAG,aAAa,CAAC;CAAE;CAExD,MAAM,UAAU,QACb,KAAK,QAAQ,WAAW;EAAE;EAAQ;CAAM,EAAE,CAAC,CAC3C,MAAM,GAAG,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,KAAK;CAC1D,MAAM,WAAW,IAAI,MAAc,KAAK;CACxC,IAAI,WAAW;CACf,KAAK,IAAI,OAAO,GAAG,OAAO,OAAO,QAAQ;EACvC,MAAM,QAAQ,QAAQ;EACtB,MAAM,eAAe,KAAK,IAAI,GAAG,MAAM,UAAU,QAAQ,KAAK;EAC9D,WAAW,KAAK,IAAI,UAAU,YAAY;EAC1C,SAAS,MAAM,SAAS;CAC1B;CAEA,OAAO;EAAE;EAAU,aAAa,SAAS,KAAK,WAAW,UAAU,KAAK;CAAE;AAC5E;;;;;;;;AASA,SAAgB,kBACd,SACA,MAAM,KACyC;CAC/C,YAAY,qBAAqB,OAAO,GAAG;CAC3C,cAAc,qBAAqB,OAAO;CAC1C,MAAM,IAAI,QAAQ;CAClB,IAAI,MAAM,GAAG,OAAO;EAAE,SAAS,CAAC;EAAG,aAAa,CAAC;CAAE;CACnD,MAAM,UAAU,QAAQ,KAAK,GAAG,OAAO;EAAE;EAAG;CAAE,EAAE,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,IAAI,EAAE,CAAC;CAC1E,MAAM,IAAI,IAAI,MAAc,CAAC;CAC7B,IAAI,WAAW;CACf,KAAK,IAAI,IAAI,IAAI,GAAG,KAAK,GAAG,KAAK;EAC/B,MAAM,OAAO,IAAI;EACjB,MAAM,QAAQ,QAAQ;EAKtB,MAAM,MAAO,IAAI,OAAQ,MAAM;EAC/B,MAAM,UAAU,KAAK,IAAI,UAAU,GAAG;EACtC,WAAW;EACX,EAAE,MAAM,KAAK,KAAK,IAAI,GAAG,OAAO;CAClC;CACA,OAAO;EAAE,SAAS;EAAG,aAAa,EAAE,KAAK,MAAM,KAAK,GAAG;CAAE;AAC3D;AAEA,SAAS,YAAY,IAAY,OAAe,OAAqB;CACnE,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,SAAS,KAAK,SAAS,GACpD,MAAM,IAAI,gBAAgB,GAAG,GAAG,IAAI,MAAM,yBAAyB,OAAO;AAE9E;AAEA,SAAS,cAAc,IAAY,SAAkC;CACnE,KAAK,MAAM,CAAC,OAAO,WAAW,QAAQ,QAAQ,GAC5C,IAAI,CAAC,OAAO,SAAS,MAAM,KAAK,SAAS,KAAK,SAAS,GACrD,MAAM,IAAI,gBAAgB,GAAG,GAAG,YAAY,MAAM,0BAA0B,QAAQ;AAG1F"}

package/dist/multishot/golden/index.d.ts

@@ -1,11 +1,10 @@
-import { E as MultishotResult, M as MultishotTransportRequest, T as MultishotPersona, c as RunMultishotMatrixResult, f as RunMultishotOptions, k as MultishotToolDefinition, s as RunMultishotMatrixOptions } from "../../matrix-CHMiebFx.js";
+import { A as MultishotTransportRequest, D as MultishotToolDefinition, T as MultishotResult, c as RunMultishotMatrixResult, f as RunMultishotOptions, s as RunMultishotMatrixOptions, w as MultishotPersona } from "../../matrix-DHe-dwVJ.js";
 //#region src/multishot/golden/compare.d.ts
 interface CompareOptions {
   /** Stop after this many mismatches. A structural divergence high in the
    *  tree would otherwise report every leaf below it. */
   limit?: number;
 }
-export declare function compareJson(expected: unknown, actual: unknown, path: string, options?: CompareOptions): string[];
 //#endregion
 //#region src/multishot/golden/engine.d.ts
 /** A conversation engine: one profile, one persona, one transcript. */
@@ -189,35 +188,14 @@ export declare function assertMultishotMatrixGoldenScenario(opts: {
 //#region src/multishot/golden/recording.d.ts
 export declare function recordMessage(raw: unknown): MultishotRecordedMessage;
 export declare function recordRequest(leg: 'agent' | 'driver', req: MultishotTransportRequest): MultishotRecordedRequest;
-/** Judge calls reach the wire as an OpenAI-compat body, not through a
- *  transport, so they are recorded from the request body the stub receives. */
-export declare function recordJudgeRequest(body: Record<string, unknown>): RecordedJudgeRequest;
 export declare function recordResult(result: MultishotResult): RecordedMultishotResult;
 export declare function recordError(err: unknown): RecordedMultishotError;
 /** Deep copy with every wall-clock and run-identity key removed. */
 export declare function stripVolatile(value: unknown): unknown;
-/** The matrix summary Markdown carries a rendered duration. Mask it so the rest
- *  of the document — cell counts, pass rate, mean, cost, the uncaptured warning
- *  — stays under comparison.
- *
- *  A duration the mask does not recognise would stay in the comparison and make
- *  every run mismatch on a definitionally irreproducible field, so an
- *  unmaskable duration line fails loud instead. */
-export declare function maskVolatileMarkdown(text: string): string;
-/** Judge calls fan out through `Promise.all` across three slots, so their
- *  issue order is an implementation detail of the cell body, not behaviour a
- *  caller can observe. Their CONTENT is behaviour, so they are compared as a
- *  set with a stable order. */
-export declare function sortJudgeRequests(requests: readonly RecordedJudgeRequest[]): RecordedJudgeRequest[];
-/** Every file under `dir`, keyed by slash-separated relative path. JSON is
- *  parsed and stripped of wall-clock keys; Markdown keeps its text with the
- *  rendered duration masked; anything else is kept verbatim. */
-export declare function readRunDir(dir: string): Record<string, unknown>;
 //#endregion
 //#region src/multishot/golden/records/index.d.ts
 /** Version a check uses when the caller names none. */
 export declare const CURRENT_MULTISHOT_GOLDEN_VERSION = "v1";
-export declare function multishotGoldenVersions(): string[];
 export declare function goldenRecords(version?: string): MultishotGoldenRecordSet;
 //#endregion
 export type { CompareOptions, MultishotGoldenCase, MultishotGoldenEngine, MultishotGoldenOutcome, MultishotGoldenRecord, MultishotGoldenRecordSet, MultishotGoldenReport, MultishotGoldenScenario, MultishotGoldenScenarioReport, MultishotMatrixGoldenCase, MultishotMatrixGoldenEngine, MultishotMatrixGoldenRecord, MultishotMatrixGoldenScenario, MultishotRecordedMessage, MultishotRecordedRequest, RecordedJudgeRequest, RecordedMultishotError, RecordedMultishotResult };

package/dist/multishot/golden/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","names":[],"sources":["../../../src/multishot/golden/compare.ts","../../../src/multishot/golden/engine.ts","../../../src/multishot/golden/types.ts","../../../src/multishot/golden/matrix-scenarios.ts","../../../src/multishot/golden/scenarios.ts","../../../src/multishot/golden/harness.ts","../../../src/multishot/golden/recording.ts","../../../src/multishot/golden/records/index.ts"],"mappings":";;UAQiB;;;EAGf;;wBAGc,YACd,mBACA,iBACA,cACA,UAAS;;;;KCPC,yBACV,MAAM,oBAAoB,sBACvB,QAAQ;;KAGD,+BACV,MAAM,0BAA0B,sBAC7B,QAAQ;;;;;UCRI;EACf;EACA;;EAEA;;EAEA,YAAY;IAAQ;IAAY;IAAc;;;;;;;UAO/B;EACf;EACA;EACA;EACA;;;;;EAKA,OAAO;EACP,UAAU;;;KAIA,0BAA0B,KAAK;;;UAI1B;EACf;EACA;;;EAGA;IAAa;IAAiB;;;KAGpB;EACN;EAAgB,QAAQ;;EACxB;EAAe,OAAO;;UAEX;EACf;EACA;EACA,UAAU;EACV,SAAS;;;UAIM;EACf;EACA;EACA;EACA,UAAU;;UAGK;EACf;EACA;EACA,UAAU;EACV,eAAe;;EAEf;;;;EAIA,OAAO;;;;UAKQ;EACf;;EAEA;;EAEA;EACA;EACA,WAAW;EACX,iBAAiB;;;;UCpEF;EACf,SAAS,0BAA0B;EACnC,UAAU;;EAEV,eAAe;;UAGA;WACN;WACA;WACA,QAAQ,mBAAmB;;wBAkJtB,kCAAkC;;;;UCnJjC;EACf,SAAS,oBAAoB;;EAE7B,UAAU;;UAGK;WACN;WACA;;;WAGA,aAAa;;;wBAwWR,4BAA4B;;;UCrX3B;EACf;EACA;EACA;EACA;;UAGe;EACf;EACA;EACA;EACA,WAAW;;qBAGA,qCAAqC;WAErC;WACA;WACA;EAHX,YACW,oBACA,sBACA;;;wBAoCS,6BAA6B;EACjD,QAAQ;EACR,UAAU;EACV,UAAU;IACR,QAAQ;;wBAoCU,8BAA8B;EAClD,QAAQ;EACR,UAAU;EACV,UAAU;IACR;;wBASkB,qBAAqB;EACzC,QAAQ;EACR,UAAU;EACV;IACE,QAAQ;;wBA6BU,mCAAmC;EACvD,QAAQ;EACR,UAAU;;EAEV;EACA,UAAU;IACR,QAAQ;wBAoBU,oCAAoC;EACxD,QAAQ;EACR,UAAU;EACV;EACA,UAAU;IACR;;;wBC7KY,cAAc,eAAe;wBA0B7B,cACd,yBACA,KAAK,4BACJ;;;wBAaa,mBAAmB,MAAM,0BAA0B;wBASnD,aAAa,QAAQ,kBAAkB;wBAKvC,YAAY,eAAe;;wBAU3B,cAAc;;;;;;;;wBAoBd,qBAAqB;;;;;wBAgBrB,kBACd,mBAAmB,yBAClB;;;;wBAWa,WAAW,cAAc;;;;qBCpI5B;wBAoDG;wBAIA,cACd,mBACC"}
+{"version":3,"file":"index.d.ts","names":[],"sources":["../../../src/multishot/golden/compare.ts","../../../src/multishot/golden/engine.ts","../../../src/multishot/golden/types.ts","../../../src/multishot/golden/matrix-scenarios.ts","../../../src/multishot/golden/scenarios.ts","../../../src/multishot/golden/harness.ts","../../../src/multishot/golden/recording.ts","../../../src/multishot/golden/records/index.ts"],"mappings":";;UAQiB;;;EAGf;;;;;KCAU,yBACV,MAAM,oBAAoB,sBACvB,QAAQ;;KAGD,+BACV,MAAM,0BAA0B,sBAC7B,QAAQ;;;;;UCRI;EACf;EACA;;EAEA;;EAEA,YAAY;IAAQ;IAAY;IAAc;;;;;;;UAO/B;EACf;EACA;EACA;EACA;;;;;EAKA,OAAO;EACP,UAAU;;;KAIA,0BAA0B,KAAK;;;UAI1B;EACf;EACA;;;EAGA;IAAa;IAAiB;;;KAGpB;EACN;EAAgB,QAAQ;;EACxB;EAAe,OAAO;;UAEX;EACf;EACA;EACA,UAAU;EACV,SAAS;;;UAIM;EACf;EACA;EACA;EACA,UAAU;;UAGK;EACf;EACA;EACA,UAAU;EACV,eAAe;;EAEf;;;;EAIA,OAAO;;;;UAKQ;EACf;;EAEA;;EAEA;EACA;EACA,WAAW;EACX,iBAAiB;;;;UCpEF;EACf,SAAS,0BAA0B;EACnC,UAAU;;EAEV,eAAe;;UAGA;WACN;WACA;WACA,QAAQ,mBAAmB;;wBAkJtB,kCAAkC;;;;UCnJjC;EACf,SAAS,oBAAoB;;EAE7B,UAAU;;UAGK;WACN;WACA;;;WAGA,aAAa;;;wBAwWR,4BAA4B;;;UCpX3B;EACf;EACA;EACA;EACA;;UAGe;EACf;EACA;EACA;EACA,WAAW;;qBAGA,qCAAqC;WAErC;WACA;WACA;EAHX,YACW,oBACA,sBACA;;;wBAoCS,6BAA6B;EACjD,QAAQ;EACR,UAAU;EACV,UAAU;IACR,QAAQ;;wBAoCU,8BAA8B;EAClD,QAAQ;EACR,UAAU;EACV,UAAU;IACR;;wBASkB,qBAAqB;EACzC,QAAQ;EACR,UAAU;EACV;IACE,QAAQ;;wBA6BU,mCAAmC;EACvD,QAAQ;EACR,UAAU;;EAEV;EACA,UAAU;IACR,QAAQ;wBAoBU,oCAAoC;EACxD,QAAQ;EACR,UAAU;EACV;EACA,UAAU;IACR;;;wBC9KY,cAAc,eAAe;wBA0B7B,cACd,yBACA,KAAK,4BACJ;wBAsBa,aAAa,QAAQ,kBAAkB;wBAKvC,YAAY,eAAe;;wBAU3B,cAAc;;;;qBCnFjB;wBAwDG,cACd,mBACC"}

package/dist/multishot/golden/index.js

@@ -1,5 +1,6 @@
-import { n as readCellSpend } from "../../matrix-_BV9-Lk5.js";
-import { n as MultishotFatalToolError } from "../../types-B3jzCp0p.js";
+import { t as isNonnegativeFiniteNumber } from "../../nonnegative-number-DvdMxg_f.js";
+import { t as readCellSpend } from "../../cell-spend-DEWR3nj-.js";
+import { n as MultishotFatalToolError } from "../../types-BXgASBCL.js";
 import { existsSync, readFileSync, readdirSync, statSync } from "node:fs";
 import { join, posix, relative, sep } from "node:path";
 //#region src/multishot/golden/compare.ts
@@ -7573,7 +7574,7 @@ async function checkMultishotGoldenScenario(opts) {
 			kind: "result",
 			result: recordResult(result)
 		};
-		if (!isUsableDuration(result.durationMs)) mismatches.push(`durationMs: expected a finite number >= 0, received ${String(result.durationMs)}`);
+		if (!isNonnegativeFiniteNumber(result.durationMs)) mismatches.push(`durationMs: expected a finite number >= 0, received ${String(result.durationMs)}`);
 	} catch (err) {
 		observed = {
 			kind: "error",
@@ -7646,11 +7647,7 @@ async function assertMultishotMatrixGoldenScenario(opts) {
 	});
 	if (!report.ok) throw new MultishotGoldenMismatchError(report.id, report.mismatches, records.version);
 }
-/** A duration a caller can read: finite and not negative. */
-function isUsableDuration(value) {
-	return typeof value === "number" && Number.isFinite(value) && value >= 0;
-}
 //#endregion
-export { CURRENT_MULTISHOT_GOLDEN_VERSION, MultishotGoldenMismatchError, assertMultishotGoldenScenario, assertMultishotMatrixGoldenScenario, checkMultishotGolden, checkMultishotGoldenScenario, checkMultishotMatrixGoldenScenario, compareJson, goldenRecords, maskVolatileMarkdown, multishotGoldenScenarios, multishotGoldenVersions, multishotMatrixGoldenScenarios, readRunDir, recordError, recordJudgeRequest, recordMessage, recordRequest, recordResult, sortJudgeRequests, stripVolatile };
+export { CURRENT_MULTISHOT_GOLDEN_VERSION, MultishotGoldenMismatchError, assertMultishotGoldenScenario, assertMultishotMatrixGoldenScenario, checkMultishotGolden, checkMultishotGoldenScenario, checkMultishotMatrixGoldenScenario, goldenRecords, multishotGoldenScenarios, multishotMatrixGoldenScenarios, recordError, recordMessage, recordRequest, recordResult, stripVolatile };
 
 //# sourceMappingURL=index.js.map