@tangle-network/agent-runtime 0.324.0 → 0.325.0

package/dist/graph-Cuz6Ubzd.js

@@ -0,0 +1,348 @@
+import { $i as InMemorySpawnJournal, Qi as InMemoryResultBlobStore, Xi as FileResultBlobStore, Zi as FileSpawnJournal } from "./supervisor-fq4JGynd.js";
+import { i as ConfigError, m as ValidationError } from "./errors-DodWX-cb.js";
+import { v as harnessRunsAgent } from "./model-policy-CyCUwHed.js";
+import { t as composeRuntimeHooks } from "./runtime-hooks-tXpAarhW.js";
+import { T as withRunContext } from "./coordination-driver-DkkUVe9g.js";
+import { M as kernelPromptRegistry, S as createGraphOverlay, T as validateGraphTopology, n as profileGuidanceComposer, o as superviseWithTestBrain, r as supervise, w as graphRootProfile } from "./supervise-BlaB4CeL.js";
+import { canonicalCandidateDigest } from "@tangle-network/agent-interface";
+import { resolve } from "node:path";
+//#region src/runtime/supervise/graph.ts
+/**
+*
+* `runGraph` — agent graphs: profiles as nodes, registry-backed prompt directives as edges.
+*
+* A topology is PLAIN DATA an agent can author in a few lines: nodes are canonical
+* `AgentProfile`s (the ONLY way a node is described — no role-builder functions), edges are typed
+* values carrying versioned {@link PromptHandle} directives, `deliverable` (termination) and
+* `budget` (one conserved pool) are mandatory. Driver↔worker is the two-node cyclic instance;
+* "agent 3 analyzes 1 and 2 and reports to 1" is ONE edge, not a framework.
+*
+* NOT A SECOND SCHEDULER. `runGraph` is an interpretation layer over what already runs:
+* `supervise()` is the execution core — the same `supervisorAgent`/`driverAgent` machinery,
+* backend-derived worker path (authorized, classified, recursive), conserved-pool budget, and
+* deliverable-gated settlement every
+* supervised run uses. (`runAgentRounds` is deliberately NOT the substrate here.) What the graph
+* layer ADDS is exactly what a bespoke driver loop never
+* had:
+*
+*  1. **Node pinning** — a spawn names a node (`profile.name` = node id) and the node's canonical
+*     profile is what runs; a driver cannot smuggle capabilities into a worker it did not define.
+*  2. **Observable edges** — every delegates/analyzes traversal lands in an EDGE LEDGER
+*     (`delivered | stripped | empty | unpropagated`, with byte counts), in memory on
+*     the result AND as `edge` events in the run journal. The motivating incident: a filter
+*     silently replaced 1,700-char steering with 241 chars of boilerplate for three rounds and
+*     NO artifact said so — an unobservable edge cannot be trusted and its directive cannot be
+*     optimized.
+*  3. **Directives as data** — edge text lives in the prompt registry (`<surface>/v<n>`), so every
+*     edge is a versioned optimization target, never prose hardcoded in a builder function.
+*  4. **Per-edge traversal caps** — the cyclic-graph backstop. A delegates edge whose cap is
+*     exhausted REFUSES further traversals (fail loud), so a cycle cannot spin the pool dry.
+*  5. **Continuity as data** — a delegates edge may declare `continuity: 'resume'`, so each spawn
+*     after the node's first re-attaches to its latest SETTLED session (the spawn context hands
+*     the executor seam `resume: { ofWorker, sequence }`; the kernel keeps identity, ordering,
+*     ledger truth, and the one conserved pool). Every ledger row states how its hop continued:
+*     `'fresh' | 'resume'` for spawns, `'steer'` for mid-run deliveries — fresh respawns, session
+*     resumes, and live steers are all plain data, each a ledgered fact.
+*
+* ORACLES ARE ENVIRONMENT, NEVER WORKERS. Graders/verifiers must not be spawnable in the graph —
+* a delegates edge to them leaks the rubric. An `analyzes` edge names its analyst in one of two
+* forms: a LENS id from the environment's registry (a pure function over trace evidence), or the
+* id of a graph NODE — a tool-equipped analyst AGENT spawned on each matching settle with the
+* node's pinned profile, whose settle output IS the findings. Either way the oracle doctrine
+* holds: an analyst node can never be a delegates target (refused loudly), so no driver can hand
+* it work, and an id living in both the registry and the nodes is refused as ambiguous.
+*
+* @experimental
+*/
+/** A delegates edge exhausted its traversal cap and the run produced no winner: the cap, not the
+*  task, ended it. Carries the full evidence so failing loud loses nothing. */
+var GraphEdgeCapError = class extends Error {
+	exhaustedEdges;
+	ledger;
+	result;
+	constructor(exhaustedEdges, ledger, result) {
+		super(`runGraph: edge traversal cap exhausted on ${exhaustedEdges.join(", ")} and the run delivered no winner — the cap (the cyclic-graph backstop), not the task, ended this run. Raise maxTraversals on the edge or fix the cycle; the full edge ledger and the supervised result ride on this error.`);
+		this.name = "GraphEdgeCapError";
+		this.exhaustedEdges = exhaustedEdges;
+		this.ledger = ledger;
+		this.result = result;
+	}
+};
+/**
+* Every `SuperviseOptions` key, partitioned by what `runGraph` does with it.
+*
+* `runGraph` starts one `supervise()` run, so every option that run honors is a graph option too
+* unless the graph itself owns the value. This used to be an opt-in list written by hand, and the
+* hand lost: 25 of 49 keys never reached `supervise()` from a graph, including `childSettleGraceMs`
+* (a root-driver failure tore down children that had ALREADY computed the deliverable) and
+* `driverRetry` (agent-runtime#963). Each absence was discovered by losing a run.
+*
+* The four lists below must cover `keyof SuperviseOptions` exactly. `everySuperviseOptionIsClassified`
+* below fails to COMPILE, naming the offender, when a key belongs to none of them — so the next
+* option added to `supervise()` cannot go missing here silently. It has to be classified, and
+* classifying it as forwarded is one word.
+*/
+/** The graph derives these from the `AgentGraph` itself; a caller value would be overwritten. */
+const GRAPH_OWNED_SUPERVISE_OPTIONS = [
+	"rootDriverFromBackend",
+	"resolveSpawnProfile",
+	"budget",
+	"deliverable",
+	"makeWorkerAgent",
+	"onCoordinationEvent",
+	"analyzeOnSettle",
+	"continuityByProfile",
+	"inheritSpawnRights"
+];
+/** Caller-facing on `RunGraphOptions`, but the graph wraps or defaults the value before it goes in:
+*  `hooks` composes with the graph's own spawn-binding hook, `authorizeMessage` is wrapped so a
+*  narrowed instruction ledgers `stripped`, `authorizeSpawn` runs AFTER the graph has pinned the
+*  node (so a product sees the canonical profile, never the driver's stub), `makeLeafAgent` is the
+*  caller's leaf override slotted under the graph's pinning, `analysts` rides only with analyze
+*  routes, and `journal`/`blobs`/`runId` get graph defaults. */
+const GRAPH_TRANSFORMED_SUPERVISE_OPTIONS = [
+	"hooks",
+	"authorizeMessage",
+	"authorizeSpawn",
+	"makeLeafAgent",
+	"analysts",
+	"journal",
+	"blobs",
+	"runId"
+];
+/** Not reachable from a graph, with the reason. `registry` is a NAME COLLISION, not a policy:
+*  `RunGraphOptions.registry` is the directive `PromptRegistry` and `SuperviseOptions.registry` is
+*  the `SuperviseRegistry` name→value table. Two different types under one name; the graph's wins.
+*  Giving the supervise one a graph channel means renaming a public option, so it is recorded here
+*  rather than silently dropped. */
+const GRAPH_REFUSED_SUPERVISE_OPTIONS = ["registry"];
+/**
+* Forwarded to the root `supervise()` VERBATIM. Everything not owned, transformed, or refused
+* above belongs here — the default is "a graph honors it", not "someone remembered to add it".
+*/
+const GRAPH_FORWARDED_SUPERVISE_OPTIONS = [
+	"backend",
+	"profileGuidance",
+	"escalateQuestion",
+	"rootHandle",
+	"signal",
+	"execution",
+	"resolveDeliverable",
+	"coordination",
+	"peerMail",
+	"peerAudit",
+	"traceTools",
+	"driverBackend",
+	"profileSecurity",
+	"authorizeSpawn",
+	"router",
+	"driveHarness",
+	"selectSeat",
+	"driverRetry",
+	"onDriverAttempt",
+	"workerRetry",
+	"onWorkerRetry",
+	"continuation",
+	"childSettleGraceMs",
+	"teardownConfirmMs",
+	"retainedAtSettlement",
+	"resolveDriveHarness",
+	"driveHarnessMaterialization",
+	"resolveSupervisorTools",
+	"extraTools",
+	"executeExtraTool",
+	"recoverExecutor",
+	"perWorker",
+	"reservationPolicy",
+	"deadlineCheckIn",
+	"workerSlots",
+	"watchWorkers",
+	"stallAfterMs",
+	"wake",
+	"runDir",
+	"resume",
+	"segment",
+	"runContext",
+	"steerDir",
+	"stopRule",
+	"onProgressStop",
+	"maxDepth",
+	"maxTurns",
+	"compaction",
+	"now",
+	"allowedModels",
+	"finalizer",
+	"otel",
+	"graphRegistry"
+];
+/**
+* Every key `RunGraphOptions` accepts, as data: the forwarded and transformed `SuperviseOptions`
+* keys, the name-colliding `registry`, and the graph's own `brain`. `GRAPH_OWNED_SUPERVISE_OPTIONS`
+* is deliberately absent — a caller value for one of those is overwritten by the graph, so it is
+* refused by name rather than discarded.
+*
+* The assignment below fails to COMPILE, naming the key, when `RunGraphOptions` declares something
+* this list does not carry.
+*/
+const runGraphOptionKeys = [
+	...GRAPH_FORWARDED_SUPERVISE_OPTIONS,
+	...GRAPH_TRANSFORMED_SUPERVISE_OPTIONS,
+	...GRAPH_REFUSED_SUPERVISE_OPTIONS,
+	"brain"
+];
+const runGraphOptionKeySet = new Set(runGraphOptionKeys);
+const graphOwnedOptionKeySet = new Set(GRAPH_OWNED_SUPERVISE_OPTIONS);
+/**
+* Refuse an option key the graph would not read, naming it and saying which kind it is.
+*
+* A graph-owned key is the sharper case: it type-checks against a widened `SuperviseOptions`
+* value, the graph derives its own value and overwrites the caller's, the run succeeds, and the
+* capability the caller asked for is not there. The rename of the leaf seam from `makeWorkerAgent`
+* to `makeLeafAgent` is the shape of the failure — the old name stayed a valid `SuperviseOptions`
+* key AND a graph-owned one, so a caller that kept passing it got a run with no leaf override and
+* no complaint.
+*/
+function assertRunGraphOptionKeys(opts) {
+	const graphOwned = [];
+	const unknown = [];
+	for (const key of Object.keys(opts)) {
+		if (runGraphOptionKeySet.has(key)) continue;
+		if (graphOwnedOptionKeySet.has(key)) graphOwned.push(key);
+		else unknown.push(key);
+	}
+	if (graphOwned.length > 0) throw new ConfigError(`runGraph: ${graphOwned.sort().join(", ")} — the graph derives this from the AgentGraph itself, so a caller value is overwritten and the capability it asks for would silently be absent`);
+	if (unknown.length > 0) throw new ConfigError(`runGraph: unknown option ${unknown.sort().join(", ")} — no reader consults that name, so the value would be discarded and the capability it asks for would silently be absent`);
+}
+/** Copy every forwarded option the caller actually set. Absent stays absent: `supervise()` and the
+*  graph must not disagree about what "unset" means. */
+function forwardedSuperviseOptions(opts) {
+	const forwarded = {};
+	for (const key of GRAPH_FORWARDED_SUPERVISE_OPTIONS) {
+		const value = opts[key];
+		if (value !== void 0) forwarded[key] = value;
+	}
+	return forwarded;
+}
+/** Validate the graph and resolve every directive BEFORE any compute is spent — an invalid
+*  topology or an unknown directive is a configuration fault, never a mid-run surprise. */
+function validateGraph(graph, registry, analysts) {
+	if (!Array.isArray(graph.nodes) || graph.nodes.length === 0) throw new ValidationError("runGraph: graph.nodes must be a non-empty array");
+	if (!Array.isArray(graph.edges) || graph.edges.length === 0) throw new ValidationError("runGraph: graph.edges must be a non-empty array");
+	if (typeof graph.deliverable?.check !== "function") throw new ValidationError("runGraph: graph.deliverable is mandatory (termination oracle)");
+	if (typeof graph.budget !== "object" || graph.budget === null) throw new ValidationError("runGraph: graph.budget is mandatory (the conserved pool)");
+	return validateGraphTopology(graph.nodes, graph.edges, registry, analysts);
+}
+/**
+* Execute an {@link AgentGraph}. The root node becomes the supervisor (`supervise()` — the
+* execution core), each worker node is spawnable BY NODE ID (`spawn_worker` with
+* `profile: { name: '<node id>' }`; the node's canonical profile is pinned by the graph), each
+* delegates directive is appended to the worker profile's `prompt.instructions` per traversal,
+* and each analyzes edge becomes an analyst-on-settle route with a real DESTINATION. Every
+* traversal is ledgered and journaled.
+*/
+function runGraph(graph, opts) {
+	const { brain, ...runtimeOptions } = opts;
+	return superviseAgentGraph(graph, runtimeOptions, brain);
+}
+/** Alias for graph tests written before `RunGraphOptions.brain` was production. The production
+*  entry accepts the same shape; this wrapper only keeps the `/testing` import path working. */
+function runGraphWithTestBrain(graph, opts) {
+	const { brain, ...runtimeOptions } = opts;
+	return superviseAgentGraph(graph, runtimeOptions, brain);
+}
+/**
+* The graph supervise run, as its own entry: the engine's `run-graph` preset node executes exactly
+* this, so the preset and `runGraph` are the same code path by construction (agent-runtime#982).
+*/
+/**
+* Every refusal a graph earns before any compute, in one place: the authoring contract. `runGraph`
+* calls it FIRST so a malformed graph throws synchronously, exactly as it did before the engine
+* preset (agent-runtime#982) moved execution behind a promise.
+*/
+function assertRunGraphAuthoring(graph, opts, brain) {
+	assertRunGraphOptionKeys(opts);
+	const validated = validateGraph(graph, opts.registry ?? kernelPromptRegistry(), opts.analysts);
+	const { root } = validated;
+	if (brain && opts.driverBackend) throw new ValidationError("runGraph: brain and driverBackend are mutually exclusive — a caller brain makes the root model calls, a driverBackend places a harness that makes its own");
+	if (brain && harnessRunsAgent(root.profile.harness)) throw new ValidationError(`runGraph: root node '${root.id}' declares harness '${root.profile.harness}', so the harness drives it — a caller brain applies only to a router-brained root (profile.harness omitted or 'cli-base')`);
+	if (!opts.backend && !opts.makeLeafAgent) throw new ValidationError("runGraph: provide opts.backend (where nodes run) or opts.makeLeafAgent");
+	return validated;
+}
+function superviseAgentGraph(graph, opts, brain) {
+	const registry = opts.registry ?? kernelPromptRegistry();
+	if (opts.runContext?.acquire !== void 0) return withRunContext(opts.runContext, opts.signal, (runContext, signal) => superviseAgentGraph(graph, {
+		...opts,
+		runContext,
+		...signal === void 0 ? {} : { signal }
+	}, brain));
+	const validated = assertRunGraphAuthoring(graph, opts, brain);
+	const { root } = validated;
+	const journal = opts.journal ?? opts.runContext?.journal ?? (opts.runDir !== void 0 ? new FileSpawnJournal(`${resolve(opts.runDir)}/spawn-journal.jsonl`) : new InMemorySpawnJournal());
+	const blobs = opts.blobs ?? opts.runContext?.blobs ?? (opts.runDir !== void 0 ? new FileResultBlobStore(`${resolve(opts.runDir)}/blobs`) : new InMemoryResultBlobStore());
+	const runId = opts.runId ?? opts.runContext?.runId ?? `graph-${canonicalCandidateDigest(graph.nodes.map((n) => n.id)).slice(7, 19)}`;
+	const now = opts.now ?? Date.now;
+	const guidance = profileGuidanceComposer(opts.profileGuidance);
+	const overlay = createGraphOverlay(validated, {
+		registry,
+		journal,
+		runId,
+		now,
+		...guidance ? { guidance } : {},
+		...opts.authorizeSpawn ? { authorizeSpawn: opts.authorizeSpawn } : {}
+	});
+	const callerAuthorizeMessage = opts.authorizeMessage;
+	const authorizeMessage = overlay.observeMessages((input) => callerAuthorizeMessage ? callerAuthorizeMessage(input) : { instruction: input.instruction });
+	const hooks = composeRuntimeHooks({ onEvent: (event) => {
+		if (event.target !== "agent.spawn" || event.phase !== "after") return;
+		const payload = event.payload;
+		if (typeof payload?.childId !== "string" || typeof payload.assignmentId !== "string") return;
+		return overlay.bindSpawn(event.parentId, payload.assignmentId, payload.childId);
+	} }, opts.hooks);
+	const rootProfile = graphRootProfile(validated, registry);
+	const start = async () => {
+		const superviseOptions = {
+			...forwardedSuperviseOptions(opts),
+			rootDriverFromBackend: false,
+			budget: graph.budget,
+			deliverable: graph.deliverable,
+			authorizeSpawn: overlay.authorizeSpawn,
+			resolveSpawnProfile: overlay.resolveSpawnProfile,
+			inheritSpawnRights: false,
+			...opts.makeLeafAgent ? { makeLeafAgent: opts.makeLeafAgent } : {},
+			journal,
+			blobs,
+			runId,
+			hooks,
+			onCoordinationEvent: async (_context, _eventId, record) => overlay.onCoordinationEvent(record.event),
+			...overlay.routes.length > 0 ? {
+				analyzeOnSettle: overlay.routes,
+				...opts.analysts ? { analysts: opts.analysts } : {}
+			} : {},
+			...Object.keys(overlay.continuityByProfile).length > 0 ? { continuityByProfile: overlay.continuityByProfile } : {},
+			authorizeMessage
+		};
+		const result = brain === void 0 ? await supervise(rootProfile, graphTask(graph, root), superviseOptions) : await superviseWithTestBrain(rootProfile, graphTask(graph, root), {
+			...superviseOptions,
+			brain
+		});
+		const { ledger, exhaustedEdges, exhaustedDelegates } = await overlay.settle();
+		const lifecycleEnded = result.kind === "no-winner" && (result.reason === "aborted" || result.reason === "cancelled" || result.reason === "budget-exhausted");
+		if (result.kind !== "winner" && !lifecycleEnded && exhaustedDelegates.length > 0) throw new GraphEdgeCapError(exhaustedDelegates, ledger, result);
+		return {
+			result,
+			ledger,
+			exhaustedEdges,
+			runId
+		};
+	};
+	return start();
+}
+/** The root task: the graph's own framing. The deliverable (mandatory) is the termination; the
+*  task names what the topology exists to produce. */
+function graphTask(graph, root) {
+	return graph.deliverable.describe ?? `Deliver the graph's deliverable by driving your worker nodes (root: '${root.id}').`;
+}
+//#endregion
+export { superviseAgentGraph as i, runGraph as n, runGraphWithTestBrain as r, GraphEdgeCapError as t };
+
+//# sourceMappingURL=graph-Cuz6Ubzd.js.map

