@tangle-network/agent-runtime 0.36.0 → 0.38.0

package/dist/mcp/index.d.ts

@@ -1,100 +1,14 @@
-import { L as LoopSandboxClient, j as LoopSandboxPlacement, m as LoopTraceEmitter } from '../types-DrXVR2Fu.js';
-import { SandboxInstance } from '@tangle-network/sandbox';
-import { CoderOutput, CoderTask } from '../profiles.js';
+import { L as LoopSandboxClient, j as LoopSandboxPlacement, m as LoopTraceEmitter } from '../types-CmkQl8qE.js';
+import { F as FleetHandle, D as DelegationExecutor, a as DelegateFeedbackArgs, b as DelegationFeedbackSnapshot, c as DelegationProfile, d as DelegateCodeArgs, e as DelegateResearchArgs, f as DelegationStatus, g as DelegationProgress, h as DelegationResultPayload, i as DelegationError, j as DelegationStatusResult, k as DelegationHistoryArgs, l as DelegationHistoryEntry, C as CoderDelegate, R as ResearcherDelegate, m as DelegateCodeResult, n as DelegateFeedbackResult, o as ResearchSource, p as DelegateResearchResult, q as DelegationHistoryResult, r as DelegationStatusArgs, O as OtelExporter } from '../otel-export-CNmeg_7B.js';
+export { s as CoderReview, t as CoderReviewer, u as CoderWinnerSelection, v as CreateDefaultCoderDelegateOptions, w as CreateKbGateOptions, x as DelegateCodeConfig, y as DelegateResearchConfig, z as DelegateRunCtx, A as FactCandidate, B as FactJudge, E as FactJudgeVerdict, G as FeedbackRating, H as FeedbackRefersTo, I as FleetWorkspaceExecutorOptions, K as KbGateResult, J as ResearchOutputShape, S as SiblingSandboxExecutorOptions, L as createDefaultCoderDelegate, M as createFleetWorkspaceExecutor, N as createKbGate, P as createSiblingSandboxExecutor, Q as mcpToolsForRuntimeMcp, T as mcpToolsForRuntimeMcpSubset } from '../otel-export-CNmeg_7B.js';
 import { L as LocalHarness, r as runLocalHarness } from '../local-harness-KrdFTY5R.js';
 export { a as LocalHarnessResult, R as RunLocalHarnessOptions } from '../local-harness-KrdFTY5R.js';
-import { O as OtelExporter } from '../otel-export-xgf4J6bo.js';
-export { m as mcpToolsForRuntimeMcp, a as mcpToolsForRuntimeMcpSubset } from '../otel-export-xgf4J6bo.js';
 import '@tangle-network/agent-eval';
-import '../runtime-run-B8VIiOhI.js';
+import '@tangle-network/sandbox';
 import '../types-CsCCryln.js';
+import '../profiles.js';
 import 'node:child_process';
 
-/**
- * @experimental
- *
- * Delegation executors — the layer between MCP delegates and the sandbox
- * substrate. Each executor exposes a {@link LoopSandboxClient} the kernel
- * consumes plus a placement tag so the trace pipeline can correlate workers
- * with their physical placement.
- *
- * Two implementations ship in-box:
- *
- * - {@link createSiblingSandboxExecutor} — every delegation spawns a fresh
- *   sandbox sibling to the caller. Default when the MCP server runs as a
- *   standalone CLI mounted outside a fleet.
- *
- * - {@link createFleetWorkspaceExecutor} — delegations dispatch onto machines
- *   in the caller's existing fleet so worker diffs land directly on the
- *   caller's filesystem (the fleet's shared workspace). Selected when the
- *   parent sandbox passes `TANGLE_FLEET_ID` into the MCP server's env.
- */
-
-/** @experimental */
-interface DelegationExecutor {
-    /** Sandbox client the kernel calls. Returned with `describePlacement` set. */
-    readonly client: LoopSandboxClient;
-    /** Best-effort one-liner used in stderr boot logs and diagnostics. */
-    describe(): string;
-}
-/** @experimental */
-interface SiblingSandboxExecutorOptions {
-    client: LoopSandboxClient;
-}
-/**
- * Wrap a raw sandbox SDK client so the kernel emits
- * `loop.iteration.dispatch` events with `{ placement: 'sibling', sandboxId }`.
- *
- * The returned client `.create()` delegates to the underlying client; the
- * only added behavior is a `describePlacement` tag the kernel reads.
- *
- * @experimental
- */
-declare function createSiblingSandboxExecutor(options: SiblingSandboxExecutorOptions): DelegationExecutor;
-/**
- * Minimal `SandboxFleet` surface the fleet executor calls. Declared
- * structurally so tests can pass an in-memory stub without instantiating the
- * sandbox SDK.
- *
- * @experimental
- */
-interface FleetHandle {
-    readonly fleetId: string;
-    /** Machine ids in dispatch-eligible order. The executor round-robins. */
-    readonly ids: ReadonlyArray<string>;
-    /** Resolve a machine id to its `SandboxInstance` — that machine is mounted
-     * on the fleet's shared workspace, so any diff the worker writes lands on
-     * every other fleet machine's filesystem too. */
-    sandbox(machineId: string): Promise<SandboxInstance>;
-}
-/** @experimental */
-interface FleetWorkspaceExecutorOptions {
-    fleet: FleetHandle;
-    /**
-     * Override the machine-selection policy. Default = round-robin across
-     * `fleet.ids`, skipping the optional `excludeMachineIds` set (typically the
-     * coordinator machine the MCP server is running on).
-     */
-    selectMachine?: (call: {
-        callIndex: number;
-        ids: ReadonlyArray<string>;
-    }) => string;
-    /**
-     * Machine ids to skip during default round-robin. Set to the caller's own
-     * machineId so workers don't compete with the orchestrator on the same VM.
-     */
-    excludeMachineIds?: ReadonlyArray<string>;
-}
-/**
- * Build an executor that resolves each delegated iteration to an existing
- * machine in `fleet`. The fleet's shared-workspace policy means the worker
- * machine sees the caller's filesystem — diffs land in-place with no
- * cross-sandbox copy step.
- *
- * @experimental
- */
-declare function createFleetWorkspaceExecutor(options: FleetWorkspaceExecutorOptions): DelegationExecutor;
-
 /**
  * @experimental
  *
@@ -131,279 +45,6 @@ interface DetectExecutorArgs {
  */
 declare function detectExecutor(args: DetectExecutorArgs): Promise<DelegationExecutor>;
 
