@tangle-network/agent-eval 0.220.2 → 0.221.1

package/dist/benchmarks/index.d.ts

@@ -1,8 +1,8 @@
 import { c as RunSplitTag } from "../run-record-C3awiXPf.js";
-import "../index-Q6DvdcwI.js";
-import { a as CampaignResult } from "../types-CHfn1zg5.js";
-import { Wt as CampaignStorage } from "../search-kernel-Dloxd6gs.js";
-import { a as BenchmarkFamily, c as BenchmarkSource, i as BenchmarkEvaluation, l as BenchmarkTaskKind, n as BenchmarkAdapter, o as BenchmarkResponder, r as BenchmarkDatasetItem, s as BenchmarkScenario, t as BENCHMARK_SPLIT_SEED, u as deterministicSplit } from "../types-D8GXK9Z5.js";
+import "../index-BvX3CFNS.js";
+import { a as CampaignResult } from "../types-DDKfH-N6.js";
+import { Wt as CampaignStorage } from "../search-kernel-C6__V0IS.js";
+import { a as BenchmarkFamily, c as BenchmarkSource, i as BenchmarkEvaluation, l as BenchmarkTaskKind, n as BenchmarkAdapter, o as BenchmarkResponder, r as BenchmarkDatasetItem, s as BenchmarkScenario, t as BENCHMARK_SPLIT_SEED, u as deterministicSplit } from "../types-IERw_HxR.js";
 //#region src/benchmarks/calibration.d.ts
 interface BenchmarkMetricCalibrationOptions<TPayload = unknown, TArtifact = string> {
   adapter: BenchmarkAdapter<BenchmarkDatasetItem<TPayload>, TPayload, TArtifact>;

package/dist/benchmarks/index.js

@@ -1,7 +1,7 @@
 import { t as __exportAll } from "../rolldown-runtime-8H4AJuhK.js";
-import { Q as runCampaign } from "../llm-judge-Cc8vDJh_.js";
-import { M as fsCampaignStorage } from "../external-optimizer-subprocess-D670Oxf2.js";
-import "../campaign-BVPC6ODQ.js";
+import { Q as runCampaign } from "../llm-judge-3uAeRawE.js";
+import { M as fsCampaignStorage } from "../external-optimizer-subprocess-DA02c_L6.js";
+import "../campaign-Bt6rbWIU.js";
 import { join, resolve } from "node:path";
 import { readFile, readdir, stat } from "node:fs/promises";
 import { parse } from "smol-toml";

package/dist/calibration-CTwxpJ-t.js

@@ -0,0 +1,197 @@
+import { s as runMetricExtractor } from "./query-B_RZ36an.js";
+import { i as reduceOutcomeMetric, t as assertUniqueObservationIds } from "./outcome-observations-FLmRpgYa.js";
+//#region src/meta-eval/calibration.ts
+/**
+* Calibration curve — binned "if eval says X, what does reality show?"
+*
+* Companion to correlationStudy. Raw correlation is a single number;
+* the calibration curve shows *where* the eval is well-calibrated vs
+* overconfident / underconfident. Buckets the eval metric, computes
+* mean outcome per bucket, reports expected-calibration-error (ECE).
+*/
+async function calibrationCurve(traceStore, outcomeStore, evalMetric, outcomeMetric, options = {}) {
+	const settings = {
+		...options,
+		range: options.range === void 0 ? void 0 : { ...options.range }
+	};
+	validateCalibrationRequest(evalMetric.id, outcomeMetric, settings);
+	const extract = evalMetric.extract ?? runMetricExtractor(evalMetric.id);
+	const metricId = evalMetric.id;
+	const runs = await traceStore.listRuns();
+	assertUniqueObservationIds(runs.map((run) => run.runId), "runId");
+	const outcomes = await outcomeStore.list();
+	const byRun = /* @__PURE__ */ new Map();
+	for (const o of outcomes) {
+		const arr = byRun.get(o.runId) ?? [];
+		arr.push(o);
+		byRun.set(o.runId, arr);
+	}
+	const pairs = [];
+	for (const run of runs) {
+		const os = byRun.get(run.runId);
+		if (!os?.length) continue;
+		const x = await extract(run, traceStore);
+		if (x === null || !Number.isFinite(x)) continue;
+		const y = reduceOutcomeMetric(os, outcomeMetric, "latest");
+		if (y === null) continue;
+		pairs.push({
+			x,
+			y
+		});
+	}
+	if (pairs.length < 2) return null;
+	return calibrationFromPairs(pairs.map((p) => ({
+		evalScore: p.x,
+		outcome: p.y
+	})), metricId, outcomeMetric, settings);
+}
+/** Measure already joined observations without constructing trace and outcome stores. */
+function calibrationFromPairs(inputPairs, evalMetric, outcomeMetric, options = {}) {
+	validateCalibrationRequest(evalMetric, outcomeMetric, options);
+	for (const [index, pair] of inputPairs.entries()) if (pair === null || typeof pair !== "object" || !Number.isFinite(pair.evalScore) || !Number.isFinite(pair.outcome)) throw new Error(`calibration pair ${index} must contain finite evalScore and outcome values`);
+	const pairs = inputPairs;
+	if (pairs.length < 2) return null;
+	const numBins = options.bins ?? 10;
+	const binning = options.binning ?? "equal-width";
+	const xs = pairs.map((p) => p.evalScore);
+	const lo = options.range?.lo ?? Math.min(...xs);
+	const hi = options.range?.hi ?? Math.max(...xs);
+	const span = hi - lo;
+	if (!Number.isFinite(span)) throw new Error("calibration range span must be finite");
+	const clipped = pairs.map((pair) => ({
+		...pair,
+		evalScore: Math.min(hi, Math.max(lo, pair.evalScore))
+	}));
+	const bins = [];
+	if (span === 0 || clipped.every((pair) => pair.evalScore === clipped[0].evalScore)) bins.push(toBin(clipped));
+	else if (binning === "equal-frequency") {
+		const sorted = [...clipped].sort((a, b) => a.evalScore - b.evalScore);
+		const count = Math.min(numBins, sorted.length);
+		for (let i = 0; i < count; i++) {
+			const start = Math.floor(i * sorted.length / count);
+			const end = Math.floor((i + 1) * sorted.length / count);
+			bins.push(toBin(sorted.slice(start, end)));
+		}
+	} else {
+		const groups = /* @__PURE__ */ new Map();
+		for (const pair of clipped) {
+			const index = Math.min(numBins - 1, Math.floor((pair.evalScore - lo) / span * numBins));
+			const group = groups.get(index) ?? [];
+			group.push(pair);
+			groups.set(index, group);
+		}
+		for (const [index, chunk] of [...groups].sort(([a], [b]) => a - b)) bins.push(toBin(chunk, lo + span * (index / numBins), lo + span * ((index + 1) / numBins)));
+	}
+	const total = bins.reduce((a, b) => a + b.n, 0);
+	const ece = bins.reduce((a, b) => a + b.n / total * b.gap, 0);
+	const maxGap = bins.reduce((a, b) => Math.max(a, b.gap), 0);
+	return {
+		evalMetric,
+		outcomeMetric,
+		n: pairs.length,
+		bins,
+		ece,
+		maxGap
+	};
+}
+/**
+* Mean squared error of probability forecasts against binary outcomes, Σ(p − y)²/N; always
+* forecasting 0.5 scores 0.25. For the reliability table and ECE use `calibrationFromPairs`
+* with `range: { lo: 0, hi: 1 }` (`binning: 'equal-frequency'` gives equal-mass bins).
+*/
+function brierScore(pairs) {
+	if (!pairs.length) throw new Error("Brier score requires at least one pair");
+	let total = 0;
+	for (const [index, pair] of pairs.entries()) {
+		if (pair === null || typeof pair !== "object" || !(pair.evalScore >= 0 && pair.evalScore <= 1) || pair.outcome !== 0 && pair.outcome !== 1) throw new Error(`Brier pair ${index} needs a probability in [0, 1] and an outcome of 0 or 1`);
+		total += (pair.evalScore - pair.outcome) ** 2;
+	}
+	return total / pairs.length;
+}
+/**
+* Multiclass Brier score in its sum form, mean over forecasts of Σₖ(pₖ − yₖ)², range [0, 2].
+* With two outcomes it is twice the binary `brierScore`. A uniform forecast over K outcomes
+* scores 1 − 1/K. The distribution is not renormalized here: repair provider rounding before
+* scoring (`normalizeSystemOneResult` in `/systemone/protocol`), so a defective answer stays
+* visible instead of being scored as if it were valid.
+*/
+function multiclassBrierScore(forecasts) {
+	if (!forecasts.length) throw new Error("multiclass Brier score requires at least one forecast");
+	let total = 0;
+	for (const [index, forecast] of forecasts.entries()) {
+		const entries = categoricalEntries(forecast, index, "multiclass Brier");
+		for (const [name, probability] of entries) total += (probability - (name === forecast.outcome ? 1 : 0)) ** 2;
+	}
+	return total / forecasts.length;
+}
+/**
+* Ranked probability score, mean over forecasts of Σₖ₌₁ᴷ⁻¹(Fₖ − Oₖ)² / (K − 1), where F and O are
+* the cumulative forecast and observation, range [0, 1]. Unlike multiclass Brier it charges
+* less for mass on a level next to the outcome than for mass far from it, which is the right
+* penalty for score questions. With two levels it equals the binary Brier score.
+*/
+function rankedProbabilityScore(forecasts) {
+	if (!forecasts.length) throw new Error("ranked probability score requires at least one forecast");
+	let total = 0;
+	for (const [index, forecast] of forecasts.entries()) {
+		const probabilities = forecast?.probabilities;
+		if (!Array.isArray(probabilities) || probabilities.length < 2) throw new Error(`RPS forecast ${index} needs at least two level probabilities`);
+		assertDistribution(probabilities, `RPS forecast ${index}`);
+		if (!Number.isInteger(forecast.outcome) || forecast.outcome < 0 || forecast.outcome >= probabilities.length) throw new Error(`RPS forecast ${index} outcome must index one of its ${probabilities.length} levels`);
+		let cumulative = 0;
+		let sum = 0;
+		for (let level = 0; level < probabilities.length - 1; level++) {
+			cumulative += probabilities[level];
+			sum += (cumulative - (level >= forecast.outcome ? 1 : 0)) ** 2;
+		}
+		total += sum / (probabilities.length - 1);
+	}
+	return total / forecasts.length;
+}
+function categoricalEntries(forecast, index, label) {
+	if (forecast === null || typeof forecast !== "object" || typeof forecast.outcome !== "string") throw new Error(`${label} forecast ${index} needs probabilities and a string outcome`);
+	const probabilities = forecast.probabilities;
+	if (probabilities === null || typeof probabilities !== "object" || Array.isArray(probabilities)) throw new Error(`${label} forecast ${index} probabilities must be an object keyed by outcome`);
+	const entries = Object.entries(probabilities);
+	if (entries.length < 2) throw new Error(`${label} forecast ${index} needs at least two outcomes`);
+	if (!entries.some(([name]) => name === forecast.outcome)) throw new Error(`${label} forecast ${index} has no probability for outcome ${JSON.stringify(forecast.outcome)}`);
+	assertDistribution(entries.map(([, probability]) => probability), `${label} forecast ${index}`);
+	return entries;
+}
+function assertDistribution(probabilities, label) {
+	let sum = 0;
+	for (const probability of probabilities) {
+		if (!(probability >= 0 && probability <= 1)) throw new Error(`${label} has a probability outside [0, 1]: ${probability}`);
+		sum += probability;
+	}
+	if (Math.abs(sum - 1) > 1e-6) throw new Error(`${label} probabilities sum to ${sum}, not 1`);
+}
+function toBin(chunk, lower, upper) {
+	const xs = chunk.map((c) => c.evalScore);
+	const ys = chunk.map((c) => c.outcome);
+	const evalMean = mean(xs);
+	const outcomeMean = mean(ys);
+	return {
+		lower: lower ?? Math.min(...xs),
+		upper: upper ?? Math.max(...xs),
+		n: chunk.length,
+		evalMean,
+		outcomeMean,
+		gap: Math.abs(outcomeMean - evalMean)
+	};
+}
+function mean(xs) {
+	return xs.reduce((sum, value) => sum + value / xs.length, 0);
+}
+function validateCalibrationRequest(evalMetric, outcomeMetric, options) {
+	assertUniqueObservationIds([evalMetric], "eval metric");
+	assertUniqueObservationIds([outcomeMetric], "outcome metric");
+	if (evalMetric.trim() !== evalMetric || outcomeMetric.trim() !== outcomeMetric) throw new Error("calibration metric identities must not have surrounding whitespace");
+	if (options.bins !== void 0 && (!Number.isSafeInteger(options.bins) || options.bins < 1)) throw new Error("calibration bins must be a positive safe integer");
+	if (options.binning !== void 0 && !["equal-width", "equal-frequency"].includes(options.binning)) throw new Error("calibration binning must be equal-width or equal-frequency");
+	if (options.range !== void 0 && (!Number.isFinite(options.range.lo) || !Number.isFinite(options.range.hi) || !Number.isFinite(options.range.hi - options.range.lo) || options.range.hi < options.range.lo)) throw new Error("calibration range must have finite ordered bounds");
+}
+//#endregion
+export { rankedProbabilityScore as a, multiclassBrierScore as i, calibrationCurve as n, calibrationFromPairs as r, brierScore as t };
+
+//# sourceMappingURL=calibration-CTwxpJ-t.js.map

package/dist/calibration-CTwxpJ-t.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"calibration-CTwxpJ-t.js","names":[],"sources":["../src/meta-eval/calibration.ts"],"sourcesContent":["/**\n * Calibration curve — binned \"if eval says X, what does reality show?\"\n *\n * Companion to correlationStudy. Raw correlation is a single number;\n * the calibration curve shows *where* the eval is well-calibrated vs\n * overconfident / underconfident. Buckets the eval metric, computes\n * mean outcome per bucket, reports expected-calibration-error (ECE).\n */\n\nimport { runMetricExtractor } from '../trace/query'\nimport type { TraceStore } from '../trace/store'\nimport type { EvalMetricSpec } from './correlation-study'\nimport { assertUniqueObservationIds, reduceOutcomeMetric } from './outcome-observations'\nimport type { DeploymentOutcome, OutcomeStore } from './outcome-store'\n\nexport interface CalibrationBin {\n  lower: number\n  upper: number\n  n: number\n  evalMean: number\n  outcomeMean: number\n  /** |outcomeMean − evalMean|; contributes to ECE weighted by n/total. */\n  gap: number\n}\n\nexport interface CalibrationReport {\n  evalMetric: string\n  outcomeMetric: string\n  n: number\n  bins: CalibrationBin[]\n  /** Expected Calibration Error — Σ (n_i/N) × |outcomeMean_i − evalMean_i|. */\n  ece: number\n  /** Largest observed difference between a bin's mean score and mean outcome. */\n  maxGap: number\n}\n\nexport interface CalibrationOptions {\n  /** Positive integer; empty bins are omitted. Default 10. */\n  bins?: number\n  /** Equal-width (fixed bin edges) or equal-frequency (quantile bins). */\n  binning?: 'equal-width' | 'equal-frequency'\n  /** Clip eval values to [lo, hi] before binning. */\n  range?: { lo: number; hi: number }\n}\n\nexport interface CalibrationPair {\n  evalScore: number\n  outcome: number\n}\n\nexport async function calibrationCurve(\n  traceStore: TraceStore,\n  outcomeStore: OutcomeStore,\n  evalMetric: EvalMetricSpec,\n  outcomeMetric: string,\n  options: CalibrationOptions = {},\n): Promise<CalibrationReport | null> {\n  const settings = {\n    ...options,\n    range: options.range === undefined ? undefined : { ...options.range },\n  }\n  validateCalibrationRequest(evalMetric.id, outcomeMetric, settings)\n  const extract = evalMetric.extract ?? runMetricExtractor(evalMetric.id)\n  const metricId = evalMetric.id\n  const runs = await traceStore.listRuns()\n  assertUniqueObservationIds(\n    runs.map((run) => run.runId),\n    'runId',\n  )\n  const outcomes = await outcomeStore.list()\n  const byRun = new Map<string, DeploymentOutcome[]>()\n  for (const o of outcomes) {\n    const arr = byRun.get(o.runId) ?? []\n    arr.push(o)\n    byRun.set(o.runId, arr)\n  }\n\n  const pairs: Array<{ x: number; y: number }> = []\n  for (const run of runs) {\n    const os = byRun.get(run.runId)\n    if (!os?.length) continue\n    const x = await extract(run, traceStore)\n    if (x === null || !Number.isFinite(x)) continue\n    const y = reduceOutcomeMetric(os, outcomeMetric, 'latest')\n    if (y === null) continue\n    pairs.push({ x, y })\n  }\n  if (pairs.length < 2) return null\n\n  return calibrationFromPairs(\n    pairs.map((p) => ({ evalScore: p.x, outcome: p.y })),\n    metricId,\n    outcomeMetric,\n    settings,\n  )\n}\n\n/** Measure already joined observations without constructing trace and outcome stores. */\nexport function calibrationFromPairs(\n  inputPairs: readonly CalibrationPair[],\n  evalMetric: string,\n  outcomeMetric: string,\n  options: CalibrationOptions = {},\n): CalibrationReport | null {\n  validateCalibrationRequest(evalMetric, outcomeMetric, options)\n  for (const [index, pair] of inputPairs.entries()) {\n    if (\n      pair === null ||\n      typeof pair !== 'object' ||\n      !Number.isFinite(pair.evalScore) ||\n      !Number.isFinite(pair.outcome)\n    ) {\n      throw new Error(`calibration pair ${index} must contain finite evalScore and outcome values`)\n    }\n  }\n  const pairs = inputPairs\n  if (pairs.length < 2) return null\n\n  const numBins = options.bins ?? 10\n  const binning = options.binning ?? 'equal-width'\n  const xs = pairs.map((p) => p.evalScore)\n  const lo = options.range?.lo ?? Math.min(...xs)\n  const hi = options.range?.hi ?? Math.max(...xs)\n  const span = hi - lo\n  if (!Number.isFinite(span)) throw new Error('calibration range span must be finite')\n  const clipped = pairs.map((pair) => ({\n    ...pair,\n    evalScore: Math.min(hi, Math.max(lo, pair.evalScore)),\n  }))\n\n  const bins: CalibrationBin[] = []\n  if (span === 0 || clipped.every((pair) => pair.evalScore === clipped[0]!.evalScore)) {\n    bins.push(toBin(clipped))\n  } else if (binning === 'equal-frequency') {\n    const sorted = [...clipped].sort((a, b) => a.evalScore - b.evalScore)\n    const count = Math.min(numBins, sorted.length)\n    for (let i = 0; i < count; i++) {\n      const start = Math.floor((i * sorted.length) / count)\n      const end = Math.floor(((i + 1) * sorted.length) / count)\n      bins.push(toBin(sorted.slice(start, end)))\n    }\n  } else {\n    const groups = new Map<number, CalibrationPair[]>()\n    for (const pair of clipped) {\n      const index = Math.min(numBins - 1, Math.floor(((pair.evalScore - lo) / span) * numBins))\n      const group = groups.get(index) ?? []\n      group.push(pair)\n      groups.set(index, group)\n    }\n    for (const [index, chunk] of [...groups].sort(([a], [b]) => a - b)) {\n      bins.push(toBin(chunk, lo + span * (index / numBins), lo + span * ((index + 1) / numBins)))\n    }\n  }\n\n  const total = bins.reduce((a, b) => a + b.n, 0)\n  const ece = bins.reduce((a, b) => a + (b.n / total) * b.gap, 0)\n  const maxGap = bins.reduce((a, b) => Math.max(a, b.gap), 0)\n\n  return { evalMetric, outcomeMetric, n: pairs.length, bins, ece, maxGap }\n}\n\n/**\n * Mean squared error of probability forecasts against binary outcomes, Σ(p − y)²/N; always\n * forecasting 0.5 scores 0.25. For the reliability table and ECE use `calibrationFromPairs`\n * with `range: { lo: 0, hi: 1 }` (`binning: 'equal-frequency'` gives equal-mass bins).\n */\nexport function brierScore(pairs: readonly CalibrationPair[]): number {\n  if (!pairs.length) throw new Error('Brier score requires at least one pair')\n  let total = 0\n  for (const [index, pair] of pairs.entries()) {\n    if (\n      pair === null ||\n      typeof pair !== 'object' ||\n      !(pair.evalScore >= 0 && pair.evalScore <= 1) ||\n      (pair.outcome !== 0 && pair.outcome !== 1)\n    ) {\n      throw new Error(`Brier pair ${index} needs a probability in [0, 1] and an outcome of 0 or 1`)\n    }\n    total += (pair.evalScore - pair.outcome) ** 2\n  }\n  return total / pairs.length\n}\n\n/** One categorical forecast: a distribution over named outcomes and the outcome that occurred. */\nexport interface CategoricalForecast {\n  /** Probability per outcome name. Must sum to 1 within 1e-6 and include `outcome`. */\n  probabilities: Readonly<Record<string, number>>\n  outcome: string\n}\n\n/**\n * Multiclass Brier score in its sum form, mean over forecasts of Σₖ(pₖ − yₖ)², range [0, 2].\n * With two outcomes it is twice the binary `brierScore`. A uniform forecast over K outcomes\n * scores 1 − 1/K. The distribution is not renormalized here: repair provider rounding before\n * scoring (`normalizeSystemOneResult` in `/systemone/protocol`), so a defective answer stays\n * visible instead of being scored as if it were valid.\n */\nexport function multiclassBrierScore(forecasts: readonly CategoricalForecast[]): number {\n  if (!forecasts.length) throw new Error('multiclass Brier score requires at least one forecast')\n  let total = 0\n  for (const [index, forecast] of forecasts.entries()) {\n    const entries = categoricalEntries(forecast, index, 'multiclass Brier')\n    for (const [name, probability] of entries) {\n      total += (probability - (name === forecast.outcome ? 1 : 0)) ** 2\n    }\n  }\n  return total / forecasts.length\n}\n\n/** One ordinal forecast: probabilities in level order, lowest level first. */\nexport interface OrdinalForecast {\n  probabilities: readonly number[]\n  /** Index into `probabilities` of the level that occurred. */\n  outcome: number\n}\n\n/**\n * Ranked probability score, mean over forecasts of Σₖ₌₁ᴷ⁻¹(Fₖ − Oₖ)² / (K − 1), where F and O are\n * the cumulative forecast and observation, range [0, 1]. Unlike multiclass Brier it charges\n * less for mass on a level next to the outcome than for mass far from it, which is the right\n * penalty for score questions. With two levels it equals the binary Brier score.\n */\nexport function rankedProbabilityScore(forecasts: readonly OrdinalForecast[]): number {\n  if (!forecasts.length) throw new Error('ranked probability score requires at least one forecast')\n  let total = 0\n  for (const [index, forecast] of forecasts.entries()) {\n    const probabilities = forecast?.probabilities\n    if (!Array.isArray(probabilities) || probabilities.length < 2) {\n      throw new Error(`RPS forecast ${index} needs at least two level probabilities`)\n    }\n    assertDistribution(probabilities, `RPS forecast ${index}`)\n    if (\n      !Number.isInteger(forecast.outcome) ||\n      forecast.outcome < 0 ||\n      forecast.outcome >= probabilities.length\n    ) {\n      throw new Error(\n        `RPS forecast ${index} outcome must index one of its ${probabilities.length} levels`,\n      )\n    }\n    let cumulative = 0\n    let sum = 0\n    for (let level = 0; level < probabilities.length - 1; level++) {\n      cumulative += probabilities[level]!\n      sum += (cumulative - (level >= forecast.outcome ? 1 : 0)) ** 2\n    }\n    total += sum / (probabilities.length - 1)\n  }\n  return total / forecasts.length\n}\n\nfunction categoricalEntries(\n  forecast: CategoricalForecast,\n  index: number,\n  label: string,\n): [string, number][] {\n  if (forecast === null || typeof forecast !== 'object' || typeof forecast.outcome !== 'string') {\n    throw new Error(`${label} forecast ${index} needs probabilities and a string outcome`)\n  }\n  const probabilities = forecast.probabilities\n  if (probabilities === null || typeof probabilities !== 'object' || Array.isArray(probabilities)) {\n    throw new Error(`${label} forecast ${index} probabilities must be an object keyed by outcome`)\n  }\n  const entries = Object.entries(probabilities)\n  if (entries.length < 2) throw new Error(`${label} forecast ${index} needs at least two outcomes`)\n  if (!entries.some(([name]) => name === forecast.outcome)) {\n    throw new Error(\n      `${label} forecast ${index} has no probability for outcome ${JSON.stringify(forecast.outcome)}`,\n    )\n  }\n  assertDistribution(\n    entries.map(([, probability]) => probability),\n    `${label} forecast ${index}`,\n  )\n  return entries\n}\n\nfunction assertDistribution(probabilities: readonly number[], label: string): void {\n  let sum = 0\n  for (const probability of probabilities) {\n    if (!(probability >= 0 && probability <= 1)) {\n      throw new Error(`${label} has a probability outside [0, 1]: ${probability}`)\n    }\n    sum += probability\n  }\n  if (Math.abs(sum - 1) > 1e-6) throw new Error(`${label} probabilities sum to ${sum}, not 1`)\n}\n\nfunction toBin(chunk: CalibrationPair[], lower?: number, upper?: number): CalibrationBin {\n  const xs = chunk.map((c) => c.evalScore)\n  const ys = chunk.map((c) => c.outcome)\n  const evalMean = mean(xs)\n  const outcomeMean = mean(ys)\n  return {\n    lower: lower ?? Math.min(...xs),\n    upper: upper ?? Math.max(...xs),\n    n: chunk.length,\n    evalMean,\n    outcomeMean,\n    gap: Math.abs(outcomeMean - evalMean),\n  }\n}\n\nfunction mean(xs: number[]): number {\n  return xs.reduce((sum, value) => sum + value / xs.length, 0)\n}\n\nfunction validateCalibrationRequest(\n  evalMetric: string,\n  outcomeMetric: string,\n  options: CalibrationOptions,\n): void {\n  assertUniqueObservationIds([evalMetric], 'eval metric')\n  assertUniqueObservationIds([outcomeMetric], 'outcome metric')\n  if (evalMetric.trim() !== evalMetric || outcomeMetric.trim() !== outcomeMetric) {\n    throw new Error('calibration metric identities must not have surrounding whitespace')\n  }\n  if (options.bins !== undefined && (!Number.isSafeInteger(options.bins) || options.bins < 1)) {\n    throw new Error('calibration bins must be a positive safe integer')\n  }\n  if (\n    options.binning !== undefined &&\n    !['equal-width', 'equal-frequency'].includes(options.binning)\n  ) {\n    throw new Error('calibration binning must be equal-width or equal-frequency')\n  }\n  if (\n    options.range !== undefined &&\n    (!Number.isFinite(options.range.lo) ||\n      !Number.isFinite(options.range.hi) ||\n      !Number.isFinite(options.range.hi - options.range.lo) ||\n      options.range.hi < options.range.lo)\n  ) {\n    throw new Error('calibration range must have finite ordered bounds')\n  }\n}\n"],"mappings":";;;;;;;;;;;AAkDA,eAAsB,iBACpB,YACA,cACA,YACA,eACA,UAA8B,CAAC,GACI;CACnC,MAAM,WAAW;EACf,GAAG;EACH,OAAO,QAAQ,UAAU,KAAA,IAAY,KAAA,IAAY,EAAE,GAAG,QAAQ,MAAM;CACtE;CACA,2BAA2B,WAAW,IAAI,eAAe,QAAQ;CACjE,MAAM,UAAU,WAAW,WAAW,mBAAmB,WAAW,EAAE;CACtE,MAAM,WAAW,WAAW;CAC5B,MAAM,OAAO,MAAM,WAAW,SAAS;CACvC,2BACE,KAAK,KAAK,QAAQ,IAAI,KAAK,GAC3B,OACF;CACA,MAAM,WAAW,MAAM,aAAa,KAAK;CACzC,MAAM,wBAAQ,IAAI,IAAiC;CACnD,KAAK,MAAM,KAAK,UAAU;EACxB,MAAM,MAAM,MAAM,IAAI,EAAE,KAAK,KAAK,CAAC;EACnC,IAAI,KAAK,CAAC;EACV,MAAM,IAAI,EAAE,OAAO,GAAG;CACxB;CAEA,MAAM,QAAyC,CAAC;CAChD,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,KAAK,MAAM,IAAI,IAAI,KAAK;EAC9B,IAAI,CAAC,IAAI,QAAQ;EACjB,MAAM,IAAI,MAAM,QAAQ,KAAK,UAAU;EACvC,IAAI,MAAM,QAAQ,CAAC,OAAO,SAAS,CAAC,GAAG;EACvC,MAAM,IAAI,oBAAoB,IAAI,eAAe,QAAQ;EACzD,IAAI,MAAM,MAAM;EAChB,MAAM,KAAK;GAAE;GAAG;EAAE,CAAC;CACrB;CACA,IAAI,MAAM,SAAS,GAAG,OAAO;CAE7B,OAAO,qBACL,MAAM,KAAK,OAAO;EAAE,WAAW,EAAE;EAAG,SAAS,EAAE;CAAE,EAAE,GACnD,UACA,eACA,QACF;AACF;;AAGA,SAAgB,qBACd,YACA,YACA,eACA,UAA8B,CAAC,GACL;CAC1B,2BAA2B,YAAY,eAAe,OAAO;CAC7D,KAAK,MAAM,CAAC,OAAO,SAAS,WAAW,QAAQ,GAC7C,IACE,SAAS,QACT,OAAO,SAAS,YAChB,CAAC,OAAO,SAAS,KAAK,SAAS,KAC/B,CAAC,OAAO,SAAS,KAAK,OAAO,GAE7B,MAAM,IAAI,MAAM,oBAAoB,MAAM,kDAAkD;CAGhG,MAAM,QAAQ;CACd,IAAI,MAAM,SAAS,GAAG,OAAO;CAE7B,MAAM,UAAU,QAAQ,QAAQ;CAChC,MAAM,UAAU,QAAQ,WAAW;CACnC,MAAM,KAAK,MAAM,KAAK,MAAM,EAAE,SAAS;CACvC,MAAM,KAAK,QAAQ,OAAO,MAAM,KAAK,IAAI,GAAG,EAAE;CAC9C,MAAM,KAAK,QAAQ,OAAO,MAAM,KAAK,IAAI,GAAG,EAAE;CAC9C,MAAM,OAAO,KAAK;CAClB,IAAI,CAAC,OAAO,SAAS,IAAI,GAAG,MAAM,IAAI,MAAM,uCAAuC;CACnF,MAAM,UAAU,MAAM,KAAK,UAAU;EACnC,GAAG;EACH,WAAW,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,SAAS,CAAC;CACtD,EAAE;CAEF,MAAM,OAAyB,CAAC;CAChC,IAAI,SAAS,KAAK,QAAQ,OAAO,SAAS,KAAK,cAAc,QAAQ,EAAE,CAAE,SAAS,GAChF,KAAK,KAAK,MAAM,OAAO,CAAC;MACnB,IAAI,YAAY,mBAAmB;EACxC,MAAM,SAAS,CAAC,GAAG,OAAO,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;EACpE,MAAM,QAAQ,KAAK,IAAI,SAAS,OAAO,MAAM;EAC7C,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,MAAM,QAAQ,KAAK,MAAO,IAAI,OAAO,SAAU,KAAK;GACpD,MAAM,MAAM,KAAK,OAAQ,IAAI,KAAK,OAAO,SAAU,KAAK;GACxD,KAAK,KAAK,MAAM,OAAO,MAAM,OAAO,GAAG,CAAC,CAAC;EAC3C;CACF,OAAO;EACL,MAAM,yBAAS,IAAI,IAA+B;EAClD,KAAK,MAAM,QAAQ,SAAS;GAC1B,MAAM,QAAQ,KAAK,IAAI,UAAU,GAAG,KAAK,OAAQ,KAAK,YAAY,MAAM,OAAQ,OAAO,CAAC;GACxF,MAAM,QAAQ,OAAO,IAAI,KAAK,KAAK,CAAC;GACpC,MAAM,KAAK,IAAI;GACf,OAAO,IAAI,OAAO,KAAK;EACzB;EACA,KAAK,MAAM,CAAC,OAAO,UAAU,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,GAC/D,KAAK,KAAK,MAAM,OAAO,KAAK,QAAQ,QAAQ,UAAU,KAAK,SAAS,QAAQ,KAAK,QAAQ,CAAC;CAE9F;CAEA,MAAM,QAAQ,KAAK,QAAQ,GAAG,MAAM,IAAI,EAAE,GAAG,CAAC;CAC9C,MAAM,MAAM,KAAK,QAAQ,GAAG,MAAM,IAAK,EAAE,IAAI,QAAS,EAAE,KAAK,CAAC;CAC9D,MAAM,SAAS,KAAK,QAAQ,GAAG,MAAM,KAAK,IAAI,GAAG,EAAE,GAAG,GAAG,CAAC;CAE1D,OAAO;EAAE;EAAY;EAAe,GAAG,MAAM;EAAQ;EAAM;EAAK;CAAO;AACzE;;;;;;AAOA,SAAgB,WAAW,OAA2C;CACpE,IAAI,CAAC,MAAM,QAAQ,MAAM,IAAI,MAAM,wCAAwC;CAC3E,IAAI,QAAQ;CACZ,KAAK,MAAM,CAAC,OAAO,SAAS,MAAM,QAAQ,GAAG;EAC3C,IACE,SAAS,QACT,OAAO,SAAS,YAChB,EAAE,KAAK,aAAa,KAAK,KAAK,aAAa,MAC1C,KAAK,YAAY,KAAK,KAAK,YAAY,GAExC,MAAM,IAAI,MAAM,cAAc,MAAM,wDAAwD;EAE9F,UAAU,KAAK,YAAY,KAAK,YAAY;CAC9C;CACA,OAAO,QAAQ,MAAM;AACvB;;;;;;;;AAgBA,SAAgB,qBAAqB,WAAmD;CACtF,IAAI,CAAC,UAAU,QAAQ,MAAM,IAAI,MAAM,uDAAuD;CAC9F,IAAI,QAAQ;CACZ,KAAK,MAAM,CAAC,OAAO,aAAa,UAAU,QAAQ,GAAG;EACnD,MAAM,UAAU,mBAAmB,UAAU,OAAO,kBAAkB;EACtE,KAAK,MAAM,CAAC,MAAM,gBAAgB,SAChC,UAAU,eAAe,SAAS,SAAS,UAAU,IAAI,OAAO;CAEpE;CACA,OAAO,QAAQ,UAAU;AAC3B;;;;;;;AAeA,SAAgB,uBAAuB,WAA+C;CACpF,IAAI,CAAC,UAAU,QAAQ,MAAM,IAAI,MAAM,yDAAyD;CAChG,IAAI,QAAQ;CACZ,KAAK,MAAM,CAAC,OAAO,aAAa,UAAU,QAAQ,GAAG;EACnD,MAAM,gBAAgB,UAAU;EAChC,IAAI,CAAC,MAAM,QAAQ,aAAa,KAAK,cAAc,SAAS,GAC1D,MAAM,IAAI,MAAM,gBAAgB,MAAM,wCAAwC;EAEhF,mBAAmB,eAAe,gBAAgB,OAAO;EACzD,IACE,CAAC,OAAO,UAAU,SAAS,OAAO,KAClC,SAAS,UAAU,KACnB,SAAS,WAAW,cAAc,QAElC,MAAM,IAAI,MACR,gBAAgB,MAAM,iCAAiC,cAAc,OAAO,QAC9E;EAEF,IAAI,aAAa;EACjB,IAAI,MAAM;EACV,KAAK,IAAI,QAAQ,GAAG,QAAQ,cAAc,SAAS,GAAG,SAAS;GAC7D,cAAc,cAAc;GAC5B,QAAQ,cAAc,SAAS,SAAS,UAAU,IAAI,OAAO;EAC/D;EACA,SAAS,OAAO,cAAc,SAAS;CACzC;CACA,OAAO,QAAQ,UAAU;AAC3B;AAEA,SAAS,mBACP,UACA,OACA,OACoB;CACpB,IAAI,aAAa,QAAQ,OAAO,aAAa,YAAY,OAAO,SAAS,YAAY,UACnF,MAAM,IAAI,MAAM,GAAG,MAAM,YAAY,MAAM,0CAA0C;CAEvF,MAAM,gBAAgB,SAAS;CAC/B,IAAI,kBAAkB,QAAQ,OAAO,kBAAkB,YAAY,MAAM,QAAQ,aAAa,GAC5F,MAAM,IAAI,MAAM,GAAG,MAAM,YAAY,MAAM,kDAAkD;CAE/F,MAAM,UAAU,OAAO,QAAQ,aAAa;CAC5C,IAAI,QAAQ,SAAS,GAAG,MAAM,IAAI,MAAM,GAAG,MAAM,YAAY,MAAM,6BAA6B;CAChG,IAAI,CAAC,QAAQ,MAAM,CAAC,UAAU,SAAS,SAAS,OAAO,GACrD,MAAM,IAAI,MACR,GAAG,MAAM,YAAY,MAAM,kCAAkC,KAAK,UAAU,SAAS,OAAO,GAC9F;CAEF,mBACE,QAAQ,KAAK,GAAG,iBAAiB,WAAW,GAC5C,GAAG,MAAM,YAAY,OACvB;CACA,OAAO;AACT;AAEA,SAAS,mBAAmB,eAAkC,OAAqB;CACjF,IAAI,MAAM;CACV,KAAK,MAAM,eAAe,eAAe;EACvC,IAAI,EAAE,eAAe,KAAK,eAAe,IACvC,MAAM,IAAI,MAAM,GAAG,MAAM,qCAAqC,aAAa;EAE7E,OAAO;CACT;CACA,IAAI,KAAK,IAAI,MAAM,CAAC,IAAI,MAAM,MAAM,IAAI,MAAM,GAAG,MAAM,wBAAwB,IAAI,QAAQ;AAC7F;AAEA,SAAS,MAAM,OAA0B,OAAgB,OAAgC;CACvF,MAAM,KAAK,MAAM,KAAK,MAAM,EAAE,SAAS;CACvC,MAAM,KAAK,MAAM,KAAK,MAAM,EAAE,OAAO;CACrC,MAAM,WAAW,KAAK,EAAE;CACxB,MAAM,cAAc,KAAK,EAAE;CAC3B,OAAO;EACL,OAAO,SAAS,KAAK,IAAI,GAAG,EAAE;EAC9B,OAAO,SAAS,KAAK,IAAI,GAAG,EAAE;EAC9B,GAAG,MAAM;EACT;EACA;EACA,KAAK,KAAK,IAAI,cAAc,QAAQ;CACtC;AACF;AAEA,SAAS,KAAK,IAAsB;CAClC,OAAO,GAAG,QAAQ,KAAK,UAAU,MAAM,QAAQ,GAAG,QAAQ,CAAC;AAC7D;AAEA,SAAS,2BACP,YACA,eACA,SACM;CACN,2BAA2B,CAAC,UAAU,GAAG,aAAa;CACtD,2BAA2B,CAAC,aAAa,GAAG,gBAAgB;CAC5D,IAAI,WAAW,KAAK,MAAM,cAAc,cAAc,KAAK,MAAM,eAC/D,MAAM,IAAI,MAAM,oEAAoE;CAEtF,IAAI,QAAQ,SAAS,KAAA,MAAc,CAAC,OAAO,cAAc,QAAQ,IAAI,KAAK,QAAQ,OAAO,IACvF,MAAM,IAAI,MAAM,kDAAkD;CAEpE,IACE,QAAQ,YAAY,KAAA,KACpB,CAAC,CAAC,eAAe,iBAAiB,CAAC,CAAC,SAAS,QAAQ,OAAO,GAE5D,MAAM,IAAI,MAAM,4DAA4D;CAE9E,IACE,QAAQ,UAAU,KAAA,MACjB,CAAC,OAAO,SAAS,QAAQ,MAAM,EAAE,KAChC,CAAC,OAAO,SAAS,QAAQ,MAAM,EAAE,KACjC,CAAC,OAAO,SAAS,QAAQ,MAAM,KAAK,QAAQ,MAAM,EAAE,KACpD,QAAQ,MAAM,KAAK,QAAQ,MAAM,KAEnC,MAAM,IAAI,MAAM,mDAAmD;AAEvE"}

