@tangle-network/agent-runtime 0.143.0 → 0.153.2

package/dist/{spawn-journal-D2HKUImC.js → spawn-journal-BLnveCRS.js}

@@ -1,6 +1,7 @@
 import { m as ValidationError } from "./errors-CDZ8XsVj.js";
 import { t as detachedSnapshot } from "./snapshot-cK9K420n.js";
-import { _ as zeroTokenUsage, h as usdEstimatedOf, r as cloneTokenUsage, t as addTokenUsage } from "./util-C1bv6yog.js";
+import { i as cloneSpend, t as addSpend, y as zeroSpend } from "./util-D6ZEuBMi.js";
+import { i as writeAllBytes, n as parseCommittedJsonLines, r as prepareJsonlAppend, t as isNoEntError } from "./jsonl-file-CDfsCI5s.js";
 import { isToolSpan, toolSpansToTraceAnalysisStore } from "@tangle-network/agent-eval";
 import { createHash } from "node:crypto";
 //#region src/durable/content-address.ts
@@ -131,60 +132,6 @@ function runtimeOwnedNestedDriverTreeRoot(owner, parentTreeRoot, driverNodeId) {
 	return nestedDriverTreeOwners.has(owner) ? nestedDriverTreeRoot(parentTreeRoot, driverNodeId) : void 0;
 }
 //#endregion
-//#region src/durable/jsonl-file.ts
-/** Parse an append-only JSONL file without treating a torn final write as committed data.
-* A malformed newline-terminated or non-final record is corruption and fails loud. */
-function parseCommittedJsonLines(text, source) {
-	const lines = text.split("\n");
-	const finalIndex = lines.length - 1;
-	const records = [];
-	for (const [index, line] of lines.entries()) {
-		if (line.length === 0) continue;
-		try {
-			records.push(JSON.parse(line));
-		} catch (cause) {
-			if (index === finalIndex && !text.endsWith("\n")) break;
-			throw new Error(`${source}: malformed JSONL record at line ${index + 1}`, { cause });
-		}
-	}
-	return records;
-}
-/** FileHandle.write may legally make a short write. Loop until every byte is appended. */
-async function writeAllBytes(handle, value) {
-	const bytes = typeof value === "string" ? Buffer.from(value) : Buffer.from(value);
-	let offset = 0;
-	while (offset < bytes.byteLength) {
-		const { bytesWritten } = await handle.write(bytes, offset, bytes.byteLength - offset, null);
-		if (bytesWritten <= 0) throw new Error(`append-only file write made no progress at byte ${offset}`);
-		offset += bytesWritten;
-	}
-}
-/** Prepare a recovered JSONL file for its next append. A valid unterminated final value is retained
-* and needs a separator; an invalid unterminated tail was never committed and is truncated. */
-async function prepareJsonlAppend(path) {
-	const fs = await import("node:fs/promises");
-	let bytes;
-	try {
-		bytes = await fs.readFile(path);
-	} catch (error) {
-		if (isNoEntError$1(error)) return false;
-		throw error;
-	}
-	if (bytes.byteLength === 0 || bytes[bytes.byteLength - 1] === 10) return false;
-	const lastNewline = bytes.lastIndexOf(10);
-	const tail = bytes.subarray(lastNewline + 1).toString("utf8");
-	try {
-		JSON.parse(tail);
-		return true;
-	} catch {
-		await fs.truncate(path, lastNewline + 1);
-		return false;
-	}
-}
-function isNoEntError$1(error) {
-	return typeof error === "object" && error !== null && "code" in error && error.code === "ENOENT";
-}
-//#endregion
 //#region src/durable/spawn-journal.ts
 /**
 *
@@ -684,11 +631,32 @@ function assertSeqUnique(root, events, ev) {
 	if (outsideCursorNamespace(ev)) return;
 	if (events.some((e) => !outsideCursorNamespace(e) && e.seq === ev.seq)) throw new Error(`spawn journal corrupted: duplicate cursor seq ${ev.seq} in tree '${root}'; the cursor order replay relies on is not unique`);
 }
-/** Node-CREATION and informational records — outside the cursor namespace whose uniqueness replay
-*  ordering rests on. The single predicate both the guard's sides read, so a new event kind is
-*  classified once. */
+/**
+* The records that CLOSE a node's cursor slot: a settlement, a cancellation, or a wait being
+* woken. The complement question to {@link outsideCursorNamespace}, and the one a resume needs —
+* a kind missing here leaves a finished node looking live, so its budget is never reclaimed and
+* its reservation is replayed as still in doubt.
+*/
+function closesCursorSlot(ev) {
+	return ev.kind === "settled" || ev.kind === "cancelled" || ev.kind === "woken";
+}
+const outsideKinds = /* @__PURE__ */ new Set([
+	"spawned",
+	"waiting",
+	"metered",
+	"materialized",
+	"execution-bound",
+	"edge",
+	"teardown-unconfirmed",
+	"trace-unpropagated"
+]);
+/** True for a node-CREATION or informational record. Narrows, so a caller keeps the union's arms. */
 function outsideCursorNamespace(ev) {
-	return ev.kind === "spawned" || ev.kind === "waiting" || ev.kind === "metered" || ev.kind === "materialized" || ev.kind === "execution-bound" || ev.kind === "edge" || ev.kind === "trace-unpropagated";
+	return outsideKinds.has(ev.kind);
+}
+/** True for a record inside the cursor namespace. Narrows to {@link CursorNamespaceEvent}. */
+function insideCursorNamespace(ev) {
+	return !outsideKinds.has(ev.kind);
 }
 /**
 * Re-feed a journaled spawn tree in strict `seq` order, rehydrating each settled
@@ -741,6 +709,7 @@ async function replaySpawnTree(journal, blobs, root) {
 		if (ev.kind === "materialized") continue;
 		if (ev.kind === "execution-bound") continue;
 		if (ev.kind === "edge") continue;
+		if (ev.kind === "teardown-unconfirmed") continue;
 		if (ev.kind === "trace-unpropagated") continue;
 		if (ev.kind === "woken") {
 			if (ev.by === "cancelled" || ev.outRef === void 0) {
@@ -819,7 +788,7 @@ async function replaySpawnTree(journal, blobs, root) {
 			out,
 			outRef: ev.outRef,
 			verdict: ev.verdict,
-			spent: cloneJournalSpend(ev.spent),
+			spent: cloneSpend(ev.spent),
 			...ev.providerModel === void 0 ? {} : { providerModel: copyProviderModelEvidence(ev.providerModel) },
 			trace,
 			...settlementTime(ev.at),
@@ -862,7 +831,7 @@ function materializeTreeView(events) {
 	const nodes = /* @__PURE__ */ new Map();
 	let root;
 	const spawns = events.filter((ev) => ev.kind === "spawned" || ev.kind === "waiting").sort((a, b) => a.seq - b.seq);