-/**
- * @experimental
- *
- * MCP delegation tool surface — the typed inputs/outputs the product agent
- * sees over the wire. These types are the contract; the JSON schemas under
- * `tools/*` mirror them for the MCP `tools/list` advertisement.
- *
- * Async semantics: `delegate_code` + `delegate_research` return a `taskId`
- * immediately. The product agent polls `delegation_status` until the task
- * transitions to `completed` | `failed` | `cancelled`. `delegate_feedback`
- * + `delegation_history` are synchronous reads / writes against the local
- * task queue + feedback store.
- */
-
-/** @experimental */
-type DelegationProfile = 'coder' | 'researcher';
-/** @experimental */
-type DelegationStatus = 'pending' | 'running' | 'completed' | 'failed' | 'cancelled';
-/**
- * Minimal `CoderTask` overrides exposed over the MCP wire. The full
- * `CoderTask` carries fields the kernel synthesizes from `goal` +
- * `repoRoot` — the agent only edits the few that materially gate
- * validator behavior.
- *
- * @experimental
- */
-interface DelegateCodeConfig {
-    testCmd?: string;
-    typecheckCmd?: string;
-    forbiddenPaths?: string[];
-    maxDiffLines?: number;
-}
-/** @experimental */
-interface DelegateCodeArgs {
-    /** Natural-language description of what the coder must accomplish. */
-    goal: string;
-    /** Absolute path inside the sandbox where the repo lives. */
-    repoRoot: string;
-    /** Optional free-form context the agent surfaces in the prompt prelude. */
-    contextHint?: string;
-    /**
-     * When > 1, dispatches `multiHarnessCoderFanout` across N harnesses
-     * (claude-code, codex, opencode-glm) and picks the highest-scoring
-     * passing patch. Default 1.
-     */
-    variants?: number;
-    /** Validator + prompt overrides the agent knows for this repo. */
-    config?: DelegateCodeConfig;
-    /** Multi-tenant scope (customer-id, workspace-id). */
-    namespace?: string;
-}
-/** @experimental */
-interface DelegateCodeResult {
-    taskId: string;
-    /** Best-effort hint — coder loops can take minutes-to-hours. */
-    estimatedDurationMs?: number;
-}
-/** @experimental */
-type ResearchSource = 'web' | 'corpus' | 'twitter' | 'github' | 'docs';
-/** @experimental */
-interface DelegateResearchConfig {
-    recencyWindow?: {
-        since?: string;
-        until?: string;
-    };
-    maxItems?: number;
-    minConfidence?: number;
-}
-/** @experimental */
-interface DelegateResearchArgs {
-    question: string;
-    namespace: string;
-    scope?: string;
-    sources?: ResearchSource[];
-    variants?: number;
-    config?: DelegateResearchConfig;
-}
-/** @experimental */
-interface DelegateResearchResult {
-    taskId: string;
-    estimatedDurationMs?: number;
-}
-/** @experimental */
-interface FeedbackRefersTo {
-    kind: 'delegation' | 'artifact' | 'outcome';
-    /** For `'delegation'`, this is the taskId. */
-    ref: string;
-}
-/** @experimental */
-interface FeedbackRating {
-    /** [0, 1]. */
-    score: number;
-    label?: 'good' | 'bad' | 'neutral' | 'mixed';
-    notes: string;
-}
-/** @experimental */
-interface DelegateFeedbackArgs {
-    refersTo: FeedbackRefersTo;
-    rating: FeedbackRating;
-    by: 'agent' | 'user' | 'downstream-judge';
-    /** ISO timestamp; defaults to server clock when omitted. */
-    capturedAt?: string;
-    namespace?: string;
-}
-/** @experimental */
-interface DelegateFeedbackResult {
-    recorded: true;
-    id: string;
-}
-/** @experimental */
-interface DelegationStatusArgs {
-    taskId: string;
-}
-/** @experimental */
-interface DelegationProgress {
-    iteration: number;
-    phase: string;
-}
-/** @experimental */
-interface DelegationError {
-    message: string;
-    kind: string;
-}
-/**
- * Polymorphic `result` field: `CoderOutput` when the underlying profile
- * is `'coder'`, a structurally-typed research output when `'researcher'`.
- * The MCP wire carries it as JSON either way.
- *
- * @experimental
- */
-type DelegationResultPayload = {
-    profile: 'coder';
-    output: CoderOutput;
-} | {
-    profile: 'researcher';
-    output: ResearchOutputShape;
-};
-/**
- * Loose shape of a research output over the wire — the substrate cannot
- * import the `ResearchOutput` type from agent-knowledge without inducing
- * a dependency cycle, so the MCP layer treats it structurally.
- *
- * @experimental
- */
-interface ResearchOutputShape {
-    items: unknown[];
-    citations: unknown[];
-    proposedWrites: unknown[];
-    gaps?: string[];
-    notes?: string;
-    [key: string]: unknown;
-}
-/** @experimental */
-interface DelegationStatusResult {
-    taskId: string;
-    profile: DelegationProfile;
-    status: DelegationStatus;
-    progress?: DelegationProgress;
-    result?: DelegationResultPayload;
-    error?: DelegationError;
-    costUsd?: number;
-    startedAt: string;
-    completedAt?: string;
-}
-/** @experimental */
-interface DelegationHistoryArgs {
-    namespace?: string;
-    profile?: DelegationProfile;
-    /** ISO date — only delegations started at-or-after `since` are returned. */
-    since?: string;
-    /** Default 50. Hard cap 500. */
-    limit?: number;
-}
-/** @experimental */
-interface DelegationFeedbackSnapshot {
-    id: string;
-    score: number;
-    label?: FeedbackRating['label'];
-    by: DelegateFeedbackArgs['by'];
-    notes: string;
-    capturedAt: string;
-}
-/** @experimental */
-interface DelegationHistoryEntry {
-    taskId: string;
-    profile: DelegationProfile;
-    namespace?: string;
-    args: DelegateCodeArgs | DelegateResearchArgs;
-    status: DelegationStatus;
-    feedback?: DelegationFeedbackSnapshot[];
-    costUsd?: number;
-    startedAt: string;
-    completedAt?: string;
-}
-/** @experimental */
-interface DelegationHistoryResult {
-    delegations: DelegationHistoryEntry[];
-}
-
-/** @experimental */
-interface DelegateRunCtx {
-    signal: AbortSignal;
-    report(progress: DelegationProgress): void;
-}
-/** @experimental */
-type CoderDelegate = (args: DelegateCodeArgs, ctx: DelegateRunCtx) => Promise<CoderOutput>;
-/** @experimental */
-type ResearcherDelegate = (args: DelegateResearchArgs, ctx: DelegateRunCtx) => Promise<ResearchOutputShape>;
-/** @experimental Structured review verdict over a coder candidate. */
-interface CoderReview {
-    /** Gate: only approved candidates are eligible to win. */
-    approved: boolean;
-    /** Reviewer's recommendation — surfaced in traces. */
-    recommendation: 'ship' | 'approve-with-nits' | 'changes-requested' | 'reject';
-    /** Readiness 0..1, used by the `highest-readiness` winner-selection strategy. */
-    readiness: number;
-    notes?: string;
-}
-/**
- * @experimental
- *
- * Optional adversarial reviewer over a coder candidate that already passed
- * mechanical validation (tests/typecheck/forbidden/diff/no-op/secrets). Folded
- * from the ai-trading-blueprint delegation MCP: a candidate is only eligible to
- * win if the reviewer approves it. The reviewer is the consumer's seam — an LLM
- * judge, a `pnpm review` command, anything returning a `CoderReview`.
- */
-type CoderReviewer = (output: CoderOutput, task: CoderTask, ctx: {
-    signal: AbortSignal;
-}) => Promise<CoderReview> | CoderReview;
-/**
- * @experimental Winner-selection strategy among validated (+ reviewed)
- * candidates. `highest-readiness` requires a `reviewer`. Default `highest-score`
- * (the kernel's behavior — preserves backward compatibility).
- */
-type CoderWinnerSelection = 'highest-score' | 'smallest-diff' | 'highest-readiness' | 'first-approved';
-/** @experimental */
-interface CreateDefaultCoderDelegateOptions {
-    /**
-     * Execution placement. Pass a {@link DelegationExecutor} (sibling or fleet)
-     * to control where worker iterations land. `sandboxClient` is a
-     * convenience shorthand that wraps the client in a sibling executor — pass
-     * one or the other, not both.
-     */
-    executor?: DelegationExecutor;
-    /**
-     * Convenience shorthand for sibling placement. Equivalent to
-     * `executor: createSiblingSandboxExecutor({ client: sandboxClient })`.
-     */
-    sandboxClient?: LoopSandboxClient;
-    /** Default `['claude-code', 'codex', 'opencode/zai-coding-plan/glm-5.1']` when variants > 1. */
-    fanoutHarnesses?: string[];
-    /** Hard cap on the kernel's per-batch concurrency. Default 4. */
-    maxConcurrency?: number;
-    /**
-     * Optional adversarial reviewer. When set, a candidate must pass mechanical
-     * validation AND `reviewer.approved` to be eligible to win — empty/secret/
-     * test-failing patches are already gone; this catches the "compiles + passes
-     * but wrong/unsafe" class the deterministic validator can't see.
-     */
-    reviewer?: CoderReviewer;
-    /** Winner-selection strategy among eligible candidates. Default `highest-score`. */
-    winnerSelection?: CoderWinnerSelection;
-}
-/**
- * Build a coder delegate that drives `runLoop` against the project's
- * sandbox client + coder profile. When `args.variants > 1` it switches
- * to the multi-harness fanout topology.
- *
- * @experimental
- */
-declare function createDefaultCoderDelegate(options: CreateDefaultCoderDelegateOptions): CoderDelegate;
-
 /**
  * @experimental
  *
@@ -644,81 +285,6 @@ interface InProcessExecutorDescribePlacement extends LoopSandboxPlacement {
  */
 declare function createInProcessExecutor(options: InProcessExecutorOptions): DelegationExecutor;
 