package/dist/campaign/index.d.ts

@@ -1,10 +1,10 @@
 import { o as CostLedgerHandle, r as CostBreakdown, v as PendingCostCallView } from "../cost-ledger-C1W3ICmP.js";
-import { S as makeProposalFinding, v as ProposalFinding, y as ProposalFindingOrigin } from "../types-8yQzNm8u.js";
+import { S as makeProposalFinding, v as ProposalFinding, y as ProposalFindingOrigin } from "../types-DGImvHIr.js";
 import { t as SeriesDistribution } from "../descriptive-B2iPaT9J.js";
-import { B as powerPreflight, G as ObjectiveSource, H as AxisVerdict, J as PromotionPolicy, K as ParetoSignificanceGateOptions, R as PowerPreflight, U as BuildEvidenceVectorOptions, V as AxisEvidence, W as EvidenceVector, X as paretoPolicy, Y as buildEvidenceVector, Z as paretoSignificanceGate, a as dimensionRegressions, c as SequentialDecideFn, d as SequentialObservation, f as SequentialPairedGate, g as sequentialPairedGate, h as sequentialDecide, i as PairedHoldout, l as SequentialDecideOptions, m as SequentialStreamState, n as HeldoutSignificance, o as heldoutSignificance, p as SequentialPairedGateOptions, q as PromotionObjective, r as HeldoutSignificanceOptions, s as pairHoldout, t as DimensionRegression, u as SequentialGateDecision, z as PowerPreflightOptions } from "../statistical-heldout-3z3I-kJN.js";
+import { $ as paretoPolicy, G as AxisVerdict, H as PowerPreflightOptions, J as ObjectiveSource, K as BuildEvidenceVectorOptions, Q as buildEvidenceVector, U as powerPreflight, V as PowerPreflight, W as AxisEvidence, X as PromotionObjective, Y as ParetoSignificanceGateOptions, Z as PromotionPolicy, a as dimensionRegressions, c as SequentialDecideFn, d as SequentialObservation, et as paretoSignificanceGate, f as SequentialPairedGate, g as sequentialPairedGate, h as sequentialDecide, i as PairedHoldout, l as SequentialDecideOptions, m as SequentialStreamState, n as HeldoutSignificance, o as heldoutSignificance, p as SequentialPairedGateOptions, q as EvidenceVector, r as HeldoutSignificanceOptions, s as pairHoldout, t as DimensionRegression, u as SequentialGateDecision } from "../statistical-heldout-pD1Yah-0.js";
 import { $ as SearchTokenAccounting, A as SearchLedgerHash, B as SearchOperationStartedEvent, C as SearchEdgeOperator, D as SearchFailureReason, E as SearchExecutionIdentity, F as SearchNodeRegisteredEvent, G as SearchSplit, H as SearchProposerKind, I as SearchNodeStatus, J as SearchSurfaceEffect, K as SearchSplitTasks, L as SearchOpenedEvent, M as SearchNodeDecidedEvent, N as SearchNodeDecision, O as SearchLedgerEntry, P as SearchNodeRef, Q as SearchTaskOutcome, R as SearchOperationKind, S as SearchEdgeAttribution, T as SearchEstimateMethod, U as SearchReservation, V as SearchProposer, W as SearchSourceRef, X as SearchSurfaceKind, Y as SearchSurfaceEvidence, Z as SearchTask, _ as SearchClaimPower, a as SearchAttemptAccounting, b as SearchClosedEvent, c as SearchCancelReason, d as SearchCellCancelledEvent, et as SearchTraceRef, f as SearchCellSettledEvent, g as SearchClaimFinalist, h as SearchClaimEstimator, i as SearchArtifactRef, j as SearchModelIdentity, k as SearchLedgerEvent, l as SearchCandidateSurface, m as SearchClaim, n as SEARCH_LEDGER_SCHEMA, o as SearchAudit, p as SearchCellStage, q as SearchSplits, r as SearchArtifactKind, s as SearchBudget, t as NodeEstimate, tt as SearchUnknown, u as SearchCellAllocatedEvent, v as SearchClaimTest, w as SearchEdgeRecordedEvent, x as SearchCostAccounting, y as SearchCloseReason, z as SearchOperationRecordedEvent } from "../search-ledger-types-p2xKfiDJ.js";
