@burtson-labs/agent-core 1.6.38 → 1.6.40

package/dist/graph/contracts.d.ts

@@ -0,0 +1,48 @@
+/**
+ * Phase 3 — completion contracts, evidence, verification nodes.
+ *
+ * A node that "completed" without producing what it promised is the graph
+ * version of the claim-without-doing problem the loop's detectors chase in
+ * prose. Contracts make the promise EXPLICIT and machine-checkable:
+ * an executor returns an outcome + evidence, the scheduler checks the node's
+ * contract against them, and a violation IS a failure — dependents skip, the
+ * run reports failed, nobody builds on unverified work.
+ *
+ * Contracts are deliberately DECLARATIVE (plain data, serializable):
+ *  - a future planner (Phase 9) can propose them alongside a GraphSpec;
+ *  - checkpoints (Phase 5) can persist them;
+ *  - hosts can render "why is this node failed" without executing anything.
+ * Anything needing custom logic belongs in a verification NODE — independent
+ * work the scheduler runs like any other node — not in a contract lambda.
+ */
+import type { CompletionContract, EvidenceItem, GraphNodeSpec, NodeExecutor, NodeRunContext } from './types';
+/**
+ * Check a contract. Returns human-readable violations — empty array = pass.
+ * Pure and total: bad regex sources become a violation, never a throw.
+ */
+export declare function checkContract(contract: CompletionContract | undefined, outcome: {
+    output?: unknown;
+    evidence?: EvidenceItem[];
+}): string[];
+/** What a verifier decides about upstream work. */
+export interface Verdict {
+    pass: boolean;
+    /** Required when pass=false — a verdict without reasons is unactionable. */
+    reasons?: string[];
+}
+export type VerifierFn = (ctx: NodeRunContext) => Promise<Verdict> | Verdict;
+/**
+ * Build an INDEPENDENT verification node for `targetId`: it depends on the
+ * target, runs the verifier against the target's result, and fails the graph
+ * branch when the verdict is negative — so anything depending on the verify
+ * node only runs over verified work. (Chain: work → verify → consume.)
+ *
+ * The verifier is ordinary node work — it can be a wrapped loop turn (a second
+ * model reviewing the first's output) or plain code (run the tests, diff the
+ * artifact). The scheduler treats it like any node; there is no special path.
+ */
+export declare function verificationNode(id: string, targetId: string, verifier: VerifierFn, spec?: Partial<Pick<GraphNodeSpec, 'label' | 'dependsOn'>>): {
+    node: GraphNodeSpec;
+    executor: NodeExecutor;
+};
+//# sourceMappingURL=contracts.d.ts.map

package/dist/graph/contracts.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"contracts.d.ts","sourceRoot":"","sources":["../../src/graph/contracts.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,KAAK,EACV,kBAAkB,EAClB,YAAY,EACZ,aAAa,EACb,YAAY,EACZ,cAAc,EACf,MAAM,SAAS,CAAC;AAEjB;;;GAGG;AACH,wBAAgB,aAAa,CAC3B,QAAQ,EAAE,kBAAkB,GAAG,SAAS,EACxC,OAAO,EAAE;IAAE,MAAM,CAAC,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,EAAE,YAAY,EAAE,CAAA;CAAE,GACvD,MAAM,EAAE,CA8BV;AAID,mDAAmD;AACnD,MAAM,WAAW,OAAO;IACtB,IAAI,EAAE,OAAO,CAAC;IACd,4EAA4E;IAC5E,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;CACpB;AAED,MAAM,MAAM,UAAU,GAAG,CAAC,GAAG,EAAE,cAAc,KAAK,OAAO,CAAC,OAAO,CAAC,GAAG,OAAO,CAAC;AAE7E;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAC9B,EAAE,EAAE,MAAM,EACV,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,UAAU,EACpB,IAAI,CAAC,EAAE,OAAO,CAAC,IAAI,CAAC,aAAa,EAAE,OAAO,GAAG,WAAW,CAAC,CAAC,GACzD;IAAE,IAAI,EAAE,aAAa,CAAC;IAAC,QAAQ,EAAE,YAAY,CAAA;CAAE,CAmBjD"}

package/dist/graph/contracts.js

@@ -0,0 +1,88 @@
+"use strict";
+/**
+ * Phase 3 — completion contracts, evidence, verification nodes.
+ *
+ * A node that "completed" without producing what it promised is the graph
+ * version of the claim-without-doing problem the loop's detectors chase in
+ * prose. Contracts make the promise EXPLICIT and machine-checkable:
+ * an executor returns an outcome + evidence, the scheduler checks the node's
+ * contract against them, and a violation IS a failure — dependents skip, the
+ * run reports failed, nobody builds on unverified work.
+ *
+ * Contracts are deliberately DECLARATIVE (plain data, serializable):
+ *  - a future planner (Phase 9) can propose them alongside a GraphSpec;
+ *  - checkpoints (Phase 5) can persist them;
+ *  - hosts can render "why is this node failed" without executing anything.
+ * Anything needing custom logic belongs in a verification NODE — independent
+ * work the scheduler runs like any other node — not in a contract lambda.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.checkContract = checkContract;
+exports.verificationNode = verificationNode;
+/**
+ * Check a contract. Returns human-readable violations — empty array = pass.
+ * Pure and total: bad regex sources become a violation, never a throw.
+ */
+function checkContract(contract, outcome) {
+    if (!contract)
+        return [];
+    const violations = [];
+    const text = typeof outcome.output === 'string'
+        ? outcome.output
+        : outcome.output === undefined
+            ? ''
+            : JSON.stringify(outcome.output);
+    if (contract.outputNonEmpty && text.trim().length === 0) {
+        violations.push('contract: output is empty');
+    }
+    if (contract.outputMatches) {
+        try {
+            const re = new RegExp(contract.outputMatches, 's');
+            if (!re.test(text)) {
+                violations.push(`contract: output does not match /${contract.outputMatches}/`);
+            }
+        }
+        catch {
+            violations.push(`contract: invalid outputMatches regex /${contract.outputMatches}/`);
+        }
+    }
+    for (const req of contract.requireEvidence ?? []) {
+        const min = Math.max(1, req.min ?? 1);
+        const count = (outcome.evidence ?? []).filter((e) => e.kind === req.kind).length;
+        if (count < min) {
+            violations.push(`contract: needs ${min} evidence of kind "${req.kind}", got ${count}`);
+        }
+    }
+    return violations;
+}
+/**
+ * Build an INDEPENDENT verification node for `targetId`: it depends on the
+ * target, runs the verifier against the target's result, and fails the graph
+ * branch when the verdict is negative — so anything depending on the verify
+ * node only runs over verified work. (Chain: work → verify → consume.)
+ *
+ * The verifier is ordinary node work — it can be a wrapped loop turn (a second
+ * model reviewing the first's output) or plain code (run the tests, diff the
+ * artifact). The scheduler treats it like any node; there is no special path.
+ */
+function verificationNode(id, targetId, verifier, spec) {
+    const node = {
+        id,
+        label: spec?.label ?? `verify ${targetId}`,
+        dependsOn: [...new Set([targetId, ...(spec?.dependsOn ?? [])])],
+    };
+    const executor = async (ctx) => {
+        const verdict = await verifier(ctx);
+        if (!verdict.pass) {
+            const reasons = verdict.reasons?.length ? verdict.reasons.join('; ') : 'no reasons given';
+            throw new Error(`verification failed for ${targetId}: ${reasons}`);
+        }
+        return {
+            output: verdict,
+            summary: `verified ${targetId}`,
+            evidence: [{ kind: 'verification', detail: targetId, data: verdict }],
+        };
+    };
+    return { node, executor };
+}
+//# sourceMappingURL=contracts.js.map