-/**
- * @experimental
- *
- * `createKbGate` — the valid-only knowledge-base growth gate, distilled from
- * physim's KB-research subsystem. A research-in-a-loop delegate (or any KB
- * writer) runs candidate facts through this before persisting, so the KB grows
- * with ONLY grounded facts — hallucinated, unsourced, or laundered claims are
- * vetoed at the gate.
- *
- * Fail-closed by construction: every judge must `accept`; the FIRST veto wins
- * and the fact is rejected. The non-negotiable floor (always on, can't be
- * disabled) is the **passage-present guard** — a fact's `verbatimPassage` MUST
- * literally appear in its `sourceText`. That single check kills the dominant
- * failure mode (a confident claim decoupled from any real source).
- *
- * Pure + dependency-free: it operates on fact candidates, not on a store, so it
- * composes with `@tangle-network/agent-knowledge` or any persistence layer
- * without importing it. The remediation policy (correct-on-veto vs
- * escalate-as-unverified) is the caller's — this returns the verdict; it never
- * drops a fact silently.
- */
-/** @experimental A fact proposed for the KB, with its grounding. */
-interface FactCandidate {
-    /** The atomic claim text. */
-    claim: string;
-    /** Optional extracted value (number or string) the claim asserts. */
-    value?: string | number;
-    /** Verbatim span lifted from the source that backs the claim. */
-    verbatimPassage: string;
-    /** The raw source text the passage must be grounded in. */
-    sourceText: string;
-    /** Where the fact claims to come from — checked for circular/self citations. */
-    citation?: string;
-}
-/** @experimental */
-interface FactJudgeVerdict {
-    accept: boolean;
-    reason?: string;
-}
-/** @experimental A pluggable fact validator. Throw is NOT allowed — return a
- *  verdict; a thrown judge is a programmer error, not a veto. */
-interface FactJudge {
-    name: string;
-    judge(candidate: FactCandidate): FactJudgeVerdict | Promise<FactJudgeVerdict>;
-}
-/** @experimental */
-interface KbGateResult {
-    accepted: boolean;
-    /** Name of the judge that vetoed; undefined when accepted. */
-    vetoedBy?: string;
-    reason?: string;
-}
-/** @experimental */
-interface CreateKbGateOptions {
-    /** Extra judges appended after the built-in floor (e.g. an LLM judge). */
-    judges?: FactJudge[];
-    /** Minimum verbatim-passage length. Default 12 — kills empty/stub passages. */
-    minPassageChars?: number;
-    /**
-     * Citation tokens that denote a SELF-generated artifact (e.g. `'spec'`,
-     * `'cad_params'`, `'requirements'`). A citation naming one is circular
-     * (laundering) — the fact cites a derived artifact, not a real source.
-     * Default `[]` (no circular check unless the consumer declares its kinds).
-     */
-    selfArtifactKinds?: string[];
-}
-/**
- * @experimental
- *
- * Build a fail-closed KB gate. The returned function runs the built-in floor
- * (passage-non-empty → passage-present → value-in-passage → no-circular-citation)
- * then any consumer judges, returning on the first veto.
- */
-declare function createKbGate(options?: CreateKbGateOptions): (candidate: FactCandidate) => Promise<KbGateResult>;
-
 /**
  * @experimental
  *
@@ -1306,4 +872,4 @@ declare function createPropagatingTraceEmitter(ctx: TraceContext): {
  */
 declare function traceContextToEnv(ctx: TraceContext): Record<string, string>;
 