-import { $i as assertCampaignDesign, $n as CampaignBreakdown, $r as OptimizationMethodResult, $t as PlanEvalFixtureRunOptions, A as RetainedDispatchOptions, Ai as RunOptimizationResult, An as CrossSurfacePairEvidence, Ar as OptimizationMethodPairwise, At as sequentialOptimizationMethod, B as RunProfileMatrixSegmentOptions, Bi as runCampaign, Bn as TraceAnalystArtifact, Br as OpenAICompatibleOptimizerModel, Bt as GepaPopulationImport, C as searchModelIdentity, Ci as isTransientTransportFailure, Cn as CrossSurfaceInteractionAwareSelection, Cr as composeGate, D as ScenarioSignal, Di as runImprovementLoop, Dn as CrossSurfaceInteractionTask, Dr as skillOptOptimizationMethod, E as DiscriminationScore, Ei as RunImprovementLoopResult, En as CrossSurfaceInteractionReport, Er as SkillOptTrainerConfig, F as FinalizedProfileMatrixResult, Fi as RunEvalOptions, Fn as CrossSurfaceSelectionPolicy, Fr as GepaEngineRun, Ft as RolloutCall, G as ProfileSummary, Gi as CacheIssueReason, Gn as LoopProvenanceArgsFromResult, Gr as ExternalTextOptimizerResult, Gt as neutralizationGate, H as finalizeProfileMatrix, Hi as CampaignRunPlanCell, Hn as BuildLoopProvenanceArgs, Hr as externalTextOptimizationMethod, Ht as importExternalEvaluations, I as ProfileMatrixCoverage, Ii as runEval, In as CrossSurfaceSelections, Ir as GepaOptimizationMethodConfig, It as ScoredRollout, J as ScenarioRollup, Ji as buildCellSchedule, Jn as LoopProvenanceEvidence, Jr as decodeExternalTextCandidate, Jt as EvalFixtureLoadOptions, K as RunProfileMatrixOptions, Ki as CacheRead, Kn as LoopProvenanceBackend, Kr as ExternalOptimizationExample, Kt as EvalFixture, L as ProfileMatrixPlan, Li as CampaignCellFailureReceipt, Ln as CrossSurfaceTaskRow, Lr as GepaOptimizationRecipe, Lt as UngroundedLiteralReport, M as createRetainedDispatch, Mi as OpenAutoPrOptions, Mn as CrossSurfacePairwiseEntry, Mr as compareOptimizationMethods, Mt as FsLabeledScenarioStoreOptions, N as CreateProfileMatrixPlanOptions, Ni as OpenAutoPrResult, Nn as CrossSurfaceRankedSingle, Nr as GepaAdaptiveEngineRun, Nt as RolloutArgumentDiff, O as scoreDiscrimination, Oi as PremeasuredOptimizationBaseline, On as CrossSurfaceNaiveStackSelection, Or as CompareOptimizationMethodsOptions, P as FinalizeProfileMatrixOptions, Pn as CrossSurfaceRelativeCost, Pr as GepaEngineOptions, Pt as RolloutArgumentDiffOptions, Qi as CampaignCoverage, Qn as emitLoopProvenance, Qr as OptimizationMethodProvenance, Qt as LoadEvalFixtureScenariosOptions, R as ProfileMatrixRow, Ri as CampaignCellRetryPolicy, Rn as measureCampaignCost, Rr as GepaRunnerCommand, Rt as ExternalSearchOptimizer, S as campaignCellSearchResult, Si as TransientFailureOptions, Sn as CrossSurfaceIneligibilityReason, T as searchReceiptAccounting, Ti as RunImprovementLoopOptions, Tn as CrossSurfaceInteractionPath, Tr as SkillOptRunnerCommand, U as runProfileMatrixSegment, Ui as PlanCampaignRunOptions, Un as EmitLoopProvenanceArgs, Ur as ExternalTextOptimizationMethodConfig, Ut as importGepaPopulation, V as createProfileMatrixPlan, Vi as CampaignRunPlan, Vn as TraceAnalystScenario, Vr as OptimizerModelBudget, Vt as externalSurface, W as ProfileDispatchFn, Wi as planCampaignRun, Wn as EmitLoopProvenanceResult, Wr as ExternalTextOptimizerContext, Wt as NeutralizationGateOptions, Xi as FinalEvidencePolicy, Xn as LoopProvenanceRecord, Xr as OptimizationMethodComposition, Xt as EvalFixtureScenario, Y as runProfileMatrix, Yi as cellCachePath, Yn as LoopProvenanceOptimizationMethod, Yr as OptimizationMethod, Yt as EvalFixtureRunPlan, Zi as FinalEvidenceUse, Zn as canonicalDigest, Zr as OptimizationMethodInput, Zt as EvalFixtureValidationMode, _ as surfaceDispatchRef, _n as CrossSurfaceComponentEvidence, a as gitWorktreeAdapter, aa as SearchLedgerIntegrityError, ai as GepaCandidatePopulationArtifact, an as AnalyzeCrossSurfaceInteractionsInput, ar as DefaultProductionGateCheck, at as ScoreboardSummary, b as SingleRunLockOptions, bi as LlmJudgeOptions, bn as CrossSurfaceEligibility, c as AutoevalsScoreLike, ci as GepaCandidateSelectionScore, cn as CrossSurfaceAttemptCompleteness, cr as defaultProductionGate, ct as renderScoreboardMarkdown, d as PhoenixEvaluatorLike, di as ExternalOptimizerObservationArtifact, dn as CrossSurfaceCandidate, dt as userStoryScoreboard, ea as campaignCoverage, ei as OptimizationMethodRunOptions, en as discoverEvalFixtures, et as PlaybackContext, f as assertCodeSurfaceIdentity, fi as ExternalOptimizerObservationSummary, fn as CrossSurfaceCandidateComparison, g as surfaceContentHash, gi as ReferenceEquivalenceJudgeOptions, gn as CrossSurfaceComponent, h as renderSurfaceDiff, hn as CrossSurfaceCandidateSummary, i as WorktreeAdapter, ia as SearchLedgerError, ii as costFromLedgerSummary, in as analyzeCrossSurfaceInteractions, ir as heldOutGate, it as ScoreboardRow, j as RetainedDispatchOutcome, ji as runOptimization, jn as CrossSurfacePairIncompatibilityReason, jr as OptimizationMethodScore, jt as neutralizeText, k as resolveRunDir, ki as RunOptimizationOptions, kn as CrossSurfacePairCompatibility, kr as OptimizationMethodComparison, kt as scopedOptimizationMethod, l as AutoevalsScorerLike, li as readGepaCandidatePopulationArtifact, ln as CrossSurfaceBestSingleSelection, lt as scoreUserStory, m as componentSurfaceIdentityMaterial, mi as readExternalOptimizerObservationArtifact, mn as CrossSurfaceCandidateOutcome, n as GitWorktreeAdapterOptions, na as campaignSplitDigest, ni as ComparisonCost, nn as loadEvalFixtureScenarios, nr as campaignMeanComposite, nt as PlaybackStep, o as resolveWorktreePath, oi as GepaCandidatePopulationCandidate, on as CrossSurfaceAdditionDecision, or as DefaultProductionGateOptions, ot as UserStory, p as codeSurfaceIdentityMaterial, pi as ExternalOptimizerSubmittedCandidate, pn as CrossSurfaceCandidateEvidence, q as RunProfileMatrixResult, qi as CellScheduleSlot, qn as LoopProvenanceCandidate, qr as ExternalTextEvaluationResponse, qt as EvalFixtureFile, r as Worktree, ra as campaignSplitDigestFromIdentities, ri as OptimizationTokenUsage, rn as planEvalFixtureRun, rr as HeldOutGateOptions, rt as ScoreboardRenderOptions, s as verifyCodeSurface, si as GepaCandidatePopulationSummary, sn as CrossSurfaceAdditionRejectionReason, sr as DefaultProductionRewardHackingOptions, st as UserStoryVerdict, t as CodeSurfaceVerification, ta as campaignScenarioIdentity, ti as OptimizationPackageSource, tn as loadEvalFixture, tr as campaignBreakdown, tt as PlaybackDriver, u as PhoenixEvaluationResultLike, ui as ExternalOptimizerExecutionSummary, un as CrossSurfaceBootstrapPolicy, ut as scoreboardSummary, v as surfaceHash, vi as ReferenceEquivalenceScenario, vn as CrossSurfaceCompositionStep, w as searchProposalExecution, wi as transientDispatchFailure, wn as CrossSurfaceInteractionEffect, wr as SkillOptOptimizationMethodConfig, x as acquireSingleRunLock, xi as llmJudge, xn as CrossSurfaceEvidenceBreakdown, y as SingleRunLock, yi as LlmJudgeDimension, yn as CrossSurfaceDistribution, z as ProfileMatrixSegmentResult, zi as RunCampaignOptions, zn as BuildTraceAnalystSurfaceDispatchOptions, zr as gepaOptimizationMethod, zt as GepaEvaluationImport } from "../index-Q6DvdcwI.js";
-import { $ as SearchCompletion, A as LabeledScenarioWrite, B as ScoredSurfaceOutcome, C as JudgeDimension, D as LabeledScenarioSampleArgs, E as LabeledScenarioRecord, F as ProposeContext, G as SearchProposerView, H as SurfaceProposer, I as ProposedCandidate, J as searchProposerView, K as SearchSummaryOptions, L as RedactionStatus, M as OptimizerConfig, N as ParetoParent, O as LabeledScenarioSource, P as ProposalTrackContext, Q as SearchCell, R as Scenario, S as JudgeConfig, T as LabelTrust, U as TraceSpan, V as SessionScript, W as isProposedCandidate, X as SearchStateView, Y as SearchState, Z as searchUnitScores, _ as GateDecision, a as CampaignResult, at as SearchUnitScore, b as GenerationRecord, c as CampaignTraceWriter, ct as searchTaskSetDigest, d as DispatchContext, et as SearchDecisionRecord, f as DispatchFn, g as GateContribution, h as GateContext, i as CampaignCostMeter, it as SearchSpend, j as MutableSurface, k as LabeledScenarioStore, l as CodeSurface, m as GateCheckStatus, n as CampaignArtifactWriter, nt as SearchOperation, o as CampaignScenarioIdentity, ot as searchCellId, p as Gate, q as renderSearchSummary, r as CampaignCellResult, rt as SearchScoredCell, s as CampaignTokenUsage, st as searchNodeId, t as CampaignAggregates, tt as SearchNode, u as ComponentSurface, v as GateResult, w as JudgeScore, x as JudgeAggregate, y as GenerationCandidate, z as ScenarioAggregate } from "../types-CHfn1zg5.js";
-import { A as SearchRungDecision, At as SearchHistoryReceipt, B as beam, Bt as openSearchLedger, C as searchClaimDecision, Ct as surfaceNode, D as SearchAllocationView, Dt as SearchHistoryCoverage, E as AshaOptions, Et as SearchHistoryAuditSummary, F as SearchExpansion, Ft as FileSearchLedger, G as NodePosterior, Gt as createRunCostLedger, H as incumbent, Ht as replaySearchLedgerText, I as SearchPolicy, It as OpenSearchLedgerOptions, J as estimateNode, K as SEARCH_ESTIMATOR, Kt as fsCampaignStorage, L as SearchPolicyNode, Lt as SearchLedger, M as asha, Mt as createSearchHistoryReceipt, N as uniform, Nt as verifySearchHistoryArtifact, O as SearchAllocator, Ot as SearchHistoryCoverageRow, P as AideOptions, Pt as verifySearchHistoryReceipt, Q as searchPosterior, R as SearchPolicyView, Rt as SearchLedgerAppendResult, S as planSearchClaim, St as surfaceDiff, T as verifySearchClaim, Tt as SearchHistoryAdmissionOptions, U as incumbentWithOperatorBandit, Ut as validateSearchLedgerEvent, V as crowdedFrontierParent, Vt as parseSearchLedgerLine, W as EstimateNodeCellsInput, Wt as CampaignStorage, X as searchCellSetDigest, Y as estimateNodeFromCells, Z as searchEstimateMethod, _ as SEARCH_CLAIM_RULE, _t as SearchRecorderOptions, a as SearchArtifactCodec, b as SearchClaimVerification, bt as developmentClaim, c as SearchExecutor, d as SearchProposalRequest, dt as AllocateSearchCellInput, f as SearchProposalResult, ft as RecordSearchEdgeInput, g as PlanSearchClaimInput, gt as SearchRecorder, h as SearchRunResult, ht as SearchOpening, i as RunSearchOptions, j as SearchUnitExtension, jt as assertSearchHistoryMatchesState, k as SearchCellPlan, kt as SearchHistoryPolicy, l as SearchLane, m as SearchProposerPort, mt as SearchLedgerBinding, n as searchDivergence, o as SearchCellResult, p as SearchProposedChild, pt as RegisterSearchNodeInput, q as SearchPosterior, qt as inMemoryCampaignStorage, r as searchPolicyView, s as SearchCellWork, t as runSearch, u as SearchProposalBlob, v as SearchClaimDecision, vt as SearchRunIdentity, w as searchClaimReserveUsd, wt as CreateSearchHistoryReceiptInput, x as decideSearchClaim, xt as searchEdgeId, y as SearchClaimPlan, yt as SettleSearchCellInput, z as aide, zt as SearchLedgerTrustedHeadMode } from "../search-kernel-Dloxd6gs.js";
-import { B as ExternalOptimizerModelCallRequest, F as ExternalOptimizerEndpointFormat, G as ExternalOptimizerRunnerCommand, H as ExternalOptimizerModelExecutionObservation, I as ExternalOptimizerEvaluationObservation, L as ExternalOptimizerEvaluationRefusalReason, M as DEFAULT_EXTERNAL_OPTIMIZER_PROCESS_LIMITS, N as ExternalOptimizerCallbackLimits, P as ExternalOptimizerChatRequest, R as ExternalOptimizerModelBudget, U as ExternalOptimizerProcessLimits, V as ExternalOptimizerModelCallResult, j as DEFAULT_EXTERNAL_OPTIMIZER_CALLBACK_LIMITS, q as ExternalTextCandidate, z as ExternalOptimizerModelCall } from "../agent-profile-D01Io2Xw.js";
+import { $i as assertCampaignDesign, $n as CampaignBreakdown, $r as OptimizationMethodResult, $t as PlanEvalFixtureRunOptions, A as RetainedDispatchOptions, Ai as RunOptimizationResult, An as CrossSurfacePairEvidence, Ar as OptimizationMethodPairwise, At as sequentialOptimizationMethod, B as RunProfileMatrixSegmentOptions, Bi as runCampaign, Bn as TraceAnalystArtifact, Br as OpenAICompatibleOptimizerModel, Bt as GepaPopulationImport, C as searchModelIdentity, Ci as isTransientTransportFailure, Cn as CrossSurfaceInteractionAwareSelection, Cr as composeGate, D as ScenarioSignal, Di as runImprovementLoop, Dn as CrossSurfaceInteractionTask, Dr as skillOptOptimizationMethod, E as DiscriminationScore, Ei as RunImprovementLoopResult, En as CrossSurfaceInteractionReport, Er as SkillOptTrainerConfig, F as FinalizedProfileMatrixResult, Fi as RunEvalOptions, Fn as CrossSurfaceSelectionPolicy, Fr as GepaEngineRun, Ft as RolloutCall, G as ProfileSummary, Gi as CacheIssueReason, Gn as LoopProvenanceArgsFromResult, Gr as ExternalTextOptimizerResult, Gt as neutralizationGate, H as finalizeProfileMatrix, Hi as CampaignRunPlanCell, Hn as BuildLoopProvenanceArgs, Hr as externalTextOptimizationMethod, Ht as importExternalEvaluations, I as ProfileMatrixCoverage, Ii as runEval, In as CrossSurfaceSelections, Ir as GepaOptimizationMethodConfig, It as ScoredRollout, J as ScenarioRollup, Ji as buildCellSchedule, Jn as LoopProvenanceEvidence, Jr as decodeExternalTextCandidate, Jt as EvalFixtureLoadOptions, K as RunProfileMatrixOptions, Ki as CacheRead, Kn as LoopProvenanceBackend, Kr as ExternalOptimizationExample, Kt as EvalFixture, L as ProfileMatrixPlan, Li as CampaignCellFailureReceipt, Ln as CrossSurfaceTaskRow, Lr as GepaOptimizationRecipe, Lt as UngroundedLiteralReport, M as createRetainedDispatch, Mi as OpenAutoPrOptions, Mn as CrossSurfacePairwiseEntry, Mr as compareOptimizationMethods, Mt as FsLabeledScenarioStoreOptions, N as CreateProfileMatrixPlanOptions, Ni as OpenAutoPrResult, Nn as CrossSurfaceRankedSingle, Nr as GepaAdaptiveEngineRun, Nt as RolloutArgumentDiff, O as scoreDiscrimination, Oi as PremeasuredOptimizationBaseline, On as CrossSurfaceNaiveStackSelection, Or as CompareOptimizationMethodsOptions, P as FinalizeProfileMatrixOptions, Pn as CrossSurfaceRelativeCost, Pr as GepaEngineOptions, Pt as RolloutArgumentDiffOptions, Qi as CampaignCoverage, Qn as emitLoopProvenance, Qr as OptimizationMethodProvenance, Qt as LoadEvalFixtureScenariosOptions, R as ProfileMatrixRow, Ri as CampaignCellRetryPolicy, Rn as measureCampaignCost, Rr as GepaRunnerCommand, Rt as ExternalSearchOptimizer, S as campaignCellSearchResult, Si as TransientFailureOptions, Sn as CrossSurfaceIneligibilityReason, T as searchReceiptAccounting, Ti as RunImprovementLoopOptions, Tn as CrossSurfaceInteractionPath, Tr as SkillOptRunnerCommand, U as runProfileMatrixSegment, Ui as PlanCampaignRunOptions, Un as EmitLoopProvenanceArgs, Ur as ExternalTextOptimizationMethodConfig, Ut as importGepaPopulation, V as createProfileMatrixPlan, Vi as CampaignRunPlan, Vn as TraceAnalystScenario, Vr as OptimizerModelBudget, Vt as externalSurface, W as ProfileDispatchFn, Wi as planCampaignRun, Wn as EmitLoopProvenanceResult, Wr as ExternalTextOptimizerContext, Wt as NeutralizationGateOptions, Xi as FinalEvidencePolicy, Xn as LoopProvenanceRecord, Xr as OptimizationMethodComposition, Xt as EvalFixtureScenario, Y as runProfileMatrix, Yi as cellCachePath, Yn as LoopProvenanceOptimizationMethod, Yr as OptimizationMethod, Yt as EvalFixtureRunPlan, Zi as FinalEvidenceUse, Zn as canonicalDigest, Zr as OptimizationMethodInput, Zt as EvalFixtureValidationMode, _ as surfaceDispatchRef, _n as CrossSurfaceComponentEvidence, a as gitWorktreeAdapter, aa as SearchLedgerIntegrityError, ai as GepaCandidatePopulationArtifact, an as AnalyzeCrossSurfaceInteractionsInput, ar as DefaultProductionGateCheck, at as ScoreboardSummary, b as SingleRunLockOptions, bi as LlmJudgeOptions, bn as CrossSurfaceEligibility, c as AutoevalsScoreLike, ci as GepaCandidateSelectionScore, cn as CrossSurfaceAttemptCompleteness, cr as defaultProductionGate, ct as renderScoreboardMarkdown, d as PhoenixEvaluatorLike, di as ExternalOptimizerObservationArtifact, dn as CrossSurfaceCandidate, dt as userStoryScoreboard, ea as campaignCoverage, ei as OptimizationMethodRunOptions, en as discoverEvalFixtures, et as PlaybackContext, f as assertCodeSurfaceIdentity, fi as ExternalOptimizerObservationSummary, fn as CrossSurfaceCandidateComparison, g as surfaceContentHash, gi as ReferenceEquivalenceJudgeOptions, gn as CrossSurfaceComponent, h as renderSurfaceDiff, hn as CrossSurfaceCandidateSummary, i as WorktreeAdapter, ia as SearchLedgerError, ii as costFromLedgerSummary, in as analyzeCrossSurfaceInteractions, ir as heldOutGate, it as ScoreboardRow, j as RetainedDispatchOutcome, ji as runOptimization, jn as CrossSurfacePairIncompatibilityReason, jr as OptimizationMethodScore, jt as neutralizeText, k as resolveRunDir, ki as RunOptimizationOptions, kn as CrossSurfacePairCompatibility, kr as OptimizationMethodComparison, kt as scopedOptimizationMethod, l as AutoevalsScorerLike, li as readGepaCandidatePopulationArtifact, ln as CrossSurfaceBestSingleSelection, lt as scoreUserStory, m as componentSurfaceIdentityMaterial, mi as readExternalOptimizerObservationArtifact, mn as CrossSurfaceCandidateOutcome, n as GitWorktreeAdapterOptions, na as campaignSplitDigest, ni as ComparisonCost, nn as loadEvalFixtureScenarios, nr as campaignMeanComposite, nt as PlaybackStep, o as resolveWorktreePath, oi as GepaCandidatePopulationCandidate, on as CrossSurfaceAdditionDecision, or as DefaultProductionGateOptions, ot as UserStory, p as codeSurfaceIdentityMaterial, pi as ExternalOptimizerSubmittedCandidate, pn as CrossSurfaceCandidateEvidence, q as RunProfileMatrixResult, qi as CellScheduleSlot, qn as LoopProvenanceCandidate, qr as ExternalTextEvaluationResponse, qt as EvalFixtureFile, r as Worktree, ra as campaignSplitDigestFromIdentities, ri as OptimizationTokenUsage, rn as planEvalFixtureRun, rr as HeldOutGateOptions, rt as ScoreboardRenderOptions, s as verifyCodeSurface, si as GepaCandidatePopulationSummary, sn as CrossSurfaceAdditionRejectionReason, sr as DefaultProductionRewardHackingOptions, st as UserStoryVerdict, t as CodeSurfaceVerification, ta as campaignScenarioIdentity, ti as OptimizationPackageSource, tn as loadEvalFixture, tr as campaignBreakdown, tt as PlaybackDriver, u as PhoenixEvaluationResultLike, ui as ExternalOptimizerExecutionSummary, un as CrossSurfaceBootstrapPolicy, ut as scoreboardSummary, v as surfaceHash, vi as ReferenceEquivalenceScenario, vn as CrossSurfaceCompositionStep, w as searchProposalExecution, wi as transientDispatchFailure, wn as CrossSurfaceInteractionEffect, wr as SkillOptOptimizationMethodConfig, x as acquireSingleRunLock, xi as llmJudge, xn as CrossSurfaceEvidenceBreakdown, y as SingleRunLock, yi as LlmJudgeDimension, yn as CrossSurfaceDistribution, z as ProfileMatrixSegmentResult, zi as RunCampaignOptions, zn as BuildTraceAnalystSurfaceDispatchOptions, zr as gepaOptimizationMethod, zt as GepaEvaluationImport } from "../index-BvX3CFNS.js";
+import { $ as SearchCompletion, A as LabeledScenarioWrite, B as ScoredSurfaceOutcome, C as JudgeDimension, D as LabeledScenarioSampleArgs, E as LabeledScenarioRecord, F as ProposeContext, G as SearchProposerView, H as SurfaceProposer, I as ProposedCandidate, J as searchProposerView, K as SearchSummaryOptions, L as RedactionStatus, M as OptimizerConfig, N as ParetoParent, O as LabeledScenarioSource, P as ProposalTrackContext, Q as SearchCell, R as Scenario, S as JudgeConfig, T as LabelTrust, U as TraceSpan, V as SessionScript, W as isProposedCandidate, X as SearchStateView, Y as SearchState, Z as searchUnitScores, _ as GateDecision, a as CampaignResult, at as SearchUnitScore, b as GenerationRecord, c as CampaignTraceWriter, ct as searchTaskSetDigest, d as DispatchContext, et as SearchDecisionRecord, f as DispatchFn, g as GateContribution, h as GateContext, i as CampaignCostMeter, it as SearchSpend, j as MutableSurface, k as LabeledScenarioStore, l as CodeSurface, m as GateCheckStatus, n as CampaignArtifactWriter, nt as SearchOperation, o as CampaignScenarioIdentity, ot as searchCellId, p as Gate, q as renderSearchSummary, r as CampaignCellResult, rt as SearchScoredCell, s as CampaignTokenUsage, st as searchNodeId, t as CampaignAggregates, tt as SearchNode, u as ComponentSurface, v as GateResult, w as JudgeScore, x as JudgeAggregate, y as GenerationCandidate, z as ScenarioAggregate } from "../types-DDKfH-N6.js";
+import { A as SearchRungDecision, At as SearchHistoryReceipt, B as beam, Bt as openSearchLedger, C as searchClaimDecision, Ct as surfaceNode, D as SearchAllocationView, Dt as SearchHistoryCoverage, E as AshaOptions, Et as SearchHistoryAuditSummary, F as SearchExpansion, Ft as FileSearchLedger, G as NodePosterior, Gt as createRunCostLedger, H as incumbent, Ht as replaySearchLedgerText, I as SearchPolicy, It as OpenSearchLedgerOptions, J as estimateNode, K as SEARCH_ESTIMATOR, Kt as fsCampaignStorage, L as SearchPolicyNode, Lt as SearchLedger, M as asha, Mt as createSearchHistoryReceipt, N as uniform, Nt as verifySearchHistoryArtifact, O as SearchAllocator, Ot as SearchHistoryCoverageRow, P as AideOptions, Pt as verifySearchHistoryReceipt, Q as searchPosterior, R as SearchPolicyView, Rt as SearchLedgerAppendResult, S as planSearchClaim, St as surfaceDiff, T as verifySearchClaim, Tt as SearchHistoryAdmissionOptions, U as incumbentWithOperatorBandit, Ut as validateSearchLedgerEvent, V as crowdedFrontierParent, Vt as parseSearchLedgerLine, W as EstimateNodeCellsInput, Wt as CampaignStorage, X as searchCellSetDigest, Y as estimateNodeFromCells, Z as searchEstimateMethod, _ as SEARCH_CLAIM_RULE, _t as SearchRecorderOptions, a as SearchArtifactCodec, b as SearchClaimVerification, bt as developmentClaim, c as SearchExecutor, d as SearchProposalRequest, dt as AllocateSearchCellInput, f as SearchProposalResult, ft as RecordSearchEdgeInput, g as PlanSearchClaimInput, gt as SearchRecorder, h as SearchRunResult, ht as SearchOpening, i as RunSearchOptions, j as SearchUnitExtension, jt as assertSearchHistoryMatchesState, k as SearchCellPlan, kt as SearchHistoryPolicy, l as SearchLane, m as SearchProposerPort, mt as SearchLedgerBinding, n as searchDivergence, o as SearchCellResult, p as SearchProposedChild, pt as RegisterSearchNodeInput, q as SearchPosterior, qt as inMemoryCampaignStorage, r as searchPolicyView, s as SearchCellWork, t as runSearch, u as SearchProposalBlob, v as SearchClaimDecision, vt as SearchRunIdentity, w as searchClaimReserveUsd, wt as CreateSearchHistoryReceiptInput, x as decideSearchClaim, xt as searchEdgeId, y as SearchClaimPlan, yt as SettleSearchCellInput, z as aide, zt as SearchLedgerTrustedHeadMode } from "../search-kernel-C6__V0IS.js";
+import { B as ExternalOptimizerModelCallRequest, F as ExternalOptimizerEndpointFormat, G as ExternalOptimizerRunnerCommand, H as ExternalOptimizerModelExecutionObservation, I as ExternalOptimizerEvaluationObservation, L as ExternalOptimizerEvaluationRefusalReason, M as DEFAULT_EXTERNAL_OPTIMIZER_PROCESS_LIMITS, N as ExternalOptimizerCallbackLimits, P as ExternalOptimizerChatRequest, R as ExternalOptimizerModelBudget, U as ExternalOptimizerProcessLimits, V as ExternalOptimizerModelCallResult, j as DEFAULT_EXTERNAL_OPTIMIZER_CALLBACK_LIMITS, q as ExternalTextCandidate, z as ExternalOptimizerModelCall } from "../agent-profile-Bc7ADJY4.js";
 export { type AideOptions, type AllocateSearchCellInput, type AnalyzeCrossSurfaceInteractionsInput, type AshaOptions, type AutoevalsScoreLike, type AutoevalsScorerLike, type AxisEvidence, type AxisVerdict, type BuildEvidenceVectorOptions, type BuildLoopProvenanceArgs, type BuildTraceAnalystSurfaceDispatchOptions, type CacheIssueReason, type CacheRead, type CampaignAggregates, type CampaignArtifactWriter, type CampaignBreakdown, type CampaignCellFailureReceipt, type CampaignCellResult, type CampaignCellRetryPolicy, type CampaignCostMeter, type CampaignCoverage, type CampaignResult, type CampaignRunPlan, type CampaignRunPlanCell, type CampaignScenarioIdentity, type CampaignStorage, type CampaignTokenUsage, type CampaignTraceWriter, type CellScheduleSlot, type CodeSurface, type CodeSurfaceVerification, type CompareOptimizationMethodsOptions, type ComparisonCost, type ComponentSurface, type CostBreakdown, type CostLedgerHandle, type CreateProfileMatrixPlanOptions, type CreateSearchHistoryReceiptInput, type CrossSurfaceAdditionDecision, type CrossSurfaceAdditionRejectionReason, type CrossSurfaceAttemptCompleteness, type CrossSurfaceBestSingleSelection, type CrossSurfaceBootstrapPolicy, type CrossSurfaceCandidate, type CrossSurfaceCandidateComparison, type CrossSurfaceCandidateEvidence, type CrossSurfaceCandidateOutcome, type CrossSurfaceCandidateSummary, type CrossSurfaceComponent, type CrossSurfaceComponentEvidence, type CrossSurfaceCompositionStep, type CrossSurfaceDistribution, type CrossSurfaceEligibility, type CrossSurfaceEvidenceBreakdown, type CrossSurfaceIneligibilityReason, type CrossSurfaceInteractionAwareSelection, type CrossSurfaceInteractionEffect, type CrossSurfaceInteractionPath, type CrossSurfaceInteractionReport, type CrossSurfaceInteractionTask, type CrossSurfaceNaiveStackSelection, type CrossSurfacePairCompatibility, type CrossSurfacePairEvidence, type CrossSurfacePairIncompatibilityReason, type CrossSurfacePairwiseEntry, type CrossSurfaceRankedSingle, type CrossSurfaceRelativeCost, type CrossSurfaceSelectionPolicy, type CrossSurfaceSelections, type CrossSurfaceTaskRow, DEFAULT_EXTERNAL_OPTIMIZER_CALLBACK_LIMITS, DEFAULT_EXTERNAL_OPTIMIZER_PROCESS_LIMITS, type DefaultProductionGateCheck, type DefaultProductionGateOptions, type DefaultProductionRewardHackingOptions, type DimensionRegression, type DiscriminationScore, type DispatchContext, type DispatchFn, type EmitLoopProvenanceArgs, type EmitLoopProvenanceResult, type EstimateNodeCellsInput, type EvalFixture, type EvalFixtureFile, type EvalFixtureLoadOptions, type EvalFixtureRunPlan, type EvalFixtureScenario, type EvalFixtureValidationMode, type EvidenceVector, type ExternalOptimizationExample, type ExternalOptimizerCallbackLimits, type ExternalOptimizerChatRequest, type ExternalOptimizerEndpointFormat, type ExternalOptimizerEvaluationObservation, type ExternalOptimizerEvaluationRefusalReason, type ExternalOptimizerExecutionSummary, type ExternalOptimizerModelBudget, type ExternalOptimizerModelCall, type ExternalOptimizerModelCallRequest, type ExternalOptimizerModelCallResult, type ExternalOptimizerModelExecutionObservation, type ExternalOptimizerObservationArtifact, type ExternalOptimizerObservationSummary, type ExternalOptimizerProcessLimits, type ExternalOptimizerRunnerCommand, type ExternalOptimizerSubmittedCandidate, type ExternalSearchOptimizer, type ExternalTextCandidate, type ExternalTextEvaluationResponse, type ExternalTextOptimizationMethodConfig, type ExternalTextOptimizerContext, type ExternalTextOptimizerResult, FileSearchLedger, type FinalEvidencePolicy, type FinalEvidenceUse, type FinalizeProfileMatrixOptions, type FinalizedProfileMatrixResult, type FsLabeledScenarioStoreOptions, type Gate, type GateCheckStatus, type GateContext, type GateContribution, type GateDecision, type GateResult, type GenerationCandidate, type GenerationRecord, type GepaAdaptiveEngineRun, type GepaCandidatePopulationArtifact, type GepaCandidatePopulationCandidate, type GepaCandidatePopulationSummary, type GepaCandidateSelectionScore, type GepaEngineOptions, type GepaEngineRun, type GepaEvaluationImport, type GepaOptimizationMethodConfig, type GepaOptimizationRecipe, type GepaPopulationImport, type GepaRunnerCommand, type GitWorktreeAdapterOptions, type HeldOutGateOptions, type HeldoutSignificance, type HeldoutSignificanceOptions, type JudgeAggregate, type JudgeConfig, type JudgeDimension, type JudgeScore, type LabelTrust, type LabeledScenarioRecord, type LabeledScenarioSampleArgs, type LabeledScenarioSource, type LabeledScenarioStore, type LabeledScenarioWrite, type LlmJudgeDimension, type LlmJudgeOptions, type LoadEvalFixtureScenariosOptions, type LoopProvenanceArgsFromResult, type LoopProvenanceBackend, type LoopProvenanceCandidate, type LoopProvenanceEvidence, type LoopProvenanceOptimizationMethod, type LoopProvenanceRecord, type MutableSurface, type NeutralizationGateOptions, type NodeEstimate, type NodePosterior, type ObjectiveSource, type OpenAICompatibleOptimizerModel, type OpenAutoPrOptions, type OpenAutoPrResult, type OpenSearchLedgerOptions, type OptimizationMethod, type OptimizationMethodComparison, type OptimizationMethodComposition, type OptimizationMethodInput, type OptimizationMethodPairwise, type OptimizationMethodProvenance, type OptimizationMethodResult, type OptimizationMethodRunOptions, type OptimizationMethodScore, type OptimizationPackageSource, type OptimizationTokenUsage, type OptimizerConfig, type OptimizerModelBudget, type PairedHoldout, type ParetoParent, type ParetoSignificanceGateOptions, type PendingCostCallView, type PhoenixEvaluationResultLike, type PhoenixEvaluatorLike, type PlanCampaignRunOptions, type PlanEvalFixtureRunOptions, type PlanSearchClaimInput, type PlaybackContext, type PlaybackDriver, type PlaybackStep, type PowerPreflight, type PowerPreflightOptions, type PremeasuredOptimizationBaseline, type ProfileDispatchFn, type ProfileMatrixCoverage, type ProfileMatrixPlan, type ProfileMatrixRow, type ProfileMatrixSegmentResult, type ProfileSummary, type PromotionObjective, type PromotionPolicy, type ProposalFinding, type ProposalFindingOrigin, type ProposalTrackContext, type ProposeContext, type ProposedCandidate, type RecordSearchEdgeInput, type RedactionStatus, type ReferenceEquivalenceJudgeOptions, type ReferenceEquivalenceScenario, type RegisterSearchNodeInput, type RetainedDispatchOptions, type RetainedDispatchOutcome, type RolloutArgumentDiff, type RolloutArgumentDiffOptions, type RolloutCall, type RunCampaignOptions, type RunEvalOptions, type RunImprovementLoopOptions, type RunImprovementLoopResult, type RunOptimizationOptions, type RunOptimizationResult, type RunProfileMatrixOptions, type RunProfileMatrixResult, type RunProfileMatrixSegmentOptions, type RunSearchOptions, SEARCH_CLAIM_RULE, SEARCH_ESTIMATOR, SEARCH_LEDGER_SCHEMA, type Scenario, type ScenarioAggregate, type ScenarioRollup, type ScenarioSignal, type ScoreboardRenderOptions, type ScoreboardRow, type ScoreboardSummary, type ScoredRollout, type ScoredSurfaceOutcome, type SearchAllocationView, type SearchAllocator, type SearchArtifactCodec, type SearchArtifactKind, type SearchArtifactRef, type SearchAttemptAccounting, type SearchAudit, type SearchBudget, type SearchCancelReason, type SearchCandidateSurface, type SearchCell, type SearchCellAllocatedEvent, type SearchCellCancelledEvent, type SearchCellPlan, type SearchCellResult, type SearchCellSettledEvent, type SearchCellStage, type SearchCellWork, type SearchClaim, type SearchClaimDecision, type SearchClaimEstimator, type SearchClaimFinalist, type SearchClaimPlan, type SearchClaimPower, type SearchClaimTest, type SearchClaimVerification, type SearchCloseReason, type SearchClosedEvent, type SearchCompletion, type SearchCostAccounting, type SearchDecisionRecord, type SearchEdgeAttribution, type SearchEdgeOperator, type SearchEdgeRecordedEvent, type SearchEstimateMethod, type SearchExecutionIdentity, type SearchExecutor, type SearchExpansion, type SearchFailureReason, type SearchHistoryAdmissionOptions, type SearchHistoryAuditSummary, type SearchHistoryCoverage, type SearchHistoryCoverageRow, type SearchHistoryPolicy, type SearchHistoryReceipt, type SearchLane, type SearchLedger, type SearchLedgerAppendResult, type SearchLedgerBinding, type SearchLedgerEntry, SearchLedgerError, type SearchLedgerEvent, type SearchLedgerHash, SearchLedgerIntegrityError, type SearchLedgerTrustedHeadMode, type SearchModelIdentity, type SearchNode, type SearchNodeDecidedEvent, type SearchNodeDecision, type SearchNodeRef, type SearchNodeRegisteredEvent, type SearchNodeStatus, type SearchOpenedEvent, type SearchOpening, type SearchOperation, type SearchOperationKind, type SearchOperationRecordedEvent, type SearchOperationStartedEvent, type SearchPolicy, type SearchPolicyNode, type SearchPolicyView, type SearchPosterior, type SearchProposalBlob, type SearchProposalRequest, type SearchProposalResult, type SearchProposedChild, type SearchProposer, type SearchProposerKind, type SearchProposerPort, type SearchProposerView, SearchRecorder, type SearchRecorderOptions, type SearchReservation, type SearchRunIdentity, type SearchRunResult, type SearchRungDecision, type SearchScoredCell, type SearchSourceRef, type SearchSpend, type SearchSplit, type SearchSplitTasks, type SearchSplits, SearchState, SearchStateView, type SearchSummaryOptions, type SearchSurfaceEffect, type SearchSurfaceEvidence, type SearchSurfaceKind, type SearchTask, type SearchTaskOutcome, type SearchTokenAccounting, type SearchTraceRef, type SearchUnitExtension, type SearchUnitScore, type SearchUnknown, type SequentialDecideFn, type SequentialDecideOptions, type SequentialGateDecision, type SequentialObservation, type SequentialPairedGate, type SequentialPairedGateOptions, type SequentialStreamState, type SeriesDistribution, type SessionScript, type SettleSearchCellInput, type SingleRunLock, type SingleRunLockOptions, type SkillOptOptimizationMethodConfig, type SkillOptRunnerCommand, type SkillOptTrainerConfig, type SurfaceProposer, type TraceAnalystArtifact, type TraceAnalystScenario, type TraceSpan, type TransientFailureOptions, type UngroundedLiteralReport, type UserStory, type UserStoryVerdict, type Worktree, type WorktreeAdapter, acquireSingleRunLock, aide, analyzeCrossSurfaceInteractions, asha, assertCampaignDesign, assertCodeSurfaceIdentity, assertSearchHistoryMatchesState, beam, buildCellSchedule, buildEvidenceVector, campaignBreakdown, campaignCellSearchResult, campaignCoverage, campaignMeanComposite, campaignScenarioIdentity, campaignSplitDigest, campaignSplitDigestFromIdentities, canonicalDigest, cellCachePath, codeSurfaceIdentityMaterial, compareOptimizationMethods, componentSurfaceIdentityMaterial, composeGate, costFromLedgerSummary, createProfileMatrixPlan, createRetainedDispatch, createRunCostLedger, createSearchHistoryReceipt, crowdedFrontierParent, decideSearchClaim, decodeExternalTextCandidate, defaultProductionGate, developmentClaim, dimensionRegressions, discoverEvalFixtures, emitLoopProvenance, estimateNode, estimateNodeFromCells, externalSurface, externalTextOptimizationMethod, finalizeProfileMatrix, fsCampaignStorage, gepaOptimizationMethod, gitWorktreeAdapter, heldOutGate, heldoutSignificance, importExternalEvaluations, importGepaPopulation, inMemoryCampaignStorage, incumbent, incumbentWithOperatorBandit, isProposedCandidate, isTransientTransportFailure, llmJudge, loadEvalFixture, loadEvalFixtureScenarios, makeProposalFinding, measureCampaignCost, neutralizationGate, neutralizeText, openSearchLedger, pairHoldout, paretoPolicy, paretoSignificanceGate, parseSearchLedgerLine, planCampaignRun, planEvalFixtureRun, planSearchClaim, powerPreflight, readExternalOptimizerObservationArtifact, readGepaCandidatePopulationArtifact, renderScoreboardMarkdown, renderSearchSummary, renderSurfaceDiff, replaySearchLedgerText, resolveRunDir, resolveWorktreePath, runCampaign, runEval, runImprovementLoop, runOptimization, runProfileMatrix, runProfileMatrixSegment, runSearch, scopedOptimizationMethod, scoreDiscrimination, scoreUserStory, scoreboardSummary, searchCellId, searchCellSetDigest, searchClaimDecision, searchClaimReserveUsd, searchDivergence, searchEdgeId, searchEstimateMethod, searchModelIdentity, searchNodeId, searchPolicyView, searchPosterior, searchProposalExecution, searchProposerView, searchReceiptAccounting, searchTaskSetDigest, searchUnitScores, sequentialDecide, sequentialOptimizationMethod, sequentialPairedGate, skillOptOptimizationMethod, surfaceContentHash, surfaceDiff, surfaceDispatchRef, surfaceHash, surfaceNode, transientDispatchFailure, uniform, userStoryScoreboard, validateSearchLedgerEvent, verifyCodeSurface, verifySearchClaim, verifySearchHistoryArtifact, verifySearchHistoryReceipt };