package/dist/graph/contracts.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"contracts.js","sourceRoot":"","sources":["../../src/graph/contracts.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;GAgBG;;AAcH,sCAiCC;AAuBD,4CAwBC;AApFD;;;GAGG;AACH,SAAgB,aAAa,CAC3B,QAAwC,EACxC,OAAwD;IAExD,IAAI,CAAC,QAAQ;QAAE,OAAO,EAAE,CAAC;IACzB,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,MAAM,IAAI,GAAG,OAAO,OAAO,CAAC,MAAM,KAAK,QAAQ;QAC7C,CAAC,CAAC,OAAO,CAAC,MAAM;QAChB,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,SAAS;YAC5B,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAErC,IAAI,QAAQ,CAAC,cAAc,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxD,UAAU,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;IAC/C,CAAC;IACD,IAAI,QAAQ,CAAC,aAAa,EAAE,CAAC;QAC3B,IAAI,CAAC;YACH,MAAM,EAAE,GAAG,IAAI,MAAM,CAAC,QAAQ,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC;YACnD,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACnB,UAAU,CAAC,IAAI,CAAC,oCAAoC,QAAQ,CAAC,aAAa,GAAG,CAAC,CAAC;YACjF,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,UAAU,CAAC,IAAI,CAAC,0CAA0C,QAAQ,CAAC,aAAa,GAAG,CAAC,CAAC;QACvF,CAAC;IACH,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAC,eAAe,IAAI,EAAE,EAAE,CAAC;QACjD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACtC,MAAM,KAAK,GAAG,CAAC,OAAO,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;QACjF,IAAI,KAAK,GAAG,GAAG,EAAE,CAAC;YAChB,UAAU,CAAC,IAAI,CAAC,mBAAmB,GAAG,sBAAsB,GAAG,CAAC,IAAI,UAAU,KAAK,EAAE,CAAC,CAAC;QACzF,CAAC;IACH,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAaD;;;;;;;;;GASG;AACH,SAAgB,gBAAgB,CAC9B,EAAU,EACV,QAAgB,EAChB,QAAoB,EACpB,IAA0D;IAE1D,MAAM,IAAI,GAAkB;QAC1B,EAAE;QACF,KAAK,EAAE,IAAI,EAAE,KAAK,IAAI,UAAU,QAAQ,EAAE;QAC1C,SAAS,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,QAAQ,EAAE,GAAG,CAAC,IAAI,EAAE,SAAS,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;KAChE,CAAC;IACF,MAAM,QAAQ,GAAiB,KAAK,EAAE,GAAG,EAAE,EAAE;QAC3C,MAAM,OAAO,GAAG,MAAM,QAAQ,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;YAClB,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC;YAC1F,MAAM,IAAI,KAAK,CAAC,2BAA2B,QAAQ,KAAK,OAAO,EAAE,CAAC,CAAC;QACrE,CAAC;QACD,OAAO;YACL,MAAM,EAAE,OAAO;YACf,OAAO,EAAE,YAAY,QAAQ,EAAE;YAC/B,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;SACtE,CAAC;IACJ,CAAC,CAAC;IACF,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;AAC5B,CAAC"}

package/dist/graph/index.d.ts

@@ -0,0 +1,5 @@
+export * from './types';
+export * from './scheduler';
+export * from './loopNode';
+export * from './contracts';
+//# sourceMappingURL=index.d.ts.map

package/dist/graph/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":"AAAA,cAAc,SAAS,CAAC;AACxB,cAAc,aAAa,CAAC;AAC5B,cAAc,YAAY,CAAC;AAC3B,cAAc,aAAa,CAAC"}

package/dist/graph/index.js

@@ -0,0 +1,21 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./types"), exports);
+__exportStar(require("./scheduler"), exports);
+__exportStar(require("./loopNode"), exports);
+__exportStar(require("./contracts"), exports);
+//# sourceMappingURL=index.js.map

package/dist/graph/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,0CAAwB;AACxB,8CAA4B;AAC5B,6CAA2B;AAC3B,8CAA4B"}

package/dist/graph/loopNode.d.ts

@@ -0,0 +1,33 @@
+/**
+ * Phase 2 plumbing: run one ToolUseLoop turn as a graph node — the loop is
+ * wrapped, never rewritten. Each execution builds a FRESH loop + conversation;
+ * cross-node context flows explicitly through upstream outputs folded into the
+ * node's prompt (no shared hidden state between nodes, which is what makes a
+ * graph inspectable and retryable per-node later).
+ */
+import { type ToolUseLoopOptions } from '../tools/tool-use-loop';
+import type { ChatFn, ToolExecutionContext } from '../tools/tool-types';
+import type { ToolRegistry } from '../tools/tool-registry';
+import type { NodeExecutor, NodeRunContext } from './types';
+export interface LoopNodeDeps {
+    registry: ToolRegistry;
+    ctx: ToolExecutionContext;
+    /** ChatFn shared by every execution of this node. Provide exactly one of
+     *  `chat` / `chatFactory`. */
+    chat?: ChatFn;
+    /** Builds a fresh ChatFn per node execution (per-node provider/model). */
+    chatFactory?: () => ChatFn | Promise<ChatFn>;
+    systemPrompt?: string;
+    /** Forwarded into the loop (beforeToolExecute gate, emitEvent, budgets…).
+     *  The graph run's AbortSignal is injected automatically. */
+    loopOptions?: ToolUseLoopOptions;
+}
+/**
+ * Build the node's prompt. Default folds each upstream node's summary/output
+ * under a heading so the model sees exactly what earlier nodes produced.
+ */
+export type NodePromptBuilder = (ctx: NodeRunContext) => string;
+export declare function defaultNodePrompt(base: string): NodePromptBuilder;
+/** Wrap one loop run as a NodeExecutor. */
+export declare function wrapLoopAsNode(deps: LoopNodeDeps, buildPrompt: NodePromptBuilder): NodeExecutor;
+//# sourceMappingURL=loopNode.d.ts.map

package/dist/graph/loopNode.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"loopNode.d.ts","sourceRoot":"","sources":["../../src/graph/loopNode.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,OAAO,EAAqB,KAAK,kBAAkB,EAAE,MAAM,wBAAwB,CAAC;AACpF,OAAO,KAAK,EAAE,MAAM,EAAE,oBAAoB,EAAE,MAAM,qBAAqB,CAAC;AACxE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAC3D,OAAO,KAAK,EAAgB,YAAY,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AAE1E,MAAM,WAAW,YAAY;IAC3B,QAAQ,EAAE,YAAY,CAAC;IACvB,GAAG,EAAE,oBAAoB,CAAC;IAC1B;kCAC8B;IAC9B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,0EAA0E;IAC1E,WAAW,CAAC,EAAE,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC7C,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB;iEAC6D;IAC7D,WAAW,CAAC,EAAE,kBAAkB,CAAC;CAClC;AAED;;;GAGG;AACH,MAAM,MAAM,iBAAiB,GAAG,CAAC,GAAG,EAAE,cAAc,KAAK,MAAM,CAAC;AAEhE,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,iBAAiB,CAWjE;AAED,2CAA2C;AAC3C,wBAAgB,cAAc,CAAC,IAAI,EAAE,YAAY,EAAE,WAAW,EAAE,iBAAiB,GAAG,YAAY,CAsC/F"}

