@tangle-network/agent-runtime 0.93.1 → 0.94.0

package/dist/{chunk-VMHKMNEU.js → chunk-H2D3DCEB.js}

@@ -1,12 +1,9 @@
-import {
-  defaultStructuralRolloutPolicy
-} from "./chunk-FDJ7AHXG.js";
 import {
   agenticGenerator
-} from "./chunk-FRBHUNQ7.js";
+} from "./chunk-RTVVH2KL.js";
 import {
   assertModelAllowed
-} from "./chunk-J2K6WIG6.js";
+} from "./chunk-ISTDY47H.js";
 import {
   ConfigError
 } from "./chunk-YEJR7IXO.js";
@@ -252,122 +249,8 @@ function truncate(s, n) {
   return s.length <= n ? s : `${s.slice(0, n - 1)}\u2026`;
 }
 
-// src/improvement/rollout-policy.ts
-var ROLLOUT_POLICY_EXTENSION = "structural-rollout";
-var ROLLOUT_POLICY_BOUNDS = {
-  k: { min: 1, max: 10, step: 2 },
-  repairRounds: { min: 0, max: 3, step: 1 },
-  testgen: { min: 0, max: 10, step: 3 }
-};
-var MAX_CANDIDATES_PER_GENERATION = 4;
-var clamp = (v, min, max) => Math.min(max, Math.max(min, v));
-var isBoundedInt = (v, min) => typeof v === "number" && Number.isInteger(v) && v >= min;
-function parseRolloutPolicy(surface) {
-  if (typeof surface !== "string" || surface.trim().length === 0) return void 0;
-  let raw;
-  try {
-    raw = JSON.parse(surface);
-  } catch {
-    return void 0;
-  }
-  return normalizeRolloutPolicy(raw);
-}
-function normalizeRolloutPolicy(raw) {
-  if (typeof raw !== "object" || raw === null || Array.isArray(raw)) return void 0;
-  const bag = raw;
-  const k = bag.k ?? defaultStructuralRolloutPolicy.k;
-  const repairRounds = bag.repairRounds ?? defaultStructuralRolloutPolicy.repairRounds;
-  const testgen = bag.testgen ?? defaultStructuralRolloutPolicy.testgen;
-  if (!isBoundedInt(k, 1) || !isBoundedInt(repairRounds, 0) || !isBoundedInt(testgen, 0)) {
-    return void 0;
-  }
-  return {
-    k,
-    repairRounds,
-    testgen,
-    ...typeof bag.diverse === "boolean" ? { diverse: bag.diverse } : {},
-    ...typeof bag.temperature === "number" ? { temperature: bag.temperature } : {}
-  };
-}
-function serializeRolloutPolicy(policy) {
-  return JSON.stringify({
-    k: policy.k,
-    repairRounds: policy.repairRounds,
-    testgen: policy.testgen,
-    ...policy.diverse !== void 0 ? { diverse: policy.diverse } : {},
-    ...policy.temperature !== void 0 ? { temperature: policy.temperature } : {}
-  });
-}
-function structuralRolloutPolicyFromProfile(profile) {
-  const bag = profile.extensions?.[ROLLOUT_POLICY_EXTENSION];
-  if (bag === void 0) return void 0;
-  return normalizeRolloutPolicy(bag);
-}
-function applyRolloutPolicyToProfile(profile, policy) {
-  const bag = {
-    k: policy.k,
-    repairRounds: policy.repairRounds,
-    testgen: policy.testgen,
-    ...policy.diverse !== void 0 ? { diverse: policy.diverse } : {},
-    ...policy.temperature !== void 0 ? { temperature: policy.temperature } : {}
-  };
-  return {
-    ...profile,
-    extensions: { ...profile.extensions, [ROLLOUT_POLICY_EXTENSION]: bag }
-  };
-}
-function enumerateNeighborPolicies(policy) {
-  const moves = [
-    { dial: "k", delta: 1 },
-    { dial: "k", delta: -1 },
-    { dial: "repairRounds", delta: 1 },
-    { dial: "repairRounds", delta: -1 },
-    { dial: "testgen", delta: 1 },
-    { dial: "testgen", delta: -1 }
-  ];
-  const seen = /* @__PURE__ */ new Set([serializeRolloutPolicy(policy)]);
-  const neighbors = [];
-  for (const move of moves) {
-    const bounds = ROLLOUT_POLICY_BOUNDS[move.dial];
-    const next = clamp(policy[move.dial] + move.delta * bounds.step, bounds.min, bounds.max);
-    const candidate = { ...policy, [move.dial]: next };
-    const key = serializeRolloutPolicy(candidate);
-    if (seen.has(key)) continue;
-    seen.add(key);
-    neighbors.push(candidate);
-  }
-  return neighbors;
-}
-function candidateLabel(base, next) {
-  for (const dial of ["k", "repairRounds", "testgen"]) {
-    if (next[dial] !== base[dial]) return `${dial} ${base[dial]}\u2192${next[dial]}`;
-  }
-  return "unchanged";
-}
-function rolloutPolicyProposer() {
-  return {
-    kind: "rollout-policy",
-    async propose(ctx) {
-      const policy = parseRolloutPolicy(ctx.currentSurface);
-      if (!policy) return [];
-      const neighbors = enumerateNeighborPolicies(policy);
-      if (neighbors.length === 0) return [];
-      const cap = Math.max(1, Math.min(ctx.populationSize, MAX_CANDIDATES_PER_GENERATION));
-      const start = ctx.generation * cap % neighbors.length;
-      const window = [];
-      for (let i = 0; i < Math.min(cap, neighbors.length); i += 1) {
-        window.push(neighbors[(start + i) % neighbors.length]);
-      }
-      return window.map((candidate) => ({
-        surface: serializeRolloutPolicy(candidate),
-        label: candidateLabel(policy, candidate),
-        rationale: "bounded single-dial neighbor of the current structuralRollout policy; the held-out gate decides (deterministic enumeration \u2014 the dial space is tiny and prompt-style reflective proposals are a measured zero here)"
-      }));
-    }
-  };
-}
-
 // src/improvement/improve.ts
