@tangle-network/agent-eval 0.163.2 → 0.171.0

package/dist/{transient-failure-DKF5Mofa.d.ts → provenance-CafMdZKM.d.ts}

@@ -1,13 +1,13 @@
 import { t as AgentEvalError } from "./errors-DEE6u6ot.js";
 import { c as CostLedgerHandle, f as CostLedgerSummary, m as CostReceipt, o as CostLedger, p as CostProvenance } from "./cost-ledger-DbQdN3nO.js";
-import { a as RunRecord } from "./run-record-VVy4T9OW.js";
+import { a as RunRecord } from "./run-record-DQjRcYwA.js";
+import { _ as ProposalFinding } from "./types-DMoNFDWi.js";
 import { p as ChatClient } from "./types-Bfk0uxRj.js";
-import { _ as ProposalFinding } from "./types-D9ssmxKL.js";
+import { B as ScoredSurfaceOutcome, C as JudgeDimension, H as SurfaceProposer, N as ParetoParent, R as Scenario, S as JudgeConfig, _ as GateDecision, a as CampaignResult, b as GenerationRecord, c as CampaignTraceWriter, d as DispatchContext, f as DispatchFn, g as GateContribution, j as MutableSurface, k as LabeledScenarioStore, p as Gate, r as CampaignCellResult, v as GateResult, y as GenerationCandidate } from "./types-JHMOqZI4.js";
+import { D as LedgerHash, m as LedgerTrustedHeadRemoval, p as LedgerTrustedHead } from "./index-lfaSeKSD.js";
 import { _ as ExternalTextCandidate, g as ExternalOptimizerWireCounts, o as ExternalOptimizerEvaluationObservation } from "./external-optimizer-contracts-szBJ_1vh.js";
-import { B as ScoredSurfaceOutcome, C as JudgeDimension, H as SurfaceProposer, N as ParetoParent, R as Scenario, S as JudgeConfig, _ as GateDecision, a as CampaignResult, b as GenerationRecord, c as CampaignTraceWriter, d as DispatchContext, f as DispatchFn, g as GateContribution, j as MutableSurface, k as LabeledScenarioStore, p as Gate, r as CampaignCellResult, v as GateResult, y as GenerationCandidate } from "./types-D4s7Z6nq.js";
 import { r as DatasetScenario, t as Dataset } from "./dataset-DQqhOCPt.js";
-import { D as LedgerHash, m as LedgerTrustedHeadRemoval, p as LedgerTrustedHead } from "./index-lfaSeKSD.js";
-import { g as TraceSpanEvent, t as HostedClient } from "./client-L9VVPkim.js";
+import { g as TraceSpanEvent, t as HostedClient } from "./client-CDtcZ3p9.js";
 import { z } from "zod";
 //#region src/judge-families.d.ts
 /**
@@ -164,118 +164,6 @@ declare function assertCrossFamilyServed(pairs: ReadonlyArray<{
   served: string | null | undefined;
 }>, opts?: AssertCrossFamilyServedOptions): JudgeFamily[];
 //#endregion
-//#region src/llm-judge.d.ts
-/** A rubric dimension as a bare key or the full `{ key, description }` shape. A
- *  bare string uses the key as its own description. */
-type LlmJudgeDimension = string | JudgeDimension;
-interface LlmJudgeOptions<TArtifact, TScenario extends Scenario = Scenario> {
-  /** The injected LLM transport. One `chat()` call per `score()`. Required —
-   *  there is no default route, so a misconfigured judge fails at construction,
-   *  never silently against the free-tier router. */
-  chat: ChatClient;
-  /** Rubric dimensions the model scores. Each becomes a `[0,1]` field of the
-   *  returned `JudgeScore.dimensions`. Defaults to a single `quality` dimension. */
-  dimensions?: LlmJudgeDimension[];
-  /** Model id. Falls back to `chat.defaultModel`; one of the two MUST resolve. */
-  model?: string;
-  /** Explicit scoring revision for opaque transport or renderer changes. */
-  judgeVersion?: string;
-  temperature?: number;
-  maxTokens?: number;
-  /** Composite weights forwarded to `weightedComposite`: a partial map selects
-   *  AND weights exactly the named dimensions. Omit for a uniform mean. */
-  weights?: Record<string, number>;
-  /**
-   * How to read a score out of the model's answer.
-   *
-   * `'sampled'` (default) reads the number the model emitted. Discrete grades
-   * tie often, and a tie carries no ranking signal.
-   *
-   * `'expectation'` asks the provider for the log probabilities of the score
-   * token and returns the expected value over the integer grades the model
-   * considered, so two answers that both sample `8` separate by how much mass
-   * sat on `7` and `9`. It requires `scale: 'ten'`: an integer grade is one
-   * token, and a `unit` float is not. `whenUnavailable` decides what happens
-   * when the provider returns no log probabilities, or the grade did not land
-   * in one token: `'fail'` throws, `'sampled'` reads the emitted number and
-   * records `scoringMethod: 'sampled'` on the score.
-   */
-  scoring?: {
-    method: 'sampled';
-  } | {
-    method: 'expectation';
-    whenUnavailable: 'fail' | 'sampled';
-  };
-  /** Scale the model is prompted to score on, normalized into `[0,1]`:
-   *   - `'unit'`  (default): the model returns `[0,1]` directly.
-   *   - `'ten'`:  the model returns `[0,10]`; divided by 10 here.
-   *  The prompt is annotated with the expected range either way. */
-  scale?: 'unit' | 'ten';
-  /** Run this judge only on matching scenarios (mirrors `JudgeConfig.appliesTo`). */
-  appliesTo?: (scenario: TScenario) => boolean;
-  /** Render the artifact + scenario into the user message. Default:
-   *  pretty-printed JSON of `{ scenario, artifact }`. */
-  renderUser?: (input: {
-    artifact: TArtifact;
-    scenario: TScenario;
-  }) => string;
-  /** Strict runtime contract; its JSON Schema is sent to the provider. */
-  costLedger?: CostLedgerHandle;
-  responseSchema?: {
-    name: string;
-    schema: z.ZodObject;
-  };
-}
-/**
- * Build a campaign-shaped `JudgeConfig` whose `score()` makes ONE LLM call
- * against `prompt` and reduces the model's per-dimension scores to a canonical
- * `JudgeScore` in `[0,1]`.
- *
- * The model is instructed to return JSON `{ "dimensions": { <key>: <number>, … },
- * "notes": "…" }`; the helper strips fenced JSON, validates every declared
- * dimension is present and in range, normalizes by `scale`, and composites via
- * `weightedComposite`.
- */
-declare function llmJudge<TArtifact = unknown, TScenario extends Scenario = Scenario>(name: string, prompt: string, opts: LlmJudgeOptions<TArtifact, TScenario>): JudgeConfig<TArtifact, TScenario>;
-//#endregion
-//#region src/campaign/auto-pr.d.ts
-interface OpenAutoPrOptions<TArtifact, TScenario extends Scenario> {
-  /** Campaign result to attach to the PR. */
-  result: CampaignResult<TArtifact, TScenario>;
-  /** Gate verdict explaining the promotion. Substrate refuses to open a PR
-   *  when `gate.decision !== 'ship'` — fails loud. */
-  gate: GateResult;
-  /** Promoted surface diff — typically the new system prompt addendum or
-   *  full profile diff. Substrate writes it as the PR body. */
-  promotedDiff: string;
-  /** GH owner/repo target (e.g., `tangle-network/gtm-agent`). */
-  ghOwner: string;
-  ghRepo: string;
-  /** Branch name for the PR. Default `auto/<manifestHash[:12]>`. */
-  branch?: string;
-  /** PR title. Default includes manifest hash. */
-  title?: string;
-  /** Whether to actually open the PR or just dry-run. Default reads
-   *  `GH_AUTO_PR_TOKEN` env — present = open, absent = dry-run. */
-  dryRun?: boolean;
-  /** Test seam — substitute `gh pr create` invocation. */
-  ghExec?: (args: string[]) => {
-    stdout: string;
-    stderr: string;
-    status: number;
-  };
-}
-interface OpenAutoPrResult {
-  opened: boolean;
-  prUrl?: string;
-  dryRun: boolean;
-  reason: string;
-}
-/**
- * Open a GitHub PR for a gate-approved surface promotion, attaching the manifest hash, gate verdict, and diff as the PR body.
- */
-declare function openAutoPr<TArtifact, TScenario extends Scenario>(options: OpenAutoPrOptions<TArtifact, TScenario>): OpenAutoPrResult;
-//#endregion
 //#region src/campaign/storage.d.ts
 /**
  * `CampaignStorage` — the filesystem seam `runCampaign` writes through
@@ -326,6 +214,25 @@ declare function createRunCostLedger(input: {
   ensureRunDir?: boolean;
 }): CostLedger;
 //#endregion
+//#region src/campaign/cell-schedule.d.ts
+declare function cellCachePath(runDir: string, cellId: string): string;
+//#endregion
+//#region src/campaign/cell-cache.d.ts
+type CacheIssueReason = 'missing' | 'manifest-mismatch' | 'cell-mismatch' | 'missing-cost-provenance' | 'invalid-cost-provenance' | 'invalid-cost-receipts' | 'corrupt';
+type CacheRead<TArtifact> = {
+  status: 'hit';
+  cell: CampaignCellResult<TArtifact>;
+} | {
+  status: 'miss';
+  reason: CacheIssueReason;
+};
+declare function readCachedCell<TArtifact>(args: {
+  storage: CampaignStorage;
+  cachePath: string;
+  cellId: string;
+  manifestHash: string;
+}): CacheRead<TArtifact>;
+//#endregion
 //#region src/campaign/plan-campaign-run.d.ts
 interface CampaignRunPlanCell {
   cellId: string;
@@ -554,123 +461,86 @@ interface CampaignCellRetryPolicy {
  */
 declare function runCampaign<TScenario extends Scenario, TArtifact>(opts: RunCampaignOptions<TScenario, TArtifact>): Promise<CampaignResult<TArtifact, TScenario>>;
 //#endregion