package/dist/graph/loopNode.js

@@ -0,0 +1,67 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.defaultNodePrompt = defaultNodePrompt;
+exports.wrapLoopAsNode = wrapLoopAsNode;
+/**
+ * Phase 2 plumbing: run one ToolUseLoop turn as a graph node — the loop is
+ * wrapped, never rewritten. Each execution builds a FRESH loop + conversation;
+ * cross-node context flows explicitly through upstream outputs folded into the
+ * node's prompt (no shared hidden state between nodes, which is what makes a
+ * graph inspectable and retryable per-node later).
+ */
+const tool_use_loop_1 = require("../tools/tool-use-loop");
+function defaultNodePrompt(base) {
+    return (ctx) => {
+        const upstreamIds = Object.keys(ctx.upstream);
+        if (upstreamIds.length === 0)
+            return base;
+        const sections = upstreamIds.map((id) => {
+            const r = ctx.upstream[id];
+            const body = r.summary ?? (typeof r.output === 'string' ? r.output : JSON.stringify(r.output ?? ''));
+            return `### Result of "${id}"\n${(body ?? '').toString().slice(0, 4000)}`;
+        });
+        return `${base}\n\n## Upstream results\n\n${sections.join('\n\n')}`;
+    };
+}
+/** Wrap one loop run as a NodeExecutor. */
+function wrapLoopAsNode(deps, buildPrompt) {
+    if (!deps.chat && !deps.chatFactory) {
+        throw new Error('wrapLoopAsNode: provide chat or chatFactory');
+    }
+    return async (nodeCtx) => {
+        const chat = deps.chatFactory ? await deps.chatFactory() : deps.chat;
+        // Auto-evidence: successful edit-tool results become 'file-changed'
+        // evidence without the executor author doing anything — so a contract
+        // like requireEvidence:[{kind:'file-changed'}] works out of the box.
+        // The caller's own emitEvent (if any) still sees every event.
+        const EDIT_TOOLS = new Set(['write_file', 'apply_edit', 'replace_range', 'apply_patch', 'delete_file']);
+        const evidence = [];
+        const lastPath = new Map();
+        const callerEmit = deps.loopOptions?.emitEvent;
+        const emitEvent = (type, payload) => {
+            const p = (payload ?? {});
+            if (type === 'tool_loop:tool_execute' && p.name && EDIT_TOOLS.has(p.name)) {
+                lastPath.set(p.name, p.params?.path ?? '');
+            }
+            else if (type === 'tool_loop:tool_result' && p.name && EDIT_TOOLS.has(p.name) && !p.isError) {
+                evidence.push({ kind: 'file-changed', detail: lastPath.get(p.name) || undefined });
+            }
+            callerEmit?.(type, payload);
+        };
+        const loop = (0, tool_use_loop_1.createToolUseLoop)(deps.registry, deps.ctx, {
+            ...(deps.loopOptions ?? {}),
+            emitEvent,
+            signal: nodeCtx.signal,
+        });
+        const result = await loop.run(buildPrompt(nodeCtx), chat, deps.systemPrompt);
+        if (result.cancelled) {
+            throw new Error('node cancelled');
+        }
+        return {
+            output: result.finalResponse,
+            summary: result.finalResponse.slice(0, 200),
+            evidence,
+        };
+    };
+}
+//# sourceMappingURL=loopNode.js.map

package/dist/graph/loopNode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"loopNode.js","sourceRoot":"","sources":["../../src/graph/loopNode.ts"],"names":[],"mappings":";;AAgCA,8CAWC;AAGD,wCAsCC;AApFD;;;;;;GAMG;AACH,0DAAoF;AAyBpF,SAAgB,iBAAiB,CAAC,IAAY;IAC5C,OAAO,CAAC,GAAG,EAAE,EAAE;QACb,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC9C,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAC1C,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE;YACtC,MAAM,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YAC3B,MAAM,IAAI,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,CAAC;YACrG,OAAO,kBAAkB,EAAE,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;QAC5E,CAAC,CAAC,CAAC;QACH,OAAO,GAAG,IAAI,8BAA8B,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;IACtE,CAAC,CAAC;AACJ,CAAC;AAED,2CAA2C;AAC3C,SAAgB,cAAc,CAAC,IAAkB,EAAE,WAA8B;IAC/E,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;IACjE,CAAC;IACD,OAAO,KAAK,EAAE,OAAO,EAAE,EAAE;QACvB,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAK,CAAC;QACtE,oEAAoE;QACpE,sEAAsE;QACtE,qEAAqE;QACrE,8DAA8D;QAC9D,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,YAAY,EAAE,YAAY,EAAE,eAAe,EAAE,aAAa,EAAE,aAAa,CAAC,CAAC,CAAC;QACxG,MAAM,QAAQ,GAAmB,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,EAAE,SAAS,CAAC;QAC/C,MAAM,SAAS,GAAG,CAAC,IAAY,EAAE,OAAiB,EAAQ,EAAE;YAC1D,MAAM,CAAC,GAAG,CAAC,OAAO,IAAI,EAAE,CAA0E,CAAC;YACnG,IAAI,IAAI,KAAK,wBAAwB,IAAI,CAAC,CAAC,IAAI,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC1E,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC,CAAC;YAC7C,CAAC;iBAAM,IAAI,IAAI,KAAK,uBAAuB,IAAI,CAAC,CAAC,IAAI,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;gBAC9F,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,SAAS,EAAE,CAAC,CAAC;YACrF,CAAC;YACD,UAAU,EAAE,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC9B,CAAC,CAAC;QACF,MAAM,IAAI,GAAG,IAAA,iCAAiB,EAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE;YACtD,GAAG,CAAC,IAAI,CAAC,WAAW,IAAI,EAAE,CAAC;YAC3B,SAAS;YACT,MAAM,EAAE,OAAO,CAAC,MAAM;SACvB,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QAC7E,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;YACrB,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAC;QACpC,CAAC;QACD,OAAO;YACL,MAAM,EAAE,MAAM,CAAC,aAAa;YAC5B,OAAO,EAAE,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;YAC3C,QAAQ;SACT,CAAC;IACJ,CAAC,CAAC;AACJ,CAAC"}

package/dist/graph/scheduler.d.ts