-export { type CoderDelegate, type CoderReview, type CoderReviewer, type CoderWinnerSelection, type CreateDefaultCoderDelegateOptions, type CreateKbGateOptions, type CreateWorktreeOptions, DELEGATE_CODE_DESCRIPTION, DELEGATE_CODE_INPUT_SCHEMA, DELEGATE_CODE_TOOL_NAME, DELEGATE_FEEDBACK_DESCRIPTION, DELEGATE_FEEDBACK_INPUT_SCHEMA, DELEGATE_FEEDBACK_TOOL_NAME, DELEGATE_RESEARCH_DESCRIPTION, DELEGATE_RESEARCH_INPUT_SCHEMA, DELEGATE_RESEARCH_TOOL_NAME, DELEGATION_HISTORY_DESCRIPTION, DELEGATION_HISTORY_INPUT_SCHEMA, DELEGATION_HISTORY_TOOL_NAME, DELEGATION_STATUS_DESCRIPTION, DELEGATION_STATUS_INPUT_SCHEMA, DELEGATION_STATUS_TOOL_NAME, type DelegateCodeArgs, type DelegateCodeConfig, type DelegateCodeResult, type DelegateFeedbackArgs, type DelegateFeedbackResult, type DelegateResearchArgs, type DelegateResearchConfig, type DelegateResearchResult, type DelegateRunCtx, type DelegationError, type DelegationExecutor, type DelegationFeedbackSnapshot, type DelegationHistoryArgs, type DelegationHistoryEntry, type DelegationHistoryResult, type DelegationProfile, type DelegationProgress, type DelegationRecord, type DelegationResultPayload, type DelegationStatus, type DelegationStatusArgs, type DelegationStatusResult, DelegationTaskQueue, type DelegationTaskQueueOptions, type DetectExecutorArgs, type DiffOptions, type DiffResult, type FactCandidate, type FactJudge, type FactJudgeVerdict, type FeedbackEvent, type FeedbackRating, type FeedbackRefersTo, type FeedbackStore, type FleetHandle, type FleetWorkspaceExecutorOptions, type GitRunner, InMemoryFeedbackStore, type InProcessExecutorDescribePlacement, type InProcessExecutorOptions, type JsonRpcMessage, type JsonRpcResponse, type KbGateResult, LocalHarness, type McpServer, type McpServerOptions, type McpToolDescriptor, type McpTransport, type RemoveWorktreeOptions, type ResearchOutputShape, type ResearchSource, type ResearcherDelegate, type SiblingSandboxExecutorOptions, type SubmitInput, type SubmitOutput, type TraceContext, type WorktreeHandle, captureWorktreeDiff, createDefaultCoderDelegate, createDelegateCodeHandler, createDelegateFeedbackHandler, createDelegateResearchHandler, createDelegationHistoryHandler, createDelegationStatusHandler, createFleetWorkspaceExecutor, createInProcessExecutor, createInProcessTransport, createKbGate, createMcpServer, createPropagatingTraceEmitter, createSiblingSandboxExecutor, createWorktree, detectExecutor, eventToSnapshot, hashIdempotencyInput, readTraceContextFromEnv, removeWorktree, runLocalHarness, traceContextToEnv, validateDelegateCodeArgs, validateDelegateFeedbackArgs, validateDelegateResearchArgs, validateDelegationHistoryArgs, validateDelegationStatusArgs };
+export { CoderDelegate, type CreateWorktreeOptions, DELEGATE_CODE_DESCRIPTION, DELEGATE_CODE_INPUT_SCHEMA, DELEGATE_CODE_TOOL_NAME, DELEGATE_FEEDBACK_DESCRIPTION, DELEGATE_FEEDBACK_INPUT_SCHEMA, DELEGATE_FEEDBACK_TOOL_NAME, DELEGATE_RESEARCH_DESCRIPTION, DELEGATE_RESEARCH_INPUT_SCHEMA, DELEGATE_RESEARCH_TOOL_NAME, DELEGATION_HISTORY_DESCRIPTION, DELEGATION_HISTORY_INPUT_SCHEMA, DELEGATION_HISTORY_TOOL_NAME, DELEGATION_STATUS_DESCRIPTION, DELEGATION_STATUS_INPUT_SCHEMA, DELEGATION_STATUS_TOOL_NAME, DelegateCodeArgs, DelegateCodeResult, DelegateFeedbackArgs, DelegateFeedbackResult, DelegateResearchArgs, DelegateResearchResult, DelegationError, DelegationExecutor, DelegationFeedbackSnapshot, DelegationHistoryArgs, DelegationHistoryEntry, DelegationHistoryResult, DelegationProfile, DelegationProgress, type DelegationRecord, DelegationResultPayload, DelegationStatus, DelegationStatusArgs, DelegationStatusResult, DelegationTaskQueue, type DelegationTaskQueueOptions, type DetectExecutorArgs, type DiffOptions, type DiffResult, type FeedbackEvent, type FeedbackStore, FleetHandle, type GitRunner, InMemoryFeedbackStore, type InProcessExecutorDescribePlacement, type InProcessExecutorOptions, type JsonRpcMessage, type JsonRpcResponse, LocalHarness, type McpServer, type McpServerOptions, type McpToolDescriptor, type McpTransport, type RemoveWorktreeOptions, ResearchSource, ResearcherDelegate, type SubmitInput, type SubmitOutput, type TraceContext, type WorktreeHandle, captureWorktreeDiff, createDelegateCodeHandler, createDelegateFeedbackHandler, createDelegateResearchHandler, createDelegationHistoryHandler, createDelegationStatusHandler, createInProcessExecutor, createInProcessTransport, createMcpServer, createPropagatingTraceEmitter, createWorktree, detectExecutor, eventToSnapshot, hashIdempotencyInput, readTraceContextFromEnv, removeWorktree, runLocalHarness, traceContextToEnv, validateDelegateCodeArgs, validateDelegateFeedbackArgs, validateDelegateResearchArgs, validateDelegationHistoryArgs, validateDelegationStatusArgs };

package/dist/mcp/index.js