package/dist/campaign/index.js

@@ -1,15 +1,15 @@
 import { a as heldoutSignificance, i as dimensionRegressions, o as pairHoldout } from "../statistical-heldout-Bksv92Th.js";
-import { $ as planCampaignRun, A as verifySearchHistoryReceipt, B as defaultProductionGate, C as searchEdgeId, D as assertSearchHistoryMatchesState, F as asha, I as uniform, M as searchModelIdentity, N as searchProposalExecution, O as createSearchHistoryReceipt, P as searchReceiptAccounting, Q as runCampaign, S as developmentClaim, T as surfaceNode, Z as runEval, _ as beam, b as incumbentWithOperatorBandit, d as costFromLedgerSummary, et as resolveRunDir, g as aide, h as isProposedCandidate, i as transientDispatchFailure, j as campaignCellSearchResult, k as verifySearchHistoryArtifact, l as readGepaCandidatePopulationArtifact, m as runOptimization, nt as cellCachePath, p as runImprovementLoop, r as isTransientTransportFailure, t as llmJudge, tt as buildCellSchedule, v as crowdedFrontierParent, w as surfaceDiff, x as SearchRecorder, y as incumbent } from "../llm-judge-Cc8vDJh_.js";
+import { $ as planCampaignRun, A as verifySearchHistoryReceipt, B as defaultProductionGate, C as searchEdgeId, D as assertSearchHistoryMatchesState, F as asha, I as uniform, M as searchModelIdentity, N as searchProposalExecution, O as createSearchHistoryReceipt, P as searchReceiptAccounting, Q as runCampaign, S as developmentClaim, T as surfaceNode, Z as runEval, _ as beam, b as incumbentWithOperatorBandit, d as costFromLedgerSummary, et as resolveRunDir, g as aide, h as isProposedCandidate, i as transientDispatchFailure, j as campaignCellSearchResult, k as verifySearchHistoryArtifact, l as readGepaCandidatePopulationArtifact, m as runOptimization, nt as cellCachePath, p as runImprovementLoop, r as isTransientTransportFailure, t as llmJudge, tt as buildCellSchedule, v as crowdedFrontierParent, w as surfaceDiff, x as SearchRecorder, y as incumbent } from "../llm-judge-3uAeRawE.js";
 import { B as campaignSplitDigestFromIdentities, C as assertCodeSurfaceIdentity, D as surfaceContentHash, E as renderSurfaceDiff, L as campaignCoverage, O as surfaceDispatchRef, P as assertCampaignDesign, R as campaignScenarioIdentity, T as componentSurfaceIdentityMaterial, f as campaignBreakdown, k as surfaceHash, l as canonicalDigest, p as campaignMeanComposite, u as emitLoopProvenance, w as codeSurfaceIdentityMaterial, y as powerPreflight, z as campaignSplitDigest } from "../campaign-evidence-DunzcJGv.js";
 import { a as SearchLedgerError, o as SearchLedgerIntegrityError } from "../search-ledger-file-Bd5Tioq6.js";
