@tangle-network/agent-eval 0.191.0 → 0.193.0

package/dist/{llm-judge-NJOHM0iA.js → llm-judge-ChbWfeWl.js}

@@ -1,21 +1,24 @@
 import { i as JudgeError, s as ValidationError } from "./errors-Dngq5h35.js";
 import { a as hashCanonical, i as compareCodeUnits, r as canonicalString, t as LEDGER_HASH_PATTERN } from "./canonical-BsZVgBhW.js";
+import { t as mulberry32 } from "./random-Dn5fPWkt.js";
 import { o as summarizeNumberSeries, s as weightedComposite, t as confidenceInterval } from "./descriptive-1V17A-qa.js";
-import { t as decidePairedPromotion } from "./paired-promotion-decision-6cn3bLc3.js";
-import { a as heldoutSignificance, i as dimensionRegressions, o as pairHoldout } from "./statistical-heldout-GcLIPxk4.js";
+import { v as wilson } from "./paired-arms-JSDcs2zx.js";
+import { t as decidePairedPromotion } from "./paired-promotion-decision-DTKl6-G8.js";
+import { a as heldoutSignificance, i as dimensionRegressions, o as pairHoldout } from "./statistical-heldout-DANVmyug.js";
 import { i as modelHasSnapshot, l as searchCellRunId } from "./run-record-BRlM99rX.js";
 import { n as contentHash } from "./verdict-cache-BQEsVy9n.js";
 import { r as projectCampaignCellQuality, t as campaignCellCostProvenance } from "./run-record-tNnlQIrD.js";
 import { i as CostLedger, t as CostAccountingIncompleteError } from "./cost-ledger-_IbkejCF.js";
-import { A as FinalEvidenceConflictError, B as surfaceHashMatches, C as campaignMeanCompositeOrNull, G as assertCampaignSplitIdentity, I as renderSurfaceDiff, J as campaignScenarioIdentity, K as assertCompleteCampaign, L as surfaceContentHash, R as surfaceDispatchRef, S as campaignMeanComposite, V as BackendIntegrityError, W as assertCampaignDesign, Y as campaignSplitDigest, Z as formatCoverageFailures, b as assertFiniteRankKey, j as FinalEvidenceError, q as campaignCoverage, t as createCampaignEvidenceReceipt, w as compareRankKeys, x as campaignBreakdown, z as surfaceHash } from "./campaign-evidence-BqjlTM3P.js";
-import { p as mapConcurrent } from "./journal-c3qY0SDP.js";
+import { F as surfaceContentHash, G as campaignCoverage, H as assertCampaignDesign, I as surfaceDispatchRef, K as campaignScenarioIdentity, L as surfaceHash, O as FinalEvidenceConflictError, P as renderSurfaceDiff, R as surfaceHashMatches, S as campaignMeanCompositeOrNull, U as assertCampaignSplitIdentity, W as assertCompleteCampaign, Y as formatCoverageFailures, b as campaignBreakdown, k as FinalEvidenceError, q as campaignSplitDigest, t as createCampaignEvidenceReceipt, x as campaignMeanComposite, z as BackendIntegrityError } from "./campaign-evidence-DJc60F9C.js";
+import { m as mapConcurrent } from "./journal-DvKCvjty.js";
 import { t as deepFreezeCanonicalJson } from "./deep-freeze-CurcOQg3.js";
-import { S as fsCampaignStorage, g as isRecord, h as isExternalTextCandidate, x as createRunCostLedger } from "./external-optimizer-subprocess-B234V9V0.js";
+import { C as fsCampaignStorage, S as createRunCostLedger, g as isRecord, h as isExternalTextCandidate, x as acquireSingleRunLock } from "./external-optimizer-subprocess-kbqC-iWf.js";
 import { r as summarizeEvaluationUnits, t as defineEvaluationClaim } from "./claim-V9Zqbq0J.js";
 import { f as redactText, n as REDACTION_VERSION, o as detectCredential, s as detectPersonalData } from "./redact-B7rt9Zot.js";
 import { t as detectRewardHacking } from "./reward-hacking-D0XwhVWE.js";
 import { n as assertProposalFindings, t as combineAbortSignals } from "./abort-signal-CtzAM_sJ.js";
-import { a as validateSearchLedgerEvent, c as searchCellId, i as replaySearchLedgerText, l as searchNodeId, u as searchTaskSetDigest } from "./search-ledger-CQ8Uy4FK.js";
+import { a as validateSearchLedgerEvent, d as searchTaskSetDigest, i as replaySearchLedgerText, l as searchCellId, n as openSearchLedger, t as FileSearchLedger, u as searchNodeId } from "./search-ledger-CJiAEU3j.js";
+import { c as seedFromDigest, i as estimateNode, n as searchProposerView, s as searchPosterior, t as renderSearchSummary } from "./search-summary-BhY8p0Av.js";
 import { d as stripFencedJson, o as costReceiptFromLlm, s as costReceiptFromLlmError, u as maximumChargeForLlmRequest } from "./llm-client-KYQBh9C8.js";
 import { createHash } from "node:crypto";
 import { writeFileSync } from "node:fs";
@@ -1161,8 +1164,8 @@ function detectCalibrationDrift(runs, opts) {
 				alpha,
 				recentN: recent.length,
 				historyN: historical.length,
-				recentMean: mean$1(recent),
-				historyMean: mean$1(historical)
+				recentMean: mean$3(recent),
+				historyMean: mean$3(historical)
 			}
 		}],
 		evaluation: {
@@ -1399,7 +1402,7 @@ function chiSquareCritical(df, alpha) {
 	}
 	return TABLE[10][idx];
 }
