@tangle-network/agent-eval 0.93.0 → 0.95.0

package/dist/campaign/skill-patch.d.ts

@@ -0,0 +1,62 @@
+/**
+ * SkillOpt patch primitives (Microsoft, arXiv:2605.23904 — "Executive
+ * Strategy for Self-Evolving Agent Skills"). Where GEPA regenerates a surface
+ * by reflection, SkillOpt emits BOUNDED, anchored edits to ONE skill document
+ * — add / delete / replace — and accepts an edit only if it strictly improves
+ * a held-out score. Bounded edits are the "textual learning rate": small,
+ * reversible, and cheap to accept/reject, so a good rule introduced earlier is
+ * not overwritten by a later sweeping rewrite.
+ *
+ * This module applies a patch deterministically and reports, per op, what
+ * applied and what could not (a missing anchor is a rejected op, never a
+ * silently dropped one). Pure, no I/O.
+ */
+/** A single bounded edit against a skill surface.
+ *   - `add`     — insert `text` after the first line containing `after`
+ *                 (append to the end when `after` is absent/empty).
+ *   - `delete`  — remove the first line containing `anchor`.
+ *   - `replace` — replace the first line containing `anchor` with `text`.
+ *  `text` may be multi-line; it is spliced in as multiple lines. Anchors match
+ *  the FIRST line that contains the substring (deterministic; SkillOpt is
+ *  expected to anchor on unique text). */
+export type SkillPatchOp = {
+    op: 'add';
+    after?: string;
+    text: string;
+} | {
+    op: 'delete';
+    anchor: string;
+} | {
+    op: 'replace';
+    anchor: string;
+    text: string;
+};
+/** A named, attributable bundle of ops the optimizer proposes as one edit. */
+export interface SkillPatch {
+    label: string;
+    rationale: string;
+    ops: SkillPatchOp[];
+}
+export interface SkillPatchRejection {
+    op: SkillPatchOp;
+    reason: string;
+}
+export interface ApplySkillPatchResult {
+    surface: string;
+    /** Count of ops that mutated the surface. */
+    applied: number;
+    /** Ops that could not apply (unanchored / empty), with the reason. The
+     *  surface still reflects every APPLIED op — partial application is honest,
+     *  and the caller decides whether a partial patch is worth scoring. */
+    rejected: SkillPatchRejection[];
+}
+/**
+ * Apply a SkillOpt patch to a text surface. Ops apply in array order against
+ * the evolving line buffer (an `add after X` followed by a `delete X` sees the
+ * inserted lines). A missing anchor rejects only that op; the rest still apply.
+ */
+export declare function applySkillPatch(surface: string, patch: SkillPatch): ApplySkillPatchResult;
+/** Total ops in a patch — the edit-budget axis (SkillOpt's "textual learning
+ *  rate" caps this per epoch). */
+export declare function patchEditCount(patch: SkillPatch): number;
+//# sourceMappingURL=skill-patch.d.ts.map

package/dist/campaign/skill-patch.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"skill-patch.d.ts","sourceRoot":"","sources":["../../src/campaign/skill-patch.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH;;;;;;;0CAO0C;AAC1C,MAAM,MAAM,YAAY,GACpB;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAC3C;IAAE,EAAE,EAAE,QAAQ,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAChC;IAAE,EAAE,EAAE,SAAS,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAA;AAEnD,8EAA8E;AAC9E,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,MAAM,CAAA;IACb,SAAS,EAAE,MAAM,CAAA;IACjB,GAAG,EAAE,YAAY,EAAE,CAAA;CACpB;AAED,MAAM,WAAW,mBAAmB;IAClC,EAAE,EAAE,YAAY,CAAA;IAChB,MAAM,EAAE,MAAM,CAAA;CACf;AAED,MAAM,WAAW,qBAAqB;IACpC,OAAO,EAAE,MAAM,CAAA;IACf,6CAA6C;IAC7C,OAAO,EAAE,MAAM,CAAA;IACf;;2EAEuE;IACvE,QAAQ,EAAE,mBAAmB,EAAE,CAAA;CAChC;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,GAAG,qBAAqB,CAkDzF;AAED;kCACkC;AAClC,wBAAgB,cAAc,CAAC,KAAK,EAAE,UAAU,GAAG,MAAM,CAExD"}

package/dist/campaign/storage.d.ts

@@ -0,0 +1,38 @@
+/**
+ * `CampaignStorage` — the filesystem seam `runCampaign` writes through
+ * (run/cell dirs, the resumability cache, per-cell artifacts, trace spans).
+ *
+ * The default (`fsCampaignStorage`) is the Node filesystem — identical
+ * behavior to the inline `node:fs` calls it replaces, so existing CLI
+ * consumers are unaffected. `inMemoryCampaignStorage` keeps everything in a
+ * `Map`, so the substrate runs in environments WITHOUT a filesystem
+ * (Cloudflare Workers, Deno Deploy, other edge runtimes) — the campaign
+ * still produces its `CampaignResult` (cells + aggregates) in memory;
+ * artifacts/traces simply aren't persisted to disk.
+ *
+ * Paths are opaque keys to the in-memory adapter — it does not parse them,
+ * so the same `join(...)`-built paths work unchanged across both adapters.
+ */
+export interface CampaignStorage {
+    /** Ensure a directory exists (recursive). No-op for in-memory. */
+    ensureDir(dir: string): void;
+    /** Does this path exist (as a written file or an ensured dir)? */
+    exists(path: string): boolean;
+    /** Read a UTF-8 file; `undefined` when missing or unreadable. */
+    read(path: string): string | undefined;
+    /** Write a file (string or bytes). Parent dir is assumed ensured. */
+    write(path: string, content: string | Uint8Array): void;
+}
+/** Node-filesystem storage — the default. Lazily requires `node:fs` so the
+ *  module imports cleanly in non-Node runtimes (where the caller passes
+ *  `inMemoryCampaignStorage` instead and never constructs this).
+ *
+ *  `createRequire(import.meta.url)` is the ESM-native lazy require — a bare
+ *  `require` is a ReferenceError under `"type": "module"`, which is exactly
+ *  the shape this package publishes. */
+export declare function fsCampaignStorage(): CampaignStorage;
+/** In-memory storage for filesystem-less runtimes. Artifacts + trace spans
+ *  live in a `Map` for the duration of the run; the `CampaignResult` is
+ *  fully populated, but nothing is persisted to disk. */
+export declare function inMemoryCampaignStorage(): CampaignStorage;
+//# sourceMappingURL=storage.d.ts.map