@@ -0,0 +1,36 @@
+/**
+ * Graph scheduler — deterministic host code that runs a validated DAG.
+ * (Phase 4's conservative core, shipped with Phase 1 so the types are provably
+ * runnable; budgets/checkpoints layer on later without changing this surface.)
+ *
+ * Semantics:
+ *  - A node runs once ALL of its dependencies are 'done'.
+ *  - `maxConcurrency` caps simultaneously-running nodes. Default 2 — the
+ *    plan's "safe default concurrency": enough to prove parallel lift, small
+ *    enough that filesystem/tool contention stays rare. Callers raise it
+ *    deliberately.
+ *  - Failure is contained, not contagious across branches: when a node fails,
+ *    its transitive dependents are 'skipped'; independent branches keep
+ *    running to completion. Overall status is then 'failed'.
+ *  - Cancellation (opts.signal) stops launching new nodes; already-running
+ *    executors receive the same signal and are awaited; never-started nodes
+ *    end 'cancelled'. Overall status 'cancelled' (a cancelled run never
+ *    reports 'failed' — the user stopped it, it didn't break).
+ *  - Events mirror the tool loop's (type, payload) convention so hosts fold
+ *    graph progress into the SAME stream that already carries tool_loop:*
+ *    (Phase 7): graph:start, graph:node_start, graph:node_done,
+ *    graph:node_failed, graph:node_skipped, graph:node_cancelled, graph:done.
+ */
+import { type GraphRunResult, type GraphSpec, type NodeExecutor } from './types';
+export interface RunGraphOptions {
+    /** Cap on simultaneously running nodes. Default 2 (conservative). */
+    maxConcurrency?: number;
+    /** Abort the whole run. */
+    signal?: AbortSignal;
+    /** Progress events — same shape as the tool loop's emitEvent. */
+    emitEvent?: (type: string, payload?: unknown) => void;
+}
+/** Executors per node id, or one executor shared by every node. */
+export type GraphExecutors = NodeExecutor | Record<string, NodeExecutor>;
+export declare function runGraph(spec: GraphSpec, executors: GraphExecutors, opts?: RunGraphOptions): Promise<GraphRunResult>;
+//# sourceMappingURL=scheduler.d.ts.map

package/dist/graph/scheduler.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduler.d.ts","sourceRoot":"","sources":["../../src/graph/scheduler.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,OAAO,EAEL,KAAK,cAAc,EACnB,KAAK,SAAS,EACd,KAAK,YAAY,EAElB,MAAM,SAAS,CAAC;AAGjB,MAAM,WAAW,eAAe;IAC9B,qEAAqE;IACrE,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,2BAA2B;IAC3B,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,iEAAiE;IACjE,SAAS,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,KAAK,IAAI,CAAC;CACvD;AAED,mEAAmE;AACnE,MAAM,MAAM,cAAc,GAAG,YAAY,GAAG,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;AAEzE,wBAAsB,QAAQ,CAC5B,IAAI,EAAE,SAAS,EACf,SAAS,EAAE,cAAc,EACzB,IAAI,GAAE,eAAoB,GACzB,OAAO,CAAC,cAAc,CAAC,CA6JzB"}

package/dist/graph/scheduler.js

@@ -0,0 +1,183 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.runGraph = runGraph;
+/**
+ * Graph scheduler — deterministic host code that runs a validated DAG.
+ * (Phase 4's conservative core, shipped with Phase 1 so the types are provably
+ * runnable; budgets/checkpoints layer on later without changing this surface.)
+ *
+ * Semantics:
+ *  - A node runs once ALL of its dependencies are 'done'.
+ *  - `maxConcurrency` caps simultaneously-running nodes. Default 2 — the
+ *    plan's "safe default concurrency": enough to prove parallel lift, small
+ *    enough that filesystem/tool contention stays rare. Callers raise it
+ *    deliberately.
+ *  - Failure is contained, not contagious across branches: when a node fails,
+ *    its transitive dependents are 'skipped'; independent branches keep
+ *    running to completion. Overall status is then 'failed'.
+ *  - Cancellation (opts.signal) stops launching new nodes; already-running
+ *    executors receive the same signal and are awaited; never-started nodes
+ *    end 'cancelled'. Overall status 'cancelled' (a cancelled run never
+ *    reports 'failed' — the user stopped it, it didn't break).
+ *  - Events mirror the tool loop's (type, payload) convention so hosts fold
+ *    graph progress into the SAME stream that already carries tool_loop:*
+ *    (Phase 7): graph:start, graph:node_start, graph:node_done,
+ *    graph:node_failed, graph:node_skipped, graph:node_cancelled, graph:done.
+ */
+const types_1 = require("./types");
+const contracts_1 = require("./contracts");
+async function runGraph(spec, executors, opts = {}) {
+    const startedAt = Date.now();
+    const validation = (0, types_1.validateGraph)(spec);
+    if (!validation.ok) {
+        throw new Error(`invalid graph: ${validation.errors.join('; ')}`);
+    }
+    const maxConcurrency = Math.max(1, opts.maxConcurrency ?? 2);
+    const emit = opts.emitEvent ?? (() => undefined);
+    const signal = opts.signal;
+    const executorFor = (id) => {
+        if (typeof executors === 'function')
+            return executors;
+        const fn = executors[id];
+        if (!fn)
+            throw new Error(`no executor for node: ${id}`);
+        return fn;
+    };
+    // Resolve every executor up front so a missing one fails the run BEFORE any
+    // node starts, not halfway through.
+    for (const node of spec.nodes)
+        executorFor(node.id);
+    const results = {};
+    for (const node of spec.nodes) {
+        results[node.id] = { id: node.id, state: 'pending' };
+    }
+    const dependents = new Map();
+    for (const node of spec.nodes) {
+        for (const dep of node.dependsOn ?? []) {
+            const list = dependents.get(dep) ?? [];
+            list.push(node.id);
+            dependents.set(dep, list);
+        }
+    }
+    const deps = new Map(spec.nodes.map((n) => [n.id, n.dependsOn ?? []]));
+    const labelOf = new Map(spec.nodes.map((n) => [n.id, n.label ?? n.id]));
+    const specOf = new Map(spec.nodes.map((n) => [n.id, n]));
+    const running = new Map();
+    let anyFailed = false;
+    const readyToRun = (id) => results[id].state === 'pending' &&
+        (deps.get(id) ?? []).every((d) => results[d].state === 'done');
+    /** A dependency failed or was skipped/cancelled → this node can never run. */
+    const blocked = (id) => results[id].state === 'pending' &&
+        (deps.get(id) ?? []).some((d) => {
+            const s = results[d].state;
+            return s === 'failed' || s === 'skipped' || s === 'cancelled';
+        });
+    const markSkippedCascade = () => {
+        // Iterate to a fixed point: skipping a node can block its own dependents.
+        let changed = true;
+        while (changed) {
+            changed = false;
+            for (const node of spec.nodes) {
+                if (blocked(node.id)) {
+                    results[node.id] = { ...results[node.id], state: 'skipped' };
+                    emit('graph:node_skipped', { id: node.id, label: labelOf.get(node.id) });
+                    changed = true;
+                }
+            }
+        }
+    };
+    const launch = (id) => {
+        const record = results[id];
+        record.state = 'running';
+        record.startedAt = Date.now();
+        emit('graph:node_start', { id, label: labelOf.get(id) });
+        const upstream = {};
+        for (const d of deps.get(id) ?? [])
+            upstream[d] = results[d];
+        const promise = (async () => {
+            try {
+                const outcome = await executorFor(id)({
+                    nodeId: id,
+                    signal: signal ?? new AbortController().signal,
+                    upstream,
+                });
+                // Phase 3: the node only counts as done if its completion contract
+                // holds. A violation is a FAILURE — "finished but produced nothing it
+                // promised" must not feed downstream nodes.
+                const violations = (0, contracts_1.checkContract)(specOf.get(id)?.contract, outcome ?? {});
+                record.output = outcome?.output;
+                record.summary = outcome?.summary;
+                record.evidence = outcome?.evidence;
+                if (violations.length > 0) {
+                    record.state = 'failed';
+                    record.error = violations.join('; ');
+                    record.contractViolations = violations;
+                    anyFailed = true;
+                    emit('graph:node_contract_violation', { id, label: labelOf.get(id), violations });
+                    emit('graph:node_failed', { id, label: labelOf.get(id), error: record.error });
+                }
+                else {
+                    record.state = 'done';
+                    emit('graph:node_done', { id, label: labelOf.get(id), summary: record.summary });
+                }
+            }
+            catch (err) {
+                record.state = 'failed';
+                record.error = err instanceof Error ? err.message : String(err);
+                anyFailed = true;
+                emit('graph:node_failed', { id, label: labelOf.get(id), error: record.error });
+            }
+            finally {
+                record.endedAt = Date.now();
+                record.durationMs = record.endedAt - (record.startedAt ?? record.endedAt);
+                running.delete(id);
+            }
+        })();
+        running.set(id, promise);
+    };
+    emit('graph:start', { nodes: spec.nodes.length, maxConcurrency });
+    // Main pump: launch every ready node up to the cap, wait for one running
+    // node to settle, repeat. Skip-cascade runs each pass so a failure releases
+    // its blocked subtree immediately (as 'skipped', not stuck 'pending').
+    for (;;) {
+        markSkippedCascade();
+        if (!signal?.aborted) {
+            for (const node of spec.nodes) {
+                if (running.size >= maxConcurrency)
+                    break;
+                if (readyToRun(node.id))
+                    launch(node.id);
+            }
+        }
+        if (running.size === 0)
+            break;
+        await Promise.race(running.values());
+    }
+    // Anything still pending at the end: cancelled (signal aborted before it
+    // could start) — by construction nothing else can remain pending.
+    for (const node of spec.nodes) {
+        if (results[node.id].state === 'pending') {
+            results[node.id] = { ...results[node.id], state: 'cancelled' };
+            emit('graph:node_cancelled', { id: node.id, label: labelOf.get(node.id) });
+        }
+    }
+    const status = signal?.aborted
+        ? 'cancelled'
+        : anyFailed
+            ? 'failed'
+            : 'completed';
+    const result = {
+        status,
+        nodes: results,
+        durationMs: Date.now() - startedAt,
+    };
+    emit('graph:done', {
+        status,
+        durationMs: result.durationMs,
+        done: Object.values(results).filter((r) => r.state === 'done').length,
+        failed: Object.values(results).filter((r) => r.state === 'failed').length,
+        skipped: Object.values(results).filter((r) => r.state === 'skipped').length,
+    });
+    return result;
+}
+//# sourceMappingURL=scheduler.js.map

