@tangle-network/agent-runtime 0.82.0 → 0.84.0

package/dist/{chunk-NBV35BR6.js → chunk-YEJR7IXO.js}

@@ -65,4 +65,4 @@ export {
   NotFoundError,
   ValidationError
 };
-//# sourceMappingURL=chunk-NBV35BR6.js.map
+//# sourceMappingURL=chunk-YEJR7IXO.js.map

package/dist/chunk-YEJR7IXO.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/errors.ts"],"sourcesContent":["/**\n *\n * Error taxonomy for `@tangle-network/agent-runtime`.\n *\n * Public contract: every error this package throws as part of its consumer-\n * facing API either extends `AgentEvalError` (re-exported here for ergonomic\n * `instanceof` checks at the runtime boundary) or extends one of the\n * runtime-specific subclasses below.\n *\n * Internal invariant guards (`throw new Error('this should never happen')`)\n * remain plain `Error` — they are programmer-mistake assertions, not\n * consumer-catchable contract failures.\n *\n * Subclassing strategy: where a runtime-specific failure maps cleanly to an\n * agent-eval code (validation, config, not_found), we re-use the agent-eval\n * subclass. Runtime-only failure modes (session resume against the wrong\n * backend, backend transport errors) get fresh subclasses that still carry an\n * `AgentEvalErrorCode` so cross-package handlers can pattern-match without\n * importing the runtime.\n *\n * @stable\n */\n\nimport { AgentEvalError } from '@tangle-network/agent-eval'\n\nexport {\n  AgentEvalError,\n  type AgentEvalErrorCode,\n  ConfigError,\n  JudgeError,\n  NotFoundError,\n  ValidationError,\n} from '@tangle-network/agent-eval'\n\n/**\n *\n * Caller asked to resume a session against a backend whose `kind` does not\n * match the session's recorded backend. This is a routing bug — the same\n * session id was reused across two different backend implementations — and\n * is not retryable without picking the right backend.\n *\n * @stable\n */\nexport class SessionMismatchError extends AgentEvalError {\n  readonly sessionBackend: string\n  readonly requestedBackend: string\n\n  constructor(sessionBackend: string, requestedBackend: string, options?: { cause?: unknown }) {\n    super(\n      'validation',\n      `Cannot resume ${sessionBackend} session with ${requestedBackend} backend`,\n      options,\n    )\n    this.sessionBackend = sessionBackend\n    this.requestedBackend = requestedBackend\n  }\n}\n\n/**\n *\n * A backend transport call (HTTP, gRPC, sidecar IPC) failed with a non-success\n * status. Distinct from `JudgeError` (which is structural / unrecoverable)\n * because backend failures are sometimes retryable and consumers may want to\n * branch on the upstream status code.\n *\n * @stable\n */\nexport class BackendTransportError extends AgentEvalError {\n  readonly backend: string\n  readonly status?: number\n  /**\n   * Truncated upstream response body (≤2 KiB) when available. Diagnostic\n   * only — surfaces in `backend_error.error.body` and `final.error.body`\n   * so operators can see \"free_tier_limit\", \"invalid_api_key\", etc. without\n   * cracking the log line open.\n   */\n  readonly body?: string\n\n  constructor(\n    backend: string,\n    message: string,\n    options?: { cause?: unknown; status?: number; body?: string },\n  ) {\n    super('config', message, options)\n    this.backend = backend\n    this.status = options?.status\n    this.body = options?.body\n  }\n}\n\n/**\n *\n * A runtime-run lifecycle method was called in an order the state machine does\n * not allow: `persist()` before `complete()`, `complete()` twice, etc.\n *\n * @stable\n */\nexport class RuntimeRunStateError extends AgentEvalError {\n  constructor(message: string, options?: { cause?: unknown }) {\n    super('validation', message, options)\n  }\n}\n\n/**\n *\n * The dynamic-loop planner returned an unusable topology move — the LLM emitted\n * no parseable envelope, an unknown `kind`, or a structurally-invalid move\n * (e.g. a fanout with zero tasks). This is a structural failure of the\n * agent-authored topology, not a config mistake: the planner ran but its output\n * cannot drive the kernel. Carries `validation` so cross-package handlers can\n * pattern-match without importing the runtime. Fail loud — never substitute a\n * default move, or the loop silently runs a topology nobody chose.\n *\n * @stable\n */\nexport class PlannerError extends AgentEvalError {\n  constructor(message: string, options?: { cause?: unknown }) {\n    super('validation', message, options)\n  }\n}\n\n/**\n * The analyst loop could not read or run over a round's trace — e.g. an empty round\n * (no iterations to analyze) or a malformed trace projection. Fail loud: a silent empty\n * store would mask a broken capture path and the driver would steer on nothing.\n */\nexport class AnalystError extends AgentEvalError {\n  constructor(message: string, options?: { cause?: unknown }) {\n    super('validation', message, options)\n  }\n}\n"],"mappings":";AAuBA,SAAS,sBAAsB;AAE/B;AAAA,EACE,kBAAAA;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AAWA,IAAM,uBAAN,cAAmC,eAAe;AAAA,EAC9C;AAAA,EACA;AAAA,EAET,YAAY,gBAAwB,kBAA0B,SAA+B;AAC3F;AAAA,MACE;AAAA,MACA,iBAAiB,cAAc,iBAAiB,gBAAgB;AAAA,MAChE;AAAA,IACF;AACA,SAAK,iBAAiB;AACtB,SAAK,mBAAmB;AAAA,EAC1B;AACF;AAWO,IAAM,wBAAN,cAAoC,eAAe;AAAA,EAC/C;AAAA,EACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA;AAAA,EAET,YACE,SACA,SACA,SACA;AACA,UAAM,UAAU,SAAS,OAAO;AAChC,SAAK,UAAU;AACf,SAAK,SAAS,SAAS;AACvB,SAAK,OAAO,SAAS;AAAA,EACvB;AACF;AASO,IAAM,uBAAN,cAAmC,eAAe;AAAA,EACvD,YAAY,SAAiB,SAA+B;AAC1D,UAAM,cAAc,SAAS,OAAO;AAAA,EACtC;AACF;AAcO,IAAM,eAAN,cAA2B,eAAe;AAAA,EAC/C,YAAY,SAAiB,SAA+B;AAC1D,UAAM,cAAc,SAAS,OAAO;AAAA,EACtC;AACF;AAOO,IAAM,eAAN,cAA2B,eAAe;AAAA,EAC/C,YAAY,SAAiB,SAA+B;AAC1D,UAAM,cAAc,SAAS,OAAO;AAAA,EACtC;AACF;","names":["AgentEvalError"]}

