@tangle-network/agent-runtime 0.93.2 → 0.94.0

package/dist/chunk-WGR6QJ5H.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/improvement/improvement-driver.ts","../src/improvement/raw-trace-distiller.ts","../src/improvement/rollout-policy.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 * `rolloutPolicyProposer` — the `'rollout-policy'` surface for `improve()`: the\n * inference-time `StructuralRolloutPolicy` dials { k, repairRounds, testgen } as a\n * held-out-gated optimizable surface.\n *\n * Why this seam: agent-eval's loop contract is already generic — `MutableSurface`\n * admits any string, documented as \"serialized tool config\" — so the policy rides\n * the SAME serialize→propose→gate→parse-back cycle the tools/mcp/hooks surfaces\n * use. No agent-eval changes; the only net-new piece is this proposer.\n *\n * Why deterministic: prompt-wording proposals are a measured zero on this stack,\n * and the policy space is tiny and fully enumerable. The proposer emits bounded\n * single-dial neighbors (k±2 in [1,10], repairRounds±1 in [0,3], testgen±3 in\n * [0,10], ≤4 per generation) and lets the held-out gate do ALL the deciding — an\n * LLM proposer would add cost and nondeterminism with nothing to reason about.\n *\n * Persistence: the policy lives in `profile.extensions['structural-rollout']`\n * (AgentProfile's designed slot for runtime-specific config). A gated winner is\n * written back there by `improve()`, the same profile-field write-back every other\n * config surface gets; `structuralRolloutPolicyFromProfile` is the read side a\n * runtime caller feeds to `structuralRollout({ policy })`.\n *\n * @experimental\n */\n\nimport type {\n  MutableSurface,\n  ProposeContext,\n  ProposedCandidate,\n  SurfaceProposer,\n} from '@tangle-network/agent-eval/campaign'\nimport type { AgentProfile } from '@tangle-network/agent-interface'\nimport {\n  defaultStructuralRolloutPolicy,\n  type StructuralRolloutPolicy,\n} from '../runtime/structural-rollout'\n\n/** The profile extensions namespace the policy persists under. */\nexport const ROLLOUT_POLICY_EXTENSION = 'structural-rollout'\n\n/** Proposal bounds per dial. These are the SEARCH bounds (what the proposer may\n *  explore), chosen so every reachable value is a measured-sane recipe: k=1 is the\n *  low-compute preset, testgen=0 disables check authoring, repairRounds caps where\n *  the measured increment flattens (+1–3pp beyond round 2). */\nexport const ROLLOUT_POLICY_BOUNDS = {\n  k: { min: 1, max: 10, step: 2 },\n  repairRounds: { min: 0, max: 3, step: 1 },\n  testgen: { min: 0, max: 10, step: 3 },\n} as const\n\n/** Max candidates per generation — the search space is 3 dials, so a small\n *  neighborhood per generation converges without burning gate budget. */\nconst MAX_CANDIDATES_PER_GENERATION = 4\n\nconst clamp = (v: number, min: number, max: number) => Math.min(max, Math.max(min, v))\n\nconst isBoundedInt = (v: unknown, min: number): v is number =>\n  typeof v === 'number' && Number.isInteger(v) && v >= min\n\n/** Parse a serialized policy surface. Defensive by design — the proposer reads\n *  `ctx.currentSurface`, which the loop types as `string | CodeSurface`. Returns\n *  `undefined` (never throws) for non-strings, malformed JSON, or a shape that\n *  violates the policy's own invariants: the no-op signal. Unknown dials are\n *  dropped; `diverse`/`temperature` ride through untouched (the proposer never\n *  mutates them — `diverse` is a measured paired null). */\nexport function parseRolloutPolicy(surface: MutableSurface): StructuralRolloutPolicy | undefined {\n  if (typeof surface !== 'string' || surface.trim().length === 0) return undefined\n  let raw: unknown\n  try {\n    raw = JSON.parse(surface)\n  } catch {\n    return undefined\n  }\n  return normalizeRolloutPolicy(raw)\n}\n\n/** Normalize an untyped policy bag (a parsed surface or a profile extension) into\n *  a full `StructuralRolloutPolicy`, defaults merged. Returns `undefined` when any\n *  present dial violates the policy invariants (mirrors `resolvePolicy`: integer\n *  k ≥ 1, repairRounds ≥ 0, testgen ≥ 0) — a corrupt config must read as \"not\n *  configured\", never as a fabricated recipe. */\nexport function normalizeRolloutPolicy(raw: unknown): StructuralRolloutPolicy | undefined {\n  if (typeof raw !== 'object' || raw === null || Array.isArray(raw)) return undefined\n  const bag = raw as Record<string, unknown>\n  const k = bag.k ?? defaultStructuralRolloutPolicy.k\n  const repairRounds = bag.repairRounds ?? defaultStructuralRolloutPolicy.repairRounds\n  const testgen = bag.testgen ?? defaultStructuralRolloutPolicy.testgen\n  if (!isBoundedInt(k, 1) || !isBoundedInt(repairRounds, 0) || !isBoundedInt(testgen, 0)) {\n    return undefined\n  }\n  return {\n    k,\n    repairRounds,\n    testgen,\n    ...(typeof bag.diverse === 'boolean' ? { diverse: bag.diverse } : {}),\n    ...(typeof bag.temperature === 'number' ? { temperature: bag.temperature } : {}),\n  }\n}\n\n/** Stable serialization — dial order is fixed so identical policies produce\n *  identical surfaces (the loop dedupes/hashes candidates by surface content). */\nexport function serializeRolloutPolicy(policy: StructuralRolloutPolicy): string {\n  return JSON.stringify({\n    k: policy.k,\n    repairRounds: policy.repairRounds,\n    testgen: policy.testgen,\n    ...(policy.diverse !== undefined ? { diverse: policy.diverse } : {}),\n    ...(policy.temperature !== undefined ? { temperature: policy.temperature } : {}),\n  })\n}\n\n/** Read the persisted policy off the profile. `undefined` when the profile does\n *  not opt into structural rollout — the improve() surface no-ops then, because\n *  tuning dials nothing consumes would ship dead config. */\nexport function structuralRolloutPolicyFromProfile(\n  profile: AgentProfile,\n): StructuralRolloutPolicy | undefined {\n  const bag = profile.extensions?.[ROLLOUT_POLICY_EXTENSION]\n  if (bag === undefined) return undefined\n  return normalizeRolloutPolicy(bag)\n}\n\n/** Persist a policy into the profile's extensions namespace. Shallow copy; never\n *  mutates the input profile (the applyWinnerToProfile contract). */\nexport function applyRolloutPolicyToProfile(\n  profile: AgentProfile,\n  policy: StructuralRolloutPolicy,\n): AgentProfile {\n  const bag: Record<string, unknown> = {\n    k: policy.k,\n    repairRounds: policy.repairRounds,\n    testgen: policy.testgen,\n    ...(policy.diverse !== undefined ? { diverse: policy.diverse } : {}),\n    ...(policy.temperature !== undefined ? { temperature: policy.temperature } : {}),\n  }\n  return {\n    ...profile,\n    extensions: { ...profile.extensions, [ROLLOUT_POLICY_EXTENSION]: bag },\n  }\n}\n\n/** All bounded single-dial neighbors of `policy`, in a fixed priority order: k\n *  first (selection breadth carries 85–92% of the measured effect), then\n *  repairRounds, then testgen. Steps clamp to the dial's bounds; clamped-to-no-op\n *  and duplicate policies are dropped. */\nexport function enumerateNeighborPolicies(\n  policy: StructuralRolloutPolicy,\n): StructuralRolloutPolicy[] {\n  const moves: Array<{ dial: 'k' | 'repairRounds' | 'testgen'; delta: 1 | -1 }> = [\n    { dial: 'k', delta: 1 },\n    { dial: 'k', delta: -1 },\n    { dial: 'repairRounds', delta: 1 },\n    { dial: 'repairRounds', delta: -1 },\n    { dial: 'testgen', delta: 1 },\n    { dial: 'testgen', delta: -1 },\n  ]\n  const seen = new Set<string>([serializeRolloutPolicy(policy)])\n  const neighbors: StructuralRolloutPolicy[] = []\n  for (const move of moves) {\n    const bounds = ROLLOUT_POLICY_BOUNDS[move.dial]\n    const next = clamp(policy[move.dial] + move.delta * bounds.step, bounds.min, bounds.max)\n    const candidate: StructuralRolloutPolicy = { ...policy, [move.dial]: next }\n    const key = serializeRolloutPolicy(candidate)\n    if (seen.has(key)) continue\n    seen.add(key)\n    neighbors.push(candidate)\n  }\n  return neighbors\n}\n\nfunction candidateLabel(base: StructuralRolloutPolicy, next: StructuralRolloutPolicy): string {\n  for (const dial of ['k', 'repairRounds', 'testgen'] as const) {\n    if (next[dial] !== base[dial]) return `${dial} ${base[dial]}→${next[dial]}`\n  }\n  return 'unchanged'\n}\n\n/**\n * The deterministic `SurfaceProposer` for the `'rollout-policy'` surface.\n *\n * Each generation: parse the current policy surface, enumerate its bounded\n * single-dial neighbors, and return at most `min(populationSize, 4)` of them,\n * rotating the enumeration window by generation so successive generations explore\n * different neighbors when nothing promoted. Proposes NOTHING when the surface\n * carries no policy (the profile never opted in) — an empty proposal is the\n * loop-native no-op, mirroring `improvementDriver`'s no-findings behavior.\n */\nexport function rolloutPolicyProposer(): SurfaceProposer {\n  return {\n    kind: 'rollout-policy',\n    async propose(ctx: ProposeContext): Promise<ProposedCandidate[]> {\n      const policy = parseRolloutPolicy(ctx.currentSurface)\n      if (!policy) return []\n      const neighbors = enumerateNeighborPolicies(policy)\n      if (neighbors.length === 0) return []\n      const cap = Math.max(1, Math.min(ctx.populationSize, MAX_CANDIDATES_PER_GENERATION))\n      const start = (ctx.generation * cap) % neighbors.length\n      const window: StructuralRolloutPolicy[] = []\n      for (let i = 0; i < Math.min(cap, neighbors.length); i += 1) {\n        window.push(neighbors[(start + i) % neighbors.length] as StructuralRolloutPolicy)\n      }\n      return window.map((candidate) => ({\n        surface: serializeRolloutPolicy(candidate),\n        label: candidateLabel(policy, candidate),\n        rationale:\n          'bounded single-dial neighbor of the current structuralRollout policy; ' +\n          'the held-out gate decides (deterministic enumeration — the dial space is tiny ' +\n          'and prompt-style reflective proposals are a measured zero here)',\n      }))\n    },\n  }\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: 'rollout-policy'` → `rolloutPolicyProposer` mutates the\n *     inference-time `StructuralRolloutPolicy` dials ({ k, repairRounds, testgen })\n *     persisted in `profile.extensions['structural-rollout']` — deterministic\n *     bounded neighbor enumeration; the held-out gate does the deciding. No-op\n *     (nothing proposed, nothing shipped) when the profile has no such extension.\n *   - `surface` ∈ {`tools`, `mcp`, `hooks`, `subagents`, `workflow`, `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 {\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'\nimport {\n  applyRolloutPolicyToProfile,\n  normalizeRolloutPolicy,\n  rolloutPolicyProposer,\n  serializeRolloutPolicy,\n  structuralRolloutPolicyFromProfile,\n} from './rollout-policy'\n\n/** The agent-profile lever `improve` optimizes. Mirrors the AgentProfile-law\n *  profile levers; `code` is the implementation-tier surface, `rollout-policy`\n *  the inference-time structuralRollout dials\n *  (`profile.extensions['structural-rollout']`). */\nexport type ImproveSurface =\n  | 'prompt'\n  | 'skills'\n  | 'tools'\n  | 'mcp'\n  | 'hooks'\n  | 'subagents'\n  | 'workflow'\n  | 'agent-profile'\n  | 'memory'\n  | 'code'\n  | 'rollout-policy'\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, memory, and rollout policy; 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'\nconst workflowExtension = 'tangle.workflow'\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    case 'rollout-policy':\n      // Deterministic bounded enumeration — no LLM, so `llm` is unused here.\n      return rolloutPolicyProposer()\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 'workflow':\n      return JSON.stringify(profile.extensions?.[workflowExtension] ?? {})\n    case 'agent-profile':\n      return JSON.stringify(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 'rollout-policy': {\n      // Empty surface when the profile never opted into structural rollout: the\n      // proposer reads it as \"propose nothing\", so the loop runs baseline-only and\n      // holds — tuning dials nothing consumes would ship dead config.\n      const policy = structuralRolloutPolicyFromProfile(profile)\n      return policy ? serializeRolloutPolicy(policy) : ''\n    }\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 (`skills`/`tools`/`mcp`/`hooks`/`subagents`/`workflow`/`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. */\nfunction applyWinnerToProfile(\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 'workflow':\n      candidate = {\n        ...profile,\n        extensions: {\n          ...profile.extensions,\n          [workflowExtension]: parseWinnerJson(winner, surface),\n        },\n      }\n      break\n    case 'agent-profile':\n      candidate = parseWinnerJson(winner, surface)\n      break\n    case 'memory':\n      return profile\n    case 'rollout-policy': {\n      // Parse + re-validate the winner against the policy's own invariants — a\n      // custom generator's malformed dial must fail loud, not persist silently.\n      const policy = normalizeRolloutPolicy(parseWinnerJson(winner, surface))\n      if (!policy) {\n        throw new ConfigError(\n          `improve(): the shipped 'rollout-policy' winner is not a valid StructuralRolloutPolicy ` +\n            `(integer k >= 1, repairRounds >= 0, testgen >= 0), so it cannot be applied: ${winner}`,\n        )\n      }\n      candidate = applyRolloutPolicyToProfile(profile, policy)\n      break\n    }\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 ? applyWinnerToProfile(profile, surface, winnerSurface) : 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;;;ACtSO,IAAM,2BAA2B;AAMjC,IAAM,wBAAwB;AAAA,EACnC,GAAG,EAAE,KAAK,GAAG,KAAK,IAAI,MAAM,EAAE;AAAA,EAC9B,cAAc,EAAE,KAAK,GAAG,KAAK,GAAG,MAAM,EAAE;AAAA,EACxC,SAAS,EAAE,KAAK,GAAG,KAAK,IAAI,MAAM,EAAE;AACtC;AAIA,IAAM,gCAAgC;AAEtC,IAAM,QAAQ,CAAC,GAAW,KAAa,QAAgB,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,CAAC,CAAC;AAErF,IAAM,eAAe,CAAC,GAAY,QAChC,OAAO,MAAM,YAAY,OAAO,UAAU,CAAC,KAAK,KAAK;AAQhD,SAAS,mBAAmB,SAA8D;AAC/F,MAAI,OAAO,YAAY,YAAY,QAAQ,KAAK,EAAE,WAAW,EAAG,QAAO;AACvE,MAAI;AACJ,MAAI;AACF,UAAM,KAAK,MAAM,OAAO;AAAA,EAC1B,QAAQ;AACN,WAAO;AAAA,EACT;AACA,SAAO,uBAAuB,GAAG;AACnC;AAOO,SAAS,uBAAuB,KAAmD;AACxF,MAAI,OAAO,QAAQ,YAAY,QAAQ,QAAQ,MAAM,QAAQ,GAAG,EAAG,QAAO;AAC1E,QAAM,MAAM;AACZ,QAAM,IAAI,IAAI,KAAK,+BAA+B;AAClD,QAAM,eAAe,IAAI,gBAAgB,+BAA+B;AACxE,QAAM,UAAU,IAAI,WAAW,+BAA+B;AAC9D,MAAI,CAAC,aAAa,GAAG,CAAC,KAAK,CAAC,aAAa,cAAc,CAAC,KAAK,CAAC,aAAa,SAAS,CAAC,GAAG;AACtF,WAAO;AAAA,EACT;AACA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,GAAI,OAAO,IAAI,YAAY,YAAY,EAAE,SAAS,IAAI,QAAQ,IAAI,CAAC;AAAA,IACnE,GAAI,OAAO,IAAI,gBAAgB,WAAW,EAAE,aAAa,IAAI,YAAY,IAAI,CAAC;AAAA,EAChF;AACF;AAIO,SAAS,uBAAuB,QAAyC;AAC9E,SAAO,KAAK,UAAU;AAAA,IACpB,GAAG,OAAO;AAAA,IACV,cAAc,OAAO;AAAA,IACrB,SAAS,OAAO;AAAA,IAChB,GAAI,OAAO,YAAY,SAAY,EAAE,SAAS,OAAO,QAAQ,IAAI,CAAC;AAAA,IAClE,GAAI,OAAO,gBAAgB,SAAY,EAAE,aAAa,OAAO,YAAY,IAAI,CAAC;AAAA,EAChF,CAAC;AACH;AAKO,SAAS,mCACd,SACqC;AACrC,QAAM,MAAM,QAAQ,aAAa,wBAAwB;AACzD,MAAI,QAAQ,OAAW,QAAO;AAC9B,SAAO,uBAAuB,GAAG;AACnC;AAIO,SAAS,4BACd,SACA,QACc;AACd,QAAM,MAA+B;AAAA,IACnC,GAAG,OAAO;AAAA,IACV,cAAc,OAAO;AAAA,IACrB,SAAS,OAAO;AAAA,IAChB,GAAI,OAAO,YAAY,SAAY,EAAE,SAAS,OAAO,QAAQ,IAAI,CAAC;AAAA,IAClE,GAAI,OAAO,gBAAgB,SAAY,EAAE,aAAa,OAAO,YAAY,IAAI,CAAC;AAAA,EAChF;AACA,SAAO;AAAA,IACL,GAAG;AAAA,IACH,YAAY,EAAE,GAAG,QAAQ,YAAY,CAAC,wBAAwB,GAAG,IAAI;AAAA,EACvE;AACF;AAMO,SAAS,0BACd,QAC2B;AAC3B,QAAM,QAA0E;AAAA,IAC9E,EAAE,MAAM,KAAK,OAAO,EAAE;AAAA,IACtB,EAAE,MAAM,KAAK,OAAO,GAAG;AAAA,IACvB,EAAE,MAAM,gBAAgB,OAAO,EAAE;AAAA,IACjC,EAAE,MAAM,gBAAgB,OAAO,GAAG;AAAA,IAClC,EAAE,MAAM,WAAW,OAAO,EAAE;AAAA,IAC5B,EAAE,MAAM,WAAW,OAAO,GAAG;AAAA,EAC/B;AACA,QAAM,OAAO,oBAAI,IAAY,CAAC,uBAAuB,MAAM,CAAC,CAAC;AAC7D,QAAM,YAAuC,CAAC;AAC9C,aAAW,QAAQ,OAAO;AACxB,UAAM,SAAS,sBAAsB,KAAK,IAAI;AAC9C,UAAM,OAAO,MAAM,OAAO,KAAK,IAAI,IAAI,KAAK,QAAQ,OAAO,MAAM,OAAO,KAAK,OAAO,GAAG;AACvF,UAAM,YAAqC,EAAE,GAAG,QAAQ,CAAC,KAAK,IAAI,GAAG,KAAK;AAC1E,UAAM,MAAM,uBAAuB,SAAS;AAC5C,QAAI,KAAK,IAAI,GAAG,EAAG;AACnB,SAAK,IAAI,GAAG;AACZ,cAAU,KAAK,SAAS;AAAA,EAC1B;AACA,SAAO;AACT;AAEA,SAAS,eAAe,MAA+B,MAAuC;AAC5F,aAAW,QAAQ,CAAC,KAAK,gBAAgB,SAAS,GAAY;AAC5D,QAAI,KAAK,IAAI,MAAM,KAAK,IAAI,EAAG,QAAO,GAAG,IAAI,IAAI,KAAK,IAAI,CAAC,SAAI,KAAK,IAAI,CAAC;AAAA,EAC3E;AACA,SAAO;AACT;AAYO,SAAS,wBAAyC;AACvD,SAAO;AAAA,IACL,MAAM;AAAA,IACN,MAAM,QAAQ,KAAmD;AAC/D,YAAM,SAAS,mBAAmB,IAAI,cAAc;AACpD,UAAI,CAAC,OAAQ,QAAO,CAAC;AACrB,YAAM,YAAY,0BAA0B,MAAM;AAClD,UAAI,UAAU,WAAW,EAAG,QAAO,CAAC;AACpC,YAAM,MAAM,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,gBAAgB,6BAA6B,CAAC;AACnF,YAAM,QAAS,IAAI,aAAa,MAAO,UAAU;AACjD,YAAM,SAAoC,CAAC;AAC3C,eAAS,IAAI,GAAG,IAAI,KAAK,IAAI,KAAK,UAAU,MAAM,GAAG,KAAK,GAAG;AAC3D,eAAO,KAAK,WAAW,QAAQ,KAAK,UAAU,MAAM,CAA4B;AAAA,MAClF;AACA,aAAO,OAAO,IAAI,CAAC,eAAe;AAAA,QAChC,SAAS,uBAAuB,SAAS;AAAA,QACzC,OAAO,eAAe,QAAQ,SAAS;AAAA,QACvC,WACE;AAAA,MAGJ,EAAE;AAAA,IACJ;AAAA,EACF;AACF;;;AC9KA;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP;AAAA,EASE;AAAA,OACK;AACP,SAA4B,0BAA0B;AAmJtD,IAAM,yBAAyB;AAC/B,IAAM,oBAAoB;AAI1B,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,KAAK;AAEH,aAAO,sBAAsB;AAAA,IAC/B;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,KAAK,UAAU,QAAQ,aAAa,iBAAiB,KAAK,CAAC,CAAC;AAAA,IACrE,KAAK;AACH,aAAO,KAAK,UAAU,OAAO;AAAA,IAC/B,KAAK;AACH,UAAI,CAAC,QAAQ;AACX,cAAM,IAAI,YAAY,2DAA2D;AAAA,MACnF;AACA,aAAO,OAAO;AAAA,IAChB,KAAK,kBAAkB;AAIrB,YAAM,SAAS,mCAAmC,OAAO;AACzD,aAAO,SAAS,uBAAuB,MAAM,IAAI;AAAA,IACnD;AAAA,IACA,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;AAIA,SAAS,qBACP,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;AAAA,QACV,GAAG;AAAA,QACH,YAAY;AAAA,UACV,GAAG,QAAQ;AAAA,UACX,CAAC,iBAAiB,GAAG,gBAAgB,QAAQ,OAAO;AAAA,QACtD;AAAA,MACF;AACA;AAAA,IACF,KAAK;AACH,kBAAY,gBAAgB,QAAQ,OAAO;AAC3C;AAAA,IACF,KAAK;AACH,aAAO;AAAA,IACT,KAAK,kBAAkB;AAGrB,YAAM,SAAS,uBAAuB,gBAAgB,QAAQ,OAAO,CAAC;AACtE,UAAI,CAAC,QAAQ;AACX,cAAM,IAAI;AAAA,UACR,qKACiF,MAAM;AAAA,QACzF;AAAA,MACF;AACA,kBAAY,4BAA4B,SAAS,MAAM;AACvD;AAAA,IACF;AAAA,IACA,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,mBAAmB,qBAAqB,SAAS,SAAS,aAAa,IAAI;AAEzF,SAAO,EAAE,SAAS,aAAa,SAAS,MAAM,IAAI,MAAM,cAAc,IAAI,cAAc,IAAI;AAC9F;","names":[]}

package/dist/chunk-XDSWWUKE.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/candidate-execution/builder.ts","../src/candidate-execution/claim-file-store.ts","../src/candidate-execution/dispose.ts","../src/candidate-execution/protected-model-port.ts","../src/candidate-execution/recover.ts"],"sourcesContent":["import type { CodeSurface } from '@tangle-network/agent-eval/campaign'\nimport { verifyCodeSurface } from '@tangle-network/agent-eval/campaign'\nimport type {\n  AgentCandidateCodeDisabled,\n  AgentCandidateCodeNoOp,\n  AgentCandidateExecution,\n  AgentCandidateGitHubRepository,\n  AgentCandidateKnowledge,\n  AgentCandidateLineage,\n  AgentCandidateMemoryPolicy,\n  AgentCandidateProfile,\n  AgentProfile,\n  AgentProfileDiff,\n} from '@tangle-network/agent-interface'\nimport { agentProfileDiffSchema, applyAgentProfileDiff } from '@tangle-network/agent-interface'\n\nimport { type AgentCandidateBundleInput, sealAgentCandidateBundle } from './bundle'\nimport {\n  canonicalCandidateBytes,\n  canonicalCandidateDigest,\n  embeddedCandidateArtifact,\n} from './digest'\nimport {\n  freezeGenericAgentCandidateProfile,\n  parseExactAgentProfile,\n  parseExactCandidateProfile,\n} from './profile'\n\n/** A complete profile that can be frozen without losing behavior. */\nexport type AgentCandidateProfileSource =\n  | {\n      kind: 'profile'\n      profile: AgentProfile\n    }\n  | {\n      kind: 'profile-diffs'\n      base: AgentProfile\n      /** Applied in order. Each exact diff is content-addressed into lineage. */\n      diffs: readonly AgentProfileDiff[]\n    }\n  | {\n      kind: 'candidate-profile'\n      /** Already converted to the closed, secret-free candidate profile contract. */\n      profile: AgentCandidateProfile\n    }\n\n/** The only accepted path from an agent-eval code candidate to executable bytes. */\nexport interface AgentCandidateCodeSurfaceSource {\n  kind: 'code-surface'\n  surface: CodeSurface\n  repository: AgentCandidateGitHubRepository\n  /** Optional parent directory used to resolve a relative `surface.worktreeRef`. */\n  worktreeDir?: string\n}\n\n/** Explicit control/no-op code or one finalized CodeSurface whose bytes must still verify. */\nexport type AgentCandidateCodeSource =\n  | AgentCandidateCodeDisabled\n  | AgentCandidateCodeNoOp\n  | AgentCandidateCodeSurfaceSource\n\n/** Complete measured surfaces and execution policy compiled into one candidate bundle. */\nexport interface BuildAgentCandidateBundleInput {\n  profile: AgentCandidateProfileSource\n  code: AgentCandidateCodeSource\n  execution: AgentCandidateExecution\n  knowledge?: AgentCandidateKnowledge\n  memory: AgentCandidateMemoryPolicy\n  /** `profileDiffIds` is derived from `profile`; callers cannot contradict it. */\n  lineage: Omit<AgentCandidateLineage, 'profileDiffIds'>\n}\n\n/**\n * Compile one measured profile/code candidate into the immutable execution\n * contract. Code bytes are re-read and verified by agent-eval before they are\n * embedded. The returned bundle is schema-validated, canonically digested, and\n * deeply immutable; call `verifyAgentCandidateBundle` at the execution boundary\n * to re-read external knowledge, memory, repository, and workspace artifacts.\n */\nexport function buildAgentCandidateBundle(\n  input: BuildAgentCandidateBundleInput,\n): ReturnType<typeof sealAgentCandidateBundle> {\n  if (Object.hasOwn(input.lineage, 'profileDiffIds')) {\n    throw new Error('profileDiffIds is derived from the profile source and cannot be supplied')\n  }\n  const compiledProfile = compileCandidateProfile(input.profile)\n  const profileDiffIds = compiledProfile.profileDiffIds\n  const bundle: AgentCandidateBundleInput = {\n    schemaVersion: 1,\n    kind: 'agent-candidate-bundle',\n    digestAlgorithm: 'rfc8785-sha256',\n    profile: compiledProfile.profile,\n    code: compileCandidateCode(input.code),\n    execution: input.execution,\n    ...(input.knowledge ? { knowledge: input.knowledge } : {}),\n    memory: input.memory,\n    lineage: {\n      ...input.lineage,\n      ...(profileDiffIds.length > 0 ? { profileDiffIds } : {}),\n    },\n  }\n  return sealAgentCandidateBundle(bundle)\n}\n\nfunction compileCandidateProfile(source: AgentCandidateProfileSource): {\n  profile: AgentCandidateProfile\n  profileDiffIds: string[]\n} {\n  if (source.kind === 'candidate-profile') {\n    return {\n      profile: parseExactCandidateProfile(source.profile),\n      profileDiffIds: [],\n    }\n  }\n\n  if (source.kind === 'profile') {\n    return { profile: freezeGenericAgentCandidateProfile(source.profile), profileDiffIds: [] }\n  }\n\n  if (source.kind !== 'profile-diffs') {\n    throw new Error(\n      `unsupported candidate profile source: ${String((source as { kind?: unknown }).kind)}`,\n    )\n  }\n  if (source.diffs.length === 0) {\n    throw new Error('profile-diffs source requires at least one AgentProfileDiff')\n  }\n  let profile = parseExactAgentProfile(source.base, 'base profile')\n  const profileDiffIds: string[] = []\n  for (const [index, inputDiff] of source.diffs.entries()) {\n    const diff = parseExactProfileDiff(inputDiff, index)\n    profile = omitUndefinedObjectFields(applyAgentProfileDiff(profile, diff)) as AgentProfile\n    profileDiffIds.push(canonicalCandidateDigest(diff))\n  }\n  return { profile: freezeGenericAgentCandidateProfile(profile), profileDiffIds }\n}\n\nfunction compileCandidateCode(source: AgentCandidateCodeSource): AgentCandidateBundleInput['code'] {\n  if (source.kind === 'disabled' || source.kind === 'no-op') return source\n  if (source.kind !== 'code-surface') {\n    throw new Error(\n      `unsupported candidate code source: ${String((source as { kind?: unknown }).kind)}`,\n    )\n  }\n\n  const verified = verifyCodeSurface(source.surface, source.worktreeDir)\n  const patch = embeddedCandidateArtifact(verified.patchBytes)\n  if (\n    patch.sha256 !== source.surface.patch.sha256 ||\n    patch.byteLength !== source.surface.patch.byteLength\n  ) {\n    throw new Error('verified CodeSurface patch bytes do not match its content identity')\n  }\n  return {\n    kind: 'git-patch',\n    repository: source.repository,\n    baseCommit: source.surface.baseCommit,\n    baseTree: source.surface.baseTree,\n    candidateTree: source.surface.candidateTree,\n    patch: { format: 'git-diff-binary', artifact: patch },\n  }\n}\n\nfunction parseExactProfileDiff(input: unknown, index: number): AgentProfileDiff {\n  const parsed = agentProfileDiffSchema.parse(input) as AgentProfileDiff\n  assertCanonicalParse(input, parsed, `profile diff ${index}`)\n  return parsed\n}\n\nfunction assertCanonicalParse(input: unknown, parsed: unknown, label: string): void {\n  if (!Buffer.from(canonicalCandidateBytes(input)).equals(canonicalCandidateBytes(parsed))) {\n    throw new Error(`${label} contains unsupported or non-canonical fields`)\n  }\n}\n\nfunction omitUndefinedObjectFields(value: unknown): unknown {\n  if (Array.isArray(value)) {\n    return value.map((entry, index) => {\n      if (entry === undefined) {\n        throw new Error(`profile diff application produced an undefined array entry at ${index}`)\n      }\n      return omitUndefinedObjectFields(entry)\n    })\n  }\n  if (value === null || typeof value !== 'object') return value\n  return Object.fromEntries(\n    Object.entries(value as Record<string, unknown>)\n      .filter(([, entry]) => entry !== undefined)\n      .map(([key, entry]) => [key, omitUndefinedObjectFields(entry)]),\n  )\n}\n","import { randomUUID } from 'node:crypto'\nimport { linkSync } from 'node:fs'\nimport { mkdir, open, unlink } from 'node:fs/promises'\nimport { join } from 'node:path'\nimport type { Sha256Digest } from '@tangle-network/agent-interface'\n\nimport {\n  type AgentCandidateExecutionAttemptRecord,\n  type AgentCandidateExecutionAttemptRef,\n  type AgentCandidateExecutionClaim,\n  type AgentCandidateExecutionClaimResult,\n  type AgentCandidateExecutionClaimStore,\n  type AgentCandidateExecutionFinishResult,\n  type AgentCandidateExecutionLease,\n  type AgentCandidateExecutionPhase,\n  type AgentCandidateExecutionPhaseResult,\n  type AgentCandidateExecutionRecoveryEvidence,\n  type AgentCandidateExecutionStageResult,\n  type AgentCandidateExecutionTerminalRecord,\n  type AgentCandidateExecutionTerminalResult,\n  type AgentCandidateRetryRejection,\n  candidateClaimFileInternals,\n} from './claim'\nimport {\n  CLAIM_FORMAT_VERSION,\n  PENDING_FORMAT_VERSION,\n  PHASE_FORMAT_VERSION,\n  TERMINAL_FORMAT_VERSION,\n} from './claim-file-formats'\nimport {\n  assertRecoveryMatchesStaged,\n  assertTerminalAllowedInPhase,\n  assertTerminalMatchesClaim,\n  assertTerminalMatchesStaged,\n  recoveredTerminalRecord,\n  rejectedFinish,\n  rejectedStage,\n  requireStagedTerminal,\n  sealTerminalDigest,\n  terminalRecord,\n} from './claim-terminal'\nimport { canonicalCandidateBytes } from './digest'\n\nconst {\n  assertExpiredLease,\n  assertLease,\n  assertSameSlot,\n  assertUnexpiredLease,\n  attemptRecord,\n  claimSlot,\n  leaseDigest,\n  newLease,\n  readClaim,\n  readClaimIfPresent,\n  readTerminal,\n  readTerminalIfPresent,\n  readTransitionIfPresent,\n  rejectedExistingClaim,\n  rejectedRetry,\n  retryRejection,\n  sealAttemptRef,\n  sealClaim,\n  sealLease,\n} = candidateClaimFileInternals\n\nexport interface FileAgentCandidateExecutionClaimStoreOptions {\n  /** Evaluator-owned directory shared by every process allowed to execute candidates. */\n  directory: string\n  /** Testable evaluator clock; defaults to `Date.now`. */\n  now?: () => number\n}\n\n/** Cross-process lifecycle implemented as fsynced, create-if-absent records. */\nexport class FileAgentCandidateExecutionClaimStore implements AgentCandidateExecutionClaimStore {\n  private readonly directory: string\n  private readonly now: () => number\n\n  constructor(options: FileAgentCandidateExecutionClaimStoreOptions) {\n    if (options.directory.length === 0) {\n      throw new Error('candidate execution claim directory must not be empty')\n    }\n    this.directory = options.directory\n    this.now = options.now ?? Date.now\n  }\n\n  async tryClaim(\n    requested: AgentCandidateExecutionClaim,\n  ): Promise<AgentCandidateExecutionClaimResult> {\n    const claim = sealClaim(requested)\n    await mkdir(this.directory, { recursive: true })\n    const claimPath = this.claimPath(claim)\n    const existing = await readClaimIfPresent(claimPath)\n    if (existing) {\n      assertSameSlot(existing.claim, claim, claimPath)\n      return rejectedExistingClaim(existing.claim, claim)\n    }\n    assertUnexpiredLease(claim.leaseExpiresAtMs, this.now())\n    const retryFailure = await this.retryFailure(claim)\n    if (retryFailure) return rejectedRetry(claim, retryFailure)\n\n    const lease = newLease(claim)\n    const acquired = await writeRecordIfAbsent(this.directory, claimPath, {\n      version: CLAIM_FORMAT_VERSION,\n      ...claim,\n      phase: 'claimed',\n      leaseDigest: leaseDigest(lease),\n    })\n    if (acquired) return Object.freeze({ acquired: true, claim, lease })\n\n    const winner = await readClaim(claimPath)\n    assertSameSlot(winner.claim, claim, claimPath)\n    return rejectedExistingClaim(winner.claim, claim)\n  }\n\n  async getAttempt(\n    requestedAttempt: AgentCandidateExecutionAttemptRef,\n  ): Promise<AgentCandidateExecutionAttemptRecord | undefined> {\n    return await this.storedAttempt(sealAttemptRef(requestedAttempt))\n  }\n\n  async markCandidateMayRun(\n    requestedLease: AgentCandidateExecutionLease,\n  ): Promise<AgentCandidateExecutionPhaseResult> {\n    const lease = sealLease(requestedLease)\n    const claimPath = this.claimPath(lease)\n    const stored = await readClaim(claimPath)\n    assertSameSlot(stored.claim, lease, claimPath)\n    assertLease(stored.leaseDigest, stored.claim.leaseExpiresAtMs, lease)\n    const state = await this.transitionState(stored.claim)\n    if (state.phase === 'candidate-may-run') {\n      return Object.freeze({ marked: false, phase: 'candidate-may-run' })\n    }\n    if (state.staged) {\n      throw new Error('candidate execution terminal was staged before candidate-may-run phase')\n    }\n    assertUnexpiredLease(stored.claim.leaseExpiresAtMs, this.now())\n    const marked = await writeRecordIfAbsent(\n      this.directory,\n      this.transitionPath(stored.claim, 1),\n      {\n        version: PHASE_FORMAT_VERSION,\n        kind: 'candidate-execution-phase',\n        executionId: stored.claim.executionId,\n        attempt: stored.claim.attempt,\n        executionPlanDigest: stored.claim.executionPlanDigest,\n        phase: 'candidate-may-run',\n      },\n      this.ownerPublication(stored.claim),\n    )\n    if (marked) return Object.freeze({ marked: true, phase: 'candidate-may-run' })\n    const winner = await this.transitionState(stored.claim)\n    if (winner.phase === 'candidate-may-run') {\n      return Object.freeze({ marked: false, phase: 'candidate-may-run' })\n    }\n    throw new Error('candidate execution terminal was staged before candidate-may-run phase')\n  }\n\n  async stageTerminal(\n    requestedLease: AgentCandidateExecutionLease,\n    result: AgentCandidateExecutionTerminalResult,\n  ): Promise<AgentCandidateExecutionStageResult> {\n    const lease = sealLease(requestedLease)\n    const claimPath = this.claimPath(lease)\n    const stored = await readClaim(claimPath)\n    assertSameSlot(stored.claim, lease, claimPath)\n    assertLease(stored.leaseDigest, stored.claim.leaseExpiresAtMs, lease)\n    const terminal = terminalRecord(stored.claim, result)\n    const state = await this.transitionState(stored.claim)\n    if (state.staged) return rejectedStage(state.staged, terminal)\n    assertTerminalAllowedInPhase(state.phase, terminal)\n    assertUnexpiredLease(stored.claim.leaseExpiresAtMs, this.now())\n    const transition = state.phase === 'claimed' ? 1 : 2\n    const staged = await writeRecordIfAbsent(\n      this.directory,\n      this.transitionPath(stored.claim, transition),\n      {\n        version: PENDING_FORMAT_VERSION,\n        kind: 'candidate-execution-pending-terminal',\n        terminal,\n      },\n      this.ownerPublication(stored.claim),\n    )\n    if (staged) return Object.freeze({ staged: true, terminal })\n    const winner = await this.transitionState(stored.claim)\n    if (!winner.staged) {\n      throw new Error('candidate execution phase transition won while staging terminal')\n    }\n    return rejectedStage(winner.staged, terminal)\n  }\n\n  async finish(\n    requestedLease: AgentCandidateExecutionLease,\n    requestedTerminalDigest: Sha256Digest,\n  ): Promise<AgentCandidateExecutionFinishResult> {\n    const lease = sealLease(requestedLease)\n    const terminalDigest = sealTerminalDigest(requestedTerminalDigest)\n    const claimPath = this.claimPath(lease)\n    const stored = await readClaim(claimPath)\n    assertSameSlot(stored.claim, lease, claimPath)\n    assertLease(stored.leaseDigest, stored.claim.leaseExpiresAtMs, lease)\n    const state = await this.transitionState(stored.claim)\n    const staged = requireStagedTerminal(state.staged, terminalDigest)\n    const terminalPath = this.terminalPath(lease)\n    const existing = await readTerminalIfPresent(terminalPath)\n    if (existing) {\n      assertTerminalMatchesClaim(existing, stored.claim, terminalPath)\n      assertTerminalMatchesStaged(existing, staged, terminalPath)\n      return rejectedFinish(existing, terminalDigest)\n    }\n    assertUnexpiredLease(stored.claim.leaseExpiresAtMs, this.now())\n    const finished = await writeRecordIfAbsent(\n      this.directory,\n      terminalPath,\n      {\n        version: TERMINAL_FORMAT_VERSION,\n        terminal: staged,\n      },\n      this.ownerPublication(stored.claim),\n    )\n    if (finished) return Object.freeze({ finished: true, terminal: staged })\n    const winner = await readTerminal(terminalPath)\n    assertSameSlot(winner, lease, terminalPath)\n    assertTerminalMatchesClaim(winner, stored.claim, terminalPath)\n    assertTerminalMatchesStaged(winner, staged, terminalPath)\n    return rejectedFinish(winner, terminalDigest)\n  }\n\n  async recoverExpired(\n    requestedAttempt: AgentCandidateExecutionAttemptRef,\n    evidence: AgentCandidateExecutionRecoveryEvidence,\n  ): Promise<AgentCandidateExecutionFinishResult> {\n    const attempt = sealAttemptRef(requestedAttempt)\n    const record = await this.storedAttempt(attempt)\n    if (!record) throw new Error('candidate execution recovery does not name an acquired attempt')\n    const recovered = recoveredTerminalRecord(record.claim, record.phase, evidence)\n    if (record.staged) assertRecoveryMatchesStaged(record.staged, recovered)\n    const requestedDigest = record.staged?.terminalDigest ?? recovered.terminalDigest\n    if (record.terminal) return rejectedFinish(record.terminal, requestedDigest)\n    assertExpiredLease(record.claim.leaseExpiresAtMs, this.now())\n\n    let staged = record.staged\n    if (!staged) {\n      const transition = record.phase === 'claimed' ? 1 : 2\n      const didStage = await writeRecordIfAbsent(\n        this.directory,\n        this.transitionPath(record.claim, transition),\n        {\n          version: PENDING_FORMAT_VERSION,\n          kind: 'candidate-execution-pending-terminal',\n          terminal: recovered,\n        },\n      )\n      if (didStage) {\n        staged = recovered\n      } else {\n        const winner = await this.transitionState(record.claim)\n        if (!winner.staged) {\n          throw new Error(\n            'candidate execution recovery lost terminal staging to a phase transition',\n          )\n        }\n        assertRecoveryMatchesStaged(winner.staged, recovered)\n        staged = winner.staged\n      }\n    }\n\n    const terminalPath = this.terminalPath(attempt)\n    const didFinish = await writeRecordIfAbsent(this.directory, terminalPath, {\n      version: TERMINAL_FORMAT_VERSION,\n      terminal: staged,\n    })\n    if (didFinish) return Object.freeze({ finished: true, terminal: staged })\n    const winner = await readTerminal(terminalPath)\n    assertSameSlot(winner, attempt, terminalPath)\n    assertTerminalMatchesClaim(winner, record.claim, terminalPath)\n    assertTerminalMatchesStaged(winner, staged, terminalPath)\n    return rejectedFinish(winner, staged.terminalDigest)\n  }\n\n  private async storedAttempt(\n    claim: Pick<AgentCandidateExecutionClaim, 'executionId' | 'attempt'>,\n  ): Promise<AgentCandidateExecutionAttemptRecord | undefined> {\n    const claimPath = this.claimPath(claim)\n    const stored = await readClaimIfPresent(claimPath)\n    if (!stored) return undefined\n    assertSameSlot(stored.claim, claim, claimPath)\n    const state = await this.transitionState(stored.claim)\n    const terminalPath = this.terminalPath(claim)\n    const terminal = await readTerminalIfPresent(terminalPath)\n    if (terminal) {\n      assertTerminalMatchesClaim(terminal, stored.claim, terminalPath)\n      if (!state.staged) {\n        throw new Error(\n          `candidate execution terminal record at ${terminalPath} has no staged outbox`,\n        )\n      }\n      assertTerminalMatchesStaged(terminal, state.staged, terminalPath)\n    }\n    return attemptRecord(stored.claim, state.phase, state.staged, terminal)\n  }\n\n  private async transitionState(claim: AgentCandidateExecutionClaim): Promise<{\n    phase: AgentCandidateExecutionPhase\n    staged?: AgentCandidateExecutionTerminalRecord\n  }> {\n    const firstPath = this.transitionPath(claim, 1)\n    const first = await readTransitionIfPresent(firstPath, claim)\n    if (!first) return { phase: 'claimed' }\n    if (first.kind === 'pending') return { phase: 'claimed', staged: first.terminal }\n    const secondPath = this.transitionPath(claim, 2)\n    const second = await readTransitionIfPresent(secondPath, claim)\n    if (!second) return { phase: 'candidate-may-run' }\n    if (second.kind !== 'pending') {\n      throw new Error(`candidate execution transition at ${secondPath} repeats the phase marker`)\n    }\n    return { phase: 'candidate-may-run', staged: second.terminal }\n  }\n\n  private async retryFailure(\n    claim: AgentCandidateExecutionClaim,\n  ): Promise<AgentCandidateRetryRejection | undefined> {\n    if (claim.attempt === 1) return undefined\n    return retryRejection(\n      claim,\n      await this.storedAttempt({\n        executionId: claim.executionId,\n        attempt: claim.attempt - 1,\n      }),\n    )\n  }\n\n  private ownerPublication(claim: AgentCandidateExecutionClaim): {\n    authorizePublish: () => true\n  } {\n    return {\n      authorizePublish: () => {\n        assertUnexpiredLease(claim.leaseExpiresAtMs, this.now())\n        return true\n      },\n    }\n  }\n\n  private claimPath(claim: Pick<AgentCandidateExecutionClaim, 'executionId' | 'attempt'>): string {\n    return join(this.directory, `${claimSlot(claim)}.claim.json`)\n  }\n\n  private terminalPath(\n    claim: Pick<AgentCandidateExecutionClaim, 'executionId' | 'attempt'>,\n  ): string {\n    return join(this.directory, `${claimSlot(claim)}.terminal.json`)\n  }\n\n  private transitionPath(\n    claim: Pick<AgentCandidateExecutionClaim, 'executionId' | 'attempt'>,\n    ordinal: 1 | 2,\n  ): string {\n    return join(this.directory, `${claimSlot(claim)}.transition-${ordinal}.json`)\n  }\n}\n\nasync function writeRecordIfAbsent(\n  directory: string,\n  destination: string,\n  record: object,\n  options: {\n    /** Synchronous authorization checked after temp fsync, immediately before atomic publication. */\n    authorizePublish?: () => true\n  } = {},\n): Promise<boolean> {\n  const temporaryPath = join(directory, `.candidate-execution-${process.pid}-${randomUUID()}.tmp`)\n  const handle = await open(temporaryPath, 'wx', 0o600)\n  try {\n    await handle.writeFile(\n      Buffer.concat([Buffer.from(canonicalCandidateBytes(record)), Buffer.from('\\n')]),\n    )\n    await handle.sync()\n  } finally {\n    await handle.close()\n  }\n\n  let written = false\n  try {\n    if (options.authorizePublish && options.authorizePublish() !== true) {\n      throw new Error('candidate execution record publication was not authorized')\n    }\n    // Authorization and the atomic filesystem call are one synchronous critical\n    // section so the event loop cannot advance an injected lease clock between them.\n    linkSync(temporaryPath, destination)\n    written = true\n    await syncDirectory(directory)\n  } catch (error) {\n    if (!isNodeError(error, 'EEXIST')) throw error\n  } finally {\n    await unlink(temporaryPath).catch((error: unknown) => {\n      if (!isNodeError(error, 'ENOENT')) throw error\n    })\n  }\n  return written\n}\n\nasync function syncDirectory(directory: string): Promise<void> {\n  const handle = await open(directory, 'r')\n  try {\n    await handle.sync()\n  } finally {\n    await handle.close()\n  }\n}\n\nfunction isNodeError(error: unknown, code: string): boolean {\n  return (\n    error !== null &&\n    typeof error === 'object' &&\n    'code' in error &&\n    (error as { code?: unknown }).code === code\n  )\n}\n","import { candidateCleanupDeadline, withinCandidateCleanupDeadline } from './cleanup'\nimport { sealAgentCandidateModelSettlement } from './model-settlement'\nimport {\n  assertPreparedCandidateIntegrity,\n  beginPreparedCandidateDisposal,\n  consumePreparedCandidateExecution,\n} from './prepared-state'\nimport type { PreparedAgentCandidateExecution } from './types'\n\nexport interface DisposePreparedAgentCandidateOptions {\n  cleanupTimeoutMs?: number\n}\n\n/** Revoke reservations held by a prepared candidate that will not be executed. */\nexport async function disposePreparedAgentCandidateExecution(\n  prepared: PreparedAgentCandidateExecution,\n  options: DisposePreparedAgentCandidateOptions = {},\n): Promise<{ disposed: true }> {\n  const initialState = assertPreparedCandidateIntegrity(prepared)\n  const cleanupTimeoutMs = options.cleanupTimeoutMs ?? initialState.cleanupTimeoutMs\n  if (cleanupTimeoutMs > initialState.cleanupTimeoutMs) {\n    throw new Error('disposal cleanup timeout exceeds the frozen preparation bound')\n  }\n  const cleanupDeadlineAtMs = candidateCleanupDeadline(cleanupTimeoutMs)\n  const state = beginPreparedCandidateDisposal(prepared)\n  const cleanup: Array<Promise<unknown>> = []\n\n  if (state.memory.mode === 'isolated') {\n    const reservation = state.memoryReservation\n    if (!reservation) throw new Error('isolated memory reservation is missing')\n    cleanup.push(\n      withinCandidateCleanupDeadline(\n        async () => {\n          const closed = await state.ports.memory.close({\n            executionId: state.executionId,\n            preparationId: reservation.preparationId,\n            accessDigest: reservation.accessDigest,\n            effectiveNamespace: reservation.effectiveNamespace,\n            reason: 'abandoned',\n          })\n          if (closed.closed !== true || Object.keys(closed).some((key) => key !== 'closed')) {\n            throw new Error('abandoned isolated memory access did not acknowledge closure')\n          }\n        },\n        cleanupDeadlineAtMs,\n        'isolated memory disposal',\n      ),\n    )\n  }\n\n  cleanup.push(\n    withinCandidateCleanupDeadline(\n      async () => {\n        const settlement = sealAgentCandidateModelSettlement(\n          await state.ports.models.settleGrant({\n            executionId: state.executionId,\n            preparationId: state.preparationId,\n            grantDigest: state.modelReservation.digest,\n            resolved: state.resolvedModel,\n            reason: 'abandoned',\n          }),\n          {\n            preparationId: state.preparationId,\n            grantDigest: state.modelReservation.digest,\n            model: state.resolvedModel.model,\n          },\n        )\n        if (settlement.usage.modelCalls !== 0) {\n          throw new Error('unexecuted model reservation unexpectedly contains calls')\n        }\n      },\n      cleanupDeadlineAtMs,\n      'model reservation disposal',\n    ),\n  )\n\n  const results = await Promise.allSettled(cleanup)\n  const failures = results\n    .filter((result): result is PromiseRejectedResult => result.status === 'rejected')\n    .map((result) => result.reason)\n  if (failures.length > 0) {\n    consumePreparedCandidateExecution(prepared, 'disposal-failed')\n    throw new AggregateError(failures, 'candidate preparation disposal failed')\n  }\n\n  consumePreparedCandidateExecution(prepared, 'disposed')\n  return Object.freeze({ disposed: true as const })\n}\n","import type {\n  AgentCandidateModelAccessNetwork,\n  AgentCandidateResolvedModel,\n  Sha256Digest,\n} from '@tangle-network/agent-interface'\n\nimport { canonicalCandidateDigest, immutableCandidateValue } from './digest'\nimport { assertExactObjectKeys } from './exact-object'\nimport { sealAgentCandidateModelSettlement, usdToNanos } from './model-settlement'\nimport type {\n  AgentCandidateModelLimits,\n  AgentCandidateModelPort,\n  AgentCandidateProtectedModelActivation,\n  AgentCandidateProtectedModelReservation,\n  AgentCandidateProtectedModelSettlement,\n} from './types'\n\nexport type AgentCandidateModelGrantReserveInput = Parameters<\n  AgentCandidateModelPort['reserveGrant']\n>[0]\nexport type AgentCandidateModelGrantActivateInput = Parameters<\n  AgentCandidateModelPort['activateGrant']\n>[0]\nexport type AgentCandidateModelGrantSettleInput = Parameters<\n  AgentCandidateModelPort['settleGrant']\n>[0]\n\n/** Secret-free response from the service's reservation endpoint. */\nexport type AgentCandidateModelGrantReservation = AgentCandidateProtectedModelReservation\n\n/**\n * Narrow transport contract for a service that owns scoped model credentials\n * and the authoritative per-call usage ledger.\n *\n * An HTTP client can bind these methods to control-plane endpoints. Keeping\n * transport out of the runtime prevents parent credentials, endpoint paths,\n * and retry policy from becoming part of the portable candidate contract.\n */\nexport interface AgentCandidateModelGrantClient {\n  reserve(input: AgentCandidateModelGrantReserveInput): Promise<AgentCandidateModelGrantReservation>\n  activate(\n    input: AgentCandidateModelGrantActivateInput,\n  ): Promise<AgentCandidateProtectedModelActivation>\n  settle(\n    input: AgentCandidateModelGrantSettleInput,\n  ): Promise<AgentCandidateProtectedModelSettlement>\n}\n\nexport interface CreateProtectedAgentCandidateModelPortOptions {\n  client: AgentCandidateModelGrantClient\n  /** Catalog/snapshot resolution stays separate from credential issuance. */\n  resolveModel: AgentCandidateModelPort['resolve']\n  /** The only public DNS name candidate processes may reach for inference. */\n  gatewayDomain: string\n  /** Exact environment names the activation endpoint must return, no more or fewer. */\n  activationEnvNames: readonly string[]\n}\n\ninterface RememberedReservation {\n  requestDigest: Sha256Digest\n  responseDigest: Sha256Digest\n  executionId: string\n  preparationId: string\n  grantDigest: Sha256Digest\n  expiresAtMs: number\n  resolved: AgentCandidateResolvedModel\n  limits: AgentCandidateModelLimits\n  maxCostUsdNanos: number\n  activation: 'reserved' | 'activating' | 'activated'\n  settlementDigest?: Sha256Digest\n  settlementReason?: AgentCandidateModelGrantSettleInput['reason']\n}\n\ninterface RememberedSettlement {\n  settlementDigest: Sha256Digest\n  settlementReason: AgentCandidateModelGrantSettleInput['reason']\n  expiresAtMs: number\n}\n\nconst MAX_RECENT_SETTLEMENTS = 4_096\nconst RECOVERED_SETTLEMENT_RETENTION_MS = 15 * 60 * 1_000\n\n/**\n * Bind a protected model-grant service to the immutable candidate runtime.\n *\n * The service remains the authority for expiry, admission, revocation, and\n * metering. This adapter independently checks every response before allowing\n * it to cross into candidate execution or durable receipt finalization.\n */\nexport function createProtectedAgentCandidateModelPort(\n  options: CreateProtectedAgentCandidateModelPortOptions,\n): AgentCandidateModelPort {\n  const gatewayDomain = assertGatewayDomain(options.gatewayDomain)\n  const activationEnvNames = exactEnvironmentNames(options.activationEnvNames)\n  const reservations = new Map<string, RememberedReservation>()\n  const recentSettlements = new Map<string, RememberedSettlement>()\n\n  return {\n    resolve: async (input) => {\n      const request = immutableCandidateValue(input)\n      const resolved = validateResolvedModel(await options.resolveModel(request), request)\n      return immutableCandidateValue(resolved)\n    },\n\n    reserveGrant: async (input) => {\n      pruneExpiredState(reservations, recentSettlements, Date.now())\n      const request = immutableCandidateValue(input)\n      validateReserveInput(request)\n      const requestDigest = canonicalCandidateDigest(request)\n      const key = reservationKey(request.executionId, request.preparationId)\n      if (recentSettlements.has(key)) {\n        throw new Error('protected model reservation is already settled')\n      }\n      const previous = reservations.get(key)\n      if (previous && previous.requestDigest !== requestDigest) {\n        throw new Error('protected model reservation retry changed immutable input')\n      }\n\n      const reservation = validateReservation(\n        await options.client.reserve(request),\n        request,\n        gatewayDomain,\n      )\n      const responseDigest = canonicalCandidateDigest(reservation)\n      if (recentSettlements.has(key)) {\n        throw new Error('protected model reservation completed after the grant was settled')\n      }\n      const recorded = previous ?? reservations.get(key)\n      if (recorded && recorded.requestDigest !== requestDigest) {\n        throw new Error('protected model reservation retry changed immutable input')\n      }\n      if (recorded && recorded.responseDigest !== responseDigest) {\n        throw new Error('protected model reservation retry returned different evidence')\n      }\n      if (!recorded) {\n        reservations.set(key, {\n          requestDigest,\n          responseDigest,\n          executionId: request.executionId,\n          preparationId: request.preparationId,\n          grantDigest: reservation.digest,\n          expiresAtMs: request.expiresAtMs,\n          resolved: immutableCandidateValue(request.resolved),\n          limits: immutableCandidateValue(request.limits),\n          maxCostUsdNanos: usdToNanos(request.limits.maxCostUsd, 'reserved maxCostUsd'),\n          activation: 'reserved',\n        })\n      }\n      return reservation\n    },\n\n    activateGrant: async (input) => {\n      pruneExpiredState(reservations, recentSettlements, Date.now())\n      const request = immutableCandidateValue(input)\n      const key = reservationKey(request.executionId, request.preparationId)\n      if (recentSettlements.has(key)) throw new Error('protected model grant is already settled')\n      const state = reservations.get(key)\n      if (!state) throw new Error('protected model grant was not reserved by this port')\n      assertGrantIdentity(state, request)\n      if (state.settlementDigest) throw new Error('protected model grant is already settled')\n      if (state.activation !== 'reserved') {\n        throw new Error('protected model grant activation is single-use')\n      }\n      if (!Number.isSafeInteger(request.deadlineAtMs) || request.deadlineAtMs <= 0) {\n        throw new Error('protected model activation deadline must be a positive safe integer')\n      }\n      if (request.deadlineAtMs <= Date.now()) {\n        throw new Error('protected model activation deadline must be in the future')\n      }\n      if (request.deadlineAtMs > state.expiresAtMs) {\n        throw new Error('protected model activation deadline exceeds the reserved expiry')\n      }\n      state.activation = 'activating'\n      try {\n        const activation = validateActivation(\n          await options.client.activate(request),\n          state.limits.maxModelCalls === 0 ? [] : activationEnvNames,\n        )\n        if (recentSettlements.has(key) || reservations.get(key) !== state) {\n          throw new Error('protected model grant settled while activation was in flight')\n        }\n        state.activation = 'activated'\n        return activation\n      } catch (error) {\n        state.activation = 'reserved'\n        throw error\n      }\n    },\n\n    settleGrant: async (input) => {\n      const now = Date.now()\n      pruneExpiredState(reservations, recentSettlements, now)\n      const request = immutableCandidateValue(input)\n      const key = reservationKey(request.executionId, request.preparationId)\n      const state = reservations.get(key)\n      if (state) assertGrantIdentity(state, request)\n      const remembered = state ?? recentSettlements.get(key)\n      if (remembered?.settlementReason && remembered.settlementReason !== request.reason) {\n        throw new Error('protected model settlement retry changed the termination reason')\n      }\n\n      const sealed = sealAgentCandidateModelSettlement(await options.client.settle(request), {\n        preparationId: request.preparationId,\n        grantDigest: request.grantDigest,\n        model: request.resolved.model,\n      })\n      if (state) assertWithinReservedLimits(sealed.fixedUsage, state)\n\n      const settlementDigest = canonicalCandidateDigest(sealed.value)\n      if (remembered?.settlementDigest && remembered.settlementDigest !== settlementDigest) {\n        throw new Error('protected model settlement retry returned a different final ledger')\n      }\n      if (remembered?.settlementReason && remembered.settlementReason !== request.reason) {\n        throw new Error('protected model settlement retry changed the termination reason')\n      }\n      const expiresAtMs = state?.expiresAtMs ?? now + RECOVERED_SETTLEMENT_RETENTION_MS\n      if (state) {\n        state.settlementDigest = settlementDigest\n        state.settlementReason = request.reason\n      }\n      reservations.delete(key)\n      rememberSettlement(recentSettlements, key, {\n        settlementDigest,\n        settlementReason: request.reason,\n        expiresAtMs,\n      })\n      return sealed.value\n    },\n  }\n}\n\nfunction validateReserveInput(input: AgentCandidateModelGrantReserveInput): void {\n  if (!Number.isSafeInteger(input.expiresAtMs) || input.expiresAtMs <= 0) {\n    throw new Error('protected model reservation expiry must be a positive safe integer')\n  }\n  if (input.expiresAtMs <= Date.now()) {\n    throw new Error('protected model reservation expiry must be in the future')\n  }\n  for (const [name, value] of [\n    ['maxModelCalls', input.limits.maxModelCalls],\n    ['maxInputTokens', input.limits.maxInputTokens],\n    ['maxOutputTokens', input.limits.maxOutputTokens],\n  ] as const) {\n    if (!Number.isSafeInteger(value) || value < 0) {\n      throw new Error(`protected model reservation ${name} must be a nonnegative safe integer`)\n    }\n  }\n  usdToNanos(input.limits.maxCostUsd, 'reserved maxCostUsd')\n}\n\nfunction validateReservation(\n  value: unknown,\n  expected: AgentCandidateModelGrantReserveInput,\n  gatewayDomain: string,\n): AgentCandidateModelGrantReservation {\n  const source = exactRecord(\n    value,\n    ['preparationId', 'digest', 'expiresAtMs', 'enforcedLimits', 'network'],\n    'protected model reservation response',\n  )\n  if (source.preparationId !== expected.preparationId) {\n    throw new Error('protected model reservation response changed preparation identity')\n  }\n  if (!isSha256Digest(source.digest)) {\n    throw new Error('protected model reservation response has an invalid digest')\n  }\n  if (source.expiresAtMs !== expected.expiresAtMs) {\n    throw new Error('protected model reservation response changed expiry')\n  }\n  exactRecord(\n    source.enforcedLimits,\n    ['maxModelCalls', 'maxInputTokens', 'maxOutputTokens', 'maxCostUsd'],\n    'protected model reservation enforced limits',\n  )\n  if (\n    canonicalCandidateDigest(source.enforcedLimits) !== canonicalCandidateDigest(expected.limits)\n  ) {\n    throw new Error('protected model reservation response changed enforced limits')\n  }\n\n  const network = validateReservationNetwork(\n    source.network,\n    expected.limits.maxModelCalls,\n    gatewayDomain,\n  )\n  return immutableCandidateValue({\n    preparationId: source.preparationId,\n    digest: source.digest,\n    expiresAtMs: source.expiresAtMs,\n    enforcedLimits: source.enforcedLimits,\n    network,\n  }) as AgentCandidateModelGrantReservation\n}\n\nfunction validateReservationNetwork(\n  value: unknown,\n  maxModelCalls: number,\n  gatewayDomain: string,\n): AgentCandidateModelAccessNetwork {\n  if (maxModelCalls === 0) {\n    const source = exactRecord(value, ['mode'], 'protected model reservation network')\n    if (source.mode !== 'disabled') {\n      throw new Error('zero-call protected model reservation must disable gateway access')\n    }\n    return { mode: 'disabled' }\n  }\n\n  const source = exactRecord(value, ['mode', 'domains'], 'protected model reservation network')\n  if (source.mode !== 'gateway-only') {\n    throw new Error('protected model reservation must allow only its model gateway')\n  }\n  if (\n    !Array.isArray(source.domains) ||\n    source.domains.length !== 1 ||\n    source.domains[0] !== gatewayDomain\n  ) {\n    throw new Error('protected model reservation returned an unexpected gateway domain')\n  }\n  return { mode: 'gateway-only', domains: [gatewayDomain] }\n}\n\nfunction validateActivation(\n  value: unknown,\n  expectedNames: readonly string[],\n): AgentCandidateProtectedModelActivation {\n  const source = exactRecord(value, ['env'], 'protected model activation response')\n  const env = record(source.env, 'protected model activation environment')\n  const actualNames = Object.keys(env).sort()\n  if (\n    actualNames.length !== expectedNames.length ||\n    actualNames.some((name, index) => name !== expectedNames[index])\n  ) {\n    throw new Error('protected model activation returned unexpected environment names')\n  }\n  const detached: Record<string, string> = Object.create(null) as Record<string, string>\n  for (const name of expectedNames) {\n    const value = env[name]\n    if (typeof value !== 'string' || value.length < 8 || value.length > 65_536) {\n      throw new Error(`protected model activation ${name} must be a non-empty protected value`)\n    }\n    detached[name] = value\n  }\n  return Object.freeze({ env: Object.freeze(detached) })\n}\n\nfunction validateResolvedModel(\n  value: unknown,\n  expected: Parameters<AgentCandidateModelPort['resolve']>[0],\n): AgentCandidateResolvedModel {\n  const source = exactRecord(\n    value,\n    ['requested', 'provider', 'model', 'snapshot', 'reasoningEffort'],\n    'resolved candidate model',\n  )\n  if (source.requested !== expected.requested) {\n    throw new Error('model resolver changed the evaluator-owned request')\n  }\n  if (source.reasoningEffort !== expected.reasoningEffort) {\n    throw new Error('model resolver changed the evaluator-owned reasoning effort')\n  }\n  for (const name of ['requested', 'provider', 'model', 'snapshot'] as const) {\n    if (typeof source[name] !== 'string' || source[name].length === 0) {\n      throw new Error(`resolved candidate model ${name} must be non-empty`)\n    }\n  }\n  return source as unknown as AgentCandidateResolvedModel\n}\n\nfunction assertGrantIdentity(\n  expected: RememberedReservation,\n  actual: AgentCandidateModelGrantActivateInput | AgentCandidateModelGrantSettleInput,\n): void {\n  if (\n    actual.executionId !== expected.executionId ||\n    actual.preparationId !== expected.preparationId ||\n    actual.grantDigest !== expected.grantDigest ||\n    canonicalCandidateDigest(actual.resolved) !== canonicalCandidateDigest(expected.resolved)\n  ) {\n    throw new Error('protected model grant input does not match its immutable reservation')\n  }\n}\n\nfunction assertWithinReservedLimits(\n  usage: {\n    modelCalls: number\n    inputTokens: number\n    outputTokens: number\n    costUsdNanos: number\n  },\n  reservation: RememberedReservation,\n): void {\n  for (const [name, actual, limit] of [\n    ['model calls', usage.modelCalls, reservation.limits.maxModelCalls],\n    ['input tokens', usage.inputTokens, reservation.limits.maxInputTokens],\n    ['output tokens', usage.outputTokens, reservation.limits.maxOutputTokens],\n    ['cost USD nanos', usage.costUsdNanos, reservation.maxCostUsdNanos],\n  ] as const) {\n    if (actual > limit) {\n      throw new Error(`protected model settlement ${name} ${actual} exceeds reserved ${limit}`)\n    }\n  }\n}\n\nfunction exactEnvironmentNames(values: readonly string[]): readonly string[] {\n  if (values.length === 0) {\n    throw new Error('protected model activation environment names must not be empty')\n  }\n  const names = [...values].sort()\n  if (new Set(names).size !== names.length) {\n    throw new Error('protected model activation environment names must be unique')\n  }\n  for (const name of names) {\n    if (\n      !/^[A-Za-z_][A-Za-z0-9_]*$/.test(name) ||\n      ['__proto__', 'constructor', 'prototype'].includes(name)\n    ) {\n      throw new Error(`protected model activation environment name is invalid: ${name}`)\n    }\n  }\n  return Object.freeze(names)\n}\n\nfunction assertGatewayDomain(value: string): string {\n  if (\n    value.length > 253 ||\n    value !== value.toLowerCase() ||\n    value.endsWith('.') ||\n    value.includes(':') ||\n    value === 'localhost' ||\n    value.endsWith('.localhost') ||\n    value === 'metadata.google' ||\n    value === 'metadata.google.internal'\n  ) {\n    throw new Error('protected model gateway must be an exact lowercase public DNS name')\n  }\n  const labels = value.split('.')\n  if (\n    labels.length < 2 ||\n    !labels.every(\n      (label) =>\n        label.length >= 1 && label.length <= 63 && /^[a-z0-9](?:[a-z0-9-]*[a-z0-9])?$/.test(label),\n    ) ||\n    !/[a-z]/.test(labels.at(-1) ?? '')\n  ) {\n    throw new Error('protected model gateway must be an exact lowercase public DNS name')\n  }\n  return value\n}\n\nfunction reservationKey(executionId: string, preparationId: string): string {\n  return canonicalCandidateDigest({ executionId, preparationId })\n}\n\nfunction pruneExpiredState(\n  reservations: Map<string, RememberedReservation>,\n  settlements: Map<string, RememberedSettlement>,\n  now: number,\n): void {\n  for (const [key, value] of reservations) {\n    if (value.expiresAtMs <= now) reservations.delete(key)\n  }\n  for (const [key, value] of settlements) {\n    if (value.expiresAtMs <= now) settlements.delete(key)\n  }\n}\n\nfunction rememberSettlement(\n  settlements: Map<string, RememberedSettlement>,\n  key: string,\n  value: RememberedSettlement,\n): void {\n  settlements.delete(key)\n  settlements.set(key, value)\n  while (settlements.size > MAX_RECENT_SETTLEMENTS) {\n    const oldest = settlements.keys().next().value\n    if (oldest === undefined) return\n    settlements.delete(oldest)\n  }\n}\n\nfunction isSha256Digest(value: unknown): value is Sha256Digest {\n  return typeof value === 'string' && /^sha256:[a-f0-9]{64}$/.test(value)\n}\n\nfunction exactRecord(\n  value: unknown,\n  keys: readonly string[],\n  label: string,\n): Record<string, unknown> {\n  const source = record(value, label)\n  assertExactObjectKeys(source, keys, label)\n  return source\n}\n\nfunction record(value: unknown, label: string): Record<string, unknown> {\n  if (value === null || typeof value !== 'object' || Array.isArray(value)) {\n    throw new Error(`${label} must be an object`)\n  }\n  const prototype = Object.getPrototypeOf(value)\n  if (prototype !== Object.prototype && prototype !== null) {\n    throw new Error(`${label} must be a plain object`)\n  }\n  return value as Record<string, unknown>\n}\n","import type { TraceStore } from '@tangle-network/agent-eval'\n\nimport type {\n  AgentCandidateExecutionAttemptRef,\n  AgentCandidateExecutionClaimStore,\n  AgentCandidateExecutionFinishResult,\n} from './claim'\nimport {\n  candidateCleanupDeadline,\n  candidateCleanupTimeout,\n  withinCandidateCleanupDeadline,\n} from './cleanup'\nimport { sealAgentCandidateExecutorFinalCapture } from './executor-capture'\nimport { sealAgentCandidateModelSettlement } from './model-settlement'\nimport { persistCandidateModelSettlementEvidence } from './outcome-evidence'\nimport { RecoveryAgentCandidateTraceStore } from './protected-trace-store'\nimport type {\n  AgentCandidateExecutionPorts,\n  AgentCandidateExecutorPort,\n  AgentCandidateOutputArtifactPort,\n} from './types'\n\nexport interface RecoverExpiredAgentCandidateOptions {\n  attempt: AgentCandidateExecutionAttemptRef\n  claimStore: AgentCandidateExecutionClaimStore\n  executor: AgentCandidateExecutorPort\n  traceStore: TraceStore\n  ports: Pick<AgentCandidateExecutionPorts, 'models' | 'memory'>\n  outputArtifacts: AgentCandidateOutputArtifactPort\n  cleanupTimeoutMs?: number\n  /** Evaluator clock; must be the same clock used by the claim store. */\n  now?: () => number\n}\n\n/** Close an expired crashed attempt from persisted non-secret handles, then record failure. */\nexport async function recoverExpiredAgentCandidateExecution(\n  options: RecoverExpiredAgentCandidateOptions,\n): Promise<AgentCandidateExecutionFinishResult> {\n  const record = await options.claimStore.getAttempt(options.attempt)\n  if (!record) throw new Error('candidate execution recovery attempt is missing')\n  if (record.terminal) {\n    return Object.freeze({ finished: false, terminal: record.terminal, exactReplay: true })\n  }\n  const cleanupTimeoutMs = candidateCleanupTimeout(\n    options.cleanupTimeoutMs ?? record.claim.cleanup.cleanupTimeoutMs,\n  )\n  if (cleanupTimeoutMs > record.claim.cleanup.cleanupTimeoutMs) {\n    throw new Error('recovery cleanup timeout exceeds the frozen preparation bound')\n  }\n\n  const now = options.now ?? Date.now\n  if (now() < record.claim.leaseExpiresAtMs) {\n    throw new Error('candidate execution lease has not expired')\n  }\n\n  const cleanupDeadlineAtMs = candidateCleanupDeadline(cleanupTimeoutMs)\n  const controller = new AbortController()\n  controller.abort(new Error('recovering an expired candidate execution'))\n  const recoveryTraceStore = new RecoveryAgentCandidateTraceStore(options.traceStore)\n  const processClosure = withinCandidateCleanupDeadline(\n    async () => {\n      const stopped = await options.executor.stopAndCapture(\n        {\n          executionId: record.claim.executionId,\n          executionPlanDigest: record.claim.executionPlanDigest,\n        },\n        {\n          traceStore: recoveryTraceStore,\n          reason: 'failed',\n          signal: controller.signal,\n          deadlineAtMs: record.claim.leaseExpiresAtMs,\n        },\n      )\n      sealAgentCandidateExecutorFinalCapture(stopped)\n      return { stopped: true as const }\n    },\n    cleanupDeadlineAtMs,\n    'expired candidate process termination',\n  )\n\n  const modelClosure = withinCandidateCleanupDeadline(\n    async () =>\n      sealAgentCandidateModelSettlement(\n        await options.ports.models.settleGrant({\n          executionId: record.claim.executionId,\n          preparationId: record.claim.cleanup.preparationId,\n          grantDigest: record.claim.cleanup.modelGrantDigest,\n          resolved: record.claim.cleanup.resolvedModel,\n          reason: 'failed',\n        }),\n        {\n          preparationId: record.claim.cleanup.preparationId,\n          grantDigest: record.claim.cleanup.modelGrantDigest,\n          model: record.claim.cleanup.resolvedModel.model,\n        },\n      ),\n    cleanupDeadlineAtMs,\n    'expired candidate model settlement',\n  )\n\n  const memoryClosure = record.claim.cleanup.memory\n    ? withinCandidateCleanupDeadline(\n        async () => {\n          const memory = record.claim.cleanup.memory\n          if (!memory) throw new Error('expired candidate memory handle is missing')\n          const closed = await options.ports.memory.close({\n            executionId: record.claim.executionId,\n            preparationId: record.claim.cleanup.preparationId,\n            accessDigest: memory.accessDigest,\n            effectiveNamespace: memory.effectiveNamespace,\n            reason: 'failed',\n          })\n          if (closed.closed !== true || Object.keys(closed).some((key) => key !== 'closed')) {\n            throw new Error('expired candidate memory did not acknowledge closure')\n          }\n          return { closed: true as const }\n        },\n        cleanupDeadlineAtMs,\n        'expired candidate memory closure',\n      )\n    : undefined\n\n  const operations = [processClosure, modelClosure, ...(memoryClosure ? [memoryClosure] : [])]\n  const outcomes = await Promise.allSettled(operations)\n  const failures = outcomes\n    .filter((outcome): outcome is PromiseRejectedResult => outcome.status === 'rejected')\n    .map((outcome) => outcome.reason)\n  if (failures.length > 0) {\n    throw new AggregateError(failures, 'expired candidate cleanup could not be proven')\n  }\n\n  const model = await modelClosure\n  const modelSettlement = await withinCandidateCleanupDeadline(\n    () =>\n      persistCandidateModelSettlementEvidence(\n        {\n          executionId: record.claim.executionId,\n          executionPlanDigest: record.claim.executionPlanDigest,\n          resolvedModel: record.claim.cleanup.resolvedModel,\n        },\n        model,\n        options.outputArtifacts,\n      ),\n    cleanupDeadlineAtMs,\n    'expired candidate model-settlement persistence',\n  )\n  const memory = record.claim.cleanup.memory\n  return await options.claimStore.recoverExpired(options.attempt, {\n    failureClass:\n      record.phase === 'claimed' && model.fixedUsage.modelCalls === 0\n        ? 'pre-model-infrastructure'\n        : 'unknown',\n    usage: model.fixedUsage,\n    modelSettlement: modelSettlement.artifact,\n    process: {\n      stopped: true,\n      executionPlanDigest: record.claim.executionPlanDigest,\n    },\n    model: {\n      closed: true,\n      preparationId: record.claim.cleanup.preparationId,\n      grantDigest: record.claim.cleanup.modelGrantDigest,\n    },\n    ...(memory\n      ? {\n          memory: {\n            closed: true,\n            preparationId: record.claim.cleanup.preparationId,\n            accessDigest: memory.accessDigest,\n            effectiveNamespace: memory.effectiveNamespace,\n          },\n        }\n      : {}),\n  })\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AACA,SAAS,yBAAyB;AAalC,SAAS,wBAAwB,6BAA6B;AAiEvD,SAAS,0BACd,OAC6C;AAC7C,MAAI,OAAO,OAAO,MAAM,SAAS,gBAAgB,GAAG;AAClD,UAAM,IAAI,MAAM,0EAA0E;AAAA,EAC5F;AACA,QAAM,kBAAkB,wBAAwB,MAAM,OAAO;AAC7D,QAAM,iBAAiB,gBAAgB;AACvC,QAAM,SAAoC;AAAA,IACxC,eAAe;AAAA,IACf,MAAM;AAAA,IACN,iBAAiB;AAAA,IACjB,SAAS,gBAAgB;AAAA,IACzB,MAAM,qBAAqB,MAAM,IAAI;AAAA,IACrC,WAAW,MAAM;AAAA,IACjB,GAAI,MAAM,YAAY,EAAE,WAAW,MAAM,UAAU,IAAI,CAAC;AAAA,IACxD,QAAQ,MAAM;AAAA,IACd,SAAS;AAAA,MACP,GAAG,MAAM;AAAA,MACT,GAAI,eAAe,SAAS,IAAI,EAAE,eAAe,IAAI,CAAC;AAAA,IACxD;AAAA,EACF;AACA,SAAO,yBAAyB,MAAM;AACxC;AAEA,SAAS,wBAAwB,QAG/B;AACA,MAAI,OAAO,SAAS,qBAAqB;AACvC,WAAO;AAAA,MACL,SAAS,2BAA2B,OAAO,OAAO;AAAA,MAClD,gBAAgB,CAAC;AAAA,IACnB;AAAA,EACF;AAEA,MAAI,OAAO,SAAS,WAAW;AAC7B,WAAO,EAAE,SAAS,mCAAmC,OAAO,OAAO,GAAG,gBAAgB,CAAC,EAAE;AAAA,EAC3F;AAEA,MAAI,OAAO,SAAS,iBAAiB;AACnC,UAAM,IAAI;AAAA,MACR,yCAAyC,OAAQ,OAA8B,IAAI,CAAC;AAAA,IACtF;AAAA,EACF;AACA,MAAI,OAAO,MAAM,WAAW,GAAG;AAC7B,UAAM,IAAI,MAAM,6DAA6D;AAAA,EAC/E;AACA,MAAI,UAAU,uBAAuB,OAAO,MAAM,cAAc;AAChE,QAAM,iBAA2B,CAAC;AAClC,aAAW,CAAC,OAAO,SAAS,KAAK,OAAO,MAAM,QAAQ,GAAG;AACvD,UAAM,OAAO,sBAAsB,WAAW,KAAK;AACnD,cAAU,0BAA0B,sBAAsB,SAAS,IAAI,CAAC;AACxE,mBAAe,KAAK,yBAAyB,IAAI,CAAC;AAAA,EACpD;AACA,SAAO,EAAE,SAAS,mCAAmC,OAAO,GAAG,eAAe;AAChF;AAEA,SAAS,qBAAqB,QAAqE;AACjG,MAAI,OAAO,SAAS,cAAc,OAAO,SAAS,QAAS,QAAO;AAClE,MAAI,OAAO,SAAS,gBAAgB;AAClC,UAAM,IAAI;AAAA,MACR,sCAAsC,OAAQ,OAA8B,IAAI,CAAC;AAAA,IACnF;AAAA,EACF;AAEA,QAAM,WAAW,kBAAkB,OAAO,SAAS,OAAO,WAAW;AACrE,QAAM,QAAQ,0BAA0B,SAAS,UAAU;AAC3D,MACE,MAAM,WAAW,OAAO,QAAQ,MAAM,UACtC,MAAM,eAAe,OAAO,QAAQ,MAAM,YAC1C;AACA,UAAM,IAAI,MAAM,oEAAoE;AAAA,EACtF;AACA,SAAO;AAAA,IACL,MAAM;AAAA,IACN,YAAY,OAAO;AAAA,IACnB,YAAY,OAAO,QAAQ;AAAA,IAC3B,UAAU,OAAO,QAAQ;AAAA,IACzB,eAAe,OAAO,QAAQ;AAAA,IAC9B,OAAO,EAAE,QAAQ,mBAAmB,UAAU,MAAM;AAAA,EACtD;AACF;AAEA,SAAS,sBAAsB,OAAgB,OAAiC;AAC9E,QAAM,SAAS,uBAAuB,MAAM,KAAK;AACjD,uBAAqB,OAAO,QAAQ,gBAAgB,KAAK,EAAE;AAC3D,SAAO;AACT;AAEA,SAAS,qBAAqB,OAAgB,QAAiB,OAAqB;AAClF,MAAI,CAAC,OAAO,KAAK,wBAAwB,KAAK,CAAC,EAAE,OAAO,wBAAwB,MAAM,CAAC,GAAG;AACxF,UAAM,IAAI,MAAM,GAAG,KAAK,+CAA+C;AAAA,EACzE;AACF;AAEA,SAAS,0BAA0B,OAAyB;AAC1D,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,WAAO,MAAM,IAAI,CAAC,OAAO,UAAU;AACjC,UAAI,UAAU,QAAW;AACvB,cAAM,IAAI,MAAM,iEAAiE,KAAK,EAAE;AAAA,MAC1F;AACA,aAAO,0BAA0B,KAAK;AAAA,IACxC,CAAC;AAAA,EACH;AACA,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO;AACxD,SAAO,OAAO;AAAA,IACZ,OAAO,QAAQ,KAAgC,EAC5C,OAAO,CAAC,CAAC,EAAE,KAAK,MAAM,UAAU,MAAS,EACzC,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM,CAAC,KAAK,0BAA0B,KAAK,CAAC,CAAC;AAAA,EAClE;AACF;;;AC9LA,SAAS,kBAAkB;AAC3B,SAAS,gBAAgB;AACzB,SAAS,OAAO,MAAM,cAAc;AACpC,SAAS,YAAY;AAwCrB,IAAM;AAAA,EACJ;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,IAAI;AAUG,IAAM,wCAAN,MAAyF;AAAA,EAC7E;AAAA,EACA;AAAA,EAEjB,YAAY,SAAuD;AACjE,QAAI,QAAQ,UAAU,WAAW,GAAG;AAClC,YAAM,IAAI,MAAM,uDAAuD;AAAA,IACzE;AACA,SAAK,YAAY,QAAQ;AACzB,SAAK,MAAM,QAAQ,OAAO,KAAK;AAAA,EACjC;AAAA,EAEA,MAAM,SACJ,WAC6C;AAC7C,UAAM,QAAQ,UAAU,SAAS;AACjC,UAAM,MAAM,KAAK,WAAW,EAAE,WAAW,KAAK,CAAC;AAC/C,UAAM,YAAY,KAAK,UAAU,KAAK;AACtC,UAAM,WAAW,MAAM,mBAAmB,SAAS;AACnD,QAAI,UAAU;AACZ,qBAAe,SAAS,OAAO,OAAO,SAAS;AAC/C,aAAO,sBAAsB,SAAS,OAAO,KAAK;AAAA,IACpD;AACA,yBAAqB,MAAM,kBAAkB,KAAK,IAAI,CAAC;AACvD,UAAM,eAAe,MAAM,KAAK,aAAa,KAAK;AAClD,QAAI,aAAc,QAAO,cAAc,OAAO,YAAY;AAE1D,UAAM,QAAQ,SAAS,KAAK;AAC5B,UAAM,WAAW,MAAM,oBAAoB,KAAK,WAAW,WAAW;AAAA,MACpE,SAAS;AAAA,MACT,GAAG;AAAA,MACH,OAAO;AAAA,MACP,aAAa,YAAY,KAAK;AAAA,IAChC,CAAC;AACD,QAAI,SAAU,QAAO,OAAO,OAAO,EAAE,UAAU,MAAM,OAAO,MAAM,CAAC;AAEnE,UAAM,SAAS,MAAM,UAAU,SAAS;AACxC,mBAAe,OAAO,OAAO,OAAO,SAAS;AAC7C,WAAO,sBAAsB,OAAO,OAAO,KAAK;AAAA,EAClD;AAAA,EAEA,MAAM,WACJ,kBAC2D;AAC3D,WAAO,MAAM,KAAK,cAAc,eAAe,gBAAgB,CAAC;AAAA,EAClE;AAAA,EAEA,MAAM,oBACJ,gBAC6C;AAC7C,UAAM,QAAQ,UAAU,cAAc;AACtC,UAAM,YAAY,KAAK,UAAU,KAAK;AACtC,UAAM,SAAS,MAAM,UAAU,SAAS;AACxC,mBAAe,OAAO,OAAO,OAAO,SAAS;AAC7C,gBAAY,OAAO,aAAa,OAAO,MAAM,kBAAkB,KAAK;AACpE,UAAM,QAAQ,MAAM,KAAK,gBAAgB,OAAO,KAAK;AACrD,QAAI,MAAM,UAAU,qBAAqB;AACvC,aAAO,OAAO,OAAO,EAAE,QAAQ,OAAO,OAAO,oBAAoB,CAAC;AAAA,IACpE;AACA,QAAI,MAAM,QAAQ;AAChB,YAAM,IAAI,MAAM,wEAAwE;AAAA,IAC1F;AACA,yBAAqB,OAAO,MAAM,kBAAkB,KAAK,IAAI,CAAC;AAC9D,UAAM,SAAS,MAAM;AAAA,MACnB,KAAK;AAAA,MACL,KAAK,eAAe,OAAO,OAAO,CAAC;AAAA,MACnC;AAAA,QACE,SAAS;AAAA,QACT,MAAM;AAAA,QACN,aAAa,OAAO,MAAM;AAAA,QAC1B,SAAS,OAAO,MAAM;AAAA,QACtB,qBAAqB,OAAO,MAAM;AAAA,QAClC,OAAO;AAAA,MACT;AAAA,MACA,KAAK,iBAAiB,OAAO,KAAK;AAAA,IACpC;AACA,QAAI,OAAQ,QAAO,OAAO,OAAO,EAAE,QAAQ,MAAM,OAAO,oBAAoB,CAAC;AAC7E,UAAM,SAAS,MAAM,KAAK,gBAAgB,OAAO,KAAK;AACtD,QAAI,OAAO,UAAU,qBAAqB;AACxC,aAAO,OAAO,OAAO,EAAE,QAAQ,OAAO,OAAO,oBAAoB,CAAC;AAAA,IACpE;AACA,UAAM,IAAI,MAAM,wEAAwE;AAAA,EAC1F;AAAA,EAEA,MAAM,cACJ,gBACA,QAC6C;AAC7C,UAAM,QAAQ,UAAU,cAAc;AACtC,UAAM,YAAY,KAAK,UAAU,KAAK;AACtC,UAAM,SAAS,MAAM,UAAU,SAAS;AACxC,mBAAe,OAAO,OAAO,OAAO,SAAS;AAC7C,gBAAY,OAAO,aAAa,OAAO,MAAM,kBAAkB,KAAK;AACpE,UAAM,WAAW,eAAe,OAAO,OAAO,MAAM;AACpD,UAAM,QAAQ,MAAM,KAAK,gBAAgB,OAAO,KAAK;AACrD,QAAI,MAAM,OAAQ,QAAO,cAAc,MAAM,QAAQ,QAAQ;AAC7D,iCAA6B,MAAM,OAAO,QAAQ;AAClD,yBAAqB,OAAO,MAAM,kBAAkB,KAAK,IAAI,CAAC;AAC9D,UAAM,aAAa,MAAM,UAAU,YAAY,IAAI;AACnD,UAAM,SAAS,MAAM;AAAA,MACnB,KAAK;AAAA,MACL,KAAK,eAAe,OAAO,OAAO,UAAU;AAAA,MAC5C;AAAA,QACE,SAAS;AAAA,QACT,MAAM;AAAA,QACN;AAAA,MACF;AAAA,MACA,KAAK,iBAAiB,OAAO,KAAK;AAAA,IACpC;AACA,QAAI,OAAQ,QAAO,OAAO,OAAO,EAAE,QAAQ,MAAM,SAAS,CAAC;AAC3D,UAAM,SAAS,MAAM,KAAK,gBAAgB,OAAO,KAAK;AACtD,QAAI,CAAC,OAAO,QAAQ;AAClB,YAAM,IAAI,MAAM,iEAAiE;AAAA,IACnF;AACA,WAAO,cAAc,OAAO,QAAQ,QAAQ;AAAA,EAC9C;AAAA,EAEA,MAAM,OACJ,gBACA,yBAC8C;AAC9C,UAAM,QAAQ,UAAU,cAAc;AACtC,UAAM,iBAAiB,mBAAmB,uBAAuB;AACjE,UAAM,YAAY,KAAK,UAAU,KAAK;AACtC,UAAM,SAAS,MAAM,UAAU,SAAS;AACxC,mBAAe,OAAO,OAAO,OAAO,SAAS;AAC7C,gBAAY,OAAO,aAAa,OAAO,MAAM,kBAAkB,KAAK;AACpE,UAAM,QAAQ,MAAM,KAAK,gBAAgB,OAAO,KAAK;AACrD,UAAM,SAAS,sBAAsB,MAAM,QAAQ,cAAc;AACjE,UAAM,eAAe,KAAK,aAAa,KAAK;AAC5C,UAAM,WAAW,MAAM,sBAAsB,YAAY;AACzD,QAAI,UAAU;AACZ,iCAA2B,UAAU,OAAO,OAAO,YAAY;AAC/D,kCAA4B,UAAU,QAAQ,YAAY;AAC1D,aAAO,eAAe,UAAU,cAAc;AAAA,IAChD;AACA,yBAAqB,OAAO,MAAM,kBAAkB,KAAK,IAAI,CAAC;AAC9D,UAAM,WAAW,MAAM;AAAA,MACrB,KAAK;AAAA,MACL;AAAA,MACA;AAAA,QACE,SAAS;AAAA,QACT,UAAU;AAAA,MACZ;AAAA,MACA,KAAK,iBAAiB,OAAO,KAAK;AAAA,IACpC;AACA,QAAI,SAAU,QAAO,OAAO,OAAO,EAAE,UAAU,MAAM,UAAU,OAAO,CAAC;AACvE,UAAM,SAAS,MAAM,aAAa,YAAY;AAC9C,mBAAe,QAAQ,OAAO,YAAY;AAC1C,+BAA2B,QAAQ,OAAO,OAAO,YAAY;AAC7D,gCAA4B,QAAQ,QAAQ,YAAY;AACxD,WAAO,eAAe,QAAQ,cAAc;AAAA,EAC9C;AAAA,EAEA,MAAM,eACJ,kBACA,UAC8C;AAC9C,UAAM,UAAU,eAAe,gBAAgB;AAC/C,UAAMA,UAAS,MAAM,KAAK,cAAc,OAAO;AAC/C,QAAI,CAACA,QAAQ,OAAM,IAAI,MAAM,gEAAgE;AAC7F,UAAM,YAAY,wBAAwBA,QAAO,OAAOA,QAAO,OAAO,QAAQ;AAC9E,QAAIA,QAAO,OAAQ,6BAA4BA,QAAO,QAAQ,SAAS;AACvE,UAAM,kBAAkBA,QAAO,QAAQ,kBAAkB,UAAU;AACnE,QAAIA,QAAO,SAAU,QAAO,eAAeA,QAAO,UAAU,eAAe;AAC3E,uBAAmBA,QAAO,MAAM,kBAAkB,KAAK,IAAI,CAAC;AAE5D,QAAI,SAASA,QAAO;AACpB,QAAI,CAAC,QAAQ;AACX,YAAM,aAAaA,QAAO,UAAU,YAAY,IAAI;AACpD,YAAM,WAAW,MAAM;AAAA,QACrB,KAAK;AAAA,QACL,KAAK,eAAeA,QAAO,OAAO,UAAU;AAAA,QAC5C;AAAA,UACE,SAAS;AAAA,UACT,MAAM;AAAA,UACN,UAAU;AAAA,QACZ;AAAA,MACF;AACA,UAAI,UAAU;AACZ,iBAAS;AAAA,MACX,OAAO;AACL,cAAMC,UAAS,MAAM,KAAK,gBAAgBD,QAAO,KAAK;AACtD,YAAI,CAACC,QAAO,QAAQ;AAClB,gBAAM,IAAI;AAAA,YACR;AAAA,UACF;AAAA,QACF;AACA,oCAA4BA,QAAO,QAAQ,SAAS;AACpD,iBAASA,QAAO;AAAA,MAClB;AAAA,IACF;AAEA,UAAM,eAAe,KAAK,aAAa,OAAO;AAC9C,UAAM,YAAY,MAAM,oBAAoB,KAAK,WAAW,cAAc;AAAA,MACxE,SAAS;AAAA,MACT,UAAU;AAAA,IACZ,CAAC;AACD,QAAI,UAAW,QAAO,OAAO,OAAO,EAAE,UAAU,MAAM,UAAU,OAAO,CAAC;AACxE,UAAM,SAAS,MAAM,aAAa,YAAY;AAC9C,mBAAe,QAAQ,SAAS,YAAY;AAC5C,+BAA2B,QAAQD,QAAO,OAAO,YAAY;AAC7D,gCAA4B,QAAQ,QAAQ,YAAY;AACxD,WAAO,eAAe,QAAQ,OAAO,cAAc;AAAA,EACrD;AAAA,EAEA,MAAc,cACZ,OAC2D;AAC3D,UAAM,YAAY,KAAK,UAAU,KAAK;AACtC,UAAM,SAAS,MAAM,mBAAmB,SAAS;AACjD,QAAI,CAAC,OAAQ,QAAO;AACpB,mBAAe,OAAO,OAAO,OAAO,SAAS;AAC7C,UAAM,QAAQ,MAAM,KAAK,gBAAgB,OAAO,KAAK;AACrD,UAAM,eAAe,KAAK,aAAa,KAAK;AAC5C,UAAM,WAAW,MAAM,sBAAsB,YAAY;AACzD,QAAI,UAAU;AACZ,iCAA2B,UAAU,OAAO,OAAO,YAAY;AAC/D,UAAI,CAAC,MAAM,QAAQ;AACjB,cAAM,IAAI;AAAA,UACR,0CAA0C,YAAY;AAAA,QACxD;AAAA,MACF;AACA,kCAA4B,UAAU,MAAM,QAAQ,YAAY;AAAA,IAClE;AACA,WAAO,cAAc,OAAO,OAAO,MAAM,OAAO,MAAM,QAAQ,QAAQ;AAAA,EACxE;AAAA,EAEA,MAAc,gBAAgB,OAG3B;AACD,UAAM,YAAY,KAAK,eAAe,OAAO,CAAC;AAC9C,UAAM,QAAQ,MAAM,wBAAwB,WAAW,KAAK;AAC5D,QAAI,CAAC,MAAO,QAAO,EAAE,OAAO,UAAU;AACtC,QAAI,MAAM,SAAS,UAAW,QAAO,EAAE,OAAO,WAAW,QAAQ,MAAM,SAAS;AAChF,UAAM,aAAa,KAAK,eAAe,OAAO,CAAC;AAC/C,UAAM,SAAS,MAAM,wBAAwB,YAAY,KAAK;AAC9D,QAAI,CAAC,OAAQ,QAAO,EAAE,OAAO,oBAAoB;AACjD,QAAI,OAAO,SAAS,WAAW;AAC7B,YAAM,IAAI,MAAM,qCAAqC,UAAU,2BAA2B;AAAA,IAC5F;AACA,WAAO,EAAE,OAAO,qBAAqB,QAAQ,OAAO,SAAS;AAAA,EAC/D;AAAA,EAEA,MAAc,aACZ,OACmD;AACnD,QAAI,MAAM,YAAY,EAAG,QAAO;AAChC,WAAO;AAAA,MACL;AAAA,MACA,MAAM,KAAK,cAAc;AAAA,QACvB,aAAa,MAAM;AAAA,QACnB,SAAS,MAAM,UAAU;AAAA,MAC3B,CAAC;AAAA,IACH;AAAA,EACF;AAAA,EAEQ,iBAAiB,OAEvB;AACA,WAAO;AAAA,MACL,kBAAkB,MAAM;AACtB,6BAAqB,MAAM,kBAAkB,KAAK,IAAI,CAAC;AACvD,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,UAAU,OAA8E;AAC9F,WAAO,KAAK,KAAK,WAAW,GAAG,UAAU,KAAK,CAAC,aAAa;AAAA,EAC9D;AAAA,EAEQ,aACN,OACQ;AACR,WAAO,KAAK,KAAK,WAAW,GAAG,UAAU,KAAK,CAAC,gBAAgB;AAAA,EACjE;AAAA,EAEQ,eACN,OACA,SACQ;AACR,WAAO,KAAK,KAAK,WAAW,GAAG,UAAU,KAAK,CAAC,eAAe,OAAO,OAAO;AAAA,EAC9E;AACF;AAEA,eAAe,oBACb,WACA,aACAA,SACA,UAGI,CAAC,GACa;AAClB,QAAM,gBAAgB,KAAK,WAAW,wBAAwB,QAAQ,GAAG,IAAI,WAAW,CAAC,MAAM;AAC/F,QAAM,SAAS,MAAM,KAAK,eAAe,MAAM,GAAK;AACpD,MAAI;AACF,UAAM,OAAO;AAAA,MACX,OAAO,OAAO,CAAC,OAAO,KAAK,wBAAwBA,OAAM,CAAC,GAAG,OAAO,KAAK,IAAI,CAAC,CAAC;AAAA,IACjF;AACA,UAAM,OAAO,KAAK;AAAA,EACpB,UAAE;AACA,UAAM,OAAO,MAAM;AAAA,EACrB;AAEA,MAAI,UAAU;AACd,MAAI;AACF,QAAI,QAAQ,oBAAoB,QAAQ,iBAAiB,MAAM,MAAM;AACnE,YAAM,IAAI,MAAM,2DAA2D;AAAA,IAC7E;AAGA,aAAS,eAAe,WAAW;AACnC,cAAU;AACV,UAAM,cAAc,SAAS;AAAA,EAC/B,SAAS,OAAO;AACd,QAAI,CAAC,YAAY,OAAO,QAAQ,EAAG,OAAM;AAAA,EAC3C,UAAE;AACA,UAAM,OAAO,aAAa,EAAE,MAAM,CAAC,UAAmB;AACpD,UAAI,CAAC,YAAY,OAAO,QAAQ,EAAG,OAAM;AAAA,IAC3C,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAEA,eAAe,cAAc,WAAkC;AAC7D,QAAM,SAAS,MAAM,KAAK,WAAW,GAAG;AACxC,MAAI;AACF,UAAM,OAAO,KAAK;AAAA,EACpB,UAAE;AACA,UAAM,OAAO,MAAM;AAAA,EACrB;AACF;AAEA,SAAS,YAAY,OAAgB,MAAuB;AAC1D,SACE,UAAU,QACV,OAAO,UAAU,YACjB,UAAU,SACT,MAA6B,SAAS;AAE3C;;;AClZA,eAAsB,uCACpB,UACA,UAAgD,CAAC,GACpB;AAC7B,QAAM,eAAe,iCAAiC,QAAQ;AAC9D,QAAM,mBAAmB,QAAQ,oBAAoB,aAAa;AAClE,MAAI,mBAAmB,aAAa,kBAAkB;AACpD,UAAM,IAAI,MAAM,+DAA+D;AAAA,EACjF;AACA,QAAM,sBAAsB,yBAAyB,gBAAgB;AACrE,QAAM,QAAQ,+BAA+B,QAAQ;AACrD,QAAM,UAAmC,CAAC;AAE1C,MAAI,MAAM,OAAO,SAAS,YAAY;AACpC,UAAM,cAAc,MAAM;AAC1B,QAAI,CAAC,YAAa,OAAM,IAAI,MAAM,wCAAwC;AAC1E,YAAQ;AAAA,MACN;AAAA,QACE,YAAY;AACV,gBAAM,SAAS,MAAM,MAAM,MAAM,OAAO,MAAM;AAAA,YAC5C,aAAa,MAAM;AAAA,YACnB,eAAe,YAAY;AAAA,YAC3B,cAAc,YAAY;AAAA,YAC1B,oBAAoB,YAAY;AAAA,YAChC,QAAQ;AAAA,UACV,CAAC;AACD,cAAI,OAAO,WAAW,QAAQ,OAAO,KAAK,MAAM,EAAE,KAAK,CAAC,QAAQ,QAAQ,QAAQ,GAAG;AACjF,kBAAM,IAAI,MAAM,8DAA8D;AAAA,UAChF;AAAA,QACF;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,UAAQ;AAAA,IACN;AAAA,MACE,YAAY;AACV,cAAM,aAAa;AAAA,UACjB,MAAM,MAAM,MAAM,OAAO,YAAY;AAAA,YACnC,aAAa,MAAM;AAAA,YACnB,eAAe,MAAM;AAAA,YACrB,aAAa,MAAM,iBAAiB;AAAA,YACpC,UAAU,MAAM;AAAA,YAChB,QAAQ;AAAA,UACV,CAAC;AAAA,UACD;AAAA,YACE,eAAe,MAAM;AAAA,YACrB,aAAa,MAAM,iBAAiB;AAAA,YACpC,OAAO,MAAM,cAAc;AAAA,UAC7B;AAAA,QACF;AACA,YAAI,WAAW,MAAM,eAAe,GAAG;AACrC,gBAAM,IAAI,MAAM,0DAA0D;AAAA,QAC5E;AAAA,MACF;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAEA,QAAM,UAAU,MAAM,QAAQ,WAAW,OAAO;AAChD,QAAM,WAAW,QACd,OAAO,CAAC,WAA4C,OAAO,WAAW,UAAU,EAChF,IAAI,CAAC,WAAW,OAAO,MAAM;AAChC,MAAI,SAAS,SAAS,GAAG;AACvB,sCAAkC,UAAU,iBAAiB;AAC7D,UAAM,IAAI,eAAe,UAAU,uCAAuC;AAAA,EAC5E;AAEA,oCAAkC,UAAU,UAAU;AACtD,SAAO,OAAO,OAAO,EAAE,UAAU,KAAc,CAAC;AAClD;;;ACRA,IAAM,yBAAyB;AAC/B,IAAM,oCAAoC,KAAK,KAAK;AAS7C,SAAS,uCACd,SACyB;AACzB,QAAM,gBAAgB,oBAAoB,QAAQ,aAAa;AAC/D,QAAM,qBAAqB,sBAAsB,QAAQ,kBAAkB;AAC3E,QAAM,eAAe,oBAAI,IAAmC;AAC5D,QAAM,oBAAoB,oBAAI,IAAkC;AAEhE,SAAO;AAAA,IACL,SAAS,OAAO,UAAU;AACxB,YAAM,UAAU,wBAAwB,KAAK;AAC7C,YAAM,WAAW,sBAAsB,MAAM,QAAQ,aAAa,OAAO,GAAG,OAAO;AACnF,aAAO,wBAAwB,QAAQ;AAAA,IACzC;AAAA,IAEA,cAAc,OAAO,UAAU;AAC7B,wBAAkB,cAAc,mBAAmB,KAAK,IAAI,CAAC;AAC7D,YAAM,UAAU,wBAAwB,KAAK;AAC7C,2BAAqB,OAAO;AAC5B,YAAM,gBAAgB,yBAAyB,OAAO;AACtD,YAAM,MAAM,eAAe,QAAQ,aAAa,QAAQ,aAAa;AACrE,UAAI,kBAAkB,IAAI,GAAG,GAAG;AAC9B,cAAM,IAAI,MAAM,gDAAgD;AAAA,MAClE;AACA,YAAM,WAAW,aAAa,IAAI,GAAG;AACrC,UAAI,YAAY,SAAS,kBAAkB,eAAe;AACxD,cAAM,IAAI,MAAM,2DAA2D;AAAA,MAC7E;AAEA,YAAM,cAAc;AAAA,QAClB,MAAM,QAAQ,OAAO,QAAQ,OAAO;AAAA,QACpC;AAAA,QACA;AAAA,MACF;AACA,YAAM,iBAAiB,yBAAyB,WAAW;AAC3D,UAAI,kBAAkB,IAAI,GAAG,GAAG;AAC9B,cAAM,IAAI,MAAM,mEAAmE;AAAA,MACrF;AACA,YAAM,WAAW,YAAY,aAAa,IAAI,GAAG;AACjD,UAAI,YAAY,SAAS,kBAAkB,eAAe;AACxD,cAAM,IAAI,MAAM,2DAA2D;AAAA,MAC7E;AACA,UAAI,YAAY,SAAS,mBAAmB,gBAAgB;AAC1D,cAAM,IAAI,MAAM,+DAA+D;AAAA,MACjF;AACA,UAAI,CAAC,UAAU;AACb,qBAAa,IAAI,KAAK;AAAA,UACpB;AAAA,UACA;AAAA,UACA,aAAa,QAAQ;AAAA,UACrB,eAAe,QAAQ;AAAA,UACvB,aAAa,YAAY;AAAA,UACzB,aAAa,QAAQ;AAAA,UACrB,UAAU,wBAAwB,QAAQ,QAAQ;AAAA,UAClD,QAAQ,wBAAwB,QAAQ,MAAM;AAAA,UAC9C,iBAAiB,WAAW,QAAQ,OAAO,YAAY,qBAAqB;AAAA,UAC5E,YAAY;AAAA,QACd,CAAC;AAAA,MACH;AACA,aAAO;AAAA,IACT;AAAA,IAEA,eAAe,OAAO,UAAU;AAC9B,wBAAkB,cAAc,mBAAmB,KAAK,IAAI,CAAC;AAC7D,YAAM,UAAU,wBAAwB,KAAK;AAC7C,YAAM,MAAM,eAAe,QAAQ,aAAa,QAAQ,aAAa;AACrE,UAAI,kBAAkB,IAAI,GAAG,EAAG,OAAM,IAAI,MAAM,0CAA0C;AAC1F,YAAM,QAAQ,aAAa,IAAI,GAAG;AAClC,UAAI,CAAC,MAAO,OAAM,IAAI,MAAM,qDAAqD;AACjF,0BAAoB,OAAO,OAAO;AAClC,UAAI,MAAM,iBAAkB,OAAM,IAAI,MAAM,0CAA0C;AACtF,UAAI,MAAM,eAAe,YAAY;AACnC,cAAM,IAAI,MAAM,gDAAgD;AAAA,MAClE;AACA,UAAI,CAAC,OAAO,cAAc,QAAQ,YAAY,KAAK,QAAQ,gBAAgB,GAAG;AAC5E,cAAM,IAAI,MAAM,qEAAqE;AAAA,MACvF;AACA,UAAI,QAAQ,gBAAgB,KAAK,IAAI,GAAG;AACtC,cAAM,IAAI,MAAM,2DAA2D;AAAA,MAC7E;AACA,UAAI,QAAQ,eAAe,MAAM,aAAa;AAC5C,cAAM,IAAI,MAAM,iEAAiE;AAAA,MACnF;AACA,YAAM,aAAa;AACnB,UAAI;AACF,cAAM,aAAa;AAAA,UACjB,MAAM,QAAQ,OAAO,SAAS,OAAO;AAAA,UACrC,MAAM,OAAO,kBAAkB,IAAI,CAAC,IAAI;AAAA,QAC1C;AACA,YAAI,kBAAkB,IAAI,GAAG,KAAK,aAAa,IAAI,GAAG,MAAM,OAAO;AACjE,gBAAM,IAAI,MAAM,8DAA8D;AAAA,QAChF;AACA,cAAM,aAAa;AACnB,eAAO;AAAA,MACT,SAAS,OAAO;AACd,cAAM,aAAa;AACnB,cAAM;AAAA,MACR;AAAA,IACF;AAAA,IAEA,aAAa,OAAO,UAAU;AAC5B,YAAM,MAAM,KAAK,IAAI;AACrB,wBAAkB,cAAc,mBAAmB,GAAG;AACtD,YAAM,UAAU,wBAAwB,KAAK;AAC7C,YAAM,MAAM,eAAe,QAAQ,aAAa,QAAQ,aAAa;AACrE,YAAM,QAAQ,aAAa,IAAI,GAAG;AAClC,UAAI,MAAO,qBAAoB,OAAO,OAAO;AAC7C,YAAM,aAAa,SAAS,kBAAkB,IAAI,GAAG;AACrD,UAAI,YAAY,oBAAoB,WAAW,qBAAqB,QAAQ,QAAQ;AAClF,cAAM,IAAI,MAAM,iEAAiE;AAAA,MACnF;AAEA,YAAM,SAAS,kCAAkC,MAAM,QAAQ,OAAO,OAAO,OAAO,GAAG;AAAA,QACrF,eAAe,QAAQ;AAAA,QACvB,aAAa,QAAQ;AAAA,QACrB,OAAO,QAAQ,SAAS;AAAA,MAC1B,CAAC;AACD,UAAI,MAAO,4BAA2B,OAAO,YAAY,KAAK;AAE9D,YAAM,mBAAmB,yBAAyB,OAAO,KAAK;AAC9D,UAAI,YAAY,oBAAoB,WAAW,qBAAqB,kBAAkB;AACpF,cAAM,IAAI,MAAM,oEAAoE;AAAA,MACtF;AACA,UAAI,YAAY,oBAAoB,WAAW,qBAAqB,QAAQ,QAAQ;AAClF,cAAM,IAAI,MAAM,iEAAiE;AAAA,MACnF;AACA,YAAM,cAAc,OAAO,eAAe,MAAM;AAChD,UAAI,OAAO;AACT,cAAM,mBAAmB;AACzB,cAAM,mBAAmB,QAAQ;AAAA,MACnC;AACA,mBAAa,OAAO,GAAG;AACvB,yBAAmB,mBAAmB,KAAK;AAAA,QACzC;AAAA,QACA,kBAAkB,QAAQ;AAAA,QAC1B;AAAA,MACF,CAAC;AACD,aAAO,OAAO;AAAA,IAChB;AAAA,EACF;AACF;AAEA,SAAS,qBAAqB,OAAmD;AAC/E,MAAI,CAAC,OAAO,cAAc,MAAM,WAAW,KAAK,MAAM,eAAe,GAAG;AACtE,UAAM,IAAI,MAAM,oEAAoE;AAAA,EACtF;AACA,MAAI,MAAM,eAAe,KAAK,IAAI,GAAG;AACnC,UAAM,IAAI,MAAM,0DAA0D;AAAA,EAC5E;AACA,aAAW,CAAC,MAAM,KAAK,KAAK;AAAA,IAC1B,CAAC,iBAAiB,MAAM,OAAO,aAAa;AAAA,IAC5C,CAAC,kBAAkB,MAAM,OAAO,cAAc;AAAA,IAC9C,CAAC,mBAAmB,MAAM,OAAO,eAAe;AAAA,EAClD,GAAY;AACV,QAAI,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,GAAG;AAC7C,YAAM,IAAI,MAAM,+BAA+B,IAAI,qCAAqC;AAAA,IAC1F;AAAA,EACF;AACA,aAAW,MAAM,OAAO,YAAY,qBAAqB;AAC3D;AAEA,SAAS,oBACP,OACA,UACA,eACqC;AACrC,QAAM,SAAS;AAAA,IACb;AAAA,IACA,CAAC,iBAAiB,UAAU,eAAe,kBAAkB,SAAS;AAAA,IACtE;AAAA,EACF;AACA,MAAI,OAAO,kBAAkB,SAAS,eAAe;AACnD,UAAM,IAAI,MAAM,mEAAmE;AAAA,EACrF;AACA,MAAI,CAAC,eAAe,OAAO,MAAM,GAAG;AAClC,UAAM,IAAI,MAAM,4DAA4D;AAAA,EAC9E;AACA,MAAI,OAAO,gBAAgB,SAAS,aAAa;AAC/C,UAAM,IAAI,MAAM,qDAAqD;AAAA,EACvE;AACA;AAAA,IACE,OAAO;AAAA,IACP,CAAC,iBAAiB,kBAAkB,mBAAmB,YAAY;AAAA,IACnE;AAAA,EACF;AACA,MACE,yBAAyB,OAAO,cAAc,MAAM,yBAAyB,SAAS,MAAM,GAC5F;AACA,UAAM,IAAI,MAAM,8DAA8D;AAAA,EAChF;AAEA,QAAM,UAAU;AAAA,IACd,OAAO;AAAA,IACP,SAAS,OAAO;AAAA,IAChB;AAAA,EACF;AACA,SAAO,wBAAwB;AAAA,IAC7B,eAAe,OAAO;AAAA,IACtB,QAAQ,OAAO;AAAA,IACf,aAAa,OAAO;AAAA,IACpB,gBAAgB,OAAO;AAAA,IACvB;AAAA,EACF,CAAC;AACH;AAEA,SAAS,2BACP,OACA,eACA,eACkC;AAClC,MAAI,kBAAkB,GAAG;AACvB,UAAME,UAAS,YAAY,OAAO,CAAC,MAAM,GAAG,qCAAqC;AACjF,QAAIA,QAAO,SAAS,YAAY;AAC9B,YAAM,IAAI,MAAM,mEAAmE;AAAA,IACrF;AACA,WAAO,EAAE,MAAM,WAAW;AAAA,EAC5B;AAEA,QAAM,SAAS,YAAY,OAAO,CAAC,QAAQ,SAAS,GAAG,qCAAqC;AAC5F,MAAI,OAAO,SAAS,gBAAgB;AAClC,UAAM,IAAI,MAAM,+DAA+D;AAAA,EACjF;AACA,MACE,CAAC,MAAM,QAAQ,OAAO,OAAO,KAC7B,OAAO,QAAQ,WAAW,KAC1B,OAAO,QAAQ,CAAC,MAAM,eACtB;AACA,UAAM,IAAI,MAAM,mEAAmE;AAAA,EACrF;AACA,SAAO,EAAE,MAAM,gBAAgB,SAAS,CAAC,aAAa,EAAE;AAC1D;AAEA,SAAS,mBACP,OACA,eACwC;AACxC,QAAM,SAAS,YAAY,OAAO,CAAC,KAAK,GAAG,qCAAqC;AAChF,QAAM,MAAM,OAAO,OAAO,KAAK,wCAAwC;AACvE,QAAM,cAAc,OAAO,KAAK,GAAG,EAAE,KAAK;AAC1C,MACE,YAAY,WAAW,cAAc,UACrC,YAAY,KAAK,CAAC,MAAM,UAAU,SAAS,cAAc,KAAK,CAAC,GAC/D;AACA,UAAM,IAAI,MAAM,kEAAkE;AAAA,EACpF;AACA,QAAM,WAAmC,uBAAO,OAAO,IAAI;AAC3D,aAAW,QAAQ,eAAe;AAChC,UAAMC,SAAQ,IAAI,IAAI;AACtB,QAAI,OAAOA,WAAU,YAAYA,OAAM,SAAS,KAAKA,OAAM,SAAS,OAAQ;AAC1E,YAAM,IAAI,MAAM,8BAA8B,IAAI,sCAAsC;AAAA,IAC1F;AACA,aAAS,IAAI,IAAIA;AAAA,EACnB;AACA,SAAO,OAAO,OAAO,EAAE,KAAK,OAAO,OAAO,QAAQ,EAAE,CAAC;AACvD;AAEA,SAAS,sBACP,OACA,UAC6B;AAC7B,QAAM,SAAS;AAAA,IACb;AAAA,IACA,CAAC,aAAa,YAAY,SAAS,YAAY,iBAAiB;AAAA,IAChE;AAAA,EACF;AACA,MAAI,OAAO,cAAc,SAAS,WAAW;AAC3C,UAAM,IAAI,MAAM,oDAAoD;AAAA,EACtE;AACA,MAAI,OAAO,oBAAoB,SAAS,iBAAiB;AACvD,UAAM,IAAI,MAAM,6DAA6D;AAAA,EAC/E;AACA,aAAW,QAAQ,CAAC,aAAa,YAAY,SAAS,UAAU,GAAY;AAC1E,QAAI,OAAO,OAAO,IAAI,MAAM,YAAY,OAAO,IAAI,EAAE,WAAW,GAAG;AACjE,YAAM,IAAI,MAAM,4BAA4B,IAAI,oBAAoB;AAAA,IACtE;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,oBACP,UACA,QACM;AACN,MACE,OAAO,gBAAgB,SAAS,eAChC,OAAO,kBAAkB,SAAS,iBAClC,OAAO,gBAAgB,SAAS,eAChC,yBAAyB,OAAO,QAAQ,MAAM,yBAAyB,SAAS,QAAQ,GACxF;AACA,UAAM,IAAI,MAAM,sEAAsE;AAAA,EACxF;AACF;AAEA,SAAS,2BACP,OAMA,aACM;AACN,aAAW,CAAC,MAAM,QAAQ,KAAK,KAAK;AAAA,IAClC,CAAC,eAAe,MAAM,YAAY,YAAY,OAAO,aAAa;AAAA,IAClE,CAAC,gBAAgB,MAAM,aAAa,YAAY,OAAO,cAAc;AAAA,IACrE,CAAC,iBAAiB,MAAM,cAAc,YAAY,OAAO,eAAe;AAAA,IACxE,CAAC,kBAAkB,MAAM,cAAc,YAAY,eAAe;AAAA,EACpE,GAAY;AACV,QAAI,SAAS,OAAO;AAClB,YAAM,IAAI,MAAM,8BAA8B,IAAI,IAAI,MAAM,qBAAqB,KAAK,EAAE;AAAA,IAC1F;AAAA,EACF;AACF;AAEA,SAAS,sBAAsB,QAA8C;AAC3E,MAAI,OAAO,WAAW,GAAG;AACvB,UAAM,IAAI,MAAM,gEAAgE;AAAA,EAClF;AACA,QAAM,QAAQ,CAAC,GAAG,MAAM,EAAE,KAAK;AAC/B,MAAI,IAAI,IAAI,KAAK,EAAE,SAAS,MAAM,QAAQ;AACxC,UAAM,IAAI,MAAM,6DAA6D;AAAA,EAC/E;AACA,aAAW,QAAQ,OAAO;AACxB,QACE,CAAC,2BAA2B,KAAK,IAAI,KACrC,CAAC,aAAa,eAAe,WAAW,EAAE,SAAS,IAAI,GACvD;AACA,YAAM,IAAI,MAAM,2DAA2D,IAAI,EAAE;AAAA,IACnF;AAAA,EACF;AACA,SAAO,OAAO,OAAO,KAAK;AAC5B;AAEA,SAAS,oBAAoB,OAAuB;AAClD,MACE,MAAM,SAAS,OACf,UAAU,MAAM,YAAY,KAC5B,MAAM,SAAS,GAAG,KAClB,MAAM,SAAS,GAAG,KAClB,UAAU,eACV,MAAM,SAAS,YAAY,KAC3B,UAAU,qBACV,UAAU,4BACV;AACA,UAAM,IAAI,MAAM,oEAAoE;AAAA,EACtF;AACA,QAAM,SAAS,MAAM,MAAM,GAAG;AAC9B,MACE,OAAO,SAAS,KAChB,CAAC,OAAO;AAAA,IACN,CAAC,UACC,MAAM,UAAU,KAAK,MAAM,UAAU,MAAM,oCAAoC,KAAK,KAAK;AAAA,EAC7F,KACA,CAAC,QAAQ,KAAK,OAAO,GAAG,EAAE,KAAK,EAAE,GACjC;AACA,UAAM,IAAI,MAAM,oEAAoE;AAAA,EACtF;AACA,SAAO;AACT;AAEA,SAAS,eAAe,aAAqB,eAA+B;AAC1E,SAAO,yBAAyB,EAAE,aAAa,cAAc,CAAC;AAChE;AAEA,SAAS,kBACP,cACA,aACA,KACM;AACN,aAAW,CAAC,KAAK,KAAK,KAAK,cAAc;AACvC,QAAI,MAAM,eAAe,IAAK,cAAa,OAAO,GAAG;AAAA,EACvD;AACA,aAAW,CAAC,KAAK,KAAK,KAAK,aAAa;AACtC,QAAI,MAAM,eAAe,IAAK,aAAY,OAAO,GAAG;AAAA,EACtD;AACF;AAEA,SAAS,mBACP,aACA,KACA,OACM;AACN,cAAY,OAAO,GAAG;AACtB,cAAY,IAAI,KAAK,KAAK;AAC1B,SAAO,YAAY,OAAO,wBAAwB;AAChD,UAAM,SAAS,YAAY,KAAK,EAAE,KAAK,EAAE;AACzC,QAAI,WAAW,OAAW;AAC1B,gBAAY,OAAO,MAAM;AAAA,EAC3B;AACF;AAEA,SAAS,eAAe,OAAuC;AAC7D,SAAO,OAAO,UAAU,YAAY,wBAAwB,KAAK,KAAK;AACxE;AAEA,SAAS,YACP,OACA,MACA,OACyB;AACzB,QAAM,SAAS,OAAO,OAAO,KAAK;AAClC,wBAAsB,QAAQ,MAAM,KAAK;AACzC,SAAO;AACT;AAEA,SAAS,OAAO,OAAgB,OAAwC;AACtE,MAAI,UAAU,QAAQ,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK,GAAG;AACvE,UAAM,IAAI,MAAM,GAAG,KAAK,oBAAoB;AAAA,EAC9C;AACA,QAAM,YAAY,OAAO,eAAe,KAAK;AAC7C,MAAI,cAAc,OAAO,aAAa,cAAc,MAAM;AACxD,UAAM,IAAI,MAAM,GAAG,KAAK,yBAAyB;AAAA,EACnD;AACA,SAAO;AACT;;;ACpdA,eAAsB,sCACpB,SAC8C;AAC9C,QAAMC,UAAS,MAAM,QAAQ,WAAW,WAAW,QAAQ,OAAO;AAClE,MAAI,CAACA,QAAQ,OAAM,IAAI,MAAM,iDAAiD;AAC9E,MAAIA,QAAO,UAAU;AACnB,WAAO,OAAO,OAAO,EAAE,UAAU,OAAO,UAAUA,QAAO,UAAU,aAAa,KAAK,CAAC;AAAA,EACxF;AACA,QAAM,mBAAmB;AAAA,IACvB,QAAQ,oBAAoBA,QAAO,MAAM,QAAQ;AAAA,EACnD;AACA,MAAI,mBAAmBA,QAAO,MAAM,QAAQ,kBAAkB;AAC5D,UAAM,IAAI,MAAM,+DAA+D;AAAA,EACjF;AAEA,QAAM,MAAM,QAAQ,OAAO,KAAK;AAChC,MAAI,IAAI,IAAIA,QAAO,MAAM,kBAAkB;AACzC,UAAM,IAAI,MAAM,2CAA2C;AAAA,EAC7D;AAEA,QAAM,sBAAsB,yBAAyB,gBAAgB;AACrE,QAAM,aAAa,IAAI,gBAAgB;AACvC,aAAW,MAAM,IAAI,MAAM,2CAA2C,CAAC;AACvE,QAAM,qBAAqB,IAAI,iCAAiC,QAAQ,UAAU;AAClF,QAAM,iBAAiB;AAAA,IACrB,YAAY;AACV,YAAM,UAAU,MAAM,QAAQ,SAAS;AAAA,QACrC;AAAA,UACE,aAAaA,QAAO,MAAM;AAAA,UAC1B,qBAAqBA,QAAO,MAAM;AAAA,QACpC;AAAA,QACA;AAAA,UACE,YAAY;AAAA,UACZ,QAAQ;AAAA,UACR,QAAQ,WAAW;AAAA,UACnB,cAAcA,QAAO,MAAM;AAAA,QAC7B;AAAA,MACF;AACA,6CAAuC,OAAO;AAC9C,aAAO,EAAE,SAAS,KAAc;AAAA,IAClC;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,QAAM,eAAe;AAAA,IACnB,YACE;AAAA,MACE,MAAM,QAAQ,MAAM,OAAO,YAAY;AAAA,QACrC,aAAaA,QAAO,MAAM;AAAA,QAC1B,eAAeA,QAAO,MAAM,QAAQ;AAAA,QACpC,aAAaA,QAAO,MAAM,QAAQ;AAAA,QAClC,UAAUA,QAAO,MAAM,QAAQ;AAAA,QAC/B,QAAQ;AAAA,MACV,CAAC;AAAA,MACD;AAAA,QACE,eAAeA,QAAO,MAAM,QAAQ;AAAA,QACpC,aAAaA,QAAO,MAAM,QAAQ;AAAA,QAClC,OAAOA,QAAO,MAAM,QAAQ,cAAc;AAAA,MAC5C;AAAA,IACF;AAAA,IACF;AAAA,IACA;AAAA,EACF;AAEA,QAAM,gBAAgBA,QAAO,MAAM,QAAQ,SACvC;AAAA,IACE,YAAY;AACV,YAAMC,UAASD,QAAO,MAAM,QAAQ;AACpC,UAAI,CAACC,QAAQ,OAAM,IAAI,MAAM,4CAA4C;AACzE,YAAM,SAAS,MAAM,QAAQ,MAAM,OAAO,MAAM;AAAA,QAC9C,aAAaD,QAAO,MAAM;AAAA,QAC1B,eAAeA,QAAO,MAAM,QAAQ;AAAA,QACpC,cAAcC,QAAO;AAAA,QACrB,oBAAoBA,QAAO;AAAA,QAC3B,QAAQ;AAAA,MACV,CAAC;AACD,UAAI,OAAO,WAAW,QAAQ,OAAO,KAAK,MAAM,EAAE,KAAK,CAAC,QAAQ,QAAQ,QAAQ,GAAG;AACjF,cAAM,IAAI,MAAM,sDAAsD;AAAA,MACxE;AACA,aAAO,EAAE,QAAQ,KAAc;AAAA,IACjC;AAAA,IACA;AAAA,IACA;AAAA,EACF,IACA;AAEJ,QAAM,aAAa,CAAC,gBAAgB,cAAc,GAAI,gBAAgB,CAAC,aAAa,IAAI,CAAC,CAAE;AAC3F,QAAM,WAAW,MAAM,QAAQ,WAAW,UAAU;AACpD,QAAM,WAAW,SACd,OAAO,CAAC,YAA8C,QAAQ,WAAW,UAAU,EACnF,IAAI,CAAC,YAAY,QAAQ,MAAM;AAClC,MAAI,SAAS,SAAS,GAAG;AACvB,UAAM,IAAI,eAAe,UAAU,+CAA+C;AAAA,EACpF;AAEA,QAAM,QAAQ,MAAM;AACpB,QAAM,kBAAkB,MAAM;AAAA,IAC5B,MACE;AAAA,MACE;AAAA,QACE,aAAaD,QAAO,MAAM;AAAA,QAC1B,qBAAqBA,QAAO,MAAM;AAAA,QAClC,eAAeA,QAAO,MAAM,QAAQ;AAAA,MACtC;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,IACV;AAAA,IACF;AAAA,IACA;AAAA,EACF;AACA,QAAM,SAASA,QAAO,MAAM,QAAQ;AACpC,SAAO,MAAM,QAAQ,WAAW,eAAe,QAAQ,SAAS;AAAA,IAC9D,cACEA,QAAO,UAAU,aAAa,MAAM,WAAW,eAAe,IAC1D,6BACA;AAAA,IACN,OAAO,MAAM;AAAA,IACb,iBAAiB,gBAAgB;AAAA,IACjC,SAAS;AAAA,MACP,SAAS;AAAA,MACT,qBAAqBA,QAAO,MAAM;AAAA,IACpC;AAAA,IACA,OAAO;AAAA,MACL,QAAQ;AAAA,MACR,eAAeA,QAAO,MAAM,QAAQ;AAAA,MACpC,aAAaA,QAAO,MAAM,QAAQ;AAAA,IACpC;AAAA,IACA,GAAI,SACA;AAAA,MACE,QAAQ;AAAA,QACN,QAAQ;AAAA,QACR,eAAeA,QAAO,MAAM,QAAQ;AAAA,QACpC,cAAc,OAAO;AAAA,QACrB,oBAAoB,OAAO;AAAA,MAC7B;AAAA,IACF,IACA,CAAC;AAAA,EACP,CAAC;AACH;","names":["record","winner","source","value","record","memory"]}