package/dist/graph/scheduler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduler.js","sourceRoot":"","sources":["../../src/graph/scheduler.ts"],"names":[],"mappings":";;AA4CA,4BAiKC;AA7MD;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,mCAMiB;AACjB,2CAA4C;AAcrC,KAAK,UAAU,QAAQ,CAC5B,IAAe,EACf,SAAyB,EACzB,OAAwB,EAAE;IAE1B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC7B,MAAM,UAAU,GAAG,IAAA,qBAAa,EAAC,IAAI,CAAC,CAAC;IACvC,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,kBAAkB,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACpE,CAAC;IACD,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,cAAc,IAAI,CAAC,CAAC,CAAC;IAC7D,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,IAAI,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;IACjD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IAE3B,MAAM,WAAW,GAAG,CAAC,EAAU,EAAgB,EAAE;QAC/C,IAAI,OAAO,SAAS,KAAK,UAAU;YAAE,OAAO,SAAS,CAAC;QACtD,MAAM,EAAE,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;QACzB,IAAI,CAAC,EAAE;YAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,EAAE,EAAE,CAAC,CAAC;QACxD,OAAO,EAAE,CAAC;IACZ,CAAC,CAAC;IACF,4EAA4E;IAC5E,oCAAoC;IACpC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK;QAAE,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEpD,MAAM,OAAO,GAA+B,EAAE,CAAC;IAC/C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;IACvD,CAAC;IACD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,IAAI,EAAE,EAAE,CAAC;YACvC,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YACvC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACnB,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAmB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IACzF,MAAM,OAAO,GAAG,IAAI,GAAG,CAAiB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACxF,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAEzD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAyB,CAAC;IACjD,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,MAAM,UAAU,GAAG,CAAC,EAAU,EAAW,EAAE,CACzC,OAAO,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,SAAS;QAC/B,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,MAAM,CAAC,CAAC;IAEjE,8EAA8E;IAC9E,MAAM,OAAO,GAAG,CAAC,EAAU,EAAW,EAAE,CACtC,OAAO,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,SAAS;QAC/B,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;YAC9B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YAC3B,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,WAAW,CAAC;QAChE,CAAC,CAAC,CAAC;IAEL,MAAM,kBAAkB,GAAG,GAAS,EAAE;QACpC,0EAA0E;QAC1E,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,OAAO,OAAO,EAAE,CAAC;YACf,OAAO,GAAG,KAAK,CAAC;YAChB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBACrB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;oBAC7D,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;oBACzE,OAAO,GAAG,IAAI,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,MAAM,GAAG,CAAC,EAAU,EAAQ,EAAE;QAClC,MAAM,MAAM,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QAC3B,MAAM,CAAC,KAAK,GAAG,SAAS,CAAC;QACzB,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC9B,IAAI,CAAC,kBAAkB,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QACzD,MAAM,QAAQ,GAA+B,EAAE,CAAC;QAChD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE;YAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QAE7D,MAAM,OAAO,GAAG,CAAC,KAAK,IAAI,EAAE;YAC1B,IAAI,CAAC;gBACH,MAAM,OAAO,GAAG,MAAM,WAAW,CAAC,EAAE,CAAC,CAAC;oBACpC,MAAM,EAAE,EAAE;oBACV,MAAM,EAAE,MAAM,IAAI,IAAI,eAAe,EAAE,CAAC,MAAM;oBAC9C,QAAQ;iBACT,CAAC,CAAC;gBACH,mEAAmE;gBACnE,sEAAsE;gBACtE,4CAA4C;gBAC5C,MAAM,UAAU,GAAG,IAAA,yBAAa,EAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,OAAO,IAAI,EAAE,CAAC,CAAC;gBAC1E,MAAM,CAAC,MAAM,GAAG,OAAO,EAAE,MAAM,CAAC;gBAChC,MAAM,CAAC,OAAO,GAAG,OAAO,EAAE,OAAO,CAAC;gBAClC,MAAM,CAAC,QAAQ,GAAG,OAAO,EAAE,QAAQ,CAAC;gBACpC,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC1B,MAAM,CAAC,KAAK,GAAG,QAAQ,CAAC;oBACxB,MAAM,CAAC,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACrC,MAAM,CAAC,kBAAkB,GAAG,UAAU,CAAC;oBACvC,SAAS,GAAG,IAAI,CAAC;oBACjB,IAAI,CAAC,+BAA+B,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC;oBAClF,IAAI,CAAC,mBAAmB,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;gBACjF,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC;oBACtB,IAAI,CAAC,iBAAiB,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;gBACnF,CAAC;YACH,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,MAAM,CAAC,KAAK,GAAG,QAAQ,CAAC;gBACxB,MAAM,CAAC,KAAK,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBAChE,SAAS,GAAG,IAAI,CAAC;gBACjB,IAAI,CAAC,mBAAmB,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;YACjF,CAAC;oBAAS,CAAC;gBACT,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;gBAC5B,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,OAAO,GAAG,CAAC,MAAM,CAAC,SAAS,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC;gBAC1E,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACrB,CAAC;QACH,CAAC,CAAC,EAAE,CAAC;QACL,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IAC3B,CAAC,CAAC;IAEF,IAAI,CAAC,aAAa,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC,CAAC;IAElE,yEAAyE;IACzE,4EAA4E;IAC5E,uEAAuE;IACvE,SAAS,CAAC;QACR,kBAAkB,EAAE,CAAC;QACrB,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC;YACrB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,OAAO,CAAC,IAAI,IAAI,cAAc;oBAAE,MAAM;gBAC1C,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;oBAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;QACD,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC;YAAE,MAAM;QAC9B,MAAM,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IACvC,CAAC;IAED,yEAAyE;IACzE,kEAAkE;IAClE,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YACzC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC;YAC/D,IAAI,CAAC,sBAAsB,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QAC7E,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAA6B,MAAM,EAAE,OAAO;QACtD,CAAC,CAAC,WAAW;QACb,CAAC,CAAC,SAAS;YACT,CAAC,CAAC,QAAQ;YACV,CAAC,CAAC,WAAW,CAAC;IAClB,MAAM,MAAM,GAAmB;QAC7B,MAAM;QACN,KAAK,EAAE,OAAO;QACd,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;KACnC,CAAC;IACF,IAAI,CAAC,YAAY,EAAE;QACjB,MAAM;QACN,UAAU,EAAE,MAAM,CAAC,UAAU;QAC7B,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,MAAM,CAAC,CAAC,MAAM;QACrE,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC,MAAM;QACzE,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,MAAM;KAC5E,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/graph/types.d.ts