-import { M as fsCampaignStorage, N as inMemoryCampaignStorage, j as createRunCostLedger, l as DEFAULT_EXTERNAL_OPTIMIZER_CALLBACK_LIMITS, u as DEFAULT_EXTERNAL_OPTIMIZER_PROCESS_LIMITS } from "../external-optimizer-subprocess-D670Oxf2.js";
-import { a as makeProposalFinding } from "../types-DqFMNTgK.js";
+import { M as fsCampaignStorage, N as inMemoryCampaignStorage, j as createRunCostLedger, l as DEFAULT_EXTERNAL_OPTIMIZER_CALLBACK_LIMITS, u as DEFAULT_EXTERNAL_OPTIMIZER_PROCESS_LIMITS } from "../external-optimizer-subprocess-DA02c_L6.js";
+import { a as makeProposalFinding } from "../types-CnWmj8NW.js";
 import { C as SEARCH_ESTIMATOR, D as searchEstimateMethod, E as searchCellSetDigest, O as searchPosterior, T as estimateNodeFromCells, _ as planSearchClaim, a as searchDivergence, b as verifySearchClaim, g as decideSearchClaim, h as SEARCH_CLAIM_RULE, i as runSearch, o as searchPolicyView, v as searchClaimDecision, w as estimateNode, y as searchClaimReserveUsd } from "../pareto-BiBnQXAE.js";
 import { a as validateSearchLedgerEvent, c as SearchStateView, d as searchNodeId, f as searchTaskSetDigest, i as replaySearchLedgerText, l as searchUnitScores, n as openSearchLedger, o as SEARCH_LEDGER_SCHEMA, r as parseSearchLedgerLine, s as SearchState, t as FileSearchLedger, u as searchCellId } from "../search-ledger-CZRqtFbW.js";
 import { t as acquireSingleRunLock } from "../single-run-lock-Dekd8_Wv.js";
 import { n as searchProposerView, t as renderSearchSummary } from "../search-summary-D4bwYnAE.js";
