@tangle-network/agent-runtime 0.72.0 → 0.74.0

package/dist/{chunk-P5OKDSLB.js.map → chunk-IODKUOBA.js.map}

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

package/dist/chunk-JPURCA2O.js

@@ -0,0 +1,266 @@
+import {
+  runLocalHarness
+} from "./chunk-O2UPHN7X.js";
+
+// src/improvement/agentic-generator.ts
+import { spawnSync } from "child_process";
+function agenticGenerator(opts = {}) {
+  const harness = opts.harness ?? "claude";
+  const buildPrompt = opts.buildPrompt ?? defaultBuildPrompt;
+  const run = opts.runHarness ?? runLocalHarness;
+  const dirty = opts.isDirty ?? worktreeDirty;
+  const verify = opts.verify;
+  return {
+    kind: `agentic:${harness}`,
+    async generate({ worktreePath, report, findings, maxShots, signal }) {
+      const basePrompt = buildPrompt({ report, findings });
+      const shots = Math.max(1, maxShots);
+      let attemptNote = "";
+      for (let shot = 0; shot < shots; shot++) {
+        if (signal.aborted) break;
+        await run({
+          harness,
+          cwd: worktreePath,
+          taskPrompt: attemptNote ? `${basePrompt}
+
+${attemptNote}` : basePrompt,
+          timeoutMs: opts.timeoutMs,
+          signal
+        });
+        if (!dirty(worktreePath)) {
+          attemptNote = EMPTY_TREE_NOTE;
+          continue;
+        }
+        if (!verify) {
+          return { applied: true, summary: summarize(findings) };
+        }
+        const result = await verify(worktreePath);
+        if (result.ok) {
+          return { applied: true, summary: summarize(findings) };
+        }
+        attemptNote = failureNote(result.feedback);
+      }
+      return { applied: false, summary: "" };
+    }
+  };
+}
+function defaultBuildPrompt(args) {
+  const lines = [
+    "You are improving this codebase based on an evaluation analysis.",
+    "Make the smallest set of edits that addresses the findings below, then stop.",
+    "Do not change unrelated code. Do not commit \u2014 leave changes in the working tree.",
+    "",
+    "Findings:"
+  ];
+  for (const f of args.findings) {
+    const where = f.subject ? ` [${f.subject}]` : "";
+    lines.push(`- (${f.severity})${where} ${f.claim}`);
+    if (f.recommended_action) lines.push(`    \u2192 ${f.recommended_action}`);
+  }
+  return lines.join("\n");
+}
+var EMPTY_TREE_NOTE = "NOTE: your previous attempt left the working tree unchanged. Make the concrete file edits now.";
+function failureNote(feedback) {
+  const detail = feedback?.trim();
+  return [
+    "NOTE: your edits are in the working tree but verification FAILED.",
+    "Fix the problem in place \u2014 build on your existing edits, do not revert them.",
+    detail ? `Verifier output:
+${truncate(detail, 4e3)}` : "No verifier detail was captured."
+  ].join("\n");
+}
+function commandVerifier(command, args = [], timeoutMs = 3e5) {
+  return (worktreePath) => {
+    const result = spawnSync(command, args, {
+      cwd: worktreePath,
+      encoding: "utf-8",
+      timeout: timeoutMs
+    });
+    if (result.signal) {
+      return {
+        ok: false,
+        feedback: `verifier '${command}' killed by ${result.signal} (likely timeout after ${timeoutMs}ms)`
+      };
+    }
+    if (result.error) {
+      const code = result.error.code;
+      if (code === "ENOENT") {
+        throw new Error(
+          `commandVerifier: '${command}' not found in PATH (setup bug, not a failed candidate)`
+        );
+      }
+      throw new Error(`commandVerifier: '${command}' failed to spawn: ${result.error.message}`);
+    }
+    if (result.status === 0) return { ok: true };
+    const out = `${result.stdout ?? ""}${result.stderr ?? ""}`.trim();
+    return { ok: false, feedback: out.length > 0 ? out : `exit ${result.status}` };
+  };
+}
+function summarize(findings) {
+  if (findings.length === 0) return "agentic improvement";
+  if (findings.length === 1) return `agentic: ${truncate(findings[0].claim, 64)}`;
+  return `agentic: ${findings.length} findings addressed`;
+}
+function truncate(s, n) {
+  return s.length <= n ? s : `${s.slice(0, n - 1)}\u2026`;
+}
+function worktreeDirty(worktreePath) {
+  const result = spawnSync("git", ["status", "--porcelain"], {
+    cwd: worktreePath,
+    encoding: "utf-8"
+  });
+  if (result.error) {
+    throw new Error(
+      `agenticGenerator: git status failed to spawn in ${worktreePath}: ${result.error.message}`
+    );
+  }
+  if (result.status !== 0) {
+    throw new Error(
+      `agenticGenerator: git status exited ${result.status} in ${worktreePath}: ${result.stderr.trim()}`
+    );
+  }
+  return result.stdout.trim().length > 0;
+}
+
+// src/improvement/build-prompts.ts
+function findingLines(findings) {
+  return findings.map((f) => {
+    const where = f.subject ? ` [${f.subject}]` : "";
+    const action = f.recommended_action ? ` \u2192 ${f.recommended_action}` : "";
+    return `- (${f.severity})${where} ${f.claim}${action}`;
+  });
+}
+function toolBuildPrompt(args) {
+  return [
+    "You are building a new TOOL for this codebase to address the gaps below.",
+    "Write the tool as a small, self-contained module PLUS tests that exercise it.",
+    "The tool must compile and its tests must pass \u2014 they will be run automatically;",
+    "if verification fails you will get the error and another attempt. Do not commit;",
+    "leave the changes in the working tree.",
+    "",
+    "Gaps the tool should close:",
+    ...findingLines(args.findings)
+  ].join("\n");
+}
+function mcpBuildPrompt(args) {
+  return [
+    "You are building a new MCP SERVER (Model Context Protocol) that exposes",
+    "tool(s) addressing the gaps below, so any harness can mount it.",
+    "Requirements that WILL be checked by booting the server:",
+    "- it starts over stdio and answers the MCP `initialize` handshake,",
+    "- `tools/list` returns at least one tool with a valid input schema.",
+    "Newline-delimited JSON-RPC 2.0, protocol version 2024-11-05. Include a start",
+    "command (e.g. a package.json `start` script or a clear entrypoint). If the",
+    "boot-and-probe fails you will get the error and another attempt. Do not",
+    "commit; leave the changes in the working tree.",
+    "",
+    "Capabilities the server should provide:",
+    ...findingLines(args.findings)
+  ].join("\n");
+}
+
+// src/improvement/mcp-serve-verifier.ts
+import { spawn } from "child_process";
+import { createInterface } from "readline";
+var PROTOCOL_VERSION = "2024-11-05";
+function mcpServeVerifier(spec) {
+  const timeoutMs = spec.timeoutMs ?? 3e4;
+  const minTools = spec.minTools ?? 1;
+  return (worktreePath) => new Promise((resolve, reject) => {
+    const child = spawn(spec.command, spec.args ?? [], {
+      cwd: worktreePath,
+      stdio: ["pipe", "pipe", "pipe"],
+      env: { ...process.env, ...spec.env }
+    });
+    const stderr = [];
+    let settled = false;
+    let nextId = 1;
+    const initId = nextId++;
+    let listId = -1;
+    const settle = (fn) => {
+      if (settled) return;
+      settled = true;
+      clearTimeout(timer);
+      rl.close();
+      child.kill("SIGKILL");
+      fn();
+    };
+    const withStderr = (msg) => stderr.length > 0 ? `${msg}
+stderr:
+${stderr.join("").slice(-2e3)}` : msg;
+    const pass = () => settle(() => resolve({ ok: true }));
+    const failCandidate = (msg) => settle(() => resolve({ ok: false, feedback: withStderr(msg) }));
+    const setupFault = (err) => settle(() => reject(err));
+    const send = (msg) => {
+      try {
+        child.stdin.write(`${JSON.stringify(msg)}
+`);
+        return true;
+      } catch (err) {
+        failCandidate(`writing to MCP server stdin failed: ${err.message}`);
+        return false;
+      }
+    };
+    child.on("error", (err) => {
+      const code = err.code;
+      setupFault(
+        code === "ENOENT" ? new Error(
+          `mcpServeVerifier: '${spec.command}' not found in PATH (setup bug, not a failed candidate)`
+        ) : new Error(`mcpServeVerifier: '${spec.command}' failed to spawn: ${err.message}`)
+      );
+    });
+    child.on("exit", (code, signal) => {
+      failCandidate(`MCP server exited (code ${code}, signal ${signal}) before serving`);
+    });
+    child.stderr.on("data", (d) => stderr.push(String(d)));
+    const rl = createInterface({ input: child.stdout });
+    rl.on("line", (line) => {
+      let msg;
+      try {
+        msg = JSON.parse(line);
+      } catch {
+        return;
+      }
+      if (!msg || typeof msg !== "object") return;
+      if (msg.id === initId) {
+        if (msg.error) return failCandidate(`initialize errored: ${JSON.stringify(msg.error)}`);
+        if (!send({ jsonrpc: "2.0", method: "notifications/initialized" })) return;
+        listId = nextId++;
+        send({ jsonrpc: "2.0", id: listId, method: "tools/list" });
+        return;
+      }
+      if (msg.id === listId) {
+        if (msg.error) return failCandidate(`tools/list errored: ${JSON.stringify(msg.error)}`);
+        const tools = msg.result?.tools;
+        if (!Array.isArray(tools)) return failCandidate("tools/list result has no tools array");
+        if (tools.length < minTools) {
+          return failCandidate(`tools/list returned ${tools.length} tool(s), need >= ${minTools}`);
+        }
+        return pass();
+      }
+    });
+    const timer = setTimeout(
+      () => failCandidate(`MCP server did not complete the handshake within ${timeoutMs}ms`),
+      timeoutMs
+    );
+    send({
+      jsonrpc: "2.0",
+      id: initId,
+      method: "initialize",
+      params: {
+        protocolVersion: PROTOCOL_VERSION,
+        capabilities: {},
+        clientInfo: { name: "agent-runtime-mcp-verify", version: "0" }
+      }
+    });
+  });
+}
+
+export {
+  agenticGenerator,
+  commandVerifier,
+  toolBuildPrompt,
+  mcpBuildPrompt,
+  mcpServeVerifier
+};
+//# sourceMappingURL=chunk-JPURCA2O.js.map