package/dist/campaign/storage.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"storage.d.ts","sourceRoot":"","sources":["../../src/campaign/storage.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;GAcG;AACH,MAAM,WAAW,eAAe;IAC9B,kEAAkE;IAClE,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAAA;IAC5B,kEAAkE;IAClE,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAA;IAC7B,iEAAiE;IACjE,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAAA;IACtC,qEAAqE;IACrE,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,UAAU,GAAG,IAAI,CAAA;CACxD;AAED;;;;;;wCAMwC;AACxC,wBAAgB,iBAAiB,IAAI,eAAe,CAuBnD;AAED;;yDAEyD;AACzD,wBAAgB,uBAAuB,IAAI,eAAe,CAmBzD"}

package/dist/{types-BU-7W85F.d.ts → campaign/types.d.ts}

@@ -1,8 +1,4 @@
-import { b as RunTokenUsage } from './run-record-e7vj1uZQ.js';
-
 /**
- * @experimental
- *
  * Pass A substrate types — `runCampaign` is the one primitive every
  * eval flow composes from. Three contracts in this file:
  *
@@ -19,18 +15,18 @@ import { b as RunTokenUsage } from './run-record-e7vj1uZQ.js';
  * No new architecture vs 0.38 — Pass A formalizes the shapes so consumers
  * can build dashboards / CI gates / regression diffs against a stable schema.
  */
-
-/** @experimental Stable identifier + kind tag for any scenario. Consumers
+import type { RunTokenUsage } from '../run-record';
+/** Stable identifier + kind tag for any scenario. Consumers
  *  extend with their per-domain payload (persona, task, requirement, ...). */