package/dist/{chunk-C2FZ6GR6.js → chunk-YPA5MLVE.js}

@@ -3,7 +3,7 @@ import {
 } from "./chunk-4J6RBI3K.js";
 import {
   AnalystError
-} from "./chunk-NBV35BR6.js";
+} from "./chunk-YEJR7IXO.js";
 
 // src/analyst-loop/iterations-to-trace-store.ts
 import {
@@ -579,4 +579,4 @@ export {
   iterationsToTraceStore,
   runAnalystLoop
 };
-//# sourceMappingURL=chunk-C2FZ6GR6.js.map
+//# sourceMappingURL=chunk-YPA5MLVE.js.map

package/dist/chunk-YPA5MLVE.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/analyst-loop/iterations-to-trace-store.ts","../src/analyst-loop/run-analyst-loop.ts"],"sourcesContent":["/**\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 * @experimental\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"],"mappings":";;;;;;;;AAiBA;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;;;AC3YA,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;","names":[]}

package/dist/{coordination-BI9tpcmF.d.ts → coordination-CuDLO8wj.d.ts}

@@ -1,18 +1,17 @@
-import { E as ExecutorFactory, b as ExecutorRegistry, h as Spend, c as Agent, i as Scope, d as ResultBlobStore, B as Budget } from './types-By9LXllv.js';
+import { E as ExecutorFactory, b as ExecutorRegistry, h as Spend, c as Agent, i as Scope, d as ResultBlobStore, B as Budget } from './types-Driepl87.js';
 import { AgentProfile } from '@tangle-network/agent-interface';
-import { U as UiLens, a as UiFinding, C as CoderTask } from './substrate-rNj6TDc3.js';
-import { e as LoopTraceEmitter, c as LoopTraceEvent, S as SandboxClient, A as AgentRunSpec, E as ExecCtx } from './types-BF-MEsQB.js';
+import { U as UiLens, a as UiFinding, C as CoderTask } from './substrate-DO2GHNg2.js';
+import { e as LoopTraceEmitter, c as LoopTraceEvent, S as SandboxClient, A as AgentRunSpec, E as ExecCtx } from './types-ESeMOj94.js';
 import { SandboxEvent, SandboxInstance, BackendType } from '@tangle-network/sandbox';
 import { AgentEvalError } from '@tangle-network/agent-eval';
 import { O as OtelExporter } from './otel-export-BKmNwiCb.js';
-import { T as ToolSpec, R as RouterConfig } from './router-client-D6Ocf4jG.js';
-import { G as GitRunner, a as WorktreeCheckRunner, D as DeliverableSpec } from './worktree-harness-Dx8XULW3.js';
-import { L as LocalHarness } from './local-harness-DU7yV6mG.js';
+import { T as ToolSpec, R as RouterConfig } from './router-client-r8y_VFVM.js';
+import { G as GitRunner, a as WorktreeCheckRunner, D as DeliverableSpec } from './worktree-harness-CX_McRLp.js';
+import { L as LocalHarness } from './local-harness-sI0S_XNA.js';
 import { ProviderExecutorOptions, AgentEnvironmentProviderRegistry } from './environment-provider.js';
 import { AgentEnvironmentProvider } from '@tangle-network/agent-interface/environment-provider';
 
 /**
- * @experimental
  *
  * The child→parent message bus: the ONE pipe carrying every message a worker, sub-driver, or
  * analyst sends up to the driver — settled outputs, questions, and trace-analyst findings. It
@@ -33,6 +32,8 @@ import { AgentEnvironmentProvider } from '@tangle-network/agent-interface/enviro
  * the SAME publish/pull/subscribe surface backed by a durable mailbox on the parent's box (children
  * POST events with at-least-once retry; payloads are blob refs so the event stays small). Consumers
  * depend only on this interface, so distribution is a transport swap, never an architecture change.
+ *
+ * @experimental
  */
 /** Every bus event is a discriminated union member keyed by `type`. */
 interface BusEvent {
@@ -78,10 +79,10 @@ interface EventBus<E extends BusEvent> {
     /** Throughput counters for observability dashboards. */
     stats(): BusStats;
 }
+/** Create the child→parent coordination bus: one typed pipe for settled outputs, questions, and analyst findings, with a priority-ordered pull queue and a pass-through subscribe lane. */
 declare function createEventBus<E extends BusEvent>(now?: () => number): EventBus<E>;
 
 /**
- * @experimental
  *
  * Sandbox-session coder decode layer. The sandbox-session delegate (`./delegates`) and the
  * cross-restart resume driver run the in-box harness over a `SandboxClient` and need to
@@ -96,6 +97,8 @@ declare function createEventBus<E extends BusEvent>(now?: () => number): EventBu
  *      projected onto `CoderOutput`; and
  *   2. an LLM-emitted JSON block (`{ branch, patch, testResult, typecheckResult, diffStats }`),
  *      lifted onto `data.result` or scanned out of the assistant transcript (any harness shape).
+ *
+ * @experimental
  */
 
 /** @experimental The structured coder result the sandbox-session path decodes + gates. */
@@ -122,7 +125,6 @@ interface CoderOutput {
 }
 
 /**
- * @experimental
  *
  * Persistence port for the MCP delegation queue.
  *
@@ -135,6 +137,8 @@ interface CoderOutput {
  * Records MUST be JSON-safe — `FileDelegationStore` round-trips them
  * through `JSON.stringify`/`JSON.parse`, so a `Date`, `Map`, or function
  * smuggled into `args`/`result` would corrupt the journal.
+ *
+ * @experimental
  */
 
 /** @experimental */
@@ -186,7 +190,7 @@ declare class DelegationPersistenceError extends AgentEvalError {
         cause?: unknown;
     });
 }
