@tangle-network/agent-eval 0.190.0 → 0.191.0

package/dist/{matrix-CNypzP-v.d.ts → matrix-CgqdFm5N.d.ts}

@@ -1,5 +1,5 @@
 import { p as CostProvenance } from "./cost-ledger-DbQdN3nO.js";
-import { w as JudgeScore } from "./types-BvmWNjjs.js";
+import { w as JudgeScore } from "./types-BmQRs661.js";
 import { o as MatrixResult } from "./index-DNgf5gyG.js";
 import { AgentProfile } from "@tangle-network/agent-interface";
 //#region src/multishot/types.d.ts
@@ -398,4 +398,4 @@ interface RunMultishotMatrixResult {
 declare function runMultishotMatrix<TPersona extends MultishotPersona>(opts: RunMultishotMatrixOptions<TPersona>): Promise<RunMultishotMatrixResult>;
 //#endregion
 export { MultishotToolExecutor as A, MultishotFatalToolError as C, MultishotShape as D, MultishotResult as E, assertMultishotShotResult as F, MultishotTransportRequest as M, MultishotTransportResponse as N, MultishotShotResultError as O, MultishotTransportToolCall as P, MultishotDriverEmptyError as S, MultishotPersona as T, JudgeRunResult as _, MultishotCellOutput as a, runJudge as b, RunMultishotMatrixResult as c, MultishotShot as d, RunMultishotOptions as f, JudgeDimension as g, JudgeConfig as h, ConversationJudgeInput as i, MultishotTransport as j, MultishotToolDefinition as k, computeCellComposite as l, DEFAULT_JUDGE_MODEL as m, CellCompositeInput as n, MultishotJudges as o, runMultishot as p, CellCompositeScore as r, RunMultishotMatrixOptions as s, ArtifactJudgeInput as t, runMultishotMatrix as u, renderDimensions as v, MultishotMessage as w, MultishotArtifact as x, renderJsonFooter as y };
-//# sourceMappingURL=matrix-CNypzP-v.d.ts.map
+//# sourceMappingURL=matrix-CgqdFm5N.d.ts.map

package/dist/{matrix-CNypzP-v.d.ts.map → matrix-CgqdFm5N.d.ts.map}

@@ -1 +1 @@
-{"version":3,"file":"matrix-CNypzP-v.d.ts","names":[],"sources":["../src/multishot/types.ts","../src/multishot/judges.ts","../src/multishot/multishot.ts","../src/multishot/matrix.ts"],"mappings":";;;;;UAIiB;EACf;EACA;EACA;EACA,YAAY;IAAQ;IAAY;IAAc,MAAM;;;UAGrC;EACf;EACA;EACA;IAAc;IAAc,MAAM;;EAClC;;UAGe;EACf,YAAY;EACZ,WAAW;EACX;EACA;;;EAGA;;;;;;;;EAQA,iBAAiB;;UAGF;EACf;EACA;IACE;IACA;IACA,YAAY;;;;;;UAOC;EACf;EACA,UAAU,MAAM;EAChB,QAAQ;EACR;EACA;EACA,SAAS;;UAGM;EACf;EACA;EACA;IAAY;IAAc;;;UAGX;EACf;IAAW;IAAyB,aAAa;;EACjD;IAAU;IAAwB;;;;EAGlC;;;;EAIA;;;;;;;;KASU,sBACV,KAAK,8BACF,QAAQ;KAED,yBACV,MAAM,yBACN;;EAEE,WAAW;EACX,SAAS;MAER;EAAU;EAAiB;;UAEf;;EAEf;;GAEC;;;;;;;;UASc,eAAe,iBAAiB;;EAE/C,eAAe,SAAS;;;EAGxB,2BAA2B,SAAS;;cAGzB,kCAAkC;WACjB;EAA5B,YAA4B;;cAMjB,gCAAgC;EAC3C,YAAY;;cAMD,iCAAiC;EAC5C,YAAY;;;;;;;;;;;;;;;;;;;iBAyBE,0BAA0B,yBAAyB,SAAS;;;cCvI/D;UAEI;;EAEf;;EAEA;;UAGe,YAAY;;EAE3B;;;EAGA,WAAW;;EAEX;;EAEA,YAAY;;EAEZ;;;EAGA,cAAc,OAAO;;EAErB;;UAGe;;EAEf,OAAO;;EAEP,MAAM;;iBAGc,SAAS,QAC7B,OAAO,YAAY,SACnB,OAAO,SACN,QAAQ;;;iBAsIK,iBAAiB,eAAe;;iBAKhC,iBAAiB,eAAe;;;UCxK/B,oBAAoB,iBAAiB;EACpD,SAAS;EACT,SAAS;;;EAGT,QAAQ,eAAe;;EAEvB,QAAQ;;EAER,gBAAgB,eAAe;;;;EAI/B,mBAAmB;EACnB;EACA;EACA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;;EAGA,gBAAgB;;;;EAIhB,iBAAiB;;;EAGjB,gBAAgB;EAChB,SAAS;;;;;;;;;;;KAYC,cAAc,iBAAiB,qBACzC,MAAM,oBAAoB,cACvB,QAAQ;;;;;;;;;;;;;;;;;iBA2BS,aAAa,iBAAiB,kBAClD,MAAM,oBAAoB,YACzB,QAAQ;;;UClFM,uBAAuB,iBAAiB;EACvD,YAAY;EACZ,SAAS;;UAGM,mBAAmB,iBAAiB;EACnD,UAAU;EACV,SAAS;;UAGM,gBAAgB,iBAAiB;;EAEhD,cAAc,YAAY,uBAAuB;;EAEjD,aAAa,YAAY,mBAAmB;;EAE5C,iBAAiB,YAAY,mBAAmB;;EAEhD;;EAEA;;UAGe;EACf;EACA,cAAc;EACd;IACE,aAAa,MAAM;MAAe;MAAc;;IAChD;;EAEF;IACE,aAAa,MAAM;MAAe;MAAc;;IAChD;;;UAIa,0BAA0B,iBAAiB;;EAE1D,UAAU;IAAQ;IAAY,OAAO;;;EAErC,UAAU;;;EAGV,QAAQ,eAAe;;EAEvB,QAAQ,gBAAgB;;EAExB,QAAQ;;EAER,gBAAgB,eAAe;;EAE/B,mBAAmB;;EAEnB;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;;;EAIA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;;;EAIA,gBAAgB;;EAEhB,iBAAiB;;;EAGjB,gBAAgB;;;;;;;;;;;;;;;EAehB,UAAU,cAAc;;;;;UAMT;EACf;EACA;EACA;;UAoBe;EACf,cAAc;;EAEd,cAAc,cAAc;;EAE5B,iBAAiB,cAAc;;;;;;;iBAQjB,qBAAqB,OAAO;EAC1C;EACA;EACA;EACA;;UAuBe;EACf,QAAQ,aAAa;;iBAGD,mBAAmB,iBAAiB,kBACxD,MAAM,0BAA0B,YAC/B,QAAQ"}
+{"version":3,"file":"matrix-CgqdFm5N.d.ts","names":[],"sources":["../src/multishot/types.ts","../src/multishot/judges.ts","../src/multishot/multishot.ts","../src/multishot/matrix.ts"],"mappings":";;;;;UAIiB;EACf;EACA;EACA;EACA,YAAY;IAAQ;IAAY;IAAc,MAAM;;;UAGrC;EACf;EACA;EACA;IAAc;IAAc,MAAM;;EAClC;;UAGe;EACf,YAAY;EACZ,WAAW;EACX;EACA;;;EAGA;;;;;;;;EAQA,iBAAiB;;UAGF;EACf;EACA;IACE;IACA;IACA,YAAY;;;;;;UAOC;EACf;EACA,UAAU,MAAM;EAChB,QAAQ;EACR;EACA;EACA,SAAS;;UAGM;EACf;EACA;EACA;IAAY;IAAc;;;UAGX;EACf;IAAW;IAAyB,aAAa;;EACjD;IAAU;IAAwB;;;;EAGlC;;;;EAIA;;;;;;;;KASU,sBACV,KAAK,8BACF,QAAQ;KAED,yBACV,MAAM,yBACN;;EAEE,WAAW;EACX,SAAS;MAER;EAAU;EAAiB;;UAEf;;EAEf;;GAEC;;;;;;;;UASc,eAAe,iBAAiB;;EAE/C,eAAe,SAAS;;;EAGxB,2BAA2B,SAAS;;cAGzB,kCAAkC;WACjB;EAA5B,YAA4B;;cAMjB,gCAAgC;EAC3C,YAAY;;cAMD,iCAAiC;EAC5C,YAAY;;;;;;;;;;;;;;;;;;;iBAyBE,0BAA0B,yBAAyB,SAAS;;;cCvI/D;UAEI;;EAEf;;EAEA;;UAGe,YAAY;;EAE3B;;;EAGA,WAAW;;EAEX;;EAEA,YAAY;;EAEZ;;;EAGA,cAAc,OAAO;;EAErB;;UAGe;;EAEf,OAAO;;EAEP,MAAM;;iBAGc,SAAS,QAC7B,OAAO,YAAY,SACnB,OAAO,SACN,QAAQ;;;iBAsIK,iBAAiB,eAAe;;iBAKhC,iBAAiB,eAAe;;;UCxK/B,oBAAoB,iBAAiB;EACpD,SAAS;EACT,SAAS;;;EAGT,QAAQ,eAAe;;EAEvB,QAAQ;;EAER,gBAAgB,eAAe;;;;EAI/B,mBAAmB;EACnB;EACA;EACA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;;EAGA,gBAAgB;;;;EAIhB,iBAAiB;;;EAGjB,gBAAgB;EAChB,SAAS;;;;;;;;;;;KAYC,cAAc,iBAAiB,qBACzC,MAAM,oBAAoB,cACvB,QAAQ;;;;;;;;;;;;;;;;;iBA2BS,aAAa,iBAAiB,kBAClD,MAAM,oBAAoB,YACzB,QAAQ;;;UClFM,uBAAuB,iBAAiB;EACvD,YAAY;EACZ,SAAS;;UAGM,mBAAmB,iBAAiB;EACnD,UAAU;EACV,SAAS;;UAGM,gBAAgB,iBAAiB;;EAEhD,cAAc,YAAY,uBAAuB;;EAEjD,aAAa,YAAY,mBAAmB;;EAE5C,iBAAiB,YAAY,mBAAmB;;EAEhD;;EAEA;;UAGe;EACf;EACA,cAAc;EACd;IACE,aAAa,MAAM;MAAe;MAAc;;IAChD;;EAEF;IACE,aAAa,MAAM;MAAe;MAAc;;IAChD;;;UAIa,0BAA0B,iBAAiB;;EAE1D,UAAU;IAAQ;IAAY,OAAO;;;EAErC,UAAU;;;EAGV,QAAQ,eAAe;;EAEvB,QAAQ,gBAAgB;;EAExB,QAAQ;;EAER,gBAAgB,eAAe;;EAE/B,mBAAmB;;EAEnB;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;;;EAIA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;;;EAIA,gBAAgB;;EAEhB,iBAAiB;;;EAGjB,gBAAgB;;;;;;;;;;;;;;;EAehB,UAAU,cAAc;;;;;UAMT;EACf;EACA;EACA;;UAoBe;EACf,cAAc;;EAEd,cAAc,cAAc;;EAE5B,iBAAiB,cAAc;;;;;;;iBAQjB,qBAAqB,OAAO;EAC1C;EACA;EACA;EACA;;UAuBe;EACf,QAAQ,aAAa;;iBAGD,mBAAmB,iBAAiB,kBACxD,MAAM,0BAA0B,YAC/B,QAAQ"}

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

@@ -1,4 +1,4 @@
-import { E as MultishotResult, M as MultishotTransportRequest, T as MultishotPersona, c as RunMultishotMatrixResult, f as RunMultishotOptions, k as MultishotToolDefinition, s as RunMultishotMatrixOptions } from "../../matrix-CNypzP-v.js";
+import { E as MultishotResult, M as MultishotTransportRequest, T as MultishotPersona, c as RunMultishotMatrixResult, f as RunMultishotOptions, k as MultishotToolDefinition, s as RunMultishotMatrixOptions } from "../../matrix-CgqdFm5N.js";
 //#region src/multishot/golden/compare.d.ts
 interface CompareOptions {
   /** Stop after this many mismatches. A structural divergence high in the

package/dist/multishot/index.d.ts

@@ -1,5 +1,5 @@
-import { w as JudgeScore } from "../types-BvmWNjjs.js";
-import { A as MultishotToolExecutor, C as MultishotFatalToolError, D as MultishotShape, E as MultishotResult, F as assertMultishotShotResult, M as MultishotTransportRequest, N as MultishotTransportResponse, O as MultishotShotResultError, P as MultishotTransportToolCall, S as MultishotDriverEmptyError, T as MultishotPersona, _ as JudgeRunResult, a as MultishotCellOutput, b as runJudge, c as RunMultishotMatrixResult, d as MultishotShot, f as RunMultishotOptions, g as JudgeDimension, h as JudgeConfig, i as ConversationJudgeInput, j as MultishotTransport, k as MultishotToolDefinition, l as computeCellComposite, m as DEFAULT_JUDGE_MODEL, n as CellCompositeInput, o as MultishotJudges, p as runMultishot, r as CellCompositeScore, s as RunMultishotMatrixOptions, t as ArtifactJudgeInput, u as runMultishotMatrix, v as renderDimensions, w as MultishotMessage, x as MultishotArtifact, y as renderJsonFooter } from "../matrix-CNypzP-v.js";
+import { w as JudgeScore } from "../types-BmQRs661.js";
+import { A as MultishotToolExecutor, C as MultishotFatalToolError, D as MultishotShape, E as MultishotResult, F as assertMultishotShotResult, M as MultishotTransportRequest, N as MultishotTransportResponse, O as MultishotShotResultError, P as MultishotTransportToolCall, S as MultishotDriverEmptyError, T as MultishotPersona, _ as JudgeRunResult, a as MultishotCellOutput, b as runJudge, c as RunMultishotMatrixResult, d as MultishotShot, f as RunMultishotOptions, g as JudgeDimension, h as JudgeConfig, i as ConversationJudgeInput, j as MultishotTransport, k as MultishotToolDefinition, l as computeCellComposite, m as DEFAULT_JUDGE_MODEL, n as CellCompositeInput, o as MultishotJudges, p as runMultishot, r as CellCompositeScore, s as RunMultishotMatrixOptions, t as ArtifactJudgeInput, u as runMultishotMatrix, v as renderDimensions, w as MultishotMessage, x as MultishotArtifact, y as renderJsonFooter } from "../matrix-CgqdFm5N.js";
 import { AgentProfile } from "@tangle-network/agent-interface";
 //#region src/multishot/cost.d.ts
 /**

package/dist/openapi.json

@@ -2,7 +2,7 @@
   "openapi": "3.1.0",
   "info": {
     "title": "@tangle-network/agent-eval — wire protocol",
-    "version": "0.190.0",
+    "version": "0.191.0",
     "description": "HTTP and stdio RPC interface to agent-eval. The TypeScript runtime is the source of truth; this spec is the contract that cross-language clients (Python, Rust, Go) generate from.\n\nWire-protocol version: 1.1.0. Bumps on breaking changes to request/response schemas.",
     "contact": {
       "name": "Tangle Network",

package/dist/{otel-spans-CQY1pNiN.js → otel-spans-DS7t1t1J.js}

@@ -1,7 +1,8 @@
 import { s as ValidationError } from "./errors-Dngq5h35.js";
-import { LLM_MODEL_ATTR_KEYS, SPAN_KIND_ATTR_KEYS } from "./trace-attributes.js";
-import { n as classifyOtlpSpanRole, r as isOtlpModelCall } from "./otlp-attributes-BpC_blLF.js";
-import { i as summarizeTraceErrors, n as recordAggregateMeasurements, r as summarizeExecutionMeasurements, t as readTaskFailureLabels } from "./task-failure-attributes-B34TiMBe.js";
+import { LLM_MODEL_ATTR_KEYS, SPAN_KIND_ATTR_KEYS as SPAN_KIND_ATTR_KEYS$1 } from "./trace-attributes.js";
+import "./otlp-attributes-D9ptWaIJ.js";
+import { i as summarizeTraceErrors, n as recordAggregateMeasurements, r as summarizeExecutionMeasurements, t as readTaskFailureLabels } from "./task-failure-attributes-CEqEfuIY.js";
+import { resolveSpanKind } from "@tangle-network/agent-trace-contract";
 //#region src/contract/intake/otel-spans.ts
 /**
 * # `intake/otel-spans` — OTel `TraceSpanEvent[]` → `RunRecord[]`.
@@ -55,8 +56,7 @@ function fromOtelSpans(opts) {
 			id: span.spanId,
 			...span.parentSpanId ? { parentId: span.parentSpanId } : {},
 			attributes: span.attributes,
-			modelCall: isExplicitModelCall(span),
-			aggregate: isExplicitAggregate(span)
+			kind: errorRoleForSpan(span)
 		})));
 		const callSpanIds = new Set(measurements.callSpanIds);
 		const callSpans = groupSpans.filter((span) => callSpanIds.has(span.spanId));
@@ -142,10 +142,10 @@ function isTerminalRootCandidate(span) {
 	return true;
 }
 function readSpanKind(span) {
-	return readAttrString([span], [...SPAN_KIND_ATTR_KEYS, "span.kind"])?.toUpperCase();
+	return readAttrString([span], [...SPAN_KIND_ATTR_KEYS$1, "span.kind"])?.toUpperCase();
 }
 function errorRoleForSpan(span) {
-	return classifyOtlpSpanRole({
+	return resolveSpanKind({
 		kind: readSpanKind(span),
 		name: span.name,
 		attributes: span.attributes
@@ -157,17 +157,6 @@ function spanIdentity(span) {
 function parentIdentity(span) {
 	return `${span.traceId}:${span.parentSpanId}`;
 }
-function isExplicitModelCall(span) {
-	return isOtlpModelCall({
-		kind: readSpanKind(span),
-		name: span.name,
-		attributes: span.attributes
-	});
-}
-function isExplicitAggregate(span) {
-	const kind = readSpanKind(span);
-	return kind !== void 0 && kind !== "LLM";
-}
 function groupSpans(spans) {
 	const m = /* @__PURE__ */ new Map();
 	for (const span of spans) {
@@ -272,4 +261,4 @@ function collectNumericAttrs(spans) {
 //#endregion
 export { fromOtelSpans as t };
 
-//# sourceMappingURL=otel-spans-CQY1pNiN.js.map
+//# sourceMappingURL=otel-spans-DS7t1t1J.js.map

package/dist/otel-spans-DS7t1t1J.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"otel-spans-DS7t1t1J.js","names":["SPAN_KIND_ATTR_KEYS"],"sources":["../src/contract/intake/otel-spans.ts"],"sourcesContent":["/**\n * # `intake/otel-spans` — OTel `TraceSpanEvent[]` → `RunRecord[]`.\n *\n * Turns an existing observability stream into the substrate-canonical\n * `RunRecord` shape so consumers with logs but no eval discipline can\n * call `analyzeRuns()` against their production traffic immediately.\n *\n * Pivot rule: spans are grouped by `tangle.runId` (the same attribute the\n * hosted-tier wire format uses) or, when absent, by `traceId`. One group\n * becomes one `RunRecord`. The root span (no `parentSpanId`) supplies:\n *\n *   - `runId` (the group key)\n *   - `wallMs` from `endTimeUnixNano - startTimeUnixNano`\n *   - `model` from `gen_ai.request.model` / `llm.model` / `tangle.model`\n *   - task failure class and detail from explicit `tangle.task.*` attributes\n *   - cost from `cost.usd` / `gen_ai.usage.cost_usd` / `tangle.cost.usd`\n *   - token usage from model-call input, output, cache-read, and cache-write\n *     attributes without double-counting aggregate parent spans\n *   - task quality from an explicit `scoreForRun` callback or a designated\n *     evaluation attribute on a root / `EVALUATOR` span; `outcome.raw`\n *     collects every numeric attribute without promoting it to task quality.\n *\n * Errored tool, model, and child-agent spans contribute to execution-error\n * counts. Root process, guardrail, evaluator, propagated parent, and unknown\n * errors retain separate counters. Only one failed root can set\n * `RunRecord.terminalOutcome` and `RunRecord.terminalFailureReason`; a child\n * error cannot become a task failure.\n */\n\nimport { resolveSpanKind } from '@tangle-network/agent-trace-contract'\nimport { ValidationError } from '../../errors'\nimport type { TraceSpanEvent } from '../../hosted/types'\nimport type {\n  JudgeScoresRecord,\n  RunOutcome,\n  RunRecord,\n  RunSplitTag,\n  RunTerminalOutcome,\n} from '../../run-record'\nimport { summarizeTraceErrors, type TraceErrorRole } from '../../trace/error-classification'\nimport {\n  recordAggregateMeasurements,\n  summarizeExecutionMeasurements,\n} from '../../trace/execution-measurements'\nimport { LLM_MODEL_ATTR_KEYS, SPAN_KIND_ATTR_KEYS } from '../../trace/otlp-attributes'\nimport { readTaskFailureLabels } from '../../trace/task-failure-attributes'\n\nconst TASK_SCORE_ATTR_KEYS = [\n  'gen_ai.evaluation.score.value',\n  'tangle.task.score',\n  'eval.score',\n  'tangle.score',\n] as const\nconst MODEL_KEYS = ['tangle.model', ...LLM_MODEL_ATTR_KEYS, 'model']\nconst PROMPT_HASH_KEYS = ['tangle.prompt_hash', 'prompt.hash']\nconst CONFIG_HASH_KEYS = ['tangle.config_hash', 'config.hash']\n\nexport interface FromOtelSpansOptions {\n  spans: TraceSpanEvent[]\n  /** Default split tag for synthesized records. Defaults to `'holdout'`. */\n  defaultSplit?: RunSplitTag\n  /** Default `experimentId` when not present on any span. */\n  experimentId?: string\n  /**\n   * Explicit task-quality score for a logical run. The callback receives\n   * spans in deterministic time/id order. Its value must agree with any\n   * designated score attributes present on root or `EVALUATOR` spans.\n   */\n  scoreForRun?: (runId: string, spans: readonly TraceSpanEvent[]) => number | undefined\n}\n\nexport function fromOtelSpans(opts: FromOtelSpansOptions): RunRecord[] {\n  const { spans, defaultSplit = 'holdout', experimentId = 'otel-corpus' } = opts\n  const grouped = groupSpans(spans)\n\n  const runs: RunRecord[] = []\n  for (const [groupKey, groupSpans] of grouped) {\n    const root = findRoot(groupSpans)\n    if (!root) continue\n    const measurements = summarizeExecutionMeasurements(\n      groupSpans.map((span) => ({\n        id: span.spanId,\n        ...(span.parentSpanId ? { parentId: span.parentSpanId } : {}),\n        attributes: span.attributes,\n        kind: errorRoleForSpan(span),\n      })),\n    )\n    const callSpanIds = new Set(measurements.callSpanIds)\n    const callSpans = groupSpans.filter((span) => callSpanIds.has(span.spanId))\n    const wallMs = unixNanoDurationMs(root.startTimeUnixNano, root.endTimeUnixNano)\n    const model =\n      readAttrString(callSpans, MODEL_KEYS) ??\n      readAttrString(groupSpans, MODEL_KEYS) ??\n      'unknown@unknown'\n    const capturedCost =\n      (measurements.cost.complete ? measurements.cost.value : undefined) ??\n      measurements.aggregate?.costUsd\n    const costUsd = capturedCost ?? null\n    const scenarioId = readConsistentScenarioId(groupKey, groupSpans) ?? groupKey\n    const promptHash = readAttrString(groupSpans, PROMPT_HASH_KEYS) ?? 'sha256:unknown'\n    const configHash = readAttrString(groupSpans, CONFIG_HASH_KEYS) ?? 'sha256:unknown'\n    const score = resolveTaskScore(groupKey, groupSpans, opts.scoreForRun)\n    const taskFailure = readTaskFailureLabels(\n      groupSpans.filter((span) => !span.parentSpanId && isTerminalRootCandidate(span)),\n      `fromOtelSpans: run '${groupKey}'`,\n    )\n\n    const rawNumeric = collectNumericAttrs(groupSpans)\n    const errorSummary = summarizeTraceErrors(\n      groupSpans.map((span) => ({\n        id: spanIdentity(span),\n        ...(span.parentSpanId ? { parentId: parentIdentity(span) } : {}),\n        role: errorRoleForSpan(span),\n        error: span.status?.code === 'ERROR',\n        processRoot: !span.parentSpanId && isTerminalRootCandidate(span),\n      })),\n    )\n    rawNumeric.error_span_count = errorSummary.total\n    rawNumeric.execution_error_count = errorSummary.execution\n    rawNumeric.process_error_count = errorSummary.process\n    rawNumeric.guardrail_error_count = errorSummary.guardrail\n    rawNumeric.judge_error_count = errorSummary.evaluation\n    rawNumeric.propagated_error_count = errorSummary.propagated\n    rawNumeric.unclassified_error_count = errorSummary.unclassified\n    rawNumeric.llm_span_count = measurements.modelCallCount\n    if (measurements.cost.value !== undefined && !measurements.cost.complete) {\n      rawNumeric.partial_observed_cost_usd = measurements.cost.value\n    }\n    recordAggregateMeasurements(rawNumeric, measurements.aggregate)\n\n    const judgeScores: JudgeScoresRecord | undefined =\n      score !== undefined\n        ? {\n            perJudge: { 'otel-derived': { score } },\n            perDimMean: { score },\n            composite: score,\n          }\n        : undefined\n\n    const terminalOutcome = terminalOutcomeFromRoots(groupSpans)\n    const failedRoot =\n      terminalOutcome === 'failed'\n        ? groupSpans.find(\n            (span) =>\n              !span.parentSpanId && isTerminalRootCandidate(span) && span.status?.code === 'ERROR',\n          )\n        : undefined\n    const outcome: RunOutcome = {\n      raw: rawNumeric,\n      ...(judgeScores ? { judgeScores } : {}),\n    }\n    if (score !== undefined) {\n      if (defaultSplit === 'holdout') outcome.holdoutScore = score\n      else outcome.searchScore = score\n    }\n\n    runs.push({\n      runId: groupKey,\n      experimentId,\n      candidateId: (root.attributes['tangle.candidateId'] as string | undefined) ?? 'otel-default',\n      seed: 0,\n      model,\n      promptHash,\n      configHash,\n      commitSha: (root.attributes['tangle.commit_sha'] as string | undefined) ?? 'unknown',\n      wallMs,\n      costUsd,\n      costProvenance:\n        capturedCost === undefined\n          ? { kind: 'uncaptured', usd: null }\n          : { kind: 'observed', usd: capturedCost },\n      tokenUsage: measurements.tokenUsage,\n      terminalOutcome,\n      ...(failedRoot\n        ? { terminalFailureReason: failedRoot.status?.message ?? failedRoot.name }\n        : {}),\n      outcome,\n      ...taskFailure,\n      splitTag: defaultSplit,\n      scenarioId,\n    })\n  }\n  return runs\n}\n\nfunction terminalOutcomeFromRoots(spans: TraceSpanEvent[]): RunTerminalOutcome {\n  const roots = spans.filter((span) => !span.parentSpanId && isTerminalRootCandidate(span))\n  if (roots.length !== 1) return 'unknown'\n  if (roots[0]!.status?.code === 'OK') return 'succeeded'\n  if (roots[0]!.status?.code === 'ERROR') return 'failed'\n  return 'unknown'\n}\n\nfunction isTerminalRootCandidate(span: TraceSpanEvent): boolean {\n  const role = errorRoleForSpan(span)\n  if (role === 'LLM' || role === 'TOOL' || role === 'GUARDRAIL' || role === 'EVALUATOR') {\n    return false\n  }\n  return true\n}\n\nfunction readSpanKind(span: TraceSpanEvent): string | undefined {\n  return readAttrString([span], [...SPAN_KIND_ATTR_KEYS, 'span.kind'])?.toUpperCase()\n}\n\nfunction errorRoleForSpan(span: TraceSpanEvent): TraceErrorRole {\n  return resolveSpanKind({\n    kind: readSpanKind(span),\n    name: span.name,\n    attributes: span.attributes,\n  })\n}\n\nfunction spanIdentity(span: TraceSpanEvent): string {\n  return `${span.traceId}:${span.spanId}`\n}\n\nfunction parentIdentity(span: TraceSpanEvent): string {\n  return `${span.traceId}:${span.parentSpanId}`\n}\n\n// ── Internal helpers ────────────────────────────────────────────────\n\nfunction groupSpans(spans: TraceSpanEvent[]): Map<string, TraceSpanEvent[]> {\n  const m = new Map<string, TraceSpanEvent[]>()\n  for (const span of spans) {\n    const key = (span['tangle.runId'] as string | undefined) ?? span.traceId\n    const list = m.get(key) ?? []\n    list.push(span)\n    m.set(key, list)\n  }\n  return m\n}\n\nfunction findRoot(group: TraceSpanEvent[]): TraceSpanEvent | undefined {\n  const structuralRoots = group.filter((span) => !span.parentSpanId)\n  const terminalRoots = structuralRoots.filter(isTerminalRootCandidate)\n  const pool =\n    terminalRoots.length > 0 ? terminalRoots : structuralRoots.length > 0 ? structuralRoots : group\n  return orderSpans(pool)[0]\n}\n\nfunction readAttrString(spans: TraceSpanEvent[], keys: string[]): string | undefined {\n  for (const span of spans) {\n    for (const key of keys) {\n      const v = span.attributes[key]\n      if (typeof v === 'string' && v.length > 0) return v\n    }\n  }\n  return undefined\n}\n\nfunction readConsistentScenarioId(\n  runId: string,\n  spans: readonly TraceSpanEvent[],\n): string | undefined {\n  const values = new Set<string>()\n  for (const span of spans) {\n    const topLevel = span['tangle.scenarioId']\n    if (typeof topLevel === 'string' && topLevel.length > 0) values.add(topLevel)\n    const attribute = span.attributes['tangle.scenarioId']\n    if (typeof attribute === 'string' && attribute.length > 0) values.add(attribute)\n  }\n  if (values.size > 1) {\n    throw new ValidationError(\n      `fromOtelSpans: conflicting scenario ids for run '${runId}': ${[...values].sort().join(', ')}`,\n    )\n  }\n  return values.values().next().value\n}\n\ninterface TaskScoreSource {\n  label: string\n  value: number\n}\n\nfunction resolveTaskScore(\n  runId: string,\n  spans: TraceSpanEvent[],\n  scoreForRun: FromOtelSpansOptions['scoreForRun'],\n): number | undefined {\n  const orderedSpans = orderSpans(spans)\n  const sources: TaskScoreSource[] = []\n\n  if (scoreForRun) {\n    const supplied: unknown = scoreForRun(runId, orderedSpans)\n    if (supplied !== undefined) {\n      if (typeof supplied !== 'number' || !Number.isFinite(supplied)) {\n        throw new ValidationError(\n          `fromOtelSpans: scoreForRun returned a non-finite number for run '${runId}'`,\n        )\n      }\n      sources.push({ label: 'scoreForRun', value: supplied })\n    }\n  }\n\n  for (const span of orderedSpans) {\n    const role = errorRoleForSpan(span)\n    if (span.parentSpanId && role !== 'EVALUATOR') continue\n    if (role === 'EVALUATOR' && span.status?.code === 'ERROR') continue\n    for (const key of TASK_SCORE_ATTR_KEYS) {\n      if (!Object.hasOwn(span.attributes, key)) continue\n      sources.push({\n        label: `span '${span.spanId}' attribute '${key}'`,\n        value: parseTaskScoreAttribute(runId, span.spanId, key, span.attributes[key]),\n      })\n    }\n  }\n\n  if (sources.length === 0) return undefined\n  sources.sort((left, right) => left.label.localeCompare(right.label))\n  const score = sources[0]!.value\n  if (sources.some((source) => source.value !== score)) {\n    const details = sources.map((source) => `${source.label}=${source.value}`).join(', ')\n    throw new ValidationError(\n      `fromOtelSpans: conflicting task-quality scores for run '${runId}': ${details}`,\n    )\n  }\n  return score\n}\n\nfunction parseTaskScoreAttribute(\n  runId: string,\n  spanId: string,\n  key: string,\n  value: unknown,\n): number {\n  const source = `span '${spanId}' attribute '${key}'`\n  if (typeof value === 'string') {\n    if (value.trim().length === 0) {\n      throw new ValidationError(\n        `fromOtelSpans: ${source} is blank for run '${runId}'; task quality must be finite`,\n      )\n    }\n    const parsed = Number(value)\n    if (Number.isFinite(parsed)) return parsed\n  } else if (typeof value === 'number' && Number.isFinite(value)) {\n    return value\n  }\n  throw new ValidationError(\n    `fromOtelSpans: ${source} is not a finite task-quality score for run '${runId}'`,\n  )\n}\n\nfunction orderSpans(spans: readonly TraceSpanEvent[]): TraceSpanEvent[] {\n  return [...spans].sort(\n    (left, right) =>\n      compareUnixNano(left.startTimeUnixNano, right.startTimeUnixNano) ||\n      left.spanId.localeCompare(right.spanId),\n  )\n}\n\nfunction parseUnixNano(value: string): bigint {\n  try {\n    return BigInt(value)\n  } catch {\n    throw new ValidationError(`fromOtelSpans: invalid Unix nanosecond timestamp '${value}'`)\n  }\n}\n\nfunction compareUnixNano(left: string, right: string): number {\n  const leftValue = parseUnixNano(left)\n  const rightValue = parseUnixNano(right)\n  return leftValue < rightValue ? -1 : leftValue > rightValue ? 1 : 0\n}\n\nfunction unixNanoDurationMs(start: string, end: string): number {\n  const delta = parseUnixNano(end) - parseUnixNano(start)\n  if (delta <= 0n) return 0\n  const wholeMs = delta / 1_000_000n\n  const fractionalMs = delta % 1_000_000n\n  const value = Number(wholeMs) + Number(fractionalMs) / 1_000_000\n  if (!Number.isSafeInteger(Number(wholeMs))) {\n    throw new ValidationError('fromOtelSpans: span duration exceeds the safe millisecond range')\n  }\n  return value\n}\n\nfunction collectNumericAttrs(spans: TraceSpanEvent[]): Record<string, number> {\n  const raw: Record<string, number> = {}\n  for (const span of spans) {\n    for (const [k, v] of Object.entries(span.attributes)) {\n      if (typeof v === 'number' && Number.isFinite(v)) raw[k] = v\n    }\n  }\n  return raw\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+CA,MAAM,uBAAuB;CAC3B;CACA;CACA;CACA;AACF;AACA,MAAM,aAAa;CAAC;CAAgB,GAAG;CAAqB;AAAO;AACnE,MAAM,mBAAmB,CAAC,sBAAsB,aAAa;AAC7D,MAAM,mBAAmB,CAAC,sBAAsB,aAAa;AAgB7D,SAAgB,cAAc,MAAyC;CACrE,MAAM,EAAE,OAAO,eAAe,WAAW,eAAe,kBAAkB;CAC1E,MAAM,UAAU,WAAW,KAAK;CAEhC,MAAM,OAAoB,CAAC;CAC3B,KAAK,MAAM,CAAC,UAAU,eAAe,SAAS;EAC5C,MAAM,OAAO,SAAS,UAAU;EAChC,IAAI,CAAC,MAAM;EACX,MAAM,eAAe,+BACnB,WAAW,KAAK,UAAU;GACxB,IAAI,KAAK;GACT,GAAI,KAAK,eAAe,EAAE,UAAU,KAAK,aAAa,IAAI,CAAC;GAC3D,YAAY,KAAK;GACjB,MAAM,iBAAiB,IAAI;EAC7B,EAAE,CACJ;EACA,MAAM,cAAc,IAAI,IAAI,aAAa,WAAW;EACpD,MAAM,YAAY,WAAW,QAAQ,SAAS,YAAY,IAAI,KAAK,MAAM,CAAC;EAC1E,MAAM,SAAS,mBAAmB,KAAK,mBAAmB,KAAK,eAAe;EAC9E,MAAM,QACJ,eAAe,WAAW,UAAU,KACpC,eAAe,YAAY,UAAU,KACrC;EACF,MAAM,gBACH,aAAa,KAAK,WAAW,aAAa,KAAK,QAAQ,KAAA,MACxD,aAAa,WAAW;EAC1B,MAAM,UAAU,gBAAgB;EAChC,MAAM,aAAa,yBAAyB,UAAU,UAAU,KAAK;EACrE,MAAM,aAAa,eAAe,YAAY,gBAAgB,KAAK;EACnE,MAAM,aAAa,eAAe,YAAY,gBAAgB,KAAK;EACnE,MAAM,QAAQ,iBAAiB,UAAU,YAAY,KAAK,WAAW;EACrE,MAAM,cAAc,sBAClB,WAAW,QAAQ,SAAS,CAAC,KAAK,gBAAgB,wBAAwB,IAAI,CAAC,GAC/E,uBAAuB,SAAS,EAClC;EAEA,MAAM,aAAa,oBAAoB,UAAU;EACjD,MAAM,eAAe,qBACnB,WAAW,KAAK,UAAU;GACxB,IAAI,aAAa,IAAI;GACrB,GAAI,KAAK,eAAe,EAAE,UAAU,eAAe,IAAI,EAAE,IAAI,CAAC;GAC9D,MAAM,iBAAiB,IAAI;GAC3B,OAAO,KAAK,QAAQ,SAAS;GAC7B,aAAa,CAAC,KAAK,gBAAgB,wBAAwB,IAAI;EACjE,EAAE,CACJ;EACA,WAAW,mBAAmB,aAAa;EAC3C,WAAW,wBAAwB,aAAa;EAChD,WAAW,sBAAsB,aAAa;EAC9C,WAAW,wBAAwB,aAAa;EAChD,WAAW,oBAAoB,aAAa;EAC5C,WAAW,yBAAyB,aAAa;EACjD,WAAW,2BAA2B,aAAa;EACnD,WAAW,iBAAiB,aAAa;EACzC,IAAI,aAAa,KAAK,UAAU,KAAA,KAAa,CAAC,aAAa,KAAK,UAC9D,WAAW,4BAA4B,aAAa,KAAK;EAE3D,4BAA4B,YAAY,aAAa,SAAS;EAE9D,MAAM,cACJ,UAAU,KAAA,IACN;GACE,UAAU,EAAE,gBAAgB,EAAE,MAAM,EAAE;GACtC,YAAY,EAAE,MAAM;GACpB,WAAW;EACb,IACA,KAAA;EAEN,MAAM,kBAAkB,yBAAyB,UAAU;EAC3D,MAAM,aACJ,oBAAoB,WAChB,WAAW,MACR,SACC,CAAC,KAAK,gBAAgB,wBAAwB,IAAI,KAAK,KAAK,QAAQ,SAAS,OACjF,IACA,KAAA;EACN,MAAM,UAAsB;GAC1B,KAAK;GACL,GAAI,cAAc,EAAE,YAAY,IAAI,CAAC;EACvC;EACA,IAAI,UAAU,KAAA,GACZ,IAAI,iBAAiB,WAAW,QAAQ,eAAe;OAClD,QAAQ,cAAc;EAG7B,KAAK,KAAK;GACR,OAAO;GACP;GACA,aAAc,KAAK,WAAW,yBAAgD;GAC9E,MAAM;GACN;GACA;GACA;GACA,WAAY,KAAK,WAAW,wBAA+C;GAC3E;GACA;GACA,gBACE,iBAAiB,KAAA,IACb;IAAE,MAAM;IAAc,KAAK;GAAK,IAChC;IAAE,MAAM;IAAY,KAAK;GAAa;GAC5C,YAAY,aAAa;GACzB;GACA,GAAI,aACA,EAAE,uBAAuB,WAAW,QAAQ,WAAW,WAAW,KAAK,IACvE,CAAC;GACL;GACA,GAAG;GACH,UAAU;GACV;EACF,CAAC;CACH;CACA,OAAO;AACT;AAEA,SAAS,yBAAyB,OAA6C;CAC7E,MAAM,QAAQ,MAAM,QAAQ,SAAS,CAAC,KAAK,gBAAgB,wBAAwB,IAAI,CAAC;CACxF,IAAI,MAAM,WAAW,GAAG,OAAO;CAC/B,IAAI,MAAM,EAAE,CAAE,QAAQ,SAAS,MAAM,OAAO;CAC5C,IAAI,MAAM,EAAE,CAAE,QAAQ,SAAS,SAAS,OAAO;CAC/C,OAAO;AACT;AAEA,SAAS,wBAAwB,MAA+B;CAC9D,MAAM,OAAO,iBAAiB,IAAI;CAClC,IAAI,SAAS,SAAS,SAAS,UAAU,SAAS,eAAe,SAAS,aACxE,OAAO;CAET,OAAO;AACT;AAEA,SAAS,aAAa,MAA0C;CAC9D,OAAO,eAAe,CAAC,IAAI,GAAG,CAAC,GAAGA,uBAAqB,WAAW,CAAC,CAAC,EAAE,YAAY;AACpF;AAEA,SAAS,iBAAiB,MAAsC;CAC9D,OAAO,gBAAgB;EACrB,MAAM,aAAa,IAAI;EACvB,MAAM,KAAK;EACX,YAAY,KAAK;CACnB,CAAC;AACH;AAEA,SAAS,aAAa,MAA8B;CAClD,OAAO,GAAG,KAAK,QAAQ,GAAG,KAAK;AACjC;AAEA,SAAS,eAAe,MAA8B;CACpD,OAAO,GAAG,KAAK,QAAQ,GAAG,KAAK;AACjC;AAIA,SAAS,WAAW,OAAwD;CAC1E,MAAM,oBAAI,IAAI,IAA8B;CAC5C,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,MAAO,KAAK,mBAA0C,KAAK;EACjE,MAAM,OAAO,EAAE,IAAI,GAAG,KAAK,CAAC;EAC5B,KAAK,KAAK,IAAI;EACd,EAAE,IAAI,KAAK,IAAI;CACjB;CACA,OAAO;AACT;AAEA,SAAS,SAAS,OAAqD;CACrE,MAAM,kBAAkB,MAAM,QAAQ,SAAS,CAAC,KAAK,YAAY;CACjE,MAAM,gBAAgB,gBAAgB,OAAO,uBAAuB;CAGpE,OAAO,WADL,cAAc,SAAS,IAAI,gBAAgB,gBAAgB,SAAS,IAAI,kBAAkB,KACtE,CAAC,CAAC;AAC1B;AAEA,SAAS,eAAe,OAAyB,MAAoC;CACnF,KAAK,MAAM,QAAQ,OACjB,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,IAAI,KAAK,WAAW;EAC1B,IAAI,OAAO,MAAM,YAAY,EAAE,SAAS,GAAG,OAAO;CACpD;AAGJ;AAEA,SAAS,yBACP,OACA,OACoB;CACpB,MAAM,yBAAS,IAAI,IAAY;CAC/B,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,WAAW,KAAK;EACtB,IAAI,OAAO,aAAa,YAAY,SAAS,SAAS,GAAG,OAAO,IAAI,QAAQ;EAC5E,MAAM,YAAY,KAAK,WAAW;EAClC,IAAI,OAAO,cAAc,YAAY,UAAU,SAAS,GAAG,OAAO,IAAI,SAAS;CACjF;CACA,IAAI,OAAO,OAAO,GAChB,MAAM,IAAI,gBACR,oDAAoD,MAAM,KAAK,CAAC,GAAG,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,IAAI,GAC7F;CAEF,OAAO,OAAO,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC;AAChC;AAOA,SAAS,iBACP,OACA,OACA,aACoB;CACpB,MAAM,eAAe,WAAW,KAAK;CACrC,MAAM,UAA6B,CAAC;CAEpC,IAAI,aAAa;EACf,MAAM,WAAoB,YAAY,OAAO,YAAY;EACzD,IAAI,aAAa,KAAA,GAAW;GAC1B,IAAI,OAAO,aAAa,YAAY,CAAC,OAAO,SAAS,QAAQ,GAC3D,MAAM,IAAI,gBACR,oEAAoE,MAAM,EAC5E;GAEF,QAAQ,KAAK;IAAE,OAAO;IAAe,OAAO;GAAS,CAAC;EACxD;CACF;CAEA,KAAK,MAAM,QAAQ,cAAc;EAC/B,MAAM,OAAO,iBAAiB,IAAI;EAClC,IAAI,KAAK,gBAAgB,SAAS,aAAa;EAC/C,IAAI,SAAS,eAAe,KAAK,QAAQ,SAAS,SAAS;EAC3D,KAAK,MAAM,OAAO,sBAAsB;GACtC,IAAI,CAAC,OAAO,OAAO,KAAK,YAAY,GAAG,GAAG;GAC1C,QAAQ,KAAK;IACX,OAAO,SAAS,KAAK,OAAO,eAAe,IAAI;IAC/C,OAAO,wBAAwB,OAAO,KAAK,QAAQ,KAAK,KAAK,WAAW,IAAI;GAC9E,CAAC;EACH;CACF;CAEA,IAAI,QAAQ,WAAW,GAAG,OAAO,KAAA;CACjC,QAAQ,MAAM,MAAM,UAAU,KAAK,MAAM,cAAc,MAAM,KAAK,CAAC;CACnE,MAAM,QAAQ,QAAQ,EAAE,CAAE;CAC1B,IAAI,QAAQ,MAAM,WAAW,OAAO,UAAU,KAAK,GAEjD,MAAM,IAAI,gBACR,2DAA2D,MAAM,KAFnD,QAAQ,KAAK,WAAW,GAAG,OAAO,MAAM,GAAG,OAAO,OAAO,CAAC,CAAC,KAAK,IAEF,GAC9E;CAEF,OAAO;AACT;AAEA,SAAS,wBACP,OACA,QACA,KACA,OACQ;CACR,MAAM,SAAS,SAAS,OAAO,eAAe,IAAI;CAClD,IAAI,OAAO,UAAU,UAAU;EAC7B,IAAI,MAAM,KAAK,CAAC,CAAC,WAAW,GAC1B,MAAM,IAAI,gBACR,kBAAkB,OAAO,qBAAqB,MAAM,+BACtD;EAEF,MAAM,SAAS,OAAO,KAAK;EAC3B,IAAI,OAAO,SAAS,MAAM,GAAG,OAAO;CACtC,OAAO,IAAI,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK,GAC3D,OAAO;CAET,MAAM,IAAI,gBACR,kBAAkB,OAAO,+CAA+C,MAAM,EAChF;AACF;AAEA,SAAS,WAAW,OAAoD;CACtE,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,MACf,MAAM,UACL,gBAAgB,KAAK,mBAAmB,MAAM,iBAAiB,KAC/D,KAAK,OAAO,cAAc,MAAM,MAAM,CAC1C;AACF;AAEA,SAAS,cAAc,OAAuB;CAC5C,IAAI;EACF,OAAO,OAAO,KAAK;CACrB,QAAQ;EACN,MAAM,IAAI,gBAAgB,qDAAqD,MAAM,EAAE;CACzF;AACF;AAEA,SAAS,gBAAgB,MAAc,OAAuB;CAC5D,MAAM,YAAY,cAAc,IAAI;CACpC,MAAM,aAAa,cAAc,KAAK;CACtC,OAAO,YAAY,aAAa,KAAK,YAAY,aAAa,IAAI;AACpE;AAEA,SAAS,mBAAmB,OAAe,KAAqB;CAC9D,MAAM,QAAQ,cAAc,GAAG,IAAI,cAAc,KAAK;CACtD,IAAI,SAAS,IAAI,OAAO;CACxB,MAAM,UAAU,QAAQ;CACxB,MAAM,eAAe,QAAQ;CAC7B,MAAM,QAAQ,OAAO,OAAO,IAAI,OAAO,YAAY,IAAI;CACvD,IAAI,CAAC,OAAO,cAAc,OAAO,OAAO,CAAC,GACvC,MAAM,IAAI,gBAAgB,iEAAiE;CAE7F,OAAO;AACT;AAEA,SAAS,oBAAoB,OAAiD;CAC5E,MAAM,MAA8B,CAAC;CACrC,KAAK,MAAM,QAAQ,OACjB,KAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,KAAK,UAAU,GACjD,IAAI,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,GAAG,IAAI,KAAK;CAG9D,OAAO;AACT"}

package/dist/otlp-attributes-D9ptWaIJ.js

@@ -0,0 +1,53 @@
+import { INPUT_VALUE, OUTPUT_VALUE, TOOL_ARGS_CAPTURED, TOOL_LATENCY_MS, TOOL_NAME } from "./trace-attributes.js";
+//#region src/trace/otlp-attributes.ts
+const TOOL_SPAN_ATTRIBUTE_KEYS = [
+	TOOL_NAME,
+	TOOL_ARGS_CAPTURED,
+	TOOL_LATENCY_MS,
+	INPUT_VALUE,
+	OUTPUT_VALUE
+];
+function toolSpanOtlpAttributes(span) {
+	const argsCaptured = span.argsCaptured !== false;
+	const attributes = {
+		[TOOL_NAME]: span.toolName,
+		[TOOL_ARGS_CAPTURED]: argsCaptured
+	};
+	if (span.latencyMs !== void 0) attributes[TOOL_LATENCY_MS] = span.latencyMs;
+	if (argsCaptured) attributes[INPUT_VALUE] = stringifyTraceValue(span.args);
+	if (span.result !== void 0) attributes[OUTPUT_VALUE] = stringifyTraceValue(span.result);
+	return attributes;
+}
+function applyToolSpanOtlpAttributes(attributes, span) {
+	for (const key of TOOL_SPAN_ATTRIBUTE_KEYS) delete attributes[key];
+	Object.assign(attributes, toolSpanOtlpAttributes(span));
+}
+/**
+* The contract kind this package writes for one of its own span kinds. A kind
+* with no contract equivalent is written as `UNKNOWN`, which the contract
+* accepts, rather than a word no reader knows.
+*/
+function traceSpanKindToOpenInferenceKind(kind) {
+	switch (kind) {
+		case "llm": return "LLM";
+		case "tool": return "TOOL";
+		case "retrieval": return "RETRIEVER";
+		case "judge": return "EVALUATOR";
+		case "sandbox": return "CHAIN";
+		case "agent": return "AGENT";
+		default: return "UNKNOWN";
+	}
+}
+function stringifyTraceValue(value) {
+	if (value === void 0) return "null";
+	if (typeof value === "string") return value;
+	try {
+		return JSON.stringify(value) ?? String(value);
+	} catch {
+		return String(value);
+	}
+}
+//#endregion
+export { traceSpanKindToOpenInferenceKind as n, applyToolSpanOtlpAttributes as t };
+
+//# sourceMappingURL=otlp-attributes-D9ptWaIJ.js.map

package/dist/otlp-attributes-D9ptWaIJ.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"otlp-attributes-D9ptWaIJ.js","names":[],"sources":["../src/trace/otlp-attributes.ts"],"sourcesContent":["/** Canonical OpenInference-over-OTLP attribute vocabulary used at the trace boundary. */\n\nimport type { SpanKind } from '@tangle-network/agent-trace-contract'\nimport {\n  INPUT_VALUE,\n  OUTPUT_VALUE,\n  TOOL_ARGS_CAPTURED,\n  TOOL_LATENCY_MS,\n  TOOL_NAME,\n} from './attribute-vocabulary'\nimport type { ToolSpan } from './schema'\n\nexport * from './attribute-vocabulary'\n\nconst TOOL_SPAN_ATTRIBUTE_KEYS = [\n  TOOL_NAME,\n  TOOL_ARGS_CAPTURED,\n  TOOL_LATENCY_MS,\n  INPUT_VALUE,\n  OUTPUT_VALUE,\n] as const\n\nexport type ToolSpanOtlpInput = Pick<\n  ToolSpan,\n  'toolName' | 'args' | 'argsCaptured' | 'result' | 'latencyMs'\n>\n\nfunction toolSpanOtlpAttributes(\n  span: ToolSpanOtlpInput,\n): Record<string, string | number | boolean> {\n  const argsCaptured = span.argsCaptured !== false\n  const attributes: Record<string, string | number | boolean> = {\n    [TOOL_NAME]: span.toolName,\n    [TOOL_ARGS_CAPTURED]: argsCaptured,\n  }\n  if (span.latencyMs !== undefined) attributes[TOOL_LATENCY_MS] = span.latencyMs\n  if (argsCaptured) attributes[INPUT_VALUE] = stringifyTraceValue(span.args)\n  if (span.result !== undefined) attributes[OUTPUT_VALUE] = stringifyTraceValue(span.result)\n  return attributes\n}\n\nexport function applyToolSpanOtlpAttributes(\n  attributes: Record<string, unknown>,\n  span: ToolSpanOtlpInput,\n): void {\n  for (const key of TOOL_SPAN_ATTRIBUTE_KEYS) delete attributes[key]\n  Object.assign(attributes, toolSpanOtlpAttributes(span))\n}\n\n/**\n * The contract kind this package writes for one of its own span kinds. A kind\n * with no contract equivalent is written as `UNKNOWN`, which the contract\n * accepts, rather than a word no reader knows.\n */\nexport function traceSpanKindToOpenInferenceKind(kind: string): SpanKind {\n  switch (kind) {\n    case 'llm':\n      return 'LLM'\n    case 'tool':\n      return 'TOOL'\n    case 'retrieval':\n      return 'RETRIEVER'\n    case 'judge':\n      return 'EVALUATOR'\n    case 'sandbox':\n      return 'CHAIN'\n    case 'agent':\n      return 'AGENT'\n    default:\n      return 'UNKNOWN'\n  }\n}\n\nfunction stringifyTraceValue(value: unknown): string {\n  if (value === undefined) return 'null'\n  if (typeof value === 'string') return value\n  try {\n    return JSON.stringify(value) ?? String(value)\n  } catch {\n    return String(value)\n  }\n}\n"],"mappings":";;AAcA,MAAM,2BAA2B;CAC/B;CACA;CACA;CACA;CACA;AACF;AAOA,SAAS,uBACP,MAC2C;CAC3C,MAAM,eAAe,KAAK,iBAAiB;CAC3C,MAAM,aAAwD;GAC3D,YAAY,KAAK;GACjB,qBAAqB;CACxB;CACA,IAAI,KAAK,cAAc,KAAA,GAAW,WAAW,mBAAmB,KAAK;CACrE,IAAI,cAAc,WAAW,eAAe,oBAAoB,KAAK,IAAI;CACzE,IAAI,KAAK,WAAW,KAAA,GAAW,WAAW,gBAAgB,oBAAoB,KAAK,MAAM;CACzF,OAAO;AACT;AAEA,SAAgB,4BACd,YACA,MACM;CACN,KAAK,MAAM,OAAO,0BAA0B,OAAO,WAAW;CAC9D,OAAO,OAAO,YAAY,uBAAuB,IAAI,CAAC;AACxD;;;;;;AAOA,SAAgB,iCAAiC,MAAwB;CACvE,QAAQ,MAAR;EACE,KAAK,OACH,OAAO;EACT,KAAK,QACH,OAAO;EACT,KAAK,aACH,OAAO;EACT,KAAK,SACH,OAAO;EACT,KAAK,WACH,OAAO;EACT,KAAK,SACH,OAAO;EACT,SACE,OAAO;CACX;AACF;AAEA,SAAS,oBAAoB,OAAwB;CACnD,IAAI,UAAU,KAAA,GAAW,OAAO;CAChC,IAAI,OAAO,UAAU,UAAU,OAAO;CACtC,IAAI;EACF,OAAO,KAAK,UAAU,KAAK,KAAK,OAAO,KAAK;CAC9C,QAAQ;EACN,OAAO,OAAO,KAAK;CACrB;AACF"}

package/dist/pipelines/index.d.ts

@@ -1,7 +1,7 @@
 import { f as Run } from "../schema-2g7trUwH.js";
 import { a as RunFilter, s as TraceStore } from "../store-C4avFjIi.js";
 import { n as FailureClusterReport, r as failureClusterView, t as FailureCluster } from "../failure-cluster-CbgEDcFJ.js";
-import { t as DiagnosisSpan } from "../spans-D1RftP_w.js";
+import { t as DiagnosisSpan } from "../spans-BWtjk_9c.js";
 import { n as TrajectoryStep } from "../trajectory-Y1fmdlw7.js";
 import { c as computeToolUseMetrics, d as judgeAgreementView, f as BudgetBreachFinding, g as BaselineReport, h as BaselineOptions, i as toolWasteView, l as JudgeAgreementReport, m as budgetBreachView, n as ToolWasteOptions, p as BudgetBreachReport, r as ToolWasteReport, t as ToolWasteFinding, u as JudgePair } from "../tool-waste-CP5DO383.js";
 //#region src/pipelines/first-divergence.d.ts

package/dist/pipelines/index.js

@@ -167,7 +167,7 @@ function diffStepsFromSpans(spans) {
 		if (list) list.push(span);
 		else children.set(parent, [span]);
 	}
-	const byStart = (x, y) => (x.startMs ?? 0) - (y.startMs ?? 0) || x.spanId.localeCompare(y.spanId);
+	const byStart = (x, y) => (x.startMs ?? 0) - (y.startMs ?? 0) || (x.endMs ?? 0) - (y.endMs ?? 0) || x.kind.localeCompare(y.kind) || x.name.localeCompare(y.name) || x.spanId.localeCompare(y.spanId);
 	for (const list of children.values()) list.sort(byStart);
 	const ordered = [];
 	const visited = /* @__PURE__ */ new Set();

package/dist/pipelines/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","names":[],"sources":["../../src/pipelines/first-divergence.ts","../../src/pipelines/regression.ts","../../src/pipelines/stuck-loop.ts"],"sourcesContent":["/**\n * Step diff between two runs, with the first divergence marked.\n *\n * Steps pair in three passes, each over the steps still unpaired:\n *   1. `id`: the same step id in both runs, e.g. a forked run that kept its\n *      parent's span ids.\n *   2. `position`: the same index with the same name and kind.\n *   3. `name`: the same name and kind anywhere, first unpaired step in order.\n * A step left unpaired exists in only one run. The first divergence is the\n * first index at which the two runs stop agreeing step for step, and it says\n * how: a paired step changed, one run replaced, added or removed a step, or the\n * runs ran the same steps in a different order.\n *\n * `diffSteps` reads plain `DiffStep` lists, so the same diff serves agent-eval\n * trace stores (`firstDivergenceView`) and flat OTLP spans\n * (`diffStepsFromSpans`). Use it to attribute \"why is variant B better?\" to a\n * step, and to compare sibling or parent and child runs of a search tree.\n */\n\nimport type { DiagnosisSpan } from '../diagnosis/spans'\nimport type { Span } from '../trace/schema'\nimport type { TraceStore } from '../trace/store'\nimport { buildTrajectory, type TrajectoryStep } from '../trajectory'\n\n/** One step of a run, as the diff reads it. */\nexport interface DiffStep {\n  /** The step's id within its run. */\n  id: string\n  name: string\n  kind: string\n  /** Fields compared once two steps pair, such as status, tool or model. */\n  fields: Readonly<Record<string, string | number | boolean | null>>\n}\n\nexport type StepPairing = 'id' | 'position' | 'name'\n\nexport interface FieldDifference {\n  field: string\n  a: string | number | boolean | null\n  b: string | number | boolean | null\n}\n\nexport interface StepPair {\n  /** Index in run A. */\n  a: number\n  /** Index in run B. */\n  b: number\n  pairedBy: StepPairing\n  /** Empty when the paired steps agree on name, kind and every field. */\n  differences: FieldDifference[]\n}\n\nexport type StepDivergenceKind = 'changed' | 'replaced' | 'only-in-a' | 'only-in-b' | 'reordered'\n\nexport interface StepDivergence {\n  /** The first index at which the runs stop agreeing; equals `commonPrefixLen`. */\n  index: number\n  kind: StepDivergenceKind\n  /** Index of the step at `index` in each run, or null when that run has ended. */\n  a: number | null\n  b: number | null\n  /** Set when `kind` is `changed`. */\n  differences: FieldDifference[]\n  reason: string\n}\n\nexport interface StepDiff {\n  /** Paired steps in run A order. */\n  pairs: StepPair[]\n  /** Indexes of run A steps with no partner in run B. */\n  onlyInA: number[]\n  /** Indexes of run B steps with no partner in run A. */\n  onlyInB: number[]\n  /** Leading steps paired index for index with no difference. */\n  commonPrefixLen: number\n  /** Null when the runs agree step for step. */\n  firstDivergence: StepDivergence | null\n}\n\nexport function diffSteps(a: readonly DiffStep[], b: readonly DiffStep[]): StepDiff {\n  const partnerOfA = new Map<number, { b: number; pairedBy: StepPairing }>()\n  const pairedB = new Set<number>()\n  const pair = (i: number, j: number, pairedBy: StepPairing) => {\n    partnerOfA.set(i, { b: j, pairedBy })\n    pairedB.add(j)\n  }\n\n  const bById = new Map<string, number[]>()\n  b.forEach((step, j) => {\n    const list = bById.get(step.id)\n    if (list) list.push(j)\n    else bById.set(step.id, [j])\n  })\n  a.forEach((step, i) => {\n    const j = bById.get(step.id)?.find((candidate) => !pairedB.has(candidate))\n    if (j !== undefined) pair(i, j, 'id')\n  })\n  a.forEach((step, i) => {\n    if (partnerOfA.has(i) || i >= b.length || pairedB.has(i)) return\n    if (sameShape(step, b[i]!)) pair(i, i, 'position')\n  })\n  a.forEach((step, i) => {\n    if (partnerOfA.has(i)) return\n    const j = b.findIndex((candidate, index) => !pairedB.has(index) && sameShape(step, candidate))\n    if (j >= 0) pair(i, j, 'name')\n  })\n\n  const pairs: StepPair[] = [...partnerOfA.entries()]\n    .sort(([x], [y]) => x - y)\n    .map(([i, partner]) => ({\n      a: i,\n      b: partner.b,\n      pairedBy: partner.pairedBy,\n      differences: differencesBetween(a[i]!, b[partner.b]!),\n    }))\n  const pairByA = new Map(pairs.map((entry) => [entry.a, entry]))\n  const partnerOfB = new Map(pairs.map((entry) => [entry.b, entry.a]))\n\n  let prefix = 0\n  while (prefix < a.length && prefix < b.length) {\n    const entry = pairByA.get(prefix)\n    if (!entry || entry.b !== prefix || entry.differences.length > 0) break\n    prefix += 1\n  }\n\n  return {\n    pairs,\n    onlyInA: a.map((_, i) => i).filter((i) => !partnerOfA.has(i)),\n    onlyInB: b.map((_, j) => j).filter((j) => !pairedB.has(j)),\n    commonPrefixLen: prefix,\n    firstDivergence:\n      prefix === a.length && prefix === b.length\n        ? null\n        : divergenceAt(prefix, a, b, pairByA.get(prefix), partnerOfB),\n  }\n}\n\nfunction divergenceAt(\n  index: number,\n  a: readonly DiffStep[],\n  b: readonly DiffStep[],\n  pairOfA: StepPair | undefined,\n  partnerOfB: ReadonlyMap<number, number>,\n): StepDivergence {\n  const stepA = a[index]\n  const stepB = b[index]\n  const base = {\n    index,\n    a: stepA ? index : null,\n    b: stepB ? index : null,\n    differences: [] as FieldDifference[],\n  }\n  if (stepA && stepB && pairOfA?.b === index) {\n    return {\n      ...base,\n      kind: 'changed',\n      differences: pairOfA.differences,\n      reason: `at index ${index}, ${describe(stepA)} changed: ${pairOfA.differences\n        .map((d) => `${d.field} ${String(d.a)} vs ${String(d.b)}`)\n        .join('; ')}`,\n    }\n  }\n  const aUnpaired = stepA !== undefined && pairOfA === undefined\n  const bUnpaired = stepB !== undefined && !partnerOfB.has(index)\n  if (stepA && stepB && aUnpaired && bUnpaired) {\n    return {\n      ...base,\n      kind: 'replaced',\n      reason: `at index ${index}, A ran ${describe(stepA)} and B ran ${describe(stepB)}`,\n    }\n  }\n  if (stepA && aUnpaired) {\n    return {\n      ...base,\n      kind: 'only-in-a',\n      reason: `at index ${index}, only A has ${describe(stepA)}`,\n    }\n  }\n  if (stepB && bUnpaired) {\n    return {\n      ...base,\n      kind: 'only-in-b',\n      reason: `at index ${index}, only B has ${describe(stepB)}`,\n    }\n  }\n  return {\n    ...base,\n    kind: 'reordered',\n    reason: `at index ${index}, A ran ${describe(stepA!)} and B ran ${describe(stepB!)}; both steps occur in the other run at a different position`,\n  }\n}\n\nfunction sameShape(x: DiffStep, y: DiffStep): boolean {\n  return x.name === y.name && x.kind === y.kind\n}\n\nfunction differencesBetween(x: DiffStep, y: DiffStep): FieldDifference[] {\n  const differences: FieldDifference[] = []\n  if (x.kind !== y.kind) differences.push({ field: 'kind', a: x.kind, b: y.kind })\n  if (x.name !== y.name) differences.push({ field: 'name', a: x.name, b: y.name })\n  const fields = [...new Set([...Object.keys(x.fields), ...Object.keys(y.fields)])].sort()\n  for (const field of fields) {\n    const left = x.fields[field] ?? null\n    const right = y.fields[field] ?? null\n    if (left !== right) differences.push({ field, a: left, b: right })\n  }\n  return differences\n}\n\nfunction describe(step: DiffStep): string {\n  return `${step.kind} \"${step.name}\"`\n}\n\n// ── agent-eval trace store ────────────────────────────────────────────\n\nexport interface DivergenceReport {\n  runA: string\n  runB: string\n  /** Null when the runs agree step for step. */\n  firstDivergenceIndex: number | null\n  aStep?: TrajectoryStep\n  bStep?: TrajectoryStep\n  reason?: string\n  commonPrefixLen: number\n  /** The step diff behind the first divergence, over trajectory step indexes. */\n  diff: StepDiff\n}\n\nexport async function firstDivergenceView(\n  store: TraceStore,\n  runA: string,\n  runB: string,\n): Promise<DivergenceReport> {\n  const [a, b] = await Promise.all([buildTrajectory(store, runA), buildTrajectory(store, runB)])\n  const diff = diffSteps(a.steps.map(trajectoryDiffStep), b.steps.map(trajectoryDiffStep))\n  const divergence = diff.firstDivergence\n  return {\n    runA,\n    runB,\n    firstDivergenceIndex: divergence?.index ?? null,\n    ...(divergence?.a != null ? { aStep: a.steps[divergence.a] } : {}),\n    ...(divergence?.b != null ? { bStep: b.steps[divergence.b] } : {}),\n    ...(divergence ? { reason: divergence.reason } : {}),\n    commonPrefixLen: diff.commonPrefixLen,\n    diff,\n  }\n}\n\nfunction trajectoryDiffStep(step: TrajectoryStep): DiffStep {\n  const span: Span = step.span\n  const fields: Record<string, string | number | boolean | null> = {\n    status: span.status ?? null,\n  }\n  if (span.kind === 'tool') fields.tool = span.toolName\n  if (span.kind === 'llm') fields.model = span.model\n  if (span.kind === 'judge') fields.dimension = span.dimension\n  return { id: span.spanId, name: span.name, kind: span.kind, fields }\n}\n\n// ── flat OTLP spans ───────────────────────────────────────────────────\n\n/**\n * One run's spans as diff steps, in containment order: depth first, siblings\n * by start time, the same order `buildTrajectory` gives a trace store run.\n * Spans whose parent is absent, or whose parents form a cycle, start their own\n * subtree, so every span appears exactly once.\n */\nexport function diffStepsFromSpans(spans: readonly DiagnosisSpan[]): DiffStep[] {\n  const ids = new Set(spans.map((span) => span.spanId))\n  const children = new Map<string | null, DiagnosisSpan[]>()\n  for (const span of spans) {\n    const parent =\n      span.parentSpanId !== null && ids.has(span.parentSpanId) ? span.parentSpanId : null\n    const list = children.get(parent)\n    if (list) list.push(span)\n    else children.set(parent, [span])\n  }\n  const byStart = (x: DiagnosisSpan, y: DiagnosisSpan) =>\n    (x.startMs ?? 0) - (y.startMs ?? 0) || x.spanId.localeCompare(y.spanId)\n  for (const list of children.values()) list.sort(byStart)\n  const ordered: DiffStep[] = []\n  const visited = new Set<string>()\n  const visit = (span: DiagnosisSpan) => {\n    if (visited.has(span.spanId)) return\n    visited.add(span.spanId)\n    ordered.push({\n      id: span.spanId,\n      name: span.name,\n      kind: span.kind,\n      fields: { status: span.status, tool: span.toolName, model: span.model },\n    })\n    for (const child of children.get(span.spanId) ?? []) visit(child)\n  }\n  for (const root of children.get(null) ?? []) visit(root)\n  for (const span of [...spans].sort(byStart)) visit(span)\n  return ordered\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 { runMetricExtractor } 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. Omit it and `metric` must name one of\n   *  `RUN_METRICS`; any other name is refused. */\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 ?? runMetricExtractor(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","/**\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"],"mappings":";;;;;;;AA+EA,SAAgB,UAAU,GAAwB,GAAkC;CAClF,MAAM,6BAAa,IAAI,IAAkD;CACzE,MAAM,0BAAU,IAAI,IAAY;CAChC,MAAM,QAAQ,GAAW,GAAW,aAA0B;EAC5D,WAAW,IAAI,GAAG;GAAE,GAAG;GAAG;EAAS,CAAC;EACpC,QAAQ,IAAI,CAAC;CACf;CAEA,MAAM,wBAAQ,IAAI,IAAsB;CACxC,EAAE,SAAS,MAAM,MAAM;EACrB,MAAM,OAAO,MAAM,IAAI,KAAK,EAAE;EAC9B,IAAI,MAAM,KAAK,KAAK,CAAC;OAChB,MAAM,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC;CAC7B,CAAC;CACD,EAAE,SAAS,MAAM,MAAM;EACrB,MAAM,IAAI,MAAM,IAAI,KAAK,EAAE,CAAC,EAAE,MAAM,cAAc,CAAC,QAAQ,IAAI,SAAS,CAAC;EACzE,IAAI,MAAM,KAAA,GAAW,KAAK,GAAG,GAAG,IAAI;CACtC,CAAC;CACD,EAAE,SAAS,MAAM,MAAM;EACrB,IAAI,WAAW,IAAI,CAAC,KAAK,KAAK,EAAE,UAAU,QAAQ,IAAI,CAAC,GAAG;EAC1D,IAAI,UAAU,MAAM,EAAE,EAAG,GAAG,KAAK,GAAG,GAAG,UAAU;CACnD,CAAC;CACD,EAAE,SAAS,MAAM,MAAM;EACrB,IAAI,WAAW,IAAI,CAAC,GAAG;EACvB,MAAM,IAAI,EAAE,WAAW,WAAW,UAAU,CAAC,QAAQ,IAAI,KAAK,KAAK,UAAU,MAAM,SAAS,CAAC;EAC7F,IAAI,KAAK,GAAG,KAAK,GAAG,GAAG,MAAM;CAC/B,CAAC;CAED,MAAM,QAAoB,CAAC,GAAG,WAAW,QAAQ,CAAC,CAAC,CAChD,MAAM,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC,CACzB,KAAK,CAAC,GAAG,cAAc;EACtB,GAAG;EACH,GAAG,QAAQ;EACX,UAAU,QAAQ;EAClB,aAAa,mBAAmB,EAAE,IAAK,EAAE,QAAQ,EAAG;CACtD,EAAE;CACJ,MAAM,UAAU,IAAI,IAAI,MAAM,KAAK,UAAU,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;CAC9D,MAAM,aAAa,IAAI,IAAI,MAAM,KAAK,UAAU,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC;CAEnE,IAAI,SAAS;CACb,OAAO,SAAS,EAAE,UAAU,SAAS,EAAE,QAAQ;EAC7C,MAAM,QAAQ,QAAQ,IAAI,MAAM;EAChC,IAAI,CAAC,SAAS,MAAM,MAAM,UAAU,MAAM,YAAY,SAAS,GAAG;EAClE,UAAU;CACZ;CAEA,OAAO;EACL;EACA,SAAS,EAAE,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,QAAQ,MAAM,CAAC,WAAW,IAAI,CAAC,CAAC;EAC5D,SAAS,EAAE,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,QAAQ,MAAM,CAAC,QAAQ,IAAI,CAAC,CAAC;EACzD,iBAAiB;EACjB,iBACE,WAAW,EAAE,UAAU,WAAW,EAAE,SAChC,OACA,aAAa,QAAQ,GAAG,GAAG,QAAQ,IAAI,MAAM,GAAG,UAAU;CAClE;AACF;AAEA,SAAS,aACP,OACA,GACA,GACA,SACA,YACgB;CAChB,MAAM,QAAQ,EAAE;CAChB,MAAM,QAAQ,EAAE;CAChB,MAAM,OAAO;EACX;EACA,GAAG,QAAQ,QAAQ;EACnB,GAAG,QAAQ,QAAQ;EACnB,aAAa,CAAC;CAChB;CACA,IAAI,SAAS,SAAS,SAAS,MAAM,OACnC,OAAO;EACL,GAAG;EACH,MAAM;EACN,aAAa,QAAQ;EACrB,QAAQ,YAAY,MAAM,IAAI,SAAS,KAAK,EAAE,YAAY,QAAQ,YAC/D,KAAK,MAAM,GAAG,EAAE,MAAM,GAAG,OAAO,EAAE,CAAC,EAAE,MAAM,OAAO,EAAE,CAAC,GAAG,CAAC,CACzD,KAAK,IAAI;CACd;CAEF,MAAM,YAAY,UAAU,KAAA,KAAa,YAAY,KAAA;CACrD,MAAM,YAAY,UAAU,KAAA,KAAa,CAAC,WAAW,IAAI,KAAK;CAC9D,IAAI,SAAS,SAAS,aAAa,WACjC,OAAO;EACL,GAAG;EACH,MAAM;EACN,QAAQ,YAAY,MAAM,UAAU,SAAS,KAAK,EAAE,aAAa,SAAS,KAAK;CACjF;CAEF,IAAI,SAAS,WACX,OAAO;EACL,GAAG;EACH,MAAM;EACN,QAAQ,YAAY,MAAM,eAAe,SAAS,KAAK;CACzD;CAEF,IAAI,SAAS,WACX,OAAO;EACL,GAAG;EACH,MAAM;EACN,QAAQ,YAAY,MAAM,eAAe,SAAS,KAAK;CACzD;CAEF,OAAO;EACL,GAAG;EACH,MAAM;EACN,QAAQ,YAAY,MAAM,UAAU,SAAS,KAAM,EAAE,aAAa,SAAS,KAAM,EAAE;CACrF;AACF;AAEA,SAAS,UAAU,GAAa,GAAsB;CACpD,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE;AAC3C;AAEA,SAAS,mBAAmB,GAAa,GAAgC;CACvE,MAAM,cAAiC,CAAC;CACxC,IAAI,EAAE,SAAS,EAAE,MAAM,YAAY,KAAK;EAAE,OAAO;EAAQ,GAAG,EAAE;EAAM,GAAG,EAAE;CAAK,CAAC;CAC/E,IAAI,EAAE,SAAS,EAAE,MAAM,YAAY,KAAK;EAAE,OAAO;EAAQ,GAAG,EAAE;EAAM,GAAG,EAAE;CAAK,CAAC;CAC/E,MAAM,SAAS,CAAC,mBAAG,IAAI,IAAI,CAAC,GAAG,OAAO,KAAK,EAAE,MAAM,GAAG,GAAG,OAAO,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK;CACvF,KAAK,MAAM,SAAS,QAAQ;EAC1B,MAAM,OAAO,EAAE,OAAO,UAAU;EAChC,MAAM,QAAQ,EAAE,OAAO,UAAU;EACjC,IAAI,SAAS,OAAO,YAAY,KAAK;GAAE;GAAO,GAAG;GAAM,GAAG;EAAM,CAAC;CACnE;CACA,OAAO;AACT;AAEA,SAAS,SAAS,MAAwB;CACxC,OAAO,GAAG,KAAK,KAAK,IAAI,KAAK,KAAK;AACpC;AAiBA,eAAsB,oBACpB,OACA,MACA,MAC2B;CAC3B,MAAM,CAAC,GAAG,KAAK,MAAM,QAAQ,IAAI,CAAC,gBAAgB,OAAO,IAAI,GAAG,gBAAgB,OAAO,IAAI,CAAC,CAAC;CAC7F,MAAM,OAAO,UAAU,EAAE,MAAM,IAAI,kBAAkB,GAAG,EAAE,MAAM,IAAI,kBAAkB,CAAC;CACvF,MAAM,aAAa,KAAK;CACxB,OAAO;EACL;EACA;EACA,sBAAsB,YAAY,SAAS;EAC3C,GAAI,YAAY,KAAK,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,GAAG,IAAI,CAAC;EAChE,GAAI,YAAY,KAAK,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,GAAG,IAAI,CAAC;EAChE,GAAI,aAAa,EAAE,QAAQ,WAAW,OAAO,IAAI,CAAC;EAClD,iBAAiB,KAAK;EACtB;CACF;AACF;AAEA,SAAS,mBAAmB,MAAgC;CAC1D,MAAM,OAAa,KAAK;CACxB,MAAM,SAA2D,EAC/D,QAAQ,KAAK,UAAU,KACzB;CACA,IAAI,KAAK,SAAS,QAAQ,OAAO,OAAO,KAAK;CAC7C,IAAI,KAAK,SAAS,OAAO,OAAO,QAAQ,KAAK;CAC7C,IAAI,KAAK,SAAS,SAAS,OAAO,YAAY,KAAK;CACnD,OAAO;EAAE,IAAI,KAAK;EAAQ,MAAM,KAAK;EAAM,MAAM,KAAK;EAAM;CAAO;AACrE;;;;;;;AAUA,SAAgB,mBAAmB,OAA6C;CAC9E,MAAM,MAAM,IAAI,IAAI,MAAM,KAAK,SAAS,KAAK,MAAM,CAAC;CACpD,MAAM,2BAAW,IAAI,IAAoC;CACzD,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,SACJ,KAAK,iBAAiB,QAAQ,IAAI,IAAI,KAAK,YAAY,IAAI,KAAK,eAAe;EACjF,MAAM,OAAO,SAAS,IAAI,MAAM;EAChC,IAAI,MAAM,KAAK,KAAK,IAAI;OACnB,SAAS,IAAI,QAAQ,CAAC,IAAI,CAAC;CAClC;CACA,MAAM,WAAW,GAAkB,OAChC,EAAE,WAAW,MAAM,EAAE,WAAW,MAAM,EAAE,OAAO,cAAc,EAAE,MAAM;CACxE,KAAK,MAAM,QAAQ,SAAS,OAAO,GAAG,KAAK,KAAK,OAAO;CACvD,MAAM,UAAsB,CAAC;CAC7B,MAAM,0BAAU,IAAI,IAAY;CAChC,MAAM,SAAS,SAAwB;EACrC,IAAI,QAAQ,IAAI,KAAK,MAAM,GAAG;EAC9B,QAAQ,IAAI,KAAK,MAAM;EACvB,QAAQ,KAAK;GACX,IAAI,KAAK;GACT,MAAM,KAAK;GACX,MAAM,KAAK;GACX,QAAQ;IAAE,QAAQ,KAAK;IAAQ,MAAM,KAAK;IAAU,OAAO,KAAK;GAAM;EACxE,CAAC;EACD,KAAK,MAAM,SAAS,SAAS,IAAI,KAAK,MAAM,KAAK,CAAC,GAAG,MAAM,KAAK;CAClE;CACA,KAAK,MAAM,QAAQ,SAAS,IAAI,IAAI,KAAK,CAAC,GAAG,MAAM,IAAI;CACvD,KAAK,MAAM,QAAQ,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,OAAO,GAAG,MAAM,IAAI;CACvD,OAAO;AACT;;;;;;;;;;;AC7QA,eAAsB,eACpB,OACA,SACA,SACyB;CACzB,MAAM,eAAe,MAAM,MAAM,SAAS,QAAQ,QAAQ;CAC1D,MAAM,gBAAgB,MAAM,MAAM,SAAS,QAAQ,SAAS;CAS5D,OAAO,kBAAkB,MARH,QAAQ,IAC5B,QAAQ,IAAI,OAAO,MAAM;EACvB,MAAM,UAAU,EAAE,WAAW,mBAAmB,EAAE,MAAM;EACxD,MAAM,WAAW,MAAM,WAAW,cAAc,SAAS,KAAK;EAC9D,MAAM,YAAY,MAAM,WAAW,eAAe,SAAS,KAAK;EAChE,OAAO;GAAE,QAAQ,EAAE;GAAQ,gBAAgB,EAAE;GAAgB;GAAU;EAAU;CACnF,CAAC,CACH,GACkC,OAAO;AAC3C;AAEA,eAAe,WACb,MACA,SACA,OACmB;CACnB,MAAM,MAAgB,CAAC;CACvB,KAAK,MAAM,KAAK,MAAM;EACpB,MAAM,IAAI,MAAM,QAAQ,GAAG,KAAK;EAChC,IAAI,MAAM,QAAQ,OAAO,SAAS,CAAC,GAAG,IAAI,KAAK,CAAC;CAClD;CACA,OAAO;AACT;;;;;;;;;;;;ACzCA,MAAM,wBAAwB;AAC9B,MAAM,qCAAqC;AA8C3C,eAAsB,cACpB,OACA,UAA4B,CAAC,GACH;CAC1B,MAAM,iBAAiB,QAAQ,kBAAkB;CACjD,MAAM,cAAc,QAAQ,eAAe;CAC3C,MAAM,0BACJ,QAAQ,2BAA2B;CACrC,IAAI,CAAC,OAAO,UAAU,cAAc,KAAK,iBAAiB,GACxD,MAAM,IAAI,WAAW,2CAA2C;CAElE,IAAI,CAAC,OAAO,SAAS,WAAW,KAAK,cAAc,GACjD,MAAM,IAAI,WAAW,kDAAkD;CAEzE,IAAI,CAAC,OAAO,UAAU,uBAAuB,KAAK,0BAA0B,GAC1E,MAAM,IAAI,WAAW,wDAAwD;CAE/E,MAAM,OAAO,QAAQ,QACjB,CAAC,EAAE,OAAO,QAAQ,MAAM,CAAC,KACxB,MAAM,MAAM,SAAS,EAAA,CAAG,KAAK,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE;CAE5D,MAAM,WAA+B,CAAC;CACtC,KAAK,MAAM,EAAE,WAAW,MAAM;EAC5B,MAAM,QAAQ,MAAM,MAAM,MAAM,EAAE,MAAM,CAAC;EACzC,MAAM,YAAY,IAAI,IAAI,MAAM,KAAK,SAAS,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC;EAClE,MAAM,cAAgC,MACnC,OAAO,UAAU,CAAC,CAClB,KAAK,MAAM,iBAAiB;GAAE;GAAM;EAAY,EAAE,CAAC,CACnD,MAAM,GAAG,MAAM,EAAE,KAAK,YAAY,EAAE,KAAK,aAAa,EAAE,cAAc,EAAE,WAAW,CAAC,CACpF,KAAK,EAAE,YAAY;GAAE;GAAM,GAAG,eAAe,MAAM,SAAS;EAAE,EAAE;EACnE,MAAM,cAAc,qBAClB,YAAY,KAAK,SAAS;GAExB,MAAM,QADS,KAAK,eAAe,QAAQ,KAAK,eAAe,KAAK,cAEhE,KAAK,OACL,KAAK,aACH,UAAU,IAAI,KAAK,UAAU,IAC7B,KAAA;GACN,OAAO;IACL,KAAK,aAAa,IAAI;IACtB,UAAU,KAAK,UAAU,KAAK,WAAW;IACzC,OAAO,OAAO,aAAa;IAC3B,KAAK,OAAO,WAAW;GACzB;EACF,CAAC,CACH;EACA,MAAM,uCAAuB,IAAI,IAAoB;EACrD,MAAM,eAAkC,YAAY,KAAK,SAAS;GAChE,MAAM,UAAU,YAAY,IAAI,aAAa,IAAI,CAAC;GAClD,MAAM,gBAAgB,qBAAqB,IAAI,OAAO,KAAK;GAC3D,qBAAqB,IAAI,SAAS,gBAAgB,CAAC;GACnD,OAAO;IAAE,GAAG;IAAM;IAAe;GAAQ;EAC3C,CAAC;EACD,MAAM,wBAAQ,IAAI,IAQhB;EACF,KAAK,MAAM,QAAQ,cAAc;GAC/B,IAAI,CAAC,oBAAoB,KAAK,IAAI,GAAG;GACrC,MAAM,IAAI,QAAQ,KAAK,KAAK,IAAI;GAChC,MAAM,MAAM,KAAK,UAAU;IAAC,KAAK;IAAS,KAAK,KAAK;IAAU;GAAC,CAAC;GAChE,MAAM,SAAS,MAAM,IAAI,GAAG,KAAK;IAC/B,OAAO,CAAC;IACR,SAAS;IACT,UAAU,KAAK,KAAK;IACpB,aAAa,KAAK;GACpB;GACA,OAAO,MAAM,KAAK,IAAI;GACtB,MAAM,IAAI,KAAK,MAAM;EACvB;EACA,KAAK,MAAM,EAAE,OAAO,SAAS,GAAG,UAAU,iBAAiB,MAAM,OAAO,GAAG;GACzE,IAAI,MAAM,SAAS,gBAAgB;GACnC,IAAI,eAAe;GACnB,KAAK,IAAI,aAAa,GAAG,cAAc,MAAM,QAAQ,cAAc,GAAG;IACpE,MAAM,WAAW,MAAM,aAAa;IACpC,MAAM,OAAO,MAAM;IAMnB,IAAI,EAJF,SAAS,KAAA,KACT,KAAK,KAAK,YAAY,SAAS,KAAK,YAAY,eAChD,KAAK,gBAAgB,SAAS,gBAAgB,IAAI,2BAClD,CAAC,eAAe,UAAU,IAAI,IACb;IAEnB,MAAM,UAAU,MAAM,MAAM,cAAc,UAAU;IACpD,IAAI,OAAO;IACX,IAAI,YAAY;IAChB,IAAI,UAAU;IACd,KAAK,IAAI,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS,GAAG;KACtD,OAAO,QAAQ,MAAM,CAAE,KAAK,YAAY,QAAQ,KAAK,CAAE,KAAK,YAAY,aACtE,QAAQ;KAEV,IAAI,QAAQ,OAAO,UAAU,WAAW;MACtC,YAAY;MACZ,UAAU;KACZ;IACF;IACA,IAAI,UAAU,YAAY,KAAK,gBAAgB;KAC7C,MAAM,OAAO,QAAQ,MAAM,WAAW,UAAU,CAAC;KACjD,MAAM,QAAQ,KAAK,EAAE,CAAE,KAAK;KAC5B,MAAM,OAAO,KAAK,KAAK,SAAS,EAAE,CAAE,KAAK;KACzC,SAAS,KAAK;MACZ;MACA;MACA,SAAS;MACT,aAAa,KAAK;MAClB,SAAS,KAAK,KAAK,SAAS,KAAK,KAAK,MAAM;MAC5C,GAAI,cAAc,EAAE,YAAY,IAAI,CAAC;MACrC,UAAU,OAAO;KACnB,CAAC;IACH;IACA,eAAe;GACjB;EACF;CACF;CAEA,MAAM,eAAe,IAAI,IAAI,SAAS,KAAK,MAAM,EAAE,KAAK,CAAC;CACzD,OAAO;EACL;EACA,kBAAkB,KAAK,SAAS,IAAI,aAAa,OAAO,KAAK,SAAS;EACtE,WAAW,KAAK;CAClB;AACF;AAEA,SAAS,QAAQ,MAAkE;CACjF,OAAO,KAAK,UAAU,CAAC,KAAK,aAAa,KAAK,UAAU,CAAC;AAC3D;AAEA,SAAS,aAAa,MAA8B;CAClD,OAAO,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;CAC3D,MAAM,eAAe,KAAK;CAC1B,IAAI,CAAC,cAAc,OAAO;EAAE,aAAa;EAAM,YAAY;CAAK;CAEhE,IAAI,YAAgC;CACpC,IAAI,aAA4B;CAChC,MAAM,uBAAO,IAAI,IAAY;CAC7B,OAAO,aAAa,CAAC,KAAK,IAAI,SAAS,GAAG;EACxC,KAAK,IAAI,SAAS;EAClB,MAAM,UAAU,UAAU,IAAI,SAAS;EACvC,IAAI,CAAC,SAAS,OAAO;GAAE,aAAa;GAAc,YAAY;EAAa;EAC3E,IAAI,QAAQ,SAAS,SACnB,OAAO;GAAE,aAAa,QAAQ;GAAQ,YAAY,cAAc,QAAQ;EAAO;EAEjF,aAAa,QAAQ;EACrB,YAAY,QAAQ;CACtB;CACA,OAAO;EAAE,aAAa;EAAc,YAAY;CAAa;AAC/D;AAEA,SAAS,eAAe,UAA2B,MAAgC;CACjF,OAAO,SAAS,KAAK,YAAY,KAAA,KAAa,SAAS,KAAK,WAAW,KAAK,KAAK;AACnF"}
+{"version":3,"file":"index.js","names":[],"sources":["../../src/pipelines/first-divergence.ts","../../src/pipelines/regression.ts","../../src/pipelines/stuck-loop.ts"],"sourcesContent":["/**\n * Step diff between two runs, with the first divergence marked.\n *\n * Steps pair in three passes, each over the steps still unpaired:\n *   1. `id`: the same step id in both runs, e.g. a forked run that kept its\n *      parent's span ids.\n *   2. `position`: the same index with the same name and kind.\n *   3. `name`: the same name and kind anywhere, first unpaired step in order.\n * A step left unpaired exists in only one run. The first divergence is the\n * first index at which the two runs stop agreeing step for step, and it says\n * how: a paired step changed, one run replaced, added or removed a step, or the\n * runs ran the same steps in a different order.\n *\n * `diffSteps` reads plain `DiffStep` lists, so the same diff serves agent-eval\n * trace stores (`firstDivergenceView`) and flat OTLP spans\n * (`diffStepsFromSpans`). Use it to attribute \"why is variant B better?\" to a\n * step, and to compare sibling or parent and child runs of a search tree.\n */\n\nimport type { DiagnosisSpan } from '../diagnosis/spans'\nimport type { Span } from '../trace/schema'\nimport type { TraceStore } from '../trace/store'\nimport { buildTrajectory, type TrajectoryStep } from '../trajectory'\n\n/** One step of a run, as the diff reads it. */\nexport interface DiffStep {\n  /** The step's id within its run. */\n  id: string\n  name: string\n  kind: string\n  /** Fields compared once two steps pair, such as status, tool or model. */\n  fields: Readonly<Record<string, string | number | boolean | null>>\n}\n\nexport type StepPairing = 'id' | 'position' | 'name'\n\nexport interface FieldDifference {\n  field: string\n  a: string | number | boolean | null\n  b: string | number | boolean | null\n}\n\nexport interface StepPair {\n  /** Index in run A. */\n  a: number\n  /** Index in run B. */\n  b: number\n  pairedBy: StepPairing\n  /** Empty when the paired steps agree on name, kind and every field. */\n  differences: FieldDifference[]\n}\n\nexport type StepDivergenceKind = 'changed' | 'replaced' | 'only-in-a' | 'only-in-b' | 'reordered'\n\nexport interface StepDivergence {\n  /** The first index at which the runs stop agreeing; equals `commonPrefixLen`. */\n  index: number\n  kind: StepDivergenceKind\n  /** Index of the step at `index` in each run, or null when that run has ended. */\n  a: number | null\n  b: number | null\n  /** Set when `kind` is `changed`. */\n  differences: FieldDifference[]\n  reason: string\n}\n\nexport interface StepDiff {\n  /** Paired steps in run A order. */\n  pairs: StepPair[]\n  /** Indexes of run A steps with no partner in run B. */\n  onlyInA: number[]\n  /** Indexes of run B steps with no partner in run A. */\n  onlyInB: number[]\n  /** Leading steps paired index for index with no difference. */\n  commonPrefixLen: number\n  /** Null when the runs agree step for step. */\n  firstDivergence: StepDivergence | null\n}\n\nexport function diffSteps(a: readonly DiffStep[], b: readonly DiffStep[]): StepDiff {\n  const partnerOfA = new Map<number, { b: number; pairedBy: StepPairing }>()\n  const pairedB = new Set<number>()\n  const pair = (i: number, j: number, pairedBy: StepPairing) => {\n    partnerOfA.set(i, { b: j, pairedBy })\n    pairedB.add(j)\n  }\n\n  const bById = new Map<string, number[]>()\n  b.forEach((step, j) => {\n    const list = bById.get(step.id)\n    if (list) list.push(j)\n    else bById.set(step.id, [j])\n  })\n  a.forEach((step, i) => {\n    const j = bById.get(step.id)?.find((candidate) => !pairedB.has(candidate))\n    if (j !== undefined) pair(i, j, 'id')\n  })\n  a.forEach((step, i) => {\n    if (partnerOfA.has(i) || i >= b.length || pairedB.has(i)) return\n    if (sameShape(step, b[i]!)) pair(i, i, 'position')\n  })\n  a.forEach((step, i) => {\n    if (partnerOfA.has(i)) return\n    const j = b.findIndex((candidate, index) => !pairedB.has(index) && sameShape(step, candidate))\n    if (j >= 0) pair(i, j, 'name')\n  })\n\n  const pairs: StepPair[] = [...partnerOfA.entries()]\n    .sort(([x], [y]) => x - y)\n    .map(([i, partner]) => ({\n      a: i,\n      b: partner.b,\n      pairedBy: partner.pairedBy,\n      differences: differencesBetween(a[i]!, b[partner.b]!),\n    }))\n  const pairByA = new Map(pairs.map((entry) => [entry.a, entry]))\n  const partnerOfB = new Map(pairs.map((entry) => [entry.b, entry.a]))\n\n  let prefix = 0\n  while (prefix < a.length && prefix < b.length) {\n    const entry = pairByA.get(prefix)\n    if (!entry || entry.b !== prefix || entry.differences.length > 0) break\n    prefix += 1\n  }\n\n  return {\n    pairs,\n    onlyInA: a.map((_, i) => i).filter((i) => !partnerOfA.has(i)),\n    onlyInB: b.map((_, j) => j).filter((j) => !pairedB.has(j)),\n    commonPrefixLen: prefix,\n    firstDivergence:\n      prefix === a.length && prefix === b.length\n        ? null\n        : divergenceAt(prefix, a, b, pairByA.get(prefix), partnerOfB),\n  }\n}\n\nfunction divergenceAt(\n  index: number,\n  a: readonly DiffStep[],\n  b: readonly DiffStep[],\n  pairOfA: StepPair | undefined,\n  partnerOfB: ReadonlyMap<number, number>,\n): StepDivergence {\n  const stepA = a[index]\n  const stepB = b[index]\n  const base = {\n    index,\n    a: stepA ? index : null,\n    b: stepB ? index : null,\n    differences: [] as FieldDifference[],\n  }\n  if (stepA && stepB && pairOfA?.b === index) {\n    return {\n      ...base,\n      kind: 'changed',\n      differences: pairOfA.differences,\n      reason: `at index ${index}, ${describe(stepA)} changed: ${pairOfA.differences\n        .map((d) => `${d.field} ${String(d.a)} vs ${String(d.b)}`)\n        .join('; ')}`,\n    }\n  }\n  const aUnpaired = stepA !== undefined && pairOfA === undefined\n  const bUnpaired = stepB !== undefined && !partnerOfB.has(index)\n  if (stepA && stepB && aUnpaired && bUnpaired) {\n    return {\n      ...base,\n      kind: 'replaced',\n      reason: `at index ${index}, A ran ${describe(stepA)} and B ran ${describe(stepB)}`,\n    }\n  }\n  if (stepA && aUnpaired) {\n    return {\n      ...base,\n      kind: 'only-in-a',\n      reason: `at index ${index}, only A has ${describe(stepA)}`,\n    }\n  }\n  if (stepB && bUnpaired) {\n    return {\n      ...base,\n      kind: 'only-in-b',\n      reason: `at index ${index}, only B has ${describe(stepB)}`,\n    }\n  }\n  return {\n    ...base,\n    kind: 'reordered',\n    reason: `at index ${index}, A ran ${describe(stepA!)} and B ran ${describe(stepB!)}; both steps occur in the other run at a different position`,\n  }\n}\n\nfunction sameShape(x: DiffStep, y: DiffStep): boolean {\n  return x.name === y.name && x.kind === y.kind\n}\n\nfunction differencesBetween(x: DiffStep, y: DiffStep): FieldDifference[] {\n  const differences: FieldDifference[] = []\n  if (x.kind !== y.kind) differences.push({ field: 'kind', a: x.kind, b: y.kind })\n  if (x.name !== y.name) differences.push({ field: 'name', a: x.name, b: y.name })\n  const fields = [...new Set([...Object.keys(x.fields), ...Object.keys(y.fields)])].sort()\n  for (const field of fields) {\n    const left = x.fields[field] ?? null\n    const right = y.fields[field] ?? null\n    if (left !== right) differences.push({ field, a: left, b: right })\n  }\n  return differences\n}\n\nfunction describe(step: DiffStep): string {\n  return `${step.kind} \"${step.name}\"`\n}\n\n// ── agent-eval trace store ────────────────────────────────────────────\n\nexport interface DivergenceReport {\n  runA: string\n  runB: string\n  /** Null when the runs agree step for step. */\n  firstDivergenceIndex: number | null\n  aStep?: TrajectoryStep\n  bStep?: TrajectoryStep\n  reason?: string\n  commonPrefixLen: number\n  /** The step diff behind the first divergence, over trajectory step indexes. */\n  diff: StepDiff\n}\n\nexport async function firstDivergenceView(\n  store: TraceStore,\n  runA: string,\n  runB: string,\n): Promise<DivergenceReport> {\n  const [a, b] = await Promise.all([buildTrajectory(store, runA), buildTrajectory(store, runB)])\n  const diff = diffSteps(a.steps.map(trajectoryDiffStep), b.steps.map(trajectoryDiffStep))\n  const divergence = diff.firstDivergence\n  return {\n    runA,\n    runB,\n    firstDivergenceIndex: divergence?.index ?? null,\n    ...(divergence?.a != null ? { aStep: a.steps[divergence.a] } : {}),\n    ...(divergence?.b != null ? { bStep: b.steps[divergence.b] } : {}),\n    ...(divergence ? { reason: divergence.reason } : {}),\n    commonPrefixLen: diff.commonPrefixLen,\n    diff,\n  }\n}\n\nfunction trajectoryDiffStep(step: TrajectoryStep): DiffStep {\n  const span: Span = step.span\n  const fields: Record<string, string | number | boolean | null> = {\n    status: span.status ?? null,\n  }\n  if (span.kind === 'tool') fields.tool = span.toolName\n  if (span.kind === 'llm') fields.model = span.model\n  if (span.kind === 'judge') fields.dimension = span.dimension\n  return { id: span.spanId, name: span.name, kind: span.kind, fields }\n}\n\n// ── flat OTLP spans ───────────────────────────────────────────────────\n\n/**\n * One run's spans as diff steps, in containment order: depth first, siblings\n * by start time, the same order `buildTrajectory` gives a trace store run.\n * Spans whose parent is absent, or whose parents form a cycle, start their own\n * subtree, so every span appears exactly once.\n */\nexport function diffStepsFromSpans(spans: readonly DiagnosisSpan[]): DiffStep[] {\n  const ids = new Set(spans.map((span) => span.spanId))\n  const children = new Map<string | null, DiagnosisSpan[]>()\n  for (const span of spans) {\n    const parent =\n      span.parentSpanId !== null && ids.has(span.parentSpanId) ? span.parentSpanId : null\n    const list = children.get(parent)\n    if (list) list.push(span)\n    else children.set(parent, [span])\n  }\n  // Span ids are random per run, so two runs of the same logical trace can carry\n  // different ids for \"the same\" span. Siblings that share a start time (a common\n  // case: parallel steps a driver starts together) must still sort the same way\n  // in both runs, or the diff below reports a false `reordered` divergence purely\n  // from spanId noise. End time, kind and name are content, not per-run identity,\n  // so they break the tie before spanId, which is the last resort.\n  const byStart = (x: DiagnosisSpan, y: DiagnosisSpan) =>\n    (x.startMs ?? 0) - (y.startMs ?? 0) ||\n    (x.endMs ?? 0) - (y.endMs ?? 0) ||\n    x.kind.localeCompare(y.kind) ||\n    x.name.localeCompare(y.name) ||\n    x.spanId.localeCompare(y.spanId)\n  for (const list of children.values()) list.sort(byStart)\n  const ordered: DiffStep[] = []\n  const visited = new Set<string>()\n  const visit = (span: DiagnosisSpan) => {\n    if (visited.has(span.spanId)) return\n    visited.add(span.spanId)\n    ordered.push({\n      id: span.spanId,\n      name: span.name,\n      kind: span.kind,\n      fields: { status: span.status, tool: span.toolName, model: span.model },\n    })\n    for (const child of children.get(span.spanId) ?? []) visit(child)\n  }\n  for (const root of children.get(null) ?? []) visit(root)\n  for (const span of [...spans].sort(byStart)) visit(span)\n  return ordered\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 { runMetricExtractor } 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. Omit it and `metric` must name one of\n   *  `RUN_METRICS`; any other name is refused. */\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 ?? runMetricExtractor(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","/**\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"],"mappings":";;;;;;;AA+EA,SAAgB,UAAU,GAAwB,GAAkC;CAClF,MAAM,6BAAa,IAAI,IAAkD;CACzE,MAAM,0BAAU,IAAI,IAAY;CAChC,MAAM,QAAQ,GAAW,GAAW,aAA0B;EAC5D,WAAW,IAAI,GAAG;GAAE,GAAG;GAAG;EAAS,CAAC;EACpC,QAAQ,IAAI,CAAC;CACf;CAEA,MAAM,wBAAQ,IAAI,IAAsB;CACxC,EAAE,SAAS,MAAM,MAAM;EACrB,MAAM,OAAO,MAAM,IAAI,KAAK,EAAE;EAC9B,IAAI,MAAM,KAAK,KAAK,CAAC;OAChB,MAAM,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC;CAC7B,CAAC;CACD,EAAE,SAAS,MAAM,MAAM;EACrB,MAAM,IAAI,MAAM,IAAI,KAAK,EAAE,CAAC,EAAE,MAAM,cAAc,CAAC,QAAQ,IAAI,SAAS,CAAC;EACzE,IAAI,MAAM,KAAA,GAAW,KAAK,GAAG,GAAG,IAAI;CACtC,CAAC;CACD,EAAE,SAAS,MAAM,MAAM;EACrB,IAAI,WAAW,IAAI,CAAC,KAAK,KAAK,EAAE,UAAU,QAAQ,IAAI,CAAC,GAAG;EAC1D,IAAI,UAAU,MAAM,EAAE,EAAG,GAAG,KAAK,GAAG,GAAG,UAAU;CACnD,CAAC;CACD,EAAE,SAAS,MAAM,MAAM;EACrB,IAAI,WAAW,IAAI,CAAC,GAAG;EACvB,MAAM,IAAI,EAAE,WAAW,WAAW,UAAU,CAAC,QAAQ,IAAI,KAAK,KAAK,UAAU,MAAM,SAAS,CAAC;EAC7F,IAAI,KAAK,GAAG,KAAK,GAAG,GAAG,MAAM;CAC/B,CAAC;CAED,MAAM,QAAoB,CAAC,GAAG,WAAW,QAAQ,CAAC,CAAC,CAChD,MAAM,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC,CACzB,KAAK,CAAC,GAAG,cAAc;EACtB,GAAG;EACH,GAAG,QAAQ;EACX,UAAU,QAAQ;EAClB,aAAa,mBAAmB,EAAE,IAAK,EAAE,QAAQ,EAAG;CACtD,EAAE;CACJ,MAAM,UAAU,IAAI,IAAI,MAAM,KAAK,UAAU,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;CAC9D,MAAM,aAAa,IAAI,IAAI,MAAM,KAAK,UAAU,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC;CAEnE,IAAI,SAAS;CACb,OAAO,SAAS,EAAE,UAAU,SAAS,EAAE,QAAQ;EAC7C,MAAM,QAAQ,QAAQ,IAAI,MAAM;EAChC,IAAI,CAAC,SAAS,MAAM,MAAM,UAAU,MAAM,YAAY,SAAS,GAAG;EAClE,UAAU;CACZ;CAEA,OAAO;EACL;EACA,SAAS,EAAE,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,QAAQ,MAAM,CAAC,WAAW,IAAI,CAAC,CAAC;EAC5D,SAAS,EAAE,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,QAAQ,MAAM,CAAC,QAAQ,IAAI,CAAC,CAAC;EACzD,iBAAiB;EACjB,iBACE,WAAW,EAAE,UAAU,WAAW,EAAE,SAChC,OACA,aAAa,QAAQ,GAAG,GAAG,QAAQ,IAAI,MAAM,GAAG,UAAU;CAClE;AACF;AAEA,SAAS,aACP,OACA,GACA,GACA,SACA,YACgB;CAChB,MAAM,QAAQ,EAAE;CAChB,MAAM,QAAQ,EAAE;CAChB,MAAM,OAAO;EACX;EACA,GAAG,QAAQ,QAAQ;EACnB,GAAG,QAAQ,QAAQ;EACnB,aAAa,CAAC;CAChB;CACA,IAAI,SAAS,SAAS,SAAS,MAAM,OACnC,OAAO;EACL,GAAG;EACH,MAAM;EACN,aAAa,QAAQ;EACrB,QAAQ,YAAY,MAAM,IAAI,SAAS,KAAK,EAAE,YAAY,QAAQ,YAC/D,KAAK,MAAM,GAAG,EAAE,MAAM,GAAG,OAAO,EAAE,CAAC,EAAE,MAAM,OAAO,EAAE,CAAC,GAAG,CAAC,CACzD,KAAK,IAAI;CACd;CAEF,MAAM,YAAY,UAAU,KAAA,KAAa,YAAY,KAAA;CACrD,MAAM,YAAY,UAAU,KAAA,KAAa,CAAC,WAAW,IAAI,KAAK;CAC9D,IAAI,SAAS,SAAS,aAAa,WACjC,OAAO;EACL,GAAG;EACH,MAAM;EACN,QAAQ,YAAY,MAAM,UAAU,SAAS,KAAK,EAAE,aAAa,SAAS,KAAK;CACjF;CAEF,IAAI,SAAS,WACX,OAAO;EACL,GAAG;EACH,MAAM;EACN,QAAQ,YAAY,MAAM,eAAe,SAAS,KAAK;CACzD;CAEF,IAAI,SAAS,WACX,OAAO;EACL,GAAG;EACH,MAAM;EACN,QAAQ,YAAY,MAAM,eAAe,SAAS,KAAK;CACzD;CAEF,OAAO;EACL,GAAG;EACH,MAAM;EACN,QAAQ,YAAY,MAAM,UAAU,SAAS,KAAM,EAAE,aAAa,SAAS,KAAM,EAAE;CACrF;AACF;AAEA,SAAS,UAAU,GAAa,GAAsB;CACpD,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE;AAC3C;AAEA,SAAS,mBAAmB,GAAa,GAAgC;CACvE,MAAM,cAAiC,CAAC;CACxC,IAAI,EAAE,SAAS,EAAE,MAAM,YAAY,KAAK;EAAE,OAAO;EAAQ,GAAG,EAAE;EAAM,GAAG,EAAE;CAAK,CAAC;CAC/E,IAAI,EAAE,SAAS,EAAE,MAAM,YAAY,KAAK;EAAE,OAAO;EAAQ,GAAG,EAAE;EAAM,GAAG,EAAE;CAAK,CAAC;CAC/E,MAAM,SAAS,CAAC,mBAAG,IAAI,IAAI,CAAC,GAAG,OAAO,KAAK,EAAE,MAAM,GAAG,GAAG,OAAO,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK;CACvF,KAAK,MAAM,SAAS,QAAQ;EAC1B,MAAM,OAAO,EAAE,OAAO,UAAU;EAChC,MAAM,QAAQ,EAAE,OAAO,UAAU;EACjC,IAAI,SAAS,OAAO,YAAY,KAAK;GAAE;GAAO,GAAG;GAAM,GAAG;EAAM,CAAC;CACnE;CACA,OAAO;AACT;AAEA,SAAS,SAAS,MAAwB;CACxC,OAAO,GAAG,KAAK,KAAK,IAAI,KAAK,KAAK;AACpC;AAiBA,eAAsB,oBACpB,OACA,MACA,MAC2B;CAC3B,MAAM,CAAC,GAAG,KAAK,MAAM,QAAQ,IAAI,CAAC,gBAAgB,OAAO,IAAI,GAAG,gBAAgB,OAAO,IAAI,CAAC,CAAC;CAC7F,MAAM,OAAO,UAAU,EAAE,MAAM,IAAI,kBAAkB,GAAG,EAAE,MAAM,IAAI,kBAAkB,CAAC;CACvF,MAAM,aAAa,KAAK;CACxB,OAAO;EACL;EACA;EACA,sBAAsB,YAAY,SAAS;EAC3C,GAAI,YAAY,KAAK,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,GAAG,IAAI,CAAC;EAChE,GAAI,YAAY,KAAK,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,GAAG,IAAI,CAAC;EAChE,GAAI,aAAa,EAAE,QAAQ,WAAW,OAAO,IAAI,CAAC;EAClD,iBAAiB,KAAK;EACtB;CACF;AACF;AAEA,SAAS,mBAAmB,MAAgC;CAC1D,MAAM,OAAa,KAAK;CACxB,MAAM,SAA2D,EAC/D,QAAQ,KAAK,UAAU,KACzB;CACA,IAAI,KAAK,SAAS,QAAQ,OAAO,OAAO,KAAK;CAC7C,IAAI,KAAK,SAAS,OAAO,OAAO,QAAQ,KAAK;CAC7C,IAAI,KAAK,SAAS,SAAS,OAAO,YAAY,KAAK;CACnD,OAAO;EAAE,IAAI,KAAK;EAAQ,MAAM,KAAK;EAAM,MAAM,KAAK;EAAM;CAAO;AACrE;;;;;;;AAUA,SAAgB,mBAAmB,OAA6C;CAC9E,MAAM,MAAM,IAAI,IAAI,MAAM,KAAK,SAAS,KAAK,MAAM,CAAC;CACpD,MAAM,2BAAW,IAAI,IAAoC;CACzD,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,SACJ,KAAK,iBAAiB,QAAQ,IAAI,IAAI,KAAK,YAAY,IAAI,KAAK,eAAe;EACjF,MAAM,OAAO,SAAS,IAAI,MAAM;EAChC,IAAI,MAAM,KAAK,KAAK,IAAI;OACnB,SAAS,IAAI,QAAQ,CAAC,IAAI,CAAC;CAClC;CAOA,MAAM,WAAW,GAAkB,OAChC,EAAE,WAAW,MAAM,EAAE,WAAW,OAChC,EAAE,SAAS,MAAM,EAAE,SAAS,MAC7B,EAAE,KAAK,cAAc,EAAE,IAAI,KAC3B,EAAE,KAAK,cAAc,EAAE,IAAI,KAC3B,EAAE,OAAO,cAAc,EAAE,MAAM;CACjC,KAAK,MAAM,QAAQ,SAAS,OAAO,GAAG,KAAK,KAAK,OAAO;CACvD,MAAM,UAAsB,CAAC;CAC7B,MAAM,0BAAU,IAAI,IAAY;CAChC,MAAM,SAAS,SAAwB;EACrC,IAAI,QAAQ,IAAI,KAAK,MAAM,GAAG;EAC9B,QAAQ,IAAI,KAAK,MAAM;EACvB,QAAQ,KAAK;GACX,IAAI,KAAK;GACT,MAAM,KAAK;GACX,MAAM,KAAK;GACX,QAAQ;IAAE,QAAQ,KAAK;IAAQ,MAAM,KAAK;IAAU,OAAO,KAAK;GAAM;EACxE,CAAC;EACD,KAAK,MAAM,SAAS,SAAS,IAAI,KAAK,MAAM,KAAK,CAAC,GAAG,MAAM,KAAK;CAClE;CACA,KAAK,MAAM,QAAQ,SAAS,IAAI,IAAI,KAAK,CAAC,GAAG,MAAM,IAAI;CACvD,KAAK,MAAM,QAAQ,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,OAAO,GAAG,MAAM,IAAI;CACvD,OAAO;AACT;;;;;;;;;;;ACvRA,eAAsB,eACpB,OACA,SACA,SACyB;CACzB,MAAM,eAAe,MAAM,MAAM,SAAS,QAAQ,QAAQ;CAC1D,MAAM,gBAAgB,MAAM,MAAM,SAAS,QAAQ,SAAS;CAS5D,OAAO,kBAAkB,MARH,QAAQ,IAC5B,QAAQ,IAAI,OAAO,MAAM;EACvB,MAAM,UAAU,EAAE,WAAW,mBAAmB,EAAE,MAAM;EACxD,MAAM,WAAW,MAAM,WAAW,cAAc,SAAS,KAAK;EAC9D,MAAM,YAAY,MAAM,WAAW,eAAe,SAAS,KAAK;EAChE,OAAO;GAAE,QAAQ,EAAE;GAAQ,gBAAgB,EAAE;GAAgB;GAAU;EAAU;CACnF,CAAC,CACH,GACkC,OAAO;AAC3C;AAEA,eAAe,WACb,MACA,SACA,OACmB;CACnB,MAAM,MAAgB,CAAC;CACvB,KAAK,MAAM,KAAK,MAAM;EACpB,MAAM,IAAI,MAAM,QAAQ,GAAG,KAAK;EAChC,IAAI,MAAM,QAAQ,OAAO,SAAS,CAAC,GAAG,IAAI,KAAK,CAAC;CAClD;CACA,OAAO;AACT;;;;;;;;;;;;ACzCA,MAAM,wBAAwB;AAC9B,MAAM,qCAAqC;AA8C3C,eAAsB,cACpB,OACA,UAA4B,CAAC,GACH;CAC1B,MAAM,iBAAiB,QAAQ,kBAAkB;CACjD,MAAM,cAAc,QAAQ,eAAe;CAC3C,MAAM,0BACJ,QAAQ,2BAA2B;CACrC,IAAI,CAAC,OAAO,UAAU,cAAc,KAAK,iBAAiB,GACxD,MAAM,IAAI,WAAW,2CAA2C;CAElE,IAAI,CAAC,OAAO,SAAS,WAAW,KAAK,cAAc,GACjD,MAAM,IAAI,WAAW,kDAAkD;CAEzE,IAAI,CAAC,OAAO,UAAU,uBAAuB,KAAK,0BAA0B,GAC1E,MAAM,IAAI,WAAW,wDAAwD;CAE/E,MAAM,OAAO,QAAQ,QACjB,CAAC,EAAE,OAAO,QAAQ,MAAM,CAAC,KACxB,MAAM,MAAM,SAAS,EAAA,CAAG,KAAK,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE;CAE5D,MAAM,WAA+B,CAAC;CACtC,KAAK,MAAM,EAAE,WAAW,MAAM;EAC5B,MAAM,QAAQ,MAAM,MAAM,MAAM,EAAE,MAAM,CAAC;EACzC,MAAM,YAAY,IAAI,IAAI,MAAM,KAAK,SAAS,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC;EAClE,MAAM,cAAgC,MACnC,OAAO,UAAU,CAAC,CAClB,KAAK,MAAM,iBAAiB;GAAE;GAAM;EAAY,EAAE,CAAC,CACnD,MAAM,GAAG,MAAM,EAAE,KAAK,YAAY,EAAE,KAAK,aAAa,EAAE,cAAc,EAAE,WAAW,CAAC,CACpF,KAAK,EAAE,YAAY;GAAE;GAAM,GAAG,eAAe,MAAM,SAAS;EAAE,EAAE;EACnE,MAAM,cAAc,qBAClB,YAAY,KAAK,SAAS;GAExB,MAAM,QADS,KAAK,eAAe,QAAQ,KAAK,eAAe,KAAK,cAEhE,KAAK,OACL,KAAK,aACH,UAAU,IAAI,KAAK,UAAU,IAC7B,KAAA;GACN,OAAO;IACL,KAAK,aAAa,IAAI;IACtB,UAAU,KAAK,UAAU,KAAK,WAAW;IACzC,OAAO,OAAO,aAAa;IAC3B,KAAK,OAAO,WAAW;GACzB;EACF,CAAC,CACH;EACA,MAAM,uCAAuB,IAAI,IAAoB;EACrD,MAAM,eAAkC,YAAY,KAAK,SAAS;GAChE,MAAM,UAAU,YAAY,IAAI,aAAa,IAAI,CAAC;GAClD,MAAM,gBAAgB,qBAAqB,IAAI,OAAO,KAAK;GAC3D,qBAAqB,IAAI,SAAS,gBAAgB,CAAC;GACnD,OAAO;IAAE,GAAG;IAAM;IAAe;GAAQ;EAC3C,CAAC;EACD,MAAM,wBAAQ,IAAI,IAQhB;EACF,KAAK,MAAM,QAAQ,cAAc;GAC/B,IAAI,CAAC,oBAAoB,KAAK,IAAI,GAAG;GACrC,MAAM,IAAI,QAAQ,KAAK,KAAK,IAAI;GAChC,MAAM,MAAM,KAAK,UAAU;IAAC,KAAK;IAAS,KAAK,KAAK;IAAU;GAAC,CAAC;GAChE,MAAM,SAAS,MAAM,IAAI,GAAG,KAAK;IAC/B,OAAO,CAAC;IACR,SAAS;IACT,UAAU,KAAK,KAAK;IACpB,aAAa,KAAK;GACpB;GACA,OAAO,MAAM,KAAK,IAAI;GACtB,MAAM,IAAI,KAAK,MAAM;EACvB;EACA,KAAK,MAAM,EAAE,OAAO,SAAS,GAAG,UAAU,iBAAiB,MAAM,OAAO,GAAG;GACzE,IAAI,MAAM,SAAS,gBAAgB;GACnC,IAAI,eAAe;GACnB,KAAK,IAAI,aAAa,GAAG,cAAc,MAAM,QAAQ,cAAc,GAAG;IACpE,MAAM,WAAW,MAAM,aAAa;IACpC,MAAM,OAAO,MAAM;IAMnB,IAAI,EAJF,SAAS,KAAA,KACT,KAAK,KAAK,YAAY,SAAS,KAAK,YAAY,eAChD,KAAK,gBAAgB,SAAS,gBAAgB,IAAI,2BAClD,CAAC,eAAe,UAAU,IAAI,IACb;IAEnB,MAAM,UAAU,MAAM,MAAM,cAAc,UAAU;IACpD,IAAI,OAAO;IACX,IAAI,YAAY;IAChB,IAAI,UAAU;IACd,KAAK,IAAI,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS,GAAG;KACtD,OAAO,QAAQ,MAAM,CAAE,KAAK,YAAY,QAAQ,KAAK,CAAE,KAAK,YAAY,aACtE,QAAQ;KAEV,IAAI,QAAQ,OAAO,UAAU,WAAW;MACtC,YAAY;MACZ,UAAU;KACZ;IACF;IACA,IAAI,UAAU,YAAY,KAAK,gBAAgB;KAC7C,MAAM,OAAO,QAAQ,MAAM,WAAW,UAAU,CAAC;KACjD,MAAM,QAAQ,KAAK,EAAE,CAAE,KAAK;KAC5B,MAAM,OAAO,KAAK,KAAK,SAAS,EAAE,CAAE,KAAK;KACzC,SAAS,KAAK;MACZ;MACA;MACA,SAAS;MACT,aAAa,KAAK;MAClB,SAAS,KAAK,KAAK,SAAS,KAAK,KAAK,MAAM;MAC5C,GAAI,cAAc,EAAE,YAAY,IAAI,CAAC;MACrC,UAAU,OAAO;KACnB,CAAC;IACH;IACA,eAAe;GACjB;EACF;CACF;CAEA,MAAM,eAAe,IAAI,IAAI,SAAS,KAAK,MAAM,EAAE,KAAK,CAAC;CACzD,OAAO;EACL;EACA,kBAAkB,KAAK,SAAS,IAAI,aAAa,OAAO,KAAK,SAAS;EACtE,WAAW,KAAK;CAClB;AACF;AAEA,SAAS,QAAQ,MAAkE;CACjF,OAAO,KAAK,UAAU,CAAC,KAAK,aAAa,KAAK,UAAU,CAAC;AAC3D;AAEA,SAAS,aAAa,MAA8B;CAClD,OAAO,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;CAC3D,MAAM,eAAe,KAAK;CAC1B,IAAI,CAAC,cAAc,OAAO;EAAE,aAAa;EAAM,YAAY;CAAK;CAEhE,IAAI,YAAgC;CACpC,IAAI,aAA4B;CAChC,MAAM,uBAAO,IAAI,IAAY;CAC7B,OAAO,aAAa,CAAC,KAAK,IAAI,SAAS,GAAG;EACxC,KAAK,IAAI,SAAS;EAClB,MAAM,UAAU,UAAU,IAAI,SAAS;EACvC,IAAI,CAAC,SAAS,OAAO;GAAE,aAAa;GAAc,YAAY;EAAa;EAC3E,IAAI,QAAQ,SAAS,SACnB,OAAO;GAAE,aAAa,QAAQ;GAAQ,YAAY,cAAc,QAAQ;EAAO;EAEjF,aAAa,QAAQ;EACrB,YAAY,QAAQ;CACtB;CACA,OAAO;EAAE,aAAa;EAAc,YAAY;CAAa;AAC/D;AAEA,SAAS,eAAe,UAA2B,MAAgC;CACjF,OAAO,SAAS,KAAK,YAAY,KAAA,KAAa,SAAS,KAAK,WAAW,KAAK,KAAK;AACnF"}

package/dist/{prime-protocol-Fwvctmhm.d.ts → prime-protocol-T0i6xcAs.d.ts}

@@ -1,5 +1,5 @@
 import { b as CustomTokenPricing } from "./cost-ledger-DbQdN3nO.js";
-import { f as AnalystUsageReceipt } from "./types-Bay1dh2o.js";
+import { f as AnalystUsageReceipt } from "./types-CeDfCRXp.js";
 import { t as PrimeBridgeTransport } from "./prime-bridge-transport-6feEglLf.js";
 //#region src/analyst/reply-contract.d.ts
 /**
@@ -328,4 +328,4 @@ interface PrimeProtocolIdentity {
 declare function primeProtocolSha256(identity: PrimeProtocolIdentity): string;
 //#endregion
 export { ReplyRowDecoded as A, primeProtocolSha256 as C, DecodedReply as D, runPrimeExchange as E, decodeReplyRows as M, ReplyContract as O, normalizePrimeUsage as S, projectPrimeTrajectory as T, buildPrimePrompt as _, PrimeProjectionOutcome as a, extractPrimeJsonObject as b, PrimeProtocolIdentity as c, PrimeRepairPromptSpec as d, PrimeRepairState as f, analystUsageReceiptFromPrimeUsage as g, PrimeTurnRecord as h, PrimeProjectionDelivery as i, ReplyRowRejection as j, ReplyEnvelope as k, PrimeRawUsage as l, PrimeRowDecoded as m, PrimeExchangeOutcome as n, PrimeProjectionSource as o, PrimeReplyContract as p, PrimeFailure as r, PrimePromptSpec as s, PrimeExchangeOptions as t, PrimeRejectedRow as u, buildPrimeRepairPrompt as v, primeReplyDefect as w, mergePrimeRawUsage as x, emptyPrimeRawUsage as y };
-//# sourceMappingURL=prime-protocol-Fwvctmhm.d.ts.map
+//# sourceMappingURL=prime-protocol-T0i6xcAs.d.ts.map

package/dist/{prime-protocol-Fwvctmhm.d.ts.map → prime-protocol-T0i6xcAs.d.ts.map}

@@ -1 +1 @@
-{"version":3,"file":"prime-protocol-Fwvctmhm.d.ts","names":[],"sources":["../src/analyst/reply-contract.ts","../src/analyst/prime-protocol.ts"],"mappings":";;;;;;;;;;;;;;KAaY,gBAAgB;EAAU;EAAU,KAAK;;EAAW;EAAW;;;UAG1D;EACf;;EAEA,QAAQ;;UAGO,cAAc;;EAE7B;;EAEA;;;;;EAKA;;;;;;EAMA,UAAU,cAAc,gBAAgB,gBAAgB;;;;;;EAMxD;;;;;;EAMA,eAAe,iBAAiB;;;;;;EAMhC;;;;;EAKA;;;UAIe;EACf;EACA;;UAGe,aAAa;EAC5B,MAAM;;EAEN,QAAQ;EACR,UAAU;;EAEV;;EAEA;;;;;;iBAmCc,gBAAgB,MAC9B,UAAU,cAAc,OACxB,iBACC,aAAa;;;;;;;;;;;;;;;;;;;;;;;;;;;;KCjFJ,gBAAgB,QAAQ,gBAAgB;KAExC,mBAAmB,QAAQ,cAAc;UAIpC;EACf;;EAEA;EACA;;EAEA;EACA;;EAEA;;iBAGc,iBAAiB,MAAM;UAatB;EACf;EACA;EACA;;;iBAIc,uBAAuB,MAAM;;;;;;;;;;iBAuB7B,uBAAuB,eAAe;;iBAkBtC,iBACd,QAAQ,gCACR;;;;;;UAyBe;;;;;;EAMf;;EAEA;;EAEA;;;;;;;EAOA;;iBAGc,sBAAsB;;iBAKtB,oBAAoB,eAAe;;;;;;iBAgBnC,mBAAmB,GAAG,eAAe,GAAG,gBAAgB;;;;;;;;;;;;;iBA6BxD,kCACd,OAAO,eACP,SAAS,qBACR;;;;;;;;KAqCS;EAEN;EACA;;EAEA;EAAqB;EAAiB;EAAgB;;EACtD;EAAiB;EAAiB;;UAEvB;EACf;;EAEA;;;UAIe;EACf;EACA,OAAO;;EAEP;;UAGe;EACf;EACA;;KAGU,qBAAqB;EAE3B;;EAEA;EACA,MAAM;EACN,UAAU;;EAEV;;EAEA;EACA,OAAO;EACP,OAAO;EACP,QAAQ;EACR;;EAGA;EACA,SAAS;EACT,OAAO;EACP,OAAO;EACP,QAAQ;;EAER;;UAGW,qBAAqB;EACpC,UAAU,mBAAmB;EAC7B;EACA,WAAW;;EAEX;EACA;;EAEA;;EAEA;EACA,SAAS;;;;;;;iBAQW,iBAAiB,MACrC,SAAS,qBAAqB,QAC7B,QAAQ,qBAAqB;;;;;;UAyLf,sBAAsB;;EAErC,QAAQ,iBAAiB;;EAEzB,UAAU,iBAAiB;;EAE3B;;UAGe;EACf;EACA;EACA;;KAGU,uBAAuB;EAE7B;EACA,gBAAgB;EAChB;EACA,UAAU;;EAEV;EAAW;EAAgB;;;;;;;;;iBASX,uBAAuB,OAC3C,QAAQ,sBAAsB,QAC9B;EAAU;IACT,QAAQ,uBAAuB;UA8BjB;EACf;EACA;EACA;EACA;;EAEA,QAAQ,SAAS;;;;;;;;;;;;iBAaH,oBAAoB,UAAU"}
+{"version":3,"file":"prime-protocol-T0i6xcAs.d.ts","names":[],"sources":["../src/analyst/reply-contract.ts","../src/analyst/prime-protocol.ts"],"mappings":";;;;;;;;;;;;;;KAaY,gBAAgB;EAAU;EAAU,KAAK;;EAAW;EAAW;;;UAG1D;EACf;;EAEA,QAAQ;;UAGO,cAAc;;EAE7B;;EAEA;;;;;EAKA;;;;;;EAMA,UAAU,cAAc,gBAAgB,gBAAgB;;;;;;EAMxD;;;;;;EAMA,eAAe,iBAAiB;;;;;;EAMhC;;;;;EAKA;;;UAIe;EACf;EACA;;UAGe,aAAa;EAC5B,MAAM;;EAEN,QAAQ;EACR,UAAU;;EAEV;;EAEA;;;;;;iBAmCc,gBAAgB,MAC9B,UAAU,cAAc,OACxB,iBACC,aAAa;;;;;;;;;;;;;;;;;;;;;;;;;;;;KCjFJ,gBAAgB,QAAQ,gBAAgB;KAExC,mBAAmB,QAAQ,cAAc;UAIpC;EACf;;EAEA;EACA;;EAEA;EACA;;EAEA;;iBAGc,iBAAiB,MAAM;UAatB;EACf;EACA;EACA;;;iBAIc,uBAAuB,MAAM;;;;;;;;;;iBAuB7B,uBAAuB,eAAe;;iBAkBtC,iBACd,QAAQ,gCACR;;;;;;UAyBe;;;;;;EAMf;;EAEA;;EAEA;;;;;;;EAOA;;iBAGc,sBAAsB;;iBAKtB,oBAAoB,eAAe;;;;;;iBAgBnC,mBAAmB,GAAG,eAAe,GAAG,gBAAgB;;;;;;;;;;;;;iBA6BxD,kCACd,OAAO,eACP,SAAS,qBACR;;;;;;;;KAqCS;EAEN;EACA;;EAEA;EAAqB;EAAiB;EAAgB;;EACtD;EAAiB;EAAiB;;UAEvB;EACf;;EAEA;;;UAIe;EACf;EACA,OAAO;;EAEP;;UAGe;EACf;EACA;;KAGU,qBAAqB;EAE3B;;EAEA;EACA,MAAM;EACN,UAAU;;EAEV;;EAEA;EACA,OAAO;EACP,OAAO;EACP,QAAQ;EACR;;EAGA;EACA,SAAS;EACT,OAAO;EACP,OAAO;EACP,QAAQ;;EAER;;UAGW,qBAAqB;EACpC,UAAU,mBAAmB;EAC7B;EACA,WAAW;;EAEX;EACA;;EAEA;;EAEA;EACA,SAAS;;;;;;;iBAQW,iBAAiB,MACrC,SAAS,qBAAqB,QAC7B,QAAQ,qBAAqB;;;;;;UAyLf,sBAAsB;;EAErC,QAAQ,iBAAiB;;EAEzB,UAAU,iBAAiB;;EAE3B;;UAGe;EACf;EACA;EACA;;KAGU,uBAAuB;EAE7B;EACA,gBAAgB;EAChB;EACA,UAAU;;EAEV;EAAW;EAAgB;;;;;;;;;iBASX,uBAAuB,OAC3C,QAAQ,sBAAsB,QAC9B;EAAU;IACT,QAAQ,uBAAuB;UA8BjB;EACf;EACA;EACA;EACA;;EAEA,QAAQ,SAAS;;;;;;;;;;;;iBAaH,oBAAoB,UAAU"}

package/dist/{produced-state-zSaGDC_Q.js → produced-state-CY-L7CqS.js}

@@ -1,10 +1,10 @@
 import { s as ValidationError } from "./errors-Dngq5h35.js";
 import { r as canonicalString } from "./canonical-BsZVgBhW.js";
-import { n as JudgeParseError } from "./llm-judge-bwbgDMP0.js";
+import { n as JudgeParseError } from "./llm-judge-NJOHM0iA.js";
 import { i as CostLedger } from "./cost-ledger-_IbkejCF.js";
-import { O as recoverTruncatedJson } from "./campaign-evidence-CWF8pEIk.js";
+import { O as recoverTruncatedJson } from "./campaign-evidence-BqjlTM3P.js";
 import { t as certificationEvidenceDigest } from "./verdict-DhPoXApk.js";
-import { f as ModelSubstitutionError, h as assertServedModel, o as costReceiptFromLlm, s as costReceiptFromLlmError, u as maximumChargeForLlmRequest } from "./llm-client-BqmRnibA.js";
+import { f as ModelSubstitutionError, h as assertServedModel, o as costReceiptFromLlm, s as costReceiptFromLlmError, u as maximumChargeForLlmRequest } from "./llm-client-KYQBh9C8.js";
 import { createHash, randomUUID } from "node:crypto";
 import { harnessSupportsModel } from "@tangle-network/agent-interface";
 //#region src/agent-profile.ts
@@ -588,4 +588,4 @@ function extractProducedState(events) {
 //#endregion
 export { CODING_HARNESSES as a, agentProfileId as c, harnessAxisOf as d, verifyCompletion as i, agentProfileModelId as l, completionVerdict as n, HARNESS_NATIVE_MODEL as o, createLlmCorrectnessChecker as r, agentProfileHash as s, extractProducedState as t, expandProfileAxes as u };
 
-//# sourceMappingURL=produced-state-zSaGDC_Q.js.map
+//# sourceMappingURL=produced-state-CY-L7CqS.js.map