package/dist/graph-Cuz6Ubzd.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-Cuz6Ubzd.js","names":[],"sources":["../src/runtime/supervise/graph.ts"],"sourcesContent":["/**\n *\n * `runGraph` — agent graphs: profiles as nodes, registry-backed prompt directives as edges.\n *\n * A topology is PLAIN DATA an agent can author in a few lines: nodes are canonical\n * `AgentProfile`s (the ONLY way a node is described — no role-builder functions), edges are typed\n * values carrying versioned {@link PromptHandle} directives, `deliverable` (termination) and\n * `budget` (one conserved pool) are mandatory. Driver↔worker is the two-node cyclic instance;\n * \"agent 3 analyzes 1 and 2 and reports to 1\" is ONE edge, not a framework.\n *\n * NOT A SECOND SCHEDULER. `runGraph` is an interpretation layer over what already runs:\n * `supervise()` is the execution core — the same `supervisorAgent`/`driverAgent` machinery,\n * backend-derived worker path (authorized, classified, recursive), conserved-pool budget, and\n * deliverable-gated settlement every\n * supervised run uses. (`runAgentRounds` is deliberately NOT the substrate here.) What the graph\n * layer ADDS is exactly what a bespoke driver loop never\n * had:\n *\n *  1. **Node pinning** — a spawn names a node (`profile.name` = node id) and the node's canonical\n *     profile is what runs; a driver cannot smuggle capabilities into a worker it did not define.\n *  2. **Observable edges** — every delegates/analyzes traversal lands in an EDGE LEDGER\n *     (`delivered | stripped | empty | unpropagated`, with byte counts), in memory on\n *     the result AND as `edge` events in the run journal. The motivating incident: a filter\n *     silently replaced 1,700-char steering with 241 chars of boilerplate for three rounds and\n *     NO artifact said so — an unobservable edge cannot be trusted and its directive cannot be\n *     optimized.\n *  3. **Directives as data** — edge text lives in the prompt registry (`<surface>/v<n>`), so every\n *     edge is a versioned optimization target, never prose hardcoded in a builder function.\n *  4. **Per-edge traversal caps** — the cyclic-graph backstop. A delegates edge whose cap is\n *     exhausted REFUSES further traversals (fail loud), so a cycle cannot spin the pool dry.\n *  5. **Continuity as data** — a delegates edge may declare `continuity: 'resume'`, so each spawn\n *     after the node's first re-attaches to its latest SETTLED session (the spawn context hands\n *     the executor seam `resume: { ofWorker, sequence }`; the kernel keeps identity, ordering,\n *     ledger truth, and the one conserved pool). Every ledger row states how its hop continued:\n *     `'fresh' | 'resume'` for spawns, `'steer'` for mid-run deliveries — fresh respawns, session\n *     resumes, and live steers are all plain data, each a ledgered fact.\n *\n * ORACLES ARE ENVIRONMENT, NEVER WORKERS. Graders/verifiers must not be spawnable in the graph —\n * a delegates edge to them leaks the rubric. An `analyzes` edge names its analyst in one of two\n * forms: a LENS id from the environment's registry (a pure function over trace evidence), or the\n * id of a graph NODE — a tool-equipped analyst AGENT spawned on each matching settle with the\n * node's pinned profile, whose settle output IS the findings. Either way the oracle doctrine\n * holds: an analyst node can never be a delegates target (refused loudly), so no driver can hand\n * it work, and an id living in both the registry and the nodes is refused as ambiguous.\n *\n * @experimental\n */\n\nimport { resolve } from 'node:path'\nimport { type AgentProfile, canonicalCandidateDigest } from '@tangle-network/agent-interface'\nimport {\n  FileResultBlobStore,\n  FileSpawnJournal,\n  InMemoryResultBlobStore,\n  InMemorySpawnJournal,\n} from '../../durable/spawn-journal'\nimport { ConfigError, ValidationError } from '../../errors'\nimport type { AnalystRegistry, ContinuityMode, MakeWorkerAgent } from '../../mcp/tools/coordination'\nimport { composeRuntimeHooks, type RuntimeHooks } from '../../runtime-hooks'\nimport { harnessRunsAgent } from '../harness-role'\nimport type { ToolLoopChat } from '../tool-loop'\nimport type { DeliverableSpec } from './completion-gate'\nimport {\n  createGraphOverlay,\n  graphRootProfile,\n  type ValidatedGraph,\n  validateGraphTopology,\n} from './graph-overlay'\nimport { kernelPromptRegistry, type PromptHandle, type PromptRegistry } from './prompt-registry'\nimport { withRunContext } from './run-context'\nimport {\n  profileGuidanceComposer,\n  type SuperviseOptions,\n  supervise,\n  superviseWithTestBrain,\n} from './supervise'\nimport type { Budget, NodeId, ResultBlobStore, SpawnJournal, SupervisedResult } from './types'\n\nexport { defaultEdgeTraversalCap } from './graph-overlay'\n\n// ── The algebra ────────────────────────────────────────────────────────────────\n\n/** A graph node: an id and a canonical `AgentProfile`. The profile is the ONLY way a node is\n *  described — its `prompt.systemPrompt` is the standing role (the 0.117 canonical resolution;\n *  never a legacy top-level-only reduction), its tools/mcp/resources are its capabilities. */\nexport interface GraphNode {\n  readonly id: NodeId\n  readonly profile: AgentProfile\n}\n\nexport type GraphEdge =\n  /** Work flows down. The delegation directive is DATA → versionable, sweepable, optimizable.\n   *  Each spawn of `to` by `from` — and each mid-run steer from `from` to a live `to` worker —\n   *  is one traversal. */\n  | {\n      readonly kind: 'delegates'\n      readonly from: NodeId\n      readonly to: NodeId\n      readonly directive: PromptHandle\n      /** Cyclic-graph backstop: traversals beyond this REFUSE (fail loud). Default\n       *  {@link defaultEdgeTraversalCap}. */\n      readonly maxTraversals?: number\n      /** Default continuity for this edge's SPAWN traversals. `'resume'` makes every spawn after\n       *  the node's first re-attach to its most recent SETTLED worker: a NEW live worker whose\n       *  spawn context carries `resume: { ofWorker, sequence }` for the executor seam, spending\n       *  from the same conserved pool — the node's first spawn is effectively `'fresh'`, and a\n       *  spawn while a prior worker is still live refuses loudly (steer is the live channel).\n       *  The driver's per-call `spawn_worker` `continuity` argument overrides either way. Omit =\n       *  `'fresh'` (today's behavior, byte-identical). Caps count resumes exactly like fresh\n       *  spawns. */\n      readonly continuity?: ContinuityMode\n    }\n  /** Findings flow anywhere: an analyst over N nodes' settled traces, delivered to ONE node.\n   *  With a LENS analyst the directive wraps the findings for the recipient; with a NODE analyst\n   *  the directive is the analyst agent's task and the findings are its settle output. */\n  | {\n      readonly kind: 'analyzes'\n      /** The analyst REFERENCE, in one of two forms: a lens id resolved against\n       *  `RunGraphOptions.analysts` (environment), or the id of a graph NODE with no delegates\n       *  edge pointing at it — then each matching settle spawns that node's pinned profile as a\n       *  tool-equipped analyst WORKER (same spawn machinery, conserved budget, trace join) whose\n       *  task is this edge's directive plus the settled worker's trace evidence and whose settle\n       *  output is the findings. An id that is both a node and a registry lens is refused. */\n      readonly analyst: string\n      readonly over: ReadonlyArray<NodeId>\n      readonly to: NodeId\n      readonly directive: PromptHandle\n      /** Observability cap: traversals beyond this are LEDGERED as exhausted (`unpropagated`).\n       *  Only delegates caps refuse traversal — they are what close the spawn cycle. */\n      readonly maxTraversals?: number\n    }\n\nexport interface AgentGraph {\n  readonly nodes: ReadonlyArray<GraphNode>\n  readonly edges: ReadonlyArray<GraphEdge>\n  /** Termination is mandatory, not optional: the independent completion oracle. */\n  readonly deliverable: DeliverableSpec<unknown>\n  /** One conserved pool across the whole graph — cycles without conservation never terminate. */\n  readonly budget: Budget\n}\n\n// ── The edge ledger ────────────────────────────────────────────────────────────\n\nexport type EdgeDeliveryOutcome = 'delivered' | 'stripped' | 'empty' | 'unpropagated'\n\n/** How one ledgered hop CONTINUED: a spawn traversal stamps its effective spawn mode\n *  (`'fresh'` | `'resume'`), and every mid-run delivery into an already-live recipient — a\n *  driver steer leg and every analyzes delivery (routed steer or driver-destined finding) —\n *  stamps `'steer'`. Zero ambiguity: every row carries exactly one of the three. */\nexport type TraversalContinuity = ContinuityMode | 'steer'\n\n/** One recorded edge traversal — the in-memory row; the journal twin is the `edge` SpawnEvent. */\nexport interface EdgeTraversal {\n  /** Stable edge id: `delegates:<from>-><to>` or `analyzes:<analyst>:<over…>-><to>`. */\n  readonly edge: string\n  readonly kind: 'delegates' | 'analyzes'\n  readonly from: string\n  readonly to: string\n  /** The resolved directive reference (`<surface>/v<n>`). */\n  readonly directive: string\n  /** 1-based per-edge ordinal. */\n  readonly traversal: number\n  readonly outcome: EdgeDeliveryOutcome\n  /** How this hop continued — see {@link TraversalContinuity}. */\n  readonly continuity: TraversalContinuity\n  /** Bytes of directive + payload that actually crossed the edge. */\n  readonly bytes: number\n  readonly reason?: string\n  /** The concrete worker node id, once known. */\n  readonly workerId?: string\n}\n\n/** A delegates edge exhausted its traversal cap and the run produced no winner: the cap, not the\n *  task, ended it. Carries the full evidence so failing loud loses nothing. */\nexport class GraphEdgeCapError extends Error {\n  readonly exhaustedEdges: ReadonlyArray<string>\n  readonly ledger: ReadonlyArray<EdgeTraversal>\n  readonly result: SupervisedResult<unknown>\n  constructor(\n    exhaustedEdges: ReadonlyArray<string>,\n    ledger: ReadonlyArray<EdgeTraversal>,\n    result: SupervisedResult<unknown>,\n  ) {\n    super(\n      `runGraph: edge traversal cap exhausted on ${exhaustedEdges.join(', ')} and the run ` +\n        'delivered no winner — the cap (the cyclic-graph backstop), not the task, ended this run. ' +\n        'Raise maxTraversals on the edge or fix the cycle; the full edge ledger and the ' +\n        'supervised result ride on this error.',\n    )\n    this.name = 'GraphEdgeCapError'\n    this.exhaustedEdges = exhaustedEdges\n    this.ledger = ledger\n    this.result = result\n  }\n}\n\n// ── Options / result ───────────────────────────────────────────────────────────\n\n/**\n * Every `SuperviseOptions` key, partitioned by what `runGraph` does with it.\n *\n * `runGraph` starts one `supervise()` run, so every option that run honors is a graph option too\n * unless the graph itself owns the value. This used to be an opt-in list written by hand, and the\n * hand lost: 25 of 49 keys never reached `supervise()` from a graph, including `childSettleGraceMs`\n * (a root-driver failure tore down children that had ALREADY computed the deliverable) and\n * `driverRetry` (agent-runtime#963). Each absence was discovered by losing a run.\n *\n * The four lists below must cover `keyof SuperviseOptions` exactly. `everySuperviseOptionIsClassified`\n * below fails to COMPILE, naming the offender, when a key belongs to none of them — so the next\n * option added to `supervise()` cannot go missing here silently. It has to be classified, and\n * classifying it as forwarded is one word.\n */\n\n/** The graph derives these from the `AgentGraph` itself; a caller value would be overwritten. */\nconst GRAPH_OWNED_SUPERVISE_OPTIONS = [\n  'rootDriverFromBackend',\n  'resolveSpawnProfile',\n  'budget',\n  'deliverable',\n  'makeWorkerAgent',\n  'onCoordinationEvent',\n  'analyzeOnSettle',\n  'continuityByProfile',\n  // A graph pins every node and its delegation edges; a node never gains spawn rights it lacks.\n  'inheritSpawnRights',\n] as const\n\n/** Caller-facing on `RunGraphOptions`, but the graph wraps or defaults the value before it goes in:\n *  `hooks` composes with the graph's own spawn-binding hook, `authorizeMessage` is wrapped so a\n *  narrowed instruction ledgers `stripped`, `authorizeSpawn` runs AFTER the graph has pinned the\n *  node (so a product sees the canonical profile, never the driver's stub), `makeLeafAgent` is the\n *  caller's leaf override slotted under the graph's pinning, `analysts` rides only with analyze\n *  routes, and `journal`/`blobs`/`runId` get graph defaults. */\nconst GRAPH_TRANSFORMED_SUPERVISE_OPTIONS = [\n  'hooks',\n  'authorizeMessage',\n  'authorizeSpawn',\n  'makeLeafAgent',\n  'analysts',\n  'journal',\n  'blobs',\n  'runId',\n] as const\n\n/** Not reachable from a graph, with the reason. `registry` is a NAME COLLISION, not a policy:\n *  `RunGraphOptions.registry` is the directive `PromptRegistry` and `SuperviseOptions.registry` is\n *  the `SuperviseRegistry` name→value table. Two different types under one name; the graph's wins.\n *  Giving the supervise one a graph channel means renaming a public option, so it is recorded here\n *  rather than silently dropped. */\nconst GRAPH_REFUSED_SUPERVISE_OPTIONS = ['registry'] as const\n\n/**\n * Forwarded to the root `supervise()` VERBATIM. Everything not owned, transformed, or refused\n * above belongs here — the default is \"a graph honors it\", not \"someone remembered to add it\".\n */\nconst GRAPH_FORWARDED_SUPERVISE_OPTIONS = [\n  'backend',\n  // Forwarded: composes guidance into the root and into profiles a manager authors. The graph also\n  // composes each PINNED node profile, because pinning replaces the composed `{ name }` stub.\n  'profileGuidance',\n  // Forwarded, not graph-owned: a graph pins WHICH nodes run, never who answers a question one of\n  // them raises. Without it a graph run's `ask_parent` would always report `no-parent` even when\n  // the caller wired an inbox.\n  'escalateQuestion',\n  'rootHandle',\n  'signal',\n  'execution',\n  'resolveDeliverable',\n  'coordination',\n  'peerMail',\n  'peerAudit',\n  'traceTools',\n  'driverBackend',\n  'profileSecurity',\n  'authorizeSpawn',\n  'router',\n  'driveHarness',\n  'selectSeat',\n  'driverRetry',\n  'onDriverAttempt',\n  'workerRetry',\n  'onWorkerRetry',\n  'continuation',\n  'childSettleGraceMs',\n  'teardownConfirmMs',\n  'retainedAtSettlement',\n  'resolveDriveHarness',\n  'driveHarnessMaterialization',\n  'resolveSupervisorTools',\n  'extraTools',\n  'executeExtraTool',\n  'recoverExecutor',\n  'perWorker',\n  'reservationPolicy',\n  'deadlineCheckIn',\n  'workerSlots',\n  'watchWorkers',\n  'stallAfterMs',\n  'wake',\n  'runDir',\n  'resume',\n  'segment',\n  'runContext',\n  'steerDir',\n  'stopRule',\n  'onProgressStop',\n  'maxDepth',\n  'maxTurns',\n  'compaction',\n  'now',\n  'allowedModels',\n  'finalizer',\n  'otel',\n  // Forwarded: the registry a manager's `run_graph` resolves stored graphs against. A node of this\n  // graph cannot start another graph (pinning refuses it), so it matters to no node here.\n  'graphRegistry',\n] as const\n\ntype ClassifiedSuperviseOption =\n  | (typeof GRAPH_OWNED_SUPERVISE_OPTIONS)[number]\n  | (typeof GRAPH_TRANSFORMED_SUPERVISE_OPTIONS)[number]\n  | (typeof GRAPH_REFUSED_SUPERVISE_OPTIONS)[number]\n  | (typeof GRAPH_FORWARDED_SUPERVISE_OPTIONS)[number]\n\n/**\n * Every key `RunGraphOptions` accepts, as data: the forwarded and transformed `SuperviseOptions`\n * keys, the name-colliding `registry`, and the graph's own `brain`. `GRAPH_OWNED_SUPERVISE_OPTIONS`\n * is deliberately absent — a caller value for one of those is overwritten by the graph, so it is\n * refused by name rather than discarded.\n *\n * The assignment below fails to COMPILE, naming the key, when `RunGraphOptions` declares something\n * this list does not carry.\n */\nconst runGraphOptionKeys = [\n  ...GRAPH_FORWARDED_SUPERVISE_OPTIONS,\n  ...GRAPH_TRANSFORMED_SUPERVISE_OPTIONS,\n  ...GRAPH_REFUSED_SUPERVISE_OPTIONS,\n  'brain',\n] as const\n\ntype UnlistedRunGraphOption = Exclude<keyof RunGraphOptions, (typeof runGraphOptionKeys)[number]>\nconst everyRunGraphOptionIsListed: UnlistedRunGraphOption extends never\n  ? true\n  : UnlistedRunGraphOption = true\nvoid everyRunGraphOptionIsListed\n\nconst runGraphOptionKeySet: ReadonlySet<string> = new Set<string>(runGraphOptionKeys)\nconst graphOwnedOptionKeySet: ReadonlySet<string> = new Set<string>(GRAPH_OWNED_SUPERVISE_OPTIONS)\n\n/**\n * Refuse an option key the graph would not read, naming it and saying which kind it is.\n *\n * A graph-owned key is the sharper case: it type-checks against a widened `SuperviseOptions`\n * value, the graph derives its own value and overwrites the caller's, the run succeeds, and the\n * capability the caller asked for is not there. The rename of the leaf seam from `makeWorkerAgent`\n * to `makeLeafAgent` is the shape of the failure — the old name stayed a valid `SuperviseOptions`\n * key AND a graph-owned one, so a caller that kept passing it got a run with no leaf override and\n * no complaint.\n */\nfunction assertRunGraphOptionKeys(opts: RunGraphOptions): void {\n  const graphOwned: string[] = []\n  const unknown: string[] = []\n  for (const key of Object.keys(opts)) {\n    if (runGraphOptionKeySet.has(key)) continue\n    if (graphOwnedOptionKeySet.has(key)) graphOwned.push(key)\n    else unknown.push(key)\n  }\n  if (graphOwned.length > 0) {\n    throw new ConfigError(\n      `runGraph: ${graphOwned.sort().join(', ')} — the graph derives this from the AgentGraph ` +\n        'itself, so a caller value is overwritten and the capability it asks for would silently ' +\n        'be absent',\n    )\n  }\n  if (unknown.length > 0) {\n    throw new ConfigError(\n      `runGraph: unknown option ${unknown.sort().join(', ')} — no reader consults that name, so ` +\n        'the value would be discarded and the capability it asks for would silently be absent',\n    )\n  }\n}\n\n/** A `SuperviseOptions` key in none of the four lists makes this assignment fail, and the compiler\n *  error names the key. Classify it — `GRAPH_FORWARDED_SUPERVISE_OPTIONS` is usually the answer. */\ntype UnclassifiedSuperviseOption = Exclude<keyof SuperviseOptions, ClassifiedSuperviseOption>\nconst everySuperviseOptionIsClassified: UnclassifiedSuperviseOption extends never\n  ? true\n  : UnclassifiedSuperviseOption = true\nvoid everySuperviseOptionIsClassified\n\n/** `backend` and `driverBackend` keep graph-specific documentation below.\n *\n * Do not inherit and redeclare them through an indexed access type.\n * TypeScript 7 correctly treats `SuperviseOptions['backend']` as including `undefined`, which makes\n * that redeclaration wider than the exact optional property inherited from `SuperviseOptions`.\n */\ntype GraphInheritedSuperviseOption = Exclude<\n  (typeof GRAPH_FORWARDED_SUPERVISE_OPTIONS)[number],\n  'backend' | 'driverBackend'\n>\n\n/** Copy every forwarded option the caller actually set. Absent stays absent: `supervise()` and the\n *  graph must not disagree about what \"unset\" means. */\nfunction forwardedSuperviseOptions(\n  opts: RunGraphOptions,\n): Pick<SuperviseOptions, (typeof GRAPH_FORWARDED_SUPERVISE_OPTIONS)[number]> {\n  const forwarded: Record<string, unknown> = {}\n  for (const key of GRAPH_FORWARDED_SUPERVISE_OPTIONS) {\n    const value = (opts as Record<string, unknown>)[key]\n    if (value !== undefined) forwarded[key] = value\n  }\n  return forwarded as Pick<SuperviseOptions, (typeof GRAPH_FORWARDED_SUPERVISE_OPTIONS)[number]>\n}\n\n/**\n * Options for one `runGraph` run.\n *\n * Extends every forwarded `SuperviseOptions` key, so a graph honors what a `supervise()` run\n * honors WITHOUT anyone restating it here. Only the graph-specific members and the ones whose\n * graph semantics differ are declared below; everything else inherits its type AND its\n * documentation from `SuperviseOptions`, which is the one owner of both.\n */\nexport interface RunGraphOptions extends Pick<SuperviseOptions, GraphInheritedSuperviseOption> {\n  /** WHERE worker nodes run — the executor backend. Provide this OR `makeLeafAgent`. Forwarded to\n   *  `supervise()`, which derives every authorized leaf from it. A node that declares\n   *  `agent_runtime_coordination_spawn_worker` becomes a nested supervisor instead, whose own\n   *  leaves are derived the same way. */\n  readonly backend?: Exclude<SuperviseOptions['backend'], undefined>\n  /** WHERE the ROOT node's harness brain runs — forwarded to `supervise()` verbatim (see\n   *  `SuperviseOptions.driverBackend`). Needed when the root node's profile declares an external\n   *  harness (`codex`, `claude-code`, `opencode`): that root is driven by the harness, not by the\n   *  router brain, and automatic execution supports a local `bridge`. Unlike `supervise()`, this\n   *  does NOT default to `backend`: a graph's `backend` places WORKER nodes, so the root driver\n   *  is selected only by this field. Omit = no harness driver, which is correct for a root whose\n   *  `profile.harness` is omitted or `cli-base` (that root runs on the router brain). */\n  readonly driverBackend?: Exclude<SuperviseOptions['driverBackend'], undefined>\n  /** Leaf-execution override (offline tests / advanced). `runGraph` still owns node pinning,\n   *  directive delivery, and the edge ledger AROUND this seam — only the leaf `act` is yours.\n   *  Slots INSIDE the kernel's authorized path (`SuperviseOptions.makeLeafAgent`), so a node that\n   *  declares the spawn tool still becomes a nested supervisor even under an offline leaf. */\n  readonly makeLeafAgent?: MakeWorkerAgent\n  /** The ROOT driver's inference seam — a caller-owned `ToolLoopChat` that makes every root\n   *  model call. Use it when the root's decisions must be caller-owned orchestration (a\n   *  deterministic conversation driver, a persona loop with its own LLM calls) rather than a\n   *  router-derived model call. The graph machinery around the seam is unchanged: node pinning,\n   *  directive delivery, the edge ledger, and the journal twin all run the same shipped path,\n   *  and the root profile keeps prompt control (`prompt-control-execution` materialization —\n   *  `systemPrompt`/`instructions` still apply). What moves to the caller with the brain:\n   *  model selection and provider-identity validation (`expectedModel` cannot be enforced on a\n   *  call the runtime did not place) and per-turn usage reporting (a brain that reports no\n   *  usage meters nothing into the pool). Omit = the router brain derived from the root\n   *  profile — the unchanged default. Mutually exclusive with `driverBackend`, and refused\n   *  when the root profile declares an external harness (that root is driven BY the harness). */\n  readonly brain?: ToolLoopChat\n  /** Caller-side runtime hooks (telemetry, policy, product extensions). Composed AFTER the\n   *  graph's own spawn-binding hook on the SAME event stream — the graph never swallows the\n   *  seam supervise() exposes. */\n  readonly hooks?: RuntimeHooks\n  /** The analyst lens registry `analyzes` edges resolve against. ENVIRONMENT — needed only for\n   *  lens analysts; an analyzes edge naming a graph NODE as its analyst needs no registry. */\n  readonly analysts?: AnalystRegistry\n  /** Directive registry. Default: the seeded kernel registry (`kernelPromptRegistry()`).\n   *\n   *  NOT `SuperviseOptions.registry`, which is the `SuperviseRegistry` name→value table for\n   *  code-valued options. The two share a name and nothing else, and this one wins here — see\n   *  `GRAPH_REFUSED_SUPERVISE_OPTIONS`. */\n  readonly registry?: PromptRegistry\n  /** The run journal the edge ledger and every spawn/settle ride. Default: in-memory. */\n  readonly journal?: SpawnJournal\n  readonly blobs?: ResultBlobStore\n  readonly runId?: string\n  /** Product authority over every steer/answer instruction (the filter seam). `runGraph` observes\n   *  what it CHANGES: a narrowed instruction ledgers its steer traversal as `stripped`. */\n  readonly authorizeMessage?: SuperviseOptions['authorizeMessage']\n}\n\nexport interface GraphResult<Out = unknown> {\n  readonly result: SupervisedResult<Out>\n  /** Every edge traversal, in occurrence order — the observable-edge contract. */\n  readonly ledger: ReadonlyArray<EdgeTraversal>\n  /** Edge ids whose traversal cap was hit — analyzes exhaustion included (observable here, never\n   *  a refusal). A DELEGATES cap paired with a `no-winner` result THROWS\n   *  ({@link GraphEdgeCapError}) instead of returning: only delegates caps refuse spawns, so only\n   *  they can have ended the run. A LIFECYCLE no-winner (`aborted` / `budget-exhausted`) returns\n   *  normally even with an exhausted delegates cap — the abort or the pool, not the cap, ended\n   *  that run, and the exhaustion stays observable here. */\n  readonly exhaustedEdges: ReadonlyArray<string>\n  readonly runId: string\n}\n\n/** `RunGraphOptions` with the brain REQUIRED — the shape the `/testing` entry's\n *  `runGraphWithTestBrain` keeps accepting now that `brain` is a production option. */\nexport interface RunGraphTestOptions extends RunGraphOptions {\n  readonly brain: ToolLoopChat\n}\n\n// ── Validation ─────────────────────────────────────────────────────────────────\n\n/** Validate the graph and resolve every directive BEFORE any compute is spent — an invalid\n *  topology or an unknown directive is a configuration fault, never a mid-run surprise. */\nfunction validateGraph(\n  graph: AgentGraph,\n  registry: PromptRegistry,\n  analysts: AnalystRegistry | undefined,\n): ValidatedGraph {\n  if (!Array.isArray(graph.nodes) || graph.nodes.length === 0) {\n    throw new ValidationError('runGraph: graph.nodes must be a non-empty array')\n  }\n  if (!Array.isArray(graph.edges) || graph.edges.length === 0) {\n    throw new ValidationError('runGraph: graph.edges must be a non-empty array')\n  }\n  if (typeof graph.deliverable?.check !== 'function') {\n    throw new ValidationError('runGraph: graph.deliverable is mandatory (termination oracle)')\n  }\n  if (typeof graph.budget !== 'object' || graph.budget === null) {\n    throw new ValidationError('runGraph: graph.budget is mandatory (the conserved pool)')\n  }\n  return validateGraphTopology(graph.nodes, graph.edges, registry, analysts)\n}\n\n// ── The runner ─────────────────────────────────────────────────────────────────\n\n/**\n * Execute an {@link AgentGraph}. The root node becomes the supervisor (`supervise()` — the\n * execution core), each worker node is spawnable BY NODE ID (`spawn_worker` with\n * `profile: { name: '<node id>' }`; the node's canonical profile is pinned by the graph), each\n * delegates directive is appended to the worker profile's `prompt.instructions` per traversal,\n * and each analyzes edge becomes an analyst-on-settle route with a real DESTINATION. Every\n * traversal is ledgered and journaled.\n */\nexport function runGraph(graph: AgentGraph, opts: RunGraphOptions): Promise<GraphResult> {\n  const { brain, ...runtimeOptions } = opts\n  return superviseAgentGraph(graph, runtimeOptions, brain)\n}\n\n/** Alias for graph tests written before `RunGraphOptions.brain` was production. The production\n *  entry accepts the same shape; this wrapper only keeps the `/testing` import path working. */\nexport function runGraphWithTestBrain(\n  graph: AgentGraph,\n  opts: RunGraphTestOptions,\n): Promise<GraphResult> {\n  const { brain, ...runtimeOptions } = opts\n  return superviseAgentGraph(graph, runtimeOptions, brain)\n}\n\n/**\n * The graph supervise run, as its own entry: the engine's `run-graph` preset node executes exactly\n * this, so the preset and `runGraph` are the same code path by construction (agent-runtime#982).\n */\n/**\n * Every refusal a graph earns before any compute, in one place: the authoring contract. `runGraph`\n * calls it FIRST so a malformed graph throws synchronously, exactly as it did before the engine\n * preset (agent-runtime#982) moved execution behind a promise.\n */\nexport function assertRunGraphAuthoring(\n  graph: AgentGraph,\n  opts: RunGraphOptions,\n  brain?: ToolLoopChat,\n): ReturnType<typeof validateGraph> {\n  assertRunGraphOptionKeys(opts)\n  const registry = opts.registry ?? kernelPromptRegistry()\n  const validated = validateGraph(graph, registry, opts.analysts)\n  const { root } = validated\n  // A caller brain and a harness driver are two answers to WHO makes the root's calls: refuse the\n  // contradiction before any compute, and refuse a harness-driven root outright — the harness IS\n  // that root's brain, so a supplied one would be silently ignored downstream.\n  if (brain && opts.driverBackend) {\n    throw new ValidationError(\n      'runGraph: brain and driverBackend are mutually exclusive — a caller brain makes the root model calls, a driverBackend places a harness that makes its own',\n    )\n  }\n  if (brain && harnessRunsAgent(root.profile.harness)) {\n    throw new ValidationError(\n      `runGraph: root node '${root.id}' declares harness '${root.profile.harness}', so the harness drives it — a caller brain applies only to a router-brained root (profile.harness omitted or 'cli-base')`,\n    )\n  }\n  if (!opts.backend && !opts.makeLeafAgent) {\n    throw new ValidationError(\n      'runGraph: provide opts.backend (where nodes run) or opts.makeLeafAgent',\n    )\n  }\n  return validated\n}\n\nexport function superviseAgentGraph(\n  graph: AgentGraph,\n  opts: RunGraphOptions,\n  brain?: ToolLoopChat,\n): Promise<GraphResult> {\n  const registry = opts.registry ?? kernelPromptRegistry()\n  if (opts.runContext?.acquire !== undefined) {\n    return withRunContext(opts.runContext, opts.signal, (runContext, signal) =>\n      superviseAgentGraph(\n        graph,\n        {\n          ...opts,\n          runContext,\n          ...(signal === undefined ? {} : { signal }),\n        },\n        brain,\n      ),\n    )\n  }\n  const validated = assertRunGraphAuthoring(graph, opts, brain)\n  const { root } = validated\n  // A durable graph needs its journal AND blob store on disk. `supervise()` already resolves this\n  // for its own context (`options.journal ?? createFileRunContext(runDir).journal`), but the graph\n  // passes an explicit `journal`/`blobs` — the edge ledger's twin writes ride on it — so the graph\n  // must do the same resolution itself or its in-memory default SHADOWS the file stores supervise\n  // would have built: `runGraph({ runDir })` journaled only to the process, a second process\n  // silently restarted the run from scratch, and `runDir/spawn-journal.jsonl` never existed.\n  // Layout owner: `createFileRunContext` (run-context.ts); keep these paths byte-identical to it.\n  const journal =\n    opts.journal ??\n    opts.runContext?.journal ??\n    (opts.runDir !== undefined\n      ? new FileSpawnJournal(`${resolve(opts.runDir)}/spawn-journal.jsonl`)\n      : new InMemorySpawnJournal())\n  const blobs =\n    opts.blobs ??\n    opts.runContext?.blobs ??\n    (opts.runDir !== undefined\n      ? new FileResultBlobStore(`${resolve(opts.runDir)}/blobs`)\n      : new InMemoryResultBlobStore())\n  const runId =\n    opts.runId ??\n    opts.runContext?.runId ??\n    `graph-${canonicalCandidateDigest(graph.nodes.map((n) => n.id)).slice('sha256:'.length, 'sha256:'.length + 12)}`\n  const now = opts.now ?? Date.now\n\n  // The graph layer: node pinning, analyst routes, continuity defaults and the edge ledger. A\n  // `run_graph` subtask builds the same overlay around its nested manager.\n  // `profileGuidance` composes the profile a manager authors, but a graph then swaps that\n  // `{ name }` stub for the pinned node profile. Compose the pinned profile too, so every node\n  // that runs carries its harness and model guidance. Composition is idempotent.\n  const guidance = profileGuidanceComposer(opts.profileGuidance)\n  const overlay = createGraphOverlay(validated, {\n    registry,\n    journal,\n    runId,\n    now,\n    ...(guidance ? { guidance } : {}),\n    ...(opts.authorizeSpawn ? { authorizeSpawn: opts.authorizeSpawn } : {}),\n  })\n  // Always present: the kernel refuses steer/answer whenever spawn authorization is on (the\n  // graph's pinning IS spawn authorization), so a graph with no caller filter passes instructions\n  // through unchanged rather than losing its steer channel. Only a caller filter can strip.\n  const callerAuthorizeMessage = opts.authorizeMessage\n  const authorizeMessage = overlay.observeMessages<\n    Parameters<NonNullable<SuperviseOptions['authorizeMessage']>>[0]\n  >((input) =>\n    callerAuthorizeMessage ? callerAuthorizeMessage(input) : { instruction: input.instruction },\n  )\n\n  // ── Spawn-hook: bind ledger rows to concrete worker ids, then journal them ──\n  const graphHooks: RuntimeHooks = {\n    onEvent: (event) => {\n      if (event.target !== 'agent.spawn' || event.phase !== 'after') return\n      const payload = event.payload as { childId?: unknown; assignmentId?: unknown } | undefined\n      if (typeof payload?.childId !== 'string' || typeof payload.assignmentId !== 'string') return\n      return overlay.bindSpawn(event.parentId, payload.assignmentId, payload.childId)\n    },\n  }\n  const hooks = composeRuntimeHooks(graphHooks, opts.hooks)\n  const rootProfile = graphRootProfile(validated, registry)\n\n  // Every configuration fault above throws SYNCHRONOUSLY (matching `supervise()`'s own\n  // contract); only the run itself is asynchronous.\n  const start = async (): Promise<GraphResult> => {\n    const superviseOptions = {\n      // Every forwarded option the caller set, including the ones nobody thought to list here.\n      // `backend` rides along: the kernel derives every authorized LEAF from it, under the graph's\n      // pinning. The root driver stays an explicit `driverBackend` choice: `rootDriverFromBackend:\n      // false` stops supervise() defaulting one from the other, so where workers run never selects\n      // where the root runs (the axis split every graph caller relies on).\n      ...forwardedSuperviseOptions(opts),\n      rootDriverFromBackend: false,\n      // Graph-owned values come after the spread: the graph, not the caller, decides these.\n      budget: graph.budget,\n      deliverable: graph.deliverable,\n      authorizeSpawn: overlay.authorizeSpawn,\n      resolveSpawnProfile: overlay.resolveSpawnProfile,\n      inheritSpawnRights: false,\n      ...(opts.makeLeafAgent ? { makeLeafAgent: opts.makeLeafAgent } : {}),\n      journal,\n      blobs,\n      runId,\n      hooks,\n      onCoordinationEvent: async (\n        _context: unknown,\n        _eventId: unknown,\n        record: { readonly event: Parameters<typeof overlay.onCoordinationEvent>[0] },\n      ) => overlay.onCoordinationEvent(record.event),\n      // Lens routes resolve against the registry; agent routes carry their own analyst profile,\n      // so a graph whose only analysts are nodes needs no registry at all.\n      ...(overlay.routes.length > 0\n        ? {\n            analyzeOnSettle: overlay.routes,\n            ...(opts.analysts ? { analysts: opts.analysts } : {}),\n          }\n        : {}),\n      ...(Object.keys(overlay.continuityByProfile).length > 0\n        ? { continuityByProfile: overlay.continuityByProfile }\n        : {}),\n      authorizeMessage,\n    } satisfies SuperviseOptions\n    const result =\n      brain === undefined\n        ? await supervise(rootProfile, graphTask(graph, root), superviseOptions)\n        : await superviseWithTestBrain(rootProfile, graphTask(graph, root), {\n            ...superviseOptions,\n            brain,\n          })\n\n    const { ledger, exhaustedEdges, exhaustedDelegates } = await overlay.settle()\n    // A LIFECYCLE ending (caller abort, exhausted budget) is its own complete explanation: the\n    // cap did not end that run even when it was exhausted along the way, and blaming it would\n    // misattribute the ending (and turn a caller-initiated abort into a throw). The exhaustion\n    // stays observable in `exhaustedEdges` either way.\n    const lifecycleEnded =\n      result.kind === 'no-winner' &&\n      (result.reason === 'aborted' ||\n        result.reason === 'cancelled' ||\n        result.reason === 'budget-exhausted')\n    if (result.kind !== 'winner' && !lifecycleEnded && exhaustedDelegates.length > 0) {\n      // Fail LOUD: the backstop, not the task, ended this run. The evidence rides on the error.\n      // Only DELEGATES caps refuse spawns, so only they can be the cause named here.\n      throw new GraphEdgeCapError(exhaustedDelegates, ledger, result)\n    }\n    return { result, ledger, exhaustedEdges, runId }\n  }\n\n  return start()\n}\n\n/** The root task: the graph's own framing. The deliverable (mandatory) is the termination; the\n *  task names what the topology exists to produce. */\nfunction graphTask(graph: AgentGraph, root: GraphNode): string {\n  const describe = graph.deliverable.describe\n  return (\n    describe ?? `Deliver the graph's deliverable by driving your worker nodes (root: '${root.id}').`\n  )\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8KA,IAAa,oBAAb,cAAuC,MAAM;CAC3C;CACA;CACA;CACA,YACE,gBACA,QACA,QACA;EACA,MACE,6CAA6C,eAAe,KAAK,IAAI,EAAE,2NAIzE;EACA,KAAK,OAAO;EACZ,KAAK,iBAAiB;EACtB,KAAK,SAAS;EACd,KAAK,SAAS;CAChB;AACF;;;;;;;;;;;;;;;;AAoBA,MAAM,gCAAgC;CACpC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAEA;AACF;;;;;;;AAQA,MAAM,sCAAsC;CAC1C;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;;;;;;AAOA,MAAM,kCAAkC,CAAC,UAAU;;;;;AAMnD,MAAM,oCAAoC;CACxC;CAGA;CAIA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAGA;AACF;;;;;;;;;;AAiBA,MAAM,qBAAqB;CACzB,GAAG;CACH,GAAG;CACH,GAAG;CACH;AACF;AAQA,MAAM,uBAA4C,IAAI,IAAY,kBAAkB;AACpF,MAAM,yBAA8C,IAAI,IAAY,6BAA6B;;;;;;;;;;;AAYjG,SAAS,yBAAyB,MAA6B;CAC7D,MAAM,aAAuB,CAAC;CAC9B,MAAM,UAAoB,CAAC;CAC3B,KAAK,MAAM,OAAO,OAAO,KAAK,IAAI,GAAG;EACnC,IAAI,qBAAqB,IAAI,GAAG,GAAG;EACnC,IAAI,uBAAuB,IAAI,GAAG,GAAG,WAAW,KAAK,GAAG;OACnD,QAAQ,KAAK,GAAG;CACvB;CACA,IAAI,WAAW,SAAS,GACtB,MAAM,IAAI,YACR,aAAa,WAAW,KAAK,CAAC,CAAC,KAAK,IAAI,EAAE,+IAG5C;CAEF,IAAI,QAAQ,SAAS,GACnB,MAAM,IAAI,YACR,4BAA4B,QAAQ,KAAK,CAAC,CAAC,KAAK,IAAI,EAAE,yHAExD;AAEJ;;;AAuBA,SAAS,0BACP,MAC4E;CAC5E,MAAM,YAAqC,CAAC;CAC5C,KAAK,MAAM,OAAO,mCAAmC;EACnD,MAAM,QAAS,KAAiC;EAChD,IAAI,UAAU,KAAA,GAAW,UAAU,OAAO;CAC5C;CACA,OAAO;AACT;;;AAwFA,SAAS,cACP,OACA,UACA,UACgB;CAChB,IAAI,CAAC,MAAM,QAAQ,MAAM,KAAK,KAAK,MAAM,MAAM,WAAW,GACxD,MAAM,IAAI,gBAAgB,iDAAiD;CAE7E,IAAI,CAAC,MAAM,QAAQ,MAAM,KAAK,KAAK,MAAM,MAAM,WAAW,GACxD,MAAM,IAAI,gBAAgB,iDAAiD;CAE7E,IAAI,OAAO,MAAM,aAAa,UAAU,YACtC,MAAM,IAAI,gBAAgB,+DAA+D;CAE3F,IAAI,OAAO,MAAM,WAAW,YAAY,MAAM,WAAW,MACvD,MAAM,IAAI,gBAAgB,0DAA0D;CAEtF,OAAO,sBAAsB,MAAM,OAAO,MAAM,OAAO,UAAU,QAAQ;AAC3E;;;;;;;;;AAYA,SAAgB,SAAS,OAAmB,MAA6C;CACvF,MAAM,EAAE,OAAO,GAAG,mBAAmB;CACrC,OAAO,oBAAoB,OAAO,gBAAgB,KAAK;AACzD;;;AAIA,SAAgB,sBACd,OACA,MACsB;CACtB,MAAM,EAAE,OAAO,GAAG,mBAAmB;CACrC,OAAO,oBAAoB,OAAO,gBAAgB,KAAK;AACzD;;;;;;;;;;AAWA,SAAgB,wBACd,OACA,MACA,OACkC;CAClC,yBAAyB,IAAI;CAE7B,MAAM,YAAY,cAAc,OADf,KAAK,YAAY,qBAAqB,GACN,KAAK,QAAQ;CAC9D,MAAM,EAAE,SAAS;CAIjB,IAAI,SAAS,KAAK,eAChB,MAAM,IAAI,gBACR,2JACF;CAEF,IAAI,SAAS,iBAAiB,KAAK,QAAQ,OAAO,GAChD,MAAM,IAAI,gBACR,wBAAwB,KAAK,GAAG,sBAAsB,KAAK,QAAQ,QAAQ,2HAC7E;CAEF,IAAI,CAAC,KAAK,WAAW,CAAC,KAAK,eACzB,MAAM,IAAI,gBACR,wEACF;CAEF,OAAO;AACT;AAEA,SAAgB,oBACd,OACA,MACA,OACsB;CACtB,MAAM,WAAW,KAAK,YAAY,qBAAqB;CACvD,IAAI,KAAK,YAAY,YAAY,KAAA,GAC/B,OAAO,eAAe,KAAK,YAAY,KAAK,SAAS,YAAY,WAC/D,oBACE,OACA;EACE,GAAG;EACH;EACA,GAAI,WAAW,KAAA,IAAY,CAAC,IAAI,EAAE,OAAO;CAC3C,GACA,KACF,CACF;CAEF,MAAM,YAAY,wBAAwB,OAAO,MAAM,KAAK;CAC5D,MAAM,EAAE,SAAS;CAQjB,MAAM,UACJ,KAAK,WACL,KAAK,YAAY,YAChB,KAAK,WAAW,KAAA,IACb,IAAI,iBAAiB,GAAG,QAAQ,KAAK,MAAM,EAAE,qBAAqB,IAClE,IAAI,qBAAqB;CAC/B,MAAM,QACJ,KAAK,SACL,KAAK,YAAY,UAChB,KAAK,WAAW,KAAA,IACb,IAAI,oBAAoB,GAAG,QAAQ,KAAK,MAAM,EAAE,OAAO,IACvD,IAAI,wBAAwB;CAClC,MAAM,QACJ,KAAK,SACL,KAAK,YAAY,SACjB,SAAS,yBAAyB,MAAM,MAAM,KAAK,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAkB,EAAqB;CAC/G,MAAM,MAAM,KAAK,OAAO,KAAK;CAO7B,MAAM,WAAW,wBAAwB,KAAK,eAAe;CAC7D,MAAM,UAAU,mBAAmB,WAAW;EAC5C;EACA;EACA;EACA;EACA,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC;EAC/B,GAAI,KAAK,iBAAiB,EAAE,gBAAgB,KAAK,eAAe,IAAI,CAAC;CACvE,CAAC;CAID,MAAM,yBAAyB,KAAK;CACpC,MAAM,mBAAmB,QAAQ,iBAE9B,UACD,yBAAyB,uBAAuB,KAAK,IAAI,EAAE,aAAa,MAAM,YAAY,CAC5F;CAWA,MAAM,QAAQ,oBAAoB,EAPhC,UAAU,UAAU;EAClB,IAAI,MAAM,WAAW,iBAAiB,MAAM,UAAU,SAAS;EAC/D,MAAM,UAAU,MAAM;EACtB,IAAI,OAAO,SAAS,YAAY,YAAY,OAAO,QAAQ,iBAAiB,UAAU;EACtF,OAAO,QAAQ,UAAU,MAAM,UAAU,QAAQ,cAAc,QAAQ,OAAO;CAChF,EAEyC,GAAG,KAAK,KAAK;CACxD,MAAM,cAAc,iBAAiB,WAAW,QAAQ;CAIxD,MAAM,QAAQ,YAAkC;EAC9C,MAAM,mBAAmB;GAMvB,GAAG,0BAA0B,IAAI;GACjC,uBAAuB;GAEvB,QAAQ,MAAM;GACd,aAAa,MAAM;GACnB,gBAAgB,QAAQ;GACxB,qBAAqB,QAAQ;GAC7B,oBAAoB;GACpB,GAAI,KAAK,gBAAgB,EAAE,eAAe,KAAK,cAAc,IAAI,CAAC;GAClE;GACA;GACA;GACA;GACA,qBAAqB,OACnB,UACA,UACA,WACG,QAAQ,oBAAoB,OAAO,KAAK;GAG7C,GAAI,QAAQ,OAAO,SAAS,IACxB;IACE,iBAAiB,QAAQ;IACzB,GAAI,KAAK,WAAW,EAAE,UAAU,KAAK,SAAS,IAAI,CAAC;GACrD,IACA,CAAC;GACL,GAAI,OAAO,KAAK,QAAQ,mBAAmB,CAAC,CAAC,SAAS,IAClD,EAAE,qBAAqB,QAAQ,oBAAoB,IACnD,CAAC;GACL;EACF;EACA,MAAM,SACJ,UAAU,KAAA,IACN,MAAM,UAAU,aAAa,UAAU,OAAO,IAAI,GAAG,gBAAgB,IACrE,MAAM,uBAAuB,aAAa,UAAU,OAAO,IAAI,GAAG;GAChE,GAAG;GACH;EACF,CAAC;EAEP,MAAM,EAAE,QAAQ,gBAAgB,uBAAuB,MAAM,QAAQ,OAAO;EAK5E,MAAM,iBACJ,OAAO,SAAS,gBACf,OAAO,WAAW,aACjB,OAAO,WAAW,eAClB,OAAO,WAAW;EACtB,IAAI,OAAO,SAAS,YAAY,CAAC,kBAAkB,mBAAmB,SAAS,GAG7E,MAAM,IAAI,kBAAkB,oBAAoB,QAAQ,MAAM;EAEhE,OAAO;GAAE;GAAQ;GAAQ;GAAgB;EAAM;CACjD;CAEA,OAAO,MAAM;AACf;;;AAIA,SAAS,UAAU,OAAmB,MAAyB;CAE7D,OADiB,MAAM,YAAY,YAErB,wEAAwE,KAAK,GAAG;AAEhG"}

