@tangle-network/agent-eval 0.138.0 → 0.139.0

package/dist/{rollout-DQFl0UXA.js.map → rollout-8nj3mYvx.js.map}

@@ -1 +1 @@
-{"version":3,"file":"rollout-DQFl0UXA.js","names":[],"sources":["../src/rollout/interchange/harbor.ts"],"sourcesContent":["/**\n * Harbor ATIF-v1.7 interchange — `tangle.rollout.v1` ⇄ Agent Trajectory\n * Interchange Format.\n *\n * ATIF is the portability format (spec:\n * https://www.harborframework.com/docs/agents/trajectory-format, normative\n * RFC: harbor-framework/harbor `rfcs/0001-trajectory-format.md`). It sits\n * BELOW the waist of the rollout hourglass in both directions — export reads\n * `RolloutLine[]`, import writes `RolloutLine[]` — and it is never a source\n * of training labels:\n *\n *   ATIF models NO reward, NO judge verdict, NO task/split coordinates.\n *\n * Consequences, both deliberate:\n *   - EXPORT drops `outcome.reward`, `outcome.reward_source` and\n *     `outcome.verdict` entirely. They are not smuggled into `extra`: a\n *     third-party reading our ATIF file must not be able to mistake an\n *     agent-eval judge score for something ATIF sanctioned.\n *   - IMPORT therefore mints UNLABELED lines: `reward: null` (the existing\n *     \"null reward is a labeled gap, never 0\" semantics), `verdict: null`,\n *     and a `provenance.gap` naming the missing label. An imported\n *     trajectory is not a training example until a judge scores it.\n *\n * Everything else we own that ATIF has no field for travels in a namespaced\n * escrow at `extra.tangle.*`, so our own round-trip is exact while a foreign\n * reader can ignore it. Fields that neither ATIF nor the escrow can carry\n * come back explicitly null / fail-closed, never invented.\n *\n * THE ESCROW IS NAMESPACED, NOT AUTHENTICATED. Anyone can write\n * `extra.tangle.*` into a file. So the escrow may restore what a value IS, but\n * never what a line is ALLOWED to do: `task.split` is forced to `holdout` on\n * every import regardless of what the document claims, and promoting an\n * imported trajectory to a trainable split is an explicit, greppable act\n * (`relabelImportedSplit`) rather than a property of the file. The document\n * keeps its claim — the claim just is not authority.\n *\n * Multi-agent shape differs on purpose. ATIF EMBEDS children in\n * `subagent_trajectories`; we keep a flat ledger with a normalized\n * `parent_rollout_id` edge. Export assembles the tree, import flattens it.\n * `session_id` is RUN-scoped in ATIF, so it carries `run_id` — the coordinate\n * that is shared by every invocation of one run — not `rollout_id`, which\n * identifies a single invocation and would split one run across session ids.\n *\n * ROUND-TRIPPING IS IDEMPOTENT: `import(export(import(export(x))))` is\n * byte-identical to `import(export(x))`. Import composes `provenance.gap` as a\n * de-duplicated ordered set rather than appending, and it emits every\n * `ChatMessage` with keys in the canonical schema order (role, content,\n * reasoning_content, tool_calls, tool_call_id, name, is_copied_context), so a\n * ledger hashed on serialized bytes sees no diff across further passes. The\n * FIRST import may re-order a producer's keys — that is the canonicalization.\n *\n * NOT building a Letta converter. Letta's trajectory-v1 is a strict subset of\n * what we need from ATIF here — no per-step or aggregate cost, no\n * multi-agent/subagent structure, no token-id or logprob channel — so a Letta\n * sink would carry less than this one and add a second format to keep\n * correct. Decision recorded in docs/rollout.md; do not re-litigate without a\n * concrete consumer that reads Letta and cannot read ATIF.\n */\n\nimport {\n  assertRolloutLine,\n  type ChatMessage,\n  type ChatRole,\n  type ChatToolCall,\n  type GatedEvidence,\n  ROLLOUT_CAPTURES,\n  ROLLOUT_ROLES,\n  ROLLOUT_SCHEMA,\n  ROLLOUT_SPLITS,\n  type RolloutArtifacts,\n  type RolloutCapture,\n  type RolloutCostBlock,\n  type RolloutLine,\n  type RolloutPolicy,\n  type RolloutRole,\n  type RolloutSplit,\n  type RolloutStep,\n  type RolloutTask,\n  type ToolDef,\n} from '../schema'\n\nexport const ATIF_SCHEMA_VERSION = 'ATIF-v1.7'\n\n/** Gap note on every imported line — ATIF carries no verdict, so nothing is scored. */\nexport const HARBOR_IMPORT_GAP = 'imported from Harbor ATIF; no verdict'\n\n/** Namespaced escrow key for everything ATIF does not model but we must not lose. */\nconst ESCROW = 'tangle'\n\n/**\n * Marks a step we synthesized purely to hold tool results that answered no\n * assistant turn IN THIS DOCUMENT. ATIF has no `tool` source, so such results\n * need a carrier step; the marker lets import drop the carrier instead of\n * inventing a turn.\n *\n * A carrier's results carry NO `source_call_id`. RFC 0001 rule 2 requires every\n * `source_call_id` to match a `tool_call_id` in the same step's `tool_calls`,\n * and a carrier declares no calls (a `system` step cannot legally make one), so\n * emitting the id there would produce an invalid document. The id is escrowed\n * instead and restored verbatim on import — the link survives without the\n * document lying about who made the call.\n */\nconst TOOL_RESULTS_ONLY = 'tool-results-only'\n\n// ---------------------------------------------------------------------------\n// ATIF-v1.7 wire types (RFC 0001). Optional fields are optional here too.\n// ---------------------------------------------------------------------------\n\nexport type HarborStepSource = 'system' | 'user' | 'agent'\n\nexport interface HarborImageSource {\n  media_type: string\n  path: string\n}\n\nexport interface HarborContentPart {\n  type: 'text' | 'image'\n  text?: string\n  source?: HarborImageSource\n}\n\nexport interface HarborToolCall {\n  tool_call_id: string\n  function_name: string\n  /** ATIF requires a decoded JSON object here, unlike our raw argument string. */\n  arguments: Record<string, unknown>\n  extra?: Record<string, unknown>\n}\n\nexport interface HarborSubagentTrajectoryRef {\n  trajectory_id?: string\n  trajectory_path?: string\n  /** Informational only since v1.7 — never a resolution key. */\n  session_id?: string\n  extra?: Record<string, unknown>\n}\n\nexport interface HarborObservationResult {\n  source_call_id?: string\n  content?: string | HarborContentPart[]\n  subagent_trajectory_ref?: HarborSubagentTrajectoryRef[]\n  extra?: Record<string, unknown>\n}\n\nexport interface HarborObservation {\n  results: HarborObservationResult[]\n}\n\nexport interface HarborMetrics {\n  prompt_tokens?: number\n  completion_tokens?: number\n  cached_tokens?: number\n  cost_usd?: number\n  prompt_token_ids?: number[]\n  completion_token_ids?: number[]\n  logprobs?: number[]\n  extra?: Record<string, unknown>\n}\n\nexport interface HarborStep {\n  /** Ordinal, sequential from 1. */\n  step_id: number\n  timestamp?: string\n  source: HarborStepSource\n  model_name?: string\n  reasoning_effort?: string | number\n  message: string | HarborContentPart[]\n  reasoning_content?: string\n  tool_calls?: HarborToolCall[]\n  observation?: HarborObservation\n  metrics?: HarborMetrics\n  llm_call_count?: number\n  is_copied_context?: boolean\n  extra?: Record<string, unknown>\n}\n\nexport interface HarborAgent {\n  name: string\n  version: string\n  model_name?: string\n  /** OpenAI function-calling schema — byte-identical to our `ToolDef`. */\n  tool_definitions?: ToolDef[]\n  extra?: Record<string, unknown>\n}\n\nexport interface HarborFinalMetrics {\n  total_prompt_tokens?: number\n  total_completion_tokens?: number\n  total_cached_tokens?: number\n  total_cost_usd?: number\n  total_steps?: number\n  extra?: Record<string, unknown>\n}\n\nexport interface HarborTrajectory {\n  schema_version: string\n  session_id?: string\n  /** Required on embedded subagents; we always set it so lines stay joinable. */\n  trajectory_id?: string\n  agent: HarborAgent\n  steps: HarborStep[]\n  notes?: string\n  final_metrics?: HarborFinalMetrics\n  continued_trajectory_ref?: string\n  subagent_trajectories?: HarborTrajectory[]\n  extra?: Record<string, unknown>\n}\n\n// ---------------------------------------------------------------------------\n// Shared helpers\n// ---------------------------------------------------------------------------\n\nconst isRecord = (v: unknown): v is Record<string, unknown> =>\n  typeof v === 'object' && v !== null && !Array.isArray(v)\n\nconst asString = (v: unknown): string | undefined => (typeof v === 'string' ? v : undefined)\n\nconst asNumberOrNull = (v: unknown): number | null =>\n  typeof v === 'number' && Number.isFinite(v) ? v : null\n\nconst asIntegerOrUndefined = (v: unknown): number | undefined =>\n  Number.isInteger(v) ? (v as number) : undefined\n\nconst asNumberArray = (v: unknown): number[] | undefined =>\n  Array.isArray(v) && v.every((n) => typeof n === 'number' && Number.isFinite(n))\n    ? (v as number[])\n    : undefined\n\nconst asIntegerArray = (v: unknown): number[] | undefined =>\n  Array.isArray(v) && v.every((n) => Number.isInteger(n)) ? (v as number[]) : undefined\n\n/**\n * Builds a `ChatMessage` with keys in the schema's declaration order.\n *\n * Object key order is insertion order in JS, so a message assembled\n * conditionally field-by-field serializes differently depending on which\n * optional fields were present — which makes a byte-hashed ledger see a diff\n * across an import that changed nothing. One builder, one order, stable bytes.\n */\nfunction canonicalChatMessage(parts: {\n  role: ChatRole\n  content: string | null\n  reasoning_content?: string\n  tool_calls?: ChatToolCall[]\n  tool_call_id?: string\n  name?: string\n  is_copied_context?: boolean\n}): ChatMessage {\n  const message: ChatMessage = { role: parts.role, content: parts.content }\n  if (parts.reasoning_content !== undefined) message.reasoning_content = parts.reasoning_content\n  if (parts.tool_calls !== undefined) message.tool_calls = parts.tool_calls\n  if (parts.tool_call_id !== undefined) message.tool_call_id = parts.tool_call_id\n  if (parts.name !== undefined) message.name = parts.name\n  if (parts.is_copied_context === true) message.is_copied_context = true\n  return message\n}\n\n/** Reads the `extra.tangle` escrow, tolerating a foreign file that has none. */\nfunction escrowOf(extra: Record<string, unknown> | undefined): Record<string, unknown> | undefined {\n  if (!isRecord(extra)) return undefined\n  const value = extra[ESCROW]\n  return isRecord(value) ? value : undefined\n}\n\nfunction escrowSection(\n  escrow: Record<string, unknown> | undefined,\n  key: string,\n): Record<string, unknown> | undefined {\n  if (escrow === undefined) return undefined\n  const value = escrow[key]\n  return isRecord(value) ? value : undefined\n}\n\n// ---------------------------------------------------------------------------\n// Export: RolloutLine[] → ATIF trajectory tree\n// ---------------------------------------------------------------------------\n\nfunction toHarborToolCall(call: ChatToolCall): HarborToolCall {\n  // ATIF requires `arguments` to be a JSON object; ours is the raw\n  // JSON-encoded string the model emitted, and models really do emit\n  // malformed ones. Keep the exact bytes in `extra` so import restores the\n  // string verbatim instead of re-serializing a normalized parse.\n  let parsed: Record<string, unknown> | undefined\n  try {\n    const decoded: unknown = JSON.parse(call.function.arguments)\n    if (isRecord(decoded)) parsed = decoded\n  } catch {\n    parsed = undefined\n  }\n  return {\n    tool_call_id: call.id,\n    function_name: call.function.name,\n    arguments: parsed ?? {},\n    extra: { [ESCROW]: { arguments_raw: call.function.arguments } },\n  }\n}\n\n/**\n * `linked` = this result is attached to the step that actually declared the\n * call, so `source_call_id` is legal (RFC 0001 rule 2). When it is not, the id\n * goes to escrow instead of onto the wire.\n */\nfunction toObservationResult(message: ChatMessage, linked: boolean): HarborObservationResult {\n  const result: HarborObservationResult = {}\n  if (linked && message.tool_call_id !== undefined) result.source_call_id = message.tool_call_id\n  if (message.content !== null) result.content = message.content\n  const escrow: Record<string, unknown> = {}\n  if (!linked && message.tool_call_id !== undefined) escrow.source_call_id = message.tool_call_id\n  if (message.name !== undefined) escrow.name = message.name\n  // `content: null` on a tool turn is meaningful (a tool that returned\n  // nothing) and is not the same as the empty string ATIF would round-trip it to.\n  if (message.content === null) escrow.content_null = true\n  if (message.reasoning_content !== undefined) escrow.reasoning_content = message.reasoning_content\n  if (message.is_copied_context === true) escrow.is_copied_context = true\n  if (Object.keys(escrow).length > 0) result.extra = { [ESCROW]: escrow }\n  return result\n}\n\n/** True when `step` is the agent turn that declared `callId` — the rule-2 test. */\nfunction declaresCall(step: HarborStep, callId: string | undefined): boolean {\n  if (callId === undefined) return false\n  return step.tool_calls?.some((call) => call.tool_call_id === callId) === true\n}\n\n/**\n * Attaches the four RL fields lifted from ATIF onto the agent step the span\n * describes. They are ALSO escrowed with the whole span under `extra.tangle`,\n * on purpose: the escrow is how our own round-trip stays exact, and these\n * native fields are how a foreign consumer — which never reads our escrow —\n * gets the logprobs and token ids at all. A field carried only in the escrow is\n * not an interchange field.\n */\nfunction applySpanMetrics(step: HarborStep, span: RolloutStep | undefined): void {\n  if (span === undefined) return\n  if (span.llm_call_count !== undefined) step.llm_call_count = span.llm_call_count\n  const metrics: HarborMetrics = {}\n  if (span.prompt_token_ids !== undefined) metrics.prompt_token_ids = span.prompt_token_ids\n  if (span.completion_token_ids !== undefined) {\n    metrics.completion_token_ids = span.completion_token_ids\n  }\n  if (span.logprobs !== undefined) metrics.logprobs = span.logprobs\n  if (Object.keys(metrics).length > 0) step.metrics = metrics\n}\n\n/**\n * Coalescing fold, not a 1:1 map: ATIF has no `tool` source, so a tool result\n * becomes an `observation.results[]` entry on the agent step THAT DECLARED ITS\n * `tool_call_id`.\n *\n * Linking by id, not by adjacency. Adjacency emitted invalid documents in three\n * shapes the RFC forbids — an assistant turn with no `tool_calls` swallowing the\n * results that followed it, a result whose id matched none of the preceding\n * step's calls, and an unanswered result riding a `system` step that carried a\n * `source_call_id` it could never declare. Attaching only to the step that owns\n * the id also preserves message order exactly: a result either joins the step\n * immediately before it or becomes its own carrier at its own position.\n *\n * `line.steps` span projections are matched to agent steps in order (k-th llm\n * span → k-th agent step) purely to fill ATIF's native per-step `metrics`;\n * extra spans on either side are simply not matched, never invented.\n */\nfunction messagesToSteps(line: RolloutLine): HarborStep[] {\n  const steps: HarborStep[] = []\n  const llmSpans = (line.steps ?? []).filter((span) => span.kind === 'llm')\n  let nextSpan = 0\n  for (const message of line.messages) {\n    if (message.role === 'tool') {\n      const previous = steps[steps.length - 1]\n      if (previous !== undefined && declaresCall(previous, message.tool_call_id)) {\n        if (previous.observation === undefined) previous.observation = { results: [] }\n        previous.observation.results.push(toObservationResult(message, true))\n        continue\n      }\n      // A tool result answering no assistant turn in this document (truncated or\n      // reconstructed transcript). It still has to survive, so it rides a marked\n      // carrier step whose observation states no call id.\n      const carrier: HarborStep = {\n        step_id: steps.length + 1,\n        source: 'system',\n        message: '',\n        observation: { results: [toObservationResult(message, false)] },\n        extra: { [ESCROW]: { synthetic: TOOL_RESULTS_ONLY } },\n      }\n      if (message.is_copied_context === true) carrier.is_copied_context = true\n      steps.push(carrier)\n      continue\n    }\n    const step: HarborStep = {\n      step_id: steps.length + 1,\n      source: message.role === 'assistant' ? 'agent' : message.role,\n      message: message.content ?? '',\n    }\n    const escrow: Record<string, unknown> = {}\n    if (message.content === null) escrow.content_null = true\n    if (message.name !== undefined) escrow.name = message.name\n    if (message.role === 'assistant') {\n      if (line.policy.model !== null) step.model_name = line.policy.model\n      if (message.reasoning_content !== undefined) {\n        step.reasoning_content = message.reasoning_content\n      }\n      if (message.tool_calls !== undefined && message.tool_calls.length > 0) {\n        step.tool_calls = message.tool_calls.map(toHarborToolCall)\n      }\n      applySpanMetrics(step, llmSpans[nextSpan])\n      nextSpan += 1\n    } else if (message.reasoning_content !== undefined) {\n      // ATIF confines `reasoning_content` to agent steps; ours is not confined.\n      escrow.reasoning_content = message.reasoning_content\n    }\n    // RFC 0001 rule 7: a copied-context turn was not authored by this agent, and\n    // an SFT pipeline MUST exclude it. Native ATIF field, both directions.\n    if (message.is_copied_context === true) step.is_copied_context = true\n    if (Object.keys(escrow).length > 0) step.extra = { [ESCROW]: escrow }\n    steps.push(step)\n  }\n  return steps\n}\n\nfunction finalMetricsOf(line: RolloutLine, stepCount: number): HarborFinalMetrics {\n  const metrics: HarborFinalMetrics = {}\n  if (line.cost.tokens_in !== null) metrics.total_prompt_tokens = line.cost.tokens_in\n  if (line.cost.tokens_out !== null) metrics.total_completion_tokens = line.cost.tokens_out\n  if (line.cost.cache_read !== null) metrics.total_cached_tokens = line.cost.cache_read\n  // Omitted, never 0, when cost was not captured — a fake 0 is a lie about spend.\n  if (line.cost.usd !== null) metrics.total_cost_usd = line.cost.usd\n  metrics.total_steps = stepCount\n  // ATIF has no aggregate field for these three; `reasoning_tokens` under\n  // `extra` is the key the RFC's own worked example uses.\n  const extra: Record<string, unknown> = {}\n  if (line.cost.tokens_reasoning !== null) extra.reasoning_tokens = line.cost.tokens_reasoning\n  if (line.cost.cache_write !== null) extra.cache_write_tokens = line.cost.cache_write\n  if (line.cost.wall_s !== null) extra.wall_s = line.cost.wall_s\n  if (line.cost.llm_call_count !== undefined && line.cost.llm_call_count !== null) {\n    extra.llm_call_count = line.cost.llm_call_count\n  }\n  if (Object.keys(extra).length > 0) metrics.extra = extra\n  return metrics\n}\n\nfunction notesOf(line: RolloutLine): string | undefined {\n  const parts: string[] = []\n  if (line.provenance.gap !== undefined) parts.push(line.provenance.gap)\n  if (line.outcome.realness_gated === true) {\n    // ATIF has no gate field. A third-party consumer that ignores `extra`\n    // would otherwise see a gamed trajectory with nothing marking it, so the\n    // flag is stated in prose as well. This export carries no reward at all,\n    // so it is not a training-data door — but it is an audit record.\n    parts.push('realness-gated: this run faked its success signal (anti-Goodhart gate fired)')\n  }\n  return parts.length > 0 ? parts.join(' | ') : undefined\n}\n\nfunction toTrajectoryNode(line: RolloutLine): HarborTrajectory {\n  const steps = messagesToSteps(line)\n  const trajectory: HarborTrajectory = {\n    schema_version: ATIF_SCHEMA_VERSION,\n    // RUN-scoped, per the spec — so it is `run_id`, the coordinate every\n    // invocation of one run shares. `rollout_id` identifies a single\n    // invocation: using it gave two roots of the same run different session\n    // ids, and foreign tooling that groups by session_id would split the run.\n    session_id: line.run_id,\n    trajectory_id: line.rollout_id,\n    agent: {\n      // ATIF requires both; ours are nullable, so a null is substituted here\n      // and restored on import from the escrowed policy — never guessed back.\n      name: line.policy.harness ?? 'unknown',\n      version: line.policy.harness_version ?? '0.0.0',\n      ...(line.policy.model !== null ? { model_name: line.policy.model } : {}),\n      ...(line.tool_defs.length > 0 ? { tool_definitions: line.tool_defs } : {}),\n    },\n    steps,\n    final_metrics: finalMetricsOf(line, steps.length),\n    extra: {\n      [ESCROW]: {\n        schema: line.schema,\n        rollout_id: line.rollout_id,\n        parent_rollout_id: line.parent_rollout_id,\n        run_id: line.run_id,\n        ...(line.experiment_id !== undefined ? { experiment_id: line.experiment_id } : {}),\n        ...(line.candidate_id !== undefined ? { candidate_id: line.candidate_id } : {}),\n        generation: line.generation,\n        candidate_index: line.candidate_index,\n        role: line.role,\n        task: line.task,\n        policy: line.policy,\n        // Span projections overlap the same turns as `steps[]`; folding them\n        // into ATIF steps would double-count the run, so they stay escrowed.\n        ...(line.steps !== undefined ? { spans: line.steps } : {}),\n        outcome: {\n          // reward / reward_source / verdict are deliberately absent — see the\n          // module header. Only the non-scalar outcome fields travel.\n          metrics: line.outcome.metrics,\n          is_completed: line.outcome.is_completed,\n          is_truncated: line.outcome.is_truncated,\n          error: line.outcome.error,\n          ...(line.outcome.realness_gated !== undefined\n            ? { realness_gated: line.outcome.realness_gated }\n            : {}),\n        },\n        artifacts: line.artifacts,\n        provenance: line.provenance,\n      },\n    },\n  }\n  const notes = notesOf(line)\n  if (notes !== undefined) trajectory.notes = notes\n  return trajectory\n}\n\ninterface Forest {\n  roots: RolloutLine[]\n  childrenOf: Map<string, RolloutLine[]>\n}\n\nfunction buildForest(lines: RolloutLine[]): Forest {\n  const byId = new Map<string, RolloutLine>()\n  for (const line of lines) {\n    if (byId.has(line.rollout_id)) {\n      throw new Error(`duplicate rollout_id in input: ${line.rollout_id}`)\n    }\n    byId.set(line.rollout_id, line)\n  }\n  const roots: RolloutLine[] = []\n  const childrenOf = new Map<string, RolloutLine[]>()\n  for (const line of lines) {\n    const parent = line.parent_rollout_id\n    // A parent outside this set is a root OF WHAT WE HAVE: the edge is kept in\n    // escrow so a later import restores the dangling pointer instead of nulling it.\n    if (parent === null || !byId.has(parent)) {\n      roots.push(line)\n      continue\n    }\n    const siblings = childrenOf.get(parent)\n    if (siblings === undefined) childrenOf.set(parent, [line])\n    else siblings.push(line)\n  }\n  // Every line has a parent inside the set: the edges form a cycle with no\n  // root. Returning zero documents would drop the whole episode silently.\n  if (lines.length > 0 && roots.length === 0) {\n    throw new Error(\n      `parent_rollout_id cycle: no root among ${lines.length} lines (${lines.map((l) => l.rollout_id).join(', ')})`,\n    )\n  }\n  return { roots, childrenOf }\n}\n\nfunction assemble(line: RolloutLine, forest: Forest, onPath: Set<string>): HarborTrajectory {\n  if (onPath.has(line.rollout_id)) {\n    throw new Error(`parent_rollout_id cycle through rollout_id ${line.rollout_id}`)\n  }\n  onPath.add(line.rollout_id)\n  const node = toTrajectoryNode(line)\n  const children = forest.childrenOf.get(line.rollout_id)\n  if (children !== undefined && children.length > 0) {\n    node.subagent_trajectories = children.map((child) => assemble(child, forest, onPath))\n  }\n  onPath.delete(line.rollout_id)\n  return node\n}\n\n/**\n * Assemble one episode's flat lines into a single ATIF trajectory tree,\n * linked by `parent_rollout_id`.\n *\n * Reward, verdict and split are NOT emitted (ATIF models none of them); the\n * split and the rest of the task coordinates survive only in `extra.tangle`.\n *\n * We deliberately do NOT synthesize an `observation.subagent_trajectory_ref`\n * pointing at each child: our ledger records WHICH invocation spawned a\n * worker, not which STEP did, and attaching the ref to a guessed step would\n * fabricate a causal claim. Children are embedded in `subagent_trajectories`\n * (each with the `trajectory_id` the spec requires) and the edge is stated in\n * the child's escrowed `parent_rollout_id`.\n *\n * Throws when the lines are not one tree — use `toHarborTrajectories` for a forest.\n */\nexport function toHarborTrajectory(lines: RolloutLine[]): HarborTrajectory {\n  const trees = toHarborTrajectories(lines)\n  if (trees.length === 0) throw new Error('toHarborTrajectory: no lines')\n  if (trees.length > 1) {\n    const ids = trees.map((t) => t.trajectory_id ?? '?').join(', ')\n    throw new Error(\n      `toHarborTrajectory: ${trees.length} roots (${ids}) — ATIF is one tree per document; use toHarborTrajectories`,\n    )\n  }\n  return trees[0]!\n}\n\n/** Every independent tree in the input, one ATIF document each. */\nexport function toHarborTrajectories(lines: RolloutLine[]): HarborTrajectory[] {\n  const forest = buildForest(lines)\n  return forest.roots.map((root) => assemble(root, forest, new Set()))\n}\n\n// ---------------------------------------------------------------------------\n// Import: ATIF trajectory tree → RolloutLine[]\n// ---------------------------------------------------------------------------\n\nfunction contentToString(message: string | HarborContentPart[]): string {\n  if (typeof message === 'string') return message\n  return message\n    .map((part) =>\n      part.type === 'image'\n        ? // Our chat content is text-only. Describing the image is honest about\n          // what the source held; dropping it silently would not be.\n          `[image ${part.source?.media_type ?? 'unknown'} ${part.source?.path ?? ''}]`.trim()\n        : (part.text ?? ''),\n    )\n    .join('\\n')\n}\n\nfunction fromHarborToolCall(call: HarborToolCall): ChatToolCall {\n  const raw = asString(escrowOf(call.extra)?.arguments_raw)\n  return {\n    id: call.tool_call_id,\n    type: 'function',\n    function: { name: call.function_name, arguments: raw ?? JSON.stringify(call.arguments ?? {}) },\n  }\n}\n\nfunction fromObservationResult(\n  result: HarborObservationResult,\n  callId: string | undefined,\n): ChatMessage {\n  const escrow = escrowOf(result.extra)\n  return canonicalChatMessage({\n    role: 'tool',\n    content:\n      escrow?.content_null === true\n        ? null\n        : result.content === undefined\n          ? ''\n          : contentToString(result.content),\n    reasoning_content: asString(escrow?.reasoning_content),\n    tool_call_id: callId,\n    name: asString(escrow?.name),\n    is_copied_context: escrow?.is_copied_context === true,\n  })\n}\n\nfunction stepsToMessages(steps: HarborStep[]): ChatMessage[] {\n  const messages: ChatMessage[] = []\n  for (const step of steps) {\n    const escrow = escrowOf(step.extra)\n    const carrierOnly = escrow?.synthetic === TOOL_RESULTS_ONLY\n    if (!carrierOnly) {\n      messages.push(\n        canonicalChatMessage({\n          role: step.source === 'agent' ? 'assistant' : step.source,\n          content: escrow?.content_null === true ? null : contentToString(step.message),\n          reasoning_content: step.reasoning_content ?? asString(escrow?.reasoning_content),\n          tool_calls:\n            step.tool_calls !== undefined && step.tool_calls.length > 0\n              ? step.tool_calls.map(fromHarborToolCall)\n              : undefined,\n          name: asString(escrow?.name),\n          is_copied_context: step.is_copied_context === true,\n        }),\n      )\n    }\n    for (const result of step.observation?.results ?? []) {\n      const resultEscrow = escrowOf(result.extra)\n      const callId = result.source_call_id ?? asString(resultEscrow?.source_call_id)\n      if (carrierOnly) {\n        // Our own carrier: every result on it was a tool turn, and its call id\n        // (if the transcript had one) is in escrow, not on the wire.\n        messages.push(fromObservationResult(result, callId))\n        continue\n      }\n      if (typeof callId === 'string') {\n        messages.push(fromObservationResult(result, callId))\n        continue\n      }\n      // ATIF allows a result from a non-tool-calling action. Our chat schema\n      // requires `tool_call_id` on a tool turn, so inventing one would forge a\n      // link; the text is preserved as a system observation instead.\n      if (result.content !== undefined) {\n        messages.push(\n          canonicalChatMessage({ role: 'system', content: contentToString(result.content) }),\n        )\n      }\n    }\n  }\n  return messages\n}\n\nfunction taskFrom(escrow: Record<string, unknown> | undefined, fallbackId: string): RolloutTask {\n  const task = escrowSection(escrow, 'task')\n  return {\n    suite: asString(task?.suite) ?? 'harbor-atif-import',\n    instance_id: asString(task?.instance_id) ?? fallbackId,\n    // ALWAYS holdout — the escrowed claim is read for nothing here.\n    //\n    // `extra.tangle.task.split` is a namespaced key, not an authenticated one:\n    // a hand-written or third-party document can set `split: 'search'` as\n    // easily as our own exporter can, and honouring it made \"this file says so\"\n    // sufficient to walk into a training export. Trainability is a decision\n    // about a file, so it is made by an operator through\n    // `relabelImportedSplit`, never by the file about itself. The claim is not\n    // destroyed — it stays readable in the source document.\n    split: 'holdout',\n    seed: asNumberOrNull(task?.seed),\n    rep: asIntegerOrUndefined(task?.rep) ?? 0,\n  }\n}\n\nfunction policyFrom(\n  escrow: Record<string, unknown> | undefined,\n  agent: HarborAgent,\n): RolloutPolicy {\n  const escrowed = escrowSection(escrow, 'policy')\n  if (escrowed !== undefined) {\n    // Our own export: restore verbatim, including the nulls ATIF forced us to\n    // substitute placeholders for in `agent.name` / `agent.version`.\n    return {\n      harness: asString(escrowed.harness) ?? null,\n      harness_version: asString(escrowed.harness_version) ?? null,\n      model: asString(escrowed.model) ?? null,\n      provider: asString(escrowed.provider) ?? null,\n      profile_commit: asString(escrowed.profile_commit) ?? null,\n      ...(escrowed.prompt_hash !== undefined\n        ? { prompt_hash: asString(escrowed.prompt_hash) ?? null }\n        : {}),\n      ...(escrowed.config_hash !== undefined\n        ? { config_hash: asString(escrowed.config_hash) ?? null }\n        : {}),\n      ...(escrowed.agent_profile_cell_id !== undefined\n        ? { agent_profile_cell_id: asString(escrowed.agent_profile_cell_id) ?? null }\n        : {}),\n      sampling: isRecord(escrowed.sampling) ? escrowed.sampling : null,\n    }\n  }\n  return {\n    harness: agent.name,\n    harness_version: agent.version,\n    model: agent.model_name ?? null,\n    provider: null,\n    profile_commit: null,\n    sampling: null,\n  }\n}\n\nfunction artifactsFrom(escrow: Record<string, unknown> | undefined): RolloutArtifacts {\n  const artifacts = escrowSection(escrow, 'artifacts')\n  return {\n    patch_path: asString(artifacts?.patch_path) ?? null,\n    run_dir: asString(artifacts?.run_dir) ?? null,\n    transcript_ref: asString(artifacts?.transcript_ref) ?? null,\n  }\n}\n\nfunction costFrom(final: HarborFinalMetrics | undefined): RolloutCostBlock {\n  const rawExtra = final?.extra\n  const extra = isRecord(rawExtra) ? rawExtra : undefined\n  const calls = asIntegerOrUndefined(extra?.llm_call_count)\n  return {\n    usd: asNumberOrNull(final?.total_cost_usd),\n    tokens_in: asNumberOrNull(final?.total_prompt_tokens),\n    tokens_out: asNumberOrNull(final?.total_completion_tokens),\n    tokens_reasoning: asNumberOrNull(extra?.reasoning_tokens),\n    cache_read: asNumberOrNull(final?.total_cached_tokens),\n    cache_write: asNumberOrNull(extra?.cache_write_tokens),\n    wall_s: asNumberOrNull(extra?.wall_s),\n    ...(calls !== undefined ? { llm_call_count: calls } : {}),\n  }\n}\n\n/**\n * Recovers span projections from ATIF's NATIVE per-step channel, for documents\n * with no `extra.tangle.spans` escrow — i.e. everything a foreign producer\n * writes. Without this the logprobs and token ids a Harbor-native trainer\n * records would be read, validated, and then dropped on the floor.\n *\n * Only steps that actually carry one of the four fields produce a span: an\n * agent step with no metrics means \"not captured\", and inventing an empty span\n * for it would claim the run had a shape we did not observe.\n */\nfunction spansFromSteps(steps: HarborStep[]): RolloutStep[] {\n  const spans: RolloutStep[] = []\n  for (const step of steps) {\n    if (step.source !== 'agent') continue\n    const calls = asIntegerOrUndefined(step.llm_call_count)\n    const promptIds = asIntegerArray(step.metrics?.prompt_token_ids)\n    const completionIds = asIntegerArray(step.metrics?.completion_token_ids)\n    const logprobs = asNumberArray(step.metrics?.logprobs)\n    if (\n      calls === undefined &&\n      promptIds === undefined &&\n      completionIds === undefined &&\n      logprobs === undefined\n    ) {\n      continue\n    }\n    spans.push({\n      kind: 'llm',\n      name: step.model_name ?? 'chat',\n      ...(calls !== undefined ? { llm_call_count: calls } : {}),\n      ...(promptIds !== undefined ? { prompt_token_ids: promptIds } : {}),\n      ...(completionIds !== undefined ? { completion_token_ids: completionIds } : {}),\n      ...(logprobs !== undefined ? { logprobs } : {}),\n    })\n  }\n  return spans\n}\n\n/**\n * Composes `provenance.gap` as an ordered SET of reasons.\n *\n * Appending made the note accrete on every pass (\"…no verdict | …no verdict\"),\n * which both grows without bound and breaks byte-level idempotency for a ledger\n * hashed on its serialized lines.\n */\nfunction composeGap(escrowedGap: string | undefined, added: readonly string[]): string {\n  const parts: string[] = []\n  const seen = new Set<string>()\n  for (const raw of [...(escrowedGap?.split(' | ') ?? []), ...added]) {\n    const reason = raw.trim()\n    if (reason.length === 0 || seen.has(reason)) continue\n    seen.add(reason)\n    parts.push(reason)\n  }\n  return parts.join(' | ')\n}\n\nexport interface FromHarborOptions {\n  /** Injected clock for deterministic output when the source carries no capture time. */\n  now?: () => Date\n}\n\nfunction nodeToLine(\n  trajectory: HarborTrajectory,\n  parentId: string | null,\n  capturedAt: string,\n): RolloutLine {\n  const escrow = escrowOf(trajectory.extra)\n  const rolloutId =\n    asString(escrow?.rollout_id) ?? trajectory.trajectory_id ?? trajectory.session_id\n  if (rolloutId === undefined || rolloutId.length === 0) {\n    throw new Error(\n      'fromHarborTrajectory: trajectory has no trajectory_id or session_id — cannot mint a joinable rollout_id without inventing one',\n    )\n  }\n  const outcome = escrowSection(escrow, 'outcome')\n  const provenance = escrowSection(escrow, 'provenance')\n  const capture = provenance?.capture\n  const escrowedGap = asString(provenance?.gap)\n  const role = escrow?.role\n  const escrowedSpans = escrow?.spans\n  // The escrow wins when it exists (our own export: exact, including an empty\n  // array, which claims \"captured, none\" rather than \"not captured\"), and the\n  // native per-step channel is the fallback (a foreign export: still signal).\n  const nativeSpans = spansFromSteps(trajectory.steps)\n  const spans: RolloutStep[] | undefined = Array.isArray(escrowedSpans)\n    ? (escrowedSpans as RolloutStep[])\n    : nativeSpans.length > 0\n      ? nativeSpans\n      : undefined\n  const messages = stepsToMessages(trajectory.steps)\n  const line: RolloutLine = {\n    schema: ROLLOUT_SCHEMA,\n    rollout_id: rolloutId,\n    // The tree edge wins for embedded children; for a root, the escrowed\n    // pointer may reference a line outside this document and is preserved.\n    parent_rollout_id: parentId ?? asString(escrow?.parent_rollout_id) ?? null,\n    run_id: asString(escrow?.run_id) ?? trajectory.session_id ?? rolloutId,\n    // Required keys on the wire (0.127.0): a foreign document that never\n    // stated them imports as explicit `null`, not as an absent field.\n    experiment_id: asString(escrow?.experiment_id) ?? null,\n    candidate_id: asString(escrow?.candidate_id) ?? null,\n    generation: asIntegerOrUndefined(escrow?.generation) ?? null,\n    candidate_index: asIntegerOrUndefined(escrow?.candidate_index) ?? null,\n    role: ROLLOUT_ROLES.includes(role as RolloutRole) ? (role as RolloutRole) : 'agent',\n    task: taskFrom(escrow, rolloutId),\n    policy: policyFrom(escrow, trajectory.agent),\n    messages,\n    tool_defs: trajectory.agent.tool_definitions ?? [],\n    ...(spans !== undefined ? { steps: spans } : {}),\n    outcome: {\n      // ATIF carries no label. Null is the labeled gap; a 0 here would be a\n      // fabricated failure and a 1 a fabricated success.\n      reward: null,\n      reward_source: null,\n      verdict: null,\n      metrics: isRecord(outcome?.metrics) ? outcome.metrics : {},\n      is_completed: typeof outcome?.is_completed === 'boolean' ? outcome.is_completed : true,\n      is_truncated:\n        typeof outcome?.is_truncated === 'boolean'\n          ? outcome.is_truncated\n          : trajectory.continued_trajectory_ref !== undefined,\n      error: asString(outcome?.error) ?? null,\n      // The anti-Goodhart flag is restored when the source document stated\n      // it; the wire schema requires the field, so a document that never did\n      // imports as `false`. That is safe here because the reward is already\n      // forced to `null` (not trainable) and `realness_screened` stays\n      // absent = unknown rather than claiming a screen ran.\n      realness_gated: outcome?.realness_gated === true,\n    },\n    cost: costFrom(trajectory.final_metrics),\n    artifacts: artifactsFrom(escrow),\n    provenance: {\n      captured_at: asString(provenance?.captured_at) ?? capturedAt,\n      capture: ROLLOUT_CAPTURES.includes(capture as RolloutCapture)\n        ? (capture as RolloutCapture)\n        : 'backfill',\n      gap: composeGap(escrowedGap, [HARBOR_IMPORT_GAP]),\n      // Restored for the same reason `realness_gated` is, and with the opposite\n      // risk profile from the reward: this is the gated run's own measurement\n      // bag, moved off `outcome` by `gateGamedOutcome` so no exporter reads it\n      // as training input. Dropping it here would silently destroy the audit\n      // trail that says WHY the run was flagged and what it claimed, on the one\n      // population an auditor most wants to inspect. It cannot be fail-open —\n      // nothing projects `provenance` into a training row.\n      ...(isRecord(provenance?.gated_evidence)\n        ? { gated_evidence: provenance.gated_evidence as GatedEvidence }\n        : {}),\n    },\n  }\n  assertRolloutLine(line, `rollout line imported from ATIF trajectory ${rolloutId}`)\n  return line\n}\n\n/**\n * Flatten an ATIF trajectory tree back into `tangle.rollout.v1` lines, parent\n * first, each child carrying `parent_rollout_id`.\n *\n * Every line comes back UNLABELED: `reward`, `reward_source` and `verdict` are\n * null and `provenance.gap` says why. ATIF models no verdict, so scoring an\n * imported trajectory is a judge's job, not this function's. Every line lands\n * on `holdout` whatever the document claims — see `relabelImportedSplit`.\n */\nexport function fromHarborTrajectory(\n  trajectory: HarborTrajectory,\n  options: FromHarborOptions = {},\n): RolloutLine[] {\n  const capturedAt = (options.now?.() ?? new Date()).toISOString()\n  const lines: RolloutLine[] = []\n  const walk = (node: HarborTrajectory, parentId: string | null, onPath: Set<string>): void => {\n    const line = nodeToLine(node, parentId, capturedAt)\n    if (onPath.has(line.rollout_id)) {\n      throw new Error(`subagent_trajectories cycle through trajectory_id ${line.rollout_id}`)\n    }\n    onPath.add(line.rollout_id)\n    lines.push(line)\n    for (const child of node.subagent_trajectories ?? []) {\n      walk(child, line.rollout_id, onPath)\n    }\n    onPath.delete(line.rollout_id)\n  }\n  walk(trajectory, null, new Set())\n  return lines\n}\n\n/**\n * THE explicit door out of `holdout` for imported lines.\n *\n * Import forces `holdout` because a document's own claim about its split is not\n * evidence — anyone can write `extra.tangle.task.split`. Promoting a file to a\n * trainable split is an operator's decision about provenance they verified, so\n * it is a separate, greppable call: `grep relabelImportedSplit` enumerates\n * every place foreign data was declared trainable, which is exactly the audit\n * the trusted-escrow version made impossible.\n *\n * Returns plain `RolloutLine`s. They still have to pass `assertMinted` (and its\n * anti-Goodhart check) to reach an exporter — re-labeling a split is not\n * minting a reward.\n */\nexport function relabelImportedSplit(\n  lines: readonly RolloutLine[],\n  split: RolloutSplit,\n): RolloutLine[] {\n  if (!ROLLOUT_SPLITS.includes(split)) {\n    throw new Error(`relabelImportedSplit: unknown split ${String(split)}`)\n  }\n  return lines.map((line) => ({ ...line, task: { ...line.task, split } }))\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiFA,MAAa,sBAAsB;;AAGnC,MAAa,oBAAoB;;AAGjC,MAAM,SAAS;;;;;;;;;;;;;;AAef,MAAM,oBAAoB;AA8G1B,MAAM,YAAY,MAChB,OAAO,MAAM,YAAY,MAAM,QAAQ,CAAC,MAAM,QAAQ,CAAC;AAEzD,MAAM,YAAY,MAAoC,OAAO,MAAM,WAAW,IAAI,KAAA;AAElF,MAAM,kBAAkB,MACtB,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,IAAI,IAAI;AAEpD,MAAM,wBAAwB,MAC5B,OAAO,UAAU,CAAC,IAAK,IAAe,KAAA;AAExC,MAAM,iBAAiB,MACrB,MAAM,QAAQ,CAAC,KAAK,EAAE,OAAO,MAAM,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,CAAC,IACzE,IACD,KAAA;AAEN,MAAM,kBAAkB,MACtB,MAAM,QAAQ,CAAC,KAAK,EAAE,OAAO,MAAM,OAAO,UAAU,CAAC,CAAC,IAAK,IAAiB,KAAA;;;;;;;;;AAU9E,SAAS,qBAAqB,OAQd;CACd,MAAM,UAAuB;EAAE,MAAM,MAAM;EAAM,SAAS,MAAM;CAAQ;CACxE,IAAI,MAAM,sBAAsB,KAAA,GAAW,QAAQ,oBAAoB,MAAM;CAC7E,IAAI,MAAM,eAAe,KAAA,GAAW,QAAQ,aAAa,MAAM;CAC/D,IAAI,MAAM,iBAAiB,KAAA,GAAW,QAAQ,eAAe,MAAM;CACnE,IAAI,MAAM,SAAS,KAAA,GAAW,QAAQ,OAAO,MAAM;CACnD,IAAI,MAAM,sBAAsB,MAAM,QAAQ,oBAAoB;CAClE,OAAO;AACT;;AAGA,SAAS,SAAS,OAAiF;CACjG,IAAI,CAAC,SAAS,KAAK,GAAG,OAAO,KAAA;CAC7B,MAAM,QAAQ,MAAM;CACpB,OAAO,SAAS,KAAK,IAAI,QAAQ,KAAA;AACnC;AAEA,SAAS,cACP,QACA,KACqC;CACrC,IAAI,WAAW,KAAA,GAAW,OAAO,KAAA;CACjC,MAAM,QAAQ,OAAO;CACrB,OAAO,SAAS,KAAK,IAAI,QAAQ,KAAA;AACnC;AAMA,SAAS,iBAAiB,MAAoC;CAK5D,IAAI;CACJ,IAAI;EACF,MAAM,UAAmB,KAAK,MAAM,KAAK,SAAS,SAAS;EAC3D,IAAI,SAAS,OAAO,GAAG,SAAS;CAClC,QAAQ;EACN,SAAS,KAAA;CACX;CACA,OAAO;EACL,cAAc,KAAK;EACnB,eAAe,KAAK,SAAS;EAC7B,WAAW,UAAU,CAAC;EACtB,OAAO,GAAG,SAAS,EAAE,eAAe,KAAK,SAAS,UAAU,EAAE;CAChE;AACF;;;;;;AAOA,SAAS,oBAAoB,SAAsB,QAA0C;CAC3F,MAAM,SAAkC,CAAC;CACzC,IAAI,UAAU,QAAQ,iBAAiB,KAAA,GAAW,OAAO,iBAAiB,QAAQ;CAClF,IAAI,QAAQ,YAAY,MAAM,OAAO,UAAU,QAAQ;CACvD,MAAM,SAAkC,CAAC;CACzC,IAAI,CAAC,UAAU,QAAQ,iBAAiB,KAAA,GAAW,OAAO,iBAAiB,QAAQ;CACnF,IAAI,QAAQ,SAAS,KAAA,GAAW,OAAO,OAAO,QAAQ;CAGtD,IAAI,QAAQ,YAAY,MAAM,OAAO,eAAe;CACpD,IAAI,QAAQ,sBAAsB,KAAA,GAAW,OAAO,oBAAoB,QAAQ;CAChF,IAAI,QAAQ,sBAAsB,MAAM,OAAO,oBAAoB;CACnE,IAAI,OAAO,KAAK,MAAM,CAAC,CAAC,SAAS,GAAG,OAAO,QAAQ,GAAG,SAAS,OAAO;CACtE,OAAO;AACT;;AAGA,SAAS,aAAa,MAAkB,QAAqC;CAC3E,IAAI,WAAW,KAAA,GAAW,OAAO;CACjC,OAAO,KAAK,YAAY,MAAM,SAAS,KAAK,iBAAiB,MAAM,MAAM;AAC3E;;;;;;;;;AAUA,SAAS,iBAAiB,MAAkB,MAAqC;CAC/E,IAAI,SAAS,KAAA,GAAW;CACxB,IAAI,KAAK,mBAAmB,KAAA,GAAW,KAAK,iBAAiB,KAAK;CAClE,MAAM,UAAyB,CAAC;CAChC,IAAI,KAAK,qBAAqB,KAAA,GAAW,QAAQ,mBAAmB,KAAK;CACzE,IAAI,KAAK,yBAAyB,KAAA,GAChC,QAAQ,uBAAuB,KAAK;CAEtC,IAAI,KAAK,aAAa,KAAA,GAAW,QAAQ,WAAW,KAAK;CACzD,IAAI,OAAO,KAAK,OAAO,CAAC,CAAC,SAAS,GAAG,KAAK,UAAU;AACtD;;;;;;;;;;;;;;;;;;AAmBA,SAAS,gBAAgB,MAAiC;CACxD,MAAM,QAAsB,CAAC;CAC7B,MAAM,YAAY,KAAK,SAAS,CAAC,EAAA,CAAG,QAAQ,SAAS,KAAK,SAAS,KAAK;CACxE,IAAI,WAAW;CACf,KAAK,MAAM,WAAW,KAAK,UAAU;EACnC,IAAI,QAAQ,SAAS,QAAQ;GAC3B,MAAM,WAAW,MAAM,MAAM,SAAS;GACtC,IAAI,aAAa,KAAA,KAAa,aAAa,UAAU,QAAQ,YAAY,GAAG;IAC1E,IAAI,SAAS,gBAAgB,KAAA,GAAW,SAAS,cAAc,EAAE,SAAS,CAAC,EAAE;IAC7E,SAAS,YAAY,QAAQ,KAAK,oBAAoB,SAAS,IAAI,CAAC;IACpE;GACF;GAIA,MAAM,UAAsB;IAC1B,SAAS,MAAM,SAAS;IACxB,QAAQ;IACR,SAAS;IACT,aAAa,EAAE,SAAS,CAAC,oBAAoB,SAAS,KAAK,CAAC,EAAE;IAC9D,OAAO,GAAG,SAAS,EAAE,WAAW,kBAAkB,EAAE;GACtD;GACA,IAAI,QAAQ,sBAAsB,MAAM,QAAQ,oBAAoB;GACpE,MAAM,KAAK,OAAO;GAClB;EACF;EACA,MAAM,OAAmB;GACvB,SAAS,MAAM,SAAS;GACxB,QAAQ,QAAQ,SAAS,cAAc,UAAU,QAAQ;GACzD,SAAS,QAAQ,WAAW;EAC9B;EACA,MAAM,SAAkC,CAAC;EACzC,IAAI,QAAQ,YAAY,MAAM,OAAO,eAAe;EACpD,IAAI,QAAQ,SAAS,KAAA,GAAW,OAAO,OAAO,QAAQ;EACtD,IAAI,QAAQ,SAAS,aAAa;GAChC,IAAI,KAAK,OAAO,UAAU,MAAM,KAAK,aAAa,KAAK,OAAO;GAC9D,IAAI,QAAQ,sBAAsB,KAAA,GAChC,KAAK,oBAAoB,QAAQ;GAEnC,IAAI,QAAQ,eAAe,KAAA,KAAa,QAAQ,WAAW,SAAS,GAClE,KAAK,aAAa,QAAQ,WAAW,IAAI,gBAAgB;GAE3D,iBAAiB,MAAM,SAAS,SAAS;GACzC,YAAY;EACd,OAAO,IAAI,QAAQ,sBAAsB,KAAA,GAEvC,OAAO,oBAAoB,QAAQ;EAIrC,IAAI,QAAQ,sBAAsB,MAAM,KAAK,oBAAoB;EACjE,IAAI,OAAO,KAAK,MAAM,CAAC,CAAC,SAAS,GAAG,KAAK,QAAQ,GAAG,SAAS,OAAO;EACpE,MAAM,KAAK,IAAI;CACjB;CACA,OAAO;AACT;AAEA,SAAS,eAAe,MAAmB,WAAuC;CAChF,MAAM,UAA8B,CAAC;CACrC,IAAI,KAAK,KAAK,cAAc,MAAM,QAAQ,sBAAsB,KAAK,KAAK;CAC1E,IAAI,KAAK,KAAK,eAAe,MAAM,QAAQ,0BAA0B,KAAK,KAAK;CAC/E,IAAI,KAAK,KAAK,eAAe,MAAM,QAAQ,sBAAsB,KAAK,KAAK;CAE3E,IAAI,KAAK,KAAK,QAAQ,MAAM,QAAQ,iBAAiB,KAAK,KAAK;CAC/D,QAAQ,cAAc;CAGtB,MAAM,QAAiC,CAAC;CACxC,IAAI,KAAK,KAAK,qBAAqB,MAAM,MAAM,mBAAmB,KAAK,KAAK;CAC5E,IAAI,KAAK,KAAK,gBAAgB,MAAM,MAAM,qBAAqB,KAAK,KAAK;CACzE,IAAI,KAAK,KAAK,WAAW,MAAM,MAAM,SAAS,KAAK,KAAK;CACxD,IAAI,KAAK,KAAK,mBAAmB,KAAA,KAAa,KAAK,KAAK,mBAAmB,MACzE,MAAM,iBAAiB,KAAK,KAAK;CAEnC,IAAI,OAAO,KAAK,KAAK,CAAC,CAAC,SAAS,GAAG,QAAQ,QAAQ;CACnD,OAAO;AACT;AAEA,SAAS,QAAQ,MAAuC;CACtD,MAAM,QAAkB,CAAC;CACzB,IAAI,KAAK,WAAW,QAAQ,KAAA,GAAW,MAAM,KAAK,KAAK,WAAW,GAAG;CACrE,IAAI,KAAK,QAAQ,mBAAmB,MAKlC,MAAM,KAAK,8EAA8E;CAE3F,OAAO,MAAM,SAAS,IAAI,MAAM,KAAK,KAAK,IAAI,KAAA;AAChD;AAEA,SAAS,iBAAiB,MAAqC;CAC7D,MAAM,QAAQ,gBAAgB,IAAI;CAClC,MAAM,aAA+B;EACnC,gBAAgB;EAKhB,YAAY,KAAK;EACjB,eAAe,KAAK;EACpB,OAAO;GAGL,MAAM,KAAK,OAAO,WAAW;GAC7B,SAAS,KAAK,OAAO,mBAAmB;GACxC,GAAI,KAAK,OAAO,UAAU,OAAO,EAAE,YAAY,KAAK,OAAO,MAAM,IAAI,CAAC;GACtE,GAAI,KAAK,UAAU,SAAS,IAAI,EAAE,kBAAkB,KAAK,UAAU,IAAI,CAAC;EAC1E;EACA;EACA,eAAe,eAAe,MAAM,MAAM,MAAM;EAChD,OAAO,GACJ,SAAS;GACR,QAAQ,KAAK;GACb,YAAY,KAAK;GACjB,mBAAmB,KAAK;GACxB,QAAQ,KAAK;GACb,GAAI,KAAK,kBAAkB,KAAA,IAAY,EAAE,eAAe,KAAK,cAAc,IAAI,CAAC;GAChF,GAAI,KAAK,iBAAiB,KAAA,IAAY,EAAE,cAAc,KAAK,aAAa,IAAI,CAAC;GAC7E,YAAY,KAAK;GACjB,iBAAiB,KAAK;GACtB,MAAM,KAAK;GACX,MAAM,KAAK;GACX,QAAQ,KAAK;GAGb,GAAI,KAAK,UAAU,KAAA,IAAY,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC;GACxD,SAAS;IAGP,SAAS,KAAK,QAAQ;IACtB,cAAc,KAAK,QAAQ;IAC3B,cAAc,KAAK,QAAQ;IAC3B,OAAO,KAAK,QAAQ;IACpB,GAAI,KAAK,QAAQ,mBAAmB,KAAA,IAChC,EAAE,gBAAgB,KAAK,QAAQ,eAAe,IAC9C,CAAC;GACP;GACA,WAAW,KAAK;GAChB,YAAY,KAAK;EACnB,EACF;CACF;CACA,MAAM,QAAQ,QAAQ,IAAI;CAC1B,IAAI,UAAU,KAAA,GAAW,WAAW,QAAQ;CAC5C,OAAO;AACT;AAOA,SAAS,YAAY,OAA8B;CACjD,MAAM,uBAAO,IAAI,IAAyB;CAC1C,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,IAAI,KAAK,UAAU,GAC1B,MAAM,IAAI,MAAM,kCAAkC,KAAK,YAAY;EAErE,KAAK,IAAI,KAAK,YAAY,IAAI;CAChC;CACA,MAAM,QAAuB,CAAC;CAC9B,MAAM,6BAAa,IAAI,IAA2B;CAClD,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,SAAS,KAAK;EAGpB,IAAI,WAAW,QAAQ,CAAC,KAAK,IAAI,MAAM,GAAG;GACxC,MAAM,KAAK,IAAI;GACf;EACF;EACA,MAAM,WAAW,WAAW,IAAI,MAAM;EACtC,IAAI,aAAa,KAAA,GAAW,WAAW,IAAI,QAAQ,CAAC,IAAI,CAAC;OACpD,SAAS,KAAK,IAAI;CACzB;CAGA,IAAI,MAAM,SAAS,KAAK,MAAM,WAAW,GACvC,MAAM,IAAI,MACR,0CAA0C,MAAM,OAAO,UAAU,MAAM,KAAK,MAAM,EAAE,UAAU,CAAC,CAAC,KAAK,IAAI,EAAE,EAC7G;CAEF,OAAO;EAAE;EAAO;CAAW;AAC7B;AAEA,SAAS,SAAS,MAAmB,QAAgB,QAAuC;CAC1F,IAAI,OAAO,IAAI,KAAK,UAAU,GAC5B,MAAM,IAAI,MAAM,8CAA8C,KAAK,YAAY;CAEjF,OAAO,IAAI,KAAK,UAAU;CAC1B,MAAM,OAAO,iBAAiB,IAAI;CAClC,MAAM,WAAW,OAAO,WAAW,IAAI,KAAK,UAAU;CACtD,IAAI,aAAa,KAAA,KAAa,SAAS,SAAS,GAC9C,KAAK,wBAAwB,SAAS,KAAK,UAAU,SAAS,OAAO,QAAQ,MAAM,CAAC;CAEtF,OAAO,OAAO,KAAK,UAAU;CAC7B,OAAO;AACT;;;;;;;;;;;;;;;;;AAkBA,SAAgB,mBAAmB,OAAwC;CACzE,MAAM,QAAQ,qBAAqB,KAAK;CACxC,IAAI,MAAM,WAAW,GAAG,MAAM,IAAI,MAAM,8BAA8B;CACtE,IAAI,MAAM,SAAS,GAAG;EACpB,MAAM,MAAM,MAAM,KAAK,MAAM,EAAE,iBAAiB,GAAG,CAAC,CAAC,KAAK,IAAI;EAC9D,MAAM,IAAI,MACR,uBAAuB,MAAM,OAAO,UAAU,IAAI,4DACpD;CACF;CACA,OAAO,MAAM;AACf;;AAGA,SAAgB,qBAAqB,OAA0C;CAC7E,MAAM,SAAS,YAAY,KAAK;CAChC,OAAO,OAAO,MAAM,KAAK,SAAS,SAAS,MAAM,wBAAQ,IAAI,IAAI,CAAC,CAAC;AACrE;AAMA,SAAS,gBAAgB,SAA+C;CACtE,IAAI,OAAO,YAAY,UAAU,OAAO;CACxC,OAAO,QACJ,KAAK,SACJ,KAAK,SAAS,UAGV,UAAU,KAAK,QAAQ,cAAc,UAAU,GAAG,KAAK,QAAQ,QAAQ,GAAG,GAAG,KAAK,IACjF,KAAK,QAAQ,EACpB,CAAC,CACA,KAAK,IAAI;AACd;AAEA,SAAS,mBAAmB,MAAoC;CAC9D,MAAM,MAAM,SAAS,SAAS,KAAK,KAAK,CAAC,EAAE,aAAa;CACxD,OAAO;EACL,IAAI,KAAK;EACT,MAAM;EACN,UAAU;GAAE,MAAM,KAAK;GAAe,WAAW,OAAO,KAAK,UAAU,KAAK,aAAa,CAAC,CAAC;EAAE;CAC/F;AACF;AAEA,SAAS,sBACP,QACA,QACa;CACb,MAAM,SAAS,SAAS,OAAO,KAAK;CACpC,OAAO,qBAAqB;EAC1B,MAAM;EACN,SACE,QAAQ,iBAAiB,OACrB,OACA,OAAO,YAAY,KAAA,IACjB,KACA,gBAAgB,OAAO,OAAO;EACtC,mBAAmB,SAAS,QAAQ,iBAAiB;EACrD,cAAc;EACd,MAAM,SAAS,QAAQ,IAAI;EAC3B,mBAAmB,QAAQ,sBAAsB;CACnD,CAAC;AACH;AAEA,SAAS,gBAAgB,OAAoC;CAC3D,MAAM,WAA0B,CAAC;CACjC,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,SAAS,SAAS,KAAK,KAAK;EAClC,MAAM,cAAc,QAAQ,cAAc;EAC1C,IAAI,CAAC,aACH,SAAS,KACP,qBAAqB;GACnB,MAAM,KAAK,WAAW,UAAU,cAAc,KAAK;GACnD,SAAS,QAAQ,iBAAiB,OAAO,OAAO,gBAAgB,KAAK,OAAO;GAC5E,mBAAmB,KAAK,qBAAqB,SAAS,QAAQ,iBAAiB;GAC/E,YACE,KAAK,eAAe,KAAA,KAAa,KAAK,WAAW,SAAS,IACtD,KAAK,WAAW,IAAI,kBAAkB,IACtC,KAAA;GACN,MAAM,SAAS,QAAQ,IAAI;GAC3B,mBAAmB,KAAK,sBAAsB;EAChD,CAAC,CACH;EAEF,KAAK,MAAM,UAAU,KAAK,aAAa,WAAW,CAAC,GAAG;GACpD,MAAM,eAAe,SAAS,OAAO,KAAK;GAC1C,MAAM,SAAS,OAAO,kBAAkB,SAAS,cAAc,cAAc;GAC7E,IAAI,aAAa;IAGf,SAAS,KAAK,sBAAsB,QAAQ,MAAM,CAAC;IACnD;GACF;GACA,IAAI,OAAO,WAAW,UAAU;IAC9B,SAAS,KAAK,sBAAsB,QAAQ,MAAM,CAAC;IACnD;GACF;GAIA,IAAI,OAAO,YAAY,KAAA,GACrB,SAAS,KACP,qBAAqB;IAAE,MAAM;IAAU,SAAS,gBAAgB,OAAO,OAAO;GAAE,CAAC,CACnF;EAEJ;CACF;CACA,OAAO;AACT;AAEA,SAAS,SAAS,QAA6C,YAAiC;CAC9F,MAAM,OAAO,cAAc,QAAQ,MAAM;CACzC,OAAO;EACL,OAAO,SAAS,MAAM,KAAK,KAAK;EAChC,aAAa,SAAS,MAAM,WAAW,KAAK;EAU5C,OAAO;EACP,MAAM,eAAe,MAAM,IAAI;EAC/B,KAAK,qBAAqB,MAAM,GAAG,KAAK;CAC1C;AACF;AAEA,SAAS,WACP,QACA,OACe;CACf,MAAM,WAAW,cAAc,QAAQ,QAAQ;CAC/C,IAAI,aAAa,KAAA,GAGf,OAAO;EACL,SAAS,SAAS,SAAS,OAAO,KAAK;EACvC,iBAAiB,SAAS,SAAS,eAAe,KAAK;EACvD,OAAO,SAAS,SAAS,KAAK,KAAK;EACnC,UAAU,SAAS,SAAS,QAAQ,KAAK;EACzC,gBAAgB,SAAS,SAAS,cAAc,KAAK;EACrD,GAAI,SAAS,gBAAgB,KAAA,IACzB,EAAE,aAAa,SAAS,SAAS,WAAW,KAAK,KAAK,IACtD,CAAC;EACL,GAAI,SAAS,gBAAgB,KAAA,IACzB,EAAE,aAAa,SAAS,SAAS,WAAW,KAAK,KAAK,IACtD,CAAC;EACL,GAAI,SAAS,0BAA0B,KAAA,IACnC,EAAE,uBAAuB,SAAS,SAAS,qBAAqB,KAAK,KAAK,IAC1E,CAAC;EACL,UAAU,SAAS,SAAS,QAAQ,IAAI,SAAS,WAAW;CAC9D;CAEF,OAAO;EACL,SAAS,MAAM;EACf,iBAAiB,MAAM;EACvB,OAAO,MAAM,cAAc;EAC3B,UAAU;EACV,gBAAgB;EAChB,UAAU;CACZ;AACF;AAEA,SAAS,cAAc,QAA+D;CACpF,MAAM,YAAY,cAAc,QAAQ,WAAW;CACnD,OAAO;EACL,YAAY,SAAS,WAAW,UAAU,KAAK;EAC/C,SAAS,SAAS,WAAW,OAAO,KAAK;EACzC,gBAAgB,SAAS,WAAW,cAAc,KAAK;CACzD;AACF;AAEA,SAAS,SAAS,OAAyD;CACzE,MAAM,WAAW,OAAO;CACxB,MAAM,QAAQ,SAAS,QAAQ,IAAI,WAAW,KAAA;CAC9C,MAAM,QAAQ,qBAAqB,OAAO,cAAc;CACxD,OAAO;EACL,KAAK,eAAe,OAAO,cAAc;EACzC,WAAW,eAAe,OAAO,mBAAmB;EACpD,YAAY,eAAe,OAAO,uBAAuB;EACzD,kBAAkB,eAAe,OAAO,gBAAgB;EACxD,YAAY,eAAe,OAAO,mBAAmB;EACrD,aAAa,eAAe,OAAO,kBAAkB;EACrD,QAAQ,eAAe,OAAO,MAAM;EACpC,GAAI,UAAU,KAAA,IAAY,EAAE,gBAAgB,MAAM,IAAI,CAAC;CACzD;AACF;;;;;;;;;;;AAYA,SAAS,eAAe,OAAoC;CAC1D,MAAM,QAAuB,CAAC;CAC9B,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,WAAW,SAAS;EAC7B,MAAM,QAAQ,qBAAqB,KAAK,cAAc;EACtD,MAAM,YAAY,eAAe,KAAK,SAAS,gBAAgB;EAC/D,MAAM,gBAAgB,eAAe,KAAK,SAAS,oBAAoB;EACvE,MAAM,WAAW,cAAc,KAAK,SAAS,QAAQ;EACrD,IACE,UAAU,KAAA,KACV,cAAc,KAAA,KACd,kBAAkB,KAAA,KAClB,aAAa,KAAA,GAEb;EAEF,MAAM,KAAK;GACT,MAAM;GACN,MAAM,KAAK,cAAc;GACzB,GAAI,UAAU,KAAA,IAAY,EAAE,gBAAgB,MAAM,IAAI,CAAC;GACvD,GAAI,cAAc,KAAA,IAAY,EAAE,kBAAkB,UAAU,IAAI,CAAC;GACjE,GAAI,kBAAkB,KAAA,IAAY,EAAE,sBAAsB,cAAc,IAAI,CAAC;GAC7E,GAAI,aAAa,KAAA,IAAY,EAAE,SAAS,IAAI,CAAC;EAC/C,CAAC;CACH;CACA,OAAO;AACT;;;;;;;;AASA,SAAS,WAAW,aAAiC,OAAkC;CACrF,MAAM,QAAkB,CAAC;CACzB,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,MAAM,OAAO,CAAC,GAAI,aAAa,MAAM,KAAK,KAAK,CAAC,GAAI,GAAG,KAAK,GAAG;EAClE,MAAM,SAAS,IAAI,KAAK;EACxB,IAAI,OAAO,WAAW,KAAK,KAAK,IAAI,MAAM,GAAG;EAC7C,KAAK,IAAI,MAAM;EACf,MAAM,KAAK,MAAM;CACnB;CACA,OAAO,MAAM,KAAK,KAAK;AACzB;AAOA,SAAS,WACP,YACA,UACA,YACa;CACb,MAAM,SAAS,SAAS,WAAW,KAAK;CACxC,MAAM,YACJ,SAAS,QAAQ,UAAU,KAAK,WAAW,iBAAiB,WAAW;CACzE,IAAI,cAAc,KAAA,KAAa,UAAU,WAAW,GAClD,MAAM,IAAI,MACR,+HACF;CAEF,MAAM,UAAU,cAAc,QAAQ,SAAS;CAC/C,MAAM,aAAa,cAAc,QAAQ,YAAY;CACrD,MAAM,UAAU,YAAY;CAC5B,MAAM,cAAc,SAAS,YAAY,GAAG;CAC5C,MAAM,OAAO,QAAQ;CACrB,MAAM,gBAAgB,QAAQ;CAI9B,MAAM,cAAc,eAAe,WAAW,KAAK;CACnD,MAAM,QAAmC,MAAM,QAAQ,aAAa,IAC/D,gBACD,YAAY,SAAS,IACnB,cACA,KAAA;CACN,MAAM,WAAW,gBAAgB,WAAW,KAAK;CACjD,MAAM,OAAoB;EACxB,QAAQ;EACR,YAAY;EAGZ,mBAAmB,YAAY,SAAS,QAAQ,iBAAiB,KAAK;EACtE,QAAQ,SAAS,QAAQ,MAAM,KAAK,WAAW,cAAc;EAG7D,eAAe,SAAS,QAAQ,aAAa,KAAK;EAClD,cAAc,SAAS,QAAQ,YAAY,KAAK;EAChD,YAAY,qBAAqB,QAAQ,UAAU,KAAK;EACxD,iBAAiB,qBAAqB,QAAQ,eAAe,KAAK;EAClE,MAAM,cAAc,SAAS,IAAmB,IAAK,OAAuB;EAC5E,MAAM,SAAS,QAAQ,SAAS;EAChC,QAAQ,WAAW,QAAQ,WAAW,KAAK;EAC3C;EACA,WAAW,WAAW,MAAM,oBAAoB,CAAC;EACjD,GAAI,UAAU,KAAA,IAAY,EAAE,OAAO,MAAM,IAAI,CAAC;EAC9C,SAAS;GAGP,QAAQ;GACR,eAAe;GACf,SAAS;GACT,SAAS,SAAS,SAAS,OAAO,IAAI,QAAQ,UAAU,CAAC;GACzD,cAAc,OAAO,SAAS,iBAAiB,YAAY,QAAQ,eAAe;GAClF,cACE,OAAO,SAAS,iBAAiB,YAC7B,QAAQ,eACR,WAAW,6BAA6B,KAAA;GAC9C,OAAO,SAAS,SAAS,KAAK,KAAK;GAMnC,gBAAgB,SAAS,mBAAmB;EAC9C;EACA,MAAM,SAAS,WAAW,aAAa;EACvC,WAAW,cAAc,MAAM;EAC/B,YAAY;GACV,aAAa,SAAS,YAAY,WAAW,KAAK;GAClD,SAAS,iBAAiB,SAAS,OAAyB,IACvD,UACD;GACJ,KAAK,WAAW,aAAa,CAAC,iBAAiB,CAAC;GAQhD,GAAI,SAAS,YAAY,cAAc,IACnC,EAAE,gBAAgB,WAAW,eAAgC,IAC7D,CAAC;EACP;CACF;CACA,kBAAkB,MAAM,8CAA8C,WAAW;CACjF,OAAO;AACT;;;;;;;;;;AAWA,SAAgB,qBACd,YACA,UAA6B,CAAC,GACf;CACf,MAAM,cAAc,QAAQ,MAAM,qBAAK,IAAI,KAAK,EAAA,CAAG,YAAY;CAC/D,MAAM,QAAuB,CAAC;CAC9B,MAAM,QAAQ,MAAwB,UAAyB,WAA8B;EAC3F,MAAM,OAAO,WAAW,MAAM,UAAU,UAAU;EAClD,IAAI,OAAO,IAAI,KAAK,UAAU,GAC5B,MAAM,IAAI,MAAM,qDAAqD,KAAK,YAAY;EAExF,OAAO,IAAI,KAAK,UAAU;EAC1B,MAAM,KAAK,IAAI;EACf,KAAK,MAAM,SAAS,KAAK,yBAAyB,CAAC,GACjD,KAAK,OAAO,KAAK,YAAY,MAAM;EAErC,OAAO,OAAO,KAAK,UAAU;CAC/B;CACA,KAAK,YAAY,sBAAM,IAAI,IAAI,CAAC;CAChC,OAAO;AACT;;;;;;;;;;;;;;;AAgBA,SAAgB,qBACd,OACA,OACe;CACf,IAAI,CAAC,eAAe,SAAS,KAAK,GAChC,MAAM,IAAI,MAAM,uCAAuC,OAAO,KAAK,GAAG;CAExE,OAAO,MAAM,KAAK,UAAU;EAAE,GAAG;EAAM,MAAM;GAAE,GAAG,KAAK;GAAM;EAAM;CAAE,EAAE;AACzE"}
+{"version":3,"file":"rollout-8nj3mYvx.js","names":[],"sources":["../src/rollout/interchange/harbor.ts"],"sourcesContent":["/**\n * Harbor ATIF-v1.7 interchange — `tangle.rollout.v1` ⇄ Agent Trajectory\n * Interchange Format.\n *\n * ATIF is the portability format (spec:\n * https://www.harborframework.com/docs/agents/trajectory-format, normative\n * RFC: harbor-framework/harbor `rfcs/0001-trajectory-format.md`). It sits\n * BELOW the waist of the rollout hourglass in both directions — export reads\n * `RolloutLine[]`, import writes `RolloutLine[]` — and it is never a source\n * of training labels:\n *\n *   ATIF models NO reward, NO judge verdict, NO task/split coordinates.\n *\n * Consequences, both deliberate:\n *   - EXPORT drops `outcome.reward`, `outcome.reward_source` and\n *     `outcome.verdict` entirely. They are not smuggled into `extra`: a\n *     third-party reading our ATIF file must not be able to mistake an\n *     agent-eval judge score for something ATIF sanctioned.\n *   - IMPORT therefore mints UNLABELED lines: `reward: null` (the existing\n *     \"null reward is a labeled gap, never 0\" semantics), `verdict: null`,\n *     and a `provenance.gap` naming the missing label. An imported\n *     trajectory is not a training example until a judge scores it.\n *\n * Everything else we own that ATIF has no field for travels in a namespaced\n * escrow at `extra.tangle.*`, so our own round-trip is exact while a foreign\n * reader can ignore it. Fields that neither ATIF nor the escrow can carry\n * come back explicitly null / fail-closed, never invented.\n *\n * THE ESCROW IS NAMESPACED, NOT AUTHENTICATED. Anyone can write\n * `extra.tangle.*` into a file. So the escrow may restore what a value IS, but\n * never what a line is ALLOWED to do: `task.split` is forced to `holdout` on\n * every import regardless of what the document claims, and promoting an\n * imported trajectory to a trainable split is an explicit, greppable act\n * (`relabelImportedSplit`) rather than a property of the file. The document\n * keeps its claim — the claim just is not authority.\n *\n * Multi-agent shape differs on purpose. ATIF EMBEDS children in\n * `subagent_trajectories`; we keep a flat ledger with a normalized\n * `parent_rollout_id` edge. Export assembles the tree, import flattens it.\n * `session_id` is RUN-scoped in ATIF, so it carries `run_id` — the coordinate\n * that is shared by every invocation of one run — not `rollout_id`, which\n * identifies a single invocation and would split one run across session ids.\n *\n * ROUND-TRIPPING IS IDEMPOTENT: `import(export(import(export(x))))` is\n * byte-identical to `import(export(x))`. Import composes `provenance.gap` as a\n * de-duplicated ordered set rather than appending, and it emits every\n * `ChatMessage` with keys in the canonical schema order (role, content,\n * reasoning_content, tool_calls, tool_call_id, name, is_copied_context), so a\n * ledger hashed on serialized bytes sees no diff across further passes. The\n * FIRST import may re-order a producer's keys — that is the canonicalization.\n *\n * NOT building a Letta converter. Letta's trajectory-v1 is a strict subset of\n * what we need from ATIF here — no per-step or aggregate cost, no\n * multi-agent/subagent structure, no token-id or logprob channel — so a Letta\n * sink would carry less than this one and add a second format to keep\n * correct. Decision recorded in docs/rollout.md; do not re-litigate without a\n * concrete consumer that reads Letta and cannot read ATIF.\n */\n\nimport {\n  assertRolloutLine,\n  type ChatMessage,\n  type ChatRole,\n  type ChatToolCall,\n  type GatedEvidence,\n  ROLLOUT_CAPTURES,\n  ROLLOUT_ROLES,\n  ROLLOUT_SCHEMA,\n  ROLLOUT_SPLITS,\n  type RolloutArtifacts,\n  type RolloutCapture,\n  type RolloutCostBlock,\n  type RolloutLine,\n  type RolloutPolicy,\n  type RolloutRole,\n  type RolloutSplit,\n  type RolloutStep,\n  type RolloutTask,\n  type ToolDef,\n} from '../schema'\n\nexport const ATIF_SCHEMA_VERSION = 'ATIF-v1.7'\n\n/** Gap note on every imported line — ATIF carries no verdict, so nothing is scored. */\nexport const HARBOR_IMPORT_GAP = 'imported from Harbor ATIF; no verdict'\n\n/** Namespaced escrow key for everything ATIF does not model but we must not lose. */\nconst ESCROW = 'tangle'\n\n/**\n * Marks a step we synthesized purely to hold tool results that answered no\n * assistant turn IN THIS DOCUMENT. ATIF has no `tool` source, so such results\n * need a carrier step; the marker lets import drop the carrier instead of\n * inventing a turn.\n *\n * A carrier's results carry NO `source_call_id`. RFC 0001 rule 2 requires every\n * `source_call_id` to match a `tool_call_id` in the same step's `tool_calls`,\n * and a carrier declares no calls (a `system` step cannot legally make one), so\n * emitting the id there would produce an invalid document. The id is escrowed\n * instead and restored verbatim on import — the link survives without the\n * document lying about who made the call.\n */\nconst TOOL_RESULTS_ONLY = 'tool-results-only'\n\n// ---------------------------------------------------------------------------\n// ATIF-v1.7 wire types (RFC 0001). Optional fields are optional here too.\n// ---------------------------------------------------------------------------\n\nexport type HarborStepSource = 'system' | 'user' | 'agent'\n\nexport interface HarborImageSource {\n  media_type: string\n  path: string\n}\n\nexport interface HarborContentPart {\n  type: 'text' | 'image'\n  text?: string\n  source?: HarborImageSource\n}\n\nexport interface HarborToolCall {\n  tool_call_id: string\n  function_name: string\n  /** ATIF requires a decoded JSON object here, unlike our raw argument string. */\n  arguments: Record<string, unknown>\n  extra?: Record<string, unknown>\n}\n\nexport interface HarborSubagentTrajectoryRef {\n  trajectory_id?: string\n  trajectory_path?: string\n  /** Informational only since v1.7 — never a resolution key. */\n  session_id?: string\n  extra?: Record<string, unknown>\n}\n\nexport interface HarborObservationResult {\n  source_call_id?: string\n  content?: string | HarborContentPart[]\n  subagent_trajectory_ref?: HarborSubagentTrajectoryRef[]\n  extra?: Record<string, unknown>\n}\n\nexport interface HarborObservation {\n  results: HarborObservationResult[]\n}\n\nexport interface HarborMetrics {\n  prompt_tokens?: number\n  completion_tokens?: number\n  cached_tokens?: number\n  cost_usd?: number\n  prompt_token_ids?: number[]\n  completion_token_ids?: number[]\n  logprobs?: number[]\n  extra?: Record<string, unknown>\n}\n\nexport interface HarborStep {\n  /** Ordinal, sequential from 1. */\n  step_id: number\n  timestamp?: string\n  source: HarborStepSource\n  model_name?: string\n  reasoning_effort?: string | number\n  message: string | HarborContentPart[]\n  reasoning_content?: string\n  tool_calls?: HarborToolCall[]\n  observation?: HarborObservation\n  metrics?: HarborMetrics\n  llm_call_count?: number\n  is_copied_context?: boolean\n  extra?: Record<string, unknown>\n}\n\nexport interface HarborAgent {\n  name: string\n  version: string\n  model_name?: string\n  /** OpenAI function-calling schema — byte-identical to our `ToolDef`. */\n  tool_definitions?: ToolDef[]\n  extra?: Record<string, unknown>\n}\n\nexport interface HarborFinalMetrics {\n  total_prompt_tokens?: number\n  total_completion_tokens?: number\n  total_cached_tokens?: number\n  total_cost_usd?: number\n  total_steps?: number\n  extra?: Record<string, unknown>\n}\n\nexport interface HarborTrajectory {\n  schema_version: string\n  session_id?: string\n  /** Required on embedded subagents; we always set it so lines stay joinable. */\n  trajectory_id?: string\n  agent: HarborAgent\n  steps: HarborStep[]\n  notes?: string\n  final_metrics?: HarborFinalMetrics\n  continued_trajectory_ref?: string\n  subagent_trajectories?: HarborTrajectory[]\n  extra?: Record<string, unknown>\n}\n\n// ---------------------------------------------------------------------------\n// Shared helpers\n// ---------------------------------------------------------------------------\n\nconst isRecord = (v: unknown): v is Record<string, unknown> =>\n  typeof v === 'object' && v !== null && !Array.isArray(v)\n\nconst asString = (v: unknown): string | undefined => (typeof v === 'string' ? v : undefined)\n\nconst asNumberOrNull = (v: unknown): number | null =>\n  typeof v === 'number' && Number.isFinite(v) ? v : null\n\nconst asIntegerOrUndefined = (v: unknown): number | undefined =>\n  Number.isInteger(v) ? (v as number) : undefined\n\nconst asNumberArray = (v: unknown): number[] | undefined =>\n  Array.isArray(v) && v.every((n) => typeof n === 'number' && Number.isFinite(n))\n    ? (v as number[])\n    : undefined\n\nconst asIntegerArray = (v: unknown): number[] | undefined =>\n  Array.isArray(v) && v.every((n) => Number.isInteger(n)) ? (v as number[]) : undefined\n\n/**\n * Builds a `ChatMessage` with keys in the schema's declaration order.\n *\n * Object key order is insertion order in JS, so a message assembled\n * conditionally field-by-field serializes differently depending on which\n * optional fields were present — which makes a byte-hashed ledger see a diff\n * across an import that changed nothing. One builder, one order, stable bytes.\n */\nfunction canonicalChatMessage(parts: {\n  role: ChatRole\n  content: string | null\n  reasoning_content?: string\n  tool_calls?: ChatToolCall[]\n  tool_call_id?: string\n  name?: string\n  is_copied_context?: boolean\n}): ChatMessage {\n  const message: ChatMessage = { role: parts.role, content: parts.content }\n  if (parts.reasoning_content !== undefined) message.reasoning_content = parts.reasoning_content\n  if (parts.tool_calls !== undefined) message.tool_calls = parts.tool_calls\n  if (parts.tool_call_id !== undefined) message.tool_call_id = parts.tool_call_id\n  if (parts.name !== undefined) message.name = parts.name\n  if (parts.is_copied_context === true) message.is_copied_context = true\n  return message\n}\n\n/** Reads the `extra.tangle` escrow, tolerating a foreign file that has none. */\nfunction escrowOf(extra: Record<string, unknown> | undefined): Record<string, unknown> | undefined {\n  if (!isRecord(extra)) return undefined\n  const value = extra[ESCROW]\n  return isRecord(value) ? value : undefined\n}\n\nfunction escrowSection(\n  escrow: Record<string, unknown> | undefined,\n  key: string,\n): Record<string, unknown> | undefined {\n  if (escrow === undefined) return undefined\n  const value = escrow[key]\n  return isRecord(value) ? value : undefined\n}\n\n// ---------------------------------------------------------------------------\n// Export: RolloutLine[] → ATIF trajectory tree\n// ---------------------------------------------------------------------------\n\nfunction toHarborToolCall(call: ChatToolCall): HarborToolCall {\n  // ATIF requires `arguments` to be a JSON object; ours is the raw\n  // JSON-encoded string the model emitted, and models really do emit\n  // malformed ones. Keep the exact bytes in `extra` so import restores the\n  // string verbatim instead of re-serializing a normalized parse.\n  let parsed: Record<string, unknown> | undefined\n  try {\n    const decoded: unknown = JSON.parse(call.function.arguments)\n    if (isRecord(decoded)) parsed = decoded\n  } catch {\n    parsed = undefined\n  }\n  return {\n    tool_call_id: call.id,\n    function_name: call.function.name,\n    arguments: parsed ?? {},\n    extra: { [ESCROW]: { arguments_raw: call.function.arguments } },\n  }\n}\n\n/**\n * `linked` = this result is attached to the step that actually declared the\n * call, so `source_call_id` is legal (RFC 0001 rule 2). When it is not, the id\n * goes to escrow instead of onto the wire.\n */\nfunction toObservationResult(message: ChatMessage, linked: boolean): HarborObservationResult {\n  const result: HarborObservationResult = {}\n  if (linked && message.tool_call_id !== undefined) result.source_call_id = message.tool_call_id\n  if (message.content !== null) result.content = message.content\n  const escrow: Record<string, unknown> = {}\n  if (!linked && message.tool_call_id !== undefined) escrow.source_call_id = message.tool_call_id\n  if (message.name !== undefined) escrow.name = message.name\n  // `content: null` on a tool turn is meaningful (a tool that returned\n  // nothing) and is not the same as the empty string ATIF would round-trip it to.\n  if (message.content === null) escrow.content_null = true\n  if (message.reasoning_content !== undefined) escrow.reasoning_content = message.reasoning_content\n  if (message.is_copied_context === true) escrow.is_copied_context = true\n  if (Object.keys(escrow).length > 0) result.extra = { [ESCROW]: escrow }\n  return result\n}\n\n/** True when `step` is the agent turn that declared `callId` — the rule-2 test. */\nfunction declaresCall(step: HarborStep, callId: string | undefined): boolean {\n  if (callId === undefined) return false\n  return step.tool_calls?.some((call) => call.tool_call_id === callId) === true\n}\n\n/**\n * Attaches the four RL fields lifted from ATIF onto the agent step the span\n * describes. They are ALSO escrowed with the whole span under `extra.tangle`,\n * on purpose: the escrow is how our own round-trip stays exact, and these\n * native fields are how a foreign consumer — which never reads our escrow —\n * gets the logprobs and token ids at all. A field carried only in the escrow is\n * not an interchange field.\n */\nfunction applySpanMetrics(step: HarborStep, span: RolloutStep | undefined): void {\n  if (span === undefined) return\n  if (span.llm_call_count !== undefined) step.llm_call_count = span.llm_call_count\n  const metrics: HarborMetrics = {}\n  if (span.prompt_token_ids !== undefined) metrics.prompt_token_ids = span.prompt_token_ids\n  if (span.completion_token_ids !== undefined) {\n    metrics.completion_token_ids = span.completion_token_ids\n  }\n  if (span.logprobs !== undefined) metrics.logprobs = span.logprobs\n  if (Object.keys(metrics).length > 0) step.metrics = metrics\n}\n\n/**\n * Coalescing fold, not a 1:1 map: ATIF has no `tool` source, so a tool result\n * becomes an `observation.results[]` entry on the agent step THAT DECLARED ITS\n * `tool_call_id`.\n *\n * Linking by id, not by adjacency. Adjacency emitted invalid documents in three\n * shapes the RFC forbids — an assistant turn with no `tool_calls` swallowing the\n * results that followed it, a result whose id matched none of the preceding\n * step's calls, and an unanswered result riding a `system` step that carried a\n * `source_call_id` it could never declare. Attaching only to the step that owns\n * the id also preserves message order exactly: a result either joins the step\n * immediately before it or becomes its own carrier at its own position.\n *\n * `line.steps` span projections are matched to agent steps in order (k-th llm\n * span → k-th agent step) purely to fill ATIF's native per-step `metrics`;\n * extra spans on either side are simply not matched, never invented.\n */\nfunction messagesToSteps(line: RolloutLine): HarborStep[] {\n  const steps: HarborStep[] = []\n  const llmSpans = (line.steps ?? []).filter((span) => span.kind === 'llm')\n  let nextSpan = 0\n  for (const message of line.messages) {\n    if (message.role === 'tool') {\n      const previous = steps[steps.length - 1]\n      if (previous !== undefined && declaresCall(previous, message.tool_call_id)) {\n        if (previous.observation === undefined) previous.observation = { results: [] }\n        previous.observation.results.push(toObservationResult(message, true))\n        continue\n      }\n      // A tool result answering no assistant turn in this document (truncated or\n      // reconstructed transcript). It still has to survive, so it rides a marked\n      // carrier step whose observation states no call id.\n      const carrier: HarborStep = {\n        step_id: steps.length + 1,\n        source: 'system',\n        message: '',\n        observation: { results: [toObservationResult(message, false)] },\n        extra: { [ESCROW]: { synthetic: TOOL_RESULTS_ONLY } },\n      }\n      if (message.is_copied_context === true) carrier.is_copied_context = true\n      steps.push(carrier)\n      continue\n    }\n    const step: HarborStep = {\n      step_id: steps.length + 1,\n      source: message.role === 'assistant' ? 'agent' : message.role,\n      message: message.content ?? '',\n    }\n    const escrow: Record<string, unknown> = {}\n    if (message.content === null) escrow.content_null = true\n    if (message.name !== undefined) escrow.name = message.name\n    if (message.role === 'assistant') {\n      if (line.policy.model !== null) step.model_name = line.policy.model\n      if (message.reasoning_content !== undefined) {\n        step.reasoning_content = message.reasoning_content\n      }\n      if (message.tool_calls !== undefined && message.tool_calls.length > 0) {\n        step.tool_calls = message.tool_calls.map(toHarborToolCall)\n      }\n      applySpanMetrics(step, llmSpans[nextSpan])\n      nextSpan += 1\n    } else if (message.reasoning_content !== undefined) {\n      // ATIF confines `reasoning_content` to agent steps; ours is not confined.\n      escrow.reasoning_content = message.reasoning_content\n    }\n    // RFC 0001 rule 7: a copied-context turn was not authored by this agent, and\n    // an SFT pipeline MUST exclude it. Native ATIF field, both directions.\n    if (message.is_copied_context === true) step.is_copied_context = true\n    if (Object.keys(escrow).length > 0) step.extra = { [ESCROW]: escrow }\n    steps.push(step)\n  }\n  return steps\n}\n\nfunction finalMetricsOf(line: RolloutLine, stepCount: number): HarborFinalMetrics {\n  const metrics: HarborFinalMetrics = {}\n  if (line.cost.tokens_in !== null) metrics.total_prompt_tokens = line.cost.tokens_in\n  if (line.cost.tokens_out !== null) metrics.total_completion_tokens = line.cost.tokens_out\n  if (line.cost.cache_read !== null) metrics.total_cached_tokens = line.cost.cache_read\n  // Omitted, never 0, when cost was not captured — a fake 0 is a lie about spend.\n  if (line.cost.usd !== null) metrics.total_cost_usd = line.cost.usd\n  metrics.total_steps = stepCount\n  // ATIF has no aggregate field for these three; `reasoning_tokens` under\n  // `extra` is the key the RFC's own worked example uses.\n  const extra: Record<string, unknown> = {}\n  if (line.cost.tokens_reasoning !== null) extra.reasoning_tokens = line.cost.tokens_reasoning\n  if (line.cost.cache_write !== null) extra.cache_write_tokens = line.cost.cache_write\n  if (line.cost.wall_s !== null) extra.wall_s = line.cost.wall_s\n  if (line.cost.llm_call_count !== undefined && line.cost.llm_call_count !== null) {\n    extra.llm_call_count = line.cost.llm_call_count\n  }\n  if (Object.keys(extra).length > 0) metrics.extra = extra\n  return metrics\n}\n\nfunction notesOf(line: RolloutLine): string | undefined {\n  const parts: string[] = []\n  if (line.provenance.gap !== undefined) parts.push(line.provenance.gap)\n  if (line.outcome.realness_gated === true) {\n    // ATIF has no gate field. A third-party consumer that ignores `extra`\n    // would otherwise see a gamed trajectory with nothing marking it, so the\n    // flag is stated in prose as well. This export carries no reward at all,\n    // so it is not a training-data door — but it is an audit record.\n    parts.push('realness-gated: this run faked its success signal (anti-Goodhart gate fired)')\n  }\n  return parts.length > 0 ? parts.join(' | ') : undefined\n}\n\nfunction toTrajectoryNode(line: RolloutLine): HarborTrajectory {\n  const steps = messagesToSteps(line)\n  const trajectory: HarborTrajectory = {\n    schema_version: ATIF_SCHEMA_VERSION,\n    // RUN-scoped, per the spec — so it is `run_id`, the coordinate every\n    // invocation of one run shares. `rollout_id` identifies a single\n    // invocation: using it gave two roots of the same run different session\n    // ids, and foreign tooling that groups by session_id would split the run.\n    session_id: line.run_id,\n    trajectory_id: line.rollout_id,\n    agent: {\n      // ATIF requires both; ours are nullable, so a null is substituted here\n      // and restored on import from the escrowed policy — never guessed back.\n      name: line.policy.harness ?? 'unknown',\n      version: line.policy.harness_version ?? '0.0.0',\n      ...(line.policy.model !== null ? { model_name: line.policy.model } : {}),\n      ...(line.tool_defs.length > 0 ? { tool_definitions: line.tool_defs } : {}),\n    },\n    steps,\n    final_metrics: finalMetricsOf(line, steps.length),\n    extra: {\n      [ESCROW]: {\n        schema: line.schema,\n        rollout_id: line.rollout_id,\n        parent_rollout_id: line.parent_rollout_id,\n        run_id: line.run_id,\n        ...(line.experiment_id !== undefined ? { experiment_id: line.experiment_id } : {}),\n        ...(line.candidate_id !== undefined ? { candidate_id: line.candidate_id } : {}),\n        generation: line.generation,\n        candidate_index: line.candidate_index,\n        role: line.role,\n        task: line.task,\n        policy: line.policy,\n        // Span projections overlap the same turns as `steps[]`; folding them\n        // into ATIF steps would double-count the run, so they stay escrowed.\n        ...(line.steps !== undefined ? { spans: line.steps } : {}),\n        outcome: {\n          // reward / reward_source / verdict are deliberately absent — see the\n          // module header. Only the non-scalar outcome fields travel.\n          metrics: line.outcome.metrics,\n          is_completed: line.outcome.is_completed,\n          is_truncated: line.outcome.is_truncated,\n          error: line.outcome.error,\n          ...(line.outcome.realness_gated !== undefined\n            ? { realness_gated: line.outcome.realness_gated }\n            : {}),\n        },\n        artifacts: line.artifacts,\n        provenance: line.provenance,\n      },\n    },\n  }\n  const notes = notesOf(line)\n  if (notes !== undefined) trajectory.notes = notes\n  return trajectory\n}\n\ninterface Forest {\n  roots: RolloutLine[]\n  childrenOf: Map<string, RolloutLine[]>\n}\n\nfunction buildForest(lines: RolloutLine[]): Forest {\n  const byId = new Map<string, RolloutLine>()\n  for (const line of lines) {\n    if (byId.has(line.rollout_id)) {\n      throw new Error(`duplicate rollout_id in input: ${line.rollout_id}`)\n    }\n    byId.set(line.rollout_id, line)\n  }\n  const roots: RolloutLine[] = []\n  const childrenOf = new Map<string, RolloutLine[]>()\n  for (const line of lines) {\n    const parent = line.parent_rollout_id\n    // A parent outside this set is a root OF WHAT WE HAVE: the edge is kept in\n    // escrow so a later import restores the dangling pointer instead of nulling it.\n    if (parent === null || !byId.has(parent)) {\n      roots.push(line)\n      continue\n    }\n    const siblings = childrenOf.get(parent)\n    if (siblings === undefined) childrenOf.set(parent, [line])\n    else siblings.push(line)\n  }\n  // Every line has a parent inside the set: the edges form a cycle with no\n  // root. Returning zero documents would drop the whole episode silently.\n  if (lines.length > 0 && roots.length === 0) {\n    throw new Error(\n      `parent_rollout_id cycle: no root among ${lines.length} lines (${lines.map((l) => l.rollout_id).join(', ')})`,\n    )\n  }\n  return { roots, childrenOf }\n}\n\nfunction assemble(line: RolloutLine, forest: Forest, onPath: Set<string>): HarborTrajectory {\n  if (onPath.has(line.rollout_id)) {\n    throw new Error(`parent_rollout_id cycle through rollout_id ${line.rollout_id}`)\n  }\n  onPath.add(line.rollout_id)\n  const node = toTrajectoryNode(line)\n  const children = forest.childrenOf.get(line.rollout_id)\n  if (children !== undefined && children.length > 0) {\n    node.subagent_trajectories = children.map((child) => assemble(child, forest, onPath))\n  }\n  onPath.delete(line.rollout_id)\n  return node\n}\n\n/**\n * Assemble one episode's flat lines into a single ATIF trajectory tree,\n * linked by `parent_rollout_id`.\n *\n * Reward, verdict and split are NOT emitted (ATIF models none of them); the\n * split and the rest of the task coordinates survive only in `extra.tangle`.\n *\n * We deliberately do NOT synthesize an `observation.subagent_trajectory_ref`\n * pointing at each child: our ledger records WHICH invocation spawned a\n * worker, not which STEP did, and attaching the ref to a guessed step would\n * fabricate a causal claim. Children are embedded in `subagent_trajectories`\n * (each with the `trajectory_id` the spec requires) and the edge is stated in\n * the child's escrowed `parent_rollout_id`.\n *\n * Throws when the lines are not one tree — use `toHarborTrajectories` for a forest.\n */\nexport function toHarborTrajectory(lines: RolloutLine[]): HarborTrajectory {\n  const trees = toHarborTrajectories(lines)\n  if (trees.length === 0) throw new Error('toHarborTrajectory: no lines')\n  if (trees.length > 1) {\n    const ids = trees.map((t) => t.trajectory_id ?? '?').join(', ')\n    throw new Error(\n      `toHarborTrajectory: ${trees.length} roots (${ids}) — ATIF is one tree per document; use toHarborTrajectories`,\n    )\n  }\n  return trees[0]!\n}\n\n/** Every independent tree in the input, one ATIF document each. */\nexport function toHarborTrajectories(lines: RolloutLine[]): HarborTrajectory[] {\n  const forest = buildForest(lines)\n  return forest.roots.map((root) => assemble(root, forest, new Set()))\n}\n\n// ---------------------------------------------------------------------------\n// Import: ATIF trajectory tree → RolloutLine[]\n// ---------------------------------------------------------------------------\n\nfunction contentToString(message: string | HarborContentPart[]): string {\n  if (typeof message === 'string') return message\n  return message\n    .map((part) =>\n      part.type === 'image'\n        ? // Our chat content is text-only. Describing the image is honest about\n          // what the source held; dropping it silently would not be.\n          `[image ${part.source?.media_type ?? 'unknown'} ${part.source?.path ?? ''}]`.trim()\n        : (part.text ?? ''),\n    )\n    .join('\\n')\n}\n\nfunction fromHarborToolCall(call: HarborToolCall): ChatToolCall {\n  const raw = asString(escrowOf(call.extra)?.arguments_raw)\n  return {\n    id: call.tool_call_id,\n    type: 'function',\n    function: { name: call.function_name, arguments: raw ?? JSON.stringify(call.arguments ?? {}) },\n  }\n}\n\nfunction fromObservationResult(\n  result: HarborObservationResult,\n  callId: string | undefined,\n): ChatMessage {\n  const escrow = escrowOf(result.extra)\n  return canonicalChatMessage({\n    role: 'tool',\n    content:\n      escrow?.content_null === true\n        ? null\n        : result.content === undefined\n          ? ''\n          : contentToString(result.content),\n    reasoning_content: asString(escrow?.reasoning_content),\n    tool_call_id: callId,\n    name: asString(escrow?.name),\n    is_copied_context: escrow?.is_copied_context === true,\n  })\n}\n\nfunction stepsToMessages(steps: HarborStep[]): ChatMessage[] {\n  const messages: ChatMessage[] = []\n  for (const step of steps) {\n    const escrow = escrowOf(step.extra)\n    const carrierOnly = escrow?.synthetic === TOOL_RESULTS_ONLY\n    if (!carrierOnly) {\n      messages.push(\n        canonicalChatMessage({\n          role: step.source === 'agent' ? 'assistant' : step.source,\n          content: escrow?.content_null === true ? null : contentToString(step.message),\n          reasoning_content: step.reasoning_content ?? asString(escrow?.reasoning_content),\n          tool_calls:\n            step.tool_calls !== undefined && step.tool_calls.length > 0\n              ? step.tool_calls.map(fromHarborToolCall)\n              : undefined,\n          name: asString(escrow?.name),\n          is_copied_context: step.is_copied_context === true,\n        }),\n      )\n    }\n    for (const result of step.observation?.results ?? []) {\n      const resultEscrow = escrowOf(result.extra)\n      const callId = result.source_call_id ?? asString(resultEscrow?.source_call_id)\n      if (carrierOnly) {\n        // Our own carrier: every result on it was a tool turn, and its call id\n        // (if the transcript had one) is in escrow, not on the wire.\n        messages.push(fromObservationResult(result, callId))\n        continue\n      }\n      if (typeof callId === 'string') {\n        messages.push(fromObservationResult(result, callId))\n        continue\n      }\n      // ATIF allows a result from a non-tool-calling action. Our chat schema\n      // requires `tool_call_id` on a tool turn, so inventing one would forge a\n      // link; the text is preserved as a system observation instead.\n      if (result.content !== undefined) {\n        messages.push(\n          canonicalChatMessage({ role: 'system', content: contentToString(result.content) }),\n        )\n      }\n    }\n  }\n  return messages\n}\n\nfunction taskFrom(escrow: Record<string, unknown> | undefined, fallbackId: string): RolloutTask {\n  const task = escrowSection(escrow, 'task')\n  return {\n    suite: asString(task?.suite) ?? 'harbor-atif-import',\n    instance_id: asString(task?.instance_id) ?? fallbackId,\n    // ALWAYS holdout — the escrowed claim is read for nothing here.\n    //\n    // `extra.tangle.task.split` is a namespaced key, not an authenticated one:\n    // a hand-written or third-party document can set `split: 'search'` as\n    // easily as our own exporter can, and honouring it made \"this file says so\"\n    // sufficient to walk into a training export. Trainability is a decision\n    // about a file, so it is made by an operator through\n    // `relabelImportedSplit`, never by the file about itself. The claim is not\n    // destroyed — it stays readable in the source document.\n    split: 'holdout',\n    seed: asNumberOrNull(task?.seed),\n    rep: asIntegerOrUndefined(task?.rep) ?? 0,\n  }\n}\n\nfunction policyFrom(\n  escrow: Record<string, unknown> | undefined,\n  agent: HarborAgent,\n): RolloutPolicy {\n  const escrowed = escrowSection(escrow, 'policy')\n  if (escrowed !== undefined) {\n    // Our own export: restore verbatim, including the nulls ATIF forced us to\n    // substitute placeholders for in `agent.name` / `agent.version`.\n    return {\n      harness: asString(escrowed.harness) ?? null,\n      harness_version: asString(escrowed.harness_version) ?? null,\n      model: asString(escrowed.model) ?? null,\n      provider: asString(escrowed.provider) ?? null,\n      profile_commit: asString(escrowed.profile_commit) ?? null,\n      ...(escrowed.prompt_hash !== undefined\n        ? { prompt_hash: asString(escrowed.prompt_hash) ?? null }\n        : {}),\n      ...(escrowed.config_hash !== undefined\n        ? { config_hash: asString(escrowed.config_hash) ?? null }\n        : {}),\n      ...(escrowed.agent_profile_cell_id !== undefined\n        ? { agent_profile_cell_id: asString(escrowed.agent_profile_cell_id) ?? null }\n        : {}),\n      sampling: isRecord(escrowed.sampling) ? escrowed.sampling : null,\n    }\n  }\n  return {\n    harness: agent.name,\n    harness_version: agent.version,\n    model: agent.model_name ?? null,\n    provider: null,\n    profile_commit: null,\n    sampling: null,\n  }\n}\n\nfunction artifactsFrom(escrow: Record<string, unknown> | undefined): RolloutArtifacts {\n  const artifacts = escrowSection(escrow, 'artifacts')\n  return {\n    patch_path: asString(artifacts?.patch_path) ?? null,\n    run_dir: asString(artifacts?.run_dir) ?? null,\n    transcript_ref: asString(artifacts?.transcript_ref) ?? null,\n  }\n}\n\nfunction costFrom(final: HarborFinalMetrics | undefined): RolloutCostBlock {\n  const rawExtra = final?.extra\n  const extra = isRecord(rawExtra) ? rawExtra : undefined\n  const calls = asIntegerOrUndefined(extra?.llm_call_count)\n  return {\n    usd: asNumberOrNull(final?.total_cost_usd),\n    tokens_in: asNumberOrNull(final?.total_prompt_tokens),\n    tokens_out: asNumberOrNull(final?.total_completion_tokens),\n    tokens_reasoning: asNumberOrNull(extra?.reasoning_tokens),\n    cache_read: asNumberOrNull(final?.total_cached_tokens),\n    cache_write: asNumberOrNull(extra?.cache_write_tokens),\n    wall_s: asNumberOrNull(extra?.wall_s),\n    ...(calls !== undefined ? { llm_call_count: calls } : {}),\n  }\n}\n\n/**\n * Recovers span projections from ATIF's NATIVE per-step channel, for documents\n * with no `extra.tangle.spans` escrow — i.e. everything a foreign producer\n * writes. Without this the logprobs and token ids a Harbor-native trainer\n * records would be read, validated, and then dropped on the floor.\n *\n * Only steps that actually carry one of the four fields produce a span: an\n * agent step with no metrics means \"not captured\", and inventing an empty span\n * for it would claim the run had a shape we did not observe.\n */\nfunction spansFromSteps(steps: HarborStep[]): RolloutStep[] {\n  const spans: RolloutStep[] = []\n  for (const step of steps) {\n    if (step.source !== 'agent') continue\n    const calls = asIntegerOrUndefined(step.llm_call_count)\n    const promptIds = asIntegerArray(step.metrics?.prompt_token_ids)\n    const completionIds = asIntegerArray(step.metrics?.completion_token_ids)\n    const logprobs = asNumberArray(step.metrics?.logprobs)\n    if (\n      calls === undefined &&\n      promptIds === undefined &&\n      completionIds === undefined &&\n      logprobs === undefined\n    ) {\n      continue\n    }\n    spans.push({\n      kind: 'llm',\n      name: step.model_name ?? 'chat',\n      ...(calls !== undefined ? { llm_call_count: calls } : {}),\n      ...(promptIds !== undefined ? { prompt_token_ids: promptIds } : {}),\n      ...(completionIds !== undefined ? { completion_token_ids: completionIds } : {}),\n      ...(logprobs !== undefined ? { logprobs } : {}),\n    })\n  }\n  return spans\n}\n\n/**\n * Composes `provenance.gap` as an ordered SET of reasons.\n *\n * Appending made the note accrete on every pass (\"…no verdict | …no verdict\"),\n * which both grows without bound and breaks byte-level idempotency for a ledger\n * hashed on its serialized lines.\n */\nfunction composeGap(escrowedGap: string | undefined, added: readonly string[]): string {\n  const parts: string[] = []\n  const seen = new Set<string>()\n  for (const raw of [...(escrowedGap?.split(' | ') ?? []), ...added]) {\n    const reason = raw.trim()\n    if (reason.length === 0 || seen.has(reason)) continue\n    seen.add(reason)\n    parts.push(reason)\n  }\n  return parts.join(' | ')\n}\n\nexport interface FromHarborOptions {\n  /** Injected clock for deterministic output when the source carries no capture time. */\n  now?: () => Date\n}\n\nfunction nodeToLine(\n  trajectory: HarborTrajectory,\n  parentId: string | null,\n  capturedAt: string,\n): RolloutLine {\n  const escrow = escrowOf(trajectory.extra)\n  const rolloutId =\n    asString(escrow?.rollout_id) ?? trajectory.trajectory_id ?? trajectory.session_id\n  if (rolloutId === undefined || rolloutId.length === 0) {\n    throw new Error(\n      'fromHarborTrajectory: trajectory has no trajectory_id or session_id — cannot mint a joinable rollout_id without inventing one',\n    )\n  }\n  const outcome = escrowSection(escrow, 'outcome')\n  const provenance = escrowSection(escrow, 'provenance')\n  const capture = provenance?.capture\n  const escrowedGap = asString(provenance?.gap)\n  const role = escrow?.role\n  const escrowedSpans = escrow?.spans\n  // The escrow wins when it exists (our own export: exact, including an empty\n  // array, which claims \"captured, none\" rather than \"not captured\"), and the\n  // native per-step channel is the fallback (a foreign export: still signal).\n  const nativeSpans = spansFromSteps(trajectory.steps)\n  const spans: RolloutStep[] | undefined = Array.isArray(escrowedSpans)\n    ? (escrowedSpans as RolloutStep[])\n    : nativeSpans.length > 0\n      ? nativeSpans\n      : undefined\n  const messages = stepsToMessages(trajectory.steps)\n  const line: RolloutLine = {\n    schema: ROLLOUT_SCHEMA,\n    rollout_id: rolloutId,\n    // The tree edge wins for embedded children; for a root, the escrowed\n    // pointer may reference a line outside this document and is preserved.\n    parent_rollout_id: parentId ?? asString(escrow?.parent_rollout_id) ?? null,\n    run_id: asString(escrow?.run_id) ?? trajectory.session_id ?? rolloutId,\n    // Required keys on the wire (0.127.0): a foreign document that never\n    // stated them imports as explicit `null`, not as an absent field.\n    experiment_id: asString(escrow?.experiment_id) ?? null,\n    candidate_id: asString(escrow?.candidate_id) ?? null,\n    generation: asIntegerOrUndefined(escrow?.generation) ?? null,\n    candidate_index: asIntegerOrUndefined(escrow?.candidate_index) ?? null,\n    role: ROLLOUT_ROLES.includes(role as RolloutRole) ? (role as RolloutRole) : 'agent',\n    task: taskFrom(escrow, rolloutId),\n    policy: policyFrom(escrow, trajectory.agent),\n    messages,\n    tool_defs: trajectory.agent.tool_definitions ?? [],\n    ...(spans !== undefined ? { steps: spans } : {}),\n    outcome: {\n      // ATIF carries no label. Null is the labeled gap; a 0 here would be a\n      // fabricated failure and a 1 a fabricated success.\n      reward: null,\n      reward_source: null,\n      verdict: null,\n      metrics: isRecord(outcome?.metrics) ? outcome.metrics : {},\n      is_completed: typeof outcome?.is_completed === 'boolean' ? outcome.is_completed : true,\n      is_truncated:\n        typeof outcome?.is_truncated === 'boolean'\n          ? outcome.is_truncated\n          : trajectory.continued_trajectory_ref !== undefined,\n      error: asString(outcome?.error) ?? null,\n      // The anti-Goodhart flag is restored when the source document stated\n      // it; the wire schema requires the field, so a document that never did\n      // imports as `false`. That is safe here because the reward is already\n      // forced to `null` (not trainable) and `realness_screened` stays\n      // absent = unknown rather than claiming a screen ran.\n      realness_gated: outcome?.realness_gated === true,\n    },\n    cost: costFrom(trajectory.final_metrics),\n    artifacts: artifactsFrom(escrow),\n    provenance: {\n      captured_at: asString(provenance?.captured_at) ?? capturedAt,\n      capture: ROLLOUT_CAPTURES.includes(capture as RolloutCapture)\n        ? (capture as RolloutCapture)\n        : 'backfill',\n      gap: composeGap(escrowedGap, [HARBOR_IMPORT_GAP]),\n      // Restored for the same reason `realness_gated` is, and with the opposite\n      // risk profile from the reward: this is the gated run's own measurement\n      // bag, moved off `outcome` by `gateGamedOutcome` so no exporter reads it\n      // as training input. Dropping it here would silently destroy the audit\n      // trail that says WHY the run was flagged and what it claimed, on the one\n      // population an auditor most wants to inspect. It cannot be fail-open —\n      // nothing projects `provenance` into a training row.\n      ...(isRecord(provenance?.gated_evidence)\n        ? { gated_evidence: provenance.gated_evidence as GatedEvidence }\n        : {}),\n    },\n  }\n  assertRolloutLine(line, `rollout line imported from ATIF trajectory ${rolloutId}`)\n  return line\n}\n\n/**\n * Flatten an ATIF trajectory tree back into `tangle.rollout.v1` lines, parent\n * first, each child carrying `parent_rollout_id`.\n *\n * Every line comes back UNLABELED: `reward`, `reward_source` and `verdict` are\n * null and `provenance.gap` says why. ATIF models no verdict, so scoring an\n * imported trajectory is a judge's job, not this function's. Every line lands\n * on `holdout` whatever the document claims — see `relabelImportedSplit`.\n */\nexport function fromHarborTrajectory(\n  trajectory: HarborTrajectory,\n  options: FromHarborOptions = {},\n): RolloutLine[] {\n  const capturedAt = (options.now?.() ?? new Date()).toISOString()\n  const lines: RolloutLine[] = []\n  const walk = (node: HarborTrajectory, parentId: string | null, onPath: Set<string>): void => {\n    const line = nodeToLine(node, parentId, capturedAt)\n    if (onPath.has(line.rollout_id)) {\n      throw new Error(`subagent_trajectories cycle through trajectory_id ${line.rollout_id}`)\n    }\n    onPath.add(line.rollout_id)\n    lines.push(line)\n    for (const child of node.subagent_trajectories ?? []) {\n      walk(child, line.rollout_id, onPath)\n    }\n    onPath.delete(line.rollout_id)\n  }\n  walk(trajectory, null, new Set())\n  return lines\n}\n\n/**\n * THE explicit door out of `holdout` for imported lines.\n *\n * Import forces `holdout` because a document's own claim about its split is not\n * evidence — anyone can write `extra.tangle.task.split`. Promoting a file to a\n * trainable split is an operator's decision about provenance they verified, so\n * it is a separate, greppable call: `grep relabelImportedSplit` enumerates\n * every place foreign data was declared trainable, which is exactly the audit\n * the trusted-escrow version made impossible.\n *\n * Returns plain `RolloutLine`s. They still have to pass `assertMinted` (and its\n * anti-Goodhart check) to reach an exporter — re-labeling a split is not\n * minting a reward.\n */\nexport function relabelImportedSplit(\n  lines: readonly RolloutLine[],\n  split: RolloutSplit,\n): RolloutLine[] {\n  if (!ROLLOUT_SPLITS.includes(split)) {\n    throw new Error(`relabelImportedSplit: unknown split ${String(split)}`)\n  }\n  return lines.map((line) => ({ ...line, task: { ...line.task, split } }))\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiFA,MAAa,sBAAsB;;AAGnC,MAAa,oBAAoB;;AAGjC,MAAM,SAAS;;;;;;;;;;;;;;AAef,MAAM,oBAAoB;AA8G1B,MAAM,YAAY,MAChB,OAAO,MAAM,YAAY,MAAM,QAAQ,CAAC,MAAM,QAAQ,CAAC;AAEzD,MAAM,YAAY,MAAoC,OAAO,MAAM,WAAW,IAAI,KAAA;AAElF,MAAM,kBAAkB,MACtB,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,IAAI,IAAI;AAEpD,MAAM,wBAAwB,MAC5B,OAAO,UAAU,CAAC,IAAK,IAAe,KAAA;AAExC,MAAM,iBAAiB,MACrB,MAAM,QAAQ,CAAC,KAAK,EAAE,OAAO,MAAM,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,CAAC,IACzE,IACD,KAAA;AAEN,MAAM,kBAAkB,MACtB,MAAM,QAAQ,CAAC,KAAK,EAAE,OAAO,MAAM,OAAO,UAAU,CAAC,CAAC,IAAK,IAAiB,KAAA;;;;;;;;;AAU9E,SAAS,qBAAqB,OAQd;CACd,MAAM,UAAuB;EAAE,MAAM,MAAM;EAAM,SAAS,MAAM;CAAQ;CACxE,IAAI,MAAM,sBAAsB,KAAA,GAAW,QAAQ,oBAAoB,MAAM;CAC7E,IAAI,MAAM,eAAe,KAAA,GAAW,QAAQ,aAAa,MAAM;CAC/D,IAAI,MAAM,iBAAiB,KAAA,GAAW,QAAQ,eAAe,MAAM;CACnE,IAAI,MAAM,SAAS,KAAA,GAAW,QAAQ,OAAO,MAAM;CACnD,IAAI,MAAM,sBAAsB,MAAM,QAAQ,oBAAoB;CAClE,OAAO;AACT;;AAGA,SAAS,SAAS,OAAiF;CACjG,IAAI,CAAC,SAAS,KAAK,GAAG,OAAO,KAAA;CAC7B,MAAM,QAAQ,MAAM;CACpB,OAAO,SAAS,KAAK,IAAI,QAAQ,KAAA;AACnC;AAEA,SAAS,cACP,QACA,KACqC;CACrC,IAAI,WAAW,KAAA,GAAW,OAAO,KAAA;CACjC,MAAM,QAAQ,OAAO;CACrB,OAAO,SAAS,KAAK,IAAI,QAAQ,KAAA;AACnC;AAMA,SAAS,iBAAiB,MAAoC;CAK5D,IAAI;CACJ,IAAI;EACF,MAAM,UAAmB,KAAK,MAAM,KAAK,SAAS,SAAS;EAC3D,IAAI,SAAS,OAAO,GAAG,SAAS;CAClC,QAAQ;EACN,SAAS,KAAA;CACX;CACA,OAAO;EACL,cAAc,KAAK;EACnB,eAAe,KAAK,SAAS;EAC7B,WAAW,UAAU,CAAC;EACtB,OAAO,GAAG,SAAS,EAAE,eAAe,KAAK,SAAS,UAAU,EAAE;CAChE;AACF;;;;;;AAOA,SAAS,oBAAoB,SAAsB,QAA0C;CAC3F,MAAM,SAAkC,CAAC;CACzC,IAAI,UAAU,QAAQ,iBAAiB,KAAA,GAAW,OAAO,iBAAiB,QAAQ;CAClF,IAAI,QAAQ,YAAY,MAAM,OAAO,UAAU,QAAQ;CACvD,MAAM,SAAkC,CAAC;CACzC,IAAI,CAAC,UAAU,QAAQ,iBAAiB,KAAA,GAAW,OAAO,iBAAiB,QAAQ;CACnF,IAAI,QAAQ,SAAS,KAAA,GAAW,OAAO,OAAO,QAAQ;CAGtD,IAAI,QAAQ,YAAY,MAAM,OAAO,eAAe;CACpD,IAAI,QAAQ,sBAAsB,KAAA,GAAW,OAAO,oBAAoB,QAAQ;CAChF,IAAI,QAAQ,sBAAsB,MAAM,OAAO,oBAAoB;CACnE,IAAI,OAAO,KAAK,MAAM,CAAC,CAAC,SAAS,GAAG,OAAO,QAAQ,GAAG,SAAS,OAAO;CACtE,OAAO;AACT;;AAGA,SAAS,aAAa,MAAkB,QAAqC;CAC3E,IAAI,WAAW,KAAA,GAAW,OAAO;CACjC,OAAO,KAAK,YAAY,MAAM,SAAS,KAAK,iBAAiB,MAAM,MAAM;AAC3E;;;;;;;;;AAUA,SAAS,iBAAiB,MAAkB,MAAqC;CAC/E,IAAI,SAAS,KAAA,GAAW;CACxB,IAAI,KAAK,mBAAmB,KAAA,GAAW,KAAK,iBAAiB,KAAK;CAClE,MAAM,UAAyB,CAAC;CAChC,IAAI,KAAK,qBAAqB,KAAA,GAAW,QAAQ,mBAAmB,KAAK;CACzE,IAAI,KAAK,yBAAyB,KAAA,GAChC,QAAQ,uBAAuB,KAAK;CAEtC,IAAI,KAAK,aAAa,KAAA,GAAW,QAAQ,WAAW,KAAK;CACzD,IAAI,OAAO,KAAK,OAAO,CAAC,CAAC,SAAS,GAAG,KAAK,UAAU;AACtD;;;;;;;;;;;;;;;;;;AAmBA,SAAS,gBAAgB,MAAiC;CACxD,MAAM,QAAsB,CAAC;CAC7B,MAAM,YAAY,KAAK,SAAS,CAAC,EAAA,CAAG,QAAQ,SAAS,KAAK,SAAS,KAAK;CACxE,IAAI,WAAW;CACf,KAAK,MAAM,WAAW,KAAK,UAAU;EACnC,IAAI,QAAQ,SAAS,QAAQ;GAC3B,MAAM,WAAW,MAAM,MAAM,SAAS;GACtC,IAAI,aAAa,KAAA,KAAa,aAAa,UAAU,QAAQ,YAAY,GAAG;IAC1E,IAAI,SAAS,gBAAgB,KAAA,GAAW,SAAS,cAAc,EAAE,SAAS,CAAC,EAAE;IAC7E,SAAS,YAAY,QAAQ,KAAK,oBAAoB,SAAS,IAAI,CAAC;IACpE;GACF;GAIA,MAAM,UAAsB;IAC1B,SAAS,MAAM,SAAS;IACxB,QAAQ;IACR,SAAS;IACT,aAAa,EAAE,SAAS,CAAC,oBAAoB,SAAS,KAAK,CAAC,EAAE;IAC9D,OAAO,GAAG,SAAS,EAAE,WAAW,kBAAkB,EAAE;GACtD;GACA,IAAI,QAAQ,sBAAsB,MAAM,QAAQ,oBAAoB;GACpE,MAAM,KAAK,OAAO;GAClB;EACF;EACA,MAAM,OAAmB;GACvB,SAAS,MAAM,SAAS;GACxB,QAAQ,QAAQ,SAAS,cAAc,UAAU,QAAQ;GACzD,SAAS,QAAQ,WAAW;EAC9B;EACA,MAAM,SAAkC,CAAC;EACzC,IAAI,QAAQ,YAAY,MAAM,OAAO,eAAe;EACpD,IAAI,QAAQ,SAAS,KAAA,GAAW,OAAO,OAAO,QAAQ;EACtD,IAAI,QAAQ,SAAS,aAAa;GAChC,IAAI,KAAK,OAAO,UAAU,MAAM,KAAK,aAAa,KAAK,OAAO;GAC9D,IAAI,QAAQ,sBAAsB,KAAA,GAChC,KAAK,oBAAoB,QAAQ;GAEnC,IAAI,QAAQ,eAAe,KAAA,KAAa,QAAQ,WAAW,SAAS,GAClE,KAAK,aAAa,QAAQ,WAAW,IAAI,gBAAgB;GAE3D,iBAAiB,MAAM,SAAS,SAAS;GACzC,YAAY;EACd,OAAO,IAAI,QAAQ,sBAAsB,KAAA,GAEvC,OAAO,oBAAoB,QAAQ;EAIrC,IAAI,QAAQ,sBAAsB,MAAM,KAAK,oBAAoB;EACjE,IAAI,OAAO,KAAK,MAAM,CAAC,CAAC,SAAS,GAAG,KAAK,QAAQ,GAAG,SAAS,OAAO;EACpE,MAAM,KAAK,IAAI;CACjB;CACA,OAAO;AACT;AAEA,SAAS,eAAe,MAAmB,WAAuC;CAChF,MAAM,UAA8B,CAAC;CACrC,IAAI,KAAK,KAAK,cAAc,MAAM,QAAQ,sBAAsB,KAAK,KAAK;CAC1E,IAAI,KAAK,KAAK,eAAe,MAAM,QAAQ,0BAA0B,KAAK,KAAK;CAC/E,IAAI,KAAK,KAAK,eAAe,MAAM,QAAQ,sBAAsB,KAAK,KAAK;CAE3E,IAAI,KAAK,KAAK,QAAQ,MAAM,QAAQ,iBAAiB,KAAK,KAAK;CAC/D,QAAQ,cAAc;CAGtB,MAAM,QAAiC,CAAC;CACxC,IAAI,KAAK,KAAK,qBAAqB,MAAM,MAAM,mBAAmB,KAAK,KAAK;CAC5E,IAAI,KAAK,KAAK,gBAAgB,MAAM,MAAM,qBAAqB,KAAK,KAAK;CACzE,IAAI,KAAK,KAAK,WAAW,MAAM,MAAM,SAAS,KAAK,KAAK;CACxD,IAAI,KAAK,KAAK,mBAAmB,KAAA,KAAa,KAAK,KAAK,mBAAmB,MACzE,MAAM,iBAAiB,KAAK,KAAK;CAEnC,IAAI,OAAO,KAAK,KAAK,CAAC,CAAC,SAAS,GAAG,QAAQ,QAAQ;CACnD,OAAO;AACT;AAEA,SAAS,QAAQ,MAAuC;CACtD,MAAM,QAAkB,CAAC;CACzB,IAAI,KAAK,WAAW,QAAQ,KAAA,GAAW,MAAM,KAAK,KAAK,WAAW,GAAG;CACrE,IAAI,KAAK,QAAQ,mBAAmB,MAKlC,MAAM,KAAK,8EAA8E;CAE3F,OAAO,MAAM,SAAS,IAAI,MAAM,KAAK,KAAK,IAAI,KAAA;AAChD;AAEA,SAAS,iBAAiB,MAAqC;CAC7D,MAAM,QAAQ,gBAAgB,IAAI;CAClC,MAAM,aAA+B;EACnC,gBAAgB;EAKhB,YAAY,KAAK;EACjB,eAAe,KAAK;EACpB,OAAO;GAGL,MAAM,KAAK,OAAO,WAAW;GAC7B,SAAS,KAAK,OAAO,mBAAmB;GACxC,GAAI,KAAK,OAAO,UAAU,OAAO,EAAE,YAAY,KAAK,OAAO,MAAM,IAAI,CAAC;GACtE,GAAI,KAAK,UAAU,SAAS,IAAI,EAAE,kBAAkB,KAAK,UAAU,IAAI,CAAC;EAC1E;EACA;EACA,eAAe,eAAe,MAAM,MAAM,MAAM;EAChD,OAAO,GACJ,SAAS;GACR,QAAQ,KAAK;GACb,YAAY,KAAK;GACjB,mBAAmB,KAAK;GACxB,QAAQ,KAAK;GACb,GAAI,KAAK,kBAAkB,KAAA,IAAY,EAAE,eAAe,KAAK,cAAc,IAAI,CAAC;GAChF,GAAI,KAAK,iBAAiB,KAAA,IAAY,EAAE,cAAc,KAAK,aAAa,IAAI,CAAC;GAC7E,YAAY,KAAK;GACjB,iBAAiB,KAAK;GACtB,MAAM,KAAK;GACX,MAAM,KAAK;GACX,QAAQ,KAAK;GAGb,GAAI,KAAK,UAAU,KAAA,IAAY,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC;GACxD,SAAS;IAGP,SAAS,KAAK,QAAQ;IACtB,cAAc,KAAK,QAAQ;IAC3B,cAAc,KAAK,QAAQ;IAC3B,OAAO,KAAK,QAAQ;IACpB,GAAI,KAAK,QAAQ,mBAAmB,KAAA,IAChC,EAAE,gBAAgB,KAAK,QAAQ,eAAe,IAC9C,CAAC;GACP;GACA,WAAW,KAAK;GAChB,YAAY,KAAK;EACnB,EACF;CACF;CACA,MAAM,QAAQ,QAAQ,IAAI;CAC1B,IAAI,UAAU,KAAA,GAAW,WAAW,QAAQ;CAC5C,OAAO;AACT;AAOA,SAAS,YAAY,OAA8B;CACjD,MAAM,uBAAO,IAAI,IAAyB;CAC1C,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,IAAI,KAAK,UAAU,GAC1B,MAAM,IAAI,MAAM,kCAAkC,KAAK,YAAY;EAErE,KAAK,IAAI,KAAK,YAAY,IAAI;CAChC;CACA,MAAM,QAAuB,CAAC;CAC9B,MAAM,6BAAa,IAAI,IAA2B;CAClD,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,SAAS,KAAK;EAGpB,IAAI,WAAW,QAAQ,CAAC,KAAK,IAAI,MAAM,GAAG;GACxC,MAAM,KAAK,IAAI;GACf;EACF;EACA,MAAM,WAAW,WAAW,IAAI,MAAM;EACtC,IAAI,aAAa,KAAA,GAAW,WAAW,IAAI,QAAQ,CAAC,IAAI,CAAC;OACpD,SAAS,KAAK,IAAI;CACzB;CAGA,IAAI,MAAM,SAAS,KAAK,MAAM,WAAW,GACvC,MAAM,IAAI,MACR,0CAA0C,MAAM,OAAO,UAAU,MAAM,KAAK,MAAM,EAAE,UAAU,CAAC,CAAC,KAAK,IAAI,EAAE,EAC7G;CAEF,OAAO;EAAE;EAAO;CAAW;AAC7B;AAEA,SAAS,SAAS,MAAmB,QAAgB,QAAuC;CAC1F,IAAI,OAAO,IAAI,KAAK,UAAU,GAC5B,MAAM,IAAI,MAAM,8CAA8C,KAAK,YAAY;CAEjF,OAAO,IAAI,KAAK,UAAU;CAC1B,MAAM,OAAO,iBAAiB,IAAI;CAClC,MAAM,WAAW,OAAO,WAAW,IAAI,KAAK,UAAU;CACtD,IAAI,aAAa,KAAA,KAAa,SAAS,SAAS,GAC9C,KAAK,wBAAwB,SAAS,KAAK,UAAU,SAAS,OAAO,QAAQ,MAAM,CAAC;CAEtF,OAAO,OAAO,KAAK,UAAU;CAC7B,OAAO;AACT;;;;;;;;;;;;;;;;;AAkBA,SAAgB,mBAAmB,OAAwC;CACzE,MAAM,QAAQ,qBAAqB,KAAK;CACxC,IAAI,MAAM,WAAW,GAAG,MAAM,IAAI,MAAM,8BAA8B;CACtE,IAAI,MAAM,SAAS,GAAG;EACpB,MAAM,MAAM,MAAM,KAAK,MAAM,EAAE,iBAAiB,GAAG,CAAC,CAAC,KAAK,IAAI;EAC9D,MAAM,IAAI,MACR,uBAAuB,MAAM,OAAO,UAAU,IAAI,4DACpD;CACF;CACA,OAAO,MAAM;AACf;;AAGA,SAAgB,qBAAqB,OAA0C;CAC7E,MAAM,SAAS,YAAY,KAAK;CAChC,OAAO,OAAO,MAAM,KAAK,SAAS,SAAS,MAAM,wBAAQ,IAAI,IAAI,CAAC,CAAC;AACrE;AAMA,SAAS,gBAAgB,SAA+C;CACtE,IAAI,OAAO,YAAY,UAAU,OAAO;CACxC,OAAO,QACJ,KAAK,SACJ,KAAK,SAAS,UAGV,UAAU,KAAK,QAAQ,cAAc,UAAU,GAAG,KAAK,QAAQ,QAAQ,GAAG,GAAG,KAAK,IACjF,KAAK,QAAQ,EACpB,CAAC,CACA,KAAK,IAAI;AACd;AAEA,SAAS,mBAAmB,MAAoC;CAC9D,MAAM,MAAM,SAAS,SAAS,KAAK,KAAK,CAAC,EAAE,aAAa;CACxD,OAAO;EACL,IAAI,KAAK;EACT,MAAM;EACN,UAAU;GAAE,MAAM,KAAK;GAAe,WAAW,OAAO,KAAK,UAAU,KAAK,aAAa,CAAC,CAAC;EAAE;CAC/F;AACF;AAEA,SAAS,sBACP,QACA,QACa;CACb,MAAM,SAAS,SAAS,OAAO,KAAK;CACpC,OAAO,qBAAqB;EAC1B,MAAM;EACN,SACE,QAAQ,iBAAiB,OACrB,OACA,OAAO,YAAY,KAAA,IACjB,KACA,gBAAgB,OAAO,OAAO;EACtC,mBAAmB,SAAS,QAAQ,iBAAiB;EACrD,cAAc;EACd,MAAM,SAAS,QAAQ,IAAI;EAC3B,mBAAmB,QAAQ,sBAAsB;CACnD,CAAC;AACH;AAEA,SAAS,gBAAgB,OAAoC;CAC3D,MAAM,WAA0B,CAAC;CACjC,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,SAAS,SAAS,KAAK,KAAK;EAClC,MAAM,cAAc,QAAQ,cAAc;EAC1C,IAAI,CAAC,aACH,SAAS,KACP,qBAAqB;GACnB,MAAM,KAAK,WAAW,UAAU,cAAc,KAAK;GACnD,SAAS,QAAQ,iBAAiB,OAAO,OAAO,gBAAgB,KAAK,OAAO;GAC5E,mBAAmB,KAAK,qBAAqB,SAAS,QAAQ,iBAAiB;GAC/E,YACE,KAAK,eAAe,KAAA,KAAa,KAAK,WAAW,SAAS,IACtD,KAAK,WAAW,IAAI,kBAAkB,IACtC,KAAA;GACN,MAAM,SAAS,QAAQ,IAAI;GAC3B,mBAAmB,KAAK,sBAAsB;EAChD,CAAC,CACH;EAEF,KAAK,MAAM,UAAU,KAAK,aAAa,WAAW,CAAC,GAAG;GACpD,MAAM,eAAe,SAAS,OAAO,KAAK;GAC1C,MAAM,SAAS,OAAO,kBAAkB,SAAS,cAAc,cAAc;GAC7E,IAAI,aAAa;IAGf,SAAS,KAAK,sBAAsB,QAAQ,MAAM,CAAC;IACnD;GACF;GACA,IAAI,OAAO,WAAW,UAAU;IAC9B,SAAS,KAAK,sBAAsB,QAAQ,MAAM,CAAC;IACnD;GACF;GAIA,IAAI,OAAO,YAAY,KAAA,GACrB,SAAS,KACP,qBAAqB;IAAE,MAAM;IAAU,SAAS,gBAAgB,OAAO,OAAO;GAAE,CAAC,CACnF;EAEJ;CACF;CACA,OAAO;AACT;AAEA,SAAS,SAAS,QAA6C,YAAiC;CAC9F,MAAM,OAAO,cAAc,QAAQ,MAAM;CACzC,OAAO;EACL,OAAO,SAAS,MAAM,KAAK,KAAK;EAChC,aAAa,SAAS,MAAM,WAAW,KAAK;EAU5C,OAAO;EACP,MAAM,eAAe,MAAM,IAAI;EAC/B,KAAK,qBAAqB,MAAM,GAAG,KAAK;CAC1C;AACF;AAEA,SAAS,WACP,QACA,OACe;CACf,MAAM,WAAW,cAAc,QAAQ,QAAQ;CAC/C,IAAI,aAAa,KAAA,GAGf,OAAO;EACL,SAAS,SAAS,SAAS,OAAO,KAAK;EACvC,iBAAiB,SAAS,SAAS,eAAe,KAAK;EACvD,OAAO,SAAS,SAAS,KAAK,KAAK;EACnC,UAAU,SAAS,SAAS,QAAQ,KAAK;EACzC,gBAAgB,SAAS,SAAS,cAAc,KAAK;EACrD,GAAI,SAAS,gBAAgB,KAAA,IACzB,EAAE,aAAa,SAAS,SAAS,WAAW,KAAK,KAAK,IACtD,CAAC;EACL,GAAI,SAAS,gBAAgB,KAAA,IACzB,EAAE,aAAa,SAAS,SAAS,WAAW,KAAK,KAAK,IACtD,CAAC;EACL,GAAI,SAAS,0BAA0B,KAAA,IACnC,EAAE,uBAAuB,SAAS,SAAS,qBAAqB,KAAK,KAAK,IAC1E,CAAC;EACL,UAAU,SAAS,SAAS,QAAQ,IAAI,SAAS,WAAW;CAC9D;CAEF,OAAO;EACL,SAAS,MAAM;EACf,iBAAiB,MAAM;EACvB,OAAO,MAAM,cAAc;EAC3B,UAAU;EACV,gBAAgB;EAChB,UAAU;CACZ;AACF;AAEA,SAAS,cAAc,QAA+D;CACpF,MAAM,YAAY,cAAc,QAAQ,WAAW;CACnD,OAAO;EACL,YAAY,SAAS,WAAW,UAAU,KAAK;EAC/C,SAAS,SAAS,WAAW,OAAO,KAAK;EACzC,gBAAgB,SAAS,WAAW,cAAc,KAAK;CACzD;AACF;AAEA,SAAS,SAAS,OAAyD;CACzE,MAAM,WAAW,OAAO;CACxB,MAAM,QAAQ,SAAS,QAAQ,IAAI,WAAW,KAAA;CAC9C,MAAM,QAAQ,qBAAqB,OAAO,cAAc;CACxD,OAAO;EACL,KAAK,eAAe,OAAO,cAAc;EACzC,WAAW,eAAe,OAAO,mBAAmB;EACpD,YAAY,eAAe,OAAO,uBAAuB;EACzD,kBAAkB,eAAe,OAAO,gBAAgB;EACxD,YAAY,eAAe,OAAO,mBAAmB;EACrD,aAAa,eAAe,OAAO,kBAAkB;EACrD,QAAQ,eAAe,OAAO,MAAM;EACpC,GAAI,UAAU,KAAA,IAAY,EAAE,gBAAgB,MAAM,IAAI,CAAC;CACzD;AACF;;;;;;;;;;;AAYA,SAAS,eAAe,OAAoC;CAC1D,MAAM,QAAuB,CAAC;CAC9B,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,WAAW,SAAS;EAC7B,MAAM,QAAQ,qBAAqB,KAAK,cAAc;EACtD,MAAM,YAAY,eAAe,KAAK,SAAS,gBAAgB;EAC/D,MAAM,gBAAgB,eAAe,KAAK,SAAS,oBAAoB;EACvE,MAAM,WAAW,cAAc,KAAK,SAAS,QAAQ;EACrD,IACE,UAAU,KAAA,KACV,cAAc,KAAA,KACd,kBAAkB,KAAA,KAClB,aAAa,KAAA,GAEb;EAEF,MAAM,KAAK;GACT,MAAM;GACN,MAAM,KAAK,cAAc;GACzB,GAAI,UAAU,KAAA,IAAY,EAAE,gBAAgB,MAAM,IAAI,CAAC;GACvD,GAAI,cAAc,KAAA,IAAY,EAAE,kBAAkB,UAAU,IAAI,CAAC;GACjE,GAAI,kBAAkB,KAAA,IAAY,EAAE,sBAAsB,cAAc,IAAI,CAAC;GAC7E,GAAI,aAAa,KAAA,IAAY,EAAE,SAAS,IAAI,CAAC;EAC/C,CAAC;CACH;CACA,OAAO;AACT;;;;;;;;AASA,SAAS,WAAW,aAAiC,OAAkC;CACrF,MAAM,QAAkB,CAAC;CACzB,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,MAAM,OAAO,CAAC,GAAI,aAAa,MAAM,KAAK,KAAK,CAAC,GAAI,GAAG,KAAK,GAAG;EAClE,MAAM,SAAS,IAAI,KAAK;EACxB,IAAI,OAAO,WAAW,KAAK,KAAK,IAAI,MAAM,GAAG;EAC7C,KAAK,IAAI,MAAM;EACf,MAAM,KAAK,MAAM;CACnB;CACA,OAAO,MAAM,KAAK,KAAK;AACzB;AAOA,SAAS,WACP,YACA,UACA,YACa;CACb,MAAM,SAAS,SAAS,WAAW,KAAK;CACxC,MAAM,YACJ,SAAS,QAAQ,UAAU,KAAK,WAAW,iBAAiB,WAAW;CACzE,IAAI,cAAc,KAAA,KAAa,UAAU,WAAW,GAClD,MAAM,IAAI,MACR,+HACF;CAEF,MAAM,UAAU,cAAc,QAAQ,SAAS;CAC/C,MAAM,aAAa,cAAc,QAAQ,YAAY;CACrD,MAAM,UAAU,YAAY;CAC5B,MAAM,cAAc,SAAS,YAAY,GAAG;CAC5C,MAAM,OAAO,QAAQ;CACrB,MAAM,gBAAgB,QAAQ;CAI9B,MAAM,cAAc,eAAe,WAAW,KAAK;CACnD,MAAM,QAAmC,MAAM,QAAQ,aAAa,IAC/D,gBACD,YAAY,SAAS,IACnB,cACA,KAAA;CACN,MAAM,WAAW,gBAAgB,WAAW,KAAK;CACjD,MAAM,OAAoB;EACxB,QAAQ;EACR,YAAY;EAGZ,mBAAmB,YAAY,SAAS,QAAQ,iBAAiB,KAAK;EACtE,QAAQ,SAAS,QAAQ,MAAM,KAAK,WAAW,cAAc;EAG7D,eAAe,SAAS,QAAQ,aAAa,KAAK;EAClD,cAAc,SAAS,QAAQ,YAAY,KAAK;EAChD,YAAY,qBAAqB,QAAQ,UAAU,KAAK;EACxD,iBAAiB,qBAAqB,QAAQ,eAAe,KAAK;EAClE,MAAM,cAAc,SAAS,IAAmB,IAAK,OAAuB;EAC5E,MAAM,SAAS,QAAQ,SAAS;EAChC,QAAQ,WAAW,QAAQ,WAAW,KAAK;EAC3C;EACA,WAAW,WAAW,MAAM,oBAAoB,CAAC;EACjD,GAAI,UAAU,KAAA,IAAY,EAAE,OAAO,MAAM,IAAI,CAAC;EAC9C,SAAS;GAGP,QAAQ;GACR,eAAe;GACf,SAAS;GACT,SAAS,SAAS,SAAS,OAAO,IAAI,QAAQ,UAAU,CAAC;GACzD,cAAc,OAAO,SAAS,iBAAiB,YAAY,QAAQ,eAAe;GAClF,cACE,OAAO,SAAS,iBAAiB,YAC7B,QAAQ,eACR,WAAW,6BAA6B,KAAA;GAC9C,OAAO,SAAS,SAAS,KAAK,KAAK;GAMnC,gBAAgB,SAAS,mBAAmB;EAC9C;EACA,MAAM,SAAS,WAAW,aAAa;EACvC,WAAW,cAAc,MAAM;EAC/B,YAAY;GACV,aAAa,SAAS,YAAY,WAAW,KAAK;GAClD,SAAS,iBAAiB,SAAS,OAAyB,IACvD,UACD;GACJ,KAAK,WAAW,aAAa,CAAC,iBAAiB,CAAC;GAQhD,GAAI,SAAS,YAAY,cAAc,IACnC,EAAE,gBAAgB,WAAW,eAAgC,IAC7D,CAAC;EACP;CACF;CACA,kBAAkB,MAAM,8CAA8C,WAAW;CACjF,OAAO;AACT;;;;;;;;;;AAWA,SAAgB,qBACd,YACA,UAA6B,CAAC,GACf;CACf,MAAM,cAAc,QAAQ,MAAM,qBAAK,IAAI,KAAK,EAAA,CAAG,YAAY;CAC/D,MAAM,QAAuB,CAAC;CAC9B,MAAM,QAAQ,MAAwB,UAAyB,WAA8B;EAC3F,MAAM,OAAO,WAAW,MAAM,UAAU,UAAU;EAClD,IAAI,OAAO,IAAI,KAAK,UAAU,GAC5B,MAAM,IAAI,MAAM,qDAAqD,KAAK,YAAY;EAExF,OAAO,IAAI,KAAK,UAAU;EAC1B,MAAM,KAAK,IAAI;EACf,KAAK,MAAM,SAAS,KAAK,yBAAyB,CAAC,GACjD,KAAK,OAAO,KAAK,YAAY,MAAM;EAErC,OAAO,OAAO,KAAK,UAAU;CAC/B;CACA,KAAK,YAAY,sBAAM,IAAI,IAAI,CAAC;CAChC,OAAO;AACT;;;;;;;;;;;;;;;AAgBA,SAAgB,qBACd,OACA,OACe;CACf,IAAI,CAAC,eAAe,SAAS,KAAK,GAChC,MAAM,IAAI,MAAM,uCAAuC,OAAO,KAAK,GAAG;CAExE,OAAO,MAAM,KAAK,UAAU;EAAE,GAAG;EAAM,MAAM;GAAE,GAAG,KAAK;GAAM;EAAM;CAAE,EAAE;AACzE"}

package/dist/{rubric-predictive-validity-w2klGv1u.d.ts → rubric-predictive-validity-DQBQj6uV.d.ts}

@@ -1,4 +1,4 @@
-import { a as RunRecord } from "./run-record-DwHMk1Ai.js";
+import { a as RunRecord } from "./run-record-CztDMXVF.js";
 import { o as OutcomeStore } from "./outcome-store-BYHIuO0e.js";
 //#region src/meta-eval/rubric-predictive-validity.d.ts
 interface RubricPredictiveValidityInput {
@@ -71,4 +71,4 @@ interface RubricPredictiveValidityReport {
 declare function rubricPredictiveValidity(input: RubricPredictiveValidityInput): Promise<RubricPredictiveValidityReport>;
 //#endregion
 export { rubricPredictiveValidity as a, RubricRanking as i, RubricPredictiveValidityInput as n, RubricPredictiveValidityReport as r, RubricOutcomePair as t };
-//# sourceMappingURL=rubric-predictive-validity-w2klGv1u.d.ts.map
+//# sourceMappingURL=rubric-predictive-validity-DQBQj6uV.d.ts.map

package/dist/{rubric-predictive-validity-w2klGv1u.d.ts.map → rubric-predictive-validity-DQBQj6uV.d.ts.map}

@@ -1 +1 @@
-{"version":3,"file":"rubric-predictive-validity-w2klGv1u.d.ts","names":[],"sources":["../src/meta-eval/rubric-predictive-validity.ts"],"mappings":";;;UAoCiB;;;;;EAKf,MAAM;EACN,UAAU;;;;;;EAMV;;;;;;EAMA;;EAEA;;EAEA;;EAEA;;;;;EAKA;;UAGe;EACf;EACA;EACA;EACA;EACA;EACA;IAAQ;IAAa;;;;;;;;EAOrB;;UAGe;EACf;;EAEA;EACA;EACA;EACA;EACA,SAAS;;UAGM;EACf,OAAO;;EAEP,QAAQ;EACR;EACA;;EAEA;;iBAGoB,yBACpB,OAAO,gCACN,QAAQ"}
+{"version":3,"file":"rubric-predictive-validity-DQBQj6uV.d.ts","names":[],"sources":["../src/meta-eval/rubric-predictive-validity.ts"],"mappings":";;;UAoCiB;;;;;EAKf,MAAM;EACN,UAAU;;;;;;EAMV;;;;;;EAMA;;EAEA;;EAEA;;EAEA;;;;;EAKA;;UAGe;EACf;EACA;EACA;EACA;EACA;EACA;IAAQ;IAAa;;;;;;;;EAOrB;;UAGe;EACf;;EAEA;EACA;EACA;EACA;EACA,SAAS;;UAGM;EACf,OAAO;;EAEP,QAAQ;EACR;EACA;;EAEA;;iBAGoB,yBACpB,OAAO,gCACN,QAAQ"}

package/dist/{run-evidence-CbE0A8Xg.d.ts → run-evidence-C4RcRQT5.d.ts}

@@ -1,8 +1,8 @@
 import { o as FailureClass } from "./schema-BtVldJ3T.js";
-import { a as RunRecord, c as RunTaskFailure, s as RunSplitTag, u as RunTokenUsage } from "./run-record-DwHMk1Ai.js";
+import { a as RunRecord, c as RunTaskFailure, s as RunSplitTag, u as RunTokenUsage } from "./run-record-CztDMXVF.js";
 import { s as TraceStore } from "./store-CT9YIIve.js";
 import { i as TraceEmitter } from "./emitter-DGQGoLyj.js";
-import { $ as ControlRunResult, Q as ControlEvalResult, a as FeedbackLabel, et as ControlRuntimeConfig, x as ProposedSideEffect } from "./feedback-trajectory-CoNep7rl.js";
+import { $ as ControlRunResult, Q as ControlEvalResult, a as FeedbackLabel, et as ControlRuntimeConfig, x as ProposedSideEffect } from "./feedback-trajectory-BJUWOkJM.js";
 //#region src/action-policy.d.ts
 interface ActionExecutionPolicy {
   allowedTypes?: string[];
@@ -222,4 +222,4 @@ declare function controlRunToRunRecord<TState, TAction, TActionResult, TEval ext
 declare function scoreFromEvals(evals: readonly ControlEvalResult[]): number | undefined;
 //#endregion
 export { ActionExecutionPolicy as A, ReviewMemoryStore as C, inMemoryReviewStore as D, createLlmReviewer as E, evaluateActionPolicy as M, jsonlReviewStore as O, ReviewMemoryEntry as S, VerifyFn as T, ProposeReviewReport as _, ProposeReviewControlAction as a, ReviewFn as b, ProposeReviewControlState as c, LlmJsonCall as d, LlmReviewerConfig as f, ProposeReviewConfig as g, ProposeOutput as h, scoreFromEvals as i, ActionPolicyDecision as j, runProposeReview as k, controlFailureClassFromVerification as l, ProposeInput as m, RunEvidenceMetadata as n, ProposeReviewControlConfig as o, ProposeFn as p, controlRunToRunRecord as r, ProposeReviewControlResult as s, ControlRunToRunRecordOptions as t, runProposeReviewAsControlLoop as u, ProposeReviewShot as v, Verification as w, ReviewInput as x, Review as y };
-//# sourceMappingURL=run-evidence-CbE0A8Xg.d.ts.map
+//# sourceMappingURL=run-evidence-C4RcRQT5.d.ts.map

package/dist/{run-evidence-CbE0A8Xg.d.ts.map → run-evidence-C4RcRQT5.d.ts.map}

@@ -1 +1 @@
-{"version":3,"file":"run-evidence-CbE0A8Xg.d.ts","names":[],"sources":["../src/action-policy.ts","../src/propose-review.ts","../src/propose-review-control.ts","../src/run-evidence.ts"],"mappings":";;;;;;UAEiB;EACf;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;UAGe;EACf;EACA;EACA;EACA;EACA,QAAQ;;iBAGM,qBACd,QAAQ,oBACR,SAAQ,uBACR;EAAW;IACV;;;UCmBc;EACf;EACA;EACA;EACA;;UAGe;EACf;EACA;EACA;EACA;EACA;;UAGe,0BAA0B;EACzC;EACA;EACA;IACE;IACA;IACA;;;UAIa,aAAa;EAC5B;EACA;EACA,OAAO;EACP,aAAa;EACb,aAAa;EACb,UAAU;;UAGK,cAAc,OAAO;EACpC,OAAO;EACP,eAAe;;UAGA,YAAY,OAAO;EAClC;EACA;EACA,OAAO;EACP,cAAc;EACd,cAAc;EACd,QAAQ;;KAGE,UAAU,OAAO,sBAC3B,OAAO,aAAa,WACjB,QAAQ,cAAc,OAAO;KAEtB,SAAS,UAAU,OAAO,UAAU,QAAQ;KAE5C,SAAS,OAAO,sBAC1B,OAAO,YAAY,OAAO,aACvB,QAAQ;UAEI;EACf,QAAQ,QAAQ;EAChB,OAAO,OAAO,oBAAoB;;UAGnB,oBAAoB,OAAO;EAC1C;EACA,cAAc;EACd,SAAS,UAAU,OAAO;EAC1B,QAAQ,SAAS;EACjB,QAAQ,SAAS,OAAO;;EAExB;;EAEA;;;;;;EAMA;EACA;;EAEA,SAAS;;EAET,QAAQ;EACR;EACA;EACA;;;;;EAKA;;UAGe,kBAAkB,OAAO;EACxC;EACA,OAAO;EACP,cAAc;EACd,cAAc;EACd,QAAQ;EACR;EACA;EACA;;UAGe,oBAAoB,OAAO;EAC1C;EACA;EACA,OAAO,kBAAkB,OAAO;EAChC,YAAY;EACZ,mBAAmB;EACnB,eAAe;EACf;EACA;;iBAKc,oBAAoB,UAAS,sBAA2B;iBAYxD,iBAAiB,eAAe;iBA8B1B,iBAAiB,OAAO,mBAC5C,QAAQ,oBAAoB,OAAO,WAClC,QAAQ,oBAAoB,OAAO;KAiN1B,eAAe;EAAO;EAAgB;MAAmB;UAEpD,kBAAkB,OAAO;EACxC,UAAU;EACV,eAAe,OAAO;EACtB,sBAAsB,SAAS;;EAE/B;;iBAQc,kBAAkB,OAAO,mBACvC,KAAK,kBAAkB,OAAO,WAC7B,SAAS,OAAO;;;UC9ZF,0BAA0B,OAAO;EAChD;EACA,OAAO;EACP,aAAa;EACb,cAAc;EACd,eAAe;EACf,QAAQ;EACR;EACA;EACA;;UAGe;EACf;EACA;;UAGe,2BAA2B,OAAO;EACjD,OAAO;EACP,cAAc;EACd,eAAe;EACf,QAAQ;EACR;EACA;;UAGe,2BAA2B,OAAO;EACjD;EACA,cAAc;EACd,SAAS,UAAU,OAAO;EAC1B,QAAQ,SAAS;EACjB,QAAQ,SAAS,OAAO;EACxB;EACA;EACA,SAAS;EACT,QAAQ;EACR;EACA;EACA;EACA;EACA;EACA;EACA,gCAAgC,cAAc,iBAAiB;EAC/D,gBAAgB,qBACd,0BAA0B,OAAO,UACjC,4BACA,2BAA2B,OAAO;;iBAOhB,8BAA8B,OAAO,mBACzD,QAAQ,2BAA2B,OAAO,WACzC,QACD,iBACE,0BAA0B,OAAO,UACjC,4BACA,2BAA2B,OAAO;iBAwKtB,oCACd,cAAc,eACb;;;UChPc;EACf;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,UAAU;EACV,YAAY;EACZ,gBAAgB;EAChB;EACA,gBAAgB;EAChB,MAAM;;KAGI,+BAA+B,sBACzC;EACE;EACA;;;;;;;;;;iBAWY,sBACd,QACA,SACA,eACA,cAAc,oBAAoB,mBAElC,KAAK,iBAAiB,QAAQ,SAAS,eAAe,QACtD,SAAS,+BACR;iBAwDa,eAAe,gBAAgB"}
+{"version":3,"file":"run-evidence-C4RcRQT5.d.ts","names":[],"sources":["../src/action-policy.ts","../src/propose-review.ts","../src/propose-review-control.ts","../src/run-evidence.ts"],"mappings":";;;;;;UAEiB;EACf;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;UAGe;EACf;EACA;EACA;EACA;EACA,QAAQ;;iBAGM,qBACd,QAAQ,oBACR,SAAQ,uBACR;EAAW;IACV;;;UCmBc;EACf;EACA;EACA;EACA;;UAGe;EACf;EACA;EACA;EACA;EACA;;UAGe,0BAA0B;EACzC;EACA;EACA;IACE;IACA;IACA;;;UAIa,aAAa;EAC5B;EACA;EACA,OAAO;EACP,aAAa;EACb,aAAa;EACb,UAAU;;UAGK,cAAc,OAAO;EACpC,OAAO;EACP,eAAe;;UAGA,YAAY,OAAO;EAClC;EACA;EACA,OAAO;EACP,cAAc;EACd,cAAc;EACd,QAAQ;;KAGE,UAAU,OAAO,sBAC3B,OAAO,aAAa,WACjB,QAAQ,cAAc,OAAO;KAEtB,SAAS,UAAU,OAAO,UAAU,QAAQ;KAE5C,SAAS,OAAO,sBAC1B,OAAO,YAAY,OAAO,aACvB,QAAQ;UAEI;EACf,QAAQ,QAAQ;EAChB,OAAO,OAAO,oBAAoB;;UAGnB,oBAAoB,OAAO;EAC1C;EACA,cAAc;EACd,SAAS,UAAU,OAAO;EAC1B,QAAQ,SAAS;EACjB,QAAQ,SAAS,OAAO;;EAExB;;EAEA;;;;;;EAMA;EACA;;EAEA,SAAS;;EAET,QAAQ;EACR;EACA;EACA;;;;;EAKA;;UAGe,kBAAkB,OAAO;EACxC;EACA,OAAO;EACP,cAAc;EACd,cAAc;EACd,QAAQ;EACR;EACA;EACA;;UAGe,oBAAoB,OAAO;EAC1C;EACA;EACA,OAAO,kBAAkB,OAAO;EAChC,YAAY;EACZ,mBAAmB;EACnB,eAAe;EACf;EACA;;iBAKc,oBAAoB,UAAS,sBAA2B;iBAYxD,iBAAiB,eAAe;iBA8B1B,iBAAiB,OAAO,mBAC5C,QAAQ,oBAAoB,OAAO,WAClC,QAAQ,oBAAoB,OAAO;KAiN1B,eAAe;EAAO;EAAgB;MAAmB;UAEpD,kBAAkB,OAAO;EACxC,UAAU;EACV,eAAe,OAAO;EACtB,sBAAsB,SAAS;;EAE/B;;iBAQc,kBAAkB,OAAO,mBACvC,KAAK,kBAAkB,OAAO,WAC7B,SAAS,OAAO;;;UC9ZF,0BAA0B,OAAO;EAChD;EACA,OAAO;EACP,aAAa;EACb,cAAc;EACd,eAAe;EACf,QAAQ;EACR;EACA;EACA;;UAGe;EACf;EACA;;UAGe,2BAA2B,OAAO;EACjD,OAAO;EACP,cAAc;EACd,eAAe;EACf,QAAQ;EACR;EACA;;UAGe,2BAA2B,OAAO;EACjD;EACA,cAAc;EACd,SAAS,UAAU,OAAO;EAC1B,QAAQ,SAAS;EACjB,QAAQ,SAAS,OAAO;EACxB;EACA;EACA,SAAS;EACT,QAAQ;EACR;EACA;EACA;EACA;EACA;EACA;EACA,gCAAgC,cAAc,iBAAiB;EAC/D,gBAAgB,qBACd,0BAA0B,OAAO,UACjC,4BACA,2BAA2B,OAAO;;iBAOhB,8BAA8B,OAAO,mBACzD,QAAQ,2BAA2B,OAAO,WACzC,QACD,iBACE,0BAA0B,OAAO,UACjC,4BACA,2BAA2B,OAAO;iBAwKtB,oCACd,cAAc,eACb;;;UChPc;EACf;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,UAAU;EACV,YAAY;EACZ,gBAAgB;EAChB;EACA,gBAAgB;EAChB,MAAM;;KAGI,+BAA+B,sBACzC;EACE;EACA;;;;;;;;;;iBAWY,sBACd,QACA,SACA,eACA,cAAc,oBAAoB,mBAElC,KAAK,iBAAiB,QAAQ,SAAS,eAAe,QACtD,SAAS,+BACR;iBAwDa,eAAe,gBAAgB"}

package/dist/{run-record-DwHMk1Ai.d.ts → run-record-CztDMXVF.d.ts}

@@ -1,6 +1,6 @@
 import { l as ValidationError } from "./errors-DkfjIDvD.js";
 import { r as AgentProfileCell } from "./agent-profile-cell-Cw0PVwDr.js";
-import { p as CostProvenance } from "./cost-ledger-B1D3COAc.js";
+import { p as CostProvenance } from "./cost-ledger-DKgyIWRj.js";
 import { o as FailureClass } from "./schema-BtVldJ3T.js";
 //#region src/run-record.d.ts
 /** Search/dev/holdout split tag. 'search' is the paper-grade alias for the
@@ -240,4 +240,4 @@ declare function roundTripRunRecord(record: RunRecord): RunRecord;
 declare function modelHasSnapshot(model: string): boolean;
 //#endregion
 export { RunRecord as a, RunTaskFailure as c, isRunRecord as d, modelHasSnapshot as f, validateRunRecord as g, runTaskScore as h, RunOutcome as i, RunTerminalOutcome as l, roundTripRunRecord as m, RunCostProvenance as n, RunRecordValidationError as o, parseRunRecordSafe as p, RunJudgeMetadata as r, RunSplitTag as s, JudgeScoresRecord as t, RunTokenUsage as u };
-//# sourceMappingURL=run-record-DwHMk1Ai.d.ts.map
+//# sourceMappingURL=run-record-CztDMXVF.d.ts.map

package/dist/{run-record-DwHMk1Ai.d.ts.map → run-record-CztDMXVF.d.ts.map}

@@ -1 +1 @@
-{"version":3,"file":"run-record-DwHMk1Ai.d.ts","names":[],"sources":["../src/run-record.ts"],"mappings":";;;;;;;KAsCY;;;;;;;KAQA;UAEK;EACf;;EAEA;;EAEA;;EAEA;;EAEA;;;KAIU,oBAAoB;UAEf;EACf;EACA;;;EAGA;;;EAGA;;;;;;;;;;;;;;;;;;;;;UAsBe;;EAEf,UAAU,eAAe;;EAEzB,YAAY;;;EAGZ;;;;EAIA;;;EAGA;;UAGe;;;EAGf;;;EAGA;;;;EAIA,KAAK;;;;;;EAML,cAAc;;;;;;;EAOd;IAAa;IAAe;IAAgB;;;;;;;;;;;;;;;;;;;UAmB7B;;EAEf;;;EAGA;;;EAGA;;;EAGA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA,gBAAgB;;EAEhB,YAAY;;EAEZ,iBAAiB;;;EAGjB;;EAEA,gBAAgB;;EAEhB,SAAS;;;;;EAKT,eAAe;;;EAGf;;EAEA,UAAU;;;;;EAKV;;;;;;;;EAQA,eAAe;;;;;;;;;KAUL;EACN;EAA0B;;EAC1B;EAAyB;;EAEzB,cAAc,QAAQ;EACtB;;;;;;;;;;iBAWU,aAAa,QAAQ;cAmCxB,iCAAiC;WACnC;EACT,YAAY,iBAAiB;;;;;;;iBAWf,kBAAkB,iBAAiB;;iBAiOnC,YAAY,iBAAiB,SAAS;;iBAUtC,mBACd;EACG;EAAU,OAAO;;EAAgB;EAAW,OAAO;;;iBAUxC,mBAAmB,QAAQ,YAAY;;;;;;;;;;;iBA2FvC,iBAAiB"}
+{"version":3,"file":"run-record-CztDMXVF.d.ts","names":[],"sources":["../src/run-record.ts"],"mappings":";;;;;;;KAsCY;;;;;;;KAQA;UAEK;EACf;;EAEA;;EAEA;;EAEA;;EAEA;;;KAIU,oBAAoB;UAEf;EACf;EACA;;;EAGA;;;EAGA;;;;;;;;;;;;;;;;;;;;;UAsBe;;EAEf,UAAU,eAAe;;EAEzB,YAAY;;;EAGZ;;;;EAIA;;;EAGA;;UAGe;;;EAGf;;;EAGA;;;;EAIA,KAAK;;;;;;EAML,cAAc;;;;;;;EAOd;IAAa;IAAe;IAAgB;;;;;;;;;;;;;;;;;;;UAmB7B;;EAEf;;;EAGA;;;EAGA;;;EAGA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA,gBAAgB;;EAEhB,YAAY;;EAEZ,iBAAiB;;;EAGjB;;EAEA,gBAAgB;;EAEhB,SAAS;;;;;EAKT,eAAe;;;EAGf;;EAEA,UAAU;;;;;EAKV;;;;;;;;EAQA,eAAe;;;;;;;;;KAUL;EACN;EAA0B;;EAC1B;EAAyB;;EAEzB,cAAc,QAAQ;EACtB;;;;;;;;;;iBAWU,aAAa,QAAQ;cAmCxB,iCAAiC;WACnC;EACT,YAAY,iBAAiB;;;;;;;iBAWf,kBAAkB,iBAAiB;;iBAiOnC,YAAY,iBAAiB,SAAS;;iBAUtC,mBACd;EACG;EAAU,OAAO;;EAAgB;EAAW,OAAO;;;iBAUxC,mBAAmB,QAAQ,YAAY;;;;;;;;;;;iBA2FvC,iBAAiB"}

package/dist/{semantic-concept-judge-DYXDPZW0.js → semantic-concept-judge-BuIJ9IfB.js}

@@ -1,11 +1,48 @@
 import { o as NotFoundError } from "./errors-D-LKuDhb.js";
-import { i as CostLedger } from "./cost-ledger-CHDLA0Ss.js";
-import { c as callLlmJson, f as maximumChargeForLlmRequest, l as costReceiptFromLlm, u as costReceiptFromLlmError } from "./llm-client-Cj3c7PEm.js";
-import { p as computeFindingId } from "./single-run-lock-D_bS5xhj.js";
-import { f as Mutex } from "./ledger-core-C0Yx1I14.js";
+import { i as CostLedger } from "./cost-ledger-CZ9diLxY.js";
+import { c as callLlmJson, f as maximumChargeForLlmRequest, l as costReceiptFromLlm, u as costReceiptFromLlmError } from "./llm-client-bkztEfIx.js";
+import { a as computeFindingId } from "./usage-receipt-CgxMEBZq.js";
 import { a as clamp01, i as aggregateRunScore } from "./proposal-findings-2GIUo1et.js";
+import { f as Mutex } from "./ledger-core-Dxz0Rkwa.js";
 import { appendFileSync, existsSync, mkdirSync, readFileSync, readdirSync, statSync } from "node:fs";
 import { dirname, join } from "node:path";
+//#region src/analyst/define.ts
+/**
+* Define a reusable trace-research question.
+*
+* The returned value contains no model, credentials, or execution state. Bind
+* it to any TraceAnalysisEngine with `runTraceAnalyst` or
+* `createTraceAnalyst`.
+*/
+function defineTraceAnalyst(definition) {
+	for (const [name, value] of [
+		["id", definition.id],
+		["description", definition.description],
+		["area", definition.area],
+		["version", definition.version],
+		["instructions", definition.instructions]
+	]) if (typeof value !== "string" || !value.trim()) throw new TypeError(`defineTraceAnalyst: ${name} must be a non-empty string`);
+	return {
+		...definition,
+		limits: definition.limits ? { ...definition.limits } : void 0
+	};
+}
+function defineCustomAnalyst(options) {
+	if (!options.id.trim()) throw new TypeError("defineCustomAnalyst: id must not be empty");
+	if (!options.description.trim()) throw new TypeError("defineCustomAnalyst: description must not be empty");
+	if (options.cost === void 0) throw new TypeError("defineCustomAnalyst: cost must be declared");
+	if ("executionConfig" in options && (!options.executionConfig || typeof options.executionConfig !== "object" || Array.isArray(options.executionConfig))) throw new TypeError("defineCustomAnalyst: executionConfig must be an object");
+	return {
+		id: options.id,
+		description: options.description,
+		version: options.version ?? "1.0.0",
+		inputKind: "trace-store",
+		cost: options.cost,
+		analyze: options.analyze,
+		..."executionConfig" in options ? { executionConfig: options.executionConfig } : {}
+	};
+}
+//#endregion
 //#region src/locked-jsonl-appender.ts
 /**
 * LockedJsonlAppender — mutex-serialized JSONL append helper for arbitrary
@@ -725,6 +762,6 @@ function createSemanticConceptJudge(options = {}) {
 	return (input) => runSemanticConceptJudge(input, options);
 }
 //#endregion
-export { RunCritic as a, buildSkillUsageReport as c, defaultIsMaterial as d, diffFindings as f, runSemanticConceptJudge as i, emitSkillUsageFindings as l, SEMANTIC_CONCEPT_JUDGE_VERSION as n, SKILL_USAGE_ANALYST as o, LockedJsonlAppender as p, createSemanticConceptJudge as r, SkillUsageAnalyst as s, DEFAULT_COMPLEXITY_WEIGHTS as t, FindingsStore as u };
+export { RunCritic as a, buildSkillUsageReport as c, defaultIsMaterial as d, diffFindings as f, defineTraceAnalyst as h, runSemanticConceptJudge as i, emitSkillUsageFindings as l, defineCustomAnalyst as m, SEMANTIC_CONCEPT_JUDGE_VERSION as n, SKILL_USAGE_ANALYST as o, LockedJsonlAppender as p, createSemanticConceptJudge as r, SkillUsageAnalyst as s, DEFAULT_COMPLEXITY_WEIGHTS as t, FindingsStore as u };
 
-//# sourceMappingURL=semantic-concept-judge-DYXDPZW0.js.map
+//# sourceMappingURL=semantic-concept-judge-BuIJ9IfB.js.map

package/dist/semantic-concept-judge-BuIJ9IfB.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantic-concept-judge-BuIJ9IfB.js","names":[],"sources":["../src/analyst/define.ts","../src/locked-jsonl-appender.ts","../src/analyst/findings-store.ts","../src/analyst/kinds/skill-usage.ts","../src/run-critic.ts","../src/semantic-concept-judge.ts"],"sourcesContent":["import type { TraceAnalysisStore } from '../trace-analyst/store'\nimport type { ExactCapableAnalyst } from './exact-types'\nimport type { TraceAnalystDefinition } from './kind-factory'\nimport type { Analyst, AnalystCost } from './types'\n\n/**\n * Define a reusable trace-research question.\n *\n * The returned value contains no model, credentials, or execution state. Bind\n * it to any TraceAnalysisEngine with `runTraceAnalyst` or\n * `createTraceAnalyst`.\n */\nexport function defineTraceAnalyst(definition: TraceAnalystDefinition): TraceAnalystDefinition {\n  for (const [name, value] of [\n    ['id', definition.id],\n    ['description', definition.description],\n    ['area', definition.area],\n    ['version', definition.version],\n    ['instructions', definition.instructions],\n  ] as const) {\n    if (typeof value !== 'string' || !value.trim()) {\n      throw new TypeError(`defineTraceAnalyst: ${name} must be a non-empty string`)\n    }\n  }\n  return {\n    ...definition,\n    limits: definition.limits ? { ...definition.limits } : undefined,\n  }\n}\n\nexport interface DefineCustomAnalystOptions {\n  id: string\n  description: string\n  version?: string\n  cost: AnalystCost\n  analyze: Analyst<TraceAnalysisStore>['analyze']\n}\n\nexport interface DefineExactCustomAnalystOptions extends DefineCustomAnalystOptions {\n  /** Canonical JSON for behavior knobs not already bound by `version`. */\n  executionConfig: Readonly<Record<string, unknown>>\n}\n\n/** Construct a registrable analyst from a hand-written analyze function. */\nexport function defineCustomAnalyst(\n  options: DefineExactCustomAnalystOptions,\n): ExactCapableAnalyst<TraceAnalysisStore>\nexport function defineCustomAnalyst(\n  options: DefineCustomAnalystOptions,\n): Analyst<TraceAnalysisStore>\nexport function defineCustomAnalyst(\n  options: DefineCustomAnalystOptions | DefineExactCustomAnalystOptions,\n): Analyst<TraceAnalysisStore> | ExactCapableAnalyst<TraceAnalysisStore> {\n  if (!options.id.trim()) throw new TypeError('defineCustomAnalyst: id must not be empty')\n  if (!options.description.trim()) {\n    throw new TypeError('defineCustomAnalyst: description must not be empty')\n  }\n  if (options.cost === undefined) {\n    throw new TypeError('defineCustomAnalyst: cost must be declared')\n  }\n  if (\n    'executionConfig' in options &&\n    (!options.executionConfig ||\n      typeof options.executionConfig !== 'object' ||\n      Array.isArray(options.executionConfig))\n  ) {\n    throw new TypeError('defineCustomAnalyst: executionConfig must be an object')\n  }\n  return {\n    id: options.id,\n    description: options.description,\n    version: options.version ?? '1.0.0',\n    inputKind: 'trace-store',\n    cost: options.cost,\n    analyze: options.analyze,\n    ...('executionConfig' in options ? { executionConfig: options.executionConfig } : {}),\n  }\n}\n","/**\n * LockedJsonlAppender — mutex-serialized JSONL append helper for arbitrary\n * payloads. The reference-replay store does the same thing for typed\n * `ReferenceReplayRun` rows; this is the generic version used by\n * `MutationTelemetry`, `TrialTelemetry`, and any other consumer that wants\n * append-only durable telemetry without rolling its own lock.\n *\n * Locks are per absolute file path (process-local). Cross-process\n * concurrency is NOT addressed — that's an fcntl/flock problem.\n */\n\nimport { appendFileSync, existsSync, mkdirSync } from 'node:fs'\nimport { dirname } from 'node:path'\nimport { Mutex } from './concurrency'\n\nconst mutexes = new Map<string, Mutex>()\n\nfunction getMutex(path: string): Mutex {\n  let m = mutexes.get(path)\n  if (!m) {\n    m = new Mutex()\n    mutexes.set(path, m)\n  }\n  return m\n}\n\nexport class LockedJsonlAppender {\n  private readonly mutex: Mutex\n  constructor(public readonly path: string) {\n    this.mutex = getMutex(path)\n    if (!existsSync(dirname(path))) {\n      mkdirSync(dirname(path), { recursive: true })\n    }\n  }\n\n  async append(entry: unknown): Promise<void> {\n    const line = `${JSON.stringify(entry)}\\n`\n    await this.mutex.runExclusive(() => {\n      appendFileSync(this.path, line)\n    })\n  }\n}\n\n/** Reset all internal mutex state — tests only. */\nexport function resetLockedAppendersForTesting(): void {\n  mutexes.clear()\n}\n","/**\n * FindingsStore — durable persistence for AnalystFinding rows + a diff\n * helper so we can answer \"what changed since the last run?\" without\n * recomputing analysts.\n *\n * On-disk shape is JSONL: one finding per line, append-only, locked via\n * LockedJsonlAppender. Operators get crash-safety (no partial JSON),\n * cheap reads (sequential parse), and trivial backup (rsync the file).\n *\n * Reads are non-locking: a reader sees a consistent snapshot of all\n * fully-written lines and skips an incomplete trailing line if the\n * writer is mid-append. Cross-process locking is intentionally out of\n * scope (see locked-jsonl-appender.ts).\n *\n * The store is run-scoped: callers pass `runId` on append and on load,\n * which keeps multi-run files cleanly partitioned. The `diffFindings`\n * helper compares two run-id sets using stable `finding_id` semantics —\n * the diff is the cross-run signal the regression dashboard renders.\n */\n\nimport { existsSync, readFileSync } from 'node:fs'\n\nimport { LockedJsonlAppender } from '../locked-jsonl-appender'\nimport type { AnalystFinding } from './types'\n\n/**\n * One persisted row. We attach `run_id` on disk so a single file can\n * hold multiple runs and the diff helper can query without re-walking\n * separate files.\n */\nexport interface PersistedFinding extends AnalystFinding {\n  run_id: string\n}\n\nexport class FindingsStore {\n  private readonly appender: LockedJsonlAppender\n\n  constructor(public readonly path: string) {\n    this.appender = new LockedJsonlAppender(path)\n  }\n\n  async append(runId: string, findings: AnalystFinding[]): Promise<void> {\n    for (const f of findings) {\n      const row: PersistedFinding = { ...f, run_id: runId }\n      await this.appender.append(row)\n    }\n  }\n\n  /** Load every persisted finding. Discards malformed trailing lines silently. */\n  loadAll(): PersistedFinding[] {\n    if (!existsSync(this.path)) return []\n    const raw = readFileSync(this.path, 'utf8')\n    if (!raw) return []\n    const out: PersistedFinding[] = []\n    for (const line of raw.split('\\n')) {\n      if (!line) continue\n      try {\n        out.push(JSON.parse(line) as PersistedFinding)\n      } catch {\n        // Skip torn trailing line — the lock guarantees no torn lines\n        // mid-file, only at EOF when a writer is in-flight.\n      }\n    }\n    return out\n  }\n\n  /** Filter to a single run. */\n  loadRun(runId: string): PersistedFinding[] {\n    return this.loadAll().filter((r) => r.run_id === runId)\n  }\n}\n\n// ── Cross-run diff ──────────────────────────────────────────────────\n\nexport interface FindingsDiff {\n  /** New finding ids in `current` that weren't in `previous`. */\n  appeared: PersistedFinding[]\n  /** Finding ids in `previous` that aren't in `current`. */\n  disappeared: PersistedFinding[]\n  /** Same finding id present in both runs and unchanged per the materiality test. */\n  persisted: PersistedFinding[]\n  /**\n   * Same finding id in both runs but at least one non-identity field\n   * shifted per `DiffPolicy.isMaterial`. Reported as [previous, current].\n   */\n  changed: Array<{ previous: PersistedFinding; current: PersistedFinding }>\n}\n\nexport interface DiffPolicy {\n  /**\n   * Predicate that decides whether two findings (same finding_id) count\n   * as a material change. Defaults to {@link defaultIsMaterial}: severity\n   * shift, confidence Δ > 0.05, or evidence count change. Compliance /\n   * perf consumers MAY supply a stricter predicate (e.g. rationale text\n   * diff, metric Δ thresholds).\n   */\n  isMaterial?: (previous: AnalystFinding, current: AnalystFinding) => boolean\n}\n\n/**\n * Default materiality test. Deliberately narrow so LLM-reword churn\n * doesn't flood the diff. Stricter tests are opt-in via DiffPolicy.\n */\nexport function defaultIsMaterial(a: AnalystFinding, b: AnalystFinding): boolean {\n  if (a.severity !== b.severity) return true\n  if (Math.abs((a.confidence ?? 0) - (b.confidence ?? 0)) > 0.05) return true\n  if (a.evidence_refs.length !== b.evidence_refs.length) return true\n  return false\n}\n\n/**\n * Diff two findings sets by stable finding_id. Callers typically load\n * the two run-id slices from the same store and pass them in.\n */\nexport function diffFindings(\n  previous: PersistedFinding[],\n  current: PersistedFinding[],\n  policy: DiffPolicy = {},\n): FindingsDiff {\n  const isMaterial = policy.isMaterial ?? defaultIsMaterial\n  const prevById = new Map(previous.map((f) => [f.finding_id, f]))\n  const curById = new Map(current.map((f) => [f.finding_id, f]))\n\n  const appeared: PersistedFinding[] = []\n  const disappeared: PersistedFinding[] = []\n  const persisted: PersistedFinding[] = []\n  const changed: FindingsDiff['changed'] = []\n\n  for (const [id, cur] of curById) {\n    const prev = prevById.get(id)\n    if (!prev) {\n      appeared.push(cur)\n      continue\n    }\n    if (isMaterial(prev, cur)) {\n      changed.push({ previous: prev, current: cur })\n    } else {\n      persisted.push(cur)\n    }\n  }\n  for (const [id, prev] of prevById) {\n    if (!curById.has(id)) disappeared.push(prev)\n  }\n  return { appeared, disappeared, persisted, changed }\n}\n","/**\n * Skill-usage analyst — a DETERMINISTIC `Analyst` over a Claude/Codex skill\n * library + its trace corpus. Unlike the trace-store kinds (failure-mode,\n * improvement, ...) this kind calls no LLM: it mines real usage and skill\n * structure and emits findings by rule.\n *\n * It exists because the naive \"Skill-tool invocation count\" lies low — it\n * misses orchestrated sub-dispatch (a leaf skill run BY /pursue or /governor\n * logs under the parent), slash-command entry, local-script bypass, and\n * on-disk artifacts. The 2026-05-30 skill audit found 39/53 skills at zero\n * direct invocations, yet only one was a genuine cut: the rest were\n * measurement-invisible or discovery-limited. This analyst encodes that\n * lesson as a multi-signal usage model so a cheap repeatable pass can keep\n * the library honest, and so the expensive audit workflow's verdicts can\n * GEPA-distill it toward agreement (see `gold/skill-verdicts.gold.jsonl`).\n *\n * Report-building (`buildSkillUsageReport`, an fs scan) is separated from\n * finding emission (`SkillUsageAnalyst.analyze`, pure) so the slow scan runs\n * once at the registry boundary and the rule logic stays unit-testable.\n */\n\nimport { type Dirent, existsSync, readdirSync, readFileSync, statSync } from 'node:fs'\nimport { join } from 'node:path'\nimport type { ExactCapableAnalyst } from '../exact-types'\nimport type { AnalystContext, AnalystFinding, AnalystSeverity } from '../types'\nimport { computeFindingId } from '../types'\n\n// ── Input model ──────────────────────────────────────────────────────\n\nexport type SkillKind = 'public' | 'private'\n\n/** One skill's multi-signal usage + structure. All counts are deterministic. */\nexport interface SkillUsageRecord {\n  name: string\n  kind: SkillKind\n  /** Absolute path to the skill's SKILL.md. */\n  path: string\n  lines: number\n  /** `\"skill\":\"<name>\"` Skill-tool invocations across the trace corpus. */\n  directInvocations: number\n  /** `<command-name>/<name>` slash invocations across the trace corpus. */\n  slashInvocations: number\n  /** Sibling skills whose SKILL.md dispatches to this one (`/<name>`). Proxy\n   *  for orchestrated sub-dispatch the per-skill counter cannot see. */\n  inboundRefs: number\n  /** On-disk artifacts attributable to the skill (e.g. `.evolve/<name>/**`). */\n  artifactCount: number\n  /** Tangle-private reference count in the body (leak signal for public skills). */\n  tanglePrivateRefs: number\n  hasReferencesDir: boolean\n  hasEvalsDir: boolean\n  /** Body mentions `skill-runs.jsonl` (visible to /reflect + /governor). */\n  logsRuns: boolean\n  /** Description carries an explicit `Triggers:` clause / trigger phrases. */\n  hasTriggerPhrases: boolean\n}\n\nexport interface SkillUsageReport {\n  generatedFromTraces: number\n  records: SkillUsageRecord[]\n}\n\nexport interface SkillUsageScanConfig {\n  /** Dirs holding `*.jsonl` transcripts (Claude `~/.claude/projects`, Codex sessions). */\n  transcriptDirs: string[]\n  /** Skill roots to scan; each dir directly under `root` with a `SKILL.md` is a skill. */\n  skillRoots: { root: string; kind: SkillKind }[]\n  /** Roots scanned for `<root>/.evolve/<skill>` artifact dirs. */\n  artifactRoots?: string[]\n  /** Token-prefixed mappings: skill name → extra artifact subpaths under an artifactRoot\n   *  (e.g. reflect → `.evolve/reflections`). Catches non-eponymous artifact dirs. */\n  artifactAliases?: Record<string, string[]>\n  /** Cap files read per transcript dir (bounds a huge corpus); 0 = unbounded. */\n  maxTranscriptsPerDir?: number\n}\n\n// ── Deterministic thresholds ─────────────────────────────────────────\n\n/** Anthropic's authoring guidance keeps SKILL.md short; past this with no\n *  `references/` split the body burns context budget every session. */\nconst BLOAT_LINE_THRESHOLD = 300\n\nconst TANGLE_PRIVATE_RE =\n  /\\b(cli-bridge|tangletools|ops-board|drew-gtr-pro|@tangle-network\\/|~\\/company|tangle\\.tools|gtm-agent)\\b|\\bkimi\\b|\\btcloud\\b/gi\nconst TRIGGER_RE = /triggers?\\s*[:-]/i\n\n// ── Report builder (fs scan — slow, runs once at the registry boundary) ──\n\nfunction listSkillDirs(root: string): { name: string; path: string }[] {\n  if (!existsSync(root)) return []\n  const out: { name: string; path: string }[] = []\n  for (const entry of readdirSync(root, { withFileTypes: true })) {\n    if (!entry.isDirectory() && !entry.isSymbolicLink()) continue\n    const skillMd = join(root, entry.name, 'SKILL.md')\n    if (existsSync(skillMd)) out.push({ name: entry.name, path: skillMd })\n  }\n  return out\n}\n\nfunction walkJsonl(dir: string, cap: number): string[] {\n  if (!existsSync(dir)) return []\n  const files: string[] = []\n  const stack = [dir]\n  while (stack.length) {\n    const cur = stack.pop()!\n    let entries: Dirent[]\n    try {\n      entries = readdirSync(cur, { withFileTypes: true })\n    } catch {\n      continue\n    }\n    for (const e of entries) {\n      const full = join(cur, e.name)\n      if (e.isDirectory()) stack.push(full)\n      else if (e.name.endsWith('.jsonl')) {\n        files.push(full)\n        if (cap > 0 && files.length >= cap) return files\n      }\n    }\n  }\n  return files\n}\n\nfunction frontmatterDescription(body: string): string {\n  const fm = /^---\\n([\\s\\S]*?)\\n---/.exec(body)\n  const block = fm?.[1] ?? ''\n  const m = /description:\\s*(.+)/i.exec(block)\n  return m?.[1] ?? ''\n}\n\nfunction countArtifacts(roots: string[], name: string, aliases: string[]): number {\n  let n = 0\n  for (const root of roots) {\n    const candidates = [join(root, '.evolve', name), ...aliases.map((a) => join(root, a))]\n    for (const dir of candidates) {\n      if (!existsSync(dir)) continue\n      try {\n        if (statSync(dir).isDirectory()) n += readdirSync(dir).length\n        else n += 1\n      } catch {\n        /* unreadable — skip */\n      }\n    }\n  }\n  return n\n}\n\n/** Scan the corpus + skill roots into a {@link SkillUsageReport}. Deterministic. */\nexport function buildSkillUsageReport(config: SkillUsageScanConfig): SkillUsageReport {\n  const skills = config.skillRoots.flatMap(({ root, kind }) =>\n    listSkillDirs(root).map((s) => ({ ...s, kind })),\n  )\n  const names = skills.map((s) => s.name)\n\n  // One pass over the corpus accumulating direct + slash counts per skill.\n  const direct = new Map<string, number>(names.map((n) => [n, 0]))\n  const slash = new Map<string, number>(names.map((n) => [n, 0]))\n  const skillRe = /\"skill\"\\s*:\\s*\"([a-z0-9_:-]+)\"/g\n  const cmdRe = /<command-name>\\/?([a-z0-9_:-]+)<\\/command-name>/g\n  let transcripts = 0\n  for (const dir of config.transcriptDirs) {\n    for (const file of walkJsonl(dir, config.maxTranscriptsPerDir ?? 0)) {\n      transcripts += 1\n      let data: string\n      try {\n        data = readFileSync(file, 'utf8')\n      } catch {\n        continue\n      }\n      for (const m of data.matchAll(skillRe)) {\n        const g = m[1]\n        if (!g) continue\n        const n = g.split(':').pop() ?? g\n        const prev = direct.get(n)\n        if (prev !== undefined) direct.set(n, prev + 1)\n      }\n      for (const m of data.matchAll(cmdRe)) {\n        const g = m[1]\n        if (g === undefined) continue\n        const prev = slash.get(g)\n        if (prev !== undefined) slash.set(g, prev + 1)\n      }\n    }\n  }\n\n  // Read each skill body once; compute structure + inbound refs across siblings.\n  const bodies = new Map<string, string>()\n  for (const s of skills) {\n    try {\n      bodies.set(s.name, readFileSync(s.path, 'utf8'))\n    } catch {\n      bodies.set(s.name, '')\n    }\n  }\n  const inbound = new Map<string, number>(names.map((n) => [n, 0]))\n  for (const target of names) {\n    const ref = new RegExp(`/${target}\\\\b|\\\\[\\\\[${target}\\\\]\\\\]`)\n    for (const s of skills) {\n      if (s.name === target) continue\n      if (ref.test(bodies.get(s.name) ?? '')) inbound.set(target, inbound.get(target)! + 1)\n    }\n  }\n\n  const records: SkillUsageRecord[] = skills.map((s) => {\n    const body = bodies.get(s.name) ?? ''\n    const dir = s.path.replace(/\\/SKILL\\.md$/, '')\n    return {\n      name: s.name,\n      kind: s.kind,\n      path: s.path,\n      lines: body ? body.split('\\n').length : 0,\n      directInvocations: direct.get(s.name) ?? 0,\n      slashInvocations: slash.get(s.name) ?? 0,\n      inboundRefs: inbound.get(s.name) ?? 0,\n      artifactCount: countArtifacts(\n        config.artifactRoots ?? [],\n        s.name,\n        config.artifactAliases?.[s.name] ?? [],\n      ),\n      tanglePrivateRefs: (body.match(TANGLE_PRIVATE_RE) ?? []).length,\n      hasReferencesDir: existsSync(join(dir, 'references')),\n      hasEvalsDir: existsSync(join(dir, 'evals')),\n      logsRuns: body.includes('skill-runs.jsonl'),\n      hasTriggerPhrases: TRIGGER_RE.test(frontmatterDescription(body) || body.slice(0, 600)),\n    }\n  })\n  return { generatedFromTraces: transcripts, records }\n}\n\n// ── Finding emission (pure — unit-testable, no LLM, no fs) ────────────\n\nconst ANALYST_ID = 'skill-usage'\n\nfunction finding(\n  area: string,\n  subject: string,\n  claim: string,\n  severity: AnalystSeverity,\n  confidence: number,\n  producedAt: string,\n  recommended: string,\n  evidenceUri: string,\n  rationale?: string,\n): AnalystFinding {\n  return {\n    schema_version: '1.0.0',\n    finding_id: computeFindingId({ analyst_id: ANALYST_ID, area, subject, claim }),\n    analyst_id: ANALYST_ID,\n    produced_at: producedAt,\n    severity,\n    area,\n    claim,\n    rationale,\n    evidence_refs: [{ kind: 'artifact', uri: evidenceUri }],\n    recommended_action: recommended,\n    confidence,\n    subject,\n  }\n}\n\n/** Pure rule pass over a report → findings. Exported for direct/unit use. */\nexport function emitSkillUsageFindings(\n  report: SkillUsageReport,\n  producedAt: string,\n): AnalystFinding[] {\n  const out: AnalystFinding[] = []\n  for (const r of report.records) {\n    const directTotal = r.directInvocations + r.slashInvocations\n    const trueUsage = directTotal + r.inboundRefs + r.artifactCount\n\n    // 1. Dead: no usage signal of ANY kind. The only real deprecation candidate.\n    if (trueUsage === 0) {\n      out.push(\n        finding(\n          'skill-usage',\n          r.name,\n          `Skill '${r.name}' has zero usage across all signals (direct, slash, inbound-refs, artifacts)`,\n          'high',\n          0.6,\n          producedAt,\n          'Confirm the skill covers a real recurring job; if not, deprecate. Zero true usage is the only deterministic deprecation candidate.',\n          r.path,\n          'No Skill-tool call, no slash invocation, no sibling dispatches to it, and no on-disk artifacts.',\n        ),\n      )\n    } else if (directTotal === 0 && r.inboundRefs + r.artifactCount > 0) {\n      // 2. Measurement-invisible: real use via orchestration/artifacts, never invoked directly.\n      out.push(\n        finding(\n          'skill-usage',\n          r.name,\n          `Skill '${r.name}' shows 0 direct invocations but is used via orchestration/artifacts (inbound=${r.inboundRefs}, artifacts=${r.artifactCount})`,\n          'info',\n          0.8,\n          producedAt,\n          'Do NOT treat as unused — usage is real but logged under parent skills or on disk. Strengthen direct-invocation discovery only if direct use is desired.',\n          r.path,\n          'The Skill-tool counter undercounts orchestrated/chained leaf skills.',\n        ),\n      )\n    }\n\n    // 3. Discovery gap: low direct use AND weak trigger surface.\n    if (directTotal <= 2 && !r.hasTriggerPhrases) {\n      out.push(\n        finding(\n          'discoverability',\n          r.name,\n          `Skill '${r.name}' is rarely invoked directly and its description has no explicit trigger phrases`,\n          'medium',\n          0.7,\n          producedAt,\n          'Add a `Triggers:` clause with verbatim user phrases to the frontmatter description so the model auto-invokes it.',\n          r.path,\n        ),\n      )\n    }\n\n    // 4. Public-repo leak.\n    if (r.kind === 'public' && r.tanglePrivateRefs > 0) {\n      out.push(\n        finding(\n          'safety',\n          r.name,\n          `Public skill '${r.name}' carries ${r.tanglePrivateRefs} Tangle-private reference(s)`,\n          'high',\n          0.75,\n          producedAt,\n          'Sanitize incidental internal refs (cli-bridge/kimi/tcloud/~company/private repos) or relocate to a private repo. Verify @tangle-network/* refs are to PUBLISHED packages before treating as a leak.',\n          r.path,\n        ),\n      )\n    }\n\n    // 5. Bloat / no progressive disclosure.\n    if (r.lines > BLOAT_LINE_THRESHOLD && !r.hasReferencesDir) {\n      out.push(\n        finding(\n          'maintainability',\n          r.name,\n          `Skill '${r.name}' is ${r.lines} lines with no references/ split (progressive disclosure)`,\n          'medium',\n          0.8,\n          producedAt,\n          `Split detail into references/ loaded on demand; keep SKILL.md a short overview. ${r.lines} lines load into every session's context budget.`,\n          r.path,\n        ),\n      )\n    }\n\n    // 6. No evals (Anthropic's \">=3 evals before docs\" rule).\n    if (!r.hasEvalsDir) {\n      out.push(\n        finding(\n          'data-quality',\n          r.name,\n          `Skill '${r.name}' ships no evals/`,\n          'low',\n          0.6,\n          producedAt,\n          'Add evals/evals.json with >=3 scenarios proving the skill beats baseline; gives regression coverage.',\n          r.path,\n        ),\n      )\n    }\n\n    // 7. No run logging → invisible to /reflect and /governor.\n    if (!r.logsRuns) {\n      out.push(\n        finding(\n          'observability',\n          r.name,\n          `Skill '${r.name}' never appends to .evolve/skill-runs.jsonl`,\n          'low',\n          0.55,\n          producedAt,\n          'Append one run line to .evolve/skill-runs.jsonl on completion, or declare it a non-logging leaf, so the self-improvement loop can see it ran.',\n          r.path,\n        ),\n      )\n    }\n  }\n  return out\n}\n\n// ── The Analyst ──────────────────────────────────────────────────────\n\nexport class SkillUsageAnalyst implements ExactCapableAnalyst<SkillUsageReport> {\n  readonly id = ANALYST_ID\n  readonly description =\n    'Deterministic multi-signal skill-usage analysis: flags dead skills, measurement-invisible (orchestrated) usage, discovery gaps, public-repo leaks, bloat, missing evals, and missing run-logging.'\n  readonly inputKind = 'custom' as const\n  readonly cost = { kind: 'deterministic' as const, est_usd_per_run: 0 }\n  readonly version = '1.0.0'\n  readonly executionConfig = {\n    kind: 'skill-usage',\n    bloat_line_threshold: BLOAT_LINE_THRESHOLD,\n    produced_at_source: 'tags.producedAt-or-system-clock',\n  } as const\n\n  async analyze(input: SkillUsageReport, ctx: AnalystContext): Promise<AnalystFinding[]> {\n    const producedAt = ctx.tags?.producedAt ?? new Date().toISOString()\n    ctx.log?.(\n      `skill-usage: ${input.records.length} skills over ${input.generatedFromTraces} transcripts`,\n    )\n    return emitSkillUsageFindings(input, producedAt)\n  }\n}\n\nexport const SKILL_USAGE_ANALYST = new SkillUsageAnalyst()\n","import { NotFoundError } from './errors'\nimport { aggregateRunScore, clamp01, type RunScore, type RunScoreWeights } from './run-score'\nimport type { Artifact, BudgetLedgerEntry, Run, Span, TraceEvent, TraceStore } from './trace'\n\nexport interface RunTrace {\n  run: Run\n  spans: Span[]\n  events: TraceEvent[]\n  artifacts: Artifact[]\n  budget: BudgetLedgerEntry[]\n}\n\nexport interface RunCriticOptions {\n  weights?: Partial<RunScoreWeights>\n  driftPatterns?: RegExp[]\n}\n\nconst DEFAULT_DRIFT_PATTERNS = [\n  /https?:\\/\\//i,\n  /\\btitle:\\s/i,\n  /\\bsummary:\\s/i,\n  /\\burl:\\s/i,\n  /\\bnpm package usage\\b/i,\n  /\\bnews\\b/i,\n]\n\nexport class RunCritic {\n  private readonly weights?: Partial<RunScoreWeights>\n  private readonly driftPatterns: RegExp[]\n\n  constructor(options: RunCriticOptions = {}) {\n    this.weights = options.weights\n    this.driftPatterns = options.driftPatterns ?? DEFAULT_DRIFT_PATTERNS\n  }\n\n  async score(store: TraceStore, runId: string): Promise<RunScore> {\n    const run = await store.getRun(runId)\n    if (!run) throw new NotFoundError(`run ${runId} not found`)\n    const [spans, events, artifacts, budget] = await Promise.all([\n      store.spans({ runId }),\n      store.events({ runId }),\n      store.artifacts(runId),\n      store.budget(runId),\n    ])\n    return this.scoreTrace({ run, spans, events, artifacts, budget })\n  }\n\n  scoreTrace(trace: RunTrace): RunScore {\n    const notes: string[] = []\n    const llmSpans = trace.spans.filter(\n      (s): s is Extract<Span, { kind: 'llm' }> => s.kind === 'llm',\n    )\n    const toolSpans = trace.spans.filter(\n      (s): s is Extract<Span, { kind: 'tool' }> => s.kind === 'tool',\n    )\n    const judgeSpans = trace.spans.filter(\n      (s): s is Extract<Span, { kind: 'judge' }> => s.kind === 'judge',\n    )\n    const sandboxSpans = trace.spans.filter(\n      (s): s is Extract<Span, { kind: 'sandbox' }> => s.kind === 'sandbox',\n    )\n    const finalGateSpans = judgeSpans.filter(\n      (span) => span.dimension === 'final_gate' || span.attributes?.finalGate === true,\n    )\n\n    const success =\n      trace.run.outcome?.pass === true ? 1 : trace.run.status === 'completed' ? 0.5 : 0\n    if (!success) notes.push('run did not complete with pass=true')\n\n    const judgeAverage = judgeSpans.length\n      ? judgeSpans.reduce((sum, span) => sum + normalizeJudgeScore(span.score), 0) /\n        judgeSpans.length\n      : undefined\n    const outcomeScore =\n      typeof trace.run.outcome?.score === 'number'\n        ? clamp01(\n            trace.run.outcome.score > 1 ? trace.run.outcome.score / 100 : trace.run.outcome.score,\n          )\n        : undefined\n    const goalProgress = outcomeScore ?? judgeAverage ?? success\n\n    const successfulTools = toolSpans.filter((span) => span.status !== 'error').length\n    const toolUseQuality = toolSpans.length === 0 ? 0 : successfulTools / toolSpans.length\n    if (toolSpans.length === 0) notes.push('no tool spans recorded')\n\n    const patchEvidence =\n      trace.artifacts.length +\n      toolSpans.filter((span) => /write|edit|patch|apply/i.test(span.toolName)).length\n    const patchQuality = patchEvidence > 0 ? clamp01(patchEvidence / 4) : 0\n    if (!patchQuality) notes.push('no artifact or edit evidence recorded')\n\n    const sandboxTests = sandboxSpans.filter(\n      (span) => typeof span.testsTotal === 'number' && span.testsTotal > 0,\n    )\n    const testReality = sandboxTests.length\n      ? sandboxTests.reduce(\n          (sum, span) => sum + (span.testsPassed ?? 0) / Math.max(1, span.testsTotal ?? 1),\n          0,\n        ) / sandboxTests.length\n      : toolSpans.some((span) =>\n            /\\btest|vitest|pytest|jest|build|tsc\\b/i.test(JSON.stringify(span.args)),\n          )\n        ? 0.4\n        : 0\n    if (!testReality) notes.push('no real test/build evidence recorded')\n\n    const blockerSpans = judgeSpans.filter((span) => isBlockingJudge(span))\n    const finalGateBlockers = finalGateSpans.filter((span) => isBlockingJudge(span))\n    const finalGate = finalGateSpans.length ? (finalGateBlockers.length ? 0 : 1) : success\n    if (finalGateBlockers.length)\n      notes.push(`final gate blocked by ${finalGateBlockers.length} reviewer(s)`)\n    else if (!finalGateSpans.length) notes.push('no final gate judgment recorded')\n\n    const reviewerBlockers = judgeSpans.length ? blockerSpans.length / judgeSpans.length : 0\n    if (reviewerBlockers) notes.push(`detected ${blockerSpans.length} blocking reviewer signal(s)`)\n\n    const positiveGroundingSignals =\n      patchEvidence +\n      sandboxSpans.length +\n      llmSpans.filter((span) => looksRepoGrounded(span.output ?? '')).length\n    const driftSignals =\n      llmSpans.filter((span) => this.isDrift(span.output ?? '')).length +\n      trace.events.filter((event) => this.isDrift(JSON.stringify(event.payload))).length\n    const repoGroundedness =\n      positiveGroundingSignals + driftSignals === 0\n        ? 0\n        : positiveGroundingSignals / (positiveGroundingSignals + driftSignals)\n    const driftPenalty =\n      positiveGroundingSignals + driftSignals === 0\n        ? 0\n        : driftSignals / (positiveGroundingSignals + driftSignals)\n    if (driftSignals > 0) notes.push(`detected ${driftSignals} drift signal(s)`)\n\n    const costUsd = trace.budget.length\n      ? Math.max(\n          ...trace.budget\n            .filter((entry: BudgetLedgerEntry) => entry.dimension === 'usd')\n            .map((entry: BudgetLedgerEntry) => entry.consumed),\n          0,\n        )\n      : llmSpans.reduce((sum, span) => sum + (span.costUsd ?? 0), 0)\n    const wallSeconds =\n      trace.run.endedAt && trace.run.startedAt\n        ? Math.max(0, (trace.run.endedAt - trace.run.startedAt) / 1000)\n        : 0\n\n    return {\n      success,\n      goalProgress,\n      repoGroundedness,\n      driftPenalty,\n      toolUseQuality,\n      patchQuality,\n      testReality,\n      finalGate,\n      reviewerBlockers,\n      costUsd,\n      wallSeconds,\n      notes,\n    }\n  }\n\n  rank(score: RunScore): number {\n    return aggregateRunScore(score, this.weights)\n  }\n\n  private isDrift(text: string): boolean {\n    return this.driftPatterns.some((pattern) => pattern.test(text))\n  }\n}\n\nfunction normalizeJudgeScore(score: number): number {\n  return score > 1 ? clamp01(score / 10) : clamp01(score)\n}\n\nfunction looksRepoGrounded(text: string): boolean {\n  return /(?:src\\/|tests?\\/|package\\.json|tsconfig|\\.ts\\b|\\.tsx\\b|git status|pnpm |npm |vitest|pytest|jest)/i.test(\n    text,\n  )\n}\n\nfunction isBlockingJudge(span: Extract<Span, { kind: 'judge' }>): boolean {\n  return (\n    span.attributes?.blocking === true ||\n    span.attributes?.verdict === 'BLOCKING' ||\n    positiveNumber(span.attributes?.blockingFindings) ||\n    positiveNumber(span.attributes?.highFindings) ||\n    span.score <= 2\n  )\n}\n\nfunction positiveNumber(value: unknown): boolean {\n  return typeof value === 'number' && value > 0\n}\n","/**\n * Semantic concept judge — \"does the built artifact actually implement\n * the features the user asked for?\"\n *\n * Distinct from the domain/code/coherence judges in `judges.ts`:\n *   - those judges score free-form conversational agent outputs along\n *     quality dimensions (accuracy, depth, etc.)\n *   - this judge scores a *built artifact* (served HTML + source files)\n *     against an explicit list of expected concepts, returning per-concept\n *     {present, score 0-10, evidence, severity}.\n *\n * The judge is strict about distinguishing (a) a working implementation\n * from (b) a keyword-present stub. \"// TODO: mint button\" is NOT present.\n * Only real, functional, wired-up code counts.\n *\n * Use via {@link createSemanticConceptJudge} or directly via\n * {@link runSemanticConceptJudge}. Soft-fails (available=false) on LLM\n * or JSON-parse errors so the caller can treat that as \"layer skipped\"\n * rather than \"layer failed\" in a multi-layer pipeline.\n */\n\nimport { CostLedger, type CostLedgerHandle, type CostReceipt } from './cost-ledger'\nimport {\n  callLlmJson,\n  costReceiptFromLlm,\n  costReceiptFromLlmError,\n  type LlmCallRequest,\n  type LlmClientOptions,\n  maximumChargeForLlmRequest,\n} from './llm-client'\nimport type { Severity } from './multi-layer-verifier'\n\n// ─── Types ──────────────────────────────────────────────────────────────\n\n/**\n * Implementation complexity class for weighted scoring.\n *\n * - `render` (default): the concept is a UI surface that displays static\n *   data — render a list, show a counter, lay out a button. Single-file\n *   work, no external integration.\n * - `integrate`: the concept requires wiring a real external system —\n *   wallet connect (wagmi + RainbowKit + chain config), payment provider\n *   (Stripe Elements + intent + webhook), an API client with auth.\n *   Multi-file, library-knowledge, runtime correctness matters.\n * - `compute`: the concept requires algorithmic work — solver, simulator,\n *   constraint propagation, ML inference. Correctness > UI polish.\n *\n * Default weights (when applied via `weightConcepts: 'complexity'`):\n *   render=1.0, integrate=2.0, compute=2.5\n *\n * Cross-vertical scoring without complexity weighting silently inflates\n * the rate of UI-heavy verticals (healthcare, fintech dashboards) vs\n * integration-heavy verticals (DeFi, wallets) — all concepts treated\n * equally even though the agent does 2-3x the work for `integrate`.\n */\nexport type ConceptComplexity = 'render' | 'integrate' | 'compute'\n\nexport interface ConceptSpec {\n  name: string\n  /** Short hints that help the judge; not used for matching. */\n  keywords?: string[]\n  /** Optional explicit weight; default 1.0. Overrides complexity-derived weight. */\n  weight?: number\n  /** Implementation complexity class. Default `render`. */\n  complexity?: ConceptComplexity\n}\n\nexport interface ConceptFinding {\n  concept: string\n  present: boolean\n  /** 0..10. 10 = production-ready; 7 = functional thin; 4 = partial; 0 = absent. */\n  score: number\n  evidence: string\n  severity: Severity\n}\n\nexport interface SemanticConceptJudgeInput {\n  /** Full natural-language prompt the agent was handed. */\n  userRequest: string\n  /** Rendered HTML the preview returns (UI artifacts). Optional. */\n  servedHtml?: string\n  /** Top-level source files from the agent's workdir. */\n  sourceFiles: Array<{ path: string; content: string }>\n  /** The expected concept list. */\n  expectedConcepts: ConceptSpec[]\n  /** Free-form metadata (id, difficulty) to inject into the prompt. */\n  artifactLabel?: string\n  artifactDescription?: string\n}\n\nexport interface SemanticConceptJudgeResult {\n  kind: 'semantic-concept'\n  version: string\n  /** Normalized 0..1 score — mean of per-concept scores / 10. */\n  score: number\n  presentCount: number\n  totalCount: number\n  findings: ConceptFinding[]\n  summary: string\n  durationMs: number\n  costUsd: number | null\n  /** False on LLM/JSON error — treat as \"skipped / unable to judge\" in pipelines. */\n  available: boolean\n  error?: string\n}\n\n/**\n * Score-aggregation strategy. `mean` averages 0-10 scores uniformly.\n * `complexity` applies the default weight table (render=1, integrate=2,\n * compute=2.5) unless a concept has an explicit `weight`. `explicit`\n * honors only `weight` (defaulting to 1 for unspecified).\n */\nexport type ConceptWeightStrategy = 'mean' | 'complexity' | 'explicit'\n\nexport const DEFAULT_COMPLEXITY_WEIGHTS: Record<ConceptComplexity, number> = {\n  render: 1.0,\n  integrate: 2.0,\n  compute: 2.5,\n}\n\nexport interface SemanticConceptJudgeOptions {\n  /** Model id to call. Default 'claude-sonnet-4-6' via agent-eval defaults. */\n  model?: string\n  /** Per-call timeout. Default 300s. */\n  timeoutMs?: number\n  /** Provider-enforced output limit. Default 16000. */\n  maxTokens?: number\n  /** Pipeline budget for the prompt (source blob truncation). Default 45000. */\n  maxSourceChars?: number\n  /** Per-file cap before inclusion. Default 20000. */\n  maxPerFileChars?: number\n  /** HTML cap. Default 30000. */\n  maxHtmlChars?: number\n  /** LlmClient config (baseUrl, apiKey, authHeader, …). */\n  llm?: LlmClientOptions\n  costLedger?: CostLedgerHandle\n  costPhase?: string\n  costTags?: Record<string, string>\n  signal?: AbortSignal\n  /**\n   * Score aggregation strategy. Default `mean` — uniform average across\n   * concepts. Cross-vertical comparisons should use `complexity` to\n   * neutralize the integrate-vs-render asymmetry.\n   */\n  weightConcepts?: ConceptWeightStrategy\n  /** Override the default complexity → weight table. */\n  complexityWeights?: Partial<Record<ConceptComplexity, number>>\n}\n\n// ─── Prompt assembly ────────────────────────────────────────────────────\n\nexport const SEMANTIC_CONCEPT_JUDGE_VERSION = 'semantic-concept-judge-v1-2026-04-24'\n\nconst DEFAULT_MAX_SOURCE = 45_000\nconst DEFAULT_MAX_HTML = 30_000\nconst DEFAULT_MAX_PER_FILE = 20_000\nconst DEFAULT_TIMEOUT = 300_000\nconst DEFAULT_MAX_TOKENS = 16_000\nconst DEFAULT_MODEL = 'claude-sonnet-4-6'\n\nconst SEMANTIC_SCHEMA = {\n  type: 'object',\n  additionalProperties: false,\n  required: ['summary', 'concepts'],\n  properties: {\n    summary: { type: 'string', minLength: 20, maxLength: 600 },\n    concepts: {\n      type: 'array',\n      minItems: 1,\n      items: {\n        type: 'object',\n        additionalProperties: false,\n        required: ['concept', 'present', 'score', 'evidence', 'severity'],\n        properties: {\n          concept: { type: 'string', minLength: 1, maxLength: 120 },\n          present: { type: 'boolean' },\n          score: { type: 'number', minimum: 0, maximum: 10 },\n          evidence: { type: 'string', minLength: 5, maxLength: 400 },\n          severity: { type: 'string', enum: ['critical', 'major', 'minor', 'info'] },\n        },\n      },\n    },\n  },\n}\n\nfunction truncate(body: string, cap: number, label: string): string {\n  if (body.length <= cap) return body\n  return `${body.slice(0, cap)}\\n… [truncated ${body.length - cap} chars of ${label}]`\n}\n\nfunction buildPrompt(\n  input: SemanticConceptJudgeInput,\n  opts: Required<SemanticConceptJudgeOptions>,\n): string {\n  const sourceBlob = input.sourceFiles\n    .filter((f) => f.content.length <= opts.maxPerFileChars)\n    .map((f) => `--- FILE: ${f.path} ---\\n${f.content}`)\n    .join('\\n\\n')\n\n  const html = input.servedHtml ?? ''\n\n  return `You are a strict code-review judge evaluating whether an agent's 0-to-1 build actually implements the features the user asked for.\n\nYou MUST distinguish:\n  (a) WORKING code that implements the concept (rendered UI, wired handler, real API call),\n  (b) KEYWORD-PRESENT stub (comments mentioning the concept, variable names, TODOs),\n  (c) ABSENT (concept nowhere).\n\nA comment like \"// TODO: add mint button\" is NOT present — score 2-3. Only count a concept as present if there is real functional code: a rendered component, a call handler wired to state or a network call, a computed value actually used.\n\nUSER REQUEST (what the agent was asked to build):\n${input.userRequest}\n\n${input.artifactLabel ? `ARTIFACT METADATA:\\n  name: ${input.artifactLabel}\\n  description: ${input.artifactDescription ?? ''}\\n\\n` : ''}EXPECTED CONCEPTS (each must be graded independently):\n${input.expectedConcepts\n  .map(\n    (c, i) =>\n      `  ${i + 1}. \"${c.name}\"${c.keywords?.length ? ` — hints: [${c.keywords.slice(0, 6).join(' | ')}]` : ''}`,\n  )\n  .join('\\n')}\n\n${html ? `SERVED HTML (what the preview returns when hit):\\n${truncate(html, opts.maxHtmlChars, 'HTML')}\\n\\n` : ''}SOURCE FILES (the agent's workdir):\n${truncate(sourceBlob, opts.maxSourceChars, 'source')}\n\nFor EACH concept, return:\n  - concept: the concept name as given (match exactly)\n  - present: boolean — does a working implementation exist?\n  - score: 0-10 — 10 = production-ready; 7 = functional but thin; 4 = partial/stubbed; 2 = keyword-only comment; 0 = absent\n  - evidence: cite \"<file>:<line>\" or \"served-html:<selector>\" pointing at the strongest supporting code. If the concept is absent or stubbed, explain what's missing.\n  - severity:\n      \"info\" when present: true AND score >= 7\n      \"minor\" when present: true AND 4 <= score < 7\n      \"major\" when present: false OR score < 4\n      \"critical\" when the concept is not only absent but a core user flow depends on it\n\nAlso produce a \"summary\" (one sentence, 20-600 chars): overall verdict on whether this is a shippable implementation of the user request vs a keyword-dense placeholder.\n\nBE SKEPTICAL. Keyword matching already passed — your job is to catch what keyword matching misses. If the agent shipped a working build, say so. If it shipped a stub, say so. Don't grade on effort.\n\nReturn STRICT JSON. No prose outside the JSON.`\n}\n\n// ─── Runner ─────────────────────────────────────────────────────────────\n\n/**\n * Run the semantic concept judge. Soft-fails to available=false on\n * LLM/JSON errors — callers in a MultiLayerVerifier pipeline can treat\n * that as \"skip\" rather than \"fail.\"\n */\nexport async function runSemanticConceptJudge(\n  input: SemanticConceptJudgeInput,\n  options: SemanticConceptJudgeOptions = {},\n): Promise<SemanticConceptJudgeResult> {\n  const start = Date.now()\n  const totalCount = input.expectedConcepts.length\n\n  if (totalCount === 0) {\n    return {\n      kind: 'semantic-concept',\n      version: SEMANTIC_CONCEPT_JUDGE_VERSION,\n      score: 0,\n      presentCount: 0,\n      totalCount: 0,\n      findings: [],\n      summary: 'no expected concepts declared',\n      durationMs: 0,\n      costUsd: null,\n      available: false,\n      error: 'no expected concepts declared',\n    }\n  }\n\n  const opts: Required<SemanticConceptJudgeOptions> = {\n    model: options.model ?? DEFAULT_MODEL,\n    timeoutMs: options.timeoutMs ?? DEFAULT_TIMEOUT,\n    maxTokens: options.maxTokens ?? DEFAULT_MAX_TOKENS,\n    maxSourceChars: options.maxSourceChars ?? DEFAULT_MAX_SOURCE,\n    maxPerFileChars: options.maxPerFileChars ?? DEFAULT_MAX_PER_FILE,\n    maxHtmlChars: options.maxHtmlChars ?? DEFAULT_MAX_HTML,\n    llm: options.llm ?? {},\n    costLedger: options.costLedger ?? new CostLedger(),\n    costPhase: options.costPhase ?? 'judge.semantic-concept',\n    costTags: options.costTags ?? {},\n    signal: options.signal ?? new AbortController().signal,\n    weightConcepts: options.weightConcepts ?? 'mean',\n    complexityWeights: { ...DEFAULT_COMPLEXITY_WEIGHTS, ...(options.complexityWeights ?? {}) },\n  }\n\n  // Build a name → weight map for aggregation. Mean strategy keeps every\n  // weight at 1 (uniform average). Complexity strategy reads the table\n  // and lets an explicit `weight` override. Explicit strategy uses ONLY\n  // the spec's `weight` (defaulting to 1).\n  const weightForConcept = (spec: ConceptSpec): number => {\n    if (opts.weightConcepts === 'mean') return 1\n    if (spec.weight != null) return spec.weight\n    if (opts.weightConcepts === 'complexity') {\n      return opts.complexityWeights[spec.complexity ?? 'render'] ?? 1\n    }\n    return 1\n  }\n  const weightByName = new Map<string, number>(\n    input.expectedConcepts.map((c) => [c.name, weightForConcept(c)]),\n  )\n\n  let receipt: CostReceipt | undefined\n  try {\n    const request = {\n      model: opts.model,\n      messages: [\n        {\n          role: 'system' as const,\n          content:\n            'You are a strict code-review judge. Return strict JSON only. No prose outside the JSON. A keyword in a comment is NOT a working implementation.',\n        },\n        { role: 'user' as const, content: buildPrompt(input, opts) },\n      ],\n      jsonSchema: { name: 'semantic_concept_judge', schema: SEMANTIC_SCHEMA },\n      temperature: 0,\n      maxTokens: opts.maxTokens,\n      timeoutMs: opts.timeoutMs,\n    } satisfies LlmCallRequest\n    const paid = await opts.costLedger.runPaidCall({\n      channel: 'judge',\n      phase: opts.costPhase,\n      actor: 'semantic-concept',\n      model: opts.model,\n      ...(Object.keys(opts.costTags).length > 0 ? { tags: opts.costTags } : {}),\n      maximumCharge: maximumChargeForLlmRequest(request, opts.llm),\n      signal: opts.signal,\n      execute: (signal, callId) =>\n        callLlmJson<{ summary: string; concepts: ConceptFinding[] }>(request, {\n          ...opts.llm,\n          signal,\n          idempotencyKey: callId,\n        }),\n      receipt: ({ result }) => costReceiptFromLlm(result),\n      receiptFromError: costReceiptFromLlmError,\n    })\n    receipt = paid.receipt\n    if (!paid.succeeded) throw paid.error\n    const { value } = paid.value\n\n    if (!value?.concepts || !Array.isArray(value.concepts)) {\n      throw new Error('judge returned malformed response — expected array under \"concepts\"')\n    }\n\n    const findings: ConceptFinding[] = value.concepts.map((c) => ({\n      concept: String(c.concept),\n      present: Boolean(c.present),\n      score: Math.max(0, Math.min(10, Number(c.score ?? 0))),\n      evidence: String(c.evidence ?? ''),\n      severity: (['critical', 'major', 'minor', 'info'] as const).includes(c.severity)\n        ? c.severity\n        : 'info',\n    }))\n\n    const presentCount = findings.filter((f) => f.present && f.score >= 7).length\n    let weightSum = 0\n    let weightedScoreSum = 0\n    for (const f of findings) {\n      const w = weightByName.get(f.concept) ?? 1\n      weightSum += w\n      weightedScoreSum += w * f.score\n    }\n    const scoreAvg =\n      weightSum > 0\n        ? weightedScoreSum / weightSum\n        : findings.reduce((a, f) => a + f.score, 0) / Math.max(1, findings.length)\n\n    return {\n      kind: 'semantic-concept',\n      version: SEMANTIC_CONCEPT_JUDGE_VERSION,\n      score: Number((scoreAvg / 10).toFixed(3)),\n      presentCount,\n      totalCount,\n      findings,\n      summary: String(value.summary ?? ''),\n      durationMs: Date.now() - start,\n      costUsd: paid.receipt.costUnknown ? null : paid.receipt.costUsd,\n      available: true,\n    }\n  } catch (err) {\n    return {\n      kind: 'semantic-concept',\n      version: SEMANTIC_CONCEPT_JUDGE_VERSION,\n      score: 0,\n      presentCount: 0,\n      totalCount,\n      findings: [],\n      summary: '',\n      durationMs: Date.now() - start,\n      costUsd: receipt && !receipt.costUnknown ? receipt.costUsd : null,\n      available: false,\n      error: err instanceof Error ? err.message : String(err),\n    }\n  }\n}\n\n/**\n * Factory: pin LLM options once, return a closure that accepts inputs.\n * Convenient for pipelines that want to share a single LlmClient config.\n */\nexport function createSemanticConceptJudge(\n  options: SemanticConceptJudgeOptions = {},\n): (input: SemanticConceptJudgeInput) => Promise<SemanticConceptJudgeResult> {\n  return (input) => runSemanticConceptJudge(input, options)\n}\n"],"mappings":";;;;;;;;;;;;;;;;AAYA,SAAgB,mBAAmB,YAA4D;CAC7F,KAAK,MAAM,CAAC,MAAM,UAAU;EAC1B,CAAC,MAAM,WAAW,EAAE;EACpB,CAAC,eAAe,WAAW,WAAW;EACtC,CAAC,QAAQ,WAAW,IAAI;EACxB,CAAC,WAAW,WAAW,OAAO;EAC9B,CAAC,gBAAgB,WAAW,YAAY;CAC1C,GACE,IAAI,OAAO,UAAU,YAAY,CAAC,MAAM,KAAK,GAC3C,MAAM,IAAI,UAAU,uBAAuB,KAAK,4BAA4B;CAGhF,OAAO;EACL,GAAG;EACH,QAAQ,WAAW,SAAS,EAAE,GAAG,WAAW,OAAO,IAAI,KAAA;CACzD;AACF;AAsBA,SAAgB,oBACd,SACuE;CACvE,IAAI,CAAC,QAAQ,GAAG,KAAK,GAAG,MAAM,IAAI,UAAU,2CAA2C;CACvF,IAAI,CAAC,QAAQ,YAAY,KAAK,GAC5B,MAAM,IAAI,UAAU,oDAAoD;CAE1E,IAAI,QAAQ,SAAS,KAAA,GACnB,MAAM,IAAI,UAAU,4CAA4C;CAElE,IACE,qBAAqB,YACpB,CAAC,QAAQ,mBACR,OAAO,QAAQ,oBAAoB,YACnC,MAAM,QAAQ,QAAQ,eAAe,IAEvC,MAAM,IAAI,UAAU,wDAAwD;CAE9E,OAAO;EACL,IAAI,QAAQ;EACZ,aAAa,QAAQ;EACrB,SAAS,QAAQ,WAAW;EAC5B,WAAW;EACX,MAAM,QAAQ;EACd,SAAS,QAAQ;EACjB,GAAI,qBAAqB,UAAU,EAAE,iBAAiB,QAAQ,gBAAgB,IAAI,CAAC;CACrF;AACF;;;;;;;;;;;;;AC9DA,MAAM,0BAAU,IAAI,IAAmB;AAEvC,SAAS,SAAS,MAAqB;CACrC,IAAI,IAAI,QAAQ,IAAI,IAAI;CACxB,IAAI,CAAC,GAAG;EACN,IAAI,IAAI,MAAM;EACd,QAAQ,IAAI,MAAM,CAAC;CACrB;CACA,OAAO;AACT;AAEA,IAAa,sBAAb,MAAiC;CAEH;CAD5B;CACA,YAAY,MAA8B;EAAd,KAAA,OAAA;EAC1B,KAAK,QAAQ,SAAS,IAAI;EAC1B,IAAI,CAAC,WAAW,QAAQ,IAAI,CAAC,GAC3B,UAAU,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;CAEhD;CAEA,MAAM,OAAO,OAA+B;EAC1C,MAAM,OAAO,GAAG,KAAK,UAAU,KAAK,EAAE;EACtC,MAAM,KAAK,MAAM,mBAAmB;GAClC,eAAe,KAAK,MAAM,IAAI;EAChC,CAAC;CACH;AACF;;;;;;;;;;;;;;;;;;;;;;ACPA,IAAa,gBAAb,MAA2B;CAGG;CAF5B;CAEA,YAAY,MAA8B;EAAd,KAAA,OAAA;EAC1B,KAAK,WAAW,IAAI,oBAAoB,IAAI;CAC9C;CAEA,MAAM,OAAO,OAAe,UAA2C;EACrE,KAAK,MAAM,KAAK,UAAU;GACxB,MAAM,MAAwB;IAAE,GAAG;IAAG,QAAQ;GAAM;GACpD,MAAM,KAAK,SAAS,OAAO,GAAG;EAChC;CACF;;CAGA,UAA8B;EAC5B,IAAI,CAAC,WAAW,KAAK,IAAI,GAAG,OAAO,CAAC;EACpC,MAAM,MAAM,aAAa,KAAK,MAAM,MAAM;EAC1C,IAAI,CAAC,KAAK,OAAO,CAAC;EAClB,MAAM,MAA0B,CAAC;EACjC,KAAK,MAAM,QAAQ,IAAI,MAAM,IAAI,GAAG;GAClC,IAAI,CAAC,MAAM;GACX,IAAI;IACF,IAAI,KAAK,KAAK,MAAM,IAAI,CAAqB;GAC/C,QAAQ,CAGR;EACF;EACA,OAAO;CACT;;CAGA,QAAQ,OAAmC;EACzC,OAAO,KAAK,QAAQ,CAAC,CAAC,QAAQ,MAAM,EAAE,WAAW,KAAK;CACxD;AACF;;;;;AAiCA,SAAgB,kBAAkB,GAAmB,GAA4B;CAC/E,IAAI,EAAE,aAAa,EAAE,UAAU,OAAO;CACtC,IAAI,KAAK,KAAK,EAAE,cAAc,MAAM,EAAE,cAAc,EAAE,IAAI,KAAM,OAAO;CACvE,IAAI,EAAE,cAAc,WAAW,EAAE,cAAc,QAAQ,OAAO;CAC9D,OAAO;AACT;;;;;AAMA,SAAgB,aACd,UACA,SACA,SAAqB,CAAC,GACR;CACd,MAAM,aAAa,OAAO,cAAc;CACxC,MAAM,WAAW,IAAI,IAAI,SAAS,KAAK,MAAM,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC;CAC/D,MAAM,UAAU,IAAI,IAAI,QAAQ,KAAK,MAAM,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC;CAE7D,MAAM,WAA+B,CAAC;CACtC,MAAM,cAAkC,CAAC;CACzC,MAAM,YAAgC,CAAC;CACvC,MAAM,UAAmC,CAAC;CAE1C,KAAK,MAAM,CAAC,IAAI,QAAQ,SAAS;EAC/B,MAAM,OAAO,SAAS,IAAI,EAAE;EAC5B,IAAI,CAAC,MAAM;GACT,SAAS,KAAK,GAAG;GACjB;EACF;EACA,IAAI,WAAW,MAAM,GAAG,GACtB,QAAQ,KAAK;GAAE,UAAU;GAAM,SAAS;EAAI,CAAC;OAE7C,UAAU,KAAK,GAAG;CAEtB;CACA,KAAK,MAAM,CAAC,IAAI,SAAS,UACvB,IAAI,CAAC,QAAQ,IAAI,EAAE,GAAG,YAAY,KAAK,IAAI;CAE7C,OAAO;EAAE;EAAU;EAAa;EAAW;CAAQ;AACrD;;;;;;;;;;;;;;;;;;;;;;;;;AChEA,MAAM,uBAAuB;AAE7B,MAAM,oBACJ;AACF,MAAM,aAAa;AAInB,SAAS,cAAc,MAAgD;CACrE,IAAI,CAAC,WAAW,IAAI,GAAG,OAAO,CAAC;CAC/B,MAAM,MAAwC,CAAC;CAC/C,KAAK,MAAM,SAAS,YAAY,MAAM,EAAE,eAAe,KAAK,CAAC,GAAG;EAC9D,IAAI,CAAC,MAAM,YAAY,KAAK,CAAC,MAAM,eAAe,GAAG;EACrD,MAAM,UAAU,KAAK,MAAM,MAAM,MAAM,UAAU;EACjD,IAAI,WAAW,OAAO,GAAG,IAAI,KAAK;GAAE,MAAM,MAAM;GAAM,MAAM;EAAQ,CAAC;CACvE;CACA,OAAO;AACT;AAEA,SAAS,UAAU,KAAa,KAAuB;CACrD,IAAI,CAAC,WAAW,GAAG,GAAG,OAAO,CAAC;CAC9B,MAAM,QAAkB,CAAC;CACzB,MAAM,QAAQ,CAAC,GAAG;CAClB,OAAO,MAAM,QAAQ;EACnB,MAAM,MAAM,MAAM,IAAI;EACtB,IAAI;EACJ,IAAI;GACF,UAAU,YAAY,KAAK,EAAE,eAAe,KAAK,CAAC;EACpD,QAAQ;GACN;EACF;EACA,KAAK,MAAM,KAAK,SAAS;GACvB,MAAM,OAAO,KAAK,KAAK,EAAE,IAAI;GAC7B,IAAI,EAAE,YAAY,GAAG,MAAM,KAAK,IAAI;QAC/B,IAAI,EAAE,KAAK,SAAS,QAAQ,GAAG;IAClC,MAAM,KAAK,IAAI;IACf,IAAI,MAAM,KAAK,MAAM,UAAU,KAAK,OAAO;GAC7C;EACF;CACF;CACA,OAAO;AACT;AAEA,SAAS,uBAAuB,MAAsB;CAEpD,MAAM,QADK,wBAAwB,KAAK,IACzB,CAAC,GAAG,MAAM;CAEzB,OADU,uBAAuB,KAAK,KAC/B,CAAC,GAAG,MAAM;AACnB;AAEA,SAAS,eAAe,OAAiB,MAAc,SAA2B;CAChF,IAAI,IAAI;CACR,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,aAAa,CAAC,KAAK,MAAM,WAAW,IAAI,GAAG,GAAG,QAAQ,KAAK,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC;EACrF,KAAK,MAAM,OAAO,YAAY;GAC5B,IAAI,CAAC,WAAW,GAAG,GAAG;GACtB,IAAI;IACF,IAAI,SAAS,GAAG,CAAC,CAAC,YAAY,GAAG,KAAK,YAAY,GAAG,CAAC,CAAC;SAClD,KAAK;GACZ,QAAQ,CAER;EACF;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,sBAAsB,QAAgD;CACpF,MAAM,SAAS,OAAO,WAAW,SAAS,EAAE,MAAM,WAChD,cAAc,IAAI,CAAC,CAAC,KAAK,OAAO;EAAE,GAAG;EAAG;CAAK,EAAE,CACjD;CACA,MAAM,QAAQ,OAAO,KAAK,MAAM,EAAE,IAAI;CAGtC,MAAM,SAAS,IAAI,IAAoB,MAAM,KAAK,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CAC/D,MAAM,QAAQ,IAAI,IAAoB,MAAM,KAAK,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CAC9D,MAAM,UAAU;CAChB,MAAM,QAAQ;CACd,IAAI,cAAc;CAClB,KAAK,MAAM,OAAO,OAAO,gBACvB,KAAK,MAAM,QAAQ,UAAU,KAAK,OAAO,wBAAwB,CAAC,GAAG;EACnE,eAAe;EACf,IAAI;EACJ,IAAI;GACF,OAAO,aAAa,MAAM,MAAM;EAClC,QAAQ;GACN;EACF;EACA,KAAK,MAAM,KAAK,KAAK,SAAS,OAAO,GAAG;GACtC,MAAM,IAAI,EAAE;GACZ,IAAI,CAAC,GAAG;GACR,MAAM,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK;GAChC,MAAM,OAAO,OAAO,IAAI,CAAC;GACzB,IAAI,SAAS,KAAA,GAAW,OAAO,IAAI,GAAG,OAAO,CAAC;EAChD;EACA,KAAK,MAAM,KAAK,KAAK,SAAS,KAAK,GAAG;GACpC,MAAM,IAAI,EAAE;GACZ,IAAI,MAAM,KAAA,GAAW;GACrB,MAAM,OAAO,MAAM,IAAI,CAAC;GACxB,IAAI,SAAS,KAAA,GAAW,MAAM,IAAI,GAAG,OAAO,CAAC;EAC/C;CACF;CAIF,MAAM,yBAAS,IAAI,IAAoB;CACvC,KAAK,MAAM,KAAK,QACd,IAAI;EACF,OAAO,IAAI,EAAE,MAAM,aAAa,EAAE,MAAM,MAAM,CAAC;CACjD,QAAQ;EACN,OAAO,IAAI,EAAE,MAAM,EAAE;CACvB;CAEF,MAAM,UAAU,IAAI,IAAoB,MAAM,KAAK,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CAChE,KAAK,MAAM,UAAU,OAAO;EAC1B,MAAM,MAAM,IAAI,OAAO,IAAI,OAAO,YAAY,OAAO,OAAO;EAC5D,KAAK,MAAM,KAAK,QAAQ;GACtB,IAAI,EAAE,SAAS,QAAQ;GACvB,IAAI,IAAI,KAAK,OAAO,IAAI,EAAE,IAAI,KAAK,EAAE,GAAG,QAAQ,IAAI,QAAQ,QAAQ,IAAI,MAAM,IAAK,CAAC;EACtF;CACF;CAEA,MAAM,UAA8B,OAAO,KAAK,MAAM;EACpD,MAAM,OAAO,OAAO,IAAI,EAAE,IAAI,KAAK;EACnC,MAAM,MAAM,EAAE,KAAK,QAAQ,gBAAgB,EAAE;EAC7C,OAAO;GACL,MAAM,EAAE;GACR,MAAM,EAAE;GACR,MAAM,EAAE;GACR,OAAO,OAAO,KAAK,MAAM,IAAI,CAAC,CAAC,SAAS;GACxC,mBAAmB,OAAO,IAAI,EAAE,IAAI,KAAK;GACzC,kBAAkB,MAAM,IAAI,EAAE,IAAI,KAAK;GACvC,aAAa,QAAQ,IAAI,EAAE,IAAI,KAAK;GACpC,eAAe,eACb,OAAO,iBAAiB,CAAC,GACzB,EAAE,MACF,OAAO,kBAAkB,EAAE,SAAS,CAAC,CACvC;GACA,oBAAoB,KAAK,MAAM,iBAAiB,KAAK,CAAC,EAAA,CAAG;GACzD,kBAAkB,WAAW,KAAK,KAAK,YAAY,CAAC;GACpD,aAAa,WAAW,KAAK,KAAK,OAAO,CAAC;GAC1C,UAAU,KAAK,SAAS,kBAAkB;GAC1C,mBAAmB,WAAW,KAAK,uBAAuB,IAAI,KAAK,KAAK,MAAM,GAAG,GAAG,CAAC;EACvF;CACF,CAAC;CACD,OAAO;EAAE,qBAAqB;EAAa;CAAQ;AACrD;AAIA,MAAM,aAAa;AAEnB,SAAS,QACP,MACA,SACA,OACA,UACA,YACA,YACA,aACA,aACA,WACgB;CAChB,OAAO;EACL,gBAAgB;EAChB,YAAY,iBAAiB;GAAE,YAAY;GAAY;GAAM;GAAS;EAAM,CAAC;EAC7E,YAAY;EACZ,aAAa;EACb;EACA;EACA;EACA;EACA,eAAe,CAAC;GAAE,MAAM;GAAY,KAAK;EAAY,CAAC;EACtD,oBAAoB;EACpB;EACA;CACF;AACF;;AAGA,SAAgB,uBACd,QACA,YACkB;CAClB,MAAM,MAAwB,CAAC;CAC/B,KAAK,MAAM,KAAK,OAAO,SAAS;EAC9B,MAAM,cAAc,EAAE,oBAAoB,EAAE;EAI5C,IAHkB,cAAc,EAAE,cAAc,EAAE,kBAGhC,GAChB,IAAI,KACF,QACE,eACA,EAAE,MACF,UAAU,EAAE,KAAK,+EACjB,QACA,IACA,YACA,sIACA,EAAE,MACF,iGACF,CACF;OACK,IAAI,gBAAgB,KAAK,EAAE,cAAc,EAAE,gBAAgB,GAEhE,IAAI,KACF,QACE,eACA,EAAE,MACF,UAAU,EAAE,KAAK,gFAAgF,EAAE,YAAY,cAAc,EAAE,cAAc,IAC7I,QACA,IACA,YACA,2JACA,EAAE,MACF,sEACF,CACF;EAIF,IAAI,eAAe,KAAK,CAAC,EAAE,mBACzB,IAAI,KACF,QACE,mBACA,EAAE,MACF,UAAU,EAAE,KAAK,mFACjB,UACA,IACA,YACA,oHACA,EAAE,IACJ,CACF;EAIF,IAAI,EAAE,SAAS,YAAY,EAAE,oBAAoB,GAC/C,IAAI,KACF,QACE,UACA,EAAE,MACF,iBAAiB,EAAE,KAAK,YAAY,EAAE,kBAAkB,+BACxD,QACA,KACA,YACA,uMACA,EAAE,IACJ,CACF;EAIF,IAAI,EAAE,QAAQ,wBAAwB,CAAC,EAAE,kBACvC,IAAI,KACF,QACE,mBACA,EAAE,MACF,UAAU,EAAE,KAAK,OAAO,EAAE,MAAM,4DAChC,UACA,IACA,YACA,mFAAmF,EAAE,MAAM,mDAC3F,EAAE,IACJ,CACF;EAIF,IAAI,CAAC,EAAE,aACL,IAAI,KACF,QACE,gBACA,EAAE,MACF,UAAU,EAAE,KAAK,oBACjB,OACA,IACA,YACA,wGACA,EAAE,IACJ,CACF;EAIF,IAAI,CAAC,EAAE,UACL,IAAI,KACF,QACE,iBACA,EAAE,MACF,UAAU,EAAE,KAAK,8CACjB,OACA,KACA,YACA,iJACA,EAAE,IACJ,CACF;CAEJ;CACA,OAAO;AACT;AAIA,IAAa,oBAAb,MAAgF;CAC9E,KAAc;CACd,cACE;CACF,YAAqB;CACrB,OAAgB;EAAE,MAAM;EAA0B,iBAAiB;CAAE;CACrE,UAAmB;CACnB,kBAA2B;EACzB,MAAM;EACN,sBAAsB;EACtB,oBAAoB;CACtB;CAEA,MAAM,QAAQ,OAAyB,KAAgD;EACrF,MAAM,aAAa,IAAI,MAAM,+BAAc,IAAI,KAAK,EAAA,CAAE,YAAY;EAClE,IAAI,MACF,gBAAgB,MAAM,QAAQ,OAAO,eAAe,MAAM,oBAAoB,aAChF;EACA,OAAO,uBAAuB,OAAO,UAAU;CACjD;AACF;AAEA,MAAa,sBAAsB,IAAI,kBAAkB;;;ACxYzD,MAAM,yBAAyB;CAC7B;CACA;CACA;CACA;CACA;CACA;AACF;AAEA,IAAa,YAAb,MAAuB;CACrB;CACA;CAEA,YAAY,UAA4B,CAAC,GAAG;EAC1C,KAAK,UAAU,QAAQ;EACvB,KAAK,gBAAgB,QAAQ,iBAAiB;CAChD;CAEA,MAAM,MAAM,OAAmB,OAAkC;EAC/D,MAAM,MAAM,MAAM,MAAM,OAAO,KAAK;EACpC,IAAI,CAAC,KAAK,MAAM,IAAI,cAAc,OAAO,MAAM,WAAW;EAC1D,MAAM,CAAC,OAAO,QAAQ,WAAW,UAAU,MAAM,QAAQ,IAAI;GAC3D,MAAM,MAAM,EAAE,MAAM,CAAC;GACrB,MAAM,OAAO,EAAE,MAAM,CAAC;GACtB,MAAM,UAAU,KAAK;GACrB,MAAM,OAAO,KAAK;EACpB,CAAC;EACD,OAAO,KAAK,WAAW;GAAE;GAAK;GAAO;GAAQ;GAAW;EAAO,CAAC;CAClE;CAEA,WAAW,OAA2B;EACpC,MAAM,QAAkB,CAAC;EACzB,MAAM,WAAW,MAAM,MAAM,QAC1B,MAA2C,EAAE,SAAS,KACzD;EACA,MAAM,YAAY,MAAM,MAAM,QAC3B,MAA4C,EAAE,SAAS,MAC1D;EACA,MAAM,aAAa,MAAM,MAAM,QAC5B,MAA6C,EAAE,SAAS,OAC3D;EACA,MAAM,eAAe,MAAM,MAAM,QAC9B,MAA+C,EAAE,SAAS,SAC7D;EACA,MAAM,iBAAiB,WAAW,QAC/B,SAAS,KAAK,cAAc,gBAAgB,KAAK,YAAY,cAAc,IAC9E;EAEA,MAAM,UACJ,MAAM,IAAI,SAAS,SAAS,OAAO,IAAI,MAAM,IAAI,WAAW,cAAc,KAAM;EAClF,IAAI,CAAC,SAAS,MAAM,KAAK,qCAAqC;EAE9D,MAAM,eAAe,WAAW,SAC5B,WAAW,QAAQ,KAAK,SAAS,MAAM,oBAAoB,KAAK,KAAK,GAAG,CAAC,IACzE,WAAW,SACX,KAAA;EAOJ,MAAM,gBALJ,OAAO,MAAM,IAAI,SAAS,UAAU,WAChC,QACE,MAAM,IAAI,QAAQ,QAAQ,IAAI,MAAM,IAAI,QAAQ,QAAQ,MAAM,MAAM,IAAI,QAAQ,KAClF,IACA,KAAA,MAC+B,gBAAgB;EAErD,MAAM,kBAAkB,UAAU,QAAQ,SAAS,KAAK,WAAW,OAAO,CAAC,CAAC;EAC5E,MAAM,iBAAiB,UAAU,WAAW,IAAI,IAAI,kBAAkB,UAAU;EAChF,IAAI,UAAU,WAAW,GAAG,MAAM,KAAK,wBAAwB;EAE/D,MAAM,gBACJ,MAAM,UAAU,SAChB,UAAU,QAAQ,SAAS,0BAA0B,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC;EAC5E,MAAM,eAAe,gBAAgB,IAAI,QAAQ,gBAAgB,CAAC,IAAI;EACtE,IAAI,CAAC,cAAc,MAAM,KAAK,uCAAuC;EAErE,MAAM,eAAe,aAAa,QAC/B,SAAS,OAAO,KAAK,eAAe,YAAY,KAAK,aAAa,CACrE;EACA,MAAM,cAAc,aAAa,SAC7B,aAAa,QACV,KAAK,SAAS,OAAO,KAAK,eAAe,KAAK,KAAK,IAAI,GAAG,KAAK,cAAc,CAAC,GAC/E,CACF,IAAI,aAAa,SACjB,UAAU,MAAM,SACZ,yCAAyC,KAAK,KAAK,UAAU,KAAK,IAAI,CAAC,CACzE,IACA,KACA;EACN,IAAI,CAAC,aAAa,MAAM,KAAK,sCAAsC;EAEnE,MAAM,eAAe,WAAW,QAAQ,SAAS,gBAAgB,IAAI,CAAC;EACtE,MAAM,oBAAoB,eAAe,QAAQ,SAAS,gBAAgB,IAAI,CAAC;EAC/E,MAAM,YAAY,eAAe,SAAU,kBAAkB,SAAS,IAAI,IAAK;EAC/E,IAAI,kBAAkB,QACpB,MAAM,KAAK,yBAAyB,kBAAkB,OAAO,aAAa;OACvE,IAAI,CAAC,eAAe,QAAQ,MAAM,KAAK,iCAAiC;EAE7E,MAAM,mBAAmB,WAAW,SAAS,aAAa,SAAS,WAAW,SAAS;EACvF,IAAI,kBAAkB,MAAM,KAAK,YAAY,aAAa,OAAO,6BAA6B;EAE9F,MAAM,2BACJ,gBACA,aAAa,SACb,SAAS,QAAQ,SAAS,kBAAkB,KAAK,UAAU,EAAE,CAAC,CAAC,CAAC;EAClE,MAAM,eACJ,SAAS,QAAQ,SAAS,KAAK,QAAQ,KAAK,UAAU,EAAE,CAAC,CAAC,CAAC,SAC3D,MAAM,OAAO,QAAQ,UAAU,KAAK,QAAQ,KAAK,UAAU,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC;EAC9E,MAAM,mBACJ,2BAA2B,iBAAiB,IACxC,IACA,4BAA4B,2BAA2B;EAC7D,MAAM,eACJ,2BAA2B,iBAAiB,IACxC,IACA,gBAAgB,2BAA2B;EACjD,IAAI,eAAe,GAAG,MAAM,KAAK,YAAY,aAAa,iBAAiB;EAe3E,OAAO;GACL;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA,SAvBc,MAAM,OAAO,SACzB,KAAK,IACH,GAAG,MAAM,OACN,QAAQ,UAA6B,MAAM,cAAc,KAAK,CAAC,CAC/D,KAAK,UAA6B,MAAM,QAAQ,GACnD,CACF,IACA,SAAS,QAAQ,KAAK,SAAS,OAAO,KAAK,WAAW,IAAI,CAAC;GAiB7D,aAfA,MAAM,IAAI,WAAW,MAAM,IAAI,YAC3B,KAAK,IAAI,IAAI,MAAM,IAAI,UAAU,MAAM,IAAI,aAAa,GAAI,IAC5D;GAcJ;EACF;CACF;CAEA,KAAK,OAAyB;EAC5B,OAAO,kBAAkB,OAAO,KAAK,OAAO;CAC9C;CAEA,QAAgB,MAAuB;EACrC,OAAO,KAAK,cAAc,MAAM,YAAY,QAAQ,KAAK,IAAI,CAAC;CAChE;AACF;AAEA,SAAS,oBAAoB,OAAuB;CAClD,OAAO,QAAQ,IAAI,QAAQ,QAAQ,EAAE,IAAI,QAAQ,KAAK;AACxD;AAEA,SAAS,kBAAkB,MAAuB;CAChD,OAAO,qGAAqG,KAC1G,IACF;AACF;AAEA,SAAS,gBAAgB,MAAiD;CACxE,OACE,KAAK,YAAY,aAAa,QAC9B,KAAK,YAAY,YAAY,cAC7B,eAAe,KAAK,YAAY,gBAAgB,KAChD,eAAe,KAAK,YAAY,YAAY,KAC5C,KAAK,SAAS;AAElB;AAEA,SAAS,eAAe,OAAyB;CAC/C,OAAO,OAAO,UAAU,YAAY,QAAQ;AAC9C;;;;;;;;;;;;;;;;;;;;;;;AC/EA,MAAa,6BAAgE;CAC3E,QAAQ;CACR,WAAW;CACX,SAAS;AACX;AAiCA,MAAa,iCAAiC;AAE9C,MAAM,qBAAqB;AAC3B,MAAM,mBAAmB;AACzB,MAAM,uBAAuB;AAC7B,MAAM,kBAAkB;AACxB,MAAM,qBAAqB;AAC3B,MAAM,gBAAgB;AAEtB,MAAM,kBAAkB;CACtB,MAAM;CACN,sBAAsB;CACtB,UAAU,CAAC,WAAW,UAAU;CAChC,YAAY;EACV,SAAS;GAAE,MAAM;GAAU,WAAW;GAAI,WAAW;EAAI;EACzD,UAAU;GACR,MAAM;GACN,UAAU;GACV,OAAO;IACL,MAAM;IACN,sBAAsB;IACtB,UAAU;KAAC;KAAW;KAAW;KAAS;KAAY;IAAU;IAChE,YAAY;KACV,SAAS;MAAE,MAAM;MAAU,WAAW;MAAG,WAAW;KAAI;KACxD,SAAS,EAAE,MAAM,UAAU;KAC3B,OAAO;MAAE,MAAM;MAAU,SAAS;MAAG,SAAS;KAAG;KACjD,UAAU;MAAE,MAAM;MAAU,WAAW;MAAG,WAAW;KAAI;KACzD,UAAU;MAAE,MAAM;MAAU,MAAM;OAAC;OAAY;OAAS;OAAS;MAAM;KAAE;IAC3E;GACF;EACF;CACF;AACF;AAEA,SAAS,SAAS,MAAc,KAAa,OAAuB;CAClE,IAAI,KAAK,UAAU,KAAK,OAAO;CAC/B,OAAO,GAAG,KAAK,MAAM,GAAG,GAAG,EAAE,iBAAiB,KAAK,SAAS,IAAI,YAAY,MAAM;AACpF;AAEA,SAAS,YACP,OACA,MACQ;CACR,MAAM,aAAa,MAAM,YACtB,QAAQ,MAAM,EAAE,QAAQ,UAAU,KAAK,eAAe,CAAC,CACvD,KAAK,MAAM,aAAa,EAAE,KAAK,QAAQ,EAAE,SAAS,CAAC,CACnD,KAAK,MAAM;CAEd,MAAM,OAAO,MAAM,cAAc;CAEjC,OAAO;;;;;;;;;;EAUP,MAAM,YAAY;;EAElB,MAAM,gBAAgB,+BAA+B,MAAM,cAAc,mBAAmB,MAAM,uBAAuB,GAAG,QAAQ,GAAG;EACvI,MAAM,iBACL,KACE,GAAG,MACF,KAAK,IAAI,EAAE,KAAK,EAAE,KAAK,GAAG,EAAE,UAAU,SAAS,cAAc,EAAE,SAAS,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,EAAE,KAAK,IACzG,CAAC,CACA,KAAK,IAAI,EAAE;;EAEZ,OAAO,qDAAqD,SAAS,MAAM,KAAK,cAAc,MAAM,EAAE,QAAQ,GAAG;EACjH,SAAS,YAAY,KAAK,gBAAgB,QAAQ,EAAE;;;;;;;;;;;;;;;;;;AAkBtD;;;;;;AASA,eAAsB,wBACpB,OACA,UAAuC,CAAC,GACH;CACrC,MAAM,QAAQ,KAAK,IAAI;CACvB,MAAM,aAAa,MAAM,iBAAiB;CAE1C,IAAI,eAAe,GACjB,OAAO;EACL,MAAM;EACN,SAAS;EACT,OAAO;EACP,cAAc;EACd,YAAY;EACZ,UAAU,CAAC;EACX,SAAS;EACT,YAAY;EACZ,SAAS;EACT,WAAW;EACX,OAAO;CACT;CAGF,MAAM,OAA8C;EAClD,OAAO,QAAQ,SAAS;EACxB,WAAW,QAAQ,aAAa;EAChC,WAAW,QAAQ,aAAa;EAChC,gBAAgB,QAAQ,kBAAkB;EAC1C,iBAAiB,QAAQ,mBAAmB;EAC5C,cAAc,QAAQ,gBAAgB;EACtC,KAAK,QAAQ,OAAO,CAAC;EACrB,YAAY,QAAQ,cAAc,IAAI,WAAW;EACjD,WAAW,QAAQ,aAAa;EAChC,UAAU,QAAQ,YAAY,CAAC;EAC/B,QAAQ,QAAQ,UAAU,IAAI,gBAAgB,CAAC,CAAC;EAChD,gBAAgB,QAAQ,kBAAkB;EAC1C,mBAAmB;GAAE,GAAG;GAA4B,GAAI,QAAQ,qBAAqB,CAAC;EAAG;CAC3F;CAMA,MAAM,oBAAoB,SAA8B;EACtD,IAAI,KAAK,mBAAmB,QAAQ,OAAO;EAC3C,IAAI,KAAK,UAAU,MAAM,OAAO,KAAK;EACrC,IAAI,KAAK,mBAAmB,cAC1B,OAAO,KAAK,kBAAkB,KAAK,cAAc,aAAa;EAEhE,OAAO;CACT;CACA,MAAM,eAAe,IAAI,IACvB,MAAM,iBAAiB,KAAK,MAAM,CAAC,EAAE,MAAM,iBAAiB,CAAC,CAAC,CAAC,CACjE;CAEA,IAAI;CACJ,IAAI;EACF,MAAM,UAAU;GACd,OAAO,KAAK;GACZ,UAAU,CACR;IACE,MAAM;IACN,SACE;GACJ,GACA;IAAE,MAAM;IAAiB,SAAS,YAAY,OAAO,IAAI;GAAE,CAC7D;GACA,YAAY;IAAE,MAAM;IAA0B,QAAQ;GAAgB;GACtE,aAAa;GACb,WAAW,KAAK;GAChB,WAAW,KAAK;EAClB;EACA,MAAM,OAAO,MAAM,KAAK,WAAW,YAAY;GAC7C,SAAS;GACT,OAAO,KAAK;GACZ,OAAO;GACP,OAAO,KAAK;GACZ,GAAI,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,SAAS,IAAI,EAAE,MAAM,KAAK,SAAS,IAAI,CAAC;GACvE,eAAe,2BAA2B,SAAS,KAAK,GAAG;GAC3D,QAAQ,KAAK;GACb,UAAU,QAAQ,WAChB,YAA6D,SAAS;IACpE,GAAG,KAAK;IACR;IACA,gBAAgB;GAClB,CAAC;GACH,UAAU,EAAE,aAAa,mBAAmB,MAAM;GAClD,kBAAkB;EACpB,CAAC;EACD,UAAU,KAAK;EACf,IAAI,CAAC,KAAK,WAAW,MAAM,KAAK;EAChC,MAAM,EAAE,UAAU,KAAK;EAEvB,IAAI,CAAC,OAAO,YAAY,CAAC,MAAM,QAAQ,MAAM,QAAQ,GACnD,MAAM,IAAI,MAAM,uEAAqE;EAGvF,MAAM,WAA6B,MAAM,SAAS,KAAK,OAAO;GAC5D,SAAS,OAAO,EAAE,OAAO;GACzB,SAAS,QAAQ,EAAE,OAAO;GAC1B,OAAO,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC;GACrD,UAAU,OAAO,EAAE,YAAY,EAAE;GACjC,UAAW;IAAC;IAAY;IAAS;IAAS;GAAM,CAAC,CAAW,SAAS,EAAE,QAAQ,IAC3E,EAAE,WACF;EACN,EAAE;EAEF,MAAM,eAAe,SAAS,QAAQ,MAAM,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC,CAAC;EACvE,IAAI,YAAY;EAChB,IAAI,mBAAmB;EACvB,KAAK,MAAM,KAAK,UAAU;GACxB,MAAM,IAAI,aAAa,IAAI,EAAE,OAAO,KAAK;GACzC,aAAa;GACb,oBAAoB,IAAI,EAAE;EAC5B;EACA,MAAM,WACJ,YAAY,IACR,mBAAmB,YACnB,SAAS,QAAQ,GAAG,MAAM,IAAI,EAAE,OAAO,CAAC,IAAI,KAAK,IAAI,GAAG,SAAS,MAAM;EAE7E,OAAO;GACL,MAAM;GACN,SAAS;GACT,OAAO,QAAQ,WAAW,GAAA,CAAI,QAAQ,CAAC,CAAC;GACxC;GACA;GACA;GACA,SAAS,OAAO,MAAM,WAAW,EAAE;GACnC,YAAY,KAAK,IAAI,IAAI;GACzB,SAAS,KAAK,QAAQ,cAAc,OAAO,KAAK,QAAQ;GACxD,WAAW;EACb;CACF,SAAS,KAAK;EACZ,OAAO;GACL,MAAM;GACN,SAAS;GACT,OAAO;GACP,cAAc;GACd;GACA,UAAU,CAAC;GACX,SAAS;GACT,YAAY,KAAK,IAAI,IAAI;GACzB,SAAS,WAAW,CAAC,QAAQ,cAAc,QAAQ,UAAU;GAC7D,WAAW;GACX,OAAO,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;EACxD;CACF;AACF;;;;;AAMA,SAAgB,2BACd,UAAuC,CAAC,GACmC;CAC3E,QAAQ,UAAU,wBAAwB,OAAO,OAAO;AAC1D"}

package/dist/{server-DLEvyW2z.js → server-DaCpLfi0.js}

@@ -1,5 +1,5 @@
-import { i as CostLedger } from "./cost-ledger-CHDLA0Ss.js";
-import { a as assertLlmRoute, c as callLlmJson, f as maximumChargeForLlmRequest, i as LlmRouteAssertionError, l as costReceiptFromLlm, u as costReceiptFromLlmError } from "./llm-client-Cj3c7PEm.js";
+import { i as CostLedger } from "./cost-ledger-CZ9diLxY.js";
+import { a as assertLlmRoute, c as callLlmJson, f as maximumChargeForLlmRequest, i as LlmRouteAssertionError, l as costReceiptFromLlm, u as costReceiptFromLlmError } from "./llm-client-bkztEfIx.js";
 import { z } from "zod";
 import { readFileSync } from "node:fs";
 import { dirname, resolve } from "node:path";
@@ -1037,4 +1037,4 @@ function startServerAsync(opts = {}) {
 //#endregion
 export { TraceEventSchema as A, HealthResponseSchema as C, RubricDimensionSchema as D, ListRubricsResponseSchema as E, hashRubric as F, TracesIngestResponseSchema as M, VersionResponseSchema as N, RubricInfoSchema as O, WIRE_VERSION as P, FeedbackTrajectorySchema as S, JudgeResultSchema as T, ErrorResponseSchema as _, runRpcBatch as a, FeedbackIngestResponseSchema as b, WireError as c, handleListRubrics as d, handleTracesIngest as f, listBuiltinRubrics as g, getBuiltinRubric as h, dispatchRpc as i, TracesIngestRequestSchema as j, RubricSchema as k, handleFeedbackIngest as l, BUILTIN_RUBRICS as m, startServer as n, runRpcOnce as o, handleVersion as p, startServerAsync as r, buildOpenApi as s, createApp as t, handleJudge as u, FailureModeSchema as v, JudgeRequestSchema as w, FeedbackLabelSchema as x, FeedbackAttemptSchema as y };
 
-//# sourceMappingURL=server-DLEvyW2z.js.map
+//# sourceMappingURL=server-DaCpLfi0.js.map