@tangle-network/agent-eval 0.215.1 → 0.216.1

package/dist/{tool-waste-Wi4g6Ekb.d.ts → tool-waste-BKgvd-TP.d.ts}

@@ -76,6 +76,34 @@ declare function iqr(xs: number[]): number;
  */
 declare function welchsTTest(a: number[], b: number[]): WelchTestResult;
 //#endregion
+//#region src/tool-use-metrics.d.ts
+interface ToolUseMetrics {
+  runId: string;
+  totalCalls: number;
+  /** Calls whose arguments were captured and can be compared for duplication. */
+  callsWithCapturedArgs: number;
+  byTool: Record<string, ToolStats>;
+  errorRate: number;
+  /** Ratio of captured-argument calls already seen with the same tool name and arguments. */
+  duplicateRate: number;
+  /** Ratio of error calls followed by ≥1 retry on same tool. */
+  retryRate: number;
+  /** Optional: of the calls agent made, fraction the evaluator marked as "correct selection". */
+  selectionAccuracy?: number;
+}
+interface ToolStats {
+  calls: number;
+  callsWithCapturedArgs: number;
+  errors: number;
+  avgLatencyMs: number;
+  duplicates: number;
+}
+interface ToolUseOptions {
+  /** Map of spanId → whether the evaluator judged the tool selection correct. Optional. */
+  selectionLabels?: Record<string, boolean>;
+}
+declare function computeToolUseMetrics(store: TraceStore, runId: string, options?: ToolUseOptions): Promise<ToolUseMetrics>;
+//#endregion
 //#region src/pipelines/budget-breach.d.ts
 interface BudgetBreachFinding {
   runId: string;
@@ -117,34 +145,6 @@ interface JudgeAgreementReport {
 }
 declare function judgeAgreementView(store: TraceStore): Promise<JudgeAgreementReport>;
 //#endregion
-//#region src/tool-use-metrics.d.ts
-interface ToolUseMetrics {
-  runId: string;
-  totalCalls: number;
-  /** Calls whose arguments were captured and can be compared for duplication. */
-  callsWithCapturedArgs: number;
-  byTool: Record<string, ToolStats>;
-  errorRate: number;
-  /** Ratio of captured-argument calls already seen with the same tool name and arguments. */
-  duplicateRate: number;
-  /** Ratio of error calls followed by ≥1 retry on same tool. */
-  retryRate: number;
-  /** Optional: of the calls agent made, fraction the evaluator marked as "correct selection". */
-  selectionAccuracy?: number;
-}
-interface ToolStats {
-  calls: number;
-  callsWithCapturedArgs: number;
-  errors: number;
-  avgLatencyMs: number;
-  duplicates: number;
-}
-interface ToolUseOptions {
-  /** Map of spanId → whether the evaluator judged the tool selection correct. Optional. */
-  selectionLabels?: Record<string, boolean>;
-}
-declare function computeToolUseMetrics(store: TraceStore, runId: string, options?: ToolUseOptions): Promise<ToolUseMetrics>;
-//#endregion
 //#region src/pipelines/tool-waste.d.ts
 interface ToolWasteFinding {
   runId: string;
@@ -164,5 +164,5 @@ interface ToolWasteOptions {
 }
 declare function toolWasteView(store: TraceStore, options?: ToolWasteOptions): Promise<ToolWasteReport>;
 //#endregion
-export { WelchTestResult as _, ToolStats as a, welchsTTest as b, computeToolUseMetrics as c, judgeAgreementView as d, BudgetBreachFinding as f, BaselineReport as g, BaselineOptions as h, toolWasteView as i, JudgeAgreementReport as l, budgetBreachView as m, ToolWasteOptions as n, ToolUseMetrics as o, BudgetBreachReport as p, ToolWasteReport as r, ToolUseOptions as s, ToolWasteFinding as t, JudgePair as u, WelchTestStatus as v, iqr as y };
-//# sourceMappingURL=tool-waste-Wi4g6Ekb.d.ts.map
+export { WelchTestResult as _, JudgeAgreementReport as a, welchsTTest as b, BudgetBreachFinding as c, ToolStats as d, ToolUseMetrics as f, BaselineReport as g, BaselineOptions as h, toolWasteView as i, BudgetBreachReport as l, computeToolUseMetrics as m, ToolWasteOptions as n, JudgePair as o, ToolUseOptions as p, ToolWasteReport as r, judgeAgreementView as s, ToolWasteFinding as t, budgetBreachView as u, WelchTestStatus as v, iqr as y };
+//# sourceMappingURL=tool-waste-BKgvd-TP.d.ts.map

package/dist/tool-waste-BKgvd-TP.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tool-waste-BKgvd-TP.d.ts","names":[],"sources":["../src/baseline.ts","../src/tool-use-metrics.ts","../src/pipelines/budget-breach.ts","../src/pipelines/judge-agreement.ts","../src/pipelines/tool-waste.ts"],"mappings":";;;;UA6BiB;EACf;EACA;EACA;EACA;;;EAGA;EACA;EACA;EACA;EACA;;EAEA;EACA;;UAGe;EACf,SAAS;;EAET;;EAEA;;UAGe;;EAEf;;EAEA;;EAEA;;KAGU;;;;;;;;;UAUF;EACR;EACA;EACA;;KAGU,mBACP;EACC;EACA;EACA;EACA;EACA;EACA;EACA;MAED;EACC;EACA;EACA;EACA;EACA;EACA;EACA;;;iBA6EU,IAAI;;;;;;;;;iBAcJ,YAAY,aAAa,cAAc;;;UC9KtC;EACf;EACA;;EAEA;EACA,QAAQ,eAAe;EACvB;;EAEA;;EAEA;;EAEA;;UAGe;EACf;EACA;EACA;EACA;EACA;;UAGe;;EAEf,kBAAkB;;iBAGE,sBACpB,OAAO,YACP,eACA,UAAS,iBACR,QAAQ;;;UCnCM;EACf;EACA;EACA;EACA,iBAAiB;EACjB;EACA;EACA;EACA;;UAGe;EACf,UAAU;EACV,aAAa;EACb,YAAY;EACZ,WAAW;EACX;EACA;;iBAGoB,iBACpB,OAAO,YACP;EAAW;EAAqB;IAC/B,QAAQ;;;UCnBM;EACf;EACA;EACA;;EAEA;EACA;EACA;;UAGe;EACf,OAAO;EACP;EACA;;iBAGoB,mBAAmB,OAAO,aAAa,QAAQ;;;UCbpD;EACf;EACA;EACA;EACA;;UAGe;EACf,OAAO;EACP;;UAGe;EACf;EACA,eAAe,MAAM,UAAU;IAAS,KAAK,QAAQ,kBAAkB;;;iBAGnD,cACpB,OAAO,YACP,UAAS,mBACR,QAAQ"}

package/dist/{tool-waste-BYt5rdt8.js → tool-waste-BlesqTqW.js}

@@ -1,160 +1,7 @@
-import { s as ValidationError } from "./errors-Dngq5h35.js";
-import { r as pearsonR } from "./descriptive-CnU8Yq29.js";
-import { r as continuousAgreement } from "./judge-calibration-N44V04Se.js";
-import { a as hasCapturedToolArgs, d as toolSpans, i as groupBy, r as argHash, s as llmSpans } from "./query-B1D1qp2Z.js";
+import { r as pearsonR } from "./descriptive-DboxPZrG.js";
+import { r as interRaterReliability } from "./agreement-irr-BEWLIF3_.js";
+import { a as hasCapturedToolArgs, d as toolSpans, i as groupBy, r as argHash, s as llmSpans } from "./query-BUCZCK7F.js";
 import { a as classifyFailure, n as DEFAULT_RULES } from "./failure-taxonomy-CjabTATj.js";
-//#region src/statistics/agreement-irr.ts
-/**
-* Inter-rater reliability — Krippendorff's α under the squared-difference
-* metric, pooled across dimensions.
-*
-* Each inner array is one judge's scores. Items are matched by position
-* WITHIN a dimension: the k-th score a judge supplies carrying dimension
-* `d` is item k of `d`, and the ratings compared against each other are
-* the ones different judges gave to the same item. Every judge that scores
-* a dimension at all must supply the same number of scores for it —
-* ragged input cannot be aligned into items and throws rather than
-* comparing mismatched items.
-*
-* α = 1 − D_observed / D_expected: D_observed averages the squared
-* difference over within-item judge pairs, D_expected over every pair of
-* ratings irrespective of item. α = 1 is perfect agreement, 0 is chance,
-* negative is systematic disagreement.
-*/
-function interRaterReliability(judgeScores) {
-	if (judgeScores.length < 2) return 1;
-	const perDimension = /* @__PURE__ */ new Map();
-	for (let judgeIndex = 0; judgeIndex < judgeScores.length; judgeIndex++) for (const s of judgeScores[judgeIndex]) {
-		let byJudge = perDimension.get(s.dimension);
-		if (byJudge === void 0) {
-			byJudge = Array.from({ length: judgeScores.length }, () => []);
-			perDimension.set(s.dimension, byJudge);
-		}
-		byJudge[judgeIndex].push(s.score);
-	}
-	const allValues = [];
-	const pairDiffs = [];
-	for (const [dimension, byJudge] of perDimension) {
-		const scoring = byJudge.filter((scores) => scores.length > 0);
-		if (scoring.length < 2) continue;
-		const itemCount = scoring[0].length;
-		if (scoring.some((scores) => scores.length !== itemCount)) throw new ValidationError(`interRaterReliability: dimension '${dimension}' has judges supplying ${scoring.map((scores) => scores.length).join("/")} scores — items cannot be aligned`);
-		for (let item = 0; item < itemCount; item++) {
-			const ratings = scoring.map((scores) => scores[item]);
-			for (const v of ratings) allValues.push(v);
-			for (let i = 0; i < ratings.length; i++) for (let j = i + 1; j < ratings.length; j++) pairDiffs.push((ratings[i] - ratings[j]) ** 2);
-		}
-	}
-	if (pairDiffs.length === 0 || allValues.length < 2) return 1;
-	const observedDisagreement = pairDiffs.reduce((a, b) => a + b, 0) / pairDiffs.length;
-	let expectedDisagreement = 0;
-	let expectedCount = 0;
-	for (let i = 0; i < allValues.length; i++) for (let j = i + 1; j < allValues.length; j++) {
-		expectedDisagreement += (allValues[i] - allValues[j]) ** 2;
-		expectedCount++;
-	}
-	expectedDisagreement = expectedCount > 0 ? expectedDisagreement / expectedCount : 0;
-	if (expectedDisagreement === 0) return 1;
-	return 1 - observedDisagreement / expectedDisagreement;
-}
-/**
-* Corpus-wide inter-rater agreement across N items × M judges × D dimensions.
-*
-* For each dimension, builds the [n_items][n_judges] matrix of scores
-* (keeping only items every judge rated on that dimension), then runs
-* `continuousAgreement` to get ICC(2,1), κ_w, Pearson, Spearman, and
-* bootstrap CIs. Reports a pooled mean across dimensions as a single
-* "is this judge panel reliable on this corpus?" number.
-*
-* Fail-loud contract:
-*   - Empty input throws.
-*   - Fewer than 2 judges or fewer than 2 items per dimension throws.
-*   - A judge present in some dimensions but with zero scored items on
-*     another dimension throws (would silently shrink the matrix).
-*   - Duplicate (itemId, judgeName, dimension) records throw.
-*/
-function corpusInterRaterAgreement(records, opts = {}) {
-	if (records.length === 0) throw new ValidationError("corpusInterRaterAgreement: no score records supplied");
-	const judgesSeen = /* @__PURE__ */ new Set();
-	const dimsSeen = /* @__PURE__ */ new Set();
-	const grid = /* @__PURE__ */ new Map();
-	for (const r of records) {
-		if (!Number.isFinite(r.score)) throw new ValidationError(`corpusInterRaterAgreement: non-finite score for (item=${r.itemId}, judge=${r.judgeName}, dim=${r.dimension})`);
-		judgesSeen.add(r.judgeName);
-		dimsSeen.add(r.dimension);
-		const byJudge = grid.get(r.dimension) ?? /* @__PURE__ */ new Map();
-		const byItem = byJudge.get(r.judgeName) ?? /* @__PURE__ */ new Map();
-		if (byItem.has(r.itemId)) throw new ValidationError(`corpusInterRaterAgreement: duplicate record for (item=${r.itemId}, judge=${r.judgeName}, dim=${r.dimension})`);
-		byItem.set(r.itemId, r.score);
-		byJudge.set(r.judgeName, byItem);
-		grid.set(r.dimension, byJudge);
-	}
-	const targetDims = opts.dimensions ?? [...dimsSeen].sort();
-	for (const d of targetDims) if (!dimsSeen.has(d)) throw new ValidationError(`corpusInterRaterAgreement: dimension '${d}' was requested but no records carry it`);
-	const targetJudges = opts.judges ? [...opts.judges] : [...judgesSeen].sort();
-	for (const j of targetJudges) if (!judgesSeen.has(j)) throw new ValidationError(`corpusInterRaterAgreement: judge '${j}' was requested but produced no records`);
-	if (targetJudges.length < 2) throw new ValidationError(`corpusInterRaterAgreement: need ≥2 judges, got ${targetJudges.length}`);
-	const perDimension = [];
-	const iccs = [];
-	const kappas = [];
-	for (const dim of targetDims) {
-		const byJudge = grid.get(dim);
-		const judgeItemCounts = {};
-		for (const j of targetJudges) judgeItemCounts[j] = byJudge.get(j)?.size ?? 0;
-		const emptyJudges = targetJudges.filter((j) => judgeItemCounts[j] === 0);
-		if (emptyJudges.length > 0) throw new ValidationError(`corpusInterRaterAgreement: dimension '${dim}' has no scores from judge(s) ${emptyJudges.join(", ")} (counts: ${JSON.stringify(judgeItemCounts)})`);
-		let commonItems = null;
-		for (const j of targetJudges) {
-			const ids = new Set(byJudge.get(j).keys());
-			if (commonItems === null) commonItems = ids;
-			else commonItems = new Set([...commonItems].filter((x) => ids.has(x)));
-		}
-		const sortedItems = [...commonItems ?? /* @__PURE__ */ new Set()].sort();
-		if (sortedItems.length < 2) throw new ValidationError(`corpusInterRaterAgreement: dimension '${dim}' has ${sortedItems.length} item(s) rated by all ${targetJudges.length} judges (need ≥2)`);
-		const matrix = sortedItems.map((itemId) => targetJudges.map((j) => byJudge.get(j).get(itemId)));
-		const agreement = continuousAgreement(matrix, opts);
-		perDimension.push({
-			...agreement,
-			dimension: dim,
-			itemIds: sortedItems,
-			judgeIds: [...targetJudges]
-		});
-		if (Number.isFinite(agreement.icc)) iccs.push(agreement.icc);
-		if (Number.isFinite(agreement.weightedKappa)) kappas.push(agreement.weightedKappa);
-	}
-	const mean = (xs) => xs.length === 0 ? NaN : xs.reduce((a, b) => a + b, 0) / xs.length;
-	return {
-		perDimension,
-		overallIcc: mean(iccs),
-		overallWeightedKappa: mean(kappas),
-		dimensions: targetDims,
-		judgeIds: targetJudges
-	};
-}
-/**
-* Convenience adapter for `JudgeScore[]` data keyed externally by item.
-*
-* Use when you have per-item arrays of `JudgeScore[]` (e.g. one
-* `ScenarioResult.judgeScores` per scenario) and want corpus-wide
-* agreement without manually flattening. `itemId` must be unique per
-* row of `itemsScores`.
-*/
-function corpusInterRaterAgreementFromJudgeScores(itemsScores, opts = {}) {
-	const records = [];
-	const seen = /* @__PURE__ */ new Set();
-	for (const { itemId, scores } of itemsScores) {
-		if (seen.has(itemId)) throw new ValidationError(`corpusInterRaterAgreementFromJudgeScores: duplicate itemId '${itemId}'`);
-		seen.add(itemId);
-		for (const s of scores) records.push({
-			itemId,
-			judgeName: s.judgeName,
-			dimension: s.dimension,
-			score: s.score
-		});
-	}
-	return corpusInterRaterAgreement(records, opts);
-}
-//#endregion
 //#region src/pipelines/budget-breach.ts
 async function budgetBreachView(store, options = {}) {
 	const runs = await store.listRuns({
@@ -516,6 +363,6 @@ function stringify(v) {
 	}
 }
 //#endregion
-export { budgetBreachView as a, interRaterReliability as c, failureClusterView as i, computeToolUseMetrics as n, corpusInterRaterAgreement as o, judgeAgreementView as r, corpusInterRaterAgreementFromJudgeScores as s, toolWasteView as t };
+export { budgetBreachView as a, failureClusterView as i, computeToolUseMetrics as n, judgeAgreementView as r, toolWasteView as t };
 
-//# sourceMappingURL=tool-waste-BYt5rdt8.js.map
+//# sourceMappingURL=tool-waste-BlesqTqW.js.map

package/dist/tool-waste-BlesqTqW.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tool-waste-BlesqTqW.js","names":[],"sources":["../src/pipelines/budget-breach.ts","../src/pipelines/failure-cluster.ts","../src/pipelines/judge-agreement.ts","../src/tool-use-metrics.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 * 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 * Tool-use metrics — derived purely from trace data.\n *\n * No scoring assumptions: consumers supply optional ground-truth tool\n * selections per turn + optional \"information used downstream\" signals.\n * Without those, we still compute descriptive metrics (error rate,\n * retry rate, duplicate-call rate) that are useful on their own.\n */\n\nimport { argHash, groupBy, hasCapturedToolArgs, toolSpans } from './trace/query'\nimport type { Span } from './trace/schema'\nimport type { TraceStore } from './trace/store'\n\nexport interface ToolUseMetrics {\n  runId: string\n  totalCalls: number\n  /** Calls whose arguments were captured and can be compared for duplication. */\n  callsWithCapturedArgs: number\n  byTool: Record<string, ToolStats>\n  errorRate: number\n  /** Ratio of captured-argument calls already seen with the same tool name and arguments. */\n  duplicateRate: number\n  /** Ratio of error calls followed by ≥1 retry on same tool. */\n  retryRate: number\n  /** Optional: of the calls agent made, fraction the evaluator marked as \"correct selection\". */\n  selectionAccuracy?: number\n}\n\nexport interface ToolStats {\n  calls: number\n  callsWithCapturedArgs: number\n  errors: number\n  avgLatencyMs: number\n  duplicates: number\n}\n\nexport interface ToolUseOptions {\n  /** Map of spanId → whether the evaluator judged the tool selection correct. Optional. */\n  selectionLabels?: Record<string, boolean>\n}\n\nexport async function computeToolUseMetrics(\n  store: TraceStore,\n  runId: string,\n  options: ToolUseOptions = {},\n): Promise<ToolUseMetrics> {\n  const tools = await toolSpans(store, runId)\n  if (tools.length === 0) {\n    return {\n      runId,\n      totalCalls: 0,\n      callsWithCapturedArgs: 0,\n      byTool: {},\n      errorRate: 0,\n      duplicateRate: 0,\n      retryRate: 0,\n    }\n  }\n\n  const byTool: Record<string, ToolStats> = {}\n  let totalErrors = 0\n  let totalDuplicates = 0\n  let callsWithCapturedArgs = 0\n  const sortedTools = [...tools].sort((a, b) => a.startedAt - b.startedAt)\n  const seenSignatures = new Set<string>()\n\n  // duplicate detection + per-tool aggregation\n  for (const t of sortedTools) {\n    byTool[t.toolName] ??= {\n      calls: 0,\n      callsWithCapturedArgs: 0,\n      errors: 0,\n      avgLatencyMs: 0,\n      duplicates: 0,\n    }\n    const stat = byTool[t.toolName]!\n    stat.calls += 1\n    if (t.status === 'error') {\n      stat.errors += 1\n      totalErrors += 1\n    }\n    if (typeof t.latencyMs === 'number') stat.avgLatencyMs += t.latencyMs\n    if (hasCapturedToolArgs(t)) {\n      callsWithCapturedArgs += 1\n      stat.callsWithCapturedArgs += 1\n      const sig = `${t.toolName}|${argHash(t.args)}`\n      if (seenSignatures.has(sig)) {\n        stat.duplicates += 1\n        totalDuplicates += 1\n      }\n      seenSignatures.add(sig)\n    }\n  }\n\n  for (const stat of Object.values(byTool)) {\n    stat.avgLatencyMs = stat.calls > 0 ? stat.avgLatencyMs / stat.calls : 0\n  }\n\n  // retry detection: per-tool chronological adjacency where error → next same-tool call\n  let retryOpportunities = 0\n  let retriesFollowed = 0\n  for (const [, arr] of groupBy(sortedTools, (t) => t.toolName)) {\n    for (let i = 0; i < arr.length; i++) {\n      if (arr[i]!.status !== 'error') continue\n      retryOpportunities += 1\n      if (arr[i + 1]) retriesFollowed += 1\n    }\n  }\n  const retryRate = retryOpportunities > 0 ? retriesFollowed / retryOpportunities : 0\n\n  let selectionAccuracy: number | undefined\n  if (options.selectionLabels) {\n    const labeled = sortedTools.filter((t) => t.spanId in options.selectionLabels!)\n    if (labeled.length > 0) {\n      selectionAccuracy =\n        labeled.filter((t) => options.selectionLabels![t.spanId]).length / labeled.length\n    }\n  }\n\n  return {\n    runId,\n    totalCalls: sortedTools.length,\n    callsWithCapturedArgs,\n    byTool,\n    errorRate: totalErrors / sortedTools.length,\n    duplicateRate: callsWithCapturedArgs > 0 ? totalDuplicates / callsWithCapturedArgs : 0,\n    retryRate,\n    selectionAccuracy,\n  }\n}\n\nexport type { Span }\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;CAC7B,MAAM,OAAO,MAAM,MAAM,SAAS;EAChC,YAAY,QAAQ;EACpB,WAAW,QAAQ;CACrB,CAAC;CACD,MAAM,WAAkC,CAAC;CACzC,MAAM,cAAsC,CAAC;CAC7C,MAAM,aAAqC,CAAC;CAC5C,MAAM,YAAoC,CAAC;CAE3C,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,UAAU,MAAM,MAAM,OAAO,IAAI,KAAK;EAC5C,KAAK,MAAM,KAAK,SAAS;GACvB,IAAI,CAAC,EAAE,UAAU;GACjB,MAAM,cAAc,EAAE,QAAQ,IAAI,EAAE,WAAW,EAAE,QAAQ;GACzD,SAAS,KAAK;IACZ,OAAO,IAAI;IACX,YAAY,IAAI;IAChB,WAAW,IAAI;IACf,WAAW,EAAE;IACb,OAAO,EAAE;IACT,UAAU,EAAE;IACZ;IACA,WAAW,EAAE;GACf,CAAC;GACD,YAAY,EAAE,cAAc,YAAY,EAAE,cAAc,KAAK;GAC7D,WAAW,IAAI,eAAe,WAAW,IAAI,eAAe,KAAK;GACjE,IAAI,IAAI,WAAW,UAAU,IAAI,cAAc,UAAU,IAAI,cAAc,KAAK;EAClF;CACF;CAEA,MAAM,eAAe,IAAI,IAAI,SAAS,KAAK,MAAM,EAAE,KAAK,CAAC;CACzD,OAAO;EACL;EACA;EACA;EACA;EACA,WAAW,KAAK;EAChB,kBAAkB,KAAK,SAAS,IAAI,aAAa,OAAO,KAAK,SAAS;CACxE;AACF;;;;;;;;;;ACnCA,eAAsB,mBACpB,OACA,UAA8D,CAAC,GAChC;CAC/B,MAAM,QAAQ,QAAQ,SAAS;CAC/B,MAAM,UAAU,QAAQ,kBAAkB;CAC1C,MAAM,OAAO,MAAM,MAAM,SAAS;CAGlC,MAAM,2BAAW,IAAI,IAAyB;CAC9C,IAAI,gBAAgB;CAEpB,KAAK,MAAM,OAAO,MAAM;EACtB,IAAI,IAAI,WAAW,eAAe,IAAI,SAAS,SAAS,OAAO;EAC/D;EACA,MAAM,QAAQ,MAAM,MAAM,MAAM,EAAE,OAAO,IAAI,MAAM,CAAC;EACpD,MAAM,SAAS,MAAM,MAAM,OAAO,EAAE,OAAO,IAAI,MAAM,CAAC;EACtD,MAAM,MAAM,gBAAgB;GAAE;GAAK;GAAO;EAAO,GAAG,KAAK;EAEzD,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,IAAI,IAAI,eAAe;GACrB,MAAM,OAAO,MAAM,MAAM,MAAM,EAAE,WAAW,IAAI,aAAa;GAC7D,IAAI,MAAM,SAAS,QAAQ;IACzB,WAAW,KAAK;IAChB,IAAI,oBAAoB,IAAI,GAAG,YAAY,QAAQ,KAAK,IAAI,CAAC,CAAC,MAAM,GAAG,EAAE;GAC3E,OAAO,IAAI,MAAM,SAAS,SACxB,YAAY,KAAK;EAErB;EAEA,IAAI,CAAC,UAAU;GAEb,MAAM,WAAU,MADC,UAAU,OAAO,IAAI,KAAK,EAAA,CACxB,QAAQ,MAAM,EAAE,WAAW,OAAO,CAAC,CAAC,IAAI;GAC3D,IAAI,SAAS;IACX,WAAW,QAAQ;IACnB,IAAI,oBAAoB,OAAO,GAAG,YAAY,QAAQ,QAAQ,IAAI,CAAC,CAAC,MAAM,GAAG,EAAE;GACjF;EACF;EAIA,IAAI,CAAC,WAAW;GACd,MAAM,QAAQ,MAAM,MAAM,MAAM,EAAE,SAAS,WAAW,OAAO,EAAE,cAAc,QAAQ;GACrF,IAAI,OAAO,SAAS,SAAS,YAAY,MAAM;EACjD;EAEA,MAAM,MAAM,GAAG,IAAI,aAAa,GAAG,YAAY,GAAG,GAAG,aAAa,GAAG,GAAG,aAAa;EACrF,IAAI,UAAU,SAAS,IAAI,GAAG;EAC9B,IAAI,CAAC,SAAS;GACZ,UAAU;IACR,cAAc,IAAI;IAClB;IACA;IACA;IACA,UAAU;IACV,aAAa,CAAC;IACd,cAAc,IAAI;IAClB,cAAc,kBAAkB,KAAK,KAAK,IAAI;GAChD;GACA,SAAS,IAAI,KAAK,OAAO;EAC3B;EACA,QAAQ;EACR,IAAI,CAAC,QAAQ,YAAY,SAAS,IAAI,UAAU,GAAG,QAAQ,YAAY,KAAK,IAAI,UAAU;CAC5F;CAMA,OAAO;EAAE,UAJG,CAAC,GAAG,SAAS,OAAO,CAAC,CAAC,CAC/B,QAAQ,MAAM,EAAE,YAAY,OAAO,CAAC,CACpC,MAAM,GAAG,MAAM,EAAE,WAAW,EAAE,QAEZ;EAAG;EAAe,WAAW,KAAK;CAAO;AAChE;AAEA,SAAS,kBAAkB,OAAmC;CAE5D,OADgB,MAAM,MAAM,MAAM,EAAE,WAAW,OAClC,CAAC,EAAE;AAClB;;;;;;;;;;;;ACrFA,eAAsB,mBAAmB,OAAkD;CACzF,MAAM,OAAO,MAAM,MAAM,MAAM,EAAE,MAAM,QAAQ,CAAC,EAAA,CAAG,QAChD,MAAsB,EAAE,SAAS,OACpC;CACA,IAAI,IAAI,WAAW,GAAG,OAAO;EAAE,OAAO,CAAC;EAAG,YAAY,CAAC;EAAG,UAAU,CAAC;CAAE;CAEvE,MAAM,8BAAc,IAAI,IAAyB;CACjD,KAAK,MAAM,KAAK,KAAK;EACnB,MAAM,MAAM,YAAY,IAAI,EAAE,SAAS,KAAK,CAAC;EAC7C,IAAI,KAAK,CAAC;EACV,YAAY,IAAI,EAAE,WAAW,GAAG;CAClC;CAEA,MAAM,WAAW,CAAC,GAAG,IAAI,IAAI,IAAI,KAAK,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK;CAC9D,MAAM,QAAqB,CAAC;CAC5B,KAAK,MAAM,CAAC,KAAK,UAAU,aAAa;EACtC,MAAM,0BAAU,IAAI,IAAiC;EACrD,KAAK,MAAM,KAAK,OAAO;GACrB,MAAM,IAAI,QAAQ,IAAI,EAAE,OAAO,qBAAK,IAAI,IAAoB;GAC5D,EAAE,IAAI,EAAE,cAAc,EAAE,KAAK;GAC7B,QAAQ,IAAI,EAAE,SAAS,CAAC;EAC1B;EACA,MAAM,aAAa,CAAC,GAAG,QAAQ,KAAK,CAAC;EACrC,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KACrC,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;GAC9C,MAAM,SAAS,WAAW;GAC1B,MAAM,SAAS,WAAW;GAC1B,MAAM,IAAI,QAAQ,IAAI,MAAM;GAC5B,MAAM,IAAI,QAAQ,IAAI,MAAM;GAC5B,MAAM,SAAkC,CAAC;GACzC,KAAK,MAAM,CAAC,QAAQ,WAAW,GAAG;IAChC,MAAM,SAAS,EAAE,IAAI,MAAM;IAC3B,IAAI,WAAW,KAAA,GAAW,OAAO,KAAK,CAAC,QAAQ,MAAM,CAAC;GACxD;GACA,IAAI,OAAO,SAAS,GAAG;GACvB,MAAM,cAAc,OAAO,KACxB,CAAC,QAAQ,YACR,CACE;IAAE,WAAW;IAAQ,WAAW;IAAK,OAAO;IAAQ,WAAW;GAAG,GAClE;IAAE,WAAW;IAAQ,WAAW;IAAK,OAAO;IAAQ,WAAW;GAAG,CACpE,CACJ;GACA,MAAM,IAAI,sBACR,YAAY,EAAE,CAAE,KAAK,GAAG,OAAO,YAAY,KAAK,SAAS,KAAK,GAAI,CAAC,CACrE;GACA,MAAM,KAAK;IACT,QAAQ;IACR,QAAQ;IACR,WAAW;IACX,aAAa,OAAO;IACpB,SAAS,SACP,OAAO,KAAK,MAAM,EAAE,EAAE,GACtB,OAAO,KAAK,MAAM,EAAE,EAAE,CACxB;IACA,cAAc;GAChB,CAAC;EACH;CAEJ;CAEA,OAAO;EACL,OAAO,MAAM,MAAM,GAAG,MAAM,EAAE,cAAc,EAAE,WAAW;EACzD,YAAY,CAAC,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK;EACzC;CACF;AACF;;;;;;;;;;;ACtDA,eAAsB,sBACpB,OACA,OACA,UAA0B,CAAC,GACF;CACzB,MAAM,QAAQ,MAAM,UAAU,OAAO,KAAK;CAC1C,IAAI,MAAM,WAAW,GACnB,OAAO;EACL;EACA,YAAY;EACZ,uBAAuB;EACvB,QAAQ,CAAC;EACT,WAAW;EACX,eAAe;EACf,WAAW;CACb;CAGF,MAAM,SAAoC,CAAC;CAC3C,IAAI,cAAc;CAClB,IAAI,kBAAkB;CACtB,IAAI,wBAAwB;CAC5B,MAAM,cAAc,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;CACvE,MAAM,iCAAiB,IAAI,IAAY;CAGvC,KAAK,MAAM,KAAK,aAAa;EAC3B,OAAO,EAAE,cAAc;GACrB,OAAO;GACP,uBAAuB;GACvB,QAAQ;GACR,cAAc;GACd,YAAY;EACd;EACA,MAAM,OAAO,OAAO,EAAE;EACtB,KAAK,SAAS;EACd,IAAI,EAAE,WAAW,SAAS;GACxB,KAAK,UAAU;GACf,eAAe;EACjB;EACA,IAAI,OAAO,EAAE,cAAc,UAAU,KAAK,gBAAgB,EAAE;EAC5D,IAAI,oBAAoB,CAAC,GAAG;GAC1B,yBAAyB;GACzB,KAAK,yBAAyB;GAC9B,MAAM,MAAM,GAAG,EAAE,SAAS,GAAG,QAAQ,EAAE,IAAI;GAC3C,IAAI,eAAe,IAAI,GAAG,GAAG;IAC3B,KAAK,cAAc;IACnB,mBAAmB;GACrB;GACA,eAAe,IAAI,GAAG;EACxB;CACF;CAEA,KAAK,MAAM,QAAQ,OAAO,OAAO,MAAM,GACrC,KAAK,eAAe,KAAK,QAAQ,IAAI,KAAK,eAAe,KAAK,QAAQ;CAIxE,IAAI,qBAAqB;CACzB,IAAI,kBAAkB;CACtB,KAAK,MAAM,GAAG,QAAQ,QAAQ,cAAc,MAAM,EAAE,QAAQ,GAC1D,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;EACnC,IAAI,IAAI,EAAE,CAAE,WAAW,SAAS;EAChC,sBAAsB;EACtB,IAAI,IAAI,IAAI,IAAI,mBAAmB;CACrC;CAEF,MAAM,YAAY,qBAAqB,IAAI,kBAAkB,qBAAqB;CAElF,IAAI;CACJ,IAAI,QAAQ,iBAAiB;EAC3B,MAAM,UAAU,YAAY,QAAQ,MAAM,EAAE,UAAU,QAAQ,eAAgB;EAC9E,IAAI,QAAQ,SAAS,GACnB,oBACE,QAAQ,QAAQ,MAAM,QAAQ,gBAAiB,EAAE,OAAO,CAAC,CAAC,SAAS,QAAQ;CAEjF;CAEA,OAAO;EACL;EACA,YAAY,YAAY;EACxB;EACA;EACA,WAAW,cAAc,YAAY;EACrC,eAAe,wBAAwB,IAAI,kBAAkB,wBAAwB;EACrF;EACA;CACF;AACF;;;;;;;;;;;;;;AC/FA,eAAsB,cACpB,OACA,UAA4B,CAAC,GACH;CAC1B,MAAM,OAAO,QAAQ,QAAQ,CAAC,QAAQ,KAAK,KAAK,MAAM,MAAM,SAAS,EAAA,CAAG,KAAK,MAAM,EAAE,KAAK;CAE1F,MAAM,QAA4B,CAAC;CACnC,IAAI,aAAa;CACjB,IAAI,cAAc;CAClB,KAAK,MAAM,SAAS,MAAM;EACxB,MAAM,QAAQ,MAAM,UAAU,OAAO,KAAK;EAC1C,IAAI,MAAM,WAAW,GAAG;GACtB,MAAM,KAAK;IAAE;IAAO,aAAa;IAAG,YAAY;IAAG,WAAW;GAAE,CAAC;GACjE;EACF;EAQA,MAAM,YAAY,CAAC,GAAG,MAPH,SAAS,OAAO,KAAK,CAOd,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;EACpE,MAAM,aAAa,UAAU,KAAK,MAAM,EAAE,SAAS;EACnD,MAAM,aAAa,gBAAgB,SAAS;EAC5C,IAAI,SAAS;EACb,KAAK,MAAM,KAAK,OAAO;GACrB,IAAI,EAAE,WAAW,SAAS;IACxB;IACA;GACF;GAEA,MAAM,SAAS,WAAW,YAAY,EAAE,SAAS;GACjD,IAAI,QAAQ,aACN;QAAA,CAAC,QAAQ,YAAY,GAAG,EAAE,KAAK,UAAU,MAAM,MAAM,EAAE,CAAC,GAAG;GAAA,OAC1D;IAKL,MAAM,YAAY,UAAU,EAAE,MAAM;IACpC,IAAI,cAAc,IAAI;IAGtB,IAAI,EAFa,WAAW,WAAW,GAAA,CACjB,SAAS,UAAU,MAAM,GAAG,GAAG,CAC7C,GAAG;GACb;EACF;EACA,MAAM,YAAY,SAAS,MAAM;EACjC,MAAM,KAAK;GAAE;GAAO,aAAa;GAAQ,YAAY,MAAM;GAAQ;EAAU,CAAC;EAC9E,cAAc,MAAM;EACpB,eAAe;CACjB;CACA,OAAO;EAAE;EAAO,kBAAkB,aAAa,IAAI,cAAc,aAAa;CAAE;AAClF;;;;;;AAOA,SAAS,gBAAgB,OAA4B;CACnD,MAAM,SAAS,IAAI,MAAc,MAAM,SAAS,CAAC;CACjD,OAAO,MAAM,UAAU;CACvB,KAAK,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK;EAC1C,MAAM,MAAM,MAAM,EAAE,CAAE,SAAS,KAAK,MAClC,OAAO,EAAE,YAAY,WAAW,EAAE,UAAU,EAC9C,CAAC,CAAC,KAAK,IAAI;EACX,OAAO,KAAK,GAAG,IAAI,IAAI,OAAO,IAAI;CACpC;CACA,OAAO;AACT;;AAGA,SAAS,WAAW,QAAkB,QAAwB;CAC5D,IAAI,KAAK;CACT,IAAI,KAAK,OAAO;CAChB,OAAO,KAAK,IAAI;EACd,MAAM,MAAO,KAAK,OAAQ;EAC1B,IAAI,OAAO,QAAS,QAAQ,KAAK,MAAM;OAClC,KAAK;CACZ;CACA,OAAO;AACT;AAEA,SAAS,UAAU,GAAoB;CACrC,IAAI,MAAM,QAAQ,MAAM,KAAA,GAAW,OAAO;CAC1C,IAAI,OAAO,MAAM,UAAU,OAAO;CAClC,IAAI;EACF,OAAO,KAAK,UAAU,CAAC;CACzB,QAAQ;EACN,OAAO,OAAO,CAAC;CACjB;AACF"}

package/dist/{trace-questions-CLx8vt6t.d.ts → trace-questions-CM2CAocU.d.ts}

@@ -1,6 +1,6 @@
-import { c as CostLedgerHandle } from "./cost-ledger-CO7UyEcQ.js";
-import { O as TraceAnalysisStore } from "./types-DHb5TI36.js";
-import { a as TraceAnalystLimits, l as RawAnalystFinding, n as TraceAnalysisEngine } from "./engine-C37HS2kr.js";
+import { a as CostLedgerHandle } from "./cost-ledger-Jk62OBfF.js";
+import { X as TraceAnalysisStore } from "./types-C1tnkEgM.js";
+import { a as TraceAnalystLimits, l as RawAnalystFinding, n as TraceAnalysisEngine } from "./engine-3A_4jOlI.js";
 //#region src/analyst/trace-questions.d.ts
 /** One question to ask of the store. */
 interface TraceQuestionSpec {
@@ -65,4 +65,4 @@ declare function askTraceQuestions(opts: AskTraceQuestionsOptions): Promise<Trac
 declare function citedSpansOnly(store: TraceAnalysisStore, allowed: ReadonlyMap<string, ReadonlySet<string>>): TraceAnalysisStore;
 //#endregion
 export { askTraceQuestions as a, VerifiedTraceFinding as i, TraceQuestionOutcome as n, citedSpansOnly as o, TraceQuestionSpec as r, AskTraceQuestionsOptions as t };
-//# sourceMappingURL=trace-questions-CLx8vt6t.d.ts.map
+//# sourceMappingURL=trace-questions-CM2CAocU.d.ts.map

package/dist/{trace-questions-CLx8vt6t.d.ts.map → trace-questions-CM2CAocU.d.ts.map}

@@ -1 +1 @@
-{"version":3,"file":"trace-questions-CLx8vt6t.d.ts","names":[],"sources":["../src/analyst/trace-questions.ts"],"mappings":";;;;;UA6BiB;;WAEN;WACA;;WAEA;;UAGM;WACN,oBAAoB;WACpB,OAAO;WACP,QAAQ;;WAER,YAAY;;WAEZ;;WAEA;;WAEA;;WAEA;;WAEA;WACA,SAAS,QAAQ;WACjB,SAAS;WACT,OAAO,iBAAiB,SAAS;;;UAI3B;WACN,SAAS;;WAET;;WAEA;;WAEA;;UAGM;WACN;WACA;WACA;WACA;;WAEA;WACA,mBAAmB;;WAEnB;WACA;;;;;;;iBAyBW,kBACpB,MAAM,2BACL,QAAQ;;;;;iBA2JK,eACd,OAAO,oBACP,SAAS,oBAAoB,uBAC5B"}
+{"version":3,"file":"trace-questions-CM2CAocU.d.ts","names":[],"sources":["../src/analyst/trace-questions.ts"],"mappings":";;;;;UA6BiB;;WAEN;WACA;;WAEA;;UAGM;WACN,oBAAoB;WACpB,OAAO;WACP,QAAQ;;WAER,YAAY;;WAEZ;;WAEA;;WAEA;;WAEA;;WAEA;WACA,SAAS,QAAQ;WACjB,SAAS;WACT,OAAO,iBAAiB,SAAS;;;UAI3B;WACN,SAAS;;WAET;;WAEA;;WAEA;;UAGM;WACN;WACA;WACA;WACA;;WAEA;WACA,mBAAmB;;WAEnB;WACA;;;;;;;iBAyBW,kBACpB,MAAM,2BACL,QAAQ;;;;;iBA2JK,eACd,OAAO,oBACP,SAAS,oBAAoB,uBAC5B"}

package/dist/trace-repair/index.d.ts

@@ -1,8 +1,8 @@
+import { a as CostLedgerHandle, l as CostProvenance, p as CustomTokenPricing } from "../cost-ledger-Jk62OBfF.js";
 import { r as CaptureIntegrityError } from "../errors-DEE6u6ot.js";
-import { b as CustomTokenPricing, c as CostLedgerHandle, p as CostProvenance } from "../cost-ledger-CO7UyEcQ.js";
-import { d as RunTokenUsage } from "../run-record-D1Hw-Jml.js";
+import { d as RunTokenUsage } from "../run-record-C1E24G2A.js";
 import { t as DefaultVerdict } from "../verdict-E4eRNf7-.js";
-import { a as TraceAnalystLimits, n as TraceAnalysisEngine } from "../engine-C37HS2kr.js";
+import { a as TraceAnalystLimits, n as TraceAnalysisEngine } from "../engine-3A_4jOlI.js";
 import { t as PrimeBridgeTransport } from "../prime-bridge-transport-6feEglLf.js";
 import { a as RecordedTrajectoryStep, h as isRecordedTimeout } from "../steps-Bg5-KVx1.js";
 //#region src/trace-repair/mini-swe-scaffold.d.ts

package/dist/trace-repair/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","names":["RepairArm"],"sources":["../../src/trace-repair/mini-swe-scaffold.ts","../../src/trace-repair/action-budget.ts","../../src/trace-repair/continuation-records.ts","../../src/trace-repair/control-policy.ts","../../src/trace-repair/admission-records.ts","../../src/trace-repair/continuation-policy.ts","../../src/trace-repair/oracle-determinism.ts","../../src/trace-repair/admission.ts","../../src/trace-repair/admission-contract.ts","../../src/trace-repair/admission-report.ts","../../src/trace-repair/analyst-response.ts","../../src/trace-repair/blinding.ts","../../src/trace-repair/analyst-arm.ts","../../src/trace-repair/arm-completion.ts","../../src/trace-repair/arm-dspy.ts","../../src/trace-repair/degenerate-strategies.ts","../../src/trace-repair/ports.ts","../../src/trace-repair/funnel.ts","../../src/trace-repair/grade.ts","../../src/trace-repair/delta-repair.ts","../../src/trace-repair/docker-environment.ts","../../src/trace-repair/repair-prompt.ts","../../src/trace-repair/test-oracle.ts"],"mappings":";;;;;;;;;qBAyBa;;qBAGA;qBAKA;UAiBI;;EAEf;;;;;EAKA;;;wBAIc,sBAAsB,OAAO;KAiFjC;EACN;EAAgB;;EAChB;EAAsB;;;;;;;wBASZ,YAAY,2BAA2B;UAMtC;EACf;EACA;;EAEA;;;;;;;wBAQc,kBAAkB,QAAQ;;wBAsB1B,yBAAyB,iBAAiB;;wBAS1C,6BAA6B;;;;;;wBAyB7B,aAAa,QAAQ;;;;;;;;;;;;;;;;;;;;;;;;;;KCxMzB;UAEK;;WAEN;;WAEA;;WAEA;;;qBAIE,8BAA8B;;;;;;;;;;wBA4C3B,gBAAgB;EAAmB;EAAsB;;;;wBA8QzD,sBAAsB,iBAAiB;;;KAM3C;UAQK;EACf;EACA;EACA;;EAEA,SAAS;;EAET,UAAU;;KAGA;WACG;WAA2B,aAAa;;WAExC;WACA,WAAW;WACX;WACA,aAAa;;;;;;;;;;;;;;;wBAqBZ,wBACd,gBACA,cAAc,mBACd,SAAQ,qBACP;;;;;;wBA8Da,6BAA6B;;;;KCtcjC;;UAGK;EACf;EACA;;;KAIU;UAOK;EACf;EACA;;EAEA;EACA;EACA;;UAGe;;EAEf;EACA;EACA;;EAEA,OAAO;;EAEP;EACA;EACA;;UAGe;;EAEf;EACA;;EAEA;;;;;;EAMA;;EAEA,WAAW;EACX,OAAO;;EAEP;;UAGe;;;;;EAKf;;EAEA;;EAEA;EACA;EACA;EACA;EACA;EACA;;UAGe;;EAEf;EACA;;UAGe;EACf;EACA,KAAK;;EAEL;;EAEA;;EAEA;;EAEA;EACA;EACA;EACA,aAAa;EACb,OAAO;EACP,YAAY;;EAEZ;EACA,OAAO;EACP,gBAAgB;EAChB;EACA;EACA;;EAEA;;;UAIe;EACf;EACA;;;UAIe;EACf;EACA;EACA,OAAO;EACP;;;;;;;;;wBAUc,gBAAgB,mBAAmB,wBAAwB;;wBA+B3D,qBAAqB,SAAS,sBAAsB;;;;;;;;;wBAiBpD,cAAc,SAAS;;;;qBCvK1B,iCAAiC;;;;;;;;;;;KAYlC;qBAEC,kCAAkC;UAE9B;;WAEN;;WAEA;;WAEA;;WAEA;;WAEA;;;;;;;;;;UAWM;WACN;WACA;;WAEA;;UAGM,sBAAsB,oBAAoB;;;WAGhD;;;;;;WAMA;;;;;;;wBAQK,iBAAiB;wBAIjB,oBAAoB,OAAO,qBAAqB;;;;;;;;;wBAiDhD,wBACd,QAAQ,mBACR,WAAW;;;;qBC9HA,kCAAkC;;qBAGlC,mCAAmC;;;;;;;;UAW/B;;EAEf;;EAEA;;EAEA;;;;;EAKA;;;;;;EAMA;;;;;;;;;wBAkBc,yBAAyB,eAAe;;;;;;;;;;;;KAyB5C;qBAEC,2BAA2B;;wBAOxB,UAAU,iCAAiC;;;;;;;;KAe/C;qBAiBC,oCAAoC;;qBA6BpC,6BAA6B,SAAS,OAAO;KAsB9C;;UAGK;;EAEf;EACA;;KAGU;EACN;EAAkB,SAAS;;EAE3B;EACA;EACA;EACA;;EAEA;EAAsB;EAAiB;EAAkB;;EACzD;EAA0B;EAAiB;;EAE3C;EACA,KAAK;EACL;EACA;EACA,YAAY;;;UAID;EACf,KAAK;EACL;EACA;EACA;EACA,YAAY;EACZ;;EAEA;;UAGe;EACf;EACA;EACA;EACA;EACA;;EAEA,SAAS;;;;;EAKT;EACA,kBAAkB;;;EAGlB;EACA;;EAEA,YAAY;;EAEZ;;EAEA,QAAQ;EACR,UAAU;;UAKK;EACf,QAAQ;EACR;EACA;EACA;;UAGe;;EAEf,eAAe;EACf;EACA,QAAQ;EACR;;UAGe;EACf;EACA,SAAS;EACT,WAAW;EACX,cAAc,OAAO;;EAErB;;EAEA,sBAAsB;;;;;;;;;wBAUR,sBACd,mBAAmB,uBACnB,sBAAsB,qBACrB;;wBAsDa,sBAAsB,UAAU;;;;qBC7SnC,yCAAyC;;qBAGzC,kCAAkC;UAE9B;;WAEN;;WAEA;;WAEA;;WAEA;WACA;WACA;;WAEA;;WAEA;;WAEA;WACA;;UAqBM,sCACP,QAAQ,KAAK;;EAErB;;EAEA;;wBAGc,+BACd,OAAO,gCACN;;;;;;wBA+Ba,yBAAyB,QAAQ;;;;;wBAejC,iBAAiB,oBAAoB,eAAe;UAYnD;EACf;EACA,UAAU;EACV;EACA;EACA;;UAGe;EACf;;EAEA;;EAEA,OAAO;;EAEP;EACA;;KAGU,qBACV,SAAS,6BACN,QAAQ;UAEI;EACf;EACA;;EAEA;;EAEA;;UAGe;;EAEf;EACA,YAAY,QAAQ;EACpB,KAAK,iBAAiB;IAAW;MAA2B,QAAQ;EACpE,WAAW;;UAGI;EACf;EACA,KAAK;EACL;;UAGe;EACf;;;;;;EAMA,OAAO,SAAS,iCAAiC,QAAQ;;UAG1C;EACf,QAAQ;EACR,KAAK;;EAEL;;;;;;EAMA,iBAAiB;;EAEjB;;;;;;;EAOA;EACA,OAAO;EACP,cAAc;;EAEd;;;;;;;;;wBAUoB,gBACpB,SAAS,yBACR,QAAQ;;;;;;wBAuOK,WAAW,gBAAgB,2BAA2B;;;;;wBA8CtD,UAAU,gBAAgB,2BAA2B;;;;;;wBAerD,kBAAkB,mBAAmB;;;;qBClfxC,oCAAoC;;;KAIrC;;KAGA;;qBAGC;UAEI;;WAEN;WACA;;UAGM;;WAEN;;;;;;WAMA;WACA;WACA;;;WAGA,qBAAqB;;UAGf;WACN,OAAO;WACP,MAAM;;;;;WAKN,qBAAqB;;UAGf;WACN;;;;WAIA;;;;;;;WAOA;WACA,iBAAiB;WACjB;;;UAIM;;WAEN;WACA;WACA;WACA;;UAGM;WACN,OAAO;WACP;;WAEA;WACA;;WAEA;;WAEA;WACA,kBAAkB;;;WAGlB;;WAEA;;WAEA;;UAGM;WACN;WACA;WACA;;WAEA;WACA;;WAEA;WACA,kBAAkB;WAClB;;WAEA;;;;;;;;;wBAaK,kBAAkB,UAAU,4BAA4B;;;;;;;;KA+H5D,qBAAqB,oBAAoB;;;;;;;;;UAUpC;WACN;WACA,uBAAuB;;wBAGlB,wBAAwB,oBAAoB;wBAc5C,mBACd,mBAAmB,6BAClB;;wBAca,0BAA0B,SAAS;;;;;;;KC3PvC,iBAAiB;EACvB;EAAiB,OAAO;;EACxB;EAAkB;;UAEP;;EAEf;EACA;EACA;;UAGe;;EAEf;;EAEA,4BAA4B;;UAGb;;EAEf;;EAEA,OAAO,KAAK,eAAe,QAAQ,iBAAiB;;UAGrC;EACf;;EAEA;;UAGe;EACf;;EAEA,MAAM,KAAK,eAAe,QAAQ,iBAAiB;;UAGpC;EACf,KAAK;EACL,KAAK;;EAEL;;EAEA,WAAW;;UAGI;;EAEf,OAAO;;EAEP,SAAS;;UAGM;EACf;;;;;EAKA,IAAI,SAAS,0BAA0B,QAAQ,iBAAiB;;UAKjD;;EAEf;;EAEA;;;;;;EAMA,uBAAuB;;EAEvB;;;;;EAKA,mBAAmB;;EAEnB;;UAGe;WACN;WACA;WACA,sBAAsB;WACtB;WACA,kBAAkB;WAClB;;qBAGE,2BAA2B;wBASxB,uBAAuB,QAAO,uBAA4B;;;;;;;wBA6C1D,kBACd,oBACA,eACA,sBACA;UAiBe;EACf;EACA;EACA;EACA;EACA;EACA;EACA;;;EAGA;EACA,kBAAkB;;;EAGlB,gBAAgB,SAAS;;UAGV;EACf,QAAQ;EACR,YAAY;;EAEZ,eAAe;;EAEf,QAAQ,SAAS,OAAO;EACxB,OAAO;;EAEP,aAAa;;EAEb;EACA;;UAGe;EACf,eAAe;;EAEf,QAAQ;EACR,UAAU;EACV,QAAQ;EACR,UAAU;;;;;;;EAOV,aAAa;EACb,SAAS;;EAET;;;;;;;;;wBAUoB,aAAa,SAAS,sBAAsB,QAAQ;;wBAoV1D,eACd,QAAQ,iBACR,SAAS;wBAKK,cAAc,QAAQ;UAIrB;EACf,QAAQ;;EAER,iBAAiB;;EAEjB;;EAEA;;;;;;;;;;;wBAYc,wBAAwB,OAAO;;;;UC9mB9B;;;;WAIN;;WAEA;;WAEA,kBAAkB;;qBAGhB,8BAA8B;UAM1B;;WAEN;;WAEA;;UAGM;WACN;;WAEA;;;WAGA;;UAGM;WACN;;;WAGA;;WAEA;;WAEA;;WAEA;WACA,gBAAgB;;;;;;WAMhB,mBAAmB;;WAEnB,eAAe;WACf,gBAAgB;;WAEhB;;WAEA;WACA,cAAc;WACd,aAAa;;;KAIZ;cAWE;;;;;;;;;;UAWG;YACL;WACD;WACA;WACA;WACA;WACA;WACA,gBAAgB;WAChB,UAAU;WACV;WACA;;;WAGA,eAAe;WACf,kBAAkB;;;WAGlB;;;WAGA;WACA;;;;UAKM;WACN,eAAe;WACf,kBAAkB;WAClB;WACA;WACA;WACA;;KAGC;WAEG;WACA,WAAW;WACX,KAAK;;WAGL;WACA;WACA,WAAW;WACX,WAAW;WACX;;;;;;;;;;;;;;wBAeC,SACd,UAAU,mBACV,WAAU,oBACT;;;UC7Kc;EACf;EACA;EACA;;EAEA;EACA,QAAQ;EACR,YAAY;EACZ,OAAO;;EAEP,UAAU,OAAO;EACjB;IAAe;IAAc;;;EAE7B,eAAe;;;wBAID,kBAAkB,QAAQ,kBAAkB;UAoB3C;;EAEf;;;wBAIc,sBACd,UAAU,mBACV,UAAS;;;;qBChDE;UAEI;;WAEN,MAAM;;WAEN;;UAGM;WACN;;;WAGA;;;WAGA;WACA,cAAc;;UAGR;WACN;;KAGC,kBAAkB,gBAAgB;;KAGlC;KAQA;WACG;WAA0B,OAAO;;WACjC;WAA2B,SAAS;WAA+B;;;;;;;;;wBASlE,qBAAqB,gBAAgB;;wBAoFrC,cAAc;EAC5B;EACA;EACA,cAAc;IACZ;;;UCpIa;WACN;WACA;WACA;;UAGM;WACN;;WAEA;WACA,gBAAgB;;;WAGhB;;WAEA;;UAGM;;;WAGN;;wBAGK,gBACd,KAAK,aACL,UAAS,yBACR;;;;;qBAyBU;;;;;;;;;;;KCtBD;;;;;;;;;;;;;;;;;;KAmBA;WACG;WAAuB;;WAEvB;;WAEA;;WAEA;;WAEA;;UAGE;WACN;;;WAGA;WACA,eAAe;;WAEf,QAAQ;;WAER;WACA,sBAAsB;;;;;WAKtB;;;;;UAMM;WACN,QAAQ;WACR,SAAS;;;;UAKH;WACN;WACA;WACA;WACA;;UAGM;WACN;;WAEA;;;UAIM;WACN;WACA;;;;;;;;;;KAWC;WAEG;WACA;WACA;WACA,cAAc;WACd;WACA;WACA,uBAAuB;WACvB,QAAQ;WACR,OAAO;;WAGP;WACA;WACA;WACA,uBAAuB;WACvB,QAAQ;WACR,OAAO;;WAGP;WACA;WACA;WACA,uBAAuB;WACvB,QAAQ;WACR,OAAO;;UAGL;WACN,aAAa;EACtB,IAAI,SAAS,mBAAmB,QAAQ;;;;;;;;;;KAW9B;WACG;WAA2B,aAAa;;WAExC;WACA,WAAW;WACX;WACA,aAAa;;UAGX;WACN;WACA;;WAEA;WACA,OAAO;;WAEP,QAAQ;WACR;;UAGM;WACN,KAAK;WACL,KAAK;;WAEL;WACA,SAAS;;WAET;;;;;;;;wBASW,aAAa,SAAS,sBAAsB,QAAQ;;;;;;;;wBAuC1D,kBAAkB,QAAQ,kBAAkB;;UAc3C;WACN;;WAEA,2BAA2B;;WAE3B,6BAA6B;WAC7B,eAAe;;;;WAIf;;UAGM;WACN;;;WAGA,4BAA4B;WAC5B,sBAAsB;;;WAGtB;WACA,QAAQ;WACR;;;WAGA;;;;;;;;;;;;;;;wBAgBK,qBACd,eAAe,aACf;WAAoB,SAAS;IAC5B;;;UCpQc;WACN;;WAEA;;WAEA;WACA;;WAEA,WAAW;;WAEX;;WAEA,SAAS;WACT,SAAS;;WAET,sBAAsB;WACtB,eAAe;;wBAGV,0BAA0B,SAAS,6BAA6B;;;;;;;;;;qBChBnE;;qBAGA;;;;;;;;;wBAaG,uBACd,SAAQ;UAqBO;;WAEN,QAAQ;WACR,QAAQ;WACR,YAAY;WACZ;WACA;WACA,WAAW;WACX,SAAS;WACT;WACA,OAAO,iBAAiB,SAAS;;wBAG5B,oBAAoB,SAAS,uBAAuB;UAuJnD;;;;;WAKN;;;wBA6JK,uBAAuB,QAAQ;;;;;;;;;;;;;;;;;KCrZnC;UAEK;WACN;;WAEA;;WAEA;WACA,YAAY;;WAEZ;;qBAGE;WAEL;WAEF;WAEA;WACU;WACA;;WAGR;WAEF;WAEA;WACU;WACA;;WAGR;WAEF;WAEA;WACU;WACA;;WAGR;WAEF;WAEA;WACU;WACA;;WAGR;WAEF;WAEA;WACU;WACA;;WAGR;WAEF;WAEA;WACU;WACA;;WAGR;WAEF;WAEA;WACU;WACA;;WAGR;WAEF;WAEA;WACU;WACA;;KAIJ,+BAA+B;;;;;;;;KCjF/BA;UAQK;EACf;EACA;EACA;;EAEA;;UAGe;;WAEN;EACT,KAAK,iBAAiB,oBAAoB,QAAQ;EAClD,SAAS;;UAGM;EACf;;;EAGA;EACA,KAAKA;;EAEL;;UAGe;;EAEf,KAAK,SAAS,uBAAuB,QAAQ;;UAG9B;EACf;EACA,KAAKA;EACL;;UAGe;;EAEf;EACA;EACA;;EAEA;EACA;;;;;;;;;;UAWe;EACf,MAAM,SAAS,eAAe,SAAS,oBAAoB,QAAQ;;UAGpD;EACf;EACA,KAAKA;EACL;;EAEA,SAAS;;EAET,gBAAgB;;;EAGhB;;;;;;;EAOA,UAAU;EACV;;UAGe;EACf;EACA;EACA;EACA;;UAGe;;EAEf;;;EAGA;;EAEA;;EAEA;EACA;;;KAIU,4BACV,SAAS,8BACN,QAAQ;;;;KCtGD;WACG;WAA0B,QAAQ;WAA+B;;WAEjE;WACA,QAAQ;WACR;WACA,aAAa;;WAGb;WACA;WACA;;UAGE;;WAEN;;WAEA;WACA;;;;;;;;;KAUC;;;WAIG;WACA;;WAGA;WACA;WACA;WACA;WACA;WACA;WACA,QAAQ;;UAGN;WACN;WACA;WACA;WACA;WACA;WACA,QAAQ;;UAGF;WACN;WACA;WACA;;WAEA;;;;;;;;;;KAWC;WAEG;WACA;WACA;WACA,cAAc;WACd,OAAO;;WAGP;WACA;WACA;WACA;;UAGE;;WAEN;;WAEA;;WAEA;;;WAGA;WACA,0BAA0B;;;;;;;;KASzB;WACG;WAA8B,WAAW;;WACzC;;WAEA;WACA;WACA,cAAc;;WAGd;WACA;WACA,cAAc;WACd,WAAW;;WAGX;WACA;WACA,cAAc;WACd,WAAW;WACX,WAAW;WACX,QAAQ;;;;;;;;;;UAWN;WACN;WACA;;WAEA;;qBAaE;;wBASG,aAAa,OAAO,cAAc;UAoBjC;WACN;WACA;WACA;WACA;WACA;WACA;WACA;;WAEA;;WAEA;;wBAGK,YAAY,iBAAiB,gBAAgB;;;UCnK5C;WACN,KAAK;WACL,UAAU;WACV,UAAU;WACV,QAAQ;WACR,cAAc;;;WAGd;WACA,SAAS;;WAET;;;;;;;;WAQA;WACA,cAAc;;;;;;;;;;UAWR,wBAAwB;WAC9B;WACA,OAAO;WACP,QAAQ;;;WAGR;WACA;WACA;;;WAGA,kBAAkB;WAClB;WACA;;WAEA;WACA;;wBAMW,eAAe,SAAS,qBAAqB,QAAQ;;;UCvF1D;;WAEN;WACA;WACA;;UAGM;WACN;WACA;WACA;WACA;WACA;WACA;WACA;;;WAGA;;KAGC;UAUK;WACN,IAAI;WACJ;;WAEA;;UAGM;WACN;WACA,QAAQ;;WAER;WACA;WACA,aAAa;;;;WAIb,cAAc;WACd;WACA,qBAAqB;WACrB,kBAAkB;;wBAGb,YACd,qBAAqB,mBACrB,UAAS,qBACR;;;wBAwKa,wBAAwB,QAAQ;;;UCtO/B;EACf;;EAEA;;UAGe;;EAEf;EACA;;EAEA;;;KAIU,iBAAiB,SAAS,mBAAmB,QAAQ;;;;;;qBAOpD,mBAAmB;UAuDf;;EAEf;;EAEA;;EAEA,MAAM;;EAEN;;EAEA;EACA,YAAY;;EAEZ;;;;;;;;wBAqBc,cAAc;EAC5B;EACA;EACA;EACA;EACA;;wBAmBc,oCACd,SAAS,uCACR;;;qBCxIU;;;;;wBAOG,iBACd,SAAQ;;qBAkBG;;;qBAgBA;;wBASG,uBAAuB,QAAQ;wBAc/B,uBAAuB,QAAQ;;;wBAM/B,qBACd,QAAQ,yBACR,SAAQ;;;;;;;;;wBAkBM,qBACd,SAAQ;;;;;;;;;wBAsBM,sBACd,QAAQ,oBACR;;;;qBC5GW,+BAA+B;;qBAG/B,wBAAwB;UAEpB;;WAEN;WACA;;WAEA;;UAGM;;WAEN,gBAAgB;;WAEhB;;;WAGA;WACA;WACA;;;;;;wBAUK,gBAAgB,gBAAgB;wBAWhC,mBAAmB,SAAS,4BAA4B"}
+{"version":3,"file":"index.d.ts","names":["RepairArm"],"sources":["../../src/trace-repair/mini-swe-scaffold.ts","../../src/trace-repair/action-budget.ts","../../src/trace-repair/continuation-records.ts","../../src/trace-repair/control-policy.ts","../../src/trace-repair/admission-records.ts","../../src/trace-repair/continuation-policy.ts","../../src/trace-repair/oracle-determinism.ts","../../src/trace-repair/admission.ts","../../src/trace-repair/admission-contract.ts","../../src/trace-repair/admission-report.ts","../../src/trace-repair/analyst-response.ts","../../src/trace-repair/blinding.ts","../../src/trace-repair/analyst-arm.ts","../../src/trace-repair/arm-completion.ts","../../src/trace-repair/arm-dspy.ts","../../src/trace-repair/degenerate-strategies.ts","../../src/trace-repair/ports.ts","../../src/trace-repair/funnel.ts","../../src/trace-repair/grade.ts","../../src/trace-repair/delta-repair.ts","../../src/trace-repair/docker-environment.ts","../../src/trace-repair/repair-prompt.ts","../../src/trace-repair/test-oracle.ts"],"mappings":";;;;;;;;;qBAyBa;;qBAGA;qBAKA;UAiBI;;EAEf;;;;;EAKA;;;wBAIc,sBAAsB,OAAO;KAiFjC;EACN;EAAgB;;EAChB;EAAsB;;;;;;;wBASZ,YAAY,2BAA2B;UAMtC;EACf;EACA;;EAEA;;;;;;;wBAQc,kBAAkB,QAAQ;;wBAsB1B,yBAAyB,iBAAiB;;wBAS1C,6BAA6B;;;;;;wBAyB7B,aAAa,QAAQ;;;;;;;;;;;;;;;;;;;;;;;;;;KCxMzB;UAEK;;WAEN;;WAEA;;WAEA;;;qBAIE,8BAA8B;;;;;;;;;;wBA4C3B,gBAAgB;EAAmB;EAAsB;;;;wBA8QzD,sBAAsB,iBAAiB;;;KAM3C;UAQK;EACf;EACA;EACA;;EAEA,SAAS;;EAET,UAAU;;KAGA;WACG;WAA2B,aAAa;;WAExC;WACA,WAAW;WACX;WACA,aAAa;;;;;;;;;;;;;;;wBAqBZ,wBACd,gBACA,cAAc,mBACd,SAAQ,qBACP;;;;;;wBA8Da,6BAA6B;;;;KCtcjC;;UAGK;EACf;EACA;;;KAIU;UAOK;EACf;EACA;;EAEA;EACA;EACA;;UAGe;;EAEf;EACA;EACA;;EAEA,OAAO;;EAEP;EACA;EACA;;UAGe;;EAEf;EACA;;EAEA;;;;;;EAMA;;EAEA,WAAW;EACX,OAAO;;EAEP;;UAGe;;;;;EAKf;;EAEA;;EAEA;EACA;EACA;EACA;EACA;EACA;;UAGe;;EAEf;EACA;;UAGe;EACf;EACA,KAAK;;EAEL;;EAEA;;EAEA;;EAEA;EACA;EACA;EACA,aAAa;EACb,OAAO;EACP,YAAY;;EAEZ;EACA,OAAO;EACP,gBAAgB;EAChB;EACA;EACA;;EAEA;;;UAIe;EACf;EACA;;;UAIe;EACf;EACA;EACA,OAAO;EACP;;;;;;;;;wBAUc,gBAAgB,mBAAmB,wBAAwB;;wBA+B3D,qBAAqB,SAAS,sBAAsB;;;;;;;;;wBAiBpD,cAAc,SAAS;;;;qBCvK1B,iCAAiC;;;;;;;;;;;KAYlC;qBAEC,kCAAkC;UAE9B;;WAEN;;WAEA;;WAEA;;WAEA;;WAEA;;;;;;;;;;UAWM;WACN;WACA;;WAEA;;UAGM,sBAAsB,oBAAoB;;;WAGhD;;;;;;WAMA;;;;;;;wBAQK,iBAAiB;wBAIjB,oBAAoB,OAAO,qBAAqB;;;;;;;;;wBAiDhD,wBACd,QAAQ,mBACR,WAAW;;;;qBC9HA,kCAAkC;;qBAGlC,mCAAmC;;;;;;;;UAW/B;;EAEf;;EAEA;;EAEA;;;;;EAKA;;;;;;EAMA;;;;;;;;;wBAkBc,yBAAyB,eAAe;;;;;;;;;;;;KAyB5C;qBAEC,2BAA2B;;wBAOxB,UAAU,iCAAiC;;;;;;;;KAe/C;qBAiBC,oCAAoC;;qBA6BpC,6BAA6B,SAAS,OAAO;KAsB9C;;UAGK;;EAEf;EACA;;KAGU;EACN;EAAkB,SAAS;;EAE3B;EACA;EACA;EACA;;EAEA;EAAsB;EAAiB;EAAkB;;EACzD;EAA0B;EAAiB;;EAE3C;EACA,KAAK;EACL;EACA;EACA,YAAY;;;UAID;EACf,KAAK;EACL;EACA;EACA;EACA,YAAY;EACZ;;EAEA;;UAGe;EACf;EACA;EACA;EACA;EACA;;EAEA,SAAS;;;;;EAKT;EACA,kBAAkB;;;EAGlB;EACA;;EAEA,YAAY;;EAEZ;;EAEA,QAAQ;EACR,UAAU;;UAKK;EACf,QAAQ;EACR;EACA;EACA;;UAGe;;EAEf,eAAe;EACf;EACA,QAAQ;EACR;;UAGe;EACf;EACA,SAAS;EACT,WAAW;EACX,cAAc,OAAO;;EAErB;;EAEA,sBAAsB;;;;;;;;;wBAUR,sBACd,mBAAmB,uBACnB,sBAAsB,qBACrB;;wBAsDa,sBAAsB,UAAU;;;;qBC7SnC,yCAAyC;;qBAGzC,kCAAkC;UAE9B;;WAEN;;WAEA;;WAEA;;WAEA;WACA;WACA;;WAEA;;WAEA;;WAEA;WACA;;UAqBM,sCACP,QAAQ,KAAK;;EAErB;;EAEA;;wBAGc,+BACd,OAAO,gCACN;;;;;;wBA+Ba,yBAAyB,QAAQ;;;;;wBAejC,iBAAiB,oBAAoB,eAAe;UAYnD;EACf;EACA,UAAU;EACV;EACA;EACA;;UAGe;EACf;;EAEA;;EAEA,OAAO;;EAEP;EACA;;KAGU,qBACV,SAAS,6BACN,QAAQ;UAEI;EACf;EACA;;EAEA;;EAEA;;UAGe;;EAEf;EACA,YAAY,QAAQ;EACpB,KAAK,iBAAiB;IAAW;MAA2B,QAAQ;EACpE,WAAW;;UAGI;EACf;EACA,KAAK;EACL;;UAGe;EACf;;;;;;EAMA,OAAO,SAAS,iCAAiC,QAAQ;;UAG1C;EACf,QAAQ;EACR,KAAK;;EAEL;;;;;;EAMA,iBAAiB;;EAEjB;;;;;;;EAOA;EACA,OAAO;EACP,cAAc;;EAEd;;;;;;;;;wBAUoB,gBACpB,SAAS,yBACR,QAAQ;;;;;;wBAmOK,WAAW,gBAAgB,2BAA2B;;;;;wBA8CtD,UAAU,gBAAgB,2BAA2B;;;;;;wBAerD,kBAAkB,mBAAmB;;;;qBC9exC,oCAAoC;;;KAIrC;;KAGA;;qBAGC;UAEI;;WAEN;WACA;;UAGM;;WAEN;;;;;;WAMA;WACA;WACA;;;WAGA,qBAAqB;;UAGf;WACN,OAAO;WACP,MAAM;;;;;WAKN,qBAAqB;;UAGf;WACN;;;;WAIA;;;;;;;WAOA;WACA,iBAAiB;WACjB;;;UAIM;;WAEN;WACA;WACA;WACA;;UAGM;WACN,OAAO;WACP;;WAEA;WACA;;WAEA;;WAEA;WACA,kBAAkB;;;WAGlB;;WAEA;;WAEA;;UAGM;WACN;WACA;WACA;;WAEA;WACA;;WAEA;WACA,kBAAkB;WAClB;;WAEA;;;;;;;;;wBAaK,kBAAkB,UAAU,4BAA4B;;;;;;;;KA+H5D,qBAAqB,oBAAoB;;;;;;;;;UAUpC;WACN;WACA,uBAAuB;;wBAGlB,wBAAwB,oBAAoB;wBAc5C,mBACd,mBAAmB,6BAClB;;wBAca,0BAA0B,SAAS;;;;;;;KC3PvC,iBAAiB;EACvB;EAAiB,OAAO;;EACxB;EAAkB;;UAEP;;EAEf;EACA;EACA;;UAGe;;EAEf;;EAEA,4BAA4B;;UAGb;;EAEf;;EAEA,OAAO,KAAK,eAAe,QAAQ,iBAAiB;;UAGrC;EACf;;EAEA;;UAGe;EACf;;EAEA,MAAM,KAAK,eAAe,QAAQ,iBAAiB;;UAGpC;EACf,KAAK;EACL,KAAK;;EAEL;;EAEA,WAAW;;UAGI;;EAEf,OAAO;;EAEP,SAAS;;UAGM;EACf;;;;;EAKA,IAAI,SAAS,0BAA0B,QAAQ,iBAAiB;;UAKjD;;EAEf;;EAEA;;;;;;EAMA,uBAAuB;;EAEvB;;;;;EAKA,mBAAmB;;EAEnB;;UAGe;WACN;WACA;WACA,sBAAsB;WACtB;WACA,kBAAkB;WAClB;;qBAGE,2BAA2B;wBASxB,uBAAuB,QAAO,uBAA4B;;;;;;;wBA6C1D,kBACd,oBACA,eACA,sBACA;UAiBe;EACf;EACA;EACA;EACA;EACA;EACA;EACA;;;EAGA;EACA,kBAAkB;;;EAGlB,gBAAgB,SAAS;;UAGV;EACf,QAAQ;EACR,YAAY;;EAEZ,eAAe;;EAEf,QAAQ,SAAS,OAAO;EACxB,OAAO;;EAEP,aAAa;;EAEb;EACA;;UAGe;EACf,eAAe;;EAEf,QAAQ;EACR,UAAU;EACV,QAAQ;EACR,UAAU;;;;;;;EAOV,aAAa;EACb,SAAS;;EAET;;;;;;;;;wBAUoB,aAAa,SAAS,sBAAsB,QAAQ;;wBAoV1D,eACd,QAAQ,iBACR,SAAS;wBAKK,cAAc,QAAQ;UAIrB;EACf,QAAQ;;EAER,iBAAiB;;EAEjB;;EAEA;;;;;;;;;;;wBAYc,wBAAwB,OAAO;;;;UC9mB9B;;;;WAIN;;WAEA;;WAEA,kBAAkB;;qBAGhB,8BAA8B;UAM1B;;WAEN;;WAEA;;UAGM;WACN;;WAEA;;;WAGA;;UAGM;WACN;;;WAGA;;WAEA;;WAEA;;WAEA;WACA,gBAAgB;;;;;;WAMhB,mBAAmB;;WAEnB,eAAe;WACf,gBAAgB;;WAEhB;;WAEA;WACA,cAAc;WACd,aAAa;;;KAIZ;cAWE;;;;;;;;;;UAWG;YACL;WACD;WACA;WACA;WACA;WACA;WACA,gBAAgB;WAChB,UAAU;WACV;WACA;;;WAGA,eAAe;WACf,kBAAkB;;;WAGlB;;;WAGA;WACA;;;;UAKM;WACN,eAAe;WACf,kBAAkB;WAClB;WACA;WACA;WACA;;KAGC;WAEG;WACA,WAAW;WACX,KAAK;;WAGL;WACA;WACA,WAAW;WACX,WAAW;WACX;;;;;;;;;;;;;;wBAeC,SACd,UAAU,mBACV,WAAU,oBACT;;;UC7Kc;EACf;EACA;EACA;;EAEA;EACA,QAAQ;EACR,YAAY;EACZ,OAAO;;EAEP,UAAU,OAAO;EACjB;IAAe;IAAc;;;EAE7B,eAAe;;;wBAID,kBAAkB,QAAQ,kBAAkB;UAoB3C;;EAEf;;;wBAIc,sBACd,UAAU,mBACV,UAAS;;;;qBChDE;UAEI;;WAEN,MAAM;;WAEN;;UAGM;WACN;;;WAGA;;;WAGA;WACA,cAAc;;UAGR;WACN;;KAGC,kBAAkB,gBAAgB;;KAGlC;KAQA;WACG;WAA0B,OAAO;;WACjC;WAA2B,SAAS;WAA+B;;;;;;;;;wBASlE,qBAAqB,gBAAgB;;wBAoFrC,cAAc;EAC5B;EACA;EACA,cAAc;IACZ;;;UCpIa;WACN;WACA;WACA;;UAGM;WACN;;WAEA;WACA,gBAAgB;;;WAGhB;;WAEA;;UAGM;;;WAGN;;wBAGK,gBACd,KAAK,aACL,UAAS,yBACR;;;;;qBAyBU;;;;;;;;;;;KCtBD;;;;;;;;;;;;;;;;;;KAmBA;WACG;WAAuB;;WAEvB;;WAEA;;WAEA;;WAEA;;UAGE;WACN;;;WAGA;WACA,eAAe;;WAEf,QAAQ;;WAER;WACA,sBAAsB;;;;;WAKtB;;;;;UAMM;WACN,QAAQ;WACR,SAAS;;;;UAKH;WACN;WACA;WACA;WACA;;UAGM;WACN;;WAEA;;;UAIM;WACN;WACA;;;;;;;;;;KAWC;WAEG;WACA;WACA;WACA,cAAc;WACd;WACA;WACA,uBAAuB;WACvB,QAAQ;WACR,OAAO;;WAGP;WACA;WACA;WACA,uBAAuB;WACvB,QAAQ;WACR,OAAO;;WAGP;WACA;WACA;WACA,uBAAuB;WACvB,QAAQ;WACR,OAAO;;UAGL;WACN,aAAa;EACtB,IAAI,SAAS,mBAAmB,QAAQ;;;;;;;;;;KAW9B;WACG;WAA2B,aAAa;;WAExC;WACA,WAAW;WACX;WACA,aAAa;;UAGX;WACN;WACA;;WAEA;WACA,OAAO;;WAEP,QAAQ;WACR;;UAGM;WACN,KAAK;WACL,KAAK;;WAEL;WACA,SAAS;;WAET;;;;;;;;wBASW,aAAa,SAAS,sBAAsB,QAAQ;;;;;;;;wBAuC1D,kBAAkB,QAAQ,kBAAkB;;UAc3C;WACN;;WAEA,2BAA2B;;WAE3B,6BAA6B;WAC7B,eAAe;;;;WAIf;;UAGM;WACN;;;WAGA,4BAA4B;WAC5B,sBAAsB;;;WAGtB;WACA,QAAQ;WACR;;;WAGA;;;;;;;;;;;;;;;wBAgBK,qBACd,eAAe,aACf;WAAoB,SAAS;IAC5B;;;UCpQc;WACN;;WAEA;;WAEA;WACA;;WAEA,WAAW;;WAEX;;WAEA,SAAS;WACT,SAAS;;WAET,sBAAsB;WACtB,eAAe;;wBAGV,0BAA0B,SAAS,6BAA6B;;;;;;;;;;qBChBnE;;qBAGA;;;;;;;;;wBAaG,uBACd,SAAQ;UAqBO;;WAEN,QAAQ;WACR,QAAQ;WACR,YAAY;WACZ;WACA;WACA,WAAW;WACX,SAAS;WACT;WACA,OAAO,iBAAiB,SAAS;;wBAG5B,oBAAoB,SAAS,uBAAuB;UAuJnD;;;;;WAKN;;;wBA6JK,uBAAuB,QAAQ;;;;;;;;;;;;;;;;;KCrZnC;UAEK;WACN;;WAEA;;WAEA;WACA,YAAY;;WAEZ;;qBAGE;WAEL;WAEF;WAEA;WACU;WACA;;WAGR;WAEF;WAEA;WACU;WACA;;WAGR;WAEF;WAEA;WACU;WACA;;WAGR;WAEF;WAEA;WACU;WACA;;WAGR;WAEF;WAEA;WACU;WACA;;WAGR;WAEF;WAEA;WACU;WACA;;WAGR;WAEF;WAEA;WACU;WACA;;WAGR;WAEF;WAEA;WACU;WACA;;KAIJ,+BAA+B;;;;;;;;KCjF/BA;UAQK;EACf;EACA;EACA;;EAEA;;UAGe;;WAEN;EACT,KAAK,iBAAiB,oBAAoB,QAAQ;EAClD,SAAS;;UAGM;EACf;;;EAGA;EACA,KAAKA;;EAEL;;UAGe;;EAEf,KAAK,SAAS,uBAAuB,QAAQ;;UAG9B;EACf;EACA,KAAKA;EACL;;UAGe;;EAEf;EACA;EACA;;EAEA;EACA;;;;;;;;;;UAWe;EACf,MAAM,SAAS,eAAe,SAAS,oBAAoB,QAAQ;;UAGpD;EACf;EACA,KAAKA;EACL;;EAEA,SAAS;;EAET,gBAAgB;;;EAGhB;;;;;;;EAOA,UAAU;EACV;;UAGe;EACf;EACA;EACA;EACA;;UAGe;;EAEf;;;EAGA;;EAEA;;EAEA;EACA;;;KAIU,4BACV,SAAS,8BACN,QAAQ;;;;KCtGD;WACG;WAA0B,QAAQ;WAA+B;;WAEjE;WACA,QAAQ;WACR;WACA,aAAa;;WAGb;WACA;WACA;;UAGE;;WAEN;;WAEA;WACA;;;;;;;;;KAUC;;;WAIG;WACA;;WAGA;WACA;WACA;WACA;WACA;WACA;WACA,QAAQ;;UAGN;WACN;WACA;WACA;WACA;WACA;WACA,QAAQ;;UAGF;WACN;WACA;WACA;;WAEA;;;;;;;;;;KAWC;WAEG;WACA;WACA;WACA,cAAc;WACd,OAAO;;WAGP;WACA;WACA;WACA;;UAGE;;WAEN;;WAEA;;WAEA;;;WAGA;WACA,0BAA0B;;;;;;;;KASzB;WACG;WAA8B,WAAW;;WACzC;;WAEA;WACA;WACA,cAAc;;WAGd;WACA;WACA,cAAc;WACd,WAAW;;WAGX;WACA;WACA,cAAc;WACd,WAAW;WACX,WAAW;WACX,QAAQ;;;;;;;;;;UAWN;WACN;WACA;;WAEA;;qBAaE;;wBASG,aAAa,OAAO,cAAc;UAoBjC;WACN;WACA;WACA;WACA;WACA;WACA;WACA;;WAEA;;WAEA;;wBAGK,YAAY,iBAAiB,gBAAgB;;;UCnK5C;WACN,KAAK;WACL,UAAU;WACV,UAAU;WACV,QAAQ;WACR,cAAc;;;WAGd;WACA,SAAS;;WAET;;;;;;;;WAQA;WACA,cAAc;;;;;;;;;;UAWR,wBAAwB;WAC9B;WACA,OAAO;WACP,QAAQ;;;WAGR;WACA;WACA;;;WAGA,kBAAkB;WAClB;WACA;;WAEA;WACA;;wBAMW,eAAe,SAAS,qBAAqB,QAAQ;;;UCtF1D;;WAEN;WACA;WACA;;UAGM;WACN;WACA;WACA;WACA;WACA;WACA;WACA;;;WAGA;;KAGC;UAUK;WACN,IAAI;WACJ;;WAEA;;UAGM;WACN;WACA,QAAQ;;WAER;WACA;WACA,aAAa;;;;WAIb,cAAc;WACd;WACA,qBAAqB;WACrB,kBAAkB;;wBAGb,YACd,qBAAqB,mBACrB,UAAS,qBACR;;;wBAoKa,wBAAwB,QAAQ;;;UCnO/B;EACf;;EAEA;;UAGe;;EAEf;EACA;;EAEA;;;KAIU,iBAAiB,SAAS,mBAAmB,QAAQ;;;;;;qBAOpD,mBAAmB;UAuDf;;EAEf;;EAEA;;EAEA,MAAM;;EAEN;;EAEA;EACA,YAAY;;EAEZ;;;;;;;;wBAqBc,cAAc;EAC5B;EACA;EACA;EACA;EACA;;wBAmBc,oCACd,SAAS,uCACR;;;qBCxIU;;;;;wBAOG,iBACd,SAAQ;;qBAkBG;;;qBAgBA;;wBASG,uBAAuB,QAAQ;wBAc/B,uBAAuB,QAAQ;;;wBAM/B,qBACd,QAAQ,yBACR,SAAQ;;;;;;;;;wBAkBM,qBACd,SAAQ;;;;;;;;;wBAsBM,sBACd,QAAQ,oBACR;;;;qBC5GW,+BAA+B;;qBAG/B,wBAAwB;UAEpB;;WAEN;WACA;;WAEA;;UAGM;;WAEN,gBAAgB;;WAEhB;;;WAGA;WACA;WACA;;;;;;wBAUK,gBAAgB,gBAAgB;wBAWhC,mBAAmB,SAAS,4BAA4B"}

package/dist/trace-repair/index.js

@@ -1,11 +1,11 @@
-import { n as CaptureIntegrityError, s as ValidationError } from "../errors-Dngq5h35.js";
-import { i as compareCodeUnits } from "../canonical-BsZVgBhW.js";
-import { r as pairedBootstrap } from "../paired-tests-jbwPdSz5.js";
-import { n as contentHash } from "../verdict-cache-BQEsVy9n.js";
-import { t as certificationEvidenceDigest } from "../verdict-DhPoXApk.js";
+import { l as errorMessage, n as CaptureIntegrityError, s as ValidationError } from "../errors-DVZiqS7K.js";
+import { i as compareCodeUnits } from "../canonical-B2RqLofv.js";
+import { i as pairedBootstrap, t as mean } from "../mean-DHoMiudD.js";
+import { n as contentHash } from "../verdict-cache-Bm8EKL2s.js";
+import { t as certificationEvidenceDigest } from "../verdict-Dl0tiT1X.js";
 import { t as packageVersion } from "../package-version-D7lQHt_-.js";
-import { t as assertEqualDeclarativeTerms } from "../equal-terms-Blx9Zk5I.js";
-import { d as runPrimeExchange, n as buildPrimePrompt, t as analystUsageReceiptFromPrimeUsage } from "../prime-protocol-DcAK9pC8.js";
+import { t as assertEqualDeclarativeTerms } from "../equal-terms-BtdXayCJ.js";
+import { d as runPrimeExchange, n as buildPrimePrompt, t as analystUsageReceiptFromPrimeUsage } from "../prime-protocol-CHKgA3a6.js";
 import { c as deriveFailureSignature, d as isRecordedTimeout, h as parseRecordedReturncode, i as TIMEOUT_OBSERVATION_MARKER, n as FORMAT_ERROR_OBSERVATION_PREFIX, r as SUBMIT_ACTION_SIGNATURE, t as wrapActionForExec } from "../exec-ChJ6d5if.js";
 import { createHash } from "node:crypto";
 import { constants } from "node:os";
@@ -983,9 +983,6 @@ async function runOneRollout(input) {
 		await environment.dispose();
 	}
 }
-function errorMessage(error) {
-	return error instanceof Error ? error.message : String(error);
-}
 /**
 * Sum only what the provider reported. A call with no usage raises
 * `callsWithUsage` short of `calls` and clears `captured`, so a partially
@@ -3060,9 +3057,6 @@ function measuredPrefixDivergences(grade) {
 	if (grade.outcome === "not-reproduced" && grade.reproduction.basis !== "no-recorded-observation") return grade.reproduction.prefix.divergences;
 	return 0;
 }
-function mean(values) {
-	return values.reduce((sum, value) => sum + value, 0) / values.length;
-}
 /** Markdown report: provenance, the funnel, every per-row column, the
 *  distribution, and the threats. */
 function renderDeltaRepairReport(report) {