@@ -0,0 +1,109 @@
+/**
+ * Graph runtime — types. (Phase 1 of the graph plan.)
+ *
+ * A run is a DAG of nodes; each node's executor runs only after every node it
+ * depends on has finished. The existing ToolUseLoop is NOT rewritten — a node
+ * executor typically wraps one loop run (see loopNode.ts), so a graph is
+ * "several of today's turns with explicit dependencies" rather than a new
+ * agent architecture. Nothing in the framework consumes this module yet; hosts
+ * opt in explicitly (that's the feature flag — zero behavior change until a
+ * host wires it).
+ *
+ * Design rules:
+ *  - The planner (model) may eventually PROPOSE a GraphSpec, but it never owns
+ *    scheduling. The scheduler is deterministic host code.
+ *  - Node states form a strict machine:
+ *      pending → running → done | failed
+ *      pending → skipped        (an upstream dependency failed or was skipped)
+ *      pending → cancelled      (the run's signal aborted before it started)
+ *    Terminal states never transition again.
+ */
+/** A structured claim about what a node actually did (Phase 3).
+ *  e.g. { kind: 'file-changed', detail: 'src/x.ts' }. JSON-serializable. */
+export interface EvidenceItem {
+    kind: string;
+    detail?: string;
+    data?: unknown;
+}
+export interface EvidenceRequirement {
+    kind: string;
+    /** Minimum count of matching items. Default 1. */
+    min?: number;
+}
+/** Declarative completion contract: what a node MUST produce to count as
+ *  done. Checked by the scheduler after the executor resolves; violations are
+ *  failures (dependents skip). Plain data on purpose — proposable by a future
+ *  planner, persistable by future checkpoints. */
+export interface CompletionContract {
+    outputNonEmpty?: boolean;
+    /** Regex source the (stringified) output must match (flags: 's'). */
+    outputMatches?: string;
+    requireEvidence?: EvidenceRequirement[];
+}
+/** One node in the DAG. */
+export interface GraphNodeSpec {
+    /** Unique id within the graph. */
+    id: string;
+    /** Ids of nodes that must complete (state 'done') before this one runs. */
+    dependsOn?: string[];
+    /** Human label for UIs; falls back to id. */
+    label?: string;
+    /** Completion contract enforced on this node's outcome. */
+    contract?: CompletionContract;
+}
+export interface GraphSpec {
+    nodes: GraphNodeSpec[];
+}
+export type NodeState = 'pending' | 'running' | 'done' | 'failed' | 'skipped' | 'cancelled';
+/** What an executor returns on success. `output` is handed to downstream
+ *  executors verbatim; `summary` is a short human line for UIs/events. */
+export interface NodeOutcome {
+    output?: unknown;
+    summary?: string;
+    /** Structured claims about what was actually done — checked against the
+     *  node's contract and carried on the result for downstream/UIs. */
+    evidence?: EvidenceItem[];
+}
+/** Terminal record for one node after a run. */
+export interface NodeResult {
+    id: string;
+    state: NodeState;
+    output?: unknown;
+    summary?: string;
+    evidence?: EvidenceItem[];
+    /** Set when state === 'failed'. */
+    error?: string;
+    /** Set when the failure was a contract violation (state 'failed'). */
+    contractViolations?: string[];
+    startedAt?: number;
+    endedAt?: number;
+    durationMs?: number;
+}
+export type GraphRunStatus = 'completed' | 'failed' | 'cancelled';
+export interface GraphRunResult {
+    status: GraphRunStatus;
+    /** Terminal result per node id — every node in the spec appears. */
+    nodes: Record<string, NodeResult>;
+    durationMs: number;
+}
+/** Context handed to a node's executor when it runs. */
+export interface NodeRunContext {
+    nodeId: string;
+    /** Abort signal for the whole graph run — executors must respect it. */
+    signal: AbortSignal;
+    /** Terminal results of this node's direct dependencies (all state 'done'). */
+    upstream: Record<string, NodeResult>;
+}
+export type NodeExecutor = (ctx: NodeRunContext) => Promise<NodeOutcome> | NodeOutcome;
+export interface GraphValidation {
+    ok: boolean;
+    errors: string[];
+}
+/**
+ * Structural validation: duplicate ids, unknown/self dependencies, cycles.
+ * Kahn's algorithm for cycle detection — if a topological pass can't consume
+ * every node, whatever remains is (part of) a cycle and gets named in the
+ * error so the author can see it.
+ */
+export declare function validateGraph(spec: GraphSpec): GraphValidation;
+//# sourceMappingURL=types.d.ts.map

package/dist/graph/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/graph/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH;4EAC4E;AAC5E,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,OAAO,CAAC;CAChB;AAED,MAAM,WAAW,mBAAmB;IAClC,IAAI,EAAE,MAAM,CAAC;IACb,kDAAkD;IAClD,GAAG,CAAC,EAAE,MAAM,CAAC;CACd;AAED;;;kDAGkD;AAClD,MAAM,WAAW,kBAAkB;IACjC,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,qEAAqE;IACrE,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,eAAe,CAAC,EAAE,mBAAmB,EAAE,CAAC;CACzC;AAED,2BAA2B;AAC3B,MAAM,WAAW,aAAa;IAC5B,kCAAkC;IAClC,EAAE,EAAE,MAAM,CAAC;IACX,2EAA2E;IAC3E,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;IACrB,6CAA6C;IAC7C,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,2DAA2D;IAC3D,QAAQ,CAAC,EAAE,kBAAkB,CAAC;CAC/B;AAED,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,aAAa,EAAE,CAAC;CACxB;AAED,MAAM,MAAM,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG,MAAM,GAAG,QAAQ,GAAG,SAAS,GAAG,WAAW,CAAC;AAE5F;0EAC0E;AAC1E,MAAM,WAAW,WAAW;IAC1B,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB;wEACoE;IACpE,QAAQ,CAAC,EAAE,YAAY,EAAE,CAAC;CAC3B;AAED,gDAAgD;AAChD,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,SAAS,CAAC;IACjB,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,QAAQ,CAAC,EAAE,YAAY,EAAE,CAAC;IAC1B,mCAAmC;IACnC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,sEAAsE;IACtE,kBAAkB,CAAC,EAAE,MAAM,EAAE,CAAC;IAC9B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,MAAM,cAAc,GAAG,WAAW,GAAG,QAAQ,GAAG,WAAW,CAAC;AAElE,MAAM,WAAW,cAAc;IAC7B,MAAM,EAAE,cAAc,CAAC;IACvB,oEAAoE;IACpE,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IAClC,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,wDAAwD;AACxD,MAAM,WAAW,cAAc;IAC7B,MAAM,EAAE,MAAM,CAAC;IACf,wEAAwE;IACxE,MAAM,EAAE,WAAW,CAAC;IACpB,8EAA8E;IAC9E,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;CACtC;AAED,MAAM,MAAM,YAAY,GAAG,CAAC,GAAG,EAAE,cAAc,KAAK,OAAO,CAAC,WAAW,CAAC,GAAG,WAAW,CAAC;AAEvF,MAAM,WAAW,eAAe;IAC9B,EAAE,EAAE,OAAO,CAAC;IACZ,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,SAAS,GAAG,eAAe,CA2C9D"}