-	const settlements = events.filter((ev) => ev.kind !== "spawned" && ev.kind !== "waiting" && ev.kind !== "metered" && ev.kind !== "materialized" && ev.kind !== "execution-bound" && ev.kind !== "edge" && ev.kind !== "trace-unpropagated").sort((a, b) => a.seq - b.seq);
+	const settlements = events.filter((ev) => insideCursorNamespace(ev)).sort((a, b) => a.seq - b.seq);
 	for (const ev of spawns) {
 		if (ev.kind === "waiting") {
 			nodes.set(ev.id, {
@@ -896,7 +865,7 @@ function materializeTreeView(events) {
 	for (const ev of settlements) if (ev.kind === "settled") {
 		const node = requireNode(nodes, ev.id);
 		node.status = ev.status === "done" ? "done" : "failed";
-		node.spent = cloneJournalSpend(ev.spent);
+		node.spent = cloneSpend(ev.spent);
 		node.providerModel = copyProviderModelEvidence(ev.providerModel);
 		node.outRef = ev.outRef;
 		node.trace = traceEvidenceFor(ev);
@@ -937,7 +906,7 @@ function materializeTreeView(events) {
 	for (const ev of events) {
 		if (ev.kind !== "metered") continue;
 		const node = requireNode(nodes, ev.id);
-		node.spent = addJournalSpend(node.spent, ev.spend);
+		node.spent = addSpend(node.spent, ev.spend);
 	}
 	const snapshots = [...nodes.values()].map(freezeSnapshot);
 	return {
@@ -968,26 +937,6 @@ function pendingWaits(events) {
 	}
 	return pending.sort((a, b) => a.ordinal - b.ordinal);
 }
-function zeroSpend() {
-	return {
-		iterations: 0,
-		tokens: zeroTokenUsage(),
-		usd: 0,
-		ms: 0
-	};
-}
-/** Copy a durable spend into a read model without dropping cache completeness. */
-function cloneJournalSpend(spend) {
-	return {
-		iterations: spend.iterations,
-		tokens: cloneTokenUsage(spend.tokens),
-		...spend.tokensKnown === false ? { tokensKnown: false } : {},
-		usd: spend.usd,
-		...spend.usdKnown === false ? { usdKnown: false } : {},
-		...spend.usdEstimated !== void 0 ? { usdEstimated: spend.usdEstimated } : {},
-		ms: spend.ms
-	};
-}
 /** Copy provider evidence at the journal boundary so replay never exposes mutable event state. */
 function copyProviderModelEvidence(evidence) {
 	if (evidence === void 0) return void 0;
@@ -1008,22 +957,6 @@ function copyProviderModelEvidence(evidence) {
 		models
 	});
 }
-/** Add a `metered` spend record onto a node's accumulated spend (per channel). */
-function addJournalSpend(a, b) {
-	return {
-		iterations: a.iterations + b.iterations,
-		tokens: (() => {
-			const tokens = cloneTokenUsage(a.tokens);
-			addTokenUsage(tokens, b.tokens);
-			return tokens;
-		})(),
-		...a.tokensKnown === false || b.tokensKnown === false ? { tokensKnown: false } : {},
-		usd: a.usd + b.usd,
-		...a.usdKnown === false || b.usdKnown === false ? { usdKnown: false } : {},
-		...usdEstimatedOf(a, b),
-		ms: a.ms + b.ms
-	};
-}
 function requireNode(nodes, id) {
 	const node = nodes.get(id);
 	if (!node) throw new Error(`spawn journal corrupted: settle/cancel for node '${id}' with no prior spawn`);
@@ -1055,10 +988,7 @@ function traceEvidenceFor(event) {
 		reason: "legacy-settlement-without-trace-evidence"
 	};
 }
-function isNoEntError(err) {
-	return typeof err === "object" && err !== null && "code" in err && err.code === "ENOENT";
-}
 //#endregion
-export { contentAddress as S, WORKER_TOOL_TRACE_SCHEMA_VERSION as _, aggregateProviderModelEvidence as a, parseWorkerToolTraceArtifact as b, pendingWaits as c, prepareJsonlAppend as d, writeAllBytes as f, runtimeOwnedNestedDriverTreeRoot as g, nestedDriverTreeRoot as h, InMemorySpawnJournal as i, replaySpawnTree as l, driverRuntime as m, FileSpawnJournal as n, loadSpawnForest as o, attestNestedDriverTreeOwner as p, InMemoryResultBlobStore as r, materializeTreeView as s, FileResultBlobStore as t, parseCommittedJsonLines as u, captureWorkerTraceEvidence as v, workerTraceAnalysisStore as x, isTraceAnalysisStore as y };
+export { captureWorkerTraceEvidence as _, aggregateProviderModelEvidence as a, workerTraceAnalysisStore as b, loadSpawnForest as c, replaySpawnTree as d, attestNestedDriverTreeOwner as f, WORKER_TOOL_TRACE_SCHEMA_VERSION as g, runtimeOwnedNestedDriverTreeRoot as h, InMemorySpawnJournal as i, materializeTreeView as l, nestedDriverTreeRoot as m, FileSpawnJournal as n, closesCursorSlot as o, driverRuntime as p, InMemoryResultBlobStore as r, insideCursorNamespace as s, FileResultBlobStore as t, pendingWaits as u, isTraceAnalysisStore as v, contentAddress as x, parseWorkerToolTraceArtifact as y };
 
-//# sourceMappingURL=spawn-journal-D2HKUImC.js.map
+//# sourceMappingURL=spawn-journal-BLnveCRS.js.map

package/dist/spawn-journal-BLnveCRS.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"spawn-journal-BLnveCRS.js","names":[],"sources":["../src/durable/content-address.ts","../src/runtime/supervise/trace-evidence.ts","../src/runtime/supervise/tree-key.ts","../src/durable/spawn-journal.ts"],"sourcesContent":["import { createHash } from 'node:crypto'\n\n/** Stable content address shared by result and trace artifacts. */\nexport function contentAddress(artifact: unknown): string {\n  const hex = createHash('sha256').update(stableStringify(artifact), 'utf-8').digest('hex')\n  return `sha256:${hex}`\n}\n\nfunction stableStringify(value: unknown): string {\n  if (value === null || typeof value !== 'object') return JSON.stringify(value) ?? 'null'\n  if (Array.isArray(value)) return `[${value.map(stableStringify).join(',')}]`\n  const entries = Object.entries(value as Record<string, unknown>)\n    .filter(([, v]) => v !== undefined)\n    .sort(([a], [b]) => (a < b ? -1 : a > b ? 1 : 0))\n  return `{${entries.map(([k, v]) => `${JSON.stringify(k)}:${stableStringify(v)}`).join(',')}}`\n}\n","/**\n * Durable structured tool evidence for supervised workers.\n *\n * The executor-owned `TraceSource` is collected before teardown, snapshotted into the shared\n * content-addressed blob store, and only then referenced by a settlement. Analysis reconstructs\n * agent-eval's bounded `TraceAnalysisStore` from those exact bytes. Worker output is never accepted\n * as a substitute for tool evidence.\n *\n * @experimental\n */\n\nimport {\n  isToolSpan,\n  type Span,\n  type ToolSpan,\n  type TraceAnalysisStore,\n  toolSpansToTraceAnalysisStore,\n} from '@tangle-network/agent-eval'\nimport { contentAddress } from '../../durable/content-address'\nimport { ValidationError } from '../../errors'\nimport type { TraceSource } from './trace-source'\nimport type { ResultBlobStore, WorkerTraceEvidence } from './types'\n\n/** Schema version for content-addressed worker tool-trace artifacts. */\nexport const WORKER_TOOL_TRACE_SCHEMA_VERSION = 1 as const\n\n/** Bytes stored under `WorkerTraceEvidence.traceRef`. */\nexport interface WorkerToolTraceArtifact {\n  readonly schemaVersion: typeof WORKER_TOOL_TRACE_SCHEMA_VERSION\n  readonly spans: ReadonlyArray<ToolSpan>\n}\n\n/** Structural guard for the official bounded trace-analysis read contract. */\nexport function isTraceAnalysisStore(value: unknown): value is TraceAnalysisStore {\n  if (value === null || typeof value !== 'object') return false\n  const store = value as Partial<Record<keyof TraceAnalysisStore, unknown>>\n  return (\n    typeof store.getOverview === 'function' &&\n    typeof store.queryTraces === 'function' &&\n    typeof store.countTraces === 'function' &&\n    typeof store.viewTrace === 'function' &&\n    typeof store.viewSpans === 'function' &&\n    typeof store.searchTrace === 'function' &&\n    typeof store.searchSpan === 'function'\n  )\n}\n\n/** Collect and persist one executor's structured tool trace without changing its task outcome. */\nexport async function captureWorkerTraceEvidence(\n  readSource: (() => TraceSource | undefined) | undefined,\n  blobs: ResultBlobStore,\n  executed: boolean,\n): Promise<WorkerTraceEvidence> {\n  if (!executed) return unavailable('execution-did-not-start')\n  if (readSource === undefined) return unavailable('executor-did-not-expose-trace-source')\n\n  let source: TraceSource | undefined\n  try {\n    source = readSource()\n  } catch {\n    return unavailable('trace-source-unavailable')\n  }\n  if (source === undefined) return unavailable('trace-source-unavailable')\n\n  let collected: unknown\n  try {\n    collected = await source.collect()\n  } catch {\n    return unavailable('trace-collection-failed')\n  }\n  if (!Array.isArray(collected) || collected.some((span) => !isToolSpanValue(span))) {\n    return unavailable('invalid-tool-spans')\n  }\n  if (collected.length === 0) return unavailable('no-tool-spans-captured')\n\n  let artifact: WorkerToolTraceArtifact\n  let traceRef: string\n  try {\n    const snapshot = structuredClone(collected) as ToolSpan[]\n    // Use agent-eval's canonical adapter as the full integrity check before the durable receipt\n    // claims these spans are analyzable. `isToolSpan` only narrows the discriminated union.\n    toolSpansToTraceAnalysisStore(snapshot)\n    artifact = {\n      schemaVersion: WORKER_TOOL_TRACE_SCHEMA_VERSION,\n      spans: snapshot,\n    }\n    traceRef = contentAddress(artifact)\n  } catch {\n    return unavailable('invalid-tool-spans')\n  }\n  try {\n    await blobs.put(traceRef, artifact)\n  } catch {\n    return unavailable('trace-persistence-failed')\n  }\n  return Object.freeze({ status: 'available', traceRef, spanCount: artifact.spans.length })\n}\n\n/** Rehydrate exact persisted spans through agent-eval's one bounded trace-analysis adapter. */\nexport async function workerTraceAnalysisStore(\n  evidence: WorkerTraceEvidence,\n  blobs: Pick<ResultBlobStore, 'get'>,\n): Promise<TraceAnalysisStore> {\n  if (evidence.status === 'unavailable') {\n    // The published adapter owns the missing-evidence error and its classification.\n    return toolSpansToTraceAnalysisStore(undefined)\n  }\n  const raw = await blobs.get(evidence.traceRef)\n  if (raw === undefined) {\n    throw new ValidationError(\n      `worker trace blob '${evidence.traceRef}' is missing; the settlement evidence is incomplete`,\n    )\n  }\n  const artifact = parseWorkerToolTraceArtifact(raw, evidence.traceRef)\n  if (artifact.spans.length !== evidence.spanCount) {\n    throw new ValidationError(\n      `worker trace blob '${evidence.traceRef}' has ${artifact.spans.length} spans but its settlement records ${evidence.spanCount}`,\n    )\n  }\n  return toolSpansToTraceAnalysisStore(artifact.spans)\n}\n\n/** Validate a stored trace artifact before an analyst or replay trusts it. */\nexport function parseWorkerToolTraceArtifact(\n  value: unknown,\n  traceRef = '<unknown>',\n): WorkerToolTraceArtifact {\n  if (\n    value === null ||\n    typeof value !== 'object' ||\n    (value as { schemaVersion?: unknown }).schemaVersion !== WORKER_TOOL_TRACE_SCHEMA_VERSION ||\n    !Array.isArray((value as { spans?: unknown }).spans)\n  ) {\n    throw new ValidationError(\n      `worker trace blob '${traceRef}' is not a version-${WORKER_TOOL_TRACE_SCHEMA_VERSION} tool trace artifact`,\n    )\n  }\n  const spans = (value as { spans: unknown[] }).spans\n  if (spans.length === 0) {\n    // Missing spans cannot prove a tool-free run; preserve agent-eval's explicit integrity error.\n    return {\n      schemaVersion: WORKER_TOOL_TRACE_SCHEMA_VERSION,\n      spans: spans as ToolSpan[],\n    }\n  }\n  if (spans.some((span) => !isToolSpanValue(span))) {\n    throw new ValidationError(`worker trace blob '${traceRef}' contains a non-tool span`)\n  }\n  return {\n    schemaVersion: WORKER_TOOL_TRACE_SCHEMA_VERSION,\n    spans: spans as ToolSpan[],\n  }\n}\n\nfunction unavailable(reason: Extract<WorkerTraceEvidence, { status: 'unavailable' }>['reason']) {\n  return Object.freeze({ status: 'unavailable' as const, reason })\n}\n\nfunction isToolSpanValue(value: unknown): value is ToolSpan {\n  try {\n    return isToolSpan(value as Span)\n  } catch {\n    return false\n  }\n}\n","import type { NodeId } from './types'\n\n/** Runtime tag used only for a child that owns another supervised scope. */\nexport const driverRuntime = 'driver' as const\n\n// Recursive ownership is an executor capability, not a Runtime string. `Runtime` is deliberately\n// open, so a caller-owned leaf may also call itself \"driver\". Keep the capability on the exact\n// Runtime-created executor object and never expose a public lookalike property that a leaf can set.\nconst nestedDriverTreeOwners = new WeakSet<object>()\n\n/** Canonical journal key for the scope owned by one nested driver node. */\nexport function nestedDriverTreeRoot(parentTreeRoot: NodeId, driverNodeId: NodeId): NodeId {\n  return `${parentTreeRoot}/${driverNodeId}`\n}\n\n/** Privately mark the exact recursive executor that will create a nested journal tree. */\nexport function attestNestedDriverTreeOwner<T extends object>(owner: T): T {\n  nestedDriverTreeOwners.add(owner)\n  return owner\n}\n\n/** Return the canonical owned tree only for an exact privately marked recursive executor. */\nexport function runtimeOwnedNestedDriverTreeRoot(\n  owner: object,\n  parentTreeRoot: NodeId,\n  driverNodeId: NodeId,\n): NodeId | undefined {\n  return nestedDriverTreeOwners.has(owner)\n    ? nestedDriverTreeRoot(parentTreeRoot, driverNodeId)\n    : undefined\n}\n","/**\n *\n * Event-sourced spawn journal for the recursive execution atom (build steps 3 + 7).\n *\n * The supervision tree is journaled as an append-only event log: every `spawned`,\n * `settled`, and `cancelled` is recorded AFTER it is observed-committed (never\n * speculative), mirroring `ConversationJournal`'s begin/append/load shape. The log\n * holds only the THIN decision record — ids, parentage, budget, the spend a decision\n * consumed, and a content-addressed `outRef`. The payloads the driver branched on\n * (the `out` artifacts) live in a separate `ResultBlobStore`, keyed by `outRef`, so\n * the journal stays small (decisions) and replay rehydrates the exact `Settled` from\n * the blob store (evidence). This is the decision/payload split the replay argument\n * rests on (B1/B2).\n *\n * Replay determinism (B2): `seq` is the monotonic cursor order `scope.next()` yielded\n * each settlement — NOT wall-clock. `replaySpawnTree` sorts strictly by `seq` before\n * touching the blob store, so the order in which rehydration `get`s resolve can never\n * reorder the replayed `Settled[]`; the result is identical regardless of blob latency.\n *\n * @stable\n */\n\nimport { detachedSnapshot } from '../runtime/supervise/snapshot'\nimport { workerTraceAnalysisStore } from '../runtime/supervise/trace-evidence'\nimport { nestedDriverTreeRoot } from '../runtime/supervise/tree-key'\nimport type {\n  NodeExecutionIdentity,\n  NodeId,\n  NodeSnapshot,\n  NodeStatus,\n  ProviderModelAttemptEvidence,\n  ProviderModelExecutionEvidence,\n  ResultBlobStore,\n  Runtime,\n  Settled,\n  SpawnEvent,\n  SpawnJournal,\n  Spend,\n  TreeView,\n} from '../runtime/supervise/types'\nimport type { PendingWait } from '../runtime/supervise/wait'\nimport { addSpend, cloneSpend, zeroSpend } from '../runtime/util'\nimport { contentAddress } from './content-address'\nimport {\n  isNoEntError,\n  parseCommittedJsonLines,\n  prepareJsonlAppend,\n  writeAllBytes,\n} from './jsonl-file'\n\nexport { contentAddress } from './content-address'\n\n/** One journal tree in a recursively loaded supervision forest. */\nexport interface SpawnForestTree {\n  readonly root: NodeId\n  /** Driver node that owns this tree; absent for the requested root tree. */\n  readonly ownerNodeId?: NodeId\n  /** Journal tree containing `ownerNodeId`; absent for the requested root tree. */\n  readonly parentTreeRoot?: NodeId\n  readonly events: ReadonlyArray<SpawnEvent>\n  readonly view: TreeView\n}\n\n/** One event with the journal tree that establishes its cursor namespace. */\nexport interface SpawnForestEvent {\n  readonly treeRoot: NodeId\n  readonly event: SpawnEvent\n}\n\n/** One flattened node with the journal tree that owns its records. */\nexport interface SpawnForestNode extends NodeSnapshot {\n  readonly treeRoot: NodeId\n}\n\n/** A spawned worker with no terminal record in a cold snapshot. Resume treats the same state as\n * in-doubt and conservatively retains its reservation. Root nodes and armed waits are excluded. */\nexport interface SpawnForestInDoubtNode {\n  readonly treeRoot: NodeId\n  readonly nodeId: NodeId\n  readonly label: string\n  readonly runtime: Runtime\n}\n\n/** A driver spawn whose owned journal tree was never begun before the process stopped. */\nexport interface SpawnForestMissingTree {\n  readonly parentTreeRoot: NodeId\n  readonly ownerNodeId: NodeId\n  readonly root: NodeId\n}\n\n/** Complete cold-readable view of one recursive supervision run. */\nexport interface SpawnForest {\n  readonly root: NodeId\n  readonly trees: ReadonlyArray<SpawnForestTree>\n  readonly nodes: ReadonlyArray<SpawnForestNode>\n  readonly events: ReadonlyArray<SpawnForestEvent>\n  readonly inDoubt: ReadonlyArray<SpawnForestInDoubtNode>\n  readonly missingTrees: ReadonlyArray<SpawnForestMissingTree>\n}\n\n// ── Content addressing ──────────────────────────────────────────────────────\n\n/**\n * Mint the content-addressed `outRef` for a result artifact: `sha256:<hex>` over a\n * stable JSON encoding. Producers call this to derive the `outRef` they journal and\n * `put`; the FS/in-mem stores re-derive it on `put` to verify the supplied ref\n * matches (fail loud on a mismatch — a forged ref breaks the replay invariant).\n *\n * Stable encoding: object keys are sorted recursively so two structurally-equal\n * artifacts hash identically regardless of key insertion order.\n */\n// ── Result blob store ─────────────────────────────────────────────────────────\n\n/**\n * In-memory `ResultBlobStore`. Content-addressed: `put` verifies the supplied\n * `outRef` matches the artifact's hash so a stale/forged ref fails loud rather than\n * silently rehydrating the wrong payload. Idempotent on an identical re-put.\n *\n * @stable\n */\nexport class InMemoryResultBlobStore implements ResultBlobStore {\n  private readonly blobs = new Map<string, unknown>()\n\n  async put(outRef: string, artifact: unknown): Promise<void> {\n    assertContentAddress(outRef, artifact)\n    this.blobs.set(outRef, artifact)\n  }\n\n  async get(outRef: string): Promise<unknown | undefined> {\n    return this.blobs.has(outRef) ? this.blobs.get(outRef) : undefined\n  }\n}\n\n/**\n * FS `ResultBlobStore`. One JSON file per artifact under `dir`, named by a\n * filesystem-safe encoding of the `outRef` (`sha256:<hex>` → `sha256-<hex>.json`).\n * `put` fsyncs so a crash between writes never loses an acknowledged blob.\n *\n * @stable\n */\nexport class FileResultBlobStore implements ResultBlobStore {\n  constructor(private readonly dir: string) {}\n\n  async put(outRef: string, artifact: unknown): Promise<void> {\n    assertContentAddress(outRef, artifact)\n    const fs = await import('node:fs/promises')\n    await fs.mkdir(this.dir, { recursive: true })\n    const fh = await fs.open(this.blobPath(outRef), 'w')\n    try {\n      await fh.write(JSON.stringify(artifact))\n      await fh.sync()\n    } finally {\n      await fh.close()\n    }\n  }\n\n  async get(outRef: string): Promise<unknown | undefined> {\n    const fs = await import('node:fs/promises')\n    let text: string\n    try {\n      text = await fs.readFile(this.blobPath(outRef), 'utf8')\n    } catch (err) {\n      if (isNoEntError(err)) return undefined\n      throw err\n    }\n    return JSON.parse(text)\n  }\n\n  private blobPath(outRef: string): string {\n    return `${this.dir}/${outRef.replace(/:/g, '-')}.json`\n  }\n}\n\nfunction assertContentAddress(outRef: string, artifact: unknown): void {\n  const expected = contentAddress(artifact)\n  if (outRef !== expected) {\n    throw new Error(\n      `blob outRef '${outRef}' does not match the artifact content hash '${expected}'; ` +\n        'a content-addressed store refuses a mismatched ref (breaks the replay invariant)',\n    )\n  }\n}\n\n// ── Spawn journal ──────────────────────────────────────────────────────────────\n\n/**\n * In-memory `SpawnJournal`. Appends are observed-committed only; the impl enforces\n * the corruption guards a durable replay rests on:\n *  - an event before `beginTree` is a corrupted tree (fail loud),\n *  - a duplicate `seq` within a tree is a corrupted cursor (fail loud) — two\n *    settlements cannot share the cursor position replay orders by.\n *\n * @stable\n */\nexport class InMemorySpawnJournal implements SpawnJournal {\n  private readonly trees = new Map<NodeId, { begunAt: string; events: SpawnEvent[] }>()\n\n  async loadTree(root: NodeId): Promise<SpawnEvent[] | undefined> {\n    const tree = this.trees.get(root)\n    if (!tree) return undefined\n    return tree.events.map((ev) => ({ ...ev }))\n  }\n\n  async beginTree(root: NodeId, at: string): Promise<void> {\n    const existing = this.trees.get(root)\n    if (existing) {\n      if (existing.begunAt !== at) {\n        throw new Error(\n          `spawn tree '${root}' already begun at ${existing.begunAt}; refusing to overwrite with ${at}`,\n        )\n      }\n      return\n    }\n    this.trees.set(root, { begunAt: at, events: [] })\n  }\n\n  async appendEvent(root: NodeId, ev: SpawnEvent): Promise<void> {\n    const tree = this.trees.get(root)\n    if (!tree) {\n      throw new Error(`appendEvent called for unknown spawn tree '${root}'; call beginTree first`)\n    }\n    assertSeqUnique(root, tree.events, ev)\n    tree.events.push({ ...ev })\n  }\n}\n\n/**\n * JSONL on disk. One line per record: the first record is `begin`, subsequent records\n * are `event` envelopes wrapping a `SpawnEvent`. `loadTree` replays the whole file,\n * filtering by `root`, and applies the same begin-precedes-events + unique-seq\n * corruption guards as the in-memory impl. Each append fsyncs so a crash between\n * writes never loses an acknowledged event.\n *\n * @stable\n */\nexport class FileSpawnJournal implements SpawnJournal {\n  private appendTail: Promise<void> = Promise.resolve()\n\n  constructor(private readonly path: string) {}\n\n  async loadTree(root: NodeId): Promise<SpawnEvent[] | undefined> {\n    const fs = await import('node:fs/promises')\n    let text: string\n    try {\n      text = await fs.readFile(this.path, 'utf8')\n    } catch (err) {\n      if (isNoEntError(err)) return undefined\n      throw err\n    }\n    let begun = false\n    const events: SpawnEvent[] = []\n    for (const record of parseCommittedJsonLines<SpawnJournalRecord>(text, this.path)) {\n      if (record.root !== root) continue\n      if (record.kind === 'begin') {\n        begun = true\n      } else {\n        if (!begun) {\n          throw new Error(\n            `spawn journal corrupted: event for tree '${root}' precedes its begin record`,\n          )\n        }\n        assertSeqUnique(root, events, record.event)\n        events.push(record.event)\n      }\n    }\n    return begun ? events : undefined\n  }\n\n  async beginTree(root: NodeId, at: string): Promise<void> {\n    const existing = await this.loadTreeBegin(root)\n    if (existing) {\n      if (existing !== at) {\n        throw new Error(\n          `spawn tree '${root}' already begun in ${this.path} at ${existing}; refusing to overwrite with ${at}`,\n        )\n      }\n      return\n    }\n    await this.appendRecord({ kind: 'begin', root, at })\n  }\n\n  async appendEvent(root: NodeId, ev: SpawnEvent): Promise<void> {\n    const events = await this.loadTree(root)\n    if (events === undefined) {\n      throw new Error(`appendEvent called for unknown spawn tree '${root}'; call beginTree first`)\n    }\n    assertSeqUnique(root, events, ev)\n    await this.appendRecord({ kind: 'event', root, event: ev })\n  }\n\n  private async loadTreeBegin(root: NodeId): Promise<string | undefined> {\n    const fs = await import('node:fs/promises')\n    let text: string\n    try {\n      text = await fs.readFile(this.path, 'utf8')\n    } catch (err) {\n      if (isNoEntError(err)) return undefined\n      throw err\n    }\n    for (const record of parseCommittedJsonLines<SpawnJournalRecord>(text, this.path)) {\n      if (record.root === root && record.kind === 'begin') return record.at\n    }\n    return undefined\n  }\n\n  private async appendRecord(record: SpawnJournalRecord): Promise<void> {\n    const append = this.appendTail.then(() => this.writeRecord(record))\n    this.appendTail = append.catch(() => undefined)\n    return append\n  }\n\n  private async writeRecord(record: SpawnJournalRecord): Promise<void> {\n    const fs = await import('node:fs/promises')\n    const path = await import('node:path')\n    await fs.mkdir(path.dirname(this.path), { recursive: true })\n    const needsSeparator = await prepareJsonlAppend(this.path)\n    const fh = await fs.open(this.path, 'a')\n    try {\n      await writeAllBytes(fh, `${needsSeparator ? '\\n' : ''}${JSON.stringify(record)}\\n`)\n      await fh.sync()\n    } finally {\n      await fh.close()\n    }\n  }\n}\n\n/**\n * Load every journal tree owned by one recursive supervision run and flatten its nodes/events.\n *\n * Nested driver tree keys are a Runtime implementation detail; callers should use this reader\n * instead of deriving or scanning keys themselves. The reader follows only the explicit\n * `ownedTreeRoot` written after Runtime privately attested a recursive executor; the open runtime\n * string `driver` is never treated as ownership. Legacy records without `ownedTreeRoot` are\n * intentionally treated as leaves rather than guessing or scanning convention-derived keys.\n * This preserves each tree's independent cursor namespace on flattened events.\n * A driver whose subtree was never begun is reported in `missingTrees`; any spawned non-root node\n * without a terminal record is reported in `inDoubt`, matching resume's conservative lost-work\n * interpretation.\n *\n * This is a cold/quiescent reader, not a transaction across an actively mutating file. Every value\n * returned is a detached immutable snapshot, so later journal writes or caller mutation cannot\n * change the result already observed.\n */\nexport async function loadSpawnForest(journal: SpawnJournal, root: NodeId): Promise<SpawnForest> {\n  const rootEvents = await journal.loadTree(root)\n  if (rootEvents === undefined) {\n    throw new Error(`loadSpawnForest: no journaled tree for root '${root}'`)\n  }\n\n  const trees: SpawnForestTree[] = []\n  const nodes: SpawnForestNode[] = []\n  const events: SpawnForestEvent[] = []\n  const inDoubt: SpawnForestInDoubtNode[] = []\n  const missingTrees: SpawnForestMissingTree[] = []\n  const visited = new Set<NodeId>()\n  const queue: Array<{\n    readonly root: NodeId\n    readonly events: SpawnEvent[]\n    readonly ownerNodeId?: NodeId\n    readonly parentTreeRoot?: NodeId\n    /** Parent-tree spawn that establishes the root node omitted from an owned journal tree. */\n    readonly ownerSpawn?: Extract<SpawnEvent, { kind: 'spawned' }>\n  }> = [{ root, events: rootEvents }]\n\n  for (let cursor = 0; cursor < queue.length; cursor += 1) {\n    const current = queue[cursor]!\n    if (visited.has(current.root)) {\n      throw new Error(`loadSpawnForest: recursive journal tree '${current.root}' was reached twice`)\n    }\n    visited.add(current.root)\n    const stableEvents = detachedSnapshot(\n      current.events,\n      `loadSpawnForest tree ${JSON.stringify(current.root)}`,\n    )\n    const viewEvents =\n      current.ownerSpawn === undefined ||\n      stableEvents.some((event) => event.kind === 'spawned' && event.id === current.ownerSpawn?.id)\n        ? [...stableEvents]\n        : [ownedTreeRootSpawn(current.ownerSpawn), ...stableEvents]\n    const view = detachedSnapshot(\n      materializeTreeView(viewEvents),\n      `loadSpawnForest view ${JSON.stringify(current.root)}`,\n    )\n    trees.push({\n      root: current.root,\n      ...(current.ownerNodeId === undefined ? {} : { ownerNodeId: current.ownerNodeId }),\n      ...(current.parentTreeRoot === undefined ? {} : { parentTreeRoot: current.parentTreeRoot }),\n      events: stableEvents,\n      view,\n    })\n    // The owner is already a real node in its parent tree. Keep it in this tree's local view so\n    // metered root events have a node, but omit the synthetic duplicate from the flattened list.\n    nodes.push(\n      ...view.nodes\n        .filter((node) => current.ownerNodeId === undefined || node.id !== current.ownerNodeId)\n        .map((node) => ({ treeRoot: current.root, ...node })),\n    )\n    events.push(...stableEvents.map((event) => ({ treeRoot: current.root, event })))\n\n    const terminal = new Set<NodeId>()\n    for (const event of stableEvents) {\n      if (event.kind === 'settled' || event.kind === 'cancelled') terminal.add(event.id)\n    }\n    const spawns = stableEvents\n      .filter(\n        (event): event is Extract<SpawnEvent, { kind: 'spawned' }> => event.kind === 'spawned',\n      )\n      .sort((a, b) => a.seq - b.seq || a.id.localeCompare(b.id))\n    for (const spawn of spawns) {\n      if (spawn.parent !== undefined && !terminal.has(spawn.id)) {\n        inDoubt.push({\n          treeRoot: current.root,\n          nodeId: spawn.id,\n          label: spawn.label,\n          runtime: spawn.runtime,\n        })\n      }\n      if (spawn.ownedTreeRoot === undefined) continue\n      const expectedRoot = nestedDriverTreeRoot(current.root, spawn.id)\n      if (spawn.ownedTreeRoot !== expectedRoot) {\n        throw new Error(\n          `loadSpawnForest: node '${spawn.id}' owns non-canonical tree '${spawn.ownedTreeRoot}'; expected '${expectedRoot}'`,\n        )\n      }\n      const nestedRoot = spawn.ownedTreeRoot\n      const nestedEvents = await journal.loadTree(nestedRoot)\n      if (nestedEvents === undefined) {\n        missingTrees.push({\n          parentTreeRoot: current.root,\n          ownerNodeId: spawn.id,\n          root: nestedRoot,\n        })\n        continue\n      }\n      queue.push({\n        root: nestedRoot,\n        events: nestedEvents,\n        ownerNodeId: spawn.id,\n        parentTreeRoot: current.root,\n        ownerSpawn: spawn,\n      })\n    }\n  }\n\n  return detachedSnapshot(\n    { root, trees, nodes, events, inDoubt, missingTrees },\n    'loadSpawnForest result',\n  )\n}\n\n/** Owned journal trees record the owner's turns and descendants, but the owner's spawn belongs to\n * the parent tree. Supply a view-only parentless copy so strict materialization can fold root\n * metering without weakening its missing-spawn corruption check for ordinary event lists. */\nfunction ownedTreeRootSpawn(\n  spawn: Extract<SpawnEvent, { kind: 'spawned' }>,\n): Extract<SpawnEvent, { kind: 'spawned' }> {\n  const { parent: _parent, ownedTreeRoot: _ownedTreeRoot, ...root } = spawn\n  return root\n}\n\n/**\n * Aggregate provider-served model evidence across one recursively owned journal forest.\n *\n * The parent tree records an owned driver's terminal summary, while that driver's own inference\n * and descendants live in its owned tree. This reducer follows the forest reader's explicit tree\n * edges and consumes each tree's metered attempts plus terminal leaf settlements exactly once.\n * A summary node is skipped because its owned tree supplies the source records. Plan materialization\n * is intentionally not read: it proves only what Runtime requested, not what a provider served.\n *\n * Missing legacy evidence, an unfinished node, an unopened owned tree, an identity conflict, and a\n * paid attempt without a qualified served snapshot all return unknown. An explicit\n * `providerDispatch: \"not_started\"` arm and Runtime accounting-only metered records are ignored\n * for served-model identity, while absent or malformed legacy data remains unknown here.\n */\nexport function aggregateProviderModelEvidence(\n  forest: SpawnForest,\n): ProviderModelExecutionEvidence {\n  const attempts: ProviderModelAttemptEvidence[] = []\n  const observedModels = new Set<string>()\n  const canonicalModels = new Set<string>()\n  const nodes = new Map<string, SpawnForestNode>()\n  let reason: 'provider-model-missing' | 'provider-model-conflict' | undefined\n  let sawProviderEvidence = false\n\n  for (const node of forest.nodes) nodes.set(forestNodeKey(node.treeRoot, node.id), node)\n  if (forest.missingTrees.length > 0 || forest.inDoubt.length > 0) {\n    reason = 'provider-model-missing'\n  }\n\n  const markMissing = () => {\n    reason ??= 'provider-model-missing'\n  }\n  const markConflict = () => {\n    reason = 'provider-model-conflict'\n  }\n\n  const append = (raw: unknown): void => {\n    sawProviderEvidence = true\n    if (!isProviderEvidenceObject(raw)) {\n      markMissing()\n      return\n    }\n    if (raw.status === 'unknown') {\n      if (raw.reason === 'provider-model-conflict') {\n        markConflict()\n      } else if (!hasOnlyNotStartedAttempts(raw)) {\n        markMissing()\n      }\n    } else if (raw.status !== 'known') {\n      markMissing()\n      return\n    }\n    if (!Array.isArray(raw.attempts) || !Array.isArray(raw.models)) {\n      markMissing()\n      return\n    }\n\n    const declared = new Set<string>()\n    for (const model of raw.models) {\n      if (typeof model !== 'string' || model.length === 0) {\n        markMissing()\n      } else {\n        declared.add(model)\n      }\n    }\n    const observedInRecord = new Set<string>()\n    for (const rawAttempt of raw.attempts) {\n      if (!isProviderAttemptEvidence(rawAttempt)) {\n        markMissing()\n        continue\n      }\n      if (rawAttempt.identityConflict === true) markConflict()\n      const observations = [...rawAttempt.observations]\n      if (rawAttempt.providerDispatch === 'not_started') {\n        if (observations.length > 0) markMissing()\n        attempts.push(\n          Object.freeze({\n            observations: Object.freeze([]),\n            providerDispatch: 'not_started' as const,\n            ...(rawAttempt.identityConflict === true ? { identityConflict: true } : {}),\n          }),\n        )\n        continue\n      }\n      if (observations.length === 0) {\n        markMissing()\n        attempts.push(\n          Object.freeze({\n            observations: Object.freeze([]),\n            ...(rawAttempt.identityConflict === true ? { identityConflict: true } : {}),\n          }),\n        )\n        continue\n      }\n      let base: string | undefined\n      let snapshot: string | undefined\n      for (const model of observations) {\n        if (typeof model !== 'string' || model.length === 0) {\n          markMissing()\n          continue\n        }\n        observedInRecord.add(model)\n        observedModels.add(model)\n        const identity = servedIdentityParts(model)\n        if (identity === undefined) {\n          markMissing()\n          continue\n        }\n        if (base !== undefined && base !== identity.base) markConflict()\n        if (\n          snapshot !== undefined &&\n          identity.snapshot !== undefined &&\n          snapshot !== identity.snapshot\n        ) {\n          markConflict()\n        }\n        base = identity.base\n        snapshot ??= identity.snapshot\n        if (identity.snapshot !== undefined) {\n          canonicalModels.add(`${identity.base}@${identity.snapshot}`)\n          if (canonicalModels.size > 1) markConflict()\n        }\n      }\n      if (base === undefined || snapshot === undefined) markMissing()\n      attempts.push(\n        Object.freeze({\n          observations: Object.freeze(observations),\n          ...(rawAttempt.identityConflict === true ? { identityConflict: true } : {}),\n        }),\n      )\n    }\n    if (\n      declared.size !== observedInRecord.size ||\n      [...declared].some((model) => !observedInRecord.has(model))\n    ) {\n      markMissing()\n    }\n  }\n\n  const terminal = (\n    treeRoot: NodeId,\n    event: Extract<SpawnEvent, { kind: 'settled' | 'cancelled' }>,\n  ) => {\n    const node = nodes.get(forestNodeKey(treeRoot, event.id))\n    if (node === undefined) {\n      markMissing()\n      return\n    }\n    // This event is a parent-side summary. Its owned tree is the authoritative source and is\n    // traversed above; consuming its summary here would count nested attempts twice.\n    if (node.ownedTreeRoot !== undefined) return\n    if (event.kind === 'cancelled') {\n      markMissing()\n      return\n    }\n    append(event.providerModel ?? node.providerModel)\n  }\n\n  for (const tree of forest.trees) {\n    for (const event of tree.events) {\n      if (event.kind === 'metered') {\n        if (event.accountingOnly === true) {\n          if (event.providerModel !== undefined) markMissing()\n          continue\n        }\n        // The parent scope re-homes a driver's nested metered spend onto the driver's parent node.\n        // Its owned tree carries the provider attempts; consuming this summary would both\n        // double-count and treat the spend-only legacy summary as missing identity evidence.\n        const summaryNode = nodes.get(forestNodeKey(tree.root, event.id))\n        if (summaryNode?.ownedTreeRoot !== undefined) continue\n        const evidence = (event as SpawnEvent & { providerModel?: unknown }).providerModel\n        if (evidence === undefined) markMissing()\n        else append(evidence)\n      } else if (event.kind === 'settled' || event.kind === 'cancelled') {\n        terminal(tree.root, event)\n      }\n    }\n  }\n\n  if (!sawProviderEvidence || attempts.length === 0 || observedModels.size === 0) {\n    reason ??= 'provider-model-missing'\n  }\n  const models = Object.freeze([...observedModels])\n  const frozenAttempts = Object.freeze(attempts)\n  return Object.freeze(\n    reason === undefined\n      ? { status: 'known' as const, attempts: frozenAttempts, models }\n      : { status: 'unknown' as const, attempts: frozenAttempts, models, reason },\n  )\n}\n\nfunction forestNodeKey(treeRoot: NodeId, nodeId: NodeId): string {\n  return `${treeRoot}\\u0000${nodeId}`\n}\n\nfunction isProviderEvidenceObject(value: unknown): value is ProviderModelExecutionEvidence {\n  return typeof value === 'object' && value !== null && !Array.isArray(value) && 'status' in value\n}\n\nfunction hasOnlyNotStartedAttempts(evidence: ProviderModelExecutionEvidence): boolean {\n  return (\n    Array.isArray(evidence.attempts) &&\n    evidence.attempts.length > 0 &&\n    evidence.attempts.every(\n      (attempt) =>\n        isProviderAttemptEvidence(attempt) &&\n        attempt.providerDispatch === 'not_started' &&\n        attempt.observations.length === 0 &&\n        attempt.identityConflict !== true,\n    )\n  )\n}\n\nfunction isProviderAttemptEvidence(value: unknown): value is ProviderModelAttemptEvidence {\n  return (\n    typeof value === 'object' &&\n    value !== null &&\n    !Array.isArray(value) &&\n    Array.isArray((value as { observations?: unknown }).observations) &&\n    ((value as { providerDispatch?: unknown }).providerDispatch === undefined ||\n      (value as { providerDispatch?: unknown }).providerDispatch === 'not_started')\n  )\n}\n\nfunction servedIdentityParts(\n  model: string,\n): { readonly base: string; readonly snapshot?: string } | undefined {\n  const at = model.lastIndexOf('@')\n  const rawBase = at < 0 ? model : model.slice(0, at)\n  const base = rawBase.slice(rawBase.lastIndexOf('/') + 1)\n  if (base.length === 0) return undefined\n  const snapshot = at < 0 ? undefined : model.slice(at + 1)\n  if (snapshot !== undefined && snapshot.length === 0) return undefined\n  return snapshot === undefined ? { base } : { base, snapshot }\n}\n\ntype SpawnJournalRecord =\n  | { kind: 'begin'; root: NodeId; at: string }\n  | { kind: 'event'; root: NodeId; event: SpawnEvent }\n\n/**\n * Two `seq` namespaces share the journal: a `spawned` event's `seq` is the spawn ordinal\n * (the order children were created), and a `settled`/`cancelled` event's `seq` is the\n * monotonic CURSOR order `scope.next()` yielded that settlement (B2). The uniqueness\n * replay rests on is the cursor namespace — two settlements cannot share the position\n * replay orders by — so the guard checks only settled/cancelled events. A `spawned`\n * ordinal legitimately equals a later `settled` cursor seq and is not a collision.\n */\nfunction assertSeqUnique(root: NodeId, events: SpawnEvent[], ev: SpawnEvent): void {\n  if (ev.kind === 'materialized') {\n    if (events.some((event) => event.kind === 'materialized' && event.id === ev.id)) {\n      throw new Error(\n        `spawn journal corrupted: duplicate materialization receipt for node '${ev.id}' in tree '${root}'`,\n      )\n    }\n    if (!events.some((event) => event.kind === 'spawned' && event.id === ev.id)) {\n      throw new Error(\n        `spawn journal corrupted: materialization for node '${ev.id}' precedes its spawn in tree '${root}'`,\n      )\n    }\n  }\n  if (ev.kind === 'execution-bound') {\n    if (\n      events.some(\n        (event) =>\n          event.kind === 'execution-bound' &&\n          event.id === ev.id &&\n          event.binding.attemptId === ev.binding.attemptId,\n      )\n    ) {\n      throw new Error(\n        `spawn journal corrupted: duplicate execution binding for node '${ev.id}' attempt '${ev.binding.attemptId}' in tree '${root}'`,\n      )\n    }\n    if (!events.some((event) => event.kind === 'materialized' && event.id === ev.id)) {\n      throw new Error(\n        `spawn journal corrupted: execution binding for node '${ev.id}' precedes materialization in tree '${root}'`,\n      )\n    }\n  }\n  // `spawned` (ordinal namespace), `waiting` (the wait-ordinal namespace — it CREATES a node, it\n  // does not settle one), and `metered` (informational spend, no settlement order) live outside\n  // the cursor-uniqueness namespace replay relies on. `woken` IS a settlement and does not.\n  if (outsideCursorNamespace(ev)) return\n  if (events.some((e) => !outsideCursorNamespace(e) && e.seq === ev.seq)) {\n    throw new Error(\n      `spawn journal corrupted: duplicate cursor seq ${ev.seq} in tree '${root}'; ` +\n        'the cursor order replay relies on is not unique',\n    )\n  }\n}\n\n/**\n * The records that CLOSE a node's cursor slot: a settlement, a cancellation, or a wait being\n * woken. The complement question to {@link outsideCursorNamespace}, and the one a resume needs —\n * a kind missing here leaves a finished node looking live, so its budget is never reclaimed and\n * its reservation is replayed as still in doubt.\n */\nexport function closesCursorSlot(ev: SpawnEvent): boolean {\n  return ev.kind === 'settled' || ev.kind === 'cancelled' || ev.kind === 'woken'\n}\n\n/**\n * The kinds that sit OUTSIDE the cursor namespace: node-CREATION and informational records. The\n * cursor namespace is the one whose per-node uniqueness replay ordering rests on, so every side of\n * that guard reads this one list — the seq guard, `materializeTreeView`'s settlement split, and\n * `trajectory`'s close list.\n *\n * Declared once as data. `SpawnEvent` is a discriminated union, so the complement below is\n * COMPUTED rather than hand-written: a twelfth kind lands in the cursor namespace by construction\n * instead of by whichever copies its author remembered to update.\n */\nconst outsideCursorNamespaceKinds = [\n  'spawned',\n  'waiting',\n  'metered',\n  'materialized',\n  'execution-bound',\n  'edge',\n  'teardown-unconfirmed',\n  'trace-unpropagated',\n] as const satisfies ReadonlyArray<SpawnEvent['kind']>\n\ntype OutsideCursorNamespaceKind = (typeof outsideCursorNamespaceKinds)[number]\n\n/** A record that closes or advances a node's cursor slot — the complement of\n *  {@link outsideCursorNamespace}, computed from the union rather than restated. */\nexport type CursorNamespaceEvent = Exclude<SpawnEvent, { kind: OutsideCursorNamespaceKind }>\n\nconst outsideKinds: ReadonlySet<string> = new Set<string>(outsideCursorNamespaceKinds)\n\n/** True for a node-CREATION or informational record. Narrows, so a caller keeps the union's arms. */\nexport function outsideCursorNamespace(\n  ev: SpawnEvent,\n): ev is Extract<SpawnEvent, { kind: OutsideCursorNamespaceKind }> {\n  return outsideKinds.has(ev.kind)\n}\n\n/** True for a record inside the cursor namespace. Narrows to {@link CursorNamespaceEvent}. */\nexport function insideCursorNamespace(ev: SpawnEvent): ev is CursorNamespaceEvent {\n  return !outsideKinds.has(ev.kind)\n}\n\n// ── Replay executor (build step 7) ───────────────────────────────────────────────\n\n/**\n * Re-feed a journaled spawn tree in strict `seq` order, rehydrating each settled\n * child's `out` from the blob store by `outRef`, and return the `Settled[]` exactly\n * as `scope.next()` originally delivered them.\n *\n * Determinism (B2): the events are sorted by `seq` BEFORE any blob `get`, so the\n * replay order is the recorded cursor order regardless of how fast each rehydration\n * resolves. `at` (wall-clock) is never a replay input. Fail loud on a tree that was\n * never begun, a settled-done event missing its `outRef`, or a blob the store can't\n * rehydrate — a silent gap would let `act` branch on the wrong evidence.\n *\n * @stable\n */\nexport async function replaySpawnTree(\n  journal: SpawnJournal,\n  blobs: ResultBlobStore,\n  root: NodeId,\n): Promise<Settled<unknown>[]> {\n  const events = await journal.loadTree(root)\n  if (events === undefined) {\n    throw new Error(`replaySpawnTree: no journaled tree for root '${root}'`)\n  }\n  const ordered = [...events].sort((a, b) => a.seq - b.seq)\n  const labels = new Map<NodeId, string>()\n  const assignmentIds = new Map<NodeId, string>()\n  const identities = new Map<NodeId, NodeExecutionIdentity>()\n  const materializations = new Map<NodeId, NodeSnapshot['materialization']>()\n  const executionBindings = new Map<\n    NodeId,\n    NonNullable<NodeSnapshot['executionBindings']>[number][]\n  >()\n  for (const ev of ordered) {\n    if (ev.kind === 'spawned' || ev.kind === 'waiting') labels.set(ev.id, ev.label)\n    if (ev.kind === 'spawned' && ev.assignmentId !== undefined) {\n      assignmentIds.set(ev.id, ev.assignmentId)\n    }\n    if (ev.kind === 'spawned' && ev.identity !== undefined) {\n      identities.set(ev.id, copyFrozenIdentity(ev.identity))\n    }\n    if (ev.kind === 'materialized') materializations.set(ev.id, ev.receipt)\n    if (ev.kind === 'execution-bound') {\n      const bindings = executionBindings.get(ev.id) ?? []\n      bindings.push(ev.binding)\n      executionBindings.set(ev.id, bindings)\n    }\n  }\n  const handleFor = (id: NodeId, status: NodeStatus) =>\n    replayHandle(id, labels.get(id) ?? id, status, {\n      assignmentId: assignmentIds.get(id),\n      identity: identities.get(id),\n      materialization: materializations.get(id),\n      executionBindings: executionBindings.get(id),\n    })\n  const settlementTime = (at: string): { readonly settledAt?: number } => {\n    const settledAt = Date.parse(at)\n    return Number.isFinite(settledAt) ? { settledAt } : {}\n  }\n  const settled: Settled<unknown>[] = []\n  for (const ev of ordered) {\n    if (ev.kind === 'spawned') continue\n    if (ev.kind === 'waiting') continue // arms a wait node; `woken` is its settlement\n    if (ev.kind === 'metered') continue // a spend record, not a settlement — irrelevant to replay\n    if (ev.kind === 'materialized') continue // wire receipt, not a settlement\n    if (ev.kind === 'execution-bound') continue // attempt transport, not a settlement\n    if (ev.kind === 'edge') continue // edge-ledger observability, not a settlement\n    if (ev.kind === 'teardown-unconfirmed') continue // executor-leak evidence, not a settlement\n    if (ev.kind === 'trace-unpropagated') continue // severed-hop marker, not a settlement\n    if (ev.kind === 'woken') {\n      // A wait that was cancelled carries no outcome blob — it replays as a `down`, exactly as a\n      // cancelled worker does. A fired/timed-out wait rehydrates its `WaitOutcome` and costs zero.\n      if (ev.by === 'cancelled' || ev.outRef === undefined) {\n        settled.push({\n          kind: 'down',\n          handle: handleFor(ev.id, 'cancelled'),\n          reason: 'wait cancelled',\n          infra: false,\n          restartCount: 0,\n          trace: { status: 'unavailable', reason: 'not-an-executor' },\n          ...settlementTime(ev.at),\n          seq: ev.seq,\n        })\n        continue\n      }\n      const outcome = await blobs.get(ev.outRef)\n      if (outcome === undefined) {\n        throw new Error(\n          `replaySpawnTree: blob store has no wait outcome for outRef '${ev.outRef}' (node '${ev.id}', seq ${ev.seq})`,\n        )\n      }\n      settled.push({\n        kind: 'done',\n        handle: handleFor(ev.id, 'done'),\n        out: outcome,\n        outRef: ev.outRef,\n        spent: zeroSpend(),\n        trace: { status: 'unavailable', reason: 'not-an-executor' },\n        ...settlementTime(ev.at),\n        seq: ev.seq,\n      })\n      continue\n    }\n    if (ev.kind === 'cancelled') {\n      settled.push({\n        kind: 'down',\n        handle: handleFor(ev.id, 'cancelled'),\n        reason: ev.reason,\n        infra: false,\n        restartCount: 0,\n        trace: { status: 'unavailable', reason: 'execution-did-not-start' },\n        ...settlementTime(ev.at),\n        seq: ev.seq,\n      })\n      continue\n    }\n    if (ev.status === 'down') {\n      const trace = traceEvidenceFor(ev)\n      if (trace.status === 'available') await workerTraceAnalysisStore(trace, blobs)\n      settled.push({\n        kind: 'down',\n        handle: handleFor(ev.id, 'failed'),\n        // `reason` is written by every current scope. The verdict fallback preserves the\n        // pre-field convention and the generic text keeps still-older reasonless journals usable.\n        reason: ev.reason ?? ev.verdict?.notes ?? 'child down',\n        infra: ev.infra === true,\n        restartCount: 0,\n        ...(ev.providerModel === undefined\n          ? {}\n          : { providerModel: copyProviderModelEvidence(ev.providerModel) }),\n        trace,\n        ...settlementTime(ev.at),\n        seq: ev.seq,\n      })\n      continue\n    }\n    if (ev.outRef === undefined) {\n      throw new Error(\n        `replaySpawnTree: settled-done event for '${ev.id}' (seq ${ev.seq}) has no outRef; ` +\n          'cannot rehydrate the result the driver branched on',\n      )\n    }\n    const out = await blobs.get(ev.outRef)\n    if (out === undefined) {\n      throw new Error(\n        `replaySpawnTree: blob store has no artifact for outRef '${ev.outRef}' (node '${ev.id}', seq ${ev.seq})`,\n      )\n    }\n    const trace = traceEvidenceFor(ev)\n    if (trace.status === 'available') await workerTraceAnalysisStore(trace, blobs)\n    settled.push({\n      kind: 'done',\n      handle: handleFor(ev.id, 'done'),\n      out,\n      outRef: ev.outRef,\n      verdict: ev.verdict,\n      spent: cloneSpend(ev.spent),\n      ...(ev.providerModel === undefined\n        ? {}\n        : { providerModel: copyProviderModelEvidence(ev.providerModel) }),\n      trace,\n      ...settlementTime(ev.at),\n      seq: ev.seq,\n    })\n  }\n  return settled\n}\n\nfunction replayHandle(\n  id: NodeId,\n  label: string,\n  status: NodeStatus,\n  evidence: {\n    readonly assignmentId?: string\n    readonly identity?: NodeExecutionIdentity\n    readonly materialization?: NodeSnapshot['materialization']\n    readonly executionBindings?: ReadonlyArray<\n      NonNullable<NodeSnapshot['executionBindings']>[number]\n    >\n  } = {},\n) {\n  return Object.freeze({\n    id,\n    label,\n    status,\n    ...(evidence.assignmentId === undefined ? {} : { assignmentId: evidence.assignmentId }),\n    ...(evidence.identity === undefined ? {} : { identity: evidence.identity }),\n    ...(evidence.materialization === undefined\n      ? {}\n      : { materialization: evidence.materialization }),\n    ...(evidence.executionBindings === undefined\n      ? {}\n      : { executionBindings: Object.freeze([...evidence.executionBindings]) }),\n    abort() {\n      throw new Error(`cannot abort node '${id}': replayed handles are terminal, not live`)\n    },\n  })\n}\n\n/** A replayed handle must not retain mutable references into the loaded journal event. */\nfunction copyFrozenIdentity(identity: NodeExecutionIdentity): NodeExecutionIdentity {\n  const correlation =\n    identity.correlation === undefined ? undefined : Object.freeze({ ...identity.correlation })\n  return Object.freeze({\n    ...(identity.profileDigest === undefined ? {} : { profileDigest: identity.profileDigest }),\n    ...(identity.taskDigest === undefined ? {} : { taskDigest: identity.taskDigest }),\n    ...(identity.candidateDigest === undefined\n      ? {}\n      : { candidateDigest: identity.candidateDigest }),\n    ...(correlation === undefined ? {} : { correlation }),\n  })\n}\n\n/**\n * Materialize a recorded `TreeView` from a journaled event list for inspection. Folds\n * `spawned`/`settled`/`cancelled` into a per-node snapshot in `seq` order, then adds each\n * `metered` event's driver-inference spend onto its node in a separate additive pass so the view\n * matches the recorded cursor. It does not recover live executors or driver state after restart.\n */\nexport function materializeTreeView(events: SpawnEvent[]): TreeView {\n  const nodes = new Map<NodeId, MutableSnapshot>()\n  let root: NodeId | undefined\n  // `spawned` (ordinal namespace) and `settled`/`cancelled` (cursor namespace) carry\n  // overlapping `seq` values, so create every node before any update — process spawns in\n  // ordinal order, then settlements/cancellations in cursor order. A settle/cancel for an\n  // un-spawned node is a corrupted log (fail loud via requireNode).\n  const spawns = events\n    .filter(\n      (ev): ev is Extract<SpawnEvent, { kind: 'spawned' | 'waiting' }> =>\n        ev.kind === 'spawned' || ev.kind === 'waiting',\n    )\n    .sort((a, b) => a.seq - b.seq)\n  const settlements = events.filter((ev) => insideCursorNamespace(ev)).sort((a, b) => a.seq - b.seq)\n  for (const ev of spawns) {\n    if (ev.kind === 'waiting') {\n      // An ARMED wait reads `waiting` until a `woken` event lands. That is the whole durability\n      // claim: a materialized tree from a journal whose process died mid-wait still shows the wait.\n      nodes.set(ev.id, {\n        id: ev.id,\n        parent: ev.parent,\n        label: ev.label,\n        status: 'waiting',\n        runtime: 'wait',\n        budget: { maxIterations: 0, maxTokens: 0 },\n        spent: zeroSpend(),\n      })\n      continue\n    }\n    if (ev.parent === undefined && root === undefined) root = ev.id\n    nodes.set(ev.id, {\n      id: ev.id,\n      parent: ev.parent,\n      label: ev.label,\n      status: 'pending',\n      runtime: ev.runtime,\n      budget: ev.budget,\n      ...(ev.ownedTreeRoot === undefined ? {} : { ownedTreeRoot: ev.ownedTreeRoot }),\n      ...(ev.assignmentId === undefined ? {} : { assignmentId: ev.assignmentId }),\n      ...(ev.identity ? { identity: ev.identity } : {}),\n      spent: zeroSpend(),\n    })\n  }\n  for (const ev of settlements) {\n    if (ev.kind === 'settled') {\n      const node = requireNode(nodes, ev.id)\n      node.status = ev.status === 'done' ? 'done' : 'failed'\n      node.spent = cloneSpend(ev.spent)\n      node.providerModel = copyProviderModelEvidence(ev.providerModel)\n      node.outRef = ev.outRef\n      node.trace = traceEvidenceFor(ev)\n      const settledAt = Date.parse(ev.at)\n      if (Number.isFinite(settledAt)) node.settledAt = settledAt\n    } else if (ev.kind === 'woken') {\n      const node = requireNode(nodes, ev.id)\n      node.status = ev.by === 'cancelled' ? 'cancelled' : 'done'\n      node.outRef = ev.outRef\n      node.trace = { status: 'unavailable', reason: 'not-an-executor' }\n      const settledAt = Date.parse(ev.at)\n      if (Number.isFinite(settledAt)) node.settledAt = settledAt\n    } else {\n      const node = requireNode(nodes, ev.id)\n      node.status = 'cancelled'\n      node.trace = { status: 'unavailable', reason: 'execution-did-not-start' }\n      const settledAt = Date.parse(ev.at)\n      if (Number.isFinite(settledAt)) node.settledAt = settledAt\n    }\n  }\n  // Materialization is node evidence, not a settlement. Fold it after node creation and before\n  // freezing the view; exactly one receipt per node is enforced by the journal corruption guard.\n  for (const ev of events) {\n    if (ev.kind !== 'materialized') continue\n    const node = requireNode(nodes, ev.id)\n    node.materialization = ev.receipt\n    node.runtime = ev.receipt.runtime\n  }\n  for (const ev of events) {\n    if (ev.kind !== 'execution-bound') continue\n    const node = requireNode(nodes, ev.id)\n    node.executionBindings ??= []\n    node.executionBindings.push(ev.binding)\n  }\n  // Driver inference: a separate pass so it accumulates ONTO the settled child-work base (no\n  // dependence on metered-vs-settled seq order) without touching node status.\n  for (const ev of events) {\n    if (ev.kind !== 'metered') continue\n    const node = requireNode(nodes, ev.id)\n    node.spent = addSpend(node.spent, ev.spend)\n  }\n  const snapshots = [...nodes.values()].map(freezeSnapshot)\n  return {\n    root: root ?? snapshots[0]?.id ?? '',\n    nodes: snapshots,\n    inFlight: snapshots.filter((n) => n.status === 'running' || n.status === 'acquiring').length,\n    waiting: snapshots.filter((n) => n.status === 'waiting').length,\n  }\n}\n\n/**\n * The waits a journaled tree shows as ARMED but never woken — what a resumed run re-arms with the\n * ORIGINAL absolute deadline. Reading it from the journal (rather than from any live state) is\n * what makes \"SIGKILL a waiting tree, a new process keeps waiting to the same instant\" true.\n */\nexport function pendingWaits(events: SpawnEvent[]): PendingWait[] {\n  const woken = new Set<NodeId>()\n  for (const ev of events) if (ev.kind === 'woken') woken.add(ev.id)\n  const pending: PendingWait[] = []\n  for (const ev of events) {\n    if (ev.kind !== 'waiting' || woken.has(ev.id)) continue\n    pending.push({\n      id: ev.id,\n      label: ev.label,\n      spec: ev.spec,\n      armedAt: ev.armedAt,\n      ordinal: ev.seq,\n    })\n  }\n  return pending.sort((a, b) => a.ordinal - b.ordinal)\n}\n\ninterface MutableSnapshot {\n  id: NodeId\n  parent?: NodeId\n  label: string\n  status: NodeStatus\n  runtime: Runtime\n  budget: NodeSnapshot['budget']\n  ownedTreeRoot?: NodeSnapshot['ownedTreeRoot']\n  assignmentId?: string\n  identity?: NodeSnapshot['identity']\n  materialization?: NodeSnapshot['materialization']\n  executionBindings?: NonNullable<NodeSnapshot['executionBindings']>[number][]\n  spent: Spend\n  providerModel?: NodeSnapshot['providerModel']\n  outRef?: string\n  trace?: NodeSnapshot['trace']\n  settledAt?: number\n}\n\n/** Copy provider evidence at the journal boundary so replay never exposes mutable event state. */\nfunction copyProviderModelEvidence(\n  evidence: NodeSnapshot['providerModel'],\n): NodeSnapshot['providerModel'] {\n  if (evidence === undefined) return undefined\n  const attempts = Object.freeze(\n    evidence.attempts.map((attempt) =>\n      Object.freeze({\n        observations: Object.freeze([...attempt.observations]),\n        ...(attempt.identityConflict ? { identityConflict: true } : {}),\n        ...(attempt.providerDispatch === 'not_started'\n          ? { providerDispatch: 'not_started' as const }\n          : {}),\n      }),\n    ),\n  )\n  const models = Object.freeze([...evidence.models])\n  return Object.freeze(\n    evidence.status === 'unknown'\n      ? { status: 'unknown' as const, attempts, models, reason: evidence.reason }\n      : { status: 'known' as const, attempts, models },\n  )\n}\n\nfunction requireNode(nodes: Map<NodeId, MutableSnapshot>, id: NodeId): MutableSnapshot {\n  const node = nodes.get(id)\n  if (!node) {\n    throw new Error(`spawn journal corrupted: settle/cancel for node '${id}' with no prior spawn`)\n  }\n  return node\n}\n\nfunction freezeSnapshot(node: MutableSnapshot): NodeSnapshot {\n  return {\n    id: node.id,\n    parent: node.parent,\n    label: node.label,\n    status: node.status,\n    runtime: node.runtime,\n    budget: node.budget,\n    ownedTreeRoot: node.ownedTreeRoot,\n    assignmentId: node.assignmentId,\n    identity: node.identity,\n    materialization: node.materialization,\n    executionBindings:\n      node.executionBindings === undefined ? undefined : Object.freeze([...node.executionBindings]),\n    spent: node.spent,\n    providerModel: node.providerModel,\n    outRef: node.outRef,\n    trace: node.trace,\n    settledAt: node.settledAt,\n  }\n}\n\nfunction traceEvidenceFor(\n  event: Extract<SpawnEvent, { kind: 'settled' }>,\n): NonNullable<NodeSnapshot['trace']> {\n  return (\n    event.trace ?? {\n      status: 'unavailable',\n      reason: 'legacy-settlement-without-trace-evidence',\n    }\n  )\n}\n"],"mappings":";;;;;;;;AAGA,SAAgB,eAAe,UAA2B;CAExD,OAAO,UADK,WAAW,QAAQ,CAAC,CAAC,OAAO,gBAAgB,QAAQ,GAAG,OAAO,CAAC,CAAC,OAAO,KAChE;AACrB;AAEA,SAAS,gBAAgB,OAAwB;CAC/C,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU,OAAO,KAAK,UAAU,KAAK,KAAK;CACjF,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO,IAAI,MAAM,IAAI,eAAe,CAAC,CAAC,KAAK,GAAG,EAAE;CAI1E,OAAO,IAHS,OAAO,QAAQ,KAAgC,CAAC,CAC7D,QAAQ,GAAG,OAAO,MAAM,KAAA,CAAS,CAAC,CAClC,MAAM,CAAC,IAAI,CAAC,OAAQ,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,CAC/B,CAAC,CAAC,KAAK,CAAC,GAAG,OAAO,GAAG,KAAK,UAAU,CAAC,EAAE,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE;AAC7F;;;;;;;;;;;;;;ACSA,MAAa,mCAAmC;;AAShD,SAAgB,qBAAqB,OAA6C;CAChF,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU,OAAO;CACxD,MAAM,QAAQ;CACd,OACE,OAAO,MAAM,gBAAgB,cAC7B,OAAO,MAAM,gBAAgB,cAC7B,OAAO,MAAM,gBAAgB,cAC7B,OAAO,MAAM,cAAc,cAC3B,OAAO,MAAM,cAAc,cAC3B,OAAO,MAAM,gBAAgB,cAC7B,OAAO,MAAM,eAAe;AAEhC;;AAGA,eAAsB,2BACpB,YACA,OACA,UAC8B;CAC9B,IAAI,CAAC,UAAU,OAAO,YAAY,yBAAyB;CAC3D,IAAI,eAAe,KAAA,GAAW,OAAO,YAAY,sCAAsC;CAEvF,IAAI;CACJ,IAAI;EACF,SAAS,WAAW;CACtB,QAAQ;EACN,OAAO,YAAY,0BAA0B;CAC/C;CACA,IAAI,WAAW,KAAA,GAAW,OAAO,YAAY,0BAA0B;CAEvE,IAAI;CACJ,IAAI;EACF,YAAY,MAAM,OAAO,QAAQ;CACnC,QAAQ;EACN,OAAO,YAAY,yBAAyB;CAC9C;CACA,IAAI,CAAC,MAAM,QAAQ,SAAS,KAAK,UAAU,MAAM,SAAS,CAAC,gBAAgB,IAAI,CAAC,GAC9E,OAAO,YAAY,oBAAoB;CAEzC,IAAI,UAAU,WAAW,GAAG,OAAO,YAAY,wBAAwB;CAEvE,IAAI;CACJ,IAAI;CACJ,IAAI;EACF,MAAM,WAAW,gBAAgB,SAAS;EAG1C,8BAA8B,QAAQ;EACtC,WAAW;GACT,eAAA;GACA,OAAO;EACT;EACA,WAAW,eAAe,QAAQ;CACpC,QAAQ;EACN,OAAO,YAAY,oBAAoB;CACzC;CACA,IAAI;EACF,MAAM,MAAM,IAAI,UAAU,QAAQ;CACpC,QAAQ;EACN,OAAO,YAAY,0BAA0B;CAC/C;CACA,OAAO,OAAO,OAAO;EAAE,QAAQ;EAAa;EAAU,WAAW,SAAS,MAAM;CAAO,CAAC;AAC1F;;AAGA,eAAsB,yBACpB,UACA,OAC6B;CAC7B,IAAI,SAAS,WAAW,eAEtB,OAAO,8BAA8B,KAAA,CAAS;CAEhD,MAAM,MAAM,MAAM,MAAM,IAAI,SAAS,QAAQ;CAC7C,IAAI,QAAQ,KAAA,GACV,MAAM,IAAI,gBACR,sBAAsB,SAAS,SAAS,oDAC1C;CAEF,MAAM,WAAW,6BAA6B,KAAK,SAAS,QAAQ;CACpE,IAAI,SAAS,MAAM,WAAW,SAAS,WACrC,MAAM,IAAI,gBACR,sBAAsB,SAAS,SAAS,QAAQ,SAAS,MAAM,OAAO,oCAAoC,SAAS,WACrH;CAEF,OAAO,8BAA8B,SAAS,KAAK;AACrD;;AAGA,SAAgB,6BACd,OACA,WAAW,aACc;CACzB,IACE,UAAU,QACV,OAAO,UAAU,YAChB,MAAsC,kBAAA,KACvC,CAAC,MAAM,QAAS,MAA8B,KAAK,GAEnD,MAAM,IAAI,gBACR,sBAAsB,SAAS,yCACjC;CAEF,MAAM,QAAS,MAA+B;CAC9C,IAAI,MAAM,WAAW,GAEnB,OAAO;EACL,eAAA;EACO;CACT;CAEF,IAAI,MAAM,MAAM,SAAS,CAAC,gBAAgB,IAAI,CAAC,GAC7C,MAAM,IAAI,gBAAgB,sBAAsB,SAAS,2BAA2B;CAEtF,OAAO;EACL,eAAA;EACO;CACT;AACF;AAEA,SAAS,YAAY,QAA2E;CAC9F,OAAO,OAAO,OAAO;EAAE,QAAQ;EAAwB;CAAO,CAAC;AACjE;AAEA,SAAS,gBAAgB,OAAmC;CAC1D,IAAI;EACF,OAAO,WAAW,KAAa;CACjC,QAAQ;EACN,OAAO;CACT;AACF;;;;ACjKA,MAAa,gBAAgB;AAK7B,MAAM,yCAAyB,IAAI,QAAgB;;AAGnD,SAAgB,qBAAqB,gBAAwB,cAA8B;CACzF,OAAO,GAAG,eAAe,GAAG;AAC9B;;AAGA,SAAgB,4BAA8C,OAAa;CACzE,uBAAuB,IAAI,KAAK;CAChC,OAAO;AACT;;AAGA,SAAgB,iCACd,OACA,gBACA,cACoB;CACpB,OAAO,uBAAuB,IAAI,KAAK,IACnC,qBAAqB,gBAAgB,YAAY,IACjD,KAAA;AACN;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC0FA,IAAa,0BAAb,MAAgE;CAC9D,wBAAyB,IAAI,IAAqB;CAElD,MAAM,IAAI,QAAgB,UAAkC;EAC1D,qBAAqB,QAAQ,QAAQ;EACrC,KAAK,MAAM,IAAI,QAAQ,QAAQ;CACjC;CAEA,MAAM,IAAI,QAA8C;EACtD,OAAO,KAAK,MAAM,IAAI,MAAM,IAAI,KAAK,MAAM,IAAI,MAAM,IAAI,KAAA;CAC3D;AACF;;;;;;;;AASA,IAAa,sBAAb,MAA4D;CAC7B;CAA7B,YAAY,KAA8B;EAAb,KAAA,MAAA;CAAc;CAE3C,MAAM,IAAI,QAAgB,UAAkC;EAC1D,qBAAqB,QAAQ,QAAQ;EACrC,MAAM,KAAK,MAAM,OAAO;EACxB,MAAM,GAAG,MAAM,KAAK,KAAK,EAAE,WAAW,KAAK,CAAC;EAC5C,MAAM,KAAK,MAAM,GAAG,KAAK,KAAK,SAAS,MAAM,GAAG,GAAG;EACnD,IAAI;GACF,MAAM,GAAG,MAAM,KAAK,UAAU,QAAQ,CAAC;GACvC,MAAM,GAAG,KAAK;EAChB,UAAU;GACR,MAAM,GAAG,MAAM;EACjB;CACF;CAEA,MAAM,IAAI,QAA8C;EACtD,MAAM,KAAK,MAAM,OAAO;EACxB,IAAI;EACJ,IAAI;GACF,OAAO,MAAM,GAAG,SAAS,KAAK,SAAS,MAAM,GAAG,MAAM;EACxD,SAAS,KAAK;GACZ,IAAI,aAAa,GAAG,GAAG,OAAO,KAAA;GAC9B,MAAM;EACR;EACA,OAAO,KAAK,MAAM,IAAI;CACxB;CAEA,SAAiB,QAAwB;EACvC,OAAO,GAAG,KAAK,IAAI,GAAG,OAAO,QAAQ,MAAM,GAAG,EAAE;CAClD;AACF;AAEA,SAAS,qBAAqB,QAAgB,UAAyB;CACrE,MAAM,WAAW,eAAe,QAAQ;CACxC,IAAI,WAAW,UACb,MAAM,IAAI,MACR,gBAAgB,OAAO,8CAA8C,SAAS,oFAEhF;AAEJ;;;;;;;;;;AAaA,IAAa,uBAAb,MAA0D;CACxD,wBAAyB,IAAI,IAAuD;CAEpF,MAAM,SAAS,MAAiD;EAC9D,MAAM,OAAO,KAAK,MAAM,IAAI,IAAI;EAChC,IAAI,CAAC,MAAM,OAAO,KAAA;EAClB,OAAO,KAAK,OAAO,KAAK,QAAQ,EAAE,GAAG,GAAG,EAAE;CAC5C;CAEA,MAAM,UAAU,MAAc,IAA2B;EACvD,MAAM,WAAW,KAAK,MAAM,IAAI,IAAI;EACpC,IAAI,UAAU;GACZ,IAAI,SAAS,YAAY,IACvB,MAAM,IAAI,MACR,eAAe,KAAK,qBAAqB,SAAS,QAAQ,+BAA+B,IAC3F;GAEF;EACF;EACA,KAAK,MAAM,IAAI,MAAM;GAAE,SAAS;GAAI,QAAQ,CAAC;EAAE,CAAC;CAClD;CAEA,MAAM,YAAY,MAAc,IAA+B;EAC7D,MAAM,OAAO,KAAK,MAAM,IAAI,IAAI;EAChC,IAAI,CAAC,MACH,MAAM,IAAI,MAAM,8CAA8C,KAAK,wBAAwB;EAE7F,gBAAgB,MAAM,KAAK,QAAQ,EAAE;EACrC,KAAK,OAAO,KAAK,EAAE,GAAG,GAAG,CAAC;CAC5B;AACF;;;;;;;;;;AAWA,IAAa,mBAAb,MAAsD;CAGvB;CAF7B,aAAoC,QAAQ,QAAQ;CAEpD,YAAY,MAA+B;EAAd,KAAA,OAAA;CAAe;CAE5C,MAAM,SAAS,MAAiD;EAC9D,MAAM,KAAK,MAAM,OAAO;EACxB,IAAI;EACJ,IAAI;GACF,OAAO,MAAM,GAAG,SAAS,KAAK,MAAM,MAAM;EAC5C,SAAS,KAAK;GACZ,IAAI,aAAa,GAAG,GAAG,OAAO,KAAA;GAC9B,MAAM;EACR;EACA,IAAI,QAAQ;EACZ,MAAM,SAAuB,CAAC;EAC9B,KAAK,MAAM,UAAU,wBAA4C,MAAM,KAAK,IAAI,GAAG;GACjF,IAAI,OAAO,SAAS,MAAM;GAC1B,IAAI,OAAO,SAAS,SAClB,QAAQ;QACH;IACL,IAAI,CAAC,OACH,MAAM,IAAI,MACR,4CAA4C,KAAK,4BACnD;IAEF,gBAAgB,MAAM,QAAQ,OAAO,KAAK;IAC1C,OAAO,KAAK,OAAO,KAAK;GAC1B;EACF;EACA,OAAO,QAAQ,SAAS,KAAA;CAC1B;CAEA,MAAM,UAAU,MAAc,IAA2B;EACvD,MAAM,WAAW,MAAM,KAAK,cAAc,IAAI;EAC9C,IAAI,UAAU;GACZ,IAAI,aAAa,IACf,MAAM,IAAI,MACR,eAAe,KAAK,qBAAqB,KAAK,KAAK,MAAM,SAAS,+BAA+B,IACnG;GAEF;EACF;EACA,MAAM,KAAK,aAAa;GAAE,MAAM;GAAS;GAAM;EAAG,CAAC;CACrD;CAEA,MAAM,YAAY,MAAc,IAA+B;EAC7D,MAAM,SAAS,MAAM,KAAK,SAAS,IAAI;EACvC,IAAI,WAAW,KAAA,GACb,MAAM,IAAI,MAAM,8CAA8C,KAAK,wBAAwB;EAE7F,gBAAgB,MAAM,QAAQ,EAAE;EAChC,MAAM,KAAK,aAAa;GAAE,MAAM;GAAS;GAAM,OAAO;EAAG,CAAC;CAC5D;CAEA,MAAc,cAAc,MAA2C;EACrE,MAAM,KAAK,MAAM,OAAO;EACxB,IAAI;EACJ,IAAI;GACF,OAAO,MAAM,GAAG,SAAS,KAAK,MAAM,MAAM;EAC5C,SAAS,KAAK;GACZ,IAAI,aAAa,GAAG,GAAG,OAAO,KAAA;GAC9B,MAAM;EACR;EACA,KAAK,MAAM,UAAU,wBAA4C,MAAM,KAAK,IAAI,GAC9E,IAAI,OAAO,SAAS,QAAQ,OAAO,SAAS,SAAS,OAAO,OAAO;CAGvE;CAEA,MAAc,aAAa,QAA2C;EACpE,MAAM,SAAS,KAAK,WAAW,WAAW,KAAK,YAAY,MAAM,CAAC;EAClE,KAAK,aAAa,OAAO,YAAY,KAAA,CAAS;EAC9C,OAAO;CACT;CAEA,MAAc,YAAY,QAA2C;EACnE,MAAM,KAAK,MAAM,OAAO;EACxB,MAAM,OAAO,MAAM,OAAO;EAC1B,MAAM,GAAG,MAAM,KAAK,QAAQ,KAAK,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;EAC3D,MAAM,iBAAiB,MAAM,mBAAmB,KAAK,IAAI;EACzD,MAAM,KAAK,MAAM,GAAG,KAAK,KAAK,MAAM,GAAG;EACvC,IAAI;GACF,MAAM,cAAc,IAAI,GAAG,iBAAiB,OAAO,KAAK,KAAK,UAAU,MAAM,EAAE,GAAG;GAClF,MAAM,GAAG,KAAK;EAChB,UAAU;GACR,MAAM,GAAG,MAAM;EACjB;CACF;AACF;;;;;;;;;;;;;;;;;;AAmBA,eAAsB,gBAAgB,SAAuB,MAAoC;CAC/F,MAAM,aAAa,MAAM,QAAQ,SAAS,IAAI;CAC9C,IAAI,eAAe,KAAA,GACjB,MAAM,IAAI,MAAM,gDAAgD,KAAK,EAAE;CAGzE,MAAM,QAA2B,CAAC;CAClC,MAAM,QAA2B,CAAC;CAClC,MAAM,SAA6B,CAAC;CACpC,MAAM,UAAoC,CAAC;CAC3C,MAAM,eAAyC,CAAC;CAChD,MAAM,0BAAU,IAAI,IAAY;CAChC,MAAM,QAOD,CAAC;EAAE;EAAM,QAAQ;CAAW,CAAC;CAElC,KAAK,IAAI,SAAS,GAAG,SAAS,MAAM,QAAQ,UAAU,GAAG;EACvD,MAAM,UAAU,MAAM;EACtB,IAAI,QAAQ,IAAI,QAAQ,IAAI,GAC1B,MAAM,IAAI,MAAM,4CAA4C,QAAQ,KAAK,oBAAoB;EAE/F,QAAQ,IAAI,QAAQ,IAAI;EACxB,MAAM,eAAe,iBACnB,QAAQ,QACR,wBAAwB,KAAK,UAAU,QAAQ,IAAI,GACrD;EAMA,MAAM,OAAO,iBACX,oBALA,QAAQ,eAAe,KAAA,KACvB,aAAa,MAAM,UAAU,MAAM,SAAS,aAAa,MAAM,OAAO,QAAQ,YAAY,EAAE,IACxF,CAAC,GAAG,YAAY,IAChB,CAAC,mBAAmB,QAAQ,UAAU,GAAG,GAAG,YAAY,CAE9B,GAC9B,wBAAwB,KAAK,UAAU,QAAQ,IAAI,GACrD;EACA,MAAM,KAAK;GACT,MAAM,QAAQ;GACd,GAAI,QAAQ,gBAAgB,KAAA,IAAY,CAAC,IAAI,EAAE,aAAa,QAAQ,YAAY;GAChF,GAAI,QAAQ,mBAAmB,KAAA,IAAY,CAAC,IAAI,EAAE,gBAAgB,QAAQ,eAAe;GACzF,QAAQ;GACR;EACF,CAAC;EAGD,MAAM,KACJ,GAAG,KAAK,MACL,QAAQ,SAAS,QAAQ,gBAAgB,KAAA,KAAa,KAAK,OAAO,QAAQ,WAAW,CAAC,CACtF,KAAK,UAAU;GAAE,UAAU,QAAQ;GAAM,GAAG;EAAK,EAAE,CACxD;EACA,OAAO,KAAK,GAAG,aAAa,KAAK,WAAW;GAAE,UAAU,QAAQ;GAAM;EAAM,EAAE,CAAC;EAE/E,MAAM,2BAAW,IAAI,IAAY;EACjC,KAAK,MAAM,SAAS,cAClB,IAAI,MAAM,SAAS,aAAa,MAAM,SAAS,aAAa,SAAS,IAAI,MAAM,EAAE;EAEnF,MAAM,SAAS,aACZ,QACE,UAA6D,MAAM,SAAS,SAC/E,CAAC,CACA,MAAM,GAAG,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,cAAc,EAAE,EAAE,CAAC;EAC3D,KAAK,MAAM,SAAS,QAAQ;GAC1B,IAAI,MAAM,WAAW,KAAA,KAAa,CAAC,SAAS,IAAI,MAAM,EAAE,GACtD,QAAQ,KAAK;IACX,UAAU,QAAQ;IAClB,QAAQ,MAAM;IACd,OAAO,MAAM;IACb,SAAS,MAAM;GACjB,CAAC;GAEH,IAAI,MAAM,kBAAkB,KAAA,GAAW;GACvC,MAAM,eAAe,qBAAqB,QAAQ,MAAM,MAAM,EAAE;GAChE,IAAI,MAAM,kBAAkB,cAC1B,MAAM,IAAI,MACR,0BAA0B,MAAM,GAAG,6BAA6B,MAAM,cAAc,eAAe,aAAa,EAClH;GAEF,MAAM,aAAa,MAAM;GACzB,MAAM,eAAe,MAAM,QAAQ,SAAS,UAAU;GACtD,IAAI,iBAAiB,KAAA,GAAW;IAC9B,aAAa,KAAK;KAChB,gBAAgB,QAAQ;KACxB,aAAa,MAAM;KACnB,MAAM;IACR,CAAC;IACD;GACF;GACA,MAAM,KAAK;IACT,MAAM;IACN,QAAQ;IACR,aAAa,MAAM;IACnB,gBAAgB,QAAQ;IACxB,YAAY;GACd,CAAC;EACH;CACF;CAEA,OAAO,iBACL;EAAE;EAAM;EAAO;EAAO;EAAQ;EAAS;CAAa,GACpD,wBACF;AACF;;;;AAKA,SAAS,mBACP,OAC0C;CAC1C,MAAM,EAAE,QAAQ,SAAS,eAAe,gBAAgB,GAAG,SAAS;CACpE,OAAO;AACT;;;;;;;;;;;;;;;AAgBA,SAAgB,+BACd,QACgC;CAChC,MAAM,WAA2C,CAAC;CAClD,MAAM,iCAAiB,IAAI,IAAY;CACvC,MAAM,kCAAkB,IAAI,IAAY;CACxC,MAAM,wBAAQ,IAAI,IAA6B;CAC/C,IAAI;CACJ,IAAI,sBAAsB;CAE1B,KAAK,MAAM,QAAQ,OAAO,OAAO,MAAM,IAAI,cAAc,KAAK,UAAU,KAAK,EAAE,GAAG,IAAI;CACtF,IAAI,OAAO,aAAa,SAAS,KAAK,OAAO,QAAQ,SAAS,GAC5D,SAAS;CAGX,MAAM,oBAAoB;EACxB,WAAW;CACb;CACA,MAAM,qBAAqB;EACzB,SAAS;CACX;CAEA,MAAM,UAAU,QAAuB;EACrC,sBAAsB;EACtB,IAAI,CAAC,yBAAyB,GAAG,GAAG;GAClC,YAAY;GACZ;EACF;EACA,IAAI,IAAI,WAAW,WACb;OAAA,IAAI,WAAW,2BACjB,aAAa;QACR,IAAI,CAAC,0BAA0B,GAAG,GACvC,YAAY;EAAA,OAET,IAAI,IAAI,WAAW,SAAS;GACjC,YAAY;GACZ;EACF;EACA,IAAI,CAAC,MAAM,QAAQ,IAAI,QAAQ,KAAK,CAAC,MAAM,QAAQ,IAAI,MAAM,GAAG;GAC9D,YAAY;GACZ;EACF;EAEA,MAAM,2BAAW,IAAI,IAAY;EACjC,KAAK,MAAM,SAAS,IAAI,QACtB,IAAI,OAAO,UAAU,YAAY,MAAM,WAAW,GAChD,YAAY;OAEZ,SAAS,IAAI,KAAK;EAGtB,MAAM,mCAAmB,IAAI,IAAY;EACzC,KAAK,MAAM,cAAc,IAAI,UAAU;GACrC,IAAI,CAAC,0BAA0B,UAAU,GAAG;IAC1C,YAAY;IACZ;GACF;GACA,IAAI,WAAW,qBAAqB,MAAM,aAAa;GACvD,MAAM,eAAe,CAAC,GAAG,WAAW,YAAY;GAChD,IAAI,WAAW,qBAAqB,eAAe;IACjD,IAAI,aAAa,SAAS,GAAG,YAAY;IACzC,SAAS,KACP,OAAO,OAAO;KACZ,cAAc,OAAO,OAAO,CAAC,CAAC;KAC9B,kBAAkB;KAClB,GAAI,WAAW,qBAAqB,OAAO,EAAE,kBAAkB,KAAK,IAAI,CAAC;IAC3E,CAAC,CACH;IACA;GACF;GACA,IAAI,aAAa,WAAW,GAAG;IAC7B,YAAY;IACZ,SAAS,KACP,OAAO,OAAO;KACZ,cAAc,OAAO,OAAO,CAAC,CAAC;KAC9B,GAAI,WAAW,qBAAqB,OAAO,EAAE,kBAAkB,KAAK,IAAI,CAAC;IAC3E,CAAC,CACH;IACA;GACF;GACA,IAAI;GACJ,IAAI;GACJ,KAAK,MAAM,SAAS,cAAc;IAChC,IAAI,OAAO,UAAU,YAAY,MAAM,WAAW,GAAG;KACnD,YAAY;KACZ;IACF;IACA,iBAAiB,IAAI,KAAK;IAC1B,eAAe,IAAI,KAAK;IACxB,MAAM,WAAW,oBAAoB,KAAK;IAC1C,IAAI,aAAa,KAAA,GAAW;KAC1B,YAAY;KACZ;IACF;IACA,IAAI,SAAS,KAAA,KAAa,SAAS,SAAS,MAAM,aAAa;IAC/D,IACE,aAAa,KAAA,KACb,SAAS,aAAa,KAAA,KACtB,aAAa,SAAS,UAEtB,aAAa;IAEf,OAAO,SAAS;IAChB,aAAa,SAAS;IACtB,IAAI,SAAS,aAAa,KAAA,GAAW;KACnC,gBAAgB,IAAI,GAAG,SAAS,KAAK,GAAG,SAAS,UAAU;KAC3D,IAAI,gBAAgB,OAAO,GAAG,aAAa;IAC7C;GACF;GACA,IAAI,SAAS,KAAA,KAAa,aAAa,KAAA,GAAW,YAAY;GAC9D,SAAS,KACP,OAAO,OAAO;IACZ,cAAc,OAAO,OAAO,YAAY;IACxC,GAAI,WAAW,qBAAqB,OAAO,EAAE,kBAAkB,KAAK,IAAI,CAAC;GAC3E,CAAC,CACH;EACF;EACA,IACE,SAAS,SAAS,iBAAiB,QACnC,CAAC,GAAG,QAAQ,CAAC,CAAC,MAAM,UAAU,CAAC,iBAAiB,IAAI,KAAK,CAAC,GAE1D,YAAY;CAEhB;CAEA,MAAM,YACJ,UACA,UACG;EACH,MAAM,OAAO,MAAM,IAAI,cAAc,UAAU,MAAM,EAAE,CAAC;EACxD,IAAI,SAAS,KAAA,GAAW;GACtB,YAAY;GACZ;EACF;EAGA,IAAI,KAAK,kBAAkB,KAAA,GAAW;EACtC,IAAI,MAAM,SAAS,aAAa;GAC9B,YAAY;GACZ;EACF;EACA,OAAO,MAAM,iBAAiB,KAAK,aAAa;CAClD;CAEA,KAAK,MAAM,QAAQ,OAAO,OACxB,KAAK,MAAM,SAAS,KAAK,QACvB,IAAI,MAAM,SAAS,WAAW;EAC5B,IAAI,MAAM,mBAAmB,MAAM;GACjC,IAAI,MAAM,kBAAkB,KAAA,GAAW,YAAY;GACnD;EACF;EAKA,IADoB,MAAM,IAAI,cAAc,KAAK,MAAM,MAAM,EAAE,CACjD,CAAC,EAAE,kBAAkB,KAAA,GAAW;EAC9C,MAAM,WAAY,MAAmD;EACrE,IAAI,aAAa,KAAA,GAAW,YAAY;OACnC,OAAO,QAAQ;CACtB,OAAO,IAAI,MAAM,SAAS,aAAa,MAAM,SAAS,aACpD,SAAS,KAAK,MAAM,KAAK;CAK/B,IAAI,CAAC,uBAAuB,SAAS,WAAW,KAAK,eAAe,SAAS,GAC3E,WAAW;CAEb,MAAM,SAAS,OAAO,OAAO,CAAC,GAAG,cAAc,CAAC;CAChD,MAAM,iBAAiB,OAAO,OAAO,QAAQ;CAC7C,OAAO,OAAO,OACZ,WAAW,KAAA,IACP;EAAE,QAAQ;EAAkB,UAAU;EAAgB;CAAO,IAC7D;EAAE,QAAQ;EAAoB,UAAU;EAAgB;EAAQ;CAAO,CAC7E;AACF;AAEA,SAAS,cAAc,UAAkB,QAAwB;CAC/D,OAAO,GAAG,SAAS,QAAQ;AAC7B;AAEA,SAAS,yBAAyB,OAAyD;CACzF,OAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK,KAAK,YAAY;AAC7F;AAEA,SAAS,0BAA0B,UAAmD;CACpF,OACE,MAAM,QAAQ,SAAS,QAAQ,KAC/B,SAAS,SAAS,SAAS,KAC3B,SAAS,SAAS,OACf,YACC,0BAA0B,OAAO,KACjC,QAAQ,qBAAqB,iBAC7B,QAAQ,aAAa,WAAW,KAChC,QAAQ,qBAAqB,IACjC;AAEJ;AAEA,SAAS,0BAA0B,OAAuD;CACxF,OACE,OAAO,UAAU,YACjB,UAAU,QACV,CAAC,MAAM,QAAQ,KAAK,KACpB,MAAM,QAAS,MAAqC,YAAY,MAC9D,MAAyC,qBAAqB,KAAA,KAC7D,MAAyC,qBAAqB;AAErE;AAEA,SAAS,oBACP,OACmE;CACnE,MAAM,KAAK,MAAM,YAAY,GAAG;CAChC,MAAM,UAAU,KAAK,IAAI,QAAQ,MAAM,MAAM,GAAG,EAAE;CAClD,MAAM,OAAO,QAAQ,MAAM,QAAQ,YAAY,GAAG,IAAI,CAAC;CACvD,IAAI,KAAK,WAAW,GAAG,OAAO,KAAA;CAC9B,MAAM,WAAW,KAAK,IAAI,KAAA,IAAY,MAAM,MAAM,KAAK,CAAC;CACxD,IAAI,aAAa,KAAA,KAAa,SAAS,WAAW,GAAG,OAAO,KAAA;CAC5D,OAAO,aAAa,KAAA,IAAY,EAAE,KAAK,IAAI;EAAE;EAAM;CAAS;AAC9D;;;;;;;;;AAcA,SAAS,gBAAgB,MAAc,QAAsB,IAAsB;CACjF,IAAI,GAAG,SAAS,gBAAgB;EAC9B,IAAI,OAAO,MAAM,UAAU,MAAM,SAAS,kBAAkB,MAAM,OAAO,GAAG,EAAE,GAC5E,MAAM,IAAI,MACR,wEAAwE,GAAG,GAAG,aAAa,KAAK,EAClG;EAEF,IAAI,CAAC,OAAO,MAAM,UAAU,MAAM,SAAS,aAAa,MAAM,OAAO,GAAG,EAAE,GACxE,MAAM,IAAI,MACR,sDAAsD,GAAG,GAAG,gCAAgC,KAAK,EACnG;CAEJ;CACA,IAAI,GAAG,SAAS,mBAAmB;EACjC,IACE,OAAO,MACJ,UACC,MAAM,SAAS,qBACf,MAAM,OAAO,GAAG,MAChB,MAAM,QAAQ,cAAc,GAAG,QAAQ,SAC3C,GAEA,MAAM,IAAI,MACR,kEAAkE,GAAG,GAAG,aAAa,GAAG,QAAQ,UAAU,aAAa,KAAK,EAC9H;EAEF,IAAI,CAAC,OAAO,MAAM,UAAU,MAAM,SAAS,kBAAkB,MAAM,OAAO,GAAG,EAAE,GAC7E,MAAM,IAAI,MACR,wDAAwD,GAAG,GAAG,sCAAsC,KAAK,EAC3G;CAEJ;CAIA,IAAI,uBAAuB,EAAE,GAAG;CAChC,IAAI,OAAO,MAAM,MAAM,CAAC,uBAAuB,CAAC,KAAK,EAAE,QAAQ,GAAG,GAAG,GACnE,MAAM,IAAI,MACR,iDAAiD,GAAG,IAAI,YAAY,KAAK,mDAE3E;AAEJ;;;;;;;AAQA,SAAgB,iBAAiB,IAAyB;CACxD,OAAO,GAAG,SAAS,aAAa,GAAG,SAAS,eAAe,GAAG,SAAS;AACzE;AA6BA,MAAM,+BAAoC,IAAI,IAAY;CAhBxD;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AASkF,CAAC;;AAGrF,SAAgB,uBACd,IACiE;CACjE,OAAO,aAAa,IAAI,GAAG,IAAI;AACjC;;AAGA,SAAgB,sBAAsB,IAA4C;CAChF,OAAO,CAAC,aAAa,IAAI,GAAG,IAAI;AAClC;;;;;;;;;;;;;;AAiBA,eAAsB,gBACpB,SACA,OACA,MAC6B;CAC7B,MAAM,SAAS,MAAM,QAAQ,SAAS,IAAI;CAC1C,IAAI,WAAW,KAAA,GACb,MAAM,IAAI,MAAM,gDAAgD,KAAK,EAAE;CAEzE,MAAM,UAAU,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,MAAM,EAAE,GAAG;CACxD,MAAM,yBAAS,IAAI,IAAoB;CACvC,MAAM,gCAAgB,IAAI,IAAoB;CAC9C,MAAM,6BAAa,IAAI,IAAmC;CAC1D,MAAM,mCAAmB,IAAI,IAA6C;CAC1E,MAAM,oCAAoB,IAAI,IAG5B;CACF,KAAK,MAAM,MAAM,SAAS;EACxB,IAAI,GAAG,SAAS,aAAa,GAAG,SAAS,WAAW,OAAO,IAAI,GAAG,IAAI,GAAG,KAAK;EAC9E,IAAI,GAAG,SAAS,aAAa,GAAG,iBAAiB,KAAA,GAC/C,cAAc,IAAI,GAAG,IAAI,GAAG,YAAY;EAE1C,IAAI,GAAG,SAAS,aAAa,GAAG,aAAa,KAAA,GAC3C,WAAW,IAAI,GAAG,IAAI,mBAAmB,GAAG,QAAQ,CAAC;EAEvD,IAAI,GAAG,SAAS,gBAAgB,iBAAiB,IAAI,GAAG,IAAI,GAAG,OAAO;EACtE,IAAI,GAAG,SAAS,mBAAmB;GACjC,MAAM,WAAW,kBAAkB,IAAI,GAAG,EAAE,KAAK,CAAC;GAClD,SAAS,KAAK,GAAG,OAAO;GACxB,kBAAkB,IAAI,GAAG,IAAI,QAAQ;EACvC;CACF;CACA,MAAM,aAAa,IAAY,WAC7B,aAAa,IAAI,OAAO,IAAI,EAAE,KAAK,IAAI,QAAQ;EAC7C,cAAc,cAAc,IAAI,EAAE;EAClC,UAAU,WAAW,IAAI,EAAE;EAC3B,iBAAiB,iBAAiB,IAAI,EAAE;EACxC,mBAAmB,kBAAkB,IAAI,EAAE;CAC7C,CAAC;CACH,MAAM,kBAAkB,OAAgD;EACtE,MAAM,YAAY,KAAK,MAAM,EAAE;EAC/B,OAAO,OAAO,SAAS,SAAS,IAAI,EAAE,UAAU,IAAI,CAAC;CACvD;CACA,MAAM,UAA8B,CAAC;CACrC,KAAK,MAAM,MAAM,SAAS;EACxB,IAAI,GAAG,SAAS,WAAW;EAC3B,IAAI,GAAG,SAAS,WAAW;EAC3B,IAAI,GAAG,SAAS,WAAW;EAC3B,IAAI,GAAG,SAAS,gBAAgB;EAChC,IAAI,GAAG,SAAS,mBAAmB;EACnC,IAAI,GAAG,SAAS,QAAQ;EACxB,IAAI,GAAG,SAAS,wBAAwB;EACxC,IAAI,GAAG,SAAS,sBAAsB;EACtC,IAAI,GAAG,SAAS,SAAS;GAGvB,IAAI,GAAG,OAAO,eAAe,GAAG,WAAW,KAAA,GAAW;IACpD,QAAQ,KAAK;KACX,MAAM;KACN,QAAQ,UAAU,GAAG,IAAI,WAAW;KACpC,QAAQ;KACR,OAAO;KACP,cAAc;KACd,OAAO;MAAE,QAAQ;MAAe,QAAQ;KAAkB;KAC1D,GAAG,eAAe,GAAG,EAAE;KACvB,KAAK,GAAG;IACV,CAAC;IACD;GACF;GACA,MAAM,UAAU,MAAM,MAAM,IAAI,GAAG,MAAM;GACzC,IAAI,YAAY,KAAA,GACd,MAAM,IAAI,MACR,+DAA+D,GAAG,OAAO,WAAW,GAAG,GAAG,SAAS,GAAG,IAAI,EAC5G;GAEF,QAAQ,KAAK;IACX,MAAM;IACN,QAAQ,UAAU,GAAG,IAAI,MAAM;IAC/B,KAAK;IACL,QAAQ,GAAG;IACX,OAAO,UAAU;IACjB,OAAO;KAAE,QAAQ;KAAe,QAAQ;IAAkB;IAC1D,GAAG,eAAe,GAAG,EAAE;IACvB,KAAK,GAAG;GACV,CAAC;GACD;EACF;EACA,IAAI,GAAG,SAAS,aAAa;GAC3B,QAAQ,KAAK;IACX,MAAM;IACN,QAAQ,UAAU,GAAG,IAAI,WAAW;IACpC,QAAQ,GAAG;IACX,OAAO;IACP,cAAc;IACd,OAAO;KAAE,QAAQ;KAAe,QAAQ;IAA0B;IAClE,GAAG,eAAe,GAAG,EAAE;IACvB,KAAK,GAAG;GACV,CAAC;GACD;EACF;EACA,IAAI,GAAG,WAAW,QAAQ;GACxB,MAAM,QAAQ,iBAAiB,EAAE;GACjC,IAAI,MAAM,WAAW,aAAa,MAAM,yBAAyB,OAAO,KAAK;GAC7E,QAAQ,KAAK;IACX,MAAM;IACN,QAAQ,UAAU,GAAG,IAAI,QAAQ;IAGjC,QAAQ,GAAG,UAAU,GAAG,SAAS,SAAS;IAC1C,OAAO,GAAG,UAAU;IACpB,cAAc;IACd,GAAI,GAAG,kBAAkB,KAAA,IACrB,CAAC,IACD,EAAE,eAAe,0BAA0B,GAAG,aAAa,EAAE;IACjE;IACA,GAAG,eAAe,GAAG,EAAE;IACvB,KAAK,GAAG;GACV,CAAC;GACD;EACF;EACA,IAAI,GAAG,WAAW,KAAA,GAChB,MAAM,IAAI,MACR,4CAA4C,GAAG,GAAG,SAAS,GAAG,IAAI,oEAEpE;EAEF,MAAM,MAAM,MAAM,MAAM,IAAI,GAAG,MAAM;EACrC,IAAI,QAAQ,KAAA,GACV,MAAM,IAAI,MACR,2DAA2D,GAAG,OAAO,WAAW,GAAG,GAAG,SAAS,GAAG,IAAI,EACxG;EAEF,MAAM,QAAQ,iBAAiB,EAAE;EACjC,IAAI,MAAM,WAAW,aAAa,MAAM,yBAAyB,OAAO,KAAK;EAC7E,QAAQ,KAAK;GACX,MAAM;GACN,QAAQ,UAAU,GAAG,IAAI,MAAM;GAC/B;GACA,QAAQ,GAAG;GACX,SAAS,GAAG;GACZ,OAAO,WAAW,GAAG,KAAK;GAC1B,GAAI,GAAG,kBAAkB,KAAA,IACrB,CAAC,IACD,EAAE,eAAe,0BAA0B,GAAG,aAAa,EAAE;GACjE;GACA,GAAG,eAAe,GAAG,EAAE;GACvB,KAAK,GAAG;EACV,CAAC;CACH;CACA,OAAO;AACT;AAEA,SAAS,aACP,IACA,OACA,QACA,WAOI,CAAC,GACL;CACA,OAAO,OAAO,OAAO;EACnB;EACA;EACA;EACA,GAAI,SAAS,iBAAiB,KAAA,IAAY,CAAC,IAAI,EAAE,cAAc,SAAS,aAAa;EACrF,GAAI,SAAS,aAAa,KAAA,IAAY,CAAC,IAAI,EAAE,UAAU,SAAS,SAAS;EACzE,GAAI,SAAS,oBAAoB,KAAA,IAC7B,CAAC,IACD,EAAE,iBAAiB,SAAS,gBAAgB;EAChD,GAAI,SAAS,sBAAsB,KAAA,IAC/B,CAAC,IACD,EAAE,mBAAmB,OAAO,OAAO,CAAC,GAAG,SAAS,iBAAiB,CAAC,EAAE;EACxE,QAAQ;GACN,MAAM,IAAI,MAAM,sBAAsB,GAAG,2CAA2C;EACtF;CACF,CAAC;AACH;;AAGA,SAAS,mBAAmB,UAAwD;CAClF,MAAM,cACJ,SAAS,gBAAgB,KAAA,IAAY,KAAA,IAAY,OAAO,OAAO,EAAE,GAAG,SAAS,YAAY,CAAC;CAC5F,OAAO,OAAO,OAAO;EACnB,GAAI,SAAS,kBAAkB,KAAA,IAAY,CAAC,IAAI,EAAE,eAAe,SAAS,cAAc;EACxF,GAAI,SAAS,eAAe,KAAA,IAAY,CAAC,IAAI,EAAE,YAAY,SAAS,WAAW;EAC/E,GAAI,SAAS,oBAAoB,KAAA,IAC7B,CAAC,IACD,EAAE,iBAAiB,SAAS,gBAAgB;EAChD,GAAI,gBAAgB,KAAA,IAAY,CAAC,IAAI,EAAE,YAAY;CACrD,CAAC;AACH;;;;;;;AAQA,SAAgB,oBAAoB,QAAgC;CAClE,MAAM,wBAAQ,IAAI,IAA6B;CAC/C,IAAI;CAKJ,MAAM,SAAS,OACZ,QACE,OACC,GAAG,SAAS,aAAa,GAAG,SAAS,SACzC,CAAC,CACA,MAAM,GAAG,MAAM,EAAE,MAAM,EAAE,GAAG;CAC/B,MAAM,cAAc,OAAO,QAAQ,OAAO,sBAAsB,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,MAAM,EAAE,GAAG;CACjG,KAAK,MAAM,MAAM,QAAQ;EACvB,IAAI,GAAG,SAAS,WAAW;GAGzB,MAAM,IAAI,GAAG,IAAI;IACf,IAAI,GAAG;IACP,QAAQ,GAAG;IACX,OAAO,GAAG;IACV,QAAQ;IACR,SAAS;IACT,QAAQ;KAAE,eAAe;KAAG,WAAW;IAAE;IACzC,OAAO,UAAU;GACnB,CAAC;GACD;EACF;EACA,IAAI,GAAG,WAAW,KAAA,KAAa,SAAS,KAAA,GAAW,OAAO,GAAG;EAC7D,MAAM,IAAI,GAAG,IAAI;GACf,IAAI,GAAG;GACP,QAAQ,GAAG;GACX,OAAO,GAAG;GACV,QAAQ;GACR,SAAS,GAAG;GACZ,QAAQ,GAAG;GACX,GAAI,GAAG,kBAAkB,KAAA,IAAY,CAAC,IAAI,EAAE,eAAe,GAAG,cAAc;GAC5E,GAAI,GAAG,iBAAiB,KAAA,IAAY,CAAC,IAAI,EAAE,cAAc,GAAG,aAAa;GACzE,GAAI,GAAG,WAAW,EAAE,UAAU,GAAG,SAAS,IAAI,CAAC;GAC/C,OAAO,UAAU;EACnB,CAAC;CACH;CACA,KAAK,MAAM,MAAM,aACf,IAAI,GAAG,SAAS,WAAW;EACzB,MAAM,OAAO,YAAY,OAAO,GAAG,EAAE;EACrC,KAAK,SAAS,GAAG,WAAW,SAAS,SAAS;EAC9C,KAAK,QAAQ,WAAW,GAAG,KAAK;EAChC,KAAK,gBAAgB,0BAA0B,GAAG,aAAa;EAC/D,KAAK,SAAS,GAAG;EACjB,KAAK,QAAQ,iBAAiB,EAAE;EAChC,MAAM,YAAY,KAAK,MAAM,GAAG,EAAE;EAClC,IAAI,OAAO,SAAS,SAAS,GAAG,KAAK,YAAY;CACnD,OAAO,IAAI,GAAG,SAAS,SAAS;EAC9B,MAAM,OAAO,YAAY,OAAO,GAAG,EAAE;EACrC,KAAK,SAAS,GAAG,OAAO,cAAc,cAAc;EACpD,KAAK,SAAS,GAAG;EACjB,KAAK,QAAQ;GAAE,QAAQ;GAAe,QAAQ;EAAkB;EAChE,MAAM,YAAY,KAAK,MAAM,GAAG,EAAE;EAClC,IAAI,OAAO,SAAS,SAAS,GAAG,KAAK,YAAY;CACnD,OAAO;EACL,MAAM,OAAO,YAAY,OAAO,GAAG,EAAE;EACrC,KAAK,SAAS;EACd,KAAK,QAAQ;GAAE,QAAQ;GAAe,QAAQ;EAA0B;EACxE,MAAM,YAAY,KAAK,MAAM,GAAG,EAAE;EAClC,IAAI,OAAO,SAAS,SAAS,GAAG,KAAK,YAAY;CACnD;CAIF,KAAK,MAAM,MAAM,QAAQ;EACvB,IAAI,GAAG,SAAS,gBAAgB;EAChC,MAAM,OAAO,YAAY,OAAO,GAAG,EAAE;EACrC,KAAK,kBAAkB,GAAG;EAC1B,KAAK,UAAU,GAAG,QAAQ;CAC5B;CACA,KAAK,MAAM,MAAM,QAAQ;EACvB,IAAI,GAAG,SAAS,mBAAmB;EACnC,MAAM,OAAO,YAAY,OAAO,GAAG,EAAE;EACrC,KAAK,sBAAsB,CAAC;EAC5B,KAAK,kBAAkB,KAAK,GAAG,OAAO;CACxC;CAGA,KAAK,MAAM,MAAM,QAAQ;EACvB,IAAI,GAAG,SAAS,WAAW;EAC3B,MAAM,OAAO,YAAY,OAAO,GAAG,EAAE;EACrC,KAAK,QAAQ,SAAS,KAAK,OAAO,GAAG,KAAK;CAC5C;CACA,MAAM,YAAY,CAAC,GAAG,MAAM,OAAO,CAAC,CAAC,CAAC,IAAI,cAAc;CACxD,OAAO;EACL,MAAM,QAAQ,UAAU,EAAE,EAAE,MAAM;EAClC,OAAO;EACP,UAAU,UAAU,QAAQ,MAAM,EAAE,WAAW,aAAa,EAAE,WAAW,WAAW,CAAC,CAAC;EACtF,SAAS,UAAU,QAAQ,MAAM,EAAE,WAAW,SAAS,CAAC,CAAC;CAC3D;AACF;;;;;;AAOA,SAAgB,aAAa,QAAqC;CAChE,MAAM,wBAAQ,IAAI,IAAY;CAC9B,KAAK,MAAM,MAAM,QAAQ,IAAI,GAAG,SAAS,SAAS,MAAM,IAAI,GAAG,EAAE;CACjE,MAAM,UAAyB,CAAC;CAChC,KAAK,MAAM,MAAM,QAAQ;EACvB,IAAI,GAAG,SAAS,aAAa,MAAM,IAAI,GAAG,EAAE,GAAG;EAC/C,QAAQ,KAAK;GACX,IAAI,GAAG;GACP,OAAO,GAAG;GACV,MAAM,GAAG;GACT,SAAS,GAAG;GACZ,SAAS,GAAG;EACd,CAAC;CACH;CACA,OAAO,QAAQ,MAAM,GAAG,MAAM,EAAE,UAAU,EAAE,OAAO;AACrD;;AAsBA,SAAS,0BACP,UAC+B;CAC/B,IAAI,aAAa,KAAA,GAAW,OAAO,KAAA;CACnC,MAAM,WAAW,OAAO,OACtB,SAAS,SAAS,KAAK,YACrB,OAAO,OAAO;EACZ,cAAc,OAAO,OAAO,CAAC,GAAG,QAAQ,YAAY,CAAC;EACrD,GAAI,QAAQ,mBAAmB,EAAE,kBAAkB,KAAK,IAAI,CAAC;EAC7D,GAAI,QAAQ,qBAAqB,gBAC7B,EAAE,kBAAkB,cAAuB,IAC3C,CAAC;CACP,CAAC,CACH,CACF;CACA,MAAM,SAAS,OAAO,OAAO,CAAC,GAAG,SAAS,MAAM,CAAC;CACjD,OAAO,OAAO,OACZ,SAAS,WAAW,YAChB;EAAE,QAAQ;EAAoB;EAAU;EAAQ,QAAQ,SAAS;CAAO,IACxE;EAAE,QAAQ;EAAkB;EAAU;CAAO,CACnD;AACF;AAEA,SAAS,YAAY,OAAqC,IAA6B;CACrF,MAAM,OAAO,MAAM,IAAI,EAAE;CACzB,IAAI,CAAC,MACH,MAAM,IAAI,MAAM,oDAAoD,GAAG,sBAAsB;CAE/F,OAAO;AACT;AAEA,SAAS,eAAe,MAAqC;CAC3D,OAAO;EACL,IAAI,KAAK;EACT,QAAQ,KAAK;EACb,OAAO,KAAK;EACZ,QAAQ,KAAK;EACb,SAAS,KAAK;EACd,QAAQ,KAAK;EACb,eAAe,KAAK;EACpB,cAAc,KAAK;EACnB,UAAU,KAAK;EACf,iBAAiB,KAAK;EACtB,mBACE,KAAK,sBAAsB,KAAA,IAAY,KAAA,IAAY,OAAO,OAAO,CAAC,GAAG,KAAK,iBAAiB,CAAC;EAC9F,OAAO,KAAK;EACZ,eAAe,KAAK;EACpB,QAAQ,KAAK;EACb,OAAO,KAAK;EACZ,WAAW,KAAK;CAClB;AACF;AAEA,SAAS,iBACP,OACoC;CACpC,OACE,MAAM,SAAS;EACb,QAAQ;EACR,QAAQ;CACV;AAEJ"}

package/dist/{stream-agent-turn-C1Vs_3B9.d.ts → stream-agent-turn-BGyszuPH.d.ts}

@@ -1,5 +1,5 @@
 import { J as AgentTaskStatus, Y as BackendErrorDetail, at as RuntimeStreamEvent } from "./types-DeX8ibLc.js";
-import { d as ExecutorFactory } from "./types-Df9vulGc.js";
+import { p as ExecutorFactory } from "./types-BPQhQRrC.js";
 import { AgentProfile } from "@tangle-network/agent-interface";
 import { AgentRunOutcome } from "@tangle-network/sandbox/runtime";
 import { PromptOptions, SandboxEvent, SandboxInstance } from "@tangle-network/sandbox";
@@ -125,4 +125,4 @@ declare function streamAgentTurn(backend: AgentTurnBackend, input: AgentTurnInpu
 declare function collectAgentTurn(stream: AsyncIterable<RuntimeStreamEvent>): Promise<CollectedAgentTurn>;
 //#endregion
 export { StreamAgentTurnOptions as a, CollectedAgentTurn as i, AgentTurnInput$1 as n, collectAgentTurn as o, AgentTurnUsage as r, streamAgentTurn as s, AgentTurnBackend as t };
-//# sourceMappingURL=stream-agent-turn-C1Vs_3B9.d.ts.map
+//# sourceMappingURL=stream-agent-turn-BGyszuPH.d.ts.map

package/dist/{stream-agent-turn-CXRugSGO.js → stream-agent-turn-DYi8ymsU.js}

@@ -1,8 +1,8 @@
-import { D as providerMessageText, E as promptOptionsFromAgentTurnInput, T as promptFromAgentTurnInput, d as awaitAbortable } from "./retained-run-binding-Dp2e8xne.js";
+import { C as unknownExecutionBindingReceipt, F as awaitAbortable, X as promptOptionsFromAgentTurnInput, Y as promptFromAgentTurnInput, Z as providerMessageText, a as authoredProfileDigest, c as knownExecutionBindingReceipt, l as knownMaterializationReceipt, v as runtimeOwnedExecutorExecutionBinding, w as unknownMaterializationReceipt, x as runtimeOwnedPendingExecutorMaterialization, y as runtimeOwnedExecutorMaterialization } from "./materialization-Dl9J8ek4.js";
 import { m as ValidationError, p as SessionMismatchError, r as BackendTransportError } from "./errors-CDZ8XsVj.js";
-import { a as mapSandboxEvent, n as canonicalStreamEventFromSandboxEvent, o as mapSandboxToolEvent, r as createSandboxToolPartState } from "./sandbox-events-COwCWUVB.js";
-import { C as unknownExecutionBindingReceipt, D as projectSandboxOutcome, O as readSandboxOutcome, T as executableAgentProfileSnapshot, a as authoredProfileDigest, c as knownExecutionBindingReceipt, l as knownMaterializationReceipt, v as runtimeOwnedExecutorExecutionBinding, w as unknownMaterializationReceipt, x as runtimeOwnedPendingExecutorMaterialization, y as runtimeOwnedExecutorMaterialization } from "./materialization-P86EciBw.js";
-import { c as profileProviderModel, i as concreteModelId, o as profileBridgeWireModel } from "./model-policy-DgRJIJse.js";
+import { a as isSandboxTerminalEvent, n as canonicalStreamEventFromSandboxEvent, o as mapSandboxEvent, r as createSandboxToolPartState, s as mapSandboxToolEvent } from "./sandbox-events-BVjstFgb.js";
+import { i as readSandboxOutcome, r as projectSandboxOutcome, t as executableAgentProfileSnapshot } from "./executable-spec-BUcUcEPk.js";
+import { i as concreteModelId, l as profileProviderModel, s as profileBridgeWireModel } from "./model-policy-Sw4ywhtL.js";
 import { canonicalCandidateDigest, renderInputPartsAsText } from "@tangle-network/agent-interface";
 import { scoreKnowledgeReadiness } from "@tangle-network/agent-eval";
 import { createAgentRunOutcomeTracker } from "@tangle-network/sandbox/runtime";
@@ -511,7 +511,12 @@ async function* streamAgentTurnInternal(backend, input, opts) {
 			preserveToolParts: opts.preserveToolParts === true,
 			...opts.onRawEvent ? { onRawEvent: opts.onRawEvent } : {}
 		});
+		const seenChildTaskUpdates = /* @__PURE__ */ new Set();
 		for await (const event of abortableValues(inner, deadline.signal)) {
+			if (childTaskAlreadySeen(event, seenChildTaskUpdates)) {
+				throwIfAborted(deadline.signal);
+				continue;
+			}
 			yield event;
 			throwIfAborted(deadline.signal);
 		}
@@ -696,6 +701,13 @@ async function* driveExecutorTurn(executor, task, session, input, signal, acc, d
 	let result;
 	if (isAsyncIterable(run)) {
 		for await (const usage of abortableValues(run, signal)) {
+			if (usage.kind === "progress") {
+				const projected = executorProgressStreamEvent(usage.progress, task, session);
+				foldEvent(projected, acc);
+				yield projected;
+				throwIfAborted(signal);
+				continue;
+			}
 			foldUsageEvent(usage, acc);
 			throwIfAborted(signal);
 		}
@@ -837,21 +849,85 @@ function executorResultReasoningTokens(value) {
 	const count = value.reasoningTokens;
 	return Number.isSafeInteger(count) && count >= 0 ? count : void 0;
 }
+/**
+* Read the terminal tool calls an executor artifact published. Every Runtime-owned executor
+* reports `ExecutorToolCall[]`, so an artifact carrying any other shape is a defect in that
+* executor rather than a turn without tool calls: refuse it instead of dropping the calls.
+*/
 function executorResultToolCalls(value) {
 	if (!value || typeof value !== "object") return [];
 	const raw = value.toolCalls;
-	if (!Array.isArray(raw)) return [];
-	return raw.flatMap((entry) => {
-		if (!entry || typeof entry !== "object") return [];
-		const call = entry;
-		if (typeof call.name !== "string") return [];
-		return [{
+	if (raw === void 0) return [];
+	if (!Array.isArray(raw)) throw new ValidationError(`streamAgentTurn: executor artifact toolCalls must be an ExecutorToolCall array, received ${typeof raw}`);
+	return raw.map((entry) => {
+		const call = entry && typeof entry === "object" ? entry : void 0;
+		if (!call || typeof call.name !== "string" || call.name.length === 0) throw new ValidationError("streamAgentTurn: executor artifact toolCalls entries require a non-empty name");
+		return {
 			...typeof call.id === "string" ? { id: call.id } : {},
 			name: call.name,
 			arguments: typeof call.arguments === "string" ? call.arguments : JSON.stringify(call.arguments ?? {})
-		}];
+		};
 	});
 }
+/** Project one executor progress event onto the public turn vocabulary. */
+function executorProgressStreamEvent(progress, task, session) {
+	const timestamp = nowIso();
+	if (progress.kind === "text_delta") return {
+		type: "text_delta",
+		task,
+		session,
+		text: progress.text,
+		timestamp
+	};
+	if (progress.kind === "reasoning_delta") return {
+		type: "reasoning_delta",
+		task,
+		session,
+		text: progress.text,
+		timestamp
+	};
+	if (progress.kind === "tool_call") return {
+		type: "tool_call",
+		task,
+		session,
+		toolName: progress.toolName,
+		...progress.toolCallId === void 0 ? {} : { toolCallId: progress.toolCallId },
+		...progress.args === void 0 ? {} : { args: progress.args },
+		timestamp
+	};
+	if (progress.kind === "tool_result") return {
+		type: "tool_result",
+		task,
+		session,
+		toolName: progress.toolName,
+		...progress.toolCallId === void 0 ? {} : { toolCallId: progress.toolCallId },
+		...progress.result === void 0 ? {} : { result: progress.result },
+		timestamp
+	};
+	if (progress.kind === "child_task") return {
+		...progress.event,
+		task,
+		session,
+		timestamp
+	};
+	return {
+		type: "interaction",
+		request: progress.request,
+		task,
+		session,
+		timestamp
+	};
+}
+/**
+* Drop a child-task update this turn already published. The provider's `sourceEventId` names one
+* exact update, so a reconnect or replay that repeats it must not add a second child.
+*/
+function childTaskAlreadySeen(event, seen) {
+	if (event.type !== "child-task") return false;
+	if (seen.has(event.sourceEventId)) return true;
+	seen.add(event.sourceEventId);
+	return false;
+}
 /** Fold one normalized executor usage event into the turn accumulator. */
 function foldUsageEvent(event, acc) {
 	if (event.kind === "tokens") {
@@ -861,11 +937,11 @@ function foldUsageEvent(event, acc) {
 		acc.input += event.input;
 		acc.output += event.output;
 	} else if (event.kind === "cost") {
-		const known = event.usdKnown !== false;
+		const known = event.usdKnown;
 		acc.usdKnown = acc.sawCostUsage ? acc.usdKnown && known : known;
 		acc.sawCostUsage = true;
 		acc.costUsd += event.usd;
-		if (event.usdEstimated !== void 0) {
+		if (event.usdKnown === false && event.usdEstimated !== void 0) {
 			acc.estimatedCostUsd += event.usdEstimated;
 			acc.sawEstimatedCost = true;
 		}
@@ -905,8 +981,7 @@ function foldEvent(event, acc, fallbackModelLabel) {
 /** Read the final text off a terminal sandbox event, when present. */
 function terminalTextFromSandboxEvent(event) {
 	if (!event || typeof event !== "object") return void 0;
-	const type = String(event.type ?? "");
-	if (type !== "result" && type !== "done" && type !== "final") return void 0;
+	if (!isSandboxTerminalEvent(String(event.type ?? ""))) return void 0;
 	const data = event.data && typeof event.data === "object" ? event.data : {};
 	for (const key of [
 		"finalText",
@@ -1000,4 +1075,4 @@ function deriveTurnSignal(callerSignal, timeoutMs) {
 //#endregion
 export { normalizeBackendStreamEvent as a, nowIso as c, createSandboxPromptBackend as i, startOrResumeRuntimeSession as l, streamAgentTurn as n, InMemoryRuntimeSessionStore as o, createIterableBackend as r, newRuntimeSession as s, collectAgentTurn as t, touchSession as u };
 
-//# sourceMappingURL=stream-agent-turn-CXRugSGO.js.map
+//# sourceMappingURL=stream-agent-turn-DYi8ymsU.js.map