@rulvar/core 1.71.0 → 1.73.0

package/dist/index.js

@@ -11087,7 +11087,9 @@ async function runAgent(options) {
 			status = "limit";
 			break;
 		}
-		if (turns >= limits.maxTurns) {
+		const repairReserve = options.terminalTool?.repairTurnReserve ?? 0;
+		const grantedRepairTurns = repairReserve === 0 ? 0 : Math.min(repairReserve, messages.reduce((count, message) => count + message.parts.filter((part) => part.type === "tool-result" && part.name === options.terminalTool?.name && part.isError === true).length, 0));
+		if (turns >= limits.maxTurns + grantedRepairTurns) {
 			status = "limit";
 			break;
 		}
@@ -15091,6 +15093,465 @@ function buildOrchestratorTools(runtime, profileCardText, options) {
 	return tools;
 }
 //#endregion
+//#region src/orchestrator/finish-validators.ts
+/**
+* Deterministic host validation of the orchestrator finish result (the
+* v1.40.0 improvement plan's RV-204 slice). A validator is plain
+* synchronous host code judging the finish({ result }) argument; the
+* orchestrator runtime runs the configured set on every schema valid
+* finish call, returns the failure reasons to the model as the call's
+* error tool result (a bounded repair turn), and fails the run with a
+* typed error when the repair bound is exhausted. Verdicts journal as
+* decision entries, so a resume rolls the SAME verdicts forward without
+* re-running validator code.
+*/
+const ok = { ok: true };
+function requireNonEmptyStrings(values, what) {
+	if (!Array.isArray(values) || values.length === 0) throw new ConfigError(`${what} must be a non empty array of strings`);
+	for (const value of values) if (typeof value !== "string" || value.length === 0) throw new ConfigError(`${what} must contain only non empty strings`);
+	return values;
+}
+/**
+* Requires every named section to appear LITERALLY in the result text
+* (a heading like 'FINDINGS' or any marker the goal demands). Default
+* name 'required-sections'; pass `name` to run several instances.
+*/
+function requiredSectionsValidator(options) {
+	const sections = requireNonEmptyStrings(options.sections, "requiredSectionsValidator sections");
+	return {
+		name: options.name ?? "required-sections",
+		validate: (input) => {
+			const missing = sections.filter((section) => !input.text.includes(section));
+			return missing.length === 0 ? ok : {
+				ok: false,
+				reasons: missing.map((section) => `required section '${section}' is missing`)
+			};
+		}
+	};
+}
+/**
+* Requires the result to be a JSON object carrying every named field
+* with a substantial value: present, not null, and not an empty or
+* whitespace only string (empty arrays, zero, and false COUNT as
+* present; emptiness rules beyond strings belong to a custom
+* validator). Default name 'required-fields'.
+*/
+function requiredFieldsValidator(options) {
+	const fields = requireNonEmptyStrings(options.fields, "requiredFieldsValidator fields");
+	return {
+		name: options.name ?? "required-fields",
+		validate: (input) => {
+			const result = input.result;
+			if (typeof result !== "object" || result === null || Array.isArray(result)) return {
+				ok: false,
+				reasons: ["the finish result is not a JSON object"]
+			};
+			const record = result;
+			const reasons = [];
+			for (const field of fields) {
+				const value = record[field];
+				if (value === void 0 || value === null) reasons.push(`required field '${field}' is missing`);
+				else if (typeof value === "string" && value.trim().length === 0) reasons.push(`required field '${field}' is empty`);
+			}
+			return reasons.length === 0 ? ok : {
+				ok: false,
+				reasons
+			};
+		}
+	};
+}
+/**
+* Requires the result text's word count (whitespace separated tokens;
+* an empty text counts zero) to sit inside the configured bounds (the
+* v1.71 experiment review, P0.7: a formal length requirement must be
+* code, never a natural-language plea the model may round away). At
+* least one bound is required; both are positive integers with
+* min <= max. Default name 'word-count'.
+*/
+function wordCountValidator(options) {
+	const { min, max } = options;
+	if (min === void 0 && max === void 0) throw new ConfigError("wordCountValidator requires min, max, or both");
+	for (const [label, value] of [["min", min], ["max", max]]) if (value !== void 0 && (!Number.isInteger(value) || value < 1)) throw new ConfigError(`wordCountValidator ${label} must be a positive integer; got ${String(value)}`);
+	if (min !== void 0 && max !== void 0 && min > max) throw new ConfigError(`wordCountValidator min ${String(min)} exceeds max ${String(max)}`);
+	return {
+		name: options.name ?? "word-count",
+		validate: (input) => {
+			const trimmed = input.text.trim();
+			const count = trimmed.length === 0 ? 0 : trimmed.split(/\s+/).length;
+			const reasons = [];
+			if (min !== void 0 && count < min) reasons.push(`result word count ${String(count)} is below the required minimum ${String(min)}`);
+			if (max !== void 0 && count > max) reasons.push(`result word count ${String(count)} exceeds the maximum ${String(max)}`);
+			return reasons.length === 0 ? ok : {
+				ok: false,
+				reasons
+			};
+		}
+	};
+}
+/** The default citation shape: a path with an extension, a colon, a line number. */
+const DEFAULT_CITATION_PATTERN = "[\\w./-]+\\.\\w+:\\d+";
+/** The default preserved share, the improvement plan's RV-202 gate. */
+const DEFAULT_EVIDENCE_MIN_SHARE = .95;
+const MAX_LISTED_CITATIONS = 20;
+function listCitations(values) {
+	return values.length <= MAX_LISTED_CITATIONS ? values.join(", ") : `${values.slice(0, MAX_LISTED_CITATIONS).join(", ")} and ${String(values.length - MAX_LISTED_CITATIONS)} more`;
+}
+/**
+* The RV-202 evidence preservation contract: the finish result must
+* PRESERVE the citations the children actually produced. Distinct
+* matches of `pattern` are collected across the outputs of children
+* settled 'ok' (spawn order); at least `minShare` of them (default
+* {@link DEFAULT_EVIDENCE_MIN_SHARE}, the plan's 95 percent gate,
+* compared as a ceiling on the required count so an exact boundary like
+* 19 of 20 passes) must appear literally in the result text. Zero child
+* citations pass vacuously. With `requireKnown: true` the contract also
+* runs in reverse: every citation in the RESULT must appear in some
+* child's output, so a fabricated but pattern valid citation is
+* rejected instead of silently counting as evidence. Rejection reasons
+* list the missing (and unknown) citations, capped at 20, so the repair
+* turn can restore them. Purely textual and deterministic; checking
+* that cited targets EXIST on disk is host territory (a custom
+* validator), not this contract. Default name 'evidence-preserved'.
+*/
+function evidencePreservedValidator(options) {
+	const pattern = options?.pattern ?? "[\\w./-]+\\.\\w+:\\d+";
+	const flags = options?.flags ?? "";
+	const globalFlags = flags.includes("g") ? flags : `${flags}g`;
+	try {
+		new RegExp(pattern, globalFlags);
+	} catch (thrown) {
+		throw new ConfigError(`evidencePreservedValidator pattern does not compile: ${thrown instanceof Error ? thrown.message : String(thrown)}`);
+	}
+	const minShare = options?.minShare ?? .95;
+	if (typeof minShare !== "number" || !Number.isFinite(minShare) || minShare <= 0 || minShare > 1) throw new ConfigError(`evidencePreservedValidator minShare must be a number in (0, 1]; got ${String(minShare)}`);
+	return {
+		name: options?.name ?? "evidence-preserved",
+		validate: (input) => {
+			const cited = /* @__PURE__ */ new Set();
+			for (const child of input.children ?? []) {
+				if (child.status !== "ok" && child.salvageableOutput !== true) continue;
+				for (const match of child.text.match(new RegExp(pattern, globalFlags)) ?? []) cited.add(match);
+			}
+			const reasons = [];
+			if (cited.size > 0) {
+				const missing = [...cited].filter((citation) => !input.text.includes(citation));
+				const preserved = cited.size - missing.length;
+				if (preserved < Math.ceil(minShare * cited.size - 1e-9)) reasons.push(`evidence preservation ${String(preserved)} of ${String(cited.size)} child citations is below the required share ${String(minShare)}; missing: ${listCitations(missing)}`);
+			}
+			if (options?.requireKnown === true) {
+				const fabricated = [...new Set(input.text.match(new RegExp(pattern, globalFlags)) ?? [])].filter((citation) => !cited.has(citation));
+				if (fabricated.length > 0) reasons.push(`unknown citations not present in any child report: ${listCitations(fabricated)}`);
+			}
+			return reasons.length === 0 ? ok : {
+				ok: false,
+				reasons
+			};
+		}
+	};
+}
+/**
+* Requires at least `min` matches of `pattern` INSIDE every named
+* section (the v1.71 experiment review, P1.2: a total citation count
+* hides sections carrying zero provenance). A section's slice runs
+* from its FIRST occurrence to the next found section marker in text
+* position order, or to the end of the text; a marker absent from the
+* text is its own failure reason, because coverage of a missing
+* section cannot silently count as satisfied.
+* requiredSectionsValidator still owns plain presence. Default name
+* 'section-citations'.
+*/
+function sectionCitationsValidator(options) {
+	const sections = requireNonEmptyStrings(options.sections, "sectionCitationsValidator sections");
+	const pattern = options.pattern ?? "[\\w./-]+\\.\\w+:\\d+";
+	const flags = options.flags ?? "";
+	const globalFlags = flags.includes("g") ? flags : `${flags}g`;
+	try {
+		new RegExp(pattern, globalFlags);
+	} catch (thrown) {
+		throw new ConfigError(`sectionCitationsValidator pattern does not compile: ${thrown instanceof Error ? thrown.message : String(thrown)}`);
+	}
+	if (!Number.isInteger(options.min) || options.min < 1) throw new ConfigError(`sectionCitationsValidator min must be a positive integer; got ${String(options.min)}`);
+	return {
+		name: options.name ?? "section-citations",
+		validate: (input) => {
+			const positions = /* @__PURE__ */ new Map();
+			for (const section of sections) {
+				const at = input.text.indexOf(section);
+				if (at >= 0) positions.set(section, at);
+			}
+			const ordered = [...positions.entries()].sort((a, b) => a[1] - b[1]);
+			const reasons = [];
+			for (const section of sections) {
+				const at = positions.get(section);
+				if (at === void 0) {
+					reasons.push(`required section '${section}' is missing, so its citation coverage cannot be judged`);
+					continue;
+				}
+				const next = ordered.find(([, position]) => position > at);
+				const matches = input.text.slice(at, next === void 0 ? input.text.length : next[1]).match(new RegExp(pattern, globalFlags))?.length ?? 0;
+				if (matches < options.min) reasons.push(`section '${section}' carries ${String(matches)} citations matching /${pattern}/; at least ${String(options.min)} required`);
+			}
+			return reasons.length === 0 ? ok : {
+				ok: false,
+				reasons
+			};
+		}
+	};
+}
+/**
+* Requires at least `min` matches of `pattern` in the result text (the
+* plan's citation and source count checks: a file:line pattern, a URL
+* pattern). The pattern compiles at construction (invalid patterns are a
+* ConfigError before any run exists) and matches globally; `min` is a
+* positive integer. Default name 'min-matches'; pass `name` to run
+* several instances, because names must be unique per orchestrate call.
+*/
+function minMatchesValidator(options) {
+	const flags = options.flags ?? "";
+	const globalFlags = flags.includes("g") ? flags : `${flags}g`;
+	try {
+		new RegExp(options.pattern, globalFlags);
+	} catch (thrown) {
+		throw new ConfigError(`minMatchesValidator pattern does not compile: ${thrown instanceof Error ? thrown.message : String(thrown)}`);
+	}
+	if (!Number.isInteger(options.min) || options.min < 1) throw new ConfigError(`minMatchesValidator min must be a positive integer; got ${String(options.min)}`);
+	return {
+		name: options.name ?? "min-matches",
+		validate: (input) => {
+			const found = input.text.match(new RegExp(options.pattern, globalFlags))?.length ?? 0;
+			return found >= options.min ? ok : {
+				ok: false,
+				reasons: [`expected at least ${String(options.min)} matches of /${options.pattern}/${flags}; found ${String(found)}`]
+			};
+		}
+	};
+}
+//#endregion
+//#region src/orchestrator/output-contract.ts
+/**
+* The unified output contract (the v1.71 experiment review: P0.1 the
+* manifest, P0.2 the frozen bundle, P0.3 the golden self test). ONE
+* immutable manifest generates the prompt statement the model reads,
+* the stock validator set the host enforces, a stable content hash,
+* and golden self-test fixtures, so the prompt and the validators
+* cannot drift apart by construction. The experiment's terminal
+* failure was exactly that drift: the question renamed three sections,
+* the harness validator kept the old names, and the mismatch survived
+* until paid provider turns had burned. With a contract, the same
+* mistake is a ConfigError before the first provider call.
+*/
+/** The golden citation sample used with {@link DEFAULT_CITATION_PATTERN}. */
+const DEFAULT_CITATION_SAMPLE = "docs/output-contract.md:1";
+/** The filler token golden skeletons pad word counts with. */
+const FILLER_WORD = "placeholder";
+function requirePositiveInt(value, what) {
+	if (typeof value !== "number" || !Number.isInteger(value) || value < 1) throw new ConfigError(`${what} must be a positive integer; got ${String(value)}`);
+	return value;
+}
+function countWords(text) {
+	const trimmed = text.trim();
+	return trimmed.length === 0 ? 0 : trimmed.split(/\s+/).length;
+}
+/**
+* Builds a {@link FinishContract} from one manifest: validation and the
+* golden fixtures happen HERE, at configuration time, so a
+* self-contradictory contract (mandatory content alone above words.max,
+* an unsampled custom pattern) fails before any run exists. Spread
+* `contract.validators` into finishValidation.validators and pass the
+* contract itself as finishValidation.contract; the orchestrator then
+* injects `promptLines` into the coordination and synthesis prompts,
+* runs the golden self test at construction, and journals the frozen
+* bundle descriptor.
+*/
+function finishContract(manifest) {
+	if (typeof manifest !== "object" || manifest === null) throw new ConfigError("finishContract manifest must be an object");
+	const { sections, words, citations } = manifest;
+	if (sections === void 0 && words === void 0 && citations === void 0) throw new ConfigError("finishContract manifest must declare sections, words, or citations");
+	let normalizedSections;
+	if (sections !== void 0) {
+		if (!Array.isArray(sections) || sections.length === 0) throw new ConfigError("finishContract sections must be a non empty array of strings");
+		const seen = /* @__PURE__ */ new Set();
+		for (const section of sections) {
+			if (typeof section !== "string" || section.trim().length === 0) throw new ConfigError("finishContract sections must contain only non empty strings");
+			if (section.includes("\n")) throw new ConfigError(`finishContract section '${section}' must be a single line`);
+			if (seen.has(section)) throw new ConfigError(`finishContract sections must be unique; '${section}' repeats`);
+			seen.add(section);
+		}
+		normalizedSections = [...sections];
+	}
+	let normalizedWords;
+	if (words !== void 0) {
+		if (typeof words !== "object" || words === null) throw new ConfigError("finishContract words must be an object");
+		if (words.min === void 0 && words.max === void 0) throw new ConfigError("finishContract words requires min, max, or both");
+		if (words.min !== void 0) requirePositiveInt(words.min, "finishContract words.min");
+		if (words.max !== void 0) requirePositiveInt(words.max, "finishContract words.max");
+		if (words.min !== void 0 && words.max !== void 0 && words.min > words.max) throw new ConfigError(`finishContract words.min ${String(words.min)} exceeds words.max ${String(words.max)}`);
+		normalizedWords = {
+			...words.min === void 0 ? {} : { min: words.min },
+			...words.max === void 0 ? {} : { max: words.max }
+		};
+	}
+	let normalizedCitations;
+	if (citations !== void 0) {
+		if (typeof citations !== "object" || citations === null) throw new ConfigError("finishContract citations must be an object");
+		if (citations.min === void 0 && citations.perSection === void 0) throw new ConfigError("finishContract citations requires min, perSection, or both");
+		if (citations.min !== void 0) requirePositiveInt(citations.min, "finishContract citations.min");
+		if (citations.perSection !== void 0) {
+			requirePositiveInt(citations.perSection, "finishContract citations.perSection");
+			if (normalizedSections === void 0) throw new ConfigError("finishContract citations.perSection requires sections");
+		}
+		const pattern = citations.pattern ?? "[\\w./-]+\\.\\w+:\\d+";
+		const flags = citations.flags ?? "";
+		const globalFlags = flags.includes("g") ? flags : `${flags}g`;
+		try {
+			new RegExp(pattern, globalFlags);
+		} catch (thrown) {
+			throw new ConfigError(`finishContract citations.pattern does not compile: ${thrown instanceof Error ? thrown.message : String(thrown)}`);
+		}
+		const sample = citations.sample ?? (citations.pattern === void 0 ? "docs/output-contract.md:1" : void 0);
+		if (sample === void 0) throw new ConfigError("finishContract citations.sample is required with a custom pattern: the golden fixtures embed a literal match");
+		if (typeof sample !== "string" || sample.length === 0 || /\s/u.test(sample)) throw new ConfigError("finishContract citations.sample must be a non empty string without whitespace");
+		if (!new RegExp(pattern, globalFlags).test(sample)) throw new ConfigError(`finishContract citations.sample '${sample}' does not match the citation pattern`);
+		if (normalizedSections?.some((section) => sample.includes(section)) === true) throw new ConfigError("finishContract citations.sample must not contain a declared section marker");
+		normalizedCitations = {
+			pattern,
+			flags,
+			sample,
+			...citations.min === void 0 ? {} : { min: citations.min },
+			...citations.perSection === void 0 ? {} : { perSection: citations.perSection }
+		};
+	}
+	const normalized = {
+		...normalizedSections === void 0 ? {} : { sections: normalizedSections },
+		...normalizedWords === void 0 ? {} : { words: normalizedWords },
+		...normalizedCitations === void 0 ? {} : { citations: normalizedCitations }
+	};
+	const hash = createHash("sha256").update(jcsSerialize(normalized), "utf8").digest("hex");
+	const validators = [];
+	if (normalizedSections !== void 0) validators.push(requiredSectionsValidator({
+		sections: normalizedSections,
+		name: "contract-sections"
+	}));
+	if (normalizedWords !== void 0) validators.push(wordCountValidator({
+		...normalizedWords,
+		name: "contract-words"
+	}));
+	if (normalizedCitations?.min !== void 0) validators.push(minMatchesValidator({
+		pattern: normalizedCitations.pattern,
+		flags: normalizedCitations.flags,
+		min: normalizedCitations.min,
+		name: "contract-citations"
+	}));
+	if (normalizedCitations?.perSection !== void 0 && normalizedSections !== void 0) validators.push(sectionCitationsValidator({
+		sections: normalizedSections,
+		pattern: normalizedCitations.pattern,
+		flags: normalizedCitations.flags,
+		min: normalizedCitations.perSection,
+		name: "contract-section-citations"
+	}));
+	const promptLines = [];
+	if (normalizedSections !== void 0) promptLines.push("The final result must contain each of these section markers verbatim: " + normalizedSections.map((section) => `'${section}'`).join(", ") + ".");
+	if (normalizedWords !== void 0) {
+		const { min, max } = normalizedWords;
+		if (min !== void 0 && max !== void 0) promptLines.push(`The final result must be between ${String(min)} and ${String(max)} words (whitespace separated).`);
+		else if (min !== void 0) promptLines.push(`The final result must be at least ${String(min)} words (whitespace separated).`);
+		else if (max !== void 0) promptLines.push(`The final result must be at most ${String(max)} words (whitespace separated).`);
+	}
+	if (normalizedCitations !== void 0) {
+		if (normalizedCitations.min !== void 0) promptLines.push(`Include at least ${String(normalizedCitations.min)} citations matching /${normalizedCitations.pattern}/ overall (for example '${normalizedCitations.sample}').`);
+		if (normalizedCitations.perSection !== void 0) promptLines.push(`Every required section must itself contain at least ${String(normalizedCitations.perSection)} such citations.`);
+	}
+	const lines = [];
+	const perSection = normalizedCitations?.perSection ?? 0;
+	for (const section of normalizedSections ?? []) {
+		lines.push(section);
+		if (normalizedCitations !== void 0 && perSection > 0) {
+			const sample = normalizedCitations.sample;
+			lines.push(Array.from({ length: perSection }, () => sample).join(" "));
+		}
+	}
+	if (normalizedCitations !== void 0) {
+		const placed = (normalizedSections?.length ?? 0) * perSection;
+		const deficit = Math.max(0, (normalizedCitations.min ?? 0) - placed);
+		if (deficit > 0) {
+			const sample = normalizedCitations.sample;
+			lines.push(Array.from({ length: deficit }, () => sample).join(" "));
+		}
+	}
+	let goldenText = lines.join("\n");
+	const mandatoryWords = countWords(goldenText);
+	if (normalizedWords?.max !== void 0 && mandatoryWords > normalizedWords.max) throw new ConfigError(`finishContract is self contradictory: its mandatory content alone is ${String(mandatoryWords)} words, above words.max ${String(normalizedWords.max)}`);
+	if (normalizedWords?.min !== void 0 && mandatoryWords < normalizedWords.min) {
+		const padding = Array.from({ length: normalizedWords.min - mandatoryWords }, () => FILLER_WORD).join(" ");
+		goldenText = goldenText.length === 0 ? padding : `${goldenText}\n${padding}`;
+	}
+	const goldenAccept = Object.freeze({
+		result: goldenText,
+		text: goldenText,
+		children: Object.freeze([Object.freeze({
+			handle: 0,
+			nodeId: "contract-golden",
+			status: "ok",
+			text: goldenText
+		})])
+	});
+	const goldenReject = normalizedSections !== void 0 || normalizedWords?.min !== void 0 || normalizedCitations !== void 0 ? Object.freeze({
+		result: "",
+		text: "",
+		children: Object.freeze([])
+	}) : void 0;
+	return Object.freeze({
+		manifest: Object.freeze(normalized),
+		hash,
+		validators,
+		promptLines: Object.freeze(promptLines),
+		goldenAccept,
+		...goldenReject === void 0 ? {} : { goldenReject }
+	});
+}
+/**
+* Runs a configured validator set against golden fixtures BEFORE any
+* provider call exists (the v1.71 experiment review, P0.3): the accept
+* fixture must pass every validator (a stale validator rejecting a
+* correct skeleton is exactly the drift the experiment died of, three
+* renamed sections deep into a paid run), and the reject fixture must
+* fail at least one (a set that accepts the known-bad input validates
+* nothing). A validator that THROWS here is a host defect and the
+* ConfigError propagates, the same posture the live loop takes.
+* Deterministic and free: validators are pure synchronous host code by
+* contract, so this costs zero provider calls.
+*/
+function selfTestFinishValidation(options) {
+	const run = (validator, input) => {
+		try {
+			return validator.validate(input);
+		} catch (thrown) {
+			throw new ConfigError(`finish validator '${validator.name}' threw during the self test instead of returning a verdict: ${thrown instanceof Error ? thrown.message : String(thrown)}`);
+		}
+	};
+	const failures = [];
+	const accept = options.accept;
+	if (accept !== void 0) for (const validator of options.validators) {
+		const verdict = run(validator, accept);
+		if (!verdict.ok) failures.push({
+			fixture: "accept",
+			validator: validator.name,
+			reasons: verdict.reasons
+		});
+	}
+	const reject = options.reject;
+	if (reject !== void 0) {
+		if (!options.validators.some((validator) => !run(validator, reject).ok)) failures.push({
+			fixture: "reject",
+			reasons: ["every configured validator accepts the known-bad fixture; the validation is vacuous"]
+		});
+	}
+	return {
+		ok: failures.length === 0,
+		failures
+	};
+}
+//#endregion
 //#region src/orchestrator/orchestrate.ts
 /**
 * The mode (c) dynamic orchestrator (M6-T07/T08).
@@ -15192,6 +15653,26 @@ function validateOrchestrateOptions(opts) {
 			seen.add(validator.name);
 		}
 		if (fv.maxRepairs !== void 0) requireNonNegativeInteger(fv.maxRepairs, "orchestrate finishValidation.maxRepairs");
+		if (fv.repairTurnReserve !== void 0) requireNonNegativeInteger(fv.repairTurnReserve, "orchestrate finishValidation.repairTurnReserve");
+		const contract = fv.contract;
+		if (contract !== void 0) {
+			const shape = contract;
+			if (typeof shape.hash !== "string" || !Array.isArray(shape.validators) || !Array.isArray(shape.promptLines) || shape.goldenAccept === void 0) throw new ConfigError("orchestrate finishValidation.contract must be a finishContract(...) product");
+			for (const contractValidator of contract.validators) if (!seen.has(contractValidator.name)) throw new ConfigError(`orchestrate finishValidation.contract validator '${contractValidator.name}' is not in finishValidation.validators; spread contract.validators into the set so the promised contract is actually enforced`);
+		}
+		const selfTest = fv.selfTest;
+		if (selfTest !== void 0 && (typeof selfTest !== "object" || selfTest === null)) throw new ConfigError("orchestrate finishValidation.selfTest must be an object");
+		const acceptFixture = selfTest?.accept ?? contract?.goldenAccept;
+		const rejectFixture = selfTest?.reject ?? contract?.goldenReject;
+		if (selfTest !== void 0 && acceptFixture === void 0 && rejectFixture === void 0) throw new ConfigError("orchestrate finishValidation.selfTest requires an accept or reject fixture");
+		if (acceptFixture !== void 0 || rejectFixture !== void 0) {
+			const report = selfTestFinishValidation({
+				validators: fv.validators,
+				...acceptFixture === void 0 ? {} : { accept: acceptFixture },
+				...rejectFixture === void 0 ? {} : { reject: rejectFixture }
+			});
+			if (!report.ok) throw new ConfigError("the finish validation self test failed BEFORE any provider call: " + report.failures.map((failure) => failure.validator === void 0 ? failure.reasons.join("; ") : `validator '${failure.validator}' rejected the accept fixture: ` + failure.reasons.join("; ")).join("; "));
+		}
 	}
 	if (opts.synthesis !== void 0) {
 		const synthesis = opts.synthesis;
@@ -15240,7 +15721,11 @@ function finishValidationPromptLines(spec) {
 	if (spec === void 0) return [];
 	const names = spec.validators.map((validator) => validator.name).join(", ");
 	const repairs = spec.maxRepairs ?? 1;
-	return [`The host validates every finish({ result }) with deterministic validators: ${names}.`, "A rejected finish returns the failure reasons as the tool error result; repair the result and call finish again. " + (repairs === 0 ? "No repair attempt is granted: the first rejected finish fails the run." : repairs === 1 ? "At most one repair attempt is granted before the run fails." : `At most ${String(repairs)} repair attempts are granted before the run fails.`)];
+	return [
+		`The host validates every finish({ result }) with deterministic validators: ${names}.`,
+		...spec.contract === void 0 ? [] : spec.contract.promptLines,
+		"A rejected finish returns the failure reasons as the tool error result; repair the result and call finish again. " + (repairs === 0 ? "No repair attempt is granted: the first rejected finish fails the run." : repairs === 1 ? "At most one repair attempt is granted before the run fails." : `At most ${String(repairs)} repair attempts are granted before the run fails.`)
+	];
 }
 /**
 * The partial-salvage contract rides the PROMPT exactly like finish
@@ -16229,6 +16714,37 @@ function makeOrchestratorWorkflow(goal, opts) {
 				}
 			};
 		};
+		/**
+		* The frozen bundle descriptor (the v1.71 experiment review,
+		* P0.2): with a contract configured, the run durably records WHAT
+		* validates it. One decision entry per distinct contract hash, in
+		* supersession order: a resume under the SAME contract appends
+		* nothing (the descriptor already exists), and a resume under a
+		* FIXED contract appends a superseding descriptor instead of
+		* failing, because repairing a stale validator and resuming is the
+		* intended remedy. No contract (or no validators at all) keeps the
+		* journal byte identical, awaits included.
+		*/
+		if (validationSpec?.contract !== void 0) {
+			const bundles = internals.replayer.snapshot().filter((entry) => entry.kind === "decision" && entry.scope === callingState.scope && entry.value?.decisionType === "orchestrator_finish_validation_bundle").map((entry) => entry.value);
+			const last = bundles.at(-1);
+			if (last?.contractHash !== validationSpec.contract.hash) await internals.replayer.appendSinglePhase({
+				scope: callingState.scope,
+				key: `finish-validation-bundle:${String(bundles.length)}`,
+				kind: "decision",
+				status: "ok",
+				spanId: internals.spans.mint(callingState.spanId),
+				site: "orchestrator-finish-validation-bundle",
+				value: {
+					decisionType: "orchestrator_finish_validation_bundle",
+					ordinal: bundles.length,
+					contractHash: validationSpec.contract.hash,
+					validators: validationSpec.validators.map((validator) => validator.name),
+					maxRepairs: validationSpec.maxRepairs ?? 1,
+					...last?.contractHash === void 0 ? {} : { supersedes: last.contractHash }
+				}
+			});
+		}
 		const agentOpts = {
 			role: "orchestrate",
 			result: "full",
@@ -16243,7 +16759,10 @@ function makeOrchestratorWorkflow(goal, opts) {
 			},
 			[kTerminalTool]: {
 				name: FINISH_TOOL_NAME,
-				...validationSpec === void 0 || opts?.synthesis !== void 0 ? {} : { validate: validateFinish }
+				...validationSpec === void 0 || opts?.synthesis !== void 0 ? {} : {
+					validate: validateFinish,
+					...validationSpec.repairTurnReserve === void 0 ? {} : { repairTurnReserve: validationSpec.repairTurnReserve }
+				}
 			},
 			...(() => {
 				const priorCancelledRoot = internals.replayer.snapshot().filter((entry) => entry.kind === "agent" && entry.scope === callingState.scope && entry.status === "cancelled" && entry.checkpointRef !== void 0).at(-1);
@@ -16543,7 +17062,10 @@ function makeOrchestratorWorkflow(goal, opts) {
 				...spec.estCost === void 0 ? {} : { estCost: spec.estCost },
 				[kTerminalTool]: {
 					name: FINISH_TOOL_NAME,
-					...validationSpec === void 0 ? {} : { validate: validateFinish }
+					...validationSpec === void 0 ? {} : {
+						validate: validateFinish,
+						...validationSpec.repairTurnReserve === void 0 ? {} : { repairTurnReserve: validationSpec.repairTurnReserve }
+					}
 				}
 			};
 			const synthesized = await runtime.runInScope(synthesisState, () => ctx.agent(prompt, synthesisOpts));
@@ -16623,7 +17145,40 @@ function makeOrchestratorWorkflow(goal, opts) {
 		if (validationTermination !== void 0) throw validationTermination;
 		if (orchestratorAccount !== void 0) internals.cost.orchestrator.spentUsd = internals.budget.accountView(orchestratorAccount)?.spentUsd ?? 0;
 		if (result.status !== "ok") throw new ConfigError(`the orchestrator agent terminated with status '${result.status}'` + (result.errorMessage === void 0 ? "" : `: ${result.errorMessage}`));
-		if (opts?.acceptance === void 0) return await runSynthesis(result.output);
+		/**
+		* The synthesis failure enrichment (the v1.71 experiment review,
+		* P0.8 remainder + P1.7): every typed failure a synthesis
+		* invocation throws gains the verdict-derived repair taxonomy read
+		* from the JOURNALED validation decisions (identical live and on
+		* replay), and, when an acceptance verdict exists, the acceptance
+		* snapshot the children already earned; the completion mirror then
+		* lifts completion and childStatusCounts onto the error outcome,
+		* exactly like the acceptance rejection path. The experiment's
+		* outcome showed completion null beside four accepted children;
+		* these are the fields that say "the fan-out work is complete, the
+		* failure is downstream". The rejection-past-the-bound error keeps
+		* its own repairsUsed/maxRepairs/failed untouched.
+		*/
+		const enrichSynthesisFailure = (thrown, snapshot) => {
+			if (!(thrown instanceof FailRunError)) throw thrown;
+			const base = thrown.data ?? {};
+			const spent = validationDecisions().filter((candidate) => candidate.verdict !== "accepted");
+			const rejectedValidators = [...new Set(spent.flatMap((candidate) => candidate.failed.map((f) => f.name)))];
+			throw new FailRunError(thrown.message, { data: {
+				...base,
+				...snapshot ?? {},
+				...spent.length === 0 || base.repairsUsed !== void 0 ? {} : {
+					repairsUsed: spent.length,
+					maxRepairs: validationSpec?.maxRepairs ?? 1,
+					rejectedValidators
+				}
+			} });
+		};
+		if (opts?.acceptance === void 0) try {
+			return await runSynthesis(result.output);
+		} catch (thrown) {
+			return enrichSynthesisFailure(thrown);
+		}
 		const acceptanceKey = "acceptance";
 		const priorAcceptance = internals.replayer.snapshot().find((entry) => entry.kind === "decision" && entry.scope === callingState.scope && entry.key === acceptanceKey);
 		let decision;
@@ -16696,8 +17251,17 @@ function makeOrchestratorWorkflow(goal, opts) {
 				...decision.synthesisSkipped === void 0 ? {} : { synthesisSkipped: decision.synthesisSkipped }
 			} });
 		}
+		let synthesizedFinal;
+		try {
+			synthesizedFinal = await runSynthesis(result.output);
+		} catch (thrown) {
+			enrichSynthesisFailure(thrown, {
+				completion: decision.completion,
+				childStatusCounts: decision.childStatusCounts
+			});
+		}
 		return {
-			result: await runSynthesis(result.output),
+			result: synthesizedFinal,
 			completion: decision.completion,
 			childStatusCounts: decision.childStatusCounts,
 			degradedReasons: decision.degradedReasons,
@@ -16838,6 +17402,8 @@ function preflightEstimate(input) {
 	const maxDepth = engine.budgetDefaults?.maxDepth ?? 1;
 	const perRun = engine.concurrency?.perRun ?? 12;
 	const runLimits = mergeUsageLimits(void 0, input.run?.limits, defaults.limits);
+	const finishRepairReserve = input.finishValidation?.repairTurnReserve ?? 0;
+	const coordinationRepairReserve = input.orchestrator?.synthesis === void 0 ? finishRepairReserve : 0;
 	let orchestratorEcho;
 	let reservedForFinalizationUsd = 0;
 	let effectiveCapUsd;
@@ -16858,7 +17424,7 @@ function preflightEstimate(input) {
 			finalizeReserveUsd,
 			finalizeTurns,
 			reserveCommitted,
-			projectedProviderTurns: projectedProviderTurnsOf(echoLimits, overallExecutedCeiling(echoLimits, toolCeilingsOf(echoLimits)))
+			projectedProviderTurns: projectedProviderTurnsOf(echoLimits, overallExecutedCeiling(echoLimits, toolCeilingsOf(echoLimits))) + coordinationRepairReserve
 		};
 		if (spec?.capUsd !== void 0 && spec.capFraction === void 0 && effectiveCapUsd !== void 0 && effectiveCapUsd < spec.capUsd) say({
 			severity: "warning",
@@ -17076,7 +17642,7 @@ function preflightEstimate(input) {
 				model,
 				inputFloor: input.orchestrator.estInputTokens ?? 0,
 				outputBound: outputBound ?? 0,
-				turns: projectedProviderTurnsOf(orchLimits, overallExecutedCeiling(orchLimits, toolCeilingsOf(orchLimits))),
+				turns: projectedProviderTurnsOf(orchLimits, overallExecutedCeiling(orchLimits, toolCeilingsOf(orchLimits))) + coordinationRepairReserve,
 				count: 1
 			});
 			if (effectiveCapUsd !== void 0) orchestratorReserveUsd = Math.max(0, orchestratorAdmissionEstCostUsd(effectiveCapUsd, reservedForFinalizationUsd));
@@ -17088,6 +17654,38 @@ function preflightEstimate(input) {
 				flatReserveUsd
 			});
 		}
+		if (input.orchestrator.synthesis !== void 0) {
+			const synthesis = input.orchestrator.synthesis;
+			if (synthesis.limits !== void 0) validateUsageLimits(synthesis.limits, "preflight orchestrator.synthesis.limits");
+			if (synthesis.estInputTokens !== void 0) requireNonNegativeInteger(synthesis.estInputTokens, "preflight orchestrator.synthesis.estInputTokens");
+			const servedBy = resolveServing(synthesis.model) ?? resolveServing(defaults.routing?.synthesize);
+			if (servedBy === void 0) say({
+				severity: "error",
+				code: "unrouted-role",
+				message: "the synthesis invocation resolves no model for role 'synthesize': set defaults.routing.synthesize or a synthesis model on the call",
+				spawn: "synthesis"
+			});
+			else {
+				const caps = capsOf(servedBy);
+				const merged = mergeUsageLimits(synthesis.limits ?? { maxTurns: 4 }, void 0, defaults.limits);
+				const outputBound = caps === void 0 ? merged.maxOutputTokensPerTurn : merged.maxOutputTokensPerTurn === void 0 ? caps.maxOutputTokens : Math.min(caps.maxOutputTokens, merged.maxOutputTokensPerTurn);
+				const projected = projectedProviderTurnsOf(merged, overallExecutedCeiling(merged, toolCeilingsOf(merged))) + finishRepairReserve;
+				if (orchestratorEcho !== void 0) orchestratorEcho.synthesis = {
+					projectedProviderTurns: projected,
+					servedBy
+				};
+				const { adapterId, model } = parseModelRef(servedBy);
+				shapes.push({
+					label: "synthesis",
+					provider: adapterId,
+					model,
+					inputFloor: synthesis.estInputTokens ?? 0,
+					outputBound: outputBound ?? 0,
+					turns: projected,
+					count: 1
+				});
+			}
+		}
 	}
 	const wave = [];
 	let committed = 0;
@@ -17275,6 +17873,55 @@ function preflightEstimate(input) {
 		requests: 0,
 		tokens: 0
 	});
+	/**
+	* The finish validation self test (the v1.71 experiment review,
+	* P1.1): the SAME golden checks orchestrate runs at construction,
+	* reported as error findings instead of throws. The experiment's
+	* initial preflight was silent while a stale validator waited to
+	* reject every correct answer; with the contract declared here, that
+	* drift is a red finding before the first paid call.
+	*/
+	let finishValidationEcho;
+	if (input.finishValidation !== void 0) {
+		const fv = input.finishValidation;
+		if (!Array.isArray(fv.validators) || fv.validators.length === 0) throw new ConfigError("preflight finishValidation.validators must be a non empty array of validators");
+		const names = /* @__PURE__ */ new Set();
+		for (const candidate of fv.validators) {
+			const validator = candidate;
+			if (typeof validator.name !== "string" || validator.name.length === 0) throw new ConfigError("every preflight finish validator must carry a non empty name");
+			if (typeof validator.validate !== "function") throw new ConfigError(`preflight finish validator '${validator.name}' has no validate function`);
+			names.add(validator.name);
+		}
+		if (fv.repairTurnReserve !== void 0) requireNonNegativeInteger(fv.repairTurnReserve, "preflight finishValidation.repairTurnReserve");
+		if (fv.contract !== void 0) {
+			for (const contractValidator of fv.contract.validators) if (!names.has(contractValidator.name)) findings.push({
+				severity: "error",
+				code: "output-contract-validator-mismatch",
+				message: `contract validator '${contractValidator.name}' is not in the configured validator set; the promised contract is not enforced`
+			});
+		}
+		const acceptFixture = fv.selfTest?.accept ?? fv.contract?.goldenAccept;
+		const rejectFixture = fv.selfTest?.reject ?? fv.contract?.goldenReject;
+		let selfTestOutcome = "skipped";
+		if (acceptFixture !== void 0 || rejectFixture !== void 0) {
+			const report = selfTestFinishValidation({
+				validators: fv.validators,
+				...acceptFixture === void 0 ? {} : { accept: acceptFixture },
+				...rejectFixture === void 0 ? {} : { reject: rejectFixture }
+			});
+			selfTestOutcome = report.ok ? "passed" : "failed";
+			for (const failure of report.failures) findings.push({
+				severity: "error",
+				code: "output-contract-validator-mismatch",
+				message: failure.validator === void 0 ? failure.reasons.join("; ") : `validator '${failure.validator}' rejected the golden accept fixture: ` + failure.reasons.join("; ")
+			});
+		}
+		finishValidationEcho = {
+			...fv.contract === void 0 ? {} : { contractHash: fv.contract.hash },
+			validators: fv.validators.map((validator) => validator.name),
+			selfTest: selfTestOutcome
+		};
+	}
 	const severityRank = {
 		error: 0,
 		warning: 1,
@@ -17314,6 +17961,7 @@ function preflightEstimate(input) {
 			perProvider,
 			...runCeiling === void 0 ? {} : { runCeiling }
 		},
+		...finishValidationEcho === void 0 ? {} : { finishValidation: finishValidationEcho },
 		findings
 	};
 }