-function mean$1(xs) {
+function mean$3(xs) {
 	if (xs.length === 0) return 0;
 	return xs.reduce((s, x) => s + x, 0) / xs.length;
 }
@@ -2532,20 +2535,1775 @@ function paretoFrontierWithCrowding(candidates, objectives) {
 	return crowdingDistance(frontier, objectives).sort((a, b) => b.distance - a.distance);
 }
 //#endregion
-//#region src/campaign/types.ts
-/** Type guard: a proposal carrying its rationale vs a bare
-*  surface. The loop branches on this to populate `GenerationCandidate`. */
-function isProposedCandidate(value) {
-	return typeof value === "object" && value !== null && "surface" in value && "label" in value && "rationale" in value;
+//#region src/campaign/allocation.ts
+/**
+* Every node gets every train and selection task at every repeat: the root as
+* `root` cells, every other node as `train` cells (the proposer's feedback) and
+* `screen` cells (the policy's private evidence). This is the fixed plan the
+* generation loop ran and GEPA runs.
+*/
+function uniform(options = {}) {
+	const reps = options.reps ?? 1;
+	if (!Number.isSafeInteger(reps) || reps < 1) throw new TypeError(`uniform: reps must be a positive integer, got ${String(reps)}`);
+	const cells = (state, root) => {
+		const header = state.header;
+		if (!header) return [];
+		const plan = [];
+		for (const split of ["train", "selection"]) for (const task of header.splits[split].tasks) for (let rep = 0; rep < reps; rep++) plan.push({
+			taskId: task.taskId,
+			split,
+			rep,
+			stage: root ? "root" : split === "train" ? "train" : "screen"
+		});
+		return plan;
+	};
+	return {
+		name: reps === 1 ? "uniform" : `uniform(reps=${reps})`,
+		reps,
+		plan: (state, nodeId) => cells(state, nodeId === state.rootNodeId),
+		screenSize: (state) => cells(state, false).length
+	};
 }
-const LABEL_TRUST_RANK = {
-	unverified: 0,
-	"verified-signal": 1,
-	"human-rated": 2
+//#endregion
+//#region src/paired-promotion-power.ts
+/**
+* @module
+* Joint power of a configured {@link decidePairedPromotion} call, computed by
+* running that call on data drawn from a registered alternative.
+*
+* Why a simulation and not a formula: `decidePairedPromotion` is not one test.
+* It routes by sample size (exact sign test below `BOOTSTRAP_GATE_MIN_N`,
+* paired bootstrap at or above it) and by shape (Tango's score interval on a
+* two-point outcome), and on top of the deciding interval it applies a
+* sufficiency floor, a zero-width refusal and McNemar's exact veto. A
+* preregistration usually seals two such calls, a continuous primary and a
+* pass/fail veto drawn from the same episodes, and promotes only when both
+* promote. The sample size at which THAT procedure reaches a target power is
+* not the power of any one channel: the sign-test power at n can be 0.8 while
+* the promotion probability is well below it because the veto binds
+* (agent-eval#785). Closed forms exist for single channels only, and each one
+* shipped here under-sized the call it stood in for (`mcnemarRequiredN` is
+* Lachin's normal approximation, 0.65 exact power where it promised 0.8 at 14
+* pairs; `requiredPairedSampleSize` sizes a paired t the procedure never runs).
+* So the only faithful power is the procedure's own promotion rate under the
+* alternative, and that is what this module computes: draw n pairs from the
+* registered law, run every configured call on them exactly as the caller
+* will, repeat, count.
+*
+* The alternative is DECLARATIVE and serializable, never a sampler function,
+* so a preregistration can seal it as bytes: a mixture of cells, each with a
+* probability, an optional pass/fail outcome per arm for the binary calls,
+* and a law for the candidate-minus-baseline delta on the continuous scale.
+* Drawing the cell first and the delta given the cell is what makes the two
+* channels one joint law rather than two marginals.
+*
+* Everything is seeded (`mulberry32`), so a sizing is reproducible from its
+* inputs, and every estimate carries its Monte Carlo standard error and a
+* Wilson interval: a power read at 0.80 from 1,000 simulations is 0.80 ± 0.013.
+*/
+/**
+* Joint power of the configured calls at `n` under the registered alternative:
+* the fraction of simulated data sets on which every call promotes.
+*/
+function pairedPromotionPower(options) {
+	const n = options.n;
+	if (!Number.isInteger(n) || n < 1) throw new Error(`pairedPromotionPower: n must be a positive integer, got ${n}`);
+	const simulations = options.simulations ?? 1e3;
+	if (!Number.isInteger(simulations) || simulations < 1) throw new Error(`pairedPromotionPower: simulations must be a positive integer, got ${simulations}`);
+	const seed = options.seed ?? 1;
+	if (!Number.isFinite(seed)) throw new Error(`pairedPromotionPower: seed must be finite, got ${seed}`);
+	const calls = validateCalls(options.calls);
+	const alternative = validateAlternative(options.alternative, calls);
+	const rng = mulberry32(seed);
+	let promotions = 0;
+	let refusals = 0;
+	const perCall = calls.map(() => ({
+		promote: 0,
+		insufficient: 0,
+		indeterminate: 0,
+		exactTestVetoes: 0,
+		hold: 0,
+		methods: /* @__PURE__ */ new Map()
+	}));
+	for (let s = 0; s < simulations; s++) {
+		const pairs = drawPairs(alternative, n, rng);
+		let all = true;
+		let anyRefusal = false;
+		for (let c = 0; c < calls.length; c++) {
+			const call = calls[c];
+			const decision = runCall(call, pairs, n);
+			const tally = perCall[c];
+			tally.methods.set(decision.method, (tally.methods.get(decision.method) ?? 0) + 1);
+			if (decision.promote) tally.promote++;
+			else {
+				if (!decision.sufficient) tally.insufficient++;
+				if (decision.indeterminate) tally.indeterminate++;
+				if (decision.exactTestVetoes) tally.exactTestVetoes++;
+				if (decision.sufficient && !decision.indeterminate && !decision.exactTestVetoes) tally.hold++;
+			}
+			if (!decision.promote) all = false;
+			if (!decision.sufficient || decision.indeterminate || decision.exactTestVetoes) anyRefusal = true;
+		}
+		if (all) promotions++;
+		else if (anyRefusal) refusals++;
+	}
+	const power = promotions / simulations;
+	const interval = wilson(promotions, simulations, .95);
+	return {
+		n,
+		simulations,
+		seed,
+		power,
+		standardError: Math.sqrt(power * (1 - power) / simulations),
+		low: interval.lower,
+		high: interval.upper,
+		refuse: refusals / simulations,
+		hold: (simulations - promotions - refusals) / simulations,
+		calls: perCall.map((tally, c) => ({
+			outcome: calls[c].outcome,
+			promote: tally.promote / simulations,
+			insufficient: tally.insufficient / simulations,
+			indeterminate: tally.indeterminate / simulations,
+			exactTestVetoes: tally.exactTestVetoes / simulations,
+			hold: tally.hold / simulations,
+			methods: Object.fromEntries([...tally.methods.entries()].map(([method, count]) => [method, count / simulations]))
+		}))
+	};
+}
+/**
+* First n at which {@link pairedPromotionPower} reaches the target, scanning
+* every n from `minPairs` upward. Both the point-estimate answer and the
+* confirmed lower-bound answer are returned; the scan runs until the latter is
+* reached (so the curve past `n` is retained) or `maxPairs` is exhausted. A
+* candidate selected by the scan's bound is certified only by an independent
+* simulation at that n on a different seed; a candidate that fails it is
+* recorded and the scan continues.
+*/
+function requiredPairsForPairedPromotion(options) {
+	const target = options.target ?? .8;
+	if (!Number.isFinite(target) || target <= 0 || target >= 1) throw new Error(`requiredPairsForPairedPromotion: target must be in (0,1), got ${target}`);
+	const minPairs = options.minPairs ?? 1;
+	const maxPairs = options.maxPairs ?? 200;
+	if (!Number.isInteger(minPairs) || minPairs < 1) throw new Error(`requiredPairsForPairedPromotion: minPairs must be a positive integer, got ${minPairs}`);
+	if (!Number.isInteger(maxPairs) || maxPairs < minPairs) throw new Error(`requiredPairsForPairedPromotion: maxPairs must be an integer >= minPairs, got ${maxPairs}`);
+	const seed = options.seed ?? 1;
+	const curve = [];
+	const rejected = [];
+	let n = null;
+	let nAtLowerBound = null;
+	let confirmation = null;
+	for (let candidate = minPairs; candidate <= maxPairs; candidate++) {
+		const result = pairedPromotionPower({
+			n: candidate,
+			alternative: options.alternative,
+			calls: options.calls,
+			simulations: options.simulations,
+			seed
+		});
+		curve.push(result);
+		if (n === null && result.power >= target) n = candidate;
+		if (result.low >= target) {
+			const check = pairedPromotionPower({
+				n: candidate,
+				alternative: options.alternative,
+				calls: options.calls,
+				simulations: options.simulations,
+				seed: confirmationSeed(seed, candidate)
+			});
+			if (check.low >= target) {
+				nAtLowerBound = candidate;
+				confirmation = check;
+				break;
+			}
+			rejected.push(check);
+		}
+	}
+	return {
+		target,
+		n,
+		nAtLowerBound,
+		confirmation,
+		curve,
+		rejected
+	};
+}
+/** A seed for the confirmation at `n` that never equals the scan seed. */
+function confirmationSeed(seed, n) {
+	return (Math.imul((seed | 0) ^ 2654435769, 2246822507) + Math.imul(n, 3266489909) | 1) >>> 0;
+}
+function drawPairs(alternative, n, rng) {
+	const baseline = alternative.baseline ?? {
+		kind: "point",
+		value: 0
+	};
+	const control = new Array(n);
+	const candidate = new Array(n);
+	const controlPass = new Array(n);
+	const candidatePass = new Array(n);
+	for (let i = 0; i < n; i++) {
+		const cell = drawCell(alternative.cells, rng);
+		const base = drawValue(baseline, rng);
+		control[i] = base;
+		candidate[i] = base + drawValue(cell.delta, rng);
+		controlPass[i] = cell.pass?.control ?? false;
+		candidatePass[i] = cell.pass?.treatment ?? false;
+	}
+	return {
+		control,
+		candidate,
+		controlPass,
+		candidatePass
+	};
+}
+function drawCell(cells, rng) {
+	const u = rng();
+	let cumulative = 0;
+	for (const cell of cells) {
+		cumulative += cell.probability;
+		if (u < cumulative) return cell;
+	}
+	return cells[cells.length - 1];
+}
+function drawValue(law, rng) {
+	switch (law.kind) {
+		case "point": return law.value;
+		case "atoms": {
+			const u = rng();
+			let cumulative = 0;
+			for (const atom of law.atoms) {
+				cumulative += atom.probability;
+				if (u < cumulative) return atom.value;
+			}
+			return law.atoms[law.atoms.length - 1].value;
+		}
+		case "normal": {
+			const u1 = 1 - rng();
+			const u2 = rng();
+			return law.mean + law.sd * Math.sqrt(-2 * Math.log(u1)) * Math.cos(2 * Math.PI * u2);
+		}
+	}
+}
+function runCall(call, pairs, n) {
+	const options = {
+		minPairs: n,
+		...call.options
+	};
+	if (call.outcome === "pass") {
+		const scale = call.options.binaryScale;
+		return decidePairedPromotion(pairs.controlPass.map((p) => p ? scale : 0), pairs.candidatePass.map((p) => p ? scale : 0), options);
+	}
+	return decidePairedPromotion(pairs.control, pairs.candidate, options);
+}
+function validateCalls(calls) {
+	if (!Array.isArray(calls) || calls.length === 0) throw new Error("pairedPromotionPower: at least one call is required");
+	calls.forEach((call, i) => {
+		if (call.outcome !== "delta" && call.outcome !== "pass") throw new Error(`pairedPromotionPower: calls[${i}].outcome must be 'delta' or 'pass'`);
+		if (call.options === null || typeof call.options !== "object") throw new Error(`pairedPromotionPower: calls[${i}].options must be an object`);
+		if (call.options.minPairs !== void 0 && (!Number.isInteger(call.options.minPairs) || call.options.minPairs < 1)) throw new Error(`pairedPromotionPower: calls[${i}].options.minPairs must be a positive integer`);
+		if (call.outcome === "pass") {
+			const scale = call.options.binaryScale;
+			if (scale === void 0 || !Number.isFinite(scale) || scale <= 0) throw new Error(`pairedPromotionPower: calls[${i}] is a 'pass' call and must declare a finite positive options.binaryScale`);
+			if (call.options.continuous) throw new Error(`pairedPromotionPower: calls[${i}] is a 'pass' call; continuous cannot accompany it`);
+			if (call.options.statistic === "median") throw new Error(`pairedPromotionPower: calls[${i}] is a 'pass' call; binaryScale requires the mean statistic, not median`);
+		} else if (call.options.binaryScale !== void 0) throw new Error(`pairedPromotionPower: calls[${i}] is a 'delta' call and cannot declare binaryScale; use a 'pass' call for a two-point outcome`);
+	});
+	return calls;
+}
+function validateAlternative(alternative, calls) {
+	if (!alternative || !Array.isArray(alternative.cells) || alternative.cells.length === 0) throw new Error("pairedPromotionPower: alternative.cells must be a non-empty array");
+	const needsPass = calls.some((call) => call.outcome === "pass");
+	let total = 0;
+	alternative.cells.forEach((cell, i) => {
+		if (!Number.isFinite(cell.probability) || cell.probability < 0) throw new Error(`pairedPromotionPower: cells[${i}].probability must be a finite number >= 0`);
+		total += cell.probability;
+		if (needsPass) {
+			if (!cell.pass || typeof cell.pass.control !== "boolean" || typeof cell.pass.treatment !== "boolean") throw new Error(`pairedPromotionPower: cells[${i}].pass must give control and treatment booleans when a 'pass' call is configured`);
+		}
+		validateLaw(cell.delta, `cells[${i}].delta`);
+	});
+	if (Math.abs(total - 1) > 1e-9) throw new Error(`pairedPromotionPower: cell probabilities must sum to 1, got ${total}`);
+	if (alternative.baseline !== void 0) validateLaw(alternative.baseline, "baseline");
+	return alternative;
+}
+function validateLaw(law, where) {
+	if (!law || typeof law !== "object") throw new Error(`pairedPromotionPower: ${where} must be a law object`);
+	switch (law.kind) {
+		case "point":
+			if (!Number.isFinite(law.value)) throw new Error(`pairedPromotionPower: ${where}.value must be finite`);
+			return;
+		case "atoms": {
+			if (!Array.isArray(law.atoms) || law.atoms.length === 0) throw new Error(`pairedPromotionPower: ${where}.atoms must be a non-empty array`);
+			let total = 0;
+			law.atoms.forEach((atom, i) => {
+				if (!Number.isFinite(atom.value)) throw new Error(`pairedPromotionPower: ${where}.atoms[${i}].value must be finite`);
+				if (!Number.isFinite(atom.probability) || atom.probability < 0) throw new Error(`pairedPromotionPower: ${where}.atoms[${i}].probability must be a finite number >= 0`);
+				total += atom.probability;
+			});
+			if (Math.abs(total - 1) > 1e-9) throw new Error(`pairedPromotionPower: ${where}.atoms probabilities must sum to 1, got ${total}`);
+			return;
+		}
+		case "normal":
+			if (!Number.isFinite(law.mean) || !Number.isFinite(law.sd) || law.sd < 0) throw new Error(`pairedPromotionPower: ${where} needs a finite mean and a finite sd >= 0`);
+			return;
+		default: throw new Error(`pairedPromotionPower: ${where}.kind must be 'point', 'atoms' or 'normal'`);
+	}
+}
+//#endregion
+//#region src/campaign/search-claim.ts
+/**
+* The claim: the one statement a search makes about its nodes, made once, on
+* its sealed test split, after the search stops expanding.
+*
+* `planSearchClaim` fixes the claim's design from the ledger before any test
+* cell runs: up to 3 finalists ranked by selection mean, the estimator the
+* paired decision will use, the number of finalists the family-wise confidence
+* is divided among, and a power check on selection data. The kernel stores the
+* plan on the ledger's `claim` operation, so the ledger proves the design was
+* fixed before the test data existed. `decideSearchClaim` then reads the test
+* cells of the root and the finalists, which ran together, and decides each
+* finalist against the root with `decidePairedPromotion` at the Bonferroni
+* confidence `1 - 0.05 / k`.
+*
+* Every number is a pure function of the ledger: the power simulation is
+* seeded from the search's seed and the decisions from the digest of the test
+* cells they read, so a verifier with the same ledger gets the same claim.
+*/
+const FAMILY_CONFIDENCE = .95;
+const TARGET_POWER = .8;
+const POWER_SIMULATIONS = 500;
+const RESAMPLES = 2e3;
+/**
+* Every rule and parameter the claim depends on. Its digest is the claim's
+* revision; change a value here whenever the procedure changes, so the
+* revision moves with it.
+*/
+const CLAIM_DEFINITION = {
+	name: "tangle.search-claim.2026-09",
+	finalists: `up to 3 non-root nodes not decided invalid that scored every selection unit and beat the root's mean on the selection units they share, ranked by selection mean in the objective's direction, then registration order`,
+	familyConfidence: FAMILY_CONFIDENCE,
+	correction: "Bonferroni: each of k finalists against the root at 1 - (1 - familyConfidence) / k",
+	finalistCount: "the largest k whose test cells the unspent claim reserve and headroom cover and whose power reaches the target",
+	estimator: "binary with scale s when every train, selection and test unit has one task at one repeat and every pre-test score is 0 or s; otherwise continuous",
+	power: {
+		method: "pairedPromotionPower of the claim decision, simulated at the claim minimumEffect",
+		continuous: "per-unit improvement normal with the pooled selection variance",
+		binary: "discordant units at the pooled selection variance over 2 s^2 per side, shifted by minimumEffect / s; concordant units pass at the root selection pass rate",
+		targetPower: TARGET_POWER,
+		simulations: POWER_SIMULATIONS,
+		seed: "the first 32 bits of hashCanonical([search seed, k])"
+	},
+	decision: {
+		call: "decidePairedPromotion(root, finalist) on per-unit test means in the objective direction",
+		threshold: 0,
+		minPairs: "every test unit",
+		resamples: RESAMPLES,
+		seed: "the first 32 bits of the finalist's test cellSetDigest"
+	},
+	select: "the promoted finalist with the largest improvement; ties to the better selection rank",
+	ship: "a promoted finalist that scored every test unit, with the root, on held-out units, under a pinned judge"
 };
-/** Ordinal rank for a label-trust tier; absent ⇒ `unverified` (rank 0). */
-function labelTrustRank(trust) {
-	return LABEL_TRUST_RANK[trust ?? "unverified"];
+/** The claim procedure every `SearchClaim` and claim plan names. */
+const SEARCH_CLAIM_RULE = {
+	uri: "npm:@tangle-network/agent-eval#searchClaim",
+	revision: hashCanonical(CLAIM_DEFINITION)
+};
+/** The rule name decisions made by the claim record. */
+const SEARCH_CLAIM_RULE_NAME = CLAIM_DEFINITION.name;
+/**
+* The claim reserve a search needs: the root and 3 finalists on every test
+* task at `reps` repeats, each held at `cellUsd`. Declare at least this as
+* `budget.reservedClaimUsd`; `runSearch` refuses to start a capped search
+* with less.
+*/
+function searchClaimReserveUsd(input) {
+	return 4 * input.testTasks * input.reps * input.cellUsd;
+}
+/** Fix the claim's design from a search that stopped expanding. */
+function planSearchClaim(state, input) {
+	const header = requireHeader(state);
+	const root = state.rootNodeId;
+	const plan = (finalists, power, test, reason) => ({
+		kind: "search-claim-plan",
+		rule: SEARCH_CLAIM_RULE,
+		stopReason: input.stopReason,
+		finalists,
+		power,
+		test,
+		reason
+	});
+	const selectionUnits = unitIds(header.splits.selection.tasks);
+	const testUnits = unitIds(header.splits.test.tasks);
+	if (testUnits.length === 0) return plan([], { unknown: "the search has no test split" }, "hold", "the search has no test split, so it makes no claim");
+	if (selectionUnits.length === 0) return plan([], { unknown: "the search has no selection split to choose finalists on" }, "hold", "the search has no selection split, so no finalist can be chosen without the test data");
+	const candidates = rankFinalists(state, selectionUnits);
+	if (candidates.length === 0) return plan([], { unknown: "no node went to test" }, "hold", "no node scored every selection unit and beat the root's selection mean, so the search keeps the root");
+	const minimumEffect = header.objective.claim.minimumEffect;
+	if (minimumEffect === void 0) return plan(candidates.slice(0, 1), { unknown: "the claim declares no minimumEffect" }, "test-cannot-resolve", "the claim declares no minimumEffect, so no test split can be shown to resolve it");
+	const { pooledVariance } = searchPosterior(state, { split: "selection" });
+	if (pooledVariance === null) return plan(candidates.slice(0, 1), { unknown: "no node shares 2 selection units with the root, so the variance is unknown" }, "test-cannot-resolve", "the selection split gives no variance for the power check, so the test cannot be shown to resolve the minimum effect");
+	const estimator = claimEstimator(state, input.reps);
+	const rootPassRate = passRate(state.unitScores(root, "selection"), estimator);
+	let best = null;
+	let budgetBound = false;
+	for (let k = candidates.length; k >= 1; k--) {
+		const power = claimPower({
+			units: testUnits.length,
+			finalists: k,
+			minimumEffect,
+			pooledVariance,
+			estimator,
+			rootPassRate,
+			seed: header.policy.seed
+		});
+		best = power;
+		if (!power.adequate) continue;
+		if (!input.affordable(k)) {
+			budgetBound = true;
+			continue;
+		}
+		return plan(candidates.slice(0, k), power, "run", `${k} finalist${k === 1 ? "" : "s"} go to test: power ${round(power.powerAtMinimumEffect)} at an improvement of ${minimumEffect} on ${testUnits.length} test units reaches ${TARGET_POWER} at confidence ${round(bonferroni(k))} each`);
+	}
+	const power = best;
+	return plan(candidates.slice(0, 1), power, "test-cannot-resolve", budgetBound ? "the unspent claim reserve and headroom do not cover the test cells of the root and one finalist" : `even one finalist reaches power ${round("adequate" in power ? power.powerAtMinimumEffect : 0)} at an improvement of ${minimumEffect} on ${testUnits.length} test units, below ${TARGET_POWER}`);
+}
+/**
+* Decide the claim from the test cells of the root and the finalists. Call it
+* once every claim cell is settled or cancelled. It returns the claim and the
+* terminal decisions of the root and every finalist.
+*/
+function decideSearchClaim(state, plan) {
+	const header = requireHeader(state);
+	const root = state.rootNodeId;
+	const rootScored = [
+		"train",
+		"selection",
+		"test"
+	].some((split) => state.scoredCells(root, split).length > 0);
+	const keepRoot = rootScored ? root : null;
+	const rule = SEARCH_CLAIM_RULE_NAME;
+	const decisions = [];
+	const claimOf = (finalists, selected, decision, reason) => ({
+		rule: SEARCH_CLAIM_RULE,
+		confidence: FAMILY_CONFIDENCE,
+		power: plan.power,
+		finalists,
+		selected,
+		decision,
+		reason
+	});
+	if (plan.test !== "run") {
+		for (const finalist of plan.finalists) decisions.push({
+			nodeId: finalist.nodeId,
+			decision: { status: "rejected" },
+			basis: null,
+			rule,
+			reason: `no test cell ran: ${plan.reason}`
+		});
+		decisions.push(rootDecision(root, rootScored ? "kept" : "unscored", rule, plan.reason));
+		return {
+			claim: claimOf(plan.finalists.map((finalist) => ({
+				nodeId: finalist.nodeId,
+				estimate: null,
+				test: null,
+				promote: false
+			})), keepRoot, plan.test, plan.reason),
+			decisions
+		};
+	}
+	const power = plan.power;
+	if (!("adequate" in power)) throw new Error("a claim that runs its test cells has a known power");
+	const k = plan.finalists.length;
+	const confidence = bonferroni(k);
+	const testUnits = unitIds(header.splits.test.tasks);
+	const maximize = header.objective.direction === "maximize";
+	const rootUnits = state.unitScores(root, "test");
+	const tested = plan.finalists.map(({ nodeId }) => {
+		const estimate = estimateNode(state, nodeId, {
+			against: root,
+			split: "test"
+		});
+		return {
+			nodeId,
+			estimate,
+			...pairedTest({
+				root: rootUnits,
+				node: state.unitScores(nodeId, "test"),
+				testUnits,
+				confidence,
+				estimator: power.estimator,
+				maximize,
+				seed: seedFromDigest(estimate.cellSetDigest)
+			})
+		};
+	});
+	const winner = tested.map((entry, rank) => ({
+		...entry,
+		rank
+	})).filter((entry) => entry.promote).sort((a, b) => b.improvement - a.improvement || a.rank - b.rank)[0] ?? null;
+	const blockers = [];
+	if (!header.splits.heldOutUnits) blockers.push("the test units also appear in train or selection");
+	if ("unknown" in header.objective.judge) blockers.push("the judge is not pinned");
+	const ship = winner !== null && blockers.length === 0;
+	const selected = ship ? winner.nodeId : keepRoot;
+	const reason = ship ? `finalist ${winner.nodeId} beat the root on the ${testUnits.length} test units at confidence ${round(confidence)} (${k} finalist${k === 1 ? "" : "s"}, family-wise ${FAMILY_CONFIDENCE})` : winner !== null ? `finalist ${winner.nodeId} beat the root, but the claim cannot ship: ${blockers.join("; ")}` : `no finalist beat the root on the test split at confidence ${round(confidence)} (${k} finalist${k === 1 ? "" : "s"}, family-wise ${FAMILY_CONFIDENCE})`;
+	for (const entry of tested) decisions.push({
+		nodeId: entry.nodeId,
+		decision: { status: ship && entry.nodeId === winner.nodeId ? "selected" : "rejected" },
+		basis: entry.estimate,
+		rule,
+		reason: ship && entry.nodeId === winner.nodeId ? reason : entry.promote ? ship ? `promoted, but finalist ${winner.nodeId} improved more on the test split` : reason : entry.why
+	});
+	decisions.push(rootDecision(root, ship ? "replaced" : rootScored ? "kept" : "unscored", rule, reason));
+	return {
+		claim: claimOf(tested.map((entry) => ({
+			nodeId: entry.nodeId,
+			estimate: entry.estimate,
+			test: entry.test,
+			promote: entry.promote
+		})), selected, ship ? "ship" : "hold", reason),
+		decisions
+	};
+}
+/** Per-finalist confidence for `k` finalists. */
+function bonferroni(k) {
+	return 1 - (1 - FAMILY_CONFIDENCE) / k;
+}
+function rootDecision(root, fate, rule, reason) {
+	return {
+		nodeId: root,
+		decision: { status: fate === "kept" ? "selected" : "rejected" },
+		basis: null,
+		rule,
+		reason: fate === "kept" ? `the search keeps the root: ${reason}` : fate === "replaced" ? `a finalist replaces the root: ${reason}` : "the root has no scored cell, so the search keeps nothing"
+	};
+}
+/** Nodes eligible to go to test, best first, at most `SEARCH_CLAIM_MAX_FINALISTS`. */
+function rankFinalists(state, selectionUnits) {
+	const sign = requireHeader(state).objective.direction === "maximize" ? 1 : -1;
+	const root = state.rootNodeId;
+	const rootMeans = new Map(state.unitScores(root, "selection").map((unit) => [unit.unitId, unit.mean]));
+	const ranked = [];
+	for (const node of state.nodes()) {
+		if (node.nodeId === root || node.status === "invalid") continue;
+		const units = state.unitScores(node.nodeId, "selection");
+		if (units.length !== selectionUnits.length) continue;
+		let gain = 0;
+		let shared = 0;
+		for (const unit of units) {
+			const rootMean = rootMeans.get(unit.unitId);
+			if (rootMean === void 0) continue;
+			gain += sign * (unit.mean - rootMean);
+			shared += 1;
+		}
+		if (shared === 0 || gain <= 0) continue;
+		ranked.push({
+			nodeId: node.nodeId,
+			selectionMean: mean$2(units.map((unit) => unit.mean)),
+			ordinal: node.ordinal
+		});
+	}
+	ranked.sort((a, b) => sign * (b.selectionMean - a.selectionMean) || a.ordinal - b.ordinal);
+	return ranked.slice(0, 3).map(({ nodeId, selectionMean }) => ({
+		nodeId,
+		selectionMean
+	}));
+}
+/**
+* The paired decision's estimator, fixed from pre-test data. A per-unit mean
+* is binary only when each unit holds one task at one repeat and every score
+* seen before the test is 0 or one positive value.
+*/
+function claimEstimator(state, reps) {
+	const header = requireHeader(state);
+	if (![
+		"train",
+		"selection",
+		"test"
+	].every((split) => {
+		const tasks = header.splits[split].tasks;
+		return unitIds(tasks).length === tasks.length;
+	}) || reps !== 1) return { kind: "continuous" };
+	let scale = null;
+	for (const nodeId of state.nodeIds()) for (const split of ["train", "selection"]) for (const cell of state.scoredCells(nodeId, split)) {
+		if (cell.score === 0) continue;
+		if (cell.score < 0 || scale !== null && cell.score !== scale) return { kind: "continuous" };
+		scale = cell.score;
+	}
+	return scale === null ? { kind: "continuous" } : {
+		kind: "binary",
+		scale
+	};
+}
+function passRate(units, estimator) {
+	if (estimator.kind !== "binary" || units.length === 0) return 0;
+	return units.filter((unit) => unit.mean === estimator.scale).length / units.length;
+}
+function claimPower(input) {
+	const { units, finalists, minimumEffect, pooledVariance, estimator } = input;
+	const confidence = bonferroni(finalists);
+	let alternative;
+	let call;
+	if (estimator.kind === "binary") {
+		const s = estimator.scale;
+		const shift = Math.min(1, minimumEffect / s);
+		const discordance = Math.min(.5, pooledVariance / (2 * s * s));
+		const loss = Math.max(0, discordance - shift / 2);
+		const win = Math.min(1 - loss, loss + shift);
+		const concordant = Math.max(0, 1 - win - loss);
+		alternative = { cells: [
+			{
+				probability: win,
+				pass: {
+					control: false,
+					treatment: true
+				},
+				delta: {
+					kind: "point",
+					value: s
+				}
+			},
+			{
+				probability: loss,
+				pass: {
+					control: true,
+					treatment: false
+				},
+				delta: {
+					kind: "point",
+					value: -s
+				}
+			},
+			{
+				probability: concordant * input.rootPassRate,
+				pass: {
+					control: true,
+					treatment: true
+				},
+				delta: {
+					kind: "point",
+					value: 0
+				}
+			},
+			{
+				probability: concordant * (1 - input.rootPassRate),
+				pass: {
+					control: false,
+					treatment: false
+				},
+				delta: {
+					kind: "point",
+					value: 0
+				}
+			}
+		] };
+		call = {
+			outcome: "pass",
+			options: {
+				binaryScale: s,
+				confidence,
+				threshold: 0
+			}
+		};
+	} else {
+		alternative = { cells: [{
+			probability: 1,
+			delta: {
+				kind: "normal",
+				mean: minimumEffect,
+				sd: Math.sqrt(pooledVariance)
+			}
+		}] };
+		call = {
+			outcome: "delta",
+			options: {
+				continuous: true,
+				confidence,
+				threshold: 0,
+				resamples: RESAMPLES
+			}
+		};
+	}
+	const simulated = pairedPromotionPower({
+		n: units,
+		alternative,
+		calls: [call],
+		simulations: POWER_SIMULATIONS,
+		seed: seedFromDigest(hashCanonical([input.seed, finalists]))
+	});
+	return {
+		adequate: simulated.power >= TARGET_POWER,
+		minimumEffect,
+		powerAtMinimumEffect: simulated.power,
+		targetPower: TARGET_POWER,
+		units,
+		finalists,
+		pooledVariance,
+		estimator
+	};
+}
+/**
+* One finalist against the root on the test split, in the objective's
+* direction, requiring every test unit scored by both.
+*/
+function pairedTest(input) {
+	const rootMeans = new Map(input.root.map((unit) => [unit.unitId, unit.mean]));
+	const before = [];
+	const after = [];
+	for (const unit of input.node) {
+		const rootMean = rootMeans.get(unit.unitId);
+		if (rootMean === void 0) continue;
+		before.push(input.maximize ? rootMean : unit.mean);
+		after.push(input.maximize ? unit.mean : rootMean);
+	}
+	const pairs = before.length;
+	if (pairs === 0) return {
+		test: null,
+		promote: false,
+		improvement: null,
+		why: "no test unit was scored by both it and the root"
+	};
+	const { estimator } = input;
+	if (estimator.kind === "binary" && [...before, ...after].some((value) => value !== 0 && value !== estimator.scale)) return {
+		test: null,
+		promote: false,
+		improvement: null,
+		why: `a test score left the two-point scale {0, ${estimator.scale}} the claim fixed before the test`
+	};
+	const decision = decidePairedPromotion(before, after, {
+		confidence: input.confidence,
+		threshold: 0,
+		minPairs: input.testUnits.length,
+		resamples: RESAMPLES,
+		seed: input.seed,
+		...estimator.kind === "binary" ? { binaryScale: estimator.scale } : { continuous: true }
+	});
+	const test = {
+		pairs,
+		confidence: input.confidence,
+		method: decision.method,
+		delta: plain(input.maximize ? decision.delta : -decision.delta),
+		interval: input.maximize ? [plain(decision.low), plain(decision.high)] : [plain(-decision.high), plain(-decision.low)]
+	};
+	const complete = pairs === input.testUnits.length;
+	const promote = decision.promote && complete;
+	const why = !complete ? `it and the root scored ${pairs} of ${input.testUnits.length} test units, and a claim needs every one` : decision.promote ? "promoted" : !decision.sufficient ? `${pairs} test units are below the ${decision.minimumPairs} its paired test needs` : decision.indeterminate ? `its test interval has no width: ${decision.indeterminateCause}` : decision.exactTestVetoes ? "McNemar's exact test vetoes the improvement" : `its improvement interval [${round(decision.low)}, ${round(decision.high)}] at confidence ${round(input.confidence)} does not exclude 0`;
+	return {
+		test,
+		promote,
+		improvement: decision.delta,
+		why
+	};
+}
+function requireHeader(state) {
+	const header = state.header;
+	if (!header) throw new Error(`search ${state.searchId} has not been opened`);
+	if (state.rootNodeId === null) throw new Error(`search ${state.searchId} has no root node`);
+	return header;
+}
+function unitIds(tasks) {
+	return [...new Set(tasks.map((task) => task.unitId))];
+}
+function mean$2(values) {
+	let total = 0;
+	for (const value of values) total += value;
+	return total / values.length;
+}
+function round(value) {
+	return Math.round(value * 1e4) / 1e4;
+}
+/** Canonical JSON has one zero; never hand it a negative one. */
+function plain(value) {
+	return value === 0 ? 0 : value;
+}
+/** The kernel every `runSearch` ledger names as its search implementation. */
+const SEARCH_KERNEL_SOURCE = {
+	uri: "npm:@tangle-network/agent-eval#runSearch",
+	revision: hashCanonical({
+		name: "tangle.search-kernel.2026-09",
+		dispatch: "claim, then rung and root, then screen, then train; first allocated first within a stage",
+		expansion: "when no cell waits, fewer than twice the lanes capacity run, and the cap admits one proposal and its expected screens",
+		reservation: {
+			hard: "the lane per-cell maximum",
+			estimate: "1.5 times the p99 of the lane settled cells once 20 settled, else the lane prior"
+		},
+		retries: "a retryable errored attempt runs again, up to maxAttempts",
+		resume: "an unrecorded operation is recorded failed at an unknown cost with floor 0; a recorded proposal is finished from its stored output; an unsettled cell is offered to adopt before it runs",
+		writers: "one kernel per ledger file on a host, by a pid lock beside the ledger",
+		divergence: "a node whose train mean over shared units rises above its parent while its descriptive or bootstrap selection interval against the parent lies wholly on the worse side is decided invalid when its cells finish",
+		claim: "with a test split: after expansion stops, the claim plan is stored on the claim operation, the finalists are decided, the root and finalist test cells run together, and the claim decides; the kernel refuses to start a claim without a selection split, a minimumEffect, a pinned judge, or (under a cap) a claim reserve for the root and 3 finalists plus a cap for one screening round",
+		close: "without a test split, the policy leader is selected when it has a scored cell; every other undecided node is rejected"
+	})
+};
+const USD_TOLERANCE = 1e-9;
+/** The operation that holds the claim's plan. */
+const CLAIM_OPERATION = "claim";
+/** Settled cells a lane needs before its own cost distribution sets its estimate. */
+const ESTIMATE_FROM_CELLS = 20;
+const ESTIMATE_MARGIN = 1.5;
+const DEFAULT_MAX_ATTEMPTS = 3;
+/** Dispatch order: claim cells first, then rungs and the root, then screens, then train. */
+const STAGE_PRIORITY = {
+	claim: 0,
+	rung: 1,
+	root: 1,
+	screen: 2,
+	train: 3,
+	external: 3
+};
+/** Run a search to its close, or continue one from its ledger. */
+async function runSearch(options) {
+	return new SearchKernel(options).run();
+}
+/** The expansion index a kernel operation id encodes, or null. */
+function searchExpansionIndex(operationId) {
+	const match = /^expand-(\d+)$/.exec(operationId);
+	return match ? Number(match[1]) : null;
+}
+var SearchKernel = class {
+	options;
+	recorder;
+	maxAttempts;
+	now;
+	state;
+	lanes = /* @__PURE__ */ new Map();
+	inFlight = /* @__PURE__ */ new Map();
+	proposal = null;
+	proposalController = null;
+	completions = [];
+	wake = null;
+	/** Unfinished cells per node. */
+	pending = /* @__PURE__ */ new Map();
+	/** Admitted nodes whose screen finished, in registration order. */
+	screened = [];
+	screenedSet = /* @__PURE__ */ new Set();
+	admitted = /* @__PURE__ */ new Set();
+	expansionOf = /* @__PURE__ */ new Map();
+	artifacts = /* @__PURE__ */ new Map();
+	/** Children a proposal returned, by artifact digest, until they are registered. */
+	proposed = /* @__PURE__ */ new Map();
+	/** Cells the ledger showed unsettled at start: an earlier process may hold their attempt. */
+	adoptable = /* @__PURE__ */ new Set();
+	operationCosts = [];
+	/** Operations started: the next one's id. */
+	expansions = 0;
+	/** Proposals that completed, by operation index. A proposal an interrupted
+	* process lost counts toward none of the stop rules, so a resumed search
+	* makes the proposals the uninterrupted one would have made. */
+	completed = [];
+	stopReason = null;
+	failure = null;
+	/** The claim's design once expansion stopped; the search then only claims. */
+	claimPlan = null;
+	constructor(options) {
+		this.options = options;
+		this.recorder = options.recorder;
+		this.maxAttempts = options.maxAttempts ?? DEFAULT_MAX_ATTEMPTS;
+		this.now = options.now ?? Date.now;
+		if (!Number.isSafeInteger(this.maxAttempts) || this.maxAttempts < 1) throw new TypeError("runSearch: maxAttempts must be a positive integer");
+		const { maxExpansions } = options;
+		if (maxExpansions !== void 0 && (!Number.isSafeInteger(maxExpansions) || maxExpansions < 0)) throw new TypeError("runSearch: maxExpansions must be a non-negative integer");
+		for (const lane of options.executor.lanes()) {
+			if (!Number.isSafeInteger(lane.capacity) || lane.capacity < 1) throw new TypeError(`runSearch: lane ${lane.name} needs a positive integer capacity`);
+			if (!Number.isFinite(lane.cellUsd) || lane.cellUsd < 0) throw new TypeError(`runSearch: lane ${lane.name} needs a finite non-negative cellUsd`);
+			if (this.lanes.has(lane.name)) throw new TypeError(`runSearch: lane ${lane.name} is declared twice`);
+			this.lanes.set(lane.name, {
+				...lane,
+				inFlight: 0,
+				queues: [
+					[],
+					[],
+					[],
+					[]
+				],
+				settledCosts: []
+			});
+		}
+		if (this.lanes.size === 0) throw new TypeError("runSearch: the executor declares no lane");
+	}
+	async run() {
+		const { ledger } = this.recorder;
+		const lock = ledger instanceof FileSearchLedger ? acquireSingleRunLock({ lockPath: `${ledger.path}.run.lock` }) : null;
+		try {
+			return await this.runLocked();
+		} finally {
+			lock?.release();
+		}
+	}
+	async runLocked() {
+		await this.refresh();
+		const header = this.state.header;
+		if (!header) throw new Error(`runSearch: search ${this.recorder.searchId} has not been opened`);
+		if (header.policy.expansion !== this.options.policy.name || header.policy.allocation !== this.options.allocation.name) throw new Error(`runSearch: search ${this.recorder.searchId} was opened with policy ${header.policy.expansion} and allocation ${header.policy.allocation}, not ${this.options.policy.name} and ${this.options.allocation.name}`);
+		if (this.state.closed) return this.closedResult();
+		await this.restore();
+		const { signal } = this.options;
+		const onAbort = () => {
+			for (const controller of this.inFlight.values()) controller.abort(signal?.reason);
+			this.proposalController?.abort(signal?.reason);
+			this.wakeUp();
+		};
+		signal?.addEventListener("abort", onAbort, { once: true });
+		try {
+			if (this.claimPlan) await this.applyClaimPlan(this.claimPlan);
+			await this.loop();
+			if (!this.failure && !this.claimPlan && this.state.header.splits.test.tasks.length > 0) {
+				await this.beginClaim();
+				await this.loop();
+			}
+		} finally {
+			signal?.removeEventListener("abort", onAbort);
+		}
+		if (this.failure) throw this.failure.error;
+		await this.close();
+		return this.closedResult();
+	}
+	async restore() {
+		const rootInput = this.options.codec.node(this.recorder, this.options.root);
+		const rootId = this.state.rootNodeId;
+		if (rootId === null) {
+			const { nodeId } = await this.recorder.registerNode(rootInput);
+			await this.recorder.recordEdge({
+				childNodeId: nodeId,
+				parents: [],
+				operator: "seed",
+				attribution: "explicit",
+				proposer: null,
+				proposalKey: "root",
+				rationale: { unknown: "the root is the caller-supplied starting artifact" },
+				diffs: [],
+				label: "root"
+			});
+			await this.refresh();
+		} else if (this.state.node(rootId).artifactDigest !== rootInput.artifactDigest) throw new Error(`runSearch: search ${this.recorder.searchId} started from another root artifact; a changed start is a derived search`);
+		const root = this.state.rootNodeId;
+		this.artifacts.set(root, this.options.root);
+		this.expansionOf.set(root, -1);
+		if (this.state.audit.cells.allocated === 0) this.assertClaimReady();
+		await this.restoreClaimPlan();
+		const recorded = [];
+		for (let expansion = 0;; expansion++) {
+			const operationId = `expand-${expansion}`;
+			const operation = this.state.operation(operationId);
+			if (!operation) break;
+			this.expansions = expansion + 1;
+			if (operation.recorded) {
+				this.operationCosts.push(operation.spentUsd);
+				recorded.push(expansion);
+				if (operation.outcome === "completed") this.completed.push(expansion);
+				continue;
+			}
+			await this.recorder.recordOperation({
+				operationId,
+				operationKind: "candidate-generation",
+				execution: this.options.proposer.execution,
+				outcome: {
+					status: "failed",
+					failure: {
+						code: "interrupted",
+						message: "the search stopped while this proposal ran; its output was lost"
+					}
+				},
+				accounting: interruptedAccounting()
+			});
+			await this.refresh();
+		}
+		for (const node of this.state.nodes()) {
+			if (node.edgeIds.length === 0) continue;
+			const edge = this.state.edge(node.edgeIds[0]);
+			const expansion = edge.proposer?.operationId ? searchExpansionIndex(edge.proposer.operationId) : null;
+			this.expansionOf.set(node.nodeId, expansion ?? -1);
+			if (node.status !== "invalid") this.admitted.add(node.nodeId);
+		}
+		for (const cell of this.state.cells()) {
+			const lane = cell.lane === null ? void 0 : this.lanes.get(cell.lane);
+			if (cell.final && lane) lane.settledCosts.push(cell.spentUsd);
+			if (this.cellDone(cell)) continue;
+			if (!lane) throw new Error(`runSearch: cell ${cell.cellId} was placed on lane ${String(cell.lane)}, which the executor does not declare`);
+			this.adoptable.add(cell.cellId);
+			this.enqueue(cell);
+			if (cell.stage !== "claim") this.pending.set(cell.nodeId, (this.pending.get(cell.nodeId) ?? 0) + 1);
+		}
+		if (this.claimPlan) return;
+		for (const expansion of recorded) await this.finishProposal(expansion);
+		for (const node of this.state.nodes()) if (this.admitted.has(node.nodeId) && !isTerminal(node)) await this.allocateFor(node.nodeId);
+		for (const nodeId of this.state.nodeIds()) if (this.admitted.has(nodeId) && (this.pending.get(nodeId) ?? 0) === 0) await this.screenDone(nodeId);
+	}
+	/**
+	* A search that will claim must be able to: finalists come from a selection
+	* split, the power check needs the claim's minimum effect, a ship needs a
+	* pinned judge, and under a cap the claim reserve must cover the root and 3
+	* finalists on every test task while the rest of the cap covers one
+	* screening round. Checked before the first cell, so a search that cannot
+	* claim spends nothing.
+	*/
+	assertClaimReady() {
+		const header = this.state.header;
+		const testTasks = header.splits.test.tasks.length;
+		if (testTasks === 0) return;
+		const refuse = (why) => {
+			throw new Error(`runSearch: search ${this.recorder.searchId} has a test split, but ${why}`);
+		};
+		if (header.splits.selection.tasks.length === 0) refuse("no selection split to choose its finalists on");
+		if (header.objective.claim.minimumEffect === void 0) refuse("its claim declares no minimumEffect for the power check");
+		if ("unknown" in header.objective.judge) refuse("its judge is not pinned; a claim with an unknown judge cannot ship, and a resumed search could mix two judges");
+		const { maxUsd, reservedClaimUsd } = header.budget;
+		if (maxUsd === null) return;
+		const cellUsd = this.maxCellReservation();
+		const need = searchClaimReserveUsd({
+			testTasks,
+			reps: this.options.allocation.reps,
+			cellUsd
+		});
+		if (reservedClaimUsd + USD_TOLERANCE < need) refuse(`its claim reserve $${reservedClaimUsd} is below the $${need} the root and 3 finalists need on ${testTasks} test tasks at $${cellUsd} a cell`);
+		const rootCells = this.options.allocation.plan(this.state, this.state.rootNodeId).length;
+		const screens = (this.options.proposer.childrenPerProposal ?? 1) * this.options.allocation.screenSize(this.state);
+		const round = this.operationReservation().usd + (rootCells + screens) * cellUsd;
+		if (maxUsd - reservedClaimUsd + USD_TOLERANCE < round) refuse(`its cap $${maxUsd} less the claim reserve $${reservedClaimUsd} does not cover the root and one screening round ($${round})`);
+	}
+	/** A claim an earlier process began: continue it from its stored plan. */
+	async restoreClaimPlan() {
+		const operation = this.state.operation(CLAIM_OPERATION);
+		if (!operation) return;
+		const ref = operation.artifacts.find((artifact) => artifact.role === "claim-plan");
+		if (!ref) throw new Error(`runSearch: the ${CLAIM_OPERATION} operation has no stored plan`);
+		const plan = this.recorder.readBlob(ref);
+		if (!operation.recorded) await this.recordClaimOperation();
+		this.claimPlan = plan;
+		this.stopReason = plan.stopReason;
+	}
+	async loop() {
+		for (;;) {
+			if (this.failure || this.options.signal?.aborted) {
+				await this.drain(this.failure?.error ?? this.options.signal?.reason);
+				this.failure ??= { error: this.options.signal?.reason ?? /* @__PURE__ */ new Error("aborted") };
+				return;
+			}
+			if (this.pastDeadline()) {
+				this.stopReason ??= "deadline";
+				if (this.queuedCount() > 0) await this.cancelQueued("deadline");
+			}
+			this.dispatch();
+			const blocked = this.stopReason === null && this.proposal === null ? await this.tryExpand() : null;
+			if (!(this.inFlight.size > 0 || this.proposal !== null)) {
+				if (this.queuedCount() > 0) continue;
+				this.stopReason ??= blocked ?? "converged";
+				return;
+			}
+			await this.handle(await this.next());
+		}
+	}
+	/** The next completion, or null when an abort woke the loop without one. */
+	async next() {
+		if (this.completions.length === 0) await new Promise((resolve) => {
+			this.wake = resolve;
+		});
+		return this.completions.shift() ?? null;
+	}
+	push(completion) {
+		this.completions.push(completion);
+		this.wakeUp();
+	}
+	wakeUp() {
+		const wake = this.wake;
+		this.wake = null;
+		wake?.();
+	}
+	async handle(completion) {
+		if (completion === null) return;
+		if (completion.kind === "cell") await this.settle(completion);
+		else await this.recordProposal(completion);
+	}
+	/** Abort everything in flight and record what still completes. */
+	async drain(reason) {
+		for (const controller of this.inFlight.values()) controller.abort(reason);
+		this.proposalController?.abort(reason);
+		while (this.inFlight.size > 0 || this.proposal !== null) await this.handle(await this.next());
+	}
+	/** Fill free lane slots with queued cells. A queued cell was admitted when
+	* it was allocated, so starting it needs no further decision. */
+	dispatch() {
+		if (this.failure || this.options.signal?.aborted) return;
+		const claimOnly = this.pastDeadline();
+		const cap = this.state.header.budget.maxConcurrency;
+		for (const lane of this.lanes.values()) while (lane.inFlight < lane.capacity && (cap === null || this.inFlight.size < cap)) {
+			const cellId = (claimOnly ? lane.queues[STAGE_PRIORITY.claim] : lane.queues.find((waiting) => waiting.length > 0))?.shift();
+			if (cellId === void 0) break;
+			this.start(cellId, lane);
+		}
+	}
+	start(cellId, lane) {
+		const cell = this.state.cell(cellId);
+		const attempt = cell.attempts + 1;
+		const controller = new AbortController();
+		const work = {
+			searchId: this.recorder.searchId,
+			cellId,
+			nodeId: cell.nodeId,
+			taskId: cell.taskId,
+			unitId: cell.unitId,
+			split: cell.split,
+			rep: cell.rep,
+			stage: cell.stage,
+			lane: lane.name,
+			attempt,
+			runId: `${cellId}:${attempt}`,
+			artifact: this.artifact(cell.nodeId),
+			signal: controller.signal
+		};
+		const adopt = this.adoptable.delete(cellId);
+		this.inFlight.set(cellId, controller);
+		lane.inFlight += 1;
+		const { executor } = this.options;
+		(async () => (adopt ? await executor.adopt(work) : null) ?? await executor.run(work))().then((result) => this.push({
+			kind: "cell",
+			cellId,
+			attempt,
+			result
+		}), (error) => this.push({
+			kind: "cell",
+			cellId,
+			attempt,
+			error
+		}));
+	}
+	async settle(completion) {
+		const { cellId, attempt } = completion;
+		this.inFlight.delete(cellId);
+		const before = this.state.cell(cellId);
+		const lane = this.lanes.get(before.lane);
+		lane.inFlight -= 1;
+		if (!completion.result) {
+			this.failure ??= { error: completion.error };
+			return;
+		}
+		this.dispatch();
+		if ((this.failure || this.options.signal?.aborted) && completion.result.outcome.status === "errored") return;
+		await this.recorder.settleCell({
+			...completion.result,
+			cellId,
+			attempt
+		});
+		await this.refresh();
+		const cell = this.state.cell(cellId);
+		if (cell.final) lane.settledCosts.push(cell.spentUsd);
+		if (!this.cellDone(cell)) {
+			if (this.failure || this.options.signal?.aborted) return;
+			this.enqueue(cell);
+			return;
+		}
+		if (cell.stage === "claim") return;
+		const left = (this.pending.get(cell.nodeId) ?? 1) - 1;
+		this.pending.set(cell.nodeId, left);
+		if (left === 0) await this.onScreenDone(cell.nodeId);
+	}
+	async onScreenDone(nodeId) {
+		if (!await this.screenDone(nodeId)) return;
+		if (this.stopReason === null && !this.failure) await this.allocateFor(nodeId);
+	}
+	/**
+	* A node's allocated cells all finished. A node that diverges (its train
+	* mean rose over its parent's while its selection interval against the
+	* parent lies wholly on the worse side) is decided `invalid` and never
+	* becomes a parent; any other node is screened. Returns whether it was.
+	*/
+	async screenDone(nodeId) {
+		if (!this.claimPlan && !this.screenedSet.has(nodeId)) {
+			const divergence = searchDivergence(this.state, nodeId);
+			if (divergence) {
+				await this.recorder.decideNode({
+					nodeId,
+					decision: { status: "invalid" },
+					basis: divergence.basis,
+					rule: "divergence",
+					reason: divergence.reason
+				});
+				await this.refresh();
+				this.admitted.delete(nodeId);
+				return false;
+			}
+		}
+		this.markScreened(nodeId);
+		return true;
+	}
+	markScreened(nodeId) {
+		if (this.screenedSet.has(nodeId)) return;
+		this.screenedSet.add(nodeId);
+		const ordinal = this.state.node(nodeId).ordinal;
+		let index = this.screened.length;
+		while (index > 0 && this.state.node(this.screened[index - 1]).ordinal > ordinal) index--;
+		this.screened = [
+			...this.screened.slice(0, index),
+			nodeId,
+			...this.screened.slice(index)
+		];
+	}
+	/** Allocate the cells the allocator plans for a node and the ledger lacks. */
+	async allocateFor(nodeId) {
+		const plans = this.options.allocation.plan(this.state, nodeId).filter((plan) => !this.state.cell(searchCellId(this.recorder.searchId, nodeId, plan.taskId, plan.split, plan.rep)));
+		if (plans.length === 0) return;
+		const placed = plans.map((plan) => {
+			const laneName = this.options.executor.place({
+				...plan,
+				nodeId
+			});
+			const lane = this.lanes.get(laneName);
+			if (!lane) throw new Error(`runSearch: the executor placed a cell on unknown lane ${laneName}`);
+			return {
+				plan,
+				lane,
+				reservation: this.cellReservation(lane)
+			};
+		});
+		const hold = placed.reduce((sum, { reservation }) => sum + reservation.usd, 0);
+		const { headroomUsd } = this.state.budget;
+		if (headroomUsd !== null && hold > headroomUsd + USD_TOLERANCE) return;
+		const { maxCells } = this.state.header.budget;
+		if (maxCells !== null && this.state.audit.cells.allocated + placed.length > maxCells) return;
+		for (const { plan, lane, reservation } of placed) await this.recorder.allocateCell({
+			nodeId,
+			taskId: plan.taskId,
+			split: plan.split,
+			rep: plan.rep,
+			stage: plan.stage,
+			lane: lane.name,
+			reservation
+		});
+		await this.refresh();
+		for (const { plan } of placed) {
+			const cellId = searchCellId(this.recorder.searchId, nodeId, plan.taskId, plan.split, plan.rep);
+			this.enqueue(this.state.cell(cellId));
+		}
+		this.pending.set(nodeId, (this.pending.get(nodeId) ?? 0) + placed.length);
+		this.dispatch();
+	}
+	enqueue(cell) {
+		this.lanes.get(cell.lane).queues[STAGE_PRIORITY[cell.stage]].push(cell.cellId);
+	}
+	queuedCount() {
+		let count = 0;
+		for (const lane of this.lanes.values()) for (const queue of lane.queues) count += queue.length;
+		return count;
+	}
+	/** Fix the claim's design, store it, and start its test cells. */
+	async beginClaim() {
+		await this.refresh();
+		const stopReason = this.stopReason ?? "converged";
+		const header = this.state.header;
+		const reps = this.options.allocation.reps;
+		const plan = planSearchClaim(this.state, {
+			stopReason,
+			reps,
+			affordable: (finalists) => {
+				const placed = this.claimCells(finalists, this.state.rootNodeId);
+				const hold = placed.reduce((sum, cell) => sum + cell.reservation.usd, 0);
+				const { headroomUsd, claimReserveUsd } = this.state.budget;
+				const { maxCells } = header.budget;
+				return (headroomUsd === null || hold <= headroomUsd + claimReserveUsd + USD_TOLERANCE) && (maxCells === null || this.state.audit.cells.allocated + placed.length <= maxCells);
+			}
+		});
+		await this.recorder.startOperation({
+			operationId: CLAIM_OPERATION,
+			operationKind: "selection",
+			reservation: null,
+			artifacts: [this.recorder.blob("claim-plan", plan)]
+		});
+		await this.recordClaimOperation();
+		this.claimPlan = plan;
+		this.stopReason = stopReason;
+		await this.applyClaimPlan(plan);
+	}
+	async recordClaimOperation() {
+		await this.recorder.recordOperation({
+			operationId: CLAIM_OPERATION,
+			operationKind: "selection",
+			execution: {
+				kind: "deterministic",
+				source: SEARCH_CLAIM_RULE
+			},
+			outcome: { status: "completed" },
+			accounting: {
+				tokens: {
+					status: "known",
+					inputTokens: 0,
+					outputTokens: 0,
+					cachedTokens: 0
+				},
+				cost: {
+					status: "known",
+					usd: 0,
+					source: "free"
+				}
+			}
+		});
+		await this.refresh();
+	}
+	/**
+	* Decide the plan's finalists and allocate the test cells of the root and
+	* the finalists, interleaved by task so the arms of one task run side by
+	* side. Allocation finishes before any claim cell starts. Idempotent.
+	*/
+	async applyClaimPlan(plan) {
+		const root = this.state.rootNodeId;
+		const bases = plan.finalists.map((finalist) => estimateNode(this.state, finalist.nodeId, {
+			against: root,
+			split: "selection"
+		}));
+		for (const [rank, finalist] of plan.finalists.entries()) await this.recorder.decideNode({
+			nodeId: finalist.nodeId,
+			decision: { status: "finalist" },
+			basis: bases[rank],
+			rule: SEARCH_CLAIM_RULE_NAME,
+			reason: `rank ${rank + 1} of ${plan.finalists.length} by selection mean (${finalist.selectionMean}); ${plan.reason}`
+		});
+		await this.refresh();
+		if (plan.test !== "run") return;
+		const missing = this.claimCells(plan.finalists.length, root, plan).map((cell) => ({
+			...cell,
+			cellId: searchCellId(this.recorder.searchId, cell.nodeId, cell.plan.taskId, "test", cell.plan.rep)
+		})).filter((cell) => !this.state.cell(cell.cellId));
+		for (const cell of missing) await this.recorder.allocateCell({
+			nodeId: cell.nodeId,
+			taskId: cell.plan.taskId,
+			split: "test",
+			rep: cell.plan.rep,
+			stage: "claim",
+			lane: cell.lane.name,
+			reservation: cell.reservation
+		});
+		await this.refresh();
+		for (const cell of missing) this.enqueue(this.state.cell(cell.cellId));
+	}
+	/** The test cells of the root and the first `finalists` of the plan (or of
+	* the finalist count being priced), task by task, with their lanes and holds. */
+	claimCells(finalists, root, plan) {
+		const header = this.state.header;
+		const arms = [root, ...plan ? plan.finalists.map((entry) => entry.nodeId) : []];
+		while (arms.length < finalists + 1) arms.push(root);
+		const cells = [];
+		for (const task of header.splits.test.tasks) for (let rep = 0; rep < this.options.allocation.reps; rep++) for (const nodeId of arms) {
+			const cellPlan = {
+				taskId: task.taskId,
+				split: "test",
+				rep,
+				stage: "claim"
+			};
+			const laneName = this.options.executor.place({
+				...cellPlan,
+				nodeId
+			});
+			const lane = this.lanes.get(laneName);
+			if (!lane) throw new Error(`runSearch: the executor placed a cell on unknown lane ${laneName}`);
+			cells.push({
+				nodeId,
+				plan: cellPlan,
+				lane,
+				reservation: this.cellReservation(lane)
+			});
+		}
+		return cells;
+	}
+	async cancelQueued(reason) {
+		for (const lane of this.lanes.values()) for (const [priority, queue] of lane.queues.entries()) {
+			if (priority === STAGE_PRIORITY.claim) continue;
+			for (const cellId of queue.splice(0)) {
+				const cell = this.state.cell(cellId);
+				if (cell.attempts === 0) {
+					await this.recorder.cancelCell({
+						cellId,
+						reason
+					});
+					await this.refresh();
+				}
+				const left = (this.pending.get(cell.nodeId) ?? 1) - 1;
+				this.pending.set(cell.nodeId, left);
+				if (left === 0) this.markScreened(cell.nodeId);
+			}
+		}
+	}
+	/** No further attempt will run: a final outcome, a cancellation, or a
+	* retryable error that used up its attempts. */
+	cellDone(cell) {
+		return cell.final || cell.cancelled !== null || cell.outcome === "errored" && cell.attempts >= this.maxAttempts;
+	}
+	/** Start a proposal when the rules admit one; otherwise say why not. */
+	async tryExpand() {
+		const { maxNodes, maxCells } = this.state.header.budget;
+		if (maxNodes !== null && this.state.audit.nodes >= maxNodes) return "max-nodes";
+		const { maxExpansions } = this.options;
+		if (maxExpansions !== void 0 && this.completed.length >= maxExpansions) return "max-nodes";
+		if (this.queuedCount() > 0) return "converged";
+		if (this.inFlight.size >= 2 * this.capacity()) return "converged";
+		const view = this.policyView();
+		const { policy } = this.options;
+		const leader = policy.leader(view);
+		if (policy.patience !== void 0 && this.completed.filter((index) => index > (this.expansionOf.get(leader) ?? -1)).length >= policy.patience) return "patience";
+		const screen = this.options.allocation.screenSize(this.state);
+		const operation = this.operationReservation();
+		const children = this.options.proposer.childrenPerProposal ?? 1;
+		const need = operation.usd + children * screen * this.maxCellReservation();
+		const { headroomUsd } = this.state.budget;
+		if (headroomUsd !== null && need > headroomUsd + USD_TOLERANCE) return "budget";
+		if (maxCells !== null && this.state.audit.cells.allocated + children * screen > maxCells) return "budget";
+		const expansion = policy.expand(view);
+		if (expansion === null) return "converged";
+		const index = this.expansions++;
+		const operationId = `expand-${index}`;
+		await this.recorder.startOperation({
+			operationId,
+			operationKind: "candidate-generation",
+			reservation: operation
+		});
+		await this.refresh();
+		const controller = new AbortController();
+		const request = {
+			expansion: index,
+			operationId,
+			operator: expansion.operator,
+			parents: expansion.parents.map((nodeId) => ({
+				nodeId,
+				artifact: this.artifact(nodeId)
+			})),
+			leader,
+			signal: controller.signal
+		};
+		this.proposalController = controller;
+		this.proposal = this.options.proposer.propose(request).then((result) => this.push({
+			kind: "proposal",
+			expansion: index,
+			operationId,
+			request,
+			selection: expansion.selection,
+			result
+		}), (error) => this.push({
+			kind: "proposal",
+			expansion: index,
+			operationId,
+			request,
+			selection: expansion.selection,
+			error
+		}));
+		return null;
+	}
+	async recordProposal(completion) {
+		this.proposal = null;
+		this.proposalController = null;
+		const { operationId, expansion } = completion;
+		const { proposer, codec, admit } = this.options;
+		const result = completion.result;
+		if (!result) {
+			await this.recorder.recordOperation({
+				operationId,
+				operationKind: "candidate-generation",
+				execution: proposer.execution,
+				outcome: {
+					status: "failed",
+					failure: {
+						code: "proposer-error",
+						message: errorMessage(completion.error)
+					}
+				},
+				accounting: interruptedAccounting()
+			});
+			await this.refresh();
+			this.failure ??= { error: completion.error };
+			return;
+		}
+		const { maxNodes } = this.state.header.budget;
+		const room = maxNodes === null ? Number.POSITIVE_INFINITY : maxNodes - this.state.audit.nodes;
+		const parents = completion.request.parents;
+		const blob = {
+			kind: "search-proposal",
+			operator: completion.request.operator,
+			parents: parents.map((parent) => parent.nodeId),
+			selection: completion.selection,
+			children: result.children.slice(0, Math.max(0, room)).map((child) => ({
+				node: codec.node(this.recorder, child.artifact),
+				diffs: parents.map((parent) => codec.diff(this.recorder, parent.artifact, child.artifact)),
+				label: redactText(child.label, { profile: "share" }),
+				rationale: redactText(child.rationale, { profile: "share" }),
+				attribution: child.attribution ?? null,
+				invalid: admit?.(child.artifact) ?? null
+			}))
+		};
+		await this.recorder.recordOperation({
+			operationId,
+			operationKind: "candidate-generation",
+			execution: result.execution ?? proposer.execution,
+			outcome: { status: "completed" },
+			accounting: result.accounting,
+			artifacts: [this.recorder.blob("proposal", blob)]
+		});
+		await this.refresh();
+		this.operationCosts.push(this.state.operation(operationId).spentUsd);
+		this.completed.push(expansion);
+		for (const [index, child] of blob.children.entries()) this.proposed.set(child.node.artifactDigest, result.children[index].artifact);
+		if (result.stop !== void 0 || blob.children.length === 0) this.stopReason ??= "converged";
+		await this.finishProposal(expansion);
+	}
+	/** Register every child a recorded proposal produced, each once. */
+	async finishProposal(expansion) {
+		const operationId = `expand-${expansion}`;
+		const operation = this.state.operation(operationId);
+		const ref = operation?.artifacts.find((artifact) => artifact.role === "proposal");
+		if (!operation?.recorded || operation.outcome !== "completed" || !ref) return;
+		const blob = this.recorder.readBlob(ref);
+		const { proposer } = this.options;
+		for (const [index, child] of blob.children.entries()) {
+			const { nodeId } = await this.recorder.registerNode(child.node);
+			const held = this.proposed.get(child.node.artifactDigest);
+			if (held !== void 0) {
+				this.proposed.delete(child.node.artifactDigest);
+				if (!this.artifacts.has(nodeId)) this.artifacts.set(nodeId, held);
+			}
+			const edgeId = await this.recorder.recordEdge({
+				childNodeId: nodeId,
+				parents: blob.parents,
+				operator: blob.operator,
+				attribution: "explicit",
+				proposer: {
+					kind: proposer.kind,
+					name: proposer.name,
+					operationId,
+					source: proposer.source
+				},
+				proposalKey: `${operationId}:${index}`,
+				selection: blob.selection,
+				rationale: child.rationale,
+				diffs: child.diffs,
+				label: child.label
+			});
+			await this.refresh();
+			if (this.state.node(nodeId).edgeIds[0] !== edgeId) continue;
+			this.expansionOf.set(nodeId, expansion);
+			if (child.invalid !== null) {
+				await this.recorder.decideNode({
+					nodeId,
+					decision: { status: "invalid" },
+					rule: "admission",
+					reason: child.invalid
+				});
+				await this.refresh();
+				continue;
+			}
+			if (this.admitted.has(nodeId)) continue;
+			this.admitted.add(nodeId);
+			await this.allocateFor(nodeId);
+			if ((this.pending.get(nodeId) ?? 0) === 0) this.markScreened(nodeId);
+		}
+	}
+	async close() {
+		await this.refresh();
+		if (this.claimPlan) {
+			await this.closeWithClaim(this.claimPlan);
+			return;
+		}
+		const view = this.policyView();
+		const leader = this.options.policy.leader(view);
+		const { split } = view;
+		const root = this.state.rootNodeId;
+		const rule = this.options.policy.name;
+		const decisions = this.state.nodes().filter((node) => !isTerminal(node)).map((node) => {
+			const scored = this.state.scoredCells(node.nodeId, split).length > 0;
+			const lead = node.nodeId === leader && scored;
+			const against = node.nodeId === leader ? root : leader;
+			const basis = node.nodeId === against || !scored ? null : estimateNode(this.state, node.nodeId, {
+				against,
+				split
+			});
+			return {
+				nodeId: node.nodeId,
+				decision: { status: lead ? "selected" : "rejected" },
+				basis,
+				rule,
+				reason: lead ? `the leader when the search stopped (${this.stopReason}): a budget decision on the ${split} split, which claims nothing` : !this.screenedSet.has(node.nodeId) || !scored ? "the search stopped before this node was measured" : !view.complete(node.nodeId) ? "it left a unit of its screen unscored, so it could not lead" : "it did not beat the leader on the units they share"
+			};
+		});
+		for (const decision of decisions) await this.recorder.decideNode(decision);
+		await this.recorder.close({
+			reason: this.stopReason ?? "converged",
+			claim: null
+		});
+		await this.refresh();
+	}
+	/** Close with the claim: the claim's decisions, then every other open node
+	* rejected with its selection estimate against the root. */
+	async closeWithClaim(plan) {
+		const { claim, decisions } = decideSearchClaim(this.state, plan);
+		const decided = new Set(decisions.map((decision) => decision.nodeId));
+		const root = this.state.rootNodeId;
+		const rest = this.state.nodes().filter((node) => !decided.has(node.nodeId) && !isTerminal(node)).map((node) => {
+			const scored = this.state.scoredCells(node.nodeId, "selection").length > 0;
+			return {
+				nodeId: node.nodeId,
+				decision: { status: "rejected" },
+				basis: scored ? estimateNode(this.state, node.nodeId, {
+					against: root,
+					split: "selection"
+				}) : null,
+				rule: SEARCH_CLAIM_RULE_NAME,
+				reason: scored ? "not a finalist: the claim tests at most 3 nodes that scored every selection unit and beat the root, best selection mean first" : "the search stopped before this node was measured on the selection split"
+			};
+		});
+		for (const decision of [...decisions, ...rest]) await this.recorder.decideNode(decision);
+		await this.recorder.close({
+			reason: plan.stopReason,
+			claim
+		});
+		await this.refresh();
+	}
+	closedResult() {
+		const state = this.state;
+		return {
+			state,
+			leader: state.audit.selectedNodeId ?? state.rootNodeId,
+			reason: state.closed.reason,
+			claim: state.closed.claim
+		};
+	}
+	policyView() {
+		return searchPolicyView(this.state, {
+			screened: this.screened,
+			screening: this.admitted.size - this.screenedSet.size,
+			expansions: this.completed.length
+		});
+	}
+	artifact(nodeId) {
+		const held = this.artifacts.get(nodeId);
+		if (held !== void 0) return held;
+		const artifact = this.options.codec.load(this.recorder, this.state.node(nodeId));
+		this.artifacts.set(nodeId, artifact);
+		return artifact;
+	}
+	capacity() {
+		let total = 0;
+		for (const lane of this.lanes.values()) total += lane.capacity;
+		const cap = this.state.header.budget.maxConcurrency;
+		return cap === null ? total : Math.min(cap, total);
+	}
+	/** A hard lane holds its enforced maximum. An estimate lane holds 1.5 times
+	* the 99th percentile of its settled cells once 20 settled, else its prior. */
+	cellReservation(lane) {
+		if (lane.costCap === "hard") return {
+			kind: "hard",
+			usd: lane.cellUsd
+		};
+		return {
+			kind: "estimate",
+			usd: estimate(lane.settledCosts, lane.cellUsd)
+		};
+	}
+	maxCellReservation() {
+		let most = 0;
+		for (const lane of this.lanes.values()) most = Math.max(most, this.cellReservation(lane).usd);
+		return most;
+	}
+	operationReservation() {
+		return {
+			kind: "estimate",
+			usd: estimate(this.operationCosts, this.options.proposer.reservationUsd ?? 0)
+		};
+	}
+	pastDeadline() {
+		const deadline = this.state.header.budget.deadline;
+		return deadline !== null && this.now() >= Date.parse(deadline);
+	}
+	async refresh() {
+		this.state = await this.recorder.state();
+	}
+};
+/**
+* A policy's read of a search: `screened` lists the admitted nodes whose screen
+* finished, in registration order; `screening` counts the admitted nodes still
+* being screened. Nodes are ranked on the selection split, or on train when
+* the search declares no selection split. The view reads no test cell.
+*/
+function searchPolicyView(state, input) {
+	const header = state.header;
+	if (!header) throw new Error(`search ${state.searchId} has not been opened`);
+	const split = header.splits.selection.tasks.length > 0 ? "selection" : "train";
+	return {
+		searchId: state.searchId,
+		seed: header.policy.seed,
+		direction: header.objective.direction,
+		split,
+		rootNodeId: state.rootNodeId,
+		expansions: input.expansions,
+		screened: [...input.screened],
+		screening: input.screening,
+		complete: (nodeId) => {
+			const cells = state.cells({ nodeId }).filter((cell) => cell.split === split);
+			return cells.length > 0 && cells.every((cell) => cell.score !== null);
+		},
+		unitScores: (nodeId) => state.unitScores(nodeId, split),
+		estimate: (nodeId, against) => estimateNode(state, nodeId, {
+			against,
+			split
+		})
+	};
+}
+/**
+* The divergence rule: a node whose train mean rose over its parent's on the
+* train units they share while its selection interval against the parent (6
+* or more units, not indeterminate) lies wholly on the worse side. Train is
+* what the proposer reads; a gain there that selection contradicts is the
+* signature of fitting the feedback instead of the task.
+*/
+function searchDivergence(state, nodeId) {
+	const header = state.header;
+	const parent = state.node(nodeId)?.primaryParentId ?? null;
+	if (!header || parent === null || header.splits.selection.tasks.length === 0) return null;
+	const selection = estimateNode(state, nodeId, {
+		against: parent,
+		split: "selection"
+	});
+	if (selection.interval === null) return null;
+	const maximize = header.objective.direction === "maximize";
+	const [low, high] = selection.interval;
+	if (maximize ? high >= 0 : low <= 0) return null;
+	const parentTrain = new Map(state.unitScores(parent, "train").map((unit) => [unit.unitId, unit.mean]));
+	let gain = 0;
+	let shared = 0;
+	for (const unit of state.unitScores(nodeId, "train")) {
+		const before = parentTrain.get(unit.unitId);
+		if (before === void 0) continue;
+		gain += maximize ? unit.mean - before : before - unit.mean;
+		shared += 1;
+	}
+	if (shared === 0 || gain <= 0) return null;
+	return {
+		basis: selection,
+		reason: `its train mean rose ${Math.round(gain / shared * 1e4) / 1e4} over its parent's on ${shared} shared train unit${shared === 1 ? "" : "s"}, while its selection interval against the parent, [${round4(low)}, ${round4(high)}] on ${selection.pairs} units, lies wholly on the worse side`
+	};
+}
+function round4(value) {
+	return Math.round(value * 1e4) / 1e4;
+}
+function isTerminal(node) {
+	return node.status !== null && node.status !== "advanced";
+}
+function estimate(costs, prior) {
+	if (costs.length < ESTIMATE_FROM_CELLS) return prior;
+	const sorted = [...costs].sort((a, b) => a - b);
+	const p99 = sorted[Math.min(sorted.length - 1, Math.ceil(.99 * sorted.length) - 1)];
+	return Math.round(ESTIMATE_MARGIN * p99 * 1e9) / 1e9;
+}
+/** Spend of work whose result was lost: unknown, with no proven floor. */
+function interruptedAccounting() {
+	return {
+		tokens: {
+			status: "unknown",
+			reason: "the result of this work was lost"
+		},
+		cost: {
+			status: "unknown",
+			knownLowerBoundUsd: 0,
+			reason: "the result of this work was lost, so its spend is unknown"
+		}
+	};
+}
+function errorMessage(error) {
+	const text = error instanceof Error ? error.message : String(error);
+	return text.trim().length > 0 ? text : "the proposer failed without a message";
 }
 //#endregion
 //#region src/campaign/search-history-receipt.ts
@@ -2842,6 +4600,20 @@ var SearchRecorder = class SearchRecorder {
 			byteLength: bytes.byteLength
 		};
 	}
+	/**
+	* Read back a blob this recorder stored, by its content address. The bytes
+	* must hash to the reference's digest and length, so a resumed search reads
+	* exactly what the ledger bound.
+	*/
+	readBlob(ref) {
+		const hex = ref.sha256.slice(7);
+		const path = join(this.blobDir, `${hex}.json`);
+		const text = this.storage.read(path);
+		if (text === void 0) throw new Error(`search ${this.searchId}: blob ${ref.sha256} (${ref.role}) is missing at ${path}`);
+		const bytes = Buffer.from(text, "utf8");
+		if (createHash("sha256").update(bytes).digest("hex") !== hex || bytes.byteLength !== ref.byteLength) throw new Error(`search ${this.searchId}: blob at ${path} does not match ${ref.sha256}`);
+		return JSON.parse(text);
+	}
 	/** Register a node, or return the existing node with the same artifact digest. */
 	async registerNode(input) {
 		const existing = (await this.ledger.state()).nodeIdForDigest(input.artifactDigest);
@@ -2904,7 +4676,7 @@ var SearchRecorder = class SearchRecorder {
 			kind: "operation-started",
 			eventId: `operation-started:${input.operationId}`,
 			occurredAt: this.stamp(),
-			artifacts: [],
+			artifacts: input.artifacts ?? [],
 			operationId: input.operationId,
 			operationKind: input.operationKind,
 			reservation: input.reservation ?? null
@@ -3047,306 +4819,874 @@ function surfaceNode(recorder, surface) {
 		surface
 	});
 	return {
-		artifactDigest: surfaceContentHash(surface),
-		artifact,
-		surfaces: declaredSurfaces(surface, artifact)
+		artifactDigest: surfaceContentHash(surface),
+		artifact,
+		surfaces: declaredSurfaces(surface, artifact)
+	};
+}
+/** A parent-to-child diff of two mutable surfaces, stored as a blob. */
+function surfaceDiff(recorder, parent, child) {
+	return recorder.blob("diff", {
+		kind: "surface-diff",
+		from: surfaceContentHash(parent),
+		to: surfaceContentHash(child),
+		text: renderSurfaceDiff(child, parent)
+	});
+}
+/** Declared surfaces of one node. A component surface declares one surface per
+* named component, so per-component evidence stays addressable. */
+function declaredSurfaces(surface, artifact) {
+	if (typeof surface === "string") return [{
+		surfaceId: "prompt",
+		kind: "prompt",
+		artifact
+	}];
+	if (surface.kind === "code") return [{
+		surfaceId: "code",
+		kind: "code",
+		artifact
+	}];
+	return Object.keys(surface.components).sort().map((name) => ({
+		surfaceId: `component:${name}`,
+		kind: "prompt",
+		artifact
+	}));
+}
+function boundedLabel(label) {
+	const redacted = redactText(label.trim(), { profile: "share" });
+	return redacted.length <= MAX_LABEL_CHARS ? redacted : `${redacted.slice(0, MAX_LABEL_CHARS - 1)}…`;
+}
+/** The header without its stamp, for comparing a resumed opening to the stored one. */
+function headerMaterial(header) {
+	const { occurredAt: _occurredAt, ...material } = header;
+	return canonicalString(material);
+}
+/** The header as the ledger would store it, so the comparison ignores ordering. */
+function canonicalHeader(header) {
+	return validateSearchLedgerEvent({
+		...header,
+		occurredAt: "2000-01-01T00:00:00.000Z"
+	});
+}
+//#endregion
+//#region src/campaign/search-policy.ts
+/**
+* Expansion policies: which node a search expands next, with which operator,
+* and which node it currently keeps.
+*
+* A policy reads a `SearchPolicyView`: nodes whose screen finished and their
+* per-unit scores on the policy's split. The view holds no test cells, so a
+* policy cannot see the sealed claim data. Its decisions spend budget and
+* claim nothing; a claim comes only from the sealed test split.
+*/
+/**
+* The hill climb. The leader starts at the root; a screened node that scored
+* every unit of its screen takes the lead when its mean on the units it shares
+* with the leader beats the leader's mean on those units. Nodes are taken in
+* registration order, so the leader is a pure function of the ledger. The
+* policy expands the leader, and only once every earlier child is screened,
+* so each proposal sees every result before it.
+*/
+function incumbent(options = {}) {
+	const { patience } = options;
+	if (patience !== void 0 && (!Number.isSafeInteger(patience) || patience < 1)) throw new TypeError(`incumbent: patience must be a positive integer, got ${String(patience)}`);
+	return hillClimb({
+		name: patience === void 0 ? "incumbent" : `incumbent(patience=${patience})`,
+		patience,
+		parent: (_view, leader) => ({
+			nodeId: leader,
+			evidence: {}
+		})
+	});
+}
+/**
+* The hill climb with a different parent: each expansion draws two distinct
+* members of the Pareto frontier (per-unit means on the policy split) with a
+* PRNG seeded from `seed` and the expansion index, and keeps the one with the
+* larger crowding distance, the more isolated. Boundary members carry infinite
+* distance. Ties fall to the higher mean, then to the earlier node. The leader
+* rule is the incumbent's: a frontier parent explores, and only a node that
+* beats the leader leads.
+*/
+function crowdedFrontierParent(options) {
+	const { seed } = options;
+	if (!Number.isInteger(seed)) throw new TypeError(`crowdedFrontierParent: seed must be an integer, got ${String(seed)}`);
+	return hillClimb({
+		name: `crowded-frontier(seed=${seed})`,
+		parent: (view, leader) => {
+			const frontier = paretoMembers(view);
+			if (frontier.length <= 1) return {
+				nodeId: frontier[0]?.nodeId ?? leader,
+				evidence: {}
+			};
+			const rng = mulberry32(seed ^ Math.imul(view.expansions + 1, 2654435761) | 0);
+			const first = Math.floor(rng() * frontier.length);
+			const offset = Math.floor(rng() * (frontier.length - 1));
+			const second = offset >= first ? offset + 1 : offset;
+			const a = frontier[first];
+			const b = frontier[second];
+			const winner = compareCrowded(a, b) <= 0 ? a : b;
+			return {
+				nodeId: winner.nodeId,
+				evidence: {
+					frontierSize: frontier.length,
+					crowding: Number.isFinite(winner.distance) ? winner.distance : -1
+				}
+			};
+		}
+	});
+}
+function hillClimb(spec) {
+	const leader = (view) => {
+		let current = view.rootNodeId;
+		for (const nodeId of view.screened) {
+			if (nodeId === current || !view.complete(nodeId)) continue;
+			if (beats(view, nodeId, current)) current = nodeId;
+		}
+		return current;
+	};
+	return {
+		name: spec.name,
+		...spec.patience === void 0 ? {} : { patience: spec.patience },
+		leader,
+		expand(view) {
+			if (view.screening > 0) return null;
+			const kept = leader(view);
+			const chosen = spec.parent(view, kept);
+			const units = view.unitScores(chosen.nodeId);
+			return {
+				parents: [chosen.nodeId],
+				operator: "improve",
+				selection: {
+					rule: spec.name,
+					evidence: {
+						...chosen.evidence,
+						units: units.length,
+						...units.length > 0 ? { mean: mean$1(units.map((unit) => unit.mean)) } : {},
+						isLeader: chosen.nodeId === kept ? 1 : 0
+					}
+				}
+			};
+		}
+	};
+}
+/** True when `challenger` improves on `holder` over the units both scored. */
+function beats(view, challenger, holder) {
+	const held = new Map(view.unitScores(holder).map((unit) => [unit.unitId, unit.mean]));
+	let challengerSum = 0;
+	let holderSum = 0;
+	let shared = 0;
+	for (const unit of view.unitScores(challenger)) {
+		const other = held.get(unit.unitId);
+		if (other === void 0) continue;
+		challengerSum += unit.mean;
+		holderSum += other;
+		shared += 1;
+	}
+	if (shared === 0) return false;
+	return view.direction === "maximize" ? challengerSum > holderSum : challengerSum < holderSum;
+}
+/** Non-dominated complete screened nodes over the root's units, with crowding. */
+function paretoMembers(view) {
+	const units = view.unitScores(view.rootNodeId).map((unit) => unit.unitId);
+	const sign = view.direction === "maximize" ? 1 : -1;
+	const members = [];
+	view.screened.forEach((nodeId, ordinal) => {
+		if (!view.complete(nodeId)) return;
+		const objectives = new Map(view.unitScores(nodeId).map((unit) => [unit.unitId, unit.mean]));
+		if (units.some((unit) => !objectives.has(unit))) return;
+		members.push({
+			nodeId,
+			ordinal,
+			mean: sign * mean$1([...objectives.values()]),
+			objectives,
+			distance: 0
+		});
+	});
+	if (members.length === 0 || units.length === 0) return members;
+	return paretoFrontierWithCrowding(members, units.map((unit) => ({
+		name: unit,
+		direction: view.direction,
+		value: (member) => member.objectives.get(unit)
+	}))).map(({ candidate, distance }) => ({
+		...candidate,
+		distance
+	}));
+}
+/** Negative when `a` wins the tournament. */
+function compareCrowded(a, b) {
+	if (a.distance !== b.distance) return a.distance > b.distance ? -1 : 1;
+	if (a.mean !== b.mean) return a.mean > b.mean ? -1 : 1;
+	return a.ordinal - b.ordinal;
+}
+function mean$1(values) {
+	let total = 0;
+	for (const value of values) total += value;
+	return total / values.length;
+}
+//#endregion
+//#region src/campaign/types.ts
+/** Type guard: a proposal carrying its rationale vs a bare
+*  surface. The loop branches on this to populate `GenerationCandidate`. */
+function isProposedCandidate(value) {
+	return typeof value === "object" && value !== null && "surface" in value && "label" in value && "rationale" in value;
+}
+const LABEL_TRUST_RANK = {
+	unverified: 0,
+	"verified-signal": 1,
+	"human-rated": 2
+};
+/** Ordinal rank for a label-trust tier; absent ⇒ `unverified` (rank 0). */
+function labelTrustRank(trust) {
+	return LABEL_TRUST_RANK[trust ?? "unverified"];
+}
+//#endregion
+//#region src/campaign/presets/run-optimization.ts
+/**
+* `runOptimization` improves a mutable surface with a caller-owned proposer,
+* as a search on the one kernel (`runSearch`).
+*
+* The baseline is the seeded root. The scenarios are the train split: the
+* proposer reads their scores, and the policy ranks on them because the loop
+* has no private selection split. A "generation" is one proposal of
+* `populationSize` candidates from the node the policy chose (by default the
+* incumbent, once every earlier candidate is measured). Every candidate is a
+* node measured on every scenario at every repeat, one cell at a time on the
+* run's lanes. The kept surface is the policy's leader: a budget decision on
+* the train split that claims nothing; `runImprovementLoop` compares it with
+* the baseline on separate cases.
+*
+* The search ledger is always written, beside the run (`<runDir>/search/`) or
+* where `searchLedger` puts it, and it is the run's only checkpoint: running
+* again on the same run directory and options continues an interrupted run
+* instead of starting over, and reruns nothing that settled.
+*/
+/** Improve a surface as a search on the kernel; see the module comment. */
+async function runOptimization(opts) {
+	const candidateConcurrency = opts.candidateConcurrency ?? 1;
+	if (typeof opts.runDir !== "string" || opts.runDir.trim().length === 0) throw new Error("runOptimization: runDir is required and must be a non-empty string");
+	if (!Number.isInteger(candidateConcurrency) || candidateConcurrency < 1) throw new Error("runOptimization: candidateConcurrency must be a positive integer");
+	for (const [name, value] of [["populationSize", opts.populationSize], ["maxGenerations", opts.maxGenerations]]) if (!Number.isSafeInteger(value) || value < 0) throw new Error(`runOptimization: ${name} must be a non-negative integer`);
+	const initialFindings = immutableProposalSnapshot(assertProposalFindings(opts.findings ?? [], "runOptimization initial proposal findings"), "initial findings");
+	const baselineSurface = immutableProposalSnapshot(opts.baselineSurface, "baseline surface");
+	const runDir = resolveRunDir(opts.runDir, opts.repo);
+	const storage = opts.storage ?? fsCampaignStorage();
+	const costLedger = opts.costLedger ?? createRunCostLedger({
+		storage,
+		runDir,
+		costCeilingUsd: opts.costCeiling
+	});
+	const reps = opts.reps ?? 1;
+	const seed = opts.seed ?? 42;
+	const requireJudgeScore = (opts.judges?.length ?? 0) > 0;
+	const premeasured = opts.premeasuredBaseline ? validatedPremeasuredBaseline({
+		input: opts.premeasuredBaseline,
+		baselineSurface,
+		scenarios: opts.scenarios,
+		reps,
+		seed,
+		judges: opts.judges ?? [],
+		dispatchRef: surfaceDispatchRef(baselineSurface, opts.dispatchRef),
+		requireJudgeScore
+	}) : void 0;
+	const splitDigest = campaignSplitDigest(opts.scenarios, reps);
+	const binding = opts.searchLedger ?? await defaultBinding(opts, runDir, storage);
+	const { identity } = binding;
+	const execution = {
+		model: identity.model,
+		agent: identity.agent,
+		benchmark: {
+			uri: "campaign://scenarios",
+			revision: splitDigest
+		}
+	};
+	const policy = opts.policy ?? incumbent();
+	const allocation = uniform({ reps });
+	const recorder = await SearchRecorder.open({
+		ledger: binding.ledger,
+		storage
+	}, {
+		subject: identity.subject ?? opts.proposer.kind,
+		process: {
+			name: "runOptimization",
+			executionRef: identity.search
+		},
+		artifactKind: artifactKindOf(baselineSurface),
+		objective: {
+			metric: "composite",
+			direction: "maximize",
+			judge: identity.judge ?? { unknown: "runOptimization receives its judges as functions without a pinned source" },
+			claim: identity.claim ?? developmentClaim(splitDigest)
+		},
+		splits: {
+			train: opts.scenarios.map((scenario) => ({
+				taskId: scenario.id,
+				unitId: scenario.id,
+				source: {
+					uri: `scenario://${scenario.id}`,
+					revision: hashCanonical(scenario)
+				}
+			})),
+			selection: [],
+			test: [],
+			heldOutUnits: true
+		},
+		policy: {
+			expansion: policy.name,
+			allocation: allocation.name,
+			seed
+		},
+		budget: {
+			maxUsd: opts.costCeiling ?? null,
+			maxCells: null,
+			maxNodes: 1 + opts.populationSize * opts.maxGenerations,
+			deadline: null,
+			maxConcurrency: null,
+			reservedClaimUsd: 0
+		},
+		containment: null,
+		derivedFrom: null,
+		identity: execution
+	});
+	const nodes = new SurfaceNodes({
+		opts,
+		recorder,
+		runDir,
+		costLedger,
+		execution,
+		premeasured
+	});
+	const scenarioById = new Map(opts.scenarios.map((scenario) => [scenario.id, scenario]));
+	let findings = initialFindings;
+	const executor = {
+		lanes: () => [{
+			name: "campaign",
+			capacity: candidateConcurrency * (opts.maxConcurrency ?? 2),
+			costCap: "estimate",
+			cellUsd: 0
+		}],
+		place: () => "campaign",
+		run: (work) => nodes.runCell(work, scenarioById),
+		adopt: (work) => nodes.adoptCell(work)
+	};
+	const proposer = opts.proposer;
+	const proposerSource = identity.proposer.source;
+	const port = {
+		name: proposer.kind,
+		kind: "optimizer",
+		source: proposerSource,
+		execution: identity.proposer,
+		childrenPerProposal: opts.populationSize,
+		async propose(request) {
+			const phases = [
+				"search.proposal",
+				"analysis.baseline",
+				"analysis.generation"
+			];
+			const before = new Set(phases.flatMap((phase) => costLedger.list({ phase })).map(receiptKey));
+			const accounting = () => {
+				const fresh = phases.flatMap((phase) => costLedger.list({ phase })).filter((receipt) => !before.has(receiptKey(receipt)));
+				return {
+					accounting: receiptAccounting(fresh),
+					execution: opts.searchLedger ? identity.proposer : proposalExecution(fresh, identity.model.provider, proposerSource)
+				};
+			};
+			const earlier = await recorder.state();
+			const root = earlier.rootNodeId;
+			const rootCampaign = nodes.campaign(earlier, root);
+			const rootCoverage = campaignCoverage(rootCampaign.cells, opts.scenarios, reps, requireJudgeScore);
+			if (!rootCoverage.complete) throw new Error(`runOptimization: ${premeasured ? "premeasured baseline" : "baseline"} is incomplete (${rootCoverage.scorableCellIds.length}/${rootCoverage.expectedCellIds.length} designed cells scorable) — ${formatCoverageFailures(rootCoverage)}. Refusing to optimize against an incomplete incumbent.`);
+			const generation = nodes.generations(earlier).length;
+			if (opts.analyzeGeneration) {
+				const previous = generation - 1;
+				const candidates = (previous < 0 ? [root] : nodes.expansionNodes(earlier, nodes.generations(earlier)[previous])).map((nodeId) => {
+					const campaign = nodes.campaign(earlier, nodeId);
+					return {
+						surfaceHash: surfaceHash(nodes.surface(earlier, nodeId)),
+						campaign,
+						composite: campaignMeanCompositeOrNull(campaign)
+					};
+				});
+				const history = nodes.history(earlier, policy);
+				if (candidates.some(({ campaign }) => campaign.cells.length > 0)) {
+					const fresh = await opts.analyzeGeneration({
+						generation: previous,
+						runDir: previous < 0 ? rootCampaign.runDir : `${runDir}/candidates`,
+						candidates,
+						history,
+						costLedger,
+						costPhase: previous < 0 ? "analysis.baseline" : "analysis.generation"
+					});
+					if (!Array.isArray(fresh)) throw new TypeError("runOptimization: analyzeGeneration must return an array");
+					findings = immutableProposalSnapshot(assertProposalFindings(fresh, "runOptimization analysis findings"), "analysis findings");
+				}
+			}
+			const state = await recorder.state();
+			const proposalHistory = immutableProposalSnapshot(nodes.history(state, policy), "history");
+			const parent = request.parents[0];
+			const context = Object.freeze({
+				currentSurface: immutableProposalSnapshot(parent.artifact, "current surface"),
+				operator: request.operator,
+				parents: immutableProposalSnapshot(request.parents.map(({ nodeId, artifact }) => ({
+					nodeId,
+					artifact: immutableProposalSnapshot(artifact, "parent surface")
+				})), "parents"),
+				train: searchProposerView(state),
+				summary: renderSearchSummary(state, { split: "train" }),
+				history: proposalHistory,
+				findings: immutableProposalSnapshot(assertProposalFindings(findings, "runOptimization proposal findings"), "findings"),
+				populationSize: opts.populationSize,
+				generation,
+				signal: request.signal,
+				baselineOutcome: immutableProposalSnapshot(nodes.outcome(state, root), "baseline"),
+				incumbentOutcome: immutableProposalSnapshot(nodes.outcome(state, request.leader), "incumbent outcome"),
+				parentOutcome: immutableProposalSnapshot(nodes.outcome(state, parent.nodeId), "parent outcome"),
+				maxImprovementShots: opts.maxImprovementShots,
+				paretoParents: immutableProposalSnapshot(nodes.frontier(state), "Pareto parents"),
+				costLedger,
+				costPhase: "search.proposal"
+			});
+			if (proposer.decide?.({ history: proposalHistory }).stop) return {
+				children: [],
+				stop: "the proposer decided to stop",
+				...accounting()
+			};
+			const proposed = await proposer.propose(context);
+			if (!Array.isArray(proposed)) throw new TypeError("runOptimization: proposer must return an array");
+			return {
+				children: immutableProposalSnapshot(proposed, "candidate outputs").slice(0, opts.populationSize).map((candidate) => isProposedCandidate(candidate) ? {
+					artifact: candidate.surface,
+					label: candidate.label,
+					rationale: candidate.rationale,
+					...candidate.attribution ? { attribution: candidate.attribution } : {}
+				} : {
+					artifact: candidate,
+					label: "",
+					rationale: ""
+				}),
+				...accounting()
+			};
+		}
+	};
+	const result = await runSearch({
+		recorder,
+		root: baselineSurface,
+		codec: surfaceCodec,
+		policy,
+		allocation,
+		proposer: port,
+		executor,
+		maxExpansions: opts.maxGenerations,
+		signal: opts.signal
+	});
+	const state = result.state;
+	const winnerSurface = nodes.surface(state, result.leader);
+	const firstEdge = state.edge(state.node(result.leader).edgeIds[0]);
+	const winnerRationale = firstEdge.operator === "seed" || !("sha256" in firstEdge.rationale) ? void 0 : recorder.readBlob(firstEdge.rationale).text;
+	const expansions = nodes.generations(state);
+	return {
+		generations: nodes.history(state, policy).map((record) => ({
+			record,
+			surfaces: nodes.expansionNodes(state, expansions[record.generationIndex]).map((nodeId) => {
+				const surface = nodes.surface(state, nodeId);
+				return {
+					surfaceHash: surfaceHash(surface),
+					surface,
+					campaign: nodes.campaign(state, nodeId)
+				};
+			})
+		})),
+		baselineSurface,
+		winnerSurface,
+		winnerSurfaceHash: surfaceHash(winnerSurface),
+		...firstEdge.operator !== "seed" && firstEdge.label ? { winnerLabel: firstEdge.label } : {},
+		...winnerRationale ? { winnerRationale } : {},
+		baselineCampaign: nodes.campaign(state, state.rootNodeId),
+		cost: costLedger.summary(),
+		searchHistory: recorder.receipt({
+			producerId: proposer.kind,
+			runId: runDir
+		}),
+		paretoFrontier: nodes.frontier(state)
 	};
 }
-/** A parent-to-child diff of two mutable surfaces, stored as a blob. */
-function surfaceDiff(recorder, parent, child) {
-	return recorder.blob("diff", {
-		kind: "surface-diff",
-		from: surfaceContentHash(parent),
-		to: surfaceContentHash(child),
-		text: renderSurfaceDiff(child, parent)
-	});
-}
-/** Declared surfaces of one node. A component surface declares one surface per
-* named component, so per-component evidence stays addressable. */
-function declaredSurfaces(surface, artifact) {
-	if (typeof surface === "string") return [{
-		surfaceId: "prompt",
-		kind: "prompt",
-		artifact
-	}];
-	if (surface.kind === "code") return [{
-		surfaceId: "code",
-		kind: "code",
-		artifact
-	}];
-	return Object.keys(surface.components).sort().map((name) => ({
-		surfaceId: `component:${name}`,
-		kind: "prompt",
-		artifact
-	}));
-}
-function boundedLabel(label) {
-	const redacted = redactText(label.trim(), { profile: "share" });
-	return redacted.length <= MAX_LABEL_CHARS ? redacted : `${redacted.slice(0, MAX_LABEL_CHARS - 1)}…`;
-}
-/** The header without its stamp, for comparing a resumed opening to the stored one. */
-function headerMaterial(header) {
-	const { occurredAt: _occurredAt, ...material } = header;
-	return canonicalString(material);
-}
-/** The header as the ledger would store it, so the comparison ignores ordering. */
-function canonicalHeader(header) {
-	return validateSearchLedgerEvent({
-		...header,
-		occurredAt: "2000-01-01T00:00:00.000Z"
-	});
-}
-//#endregion
-//#region src/campaign/presets/run-optimization-recording.ts
-var OptimizationSearch = class OptimizationSearch {
+/** A mutable surface as a search artifact. */
+const surfaceCodec = {
+	node: surfaceNode,
+	diff: surfaceDiff,
+	load: (recorder, node) => {
+		const stored = recorder.readBlob(node.artifact);
+		if (stored.kind !== "mutable-surface" || stored.surface === void 0) throw new Error(`runOptimization: node ${node.nodeId} does not hold a mutable surface`);
+		return stored.surface;
+	}
+};
+/**
+* The run's view of its surface nodes: where each one's cells run, its
+* campaign, and the proposer's reads over them. Everything here derives from
+* the ledger and the per-cell campaign cache, so a resumed run reads the same.
+*/
+var SurfaceNodes = class {
+	opts;
 	recorder;
-	binding;
+	runDir;
 	costLedger;
-	scenarioIds;
-	reps;
-	identity;
-	proposerName;
-	proposalReceiptCount = 0;
-	constructor(args) {
-		this.recorder = args.recorder;
-		this.binding = args.binding;
-		this.costLedger = args.costLedger;
-		this.scenarioIds = args.scenarioIds;
-		this.reps = args.reps;
-		this.identity = args.identity;
-		this.proposerName = args.proposerName;
-	}
-	/** Open the search and record the measured baseline as its seeded root. */
-	static async open(args) {
-		const { binding } = args;
-		const identity = {
-			model: binding.identity.model,
-			agent: binding.identity.agent,
-			benchmark: {
-				uri: "campaign://scenarios",
-				revision: args.splitDigest
-			}
-		};
-		const train = args.scenarios.map((scenario) => ({
-			taskId: scenario.id,
-			unitId: scenario.id,
-			source: {
-				uri: `scenario://${scenario.id}`,
-				revision: hashCanonical(scenario)
-			}
+	execution;
+	premeasured;
+	storage;
+	campaigns = /* @__PURE__ */ new Map();
+	proposals = /* @__PURE__ */ new Map();
+	/** Cells this process ran or adopted, by node, keyed `scenarioId:rep`. */
+	cells = /* @__PURE__ */ new Map();
+	constructor(input) {
+		this.opts = input.opts;
+		this.recorder = input.recorder;
+		this.runDir = input.runDir;
+		this.costLedger = input.costLedger;
+		this.execution = input.execution;
+		this.premeasured = input.premeasured;
+		this.storage = input.opts.storage ?? fsCampaignStorage();
+	}
+	/** `<runDir>/baseline` for the root, `<runDir>/candidates/<surfaceHash>`
+	* for every other node: content-addressed, so a cell's directory needs no
+	* ledger read and one surface keeps one cache across the run's searches. */
+	nodeDir(surface, root) {
+		return root ? `${this.runDir}/baseline` : `${this.runDir}/candidates/${surfaceHash(surface)}`;
+	}
+	surface(state, nodeId) {
+		return surfaceCodec.load(this.recorder, state.node(nodeId));
+	}
+	/** Nodes proposal `expansion` registered, in the order it returned them. */
+	expansionNodes(state, expansion) {
+		const blob = this.proposal(state, expansion);
+		if (!blob) return [];
+		const ids = [];
+		for (const child of blob.children) {
+			const nodeId = state.nodeIdForDigest(child.node.artifactDigest);
+			if (nodeId === void 0 || ids.includes(nodeId)) continue;
+			if (this.origin(state, nodeId).expansion === expansion) ids.push(nodeId);
+		}
+		return ids;
+	}
+	/**
+	* The scored attempt of a cell an earlier process ran, from its node's
+	* cache; null otherwise, so the kernel runs the cell. A failure is not
+	* adopted: the stop that interrupted the earlier process may have caused it.
+	*/
+	async adoptCell(work) {
+		if (work.stage === "root" && this.premeasured) return this.premeasuredCell(work);
+		const dir = this.nodeDir(work.artifact, work.stage === "root");
+		const cached = this.storage.read(cellCachePath(dir, `${work.taskId}:${work.rep}`));
+		const cell = cached === void 0 ? void 0 : JSON.parse(cached);
+		if (cell?.manifestHash !== this.manifestFor(work.artifact)) return null;
+		this.remember(work.nodeId, cell);
+		return this.cellResult(cell, work);
+	}
+	/** Run one cell as a one-cell campaign in its node's directory; a cached
+	* cell is read back, not dispatched again. */
+	async runCell(work, scenarios) {
+		if (work.stage === "root" && this.premeasured) return this.premeasuredCell(work);
+		if (!scenarios.has(work.taskId)) throw new Error(`runOptimization: cell ${work.cellId} names unknown scenario ${work.taskId}`);
+		const dir = this.nodeDir(work.artifact, work.stage === "root");
+		const cell = (await this.campaignRun(dir, work.artifact, {
+			signal: work.signal,
+			costPhase: work.stage === "root" ? "search.baseline" : "search.candidate",
+			cellFilter: ({ scenario, rep }) => scenario.id === work.taskId && rep === work.rep
+		})).cells[0];
+		if (!cell) throw new Error(`runOptimization: cell ${work.cellId} produced no campaign cell`);
+		this.remember(work.nodeId, cell);
+		return this.cellResult(cell, work);
+	}
+	/** The node's campaign over the cells the ledger settled: the cells this
+	* process ran, else their cached results or failure receipts. */
+	campaign(state, nodeId) {
+		const root = nodeId === state.rootNodeId;
+		if (root && this.premeasured) return this.premeasured;
+		const surface = this.surface(state, nodeId);
+		const dir = this.nodeDir(surface, root);
+		const settled = state.cells({ nodeId }).filter((cell) => cell.attempts > 0).map((cell) => ({
+			taskId: cell.taskId,
+			rep: cell.rep
 		}));
-		const recorder = await SearchRecorder.open({
-			ledger: binding.ledger,
-			storage: args.storage
-		}, {
-			subject: binding.identity.subject ?? args.proposerName,
-			process: {
-				name: "runOptimization",
-				executionRef: binding.identity.search
-			},
-			artifactKind: "prompt",
-			objective: {
-				metric: "composite",
-				direction: "maximize",
-				judge: binding.identity.judge ?? { unknown: "runOptimization receives its judges as functions without a pinned source" },
-				claim: binding.identity.claim ?? developmentClaim(args.splitDigest)
-			},
-			splits: {
-				train,
-				selection: [],
-				test: [],
-				heldOutUnits: true
-			},
-			policy: {
-				expansion: args.expansion,
-				allocation: "uniform",
-				seed: args.seed
-			},
-			budget: {
-				maxUsd: args.maxUsd,
-				maxCells: null,
-				maxNodes: null,
-				deadline: null,
-				maxConcurrency: null,
-				reservedClaimUsd: 0
-			},
-			containment: null,
-			derivedFrom: null,
-			identity
-		});
-		const search = new OptimizationSearch({
-			recorder,
-			binding,
-			costLedger: args.costLedger,
-			scenarioIds: args.scenarios.map((scenario) => scenario.id),
-			reps: args.reps,
-			identity,
-			proposerName: args.proposerName
+		const key = settled.map(({ taskId, rep }) => `${taskId}:${rep}`).sort().join("\n");
+		const held = this.campaigns.get(nodeId);
+		if (held?.cells === key) return held.campaign;
+		const known = this.cells.get(nodeId);
+		const cells = settled.map(({ taskId, rep }) => {
+			const cell = known?.get(`${taskId}:${rep}`) ?? this.storedCell(dir, surface, taskId, rep);
+			if (!cell) throw new Error(`runOptimization: cell ${taskId}:${rep} of node ${nodeId} settled, but ${dir} holds neither its cached result nor its failure receipt`);
+			return cell;
 		});
-		const root = await recorder.registerNode(surfaceNode(recorder, args.baselineSurface));
-		await recorder.recordEdge({
-			childNodeId: root.nodeId,
-			parents: [],
-			operator: "seed",
-			attribution: "explicit",
-			proposer: null,
-			proposalKey: "baseline",
-			rationale: { unknown: "the baseline is the caller-supplied starting surface" },
-			diffs: [],
-			label: "baseline"
-		});
-		await search.recordCells(root.nodeId, "root", args.baselineCells);
-		return {
-			search,
-			rootNodeId: root.nodeId
+		cells.sort((a, b) => a.cellId < b.cellId ? -1 : a.cellId > b.cellId ? 1 : 0);
+		const reps = this.opts.reps ?? 1;
+		const seed = this.opts.seed ?? 42;
+		const judges = this.opts.judges ?? [];
+		const now = (/* @__PURE__ */ new Date()).toISOString();
+		const durationMs = cells.reduce((sum, cell) => sum + cell.durationMs, 0);
+		const campaign = {
+			manifestHash: this.manifestFor(surface),
+			splitDigest: campaignSplitDigest(this.opts.scenarios, reps),
+			seed,
+			reps,
+			startedAt: now,
+			endedAt: now,
+			durationMs,
+			cells,
+			aggregates: computeAggregates(cells, judges, seed, this.costLedger.summary({ tags: { runDir: dir } })),
+			runDir: dir,
+			artifactsByPath: {},
+			scenarios: this.opts.scenarios.map(campaignScenarioIdentity)
 		};
-	}
-	/** Start one generation's candidate-generation operation, before `propose()`. */
-	async startGeneration(generation) {
-		await this.recorder.startOperation({
-			operationId: generationOperationId(generation),
-			operationKind: "candidate-generation"
-		});
-	}
-	/** Record the generation's proposal: its operation, then one node and edge per candidate. */
-	async recordProposal(input) {
-		const operationId = generationOperationId(input.generation);
-		await this.recorder.recordOperation({
-			operationId,
-			operationKind: "candidate-generation",
-			execution: this.binding.identity.proposer,
-			outcome: { status: "completed" },
-			accounting: this.proposalAccounting()
+		this.campaigns.set(nodeId, {
+			cells: key,
+			campaign
 		});
-		const nodeIds = [];
-		for (const [index, candidate] of input.candidates.entries()) {
-			const { nodeId } = await this.recorder.registerNode(surfaceNode(this.recorder, candidate.surface));
-			await this.recorder.recordEdge({
-				childNodeId: nodeId,
-				parents: [input.parent.nodeId],
-				operator: "improve",
-				attribution: "explicit",
-				proposer: {
-					kind: "optimizer",
-					name: this.proposerName,
-					operationId,
-					source: this.binding.identity.proposer.source
-				},
-				proposalKey: `gen-${input.generation}:candidate-${index}`,
-				selection: {
-					rule: input.selectionRule,
-					evidence: input.parent.composite === null ? {} : { parentComposite: input.parent.composite }
-				},
-				rationale: candidate.rationale,
-				diffs: [surfaceDiff(this.recorder, input.parent.surface, candidate.surface)],
-				label: candidate.label
+		return campaign;
+	}
+	outcome(state, nodeId) {
+		const campaign = this.campaign(state, nodeId);
+		const reps = this.opts.reps ?? 1;
+		const coverage = campaignCoverage(campaign.cells, this.opts.scenarios, reps, (this.opts.judges?.length ?? 0) > 0);
+		const expansion = nodeId === state.rootNodeId ? -1 : this.generationOf(state, this.origin(state, nodeId).expansion);
+		return toScoredSurfaceOutcome(surfaceHash(this.surface(state, nodeId)), campaign, coverage, expansion);
+	}
+	/** The Pareto frontier over every measured, complete node. */
+	frontier(state) {
+		const scored = [];
+		for (const node of state.nodes()) {
+			if (node.status === "invalid" || node.cellCount === 0) continue;
+			const cells = state.cells({ nodeId: node.nodeId });
+			if (cells.some((cell) => cell.attempts === 0 && cell.cancelled === null)) continue;
+			if (cells.some((cell) => cell.score === null)) continue;
+			const campaign = this.campaign(state, node.nodeId);
+			const edge = state.edge(node.edgeIds[0]);
+			scored.push(toParetoParent(this.surface(state, node.nodeId), campaign, node.nodeId === state.rootNodeId ? -1 : this.generationOf(state, this.origin(state, node.nodeId).expansion), edge.operator === "seed" ? void 0 : edge.label || void 0));
+		}
+		return computeParetoFrontier(scored);
+	}
+	/** Kernel expansions that registered a candidate, in order: generation g
+	* is `generations(state)[g]`. */
+	generations(state) {
+		const expansions = [];
+		for (let expansion = 0; state.operation(`expand-${expansion}`); expansion++) if (this.expansionNodes(state, expansion).length > 0) expansions.push(expansion);
+		return expansions;
+	}
+	/** One record per generation, with its candidates and the one that took
+	* the lead, if any. */
+	history(state, policy) {
+		const records = [];
+		const measured = (nodeId) => state.node(nodeId).status !== "invalid" && state.cells({ nodeId }).every((cell) => cell.attempts > 0 || cell.cancelled !== null);
+		const screened = [state.rootNodeId];
+		let leader = policy.leader(searchPolicyView(state, {
+			screened,
+			screening: 0,
+			expansions: 0
+		}));
+		for (const [generation, expansion] of this.generations(state).entries()) {
+			const nodeIds = this.expansionNodes(state, expansion);
+			screened.push(...nodeIds.filter(measured));
+			screened.sort((a, b) => state.node(a).ordinal - state.node(b).ordinal);
+			const next = policy.leader(searchPolicyView(state, {
+				screened,
+				screening: 0,
+				expansions: expansion + 1
+			}));
+			const candidates = [];
+			for (const nodeId of nodeIds) candidates.push(this.candidate(state, nodeId, expansion));
+			records.push({
+				generationIndex: generation,
+				candidates,
+				promoted: next !== leader && nodeIds.includes(next) ? [surfaceHash(this.surface(state, next))] : []
 			});
-			nodeIds.push(nodeId);
+			leader = next;
 		}
-		return nodeIds;
+		return records;
 	}
-	/** Close a generation whose proposer produced nothing or failed. */
-	async failGeneration(generation, message) {
-		await this.recorder.recordOperation({
-			operationId: generationOperationId(generation),
-			operationKind: "candidate-generation",
-			execution: this.binding.identity.proposer,
-			outcome: {
-				status: "failed",
-				failure: {
-					code: "no-candidates",
-					message
-				}
+	candidate(state, nodeId, expansion) {
+		const campaign = this.campaign(state, nodeId);
+		const coverage = campaignCoverage(campaign.cells, this.opts.scenarios, this.opts.reps ?? 1, (this.opts.judges?.length ?? 0) > 0);
+		const breakdown = campaignBreakdown(campaign);
+		const child = this.proposal(state, expansion).children.find((entry) => state.nodeIdForDigest(entry.node.artifactDigest) === nodeId);
+		return {
+			surfaceHash: surfaceHash(this.surface(state, nodeId)),
+			composite: campaignMeanCompositeOrNull(campaign),
+			eligibleForPromotion: coverage.complete,
+			coverage: {
+				expectedCells: coverage.expectedCellIds.length,
+				scorableCells: coverage.scorableCellIds.length,
+				unscorableCells: coverage.unscorableCells
 			},
-			accounting: this.proposalAccounting()
-		});
+			dimensions: breakdown.dimensions,
+			scenarios: breakdown.scenarios,
+			...child.label ? { label: child.label } : {},
+			...child.rationale ? { rationale: child.rationale } : {},
+			...child.attribution ? { attribution: child.attribution } : {}
+		};
 	}
-	/** Allocate every designed cell of a node before its campaign runs. */
-	async allocate(nodeId) {
-		for (const taskId of this.scenarioIds) for (let rep = 0; rep < this.reps; rep++) await this.recorder.allocateCell({
-			nodeId,
-			taskId,
-			split: "train",
-			rep,
-			stage: "train"
-		});
+	generationOf(state, expansion) {
+		return this.generations(state).indexOf(expansion);
 	}
-	/** Settle a node's campaign cells; allocates any the campaign ran beyond the design. */
-	async recordCells(nodeId, stage, cells) {
-		for (const cell of cells) {
-			const cellId = await this.recorder.allocateCell({
-				nodeId,
-				taskId: cell.scenarioId,
-				split: "train",
-				rep: cell.rep,
-				stage
-			});
-			await this.recorder.settleCell({
-				cellId,
-				attempt: 1,
-				outcome: cellOutcome(cell),
-				accounting: cellAccounting(cell),
-				identity: {
-					...this.identity,
-					model: this.cellModel(cell)
-				},
-				wallMs: cell.durationMs,
-				traceRef: { unknown: "runCampaign reports no trace id per cell" }
-			});
-		}
+	origin(state, nodeId) {
+		const node = state.node(nodeId);
+		const operationId = state.edge(node.edgeIds[0])?.proposer?.operationId ?? null;
+		const expansion = operationId === null ? null : searchExpansionIndex(operationId);
+		if (expansion === null) throw new Error(`runOptimization: node ${nodeId} was not proposed by this run's search`);
+		return {
+			expansion,
+			index: this.proposal(state, expansion).children.findIndex((child) => child.node.artifactDigest === node.artifactDigest)
+		};
 	}
-	/**
-	* Decide every node and close. The winner is selected; every other node is
-	* rejected. Allocated cells a campaign never returned are cancelled.
-	*/
-	async finish(input) {
-		const openCells = (await this.recorder.state()).cells().filter((cell) => cell.attempts === 0 && !cell.cancelled);
-		for (const cell of openCells) await this.recorder.cancelCell({
-			cellId: cell.cellId,
-			reason: "aborted"
+	proposal(state, expansion) {
+		const held = this.proposals.get(expansion);
+		if (held) return held;
+		const ref = state.operation(`expand-${expansion}`)?.artifacts.find((artifact) => artifact.role === "proposal");
+		if (!ref) return void 0;
+		const blob = this.recorder.readBlob(ref);
+		this.proposals.set(expansion, blob);
+		return blob;
+	}
+	async campaignRun(runDir, surface, input) {
+		const { baselineSurface: _baselineSurface, premeasuredBaseline: _premeasuredBaseline, dispatchWithSurface, proposer: _proposer, populationSize: _populationSize, maxGenerations: _maxGenerations, candidateConcurrency: _candidateConcurrency, maxImprovementShots: _maxImprovementShots, findings: _findings, analyzeGeneration: _analyzeGeneration, policy: _policy, searchLedger: _searchLedger, ...campaignOptions } = this.opts;
+		return runCampaign({
+			...campaignOptions,
+			signal: input.signal ?? this.opts.signal,
+			costLedger: this.costLedger,
+			costPhase: input.costPhase,
+			dispatchRef: surfaceDispatchRef(surface, this.opts.dispatchRef),
+			dispatch: (scenario, ctx) => dispatchWithSurface(surface, scenario, ctx),
+			runDir,
+			cellFilter: input.cellFilter,
+			resumable: true,
+			maxConcurrency: 1
 		});
-		for (const node of (await this.recorder.state()).nodes()) await this.recorder.decideNode({
-			nodeId: node.nodeId,
-			decision: node.nodeId === input.winnerNodeId ? { status: "selected" } : { status: "rejected" },
-			rule: "incumbent",
-			reason: node.nodeId === input.winnerNodeId ? "the incumbent when the loop stopped" : node.ordinal === 0 || input.promotedNodeIds.has(node.nodeId) ? "a later candidate replaced it as the incumbent" : input.incompleteNodeIds.has(node.nodeId) ? "the candidate missed a designed cell and could not be ranked" : "the candidate did not beat the incumbent"
-		});
-		await this.recorder.close({
-			reason: input.reason,
-			claim: null
-		});
-		return this.recorder.receipt({
-			producerId: this.proposerName,
-			runId: input.runId
+	}
+	premeasuredCell(work) {
+		const cell = this.premeasured.cells.find((candidate) => candidate.scenarioId === work.taskId && candidate.rep === work.rep);
+		if (!cell) throw new Error(`runOptimization: premeasured baseline lacks ${work.taskId}:${work.rep}`);
+		return this.cellResult(cell, work);
+	}
+	/** A cell's result as its campaign stored it: the cache of a scored cell,
+	* the final failure receipt of a failed one. */
+	/** A cell's result as its campaign stored it for this surface: the cache of
+	* a scored cell, the final failure receipt of a failed one. A result another
+	* surface left in the same directory does not count. */
+	storedCell(dir, surface, taskId, rep) {
+		const cellId = `${taskId}:${rep}`;
+		const manifestHash = this.manifestFor(surface);
+		const cached = this.storage.read(cellCachePath(dir, cellId));
+		const scored = cached === void 0 ? void 0 : JSON.parse(cached);
+		if (scored?.manifestHash === manifestHash) return scored;
+		const receipt = this.storage.read(join(cellDirectory(dir, cellId), "failure-receipt.json"));
+		const failed = receipt === void 0 ? void 0 : JSON.parse(receipt).cell;
+		return failed?.manifestHash === manifestHash ? failed : void 0;
+	}
+	manifestFor(surface) {
+		return computeManifestHash({
+			scenarios: this.opts.scenarios,
+			judges: this.opts.judges ?? [],
+			dispatchRef: surfaceDispatchRef(surface, this.opts.dispatchRef),
+			seed: this.opts.seed ?? 42,
+			reps: this.opts.reps ?? 1
 		});
 	}
-	/** Spend booked to candidate generation since the previous generation. */
-	proposalAccounting() {
-		const receipts = this.costLedger.list({ phase: "search.proposal" });
-		const fresh = receipts.slice(this.proposalReceiptCount);
-		this.proposalReceiptCount = receipts.length;
-		return receiptAccounting(fresh);
-	}
-	cellModel(cell) {
-		const resolved = cell.resolvedModel;
-		if (resolved === void 0) return this.identity.model;
-		const provider = this.identity.model.provider;
-		return modelHasSnapshot(resolved) ? {
-			provider,
-			snapshot: resolved
-		} : {
-			provider,
-			alias: resolved,
-			unknown: "the provider reported a moving alias, not a snapshot"
+	remember(nodeId, cell) {
+		const cells = this.cells.get(nodeId) ?? /* @__PURE__ */ new Map();
+		cells.set(`${cell.scenarioId}:${cell.rep}`, cell);
+		this.cells.set(nodeId, cells);
+	}
+	cellResult(cell, work) {
+		return {
+			outcome: cellOutcome(cell),
+			accounting: cellAccounting(cell),
+			identity: {
+				...this.execution,
+				model: cellModel(cell, this.execution.model)
+			},
+			wallMs: cell.durationMs,
+			placement: {
+				lane: work.lane,
+				boxId: null
+			},
+			traceRef: { unknown: "runCampaign reports no trace id per cell" }
 		};
 	}
 };
-function generationOperationId(generation) {
-	return `candidate-generation:gen-${generation}`;
+/** The default ledger and identities when the caller binds none. Revisions are
+* content digests of what the caller declared, and each uri names what its
+* digest covers: the dispatch ref, the proposer kind, the kernel. */
+async function defaultBinding(opts, runDir, storage) {
+	const base = `optimization-${createHash("sha256").update(runDir).digest("hex").slice(0, 16)}`;
+	const dispatchRef = opts.dispatchRef ?? "anonymous";
+	const identity = {
+		agent: {
+			uri: `dispatch-ref:${dispatchRef}`,
+			revision: hashCanonical({ dispatchRef })
+		},
+		proposer: {
+			kind: "deterministic",
+			source: {
+				uri: `proposer:${opts.proposer.kind}`,
+				revision: hashCanonical({ proposer: opts.proposer.kind })
+			}
+		},
+		search: SEARCH_KERNEL_SOURCE,
+		model: {
+			provider: "unspecified",
+			alias: "unspecified",
+			unknown: "runOptimization was not told which model the agent runs"
+		}
+	};
+	for (let slot = 1;; slot++) {
+		const path = `${slot === 1 ? `${runDir}/search` : `${runDir}/search-${slot}`}/ledger.jsonl`;
+		const searchId = slot === 1 ? base : `${base}-${slot}`;
+		const ledger = storage.kind === "filesystem" ? openSearchLedger({
+			path,
+			searchId
+		}) : openSearchLedger({
+			path,
+			searchId,
+			store: storage
+		});
+		if (!(await ledger.state()).closed) return {
+			ledger,
+			identity
+		};
+	}
+}
+function artifactKindOf(surface) {
+	return typeof surface === "object" && surface.kind === "code" ? "code" : "prompt";
+}
+function receiptKey(receipt) {
+	return receipt.callId;
+}
+/** A proposal that made a paid call ran a model; one that made none ran code. */
+function proposalExecution(receipts, provider, source) {
+	const model = receipts.find((receipt) => receipt.channel !== "judge")?.model;
+	if (model === void 0) return {
+		kind: "deterministic",
+		source
+	};
+	return {
+		kind: "model",
+		model: modelIdentity(model, provider),
+		source
+	};
+}
+function modelIdentity(model, provider) {
+	return modelHasSnapshot(model) ? {
+		provider,
+		snapshot: model
+	} : {
+		provider,
+		alias: model,
+		unknown: "the provider reported a moving alias, not a snapshot"
+	};
+}
+function cellModel(cell, fallback) {
+	return cell.resolvedModel === void 0 ? fallback : modelIdentity(cell.resolvedModel, fallback.provider);
 }
 function cellOutcome(cell) {
-	const scores = Object.entries(cell.judgeScores).filter(([, score]) => score.failed !== true && Number.isFinite(score.composite));
-	if (cell.error !== void 0 || scores.length === 0) return {
+	const quality = projectCampaignCellQuality(cell);
+	if (quality.score === void 0) return {
 		status: "errored",
 		metrics: {},
 		error: {
@@ -3355,12 +5695,11 @@ function cellOutcome(cell) {
 			retryable: false
 		}
 	};
-	const composite = scores.reduce((sum, [, score]) => sum + score.composite, 0) / scores.length;
-	const metrics = { composite };
-	for (const [judge, score] of scores) metrics[`judge.${judge}`] = score.composite;
+	const metrics = { composite: quality.score };
+	for (const [judge, score] of Object.entries(quality.successfulJudgeScores)) metrics[`judge.${judge}`] = score.composite;
 	return {
 		status: "passed",
-		score: composite,
+		score: quality.score,
 		metrics
 	};
 }
@@ -3423,332 +5762,6 @@ function receiptAccounting(receipts) {
 		}
 	};
 }
-//#endregion
-//#region src/campaign/presets/run-optimization.ts
-/**
-* `runOptimization` runs a caller-owned candidate generator for a bounded
-* number of rounds. Each candidate is measured on the same cases, and only a
-* candidate that beats the current best becomes the incumbent. By default the
-* incumbent is also the parent every generation mutates; a `selectParent`
-* policy draws the parent from the Pareto frontier instead.
-* The same loop accepts deterministic, model-backed, or agent-backed
-* proposers; they differ only in how `propose()` picks candidates.
-*
-* `runImprovementLoop` adds a separate final comparison, a release decision,
-* and optional pull request creation.
-*/
-/**
-* Improvement loop body: N generations of propose → campaign → rank, maintaining a Pareto frontier and one global incumbent across generations. The parent each generation mutates is the incumbent unless `selectParent` draws it from the frontier.
-*/
-async function runOptimization(opts) {
-	const { proposer } = opts;
-	const candidateConcurrency = opts.candidateConcurrency ?? 1;
-	if (typeof opts.runDir !== "string" || opts.runDir.trim().length === 0) throw new Error("runOptimization: runDir is required and must be a non-empty string");
-	if (!Number.isInteger(candidateConcurrency) || candidateConcurrency < 1) throw new Error("runOptimization: candidateConcurrency must be a positive integer");
-	const initialFindings = immutableProposalSnapshot(assertProposalFindings(opts.findings ?? [], "runOptimization initial proposal findings"), "initial findings");
-	const baselineSurface = immutableProposalSnapshot(opts.baselineSurface, "baseline surface");
-	opts.runDir = resolveRunDir(opts.runDir, opts.repo);
-	const storage = opts.storage ?? fsCampaignStorage();
-	const costLedger = opts.costLedger ?? createRunCostLedger({
-		storage,
-		runDir: opts.runDir,
-		costCeilingUsd: opts.costCeiling
-	});
-	const requireJudgeScore = (opts.judges?.length ?? 0) > 0;
-	const reps = opts.reps ?? 1;
-	const premeasuredBaseline = opts.premeasuredBaseline;
-	const baselineCampaign = premeasuredBaseline ? validatedPremeasuredBaseline({
-		input: premeasuredBaseline,
-		baselineSurface,
-		scenarios: opts.scenarios,
-		reps,
-		seed: opts.seed ?? 42,
-		judges: opts.judges ?? [],
-		dispatchRef: surfaceDispatchRef(baselineSurface, opts.dispatchRef)
-	}) : await runCampaign({
-		...opts,
-		costLedger,
-		costPhase: "search.baseline",
-		dispatchRef: surfaceDispatchRef(baselineSurface, opts.dispatchRef),
-		dispatch: (scenario, ctx) => opts.dispatchWithSurface(baselineSurface, scenario, ctx),
-		runDir: `${opts.runDir}/baseline`
-	});
-	const baselineCoverage = campaignCoverage(baselineCampaign.cells, opts.scenarios, reps, requireJudgeScore);
-	if (!baselineCoverage.complete) {
-		const label = opts.premeasuredBaseline ? "premeasured baseline" : "baseline";
-		throw new Error(`runOptimization: ${label} is incomplete (${baselineCoverage.scorableCellIds.length}/${baselineCoverage.expectedCellIds.length} designed cells scorable) — ${formatCoverageFailures(baselineCoverage)}. Refusing to optimize against an incomplete incumbent.`);
-	}
-	const opened = opts.searchLedger ? await OptimizationSearch.open({
-		binding: opts.searchLedger,
-		storage,
-		costLedger,
-		scenarios: opts.scenarios,
-		reps,
-		seed: opts.seed ?? 42,
-		splitDigest: baselineCampaign.splitDigest,
-		proposerName: proposer.kind,
-		expansion: opts.selectParent ? "select-parent" : "incumbent",
-		maxUsd: opts.costCeiling ?? null,
-		baselineSurface,
-		baselineCells: baselineCampaign.cells
-	}) : void 0;
-	const search = opened?.search;
-	const nodeIdByHash = /* @__PURE__ */ new Map();
-	if (opened) nodeIdByHash.set(surfaceHash(baselineSurface), opened.rootNodeId);
-	const incompleteNodeIds = /* @__PURE__ */ new Set();
-	const promotedNodeIds = /* @__PURE__ */ new Set();
-	let stopReason = "max-nodes";
-	const generations = [];
-	const history = [];
-	let currentFindings = initialFindings;
-	const selectionRankKey = opts.selectionRankKey ?? ((campaign) => [campaignMeanComposite(campaign)]);
-	let winnerSurface = baselineSurface;
-	let winnerSurfaceHash = surfaceHash(baselineSurface);
-	const admittedCandidateHashes = /* @__PURE__ */ new Set([winnerSurfaceHash]);
-	let winnerComposite = campaignMeanComposite(baselineCampaign);
-	let winnerRankKey = selectionRankKey(baselineCampaign);
-	assertFiniteRankKey(winnerRankKey, "selectionRankKey for baseline");
-	const baselineOutcome = toScoredSurfaceOutcome(winnerSurfaceHash, baselineCampaign, baselineCoverage, -1);
-	let winnerOutcome = baselineOutcome;
-	let winnerLabel;
-	let winnerRationale;
-	const scored = [toParetoParent(baselineSurface, winnerSurfaceHash, baselineCampaign, -1)];
-	const measuredByHash = /* @__PURE__ */ new Map([[winnerSurfaceHash, {
-		parent: scored[0],
-		outcome: baselineOutcome
-	}]]);
-	if (opts.analyzeGeneration && opts.maxGenerations > 0 && baselineCampaign.cells.length > 0) {
-		const fresh = await opts.analyzeGeneration({
-			generation: -1,
-			runDir: baselineCampaign.runDir,
-			candidates: [{
-				surfaceHash: winnerSurfaceHash,
-				campaign: baselineCampaign,
-				composite: winnerComposite
-			}],
-			history,
-			costLedger,
-			costPhase: "analysis.baseline"
-		});
-		if (!Array.isArray(fresh)) throw new TypeError("runOptimization: analyzeGeneration must return an array");
-		currentFindings = immutableProposalSnapshot(assertProposalFindings(fresh, "runOptimization baseline analysis findings"), "baseline analysis findings");
-	}
-	for (let gen = 0; gen < opts.maxGenerations; gen++) {
-		const proposalHistory = immutableProposalSnapshot(history, "history");
-		if (proposer.decide?.({ history: proposalHistory }).stop) {
-			stopReason = "converged";
-			break;
-		}
-		const paretoParents = immutableProposalSnapshot(computeParetoFrontier(scored), "Pareto parents");
-		const incumbentOutcome = immutableProposalSnapshot(winnerOutcome, "incumbent outcome");
-		const selected = opts.selectParent ? resolveSelectedParent(opts.selectParent(Object.freeze({
-			frontier: paretoParents,
-			incumbent: incumbentOutcome,
-			history: proposalHistory,
-			generation: gen
-		})), measuredByHash, gen) : void 0;
-		const parentSurface = selected ? selected.parent.surface : winnerSurface;
-		const parentSurfaceHash = selected ? selected.parent.surfaceHash : winnerSurfaceHash;
-		const parentComposite = selected ? selected.outcome.composite : winnerComposite;
-		const parentOutcome = selected ? selected.outcome : winnerOutcome;
-		const proposalContext = Object.freeze({
-			currentSurface: immutableProposalSnapshot(parentSurface, "current surface"),
-			history: proposalHistory,
-			findings: immutableProposalSnapshot(assertProposalFindings(currentFindings, "runOptimization proposal findings"), "findings"),
-			populationSize: opts.populationSize,
-			generation: gen,
-			signal: opts.signal ?? new AbortController().signal,
-			baselineOutcome: immutableProposalSnapshot(baselineOutcome, "baseline outcome"),
-			incumbentOutcome,
-			parentOutcome: immutableProposalSnapshot(parentOutcome, "parent outcome"),
-			maxImprovementShots: opts.maxImprovementShots,
-			paretoParents,
-			costLedger,
-			costPhase: "search.proposal"
-		});
-		await search?.startGeneration(gen);
-		const proposed = await proposer.propose(proposalContext);
-		if (!Array.isArray(proposed)) throw new TypeError("runOptimization: proposer must return an array");
-		const proposalSnapshot = immutableProposalSnapshot(proposed, "candidate outputs");
-		if (proposalSnapshot.length === 0) {
-			await search?.failGeneration(gen, "the proposer returned no candidates");
-			stopReason = "converged";
-			break;
-		}
-		const candidates = proposalSnapshot.map((p) => isProposedCandidate(p) ? p : {
-			surface: p,
-			label: "",
-			rationale: ""
-		});
-		const generationHashes = /* @__PURE__ */ new Set();
-		for (const { surface } of candidates) {
-			const hash = surfaceHash(surface);
-			if (admittedCandidateHashes.has(hash) || generationHashes.has(hash)) throw new Error(`runOptimization: duplicate candidate surface hash "${hash}" in generation ${gen}; candidate surfaces must be unique`);
-			generationHashes.add(hash);
-		}
-		for (const hash of generationHashes) admittedCandidateHashes.add(hash);
-		if (search) {
-			const nodeIds = await search.recordProposal({
-				generation: gen,
-				parent: {
-					nodeId: nodeIdByHash.get(parentSurfaceHash),
-					surface: parentSurface,
-					composite: parentComposite
-				},
-				selectionRule: opts.selectParent ? "select-parent" : "incumbent",
-				candidates
-			});
-			for (const [index, nodeId] of nodeIds.entries()) {
-				nodeIdByHash.set(surfaceHash(candidates[index].surface), nodeId);
-				await search.allocate(nodeId);
-			}
-		}
-		const surfaceResults = await mapConcurrent(candidates, candidateConcurrency, async ({ surface, label, rationale, attribution }, i, signal) => {
-			const hash = surfaceHash(surface);
-			const campaign = await runCampaign({
-				...opts,
-				signal,
-				costLedger,
-				costPhase: "search.candidate",
-				dispatchRef: surfaceDispatchRef(surface, opts.dispatchRef),
-				dispatch: (scenario, ctx) => opts.dispatchWithSurface(surface, scenario, ctx),
-				runDir: `${opts.runDir}/gen-${gen}/candidate-${i}`
-			});
-			const coverage = campaignCoverage(campaign.cells, opts.scenarios, opts.reps ?? 1, requireJudgeScore);
-			const composite = campaignMeanCompositeOrNull(campaign);
-			const rankKey = coverage.complete ? selectionRankKey(campaign) : null;
-			if (rankKey) assertFiniteRankKey(rankKey, `selectionRankKey for generation ${gen} candidate ${i}`, winnerRankKey.length);
-			return {
-				surfaceHash: hash,
-				surface,
-				label,
-				rationale,
-				...attribution ? { attribution } : {},
-				campaign,
-				composite,
-				rankKey,
-				coverage
-			};
-		}, opts.signal);
-		for (const result of surfaceResults) {
-			const { surface, surfaceHash: hash, campaign, coverage, label, rationale } = result;
-			if (coverage.complete) {
-				const parent = toParetoParent(surface, hash, campaign, gen, label || void 0, rationale || void 0);
-				scored.push(parent);
-				measuredByHash.set(hash, {
-					parent,
-					outcome: toScoredSurfaceOutcome(hash, campaign, coverage, gen)
-				});
-			}
-		}
-		if (search) for (const result of surfaceResults) {
-			const nodeId = nodeIdByHash.get(result.surfaceHash);
-			await search.recordCells(nodeId, "train", result.campaign.cells);
-			if (!result.coverage.complete) incompleteNodeIds.add(nodeId);
-		}
-		surfaceResults.sort((a, b) => {
-			if (a.coverage.complete !== b.coverage.complete) return a.coverage.complete ? -1 : 1;
-			if (a.rankKey && b.rankKey) return compareRankKeys(b.rankKey, a.rankKey);
-			return a.surfaceHash.localeCompare(b.surfaceHash);
-		});
-		const top = surfaceResults.filter((result) => result.coverage.complete && result.composite !== null && result.rankKey !== null)[0];
-		const promoted = top && compareRankKeys(top.rankKey, winnerRankKey) > 0 ? [top] : [];
-		if (promoted[0]) {
-			const top = promoted[0];
-			const promotedNodeId = nodeIdByHash.get(top.surfaceHash);
-			if (promotedNodeId) promotedNodeIds.add(promotedNodeId);
-			winnerSurface = top.surface;
-			winnerSurfaceHash = top.surfaceHash;
-			winnerComposite = top.composite;
-			winnerRankKey = top.rankKey;
-			winnerOutcome = toScoredSurfaceOutcome(top.surfaceHash, top.campaign, top.coverage, gen);
-			winnerLabel = top.label || void 0;
-			winnerRationale = top.rationale || void 0;
-		}
-		const record = {
-			generationIndex: gen,
-			candidates: surfaceResults.map((s) => {
-				const breakdown = campaignBreakdown(s.campaign);
-				const candidate = {
-					surfaceHash: s.surfaceHash,
-					composite: s.composite,
-					ci95: null,
-					parentSurfaceHash,
-					parentComposite,
-					...s.coverage.complete ? { observedDeltaFromParent: s.composite - parentComposite } : {},
-					eligibleForPromotion: s.coverage.complete,
-					coverage: {
-						expectedCells: s.coverage.expectedCellIds.length,
-						scorableCells: s.coverage.scorableCellIds.length,
-						unscorableCells: s.coverage.unscorableCells
-					},
-					dimensions: breakdown.dimensions,
-					scenarios: breakdown.scenarios
-				};
-				if (s.label) candidate.label = s.label;
-				if (s.rationale) candidate.rationale = s.rationale;
-				if (s.attribution) candidate.attribution = s.attribution;
-				return candidate;
-			}),
-			promoted: promoted.map((p) => p.surfaceHash)
-		};
-		history.push(record);
-		generations.push({
-			record,
-			surfaces: surfaceResults.map((s) => ({
-				surfaceHash: s.surfaceHash,
-				surface: s.surface,
-				campaign: s.campaign
-			}))
-		});
-		if (opts.analyzeGeneration && gen < opts.maxGenerations - 1) {
-			const fresh = await opts.analyzeGeneration({
-				generation: gen,
-				runDir: `${opts.runDir}/gen-${gen}`,
-				candidates: surfaceResults.map((s) => ({
-					surfaceHash: s.surfaceHash,
-					campaign: s.campaign,
-					composite: s.composite
-				})),
-				history,
-				costLedger,
-				costPhase: "analysis.generation"
-			});
-			if (!Array.isArray(fresh)) throw new TypeError("runOptimization: analyzeGeneration must return an array");
-			currentFindings = immutableProposalSnapshot(assertProposalFindings(fresh, "runOptimization generation analysis findings"), "generation analysis findings");
-		}
-	}
-	const searchHistory = await search?.finish({
-		winnerNodeId: nodeIdByHash.get(winnerSurfaceHash),
-		promotedNodeIds,
-		incompleteNodeIds,
-		reason: stopReason,
-		runId: opts.runDir
-	});
-	return {
-		generations,
-		baselineSurface,
-		winnerSurface,
-		winnerSurfaceHash,
-		winnerLabel,
-		winnerRationale,
-		baselineCampaign,
-		...searchHistory ? { searchHistory } : {},
-		paretoFrontier: computeParetoFrontier(scored),
-		cost: costLedger.summary()
-	};
-}
-/** Resolve the parent a `selectParent` policy returned to the measured record
-*  this run holds for it. Refuses a surface the run never measured to
-*  completion, and a parent whose surface does not hash to its `surfaceHash`. */
-function resolveSelectedParent(returned, measuredByHash, generation) {
-	if (typeof returned !== "object" || returned === null || typeof returned.surfaceHash !== "string") throw new TypeError(`runOptimization: selectParent must return a ParetoParent (generation ${generation})`);
-	const parent = returned;
-	const measured = measuredByHash.get(parent.surfaceHash);
-	if (!measured) throw new Error(`runOptimization: selectParent returned surface "${parent.surfaceHash}" in generation ${generation}, which this run has not measured to completion; a parent must be a scored surface from the frontier`);
-	if (!surfaceHashMatches(parent.surface, parent.surfaceHash)) throw new Error(`runOptimization: selectParent returned a parent whose surface does not match its surfaceHash "${parent.surfaceHash}" (generation ${generation})`);
-	return measured;
-}
 function immutableProposalSnapshot(value, label) {
 	try {
 		return deepFreeze(structuredClone(value));
@@ -3782,58 +5795,42 @@ function validatedPremeasuredBaseline(args) {
 		reps: args.reps
 	});
 	if (campaign.manifestHash !== expectedManifest) throw new Error("runOptimization: premeasured baseline evaluator identity does not match the requested dispatch and judges");
+	const coverage = campaignCoverage(campaign.cells, args.scenarios, args.reps, args.requireJudgeScore);
+	if (!coverage.complete) throw new Error(`runOptimization: premeasured baseline is incomplete (${coverage.scorableCellIds.length}/${coverage.expectedCellIds.length} designed cells scorable) — ${formatCoverageFailures(coverage)}. Refusing to optimize against an incomplete incumbent.`);
 	return campaign;
 }
-/** Build a `ParetoParent` from a scored campaign — objective vector =
-*  per-scenario composite, scalar = mean composite. */
-function toParetoParent(surface, hash, campaign, generation, label, rationale) {
+/** A scored campaign as a frontier member: per-scenario composite objectives. */
+function toParetoParent(surface, campaign, generation, label) {
 	const objectives = {};
 	for (const { scenarioId, composite } of campaignBreakdown(campaign).scenarios) objectives[scenarioId] = composite;
 	const parent = {
 		surface,
-		surfaceHash: hash,
+		surfaceHash: surfaceHash(surface),
 		objectives,
 		composite: campaignMeanComposite(campaign),
 		generation
 	};
 	if (label) parent.label = label;
-	if (rationale) parent.rationale = rationale;
 	return parent;
 }
-/** The non-dominated set over the per-scenario objective vectors. Every
-*  scenario seen across the scored set becomes a `maximize` objective.
-*  `runOptimization` admits only complete campaigns to this set; the finite
-*  floor remains a defensive fallback for manually constructed/no-judge
-*  vectors. Delegates dominance to the package-canonical `paretoFrontier`. */
+/** The non-dominated set over the per-scenario objective vectors. */
 function computeParetoFrontier(scored) {
 	if (scored.length <= 1) return [...scored];
 	const ids = /* @__PURE__ */ new Set();
 	for (const p of scored) for (const id of Object.keys(p.objectives)) ids.add(id);
 	if (ids.size === 0) return [...scored];
-	const floor = {};
-	for (const id of ids) {
-		let min = Number.POSITIVE_INFINITY;
-		for (const p of scored) {
-			const v = p.objectives[id];
-			if (typeof v === "number" && Number.isFinite(v) && v < min) min = v;
-		}
-		floor[id] = Number.isFinite(min) ? min : 0;
-	}
 	return paretoFrontier(scored, [...ids].map((id) => ({
 		name: id,
 		direction: "maximize",
-		value: (p) => {
-			const v = p.objectives[id];
-			return typeof v === "number" && Number.isFinite(v) ? v : floor[id] ?? 0;
-		}
+		value: (p) => p.objectives[id] ?? Number.NEGATIVE_INFINITY
 	}))).frontier;
 }
-function toScoredSurfaceOutcome(surfaceHash, campaign, coverage, generation) {
+function toScoredSurfaceOutcome(hash, campaign, coverage, generation) {
 	const breakdown = campaignBreakdown(campaign);
 	return {
 		split: "search",
 		generation,
-		surfaceHash,
+		surfaceHash: hash,
 		composite: campaignMeanComposite(campaign),
 		dimensions: breakdown.dimensions,
 		scenarios: breakdown.scenarios,
@@ -5253,6 +7250,6 @@ function firstString(value) {
 	return typeof value === "string" && value.trim() ? value : void 0;
 }
 //#endregion
-export { readCachedCell as $, isProposedCandidate as A, redTeamDataset as B, assertCompleteSearchHistory as C, searchHistoryCoverageRow as D, createSearchHistoryReceipt as E, runFinalComparison as F, captureFinalEvidencePolicy as G, scoreRedTeamOutput as H, openAutoPr as I, runEval as J, evaluationUnitMap as K, captureJudge as L, dominates as M, paretoFrontier as N, verifySearchHistoryArtifact as O, paretoFrontierWithCrowding as P, tangleTracesRoot as Q, defaultProductionGate as R, SearchHistoryRequiredError as S, assertSearchHistoryMatchesState as T, runCanaries as U, redTeamReport as V, assertIndependentEvaluationSplit as W, planCampaignRun as X, runCampaign as Y, resolveRunDir as Z, SearchRecorder as _, transientDispatchFailure as a, surfaceDiff as b, compareOptimizationMethods as c, combineComparisonCosts as d, buildCellSchedule as et, costFromLedgerSummary as f, runOptimization as g, runImprovementLoop as h, quotaExhaustedUntil as i, labelTrustRank as j, verifySearchHistoryReceipt as k, optimizationTokenUsageFromSummary as l, readGepaCandidatePopulationArtifact as m, JudgeParseError as n, computeManifestHash as nt, aggregateRunScore as o, assertGepaCandidatePopulationSummary as p, reserveFinalEvidence as q, isTransientTransportFailure as r, clamp01 as s, llmJudge as t, cellCachePath as tt, executeOptimizationMethod as u, developmentClaim as v, assertSearchHistoryAdmissionOptions as w, surfaceNode as x, searchEdgeId as y, DEFAULT_RED_TEAM_CORPUS as z };
+export { redTeamDataset as $, createSearchHistoryReceipt as A, decideSearchClaim as B, searchEdgeId as C, assertCompleteSearchHistory as D, SearchHistoryRequiredError as E, runSearch as F, uniform as G, searchClaimReserveUsd as H, searchDivergence as I, runFinalComparison as J, dominates as K, searchExpansionIndex as L, verifySearchHistoryArtifact as M, verifySearchHistoryReceipt as N, assertSearchHistoryAdmissionOptions as O, SEARCH_KERNEL_SOURCE as P, DEFAULT_RED_TEAM_CORPUS as Q, searchPolicyView as R, developmentClaim as S, surfaceNode as T, pairedPromotionPower as U, planSearchClaim as V, requiredPairsForPairedPromotion as W, captureJudge as X, openAutoPr as Y, defaultProductionGate as Z, isProposedCandidate as _, transientDispatchFailure as a, evaluationUnitMap as at, incumbent as b, compareOptimizationMethods as c, runCampaign as ct, combineComparisonCosts as d, tangleTracesRoot as dt, redTeamReport as et, costFromLedgerSummary as f, readCachedCell as ft, runOptimization as g, runImprovementLoop as h, computeManifestHash as ht, quotaExhaustedUntil as i, captureFinalEvidencePolicy as it, searchHistoryCoverageRow as j, assertSearchHistoryMatchesState as k, optimizationTokenUsageFromSummary as l, planCampaignRun as lt, readGepaCandidatePopulationArtifact as m, cellCachePath as mt, JudgeParseError as n, runCanaries as nt, aggregateRunScore as o, reserveFinalEvidence as ot, assertGepaCandidatePopulationSummary as p, buildCellSchedule as pt, paretoFrontier as q, isTransientTransportFailure as r, assertIndependentEvaluationSplit as rt, clamp01 as s, runEval as st, llmJudge as t, scoreRedTeamOutput as tt, executeOptimizationMethod as u, resolveRunDir as ut, labelTrustRank as v, surfaceDiff as w, SearchRecorder as x, crowdedFrontierParent as y, SEARCH_CLAIM_RULE as z };
 
-//# sourceMappingURL=llm-judge-NJOHM0iA.js.map
+//# sourceMappingURL=llm-judge-ChbWfeWl.js.map