-import { C as measureCampaignCost, S as analyzeCrossSurfaceInteractions, _ as neutralizationGate, a as createRetainedDispatch, b as loadEvalFixtureScenarios, c as runProfileMatrixSegment, d as scoreUserStory, f as scoreboardSummary, g as neutralizeText, h as sequentialOptimizationMethod, i as scoreDiscrimination, l as runProfileMatrix, m as scopedOptimizationMethod, n as resolveWorktreePath, o as createProfileMatrixPlan, p as userStoryScoreboard, r as verifyCodeSurface, s as finalizeProfileMatrix, t as gitWorktreeAdapter, u as renderScoreboardMarkdown, v as discoverEvalFixtures, x as planEvalFixtureRun, y as loadEvalFixture } from "../campaign-BVPC6ODQ.js";
-import { a as importExternalEvaluations, c as composeGate, d as readExternalOptimizerObservationArtifact, i as externalSurface, l as externalTextOptimizationMethod, n as compareOptimizationMethods, o as importGepaPopulation, r as gepaOptimizationMethod, s as heldOutGate, t as skillOptOptimizationMethod, u as decodeExternalTextCandidate } from "../skillopt-optimization-method-DLKqdhcR.js";
+import { C as measureCampaignCost, S as analyzeCrossSurfaceInteractions, _ as neutralizationGate, a as createRetainedDispatch, b as loadEvalFixtureScenarios, c as runProfileMatrixSegment, d as scoreUserStory, f as scoreboardSummary, g as neutralizeText, h as sequentialOptimizationMethod, i as scoreDiscrimination, l as runProfileMatrix, m as scopedOptimizationMethod, n as resolveWorktreePath, o as createProfileMatrixPlan, p as userStoryScoreboard, r as verifyCodeSurface, s as finalizeProfileMatrix, t as gitWorktreeAdapter, u as renderScoreboardMarkdown, v as discoverEvalFixtures, x as planEvalFixtureRun, y as loadEvalFixture } from "../campaign-Bt6rbWIU.js";
+import { a as importExternalEvaluations, c as composeGate, d as readExternalOptimizerObservationArtifact, i as externalSurface, l as externalTextOptimizationMethod, n as compareOptimizationMethods, o as importGepaPopulation, r as gepaOptimizationMethod, s as heldOutGate, t as skillOptOptimizationMethod, u as decodeExternalTextCandidate } from "../skillopt-optimization-method-D21dH_Bh.js";
 import { n as paretoPolicy, r as paretoSignificanceGate, t as buildEvidenceVector } from "../promotion-policy-6A8osGr_.js";
 import { n as sequentialPairedGate, t as sequentialDecide } from "../sequential-CimQrbjv.js";
 export { DEFAULT_EXTERNAL_OPTIMIZER_CALLBACK_LIMITS, DEFAULT_EXTERNAL_OPTIMIZER_PROCESS_LIMITS, FileSearchLedger, SEARCH_CLAIM_RULE, SEARCH_ESTIMATOR, SEARCH_LEDGER_SCHEMA, SearchLedgerError, SearchLedgerIntegrityError, SearchRecorder, SearchState, SearchStateView, acquireSingleRunLock, aide, analyzeCrossSurfaceInteractions, asha, assertCampaignDesign, assertCodeSurfaceIdentity, assertSearchHistoryMatchesState, beam, buildCellSchedule, buildEvidenceVector, campaignBreakdown, campaignCellSearchResult, campaignCoverage, campaignMeanComposite, campaignScenarioIdentity, campaignSplitDigest, campaignSplitDigestFromIdentities, canonicalDigest, cellCachePath, codeSurfaceIdentityMaterial, compareOptimizationMethods, componentSurfaceIdentityMaterial, composeGate, costFromLedgerSummary, createProfileMatrixPlan, createRetainedDispatch, createRunCostLedger, createSearchHistoryReceipt, crowdedFrontierParent, decideSearchClaim, decodeExternalTextCandidate, defaultProductionGate, developmentClaim, dimensionRegressions, discoverEvalFixtures, emitLoopProvenance, estimateNode, estimateNodeFromCells, externalSurface, externalTextOptimizationMethod, finalizeProfileMatrix, fsCampaignStorage, gepaOptimizationMethod, gitWorktreeAdapter, heldOutGate, heldoutSignificance, importExternalEvaluations, importGepaPopulation, inMemoryCampaignStorage, incumbent, incumbentWithOperatorBandit, isProposedCandidate, isTransientTransportFailure, llmJudge, loadEvalFixture, loadEvalFixtureScenarios, makeProposalFinding, measureCampaignCost, neutralizationGate, neutralizeText, openSearchLedger, pairHoldout, paretoPolicy, paretoSignificanceGate, parseSearchLedgerLine, planCampaignRun, planEvalFixtureRun, planSearchClaim, powerPreflight, readExternalOptimizerObservationArtifact, readGepaCandidatePopulationArtifact, renderScoreboardMarkdown, renderSearchSummary, renderSurfaceDiff, replaySearchLedgerText, resolveRunDir, resolveWorktreePath, runCampaign, runEval, runImprovementLoop, runOptimization, runProfileMatrix, runProfileMatrixSegment, runSearch, scopedOptimizationMethod, scoreDiscrimination, scoreUserStory, scoreboardSummary, searchCellId, searchCellSetDigest, searchClaimDecision, searchClaimReserveUsd, searchDivergence, searchEdgeId, searchEstimateMethod, searchModelIdentity, searchNodeId, searchPolicyView, searchPosterior, searchProposalExecution, searchProposerView, searchReceiptAccounting, searchTaskSetDigest, searchUnitScores, sequentialDecide, sequentialOptimizationMethod, sequentialPairedGate, skillOptOptimizationMethod, surfaceContentHash, surfaceDiff, surfaceDispatchRef, surfaceHash, surfaceNode, transientDispatchFailure, uniform, userStoryScoreboard, validateSearchLedgerEvent, verifyCodeSurface, verifySearchClaim, verifySearchHistoryArtifact, verifySearchHistoryReceipt };

