@tangle-network/agent-runtime 0.44.0 → 0.46.0

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@tangle-network/agent-runtime",
-  "version": "0.44.0",
-  "description": "Runs domain agents and automates improving them from their own traces — chat turns and loop topologies, with an analyst→prompt/knowledge→eval-gated-ship self-improvement loop.",
+  "version": "0.46.0",
+  "description": "Shared task-lifecycle skeleton for agents: a recursive loop kernel for chat turns, one-shot tasks, and multi-attempt loops, with trace capture and eval-gated self-improvement. Domain behavior lives in adapters; scoring and ship-gates in @tangle-network/agent-eval.",
   "homepage": "https://github.com/tangle-network/agent-runtime#readme",
   "repository": {
     "type": "git",
@@ -39,11 +39,21 @@
       "import": "./dist/agent.js",
       "default": "./dist/agent.js"
     },
+    "./runtime": {
+      "types": "./dist/runtime.d.ts",
+      "import": "./dist/runtime.js",
+      "default": "./dist/runtime.js"
+    },
     "./loops": {
       "types": "./dist/loops.d.ts",
       "import": "./dist/loops.js",
       "default": "./dist/loops.js"
     },
+    "./topology": {
+      "types": "./dist/topology.d.ts",
+      "import": "./dist/topology.js",
+      "default": "./dist/topology.js"
+    },
     "./workflow": {
       "types": "./dist/workflow.d.ts",
       "import": "./dist/workflow.js",
@@ -54,6 +64,11 @@
       "import": "./dist/profiles.js",
       "default": "./dist/profiles.js"
     },
+    "./audit": {
+      "types": "./dist/audit.d.ts",
+      "import": "./dist/audit.js",
+      "default": "./dist/audit.js"
+    },
     "./mcp": {
       "types": "./dist/mcp/index.d.ts",
       "import": "./dist/mcp/index.js",
@@ -72,45 +87,25 @@
   "publishConfig": {
     "access": "public"
   },
-  "scripts": {
-    "build": "tsup",
-    "dev": "tsup --watch",
-    "prepare": "tsup",
-    "test": "vitest run",
-    "test:watch": "vitest",
-    "lint": "biome check src tests examples",
-    "lint:fix": "biome check --write src tests examples",
-    "typecheck": "tsc --noEmit",
-    "verify:package": "node scripts/verify-package-exports.mjs"
-  },
-  "dependencies": {},
   "devDependencies": {
     "@biomejs/biome": "^2.4.0",
-    "@tangle-network/agent-eval": "^0.61.0",
+    "@tangle-network/agent-eval": "^0.83.0",
     "@tangle-network/sandbox": "^0.4.0",
     "@types/node": "^25.6.0",
+    "playwright": "^1.40.0",
     "tsup": "^8.0.0",
     "typescript": "^5.7.0",
     "vitest": "^3.0.0"
   },
-  "pnpm": {
-    "minimumReleaseAge": 4320,
-    "minimumReleaseAgeExclude": [
-      "@tangle-network/agent-eval"
-    ],
-    "onlyBuiltDependencies": [
-      "esbuild"
-    ]
-  },
   "engines": {
     "node": ">=20"
   },
   "license": "MIT",
-  "packageManager": "pnpm@10.28.0",
   "peerDependencies": {
-    "@tangle-network/agent-eval": ">=0.61.0 <1.0.0",
+    "@tangle-network/agent-eval": ">=0.83.0 <1.0.0",
     "@tangle-network/agent-knowledge": ">=1.3.0 <2.0.0",
-    "@tangle-network/sandbox": ">=0.1.2 <0.5.0"
+    "@tangle-network/sandbox": ">=0.1.2 <0.5.0",
+    "playwright": "^1.40.0"
   },
   "peerDependenciesMeta": {
     "@tangle-network/agent-knowledge": {
@@ -118,6 +113,20 @@
     },
     "@tangle-network/sandbox": {
       "optional": true
+    },
+    "playwright": {
+      "optional": true
     }
+  },
+  "scripts": {
+    "build": "tsup",
+    "dev": "tsup --watch",
+    "test": "vitest run",
+    "test:watch": "vitest",
+    "lint": "biome check src tests examples",
+    "lint:fix": "biome check --write src tests examples",
+    "typecheck": "tsc --noEmit",
+    "typecheck:examples": "tsc --noEmit -p tsconfig.examples.json",
+    "verify:package": "node scripts/verify-package-exports.mjs"
   }
-}
+}

package/skills/agent-runtime-adoption/SKILL.md

@@ -1,6 +1,6 @@
 ---
 name: agent-runtime-adoption
-description: Adopt @tangle-network/agent-runtime in a product — the driven-loop kernel (runLoop), topology drivers (refine / fanout-vote / dynamic agent-authored), the loopDispatch campaign bridge, MCP delegation, and identity-gated prompt-surface optimization (optimizePrompt). Self-contained; needs only the published package + @tangle-network/agent-eval. Use when wiring runLoop, choosing a topology driver, optimizing a system/planner prompt, or exposing delegation tools.
+description: Adopt @tangle-network/agent-runtime in a product — the driven-loop kernel (runLoop), topology drivers (refine / fanout-vote / dynamic agent-authored), the loopDispatch campaign bridge, MCP delegation, and the code-surface improvementDriver for agent-eval's selfImprove (the optimization entry point). Self-contained; needs only the published package + @tangle-network/agent-eval. Use when wiring runLoop, choosing a topology driver, optimizing a system/planner prompt or code surface, or exposing delegation tools.
 ---
 
 # agent-runtime adoption — driven loops, topology drivers, prompt optimization
@@ -43,7 +43,7 @@ Topology is data; the kernel is topology-agnostic.
 - **`createFanoutVoteDriver({ n, selector? })`** — N parallel attempts in
   iteration 0, score once, pick the winner (default: highest valid score). Use
   for multi-harness coder fanout, redundant research with disagreement detection.
-- **`createDynamicDriver({ planner, maxIterations?, maxFanout? })`** — **the
+- **`createDriver({ planner, maxIterations?, maxFanout? })`** — **the
   agent authors the topology.** `plan`/`decide` are backed by an injected
   `TopologyPlanner` that emits one `TopologyMove` per round
   (`{kind:'refine',task}` | `{kind:'fanout',tasks}` | `{kind:'stop'}`). The
@@ -59,7 +59,7 @@ fanning a single round across several.
 ### Wiring an LLM planner — `createSandboxPlanner`
 
 ```ts
-import { createDynamicDriver, createSandboxPlanner, runLoop } from '@tangle-network/agent-runtime/loops'
+import { createDriver, createSandboxPlanner, runLoop } from '@tangle-network/agent-runtime/loops'
 
 const planner = createSandboxPlanner<Task, Out>({
   client, profile: plannerProfile,          // any harness; cheap model is fine
@@ -67,7 +67,7 @@ const planner = createSandboxPlanner<Task, Out>({
   // buildPrompt?  — defaults to a history-summary prompt; override to customize
 })
 const result = await runLoop({
-  driver: createDynamicDriver({ planner, maxIterations: 8 }),
+  driver: createDriver({ planner, maxIterations: 8 }),
   agentRuns: workerSpecs, output, validator, task, ctx: { sandboxClient: client },
 })
 ```