package/dist/chunk-JPURCA2O.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/improvement/agentic-generator.ts","../src/improvement/build-prompts.ts","../src/improvement/mcp-serve-verifier.ts"],"sourcesContent":["/**\n * @experimental\n *\n * `agenticGenerator` — the full-agentic `CandidateGenerator`: the\n * `shots=N, sandbox=on` setting of the one `improvementDriver`. It runs a real\n * coding harness (claude / codex / opencode) inside the candidate worktree the\n * driver already created, letting the agent read the codebase + the research\n * report and make the change in place. The driver then commits the worktree\n * into a `CodeSurface`.\n *\n * Mechanism: identical to the proven Phase-2.8 in-process executor — spawn the\n * harness as a subprocess with `cwd` = the worktree, on the same filesystem,\n * so edits land in place (no sandbox-mount round-trip). `runLocalHarness` is\n * the verified primitive. The OUTER sandbox is the improvement loop's own\n * execution context; the generator does not nest a second sandbox per\n * candidate (which would reintroduce a host↔sandbox worktree-transport\n * problem that does not need solving here).\n *\n * `maxShots` is the DEPTH dial — a multi-shot verify-in-session loop, NOT the\n * kernel `runLoop`. Each shot runs one full harness session in the (persistent)\n * worktree; between shots the loop refines based on what the last shot produced:\n *   - empty tree   → \"you changed nothing, make the edits\" → retry\n *   - dirty + `verify` fails → feed the verifier's failure into the next shot\n *       (the worktree persists, so the harness RESUMES atop its own failing\n *       edits with the error in hand — no `--resume` session plumbing needed,\n *       and harness-agnostic across claude/codex/opencode)\n *   - dirty + `verify` ok (or no verifier configured) → return the candidate\n * A candidate that never verifies within `maxShots` is discarded (`applied:\n * false`), never shipped — if you configured a verifier, a non-passing tree is\n * not a candidate. With no verifier the legacy behavior holds: first dirty shot\n * is the candidate.\n */\n\nimport { spawnSync } from 'node:child_process'\nimport type { AnalystFinding } from '@tangle-network/agent-eval'\nimport { type LocalHarness, runLocalHarness } from '../mcp/local-harness'\nimport type { CandidateGenerator } from './improvement-driver'\n\n/** Outcome of verifying a candidate worktree. `feedback` (compiler errors,\n *  failing test output) is fed into the next shot when `ok` is false. */\nexport interface VerifyResult {\n  ok: boolean\n  feedback?: string\n}\n\n/** Verifies the edited worktree. Sync or async; throws only on a setup fault\n *  (a candidate that fails verification returns `{ok:false}`, it does not\n *  throw). */\nexport type Verifier = (worktreePath: string) => Promise<VerifyResult> | VerifyResult\n\nexport interface AgenticGeneratorOptions {\n  /** Local coding harness to run in the worktree. Default `claude`. */\n  harness?: LocalHarness\n  /** Per-shot wall-clock timeout (ms). Default = `runLocalHarness` default (5m). */\n  timeoutMs?: number\n  /** Build the harness task prompt from the report + findings. Override for\n   *  domain phrasing; the default turns findings into a concrete coder task. */\n  buildPrompt?: (args: { report: unknown; findings: AnalystFinding[] }) => string\n  /** Verify the worktree after each dirtying shot. When set, a candidate that\n   *  fails verification is NOT returned — the failure feeds the next shot\n   *  (verify-in-session), up to `maxShots`; a candidate that never verifies is\n   *  discarded (`applied:false`), never shipped. Omitted ⇒ legacy behavior:\n   *  the first dirty shot is the candidate. See `commandVerifier`. */\n  verify?: Verifier\n  /** Test seam — inject the harness runner (defaults to `runLocalHarness`). */\n  runHarness?: typeof runLocalHarness\n  /** Test seam — inject the worktree-dirty check (defaults to `git status`). */\n  isDirty?: (worktreePath: string) => boolean\n}\n\nexport function agenticGenerator(opts: AgenticGeneratorOptions = {}): CandidateGenerator {\n  const harness = opts.harness ?? 'claude'\n  const buildPrompt = opts.buildPrompt ?? defaultBuildPrompt\n  const run = opts.runHarness ?? runLocalHarness\n  const dirty = opts.isDirty ?? worktreeDirty\n  const verify = opts.verify\n\n  return {\n    kind: `agentic:${harness}`,\n    async generate({ worktreePath, report, findings, maxShots, signal }) {\n      const basePrompt = buildPrompt({ report, findings })\n      const shots = Math.max(1, maxShots)\n      // Feedback appended to the base prompt for the NEXT shot — empty on shot 0.\n      let attemptNote = ''\n\n      for (let shot = 0; shot < shots; shot++) {\n        if (signal.aborted) break\n        await run({\n          harness,\n          cwd: worktreePath,\n          taskPrompt: attemptNote ? `${basePrompt}\\n\\n${attemptNote}` : basePrompt,\n          timeoutMs: opts.timeoutMs,\n          signal,\n        })\n\n        // The worktree IS the signal: no edits ⇒ tell the next shot to act.\n        if (!dirty(worktreePath)) {\n          attemptNote = EMPTY_TREE_NOTE\n          continue\n        }\n\n        // Dirty: with no verifier the diff IS the candidate (we trust the diff,\n        // not the harness's stdout). With a verifier the candidate must pass it.\n        if (!verify) {\n          return { applied: true, summary: summarize(findings) }\n        }\n        const result = await verify(worktreePath)\n        if (result.ok) {\n          return { applied: true, summary: summarize(findings) }\n        }\n        // Dirty but failing — resume next shot atop these edits with the error.\n        attemptNote = failureNote(result.feedback)\n      }\n\n      // Shots exhausted: no verified candidate (or, sans verifier, no edits).\n      return { applied: false, summary: '' }\n    },\n  }\n}\n\n/** Turn the analyst's findings (+ optional report) into a concrete coder task. */\nfunction defaultBuildPrompt(args: { report: unknown; findings: AnalystFinding[] }): string {\n  const lines: string[] = [\n    'You are improving this codebase based on an evaluation analysis.',\n    'Make the smallest set of edits that addresses the findings below, then stop.',\n    'Do not change unrelated code. Do not commit — leave changes in the working tree.',\n    '',\n    'Findings:',\n  ]\n  for (const f of args.findings) {\n    const where = f.subject ? ` [${f.subject}]` : ''\n    lines.push(`- (${f.severity})${where} ${f.claim}`)\n    if (f.recommended_action) lines.push(`    → ${f.recommended_action}`)\n  }\n  return lines.join('\\n')\n}\n\nconst EMPTY_TREE_NOTE =\n  'NOTE: your previous attempt left the working tree unchanged. Make the concrete file edits now.'\n\n/** Next-shot feedback when the worktree is dirty but failed verification. The\n *  edits persist on disk, so the harness resumes atop them — tell it to fix in\n *  place, not start over. Verifier detail is truncated to keep the prompt bounded. */\nfunction failureNote(feedback?: string): string {\n  const detail = feedback?.trim()\n  return [\n    'NOTE: your edits are in the working tree but verification FAILED.',\n    'Fix the problem in place — build on your existing edits, do not revert them.',\n    detail ? `Verifier output:\\n${truncate(detail, 4000)}` : 'No verifier detail was captured.',\n  ].join('\\n')\n}\n\n/** A `Verifier` that runs a command in the worktree: exit 0 ⇒ ok, any other\n *  exit ⇒ failed with stdout+stderr as feedback. The common case — verify by\n *  `tsc --noEmit`, `pnpm build`, or a test command. A timeout is treated as a\n *  FAILED candidate (a change that hangs the build is a bad change); a missing\n *  binary or spawn fault throws (a setup bug, not a failed candidate — no\n *  silent fallback). */\nexport function commandVerifier(\n  command: string,\n  args: string[] = [],\n  timeoutMs = 300_000,\n): Verifier {\n  return (worktreePath: string): VerifyResult => {\n    const result = spawnSync(command, args, {\n      cwd: worktreePath,\n      encoding: 'utf-8',\n      timeout: timeoutMs,\n    })\n    if (result.signal) {\n      return {\n        ok: false,\n        feedback: `verifier '${command}' killed by ${result.signal} (likely timeout after ${timeoutMs}ms)`,\n      }\n    }\n    if (result.error) {\n      const code = (result.error as NodeJS.ErrnoException).code\n      if (code === 'ENOENT') {\n        throw new Error(\n          `commandVerifier: '${command}' not found in PATH (setup bug, not a failed candidate)`,\n        )\n      }\n      throw new Error(`commandVerifier: '${command}' failed to spawn: ${result.error.message}`)\n    }\n    if (result.status === 0) return { ok: true }\n    const out = `${result.stdout ?? ''}${result.stderr ?? ''}`.trim()\n    return { ok: false, feedback: out.length > 0 ? out : `exit ${result.status}` }\n  }\n}\n\n/** A one-line summary for the commit message, derived from the findings. */\nfunction summarize(findings: AnalystFinding[]): string {\n  if (findings.length === 0) return 'agentic improvement'\n  if (findings.length === 1) return `agentic: ${truncate(findings[0]!.claim, 64)}`\n  return `agentic: ${findings.length} findings addressed`\n}\n\nfunction truncate(s: string, n: number): string {\n  return s.length <= n ? s : `${s.slice(0, n - 1)}…`\n}\n\n/** Non-empty `git status --porcelain` ⇒ the harness changed the worktree.\n *  Fails loud: the worktree is a fresh checkout, so a git error here means\n *  something is genuinely broken (git missing, corrupt index, killed mid-run).\n *  Folding that into `false` would silently discard a candidate and mask the\n *  real failure — forbidden by the no-silent-fallbacks doctrine. */\nfunction worktreeDirty(worktreePath: string): boolean {\n  const result = spawnSync('git', ['status', '--porcelain'], {\n    cwd: worktreePath,\n    encoding: 'utf-8',\n  })\n  if (result.error) {\n    throw new Error(\n      `agenticGenerator: git status failed to spawn in ${worktreePath}: ${result.error.message}`,\n    )\n  }\n  if (result.status !== 0) {\n    throw new Error(\n      `agenticGenerator: git status exited ${result.status} in ${worktreePath}: ${result.stderr.trim()}`,\n    )\n  }\n  return result.stdout.trim().length > 0\n}\n","/**\n * Build-prompt starting points for the two buildable artifact types. There is\n * NO `toolGenerator`/`mcpGenerator` wrapper — the factory is `agenticGenerator`\n * + a verifier (docs/artifact-lifecycle-frontier.md), so a tool or an MCP\n * server is built by composing the pieces directly:\n *\n *   // a tool:\n *   agenticGenerator({ buildPrompt: toolBuildPrompt, verify: commandVerifier('pnpm', ['test']) })\n *   // an MCP server:\n *   agenticGenerator({ buildPrompt: mcpBuildPrompt, verify: mcpServeVerifier({ command: 'node', args: ['server.mjs'] }) })\n *\n * These are the only type-specific bit (the phrasing that points the agent at a\n * tool vs. an MCP); the worktree, resume-on-failure loop, and improvement-loop\n * wrapper are shared. MCP is the load-bearing target — it is how a harness\n * acquires tools; raw tools matter where we control the loader.\n */\n\nimport type { AnalystFinding } from '@tangle-network/agent-eval'\n\ntype FindingsArg = { report: unknown; findings: AnalystFinding[] }\n\nfunction findingLines(findings: AnalystFinding[]): string[] {\n  return findings.map((f) => {\n    const where = f.subject ? ` [${f.subject}]` : ''\n    const action = f.recommended_action ? ` → ${f.recommended_action}` : ''\n    return `- (${f.severity})${where} ${f.claim}${action}`\n  })\n}\n\nexport function toolBuildPrompt(args: FindingsArg): string {\n  return [\n    'You are building a new TOOL for this codebase to address the gaps below.',\n    'Write the tool as a small, self-contained module PLUS tests that exercise it.',\n    'The tool must compile and its tests must pass — they will be run automatically;',\n    'if verification fails you will get the error and another attempt. Do not commit;',\n    'leave the changes in the working tree.',\n    '',\n    'Gaps the tool should close:',\n    ...findingLines(args.findings),\n  ].join('\\n')\n}\n\nexport function mcpBuildPrompt(args: FindingsArg): string {\n  return [\n    'You are building a new MCP SERVER (Model Context Protocol) that exposes',\n    'tool(s) addressing the gaps below, so any harness can mount it.',\n    'Requirements that WILL be checked by booting the server:',\n    '- it starts over stdio and answers the MCP `initialize` handshake,',\n    '- `tools/list` returns at least one tool with a valid input schema.',\n    'Newline-delimited JSON-RPC 2.0, protocol version 2024-11-05. Include a start',\n    'command (e.g. a package.json `start` script or a clear entrypoint). If the',\n    'boot-and-probe fails you will get the error and another attempt. Do not',\n    'commit; leave the changes in the working tree.',\n    '',\n    'Capabilities the server should provide:',\n    ...findingLines(args.findings),\n  ].join('\\n')\n}\n","/**\n * `mcpServeVerifier` — the intrinsic verifier for a built MCP server: the\n * boot-and-probe checker named in docs/artifact-lifecycle-frontier.md. A\n * generated MCP server is only a candidate if it actually *serves* — so this\n * boots it over stdio (the default local MCP transport) and runs the real\n * handshake: `initialize` → `notifications/initialized` → `tools/list`, and\n * asserts the server answers with at least `minTools` tools.\n *\n * Outcomes follow the `Verifier` contract: a server that fails to start, exits\n * early, errors the handshake, times out, or exposes no tools is a FAILED\n * candidate (`{ok:false}`, fed back into the next generation shot); a missing\n * start binary or spawn fault THROWS (a setup bug, never a silent fallback).\n *\n * Protocol matches the runtime's own stdio MCP server (src/mcp/server.ts):\n * newline-delimited JSON-RPC 2.0, protocol version 2024-11-05.\n */\n\nimport { spawn } from 'node:child_process'\nimport { createInterface } from 'node:readline'\nimport type { Verifier, VerifyResult } from './agentic-generator'\n\nconst PROTOCOL_VERSION = '2024-11-05'\n\nexport interface McpServeSpec {\n  /** Command that starts the built MCP server in the worktree (stdio transport). */\n  command: string\n  args?: string[]\n  /** Extra env for the server process (merged over `process.env`). */\n  env?: Record<string, string>\n  /** Handshake timeout (ms). Default 30s. */\n  timeoutMs?: number\n  /** Minimum tools the server must expose to pass. Default 1. */\n  minTools?: number\n}\n\ninterface JsonRpcResponse {\n  jsonrpc?: string\n  id?: number | string | null\n  result?: unknown\n  error?: { code: number; message: string }\n}\n\nexport function mcpServeVerifier(spec: McpServeSpec): Verifier {\n  const timeoutMs = spec.timeoutMs ?? 30_000\n  const minTools = spec.minTools ?? 1\n\n  return (worktreePath: string): Promise<VerifyResult> =>\n    new Promise<VerifyResult>((resolve, reject) => {\n      const child = spawn(spec.command, spec.args ?? [], {\n        cwd: worktreePath,\n        stdio: ['pipe', 'pipe', 'pipe'],\n        env: { ...process.env, ...spec.env },\n      })\n\n      const stderr: string[] = []\n      let settled = false\n      let nextId = 1\n      const initId = nextId++\n      let listId = -1\n\n      const settle = (fn: () => void) => {\n        if (settled) return\n        settled = true\n        clearTimeout(timer)\n        rl.close()\n        child.kill('SIGKILL')\n        fn()\n      }\n      const withStderr = (msg: string) =>\n        stderr.length > 0 ? `${msg}\\nstderr:\\n${stderr.join('').slice(-2000)}` : msg\n      const pass = () => settle(() => resolve({ ok: true }))\n      const failCandidate = (msg: string) =>\n        settle(() => resolve({ ok: false, feedback: withStderr(msg) }))\n      const setupFault = (err: Error) => settle(() => reject(err))\n\n      const send = (msg: Record<string, unknown>): boolean => {\n        try {\n          child.stdin.write(`${JSON.stringify(msg)}\\n`)\n          return true\n        } catch (err) {\n          // EPIPE: the server died mid-handshake — a failed candidate, not a fault.\n          failCandidate(`writing to MCP server stdin failed: ${(err as Error).message}`)\n          return false\n        }\n      }\n\n      child.on('error', (err) => {\n        const code = (err as NodeJS.ErrnoException).code\n        setupFault(\n          code === 'ENOENT'\n            ? new Error(\n                `mcpServeVerifier: '${spec.command}' not found in PATH (setup bug, not a failed candidate)`,\n              )\n            : new Error(`mcpServeVerifier: '${spec.command}' failed to spawn: ${err.message}`),\n        )\n      })\n      child.on('exit', (code, signal) => {\n        // An exit before the handshake completes is a failed candidate (the\n        // server crashed on boot); after we settle, our own SIGKILL fires here.\n        failCandidate(`MCP server exited (code ${code}, signal ${signal}) before serving`)\n      })\n      child.stderr.on('data', (d) => stderr.push(String(d)))\n\n      const rl = createInterface({ input: child.stdout })\n      rl.on('line', (line) => {\n        let msg: JsonRpcResponse | undefined\n        try {\n          msg = JSON.parse(line) as JsonRpcResponse\n        } catch {\n          return // servers log to stdout too; skip non-JSON lines\n        }\n        if (!msg || typeof msg !== 'object') return\n\n        if (msg.id === initId) {\n          if (msg.error) return failCandidate(`initialize errored: ${JSON.stringify(msg.error)}`)\n          if (!send({ jsonrpc: '2.0', method: 'notifications/initialized' })) return\n          listId = nextId++\n          send({ jsonrpc: '2.0', id: listId, method: 'tools/list' })\n          return\n        }\n        if (msg.id === listId) {\n          if (msg.error) return failCandidate(`tools/list errored: ${JSON.stringify(msg.error)}`)\n          const tools = (msg.result as { tools?: unknown[] } | undefined)?.tools\n          if (!Array.isArray(tools)) return failCandidate('tools/list result has no tools array')\n          if (tools.length < minTools) {\n            return failCandidate(`tools/list returned ${tools.length} tool(s), need >= ${minTools}`)\n          }\n          return pass()\n        }\n      })\n\n      const timer = setTimeout(\n        () => failCandidate(`MCP server did not complete the handshake within ${timeoutMs}ms`),\n        timeoutMs,\n      )\n\n      send({\n        jsonrpc: '2.0',\n        id: initId,\n        method: 'initialize',\n        params: {\n          protocolVersion: PROTOCOL_VERSION,\n          capabilities: {},\n          clientInfo: { name: 'agent-runtime-mcp-verify', version: '0' },\n        },\n      })\n    })\n}\n"],"mappings":";;;;;AAiCA,SAAS,iBAAiB;AAqCnB,SAAS,iBAAiB,OAAgC,CAAC,GAAuB;AACvF,QAAM,UAAU,KAAK,WAAW;AAChC,QAAM,cAAc,KAAK,eAAe;AACxC,QAAM,MAAM,KAAK,cAAc;AAC/B,QAAM,QAAQ,KAAK,WAAW;AAC9B,QAAM,SAAS,KAAK;AAEpB,SAAO;AAAA,IACL,MAAM,WAAW,OAAO;AAAA,IACxB,MAAM,SAAS,EAAE,cAAc,QAAQ,UAAU,UAAU,OAAO,GAAG;AACnE,YAAM,aAAa,YAAY,EAAE,QAAQ,SAAS,CAAC;AACnD,YAAM,QAAQ,KAAK,IAAI,GAAG,QAAQ;AAElC,UAAI,cAAc;AAElB,eAAS,OAAO,GAAG,OAAO,OAAO,QAAQ;AACvC,YAAI,OAAO,QAAS;AACpB,cAAM,IAAI;AAAA,UACR;AAAA,UACA,KAAK;AAAA,UACL,YAAY,cAAc,GAAG,UAAU;AAAA;AAAA,EAAO,WAAW,KAAK;AAAA,UAC9D,WAAW,KAAK;AAAA,UAChB;AAAA,QACF,CAAC;AAGD,YAAI,CAAC,MAAM,YAAY,GAAG;AACxB,wBAAc;AACd;AAAA,QACF;AAIA,YAAI,CAAC,QAAQ;AACX,iBAAO,EAAE,SAAS,MAAM,SAAS,UAAU,QAAQ,EAAE;AAAA,QACvD;AACA,cAAM,SAAS,MAAM,OAAO,YAAY;AACxC,YAAI,OAAO,IAAI;AACb,iBAAO,EAAE,SAAS,MAAM,SAAS,UAAU,QAAQ,EAAE;AAAA,QACvD;AAEA,sBAAc,YAAY,OAAO,QAAQ;AAAA,MAC3C;AAGA,aAAO,EAAE,SAAS,OAAO,SAAS,GAAG;AAAA,IACvC;AAAA,EACF;AACF;AAGA,SAAS,mBAAmB,MAA+D;AACzF,QAAM,QAAkB;AAAA,IACtB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,aAAW,KAAK,KAAK,UAAU;AAC7B,UAAM,QAAQ,EAAE,UAAU,KAAK,EAAE,OAAO,MAAM;AAC9C,UAAM,KAAK,MAAM,EAAE,QAAQ,IAAI,KAAK,IAAI,EAAE,KAAK,EAAE;AACjD,QAAI,EAAE,mBAAoB,OAAM,KAAK,cAAS,EAAE,kBAAkB,EAAE;AAAA,EACtE;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;AAEA,IAAM,kBACJ;AAKF,SAAS,YAAY,UAA2B;AAC9C,QAAM,SAAS,UAAU,KAAK;AAC9B,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,SAAS;AAAA,EAAqB,SAAS,QAAQ,GAAI,CAAC,KAAK;AAAA,EAC3D,EAAE,KAAK,IAAI;AACb;AAQO,SAAS,gBACd,SACA,OAAiB,CAAC,GAClB,YAAY,KACF;AACV,SAAO,CAAC,iBAAuC;AAC7C,UAAM,SAAS,UAAU,SAAS,MAAM;AAAA,MACtC,KAAK;AAAA,MACL,UAAU;AAAA,MACV,SAAS;AAAA,IACX,CAAC;AACD,QAAI,OAAO,QAAQ;AACjB,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,UAAU,aAAa,OAAO,eAAe,OAAO,MAAM,0BAA0B,SAAS;AAAA,MAC/F;AAAA,IACF;AACA,QAAI,OAAO,OAAO;AAChB,YAAM,OAAQ,OAAO,MAAgC;AACrD,UAAI,SAAS,UAAU;AACrB,cAAM,IAAI;AAAA,UACR,qBAAqB,OAAO;AAAA,QAC9B;AAAA,MACF;AACA,YAAM,IAAI,MAAM,qBAAqB,OAAO,sBAAsB,OAAO,MAAM,OAAO,EAAE;AAAA,IAC1F;AACA,QAAI,OAAO,WAAW,EAAG,QAAO,EAAE,IAAI,KAAK;AAC3C,UAAM,MAAM,GAAG,OAAO,UAAU,EAAE,GAAG,OAAO,UAAU,EAAE,GAAG,KAAK;AAChE,WAAO,EAAE,IAAI,OAAO,UAAU,IAAI,SAAS,IAAI,MAAM,QAAQ,OAAO,MAAM,GAAG;AAAA,EAC/E;AACF;AAGA,SAAS,UAAU,UAAoC;AACrD,MAAI,SAAS,WAAW,EAAG,QAAO;AAClC,MAAI,SAAS,WAAW,EAAG,QAAO,YAAY,SAAS,SAAS,CAAC,EAAG,OAAO,EAAE,CAAC;AAC9E,SAAO,YAAY,SAAS,MAAM;AACpC;AAEA,SAAS,SAAS,GAAW,GAAmB;AAC9C,SAAO,EAAE,UAAU,IAAI,IAAI,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;AACjD;AAOA,SAAS,cAAc,cAA+B;AACpD,QAAM,SAAS,UAAU,OAAO,CAAC,UAAU,aAAa,GAAG;AAAA,IACzD,KAAK;AAAA,IACL,UAAU;AAAA,EACZ,CAAC;AACD,MAAI,OAAO,OAAO;AAChB,UAAM,IAAI;AAAA,MACR,mDAAmD,YAAY,KAAK,OAAO,MAAM,OAAO;AAAA,IAC1F;AAAA,EACF;AACA,MAAI,OAAO,WAAW,GAAG;AACvB,UAAM,IAAI;AAAA,MACR,uCAAuC,OAAO,MAAM,OAAO,YAAY,KAAK,OAAO,OAAO,KAAK,CAAC;AAAA,IAClG;AAAA,EACF;AACA,SAAO,OAAO,OAAO,KAAK,EAAE,SAAS;AACvC;;;ACzMA,SAAS,aAAa,UAAsC;AAC1D,SAAO,SAAS,IAAI,CAAC,MAAM;AACzB,UAAM,QAAQ,EAAE,UAAU,KAAK,EAAE,OAAO,MAAM;AAC9C,UAAM,SAAS,EAAE,qBAAqB,WAAM,EAAE,kBAAkB,KAAK;AACrE,WAAO,MAAM,EAAE,QAAQ,IAAI,KAAK,IAAI,EAAE,KAAK,GAAG,MAAM;AAAA,EACtD,CAAC;AACH;AAEO,SAAS,gBAAgB,MAA2B;AACzD,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,GAAG,aAAa,KAAK,QAAQ;AAAA,EAC/B,EAAE,KAAK,IAAI;AACb;AAEO,SAAS,eAAe,MAA2B;AACxD,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,GAAG,aAAa,KAAK,QAAQ;AAAA,EAC/B,EAAE,KAAK,IAAI;AACb;;;ACxCA,SAAS,aAAa;AACtB,SAAS,uBAAuB;AAGhC,IAAM,mBAAmB;AAqBlB,SAAS,iBAAiB,MAA8B;AAC7D,QAAM,YAAY,KAAK,aAAa;AACpC,QAAM,WAAW,KAAK,YAAY;AAElC,SAAO,CAAC,iBACN,IAAI,QAAsB,CAAC,SAAS,WAAW;AAC7C,UAAM,QAAQ,MAAM,KAAK,SAAS,KAAK,QAAQ,CAAC,GAAG;AAAA,MACjD,KAAK;AAAA,MACL,OAAO,CAAC,QAAQ,QAAQ,MAAM;AAAA,MAC9B,KAAK,EAAE,GAAG,QAAQ,KAAK,GAAG,KAAK,IAAI;AAAA,IACrC,CAAC;AAED,UAAM,SAAmB,CAAC;AAC1B,QAAI,UAAU;AACd,QAAI,SAAS;AACb,UAAM,SAAS;AACf,QAAI,SAAS;AAEb,UAAM,SAAS,CAAC,OAAmB;AACjC,UAAI,QAAS;AACb,gBAAU;AACV,mBAAa,KAAK;AAClB,SAAG,MAAM;AACT,YAAM,KAAK,SAAS;AACpB,SAAG;AAAA,IACL;AACA,UAAM,aAAa,CAAC,QAClB,OAAO,SAAS,IAAI,GAAG,GAAG;AAAA;AAAA,EAAc,OAAO,KAAK,EAAE,EAAE,MAAM,IAAK,CAAC,KAAK;AAC3E,UAAM,OAAO,MAAM,OAAO,MAAM,QAAQ,EAAE,IAAI,KAAK,CAAC,CAAC;AACrD,UAAM,gBAAgB,CAAC,QACrB,OAAO,MAAM,QAAQ,EAAE,IAAI,OAAO,UAAU,WAAW,GAAG,EAAE,CAAC,CAAC;AAChE,UAAM,aAAa,CAAC,QAAe,OAAO,MAAM,OAAO,GAAG,CAAC;AAE3D,UAAM,OAAO,CAAC,QAA0C;AACtD,UAAI;AACF,cAAM,MAAM,MAAM,GAAG,KAAK,UAAU,GAAG,CAAC;AAAA,CAAI;AAC5C,eAAO;AAAA,MACT,SAAS,KAAK;AAEZ,sBAAc,uCAAwC,IAAc,OAAO,EAAE;AAC7E,eAAO;AAAA,MACT;AAAA,IACF;AAEA,UAAM,GAAG,SAAS,CAAC,QAAQ;AACzB,YAAM,OAAQ,IAA8B;AAC5C;AAAA,QACE,SAAS,WACL,IAAI;AAAA,UACF,sBAAsB,KAAK,OAAO;AAAA,QACpC,IACA,IAAI,MAAM,sBAAsB,KAAK,OAAO,sBAAsB,IAAI,OAAO,EAAE;AAAA,MACrF;AAAA,IACF,CAAC;AACD,UAAM,GAAG,QAAQ,CAAC,MAAM,WAAW;AAGjC,oBAAc,2BAA2B,IAAI,YAAY,MAAM,kBAAkB;AAAA,IACnF,CAAC;AACD,UAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,OAAO,KAAK,OAAO,CAAC,CAAC,CAAC;AAErD,UAAM,KAAK,gBAAgB,EAAE,OAAO,MAAM,OAAO,CAAC;AAClD,OAAG,GAAG,QAAQ,CAAC,SAAS;AACtB,UAAI;AACJ,UAAI;AACF,cAAM,KAAK,MAAM,IAAI;AAAA,MACvB,QAAQ;AACN;AAAA,MACF;AACA,UAAI,CAAC,OAAO,OAAO,QAAQ,SAAU;AAErC,UAAI,IAAI,OAAO,QAAQ;AACrB,YAAI,IAAI,MAAO,QAAO,cAAc,uBAAuB,KAAK,UAAU,IAAI,KAAK,CAAC,EAAE;AACtF,YAAI,CAAC,KAAK,EAAE,SAAS,OAAO,QAAQ,4BAA4B,CAAC,EAAG;AACpE,iBAAS;AACT,aAAK,EAAE,SAAS,OAAO,IAAI,QAAQ,QAAQ,aAAa,CAAC;AACzD;AAAA,MACF;AACA,UAAI,IAAI,OAAO,QAAQ;AACrB,YAAI,IAAI,MAAO,QAAO,cAAc,uBAAuB,KAAK,UAAU,IAAI,KAAK,CAAC,EAAE;AACtF,cAAM,QAAS,IAAI,QAA8C;AACjE,YAAI,CAAC,MAAM,QAAQ,KAAK,EAAG,QAAO,cAAc,sCAAsC;AACtF,YAAI,MAAM,SAAS,UAAU;AAC3B,iBAAO,cAAc,uBAAuB,MAAM,MAAM,qBAAqB,QAAQ,EAAE;AAAA,QACzF;AACA,eAAO,KAAK;AAAA,MACd;AAAA,IACF,CAAC;AAED,UAAM,QAAQ;AAAA,MACZ,MAAM,cAAc,oDAAoD,SAAS,IAAI;AAAA,MACrF;AAAA,IACF;AAEA,SAAK;AAAA,MACH,SAAS;AAAA,MACT,IAAI;AAAA,MACJ,QAAQ;AAAA,MACR,QAAQ;AAAA,QACN,iBAAiB;AAAA,QACjB,cAAc,CAAC;AAAA,QACf,YAAY,EAAE,MAAM,4BAA4B,SAAS,IAAI;AAAA,MAC/D;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AACL;","names":[]}

package/dist/{chunk-VYXBFWHZ.js → chunk-MRWXCFV5.js}

@@ -8,7 +8,7 @@ import {
   DELEGATION_STATUS_DESCRIPTION,
   DELEGATION_STATUS_INPUT_SCHEMA,
   DELEGATION_STATUS_TOOL_NAME
-} from "./chunk-55WKGOGU.js";
+} from "./chunk-ZKMOIEOB.js";
 
 // src/mcp/openai-tools.ts
 function buildTool(name, description, parameters) {
@@ -45,4 +45,4 @@ export {
   mcpToolsForRuntimeMcp,
   mcpToolsForRuntimeMcpSubset
 };
-//# sourceMappingURL=chunk-VYXBFWHZ.js.map
+//# sourceMappingURL=chunk-MRWXCFV5.js.map

package/dist/chunk-NBV35BR6.js

@@ -0,0 +1,68 @@
+// src/errors.ts
+import { AgentEvalError } from "@tangle-network/agent-eval";
+import {
+  AgentEvalError as AgentEvalError2,
+  ConfigError,
+  JudgeError,
+  NotFoundError,
+  ValidationError
+} from "@tangle-network/agent-eval";
+var SessionMismatchError = class extends AgentEvalError {
+  sessionBackend;
+  requestedBackend;
+  constructor(sessionBackend, requestedBackend, options) {
+    super(
+      "validation",
+      `Cannot resume ${sessionBackend} session with ${requestedBackend} backend`,
+      options
+    );
+    this.sessionBackend = sessionBackend;
+    this.requestedBackend = requestedBackend;
+  }
+};
+var BackendTransportError = class extends AgentEvalError {
+  backend;
+  status;
+  /**
+   * Truncated upstream response body (≤2 KiB) when available. Diagnostic
+   * only — surfaces in `backend_error.error.body` and `final.error.body`
+   * so operators can see "free_tier_limit", "invalid_api_key", etc. without
+   * cracking the log line open.
+   */
+  body;
+  constructor(backend, message, options) {
+    super("config", message, options);
+    this.backend = backend;
+    this.status = options?.status;
+    this.body = options?.body;
+  }
+};
+var RuntimeRunStateError = class extends AgentEvalError {
+  constructor(message, options) {
+    super("validation", message, options);
+  }
+};
+var PlannerError = class extends AgentEvalError {
+  constructor(message, options) {
+    super("validation", message, options);
+  }
+};
+var AnalystError = class extends AgentEvalError {
+  constructor(message, options) {
+    super("validation", message, options);
+  }
+};
+
+export {
+  SessionMismatchError,
+  BackendTransportError,
+  RuntimeRunStateError,
+  PlannerError,
+  AnalystError,
+  AgentEvalError2 as AgentEvalError,
+  ConfigError,
+  JudgeError,
+  NotFoundError,
+  ValidationError
+};
+//# sourceMappingURL=chunk-NBV35BR6.js.map

package/dist/chunk-NBV35BR6.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/errors.ts"],"sourcesContent":["/**\n * @stable\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\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 * @stable\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 */\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 * @stable\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 */\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 * @stable\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 */\nexport class RuntimeRunStateError extends AgentEvalError {\n  constructor(message: string, options?: { cause?: unknown }) {\n    super('validation', message, options)\n  }\n}\n\n/**\n * @stable\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 */\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":";AAsBA,SAAS,sBAAsB;AAE/B;AAAA,EACE,kBAAAA;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AAUA,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;AAUO,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;AAQO,IAAM,uBAAN,cAAmC,eAAe;AAAA,EACvD,YAAY,SAAiB,SAA+B;AAC1D,UAAM,cAAc,SAAS,OAAO;AAAA,EACtC;AACF;AAaO,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"]}