package/dist/graph/types.js

@@ -0,0 +1,80 @@
+"use strict";
+/**
+ * Graph runtime — types. (Phase 1 of the graph plan.)
+ *
+ * A run is a DAG of nodes; each node's executor runs only after every node it
+ * depends on has finished. The existing ToolUseLoop is NOT rewritten — a node
+ * executor typically wraps one loop run (see loopNode.ts), so a graph is
+ * "several of today's turns with explicit dependencies" rather than a new
+ * agent architecture. Nothing in the framework consumes this module yet; hosts
+ * opt in explicitly (that's the feature flag — zero behavior change until a
+ * host wires it).
+ *
+ * Design rules:
+ *  - The planner (model) may eventually PROPOSE a GraphSpec, but it never owns
+ *    scheduling. The scheduler is deterministic host code.
+ *  - Node states form a strict machine:
+ *      pending → running → done | failed
+ *      pending → skipped        (an upstream dependency failed or was skipped)
+ *      pending → cancelled      (the run's signal aborted before it started)
+ *    Terminal states never transition again.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.validateGraph = validateGraph;
+/**
+ * Structural validation: duplicate ids, unknown/self dependencies, cycles.
+ * Kahn's algorithm for cycle detection — if a topological pass can't consume
+ * every node, whatever remains is (part of) a cycle and gets named in the
+ * error so the author can see it.
+ */
+function validateGraph(spec) {
+    const errors = [];
+    const ids = new Set();
+    for (const node of spec.nodes) {
+        if (!node.id || node.id.trim().length === 0)
+            errors.push('node with empty id');
+        else if (ids.has(node.id))
+            errors.push(`duplicate node id: ${node.id}`);
+        else
+            ids.add(node.id);
+    }
+    for (const node of spec.nodes) {
+        for (const dep of node.dependsOn ?? []) {
+            if (dep === node.id)
+                errors.push(`node ${node.id} depends on itself`);
+            else if (!ids.has(dep))
+                errors.push(`node ${node.id} depends on unknown node: ${dep}`);
+        }
+    }
+    if (errors.length === 0) {
+        // Kahn: repeatedly remove nodes with no unconsumed deps.
+        const indegree = new Map();
+        const dependents = new Map();
+        for (const node of spec.nodes) {
+            indegree.set(node.id, (node.dependsOn ?? []).length);
+            for (const dep of node.dependsOn ?? []) {
+                const list = dependents.get(dep) ?? [];
+                list.push(node.id);
+                dependents.set(dep, list);
+            }
+        }
+        const queue = spec.nodes.filter((n) => (indegree.get(n.id) ?? 0) === 0).map((n) => n.id);
+        let consumed = 0;
+        while (queue.length > 0) {
+            const id = queue.shift();
+            consumed += 1;
+            for (const next of dependents.get(id) ?? []) {
+                const left = (indegree.get(next) ?? 1) - 1;
+                indegree.set(next, left);
+                if (left === 0)
+                    queue.push(next);
+            }
+        }
+        if (consumed !== spec.nodes.length) {
+            const cyclic = spec.nodes.filter((n) => (indegree.get(n.id) ?? 0) > 0).map((n) => n.id);
+            errors.push(`cycle detected involving: ${cyclic.join(', ')}`);
+        }
+    }
+    return { ok: errors.length === 0, errors };
+}
+//# sourceMappingURL=types.js.map

package/dist/graph/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/graph/types.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;GAmBG;;AAsGH,sCA2CC;AAjDD;;;;;GAKG;AACH,SAAgB,aAAa,CAAC,IAAe;IAC3C,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;aAC1E,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,sBAAsB,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;;YACnE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACxB,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,IAAI,EAAE,EAAE,CAAC;YACvC,IAAI,GAAG,KAAK,IAAI,CAAC,EAAE;gBAAE,MAAM,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,EAAE,oBAAoB,CAAC,CAAC;iBACjE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,MAAM,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,EAAE,6BAA6B,GAAG,EAAE,CAAC,CAAC;QACzF,CAAC;IACH,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,yDAAyD;QACzD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC/C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;YACrD,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,IAAI,EAAE,EAAE,CAAC;gBACvC,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;gBACvC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACnB,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACzF,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC1B,QAAQ,IAAI,CAAC,CAAC;YACd,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC5C,MAAM,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC3C,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;gBACzB,IAAI,IAAI,KAAK,CAAC;oBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;QACD,IAAI,QAAQ,KAAK,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YACnC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACxF,MAAM,CAAC,IAAI,CAAC,6BAA6B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChE,CAAC;IACH,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;AAC7C,CAAC"}

package/dist/index.d.ts

@@ -12,6 +12,7 @@ export interface CreateAgentRuntimeOptions extends Partial<Omit<AgentRuntimeOpti
 }
 export declare const createAgentRuntime: (options?: CreateAgentRuntimeOptions) => AgentRuntime;
 export * from './tools';