+import { canonicalJson } from "@tangle-network/agent-eval";
 import {
   gepaProposer,
   gitWorktreeAdapter,
@@ -379,7 +262,6 @@ import {
 } from "@tangle-network/agent-eval/contract";
 import { agentProfileSchema } from "@tangle-network/agent-interface";
 var defaultReflectionModel = "deepseek-v4-flash";
-var workflowExtension = "tangle.workflow";
 function llmClientOptions(llm) {
   return { baseUrl: llm?.baseUrl, apiKey: llm?.apiKey };
 }
@@ -392,8 +274,6 @@ function defaultGeneratorFor(surface, llm) {
       return skillOptProposer({ llm: llmClientOptions(llm), model, target: "agent skill document" });
     case "memory":
       return memoryCurationProposer();
-    case "rollout-policy":
-      return rolloutPolicyProposer();
     default:
       return void 0;
   }
@@ -412,19 +292,13 @@ function baselineSurfaceFor(profile, surface, skills, memory) {
       return JSON.stringify(profile.hooks ?? {});
     case "subagents":
       return JSON.stringify(profile.subagents ?? {});
-    case "workflow":
-      return JSON.stringify(profile.extensions?.[workflowExtension] ?? {});
     case "agent-profile":
-      return JSON.stringify(profile);
+      return canonicalJson(profile);
     case "memory":
       if (!memory) {
         throw new ConfigError("improve(): surface 'memory' requires opts.memory.document");
       }
       return memory.document;
-    case "rollout-policy": {
-      const policy = structuralRolloutPolicyFromProfile(profile);
-      return policy ? serializeRolloutPolicy(policy) : "";
-    }
     case "code":
       throw new ConfigError(
         "improve(): code requires the isolated baseline created from opts.code.repoRoot"
@@ -522,7 +396,7 @@ function parseWinnerJson(winner, surface) {
     );
   }
 }
-function applyWinnerToProfile(profile, surface, winner) {
+function applyImprovementWinnerToProfile(profile, surface, winner) {
   if (typeof winner !== "string") return profile;
   let candidate;
   switch (surface) {
@@ -547,30 +421,11 @@ function applyWinnerToProfile(profile, surface, winner) {
     case "subagents":
       candidate = { ...profile, subagents: parseWinnerJson(winner, surface) };
       break;
-    case "workflow":
-      candidate = {
-        ...profile,
-        extensions: {
-          ...profile.extensions,
-          [workflowExtension]: parseWinnerJson(winner, surface)
-        }
-      };
-      break;
     case "agent-profile":
       candidate = parseWinnerJson(winner, surface);
       break;
     case "memory":
       return profile;
-    case "rollout-policy": {
-      const policy = normalizeRolloutPolicy(parseWinnerJson(winner, surface));
-      if (!policy) {
-        throw new ConfigError(
-          `improve(): the shipped 'rollout-policy' winner is not a valid StructuralRolloutPolicy (integer k >= 1, repairRounds >= 0, testgen >= 0), so it cannot be applied: ${winner}`
-        );
-      }
-      candidate = applyRolloutPolicyToProfile(profile, policy);
-      break;
-    }
     case "code":
       return profile;
   }
@@ -667,22 +522,14 @@ async function improve(profile, findings, opts) {
     }
     await externalDocument.writeBack?.(winnerSurface);
   }
-  const nextProfile = shipped && !externalDocument ? applyWinnerToProfile(profile, surface, winnerSurface) : profile;
+  const nextProfile = shipped && !externalDocument ? applyImprovementWinnerToProfile(profile, surface, winnerSurface) : profile;
   return { profile: nextProfile, shipped, lift: raw.lift, gateDecision: raw.gateDecision, raw };
 }
 
 export {
   improvementDriver,
   rawTraceDistiller,
-  ROLLOUT_POLICY_EXTENSION,
-  ROLLOUT_POLICY_BOUNDS,
-  parseRolloutPolicy,
-  normalizeRolloutPolicy,
-  serializeRolloutPolicy,
-  structuralRolloutPolicyFromProfile,
-  applyRolloutPolicyToProfile,
-  enumerateNeighborPolicies,
-  rolloutPolicyProposer,
+  applyImprovementWinnerToProfile,
   improve
 };
-//# sourceMappingURL=chunk-VMHKMNEU.js.map
+//# sourceMappingURL=chunk-H2D3DCEB.js.map

package/dist/chunk-H2D3DCEB.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/improvement/improvement-driver.ts","../src/improvement/raw-trace-distiller.ts","../src/improvement/improve.ts"],"sourcesContent":["/**\n *\n * `improvementDriver` — the ONE reflective/agentic improvement proposer for\n * agent-eval's improvement loop. It implements `SurfaceProposer` and owns\n * the candidate lifecycle (worktree create → generate → finalize/discard,\n * × populationSize); it delegates the only thing that genuinely varies — HOW\n * a candidate change is produced — to a pluggable `CandidateGenerator`.\n *\n * There is no separate \"analyst driver\" vs \"autoresearch driver\": those are\n * the SAME driver at two settings of a dial.\n *   - cheap reflective path  → `reflectiveGenerator` (shots=1, no sandbox;\n *                              applies pre-drafted patches)\n *   - full agentic path      → `agenticGenerator` (shots=N, multi-shot\n *                              verify-in-session loop; an agent reads code +\n *                              report, edits, and re-tries on verifier failure)\n * Both emit changes into a worktree the driver finalizes into a\n * `CodeSurface{ worktreeRef }` the loop measures on the holdout. See\n * agent-eval's `docs/design/self-improvement-engine.md`.\n *\n * @experimental\n */\n\nimport type { AnalystFinding } from '@tangle-network/agent-eval'\nimport type {\n  CodeSurface,\n  LabeledScenarioStore,\n  ProposeContext,\n  SurfaceProposer,\n  Worktree,\n  WorktreeAdapter,\n} from '@tangle-network/agent-eval/campaign'\n\n/** The byte-producing seam — the ONE thing that differs between the cheap\n *  reflective path and the full agentic path. A generator makes (uncommitted)\n *  changes inside `worktreePath`; the driver commits them via the worktree\n *  adapter's `finalize`. */\nexport interface CandidateGenerator {\n  kind: string\n  /** Whether this generator can produce a candidate from an EMPTY findings set\n   *  and no phase-2 report — i.e. it draws its change signal from the repo and\n   *  the raw-trace filesystem context on disk, not only from pre-summarized\n   *  findings. An agentic coder (`agenticGenerator`) sets this: the seed repo +\n   *  raw traces ARE the signal, so it must still run the full `populationSize`\n   *  when the distiller yielded nothing (this is the meta-harness contract — the\n   *  agent diagnoses from the raw traces itself). A patch-applier\n   *  (`reflectiveGenerator`) leaves it unset — with no findings there is no\n   *  patch to draft, so the driver short-circuits rather than spin up worktrees\n   *  for a guaranteed no-op. Default `false`. */\n  proposesWithoutFindings?: boolean\n  generate(args: {\n    /** The candidate worktree — a fresh checkout of baseRef. Write changes here. */\n    worktreePath: string\n    /** Phase-2 research report (analyst findings + diff), opaque. */\n    report: unknown\n    /** Findings resolved from the report or the loop context. */\n    findings: AnalystFinding[]\n    /** Handle to all captured data, to ground the change. */\n    dataset?: LabeledScenarioStore\n    /** DEPTH: max iterations the generator may take (agentic uses this; the\n     *  reflective generator ignores it). */\n    maxShots: number\n    signal: AbortSignal\n  }): Promise<{ applied: boolean; summary: string }>\n}\n\nexport interface ImprovementDriverOptions {\n  worktree: WorktreeAdapter\n  generator: CandidateGenerator\n  /** Base ref candidate worktrees fork from. Default `main`. */\n  baseRef?: string\n}\n\nexport interface ManagedImprovementDriver extends SurfaceProposer<AnalystFinding> {\n  /** Remove every finalized candidate except explicitly retained winners. */\n  cleanup(retainWorktreeRefs?: readonly string[]): Promise<void>\n}\n\n/** The one reflective/agentic improvement proposer (`SurfaceProposer`): owns the candidate worktree lifecycle and delegates HOW a change is produced to a pluggable `CandidateGenerator`. */\nexport function improvementDriver(opts: ImprovementDriverOptions): ManagedImprovementDriver {\n  const baseRef = opts.baseRef ?? 'main'\n  const finalized = new Map<string, Worktree>()\n\n  return {\n    kind: `improvement:${opts.generator.kind}`,\n    async propose(ctx: ProposeContext<AnalystFinding>) {\n      const findings = resolveFindings(ctx)\n      // No findings AND no report AND a generator that can only act on findings\n      // (the reflective patch-applier) — propose nothing rather than spin up\n      // worktrees for a guaranteed no-op. An agentic coder draws its signal from\n      // the repo + raw traces on disk, so it opts in via `proposesWithoutFindings`\n      // and still runs the full populationSize even on an empty findings set —\n      // otherwise the FIRST generation (whose seed findings are empty and whose\n      // rawTraceDistiller has not run yet) would always generate ZERO candidates.\n      if (\n        findings.length === 0 &&\n        ctx.report === undefined &&\n        !opts.generator.proposesWithoutFindings\n      ) {\n        return []\n      }\n\n      const surfaces: CodeSurface[] = []\n      for (let i = 0; i < ctx.populationSize; i++) {\n        if (ctx.signal.aborted) break\n        const wt = await opts.worktree.create({\n          baseRef,\n          label: `${opts.generator.kind}-gen${ctx.generation}-cand${i}`,\n        })\n        // Once a worktree exists it MUST be accounted for: finalized into a\n        // surface, or discarded. A throw from generate()/finalize() must not\n        // leak the worktree + branch — discard best-effort, then rethrow loud.\n        try {\n          const { applied, summary } = await opts.generator.generate({\n            worktreePath: wt.path,\n            report: ctx.report,\n            findings,\n            dataset: ctx.dataset,\n            maxShots: ctx.maxImprovementShots ?? 1,\n            signal: ctx.signal,\n          })\n          if (!applied) {\n            await opts.worktree.discard(wt)\n            continue\n          }\n          const surface = await opts.worktree.finalize(wt, summary)\n          surfaces.push(surface)\n          finalized.set(surface.worktreeRef, wt)\n        } catch (err) {\n          // Best-effort cleanup; never mask the original failure.\n          await opts.worktree.discard(wt).catch(() => {})\n          throw err\n        }\n      }\n      return surfaces\n    },\n    async cleanup(retainWorktreeRefs = []) {\n      const retained = new Set(retainWorktreeRefs)\n      const errors: unknown[] = []\n      for (const [worktreeRef, worktree] of finalized) {\n        if (retained.has(worktreeRef)) continue\n        try {\n          await opts.worktree.discard(worktree)\n          finalized.delete(worktreeRef)\n        } catch (cause) {\n          errors.push(cause)\n        }\n      }\n      if (errors.length > 0) {\n        throw new AggregateError(errors, 'improvementDriver: failed to discard candidate worktrees')\n      }\n    },\n  }\n}\n\n/** Phase-2 report carries `findings` when present; else fall back to the\n *  loop's `ctx.findings`. The report is opaque to the substrate, so probe it\n *  structurally. */\nfunction resolveFindings(ctx: ProposeContext<AnalystFinding>): AnalystFinding[] {\n  const report = ctx.report\n  if (report && typeof report === 'object' && 'findings' in report) {\n    const f = (report as { findings: unknown }).findings\n    if (Array.isArray(f) && f.length > 0) return f as AnalystFinding[]\n  }\n  return ctx.findings\n}\n","/**\n *\n * `rawTraceDistiller` — the meta-harness `analyzeGeneration` producer.\n *\n * The default `generationFailureDistiller` (in `improve.ts`) COMPRESSES each\n * generation's failing cells into ~400-char structured findings before the next\n * proposal round. That is the ACE-style recipe: a small summary is the proposer's\n * whole view of what went wrong. This producer does the opposite — the\n * meta-harness recipe (yoonholee.com/meta-harness): it does NOT summarize. It\n * points the coding-agent proposer at the generation's RAW run traces already on\n * disk under `runDir` — the durable per-cell `spans.jsonl` event logs,\n * `cached-result.json` scores, and any artifacts the substrate persisted — and\n * instructs the agent to `grep`/`cat`/`ls` them to diagnose the failures itself\n * (up to the harness's full context, ~millions of tokens, vs a ~400-char digest).\n *\n * It emits `AnalystFinding[]` so it drops into the SAME `opts.analyzeGeneration`\n * slot the default distiller uses, and renders through the same\n * `agenticGenerator` prompt path (`claim` + `recommended_action`). The findings\n * carry ABSOLUTE paths — the coding harness runs with `cwd` = a candidate\n * worktree, so a relative `runDir` would be uncattable from there.\n *\n * Runtime layout it reads (written by agent-eval's optimization loop):\n *\n *   <runDir>/gen-<N>/                     ← the generation dir (input.runDir)\n *     candidate-<i>/                      ← one candidate campaign (campaign.runDir)\n *       <sanitized cellId>/               ← one scenario×rep cell\n *         spans.jsonl                     ← the raw trace (event/span log)\n *         cached-result.json              ← the cell's score + artifact ref\n *         <artifacts…>                    ← whatever the dispatch wrote\n *\n * @experimental\n */\n\nimport { type Dirent, existsSync, readdirSync } from 'node:fs'\nimport { basename, join, resolve } from 'node:path'\nimport { type AnalystFinding, makeFinding } from '@tangle-network/agent-eval'\nimport type { Scenario, SelfImproveOptions } from '@tangle-network/agent-eval/contract'\n\nconst ANALYST_ID = 'raw-trace-distiller'\n/** A cell counts as \"failing\" below this mean composite (matches the default\n *  distiller's near-perfect threshold) or when it recorded an `error`. */\nconst PASS_THRESHOLD = 0.999\n\nexport interface RawTraceDistillerOptions {\n  /** Anchor the emitted paths at this run root instead of the generation `runDir`\n   *  the loop passes in. Normally unset — each call points at that generation's\n   *  own directory (`input.runDir`). Pass an absolute path when you construct the\n   *  producer ahead of the loop and want a fixed anchor (e.g. a test fixture). */\n  runDir?: string\n  /** Max candidates to surface trace paths for, worst-scoring first. Default 12. */\n  maxCandidates?: number\n  /** Max failing cells to enumerate per candidate before collapsing the rest into\n   *  an \"ls the candidate dir\" pointer. Default 8. */\n  maxCellsPerCandidate?: number\n  /** Max concrete file paths to list per cell (the agent can always `ls` the dir\n   *  for the rest). Default 24. */\n  maxFilesPerCell?: number\n  /** Findings to fall back to when the generation had NO failing cells, so a\n   *  clean round never wipes the proposer's steering context. Mirrors the default\n   *  distiller's static-seed fallback. Default: a single instruction finding. */\n  fallbackFindings?: unknown[]\n}\n\ninterface CellTrace {\n  scenarioId: string\n  composite: number\n  error?: string\n  cellDir: string\n  files: string[]\n  truncatedFiles: boolean\n}\n\n/**\n * Build an `analyzeGeneration` producer that feeds the proposer RAW-TRACE\n * FILESYSTEM CONTEXT — paths into the prior generation's real run traces plus a\n * grep/cat-to-diagnose instruction — instead of a pre-summarized digest.\n *\n * Drop-in for `opts.analyzeGeneration` on `improve()` / `selfImprove()`:\n *\n *   await improve(profile, seedFindings, {\n *     surface: 'code',\n *     code: { repoRoot },\n *     runDir: '/abs/run',                 // MUST be a real path — the traces live here\n *     analyzeGeneration: rawTraceDistiller(),\n *     scenarios, judge, agent,\n *   })\n */\nexport function rawTraceDistiller<TScenario extends Scenario = Scenario, TArtifact = unknown>(\n  options: RawTraceDistillerOptions = {},\n): NonNullable<SelfImproveOptions<TScenario, TArtifact>['analyzeGeneration']> {\n  const maxCandidates = options.maxCandidates ?? 12\n  const maxCellsPerCandidate = options.maxCellsPerCandidate ?? 8\n  const maxFilesPerCell = options.maxFilesPerCell ?? 24\n\n  return async (input) => {\n    const genRoot = absoluteRunDir(options.runDir ?? input.runDir)\n    const durable = isDurable(genRoot)\n\n    // Rank candidates worst-first; the worst failures are the highest-signal\n    // context for the next edit. Stable sort keeps equal-composite order.\n    const ranked = [...input.candidates]\n      .map((c) => ({\n        surfaceHash: c.surfaceHash,\n        composite: c.composite,\n        campaignDir: absoluteRunDir(c.campaign.runDir),\n        cells: failingCells(c.campaign, maxCellsPerCandidate, maxFilesPerCell),\n      }))\n      .sort((a, b) => a.composite - b.composite)\n      .slice(0, maxCandidates)\n\n    const totalFailingCells = ranked.reduce((n, c) => n + c.cells.length, 0)\n\n    // A clean generation: keep the proposer's steering context rather than\n    // wiping it (parity with the default distiller's static-seed fallback). An\n    // EMPTY fallback array means there is no STATIC seed to preserve — it must NOT\n    // wipe the context to nothing. Fall through to the default raw-trace\n    // instruction so the meta-harness discipline stays live (the agent still\n    // inspects the on-disk traces next round, and the finding's `raw-trace-context`\n    // area keeps the agenticGenerator's diagnosis-evidence gate armed). A bare\n    // `??` would return the empty array and silently disable both.\n    if (totalFailingCells === 0) {\n      if (options.fallbackFindings && options.fallbackFindings.length > 0) {\n        return options.fallbackFindings\n      }\n      return [\n        makeFinding({\n          analyst_id: ANALYST_ID,\n          severity: 'info',\n          area: 'raw-trace-context',\n          confidence: 1,\n          claim: `Generation ${input.generation} had no failing cells. The full raw run traces are on disk under ${genRoot}.`,\n          recommended_action: `To keep improving, grep/cat the raw traces under ${genRoot} (per-cell spans.jsonl + cached-result.json) to find the weakest passing runs, then make a targeted harness-code edit.`,\n          evidence_refs: [{ kind: 'artifact', uri: genRoot }],\n          metadata: { generation: input.generation, runDir: genRoot, failingCells: 0 },\n        }),\n      ]\n    }\n\n    const findings: AnalystFinding[] = []\n\n    // 1. The meta-harness instruction: diagnose from the RAW traces, not a digest.\n    findings.push(\n      makeFinding({\n        analyst_id: ANALYST_ID,\n        severity: 'high',\n        area: 'raw-trace-context',\n        confidence: 1,\n        claim: `Generation ${input.generation} produced ${totalFailingCells} failing/low-scoring cell(s) across ${ranked.length} candidate(s). Their FULL RAW run traces are on disk under ${genRoot} — the actual event logs (spans.jsonl), scores (cached-result.json), and artifacts, not a summary.${\n          durable\n            ? ''\n            : ' (WARNING: this run root does not exist on disk — it looks like an in-memory run; pass a real runDir to improve() to get raw-trace context.)'\n        }`,\n        recommended_action: `Do NOT rely on a pre-summarized finding. Before editing, DIAGNOSE from the raw traces: run \\`grep\\`/\\`cat\\`/\\`ls\\` over the trace files and directories named in the following findings to see exactly what each failing run did and why it scored low, then make the smallest harness-code edit that fixes the dominant failure. Start with \\`grep -rIn \"error\" ${genRoot}\\` then \\`cat\\` the spans.jsonl of the worst cell.`,\n        evidence_refs: [{ kind: 'artifact', uri: genRoot }],\n        metadata: {\n          generation: input.generation,\n          runDir: genRoot,\n          failingCells: totalFailingCells,\n          candidates: ranked.length,\n        },\n      }),\n    )\n\n    // 2. One finding per failing candidate: its campaign dir + the concrete raw\n    //    trace files to grep/cat.\n    for (const cand of ranked) {\n      if (cand.cells.length === 0) continue\n      const scenarioList = cand.cells.map((c) => c.scenarioId).join(', ')\n      const fileLines = cand.cells\n        .map((c) => {\n          const header = `  cell ${c.scenarioId} (composite ${c.composite.toFixed(3)}${\n            c.error ? `, error: ${truncate(c.error, 160)}` : ''\n          }) — dir ${c.cellDir}`\n          const files = c.files.map((f) => `    - ${f}`).join('\\n')\n          const more = c.truncatedFiles ? `\\n    - …(ls ${c.cellDir} for the rest)` : ''\n          return c.files.length > 0 ? `${header}\\n${files}${more}` : header\n        })\n        .join('\\n')\n\n      findings.push(\n        makeFinding({\n          analyst_id: ANALYST_ID,\n          severity: cand.composite < 0.5 ? 'critical' : 'high',\n          area: 'raw-trace-context',\n          confidence: 1,\n          subject: cand.surfaceHash,\n          claim: `Candidate ${cand.surfaceHash} scored composite ${cand.composite.toFixed(3)} with ${cand.cells.length} failing cell(s) [${scenarioList}]. Its raw traces are under ${cand.campaignDir}.`,\n          recommended_action: `grep/cat these raw trace files to diagnose WHY this candidate failed before editing:\\n${fileLines}\\nOr scan the whole candidate at once: \\`grep -rIn . ${cand.campaignDir}\\` and \\`ls -R ${cand.campaignDir}\\`.`,\n          evidence_refs: [\n            { kind: 'artifact', uri: cand.campaignDir },\n            ...cand.cells.flatMap((c) =>\n              c.files.map((f) => ({ kind: 'artifact' as const, uri: f })),\n            ),\n          ],\n          metadata: {\n            surfaceHash: cand.surfaceHash,\n            composite: cand.composite,\n            campaignDir: cand.campaignDir,\n            cells: cand.cells.map((c) => ({\n              scenarioId: c.scenarioId,\n              composite: c.composite,\n              cellDir: c.cellDir,\n              files: c.files,\n              ...(c.error ? { error: c.error } : {}),\n            })),\n          },\n        }),\n      )\n    }\n\n    return findings\n  }\n}\n\n/** The failing cells of a candidate campaign, each with its on-disk trace files.\n *  Mirrors the default distiller's per-cell composite (mean of judge composites,\n *  0 when a cell produced no judge score) and its failing predicate. */\nfunction failingCells(\n  campaign: {\n    runDir: string\n    cells: ReadonlyArray<{\n      cellId: string\n      scenarioId: string\n      error?: string\n      judgeScores: Record<string, { composite?: number }>\n    }>\n    artifactsByPath?: Record<string, string>\n  },\n  maxCells: number,\n  maxFiles: number,\n): CellTrace[] {\n  const campaignDir = absoluteRunDir(campaign.runDir)\n  const durable = isDurable(campaignDir)\n  const out: CellTrace[] = []\n  for (const cell of campaign.cells) {\n    const scores = Object.values(cell.judgeScores ?? {})\n    const composite =\n      scores.length === 0\n        ? 0\n        : scores.reduce((sum, s) => sum + (s.composite ?? 0), 0) / scores.length\n    if (!cell.error && composite >= PASS_THRESHOLD) continue\n\n    const cellDir = join(campaignDir, sanitizeCellId(cell.cellId))\n    const artifactPaths = artifactPathsForCell(campaign.artifactsByPath, cell.cellId)\n    const discovered = durable ? listTraceFiles(cellDir) : []\n    // Canonical anchors the substrate always writes, kept even when a mem:// run\n    // never flushed them to disk (so the agent still learns the expected path).\n    const canonical = [join(cellDir, 'spans.jsonl'), join(cellDir, 'cached-result.json')]\n    const files = dedupeSorted([...discovered, ...artifactPaths, ...canonical])\n\n    out.push({\n      scenarioId: cell.scenarioId,\n      composite: Number(composite.toFixed(3)),\n      ...(cell.error ? { error: cell.error } : {}),\n      cellDir,\n      files: files.slice(0, maxFiles),\n      truncatedFiles: files.length > maxFiles,\n    })\n    if (out.length >= maxCells) break\n  }\n  return out\n}\n\n/** Absolute paths of artifacts the campaign recorded for a cell. `artifactsByPath`\n *  is keyed `${cellId}/${relPath}` → absolute path. */\nfunction artifactPathsForCell(\n  artifactsByPath: Record<string, string> | undefined,\n  cellId: string,\n): string[] {\n  if (!artifactsByPath) return []\n  const prefix = `${cellId}/`\n  return Object.entries(artifactsByPath)\n    .filter(([key]) => key.startsWith(prefix))\n    .map(([, absPath]) => resolve(absPath))\n}\n\n/** Real files directly under `dir` and one level of sub-directories (artifacts\n *  are sometimes nested). Absolute paths, sorted. `[]` when the dir is absent,\n *  stale, unreadable, or contains symlinked dirs — trace context is advisory and\n *  the canonical anchors below still tell the proposer where to inspect. */\nfunction listTraceFiles(dir: string): string[] {\n  const out: string[] = []\n  for (const entry of safeReadDir(dir)) {\n    const full = join(dir, entry.name)\n    if (entry.isFile()) {\n      out.push(full)\n    } else if (!entry.isSymbolicLink() && entry.isDirectory()) {\n      for (const sub of safeReadDir(full)) {\n        if (sub.isFile()) out.push(join(full, sub.name))\n      }\n    }\n  }\n  return out\n}\n\nfunction safeReadDir(dir: string): Dirent[] {\n  try {\n    return readdirSync(dir, { withFileTypes: true })\n  } catch {\n    return []\n  }\n}\n\n/** Substrate cell-dir sanitization — must match agent-eval's\n *  `cellId.replace(/[^a-zA-Z0-9_-]/g, '_')` so the computed dir matches disk. */\nfunction sanitizeCellId(cellId: string): string {\n  return cellId.replace(/[^a-zA-Z0-9_-]/g, '_')\n}\n\n/** A run root is durable (has real files) when it is not an in-memory sentinel\n *  and exists on disk. `mem://` runs keep everything in-process — no traces. */\nfunction isDurable(runDir: string): boolean {\n  return !runDir.startsWith('mem://') && existsSync(runDir)\n}\n\n/** Resolve a run dir to absolute (the coding harness runs from a worktree cwd, so\n *  relative paths are uncattable there). `mem://` sentinels pass through untouched. */\nfunction absoluteRunDir(runDir: string): string {\n  return runDir.startsWith('mem://') ? runDir : resolve(runDir)\n}\n\nfunction dedupeSorted(paths: string[]): string[] {\n  return [...new Set(paths)].sort((a, b) => {\n    // Group by directory then filename for a stable, readable listing.\n    const da = a.slice(0, a.length - basename(a).length)\n    const db = b.slice(0, b.length - basename(b).length)\n    return da === db ? basename(a).localeCompare(basename(b)) : da.localeCompare(db)\n  })\n}\n\nfunction truncate(s: string, n: number): string {\n  return s.length <= n ? s : `${s.slice(0, n - 1)}…`\n}\n","/**\n *\n * `improve` — the ONE public, surface-pluggable RSI verb.\n *\n * A thin facade over agent-eval's `selfImprove` (the held-out-gated closed\n * loop). It removes the two things a caller otherwise has to know to drive the\n * loop by hand: WHICH `MutableSurface` of the profile is being optimized, and\n * WHICH `SurfaceProposer` mutates that surface. You name a `surface`; the\n * facade picks the matching default proposer, extracts the baseline surface from\n * the profile, runs `selfImprove`, and (on a ship verdict) writes the promoted\n * winner back into the corresponding profile field.\n *\n *   - `surface: 'prompt'` → `gepaProposer` mutates `profile.prompt.systemPrompt`.\n *   - `surface: 'skills'` → `skillOptProposer` mutates a skills document string.\n *   - `surface: 'memory'` → `memoryCurationProposer` curates a bounded durable\n *     lesson document supplied through `opts.memory`.\n *   - `surface: 'agent-profile'` → caller-supplied proposer mutates the complete\n *     canonical AgentProfile JSON in one candidate.\n *   - `surface` ∈ {`tools`, `mcp`, `hooks`, `subagents`, `agent-profile`, `code`} → no zero-config default\n *     proposer exists (a code/config proposer needs caller-supplied wiring — a\n *     worktree repo root, a candidate generator, a serializer). The facade\n *     requires an explicit `opts.generator` for these and throws a `ConfigError`\n *     otherwise. This is a designed boundary, not a missing default: there is\n *     no safe value the facade could invent for those surfaces. Code also\n *     requires `opts.code.repoRoot` so its incumbent is a real isolated checkout.\n *\n * Everything else (`scenarios`, `judge`, `agent`, `budget`, `llm`) passes\n * straight through to `selfImprove`.\n *\n * @experimental\n */\n\nimport { canonicalJson } from '@tangle-network/agent-eval'\nimport {\n  gepaProposer,\n  gitWorktreeAdapter,\n  memoryCurationProposer,\n  skillOptProposer,\n} from '@tangle-network/agent-eval/campaign'\nimport {\n  type CodeSurface,\n  type MutableSurface,\n  type Scenario,\n  type SelfImproveBudget,\n  type SelfImproveLlm,\n  type SelfImproveOptions,\n  type SelfImproveResult,\n  type SurfaceProposer,\n  selfImprove,\n} from '@tangle-network/agent-eval/contract'\nimport { type AgentProfile, agentProfileSchema } from '@tangle-network/agent-interface'\nimport { ConfigError } from '../errors'\nimport type { LocalHarness } from '../mcp/local-harness'\nimport { assertModelAllowed } from '../runtime/supervise/model-policy'\nimport { agenticGenerator, type Verifier } from './agentic-generator'\nimport {\n  type CandidateGenerator,\n  improvementDriver,\n  type ManagedImprovementDriver,\n} from './improvement-driver'\nimport { rawTraceDistiller } from './raw-trace-distiller'\n\n/** The executable agent lever `improve` optimizes. Profile fields remain\n *  portable AgentProfile coordinates; implementation and orchestration files\n *  use the code surface so a winner can be sealed into an exact candidate. */\nexport type ImproveSurface =\n  | 'prompt'\n  | 'skills'\n  | 'tools'\n  | 'mcp'\n  | 'hooks'\n  | 'subagents'\n  | 'agent-profile'\n  | 'memory'\n  | 'code'\n\nexport type ImproveOptions<TScenario extends Scenario, TArtifact> = Omit<\n  SelfImproveOptions<TScenario, TArtifact>,\n  'analyzeGeneration' | 'baselineSurface' | 'findings' | 'gate' | 'proposer'\n> & {\n  /** Which profile lever to optimize. Default `'prompt'`. Selects the default\n   *  generator + the baseline-surface extraction shape. */\n  surface?: ImproveSurface\n  /** The `SurfaceProposer` that mutates the surface. When unset, the facade\n   *  picks the default for prompt, skills, and memory; surfaces\n   *  with no default REQUIRE this (fail-loud otherwise). */\n  generator?: SurfaceProposer\n  /** Gate mode. `'holdout'` (default) runs the held-out promotion gate;\n   *  `'none'` is a baseline-only run (`budget.generations = 0`). */\n  gate?: 'holdout' | 'none'\n  /** Restrict the run to this subset of models. When set, the reflection model\n   *  (`llm.model`, or the default when unset) must be a member, or `improve()` throws\n   *  a `ConfigError` before the generator is built. Unset = unrestricted. */\n  allowedModels?: readonly string[]\n  /** Per-generation findings producer passthrough (see selfImprove.analyzeGeneration).\n   *  DEFAULT: the built-in failure distiller — after each generation it turns the\n   *  worst-scoring/errored cells into structured findings ({ scenario, composite,\n   *  notes, error }) for the NEXT proposal round, so the proposer reasons over what\n   *  actually failed instead of a static seed. Pass your own producer (e.g. a\n   *  trace-analyst over the runDir's traces) to replace it; pass `null` to disable\n   *  and keep the static `findings` all the way through. */\n  analyzeGeneration?: SelfImproveOptions<TScenario, TArtifact>['analyzeGeneration'] | null\n  /** META-HARNESS mode: instead of the ~400-char distilled findings, feed the\n   *  proposer RAW-TRACE FILESYSTEM CONTEXT — the PATHS into the prior generation's\n   *  real run traces under `runDir` (per-cell `spans.jsonl` event logs +\n   *  `cached-result.json` scores + artifacts) plus a `grep`/`cat`-to-diagnose\n   *  instruction — so the coding agent reads the actual failures itself rather than\n   *  a pre-summary. Requires a REAL `runDir` (that is where the traces live).\n   *  Ignored when `analyzeGeneration` is set explicitly (that wins) or is `null`\n   *  (disabled). Equivalent to `analyzeGeneration: rawTraceDistiller()`; this flag\n   *  is the one-line enable. Default `false` (the distiller stays the default). */\n  rawTraceContext?: boolean\n  /** CODE-surface wiring: name `surface: 'code'`, point at a repo, and the\n   *  facade assembles the whole candidate pipeline — an isolated incumbent plus git worktrees\n   *  (`gitWorktreeAdapter`) driven by `improvementDriver` with the full agentic\n   *  generator (a real coding harness edits each candidate worktree; a `verify`\n   *  hook gates candidates before they are ever measured). Ignored when\n   *  `opts.generator` is supplied. Required for every code run because a real\n   *  repository and base ref are necessary to measure the incumbent. */\n  code?: ImproveCodeOptions\n  /** SKILLS-surface wiring for real skill-DOCUMENT optimization. Without this,\n   *  `surface: 'skills'` optimizes the profile's skills REFS array (file pointers)\n   *  — which `skillOptProposer` (a document patcher) cannot meaningfully edit.\n   *  Provide the document CONTENT to optimize + a `writeBack` to persist the\n   *  shipped winner (the profile ref points at a file the caller owns). This is\n   *  what makes skillOpt reachable through improve(). */\n  skills?: ImproveSkillsOptions\n  /** MEMORY-surface wiring for a curated durable memory document. The default\n   *  deterministic proposer deduplicates and ranks lessons from findings, then\n   *  replaces its managed block instead of growing memory without bound. */\n  memory?: ImproveMemoryOptions\n  /** Custom held-back-exam decision. The string `gate` above controls whether\n   *  the exam runs; this callback controls how its evidence decides promotion. */\n  promotionGate?: SelfImproveOptions<TScenario, TArtifact>['gate']\n}\n\nexport interface ImproveSkillsOptions {\n  /** The skill document's current text — the baseline `skillOptProposer` patches. */\n  document: string\n  /** Persist the shipped winner document (write the file the profile ref points at).\n   *  Called only on a ship verdict. When omitted, the winner is still returned in\n   *  `result.raw.winner.surface` for the caller to materialize. */\n  writeBack?: (winnerDocument: string) => void | Promise<void>\n}\n\nexport interface ImproveMemoryOptions {\n  /** Current durable memory text used as the measured baseline. */\n  document: string\n  /** Persist the promoted memory document. Never called on hold or error. */\n  writeBack?: (winnerDocument: string) => void | Promise<void>\n}\n\nexport interface ImproveCodeOptions {\n  /** Repo root candidate worktrees fork from. */\n  repoRoot: string\n  /** Base ref candidates fork from. Default `main`. */\n  baseRef?: string\n  /** Directory worktrees are created under. Default `<repoRoot>/.worktrees`. */\n  worktreeDir?: string\n  /** Coding harness the agentic generator runs in each worktree. Default `claude`. */\n  harness?: LocalHarness\n  /** Verify a candidate worktree before it becomes a measurable surface; failures\n   *  feed the next shot (see `agenticGenerator.verify` / `commandVerifier`). */\n  verify?: Verifier\n  /** Per-shot wall-clock timeout for the harness (ms). */\n  timeoutMs?: number\n  /** Byte-producer override — the test seam and the escape hatch for custom\n   *  candidate production. When set, `harness`/`verify`/`timeoutMs` are unused. */\n  generator?: CandidateGenerator\n}\n\nexport interface ImproveResult<TScenario extends Scenario, TArtifact> {\n  /** The profile after improvement: the winner surface applied back into the\n   *  matching field when the gate shipped, else the input profile unchanged. */\n  profile: AgentProfile\n  /** True when `gateDecision === 'ship'`. */\n  shipped: boolean\n  /** Held-out lift (`winner − baseline` composite). */\n  lift: number\n  /** The five-valued gate verdict from `selfImprove`. */\n  gateDecision: SelfImproveResult<TScenario, TArtifact>['gateDecision']\n  /** Full `selfImprove` result for advanced inspection. */\n  raw: SelfImproveResult<TScenario, TArtifact>\n}\n\n/** Default model id for the reflective drivers when `llm.model` is unset — a model the Tangle\n *  router actually serves (callers should pass their own `llm.model`). */\nconst defaultReflectionModel = 'deepseek-v4-flash'\n\n/** The reflective proposers (`gepaProposer`/`skillOptProposer`) take a full\n *  `LlmClientOptions`; `SelfImproveLlm` is the thin user-facing subset. */\nfunction llmClientOptions(llm: SelfImproveLlm | undefined): { baseUrl?: string; apiKey?: string } {\n  return { baseUrl: llm?.baseUrl, apiKey: llm?.apiKey }\n}\n\n/** The default proposer for a surface, or `undefined` when the surface has no\n *  zero-config default (the caller must supply `opts.generator`). */\nfunction defaultGeneratorFor(\n  surface: ImproveSurface,\n  llm: SelfImproveLlm | undefined,\n): SurfaceProposer | undefined {\n  const model = llm?.model ?? defaultReflectionModel\n  switch (surface) {\n    case 'prompt':\n      return gepaProposer({ llm: llmClientOptions(llm), model, target: 'agent system prompt' })\n    case 'skills':\n      return skillOptProposer({ llm: llmClientOptions(llm), model, target: 'agent skill document' })\n    case 'memory':\n      return memoryCurationProposer()\n    default:\n      return undefined\n  }\n}\n\n/** Extract the baseline surface a driver mutates from the profile field that\n *  backs `surface`. Prompt, skills, and memory are text surfaces; config\n *  surfaces serialize the matching profile record. */\nfunction baselineSurfaceFor(\n  profile: AgentProfile,\n  surface: ImproveSurface,\n  skills?: ImproveSkillsOptions,\n  memory?: ImproveMemoryOptions,\n): MutableSurface {\n  switch (surface) {\n    case 'prompt':\n      return profile.prompt?.systemPrompt ?? ''\n    case 'skills':\n      // With a document supplied, optimize its CONTENT (the real skillOpt path);\n      // otherwise fall back to the refs-array surface for back-compat.\n      return skills?.document ?? JSON.stringify(profile.resources?.skills ?? [])\n    case 'tools':\n      return JSON.stringify(profile.tools ?? {})\n    case 'mcp':\n      return JSON.stringify(profile.mcp ?? {})\n    case 'hooks':\n      return JSON.stringify(profile.hooks ?? {})\n    case 'subagents':\n      return JSON.stringify(profile.subagents ?? {})\n    case 'agent-profile':\n      return canonicalJson(profile)\n    case 'memory':\n      if (!memory) {\n        throw new ConfigError(\"improve(): surface 'memory' requires opts.memory.document\")\n      }\n      return memory.document\n    case 'code':\n      throw new ConfigError(\n        'improve(): code requires the isolated baseline created from opts.code.repoRoot',\n      )\n  }\n}\n\n/** The default `analyzeGeneration`: distill each generation's failing cells into\n *  findings for the next proposal round. Deliberately dependency-free — judge notes\n *  and errors are already the domain's own diagnosis (executable gates put their\n *  reasons there); a trace-analyst can replace this wholesale via\n *  `opts.analyzeGeneration`. Falls back to the static seed findings when the\n *  generation had no failures, so a clean round never wipes the seed context. */\nfunction generationFailureDistiller<TScenario extends Scenario, TArtifact>(\n  staticFindings: unknown[],\n): NonNullable<SelfImproveOptions<TScenario, TArtifact>['analyzeGeneration']> {\n  const CAP = 12\n  return async (input) => {\n    const failures: Array<{\n      scenario: string\n      composite: number\n      notes: string\n      claim?: string\n      error?: string\n    }> = []\n    for (const candidate of input.candidates) {\n      for (const rawCell of candidate.campaign.cells) {\n        const cell = rawCell as unknown as Record<string, unknown>\n        const scenario = String(cell.scenarioId ?? 'unknown')\n        const error = typeof cell.error === 'string' ? cell.error : undefined\n        const judgeScores =\n          cell.judgeScores && typeof cell.judgeScores === 'object'\n            ? Object.values(\n                cell.judgeScores as Record<string, { composite?: number; notes?: string }>,\n              )\n            : []\n        const composite =\n          judgeScores.length === 0\n            ? 0\n            : judgeScores.reduce((sum, j) => sum + (j.composite ?? 0), 0) / judgeScores.length\n        if (!error && composite >= 0.999) continue\n        const notes = judgeScores\n          .map((j) => j.notes)\n          .filter((n): n is string => typeof n === 'string' && n.length > 0)\n          .join('; ')\n          .slice(0, 400)\n        const claim = notes || (error ? `Scenario ${scenario} failed: ${error.slice(0, 200)}` : '')\n        failures.push({\n          scenario,\n          composite: Number(composite.toFixed(3)),\n          notes,\n          ...(claim ? { claim } : {}),\n          ...(error ? { error: error.slice(0, 200) } : {}),\n        })\n      }\n    }\n    if (failures.length === 0) return staticFindings\n    failures.sort((a, b) => a.composite - b.composite)\n    return failures.slice(0, CAP)\n  }\n}\n\n/** Memory accumulates durable lessons, so keep the caller's seed findings while\n * adding fresh judge failures. Curator proposers consume `claim`; the generic\n * distiller retains the richer diagnostic fields for reflective proposers. */\nfunction memoryGenerationDistiller<TScenario extends Scenario, TArtifact>(\n  staticFindings: unknown[],\n): NonNullable<SelfImproveOptions<TScenario, TArtifact>['analyzeGeneration']> {\n  const distillFailures = generationFailureDistiller<TScenario, TArtifact>(staticFindings)\n  return async (input) => {\n    const fresh = await distillFailures(input)\n    return fresh === staticFindings ? staticFindings : [...staticFindings, ...fresh]\n  }\n}\n\ninterface PreparedCodeRun {\n  baseline: CodeSurface\n  proposer: SurfaceProposer\n  cleanup(retainedWinner?: MutableSurface): Promise<void>\n}\n\nfunction isCodeSurface(surface: MutableSurface | undefined): surface is CodeSurface {\n  return typeof surface === 'object' && surface !== null && surface.kind === 'code'\n}\n\n/** Create a clean incumbent checkout and the candidate producer for a code run. */\nasync function prepareCodeRun(\n  code: ImproveCodeOptions,\n  proposerOverride?: SurfaceProposer,\n): Promise<PreparedCodeRun> {\n  const baseRef = code.baseRef ?? 'main'\n  const worktree = gitWorktreeAdapter({\n    repoRoot: code.repoRoot,\n    ...(code.worktreeDir ? { worktreeDir: code.worktreeDir } : {}),\n  })\n  const baselineWorktree = await worktree.create({ baseRef, label: 'incumbent-baseline' })\n  const baseline = await worktree.finalize(baselineWorktree, 'Incumbent code checkout')\n  let managed: ManagedImprovementDriver | undefined\n  if (!proposerOverride) {\n    const generator =\n      code.generator ??\n      agenticGenerator({\n        ...(code.harness ? { harness: code.harness } : {}),\n        ...(code.verify ? { verify: code.verify } : {}),\n        ...(code.timeoutMs ? { timeoutMs: code.timeoutMs } : {}),\n      })\n    managed = improvementDriver({ worktree, generator, baseRef })\n  }\n  const proposer = proposerOverride ?? managed\n  if (!proposer) {\n    throw new ConfigError('improve(): code candidate generator could not be constructed')\n  }\n\n  return {\n    baseline,\n    proposer,\n    async cleanup(retainedWinner) {\n      const errors: unknown[] = []\n      try {\n        await managed?.cleanup(isCodeSurface(retainedWinner) ? [retainedWinner.worktreeRef] : [])\n      } catch (cause) {\n        errors.push(cause)\n      }\n      try {\n        await worktree.discard(baselineWorktree)\n      } catch (cause) {\n        errors.push(cause)\n      }\n      if (errors.length > 0) {\n        throw new AggregateError(errors, 'improve(): failed to clean code improvement worktrees')\n      }\n    },\n  }\n}\n\n/** Parse a JSON winner surface (`tools`/`mcp`/`hooks`/`subagents`/`agent-profile`) with a typed,\n *  contextual error. A malformed generator output must fail loud here, not throw\n *  a raw `SyntaxError` to the caller after a ship verdict. */\nfunction parseWinnerJson<T>(winner: string, surface: ImproveSurface): T {\n  try {\n    return JSON.parse(winner) as T\n  } catch (cause) {\n    throw new ConfigError(\n      `improve(): the shipped '${surface}' winner is not valid JSON, so it cannot be applied back to the profile: ${\n        (cause as Error).message\n      }`,\n    )\n  }\n}\n\n/** Apply a promoted winner surface back into the profile field for `surface`.\n *  Returns a shallow copy; never mutates the input profile. */\nexport function applyImprovementWinnerToProfile(\n  profile: AgentProfile,\n  surface: ImproveSurface,\n  winner: MutableSurface,\n): AgentProfile {\n  // Only string surfaces map cleanly back onto a profile field. A `CodeSurface`\n  // winner (the `code` lever) is a worktree ref, not a profile value — the\n  // caller materializes it from `raw.winner.surface`; the returned profile is\n  // unchanged for that lever.\n  if (typeof winner !== 'string') return profile\n  let candidate: AgentProfile\n  switch (surface) {\n    case 'prompt':\n      candidate = { ...profile, prompt: { ...profile.prompt, systemPrompt: winner } }\n      break\n    case 'skills':\n      candidate = {\n        ...profile,\n        resources: { ...profile.resources, skills: parseWinnerJson(winner, surface) },\n      }\n      break\n    case 'tools':\n      candidate = { ...profile, tools: parseWinnerJson(winner, surface) }\n      break\n    case 'mcp':\n      candidate = { ...profile, mcp: parseWinnerJson(winner, surface) }\n      break\n    case 'hooks':\n      candidate = { ...profile, hooks: parseWinnerJson(winner, surface) }\n      break\n    case 'subagents':\n      candidate = { ...profile, subagents: parseWinnerJson(winner, surface) }\n      break\n    case 'agent-profile':\n      candidate = parseWinnerJson(winner, surface)\n      break\n    case 'memory':\n      return profile\n    case 'code':\n      return profile\n  }\n  const parsed = agentProfileSchema.safeParse(candidate)\n  if (!parsed.success) {\n    throw new ConfigError(\n      `improve(): the shipped '${surface}' winner does not produce a valid AgentProfile: ${parsed.error.message}`,\n    )\n  }\n  return parsed.data\n}\n\n/**\n * Run the held-out-gated self-improvement loop on ONE profile surface.\n *\n * @example Optimize the system prompt, default holdout gate:\n *\n *   const out = await improve(profile, findings, {\n *     surface: 'prompt',\n *     scenarios,\n *     judge,\n *     agent: (surface, scenario, ctx) => runAgent(surface, scenario, ctx.signal),\n *   })\n *   if (out.shipped) deploy(out.profile)\n */\nexport async function improve<TScenario extends Scenario, TArtifact>(\n  profile: AgentProfile,\n  findings: unknown[],\n  opts: ImproveOptions<TScenario, TArtifact>,\n): Promise<ImproveResult<TScenario, TArtifact>> {\n  const {\n    surface = 'prompt',\n    gate = 'holdout',\n    generator,\n    allowedModels,\n    rawTraceContext,\n    code,\n    skills,\n    memory,\n    promotionGate,\n    analyzeGeneration,\n    ...sharedOptions\n  } = opts\n\n  const parsedProfile = agentProfileSchema.safeParse(profile)\n  if (!parsedProfile.success) {\n    throw new ConfigError(\n      `improve(): input is not a valid AgentProfile: ${parsedProfile.error.message}`,\n    )\n  }\n  if (surface === 'skills' && !generator && !skills) {\n    throw new ConfigError(\n      'improve(): the default skills optimizer requires opts.skills.document; pass the skill text or an explicit generator that understands resource refs',\n    )\n  }\n  if (surface === 'memory' && !memory) {\n    throw new ConfigError(\"improve(): surface 'memory' requires opts.memory.document\")\n  }\n  const usesReflectionModel = !generator && (surface === 'prompt' || surface === 'skills')\n  if (usesReflectionModel) {\n    assertModelAllowed(sharedOptions.llm?.model ?? defaultReflectionModel, allowedModels)\n  }\n\n  let preparedCode: PreparedCodeRun | undefined\n  if (surface === 'code') {\n    if (!code) {\n      throw new ConfigError(\n        \"improve(): surface 'code' requires opts.code.repoRoot so the incumbent can run from an isolated checkout\",\n      )\n    }\n    preparedCode = await prepareCodeRun(code, generator)\n  }\n  const proposer =\n    preparedCode?.proposer ?? generator ?? defaultGeneratorFor(surface, sharedOptions.llm)\n  if (!proposer) {\n    throw new ConfigError(\n      `improve(): surface '${surface}' has no default generator — pass opts.generator (a SurfaceProposer) explicitly`,\n    )\n  }\n\n  const budget: SelfImproveBudget =\n    gate === 'none' ? { ...sharedOptions.budget, generations: 0 } : { ...sharedOptions.budget }\n\n  let raw: SelfImproveResult<TScenario, TArtifact>\n  try {\n    raw = await selfImprove<TScenario, TArtifact>({\n      ...sharedOptions,\n      baselineSurface:\n        preparedCode?.baseline ?? baselineSurfaceFor(profile, surface, skills, memory),\n      proposer,\n      budget,\n      findings,\n      ...(promotionGate !== undefined ? { gate: promotionGate } : {}),\n      ...(analyzeGeneration === null\n        ? {}\n        : {\n            analyzeGeneration:\n              analyzeGeneration ??\n              (rawTraceContext\n                ? rawTraceDistiller<TScenario, TArtifact>({ fallbackFindings: findings })\n                : surface === 'memory'\n                  ? memoryGenerationDistiller<TScenario, TArtifact>(findings)\n                  : generationFailureDistiller<TScenario, TArtifact>(findings)),\n          }),\n    })\n  } catch (cause) {\n    if (!preparedCode) throw cause\n    try {\n      await preparedCode.cleanup()\n    } catch (cleanupCause) {\n      throw new AggregateError(\n        [cause, cleanupCause],\n        'improve(): code improvement failed and its worktrees could not be cleaned',\n      )\n    }\n    throw cause\n  }\n\n  const shipped = raw.gateDecision === 'ship'\n  const winnerSurface = raw.winner.surface\n  await preparedCode?.cleanup(shipped ? winnerSurface : undefined)\n  // When a skill DOCUMENT was optimized, the winner is document text — persist it\n  // via writeBack (the profile ref points at the caller's file, unchanged) rather\n  // than parsing it as a refs array. Otherwise use the standard field write-back.\n  const externalDocument =\n    surface === 'skills' && skills ? skills : surface === 'memory' && memory ? memory : undefined\n  if (shipped && externalDocument) {\n    if (typeof winnerSurface !== 'string') {\n      throw new ConfigError(\n        `improve(): the shipped '${surface}' winner must be text before it can be persisted`,\n      )\n    }\n    await externalDocument.writeBack?.(winnerSurface)\n  }\n  const nextProfile =\n    shipped && !externalDocument\n      ? applyImprovementWinnerToProfile(profile, surface, winnerSurface)\n      : profile\n\n  return { profile: nextProfile, shipped, lift: raw.lift, gateDecision: raw.gateDecision, raw }\n}\n"],"mappings":";;;;;;;;;;;AA8EO,SAAS,kBAAkB,MAA0D;AAC1F,QAAM,UAAU,KAAK,WAAW;AAChC,QAAM,YAAY,oBAAI,IAAsB;AAE5C,SAAO;AAAA,IACL,MAAM,eAAe,KAAK,UAAU,IAAI;AAAA,IACxC,MAAM,QAAQ,KAAqC;AACjD,YAAM,WAAW,gBAAgB,GAAG;AAQpC,UACE,SAAS,WAAW,KACpB,IAAI,WAAW,UACf,CAAC,KAAK,UAAU,yBAChB;AACA,eAAO,CAAC;AAAA,MACV;AAEA,YAAM,WAA0B,CAAC;AACjC,eAAS,IAAI,GAAG,IAAI,IAAI,gBAAgB,KAAK;AAC3C,YAAI,IAAI,OAAO,QAAS;AACxB,cAAM,KAAK,MAAM,KAAK,SAAS,OAAO;AAAA,UACpC;AAAA,UACA,OAAO,GAAG,KAAK,UAAU,IAAI,OAAO,IAAI,UAAU,QAAQ,CAAC;AAAA,QAC7D,CAAC;AAID,YAAI;AACF,gBAAM,EAAE,SAAS,QAAQ,IAAI,MAAM,KAAK,UAAU,SAAS;AAAA,YACzD,cAAc,GAAG;AAAA,YACjB,QAAQ,IAAI;AAAA,YACZ;AAAA,YACA,SAAS,IAAI;AAAA,YACb,UAAU,IAAI,uBAAuB;AAAA,YACrC,QAAQ,IAAI;AAAA,UACd,CAAC;AACD,cAAI,CAAC,SAAS;AACZ,kBAAM,KAAK,SAAS,QAAQ,EAAE;AAC9B;AAAA,UACF;AACA,gBAAM,UAAU,MAAM,KAAK,SAAS,SAAS,IAAI,OAAO;AACxD,mBAAS,KAAK,OAAO;AACrB,oBAAU,IAAI,QAAQ,aAAa,EAAE;AAAA,QACvC,SAAS,KAAK;AAEZ,gBAAM,KAAK,SAAS,QAAQ,EAAE,EAAE,MAAM,MAAM;AAAA,UAAC,CAAC;AAC9C,gBAAM;AAAA,QACR;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,IACA,MAAM,QAAQ,qBAAqB,CAAC,GAAG;AACrC,YAAM,WAAW,IAAI,IAAI,kBAAkB;AAC3C,YAAM,SAAoB,CAAC;AAC3B,iBAAW,CAAC,aAAa,QAAQ,KAAK,WAAW;AAC/C,YAAI,SAAS,IAAI,WAAW,EAAG;AAC/B,YAAI;AACF,gBAAM,KAAK,SAAS,QAAQ,QAAQ;AACpC,oBAAU,OAAO,WAAW;AAAA,QAC9B,SAAS,OAAO;AACd,iBAAO,KAAK,KAAK;AAAA,QACnB;AAAA,MACF;AACA,UAAI,OAAO,SAAS,GAAG;AACrB,cAAM,IAAI,eAAe,QAAQ,0DAA0D;AAAA,MAC7F;AAAA,IACF;AAAA,EACF;AACF;AAKA,SAAS,gBAAgB,KAAuD;AAC9E,QAAM,SAAS,IAAI;AACnB,MAAI,UAAU,OAAO,WAAW,YAAY,cAAc,QAAQ;AAChE,UAAM,IAAK,OAAiC;AAC5C,QAAI,MAAM,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAG,QAAO;AAAA,EAC/C;AACA,SAAO,IAAI;AACb;;;ACnIA,SAAsB,YAAY,mBAAmB;AACrD,SAAS,UAAU,MAAM,eAAe;AACxC,SAA8B,mBAAmB;AAGjD,IAAM,aAAa;AAGnB,IAAM,iBAAiB;AA8ChB,SAAS,kBACd,UAAoC,CAAC,GACuC;AAC5E,QAAM,gBAAgB,QAAQ,iBAAiB;AAC/C,QAAM,uBAAuB,QAAQ,wBAAwB;AAC7D,QAAM,kBAAkB,QAAQ,mBAAmB;AAEnD,SAAO,OAAO,UAAU;AACtB,UAAM,UAAU,eAAe,QAAQ,UAAU,MAAM,MAAM;AAC7D,UAAM,UAAU,UAAU,OAAO;AAIjC,UAAM,SAAS,CAAC,GAAG,MAAM,UAAU,EAChC,IAAI,CAAC,OAAO;AAAA,MACX,aAAa,EAAE;AAAA,MACf,WAAW,EAAE;AAAA,MACb,aAAa,eAAe,EAAE,SAAS,MAAM;AAAA,MAC7C,OAAO,aAAa,EAAE,UAAU,sBAAsB,eAAe;AAAA,IACvE,EAAE,EACD,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS,EACxC,MAAM,GAAG,aAAa;AAEzB,UAAM,oBAAoB,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,MAAM,QAAQ,CAAC;AAUvE,QAAI,sBAAsB,GAAG;AAC3B,UAAI,QAAQ,oBAAoB,QAAQ,iBAAiB,SAAS,GAAG;AACnE,eAAO,QAAQ;AAAA,MACjB;AACA,aAAO;AAAA,QACL,YAAY;AAAA,UACV,YAAY;AAAA,UACZ,UAAU;AAAA,UACV,MAAM;AAAA,UACN,YAAY;AAAA,UACZ,OAAO,cAAc,MAAM,UAAU,oEAAoE,OAAO;AAAA,UAChH,oBAAoB,oDAAoD,OAAO;AAAA,UAC/E,eAAe,CAAC,EAAE,MAAM,YAAY,KAAK,QAAQ,CAAC;AAAA,UAClD,UAAU,EAAE,YAAY,MAAM,YAAY,QAAQ,SAAS,cAAc,EAAE;AAAA,QAC7E,CAAC;AAAA,MACH;AAAA,IACF;AAEA,UAAM,WAA6B,CAAC;AAGpC,aAAS;AAAA,MACP,YAAY;AAAA,QACV,YAAY;AAAA,QACZ,UAAU;AAAA,QACV,MAAM;AAAA,QACN,YAAY;AAAA,QACZ,OAAO,cAAc,MAAM,UAAU,aAAa,iBAAiB,uCAAuC,OAAO,MAAM,8DAA8D,OAAO,0GAC1L,UACI,KACA,mJACN;AAAA,QACA,oBAAoB,oWAAoW,OAAO;AAAA,QAC/X,eAAe,CAAC,EAAE,MAAM,YAAY,KAAK,QAAQ,CAAC;AAAA,QAClD,UAAU;AAAA,UACR,YAAY,MAAM;AAAA,UAClB,QAAQ;AAAA,UACR,cAAc;AAAA,UACd,YAAY,OAAO;AAAA,QACrB;AAAA,MACF,CAAC;AAAA,IACH;AAIA,eAAW,QAAQ,QAAQ;AACzB,UAAI,KAAK,MAAM,WAAW,EAAG;AAC7B,YAAM,eAAe,KAAK,MAAM,IAAI,CAAC,MAAM,EAAE,UAAU,EAAE,KAAK,IAAI;AAClE,YAAM,YAAY,KAAK,MACpB,IAAI,CAAC,MAAM;AACV,cAAM,SAAS,UAAU,EAAE,UAAU,eAAe,EAAE,UAAU,QAAQ,CAAC,CAAC,GACxE,EAAE,QAAQ,YAAY,SAAS,EAAE,OAAO,GAAG,CAAC,KAAK,EACnD,gBAAW,EAAE,OAAO;AACpB,cAAM,QAAQ,EAAE,MAAM,IAAI,CAAC,MAAM,SAAS,CAAC,EAAE,EAAE,KAAK,IAAI;AACxD,cAAM,OAAO,EAAE,iBAAiB;AAAA,kBAAgB,EAAE,OAAO,mBAAmB;AAC5E,eAAO,EAAE,MAAM,SAAS,IAAI,GAAG,MAAM;AAAA,EAAK,KAAK,GAAG,IAAI,KAAK;AAAA,MAC7D,CAAC,EACA,KAAK,IAAI;AAEZ,eAAS;AAAA,QACP,YAAY;AAAA,UACV,YAAY;AAAA,UACZ,UAAU,KAAK,YAAY,MAAM,aAAa;AAAA,UAC9C,MAAM;AAAA,UACN,YAAY;AAAA,UACZ,SAAS,KAAK;AAAA,UACd,OAAO,aAAa,KAAK,WAAW,qBAAqB,KAAK,UAAU,QAAQ,CAAC,CAAC,SAAS,KAAK,MAAM,MAAM,qBAAqB,YAAY,+BAA+B,KAAK,WAAW;AAAA,UAC5L,oBAAoB;AAAA,EAAyF,SAAS;AAAA,qDAAwD,KAAK,WAAW,kBAAkB,KAAK,WAAW;AAAA,UAChO,eAAe;AAAA,YACb,EAAE,MAAM,YAAY,KAAK,KAAK,YAAY;AAAA,YAC1C,GAAG,KAAK,MAAM;AAAA,cAAQ,CAAC,MACrB,EAAE,MAAM,IAAI,CAAC,OAAO,EAAE,MAAM,YAAqB,KAAK,EAAE,EAAE;AAAA,YAC5D;AAAA,UACF;AAAA,UACA,UAAU;AAAA,YACR,aAAa,KAAK;AAAA,YAClB,WAAW,KAAK;AAAA,YAChB,aAAa,KAAK;AAAA,YAClB,OAAO,KAAK,MAAM,IAAI,CAAC,OAAO;AAAA,cAC5B,YAAY,EAAE;AAAA,cACd,WAAW,EAAE;AAAA,cACb,SAAS,EAAE;AAAA,cACX,OAAO,EAAE;AAAA,cACT,GAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,IAAI,CAAC;AAAA,YACtC,EAAE;AAAA,UACJ;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AACF;AAKA,SAAS,aACP,UAUA,UACA,UACa;AACb,QAAM,cAAc,eAAe,SAAS,MAAM;AAClD,QAAM,UAAU,UAAU,WAAW;AACrC,QAAM,MAAmB,CAAC;AAC1B,aAAW,QAAQ,SAAS,OAAO;AACjC,UAAM,SAAS,OAAO,OAAO,KAAK,eAAe,CAAC,CAAC;AACnD,UAAM,YACJ,OAAO,WAAW,IACd,IACA,OAAO,OAAO,CAAC,KAAK,MAAM,OAAO,EAAE,aAAa,IAAI,CAAC,IAAI,OAAO;AACtE,QAAI,CAAC,KAAK,SAAS,aAAa,eAAgB;AAEhD,UAAM,UAAU,KAAK,aAAa,eAAe,KAAK,MAAM,CAAC;AAC7D,UAAM,gBAAgB,qBAAqB,SAAS,iBAAiB,KAAK,MAAM;AAChF,UAAM,aAAa,UAAU,eAAe,OAAO,IAAI,CAAC;AAGxD,UAAM,YAAY,CAAC,KAAK,SAAS,aAAa,GAAG,KAAK,SAAS,oBAAoB,CAAC;AACpF,UAAM,QAAQ,aAAa,CAAC,GAAG,YAAY,GAAG,eAAe,GAAG,SAAS,CAAC;AAE1E,QAAI,KAAK;AAAA,MACP,YAAY,KAAK;AAAA,MACjB,WAAW,OAAO,UAAU,QAAQ,CAAC,CAAC;AAAA,MACtC,GAAI,KAAK,QAAQ,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC;AAAA,MAC1C;AAAA,MACA,OAAO,MAAM,MAAM,GAAG,QAAQ;AAAA,MAC9B,gBAAgB,MAAM,SAAS;AAAA,IACjC,CAAC;AACD,QAAI,IAAI,UAAU,SAAU;AAAA,EAC9B;AACA,SAAO;AACT;AAIA,SAAS,qBACP,iBACA,QACU;AACV,MAAI,CAAC,gBAAiB,QAAO,CAAC;AAC9B,QAAM,SAAS,GAAG,MAAM;AACxB,SAAO,OAAO,QAAQ,eAAe,EAClC,OAAO,CAAC,CAAC,GAAG,MAAM,IAAI,WAAW,MAAM,CAAC,EACxC,IAAI,CAAC,CAAC,EAAE,OAAO,MAAM,QAAQ,OAAO,CAAC;AAC1C;AAMA,SAAS,eAAe,KAAuB;AAC7C,QAAM,MAAgB,CAAC;AACvB,aAAW,SAAS,YAAY,GAAG,GAAG;AACpC,UAAM,OAAO,KAAK,KAAK,MAAM,IAAI;AACjC,QAAI,MAAM,OAAO,GAAG;AAClB,UAAI,KAAK,IAAI;AAAA,IACf,WAAW,CAAC,MAAM,eAAe,KAAK,MAAM,YAAY,GAAG;AACzD,iBAAW,OAAO,YAAY,IAAI,GAAG;AACnC,YAAI,IAAI,OAAO,EAAG,KAAI,KAAK,KAAK,MAAM,IAAI,IAAI,CAAC;AAAA,MACjD;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,YAAY,KAAuB;AAC1C,MAAI;AACF,WAAO,YAAY,KAAK,EAAE,eAAe,KAAK,CAAC;AAAA,EACjD,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACF;AAIA,SAAS,eAAe,QAAwB;AAC9C,SAAO,OAAO,QAAQ,mBAAmB,GAAG;AAC9C;AAIA,SAAS,UAAU,QAAyB;AAC1C,SAAO,CAAC,OAAO,WAAW,QAAQ,KAAK,WAAW,MAAM;AAC1D;AAIA,SAAS,eAAe,QAAwB;AAC9C,SAAO,OAAO,WAAW,QAAQ,IAAI,SAAS,QAAQ,MAAM;AAC9D;AAEA,SAAS,aAAa,OAA2B;AAC/C,SAAO,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM;AAExC,UAAM,KAAK,EAAE,MAAM,GAAG,EAAE,SAAS,SAAS,CAAC,EAAE,MAAM;AACnD,UAAM,KAAK,EAAE,MAAM,GAAG,EAAE,SAAS,SAAS,CAAC,EAAE,MAAM;AACnD,WAAO,OAAO,KAAK,SAAS,CAAC,EAAE,cAAc,SAAS,CAAC,CAAC,IAAI,GAAG,cAAc,EAAE;AAAA,EACjF,CAAC;AACH;AAEA,SAAS,SAAS,GAAW,GAAmB;AAC9C,SAAO,EAAE,UAAU,IAAI,IAAI,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;AACjD;;;AC5SA,SAAS,qBAAqB;AAC9B;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP;AAAA,EASE;AAAA,OACK;AACP,SAA4B,0BAA0B;AAyItD,IAAM,yBAAyB;AAI/B,SAAS,iBAAiB,KAAwE;AAChG,SAAO,EAAE,SAAS,KAAK,SAAS,QAAQ,KAAK,OAAO;AACtD;AAIA,SAAS,oBACP,SACA,KAC6B;AAC7B,QAAM,QAAQ,KAAK,SAAS;AAC5B,UAAQ,SAAS;AAAA,IACf,KAAK;AACH,aAAO,aAAa,EAAE,KAAK,iBAAiB,GAAG,GAAG,OAAO,QAAQ,sBAAsB,CAAC;AAAA,IAC1F,KAAK;AACH,aAAO,iBAAiB,EAAE,KAAK,iBAAiB,GAAG,GAAG,OAAO,QAAQ,uBAAuB,CAAC;AAAA,IAC/F,KAAK;AACH,aAAO,uBAAuB;AAAA,IAChC;AACE,aAAO;AAAA,EACX;AACF;AAKA,SAAS,mBACP,SACA,SACA,QACA,QACgB;AAChB,UAAQ,SAAS;AAAA,IACf,KAAK;AACH,aAAO,QAAQ,QAAQ,gBAAgB;AAAA,IACzC,KAAK;AAGH,aAAO,QAAQ,YAAY,KAAK,UAAU,QAAQ,WAAW,UAAU,CAAC,CAAC;AAAA,IAC3E,KAAK;AACH,aAAO,KAAK,UAAU,QAAQ,SAAS,CAAC,CAAC;AAAA,IAC3C,KAAK;AACH,aAAO,KAAK,UAAU,QAAQ,OAAO,CAAC,CAAC;AAAA,IACzC,KAAK;AACH,aAAO,KAAK,UAAU,QAAQ,SAAS,CAAC,CAAC;AAAA,IAC3C,KAAK;AACH,aAAO,KAAK,UAAU,QAAQ,aAAa,CAAC,CAAC;AAAA,IAC/C,KAAK;AACH,aAAO,cAAc,OAAO;AAAA,IAC9B,KAAK;AACH,UAAI,CAAC,QAAQ;AACX,cAAM,IAAI,YAAY,2DAA2D;AAAA,MACnF;AACA,aAAO,OAAO;AAAA,IAChB,KAAK;AACH,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,EACJ;AACF;AAQA,SAAS,2BACP,gBAC4E;AAC5E,QAAM,MAAM;AACZ,SAAO,OAAO,UAAU;AACtB,UAAM,WAMD,CAAC;AACN,eAAW,aAAa,MAAM,YAAY;AACxC,iBAAW,WAAW,UAAU,SAAS,OAAO;AAC9C,cAAM,OAAO;AACb,cAAM,WAAW,OAAO,KAAK,cAAc,SAAS;AACpD,cAAM,QAAQ,OAAO,KAAK,UAAU,WAAW,KAAK,QAAQ;AAC5D,cAAM,cACJ,KAAK,eAAe,OAAO,KAAK,gBAAgB,WAC5C,OAAO;AAAA,UACL,KAAK;AAAA,QACP,IACA,CAAC;AACP,cAAM,YACJ,YAAY,WAAW,IACnB,IACA,YAAY,OAAO,CAAC,KAAK,MAAM,OAAO,EAAE,aAAa,IAAI,CAAC,IAAI,YAAY;AAChF,YAAI,CAAC,SAAS,aAAa,MAAO;AAClC,cAAM,QAAQ,YACX,IAAI,CAAC,MAAM,EAAE,KAAK,EAClB,OAAO,CAAC,MAAmB,OAAO,MAAM,YAAY,EAAE,SAAS,CAAC,EAChE,KAAK,IAAI,EACT,MAAM,GAAG,GAAG;AACf,cAAM,QAAQ,UAAU,QAAQ,YAAY,QAAQ,YAAY,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK;AACxF,iBAAS,KAAK;AAAA,UACZ;AAAA,UACA,WAAW,OAAO,UAAU,QAAQ,CAAC,CAAC;AAAA,UACtC;AAAA,UACA,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC;AAAA,UACzB,GAAI,QAAQ,EAAE,OAAO,MAAM,MAAM,GAAG,GAAG,EAAE,IAAI,CAAC;AAAA,QAChD,CAAC;AAAA,MACH;AAAA,IACF;AACA,QAAI,SAAS,WAAW,EAAG,QAAO;AAClC,aAAS,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;AACjD,WAAO,SAAS,MAAM,GAAG,GAAG;AAAA,EAC9B;AACF;AAKA,SAAS,0BACP,gBAC4E;AAC5E,QAAM,kBAAkB,2BAAiD,cAAc;AACvF,SAAO,OAAO,UAAU;AACtB,UAAM,QAAQ,MAAM,gBAAgB,KAAK;AACzC,WAAO,UAAU,iBAAiB,iBAAiB,CAAC,GAAG,gBAAgB,GAAG,KAAK;AAAA,EACjF;AACF;AAQA,SAAS,cAAc,SAA6D;AAClF,SAAO,OAAO,YAAY,YAAY,YAAY,QAAQ,QAAQ,SAAS;AAC7E;AAGA,eAAe,eACb,MACA,kBAC0B;AAC1B,QAAM,UAAU,KAAK,WAAW;AAChC,QAAM,WAAW,mBAAmB;AAAA,IAClC,UAAU,KAAK;AAAA,IACf,GAAI,KAAK,cAAc,EAAE,aAAa,KAAK,YAAY,IAAI,CAAC;AAAA,EAC9D,CAAC;AACD,QAAM,mBAAmB,MAAM,SAAS,OAAO,EAAE,SAAS,OAAO,qBAAqB,CAAC;AACvF,QAAM,WAAW,MAAM,SAAS,SAAS,kBAAkB,yBAAyB;AACpF,MAAI;AACJ,MAAI,CAAC,kBAAkB;AACrB,UAAM,YACJ,KAAK,aACL,iBAAiB;AAAA,MACf,GAAI,KAAK,UAAU,EAAE,SAAS,KAAK,QAAQ,IAAI,CAAC;AAAA,MAChD,GAAI,KAAK,SAAS,EAAE,QAAQ,KAAK,OAAO,IAAI,CAAC;AAAA,MAC7C,GAAI,KAAK,YAAY,EAAE,WAAW,KAAK,UAAU,IAAI,CAAC;AAAA,IACxD,CAAC;AACH,cAAU,kBAAkB,EAAE,UAAU,WAAW,QAAQ,CAAC;AAAA,EAC9D;AACA,QAAM,WAAW,oBAAoB;AACrC,MAAI,CAAC,UAAU;AACb,UAAM,IAAI,YAAY,8DAA8D;AAAA,EACtF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,MAAM,QAAQ,gBAAgB;AAC5B,YAAM,SAAoB,CAAC;AAC3B,UAAI;AACF,cAAM,SAAS,QAAQ,cAAc,cAAc,IAAI,CAAC,eAAe,WAAW,IAAI,CAAC,CAAC;AAAA,MAC1F,SAAS,OAAO;AACd,eAAO,KAAK,KAAK;AAAA,MACnB;AACA,UAAI;AACF,cAAM,SAAS,QAAQ,gBAAgB;AAAA,MACzC,SAAS,OAAO;AACd,eAAO,KAAK,KAAK;AAAA,MACnB;AACA,UAAI,OAAO,SAAS,GAAG;AACrB,cAAM,IAAI,eAAe,QAAQ,uDAAuD;AAAA,MAC1F;AAAA,IACF;AAAA,EACF;AACF;AAKA,SAAS,gBAAmB,QAAgB,SAA4B;AACtE,MAAI;AACF,WAAO,KAAK,MAAM,MAAM;AAAA,EAC1B,SAAS,OAAO;AACd,UAAM,IAAI;AAAA,MACR,2BAA2B,OAAO,4EAC/B,MAAgB,OACnB;AAAA,IACF;AAAA,EACF;AACF;AAIO,SAAS,gCACd,SACA,SACA,QACc;AAKd,MAAI,OAAO,WAAW,SAAU,QAAO;AACvC,MAAI;AACJ,UAAQ,SAAS;AAAA,IACf,KAAK;AACH,kBAAY,EAAE,GAAG,SAAS,QAAQ,EAAE,GAAG,QAAQ,QAAQ,cAAc,OAAO,EAAE;AAC9E;AAAA,IACF,KAAK;AACH,kBAAY;AAAA,QACV,GAAG;AAAA,QACH,WAAW,EAAE,GAAG,QAAQ,WAAW,QAAQ,gBAAgB,QAAQ,OAAO,EAAE;AAAA,MAC9E;AACA;AAAA,IACF,KAAK;AACH,kBAAY,EAAE,GAAG,SAAS,OAAO,gBAAgB,QAAQ,OAAO,EAAE;AAClE;AAAA,IACF,KAAK;AACH,kBAAY,EAAE,GAAG,SAAS,KAAK,gBAAgB,QAAQ,OAAO,EAAE;AAChE;AAAA,IACF,KAAK;AACH,kBAAY,EAAE,GAAG,SAAS,OAAO,gBAAgB,QAAQ,OAAO,EAAE;AAClE;AAAA,IACF,KAAK;AACH,kBAAY,EAAE,GAAG,SAAS,WAAW,gBAAgB,QAAQ,OAAO,EAAE;AACtE;AAAA,IACF,KAAK;AACH,kBAAY,gBAAgB,QAAQ,OAAO;AAC3C;AAAA,IACF,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,EACX;AACA,QAAM,SAAS,mBAAmB,UAAU,SAAS;AACrD,MAAI,CAAC,OAAO,SAAS;AACnB,UAAM,IAAI;AAAA,MACR,2BAA2B,OAAO,mDAAmD,OAAO,MAAM,OAAO;AAAA,IAC3G;AAAA,EACF;AACA,SAAO,OAAO;AAChB;AAeA,eAAsB,QACpB,SACA,UACA,MAC8C;AAC9C,QAAM;AAAA,IACJ,UAAU;AAAA,IACV,OAAO;AAAA,IACP;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,GAAG;AAAA,EACL,IAAI;AAEJ,QAAM,gBAAgB,mBAAmB,UAAU,OAAO;AAC1D,MAAI,CAAC,cAAc,SAAS;AAC1B,UAAM,IAAI;AAAA,MACR,iDAAiD,cAAc,MAAM,OAAO;AAAA,IAC9E;AAAA,EACF;AACA,MAAI,YAAY,YAAY,CAAC,aAAa,CAAC,QAAQ;AACjD,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACA,MAAI,YAAY,YAAY,CAAC,QAAQ;AACnC,UAAM,IAAI,YAAY,2DAA2D;AAAA,EACnF;AACA,QAAM,sBAAsB,CAAC,cAAc,YAAY,YAAY,YAAY;AAC/E,MAAI,qBAAqB;AACvB,uBAAmB,cAAc,KAAK,SAAS,wBAAwB,aAAa;AAAA,EACtF;AAEA,MAAI;AACJ,MAAI,YAAY,QAAQ;AACtB,QAAI,CAAC,MAAM;AACT,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AACA,mBAAe,MAAM,eAAe,MAAM,SAAS;AAAA,EACrD;AACA,QAAM,WACJ,cAAc,YAAY,aAAa,oBAAoB,SAAS,cAAc,GAAG;AACvF,MAAI,CAAC,UAAU;AACb,UAAM,IAAI;AAAA,MACR,uBAAuB,OAAO;AAAA,IAChC;AAAA,EACF;AAEA,QAAM,SACJ,SAAS,SAAS,EAAE,GAAG,cAAc,QAAQ,aAAa,EAAE,IAAI,EAAE,GAAG,cAAc,OAAO;AAE5F,MAAI;AACJ,MAAI;AACF,UAAM,MAAM,YAAkC;AAAA,MAC5C,GAAG;AAAA,MACH,iBACE,cAAc,YAAY,mBAAmB,SAAS,SAAS,QAAQ,MAAM;AAAA,MAC/E;AAAA,MACA;AAAA,MACA;AAAA,MACA,GAAI,kBAAkB,SAAY,EAAE,MAAM,cAAc,IAAI,CAAC;AAAA,MAC7D,GAAI,sBAAsB,OACtB,CAAC,IACD;AAAA,QACE,mBACE,sBACC,kBACG,kBAAwC,EAAE,kBAAkB,SAAS,CAAC,IACtE,YAAY,WACV,0BAAgD,QAAQ,IACxD,2BAAiD,QAAQ;AAAA,MACnE;AAAA,IACN,CAAC;AAAA,EACH,SAAS,OAAO;AACd,QAAI,CAAC,aAAc,OAAM;AACzB,QAAI;AACF,YAAM,aAAa,QAAQ;AAAA,IAC7B,SAAS,cAAc;AACrB,YAAM,IAAI;AAAA,QACR,CAAC,OAAO,YAAY;AAAA,QACpB;AAAA,MACF;AAAA,IACF;AACA,UAAM;AAAA,EACR;AAEA,QAAM,UAAU,IAAI,iBAAiB;AACrC,QAAM,gBAAgB,IAAI,OAAO;AACjC,QAAM,cAAc,QAAQ,UAAU,gBAAgB,MAAS;AAI/D,QAAM,mBACJ,YAAY,YAAY,SAAS,SAAS,YAAY,YAAY,SAAS,SAAS;AACtF,MAAI,WAAW,kBAAkB;AAC/B,QAAI,OAAO,kBAAkB,UAAU;AACrC,YAAM,IAAI;AAAA,QACR,2BAA2B,OAAO;AAAA,MACpC;AAAA,IACF;AACA,UAAM,iBAAiB,YAAY,aAAa;AAAA,EAClD;AACA,QAAM,cACJ,WAAW,CAAC,mBACR,gCAAgC,SAAS,SAAS,aAAa,IAC/D;AAEN,SAAO,EAAE,SAAS,aAAa,SAAS,MAAM,IAAI,MAAM,cAAc,IAAI,cAAc,IAAI;AAC9F;","names":[]}