@tangle-network/agent-runtime 0.44.0 → 0.45.0

package/dist/chunk-FK53TXOP.js.map

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

package/dist/{chunk-SKUZZCHE.js → chunk-IJ6FGOPO.js}

@@ -1,10 +1,10 @@
-import {
-  runLoop
-} from "./chunk-S7JXV32P.js";
 import {
   coderProfile,
   multiHarnessCoderFanout
-} from "./chunk-3HMHSN22.js";
+} from "./chunk-QR4UUC5P.js";
+import {
+  runLoop
+} from "./chunk-KEWO4KI6.js";
 
 // src/mcp/executor.ts
 function createSiblingSandboxExecutor(options) {
@@ -210,4 +210,4 @@ export {
   createFleetWorkspaceExecutor,
   createDefaultCoderDelegate
 };
-//# sourceMappingURL=chunk-SKUZZCHE.js.map
+//# sourceMappingURL=chunk-IJ6FGOPO.js.map

package/dist/chunk-IJ6FGOPO.js.map

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

package/dist/{chunk-HVYOHJHK.js → chunk-IJGS6J7X.js}

@@ -1,6 +1,6 @@
 import {
   NotFoundError
-} from "./chunk-SQSCRJ7U.js";
+} from "./chunk-PRX45WE2.js";
 
 // src/mcp/task-queue.ts
 var DelegationTaskQueue = class {
@@ -1205,4 +1205,4 @@ export {
   INTELLIGENCE_WIRE_VERSION,
   exportEvalRuns
 };
-//# sourceMappingURL=chunk-HVYOHJHK.js.map
+//# sourceMappingURL=chunk-IJGS6J7X.js.map

package/dist/chunk-IJGS6J7X.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/mcp/task-queue.ts","../src/mcp/tools/delegate-code.ts","../src/mcp/feedback-store.ts","../src/mcp/tools/delegate-feedback.ts","../src/mcp/tools/delegate-research.ts","../src/mcp/tools/delegation-history.ts","../src/mcp/tools/delegation-status.ts","../src/otel-export.ts"],"sourcesContent":["/**\n * @experimental\n *\n * In-memory state for async MCP delegations. State machine:\n *\n *   pending → running → completed | failed\n *           ↘ cancelled (from any non-terminal state via cancel())\n *\n * Each `submit` returns a `taskId` immediately and kicks the work off in the\n * background. The work function receives an `AbortSignal` the queue fires\n * when `cancel(taskId)` is called. The queue does NOT supervise runtime\n * timeouts — the underlying `runLoop` driver / sandbox imposes those.\n *\n * Idempotency: callers may supply an `idempotencyKey` (hash of the input).\n * A duplicate `submit` with a known key returns the existing task instead of\n * starting a new one. Mutated input → different key → different task.\n *\n * Persistent state (sqlite) is a Phase 2 follow-up. The README documents the\n * in-memory limitation explicitly so consumers know a worker restart drops\n * pending delegations.\n */\n\nimport type {\n  DelegateCodeArgs,\n  DelegateResearchArgs,\n  DelegateUiAuditArgs,\n  DelegationError,\n  DelegationFeedbackSnapshot,\n  DelegationHistoryArgs,\n  DelegationHistoryEntry,\n  DelegationProfile,\n  DelegationProgress,\n  DelegationResultPayload,\n  DelegationStatus,\n  DelegationStatusResult,\n} from './types'\n\ntype AnyDelegateArgs = DelegateCodeArgs | DelegateResearchArgs | DelegateUiAuditArgs\n\n/** @experimental */\nexport interface DelegationRecord {\n  taskId: string\n  profile: DelegationProfile\n  namespace?: string\n  args: AnyDelegateArgs\n  status: DelegationStatus\n  progress?: DelegationProgress\n  result?: DelegationResultPayload\n  error?: DelegationError\n  costUsd?: number\n  startedAt: string\n  completedAt?: string\n  /** Sha-prefix hash of the canonical input — used for idempotency lookup. */\n  idempotencyKey?: string\n  /** Feedback events keyed by this delegation's taskId. */\n  feedback: DelegationFeedbackSnapshot[]\n}\n\n/** @experimental */\nexport interface SubmitInput<Args extends AnyDelegateArgs> {\n  profile: DelegationProfile\n  args: Args\n  namespace?: string\n  idempotencyKey?: string\n  /**\n   * Runs the underlying delegation. The queue passes a fresh `AbortSignal`\n   * and a `report` channel for incremental progress updates. The function\n   * MUST resolve with the typed `DelegationResultPayload['output']`; the\n   * queue wraps it with the profile tag.\n   */\n  run: (ctx: {\n    signal: AbortSignal\n    report(progress: DelegationProgress): void\n  }) => Promise<DelegationResultPayload['output']>\n}\n\n/** @experimental */\nexport interface SubmitOutput {\n  taskId: string\n  /** True when a prior matching `idempotencyKey` returned an existing record. */\n  reused: boolean\n}\n\n/** @experimental */\nexport interface DelegationTaskQueueOptions {\n  /** ID generator override; default `randomTaskId`. */\n  generateId?: () => string\n  /** Clock override; default `() => new Date().toISOString()`. */\n  now?: () => string\n}\n\n/** @experimental */\nexport class DelegationTaskQueue {\n  private readonly records = new Map<string, DelegationRecord>()\n  private readonly controllers = new Map<string, AbortController>()\n  private readonly byIdempotencyKey = new Map<string, string>()\n  private readonly generateId: () => string\n  private readonly now: () => string\n\n  constructor(options: DelegationTaskQueueOptions = {}) {\n    this.generateId = options.generateId ?? randomTaskId\n    this.now = options.now ?? (() => new Date().toISOString())\n  }\n\n  /**\n   * Kick off a delegation in the background. Returns immediately. The\n   * `taskId` is queryable via `status` once this method returns.\n   */\n  submit<Args extends AnyDelegateArgs>(input: SubmitInput<Args>): SubmitOutput {\n    if (input.idempotencyKey) {\n      const existing = this.byIdempotencyKey.get(input.idempotencyKey)\n      if (existing && this.records.has(existing)) {\n        return { taskId: existing, reused: true }\n      }\n    }\n    const taskId = this.generateId()\n    const controller = new AbortController()\n    const record: DelegationRecord = {\n      taskId,\n      profile: input.profile,\n      namespace: input.namespace,\n      args: input.args,\n      status: 'pending',\n      startedAt: this.now(),\n      feedback: [],\n      idempotencyKey: input.idempotencyKey,\n    }\n    this.records.set(taskId, record)\n    this.controllers.set(taskId, controller)\n    if (input.idempotencyKey) this.byIdempotencyKey.set(input.idempotencyKey, taskId)\n\n    // Fire-and-forget the run function. Errors flow into the record so the\n    // status poll surfaces them; the promise itself is intentionally\n    // unobserved by the queue.\n    queueMicrotask(() => {\n      this.execute(taskId, input, controller)\n    })\n\n    return { taskId, reused: false }\n  }\n\n  /**\n   * Snapshot the current state of a delegation. Returns `undefined` for\n   * unknown ids so callers can distinguish missing from terminal.\n   */\n  status(taskId: string): DelegationStatusResult | undefined {\n    const record = this.records.get(taskId)\n    if (!record) return undefined\n    return toStatusResult(record)\n  }\n\n  /**\n   * Abort an in-flight delegation. Returns `false` if the task is unknown\n   * or already terminal. The underlying `run` function MUST honor the\n   * abort signal for the cancel to take effect; the queue marks the\n   * record `cancelled` regardless so a misbehaving runner cannot pin the\n   * UI on `running` forever.\n   */\n  cancel(taskId: string): boolean {\n    const record = this.records.get(taskId)\n    if (!record) return false\n    if (isTerminal(record.status)) return false\n    const controller = this.controllers.get(taskId)\n    controller?.abort()\n    record.status = 'cancelled'\n    record.completedAt = this.now()\n    record.error = { message: 'cancelled by caller', kind: 'CancelledError' }\n    return true\n  }\n\n  /**\n   * Append a feedback event to the matching delegation. Returns `false`\n   * when `ref` does not name a known taskId — the caller should still\n   * record the feedback through a different surface (artifact/outcome\n   * kinds are not queue-bound).\n   */\n  attachFeedback(taskId: string, snapshot: DelegationFeedbackSnapshot): boolean {\n    const record = this.records.get(taskId)\n    if (!record) return false\n    record.feedback.push(snapshot)\n    return true\n  }\n\n  /**\n   * Query the recorded delegations. Returns entries newest-first (by\n   * `startedAt`), truncated to `limit`.\n   */\n  history(args: DelegationHistoryArgs = {}): DelegationHistoryEntry[] {\n    const limit = clampLimit(args.limit)\n    const since = args.since ? Date.parse(args.since) : Number.NEGATIVE_INFINITY\n    const out: DelegationHistoryEntry[] = []\n    for (const record of this.records.values()) {\n      if (args.namespace && record.namespace !== args.namespace) continue\n      if (args.profile && record.profile !== args.profile) continue\n      if (Number.isFinite(since) && Date.parse(record.startedAt) < since) continue\n      out.push(toHistoryEntry(record))\n    }\n    out.sort((a, b) => b.startedAt.localeCompare(a.startedAt))\n    return out.slice(0, limit)\n  }\n\n  /** Test-only — number of in-flight (non-terminal) records. */\n  inflightCount(): number {\n    let n = 0\n    for (const record of this.records.values()) {\n      if (!isTerminal(record.status)) n += 1\n    }\n    return n\n  }\n\n  private async execute<Args extends AnyDelegateArgs>(\n    taskId: string,\n    input: SubmitInput<Args>,\n    controller: AbortController,\n  ): Promise<void> {\n    const record = this.records.get(taskId)\n    if (!record) return\n    record.status = 'running'\n    try {\n      const output = await input.run({\n        signal: controller.signal,\n        report: (progress) => {\n          if (record.status === 'running') record.progress = progress\n        },\n      })\n      // `cancel()` may have flipped the status to `cancelled` while the\n      // run promise was pending. Read the field through a widening\n      // helper so the narrowed `'running'` type from the assignment\n      // above does not exclude that case at compile time.\n      if (currentStatus(record) === 'cancelled') return\n      record.status = 'completed'\n      record.completedAt = this.now()\n      record.result = { profile: input.profile, output } as DelegationResultPayload\n    } catch (err) {\n      if (currentStatus(record) === 'cancelled') return\n      record.status = 'failed'\n      record.completedAt = this.now()\n      record.error = errorToShape(err)\n    } finally {\n      this.controllers.delete(taskId)\n    }\n  }\n}\n\nfunction isTerminal(status: DelegationStatus): boolean {\n  return status === 'completed' || status === 'failed' || status === 'cancelled'\n}\n\nfunction currentStatus(record: DelegationRecord): DelegationStatus {\n  return record.status\n}\n\nfunction clampLimit(raw: number | undefined): number {\n  if (!Number.isFinite(raw)) return 50\n  const n = Math.trunc(raw as number)\n  if (n <= 0) return 50\n  return Math.min(n, 500)\n}\n\nfunction toStatusResult(record: DelegationRecord): DelegationStatusResult {\n  const out: DelegationStatusResult = {\n    taskId: record.taskId,\n    profile: record.profile,\n    status: record.status,\n    startedAt: record.startedAt,\n  }\n  if (record.progress) out.progress = record.progress\n  if (record.result) out.result = record.result\n  if (record.error) out.error = record.error\n  if (record.costUsd !== undefined) out.costUsd = record.costUsd\n  if (record.completedAt) out.completedAt = record.completedAt\n  return out\n}\n\nfunction toHistoryEntry(record: DelegationRecord): DelegationHistoryEntry {\n  const entry: DelegationHistoryEntry = {\n    taskId: record.taskId,\n    profile: record.profile,\n    args: record.args,\n    status: record.status,\n    startedAt: record.startedAt,\n  }\n  if (record.namespace) entry.namespace = record.namespace\n  if (record.completedAt) entry.completedAt = record.completedAt\n  if (record.costUsd !== undefined) entry.costUsd = record.costUsd\n  if (record.feedback.length > 0) entry.feedback = [...record.feedback]\n  return entry\n}\n\nfunction errorToShape(err: unknown): DelegationError {\n  if (err instanceof Error) {\n    return { message: err.message, kind: err.name || 'Error' }\n  }\n  return { message: String(err), kind: 'NonError' }\n}\n\nfunction randomTaskId(): string {\n  // Caller-stable id: `dlg-${timestamp}-${random}`. The timestamp portion\n  // makes lexicographic sort match chronological order in history queries\n  // even when the system clock skews under the second.\n  const t = Date.now().toString(36)\n  const r = Math.random().toString(36).slice(2, 10)\n  return `dlg-${t}-${r}`\n}\n\n/**\n * Best-effort stable hash for use as `idempotencyKey`. Not cryptographic;\n * collisions only affect dedupe, never correctness.\n *\n * @experimental\n */\nexport function hashIdempotencyInput(value: unknown): string {\n  let str: string\n  try {\n    str = JSON.stringify(canonicalize(value))\n  } catch {\n    str = String(value)\n  }\n  // FNV-1a 32-bit\n  let h = 0x811c9dc5\n  for (let i = 0; i < str.length; i += 1) {\n    h ^= str.charCodeAt(i)\n    h = Math.imul(h, 0x01000193)\n  }\n  return (h >>> 0).toString(16).padStart(8, '0')\n}\n\nfunction canonicalize(value: unknown): unknown {\n  if (value === null || typeof value !== 'object') return value\n  if (Array.isArray(value)) return value.map(canonicalize)\n  const entries = Object.entries(value as Record<string, unknown>)\n    .filter(([, v]) => v !== undefined)\n    .sort(([a], [b]) => a.localeCompare(b))\n  const out: Record<string, unknown> = {}\n  for (const [k, v] of entries) out[k] = canonicalize(v)\n  return out\n}\n\n// Re-exports re-used by the feedback-store + handler glue. Kept local so\n// consumers of the queue don't have to import from `./types` separately.\nexport type {\n  DelegateCodeArgs,\n  DelegateCodeResult,\n  DelegateFeedbackArgs,\n  DelegateFeedbackResult,\n  DelegateResearchArgs,\n  DelegateResearchResult,\n  DelegateUiAuditArgs,\n  DelegateUiAuditConfig,\n  DelegateUiAuditResult,\n  DelegateUiAuditRoute,\n  DelegationError,\n  DelegationFeedbackSnapshot,\n  DelegationHistoryArgs,\n  DelegationHistoryEntry,\n  DelegationHistoryResult,\n  DelegationProfile,\n  DelegationProgress,\n  DelegationResultPayload,\n  DelegationStatus,\n  DelegationStatusArgs,\n  DelegationStatusResult,\n  UiAuditorDelegationOutput,\n} from './types'\n","/**\n * @experimental\n *\n * `delegate_code` MCP tool — async kickoff. The handler validates the\n * input, computes an idempotency key over the canonical fields, hands\n * the task to the queue, and returns `{ taskId, estimatedDurationMs }`.\n */\n\nimport type { CoderDelegate } from '../delegates'\nimport {\n  type DelegateCodeArgs,\n  type DelegateCodeResult,\n  type DelegationTaskQueue,\n  hashIdempotencyInput,\n} from '../task-queue'\n\n/** @experimental */\nexport const DELEGATE_CODE_TOOL_NAME = 'delegate_code'\n\n/** @experimental */\nexport const DELEGATE_CODE_DESCRIPTION = [\n  'Delegate a coding task to specialist coder agents that produce a validated patch.',\n  '',\n  'Use when: you need code written, fixed, refactored, or extended to satisfy a',\n  'user goal that touches a real repository. The coder runs in an isolated',\n  'sandbox, opens a fresh branch, keeps the diff minimal, runs the supplied',\n  'test + typecheck commands, and emits a unified-diff patch.',\n  '',\n  'Returns immediately with a taskId. Poll delegation_status to retrieve the',\n  'patch + validator verdict (typically minutes-to-hours, longer for large',\n  'changes). Identical inputs return the same taskId — safe to retry.',\n  '',\n  'When variants > 1, multiple coder harnesses (claude-code, codex, opencode)',\n  'attempt the task in parallel and the highest-scoring patch wins (smallest',\n  'passing diff). Use variants for high-stakes changes; single variant for',\n  'routine ones.',\n  '',\n  'Capability scope: the coder cannot modify paths outside repoRoot and cannot',\n  'touch paths in config.forbiddenPaths. The validator hard-fails on a',\n  'forbidden-path violation, diff above config.maxDiffLines, test failure, or',\n  'typecheck failure — none of those make it past the gate.',\n].join('\\n')\n\n/** @experimental */\nexport const DELEGATE_CODE_INPUT_SCHEMA = {\n  type: 'object',\n  properties: {\n    goal: {\n      type: 'string',\n      description: 'Natural-language description of what the coder must accomplish.',\n    },\n    repoRoot: {\n      type: 'string',\n      description: 'Absolute path inside the sandbox where the repo lives.',\n    },\n    contextHint: {\n      type: 'string',\n      description: 'Optional free-form context the coder sees in the prompt prelude.',\n    },\n    variants: {\n      type: 'integer',\n      minimum: 1,\n      maximum: 8,\n      description: 'Number of parallel coder harnesses. Default 1.',\n    },\n    config: {\n      type: 'object',\n      properties: {\n        testCmd: { type: 'string' },\n        typecheckCmd: { type: 'string' },\n        forbiddenPaths: { type: 'array', items: { type: 'string' } },\n        maxDiffLines: { type: 'integer', minimum: 1 },\n      },\n      additionalProperties: false,\n    },\n    namespace: {\n      type: 'string',\n      description: 'Multi-tenant scope (customer-id, workspace-id).',\n    },\n  },\n  required: ['goal', 'repoRoot'],\n  additionalProperties: false,\n} as const\n\nconst SINGLE_VARIANT_ESTIMATE_MS = 6 * 60 * 1000 // 6 minutes — single coder\nconst FANOUT_PER_VARIANT_ESTIMATE_MS = 8 * 60 * 1000 // 8 minutes — fanout\n\n/** @experimental */\nexport function validateDelegateCodeArgs(raw: unknown): DelegateCodeArgs {\n  if (raw === null || typeof raw !== 'object') {\n    throw new TypeError('delegate_code: arguments must be an object')\n  }\n  const value = raw as Record<string, unknown>\n  const goal = value.goal\n  if (typeof goal !== 'string' || goal.trim().length === 0) {\n    throw new TypeError('delegate_code: `goal` must be a non-empty string')\n  }\n  const repoRoot = value.repoRoot\n  if (typeof repoRoot !== 'string' || repoRoot.trim().length === 0) {\n    throw new TypeError('delegate_code: `repoRoot` must be a non-empty string')\n  }\n  const args: DelegateCodeArgs = { goal: goal.trim(), repoRoot: repoRoot.trim() }\n  if (typeof value.contextHint === 'string') args.contextHint = value.contextHint\n  if (value.variants !== undefined) {\n    const variants = Number(value.variants)\n    if (!Number.isFinite(variants) || variants < 1 || variants > 8) {\n      throw new RangeError('delegate_code: `variants` must be an integer in [1, 8]')\n    }\n    args.variants = Math.trunc(variants)\n  }\n  if (value.config !== undefined) {\n    args.config = validateConfig(value.config)\n  }\n  if (typeof value.namespace === 'string') args.namespace = value.namespace\n  return args\n}\n\nfunction validateConfig(raw: unknown): DelegateCodeArgs['config'] {\n  if (raw === null || typeof raw !== 'object') {\n    throw new TypeError('delegate_code: `config` must be an object')\n  }\n  const value = raw as Record<string, unknown>\n  const out: NonNullable<DelegateCodeArgs['config']> = {}\n  if (value.testCmd !== undefined) {\n    if (typeof value.testCmd !== 'string') {\n      throw new TypeError('delegate_code: `config.testCmd` must be a string')\n    }\n    out.testCmd = value.testCmd\n  }\n  if (value.typecheckCmd !== undefined) {\n    if (typeof value.typecheckCmd !== 'string') {\n      throw new TypeError('delegate_code: `config.typecheckCmd` must be a string')\n    }\n    out.typecheckCmd = value.typecheckCmd\n  }\n  if (value.forbiddenPaths !== undefined) {\n    if (!Array.isArray(value.forbiddenPaths)) {\n      throw new TypeError('delegate_code: `config.forbiddenPaths` must be a string array')\n    }\n    out.forbiddenPaths = value.forbiddenPaths.map((entry, i) => {\n      if (typeof entry !== 'string') {\n        throw new TypeError(`delegate_code: forbiddenPaths[${i}] must be a string`)\n      }\n      return entry\n    })\n  }\n  if (value.maxDiffLines !== undefined) {\n    const n = Number(value.maxDiffLines)\n    if (!Number.isFinite(n) || n < 1) {\n      throw new RangeError('delegate_code: `config.maxDiffLines` must be a positive integer')\n    }\n    out.maxDiffLines = Math.trunc(n)\n  }\n  return out\n}\n\n/** @experimental */\nexport interface DelegateCodeHandlerOptions {\n  queue: DelegationTaskQueue\n  delegate: CoderDelegate\n  /** Override the duration hint. */\n  estimateDurationMs?: (args: DelegateCodeArgs) => number\n}\n\n/** @experimental */\nexport function createDelegateCodeHandler(\n  options: DelegateCodeHandlerOptions,\n): (raw: unknown) => Promise<DelegateCodeResult> {\n  const estimateDurationMs = options.estimateDurationMs ?? defaultEstimate\n  return async (raw) => {\n    const args = validateDelegateCodeArgs(raw)\n    const idempotencyKey = hashIdempotencyInput({\n      profile: 'coder',\n      goal: args.goal,\n      repoRoot: args.repoRoot,\n      contextHint: args.contextHint,\n      variants: args.variants ?? 1,\n      config: args.config,\n      namespace: args.namespace,\n    })\n    const submitted = options.queue.submit<DelegateCodeArgs>({\n      profile: 'coder',\n      args,\n      namespace: args.namespace,\n      idempotencyKey,\n      run: async (ctx) => options.delegate(args, ctx),\n    })\n    return {\n      taskId: submitted.taskId,\n      estimatedDurationMs: estimateDurationMs(args),\n    }\n  }\n}\n\nfunction defaultEstimate(args: DelegateCodeArgs): number {\n  const variants = Math.max(1, args.variants ?? 1)\n  if (variants === 1) return SINGLE_VARIANT_ESTIMATE_MS\n  return FANOUT_PER_VARIANT_ESTIMATE_MS\n}\n","/**\n * @experimental\n *\n * Feedback persistence surface for the MCP layer.\n *\n * The substrate cannot import `@tangle-network/agent-knowledge` (it would\n * induce a dependency cycle), so the store is an abstract interface. The\n * default implementation is in-memory; consumers wire their own adapter\n * (a real KbStore-backed sink, an HTTP relay to gtm-agent's knowledge\n * service, etc.) via `createMcpServer({ feedbackStore })`.\n *\n * Feedback events are append-only: every rating is a new event with a\n * fresh id, even when the same delegation is rated multiple times. The\n * caller decides how to roll up scores downstream.\n */\n\nimport type { DelegateFeedbackArgs, DelegationFeedbackSnapshot } from './types'\n\n/** @experimental */\nexport interface FeedbackEvent {\n  id: string\n  refersTo: DelegateFeedbackArgs['refersTo']\n  rating: DelegateFeedbackArgs['rating']\n  by: DelegateFeedbackArgs['by']\n  capturedAt: string\n  namespace?: string\n}\n\n/** @experimental */\nexport interface FeedbackStore {\n  /** Append a new event. Never dedupes — every rating is its own event. */\n  put(event: FeedbackEvent): Promise<void>\n  /**\n   * List events filtered by `namespace`. When `namespace` is omitted, list\n   * across all namespaces. Returns events in insertion order.\n   */\n  list(filter?: { namespace?: string; refersToRef?: string }): Promise<FeedbackEvent[]>\n}\n\n/** @experimental */\nexport class InMemoryFeedbackStore implements FeedbackStore {\n  private readonly events: FeedbackEvent[] = []\n\n  async put(event: FeedbackEvent): Promise<void> {\n    this.events.push({ ...event })\n  }\n\n  async list(filter: { namespace?: string; refersToRef?: string } = {}): Promise<FeedbackEvent[]> {\n    let out = this.events\n    if (filter.namespace !== undefined) {\n      out = out.filter((event) => event.namespace === filter.namespace)\n    }\n    if (filter.refersToRef !== undefined) {\n      out = out.filter((event) => event.refersTo.ref === filter.refersToRef)\n    }\n    return out.map((event) => ({ ...event }))\n  }\n}\n\n/**\n * Project a `FeedbackEvent` down to the snapshot shape carried on\n * `delegation_history` entries.\n *\n * @experimental\n */\nexport function eventToSnapshot(event: FeedbackEvent): DelegationFeedbackSnapshot {\n  const snap: DelegationFeedbackSnapshot = {\n    id: event.id,\n    score: event.rating.score,\n    by: event.by,\n    notes: event.rating.notes,\n    capturedAt: event.capturedAt,\n  }\n  if (event.rating.label) snap.label = event.rating.label\n  return snap\n}\n","/**\n * @experimental\n *\n * `delegate_feedback` MCP tool — synchronous record of agent / user /\n * downstream-judge feedback on a delegation, artifact, or outcome.\n *\n * The store is append-only. Every rating is its own event; no dedupe.\n * When `refersTo.kind === 'delegation'`, the snapshot is also attached\n * to the matching queue record so `delegation_history` surfaces it\n * inline without a join.\n */\n\nimport type { FeedbackStore } from '../feedback-store'\nimport { eventToSnapshot } from '../feedback-store'\nimport type { DelegationTaskQueue } from '../task-queue'\nimport type {\n  DelegateFeedbackArgs,\n  DelegateFeedbackResult,\n  FeedbackRating,\n  FeedbackRefersTo,\n} from '../types'\n\n/** @experimental */\nexport const DELEGATE_FEEDBACK_TOOL_NAME = 'delegate_feedback'\n\n/** @experimental */\nexport const DELEGATE_FEEDBACK_DESCRIPTION = [\n  'Record feedback on a delegation, artifact, or outcome. Synchronous — the',\n  'event is durably stored when this call returns.',\n  '',\n  'Use when: you (the agent), the user, or a downstream judge has formed an',\n  'opinion about a piece of work and want it persisted for calibration,',\n  'pricing, or future routing. Every call is a new event — multiple ratings',\n  'on the same target are expected and never deduped.',\n  '',\n  '`refersTo.kind`:',\n  '  - \"delegation\": ref is a taskId returned by delegate_code/delegate_research',\n  '  - \"artifact\":   ref is a URI/path/git-sha — anything you can dereference',\n  '  - \"outcome\":    ref is a free-form description of a downstream result',\n  '',\n  '`by`:',\n  '  - \"agent\":            the agent itself rated the work',\n  '  - \"user\":             the human user rated it',\n  '  - \"downstream-judge\": an automated evaluator emitted the rating',\n  '',\n  'When ref names a known taskId, the rating is also attached to the',\n  'delegation record so delegation_history surfaces it inline.',\n].join('\\n')\n\n/** @experimental */\nexport const DELEGATE_FEEDBACK_INPUT_SCHEMA = {\n  type: 'object',\n  properties: {\n    refersTo: {\n      type: 'object',\n      properties: {\n        kind: { type: 'string', enum: ['delegation', 'artifact', 'outcome'] },\n        ref: { type: 'string' },\n      },\n      required: ['kind', 'ref'],\n      additionalProperties: false,\n    },\n    rating: {\n      type: 'object',\n      properties: {\n        score: { type: 'number', minimum: 0, maximum: 1 },\n        label: { type: 'string', enum: ['good', 'bad', 'neutral', 'mixed'] },\n        notes: { type: 'string' },\n      },\n      required: ['score', 'notes'],\n      additionalProperties: false,\n    },\n    by: { type: 'string', enum: ['agent', 'user', 'downstream-judge'] },\n    capturedAt: { type: 'string' },\n    namespace: { type: 'string' },\n  },\n  required: ['refersTo', 'rating', 'by'],\n  additionalProperties: false,\n} as const\n\n/** @experimental */\nexport function validateDelegateFeedbackArgs(raw: unknown): DelegateFeedbackArgs {\n  if (raw === null || typeof raw !== 'object') {\n    throw new TypeError('delegate_feedback: arguments must be an object')\n  }\n  const value = raw as Record<string, unknown>\n  const refersTo = validateRefersTo(value.refersTo)\n  const rating = validateRating(value.rating)\n  const by = value.by\n  if (by !== 'agent' && by !== 'user' && by !== 'downstream-judge') {\n    throw new TypeError(\n      'delegate_feedback: `by` must be one of \"agent\" | \"user\" | \"downstream-judge\"',\n    )\n  }\n  const args: DelegateFeedbackArgs = { refersTo, rating, by }\n  if (value.capturedAt !== undefined) {\n    if (typeof value.capturedAt !== 'string' || Number.isNaN(Date.parse(value.capturedAt))) {\n      throw new TypeError('delegate_feedback: `capturedAt` must be an ISO datetime')\n    }\n    args.capturedAt = value.capturedAt\n  }\n  if (typeof value.namespace === 'string') args.namespace = value.namespace\n  return args\n}\n\nfunction validateRefersTo(raw: unknown): FeedbackRefersTo {\n  if (raw === null || typeof raw !== 'object') {\n    throw new TypeError('delegate_feedback: `refersTo` must be an object')\n  }\n  const value = raw as Record<string, unknown>\n  const kind = value.kind\n  if (kind !== 'delegation' && kind !== 'artifact' && kind !== 'outcome') {\n    throw new TypeError(\n      'delegate_feedback: `refersTo.kind` must be one of \"delegation\" | \"artifact\" | \"outcome\"',\n    )\n  }\n  const ref = value.ref\n  if (typeof ref !== 'string' || ref.trim().length === 0) {\n    throw new TypeError('delegate_feedback: `refersTo.ref` must be a non-empty string')\n  }\n  return { kind, ref: ref.trim() }\n}\n\nfunction validateRating(raw: unknown): FeedbackRating {\n  if (raw === null || typeof raw !== 'object') {\n    throw new TypeError('delegate_feedback: `rating` must be an object')\n  }\n  const value = raw as Record<string, unknown>\n  const score = Number(value.score)\n  if (!Number.isFinite(score) || score < 0 || score > 1) {\n    throw new RangeError('delegate_feedback: `rating.score` must be a number in [0, 1]')\n  }\n  const notes = value.notes\n  if (typeof notes !== 'string') {\n    throw new TypeError('delegate_feedback: `rating.notes` must be a string')\n  }\n  const rating: FeedbackRating = { score, notes }\n  const label = value.label\n  if (label !== undefined) {\n    if (label !== 'good' && label !== 'bad' && label !== 'neutral' && label !== 'mixed') {\n      throw new TypeError(\n        'delegate_feedback: `rating.label` must be one of \"good\" | \"bad\" | \"neutral\" | \"mixed\"',\n      )\n    }\n    rating.label = label\n  }\n  return rating\n}\n\n/** @experimental */\nexport interface DelegateFeedbackHandlerOptions {\n  queue: DelegationTaskQueue\n  store: FeedbackStore\n  generateId?: () => string\n  now?: () => string\n}\n\n/** @experimental */\nexport function createDelegateFeedbackHandler(\n  options: DelegateFeedbackHandlerOptions,\n): (raw: unknown) => Promise<DelegateFeedbackResult> {\n  const generateId = options.generateId ?? randomFeedbackId\n  const now = options.now ?? (() => new Date().toISOString())\n  return async (raw) => {\n    const args = validateDelegateFeedbackArgs(raw)\n    const id = generateId()\n    const event = {\n      id,\n      refersTo: args.refersTo,\n      rating: args.rating,\n      by: args.by,\n      capturedAt: args.capturedAt ?? now(),\n      namespace: args.namespace,\n    }\n    await options.store.put(event)\n    if (args.refersTo.kind === 'delegation') {\n      options.queue.attachFeedback(args.refersTo.ref, eventToSnapshot(event))\n    }\n    return { recorded: true, id }\n  }\n}\n\nfunction randomFeedbackId(): string {\n  const t = Date.now().toString(36)\n  const r = Math.random().toString(36).slice(2, 10)\n  return `fbk-${t}-${r}`\n}\n","/**\n * @experimental\n *\n * `delegate_research` MCP tool — async kickoff for source-grounded\n * research tasks. Same async semantics as `delegate_code`: returns a\n * taskId immediately, idempotent on canonical inputs.\n *\n * The handler does not import a researcher profile directly — consumers\n * inject a `ResearcherDelegate` via `createMcpServer({ researcherDelegate })`.\n * The substrate cannot depend on `@tangle-network/agent-knowledge`\n * without inducing a dependency cycle.\n */\n\nimport type { ResearcherDelegate } from '../delegates'\nimport {\n  type DelegateResearchArgs,\n  type DelegateResearchResult,\n  type DelegationTaskQueue,\n  hashIdempotencyInput,\n} from '../task-queue'\nimport type { ResearchSource } from '../types'\n\n/** @experimental */\nexport const DELEGATE_RESEARCH_TOOL_NAME = 'delegate_research'\n\n/** @experimental */\nexport const DELEGATE_RESEARCH_DESCRIPTION = [\n  'Delegate a research question to specialist researcher agents that produce',\n  'source-grounded, evidence-bearing knowledge items.',\n  '',\n  'Use when: you need to answer a factual question with external evidence —',\n  'audience research, competitive intelligence, recency-bound web searches,',\n  'corpus / docs lookups. The researcher emits items[] with provenance, a',\n  'citations[] index, and proposedWrites[] you decide whether to persist.',\n  '',\n  'Returns immediately with a taskId. Poll delegation_status to retrieve the',\n  'items + verdict. Identical inputs return the same taskId — safe to retry.',\n  '',\n  'When variants > 1, multiple researcher harnesses run in parallel and the',\n  'highest-scoring valid output wins (citation density × source diversity ×',\n  'recency match × gap coverage). Use variants when answers might disagree.',\n  '',\n  'Multi-tenant isolation: every item carries `namespace`. The validator',\n  'hard-fails when any item is scoped outside `namespace`. Never pass another',\n  \"tenant's namespace.\",\n].join('\\n')\n\nconst VALID_SOURCES: readonly ResearchSource[] = ['web', 'corpus', 'twitter', 'github', 'docs']\n\n/** @experimental */\nexport const DELEGATE_RESEARCH_INPUT_SCHEMA = {\n  type: 'object',\n  properties: {\n    question: {\n      type: 'string',\n      description: 'The research question to answer.',\n    },\n    namespace: {\n      type: 'string',\n      description: 'Multi-tenant scope (customer-id, workspace-id). REQUIRED.',\n    },\n    scope: { type: 'string', description: 'Bound, e.g. \"audience for cpg-founder ICP\".' },\n    sources: {\n      type: 'array',\n      items: { type: 'string', enum: [...VALID_SOURCES] },\n    },\n    variants: { type: 'integer', minimum: 1, maximum: 8 },\n    config: {\n      type: 'object',\n      properties: {\n        recencyWindow: {\n          type: 'object',\n          properties: {\n            since: { type: 'string', description: 'ISO datetime' },\n            until: { type: 'string', description: 'ISO datetime' },\n          },\n          additionalProperties: false,\n        },\n        maxItems: { type: 'integer', minimum: 1 },\n        minConfidence: { type: 'number', minimum: 0, maximum: 1 },\n      },\n      additionalProperties: false,\n    },\n  },\n  required: ['question', 'namespace'],\n  additionalProperties: false,\n} as const\n\nconst SINGLE_VARIANT_ESTIMATE_MS = 4 * 60 * 1000\nconst FANOUT_PER_VARIANT_ESTIMATE_MS = 6 * 60 * 1000\n\n/** @experimental */\nexport function validateDelegateResearchArgs(raw: unknown): DelegateResearchArgs {\n  if (raw === null || typeof raw !== 'object') {\n    throw new TypeError('delegate_research: arguments must be an object')\n  }\n  const value = raw as Record<string, unknown>\n  const question = value.question\n  if (typeof question !== 'string' || question.trim().length === 0) {\n    throw new TypeError('delegate_research: `question` must be a non-empty string')\n  }\n  const namespace = value.namespace\n  if (typeof namespace !== 'string' || namespace.trim().length === 0) {\n    throw new TypeError('delegate_research: `namespace` is required')\n  }\n  const args: DelegateResearchArgs = { question: question.trim(), namespace: namespace.trim() }\n  if (typeof value.scope === 'string') args.scope = value.scope\n  if (value.sources !== undefined) {\n    if (!Array.isArray(value.sources)) {\n      throw new TypeError('delegate_research: `sources` must be a string array')\n    }\n    const sources: ResearchSource[] = value.sources.map((src, i) => {\n      if (typeof src !== 'string' || !VALID_SOURCES.includes(src as ResearchSource)) {\n        throw new TypeError(\n          `delegate_research: sources[${i}] must be one of ${VALID_SOURCES.join('|')}`,\n        )\n      }\n      return src as ResearchSource\n    })\n    args.sources = sources\n  }\n  if (value.variants !== undefined) {\n    const variants = Number(value.variants)\n    if (!Number.isFinite(variants) || variants < 1 || variants > 8) {\n      throw new RangeError('delegate_research: `variants` must be an integer in [1, 8]')\n    }\n    args.variants = Math.trunc(variants)\n  }\n  if (value.config !== undefined) {\n    args.config = validateConfig(value.config)\n  }\n  return args\n}\n\nfunction validateConfig(raw: unknown): DelegateResearchArgs['config'] {\n  if (raw === null || typeof raw !== 'object') {\n    throw new TypeError('delegate_research: `config` must be an object')\n  }\n  const value = raw as Record<string, unknown>\n  const out: NonNullable<DelegateResearchArgs['config']> = {}\n  if (value.recencyWindow !== undefined) {\n    if (value.recencyWindow === null || typeof value.recencyWindow !== 'object') {\n      throw new TypeError('delegate_research: `config.recencyWindow` must be an object')\n    }\n    const window = value.recencyWindow as Record<string, unknown>\n    const windowOut: NonNullable<NonNullable<DelegateResearchArgs['config']>['recencyWindow']> = {}\n    if (window.since !== undefined) {\n      if (typeof window.since !== 'string' || Number.isNaN(Date.parse(window.since))) {\n        throw new TypeError('delegate_research: `recencyWindow.since` must be an ISO datetime')\n      }\n      windowOut.since = window.since\n    }\n    if (window.until !== undefined) {\n      if (typeof window.until !== 'string' || Number.isNaN(Date.parse(window.until))) {\n        throw new TypeError('delegate_research: `recencyWindow.until` must be an ISO datetime')\n      }\n      windowOut.until = window.until\n    }\n    out.recencyWindow = windowOut\n  }\n  if (value.maxItems !== undefined) {\n    const n = Number(value.maxItems)\n    if (!Number.isFinite(n) || n < 1) {\n      throw new RangeError('delegate_research: `config.maxItems` must be a positive integer')\n    }\n    out.maxItems = Math.trunc(n)\n  }\n  if (value.minConfidence !== undefined) {\n    const n = Number(value.minConfidence)\n    if (!Number.isFinite(n) || n < 0 || n > 1) {\n      throw new RangeError('delegate_research: `config.minConfidence` must be in [0, 1]')\n    }\n    out.minConfidence = n\n  }\n  return out\n}\n\n/** @experimental */\nexport interface DelegateResearchHandlerOptions {\n  queue: DelegationTaskQueue\n  delegate: ResearcherDelegate\n  estimateDurationMs?: (args: DelegateResearchArgs) => number\n}\n\n/** @experimental */\nexport function createDelegateResearchHandler(\n  options: DelegateResearchHandlerOptions,\n): (raw: unknown) => Promise<DelegateResearchResult> {\n  const estimateDurationMs = options.estimateDurationMs ?? defaultEstimate\n  return async (raw) => {\n    const args = validateDelegateResearchArgs(raw)\n    const idempotencyKey = hashIdempotencyInput({\n      profile: 'researcher',\n      question: args.question,\n      namespace: args.namespace,\n      scope: args.scope,\n      sources: args.sources,\n      variants: args.variants ?? 1,\n      config: args.config,\n    })\n    const submitted = options.queue.submit<DelegateResearchArgs>({\n      profile: 'researcher',\n      args,\n      namespace: args.namespace,\n      idempotencyKey,\n      run: async (ctx) => options.delegate(args, ctx),\n    })\n    return {\n      taskId: submitted.taskId,\n      estimatedDurationMs: estimateDurationMs(args),\n    }\n  }\n}\n\nfunction defaultEstimate(args: DelegateResearchArgs): number {\n  const variants = Math.max(1, args.variants ?? 1)\n  if (variants === 1) return SINGLE_VARIANT_ESTIMATE_MS\n  return FANOUT_PER_VARIANT_ESTIMATE_MS\n}\n","/**\n * @experimental\n *\n * `delegation_history` MCP tool — synchronous read of past delegations.\n * The agent uses this for self-introspection — \"have I delegated this\n * kind of task before? did it work?\" — and calibration.\n */\n\nimport type {\n  DelegationHistoryArgs,\n  DelegationHistoryResult,\n  DelegationProfile,\n  DelegationTaskQueue,\n} from '../task-queue'\n\n/** @experimental */\nexport const DELEGATION_HISTORY_TOOL_NAME = 'delegation_history'\n\n/** @experimental */\nexport const DELEGATION_HISTORY_DESCRIPTION = [\n  'Read past delegations newest-first. Each entry carries the original',\n  'arguments, current status, cost, and any feedback attached via',\n  'delegate_feedback.',\n  '',\n  'Use when: you want to introspect prior decisions — \"have I asked this',\n  'question before?',\n  'did the last patch land?',\n  \"what's the historical\",\n  'success rate of coder delegations on this repo?\". Feed the results back',\n  'into your own routing and calibration.',\n  '',\n  'Filters: `namespace` (multi-tenant scope), `profile` (\"coder\" | \"researcher\"),',\n  '`since` (ISO date — only delegations started at-or-after). `limit` defaults',\n  'to 50, capped at 500.',\n].join('\\n')\n\n/** @experimental */\nexport const DELEGATION_HISTORY_INPUT_SCHEMA = {\n  type: 'object',\n  properties: {\n    namespace: { type: 'string' },\n    profile: { type: 'string', enum: ['coder', 'researcher'] },\n    since: { type: 'string', description: 'ISO datetime — earliest startedAt to include.' },\n    limit: { type: 'integer', minimum: 1, maximum: 500 },\n  },\n  additionalProperties: false,\n} as const\n\n/** @experimental */\nexport function validateDelegationHistoryArgs(raw: unknown): DelegationHistoryArgs {\n  if (raw === undefined || raw === null) return {}\n  if (typeof raw !== 'object') {\n    throw new TypeError('delegation_history: arguments must be an object')\n  }\n  const value = raw as Record<string, unknown>\n  const out: DelegationHistoryArgs = {}\n  if (value.namespace !== undefined) {\n    if (typeof value.namespace !== 'string') {\n      throw new TypeError('delegation_history: `namespace` must be a string')\n    }\n    out.namespace = value.namespace\n  }\n  if (value.profile !== undefined) {\n    if (value.profile !== 'coder' && value.profile !== 'researcher') {\n      throw new TypeError('delegation_history: `profile` must be \"coder\" or \"researcher\"')\n    }\n    out.profile = value.profile as DelegationProfile\n  }\n  if (value.since !== undefined) {\n    if (typeof value.since !== 'string' || Number.isNaN(Date.parse(value.since))) {\n      throw new TypeError('delegation_history: `since` must be an ISO datetime')\n    }\n    out.since = value.since\n  }\n  if (value.limit !== undefined) {\n    const n = Number(value.limit)\n    if (!Number.isFinite(n) || n < 1 || n > 500) {\n      throw new RangeError('delegation_history: `limit` must be an integer in [1, 500]')\n    }\n    out.limit = Math.trunc(n)\n  }\n  return out\n}\n\n/** @experimental */\nexport interface DelegationHistoryHandlerOptions {\n  queue: DelegationTaskQueue\n}\n\n/** @experimental */\nexport function createDelegationHistoryHandler(\n  options: DelegationHistoryHandlerOptions,\n): (raw: unknown) => Promise<DelegationHistoryResult> {\n  return async (raw) => {\n    const args = validateDelegationHistoryArgs(raw)\n    return { delegations: options.queue.history(args) }\n  }\n}\n","/**\n * @experimental\n *\n * `delegation_status` MCP tool — synchronous poll. Returns the current\n * state machine + optional progress + final result (when terminal).\n */\n\nimport { NotFoundError } from '../../errors'\nimport type {\n  DelegationStatusArgs,\n  DelegationStatusResult,\n  DelegationTaskQueue,\n} from '../task-queue'\n\n/** @experimental */\nexport const DELEGATION_STATUS_TOOL_NAME = 'delegation_status'\n\n/** @experimental */\nexport const DELEGATION_STATUS_DESCRIPTION = [\n  'Poll the status of an async delegation. Returns the current state',\n  '(pending | running | completed | failed | cancelled), optional progress,',\n  'and the final result when status === \"completed\".',\n  '',\n  'Use when: you previously called delegate_code or delegate_research and',\n  \"need to know whether the work is done. The agent's right rhythm is to\",\n  'call this every minute or two while waiting; do not busy-poll.',\n  '',\n  'For a completed coder task, `result.output` is a CoderOutput with branch,',\n  'patch, test/typecheck results, and diff stats. For a completed research',\n  'task, `result.output` is the items + citations + proposedWrites bundle.',\n  '',\n  'Throws NotFoundError when taskId is unknown — never silently returns',\n  '`pending` for a typo.',\n].join('\\n')\n\n/** @experimental */\nexport const DELEGATION_STATUS_INPUT_SCHEMA = {\n  type: 'object',\n  properties: {\n    taskId: { type: 'string', description: 'Returned by delegate_code / delegate_research.' },\n  },\n  required: ['taskId'],\n  additionalProperties: false,\n} as const\n\n/** @experimental */\nexport function validateDelegationStatusArgs(raw: unknown): DelegationStatusArgs {\n  if (raw === null || typeof raw !== 'object') {\n    throw new TypeError('delegation_status: arguments must be an object')\n  }\n  const value = raw as Record<string, unknown>\n  const taskId = value.taskId\n  if (typeof taskId !== 'string' || taskId.trim().length === 0) {\n    throw new TypeError('delegation_status: `taskId` must be a non-empty string')\n  }\n  return { taskId: taskId.trim() }\n}\n\n/** @experimental */\nexport interface DelegationStatusHandlerOptions {\n  queue: DelegationTaskQueue\n}\n\n/** @experimental */\nexport function createDelegationStatusHandler(\n  options: DelegationStatusHandlerOptions,\n): (raw: unknown) => Promise<DelegationStatusResult> {\n  return async (raw) => {\n    const args = validateDelegationStatusArgs(raw)\n    const status = options.queue.status(args.taskId)\n    if (!status) {\n      throw new NotFoundError(`delegation_status: unknown taskId \"${args.taskId}\"`)\n    }\n    return status\n  }\n}\n","/**\n * OTEL span exporter — streams LoopTraceEvents to an OTLP/HTTP collector.\n *\n * Reads OTEL_EXPORTER_OTLP_ENDPOINT + OTEL_EXPORTER_OTLP_HEADERS from env\n * when no explicit config is given. Keeps the runtime dep-free from\n * @opentelemetry/sdk-trace-base — minimal OTLP/JSON serializer.\n *\n * The exporter accepts both raw OtelSpan objects and LoopTraceEvents\n * (which get converted to OTLP spans automatically).\n */\n\nexport interface OtelExportConfig {\n  /** OTLP endpoint. Reads OTEL_EXPORTER_OTLP_ENDPOINT env by default. */\n  endpoint?: string\n  /** OTLP headers. Reads OTEL_EXPORTER_OTLP_HEADERS env by default. */\n  headers?: Record<string, string>\n  /** Batch size before flush. Default 64. */\n  batchSize?: number\n  /** Flush interval ms. Default 5000. */\n  flushIntervalMs?: number\n  /** Resource attributes stamped on every export. */\n  resourceAttributes?: Record<string, string | number | boolean>\n  /** Service name. Default 'agent-runtime'. */\n  serviceName?: string\n}\n\nexport interface OtelExporter {\n  /** Export a span. */\n  exportSpan(span: OtelSpan): void\n  /** Force flush pending spans. */\n  flush(): Promise<void>\n  /** Shutdown cleanly. */\n  shutdown(): Promise<void>\n}\n\nexport interface OtelSpan {\n  traceId: string\n  spanId: string\n  parentSpanId?: string\n  name: string\n  kind?: number\n  startTimeUnixNano: string\n  endTimeUnixNano: string\n  attributes?: OtelAttribute[]\n  status?: { code: number; message?: string }\n}\n\nexport interface OtelAttribute {\n  key: string\n  value: { stringValue?: string; intValue?: string; doubleValue?: number; boolValue?: boolean }\n}\n\ninterface OtlpResourceSpans {\n  resource: { attributes: OtelAttribute[] }\n  scopeSpans: Array<{ scope: { name: string; version: string }; spans: OtelSpan[] }>\n}\n\ninterface OtlpExport {\n  resourceSpans: OtlpResourceSpans[]\n}\n\nconst SCOPE = { name: '@tangle-network/agent-runtime', version: '0.33.0' }\n\n/**\n * Current (non-deprecated) OpenTelemetry GenAI semantic-convention keys.\n * Registry: https://opentelemetry.io/docs/specs/semconv/registry/attributes/gen-ai/\n * NB: `gen_ai.system` / `gen_ai.usage.prompt_tokens` / `completion_tokens` are\n * DEPRECATED — do not emit them. We use `provider.name` + `input/output_tokens`.\n */\nconst GEN_AI = {\n  operation: 'gen_ai.operation.name',\n  agentName: 'gen_ai.agent.name',\n  conversationId: 'gen_ai.conversation.id',\n  inputTokens: 'gen_ai.usage.input_tokens',\n  outputTokens: 'gen_ai.usage.output_tokens',\n} as const\n\n/**\n * Create an OTEL exporter. Returns undefined when no endpoint is configured.\n */\nexport function createOtelExporter(config?: OtelExportConfig): OtelExporter | undefined {\n  const resolvedEndpoint =\n    config?.endpoint ??\n    (typeof process !== 'undefined' ? process.env.OTEL_EXPORTER_OTLP_ENDPOINT : undefined)\n  if (!resolvedEndpoint) return undefined\n  const endpoint: string = resolvedEndpoint\n\n  const headers = config?.headers ?? parseHeadersFromEnv()\n  const batchSize = config?.batchSize ?? 64\n  const flushIntervalMs = config?.flushIntervalMs ?? 5000\n  const serviceName = config?.serviceName ?? 'agent-runtime'\n  const resourceAttrs = config?.resourceAttributes ?? {}\n\n  const pending: OtelSpan[] = []\n  let timer: ReturnType<typeof setInterval> | undefined\n  let stopped = false\n\n  const exporter: OtelExporter = {\n    exportSpan(span: OtelSpan): void {\n      if (stopped) return\n      pending.push(span)\n      if (pending.length >= batchSize) {\n        void doFlush()\n      }\n    },\n\n    async flush(): Promise<void> {\n      await doFlush()\n    },\n\n    async shutdown(): Promise<void> {\n      stopped = true\n      if (timer !== undefined) {\n        clearInterval(timer)\n        timer = undefined\n      }\n      await doFlush()\n    },\n  }\n\n  timer = setInterval(() => {\n    if (pending.length > 0) void doFlush()\n  }, flushIntervalMs)\n  if (typeof timer === 'object' && 'unref' in timer) {\n    ;(timer as NodeJS.Timeout).unref()\n  }\n\n  async function doFlush(): Promise<void> {\n    if (pending.length === 0) return\n    const batch = pending.splice(0)\n    const body: OtlpExport = {\n      resourceSpans: [\n        {\n          resource: {\n            attributes: toAttributes({\n              'service.name': serviceName,\n              ...resourceAttrs,\n            }),\n          },\n          scopeSpans: [{ scope: SCOPE, spans: batch }],\n        },\n      ],\n    }\n    const url = `${endpoint.replace(/\\/+$/, '')}/v1/traces`\n    try {\n      await fetch(url, {\n        method: 'POST',\n        headers: { 'content-type': 'application/json', ...headers },\n        body: JSON.stringify(body),\n      })\n    } catch {\n      // Best-effort — telemetry export must not crash the runtime.\n    }\n  }\n\n  return exporter\n}\n\n/**\n * Convert a LoopTraceEvent into an OtelSpan for export.\n */\nexport function loopEventToOtelSpan(\n  event: {\n    kind: string\n    runId: string\n    timestamp: number\n    payload: object\n  },\n  traceId: string,\n  parentSpanId?: string,\n): OtelSpan {\n  const spanId = generateSpanId()\n  const attrs: Record<string, string | number | boolean> = {\n    'loop.event_kind': event.kind,\n    'loop.run_id': event.runId,\n  }\n  for (const [k, v] of Object.entries(event.payload)) {\n    if (typeof v === 'string' || typeof v === 'number' || typeof v === 'boolean') {\n      attrs[`loop.${k}`] = v\n    }\n  }\n  const ts = msToNs(event.timestamp)\n  return {\n    traceId: padTraceId(traceId),\n    spanId,\n    parentSpanId: parentSpanId ? padSpanId(parentSpanId) : undefined,\n    name: event.kind,\n    kind: 1,\n    startTimeUnixNano: ts,\n    endTimeUnixNano: ts,\n    attributes: toAttributes(attrs),\n    status: { code: 1 },\n  }\n}\n\n/**\n * Build a nested, real-duration OTLP span tree for ONE loop run from its full\n * ordered `LoopTraceEvent` stream. Unlike `loopEventToOtelSpan` (one flat,\n * zero-duration span per event), this reconstructs the topology hierarchy a\n * GenAI trace viewer renders natively:\n *\n *   loop (invoke_workflow)\n *     └─ loop.round[k] (invoke_workflow)   ← tangle.loop.move.{kind,width,rationale}\n *          ├─ loop.iteration[i] (invoke_agent)  ← gen_ai.agent.name + usage + verdict + placement\n *          └─ …\n *\n * Attributes follow the current GenAI semconv (`gen_ai.*`) where they apply and\n * a namespaced `tangle.loop.*` / `tangle.cost.usd` extension for topology /\n * verdict / placement / cost (not yet standardized). Pure: feed it a buffered\n * per-runId event array (e.g. flushed on `loop.ended`) and export the result.\n */\nexport function buildLoopOtelSpans(\n  events: ReadonlyArray<{ kind: string; runId: string; timestamp: number; payload: object }>,\n  traceId: string,\n  rootParentSpanId?: string,\n): OtelSpan[] {\n  if (events.length === 0) return []\n  const tid = padTraceId(traceId)\n  const out: OtelSpan[] = []\n  const num = (v: unknown): number | undefined =>\n    typeof v === 'number' && Number.isFinite(v) ? v : undefined\n  const str = (v: unknown): string | undefined =>\n    typeof v === 'string' && v.length > 0 ? v : undefined\n  const rec = (v: unknown): Record<string, unknown> =>\n    v && typeof v === 'object' ? (v as Record<string, unknown>) : {}\n\n  const started = events.find((e) => e.kind === 'loop.started')\n  const ended = events.find((e) => e.kind === 'loop.ended')\n  const runId = events[0]?.runId ?? ''\n  const rootStart = started?.timestamp ?? events[0]!.timestamp\n  const rootEnd = ended?.timestamp ?? events[events.length - 1]!.timestamp\n  const rootId = generateSpanId()\n\n  const make = (\n    spanId: string,\n    parentSpanId: string | undefined,\n    name: string,\n    startMs: number,\n    endMs: number,\n    attrs: Record<string, string | number | boolean>,\n    statusCode = 1,\n  ): OtelSpan => ({\n    traceId: tid,\n    spanId,\n    parentSpanId: parentSpanId ? padSpanId(parentSpanId) : undefined,\n    name,\n    kind: 1,\n    startTimeUnixNano: msToNs(startMs),\n    endTimeUnixNano: msToNs(endMs),\n    attributes: toAttributes(attrs),\n    status: { code: statusCode },\n  })\n\n  // root\n  const sp = rec(started?.payload)\n  const rootAttrs: Record<string, string | number | boolean> = {\n    [GEN_AI.operation]: 'invoke_workflow',\n    [GEN_AI.conversationId]: runId,\n    'tangle.loop.driver': str(sp.driver) ?? 'driver',\n  }\n  if (Array.isArray(sp.agentRunNames) && sp.agentRunNames.length > 0) {\n    rootAttrs['tangle.loop.agents'] = sp.agentRunNames.map(String).join(',')\n  }\n  if (ended) {\n    const ep = rec(ended.payload)\n    const win = num(ep.winnerIterationIndex)\n    if (win !== undefined) rootAttrs['tangle.loop.winner.iteration_index'] = win\n    const cost = num(ep.totalCostUsd)\n    if (cost !== undefined) rootAttrs['tangle.cost.usd'] = cost\n    const dur = num(ep.durationMs)\n    if (dur !== undefined) rootAttrs['tangle.loop.duration_ms'] = dur\n    const iters = num(ep.iterations)\n    if (iters !== undefined) rootAttrs['tangle.loop.iterations'] = iters\n  }\n  out.push(make(rootId, rootParentSpanId, 'loop', rootStart, rootEnd, rootAttrs))\n\n  // rounds + iterations\n  const iterStartTs = new Map<number, number>()\n  const placementByIdx = new Map<number, Record<string, string>>()\n  let currentRoundId: string | undefined\n  let pendingRound:\n    | { id: string; start: number; attrs: Record<string, string | number | boolean> }\n    | undefined\n  const flushRound = (endMs: number) => {\n    if (!pendingRound) return\n    out.push(\n      make(pendingRound.id, rootId, 'loop.round', pendingRound.start, endMs, pendingRound.attrs),\n    )\n    pendingRound = undefined\n  }\n\n  for (const e of events) {\n    const p = rec(e.payload)\n    switch (e.kind) {\n      case 'loop.plan': {\n        flushRound(e.timestamp)\n        const id = generateSpanId()\n        const roundIdx = num(p.roundIndex) ?? 0\n        const attrs: Record<string, string | number | boolean> = {\n          [GEN_AI.operation]: 'invoke_workflow',\n          'tangle.loop.round.index': roundIdx,\n          'tangle.loop.move.kind': str(p.moveKind) ?? 'unknown',\n          'tangle.loop.move.round': roundIdx,\n          'tangle.loop.move.width': num(p.plannedCount) ?? 0,\n        }\n        const r = str(p.rationale)\n        if (r) attrs['tangle.loop.move.rationale'] = r\n        const parent = num(p.parentIndex)\n        if (parent !== undefined) attrs['tangle.loop.move.parent_index'] = parent\n        if (Array.isArray(p.childIndices) && p.childIndices.length > 0) {\n          attrs['tangle.loop.move.child_indices'] = p.childIndices.map(String).join(',')\n        }\n        pendingRound = { id, start: e.timestamp, attrs }\n        currentRoundId = id\n        break\n      }\n      case 'loop.iteration.started': {\n        const idx = num(p.iterationIndex)\n        if (idx !== undefined) iterStartTs.set(idx, e.timestamp)\n        break\n      }\n      case 'loop.iteration.dispatch': {\n        const idx = num(p.iterationIndex)\n        if (idx === undefined) break\n        const place: Record<string, string> = {}\n        const kind = str(p.placement)\n        if (kind) place['tangle.loop.placement.kind'] = kind\n        const sid = str(p.sandboxId)\n        if (sid) place['tangle.sandbox.id'] = sid\n        const fid = str(p.fleetId)\n        if (fid) place['tangle.fleet.id'] = fid\n        const mid = str(p.machineId)\n        if (mid) place['tangle.machine.id'] = mid\n        placementByIdx.set(idx, place)\n        break\n      }\n      case 'loop.iteration.ended': {\n        const idx = num(p.iterationIndex) ?? 0\n        const start = iterStartTs.get(idx) ?? e.timestamp\n        const err = str(p.error)\n        const attrs: Record<string, string | number | boolean> = {\n          [GEN_AI.operation]: 'invoke_agent',\n          'tangle.loop.iteration.index': idx,\n        }\n        const agent = str(p.agentRunName)\n        if (agent) attrs[GEN_AI.agentName] = agent\n        const tu = rec(p.tokenUsage)\n        const inTok = num(tu.input)\n        if (inTok !== undefined) attrs[GEN_AI.inputTokens] = inTok\n        const outTok = num(tu.output)\n        if (outTok !== undefined) attrs[GEN_AI.outputTokens] = outTok\n        const cost = num(p.costUsd)\n        if (cost !== undefined) attrs['tangle.cost.usd'] = cost\n        const verdict = rec(p.verdict)\n        if (typeof verdict.valid === 'boolean') attrs['tangle.loop.verdict.valid'] = verdict.valid\n        const score = num(verdict.score)\n        if (score !== undefined) attrs['tangle.loop.verdict.score'] = score\n        if (err) attrs['tangle.loop.error'] = err\n        const gid = num(p.groupId)\n        if (gid !== undefined) attrs['tangle.loop.iteration.group_id'] = gid\n        const par = num(p.parentIndex)\n        if (par !== undefined) attrs['tangle.loop.iteration.parent_index'] = par\n        const dur = num(p.durationMs)\n        if (dur !== undefined) attrs['tangle.loop.iteration.duration_ms'] = dur\n        const preview = str(p.outputPreview)\n        if (preview) attrs['tangle.loop.iteration.output_preview'] = preview\n        Object.assign(attrs, placementByIdx.get(idx) ?? {})\n        out.push(\n          make(\n            generateSpanId(),\n            currentRoundId ?? rootId,\n            'loop.iteration',\n            start,\n            e.timestamp,\n            attrs,\n            err ? 2 : 1,\n          ),\n        )\n        break\n      }\n      case 'loop.decision': {\n        if (pendingRound) {\n          const dec = str(p.decision)\n          if (dec) pendingRound.attrs['tangle.loop.decision'] = dec\n          flushRound(e.timestamp)\n        }\n        currentRoundId = undefined\n        break\n      }\n    }\n  }\n  flushRound(rootEnd)\n  return out\n}\n\nfunction parseHeadersFromEnv(): Record<string, string> {\n  if (typeof process === 'undefined') return {}\n  const raw = process.env.OTEL_EXPORTER_OTLP_HEADERS\n  if (!raw) return {}\n  const out: Record<string, string> = {}\n  for (const pair of raw.split(',')) {\n    const eq = pair.indexOf('=')\n    if (eq < 0) continue\n    const key = pair.slice(0, eq).trim()\n    const value = pair.slice(eq + 1).trim()\n    if (key) out[key] = value\n  }\n  return out\n}\n\nfunction toAttributes(record: Record<string, string | number | boolean>): OtelAttribute[] {\n  return Object.entries(record).map(([key, value]) => ({\n    key,\n    value:\n      typeof value === 'number'\n        ? Number.isInteger(value)\n          ? { intValue: value.toString() }\n          : { doubleValue: value }\n        : typeof value === 'boolean'\n          ? { boolValue: value }\n          : { stringValue: value },\n  }))\n}\n\nfunction msToNs(ms: number): string {\n  return (BigInt(Math.floor(ms)) * 1_000_000n).toString()\n}\n\nfunction padSpanId(id: string): string {\n  const cleaned = id.replace(/-/g, '')\n  return cleaned.slice(0, 16).padEnd(16, '0')\n}\n\nfunction padTraceId(id: string): string {\n  const cleaned = id.replace(/-/g, '')\n  return cleaned.slice(0, 32).padEnd(32, '0')\n}\n\nfunction generateSpanId(): string {\n  const bytes = new Uint8Array(8)\n  if (typeof globalThis.crypto?.getRandomValues === 'function') {\n    globalThis.crypto.getRandomValues(bytes)\n  } else {\n    for (let i = 0; i < 8; i++) bytes[i] = Math.floor(Math.random() * 256)\n  }\n  return Array.from(bytes)\n    .map((b) => b.toString(16).padStart(2, '0'))\n    .join('')\n}\n\n// ─── Eval-run ingest (self-improvement provenance) ───────────────────────────\n//\n// Tangle Intelligence has a first-class, non-trace record for self-improvement\n// runs: POST /v1/ingest/eval-runs (\"Mode D\"). Each generation carries a\n// `surfaceHash` (the proposed-change identity) + arbitrary `surface` provenance;\n// a later `gate-decided` event re-emits the same `runId` (idempotent upsert) with\n// a real `gateDecision` + `holdoutLift`, so proposal→verdict is one diffable\n// record. This is how a consumer's RSI loop records WHAT it changed, WHY, from\n// which evidence — the audit trail behind agentic self-improvement.\n\n/** Wire version the eval-runs ingest enforces (X-Tangle-Wire-Version + body). */\nexport const INTELLIGENCE_WIRE_VERSION = '2026-05-26.v1'\n\nexport interface EvalRunGeneration {\n  /** 0-based ordinal of this generation within the run (required by ingest). */\n  index: number\n  /** Identity of the proposed surface change (content-addressed hash). */\n  surfaceHash: string\n  /** Arbitrary provenance for this generation (rationale, evidence, source). */\n  surface?: unknown\n  /** Per-scenario results; empty until the generation is measured. */\n  cells?: unknown[]\n  /** Mean composite score (0 when unmeasured — pair with labels.measured). */\n  compositeMean: number\n  costUsd: number\n  durationMs: number\n}\n\nexport interface EvalRunEvent {\n  runId: string\n  runDir: string\n  /** ISO timestamp. */\n  timestamp: string\n  status:\n    | 'started'\n    | 'baseline-complete'\n    | 'generation-complete'\n    | 'gate-decided'\n    | 'finished'\n    | 'errored'\n  labels?: Record<string, string>\n  baseline?: EvalRunGeneration\n  generations?: EvalRunGeneration[]\n  gateDecision?: 'ship' | 'hold' | 'need_more_work' | 'model_ceiling' | 'arch_ceiling'\n  holdoutLift?: number\n  totalCostUsd: number\n  totalDurationMs: number\n  errorMessage?: string\n}\n\nexport interface EvalRunsExportConfig {\n  /** Bearer key — tenant is resolved server-side from it. Reads TANGLE_API_KEY. */\n  apiKey?: string\n  /** Intelligence base. Reads INTELLIGENCE_BASE env, else prod. */\n  base?: string\n  /** Idempotency-Key header (e.g. the runId) — safe retries + upsert. */\n  idempotencyKey?: string\n}\n\nexport interface EvalRunsExportResult {\n  ok: boolean\n  status: number\n  accepted: number\n  rejected: Array<{ index: number; reason: string }>\n}\n\nconst DEFAULT_INTELLIGENCE_BASE = 'https://intelligence.tangle.tools'\n\n/**\n * Ship self-improvement eval-run events to Tangle Intelligence. Unlike the\n * best-effort span exporter, this RESOLVES with the ingest verdict (accepted /\n * rejected per event) so a consumer's loop can assert its provenance landed.\n * Throws only on a missing key or network failure.\n */\nexport async function exportEvalRuns(\n  events: EvalRunEvent[],\n  config?: EvalRunsExportConfig,\n): Promise<EvalRunsExportResult> {\n  if (events.length === 0) return { ok: true, status: 0, accepted: 0, rejected: [] }\n  const apiKey =\n    config?.apiKey ?? (typeof process !== 'undefined' ? process.env.TANGLE_API_KEY : undefined)\n  if (!apiKey)\n    throw new Error('exportEvalRuns: apiKey required (pass config.apiKey or set TANGLE_API_KEY)')\n  const base =\n    config?.base ??\n    (typeof process !== 'undefined' ? process.env.INTELLIGENCE_BASE : undefined) ??\n    DEFAULT_INTELLIGENCE_BASE\n  const url = `${base.replace(/\\/+$/, '')}/v1/ingest/eval-runs`\n  const res = await fetch(url, {\n    method: 'POST',\n    headers: {\n      'content-type': 'application/json',\n      authorization: `Bearer ${apiKey}`,\n      'X-Tangle-Wire-Version': INTELLIGENCE_WIRE_VERSION,\n      ...(config?.idempotencyKey ? { 'Idempotency-Key': config.idempotencyKey } : {}),\n    },\n    body: JSON.stringify({ wireVersion: INTELLIGENCE_WIRE_VERSION, events }),\n  })\n  let parsed: { accepted?: number; rejected?: Array<{ index: number; reason: string }> } = {}\n  try {\n    parsed = (await res.json()) as typeof parsed\n  } catch {\n    // non-JSON body (e.g. 5xx HTML) — leave parsed empty\n  }\n  return {\n    ok: res.ok,\n    status: res.status,\n    accepted: parsed.accepted ?? (res.ok ? events.length : 0),\n    rejected: parsed.rejected ?? [],\n  }\n}\n"],"mappings":";;;;;AA4FO,IAAM,sBAAN,MAA0B;AAAA,EACd,UAAU,oBAAI,IAA8B;AAAA,EAC5C,cAAc,oBAAI,IAA6B;AAAA,EAC/C,mBAAmB,oBAAI,IAAoB;AAAA,EAC3C;AAAA,EACA;AAAA,EAEjB,YAAY,UAAsC,CAAC,GAAG;AACpD,SAAK,aAAa,QAAQ,cAAc;AACxC,SAAK,MAAM,QAAQ,QAAQ,OAAM,oBAAI,KAAK,GAAE,YAAY;AAAA,EAC1D;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAqC,OAAwC;AAC3E,QAAI,MAAM,gBAAgB;AACxB,YAAM,WAAW,KAAK,iBAAiB,IAAI,MAAM,cAAc;AAC/D,UAAI,YAAY,KAAK,QAAQ,IAAI,QAAQ,GAAG;AAC1C,eAAO,EAAE,QAAQ,UAAU,QAAQ,KAAK;AAAA,MAC1C;AAAA,IACF;AACA,UAAM,SAAS,KAAK,WAAW;AAC/B,UAAM,aAAa,IAAI,gBAAgB;AACvC,UAAM,SAA2B;AAAA,MAC/B;AAAA,MACA,SAAS,MAAM;AAAA,MACf,WAAW,MAAM;AAAA,MACjB,MAAM,MAAM;AAAA,MACZ,QAAQ;AAAA,MACR,WAAW,KAAK,IAAI;AAAA,MACpB,UAAU,CAAC;AAAA,MACX,gBAAgB,MAAM;AAAA,IACxB;AACA,SAAK,QAAQ,IAAI,QAAQ,MAAM;AAC/B,SAAK,YAAY,IAAI,QAAQ,UAAU;AACvC,QAAI,MAAM,eAAgB,MAAK,iBAAiB,IAAI,MAAM,gBAAgB,MAAM;AAKhF,mBAAe,MAAM;AACnB,WAAK,QAAQ,QAAQ,OAAO,UAAU;AAAA,IACxC,CAAC;AAED,WAAO,EAAE,QAAQ,QAAQ,MAAM;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAO,QAAoD;AACzD,UAAM,SAAS,KAAK,QAAQ,IAAI,MAAM;AACtC,QAAI,CAAC,OAAQ,QAAO;AACpB,WAAO,eAAe,MAAM;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAO,QAAyB;AAC9B,UAAM,SAAS,KAAK,QAAQ,IAAI,MAAM;AACtC,QAAI,CAAC,OAAQ,QAAO;AACpB,QAAI,WAAW,OAAO,MAAM,EAAG,QAAO;AACtC,UAAM,aAAa,KAAK,YAAY,IAAI,MAAM;AAC9C,gBAAY,MAAM;AAClB,WAAO,SAAS;AAChB,WAAO,cAAc,KAAK,IAAI;AAC9B,WAAO,QAAQ,EAAE,SAAS,uBAAuB,MAAM,iBAAiB;AACxE,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,eAAe,QAAgB,UAA+C;AAC5E,UAAM,SAAS,KAAK,QAAQ,IAAI,MAAM;AACtC,QAAI,CAAC,OAAQ,QAAO;AACpB,WAAO,SAAS,KAAK,QAAQ;AAC7B,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQ,OAA8B,CAAC,GAA6B;AAClE,UAAM,QAAQ,WAAW,KAAK,KAAK;AACnC,UAAM,QAAQ,KAAK,QAAQ,KAAK,MAAM,KAAK,KAAK,IAAI,OAAO;AAC3D,UAAM,MAAgC,CAAC;AACvC,eAAW,UAAU,KAAK,QAAQ,OAAO,GAAG;AAC1C,UAAI,KAAK,aAAa,OAAO,cAAc,KAAK,UAAW;AAC3D,UAAI,KAAK,WAAW,OAAO,YAAY,KAAK,QAAS;AACrD,UAAI,OAAO,SAAS,KAAK,KAAK,KAAK,MAAM,OAAO,SAAS,IAAI,MAAO;AACpE,UAAI,KAAK,eAAe,MAAM,CAAC;AAAA,IACjC;AACA,QAAI,KAAK,CAAC,GAAG,MAAM,EAAE,UAAU,cAAc,EAAE,SAAS,CAAC;AACzD,WAAO,IAAI,MAAM,GAAG,KAAK;AAAA,EAC3B;AAAA;AAAA,EAGA,gBAAwB;AACtB,QAAI,IAAI;AACR,eAAW,UAAU,KAAK,QAAQ,OAAO,GAAG;AAC1C,UAAI,CAAC,WAAW,OAAO,MAAM,EAAG,MAAK;AAAA,IACvC;AACA,WAAO;AAAA,EACT;AAAA,EAEA,MAAc,QACZ,QACA,OACA,YACe;AACf,UAAM,SAAS,KAAK,QAAQ,IAAI,MAAM;AACtC,QAAI,CAAC,OAAQ;AACb,WAAO,SAAS;AAChB,QAAI;AACF,YAAM,SAAS,MAAM,MAAM,IAAI;AAAA,QAC7B,QAAQ,WAAW;AAAA,QACnB,QAAQ,CAAC,aAAa;AACpB,cAAI,OAAO,WAAW,UAAW,QAAO,WAAW;AAAA,QACrD;AAAA,MACF,CAAC;AAKD,UAAI,cAAc,MAAM,MAAM,YAAa;AAC3C,aAAO,SAAS;AAChB,aAAO,cAAc,KAAK,IAAI;AAC9B,aAAO,SAAS,EAAE,SAAS,MAAM,SAAS,OAAO;AAAA,IACnD,SAAS,KAAK;AACZ,UAAI,cAAc,MAAM,MAAM,YAAa;AAC3C,aAAO,SAAS;AAChB,aAAO,cAAc,KAAK,IAAI;AAC9B,aAAO,QAAQ,aAAa,GAAG;AAAA,IACjC,UAAE;AACA,WAAK,YAAY,OAAO,MAAM;AAAA,IAChC;AAAA,EACF;AACF;AAEA,SAAS,WAAW,QAAmC;AACrD,SAAO,WAAW,eAAe,WAAW,YAAY,WAAW;AACrE;AAEA,SAAS,cAAc,QAA4C;AACjE,SAAO,OAAO;AAChB;AAEA,SAAS,WAAW,KAAiC;AACnD,MAAI,CAAC,OAAO,SAAS,GAAG,EAAG,QAAO;AAClC,QAAM,IAAI,KAAK,MAAM,GAAa;AAClC,MAAI,KAAK,EAAG,QAAO;AACnB,SAAO,KAAK,IAAI,GAAG,GAAG;AACxB;AAEA,SAAS,eAAe,QAAkD;AACxE,QAAM,MAA8B;AAAA,IAClC,QAAQ,OAAO;AAAA,IACf,SAAS,OAAO;AAAA,IAChB,QAAQ,OAAO;AAAA,IACf,WAAW,OAAO;AAAA,EACpB;AACA,MAAI,OAAO,SAAU,KAAI,WAAW,OAAO;AAC3C,MAAI,OAAO,OAAQ,KAAI,SAAS,OAAO;AACvC,MAAI,OAAO,MAAO,KAAI,QAAQ,OAAO;AACrC,MAAI,OAAO,YAAY,OAAW,KAAI,UAAU,OAAO;AACvD,MAAI,OAAO,YAAa,KAAI,cAAc,OAAO;AACjD,SAAO;AACT;AAEA,SAAS,eAAe,QAAkD;AACxE,QAAM,QAAgC;AAAA,IACpC,QAAQ,OAAO;AAAA,IACf,SAAS,OAAO;AAAA,IAChB,MAAM,OAAO;AAAA,IACb,QAAQ,OAAO;AAAA,IACf,WAAW,OAAO;AAAA,EACpB;AACA,MAAI,OAAO,UAAW,OAAM,YAAY,OAAO;AAC/C,MAAI,OAAO,YAAa,OAAM,cAAc,OAAO;AACnD,MAAI,OAAO,YAAY,OAAW,OAAM,UAAU,OAAO;AACzD,MAAI,OAAO,SAAS,SAAS,EAAG,OAAM,WAAW,CAAC,GAAG,OAAO,QAAQ;AACpE,SAAO;AACT;AAEA,SAAS,aAAa,KAA+B;AACnD,MAAI,eAAe,OAAO;AACxB,WAAO,EAAE,SAAS,IAAI,SAAS,MAAM,IAAI,QAAQ,QAAQ;AAAA,EAC3D;AACA,SAAO,EAAE,SAAS,OAAO,GAAG,GAAG,MAAM,WAAW;AAClD;AAEA,SAAS,eAAuB;AAI9B,QAAM,IAAI,KAAK,IAAI,EAAE,SAAS,EAAE;AAChC,QAAM,IAAI,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,MAAM,GAAG,EAAE;AAChD,SAAO,OAAO,CAAC,IAAI,CAAC;AACtB;AAQO,SAAS,qBAAqB,OAAwB;AAC3D,MAAI;AACJ,MAAI;AACF,UAAM,KAAK,UAAU,aAAa,KAAK,CAAC;AAAA,EAC1C,QAAQ;AACN,UAAM,OAAO,KAAK;AAAA,EACpB;AAEA,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,GAAG;AACtC,SAAK,IAAI,WAAW,CAAC;AACrB,QAAI,KAAK,KAAK,GAAG,QAAU;AAAA,EAC7B;AACA,UAAQ,MAAM,GAAG,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAC/C;AAEA,SAAS,aAAa,OAAyB;AAC7C,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO;AACxD,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,IAAI,YAAY;AACvD,QAAM,UAAU,OAAO,QAAQ,KAAgC,EAC5D,OAAO,CAAC,CAAC,EAAE,CAAC,MAAM,MAAM,MAAS,EACjC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;AACxC,QAAM,MAA+B,CAAC;AACtC,aAAW,CAAC,GAAG,CAAC,KAAK,QAAS,KAAI,CAAC,IAAI,aAAa,CAAC;AACrD,SAAO;AACT;;;AC/TO,IAAM,0BAA0B;AAGhC,IAAM,4BAA4B;AAAA,EACvC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,EAAE,KAAK,IAAI;AAGJ,IAAM,6BAA6B;AAAA,EACxC,MAAM;AAAA,EACN,YAAY;AAAA,IACV,MAAM;AAAA,MACJ,MAAM;AAAA,MACN,aAAa;AAAA,IACf;AAAA,IACA,UAAU;AAAA,MACR,MAAM;AAAA,MACN,aAAa;AAAA,IACf;AAAA,IACA,aAAa;AAAA,MACX,MAAM;AAAA,MACN,aAAa;AAAA,IACf;AAAA,IACA,UAAU;AAAA,MACR,MAAM;AAAA,MACN,SAAS;AAAA,MACT,SAAS;AAAA,MACT,aAAa;AAAA,IACf;AAAA,IACA,QAAQ;AAAA,MACN,MAAM;AAAA,MACN,YAAY;AAAA,QACV,SAAS,EAAE,MAAM,SAAS;AAAA,QAC1B,cAAc,EAAE,MAAM,SAAS;AAAA,QAC/B,gBAAgB,EAAE,MAAM,SAAS,OAAO,EAAE,MAAM,SAAS,EAAE;AAAA,QAC3D,cAAc,EAAE,MAAM,WAAW,SAAS,EAAE;AAAA,MAC9C;AAAA,MACA,sBAAsB;AAAA,IACxB;AAAA,IACA,WAAW;AAAA,MACT,MAAM;AAAA,MACN,aAAa;AAAA,IACf;AAAA,EACF;AAAA,EACA,UAAU,CAAC,QAAQ,UAAU;AAAA,EAC7B,sBAAsB;AACxB;AAEA,IAAM,6BAA6B,IAAI,KAAK;AAC5C,IAAM,iCAAiC,IAAI,KAAK;AAGzC,SAAS,yBAAyB,KAAgC;AACvE,MAAI,QAAQ,QAAQ,OAAO,QAAQ,UAAU;AAC3C,UAAM,IAAI,UAAU,4CAA4C;AAAA,EAClE;AACA,QAAM,QAAQ;AACd,QAAM,OAAO,MAAM;AACnB,MAAI,OAAO,SAAS,YAAY,KAAK,KAAK,EAAE,WAAW,GAAG;AACxD,UAAM,IAAI,UAAU,kDAAkD;AAAA,EACxE;AACA,QAAM,WAAW,MAAM;AACvB,MAAI,OAAO,aAAa,YAAY,SAAS,KAAK,EAAE,WAAW,GAAG;AAChE,UAAM,IAAI,UAAU,sDAAsD;AAAA,EAC5E;AACA,QAAM,OAAyB,EAAE,MAAM,KAAK,KAAK,GAAG,UAAU,SAAS,KAAK,EAAE;AAC9E,MAAI,OAAO,MAAM,gBAAgB,SAAU,MAAK,cAAc,MAAM;AACpE,MAAI,MAAM,aAAa,QAAW;AAChC,UAAM,WAAW,OAAO,MAAM,QAAQ;AACtC,QAAI,CAAC,OAAO,SAAS,QAAQ,KAAK,WAAW,KAAK,WAAW,GAAG;AAC9D,YAAM,IAAI,WAAW,wDAAwD;AAAA,IAC/E;AACA,SAAK,WAAW,KAAK,MAAM,QAAQ;AAAA,EACrC;AACA,MAAI,MAAM,WAAW,QAAW;AAC9B,SAAK,SAAS,eAAe,MAAM,MAAM;AAAA,EAC3C;AACA,MAAI,OAAO,MAAM,cAAc,SAAU,MAAK,YAAY,MAAM;AAChE,SAAO;AACT;AAEA,SAAS,eAAe,KAA0C;AAChE,MAAI,QAAQ,QAAQ,OAAO,QAAQ,UAAU;AAC3C,UAAM,IAAI,UAAU,2CAA2C;AAAA,EACjE;AACA,QAAM,QAAQ;AACd,QAAM,MAA+C,CAAC;AACtD,MAAI,MAAM,YAAY,QAAW;AAC/B,QAAI,OAAO,MAAM,YAAY,UAAU;AACrC,YAAM,IAAI,UAAU,kDAAkD;AAAA,IACxE;AACA,QAAI,UAAU,MAAM;AAAA,EACtB;AACA,MAAI,MAAM,iBAAiB,QAAW;AACpC,QAAI,OAAO,MAAM,iBAAiB,UAAU;AAC1C,YAAM,IAAI,UAAU,uDAAuD;AAAA,IAC7E;AACA,QAAI,eAAe,MAAM;AAAA,EAC3B;AACA,MAAI,MAAM,mBAAmB,QAAW;AACtC,QAAI,CAAC,MAAM,QAAQ,MAAM,cAAc,GAAG;AACxC,YAAM,IAAI,UAAU,+DAA+D;AAAA,IACrF;AACA,QAAI,iBAAiB,MAAM,eAAe,IAAI,CAAC,OAAO,MAAM;AAC1D,UAAI,OAAO,UAAU,UAAU;AAC7B,cAAM,IAAI,UAAU,iCAAiC,CAAC,oBAAoB;AAAA,MAC5E;AACA,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AACA,MAAI,MAAM,iBAAiB,QAAW;AACpC,UAAM,IAAI,OAAO,MAAM,YAAY;AACnC,QAAI,CAAC,OAAO,SAAS,CAAC,KAAK,IAAI,GAAG;AAChC,YAAM,IAAI,WAAW,iEAAiE;AAAA,IACxF;AACA,QAAI,eAAe,KAAK,MAAM,CAAC;AAAA,EACjC;AACA,SAAO;AACT;AAWO,SAAS,0BACd,SAC+C;AAC/C,QAAM,qBAAqB,QAAQ,sBAAsB;AACzD,SAAO,OAAO,QAAQ;AACpB,UAAM,OAAO,yBAAyB,GAAG;AACzC,UAAM,iBAAiB,qBAAqB;AAAA,MAC1C,SAAS;AAAA,MACT,MAAM,KAAK;AAAA,MACX,UAAU,KAAK;AAAA,MACf,aAAa,KAAK;AAAA,MAClB,UAAU,KAAK,YAAY;AAAA,MAC3B,QAAQ,KAAK;AAAA,MACb,WAAW,KAAK;AAAA,IAClB,CAAC;AACD,UAAM,YAAY,QAAQ,MAAM,OAAyB;AAAA,MACvD,SAAS;AAAA,MACT;AAAA,MACA,WAAW,KAAK;AAAA,MAChB;AAAA,MACA,KAAK,OAAO,QAAQ,QAAQ,SAAS,MAAM,GAAG;AAAA,IAChD,CAAC;AACD,WAAO;AAAA,MACL,QAAQ,UAAU;AAAA,MAClB,qBAAqB,mBAAmB,IAAI;AAAA,IAC9C;AAAA,EACF;AACF;AAEA,SAAS,gBAAgB,MAAgC;AACvD,QAAM,WAAW,KAAK,IAAI,GAAG,KAAK,YAAY,CAAC;AAC/C,MAAI,aAAa,EAAG,QAAO;AAC3B,SAAO;AACT;;;AC9JO,IAAM,wBAAN,MAAqD;AAAA,EACzC,SAA0B,CAAC;AAAA,EAE5C,MAAM,IAAI,OAAqC;AAC7C,SAAK,OAAO,KAAK,EAAE,GAAG,MAAM,CAAC;AAAA,EAC/B;AAAA,EAEA,MAAM,KAAK,SAAuD,CAAC,GAA6B;AAC9F,QAAI,MAAM,KAAK;AACf,QAAI,OAAO,cAAc,QAAW;AAClC,YAAM,IAAI,OAAO,CAAC,UAAU,MAAM,cAAc,OAAO,SAAS;AAAA,IAClE;AACA,QAAI,OAAO,gBAAgB,QAAW;AACpC,YAAM,IAAI,OAAO,CAAC,UAAU,MAAM,SAAS,QAAQ,OAAO,WAAW;AAAA,IACvE;AACA,WAAO,IAAI,IAAI,CAAC,WAAW,EAAE,GAAG,MAAM,EAAE;AAAA,EAC1C;AACF;AAQO,SAAS,gBAAgB,OAAkD;AAChF,QAAM,OAAmC;AAAA,IACvC,IAAI,MAAM;AAAA,IACV,OAAO,MAAM,OAAO;AAAA,IACpB,IAAI,MAAM;AAAA,IACV,OAAO,MAAM,OAAO;AAAA,IACpB,YAAY,MAAM;AAAA,EACpB;AACA,MAAI,MAAM,OAAO,MAAO,MAAK,QAAQ,MAAM,OAAO;AAClD,SAAO;AACT;;;ACpDO,IAAM,8BAA8B;AAGpC,IAAM,gCAAgC;AAAA,EAC3C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,EAAE,KAAK,IAAI;AAGJ,IAAM,iCAAiC;AAAA,EAC5C,MAAM;AAAA,EACN,YAAY;AAAA,IACV,UAAU;AAAA,MACR,MAAM;AAAA,MACN,YAAY;AAAA,QACV,MAAM,EAAE,MAAM,UAAU,MAAM,CAAC,cAAc,YAAY,SAAS,EAAE;AAAA,QACpE,KAAK,EAAE,MAAM,SAAS;AAAA,MACxB;AAAA,MACA,UAAU,CAAC,QAAQ,KAAK;AAAA,MACxB,sBAAsB;AAAA,IACxB;AAAA,IACA,QAAQ;AAAA,MACN,MAAM;AAAA,MACN,YAAY;AAAA,QACV,OAAO,EAAE,MAAM,UAAU,SAAS,GAAG,SAAS,EAAE;AAAA,QAChD,OAAO,EAAE,MAAM,UAAU,MAAM,CAAC,QAAQ,OAAO,WAAW,OAAO,EAAE;AAAA,QACnE,OAAO,EAAE,MAAM,SAAS;AAAA,MAC1B;AAAA,MACA,UAAU,CAAC,SAAS,OAAO;AAAA,MAC3B,sBAAsB;AAAA,IACxB;AAAA,IACA,IAAI,EAAE,MAAM,UAAU,MAAM,CAAC,SAAS,QAAQ,kBAAkB,EAAE;AAAA,IAClE,YAAY,EAAE,MAAM,SAAS;AAAA,IAC7B,WAAW,EAAE,MAAM,SAAS;AAAA,EAC9B;AAAA,EACA,UAAU,CAAC,YAAY,UAAU,IAAI;AAAA,EACrC,sBAAsB;AACxB;AAGO,SAAS,6BAA6B,KAAoC;AAC/E,MAAI,QAAQ,QAAQ,OAAO,QAAQ,UAAU;AAC3C,UAAM,IAAI,UAAU,gDAAgD;AAAA,EACtE;AACA,QAAM,QAAQ;AACd,QAAM,WAAW,iBAAiB,MAAM,QAAQ;AAChD,QAAM,SAAS,eAAe,MAAM,MAAM;AAC1C,QAAM,KAAK,MAAM;AACjB,MAAI,OAAO,WAAW,OAAO,UAAU,OAAO,oBAAoB;AAChE,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACA,QAAM,OAA6B,EAAE,UAAU,QAAQ,GAAG;AAC1D,MAAI,MAAM,eAAe,QAAW;AAClC,QAAI,OAAO,MAAM,eAAe,YAAY,OAAO,MAAM,KAAK,MAAM,MAAM,UAAU,CAAC,GAAG;AACtF,YAAM,IAAI,UAAU,yDAAyD;AAAA,IAC/E;AACA,SAAK,aAAa,MAAM;AAAA,EAC1B;AACA,MAAI,OAAO,MAAM,cAAc,SAAU,MAAK,YAAY,MAAM;AAChE,SAAO;AACT;AAEA,SAAS,iBAAiB,KAAgC;AACxD,MAAI,QAAQ,QAAQ,OAAO,QAAQ,UAAU;AAC3C,UAAM,IAAI,UAAU,iDAAiD;AAAA,EACvE;AACA,QAAM,QAAQ;AACd,QAAM,OAAO,MAAM;AACnB,MAAI,SAAS,gBAAgB,SAAS,cAAc,SAAS,WAAW;AACtE,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACA,QAAM,MAAM,MAAM;AAClB,MAAI,OAAO,QAAQ,YAAY,IAAI,KAAK,EAAE,WAAW,GAAG;AACtD,UAAM,IAAI,UAAU,8DAA8D;AAAA,EACpF;AACA,SAAO,EAAE,MAAM,KAAK,IAAI,KAAK,EAAE;AACjC;AAEA,SAAS,eAAe,KAA8B;AACpD,MAAI,QAAQ,QAAQ,OAAO,QAAQ,UAAU;AAC3C,UAAM,IAAI,UAAU,+CAA+C;AAAA,EACrE;AACA,QAAM,QAAQ;AACd,QAAM,QAAQ,OAAO,MAAM,KAAK;AAChC,MAAI,CAAC,OAAO,SAAS,KAAK,KAAK,QAAQ,KAAK,QAAQ,GAAG;AACrD,UAAM,IAAI,WAAW,8DAA8D;AAAA,EACrF;AACA,QAAM,QAAQ,MAAM;AACpB,MAAI,OAAO,UAAU,UAAU;AAC7B,UAAM,IAAI,UAAU,oDAAoD;AAAA,EAC1E;AACA,QAAM,SAAyB,EAAE,OAAO,MAAM;AAC9C,QAAM,QAAQ,MAAM;AACpB,MAAI,UAAU,QAAW;AACvB,QAAI,UAAU,UAAU,UAAU,SAAS,UAAU,aAAa,UAAU,SAAS;AACnF,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AACA,WAAO,QAAQ;AAAA,EACjB;AACA,SAAO;AACT;AAWO,SAAS,8BACd,SACmD;AACnD,QAAM,aAAa,QAAQ,cAAc;AACzC,QAAM,MAAM,QAAQ,QAAQ,OAAM,oBAAI,KAAK,GAAE,YAAY;AACzD,SAAO,OAAO,QAAQ;AACpB,UAAM,OAAO,6BAA6B,GAAG;AAC7C,UAAM,KAAK,WAAW;AACtB,UAAM,QAAQ;AAAA,MACZ;AAAA,MACA,UAAU,KAAK;AAAA,MACf,QAAQ,KAAK;AAAA,MACb,IAAI,KAAK;AAAA,MACT,YAAY,KAAK,cAAc,IAAI;AAAA,MACnC,WAAW,KAAK;AAAA,IAClB;AACA,UAAM,QAAQ,MAAM,IAAI,KAAK;AAC7B,QAAI,KAAK,SAAS,SAAS,cAAc;AACvC,cAAQ,MAAM,eAAe,KAAK,SAAS,KAAK,gBAAgB,KAAK,CAAC;AAAA,IACxE;AACA,WAAO,EAAE,UAAU,MAAM,GAAG;AAAA,EAC9B;AACF;AAEA,SAAS,mBAA2B;AAClC,QAAM,IAAI,KAAK,IAAI,EAAE,SAAS,EAAE;AAChC,QAAM,IAAI,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,MAAM,GAAG,EAAE;AAChD,SAAO,OAAO,CAAC,IAAI,CAAC;AACtB;;;ACnKO,IAAM,8BAA8B;AAGpC,IAAM,gCAAgC;AAAA,EAC3C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,EAAE,KAAK,IAAI;AAEX,IAAM,gBAA2C,CAAC,OAAO,UAAU,WAAW,UAAU,MAAM;AAGvF,IAAM,iCAAiC;AAAA,EAC5C,MAAM;AAAA,EACN,YAAY;AAAA,IACV,UAAU;AAAA,MACR,MAAM;AAAA,MACN,aAAa;AAAA,IACf;AAAA,IACA,WAAW;AAAA,MACT,MAAM;AAAA,MACN,aAAa;AAAA,IACf;AAAA,IACA,OAAO,EAAE,MAAM,UAAU,aAAa,8CAA8C;AAAA,IACpF,SAAS;AAAA,MACP,MAAM;AAAA,MACN,OAAO,EAAE,MAAM,UAAU,MAAM,CAAC,GAAG,aAAa,EAAE;AAAA,IACpD;AAAA,IACA,UAAU,EAAE,MAAM,WAAW,SAAS,GAAG,SAAS,EAAE;AAAA,IACpD,QAAQ;AAAA,MACN,MAAM;AAAA,MACN,YAAY;AAAA,QACV,eAAe;AAAA,UACb,MAAM;AAAA,UACN,YAAY;AAAA,YACV,OAAO,EAAE,MAAM,UAAU,aAAa,eAAe;AAAA,YACrD,OAAO,EAAE,MAAM,UAAU,aAAa,eAAe;AAAA,UACvD;AAAA,UACA,sBAAsB;AAAA,QACxB;AAAA,QACA,UAAU,EAAE,MAAM,WAAW,SAAS,EAAE;AAAA,QACxC,eAAe,EAAE,MAAM,UAAU,SAAS,GAAG,SAAS,EAAE;AAAA,MAC1D;AAAA,MACA,sBAAsB;AAAA,IACxB;AAAA,EACF;AAAA,EACA,UAAU,CAAC,YAAY,WAAW;AAAA,EAClC,sBAAsB;AACxB;AAEA,IAAMA,8BAA6B,IAAI,KAAK;AAC5C,IAAMC,kCAAiC,IAAI,KAAK;AAGzC,SAAS,6BAA6B,KAAoC;AAC/E,MAAI,QAAQ,QAAQ,OAAO,QAAQ,UAAU;AAC3C,UAAM,IAAI,UAAU,gDAAgD;AAAA,EACtE;AACA,QAAM,QAAQ;AACd,QAAM,WAAW,MAAM;AACvB,MAAI,OAAO,aAAa,YAAY,SAAS,KAAK,EAAE,WAAW,GAAG;AAChE,UAAM,IAAI,UAAU,0DAA0D;AAAA,EAChF;AACA,QAAM,YAAY,MAAM;AACxB,MAAI,OAAO,cAAc,YAAY,UAAU,KAAK,EAAE,WAAW,GAAG;AAClE,UAAM,IAAI,UAAU,4CAA4C;AAAA,EAClE;AACA,QAAM,OAA6B,EAAE,UAAU,SAAS,KAAK,GAAG,WAAW,UAAU,KAAK,EAAE;AAC5F,MAAI,OAAO,MAAM,UAAU,SAAU,MAAK,QAAQ,MAAM;AACxD,MAAI,MAAM,YAAY,QAAW;AAC/B,QAAI,CAAC,MAAM,QAAQ,MAAM,OAAO,GAAG;AACjC,YAAM,IAAI,UAAU,qDAAqD;AAAA,IAC3E;AACA,UAAM,UAA4B,MAAM,QAAQ,IAAI,CAAC,KAAK,MAAM;AAC9D,UAAI,OAAO,QAAQ,YAAY,CAAC,cAAc,SAAS,GAAqB,GAAG;AAC7E,cAAM,IAAI;AAAA,UACR,8BAA8B,CAAC,oBAAoB,cAAc,KAAK,GAAG,CAAC;AAAA,QAC5E;AAAA,MACF;AACA,aAAO;AAAA,IACT,CAAC;AACD,SAAK,UAAU;AAAA,EACjB;AACA,MAAI,MAAM,aAAa,QAAW;AAChC,UAAM,WAAW,OAAO,MAAM,QAAQ;AACtC,QAAI,CAAC,OAAO,SAAS,QAAQ,KAAK,WAAW,KAAK,WAAW,GAAG;AAC9D,YAAM,IAAI,WAAW,4DAA4D;AAAA,IACnF;AACA,SAAK,WAAW,KAAK,MAAM,QAAQ;AAAA,EACrC;AACA,MAAI,MAAM,WAAW,QAAW;AAC9B,SAAK,SAASC,gBAAe,MAAM,MAAM;AAAA,EAC3C;AACA,SAAO;AACT;AAEA,SAASA,gBAAe,KAA8C;AACpE,MAAI,QAAQ,QAAQ,OAAO,QAAQ,UAAU;AAC3C,UAAM,IAAI,UAAU,+CAA+C;AAAA,EACrE;AACA,QAAM,QAAQ;AACd,QAAM,MAAmD,CAAC;AAC1D,MAAI,MAAM,kBAAkB,QAAW;AACrC,QAAI,MAAM,kBAAkB,QAAQ,OAAO,MAAM,kBAAkB,UAAU;AAC3E,YAAM,IAAI,UAAU,6DAA6D;AAAA,IACnF;AACA,UAAM,SAAS,MAAM;AACrB,UAAM,YAAuF,CAAC;AAC9F,QAAI,OAAO,UAAU,QAAW;AAC9B,UAAI,OAAO,OAAO,UAAU,YAAY,OAAO,MAAM,KAAK,MAAM,OAAO,KAAK,CAAC,GAAG;AAC9E,cAAM,IAAI,UAAU,kEAAkE;AAAA,MACxF;AACA,gBAAU,QAAQ,OAAO;AAAA,IAC3B;AACA,QAAI,OAAO,UAAU,QAAW;AAC9B,UAAI,OAAO,OAAO,UAAU,YAAY,OAAO,MAAM,KAAK,MAAM,OAAO,KAAK,CAAC,GAAG;AAC9E,cAAM,IAAI,UAAU,kEAAkE;AAAA,MACxF;AACA,gBAAU,QAAQ,OAAO;AAAA,IAC3B;AACA,QAAI,gBAAgB;AAAA,EACtB;AACA,MAAI,MAAM,aAAa,QAAW;AAChC,UAAM,IAAI,OAAO,MAAM,QAAQ;AAC/B,QAAI,CAAC,OAAO,SAAS,CAAC,KAAK,IAAI,GAAG;AAChC,YAAM,IAAI,WAAW,iEAAiE;AAAA,IACxF;AACA,QAAI,WAAW,KAAK,MAAM,CAAC;AAAA,EAC7B;AACA,MAAI,MAAM,kBAAkB,QAAW;AACrC,UAAM,IAAI,OAAO,MAAM,aAAa;AACpC,QAAI,CAAC,OAAO,SAAS,CAAC,KAAK,IAAI,KAAK,IAAI,GAAG;AACzC,YAAM,IAAI,WAAW,6DAA6D;AAAA,IACpF;AACA,QAAI,gBAAgB;AAAA,EACtB;AACA,SAAO;AACT;AAUO,SAAS,8BACd,SACmD;AACnD,QAAM,qBAAqB,QAAQ,sBAAsBC;AACzD,SAAO,OAAO,QAAQ;AACpB,UAAM,OAAO,6BAA6B,GAAG;AAC7C,UAAM,iBAAiB,qBAAqB;AAAA,MAC1C,SAAS;AAAA,MACT,UAAU,KAAK;AAAA,MACf,WAAW,KAAK;AAAA,MAChB,OAAO,KAAK;AAAA,MACZ,SAAS,KAAK;AAAA,MACd,UAAU,KAAK,YAAY;AAAA,MAC3B,QAAQ,KAAK;AAAA,IACf,CAAC;AACD,UAAM,YAAY,QAAQ,MAAM,OAA6B;AAAA,MAC3D,SAAS;AAAA,MACT;AAAA,MACA,WAAW,KAAK;AAAA,MAChB;AAAA,MACA,KAAK,OAAO,QAAQ,QAAQ,SAAS,MAAM,GAAG;AAAA,IAChD,CAAC;AACD,WAAO;AAAA,MACL,QAAQ,UAAU;AAAA,MAClB,qBAAqB,mBAAmB,IAAI;AAAA,IAC9C;AAAA,EACF;AACF;AAEA,SAASA,iBAAgB,MAAoC;AAC3D,QAAM,WAAW,KAAK,IAAI,GAAG,KAAK,YAAY,CAAC;AAC/C,MAAI,aAAa,EAAG,QAAOH;AAC3B,SAAOC;AACT;;;AC1MO,IAAM,+BAA+B;AAGrC,IAAM,iCAAiC;AAAA,EAC5C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,EAAE,KAAK,IAAI;AAGJ,IAAM,kCAAkC;AAAA,EAC7C,MAAM;AAAA,EACN,YAAY;AAAA,IACV,WAAW,EAAE,MAAM,SAAS;AAAA,IAC5B,SAAS,EAAE,MAAM,UAAU,MAAM,CAAC,SAAS,YAAY,EAAE;AAAA,IACzD,OAAO,EAAE,MAAM,UAAU,aAAa,qDAAgD;AAAA,IACtF,OAAO,EAAE,MAAM,WAAW,SAAS,GAAG,SAAS,IAAI;AAAA,EACrD;AAAA,EACA,sBAAsB;AACxB;AAGO,SAAS,8BAA8B,KAAqC;AACjF,MAAI,QAAQ,UAAa,QAAQ,KAAM,QAAO,CAAC;AAC/C,MAAI,OAAO,QAAQ,UAAU;AAC3B,UAAM,IAAI,UAAU,iDAAiD;AAAA,EACvE;AACA,QAAM,QAAQ;AACd,QAAM,MAA6B,CAAC;AACpC,MAAI,MAAM,cAAc,QAAW;AACjC,QAAI,OAAO,MAAM,cAAc,UAAU;AACvC,YAAM,IAAI,UAAU,kDAAkD;AAAA,IACxE;AACA,QAAI,YAAY,MAAM;AAAA,EACxB;AACA,MAAI,MAAM,YAAY,QAAW;AAC/B,QAAI,MAAM,YAAY,WAAW,MAAM,YAAY,cAAc;AAC/D,YAAM,IAAI,UAAU,+DAA+D;AAAA,IACrF;AACA,QAAI,UAAU,MAAM;AAAA,EACtB;AACA,MAAI,MAAM,UAAU,QAAW;AAC7B,QAAI,OAAO,MAAM,UAAU,YAAY,OAAO,MAAM,KAAK,MAAM,MAAM,KAAK,CAAC,GAAG;AAC5E,YAAM,IAAI,UAAU,qDAAqD;AAAA,IAC3E;AACA,QAAI,QAAQ,MAAM;AAAA,EACpB;AACA,MAAI,MAAM,UAAU,QAAW;AAC7B,UAAM,IAAI,OAAO,MAAM,KAAK;AAC5B,QAAI,CAAC,OAAO,SAAS,CAAC,KAAK,IAAI,KAAK,IAAI,KAAK;AAC3C,YAAM,IAAI,WAAW,4DAA4D;AAAA,IACnF;AACA,QAAI,QAAQ,KAAK,MAAM,CAAC;AAAA,EAC1B;AACA,SAAO;AACT;AAQO,SAAS,+BACd,SACoD;AACpD,SAAO,OAAO,QAAQ;AACpB,UAAM,OAAO,8BAA8B,GAAG;AAC9C,WAAO,EAAE,aAAa,QAAQ,MAAM,QAAQ,IAAI,EAAE;AAAA,EACpD;AACF;;;AClFO,IAAM,8BAA8B;AAGpC,IAAM,gCAAgC;AAAA,EAC3C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,EAAE,KAAK,IAAI;AAGJ,IAAM,iCAAiC;AAAA,EAC5C,MAAM;AAAA,EACN,YAAY;AAAA,IACV,QAAQ,EAAE,MAAM,UAAU,aAAa,iDAAiD;AAAA,EAC1F;AAAA,EACA,UAAU,CAAC,QAAQ;AAAA,EACnB,sBAAsB;AACxB;AAGO,SAAS,6BAA6B,KAAoC;AAC/E,MAAI,QAAQ,QAAQ,OAAO,QAAQ,UAAU;AAC3C,UAAM,IAAI,UAAU,gDAAgD;AAAA,EACtE;AACA,QAAM,QAAQ;AACd,QAAM,SAAS,MAAM;AACrB,MAAI,OAAO,WAAW,YAAY,OAAO,KAAK,EAAE,WAAW,GAAG;AAC5D,UAAM,IAAI,UAAU,wDAAwD;AAAA,EAC9E;AACA,SAAO,EAAE,QAAQ,OAAO,KAAK,EAAE;AACjC;AAQO,SAAS,8BACd,SACmD;AACnD,SAAO,OAAO,QAAQ;AACpB,UAAM,OAAO,6BAA6B,GAAG;AAC7C,UAAM,SAAS,QAAQ,MAAM,OAAO,KAAK,MAAM;AAC/C,QAAI,CAAC,QAAQ;AACX,YAAM,IAAI,cAAc,sCAAsC,KAAK,MAAM,GAAG;AAAA,IAC9E;AACA,WAAO;AAAA,EACT;AACF;;;ACdA,IAAM,QAAQ,EAAE,MAAM,iCAAiC,SAAS,SAAS;AAQzE,IAAM,SAAS;AAAA,EACb,WAAW;AAAA,EACX,WAAW;AAAA,EACX,gBAAgB;AAAA,EAChB,aAAa;AAAA,EACb,cAAc;AAChB;AAKO,SAAS,mBAAmB,QAAqD;AACtF,QAAM,mBACJ,QAAQ,aACP,OAAO,YAAY,cAAc,QAAQ,IAAI,8BAA8B;AAC9E,MAAI,CAAC,iBAAkB,QAAO;AAC9B,QAAM,WAAmB;AAEzB,QAAM,UAAU,QAAQ,WAAW,oBAAoB;AACvD,QAAM,YAAY,QAAQ,aAAa;AACvC,QAAM,kBAAkB,QAAQ,mBAAmB;AACnD,QAAM,cAAc,QAAQ,eAAe;AAC3C,QAAM,gBAAgB,QAAQ,sBAAsB,CAAC;AAErD,QAAM,UAAsB,CAAC;AAC7B,MAAI;AACJ,MAAI,UAAU;AAEd,QAAM,WAAyB;AAAA,IAC7B,WAAW,MAAsB;AAC/B,UAAI,QAAS;AACb,cAAQ,KAAK,IAAI;AACjB,UAAI,QAAQ,UAAU,WAAW;AAC/B,aAAK,QAAQ;AAAA,MACf;AAAA,IACF;AAAA,IAEA,MAAM,QAAuB;AAC3B,YAAM,QAAQ;AAAA,IAChB;AAAA,IAEA,MAAM,WAA0B;AAC9B,gBAAU;AACV,UAAI,UAAU,QAAW;AACvB,sBAAc,KAAK;AACnB,gBAAQ;AAAA,MACV;AACA,YAAM,QAAQ;AAAA,IAChB;AAAA,EACF;AAEA,UAAQ,YAAY,MAAM;AACxB,QAAI,QAAQ,SAAS,EAAG,MAAK,QAAQ;AAAA,EACvC,GAAG,eAAe;AAClB,MAAI,OAAO,UAAU,YAAY,WAAW,OAAO;AACjD;AAAC,IAAC,MAAyB,MAAM;AAAA,EACnC;AAEA,iBAAe,UAAyB;AACtC,QAAI,QAAQ,WAAW,EAAG;AAC1B,UAAM,QAAQ,QAAQ,OAAO,CAAC;AAC9B,UAAM,OAAmB;AAAA,MACvB,eAAe;AAAA,QACb;AAAA,UACE,UAAU;AAAA,YACR,YAAY,aAAa;AAAA,cACvB,gBAAgB;AAAA,cAChB,GAAG;AAAA,YACL,CAAC;AAAA,UACH;AAAA,UACA,YAAY,CAAC,EAAE,OAAO,OAAO,OAAO,MAAM,CAAC;AAAA,QAC7C;AAAA,MACF;AAAA,IACF;AACA,UAAM,MAAM,GAAG,SAAS,QAAQ,QAAQ,EAAE,CAAC;AAC3C,QAAI;AACF,YAAM,MAAM,KAAK;AAAA,QACf,QAAQ;AAAA,QACR,SAAS,EAAE,gBAAgB,oBAAoB,GAAG,QAAQ;AAAA,QAC1D,MAAM,KAAK,UAAU,IAAI;AAAA,MAC3B,CAAC;AAAA,IACH,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,SAAO;AACT;AAKO,SAAS,oBACd,OAMA,SACA,cACU;AACV,QAAM,SAAS,eAAe;AAC9B,QAAM,QAAmD;AAAA,IACvD,mBAAmB,MAAM;AAAA,IACzB,eAAe,MAAM;AAAA,EACvB;AACA,aAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,MAAM,OAAO,GAAG;AAClD,QAAI,OAAO,MAAM,YAAY,OAAO,MAAM,YAAY,OAAO,MAAM,WAAW;AAC5E,YAAM,QAAQ,CAAC,EAAE,IAAI;AAAA,IACvB;AAAA,EACF;AACA,QAAM,KAAK,OAAO,MAAM,SAAS;AACjC,SAAO;AAAA,IACL,SAAS,WAAW,OAAO;AAAA,IAC3B;AAAA,IACA,cAAc,eAAe,UAAU,YAAY,IAAI;AAAA,IACvD,MAAM,MAAM;AAAA,IACZ,MAAM;AAAA,IACN,mBAAmB;AAAA,IACnB,iBAAiB;AAAA,IACjB,YAAY,aAAa,KAAK;AAAA,IAC9B,QAAQ,EAAE,MAAM,EAAE;AAAA,EACpB;AACF;AAkBO,SAAS,mBACd,QACA,SACA,kBACY;AACZ,MAAI,OAAO,WAAW,EAAG,QAAO,CAAC;AACjC,QAAM,MAAM,WAAW,OAAO;AAC9B,QAAM,MAAkB,CAAC;AACzB,QAAM,MAAM,CAAC,MACX,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,IAAI,IAAI;AACpD,QAAM,MAAM,CAAC,MACX,OAAO,MAAM,YAAY,EAAE,SAAS,IAAI,IAAI;AAC9C,QAAM,MAAM,CAAC,MACX,KAAK,OAAO,MAAM,WAAY,IAAgC,CAAC;AAEjE,QAAM,UAAU,OAAO,KAAK,CAAC,MAAM,EAAE,SAAS,cAAc;AAC5D,QAAM,QAAQ,OAAO,KAAK,CAAC,MAAM,EAAE,SAAS,YAAY;AACxD,QAAM,QAAQ,OAAO,CAAC,GAAG,SAAS;AAClC,QAAM,YAAY,SAAS,aAAa,OAAO,CAAC,EAAG;AACnD,QAAM,UAAU,OAAO,aAAa,OAAO,OAAO,SAAS,CAAC,EAAG;AAC/D,QAAM,SAAS,eAAe;AAE9B,QAAM,OAAO,CACX,QACA,cACA,MACA,SACA,OACA,OACA,aAAa,OACC;AAAA,IACd,SAAS;AAAA,IACT;AAAA,IACA,cAAc,eAAe,UAAU,YAAY,IAAI;AAAA,IACvD;AAAA,IACA,MAAM;AAAA,IACN,mBAAmB,OAAO,OAAO;AAAA,IACjC,iBAAiB,OAAO,KAAK;AAAA,IAC7B,YAAY,aAAa,KAAK;AAAA,IAC9B,QAAQ,EAAE,MAAM,WAAW;AAAA,EAC7B;AAGA,QAAM,KAAK,IAAI,SAAS,OAAO;AAC/B,QAAM,YAAuD;AAAA,IAC3D,CAAC,OAAO,SAAS,GAAG;AAAA,IACpB,CAAC,OAAO,cAAc,GAAG;AAAA,IACzB,sBAAsB,IAAI,GAAG,MAAM,KAAK;AAAA,EAC1C;AACA,MAAI,MAAM,QAAQ,GAAG,aAAa,KAAK,GAAG,cAAc,SAAS,GAAG;AAClE,cAAU,oBAAoB,IAAI,GAAG,cAAc,IAAI,MAAM,EAAE,KAAK,GAAG;AAAA,EACzE;AACA,MAAI,OAAO;AACT,UAAM,KAAK,IAAI,MAAM,OAAO;AAC5B,UAAM,MAAM,IAAI,GAAG,oBAAoB;AACvC,QAAI,QAAQ,OAAW,WAAU,oCAAoC,IAAI;AACzE,UAAM,OAAO,IAAI,GAAG,YAAY;AAChC,QAAI,SAAS,OAAW,WAAU,iBAAiB,IAAI;AACvD,UAAM,MAAM,IAAI,GAAG,UAAU;AAC7B,QAAI,QAAQ,OAAW,WAAU,yBAAyB,IAAI;AAC9D,UAAM,QAAQ,IAAI,GAAG,UAAU;AAC/B,QAAI,UAAU,OAAW,WAAU,wBAAwB,IAAI;AAAA,EACjE;AACA,MAAI,KAAK,KAAK,QAAQ,kBAAkB,QAAQ,WAAW,SAAS,SAAS,CAAC;AAG9E,QAAM,cAAc,oBAAI,IAAoB;AAC5C,QAAM,iBAAiB,oBAAI,IAAoC;AAC/D,MAAI;AACJ,MAAI;AAGJ,QAAM,aAAa,CAAC,UAAkB;AACpC,QAAI,CAAC,aAAc;AACnB,QAAI;AAAA,MACF,KAAK,aAAa,IAAI,QAAQ,cAAc,aAAa,OAAO,OAAO,aAAa,KAAK;AAAA,IAC3F;AACA,mBAAe;AAAA,EACjB;AAEA,aAAW,KAAK,QAAQ;AACtB,UAAM,IAAI,IAAI,EAAE,OAAO;AACvB,YAAQ,EAAE,MAAM;AAAA,MACd,KAAK,aAAa;AAChB,mBAAW,EAAE,SAAS;AACtB,cAAM,KAAK,eAAe;AAC1B,cAAM,WAAW,IAAI,EAAE,UAAU,KAAK;AACtC,cAAM,QAAmD;AAAA,UACvD,CAAC,OAAO,SAAS,GAAG;AAAA,UACpB,2BAA2B;AAAA,UAC3B,yBAAyB,IAAI,EAAE,QAAQ,KAAK;AAAA,UAC5C,0BAA0B;AAAA,UAC1B,0BAA0B,IAAI,EAAE,YAAY,KAAK;AAAA,QACnD;AACA,cAAM,IAAI,IAAI,EAAE,SAAS;AACzB,YAAI,EAAG,OAAM,4BAA4B,IAAI;AAC7C,cAAM,SAAS,IAAI,EAAE,WAAW;AAChC,YAAI,WAAW,OAAW,OAAM,+BAA+B,IAAI;AACnE,YAAI,MAAM,QAAQ,EAAE,YAAY,KAAK,EAAE,aAAa,SAAS,GAAG;AAC9D,gBAAM,gCAAgC,IAAI,EAAE,aAAa,IAAI,MAAM,EAAE,KAAK,GAAG;AAAA,QAC/E;AACA,uBAAe,EAAE,IAAI,OAAO,EAAE,WAAW,MAAM;AAC/C,yBAAiB;AACjB;AAAA,MACF;AAAA,MACA,KAAK,0BAA0B;AAC7B,cAAM,MAAM,IAAI,EAAE,cAAc;AAChC,YAAI,QAAQ,OAAW,aAAY,IAAI,KAAK,EAAE,SAAS;AACvD;AAAA,MACF;AAAA,MACA,KAAK,2BAA2B;AAC9B,cAAM,MAAM,IAAI,EAAE,cAAc;AAChC,YAAI,QAAQ,OAAW;AACvB,cAAM,QAAgC,CAAC;AACvC,cAAM,OAAO,IAAI,EAAE,SAAS;AAC5B,YAAI,KAAM,OAAM,4BAA4B,IAAI;AAChD,cAAM,MAAM,IAAI,EAAE,SAAS;AAC3B,YAAI,IAAK,OAAM,mBAAmB,IAAI;AACtC,cAAM,MAAM,IAAI,EAAE,OAAO;AACzB,YAAI,IAAK,OAAM,iBAAiB,IAAI;AACpC,cAAM,MAAM,IAAI,EAAE,SAAS;AAC3B,YAAI,IAAK,OAAM,mBAAmB,IAAI;AACtC,uBAAe,IAAI,KAAK,KAAK;AAC7B;AAAA,MACF;AAAA,MACA,KAAK,wBAAwB;AAC3B,cAAM,MAAM,IAAI,EAAE,cAAc,KAAK;AACrC,cAAM,QAAQ,YAAY,IAAI,GAAG,KAAK,EAAE;AACxC,cAAM,MAAM,IAAI,EAAE,KAAK;AACvB,cAAM,QAAmD;AAAA,UACvD,CAAC,OAAO,SAAS,GAAG;AAAA,UACpB,+BAA+B;AAAA,QACjC;AACA,cAAM,QAAQ,IAAI,EAAE,YAAY;AAChC,YAAI,MAAO,OAAM,OAAO,SAAS,IAAI;AACrC,cAAM,KAAK,IAAI,EAAE,UAAU;AAC3B,cAAM,QAAQ,IAAI,GAAG,KAAK;AAC1B,YAAI,UAAU,OAAW,OAAM,OAAO,WAAW,IAAI;AACrD,cAAM,SAAS,IAAI,GAAG,MAAM;AAC5B,YAAI,WAAW,OAAW,OAAM,OAAO,YAAY,IAAI;AACvD,cAAM,OAAO,IAAI,EAAE,OAAO;AAC1B,YAAI,SAAS,OAAW,OAAM,iBAAiB,IAAI;AACnD,cAAM,UAAU,IAAI,EAAE,OAAO;AAC7B,YAAI,OAAO,QAAQ,UAAU,UAAW,OAAM,2BAA2B,IAAI,QAAQ;AACrF,cAAM,QAAQ,IAAI,QAAQ,KAAK;AAC/B,YAAI,UAAU,OAAW,OAAM,2BAA2B,IAAI;AAC9D,YAAI,IAAK,OAAM,mBAAmB,IAAI;AACtC,cAAM,MAAM,IAAI,EAAE,OAAO;AACzB,YAAI,QAAQ,OAAW,OAAM,gCAAgC,IAAI;AACjE,cAAM,MAAM,IAAI,EAAE,WAAW;AAC7B,YAAI,QAAQ,OAAW,OAAM,oCAAoC,IAAI;AACrE,cAAM,MAAM,IAAI,EAAE,UAAU;AAC5B,YAAI,QAAQ,OAAW,OAAM,mCAAmC,IAAI;AACpE,cAAM,UAAU,IAAI,EAAE,aAAa;AACnC,YAAI,QAAS,OAAM,sCAAsC,IAAI;AAC7D,eAAO,OAAO,OAAO,eAAe,IAAI,GAAG,KAAK,CAAC,CAAC;AAClD,YAAI;AAAA,UACF;AAAA,YACE,eAAe;AAAA,YACf,kBAAkB;AAAA,YAClB;AAAA,YACA;AAAA,YACA,EAAE;AAAA,YACF;AAAA,YACA,MAAM,IAAI;AAAA,UACZ;AAAA,QACF;AACA;AAAA,MACF;AAAA,MACA,KAAK,iBAAiB;AACpB,YAAI,cAAc;AAChB,gBAAM,MAAM,IAAI,EAAE,QAAQ;AAC1B,cAAI,IAAK,cAAa,MAAM,sBAAsB,IAAI;AACtD,qBAAW,EAAE,SAAS;AAAA,QACxB;AACA,yBAAiB;AACjB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,aAAW,OAAO;AAClB,SAAO;AACT;AAEA,SAAS,sBAA8C;AACrD,MAAI,OAAO,YAAY,YAAa,QAAO,CAAC;AAC5C,QAAM,MAAM,QAAQ,IAAI;AACxB,MAAI,CAAC,IAAK,QAAO,CAAC;AAClB,QAAM,MAA8B,CAAC;AACrC,aAAW,QAAQ,IAAI,MAAM,GAAG,GAAG;AACjC,UAAM,KAAK,KAAK,QAAQ,GAAG;AAC3B,QAAI,KAAK,EAAG;AACZ,UAAM,MAAM,KAAK,MAAM,GAAG,EAAE,EAAE,KAAK;AACnC,UAAM,QAAQ,KAAK,MAAM,KAAK,CAAC,EAAE,KAAK;AACtC,QAAI,IAAK,KAAI,GAAG,IAAI;AAAA,EACtB;AACA,SAAO;AACT;AAEA,SAAS,aAAa,QAAoE;AACxF,SAAO,OAAO,QAAQ,MAAM,EAAE,IAAI,CAAC,CAAC,KAAK,KAAK,OAAO;AAAA,IACnD;AAAA,IACA,OACE,OAAO,UAAU,WACb,OAAO,UAAU,KAAK,IACpB,EAAE,UAAU,MAAM,SAAS,EAAE,IAC7B,EAAE,aAAa,MAAM,IACvB,OAAO,UAAU,YACf,EAAE,WAAW,MAAM,IACnB,EAAE,aAAa,MAAM;AAAA,EAC/B,EAAE;AACJ;AAEA,SAAS,OAAO,IAAoB;AAClC,UAAQ,OAAO,KAAK,MAAM,EAAE,CAAC,IAAI,UAAY,SAAS;AACxD;AAEA,SAAS,UAAU,IAAoB;AACrC,QAAM,UAAU,GAAG,QAAQ,MAAM,EAAE;AACnC,SAAO,QAAQ,MAAM,GAAG,EAAE,EAAE,OAAO,IAAI,GAAG;AAC5C;AAEA,SAAS,WAAW,IAAoB;AACtC,QAAM,UAAU,GAAG,QAAQ,MAAM,EAAE;AACnC,SAAO,QAAQ,MAAM,GAAG,EAAE,EAAE,OAAO,IAAI,GAAG;AAC5C;AAEA,SAAS,iBAAyB;AAChC,QAAM,QAAQ,IAAI,WAAW,CAAC;AAC9B,MAAI,OAAO,WAAW,QAAQ,oBAAoB,YAAY;AAC5D,eAAW,OAAO,gBAAgB,KAAK;AAAA,EACzC,OAAO;AACL,aAAS,IAAI,GAAG,IAAI,GAAG,IAAK,OAAM,CAAC,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI,GAAG;AAAA,EACvE;AACA,SAAO,MAAM,KAAK,KAAK,EACpB,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EAC1C,KAAK,EAAE;AACZ;AAaO,IAAM,4BAA4B;AAuDzC,IAAM,4BAA4B;AAQlC,eAAsB,eACpB,QACA,QAC+B;AAC/B,MAAI,OAAO,WAAW,EAAG,QAAO,EAAE,IAAI,MAAM,QAAQ,GAAG,UAAU,GAAG,UAAU,CAAC,EAAE;AACjF,QAAM,SACJ,QAAQ,WAAW,OAAO,YAAY,cAAc,QAAQ,IAAI,iBAAiB;AACnF,MAAI,CAAC;AACH,UAAM,IAAI,MAAM,4EAA4E;AAC9F,QAAM,OACJ,QAAQ,SACP,OAAO,YAAY,cAAc,QAAQ,IAAI,oBAAoB,WAClE;AACF,QAAM,MAAM,GAAG,KAAK,QAAQ,QAAQ,EAAE,CAAC;AACvC,QAAM,MAAM,MAAM,MAAM,KAAK;AAAA,IAC3B,QAAQ;AAAA,IACR,SAAS;AAAA,MACP,gBAAgB;AAAA,MAChB,eAAe,UAAU,MAAM;AAAA,MAC/B,yBAAyB;AAAA,MACzB,GAAI,QAAQ,iBAAiB,EAAE,mBAAmB,OAAO,eAAe,IAAI,CAAC;AAAA,IAC/E;AAAA,IACA,MAAM,KAAK,UAAU,EAAE,aAAa,2BAA2B,OAAO,CAAC;AAAA,EACzE,CAAC;AACD,MAAI,SAAqF,CAAC;AAC1F,MAAI;AACF,aAAU,MAAM,IAAI,KAAK;AAAA,EAC3B,QAAQ;AAAA,EAER;AACA,SAAO;AAAA,IACL,IAAI,IAAI;AAAA,IACR,QAAQ,IAAI;AAAA,IACZ,UAAU,OAAO,aAAa,IAAI,KAAK,OAAO,SAAS;AAAA,IACvD,UAAU,OAAO,YAAY,CAAC;AAAA,EAChC;AACF;","names":["SINGLE_VARIANT_ESTIMATE_MS","FANOUT_PER_VARIANT_ESTIMATE_MS","validateConfig","defaultEstimate"]}