@@ -106,30 +106,34 @@ const dispatch = loopCampaignDispatch({
 
 `loopDispatch` is the `runProfileMatrix` variant (profile is an axis).
 
-## Identity-gated prompt optimization — `optimizePrompt`
+## Identity-gated optimization — agent-eval's `selfImprove`
 
-`@tangle-network/agent-runtime/improvement`. The text-surface entry point onto
-agent-eval's `runImprovementLoop` — sibling to `improvementDriver` (the
-code/worktree path). Optimizes any prompt surface (system / planner / judge
-rubric) and is **identity-gated by construction**: it runs evals, proposes
-candidates (default driver `gepaDriver`), and the held-out gate compares
-candidate vs baseline. `result.prompt` is the **baseline unless the gate decided
-`'ship'`** — so registering a prompt for optimization can never regress it; it
-only improves when held-out data earns it.
+The optimization entry point is **`selfImprove`** (`@tangle-network/agent-eval/contract`),
+NOT agent-runtime — agent-runtime contributes the code-surface `improvementDriver`
+(`/improvement`, the git-worktree path) you pass to it as `driver` to optimize CODE
+instead of a string. `selfImprove` optimizes any text/config surface (system /
+planner / judge rubric) and is **identity-gated by construction**: it runs evals,
+proposes candidates (default driver `gepaDriver`), and a held-out gate ships a winner
+only if it beats the baseline. `result.winner.surface` is the **baseline unless
+`result.gateDecision === 'ship'`** — so registering a surface for optimization can
+never regress it; it only improves when held-out data earns it.
 
 ```ts
-import { optimizePrompt } from '@tangle-network/agent-runtime/improvement'
-const { prompt, improved, decision, delta } = await optimizePrompt({
-  baselinePrompt: CURRENT_SYSTEM_PROMPT,
-  runWithPrompt: (prompt, scenario, ctx) => runYourThing(prompt, scenario),  // sandbox / runLoop / direct call
-  scenarios, holdoutScenarios, judges, runDir,
-  reflection: { llm, model: REFLECTION_MODEL },   // builds the default gepaDriver
-  // gate? — defaults to heldOutGate; pass defaultProductionGate for red-team hardening
+import { selfImprove } from '@tangle-network/agent-eval/contract'
+const result = await selfImprove({
+  baselineSurface: CURRENT_SYSTEM_PROMPT,
+  agent: (surface, scenario, ctx) => runYourThing(surface, scenario),  // sandbox / runLoop / direct call
+  scenarios,
+  judge,
+  budget: { holdoutScenarios, generations: 3, populationSize: 2 },
+  llm: { baseUrl, apiKey, model: REFLECTION_MODEL },   // drives the default gepaDriver
+  // driver? — pass agent-runtime's improvementDriver to optimize CODE (worktree) instead of a string
+  // gate?   — defaults to a held-out gate; pass defaultProductionGate for red-team hardening
 })
-// use `prompt` unconditionally: it's the baseline until a candidate genuinely wins
+// use result.winner.surface unconditionally: it's the baseline until a candidate genuinely wins
 ```
 
-### optimizePrompt gotchas — read before wiring
+### selfImprove gotchas — read before wiring
 
 - **`gepaDriver` mutates TEXT only**, and its only structural guard is `##` H2
   headings (`preserveSections`) + `maxSentenceEdits`. Make load-bearing sections
@@ -137,12 +141,11 @@ const { prompt, improved, decision, delta } = await optimizePrompt({
   GEPA optimizes the prose, never the envelope/contract.
 - **Scenarios must be domain-real.** Derive them from the surface's own traces /
   ground truth, not from unrelated corpora. Cross-domain examples are noise.
-- **Extend, don't fork.** If the product already wires `runImprovementLoop`
-  (e.g. for a main-agent prompt), add the new surface as another target in that
-  harness rather than bolting on a second optimizer.
-- `runWithPrompt` is the only domain seam — the optimizer never assumes how a
-  prompt runs. Report cost via `ctx.cost` inside it so the integrity guard sees
-  real activity.
+- **Extend, don't fork.** If the product already wires `selfImprove` /
+  `runImprovementLoop` (e.g. for a main-agent prompt), add the new surface as
+  another target in that harness rather than bolting on a second optimizer.
+- `agent` is the only domain seam — the optimizer never assumes how a surface
+  runs. Report cost via `ctx.cost` inside it so the integrity guard sees real activity.
 - A live run needs a real backend (`TANGLE_API_KEY` / router, or local
   cli-bridge) and real spend; it is not free.
 
@@ -161,7 +164,7 @@ Mount it on a production `AgentProfile.mcp`; do not re-implement delegation.
       `loops/types.ts:Driver` only when none fit — never fork the kernel.
 - [ ] `runLoop` is bridged to campaigns via `loopDispatch` / `loopCampaignDispatch`
       (usage + trace auto-forwarded), not a hand-rolled ExecCtx.
-- [ ] Every optimizable prompt is registered through `optimizePrompt` (or the
+- [ ] Every optimizable prompt is registered through `selfImprove` (or the
       product's existing `runImprovementLoop`), identity-gated on a held-out set.
 - [ ] Boundaries fail loud: no `null` sandbox client, no silent adapter return,
       no unguarded planner envelope.

package/skills/generate-eval/SKILL.md

@@ -0,0 +1,60 @@
+---
+name: generate-eval
+description: Author ONE execution-certifiable, search-discriminating eval task for a given target (library@version, repo, or release-notes URL). The runtime certifies — your job is to produce a candidate that survives both gates.
+---
+
+# generate-eval — author a certifiable eval task
+
+You are authoring a benchmark task that measures whether web search helps a
+coding agent get a **current API detail exactly right**. Your candidate is
+admitted only if an independent certifier confirms BOTH gates:
+
+1. **Grounding** — your reference solution executes and passes in a clean
+   workspace against the real pinned target (the library is the oracle, not
+   your memory).
+2. **Discrimination** — a strong model WITHOUT search fails your oracle (a
+   task models already know measures nothing).
+
+## Inputs
+
+- `TARGET` — a library + version (`hono@4.6`), a repo, or a release-notes URL.
+- `OUT` — the file path where you write exactly one candidate JSON object.
+
+## Procedure
+
+1. **Find the discriminating detail.** Use web search on the target's release
+   notes / changelog / current docs. Pick ONE precise, recent-or-niche detail:
+   an exact method name, option key, config field, or flag — ideally one where
+   the *plausible wrong guess* is specific (e.g. models guess `maxRetries`
+   where the real key is `limit`). Record the primary-doc URL.
+2. **Author the task** as JSON with `schemaVersion: 1` and fields:
+   - `id` (kebab-case), `domain`, `prompt` — ask for the exact identifiers and
+     a minimal runnable usage; the answer must be gradable from its TEXT.
+   - `needsFreshDocs` — the specific fact + the wrong guess models make.
+   - `oracle` — `containsAll`: distinctive exact identifiers a correct answer
+     must contain (specific enough that a wrong answer can't contain them by
+     accident); `notContains`: the plausible wrong/deprecated forms; optional
+     `regex` for structure. No generic words.
+   - `searchQuery`, `expectedUrlIncludes`, `sourceUrl` — retrieval provenance.
+   - `setup` — commands that provision a CLEAN workspace and PIN the target
+     (`npm init -y`, `npm i hono@4.6.3` / `pip install pkg==x.y`). The
+     certifier replays these from scratch.
+   - `reference` — `files` (minimal code exercising the detail against the
+     real installed target) + `cmd` (exits 0 only when the API is used
+     correctly) + `stdoutContains` (print a value derived from the real API
+     call, so an empty no-op can't pass).
+3. **Self-check before emitting** (you have a shell — use it):
+   - Run `setup` + `reference.cmd` yourself; fix until they pass.
+   - Write the correct answer to your own prompt; confirm every
+     `containsAll` string appears in it and none of `notContains` does.
+   - Write the *plausible wrong* answer; confirm the oracle FAILS it.
+4. **Emit** exactly one JSON object to `OUT`. No prose around it.
+
+## Hard rules
+
+- **Never mock or stub the target.** The reference must import and exercise
+  the real installed library. A mocked reference is a void candidate.
+- Expect repair feedback: the certifier returns gate diagnostics (compile
+  errors, oracle misses). Iterating is normal — fix and re-emit.
+- One candidate per invocation. Quality over quantity: a rejected candidate
+  costs a full certification cycle.

package/dist/chunk-3HMHSN22.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/profiles/coder.ts"],"sourcesContent":["/**\n * @experimental\n *\n * `coderProfile` — opinionated preset for code-modification tasks.\n *\n * The agent is told to:\n *   - work on a fresh branch inside the sandbox workspace\n *   - keep the patch minimal (under `maxDiffLines`)\n *   - avoid `forbiddenPaths`\n *   - run `testCmd` and `typecheckCmd`\n *   - emit a final JSON result the output adapter parses\n *\n * The profile is stateless and agent-agnostic — `harness` selects the\n * sandbox-SDK backend (`claude-code`, `codex`, `opencode/*`). For\n * heterogeneous fanout, use `multiHarnessCoderFanout`.\n */\n\nimport type { AgentProfile, SandboxEvent } from '@tangle-network/sandbox'\nimport { createFanoutVoteDriver } from '../loops/drivers/fanout-vote'\nimport type { AgentRunSpec, DefaultVerdict, Driver, OutputAdapter, Validator } from '../loops/types'\n\nconst DEFAULT_MAX_DIFF_LINES = 400\n\n/** @experimental */\nexport interface CoderTask {\n  /** What the agent must accomplish. Free-form prose. */\n  goal: string\n  /** Absolute path inside the sandbox where the repo lives. */\n  repoRoot: string\n  /** Default `main`. The branch the agent diffs against. */\n  baseBranch?: string\n  /** Default `pnpm test --run`. */\n  testCmd?: string\n  /** Default `pnpm typecheck`. */\n  typecheckCmd?: string\n  /** Files the agent may inspect for context. Surfaced verbatim in the prompt. */\n  contextFiles?: string[]\n  /**\n   * Paths the agent must not touch. Validator hard-fails on any match.\n   * Use glob-free literal path prefixes for unambiguous enforcement.\n   */\n  forbiddenPaths?: string[]\n  /** Default 400. Hard cap; validator hard-fails when exceeded. */\n  maxDiffLines?: number\n}\n\n/** @experimental */\nexport interface CoderOutput {\n  /** Branch the agent wrote the patch on. */\n  branch: string\n  /** Unified diff (`git diff <base>..HEAD`). */\n  patch: string\n  testResult: { passed: boolean; output: string }\n  typecheckResult: { passed: boolean; output: string }\n  diffStats: { filesChanged: number; insertions: number; deletions: number }\n  /** Optional reviewer commentary surfaced by the agent. */\n  reviewerNotes?: string\n}\n\n/** @experimental */\nexport interface CoderProfileOptions {\n  /** Sandbox-SDK backend.type. Default `'claude-code'`. */\n  harness?: string\n  /** Default model id passed in `AgentProfile.model.default`. */\n  model?: string\n  /** Custom system prompt replacement. Default = built-in coder preset. */\n  systemPrompt?: string\n  /** Stable name for `AgentRunSpec.name`. Default = `coder-${harness}`. */\n  name?: string\n}\n\n/**\n * Build a coder preset.\n *\n * `validator` enforces test + typecheck + a 400-line default diff cap. For\n * per-task `forbiddenPaths` / `maxDiffLines` enforcement, pass `task` here\n * — the returned validator closes over its constraints. Without a task\n * the validator falls back to the default cap and skips path enforcement.\n *\n * @experimental\n */\nexport function coderProfile(options: CoderProfileOptions & { task?: CoderTask } = {}): {\n  profile: AgentProfile\n  taskToPrompt: (task: CoderTask) => string\n  output: OutputAdapter<CoderOutput>\n  validator: Validator<CoderOutput>\n  agentRunSpec: AgentRunSpec<CoderTask>\n} {\n  const harness = options.harness ?? 'claude-code'\n  const name = options.name ?? `coder-${harness}`\n  const systemPrompt = options.systemPrompt ?? DEFAULT_CODER_SYSTEM_PROMPT\n  const profile: AgentProfile = {\n    name,\n    description: 'Code-modification agent. Minimal-diff worktree-based coder.',\n    prompt: { systemPrompt },\n    model: options.model ? { default: options.model } : undefined,\n    tools: { git: true, fs: true, shell: true, test_runner: true },\n    metadata: { backendType: harness, role: 'coder' },\n  }\n  const output: OutputAdapter<CoderOutput> = { parse: parseCoderEvents }\n  const validator: Validator<CoderOutput> = options.task\n    ? createCoderValidator(options.task)\n    : createCoderValidator({\n        goal: '',\n        repoRoot: '',\n        forbiddenPaths: [],\n        maxDiffLines: DEFAULT_MAX_DIFF_LINES,\n      })\n  const agentRunSpec: AgentRunSpec<CoderTask> = {\n    name,\n    profile,\n    taskToPrompt: formatCoderPrompt,\n  }\n  return { profile, taskToPrompt: formatCoderPrompt, output, validator, agentRunSpec }\n}\n\n/** @experimental */\nexport interface MultiHarnessCoderFanoutOptions {\n  /**\n   * Sandbox-SDK backend.type identifiers, one per parallel agent. Default:\n   * `['claude-code', 'codex', 'opencode/zai-coding-plan/glm-5.1']`.\n   */\n  harnesses?: string[]\n  /** Optional per-harness model override. Indexed parallel to `harnesses`. */\n  models?: (string | undefined)[]\n}\n\n/** @experimental */\nexport function multiHarnessCoderFanout(options: MultiHarnessCoderFanoutOptions = {}): {\n  agentRuns: AgentRunSpec<CoderTask>[]\n  output: OutputAdapter<CoderOutput>\n  validator: Validator<CoderOutput>\n  driver: Driver<CoderTask, CoderOutput, 'pick-winner' | 'fail'>\n} {\n  const harnesses =\n    options.harnesses && options.harnesses.length > 0\n      ? options.harnesses\n      : ['claude-code', 'codex', 'opencode/zai-coding-plan/glm-5.1']\n  const models = options.models ?? []\n  const agentRuns = harnesses.map((harness, i) => {\n    const { agentRunSpec } = coderProfile({ harness, model: models[i] })\n    return agentRunSpec\n  })\n  const { output, validator } = coderProfile()\n  const driver = createFanoutVoteDriver<CoderTask, CoderOutput>({ n: harnesses.length })\n  return { agentRuns, output, validator, driver }\n}\n\nconst DEFAULT_CODER_SYSTEM_PROMPT = [\n  'You are a coder agent operating inside an isolated sandbox workspace.',\n  'Your job is to deliver a minimal, correct patch for the user-supplied goal.',\n  '',\n  'Hard rules:',\n  '  1. Work on a fresh branch off the supplied base. Do not mutate the base branch.',\n  '  2. Never touch a forbidden path. The user will list them explicitly.',\n  '  3. Keep the diff under the max-diff cap. Prefer the smallest change that ships.',\n  '  4. Run the supplied test and typecheck commands before declaring done.',\n  '  5. If either command fails, fix the cause — do not weaken the test or hide the error.',\n  '',\n  'When you finish, emit a single final structured message of the shape:',\n  '  ```json',\n  '  { \"branch\": \"<branch-name>\",',\n  '    \"patch\": \"<unified-diff>\",',\n  '    \"testResult\": { \"passed\": <bool>, \"output\": \"<stdout/stderr>\" },',\n  '    \"typecheckResult\": { \"passed\": <bool>, \"output\": \"<stdout/stderr>\" },',\n  '    \"diffStats\": { \"filesChanged\": <int>, \"insertions\": <int>, \"deletions\": <int> },',\n  '    \"reviewerNotes\": \"<optional commentary>\" }',\n  '  ```',\n].join('\\n')\n\nfunction formatCoderPrompt(task: CoderTask): string {\n  const base = task.baseBranch ?? 'main'\n  const testCmd = task.testCmd ?? 'pnpm test --run'\n  const typecheckCmd = task.typecheckCmd ?? 'pnpm typecheck'\n  const maxDiff = task.maxDiffLines ?? DEFAULT_MAX_DIFF_LINES\n  const forbidden = task.forbiddenPaths?.length ? task.forbiddenPaths.join(', ') : '(none)'\n  const context = task.contextFiles?.length\n    ? task.contextFiles.map((f) => `  - ${f}`).join('\\n')\n    : '  (none)'\n  return [\n    `Goal: ${task.goal}`,\n    `Repo: ${task.repoRoot}`,\n    `Base branch: ${base}`,\n    `Run tests with: ${testCmd}`,\n    `Run typecheck with: ${typecheckCmd}`,\n    `Forbidden paths: ${forbidden}`,\n    `Max diff lines: ${maxDiff}`,\n    'Context files:',\n    context,\n    '',\n    'Produce a minimal patch on a fresh branch. Run tests and typecheck before',\n    'returning. Emit the final JSON result block exactly as instructed.',\n  ].join('\\n')\n}\n\n/**\n * Walk the event stream and return the last structured `coder.result` payload.\n *\n * The agent is instructed to emit a JSON block; in practice the sandbox SDK\n * lifts the structured payload onto `data.result` of a `result` / `final`\n * event. When the event stream does not contain a structured result, the\n * adapter scans text deltas for a fenced JSON block matching the expected\n * keys. Both shapes converge on `CoderOutput`.\n */\nfunction parseCoderEvents(events: SandboxEvent[]): CoderOutput {\n  for (let i = events.length - 1; i >= 0; i -= 1) {\n    const event = events[i]\n    if (!event) continue\n    const type = String(event.type ?? '')\n    const data = isRecord(event.data) ? event.data : {}\n    if (type === 'result' || type === 'final' || type === 'coder.result') {\n      const direct = coerceCoderOutput(data.result ?? data.output ?? data)\n      if (direct) return direct\n    }\n  }\n  // Fallback: scan text deltas in reverse for a fenced JSON block.\n  for (let i = events.length - 1; i >= 0; i -= 1) {\n    const event = events[i]\n    if (!event) continue\n    const data = isRecord(event.data) ? event.data : {}\n    const text = pickString(data.text) ?? pickString(data.delta)\n    if (!text) continue\n    const fenced = extractFencedJson(text)\n    if (!fenced) continue\n    const coerced = coerceCoderOutput(fenced)\n    if (coerced) return coerced\n  }\n  return {\n    branch: '',\n    patch: '',\n    testResult: { passed: false, output: '' },\n    typecheckResult: { passed: false, output: '' },\n    diffStats: { filesChanged: 0, insertions: 0, deletions: 0 },\n  }\n}\n\n/**\n * Build a validator that closes over a specific `CoderTask`'s constraints.\n *\n * Checks in order:\n *   1. Forbidden-path: any `+++` / `---` header in the patch matching a\n *      path prefix in `task.forbiddenPaths` fails hard.\n *   2. Diff size: line count above `task.maxDiffLines` (default 400) fails\n *      hard; below cap, the score shrinks linearly.\n *   3. Tests: `output.testResult.passed` must be `true`.\n *   4. Typecheck: `output.typecheckResult.passed` must be `true`.\n *\n * Aggregate score: `0.5 * tests + 0.3 * typecheck + 0.2 * (1 - diffLines/maxDiff)`.\n * `valid` is the conjunction of all four.\n *\n * @experimental\n */\n/**\n * Default-on safety floor (folded from the ai-trading-blueprint delegation\n * MCP): a coder patch that touches a credential-shaped path is rejected\n * regardless of `forbiddenPaths` config. Catches `.env`, private keys,\n * keystores, wallets, and the common secret/credential JSON files.\n */\nconst SECRET_PATH_RE =\n  /(^|\\/)(\\.env(\\.|$)|.*\\.(pem|key|p12|pfx|keystore|wallet)|id_rsa|id_ed25519|secrets?\\.json|credentials?\\.json)$/i\n\nexport function createCoderValidator(task: CoderTask): Validator<CoderOutput> {\n  const maxDiff = task.maxDiffLines ?? DEFAULT_MAX_DIFF_LINES\n  const forbidden = task.forbiddenPaths ?? []\n  return {\n    async validate(output) {\n      const scores: Record<string, number> = {}\n      const notes: string[] = []\n      let pass = true\n\n      const touched = touchedPathsFromPatch(output.patch)\n\n      // No-op rejection: an empty patch can trivially \"pass\" tests/typecheck\n      // (nothing changed) yet does no work — never a valid coder result.\n      if (touched.length === 0 || output.patch.trim().length === 0) {\n        pass = false\n        scores.nonEmpty = 0\n        notes.push('empty patch — no files changed')\n      } else {\n        scores.nonEmpty = 1\n      }\n\n      // Secret-path floor: always-on, independent of `forbiddenPaths`.\n      const touchedSecrets = touched.filter((p) => SECRET_PATH_RE.test(p))\n      if (touchedSecrets.length > 0) {\n        pass = false\n        scores.noSecrets = 0\n        notes.push(`touched secret-shaped paths: ${touchedSecrets.join(', ')}`)\n      } else {\n        scores.noSecrets = 1\n      }\n\n      const touchedForbidden = forbidden.filter((path) => {\n        const prefix = path.endsWith('/') ? path : `${path}/`\n        const exact = prefix.slice(0, -1)\n        return touched.some((p) => p === exact || p.startsWith(prefix))\n      })\n      if (touchedForbidden.length > 0) {\n        pass = false\n        scores.forbiddenPath = 0\n        notes.push(`touched forbidden paths: ${touchedForbidden.join(', ')}`)\n      } else {\n        scores.forbiddenPath = 1\n      }\n\n      const diffLines = countDiffLines(output.patch)\n      if (diffLines > maxDiff) {\n        pass = false\n        scores.diffSize = 0\n        notes.push(`diff ${diffLines} lines exceeds cap ${maxDiff}`)\n      } else {\n        scores.diffSize = maxDiff === 0 ? 0 : Math.max(0, 1 - diffLines / maxDiff)\n      }\n\n      scores.tests = output.testResult.passed ? 1 : 0\n      scores.typecheck = output.typecheckResult.passed ? 1 : 0\n      if (!output.testResult.passed) {\n        pass = false\n        notes.push('tests failed')\n      }\n      if (!output.typecheckResult.passed) {\n        pass = false\n        notes.push('typecheck failed')\n      }\n\n      const score = 0.5 * scores.tests + 0.3 * scores.typecheck + 0.2 * scores.diffSize\n      const verdict: DefaultVerdict = {\n        valid: pass,\n        score: Number.isFinite(score) ? score : 0,\n        scores,\n      }\n      if (notes.length > 0) verdict.notes = notes.join('; ')\n      return verdict\n    },\n  }\n}\n\nfunction touchedPathsFromPatch(patch: string): string[] {\n  const out = new Set<string>()\n  for (const line of patch.split(/\\r?\\n/)) {\n    if (line.startsWith('+++ ') || line.startsWith('--- ')) {\n      const rest = line.slice(4).trim()\n      if (rest === '/dev/null') continue\n      const stripped = rest.startsWith('a/') || rest.startsWith('b/') ? rest.slice(2) : rest\n      out.add(stripped)\n    }\n  }\n  return [...out]\n}\n\nfunction countDiffLines(patch: string): number {\n  let count = 0\n  for (const line of patch.split(/\\r?\\n/)) {\n    if (\n      (line.startsWith('+') || line.startsWith('-')) &&\n      !line.startsWith('+++') &&\n      !line.startsWith('---')\n    ) {\n      count += 1\n    }\n  }\n  return count\n}\n\nfunction isRecord(value: unknown): value is Record<string, unknown> {\n  return value !== null && typeof value === 'object' && !Array.isArray(value)\n}\n\nfunction pickString(value: unknown): string | undefined {\n  return typeof value === 'string' && value.length > 0 ? value : undefined\n}\n\nfunction extractFencedJson(text: string): unknown | undefined {\n  const match = text.match(/```(?:json)?\\s*([\\s\\S]*?)```/i)\n  if (!match) return undefined\n  const body = (match[1] ?? '').trim()\n  if (!body) return undefined\n  try {\n    return JSON.parse(body)\n  } catch {\n    return undefined\n  }\n}\n\nfunction coerceCoderOutput(value: unknown): CoderOutput | undefined {\n  if (!isRecord(value)) return undefined\n  const branch = pickString(value.branch)\n  const patch = pickString(value.patch) ?? ''\n  if (branch === undefined) return undefined\n  const testResult = coerceCmdResult(value.testResult)\n  const typecheckResult = coerceCmdResult(value.typecheckResult)\n  const diffStats = coerceDiffStats(value.diffStats)\n  return {\n    branch,\n    patch,\n    testResult,\n    typecheckResult,\n    diffStats,\n    reviewerNotes: pickString(value.reviewerNotes),\n  }\n}\n\nfunction coerceCmdResult(value: unknown): { passed: boolean; output: string } {\n  if (!isRecord(value)) return { passed: false, output: '' }\n  return {\n    passed: value.passed === true,\n    output: pickString(value.output) ?? '',\n  }\n}\n\nfunction coerceDiffStats(value: unknown): {\n  filesChanged: number\n  insertions: number\n  deletions: number\n} {\n  if (!isRecord(value)) return { filesChanged: 0, insertions: 0, deletions: 0 }\n  return {\n    filesChanged: toFiniteInt(value.filesChanged),\n    insertions: toFiniteInt(value.insertions),\n    deletions: toFiniteInt(value.deletions),\n  }\n}\n\nfunction toFiniteInt(value: unknown): number {\n  if (typeof value !== 'number') return 0\n  if (!Number.isFinite(value)) return 0\n  return Math.max(0, Math.trunc(value))\n}\n"],"mappings":";;;;;AAqBA,IAAM,yBAAyB;AA4DxB,SAAS,aAAa,UAAsD,CAAC,GAMlF;AACA,QAAM,UAAU,QAAQ,WAAW;AACnC,QAAM,OAAO,QAAQ,QAAQ,SAAS,OAAO;AAC7C,QAAM,eAAe,QAAQ,gBAAgB;AAC7C,QAAM,UAAwB;AAAA,IAC5B;AAAA,IACA,aAAa;AAAA,IACb,QAAQ,EAAE,aAAa;AAAA,IACvB,OAAO,QAAQ,QAAQ,EAAE,SAAS,QAAQ,MAAM,IAAI;AAAA,IACpD,OAAO,EAAE,KAAK,MAAM,IAAI,MAAM,OAAO,MAAM,aAAa,KAAK;AAAA,IAC7D,UAAU,EAAE,aAAa,SAAS,MAAM,QAAQ;AAAA,EAClD;AACA,QAAM,SAAqC,EAAE,OAAO,iBAAiB;AACrE,QAAM,YAAoC,QAAQ,OAC9C,qBAAqB,QAAQ,IAAI,IACjC,qBAAqB;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,gBAAgB,CAAC;AAAA,IACjB,cAAc;AAAA,EAChB,CAAC;AACL,QAAM,eAAwC;AAAA,IAC5C;AAAA,IACA;AAAA,IACA,cAAc;AAAA,EAChB;AACA,SAAO,EAAE,SAAS,cAAc,mBAAmB,QAAQ,WAAW,aAAa;AACrF;AAcO,SAAS,wBAAwB,UAA0C,CAAC,GAKjF;AACA,QAAM,YACJ,QAAQ,aAAa,QAAQ,UAAU,SAAS,IAC5C,QAAQ,YACR,CAAC,eAAe,SAAS,kCAAkC;AACjE,QAAM,SAAS,QAAQ,UAAU,CAAC;AAClC,QAAM,YAAY,UAAU,IAAI,CAAC,SAAS,MAAM;AAC9C,UAAM,EAAE,aAAa,IAAI,aAAa,EAAE,SAAS,OAAO,OAAO,CAAC,EAAE,CAAC;AACnE,WAAO;AAAA,EACT,CAAC;AACD,QAAM,EAAE,QAAQ,UAAU,IAAI,aAAa;AAC3C,QAAM,SAAS,uBAA+C,EAAE,GAAG,UAAU,OAAO,CAAC;AACrF,SAAO,EAAE,WAAW,QAAQ,WAAW,OAAO;AAChD;AAEA,IAAM,8BAA8B;AAAA,EAClC;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,EAAE,KAAK,IAAI;AAEX,SAAS,kBAAkB,MAAyB;AAClD,QAAM,OAAO,KAAK,cAAc;AAChC,QAAM,UAAU,KAAK,WAAW;AAChC,QAAM,eAAe,KAAK,gBAAgB;AAC1C,QAAM,UAAU,KAAK,gBAAgB;AACrC,QAAM,YAAY,KAAK,gBAAgB,SAAS,KAAK,eAAe,KAAK,IAAI,IAAI;AACjF,QAAM,UAAU,KAAK,cAAc,SAC/B,KAAK,aAAa,IAAI,CAAC,MAAM,OAAO,CAAC,EAAE,EAAE,KAAK,IAAI,IAClD;AACJ,SAAO;AAAA,IACL,SAAS,KAAK,IAAI;AAAA,IAClB,SAAS,KAAK,QAAQ;AAAA,IACtB,gBAAgB,IAAI;AAAA,IACpB,mBAAmB,OAAO;AAAA,IAC1B,uBAAuB,YAAY;AAAA,IACnC,oBAAoB,SAAS;AAAA,IAC7B,mBAAmB,OAAO;AAAA,IAC1B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,EAAE,KAAK,IAAI;AACb;AAWA,SAAS,iBAAiB,QAAqC;AAC7D,WAAS,IAAI,OAAO,SAAS,GAAG,KAAK,GAAG,KAAK,GAAG;AAC9C,UAAM,QAAQ,OAAO,CAAC;AACtB,QAAI,CAAC,MAAO;AACZ,UAAM,OAAO,OAAO,MAAM,QAAQ,EAAE;AACpC,UAAM,OAAO,SAAS,MAAM,IAAI,IAAI,MAAM,OAAO,CAAC;AAClD,QAAI,SAAS,YAAY,SAAS,WAAW,SAAS,gBAAgB;AACpE,YAAM,SAAS,kBAAkB,KAAK,UAAU,KAAK,UAAU,IAAI;AACnE,UAAI,OAAQ,QAAO;AAAA,IACrB;AAAA,EACF;AAEA,WAAS,IAAI,OAAO,SAAS,GAAG,KAAK,GAAG,KAAK,GAAG;AAC9C,UAAM,QAAQ,OAAO,CAAC;AACtB,QAAI,CAAC,MAAO;AACZ,UAAM,OAAO,SAAS,MAAM,IAAI,IAAI,MAAM,OAAO,CAAC;AAClD,UAAM,OAAO,WAAW,KAAK,IAAI,KAAK,WAAW,KAAK,KAAK;AAC3D,QAAI,CAAC,KAAM;AACX,UAAM,SAAS,kBAAkB,IAAI;AACrC,QAAI,CAAC,OAAQ;AACb,UAAM,UAAU,kBAAkB,MAAM;AACxC,QAAI,QAAS,QAAO;AAAA,EACtB;AACA,SAAO;AAAA,IACL,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,YAAY,EAAE,QAAQ,OAAO,QAAQ,GAAG;AAAA,IACxC,iBAAiB,EAAE,QAAQ,OAAO,QAAQ,GAAG;AAAA,IAC7C,WAAW,EAAE,cAAc,GAAG,YAAY,GAAG,WAAW,EAAE;AAAA,EAC5D;AACF;AAwBA,IAAM,iBACJ;AAEK,SAAS,qBAAqB,MAAyC;AAC5E,QAAM,UAAU,KAAK,gBAAgB;AACrC,QAAM,YAAY,KAAK,kBAAkB,CAAC;AAC1C,SAAO;AAAA,IACL,MAAM,SAAS,QAAQ;AACrB,YAAM,SAAiC,CAAC;AACxC,YAAM,QAAkB,CAAC;AACzB,UAAI,OAAO;AAEX,YAAM,UAAU,sBAAsB,OAAO,KAAK;AAIlD,UAAI,QAAQ,WAAW,KAAK,OAAO,MAAM,KAAK,EAAE,WAAW,GAAG;AAC5D,eAAO;AACP,eAAO,WAAW;AAClB,cAAM,KAAK,qCAAgC;AAAA,MAC7C,OAAO;AACL,eAAO,WAAW;AAAA,MACpB;AAGA,YAAM,iBAAiB,QAAQ,OAAO,CAAC,MAAM,eAAe,KAAK,CAAC,CAAC;AACnE,UAAI,eAAe,SAAS,GAAG;AAC7B,eAAO;AACP,eAAO,YAAY;AACnB,cAAM,KAAK,gCAAgC,eAAe,KAAK,IAAI,CAAC,EAAE;AAAA,MACxE,OAAO;AACL,eAAO,YAAY;AAAA,MACrB;AAEA,YAAM,mBAAmB,UAAU,OAAO,CAAC,SAAS;AAClD,cAAM,SAAS,KAAK,SAAS,GAAG,IAAI,OAAO,GAAG,IAAI;AAClD,cAAM,QAAQ,OAAO,MAAM,GAAG,EAAE;AAChC,eAAO,QAAQ,KAAK,CAAC,MAAM,MAAM,SAAS,EAAE,WAAW,MAAM,CAAC;AAAA,MAChE,CAAC;AACD,UAAI,iBAAiB,SAAS,GAAG;AAC/B,eAAO;AACP,eAAO,gBAAgB;AACvB,cAAM,KAAK,4BAA4B,iBAAiB,KAAK,IAAI,CAAC,EAAE;AAAA,MACtE,OAAO;AACL,eAAO,gBAAgB;AAAA,MACzB;AAEA,YAAM,YAAY,eAAe,OAAO,KAAK;AAC7C,UAAI,YAAY,SAAS;AACvB,eAAO;AACP,eAAO,WAAW;AAClB,cAAM,KAAK,QAAQ,SAAS,sBAAsB,OAAO,EAAE;AAAA,MAC7D,OAAO;AACL,eAAO,WAAW,YAAY,IAAI,IAAI,KAAK,IAAI,GAAG,IAAI,YAAY,OAAO;AAAA,MAC3E;AAEA,aAAO,QAAQ,OAAO,WAAW,SAAS,IAAI;AAC9C,aAAO,YAAY,OAAO,gBAAgB,SAAS,IAAI;AACvD,UAAI,CAAC,OAAO,WAAW,QAAQ;AAC7B,eAAO;AACP,cAAM,KAAK,cAAc;AAAA,MAC3B;AACA,UAAI,CAAC,OAAO,gBAAgB,QAAQ;AAClC,eAAO;AACP,cAAM,KAAK,kBAAkB;AAAA,MAC/B;AAEA,YAAM,QAAQ,MAAM,OAAO,QAAQ,MAAM,OAAO,YAAY,MAAM,OAAO;AACzE,YAAM,UAA0B;AAAA,QAC9B,OAAO;AAAA,QACP,OAAO,OAAO,SAAS,KAAK,IAAI,QAAQ;AAAA,QACxC;AAAA,MACF;AACA,UAAI,MAAM,SAAS,EAAG,SAAQ,QAAQ,MAAM,KAAK,IAAI;AACrD,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAEA,SAAS,sBAAsB,OAAyB;AACtD,QAAM,MAAM,oBAAI,IAAY;AAC5B,aAAW,QAAQ,MAAM,MAAM,OAAO,GAAG;AACvC,QAAI,KAAK,WAAW,MAAM,KAAK,KAAK,WAAW,MAAM,GAAG;AACtD,YAAM,OAAO,KAAK,MAAM,CAAC,EAAE,KAAK;AAChC,UAAI,SAAS,YAAa;AAC1B,YAAM,WAAW,KAAK,WAAW,IAAI,KAAK,KAAK,WAAW,IAAI,IAAI,KAAK,MAAM,CAAC,IAAI;AAClF,UAAI,IAAI,QAAQ;AAAA,IAClB;AAAA,EACF;AACA,SAAO,CAAC,GAAG,GAAG;AAChB;AAEA,SAAS,eAAe,OAAuB;AAC7C,MAAI,QAAQ;AACZ,aAAW,QAAQ,MAAM,MAAM,OAAO,GAAG;AACvC,SACG,KAAK,WAAW,GAAG,KAAK,KAAK,WAAW,GAAG,MAC5C,CAAC,KAAK,WAAW,KAAK,KACtB,CAAC,KAAK,WAAW,KAAK,GACtB;AACA,eAAS;AAAA,IACX;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,SAAS,OAAkD;AAClE,SAAO,UAAU,QAAQ,OAAO,UAAU,YAAY,CAAC,MAAM,QAAQ,KAAK;AAC5E;AAEA,SAAS,WAAW,OAAoC;AACtD,SAAO,OAAO,UAAU,YAAY,MAAM,SAAS,IAAI,QAAQ;AACjE;AAEA,SAAS,kBAAkB,MAAmC;AAC5D,QAAM,QAAQ,KAAK,MAAM,+BAA+B;AACxD,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,QAAQ,MAAM,CAAC,KAAK,IAAI,KAAK;AACnC,MAAI,CAAC,KAAM,QAAO;AAClB,MAAI;AACF,WAAO,KAAK,MAAM,IAAI;AAAA,EACxB,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,SAAS,kBAAkB,OAAyC;AAClE,MAAI,CAAC,SAAS,KAAK,EAAG,QAAO;AAC7B,QAAM,SAAS,WAAW,MAAM,MAAM;AACtC,QAAM,QAAQ,WAAW,MAAM,KAAK,KAAK;AACzC,MAAI,WAAW,OAAW,QAAO;AACjC,QAAM,aAAa,gBAAgB,MAAM,UAAU;AACnD,QAAM,kBAAkB,gBAAgB,MAAM,eAAe;AAC7D,QAAM,YAAY,gBAAgB,MAAM,SAAS;AACjD,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,eAAe,WAAW,MAAM,aAAa;AAAA,EAC/C;AACF;AAEA,SAAS,gBAAgB,OAAqD;AAC5E,MAAI,CAAC,SAAS,KAAK,EAAG,QAAO,EAAE,QAAQ,OAAO,QAAQ,GAAG;AACzD,SAAO;AAAA,IACL,QAAQ,MAAM,WAAW;AAAA,IACzB,QAAQ,WAAW,MAAM,MAAM,KAAK;AAAA,EACtC;AACF;AAEA,SAAS,gBAAgB,OAIvB;AACA,MAAI,CAAC,SAAS,KAAK,EAAG,QAAO,EAAE,cAAc,GAAG,YAAY,GAAG,WAAW,EAAE;AAC5E,SAAO;AAAA,IACL,cAAc,YAAY,MAAM,YAAY;AAAA,IAC5C,YAAY,YAAY,MAAM,UAAU;AAAA,IACxC,WAAW,YAAY,MAAM,SAAS;AAAA,EACxC;AACF;AAEA,SAAS,YAAY,OAAwB;AAC3C,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,MAAI,CAAC,OAAO,SAAS,KAAK,EAAG,QAAO;AACpC,SAAO,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,CAAC;AACtC;","names":[]}

package/dist/chunk-GFKVVRQ7.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/loop-runner.ts","../src/loop-runner-bin.ts"],"sourcesContent":["/**\n * @experimental\n *\n * `runDelegatedLoop` — the configured delegated loop-runner.\n *\n * One typed entrypoint a worker agent (or a scheduled routine) calls to run a\n * disciplined loop in a chosen MODE, over agent-runtime's hardened engines:\n *\n *   code         → build-in-a-loop via the coder delegate (no-op + secret floor,\n *                  optional reviewer gate, winner-selection)\n *   review       → code mode with a REQUIRED reviewer (the gate is the point)\n *   research     → research-in-a-loop with valid-only KB growth (createKbGate)\n *   audit        → analyze trace/run data → findings (runAnalystLoop, caller-wired)\n *   self-improve → identity-gated prompt optimization (optimizePrompt, caller-wired)\n *   dynamic      → agent-authored topology (runLoop + createDynamicDriver)\n *\n * It is intentionally a thin façade: the value is that EVERY product reuses the\n * one hardened engine instead of forking delegation logic. The dispatcher owns\n * mode routing, timing, fail-loud on an unregistered mode, and a uniform result\n * shape; each mode's engine is a pre-configured runner in the registry (build it\n * with the factories below, or inject your own / a stub).\n */\n\nimport type { Scenario } from '@tangle-network/agent-eval/campaign'\nimport { runAnalystLoop } from './analyst-loop'\nimport type { RunAnalystLoopOpts, RunAnalystLoopResult } from './analyst-loop/types'\nimport { ConfigError } from './errors'\nimport {\n  type OptimizePromptOptions,\n  type OptimizePromptResult,\n  optimizePrompt,\n} from './improvement/optimize-prompt'\nimport {\n  type AgentRunSpec,\n  createDynamicDriver,\n  type DynamicDecision,\n  type LoopResult,\n  type LoopSandboxClient,\n  type OutputAdapter,\n  runLoop,\n  type TopologyPlanner,\n  type Validator,\n} from './loops'\nimport {\n  type CoderReviewer,\n  type CoderWinnerSelection,\n  createDefaultCoderDelegate,\n  type DelegateRunCtx,\n} from './mcp/delegates'\nimport { type CreateKbGateOptions, createKbGate, type FactCandidate } from './mcp/kb-gate'\nimport type { DelegateCodeArgs } from './mcp/types'\nimport type { CoderOutput } from './profiles/coder'\n\n/** @experimental Every delegated-loop mode, for validation + CLI surfaces. */\nexport const DELEGATED_LOOP_MODES = [\n  'code',\n  'review',\n  'research',\n  'audit',\n  'self-improve',\n  'dynamic',\n] as const\n\n/** @experimental */\nexport type DelegatedLoopMode = (typeof DELEGATED_LOOP_MODES)[number]\n\n/** @experimental Type guard for an untrusted mode string (CLI / config input). */\nexport function isDelegatedLoopMode(value: unknown): value is DelegatedLoopMode {\n  return typeof value === 'string' && (DELEGATED_LOOP_MODES as readonly string[]).includes(value)\n}\n\n/** @experimental A pre-configured loop for one mode. Returns the mode's raw\n *  output; the dispatcher wraps it in a {@link DelegatedLoopResult}. */\nexport type DelegatedLoopRunner<T = unknown> = (signal: AbortSignal) => Promise<T>\n\n/** @experimental Mode → configured runner. Partial: only register the modes a\n *  given product/routine actually uses. */\nexport type DelegatedLoopRegistry = Partial<Record<DelegatedLoopMode, DelegatedLoopRunner>>\n\n/** @experimental Uniform result — never throws from a registered runner; a\n *  thrown engine becomes `{ ok: false, error }` so a routine can record + move on. */\nexport interface DelegatedLoopResult<T = unknown> {\n  mode: DelegatedLoopMode\n  ok: boolean\n  output?: T\n  error?: string\n  durationMs: number\n}\n\n/** @experimental */\nexport interface RunDelegatedLoopOptions {\n  signal?: AbortSignal\n  /** Clock override for deterministic tests. */\n  now?: () => number\n}\n\n/**\n * @experimental\n *\n * Dispatch a configured loop by mode. Fails loud (throws `ConfigError`) when no\n * runner is registered for the mode — a routine pointed at an unwired mode is a\n * config bug, not a silent no-op. A runner that throws is captured as\n * `{ ok: false }` so unattended runs record the failure rather than crash.\n */\nexport async function runDelegatedLoop<T = unknown>(\n  mode: DelegatedLoopMode,\n  registry: DelegatedLoopRegistry,\n  options: RunDelegatedLoopOptions = {},\n): Promise<DelegatedLoopResult<T>> {\n  const runner = registry[mode] as DelegatedLoopRunner<T> | undefined\n  if (!runner) {\n    throw new ConfigError(\n      `runDelegatedLoop: no runner registered for mode '${mode}' (registered: ${\n        Object.keys(registry).join(', ') || 'none'\n      })`,\n    )\n  }\n  const now = options.now ?? Date.now\n  const signal = options.signal ?? new AbortController().signal\n  const start = now()\n  try {\n    const output = await runner(signal)\n    return { mode, ok: true, output, durationMs: now() - start }\n  } catch (err) {\n    return {\n      mode,\n      ok: false,\n      error: err instanceof Error ? err.message : String(err),\n      durationMs: now() - start,\n    }\n  }\n}\n\n/** @experimental Options for the default `code`/`review` runner. */\nexport interface CoderLoopRunnerOptions {\n  sandboxClient: LoopSandboxClient\n  /** What to build — the delegate args (goal, repoRoot, variants, config, …). */\n  args: DelegateCodeArgs\n  /** Adversarial reviewer. REQUIRED for `review` mode (see `reviewLoopRunner`). */\n  reviewer?: CoderReviewer\n  /** Winner-selection strategy. Default `highest-score`. */\n  winnerSelection?: CoderWinnerSelection\n  /** Harnesses for `variants > 1` fanout. */\n  fanoutHarnesses?: string[]\n}\n\n/** @experimental Build a `code`-mode runner over the hardened coder delegate. */\nexport function coderLoopRunner(options: CoderLoopRunnerOptions): DelegatedLoopRunner<CoderOutput> {\n  const delegate = createDefaultCoderDelegate({\n    sandboxClient: options.sandboxClient,\n    ...(options.reviewer ? { reviewer: options.reviewer } : {}),\n    ...(options.winnerSelection ? { winnerSelection: options.winnerSelection } : {}),\n    ...(options.fanoutHarnesses ? { fanoutHarnesses: options.fanoutHarnesses } : {}),\n  })\n  return async (signal) => {\n    const ctx: DelegateRunCtx = { signal, report: () => {} }\n    return delegate(options.args, ctx)\n  }\n}\n\n/**\n * @experimental\n *\n * `review` mode = `code` with a REQUIRED reviewer. The gate is the whole point,\n * so the type forces a reviewer (a \"review loop\" with no reviewer is a code loop).\n */\nexport function reviewLoopRunner(\n  options: CoderLoopRunnerOptions & { reviewer: CoderReviewer },\n): DelegatedLoopRunner<CoderOutput> {\n  return coderLoopRunner(options)\n}\n\n/** @experimental Options for the default `dynamic` runner. */\nexport interface DynamicLoopRunnerOptions<Task, Output> {\n  sandboxClient: LoopSandboxClient\n  /** The agent-authored topology planner (e.g. `createSandboxPlanner(...)`). */\n  planner: TopologyPlanner<Task, Output>\n  task: Task\n  output: OutputAdapter<Output>\n  validator?: Validator<Output>\n  /** Exactly one of `agentRun` / `agentRuns` (runLoop validates). */\n  agentRun?: AgentRunSpec<Task>\n  agentRuns?: AgentRunSpec<Task>[]\n  maxIterations?: number\n  maxFanout?: number\n}\n\n/** @experimental `dynamic` mode — agent-authored topology over `runLoop`. */\nexport function dynamicLoopRunner<Task, Output>(\n  o: DynamicLoopRunnerOptions<Task, Output>,\n): DelegatedLoopRunner<LoopResult<Task, Output, DynamicDecision>> {\n  return async (signal) =>\n    runLoop<Task, Output, DynamicDecision>({\n      driver: createDynamicDriver<Task, Output>({\n        planner: o.planner,\n        ...(o.maxIterations !== undefined ? { maxIterations: o.maxIterations } : {}),\n        ...(o.maxFanout !== undefined ? { maxFanout: o.maxFanout } : {}),\n      }),\n      ...(o.agentRun ? { agentRun: o.agentRun } : {}),\n      ...(o.agentRuns ? { agentRuns: o.agentRuns } : {}),\n      output: o.output,\n      ...(o.validator ? { validator: o.validator } : {}),\n      task: o.task,\n      ctx: { sandboxClient: o.sandboxClient, signal },\n      ...(o.maxIterations !== undefined ? { maxIterations: o.maxIterations } : {}),\n    })\n}\n\n/** @experimental A fact rejected at the KB gate — surfaced, never dropped. */\nexport interface VetoedFact {\n  candidate: FactCandidate\n  vetoedBy?: string\n  reason?: string\n}\n\n/** @experimental */\nexport interface ResearchLoopResult {\n  /** Facts that passed the fail-closed gate — safe to write to the KB. */\n  accepted: FactCandidate[]\n  /** Facts the gate vetoed in the final round — escalate, do not silently drop. */\n  vetoed: VetoedFact[]\n  /** Research rounds actually run. */\n  rounds: number\n}\n\n/** @experimental Options for the default `research` runner. */\nexport interface ResearchLoopRunnerOptions {\n  /**\n   * The research engine (the consumer's web/doc searcher + extractor). Called\n   * each round with the prior round's vetoes so it can re-research the gaps.\n   * Returns fact candidates carrying their grounding (`verbatimPassage` +\n   * `sourceText`).\n   */\n  research: (round: number, vetoed: VetoedFact[]) => Promise<FactCandidate[]>\n  /** Gate config (extra judges, self-artifact kinds, …). The floor is always on. */\n  gate?: CreateKbGateOptions\n  /** Max research rounds (correct-on-veto remediation). Default 1. */\n  maxRounds?: number\n}\n\n/**\n * @experimental `research` mode — research-in-a-loop with valid-only KB growth.\n *\n * Each round: research → gate every candidate (fail-closed; passage MUST be in\n * the source) → accept the clean ones → re-research the vetoed ones next round,\n * up to `maxRounds`. Vetoed facts in the final round are RETURNED (escalate,\n * never silently dropped) so the caller audits vs retries.\n */\nexport function researchLoopRunner(\n  o: ResearchLoopRunnerOptions,\n): DelegatedLoopRunner<ResearchLoopResult> {\n  const gate = createKbGate(o.gate)\n  const maxRounds = Math.max(1, Math.trunc(o.maxRounds ?? 1))\n  return async (signal) => {\n    const accepted: FactCandidate[] = []\n    let vetoed: VetoedFact[] = []\n    let rounds = 0\n    for (let round = 0; round < maxRounds; round += 1) {\n      if (signal.aborted) break\n      rounds += 1\n      const candidates = await o.research(round, vetoed)\n      if (candidates.length === 0) break\n      vetoed = []\n      for (const c of candidates) {\n        const v = await gate(c)\n        if (v.accepted) accepted.push(c)\n        else vetoed.push({ candidate: c, vetoedBy: v.vetoedBy, reason: v.reason })\n      }\n      if (vetoed.length === 0) break\n    }\n    return { accepted, vetoed, rounds }\n  }\n}\n\n/** @experimental `self-improve` mode — identity-gated prompt optimization. */\nexport function selfImproveLoopRunner<TScenario extends Scenario, TArtifact>(\n  options: OptimizePromptOptions<TScenario, TArtifact>,\n): DelegatedLoopRunner<OptimizePromptResult<TArtifact, TScenario>> {\n  return async () => optimizePrompt<TScenario, TArtifact>(options)\n}\n\n/** @experimental `audit` mode — analyst loop over captured trace/run data. */\nexport function auditLoopRunner<TProposal = unknown, TEdit = unknown>(\n  options: RunAnalystLoopOpts,\n): DelegatedLoopRunner<RunAnalystLoopResult<TProposal, TEdit>> {\n  return async () => runAnalystLoop<TProposal, TEdit>(options)\n}\n","#!/usr/bin/env node\n/**\n * @experimental\n *\n * `agent-runtime-loop` — the schedulable entrypoint for the configured\n * delegated loop-runner. A cron job / routine / Makefile target invokes:\n *\n *   agent-runtime-loop --mode research --config ./loops.config.js\n *\n * The config module wires the registry (with full access to env / creds —\n * which is why the deps live there, not in this generic bin). It must default-\n * export a `DelegatedLoopRegistry`, or a `() => DelegatedLoopRegistry | Promise<…>`.\n * The bin runs the selected mode, prints the `DelegatedLoopResult` as JSON, and\n * exits 0 on `ok`, 1 on a recorded failure, 2 on a usage/config error.\n */\n\nimport {\n  DELEGATED_LOOP_MODES,\n  type DelegatedLoopMode,\n  type DelegatedLoopRegistry,\n  type DelegatedLoopResult,\n  isDelegatedLoopMode,\n  runDelegatedLoop,\n} from './loop-runner'\n\n/** @experimental Parsed CLI invocation. */\nexport interface LoopRunnerCliArgs {\n  mode: string\n  /** Loads the registry — the bin wires this from `--config`; tests inject a stub. */\n  loadRegistry: () => Promise<DelegatedLoopRegistry> | DelegatedLoopRegistry\n  now?: () => number\n}\n\n/** @experimental */\nexport interface LoopRunnerCliResult {\n  exitCode: number\n  result?: DelegatedLoopResult\n  error?: string\n}\n\n/**\n * @experimental\n *\n * Pure CLI core (no process / argv / IO) so it's unit-testable: validate the\n * mode, load the registry, dispatch, map to an exit code (0 ok / 1 failed /\n * 2 usage). Exported for embedding in custom runners + tests.\n */\nexport async function runLoopRunnerCli(args: LoopRunnerCliArgs): Promise<LoopRunnerCliResult> {\n  if (!isDelegatedLoopMode(args.mode)) {\n    return {\n      exitCode: 2,\n      error: `unknown mode '${args.mode}' (expected one of: ${DELEGATED_LOOP_MODES.join(', ')})`,\n    }\n  }\n  let registry: DelegatedLoopRegistry\n  try {\n    registry = await args.loadRegistry()\n  } catch (err) {\n    return { exitCode: 2, error: `failed to load registry: ${errMsg(err)}` }\n  }\n  if (!registry[args.mode]) {\n    return {\n      exitCode: 2,\n      error: `config registers no runner for mode '${args.mode}' (registered: ${\n        Object.keys(registry).join(', ') || 'none'\n      })`,\n    }\n  }\n  // runDelegatedLoop throws only on a missing runner (guarded above); a failing\n  // engine is captured as { ok: false } → exit 1, not a crash.\n  const result = await runDelegatedLoop(args.mode as DelegatedLoopMode, registry, {\n    ...(args.now ? { now: args.now } : {}),\n  })\n  return { exitCode: result.ok ? 0 : 1, result }\n}\n\n/** Parse `--mode X --config Y` from an argv tail (`process.argv.slice(2)`). */\nexport function parseLoopRunnerArgv(argv: string[]): { mode?: string; config?: string } {\n  const out: { mode?: string; config?: string } = {}\n  for (let i = 0; i < argv.length; i += 1) {\n    const a = argv[i]\n    if (a === '--mode') out.mode = argv[++i]\n    else if (a === '--config') out.config = argv[++i]\n    else if (a?.startsWith('--mode=')) out.mode = a.slice('--mode='.length)\n    else if (a?.startsWith('--config=')) out.config = a.slice('--config='.length)\n  }\n  return out\n}\n\n/** Normalize a config module's default export → a registry. */\nfunction resolveRegistry(mod: unknown): DelegatedLoopRegistry {\n  const def = (mod as { default?: unknown })?.default ?? mod\n  const value = typeof def === 'function' ? (def as () => unknown)() : def\n  return value as DelegatedLoopRegistry\n}\n\nfunction errMsg(err: unknown): string {\n  return err instanceof Error ? err.message : String(err)\n}\n\n/** The argv → IO → exit shell. Kept thin; logic lives in `runLoopRunnerCli`. */\nasync function main(): Promise<void> {\n  const { mode, config } = parseLoopRunnerArgv(process.argv.slice(2))\n  if (!mode || !config) {\n    process.stderr.write(\n      'usage: agent-runtime-loop --mode <mode> --config <module>\\n' +\n        `  modes: ${DELEGATED_LOOP_MODES.join(' | ')}\\n` +\n        '  config: a JS/TS module default-exporting a DelegatedLoopRegistry (or a factory)\\n',\n    )\n    process.exit(2)\n  }\n  const { pathToFileURL } = await import('node:url')\n  const { resolve } = await import('node:path')\n  const cli = await runLoopRunnerCli({\n    mode,\n    loadRegistry: async () => resolveRegistry(await import(pathToFileURL(resolve(config)).href)),\n  })\n  process.stdout.write(`${JSON.stringify(cli.result ?? { error: cli.error }, null, 2)}\\n`)\n  if (cli.error) process.stderr.write(`${cli.error}\\n`)\n  process.exit(cli.exitCode)\n}\n\n// Run only when executed as the bin — never when imported for the testable\n// core, and never when bundled into a runtime that has no `process.argv`\n// (e.g. Cloudflare Workers, where `process` is a shim without `argv`). Reading\n// `process.argv[1]` directly would throw at module load there; `process.argv?.`\n// keeps the guard a no-op instead of crashing the Worker on startup.\nconst invokedScript = typeof process !== 'undefined' ? process.argv?.[1] : undefined\nif (invokedScript && /loop-runner-bin\\.(js|ts|mjs)$/.test(invokedScript)) {\n  void main()\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAsDO,IAAM,uBAAuB;AAAA,EAClC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAMO,SAAS,oBAAoB,OAA4C;AAC9E,SAAO,OAAO,UAAU,YAAa,qBAA2C,SAAS,KAAK;AAChG;AAmCA,eAAsB,iBACpB,MACA,UACA,UAAmC,CAAC,GACH;AACjC,QAAM,SAAS,SAAS,IAAI;AAC5B,MAAI,CAAC,QAAQ;AACX,UAAM,IAAI;AAAA,MACR,oDAAoD,IAAI,kBACtD,OAAO,KAAK,QAAQ,EAAE,KAAK,IAAI,KAAK,MACtC;AAAA,IACF;AAAA,EACF;AACA,QAAM,MAAM,QAAQ,OAAO,KAAK;AAChC,QAAM,SAAS,QAAQ,UAAU,IAAI,gBAAgB,EAAE;AACvD,QAAM,QAAQ,IAAI;AAClB,MAAI;AACF,UAAM,SAAS,MAAM,OAAO,MAAM;AAClC,WAAO,EAAE,MAAM,IAAI,MAAM,QAAQ,YAAY,IAAI,IAAI,MAAM;AAAA,EAC7D,SAAS,KAAK;AACZ,WAAO;AAAA,MACL;AAAA,MACA,IAAI;AAAA,MACJ,OAAO,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAAA,MACtD,YAAY,IAAI,IAAI;AAAA,IACtB;AAAA,EACF;AACF;AAgBO,SAAS,gBAAgB,SAAmE;AACjG,QAAM,WAAW,2BAA2B;AAAA,IAC1C,eAAe,QAAQ;AAAA,IACvB,GAAI,QAAQ,WAAW,EAAE,UAAU,QAAQ,SAAS,IAAI,CAAC;AAAA,IACzD,GAAI,QAAQ,kBAAkB,EAAE,iBAAiB,QAAQ,gBAAgB,IAAI,CAAC;AAAA,IAC9E,GAAI,QAAQ,kBAAkB,EAAE,iBAAiB,QAAQ,gBAAgB,IAAI,CAAC;AAAA,EAChF,CAAC;AACD,SAAO,OAAO,WAAW;AACvB,UAAM,MAAsB,EAAE,QAAQ,QAAQ,MAAM;AAAA,IAAC,EAAE;AACvD,WAAO,SAAS,QAAQ,MAAM,GAAG;AAAA,EACnC;AACF;AAQO,SAAS,iBACd,SACkC;AAClC,SAAO,gBAAgB,OAAO;AAChC;AAkBO,SAAS,kBACd,GACgE;AAChE,SAAO,OAAO,WACZ,QAAuC;AAAA,IACrC,QAAQ,oBAAkC;AAAA,MACxC,SAAS,EAAE;AAAA,MACX,GAAI,EAAE,kBAAkB,SAAY,EAAE,eAAe,EAAE,cAAc,IAAI,CAAC;AAAA,MAC1E,GAAI,EAAE,cAAc,SAAY,EAAE,WAAW,EAAE,UAAU,IAAI,CAAC;AAAA,IAChE,CAAC;AAAA,IACD,GAAI,EAAE,WAAW,EAAE,UAAU,EAAE,SAAS,IAAI,CAAC;AAAA,IAC7C,GAAI,EAAE,YAAY,EAAE,WAAW,EAAE,UAAU,IAAI,CAAC;AAAA,IAChD,QAAQ,EAAE;AAAA,IACV,GAAI,EAAE,YAAY,EAAE,WAAW,EAAE,UAAU,IAAI,CAAC;AAAA,IAChD,MAAM,EAAE;AAAA,IACR,KAAK,EAAE,eAAe,EAAE,eAAe,OAAO;AAAA,IAC9C,GAAI,EAAE,kBAAkB,SAAY,EAAE,eAAe,EAAE,cAAc,IAAI,CAAC;AAAA,EAC5E,CAAC;AACL;AA0CO,SAAS,mBACd,GACyC;AACzC,QAAM,OAAO,aAAa,EAAE,IAAI;AAChC,QAAM,YAAY,KAAK,IAAI,GAAG,KAAK,MAAM,EAAE,aAAa,CAAC,CAAC;AAC1D,SAAO,OAAO,WAAW;AACvB,UAAM,WAA4B,CAAC;AACnC,QAAI,SAAuB,CAAC;AAC5B,QAAI,SAAS;AACb,aAAS,QAAQ,GAAG,QAAQ,WAAW,SAAS,GAAG;AACjD,UAAI,OAAO,QAAS;AACpB,gBAAU;AACV,YAAM,aAAa,MAAM,EAAE,SAAS,OAAO,MAAM;AACjD,UAAI,WAAW,WAAW,EAAG;AAC7B,eAAS,CAAC;AACV,iBAAW,KAAK,YAAY;AAC1B,cAAM,IAAI,MAAM,KAAK,CAAC;AACtB,YAAI,EAAE,SAAU,UAAS,KAAK,CAAC;AAAA,YAC1B,QAAO,KAAK,EAAE,WAAW,GAAG,UAAU,EAAE,UAAU,QAAQ,EAAE,OAAO,CAAC;AAAA,MAC3E;AACA,UAAI,OAAO,WAAW,EAAG;AAAA,IAC3B;AACA,WAAO,EAAE,UAAU,QAAQ,OAAO;AAAA,EACpC;AACF;AAGO,SAAS,sBACd,SACiE;AACjE,SAAO,YAAY,eAAqC,OAAO;AACjE;AAGO,SAAS,gBACd,SAC6D;AAC7D,SAAO,YAAY,eAAiC,OAAO;AAC7D;;;AC/OA,eAAsB,iBAAiB,MAAuD;AAC5F,MAAI,CAAC,oBAAoB,KAAK,IAAI,GAAG;AACnC,WAAO;AAAA,MACL,UAAU;AAAA,MACV,OAAO,iBAAiB,KAAK,IAAI,uBAAuB,qBAAqB,KAAK,IAAI,CAAC;AAAA,IACzF;AAAA,EACF;AACA,MAAI;AACJ,MAAI;AACF,eAAW,MAAM,KAAK,aAAa;AAAA,EACrC,SAAS,KAAK;AACZ,WAAO,EAAE,UAAU,GAAG,OAAO,4BAA4B,OAAO,GAAG,CAAC,GAAG;AAAA,EACzE;AACA,MAAI,CAAC,SAAS,KAAK,IAAI,GAAG;AACxB,WAAO;AAAA,MACL,UAAU;AAAA,MACV,OAAO,wCAAwC,KAAK,IAAI,kBACtD,OAAO,KAAK,QAAQ,EAAE,KAAK,IAAI,KAAK,MACtC;AAAA,IACF;AAAA,EACF;AAGA,QAAM,SAAS,MAAM,iBAAiB,KAAK,MAA2B,UAAU;AAAA,IAC9E,GAAI,KAAK,MAAM,EAAE,KAAK,KAAK,IAAI,IAAI,CAAC;AAAA,EACtC,CAAC;AACD,SAAO,EAAE,UAAU,OAAO,KAAK,IAAI,GAAG,OAAO;AAC/C;AAGO,SAAS,oBAAoB,MAAoD;AACtF,QAAM,MAA0C,CAAC;AACjD,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,GAAG;AACvC,UAAM,IAAI,KAAK,CAAC;AAChB,QAAI,MAAM,SAAU,KAAI,OAAO,KAAK,EAAE,CAAC;AAAA,aAC9B,MAAM,WAAY,KAAI,SAAS,KAAK,EAAE,CAAC;AAAA,aACvC,GAAG,WAAW,SAAS,EAAG,KAAI,OAAO,EAAE,MAAM,UAAU,MAAM;AAAA,aAC7D,GAAG,WAAW,WAAW,EAAG,KAAI,SAAS,EAAE,MAAM,YAAY,MAAM;AAAA,EAC9E;AACA,SAAO;AACT;AAGA,SAAS,gBAAgB,KAAqC;AAC5D,QAAM,MAAO,KAA+B,WAAW;AACvD,QAAM,QAAQ,OAAO,QAAQ,aAAc,IAAsB,IAAI;AACrE,SAAO;AACT;AAEA,SAAS,OAAO,KAAsB;AACpC,SAAO,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AACxD;AAGA,eAAe,OAAsB;AACnC,QAAM,EAAE,MAAM,OAAO,IAAI,oBAAoB,QAAQ,KAAK,MAAM,CAAC,CAAC;AAClE,MAAI,CAAC,QAAQ,CAAC,QAAQ;AACpB,YAAQ,OAAO;AAAA,MACb;AAAA,WACc,qBAAqB,KAAK,KAAK,CAAC;AAAA;AAAA;AAAA,IAEhD;AACA,YAAQ,KAAK,CAAC;AAAA,EAChB;AACA,QAAM,EAAE,cAAc,IAAI,MAAM,OAAO,KAAU;AACjD,QAAM,EAAE,QAAQ,IAAI,MAAM,OAAO,MAAW;AAC5C,QAAM,MAAM,MAAM,iBAAiB;AAAA,IACjC;AAAA,IACA,cAAc,YAAY,gBAAgB,MAAM,OAAO,cAAc,QAAQ,MAAM,CAAC,EAAE,KAAK;AAAA,EAC7F,CAAC;AACD,UAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,IAAI,UAAU,EAAE,OAAO,IAAI,MAAM,GAAG,MAAM,CAAC,CAAC;AAAA,CAAI;AACvF,MAAI,IAAI,MAAO,SAAQ,OAAO,MAAM,GAAG,IAAI,KAAK;AAAA,CAAI;AACpD,UAAQ,KAAK,IAAI,QAAQ;AAC3B;AAOA,IAAM,gBAAgB,OAAO,YAAY,cAAc,QAAQ,OAAO,CAAC,IAAI;AAC3E,IAAI,iBAAiB,gCAAgC,KAAK,aAAa,GAAG;AACxE,OAAK,KAAK;AACZ;","names":[]}