package/dist/{campaign-BVPC6ODQ.js → campaign-Bt6rbWIU.js}

@@ -1,26 +1,27 @@
 import { s as ValidationError, t as AgentEvalError } from "./errors-BcOs5MKW.js";
 import { a as hashCanonical, i as compareCodeUnits, r as canonicalString } from "./canonical-Dq2hOQ8L.js";
-import { c as agentProfileModelId, o as agentProfileHash, r as verifyCompletion, s as agentProfileId, u as harnessAxisOf } from "./completion-verifier-Cigap8CG.js";
+import { c as agentProfileModelId, o as agentProfileHash, r as verifyCompletion, s as agentProfileId, u as harnessAxisOf } from "./completion-verifier-YwoeujPl.js";
 import { i as buildAgentProfileCell } from "./agent-profile-cell-B1V1gUZs.js";
 import { c as validateRunRecord, i as modelHasSnapshot, n as UNKNOWN_MODEL, o as runTaskScore } from "./run-record-DhEJgoPz.js";
-import { t as comparePairedArms } from "./paired-arms-Ct4LTKc1.js";
+import { t as comparePairedArms } from "./paired-arms-B2ttLc0_.js";
 import { i as pairedBootstrap } from "./mean-BbA_JCzW.js";
 import { o as pairHoldout } from "./statistical-heldout-Bksv92Th.js";
 import { n as contentHash, t as canonicalJson } from "./verdict-cache-CL_7tePD.js";
