@tangle-network/agent-eval 0.221.8 → 0.222.1

package/dist/{define-agent-eval-JKt3gMQr.d.ts → define-agent-eval-sUYh9BFA.d.ts}

@@ -1,13 +1,12 @@
-import { d as CostReceipt, l as CostLedgerSummary, o as CostLedgerHandle } from "./cost-ledger-C1W3ICmP.js";
-import { v as ProposalFinding } from "./types-6Lfdlshp.js";
-import { V as PowerPreflight, at as CampaignEvidenceContext, dt as EvidenceReceipt } from "./statistical-heldout-BjzSOmLH.js";
-import { nt as EvaluationClaim } from "./search-ledger-types-p2xKfiDJ.js";
-import { $r as OptimizationMethodResult, Ei as RunImprovementLoopResult, Fi as RunEvalOptions, Oi as PremeasuredOptimizationBaseline, Pi as openAutoPr, Qr as OptimizationMethodProvenance, Ri as CampaignCellRetryPolicy, Xi as FinalEvidencePolicy, Xn as LoopProvenanceRecord, Yr as OptimizationMethod, Zi as FinalEvidenceUse, er as CampaignComparisonUnits, ki as RunOptimizationOptions, ni as ComparisonCost, zi as RunCampaignOptions } from "./index-CdEVr8-O.js";
-import { H as SurfaceProposer, R as Scenario, S as JudgeConfig, a as CampaignResult, d as DispatchContext, j as MutableSurface, k as LabeledScenarioStore, p as Gate, v as GateResult } from "./types-M6eF9m-r.js";
-import { At as SearchHistoryReceipt, Ot as SearchHistoryCoverageRow, Tt as SearchHistoryAdmissionOptions, Wt as CampaignStorage } from "./search-kernel-CctpiDd2.js";
-import { n as HostedTenant } from "./client-hwo3cJjR.js";
-import { d as InsightReport } from "./analyze-runs-DfX6dHP0.js";
-//#region src/campaign/presets/run-final-comparison.d.ts
+import { d as CostReceipt, l as CostLedgerSummary, o as CostLedgerHandle } from "./cost-ledger-Czro9wmo.js";
+import { v as ProposalFinding } from "./types-BEvjDziM.js";
+import { V as PowerPreflight, at as CampaignEvidenceContext, dt as EvidenceReceipt } from "./statistical-heldout-BYxHe3KO.js";
+import { nt as EvaluationClaim } from "./search-ledger-types-qiYRUo_N.js";
+import { Br as OptimizationMethodProvenance, Ci as RunEvalOptions, Di as RunCampaignOptions, Ei as CampaignCellRetryPolicy, Hn as CampaignComparisonUnits, Lr as OptimizationMethod, Ri as FinalEvidencePolicy, Rn as LoopProvenanceRecord, Si as openAutoPr, Vr as OptimizationMethodResult, Wr as ComparisonCost, _i as RunOptimizationOptions, gi as PremeasuredOptimizationBaseline, mi as RunImprovementLoopResult, zi as FinalEvidenceUse } from "./index-Bdcpx2s8.js";
+import { H as SurfaceProposer, R as Scenario, S as JudgeConfig, a as CampaignResult, d as DispatchContext, j as MutableSurface, k as LabeledScenarioStore, p as Gate, v as GateResult } from "./types-e3HGaI7P.js";
+import { At as SearchHistoryReceipt, Ot as SearchHistoryCoverageRow, Tt as SearchHistoryAdmissionOptions, Wt as CampaignStorage } from "./search-kernel-B77eE7Ac.js";
+import { n as HostedTenant } from "./client-BIFwUg7I.js";
+import { d as InsightReport } from "./analyze-runs-CGLRgZGd.js";
 interface FinalComparisonOptions<TScenario extends Scenario, TArtifact> extends Omit<RunCampaignOptions<TScenario, TArtifact>, 'dispatch'> {
   baselineSurface: MutableSurface;
   winnerSurface: MutableSurface;
@@ -21,8 +20,16 @@ interface FinalComparisonOptions<TScenario extends Scenario, TArtifact> extends
 }
 /** Compare a search-selected surface without changing the search's selection. */
 declare function runFinalComparison<TScenario extends Scenario, TArtifact>(opts: FinalComparisonOptions<TScenario, TArtifact>): Promise<{
+  gateResult: GateResult;
+  promotedDiff: string;
+  holdout?: "deferred" | undefined;
+  neutralizedOnHoldout?: CampaignResult<TArtifact, TScenario> | undefined;
+  neutralizedSurface?: MutableSurface | undefined;
+  baselineOnHoldout: CampaignResult<TArtifact, TScenario>;
+  winnerOnHoldout: CampaignResult<TArtifact, TScenario>;
+  finalEvidence?: FinalEvidenceUse | undefined;
   claim?: {
-    use: "certification" | "comparison" | "development";
+    use: "development" | "comparison" | "certification";
     population: {
       id: string;
       description: string;
@@ -32,17 +39,7 @@ declare function runFinalComparison<TScenario extends Scenario, TArtifact>(opts:
     generalization: "fixed-roster" | "new-units";
     minimumEffect?: number | undefined;
   } | undefined;
-  finalEvidence?: FinalEvidenceUse | undefined;
-  baselineOnHoldout: CampaignResult<TArtifact, TScenario>;
-  winnerOnHoldout: CampaignResult<TArtifact, TScenario>;
-  neutralizedOnHoldout?: CampaignResult<TArtifact, TScenario> | undefined;
-  neutralizedSurface?: MutableSurface | undefined;
-  holdout?: "deferred" | undefined;
-  gateResult: GateResult;
-  promotedDiff: string;
 }>;
-//#endregion
-//#region src/contract/self-improve-method.d.ts
 interface SelfImproveMethodProvenance {
   schema: 'tangle.method-improvement';
   recordDigest: `sha256:${string}`;
@@ -102,8 +99,6 @@ interface SelfImproveMethodResult<TScenario extends Scenario, TArtifact> extends
     prResult?: ReturnType<typeof openAutoPr>;
   };
 }
-//#endregion
-//#region src/contract/self-improve.d.ts
 interface SelfImproveBudget {
   /** Hard spend cap across the full run. Each paid call reserves its enforced
    *  maximum before dispatch, so completed spend cannot cross this amount. */
@@ -462,8 +457,6 @@ declare class SelfImproveRunError extends Error {
 declare function selfImprove<TScenario extends Scenario, TArtifact>(opts: SelfImproveMethodOptions<TScenario, TArtifact>): Promise<SelfImproveMethodResult<TScenario, TArtifact>>;
 declare function selfImprove<TScenario extends Scenario, TArtifact>(opts: SelfImproveProposerOptions<TScenario, TArtifact>): Promise<SelfImproveProposerResult<TScenario, TArtifact>>;
 declare function selfImprove<TScenario extends Scenario, TArtifact>(opts: SelfImproveOptions<TScenario, TArtifact>): Promise<SelfImproveResult<TScenario, TArtifact>>;
-//#endregion
-//#region src/contract/define-agent-eval.d.ts
 type AgentEvalAgent<TScenario extends Scenario, TArtifact> = (surface: MutableSurface, scenario: TScenario, ctx: DispatchContext) => Promise<TArtifact>;
 type DefineAgentEvalOptions<TScenario extends Scenario, TArtifact> = SelfImproveOptions<TScenario, TArtifact>;
 interface AgentEvalEvaluateOptions<TScenario extends Scenario, TArtifact> extends Omit<RunEvalOptions<TScenario, TArtifact>, 'dispatch' | 'judges' | 'runDir' | 'scenarios'> {
@@ -510,6 +503,5 @@ interface DefinedAgentEval<TScenario extends Scenario, TArtifact> {
  * returns their native result shapes.
  */
 declare function defineAgentEval<TScenario extends Scenario, TArtifact>(defaults: DefineAgentEvalOptions<TScenario, TArtifact>): DefinedAgentEval<TScenario, TArtifact>;
-//#endregion
 export { SelfImproveMethodResult as _, DefinedAgentEval as a, SelfImproveMethodOptions as c, SelfImproveProposerOptions as d, SelfImproveProposerResult as f, SelfImproveMethodProvenance as g, selfImprove as h, DefineAgentEvalOptions as i, SelfImproveOptions as l, SelfImproveRunError as m, AgentEvalEvaluateOptions as n, defineAgentEval as o, SelfImproveResult as p, AgentEvalImproveOptions as r, SelfImproveBudget as s, AgentEvalAgent as t, SelfImproveProgressEvent as u };
-//# sourceMappingURL=define-agent-eval-JKt3gMQr.d.ts.map
+//# sourceMappingURL=define-agent-eval-sUYh9BFA.d.ts.map

package/dist/define-agent-eval-sUYh9BFA.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"define-agent-eval-sUYh9BFA.d.ts","names":["_$__0.GateResult","_$__0.FinalEvidenceUse"],"sources":["../src/campaign/presets/run-final-comparison.ts","../src/contract/self-improve-method.ts","../src/contract/self-improve.ts","../src/contract/define-agent-eval.ts"],"mappings":";;;;;;;;;UAaU,uBAAuB,kBAAkB,UAAU,mBACnD,KAAK,mBAAmB,WAAW;EAC3C,iBAAiB;EACjB,eAAe;EACf,sBACE,SAAS,gBACT,UAAU,WACV,KAAK,WAAW,mBAAmB,WAAW,+BAC3C,QAAQ;EACb,MAAM,KAAK,WAAW;EACtB,QAAQ;EACR,gBAAgB;EAChB;EACA;EACA,cAAc,QAAQ,gBAAgB,UAAU,mBAAmB;;;iBAI/C,mBAAmB,kBAAkB,UAAU,WACnE,MAAM,uBAAuB,WAAW,aAAU;E,YAA5CA;;;;;;;;;;;;;;;;;;;;UCAS;EACf;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,oBAAoB,YAAY,0BAA0B;EAC1D,QAAQ;EACR;IACE;IACA;IACA;IACA;IACA;IACA;IACA;IACA,sBAAsB;;EAExB,MAAM,QAAQ,kBAAkB;EAChC;EACA;EACA;EACA;EACA,MAAM;EACN;EACA;;UAGe,wBAAwB,kBAAkB,UAAU,mBAC3D,KACN,0BAA0B,WAAW;EAWvC;IAAa,UAAU;IAAiB,QAAQ;;EAChD,uBAAuB;EACvB;;EAEA,UAAU,0BAA0B,WAAW;EAC/C,QAAQ,KAAK,0BAA0B,WAAW;IAChD;;EAEF,YAAY;EACZ,cAAc,YAAY,0BAA0B,WAAW;;EAE/D,MAAM;;EAEN,YAAY;EACZ,UAAU,0BAA0B,WAAW;EAC/C,KAAK,QAAQ,kBAAkB,mBAAmB,WAAW;IAC3D;IACA,iBAAiB,0BAA0B,WAAW;IACtD,eAAe,0BAA0B,WAAW;IACpD;IACA,QAAQ;IACR,MAAM;IACN,WAAW,kBAAkB;;;UCpBhB;;;EAGf;;;;EAIA;;EAEA;;EAEA;;;EAGA;;;EAGA;;;;EAIA;;EAEA,mBAAmB;;;;;;;;;EASnB;;EAEA;;;;;EAKA;;KAGU;EACN;EAA0B;;EAC1B;EAA4B;EAAuB;;EACnD;EAA4B;EAAe;;EAC3C;EAA8B;EAAe;EAAuB;;EAGpE;EAAsB;EAAkB;;EACxC;EAAyB;EAAW;EAAY;EAAa;;UAElD,mBAAmB,kBAAkB,UAAU,mBACtD;;;;;;;;;;;;;;EAcR,QAAQ,SAAS,gBAAgB,UAAU,WAAW,KAAK,oBAAoB,QAAQ;;;;;;;EAQvF;;EAEA;;;EAIA,WAAW;;EAGX,OAAO,YAAY,WAAW;;;EAI9B,iBAAiB;;EAGjB,SAAS;;;;;;;;;;;;;EAcT,sBAAsB,gCAAgC,WAAW;;;;;EAMjE,WAAW,gBAAgB;;;;;;EAO3B,SAAS,mBAAmB,WAAW;;;EAIvC,qBAAqB;;;EAIrB,OAAO,KAAK,WAAW;;;;;;;;EASvB,cAAc,eAAe,gBAAgB,iBAAiB,mBAAmB;;;;EAKjF,UAAU;;;;EAKV;;;EAIA,gBAAgB,QAAQ,uBAAuB;;;;;EAM/C,iBAAiB;IACf,UAAU;IACV;IACA;;;;EAKF;;;;;;;EAQA,YAAY;;;EAIZ,cAAc,OAAO;;;;EAKrB;EACA;EACA;;;;;;;;;;;;;EAcA,eAAe;;;;EAKf,eAAe;;EAGf;;;;;;;;EASA;;;;;;;;;EAUA,oBAAoB,uBAAuB,WAAW;;;EAItD,WAAW;;;;;EAMX,SAAS,uBAAuB,WAAW;;;EAI3C,eAAe,uBAAuB,WAAW;;EAEjD,WAAW;;EAEX,QAAQ;;EAER,gBAAgB;;UAGD,0BAA0B,kBAAkB,UAAU;EACrE;EACA,QAAQ;EACR,gBAAgB;;;;EAIhB;IACE;IACA,aAAa;;;;;EAKf;IACE;IACA,aAAa;IACb,SAAS;;;IAGT;;;;IAIA;;;;;;EAMF;;;EAGA;;;;EAIA,YAAY;;EAEZ;;;EAGA;;EAEA;;EAEA;;EAEA,MAAM;;;EAGN,UAAU;;;EAGV,gBAAgB;;EAEhB;IACE;IACA,MAAM;IACN;IACA,aAAa;;;;;;;;EAQf,SAAS;;;;EAIT,QAAQ;;;;;;EAMR,KAAK,yBAAyB,WAAW;;KAG/B,kBAAkB,kBAAkB,UAAU,aACtD,0BAA0B,WAAW,aACrC,wBAAwB,WAAW;KAE3B,yBAAyB,kBAAkB,UAAU,aAAa,KAC5E,mBAAmB,WAAW;EAG9B,QAAQ,mBAAmB,WAAW;EACtC;EACA,gBAAgB,QAAQ;;KAGd,2BAA2B,kBAAkB,UAAU,aAAa,KAC9E,mBAAmB,WAAW;EAG9B;EACA,gBAAgB,QAAQ;;;cAIb,4BAA4B;WAC9B,MAAM;WACN,UAAU;EAEP,YAAA,gBAAgB,QAAQ;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBA0NtB,YAAY,kBAAkB,UAAU,WACtD,MAAM,yBAAyB,WAAW,aACzC,QAAQ,wBAAwB,WAAW;iBAC9B,YAAY,kBAAkB,UAAU,WACtD,MAAM,2BAA2B,WAAW,aAC3C,QAAQ,0BAA0B,WAAW;iBAChC,YAAY,kBAAkB,UAAU,WACtD,MAAM,mBAAmB,WAAW,aACnC,QAAQ,kBAAkB,WAAW;KC9nB5B,eAAe,kBAAkB,UAAU,cACrD,SAAS,gBACT,UAAU,WACV,KAAK,oBACF,QAAQ;KAED,uBAAuB,kBAAkB,UAAU,aAAa,mBAC1E,WACA;UAGe,yBAAyB,kBAAkB,UAAU,mBAC5D,KACN,eAAe,WAAW;;EAI5B,YAAY;;EAEZ,UAAU;;EAEV,QAAQ,eAAe,WAAW;;EAElC,QAAQ,YAAY,WAAW;;EAE/B,SAAS,YAAY,WAAW;;EAEhC;;KAGU,wBAAwB,kBAAkB,UAAU,aAAa,KAC3E,QAAQ,mBAAmB,WAAW;EAGtC,SAAS,QAAQ;EACjB,eAAe,QAAQ;;UAGR,iBAAiB,kBAAkB,UAAU;;WAEnD,oBAAoB;;WAEpB,iBAAiB;;;;;EAK1B,SACE,OAAO,yBAAyB,WAAW,aAC1C,QAAQ,eAAe,WAAW;;;;;;;EAOrC,QACE,OAAO,wBAAwB,WAAW,aACzC,QAAQ,kBAAkB,WAAW;;;;;;;;;iBAU1B,gBAAgB,kBAAkB,UAAU,WAC1D,UAAU,uBAAuB,WAAW,aAC3C,iBAAiB,WAAW"}

package/dist/{descriptive-CVNy48rR.js → descriptive-cPwITVfy.js}

@@ -1,5 +1,6 @@
-import { i as makeRng } from "./internal-BTK91Bqt.js";
-//#region src/statistics/descriptive.ts
+import { s as ValidationError } from "./errors-DeEEV9Vx.js";
+import { i as makeRng, t as assertFiniteSample } from "./internal-v6XfOeJW.js";
+// src/statistics/descriptive.ts
 /**
 * Descriptive statistics: means, bootstrap spread, correlation, and the
 * weighted judge-dimension composite. Nothing here is a significance test.
@@ -67,17 +68,39 @@ function partialCredit(current, target) {
 * series: an empty series has no distribution, and a zero-filled summary
 * would read as a measured all-zero series.
 */
-function summarizeNumberSeries(values) {
+function summarizeNumberSeries(values, options) {
+	const criticalValue = options?.medianInterval?.criticalValue;
+	if (options) {
+		assertFiniteSample("summarizeNumberSeries", "values", values);
+		for (const percentile of options.percentiles ?? []) if (!Number.isFinite(percentile) || percentile < 0 || percentile > 100) throw new ValidationError("summarizeNumberSeries: percentiles must be finite and between 0 and 100");
+		if (options.medianInterval && (criticalValue === void 0 || !Number.isFinite(criticalValue) || criticalValue < 0)) throw new ValidationError("summarizeNumberSeries: median criticalValue must be finite and nonnegative");
+	}
 	if (values.length === 0) return null;
 	const sorted = [...values].sort((a, b) => a - b);
-	const rank = (q) => sorted[Math.min(sorted.length - 1, Math.max(0, Math.ceil(q * sorted.length) - 1))];
+	const n = sorted.length;
+	const rank = (q) => sorted[Math.min(n - 1, Math.max(0, Math.ceil(q * n) - 1))];
+	const sum = sorted.reduce((a, b) => a + b, 0);
+	if (options && !Number.isFinite(sum)) throw new ValidationError("summarizeNumberSeries: sample sum exceeded finite range");
+	const spread = criticalValue === void 0 ? void 0 : criticalValue / 2 * Math.sqrt(n);
+	const lowRank = spread === void 0 ? 1 : Math.max(1, Math.floor(n / 2 - spread));
+	const highRank = spread === void 0 ? n : Math.min(n, Math.ceil(n / 2 + 1 + spread));
 	return {
-		n: sorted.length,
+		n,
 		min: sorted[0],
 		p50: rank(.5),
 		p90: rank(.9),
 		max: sorted[sorted.length - 1],
-		sum: sorted.reduce((a, b) => a + b, 0)
+		sum,
+		...options?.percentiles === void 0 ? {} : { percentiles: Object.fromEntries(options.percentiles.map((percentile) => [percentile, rank(percentile / 100)])) },
+		...criticalValue === void 0 ? {} : { medianInterval: {
+			method: "normal-order-statistics",
+			criticalValue,
+			sampleSize: n,
+			lowRank,
+			highRank,
+			low: sorted[lowRank - 1],
+			high: sorted[highRank - 1]
+		} }
 	};
 }
 /**
@@ -158,7 +181,6 @@ function weightedComposite(input) {
 		pass: composite >= input.threshold
 	};
 }
-//#endregion
 export { spearmanR as a, weightedMean as c, ranks as i, partialCredit as n, summarizeNumberSeries as o, pearsonR as r, weightedComposite as s, confidenceInterval as t };
 
-//# sourceMappingURL=descriptive-CVNy48rR.js.map
+//# sourceMappingURL=descriptive-cPwITVfy.js.map

package/dist/descriptive-cPwITVfy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"descriptive-cPwITVfy.js","names":[],"sources":["../src/statistics/descriptive.ts"],"sourcesContent":["/**\n * Descriptive statistics: means, bootstrap spread, correlation, and the\n * weighted judge-dimension composite. Nothing here is a significance test.\n */\n\nimport { ValidationError } from '../errors'\nimport { assertFiniteSample, makeRng } from './internal'\n\n/** Weighted mean — falls back to uniform weights when omitted */\nexport function weightedMean(scores: { score: number; weight?: number }[]): number {\n  if (scores.length === 0) return 0\n  let totalWeight = 0\n  let weightedSum = 0\n  for (const { score, weight } of scores) {\n    const w = weight ?? 1\n    weightedSum += score * w\n    totalWeight += w\n  }\n  return totalWeight > 0 ? weightedSum / totalWeight : 0\n}\n\n/**\n * Percentile bootstrap confidence interval on the mean of `scores`.\n *\n * Descriptive spread. It is not a significance test, and at small n its bounds\n * are anti-conservative in the same way {@link pairedBootstrap}'s are — see\n * {@link BOOTSTRAP_GATE_MIN_N}. With no `seed` the resampling is seeded from\n * the scores themselves, so the interval is reproducible either way.\n */\nexport function confidenceInterval(\n  scores: number[],\n  confidence = 0.95,\n  opts: { seed?: number; resamples?: number } = {},\n): { mean: number; lower: number; upper: number } {\n  if (scores.length === 0) return { mean: 0, lower: 0, upper: 0 }\n  if (scores.length === 1) return { mean: scores[0]!, lower: scores[0]!, upper: scores[0]! }\n\n  const n = scores.length\n  const mean = scores.reduce((a, b) => a + b, 0) / n\n\n  const B = opts.resamples ?? 1000\n  const rng = makeRng(opts.seed, scores)\n  const bootstrapMeans: number[] = []\n\n  for (let i = 0; i < B; i++) {\n    let sum = 0\n    for (let j = 0; j < n; j++) {\n      sum += scores[Math.floor(rng() * n)]!\n    }\n    bootstrapMeans.push(sum / n)\n  }\n\n  bootstrapMeans.sort((a, b) => a - b)\n\n  const alpha = 1 - confidence\n  const lowerIdx = Math.floor((alpha / 2) * B)\n  const upperIdx = Math.floor((1 - alpha / 2) * B) - 1\n\n  return {\n    mean,\n    lower: bootstrapMeans[lowerIdx]!,\n    upper: bootstrapMeans[Math.min(upperIdx, B - 1)]!,\n  }\n}\n\n/** Partial credit: returns 0-1 ratio of current toward target */\nexport function partialCredit(current: number, target: number): number {\n  if (target <= 0) return 1\n  return Math.min(1, Math.max(0, current / target))\n}\n\n/** Distribution summary of a number series: count, extremes, quantiles, sum. */\nexport interface SeriesDistribution {\n  readonly n: number\n  readonly min: number\n  readonly p50: number\n  readonly p90: number\n  readonly max: number\n  readonly sum: number\n  readonly percentiles?: Readonly<Record<number, number>>\n  readonly medianInterval?: {\n    readonly method: 'normal-order-statistics'\n    readonly criticalValue: number\n    readonly sampleSize: number\n    readonly lowRank: number\n    readonly highRank: number\n    readonly low: number\n    readonly high: number\n  }\n}\n\nexport interface SeriesDistributionOptions {\n  /** Nearest-rank percentiles on a 0–100 scale, including fractional tails. */\n  percentiles?: readonly number[]\n  /** Descriptive median rank band, not a bootstrap interval or promotion test. */\n  medianInterval?: { criticalValue: number }\n}\n\n/**\n * Fold a number series into its distribution summary. Quantiles use the\n * nearest-rank definition — the `ceil(q·n)`-th order statistic — so every\n * reported quantile is a value from the series. Returns `null` for an empty\n * series: an empty series has no distribution, and a zero-filled summary\n * would read as a measured all-zero series.\n */\nexport function summarizeNumberSeries(\n  values: readonly number[],\n  options?: SeriesDistributionOptions,\n): SeriesDistribution | null {\n  const criticalValue = options?.medianInterval?.criticalValue\n  if (options) {\n    assertFiniteSample('summarizeNumberSeries', 'values', values)\n    for (const percentile of options.percentiles ?? []) {\n      if (!Number.isFinite(percentile) || percentile < 0 || percentile > 100) {\n        throw new ValidationError(\n          'summarizeNumberSeries: percentiles must be finite and between 0 and 100',\n        )\n      }\n    }\n    if (\n      options.medianInterval &&\n      (criticalValue === undefined || !Number.isFinite(criticalValue) || criticalValue < 0)\n    ) {\n      throw new ValidationError(\n        'summarizeNumberSeries: median criticalValue must be finite and nonnegative',\n      )\n    }\n  }\n  if (values.length === 0) return null\n  const sorted = [...values].sort((a, b) => a - b)\n  const n = sorted.length\n  const rank = (q: number): number =>\n    sorted[Math.min(n - 1, Math.max(0, Math.ceil(q * n) - 1))] as number\n  const sum = sorted.reduce((a, b) => a + b, 0)\n  if (options && !Number.isFinite(sum)) {\n    throw new ValidationError('summarizeNumberSeries: sample sum exceeded finite range')\n  }\n  const spread = criticalValue === undefined ? undefined : (criticalValue / 2) * Math.sqrt(n)\n  const lowRank = spread === undefined ? 1 : Math.max(1, Math.floor(n / 2 - spread))\n  const highRank = spread === undefined ? n : Math.min(n, Math.ceil(n / 2 + 1 + spread))\n  return {\n    n,\n    min: sorted[0] as number,\n    p50: rank(0.5),\n    p90: rank(0.9),\n    max: sorted[sorted.length - 1] as number,\n    sum,\n    ...(options?.percentiles === undefined\n      ? {}\n      : {\n          percentiles: Object.fromEntries(\n            options.percentiles.map((percentile) => [percentile, rank(percentile / 100)]),\n          ),\n        }),\n    ...(criticalValue === undefined\n      ? {}\n      : {\n          medianInterval: {\n            method: 'normal-order-statistics' as const,\n            criticalValue,\n            sampleSize: n,\n            lowRank,\n            highRank,\n            low: sorted[lowRank - 1] as number,\n            high: sorted[highRank - 1] as number,\n          },\n        }),\n  }\n}\n\n// ── Correlation (Pearson / Spearman) ─────────────────────────────────\n//\n// The single source for linear (Pearson) and rank (Spearman) correlation.\n// Edge-case contract is explicit so every caller agrees on what a\n// degenerate input means:\n//   - length mismatch or n < 2  → NaN   (correlation is undefined; not 0)\n//   - both series constant      → 1     (degenerate perfect agreement)\n//   - exactly one series constant → 0   (no covariation to detect)\n// Returning NaN for n < 2 (rather than 0) keeps \"not enough data\" distinct\n// from \"measured zero correlation\", which a 0 would silently conflate.\n\n/**\n * Average-rank-with-ties transform (1-indexed). Tied values receive the mean\n * of the ranks they span, the standard correction for Spearman's ρ.\n */\nexport function ranks(xs: number[]): number[] {\n  const indexed = xs.map((v, i) => ({ v, i })).sort((a, b) => a.v - b.v)\n  const r = new Array<number>(xs.length)\n  let i = 0\n  while (i < indexed.length) {\n    let j = i\n    while (j + 1 < indexed.length && indexed[j + 1]!.v === indexed[i]!.v) j++\n    const avg = (i + j) / 2 + 1\n    for (let k = i; k <= j; k++) r[indexed[k]!.i] = avg\n    i = j + 1\n  }\n  return r\n}\n\n/**\n * Pearson product-moment correlation coefficient r ∈ [-1, 1] between two\n * equal-length series. See the edge-case contract above: NaN for n < 2 or\n * unequal lengths, 1 when both series are constant, 0 when exactly one is.\n */\nexport function pearsonR(a: number[], b: number[]): number {\n  if (a.length !== b.length || a.length < 2) return Number.NaN\n  const n = a.length\n  const meanA = a.reduce((s, v) => s + v, 0) / n\n  const meanB = b.reduce((s, v) => s + v, 0) / n\n  let num = 0\n  let varA = 0\n  let varB = 0\n  for (let i = 0; i < n; i++) {\n    const da = a[i]! - meanA\n    const db = b[i]! - meanB\n    num += da * db\n    varA += da * da\n    varB += db * db\n  }\n  if (varA === 0 || varB === 0) return varA === 0 && varB === 0 ? 1 : 0\n  return num / Math.sqrt(varA * varB)\n}\n\n/**\n * Spearman's rank correlation ρ — Pearson over the average-rank-with-ties\n * transform of each series. Same edge-case contract as {@link pearsonR}.\n */\nexport function spearmanR(a: number[], b: number[]): number {\n  if (a.length !== b.length || a.length < 2) return Number.NaN\n  return pearsonR(ranks(a), ranks(b))\n}\n\nexport interface WeightedCompositeInput {\n  /** Per-dimension scores (typically 0..1). */\n  dims: Record<string, number>\n  /** Weight per dimension. Every weighted dimension MUST be present in\n   *  `dims` — a weight for an absent dimension is a config error and throws,\n   *  because silently dropping it would renormalise the composite onto a\n   *  different denominator than intended. */\n  weights: Record<string, number>\n  /** Optional pass threshold; when set, the result reports `pass`. */\n  threshold?: number\n}\n\nexport interface WeightedCompositeResult {\n  composite: number\n  pass?: boolean\n}\n\n/**\n * Weighted composite over judge dimensions: `Σ(score_d · w_d) / Σ(w_d)` across\n * the weighted dimensions. The canonical replacement for the per-consumer\n * hand-rolled composite math (tax/legal/creative/gtm each ship a copy).\n *\n * Fail-loud: throws if a weighted dimension is missing from `dims`, if any\n * weight is negative, or if the weights sum to 0 — none of which can produce\n * a meaningful composite.\n */\nexport function weightedComposite(input: WeightedCompositeInput): WeightedCompositeResult {\n  const entries = Object.entries(input.weights)\n  if (entries.length === 0) {\n    throw new Error('weightedComposite: `weights` is empty — nothing to combine')\n  }\n  let weightedSum = 0\n  let weightTotal = 0\n  for (const [dim, weight] of entries) {\n    if (weight < 0) {\n      throw new Error(`weightedComposite: weight for '${dim}' is negative (${weight})`)\n    }\n    if (!(dim in input.dims)) {\n      throw new Error(\n        `weightedComposite: weighted dimension '${dim}' is absent from \\`dims\\` — ` +\n          'refusing to renormalise onto a different denominator',\n      )\n    }\n    weightedSum += input.dims[dim]! * weight\n    weightTotal += weight\n  }\n  if (weightTotal === 0) {\n    throw new Error('weightedComposite: weights sum to 0 — composite is undefined')\n  }\n  const composite = weightedSum / weightTotal\n  return input.threshold === undefined\n    ? { composite }\n    : { composite, pass: composite >= input.threshold }\n}\n"],"mappings":";;;;;;;;AASA,SAAgB,aAAa,QAAsD;CACjF,IAAI,OAAO,WAAW,GAAG,OAAO;CAChC,IAAI,cAAc;CAClB,IAAI,cAAc;CAClB,KAAK,MAAM,EAAE,OAAO,YAAY,QAAQ;EACtC,MAAM,IAAI,UAAU;EACpB,eAAe,QAAQ;EACvB,eAAe;CACjB;CACA,OAAO,cAAc,IAAI,cAAc,cAAc;AACvD;;;;;;;;;AAUA,SAAgB,mBACd,QACA,aAAa,KACb,OAA8C,CAAC,GACC;CAChD,IAAI,OAAO,WAAW,GAAG,OAAO;EAAE,MAAM;EAAG,OAAO;EAAG,OAAO;CAAE;CAC9D,IAAI,OAAO,WAAW,GAAG,OAAO;EAAE,MAAM,OAAO;EAAK,OAAO,OAAO;EAAK,OAAO,OAAO;CAAI;CAEzF,MAAM,IAAI,OAAO;CACjB,MAAM,OAAO,OAAO,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;CAEjD,MAAM,IAAI,KAAK,aAAa;CAC5B,MAAM,MAAM,QAAQ,KAAK,MAAM,MAAM;CACrC,MAAM,iBAA2B,CAAC;CAElC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,IAAI,MAAM;EACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,OAAO,OAAO,KAAK,MAAM,IAAI,IAAI,CAAC;EAEpC,eAAe,KAAK,MAAM,CAAC;CAC7B;CAEA,eAAe,MAAM,GAAG,MAAM,IAAI,CAAC;CAEnC,MAAM,QAAQ,IAAI;CAClB,MAAM,WAAW,KAAK,MAAO,QAAQ,IAAK,CAAC;CAC3C,MAAM,WAAW,KAAK,OAAO,IAAI,QAAQ,KAAK,CAAC,IAAI;CAEnD,OAAO;EACL;EACA,OAAO,eAAe;EACtB,OAAO,eAAe,KAAK,IAAI,UAAU,IAAI,CAAC;CAChD;AACF;;AAGA,SAAgB,cAAc,SAAiB,QAAwB;CACrE,IAAI,UAAU,GAAG,OAAO;CACxB,OAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,UAAU,MAAM,CAAC;AAClD;;;;;;;;AAoCA,SAAgB,sBACd,QACA,SAC2B;CAC3B,MAAM,gBAAgB,SAAS,gBAAgB;CAC/C,IAAI,SAAS;EACX,mBAAmB,yBAAyB,UAAU,MAAM;EAC5D,KAAK,MAAM,cAAc,QAAQ,eAAe,CAAC,GAC/C,IAAI,CAAC,OAAO,SAAS,UAAU,KAAK,aAAa,KAAK,aAAa,KACjE,MAAM,IAAI,gBACR,yEACF;EAGJ,IACE,QAAQ,mBACP,kBAAkB,KAAA,KAAa,CAAC,OAAO,SAAS,aAAa,KAAK,gBAAgB,IAEnF,MAAM,IAAI,gBACR,4EACF;CAEJ;CACA,IAAI,OAAO,WAAW,GAAG,OAAO;CAChC,MAAM,SAAS,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,GAAG,MAAM,IAAI,CAAC;CAC/C,MAAM,IAAI,OAAO;CACjB,MAAM,QAAQ,MACZ,OAAO,KAAK,IAAI,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC;CAC1D,MAAM,MAAM,OAAO,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC;CAC5C,IAAI,WAAW,CAAC,OAAO,SAAS,GAAG,GACjC,MAAM,IAAI,gBAAgB,yDAAyD;CAErF,MAAM,SAAS,kBAAkB,KAAA,IAAY,KAAA,IAAa,gBAAgB,IAAK,KAAK,KAAK,CAAC;CAC1F,MAAM,UAAU,WAAW,KAAA,IAAY,IAAI,KAAK,IAAI,GAAG,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC;CACjF,MAAM,WAAW,WAAW,KAAA,IAAY,IAAI,KAAK,IAAI,GAAG,KAAK,KAAK,IAAI,IAAI,IAAI,MAAM,CAAC;CACrF,OAAO;EACL;EACA,KAAK,OAAO;EACZ,KAAK,KAAK,EAAG;EACb,KAAK,KAAK,EAAG;EACb,KAAK,OAAO,OAAO,SAAS;EAC5B;EACA,GAAI,SAAS,gBAAgB,KAAA,IACzB,CAAC,IACD,EACE,aAAa,OAAO,YAClB,QAAQ,YAAY,KAAK,eAAe,CAAC,YAAY,KAAK,aAAa,GAAG,CAAC,CAAC,CAC9E,EACF;EACJ,GAAI,kBAAkB,KAAA,IAClB,CAAC,IACD,EACE,gBAAgB;GACd,QAAQ;GACR;GACA,YAAY;GACZ;GACA;GACA,KAAK,OAAO,UAAU;GACtB,MAAM,OAAO,WAAW;EAC1B,EACF;CACN;AACF;;;;;AAiBA,SAAgB,MAAM,IAAwB;CAC5C,MAAM,UAAU,GAAG,KAAK,GAAG,OAAO;EAAE;EAAG;CAAE,EAAE,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,IAAI,EAAE,CAAC;CACrE,MAAM,IAAI,IAAI,MAAc,GAAG,MAAM;CACrC,IAAI,IAAI;CACR,OAAO,IAAI,QAAQ,QAAQ;EACzB,IAAI,IAAI;EACR,OAAO,IAAI,IAAI,QAAQ,UAAU,QAAQ,IAAI,EAAE,CAAE,MAAM,QAAQ,EAAE,CAAE,GAAG;EACtE,MAAM,OAAO,IAAI,KAAK,IAAI;EAC1B,KAAK,IAAI,IAAI,GAAG,KAAK,GAAG,KAAK,EAAE,QAAQ,EAAE,CAAE,KAAK;EAChD,IAAI,IAAI;CACV;CACA,OAAO;AACT;;;;;;AAOA,SAAgB,SAAS,GAAa,GAAqB;CACzD,IAAI,EAAE,WAAW,EAAE,UAAU,EAAE,SAAS,GAAG,OAAO;CAClD,MAAM,IAAI,EAAE;CACZ,MAAM,QAAQ,EAAE,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;CAC7C,MAAM,QAAQ,EAAE,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;CAC7C,IAAI,MAAM;CACV,IAAI,OAAO;CACX,IAAI,OAAO;CACX,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,MAAM,KAAK,EAAE,KAAM;EACnB,MAAM,KAAK,EAAE,KAAM;EACnB,OAAO,KAAK;EACZ,QAAQ,KAAK;EACb,QAAQ,KAAK;CACf;CACA,IAAI,SAAS,KAAK,SAAS,GAAG,OAAO,SAAS,KAAK,SAAS,IAAI,IAAI;CACpE,OAAO,MAAM,KAAK,KAAK,OAAO,IAAI;AACpC;;;;;AAMA,SAAgB,UAAU,GAAa,GAAqB;CAC1D,IAAI,EAAE,WAAW,EAAE,UAAU,EAAE,SAAS,GAAG,OAAO;CAClD,OAAO,SAAS,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;AACpC;;;;;;;;;;AA4BA,SAAgB,kBAAkB,OAAwD;CACxF,MAAM,UAAU,OAAO,QAAQ,MAAM,OAAO;CAC5C,IAAI,QAAQ,WAAW,GACrB,MAAM,IAAI,MAAM,4DAA4D;CAE9E,IAAI,cAAc;CAClB,IAAI,cAAc;CAClB,KAAK,MAAM,CAAC,KAAK,WAAW,SAAS;EACnC,IAAI,SAAS,GACX,MAAM,IAAI,MAAM,kCAAkC,IAAI,iBAAiB,OAAO,EAAE;EAElF,IAAI,EAAE,OAAO,MAAM,OACjB,MAAM,IAAI,MACR,0CAA0C,IAAI,iFAEhD;EAEF,eAAe,MAAM,KAAK,OAAQ;EAClC,eAAe;CACjB;CACA,IAAI,gBAAgB,GAClB,MAAM,IAAI,MAAM,8DAA8D;CAEhF,MAAM,YAAY,cAAc;CAChC,OAAO,MAAM,cAAc,KAAA,IACvB,EAAE,UAAU,IACZ;EAAE;EAAW,MAAM,aAAa,MAAM;CAAU;AACtD"}

package/dist/diagnosis/index.d.ts

@@ -1,10 +1,9 @@
-import { a as FailureClassification, i as FailureBlame } from "../failure-cluster-DN0t63Z0.js";
-import { r as ExecutionReport } from "../analyze-runs-DfX6dHP0.js";
-import { l as PrimeRawUsage } from "../prime-protocol-BGxjfhM4.js";
-import { i as nodeHttpPrimeBridgeTransport, n as PrimeBridgeTransportRequest, r as PrimeBridgeTransportResult, t as PrimeBridgeTransport } from "../prime-bridge-transport-6feEglLf.js";
-import { a as isContentAttribute, i as ingestSpans, n as IngestReport, r as epochMillis, t as DiagnosisSpan } from "../spans-CVngGij3.js";
+import { a as FailureClassification, i as FailureBlame } from "../failure-cluster-DOoa7CBg.js";
+import { r as ExecutionReport } from "../analyze-runs-CGLRgZGd.js";
+import { l as PrimeRawUsage } from "../prime-protocol-BpQlTowq.js";
+import { i as nodeHttpPrimeBridgeTransport, n as PrimeBridgeTransportRequest, r as PrimeBridgeTransportResult, t as PrimeBridgeTransport } from "../prime-bridge-transport-Cfqir_Im.js";
+import { a as isContentAttribute, i as ingestSpans, n as IngestReport, r as epochMillis, t as DiagnosisSpan } from "../spans-vZoW__3q.js";
 import { SpanKind, TraceValidation } from "@tangle-network/agent-trace-contract";
-//#region src/diagnosis/findings.d.ts
 /**
  * The diagnosis findings document: what the engine returns and what the
  * diagnosis report renders. It mirrors the kit's JSON Schema
@@ -63,8 +62,6 @@ interface DiagnosisFindingsDocument {
   };
   findings: DiagnosisFinding[];
 }
-//#endregion
-//#region src/diagnosis/first-failure.d.ts
 type FirstFailureStage = 'error-span' | 'failed-outcome';
 interface FirstFailureFound {
   status: 'found';
@@ -111,8 +108,6 @@ interface FirstFailureUnknown {
 type FirstFailure = FirstFailureFound | FirstFailureAmbiguous | FirstFailureNone | FirstFailureUnknown;
 /** Rank the first failure of one trace. Throws when the spans belong to more than one trace. */
 export declare function rankFirstFailure(spans: readonly DiagnosisSpan[]): FirstFailure;
-//#endregion
-//#region src/diagnosis/deterministic.d.ts
 interface ExecutionFacts {
   runs: number;
   spans: number;
@@ -134,8 +129,6 @@ interface DeterministicResult {
   findings: DiagnosisFinding[];
   window: string;
 }
-//#endregion
-//#region src/diagnosis/model-pass.d.ts
 interface DiagnosisModelOptions {
   /** One POST-shaped call to an OpenAI-compatible chat endpoint, or an equivalent local runner. */
   transport: PrimeBridgeTransport;
@@ -187,8 +180,6 @@ interface ModelRunRecord {
   usage: PrimeRawUsage;
   rows: number;
 }
-//#endregion
-//#region src/diagnosis/engine.d.ts
 interface DiagnosisContext {
   /** Whose traces these are. Operator critique and topology run only for `internal`. */
   subject: 'internal' | 'customer';
@@ -255,6 +246,5 @@ interface DiagnosisResult {
   };
 }
 export declare function diagnoseSpans(spans: readonly unknown[], context: DiagnosisContext, options: DiagnosisOptions): Promise<DiagnosisResult>;
-//#endregion
 export { type DiagnosisCapability, type DiagnosisConfidence, type DiagnosisContext, type DiagnosisFinding, type DiagnosisFindingsDocument, type DiagnosisMeasure, type DiagnosisModelOptions, type DiagnosisOptions, type DiagnosisRedaction, type DiagnosisResult, type DiagnosisSeverity, type DiagnosisSkippedAnalysis, type DiagnosisSpan, type DiagnosisUsage, type ExecutionFacts, type FirstFailure, type FirstFailureAmbiguous, type FirstFailureFound, type FirstFailureNone, type FirstFailureStage, type IngestReport, type ModelQuestion, type ModelRejection, type ModelRowNote, type ModelRunRecord, type PrimeBridgeTransport, type PrimeBridgeTransportRequest, type PrimeBridgeTransportResult, epochMillis, ingestSpans, isContentAttribute, nodeHttpPrimeBridgeTransport };
 //# sourceMappingURL=index.d.ts.map

package/dist/diagnosis/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","names":[],"sources":["../../src/diagnosis/findings.ts","../../src/diagnosis/first-failure.ts","../../src/diagnosis/deterministic.ts","../../src/diagnosis/model-pass.ts","../../src/diagnosis/engine.ts"],"mappings":";;;;;;;;;;;;;;;KAWY;;KAGA;UAEK;EACf;EACA;EACA;;EAEA;;UAGe;EACf;EACA,UAAU;EACV;EACA;EACA,UAAU;;EAEV;EACA;EACA,YAAY;EACZ;;UAGe;EACf;EACA;;UAGe;EACf;EACA;;UAGe;EACf;EACA,QAAQ;EACR;;UAGe;EACf;EACA;IACE;IACA;IACA;IACA;;EAEF;IACE,cAAc,eAAe;IAC7B,SAAS;IACT,YAAY;;EAEd,UAAU;;;;KChBA;UAEK;EACf;EACA;EACA,OAAO;EACP;EACA;EACA,MAAM;;EAEN;;EAEA,gBAAgB;EAChB,OAAO;;EAEP;EACA;;UAGe;EACf;EACA;EACA,OAAO;;EAEP;EACA;EACA;;UAGe;EACf;EACA;EACA;;;;;;;UAQe;EACf;EACA;;EAEA;EACA;;KAGU,eACR,oBACA,wBACA,mBACA;;wBAGY,iBAAiB,gBAAgB,kBAAkB;;;UCjClD;EACf;EACA;EACA,aAAa;EACb;EACA;EACA;;EAEA,eAAe;;EAEf,WAAW;EACX;;UAGe;EACf,YAAY;EACZ,cAAc,eAAe;EAC7B,SAAS;EACT,OAAO;EACP,UAAU;EACV;;;;UCpEe;;EAEf,WAAW;;EAEX;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;IAAY;IAA4B;;;UAGzB;EACf;EACA;EACA;EACA;EACA;;UAGe;EACf;EACA;EACA;;UAGe;EACf;EACA;;UAGe;EACf;EACA;EACA;EACA;IAAa;IAAiB;IAAkB;;EAChD,OAAO;EACP;;;;UC/Be;;EAEf;;EAEA;;EAEA;;;;;EAKA;;EAEA;;EAEA;IAAa,MAAM;MAAQ;QAAe;MAA6B;;KAG7D;EACN;EAAuB;EAAiB,SAAS;;EACjD;EAAe,OAAO;EAAuB,SAAS;;UAE3C;EACf;EACA;EACA;EACA;;UAGe;;EAEf,UAAU;;EAEV,WAAW;;EAEX,OAAO;;EAEP,WAAW;IAAQ;IAAiB;;EACpC,OAAO;EACP,aAAa;EACb,QAAQ;;EAER,UAAU;EACV;IACE;IACA;IACA,MAAM;IACN;IACA,OAAO;;EAET;IAAU;IAA8B;;;wBAOpB,cACpB,2BACA,SAAS,kBACT,SAAS,mBACR,QAAQ"}
+{"version":3,"file":"index.d.ts","names":[],"sources":["../../src/diagnosis/findings.ts","../../src/diagnosis/first-failure.ts","../../src/diagnosis/deterministic.ts","../../src/diagnosis/model-pass.ts","../../src/diagnosis/engine.ts"],"mappings":";;;;;;;;;;;;;;KAWY;;KAGA;UAEK;EACf;EACA;EACA;;EAEA;;UAGe;EACf;EACA,UAAU;EACV;EACA;EACA,UAAU;;EAEV;EACA;EACA,YAAY;EACZ;;UAGe;EACf;EACA;;UAGe;EACf;EACA;;UAGe;EACf;EACA,QAAQ;EACR;;UAGe;EACf;EACA;IACE;IACA;IACA;IACA;;EAEF;IACE,cAAc,eAAe;IAC7B,SAAS;IACT,YAAY;;EAEd,UAAU;;KChBA;UAEK;EACf;EACA;EACA,OAAO;EACP;EACA;EACA,MAAM;;EAEN;;EAEA,gBAAgB;EAChB,OAAO;;EAEP;EACA;;UAGe;EACf;EACA;EACA,OAAO;;EAEP;EACA;EACA;;UAGe;EACf;EACA;EACA;;;;;;;UAQe;EACf;EACA;;EAEA;EACA;;KAGU,eACR,oBACA,wBACA,mBACA;;wBAGY,iBAAiB,gBAAgB,kBAAkB;UCjClD;EACf;EACA;EACA,aAAa;EACb;EACA;EACA;;EAEA,eAAe;;EAEf,WAAW;EACX;;UAGe;EACf,YAAY;EACZ,cAAc,eAAe;EAC7B,SAAS;EACT,OAAO;EACP,UAAU;EACV;;UCpEe;;EAEf,WAAW;;EAEX;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;IAAY;IAA4B;;;UAGzB;EACf;EACA;EACA;EACA;EACA;;UAGe;EACf;EACA;EACA;;UAGe;EACf;EACA;;UAGe;EACf;EACA;EACA;EACA;IAAa;IAAiB;IAAkB;;EAChD,OAAO;EACP;;UC/Be;;EAEf;;EAEA;;EAEA;;;;;EAKA;;EAEA;;EAEA;IAAa,MAAM;MAAQ;QAAe;MAA6B;;KAG7D;EACN;EAAuB;EAAiB,SAAS;;EACjD;EAAe,OAAO;EAAuB,SAAS;;UAE3C;EACf;EACA;EACA;EACA;;UAGe;;EAEf,UAAU;;EAEV,WAAW;;EAEX,OAAO;;EAEP,WAAW;IAAQ;IAAiB;;EACpC,OAAO;EACP,aAAa;EACb,QAAQ;;EAER,UAAU;EACV;IACE;IACA;IACA,MAAM;IACN;IACA,OAAO;;EAET;IAAU;IAA8B;;;wBAOpB,cACpB,2BACA,SAAS,kBACT,SAAS,mBACR,QAAQ"}

package/dist/diagnosis/index.js

@@ -1,13 +1,13 @@
-import { r as summarizeExecution } from "../analyze-runs-CHmsykNJ.js";
-import { a as redact, i as emptyRedactionReport, s as redactText } from "../redact-mtkTiJVk.js";
-import { t as packageVersion } from "../package-version-D7lQHt_-.js";
-import { r as classifyFailureReason } from "../failure-taxonomy-Bx5oWqaW.js";
-import { c as runPrimeExchange, n as buildPrimePrompt, o as primeProtocolSha256 } from "../prime-protocol-BFgGrEMP.js";
-import { t as nodeHttpPrimeBridgeTransport } from "../prime-bridge-transport-Z3cpKGoV.js";
-import { t as fromOtelSpans } from "../otel-spans-64hmQqON.js";
+import { r as summarizeExecution } from "../analyze-runs-CTheASYV.js";
+import { a as redact, i as emptyRedactionReport, s as redactText } from "../redact-D6APJS1d.js";
+import { t as packageVersion } from "../package-version-CJl_pY9W.js";
+import { r as classifyFailureReason } from "../failure-taxonomy-9eQfXKoW.js";
+import { c as runPrimeExchange, n as buildPrimePrompt, o as primeProtocolSha256 } from "../prime-protocol-CrhpXRz9.js";
+import { t as nodeHttpPrimeBridgeTransport } from "../prime-bridge-transport-Csd5SQg7.js";
+import { t as fromOtelSpans } from "../otel-spans-BsGzTWIK.js";
 import { createHash, createHmac, randomBytes } from "node:crypto";
 import { MODEL_ATTR_KEYS, SPAN_KINDS, TOOL_NAME_ATTR_KEYS, resolveSpanKind, validateTraceSpans } from "@tangle-network/agent-trace-contract";
-//#region src/diagnosis/first-failure.ts
+// src/diagnosis/first-failure.ts
 /** Span ids listed beside a result; the count carries the rest. */
 const MAX_FIRST_FAILURE_IDS = 8;
 const OUTCOME_ATTR = "agent.outcome";
@@ -91,8 +91,7 @@ function ambiguous(traceId, stage, candidates, reason) {
 		reason
 	};
 }
-//#endregion
-//#region src/diagnosis/spans.ts
+// src/diagnosis/spans.ts
 /**
 * Ingest for the diagnosis engine: flat spans in, filtered and normalized spans
 * out. Nothing downstream of this file sees an unfiltered value.
@@ -314,8 +313,7 @@ function firstString(attributes, keys) {
 function stringOr(value, fallback) {
 	return typeof value === "string" && value.length > 0 ? value : fallback;
 }
-//#endregion
-//#region src/diagnosis/deterministic.ts
+// src/diagnosis/deterministic.ts
 /**
 * The deterministic pass: everything the engine can say without a model.
 *
@@ -579,8 +577,7 @@ function pct(rate) {
 function round(value) {
 	return Math.round(value * 10) / 10;
 }
-//#endregion
-//#region src/diagnosis/findings.ts
+// src/diagnosis/findings.ts
 const SEVERITIES$1 = /* @__PURE__ */ new Set([
 	"critical",
 	"high",
@@ -691,8 +688,7 @@ function closed(value, allowed, at, errors) {
 function isObject(value) {
 	return value !== null && typeof value === "object" && !Array.isArray(value);
 }
-//#endregion
-//#region src/diagnosis/model-pass.ts
+// src/diagnosis/model-pass.ts
 const MAX_ROWS = 12;
 const MAX_STRING = 400;
 const SEVERITIES = /* @__PURE__ */ new Set([
@@ -1118,8 +1114,7 @@ function shortString(value) {
 	if (!trimmed) return void 0;
 	return trimmed.length <= MAX_STRING ? trimmed : `${trimmed.slice(0, MAX_STRING)}…`;
 }
-//#endregion
-//#region src/diagnosis/engine.ts
+// src/diagnosis/engine.ts
 /**
 * The agent-failure diagnosis engine: flat spans plus context in, a findings
 * document out.
@@ -1304,7 +1299,6 @@ function totalUsage(runs, pricing) {
 		usd
 	};
 }
-//#endregion
 export { diagnoseSpans, epochMillis, ingestSpans, isContentAttribute, nodeHttpPrimeBridgeTransport, rankFirstFailure };
 
 //# sourceMappingURL=index.js.map