@tangle-network/agent-runtime 0.45.0 → 0.46.0

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@tangle-network/agent-runtime",
-  "version": "0.45.0",
+  "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": {
@@ -87,18 +87,6 @@
   "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",
-    "typecheck:examples": "tsc --noEmit -p tsconfig.examples.json",
-    "verify:package": "node scripts/verify-package-exports.mjs"
-  },
   "devDependencies": {
     "@biomejs/biome": "^2.4.0",
     "@tangle-network/agent-eval": "^0.83.0",
@@ -109,20 +97,10 @@
     "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.83.0 <1.0.0",
     "@tangle-network/agent-knowledge": ">=1.3.0 <2.0.0",
@@ -139,5 +117,16 @@
     "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

@@ -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 },
 })
 ```

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-FK53TXOP.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/analyst-loop/iterations-to-trace-store.ts","../src/analyst-loop/run-analyst-loop.ts","../src/analyst-loop/analyst-driver-hook.ts"],"sourcesContent":["/**\n * @experimental\n *\n * The read seam that closes the autonomous loop: project a round's `Iteration[]`\n * (each carrying its raw `SandboxEvent[]`) into an in-memory `TraceAnalysisStore`, the\n * read interface the trace analysts query. `runAnalystLoop` has had zero consumers\n * because nothing turned a loop's iterations into a store — this is that bridge.\n *\n * One iteration → one trace. The iteration is the root AGENT span; each `SandboxEvent`\n * becomes a child span (LLM for llm_call events, TOOL for tool events, else SPAN), so an\n * analyst can walk a shot's trace, cluster its errors, and emit findings the driver\n * steers on. Projection is best-effort over the FLAT SandboxEvent shape (no per-event\n * lineage yet — that's the richer-trace gap); it never fabricates — an errored iteration\n * surfaces a real ERROR span carrying the real message.\n */\n\nimport {\n  type DatasetOverview,\n  DEFAULT_TRACE_ANALYST_BUDGETS,\n  type QueryTracesPage,\n  type SearchSpanResult,\n  type SearchTraceResult,\n  type SpanMatchRecord,\n  TRACE_ANALYST_TRUNCATION_MARKER_PREFIX,\n  type TraceAnalysisStore,\n  type TraceAnalystByteBudgets,\n  type TraceAnalystFilters,\n  type TraceAnalystSpan,\n  type TraceAnalystSpanKind,\n  type TraceAnalystTraceSummary,\n  type ViewSpansResult,\n  type ViewTraceResult,\n} from '@tangle-network/agent-eval'\nimport type { SandboxEvent } from '@tangle-network/sandbox'\nimport { AnalystError } from '../errors'\nimport { extractLlmCallEvent } from '../runtime/sandbox-events'\nimport type { Iteration } from '../runtime/types'\n\n/** ErrorCluster isn't re-exported from the agent-eval root; derive it from the overview. */\ntype ErrorCluster = DatasetOverview['error_clusters'][number]\n\ninterface ProjectedTrace {\n  summary: TraceAnalystTraceSummary\n  spans: TraceAnalystSpan[]\n  /** raw JSONL bytes of this trace's spans — the byte-budget accounting unit. */\n  rawBytes: number\n}\n\nconst bytesOf = (v: unknown): number => Buffer.byteLength(JSON.stringify(v) ?? '', 'utf8')\nconst iso = (ms: number): string => new Date(ms).toISOString()\n\n/** Normalize volatile tokens out of a status message so semantically identical failures\n *  collapse to one signature (digits, hex/uuids, paths, durations → placeholders). */\nfunction normalizeSignature(message: string): string {\n  return message\n    .replace(/0x[0-9a-fA-F]+/g, 'HEX')\n    .replace(/[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{12}/g, 'UUID')\n    .replace(/(\\/[\\w.-]+){2,}/g, 'PATH')\n    .replace(/\\b\\d+(\\.\\d+)?(ms|s|m|h)\\b/g, 'DUR')\n    .replace(/\\b\\d+\\b/g, '#')\n    .replace(/\\s+/g, ' ')\n    .trim()\n    .slice(0, 200)\n}\n\nfunction spanKindFor(\n  event: SandboxEvent,\n  agentRunName: string,\n): {\n  kind: TraceAnalystSpanKind\n  model: string | null\n  tool: string | null\n} {\n  const llm = extractLlmCallEvent(event, agentRunName)\n  if (llm) return { kind: 'LLM', model: llm.model ?? null, tool: null }\n  const type = String(event?.type ?? '')\n  if (/tool/i.test(type)) {\n    const d = event?.data as { name?: unknown; tool?: unknown } | undefined\n    const tool = typeof d?.name === 'string' ? d.name : typeof d?.tool === 'string' ? d.tool : type\n    return { kind: 'TOOL', model: null, tool }\n  }\n  return { kind: 'SPAN', model: null, tool: null }\n}\n\nfunction errorMessageOf(event: SandboxEvent): string | undefined {\n  const type = String(event?.type ?? '')\n  const d = event?.data as { error?: unknown; message?: unknown } | undefined\n  if (/error|fail/i.test(type) || d?.error) {\n    const m = d?.error ?? d?.message\n    return typeof m === 'string' ? m : `${type} error`\n  }\n  return undefined\n}\n\n/** Project one iteration → one trace: root AGENT span + a child span per event. */\nfunction projectIteration<Task, Output>(iter: Iteration<Task, Output>): ProjectedTrace {\n  const traceId =\n    (\n      iter.events.find((e) => (e?.data as { sandboxId?: string } | undefined)?.sandboxId)?.data as\n        | { sandboxId?: string }\n        | undefined\n    )?.sandboxId ?? `iter-${iter.index}`\n  const start = iso(iter.startedAt)\n  const end = iso(iter.endedAt || iter.startedAt)\n  const durationMs = Math.max(0, (iter.endedAt || iter.startedAt) - iter.startedAt)\n  const rootId = `${traceId}:root`\n  const iterErrored = Boolean(iter.error) || iter.verdict?.valid === false\n  const spans: TraceAnalystSpan[] = [\n    {\n      trace_id: traceId,\n      span_id: rootId,\n      parent_span_id: null,\n      name: iter.agentRunName,\n      kind: 'AGENT',\n      start_time: start,\n      end_time: end,\n      duration_ms: durationMs,\n      status: iter.error ? 'ERROR' : 'OK',\n      status_message: iter.error?.message,\n      service_name: 'agent-runtime',\n      agent_name: iter.agentRunName,\n      model_name: null,\n      tool_name: null,\n      attributes: {\n        'iteration.index': iter.index,\n        'verdict.valid': iter.verdict?.valid,\n        'verdict.score': iter.verdict?.score,\n        'output.preview':\n          iter.output === undefined ? undefined : String(iter.output).slice(0, 2000),\n      },\n    },\n  ]\n  const models = new Set<string>()\n  const tools = new Set<string>()\n  iter.events.forEach((event, i) => {\n    const { kind, model, tool } = spanKindFor(event, iter.agentRunName)\n    if (model) models.add(model)\n    if (tool) tools.add(tool)\n    const errMsg = errorMessageOf(event)\n    spans.push({\n      trace_id: traceId,\n      span_id: `${traceId}:e${i}`,\n      parent_span_id: rootId,\n      name: String(event?.type ?? 'event'),\n      kind,\n      start_time: start,\n      end_time: end,\n      duration_ms: 0,\n      status: errMsg ? 'ERROR' : 'OK',\n      status_message: errMsg,\n      service_name: 'agent-runtime',\n      agent_name: iter.agentRunName,\n      model_name: model,\n      tool_name: tool,\n      attributes: (event?.data as Record<string, unknown> | undefined) ?? {},\n    })\n  })\n  const hasErrors = spans.some((s) => s.status === 'ERROR') || iterErrored\n  const summary: TraceAnalystTraceSummary = {\n    trace_id: traceId,\n    service_name: 'agent-runtime',\n    agent_name: iter.agentRunName,\n    span_count: spans.length,\n    has_errors: hasErrors,\n    start_time: start,\n    end_time: end,\n    duration_ms: durationMs,\n    raw_jsonl_bytes: bytesOf(spans),\n    models: [...models],\n    tools: [...tools],\n  }\n  return { summary, spans, rawBytes: summary.raw_jsonl_bytes }\n}\n\nfunction matchesFilters(t: ProjectedTrace, f?: TraceAnalystFilters): boolean {\n  if (!f) return true\n  if (f.has_errors !== undefined && t.summary.has_errors !== f.has_errors) return false\n  if (f.service_names?.length && !f.service_names.includes(t.summary.service_name ?? ''))\n    return false\n  if (f.agent_names?.length && !f.agent_names.includes(t.summary.agent_name ?? '')) return false\n  if (f.model_names?.length && !f.model_names.some((m) => t.summary.models.includes(m)))\n    return false\n  if (f.tool_names?.length && !f.tool_names.some((tn) => t.summary.tools.includes(tn))) return false\n  if (f.start_time_after && t.summary.start_time < f.start_time_after) return false\n  if (f.start_time_before && t.summary.start_time > f.start_time_before) return false\n  if (f.regex_pattern && !new RegExp(f.regex_pattern).test(JSON.stringify(t.spans))) return false\n  return true\n}\n\nfunction capAttributes(\n  attributes: Record<string, unknown>,\n  perAttrCap: number,\n): { capped: Record<string, unknown>; truncated: number } {\n  let truncated = 0\n  const capped: Record<string, unknown> = {}\n  for (const [k, v] of Object.entries(attributes)) {\n    const s = typeof v === 'string' ? v : JSON.stringify(v)\n    if (typeof s === 'string' && s.length > perAttrCap) {\n      truncated += 1\n      capped[k] = `${TRACE_ANALYST_TRUNCATION_MARKER_PREFIX} ${s.length}b]${s.slice(0, perAttrCap)}`\n    } else {\n      capped[k] = v\n    }\n  }\n  return { capped, truncated }\n}\n\n/**\n * Build an in-memory `TraceAnalysisStore` over a loop round's iterations. Fail-loud on an\n * empty round — there is nothing for an analyst to read, and a silent empty store would\n * mask a broken capture path.\n */\nexport function iterationsToTraceStore<Task, Output>(\n  iterations: ReadonlyArray<Iteration<Task, Output>>,\n  budgets: TraceAnalystByteBudgets = DEFAULT_TRACE_ANALYST_BUDGETS,\n): TraceAnalysisStore {\n  if (iterations.length === 0) {\n    throw new AnalystError('iterationsToTraceStore: no iterations to analyze (empty round)')\n  }\n  const traces = iterations.map((it) => projectIteration(it))\n  const byId = new Map(traces.map((t) => [t.summary.trace_id, t]))\n\n  const buildClusters = (set: ProjectedTrace[]): ErrorCluster[] => {\n    const map = new Map<string, ErrorCluster>()\n    for (const t of set) {\n      for (const s of t.spans) {\n        if (s.status !== 'ERROR' || !s.status_message) continue\n        const sig = normalizeSignature(s.status_message)\n        const c = map.get(sig) ?? {\n          signature: sig,\n          status_message_sample: s.status_message,\n          span_name: s.name,\n          tool_name: s.tool_name,\n          trace_count: 0,\n          span_count: 0,\n          prevalence: 0,\n          exemplar_trace_ids: [],\n          exemplar_span_ids: [],\n        }\n        c.span_count += 1\n        if (\n          !c.exemplar_trace_ids.includes(t.summary.trace_id) &&\n          c.exemplar_trace_ids.length < 10\n        ) {\n          c.exemplar_trace_ids.push(t.summary.trace_id)\n          c.trace_count += 1\n        }\n        if (c.exemplar_span_ids.length < 10) c.exemplar_span_ids.push(s.span_id)\n        map.set(sig, c)\n      }\n    }\n    const errorTraces = set.filter((t) => t.summary.has_errors).length || 1\n    const clusters = [...map.values()].map((c) => ({\n      ...c,\n      prevalence: c.trace_count / errorTraces,\n    }))\n    return clusters.sort((a, b) => b.trace_count - a.trace_count)\n  }\n\n  return {\n    async getOverview(filters?: TraceAnalystFilters): Promise<DatasetOverview> {\n      const set = traces.filter((t) => matchesFilters(t, filters))\n      const services = new Set<string>()\n      const agents = new Set<string>()\n      const models = new Set<string>()\n      const tools = new Set<string>()\n      let errorSpans = 0\n      for (const t of set) {\n        if (t.summary.service_name) services.add(t.summary.service_name)\n        if (t.summary.agent_name) agents.add(t.summary.agent_name)\n        for (const m of t.summary.models) models.add(m)\n        for (const tn of t.summary.tools) tools.add(tn)\n        errorSpans += t.spans.filter((s) => s.status === 'ERROR').length\n      }\n      const times = set.map((t) => t.summary.start_time).sort()\n      return {\n        total_traces: set.length,\n        raw_jsonl_bytes: set.reduce((n, t) => n + t.rawBytes, 0),\n        services: [...services],\n        agents: [...agents],\n        models: [...models],\n        tool_names: [...tools],\n        sample_trace_ids: set.slice(0, 20).map((t) => t.summary.trace_id),\n        errors: {\n          trace_count: set.filter((t) => t.summary.has_errors).length,\n          span_count: errorSpans,\n        },\n        error_clusters: buildClusters(set),\n        time_range: times.length ? { earliest: times[0]!, latest: times[times.length - 1]! } : null,\n      }\n    },\n\n    async queryTraces(opts): Promise<QueryTracesPage> {\n      const set = traces.filter((t) => matchesFilters(t, opts.filters))\n      const offset = opts.offset ?? 0\n      const page = set.slice(offset, offset + opts.limit)\n      return {\n        traces: page.map((t) => t.summary),\n        total: set.length,\n        has_more: offset + opts.limit < set.length,\n      }\n    },\n\n    async countTraces(filters?: TraceAnalystFilters): Promise<number> {\n      return traces.filter((t) => matchesFilters(t, filters)).length\n    },\n\n    async viewTrace(opts): Promise<ViewTraceResult> {\n      const t = byId.get(opts.trace_id)\n      if (!t) return { trace_id: opts.trace_id, spans: [] }\n      const cap = opts.per_attribute_byte_cap ?? budgets.perAttributeViewBudget\n      const projected = t.spans.map((s) => ({\n        ...s,\n        attributes: capAttributes(s.attributes, cap).capped,\n      }))\n      if (bytesOf(projected) > budgets.perCallByteCeiling) {\n        const names = new Map<string, number>()\n        for (const s of t.spans) names.set(s.name, (names.get(s.name) ?? 0) + 1)\n        return {\n          trace_id: opts.trace_id,\n          oversized: {\n            span_count: t.spans.length,\n            top_span_names: [...names.entries()].sort((a, b) => b[1] - a[1]).slice(0, 20),\n            span_response_bytes_max: Math.max(...t.spans.map((s) => bytesOf(s))),\n            error_span_count: t.spans.filter((s) => s.status === 'ERROR').length,\n          },\n        }\n      }\n      return { trace_id: opts.trace_id, spans: projected }\n    },\n\n    async viewSpans(opts): Promise<ViewSpansResult> {\n      const t = byId.get(opts.trace_id)\n      const cap = opts.per_attribute_byte_cap ?? budgets.perAttributeSpanBudget\n      const want = new Set(opts.span_ids)\n      const found = (t?.spans ?? []).filter((s) => want.has(s.span_id))\n      let truncated = 0\n      const spans = found.map((s) => {\n        const { capped, truncated: n } = capAttributes(s.attributes, cap)\n        truncated += n\n        return { ...s, attributes: capped }\n      })\n      const foundIds = new Set(found.map((s) => s.span_id))\n      return {\n        trace_id: opts.trace_id,\n        spans,\n        missing_span_ids: opts.span_ids.filter((id) => !foundIds.has(id)),\n        truncated_attribute_count: truncated,\n      }\n    },\n\n    async searchTrace(opts): Promise<SearchTraceResult> {\n      const t = byId.get(opts.trace_id)\n      const max = opts.max_matches ?? 50\n      const hits: SpanMatchRecord[] = []\n      for (const s of t?.spans ?? []) {\n        for (const hit of searchSpanAttrs(s, opts.regex_pattern, budgets.perMatchTextBudget)) {\n          if (hits.length >= max) break\n          hits.push(hit)\n        }\n      }\n      return {\n        trace_id: opts.trace_id,\n        hits,\n        total_matches: hits.length,\n        has_more: hits.length >= max,\n      }\n    },\n\n    async searchSpan(opts): Promise<SearchSpanResult> {\n      const t = byId.get(opts.trace_id)\n      const max = opts.max_matches ?? 50\n      const span = (t?.spans ?? []).find((s) => s.span_id === opts.span_id)\n      const hits = span\n        ? searchSpanAttrs(span, opts.regex_pattern, budgets.perMatchTextBudget).slice(0, max)\n        : []\n      return {\n        trace_id: opts.trace_id,\n        span_id: opts.span_id,\n        hits,\n        total_matches: hits.length,\n        has_more: false,\n      }\n    },\n  }\n}\n\nfunction searchSpanAttrs(\n  span: TraceAnalystSpan,\n  pattern: string,\n  textCap: number,\n): SpanMatchRecord[] {\n  const re = new RegExp(pattern, 'g')\n  const hits: SpanMatchRecord[] = []\n  for (const [k, v] of Object.entries(span.attributes)) {\n    const text = typeof v === 'string' ? v : JSON.stringify(v)\n    if (typeof text !== 'string') continue\n    re.lastIndex = 0\n    const m = re.exec(text)\n    if (!m) continue\n    const at = m.index\n    hits.push({\n      trace_id: span.trace_id,\n      span_id: span.span_id,\n      span_name: span.name,\n      span_kind: span.kind,\n      attribute_path: `attributes.${k}`,\n      matched_text: m[0].slice(0, textCap),\n      context_before: text.slice(Math.max(0, at - textCap / 2), at),\n      context_after: text.slice(at + m[0].length, at + m[0].length + textCap / 2),\n      match_offset: at,\n    })\n  }\n  return hits\n}\n","/**\n * `runAnalystLoop` — the one call agent apps reach for to close the\n * recursive-self-improvement loop.\n *\n *   1. Load baseline findings (last run, or the slice the caller specifies)\n *   2. Run the analyst registry with priorFindings injected\n *   3. Persist the new run's findings to the ledger\n *   4. Diff the new run against the baseline\n *   5. Hand the findings to the knowledge adapter → proposals (and\n *      optionally apply them) → wiki edits\n *   6. Hand the findings to the improvement adapter → prompt / tool /\n *      scaffolding edits (review-only by default)\n *   7. Return a single report the consumer renders / persists / acts on.\n *\n * Adapters are optional: the loop works as a \"run + diff + report\"\n * primitive when no adapters are wired; it closes end-to-end when\n * both adapters are wired.\n */\n\nimport type { AnalystFinding, AnalystRunResult, FindingsDiff } from '@tangle-network/agent-eval'\nimport { diffFindings } from '@tangle-network/agent-eval'\n\nimport type {\n  AnalystLoopEvent,\n  AnalystRegistryStreamingLike,\n  ImprovementReport,\n  KnowledgeReport,\n  RunAnalystLoopOpts,\n  RunAnalystLoopResult,\n} from './types'\n\nexport async function runAnalystLoop<TProposal = unknown, TEdit = unknown>(\n  opts: RunAnalystLoopOpts,\n): Promise<RunAnalystLoopResult<TProposal, TEdit>> {\n  const log = opts.log ?? defaultLog\n  const strategy = opts.priorFindingsStrategy ?? 'per-kind'\n  const emit = makeEmitter(opts.onEvent)\n  const startedAt = Date.now()\n\n  // 1. Resolve baseline + load prior findings.\n  const baselineRunId = resolveBaselineRunId(opts)\n  const priorAll: ReadonlyArray<AnalystFinding & { run_id: string }> = baselineRunId\n    ? (opts.findingsStore?.loadRun(baselineRunId) ?? [])\n    : []\n  log('baseline resolved', { baselineRunId, prior_findings: priorAll.length })\n  await emit({\n    type: 'baseline-resolved',\n    runId: opts.runId,\n    baselineRunId,\n    priorFindingCount: priorAll.length,\n  })\n\n  // 2. Run the registry. Strategy controls how analysts see priors.\n  //    When the registry exposes runStream, forward each event verbatim\n  //    so subscribers see per-analyst progress in real time.\n  const priorFindings = buildPriorFindingsInput(priorAll, strategy, opts.registry.list())\n  const analystResult = await runRegistry(opts, priorFindings, emit)\n  log('analyst run complete', {\n    findings: analystResult.findings.length,\n    cost_usd: analystResult.total_cost_usd,\n    per_analyst: analystResult.per_analyst.map((s) => ({\n      id: s.analyst_id,\n      status: s.status,\n      n: s.findings_count,\n    })),\n  })\n\n  // 3. Persist the new run before any side-effecting adapter runs so\n  //    the ledger is the source of truth even if an adapter throws.\n  if (opts.findingsStore && analystResult.findings.length > 0) {\n    await opts.findingsStore.append(opts.runId, analystResult.findings)\n    await emit({\n      type: 'findings-persisted',\n      runId: opts.runId,\n      count: analystResult.findings.length,\n    })\n  }\n\n  // 4. Diff vs baseline.\n  let diff: FindingsDiff | null = null\n  if (baselineRunId && analystResult.findings.length > 0) {\n    diff = diffFindings(\n      priorAll.map((f) => ({ ...f })),\n      analystResult.findings.map((f) => ({ ...f, run_id: opts.runId })),\n    )\n    log('diff vs baseline', {\n      appeared: diff.appeared.length,\n      disappeared: diff.disappeared.length,\n      persisted: diff.persisted.length,\n      changed: diff.changed.length,\n    })\n    await emit({\n      type: 'diff-computed',\n      runId: opts.runId,\n      baselineRunId,\n      appeared: diff.appeared.length,\n      disappeared: diff.disappeared.length,\n      persisted: diff.persisted.length,\n      changed: diff.changed.length,\n    })\n  }\n\n  // 5. Knowledge adapter — proposals + optional auto-apply.\n  let knowledge: KnowledgeReport<TProposal> | null = null\n  if (opts.knowledgeAdapter) {\n    knowledge = await runKnowledgeAdapter(opts, analystResult.findings, log, emit)\n  }\n\n  // 6. Improvement adapter — prompt / tool / scaffolding edits.\n  let improvement: ImprovementReport<TEdit> | null = null\n  if (opts.improvementAdapter) {\n    improvement = await runImprovementAdapter(opts, analystResult.findings, log, emit)\n  }\n\n  await emit({\n    type: 'loop-completed',\n    runId: opts.runId,\n    durationMs: Date.now() - startedAt,\n  })\n\n  return {\n    runId: opts.runId,\n    baselineRunId,\n    analystResult,\n    diff,\n    knowledge,\n    improvement,\n  }\n}\n\ntype Emitter = (event: AnalystLoopEvent) => Promise<void>\n\nfunction makeEmitter(onEvent: RunAnalystLoopOpts['onEvent']): Emitter {\n  if (!onEvent) return async () => {}\n  return async (event) => {\n    await onEvent(event)\n  }\n}\n\nasync function runRegistry(\n  opts: RunAnalystLoopOpts,\n  priorFindings: ReturnType<typeof buildPriorFindingsInput>,\n  emit: Emitter,\n): Promise<AnalystRunResult> {\n  const reg = opts.registry as AnalystRegistryStreamingLike\n  if (typeof reg.runStream === 'function' && opts.onEvent) {\n    let final: AnalystRunResult | null = null\n    for await (const ev of reg.runStream(opts.runId, opts.inputs, { priorFindings })) {\n      await emit({ type: 'analyst', runId: opts.runId, event: ev })\n      if (ev.type === 'run-completed') final = ev.result\n    }\n    if (!final) {\n      throw new Error('runAnalystLoop: registry.runStream ended without run-completed event')\n    }\n    return final\n  }\n  return opts.registry.run(opts.runId, opts.inputs, { priorFindings })\n}\n\nfunction resolveBaselineRunId(opts: RunAnalystLoopOpts): string | null {\n  if (opts.baselineRunId === null) return null\n  if (typeof opts.baselineRunId === 'string') return opts.baselineRunId\n  if (!opts.findingsStore) return null\n  const all = opts.findingsStore.loadAll()\n  let last: string | null = null\n  for (const row of all) {\n    if (row.run_id === opts.runId) continue\n    last = row.run_id\n  }\n  return last\n}\n\nfunction buildPriorFindingsInput(\n  prior: ReadonlyArray<AnalystFinding & { run_id: string }>,\n  strategy: 'per-kind' | 'wildcard' | 'none',\n  registry: ReadonlyArray<{ id: string }>,\n): ReadonlyArray<AnalystFinding> | Record<string, ReadonlyArray<AnalystFinding>> | undefined {\n  if (strategy === 'none' || prior.length === 0) return undefined\n  const stripped = prior.map(({ run_id: _run_id, ...rest }) => rest as AnalystFinding)\n  if (strategy === 'wildcard') {\n    return { '*': stripped }\n  }\n  void registry\n  return stripped\n}\n\nasync function runKnowledgeAdapter<TProposal>(\n  opts: RunAnalystLoopOpts,\n  findings: ReadonlyArray<AnalystFinding>,\n  log: NonNullable<RunAnalystLoopOpts['log']>,\n  emit: Emitter,\n): Promise<KnowledgeReport<TProposal>> {\n  const adapter = opts.knowledgeAdapter!\n  const batch = await adapter.proposeFromFindings(findings)\n  log('knowledge.proposeFromFindings', {\n    proposals: batch.proposals.length,\n    skipped: batch.skipped,\n    errors: batch.errors.length,\n  })\n  await emit({\n    type: 'knowledge-proposed',\n    runId: opts.runId,\n    proposalCount: batch.proposals.length,\n    skipped: batch.skipped,\n    errors: batch.errors.length,\n  })\n\n  const auto = opts.autoApply?.knowledge ?? false\n  const threshold = opts.autoApply?.knowledgeConfidenceThreshold ?? 0.85\n\n  if (!auto || !adapter.apply) {\n    await emit({\n      type: 'knowledge-applied',\n      runId: opts.runId,\n      writtenCount: 0,\n      withheldForReview: batch.proposals.length,\n    })\n    return {\n      proposals: batch.proposals as TProposal[],\n      applied: [],\n      skipped: batch.skipped,\n      errors: batch.errors,\n      withheld_for_review: batch.proposals.length,\n    }\n  }\n\n  const findingsById = new Map(findings.map((f) => [f.finding_id, f]))\n  const safe: TProposal[] = []\n  let withheld = 0\n  for (const p of batch.proposals as Array<TProposal & { sourceFindingId?: string }>) {\n    const src = p.sourceFindingId ? findingsById.get(p.sourceFindingId) : undefined\n    if (!src) {\n      withheld += 1\n      continue\n    }\n    if (src.confidence < threshold) {\n      withheld += 1\n      continue\n    }\n    safe.push(p)\n  }\n  const result = await adapter.apply(safe)\n  log('knowledge.apply', {\n    applied: result.written.length,\n    withheld_for_review: withheld,\n    warnings: result.warnings.length,\n  })\n  await emit({\n    type: 'knowledge-applied',\n    runId: opts.runId,\n    writtenCount: result.written.length,\n    withheldForReview: withheld,\n  })\n  return {\n    proposals: batch.proposals as TProposal[],\n    applied: result.written,\n    skipped: batch.skipped,\n    errors: batch.errors,\n    withheld_for_review: withheld,\n  }\n}\n\nasync function runImprovementAdapter<TEdit>(\n  opts: RunAnalystLoopOpts,\n  findings: ReadonlyArray<AnalystFinding>,\n  log: NonNullable<RunAnalystLoopOpts['log']>,\n  emit: Emitter,\n): Promise<ImprovementReport<TEdit>> {\n  const adapter = opts.improvementAdapter!\n  const batch = await adapter.proposeFromFindings(findings)\n  log('improvement.proposeFromFindings', {\n    edits: batch.edits.length,\n    skipped: batch.skipped,\n    errors: batch.errors.length,\n  })\n  await emit({\n    type: 'improvement-proposed',\n    runId: opts.runId,\n    editCount: batch.edits.length,\n    skipped: batch.skipped,\n    errors: batch.errors.length,\n  })\n\n  const auto = opts.autoApply?.improvement ?? false\n  const threshold = opts.autoApply?.improvementConfidenceThreshold ?? 0.9\n\n  if (!auto || !adapter.apply) {\n    await emit({\n      type: 'improvement-applied',\n      runId: opts.runId,\n      appliedCount: 0,\n      withheldForReview: batch.edits.length,\n    })\n    return {\n      edits: batch.edits as TEdit[],\n      applied: [],\n      skipped: batch.skipped,\n      errors: batch.errors,\n      withheld_for_review: batch.edits.length,\n    }\n  }\n\n  const findingsById = new Map(findings.map((f) => [f.finding_id, f]))\n  const safe: TEdit[] = []\n  let withheld = 0\n  for (const e of batch.edits as Array<TEdit & { sourceFindingId?: string }>) {\n    const src = e.sourceFindingId ? findingsById.get(e.sourceFindingId) : undefined\n    if (!src || src.confidence < threshold) {\n      withheld += 1\n      continue\n    }\n    safe.push(e)\n  }\n  const result = await adapter.apply(safe)\n  log('improvement.apply', {\n    applied: result.applied.length,\n    withheld_for_review: withheld,\n    warnings: result.warnings.length,\n  })\n  await emit({\n    type: 'improvement-applied',\n    runId: opts.runId,\n    appliedCount: result.applied.length,\n    withheldForReview: withheld,\n  })\n  return {\n    edits: batch.edits as TEdit[],\n    applied: result.applied,\n    skipped: batch.skipped,\n    errors: batch.errors,\n    withheld_for_review: withheld,\n  }\n}\n\nfunction defaultLog(msg: string, fields?: Record<string, unknown>): void {\n  if (fields) console.log(`[analyst-loop] ${msg}`, fields)\n  else console.log(`[analyst-loop] ${msg}`)\n}\n","/**\n * @experimental\n *\n * STEP 2 of closing the autonomous loop: `createAnalystDriverHook` returns the exact\n * `analyze` callback `createDynamicDriver` already accepts. Each round it projects the\n * round's iterations into a `TraceAnalysisStore` (STEP 1), runs `runAnalystLoop` over the\n * registry, threads the prior round's findings as the baseline (cross-round memory), and\n * returns the findings — which the driver feeds to the planner via `PlannerContext.analyses`.\n *\n * This is `runAnalystLoop`'s first consumer: the wire that turns \"trace analysts exist\" into\n * \"trace analysts drive the next prompt.\" The driver enforces the steer-firewall\n * (`assertTraceDerivedFindings`) on what this returns, so a kind that leaks judge-derived\n * evidence fails loud here — selector ≠ judge stays intact for free.\n */\n\nimport type { AnalystFinding, AnalystRunInputs } from '@tangle-network/agent-eval'\nimport type { AnalyzeInput } from '../runtime/dynamic'\nimport type { Iteration } from '../runtime/types'\nimport { randomSuffix } from '../runtime/util'\nimport { iterationsToTraceStore } from './iterations-to-trace-store'\nimport { runAnalystLoop } from './run-analyst-loop'\nimport type { AnalystRegistryLike, FindingsStoreLike } from './types'\n\nexport interface AnalystDriverHookOptions {\n  /** The analyst registry, pre-populated with the trace-analyst kinds to run each round. */\n  registry: AnalystRegistryLike\n  /**\n   * Durable findings ledger. When set, each round's findings are appended and diffed\n   * against the prior round (cross-run memory). `null`/omitted = one-shot, no persistence.\n   */\n  findingsStore?: FindingsStoreLike | null\n  /** How prior-round findings reach the analysts. Default `'per-kind'` (threads memory). */\n  priorFindingsStrategy?: 'per-kind' | 'wildcard' | 'none'\n  /** Base run id; each round runs as `${runId}-r{round}`. Default = a random base. */\n  runId?: string\n}\n\n/**\n * Build the `analyze` hook for `createDynamicDriver({ planner, analyze })`. Fail-loud: an\n * empty round throws inside `iterationsToTraceStore` rather than returning empty findings.\n */\nexport function createAnalystDriverHook<Task, Output>(\n  opts: AnalystDriverHookOptions,\n): (input: AnalyzeInput<Task, Output>) => Promise<ReadonlyArray<AnalystFinding>> {\n  const baseRunId = opts.runId ?? `analyst-${randomSuffix()}`\n  let priorRunId: string | undefined\n  return async ({ history }: AnalyzeInput<Task, Output>) => {\n    const traceStore = iterationsToTraceStore(history as ReadonlyArray<Iteration<Task, Output>>)\n    const runId = `${baseRunId}-r${history.length}`\n    const result = await runAnalystLoop({\n      runId,\n      registry: opts.registry,\n      inputs: { traceStore } as AnalystRunInputs,\n      findingsStore: opts.findingsStore ?? null,\n      // thread the prior round's findings as the baseline → cross-round steering memory.\n      baselineRunId: priorRunId,\n      priorFindingsStrategy: opts.priorFindingsStrategy ?? 'per-kind',\n    })\n    priorRunId = runId\n    return result.analystResult.findings\n  }\n}\n"],"mappings":";;;;;;;AAgBA;AAAA,EAEE;AAAA,EAKA;AAAA,OASK;AAgBP,IAAM,UAAU,CAAC,MAAuB,OAAO,WAAW,KAAK,UAAU,CAAC,KAAK,IAAI,MAAM;AACzF,IAAM,MAAM,CAAC,OAAuB,IAAI,KAAK,EAAE,EAAE,YAAY;AAI7D,SAAS,mBAAmB,SAAyB;AACnD,SAAO,QACJ,QAAQ,mBAAmB,KAAK,EAChC,QAAQ,gFAAgF,MAAM,EAC9F,QAAQ,oBAAoB,MAAM,EAClC,QAAQ,8BAA8B,KAAK,EAC3C,QAAQ,YAAY,GAAG,EACvB,QAAQ,QAAQ,GAAG,EACnB,KAAK,EACL,MAAM,GAAG,GAAG;AACjB;AAEA,SAAS,YACP,OACA,cAKA;AACA,QAAM,MAAM,oBAAoB,OAAO,YAAY;AACnD,MAAI,IAAK,QAAO,EAAE,MAAM,OAAO,OAAO,IAAI,SAAS,MAAM,MAAM,KAAK;AACpE,QAAM,OAAO,OAAO,OAAO,QAAQ,EAAE;AACrC,MAAI,QAAQ,KAAK,IAAI,GAAG;AACtB,UAAM,IAAI,OAAO;AACjB,UAAM,OAAO,OAAO,GAAG,SAAS,WAAW,EAAE,OAAO,OAAO,GAAG,SAAS,WAAW,EAAE,OAAO;AAC3F,WAAO,EAAE,MAAM,QAAQ,OAAO,MAAM,KAAK;AAAA,EAC3C;AACA,SAAO,EAAE,MAAM,QAAQ,OAAO,MAAM,MAAM,KAAK;AACjD;AAEA,SAAS,eAAe,OAAyC;AAC/D,QAAM,OAAO,OAAO,OAAO,QAAQ,EAAE;AACrC,QAAM,IAAI,OAAO;AACjB,MAAI,cAAc,KAAK,IAAI,KAAK,GAAG,OAAO;AACxC,UAAM,IAAI,GAAG,SAAS,GAAG;AACzB,WAAO,OAAO,MAAM,WAAW,IAAI,GAAG,IAAI;AAAA,EAC5C;AACA,SAAO;AACT;AAGA,SAAS,iBAA+B,MAA+C;AACrF,QAAM,UAEF,KAAK,OAAO,KAAK,CAAC,MAAO,GAAG,MAA6C,SAAS,GAAG,MAGpF,aAAa,QAAQ,KAAK,KAAK;AACpC,QAAM,QAAQ,IAAI,KAAK,SAAS;AAChC,QAAM,MAAM,IAAI,KAAK,WAAW,KAAK,SAAS;AAC9C,QAAM,aAAa,KAAK,IAAI,IAAI,KAAK,WAAW,KAAK,aAAa,KAAK,SAAS;AAChF,QAAM,SAAS,GAAG,OAAO;AACzB,QAAM,cAAc,QAAQ,KAAK,KAAK,KAAK,KAAK,SAAS,UAAU;AACnE,QAAM,QAA4B;AAAA,IAChC;AAAA,MACE,UAAU;AAAA,MACV,SAAS;AAAA,MACT,gBAAgB;AAAA,MAChB,MAAM,KAAK;AAAA,MACX,MAAM;AAAA,MACN,YAAY;AAAA,MACZ,UAAU;AAAA,MACV,aAAa;AAAA,MACb,QAAQ,KAAK,QAAQ,UAAU;AAAA,MAC/B,gBAAgB,KAAK,OAAO;AAAA,MAC5B,cAAc;AAAA,MACd,YAAY,KAAK;AAAA,MACjB,YAAY;AAAA,MACZ,WAAW;AAAA,MACX,YAAY;AAAA,QACV,mBAAmB,KAAK;AAAA,QACxB,iBAAiB,KAAK,SAAS;AAAA,QAC/B,iBAAiB,KAAK,SAAS;AAAA,QAC/B,kBACE,KAAK,WAAW,SAAY,SAAY,OAAO,KAAK,MAAM,EAAE,MAAM,GAAG,GAAI;AAAA,MAC7E;AAAA,IACF;AAAA,EACF;AACA,QAAM,SAAS,oBAAI,IAAY;AAC/B,QAAM,QAAQ,oBAAI,IAAY;AAC9B,OAAK,OAAO,QAAQ,CAAC,OAAO,MAAM;AAChC,UAAM,EAAE,MAAM,OAAO,KAAK,IAAI,YAAY,OAAO,KAAK,YAAY;AAClE,QAAI,MAAO,QAAO,IAAI,KAAK;AAC3B,QAAI,KAAM,OAAM,IAAI,IAAI;AACxB,UAAM,SAAS,eAAe,KAAK;AACnC,UAAM,KAAK;AAAA,MACT,UAAU;AAAA,MACV,SAAS,GAAG,OAAO,KAAK,CAAC;AAAA,MACzB,gBAAgB;AAAA,MAChB,MAAM,OAAO,OAAO,QAAQ,OAAO;AAAA,MACnC;AAAA,MACA,YAAY;AAAA,MACZ,UAAU;AAAA,MACV,aAAa;AAAA,MACb,QAAQ,SAAS,UAAU;AAAA,MAC3B,gBAAgB;AAAA,MAChB,cAAc;AAAA,MACd,YAAY,KAAK;AAAA,MACjB,YAAY;AAAA,MACZ,WAAW;AAAA,MACX,YAAa,OAAO,QAAgD,CAAC;AAAA,IACvE,CAAC;AAAA,EACH,CAAC;AACD,QAAM,YAAY,MAAM,KAAK,CAAC,MAAM,EAAE,WAAW,OAAO,KAAK;AAC7D,QAAM,UAAoC;AAAA,IACxC,UAAU;AAAA,IACV,cAAc;AAAA,IACd,YAAY,KAAK;AAAA,IACjB,YAAY,MAAM;AAAA,IAClB,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,UAAU;AAAA,IACV,aAAa;AAAA,IACb,iBAAiB,QAAQ,KAAK;AAAA,IAC9B,QAAQ,CAAC,GAAG,MAAM;AAAA,IAClB,OAAO,CAAC,GAAG,KAAK;AAAA,EAClB;AACA,SAAO,EAAE,SAAS,OAAO,UAAU,QAAQ,gBAAgB;AAC7D;AAEA,SAAS,eAAe,GAAmB,GAAkC;AAC3E,MAAI,CAAC,EAAG,QAAO;AACf,MAAI,EAAE,eAAe,UAAa,EAAE,QAAQ,eAAe,EAAE,WAAY,QAAO;AAChF,MAAI,EAAE,eAAe,UAAU,CAAC,EAAE,cAAc,SAAS,EAAE,QAAQ,gBAAgB,EAAE;AACnF,WAAO;AACT,MAAI,EAAE,aAAa,UAAU,CAAC,EAAE,YAAY,SAAS,EAAE,QAAQ,cAAc,EAAE,EAAG,QAAO;AACzF,MAAI,EAAE,aAAa,UAAU,CAAC,EAAE,YAAY,KAAK,CAAC,MAAM,EAAE,QAAQ,OAAO,SAAS,CAAC,CAAC;AAClF,WAAO;AACT,MAAI,EAAE,YAAY,UAAU,CAAC,EAAE,WAAW,KAAK,CAAC,OAAO,EAAE,QAAQ,MAAM,SAAS,EAAE,CAAC,EAAG,QAAO;AAC7F,MAAI,EAAE,oBAAoB,EAAE,QAAQ,aAAa,EAAE,iBAAkB,QAAO;AAC5E,MAAI,EAAE,qBAAqB,EAAE,QAAQ,aAAa,EAAE,kBAAmB,QAAO;AAC9E,MAAI,EAAE,iBAAiB,CAAC,IAAI,OAAO,EAAE,aAAa,EAAE,KAAK,KAAK,UAAU,EAAE,KAAK,CAAC,EAAG,QAAO;AAC1F,SAAO;AACT;AAEA,SAAS,cACP,YACA,YACwD;AACxD,MAAI,YAAY;AAChB,QAAM,SAAkC,CAAC;AACzC,aAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,UAAU,GAAG;AAC/C,UAAM,IAAI,OAAO,MAAM,WAAW,IAAI,KAAK,UAAU,CAAC;AACtD,QAAI,OAAO,MAAM,YAAY,EAAE,SAAS,YAAY;AAClD,mBAAa;AACb,aAAO,CAAC,IAAI,GAAG,sCAAsC,IAAI,EAAE,MAAM,KAAK,EAAE,MAAM,GAAG,UAAU,CAAC;AAAA,IAC9F,OAAO;AACL,aAAO,CAAC,IAAI;AAAA,IACd;AAAA,EACF;AACA,SAAO,EAAE,QAAQ,UAAU;AAC7B;AAOO,SAAS,uBACd,YACA,UAAmC,+BACf;AACpB,MAAI,WAAW,WAAW,GAAG;AAC3B,UAAM,IAAI,aAAa,gEAAgE;AAAA,EACzF;AACA,QAAM,SAAS,WAAW,IAAI,CAAC,OAAO,iBAAiB,EAAE,CAAC;AAC1D,QAAM,OAAO,IAAI,IAAI,OAAO,IAAI,CAAC,MAAM,CAAC,EAAE,QAAQ,UAAU,CAAC,CAAC,CAAC;AAE/D,QAAM,gBAAgB,CAAC,QAA0C;AAC/D,UAAM,MAAM,oBAAI,IAA0B;AAC1C,eAAW,KAAK,KAAK;AACnB,iBAAW,KAAK,EAAE,OAAO;AACvB,YAAI,EAAE,WAAW,WAAW,CAAC,EAAE,eAAgB;AAC/C,cAAM,MAAM,mBAAmB,EAAE,cAAc;AAC/C,cAAM,IAAI,IAAI,IAAI,GAAG,KAAK;AAAA,UACxB,WAAW;AAAA,UACX,uBAAuB,EAAE;AAAA,UACzB,WAAW,EAAE;AAAA,UACb,WAAW,EAAE;AAAA,UACb,aAAa;AAAA,UACb,YAAY;AAAA,UACZ,YAAY;AAAA,UACZ,oBAAoB,CAAC;AAAA,UACrB,mBAAmB,CAAC;AAAA,QACtB;AACA,UAAE,cAAc;AAChB,YACE,CAAC,EAAE,mBAAmB,SAAS,EAAE,QAAQ,QAAQ,KACjD,EAAE,mBAAmB,SAAS,IAC9B;AACA,YAAE,mBAAmB,KAAK,EAAE,QAAQ,QAAQ;AAC5C,YAAE,eAAe;AAAA,QACnB;AACA,YAAI,EAAE,kBAAkB,SAAS,GAAI,GAAE,kBAAkB,KAAK,EAAE,OAAO;AACvE,YAAI,IAAI,KAAK,CAAC;AAAA,MAChB;AAAA,IACF;AACA,UAAM,cAAc,IAAI,OAAO,CAAC,MAAM,EAAE,QAAQ,UAAU,EAAE,UAAU;AACtE,UAAM,WAAW,CAAC,GAAG,IAAI,OAAO,CAAC,EAAE,IAAI,CAAC,OAAO;AAAA,MAC7C,GAAG;AAAA,MACH,YAAY,EAAE,cAAc;AAAA,IAC9B,EAAE;AACF,WAAO,SAAS,KAAK,CAAC,GAAG,MAAM,EAAE,cAAc,EAAE,WAAW;AAAA,EAC9D;AAEA,SAAO;AAAA,IACL,MAAM,YAAY,SAAyD;AACzE,YAAM,MAAM,OAAO,OAAO,CAAC,MAAM,eAAe,GAAG,OAAO,CAAC;AAC3D,YAAM,WAAW,oBAAI,IAAY;AACjC,YAAM,SAAS,oBAAI,IAAY;AAC/B,YAAM,SAAS,oBAAI,IAAY;AAC/B,YAAM,QAAQ,oBAAI,IAAY;AAC9B,UAAI,aAAa;AACjB,iBAAW,KAAK,KAAK;AACnB,YAAI,EAAE,QAAQ,aAAc,UAAS,IAAI,EAAE,QAAQ,YAAY;AAC/D,YAAI,EAAE,QAAQ,WAAY,QAAO,IAAI,EAAE,QAAQ,UAAU;AACzD,mBAAW,KAAK,EAAE,QAAQ,OAAQ,QAAO,IAAI,CAAC;AAC9C,mBAAW,MAAM,EAAE,QAAQ,MAAO,OAAM,IAAI,EAAE;AAC9C,sBAAc,EAAE,MAAM,OAAO,CAAC,MAAM,EAAE,WAAW,OAAO,EAAE;AAAA,MAC5D;AACA,YAAM,QAAQ,IAAI,IAAI,CAAC,MAAM,EAAE,QAAQ,UAAU,EAAE,KAAK;AACxD,aAAO;AAAA,QACL,cAAc,IAAI;AAAA,QAClB,iBAAiB,IAAI,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,UAAU,CAAC;AAAA,QACvD,UAAU,CAAC,GAAG,QAAQ;AAAA,QACtB,QAAQ,CAAC,GAAG,MAAM;AAAA,QAClB,QAAQ,CAAC,GAAG,MAAM;AAAA,QAClB,YAAY,CAAC,GAAG,KAAK;AAAA,QACrB,kBAAkB,IAAI,MAAM,GAAG,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,QAAQ,QAAQ;AAAA,QAChE,QAAQ;AAAA,UACN,aAAa,IAAI,OAAO,CAAC,MAAM,EAAE,QAAQ,UAAU,EAAE;AAAA,UACrD,YAAY;AAAA,QACd;AAAA,QACA,gBAAgB,cAAc,GAAG;AAAA,QACjC,YAAY,MAAM,SAAS,EAAE,UAAU,MAAM,CAAC,GAAI,QAAQ,MAAM,MAAM,SAAS,CAAC,EAAG,IAAI;AAAA,MACzF;AAAA,IACF;AAAA,IAEA,MAAM,YAAY,MAAgC;AAChD,YAAM,MAAM,OAAO,OAAO,CAAC,MAAM,eAAe,GAAG,KAAK,OAAO,CAAC;AAChE,YAAM,SAAS,KAAK,UAAU;AAC9B,YAAM,OAAO,IAAI,MAAM,QAAQ,SAAS,KAAK,KAAK;AAClD,aAAO;AAAA,QACL,QAAQ,KAAK,IAAI,CAAC,MAAM,EAAE,OAAO;AAAA,QACjC,OAAO,IAAI;AAAA,QACX,UAAU,SAAS,KAAK,QAAQ,IAAI;AAAA,MACtC;AAAA,IACF;AAAA,IAEA,MAAM,YAAY,SAAgD;AAChE,aAAO,OAAO,OAAO,CAAC,MAAM,eAAe,GAAG,OAAO,CAAC,EAAE;AAAA,IAC1D;AAAA,IAEA,MAAM,UAAU,MAAgC;AAC9C,YAAM,IAAI,KAAK,IAAI,KAAK,QAAQ;AAChC,UAAI,CAAC,EAAG,QAAO,EAAE,UAAU,KAAK,UAAU,OAAO,CAAC,EAAE;AACpD,YAAM,MAAM,KAAK,0BAA0B,QAAQ;AACnD,YAAM,YAAY,EAAE,MAAM,IAAI,CAAC,OAAO;AAAA,QACpC,GAAG;AAAA,QACH,YAAY,cAAc,EAAE,YAAY,GAAG,EAAE;AAAA,MAC/C,EAAE;AACF,UAAI,QAAQ,SAAS,IAAI,QAAQ,oBAAoB;AACnD,cAAM,QAAQ,oBAAI,IAAoB;AACtC,mBAAW,KAAK,EAAE,MAAO,OAAM,IAAI,EAAE,OAAO,MAAM,IAAI,EAAE,IAAI,KAAK,KAAK,CAAC;AACvE,eAAO;AAAA,UACL,UAAU,KAAK;AAAA,UACf,WAAW;AAAA,YACT,YAAY,EAAE,MAAM;AAAA,YACpB,gBAAgB,CAAC,GAAG,MAAM,QAAQ,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,GAAG,EAAE;AAAA,YAC5E,yBAAyB,KAAK,IAAI,GAAG,EAAE,MAAM,IAAI,CAAC,MAAM,QAAQ,CAAC,CAAC,CAAC;AAAA,YACnE,kBAAkB,EAAE,MAAM,OAAO,CAAC,MAAM,EAAE,WAAW,OAAO,EAAE;AAAA,UAChE;AAAA,QACF;AAAA,MACF;AACA,aAAO,EAAE,UAAU,KAAK,UAAU,OAAO,UAAU;AAAA,IACrD;AAAA,IAEA,MAAM,UAAU,MAAgC;AAC9C,YAAM,IAAI,KAAK,IAAI,KAAK,QAAQ;AAChC,YAAM,MAAM,KAAK,0BAA0B,QAAQ;AACnD,YAAM,OAAO,IAAI,IAAI,KAAK,QAAQ;AAClC,YAAM,SAAS,GAAG,SAAS,CAAC,GAAG,OAAO,CAAC,MAAM,KAAK,IAAI,EAAE,OAAO,CAAC;AAChE,UAAI,YAAY;AAChB,YAAM,QAAQ,MAAM,IAAI,CAAC,MAAM;AAC7B,cAAM,EAAE,QAAQ,WAAW,EAAE,IAAI,cAAc,EAAE,YAAY,GAAG;AAChE,qBAAa;AACb,eAAO,EAAE,GAAG,GAAG,YAAY,OAAO;AAAA,MACpC,CAAC;AACD,YAAM,WAAW,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC;AACpD,aAAO;AAAA,QACL,UAAU,KAAK;AAAA,QACf;AAAA,QACA,kBAAkB,KAAK,SAAS,OAAO,CAAC,OAAO,CAAC,SAAS,IAAI,EAAE,CAAC;AAAA,QAChE,2BAA2B;AAAA,MAC7B;AAAA,IACF;AAAA,IAEA,MAAM,YAAY,MAAkC;AAClD,YAAM,IAAI,KAAK,IAAI,KAAK,QAAQ;AAChC,YAAM,MAAM,KAAK,eAAe;AAChC,YAAM,OAA0B,CAAC;AACjC,iBAAW,KAAK,GAAG,SAAS,CAAC,GAAG;AAC9B,mBAAW,OAAO,gBAAgB,GAAG,KAAK,eAAe,QAAQ,kBAAkB,GAAG;AACpF,cAAI,KAAK,UAAU,IAAK;AACxB,eAAK,KAAK,GAAG;AAAA,QACf;AAAA,MACF;AACA,aAAO;AAAA,QACL,UAAU,KAAK;AAAA,QACf;AAAA,QACA,eAAe,KAAK;AAAA,QACpB,UAAU,KAAK,UAAU;AAAA,MAC3B;AAAA,IACF;AAAA,IAEA,MAAM,WAAW,MAAiC;AAChD,YAAM,IAAI,KAAK,IAAI,KAAK,QAAQ;AAChC,YAAM,MAAM,KAAK,eAAe;AAChC,YAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,YAAY,KAAK,OAAO;AACpE,YAAM,OAAO,OACT,gBAAgB,MAAM,KAAK,eAAe,QAAQ,kBAAkB,EAAE,MAAM,GAAG,GAAG,IAClF,CAAC;AACL,aAAO;AAAA,QACL,UAAU,KAAK;AAAA,QACf,SAAS,KAAK;AAAA,QACd;AAAA,QACA,eAAe,KAAK;AAAA,QACpB,UAAU;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,gBACP,MACA,SACA,SACmB;AACnB,QAAM,KAAK,IAAI,OAAO,SAAS,GAAG;AAClC,QAAM,OAA0B,CAAC;AACjC,aAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,KAAK,UAAU,GAAG;AACpD,UAAM,OAAO,OAAO,MAAM,WAAW,IAAI,KAAK,UAAU,CAAC;AACzD,QAAI,OAAO,SAAS,SAAU;AAC9B,OAAG,YAAY;AACf,UAAM,IAAI,GAAG,KAAK,IAAI;AACtB,QAAI,CAAC,EAAG;AACR,UAAM,KAAK,EAAE;AACb,SAAK,KAAK;AAAA,MACR,UAAU,KAAK;AAAA,MACf,SAAS,KAAK;AAAA,MACd,WAAW,KAAK;AAAA,MAChB,WAAW,KAAK;AAAA,MAChB,gBAAgB,cAAc,CAAC;AAAA,MAC/B,cAAc,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO;AAAA,MACnC,gBAAgB,KAAK,MAAM,KAAK,IAAI,GAAG,KAAK,UAAU,CAAC,GAAG,EAAE;AAAA,MAC5D,eAAe,KAAK,MAAM,KAAK,EAAE,CAAC,EAAE,QAAQ,KAAK,EAAE,CAAC,EAAE,SAAS,UAAU,CAAC;AAAA,MAC1E,cAAc;AAAA,IAChB,CAAC;AAAA,EACH;AACA,SAAO;AACT;;;AC1YA,SAAS,oBAAoB;AAW7B,eAAsB,eACpB,MACiD;AACjD,QAAM,MAAM,KAAK,OAAO;AACxB,QAAM,WAAW,KAAK,yBAAyB;AAC/C,QAAM,OAAO,YAAY,KAAK,OAAO;AACrC,QAAM,YAAY,KAAK,IAAI;AAG3B,QAAM,gBAAgB,qBAAqB,IAAI;AAC/C,QAAM,WAA+D,gBAChE,KAAK,eAAe,QAAQ,aAAa,KAAK,CAAC,IAChD,CAAC;AACL,MAAI,qBAAqB,EAAE,eAAe,gBAAgB,SAAS,OAAO,CAAC;AAC3E,QAAM,KAAK;AAAA,IACT,MAAM;AAAA,IACN,OAAO,KAAK;AAAA,IACZ;AAAA,IACA,mBAAmB,SAAS;AAAA,EAC9B,CAAC;AAKD,QAAM,gBAAgB,wBAAwB,UAAU,UAAU,KAAK,SAAS,KAAK,CAAC;AACtF,QAAM,gBAAgB,MAAM,YAAY,MAAM,eAAe,IAAI;AACjE,MAAI,wBAAwB;AAAA,IAC1B,UAAU,cAAc,SAAS;AAAA,IACjC,UAAU,cAAc;AAAA,IACxB,aAAa,cAAc,YAAY,IAAI,CAAC,OAAO;AAAA,MACjD,IAAI,EAAE;AAAA,MACN,QAAQ,EAAE;AAAA,MACV,GAAG,EAAE;AAAA,IACP,EAAE;AAAA,EACJ,CAAC;AAID,MAAI,KAAK,iBAAiB,cAAc,SAAS,SAAS,GAAG;AAC3D,UAAM,KAAK,cAAc,OAAO,KAAK,OAAO,cAAc,QAAQ;AAClE,UAAM,KAAK;AAAA,MACT,MAAM;AAAA,MACN,OAAO,KAAK;AAAA,MACZ,OAAO,cAAc,SAAS;AAAA,IAChC,CAAC;AAAA,EACH;AAGA,MAAI,OAA4B;AAChC,MAAI,iBAAiB,cAAc,SAAS,SAAS,GAAG;AACtD,WAAO;AAAA,MACL,SAAS,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE;AAAA,MAC9B,cAAc,SAAS,IAAI,CAAC,OAAO,EAAE,GAAG,GAAG,QAAQ,KAAK,MAAM,EAAE;AAAA,IAClE;AACA,QAAI,oBAAoB;AAAA,MACtB,UAAU,KAAK,SAAS;AAAA,MACxB,aAAa,KAAK,YAAY;AAAA,MAC9B,WAAW,KAAK,UAAU;AAAA,MAC1B,SAAS,KAAK,QAAQ;AAAA,IACxB,CAAC;AACD,UAAM,KAAK;AAAA,MACT,MAAM;AAAA,MACN,OAAO,KAAK;AAAA,MACZ;AAAA,MACA,UAAU,KAAK,SAAS;AAAA,MACxB,aAAa,KAAK,YAAY;AAAA,MAC9B,WAAW,KAAK,UAAU;AAAA,MAC1B,SAAS,KAAK,QAAQ;AAAA,IACxB,CAAC;AAAA,EACH;AAGA,MAAI,YAA+C;AACnD,MAAI,KAAK,kBAAkB;AACzB,gBAAY,MAAM,oBAAoB,MAAM,cAAc,UAAU,KAAK,IAAI;AAAA,EAC/E;AAGA,MAAI,cAA+C;AACnD,MAAI,KAAK,oBAAoB;AAC3B,kBAAc,MAAM,sBAAsB,MAAM,cAAc,UAAU,KAAK,IAAI;AAAA,EACnF;AAEA,QAAM,KAAK;AAAA,IACT,MAAM;AAAA,IACN,OAAO,KAAK;AAAA,IACZ,YAAY,KAAK,IAAI,IAAI;AAAA,EAC3B,CAAC;AAED,SAAO;AAAA,IACL,OAAO,KAAK;AAAA,IACZ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAIA,SAAS,YAAY,SAAiD;AACpE,MAAI,CAAC,QAAS,QAAO,YAAY;AAAA,EAAC;AAClC,SAAO,OAAO,UAAU;AACtB,UAAM,QAAQ,KAAK;AAAA,EACrB;AACF;AAEA,eAAe,YACb,MACA,eACA,MAC2B;AAC3B,QAAM,MAAM,KAAK;AACjB,MAAI,OAAO,IAAI,cAAc,cAAc,KAAK,SAAS;AACvD,QAAI,QAAiC;AACrC,qBAAiB,MAAM,IAAI,UAAU,KAAK,OAAO,KAAK,QAAQ,EAAE,cAAc,CAAC,GAAG;AAChF,YAAM,KAAK,EAAE,MAAM,WAAW,OAAO,KAAK,OAAO,OAAO,GAAG,CAAC;AAC5D,UAAI,GAAG,SAAS,gBAAiB,SAAQ,GAAG;AAAA,IAC9C;AACA,QAAI,CAAC,OAAO;AACV,YAAM,IAAI,MAAM,sEAAsE;AAAA,IACxF;AACA,WAAO;AAAA,EACT;AACA,SAAO,KAAK,SAAS,IAAI,KAAK,OAAO,KAAK,QAAQ,EAAE,cAAc,CAAC;AACrE;AAEA,SAAS,qBAAqB,MAAyC;AACrE,MAAI,KAAK,kBAAkB,KAAM,QAAO;AACxC,MAAI,OAAO,KAAK,kBAAkB,SAAU,QAAO,KAAK;AACxD,MAAI,CAAC,KAAK,cAAe,QAAO;AAChC,QAAM,MAAM,KAAK,cAAc,QAAQ;AACvC,MAAI,OAAsB;AAC1B,aAAW,OAAO,KAAK;AACrB,QAAI,IAAI,WAAW,KAAK,MAAO;AAC/B,WAAO,IAAI;AAAA,EACb;AACA,SAAO;AACT;AAEA,SAAS,wBACP,OACA,UACA,UAC2F;AAC3F,MAAI,aAAa,UAAU,MAAM,WAAW,EAAG,QAAO;AACtD,QAAM,WAAW,MAAM,IAAI,CAAC,EAAE,QAAQ,SAAS,GAAG,KAAK,MAAM,IAAsB;AACnF,MAAI,aAAa,YAAY;AAC3B,WAAO,EAAE,KAAK,SAAS;AAAA,EACzB;AACA,OAAK;AACL,SAAO;AACT;AAEA,eAAe,oBACb,MACA,UACA,KACA,MACqC;AACrC,QAAM,UAAU,KAAK;AACrB,QAAM,QAAQ,MAAM,QAAQ,oBAAoB,QAAQ;AACxD,MAAI,iCAAiC;AAAA,IACnC,WAAW,MAAM,UAAU;AAAA,IAC3B,SAAS,MAAM;AAAA,IACf,QAAQ,MAAM,OAAO;AAAA,EACvB,CAAC;AACD,QAAM,KAAK;AAAA,IACT,MAAM;AAAA,IACN,OAAO,KAAK;AAAA,IACZ,eAAe,MAAM,UAAU;AAAA,IAC/B,SAAS,MAAM;AAAA,IACf,QAAQ,MAAM,OAAO;AAAA,EACvB,CAAC;AAED,QAAM,OAAO,KAAK,WAAW,aAAa;AAC1C,QAAM,YAAY,KAAK,WAAW,gCAAgC;AAElE,MAAI,CAAC,QAAQ,CAAC,QAAQ,OAAO;AAC3B,UAAM,KAAK;AAAA,MACT,MAAM;AAAA,MACN,OAAO,KAAK;AAAA,MACZ,cAAc;AAAA,MACd,mBAAmB,MAAM,UAAU;AAAA,IACrC,CAAC;AACD,WAAO;AAAA,MACL,WAAW,MAAM;AAAA,MACjB,SAAS,CAAC;AAAA,MACV,SAAS,MAAM;AAAA,MACf,QAAQ,MAAM;AAAA,MACd,qBAAqB,MAAM,UAAU;AAAA,IACvC;AAAA,EACF;AAEA,QAAM,eAAe,IAAI,IAAI,SAAS,IAAI,CAAC,MAAM,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC;AACnE,QAAM,OAAoB,CAAC;AAC3B,MAAI,WAAW;AACf,aAAW,KAAK,MAAM,WAA8D;AAClF,UAAM,MAAM,EAAE,kBAAkB,aAAa,IAAI,EAAE,eAAe,IAAI;AACtE,QAAI,CAAC,KAAK;AACR,kBAAY;AACZ;AAAA,IACF;AACA,QAAI,IAAI,aAAa,WAAW;AAC9B,kBAAY;AACZ;AAAA,IACF;AACA,SAAK,KAAK,CAAC;AAAA,EACb;AACA,QAAM,SAAS,MAAM,QAAQ,MAAM,IAAI;AACvC,MAAI,mBAAmB;AAAA,IACrB,SAAS,OAAO,QAAQ;AAAA,IACxB,qBAAqB;AAAA,IACrB,UAAU,OAAO,SAAS;AAAA,EAC5B,CAAC;AACD,QAAM,KAAK;AAAA,IACT,MAAM;AAAA,IACN,OAAO,KAAK;AAAA,IACZ,cAAc,OAAO,QAAQ;AAAA,IAC7B,mBAAmB;AAAA,EACrB,CAAC;AACD,SAAO;AAAA,IACL,WAAW,MAAM;AAAA,IACjB,SAAS,OAAO;AAAA,IAChB,SAAS,MAAM;AAAA,IACf,QAAQ,MAAM;AAAA,IACd,qBAAqB;AAAA,EACvB;AACF;AAEA,eAAe,sBACb,MACA,UACA,KACA,MACmC;AACnC,QAAM,UAAU,KAAK;AACrB,QAAM,QAAQ,MAAM,QAAQ,oBAAoB,QAAQ;AACxD,MAAI,mCAAmC;AAAA,IACrC,OAAO,MAAM,MAAM;AAAA,IACnB,SAAS,MAAM;AAAA,IACf,QAAQ,MAAM,OAAO;AAAA,EACvB,CAAC;AACD,QAAM,KAAK;AAAA,IACT,MAAM;AAAA,IACN,OAAO,KAAK;AAAA,IACZ,WAAW,MAAM,MAAM;AAAA,IACvB,SAAS,MAAM;AAAA,IACf,QAAQ,MAAM,OAAO;AAAA,EACvB,CAAC;AAED,QAAM,OAAO,KAAK,WAAW,eAAe;AAC5C,QAAM,YAAY,KAAK,WAAW,kCAAkC;AAEpE,MAAI,CAAC,QAAQ,CAAC,QAAQ,OAAO;AAC3B,UAAM,KAAK;AAAA,MACT,MAAM;AAAA,MACN,OAAO,KAAK;AAAA,MACZ,cAAc;AAAA,MACd,mBAAmB,MAAM,MAAM;AAAA,IACjC,CAAC;AACD,WAAO;AAAA,MACL,OAAO,MAAM;AAAA,MACb,SAAS,CAAC;AAAA,MACV,SAAS,MAAM;AAAA,MACf,QAAQ,MAAM;AAAA,MACd,qBAAqB,MAAM,MAAM;AAAA,IACnC;AAAA,EACF;AAEA,QAAM,eAAe,IAAI,IAAI,SAAS,IAAI,CAAC,MAAM,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC;AACnE,QAAM,OAAgB,CAAC;AACvB,MAAI,WAAW;AACf,aAAW,KAAK,MAAM,OAAsD;AAC1E,UAAM,MAAM,EAAE,kBAAkB,aAAa,IAAI,EAAE,eAAe,IAAI;AACtE,QAAI,CAAC,OAAO,IAAI,aAAa,WAAW;AACtC,kBAAY;AACZ;AAAA,IACF;AACA,SAAK,KAAK,CAAC;AAAA,EACb;AACA,QAAM,SAAS,MAAM,QAAQ,MAAM,IAAI;AACvC,MAAI,qBAAqB;AAAA,IACvB,SAAS,OAAO,QAAQ;AAAA,IACxB,qBAAqB;AAAA,IACrB,UAAU,OAAO,SAAS;AAAA,EAC5B,CAAC;AACD,QAAM,KAAK;AAAA,IACT,MAAM;AAAA,IACN,OAAO,KAAK;AAAA,IACZ,cAAc,OAAO,QAAQ;AAAA,IAC7B,mBAAmB;AAAA,EACrB,CAAC;AACD,SAAO;AAAA,IACL,OAAO,MAAM;AAAA,IACb,SAAS,OAAO;AAAA,IAChB,SAAS,MAAM;AAAA,IACf,QAAQ,MAAM;AAAA,IACd,qBAAqB;AAAA,EACvB;AACF;AAEA,SAAS,WAAW,KAAa,QAAwC;AACvE,MAAI,OAAQ,SAAQ,IAAI,kBAAkB,GAAG,IAAI,MAAM;AAAA,MAClD,SAAQ,IAAI,kBAAkB,GAAG,EAAE;AAC1C;;;ACxSO,SAAS,wBACd,MAC+E;AAC/E,QAAM,YAAY,KAAK,SAAS,WAAW,aAAa,CAAC;AACzD,MAAI;AACJ,SAAO,OAAO,EAAE,QAAQ,MAAkC;AACxD,UAAM,aAAa,uBAAuB,OAAiD;AAC3F,UAAM,QAAQ,GAAG,SAAS,KAAK,QAAQ,MAAM;AAC7C,UAAM,SAAS,MAAM,eAAe;AAAA,MAClC;AAAA,MACA,UAAU,KAAK;AAAA,MACf,QAAQ,EAAE,WAAW;AAAA,MACrB,eAAe,KAAK,iBAAiB;AAAA;AAAA,MAErC,eAAe;AAAA,MACf,uBAAuB,KAAK,yBAAyB;AAAA,IACvD,CAAC;AACD,iBAAa;AACb,WAAO,OAAO,cAAc;AAAA,EAC9B;AACF;","names":[]}

package/dist/chunk-IJ6FGOPO.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/mcp/executor.ts","../src/mcp/delegates.ts"],"sourcesContent":["/**\n * @experimental\n *\n * Delegation executors — the layer between MCP delegates and the sandbox\n * substrate. Each executor exposes a {@link LoopSandboxClient} the kernel\n * consumes plus a placement tag so the trace pipeline can correlate workers\n * with their physical placement.\n *\n * Two implementations ship in-box:\n *\n * - {@link createSiblingSandboxExecutor} — every delegation spawns a fresh\n *   sandbox sibling to the caller. Default when the MCP server runs as a\n *   standalone CLI mounted outside a fleet.\n *\n * - {@link createFleetWorkspaceExecutor} — delegations dispatch onto machines\n *   in the caller's existing fleet so worker diffs land directly on the\n *   caller's filesystem (the fleet's shared workspace). Selected when the\n *   parent sandbox passes `TANGLE_FLEET_ID` into the MCP server's env.\n */\n\nimport type { CreateSandboxOptions, SandboxInstance } from '@tangle-network/sandbox'\nimport type { LoopSandboxClient, LoopSandboxPlacement } from '../runtime'\n\n/** @experimental */\nexport interface DelegationExecutor {\n  /** Sandbox client the kernel calls. Returned with `describePlacement` set. */\n  readonly client: LoopSandboxClient\n  /** Best-effort one-liner used in stderr boot logs and diagnostics. */\n  describe(): string\n}\n\n/** @experimental */\nexport interface SiblingSandboxExecutorOptions {\n  client: LoopSandboxClient\n}\n\n/**\n * Wrap a raw sandbox SDK client so the kernel emits\n * `loop.iteration.dispatch` events with `{ placement: 'sibling', sandboxId }`.\n *\n * The returned client `.create()` delegates to the underlying client; the\n * only added behavior is a `describePlacement` tag the kernel reads.\n *\n * @experimental\n */\nexport function createSiblingSandboxExecutor(\n  options: SiblingSandboxExecutorOptions,\n): DelegationExecutor {\n  const underlying = options.client\n  const client: LoopSandboxClient = {\n    create(opts?: CreateSandboxOptions): Promise<SandboxInstance> {\n      return underlying.create(opts)\n    },\n    describePlacement(box: SandboxInstance): LoopSandboxPlacement {\n      return { kind: 'sibling', sandboxId: readId(box) }\n    },\n  }\n  return {\n    client,\n    describe(): string {\n      return 'sibling-sandbox (each delegation = fresh sandbox via client.create)'\n    },\n  }\n}\n\n/**\n * Minimal `SandboxFleet` surface the fleet executor calls. Declared\n * structurally so tests can pass an in-memory stub without instantiating the\n * sandbox SDK.\n *\n * @experimental\n */\nexport interface FleetHandle {\n  readonly fleetId: string\n  /** Machine ids in dispatch-eligible order. The executor round-robins. */\n  readonly ids: ReadonlyArray<string>\n  /** Resolve a machine id to its `SandboxInstance` — that machine is mounted\n   * on the fleet's shared workspace, so any diff the worker writes lands on\n   * every other fleet machine's filesystem too. */\n  sandbox(machineId: string): Promise<SandboxInstance>\n}\n\n/** @experimental */\nexport interface FleetWorkspaceExecutorOptions {\n  fleet: FleetHandle\n  /**\n   * Override the machine-selection policy. Default = round-robin across\n   * `fleet.ids`, skipping the optional `excludeMachineIds` set (typically the\n   * coordinator machine the MCP server is running on).\n   */\n  selectMachine?: (call: { callIndex: number; ids: ReadonlyArray<string> }) => string\n  /**\n   * Machine ids to skip during default round-robin. Set to the caller's own\n   * machineId so workers don't compete with the orchestrator on the same VM.\n   */\n  excludeMachineIds?: ReadonlyArray<string>\n}\n\n/**\n * Build an executor that resolves each delegated iteration to an existing\n * machine in `fleet`. The fleet's shared-workspace policy means the worker\n * machine sees the caller's filesystem — diffs land in-place with no\n * cross-sandbox copy step.\n *\n * @experimental\n */\nexport function createFleetWorkspaceExecutor(\n  options: FleetWorkspaceExecutorOptions,\n): DelegationExecutor {\n  const fleet = options.fleet\n  const exclude = new Set(options.excludeMachineIds ?? [])\n  let callIndex = 0\n  // machineId-by-sandboxId, populated as we resolve machines so\n  // `describePlacement` can recover the assignment from the SandboxInstance\n  // the kernel hands back.\n  const placementBySandboxId = new Map<string, { machineId: string }>()\n\n  const client: LoopSandboxClient = {\n    async create(): Promise<SandboxInstance> {\n      const ids = fleet.ids.filter((id) => !exclude.has(id))\n      if (ids.length === 0) {\n        throw new Error(\n          `agent-runtime: fleet ${fleet.fleetId} has no eligible worker machines (ids=[${fleet.ids.join(',')}], excluded=[${[...exclude].join(',')}])`,\n        )\n      }\n      const selector = options.selectMachine\n      const machineId = selector ? selector({ callIndex, ids }) : ids[callIndex % ids.length]\n      callIndex += 1\n      if (typeof machineId !== 'string' || machineId.length === 0) {\n        throw new Error('agent-runtime: fleet executor selectMachine returned an empty machine id')\n      }\n      const box = await fleet.sandbox(machineId)\n      const sandboxId = readId(box)\n      if (sandboxId) placementBySandboxId.set(sandboxId, { machineId })\n      return box\n    },\n    describePlacement(box: SandboxInstance): LoopSandboxPlacement {\n      const sandboxId = readId(box)\n      const recorded = sandboxId ? placementBySandboxId.get(sandboxId) : undefined\n      return {\n        kind: 'fleet',\n        sandboxId,\n        fleetId: fleet.fleetId,\n        machineId: recorded?.machineId,\n      }\n    },\n  }\n\n  return {\n    client,\n    describe(): string {\n      const excluded = exclude.size > 0 ? ` (excluded=[${[...exclude].join(',')}])` : ''\n      return `fleet-workspace (fleetId=${fleet.fleetId}, machines=[${fleet.ids.join(',')}]${excluded})`\n    },\n  }\n}\n\nfunction readId(box: SandboxInstance): string | undefined {\n  const raw = (box as unknown as { id?: unknown }).id\n  return typeof raw === 'string' && raw.length > 0 ? raw : undefined\n}\n","/**\n * @experimental\n *\n * Delegate factories — the layer between MCP tool handlers and the\n * underlying `runLoop` runners.\n *\n * The MCP server is profile-agnostic: it owns the task queue + feedback\n * store + transport. Each `*Delegate` is the closure that the queue\n * invokes when a task runs. Consumers can override either delegate to\n * inject custom drivers, mocks, fleet-aware dispatchers, etc.\n *\n * The default coder delegate is wired here because we own\n * `coderProfile` / `multiHarnessCoderFanout`. The default researcher\n * delegate is **not** wired in this file — `agent-knowledge` cannot be\n * imported from `agent-runtime` without inducing a cycle. Consumers\n * pass `researcherDelegate` explicitly when constructing the server.\n */\n\nimport { type CoderOutput, coderProfile, multiHarnessCoderFanout } from '../profiles/coder'\nimport type { Iteration, LoopSandboxClient, LoopTraceEmitter } from '../runtime'\nimport { runLoop } from '../runtime'\nimport { createSiblingSandboxExecutor, type DelegationExecutor } from './executor'\nimport type {\n  CoderTask,\n  DelegateCodeArgs,\n  DelegateResearchArgs,\n  DelegateUiAuditArgs,\n  DelegationProgress,\n  ResearchOutputShape,\n  UiAuditorDelegationOutput,\n} from './types'\n\n/** @experimental */\nexport interface DelegateRunCtx {\n  signal: AbortSignal\n  report(progress: DelegationProgress): void\n}\n\n/** @experimental */\nexport type CoderDelegate = (\n  args: DelegateCodeArgs,\n  ctx: DelegateRunCtx,\n) => Promise<import('../profiles/coder').CoderOutput>\n\n/** @experimental */\nexport type ResearcherDelegate = (\n  args: DelegateResearchArgs,\n  ctx: DelegateRunCtx,\n) => Promise<ResearchOutputShape>\n\n/**\n * UI-auditor delegate — fully consumer-injected. agent-runtime ships no\n * default factory because the inputs are workspace path + judge function\n * + (optionally) a `LoopSandboxClient`, and the judge is the consumer's\n * model seam. See `createInProcessUiAuditClient` + `uiAuditorProfile` in\n * `@tangle-network/agent-runtime/profiles` for the canonical wiring.\n *\n * @experimental\n */\nexport type UiAuditorDelegate = (\n  args: DelegateUiAuditArgs,\n  ctx: DelegateRunCtx,\n) => Promise<UiAuditorDelegationOutput>\n\n/** @experimental Structured review verdict over a coder candidate. */\nexport interface CoderReview {\n  /** Gate: only approved candidates are eligible to win. */\n  approved: boolean\n  /** Reviewer's recommendation — surfaced in traces. */\n  recommendation: 'ship' | 'approve-with-nits' | 'changes-requested' | 'reject'\n  /** Readiness 0..1, used by the `highest-readiness` winner-selection strategy. */\n  readiness: number\n  notes?: string\n}\n\n/**\n * @experimental\n *\n * Optional adversarial reviewer over a coder candidate that already passed\n * mechanical validation (tests/typecheck/forbidden/diff/no-op/secrets). Folded\n * from the ai-trading-blueprint delegation MCP: a candidate is only eligible to\n * win if the reviewer approves it. The reviewer is the consumer's seam — an LLM\n * judge, a `pnpm review` command, anything returning a `CoderReview`.\n */\nexport type CoderReviewer = (\n  output: import('../profiles/coder').CoderOutput,\n  task: CoderTask,\n  ctx: { signal: AbortSignal },\n) => Promise<CoderReview> | CoderReview\n\n/**\n * @experimental Winner-selection strategy among validated (+ reviewed)\n * candidates. `highest-readiness` requires a `reviewer`. Default `highest-score`\n * (the kernel's behavior — preserves backward compatibility).\n */\nexport type CoderWinnerSelection =\n  | 'highest-score'\n  | 'smallest-diff'\n  | 'highest-readiness'\n  | 'first-approved'\n\n/** @experimental */\nexport interface CreateDefaultCoderDelegateOptions {\n  /**\n   * Execution placement. Pass a {@link DelegationExecutor} (sibling or fleet)\n   * to control where worker iterations land. `sandboxClient` is a\n   * convenience shorthand that wraps the client in a sibling executor — pass\n   * one or the other, not both.\n   */\n  executor?: DelegationExecutor\n  /**\n   * Convenience shorthand for sibling placement. Equivalent to\n   * `executor: createSiblingSandboxExecutor({ client: sandboxClient })`.\n   */\n  sandboxClient?: LoopSandboxClient\n  /** Default `['claude-code', 'codex', 'opencode/zai-coding-plan/glm-5.1']` when variants > 1. */\n  fanoutHarnesses?: string[]\n  /** Hard cap on the kernel's per-batch concurrency. Default 4. */\n  maxConcurrency?: number\n  /**\n   * Optional adversarial reviewer. When set, a candidate must pass mechanical\n   * validation AND `reviewer.approved` to be eligible to win — empty/secret/\n   * test-failing patches are already gone; this catches the \"compiles + passes\n   * but wrong/unsafe\" class the deterministic validator can't see.\n   */\n  reviewer?: CoderReviewer\n  /** Winner-selection strategy among eligible candidates. Default `highest-score`. */\n  winnerSelection?: CoderWinnerSelection\n  /**\n   * Loop trace emitter forwarded into every delegated `runLoop`. Wire\n   * `createPropagatingTraceEmitter(readTraceContextFromEnv())` here (the bin\n   * does) so delegated build-loops export their topology spans to the OTLP /\n   * Tangle Intelligence sink when `OTEL_EXPORTER_OTLP_ENDPOINT` is set — and\n   * are a cheap no-op when it isn't. Configurable by construction.\n   */\n  traceEmitter?: LoopTraceEmitter\n}\n\n/**\n * Build a coder delegate that drives `runLoop` against the project's\n * sandbox client + coder profile. When `args.variants > 1` it switches\n * to the multi-harness fanout topology.\n *\n * @experimental\n */\nexport function createDefaultCoderDelegate(\n  options: CreateDefaultCoderDelegateOptions,\n): CoderDelegate {\n  const executor = resolveExecutor(options)\n  const sandboxClient = executor.client\n  const fanoutHarnesses = options.fanoutHarnesses\n  const maxConcurrency = options.maxConcurrency ?? 4\n  const traceEmitter = options.traceEmitter\n  return async (args, ctx) => {\n    const task: CoderTask = {\n      goal: buildCoderGoal(args),\n      repoRoot: args.repoRoot,\n      testCmd: args.config?.testCmd,\n      typecheckCmd: args.config?.typecheckCmd,\n      forbiddenPaths: args.config?.forbiddenPaths,\n      maxDiffLines: args.config?.maxDiffLines,\n    }\n    const variants = Math.max(1, Math.trunc(args.variants ?? 1))\n    ctx.report({ iteration: 0, phase: 'starting' })\n    if (variants <= 1) {\n      const { agentRunSpec, output, validator } = coderProfile({ task })\n      const result = await runLoop({\n        driver: singleShotDriver,\n        agentRun: agentRunSpec,\n        output,\n        validator,\n        task,\n        ctx: { sandboxClient, signal: ctx.signal, ...(traceEmitter ? { traceEmitter } : {}) },\n        maxIterations: 1,\n        maxConcurrency,\n      })\n      const chosen = await pickCoderWinner({\n        iterations: result.iterations,\n        reviewer: options.reviewer,\n        selection: options.winnerSelection ?? 'highest-score',\n        task,\n        signal: ctx.signal,\n      })\n      if (!chosen) throw new Error(noWinnerMessage(options.reviewer))\n      ctx.report({ iteration: 1, phase: 'completed' })\n      return chosen\n    }\n    const fanout = multiHarnessCoderFanout(\n      fanoutHarnesses && fanoutHarnesses.length > 0\n        ? { harnesses: fanoutHarnesses.slice(0, variants) }\n        : { harnesses: undefined },\n    )\n    const agentRuns = fanout.agentRuns.slice(0, variants)\n    const result = await runLoop({\n      driver: fanout.driver,\n      agentRuns,\n      output: fanout.output,\n      validator: fanout.validator,\n      task,\n      ctx: { sandboxClient, signal: ctx.signal, ...(traceEmitter ? { traceEmitter } : {}) },\n      maxIterations: variants,\n      maxConcurrency: Math.min(maxConcurrency, variants),\n    })\n    const chosen = await pickCoderWinner({\n      iterations: result.iterations,\n      reviewer: options.reviewer,\n      selection: options.winnerSelection ?? 'highest-score',\n      task,\n      signal: ctx.signal,\n    })\n    if (!chosen) throw new Error(noWinnerMessage(options.reviewer))\n    ctx.report({ iteration: agentRuns.length, phase: 'completed' })\n    return chosen\n  }\n}\n\ninterface PickCoderWinnerArgs {\n  iterations: ReadonlyArray<Iteration<CoderTask, CoderOutput>>\n  reviewer: CoderReviewer | undefined\n  selection: CoderWinnerSelection\n  task: CoderTask\n  signal: AbortSignal\n}\n\ninterface CoderCandidate {\n  index: number\n  output: CoderOutput\n  score: number\n  readiness: number\n}\n\n/**\n * Pick the winning coder candidate from a finished loop's iterations:\n *   1. keep only mechanically-VALID candidates (the validator already gated\n *      tests/typecheck/forbidden/diff/no-op/secrets),\n *   2. if a `reviewer` is wired, keep only those it APPROVES,\n *   3. select among survivors by the chosen strategy.\n * Returns `undefined` when nothing survives — the delegate fails loud.\n */\nasync function pickCoderWinner(args: PickCoderWinnerArgs): Promise<CoderOutput | undefined> {\n  const valid: CoderCandidate[] = []\n  for (const iter of args.iterations) {\n    if (iter.output === undefined || iter.error || iter.verdict?.valid !== true) continue\n    valid.push({\n      index: iter.index,\n      output: iter.output,\n      score: iter.verdict.score ?? 0,\n      readiness: iter.verdict.score ?? 0,\n    })\n  }\n  if (valid.length === 0) return undefined\n\n  let eligible = valid\n  if (args.reviewer) {\n    eligible = []\n    for (const c of valid) {\n      const review = await args.reviewer(c.output, args.task, { signal: args.signal })\n      if (review.approved) eligible.push({ ...c, readiness: review.readiness })\n    }\n    if (eligible.length === 0) return undefined\n  }\n\n  return selectCoderCandidate(eligible, args.selection).output\n}\n\n/** Apply the winner-selection strategy; ties broken by earliest iteration. */\nfunction selectCoderCandidate(\n  candidates: CoderCandidate[],\n  selection: CoderWinnerSelection,\n): CoderCandidate {\n  const diffLines = (c: CoderCandidate) =>\n    c.output.diffStats.insertions + c.output.diffStats.deletions\n  const sorted = [...candidates].sort((a, b) => {\n    switch (selection) {\n      case 'smallest-diff':\n        return diffLines(a) - diffLines(b) || a.index - b.index\n      case 'highest-readiness':\n        return b.readiness - a.readiness || a.index - b.index\n      case 'first-approved':\n        return a.index - b.index\n      default:\n        return b.score - a.score || a.index - b.index\n    }\n  })\n  return sorted[0]!\n}\n\nfunction noWinnerMessage(reviewer: CoderReviewer | undefined): string {\n  return reviewer\n    ? 'coder delegate: no candidate passed validation + review'\n    : 'coder delegate: no candidate passed validation'\n}\n\nfunction buildCoderGoal(args: DelegateCodeArgs): string {\n  if (!args.contextHint) return args.goal\n  return [args.goal, '', '## Context', args.contextHint].join('\\n')\n}\n\nfunction resolveExecutor(options: CreateDefaultCoderDelegateOptions): DelegationExecutor {\n  if (options.executor && options.sandboxClient) {\n    throw new Error('createDefaultCoderDelegate: pass exactly one of `executor` or `sandboxClient`')\n  }\n  if (options.executor) return options.executor\n  if (options.sandboxClient) {\n    return createSiblingSandboxExecutor({ client: options.sandboxClient })\n  }\n  throw new Error('createDefaultCoderDelegate: `executor` or `sandboxClient` is required')\n}\n\n/**\n * Single-shot driver — plan one task on iteration 0, stop after one\n * iteration. Used by the coder delegate when `variants <= 1`. Keeps the\n * runLoop kernel-level accounting (timing, cost, trace emission) while\n * skipping fanout/refine topology overhead.\n */\nconst singleShotDriver = {\n  name: 'mcp-single-shot',\n  async plan<Task>(task: Task, history: ReadonlyArray<unknown>): Promise<Task[]> {\n    return history.length === 0 ? [task] : []\n  },\n  decide(history: ReadonlyArray<unknown>): 'pick-winner' | 'fail' {\n    return history.length > 0 ? 'pick-winner' : 'fail'\n  },\n}\n"],"mappings":";;;;;;;;;AA6CO,SAAS,6BACd,SACoB;AACpB,QAAM,aAAa,QAAQ;AAC3B,QAAM,SAA4B;AAAA,IAChC,OAAO,MAAuD;AAC5D,aAAO,WAAW,OAAO,IAAI;AAAA,IAC/B;AAAA,IACA,kBAAkB,KAA4C;AAC5D,aAAO,EAAE,MAAM,WAAW,WAAW,OAAO,GAAG,EAAE;AAAA,IACnD;AAAA,EACF;AACA,SAAO;AAAA,IACL;AAAA,IACA,WAAmB;AACjB,aAAO;AAAA,IACT;AAAA,EACF;AACF;AA2CO,SAAS,6BACd,SACoB;AACpB,QAAM,QAAQ,QAAQ;AACtB,QAAM,UAAU,IAAI,IAAI,QAAQ,qBAAqB,CAAC,CAAC;AACvD,MAAI,YAAY;AAIhB,QAAM,uBAAuB,oBAAI,IAAmC;AAEpE,QAAM,SAA4B;AAAA,IAChC,MAAM,SAAmC;AACvC,YAAM,MAAM,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,QAAQ,IAAI,EAAE,CAAC;AACrD,UAAI,IAAI,WAAW,GAAG;AACpB,cAAM,IAAI;AAAA,UACR,wBAAwB,MAAM,OAAO,0CAA0C,MAAM,IAAI,KAAK,GAAG,CAAC,gBAAgB,CAAC,GAAG,OAAO,EAAE,KAAK,GAAG,CAAC;AAAA,QAC1I;AAAA,MACF;AACA,YAAM,WAAW,QAAQ;AACzB,YAAM,YAAY,WAAW,SAAS,EAAE,WAAW,IAAI,CAAC,IAAI,IAAI,YAAY,IAAI,MAAM;AACtF,mBAAa;AACb,UAAI,OAAO,cAAc,YAAY,UAAU,WAAW,GAAG;AAC3D,cAAM,IAAI,MAAM,0EAA0E;AAAA,MAC5F;AACA,YAAM,MAAM,MAAM,MAAM,QAAQ,SAAS;AACzC,YAAM,YAAY,OAAO,GAAG;AAC5B,UAAI,UAAW,sBAAqB,IAAI,WAAW,EAAE,UAAU,CAAC;AAChE,aAAO;AAAA,IACT;AAAA,IACA,kBAAkB,KAA4C;AAC5D,YAAM,YAAY,OAAO,GAAG;AAC5B,YAAM,WAAW,YAAY,qBAAqB,IAAI,SAAS,IAAI;AACnE,aAAO;AAAA,QACL,MAAM;AAAA,QACN;AAAA,QACA,SAAS,MAAM;AAAA,QACf,WAAW,UAAU;AAAA,MACvB;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA,WAAmB;AACjB,YAAM,WAAW,QAAQ,OAAO,IAAI,eAAe,CAAC,GAAG,OAAO,EAAE,KAAK,GAAG,CAAC,OAAO;AAChF,aAAO,4BAA4B,MAAM,OAAO,eAAe,MAAM,IAAI,KAAK,GAAG,CAAC,IAAI,QAAQ;AAAA,IAChG;AAAA,EACF;AACF;AAEA,SAAS,OAAO,KAA0C;AACxD,QAAM,MAAO,IAAoC;AACjD,SAAO,OAAO,QAAQ,YAAY,IAAI,SAAS,IAAI,MAAM;AAC3D;;;ACfO,SAAS,2BACd,SACe;AACf,QAAM,WAAW,gBAAgB,OAAO;AACxC,QAAM,gBAAgB,SAAS;AAC/B,QAAM,kBAAkB,QAAQ;AAChC,QAAM,iBAAiB,QAAQ,kBAAkB;AACjD,QAAM,eAAe,QAAQ;AAC7B,SAAO,OAAO,MAAM,QAAQ;AAC1B,UAAM,OAAkB;AAAA,MACtB,MAAM,eAAe,IAAI;AAAA,MACzB,UAAU,KAAK;AAAA,MACf,SAAS,KAAK,QAAQ;AAAA,MACtB,cAAc,KAAK,QAAQ;AAAA,MAC3B,gBAAgB,KAAK,QAAQ;AAAA,MAC7B,cAAc,KAAK,QAAQ;AAAA,IAC7B;AACA,UAAM,WAAW,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,YAAY,CAAC,CAAC;AAC3D,QAAI,OAAO,EAAE,WAAW,GAAG,OAAO,WAAW,CAAC;AAC9C,QAAI,YAAY,GAAG;AACjB,YAAM,EAAE,cAAc,QAAQ,UAAU,IAAI,aAAa,EAAE,KAAK,CAAC;AACjE,YAAMA,UAAS,MAAM,QAAQ;AAAA,QAC3B,QAAQ;AAAA,QACR,UAAU;AAAA,QACV;AAAA,QACA;AAAA,QACA;AAAA,QACA,KAAK,EAAE,eAAe,QAAQ,IAAI,QAAQ,GAAI,eAAe,EAAE,aAAa,IAAI,CAAC,EAAG;AAAA,QACpF,eAAe;AAAA,QACf;AAAA,MACF,CAAC;AACD,YAAMC,UAAS,MAAM,gBAAgB;AAAA,QACnC,YAAYD,QAAO;AAAA,QACnB,UAAU,QAAQ;AAAA,QAClB,WAAW,QAAQ,mBAAmB;AAAA,QACtC;AAAA,QACA,QAAQ,IAAI;AAAA,MACd,CAAC;AACD,UAAI,CAACC,QAAQ,OAAM,IAAI,MAAM,gBAAgB,QAAQ,QAAQ,CAAC;AAC9D,UAAI,OAAO,EAAE,WAAW,GAAG,OAAO,YAAY,CAAC;AAC/C,aAAOA;AAAA,IACT;AACA,UAAM,SAAS;AAAA,MACb,mBAAmB,gBAAgB,SAAS,IACxC,EAAE,WAAW,gBAAgB,MAAM,GAAG,QAAQ,EAAE,IAChD,EAAE,WAAW,OAAU;AAAA,IAC7B;AACA,UAAM,YAAY,OAAO,UAAU,MAAM,GAAG,QAAQ;AACpD,UAAM,SAAS,MAAM,QAAQ;AAAA,MAC3B,QAAQ,OAAO;AAAA,MACf;AAAA,MACA,QAAQ,OAAO;AAAA,MACf,WAAW,OAAO;AAAA,MAClB;AAAA,MACA,KAAK,EAAE,eAAe,QAAQ,IAAI,QAAQ,GAAI,eAAe,EAAE,aAAa,IAAI,CAAC,EAAG;AAAA,MACpF,eAAe;AAAA,MACf,gBAAgB,KAAK,IAAI,gBAAgB,QAAQ;AAAA,IACnD,CAAC;AACD,UAAM,SAAS,MAAM,gBAAgB;AAAA,MACnC,YAAY,OAAO;AAAA,MACnB,UAAU,QAAQ;AAAA,MAClB,WAAW,QAAQ,mBAAmB;AAAA,MACtC;AAAA,MACA,QAAQ,IAAI;AAAA,IACd,CAAC;AACD,QAAI,CAAC,OAAQ,OAAM,IAAI,MAAM,gBAAgB,QAAQ,QAAQ,CAAC;AAC9D,QAAI,OAAO,EAAE,WAAW,UAAU,QAAQ,OAAO,YAAY,CAAC;AAC9D,WAAO;AAAA,EACT;AACF;AAyBA,eAAe,gBAAgB,MAA6D;AAC1F,QAAM,QAA0B,CAAC;AACjC,aAAW,QAAQ,KAAK,YAAY;AAClC,QAAI,KAAK,WAAW,UAAa,KAAK,SAAS,KAAK,SAAS,UAAU,KAAM;AAC7E,UAAM,KAAK;AAAA,MACT,OAAO,KAAK;AAAA,MACZ,QAAQ,KAAK;AAAA,MACb,OAAO,KAAK,QAAQ,SAAS;AAAA,MAC7B,WAAW,KAAK,QAAQ,SAAS;AAAA,IACnC,CAAC;AAAA,EACH;AACA,MAAI,MAAM,WAAW,EAAG,QAAO;AAE/B,MAAI,WAAW;AACf,MAAI,KAAK,UAAU;AACjB,eAAW,CAAC;AACZ,eAAW,KAAK,OAAO;AACrB,YAAM,SAAS,MAAM,KAAK,SAAS,EAAE,QAAQ,KAAK,MAAM,EAAE,QAAQ,KAAK,OAAO,CAAC;AAC/E,UAAI,OAAO,SAAU,UAAS,KAAK,EAAE,GAAG,GAAG,WAAW,OAAO,UAAU,CAAC;AAAA,IAC1E;AACA,QAAI,SAAS,WAAW,EAAG,QAAO;AAAA,EACpC;AAEA,SAAO,qBAAqB,UAAU,KAAK,SAAS,EAAE;AACxD;AAGA,SAAS,qBACP,YACA,WACgB;AAChB,QAAM,YAAY,CAAC,MACjB,EAAE,OAAO,UAAU,aAAa,EAAE,OAAO,UAAU;AACrD,QAAM,SAAS,CAAC,GAAG,UAAU,EAAE,KAAK,CAAC,GAAG,MAAM;AAC5C,YAAQ,WAAW;AAAA,MACjB,KAAK;AACH,eAAO,UAAU,CAAC,IAAI,UAAU,CAAC,KAAK,EAAE,QAAQ,EAAE;AAAA,MACpD,KAAK;AACH,eAAO,EAAE,YAAY,EAAE,aAAa,EAAE,QAAQ,EAAE;AAAA,MAClD,KAAK;AACH,eAAO,EAAE,QAAQ,EAAE;AAAA,MACrB;AACE,eAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE;AAAA,IAC5C;AAAA,EACF,CAAC;AACD,SAAO,OAAO,CAAC;AACjB;AAEA,SAAS,gBAAgB,UAA6C;AACpE,SAAO,WACH,4DACA;AACN;AAEA,SAAS,eAAe,MAAgC;AACtD,MAAI,CAAC,KAAK,YAAa,QAAO,KAAK;AACnC,SAAO,CAAC,KAAK,MAAM,IAAI,cAAc,KAAK,WAAW,EAAE,KAAK,IAAI;AAClE;AAEA,SAAS,gBAAgB,SAAgE;AACvF,MAAI,QAAQ,YAAY,QAAQ,eAAe;AAC7C,UAAM,IAAI,MAAM,+EAA+E;AAAA,EACjG;AACA,MAAI,QAAQ,SAAU,QAAO,QAAQ;AACrC,MAAI,QAAQ,eAAe;AACzB,WAAO,6BAA6B,EAAE,QAAQ,QAAQ,cAAc,CAAC;AAAA,EACvE;AACA,QAAM,IAAI,MAAM,uEAAuE;AACzF;AAQA,IAAM,mBAAmB;AAAA,EACvB,MAAM;AAAA,EACN,MAAM,KAAW,MAAY,SAAkD;AAC7E,WAAO,QAAQ,WAAW,IAAI,CAAC,IAAI,IAAI,CAAC;AAAA,EAC1C;AAAA,EACA,OAAO,SAAyD;AAC9D,WAAO,QAAQ,SAAS,IAAI,gBAAgB;AAAA,EAC9C;AACF;","names":["result","chosen"]}