-import { $ as planCampaignRun, Q as runCampaign, et as resolveRunDir, nt as cellCachePath, rt as computeManifestHash, s as executeOptimizationMethod, u as combineComparisonCosts } from "./llm-judge-Cc8vDJh_.js";
+import { $ as planCampaignRun, Q as runCampaign, et as resolveRunDir, nt as cellCachePath, rt as computeManifestHash, s as executeOptimizationMethod, u as combineComparisonCosts } from "./llm-judge-3uAeRawE.js";
 import { n as campaignCellToRunRecord, r as projectCampaignCellQuality, t as campaignCellCostProvenance } from "./run-record-CysKLB93.js";
 import { C as assertCodeSurfaceIdentity, D as surfaceContentHash, M as assertRealBackend, N as summarizeBackendIntegrity, P as assertCampaignDesign, R as campaignScenarioIdentity } from "./campaign-evidence-DunzcJGv.js";
 import { a as mapConcurrent } from "./journal-C7om8Gum.js";
-import { M as fsCampaignStorage } from "./external-optimizer-subprocess-D670Oxf2.js";
+import { M as fsCampaignStorage } from "./external-optimizer-subprocess-DA02c_L6.js";
+import "./types-CnWmj8NW.js";
 import "./pareto-BiBnQXAE.js";
 import "./search-ledger-CZRqtFbW.js";
 import "./search-summary-D4bwYnAE.js";
-import "./external-optimizer-process-wOLfzsCC.js";
-import "./skillopt-optimization-method-DLKqdhcR.js";
+import "./external-optimizer-process-E5yY2SYS.js";
+import "./skillopt-optimization-method-D21dH_Bh.js";
 import "./sequential-CimQrbjv.js";
 import { createHash } from "node:crypto";
-import { closeSync, constants, existsSync, fstatSync, lstatSync, mkdirSync, mkdtempSync, openSync, readFileSync, readSync, readdirSync, readlinkSync, realpathSync, rmSync, statSync } from "node:fs";
 import { z } from "zod";
+import { closeSync, constants, existsSync, fstatSync, lstatSync, mkdirSync, mkdtempSync, openSync, readFileSync, readSync, readdirSync, readlinkSync, realpathSync, rmSync, statSync } from "node:fs";
 import { basename, dirname, isAbsolute, join, relative, resolve, sep } from "node:path";
 import { devNull, tmpdir } from "node:os";
 import { execFileSync } from "node:child_process";
@@ -3097,4 +3098,4 @@ function resolveWorktreePath(surface, worktreeDir) {
 //#endregion
 export { measureCampaignCost as C, analyzeCrossSurfaceInteractions as S, neutralizationGate as _, createRetainedDispatch as a, loadEvalFixtureScenarios as b, runProfileMatrixSegment as c, scoreUserStory as d, scoreboardSummary as f, neutralizeText as g, sequentialOptimizationMethod as h, scoreDiscrimination as i, runProfileMatrix as l, scopedOptimizationMethod as m, resolveWorktreePath as n, createProfileMatrixPlan as o, userStoryScoreboard as p, verifyCodeSurface as r, finalizeProfileMatrix as s, gitWorktreeAdapter as t, renderScoreboardMarkdown as u, discoverEvalFixtures as v, planEvalFixtureRun as x, loadEvalFixture as y };
 
-//# sourceMappingURL=campaign-BVPC6ODQ.js.map
+//# sourceMappingURL=campaign-Bt6rbWIU.js.map