-interface Scenario {
+export interface Scenario {
     id: string;
     kind: string;
     tags?: string[];
 }
-/** @experimental Context handed to every dispatch invocation. Scoped — every
+/** Context handed to every dispatch invocation. Scoped — every
  *  trace/span carries the cellId, every artifact write lands under the cell's
  *  artifact root, the cost meter accumulates per cell. */
-interface DispatchContext {
+export interface DispatchContext {
     cellId: string;
     rep: number;
     generation?: number;
@@ -52,13 +48,13 @@ interface DispatchContext {
      */
     placement?: string;
 }
-/** @experimental One function: scenario + ctx → artifact. Dispatcher chooses
+/** One function: scenario + ctx → artifact. Dispatcher chooses
  *  whether to call `runMultishot`, `runLoop`, raw `streamPrompt`, anything. */
-type DispatchFn<TScenario extends Scenario, TArtifact> = (scenario: TScenario, ctx: DispatchContext) => Promise<TArtifact>;
-/** @experimental One session within a multi-session journey. Dispatch is
+export type DispatchFn<TScenario extends Scenario, TArtifact> = (scenario: TScenario, ctx: DispatchContext) => Promise<TArtifact>;
+/** One session within a multi-session journey. Dispatch is
  *  invoked once per session in order; state from prior session's artifact
  *  is exposed via `ctx.priorSessionArtifact`. */
-interface SessionScript<TScenario, TArtifact> {
+export interface SessionScript<TScenario, TArtifact> {
     id: string;
     intent: string;
     maxTurns?: number;
@@ -68,20 +64,20 @@ interface SessionScript<TScenario, TArtifact> {
      *  resolves. Returns the persona shape used by the NEXT session. */
     evolveAfterSession?: (artifact: TArtifact, sessionIndex: number, scenario: TScenario) => TScenario;
 }
-interface JudgeDimension {
+export interface JudgeDimension {
     /** JSON field name + score key. */
     key: string;
     /** Description shown in the judge's user prompt. */
     description: string;
 }
-/** @experimental Pluggable dimensional scorer. `score` is the contract:
+/** Pluggable dimensional scorer. `score` is the contract:
  *  given an artifact + scenario, return a `JudgeScore`. This is deliberately a
  *  function, not a fixed LLM-prompt shape — real consumers judge with
  *  ensembles, deterministic checks, or a single LLM call, and the substrate
  *  must not constrain that. The `llmJudge()` helper builds a `score` that does
  *  one LLM call for the common case. `appliesTo` lets a judge run only on
  *  scenarios that match (e.g. a legal-citation judge only on legal scenarios). */
-interface JudgeConfig<TArtifact, TScenario extends Scenario = Scenario> {
+export interface JudgeConfig<TArtifact, TScenario extends Scenario = Scenario> {
     name: string;
     dimensions: JudgeDimension[];
     /** Score one artifact. Throw on failure — a thrown judge is recorded as a
@@ -102,7 +98,7 @@ interface JudgeConfig<TArtifact, TScenario extends Scenario = Scenario> {
  *  promotion-policy) — never renormalize a producer's values in place, as
  *  downstream thresholds (`composite >= 5` in multishot/matrix.ts, live-soak
  *  `>= 7` gates) key on the producer's native scale. */
-interface JudgeScore {
+export interface JudgeScore {
     dimensions: Record<string, number>;
     composite: number;
     notes: string;
@@ -118,12 +114,12 @@ interface JudgeScore {
     /** Ensemble extras: each surviving judge's per-dimension scores. */
     perJudge?: Record<string, Record<string, number>>;
 }
-/** @experimental A tier-4 code surface — a candidate change to the agent's
+/** A tier-4 code surface — a candidate change to the agent's
  *  IMPLEMENTATION, not its prompt. Produced by autoresearch (reads codebase +
  *  trace findings → opens a worktree). Measured by checking out `worktreeRef`
  *  and running the worker against the changed code. See the improvement-tier
  *  table in `docs/design/loop-taxonomy.md`. */
-interface CodeSurface {
+export interface CodeSurface {
     kind: 'code';
     /** Worktree path or git ref holding the candidate code change. The
      *  consumer's `dispatchWithSurface` checks this out before running. */
@@ -133,21 +129,21 @@ interface CodeSurface {
     /** Human summary of what changed — rendered into the auto-PR body. */
     summary?: string;
 }
-/** @experimental The mutable surface a driver proposes. Tiers (see
+/** The mutable surface a proposer changes. Tiers (see
  *  `docs/design/loop-taxonomy.md`):
  *   - `string`      — tiers 1-2: system-prompt addendum / serialized tool
  *                     config. Cheap, reversible, text-diffable.
  *   - `CodeSurface` — tier 4: an implementation change behind a worktree ref.
  *  Tier 3 (knowledge) is owned by agent-knowledge and rides its own adapter,
  *  not this type. */
-type MutableSurface = string | CodeSurface;
-/** @experimental A driver proposal carrying the surface AND the WHY behind
- *  it. Reflective drivers (`gepaDriver`) parse a `{label, rationale, payload}`
+export type MutableSurface = string | CodeSurface;
+/** A proposer output carrying the surface AND the WHY behind
+ *  it. Reflective proposers (`gepaProposer`) parse a `{label, rationale, payload}`
  *  from the model; without this wrapper the loop keeps only `payload` and the
  *  rationale that motivated the change is lost — the candidate becomes
  *  unattributable. `propose()` may return either bare `MutableSurface`s (cheap
- *  blind mutators) or these (reflective drivers); the loop normalizes both. */
-interface ProposedCandidate {
+ *  blind mutators) or these (reflective proposers); the loop normalizes both. */
+export interface ProposedCandidate {
     surface: MutableSurface;
     /** Short human label for the change (≤ 40 chars typical). */
     label: string;
@@ -156,18 +152,18 @@ interface ProposedCandidate {
      *  emitted provenance record. */
     rationale: string;
 }
-/** @experimental Type guard: a proposal carrying its rationale vs a bare
+/** Type guard: a proposal carrying its rationale vs a bare
  *  surface. The loop branches on this to populate `GenerationCandidate`. */
-declare function isProposedCandidate(value: MutableSurface | ProposedCandidate): value is ProposedCandidate;
-/** @experimental A non-dominated parent on the GEPA Pareto frontier — a
+export declare function isProposedCandidate(value: MutableSurface | ProposedCandidate): value is ProposedCandidate;
+/** A non-dominated parent on the GEPA Pareto frontier — a
  *  surface that, across the per-scenario objective vectors, no other tried
  *  surface beats on every scenario. A candidate worse on the mean composite
  *  but uniquely best on one hard scenario is non-dominated and survives here;
  *  the composite-best ranking would discard the lesson it carries. The loop
- *  computes the frontier across ALL generations and hands it to the driver so
- *  a reflective driver can combine complementary lessons (GEPA, Agrawal et
+ *  computes the frontier across ALL generations and hands it to the proposer so
+ *  a reflective proposer can combine complementary lessons (GEPA, Agrawal et
  *  al., arXiv:2507.19457). See `pareto.ts` (`paretoFrontier`). */
-interface ParetoParent {
+export interface ParetoParent {
     surface: MutableSurface;
     surfaceHash: string;
     /** The objective vector: per-scenario composite (higher is better). The
@@ -181,11 +177,11 @@ interface ParetoParent {
     label?: string;
     rationale?: string;
 }
-/** @experimental Stateless surface mutation — given findings + current
+/** Stateless surface mutation — given findings + current
  *  surface, return N candidate surfaces. Pure transform, no generation
  *  awareness. Reflective-mutation and `AxGEPA` mutators conform. Wrapped by
- *  `evolutionaryDriver` to become an `ImprovementDriver`. */
-interface Mutator<TFindings = unknown> {
+ *  `evolutionaryProposer` to become a `SurfaceProposer`. */
+export interface Mutator<TFindings = unknown> {
     kind: string;
     mutate(args: {
         findings: TFindings[];
@@ -194,13 +190,13 @@ interface Mutator<TFindings = unknown> {
         signal: AbortSignal;
     }): Promise<Array<MutableSurface | ProposedCandidate>>;
 }
-/** @experimental Everything a driver's `propose()` may read to plan the next
+/** Everything a proposer may read to plan the next
  *  batch of candidates. The first six fields are always present; the rest are
- *  optional context the loop supplies when available, so cheap drivers
- *  (`evolutionaryDriver`) can ignore them while a code-tier agentic generator
- *  consumes the research report + dataset to drive a coding harness.
- *  See `docs/design/self-improvement-engine.md`. */
-interface ProposeContext<TFindings = unknown> {
+ *  optional context the loop supplies when available, so cheap proposers
+ *  (`evolutionaryProposer`) can ignore them while a code-tier agentic generator
+ *  consumes the report + dataset to drive a coding harness.
+ *  See `docs/campaign-proposers.md`. */
+export interface ProposeContext<TFindings = unknown> {
     currentSurface: MutableSurface;
     history: GenerationRecord[];
     findings: TFindings[];
@@ -208,11 +204,10 @@ interface ProposeContext<TFindings = unknown> {
     populationSize: number;
     generation: number;
     signal: AbortSignal;
-    /** The Phase-2 research report (analyst findings + diff), produced AFTER the
-     *  trace analysts run. Opaque to the substrate — the driver that consumes it
-     *  types it. See the phase diagram in self-improvement-engine.md. */
+    /** Optional analysis report produced before proposal. Opaque to the substrate:
+     *  the proposer that consumes it owns the shape. */
     report?: unknown;
-    /** Handle to all captured data — the driver samples traces / artifacts /
+    /** Handle to all captured data — the proposer samples traces / artifacts /
      *  rewards here to ground its proposals. */
     dataset?: LabeledScenarioStore;
     /** DEPTH: max iterations the agentic generator may take per candidate.
@@ -221,38 +216,38 @@ interface ProposeContext<TFindings = unknown> {
     maxImprovementShots?: number;
     /** GEPA Pareto frontier across ALL generations so far — the non-dominated
      *  surfaces by per-scenario objective vector. Empty/absent on generation 0
-     *  (only the baseline is scored). A reflective driver combines the
+     *  (only the baseline is scored). A reflective proposer combines the
      *  complementary lessons of these parents (each excels on different
-     *  scenarios) into a merged candidate. Drivers doing pure single-parent
+     *  scenarios) into a merged candidate. Proposers doing pure single-parent
      *  reflection may ignore it. See {@link ParetoParent}. */
     paretoParents?: ParetoParent[];
     /** FIREWALL (non-negotiable): the held-out judge is write-only — its verdicts
      *  score the chosen output and gate promotion, and are NEVER an input to
      *  proposal/steering (else the optimizer games the acceptance axis = an
      *  oracle). This `never`-typed field makes that a compile-time tripwire: a
-     *  driver that tries to thread judge verdicts into the proposal will not type.
+     *  proposer that tries to thread judge verdicts into the proposal will not type.
      *  Steering may consume TRACE-OBSERVABLE signals (what the agent did) via
      *  `findings`/`report`; it may NOT consume the judge's held-out verdict. */
     judgeScores?: never;
 }
-/** @experimental A surface-improvement strategy — the DRIVER of the
- *  improvement loop. Given the current best surface, the history of what's
- *  been tried + scored, and any external findings, propose the next batch of
- *  candidate surfaces to measure. Optionally decide to stop early.
+/** A surface-improvement strategy. Given the current best
+ *  surface, the history of what's been tried + scored, and any external
+ *  findings, propose the next batch of candidate surfaces to measure.
+ *  Optionally decide to stop early.
  *
- *  The evolutionary mutator (`evolutionaryDriver`, here) and agent-runtime's
- *  `improvementDriver` (with reflective / agentic generators) both conform —
- *  drivers of the SAME loop, not separate loops. The loop body
- *  (`runOptimization`) and the gated promotion shell (`runImprovementLoop`)
- *  are driver-agnostic. */
-interface ImprovementDriver<TFindings = unknown> {
+ *  The evolutionary mutator (`evolutionaryProposer`, here) and agent-runtime's
+ *  reflective / agentic generators both conform. They are proposers for the
+ *  SAME loop, not separate loops. The loop body (`runOptimization`) and the
+ *  gated promotion shell (`runImprovementLoop`) are proposer-agnostic.
+ */
+export interface SurfaceProposer<TFindings = unknown> {
     kind: string;
-    /** Plan: propose N candidate surfaces for the next generation. A driver
+    /** Plan: propose N candidate surfaces for the next generation. A proposer
      *  may return bare `MutableSurface`s or `ProposedCandidate`s that carry the
      *  `{label, rationale}` motivating the change — the loop threads the
      *  rationale into `GenerationCandidate` and the emitted provenance. */
     propose(ctx: ProposeContext<TFindings>): Promise<Array<MutableSurface | ProposedCandidate>>;
-    /** Decide: stop early when the driver judges the search converged or
+    /** Decide: stop early when the proposer judges the search converged or
      *  exhausted. Default (omitted) runs all `maxGenerations`. */
     decide?(args: {
         history: GenerationRecord[];
@@ -261,15 +256,20 @@ interface ImprovementDriver<TFindings = unknown> {
         reason?: string;
     };
 }
-interface OptimizerConfig {
-    driver: ImprovementDriver;
+/** Optional vocabulary alias. The loop is the optimizer; this object is the
+ * proposer inside that loop. */
+export type OptimizationProposer<TFindings = unknown> = SurfaceProposer<TFindings>;
+export interface OptimizerConfigBase {
     populationSize: number;
     maxGenerations: number;
     surfaceExtractor: (profile: unknown) => MutableSurface;
 }
-/** @experimental Five-valued verdict taxonomy (MOSS-paper alignment). */
-type GateDecision = 'ship' | 'hold' | 'need_more_work' | 'model_ceiling' | 'arch_ceiling';
-interface GateContext<TArtifact, TScenario extends Scenario> {
+export interface OptimizerConfig extends OptimizerConfigBase {
+    proposer: SurfaceProposer;
+}
+/** Five-valued verdict taxonomy (MOSS-paper alignment). */
+export type GateDecision = 'ship' | 'hold' | 'need_more_work' | 'model_ceiling' | 'arch_ceiling';
+export interface GateContext<TArtifact, TScenario extends Scenario> {
     candidateArtifacts: Map<string, TArtifact>;
     baselineArtifacts?: Map<string, TArtifact>;
     /** Candidate (winner) judge scores, keyed by cellId. */
@@ -286,7 +286,7 @@ interface GateContext<TArtifact, TScenario extends Scenario> {
     };
     signal: AbortSignal;
 }
-interface GateResult {
+export interface GateResult {
     decision: GateDecision;
     reasons: string[];
     contributingGates: Array<{
@@ -296,24 +296,24 @@ interface GateResult {
     }>;
     delta?: number;
 }
-/** @experimental Composable promotion gate. */
-interface Gate<TArtifact = unknown, TScenario extends Scenario = Scenario> {
+/** Composable promotion gate. */
+export interface Gate<TArtifact = unknown, TScenario extends Scenario = Scenario> {
     name: string;
     decide(ctx: GateContext<TArtifact, TScenario>): Promise<GateResult>;
 }
-/** @experimental Scoped trace writer handed to each dispatch — every span
+/** Scoped trace writer handed to each dispatch — every span
  *  auto-tagged with the cellId so traces filter cleanly. */
-interface CampaignTraceWriter {
+export interface CampaignTraceWriter {
     span(name: string, attributes?: Record<string, unknown>): TraceSpan;
     flush(): Promise<void>;
 }
-interface TraceSpan {
+export interface TraceSpan {
     end(attributes?: Record<string, unknown>): void;
     setAttribute(key: string, value: unknown): void;
 }
-/** @experimental Scoped artifact writer — `write(path, content)` lands under
+/** Scoped artifact writer — `write(path, content)` lands under
  *  `<runDir>/<cellId>/<path>`. */
-interface CampaignArtifactWriter {
+export interface CampaignArtifactWriter {
     write(path: string, content: string | Uint8Array): Promise<string>;
     writeJson(path: string, value: unknown): Promise<string>;
 }
@@ -321,15 +321,15 @@ interface CampaignArtifactWriter {
  *  (run-record.ts, same package) so a cell maps onto a `RunRecord` for the
  *  backend-integrity guard with ONE source of truth — a field added to
  *  `RunTokenUsage` is a compile error here, not a silent drift. */
-type CampaignTokenUsage = RunTokenUsage;
-/** @experimental Cell-scoped cost meter. NOTHING is captured automatically —
+export type CampaignTokenUsage = RunTokenUsage;
+/** Cell-scoped cost meter. NOTHING is captured automatically —
  *  the substrate does not intercept the LLM call, so it cannot see cost or
  *  tokens unless the dispatch reports them. Every LLM cost MUST be reported via
  *  `observe` and every token count via `observeTokens`; a dispatch that reports
  *  neither yields a `{cost:0, tokens:0}` cell, which the backend-integrity
  *  guard (`assertRealBackend`) correctly reads as a stub. Also use `observe`
  *  for non-LLM spend (sandbox time, tool costs). */
-interface CampaignCostMeter {
+export interface CampaignCostMeter {
     observe(amountUsd: number, source: string): void;
     /** Record LLM token usage for this cell; accumulates across calls. A cell
      *  has `costUsd` but no token counts unless the dispatch reports them here —
@@ -341,11 +341,11 @@ interface CampaignCostMeter {
     /** Accumulated token usage for this cell (zeros if never observed). */
     tokens(): CampaignTokenUsage;
 }
-/** @experimental Source tag — required on every store write. Used by the
+/** Source tag — required on every store write. Used by the
  *  default training-source filter (production-trace samples NOT used as
  *  training scenarios unless explicitly opted in). */
-type LabeledScenarioSource = 'production-trace' | 'eval-run' | 'manual' | 'red-team' | 'synthetic';
-type RedactionStatus = 'raw' | 'redacted-pii' | 'redacted-secrets' | 'fully-redacted';
+export type LabeledScenarioSource = 'production-trace' | 'eval-run' | 'manual' | 'red-team' | 'synthetic';
+export type RedactionStatus = 'raw' | 'redacted-pii' | 'redacted-secrets' | 'fully-redacted';
 /** How much a label can be trusted to evaluate against — the gold-admission
  *  gate. Strictly ordered: a record qualifies for a `minTrust` filter when its
  *  trust rank is >= the requested rank.
@@ -360,13 +360,13 @@ type RedactionStatus = 'raw' | 'redacted-pii' | 'redacted-secrets' | 'fully-reda
  *  Absent on a write ⇒ treated as `unverified` (fail-closed: a writer must
  *  explicitly assert trust to make a record gold-eligible — it never happens
  *  by accident). */
-type LabelTrust = 'unverified' | 'verified-signal' | 'human-rated';
+export type LabelTrust = 'unverified' | 'verified-signal' | 'human-rated';
 /** Ordinal rank for a label-trust tier; absent ⇒ `unverified` (rank 0). */
-declare function labelTrustRank(trust: LabelTrust | undefined): number;
-/** @experimental Required-provenance write. The store rejects writes that
+export declare function labelTrustRank(trust: LabelTrust | undefined): number;
+/** Required-provenance write. The store rejects writes that
  *  lack provenance — a default-on flywheel without provenance is the
  *  data-poisoning vector flagged in the alignment review. */
-interface LabeledScenarioWrite<TScenario extends Scenario = Scenario, TArtifact = unknown> {
+export interface LabeledScenarioWrite<TScenario extends Scenario = Scenario, TArtifact = unknown> {
     scenario: TScenario;
     artifact: TArtifact;
     judgeScores: Record<string, JudgeScore>;
@@ -382,14 +382,14 @@ interface LabeledScenarioWrite<TScenario extends Scenario = Scenario, TArtifact
     /** Optional per-source rate-limit bucket key (e.g., the tenant id). */
     rateLimitBucket?: string;
 }
-interface LabeledScenarioRecord<TScenario extends Scenario = Scenario, TArtifact = unknown> extends LabeledScenarioWrite<TScenario, TArtifact> {
+export interface LabeledScenarioRecord<TScenario extends Scenario = Scenario, TArtifact = unknown> extends LabeledScenarioWrite<TScenario, TArtifact> {
     /** Stable hash of (scenario.id, source, capturedAt, sourceVersionHash). */
     recordHash: string;
     /** Substrate-assigned split — train if captured before the campaign's
      *  `temporalCutoff`, test if after. Explicit override allowed via filter. */
     split: 'train' | 'test';
 }
-interface LabeledScenarioSampleArgs {
+export interface LabeledScenarioSampleArgs {
     count: number;
     /** REQUIRED — substrate refuses to sample without an explicit split. */
     split: 'train' | 'test';
@@ -409,7 +409,7 @@ interface LabeledScenarioSampleArgs {
         minTrust?: LabelTrust;
     };
 }
-interface LabeledScenarioStore {
+export interface LabeledScenarioStore {
     observe(write: LabeledScenarioWrite): Promise<void>;
     sample(args: LabeledScenarioSampleArgs): Promise<LabeledScenarioRecord[]>;
     size(): Promise<{
@@ -421,7 +421,7 @@ interface LabeledScenarioStore {
         byTrust: Record<LabelTrust, number>;
     }>;
 }
-interface CampaignCellResult<TArtifact> {
+export interface CampaignCellResult<TArtifact> {
     cellId: string;
     scenarioId: string;
     rep: number;
@@ -438,27 +438,27 @@ interface CampaignCellResult<TArtifact> {
     cached: boolean;
     error?: string;
 }
-interface JudgeAggregate {
+export interface JudgeAggregate {
     mean: number;
     stdev: number;
     ci95: [number, number];
     n: number;
 }
-interface ScenarioAggregate {
+export interface ScenarioAggregate {
     meanComposite: number;
     ci95: [number, number];
     n: number;
 }
-interface GenerationRecord {
+export interface GenerationRecord {
     generationIndex: number;
     candidates: GenerationCandidate[];
     promoted: string[];
 }
 /** One scored candidate surface in a generation. `dimensions` + `scenarios`
- *  let a reflective `ImprovementDriver` ground its next proposal on WHICH
+ *  let a reflective proposer ground its next proposal on WHICH
  *  dimensions the candidate is weakest on and WHICH scenarios it best/worst
  *  handled — the evidence a blind `Mutator` cannot see. */
-interface GenerationCandidate {
+export interface GenerationCandidate {
     surfaceHash: string;
     composite: number;
     ci95: [number, number];
@@ -467,7 +467,7 @@ interface GenerationCandidate {
     dimensions: Record<string, number>;
     /** Per-scenario composite (mean over reps + judges), plus the judge's
      *  free-form `notes` for that scenario — the "why it scored low" evidence a
-     *  reflective driver grounds its next edit on. Keep `notes` GENERALIZABLE
+     *  reflective proposer grounds its next edit on. Keep `notes` GENERALIZABLE
      *  (which checks/lines/dimensions failed and how), NOT case-specific ground
      *  truth: leaking expected answers into the prompt is memorization, and the
      *  held-out gate would reject it anyway. */
@@ -476,15 +476,15 @@ interface GenerationCandidate {
         composite: number;
         notes?: string;
     }>;
-    /** Driver-supplied short label for the change. Present when the driver
+    /** Proposer-supplied short label for the change. Present when the proposer
      *  returned a `ProposedCandidate`; absent for bare-surface mutators. */
     label?: string;
-    /** Driver-supplied rationale — WHY this candidate was proposed. The
+    /** Proposer-supplied rationale — WHY this candidate was proposed. The
      *  "because rationale Z" the audit requires to survive to the result.
-     *  Present when the driver returned a `ProposedCandidate`. */
+     *  Present when the proposer returned a `ProposedCandidate`. */
     rationale?: string;
 }
-interface CampaignAggregates {
+export interface CampaignAggregates {
     byJudge: Record<string, JudgeAggregate>;
     byScenario: Record<string, ScenarioAggregate>;
     totalCostUsd: number;
@@ -493,7 +493,7 @@ interface CampaignAggregates {
     cellsCached: number;
     cellsFailed: number;
 }
-interface CampaignResult<TArtifact = unknown, TScenario extends Scenario = Scenario> {
+export interface CampaignResult<TArtifact = unknown, TScenario extends Scenario = Scenario> {
     /** sha256(scenarios, judges, dispatch source ref, optimizer config, seed). Stable identity for reruns. */
     manifestHash: string;
     seed: number;
@@ -516,5 +516,4 @@ interface CampaignResult<TArtifact = unknown, TScenario extends Scenario = Scena
      *  want narrowed types when extending `CampaignResult`. */
     scenarios: Array<Pick<TScenario, 'id' | 'kind'>>;
 }
-
-export { isProposedCandidate as A, labelTrustRank as B, type CampaignAggregates as C, type DispatchFn as D, type Gate as G, type ImprovementDriver as I, type JudgeScore as J, type LabeledScenarioStore as L, type MutableSurface as M, type OptimizerConfig as O, type ParetoParent as P, type RedactionStatus as R, type Scenario as S, type TraceSpan as T, type JudgeConfig as a, type DispatchContext as b, type GateDecision as c, type CampaignArtifactWriter as d, type CampaignCellResult as e, type CampaignCostMeter as f, type CampaignResult as g, type CampaignTraceWriter as h, type CodeSurface as i, type GateContext as j, type GateResult as k, type GenerationCandidate as l, type GenerationRecord as m, type JudgeDimension as n, type Mutator as o, type SessionScript as p, type ProposeContext as q, type LabeledScenarioWrite as r, type LabeledScenarioSampleArgs as s, type LabeledScenarioRecord as t, type LabelTrust as u, type LabeledScenarioSource as v, type CampaignTokenUsage as w, type JudgeAggregate as x, type ProposedCandidate as y, type ScenarioAggregate as z };
+//# sourceMappingURL=types.d.ts.map

package/dist/campaign/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/campaign/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,eAAe,CAAA;AAElD;8EAC8E;AAC9E,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,MAAM,CAAA;IACV,IAAI,EAAE,MAAM,CAAA;IACZ,IAAI,CAAC,EAAE,MAAM,EAAE,CAAA;CAChB;AAED;;0DAE0D;AAC1D,MAAM,WAAW,eAAe;IAC9B,MAAM,EAAE,MAAM,CAAA;IACd,GAAG,EAAE,MAAM,CAAA;IACX,UAAU,CAAC,EAAE,MAAM,CAAA;IACnB,IAAI,EAAE,MAAM,CAAA;IACZ,MAAM,EAAE,WAAW,CAAA;IACnB,KAAK,EAAE,mBAAmB,CAAA;IAC1B,SAAS,EAAE,sBAAsB,CAAA;IACjC,IAAI,EAAE,iBAAiB,CAAA;IACvB,yEAAyE;IACzE,OAAO,CAAC,EAAE,MAAM,CAAA;IAChB,mEAAmE;IACnE,WAAW,CAAC,EAAE,MAAM,CAAA;IACpB;;;;;;OAMG;IACH,SAAS,CAAC,EAAE,MAAM,CAAA;CACnB;AAED;+EAC+E;AAC/E,MAAM,MAAM,UAAU,CAAC,SAAS,SAAS,QAAQ,EAAE,SAAS,IAAI,CAC9D,QAAQ,EAAE,SAAS,EACnB,GAAG,EAAE,eAAe,KACjB,OAAO,CAAC,SAAS,CAAC,CAAA;AAIvB;;iDAEiD;AACjD,MAAM,WAAW,aAAa,CAAC,SAAS,EAAE,SAAS;IACjD,EAAE,EAAE,MAAM,CAAA;IACV,MAAM,EAAE,MAAM,CAAA;IACd,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,sEAAsE;IACtE,gBAAgB,CAAC,EAAE,OAAO,CAAA;IAC1B;wEACoE;IACpE,kBAAkB,CAAC,EAAE,CAAC,QAAQ,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,KAAK,SAAS,CAAA;CACnG;AAID,MAAM,WAAW,cAAc;IAC7B,mCAAmC;IACnC,GAAG,EAAE,MAAM,CAAA;IACX,oDAAoD;IACpD,WAAW,EAAE,MAAM,CAAA;CACpB;AAED;;;;;;kFAMkF;AAClF,MAAM,WAAW,WAAW,CAAC,SAAS,EAAE,SAAS,SAAS,QAAQ,GAAG,QAAQ;IAC3E,IAAI,EAAE,MAAM,CAAA;IACZ,UAAU,EAAE,cAAc,EAAE,CAAA;IAC5B;0DACsD;IACtD,KAAK,CAAC,KAAK,EAAE;QACX,QAAQ,EAAE,SAAS,CAAA;QACnB,QAAQ,EAAE,SAAS,CAAA;QACnB,MAAM,EAAE,WAAW,CAAA;KACpB,GAAG,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC,CAAA;IACpC,SAAS,CAAC,EAAE,CAAC,QAAQ,EAAE,SAAS,KAAK,OAAO,CAAA;CAC7C;AAED;;;;;;;;wDAQwD;AACxD,MAAM,WAAW,UAAU;IACzB,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAClC,SAAS,EAAE,MAAM,CAAA;IACjB,KAAK,EAAE,MAAM,CAAA;IACb;;uEAEmE;IACnE,MAAM,CAAC,EAAE,IAAI,CAAA;IACb;mEAC+D;IAC/D,eAAe,CAAC,EAAE,MAAM,CAAA;IACxB,8DAA8D;IAC9D,YAAY,CAAC,EAAE,MAAM,EAAE,CAAA;IACvB,oEAAoE;IACpE,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAA;CAClD;AAID;;;;+CAI+C;AAC/C,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAA;IACZ;2EACuE;IACvE,WAAW,EAAE,MAAM,CAAA;IACnB,yEAAyE;IACzE,OAAO,CAAC,EAAE,MAAM,CAAA;IAChB,sEAAsE;IACtE,OAAO,CAAC,EAAE,MAAM,CAAA;CACjB;AAED;;;;;;qBAMqB;AACrB,MAAM,MAAM,cAAc,GAAG,MAAM,GAAG,WAAW,CAAA;AAEjD;;;;;iFAKiF;AACjF,MAAM,WAAW,iBAAiB;IAChC,OAAO,EAAE,cAAc,CAAA;IACvB,6DAA6D;IAC7D,KAAK,EAAE,MAAM,CAAA;IACb;;qCAEiC;IACjC,SAAS,EAAE,MAAM,CAAA;CAClB;AAED;4EAC4E;AAC5E,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,cAAc,GAAG,iBAAiB,GACxC,KAAK,IAAI,iBAAiB,CAQ5B;AAED;;;;;;;kEAOkE;AAClE,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,cAAc,CAAA;IACvB,WAAW,EAAE,MAAM,CAAA;IACnB;8CAC0C;IAC1C,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAClC;qDACiD;IACjD,SAAS,EAAE,MAAM,CAAA;IACjB,qEAAqE;IACrE,UAAU,EAAE,MAAM,CAAA;IAClB,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,SAAS,CAAC,EAAE,MAAM,CAAA;CACnB;AAED;;;4DAG4D;AAC5D,MAAM,WAAW,OAAO,CAAC,SAAS,GAAG,OAAO;IAC1C,IAAI,EAAE,MAAM,CAAA;IACZ,MAAM,CAAC,IAAI,EAAE;QACX,QAAQ,EAAE,SAAS,EAAE,CAAA;QACrB,cAAc,EAAE,cAAc,CAAA;QAC9B,cAAc,EAAE,MAAM,CAAA;QACtB,MAAM,EAAE,WAAW,CAAA;KACpB,GAAG,OAAO,CAAC,KAAK,CAAC,cAAc,GAAG,iBAAiB,CAAC,CAAC,CAAA;CACvD;AAED;;;;;wCAKwC;AACxC,MAAM,WAAW,cAAc,CAAC,SAAS,GAAG,OAAO;IACjD,cAAc,EAAE,cAAc,CAAA;IAC9B,OAAO,EAAE,gBAAgB,EAAE,CAAA;IAC3B,QAAQ,EAAE,SAAS,EAAE,CAAA;IACrB,sEAAsE;IACtE,cAAc,EAAE,MAAM,CAAA;IACtB,UAAU,EAAE,MAAM,CAAA;IAClB,MAAM,EAAE,WAAW,CAAA;IACnB;wDACoD;IACpD,MAAM,CAAC,EAAE,OAAO,CAAA;IAChB;gDAC4C;IAC5C,OAAO,CAAC,EAAE,oBAAoB,CAAA;IAC9B;;+BAE2B;IAC3B,mBAAmB,CAAC,EAAE,MAAM,CAAA;IAC5B;;;;;8DAK0D;IAC1D,aAAa,CAAC,EAAE,YAAY,EAAE,CAAA;IAC9B;;;;;;gFAM4E;IAC5E,WAAW,CAAC,EAAE,KAAK,CAAA;CACpB;AAED;;;;;;;;;GASG;AACH,MAAM,WAAW,eAAe,CAAC,SAAS,GAAG,OAAO;IAClD,IAAI,EAAE,MAAM,CAAA;IACZ;;;2EAGuE;IACvE,OAAO,CAAC,GAAG,EAAE,cAAc,CAAC,SAAS,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,cAAc,GAAG,iBAAiB,CAAC,CAAC,CAAA;IAC3F;kEAC8D;IAC9D,MAAM,CAAC,CAAC,IAAI,EAAE;QAAE,OAAO,EAAE,gBAAgB,EAAE,CAAA;KAAE,GAAG;QAAE,IAAI,EAAE,OAAO,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAA;KAAE,CAAA;CACnF;AAED;gCACgC;AAChC,MAAM,MAAM,oBAAoB,CAAC,SAAS,GAAG,OAAO,IAAI,eAAe,CAAC,SAAS,CAAC,CAAA;AAElF,MAAM,WAAW,mBAAmB;IAClC,cAAc,EAAE,MAAM,CAAA;IACtB,cAAc,EAAE,MAAM,CAAA;IACtB,gBAAgB,EAAE,CAAC,OAAO,EAAE,OAAO,KAAK,cAAc,CAAA;CACvD;AAED,MAAM,WAAW,eAAgB,SAAQ,mBAAmB;IAC1D,QAAQ,EAAE,eAAe,CAAA;CAC1B;AAID,2DAA2D;AAC3D,MAAM,MAAM,YAAY,GAAG,MAAM,GAAG,MAAM,GAAG,gBAAgB,GAAG,eAAe,GAAG,cAAc,CAAA;AAEhG,MAAM,WAAW,WAAW,CAAC,SAAS,EAAE,SAAS,SAAS,QAAQ;IAChE,kBAAkB,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;IAC1C,iBAAiB,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;IAC1C,wDAAwD;IACxD,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAA;IACpD;;;+DAG2D;IAC3D,mBAAmB,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAA;IAC7D,SAAS,EAAE,SAAS,EAAE,CAAA;IACtB,IAAI,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAA;IAC7C,MAAM,EAAE,WAAW,CAAA;CACpB;AAED,MAAM,WAAW,UAAU;IACzB,QAAQ,EAAE,YAAY,CAAA;IACtB,OAAO,EAAE,MAAM,EAAE,CAAA;IACjB,iBAAiB,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,OAAO,CAAC;QAAC,MAAM,EAAE,OAAO,CAAA;KAAE,CAAC,CAAA;IAC5E,KAAK,CAAC,EAAE,MAAM,CAAA;CACf;AAED,iCAAiC;AACjC,MAAM,WAAW,IAAI,CAAC,SAAS,GAAG,OAAO,EAAE,SAAS,SAAS,QAAQ,GAAG,QAAQ;IAC9E,IAAI,EAAE,MAAM,CAAA;IACZ,MAAM,CAAC,GAAG,EAAE,WAAW,CAAC,SAAS,EAAE,SAAS,CAAC,GAAG,OAAO,CAAC,UAAU,CAAC,CAAA;CACpE;AAID;4DAC4D;AAC5D,MAAM,WAAW,mBAAmB;IAClC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,CAAA;IACnE,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,CAAA;CACvB;AAED,MAAM,WAAW,SAAS;IACxB,GAAG,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAAA;IAC/C,YAAY,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI,CAAA;CAChD;AAED;kCACkC;AAClC,MAAM,WAAW,sBAAsB;IACrC,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,CAAA;IAClE,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAA;CACzD;AAED;;;mEAGmE;AACnE,MAAM,MAAM,kBAAkB,GAAG,aAAa,CAAA;AAE9C;;;;;;oDAMoD;AACpD,MAAM,WAAW,iBAAiB;IAChC,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAAA;IAChD;;;;4DAIwD;IACxD,aAAa,CAAC,KAAK,EAAE,kBAAkB,GAAG,IAAI,CAAA;IAC9C,OAAO,IAAI,MAAM,CAAA;IACjB,uEAAuE;IACvE,MAAM,IAAI,kBAAkB,CAAA;CAC7B;AAID;;sDAEsD;AACtD,MAAM,MAAM,qBAAqB,GAC7B,kBAAkB,GAClB,UAAU,GACV,QAAQ,GACR,UAAU,GACV,WAAW,CAAA;AAEf,MAAM,MAAM,eAAe,GAAG,KAAK,GAAG,cAAc,GAAG,kBAAkB,GAAG,gBAAgB,CAAA;AAE5F;;;;;;;;;;;;;oBAaoB;AACpB,MAAM,MAAM,UAAU,GAAG,YAAY,GAAG,iBAAiB,GAAG,aAAa,CAAA;AAQzE,2EAA2E;AAC3E,wBAAgB,cAAc,CAAC,KAAK,EAAE,UAAU,GAAG,SAAS,GAAG,MAAM,CAEpE;AAED;;6DAE6D;AAC7D,MAAM,WAAW,oBAAoB,CAAC,SAAS,SAAS,QAAQ,GAAG,QAAQ,EAAE,SAAS,GAAG,OAAO;IAC9F,QAAQ,EAAE,SAAS,CAAA;IACnB,QAAQ,EAAE,SAAS,CAAA;IACnB,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,CAAA;IACvC,MAAM,EAAE,qBAAqB,CAAA;IAC7B,iBAAiB,EAAE,MAAM,CAAA;IACzB,UAAU,EAAE,MAAM,CAAA;IAClB,eAAe,EAAE,eAAe,CAAA;IAChC;;;0CAGsC;IACtC,UAAU,CAAC,EAAE,UAAU,CAAA;IACvB,uEAAuE;IACvE,eAAe,CAAC,EAAE,MAAM,CAAA;CACzB;AAED,MAAM,WAAW,qBAAqB,CAAC,SAAS,SAAS,QAAQ,GAAG,QAAQ,EAAE,SAAS,GAAG,OAAO,CAC/F,SAAQ,oBAAoB,CAAC,SAAS,EAAE,SAAS,CAAC;IAClD,2EAA2E;IAC3E,UAAU,EAAE,MAAM,CAAA;IAClB;iFAC6E;IAC7E,KAAK,EAAE,OAAO,GAAG,MAAM,CAAA;CACxB;AAED,MAAM,WAAW,yBAAyB;IACxC,KAAK,EAAE,MAAM,CAAA;IACb,wEAAwE;IACxE,KAAK,EAAE,OAAO,GAAG,MAAM,CAAA;IACvB;;2CAEuC;IACvC,cAAc,EAAE,MAAM,CAAA;IACtB,MAAM,CAAC,EAAE;QACP,IAAI,CAAC,EAAE,MAAM,CAAA;QACb,MAAM,CAAC,EAAE,qBAAqB,GAAG,qBAAqB,EAAE,CAAA;QACxD,YAAY,CAAC,EAAE,MAAM,CAAA;QACrB,YAAY,CAAC,EAAE,MAAM,CAAA;QACrB;;;mCAG2B;QAC3B,QAAQ,CAAC,EAAE,UAAU,CAAA;KACtB,CAAA;CACF;AAED,MAAM,WAAW,oBAAoB;IACnC,OAAO,CAAC,KAAK,EAAE,oBAAoB,GAAG,OAAO,CAAC,IAAI,CAAC,CAAA;IACnD,MAAM,CAAC,IAAI,EAAE,yBAAyB,GAAG,OAAO,CAAC,qBAAqB,EAAE,CAAC,CAAA;IACzE,IAAI,IAAI,OAAO,CAAC;QACd,KAAK,EAAE,MAAM,CAAA;QACb,IAAI,EAAE,MAAM,CAAA;QACZ,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;QAChC;0CACkC;QAClC,OAAO,EAAE,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,CAAA;KACpC,CAAC,CAAA;CACH;AAID,MAAM,WAAW,kBAAkB,CAAC,SAAS;IAC3C,MAAM,EAAE,MAAM,CAAA;IACd,UAAU,EAAE,MAAM,CAAA;IAClB,GAAG,EAAE,MAAM,CAAA;IACX,UAAU,CAAC,EAAE,MAAM,CAAA;IACnB,QAAQ,EAAE,SAAS,CAAA;IACnB,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,CAAA;IACvC,OAAO,EAAE,MAAM,CAAA;IACf;;mDAE+C;IAC/C,UAAU,EAAE,kBAAkB,CAAA;IAC9B,UAAU,EAAE,MAAM,CAAA;IAClB,IAAI,EAAE,MAAM,CAAA;IACZ,MAAM,EAAE,OAAO,CAAA;IACf,KAAK,CAAC,EAAE,MAAM,CAAA;CACf;AAED,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,MAAM,CAAA;IACZ,KAAK,EAAE,MAAM,CAAA;IACb,IAAI,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IACtB,CAAC,EAAE,MAAM,CAAA;CACV;AAED,MAAM,WAAW,iBAAiB;IAChC,aAAa,EAAE,MAAM,CAAA;IACrB,IAAI,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IACtB,CAAC,EAAE,MAAM,CAAA;CACV;AAED,MAAM,WAAW,gBAAgB;IAC/B,eAAe,EAAE,MAAM,CAAA;IACvB,UAAU,EAAE,mBAAmB,EAAE,CAAA;IACjC,QAAQ,EAAE,MAAM,EAAE,CAAA;CACnB;AAED;;;2DAG2D;AAC3D,MAAM,WAAW,mBAAmB;IAClC,WAAW,EAAE,MAAM,CAAA;IACnB,SAAS,EAAE,MAAM,CAAA;IACjB,IAAI,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IACtB;+CAC2C;IAC3C,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAClC;;;;;gDAK4C;IAC5C,SAAS,EAAE,KAAK,CAAC;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;IAC3E;4EACwE;IACxE,KAAK,CAAC,EAAE,MAAM,CAAA;IACd;;oEAEgE;IAChE,SAAS,CAAC,EAAE,MAAM,CAAA;CACnB;AAED,MAAM,WAAW,kBAAkB;IACjC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,CAAA;IACvC,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAA;IAC7C,YAAY,EAAE,MAAM,CAAA;IACpB,aAAa,EAAE,MAAM,CAAA;IACrB,YAAY,EAAE,MAAM,CAAA;IACpB,WAAW,EAAE,MAAM,CAAA;IACnB,WAAW,EAAE,MAAM,CAAA;CACpB;AAED,MAAM,WAAW,cAAc,CAAC,SAAS,GAAG,OAAO,EAAE,SAAS,SAAS,QAAQ,GAAG,QAAQ;IACxF,0GAA0G;IAC1G,YAAY,EAAE,MAAM,CAAA;IACpB,IAAI,EAAE,MAAM,CAAA;IACZ,SAAS,EAAE,MAAM,CAAA;IACjB,OAAO,EAAE,MAAM,CAAA;IACf,UAAU,EAAE,MAAM,CAAA;IAClB,KAAK,EAAE,KAAK,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC,CAAA;IAC3C,UAAU,EAAE,kBAAkB,CAAA;IAC9B,YAAY,CAAC,EAAE;QACb,WAAW,EAAE,gBAAgB,EAAE,CAAA;QAC/B,iBAAiB,CAAC,EAAE,MAAM,CAAA;KAC3B,CAAA;IACD,IAAI,CAAC,EAAE,UAAU,CAAA;IACjB,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,MAAM,EAAE,MAAM,CAAA;IACd,eAAe,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IACvC;;;+DAG2D;IAC3D,SAAS,EAAE,KAAK,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,GAAG,MAAM,CAAC,CAAC,CAAA;CACjD"}