@tangle-network/agent-eval 0.94.0 → 0.95.0

package/dist/contract/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/contract/self-improve.ts","../../src/contract/diff.ts","../../src/contract/intake/agent-trace.ts","../../src/contract/intake/feedback-table.ts","../../src/contract/intake/otel-spans.ts"],"sourcesContent":["/**\n * # `selfImprove()` — the LAND-tier one-shot.\n *\n * The cheapest possible call site to run a real closed-loop self-\n * improvement over your agent. Wraps `runImprovementLoop` with smart\n * defaults and a budget-shaped options API; every escape hatch the\n * substrate exposes is reachable from here without losing the\n * one-function feel.\n *\n * Defaults picked to match the LAND-tier story:\n *   - In-memory storage (no filesystem touch).\n *   - `gepaDriver` reflective mutation with copywriting-flavored primitives\n *     (override `driver` or `mutationPrimitives` for any domain).\n *   - `defaultProductionGate` with `deltaThreshold: 0.05`.\n *   - Held-out split = 25% of scenarios, deterministic by id hash.\n *   - 3 generations × population 2 (raise via `budget` for more search).\n *   - `autoOnPromote: 'none'` (we don't open PRs unless you ask).\n *\n * Want one-click? Provide `agent` + `scenarios` + `judge`. Done.\n * Want distributed? Pass `cellPlacement` + an `httpDispatch`-backed\n * agent. Want a code-tier surface? Pass a `MutableSurface` + your own\n * `driver`. Same function.\n */\n\nimport { createHash } from 'node:crypto'\nimport { gepaDriver } from '../campaign/drivers/gepa'\nimport { defaultProductionGate } from '../campaign/gates/default-production-gate'\nimport {\n  type RunImprovementLoopResult,\n  runImprovementLoop,\n} from '../campaign/presets/run-improvement-loop'\nimport type { RunOptimizationOptions } from '../campaign/presets/run-optimization'\nimport {\n  emitLoopProvenance,\n  type LoopProvenanceRecord,\n  surfaceContentHash,\n} from '../campaign/provenance'\nimport {\n  type CampaignStorage,\n  fsCampaignStorage,\n  inMemoryCampaignStorage,\n} from '../campaign/storage'\nimport type {\n  CampaignCellResult,\n  DispatchContext,\n  Gate,\n  ImprovementDriver,\n  JudgeConfig,\n  LabeledScenarioStore,\n  MutableSurface,\n  Scenario,\n} from '../campaign/types'\nimport { createHostedClient, type HostedTenant } from '../hosted/client'\nimport type { EvalRunCellScore, EvalRunEvent, EvalRunGenerationSnapshot } from '../hosted/types'\nimport type { JudgeScoresRecord, RunRecord } from '../run-record'\nimport { analyzeRuns } from './analyze-runs'\nimport type { InsightReport } from './insight-report'\n\nexport interface SelfImproveBudget {\n  /** Hard $ ceiling across all cells in baseline + every generation. Cells\n   *  beyond the ceiling are skipped (cost-aware, not aborted). */\n  dollars?: number\n  /** How many improvement generations to explore. Default 3. Set 0 to\n   *  skip improvement entirely (selfImprove becomes a baseline-only run). */\n  generations?: number\n  /** Candidates the driver proposes per generation. Default 2. */\n  populationSize?: number\n  /** Max concurrent cells across the loop. Default 2. */\n  maxConcurrency?: number\n  /** Fraction of `scenarios` held out from training, used for the gate.\n   *  Default 0.25. Ignored when `holdoutScenarios` is set explicitly. */\n  holdoutFraction?: number\n  /** Explicit held-out scenarios; overrides `holdoutFraction`. */\n  holdoutScenarios?: Scenario[]\n  /** Per-scenario replicates per cell — raises bootstrap-CI tightness. Default 1. */\n  reps?: number\n  /** Top-scoring candidates carried into the next generation. Default 2. */\n  promoteTopK?: number\n}\n\nexport interface SelfImproveLlm {\n  /** Endpoint base URL. Default Tangle Router. */\n  baseUrl?: string\n  /** Bearer token. Default `process.env.OPENAI_API_KEY`. */\n  apiKey?: string\n  /** Model id used by `gepaDriver` reflection. Default\n   *  `anthropic/claude-sonnet-4.6`. */\n  model?: string\n}\n\nexport type SelfImproveProgressEvent =\n  | { kind: 'baseline.started'; scenarios: number }\n  | { kind: 'baseline.completed'; compositeMean: number; durationMs: number }\n  | { kind: 'generation.started'; index: number; populationSize: number }\n  | { kind: 'generation.completed'; index: number; bestComposite: number; durationMs: number }\n  | { kind: 'gate.decided'; decision: string; lift: number }\n\nexport interface SelfImproveOptions<TScenario extends Scenario, TArtifact> {\n  /**\n   * Your agent — a function that takes the current `MutableSurface`\n   * (typically a system prompt the loop is optimizing) plus the\n   * scenario + cell ctx, and returns the artifact your judge scores.\n   *\n   * Same shape as `RunOptimizationOptions.dispatchWithSurface`. Wrap a\n   * plain `Dispatch` if you don't have a surface seam:\n   *\n   *   agent: (_surface, scenario, ctx) => yourPlainDispatch(scenario, ctx)\n   *\n   * That mode evaluates without mutating any surface — useful as a\n   * baseline-only run (set `budget.generations = 0`).\n   */\n  agent: (surface: MutableSurface, scenario: TScenario, ctx: DispatchContext) => Promise<TArtifact>\n\n  /** Scenarios to evaluate against. Train/holdout split is computed from\n   *  these unless `budget.holdoutScenarios` is set explicitly. */\n  scenarios: TScenario[]\n\n  /** Judge that scores artifacts. Bring your own; use `langchainJudge`\n   *  from `/adapters/langchain` for a Runnable-shaped one. */\n  judge: JudgeConfig<TArtifact, TScenario>\n\n  /** Starting surface — system prompt, JSON config, anything `MutableSurface`\n   *  accepts. The driver mutates this each generation. */\n  baselineSurface: MutableSurface\n\n  /** Budget + loop shape. All fields optional; defaults pick the LAND-tier\n   *  story. */\n  budget?: SelfImproveBudget\n\n  /** Custom driver. Default is `gepaDriver` configured from `llm` +\n   *  `mutationPrimitives`. */\n  driver?: ImprovementDriver\n\n  /** Default-driver overrides — used when `driver` is unset. */\n  mutationPrimitives?: string[]\n  driverTarget?: string\n\n  /** Custom gate. Default is `defaultProductionGate` with\n   *  `deltaThreshold: 0.05` on the held-out split. */\n  gate?: Gate<TArtifact, TScenario>\n\n  /** LLM config consumed by the default `gepaDriver`. Ignored if you pass\n   *  your own `driver`. */\n  llm?: SelfImproveLlm\n\n  /** Storage backend. Default is DURABLE: when a real (non-`mem://`) `runDir`\n   *  is available, the substrate defaults to `fsCampaignStorage()` so the\n   *  provenance record + OTel spans survive the call. Pass\n   *  `inMemoryCampaignStorage()` explicitly to opt OUT (tests, edge runtimes).\n   *  Default when `runDir` is `mem://...` (or unset): in-memory. */\n  storage?: CampaignStorage\n\n  /** Run directory (logical for in-memory storage, real path for fs).\n   *  Default `mem://selfImprove-<timestamp>` (in-memory, non-durable). Pass a\n   *  real path to persist the provenance record + spans. */\n  runDir?: string\n\n  /**\n   * Worker call records for backend provenance. The agent is opaque to the\n   * substrate (it returns an artifact, not token usage), so to capture an\n   * `assertRealBackend`-grade verdict + worker call count + model in the\n   * provenance record, the agent reports its per-call `RunRecord`s here.\n   * Called once after the loop; return the records the agent accumulated.\n   * When unset, backend provenance is derived from campaign cells (cost only;\n   * verdict will read `stub` without token usage — the honest signal that no\n   * token channel was wired).\n   */\n  collectWorkerRecords?: () => RunRecord[]\n\n  /** Fires once the durable provenance record + OTel spans are emitted.\n   *  Receives the structured record for inline assertions / custom routing. */\n  onProvenance?: (record: LoopProvenanceRecord) => void\n\n  /** Distributed-driver seam — same as `RunCampaignOptions.cellPlacement`.\n   *  Returns an opaque placement key the substrate forwards to your agent\n   *  as `ctx.placement`. Combined with `httpDispatch` from\n   *  `/adapters/http`, fans cells across regions. */\n  cellPlacement?: (input: {\n    scenario: TScenario\n    rep: number\n    generation?: number\n  }) => string | undefined\n\n  /** Streaming hook — fires on baseline + each generation + gate decision.\n   *  Consumer routes events wherever (UI, dashboard, logs). */\n  onProgress?: (event: SelfImproveProgressEvent) => void\n\n  /** Auto-promotion behavior on a ship decision. Default `'none'` — we\n   *  return the winner; you ship it however you ship. `'pr'` opens a\n   *  GitHub PR via `openAutoPr`; requires `ghOwner` + `ghRepo`. */\n  autoOnPromote?: 'pr' | 'none'\n  ghOwner?: string\n  ghRepo?: string\n\n  /**\n   * Opt-in: ship eval-run events to a hosted orchestrator (ours, your\n   * self-hosted one, or any compatible implementation of the\n   * `docs/hosted-ingest-spec.md` wire format). When set, the substrate\n   * POSTs the final `EvalRunEvent` to `${endpoint}/v1/ingest/eval-runs`\n   * after the loop completes. Failures are logged but do not fail the\n   * loop — local result is always returned.\n   *\n   * For our orchestrator: `{ endpoint: 'https://orchestrator.tangle.tools/v1', apiKey, tenantId }`.\n   *\n   * For your self-hosted: any URL serving the wire format. See\n   * `examples/hosted-ingest-server/` for the reference receiver.\n   */\n  hostedTenant?: HostedTenant\n\n  /** Free-form labels attached to the hosted event (env, branch, model id,\n   *  etc.). Ignored when `hostedTenant` is unset. */\n  hostedLabels?: Record<string, string>\n\n  /** Capture every artifact + judge score to this store (labeled-example\n   *  corpus the driver may read for few-shot, and the dataset you ship). Pass\n   *  `'off'` to disable. Default: off. */\n  labeledStore?: LabeledScenarioStore | 'off'\n\n  /** Capture-source tag for `labeledStore`. Default `'eval-run'`. */\n  captureSource?: 'production-trace' | 'eval-run' | 'manual' | 'red-team' | 'synthetic'\n\n  /**\n   * Per-cell backend-integrity expectation — the fail-loud guard. A cell that\n   * produced an artifact but reported `costUsd === 0` AND zero tokens is a\n   * stub. Modes: `'assert'` throws on the first such cell, `'warn'` logs it,\n   * `'off'` skips the check (offline/replay). Default `'assert'` — `selfImprove`\n   * is the real-run path, so a stub fails loud rather than scoring a clean 0.\n   */\n  expectUsage?: 'assert' | 'warn' | 'off'\n\n  /**\n   * Per-generation findings producer (the EYES→HANDS closure). After each\n   * generation is scored, this is called; whatever it returns REPLACES the\n   * driver's `findings` for the next generation's `propose()`. Plug a\n   * trace-analyst registry / HALO here. When absent, findings stay\n   * `opts.findings`.\n   */\n  analyzeGeneration?: RunOptimizationOptions<TScenario, TArtifact>['analyzeGeneration']\n\n  /** Static findings forwarded to the driver's `propose()` as `ctx.findings`\n   *  (a findings-grounded driver consumes them). Default: none. */\n  findings?: unknown[]\n}\n\nexport interface SelfImproveResult<TScenario extends Scenario, TArtifact> {\n  /** Composite mean across all scenarios, baseline run. */\n  baseline: {\n    compositeMean: number\n    perScenario: Record<string, number>\n  }\n  /** Composite mean on the held-out set, winner run. */\n  winner: {\n    compositeMean: number\n    perScenario: Record<string, number>\n    surface: MutableSurface\n    /** Driver label for the promoted change. Absent ⇒ winner == baseline or\n     *  a bare-surface mutator. */\n    label?: string\n    /** Driver rationale — the \"because Z\" that motivated the promoted change.\n     *  Threaded from the driver's `ProposedCandidate` through the loop.\n     *  Absent ⇒ winner == baseline. */\n    rationale?: string\n  }\n  /** `winner.compositeMean - baselineOnHoldout.compositeMean`. Positive\n   *  means the gate observed improvement. */\n  lift: number\n  /** The explicit baseline→winner unified diff. Always present (empty string\n   *  when winner == baseline). */\n  diff: string\n  /** Durable, queryable provenance record: candidate→cell→gate→promote chain +\n   *  rationale + diff + backend provenance. The artifact the hosted ingest\n   *  path stores; the +lift RECOMPUTES from `record.heldOutLift`. */\n  provenance: LoopProvenanceRecord\n  /** `defaultProductionGate.decide()` result. */\n  gateDecision: 'ship' | 'hold' | 'need_more_work' | 'model_ceiling' | 'arch_ceiling'\n  /** Number of generations actually explored (may be less than the\n   *  budget if the driver gave up early). */\n  generationsExplored: number\n  /** Wall-clock total. */\n  durationMs: number\n  /** Total cost across baseline + every generation. */\n  totalCostUsd: number\n  /**\n   * Rigor packet: distributional summary, paired-bootstrap lift CI,\n   * judge stats, contamination check, recommendations. Wired through\n   * `analyzeRuns()` on the baseline + winner cells of the campaign.\n   * Hosted-tier dashboards render this as the v3-vs-v4 decision view.\n   */\n  insight: InsightReport\n  /**\n   * Raw substrate result for advanced inspection — full per-generation\n   * candidates, full campaign artifacts, all judge scores. Useful for\n   * debugging or reporting beyond the summary.\n   */\n  raw: RunImprovementLoopResult<TArtifact, TScenario>\n}\n\n/**\n * Deterministic train/holdout split by a stable hash of `scenario.id`,\n * so the same scenario set always splits the same way across runs.\n */\nfunction splitTrainHoldout<TScenario extends Scenario>(\n  scenarios: TScenario[],\n  fraction: number,\n): { train: TScenario[]; holdout: TScenario[] } {\n  // Stable fnv-1a-ish hash of the id for ordering.\n  function hash(s: string): number {\n    let h = 2166136261 >>> 0\n    for (let i = 0; i < s.length; i++) {\n      h ^= s.charCodeAt(i)\n      h = Math.imul(h, 16777619) >>> 0\n    }\n    return h\n  }\n  const sorted = [...scenarios].sort((a, b) => hash(a.id) - hash(b.id))\n  const nHoldout = Math.max(1, Math.min(sorted.length - 1, Math.round(sorted.length * fraction)))\n  return {\n    holdout: sorted.slice(0, nHoldout),\n    train: sorted.slice(nHoldout),\n  }\n}\n\nfunction meanComposite(byScenario: Record<string, { meanComposite: number }>): {\n  compositeMean: number\n  perScenario: Record<string, number>\n} {\n  const perScenario: Record<string, number> = {}\n  const values: number[] = []\n  for (const [id, agg] of Object.entries(byScenario)) {\n    perScenario[id] = agg.meanComposite\n    values.push(agg.meanComposite)\n  }\n  return {\n    compositeMean: values.length === 0 ? 0 : values.reduce((s, v) => s + v, 0) / values.length,\n    perScenario,\n  }\n}\n\nconst DEFAULT_MUTATION_PRIMITIVES = [\n  'Tighten the hook: lead with the specific user outcome.',\n  'Replace generic adjectives with specific verbs or proof numbers.',\n  \"Anchor every claim in something the scenario's brief literally supports.\",\n  'Honor the surface-shape constraint (length, register, audience vocabulary).',\n]\n\n/**\n * One-shot self-improvement loop. See module docstring for defaults +\n * extension points.\n *\n * @example Minimum (LAND tier):\n *\n *   const result = await selfImprove({\n *     agent: (surface, scenario, ctx) => myAgent(surface, scenario, ctx.signal),\n *     scenarios,\n *     judge,\n *     baselineSurface: DEFAULT_PROMPT,\n *   })\n *   console.log(`lift: ${result.lift.toFixed(3)} (${result.gateDecision})`)\n *\n * @example Distributed (workers in three regions):\n *\n *   await selfImprove({\n *     agent: httpDispatch({ resolveUrl: ({ placement }) => REGION_URLS[placement!] }),\n *     scenarios,\n *     judge,\n *     baselineSurface: DEFAULT_PROMPT,\n *     cellPlacement: ({ scenario }) => scenario.region,\n *     budget: { maxConcurrency: 12 },\n *   })\n */\nexport async function selfImprove<TScenario extends Scenario, TArtifact>(\n  opts: SelfImproveOptions<TScenario, TArtifact>,\n): Promise<SelfImproveResult<TScenario, TArtifact>> {\n  const startedAt = Date.now()\n\n  const budget = opts.budget ?? {}\n  const generations = budget.generations ?? 3\n  const populationSize = budget.populationSize ?? 2\n  const maxConcurrency = budget.maxConcurrency ?? 2\n  const holdoutFraction = budget.holdoutFraction ?? 0.25\n  const costCeiling = budget.dollars\n  const expectUsage = opts.expectUsage ?? 'assert'\n\n  const explicitHoldout = budget.holdoutScenarios\n  const { train, holdout } = explicitHoldout\n    ? {\n        train: opts.scenarios.filter((s) => !explicitHoldout.some((h) => h.id === s.id)),\n        holdout: explicitHoldout as TScenario[],\n      }\n    : splitTrainHoldout(opts.scenarios, holdoutFraction)\n\n  if (train.length === 0) {\n    throw new Error(\n      'selfImprove: train split is empty. Reduce holdoutFraction or pass more scenarios.',\n    )\n  }\n  if (holdout.length === 0) {\n    throw new Error('selfImprove: holdout split is empty. Pass more scenarios.')\n  }\n\n  const driver: ImprovementDriver =\n    opts.driver ??\n    gepaDriver({\n      llm: {\n        baseUrl: opts.llm?.baseUrl ?? 'https://router.tangle.tools/v1',\n        apiKey: opts.llm?.apiKey ?? process.env.OPENAI_API_KEY ?? '',\n      },\n      model: opts.llm?.model ?? 'anthropic/claude-sonnet-4.6',\n      target:\n        opts.driverTarget ??\n        'agent surface (system prompt or config) being optimized by selfImprove',\n      mutationPrimitives: opts.mutationPrimitives ?? DEFAULT_MUTATION_PRIMITIVES,\n    })\n\n  const gate: Gate<TArtifact, TScenario> =\n    opts.gate ??\n    defaultProductionGate<TArtifact, TScenario>({\n      holdoutScenarios: holdout,\n      deltaThreshold: 0.05,\n    })\n\n  // Durable by default: a real (non-`mem://`) runDir means the caller wants\n  // persistence, so default to fs storage — the provenance record + spans\n  // survive the call. A `mem://` runDir (or none) stays in-memory. An explicit\n  // `storage` always wins (the opt-out path for tests / edge runtimes).\n  const runDir = opts.runDir ?? `mem://selfImprove-${startedAt}`\n  const isMemRunDir = runDir.startsWith('mem://')\n  const storage = opts.storage ?? (isMemRunDir ? inMemoryCampaignStorage() : fsCampaignStorage())\n\n  if (opts.onProgress) {\n    opts.onProgress({ kind: 'baseline.started', scenarios: opts.scenarios.length })\n  }\n\n  const result = await runImprovementLoop<TScenario, TArtifact>({\n    scenarios: train,\n    baselineSurface: opts.baselineSurface,\n    dispatchWithSurface: opts.agent,\n    driver,\n    judges: [opts.judge],\n    populationSize,\n    maxGenerations: generations,\n    promoteTopK: budget.promoteTopK,\n    reps: budget.reps,\n    holdoutScenarios: holdout,\n    gate,\n    autoOnPromote: opts.autoOnPromote ?? 'none',\n    ghOwner: opts.ghOwner,\n    ghRepo: opts.ghRepo,\n    storage,\n    runDir,\n    maxConcurrency,\n    cellPlacement: opts.cellPlacement,\n    costCeiling,\n    expectUsage,\n    labeledStore: opts.labeledStore,\n    captureSource: opts.captureSource,\n    analyzeGeneration: opts.analyzeGeneration,\n    findings: opts.findings,\n  })\n\n  const baseline = meanComposite(result.baselineOnHoldout.aggregates.byScenario)\n  const winnerStats = meanComposite(result.winnerOnHoldout.aggregates.byScenario)\n\n  if (opts.onProgress) {\n    opts.onProgress({\n      kind: 'baseline.completed',\n      compositeMean: baseline.compositeMean,\n      durationMs: Date.now() - startedAt,\n    })\n    opts.onProgress({\n      kind: 'gate.decided',\n      decision: result.gateResult.decision,\n      lift: winnerStats.compositeMean - baseline.compositeMean,\n    })\n  }\n\n  const totalCost =\n    result.baselineCampaign.aggregates.totalCostUsd +\n    result.generations.reduce(\n      (sum, gen) =>\n        sum + gen.surfaces.reduce((s, sf) => s + sf.campaign.aggregates.totalCostUsd, 0),\n      0,\n    )\n\n  // Rigor packet: feed baseline + winner cells through analyzeRuns().\n  // The two candidates (`baseline` / `winner`) give the lift section a\n  // clean paired comparison; per-judge / per-dimension / cost-quality\n  // sections populate from the cells' judgeScores.\n  const insight = await analyzeRuns({\n    runs: [\n      ...cellsToRunRecords(result.baselineCampaign.cells, 'baseline', runDir, opts.baselineSurface),\n      ...cellsToRunRecords(result.winnerOnHoldout.cells, 'winner', runDir, result.winnerSurface),\n    ],\n    baselineCandidateId: 'baseline',\n    candidateCandidateId: 'winner',\n  })\n\n  // ── Durable provenance: candidate→cell→gate→promote chain + rationale +\n  // diff + backend provenance. Always emitted; the +lift recomputes from it.\n  const durationMs = Date.now() - startedAt\n  const workerRecords =\n    opts.collectWorkerRecords?.() ??\n    cellsToRunRecords(result.winnerOnHoldout.cells, 'winner', runDir, result.winnerSurface)\n  const { record: provenance } = await emitLoopProvenance<TArtifact, TScenario>({\n    runId: `${runDir}#${startedAt}`,\n    runDir,\n    timestamp: new Date(startedAt).toISOString(),\n    baselineSurface: opts.baselineSurface,\n    winnerSurface: result.winnerSurface,\n    winnerLabel: result.winnerLabel,\n    winnerRationale: result.winnerRationale,\n    diff: result.promotedDiff,\n    generations: result.generations.map((g) => ({\n      generationIndex: g.record.generationIndex,\n      candidates: g.record.candidates,\n      promoted: g.record.promoted,\n      surfaces: g.surfaces.map((s) => ({ surfaceHash: s.surfaceHash, surface: s.surface })),\n    })),\n    gate: result.gateResult,\n    baselineOnHoldout: result.baselineOnHoldout,\n    winnerOnHoldout: result.winnerOnHoldout,\n    workerRecords,\n    totalCostUsd: totalCost,\n    totalDurationMs: durationMs,\n    storage,\n    hostedClient: opts.hostedTenant ? createHostedClient(opts.hostedTenant) : undefined,\n  })\n  if (opts.onProvenance) opts.onProvenance(provenance)\n\n  const summary: SelfImproveResult<TScenario, TArtifact> = {\n    baseline,\n    winner: {\n      ...winnerStats,\n      surface: result.winnerSurface,\n      ...(result.winnerLabel ? { label: result.winnerLabel } : {}),\n      ...(result.winnerRationale ? { rationale: result.winnerRationale } : {}),\n    },\n    lift: winnerStats.compositeMean - baseline.compositeMean,\n    diff: result.promotedDiff,\n    provenance,\n    gateDecision: result.gateResult.decision,\n    generationsExplored: result.generations.length,\n    durationMs,\n    totalCostUsd: totalCost,\n    insight,\n    raw: result,\n  }\n\n  // Opt-in hosted ingest. Failures logged but never fail the loop — the\n  // local result is always returned. This matches the wedge-doc invariant\n  // that LAND-tier never blocks on EXPAND-tier infra.\n  if (opts.hostedTenant) {\n    try {\n      await shipEvalRunToHosted(opts.hostedTenant, opts, summary, result, runDir)\n    } catch (err) {\n      const msg = err instanceof Error ? err.message : String(err)\n      // eslint-disable-next-line no-console -- intentional: hosted-ingest is best-effort\n      console.warn(`[agent-eval] hosted ingest failed (continuing): ${msg}`)\n    }\n  }\n\n  return summary\n}\n\nasync function shipEvalRunToHosted<TScenario extends Scenario, TArtifact>(\n  tenant: HostedTenant,\n  opts: SelfImproveOptions<TScenario, TArtifact>,\n  summary: SelfImproveResult<TScenario, TArtifact>,\n  raw: RunImprovementLoopResult<TArtifact, TScenario>,\n  runDir: string,\n): Promise<void> {\n  const client = createHostedClient(tenant)\n\n  function snapshotFromCampaign(\n    index: number,\n    surface: MutableSurface | undefined,\n    campaign: RunImprovementLoopResult<TArtifact, TScenario>['baselineCampaign'],\n    durationMs: number,\n  ): EvalRunGenerationSnapshot {\n    const cells: EvalRunCellScore[] = campaign.cells.map((cell) => {\n      const judgeScores = Object.values(cell.judgeScores)\n      const composite =\n        judgeScores.length === 0\n          ? 0\n          : judgeScores.reduce((s, j) => s + j.composite, 0) / judgeScores.length\n      return {\n        scenarioId: cell.scenarioId,\n        rep: cell.rep,\n        compositeMean: composite,\n        dimensions: Object.fromEntries(\n          Object.entries(cell.judgeScores).map(([name, score]) => [name, score.dimensions]),\n        ),\n        errorMessage: cell.error ?? undefined,\n      }\n    })\n    const compositeMean =\n      cells.length === 0 ? 0 : cells.reduce((s, c) => s + c.compositeMean, 0) / cells.length\n    return {\n      index,\n      surfaceHash:\n        typeof surface === 'string'\n          ? hashString(surface)\n          : hashString(JSON.stringify(surface ?? '')),\n      surface,\n      cells,\n      compositeMean,\n      costUsd: campaign.aggregates.totalCostUsd,\n      durationMs,\n    }\n  }\n\n  const generations: EvalRunGenerationSnapshot[] = []\n  // Baseline as generation 0.\n  generations.push(snapshotFromCampaign(0, opts.baselineSurface, raw.baselineCampaign, 0))\n  // Improvement generations as 1..N. Substrate stores per-surface campaigns\n  // per generation — we summarize the WINNING surface per generation here.\n  for (const gen of raw.generations) {\n    const winner = gen.surfaces.reduce(\n      (best, s) =>\n        s.campaign.aggregates.cellsExecuted > 0 &&\n        (best === undefined || averageComposite(s.campaign) > averageComposite(best.campaign))\n          ? s\n          : best,\n      gen.surfaces[0],\n    )\n    if (!winner) continue\n    generations.push(\n      snapshotFromCampaign(gen.record.generationIndex + 1, winner.surface, winner.campaign, 0),\n    )\n  }\n\n  const event: EvalRunEvent = {\n    runId: `${runDir}#${Date.now()}`,\n    runDir,\n    timestamp: new Date().toISOString(),\n    status: 'finished',\n    labels: opts.hostedLabels ?? {},\n    baseline: generations[0],\n    generations,\n    gateDecision: summary.gateDecision,\n    holdoutLift: summary.lift,\n    totalCostUsd: summary.totalCostUsd,\n    totalDurationMs: summary.durationMs,\n    insightReport: summary.insight,\n  }\n\n  await client.ingestEvalRun(event)\n}\n\nfunction averageComposite(\n  campaign: RunImprovementLoopResult<unknown, Scenario>['baselineCampaign'],\n): number {\n  const aggs = Object.values(campaign.aggregates.byScenario)\n  return aggs.length === 0 ? 0 : aggs.reduce((s, a) => s + a.meanComposite, 0) / aggs.length\n}\n\nfunction hashString(s: string): string {\n  let h = 2166136261 >>> 0\n  for (let i = 0; i < s.length; i++) {\n    h ^= s.charCodeAt(i)\n    h = Math.imul(h, 16777619) >>> 0\n  }\n  return h.toString(16).padStart(8, '0')\n}\n\n/**\n * Adapt campaign cells into the `RunRecord` shape `analyzeRuns()` consumes.\n * Each cell becomes one run; `candidateId` is the caller-supplied label so\n * baseline + winner pair cleanly on `(experimentId, seed)`.\n *\n * `promptHash` is the REAL sha256 content hash of the surface this cell ran\n * (baseline vs winner are byte-distinguishable + byte-identical-verifiable);\n * `configHash` is the sha256 of the candidate label so the two candidates'\n * config rows differ. Both were previously the literal `'sha256:cell'`, which\n * made baseline and winner indistinguishable in every downstream record.\n */\nfunction cellsToRunRecords<TArtifact>(\n  cells: ReadonlyArray<CampaignCellResult<TArtifact>>,\n  candidateId: 'baseline' | 'winner',\n  runId: string,\n  surface: MutableSurface,\n): RunRecord[] {\n  const promptHash = surfaceContentHash(surface)\n  const configHash = `sha256:${createHash('sha256').update(candidateId).digest('hex')}`\n  return cells.map((cell) => {\n    const perJudge: Record<string, Record<string, number>> = {}\n    const perDimMeanAccum: Record<string, { sum: number; n: number }> = {}\n    let compositeSum = 0\n    let compositeCount = 0\n    for (const [judgeId, score] of Object.entries(cell.judgeScores)) {\n      perJudge[judgeId] = { ...score.dimensions }\n      for (const [dim, value] of Object.entries(score.dimensions)) {\n        if (!Number.isFinite(value)) continue\n        const accum = perDimMeanAccum[dim] ?? { sum: 0, n: 0 }\n        accum.sum += value\n        accum.n += 1\n        perDimMeanAccum[dim] = accum\n      }\n      if (Number.isFinite(score.composite)) {\n        compositeSum += score.composite\n        compositeCount += 1\n      }\n    }\n    const perDimMean: Record<string, number> = {}\n    for (const [dim, { sum, n }] of Object.entries(perDimMeanAccum)) {\n      perDimMean[dim] = n === 0 ? 0 : sum / n\n    }\n    const composite = compositeCount === 0 ? 0 : compositeSum / compositeCount\n    const judgeScores: JudgeScoresRecord = {\n      perJudge,\n      perDimMean,\n      composite,\n    }\n    return {\n      runId: `${runId}::${candidateId}::${cell.cellId}`,\n      experimentId: runId,\n      candidateId,\n      // Pair on (scenarioId, rep) — analyzeRuns pairs on (experimentId, seed).\n      // Synthesize a stable seed for that pairing.\n      seed:\n        cell.rep * 1_000_000 +\n        hashString(cell.scenarioId)\n          .slice(0, 6)\n          .split('')\n          .reduce((a, c) => (a * 31 + c.charCodeAt(0)) >>> 0, 0),\n      model: 'campaign-cell',\n      promptHash,\n      configHash,\n      commitSha: 'cell',\n      wallMs: cell.durationMs,\n      costUsd: cell.costUsd,\n      tokenUsage: { input: 0, output: 0 },\n      outcome: {\n        holdoutScore: composite,\n        raw: {},\n        judgeScores,\n      },\n      splitTag: 'holdout',\n      ...(cell.error ? { failureMode: cell.error } : {}),\n    } satisfies RunRecord\n  })\n}\n","/**\n * # `@tangle-network/agent-eval/contract` — eval-run diff primitive.\n *\n * The substrate side of the v-N-versus-v-N+1 dashboard view. Given two\n * `EvalRunEvent`s (or two `EvalRunGenerationSnapshot`s from one run), this\n * returns a normalised diff: per-cell composite + per-judge/per-dimension\n * deltas, surface-hash change, aggregate cost + duration shifts.\n *\n * Consumed by:\n *   - The hosted-tier dashboard (intelligence-web) — renders v3 vs v4\n *     comparisons of cells × judges × dimensions.\n *   - CI reporting — emits a \"shipped: composite +0.07, cost +$1.20\" line\n *     in PR review for autonomous-improvement runs.\n *   - Any downstream consumer that needs \"what actually changed\" without\n *     reimplementing the matching + arithmetic.\n *\n * Cells are matched on the natural composite key `(scenarioId, rep)`.\n * Unmatched cells surface as `removed` / `added` so callers can tell\n * \"this cell got worse\" from \"this cell wasn't run.\"\n */\n\nimport type { GateDecision } from '../campaign/types'\nimport type { EvalRunCellScore, EvalRunEvent, EvalRunGenerationSnapshot } from '../hosted/types'\n\n// ── Types ────────────────────────────────────────────────────────────\n\n/** Per-dimension delta. `before` / `after` are null when the judge did not\n *  emit a value for that side. `delta` is `after - before`; null when\n *  either side is null. */\nexport interface EvalDimensionDelta {\n  before: number | null\n  after: number | null\n  delta: number | null\n}\n\n/** Per-cell delta, keyed on `(scenarioId, rep)`. */\nexport interface EvalCellScoreDelta {\n  scenarioId: string\n  rep: number\n  compositeBefore: number\n  compositeAfter: number\n  compositeDelta: number\n  /** Per-judge → per-dimension deltas. Outer key = judge name from\n   *  `EvalRunCellScore.dimensions`; inner key = dimension name. */\n  dimensions: Record<string, Record<string, EvalDimensionDelta>>\n}\n\n/** Diff between two generation snapshots — the unit the dashboard renders\n *  for a single \"v3 vs v4\" comparison. */\nexport interface EvalGenerationDiff {\n  beforeIndex: number\n  afterIndex: number\n  beforeSurfaceHash: string\n  afterSurfaceHash: string\n  surfaceChanged: boolean\n  /** Cells present in both snapshots, matched on `(scenarioId, rep)`. */\n  matched: EvalCellScoreDelta[]\n  /** Cells present in `before` but missing from `after`. */\n  removed: EvalRunCellScore[]\n  /** Cells present in `after` but missing from `before`. */\n  added: EvalRunCellScore[]\n  /** Aggregate composite mean across all cells in the snapshot. */\n  compositeBefore: number\n  compositeAfter: number\n  compositeDelta: number\n  costUsdBefore: number\n  costUsdAfter: number\n  costUsdDelta: number\n  durationMsBefore: number\n  durationMsAfter: number\n  durationMsDelta: number\n}\n\n/** Diff between two full eval-runs. Includes both baseline-vs-baseline and\n *  winner-vs-winner generation diffs when both sides expose them, plus\n *  run-level metadata. */\nexport interface EvalRunDiff {\n  beforeRunId: string\n  afterRunId: string\n  beforeTimestamp: string\n  afterTimestamp: string\n  beforeGateDecision: GateDecision | null\n  afterGateDecision: GateDecision | null\n  beforeHoldoutLift: number | null\n  afterHoldoutLift: number | null\n  holdoutLiftDelta: number | null\n  beforeTotalCostUsd: number\n  afterTotalCostUsd: number\n  totalCostUsdDelta: number\n  beforeTotalDurationMs: number\n  afterTotalDurationMs: number\n  totalDurationMsDelta: number\n  /** Baseline-vs-baseline diff. Null when either run has no baseline. */\n  baselineDiff: EvalGenerationDiff | null\n  /** Highest-index-generation comparison. Null when either run has no\n   *  recorded generations (e.g. baseline-only or errored before any\n   *  generation completed). */\n  winnersDiff: EvalGenerationDiff | null\n}\n\n// ── Implementation ───────────────────────────────────────────────────\n\nfunction keyForCell(cell: EvalRunCellScore): string {\n  // JSON-tuple key — `scenarioId` may legitimately contain `::` or any other\n  // delimiter, so we use JSON.stringify on a 2-tuple to get an unambiguous,\n  // collision-free composite key.\n  return JSON.stringify([cell.scenarioId, cell.rep])\n}\n\n/** Build the per-dimension delta map for a matched cell. Each judge name +\n *  dimension name encountered on EITHER side appears in the result. */\nfunction diffDimensions(\n  before: EvalRunCellScore['dimensions'],\n  after: EvalRunCellScore['dimensions'],\n): EvalCellScoreDelta['dimensions'] {\n  const out: EvalCellScoreDelta['dimensions'] = {}\n  const judges = new Set<string>([...Object.keys(before), ...Object.keys(after)])\n  for (const judge of judges) {\n    const beforeDims = before[judge] ?? {}\n    const afterDims = after[judge] ?? {}\n    const dims = new Set<string>([...Object.keys(beforeDims), ...Object.keys(afterDims)])\n    const judgeOut: Record<string, EvalDimensionDelta> = {}\n    for (const dim of dims) {\n      // Coerce non-finite values (NaN, ±Infinity) to null so the diff never\n      // surfaces NaN/Infinity to the dashboard. A NaN score is a substrate\n      // bug from upstream; the diff treats it as \"no value\" rather than\n      // propagating the corruption.\n      const rawBefore = beforeDims[dim]\n      const rawAfter = afterDims[dim]\n      const b = typeof rawBefore === 'number' && Number.isFinite(rawBefore) ? rawBefore : null\n      const a = typeof rawAfter === 'number' && Number.isFinite(rawAfter) ? rawAfter : null\n      judgeOut[dim] = {\n        before: b,\n        after: a,\n        delta: b !== null && a !== null ? a - b : null,\n      }\n    }\n    out[judge] = judgeOut\n  }\n  return out\n}\n\n/**\n * Diff two generation snapshots. Cells are matched on `(scenarioId, rep)`;\n * unmatched cells surface in `added` / `removed`. Aggregate fields are\n * recomputed from the snapshot's stored fields, not re-derived from cells —\n * this keeps the diff consistent with whatever aggregation the substrate\n * actually reported.\n */\nexport function diffGenerations(\n  before: EvalRunGenerationSnapshot,\n  after: EvalRunGenerationSnapshot,\n): EvalGenerationDiff {\n  const beforeMap = new Map(before.cells.map((c) => [keyForCell(c), c]))\n  const afterMap = new Map(after.cells.map((c) => [keyForCell(c), c]))\n\n  const matched: EvalCellScoreDelta[] = []\n  const removed: EvalRunCellScore[] = []\n  const added: EvalRunCellScore[] = []\n\n  for (const [key, beforeCell] of beforeMap) {\n    const afterCell = afterMap.get(key)\n    if (!afterCell) {\n      removed.push(beforeCell)\n      continue\n    }\n    matched.push({\n      scenarioId: beforeCell.scenarioId,\n      rep: beforeCell.rep,\n      compositeBefore: beforeCell.compositeMean,\n      compositeAfter: afterCell.compositeMean,\n      compositeDelta: afterCell.compositeMean - beforeCell.compositeMean,\n      dimensions: diffDimensions(beforeCell.dimensions, afterCell.dimensions),\n    })\n  }\n  for (const [key, afterCell] of afterMap) {\n    if (!beforeMap.has(key)) added.push(afterCell)\n  }\n\n  return {\n    beforeIndex: before.index,\n    afterIndex: after.index,\n    beforeSurfaceHash: before.surfaceHash,\n    afterSurfaceHash: after.surfaceHash,\n    surfaceChanged: before.surfaceHash !== after.surfaceHash,\n    matched,\n    removed,\n    added,\n    compositeBefore: before.compositeMean,\n    compositeAfter: after.compositeMean,\n    compositeDelta: after.compositeMean - before.compositeMean,\n    costUsdBefore: before.costUsd,\n    costUsdAfter: after.costUsd,\n    costUsdDelta: after.costUsd - before.costUsd,\n    durationMsBefore: before.durationMs,\n    durationMsAfter: after.durationMs,\n    durationMsDelta: after.durationMs - before.durationMs,\n  }\n}\n\n/** Highest-index generation, or null if the run recorded none. */\nfunction winnerOf(run: EvalRunEvent): EvalRunGenerationSnapshot | null {\n  if (run.generations.length === 0) return null\n  let winner = run.generations[0] as EvalRunGenerationSnapshot\n  for (const gen of run.generations) {\n    if (gen.index > winner.index) winner = gen\n  }\n  return winner\n}\n\n/**\n * Diff two full eval-runs. Produces baseline-vs-baseline and\n * winner-vs-winner generation diffs when both sides expose them, plus\n * run-level cost / lift / gate-decision deltas.\n */\nexport function diffRuns(before: EvalRunEvent, after: EvalRunEvent): EvalRunDiff {\n  const beforeWinner = winnerOf(before)\n  const afterWinner = winnerOf(after)\n  const baselineDiff =\n    before.baseline && after.baseline ? diffGenerations(before.baseline, after.baseline) : null\n  const winnersDiff =\n    beforeWinner && afterWinner ? diffGenerations(beforeWinner, afterWinner) : null\n\n  const beforeLift = before.holdoutLift ?? null\n  const afterLift = after.holdoutLift ?? null\n\n  return {\n    beforeRunId: before.runId,\n    afterRunId: after.runId,\n    beforeTimestamp: before.timestamp,\n    afterTimestamp: after.timestamp,\n    beforeGateDecision: before.gateDecision ?? null,\n    afterGateDecision: after.gateDecision ?? null,\n    beforeHoldoutLift: beforeLift,\n    afterHoldoutLift: afterLift,\n    holdoutLiftDelta: beforeLift !== null && afterLift !== null ? afterLift - beforeLift : null,\n    beforeTotalCostUsd: before.totalCostUsd,\n    afterTotalCostUsd: after.totalCostUsd,\n    totalCostUsdDelta: after.totalCostUsd - before.totalCostUsd,\n    beforeTotalDurationMs: before.totalDurationMs,\n    afterTotalDurationMs: after.totalDurationMs,\n    totalDurationMsDelta: after.totalDurationMs - before.totalDurationMs,\n    baselineDiff,\n    winnersDiff,\n  }\n}\n\n/**\n * Within-run baseline → winning-generation diff. The natural \"what did the\n * improvement loop produce\" view for a single run. Returns null when the\n * run never reached a generation past baseline (errored early, or the gate\n * shipped the baseline as-is).\n */\nexport function diffRunBaselineToWinner(run: EvalRunEvent): EvalGenerationDiff | null {\n  if (!run.baseline) return null\n  const winner = winnerOf(run)\n  if (!winner || winner.index === run.baseline.index) return null\n  return diffGenerations(run.baseline, winner)\n}\n","/**\n * `fromAgentTrace` — provenance correlation from Cursor's Agent Trace spec\n * (https://github.com/cursor/agent-trace, RFC v0.1.0).\n *\n * Agent Trace is NOT a run/quality trace — it carries no outcome, score, or\n * cost. It records *code authorship*: for a VCS revision, which AI model /\n * conversation authored which file ranges. It explicitly disclaims quality\n * assessment — which is exactly what `analyzeRuns` adds.\n *\n * The two layers join on a key the substrate already has: a `RunRecord`\n * carries `commitSha`, and an Agent Trace record is keyed by\n * `vcs.revision`. So this adapter does not produce `RunRecord`s — it builds a\n * provenance index by commit and partitions existing runs by their authoring\n * model. Feed each cohort to `analyzeRuns` (or pass one as `baselineRuns`) to\n * answer the question no run-only trace can: *which authoring agent's code\n * fails / regresses / costs more.*\n *\n * Granularity is commit-level (the SHA join). Per-file/per-line correlation\n * would require runs to record which files they exercised — out of scope.\n */\n\nimport type { RunRecord } from '../../run-record'\n\n// ── Agent Trace record schema (the subset we read) ──────────────────────────\n\nexport type AgentTraceContributorType = 'human' | 'ai' | 'mixed' | 'unknown'\n\nexport interface AgentTraceContributor {\n  type: AgentTraceContributorType\n  /** models.dev id, e.g. `anthropic/claude-opus-4-5-20251101`. */\n  model_id?: string\n}\n\nexport interface AgentTraceRange {\n  start_line: number\n  end_line: number\n  content_hash?: string\n  /** Per-range contributor override (agent handoffs). Wins over the\n   *  conversation-level contributor for these lines. */\n  contributor?: AgentTraceContributor\n}\n\nexport interface AgentTraceConversation {\n  url?: string\n  contributor?: AgentTraceContributor\n  ranges: AgentTraceRange[]\n}\n\nexport interface AgentTraceFile {\n  path: string\n  conversations: AgentTraceConversation[]\n}\n\nexport interface AgentTraceRecord {\n  version: string\n  id: string\n  timestamp: string\n  vcs?: { type: string; revision: string }\n  tool?: { name?: string; version?: string }\n  files: AgentTraceFile[]\n}\n\n// ── Provenance index ─────────────────────────────────────────────────────────\n\n/** Authorship provenance for one VCS revision, aggregated across the record's\n *  files/conversations/ranges. */\nexport interface AuthoringProvenance {\n  commitSha: string\n  /** Unique AI model ids that authored code in this commit (type ai|mixed). */\n  aiModels: string[]\n  /** Tools that produced the records (e.g. `cursor`). */\n  tools: string[]\n  conversationCount: number\n  fileCount: number\n  /** Total attributed lines (sum of range spans). */\n  lineCount: number\n  /** True if any range was authored (in whole or part) by a human. */\n  humanInvolved: boolean\n}\n\nexport type AgentTraceIndex = Map<string, AuthoringProvenance>\n\nfunction rangeLines(r: AgentTraceRange): number {\n  return Math.max(0, r.end_line - r.start_line + 1)\n}\n\n/**\n * Build a commit → provenance index from Agent Trace records. Multiple records\n * for the same revision are merged. Records without `vcs.revision` are skipped\n * (the SHA is the join key — without it there is nothing to correlate against).\n */\nexport function parseAgentTrace(records: AgentTraceRecord[]): AgentTraceIndex {\n  interface Acc {\n    models: Set<string>\n    tools: Set<string>\n    files: Set<string>\n    conversationCount: number\n    lineCount: number\n    humanInvolved: boolean\n  }\n  const acc = new Map<string, Acc>()\n\n  for (const record of records) {\n    const sha = record.vcs?.revision\n    if (!sha) continue // the SHA is the join key — nothing to correlate without it\n\n    let a = acc.get(sha)\n    if (!a) {\n      a = {\n        models: new Set(),\n        tools: new Set(),\n        files: new Set(),\n        conversationCount: 0,\n        lineCount: 0,\n        humanInvolved: false,\n      }\n      acc.set(sha, a)\n    }\n\n    if (record.tool?.name) a.tools.add(record.tool.name)\n\n    for (const file of record.files ?? []) {\n      a.files.add(file.path)\n      for (const conv of file.conversations ?? []) {\n        a.conversationCount += 1\n        for (const range of conv.ranges ?? []) {\n          // Per-range contributor wins, else the conversation contributor.\n          const contributor = range.contributor ?? conv.contributor\n          a.lineCount += rangeLines(range)\n          if (!contributor) continue\n          if (contributor.type === 'human' || contributor.type === 'mixed') {\n            a.humanInvolved = true\n          }\n          if ((contributor.type === 'ai' || contributor.type === 'mixed') && contributor.model_id) {\n            a.models.add(contributor.model_id)\n          }\n        }\n      }\n    }\n  }\n\n  const index: AgentTraceIndex = new Map()\n  for (const [sha, a] of acc) {\n    index.set(sha, {\n      commitSha: sha,\n      aiModels: [...a.models].sort(),\n      tools: [...a.tools].sort(),\n      conversationCount: a.conversationCount,\n      fileCount: a.files.size,\n      lineCount: a.lineCount,\n      humanInvolved: a.humanInvolved,\n    })\n  }\n  return index\n}\n\n// ── Run ↔ provenance join ──────────────────────────────────────────────────\n\nexport interface PartitionByAuthoringModelResult {\n  /** Runs grouped by each AI model that authored code in the run's commit. A\n   *  run whose commit had multiple authoring models appears under EACH — the\n   *  cohorts overlap by construction at commit granularity. */\n  byModel: Map<string, RunRecord[]>\n  /** Runs whose `commitSha` had no Agent Trace provenance (no record, or no\n   *  AI authorship). Kept separate — never silently folded into a cohort. */\n  unattributed: RunRecord[]\n}\n\n/**\n * Partition runs by the AI model(s) that authored the code at each run's\n * `commitSha`. Feed `byModel.get(modelId)` to `analyzeRuns`, or compare two\n * model cohorts via `analyzeRuns({ runs: a, baselineRuns: b })` for a lift CI\n * on \"model A's code vs model B's code\".\n */\nexport function partitionRunsByAuthoringModel(\n  runs: RunRecord[],\n  index: AgentTraceIndex,\n): PartitionByAuthoringModelResult {\n  const byModel = new Map<string, RunRecord[]>()\n  const unattributed: RunRecord[] = []\n\n  for (const run of runs) {\n    const provenance = index.get(run.commitSha)\n    if (!provenance || provenance.aiModels.length === 0) {\n      unattributed.push(run)\n      continue\n    }\n    for (const model of provenance.aiModels) {\n      const cohort = byModel.get(model) ?? []\n      cohort.push(run)\n      byModel.set(model, cohort)\n    }\n  }\n\n  return { byModel, unattributed }\n}\n","/**\n * # `intake/feedback-table` — multi-rater approve/reject corpus → `RunRecord[]`.\n *\n * The generic shape behind Obsidian's `#approved` / `#rejected` tags, a\n * Google Sheet, a Postgres `feedback` table, or any CSV with ratings.\n *\n * Caller supplies one row per (run, rater) tuple plus per-run metadata; the\n * adapter rolls them up into the substrate-canonical `RunRecord` shape so\n * `analyzeRuns({ runs, raterScores })` can produce inter-rater agreement,\n * disagreement triage, and downstream recommendations.\n *\n * Per-run `RunRecord.outcome.searchScore` is the rater-mean rating\n * (normalised to 0..1 when scale is supplied); `outcome.raw` carries the\n * per-rater scores keyed by rater id for downstream attribution.\n */\n\nimport type { JudgeScoresRecord, RunOutcome, RunRecord, RunSplitTag } from '../../run-record'\n\nexport interface FeedbackTableRow {\n  /** Stable id for this run — the unit a rater scored. Drives pairing\n   *  across analysis primitives. */\n  runId: string\n  /** Identifier of the rater that produced this rating. */\n  rater: string\n  /** The rating itself. Accepts boolean (approve/reject), 0..1 scalar,\n   *  or any numeric scale — see `scale`. */\n  rating: number | boolean\n  /** Optional metadata carried through to `RunRecord.outcome.raw` and the\n   *  custom-shape metadata bag. */\n  metadata?: Record<string, unknown>\n}\n\nexport interface FeedbackTableMeta {\n  runId: string\n  /** When omitted, defaults to `'feedback-corpus'`. Used to group related\n   *  runs in `analyzeRuns()` lift analysis. */\n  experimentId?: string\n  /** When omitted, defaults to `runId` — each run is its own candidate. */\n  candidateId?: string\n  /** Cost in USD, when available. Set to 0 when unknown — the consumer's\n   *  cost analysis sections will collapse gracefully. */\n  costUsd?: number\n  /** Wall-clock ms, when available. Defaults to 0. */\n  wallMs?: number\n  /** Model identifier including snapshot. Default `unknown@unknown`. */\n  model?: string\n  /** Optional sha256 of the prompt; default `'sha256:unknown'`. */\n  promptHash?: string\n  /** Default `'sha256:unknown'`. */\n  configHash?: string\n  /** Default `'unknown'`. */\n  commitSha?: string\n  /** Default `'holdout'` — feedback corpora are by nature the holdout\n   *  signal a closed-loop improvement aims at. */\n  splitTag?: RunSplitTag\n  /** Free-form metadata available to consumers via the cast-out path on\n   *  the resulting RunRecord. */\n  extras?: Record<string, unknown>\n}\n\nexport interface FromFeedbackTableOptions {\n  /** Per-(run, rater) ratings. */\n  ratings: FeedbackTableRow[]\n  /** Per-run metadata. When a runId appears in `ratings` but not here, the\n   *  adapter synthesises minimal metadata with defaults documented above. */\n  meta?: FeedbackTableMeta[]\n  /** Rating scale. Provide `{ min, max }` for non-0..1 numeric scales.\n   *  Booleans are normalised: true → 1, false → 0. Default: assumes\n   *  ratings are already 0..1. */\n  scale?: { min: number; max: number }\n  /** When true, the rater scores are emitted into `raterScores` (a sibling\n   *  array `analyzeRuns()` accepts) instead of being averaged into the\n   *  run's `outcome.searchScore`. Default `true` — preserves rater-level\n   *  signal for inter-rater analysis. */\n  emitRaterScores?: boolean\n}\n\nexport interface FromFeedbackTableResult {\n  runs: RunRecord[]\n  /** Rater-level scores ready to pass into `analyzeRuns({ raterScores })`\n   *  for inter-rater agreement + disagreement triage. */\n  raterScores: Array<{ runId: string; rater: string; score: number }>\n}\n\nexport function fromFeedbackTable(opts: FromFeedbackTableOptions): FromFeedbackTableResult {\n  const { ratings, meta = [], scale, emitRaterScores = true } = opts\n  const metaByRun = new Map(meta.map((m) => [m.runId, m]))\n\n  // Normalise per-rating to a 0..1 score.\n  const normalise = (rating: number | boolean): number => {\n    if (typeof rating === 'boolean') return rating ? 1 : 0\n    if (!Number.isFinite(rating)) return Number.NaN\n    if (!scale) return rating\n    const { min, max } = scale\n    if (max === min) return rating\n    return (rating - min) / (max - min)\n  }\n\n  // Group ratings by runId.\n  const byRun = new Map<string, FeedbackTableRow[]>()\n  for (const row of ratings) {\n    const list = byRun.get(row.runId) ?? []\n    list.push(row)\n    byRun.set(row.runId, list)\n  }\n\n  const runs: RunRecord[] = []\n  const raterScores: FromFeedbackTableResult['raterScores'] = []\n\n  for (const [runId, rowsForRun] of byRun) {\n    const normalised = rowsForRun\n      .map((r) => ({ rater: r.rater, score: normalise(r.rating) }))\n      .filter((r) => Number.isFinite(r.score))\n    if (normalised.length === 0) continue\n\n    const meanScore = normalised.reduce((s, r) => s + r.score, 0) / normalised.length\n\n    const runMeta = metaByRun.get(runId) ?? ({ runId } as FeedbackTableMeta)\n\n    const judgeScores: JudgeScoresRecord = {\n      perJudge: Object.fromEntries(normalised.map((r) => [r.rater, { rating: r.score }])),\n      perDimMean: { rating: meanScore },\n      composite: meanScore,\n    }\n\n    const outcome: RunOutcome = {\n      // Feedback corpora ARE the holdout signal — score lands on\n      // `holdoutScore` so downstream substrate primitives (`paretoChart`,\n      // promotion gates) read it correctly by default.\n      holdoutScore: meanScore,\n      raw: Object.fromEntries(normalised.map((r) => [`rater:${r.rater}`, r.score])),\n      judgeScores,\n    }\n\n    runs.push({\n      runId,\n      experimentId: runMeta.experimentId ?? 'feedback-corpus',\n      candidateId: runMeta.candidateId ?? runId,\n      seed: 0,\n      model: runMeta.model ?? 'unknown@unknown',\n      promptHash: runMeta.promptHash ?? 'sha256:unknown',\n      configHash: runMeta.configHash ?? 'sha256:unknown',\n      commitSha: runMeta.commitSha ?? 'unknown',\n      wallMs: runMeta.wallMs ?? 0,\n      costUsd: runMeta.costUsd ?? 0,\n      tokenUsage: { input: 0, output: 0 },\n      outcome,\n      splitTag: runMeta.splitTag ?? 'holdout',\n    } as RunRecord)\n\n    if (emitRaterScores) {\n      for (const r of normalised) raterScores.push({ runId, rater: r.rater, score: r.score })\n    }\n  }\n\n  return { runs, raterScores }\n}\n","/**\n * # `intake/otel-spans` — OTel `TraceSpanEvent[]` → `RunRecord[]`.\n *\n * Turns an existing observability stream into the substrate-canonical\n * `RunRecord` shape so consumers with logs but no eval discipline can\n * call `analyzeRuns()` against their production traffic immediately.\n *\n * Pivot rule: spans are grouped by `tangle.runId` (the same attribute the\n * hosted-tier wire format uses) or, when absent, by `traceId`. One group\n * becomes one `RunRecord`. The root span (no `parentSpanId`) supplies:\n *\n *   - `runId` (the group key)\n *   - `wallMs` from `endTimeUnixNano - startTimeUnixNano`\n *   - `model` from `gen_ai.request.model` / `llm.model` / `tangle.model`\n *   - cost from `cost.usd` / `gen_ai.usage.cost_usd` / `tangle.cost.usd`\n *   - token usage from `gen_ai.usage.{input,output}_tokens`\n *   - `outcome.searchScore` from `tangle.score` / `eval.score` when\n *     present; `outcome.raw` collects every numeric attribute.\n *\n * Spans that ERRORed (`status.code === 'ERROR'`) populate `failureMode`\n * with their `name` so `analyzeRuns()`'s failure clustering sees them.\n */\n\nimport type { TraceSpanEvent } from '../../hosted/types'\nimport type {\n  JudgeScoresRecord,\n  RunOutcome,\n  RunRecord,\n  RunSplitTag,\n  RunTokenUsage,\n} from '../../run-record'\n\nconst SCORE_KEYS = ['tangle.score', 'eval.score', 'score']\nconst MODEL_KEYS = ['tangle.model', 'gen_ai.request.model', 'llm.model', 'model']\nconst COST_KEYS = ['tangle.cost.usd', 'gen_ai.usage.cost_usd', 'cost.usd', 'cost']\nconst INPUT_TOKEN_KEYS = ['gen_ai.usage.input_tokens', 'tangle.tokens.in', 'tokens.in']\nconst OUTPUT_TOKEN_KEYS = ['gen_ai.usage.output_tokens', 'tangle.tokens.out', 'tokens.out']\nconst PROMPT_HASH_KEYS = ['tangle.prompt_hash', 'prompt.hash']\nconst CONFIG_HASH_KEYS = ['tangle.config_hash', 'config.hash']\n\nexport interface FromOtelSpansOptions {\n  spans: TraceSpanEvent[]\n  /** Default split tag for synthesized records. Defaults to `'holdout'`. */\n  defaultSplit?: RunSplitTag\n  /** Default `experimentId` when not present on any span. */\n  experimentId?: string\n}\n\nexport function fromOtelSpans(opts: FromOtelSpansOptions): RunRecord[] {\n  const { spans, defaultSplit = 'holdout', experimentId = 'otel-corpus' } = opts\n  const grouped = groupSpans(spans)\n\n  const runs: RunRecord[] = []\n  for (const [groupKey, groupSpans] of grouped) {\n    const root = findRoot(groupSpans)\n    if (!root) continue\n\n    const wallMs = Math.max(0, (root.endTimeUnixNano - root.startTimeUnixNano) / 1_000_000)\n    const model = readAttrString(groupSpans, MODEL_KEYS) ?? 'unknown@unknown'\n    const costUsd = readAttrNumber(groupSpans, COST_KEYS) ?? 0\n    const inputTokens = readAttrNumber(groupSpans, INPUT_TOKEN_KEYS) ?? 0\n    const outputTokens = readAttrNumber(groupSpans, OUTPUT_TOKEN_KEYS) ?? 0\n    const promptHash = readAttrString(groupSpans, PROMPT_HASH_KEYS) ?? 'sha256:unknown'\n    const configHash = readAttrString(groupSpans, CONFIG_HASH_KEYS) ?? 'sha256:unknown'\n    const score = readAttrNumber(groupSpans, SCORE_KEYS)\n\n    const rawNumeric = collectNumericAttrs(groupSpans)\n    const tokenUsage: RunTokenUsage = {\n      input: inputTokens,\n      output: outputTokens,\n    }\n\n    const judgeScores: JudgeScoresRecord | undefined =\n      score !== undefined\n        ? {\n            perJudge: { 'otel-derived': { score } },\n            perDimMean: { score },\n            composite: score,\n          }\n        : undefined\n\n    const errorSpan = groupSpans.find((s) => s.status?.code === 'ERROR')\n    const outcome: RunOutcome = {\n      ...(opts.defaultSplit === 'search' ? { searchScore: score } : { holdoutScore: score }),\n      raw: rawNumeric,\n      ...(judgeScores ? { judgeScores } : {}),\n    }\n\n    runs.push({\n      runId: groupKey,\n      experimentId,\n      candidateId: (root.attributes['tangle.candidateId'] as string | undefined) ?? 'otel-default',\n      seed: 0,\n      model,\n      promptHash,\n      configHash,\n      commitSha: (root.attributes['tangle.commit_sha'] as string | undefined) ?? 'unknown',\n      wallMs,\n      costUsd,\n      tokenUsage,\n      outcome,\n      splitTag: defaultSplit,\n      ...(errorSpan ? { failureMode: errorSpan.name } : {}),\n    } as RunRecord)\n  }\n  return runs\n}\n\n// ── Internal helpers ────────────────────────────────────────────────\n\nfunction groupSpans(spans: TraceSpanEvent[]): Map<string, TraceSpanEvent[]> {\n  const m = new Map<string, TraceSpanEvent[]>()\n  for (const span of spans) {\n    const key = (span['tangle.runId'] as string | undefined) ?? span.traceId\n    const list = m.get(key) ?? []\n    list.push(span)\n    m.set(key, list)\n  }\n  return m\n}\n\nfunction findRoot(group: TraceSpanEvent[]): TraceSpanEvent | undefined {\n  return group.find((s) => !s.parentSpanId) ?? group[0]\n}\n\nfunction readAttrString(spans: TraceSpanEvent[], keys: string[]): string | undefined {\n  for (const span of spans) {\n    for (const key of keys) {\n      const v = span.attributes[key]\n      if (typeof v === 'string' && v.length > 0) return v\n    }\n  }\n  return undefined\n}\n\nfunction readAttrNumber(spans: TraceSpanEvent[], keys: string[]): number | undefined {\n  for (const span of spans) {\n    for (const key of keys) {\n      const v = span.attributes[key]\n      if (typeof v === 'number' && Number.isFinite(v)) return v\n      if (typeof v === 'string') {\n        const parsed = Number(v)\n        if (Number.isFinite(parsed)) return parsed\n      }\n    }\n  }\n  return undefined\n}\n\nfunction collectNumericAttrs(spans: TraceSpanEvent[]): Record<string, number> {\n  const raw: Record<string, number> = {}\n  for (const span of spans) {\n    for (const [k, v] of Object.entries(span.attributes)) {\n      if (typeof v === 'number' && Number.isFinite(v)) raw[k] = v\n    }\n  }\n  return raw\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwBA,SAAS,kBAAkB;AAqR3B,SAAS,kBACP,WACA,UAC8C;AAE9C,WAAS,KAAK,GAAmB;AAC/B,QAAI,IAAI,eAAe;AACvB,aAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,WAAK,EAAE,WAAW,CAAC;AACnB,UAAI,KAAK,KAAK,GAAG,QAAQ,MAAM;AAAA,IACjC;AACA,WAAO;AAAA,EACT;AACA,QAAM,SAAS,CAAC,GAAG,SAAS,EAAE,KAAK,CAAC,GAAG,MAAM,KAAK,EAAE,EAAE,IAAI,KAAK,EAAE,EAAE,CAAC;AACpE,QAAM,WAAW,KAAK,IAAI,GAAG,KAAK,IAAI,OAAO,SAAS,GAAG,KAAK,MAAM,OAAO,SAAS,QAAQ,CAAC,CAAC;AAC9F,SAAO;AAAA,IACL,SAAS,OAAO,MAAM,GAAG,QAAQ;AAAA,IACjC,OAAO,OAAO,MAAM,QAAQ;AAAA,EAC9B;AACF;AAEA,SAAS,cAAc,YAGrB;AACA,QAAM,cAAsC,CAAC;AAC7C,QAAM,SAAmB,CAAC;AAC1B,aAAW,CAAC,IAAI,GAAG,KAAK,OAAO,QAAQ,UAAU,GAAG;AAClD,gBAAY,EAAE,IAAI,IAAI;AACtB,WAAO,KAAK,IAAI,aAAa;AAAA,EAC/B;AACA,SAAO;AAAA,IACL,eAAe,OAAO,WAAW,IAAI,IAAI,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,OAAO;AAAA,IACpF;AAAA,EACF;AACF;AAEA,IAAM,8BAA8B;AAAA,EAClC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AA2BA,eAAsB,YACpB,MACkD;AAClD,QAAM,YAAY,KAAK,IAAI;AAE3B,QAAM,SAAS,KAAK,UAAU,CAAC;AAC/B,QAAM,cAAc,OAAO,eAAe;AAC1C,QAAM,iBAAiB,OAAO,kBAAkB;AAChD,QAAM,iBAAiB,OAAO,kBAAkB;AAChD,QAAM,kBAAkB,OAAO,mBAAmB;AAClD,QAAM,cAAc,OAAO;AAC3B,QAAM,cAAc,KAAK,eAAe;AAExC,QAAM,kBAAkB,OAAO;AAC/B,QAAM,EAAE,OAAO,QAAQ,IAAI,kBACvB;AAAA,IACE,OAAO,KAAK,UAAU,OAAO,CAAC,MAAM,CAAC,gBAAgB,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,CAAC;AAAA,IAC/E,SAAS;AAAA,EACX,IACA,kBAAkB,KAAK,WAAW,eAAe;AAErD,MAAI,MAAM,WAAW,GAAG;AACtB,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACA,MAAI,QAAQ,WAAW,GAAG;AACxB,UAAM,IAAI,MAAM,2DAA2D;AAAA,EAC7E;AAEA,QAAM,SACJ,KAAK,UACL,WAAW;AAAA,IACT,KAAK;AAAA,MACH,SAAS,KAAK,KAAK,WAAW;AAAA,MAC9B,QAAQ,KAAK,KAAK,UAAU,QAAQ,IAAI,kBAAkB;AAAA,IAC5D;AAAA,IACA,OAAO,KAAK,KAAK,SAAS;AAAA,IAC1B,QACE,KAAK,gBACL;AAAA,IACF,oBAAoB,KAAK,sBAAsB;AAAA,EACjD,CAAC;AAEH,QAAM,OACJ,KAAK,QACL,sBAA4C;AAAA,IAC1C,kBAAkB;AAAA,IAClB,gBAAgB;AAAA,EAClB,CAAC;AAMH,QAAM,SAAS,KAAK,UAAU,qBAAqB,SAAS;AAC5D,QAAM,cAAc,OAAO,WAAW,QAAQ;AAC9C,QAAM,UAAU,KAAK,YAAY,cAAc,wBAAwB,IAAI,kBAAkB;AAE7F,MAAI,KAAK,YAAY;AACnB,SAAK,WAAW,EAAE,MAAM,oBAAoB,WAAW,KAAK,UAAU,OAAO,CAAC;AAAA,EAChF;AAEA,QAAM,SAAS,MAAM,mBAAyC;AAAA,IAC5D,WAAW;AAAA,IACX,iBAAiB,KAAK;AAAA,IACtB,qBAAqB,KAAK;AAAA,IAC1B;AAAA,IACA,QAAQ,CAAC,KAAK,KAAK;AAAA,IACnB;AAAA,IACA,gBAAgB;AAAA,IAChB,aAAa,OAAO;AAAA,IACpB,MAAM,OAAO;AAAA,IACb,kBAAkB;AAAA,IAClB;AAAA,IACA,eAAe,KAAK,iBAAiB;AAAA,IACrC,SAAS,KAAK;AAAA,IACd,QAAQ,KAAK;AAAA,IACb;AAAA,IACA;AAAA,IACA;AAAA,IACA,eAAe,KAAK;AAAA,IACpB;AAAA,IACA;AAAA,IACA,cAAc,KAAK;AAAA,IACnB,eAAe,KAAK;AAAA,IACpB,mBAAmB,KAAK;AAAA,IACxB,UAAU,KAAK;AAAA,EACjB,CAAC;AAED,QAAM,WAAW,cAAc,OAAO,kBAAkB,WAAW,UAAU;AAC7E,QAAM,cAAc,cAAc,OAAO,gBAAgB,WAAW,UAAU;AAE9E,MAAI,KAAK,YAAY;AACnB,SAAK,WAAW;AAAA,MACd,MAAM;AAAA,MACN,eAAe,SAAS;AAAA,MACxB,YAAY,KAAK,IAAI,IAAI;AAAA,IAC3B,CAAC;AACD,SAAK,WAAW;AAAA,MACd,MAAM;AAAA,MACN,UAAU,OAAO,WAAW;AAAA,MAC5B,MAAM,YAAY,gBAAgB,SAAS;AAAA,IAC7C,CAAC;AAAA,EACH;AAEA,QAAM,YACJ,OAAO,iBAAiB,WAAW,eACnC,OAAO,YAAY;AAAA,IACjB,CAAC,KAAK,QACJ,MAAM,IAAI,SAAS,OAAO,CAAC,GAAG,OAAO,IAAI,GAAG,SAAS,WAAW,cAAc,CAAC;AAAA,IACjF;AAAA,EACF;AAMF,QAAM,UAAU,MAAM,YAAY;AAAA,IAChC,MAAM;AAAA,MACJ,GAAG,kBAAkB,OAAO,iBAAiB,OAAO,YAAY,QAAQ,KAAK,eAAe;AAAA,MAC5F,GAAG,kBAAkB,OAAO,gBAAgB,OAAO,UAAU,QAAQ,OAAO,aAAa;AAAA,IAC3F;AAAA,IACA,qBAAqB;AAAA,IACrB,sBAAsB;AAAA,EACxB,CAAC;AAID,QAAM,aAAa,KAAK,IAAI,IAAI;AAChC,QAAM,gBACJ,KAAK,uBAAuB,KAC5B,kBAAkB,OAAO,gBAAgB,OAAO,UAAU,QAAQ,OAAO,aAAa;AACxF,QAAM,EAAE,QAAQ,WAAW,IAAI,MAAM,mBAAyC;AAAA,IAC5E,OAAO,GAAG,MAAM,IAAI,SAAS;AAAA,IAC7B;AAAA,IACA,WAAW,IAAI,KAAK,SAAS,EAAE,YAAY;AAAA,IAC3C,iBAAiB,KAAK;AAAA,IACtB,eAAe,OAAO;AAAA,IACtB,aAAa,OAAO;AAAA,IACpB,iBAAiB,OAAO;AAAA,IACxB,MAAM,OAAO;AAAA,IACb,aAAa,OAAO,YAAY,IAAI,CAAC,OAAO;AAAA,MAC1C,iBAAiB,EAAE,OAAO;AAAA,MAC1B,YAAY,EAAE,OAAO;AAAA,MACrB,UAAU,EAAE,OAAO;AAAA,MACnB,UAAU,EAAE,SAAS,IAAI,CAAC,OAAO,EAAE,aAAa,EAAE,aAAa,SAAS,EAAE,QAAQ,EAAE;AAAA,IACtF,EAAE;AAAA,IACF,MAAM,OAAO;AAAA,IACb,mBAAmB,OAAO;AAAA,IAC1B,iBAAiB,OAAO;AAAA,IACxB;AAAA,IACA,cAAc;AAAA,IACd,iBAAiB;AAAA,IACjB;AAAA,IACA,cAAc,KAAK,eAAe,mBAAmB,KAAK,YAAY,IAAI;AAAA,EAC5E,CAAC;AACD,MAAI,KAAK,aAAc,MAAK,aAAa,UAAU;AAEnD,QAAM,UAAmD;AAAA,IACvD;AAAA,IACA,QAAQ;AAAA,MACN,GAAG;AAAA,MACH,SAAS,OAAO;AAAA,MAChB,GAAI,OAAO,cAAc,EAAE,OAAO,OAAO,YAAY,IAAI,CAAC;AAAA,MAC1D,GAAI,OAAO,kBAAkB,EAAE,WAAW,OAAO,gBAAgB,IAAI,CAAC;AAAA,IACxE;AAAA,IACA,MAAM,YAAY,gBAAgB,SAAS;AAAA,IAC3C,MAAM,OAAO;AAAA,IACb;AAAA,IACA,cAAc,OAAO,WAAW;AAAA,IAChC,qBAAqB,OAAO,YAAY;AAAA,IACxC;AAAA,IACA,cAAc;AAAA,IACd;AAAA,IACA,KAAK;AAAA,EACP;AAKA,MAAI,KAAK,cAAc;AACrB,QAAI;AACF,YAAM,oBAAoB,KAAK,cAAc,MAAM,SAAS,QAAQ,MAAM;AAAA,IAC5E,SAAS,KAAK;AACZ,YAAM,MAAM,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAE3D,cAAQ,KAAK,mDAAmD,GAAG,EAAE;AAAA,IACvE;AAAA,EACF;AAEA,SAAO;AACT;AAEA,eAAe,oBACb,QACA,MACA,SACA,KACA,QACe;AACf,QAAM,SAAS,mBAAmB,MAAM;AAExC,WAAS,qBACP,OACA,SACA,UACA,YAC2B;AAC3B,UAAM,QAA4B,SAAS,MAAM,IAAI,CAAC,SAAS;AAC7D,YAAM,cAAc,OAAO,OAAO,KAAK,WAAW;AAClD,YAAM,YACJ,YAAY,WAAW,IACnB,IACA,YAAY,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,WAAW,CAAC,IAAI,YAAY;AACrE,aAAO;AAAA,QACL,YAAY,KAAK;AAAA,QACjB,KAAK,KAAK;AAAA,QACV,eAAe;AAAA,QACf,YAAY,OAAO;AAAA,UACjB,OAAO,QAAQ,KAAK,WAAW,EAAE,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,MAAM,UAAU,CAAC;AAAA,QAClF;AAAA,QACA,cAAc,KAAK,SAAS;AAAA,MAC9B;AAAA,IACF,CAAC;AACD,UAAM,gBACJ,MAAM,WAAW,IAAI,IAAI,MAAM,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,eAAe,CAAC,IAAI,MAAM;AAClF,WAAO;AAAA,MACL;AAAA,MACA,aACE,OAAO,YAAY,WACf,WAAW,OAAO,IAClB,WAAW,KAAK,UAAU,WAAW,EAAE,CAAC;AAAA,MAC9C;AAAA,MACA;AAAA,MACA;AAAA,MACA,SAAS,SAAS,WAAW;AAAA,MAC7B;AAAA,IACF;AAAA,EACF;AAEA,QAAM,cAA2C,CAAC;AAElD,cAAY,KAAK,qBAAqB,GAAG,KAAK,iBAAiB,IAAI,kBAAkB,CAAC,CAAC;AAGvF,aAAW,OAAO,IAAI,aAAa;AACjC,UAAM,SAAS,IAAI,SAAS;AAAA,MAC1B,CAAC,MAAM,MACL,EAAE,SAAS,WAAW,gBAAgB,MACrC,SAAS,UAAa,iBAAiB,EAAE,QAAQ,IAAI,iBAAiB,KAAK,QAAQ,KAChF,IACA;AAAA,MACN,IAAI,SAAS,CAAC;AAAA,IAChB;AACA,QAAI,CAAC,OAAQ;AACb,gBAAY;AAAA,MACV,qBAAqB,IAAI,OAAO,kBAAkB,GAAG,OAAO,SAAS,OAAO,UAAU,CAAC;AAAA,IACzF;AAAA,EACF;AAEA,QAAM,QAAsB;AAAA,IAC1B,OAAO,GAAG,MAAM,IAAI,KAAK,IAAI,CAAC;AAAA,IAC9B;AAAA,IACA,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,IAClC,QAAQ;AAAA,IACR,QAAQ,KAAK,gBAAgB,CAAC;AAAA,IAC9B,UAAU,YAAY,CAAC;AAAA,IACvB;AAAA,IACA,cAAc,QAAQ;AAAA,IACtB,aAAa,QAAQ;AAAA,IACrB,cAAc,QAAQ;AAAA,IACtB,iBAAiB,QAAQ;AAAA,IACzB,eAAe,QAAQ;AAAA,EACzB;AAEA,QAAM,OAAO,cAAc,KAAK;AAClC;AAEA,SAAS,iBACP,UACQ;AACR,QAAM,OAAO,OAAO,OAAO,SAAS,WAAW,UAAU;AACzD,SAAO,KAAK,WAAW,IAAI,IAAI,KAAK,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,eAAe,CAAC,IAAI,KAAK;AACtF;AAEA,SAAS,WAAW,GAAmB;AACrC,MAAI,IAAI,eAAe;AACvB,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,SAAK,EAAE,WAAW,CAAC;AACnB,QAAI,KAAK,KAAK,GAAG,QAAQ,MAAM;AAAA,EACjC;AACA,SAAO,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AACvC;AAaA,SAAS,kBACP,OACA,aACA,OACA,SACa;AACb,QAAM,aAAa,mBAAmB,OAAO;AAC7C,QAAM,aAAa,UAAU,WAAW,QAAQ,EAAE,OAAO,WAAW,EAAE,OAAO,KAAK,CAAC;AACnF,SAAO,MAAM,IAAI,CAAC,SAAS;AACzB,UAAM,WAAmD,CAAC;AAC1D,UAAM,kBAA8D,CAAC;AACrE,QAAI,eAAe;AACnB,QAAI,iBAAiB;AACrB,eAAW,CAAC,SAAS,KAAK,KAAK,OAAO,QAAQ,KAAK,WAAW,GAAG;AAC/D,eAAS,OAAO,IAAI,EAAE,GAAG,MAAM,WAAW;AAC1C,iBAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,MAAM,UAAU,GAAG;AAC3D,YAAI,CAAC,OAAO,SAAS,KAAK,EAAG;AAC7B,cAAM,QAAQ,gBAAgB,GAAG,KAAK,EAAE,KAAK,GAAG,GAAG,EAAE;AACrD,cAAM,OAAO;AACb,cAAM,KAAK;AACX,wBAAgB,GAAG,IAAI;AAAA,MACzB;AACA,UAAI,OAAO,SAAS,MAAM,SAAS,GAAG;AACpC,wBAAgB,MAAM;AACtB,0BAAkB;AAAA,MACpB;AAAA,IACF;AACA,UAAM,aAAqC,CAAC;AAC5C,eAAW,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,KAAK,OAAO,QAAQ,eAAe,GAAG;AAC/D,iBAAW,GAAG,IAAI,MAAM,IAAI,IAAI,MAAM;AAAA,IACxC;AACA,UAAM,YAAY,mBAAmB,IAAI,IAAI,eAAe;AAC5D,UAAM,cAAiC;AAAA,MACrC;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,WAAO;AAAA,MACL,OAAO,GAAG,KAAK,KAAK,WAAW,KAAK,KAAK,MAAM;AAAA,MAC/C,cAAc;AAAA,MACd;AAAA;AAAA;AAAA,MAGA,MACE,KAAK,MAAM,MACX,WAAW,KAAK,UAAU,EACvB,MAAM,GAAG,CAAC,EACV,MAAM,EAAE,EACR,OAAO,CAAC,GAAG,MAAO,IAAI,KAAK,EAAE,WAAW,CAAC,MAAO,GAAG,CAAC;AAAA,MACzD,OAAO;AAAA,MACP;AAAA,MACA;AAAA,MACA,WAAW;AAAA,MACX,QAAQ,KAAK;AAAA,MACb,SAAS,KAAK;AAAA,MACd,YAAY,EAAE,OAAO,GAAG,QAAQ,EAAE;AAAA,MAClC,SAAS;AAAA,QACP,cAAc;AAAA,QACd,KAAK,CAAC;AAAA,QACN;AAAA,MACF;AAAA,MACA,UAAU;AAAA,MACV,GAAI,KAAK,QAAQ,EAAE,aAAa,KAAK,MAAM,IAAI,CAAC;AAAA,IAClD;AAAA,EACF,CAAC;AACH;;;AC/nBA,SAAS,WAAW,MAAgC;AAIlD,SAAO,KAAK,UAAU,CAAC,KAAK,YAAY,KAAK,GAAG,CAAC;AACnD;AAIA,SAAS,eACP,QACA,OACkC;AAClC,QAAM,MAAwC,CAAC;AAC/C,QAAM,SAAS,oBAAI,IAAY,CAAC,GAAG,OAAO,KAAK,MAAM,GAAG,GAAG,OAAO,KAAK,KAAK,CAAC,CAAC;AAC9E,aAAW,SAAS,QAAQ;AAC1B,UAAM,aAAa,OAAO,KAAK,KAAK,CAAC;AACrC,UAAM,YAAY,MAAM,KAAK,KAAK,CAAC;AACnC,UAAM,OAAO,oBAAI,IAAY,CAAC,GAAG,OAAO,KAAK,UAAU,GAAG,GAAG,OAAO,KAAK,SAAS,CAAC,CAAC;AACpF,UAAM,WAA+C,CAAC;AACtD,eAAW,OAAO,MAAM;AAKtB,YAAM,YAAY,WAAW,GAAG;AAChC,YAAM,WAAW,UAAU,GAAG;AAC9B,YAAM,IAAI,OAAO,cAAc,YAAY,OAAO,SAAS,SAAS,IAAI,YAAY;AACpF,YAAM,IAAI,OAAO,aAAa,YAAY,OAAO,SAAS,QAAQ,IAAI,WAAW;AACjF,eAAS,GAAG,IAAI;AAAA,QACd,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,OAAO,MAAM,QAAQ,MAAM,OAAO,IAAI,IAAI;AAAA,MAC5C;AAAA,IACF;AACA,QAAI,KAAK,IAAI;AAAA,EACf;AACA,SAAO;AACT;AASO,SAAS,gBACd,QACA,OACoB;AACpB,QAAM,YAAY,IAAI,IAAI,OAAO,MAAM,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;AACrE,QAAM,WAAW,IAAI,IAAI,MAAM,MAAM,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;AAEnE,QAAM,UAAgC,CAAC;AACvC,QAAM,UAA8B,CAAC;AACrC,QAAM,QAA4B,CAAC;AAEnC,aAAW,CAAC,KAAK,UAAU,KAAK,WAAW;AACzC,UAAM,YAAY,SAAS,IAAI,GAAG;AAClC,QAAI,CAAC,WAAW;AACd,cAAQ,KAAK,UAAU;AACvB;AAAA,IACF;AACA,YAAQ,KAAK;AAAA,MACX,YAAY,WAAW;AAAA,MACvB,KAAK,WAAW;AAAA,MAChB,iBAAiB,WAAW;AAAA,MAC5B,gBAAgB,UAAU;AAAA,MAC1B,gBAAgB,UAAU,gBAAgB,WAAW;AAAA,MACrD,YAAY,eAAe,WAAW,YAAY,UAAU,UAAU;AAAA,IACxE,CAAC;AAAA,EACH;AACA,aAAW,CAAC,KAAK,SAAS,KAAK,UAAU;AACvC,QAAI,CAAC,UAAU,IAAI,GAAG,EAAG,OAAM,KAAK,SAAS;AAAA,EAC/C;AAEA,SAAO;AAAA,IACL,aAAa,OAAO;AAAA,IACpB,YAAY,MAAM;AAAA,IAClB,mBAAmB,OAAO;AAAA,IAC1B,kBAAkB,MAAM;AAAA,IACxB,gBAAgB,OAAO,gBAAgB,MAAM;AAAA,IAC7C;AAAA,IACA;AAAA,IACA;AAAA,IACA,iBAAiB,OAAO;AAAA,IACxB,gBAAgB,MAAM;AAAA,IACtB,gBAAgB,MAAM,gBAAgB,OAAO;AAAA,IAC7C,eAAe,OAAO;AAAA,IACtB,cAAc,MAAM;AAAA,IACpB,cAAc,MAAM,UAAU,OAAO;AAAA,IACrC,kBAAkB,OAAO;AAAA,IACzB,iBAAiB,MAAM;AAAA,IACvB,iBAAiB,MAAM,aAAa,OAAO;AAAA,EAC7C;AACF;AAGA,SAAS,SAAS,KAAqD;AACrE,MAAI,IAAI,YAAY,WAAW,EAAG,QAAO;AACzC,MAAI,SAAS,IAAI,YAAY,CAAC;AAC9B,aAAW,OAAO,IAAI,aAAa;AACjC,QAAI,IAAI,QAAQ,OAAO,MAAO,UAAS;AAAA,EACzC;AACA,SAAO;AACT;AAOO,SAAS,SAAS,QAAsB,OAAkC;AAC/E,QAAM,eAAe,SAAS,MAAM;AACpC,QAAM,cAAc,SAAS,KAAK;AAClC,QAAM,eACJ,OAAO,YAAY,MAAM,WAAW,gBAAgB,OAAO,UAAU,MAAM,QAAQ,IAAI;AACzF,QAAM,cACJ,gBAAgB,cAAc,gBAAgB,cAAc,WAAW,IAAI;AAE7E,QAAM,aAAa,OAAO,eAAe;AACzC,QAAM,YAAY,MAAM,eAAe;AAEvC,SAAO;AAAA,IACL,aAAa,OAAO;AAAA,IACpB,YAAY,MAAM;AAAA,IAClB,iBAAiB,OAAO;AAAA,IACxB,gBAAgB,MAAM;AAAA,IACtB,oBAAoB,OAAO,gBAAgB;AAAA,IAC3C,mBAAmB,MAAM,gBAAgB;AAAA,IACzC,mBAAmB;AAAA,IACnB,kBAAkB;AAAA,IAClB,kBAAkB,eAAe,QAAQ,cAAc,OAAO,YAAY,aAAa;AAAA,IACvF,oBAAoB,OAAO;AAAA,IAC3B,mBAAmB,MAAM;AAAA,IACzB,mBAAmB,MAAM,eAAe,OAAO;AAAA,IAC/C,uBAAuB,OAAO;AAAA,IAC9B,sBAAsB,MAAM;AAAA,IAC5B,sBAAsB,MAAM,kBAAkB,OAAO;AAAA,IACrD;AAAA,IACA;AAAA,EACF;AACF;AAQO,SAAS,wBAAwB,KAA8C;AACpF,MAAI,CAAC,IAAI,SAAU,QAAO;AAC1B,QAAM,SAAS,SAAS,GAAG;AAC3B,MAAI,CAAC,UAAU,OAAO,UAAU,IAAI,SAAS,MAAO,QAAO;AAC3D,SAAO,gBAAgB,IAAI,UAAU,MAAM;AAC7C;;;AChLA,SAAS,WAAW,GAA4B;AAC9C,SAAO,KAAK,IAAI,GAAG,EAAE,WAAW,EAAE,aAAa,CAAC;AAClD;AAOO,SAAS,gBAAgB,SAA8C;AAS5E,QAAM,MAAM,oBAAI,IAAiB;AAEjC,aAAW,UAAU,SAAS;AAC5B,UAAM,MAAM,OAAO,KAAK;AACxB,QAAI,CAAC,IAAK;AAEV,QAAI,IAAI,IAAI,IAAI,GAAG;AACnB,QAAI,CAAC,GAAG;AACN,UAAI;AAAA,QACF,QAAQ,oBAAI,IAAI;AAAA,QAChB,OAAO,oBAAI,IAAI;AAAA,QACf,OAAO,oBAAI,IAAI;AAAA,QACf,mBAAmB;AAAA,QACnB,WAAW;AAAA,QACX,eAAe;AAAA,MACjB;AACA,UAAI,IAAI,KAAK,CAAC;AAAA,IAChB;AAEA,QAAI,OAAO,MAAM,KAAM,GAAE,MAAM,IAAI,OAAO,KAAK,IAAI;AAEnD,eAAW,QAAQ,OAAO,SAAS,CAAC,GAAG;AACrC,QAAE,MAAM,IAAI,KAAK,IAAI;AACrB,iBAAW,QAAQ,KAAK,iBAAiB,CAAC,GAAG;AAC3C,UAAE,qBAAqB;AACvB,mBAAW,SAAS,KAAK,UAAU,CAAC,GAAG;AAErC,gBAAM,cAAc,MAAM,eAAe,KAAK;AAC9C,YAAE,aAAa,WAAW,KAAK;AAC/B,cAAI,CAAC,YAAa;AAClB,cAAI,YAAY,SAAS,WAAW,YAAY,SAAS,SAAS;AAChE,cAAE,gBAAgB;AAAA,UACpB;AACA,eAAK,YAAY,SAAS,QAAQ,YAAY,SAAS,YAAY,YAAY,UAAU;AACvF,cAAE,OAAO,IAAI,YAAY,QAAQ;AAAA,UACnC;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,QAAM,QAAyB,oBAAI,IAAI;AACvC,aAAW,CAAC,KAAK,CAAC,KAAK,KAAK;AAC1B,UAAM,IAAI,KAAK;AAAA,MACb,WAAW;AAAA,MACX,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK;AAAA,MAC7B,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK;AAAA,MACzB,mBAAmB,EAAE;AAAA,MACrB,WAAW,EAAE,MAAM;AAAA,MACnB,WAAW,EAAE;AAAA,MACb,eAAe,EAAE;AAAA,IACnB,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAoBO,SAAS,8BACd,MACA,OACiC;AACjC,QAAM,UAAU,oBAAI,IAAyB;AAC7C,QAAM,eAA4B,CAAC;AAEnC,aAAW,OAAO,MAAM;AACtB,UAAM,aAAa,MAAM,IAAI,IAAI,SAAS;AAC1C,QAAI,CAAC,cAAc,WAAW,SAAS,WAAW,GAAG;AACnD,mBAAa,KAAK,GAAG;AACrB;AAAA,IACF;AACA,eAAW,SAAS,WAAW,UAAU;AACvC,YAAM,SAAS,QAAQ,IAAI,KAAK,KAAK,CAAC;AACtC,aAAO,KAAK,GAAG;AACf,cAAQ,IAAI,OAAO,MAAM;AAAA,IAC3B;AAAA,EACF;AAEA,SAAO,EAAE,SAAS,aAAa;AACjC;;;AC/GO,SAAS,kBAAkB,MAAyD;AACzF,QAAM,EAAE,SAAS,OAAO,CAAC,GAAG,OAAO,kBAAkB,KAAK,IAAI;AAC9D,QAAM,YAAY,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;AAGvD,QAAM,YAAY,CAAC,WAAqC;AACtD,QAAI,OAAO,WAAW,UAAW,QAAO,SAAS,IAAI;AACrD,QAAI,CAAC,OAAO,SAAS,MAAM,EAAG,QAAO,OAAO;AAC5C,QAAI,CAAC,MAAO,QAAO;AACnB,UAAM,EAAE,KAAK,IAAI,IAAI;AACrB,QAAI,QAAQ,IAAK,QAAO;AACxB,YAAQ,SAAS,QAAQ,MAAM;AAAA,EACjC;AAGA,QAAM,QAAQ,oBAAI,IAAgC;AAClD,aAAW,OAAO,SAAS;AACzB,UAAM,OAAO,MAAM,IAAI,IAAI,KAAK,KAAK,CAAC;AACtC,SAAK,KAAK,GAAG;AACb,UAAM,IAAI,IAAI,OAAO,IAAI;AAAA,EAC3B;AAEA,QAAM,OAAoB,CAAC;AAC3B,QAAM,cAAsD,CAAC;AAE7D,aAAW,CAAC,OAAO,UAAU,KAAK,OAAO;AACvC,UAAM,aAAa,WAChB,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,OAAO,UAAU,EAAE,MAAM,EAAE,EAAE,EAC3D,OAAO,CAAC,MAAM,OAAO,SAAS,EAAE,KAAK,CAAC;AACzC,QAAI,WAAW,WAAW,EAAG;AAE7B,UAAM,YAAY,WAAW,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,OAAO,CAAC,IAAI,WAAW;AAE3E,UAAM,UAAU,UAAU,IAAI,KAAK,KAAM,EAAE,MAAM;AAEjD,UAAM,cAAiC;AAAA,MACrC,UAAU,OAAO,YAAY,WAAW,IAAI,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC;AAAA,MAClF,YAAY,EAAE,QAAQ,UAAU;AAAA,MAChC,WAAW;AAAA,IACb;AAEA,UAAM,UAAsB;AAAA;AAAA;AAAA;AAAA,MAI1B,cAAc;AAAA,MACd,KAAK,OAAO,YAAY,WAAW,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,KAAK,IAAI,EAAE,KAAK,CAAC,CAAC;AAAA,MAC5E;AAAA,IACF;AAEA,SAAK,KAAK;AAAA,MACR;AAAA,MACA,cAAc,QAAQ,gBAAgB;AAAA,MACtC,aAAa,QAAQ,eAAe;AAAA,MACpC,MAAM;AAAA,MACN,OAAO,QAAQ,SAAS;AAAA,MACxB,YAAY,QAAQ,cAAc;AAAA,MAClC,YAAY,QAAQ,cAAc;AAAA,MAClC,WAAW,QAAQ,aAAa;AAAA,MAChC,QAAQ,QAAQ,UAAU;AAAA,MAC1B,SAAS,QAAQ,WAAW;AAAA,MAC5B,YAAY,EAAE,OAAO,GAAG,QAAQ,EAAE;AAAA,MAClC;AAAA,MACA,UAAU,QAAQ,YAAY;AAAA,IAChC,CAAc;AAEd,QAAI,iBAAiB;AACnB,iBAAW,KAAK,WAAY,aAAY,KAAK,EAAE,OAAO,OAAO,EAAE,OAAO,OAAO,EAAE,MAAM,CAAC;AAAA,IACxF;AAAA,EACF;AAEA,SAAO,EAAE,MAAM,YAAY;AAC7B;;;AC5HA,IAAM,aAAa,CAAC,gBAAgB,cAAc,OAAO;AACzD,IAAM,aAAa,CAAC,gBAAgB,wBAAwB,aAAa,OAAO;AAChF,IAAM,YAAY,CAAC,mBAAmB,yBAAyB,YAAY,MAAM;AACjF,IAAM,mBAAmB,CAAC,6BAA6B,oBAAoB,WAAW;AACtF,IAAM,oBAAoB,CAAC,8BAA8B,qBAAqB,YAAY;AAC1F,IAAM,mBAAmB,CAAC,sBAAsB,aAAa;AAC7D,IAAM,mBAAmB,CAAC,sBAAsB,aAAa;AAUtD,SAAS,cAAc,MAAyC;AACrE,QAAM,EAAE,OAAO,eAAe,WAAW,eAAe,cAAc,IAAI;AAC1E,QAAM,UAAU,WAAW,KAAK;AAEhC,QAAM,OAAoB,CAAC;AAC3B,aAAW,CAAC,UAAUA,WAAU,KAAK,SAAS;AAC5C,UAAM,OAAO,SAASA,WAAU;AAChC,QAAI,CAAC,KAAM;AAEX,UAAM,SAAS,KAAK,IAAI,IAAI,KAAK,kBAAkB,KAAK,qBAAqB,GAAS;AACtF,UAAM,QAAQ,eAAeA,aAAY,UAAU,KAAK;AACxD,UAAM,UAAU,eAAeA,aAAY,SAAS,KAAK;AACzD,UAAM,cAAc,eAAeA,aAAY,gBAAgB,KAAK;AACpE,UAAM,eAAe,eAAeA,aAAY,iBAAiB,KAAK;AACtE,UAAM,aAAa,eAAeA,aAAY,gBAAgB,KAAK;AACnE,UAAM,aAAa,eAAeA,aAAY,gBAAgB,KAAK;AACnE,UAAM,QAAQ,eAAeA,aAAY,UAAU;AAEnD,UAAM,aAAa,oBAAoBA,WAAU;AACjD,UAAM,aAA4B;AAAA,MAChC,OAAO;AAAA,MACP,QAAQ;AAAA,IACV;AAEA,UAAM,cACJ,UAAU,SACN;AAAA,MACE,UAAU,EAAE,gBAAgB,EAAE,MAAM,EAAE;AAAA,MACtC,YAAY,EAAE,MAAM;AAAA,MACpB,WAAW;AAAA,IACb,IACA;AAEN,UAAM,YAAYA,YAAW,KAAK,CAAC,MAAM,EAAE,QAAQ,SAAS,OAAO;AACnE,UAAM,UAAsB;AAAA,MAC1B,GAAI,KAAK,iBAAiB,WAAW,EAAE,aAAa,MAAM,IAAI,EAAE,cAAc,MAAM;AAAA,MACpF,KAAK;AAAA,MACL,GAAI,cAAc,EAAE,YAAY,IAAI,CAAC;AAAA,IACvC;AAEA,SAAK,KAAK;AAAA,MACR,OAAO;AAAA,MACP;AAAA,MACA,aAAc,KAAK,WAAW,oBAAoB,KAA4B;AAAA,MAC9E,MAAM;AAAA,MACN;AAAA,MACA;AAAA,MACA;AAAA,MACA,WAAY,KAAK,WAAW,mBAAmB,KAA4B;AAAA,MAC3E;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,UAAU;AAAA,MACV,GAAI,YAAY,EAAE,aAAa,UAAU,KAAK,IAAI,CAAC;AAAA,IACrD,CAAc;AAAA,EAChB;AACA,SAAO;AACT;AAIA,SAAS,WAAW,OAAwD;AAC1E,QAAM,IAAI,oBAAI,IAA8B;AAC5C,aAAW,QAAQ,OAAO;AACxB,UAAM,MAAO,KAAK,cAAc,KAA4B,KAAK;AACjE,UAAM,OAAO,EAAE,IAAI,GAAG,KAAK,CAAC;AAC5B,SAAK,KAAK,IAAI;AACd,MAAE,IAAI,KAAK,IAAI;AAAA,EACjB;AACA,SAAO;AACT;AAEA,SAAS,SAAS,OAAqD;AACrE,SAAO,MAAM,KAAK,CAAC,MAAM,CAAC,EAAE,YAAY,KAAK,MAAM,CAAC;AACtD;AAEA,SAAS,eAAe,OAAyB,MAAoC;AACnF,aAAW,QAAQ,OAAO;AACxB,eAAW,OAAO,MAAM;AACtB,YAAM,IAAI,KAAK,WAAW,GAAG;AAC7B,UAAI,OAAO,MAAM,YAAY,EAAE,SAAS,EAAG,QAAO;AAAA,IACpD;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,eAAe,OAAyB,MAAoC;AACnF,aAAW,QAAQ,OAAO;AACxB,eAAW,OAAO,MAAM;AACtB,YAAM,IAAI,KAAK,WAAW,GAAG;AAC7B,UAAI,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,EAAG,QAAO;AACxD,UAAI,OAAO,MAAM,UAAU;AACzB,cAAM,SAAS,OAAO,CAAC;AACvB,YAAI,OAAO,SAAS,MAAM,EAAG,QAAO;AAAA,MACtC;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,oBAAoB,OAAiD;AAC5E,QAAM,MAA8B,CAAC;AACrC,aAAW,QAAQ,OAAO;AACxB,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,KAAK,UAAU,GAAG;AACpD,UAAI,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,EAAG,KAAI,CAAC,IAAI;AAAA,IAC5D;AAAA,EACF;AACA,SAAO;AACT;","names":["groupSpans"]}
+{"version":3,"sources":["../../src/contract/self-improve.ts","../../src/contract/define-agent-eval.ts","../../src/contract/diff.ts","../../src/contract/intake/agent-trace.ts","../../src/contract/intake/feedback-table.ts","../../src/contract/intake/otel-spans.ts"],"sourcesContent":["/**\n * # `selfImprove()` - the one-call improvement loop.\n *\n * The cheapest possible call site to run a real closed-loop self-\n * improvement over your agent. Wraps `runImprovementLoop` with smart\n * defaults and a budget-shaped options API; every escape hatch the\n * substrate exposes is reachable from here without losing the\n * one-function feel.\n *\n * Defaults:\n *   - In-memory storage (no filesystem touch).\n *   - `gepaProposer` reflective mutation with copywriting-flavored primitives\n *     (override `proposer` or `mutationPrimitives` for any domain).\n *   - `defaultProductionGate` with `deltaThreshold: 0.05`.\n *   - Held-out split = 25% of scenarios, deterministic by id hash.\n *   - 3 generations × population 2 (raise via `budget` for more search).\n *   - `autoOnPromote: 'none'` (we don't open PRs unless you ask).\n *\n * Want one-click? Provide `agent` + `scenarios` + `judge`. Done.\n * Want distributed? Pass `cellPlacement` + an `httpDispatch`-backed\n * agent. Want a code-tier surface? Pass a `MutableSurface` + your own\n * `proposer`. Same function.\n */\n\nimport { createHash } from 'node:crypto'\nimport { defaultProductionGate } from '../campaign/gates/default-production-gate'\nimport {\n  type RunImprovementLoopResult,\n  runImprovementLoop,\n} from '../campaign/presets/run-improvement-loop'\nimport type { RunOptimizationOptions } from '../campaign/presets/run-optimization'\nimport { gepaProposer } from '../campaign/proposers/gepa'\nimport {\n  emitLoopProvenance,\n  type LoopProvenanceRecord,\n  surfaceContentHash,\n} from '../campaign/provenance'\nimport {\n  type CampaignStorage,\n  fsCampaignStorage,\n  inMemoryCampaignStorage,\n} from '../campaign/storage'\nimport type {\n  CampaignCellResult,\n  DispatchContext,\n  Gate,\n  JudgeConfig,\n  LabeledScenarioStore,\n  MutableSurface,\n  Scenario,\n  SurfaceProposer,\n} from '../campaign/types'\nimport { createHostedClient, type HostedTenant } from '../hosted/client'\nimport type { EvalRunCellScore, EvalRunEvent, EvalRunGenerationSnapshot } from '../hosted/types'\nimport type { JudgeScoresRecord, RunRecord } from '../run-record'\nimport { analyzeRuns } from './analyze-runs'\nimport type { InsightReport } from './insight-report'\n\nexport interface SelfImproveBudget {\n  /** Hard $ ceiling across all cells in baseline + every generation. Cells\n   *  beyond the ceiling are skipped (cost-aware, not aborted). */\n  dollars?: number\n  /** How many improvement generations to explore. Default 3. Set 0 to\n   *  skip improvement entirely (selfImprove becomes a baseline-only run). */\n  generations?: number\n  /** Candidates the proposer emits per generation. Default 2. */\n  populationSize?: number\n  /** Max concurrent cells across the loop. Default 2. */\n  maxConcurrency?: number\n  /** Fraction of `scenarios` held out from training, used for the gate.\n   *  Default 0.25. Ignored when `holdoutScenarios` is set explicitly. */\n  holdoutFraction?: number\n  /** Explicit held-out scenarios; overrides `holdoutFraction`. */\n  holdoutScenarios?: Scenario[]\n  /** Per-scenario replicates per cell — raises bootstrap-CI tightness. Default 1. */\n  reps?: number\n  /** Top-scoring candidates carried into the next generation. Default 2. */\n  promoteTopK?: number\n}\n\nexport interface SelfImproveLlm {\n  /** Endpoint base URL. Default Tangle Router. */\n  baseUrl?: string\n  /** Bearer token. Default `process.env.OPENAI_API_KEY`. */\n  apiKey?: string\n  /** Model id used by `gepaProposer` reflection. Default\n   *  `anthropic/claude-sonnet-4.6`. */\n  model?: string\n}\n\nexport type SelfImproveProgressEvent =\n  | { kind: 'baseline.started'; scenarios: number }\n  | { kind: 'baseline.completed'; compositeMean: number; durationMs: number }\n  | { kind: 'generation.started'; index: number; populationSize: number }\n  | { kind: 'generation.completed'; index: number; bestComposite: number; durationMs: number }\n  | { kind: 'gate.decided'; decision: string; lift: number }\n\nexport interface SelfImproveOptions<TScenario extends Scenario, TArtifact> {\n  /**\n   * Your agent — a function that takes the current `MutableSurface`\n   * (typically a system prompt the loop is optimizing) plus the\n   * scenario + cell ctx, and returns the artifact your judge scores.\n   *\n   * Same shape as `RunOptimizationOptions.dispatchWithSurface`. Wrap a\n   * plain `Dispatch` if you don't have a surface seam:\n   *\n   *   agent: (_surface, scenario, ctx) => yourPlainDispatch(scenario, ctx)\n   *\n   * That mode evaluates without mutating any surface — useful as a\n   * baseline-only run (set `budget.generations = 0`).\n   */\n  agent: (surface: MutableSurface, scenario: TScenario, ctx: DispatchContext) => Promise<TArtifact>\n\n  /** Scenarios to evaluate against. Train/holdout split is computed from\n   *  these unless `budget.holdoutScenarios` is set explicitly. */\n  scenarios: TScenario[]\n\n  /** Judge that scores artifacts. Bring your own; use `langchainJudge`\n   *  from `/adapters/langchain` for a Runnable-shaped one. */\n  judge: JudgeConfig<TArtifact, TScenario>\n\n  /** Starting surface — system prompt, JSON config, anything `MutableSurface`\n   *  accepts. The proposer mutates this each generation. */\n  baselineSurface: MutableSurface\n\n  /** Budget + loop shape. All fields optional. */\n  budget?: SelfImproveBudget\n\n  /** Custom surface proposer. Default is `gepaProposer` configured from `llm` +\n   *  `mutationPrimitives`. */\n  proposer?: SurfaceProposer\n\n  /** Default-proposer overrides — used when `proposer` is unset. */\n  mutationPrimitives?: string[]\n  proposerTarget?: string\n\n  /** Custom gate. Default is `defaultProductionGate` with\n   *  `deltaThreshold: 0.05` on the held-out split. */\n  gate?: Gate<TArtifact, TScenario>\n\n  /** LLM config consumed by the default `gepaProposer`. Ignored if you pass\n   *  your own `proposer`. */\n  llm?: SelfImproveLlm\n\n  /** Storage backend. Default is DURABLE: when a real (non-`mem://`) `runDir`\n   *  is available, the substrate defaults to `fsCampaignStorage()` so the\n   *  provenance record + OTel spans survive the call. Pass\n   *  `inMemoryCampaignStorage()` explicitly to opt OUT (tests, edge runtimes).\n   *  Default when `runDir` is `mem://...` (or unset): in-memory. */\n  storage?: CampaignStorage\n\n  /** Run directory (logical for in-memory storage, real path for fs).\n   *  Default `mem://selfImprove-<timestamp>` (in-memory, non-durable). Pass a\n   *  real path to persist the provenance record + spans. */\n  runDir?: string\n\n  /**\n   * Worker call records for backend provenance. The agent is opaque to the\n   * substrate (it returns an artifact, not token usage), so to capture an\n   * `assertRealBackend`-grade verdict + worker call count + model in the\n   * provenance record, the agent reports its per-call `RunRecord`s here.\n   * Called once after the loop; return the records the agent accumulated.\n   * When unset, backend provenance is derived from campaign cells (cost only;\n   * verdict will read `stub` without token usage — the honest signal that no\n   * token channel was wired).\n   */\n  collectWorkerRecords?: () => RunRecord[]\n\n  /** Fires once the durable provenance record + OTel spans are emitted.\n   *  Receives the structured record for inline assertions / custom routing. */\n  onProvenance?: (record: LoopProvenanceRecord) => void\n\n  /** Distributed execution seam — same as `RunCampaignOptions.cellPlacement`.\n   *  Returns an opaque placement key the substrate forwards to your agent\n   *  as `ctx.placement`. Combined with `httpDispatch` from\n   *  `/adapters/http`, fans cells across regions. */\n  cellPlacement?: (input: {\n    scenario: TScenario\n    rep: number\n    generation?: number\n  }) => string | undefined\n\n  /** Streaming hook — fires on baseline + each generation + gate decision.\n   *  Consumer routes events wherever (UI, dashboard, logs). */\n  onProgress?: (event: SelfImproveProgressEvent) => void\n\n  /** Auto-promotion behavior on a ship decision. Default `'none'` — we\n   *  return the winner; you ship it however you ship. `'pr'` opens a\n   *  GitHub PR via `openAutoPr`; requires `ghOwner` + `ghRepo`. */\n  autoOnPromote?: 'pr' | 'none'\n  ghOwner?: string\n  ghRepo?: string\n\n  /**\n   * Opt-in: ship eval-run events to a hosted orchestrator (ours, your\n   * self-hosted one, or any compatible implementation of the\n   * `docs/hosted-ingest-spec.md` wire format). When set, the substrate\n   * POSTs the final `EvalRunEvent` to `${endpoint}/v1/ingest/eval-runs`\n   * after the loop completes. Failures are logged but do not fail the\n   * loop — local result is always returned.\n   *\n   * For our orchestrator: `{ endpoint: 'https://orchestrator.tangle.tools/v1', apiKey, tenantId }`.\n   *\n   * For your self-hosted: any URL serving the wire format. See\n   * `examples/hosted-ingest-server/` for the reference receiver.\n   */\n  hostedTenant?: HostedTenant\n\n  /** Free-form labels attached to the hosted event (env, branch, model id,\n   *  etc.). Ignored when `hostedTenant` is unset. */\n  hostedLabels?: Record<string, string>\n\n  /** Capture every artifact + judge score to this store (labeled-example\n   *  corpus the proposer may read for few-shot, and the dataset you ship). Pass\n   *  `'off'` to disable. Default: off. */\n  labeledStore?: LabeledScenarioStore | 'off'\n\n  /** Capture-source tag for `labeledStore`. Default `'eval-run'`. */\n  captureSource?: 'production-trace' | 'eval-run' | 'manual' | 'red-team' | 'synthetic'\n\n  /**\n   * Per-cell backend-integrity expectation — the fail-loud guard. A cell that\n   * produced an artifact but reported `costUsd === 0` AND zero tokens is a\n   * stub. Modes: `'assert'` throws on the first such cell, `'warn'` logs it,\n   * `'off'` skips the check (offline/replay). Default `'assert'` — `selfImprove`\n   * is the real-run path, so a stub fails loud rather than scoring a clean 0.\n   */\n  expectUsage?: 'assert' | 'warn' | 'off'\n\n  /**\n   * Per-generation findings producer. After each\n   * generation is scored, this is called; whatever it returns REPLACES the\n   * proposer's `findings` for the next generation's `propose()`. Plug a\n   * trace-analyst registry / HALO here. When absent, findings stay\n   * `opts.findings`.\n   */\n  analyzeGeneration?: RunOptimizationOptions<TScenario, TArtifact>['analyzeGeneration']\n\n  /** Static findings forwarded to the proposer's `propose()` as `ctx.findings`\n   *  (a findings-grounded proposer consumes them). Default: none. */\n  findings?: unknown[]\n}\n\nexport interface SelfImproveResult<TScenario extends Scenario, TArtifact> {\n  /** Composite mean across all scenarios, baseline run. */\n  baseline: {\n    compositeMean: number\n    perScenario: Record<string, number>\n  }\n  /** Composite mean on the held-out set, winner run. */\n  winner: {\n    compositeMean: number\n    perScenario: Record<string, number>\n    surface: MutableSurface\n    /** Proposer label for the promoted change. Absent ⇒ winner == baseline or\n     *  a bare-surface mutator. */\n    label?: string\n    /** Proposer rationale — the \"because Z\" that motivated the promoted change.\n     *  Threaded from the proposer's `ProposedCandidate` through the loop.\n     *  Absent ⇒ winner == baseline. */\n    rationale?: string\n  }\n  /** `winner.compositeMean - baselineOnHoldout.compositeMean`. Positive\n   *  means the gate observed improvement. */\n  lift: number\n  /** The explicit baseline→winner unified diff. Always present (empty string\n   *  when winner == baseline). */\n  diff: string\n  /** Durable, queryable provenance record: candidate→cell→gate→promote chain +\n   *  rationale + diff + backend provenance. The artifact the hosted ingest\n   *  path stores; the +lift RECOMPUTES from `record.heldOutLift`. */\n  provenance: LoopProvenanceRecord\n  /** `defaultProductionGate.decide()` result. */\n  gateDecision: 'ship' | 'hold' | 'need_more_work' | 'model_ceiling' | 'arch_ceiling'\n  /** Number of generations actually explored (may be less than the\n   *  budget if the proposer gave up early). */\n  generationsExplored: number\n  /** Wall-clock total. */\n  durationMs: number\n  /** Total cost across baseline + every generation. */\n  totalCostUsd: number\n  /**\n   * Rigor packet: distributional summary, paired-bootstrap lift CI,\n   * judge stats, contamination check, recommendations. Wired through\n   * `analyzeRuns()` on the baseline + winner cells of the campaign.\n   * Hosted-tier dashboards render this as the v3-vs-v4 decision view.\n   */\n  insight: InsightReport\n  /**\n   * Raw substrate result for advanced inspection — full per-generation\n   * candidates, full campaign artifacts, all judge scores. Useful for\n   * debugging or reporting beyond the summary.\n   */\n  raw: RunImprovementLoopResult<TArtifact, TScenario>\n}\n\n/**\n * Deterministic train/holdout split by a stable hash of `scenario.id`,\n * so the same scenario set always splits the same way across runs.\n */\nfunction splitTrainHoldout<TScenario extends Scenario>(\n  scenarios: TScenario[],\n  fraction: number,\n): { train: TScenario[]; holdout: TScenario[] } {\n  // Stable fnv-1a-ish hash of the id for ordering.\n  function hash(s: string): number {\n    let h = 2166136261 >>> 0\n    for (let i = 0; i < s.length; i++) {\n      h ^= s.charCodeAt(i)\n      h = Math.imul(h, 16777619) >>> 0\n    }\n    return h\n  }\n  const sorted = [...scenarios].sort((a, b) => hash(a.id) - hash(b.id))\n  const nHoldout = Math.max(1, Math.min(sorted.length - 1, Math.round(sorted.length * fraction)))\n  return {\n    holdout: sorted.slice(0, nHoldout),\n    train: sorted.slice(nHoldout),\n  }\n}\n\nfunction meanComposite(byScenario: Record<string, { meanComposite: number }>): {\n  compositeMean: number\n  perScenario: Record<string, number>\n} {\n  const perScenario: Record<string, number> = {}\n  const values: number[] = []\n  for (const [id, agg] of Object.entries(byScenario)) {\n    perScenario[id] = agg.meanComposite\n    values.push(agg.meanComposite)\n  }\n  return {\n    compositeMean: values.length === 0 ? 0 : values.reduce((s, v) => s + v, 0) / values.length,\n    perScenario,\n  }\n}\n\nconst DEFAULT_MUTATION_PRIMITIVES = [\n  'Tighten the hook: lead with the specific user outcome.',\n  'Replace generic adjectives with specific verbs or proof numbers.',\n  \"Anchor every claim in something the scenario's brief literally supports.\",\n  'Honor the surface-shape constraint (length, register, audience vocabulary).',\n]\n\n/**\n * One-shot self-improvement loop. See module docstring for defaults +\n * extension points.\n *\n * @example Minimum:\n *\n *   const result = await selfImprove({\n *     agent: (surface, scenario, ctx) => myAgent(surface, scenario, ctx.signal),\n *     scenarios,\n *     judge,\n *     baselineSurface: DEFAULT_PROMPT,\n *   })\n *   console.log(`lift: ${result.lift.toFixed(3)} (${result.gateDecision})`)\n *\n * @example Distributed (workers in three regions):\n *\n *   await selfImprove({\n *     agent: httpDispatch({ resolveUrl: ({ placement }) => REGION_URLS[placement!] }),\n *     scenarios,\n *     judge,\n *     baselineSurface: DEFAULT_PROMPT,\n *     cellPlacement: ({ scenario }) => scenario.region,\n *     budget: { maxConcurrency: 12 },\n *   })\n */\nexport async function selfImprove<TScenario extends Scenario, TArtifact>(\n  opts: SelfImproveOptions<TScenario, TArtifact>,\n): Promise<SelfImproveResult<TScenario, TArtifact>> {\n  const startedAt = Date.now()\n\n  const budget = opts.budget ?? {}\n  const generations = budget.generations ?? 3\n  const populationSize = budget.populationSize ?? 2\n  const maxConcurrency = budget.maxConcurrency ?? 2\n  const holdoutFraction = budget.holdoutFraction ?? 0.25\n  const costCeiling = budget.dollars\n  const expectUsage = opts.expectUsage ?? 'assert'\n\n  const explicitHoldout = budget.holdoutScenarios\n  const { train, holdout } = explicitHoldout\n    ? {\n        train: opts.scenarios.filter((s) => !explicitHoldout.some((h) => h.id === s.id)),\n        holdout: explicitHoldout as TScenario[],\n      }\n    : splitTrainHoldout(opts.scenarios, holdoutFraction)\n\n  if (train.length === 0) {\n    throw new Error(\n      'selfImprove: train split is empty. Reduce holdoutFraction or pass more scenarios.',\n    )\n  }\n  if (holdout.length === 0) {\n    throw new Error('selfImprove: holdout split is empty. Pass more scenarios.')\n  }\n\n  const proposer: SurfaceProposer =\n    opts.proposer ??\n    gepaProposer({\n      llm: {\n        baseUrl: opts.llm?.baseUrl ?? 'https://router.tangle.tools/v1',\n        apiKey: opts.llm?.apiKey ?? process.env.OPENAI_API_KEY ?? '',\n      },\n      model: opts.llm?.model ?? 'anthropic/claude-sonnet-4.6',\n      target:\n        opts.proposerTarget ??\n        'agent surface (system prompt or config) being optimized by selfImprove',\n      mutationPrimitives: opts.mutationPrimitives ?? DEFAULT_MUTATION_PRIMITIVES,\n    })\n\n  const gate: Gate<TArtifact, TScenario> =\n    opts.gate ??\n    defaultProductionGate<TArtifact, TScenario>({\n      holdoutScenarios: holdout,\n      deltaThreshold: 0.05,\n    })\n\n  // Durable by default: a real (non-`mem://`) runDir means the caller wants\n  // persistence, so default to fs storage — the provenance record + spans\n  // survive the call. A `mem://` runDir (or none) stays in-memory. An explicit\n  // `storage` always wins (the opt-out path for tests / edge runtimes).\n  const runDir = opts.runDir ?? `mem://selfImprove-${startedAt}`\n  const isMemRunDir = runDir.startsWith('mem://')\n  const storage = opts.storage ?? (isMemRunDir ? inMemoryCampaignStorage() : fsCampaignStorage())\n\n  if (opts.onProgress) {\n    opts.onProgress({ kind: 'baseline.started', scenarios: opts.scenarios.length })\n  }\n\n  const result = await runImprovementLoop<TScenario, TArtifact>({\n    scenarios: train,\n    baselineSurface: opts.baselineSurface,\n    dispatchWithSurface: opts.agent,\n    proposer,\n    judges: [opts.judge],\n    populationSize,\n    maxGenerations: generations,\n    promoteTopK: budget.promoteTopK,\n    reps: budget.reps,\n    holdoutScenarios: holdout,\n    gate,\n    autoOnPromote: opts.autoOnPromote ?? 'none',\n    ghOwner: opts.ghOwner,\n    ghRepo: opts.ghRepo,\n    storage,\n    runDir,\n    maxConcurrency,\n    cellPlacement: opts.cellPlacement,\n    costCeiling,\n    expectUsage,\n    labeledStore: opts.labeledStore,\n    captureSource: opts.captureSource,\n    analyzeGeneration: opts.analyzeGeneration,\n    findings: opts.findings,\n  })\n\n  const baseline = meanComposite(result.baselineOnHoldout.aggregates.byScenario)\n  const winnerStats = meanComposite(result.winnerOnHoldout.aggregates.byScenario)\n\n  if (opts.onProgress) {\n    opts.onProgress({\n      kind: 'baseline.completed',\n      compositeMean: baseline.compositeMean,\n      durationMs: Date.now() - startedAt,\n    })\n    opts.onProgress({\n      kind: 'gate.decided',\n      decision: result.gateResult.decision,\n      lift: winnerStats.compositeMean - baseline.compositeMean,\n    })\n  }\n\n  const totalCost =\n    result.baselineCampaign.aggregates.totalCostUsd +\n    result.generations.reduce(\n      (sum, gen) =>\n        sum + gen.surfaces.reduce((s, sf) => s + sf.campaign.aggregates.totalCostUsd, 0),\n      0,\n    )\n\n  // Rigor packet: feed baseline + winner cells through analyzeRuns().\n  // The two candidates (`baseline` / `winner`) give the lift section a\n  // clean paired comparison; per-judge / per-dimension / cost-quality\n  // sections populate from the cells' judgeScores.\n  const insight = await analyzeRuns({\n    runs: [\n      ...cellsToRunRecords(result.baselineCampaign.cells, 'baseline', runDir, opts.baselineSurface),\n      ...cellsToRunRecords(result.winnerOnHoldout.cells, 'winner', runDir, result.winnerSurface),\n    ],\n    baselineCandidateId: 'baseline',\n    candidateCandidateId: 'winner',\n  })\n\n  // ── Durable provenance: candidate→cell→gate→promote chain + rationale +\n  // diff + backend provenance. Always emitted; the +lift recomputes from it.\n  const durationMs = Date.now() - startedAt\n  const workerRecords =\n    opts.collectWorkerRecords?.() ??\n    cellsToRunRecords(result.winnerOnHoldout.cells, 'winner', runDir, result.winnerSurface)\n  const { record: provenance } = await emitLoopProvenance<TArtifact, TScenario>({\n    runId: `${runDir}#${startedAt}`,\n    runDir,\n    timestamp: new Date(startedAt).toISOString(),\n    baselineSurface: opts.baselineSurface,\n    winnerSurface: result.winnerSurface,\n    winnerLabel: result.winnerLabel,\n    winnerRationale: result.winnerRationale,\n    diff: result.promotedDiff,\n    generations: result.generations.map((g) => ({\n      generationIndex: g.record.generationIndex,\n      candidates: g.record.candidates,\n      promoted: g.record.promoted,\n      surfaces: g.surfaces.map((s) => ({ surfaceHash: s.surfaceHash, surface: s.surface })),\n    })),\n    gate: result.gateResult,\n    baselineOnHoldout: result.baselineOnHoldout,\n    winnerOnHoldout: result.winnerOnHoldout,\n    workerRecords,\n    totalCostUsd: totalCost,\n    totalDurationMs: durationMs,\n    storage,\n    hostedClient: opts.hostedTenant ? createHostedClient(opts.hostedTenant) : undefined,\n  })\n  if (opts.onProvenance) opts.onProvenance(provenance)\n\n  const summary: SelfImproveResult<TScenario, TArtifact> = {\n    baseline,\n    winner: {\n      ...winnerStats,\n      surface: result.winnerSurface,\n      ...(result.winnerLabel ? { label: result.winnerLabel } : {}),\n      ...(result.winnerRationale ? { rationale: result.winnerRationale } : {}),\n    },\n    lift: winnerStats.compositeMean - baseline.compositeMean,\n    diff: result.promotedDiff,\n    provenance,\n    gateDecision: result.gateResult.decision,\n    generationsExplored: result.generations.length,\n    durationMs,\n    totalCostUsd: totalCost,\n    insight,\n    raw: result,\n  }\n\n  // Opt-in hosted ingest. Failures are logged but never fail the loop: the\n  // local result is always returned.\n  if (opts.hostedTenant) {\n    try {\n      await shipEvalRunToHosted(opts.hostedTenant, opts, summary, result, runDir)\n    } catch (err) {\n      const msg = err instanceof Error ? err.message : String(err)\n      // eslint-disable-next-line no-console -- intentional: hosted-ingest is best-effort\n      console.warn(`[agent-eval] hosted ingest failed (continuing): ${msg}`)\n    }\n  }\n\n  return summary\n}\n\nasync function shipEvalRunToHosted<TScenario extends Scenario, TArtifact>(\n  tenant: HostedTenant,\n  opts: SelfImproveOptions<TScenario, TArtifact>,\n  summary: SelfImproveResult<TScenario, TArtifact>,\n  raw: RunImprovementLoopResult<TArtifact, TScenario>,\n  runDir: string,\n): Promise<void> {\n  const client = createHostedClient(tenant)\n\n  function snapshotFromCampaign(\n    index: number,\n    surface: MutableSurface | undefined,\n    campaign: RunImprovementLoopResult<TArtifact, TScenario>['baselineCampaign'],\n    durationMs: number,\n  ): EvalRunGenerationSnapshot {\n    const cells: EvalRunCellScore[] = campaign.cells.map((cell) => {\n      const judgeScores = Object.values(cell.judgeScores)\n      const composite =\n        judgeScores.length === 0\n          ? 0\n          : judgeScores.reduce((s, j) => s + j.composite, 0) / judgeScores.length\n      return {\n        scenarioId: cell.scenarioId,\n        rep: cell.rep,\n        compositeMean: composite,\n        dimensions: Object.fromEntries(\n          Object.entries(cell.judgeScores).map(([name, score]) => [name, score.dimensions]),\n        ),\n        errorMessage: cell.error ?? undefined,\n      }\n    })\n    const compositeMean =\n      cells.length === 0 ? 0 : cells.reduce((s, c) => s + c.compositeMean, 0) / cells.length\n    return {\n      index,\n      surfaceHash:\n        typeof surface === 'string'\n          ? hashString(surface)\n          : hashString(JSON.stringify(surface ?? '')),\n      surface,\n      cells,\n      compositeMean,\n      costUsd: campaign.aggregates.totalCostUsd,\n      durationMs,\n    }\n  }\n\n  const generations: EvalRunGenerationSnapshot[] = []\n  // Baseline as generation 0.\n  generations.push(snapshotFromCampaign(0, opts.baselineSurface, raw.baselineCampaign, 0))\n  // Improvement generations as 1..N. Substrate stores per-surface campaigns\n  // per generation — we summarize the WINNING surface per generation here.\n  for (const gen of raw.generations) {\n    const winner = gen.surfaces.reduce(\n      (best, s) =>\n        s.campaign.aggregates.cellsExecuted > 0 &&\n        (best === undefined || averageComposite(s.campaign) > averageComposite(best.campaign))\n          ? s\n          : best,\n      gen.surfaces[0],\n    )\n    if (!winner) continue\n    generations.push(\n      snapshotFromCampaign(gen.record.generationIndex + 1, winner.surface, winner.campaign, 0),\n    )\n  }\n\n  const event: EvalRunEvent = {\n    runId: `${runDir}#${Date.now()}`,\n    runDir,\n    timestamp: new Date().toISOString(),\n    status: 'finished',\n    labels: opts.hostedLabels ?? {},\n    baseline: generations[0],\n    generations,\n    gateDecision: summary.gateDecision,\n    holdoutLift: summary.lift,\n    totalCostUsd: summary.totalCostUsd,\n    totalDurationMs: summary.durationMs,\n    insightReport: summary.insight,\n  }\n\n  await client.ingestEvalRun(event)\n}\n\nfunction averageComposite(\n  campaign: RunImprovementLoopResult<unknown, Scenario>['baselineCampaign'],\n): number {\n  const aggs = Object.values(campaign.aggregates.byScenario)\n  return aggs.length === 0 ? 0 : aggs.reduce((s, a) => s + a.meanComposite, 0) / aggs.length\n}\n\nfunction hashString(s: string): string {\n  let h = 2166136261 >>> 0\n  for (let i = 0; i < s.length; i++) {\n    h ^= s.charCodeAt(i)\n    h = Math.imul(h, 16777619) >>> 0\n  }\n  return h.toString(16).padStart(8, '0')\n}\n\n/**\n * Adapt campaign cells into the `RunRecord` shape `analyzeRuns()` consumes.\n * Each cell becomes one run; `candidateId` is the caller-supplied label so\n * baseline + winner pair cleanly on `(experimentId, seed)`.\n *\n * `promptHash` is the REAL sha256 content hash of the surface this cell ran\n * (baseline vs winner are byte-distinguishable + byte-identical-verifiable);\n * `configHash` is the sha256 of the candidate label so the two candidates'\n * config rows differ. Both were previously the literal `'sha256:cell'`, which\n * made baseline and winner indistinguishable in every downstream record.\n */\nfunction cellsToRunRecords<TArtifact>(\n  cells: ReadonlyArray<CampaignCellResult<TArtifact>>,\n  candidateId: 'baseline' | 'winner',\n  runId: string,\n  surface: MutableSurface,\n): RunRecord[] {\n  const promptHash = surfaceContentHash(surface)\n  const configHash = `sha256:${createHash('sha256').update(candidateId).digest('hex')}`\n  return cells.map((cell) => {\n    const perJudge: Record<string, Record<string, number>> = {}\n    const perDimMeanAccum: Record<string, { sum: number; n: number }> = {}\n    let compositeSum = 0\n    let compositeCount = 0\n    for (const [judgeId, score] of Object.entries(cell.judgeScores)) {\n      perJudge[judgeId] = { ...score.dimensions }\n      for (const [dim, value] of Object.entries(score.dimensions)) {\n        if (!Number.isFinite(value)) continue\n        const accum = perDimMeanAccum[dim] ?? { sum: 0, n: 0 }\n        accum.sum += value\n        accum.n += 1\n        perDimMeanAccum[dim] = accum\n      }\n      if (Number.isFinite(score.composite)) {\n        compositeSum += score.composite\n        compositeCount += 1\n      }\n    }\n    const perDimMean: Record<string, number> = {}\n    for (const [dim, { sum, n }] of Object.entries(perDimMeanAccum)) {\n      perDimMean[dim] = n === 0 ? 0 : sum / n\n    }\n    const composite = compositeCount === 0 ? 0 : compositeSum / compositeCount\n    const judgeScores: JudgeScoresRecord = {\n      perJudge,\n      perDimMean,\n      composite,\n    }\n    return {\n      runId: `${runId}::${candidateId}::${cell.cellId}`,\n      experimentId: runId,\n      candidateId,\n      // Pair on (scenarioId, rep) — analyzeRuns pairs on (experimentId, seed).\n      // Synthesize a stable seed for that pairing.\n      seed:\n        cell.rep * 1_000_000 +\n        hashString(cell.scenarioId)\n          .slice(0, 6)\n          .split('')\n          .reduce((a, c) => (a * 31 + c.charCodeAt(0)) >>> 0, 0),\n      model: 'campaign-cell',\n      promptHash,\n      configHash,\n      commitSha: 'cell',\n      wallMs: cell.durationMs,\n      costUsd: cell.costUsd,\n      tokenUsage: { input: 0, output: 0 },\n      outcome: {\n        holdoutScore: composite,\n        raw: {},\n        judgeScores,\n      },\n      splitTag: 'holdout',\n      ...(cell.error ? { failureMode: cell.error } : {}),\n    } satisfies RunRecord\n  })\n}\n","import type { RunEvalOptions } from '../campaign/presets/run-eval'\nimport { runEval } from '../campaign/presets/run-eval'\nimport { inMemoryCampaignStorage } from '../campaign/storage'\nimport type {\n  CampaignResult,\n  DispatchContext,\n  JudgeConfig,\n  MutableSurface,\n  Scenario,\n} from '../campaign/types'\nimport type { HostedTenant } from '../hosted/client'\nimport {\n  type SelfImproveBudget,\n  type SelfImproveLlm,\n  type SelfImproveOptions,\n  type SelfImproveResult,\n  selfImprove,\n} from './self-improve'\n\nexport type AgentEvalAgent<TScenario extends Scenario, TArtifact> = (\n  surface: MutableSurface,\n  scenario: TScenario,\n  ctx: DispatchContext,\n) => Promise<TArtifact>\n\nexport type DefineAgentEvalOptions<TScenario extends Scenario, TArtifact> = SelfImproveOptions<\n  TScenario,\n  TArtifact\n>\n\nexport interface AgentEvalEvaluateOptions<TScenario extends Scenario, TArtifact>\n  extends Omit<\n    RunEvalOptions<TScenario, TArtifact>,\n    'dispatch' | 'judges' | 'runDir' | 'scenarios'\n  > {\n  /** Scenario set to evaluate. Defaults to the scenarios passed to `defineAgentEval`. */\n  scenarios?: TScenario[]\n  /** Surface to evaluate. Defaults to the baseline surface passed to `defineAgentEval`. */\n  surface?: MutableSurface\n  /** Agent to evaluate. Defaults to the agent passed to `defineAgentEval`. */\n  agent?: AgentEvalAgent<TScenario, TArtifact>\n  /** Single judge override. Ignored when `judges` is set. */\n  judge?: JudgeConfig<TArtifact, TScenario>\n  /** Full judge list override. Defaults to the single judge passed to `defineAgentEval`. */\n  judges?: JudgeConfig<TArtifact, TScenario>[]\n  /** Logical or filesystem run directory. Defaults to an in-memory run. */\n  runDir?: string\n}\n\nexport type AgentEvalImproveOptions<TScenario extends Scenario, TArtifact> = Omit<\n  Partial<SelfImproveOptions<TScenario, TArtifact>>,\n  'budget' | 'hostedTenant' | 'llm'\n> & {\n  budget?: Partial<SelfImproveBudget>\n  hostedTenant?: Partial<HostedTenant>\n  llm?: Partial<SelfImproveLlm>\n}\n\nexport interface DefinedAgentEval<TScenario extends Scenario, TArtifact> {\n  /** The default scenarios used by `evaluate()` and `improve()`. */\n  readonly scenarios: readonly TScenario[]\n  /** The default baseline surface used by `evaluate()` and `improve()`. */\n  readonly baselineSurface: MutableSurface\n  /**\n   * Run one scored evaluation. Use this for a baseline score or to score one\n   * candidate surface without running an improvement loop.\n   */\n  evaluate(\n    opts?: AgentEvalEvaluateOptions<TScenario, TArtifact>,\n  ): Promise<CampaignResult<TArtifact, TScenario>>\n  /**\n   * Run the closed improvement loop. Per-call overrides replace the definition\n   * except for nested config objects (`budget`, `llm`, `hostedTenant`), which\n   * are merged field-by-field so callers can override one knob without\n   * repeating secrets or budget defaults.\n   */\n  improve(\n    opts?: AgentEvalImproveOptions<TScenario, TArtifact>,\n  ): Promise<SelfImproveResult<TScenario, TArtifact>>\n}\n\n/**\n * Define an agent eval once, then either score a surface with `evaluate()` or\n * run the closed loop with `improve()`.\n *\n * This is a DX wrapper only: it delegates to `runEval()` and `selfImprove()` and\n * returns their native result shapes.\n */\nexport function defineAgentEval<TScenario extends Scenario, TArtifact>(\n  defaults: DefineAgentEvalOptions<TScenario, TArtifact>,\n): DefinedAgentEval<TScenario, TArtifact> {\n  const defaultEvaluateOptions = evaluateDefaults(defaults)\n\n  return {\n    scenarios: defaults.scenarios,\n    baselineSurface: defaults.baselineSurface,\n\n    async evaluate(opts = {}) {\n      const { agent, judge, judges, runDir, scenarios, surface, ...campaignOpts } = opts\n      const selectedAgent = agent ?? defaults.agent\n      const selectedSurface = surface ?? defaults.baselineSurface\n      const selectedRunDir = runDir ?? defaults.runDir ?? `mem://defineAgentEval-${Date.now()}`\n      const selectedStorage =\n        campaignOpts.storage ??\n        defaultEvaluateOptions.storage ??\n        (selectedRunDir.startsWith('mem://') ? inMemoryCampaignStorage() : undefined)\n      const evalOptions: RunEvalOptions<TScenario, TArtifact> = {\n        ...defaultEvaluateOptions,\n        ...campaignOpts,\n        ...(selectedStorage ? { storage: selectedStorage } : {}),\n        runDir: selectedRunDir,\n        scenarios: scenarios ?? defaults.scenarios,\n        dispatch: (scenario, ctx) => selectedAgent(selectedSurface, scenario, ctx),\n        judges: evaluateJudges(judges, judge ?? defaults.judge),\n      }\n      if (evalOptions.reps !== undefined)\n        evalOptions.reps = requirePositiveInteger(evalOptions.reps, 'reps')\n      return runEval<TScenario, TArtifact>(evalOptions)\n    },\n\n    async improve(opts = {}) {\n      const {\n        budget: budgetOverride,\n        hostedTenant: hostedTenantOverride,\n        llm: llmOverride,\n        ...topLevelOverrides\n      } = opts\n      const merged = mergeDefined(defaults, topLevelOverrides)\n      const budget = mergeBudget(defaults.budget, budgetOverride)\n      const llm = mergeLlm(defaults.llm, llmOverride)\n      const hostedTenant = mergeHostedTenant(defaults.hostedTenant, hostedTenantOverride)\n      return selfImprove<TScenario, TArtifact>({\n        ...merged,\n        ...(budget ? { budget } : {}),\n        ...(llm ? { llm } : {}),\n        ...(hostedTenant ? { hostedTenant } : {}),\n      })\n    },\n  }\n}\n\ntype SharedEvaluateDefaults<TScenario extends Scenario, TArtifact> = Omit<\n  RunEvalOptions<TScenario, TArtifact>,\n  'dispatch' | 'judges' | 'runDir' | 'scenarios'\n>\n\nfunction evaluateDefaults<TScenario extends Scenario, TArtifact>(\n  defaults: DefineAgentEvalOptions<TScenario, TArtifact>,\n): SharedEvaluateDefaults<TScenario, TArtifact> {\n  const out: SharedEvaluateDefaults<TScenario, TArtifact> = {}\n  if (defaults.storage) out.storage = defaults.storage\n  if (defaults.labeledStore) out.labeledStore = defaults.labeledStore\n  if (defaults.captureSource) out.captureSource = defaults.captureSource\n  if (defaults.cellPlacement) out.cellPlacement = defaults.cellPlacement\n  if (defaults.expectUsage) out.expectUsage = defaults.expectUsage\n  if (defaults.budget?.dollars !== undefined) out.costCeiling = defaults.budget.dollars\n  if (defaults.budget?.maxConcurrency !== undefined)\n    out.maxConcurrency = defaults.budget.maxConcurrency\n  if (defaults.budget?.reps !== undefined)\n    out.reps = requirePositiveInteger(defaults.budget.reps, 'budget.reps')\n  return out\n}\n\nfunction mergeBudget(\n  defaults: SelfImproveBudget | undefined,\n  overrides: Partial<SelfImproveBudget> | undefined,\n): SelfImproveBudget | undefined {\n  const merged = mergeOptionalObject(defaults, overrides)\n  if (merged?.reps !== undefined) merged.reps = requirePositiveInteger(merged.reps, 'budget.reps')\n  return merged\n}\n\nfunction mergeLlm(\n  defaults: SelfImproveLlm | undefined,\n  overrides: Partial<SelfImproveLlm> | undefined,\n): SelfImproveLlm | undefined {\n  return mergeOptionalObject(defaults, overrides)\n}\n\nfunction mergeHostedTenant(\n  defaults: HostedTenant | undefined,\n  overrides: Partial<HostedTenant> | undefined,\n): HostedTenant | undefined {\n  const merged = mergeOptionalObject(defaults, overrides)\n  if (!merged) return undefined\n  if (!merged.endpoint?.trim() || !merged.apiKey?.trim() || !merged.tenantId?.trim()) {\n    throw new Error(\n      'defineAgentEval.improve: hostedTenant requires endpoint, apiKey, and tenantId after merging defaults and overrides',\n    )\n  }\n  return merged\n}\n\nfunction mergeDefined<T extends object>(defaults: T, overrides: Partial<T> | undefined): T {\n  if (!overrides) return defaults\n  const merged = { ...defaults } as Record<string, unknown>\n  for (const [key, value] of Object.entries(overrides)) {\n    if (value !== undefined) merged[key] = value\n  }\n  return merged as T\n}\n\nfunction mergeOptionalObject<T extends object>(\n  defaults: T | undefined,\n  overrides: Partial<T> | undefined,\n): T | undefined {\n  if (!defaults && !overrides) return undefined\n  return mergeDefined(defaults ?? ({} as T), overrides)\n}\n\nfunction evaluateJudges<TArtifact, TScenario extends Scenario>(\n  judges: JudgeConfig<TArtifact, TScenario>[] | undefined,\n  defaultJudge: JudgeConfig<TArtifact, TScenario>,\n): JudgeConfig<TArtifact, TScenario>[] {\n  if (judges !== undefined) {\n    if (judges.length === 0) {\n      throw new Error('defineAgentEval.evaluate: judges must not be empty')\n    }\n    return judges\n  }\n  return [defaultJudge]\n}\n\nfunction requirePositiveInteger(value: number, field: string): number {\n  if (!Number.isInteger(value) || value < 1) {\n    throw new Error(`defineAgentEval: ${field} must be a positive integer`)\n  }\n  return value\n}\n","/**\n * # `@tangle-network/agent-eval/contract` — eval-run diff primitive.\n *\n * The substrate side of the v-N-versus-v-N+1 dashboard view. Given two\n * `EvalRunEvent`s (or two `EvalRunGenerationSnapshot`s from one run), this\n * returns a normalised diff: per-cell composite + per-judge/per-dimension\n * deltas, surface-hash change, aggregate cost + duration shifts.\n *\n * Consumed by:\n *   - The hosted-tier dashboard (intelligence-web) — renders v3 vs v4\n *     comparisons of cells × judges × dimensions.\n *   - CI reporting — emits a \"shipped: composite +0.07, cost +$1.20\" line\n *     in PR review for autonomous-improvement runs.\n *   - Any downstream consumer that needs \"what actually changed\" without\n *     reimplementing the matching + arithmetic.\n *\n * Cells are matched on the natural composite key `(scenarioId, rep)`.\n * Unmatched cells surface as `removed` / `added` so callers can tell\n * \"this cell got worse\" from \"this cell wasn't run.\"\n */\n\nimport type { GateDecision } from '../campaign/types'\nimport type { EvalRunCellScore, EvalRunEvent, EvalRunGenerationSnapshot } from '../hosted/types'\n\n// ── Types ────────────────────────────────────────────────────────────\n\n/** Per-dimension delta. `before` / `after` are null when the judge did not\n *  emit a value for that side. `delta` is `after - before`; null when\n *  either side is null. */\nexport interface EvalDimensionDelta {\n  before: number | null\n  after: number | null\n  delta: number | null\n}\n\n/** Per-cell delta, keyed on `(scenarioId, rep)`. */\nexport interface EvalCellScoreDelta {\n  scenarioId: string\n  rep: number\n  compositeBefore: number\n  compositeAfter: number\n  compositeDelta: number\n  /** Per-judge → per-dimension deltas. Outer key = judge name from\n   *  `EvalRunCellScore.dimensions`; inner key = dimension name. */\n  dimensions: Record<string, Record<string, EvalDimensionDelta>>\n}\n\n/** Diff between two generation snapshots — the unit the dashboard renders\n *  for a single \"v3 vs v4\" comparison. */\nexport interface EvalGenerationDiff {\n  beforeIndex: number\n  afterIndex: number\n  beforeSurfaceHash: string\n  afterSurfaceHash: string\n  surfaceChanged: boolean\n  /** Cells present in both snapshots, matched on `(scenarioId, rep)`. */\n  matched: EvalCellScoreDelta[]\n  /** Cells present in `before` but missing from `after`. */\n  removed: EvalRunCellScore[]\n  /** Cells present in `after` but missing from `before`. */\n  added: EvalRunCellScore[]\n  /** Aggregate composite mean across all cells in the snapshot. */\n  compositeBefore: number\n  compositeAfter: number\n  compositeDelta: number\n  costUsdBefore: number\n  costUsdAfter: number\n  costUsdDelta: number\n  durationMsBefore: number\n  durationMsAfter: number\n  durationMsDelta: number\n}\n\n/** Diff between two full eval-runs. Includes both baseline-vs-baseline and\n *  winner-vs-winner generation diffs when both sides expose them, plus\n *  run-level metadata. */\nexport interface EvalRunDiff {\n  beforeRunId: string\n  afterRunId: string\n  beforeTimestamp: string\n  afterTimestamp: string\n  beforeGateDecision: GateDecision | null\n  afterGateDecision: GateDecision | null\n  beforeHoldoutLift: number | null\n  afterHoldoutLift: number | null\n  holdoutLiftDelta: number | null\n  beforeTotalCostUsd: number\n  afterTotalCostUsd: number\n  totalCostUsdDelta: number\n  beforeTotalDurationMs: number\n  afterTotalDurationMs: number\n  totalDurationMsDelta: number\n  /** Baseline-vs-baseline diff. Null when either run has no baseline. */\n  baselineDiff: EvalGenerationDiff | null\n  /** Highest-index-generation comparison. Null when either run has no\n   *  recorded generations (e.g. baseline-only or errored before any\n   *  generation completed). */\n  winnersDiff: EvalGenerationDiff | null\n}\n\n// ── Implementation ───────────────────────────────────────────────────\n\nfunction keyForCell(cell: EvalRunCellScore): string {\n  // JSON-tuple key — `scenarioId` may legitimately contain `::` or any other\n  // delimiter, so we use JSON.stringify on a 2-tuple to get an unambiguous,\n  // collision-free composite key.\n  return JSON.stringify([cell.scenarioId, cell.rep])\n}\n\n/** Build the per-dimension delta map for a matched cell. Each judge name +\n *  dimension name encountered on EITHER side appears in the result. */\nfunction diffDimensions(\n  before: EvalRunCellScore['dimensions'],\n  after: EvalRunCellScore['dimensions'],\n): EvalCellScoreDelta['dimensions'] {\n  const out: EvalCellScoreDelta['dimensions'] = {}\n  const judges = new Set<string>([...Object.keys(before), ...Object.keys(after)])\n  for (const judge of judges) {\n    const beforeDims = before[judge] ?? {}\n    const afterDims = after[judge] ?? {}\n    const dims = new Set<string>([...Object.keys(beforeDims), ...Object.keys(afterDims)])\n    const judgeOut: Record<string, EvalDimensionDelta> = {}\n    for (const dim of dims) {\n      // Coerce non-finite values (NaN, ±Infinity) to null so the diff never\n      // surfaces NaN/Infinity to the dashboard. A NaN score is a substrate\n      // bug from upstream; the diff treats it as \"no value\" rather than\n      // propagating the corruption.\n      const rawBefore = beforeDims[dim]\n      const rawAfter = afterDims[dim]\n      const b = typeof rawBefore === 'number' && Number.isFinite(rawBefore) ? rawBefore : null\n      const a = typeof rawAfter === 'number' && Number.isFinite(rawAfter) ? rawAfter : null\n      judgeOut[dim] = {\n        before: b,\n        after: a,\n        delta: b !== null && a !== null ? a - b : null,\n      }\n    }\n    out[judge] = judgeOut\n  }\n  return out\n}\n\n/**\n * Diff two generation snapshots. Cells are matched on `(scenarioId, rep)`;\n * unmatched cells surface in `added` / `removed`. Aggregate fields are\n * recomputed from the snapshot's stored fields, not re-derived from cells —\n * this keeps the diff consistent with whatever aggregation the substrate\n * actually reported.\n */\nexport function diffGenerations(\n  before: EvalRunGenerationSnapshot,\n  after: EvalRunGenerationSnapshot,\n): EvalGenerationDiff {\n  const beforeMap = new Map(before.cells.map((c) => [keyForCell(c), c]))\n  const afterMap = new Map(after.cells.map((c) => [keyForCell(c), c]))\n\n  const matched: EvalCellScoreDelta[] = []\n  const removed: EvalRunCellScore[] = []\n  const added: EvalRunCellScore[] = []\n\n  for (const [key, beforeCell] of beforeMap) {\n    const afterCell = afterMap.get(key)\n    if (!afterCell) {\n      removed.push(beforeCell)\n      continue\n    }\n    matched.push({\n      scenarioId: beforeCell.scenarioId,\n      rep: beforeCell.rep,\n      compositeBefore: beforeCell.compositeMean,\n      compositeAfter: afterCell.compositeMean,\n      compositeDelta: afterCell.compositeMean - beforeCell.compositeMean,\n      dimensions: diffDimensions(beforeCell.dimensions, afterCell.dimensions),\n    })\n  }\n  for (const [key, afterCell] of afterMap) {\n    if (!beforeMap.has(key)) added.push(afterCell)\n  }\n\n  return {\n    beforeIndex: before.index,\n    afterIndex: after.index,\n    beforeSurfaceHash: before.surfaceHash,\n    afterSurfaceHash: after.surfaceHash,\n    surfaceChanged: before.surfaceHash !== after.surfaceHash,\n    matched,\n    removed,\n    added,\n    compositeBefore: before.compositeMean,\n    compositeAfter: after.compositeMean,\n    compositeDelta: after.compositeMean - before.compositeMean,\n    costUsdBefore: before.costUsd,\n    costUsdAfter: after.costUsd,\n    costUsdDelta: after.costUsd - before.costUsd,\n    durationMsBefore: before.durationMs,\n    durationMsAfter: after.durationMs,\n    durationMsDelta: after.durationMs - before.durationMs,\n  }\n}\n\n/** Highest-index generation, or null if the run recorded none. */\nfunction winnerOf(run: EvalRunEvent): EvalRunGenerationSnapshot | null {\n  if (run.generations.length === 0) return null\n  let winner = run.generations[0] as EvalRunGenerationSnapshot\n  for (const gen of run.generations) {\n    if (gen.index > winner.index) winner = gen\n  }\n  return winner\n}\n\n/**\n * Diff two full eval-runs. Produces baseline-vs-baseline and\n * winner-vs-winner generation diffs when both sides expose them, plus\n * run-level cost / lift / gate-decision deltas.\n */\nexport function diffRuns(before: EvalRunEvent, after: EvalRunEvent): EvalRunDiff {\n  const beforeWinner = winnerOf(before)\n  const afterWinner = winnerOf(after)\n  const baselineDiff =\n    before.baseline && after.baseline ? diffGenerations(before.baseline, after.baseline) : null\n  const winnersDiff =\n    beforeWinner && afterWinner ? diffGenerations(beforeWinner, afterWinner) : null\n\n  const beforeLift = before.holdoutLift ?? null\n  const afterLift = after.holdoutLift ?? null\n\n  return {\n    beforeRunId: before.runId,\n    afterRunId: after.runId,\n    beforeTimestamp: before.timestamp,\n    afterTimestamp: after.timestamp,\n    beforeGateDecision: before.gateDecision ?? null,\n    afterGateDecision: after.gateDecision ?? null,\n    beforeHoldoutLift: beforeLift,\n    afterHoldoutLift: afterLift,\n    holdoutLiftDelta: beforeLift !== null && afterLift !== null ? afterLift - beforeLift : null,\n    beforeTotalCostUsd: before.totalCostUsd,\n    afterTotalCostUsd: after.totalCostUsd,\n    totalCostUsdDelta: after.totalCostUsd - before.totalCostUsd,\n    beforeTotalDurationMs: before.totalDurationMs,\n    afterTotalDurationMs: after.totalDurationMs,\n    totalDurationMsDelta: after.totalDurationMs - before.totalDurationMs,\n    baselineDiff,\n    winnersDiff,\n  }\n}\n\n/**\n * Within-run baseline → winning-generation diff. The natural \"what did the\n * improvement loop produce\" view for a single run. Returns null when the\n * run never reached a generation past baseline (errored early, or the gate\n * shipped the baseline as-is).\n */\nexport function diffRunBaselineToWinner(run: EvalRunEvent): EvalGenerationDiff | null {\n  if (!run.baseline) return null\n  const winner = winnerOf(run)\n  if (!winner || winner.index === run.baseline.index) return null\n  return diffGenerations(run.baseline, winner)\n}\n","/**\n * `fromAgentTrace` — provenance correlation from Cursor's Agent Trace spec\n * (https://github.com/cursor/agent-trace, RFC v0.1.0).\n *\n * Agent Trace is NOT a run/quality trace — it carries no outcome, score, or\n * cost. It records *code authorship*: for a VCS revision, which AI model /\n * conversation authored which file ranges. It explicitly disclaims quality\n * assessment — which is exactly what `analyzeRuns` adds.\n *\n * The two layers join on a key the substrate already has: a `RunRecord`\n * carries `commitSha`, and an Agent Trace record is keyed by\n * `vcs.revision`. So this adapter does not produce `RunRecord`s — it builds a\n * provenance index by commit and partitions existing runs by their authoring\n * model. Feed each cohort to `analyzeRuns` (or pass one as `baselineRuns`) to\n * answer the question no run-only trace can: *which authoring agent's code\n * fails / regresses / costs more.*\n *\n * Granularity is commit-level (the SHA join). Per-file/per-line correlation\n * would require runs to record which files they exercised — out of scope.\n */\n\nimport type { RunRecord } from '../../run-record'\n\n// ── Agent Trace record schema (the subset we read) ──────────────────────────\n\nexport type AgentTraceContributorType = 'human' | 'ai' | 'mixed' | 'unknown'\n\nexport interface AgentTraceContributor {\n  type: AgentTraceContributorType\n  /** models.dev id, e.g. `anthropic/claude-opus-4-5-20251101`. */\n  model_id?: string\n}\n\nexport interface AgentTraceRange {\n  start_line: number\n  end_line: number\n  content_hash?: string\n  /** Per-range contributor override (agent handoffs). Wins over the\n   *  conversation-level contributor for these lines. */\n  contributor?: AgentTraceContributor\n}\n\nexport interface AgentTraceConversation {\n  url?: string\n  contributor?: AgentTraceContributor\n  ranges: AgentTraceRange[]\n}\n\nexport interface AgentTraceFile {\n  path: string\n  conversations: AgentTraceConversation[]\n}\n\nexport interface AgentTraceRecord {\n  version: string\n  id: string\n  timestamp: string\n  vcs?: { type: string; revision: string }\n  tool?: { name?: string; version?: string }\n  files: AgentTraceFile[]\n}\n\n// ── Provenance index ─────────────────────────────────────────────────────────\n\n/** Authorship provenance for one VCS revision, aggregated across the record's\n *  files/conversations/ranges. */\nexport interface AuthoringProvenance {\n  commitSha: string\n  /** Unique AI model ids that authored code in this commit (type ai|mixed). */\n  aiModels: string[]\n  /** Tools that produced the records (e.g. `cursor`). */\n  tools: string[]\n  conversationCount: number\n  fileCount: number\n  /** Total attributed lines (sum of range spans). */\n  lineCount: number\n  /** True if any range was authored (in whole or part) by a human. */\n  humanInvolved: boolean\n}\n\nexport type AgentTraceIndex = Map<string, AuthoringProvenance>\n\nfunction rangeLines(r: AgentTraceRange): number {\n  return Math.max(0, r.end_line - r.start_line + 1)\n}\n\n/**\n * Build a commit → provenance index from Agent Trace records. Multiple records\n * for the same revision are merged. Records without `vcs.revision` are skipped\n * (the SHA is the join key — without it there is nothing to correlate against).\n */\nexport function parseAgentTrace(records: AgentTraceRecord[]): AgentTraceIndex {\n  interface Acc {\n    models: Set<string>\n    tools: Set<string>\n    files: Set<string>\n    conversationCount: number\n    lineCount: number\n    humanInvolved: boolean\n  }\n  const acc = new Map<string, Acc>()\n\n  for (const record of records) {\n    const sha = record.vcs?.revision\n    if (!sha) continue // the SHA is the join key — nothing to correlate without it\n\n    let a = acc.get(sha)\n    if (!a) {\n      a = {\n        models: new Set(),\n        tools: new Set(),\n        files: new Set(),\n        conversationCount: 0,\n        lineCount: 0,\n        humanInvolved: false,\n      }\n      acc.set(sha, a)\n    }\n\n    if (record.tool?.name) a.tools.add(record.tool.name)\n\n    for (const file of record.files ?? []) {\n      a.files.add(file.path)\n      for (const conv of file.conversations ?? []) {\n        a.conversationCount += 1\n        for (const range of conv.ranges ?? []) {\n          // Per-range contributor wins, else the conversation contributor.\n          const contributor = range.contributor ?? conv.contributor\n          a.lineCount += rangeLines(range)\n          if (!contributor) continue\n          if (contributor.type === 'human' || contributor.type === 'mixed') {\n            a.humanInvolved = true\n          }\n          if ((contributor.type === 'ai' || contributor.type === 'mixed') && contributor.model_id) {\n            a.models.add(contributor.model_id)\n          }\n        }\n      }\n    }\n  }\n\n  const index: AgentTraceIndex = new Map()\n  for (const [sha, a] of acc) {\n    index.set(sha, {\n      commitSha: sha,\n      aiModels: [...a.models].sort(),\n      tools: [...a.tools].sort(),\n      conversationCount: a.conversationCount,\n      fileCount: a.files.size,\n      lineCount: a.lineCount,\n      humanInvolved: a.humanInvolved,\n    })\n  }\n  return index\n}\n\n// ── Run ↔ provenance join ──────────────────────────────────────────────────\n\nexport interface PartitionByAuthoringModelResult {\n  /** Runs grouped by each AI model that authored code in the run's commit. A\n   *  run whose commit had multiple authoring models appears under EACH — the\n   *  cohorts overlap by construction at commit granularity. */\n  byModel: Map<string, RunRecord[]>\n  /** Runs whose `commitSha` had no Agent Trace provenance (no record, or no\n   *  AI authorship). Kept separate — never silently folded into a cohort. */\n  unattributed: RunRecord[]\n}\n\n/**\n * Partition runs by the AI model(s) that authored the code at each run's\n * `commitSha`. Feed `byModel.get(modelId)` to `analyzeRuns`, or compare two\n * model cohorts via `analyzeRuns({ runs: a, baselineRuns: b })` for a lift CI\n * on \"model A's code vs model B's code\".\n */\nexport function partitionRunsByAuthoringModel(\n  runs: RunRecord[],\n  index: AgentTraceIndex,\n): PartitionByAuthoringModelResult {\n  const byModel = new Map<string, RunRecord[]>()\n  const unattributed: RunRecord[] = []\n\n  for (const run of runs) {\n    const provenance = index.get(run.commitSha)\n    if (!provenance || provenance.aiModels.length === 0) {\n      unattributed.push(run)\n      continue\n    }\n    for (const model of provenance.aiModels) {\n      const cohort = byModel.get(model) ?? []\n      cohort.push(run)\n      byModel.set(model, cohort)\n    }\n  }\n\n  return { byModel, unattributed }\n}\n","/**\n * # `intake/feedback-table` — multi-rater approve/reject corpus → `RunRecord[]`.\n *\n * The generic shape behind Obsidian's `#approved` / `#rejected` tags, a\n * Google Sheet, a Postgres `feedback` table, or any CSV with ratings.\n *\n * Caller supplies one row per (run, rater) tuple plus per-run metadata; the\n * adapter rolls them up into the substrate-canonical `RunRecord` shape so\n * `analyzeRuns({ runs, raterScores })` can produce inter-rater agreement,\n * disagreement triage, and downstream recommendations.\n *\n * Per-run `RunRecord.outcome.searchScore` is the rater-mean rating\n * (normalised to 0..1 when scale is supplied); `outcome.raw` carries the\n * per-rater scores keyed by rater id for downstream attribution.\n */\n\nimport type { JudgeScoresRecord, RunOutcome, RunRecord, RunSplitTag } from '../../run-record'\n\nexport interface FeedbackTableRow {\n  /** Stable id for this run — the unit a rater scored. Drives pairing\n   *  across analysis primitives. */\n  runId: string\n  /** Identifier of the rater that produced this rating. */\n  rater: string\n  /** The rating itself. Accepts boolean (approve/reject), 0..1 scalar,\n   *  or any numeric scale — see `scale`. */\n  rating: number | boolean\n  /** Optional metadata carried through to `RunRecord.outcome.raw` and the\n   *  custom-shape metadata bag. */\n  metadata?: Record<string, unknown>\n}\n\nexport interface FeedbackTableMeta {\n  runId: string\n  /** When omitted, defaults to `'feedback-corpus'`. Used to group related\n   *  runs in `analyzeRuns()` lift analysis. */\n  experimentId?: string\n  /** When omitted, defaults to `runId` — each run is its own candidate. */\n  candidateId?: string\n  /** Cost in USD, when available. Set to 0 when unknown — the consumer's\n   *  cost analysis sections will collapse gracefully. */\n  costUsd?: number\n  /** Wall-clock ms, when available. Defaults to 0. */\n  wallMs?: number\n  /** Model identifier including snapshot. Default `unknown@unknown`. */\n  model?: string\n  /** Optional sha256 of the prompt; default `'sha256:unknown'`. */\n  promptHash?: string\n  /** Default `'sha256:unknown'`. */\n  configHash?: string\n  /** Default `'unknown'`. */\n  commitSha?: string\n  /** Default `'holdout'` — feedback corpora are by nature the holdout\n   *  signal a closed-loop improvement aims at. */\n  splitTag?: RunSplitTag\n  /** Free-form metadata available to consumers via the cast-out path on\n   *  the resulting RunRecord. */\n  extras?: Record<string, unknown>\n}\n\nexport interface FromFeedbackTableOptions {\n  /** Per-(run, rater) ratings. */\n  ratings: FeedbackTableRow[]\n  /** Per-run metadata. When a runId appears in `ratings` but not here, the\n   *  adapter synthesises minimal metadata with defaults documented above. */\n  meta?: FeedbackTableMeta[]\n  /** Rating scale. Provide `{ min, max }` for non-0..1 numeric scales.\n   *  Booleans are normalised: true → 1, false → 0. Default: assumes\n   *  ratings are already 0..1. */\n  scale?: { min: number; max: number }\n  /** When true, the rater scores are emitted into `raterScores` (a sibling\n   *  array `analyzeRuns()` accepts) instead of being averaged into the\n   *  run's `outcome.searchScore`. Default `true` — preserves rater-level\n   *  signal for inter-rater analysis. */\n  emitRaterScores?: boolean\n}\n\nexport interface FromFeedbackTableResult {\n  runs: RunRecord[]\n  /** Rater-level scores ready to pass into `analyzeRuns({ raterScores })`\n   *  for inter-rater agreement + disagreement triage. */\n  raterScores: Array<{ runId: string; rater: string; score: number }>\n}\n\nexport function fromFeedbackTable(opts: FromFeedbackTableOptions): FromFeedbackTableResult {\n  const { ratings, meta = [], scale, emitRaterScores = true } = opts\n  const metaByRun = new Map(meta.map((m) => [m.runId, m]))\n\n  // Normalise per-rating to a 0..1 score.\n  const normalise = (rating: number | boolean): number => {\n    if (typeof rating === 'boolean') return rating ? 1 : 0\n    if (!Number.isFinite(rating)) return Number.NaN\n    if (!scale) return rating\n    const { min, max } = scale\n    if (max === min) return rating\n    return (rating - min) / (max - min)\n  }\n\n  // Group ratings by runId.\n  const byRun = new Map<string, FeedbackTableRow[]>()\n  for (const row of ratings) {\n    const list = byRun.get(row.runId) ?? []\n    list.push(row)\n    byRun.set(row.runId, list)\n  }\n\n  const runs: RunRecord[] = []\n  const raterScores: FromFeedbackTableResult['raterScores'] = []\n\n  for (const [runId, rowsForRun] of byRun) {\n    const normalised = rowsForRun\n      .map((r) => ({ rater: r.rater, score: normalise(r.rating) }))\n      .filter((r) => Number.isFinite(r.score))\n    if (normalised.length === 0) continue\n\n    const meanScore = normalised.reduce((s, r) => s + r.score, 0) / normalised.length\n\n    const runMeta = metaByRun.get(runId) ?? ({ runId } as FeedbackTableMeta)\n\n    const judgeScores: JudgeScoresRecord = {\n      perJudge: Object.fromEntries(normalised.map((r) => [r.rater, { rating: r.score }])),\n      perDimMean: { rating: meanScore },\n      composite: meanScore,\n    }\n\n    const outcome: RunOutcome = {\n      // Feedback corpora ARE the holdout signal — score lands on\n      // `holdoutScore` so downstream substrate primitives (`paretoChart`,\n      // promotion gates) read it correctly by default.\n      holdoutScore: meanScore,\n      raw: Object.fromEntries(normalised.map((r) => [`rater:${r.rater}`, r.score])),\n      judgeScores,\n    }\n\n    runs.push({\n      runId,\n      experimentId: runMeta.experimentId ?? 'feedback-corpus',\n      candidateId: runMeta.candidateId ?? runId,\n      seed: 0,\n      model: runMeta.model ?? 'unknown@unknown',\n      promptHash: runMeta.promptHash ?? 'sha256:unknown',\n      configHash: runMeta.configHash ?? 'sha256:unknown',\n      commitSha: runMeta.commitSha ?? 'unknown',\n      wallMs: runMeta.wallMs ?? 0,\n      costUsd: runMeta.costUsd ?? 0,\n      tokenUsage: { input: 0, output: 0 },\n      outcome,\n      splitTag: runMeta.splitTag ?? 'holdout',\n    } as RunRecord)\n\n    if (emitRaterScores) {\n      for (const r of normalised) raterScores.push({ runId, rater: r.rater, score: r.score })\n    }\n  }\n\n  return { runs, raterScores }\n}\n","/**\n * # `intake/otel-spans` — OTel `TraceSpanEvent[]` → `RunRecord[]`.\n *\n * Turns an existing observability stream into the substrate-canonical\n * `RunRecord` shape so consumers with logs but no eval discipline can\n * call `analyzeRuns()` against their production traffic immediately.\n *\n * Pivot rule: spans are grouped by `tangle.runId` (the same attribute the\n * hosted-tier wire format uses) or, when absent, by `traceId`. One group\n * becomes one `RunRecord`. The root span (no `parentSpanId`) supplies:\n *\n *   - `runId` (the group key)\n *   - `wallMs` from `endTimeUnixNano - startTimeUnixNano`\n *   - `model` from `gen_ai.request.model` / `llm.model` / `tangle.model`\n *   - cost from `cost.usd` / `gen_ai.usage.cost_usd` / `tangle.cost.usd`\n *   - token usage from `gen_ai.usage.{input,output}_tokens`\n *   - `outcome.searchScore` from `tangle.score` / `eval.score` when\n *     present; `outcome.raw` collects every numeric attribute.\n *\n * Spans that ERRORed (`status.code === 'ERROR'`) populate `failureMode`\n * with their `name` so `analyzeRuns()`'s failure clustering sees them.\n */\n\nimport type { TraceSpanEvent } from '../../hosted/types'\nimport type {\n  JudgeScoresRecord,\n  RunOutcome,\n  RunRecord,\n  RunSplitTag,\n  RunTokenUsage,\n} from '../../run-record'\nimport {\n  LLM_INPUT_TOKEN_ATTR_KEYS,\n  LLM_MODEL_ATTR_KEYS,\n  LLM_OUTPUT_TOKEN_ATTR_KEYS,\n} from '../../trace/otlp-attributes'\n\nconst SCORE_KEYS = ['tangle.score', 'eval.score', 'score']\nconst MODEL_KEYS = ['tangle.model', ...LLM_MODEL_ATTR_KEYS, 'model']\nconst COST_KEYS = ['tangle.cost.usd', 'gen_ai.usage.cost_usd', 'cost.usd', 'cost']\nconst INPUT_TOKEN_KEYS = [...LLM_INPUT_TOKEN_ATTR_KEYS, 'tangle.tokens.in', 'tokens.in']\nconst OUTPUT_TOKEN_KEYS = [...LLM_OUTPUT_TOKEN_ATTR_KEYS, 'tangle.tokens.out', 'tokens.out']\nconst PROMPT_HASH_KEYS = ['tangle.prompt_hash', 'prompt.hash']\nconst CONFIG_HASH_KEYS = ['tangle.config_hash', 'config.hash']\n\nexport interface FromOtelSpansOptions {\n  spans: TraceSpanEvent[]\n  /** Default split tag for synthesized records. Defaults to `'holdout'`. */\n  defaultSplit?: RunSplitTag\n  /** Default `experimentId` when not present on any span. */\n  experimentId?: string\n}\n\nexport function fromOtelSpans(opts: FromOtelSpansOptions): RunRecord[] {\n  const { spans, defaultSplit = 'holdout', experimentId = 'otel-corpus' } = opts\n  const grouped = groupSpans(spans)\n\n  const runs: RunRecord[] = []\n  for (const [groupKey, groupSpans] of grouped) {\n    const root = findRoot(groupSpans)\n    if (!root) continue\n\n    const wallMs = Math.max(0, (root.endTimeUnixNano - root.startTimeUnixNano) / 1_000_000)\n    const model = readAttrString(groupSpans, MODEL_KEYS) ?? 'unknown@unknown'\n    const costUsd = readAttrNumber(groupSpans, COST_KEYS) ?? 0\n    const inputTokens = readAttrNumber(groupSpans, INPUT_TOKEN_KEYS) ?? 0\n    const outputTokens = readAttrNumber(groupSpans, OUTPUT_TOKEN_KEYS) ?? 0\n    const promptHash = readAttrString(groupSpans, PROMPT_HASH_KEYS) ?? 'sha256:unknown'\n    const configHash = readAttrString(groupSpans, CONFIG_HASH_KEYS) ?? 'sha256:unknown'\n    const score = readAttrNumber(groupSpans, SCORE_KEYS)\n\n    const rawNumeric = collectNumericAttrs(groupSpans)\n    const tokenUsage: RunTokenUsage = {\n      input: inputTokens,\n      output: outputTokens,\n    }\n\n    const judgeScores: JudgeScoresRecord | undefined =\n      score !== undefined\n        ? {\n            perJudge: { 'otel-derived': { score } },\n            perDimMean: { score },\n            composite: score,\n          }\n        : undefined\n\n    const errorSpan = groupSpans.find((s) => s.status?.code === 'ERROR')\n    const outcome: RunOutcome = {\n      ...(opts.defaultSplit === 'search' ? { searchScore: score } : { holdoutScore: score }),\n      raw: rawNumeric,\n      ...(judgeScores ? { judgeScores } : {}),\n    }\n\n    runs.push({\n      runId: groupKey,\n      experimentId,\n      candidateId: (root.attributes['tangle.candidateId'] as string | undefined) ?? 'otel-default',\n      seed: 0,\n      model,\n      promptHash,\n      configHash,\n      commitSha: (root.attributes['tangle.commit_sha'] as string | undefined) ?? 'unknown',\n      wallMs,\n      costUsd,\n      tokenUsage,\n      outcome,\n      splitTag: defaultSplit,\n      ...(errorSpan ? { failureMode: errorSpan.name } : {}),\n    } as RunRecord)\n  }\n  return runs\n}\n\n// ── Internal helpers ────────────────────────────────────────────────\n\nfunction groupSpans(spans: TraceSpanEvent[]): Map<string, TraceSpanEvent[]> {\n  const m = new Map<string, TraceSpanEvent[]>()\n  for (const span of spans) {\n    const key = (span['tangle.runId'] as string | undefined) ?? span.traceId\n    const list = m.get(key) ?? []\n    list.push(span)\n    m.set(key, list)\n  }\n  return m\n}\n\nfunction findRoot(group: TraceSpanEvent[]): TraceSpanEvent | undefined {\n  return group.find((s) => !s.parentSpanId) ?? group[0]\n}\n\nfunction readAttrString(spans: TraceSpanEvent[], keys: string[]): string | undefined {\n  for (const span of spans) {\n    for (const key of keys) {\n      const v = span.attributes[key]\n      if (typeof v === 'string' && v.length > 0) return v\n    }\n  }\n  return undefined\n}\n\nfunction readAttrNumber(spans: TraceSpanEvent[], keys: string[]): number | undefined {\n  for (const span of spans) {\n    for (const key of keys) {\n      const v = span.attributes[key]\n      if (typeof v === 'number' && Number.isFinite(v)) return v\n      if (typeof v === 'string') {\n        const parsed = Number(v)\n        if (Number.isFinite(parsed)) return parsed\n      }\n    }\n  }\n  return undefined\n}\n\nfunction collectNumericAttrs(spans: TraceSpanEvent[]): Record<string, number> {\n  const raw: Record<string, number> = {}\n  for (const span of spans) {\n    for (const [k, v] of Object.entries(span.attributes)) {\n      if (typeof v === 'number' && Number.isFinite(v)) raw[k] = v\n    }\n  }\n  return raw\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwBA,SAAS,kBAAkB;AAoR3B,SAAS,kBACP,WACA,UAC8C;AAE9C,WAAS,KAAK,GAAmB;AAC/B,QAAI,IAAI,eAAe;AACvB,aAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,WAAK,EAAE,WAAW,CAAC;AACnB,UAAI,KAAK,KAAK,GAAG,QAAQ,MAAM;AAAA,IACjC;AACA,WAAO;AAAA,EACT;AACA,QAAM,SAAS,CAAC,GAAG,SAAS,EAAE,KAAK,CAAC,GAAG,MAAM,KAAK,EAAE,EAAE,IAAI,KAAK,EAAE,EAAE,CAAC;AACpE,QAAM,WAAW,KAAK,IAAI,GAAG,KAAK,IAAI,OAAO,SAAS,GAAG,KAAK,MAAM,OAAO,SAAS,QAAQ,CAAC,CAAC;AAC9F,SAAO;AAAA,IACL,SAAS,OAAO,MAAM,GAAG,QAAQ;AAAA,IACjC,OAAO,OAAO,MAAM,QAAQ;AAAA,EAC9B;AACF;AAEA,SAAS,cAAc,YAGrB;AACA,QAAM,cAAsC,CAAC;AAC7C,QAAM,SAAmB,CAAC;AAC1B,aAAW,CAAC,IAAI,GAAG,KAAK,OAAO,QAAQ,UAAU,GAAG;AAClD,gBAAY,EAAE,IAAI,IAAI;AACtB,WAAO,KAAK,IAAI,aAAa;AAAA,EAC/B;AACA,SAAO;AAAA,IACL,eAAe,OAAO,WAAW,IAAI,IAAI,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,OAAO;AAAA,IACpF;AAAA,EACF;AACF;AAEA,IAAM,8BAA8B;AAAA,EAClC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AA2BA,eAAsB,YACpB,MACkD;AAClD,QAAM,YAAY,KAAK,IAAI;AAE3B,QAAM,SAAS,KAAK,UAAU,CAAC;AAC/B,QAAM,cAAc,OAAO,eAAe;AAC1C,QAAM,iBAAiB,OAAO,kBAAkB;AAChD,QAAM,iBAAiB,OAAO,kBAAkB;AAChD,QAAM,kBAAkB,OAAO,mBAAmB;AAClD,QAAM,cAAc,OAAO;AAC3B,QAAM,cAAc,KAAK,eAAe;AAExC,QAAM,kBAAkB,OAAO;AAC/B,QAAM,EAAE,OAAO,QAAQ,IAAI,kBACvB;AAAA,IACE,OAAO,KAAK,UAAU,OAAO,CAAC,MAAM,CAAC,gBAAgB,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,CAAC;AAAA,IAC/E,SAAS;AAAA,EACX,IACA,kBAAkB,KAAK,WAAW,eAAe;AAErD,MAAI,MAAM,WAAW,GAAG;AACtB,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACA,MAAI,QAAQ,WAAW,GAAG;AACxB,UAAM,IAAI,MAAM,2DAA2D;AAAA,EAC7E;AAEA,QAAM,WACJ,KAAK,YACL,aAAa;AAAA,IACX,KAAK;AAAA,MACH,SAAS,KAAK,KAAK,WAAW;AAAA,MAC9B,QAAQ,KAAK,KAAK,UAAU,QAAQ,IAAI,kBAAkB;AAAA,IAC5D;AAAA,IACA,OAAO,KAAK,KAAK,SAAS;AAAA,IAC1B,QACE,KAAK,kBACL;AAAA,IACF,oBAAoB,KAAK,sBAAsB;AAAA,EACjD,CAAC;AAEH,QAAM,OACJ,KAAK,QACL,sBAA4C;AAAA,IAC1C,kBAAkB;AAAA,IAClB,gBAAgB;AAAA,EAClB,CAAC;AAMH,QAAM,SAAS,KAAK,UAAU,qBAAqB,SAAS;AAC5D,QAAM,cAAc,OAAO,WAAW,QAAQ;AAC9C,QAAM,UAAU,KAAK,YAAY,cAAc,wBAAwB,IAAI,kBAAkB;AAE7F,MAAI,KAAK,YAAY;AACnB,SAAK,WAAW,EAAE,MAAM,oBAAoB,WAAW,KAAK,UAAU,OAAO,CAAC;AAAA,EAChF;AAEA,QAAM,SAAS,MAAM,mBAAyC;AAAA,IAC5D,WAAW;AAAA,IACX,iBAAiB,KAAK;AAAA,IACtB,qBAAqB,KAAK;AAAA,IAC1B;AAAA,IACA,QAAQ,CAAC,KAAK,KAAK;AAAA,IACnB;AAAA,IACA,gBAAgB;AAAA,IAChB,aAAa,OAAO;AAAA,IACpB,MAAM,OAAO;AAAA,IACb,kBAAkB;AAAA,IAClB;AAAA,IACA,eAAe,KAAK,iBAAiB;AAAA,IACrC,SAAS,KAAK;AAAA,IACd,QAAQ,KAAK;AAAA,IACb;AAAA,IACA;AAAA,IACA;AAAA,IACA,eAAe,KAAK;AAAA,IACpB;AAAA,IACA;AAAA,IACA,cAAc,KAAK;AAAA,IACnB,eAAe,KAAK;AAAA,IACpB,mBAAmB,KAAK;AAAA,IACxB,UAAU,KAAK;AAAA,EACjB,CAAC;AAED,QAAM,WAAW,cAAc,OAAO,kBAAkB,WAAW,UAAU;AAC7E,QAAM,cAAc,cAAc,OAAO,gBAAgB,WAAW,UAAU;AAE9E,MAAI,KAAK,YAAY;AACnB,SAAK,WAAW;AAAA,MACd,MAAM;AAAA,MACN,eAAe,SAAS;AAAA,MACxB,YAAY,KAAK,IAAI,IAAI;AAAA,IAC3B,CAAC;AACD,SAAK,WAAW;AAAA,MACd,MAAM;AAAA,MACN,UAAU,OAAO,WAAW;AAAA,MAC5B,MAAM,YAAY,gBAAgB,SAAS;AAAA,IAC7C,CAAC;AAAA,EACH;AAEA,QAAM,YACJ,OAAO,iBAAiB,WAAW,eACnC,OAAO,YAAY;AAAA,IACjB,CAAC,KAAK,QACJ,MAAM,IAAI,SAAS,OAAO,CAAC,GAAG,OAAO,IAAI,GAAG,SAAS,WAAW,cAAc,CAAC;AAAA,IACjF;AAAA,EACF;AAMF,QAAM,UAAU,MAAM,YAAY;AAAA,IAChC,MAAM;AAAA,MACJ,GAAG,kBAAkB,OAAO,iBAAiB,OAAO,YAAY,QAAQ,KAAK,eAAe;AAAA,MAC5F,GAAG,kBAAkB,OAAO,gBAAgB,OAAO,UAAU,QAAQ,OAAO,aAAa;AAAA,IAC3F;AAAA,IACA,qBAAqB;AAAA,IACrB,sBAAsB;AAAA,EACxB,CAAC;AAID,QAAM,aAAa,KAAK,IAAI,IAAI;AAChC,QAAM,gBACJ,KAAK,uBAAuB,KAC5B,kBAAkB,OAAO,gBAAgB,OAAO,UAAU,QAAQ,OAAO,aAAa;AACxF,QAAM,EAAE,QAAQ,WAAW,IAAI,MAAM,mBAAyC;AAAA,IAC5E,OAAO,GAAG,MAAM,IAAI,SAAS;AAAA,IAC7B;AAAA,IACA,WAAW,IAAI,KAAK,SAAS,EAAE,YAAY;AAAA,IAC3C,iBAAiB,KAAK;AAAA,IACtB,eAAe,OAAO;AAAA,IACtB,aAAa,OAAO;AAAA,IACpB,iBAAiB,OAAO;AAAA,IACxB,MAAM,OAAO;AAAA,IACb,aAAa,OAAO,YAAY,IAAI,CAAC,OAAO;AAAA,MAC1C,iBAAiB,EAAE,OAAO;AAAA,MAC1B,YAAY,EAAE,OAAO;AAAA,MACrB,UAAU,EAAE,OAAO;AAAA,MACnB,UAAU,EAAE,SAAS,IAAI,CAAC,OAAO,EAAE,aAAa,EAAE,aAAa,SAAS,EAAE,QAAQ,EAAE;AAAA,IACtF,EAAE;AAAA,IACF,MAAM,OAAO;AAAA,IACb,mBAAmB,OAAO;AAAA,IAC1B,iBAAiB,OAAO;AAAA,IACxB;AAAA,IACA,cAAc;AAAA,IACd,iBAAiB;AAAA,IACjB;AAAA,IACA,cAAc,KAAK,eAAe,mBAAmB,KAAK,YAAY,IAAI;AAAA,EAC5E,CAAC;AACD,MAAI,KAAK,aAAc,MAAK,aAAa,UAAU;AAEnD,QAAM,UAAmD;AAAA,IACvD;AAAA,IACA,QAAQ;AAAA,MACN,GAAG;AAAA,MACH,SAAS,OAAO;AAAA,MAChB,GAAI,OAAO,cAAc,EAAE,OAAO,OAAO,YAAY,IAAI,CAAC;AAAA,MAC1D,GAAI,OAAO,kBAAkB,EAAE,WAAW,OAAO,gBAAgB,IAAI,CAAC;AAAA,IACxE;AAAA,IACA,MAAM,YAAY,gBAAgB,SAAS;AAAA,IAC3C,MAAM,OAAO;AAAA,IACb;AAAA,IACA,cAAc,OAAO,WAAW;AAAA,IAChC,qBAAqB,OAAO,YAAY;AAAA,IACxC;AAAA,IACA,cAAc;AAAA,IACd;AAAA,IACA,KAAK;AAAA,EACP;AAIA,MAAI,KAAK,cAAc;AACrB,QAAI;AACF,YAAM,oBAAoB,KAAK,cAAc,MAAM,SAAS,QAAQ,MAAM;AAAA,IAC5E,SAAS,KAAK;AACZ,YAAM,MAAM,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAE3D,cAAQ,KAAK,mDAAmD,GAAG,EAAE;AAAA,IACvE;AAAA,EACF;AAEA,SAAO;AACT;AAEA,eAAe,oBACb,QACA,MACA,SACA,KACA,QACe;AACf,QAAM,SAAS,mBAAmB,MAAM;AAExC,WAAS,qBACP,OACA,SACA,UACA,YAC2B;AAC3B,UAAM,QAA4B,SAAS,MAAM,IAAI,CAAC,SAAS;AAC7D,YAAM,cAAc,OAAO,OAAO,KAAK,WAAW;AAClD,YAAM,YACJ,YAAY,WAAW,IACnB,IACA,YAAY,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,WAAW,CAAC,IAAI,YAAY;AACrE,aAAO;AAAA,QACL,YAAY,KAAK;AAAA,QACjB,KAAK,KAAK;AAAA,QACV,eAAe;AAAA,QACf,YAAY,OAAO;AAAA,UACjB,OAAO,QAAQ,KAAK,WAAW,EAAE,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,MAAM,UAAU,CAAC;AAAA,QAClF;AAAA,QACA,cAAc,KAAK,SAAS;AAAA,MAC9B;AAAA,IACF,CAAC;AACD,UAAM,gBACJ,MAAM,WAAW,IAAI,IAAI,MAAM,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,eAAe,CAAC,IAAI,MAAM;AAClF,WAAO;AAAA,MACL;AAAA,MACA,aACE,OAAO,YAAY,WACf,WAAW,OAAO,IAClB,WAAW,KAAK,UAAU,WAAW,EAAE,CAAC;AAAA,MAC9C;AAAA,MACA;AAAA,MACA;AAAA,MACA,SAAS,SAAS,WAAW;AAAA,MAC7B;AAAA,IACF;AAAA,EACF;AAEA,QAAM,cAA2C,CAAC;AAElD,cAAY,KAAK,qBAAqB,GAAG,KAAK,iBAAiB,IAAI,kBAAkB,CAAC,CAAC;AAGvF,aAAW,OAAO,IAAI,aAAa;AACjC,UAAM,SAAS,IAAI,SAAS;AAAA,MAC1B,CAAC,MAAM,MACL,EAAE,SAAS,WAAW,gBAAgB,MACrC,SAAS,UAAa,iBAAiB,EAAE,QAAQ,IAAI,iBAAiB,KAAK,QAAQ,KAChF,IACA;AAAA,MACN,IAAI,SAAS,CAAC;AAAA,IAChB;AACA,QAAI,CAAC,OAAQ;AACb,gBAAY;AAAA,MACV,qBAAqB,IAAI,OAAO,kBAAkB,GAAG,OAAO,SAAS,OAAO,UAAU,CAAC;AAAA,IACzF;AAAA,EACF;AAEA,QAAM,QAAsB;AAAA,IAC1B,OAAO,GAAG,MAAM,IAAI,KAAK,IAAI,CAAC;AAAA,IAC9B;AAAA,IACA,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,IAClC,QAAQ;AAAA,IACR,QAAQ,KAAK,gBAAgB,CAAC;AAAA,IAC9B,UAAU,YAAY,CAAC;AAAA,IACvB;AAAA,IACA,cAAc,QAAQ;AAAA,IACtB,aAAa,QAAQ;AAAA,IACrB,cAAc,QAAQ;AAAA,IACtB,iBAAiB,QAAQ;AAAA,IACzB,eAAe,QAAQ;AAAA,EACzB;AAEA,QAAM,OAAO,cAAc,KAAK;AAClC;AAEA,SAAS,iBACP,UACQ;AACR,QAAM,OAAO,OAAO,OAAO,SAAS,WAAW,UAAU;AACzD,SAAO,KAAK,WAAW,IAAI,IAAI,KAAK,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,eAAe,CAAC,IAAI,KAAK;AACtF;AAEA,SAAS,WAAW,GAAmB;AACrC,MAAI,IAAI,eAAe;AACvB,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,SAAK,EAAE,WAAW,CAAC;AACnB,QAAI,KAAK,KAAK,GAAG,QAAQ,MAAM;AAAA,EACjC;AACA,SAAO,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AACvC;AAaA,SAAS,kBACP,OACA,aACA,OACA,SACa;AACb,QAAM,aAAa,mBAAmB,OAAO;AAC7C,QAAM,aAAa,UAAU,WAAW,QAAQ,EAAE,OAAO,WAAW,EAAE,OAAO,KAAK,CAAC;AACnF,SAAO,MAAM,IAAI,CAAC,SAAS;AACzB,UAAM,WAAmD,CAAC;AAC1D,UAAM,kBAA8D,CAAC;AACrE,QAAI,eAAe;AACnB,QAAI,iBAAiB;AACrB,eAAW,CAAC,SAAS,KAAK,KAAK,OAAO,QAAQ,KAAK,WAAW,GAAG;AAC/D,eAAS,OAAO,IAAI,EAAE,GAAG,MAAM,WAAW;AAC1C,iBAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,MAAM,UAAU,GAAG;AAC3D,YAAI,CAAC,OAAO,SAAS,KAAK,EAAG;AAC7B,cAAM,QAAQ,gBAAgB,GAAG,KAAK,EAAE,KAAK,GAAG,GAAG,EAAE;AACrD,cAAM,OAAO;AACb,cAAM,KAAK;AACX,wBAAgB,GAAG,IAAI;AAAA,MACzB;AACA,UAAI,OAAO,SAAS,MAAM,SAAS,GAAG;AACpC,wBAAgB,MAAM;AACtB,0BAAkB;AAAA,MACpB;AAAA,IACF;AACA,UAAM,aAAqC,CAAC;AAC5C,eAAW,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,KAAK,OAAO,QAAQ,eAAe,GAAG;AAC/D,iBAAW,GAAG,IAAI,MAAM,IAAI,IAAI,MAAM;AAAA,IACxC;AACA,UAAM,YAAY,mBAAmB,IAAI,IAAI,eAAe;AAC5D,UAAM,cAAiC;AAAA,MACrC;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,WAAO;AAAA,MACL,OAAO,GAAG,KAAK,KAAK,WAAW,KAAK,KAAK,MAAM;AAAA,MAC/C,cAAc;AAAA,MACd;AAAA;AAAA;AAAA,MAGA,MACE,KAAK,MAAM,MACX,WAAW,KAAK,UAAU,EACvB,MAAM,GAAG,CAAC,EACV,MAAM,EAAE,EACR,OAAO,CAAC,GAAG,MAAO,IAAI,KAAK,EAAE,WAAW,CAAC,MAAO,GAAG,CAAC;AAAA,MACzD,OAAO;AAAA,MACP;AAAA,MACA;AAAA,MACA,WAAW;AAAA,MACX,QAAQ,KAAK;AAAA,MACb,SAAS,KAAK;AAAA,MACd,YAAY,EAAE,OAAO,GAAG,QAAQ,EAAE;AAAA,MAClC,SAAS;AAAA,QACP,cAAc;AAAA,QACd,KAAK,CAAC;AAAA,QACN;AAAA,MACF;AAAA,MACA,UAAU;AAAA,MACV,GAAI,KAAK,QAAQ,EAAE,aAAa,KAAK,MAAM,IAAI,CAAC;AAAA,IAClD;AAAA,EACF,CAAC;AACH;;;AC3oBO,SAAS,gBACd,UACwC;AACxC,QAAM,yBAAyB,iBAAiB,QAAQ;AAExD,SAAO;AAAA,IACL,WAAW,SAAS;AAAA,IACpB,iBAAiB,SAAS;AAAA,IAE1B,MAAM,SAAS,OAAO,CAAC,GAAG;AACxB,YAAM,EAAE,OAAO,OAAO,QAAQ,QAAQ,WAAW,SAAS,GAAG,aAAa,IAAI;AAC9E,YAAM,gBAAgB,SAAS,SAAS;AACxC,YAAM,kBAAkB,WAAW,SAAS;AAC5C,YAAM,iBAAiB,UAAU,SAAS,UAAU,yBAAyB,KAAK,IAAI,CAAC;AACvF,YAAM,kBACJ,aAAa,WACb,uBAAuB,YACtB,eAAe,WAAW,QAAQ,IAAI,wBAAwB,IAAI;AACrE,YAAM,cAAoD;AAAA,QACxD,GAAG;AAAA,QACH,GAAG;AAAA,QACH,GAAI,kBAAkB,EAAE,SAAS,gBAAgB,IAAI,CAAC;AAAA,QACtD,QAAQ;AAAA,QACR,WAAW,aAAa,SAAS;AAAA,QACjC,UAAU,CAAC,UAAU,QAAQ,cAAc,iBAAiB,UAAU,GAAG;AAAA,QACzE,QAAQ,eAAe,QAAQ,SAAS,SAAS,KAAK;AAAA,MACxD;AACA,UAAI,YAAY,SAAS;AACvB,oBAAY,OAAO,uBAAuB,YAAY,MAAM,MAAM;AACpE,aAAO,QAA8B,WAAW;AAAA,IAClD;AAAA,IAEA,MAAM,QAAQ,OAAO,CAAC,GAAG;AACvB,YAAM;AAAA,QACJ,QAAQ;AAAA,QACR,cAAc;AAAA,QACd,KAAK;AAAA,QACL,GAAG;AAAA,MACL,IAAI;AACJ,YAAM,SAAS,aAAa,UAAU,iBAAiB;AACvD,YAAM,SAAS,YAAY,SAAS,QAAQ,cAAc;AAC1D,YAAM,MAAM,SAAS,SAAS,KAAK,WAAW;AAC9C,YAAM,eAAe,kBAAkB,SAAS,cAAc,oBAAoB;AAClF,aAAO,YAAkC;AAAA,QACvC,GAAG;AAAA,QACH,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC;AAAA,QAC3B,GAAI,MAAM,EAAE,IAAI,IAAI,CAAC;AAAA,QACrB,GAAI,eAAe,EAAE,aAAa,IAAI,CAAC;AAAA,MACzC,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAOA,SAAS,iBACP,UAC8C;AAC9C,QAAM,MAAoD,CAAC;AAC3D,MAAI,SAAS,QAAS,KAAI,UAAU,SAAS;AAC7C,MAAI,SAAS,aAAc,KAAI,eAAe,SAAS;AACvD,MAAI,SAAS,cAAe,KAAI,gBAAgB,SAAS;AACzD,MAAI,SAAS,cAAe,KAAI,gBAAgB,SAAS;AACzD,MAAI,SAAS,YAAa,KAAI,cAAc,SAAS;AACrD,MAAI,SAAS,QAAQ,YAAY,OAAW,KAAI,cAAc,SAAS,OAAO;AAC9E,MAAI,SAAS,QAAQ,mBAAmB;AACtC,QAAI,iBAAiB,SAAS,OAAO;AACvC,MAAI,SAAS,QAAQ,SAAS;AAC5B,QAAI,OAAO,uBAAuB,SAAS,OAAO,MAAM,aAAa;AACvE,SAAO;AACT;AAEA,SAAS,YACP,UACA,WAC+B;AAC/B,QAAM,SAAS,oBAAoB,UAAU,SAAS;AACtD,MAAI,QAAQ,SAAS,OAAW,QAAO,OAAO,uBAAuB,OAAO,MAAM,aAAa;AAC/F,SAAO;AACT;AAEA,SAAS,SACP,UACA,WAC4B;AAC5B,SAAO,oBAAoB,UAAU,SAAS;AAChD;AAEA,SAAS,kBACP,UACA,WAC0B;AAC1B,QAAM,SAAS,oBAAoB,UAAU,SAAS;AACtD,MAAI,CAAC,OAAQ,QAAO;AACpB,MAAI,CAAC,OAAO,UAAU,KAAK,KAAK,CAAC,OAAO,QAAQ,KAAK,KAAK,CAAC,OAAO,UAAU,KAAK,GAAG;AAClF,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,aAA+B,UAAa,WAAsC;AACzF,MAAI,CAAC,UAAW,QAAO;AACvB,QAAM,SAAS,EAAE,GAAG,SAAS;AAC7B,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,SAAS,GAAG;AACpD,QAAI,UAAU,OAAW,QAAO,GAAG,IAAI;AAAA,EACzC;AACA,SAAO;AACT;AAEA,SAAS,oBACP,UACA,WACe;AACf,MAAI,CAAC,YAAY,CAAC,UAAW,QAAO;AACpC,SAAO,aAAa,YAAa,CAAC,GAAS,SAAS;AACtD;AAEA,SAAS,eACP,QACA,cACqC;AACrC,MAAI,WAAW,QAAW;AACxB,QAAI,OAAO,WAAW,GAAG;AACvB,YAAM,IAAI,MAAM,oDAAoD;AAAA,IACtE;AACA,WAAO;AAAA,EACT;AACA,SAAO,CAAC,YAAY;AACtB;AAEA,SAAS,uBAAuB,OAAe,OAAuB;AACpE,MAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,GAAG;AACzC,UAAM,IAAI,MAAM,oBAAoB,KAAK,6BAA6B;AAAA,EACxE;AACA,SAAO;AACT;;;AC9HA,SAAS,WAAW,MAAgC;AAIlD,SAAO,KAAK,UAAU,CAAC,KAAK,YAAY,KAAK,GAAG,CAAC;AACnD;AAIA,SAAS,eACP,QACA,OACkC;AAClC,QAAM,MAAwC,CAAC;AAC/C,QAAM,SAAS,oBAAI,IAAY,CAAC,GAAG,OAAO,KAAK,MAAM,GAAG,GAAG,OAAO,KAAK,KAAK,CAAC,CAAC;AAC9E,aAAW,SAAS,QAAQ;AAC1B,UAAM,aAAa,OAAO,KAAK,KAAK,CAAC;AACrC,UAAM,YAAY,MAAM,KAAK,KAAK,CAAC;AACnC,UAAM,OAAO,oBAAI,IAAY,CAAC,GAAG,OAAO,KAAK,UAAU,GAAG,GAAG,OAAO,KAAK,SAAS,CAAC,CAAC;AACpF,UAAM,WAA+C,CAAC;AACtD,eAAW,OAAO,MAAM;AAKtB,YAAM,YAAY,WAAW,GAAG;AAChC,YAAM,WAAW,UAAU,GAAG;AAC9B,YAAM,IAAI,OAAO,cAAc,YAAY,OAAO,SAAS,SAAS,IAAI,YAAY;AACpF,YAAM,IAAI,OAAO,aAAa,YAAY,OAAO,SAAS,QAAQ,IAAI,WAAW;AACjF,eAAS,GAAG,IAAI;AAAA,QACd,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,OAAO,MAAM,QAAQ,MAAM,OAAO,IAAI,IAAI;AAAA,MAC5C;AAAA,IACF;AACA,QAAI,KAAK,IAAI;AAAA,EACf;AACA,SAAO;AACT;AASO,SAAS,gBACd,QACA,OACoB;AACpB,QAAM,YAAY,IAAI,IAAI,OAAO,MAAM,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;AACrE,QAAM,WAAW,IAAI,IAAI,MAAM,MAAM,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;AAEnE,QAAM,UAAgC,CAAC;AACvC,QAAM,UAA8B,CAAC;AACrC,QAAM,QAA4B,CAAC;AAEnC,aAAW,CAAC,KAAK,UAAU,KAAK,WAAW;AACzC,UAAM,YAAY,SAAS,IAAI,GAAG;AAClC,QAAI,CAAC,WAAW;AACd,cAAQ,KAAK,UAAU;AACvB;AAAA,IACF;AACA,YAAQ,KAAK;AAAA,MACX,YAAY,WAAW;AAAA,MACvB,KAAK,WAAW;AAAA,MAChB,iBAAiB,WAAW;AAAA,MAC5B,gBAAgB,UAAU;AAAA,MAC1B,gBAAgB,UAAU,gBAAgB,WAAW;AAAA,MACrD,YAAY,eAAe,WAAW,YAAY,UAAU,UAAU;AAAA,IACxE,CAAC;AAAA,EACH;AACA,aAAW,CAAC,KAAK,SAAS,KAAK,UAAU;AACvC,QAAI,CAAC,UAAU,IAAI,GAAG,EAAG,OAAM,KAAK,SAAS;AAAA,EAC/C;AAEA,SAAO;AAAA,IACL,aAAa,OAAO;AAAA,IACpB,YAAY,MAAM;AAAA,IAClB,mBAAmB,OAAO;AAAA,IAC1B,kBAAkB,MAAM;AAAA,IACxB,gBAAgB,OAAO,gBAAgB,MAAM;AAAA,IAC7C;AAAA,IACA;AAAA,IACA;AAAA,IACA,iBAAiB,OAAO;AAAA,IACxB,gBAAgB,MAAM;AAAA,IACtB,gBAAgB,MAAM,gBAAgB,OAAO;AAAA,IAC7C,eAAe,OAAO;AAAA,IACtB,cAAc,MAAM;AAAA,IACpB,cAAc,MAAM,UAAU,OAAO;AAAA,IACrC,kBAAkB,OAAO;AAAA,IACzB,iBAAiB,MAAM;AAAA,IACvB,iBAAiB,MAAM,aAAa,OAAO;AAAA,EAC7C;AACF;AAGA,SAAS,SAAS,KAAqD;AACrE,MAAI,IAAI,YAAY,WAAW,EAAG,QAAO;AACzC,MAAI,SAAS,IAAI,YAAY,CAAC;AAC9B,aAAW,OAAO,IAAI,aAAa;AACjC,QAAI,IAAI,QAAQ,OAAO,MAAO,UAAS;AAAA,EACzC;AACA,SAAO;AACT;AAOO,SAAS,SAAS,QAAsB,OAAkC;AAC/E,QAAM,eAAe,SAAS,MAAM;AACpC,QAAM,cAAc,SAAS,KAAK;AAClC,QAAM,eACJ,OAAO,YAAY,MAAM,WAAW,gBAAgB,OAAO,UAAU,MAAM,QAAQ,IAAI;AACzF,QAAM,cACJ,gBAAgB,cAAc,gBAAgB,cAAc,WAAW,IAAI;AAE7E,QAAM,aAAa,OAAO,eAAe;AACzC,QAAM,YAAY,MAAM,eAAe;AAEvC,SAAO;AAAA,IACL,aAAa,OAAO;AAAA,IACpB,YAAY,MAAM;AAAA,IAClB,iBAAiB,OAAO;AAAA,IACxB,gBAAgB,MAAM;AAAA,IACtB,oBAAoB,OAAO,gBAAgB;AAAA,IAC3C,mBAAmB,MAAM,gBAAgB;AAAA,IACzC,mBAAmB;AAAA,IACnB,kBAAkB;AAAA,IAClB,kBAAkB,eAAe,QAAQ,cAAc,OAAO,YAAY,aAAa;AAAA,IACvF,oBAAoB,OAAO;AAAA,IAC3B,mBAAmB,MAAM;AAAA,IACzB,mBAAmB,MAAM,eAAe,OAAO;AAAA,IAC/C,uBAAuB,OAAO;AAAA,IAC9B,sBAAsB,MAAM;AAAA,IAC5B,sBAAsB,MAAM,kBAAkB,OAAO;AAAA,IACrD;AAAA,IACA;AAAA,EACF;AACF;AAQO,SAAS,wBAAwB,KAA8C;AACpF,MAAI,CAAC,IAAI,SAAU,QAAO;AAC1B,QAAM,SAAS,SAAS,GAAG;AAC3B,MAAI,CAAC,UAAU,OAAO,UAAU,IAAI,SAAS,MAAO,QAAO;AAC3D,SAAO,gBAAgB,IAAI,UAAU,MAAM;AAC7C;;;AChLA,SAAS,WAAW,GAA4B;AAC9C,SAAO,KAAK,IAAI,GAAG,EAAE,WAAW,EAAE,aAAa,CAAC;AAClD;AAOO,SAAS,gBAAgB,SAA8C;AAS5E,QAAM,MAAM,oBAAI,IAAiB;AAEjC,aAAW,UAAU,SAAS;AAC5B,UAAM,MAAM,OAAO,KAAK;AACxB,QAAI,CAAC,IAAK;AAEV,QAAI,IAAI,IAAI,IAAI,GAAG;AACnB,QAAI,CAAC,GAAG;AACN,UAAI;AAAA,QACF,QAAQ,oBAAI,IAAI;AAAA,QAChB,OAAO,oBAAI,IAAI;AAAA,QACf,OAAO,oBAAI,IAAI;AAAA,QACf,mBAAmB;AAAA,QACnB,WAAW;AAAA,QACX,eAAe;AAAA,MACjB;AACA,UAAI,IAAI,KAAK,CAAC;AAAA,IAChB;AAEA,QAAI,OAAO,MAAM,KAAM,GAAE,MAAM,IAAI,OAAO,KAAK,IAAI;AAEnD,eAAW,QAAQ,OAAO,SAAS,CAAC,GAAG;AACrC,QAAE,MAAM,IAAI,KAAK,IAAI;AACrB,iBAAW,QAAQ,KAAK,iBAAiB,CAAC,GAAG;AAC3C,UAAE,qBAAqB;AACvB,mBAAW,SAAS,KAAK,UAAU,CAAC,GAAG;AAErC,gBAAM,cAAc,MAAM,eAAe,KAAK;AAC9C,YAAE,aAAa,WAAW,KAAK;AAC/B,cAAI,CAAC,YAAa;AAClB,cAAI,YAAY,SAAS,WAAW,YAAY,SAAS,SAAS;AAChE,cAAE,gBAAgB;AAAA,UACpB;AACA,eAAK,YAAY,SAAS,QAAQ,YAAY,SAAS,YAAY,YAAY,UAAU;AACvF,cAAE,OAAO,IAAI,YAAY,QAAQ;AAAA,UACnC;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,QAAM,QAAyB,oBAAI,IAAI;AACvC,aAAW,CAAC,KAAK,CAAC,KAAK,KAAK;AAC1B,UAAM,IAAI,KAAK;AAAA,MACb,WAAW;AAAA,MACX,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK;AAAA,MAC7B,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK;AAAA,MACzB,mBAAmB,EAAE;AAAA,MACrB,WAAW,EAAE,MAAM;AAAA,MACnB,WAAW,EAAE;AAAA,MACb,eAAe,EAAE;AAAA,IACnB,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAoBO,SAAS,8BACd,MACA,OACiC;AACjC,QAAM,UAAU,oBAAI,IAAyB;AAC7C,QAAM,eAA4B,CAAC;AAEnC,aAAW,OAAO,MAAM;AACtB,UAAM,aAAa,MAAM,IAAI,IAAI,SAAS;AAC1C,QAAI,CAAC,cAAc,WAAW,SAAS,WAAW,GAAG;AACnD,mBAAa,KAAK,GAAG;AACrB;AAAA,IACF;AACA,eAAW,SAAS,WAAW,UAAU;AACvC,YAAM,SAAS,QAAQ,IAAI,KAAK,KAAK,CAAC;AACtC,aAAO,KAAK,GAAG;AACf,cAAQ,IAAI,OAAO,MAAM;AAAA,IAC3B;AAAA,EACF;AAEA,SAAO,EAAE,SAAS,aAAa;AACjC;;;AC/GO,SAAS,kBAAkB,MAAyD;AACzF,QAAM,EAAE,SAAS,OAAO,CAAC,GAAG,OAAO,kBAAkB,KAAK,IAAI;AAC9D,QAAM,YAAY,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;AAGvD,QAAM,YAAY,CAAC,WAAqC;AACtD,QAAI,OAAO,WAAW,UAAW,QAAO,SAAS,IAAI;AACrD,QAAI,CAAC,OAAO,SAAS,MAAM,EAAG,QAAO,OAAO;AAC5C,QAAI,CAAC,MAAO,QAAO;AACnB,UAAM,EAAE,KAAK,IAAI,IAAI;AACrB,QAAI,QAAQ,IAAK,QAAO;AACxB,YAAQ,SAAS,QAAQ,MAAM;AAAA,EACjC;AAGA,QAAM,QAAQ,oBAAI,IAAgC;AAClD,aAAW,OAAO,SAAS;AACzB,UAAM,OAAO,MAAM,IAAI,IAAI,KAAK,KAAK,CAAC;AACtC,SAAK,KAAK,GAAG;AACb,UAAM,IAAI,IAAI,OAAO,IAAI;AAAA,EAC3B;AAEA,QAAM,OAAoB,CAAC;AAC3B,QAAM,cAAsD,CAAC;AAE7D,aAAW,CAAC,OAAO,UAAU,KAAK,OAAO;AACvC,UAAM,aAAa,WAChB,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,OAAO,UAAU,EAAE,MAAM,EAAE,EAAE,EAC3D,OAAO,CAAC,MAAM,OAAO,SAAS,EAAE,KAAK,CAAC;AACzC,QAAI,WAAW,WAAW,EAAG;AAE7B,UAAM,YAAY,WAAW,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,OAAO,CAAC,IAAI,WAAW;AAE3E,UAAM,UAAU,UAAU,IAAI,KAAK,KAAM,EAAE,MAAM;AAEjD,UAAM,cAAiC;AAAA,MACrC,UAAU,OAAO,YAAY,WAAW,IAAI,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC;AAAA,MAClF,YAAY,EAAE,QAAQ,UAAU;AAAA,MAChC,WAAW;AAAA,IACb;AAEA,UAAM,UAAsB;AAAA;AAAA;AAAA;AAAA,MAI1B,cAAc;AAAA,MACd,KAAK,OAAO,YAAY,WAAW,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,KAAK,IAAI,EAAE,KAAK,CAAC,CAAC;AAAA,MAC5E;AAAA,IACF;AAEA,SAAK,KAAK;AAAA,MACR;AAAA,MACA,cAAc,QAAQ,gBAAgB;AAAA,MACtC,aAAa,QAAQ,eAAe;AAAA,MACpC,MAAM;AAAA,MACN,OAAO,QAAQ,SAAS;AAAA,MACxB,YAAY,QAAQ,cAAc;AAAA,MAClC,YAAY,QAAQ,cAAc;AAAA,MAClC,WAAW,QAAQ,aAAa;AAAA,MAChC,QAAQ,QAAQ,UAAU;AAAA,MAC1B,SAAS,QAAQ,WAAW;AAAA,MAC5B,YAAY,EAAE,OAAO,GAAG,QAAQ,EAAE;AAAA,MAClC;AAAA,MACA,UAAU,QAAQ,YAAY;AAAA,IAChC,CAAc;AAEd,QAAI,iBAAiB;AACnB,iBAAW,KAAK,WAAY,aAAY,KAAK,EAAE,OAAO,OAAO,EAAE,OAAO,OAAO,EAAE,MAAM,CAAC;AAAA,IACxF;AAAA,EACF;AAEA,SAAO,EAAE,MAAM,YAAY;AAC7B;;;ACvHA,IAAM,aAAa,CAAC,gBAAgB,cAAc,OAAO;AACzD,IAAM,aAAa,CAAC,gBAAgB,GAAG,qBAAqB,OAAO;AACnE,IAAM,YAAY,CAAC,mBAAmB,yBAAyB,YAAY,MAAM;AACjF,IAAM,mBAAmB,CAAC,GAAG,2BAA2B,oBAAoB,WAAW;AACvF,IAAM,oBAAoB,CAAC,GAAG,4BAA4B,qBAAqB,YAAY;AAC3F,IAAM,mBAAmB,CAAC,sBAAsB,aAAa;AAC7D,IAAM,mBAAmB,CAAC,sBAAsB,aAAa;AAUtD,SAAS,cAAc,MAAyC;AACrE,QAAM,EAAE,OAAO,eAAe,WAAW,eAAe,cAAc,IAAI;AAC1E,QAAM,UAAU,WAAW,KAAK;AAEhC,QAAM,OAAoB,CAAC;AAC3B,aAAW,CAAC,UAAUA,WAAU,KAAK,SAAS;AAC5C,UAAM,OAAO,SAASA,WAAU;AAChC,QAAI,CAAC,KAAM;AAEX,UAAM,SAAS,KAAK,IAAI,IAAI,KAAK,kBAAkB,KAAK,qBAAqB,GAAS;AACtF,UAAM,QAAQ,eAAeA,aAAY,UAAU,KAAK;AACxD,UAAM,UAAU,eAAeA,aAAY,SAAS,KAAK;AACzD,UAAM,cAAc,eAAeA,aAAY,gBAAgB,KAAK;AACpE,UAAM,eAAe,eAAeA,aAAY,iBAAiB,KAAK;AACtE,UAAM,aAAa,eAAeA,aAAY,gBAAgB,KAAK;AACnE,UAAM,aAAa,eAAeA,aAAY,gBAAgB,KAAK;AACnE,UAAM,QAAQ,eAAeA,aAAY,UAAU;AAEnD,UAAM,aAAa,oBAAoBA,WAAU;AACjD,UAAM,aAA4B;AAAA,MAChC,OAAO;AAAA,MACP,QAAQ;AAAA,IACV;AAEA,UAAM,cACJ,UAAU,SACN;AAAA,MACE,UAAU,EAAE,gBAAgB,EAAE,MAAM,EAAE;AAAA,MACtC,YAAY,EAAE,MAAM;AAAA,MACpB,WAAW;AAAA,IACb,IACA;AAEN,UAAM,YAAYA,YAAW,KAAK,CAAC,MAAM,EAAE,QAAQ,SAAS,OAAO;AACnE,UAAM,UAAsB;AAAA,MAC1B,GAAI,KAAK,iBAAiB,WAAW,EAAE,aAAa,MAAM,IAAI,EAAE,cAAc,MAAM;AAAA,MACpF,KAAK;AAAA,MACL,GAAI,cAAc,EAAE,YAAY,IAAI,CAAC;AAAA,IACvC;AAEA,SAAK,KAAK;AAAA,MACR,OAAO;AAAA,MACP;AAAA,MACA,aAAc,KAAK,WAAW,oBAAoB,KAA4B;AAAA,MAC9E,MAAM;AAAA,MACN;AAAA,MACA;AAAA,MACA;AAAA,MACA,WAAY,KAAK,WAAW,mBAAmB,KAA4B;AAAA,MAC3E;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,UAAU;AAAA,MACV,GAAI,YAAY,EAAE,aAAa,UAAU,KAAK,IAAI,CAAC;AAAA,IACrD,CAAc;AAAA,EAChB;AACA,SAAO;AACT;AAIA,SAAS,WAAW,OAAwD;AAC1E,QAAM,IAAI,oBAAI,IAA8B;AAC5C,aAAW,QAAQ,OAAO;AACxB,UAAM,MAAO,KAAK,cAAc,KAA4B,KAAK;AACjE,UAAM,OAAO,EAAE,IAAI,GAAG,KAAK,CAAC;AAC5B,SAAK,KAAK,IAAI;AACd,MAAE,IAAI,KAAK,IAAI;AAAA,EACjB;AACA,SAAO;AACT;AAEA,SAAS,SAAS,OAAqD;AACrE,SAAO,MAAM,KAAK,CAAC,MAAM,CAAC,EAAE,YAAY,KAAK,MAAM,CAAC;AACtD;AAEA,SAAS,eAAe,OAAyB,MAAoC;AACnF,aAAW,QAAQ,OAAO;AACxB,eAAW,OAAO,MAAM;AACtB,YAAM,IAAI,KAAK,WAAW,GAAG;AAC7B,UAAI,OAAO,MAAM,YAAY,EAAE,SAAS,EAAG,QAAO;AAAA,IACpD;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,eAAe,OAAyB,MAAoC;AACnF,aAAW,QAAQ,OAAO;AACxB,eAAW,OAAO,MAAM;AACtB,YAAM,IAAI,KAAK,WAAW,GAAG;AAC7B,UAAI,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,EAAG,QAAO;AACxD,UAAI,OAAO,MAAM,UAAU;AACzB,cAAM,SAAS,OAAO,CAAC;AACvB,YAAI,OAAO,SAAS,MAAM,EAAG,QAAO;AAAA,MACtC;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,oBAAoB,OAAiD;AAC5E,QAAM,MAA8B,CAAC;AACrC,aAAW,QAAQ,OAAO;AACxB,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,KAAK,UAAU,GAAG;AACpD,UAAI,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,EAAG,KAAI,CAAC,IAAI;AAAA,IAC5D;AAAA,EACF;AACA,SAAO;AACT;","names":["groupSpans"]}

package/dist/{insight-report-DWl3z9tl.d.ts → contract/insight-report.d.ts}

@@ -1,6 +1,3 @@
-import { G as GainDistributionBin, P as ParetoFigureSpec } from './summary-report-BDOFevaT.js';
-import { C as ContinuousAgreement } from './judge-calibration-0p2QcWNE.js';
-
 /**
  * # InsightReport — the rigorous decision packet for any set of agent runs.
  *
@@ -30,8 +27,9 @@ import { C as ContinuousAgreement } from './judge-calibration-0p2QcWNE.js';
  * Consumers read the `recommendations` array first — that's the
  * actionable layer, ranked by priority. The numeric sections back it up.
  */
-
-interface InsightReport {
+import type { GainDistributionBin, ParetoFigureSpec } from '../summary-report';
+import type { ContinuousAgreement } from './insight-types-fwd';
+export interface InsightReport {
     /** Number of runs analyzed. */
     n: number;
     /** Composite-score distribution across all runs. Always present. */
@@ -96,7 +94,7 @@ interface InsightReport {
     recommendations: Recommendation[];
 }
 /** Distributional summary of a scalar-valued metric. */
-interface ScalarDistribution {
+export interface ScalarDistribution {
     /** Sample count after dropping non-finite values. */
     n: number;
     mean: number;
@@ -116,7 +114,7 @@ interface ScalarDistribution {
         score: number;
     }>;
 }
-interface JudgeInsight {
+export interface JudgeInsight {
     /** Number of times this judge scored a run. */
     n: number;
     /** Mean composite over this judge's runs. */
@@ -134,7 +132,7 @@ interface JudgeInsight {
      *  quality? */
     verbosityBias?: number;
 }
-interface InterRaterInsight {
+export interface InterRaterInsight {
     /** Number of raters whose scores were aggregated. */
     raters: number;
     /** Number of runs every rater scored. */
@@ -153,7 +151,7 @@ interface InterRaterInsight {
         range: number;
     }>;
 }
-interface LiftInsight {
+export interface LiftInsight {
     baselineMean: number;
     candidateMean: number;
     /** Candidate − baseline. */
@@ -171,7 +169,7 @@ interface LiftInsight {
     /** Sample size needed to detect the observed delta at 80% power. */
     requiredN: number;
 }
-interface FailureClusterInsight {
+export interface FailureClusterInsight {
     /** All clusters identified by the registry, ranked by share descending. */
     clusters: Array<{
         id: string;
@@ -190,7 +188,7 @@ interface FailureClusterInsight {
  *  is computed directly from the tags the harness already recorded — so a
  *  customer ingesting one batch with no judge/analyst still learns which
  *  named failure dominates. */
-interface FailureModeTally {
+export interface FailureModeTally {
     /** The `failureMode` tag. */
     mode: string;
     /** Number of runs carrying this tag. */
@@ -198,7 +196,7 @@ interface FailureModeTally {
     /** Share of the whole corpus, 0..1. */
     share: number;
 }
-interface ContaminationInsight {
+export interface ContaminationInsight {
     /** Canary phrases that leaked into outputs. */
     leaks: number;
     /** Holdout audit verdict — did any holdout-tagged run end up in the
@@ -210,7 +208,7 @@ interface ContaminationInsight {
         matched: string;
     }>;
 }
-interface OutcomeCorrelationInsight {
+export interface OutcomeCorrelationInsight {
     /** What outcome the consumer is correlating against (e.g.
      *  `'engagement_rate'`, `'approval_rate'`, `'downstream_pass'`). */
     metric: string;
@@ -227,7 +225,7 @@ interface OutcomeCorrelationInsight {
         r2: number;
     };
 }
-interface ReleaseSummary {
+export interface ReleaseSummary {
     /** Overall verdict across axes — fail if any axis fails, else warn if any
      *  warns, else pass. */
     status: 'pass' | 'warn' | 'fail';
@@ -240,7 +238,7 @@ interface ReleaseSummary {
      *  consumers can post-process to populate. */
     issues: string[];
 }
-interface MetricDelta {
+export interface MetricDelta {
     /** Current-period mean. */
     current: number;
     /** Baseline-period mean. */
@@ -264,7 +262,7 @@ interface MetricDelta {
      *  tiny from triggering recommendations. */
     significant: boolean;
 }
-interface PriorPeriodComparison {
+export interface PriorPeriodComparison {
     /** Sample counts. */
     baselineN: number;
     currentN: number;
@@ -280,7 +278,7 @@ interface PriorPeriodComparison {
     /** Metric names where current is significantly BETTER than baseline. */
     improvedMetrics: string[];
 }
-interface Recommendation {
+export interface Recommendation {
     priority: 'critical' | 'high' | 'medium' | 'low';
     kind: 'ship' | 'hold' | 'investigate' | 'fix' | 'recalibrate' | 'expand-corpus';
     title: string;
@@ -288,5 +286,4 @@ interface Recommendation {
     /** Optional pointer back into the report for the evidence. */
     evidencePath?: string;
 }
-
-export type { FailureClusterInsight as F, InsightReport as I, JudgeInsight as J, LiftInsight as L, OutcomeCorrelationInsight as O, Recommendation as R, ScalarDistribution as S, InterRaterInsight as a, ReleaseSummary as b };
+//# sourceMappingURL=insight-report.d.ts.map

package/dist/contract/insight-report.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"insight-report.d.ts","sourceRoot":"","sources":["../../src/contract/insight-report.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AAEH,OAAO,KAAK,EAAE,mBAAmB,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAA;AAC9E,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,qBAAqB,CAAA;AAI9D,MAAM,WAAW,aAAa;IAC5B,+BAA+B;IAC/B,CAAC,EAAE,MAAM,CAAA;IAET,oEAAoE;IACpE,SAAS,EAAE,kBAAkB,CAAA;IAE7B;wEACoE;IACpE,YAAY,EAAE,MAAM,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAAA;IAEhD,qDAAqD;IACrD,WAAW,EAAE;QACX,IAAI,EAAE,kBAAkB,CAAA;QACxB,MAAM,EAAE,gBAAgB,CAAA;QACxB;;;6EAGqE;QACrE,QAAQ,CAAC,EAAE;YAAE,IAAI,CAAC,EAAE,MAAM,CAAC;YAAC,MAAM,CAAC,EAAE,MAAM,CAAA;SAAE,CAAA;KAC9C,CAAA;IAED;;8CAE0C;IAC1C,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CAAA;IAEpC;;sDAEkD;IAClD,UAAU,CAAC,EAAE,iBAAiB,CAAA;IAE9B;;sEAEkE;IAClE,IAAI,CAAC,EAAE,WAAW,CAAA;IAElB;kDAC8C;IAC9C,eAAe,CAAC,EAAE,qBAAqB,CAAA;IAEvC;mCAC+B;IAC/B,aAAa,CAAC,EAAE,oBAAoB,CAAA;IAEpC;;;4CAGwC;IACxC,kBAAkB,CAAC,EAAE,yBAAyB,CAAA;IAE9C;;;8DAG0D;IAC1D,OAAO,EAAE,cAAc,CAAA;IAEvB;;;;8DAI0D;IAC1D,qBAAqB,CAAC,EAAE,qBAAqB,CAAA;IAE7C;;;2EAGuE;IACvE,YAAY,CAAC,EAAE,gBAAgB,EAAE,CAAA;IAEjC;uEACmE;IACnE,eAAe,EAAE,cAAc,EAAE,CAAA;CAClC;AAID,wDAAwD;AACxD,MAAM,WAAW,kBAAkB;IACjC,qDAAqD;IACrD,CAAC,EAAE,MAAM,CAAA;IACT,IAAI,EAAE,MAAM,CAAA;IACZ,GAAG,EAAE,MAAM,CAAA;IACX,GAAG,EAAE,MAAM,CAAA;IACX,MAAM,EAAE,MAAM,CAAA;IACd,GAAG,EAAE,MAAM,CAAA;IACX,GAAG,EAAE,MAAM,CAAA;IACX,qEAAqE;IACrE,SAAS,EAAE,mBAAmB,EAAE,CAAA;IAChC;;;2DAGuD;IACvD,QAAQ,CAAC,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;CACnD;AAED,MAAM,WAAW,YAAY;IAC3B,+CAA+C;IAC/C,CAAC,EAAE,MAAM,CAAA;IACT,6CAA6C;IAC7C,SAAS,EAAE,MAAM,CAAA;IACjB;8DAC0D;IAC1D,WAAW,CAAC,EAAE,mBAAmB,CAAA;IACjC;gEAC4D;IAC5D,cAAc,CAAC,EAAE,MAAM,CAAA;IACvB;iDAC6C;IAC7C,cAAc,CAAC,EAAE,MAAM,CAAA;IACvB;mBACe;IACf,aAAa,CAAC,EAAE,MAAM,CAAA;CACvB;AAED,MAAM,WAAW,iBAAiB;IAChC,qDAAqD;IACrD,MAAM,EAAE,MAAM,CAAA;IACd,yCAAyC;IACzC,YAAY,EAAE,MAAM,CAAA;IACpB,6CAA6C;IAC7C,KAAK,EAAE,MAAM,CAAA;IACb,4DAA4D;IAC5D,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAC/B,2EAA2E;IAC3E,iBAAiB,EAAE,KAAK,CAAC;QACvB,KAAK,EAAE,MAAM,CAAA;QACb,OAAO,EAAE,KAAK,CAAC;YAAE,KAAK,EAAE,MAAM,CAAC;YAAC,KAAK,EAAE,MAAM,CAAA;SAAE,CAAC,CAAA;QAChD,KAAK,EAAE,MAAM,CAAA;KACd,CAAC,CAAA;CACH;AAED,MAAM,WAAW,WAAW;IAC1B,YAAY,EAAE,MAAM,CAAA;IACpB,aAAa,EAAE,MAAM,CAAA;IACrB,4BAA4B;IAC5B,KAAK,EAAE,MAAM,CAAA;IACb,wDAAwD;IACxD,IAAI,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IACtB,6BAA6B;IAC7B,MAAM,EAAE,MAAM,CAAA;IACd,qCAAqC;IACrC,CAAC,EAAE,MAAM,CAAA;IACT,+BAA+B;IAC/B,OAAO,EAAE,MAAM,CAAA;IACf,yDAAyD;IACzD,GAAG,EAAE,MAAM,CAAA;IACX,oEAAoE;IACpE,SAAS,EAAE,MAAM,CAAA;CAClB;AAED,MAAM,WAAW,qBAAqB;IACpC,2EAA2E;IAC3E,QAAQ,EAAE,KAAK,CAAC;QACd,EAAE,EAAE,MAAM,CAAA;QACV,IAAI,EAAE,MAAM,CAAA;QACZ,qDAAqD;QACrD,KAAK,EAAE,MAAM,CAAA;QACb,2DAA2D;QAC3D,SAAS,EAAE,MAAM,EAAE,CAAA;QACnB,uEAAuE;QACvE,YAAY,CAAC,EAAE,MAAM,CAAA;KACtB,CAAC,CAAA;IACF,aAAa,EAAE,MAAM,CAAA;CACtB;AAED;;;;+BAI+B;AAC/B,MAAM,WAAW,gBAAgB;IAC/B,6BAA6B;IAC7B,IAAI,EAAE,MAAM,CAAA;IACZ,wCAAwC;IACxC,KAAK,EAAE,MAAM,CAAA;IACb,uCAAuC;IACvC,KAAK,EAAE,MAAM,CAAA;CACd;AAED,MAAM,WAAW,oBAAoB;IACnC,+CAA+C;IAC/C,KAAK,EAAE,MAAM,CAAA;IACb;0CACsC;IACtC,kBAAkB,EAAE,OAAO,CAAA;IAC3B,OAAO,CAAC,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;CACpE;AAED,MAAM,WAAW,yBAAyB;IACxC;wEACoE;IACpE,MAAM,EAAE,MAAM,CAAA;IACd,2CAA2C;IAC3C,CAAC,EAAE,MAAM,CAAA;IACT,+DAA+D;IAC/D,OAAO,EAAE,MAAM,CAAA;IACf,qEAAqE;IACrE,QAAQ,EAAE,MAAM,CAAA;IAChB,oEAAoE;IACpE,WAAW,CAAC,EAAE;QACZ,SAAS,EAAE,MAAM,CAAA;QACjB,KAAK,EAAE,MAAM,CAAA;QACb,EAAE,EAAE,MAAM,CAAA;KACX,CAAA;CACF;AAED,MAAM,WAAW,cAAc;IAC7B;4BACwB;IACxB,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAAA;IAChC,IAAI,EAAE,KAAK,CAAC;QACV,IAAI,EAAE,cAAc,GAAG,eAAe,GAAG,wBAAwB,CAAA;QACjE,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAAA;QAChC,MAAM,EAAE,MAAM,CAAA;KACf,CAAC,CAAA;IACF;kDAC8C;IAC9C,MAAM,EAAE,MAAM,EAAE,CAAA;CACjB;AAED,MAAM,WAAW,WAAW;IAC1B,2BAA2B;IAC3B,OAAO,EAAE,MAAM,CAAA;IACf,4BAA4B;IAC5B,QAAQ,EAAE,MAAM,CAAA;IAChB;;4CAEwC;IACxC,KAAK,EAAE,MAAM,CAAA;IACb;0EACsE;IACtE,IAAI,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IACtB,wCAAwC;IACxC,MAAM,EAAE,MAAM,CAAA;IACd,sDAAsD;IACtD,OAAO,EAAE,MAAM,CAAA;IACf,oBAAoB;IACpB,SAAS,EAAE,MAAM,CAAA;IACjB,QAAQ,EAAE,MAAM,CAAA;IAChB;;gDAE4C;IAC5C,WAAW,EAAE,OAAO,CAAA;CACrB;AAED,MAAM,WAAW,qBAAqB;IACpC,qBAAqB;IACrB,SAAS,EAAE,MAAM,CAAA;IACjB,QAAQ,EAAE,MAAM,CAAA;IAChB,0EAA0E;IAC1E,WAAW,CAAC,EAAE,MAAM,CAAA;IACpB;;2DAEuD;IACvD,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAA;IACpC;sEACkE;IAClE,gBAAgB,EAAE,MAAM,EAAE,CAAA;IAC1B,wEAAwE;IACxE,eAAe,EAAE,MAAM,EAAE,CAAA;CAC1B;AAED,MAAM,WAAW,cAAc;IAC7B,QAAQ,EAAE,UAAU,GAAG,MAAM,GAAG,QAAQ,GAAG,KAAK,CAAA;IAChD,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,aAAa,GAAG,KAAK,GAAG,aAAa,GAAG,eAAe,CAAA;IAC/E,KAAK,EAAE,MAAM,CAAA;IACb,MAAM,EAAE,MAAM,CAAA;IACd,8DAA8D;IAC9D,YAAY,CAAC,EAAE,MAAM,CAAA;CACtB"}

package/dist/contract/insight-types-fwd.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Forward type re-export so `insight-report.ts` doesn't pull the entire
+ * judge-calibration module's runtime surface into the app-facing contract
+ * type graph.
+ */
+export type { ContinuousAgreement } from '../judge-calibration';
+//# sourceMappingURL=insight-types-fwd.d.ts.map

package/dist/contract/insight-types-fwd.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"insight-types-fwd.d.ts","sourceRoot":"","sources":["../../src/contract/insight-types-fwd.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,YAAY,EAAE,mBAAmB,EAAE,MAAM,sBAAsB,CAAA"}