@tangle-network/agent-eval 0.115.3 → 0.117.0

package/dist/pipelines/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/pipelines/budget-breach.ts","../../src/pipelines/failure-cluster.ts","../../src/pipelines/first-divergence.ts","../../src/pipelines/judge-agreement.ts","../../src/pipelines/regression.ts","../../src/pipelines/stuck-loop.ts","../../src/pipelines/tool-waste.ts"],"sourcesContent":["/**\n * BudgetBreachView — aggregates breach events across the corpus.\n *\n * Answers: which dimensions get hit most often? Which scenarios are\n * underbudgeted? Which variants trigger the most breaches?\n */\n\nimport type { BudgetSpec } from '../trace/schema'\nimport type { TraceStore } from '../trace/store'\n\nexport interface BudgetBreachFinding {\n  runId: string\n  scenarioId: string\n  variantId?: string\n  dimension: keyof BudgetSpec\n  limit: number\n  consumed: number\n  excessRatio: number\n  timestamp: number\n}\n\nexport interface BudgetBreachReport {\n  findings: BudgetBreachFinding[]\n  byDimension: Record<string, number>\n  byScenario: Record<string, number>\n  byVariant: Record<string, number>\n  totalRuns: number\n  breachedRunRatio: number\n}\n\nexport async function budgetBreachView(\n  store: TraceStore,\n  options: { scenarioId?: string; variantId?: string } = {},\n): Promise<BudgetBreachReport> {\n  const runs = await store.listRuns({\n    scenarioId: options.scenarioId,\n    variantId: options.variantId,\n  })\n  const findings: BudgetBreachFinding[] = []\n  const byDimension: Record<string, number> = {}\n  const byScenario: Record<string, number> = {}\n  const byVariant: Record<string, number> = {}\n\n  for (const run of runs) {\n    const entries = await store.budget(run.runId)\n    for (const e of entries) {\n      if (!e.breached) continue\n      const excessRatio = e.limit > 0 ? e.consumed / e.limit : Infinity\n      findings.push({\n        runId: run.runId,\n        scenarioId: run.scenarioId,\n        variantId: run.variantId,\n        dimension: e.dimension,\n        limit: e.limit,\n        consumed: e.consumed,\n        excessRatio,\n        timestamp: e.timestamp,\n      })\n      byDimension[e.dimension] = (byDimension[e.dimension] ?? 0) + 1\n      byScenario[run.scenarioId] = (byScenario[run.scenarioId] ?? 0) + 1\n      if (run.variantId) byVariant[run.variantId] = (byVariant[run.variantId] ?? 0) + 1\n    }\n  }\n\n  const breachedRuns = new Set(findings.map((f) => f.runId))\n  return {\n    findings,\n    byDimension,\n    byScenario,\n    byVariant,\n    totalRuns: runs.length,\n    breachedRunRatio: runs.length > 0 ? breachedRuns.size / runs.length : 0,\n  }\n}\n","/**\n * FailureClusterView — groups failed runs by (failureClass, triggerTool,\n * argHash-prefix) so weekly reviews can prioritize the top-N clusters.\n *\n * Each cluster includes: N runs, scenarios affected, representative\n * error message, a proposed mitigation hint (rule → action table).\n */\n\nimport { classifyFailure, DEFAULT_RULES, type FailureRule } from '../failure-taxonomy'\nimport { argHash, toolSpans } from '../trace/query'\nimport type { FailureClass, Span } from '../trace/schema'\nimport type { TraceStore } from '../trace/store'\n\nexport interface FailureCluster {\n  failureClass: FailureClass\n  /** Tool name when the trigger was a tool span, else undefined. */\n  toolName?: string\n  /** First 16 chars of argHash — clusters similar args. */\n  argPrefix?: string\n  /**\n   * Source dimension when the trigger was a judge span (e.g. `'format'`,\n   * `'safety'`, `'correctness'`). Lets cross-template aggregators\n   * group failures by the dimension that fired without overloading\n   * `argPrefix`. Optional — clusters without this field deserialize cleanly.\n   */\n  dimension?: string\n  runCount: number\n  scenarioIds: string[]\n  exampleError?: string\n  exampleRunId: string\n}\n\nexport interface FailureClusterReport {\n  clusters: FailureCluster[]\n  totalFailures: number\n  totalRuns: number\n}\n\nexport async function failureClusterView(\n  store: TraceStore,\n  options: { rules?: FailureRule[]; minClusterSize?: number } = {},\n): Promise<FailureClusterReport> {\n  const rules = options.rules ?? DEFAULT_RULES\n  const minSize = options.minClusterSize ?? 1\n  const runs = await store.listRuns()\n\n  type Key = string\n  const clusters = new Map<Key, FailureCluster>()\n  let totalFailures = 0\n\n  for (const run of runs) {\n    if (run.status === 'completed' && run.outcome?.pass !== false) continue\n    totalFailures++\n    const spans = await store.spans({ runId: run.runId })\n    const events = await store.events({ runId: run.runId })\n    const cls = classifyFailure({ run, spans, events }, rules)\n\n    let toolName: string | undefined\n    let argPrefix: string | undefined\n    let dimension: string | undefined\n    if (cls.triggerSpanId) {\n      const trig = spans.find((s) => s.spanId === cls.triggerSpanId)\n      if (trig?.kind === 'tool') {\n        toolName = trig.toolName\n        argPrefix = argHash(trig.args).slice(0, 16)\n      } else if (trig?.kind === 'judge') {\n        dimension = trig.dimension\n      }\n    }\n    // Fallback: look at the last errored tool span\n    if (!toolName) {\n      const ts = await toolSpans(store, run.runId)\n      const errored = ts.filter((t) => t.status === 'error').pop()\n      if (errored) {\n        toolName = errored.toolName\n        argPrefix = argHash(errored.args).slice(0, 16)\n      }\n    }\n    // Secondary signal: any judge span on the failed run carries a\n    // dimension. Useful when the rule classified by judge score but\n    // didn't surface the trigger span (or surfaced a non-judge span).\n    if (!dimension) {\n      const judge = spans.find((s) => s.kind === 'judge' && typeof s.dimension === 'string')\n      if (judge?.kind === 'judge') dimension = judge.dimension\n    }\n\n    const key = `${cls.failureClass}|${toolName ?? ''}|${argPrefix ?? ''}|${dimension ?? ''}`\n    let cluster = clusters.get(key)\n    if (!cluster) {\n      cluster = {\n        failureClass: cls.failureClass,\n        toolName,\n        argPrefix,\n        dimension,\n        runCount: 0,\n        scenarioIds: [],\n        exampleRunId: run.runId,\n        exampleError: firstErrorMessage(spans) ?? cls.reason,\n      }\n      clusters.set(key, cluster)\n    }\n    cluster.runCount++\n    if (!cluster.scenarioIds.includes(run.scenarioId)) cluster.scenarioIds.push(run.scenarioId)\n  }\n\n  const arr = [...clusters.values()]\n    .filter((c) => c.runCount >= minSize)\n    .sort((a, b) => b.runCount - a.runCount)\n\n  return { clusters: arr, totalFailures, totalRuns: runs.length }\n}\n\nfunction firstErrorMessage(spans: Span[]): string | undefined {\n  const errored = spans.find((s) => s.status === 'error')\n  return errored?.error\n}\n","/**\n * FirstDivergenceView — aligns two trajectories by step index, reports\n * the first step where they differ.\n *\n * \"Differ\" is configurable — default is (kind, toolName if tool, model\n * if llm). Use this view to attribute \"why is variant B better?\" to a\n * specific step rather than an aggregate mean delta.\n */\n\nimport type { TraceStore } from '../trace/store'\nimport { buildTrajectory, type Trajectory, type TrajectoryStep } from '../trajectory'\n\nexport interface DivergenceReport {\n  runA: string\n  runB: string\n  firstDivergenceIndex: number | null\n  aStep?: TrajectoryStep\n  bStep?: TrajectoryStep\n  reason?: string\n  /** Common prefix length (steps that matched). */\n  commonPrefixLen: number\n}\n\nexport interface DivergenceOptions {\n  /** Returns true if two steps are considered equal. Default: kind + tool/model match. */\n  stepEquals?: (a: TrajectoryStep, b: TrajectoryStep) => boolean\n}\n\nexport async function firstDivergenceView(\n  store: TraceStore,\n  runA: string,\n  runB: string,\n  options: DivergenceOptions = {},\n): Promise<DivergenceReport> {\n  const [a, b] = await Promise.all([buildTrajectory(store, runA), buildTrajectory(store, runB)])\n  const eq = options.stepEquals ?? defaultStepEquals\n  const minLen = Math.min(a.steps.length, b.steps.length)\n  for (let i = 0; i < minLen; i++) {\n    const aStep = a.steps[i]!\n    const bStep = b.steps[i]!\n    if (!eq(aStep, bStep)) {\n      return {\n        runA,\n        runB,\n        firstDivergenceIndex: i,\n        aStep,\n        bStep,\n        reason: describeDifference(aStep, bStep),\n        commonPrefixLen: i,\n      }\n    }\n  }\n  if (a.steps.length === b.steps.length) {\n    return { runA, runB, firstDivergenceIndex: null, commonPrefixLen: minLen }\n  }\n  const longer: Trajectory = a.steps.length > b.steps.length ? a : b\n  const extra = longer.steps.length - minLen\n  // minLen === 0 means one trajectory is empty: divergence is the first step\n  // itself (index 0), and the absent side has no step to surface.\n  const reason =\n    minLen === 0\n      ? `one trajectory is empty; the other has ${extra} step(s) starting at index 0`\n      : `one trajectory has ${extra} more step(s) after index ${minLen - 1}`\n  return {\n    runA,\n    runB,\n    firstDivergenceIndex: minLen,\n    aStep: a.steps[minLen],\n    bStep: b.steps[minLen],\n    reason,\n    commonPrefixLen: minLen,\n  }\n}\n\nfunction defaultStepEquals(a: TrajectoryStep, b: TrajectoryStep): boolean {\n  if (a.span.kind !== b.span.kind) return false\n  if (a.span.kind === 'tool' && b.span.kind === 'tool') return a.span.toolName === b.span.toolName\n  if (a.span.kind === 'llm' && b.span.kind === 'llm') return a.span.model === b.span.model\n  if (a.span.kind === 'judge' && b.span.kind === 'judge')\n    return a.span.dimension === b.span.dimension\n  return a.span.name === b.span.name\n}\n\nfunction describeDifference(a: TrajectoryStep, b: TrajectoryStep): string {\n  if (a.span.kind !== b.span.kind) return `kind ${a.span.kind} vs ${b.span.kind}`\n  if (a.span.kind === 'tool' && b.span.kind === 'tool' && a.span.toolName !== b.span.toolName) {\n    return `tool ${a.span.toolName} vs ${b.span.toolName}`\n  }\n  if (a.span.kind === 'llm' && b.span.kind === 'llm' && a.span.model !== b.span.model) {\n    return `model ${a.span.model} vs ${b.span.model}`\n  }\n  return `name \"${a.span.name}\" vs \"${b.span.name}\"`\n}\n","/**\n * JudgeAgreementView — pairwise agreement between judges across the\n * corpus, grouped by dimension.\n *\n * Output drives two workflows:\n *   - Judge robustness audit: \"does Claude agree with GPT at κ ≥ 0.6?\"\n *   - Calibration tracking: κ vs golden human labels over time (by\n *     providing a `humanGoldenJudgeId`).\n */\n\nimport { interRaterReliability, pearsonR } from '../statistics'\nimport type { JudgeSpan } from '../trace/schema'\nimport type { TraceStore } from '../trace/store'\n\nexport interface JudgePair {\n  judgeA: string\n  judgeB: string\n  dimension: string\n  /** Number of (targetSpanId, dimension) tuples both judges scored. */\n  commonItems: number\n  pearson: number\n  krippendorff: number\n}\n\nexport interface JudgeAgreementReport {\n  pairs: JudgePair[]\n  dimensions: string[]\n  judgeIds: string[]\n}\n\nexport async function judgeAgreementView(store: TraceStore): Promise<JudgeAgreementReport> {\n  const all = (await store.spans({ kind: 'judge' })).filter(\n    (s): s is JudgeSpan => s.kind === 'judge',\n  )\n  if (all.length === 0) return { pairs: [], dimensions: [], judgeIds: [] }\n\n  const byDimension = new Map<string, JudgeSpan[]>()\n  for (const s of all) {\n    const arr = byDimension.get(s.dimension) ?? []\n    arr.push(s)\n    byDimension.set(s.dimension, arr)\n  }\n\n  const judgeIds = [...new Set(all.map((s) => s.judgeId))].sort()\n  const pairs: JudgePair[] = []\n  for (const [dim, spans] of byDimension) {\n    const byJudge = new Map<string, Map<string, number>>()\n    for (const s of spans) {\n      const m = byJudge.get(s.judgeId) ?? new Map<string, number>()\n      m.set(s.targetSpanId, s.score)\n      byJudge.set(s.judgeId, m)\n    }\n    const judgesHere = [...byJudge.keys()]\n    for (let i = 0; i < judgesHere.length; i++) {\n      for (let j = i + 1; j < judgesHere.length; j++) {\n        const judgeI = judgesHere[i]!\n        const judgeJ = judgesHere[j]!\n        const a = byJudge.get(judgeI)!\n        const b = byJudge.get(judgeJ)!\n        const common: Array<[number, number]> = []\n        for (const [target, scoreA] of a) {\n          const scoreB = b.get(target)\n          if (scoreB !== undefined) common.push([scoreA, scoreB])\n        }\n        if (common.length < 2) continue\n        const judgeScores = common.map(\n          ([scoreA, scoreB]) =>\n            [\n              { judgeName: judgeI, dimension: dim, score: scoreA, reasoning: '' },\n              { judgeName: judgeJ, dimension: dim, score: scoreB, reasoning: '' },\n            ] as const,\n        )\n        const k = interRaterReliability(\n          judgeScores[0]!.map((_, k2) => judgeScores.map((pair) => pair[k2]!)),\n        )\n        pairs.push({\n          judgeA: judgeI,\n          judgeB: judgeJ,\n          dimension: dim,\n          commonItems: common.length,\n          pearson: pearsonR(\n            common.map((c) => c[0]),\n            common.map((c) => c[1]),\n          ),\n          krippendorff: k,\n        })\n      }\n    }\n  }\n\n  return {\n    pairs: pairs.sort((a, b) => b.commonItems - a.commonItems),\n    dimensions: [...byDimension.keys()].sort(),\n    judgeIds,\n  }\n}\n","/**\n * RegressionView — compares a candidate slice to a baseline slice on a\n * named metric. Delegates the statistics (Welch's t-test, Cohen's d,\n * IQR stability) to `baseline.ts`.\n *\n * This is the entry point for CI regression gates: \"given runs tagged\n * release=A and release=B, did any metric regress?\"\n */\n\nimport { type BaselineOptions, type BaselineReport, compareToBaseline } from '../baseline'\nimport { aggregateLlm, llmSpans, runFailureClass } from '../trace/query'\nimport type { Run } from '../trace/schema'\nimport type { RunFilter, TraceStore } from '../trace/store'\n\nexport interface RegressionSpec {\n  metric: string\n  higherIsBetter: boolean\n  /** Extract a scalar from a run. Default extractors handle common metrics. */\n  extract?: (run: Run, store: TraceStore) => Promise<number | null>\n}\n\nexport interface RegressionOptions extends BaselineOptions {\n  baseline: RunFilter\n  candidate: RunFilter\n}\n\nexport async function regressionView(\n  store: TraceStore,\n  metrics: RegressionSpec[],\n  options: RegressionOptions,\n): Promise<BaselineReport> {\n  const baselineRuns = await store.listRuns(options.baseline)\n  const candidateRuns = await store.listRuns(options.candidate)\n  const samples = await Promise.all(\n    metrics.map(async (m) => {\n      const extract = m.extract ?? defaultExtract(m.metric)\n      const baseline = await extractAll(baselineRuns, extract, store)\n      const candidate = await extractAll(candidateRuns, extract, store)\n      return { metric: m.metric, higherIsBetter: m.higherIsBetter, baseline, candidate }\n    }),\n  )\n  return compareToBaseline(samples, options)\n}\n\nasync function extractAll(\n  runs: Run[],\n  extract: (r: Run, s: TraceStore) => Promise<number | null>,\n  store: TraceStore,\n): Promise<number[]> {\n  const out: number[] = []\n  for (const r of runs) {\n    const v = await extract(r, store)\n    if (v !== null && Number.isFinite(v)) out.push(v)\n  }\n  return out\n}\n\nfunction defaultExtract(metric: string): (run: Run, store: TraceStore) => Promise<number | null> {\n  return async (run, store) => {\n    switch (metric) {\n      case 'score':\n      case 'overallScore':\n        return run.outcome?.score ?? null\n      case 'pass':\n        return run.outcome?.pass === true ? 1 : 0\n      case 'durationMs':\n        return run.endedAt && run.startedAt ? run.endedAt - run.startedAt : null\n      case 'costUsd': {\n        const llm = await llmSpans(store, run.runId)\n        return aggregateLlm(llm).costUsd\n      }\n      case 'inputTokens': {\n        const llm = await llmSpans(store, run.runId)\n        return aggregateLlm(llm).inputTokens\n      }\n      case 'outputTokens': {\n        const llm = await llmSpans(store, run.runId)\n        return aggregateLlm(llm).outputTokens\n      }\n      case 'failureClass': {\n        return runFailureClass(run) === 'success' ? 1 : 0\n      }\n      default:\n        return null\n    }\n  }\n}\n","/**\n * StuckLoopView — detects when an agent calls the same tool with the\n * same (or structurally similar) arguments ≥ N times in a short window.\n *\n * Rationale: agents that loop are the number-one production failure\n * mode on long-horizon flows. The view returns (runId, toolName,\n * argHash, occurrences, windowMs) for each detected loop plus a\n * fraction of runs affected.\n */\n\nimport { argHash, toolSpans } from '../trace/query'\nimport type { TraceStore } from '../trace/store'\n\nexport interface StuckLoopFinding {\n  runId: string\n  toolName: string\n  argHash: string\n  occurrences: number\n  spanIds: string[]\n  /** Milliseconds between first and last call in the loop. */\n  windowMs: number\n}\n\nexport interface StuckLoopReport {\n  findings: StuckLoopFinding[]\n  affectedRunRatio: number\n  totalRuns: number\n}\n\nexport interface StuckLoopOptions {\n  /** Minimum call count to flag a loop (default 3). */\n  minOccurrences?: number\n  /** Filter to a specific runId; omit to scan the entire corpus. */\n  runId?: string\n}\n\nexport async function stuckLoopView(\n  store: TraceStore,\n  options: StuckLoopOptions = {},\n): Promise<StuckLoopReport> {\n  const minOccurrences = options.minOccurrences ?? 3\n  const runs = options.runId\n    ? [{ runId: options.runId }]\n    : (await store.listRuns()).map((r) => ({ runId: r.runId }))\n\n  const findings: StuckLoopFinding[] = []\n  for (const { runId } of runs) {\n    const tools = await toolSpans(store, runId)\n    const byKey = new Map<string, { spans: typeof tools; argHash: string; toolName: string }>()\n    for (const t of tools) {\n      const h = argHash(t.args)\n      // NUL delimiter never appears in a tool name or a JSON argHash, so the\n      // key cannot collide; toolName is carried in the bucket rather than\n      // re-derived by splitting the key (which mislabeled any tool whose name\n      // contained the delimiter, e.g. \"shell|grep\").\n      const key = `${t.toolName}\\u0000${h}`\n      const bucket = byKey.get(key) ?? { spans: [], argHash: h, toolName: t.toolName }\n      bucket.spans.push(t)\n      byKey.set(key, bucket)\n    }\n    for (const { spans, argHash: h, toolName } of byKey.values()) {\n      if (spans.length < minOccurrences) continue\n      const sorted = [...spans].sort((a, b) => a.startedAt - b.startedAt)\n      const first = sorted[0]!.startedAt\n      const last = sorted[sorted.length - 1]!.startedAt\n      findings.push({\n        runId,\n        toolName,\n        argHash: h,\n        occurrences: sorted.length,\n        spanIds: sorted.map((s) => s.spanId),\n        windowMs: last - first,\n      })\n    }\n  }\n\n  const affectedRuns = new Set(findings.map((f) => f.runId))\n  return {\n    findings,\n    affectedRunRatio: runs.length > 0 ? affectedRuns.size / runs.length : 0,\n    totalRuns: runs.length,\n  }\n}\n","/**\n * ToolWasteView — fraction of tool calls whose results weren't used\n * downstream. Without a \"used\" signal we fall back to structural\n * proxies: error calls, duplicate calls, and tool calls followed by\n * zero subsequent LLM spans are all considered waste.\n *\n * Consumers can pass a `usageOracle` that inspects a tool span and\n * returns true iff the tool's result appears in a later LLM message,\n * artifact, or state mutation — that's the canonical definition; the\n * default heuristic is a reasonable fallback.\n */\n\nimport { computeToolUseMetrics } from '../tool-use-metrics'\nimport { llmSpans, toolSpans } from '../trace/query'\nimport type { LlmSpan, ToolSpan } from '../trace/schema'\nimport type { TraceStore } from '../trace/store'\n\nexport interface ToolWasteFinding {\n  runId: string\n  wastedCalls: number\n  totalCalls: number\n  wasteRate: number\n}\n\nexport interface ToolWasteReport {\n  byRun: ToolWasteFinding[]\n  overallWasteRate: number\n}\n\nexport interface ToolWasteOptions {\n  runId?: string\n  usageOracle?: (tool: ToolSpan, later: { llm: Awaited<ReturnType<typeof llmSpans>> }) => boolean\n}\n\nexport async function toolWasteView(\n  store: TraceStore,\n  options: ToolWasteOptions = {},\n): Promise<ToolWasteReport> {\n  const runs = options.runId ? [options.runId] : (await store.listRuns()).map((r) => r.runId)\n\n  const byRun: ToolWasteFinding[] = []\n  let totalCalls = 0\n  let totalWasted = 0\n  for (const runId of runs) {\n    const tools = await toolSpans(store, runId)\n    if (tools.length === 0) {\n      byRun.push({ runId, wastedCalls: 0, totalCalls: 0, wasteRate: 0 })\n      continue\n    }\n    const llms = await llmSpans(store, runId)\n    // Sort LLM spans once by start time, then build a suffix index of the\n    // concatenated message text. `suffixText[i]` is the haystack of every\n    // string message content in spans[i..]. Per tool we binary-search the\n    // first span started strictly after the tool, then test that one suffix\n    // — turning the per-tool O(llms × messages × content) scan into a single\n    // O(log llms) lookup over precomputed text.\n    const sortedLlm = [...llms].sort((a, b) => a.startedAt - b.startedAt)\n    const startTimes = sortedLlm.map((l) => l.startedAt)\n    const suffixText = buildSuffixText(sortedLlm)\n    let wasted = 0\n    for (const t of tools) {\n      if (t.status === 'error') {\n        wasted++\n        continue\n      }\n      // First LLM span started strictly after this tool (upper-bound search).\n      const cutoff = upperBound(startTimes, t.startedAt)\n      if (options.usageOracle) {\n        if (!options.usageOracle(t, { llm: sortedLlm.slice(cutoff) })) wasted++\n      } else {\n        // Default heuristic: a tool whose result is NOT mentioned in any\n        // later LLM input message is likely wasted. An empty/null result has\n        // no payload to propagate downstream — there is nothing to find in a\n        // later message, so it is not evidence of waste; skip it.\n        const resultStr = stringify(t.result)\n        if (resultStr === '') continue\n        const haystack = suffixText[cutoff] ?? ''\n        const used = haystack.includes(resultStr.slice(0, 120))\n        if (!used) wasted++\n      }\n    }\n    const wasteRate = wasted / tools.length\n    byRun.push({ runId, wastedCalls: wasted, totalCalls: tools.length, wasteRate })\n    totalCalls += tools.length\n    totalWasted += wasted\n  }\n  return { byRun, overallWasteRate: totalCalls > 0 ? totalWasted / totalCalls : 0 }\n}\n\n/**\n * Build per-position suffix haystacks: result[i] is the concatenation of every\n * string message content in spans[i..end]. Built back-to-front so each entry\n * reuses the next one — O(total message text) rather than O(spans²).\n */\nfunction buildSuffixText(spans: LlmSpan[]): string[] {\n  const result = new Array<string>(spans.length + 1)\n  result[spans.length] = ''\n  for (let i = spans.length - 1; i >= 0; i--) {\n    const own = spans[i]!.messages.map((m) =>\n      typeof m.content === 'string' ? m.content : '',\n    ).join('\\n')\n    result[i] = `${own}\\n${result[i + 1]}`\n  }\n  return result\n}\n\n/** Index of the first element strictly greater than `target` in a sorted array. */\nfunction upperBound(sorted: number[], target: number): number {\n  let lo = 0\n  let hi = sorted.length\n  while (lo < hi) {\n    const mid = (lo + hi) >>> 1\n    if (sorted[mid]! <= target) lo = mid + 1\n    else hi = mid\n  }\n  return lo\n}\n\nfunction stringify(v: unknown): string {\n  if (v === null || v === undefined) return ''\n  if (typeof v === 'string') return v\n  try {\n    return JSON.stringify(v)\n  } catch {\n    return String(v)\n  }\n}\n\n// Re-export for convenience in consumers that want both descriptive and usage metrics.\nexport { computeToolUseMetrics }\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AA8BA,eAAsB,iBACpB,OACA,UAAuD,CAAC,GAC3B;AAC7B,QAAM,OAAO,MAAM,MAAM,SAAS;AAAA,IAChC,YAAY,QAAQ;AAAA,IACpB,WAAW,QAAQ;AAAA,EACrB,CAAC;AACD,QAAM,WAAkC,CAAC;AACzC,QAAM,cAAsC,CAAC;AAC7C,QAAM,aAAqC,CAAC;AAC5C,QAAM,YAAoC,CAAC;AAE3C,aAAW,OAAO,MAAM;AACtB,UAAM,UAAU,MAAM,MAAM,OAAO,IAAI,KAAK;AAC5C,eAAW,KAAK,SAAS;AACvB,UAAI,CAAC,EAAE,SAAU;AACjB,YAAM,cAAc,EAAE,QAAQ,IAAI,EAAE,WAAW,EAAE,QAAQ;AACzD,eAAS,KAAK;AAAA,QACZ,OAAO,IAAI;AAAA,QACX,YAAY,IAAI;AAAA,QAChB,WAAW,IAAI;AAAA,QACf,WAAW,EAAE;AAAA,QACb,OAAO,EAAE;AAAA,QACT,UAAU,EAAE;AAAA,QACZ;AAAA,QACA,WAAW,EAAE;AAAA,MACf,CAAC;AACD,kBAAY,EAAE,SAAS,KAAK,YAAY,EAAE,SAAS,KAAK,KAAK;AAC7D,iBAAW,IAAI,UAAU,KAAK,WAAW,IAAI,UAAU,KAAK,KAAK;AACjE,UAAI,IAAI,UAAW,WAAU,IAAI,SAAS,KAAK,UAAU,IAAI,SAAS,KAAK,KAAK;AAAA,IAClF;AAAA,EACF;AAEA,QAAM,eAAe,IAAI,IAAI,SAAS,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC;AACzD,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,WAAW,KAAK;AAAA,IAChB,kBAAkB,KAAK,SAAS,IAAI,aAAa,OAAO,KAAK,SAAS;AAAA,EACxE;AACF;;;ACnCA,eAAsB,mBACpB,OACA,UAA8D,CAAC,GAChC;AAC/B,QAAM,QAAQ,QAAQ,SAAS;AAC/B,QAAM,UAAU,QAAQ,kBAAkB;AAC1C,QAAM,OAAO,MAAM,MAAM,SAAS;AAGlC,QAAM,WAAW,oBAAI,IAAyB;AAC9C,MAAI,gBAAgB;AAEpB,aAAW,OAAO,MAAM;AACtB,QAAI,IAAI,WAAW,eAAe,IAAI,SAAS,SAAS,MAAO;AAC/D;AACA,UAAM,QAAQ,MAAM,MAAM,MAAM,EAAE,OAAO,IAAI,MAAM,CAAC;AACpD,UAAM,SAAS,MAAM,MAAM,OAAO,EAAE,OAAO,IAAI,MAAM,CAAC;AACtD,UAAM,MAAM,gBAAgB,EAAE,KAAK,OAAO,OAAO,GAAG,KAAK;AAEzD,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI,IAAI,eAAe;AACrB,YAAM,OAAO,MAAM,KAAK,CAAC,MAAM,EAAE,WAAW,IAAI,aAAa;AAC7D,UAAI,MAAM,SAAS,QAAQ;AACzB,mBAAW,KAAK;AAChB,oBAAY,QAAQ,KAAK,IAAI,EAAE,MAAM,GAAG,EAAE;AAAA,MAC5C,WAAW,MAAM,SAAS,SAAS;AACjC,oBAAY,KAAK;AAAA,MACnB;AAAA,IACF;AAEA,QAAI,CAAC,UAAU;AACb,YAAM,KAAK,MAAM,UAAU,OAAO,IAAI,KAAK;AAC3C,YAAM,UAAU,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,OAAO,EAAE,IAAI;AAC3D,UAAI,SAAS;AACX,mBAAW,QAAQ;AACnB,oBAAY,QAAQ,QAAQ,IAAI,EAAE,MAAM,GAAG,EAAE;AAAA,MAC/C;AAAA,IACF;AAIA,QAAI,CAAC,WAAW;AACd,YAAM,QAAQ,MAAM,KAAK,CAAC,MAAM,EAAE,SAAS,WAAW,OAAO,EAAE,cAAc,QAAQ;AACrF,UAAI,OAAO,SAAS,QAAS,aAAY,MAAM;AAAA,IACjD;AAEA,UAAM,MAAM,GAAG,IAAI,YAAY,IAAI,YAAY,EAAE,IAAI,aAAa,EAAE,IAAI,aAAa,EAAE;AACvF,QAAI,UAAU,SAAS,IAAI,GAAG;AAC9B,QAAI,CAAC,SAAS;AACZ,gBAAU;AAAA,QACR,cAAc,IAAI;AAAA,QAClB;AAAA,QACA;AAAA,QACA;AAAA,QACA,UAAU;AAAA,QACV,aAAa,CAAC;AAAA,QACd,cAAc,IAAI;AAAA,QAClB,cAAc,kBAAkB,KAAK,KAAK,IAAI;AAAA,MAChD;AACA,eAAS,IAAI,KAAK,OAAO;AAAA,IAC3B;AACA,YAAQ;AACR,QAAI,CAAC,QAAQ,YAAY,SAAS,IAAI,UAAU,EAAG,SAAQ,YAAY,KAAK,IAAI,UAAU;AAAA,EAC5F;AAEA,QAAM,MAAM,CAAC,GAAG,SAAS,OAAO,CAAC,EAC9B,OAAO,CAAC,MAAM,EAAE,YAAY,OAAO,EACnC,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AAEzC,SAAO,EAAE,UAAU,KAAK,eAAe,WAAW,KAAK,OAAO;AAChE;AAEA,SAAS,kBAAkB,OAAmC;AAC5D,QAAM,UAAU,MAAM,KAAK,CAAC,MAAM,EAAE,WAAW,OAAO;AACtD,SAAO,SAAS;AAClB;;;ACvFA,eAAsB,oBACpB,OACA,MACA,MACA,UAA6B,CAAC,GACH;AAC3B,QAAM,CAAC,GAAG,CAAC,IAAI,MAAM,QAAQ,IAAI,CAAC,gBAAgB,OAAO,IAAI,GAAG,gBAAgB,OAAO,IAAI,CAAC,CAAC;AAC7F,QAAM,KAAK,QAAQ,cAAc;AACjC,QAAM,SAAS,KAAK,IAAI,EAAE,MAAM,QAAQ,EAAE,MAAM,MAAM;AACtD,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,UAAM,QAAQ,EAAE,MAAM,CAAC;AACvB,UAAM,QAAQ,EAAE,MAAM,CAAC;AACvB,QAAI,CAAC,GAAG,OAAO,KAAK,GAAG;AACrB,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA,sBAAsB;AAAA,QACtB;AAAA,QACA;AAAA,QACA,QAAQ,mBAAmB,OAAO,KAAK;AAAA,QACvC,iBAAiB;AAAA,MACnB;AAAA,IACF;AAAA,EACF;AACA,MAAI,EAAE,MAAM,WAAW,EAAE,MAAM,QAAQ;AACrC,WAAO,EAAE,MAAM,MAAM,sBAAsB,MAAM,iBAAiB,OAAO;AAAA,EAC3E;AACA,QAAM,SAAqB,EAAE,MAAM,SAAS,EAAE,MAAM,SAAS,IAAI;AACjE,QAAM,QAAQ,OAAO,MAAM,SAAS;AAGpC,QAAM,SACJ,WAAW,IACP,0CAA0C,KAAK,iCAC/C,sBAAsB,KAAK,6BAA6B,SAAS,CAAC;AACxE,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,sBAAsB;AAAA,IACtB,OAAO,EAAE,MAAM,MAAM;AAAA,IACrB,OAAO,EAAE,MAAM,MAAM;AAAA,IACrB;AAAA,IACA,iBAAiB;AAAA,EACnB;AACF;AAEA,SAAS,kBAAkB,GAAmB,GAA4B;AACxE,MAAI,EAAE,KAAK,SAAS,EAAE,KAAK,KAAM,QAAO;AACxC,MAAI,EAAE,KAAK,SAAS,UAAU,EAAE,KAAK,SAAS,OAAQ,QAAO,EAAE,KAAK,aAAa,EAAE,KAAK;AACxF,MAAI,EAAE,KAAK,SAAS,SAAS,EAAE,KAAK,SAAS,MAAO,QAAO,EAAE,KAAK,UAAU,EAAE,KAAK;AACnF,MAAI,EAAE,KAAK,SAAS,WAAW,EAAE,KAAK,SAAS;AAC7C,WAAO,EAAE,KAAK,cAAc,EAAE,KAAK;AACrC,SAAO,EAAE,KAAK,SAAS,EAAE,KAAK;AAChC;AAEA,SAAS,mBAAmB,GAAmB,GAA2B;AACxE,MAAI,EAAE,KAAK,SAAS,EAAE,KAAK,KAAM,QAAO,QAAQ,EAAE,KAAK,IAAI,OAAO,EAAE,KAAK,IAAI;AAC7E,MAAI,EAAE,KAAK,SAAS,UAAU,EAAE,KAAK,SAAS,UAAU,EAAE,KAAK,aAAa,EAAE,KAAK,UAAU;AAC3F,WAAO,QAAQ,EAAE,KAAK,QAAQ,OAAO,EAAE,KAAK,QAAQ;AAAA,EACtD;AACA,MAAI,EAAE,KAAK,SAAS,SAAS,EAAE,KAAK,SAAS,SAAS,EAAE,KAAK,UAAU,EAAE,KAAK,OAAO;AACnF,WAAO,SAAS,EAAE,KAAK,KAAK,OAAO,EAAE,KAAK,KAAK;AAAA,EACjD;AACA,SAAO,SAAS,EAAE,KAAK,IAAI,SAAS,EAAE,KAAK,IAAI;AACjD;;;AC9DA,eAAsB,mBAAmB,OAAkD;AACzF,QAAM,OAAO,MAAM,MAAM,MAAM,EAAE,MAAM,QAAQ,CAAC,GAAG;AAAA,IACjD,CAAC,MAAsB,EAAE,SAAS;AAAA,EACpC;AACA,MAAI,IAAI,WAAW,EAAG,QAAO,EAAE,OAAO,CAAC,GAAG,YAAY,CAAC,GAAG,UAAU,CAAC,EAAE;AAEvE,QAAM,cAAc,oBAAI,IAAyB;AACjD,aAAW,KAAK,KAAK;AACnB,UAAM,MAAM,YAAY,IAAI,EAAE,SAAS,KAAK,CAAC;AAC7C,QAAI,KAAK,CAAC;AACV,gBAAY,IAAI,EAAE,WAAW,GAAG;AAAA,EAClC;AAEA,QAAM,WAAW,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EAAE,KAAK;AAC9D,QAAM,QAAqB,CAAC;AAC5B,aAAW,CAAC,KAAK,KAAK,KAAK,aAAa;AACtC,UAAM,UAAU,oBAAI,IAAiC;AACrD,eAAW,KAAK,OAAO;AACrB,YAAM,IAAI,QAAQ,IAAI,EAAE,OAAO,KAAK,oBAAI,IAAoB;AAC5D,QAAE,IAAI,EAAE,cAAc,EAAE,KAAK;AAC7B,cAAQ,IAAI,EAAE,SAAS,CAAC;AAAA,IAC1B;AACA,UAAM,aAAa,CAAC,GAAG,QAAQ,KAAK,CAAC;AACrC,aAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,eAAS,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC9C,cAAM,SAAS,WAAW,CAAC;AAC3B,cAAM,SAAS,WAAW,CAAC;AAC3B,cAAM,IAAI,QAAQ,IAAI,MAAM;AAC5B,cAAM,IAAI,QAAQ,IAAI,MAAM;AAC5B,cAAM,SAAkC,CAAC;AACzC,mBAAW,CAAC,QAAQ,MAAM,KAAK,GAAG;AAChC,gBAAM,SAAS,EAAE,IAAI,MAAM;AAC3B,cAAI,WAAW,OAAW,QAAO,KAAK,CAAC,QAAQ,MAAM,CAAC;AAAA,QACxD;AACA,YAAI,OAAO,SAAS,EAAG;AACvB,cAAM,cAAc,OAAO;AAAA,UACzB,CAAC,CAAC,QAAQ,MAAM,MACd;AAAA,YACE,EAAE,WAAW,QAAQ,WAAW,KAAK,OAAO,QAAQ,WAAW,GAAG;AAAA,YAClE,EAAE,WAAW,QAAQ,WAAW,KAAK,OAAO,QAAQ,WAAW,GAAG;AAAA,UACpE;AAAA,QACJ;AACA,cAAM,IAAI;AAAA,UACR,YAAY,CAAC,EAAG,IAAI,CAAC,GAAG,OAAO,YAAY,IAAI,CAAC,SAAS,KAAK,EAAE,CAAE,CAAC;AAAA,QACrE;AACA,cAAM,KAAK;AAAA,UACT,QAAQ;AAAA,UACR,QAAQ;AAAA,UACR,WAAW;AAAA,UACX,aAAa,OAAO;AAAA,UACpB,SAAS;AAAA,YACP,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;AAAA,YACtB,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;AAAA,UACxB;AAAA,UACA,cAAc;AAAA,QAChB,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL,OAAO,MAAM,KAAK,CAAC,GAAG,MAAM,EAAE,cAAc,EAAE,WAAW;AAAA,IACzD,YAAY,CAAC,GAAG,YAAY,KAAK,CAAC,EAAE,KAAK;AAAA,IACzC;AAAA,EACF;AACF;;;ACrEA,eAAsB,eACpB,OACA,SACA,SACyB;AACzB,QAAM,eAAe,MAAM,MAAM,SAAS,QAAQ,QAAQ;AAC1D,QAAM,gBAAgB,MAAM,MAAM,SAAS,QAAQ,SAAS;AAC5D,QAAM,UAAU,MAAM,QAAQ;AAAA,IAC5B,QAAQ,IAAI,OAAO,MAAM;AACvB,YAAM,UAAU,EAAE,WAAW,eAAe,EAAE,MAAM;AACpD,YAAM,WAAW,MAAM,WAAW,cAAc,SAAS,KAAK;AAC9D,YAAM,YAAY,MAAM,WAAW,eAAe,SAAS,KAAK;AAChE,aAAO,EAAE,QAAQ,EAAE,QAAQ,gBAAgB,EAAE,gBAAgB,UAAU,UAAU;AAAA,IACnF,CAAC;AAAA,EACH;AACA,SAAO,kBAAkB,SAAS,OAAO;AAC3C;AAEA,eAAe,WACb,MACA,SACA,OACmB;AACnB,QAAM,MAAgB,CAAC;AACvB,aAAW,KAAK,MAAM;AACpB,UAAM,IAAI,MAAM,QAAQ,GAAG,KAAK;AAChC,QAAI,MAAM,QAAQ,OAAO,SAAS,CAAC,EAAG,KAAI,KAAK,CAAC;AAAA,EAClD;AACA,SAAO;AACT;AAEA,SAAS,eAAe,QAAyE;AAC/F,SAAO,OAAO,KAAK,UAAU;AAC3B,YAAQ,QAAQ;AAAA,MACd,KAAK;AAAA,MACL,KAAK;AACH,eAAO,IAAI,SAAS,SAAS;AAAA,MAC/B,KAAK;AACH,eAAO,IAAI,SAAS,SAAS,OAAO,IAAI;AAAA,MAC1C,KAAK;AACH,eAAO,IAAI,WAAW,IAAI,YAAY,IAAI,UAAU,IAAI,YAAY;AAAA,MACtE,KAAK,WAAW;AACd,cAAM,MAAM,MAAM,SAAS,OAAO,IAAI,KAAK;AAC3C,eAAO,aAAa,GAAG,EAAE;AAAA,MAC3B;AAAA,MACA,KAAK,eAAe;AAClB,cAAM,MAAM,MAAM,SAAS,OAAO,IAAI,KAAK;AAC3C,eAAO,aAAa,GAAG,EAAE;AAAA,MAC3B;AAAA,MACA,KAAK,gBAAgB;AACnB,cAAM,MAAM,MAAM,SAAS,OAAO,IAAI,KAAK;AAC3C,eAAO,aAAa,GAAG,EAAE;AAAA,MAC3B;AAAA,MACA,KAAK,gBAAgB;AACnB,eAAO,gBAAgB,GAAG,MAAM,YAAY,IAAI;AAAA,MAClD;AAAA,MACA;AACE,eAAO;AAAA,IACX;AAAA,EACF;AACF;;;AClDA,eAAsB,cACpB,OACA,UAA4B,CAAC,GACH;AAC1B,QAAM,iBAAiB,QAAQ,kBAAkB;AACjD,QAAM,OAAO,QAAQ,QACjB,CAAC,EAAE,OAAO,QAAQ,MAAM,CAAC,KACxB,MAAM,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE;AAE5D,QAAM,WAA+B,CAAC;AACtC,aAAW,EAAE,MAAM,KAAK,MAAM;AAC5B,UAAM,QAAQ,MAAM,UAAU,OAAO,KAAK;AAC1C,UAAM,QAAQ,oBAAI,IAAwE;AAC1F,eAAW,KAAK,OAAO;AACrB,YAAM,IAAI,QAAQ,EAAE,IAAI;AAKxB,YAAM,MAAM,GAAG,EAAE,QAAQ,KAAS,CAAC;AACnC,YAAM,SAAS,MAAM,IAAI,GAAG,KAAK,EAAE,OAAO,CAAC,GAAG,SAAS,GAAG,UAAU,EAAE,SAAS;AAC/E,aAAO,MAAM,KAAK,CAAC;AACnB,YAAM,IAAI,KAAK,MAAM;AAAA,IACvB;AACA,eAAW,EAAE,OAAO,SAAS,GAAG,SAAS,KAAK,MAAM,OAAO,GAAG;AAC5D,UAAI,MAAM,SAAS,eAAgB;AACnC,YAAM,SAAS,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;AAClE,YAAM,QAAQ,OAAO,CAAC,EAAG;AACzB,YAAM,OAAO,OAAO,OAAO,SAAS,CAAC,EAAG;AACxC,eAAS,KAAK;AAAA,QACZ;AAAA,QACA;AAAA,QACA,SAAS;AAAA,QACT,aAAa,OAAO;AAAA,QACpB,SAAS,OAAO,IAAI,CAAC,MAAM,EAAE,MAAM;AAAA,QACnC,UAAU,OAAO;AAAA,MACnB,CAAC;AAAA,IACH;AAAA,EACF;AAEA,QAAM,eAAe,IAAI,IAAI,SAAS,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC;AACzD,SAAO;AAAA,IACL;AAAA,IACA,kBAAkB,KAAK,SAAS,IAAI,aAAa,OAAO,KAAK,SAAS;AAAA,IACtE,WAAW,KAAK;AAAA,EAClB;AACF;;;AChDA,eAAsB,cACpB,OACA,UAA4B,CAAC,GACH;AAC1B,QAAM,OAAO,QAAQ,QAAQ,CAAC,QAAQ,KAAK,KAAK,MAAM,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK;AAE1F,QAAM,QAA4B,CAAC;AACnC,MAAI,aAAa;AACjB,MAAI,cAAc;AAClB,aAAW,SAAS,MAAM;AACxB,UAAM,QAAQ,MAAM,UAAU,OAAO,KAAK;AAC1C,QAAI,MAAM,WAAW,GAAG;AACtB,YAAM,KAAK,EAAE,OAAO,aAAa,GAAG,YAAY,GAAG,WAAW,EAAE,CAAC;AACjE;AAAA,IACF;AACA,UAAM,OAAO,MAAM,SAAS,OAAO,KAAK;AAOxC,UAAM,YAAY,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;AACpE,UAAM,aAAa,UAAU,IAAI,CAAC,MAAM,EAAE,SAAS;AACnD,UAAM,aAAa,gBAAgB,SAAS;AAC5C,QAAI,SAAS;AACb,eAAW,KAAK,OAAO;AACrB,UAAI,EAAE,WAAW,SAAS;AACxB;AACA;AAAA,MACF;AAEA,YAAM,SAAS,WAAW,YAAY,EAAE,SAAS;AACjD,UAAI,QAAQ,aAAa;AACvB,YAAI,CAAC,QAAQ,YAAY,GAAG,EAAE,KAAK,UAAU,MAAM,MAAM,EAAE,CAAC,EAAG;AAAA,MACjE,OAAO;AAKL,cAAM,YAAY,UAAU,EAAE,MAAM;AACpC,YAAI,cAAc,GAAI;AACtB,cAAM,WAAW,WAAW,MAAM,KAAK;AACvC,cAAM,OAAO,SAAS,SAAS,UAAU,MAAM,GAAG,GAAG,CAAC;AACtD,YAAI,CAAC,KAAM;AAAA,MACb;AAAA,IACF;AACA,UAAM,YAAY,SAAS,MAAM;AACjC,UAAM,KAAK,EAAE,OAAO,aAAa,QAAQ,YAAY,MAAM,QAAQ,UAAU,CAAC;AAC9E,kBAAc,MAAM;AACpB,mBAAe;AAAA,EACjB;AACA,SAAO,EAAE,OAAO,kBAAkB,aAAa,IAAI,cAAc,aAAa,EAAE;AAClF;AAOA,SAAS,gBAAgB,OAA4B;AACnD,QAAM,SAAS,IAAI,MAAc,MAAM,SAAS,CAAC;AACjD,SAAO,MAAM,MAAM,IAAI;AACvB,WAAS,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK;AAC1C,UAAM,MAAM,MAAM,CAAC,EAAG,SAAS;AAAA,MAAI,CAAC,MAClC,OAAO,EAAE,YAAY,WAAW,EAAE,UAAU;AAAA,IAC9C,EAAE,KAAK,IAAI;AACX,WAAO,CAAC,IAAI,GAAG,GAAG;AAAA,EAAK,OAAO,IAAI,CAAC,CAAC;AAAA,EACtC;AACA,SAAO;AACT;AAGA,SAAS,WAAW,QAAkB,QAAwB;AAC5D,MAAI,KAAK;AACT,MAAI,KAAK,OAAO;AAChB,SAAO,KAAK,IAAI;AACd,UAAM,MAAO,KAAK,OAAQ;AAC1B,QAAI,OAAO,GAAG,KAAM,OAAQ,MAAK,MAAM;AAAA,QAClC,MAAK;AAAA,EACZ;AACA,SAAO;AACT;AAEA,SAAS,UAAU,GAAoB;AACrC,MAAI,MAAM,QAAQ,MAAM,OAAW,QAAO;AAC1C,MAAI,OAAO,MAAM,SAAU,QAAO;AAClC,MAAI;AACF,WAAO,KAAK,UAAU,CAAC;AAAA,EACzB,QAAQ;AACN,WAAO,OAAO,CAAC;AAAA,EACjB;AACF;","names":[]}
+{"version":3,"sources":["../../src/pipelines/budget-breach.ts","../../src/pipelines/failure-cluster.ts","../../src/pipelines/first-divergence.ts","../../src/pipelines/judge-agreement.ts","../../src/pipelines/regression.ts","../../src/pipelines/stuck-loop.ts","../../src/pipelines/tool-waste.ts"],"sourcesContent":["/**\n * BudgetBreachView — aggregates breach events across the corpus.\n *\n * Answers: which dimensions get hit most often? Which scenarios are\n * underbudgeted? Which variants trigger the most breaches?\n */\n\nimport type { BudgetSpec } from '../trace/schema'\nimport type { TraceStore } from '../trace/store'\n\nexport interface BudgetBreachFinding {\n  runId: string\n  scenarioId: string\n  variantId?: string\n  dimension: keyof BudgetSpec\n  limit: number\n  consumed: number\n  excessRatio: number\n  timestamp: number\n}\n\nexport interface BudgetBreachReport {\n  findings: BudgetBreachFinding[]\n  byDimension: Record<string, number>\n  byScenario: Record<string, number>\n  byVariant: Record<string, number>\n  totalRuns: number\n  breachedRunRatio: number\n}\n\nexport async function budgetBreachView(\n  store: TraceStore,\n  options: { scenarioId?: string; variantId?: string } = {},\n): Promise<BudgetBreachReport> {\n  const runs = await store.listRuns({\n    scenarioId: options.scenarioId,\n    variantId: options.variantId,\n  })\n  const findings: BudgetBreachFinding[] = []\n  const byDimension: Record<string, number> = {}\n  const byScenario: Record<string, number> = {}\n  const byVariant: Record<string, number> = {}\n\n  for (const run of runs) {\n    const entries = await store.budget(run.runId)\n    for (const e of entries) {\n      if (!e.breached) continue\n      const excessRatio = e.limit > 0 ? e.consumed / e.limit : Infinity\n      findings.push({\n        runId: run.runId,\n        scenarioId: run.scenarioId,\n        variantId: run.variantId,\n        dimension: e.dimension,\n        limit: e.limit,\n        consumed: e.consumed,\n        excessRatio,\n        timestamp: e.timestamp,\n      })\n      byDimension[e.dimension] = (byDimension[e.dimension] ?? 0) + 1\n      byScenario[run.scenarioId] = (byScenario[run.scenarioId] ?? 0) + 1\n      if (run.variantId) byVariant[run.variantId] = (byVariant[run.variantId] ?? 0) + 1\n    }\n  }\n\n  const breachedRuns = new Set(findings.map((f) => f.runId))\n  return {\n    findings,\n    byDimension,\n    byScenario,\n    byVariant,\n    totalRuns: runs.length,\n    breachedRunRatio: runs.length > 0 ? breachedRuns.size / runs.length : 0,\n  }\n}\n","/**\n * FailureClusterView — groups failed runs by (failureClass, triggerTool,\n * argHash-prefix) so weekly reviews can prioritize the top-N clusters.\n *\n * Each cluster includes: N runs, scenarios affected, representative\n * error message, a proposed mitigation hint (rule → action table).\n */\n\nimport { classifyFailure, DEFAULT_RULES, type FailureRule } from '../failure-taxonomy'\nimport { argHash, hasCapturedToolArgs, toolSpans } from '../trace/query'\nimport type { FailureClass, Span } from '../trace/schema'\nimport type { TraceStore } from '../trace/store'\n\nexport interface FailureCluster {\n  failureClass: FailureClass\n  /** Tool name when the trigger was a tool span, else undefined. */\n  toolName?: string\n  /** First 16 chars of argHash — clusters similar args. */\n  argPrefix?: string\n  /**\n   * Source dimension when the trigger was a judge span (e.g. `'format'`,\n   * `'safety'`, `'correctness'`). Lets cross-template aggregators\n   * group failures by the dimension that fired without overloading\n   * `argPrefix`. Optional — clusters without this field deserialize cleanly.\n   */\n  dimension?: string\n  runCount: number\n  scenarioIds: string[]\n  exampleError?: string\n  exampleRunId: string\n}\n\nexport interface FailureClusterReport {\n  clusters: FailureCluster[]\n  totalFailures: number\n  totalRuns: number\n}\n\nexport async function failureClusterView(\n  store: TraceStore,\n  options: { rules?: FailureRule[]; minClusterSize?: number } = {},\n): Promise<FailureClusterReport> {\n  const rules = options.rules ?? DEFAULT_RULES\n  const minSize = options.minClusterSize ?? 1\n  const runs = await store.listRuns()\n\n  type Key = string\n  const clusters = new Map<Key, FailureCluster>()\n  let totalFailures = 0\n\n  for (const run of runs) {\n    if (run.status === 'completed' && run.outcome?.pass !== false) continue\n    totalFailures++\n    const spans = await store.spans({ runId: run.runId })\n    const events = await store.events({ runId: run.runId })\n    const cls = classifyFailure({ run, spans, events }, rules)\n\n    let toolName: string | undefined\n    let argPrefix: string | undefined\n    let dimension: string | undefined\n    if (cls.triggerSpanId) {\n      const trig = spans.find((s) => s.spanId === cls.triggerSpanId)\n      if (trig?.kind === 'tool') {\n        toolName = trig.toolName\n        if (hasCapturedToolArgs(trig)) argPrefix = argHash(trig.args).slice(0, 16)\n      } else if (trig?.kind === 'judge') {\n        dimension = trig.dimension\n      }\n    }\n    // Fallback: look at the last errored tool span\n    if (!toolName) {\n      const ts = await toolSpans(store, run.runId)\n      const errored = ts.filter((t) => t.status === 'error').pop()\n      if (errored) {\n        toolName = errored.toolName\n        if (hasCapturedToolArgs(errored)) argPrefix = argHash(errored.args).slice(0, 16)\n      }\n    }\n    // Secondary signal: any judge span on the failed run carries a\n    // dimension. Useful when the rule classified by judge score but\n    // didn't surface the trigger span (or surfaced a non-judge span).\n    if (!dimension) {\n      const judge = spans.find((s) => s.kind === 'judge' && typeof s.dimension === 'string')\n      if (judge?.kind === 'judge') dimension = judge.dimension\n    }\n\n    const key = `${cls.failureClass}|${toolName ?? ''}|${argPrefix ?? ''}|${dimension ?? ''}`\n    let cluster = clusters.get(key)\n    if (!cluster) {\n      cluster = {\n        failureClass: cls.failureClass,\n        toolName,\n        argPrefix,\n        dimension,\n        runCount: 0,\n        scenarioIds: [],\n        exampleRunId: run.runId,\n        exampleError: firstErrorMessage(spans) ?? cls.reason,\n      }\n      clusters.set(key, cluster)\n    }\n    cluster.runCount++\n    if (!cluster.scenarioIds.includes(run.scenarioId)) cluster.scenarioIds.push(run.scenarioId)\n  }\n\n  const arr = [...clusters.values()]\n    .filter((c) => c.runCount >= minSize)\n    .sort((a, b) => b.runCount - a.runCount)\n\n  return { clusters: arr, totalFailures, totalRuns: runs.length }\n}\n\nfunction firstErrorMessage(spans: Span[]): string | undefined {\n  const errored = spans.find((s) => s.status === 'error')\n  return errored?.error\n}\n","/**\n * FirstDivergenceView — aligns two trajectories by step index, reports\n * the first step where they differ.\n *\n * \"Differ\" is configurable — default is (kind, toolName if tool, model\n * if llm). Use this view to attribute \"why is variant B better?\" to a\n * specific step rather than an aggregate mean delta.\n */\n\nimport type { TraceStore } from '../trace/store'\nimport { buildTrajectory, type Trajectory, type TrajectoryStep } from '../trajectory'\n\nexport interface DivergenceReport {\n  runA: string\n  runB: string\n  firstDivergenceIndex: number | null\n  aStep?: TrajectoryStep\n  bStep?: TrajectoryStep\n  reason?: string\n  /** Common prefix length (steps that matched). */\n  commonPrefixLen: number\n}\n\nexport interface DivergenceOptions {\n  /** Returns true if two steps are considered equal. Default: kind + tool/model match. */\n  stepEquals?: (a: TrajectoryStep, b: TrajectoryStep) => boolean\n}\n\nexport async function firstDivergenceView(\n  store: TraceStore,\n  runA: string,\n  runB: string,\n  options: DivergenceOptions = {},\n): Promise<DivergenceReport> {\n  const [a, b] = await Promise.all([buildTrajectory(store, runA), buildTrajectory(store, runB)])\n  const eq = options.stepEquals ?? defaultStepEquals\n  const minLen = Math.min(a.steps.length, b.steps.length)\n  for (let i = 0; i < minLen; i++) {\n    const aStep = a.steps[i]!\n    const bStep = b.steps[i]!\n    if (!eq(aStep, bStep)) {\n      return {\n        runA,\n        runB,\n        firstDivergenceIndex: i,\n        aStep,\n        bStep,\n        reason: describeDifference(aStep, bStep),\n        commonPrefixLen: i,\n      }\n    }\n  }\n  if (a.steps.length === b.steps.length) {\n    return { runA, runB, firstDivergenceIndex: null, commonPrefixLen: minLen }\n  }\n  const longer: Trajectory = a.steps.length > b.steps.length ? a : b\n  const extra = longer.steps.length - minLen\n  // minLen === 0 means one trajectory is empty: divergence is the first step\n  // itself (index 0), and the absent side has no step to surface.\n  const reason =\n    minLen === 0\n      ? `one trajectory is empty; the other has ${extra} step(s) starting at index 0`\n      : `one trajectory has ${extra} more step(s) after index ${minLen - 1}`\n  return {\n    runA,\n    runB,\n    firstDivergenceIndex: minLen,\n    aStep: a.steps[minLen],\n    bStep: b.steps[minLen],\n    reason,\n    commonPrefixLen: minLen,\n  }\n}\n\nfunction defaultStepEquals(a: TrajectoryStep, b: TrajectoryStep): boolean {\n  if (a.span.kind !== b.span.kind) return false\n  if (a.span.kind === 'tool' && b.span.kind === 'tool') return a.span.toolName === b.span.toolName\n  if (a.span.kind === 'llm' && b.span.kind === 'llm') return a.span.model === b.span.model\n  if (a.span.kind === 'judge' && b.span.kind === 'judge')\n    return a.span.dimension === b.span.dimension\n  return a.span.name === b.span.name\n}\n\nfunction describeDifference(a: TrajectoryStep, b: TrajectoryStep): string {\n  if (a.span.kind !== b.span.kind) return `kind ${a.span.kind} vs ${b.span.kind}`\n  if (a.span.kind === 'tool' && b.span.kind === 'tool' && a.span.toolName !== b.span.toolName) {\n    return `tool ${a.span.toolName} vs ${b.span.toolName}`\n  }\n  if (a.span.kind === 'llm' && b.span.kind === 'llm' && a.span.model !== b.span.model) {\n    return `model ${a.span.model} vs ${b.span.model}`\n  }\n  return `name \"${a.span.name}\" vs \"${b.span.name}\"`\n}\n","/**\n * JudgeAgreementView — pairwise agreement between judges across the\n * corpus, grouped by dimension.\n *\n * Output drives two workflows:\n *   - Judge robustness audit: \"does Claude agree with GPT at κ ≥ 0.6?\"\n *   - Calibration tracking: κ vs golden human labels over time (by\n *     providing a `humanGoldenJudgeId`).\n */\n\nimport { interRaterReliability, pearsonR } from '../statistics'\nimport type { JudgeSpan } from '../trace/schema'\nimport type { TraceStore } from '../trace/store'\n\nexport interface JudgePair {\n  judgeA: string\n  judgeB: string\n  dimension: string\n  /** Number of (targetSpanId, dimension) tuples both judges scored. */\n  commonItems: number\n  pearson: number\n  krippendorff: number\n}\n\nexport interface JudgeAgreementReport {\n  pairs: JudgePair[]\n  dimensions: string[]\n  judgeIds: string[]\n}\n\nexport async function judgeAgreementView(store: TraceStore): Promise<JudgeAgreementReport> {\n  const all = (await store.spans({ kind: 'judge' })).filter(\n    (s): s is JudgeSpan => s.kind === 'judge',\n  )\n  if (all.length === 0) return { pairs: [], dimensions: [], judgeIds: [] }\n\n  const byDimension = new Map<string, JudgeSpan[]>()\n  for (const s of all) {\n    const arr = byDimension.get(s.dimension) ?? []\n    arr.push(s)\n    byDimension.set(s.dimension, arr)\n  }\n\n  const judgeIds = [...new Set(all.map((s) => s.judgeId))].sort()\n  const pairs: JudgePair[] = []\n  for (const [dim, spans] of byDimension) {\n    const byJudge = new Map<string, Map<string, number>>()\n    for (const s of spans) {\n      const m = byJudge.get(s.judgeId) ?? new Map<string, number>()\n      m.set(s.targetSpanId, s.score)\n      byJudge.set(s.judgeId, m)\n    }\n    const judgesHere = [...byJudge.keys()]\n    for (let i = 0; i < judgesHere.length; i++) {\n      for (let j = i + 1; j < judgesHere.length; j++) {\n        const judgeI = judgesHere[i]!\n        const judgeJ = judgesHere[j]!\n        const a = byJudge.get(judgeI)!\n        const b = byJudge.get(judgeJ)!\n        const common: Array<[number, number]> = []\n        for (const [target, scoreA] of a) {\n          const scoreB = b.get(target)\n          if (scoreB !== undefined) common.push([scoreA, scoreB])\n        }\n        if (common.length < 2) continue\n        const judgeScores = common.map(\n          ([scoreA, scoreB]) =>\n            [\n              { judgeName: judgeI, dimension: dim, score: scoreA, reasoning: '' },\n              { judgeName: judgeJ, dimension: dim, score: scoreB, reasoning: '' },\n            ] as const,\n        )\n        const k = interRaterReliability(\n          judgeScores[0]!.map((_, k2) => judgeScores.map((pair) => pair[k2]!)),\n        )\n        pairs.push({\n          judgeA: judgeI,\n          judgeB: judgeJ,\n          dimension: dim,\n          commonItems: common.length,\n          pearson: pearsonR(\n            common.map((c) => c[0]),\n            common.map((c) => c[1]),\n          ),\n          krippendorff: k,\n        })\n      }\n    }\n  }\n\n  return {\n    pairs: pairs.sort((a, b) => b.commonItems - a.commonItems),\n    dimensions: [...byDimension.keys()].sort(),\n    judgeIds,\n  }\n}\n","/**\n * RegressionView — compares a candidate slice to a baseline slice on a\n * named metric. Delegates the statistics (Welch's t-test, Cohen's d,\n * IQR stability) to `baseline.ts`.\n *\n * This is the entry point for CI regression gates: \"given runs tagged\n * release=A and release=B, did any metric regress?\"\n */\n\nimport { type BaselineOptions, type BaselineReport, compareToBaseline } from '../baseline'\nimport { aggregateLlm, llmSpans, runFailureClass } from '../trace/query'\nimport type { Run } from '../trace/schema'\nimport type { RunFilter, TraceStore } from '../trace/store'\n\nexport interface RegressionSpec {\n  metric: string\n  higherIsBetter: boolean\n  /** Extract a scalar from a run. Default extractors handle common metrics. */\n  extract?: (run: Run, store: TraceStore) => Promise<number | null>\n}\n\nexport interface RegressionOptions extends BaselineOptions {\n  baseline: RunFilter\n  candidate: RunFilter\n}\n\nexport async function regressionView(\n  store: TraceStore,\n  metrics: RegressionSpec[],\n  options: RegressionOptions,\n): Promise<BaselineReport> {\n  const baselineRuns = await store.listRuns(options.baseline)\n  const candidateRuns = await store.listRuns(options.candidate)\n  const samples = await Promise.all(\n    metrics.map(async (m) => {\n      const extract = m.extract ?? defaultExtract(m.metric)\n      const baseline = await extractAll(baselineRuns, extract, store)\n      const candidate = await extractAll(candidateRuns, extract, store)\n      return { metric: m.metric, higherIsBetter: m.higherIsBetter, baseline, candidate }\n    }),\n  )\n  return compareToBaseline(samples, options)\n}\n\nasync function extractAll(\n  runs: Run[],\n  extract: (r: Run, s: TraceStore) => Promise<number | null>,\n  store: TraceStore,\n): Promise<number[]> {\n  const out: number[] = []\n  for (const r of runs) {\n    const v = await extract(r, store)\n    if (v !== null && Number.isFinite(v)) out.push(v)\n  }\n  return out\n}\n\nfunction defaultExtract(metric: string): (run: Run, store: TraceStore) => Promise<number | null> {\n  return async (run, store) => {\n    switch (metric) {\n      case 'score':\n      case 'overallScore':\n        return run.outcome?.score ?? null\n      case 'pass':\n        return run.outcome?.pass === true ? 1 : 0\n      case 'durationMs':\n        return run.endedAt && run.startedAt ? run.endedAt - run.startedAt : null\n      case 'costUsd': {\n        const llm = await llmSpans(store, run.runId)\n        return aggregateLlm(llm).costUsd\n      }\n      case 'inputTokens': {\n        const llm = await llmSpans(store, run.runId)\n        return aggregateLlm(llm).inputTokens\n      }\n      case 'outputTokens': {\n        const llm = await llmSpans(store, run.runId)\n        return aggregateLlm(llm).outputTokens\n      }\n      case 'failureClass': {\n        return runFailureClass(run) === 'success' ? 1 : 0\n      }\n      default:\n        return null\n    }\n  }\n}\n","/**\n * StuckLoopView — detects when an agent calls the same tool with the\n * same (or structurally similar) arguments ≥ N times in a short window.\n *\n * Rationale: agents that loop are the number-one production failure\n * mode on long-horizon flows. The view returns (runId, toolName,\n * argHash, occurrences, windowMs) for each detected loop plus a\n * fraction of runs affected.\n */\n\nimport { executionTrackByLane } from '../trace/execution-tracks'\nimport { argHash, hasCapturedToolArgs } from '../trace/query'\nimport { isToolSpan, type Span, type ToolSpan } from '../trace/schema'\nimport type { TraceStore } from '../trace/store'\n\nconst DEFAULT_MAX_WINDOW_MS = 60_000\nconst DEFAULT_MAX_INTERVENING_TOOL_CALLS = 0\n\ninterface ScopedToolCall {\n  span: ToolSpan\n  scopeSpanId: string | null\n  laneSpanId: string | null\n}\n\ninterface IndexedToolCall extends ScopedToolCall {\n  toolCallIndex: number\n  trackId: string\n}\n\nexport interface StuckLoopFinding {\n  runId: string\n  toolName: string\n  argHash: string\n  /** Calls in this episode's densest qualifying interval, not the whole-run total. */\n  occurrences: number\n  spanIds: string[]\n  /** Nearest agent ancestor, or the direct parent when ancestry is incomplete. */\n  scopeSpanId?: string\n  /** Milliseconds between first and last call in the loop. */\n  windowMs: number\n}\n\nexport interface StuckLoopReport {\n  findings: StuckLoopFinding[]\n  affectedRunRatio: number\n  totalRuns: number\n}\n\nexport interface StuckLoopOptions {\n  /** Minimum call count to flag a loop (default 3). */\n  minOccurrences?: number\n  /** Maximum time between the first and last repeated call (default 60 seconds). */\n  maxWindowMs?: number\n  /**\n   * Maximum other tool calls allowed between adjacent repeats (default 0).\n   * Set to 1 to detect alternating patterns such as A,B,A,B,A.\n   */\n  maxInterveningToolCalls?: number\n  /** Filter to a specific runId; omit to scan the entire corpus. */\n  runId?: string\n}\n\nexport async function stuckLoopView(\n  store: TraceStore,\n  options: StuckLoopOptions = {},\n): Promise<StuckLoopReport> {\n  const minOccurrences = options.minOccurrences ?? 3\n  const maxWindowMs = options.maxWindowMs ?? DEFAULT_MAX_WINDOW_MS\n  const maxInterveningToolCalls =\n    options.maxInterveningToolCalls ?? DEFAULT_MAX_INTERVENING_TOOL_CALLS\n  if (!Number.isInteger(minOccurrences) || minOccurrences < 1) {\n    throw new RangeError('minOccurrences must be a positive integer')\n  }\n  if (!Number.isFinite(maxWindowMs) || maxWindowMs < 0) {\n    throw new RangeError('maxWindowMs must be a finite non-negative number')\n  }\n  if (!Number.isInteger(maxInterveningToolCalls) || maxInterveningToolCalls < 0) {\n    throw new RangeError('maxInterveningToolCalls must be a non-negative integer')\n  }\n  const runs = options.runId\n    ? [{ runId: options.runId }]\n    : (await store.listRuns()).map((r) => ({ runId: r.runId }))\n\n  const findings: StuckLoopFinding[] = []\n  for (const { runId } of runs) {\n    const spans = await store.spans({ runId })\n    const spansById = new Map(spans.map((span) => [span.spanId, span]))\n    const scopedTools: ScopedToolCall[] = spans\n      .filter(isToolSpan)\n      .map((span, sourceIndex) => ({ span, sourceIndex }))\n      .sort((a, b) => a.span.startedAt - b.span.startedAt || a.sourceIndex - b.sourceIndex)\n      .map(({ span }) => ({ span, ...executionScope(span, spansById) }))\n    const trackByLane = executionTrackByLane(\n      scopedTools.map((call) => {\n        const direct = call.laneSpanId === null || call.laneSpanId === call.scopeSpanId\n        const timed = direct\n          ? call.span\n          : call.laneSpanId\n            ? spansById.get(call.laneSpanId)\n            : undefined\n        return {\n          key: executionKey(call),\n          scopeKey: JSON.stringify(call.scopeSpanId),\n          start: timed?.startedAt ?? null,\n          end: timed?.endedAt ?? null,\n        }\n      }),\n    )\n    const nextToolIndexByTrack = new Map<string, number>()\n    const orderedTools: IndexedToolCall[] = scopedTools.map((call) => {\n      const trackId = trackByLane.get(executionKey(call))!\n      const toolCallIndex = nextToolIndexByTrack.get(trackId) ?? 0\n      nextToolIndexByTrack.set(trackId, toolCallIndex + 1)\n      return { ...call, toolCallIndex, trackId }\n    })\n    const byKey = new Map<\n      string,\n      {\n        calls: IndexedToolCall[]\n        argHash: string\n        toolName: string\n        scopeSpanId: string | null\n      }\n    >()\n    for (const call of orderedTools) {\n      if (!hasCapturedToolArgs(call.span)) continue\n      const h = argHash(call.span.args)\n      const key = JSON.stringify([call.trackId, call.span.toolName, h])\n      const bucket = byKey.get(key) ?? {\n        calls: [],\n        argHash: h,\n        toolName: call.span.toolName,\n        scopeSpanId: call.scopeSpanId,\n      }\n      bucket.calls.push(call)\n      byKey.set(key, bucket)\n    }\n    for (const { calls, argHash: h, toolName, scopeSpanId } of byKey.values()) {\n      if (calls.length < minOccurrences) continue\n      let episodeStart = 0\n      for (let episodeEnd = 1; episodeEnd <= calls.length; episodeEnd += 1) {\n        const previous = calls[episodeEnd - 1]!\n        const next = calls[episodeEnd]\n        const episodeEnded =\n          next === undefined ||\n          next.span.startedAt - previous.span.startedAt > maxWindowMs ||\n          next.toolCallIndex - previous.toolCallIndex - 1 > maxInterveningToolCalls ||\n          !callsAreSerial(previous, next)\n        if (!episodeEnded) continue\n\n        const episode = calls.slice(episodeStart, episodeEnd)\n        let left = 0\n        let bestStart = 0\n        let bestEnd = -1\n        for (let right = 0; right < episode.length; right += 1) {\n          while (episode[right]!.span.startedAt - episode[left]!.span.startedAt > maxWindowMs) {\n            left += 1\n          }\n          if (right - left > bestEnd - bestStart) {\n            bestStart = left\n            bestEnd = right\n          }\n        }\n        if (bestEnd - bestStart + 1 >= minOccurrences) {\n          const loop = episode.slice(bestStart, bestEnd + 1)\n          const first = loop[0]!.span.startedAt\n          const last = loop[loop.length - 1]!.span.startedAt\n          findings.push({\n            runId,\n            toolName,\n            argHash: h,\n            occurrences: loop.length,\n            spanIds: loop.map((call) => call.span.spanId),\n            ...(scopeSpanId ? { scopeSpanId } : {}),\n            windowMs: last - first,\n          })\n        }\n        episodeStart = episodeEnd\n      }\n    }\n  }\n\n  const affectedRuns = new Set(findings.map((f) => f.runId))\n  return {\n    findings,\n    affectedRunRatio: runs.length > 0 ? affectedRuns.size / runs.length : 0,\n    totalRuns: runs.length,\n  }\n}\n\nfunction laneKey(call: Pick<ScopedToolCall, 'scopeSpanId' | 'laneSpanId'>): string {\n  return JSON.stringify([call.scopeSpanId, call.laneSpanId])\n}\n\nfunction executionKey(call: ScopedToolCall): string {\n  return call.laneSpanId === null || call.laneSpanId === call.scopeSpanId\n    ? JSON.stringify([call.scopeSpanId, call.span.spanId])\n    : laneKey(call)\n}\n\nfunction executionScope(\n  span: ToolSpan,\n  spansById: ReadonlyMap<string, Span>,\n): { scopeSpanId: string | null; laneSpanId: string | null } {\n  const directParent = span.parentSpanId\n  if (!directParent) return { scopeSpanId: null, laneSpanId: null }\n\n  let currentId: string | undefined = directParent\n  let laneSpanId: string | null = null\n  const seen = new Set<string>()\n  while (currentId && !seen.has(currentId)) {\n    seen.add(currentId)\n    const current = spansById.get(currentId)\n    if (!current) return { scopeSpanId: directParent, laneSpanId: directParent }\n    if (current.kind === 'agent') {\n      return { scopeSpanId: current.spanId, laneSpanId: laneSpanId ?? current.spanId }\n    }\n    laneSpanId = current.spanId\n    currentId = current.parentSpanId\n  }\n  return { scopeSpanId: directParent, laneSpanId: directParent }\n}\n\nfunction callsAreSerial(previous: IndexedToolCall, next: IndexedToolCall): boolean {\n  return previous.span.endedAt !== undefined && previous.span.endedAt <= next.span.startedAt\n}\n","/**\n * ToolWasteView — fraction of tool calls whose results weren't used\n * downstream. Without a \"used\" signal we fall back to structural\n * proxies: error calls, duplicate calls, and tool calls followed by\n * zero subsequent LLM spans are all considered waste.\n *\n * Consumers can pass a `usageOracle` that inspects a tool span and\n * returns true iff the tool's result appears in a later LLM message,\n * artifact, or state mutation — that's the canonical definition; the\n * default heuristic is a reasonable fallback.\n */\n\nimport { computeToolUseMetrics } from '../tool-use-metrics'\nimport { llmSpans, toolSpans } from '../trace/query'\nimport type { LlmSpan, ToolSpan } from '../trace/schema'\nimport type { TraceStore } from '../trace/store'\n\nexport interface ToolWasteFinding {\n  runId: string\n  wastedCalls: number\n  totalCalls: number\n  wasteRate: number\n}\n\nexport interface ToolWasteReport {\n  byRun: ToolWasteFinding[]\n  overallWasteRate: number\n}\n\nexport interface ToolWasteOptions {\n  runId?: string\n  usageOracle?: (tool: ToolSpan, later: { llm: Awaited<ReturnType<typeof llmSpans>> }) => boolean\n}\n\nexport async function toolWasteView(\n  store: TraceStore,\n  options: ToolWasteOptions = {},\n): Promise<ToolWasteReport> {\n  const runs = options.runId ? [options.runId] : (await store.listRuns()).map((r) => r.runId)\n\n  const byRun: ToolWasteFinding[] = []\n  let totalCalls = 0\n  let totalWasted = 0\n  for (const runId of runs) {\n    const tools = await toolSpans(store, runId)\n    if (tools.length === 0) {\n      byRun.push({ runId, wastedCalls: 0, totalCalls: 0, wasteRate: 0 })\n      continue\n    }\n    const llms = await llmSpans(store, runId)\n    // Sort LLM spans once by start time, then build a suffix index of the\n    // concatenated message text. `suffixText[i]` is the haystack of every\n    // string message content in spans[i..]. Per tool we binary-search the\n    // first span started strictly after the tool, then test that one suffix\n    // — turning the per-tool O(llms × messages × content) scan into a single\n    // O(log llms) lookup over precomputed text.\n    const sortedLlm = [...llms].sort((a, b) => a.startedAt - b.startedAt)\n    const startTimes = sortedLlm.map((l) => l.startedAt)\n    const suffixText = buildSuffixText(sortedLlm)\n    let wasted = 0\n    for (const t of tools) {\n      if (t.status === 'error') {\n        wasted++\n        continue\n      }\n      // First LLM span started strictly after this tool (upper-bound search).\n      const cutoff = upperBound(startTimes, t.startedAt)\n      if (options.usageOracle) {\n        if (!options.usageOracle(t, { llm: sortedLlm.slice(cutoff) })) wasted++\n      } else {\n        // Default heuristic: a tool whose result is NOT mentioned in any\n        // later LLM input message is likely wasted. An empty/null result has\n        // no payload to propagate downstream — there is nothing to find in a\n        // later message, so it is not evidence of waste; skip it.\n        const resultStr = stringify(t.result)\n        if (resultStr === '') continue\n        const haystack = suffixText[cutoff] ?? ''\n        const used = haystack.includes(resultStr.slice(0, 120))\n        if (!used) wasted++\n      }\n    }\n    const wasteRate = wasted / tools.length\n    byRun.push({ runId, wastedCalls: wasted, totalCalls: tools.length, wasteRate })\n    totalCalls += tools.length\n    totalWasted += wasted\n  }\n  return { byRun, overallWasteRate: totalCalls > 0 ? totalWasted / totalCalls : 0 }\n}\n\n/**\n * Build per-position suffix haystacks: result[i] is the concatenation of every\n * string message content in spans[i..end]. Built back-to-front so each entry\n * reuses the next one — O(total message text) rather than O(spans²).\n */\nfunction buildSuffixText(spans: LlmSpan[]): string[] {\n  const result = new Array<string>(spans.length + 1)\n  result[spans.length] = ''\n  for (let i = spans.length - 1; i >= 0; i--) {\n    const own = spans[i]!.messages.map((m) =>\n      typeof m.content === 'string' ? m.content : '',\n    ).join('\\n')\n    result[i] = `${own}\\n${result[i + 1]}`\n  }\n  return result\n}\n\n/** Index of the first element strictly greater than `target` in a sorted array. */\nfunction upperBound(sorted: number[], target: number): number {\n  let lo = 0\n  let hi = sorted.length\n  while (lo < hi) {\n    const mid = (lo + hi) >>> 1\n    if (sorted[mid]! <= target) lo = mid + 1\n    else hi = mid\n  }\n  return lo\n}\n\nfunction stringify(v: unknown): string {\n  if (v === null || v === undefined) return ''\n  if (typeof v === 'string') return v\n  try {\n    return JSON.stringify(v)\n  } catch {\n    return String(v)\n  }\n}\n\n// Re-export for convenience in consumers that want both descriptive and usage metrics.\nexport { computeToolUseMetrics }\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BA,eAAsB,iBACpB,OACA,UAAuD,CAAC,GAC3B;AAC7B,QAAM,OAAO,MAAM,MAAM,SAAS;AAAA,IAChC,YAAY,QAAQ;AAAA,IACpB,WAAW,QAAQ;AAAA,EACrB,CAAC;AACD,QAAM,WAAkC,CAAC;AACzC,QAAM,cAAsC,CAAC;AAC7C,QAAM,aAAqC,CAAC;AAC5C,QAAM,YAAoC,CAAC;AAE3C,aAAW,OAAO,MAAM;AACtB,UAAM,UAAU,MAAM,MAAM,OAAO,IAAI,KAAK;AAC5C,eAAW,KAAK,SAAS;AACvB,UAAI,CAAC,EAAE,SAAU;AACjB,YAAM,cAAc,EAAE,QAAQ,IAAI,EAAE,WAAW,EAAE,QAAQ;AACzD,eAAS,KAAK;AAAA,QACZ,OAAO,IAAI;AAAA,QACX,YAAY,IAAI;AAAA,QAChB,WAAW,IAAI;AAAA,QACf,WAAW,EAAE;AAAA,QACb,OAAO,EAAE;AAAA,QACT,UAAU,EAAE;AAAA,QACZ;AAAA,QACA,WAAW,EAAE;AAAA,MACf,CAAC;AACD,kBAAY,EAAE,SAAS,KAAK,YAAY,EAAE,SAAS,KAAK,KAAK;AAC7D,iBAAW,IAAI,UAAU,KAAK,WAAW,IAAI,UAAU,KAAK,KAAK;AACjE,UAAI,IAAI,UAAW,WAAU,IAAI,SAAS,KAAK,UAAU,IAAI,SAAS,KAAK,KAAK;AAAA,IAClF;AAAA,EACF;AAEA,QAAM,eAAe,IAAI,IAAI,SAAS,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC;AACzD,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,WAAW,KAAK;AAAA,IAChB,kBAAkB,KAAK,SAAS,IAAI,aAAa,OAAO,KAAK,SAAS;AAAA,EACxE;AACF;;;ACnCA,eAAsB,mBACpB,OACA,UAA8D,CAAC,GAChC;AAC/B,QAAM,QAAQ,QAAQ,SAAS;AAC/B,QAAM,UAAU,QAAQ,kBAAkB;AAC1C,QAAM,OAAO,MAAM,MAAM,SAAS;AAGlC,QAAM,WAAW,oBAAI,IAAyB;AAC9C,MAAI,gBAAgB;AAEpB,aAAW,OAAO,MAAM;AACtB,QAAI,IAAI,WAAW,eAAe,IAAI,SAAS,SAAS,MAAO;AAC/D;AACA,UAAM,QAAQ,MAAM,MAAM,MAAM,EAAE,OAAO,IAAI,MAAM,CAAC;AACpD,UAAM,SAAS,MAAM,MAAM,OAAO,EAAE,OAAO,IAAI,MAAM,CAAC;AACtD,UAAM,MAAM,gBAAgB,EAAE,KAAK,OAAO,OAAO,GAAG,KAAK;AAEzD,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI,IAAI,eAAe;AACrB,YAAM,OAAO,MAAM,KAAK,CAAC,MAAM,EAAE,WAAW,IAAI,aAAa;AAC7D,UAAI,MAAM,SAAS,QAAQ;AACzB,mBAAW,KAAK;AAChB,YAAI,oBAAoB,IAAI,EAAG,aAAY,QAAQ,KAAK,IAAI,EAAE,MAAM,GAAG,EAAE;AAAA,MAC3E,WAAW,MAAM,SAAS,SAAS;AACjC,oBAAY,KAAK;AAAA,MACnB;AAAA,IACF;AAEA,QAAI,CAAC,UAAU;AACb,YAAM,KAAK,MAAM,UAAU,OAAO,IAAI,KAAK;AAC3C,YAAM,UAAU,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,OAAO,EAAE,IAAI;AAC3D,UAAI,SAAS;AACX,mBAAW,QAAQ;AACnB,YAAI,oBAAoB,OAAO,EAAG,aAAY,QAAQ,QAAQ,IAAI,EAAE,MAAM,GAAG,EAAE;AAAA,MACjF;AAAA,IACF;AAIA,QAAI,CAAC,WAAW;AACd,YAAM,QAAQ,MAAM,KAAK,CAAC,MAAM,EAAE,SAAS,WAAW,OAAO,EAAE,cAAc,QAAQ;AACrF,UAAI,OAAO,SAAS,QAAS,aAAY,MAAM;AAAA,IACjD;AAEA,UAAM,MAAM,GAAG,IAAI,YAAY,IAAI,YAAY,EAAE,IAAI,aAAa,EAAE,IAAI,aAAa,EAAE;AACvF,QAAI,UAAU,SAAS,IAAI,GAAG;AAC9B,QAAI,CAAC,SAAS;AACZ,gBAAU;AAAA,QACR,cAAc,IAAI;AAAA,QAClB;AAAA,QACA;AAAA,QACA;AAAA,QACA,UAAU;AAAA,QACV,aAAa,CAAC;AAAA,QACd,cAAc,IAAI;AAAA,QAClB,cAAc,kBAAkB,KAAK,KAAK,IAAI;AAAA,MAChD;AACA,eAAS,IAAI,KAAK,OAAO;AAAA,IAC3B;AACA,YAAQ;AACR,QAAI,CAAC,QAAQ,YAAY,SAAS,IAAI,UAAU,EAAG,SAAQ,YAAY,KAAK,IAAI,UAAU;AAAA,EAC5F;AAEA,QAAM,MAAM,CAAC,GAAG,SAAS,OAAO,CAAC,EAC9B,OAAO,CAAC,MAAM,EAAE,YAAY,OAAO,EACnC,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AAEzC,SAAO,EAAE,UAAU,KAAK,eAAe,WAAW,KAAK,OAAO;AAChE;AAEA,SAAS,kBAAkB,OAAmC;AAC5D,QAAM,UAAU,MAAM,KAAK,CAAC,MAAM,EAAE,WAAW,OAAO;AACtD,SAAO,SAAS;AAClB;;;ACvFA,eAAsB,oBACpB,OACA,MACA,MACA,UAA6B,CAAC,GACH;AAC3B,QAAM,CAAC,GAAG,CAAC,IAAI,MAAM,QAAQ,IAAI,CAAC,gBAAgB,OAAO,IAAI,GAAG,gBAAgB,OAAO,IAAI,CAAC,CAAC;AAC7F,QAAM,KAAK,QAAQ,cAAc;AACjC,QAAM,SAAS,KAAK,IAAI,EAAE,MAAM,QAAQ,EAAE,MAAM,MAAM;AACtD,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,UAAM,QAAQ,EAAE,MAAM,CAAC;AACvB,UAAM,QAAQ,EAAE,MAAM,CAAC;AACvB,QAAI,CAAC,GAAG,OAAO,KAAK,GAAG;AACrB,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA,sBAAsB;AAAA,QACtB;AAAA,QACA;AAAA,QACA,QAAQ,mBAAmB,OAAO,KAAK;AAAA,QACvC,iBAAiB;AAAA,MACnB;AAAA,IACF;AAAA,EACF;AACA,MAAI,EAAE,MAAM,WAAW,EAAE,MAAM,QAAQ;AACrC,WAAO,EAAE,MAAM,MAAM,sBAAsB,MAAM,iBAAiB,OAAO;AAAA,EAC3E;AACA,QAAM,SAAqB,EAAE,MAAM,SAAS,EAAE,MAAM,SAAS,IAAI;AACjE,QAAM,QAAQ,OAAO,MAAM,SAAS;AAGpC,QAAM,SACJ,WAAW,IACP,0CAA0C,KAAK,iCAC/C,sBAAsB,KAAK,6BAA6B,SAAS,CAAC;AACxE,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,sBAAsB;AAAA,IACtB,OAAO,EAAE,MAAM,MAAM;AAAA,IACrB,OAAO,EAAE,MAAM,MAAM;AAAA,IACrB;AAAA,IACA,iBAAiB;AAAA,EACnB;AACF;AAEA,SAAS,kBAAkB,GAAmB,GAA4B;AACxE,MAAI,EAAE,KAAK,SAAS,EAAE,KAAK,KAAM,QAAO;AACxC,MAAI,EAAE,KAAK,SAAS,UAAU,EAAE,KAAK,SAAS,OAAQ,QAAO,EAAE,KAAK,aAAa,EAAE,KAAK;AACxF,MAAI,EAAE,KAAK,SAAS,SAAS,EAAE,KAAK,SAAS,MAAO,QAAO,EAAE,KAAK,UAAU,EAAE,KAAK;AACnF,MAAI,EAAE,KAAK,SAAS,WAAW,EAAE,KAAK,SAAS;AAC7C,WAAO,EAAE,KAAK,cAAc,EAAE,KAAK;AACrC,SAAO,EAAE,KAAK,SAAS,EAAE,KAAK;AAChC;AAEA,SAAS,mBAAmB,GAAmB,GAA2B;AACxE,MAAI,EAAE,KAAK,SAAS,EAAE,KAAK,KAAM,QAAO,QAAQ,EAAE,KAAK,IAAI,OAAO,EAAE,KAAK,IAAI;AAC7E,MAAI,EAAE,KAAK,SAAS,UAAU,EAAE,KAAK,SAAS,UAAU,EAAE,KAAK,aAAa,EAAE,KAAK,UAAU;AAC3F,WAAO,QAAQ,EAAE,KAAK,QAAQ,OAAO,EAAE,KAAK,QAAQ;AAAA,EACtD;AACA,MAAI,EAAE,KAAK,SAAS,SAAS,EAAE,KAAK,SAAS,SAAS,EAAE,KAAK,UAAU,EAAE,KAAK,OAAO;AACnF,WAAO,SAAS,EAAE,KAAK,KAAK,OAAO,EAAE,KAAK,KAAK;AAAA,EACjD;AACA,SAAO,SAAS,EAAE,KAAK,IAAI,SAAS,EAAE,KAAK,IAAI;AACjD;;;AC9DA,eAAsB,mBAAmB,OAAkD;AACzF,QAAM,OAAO,MAAM,MAAM,MAAM,EAAE,MAAM,QAAQ,CAAC,GAAG;AAAA,IACjD,CAAC,MAAsB,EAAE,SAAS;AAAA,EACpC;AACA,MAAI,IAAI,WAAW,EAAG,QAAO,EAAE,OAAO,CAAC,GAAG,YAAY,CAAC,GAAG,UAAU,CAAC,EAAE;AAEvE,QAAM,cAAc,oBAAI,IAAyB;AACjD,aAAW,KAAK,KAAK;AACnB,UAAM,MAAM,YAAY,IAAI,EAAE,SAAS,KAAK,CAAC;AAC7C,QAAI,KAAK,CAAC;AACV,gBAAY,IAAI,EAAE,WAAW,GAAG;AAAA,EAClC;AAEA,QAAM,WAAW,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EAAE,KAAK;AAC9D,QAAM,QAAqB,CAAC;AAC5B,aAAW,CAAC,KAAK,KAAK,KAAK,aAAa;AACtC,UAAM,UAAU,oBAAI,IAAiC;AACrD,eAAW,KAAK,OAAO;AACrB,YAAM,IAAI,QAAQ,IAAI,EAAE,OAAO,KAAK,oBAAI,IAAoB;AAC5D,QAAE,IAAI,EAAE,cAAc,EAAE,KAAK;AAC7B,cAAQ,IAAI,EAAE,SAAS,CAAC;AAAA,IAC1B;AACA,UAAM,aAAa,CAAC,GAAG,QAAQ,KAAK,CAAC;AACrC,aAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,eAAS,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC9C,cAAM,SAAS,WAAW,CAAC;AAC3B,cAAM,SAAS,WAAW,CAAC;AAC3B,cAAM,IAAI,QAAQ,IAAI,MAAM;AAC5B,cAAM,IAAI,QAAQ,IAAI,MAAM;AAC5B,cAAM,SAAkC,CAAC;AACzC,mBAAW,CAAC,QAAQ,MAAM,KAAK,GAAG;AAChC,gBAAM,SAAS,EAAE,IAAI,MAAM;AAC3B,cAAI,WAAW,OAAW,QAAO,KAAK,CAAC,QAAQ,MAAM,CAAC;AAAA,QACxD;AACA,YAAI,OAAO,SAAS,EAAG;AACvB,cAAM,cAAc,OAAO;AAAA,UACzB,CAAC,CAAC,QAAQ,MAAM,MACd;AAAA,YACE,EAAE,WAAW,QAAQ,WAAW,KAAK,OAAO,QAAQ,WAAW,GAAG;AAAA,YAClE,EAAE,WAAW,QAAQ,WAAW,KAAK,OAAO,QAAQ,WAAW,GAAG;AAAA,UACpE;AAAA,QACJ;AACA,cAAM,IAAI;AAAA,UACR,YAAY,CAAC,EAAG,IAAI,CAAC,GAAG,OAAO,YAAY,IAAI,CAAC,SAAS,KAAK,EAAE,CAAE,CAAC;AAAA,QACrE;AACA,cAAM,KAAK;AAAA,UACT,QAAQ;AAAA,UACR,QAAQ;AAAA,UACR,WAAW;AAAA,UACX,aAAa,OAAO;AAAA,UACpB,SAAS;AAAA,YACP,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;AAAA,YACtB,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;AAAA,UACxB;AAAA,UACA,cAAc;AAAA,QAChB,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL,OAAO,MAAM,KAAK,CAAC,GAAG,MAAM,EAAE,cAAc,EAAE,WAAW;AAAA,IACzD,YAAY,CAAC,GAAG,YAAY,KAAK,CAAC,EAAE,KAAK;AAAA,IACzC;AAAA,EACF;AACF;;;ACrEA,eAAsB,eACpB,OACA,SACA,SACyB;AACzB,QAAM,eAAe,MAAM,MAAM,SAAS,QAAQ,QAAQ;AAC1D,QAAM,gBAAgB,MAAM,MAAM,SAAS,QAAQ,SAAS;AAC5D,QAAM,UAAU,MAAM,QAAQ;AAAA,IAC5B,QAAQ,IAAI,OAAO,MAAM;AACvB,YAAM,UAAU,EAAE,WAAW,eAAe,EAAE,MAAM;AACpD,YAAM,WAAW,MAAM,WAAW,cAAc,SAAS,KAAK;AAC9D,YAAM,YAAY,MAAM,WAAW,eAAe,SAAS,KAAK;AAChE,aAAO,EAAE,QAAQ,EAAE,QAAQ,gBAAgB,EAAE,gBAAgB,UAAU,UAAU;AAAA,IACnF,CAAC;AAAA,EACH;AACA,SAAO,kBAAkB,SAAS,OAAO;AAC3C;AAEA,eAAe,WACb,MACA,SACA,OACmB;AACnB,QAAM,MAAgB,CAAC;AACvB,aAAW,KAAK,MAAM;AACpB,UAAM,IAAI,MAAM,QAAQ,GAAG,KAAK;AAChC,QAAI,MAAM,QAAQ,OAAO,SAAS,CAAC,EAAG,KAAI,KAAK,CAAC;AAAA,EAClD;AACA,SAAO;AACT;AAEA,SAAS,eAAe,QAAyE;AAC/F,SAAO,OAAO,KAAK,UAAU;AAC3B,YAAQ,QAAQ;AAAA,MACd,KAAK;AAAA,MACL,KAAK;AACH,eAAO,IAAI,SAAS,SAAS;AAAA,MAC/B,KAAK;AACH,eAAO,IAAI,SAAS,SAAS,OAAO,IAAI;AAAA,MAC1C,KAAK;AACH,eAAO,IAAI,WAAW,IAAI,YAAY,IAAI,UAAU,IAAI,YAAY;AAAA,MACtE,KAAK,WAAW;AACd,cAAM,MAAM,MAAM,SAAS,OAAO,IAAI,KAAK;AAC3C,eAAO,aAAa,GAAG,EAAE;AAAA,MAC3B;AAAA,MACA,KAAK,eAAe;AAClB,cAAM,MAAM,MAAM,SAAS,OAAO,IAAI,KAAK;AAC3C,eAAO,aAAa,GAAG,EAAE;AAAA,MAC3B;AAAA,MACA,KAAK,gBAAgB;AACnB,cAAM,MAAM,MAAM,SAAS,OAAO,IAAI,KAAK;AAC3C,eAAO,aAAa,GAAG,EAAE;AAAA,MAC3B;AAAA,MACA,KAAK,gBAAgB;AACnB,eAAO,gBAAgB,GAAG,MAAM,YAAY,IAAI;AAAA,MAClD;AAAA,MACA;AACE,eAAO;AAAA,IACX;AAAA,EACF;AACF;;;ACvEA,IAAM,wBAAwB;AAC9B,IAAM,qCAAqC;AA8C3C,eAAsB,cACpB,OACA,UAA4B,CAAC,GACH;AAC1B,QAAM,iBAAiB,QAAQ,kBAAkB;AACjD,QAAM,cAAc,QAAQ,eAAe;AAC3C,QAAM,0BACJ,QAAQ,2BAA2B;AACrC,MAAI,CAAC,OAAO,UAAU,cAAc,KAAK,iBAAiB,GAAG;AAC3D,UAAM,IAAI,WAAW,2CAA2C;AAAA,EAClE;AACA,MAAI,CAAC,OAAO,SAAS,WAAW,KAAK,cAAc,GAAG;AACpD,UAAM,IAAI,WAAW,kDAAkD;AAAA,EACzE;AACA,MAAI,CAAC,OAAO,UAAU,uBAAuB,KAAK,0BAA0B,GAAG;AAC7E,UAAM,IAAI,WAAW,wDAAwD;AAAA,EAC/E;AACA,QAAM,OAAO,QAAQ,QACjB,CAAC,EAAE,OAAO,QAAQ,MAAM,CAAC,KACxB,MAAM,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE;AAE5D,QAAM,WAA+B,CAAC;AACtC,aAAW,EAAE,MAAM,KAAK,MAAM;AAC5B,UAAM,QAAQ,MAAM,MAAM,MAAM,EAAE,MAAM,CAAC;AACzC,UAAM,YAAY,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC;AAClE,UAAM,cAAgC,MACnC,OAAO,UAAU,EACjB,IAAI,CAAC,MAAM,iBAAiB,EAAE,MAAM,YAAY,EAAE,EAClD,KAAK,CAAC,GAAG,MAAM,EAAE,KAAK,YAAY,EAAE,KAAK,aAAa,EAAE,cAAc,EAAE,WAAW,EACnF,IAAI,CAAC,EAAE,KAAK,OAAO,EAAE,MAAM,GAAG,eAAe,MAAM,SAAS,EAAE,EAAE;AACnE,UAAM,cAAc;AAAA,MAClB,YAAY,IAAI,CAAC,SAAS;AACxB,cAAM,SAAS,KAAK,eAAe,QAAQ,KAAK,eAAe,KAAK;AACpE,cAAM,QAAQ,SACV,KAAK,OACL,KAAK,aACH,UAAU,IAAI,KAAK,UAAU,IAC7B;AACN,eAAO;AAAA,UACL,KAAK,aAAa,IAAI;AAAA,UACtB,UAAU,KAAK,UAAU,KAAK,WAAW;AAAA,UACzC,OAAO,OAAO,aAAa;AAAA,UAC3B,KAAK,OAAO,WAAW;AAAA,QACzB;AAAA,MACF,CAAC;AAAA,IACH;AACA,UAAM,uBAAuB,oBAAI,IAAoB;AACrD,UAAM,eAAkC,YAAY,IAAI,CAAC,SAAS;AAChE,YAAM,UAAU,YAAY,IAAI,aAAa,IAAI,CAAC;AAClD,YAAM,gBAAgB,qBAAqB,IAAI,OAAO,KAAK;AAC3D,2BAAqB,IAAI,SAAS,gBAAgB,CAAC;AACnD,aAAO,EAAE,GAAG,MAAM,eAAe,QAAQ;AAAA,IAC3C,CAAC;AACD,UAAM,QAAQ,oBAAI,IAQhB;AACF,eAAW,QAAQ,cAAc;AAC/B,UAAI,CAAC,oBAAoB,KAAK,IAAI,EAAG;AACrC,YAAM,IAAI,QAAQ,KAAK,KAAK,IAAI;AAChC,YAAM,MAAM,KAAK,UAAU,CAAC,KAAK,SAAS,KAAK,KAAK,UAAU,CAAC,CAAC;AAChE,YAAM,SAAS,MAAM,IAAI,GAAG,KAAK;AAAA,QAC/B,OAAO,CAAC;AAAA,QACR,SAAS;AAAA,QACT,UAAU,KAAK,KAAK;AAAA,QACpB,aAAa,KAAK;AAAA,MACpB;AACA,aAAO,MAAM,KAAK,IAAI;AACtB,YAAM,IAAI,KAAK,MAAM;AAAA,IACvB;AACA,eAAW,EAAE,OAAO,SAAS,GAAG,UAAU,YAAY,KAAK,MAAM,OAAO,GAAG;AACzE,UAAI,MAAM,SAAS,eAAgB;AACnC,UAAI,eAAe;AACnB,eAAS,aAAa,GAAG,cAAc,MAAM,QAAQ,cAAc,GAAG;AACpE,cAAM,WAAW,MAAM,aAAa,CAAC;AACrC,cAAM,OAAO,MAAM,UAAU;AAC7B,cAAM,eACJ,SAAS,UACT,KAAK,KAAK,YAAY,SAAS,KAAK,YAAY,eAChD,KAAK,gBAAgB,SAAS,gBAAgB,IAAI,2BAClD,CAAC,eAAe,UAAU,IAAI;AAChC,YAAI,CAAC,aAAc;AAEnB,cAAM,UAAU,MAAM,MAAM,cAAc,UAAU;AACpD,YAAI,OAAO;AACX,YAAI,YAAY;AAChB,YAAI,UAAU;AACd,iBAAS,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AACtD,iBAAO,QAAQ,KAAK,EAAG,KAAK,YAAY,QAAQ,IAAI,EAAG,KAAK,YAAY,aAAa;AACnF,oBAAQ;AAAA,UACV;AACA,cAAI,QAAQ,OAAO,UAAU,WAAW;AACtC,wBAAY;AACZ,sBAAU;AAAA,UACZ;AAAA,QACF;AACA,YAAI,UAAU,YAAY,KAAK,gBAAgB;AAC7C,gBAAM,OAAO,QAAQ,MAAM,WAAW,UAAU,CAAC;AACjD,gBAAM,QAAQ,KAAK,CAAC,EAAG,KAAK;AAC5B,gBAAM,OAAO,KAAK,KAAK,SAAS,CAAC,EAAG,KAAK;AACzC,mBAAS,KAAK;AAAA,YACZ;AAAA,YACA;AAAA,YACA,SAAS;AAAA,YACT,aAAa,KAAK;AAAA,YAClB,SAAS,KAAK,IAAI,CAAC,SAAS,KAAK,KAAK,MAAM;AAAA,YAC5C,GAAI,cAAc,EAAE,YAAY,IAAI,CAAC;AAAA,YACrC,UAAU,OAAO;AAAA,UACnB,CAAC;AAAA,QACH;AACA,uBAAe;AAAA,MACjB;AAAA,IACF;AAAA,EACF;AAEA,QAAM,eAAe,IAAI,IAAI,SAAS,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC;AACzD,SAAO;AAAA,IACL;AAAA,IACA,kBAAkB,KAAK,SAAS,IAAI,aAAa,OAAO,KAAK,SAAS;AAAA,IACtE,WAAW,KAAK;AAAA,EAClB;AACF;AAEA,SAAS,QAAQ,MAAkE;AACjF,SAAO,KAAK,UAAU,CAAC,KAAK,aAAa,KAAK,UAAU,CAAC;AAC3D;AAEA,SAAS,aAAa,MAA8B;AAClD,SAAO,KAAK,eAAe,QAAQ,KAAK,eAAe,KAAK,cACxD,KAAK,UAAU,CAAC,KAAK,aAAa,KAAK,KAAK,MAAM,CAAC,IACnD,QAAQ,IAAI;AAClB;AAEA,SAAS,eACP,MACA,WAC2D;AAC3D,QAAM,eAAe,KAAK;AAC1B,MAAI,CAAC,aAAc,QAAO,EAAE,aAAa,MAAM,YAAY,KAAK;AAEhE,MAAI,YAAgC;AACpC,MAAI,aAA4B;AAChC,QAAM,OAAO,oBAAI,IAAY;AAC7B,SAAO,aAAa,CAAC,KAAK,IAAI,SAAS,GAAG;AACxC,SAAK,IAAI,SAAS;AAClB,UAAM,UAAU,UAAU,IAAI,SAAS;AACvC,QAAI,CAAC,QAAS,QAAO,EAAE,aAAa,cAAc,YAAY,aAAa;AAC3E,QAAI,QAAQ,SAAS,SAAS;AAC5B,aAAO,EAAE,aAAa,QAAQ,QAAQ,YAAY,cAAc,QAAQ,OAAO;AAAA,IACjF;AACA,iBAAa,QAAQ;AACrB,gBAAY,QAAQ;AAAA,EACtB;AACA,SAAO,EAAE,aAAa,cAAc,YAAY,aAAa;AAC/D;AAEA,SAAS,eAAe,UAA2B,MAAgC;AACjF,SAAO,SAAS,KAAK,YAAY,UAAa,SAAS,KAAK,WAAW,KAAK,KAAK;AACnF;;;AC/LA,eAAsB,cACpB,OACA,UAA4B,CAAC,GACH;AAC1B,QAAM,OAAO,QAAQ,QAAQ,CAAC,QAAQ,KAAK,KAAK,MAAM,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK;AAE1F,QAAM,QAA4B,CAAC;AACnC,MAAI,aAAa;AACjB,MAAI,cAAc;AAClB,aAAW,SAAS,MAAM;AACxB,UAAM,QAAQ,MAAM,UAAU,OAAO,KAAK;AAC1C,QAAI,MAAM,WAAW,GAAG;AACtB,YAAM,KAAK,EAAE,OAAO,aAAa,GAAG,YAAY,GAAG,WAAW,EAAE,CAAC;AACjE;AAAA,IACF;AACA,UAAM,OAAO,MAAM,SAAS,OAAO,KAAK;AAOxC,UAAM,YAAY,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;AACpE,UAAM,aAAa,UAAU,IAAI,CAAC,MAAM,EAAE,SAAS;AACnD,UAAM,aAAa,gBAAgB,SAAS;AAC5C,QAAI,SAAS;AACb,eAAW,KAAK,OAAO;AACrB,UAAI,EAAE,WAAW,SAAS;AACxB;AACA;AAAA,MACF;AAEA,YAAM,SAAS,WAAW,YAAY,EAAE,SAAS;AACjD,UAAI,QAAQ,aAAa;AACvB,YAAI,CAAC,QAAQ,YAAY,GAAG,EAAE,KAAK,UAAU,MAAM,MAAM,EAAE,CAAC,EAAG;AAAA,MACjE,OAAO;AAKL,cAAM,YAAY,UAAU,EAAE,MAAM;AACpC,YAAI,cAAc,GAAI;AACtB,cAAM,WAAW,WAAW,MAAM,KAAK;AACvC,cAAM,OAAO,SAAS,SAAS,UAAU,MAAM,GAAG,GAAG,CAAC;AACtD,YAAI,CAAC,KAAM;AAAA,MACb;AAAA,IACF;AACA,UAAM,YAAY,SAAS,MAAM;AACjC,UAAM,KAAK,EAAE,OAAO,aAAa,QAAQ,YAAY,MAAM,QAAQ,UAAU,CAAC;AAC9E,kBAAc,MAAM;AACpB,mBAAe;AAAA,EACjB;AACA,SAAO,EAAE,OAAO,kBAAkB,aAAa,IAAI,cAAc,aAAa,EAAE;AAClF;AAOA,SAAS,gBAAgB,OAA4B;AACnD,QAAM,SAAS,IAAI,MAAc,MAAM,SAAS,CAAC;AACjD,SAAO,MAAM,MAAM,IAAI;AACvB,WAAS,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK;AAC1C,UAAM,MAAM,MAAM,CAAC,EAAG,SAAS;AAAA,MAAI,CAAC,MAClC,OAAO,EAAE,YAAY,WAAW,EAAE,UAAU;AAAA,IAC9C,EAAE,KAAK,IAAI;AACX,WAAO,CAAC,IAAI,GAAG,GAAG;AAAA,EAAK,OAAO,IAAI,CAAC,CAAC;AAAA,EACtC;AACA,SAAO;AACT;AAGA,SAAS,WAAW,QAAkB,QAAwB;AAC5D,MAAI,KAAK;AACT,MAAI,KAAK,OAAO;AAChB,SAAO,KAAK,IAAI;AACd,UAAM,MAAO,KAAK,OAAQ;AAC1B,QAAI,OAAO,GAAG,KAAM,OAAQ,MAAK,MAAM;AAAA,QAClC,MAAK;AAAA,EACZ;AACA,SAAO;AACT;AAEA,SAAS,UAAU,GAAoB;AACrC,MAAI,MAAM,QAAQ,MAAM,OAAW,QAAO;AAC1C,MAAI,OAAO,MAAM,SAAU,QAAO;AAClC,MAAI;AACF,WAAO,KAAK,UAAU,CAAC;AAAA,EACzB,QAAQ;AACN,WAAO,OAAO,CAAC;AAAA,EACjB;AACF;","names":[]}

package/dist/{kind-factory-DcNg13sZ.d.ts → policy-edit-wG9uFEFm.d.ts}

@@ -1,9 +1,8 @@
-import { AxAIService, AxFunction } from '@ax-llm/ax';
+import { R as RunRecord, A as AgentProfileCell, f as AgentProfileJson } from './run-record-BDH49H2E.js';
+import { V as ValidationError } from './errors-oeQrLqXC.js';
 import { T as TraceAnalysisStore } from './store-C1YxJDEK.js';
-import { z } from 'zod';
-import { R as RunRecord } from './run-record-B7RTi_ix.js';
-import { a as JudgeInput } from './types-C7DGg5ex.js';
-import { b as LlmCallRequest, c as LlmCallResult } from './llm-client-DyqEH4jH.js';
+import { a as JudgeInput } from './types-BkfcQnxV.js';
+import { c as LlmCallRequest, d as LlmCallResult } from './llm-client-qoDd18Qz.js';
 
 /**
  * ChatClient — the single LLM abstraction analysts call.
@@ -36,6 +35,9 @@ interface ChatClient {
     readonly transport: ChatTransport;
     /** Default model when caller omits — operators bind this per environment. */
     readonly defaultModel?: string;
+    /** Total provider attempts this transport can make for one chat call. */
+    readonly maximumAttempts?: number;
+    /** Implementations must enforce `req.maxTokens` when it is present. */
     chat(req: ChatRequest, opts?: ChatCallOpts): Promise<ChatResponse>;
 }
 type ChatTransport = 'router' | 'sandbox-sdk' | 'cli-bridge' | 'direct-provider' | 'mock';
@@ -51,10 +53,14 @@ interface ChatCallOpts {
     maxCostUsd?: number;
     /** Correlation tag carried into request headers when the transport allows. */
     correlationId?: string;
+    /** Stable provider idempotency key for retries/redrives of one paid call. */
+    idempotencyKey?: string;
 }
 type CreateChatClientOpts = RouterTransportOpts | CliBridgeTransportOpts | DirectProviderTransportOpts | SandboxSdkTransportOpts | MockTransportOpts;
 interface BaseTransportOpts {
     defaultModel?: string;
+    /** Total provider attempts. Required for opaque transports used in capped runs. */
+    maximumAttempts?: number;
 }
 interface RouterTransportOpts extends BaseTransportOpts {
     transport: 'router';
@@ -95,54 +101,6 @@ interface MockTransportOpts extends BaseTransportOpts {
  */
 declare function createChatClient(opts: CreateChatClientOpts): ChatClient;
 
-/**
- * Typed Ax output for analyst findings.
- *
- * Replaces the legacy `findings:string[]` pattern (where every bullet
- * became a flat-severity `AnalystFinding`) with a structured object
- * array. Ax binds the field as `findings:json[]` so the provider emits
- * native structured output; at the kind-factory boundary we Zod-validate
- * each emitted finding so malformed rows fail loud instead of being
- * silently lifted with default severity.
- *
- * Why not `f.object().array()` directly in the signature? The Ax
- * signature string `question:string -> findings:json[]` already lets
- * the provider emit JSON arrays. A Zod boundary is required either
- * way (the provider can return any JSON), and Zod gives us a single
- * validation surface independent of which Ax version is installed.
- */
-
-declare const ANALYST_SEVERITIES: readonly ["critical", "high", "medium", "low", "info"];
-declare const RawAnalystFindingSchema: z.ZodObject<{
-    severity: z.ZodEnum<{
-        info: "info";
-        critical: "critical";
-        medium: "medium";
-        low: "low";
-        high: "high";
-    }>;
-    claim: z.ZodString;
-    subject: z.ZodOptional<z.ZodString>;
-    evidence_uri: z.ZodString;
-    evidence_excerpt: z.ZodOptional<z.ZodString>;
-    confidence: z.ZodNumber;
-    rationale: z.ZodOptional<z.ZodString>;
-    recommended_action: z.ZodOptional<z.ZodString>;
-}, z.core.$strict>;
-type RawAnalystFinding = z.infer<typeof RawAnalystFindingSchema>;
-/**
- * Description embedded into the actor prompt so the LLM knows what
- * shape to emit. Kept here so kinds share one source of truth rather
- * than restating the schema in every prompt.
- */
-declare const RAW_FINDING_SCHEMA_PROMPT = "Each finding MUST be a JSON object with these fields:\n  - severity: one of \"critical\" | \"high\" | \"medium\" | \"low\" | \"info\"\n  - claim: one-sentence statement (max 2000 chars)\n  - subject?: the routing locus this finding is about. It MUST be one of the exact subject forms listed in this kind's instructions above (e.g. `system-prompt:<section>`, `agent-knowledge:wiki:<slug>`, `tool-doc:<tool>`). A free phrase, a bare noun, or any form not in that list is REJECTED at parse time and the finding is discarded \u2014 omit subject entirely rather than guess a form.\n  - evidence_uri: REQUIRED, never blank. Exactly one of \"span://<trace_id>/<span_id>\" (trace evidence), \"artifact://<relative-path>\" (files), \"metric://<name>\" (named scalars) \u2014 ALWAYS cite a real id surfaced by the tools. If you have no citable id, do not emit the finding.\n  - evidence_excerpt?: short quote (<=2000 chars) from the cited span/artifact\n  - confidence: number 0..1 \u2014 0.9+ when backed by exact quotes, 0.6-0.8 for inferred patterns, <0.5 for speculative\n  - rationale?: one or two sentences explaining the reasoning\n  - recommended_action?: concrete change phrased as an imperative (\"Add ...\", \"Replace ...\", \"Stop ...\") \u2014 omit when the finding is purely descriptive\n\nEmit an empty array when the question has no findings to report. Do not fabricate evidence.";
-/**
- * Validate one row emitted by the LLM. Returns the typed finding on
- * success; returns `null` and logs the reason on failure so the kind
- * factory can skip-and-count rather than abort the whole analyst run.
- */
-declare function parseRawFinding(row: unknown, log?: (msg: string, fields?: Record<string, unknown>) => void): RawAnalystFinding | null;
-
 /**
  * Analyst contract — the missing orchestration layer over agent-eval's
  * existing analyzers (analyzeTraces, MultiLayerVerifier, RunCritic,
@@ -388,121 +346,110 @@ type AnalystRunEvent = {
     result: AnalystRunResult;
 };
 
-/**
- * Analyst-kind factory — the typed way to define trace analysts.
- *
- * A "kind" is a specialized analyst whose actor prompt, tool subset,
- * and Ax recursion config target one failure-mode lens (failure-mode
- * classification, knowledge gap discovery, knowledge poisoning, recursive
- * self-improvement, ...). Kinds emit findings in the typed `RawAnalystFinding`
- * shape via a JSON-array Ax output; the factory validates each row with
- * Zod and lifts it into `AnalystFinding[]` with no shape guessing.
- *
- * Composition rules:
- *   - Each kind owns its actor description. No generic "answer this
- *     question" prompt — the prompt names the failure lens.
- *   - Each kind picks a narrow tool subset from `ANALYST_TOOL_GROUPS`.
- *     A kind that never needs full-trace dumps can drop `viewTrace` /
- *     `viewSpans` and stay cheap.
- *   - Each kind declares its recursion + parallelism budget. Discovery-
- *     heavy kinds (failure-mode) get higher `maxDepth`; lens kinds
- *     (poisoning) usually stay at 0 since they have a tighter brief.
- *
- * Optimizer hook: kinds may declare `goldens` — labeled examples used
- * by `AxMiPRO` / `AxBootstrapFewShot` / `AxGEPA` to fit the actor
- * description programmatically. Stored on the kind, not the registry,
- * because the right metric is kind-specific.
- */
-
-/**
- * Per-kind specification. The factory turns this into a regular
- * `Analyst<TraceAnalysisStore>` ready for `AnalystRegistry.register()`.
- */
-interface TraceAnalystKindSpec {
-    /** Stable id. Appears in finding_id, telemetry, and registry exclusions. */
-    id: string;
-    /** One-sentence description shown in `registry.list()`. */
-    description: string;
-    /** Coarse classification stamped on every emitted finding (`failure-mode`, `knowledge-gap`, ...). */
-    area: string;
-    /** Bump on any breaking change to the actor prompt or output schema. */
-    version: string;
-    /** Actor system prompt. Must instruct the LLM to emit `findings` per the schema. */
-    actorDescription: string;
-    /** Responder system prompt; falls back to a minimal "format the findings" instruction. */
-    responderDescription?: string;
-    /** Tool functions the actor may call. Pick narrow subsets via `ANALYST_TOOL_GROUPS`. */
-    buildTools: (store: TraceAnalysisStore) => AxFunction[];
-    /** Recursion budget. `maxDepth: 0` disables subagents. */
-    recursion?: {
-        maxDepth: number;
-        maxParallelSubagents?: number;
-    };
-    /** Actor turn cap. Default 12. */
-    maxTurns?: number;
-    /** Runtime char cap. Default 6000. */
-    maxRuntimeChars?: number;
-    /** Cost classification surfaced in `registry.list()` and budget enforcement. */
-    cost: AnalystCost;
-    /** Per-finding-row hook — kinds may reject / rewrite before lifting. */
-    postProcess?: (row: RawAnalystFinding, ctx: AnalystContext) => RawAnalystFinding | null;
-    /** Optional optimizer hook — populated when a kind wants to fit its prompt against labeled examples. */
-    goldens?: TraceAnalystGolden[];
+type PolicyEditSchemaVersion = 'policy-edit/v1';
+declare const POLICY_EDIT_AXES: readonly ["carrier", "representation", "budget", "sampling", "output_contract", "tool_contract", "routing", "memory", "agent_profile", "deployment_target"];
+type PolicyEditAxis = (typeof POLICY_EDIT_AXES)[number];
+declare const POLICY_EDIT_TARGET_SURFACES: readonly ["prompt", "tool-contract", "runtime-config", "memory", "agent-profile", "code", "deployment"];
+type PolicyEditTargetSurface = (typeof POLICY_EDIT_TARGET_SURFACES)[number];
+type PolicyEditRisk = 'low' | 'medium' | 'high' | 'unknown';
+type PolicyEditGainDirection = 'increase' | 'decrease';
+type PolicyEditGainUnit = 'absolute' | 'relative' | 'percent' | 'score';
+interface PolicyEditTarget {
+    surface: PolicyEditTargetSurface;
+    /** Stable path inside the target surface, for example `system-prompt:tools`
+     * or `budget.maxTurns`. */
+    path?: string;
+    /** Optional canonical deployment identity. Store the existing cell, not a
+     * local profile shape. */
+    agentProfileCell?: AgentProfileCell;
+    /** Human label when the path is not enough for a readable audit trail. */
+    label?: string;
 }
-/**
- * One labeled example consumed by Ax optimizers (MIPRO / GEPA / Bootstrap).
- * Each input is the same `{question}` an analyst would receive; `expected`
- * is the ground-truth finding set a fitted prompt should produce on this
- * input. Metric: kind-specific (default: F1 on `finding_id` overlap).
- */
-interface TraceAnalystGolden {
-    question: string;
-    expected: ReadonlyArray<Omit<RawAnalystFinding, 'confidence'>>;
+type PolicyEditChange = {
+    kind: 'text';
+    mode: 'append' | 'prepend' | 'replace';
+    value: string;
+    /** Required when `mode === 'replace'`; exact match only. */
+    find?: string;
+} | {
+    kind: 'json';
+    mode: 'set' | 'merge' | 'remove';
+    path: string;
+    value?: AgentProfileJson;
+};
+interface PolicyEditExpectedGain {
+    /** Metric this edit is expected to move, e.g. `holdout.composite`. */
+    metric: string;
+    direction: PolicyEditGainDirection;
+    /** Positive magnitude in the metric's native units. */
+    amount: number;
+    unit?: PolicyEditGainUnit;
+    rationale?: string;
 }
-interface CreateTraceAnalystKindOpts {
-    /** AxAIService bound at registration time. */
-    ai: AxAIService;
-    /** Optional model override; falls back to the AI service's default. */
-    model?: string;
-    /** Override the spec's `version` (e.g. when an optimizer has fitted a new prompt). */
-    versionSuffix?: string;
-    /**
-     * Optional two-phase recovery: when the agentic harvest is empty but the
-     * actor produced a substantive free-form `report`, extract findings from that
-     * prose via a tolerant chat-completions pass (`structureFindings`) — no
-     * strict-emission contract, so it works on weak models. Omit to leave the
-     * actor's harvest as-is (the report is still surfaced fail-loud either way).
-     */
-    recovery?: {
-        baseUrl: string;
-        apiKey?: string;
-        model?: string;
-        fetchImpl?: typeof fetch;
-    };
+interface PolicyEditSource {
+    findingIds: string[];
+    analystIds: string[];
+    evidenceRefs: EvidenceRef[];
+    /** Mirrors `AnalystFinding.derived_from_judge`; admission rejects it. */
+    derivedFromJudge?: boolean;
 }
-/**
- * Build an `Analyst<TraceAnalysisStore>` from a kind spec.
- *
- * Lifts the Ax pipeline once at registration time so the registry
- * gets a stateless analyst. The Ax agent is freshly constructed per
- * `analyze()` call (the agent carries chat-log + usage state we don't
- * want shared across analyst runs).
- */
-declare function createTraceAnalystKind(spec: TraceAnalystKindSpec, opts: CreateTraceAnalystKindOpts): Analyst<TraceAnalysisStore>;
-/**
- * Render a compact prior-findings block the actor reads alongside its
- * brief. Each row is one line so the actor can scan dozens cheaply.
- * The kind's prompt instructs the actor to (a) check whether a new
- * cluster matches a prior `finding_id` (carry the id forward via
- * `id_basis` to keep diffs stable) and (b) raise severity / confidence
- * when a prior finding has reappeared without remediation.
- *
- * Returns the empty string when there are no prior findings — most
- * runs are "first-of-its-kind" and the prompt stays unchanged.
- *
- * Exported for tests + for consumers that build their own actor
- * prompts (e.g. specialized analysts living outside the default kinds).
- */
-declare function renderPriorFindings(prior: AnalystContext['priorFindings']): string;
+interface PolicyEdit {
+    schemaVersion: PolicyEditSchemaVersion;
+    editId: string;
+    axis: PolicyEditAxis;
+    target: PolicyEditTarget;
+    change: PolicyEditChange;
+    claim: string;
+    expectedGain: PolicyEditExpectedGain;
+    confidence: number;
+    risk: PolicyEditRisk;
+    source: PolicyEditSource;
+    rationale?: string;
+    validationPlan?: string;
+    metadata?: Record<string, unknown>;
+}
+declare const POLICY_EDIT_CANDIDATE_RECORD_SCHEMA: "tangle.policy-edit-candidate.v1";
+/** JSON-safe attribution carried with a measured candidate and its scores. */
+interface PolicyEditCandidateRecord {
+    schema: typeof POLICY_EDIT_CANDIDATE_RECORD_SCHEMA;
+    policyEdit: PolicyEdit;
+}
+type PolicyEditInit = Omit<PolicyEdit, 'schemaVersion' | 'editId'> & {
+    schemaVersion?: PolicyEditSchemaVersion;
+    editId?: string;
+};
+declare class PolicyEditValidationError extends ValidationError {
+    readonly path: string;
+    constructor(message: string, path?: string);
+}
+interface FindingToPolicyEditOptions {
+    expectedGain?: PolicyEditExpectedGain | ((finding: AnalystFinding) => PolicyEditExpectedGain | null | undefined);
+    risk?: PolicyEditRisk | ((finding: AnalystFinding) => PolicyEditRisk);
+    defaultAxis?: PolicyEditAxis;
+    defaultTargetSurface?: PolicyEditTargetSurface;
+}
+interface PolicyEditAdmissionOptions {
+    minScore?: number;
+    minExpectedGain?: number;
+    allowHighRisk?: boolean;
+    requireEvidence?: boolean;
+}
+interface PolicyEditAdmission {
+    edit: PolicyEdit;
+    decision: 'admit' | 'reject';
+    score: number;
+    reasons: string[];
+}
+declare function makePolicyEdit(init: PolicyEditInit): PolicyEdit;
+declare function computePolicyEditId(edit: Omit<PolicyEdit, 'editId'> | PolicyEdit): string;
+declare function validatePolicyEdit(input: unknown): PolicyEdit;
+declare function makePolicyEditCandidateRecord(edit: PolicyEdit): PolicyEditCandidateRecord;
+declare function validatePolicyEditCandidateRecord(input: unknown): PolicyEditCandidateRecord;
+declare function isPolicyEdit(input: unknown): input is PolicyEdit;
+declare function policyEditsFromFindings(findings: ReadonlyArray<AnalystFinding>, opts?: FindingToPolicyEditOptions): PolicyEdit[];
+declare function policyEditFromFinding(finding: AnalystFinding, opts?: FindingToPolicyEditOptions): PolicyEdit | null;
+declare function scorePolicyEditReadiness(edit: PolicyEdit, opts?: PolicyEditAdmissionOptions): number;
+declare function admitPolicyEdit(edit: PolicyEdit, opts?: PolicyEditAdmissionOptions): PolicyEditAdmission;
+declare function applyPolicyEditToSurface(surface: unknown, edit: PolicyEdit): unknown;
 
-export { type AnalystFinding as A, parseRawFinding as B, type ChatClient as C, type DirectProviderTransportOpts as D, type EvidenceRef as E, renderPriorFindings as F, type MockTransportOpts as M, RAW_FINDING_SCHEMA_PROMPT as R, type SandboxSdkTransportOpts as S, type TraceAnalystKindSpec as T, type Analyst as a, type AnalystContext as b, type AnalystRunSummary as c, type AnalystRunResult as d, type AnalystRunInputs as e, type AnalystRunEvent as f, type AnalystSeverity as g, ANALYST_SEVERITIES as h, type AnalystCost as i, type AnalystInputKind as j, type AnalystRequirements as k, type ChatCallOpts as l, type ChatRequest as m, type ChatResponse as n, type ChatTransport as o, type CliBridgeTransportOpts as p, type CreateChatClientOpts as q, type CreateTraceAnalystKindOpts as r, type RawAnalystFinding as s, RawAnalystFindingSchema as t, type RouterTransportOpts as u, type TraceAnalystGolden as v, computeFindingId as w, createChatClient as x, createTraceAnalystKind as y, makeFinding as z };
+export { policyEditsFromFindings as $, type Analyst as A, type PolicyEditGainUnit as B, type ChatClient as C, type DirectProviderTransportOpts as D, type EvidenceRef as E, type FindingToPolicyEditOptions as F, type PolicyEditInit as G, type PolicyEditRisk as H, type PolicyEditSchemaVersion as I, type PolicyEditSource as J, type PolicyEditTarget as K, type PolicyEditTargetSurface as L, type MockTransportOpts as M, PolicyEditValidationError as N, admitPolicyEdit as O, type PolicyEditCandidateRecord as P, applyPolicyEditToSurface as Q, type RouterTransportOpts as R, type SandboxSdkTransportOpts as S, computeFindingId as T, computePolicyEditId as U, createChatClient as V, isPolicyEdit as W, makeFinding as X, makePolicyEdit as Y, makePolicyEditCandidateRecord as Z, policyEditFromFinding as _, type AnalystContext as a, scorePolicyEditReadiness as a0, validatePolicyEdit as a1, validatePolicyEditCandidateRecord as a2, type AnalystRunSummary as b, type AnalystFinding as c, type AnalystRunResult as d, type AnalystRunInputs as e, type AnalystRunEvent as f, type AnalystCost as g, type AnalystSeverity as h, type AnalystInputKind as i, type AnalystRequirements as j, type ChatCallOpts as k, type ChatRequest as l, type ChatResponse as m, type ChatTransport as n, type CliBridgeTransportOpts as o, type CreateChatClientOpts as p, POLICY_EDIT_AXES as q, POLICY_EDIT_CANDIDATE_RECORD_SCHEMA as r, POLICY_EDIT_TARGET_SURFACES as s, type PolicyEdit as t, type PolicyEditAdmission as u, type PolicyEditAdmissionOptions as v, type PolicyEditAxis as w, type PolicyEditChange as x, type PolicyEditExpectedGain as y, type PolicyEditGainDirection as z };

package/dist/{pre-registration-D8h7ZxNL.d.ts → pre-registration-BWQhJ3vz.d.ts}

@@ -1,8 +1,10 @@
 import { A as AgentEvalError } from './errors-oeQrLqXC.js';
-import { R as RunRecord } from './run-record-B7RTi_ix.js';
-import { P as PairedBootstrapOptions, M as McNemarResult, R as RiskDifferenceResult, a as PairedBootstrapResult } from './statistics-oUbOJe-S.js';
-import { C as ChatClient } from './kind-factory-DcNg13sZ.js';
-import { a as JudgeDimension, S as Scenario, b as JudgeConfig } from './types-C5gJrOVT.js';
+import { R as RunRecord } from './run-record-BDH49H2E.js';
+import { P as PairedBootstrapOptions, M as McNemarResult, R as RiskDifferenceResult, a as PairedBootstrapResult } from './statistics-KUnG73jH.js';
+import { z } from 'zod';
+import { C as ChatClient } from './policy-edit-wG9uFEFm.js';
+import { a as JudgeDimension, S as Scenario, b as JudgeConfig } from './types-BSw1rOUB.js';
+import { C as CostLedger, c as CostReceiptInput } from './cost-ledger-DWy3XdJc.js';
 import { TCloud } from '@tangle-network/tcloud';
 import { R as RawProviderSink } from './raw-provider-sink-C46HDghv.js';
 import { D as DefaultVerdict } from './verdict-C9MlYujm.js';
@@ -429,6 +431,15 @@ type CorrectnessChecker = (requirement: CompletionRequirement, content: string)
 declare function verifyCompletion(gold: TaskGold, state: ProducedState, checkCorrectness: CorrectnessChecker): Promise<CompletionVerdict>;
 interface LlmCorrectnessCheckerOpts {
     model?: string;
+    /** Optional ledger for direct use. */
+    costLedger?: CostLedger;
+    costPhase?: string;
+    costTags?: Record<string, string>;
+    signal?: AbortSignal;
+    /** Exact maximum provider attempts configured on the supplied TCloud client. */
+    tcloudMaximumAttempts?: number;
+    /** Usage/cost retained by a failed provider response; enables a safe retry. */
+    receiptFromError?: (error: Error, attempt: number) => CostReceiptInput | undefined;
     /** Max chars of artifact content sent to the checker. */
     maxContentChars?: number;
     /**
@@ -520,6 +531,8 @@ interface LlmJudgeOptions<TArtifact, TScenario extends Scenario = Scenario> {
     dimensions?: LlmJudgeDimension[];
     /** Model id. Falls back to `chat.defaultModel`; one of the two MUST resolve. */
     model?: string;
+    /** Explicit scoring revision for opaque transport or renderer changes. */
+    judgeVersion?: string;
     temperature?: number;
     maxTokens?: number;
     /** Composite weights forwarded to `weightedComposite`: a partial map selects
@@ -538,6 +551,12 @@ interface LlmJudgeOptions<TArtifact, TScenario extends Scenario = Scenario> {
         artifact: TArtifact;
         scenario: TScenario;
     }) => string;
+    /** Strict runtime contract; its JSON Schema is sent to the provider. */
+    costLedger?: CostLedger;
+    responseSchema?: {
+        name: string;
+        schema: z.ZodObject;
+    };
 }
 /**
  * Build a campaign-shaped `JudgeConfig` whose `score()` makes ONE LLM call