@@ -17416,163 +18064,6 @@ var KeyedLimiter = class {
 	}
 };
 //#endregion
-//#region src/orchestrator/finish-validators.ts
-/**
-* Deterministic host validation of the orchestrator finish result (the
-* v1.40.0 improvement plan's RV-204 slice). A validator is plain
-* synchronous host code judging the finish({ result }) argument; the
-* orchestrator runtime runs the configured set on every schema valid
-* finish call, returns the failure reasons to the model as the call's
-* error tool result (a bounded repair turn), and fails the run with a
-* typed error when the repair bound is exhausted. Verdicts journal as
-* decision entries, so a resume rolls the SAME verdicts forward without
-* re-running validator code.
-*/
-const ok = { ok: true };
-function requireNonEmptyStrings(values, what) {
-	if (!Array.isArray(values) || values.length === 0) throw new ConfigError(`${what} must be a non empty array of strings`);
-	for (const value of values) if (typeof value !== "string" || value.length === 0) throw new ConfigError(`${what} must contain only non empty strings`);
-	return values;
-}
-/**
-* Requires every named section to appear LITERALLY in the result text
-* (a heading like 'FINDINGS' or any marker the goal demands). Default
-* name 'required-sections'; pass `name` to run several instances.
-*/
-function requiredSectionsValidator(options) {
-	const sections = requireNonEmptyStrings(options.sections, "requiredSectionsValidator sections");
-	return {
-		name: options.name ?? "required-sections",
-		validate: (input) => {
-			const missing = sections.filter((section) => !input.text.includes(section));
-			return missing.length === 0 ? ok : {
-				ok: false,
-				reasons: missing.map((section) => `required section '${section}' is missing`)
-			};
-		}
-	};
-}
-/**
-* Requires the result to be a JSON object carrying every named field
-* with a substantial value: present, not null, and not an empty or
-* whitespace only string (empty arrays, zero, and false COUNT as
-* present; emptiness rules beyond strings belong to a custom
-* validator). Default name 'required-fields'.
-*/
-function requiredFieldsValidator(options) {
-	const fields = requireNonEmptyStrings(options.fields, "requiredFieldsValidator fields");
-	return {
-		name: options.name ?? "required-fields",
-		validate: (input) => {
-			const result = input.result;
-			if (typeof result !== "object" || result === null || Array.isArray(result)) return {
-				ok: false,
-				reasons: ["the finish result is not a JSON object"]
-			};
-			const record = result;
-			const reasons = [];
-			for (const field of fields) {
-				const value = record[field];
-				if (value === void 0 || value === null) reasons.push(`required field '${field}' is missing`);
-				else if (typeof value === "string" && value.trim().length === 0) reasons.push(`required field '${field}' is empty`);
-			}
-			return reasons.length === 0 ? ok : {
-				ok: false,
-				reasons
-			};
-		}
-	};
-}
-/** The default citation shape: a path with an extension, a colon, a line number. */
-const DEFAULT_CITATION_PATTERN = "[\\w./-]+\\.\\w+:\\d+";
-/** The default preserved share, the improvement plan's RV-202 gate. */
-const DEFAULT_EVIDENCE_MIN_SHARE = .95;
-const MAX_LISTED_CITATIONS = 20;
-function listCitations(values) {
-	return values.length <= MAX_LISTED_CITATIONS ? values.join(", ") : `${values.slice(0, MAX_LISTED_CITATIONS).join(", ")} and ${String(values.length - MAX_LISTED_CITATIONS)} more`;
-}
-/**
-* The RV-202 evidence preservation contract: the finish result must
-* PRESERVE the citations the children actually produced. Distinct
-* matches of `pattern` are collected across the outputs of children
-* settled 'ok' (spawn order); at least `minShare` of them (default
-* {@link DEFAULT_EVIDENCE_MIN_SHARE}, the plan's 95 percent gate,
-* compared as a ceiling on the required count so an exact boundary like
-* 19 of 20 passes) must appear literally in the result text. Zero child
-* citations pass vacuously. With `requireKnown: true` the contract also
-* runs in reverse: every citation in the RESULT must appear in some
-* child's output, so a fabricated but pattern valid citation is
-* rejected instead of silently counting as evidence. Rejection reasons
-* list the missing (and unknown) citations, capped at 20, so the repair
-* turn can restore them. Purely textual and deterministic; checking
-* that cited targets EXIST on disk is host territory (a custom
-* validator), not this contract. Default name 'evidence-preserved'.
-*/
-function evidencePreservedValidator(options) {
-	const pattern = options?.pattern ?? "[\\w./-]+\\.\\w+:\\d+";
-	const flags = options?.flags ?? "";
-	const globalFlags = flags.includes("g") ? flags : `${flags}g`;
-	try {
-		new RegExp(pattern, globalFlags);
-	} catch (thrown) {
-		throw new ConfigError(`evidencePreservedValidator pattern does not compile: ${thrown instanceof Error ? thrown.message : String(thrown)}`);
-	}
-	const minShare = options?.minShare ?? .95;
-	if (typeof minShare !== "number" || !Number.isFinite(minShare) || minShare <= 0 || minShare > 1) throw new ConfigError(`evidencePreservedValidator minShare must be a number in (0, 1]; got ${String(minShare)}`);
-	return {
-		name: options?.name ?? "evidence-preserved",
-		validate: (input) => {
-			const cited = /* @__PURE__ */ new Set();
-			for (const child of input.children ?? []) {
-				if (child.status !== "ok" && child.salvageableOutput !== true) continue;
-				for (const match of child.text.match(new RegExp(pattern, globalFlags)) ?? []) cited.add(match);
-			}
-			const reasons = [];
-			if (cited.size > 0) {
-				const missing = [...cited].filter((citation) => !input.text.includes(citation));
-				const preserved = cited.size - missing.length;
-				if (preserved < Math.ceil(minShare * cited.size - 1e-9)) reasons.push(`evidence preservation ${String(preserved)} of ${String(cited.size)} child citations is below the required share ${String(minShare)}; missing: ${listCitations(missing)}`);
-			}
-			if (options?.requireKnown === true) {
-				const fabricated = [...new Set(input.text.match(new RegExp(pattern, globalFlags)) ?? [])].filter((citation) => !cited.has(citation));
-				if (fabricated.length > 0) reasons.push(`unknown citations not present in any child report: ${listCitations(fabricated)}`);
-			}
-			return reasons.length === 0 ? ok : {
-				ok: false,
-				reasons
-			};
-		}
-	};
-}
-/**
-* Requires at least `min` matches of `pattern` in the result text (the
-* plan's citation and source count checks: a file:line pattern, a URL
-* pattern). The pattern compiles at construction (invalid patterns are a
-* ConfigError before any run exists) and matches globally; `min` is a
-* positive integer. Default name 'min-matches'; pass `name` to run
-* several instances, because names must be unique per orchestrate call.
-*/
-function minMatchesValidator(options) {
-	const flags = options.flags ?? "";
-	const globalFlags = flags.includes("g") ? flags : `${flags}g`;
-	try {
-		new RegExp(options.pattern, globalFlags);
-	} catch (thrown) {
-		throw new ConfigError(`minMatchesValidator pattern does not compile: ${thrown instanceof Error ? thrown.message : String(thrown)}`);
-	}
-	if (!Number.isInteger(options.min) || options.min < 1) throw new ConfigError(`minMatchesValidator min must be a positive integer; got ${String(options.min)}`);
-	return {
-		name: options.name ?? "min-matches",
-		validate: (input) => {
-			const found = input.text.match(new RegExp(options.pattern, globalFlags))?.length ?? 0;
-			return found >= options.min ? ok : {
-				ok: false,
-				reasons: [`expected at least ${String(options.min)} matches of /${options.pattern}/${flags}; found ${String(found)}`]
-			};
-		}
-	};
-}
-//#endregion
 //#region src/engine/events.ts
 /**
 * Per-run event machinery (M1-T10): the span registry (run > phase >
@@ -19250,4 +19741,4 @@ function createSandboxBridge(ctx, options) {
 	};
 }
 //#endregion
-export { AWAIT_SCHEMA, AdmissionController, AdmissionRejectedError, AgentCallError, BUDGET_ABORT_REASON, BudgetExhaustedError, CANCEL_AGENT_SCHEMA, CHECKPOINT_FORMAT_V1, CLAIM_STATEMENT_MAX_CHARS, CLAIM_TTL_DAYS, COMPACTION_SUMMARY_PREFIX, CURRENT_HASH_VERSION, ConfigError, DEFAULT_CHILD_BUDGET_FRACTION, DEFAULT_CHILD_RESULT_PAGE_CHARS, DEFAULT_CITATION_PATTERN, DEFAULT_COMPACTION_THRESHOLD, DEFAULT_ESCALATION_LIMITS, DEFAULT_EVIDENCE_MIN_SHARE, DEFAULT_FINISH_MAX_REPAIRS, DEFAULT_FLAT_RESERVE_USD, DEFAULT_MAX_CHILDREN_PER_NODE, DEFAULT_MAX_DEPTH, DEFAULT_MAX_OSCILLATIONS_PER_KEY, DEFAULT_MAX_PINNED_WORKTREES, DEFAULT_MAX_REVISIONS_PER_RUN, DEFAULT_MAX_TOTAL_SPAWNS, DEFAULT_MAX_TURNS, DEFAULT_MODEL_RETRY_ATTEMPTS, DEFAULT_NO_PROGRESS_TURNS, DEFAULT_PER_RUN_CONCURRENCY, DEFAULT_RETRY_POLICY, DEFAULT_STREAM_IDLE_TIMEOUT_MS, DEFAULT_SYNTHESIS_MAX_TURNS, DEFAULT_SYNTHESIS_NOTE_MAX_TURNS, DedupIndex, DeterminismError, EMIT_RESULT_TOOL, EMPTY_SCHEMA_HASH, EMPTY_TOOLSET_HASH, ESCALATE_TOOL_NAME, ESCALATION_REPORT_SCHEMA, ESCALATION_REQUEST_SCHEMA, EVENT_SEGMENT_STRIDE, EscalationDecisionAbortedError, EventBus, ExternalRegistry, FINALIZE_SYNTHESIS_INSTRUCTION, FINISH_SCHEMA, FINISH_TOOL_NAME, FailRunError, FileModelKnowledgeStore, FileTranscriptStore, GET_CHILD_RESULT_SCHEMA, GET_CHILD_RESULT_TOOL_NAME, GitWorktreeProvider, IMPLEMENTATION_PROFILE_LIMITS, INBOX_PROPOSAL_TTL_DAYS, InMemoryStore, InMemoryTranscriptStore, InProcessRunner, InvalidResolutionError, JOURNAL_ENVELOPE_MARKER, JournalCompatibilityError, JournalMatcher, JournalMissError, JournalOrderViolation, JsonlFileStore, KB_ACTIVE_CLAIMS_CAP, KB_CARD_RENDER_BUDGET_CHARS, KeyedLimiter, KnowledgeCasError, LARGE_VALUE_WARN_BYTES, LEGACY_LTID_PREFIX, LEGACY_SIGNATURE_INPUTS, LINEAGE_SIG_VERSION, LeaseHeldError, LineageIndex, MASKED_SECRET, MAX_CHILD_RESULT_PAGE_CHARS, MAX_DEPTH_CEILING, ModelRetry, NoProgressDetector, NonSerializableValueError, ORCHESTRATE_WORKFLOW_NAME, OrchestratorCapConfigError, PARALLEL_AGENTS_SCHEMA, PROGRESS_REPORT_TOOL_NAME, ParallelSiteCounter, PlanInvariantError, QUOTA_WINDOW_MS, READ_CHILD_ARTIFACT_SCHEMA, READ_CHILD_ARTIFACT_TOOL_NAME, RESEARCH_PROFILE_LIMITS, REVIEW_PROFILE_LIMITS, ROLE_EFFORT_DEFAULTS, ROOT_ACCOUNT, ROOT_SCOPE, RUN_PROFILES, RUN_SETTLE_DECISION_TYPE, ReplayPlanHashMismatch, Replayer, ResolutionArbiter, ResolutionFold, RulvarError, RunBudget, SANDBOX_AGENT_OPT_KEYS, SPAWN_AGENT_SCHEMA, SandboxError, ScriptRejected, Semaphore, SettlementError, SpanRegistry, TOOL_NAME_PATTERN, TerminationAccount, WAIT_FOR_EVENTS_SCHEMA, WAIT_FOR_EVENTS_TOOL_NAME, WAKE_SUMMARY_RENDER_BUDGET_CHARS, admissionReserveUsd, affordableOutputTokens, agentErrorFromWire, agentErrorToWire, agentResultWire, agentScope, applyClaimOps, applyStructuredOutputTier, approachSigCoarse, approachSigOf, archiveDeprecatedModelOps, assertFencedWrites, atCompactionThreshold, auditRun, auditRuns, buildAbandonFold, buildAdapterRegistry, buildCostReport, buildDeriverRegistry, buildOrchestratorTools, buildTerminationInitValue, buildToolContext, canRideLoopTurn, canonicalIsolationTag, canonicalizeLadder, canonicalizeSchema, capIssues, capsHashOf, checkFloors, checkpointRefFor, childCoveragePrefix, claimExpired, claimExpiry, claimIssues, claimOpIssues, classifyAgentError, classifyAttemptOutcome, collectDeclaredLadders, compactMessages, compilePermissionChain, compilePermissionPreset, compileSecretMasker, compileVerifiedLayer, constantTimeEqual, costReportFromJournal, countsAgainstLimit, createCanonicalIdMinter, createCtx, createEngine, createEnvelopeEncryption, createSandboxBridge, currentOnlyKeyRing, decodeCheckpoint, dedupeRepeatedClaims, defineWorkflow, deriveContentKey, deriverV1, deriverV2, digestOf, dispatchProjectionReserveUsd, dispositionHook, emptyDigestBlocks, emptyToolset, encodeCheckpoint, entryUsageSlices, escalateTool, evaluatePermission, evaluateReuse, evidencePreservedValidator, executeWorkflow, exhaustionCodeOf, extractCandidate, failoverTriggerOf, fallbackTriggerOf, filterClaimsForRun, finalizeFires, foldTermination, formatRePrompt, formatScopePath, hasFencedWrites, hasMetaLookup, hashRunArgs, hashRunOutput, hashWorkflowBody, hashWorkflowSource, identityJcs, implementationAgentProfile, invoiceFromJournal, isEscalated, isSchemaPairSpec, isStandardSchemaSpec, isStrictCompatibleSchema, kMaxOf, knowledgeHash, ladderLengthOf, ladderRungChoice, lastRunSettle, latestProgressReport, lexShellCommand, liftRetainedParts, lineageWeightOf, localKeyProvider, makeOrchestratorWorkflow, maskSecrets, maskSecretsDeep, maskSecretsJson, matchArgvPattern, matchShellCommand, mcp, memoryQuotaLimiter, mergeQuotaDenial, mergeUsageLimits, metaMatchesFilter, minMatchesValidator, modelEpochOf, modelKnowledgeCard, modelSpecIdentity, needsSeparateExtract, nextFailover, nodeLinkKey, normalizeApproachTag, normalizeEntry, normalizeFallbacks, orchestrate, orchestratorAdmissionEstCostUsd, parallelScope, parseModelRef, parseScopePath, phiInitialOf, pipelineScope, planNodeScope, preflightEstimate, priceEntryUsage, priceUsdOf, profileCard, profileRegistrySnapshotHash, progressReportTool, projectHistory, projectIdentity, projectToJsonSchema, proposalStatement, providerOf, quotaActualTokens, quotaEstimateTokens, quotaRuleAdmission, quotaRuleMatches, readRunMeta, readTerminationInit, reconcileRunMeta, reduceAuditTrail, reduceCriticalPath, reduceInvocationTable, registryKeyRing, remeasureQueue, replayDisposition, repositoryResearchToolset, requiredFieldsValidator, requiredSectionsValidator, researchAgentProfile, resolveModelInvocation, resolvePricing, resolveToolset, retryClassOf, retryDelayMs, reviewAgentProfile, roleConfiguredInRouting, roundOneDisposition, runAgent, runProfile, sanitizeTerminalText, sanitizeTokenCount, sanitizeUsage, sanitizeUsageDelta, scanJournalCompatibility, schemaHash, schemaHashOfSpec, selectStructuredOutputTier, shouldCompact, snapshotUsage, spawnDepthOf, summarizeInstruction, summarizeOutput, terminationConfigDrift, tierWithinCaps, toApprovalDecision, toJournalValue, tool, toolContract, toolsetHash, ttlState, usageViolations, validateEditorialCommit, validateEngineQuotaConfig, validateEntryShape, validateEscalationLimits, validateEscalationReport, validateQuotaRules, validateRetryPolicy, validateSchemaSpec, validateTerminationLimits, validateUsageLimits, workflowScope, workflowSourceRef, wrapJournalStore, wrapTranscriptStore };
+export { AWAIT_SCHEMA, AdmissionController, AdmissionRejectedError, AgentCallError, BUDGET_ABORT_REASON, BudgetExhaustedError, CANCEL_AGENT_SCHEMA, CHECKPOINT_FORMAT_V1, CLAIM_STATEMENT_MAX_CHARS, CLAIM_TTL_DAYS, COMPACTION_SUMMARY_PREFIX, CURRENT_HASH_VERSION, ConfigError, DEFAULT_CHILD_BUDGET_FRACTION, DEFAULT_CHILD_RESULT_PAGE_CHARS, DEFAULT_CITATION_PATTERN, DEFAULT_CITATION_SAMPLE, DEFAULT_COMPACTION_THRESHOLD, DEFAULT_ESCALATION_LIMITS, DEFAULT_EVIDENCE_MIN_SHARE, DEFAULT_FINISH_MAX_REPAIRS, DEFAULT_FLAT_RESERVE_USD, DEFAULT_MAX_CHILDREN_PER_NODE, DEFAULT_MAX_DEPTH, DEFAULT_MAX_OSCILLATIONS_PER_KEY, DEFAULT_MAX_PINNED_WORKTREES, DEFAULT_MAX_REVISIONS_PER_RUN, DEFAULT_MAX_TOTAL_SPAWNS, DEFAULT_MAX_TURNS, DEFAULT_MODEL_RETRY_ATTEMPTS, DEFAULT_NO_PROGRESS_TURNS, DEFAULT_PER_RUN_CONCURRENCY, DEFAULT_RETRY_POLICY, DEFAULT_STREAM_IDLE_TIMEOUT_MS, DEFAULT_SYNTHESIS_MAX_TURNS, DEFAULT_SYNTHESIS_NOTE_MAX_TURNS, DedupIndex, DeterminismError, EMIT_RESULT_TOOL, EMPTY_SCHEMA_HASH, EMPTY_TOOLSET_HASH, ESCALATE_TOOL_NAME, ESCALATION_REPORT_SCHEMA, ESCALATION_REQUEST_SCHEMA, EVENT_SEGMENT_STRIDE, EscalationDecisionAbortedError, EventBus, ExternalRegistry, FINALIZE_SYNTHESIS_INSTRUCTION, FINISH_SCHEMA, FINISH_TOOL_NAME, FailRunError, FileModelKnowledgeStore, FileTranscriptStore, GET_CHILD_RESULT_SCHEMA, GET_CHILD_RESULT_TOOL_NAME, GitWorktreeProvider, IMPLEMENTATION_PROFILE_LIMITS, INBOX_PROPOSAL_TTL_DAYS, InMemoryStore, InMemoryTranscriptStore, InProcessRunner, InvalidResolutionError, JOURNAL_ENVELOPE_MARKER, JournalCompatibilityError, JournalMatcher, JournalMissError, JournalOrderViolation, JsonlFileStore, KB_ACTIVE_CLAIMS_CAP, KB_CARD_RENDER_BUDGET_CHARS, KeyedLimiter, KnowledgeCasError, LARGE_VALUE_WARN_BYTES, LEGACY_LTID_PREFIX, LEGACY_SIGNATURE_INPUTS, LINEAGE_SIG_VERSION, LeaseHeldError, LineageIndex, MASKED_SECRET, MAX_CHILD_RESULT_PAGE_CHARS, MAX_DEPTH_CEILING, ModelRetry, NoProgressDetector, NonSerializableValueError, ORCHESTRATE_WORKFLOW_NAME, OrchestratorCapConfigError, PARALLEL_AGENTS_SCHEMA, PROGRESS_REPORT_TOOL_NAME, ParallelSiteCounter, PlanInvariantError, QUOTA_WINDOW_MS, READ_CHILD_ARTIFACT_SCHEMA, READ_CHILD_ARTIFACT_TOOL_NAME, RESEARCH_PROFILE_LIMITS, REVIEW_PROFILE_LIMITS, ROLE_EFFORT_DEFAULTS, ROOT_ACCOUNT, ROOT_SCOPE, RUN_PROFILES, RUN_SETTLE_DECISION_TYPE, ReplayPlanHashMismatch, Replayer, ResolutionArbiter, ResolutionFold, RulvarError, RunBudget, SANDBOX_AGENT_OPT_KEYS, SPAWN_AGENT_SCHEMA, SandboxError, ScriptRejected, Semaphore, SettlementError, SpanRegistry, TOOL_NAME_PATTERN, TerminationAccount, WAIT_FOR_EVENTS_SCHEMA, WAIT_FOR_EVENTS_TOOL_NAME, WAKE_SUMMARY_RENDER_BUDGET_CHARS, admissionReserveUsd, affordableOutputTokens, agentErrorFromWire, agentErrorToWire, agentResultWire, agentScope, applyClaimOps, applyStructuredOutputTier, approachSigCoarse, approachSigOf, archiveDeprecatedModelOps, assertFencedWrites, atCompactionThreshold, auditRun, auditRuns, buildAbandonFold, buildAdapterRegistry, buildCostReport, buildDeriverRegistry, buildOrchestratorTools, buildTerminationInitValue, buildToolContext, canRideLoopTurn, canonicalIsolationTag, canonicalizeLadder, canonicalizeSchema, capIssues, capsHashOf, checkFloors, checkpointRefFor, childCoveragePrefix, claimExpired, claimExpiry, claimIssues, claimOpIssues, classifyAgentError, classifyAttemptOutcome, collectDeclaredLadders, compactMessages, compilePermissionChain, compilePermissionPreset, compileSecretMasker, compileVerifiedLayer, constantTimeEqual, costReportFromJournal, countsAgainstLimit, createCanonicalIdMinter, createCtx, createEngine, createEnvelopeEncryption, createSandboxBridge, currentOnlyKeyRing, decodeCheckpoint, dedupeRepeatedClaims, defineWorkflow, deriveContentKey, deriverV1, deriverV2, digestOf, dispatchProjectionReserveUsd, dispositionHook, emptyDigestBlocks, emptyToolset, encodeCheckpoint, entryUsageSlices, escalateTool, evaluatePermission, evaluateReuse, evidencePreservedValidator, executeWorkflow, exhaustionCodeOf, extractCandidate, failoverTriggerOf, fallbackTriggerOf, filterClaimsForRun, finalizeFires, finishContract, foldTermination, formatRePrompt, formatScopePath, hasFencedWrites, hasMetaLookup, hashRunArgs, hashRunOutput, hashWorkflowBody, hashWorkflowSource, identityJcs, implementationAgentProfile, invoiceFromJournal, isEscalated, isSchemaPairSpec, isStandardSchemaSpec, isStrictCompatibleSchema, kMaxOf, knowledgeHash, ladderLengthOf, ladderRungChoice, lastRunSettle, latestProgressReport, lexShellCommand, liftRetainedParts, lineageWeightOf, localKeyProvider, makeOrchestratorWorkflow, maskSecrets, maskSecretsDeep, maskSecretsJson, matchArgvPattern, matchShellCommand, mcp, memoryQuotaLimiter, mergeQuotaDenial, mergeUsageLimits, metaMatchesFilter, minMatchesValidator, modelEpochOf, modelKnowledgeCard, modelSpecIdentity, needsSeparateExtract, nextFailover, nodeLinkKey, normalizeApproachTag, normalizeEntry, normalizeFallbacks, orchestrate, orchestratorAdmissionEstCostUsd, parallelScope, parseModelRef, parseScopePath, phiInitialOf, pipelineScope, planNodeScope, preflightEstimate, priceEntryUsage, priceUsdOf, profileCard, profileRegistrySnapshotHash, progressReportTool, projectHistory, projectIdentity, projectToJsonSchema, proposalStatement, providerOf, quotaActualTokens, quotaEstimateTokens, quotaRuleAdmission, quotaRuleMatches, readRunMeta, readTerminationInit, reconcileRunMeta, reduceAuditTrail, reduceCriticalPath, reduceInvocationTable, registryKeyRing, remeasureQueue, replayDisposition, repositoryResearchToolset, requiredFieldsValidator, requiredSectionsValidator, researchAgentProfile, resolveModelInvocation, resolvePricing, resolveToolset, retryClassOf, retryDelayMs, reviewAgentProfile, roleConfiguredInRouting, roundOneDisposition, runAgent, runProfile, sanitizeTerminalText, sanitizeTokenCount, sanitizeUsage, sanitizeUsageDelta, scanJournalCompatibility, schemaHash, schemaHashOfSpec, sectionCitationsValidator, selectStructuredOutputTier, selfTestFinishValidation, shouldCompact, snapshotUsage, spawnDepthOf, summarizeInstruction, summarizeOutput, terminationConfigDrift, tierWithinCaps, toApprovalDecision, toJournalValue, tool, toolContract, toolsetHash, ttlState, usageViolations, validateEditorialCommit, validateEngineQuotaConfig, validateEntryShape, validateEscalationLimits, validateEscalationReport, validateQuotaRules, validateRetryPolicy, validateSchemaSpec, validateTerminationLimits, validateUsageLimits, wordCountValidator, workflowScope, workflowSourceRef, wrapJournalStore, wrapTranscriptStore };