-/** @experimental */
+/** In-memory `DelegationStore` — suitable for single-process use and tests. @experimental */
 declare class InMemoryDelegationStore implements DelegationStore {
     private readonly records;
     loadAll(): Promise<DelegationRecord[]>;
@@ -236,7 +240,6 @@ declare class FileDelegationStore implements DelegationStore {
 }
 
 /**
- * @experimental
  *
  * Compact loop-trace tee for the delegation journal.
  *
@@ -251,6 +254,8 @@ declare class FileDelegationStore implements DelegationStore {
  * Payload discipline: a record's trace is hard-capped (spans + serialized
  * bytes). Past the cap the OLDEST spans are dropped and the record carries a
  * `traceTruncated: true` marker — truncation is never silent.
+ *
+ * @experimental
  */
 
 /**
@@ -325,7 +330,7 @@ interface DelegationTraceCollector {
     /** Flush buffered events of runs that never reached `loop.ended`. */
     settle(): void;
 }
-/** @experimental */
+/** Build a `DelegationTraceCollector` that buffers loop-trace events and converts them to spans on settle. @experimental */
 declare function createDelegationTraceCollector(onSpans: (spans: DelegationTraceSpan[]) => void): DelegationTraceCollector;
 /**
  * Fan one `LoopTraceEvent` stream into several emitters — e.g. the
@@ -338,7 +343,6 @@ declare function createDelegationTraceCollector(onSpans: (spans: DelegationTrace
 declare function composeLoopTraceEmitters(...emitters: ReadonlyArray<LoopTraceEmitter | undefined>): LoopTraceEmitter | undefined;
 
 /**
- * @experimental
  *
  * Trace context propagation for MCP subprocess.
  *
@@ -354,6 +358,8 @@ declare function composeLoopTraceEmitters(...emitters: ReadonlyArray<LoopTraceEm
  *
  * When these env vars are absent, the MCP generates a fresh trace root —
  * the server operates standalone without trace joining.
+ *
+ * @experimental
  */
 
 interface TraceContext {
@@ -386,7 +392,6 @@ declare function createPropagatingTraceEmitter(ctx: TraceContext): {
 declare function traceContextToEnv(ctx: TraceContext): Record<string, string>;
 
 /**
- * @experimental
  *
  * MCP delegation tool surface — the typed inputs/outputs the product agent
  * sees over the wire. These types are the contract; the JSON schemas under
@@ -397,6 +402,8 @@ declare function traceContextToEnv(ctx: TraceContext): Record<string, string>;
  * `completed` | `failed` | `cancelled`. `delegate_feedback` +
  * `delegation_history` are synchronous reads / writes against the local
  * task queue + feedback store.
+ *
+ * @experimental
  */
 
 /** @experimental */
@@ -674,7 +681,6 @@ interface DelegationHistoryResult {
 }
 
 /**
- * @experimental
  *
  * State machine for async MCP delegations:
  *
@@ -698,6 +704,8 @@ interface DelegationHistoryResult {
  * stay queryable, in-flight records either re-attach through the
  * `resumeDelegate` seam (when they carry a `detachedSessionRef`) or fail
  * loud with a driver-restart error so `delegation_status` tells the truth.
+ *
+ * @experimental
  */
 
 type AnyDelegateArgs = DelegateCodeArgs | DelegateResearchArgs | DelegateUiAuditArgs;
@@ -881,7 +889,7 @@ interface DelegationTaskQueueOptions {
      */
     traceContext?: TraceContext;
 }
-/** @experimental */
+/** In-process queue for async delegation tasks — submit, cancel, poll status, and read history. @experimental */
 declare class DelegationTaskQueue {
     private readonly records;
     private readonly controllers;
@@ -982,7 +990,6 @@ declare class DelegationTaskQueue {
 declare function hashIdempotencyInput(value: unknown): string;
 
 /**
- * @experimental
  *
  * Detached delegation turns over the sandbox SDK's `driveTurn` primitive.
  *
@@ -1014,6 +1021,8 @@ declare function hashIdempotencyInput(value: unknown): string;
  * under the `'detached-turn'` driver tag. Multi-variant fanout stays on the
  * streaming `runLoop` path — N concurrent sessions cannot be expressed as one
  * resume key, and winner selection needs every candidate.
+ *
+ * @experimental
  */
 
 /**
@@ -1072,7 +1081,7 @@ interface DetachedSessionRefParts {
  * @experimental
  */
 declare function formatDetachedSessionRef(parts: DetachedSessionRefParts): string;
-/** @experimental Inverse of {@link formatDetachedSessionRef}; throws `ValidationError` on malformed input. */
+/** Parse a `detachedSessionRef` string back to parts; throws `ValidationError` on malformed input. @experimental */
 declare function parseDetachedSessionRef(raw: string): DetachedSessionRefParts;
 /** @experimental The terminal payload of a finished detached turn. */
 interface DetachedTurn {
@@ -1187,7 +1196,6 @@ interface DetachedTurnResumeDriverOptions {
 declare function createDetachedTurnResumeDriver(options: DetachedTurnResumeDriverOptions): DelegationResumeDriver;
 
 /**
- * @experimental
  *
  * Delegation executors — the layer between MCP delegates and the sandbox
  * substrate. Each executor exposes a {@link SandboxClient} the kernel
@@ -1204,6 +1212,8 @@ declare function createDetachedTurnResumeDriver(options: DetachedTurnResumeDrive
  *   in the caller's existing fleet so worker diffs land directly on the
  *   caller's filesystem (the fleet's shared workspace). Selected when the
  *   parent sandbox passes `TANGLE_FLEET_ID` into the MCP server's env.
+ *
+ * @experimental
  */
 
 /** @experimental */
@@ -1280,7 +1290,6 @@ interface FleetWorkspaceExecutorOptions {
 declare function createFleetWorkspaceExecutor(options: FleetWorkspaceExecutorOptions): DelegationExecutor;
 
 /**
- * @experimental
  *
  * `detachedSessionDelegate` — the sandbox-session coder delegate: a closure that drives `runLoop`
  * against a `SandboxClient` + a caller-supplied (or minimal model-only default) worker profile, to a
@@ -1297,6 +1306,8 @@ declare function createFleetWorkspaceExecutor(options: FleetWorkspaceExecutorOpt
  * none is passed, a minimal model-only default profile is materialized in `./detached-coder` — no
  * hardcoded skills or tools. For NEW local-repo coding use `worktreeFanout` / `worktreeLoopRunner`
  * (author one `AgentProfile` per harness → `createWorktreeCliExecutor` leaves → `gateOnDeliverable`).
+ *
+ * @experimental
  */
 
 /** @experimental */
@@ -1345,13 +1356,14 @@ interface CoderReview {
     notes?: string;
 }
 /**
- * @experimental
  *
  * Optional adversarial reviewer over a coder candidate that already passed
  * mechanical validation (tests/typecheck/forbidden/diff/no-op/secrets). Folded
  * from the ai-trading-blueprint delegation MCP: a candidate is only eligible to
  * win if the reviewer approves it. The reviewer is the consumer's seam — an LLM
  * judge, a `pnpm review` command, anything returning a `CoderReview`.
+ *
+ * @experimental
  */
 type CoderReviewer = (output: CoderOutput, task: CoderTask, ctx: {
     signal: AbortSignal;
@@ -1484,7 +1496,6 @@ interface SettleDetachedCoderTurnOptions {
 declare function settleDetachedCoderTurn(turn: DetachedTurn, options: SettleDetachedCoderTurnOptions): Promise<CoderOutput>;
 
 /**
- * @experimental
  *
  * Feedback persistence surface for the MCP layer.
  *
@@ -1497,6 +1508,8 @@ declare function settleDetachedCoderTurn(turn: DetachedTurn, options: SettleDeta
  * Feedback events are append-only: every rating is a new event with a
  * fresh id, even when the same delegation is rated multiple times. The
  * caller decides how to roll up scores downstream.
+ *
+ * @experimental
  */
 
 /** @experimental */
@@ -1521,7 +1534,7 @@ interface FeedbackStore {
         refersToRef?: string;
     }): Promise<FeedbackEvent[]>;
 }
-/** @experimental */
+/** In-memory `FeedbackStore` — suitable for single-process use and tests. @experimental */
 declare class InMemoryFeedbackStore implements FeedbackStore {
     private readonly events;
     put(event: FeedbackEvent): Promise<void>;
@@ -1539,7 +1552,6 @@ declare class InMemoryFeedbackStore implements FeedbackStore {
 declare function eventToSnapshot(event: FeedbackEvent): DelegationFeedbackSnapshot;
 
 /**
- * @experimental
  *
  * The leaf runtime — the built-in `Executor` IMPLEMENTATIONS behind the ONE
  * open interface frozen in `./types`, plus the open resolver/registry that maps
@@ -1561,6 +1573,8 @@ declare function eventToSnapshot(event: FeedbackEvent): DelegationFeedbackSnapsh
  * Layering: `estimateCost`/`isModelPriced` are substrate primitives from
  * `@tangle-network/agent-eval`; `runLoop`/`acquireSandbox` are runtime kernels
  * from this package. No per-vendor adapters live here.
+ *
+ * @experimental
  */
 
 /**
@@ -1757,7 +1771,6 @@ declare function createExecutor(config: ExecutorConfig): ExecutorFactory<unknown
 declare function createExecutorRegistry(): ExecutorRegistry;
 
 /**
- * @experimental
  *
  * `delegate` MCP tool — the ONE generic delegation verb, the agent-facing front door to
  * `delegate()` / `supervise()`. The agent hands it an INTENT (what it wants done); a default
@@ -1771,13 +1784,15 @@ declare function createExecutorRegistry(): ExecutorRegistry;
  * The supervisor's substrate (its brain `router`, the worker `backend`, the completion `deliverable`)
  * is INJECTED at server construction — never an agent-supplied arg. The agent supplies only the
  * intent (+ an optional per-call `model` / `runId`).
+ *
+ * @experimental
  */
 
-/** @experimental */
+/** MCP tool name for the `delegate` generic-delegation tool. @experimental */
 declare const DELEGATE_TOOL_NAME = "delegate";
-/** @experimental */
+/** Human-readable description of the `delegate` MCP tool, injected into the tool manifest. @experimental */
 declare const DELEGATE_DESCRIPTION: string;
-/** @experimental */
+/** JSON Schema for `delegate` tool arguments (`intent` + optional `model` and `runId`). @experimental */
 declare const DELEGATE_INPUT_SCHEMA: {
     readonly type: "object";
     readonly properties: {
@@ -1803,7 +1818,7 @@ interface DelegateArgs {
     model?: string;
     runId?: string;
 }
-/** @experimental */
+/** Parse and validate raw MCP tool input into typed `DelegateArgs`; throws `TypeError` on bad input. @experimental */
 declare function validateDelegateArgs(raw: unknown): DelegateArgs;
 /** The synchronous result the `delegate` tool returns to the calling agent: the delivered output (or
  *  the no-winner reason) PLUS the conserved spend of the whole delegation. */
@@ -1838,7 +1853,6 @@ interface DelegateHandlerOptions {
 declare function createDelegateHandler(options: DelegateHandlerOptions): (raw: unknown) => Promise<DelegateResult>;
 
 /**
- * @experimental
  *
  * Stdio JSON-RPC MCP server exposing the delegation tools to sandbox
  * coding-harness agents (claude-code, codex, opencode, ...): the generic
@@ -1856,6 +1870,8 @@ declare function createDelegateHandler(options: DelegateHandlerOptions): (raw: u
  * one request; each response is one line. `tools/list` and `tools/call`
  * mirror the MCP 2024-11-05 spec; we do not pull in
  * `@modelcontextprotocol/sdk` to keep the dependency footprint zero.
+ *
+ * @experimental
  */
 
 /** @experimental */
@@ -1940,7 +1956,11 @@ interface JsonRpcResponse {
         data?: unknown;
     };
 }
-/** @experimental */
+/**
+ * Stdio JSON-RPC MCP server exposing the delegation tools (`delegate`, `delegate_feedback`, `delegation_status`, `delegation_history`, optional `delegate_ui_audit`) to sandbox coding-harness agents.
+ *
+ * @experimental
+ */
 declare function createMcpServer(options?: McpServerOptions): McpServer;
 /**
  * In-process pair of `Readable` + `Writable` streams suitable for driving
@@ -1957,12 +1977,13 @@ declare function createInProcessTransport(): {
 };
 
 /**
- * @experimental
  *
  * MCP binding for a live `Scope`. A sandbox driver gets the same small verbs
  * the in-process driver has: spawn, observe, await, steer, ask/answer, analyze,
  * and stop. Settled outputs remain Scope artifacts; product code can project
  * them into any UI/report envelope it needs.
+ *
+ * @experimental
  */
 
 /** A worker the driver has drained via `await_event`. */

package/dist/environment-provider.d.ts

@@ -2,8 +2,8 @@ import { AgentProfile, AgentProfileValidationResult } from '@tangle-network/agen
 import { AgentEnvironmentProvider, AgentEnvironmentCapabilities, CreateAgentEnvironmentInput, AgentTurnInput, AgentProfileRef } from '@tangle-network/agent-interface/environment-provider';
 export { AgentEnvironment, AgentEnvironmentCapabilities, AgentEnvironmentEvent, AgentEnvironmentProvider, AgentEnvironmentQuery, AgentEnvironmentStatus, AgentEnvironmentSummary, AgentProfileRef, AgentSession, AgentSessionRef, AgentSessionStatus, AgentTurnInput, AgentTurnResult, CheckpointRef, CheckpointRequest, CreateAgentEnvironmentInput, ExecRequest, ExecResult, ForkRequest, PlacementInfo, ResourceRequest, WorkspaceRequest } from '@tangle-network/agent-interface/environment-provider';
 import { CreateSandboxOptions, BackendType } from '@tangle-network/sandbox';
-import { R as Runtime, E as ExecutorFactory } from './types-By9LXllv.js';
-import { S as SandboxClient } from './types-BF-MEsQB.js';
+import { R as Runtime, E as ExecutorFactory } from './types-Driepl87.js';
+import { S as SandboxClient } from './types-ESeMOj94.js';
 import '@tangle-network/agent-eval';
 
 /** Provider object or registry name accepted by runtime provider adapters.

package/dist/environment-provider.js

@@ -4,7 +4,7 @@ import {
   providerAsSandboxClient,
   resolveAgentEnvironmentProvider,
   sandboxClientAsProvider
-} from "./chunk-H7IBHAFT.js";
+} from "./chunk-BZF3KQ6G.js";
 import "./chunk-DGUM43GV.js";
 export {
   createAgentEnvironmentProviderRegistry,

package/dist/{improvement-adapter-CioiEE2z.d.ts → improvement-adapter-CDR8QNVM.d.ts}

@@ -94,7 +94,9 @@ interface SurfaceValidationIssue {
     path: string;
     reason: 'missing' | 'not-directory' | 'not-file';
 }
+/** Validate an `AgentSurfaces` map on disk — missing paths fail loud at `defineAgent` time instead of silently skipping self-improvement edits. */
 declare function validateSurfaces(surfaces: AgentSurfaces, repoRoot: string): ReadonlyArray<SurfaceValidationIssue>;
+/** Format a list of surface validation issues into a human-readable error string. */
 declare function renderSurfaceIssues(issues: ReadonlyArray<SurfaceValidationIssue>, repoRoot: string): string;
 
 /**
@@ -202,6 +204,7 @@ interface DraftPatchOutput {
     /** Multi-line rationale for the PR body. */
     rationale: string;
 }
+/** The substrate-default `ImprovementAdapter`: resolve each finding's subject to a real surface path, LLM-draft a unified-diff patch, then auto-apply or open a PR. */
 declare function createSurfaceImprovementAdapter(opts: CreateSurfaceImprovementAdapterOpts): ImprovementAdapter<SurfaceImprovementEdit>;
 
 export { type AgentSurfaces as A, type CreateSurfaceImprovementAdapterOpts as C, type DraftPatchInput as D, type ResolvedSurface as R, type SurfaceImprovementEdit as S, type DraftPatchOutput as a, type SurfaceValidationIssue as b, createSurfaceImprovementAdapter as c, resolveSubjectPath as d, renderSurfaceIssues as r, validateSurfaces as v };