+export * from './graph';
 export * from './mcp';
 export { redactSecrets, redactSecretsString, BUILTIN_SECRET_PATTERNS, type SecretPattern, type RedactionResult } from './security/secretPatterns';
 export { TelemetryExporter, resolveTelemetryConfig, TTFT_BUCKETS, DURATION_BUCKETS, type TelemetryConfig } from './telemetry/otlpExporter';

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAC;AAClE,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAEtD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,6BAA6B,CAAC;AAElE,cAAc,eAAe,CAAC;AAC9B,cAAc,eAAe,CAAC;AAC9B,OAAO,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAElD,OAAO,EACL,cAAc,EACd,mBAAmB,EACnB,iBAAiB,EAClB,MAAM,6BAA6B,CAAC;AAErC,OAAO,EACL,2BAA2B,EAC3B,2BAA2B,EAC5B,MAAM,oCAAoC,CAAC;AAE5C,OAAO,EACL,YAAY,EACZ,mBAAmB,EACnB,cAAc,EACd,WAAW,EACX,WAAW,EACX,cAAc,EACd,YAAY,EACZ,mBAAmB,EACnB,kBAAkB,EACnB,MAAM,wBAAwB,CAAC;AAEhC,MAAM,WAAW,yBAA0B,SAAQ,OAAO,CAAC,IAAI,CAAC,mBAAmB,EAAE,UAAU,CAAC,CAAC;IAC/F,QAAQ,CAAC,EAAE,cAAc,CAAC;CAC3B;AAED,eAAO,MAAM,kBAAkB,GAAI,UAAS,yBAA8B,KAAG,YAO5E,CAAC;AAGF,cAAc,SAAS,CAAC;AAKxB,cAAc,OAAO,CAAC;AAKtB,OAAO,EACL,aAAa,EACb,mBAAmB,EACnB,uBAAuB,EACvB,KAAK,aAAa,EAClB,KAAK,eAAe,EACrB,MAAM,2BAA2B,CAAC;AAInC,OAAO,EACL,iBAAiB,EACjB,sBAAsB,EACtB,YAAY,EACZ,gBAAgB,EAChB,KAAK,eAAe,EACrB,MAAM,0BAA0B,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAC;AAClE,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAEtD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,6BAA6B,CAAC;AAElE,cAAc,eAAe,CAAC;AAC9B,cAAc,eAAe,CAAC;AAC9B,OAAO,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAElD,OAAO,EACL,cAAc,EACd,mBAAmB,EACnB,iBAAiB,EAClB,MAAM,6BAA6B,CAAC;AAErC,OAAO,EACL,2BAA2B,EAC3B,2BAA2B,EAC5B,MAAM,oCAAoC,CAAC;AAE5C,OAAO,EACL,YAAY,EACZ,mBAAmB,EACnB,cAAc,EACd,WAAW,EACX,WAAW,EACX,cAAc,EACd,YAAY,EACZ,mBAAmB,EACnB,kBAAkB,EACnB,MAAM,wBAAwB,CAAC;AAEhC,MAAM,WAAW,yBAA0B,SAAQ,OAAO,CAAC,IAAI,CAAC,mBAAmB,EAAE,UAAU,CAAC,CAAC;IAC/F,QAAQ,CAAC,EAAE,cAAc,CAAC;CAC3B;AAED,eAAO,MAAM,kBAAkB,GAAI,UAAS,yBAA8B,KAAG,YAO5E,CAAC;AAGF,cAAc,SAAS,CAAC;AAGxB,cAAc,SAAS,CAAC;AAKxB,cAAc,OAAO,CAAC;AAKtB,OAAO,EACL,aAAa,EACb,mBAAmB,EACnB,uBAAuB,EACvB,KAAK,aAAa,EAClB,KAAK,eAAe,EACrB,MAAM,2BAA2B,CAAC;AAInC,OAAO,EACL,iBAAiB,EACjB,sBAAsB,EACtB,YAAY,EACZ,gBAAgB,EAChB,KAAK,eAAe,EACrB,MAAM,0BAA0B,CAAC"}

package/dist/index.js

@@ -38,6 +38,9 @@ const createAgentRuntime = (options = {}) => {
 exports.createAgentRuntime = createAgentRuntime;
 // Tool system
 __exportStar(require("./tools"), exports);
+// Graph runtime (DAG of loop-wrapping nodes). Nothing in the framework
+// consumes it yet — hosts opt in explicitly; zero behavior change until then.
+__exportStar(require("./graph"), exports);
 // MCP — Model Context Protocol client (Phase 1: groundwork). See
 // docs/integration-playlist/mcp-roadmap.md. Off by default — hosts
 // that don't construct an McpClientPool get zero behavior change.

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;AACA,yDAAsD;AACtD,+EAAiF;AAGjF,gDAA8B;AAC9B,gDAA8B;AAC9B,uCAAkD;AAAzC,0GAAA,iBAAiB,OAAA;AAE1B,+DAIqC;AADnC,oHAAA,iBAAiB,OAAA;AAGnB,6EAG4C;AAF1C,qIAAA,2BAA2B,OAAA;AAI7B,uDAUgC;AAT9B,4GAAA,YAAY,OAAA;AAeP,MAAM,kBAAkB,GAAG,CAAC,UAAqC,EAAE,EAAgB,EAAE;IAC1F,MAAM,EAAE,QAAQ,EAAE,gBAAgB,EAAE,GAAG,IAAI,EAAE,GAAG,OAAO,CAAC;IACxD,MAAM,QAAQ,GAAG,gBAAgB,IAAI,IAAI,oDAA2B,EAAE,CAAC;IACvE,OAAO,IAAI,2BAAY,CAAC;QACtB,QAAQ;QACR,GAAI,IAA8C;KACnD,CAAC,CAAC;AACL,CAAC,CAAC;AAPW,QAAA,kBAAkB,sBAO7B;AAEF,cAAc;AACd,0CAAwB;AAExB,iEAAiE;AACjE,mEAAmE;AACnE,kEAAkE;AAClE,wCAAsB;AAEtB,wDAAwD;AACxD,mEAAmE;AACnE,4CAA4C;AAC5C,4DAMmC;AALjC,+GAAA,aAAa,OAAA;AACb,qHAAA,mBAAmB,OAAA;AACnB,yHAAA,uBAAuB,OAAA;AAKzB,iFAAiF;AACjF,iFAAiF;AACjF,yDAMkC;AALhC,iHAAA,iBAAiB,OAAA;AACjB,sHAAA,sBAAsB,OAAA;AACtB,4GAAA,YAAY,OAAA;AACZ,gHAAA,gBAAgB,OAAA"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;AACA,yDAAsD;AACtD,+EAAiF;AAGjF,gDAA8B;AAC9B,gDAA8B;AAC9B,uCAAkD;AAAzC,0GAAA,iBAAiB,OAAA;AAE1B,+DAIqC;AADnC,oHAAA,iBAAiB,OAAA;AAGnB,6EAG4C;AAF1C,qIAAA,2BAA2B,OAAA;AAI7B,uDAUgC;AAT9B,4GAAA,YAAY,OAAA;AAeP,MAAM,kBAAkB,GAAG,CAAC,UAAqC,EAAE,EAAgB,EAAE;IAC1F,MAAM,EAAE,QAAQ,EAAE,gBAAgB,EAAE,GAAG,IAAI,EAAE,GAAG,OAAO,CAAC;IACxD,MAAM,QAAQ,GAAG,gBAAgB,IAAI,IAAI,oDAA2B,EAAE,CAAC;IACvE,OAAO,IAAI,2BAAY,CAAC;QACtB,QAAQ;QACR,GAAI,IAA8C;KACnD,CAAC,CAAC;AACL,CAAC,CAAC;AAPW,QAAA,kBAAkB,sBAO7B;AAEF,cAAc;AACd,0CAAwB;AACxB,uEAAuE;AACvE,8EAA8E;AAC9E,0CAAwB;AAExB,iEAAiE;AACjE,mEAAmE;AACnE,kEAAkE;AAClE,wCAAsB;AAEtB,wDAAwD;AACxD,mEAAmE;AACnE,4CAA4C;AAC5C,4DAMmC;AALjC,+GAAA,aAAa,OAAA;AACb,qHAAA,mBAAmB,OAAA;AACnB,yHAAA,uBAAuB,OAAA;AAKzB,iFAAiF;AACjF,iFAAiF;AACjF,yDAMkC;AALhC,iHAAA,iBAAiB,OAAA;AACjB,sHAAA,sBAAsB,OAAA;AACtB,4GAAA,YAAY,OAAA;AACZ,gHAAA,gBAAgB,OAAA"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@burtson-labs/agent-core",
-  "version": "1.6.38",
+  "version": "1.6.40",
   "author": {
     "name": "Burtson Labs",
     "email": "team@burtson.ai",