@@ -1,21 +1,19 @@
 import {
   captureWorktreeDiff,
-  createDefaultCoderDelegate,
-  createFleetWorkspaceExecutor,
   createInProcessExecutor,
   createInProcessTransport,
   createMcpServer,
-  createSiblingSandboxExecutor,
   createWorktree,
   detectExecutor,
   removeWorktree
-} from "../chunk-NYGEI3NV.js";
+} from "../chunk-M65QJD35.js";
 import {
   buildLoopOtelSpans,
+  createKbGate,
   createOtelExporter,
   mcpToolsForRuntimeMcp,
   mcpToolsForRuntimeMcpSubset
-} from "../chunk-7ZECSZ3C.js";
+} from "../chunk-Z523NPJK.js";
 import {
   DELEGATE_CODE_DESCRIPTION,
   DELEGATE_CODE_INPUT_SCHEMA,
@@ -34,11 +32,14 @@ import {
   DELEGATION_STATUS_TOOL_NAME,
   DelegationTaskQueue,
   InMemoryFeedbackStore,
+  createDefaultCoderDelegate,
   createDelegateCodeHandler,
   createDelegateFeedbackHandler,
   createDelegateResearchHandler,
   createDelegationHistoryHandler,
   createDelegationStatusHandler,
+  createFleetWorkspaceExecutor,
+  createSiblingSandboxExecutor,
   eventToSnapshot,
   hashIdempotencyInput,
   validateDelegateCodeArgs,
@@ -46,7 +47,7 @@ import {
   validateDelegateResearchArgs,
   validateDelegationHistoryArgs,
   validateDelegationStatusArgs
-} from "../chunk-HSX6PFZR.js";
+} from "../chunk-V6GURW4W.js";
 import {
   runLocalHarness
 } from "../chunk-GLR25NG7.js";
@@ -56,62 +57,6 @@ import "../chunk-PY6NMZYX.js";
 import "../chunk-SQSCRJ7U.js";
 import "../chunk-DGUM43GV.js";
 
-// src/mcp/kb-gate.ts
-var norm = (s) => s.toLowerCase().replace(/\s+/g, " ").trim();
-function valueAppears(value, passageNorm) {
-  if (passageNorm.includes(norm(String(value)))) return true;
-  if (typeof value !== "number" || !Number.isFinite(value)) return false;
-  const forms = [value.toLocaleString("en-US")];
-  if (Math.abs(value) >= 1e9) forms.push(`${trimZero(value / 1e9)} billion`);
-  if (Math.abs(value) >= 1e6) forms.push(`${trimZero(value / 1e6)} million`);
-  return forms.some((f) => passageNorm.includes(norm(f)));
-}
-function trimZero(n) {
-  return Number.isInteger(n) ? String(n) : String(Number(n.toFixed(2)));
-}
-function builtinJudges(minPassageChars, selfArtifactKinds) {
-  const kinds = selfArtifactKinds.map((k) => k.toLowerCase());
-  return [
-    {
-      name: "passage-non-empty",
-      judge: (c) => c.verbatimPassage.trim().length >= minPassageChars ? { accept: true } : { accept: false, reason: `passage shorter than ${minPassageChars} chars` }
-    },
-    {
-      // THE anti-hallucination floor — the passage must literally be in the source.
-      name: "passage-present",
-      judge: (c) => norm(c.sourceText).includes(norm(c.verbatimPassage)) ? { accept: true } : { accept: false, reason: "verbatim passage not found in source (unbacked fact)" }
-    },
-    {
-      name: "value-in-passage",
-      judge: (c) => c.value === void 0 || valueAppears(c.value, norm(c.verbatimPassage)) ? { accept: true } : { accept: false, reason: `value ${JSON.stringify(c.value)} not present in passage` }
-    },
-    {
-      name: "no-circular-citation",
-      judge: (c) => {
-        if (!c.citation || kinds.length === 0) return { accept: true };
-        const cite = c.citation.toLowerCase();
-        const hit = kinds.find((k) => cite.includes(k));
-        return hit ? { accept: false, reason: `circular citation to self-generated artifact "${hit}"` } : { accept: true };
-      }
-    }
-  ];
-}
-function createKbGate(options = {}) {
-  const judges = [
-    ...builtinJudges(options.minPassageChars ?? 12, options.selfArtifactKinds ?? []),
-    ...options.judges ?? []
-  ];
-  return async (candidate) => {
-    for (const j of judges) {
-      const verdict = await j.judge(candidate);
-      if (!verdict.accept) {
-        return { accepted: false, vetoedBy: j.name, reason: verdict.reason };
-      }
-    }
-    return { accepted: true };
-  };
-}
-
 // src/mcp/trace-propagation.ts
 function readTraceContextFromEnv() {
   const traceId = process.env.TRACE_ID || generateTraceId();

package/dist/mcp/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/mcp/kb-gate.ts","../../src/mcp/trace-propagation.ts"],"sourcesContent":["/**\n * @experimental\n *\n * `createKbGate` — the valid-only knowledge-base growth gate, distilled from\n * physim's KB-research subsystem. A research-in-a-loop delegate (or any KB\n * writer) runs candidate facts through this before persisting, so the KB grows\n * with ONLY grounded facts — hallucinated, unsourced, or laundered claims are\n * vetoed at the gate.\n *\n * Fail-closed by construction: every judge must `accept`; the FIRST veto wins\n * and the fact is rejected. The non-negotiable floor (always on, can't be\n * disabled) is the **passage-present guard** — a fact's `verbatimPassage` MUST\n * literally appear in its `sourceText`. That single check kills the dominant\n * failure mode (a confident claim decoupled from any real source).\n *\n * Pure + dependency-free: it operates on fact candidates, not on a store, so it\n * composes with `@tangle-network/agent-knowledge` or any persistence layer\n * without importing it. The remediation policy (correct-on-veto vs\n * escalate-as-unverified) is the caller's — this returns the verdict; it never\n * drops a fact silently.\n */\n\n/** @experimental A fact proposed for the KB, with its grounding. */\nexport interface FactCandidate {\n  /** The atomic claim text. */\n  claim: string\n  /** Optional extracted value (number or string) the claim asserts. */\n  value?: string | number\n  /** Verbatim span lifted from the source that backs the claim. */\n  verbatimPassage: string\n  /** The raw source text the passage must be grounded in. */\n  sourceText: string\n  /** Where the fact claims to come from — checked for circular/self citations. */\n  citation?: string\n}\n\n/** @experimental */\nexport interface FactJudgeVerdict {\n  accept: boolean\n  reason?: string\n}\n\n/** @experimental A pluggable fact validator. Throw is NOT allowed — return a\n *  verdict; a thrown judge is a programmer error, not a veto. */\nexport interface FactJudge {\n  name: string\n  judge(candidate: FactCandidate): FactJudgeVerdict | Promise<FactJudgeVerdict>\n}\n\n/** @experimental */\nexport interface KbGateResult {\n  accepted: boolean\n  /** Name of the judge that vetoed; undefined when accepted. */\n  vetoedBy?: string\n  reason?: string\n}\n\n/** @experimental */\nexport interface CreateKbGateOptions {\n  /** Extra judges appended after the built-in floor (e.g. an LLM judge). */\n  judges?: FactJudge[]\n  /** Minimum verbatim-passage length. Default 12 — kills empty/stub passages. */\n  minPassageChars?: number\n  /**\n   * Citation tokens that denote a SELF-generated artifact (e.g. `'spec'`,\n   * `'cad_params'`, `'requirements'`). A citation naming one is circular\n   * (laundering) — the fact cites a derived artifact, not a real source.\n   * Default `[]` (no circular check unless the consumer declares its kinds).\n   */\n  selfArtifactKinds?: string[]\n}\n\nconst norm = (s: string): string => s.toLowerCase().replace(/\\s+/g, ' ').trim()\n\n/** Does `value` appear in the (normalized) passage — literally, comma-grouped,\n *  or in billion/million shorthand (the forms a source actually writes). */\nfunction valueAppears(value: string | number, passageNorm: string): boolean {\n  if (passageNorm.includes(norm(String(value)))) return true\n  if (typeof value !== 'number' || !Number.isFinite(value)) return false\n  const forms = [value.toLocaleString('en-US')]\n  if (Math.abs(value) >= 1e9) forms.push(`${trimZero(value / 1e9)} billion`)\n  if (Math.abs(value) >= 1e6) forms.push(`${trimZero(value / 1e6)} million`)\n  return forms.some((f) => passageNorm.includes(norm(f)))\n}\n\nfunction trimZero(n: number): string {\n  return Number.isInteger(n) ? String(n) : String(Number(n.toFixed(2)))\n}\n\n/** The always-on floor judges. Order matters: cheapest / most-fundamental first. */\nfunction builtinJudges(minPassageChars: number, selfArtifactKinds: string[]): FactJudge[] {\n  const kinds = selfArtifactKinds.map((k) => k.toLowerCase())\n  return [\n    {\n      name: 'passage-non-empty',\n      judge: (c) =>\n        c.verbatimPassage.trim().length >= minPassageChars\n          ? { accept: true }\n          : { accept: false, reason: `passage shorter than ${minPassageChars} chars` },\n    },\n    {\n      // THE anti-hallucination floor — the passage must literally be in the source.\n      name: 'passage-present',\n      judge: (c) =>\n        norm(c.sourceText).includes(norm(c.verbatimPassage))\n          ? { accept: true }\n          : { accept: false, reason: 'verbatim passage not found in source (unbacked fact)' },\n    },\n    {\n      name: 'value-in-passage',\n      judge: (c) =>\n        c.value === undefined || valueAppears(c.value, norm(c.verbatimPassage))\n          ? { accept: true }\n          : { accept: false, reason: `value ${JSON.stringify(c.value)} not present in passage` },\n    },\n    {\n      name: 'no-circular-citation',\n      judge: (c) => {\n        if (!c.citation || kinds.length === 0) return { accept: true }\n        const cite = c.citation.toLowerCase()\n        const hit = kinds.find((k) => cite.includes(k))\n        return hit\n          ? { accept: false, reason: `circular citation to self-generated artifact \"${hit}\"` }\n          : { accept: true }\n      },\n    },\n  ]\n}\n\n/**\n * @experimental\n *\n * Build a fail-closed KB gate. The returned function runs the built-in floor\n * (passage-non-empty → passage-present → value-in-passage → no-circular-citation)\n * then any consumer judges, returning on the first veto.\n */\nexport function createKbGate(\n  options: CreateKbGateOptions = {},\n): (candidate: FactCandidate) => Promise<KbGateResult> {\n  const judges = [\n    ...builtinJudges(options.minPassageChars ?? 12, options.selfArtifactKinds ?? []),\n    ...(options.judges ?? []),\n  ]\n  return async (candidate) => {\n    for (const j of judges) {\n      const verdict = await j.judge(candidate)\n      if (!verdict.accept) {\n        return { accepted: false, vetoedBy: j.name, reason: verdict.reason }\n      }\n    }\n    return { accepted: true }\n  }\n}\n","/**\n * @experimental\n *\n * Trace context propagation for MCP subprocess.\n *\n * When the MCP server is launched as a child process by a sandbox harness,\n * the parent passes trace context via environment variables:\n *\n *   TRACE_ID=<current-run-trace-id>\n *   PARENT_SPAN_ID=<span-that-dispatched-the-delegation>\n *\n * The MCP server reads these at startup and uses them as the root of its\n * internal trace tree. All spans emitted by `runLoop` invocations inside\n * the MCP are children of the parent's delegation span.\n *\n * When these env vars are absent, the MCP generates a fresh trace root —\n * the server operates standalone without trace joining.\n */\n\nimport type { LoopTraceEmitter, LoopTraceEvent } from '../loops/types'\nimport type { OtelExporter } from '../otel-export'\nimport { buildLoopOtelSpans, createOtelExporter } from '../otel-export'\n\nexport interface TraceContext {\n  /** Trace id inherited from the parent process, or a fresh one. */\n  traceId: string\n  /** Parent span id from the delegation that launched this MCP server. */\n  parentSpanId?: string\n}\n\n/**\n * Read trace context from the process environment.\n * Returns a context with inherited ids or a freshly generated root.\n */\nexport function readTraceContextFromEnv(): TraceContext {\n  const traceId = process.env.TRACE_ID || generateTraceId()\n  const parentSpanId = process.env.PARENT_SPAN_ID || undefined\n  return { traceId, parentSpanId }\n}\n\n/**\n * Create a LoopTraceEmitter that:\n *   1. Parents all spans under the inherited PARENT_SPAN_ID.\n *   2. Exports spans to OTEL when OTEL_EXPORTER_OTLP_ENDPOINT is set.\n *\n * Returns both the emitter and the optional exporter handle for shutdown.\n */\nexport function createPropagatingTraceEmitter(ctx: TraceContext): {\n  emitter: LoopTraceEmitter\n  exporter: OtelExporter | undefined\n  context: TraceContext\n} {\n  const exporter = createOtelExporter()\n\n  // Buffer events per loop run, then emit the full nested span tree on\n  // `loop.ended` so the topology hierarchy (loop → round → branch) reaches the\n  // OTLP collector — not a flat list of zero-duration point spans. A run that\n  // never reaches `loop.ended` (hard abort) drops its buffer; acceptable for\n  // the short-lived MCP subprocess.\n  const buffers = new Map<string, LoopTraceEvent[]>()\n\n  const emitter: LoopTraceEmitter = {\n    emit(event: LoopTraceEvent) {\n      if (!exporter) return\n      const buf = buffers.get(event.runId)\n      if (buf) buf.push(event)\n      else buffers.set(event.runId, [event])\n      if (event.kind === 'loop.ended') {\n        const events = buffers.get(event.runId) ?? [event]\n        buffers.delete(event.runId)\n        for (const span of buildLoopOtelSpans(events, ctx.traceId, ctx.parentSpanId)) {\n          exporter.exportSpan(span)\n        }\n      }\n    },\n  }\n\n  return { emitter, exporter, context: ctx }\n}\n\n/**\n * Build env vars to pass to a child MCP subprocess so it inherits the\n * current trace context.\n */\nexport function traceContextToEnv(ctx: TraceContext): Record<string, string> {\n  const env: Record<string, string> = { TRACE_ID: ctx.traceId }\n  if (ctx.parentSpanId) env.PARENT_SPAN_ID = ctx.parentSpanId\n  return env\n}\n\nfunction generateTraceId(): string {\n  const bytes = new Uint8Array(16)\n  if (typeof globalThis.crypto?.getRandomValues === 'function') {\n    globalThis.crypto.getRandomValues(bytes)\n  } else {\n    for (let i = 0; i < 16; 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"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwEA,IAAM,OAAO,CAAC,MAAsB,EAAE,YAAY,EAAE,QAAQ,QAAQ,GAAG,EAAE,KAAK;AAI9E,SAAS,aAAa,OAAwB,aAA8B;AAC1E,MAAI,YAAY,SAAS,KAAK,OAAO,KAAK,CAAC,CAAC,EAAG,QAAO;AACtD,MAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,EAAG,QAAO;AACjE,QAAM,QAAQ,CAAC,MAAM,eAAe,OAAO,CAAC;AAC5C,MAAI,KAAK,IAAI,KAAK,KAAK,IAAK,OAAM,KAAK,GAAG,SAAS,QAAQ,GAAG,CAAC,UAAU;AACzE,MAAI,KAAK,IAAI,KAAK,KAAK,IAAK,OAAM,KAAK,GAAG,SAAS,QAAQ,GAAG,CAAC,UAAU;AACzE,SAAO,MAAM,KAAK,CAAC,MAAM,YAAY,SAAS,KAAK,CAAC,CAAC,CAAC;AACxD;AAEA,SAAS,SAAS,GAAmB;AACnC,SAAO,OAAO,UAAU,CAAC,IAAI,OAAO,CAAC,IAAI,OAAO,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC;AACtE;AAGA,SAAS,cAAc,iBAAyB,mBAA0C;AACxF,QAAM,QAAQ,kBAAkB,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC;AAC1D,SAAO;AAAA,IACL;AAAA,MACE,MAAM;AAAA,MACN,OAAO,CAAC,MACN,EAAE,gBAAgB,KAAK,EAAE,UAAU,kBAC/B,EAAE,QAAQ,KAAK,IACf,EAAE,QAAQ,OAAO,QAAQ,wBAAwB,eAAe,SAAS;AAAA,IACjF;AAAA,IACA;AAAA;AAAA,MAEE,MAAM;AAAA,MACN,OAAO,CAAC,MACN,KAAK,EAAE,UAAU,EAAE,SAAS,KAAK,EAAE,eAAe,CAAC,IAC/C,EAAE,QAAQ,KAAK,IACf,EAAE,QAAQ,OAAO,QAAQ,uDAAuD;AAAA,IACxF;AAAA,IACA;AAAA,MACE,MAAM;AAAA,MACN,OAAO,CAAC,MACN,EAAE,UAAU,UAAa,aAAa,EAAE,OAAO,KAAK,EAAE,eAAe,CAAC,IAClE,EAAE,QAAQ,KAAK,IACf,EAAE,QAAQ,OAAO,QAAQ,SAAS,KAAK,UAAU,EAAE,KAAK,CAAC,0BAA0B;AAAA,IAC3F;AAAA,IACA;AAAA,MACE,MAAM;AAAA,MACN,OAAO,CAAC,MAAM;AACZ,YAAI,CAAC,EAAE,YAAY,MAAM,WAAW,EAAG,QAAO,EAAE,QAAQ,KAAK;AAC7D,cAAM,OAAO,EAAE,SAAS,YAAY;AACpC,cAAM,MAAM,MAAM,KAAK,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC;AAC9C,eAAO,MACH,EAAE,QAAQ,OAAO,QAAQ,iDAAiD,GAAG,IAAI,IACjF,EAAE,QAAQ,KAAK;AAAA,MACrB;AAAA,IACF;AAAA,EACF;AACF;AASO,SAAS,aACd,UAA+B,CAAC,GACqB;AACrD,QAAM,SAAS;AAAA,IACb,GAAG,cAAc,QAAQ,mBAAmB,IAAI,QAAQ,qBAAqB,CAAC,CAAC;AAAA,IAC/E,GAAI,QAAQ,UAAU,CAAC;AAAA,EACzB;AACA,SAAO,OAAO,cAAc;AAC1B,eAAW,KAAK,QAAQ;AACtB,YAAM,UAAU,MAAM,EAAE,MAAM,SAAS;AACvC,UAAI,CAAC,QAAQ,QAAQ;AACnB,eAAO,EAAE,UAAU,OAAO,UAAU,EAAE,MAAM,QAAQ,QAAQ,OAAO;AAAA,MACrE;AAAA,IACF;AACA,WAAO,EAAE,UAAU,KAAK;AAAA,EAC1B;AACF;;;ACtHO,SAAS,0BAAwC;AACtD,QAAM,UAAU,QAAQ,IAAI,YAAY,gBAAgB;AACxD,QAAM,eAAe,QAAQ,IAAI,kBAAkB;AACnD,SAAO,EAAE,SAAS,aAAa;AACjC;AASO,SAAS,8BAA8B,KAI5C;AACA,QAAM,WAAW,mBAAmB;AAOpC,QAAM,UAAU,oBAAI,IAA8B;AAElD,QAAM,UAA4B;AAAA,IAChC,KAAK,OAAuB;AAC1B,UAAI,CAAC,SAAU;AACf,YAAM,MAAM,QAAQ,IAAI,MAAM,KAAK;AACnC,UAAI,IAAK,KAAI,KAAK,KAAK;AAAA,UAClB,SAAQ,IAAI,MAAM,OAAO,CAAC,KAAK,CAAC;AACrC,UAAI,MAAM,SAAS,cAAc;AAC/B,cAAM,SAAS,QAAQ,IAAI,MAAM,KAAK,KAAK,CAAC,KAAK;AACjD,gBAAQ,OAAO,MAAM,KAAK;AAC1B,mBAAW,QAAQ,mBAAmB,QAAQ,IAAI,SAAS,IAAI,YAAY,GAAG;AAC5E,mBAAS,WAAW,IAAI;AAAA,QAC1B;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO,EAAE,SAAS,UAAU,SAAS,IAAI;AAC3C;AAMO,SAAS,kBAAkB,KAA2C;AAC3E,QAAM,MAA8B,EAAE,UAAU,IAAI,QAAQ;AAC5D,MAAI,IAAI,aAAc,KAAI,iBAAiB,IAAI;AAC/C,SAAO;AACT;AAEA,SAAS,kBAA0B;AACjC,QAAM,QAAQ,IAAI,WAAW,EAAE;AAC/B,MAAI,OAAO,WAAW,QAAQ,oBAAoB,YAAY;AAC5D,eAAW,OAAO,gBAAgB,KAAK;AAAA,EACzC,OAAO;AACL,aAAS,IAAI,GAAG,IAAI,IAAI,IAAK,OAAM,CAAC,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI,GAAG;AAAA,EACxE;AACA,SAAO,MAAM,KAAK,KAAK,EACpB,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EAC1C,KAAK,EAAE;AACZ;","names":[]}
+{"version":3,"sources":["../../src/mcp/trace-propagation.ts"],"sourcesContent":["/**\n * @experimental\n *\n * Trace context propagation for MCP subprocess.\n *\n * When the MCP server is launched as a child process by a sandbox harness,\n * the parent passes trace context via environment variables:\n *\n *   TRACE_ID=<current-run-trace-id>\n *   PARENT_SPAN_ID=<span-that-dispatched-the-delegation>\n *\n * The MCP server reads these at startup and uses them as the root of its\n * internal trace tree. All spans emitted by `runLoop` invocations inside\n * the MCP are children of the parent's delegation span.\n *\n * When these env vars are absent, the MCP generates a fresh trace root —\n * the server operates standalone without trace joining.\n */\n\nimport type { LoopTraceEmitter, LoopTraceEvent } from '../loops/types'\nimport type { OtelExporter } from '../otel-export'\nimport { buildLoopOtelSpans, createOtelExporter } from '../otel-export'\n\nexport interface TraceContext {\n  /** Trace id inherited from the parent process, or a fresh one. */\n  traceId: string\n  /** Parent span id from the delegation that launched this MCP server. */\n  parentSpanId?: string\n}\n\n/**\n * Read trace context from the process environment.\n * Returns a context with inherited ids or a freshly generated root.\n */\nexport function readTraceContextFromEnv(): TraceContext {\n  const traceId = process.env.TRACE_ID || generateTraceId()\n  const parentSpanId = process.env.PARENT_SPAN_ID || undefined\n  return { traceId, parentSpanId }\n}\n\n/**\n * Create a LoopTraceEmitter that:\n *   1. Parents all spans under the inherited PARENT_SPAN_ID.\n *   2. Exports spans to OTEL when OTEL_EXPORTER_OTLP_ENDPOINT is set.\n *\n * Returns both the emitter and the optional exporter handle for shutdown.\n */\nexport function createPropagatingTraceEmitter(ctx: TraceContext): {\n  emitter: LoopTraceEmitter\n  exporter: OtelExporter | undefined\n  context: TraceContext\n} {\n  const exporter = createOtelExporter()\n\n  // Buffer events per loop run, then emit the full nested span tree on\n  // `loop.ended` so the topology hierarchy (loop → round → branch) reaches the\n  // OTLP collector — not a flat list of zero-duration point spans. A run that\n  // never reaches `loop.ended` (hard abort) drops its buffer; acceptable for\n  // the short-lived MCP subprocess.\n  const buffers = new Map<string, LoopTraceEvent[]>()\n\n  const emitter: LoopTraceEmitter = {\n    emit(event: LoopTraceEvent) {\n      if (!exporter) return\n      const buf = buffers.get(event.runId)\n      if (buf) buf.push(event)\n      else buffers.set(event.runId, [event])\n      if (event.kind === 'loop.ended') {\n        const events = buffers.get(event.runId) ?? [event]\n        buffers.delete(event.runId)\n        for (const span of buildLoopOtelSpans(events, ctx.traceId, ctx.parentSpanId)) {\n          exporter.exportSpan(span)\n        }\n      }\n    },\n  }\n\n  return { emitter, exporter, context: ctx }\n}\n\n/**\n * Build env vars to pass to a child MCP subprocess so it inherits the\n * current trace context.\n */\nexport function traceContextToEnv(ctx: TraceContext): Record<string, string> {\n  const env: Record<string, string> = { TRACE_ID: ctx.traceId }\n  if (ctx.parentSpanId) env.PARENT_SPAN_ID = ctx.parentSpanId\n  return env\n}\n\nfunction generateTraceId(): string {\n  const bytes = new Uint8Array(16)\n  if (typeof globalThis.crypto?.getRandomValues === 'function') {\n    globalThis.crypto.getRandomValues(bytes)\n  } else {\n    for (let i = 0; i < 16; 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"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkCO,SAAS,0BAAwC;AACtD,QAAM,UAAU,QAAQ,IAAI,YAAY,gBAAgB;AACxD,QAAM,eAAe,QAAQ,IAAI,kBAAkB;AACnD,SAAO,EAAE,SAAS,aAAa;AACjC;AASO,SAAS,8BAA8B,KAI5C;AACA,QAAM,WAAW,mBAAmB;AAOpC,QAAM,UAAU,oBAAI,IAA8B;AAElD,QAAM,UAA4B;AAAA,IAChC,KAAK,OAAuB;AAC1B,UAAI,CAAC,SAAU;AACf,YAAM,MAAM,QAAQ,IAAI,MAAM,KAAK;AACnC,UAAI,IAAK,KAAI,KAAK,KAAK;AAAA,UAClB,SAAQ,IAAI,MAAM,OAAO,CAAC,KAAK,CAAC;AACrC,UAAI,MAAM,SAAS,cAAc;AAC/B,cAAM,SAAS,QAAQ,IAAI,MAAM,KAAK,KAAK,CAAC,KAAK;AACjD,gBAAQ,OAAO,MAAM,KAAK;AAC1B,mBAAW,QAAQ,mBAAmB,QAAQ,IAAI,SAAS,IAAI,YAAY,GAAG;AAC5E,mBAAS,WAAW,IAAI;AAAA,QAC1B;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO,EAAE,SAAS,UAAU,SAAS,IAAI;AAC3C;AAMO,SAAS,kBAAkB,KAA2C;AAC3E,QAAM,MAA8B,EAAE,UAAU,IAAI,QAAQ;AAC5D,MAAI,IAAI,aAAc,KAAI,iBAAiB,IAAI;AAC/C,SAAO;AACT;AAEA,SAAS,kBAA0B;AACjC,QAAM,QAAQ,IAAI,WAAW,EAAE;AAC/B,MAAI,OAAO,WAAW,QAAQ,oBAAoB,YAAY;AAC5D,eAAW,OAAO,gBAAgB,KAAK;AAAA,EACzC,OAAO;AACL,aAAS,IAAI,GAAG,IAAI,IAAI,IAAK,OAAM,CAAC,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI,GAAG;AAAA,EACxE;AACA,SAAO,MAAM,KAAK,KAAK,EACpB,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EAC1C,KAAK,EAAE;AACZ;","names":[]}