package/dist/{improvement-cycle-U74a-YKi.js → improvement-cycle-B5Z8cHKx.js}

@@ -1,7 +1,7 @@
 import { a as syncDurableDirectory, i as publishExclusiveDurableFile } from "./durable-file-B_eJr6Mb.js";
-import { Dr as runSettledCommand, Jn as runAbortable, Nt as createExecutor, qn as linkAbort, ua as detachedSnapshot, zr as terminateProcessTreeAndConfirm } from "./supervisor-DnKhkhKc.js";
+import { Br as terminateProcessTreeAndConfirm, Jn as linkAbort, Or as runSettledCommand, Pt as createExecutor, Yn as runAbortable, da as detachedSnapshot } from "./supervisor-fq4JGynd.js";
 import { i as ConfigError } from "./errors-DodWX-cb.js";
-import { E as defaultStructuralRolloutPolicy, Q as streamAgentTurn, Y as optimizerMethod, Z as collectAgentTurn, a as reconcileInterruptedSearchCalls, b as improveSearchCost, c as searchExecutor, d as taggedLedger, i as isSearchEnvironmentFault, n as assertSearchLanes, s as searchCallTags, v as decideClosedSearch } from "./search-executor-CtNb_lIB.js";
+import { E as defaultStructuralRolloutPolicy, Q as streamAgentTurn, Y as optimizerMethod, Z as collectAgentTurn, a as reconcileInterruptedSearchCalls, b as improveSearchCost, c as searchExecutor, d as taggedLedger, i as isSearchEnvironmentFault, n as assertSearchLanes, s as searchCallTags, v as decideClosedSearch } from "./search-executor-C-b4NaFl.js";
 import { B as verifyCanonicalCandidateDocument, L as immutableCandidateValue, M as canonicalCandidateBytes$1, N as canonicalCandidateDigest$1, P as canonicalCandidateDocument, R as omitTopLevelDigest, xt as armDeadlineTimer, z as sha256Bytes$1 } from "./workspace-streams-CcoARX4v.js";
 import { a as concreteProfileModel, t as assertExecutableAgentProfile } from "./model-policy-CyCUwHed.js";
 import { t as runAnalystLoop } from "./analyst-loop-DZw5QWT9.js";