-//#region src/campaign/cell-schedule.d.ts
-declare function cellCachePath(runDir: string, cellId: string): string;
-//#endregion
-//#region src/campaign/cell-cache.d.ts
-type CacheIssueReason = 'missing' | 'manifest-mismatch' | 'cell-mismatch' | 'missing-cost-provenance' | 'invalid-cost-provenance' | 'invalid-cost-receipts' | 'corrupt';
-type CacheRead<TArtifact> = {
-  status: 'hit';
-  cell: CampaignCellResult<TArtifact>;
-} | {
-  status: 'miss';
-  reason: CacheIssueReason;
-};
-declare function readCachedCell<TArtifact>(args: {
-  storage: CampaignStorage;
-  cachePath: string;
-  cellId: string;
-  manifestHash: string;
-}): CacheRead<TArtifact>;
-//#endregion
-//#region src/campaign/external-optimizer-observations.d.ts
-interface ExternalOptimizerObservationSummary {
-  scope: 'callback-submitted-candidates';
-  path: string;
-  sha256: `sha256:${string}`;
-  submittedCandidates: number;
-  evaluations: number;
-  refusals: number;
-}
-interface ExternalOptimizerExecutionSummary {
-  scope: 'runtime-model-calls';
-  path: string;
-  sha256: `sha256:${string}`;
-  calls: number;
-  succeeded: number;
-  failed: number;
+//#region src/campaign/presets/run-eval.d.ts
+interface RunEvalOptions<TScenario extends Scenario, TArtifact> extends Omit<RunCampaignOptions<TScenario, TArtifact>, 'runDir'> {
+  runDir: string;
 }
-interface ExternalOptimizerSubmittedCandidate {
-  /** Exact text or named-component surface submitted to the evaluation callback. */
-  readonly candidate: ExternalTextCandidate;
-  /** Eval's canonical content identity for `candidate`. */
-  readonly candidateHash: string;
-  readonly candidateDigest: `sha256:${string}`;
-  readonly proposalSequence: number;
-  /** Exact observation artifact that proves this candidate was submitted. */
-  readonly provenance: {
-    readonly path: string;
-    readonly sha256: `sha256:${string}`;
+/**
+ * Simplest evaluation preset: run scenarios through dispatch, score with judges, and return a `CampaignResult` — no optimizer, no gate, no PR.
+ */
+declare function runEval<TScenario extends Scenario, TArtifact>(opts: RunEvalOptions<TScenario, TArtifact>): Promise<CampaignResult<TArtifact, TScenario>>;
+//#endregion
+//#region src/campaign/auto-pr.d.ts
+interface OpenAutoPrOptions<TArtifact, TScenario extends Scenario> {
+  /** Campaign result to attach to the PR. */
+  result: CampaignResult<TArtifact, TScenario>;
+  /** Gate verdict explaining the promotion. Substrate refuses to open a PR
+   *  when `gate.decision !== 'ship'` — fails loud. */
+  gate: GateResult;
+  /** Promoted surface diff — typically the new system prompt addendum or
+   *  full profile diff. Substrate writes it as the PR body. */
+  promotedDiff: string;
+  /** GH owner/repo target (e.g., `tangle-network/gtm-agent`). */
+  ghOwner: string;
+  ghRepo: string;
+  /** Branch name for the PR. Default `auto/<manifestHash[:12]>`. */
+  branch?: string;
+  /** PR title. Default includes manifest hash. */
+  title?: string;
+  /** Whether to actually open the PR or just dry-run. Default reads
+   *  `GH_AUTO_PR_TOKEN` env — present = open, absent = dry-run. */
+  dryRun?: boolean;
+  /** Test seam — substitute `gh pr create` invocation. */
+  ghExec?: (args: string[]) => {
+    stdout: string;
+    stderr: string;
+    status: number;
   };
 }
-interface ExternalOptimizerObservationArtifact {
-  readonly summary: ExternalOptimizerObservationSummary;
-  readonly observations: readonly ExternalOptimizerEvaluationObservation[];
-  /** Every distinct callback-submitted candidate in proposal order. */
-  readonly candidates: readonly ExternalOptimizerSubmittedCandidate[];
+interface OpenAutoPrResult {
+  opened: boolean;
+  prUrl?: string;
+  dryRun: boolean;
+  reason: string;
 }
 /**
- * Read and verify the exact callback observation artifact addressed by method provenance.
- *
- * The reader checks the raw SHA-256, canonical JSONL bytes, sequence, candidate
- * identities, and summary counts before it returns any candidate.
- * This proves that the bytes match the supplied summary. The caller remains
- * responsible for obtaining that summary from trusted provenance.
+ * Open a GitHub PR for a gate-approved surface promotion, attaching the manifest hash, gate verdict, and diff as the PR body.
  */
-declare function readExternalOptimizerObservationArtifact(input: {
-  summary: ExternalOptimizerObservationSummary;
-  storage?: CampaignStorage;
-}): ExternalOptimizerObservationArtifact;
+declare function openAutoPr<TArtifact, TScenario extends Scenario>(options: OpenAutoPrOptions<TArtifact, TScenario>): OpenAutoPrResult;
 //#endregion
-//#region src/campaign/gepa-candidate-population.d.ts
-interface GepaCandidatePopulationSummary {
-  readonly scope: 'gepa-candidate-population';
-  readonly path: string;
-  readonly sha256: `sha256:${string}`;
-  readonly bytes: number;
-  readonly runId: string;
-  readonly candidates: number;
-  readonly bestIndex: number;
-  readonly maxCandidates: number;
-  readonly maxCandidateChars: number;
-  readonly scenarioIds: readonly string[];
-  readonly surfaceKind: 'text' | 'components';
-}
-interface GepaCandidateSelectionScore {
-  readonly scenarioId: string;
-  readonly score: number;
-}
-interface GepaCandidatePopulationCandidate {
-  /** Zero-based index assigned by the exact GEPA result. */
-  readonly index: number;
-  readonly candidate: ExternalTextCandidate;
-  readonly candidateHash: string;
-  readonly candidateDigest: `sha256:${string}`;
-  /** Exact GEPA parent indices. The seed candidate has one null parent. */
-  readonly parentIndices: readonly (number | null)[];
-  /** Null means GEPA had no selection score for this candidate. */
-  readonly aggregateScore: number | null;
-  readonly selectionScores: readonly GepaCandidateSelectionScore[];
-  readonly discoveryEvaluationCount: number;
+//#region src/campaign/parent-selection.d.ts
+/** Search state supplied to one parent-selection call. */
+interface ParentSelectionContext {
+  /** Non-dominated scored surfaces across the whole run so far, including the
+   *  baseline (`generation: -1`). Never empty. */
+  readonly frontier: ReadonlyArray<ParetoParent>;
+  /** Measured result of the global incumbent, the promotion bar. Under the
+   *  default `selectionRankKey` the incumbent is always on `frontier`. */
+  readonly incumbent: ScoredSurfaceOutcome;
+  /** Every completed generation so far. */
+  readonly history: ReadonlyArray<GenerationRecord>;
+  /** Index of the generation about to propose. */
+  readonly generation: number;
 }
-interface GepaCandidatePopulationArtifact {
-  readonly summary: GepaCandidatePopulationSummary;
-  readonly runId: string;
-  readonly bestIndex: number;
-  readonly candidates: readonly GepaCandidatePopulationCandidate[];
+/** Chooses the surface the next generation mutates. Returns one frontier
+ *  parent; `runOptimization` refuses a parent it has not measured to
+ *  completion or whose surface does not match its `surfaceHash`. */
+type ParentSelector = (ctx: ParentSelectionContext) => ParetoParent;
+interface CrowdedFrontierParentOptions {
+  /** Integer seed for the per-generation draw. The same seed, frontier, and
+   *  generation index select the same parent. */
+  seed: number;
 }
 /**
- * Read GEPA's exact candidate graph from the artifact addressed by method provenance.
- *
- * The reader checks the supplied digest, declared byte count, run identity,
- * candidate surfaces, parent graph, selection scores, and configured bounds.
- * This proves that the bytes match the supplied summary. The caller remains
- * responsible for obtaining that summary from trusted method provenance.
+ * NSGA-II crowded tournament selection over the frontier. Each generation
+ * draws two distinct frontier members with a PRNG seeded from `seed` and the
+ * generation index, and keeps the one with the larger crowding distance (more
+ * isolated on the frontier). Boundary parents carry infinite distance, so a
+ * boundary parent always beats an interior one. A tie on distance falls back
+ * to the higher mean composite, then to the smaller surface hash. A frontier
+ * of one member returns that member.
  */
-declare function readGepaCandidatePopulationArtifact(input: {
-  summary: GepaCandidatePopulationSummary;
-  storage?: CampaignStorage;
-}): GepaCandidatePopulationArtifact;
+declare function crowdedFrontierParent(options: CrowdedFrontierParentOptions): ParentSelector;
 //#endregion
 //#region src/campaign/search-ledger.d.ts
 declare const SEARCH_LEDGER_SCHEMA: 'tangle.search-ledger.v1';
@@ -1115,490 +985,184 @@ declare function assertCompleteSearchHistory(producerId: string, receipt: Search
 /** Classify one producer's history without treating malformed evidence as absence. */
 declare function searchHistoryCoverageRow(producerId: string, receipt: SearchHistoryReceipt | undefined): SearchHistoryCoverageRow;
 //#endregion
-//#region src/campaign/presets/compare-optimization-methods.d.ts
-/** Shared campaign settings applied to every optimization method. */
-type OptimizationMethodRunOptions<TScenario extends Scenario, TArtifact> = Omit<RunCampaignOptions<TScenario, TArtifact>, 'costCeiling' | 'costLedger' | 'dispatch' | 'judges' | 'runDir' | 'scenarios' | 'seed'>;
-/** Cost reported by a method or by final test scoring. */
-interface ComparisonCost {
-  /** Known subtotal. Consult `costProvenance` before treating this as total spend. */
-  totalCostUsd: number;
-  /** Exact origin of the total; uncaptured means `totalCostUsd` is only a known subtotal. */
-  costProvenance: CostProvenance;
-  accountingComplete: boolean;
-  incompleteReasons: string[];
+//#region src/campaign/gepa-candidate-population.d.ts
+interface GepaCandidatePopulationSummary {
+  readonly scope: 'gepa-candidate-population';
+  readonly path: string;
+  readonly sha256: `sha256:${string}`;
+  readonly bytes: number;
+  readonly runId: string;
+  readonly candidates: number;
+  readonly bestIndex: number;
+  readonly maxCandidates: number;
+  readonly maxCandidateChars: number;
+  readonly scenarioIds: readonly string[];
+  readonly surfaceKind: 'text' | 'components';
 }
-interface OptimizationPackageSource {
-  kind: 'package';
-  /** Whether package identity was inspected or supplied by caller code. */
-  evidence: 'observed' | 'declared';
-  package: string;
-  version: string;
-  sourceUrl?: string;
-  revision?: string;
-  /** SHA-256 of all installed module files observed before the run. */
-  sourceSha256?: string;
+interface GepaCandidateSelectionScore {
+  readonly scenarioId: string;
+  readonly score: number;
 }
-interface OptimizationModuleSource {
-  module: string;
-  sourceSha256: string;
+interface GepaCandidatePopulationCandidate {
+  /** Zero-based index assigned by the exact GEPA result. */
+  readonly index: number;
+  readonly candidate: ExternalTextCandidate;
+  readonly candidateHash: string;
+  readonly candidateDigest: `sha256:${string}`;
+  /** Exact GEPA parent indices. The seed candidate has one null parent. */
+  readonly parentIndices: readonly (number | null)[];
+  /** Null means GEPA had no selection score for this candidate. */
+  readonly aggregateScore: number | null;
+  readonly selectionScores: readonly GepaCandidateSelectionScore[];
+  readonly discoveryEvaluationCount: number;
 }
-interface OptimizationPythonRuntime {
-  implementation: string;
-  version: string;
+interface GepaCandidatePopulationArtifact {
+  readonly summary: GepaCandidatePopulationSummary;
+  readonly runId: string;
+  readonly bestIndex: number;
+  readonly candidates: readonly GepaCandidatePopulationCandidate[];
 }
-interface OptimizationTokenUsage {
-  /** All input tokens, including cache reads and cache creation. */
-  inputTokens: number;
-  /** Input tokens served from a provider cache. */
-  cachedInputTokens?: number;
-  /** Input tokens used to create or write a provider cache entry. */
-  cacheWriteInputTokens?: number;
-  outputTokens: number;
-  /** Reasoning tokens included in `outputTokens`. */
-  reasoningTokens?: number;
-  totalTokens: number;
-  calls: number;
+/**
+ * Read GEPA's exact candidate graph from the artifact addressed by method provenance.
+ *
+ * The reader checks the supplied digest, declared byte count, run identity,
+ * candidate surfaces, parent graph, selection scores, and configured bounds.
+ * This proves that the bytes match the supplied summary. The caller remains
+ * responsible for obtaining that summary from trusted method provenance.
+ */
+declare function readGepaCandidatePopulationArtifact(input: {
+  summary: GepaCandidatePopulationSummary;
+  storage?: CampaignStorage;
+}): GepaCandidatePopulationArtifact;
+//#endregion
+//#region src/campaign/search-ledger-recording.d.ts
+/** How a search operation executed. The shape the ledger event records. */
+type SearchExecutionIdentity = SearchOperationRecordedEvent['execution'];
+/** Immutable identities the ledger requires and a campaign cannot infer. */
+interface SearchRunIdentity {
+  /** The agent implementation under optimization. */
+  agent: SearchSourceRef;
+  /** The candidate generator: a model call or deterministic code. */
+  proposer: SearchExecutionIdentity;
+  /** The code that plans the search and selects its winner. */
+  search: SearchSourceRef;
+  /** Model the agent runs. Used only for a cell that reported none. */
+  model: SearchModelIdentity;
 }
-interface OptimizationMethodProvenance {
-  /** External optimizer package. */
-  source: OptimizationPackageSource;
-  /** Python bridge package that invoked the optimizer. */
-  bridge?: OptimizationPackageSource;
-  /** Custom engine modules imported by the optimizer. */
-  modules?: OptimizationModuleSource[];
-  /** Python implementation used by the bridge process. */
-  python?: OptimizationPythonRuntime;
-  /** Exact model identifier configured for optimizer-owned model calls. */
-  optimizerModel?: string;
-  /** Stable public identity of the execution-owner callback. */
-  optimizerCallRef?: string;
-  runId: string;
-  /** Content identity shared by compatible resumptions. */
-  compatibleRunId?: string;
-  resumed: boolean;
-  /** Whether the run seed reached every external engine configuration. */
-  seedApplied?: boolean;
-  /** Evaluations the local callback metered — the trusted count. */
-  evaluationCount: number;
-  /**
-   * Evaluation total the external optimizer reported from its own counters.
-   * A difference from `evaluationCount` means upstream skipped, cached, or
-   * double-counted work; inspect before trusting upstream-derived budgets.
-   */
-  upstreamReportedEvaluations?: number;
-  artifactDir: string;
-  tokenUsage?: OptimizationTokenUsage;
-  /** Candidates submitted to the callback, per-case scores, and refusals. */
-  observations?: ExternalOptimizerObservationSummary;
-  /** Exact accepted GEPA candidates, parent indices, and selection scores. */
-  gepaCandidatePopulation?: GepaCandidatePopulationSummary;
-  /** Opaque Runtime execution evidence for every invoked optimizer-model call. */
-  modelExecutions?: ExternalOptimizerExecutionSummary;
-  /** Anthropic-endpoint proxy traffic from agent CLI engines, when enabled. */
-  anthropicEndpoint?: ExternalOptimizerWireCounts;
+interface SearchLedgerBinding {
+  ledger: SearchLedger;
+  identity: SearchRunIdentity;
 }
-/** Shared inputs for one optimization method. Final test data is absent. */
-interface OptimizationMethodInput<TScenario extends Scenario, TArtifact> {
-  /** Surface every method starts from. */
-  readonly baselineSurface: MutableSurface;
-  /** Evidence used to author or fit candidates. */
-  readonly trainScenarios: readonly TScenario[];
-  /** Data used for candidate acceptance, early stopping, and model selection. */
-  readonly selectionScenarios: readonly TScenario[];
-  /** Runs one scenario with a candidate surface. */
-  readonly dispatchWithSurface: (surface: MutableSurface, scenario: TScenario, ctx: DispatchContext) => Promise<TArtifact>;
-  /** Scores artifacts produced by `dispatchWithSurface`. */
-  readonly judges: readonly JudgeConfig<TArtifact, TScenario>[];
-  /** Method-specific artifacts are written below this directory. */
-  readonly runDir: string;
-  readonly seed: number;
-  /** Shared defaults for every method. A method may override them explicitly. */
-  readonly runOptions: Readonly<OptimizationMethodRunOptions<TScenario, TArtifact>>;
-  /** Durable spend account shared by every method and final scoring. */
-  readonly costLedger: CostLedgerHandle;
+/** One proposed candidate, before it is measured. */
+interface ProposedSearchCandidate {
+  surface: MutableSurface;
+  surfaceHash: string;
+  label?: string;
 }
-interface OptimizationMethodResult {
-  /** Surface selected without using the final test partition. */
-  winnerSurface: MutableSurface;
-  /** Optimization spend. Excludes final test scoring. */
-  cost: ComparisonCost;
-  /** Optimization duration. Excludes final test scoring. */
-  durationMs?: number;
-  /** Exact external implementation and run identity, when the method uses one. */
-  provenance?: OptimizationMethodProvenance;
-  /** Bounded proof envelope over the canonical SearchLedger for this optimization. */
-  searchHistory?: SearchHistoryReceipt;
+/** One measured candidate, after its campaign scored. */
+interface MeasuredSearchCandidate<TArtifact> {
+  surface: MutableSurface;
+  surfaceHash: string;
+  cells: ReadonlyArray<CampaignCellResult<TArtifact>>;
+  runDir: string;
+  /** False when the candidate missed a designed cell. */
+  coverageComplete: boolean;
 }
-/** A complete optimization method, including candidate generation and selection. */
-interface OptimizationMethod<TScenario extends Scenario = Scenario, TArtifact = unknown> {
-  /** Unique, trimmed display name. Its normalized form must also be unique. */
-  name: string;
-  optimize: (input: OptimizationMethodInput<TScenario, TArtifact>) => Promise<OptimizationMethodResult>;
-}
-interface OptimizationMethodScore {
-  name: string;
-  /** Mean final-test composite of the baseline (identical across methods). */
-  baselineComposite: number;
-  /** Mean final-test composite of this method's selected surface. */
-  winnerComposite: number;
-  /** Mean per-scenario final-test lift (winner minus baseline). */
-  lift: number;
-  /** Simultaneous paired-bootstrap interval for per-scenario lift.
-   *  `low > 0` excludes zero after adjustment for all reported contrasts. */
-  liftCi: {
-    low: number;
-    high: number;
-  };
-  /** Optimization spend reported by the method. Excludes final test scoring. */
-  optimizationCost: ComparisonCost;
-  /** Optimization duration reported by the method. Excludes final test scoring. */
-  durationMs?: number;
-  /** Exact external implementation and run identity, when reported by the method. */
-  provenance?: OptimizationMethodProvenance;
-  /** Paired final-test values used to compute lift and its interval. */
-  scenarioScores: Array<{
-    scenarioId: string;
-    baselineComposite: number;
-    winnerComposite: number;
-    lift: number;
-  }>;
-  winnerSurface: MutableSurface;
-  /** 1-based, by descending lift. */
-  rank: number;
-}
-interface OptimizationMethodPairwise {
-  /** Higher-ranked method. */
-  a: string;
-  b: string;
-  /** Mean per-scenario untouched-test delta (a − b). */
-  deltaMean: number;
-  low: number;
-  high: number;
-  /** `a` if the CI clears 0, `b` if it is entirely negative, else `'tie'`. */
-  favored: string;
-}
-interface OptimizationMethodComparison {
-  /** Sorted by descending lift; `rank` set accordingly. */
-  scores: OptimizationMethodScore[];
-  best: OptimizationMethodScore;
-  /** Best vs each other method, using simultaneous paired-bootstrap intervals. */
-  pairwise: OptimizationMethodPairwise[];
-  testScenarioIds: string[];
-  /** Sum of the costs reported by every optimization method. */
-  optimizationCost: ComparisonCost;
-  /** Baseline and distinct winner scoring on the final test partition. */
-  testCost: ComparisonCost;
-  /** Optimization plus final test scoring. */
-  totalCost: ComparisonCost;
-  /** Caller-requested simultaneous coverage across all reported contrasts. */
-  confidence: number;
-  /** Bonferroni-adjusted confidence used for each bootstrap interval. */
-  intervalConfidence: number;
-  /** Method-vs-baseline plus all possible method-vs-method contrasts. */
-  comparisonCount: number;
-  /** Deterministic bootstrap and campaign seed. */
-  seed: number;
-  /** Bootstrap draws used for each interval. */
-  resamples: number;
-  /** Agent runs averaged within each test scenario before resampling scenarios. */
-  reps: number;
-  /** Coverage of every method's canonical search history. */
-  searchHistory: SearchHistoryCoverage;
-}
-interface CompareOptimizationMethodsOptions<TScenario extends Scenario, TArtifact> extends Omit<RunCampaignOptions<TScenario, TArtifact>, 'dispatch' | 'judges' | 'scenarios'> {
-  methods: OptimizationMethod<TScenario, TArtifact>[];
-  baselineSurface: MutableSurface;
-  /** Evidence used by every optimizer to author or fit candidates. */
-  trainScenarios: TScenario[];
-  /** Candidate acceptance, early-stopping, and optimizer-selection data. */
-  selectionScenarios: TScenario[];
-  /** Untouched final comparison data. Never passed to an optimization method. */
-  testScenarios: TScenario[];
-  /** Scores a surface on a scenario. The methods and final test share this function. */
-  dispatchWithSurface: (surface: MutableSurface, scenario: TScenario, ctx: DispatchContext) => Promise<TArtifact>;
-  judges: JudgeConfig<TArtifact, TScenario>[];
-  /** Bootstrap resamples for the lift intervals. Default is at least 2000 and
-   *  rises when the requested simultaneous confidence needs finer tails. */
-  resamples?: number;
-  /** Shared defaults for each method's train and selection campaigns. */
-  optimizationRunOptions?: OptimizationMethodRunOptions<TScenario, TArtifact>;
-  /** Number of optimization methods to run concurrently. Default 1. */
-  optimizationConcurrency?: number;
-  /** Simultaneous confidence across method-vs-baseline and method-vs-method contrasts.
-   *  Each bootstrap interval is Bonferroni-adjusted. Default 0.95. */
-  confidence?: number;
-  /** Shared spend limit across every method's optimizer and evaluation calls plus final scoring. */
-  costCeiling?: number;
-  /**
-   * Missing history is reported by default. Publication-grade or autonomous
-   * callers set `require-complete`, which aborts before the first final-test call.
-   */
-  searchHistoryPolicy?: SearchHistoryPolicy;
+interface SearchRecorderOptions<TScenario extends Scenario> {
+  binding: SearchLedgerBinding;
+  storage: CampaignStorage;
+  runDir: string;
+  scenarios: ReadonlyArray<TScenario>;
+  reps: number;
+  maxGenerations: number;
+  populationSize: number;
+  /** Identity of the exact campaign design; the task benchmark pin. */
+  splitDigest: `sha256:${string}`;
+  /** Proposer label recorded on every candidate lineage. */
+  proposerLabel: string;
+  costLedger: CostLedgerHandle;
 }
 /**
- * Compare complete optimization methods on disjoint train, selection, and final test data.
+ * Recorder for one `runOptimization` run: `open()`, then `recordGeneration()`
+ * and `recordResults()` per generation, then `finish()`.
+ *
+ * Every event id is derived from the run, and an id already durable is not
+ * appended again, so a resumed run continues one ledger instead of conflicting
+ * with its own history.
  */
-declare function compareOptimizationMethods<TScenario extends Scenario, TArtifact>(opts: CompareOptimizationMethodsOptions<TScenario, TArtifact>): Promise<OptimizationMethodComparison>;
-/** Keep the cost fields a custom optimization method must report. */
-declare function costFromLedgerSummary(summary: CostLedgerSummary): ComparisonCost;
-/** Preserve every optimizer token class while keeping total input and output explicit. */
-declare function optimizationTokenUsageFromSummary(summary: CostLedgerSummary, receipts: readonly CostReceipt[]): OptimizationTokenUsage | undefined;
-/** Combine method costs without turning one unknown bill into a known total. */
-declare function combineComparisonCosts(entries: ReadonlyArray<{
-  label: string;
-  cost: ComparisonCost;
-}>): ComparisonCost;
-//#endregion
-//#region src/canary.d.ts
-type CanaryKind = 'silent_judge_fallback' | 'judge_calibration_drift' | 'distribution_shift';
-type CanarySeverity = 'info' | 'warn' | 'error';
-interface CanaryAlert {
-  kind: CanaryKind;
-  severity: CanarySeverity;
-  message: string;
-  /** Numbers that informed the decision — drop straight into a
-   *  dashboard / paper figure. */
-  evidence: Record<string, unknown>;
-}
-interface CanaryReport {
-  alerts: CanaryAlert[];
-  /** Per-kind summary count. */
-  counts: Record<CanaryKind, number>;
-  /** Whether each enabled detector had enough observations to run. */
-  evaluations: CanaryEvaluation[];
-}
-interface CanaryEvaluation {
-  kind: CanaryKind;
-  status: 'evaluated' | 'not_evaluated';
-  observations: number;
-  reason?: string;
-}
-interface CanaryOptions {
-  /**
-   * Silent-fallback detection.
-   * - `constant`: confidence value treated as the fallback signal.
-   *   Default 0.30 (matches the soft-fail default in
-   *   `propose-review.ts`).
-   * - `consecutiveThreshold`: trip the alert after this many
-   *   consecutive runs at `constant` (or `fallback === true`).
-   *   Default 3.
-   */
-  silentFallback?: {
-    constant?: number;
-    consecutiveThreshold?: number;
-    /** Floating-point tolerance when comparing against `constant`. */
-    epsilon?: number;
-  };
+declare class SearchRecorder<TScenario extends Scenario, TArtifact> {
+  private readonly opts;
+  private readonly tasks;
+  private readonly registered;
+  private readonly order;
+  private readonly coverage;
+  private readonly openSlots;
+  private readonly durableEventIds;
+  private lastStampMs;
+  private proposalReceiptCount;
+  private constructor();
+  /** Open the recorder and append the plan. An existing ledger for the same
+   *  run is re-read first, so a resumed run keeps one plan and one lineage. */
+  static open<TScenario extends Scenario, TArtifact>(opts: SearchRecorderOptions<TScenario>): Promise<SearchRecorder<TScenario, TArtifact>>;
   /**
-   * Calibration-drift detection.
-   * - `historyWindow`: number of past runs (oldest-first) treated as
-   *   the historical baseline. Default 50.
-   * - `recentWindow`: number of recent runs (newest-first) compared
-   *   against history. Default 20.
-   * - `ksAlpha`: alpha for the KS statistic vs critical value.
-   *   Default 0.05.
-   * - `minRecent`: minimum recent runs required to even attempt the
-   *   check. Default 10.
+   * Record one generation's candidate-generation call and the candidates it
+   * produced. A proposal larger than the planned population extends the plan
+   * with the extra slots; a proposal that fills fewer closes the rest.
    */
-  calibrationDrift?: {
-    historyWindow?: number;
-    recentWindow?: number;
-    ksAlpha?: number;
-    minRecent?: number;
-  };
+  recordGeneration(input: {
+    generation: number;
+    parentSurfaceHash: string;
+    candidates: ReadonlyArray<ProposedSearchCandidate>;
+  }): Promise<void>;
+  /** Append one task attempt per designed cell of each candidate campaign. */
+  recordResults(candidates: ReadonlyArray<MeasuredSearchCandidate<TArtifact>>): Promise<void>;
   /**
-   * Distribution-shift detection.
-   * - `category`: function that maps a run to a categorical bucket.
-   *   Required to enable this canary; if omitted the chi-square check
-   *   is skipped entirely.
-   * - `chiSquareAlpha`: alpha. Default 0.05.
-   * - `historyWindow`, `recentWindow`, `minRecent`: like above.
+   * Close the search: unreached generations, the selection operation, one
+   * decision per candidate, then the terminal event.
+   *
+   * The terminal event is appended only when canonical replay accounts for the
+   * whole planned denominator. An interrupted or partly unscored search stays
+   * `in-progress` and its receipt reports the exact gap, instead of claiming a
+   * closed search.
    */
-  distributionShift?: {
-    category: (run: RunRecord) => string | null;
-    chiSquareAlpha?: number;
-    historyWindow?: number;
-    recentWindow?: number;
-    minRecent?: number;
-  };
+  finish(input: {
+    winnerSurfaceHash: string;
+    generationsRun: number;
+    runId: string;
+  }): Promise<SearchHistoryReceipt>;
+  /** Bounded receipt over the exact ledger bytes this run produced. */
+  receipt(runId: string): Promise<SearchHistoryReceipt>;
+  /** Read an existing ledger for this run so a resume continues it. */
+  private hydrate;
+  private plan;
+  private registeredSlot;
+  private remember;
+  private recordGenerationOperation;
+  private closeSlot;
+  /** Spend booked to candidate generation since the previous generation. */
+  private proposalAccounting;
+  private cellModel;
+  private proposalArtifact;
+  /** Write one canonical evidence document and return its content address. */
+  private writeArtifact;
+  private append;
+  /** Non-decreasing ISO stamps; the ledger refuses an event that moves back. */
+  private stamp;
 }
 /**
- * Run all configured canaries against a chronological run list.
- * Runs MUST be sorted oldest-to-newest by the caller — the order of
- * the input is used to define "recent" vs "historical" windows.
- */
-declare function runCanaries(runs: RunRecord[], opts?: CanaryOptions): CanaryReport;
-//#endregion
-//#region src/red-team.d.ts
-type RedTeamCategory = 'prompt_injection_direct' | 'prompt_injection_indirect' | 'jailbreak_persona' | 'jailbreak_dan' | 'pii_leak' | 'permission_escalation' | 'data_exfil' | 'policy_override';
-interface RedTeamPayload {
-  category: RedTeamCategory;
-  /** The hostile input the agent sees. */
-  input: string;
-  /**
-   * What a safe agent should do: "refuse" means explicit refusal,
-   * "ignore" means process benignly without executing the attack.
-   */
-  expected: 'refuse' | 'ignore';
-  /** Substring(s) that MUST NOT appear in output. */
-  forbiddenStrings?: string[];
-  /** Tool names the agent MUST NOT call for this scenario. */
-  forbiddenTools?: string[];
-}
-interface RedTeamCase extends DatasetScenario {
-  payload: RedTeamPayload;
-}
-interface RedTeamFinding {
-  scenarioId: string;
-  category: RedTeamCategory;
-  passed: boolean;
-  reason: string;
-  evidence?: string;
-}
-interface RedTeamReport {
-  findings: RedTeamFinding[];
-  passRateByCategory: Record<RedTeamCategory, number>;
-  overallPassRate: number;
-}
-/** Ship a canonical, small corpus. Consumers extend via `extendCorpus`. */
-declare const DEFAULT_RED_TEAM_CORPUS: RedTeamCase[];
-declare function redTeamDataset(extraCases?: RedTeamCase[]): Dataset;
-/**
- * Score a single agent response against the red-team case.
- * `toolCalls` should be the names of tools the agent invoked during the run.
- */
-declare function scoreRedTeamOutput(output: string, toolCalls: string[], rtCase: RedTeamCase): RedTeamFinding;
-/** Aggregate red-team findings into per-category pass rates. */
-declare function redTeamReport(findings: RedTeamFinding[]): RedTeamReport;
-//#endregion
-//#region src/campaign/search-ledger-recording.d.ts
-/** How a search operation executed. The shape the ledger event records. */
-type SearchExecutionIdentity = SearchOperationRecordedEvent['execution'];
-/** Immutable identities the ledger requires and a campaign cannot infer. */
-interface SearchRunIdentity {
-  /** The agent implementation under optimization. */
-  agent: SearchSourceRef;
-  /** The candidate generator: a model call or deterministic code. */
-  proposer: SearchExecutionIdentity;
-  /** The code that plans the search and selects its winner. */
-  search: SearchSourceRef;
-  /** Model the agent runs. Used only for a cell that reported none. */
-  model: SearchModelIdentity;
-}
-interface SearchLedgerBinding {
-  ledger: SearchLedger;
-  identity: SearchRunIdentity;
-}
-/** One proposed candidate, before it is measured. */
-interface ProposedSearchCandidate {
-  surface: MutableSurface;
-  surfaceHash: string;
-  label?: string;
-}
-/** One measured candidate, after its campaign scored. */
-interface MeasuredSearchCandidate<TArtifact> {
-  surface: MutableSurface;
-  surfaceHash: string;
-  cells: ReadonlyArray<CampaignCellResult<TArtifact>>;
-  runDir: string;
-  /** False when the candidate missed a designed cell. */
-  coverageComplete: boolean;
-}
-interface SearchRecorderOptions<TScenario extends Scenario> {
-  binding: SearchLedgerBinding;
-  storage: CampaignStorage;
-  runDir: string;
-  scenarios: ReadonlyArray<TScenario>;
-  reps: number;
-  maxGenerations: number;
-  populationSize: number;
-  /** Identity of the exact campaign design; the task benchmark pin. */
-  splitDigest: `sha256:${string}`;
-  /** Proposer label recorded on every candidate lineage. */
-  proposerLabel: string;
-  costLedger: CostLedgerHandle;
-}
-/**
- * Recorder for one `runOptimization` run: `open()`, then `recordGeneration()`
- * and `recordResults()` per generation, then `finish()`.
- *
- * Every event id is derived from the run, and an id already durable is not
- * appended again, so a resumed run continues one ledger instead of conflicting
- * with its own history.
- */
-declare class SearchRecorder<TScenario extends Scenario, TArtifact> {
-  private readonly opts;
-  private readonly tasks;
-  private readonly registered;
-  private readonly order;
-  private readonly coverage;
-  private readonly openSlots;
-  private readonly durableEventIds;
-  private lastStampMs;
-  private proposalReceiptCount;
-  private constructor();
-  /** Open the recorder and append the plan. An existing ledger for the same
-   *  run is re-read first, so a resumed run keeps one plan and one lineage. */
-  static open<TScenario extends Scenario, TArtifact>(opts: SearchRecorderOptions<TScenario>): Promise<SearchRecorder<TScenario, TArtifact>>;
-  /**
-   * Record one generation's candidate-generation call and the candidates it
-   * produced. A proposal larger than the planned population extends the plan
-   * with the extra slots; a proposal that fills fewer closes the rest.
-   */
-  recordGeneration(input: {
-    generation: number;
-    parentSurfaceHash: string;
-    candidates: ReadonlyArray<ProposedSearchCandidate>;
-  }): Promise<void>;
-  /** Append one task attempt per designed cell of each candidate campaign. */
-  recordResults(candidates: ReadonlyArray<MeasuredSearchCandidate<TArtifact>>): Promise<void>;
-  /**
-   * Close the search: unreached generations, the selection operation, one
-   * decision per candidate, then the terminal event.
-   *
-   * The terminal event is appended only when canonical replay accounts for the
-   * whole planned denominator. An interrupted or partly unscored search stays
-   * `in-progress` and its receipt reports the exact gap, instead of claiming a
-   * closed search.
-   */
-  finish(input: {
-    winnerSurfaceHash: string;
-    generationsRun: number;
-    runId: string;
-  }): Promise<SearchHistoryReceipt>;
-  /** Bounded receipt over the exact ledger bytes this run produced. */
-  receipt(runId: string): Promise<SearchHistoryReceipt>;
-  /** Read an existing ledger for this run so a resume continues it. */
-  private hydrate;
-  private plan;
-  private registeredSlot;
-  private remember;
-  private recordGenerationOperation;
-  private closeSlot;
-  /** Spend booked to candidate generation since the previous generation. */
-  private proposalAccounting;
-  private cellModel;
-  private proposalArtifact;
-  /** Write one canonical evidence document and return its content address. */
-  private writeArtifact;
-  private append;
-  /** Non-decreasing ISO stamps; the ledger refuses an event that moves back. */
-  private stamp;
-}
-/**
- * Record an optimizer's own candidate graph into the same ledger.
- *
- * A complete optimization method searches inside its own process and reports
- * one artifact when it finishes: the candidate population, with each
- * candidate's parents and its score per selection scenario. This turns that
- * artifact into the canonical event stream, so a first-party method returns
- * the same `SearchHistoryReceipt` the in-process loop returns, and
- * `compareOptimizationMethods({ searchHistoryPolicy: 'require-complete' })`
- * accepts it.
- *
- * A candidate the optimizer left unscored on a planned scenario leaves the
- * planned denominator open, so the receipt reports the gap instead of closing
- * the search.
+ * Record an optimizer's own candidate graph into the same ledger.
+ *
+ * A complete optimization method searches inside its own process and reports
+ * one artifact when it finishes: the candidate population, with each
+ * candidate's parents and its score per selection scenario. This turns that
+ * artifact into the canonical event stream, so a first-party method returns
+ * the same `SearchHistoryReceipt` the in-process loop returns, and
+ * `compareOptimizationMethods({ searchHistoryPolicy: 'require-complete' })`
+ * accepts it.
+ *
+ * A candidate the optimizer left unscored on a planned scenario leaves the
+ * planned denominator open, so the receipt reports the gap instead of closing
+ * the search.
  */
 declare function recordCandidatePopulationSearch<TScenario extends Scenario>(input: {
   ledger: SearchLedger;
@@ -1614,49 +1178,6 @@ declare function recordCandidatePopulationSearch<TScenario extends Scenario>(inp
   runId: string;
 }): Promise<SearchHistoryReceipt>;
 //#endregion
-//#region src/campaign/parent-selection.d.ts
-/** Search state supplied to one parent-selection call. */
-interface ParentSelectionContext {
-  /** Non-dominated scored surfaces across the whole run so far, including the
-   *  baseline (`generation: -1`). Never empty. */
-  readonly frontier: ReadonlyArray<ParetoParent>;
-  /** Measured result of the global incumbent, the promotion bar. Under the
-   *  default `selectionRankKey` the incumbent is always on `frontier`. */
-  readonly incumbent: ScoredSurfaceOutcome;
-  /** Every completed generation so far. */
-  readonly history: ReadonlyArray<GenerationRecord>;
-  /** Index of the generation about to propose. */
-  readonly generation: number;
-}
-/** Chooses the surface the next generation mutates. Returns one frontier
- *  parent; `runOptimization` refuses a parent it has not measured to
- *  completion or whose surface does not match its `surfaceHash`. */
-type ParentSelector = (ctx: ParentSelectionContext) => ParetoParent;
-interface CrowdedFrontierParentOptions {
-  /** Integer seed for the per-generation draw. The same seed, frontier, and
-   *  generation index select the same parent. */
-  seed: number;
-}
-/**
- * NSGA-II crowded tournament selection over the frontier. Each generation
- * draws two distinct frontier members with a PRNG seeded from `seed` and the
- * generation index, and keeps the one with the larger crowding distance (more
- * isolated on the frontier). Boundary parents carry infinite distance, so a
- * boundary parent always beats an interior one. A tie on distance falls back
- * to the higher mean composite, then to the smaller surface hash. A frontier
- * of one member returns that member.
- */
-declare function crowdedFrontierParent(options: CrowdedFrontierParentOptions): ParentSelector;
-//#endregion
-//#region src/campaign/presets/run-eval.d.ts
-interface RunEvalOptions<TScenario extends Scenario, TArtifact> extends Omit<RunCampaignOptions<TScenario, TArtifact>, 'runDir'> {
-  runDir: string;
-}
-/**
- * Simplest evaluation preset: run scenarios through dispatch, score with judges, and return a `CampaignResult` — no optimizer, no gate, no PR.
- */
-declare function runEval<TScenario extends Scenario, TArtifact>(opts: RunEvalOptions<TScenario, TArtifact>): Promise<CampaignResult<TArtifact, TScenario>>;
-//#endregion
 //#region src/campaign/presets/run-optimization.d.ts
 interface PremeasuredOptimizationBaseline<TArtifact, TScenario extends Scenario> {
   /** Hash of the exact surface that produced `campaign`. */
@@ -1714,146 +1235,653 @@ interface RunOptimizationBaseOptions<TScenario extends Scenario, TArtifact> exte
     costPhase?: string;
   }) => Promise<ReadonlyArray<ProposalFinding>>;
   /**
-   * Optional override for how the WINNER is selected among coverage-complete
-   * candidates (and how the incumbent bar is set). Returns a lexicographic rank
-   * key — each element higher-is-better; candidates are ranked by descending key
-   * (`compareRankKeys`) and the top must STRICTLY beat the incumbent's key to
-   * promote. Defaults to `[campaignMeanComposite(campaign)]`, i.e. the historical
-   * scalar-mean ranking (single-element key ⇒ identical behavior).
-   *
-   * A binary-with-replicates consumer (e.g. swe-arena, whose ship-gate counts an
-   * instance resolved only when EVERY replicate resolved) passes a fail-closed
-   * key built from the SAME reduction its gate uses, so winner-selection and the
-   * ship-gate rank on the identical metric and can never invert — the selector
-   * cannot promote a flaky per-cell-mean candidate the gate would reject over a
-   * fail-closed candidate the gate would accept. Only the winner CHOICE changes;
-   * the descriptive `composite` (mean) on every record and the Pareto objective
-   * vectors are untouched, so proposer diversity and reporting are unaffected.
+   * Optional override for how the WINNER is selected among coverage-complete
+   * candidates (and how the incumbent bar is set). Returns a lexicographic rank
+   * key — each element higher-is-better; candidates are ranked by descending key
+   * (`compareRankKeys`) and the top must STRICTLY beat the incumbent's key to
+   * promote. Defaults to `[campaignMeanComposite(campaign)]`, i.e. the historical
+   * scalar-mean ranking (single-element key ⇒ identical behavior).
+   *
+   * A binary-with-replicates consumer (e.g. swe-arena, whose ship-gate counts an
+   * instance resolved only when EVERY replicate resolved) passes a fail-closed
+   * key built from the SAME reduction its gate uses, so winner-selection and the
+   * ship-gate rank on the identical metric and can never invert — the selector
+   * cannot promote a flaky per-cell-mean candidate the gate would reject over a
+   * fail-closed candidate the gate would accept. Only the winner CHOICE changes;
+   * the descriptive `composite` (mean) on every record and the Pareto objective
+   * vectors are untouched, so proposer diversity and reporting are unaffected.
+   */
+  selectionRankKey?: (campaign: CampaignResult<TArtifact, TScenario>) => number[];
+  /**
+   * Optional policy for which scored surface the next generation MUTATES.
+   * Absent, every generation mutates the global incumbent, so the recorded
+   * `parentSurfaceHash` lineage is a chain. Present, the selector receives the
+   * Pareto frontier so far, the measured incumbent, the generation history,
+   * and the generation index, and returns one frontier parent; the loop hands
+   * that parent to `propose()` as `currentSurface` + `parentOutcome` and
+   * records it as every candidate's `parentSurfaceHash`. Promotion is
+   * unchanged: a candidate still has to beat the incumbent. The loop refuses
+   * a parent it has not measured to completion. `crowdedFrontierParent` is
+   * the provided seeded policy.
+   */
+  selectParent?: ParentSelector;
+  /**
+   * Record this search into a durable `SearchLedger`. The loop emits the plan,
+   * each candidate-generation operation, each candidate registration with its
+   * measured parent, one task attempt per designed cell, one decision per
+   * candidate, and the terminal event, then returns a bounded
+   * `searchHistory` receipt over the exact ledger bytes.
+   *
+   * `identity` declares what the ledger requires and a campaign cannot infer:
+   * immutable revisions for the agent, proposer, and search implementations,
+   * and the model the agent runs when a cell reports none.
+   */
+  searchLedger?: SearchLedgerBinding;
+}
+type RunOptimizationOptions<TScenario extends Scenario, TArtifact> = RunOptimizationBaseOptions<TScenario, TArtifact>;
+interface RunOptimizationResult<TArtifact, TScenario extends Scenario> {
+  generations: Array<{
+    record: GenerationRecord;
+    surfaces: Array<{
+      surfaceHash: string;
+      surface: MutableSurface;
+      campaign: CampaignResult<TArtifact, TScenario>;
+    }>;
+  }>;
+  /** Frozen snapshot of the exact starting surface measured by `baselineCampaign`. */
+  baselineSurface: MutableSurface;
+  winnerSurface: MutableSurface;
+  winnerSurfaceHash: string;
+  /** Proposer label for the promoted surface. Present when the winning
+   *  candidate came from a `ProposedCandidate` (a reflective proposer);
+   *  absent when the winner is the baseline or a bare-surface mutator. */
+  winnerLabel?: string;
+  /** Proposer rationale for the promoted surface — the "because Z" that
+   *  motivated the winning change. Survives to `SelfImproveResult` and the
+   *  emitted provenance record. Absent when the winner is the baseline. */
+  winnerRationale?: string;
+  baselineCampaign: CampaignResult<TArtifact, TScenario>;
+  /** Run-wide spend, including agents, proposers, analysts, and judges. */
+  cost: CostLedgerSummary;
+  /** Bounded proof envelope over the canonical search ledger. Present only
+   *  when `searchLedger` was supplied. `complete` is false when the search was
+   *  interrupted or a candidate left a designed cell unscored. */
+  searchHistory?: SearchHistoryReceipt;
+  /** The GEPA Pareto frontier across every scored surface (baseline + all
+   *  generations) by per-scenario objective vector — the non-dominated set.
+   *  Each generation's `propose()` received the frontier-so-far as
+   *  `ctx.paretoParents`; this is the final frontier. A surface here that is
+   *  NOT the winner is uniquely best on some scenario the winner loses on. */
+  paretoFrontier: ParetoParent[];
+}
+/**
+ * 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.
+ */
+declare function runOptimization<TScenario extends Scenario, TArtifact>(opts: RunOptimizationOptions<TScenario, TArtifact>): Promise<RunOptimizationResult<TArtifact, TScenario>>;
+//#endregion
+//#region src/campaign/presets/run-improvement-loop.d.ts
+type RunImprovementLoopOptions<TScenario extends Scenario, TArtifact> = RunOptimizationOptions<TScenario, TArtifact> & {
+  /** Holdout scenarios kept OUT of the training optimization pool — used
+   *  ONLY to score baseline vs winner for the gate. */
+  holdoutScenarios: TScenario[];
+  /** Holdout policy. Default `'measured'`: baseline + winner are re-scored on
+   *  `holdoutScenarios` and the gate decides on that held-out comparison.
+   *  `'deferred'`: the improvement-set (search) campaigns run exactly as usual,
+   *  but ZERO holdout cells are dispatched, the gate is forced to `'hold'`, and
+   *  the result + provenance record carry `holdout: 'deferred'` with NO
+   *  held-out lift — for callers that measure the held-out comparison in a
+   *  separate later run instead of faking a static holdout scenario and
+   *  recording a meaningless lift. */
+  holdout?: 'measured' | 'deferred';
+  /** Promotion gate. Substrate strongly recommends `defaultProductionGate`
+   *  for production wiring (composes red-team / reward-hacking / canary /
+   *  heldout). */
+  gate: Gate<TArtifact, TScenario>;
+  /** What to do when the gate ships:
+   *   - `'pr'`: open a PR via `openAutoPr`
+   *   - `'none'`: just report — caller decides what to do with the winner
+   *  Live-runtime self-mutation is intentionally unsupported. */
+  autoOnPromote: 'pr' | 'none';
+  /** GH owner / repo for the auto-PR. Required when autoOnPromote === 'pr'. */
+  ghOwner?: string;
+  ghRepo?: string;
+  /** Placebo control. When supplied AND the winner differs from baseline, the
+   *  loop scores a THIRD holdout arm: the winner surface with its content
+   *  footprint-matched-blanked by this function (typically via `neutralizeText`).
+   *  Its scores are exposed to the gate as `ctx.neutralizedJudgeScores`, letting
+   *  a `neutralizationGate` reject a win whose lift survives blanking the content
+   *  (decorative — driven by footprint, not content). Costs one extra holdout
+   *  campaign; omit to skip. Return a byte/layout-matched blank of the winner. */
+  neutralize?: (winnerSurface: MutableSurface, baselineSurface: MutableSurface) => MutableSurface;
+};
+interface RunImprovementLoopResult<TArtifact, TScenario extends Scenario> extends RunOptimizationResult<TArtifact, TScenario> {
+  baselineOnHoldout: CampaignResult<TArtifact, TScenario>;
+  winnerOnHoldout: CampaignResult<TArtifact, TScenario>;
+  neutralizedOnHoldout?: CampaignResult<TArtifact, TScenario>;
+  neutralizedSurface?: MutableSurface;
+  gateResult: Awaited<ReturnType<Gate<TArtifact, TScenario>['decide']>>;
+  /** Present iff the loop ran with `holdout: 'deferred'`. When set,
+   *  `baselineOnHoldout`/`winnerOnHoldout` are the shared EMPTY campaign (zero
+   *  cells dispatched) and the gate verdict is the forced `'hold'`. */
+  holdout?: 'deferred';
+  /** Unified baseline→winner surface diff. Computed UNCONDITIONALLY (not only
+   *  when `autoOnPromote === 'pr'`) so the diff that the gate decided on is
+   *  always present on the result + in the emitted provenance record. Empty
+   *  string when winner == baseline (no change to diff). */
+  promotedDiff: string;
+  prResult?: ReturnType<typeof openAutoPr>;
+}
+/**
+ * Gated-promotion shell over `runOptimization`: scores the winner against the baseline on a holdout set, runs the release gate, and optionally opens a PR.
+ */
+declare function runImprovementLoop<TScenario extends Scenario, TArtifact>(opts: RunImprovementLoopOptions<TScenario, TArtifact>): Promise<RunImprovementLoopResult<TArtifact, TScenario>>;
+//#endregion
+//#region src/campaign/transient-failure.d.ts
+interface TransientFailureOptions {
+  /**
+   * Treat full-duration timeouts ("timeout after 180000ms") as transient.
+   * Enable on saturated shared infrastructure where queue starvation eats
+   * the clock; leave off when the agent had the resources and simply failed.
+   * Default false.
+   */
+  readonly retryFullDurationTimeouts?: boolean;
+  /** Additional caller-specific transient patterns. */
+  readonly extraPatterns?: readonly RegExp[];
+}
+/**
+ * True when the error text describes an infrastructure hiccup that should be
+ * retried rather than scored. Empty/undefined input is not transient.
+ */
+declare function isTransientTransportFailure(message: string | null | undefined, opts?: TransientFailureOptions): boolean;
+/**
+ * Ready-made `cellRetry.retryable` predicate: true for a dispatch-stage
+ * failure whose error message `isTransientTransportFailure` classifies as an
+ * infrastructure hiccup. A judge-stage failure is never retried here — the
+ * dispatch already produced an artifact, so re-dispatching would score a
+ * different sample. A per-cell dispatch deadline ("dispatch exceeded <N>ms")
+ * is not transient by default; opt in via `extraPatterns` or
+ * `retryFullDurationTimeouts` when queue starvation eats the clock.
+ */
+declare function transientDispatchFailure(opts?: TransientFailureOptions): (failure: CampaignCellFailureReceipt['failure']) => boolean;
+//#endregion
+//#region src/llm-judge.d.ts
+/** A rubric dimension as a bare key or the full `{ key, description }` shape. A
+ *  bare string uses the key as its own description. */
+type LlmJudgeDimension = string | JudgeDimension;
+interface LlmJudgeOptions<TArtifact, TScenario extends Scenario = Scenario> {
+  /** The injected LLM transport. One `chat()` call per `score()`. Required —
+   *  there is no default route, so a misconfigured judge fails at construction,
+   *  never silently against the free-tier router. */
+  chat: ChatClient;
+  /** Rubric dimensions the model scores. Each becomes a `[0,1]` field of the
+   *  returned `JudgeScore.dimensions`. Defaults to a single `quality` dimension. */
+  dimensions?: LlmJudgeDimension[];
+  /** Model id. Falls back to `chat.defaultModel`; one of the two MUST resolve. */
+  model?: string;
+  /** Explicit scoring revision for opaque transport or renderer changes. */
+  judgeVersion?: string;
+  temperature?: number;
+  maxTokens?: number;
+  /** Composite weights forwarded to `weightedComposite`: a partial map selects
+   *  AND weights exactly the named dimensions. Omit for a uniform mean. */
+  weights?: Record<string, number>;
+  /**
+   * How to read a score out of the model's answer.
+   *
+   * `'sampled'` (default) reads the number the model emitted. Discrete grades
+   * tie often, and a tie carries no ranking signal.
+   *
+   * `'expectation'` asks the provider for the log probabilities of the score
+   * token and returns the expected value over the integer grades the model
+   * considered, so two answers that both sample `8` separate by how much mass
+   * sat on `7` and `9`. It requires `scale: 'ten'`: an integer grade is one
+   * token, and a `unit` float is not. `whenUnavailable` decides what happens
+   * when the provider returns no log probabilities, or the grade did not land
+   * in one token: `'fail'` throws, `'sampled'` reads the emitted number and
+   * records `scoringMethod: 'sampled'` on the score.
+   */
+  scoring?: {
+    method: 'sampled';
+  } | {
+    method: 'expectation';
+    whenUnavailable: 'fail' | 'sampled';
+  };
+  /** Scale the model is prompted to score on, normalized into `[0,1]`:
+   *   - `'unit'`  (default): the model returns `[0,1]` directly.
+   *   - `'ten'`:  the model returns `[0,10]`; divided by 10 here.
+   *  The prompt is annotated with the expected range either way. */
+  scale?: 'unit' | 'ten';
+  /** Run this judge only on matching scenarios (mirrors `JudgeConfig.appliesTo`). */
+  appliesTo?: (scenario: TScenario) => boolean;
+  /** Render the artifact + scenario into the user message. Default:
+   *  pretty-printed JSON of `{ scenario, artifact }`. */
+  renderUser?: (input: {
+    artifact: TArtifact;
+    scenario: TScenario;
+  }) => string;
+  /** Strict runtime contract; its JSON Schema is sent to the provider. */
+  costLedger?: CostLedgerHandle;
+  responseSchema?: {
+    name: string;
+    schema: z.ZodObject;
+  };
+}
+/**
+ * Build a campaign-shaped `JudgeConfig` whose `score()` makes ONE LLM call
+ * against `prompt` and reduces the model's per-dimension scores to a canonical
+ * `JudgeScore` in `[0,1]`.
+ *
+ * The model is instructed to return JSON `{ "dimensions": { <key>: <number>, … },
+ * "notes": "…" }`; the helper strips fenced JSON, validates every declared
+ * dimension is present and in range, normalizes by `scale`, and composites via
+ * `weightedComposite`.
+ */
+declare function llmJudge<TArtifact = unknown, TScenario extends Scenario = Scenario>(name: string, prompt: string, opts: LlmJudgeOptions<TArtifact, TScenario>): JudgeConfig<TArtifact, TScenario>;
+//#endregion
+//#region src/campaign/external-optimizer-observations.d.ts
+interface ExternalOptimizerObservationSummary {
+  scope: 'callback-submitted-candidates';
+  path: string;
+  sha256: `sha256:${string}`;
+  submittedCandidates: number;
+  evaluations: number;
+  refusals: number;
+}
+interface ExternalOptimizerExecutionSummary {
+  scope: 'runtime-model-calls';
+  path: string;
+  sha256: `sha256:${string}`;
+  calls: number;
+  succeeded: number;
+  failed: number;
+}
+interface ExternalOptimizerSubmittedCandidate {
+  /** Exact text or named-component surface submitted to the evaluation callback. */
+  readonly candidate: ExternalTextCandidate;
+  /** Eval's canonical content identity for `candidate`. */
+  readonly candidateHash: string;
+  readonly candidateDigest: `sha256:${string}`;
+  readonly proposalSequence: number;
+  /** Exact observation artifact that proves this candidate was submitted. */
+  readonly provenance: {
+    readonly path: string;
+    readonly sha256: `sha256:${string}`;
+  };
+}
+interface ExternalOptimizerObservationArtifact {
+  readonly summary: ExternalOptimizerObservationSummary;
+  readonly observations: readonly ExternalOptimizerEvaluationObservation[];
+  /** Every distinct callback-submitted candidate in proposal order. */
+  readonly candidates: readonly ExternalOptimizerSubmittedCandidate[];
+}
+/**
+ * Read and verify the exact callback observation artifact addressed by method provenance.
+ *
+ * The reader checks the raw SHA-256, canonical JSONL bytes, sequence, candidate
+ * identities, and summary counts before it returns any candidate.
+ * This proves that the bytes match the supplied summary. The caller remains
+ * responsible for obtaining that summary from trusted provenance.
+ */
+declare function readExternalOptimizerObservationArtifact(input: {
+  summary: ExternalOptimizerObservationSummary;
+  storage?: CampaignStorage;
+}): ExternalOptimizerObservationArtifact;
+//#endregion
+//#region src/campaign/presets/compare-optimization-methods.d.ts
+/** Shared campaign settings applied to every optimization method. */
+type OptimizationMethodRunOptions<TScenario extends Scenario, TArtifact> = Omit<RunCampaignOptions<TScenario, TArtifact>, 'costCeiling' | 'costLedger' | 'dispatch' | 'judges' | 'runDir' | 'scenarios' | 'seed'>;
+/** Cost reported by a method or by final test scoring. */
+interface ComparisonCost {
+  /** Known subtotal. Consult `costProvenance` before treating this as total spend. */
+  totalCostUsd: number;
+  /** Exact origin of the total; uncaptured means `totalCostUsd` is only a known subtotal. */
+  costProvenance: CostProvenance;
+  accountingComplete: boolean;
+  incompleteReasons: string[];
+}
+interface OptimizationPackageSource {
+  kind: 'package';
+  /** Whether package identity was inspected or supplied by caller code. */
+  evidence: 'observed' | 'declared';
+  package: string;
+  version: string;
+  sourceUrl?: string;
+  revision?: string;
+  /** SHA-256 of all installed module files observed before the run. */
+  sourceSha256?: string;
+}
+interface OptimizationModuleSource {
+  module: string;
+  sourceSha256: string;
+}
+interface OptimizationPythonRuntime {
+  implementation: string;
+  version: string;
+}
+interface OptimizationTokenUsage {
+  /** All input tokens, including cache reads and cache creation. */
+  inputTokens: number;
+  /** Input tokens served from a provider cache. */
+  cachedInputTokens?: number;
+  /** Input tokens used to create or write a provider cache entry. */
+  cacheWriteInputTokens?: number;
+  outputTokens: number;
+  /** Reasoning tokens included in `outputTokens`. */
+  reasoningTokens?: number;
+  totalTokens: number;
+  calls: number;
+}
+interface OptimizationMethodProvenance {
+  /** External optimizer package. */
+  source: OptimizationPackageSource;
+  /** Python bridge package that invoked the optimizer. */
+  bridge?: OptimizationPackageSource;
+  /** Custom engine modules imported by the optimizer. */
+  modules?: OptimizationModuleSource[];
+  /** Python implementation used by the bridge process. */
+  python?: OptimizationPythonRuntime;
+  /** Exact model identifier configured for optimizer-owned model calls. */
+  optimizerModel?: string;
+  /** Stable public identity of the execution-owner callback. */
+  optimizerCallRef?: string;
+  runId: string;
+  /** Content identity shared by compatible resumptions. */
+  compatibleRunId?: string;
+  resumed: boolean;
+  /** Whether the run seed reached every external engine configuration. */
+  seedApplied?: boolean;
+  /** Evaluations the local callback metered — the trusted count. */
+  evaluationCount: number;
+  /**
+   * Evaluation total the external optimizer reported from its own counters.
+   * A difference from `evaluationCount` means upstream skipped, cached, or
+   * double-counted work; inspect before trusting upstream-derived budgets.
+   */
+  upstreamReportedEvaluations?: number;
+  artifactDir: string;
+  tokenUsage?: OptimizationTokenUsage;
+  /** Candidates submitted to the callback, per-case scores, and refusals. */
+  observations?: ExternalOptimizerObservationSummary;
+  /** Exact accepted GEPA candidates, parent indices, and selection scores. */
+  gepaCandidatePopulation?: GepaCandidatePopulationSummary;
+  /** Opaque Runtime execution evidence for every invoked optimizer-model call. */
+  modelExecutions?: ExternalOptimizerExecutionSummary;
+  /** Anthropic-endpoint proxy traffic from agent CLI engines, when enabled. */
+  anthropicEndpoint?: ExternalOptimizerWireCounts;
+}
+/** Shared inputs for one optimization method. Final test data is absent. */
+interface OptimizationMethodInput<TScenario extends Scenario, TArtifact> {
+  /** Surface every method starts from. */
+  readonly baselineSurface: MutableSurface;
+  /** Evidence used to author or fit candidates. */
+  readonly trainScenarios: readonly TScenario[];
+  /** Data used for candidate acceptance, early stopping, and model selection. */
+  readonly selectionScenarios: readonly TScenario[];
+  /** Runs one scenario with a candidate surface. */
+  readonly dispatchWithSurface: (surface: MutableSurface, scenario: TScenario, ctx: DispatchContext) => Promise<TArtifact>;
+  /** Scores artifacts produced by `dispatchWithSurface`. */
+  readonly judges: readonly JudgeConfig<TArtifact, TScenario>[];
+  /** Method-specific artifacts are written below this directory. */
+  readonly runDir: string;
+  readonly seed: number;
+  /** Shared defaults for every method. A method may override them explicitly. */
+  readonly runOptions: Readonly<OptimizationMethodRunOptions<TScenario, TArtifact>>;
+  /** Durable spend account shared by every method and final scoring. */
+  readonly costLedger: CostLedgerHandle;
+}
+interface OptimizationMethodResult {
+  /** Surface selected without using the final test partition. */
+  winnerSurface: MutableSurface;
+  /** Optimization spend. Excludes final test scoring. */
+  cost: ComparisonCost;
+  /** Optimization duration. Excludes final test scoring. */
+  durationMs?: number;
+  /** Exact external implementation and run identity, when the method uses one. */
+  provenance?: OptimizationMethodProvenance;
+  /** Bounded proof envelope over the canonical SearchLedger for this optimization. */
+  searchHistory?: SearchHistoryReceipt;
+}
+/** A complete optimization method, including candidate generation and selection. */
+interface OptimizationMethod<TScenario extends Scenario = Scenario, TArtifact = unknown> {
+  /** Unique, trimmed display name. Its normalized form must also be unique. */
+  name: string;
+  optimize: (input: OptimizationMethodInput<TScenario, TArtifact>) => Promise<OptimizationMethodResult>;
+}
+interface OptimizationMethodScore {
+  name: string;
+  /** Mean final-test composite of the baseline (identical across methods). */
+  baselineComposite: number;
+  /** Mean final-test composite of this method's selected surface. */
+  winnerComposite: number;
+  /** Mean per-scenario final-test lift (winner minus baseline). */
+  lift: number;
+  /** Simultaneous paired-bootstrap interval for per-scenario lift.
+   *  `low > 0` excludes zero after adjustment for all reported contrasts. */
+  liftCi: {
+    low: number;
+    high: number;
+  };
+  /** Optimization spend reported by the method. Excludes final test scoring. */
+  optimizationCost: ComparisonCost;
+  /** Optimization duration reported by the method. Excludes final test scoring. */
+  durationMs?: number;
+  /** Exact external implementation and run identity, when reported by the method. */
+  provenance?: OptimizationMethodProvenance;
+  /** Paired final-test values used to compute lift and its interval. */
+  scenarioScores: Array<{
+    scenarioId: string;
+    baselineComposite: number;
+    winnerComposite: number;
+    lift: number;
+  }>;
+  winnerSurface: MutableSurface;
+  /** 1-based, by descending lift. */
+  rank: number;
+}
+interface OptimizationMethodPairwise {
+  /** Higher-ranked method. */
+  a: string;
+  b: string;
+  /** Mean per-scenario untouched-test delta (a − b). */
+  deltaMean: number;
+  low: number;
+  high: number;
+  /** `a` if the CI clears 0, `b` if it is entirely negative, else `'tie'`. */
+  favored: string;
+}
+interface OptimizationMethodComparison {
+  /** Sorted by descending lift; `rank` set accordingly. */
+  scores: OptimizationMethodScore[];
+  best: OptimizationMethodScore;
+  /** Best vs each other method, using simultaneous paired-bootstrap intervals. */
+  pairwise: OptimizationMethodPairwise[];
+  testScenarioIds: string[];
+  /** Sum of the costs reported by every optimization method. */
+  optimizationCost: ComparisonCost;
+  /** Baseline and distinct winner scoring on the final test partition. */
+  testCost: ComparisonCost;
+  /** Optimization plus final test scoring. */
+  totalCost: ComparisonCost;
+  /** Caller-requested simultaneous coverage across all reported contrasts. */
+  confidence: number;
+  /** Bonferroni-adjusted confidence used for each bootstrap interval. */
+  intervalConfidence: number;
+  /** Method-vs-baseline plus all possible method-vs-method contrasts. */
+  comparisonCount: number;
+  /** Deterministic bootstrap and campaign seed. */
+  seed: number;
+  /** Bootstrap draws used for each interval. */
+  resamples: number;
+  /** Agent runs averaged within each test scenario before resampling scenarios. */
+  reps: number;
+  /** Coverage of every method's canonical search history. */
+  searchHistory: SearchHistoryCoverage;
+}
+interface CompareOptimizationMethodsOptions<TScenario extends Scenario, TArtifact> extends Omit<RunCampaignOptions<TScenario, TArtifact>, 'dispatch' | 'judges' | 'scenarios'> {
+  methods: OptimizationMethod<TScenario, TArtifact>[];
+  baselineSurface: MutableSurface;
+  /** Evidence used by every optimizer to author or fit candidates. */
+  trainScenarios: TScenario[];
+  /** Candidate acceptance, early-stopping, and optimizer-selection data. */
+  selectionScenarios: TScenario[];
+  /** Untouched final comparison data. Never passed to an optimization method. */
+  testScenarios: TScenario[];
+  /** Scores a surface on a scenario. The methods and final test share this function. */
+  dispatchWithSurface: (surface: MutableSurface, scenario: TScenario, ctx: DispatchContext) => Promise<TArtifact>;
+  judges: JudgeConfig<TArtifact, TScenario>[];
+  /** Bootstrap resamples for the lift intervals. Default is at least 2000 and
+   *  rises when the requested simultaneous confidence needs finer tails. */
+  resamples?: number;
+  /** Shared defaults for each method's train and selection campaigns. */
+  optimizationRunOptions?: OptimizationMethodRunOptions<TScenario, TArtifact>;
+  /** Number of optimization methods to run concurrently. Default 1. */
+  optimizationConcurrency?: number;
+  /** Simultaneous confidence across method-vs-baseline and method-vs-method contrasts.
+   *  Each bootstrap interval is Bonferroni-adjusted. Default 0.95. */
+  confidence?: number;
+  /** Shared spend limit across every method's optimizer and evaluation calls plus final scoring. */
+  costCeiling?: number;
+  /**
+   * Missing history is reported by default. Publication-grade or autonomous
+   * callers set `require-complete`, which aborts before the first final-test call.
+   */
+  searchHistoryPolicy?: SearchHistoryPolicy;
+}
+/**
+ * Compare complete optimization methods on disjoint train, selection, and final test data.
+ */
+declare function compareOptimizationMethods<TScenario extends Scenario, TArtifact>(opts: CompareOptimizationMethodsOptions<TScenario, TArtifact>): Promise<OptimizationMethodComparison>;
+/** Keep the cost fields a custom optimization method must report. */
+declare function costFromLedgerSummary(summary: CostLedgerSummary): ComparisonCost;
+/** Preserve every optimizer token class while keeping total input and output explicit. */
+declare function optimizationTokenUsageFromSummary(summary: CostLedgerSummary, receipts: readonly CostReceipt[]): OptimizationTokenUsage | undefined;
+/** Combine method costs without turning one unknown bill into a known total. */
+declare function combineComparisonCosts(entries: ReadonlyArray<{
+  label: string;
+  cost: ComparisonCost;
+}>): ComparisonCost;
+//#endregion
+//#region src/canary.d.ts
+type CanaryKind = 'silent_judge_fallback' | 'judge_calibration_drift' | 'distribution_shift';
+type CanarySeverity = 'info' | 'warn' | 'error';
+interface CanaryAlert {
+  kind: CanaryKind;
+  severity: CanarySeverity;
+  message: string;
+  /** Numbers that informed the decision — drop straight into a
+   *  dashboard / paper figure. */
+  evidence: Record<string, unknown>;
+}
+interface CanaryReport {
+  alerts: CanaryAlert[];
+  /** Per-kind summary count. */
+  counts: Record<CanaryKind, number>;
+  /** Whether each enabled detector had enough observations to run. */
+  evaluations: CanaryEvaluation[];
+}
+interface CanaryEvaluation {
+  kind: CanaryKind;
+  status: 'evaluated' | 'not_evaluated';
+  observations: number;
+  reason?: string;
+}
+interface CanaryOptions {
+  /**
+   * Silent-fallback detection.
+   * - `constant`: confidence value treated as the fallback signal.
+   *   Default 0.30 (matches the soft-fail default in
+   *   `propose-review.ts`).
+   * - `consecutiveThreshold`: trip the alert after this many
+   *   consecutive runs at `constant` (or `fallback === true`).
+   *   Default 3.
    */
-  selectionRankKey?: (campaign: CampaignResult<TArtifact, TScenario>) => number[];
+  silentFallback?: {
+    constant?: number;
+    consecutiveThreshold?: number;
+    /** Floating-point tolerance when comparing against `constant`. */
+    epsilon?: number;
+  };
   /**
-   * Optional policy for which scored surface the next generation MUTATES.
-   * Absent, every generation mutates the global incumbent, so the recorded
-   * `parentSurfaceHash` lineage is a chain. Present, the selector receives the
-   * Pareto frontier so far, the measured incumbent, the generation history,
-   * and the generation index, and returns one frontier parent; the loop hands
-   * that parent to `propose()` as `currentSurface` + `parentOutcome` and
-   * records it as every candidate's `parentSurfaceHash`. Promotion is
-   * unchanged: a candidate still has to beat the incumbent. The loop refuses
-   * a parent it has not measured to completion. `crowdedFrontierParent` is
-   * the provided seeded policy.
+   * Calibration-drift detection.
+   * - `historyWindow`: number of past runs (oldest-first) treated as
+   *   the historical baseline. Default 50.
+   * - `recentWindow`: number of recent runs (newest-first) compared
+   *   against history. Default 20.
+   * - `ksAlpha`: alpha for the KS statistic vs critical value.
+   *   Default 0.05.
+   * - `minRecent`: minimum recent runs required to even attempt the
+   *   check. Default 10.
    */
-  selectParent?: ParentSelector;
+  calibrationDrift?: {
+    historyWindow?: number;
+    recentWindow?: number;
+    ksAlpha?: number;
+    minRecent?: number;
+  };
   /**
-   * Record this search into a durable `SearchLedger`. The loop emits the plan,
-   * each candidate-generation operation, each candidate registration with its
-   * measured parent, one task attempt per designed cell, one decision per
-   * candidate, and the terminal event, then returns a bounded
-   * `searchHistory` receipt over the exact ledger bytes.
-   *
-   * `identity` declares what the ledger requires and a campaign cannot infer:
-   * immutable revisions for the agent, proposer, and search implementations,
-   * and the model the agent runs when a cell reports none.
+   * Distribution-shift detection.
+   * - `category`: function that maps a run to a categorical bucket.
+   *   Required to enable this canary; if omitted the chi-square check
+   *   is skipped entirely.
+   * - `chiSquareAlpha`: alpha. Default 0.05.
+   * - `historyWindow`, `recentWindow`, `minRecent`: like above.
    */
-  searchLedger?: SearchLedgerBinding;
-}
-type RunOptimizationOptions<TScenario extends Scenario, TArtifact> = RunOptimizationBaseOptions<TScenario, TArtifact>;
-interface RunOptimizationResult<TArtifact, TScenario extends Scenario> {
-  generations: Array<{
-    record: GenerationRecord;
-    surfaces: Array<{
-      surfaceHash: string;
-      surface: MutableSurface;
-      campaign: CampaignResult<TArtifact, TScenario>;
-    }>;
-  }>;
-  /** Frozen snapshot of the exact starting surface measured by `baselineCampaign`. */
-  baselineSurface: MutableSurface;
-  winnerSurface: MutableSurface;
-  winnerSurfaceHash: string;
-  /** Proposer label for the promoted surface. Present when the winning
-   *  candidate came from a `ProposedCandidate` (a reflective proposer);
-   *  absent when the winner is the baseline or a bare-surface mutator. */
-  winnerLabel?: string;
-  /** Proposer rationale for the promoted surface — the "because Z" that
-   *  motivated the winning change. Survives to `SelfImproveResult` and the
-   *  emitted provenance record. Absent when the winner is the baseline. */
-  winnerRationale?: string;
-  baselineCampaign: CampaignResult<TArtifact, TScenario>;
-  /** Run-wide spend, including agents, proposers, analysts, and judges. */
-  cost: CostLedgerSummary;
-  /** Bounded proof envelope over the canonical search ledger. Present only
-   *  when `searchLedger` was supplied. `complete` is false when the search was
-   *  interrupted or a candidate left a designed cell unscored. */
-  searchHistory?: SearchHistoryReceipt;
-  /** The GEPA Pareto frontier across every scored surface (baseline + all
-   *  generations) by per-scenario objective vector — the non-dominated set.
-   *  Each generation's `propose()` received the frontier-so-far as
-   *  `ctx.paretoParents`; this is the final frontier. A surface here that is
-   *  NOT the winner is uniquely best on some scenario the winner loses on. */
-  paretoFrontier: ParetoParent[];
+  distributionShift?: {
+    category: (run: RunRecord) => string | null;
+    chiSquareAlpha?: number;
+    historyWindow?: number;
+    recentWindow?: number;
+    minRecent?: number;
+  };
 }
 /**
- * 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.
+ * Run all configured canaries against a chronological run list.
+ * Runs MUST be sorted oldest-to-newest by the caller — the order of
+ * the input is used to define "recent" vs "historical" windows.
  */
-declare function runOptimization<TScenario extends Scenario, TArtifact>(opts: RunOptimizationOptions<TScenario, TArtifact>): Promise<RunOptimizationResult<TArtifact, TScenario>>;
+declare function runCanaries(runs: RunRecord[], opts?: CanaryOptions): CanaryReport;
 //#endregion
-//#region src/campaign/presets/run-improvement-loop.d.ts
-type RunImprovementLoopOptions<TScenario extends Scenario, TArtifact> = RunOptimizationOptions<TScenario, TArtifact> & {
-  /** Holdout scenarios kept OUT of the training optimization pool — used
-   *  ONLY to score baseline vs winner for the gate. */
-  holdoutScenarios: TScenario[];
-  /** Holdout policy. Default `'measured'`: baseline + winner are re-scored on
-   *  `holdoutScenarios` and the gate decides on that held-out comparison.
-   *  `'deferred'`: the improvement-set (search) campaigns run exactly as usual,
-   *  but ZERO holdout cells are dispatched, the gate is forced to `'hold'`, and
-   *  the result + provenance record carry `holdout: 'deferred'` with NO
-   *  held-out lift — for callers that measure the held-out comparison in a
-   *  separate later run instead of faking a static holdout scenario and
-   *  recording a meaningless lift. */
-  holdout?: 'measured' | 'deferred';
-  /** Promotion gate. Substrate strongly recommends `defaultProductionGate`
-   *  for production wiring (composes red-team / reward-hacking / canary /
-   *  heldout). */
-  gate: Gate<TArtifact, TScenario>;
-  /** What to do when the gate ships:
-   *   - `'pr'`: open a PR via `openAutoPr`
-   *   - `'none'`: just report — caller decides what to do with the winner
-   *  Live-runtime self-mutation is intentionally unsupported. */
-  autoOnPromote: 'pr' | 'none';
-  /** GH owner / repo for the auto-PR. Required when autoOnPromote === 'pr'. */
-  ghOwner?: string;
-  ghRepo?: string;
-  /** Placebo control. When supplied AND the winner differs from baseline, the
-   *  loop scores a THIRD holdout arm: the winner surface with its content
-   *  footprint-matched-blanked by this function (typically via `neutralizeText`).
-   *  Its scores are exposed to the gate as `ctx.neutralizedJudgeScores`, letting
-   *  a `neutralizationGate` reject a win whose lift survives blanking the content
-   *  (decorative — driven by footprint, not content). Costs one extra holdout
-   *  campaign; omit to skip. Return a byte/layout-matched blank of the winner. */
-  neutralize?: (winnerSurface: MutableSurface, baselineSurface: MutableSurface) => MutableSurface;
-};
-interface RunImprovementLoopResult<TArtifact, TScenario extends Scenario> extends RunOptimizationResult<TArtifact, TScenario> {
-  baselineOnHoldout: CampaignResult<TArtifact, TScenario>;
-  winnerOnHoldout: CampaignResult<TArtifact, TScenario>;
-  neutralizedOnHoldout?: CampaignResult<TArtifact, TScenario>;
-  neutralizedSurface?: MutableSurface;
-  gateResult: Awaited<ReturnType<Gate<TArtifact, TScenario>['decide']>>;
-  /** Present iff the loop ran with `holdout: 'deferred'`. When set,
-   *  `baselineOnHoldout`/`winnerOnHoldout` are the shared EMPTY campaign (zero
-   *  cells dispatched) and the gate verdict is the forced `'hold'`. */
-  holdout?: 'deferred';
-  /** Unified baseline→winner surface diff. Computed UNCONDITIONALLY (not only
-   *  when `autoOnPromote === 'pr'`) so the diff that the gate decided on is
-   *  always present on the result + in the emitted provenance record. Empty
-   *  string when winner == baseline (no change to diff). */
-  promotedDiff: string;
-  prResult?: ReturnType<typeof openAutoPr>;
+//#region src/red-team.d.ts
+type RedTeamCategory = 'prompt_injection_direct' | 'prompt_injection_indirect' | 'jailbreak_persona' | 'jailbreak_dan' | 'pii_leak' | 'permission_escalation' | 'data_exfil' | 'policy_override';
+interface RedTeamPayload {
+  category: RedTeamCategory;
+  /** The hostile input the agent sees. */
+  input: string;
+  /**
+   * What a safe agent should do: "refuse" means explicit refusal,
+   * "ignore" means process benignly without executing the attack.
+   */
+  expected: 'refuse' | 'ignore';
+  /** Substring(s) that MUST NOT appear in output. */
+  forbiddenStrings?: string[];
+  /** Tool names the agent MUST NOT call for this scenario. */
+  forbiddenTools?: string[];
+}
+interface RedTeamCase extends DatasetScenario {
+  payload: RedTeamPayload;
+}
+interface RedTeamFinding {
+  scenarioId: string;
+  category: RedTeamCategory;
+  passed: boolean;
+  reason: string;
+  evidence?: string;
+}
+interface RedTeamReport {
+  findings: RedTeamFinding[];
+  passRateByCategory: Record<RedTeamCategory, number>;
+  overallPassRate: number;
 }
+/** Ship a canonical, small corpus. Consumers extend via `extendCorpus`. */
+declare const DEFAULT_RED_TEAM_CORPUS: RedTeamCase[];
+declare function redTeamDataset(extraCases?: RedTeamCase[]): Dataset;
 /**
- * Gated-promotion shell over `runOptimization`: scores the winner against the baseline on a holdout set, runs the release gate, and optionally opens a PR.
+ * Score a single agent response against the red-team case.
+ * `toolCalls` should be the names of tools the agent invoked during the run.
  */
-declare function runImprovementLoop<TScenario extends Scenario, TArtifact>(opts: RunImprovementLoopOptions<TScenario, TArtifact>): Promise<RunImprovementLoopResult<TArtifact, TScenario>>;
+declare function scoreRedTeamOutput(output: string, toolCalls: string[], rtCase: RedTeamCase): RedTeamFinding;
+/** Aggregate red-team findings into per-category pass rates. */
+declare function redTeamReport(findings: RedTeamFinding[]): RedTeamReport;
 //#endregion
 //#region src/campaign/provenance.d.ts
 interface LoopProvenanceCandidate {
@@ -1870,6 +1898,10 @@ interface LoopProvenanceCandidate {
   /** Proposer rationale — the "because Z". When the proposer returned a bare
    *  surface (blind mutator) this is absent. */
   rationale?: string;
+  /** Proposer-supplied typed attribution, carried unchanged from
+   *  `GenerationCandidate.attribution`. Opaque here; the producer's schema tag
+   *  governs interpretation. */
+  attribution?: Readonly<Record<string, unknown>>;
   /** Exact complete incumbent this candidate mutated. */
   parentSurfaceHash: string;
   /** Search-split composite of the exact parent. */
@@ -2077,33 +2109,5 @@ interface EmitLoopProvenanceArgs<TArtifact, TScenario extends Scenario> extends
  */
 declare function emitLoopProvenance<TArtifact, TScenario extends Scenario>(args: EmitLoopProvenanceArgs<TArtifact, TScenario>): Promise<EmitLoopProvenanceResult>;
 //#endregion
-//#region src/campaign/transient-failure.d.ts
-interface TransientFailureOptions {
-  /**
-   * Treat full-duration timeouts ("timeout after 180000ms") as transient.
-   * Enable on saturated shared infrastructure where queue starvation eats
-   * the clock; leave off when the agent had the resources and simply failed.
-   * Default false.
-   */
-  readonly retryFullDurationTimeouts?: boolean;
-  /** Additional caller-specific transient patterns. */
-  readonly extraPatterns?: readonly RegExp[];
-}
-/**
- * True when the error text describes an infrastructure hiccup that should be
- * retried rather than scored. Empty/undefined input is not transient.
- */
-declare function isTransientTransportFailure(message: string | null | undefined, opts?: TransientFailureOptions): boolean;
-/**
- * Ready-made `cellRetry.retryable` predicate: true for a dispatch-stage
- * failure whose error message `isTransientTransportFailure` classifies as an
- * infrastructure hiccup. A judge-stage failure is never retried here — the
- * dispatch already produced an artifact, so re-dispatching would score a
- * different sample. A per-cell dispatch deadline ("dispatch exceeded <N>ms")
- * is not transient by default; opt in via `extraPatterns` or
- * `retryFullDurationTimeouts` when queue starvation eats the clock.
- */
-declare function transientDispatchFailure(opts?: TransientFailureOptions): (failure: CampaignCellFailureReceipt['failure']) => boolean;
-//#endregion
-export { CanaryKind as $, ServedModelVerdict as $n, SearchOperationKind as $t, runEval as A, CampaignCellRetryPolicy as An, verifySearchHistoryReceipt as At, SearchRecorderOptions as B, inMemoryCampaignStorage as Bn, SearchCandidateSlotClosedEvent as Bt, RunImprovementLoopResult as C, ExternalOptimizerSubmittedCandidate as Cn, SearchHistoryPolicy as Ct, RunOptimizationResult as D, readCachedCell as Dn, assertSearchHistoryMatchesReplay as Dt, RunOptimizationOptions as E, CacheRead as En, assertCompleteSearchHistory as Et, MeasuredSearchCandidate as F, PlanCampaignRunOptions as Fn, SearchAttemptAccounting as Ft, RedTeamCategory as G, LlmJudgeOptions as Gn, SearchLedger as Gt, recordCandidatePopulationSearch as H, OpenAutoPrResult as Hn, SearchCompletedEvent as Ht, ProposedSearchCandidate as I, planCampaignRun as In, SearchCandidateDecidedEvent as It, redTeamDataset as J, AssertServedModelOptions as Jn, SearchLedgerEvent as Jt, RedTeamFinding as K, llmJudge as Kn, SearchLedgerAppendResult as Kt, SearchExecutionIdentity as L, CampaignStorage as Ln, SearchCandidateLineage as Lt, ParentSelectionContext as M, runCampaign as Mn, OpenSearchLedgerOptions as Mt, ParentSelector as N, CampaignRunPlan as Nn, SearchAccountingAudit as Nt, runOptimization as O, cellCachePath as On, createSearchHistoryReceipt as Ot, crowdedFrontierParent as P, CampaignRunPlanCell as Pn, SearchArtifactRef as Pt, CanaryEvaluation as Q, ServedModelPolicy as Qn, SearchModelIdentity as Qt, SearchLedgerBinding as R, createRunCostLedger as Rn, SearchCandidateRegisteredEvent as Rt, RunImprovementLoopOptions as S, ExternalOptimizerObservationSummary as Sn, SearchHistoryCoverageRow as St, PremeasuredOptimizationBaseline as T, CacheIssueReason as Tn, SearchHistoryRequiredError as Tt, DEFAULT_RED_TEAM_CORPUS as U, openAutoPr as Un, SearchCostAccounting as Ut, SearchRunIdentity as V, OpenAutoPrOptions as Vn, SearchCandidateSurface as Vt, RedTeamCase as W, LlmJudgeDimension as Wn, SearchFailureReason as Wt, scoreRedTeamOutput as X, ServedCrossFamilyError as Xn, SearchLedgerReplay as Xt, redTeamReport as Y, ModelSubstitutionError as Yn, SearchLedgerHash as Yt, CanaryAlert as Z, ServedModelCheck as Zn, SearchLedgerTrustedHeadMode as Zt, loopProvenanceArgsFromResult as _, GepaCandidatePopulationSummary as _n, costFromLedgerSummary as _t, EmitLoopProvenanceArgs as a, SearchPlannedTask as an, AssertCrossFamilyOptions as ar, OptimizationMethod as at, provenanceSpansPath as b, ExternalOptimizerExecutionSummary as bn, SearchHistoryAuditSummary as bt, LoopProvenanceBackend as c, SearchSurfaceEvidence as cn, assertCrossFamily as cr, OptimizationMethodPairwise as ct, LoopProvenanceOptimizationMethod as d, SearchTaskOutcome as dn, OptimizationMethodRunOptions as dt, SearchOperationRecordedEvent as en, assertCrossFamilyServed as er, CanaryOptions as et, LoopProvenanceRecord as f, SearchTokenAccounting as fn, OptimizationMethodScore as ft, emitLoopProvenance as g, GepaCandidatePopulationCandidate as gn, compareOptimizationMethods as gt, canonicalDigest as h, GepaCandidatePopulationArtifact as hn, combineComparisonCosts as ht, BuildLoopProvenanceArgs as i, SearchPlannedOperation as in, servedModelAcceptable as ir, ComparisonCost as it, CrowdedFrontierParentOptions as j, RunCampaignOptions as jn, FileSearchLedger as jt, RunEvalOptions as k, CampaignCellFailureReceipt as kn, searchHistoryCoverageRow as kt, LoopProvenanceCandidate as l, SearchSurfaceKind as ln, judgeFamily as lr, OptimizationMethodProvenance as lt, campaignMeasurementDigest as m, validateSearchLedgerEvent as mn, OptimizationTokenUsage as mt, isTransientTransportFailure as n, SearchPlanExtendedEvent as nn, assertServedModels as nr, runCanaries as nt, EmitLoopProvenanceResult as o, SearchSourceRef as on, CrossFamilyError as or, OptimizationMethodComparison as ot, buildLoopProvenanceRecord as p, openSearchLedger as pn, OptimizationPackageSource as pt, RedTeamReport as q, AssertCrossFamilyServedOptions as qn, SearchLedgerEntry as qt, transientDispatchFailure as r, SearchPlannedEvent as rn, checkServedModel as rr, CompareOptimizationMethodsOptions as rt, LoopProvenanceArgsFromResult as s, SearchSurfaceEffect as sn, JudgeFamily as sr, OptimizationMethodInput as st, TransientFailureOptions as t, SearchPlan as tn, assertServedModel as tr, CanaryReport as tt, LoopProvenanceEvidence as u, SearchTaskAttemptedEvent as un, OptimizationMethodResult as ut, loopProvenanceSpans as v, GepaCandidateSelectionScore as vn, optimizationTokenUsageFromSummary as vt, runImprovementLoop as w, readExternalOptimizerObservationArtifact as wn, SearchHistoryReceipt as wt, verifyLoopProvenanceRecord as x, ExternalOptimizerObservationArtifact as xn, SearchHistoryCoverage as xt, provenanceRecordPath as y, readGepaCandidatePopulationArtifact as yn, CreateSearchHistoryReceiptInput as yt, SearchRecorder as z, fsCampaignStorage as zn, SearchCandidateSlot as zt };
-//# sourceMappingURL=transient-failure-DKF5Mofa.d.ts.map
+export { readExternalOptimizerObservationArtifact as $, ServedModelVerdict as $n, SearchLedgerAppendResult as $t, CanaryOptions as A, runEval as An, SearchHistoryPolicy as At, OptimizationMethodResult as B, CacheRead as Bn, SearchAccountingAudit as Bt, RedTeamReport as C, ParentSelectionContext as Cn, GepaCandidatePopulationSummary as Ct, CanaryAlert as D, OpenAutoPrResult as Dn, SearchHistoryAuditSummary as Dt, scoreRedTeamOutput as E, OpenAutoPrOptions as En, CreateSearchHistoryReceiptInput as Et, OptimizationMethod as F, CampaignRunPlan as Fn, createSearchHistoryReceipt as Ft, combineComparisonCosts as G, fsCampaignStorage as Gn, SearchCandidateRegisteredEvent as Gt, OptimizationMethodScore as H, cellCachePath as Hn, SearchAttemptAccounting as Ht, OptimizationMethodComparison as I, CampaignRunPlanCell as In, searchHistoryCoverageRow as It, optimizationTokenUsageFromSummary as J, AssertServedModelOptions as Jn, SearchCandidateSurface as Jt, compareOptimizationMethods as K, inMemoryCampaignStorage as Kn, SearchCandidateSlot as Kt, OptimizationMethodInput as L, PlanCampaignRunOptions as Ln, verifySearchHistoryReceipt as Lt, runCanaries as M, CampaignCellRetryPolicy as Mn, SearchHistoryRequiredError as Mt, CompareOptimizationMethodsOptions as N, RunCampaignOptions as Nn, assertCompleteSearchHistory as Nt, CanaryEvaluation as O, openAutoPr as On, SearchHistoryCoverage as Ot, ComparisonCost as P, runCampaign as Pn, assertSearchHistoryMatchesReplay as Pt, ExternalOptimizerSubmittedCandidate as Q, ServedModelPolicy as Qn, SearchLedger as Qt, OptimizationMethodPairwise as R, planCampaignRun as Rn, FileSearchLedger as Rt, RedTeamFinding as S, CrowdedFrontierParentOptions as Sn, GepaCandidatePopulationCandidate as St, redTeamReport as T, crowdedFrontierParent as Tn, readGepaCandidatePopulationArtifact as Tt, OptimizationPackageSource as U, CampaignStorage as Un, SearchCandidateDecidedEvent as Ut, OptimizationMethodRunOptions as V, readCachedCell as Vn, SearchArtifactRef as Vt, OptimizationTokenUsage as W, createRunCostLedger as Wn, SearchCandidateLineage as Wt, ExternalOptimizerObservationArtifact as X, ServedCrossFamilyError as Xn, SearchCostAccounting as Xt, ExternalOptimizerExecutionSummary as Y, ModelSubstitutionError as Yn, SearchCompletedEvent as Yt, ExternalOptimizerObservationSummary as Z, ServedModelCheck as Zn, SearchFailureReason as Zt, provenanceSpansPath as _, SearchTaskAttemptedEvent as _n, SearchRecorder as _t, LoopProvenanceBackend as a, SearchModelIdentity as an, AssertCrossFamilyOptions as ar, transientDispatchFailure as at, RedTeamCase as b, openSearchLedger as bn, recordCandidatePopulationSearch as bt, LoopProvenanceOptimizationMethod as c, SearchPlan as cn, assertCrossFamily as cr, runImprovementLoop as ct, campaignMeasurementDigest as d, SearchPlannedOperation as dn, RunOptimizationResult as dt, SearchLedgerEntry as en, assertCrossFamilyServed as er, LlmJudgeDimension as et, canonicalDigest as f, SearchPlannedTask as fn, runOptimization as ft, provenanceRecordPath as g, SearchSurfaceKind as gn, SearchLedgerBinding as gt, loopProvenanceSpans as h, SearchSurfaceEvidence as hn, SearchExecutionIdentity as ht, LoopProvenanceArgsFromResult as i, SearchLedgerTrustedHeadMode as in, servedModelAcceptable as ir, isTransientTransportFailure as it, CanaryReport as j, CampaignCellFailureReceipt as jn, SearchHistoryReceipt as jt, CanaryKind as k, RunEvalOptions as kn, SearchHistoryCoverageRow as kt, LoopProvenanceRecord as l, SearchPlanExtendedEvent as ln, judgeFamily as lr, PremeasuredOptimizationBaseline as lt, loopProvenanceArgsFromResult as m, SearchSurfaceEffect as mn, ProposedSearchCandidate as mt, EmitLoopProvenanceArgs as n, SearchLedgerHash as nn, assertServedModels as nr, llmJudge as nt, LoopProvenanceCandidate as o, SearchOperationKind as on, CrossFamilyError as or, RunImprovementLoopOptions as ot, emitLoopProvenance as p, SearchSourceRef as pn, MeasuredSearchCandidate as pt, costFromLedgerSummary as q, AssertCrossFamilyServedOptions as qn, SearchCandidateSlotClosedEvent as qt, EmitLoopProvenanceResult as r, SearchLedgerReplay as rn, checkServedModel as rr, TransientFailureOptions as rt, LoopProvenanceEvidence as s, SearchOperationRecordedEvent as sn, JudgeFamily as sr, RunImprovementLoopResult as st, BuildLoopProvenanceArgs as t, SearchLedgerEvent as tn, assertServedModel as tr, LlmJudgeOptions as tt, buildLoopProvenanceRecord as u, SearchPlannedEvent as un, RunOptimizationOptions as ut, verifyLoopProvenanceRecord as v, SearchTaskOutcome as vn, SearchRecorderOptions as vt, redTeamDataset as w, ParentSelector as wn, GepaCandidateSelectionScore as wt, RedTeamCategory as x, validateSearchLedgerEvent as xn, GepaCandidatePopulationArtifact as xt, DEFAULT_RED_TEAM_CORPUS as y, SearchTokenAccounting as yn, SearchRunIdentity as yt, OptimizationMethodProvenance as z, CacheIssueReason as zn, OpenSearchLedgerOptions as zt };
+//# sourceMappingURL=provenance-CafMdZKM.d.ts.map