@@ -4090,4 +4090,4 @@ function sameOrderedValues(left, right) {
 //#endregion
 export { commandVerifier as $, agentImprovementTargetInput as A, assertCandidateValidator as B, optimizationActivationReceiptFromMetadata as C, agentImprovementProfileSurfaceDigest as D, agentImprovementProfileDiffs as E, isAgentImprovementProfileSurface as F, rawTraceDistiller as G, parseExecutionRef as H, isAgentProfileMeasuredSurface as I, normalizeRolloutPolicy as J, ROLLOUT_POLICY_EXTENSION as K, improve as L, agentProfileImprovementStateDigest as M, assertProfileImprovementTargetsShareIdentity as N, agentImprovementProfileSurfaceInput as O, buildAgentImprovementActivationTargets as P, agenticGenerator as Q, createCommandProfileTrainer as R, createOptimizationActivationReceipt as S, AGENT_PROFILE_MEASURED_SURFACES as T, privateValuePaths as U, assertProfileTrainingIsHeldOut as V, withMethodRuntimeControls as W, serializeRolloutPolicy as X, parseRolloutPolicy as Y, structuralRolloutPolicyFromProfile as Z, profilePolicyWithBudget as _, executeAgentCandidateExperimentCell as a, profileTaskScenarioIdentity as b, requireSealedCandidateExperiment as c, verifyAgentImprovementActivation as d, defaultBuildPrompt as et, verifyAgentImprovementProposal as f, profileImprovementMetadata as g, createProfileImprovementCostLedger as h, createAgentImprovementProposal as i, agentImprovementTargetProfileDiffs as j, agentImprovementTargetDigest as k, reviewAgentImprovementProposal as l, verifyCandidateExecutionEvidence as m, createAgentImprovementActivation as n, proposeAgentImprovement as o, verifyAgentImprovementReview as p, applyRolloutPolicyToProfile as q, createAgentImprovementMeasuredComparison as r, proposeAgentProfileImprovement as s, AgentCandidateExperimentCellExecutionError as t, runAgentCandidateExperiment as u, profilePreparationAccounting as v, AGENT_IMPROVEMENT_PROFILE_SURFACES as w, sealProfileImprovementBenchmark as x, profileStateDigest as y, searchMethod as z };
 
-//# sourceMappingURL=improvement-cycle-U74a-YKi.js.map
+//# sourceMappingURL=improvement-cycle-B5Z8cHKx.js.map