@inf-minds/kernel 0.0.1

package/dist/condition-evaluator.d.ts

@@ -0,0 +1,69 @@
+/**
+ * Context object passed to condition expressions.
+ */
+export interface ConditionContext {
+    /** Output from the source node */
+    output: unknown;
+    /** Current graph state */
+    graphState?: {
+        completedNodes: string[];
+        activeNodes: string[];
+        nodeOutputs?: Record<string, unknown>;
+    };
+    /** Current iteration count (for loops) */
+    iteration?: number;
+}
+/**
+ * Result of condition evaluation.
+ */
+export interface EvaluationResult {
+    /** Whether the condition evaluated to true */
+    result: boolean;
+    /** Error message if evaluation failed */
+    error?: string;
+}
+/**
+ * Evaluate a condition expression against a context.
+ *
+ * The condition is a JavaScript expression that has access to:
+ * - `output` - The output from the source node
+ * - `graphState` - Current graph execution state
+ * - `iteration` - Current iteration count (for loops)
+ *
+ * Examples:
+ * - `output.done === true`
+ * - `output.tasks.length > 0`
+ * - `iteration < 5`
+ * - `output.allTasksComplete`
+ * - `graphState.completedNodes.includes('research')`
+ *
+ * @param expression - JavaScript expression to evaluate
+ * @param context - Context object with output, graphState, iteration
+ * @returns Evaluation result with boolean result or error
+ */
+export declare function evaluateCondition(expression: string, context: ConditionContext): EvaluationResult;
+/**
+ * Check if a string looks like a valid condition expression.
+ * This is a quick heuristic check, not a full validation.
+ */
+export declare function isValidConditionExpression(expression: string): boolean;
+/**
+ * Common condition expressions for reference.
+ */
+export declare const COMMON_CONDITIONS: {
+    /** Node output indicates completion */
+    readonly OUTPUT_DONE: "output.done === true";
+    /** Node output indicates all tasks complete */
+    readonly ALL_TASKS_COMPLETE: "output.allTasksComplete";
+    /** Node has a delegated task */
+    readonly HAS_DELEGATED_TASK: "output.delegatedTask";
+    /** Output has items to process */
+    readonly HAS_ITEMS: "output.items && output.items.length > 0";
+    /** Iteration count under limit */
+    readonly UNDER_MAX_ITERATIONS: "iteration < 10";
+    /** Output indicates success */
+    readonly SUCCESS: "output.success === true";
+    /** Output indicates failure */
+    readonly FAILURE: "output.success === false";
+};
+//# sourceMappingURL=condition-evaluator.d.ts.map

package/dist/condition-evaluator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"condition-evaluator.d.ts","sourceRoot":"","sources":["../src/condition-evaluator.ts"],"names":[],"mappings":"AAGA;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,kCAAkC;IAClC,MAAM,EAAE,OAAO,CAAC;IAChB,0BAA0B;IAC1B,UAAU,CAAC,EAAE;QACX,cAAc,EAAE,MAAM,EAAE,CAAC;QACzB,WAAW,EAAE,MAAM,EAAE,CAAC;QACtB,WAAW,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;KACvC,CAAC;IACF,0CAA0C;IAC1C,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,8CAA8C;IAC9C,MAAM,EAAE,OAAO,CAAC;IAChB,yCAAyC;IACzC,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,iBAAiB,CAC/B,UAAU,EAAE,MAAM,EAClB,OAAO,EAAE,gBAAgB,GACxB,gBAAgB,CA+BlB;AAoDD;;;GAGG;AACH,wBAAgB,0BAA0B,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAStE;AAED;;GAEG;AACH,eAAO,MAAM,iBAAiB;IAC5B,uCAAuC;;IAEvC,+CAA+C;;IAE/C,gCAAgC;;IAEhC,kCAAkC;;IAElC,kCAAkC;;IAElC,+BAA+B;;IAE/B,+BAA+B;;CAEvB,CAAC"}

package/dist/condition-evaluator.js

@@ -0,0 +1,120 @@
+// ABOUTME: Safe condition evaluation for graph edges and node exit conditions
+// ABOUTME: Uses sandboxed function execution for expression evaluation
+/**
+ * Evaluate a condition expression against a context.
+ *
+ * The condition is a JavaScript expression that has access to:
+ * - `output` - The output from the source node
+ * - `graphState` - Current graph execution state
+ * - `iteration` - Current iteration count (for loops)
+ *
+ * Examples:
+ * - `output.done === true`
+ * - `output.tasks.length > 0`
+ * - `iteration < 5`
+ * - `output.allTasksComplete`
+ * - `graphState.completedNodes.includes('research')`
+ *
+ * @param expression - JavaScript expression to evaluate
+ * @param context - Context object with output, graphState, iteration
+ * @returns Evaluation result with boolean result or error
+ */
+export function evaluateCondition(expression, context) {
+    try {
+        // Validate expression for safety
+        const validationError = validateExpression(expression);
+        if (validationError) {
+            return { result: false, error: validationError };
+        }
+        // Create sandboxed function
+        const fn = new Function('output', 'graphState', 'iteration', `"use strict"; return (${expression});`);
+        // Execute with context
+        const result = fn(context.output, context.graphState ?? { completedNodes: [], activeNodes: [] }, context.iteration ?? 0);
+        // Coerce to boolean
+        return { result: Boolean(result) };
+    }
+    catch (error) {
+        return {
+            result: false,
+            error: error instanceof Error ? error.message : String(error),
+        };
+    }
+}
+/**
+ * Validate a condition expression for safety.
+ * Returns an error message if the expression is unsafe, undefined otherwise.
+ */
+function validateExpression(expression) {
+    // Block potentially dangerous constructs
+    const blockedPatterns = [
+        /\beval\b/,
+        /\bFunction\b/,
+        /\bsetTimeout\b/,
+        /\bsetInterval\b/,
+        /\bsetImmediate\b/,
+        /\brequire\b/,
+        /\bimport\b/,
+        /\bprocess\b/,
+        /\bglobal\b/,
+        /\bglobalThis\b/,
+        /\bwindow\b/,
+        /\bdocument\b/,
+        /\bfetch\b/,
+        /\bXMLHttpRequest\b/,
+        /\bWebSocket\b/,
+        /\b__proto__\b/,
+        /\bconstructor\b/,
+        /\bprototype\b/,
+        /\bObject\.assign\b/,
+        /\bObject\.defineProperty\b/,
+        /\bReflect\b/,
+        /\bProxy\b/,
+    ];
+    for (const pattern of blockedPatterns) {
+        if (pattern.test(expression)) {
+            return `Expression contains blocked construct: ${pattern.source}`;
+        }
+    }
+    // Block assignment operators (but allow == and ===)
+    if (/[^=!<>]=[^=]/.test(expression) && !/=>/.test(expression)) {
+        return 'Expression contains assignment operator';
+    }
+    // Block function definitions
+    if (/\bfunction\b/.test(expression)) {
+        return 'Expression contains function definition';
+    }
+    return undefined;
+}
+/**
+ * Check if a string looks like a valid condition expression.
+ * This is a quick heuristic check, not a full validation.
+ */
+export function isValidConditionExpression(expression) {
+    // Must be non-empty
+    if (!expression || expression.trim().length === 0) {
+        return false;
+    }
+    // Validate
+    const error = validateExpression(expression);
+    return error === undefined;
+}
+/**
+ * Common condition expressions for reference.
+ */
+export const COMMON_CONDITIONS = {
+    /** Node output indicates completion */
+    OUTPUT_DONE: 'output.done === true',
+    /** Node output indicates all tasks complete */
+    ALL_TASKS_COMPLETE: 'output.allTasksComplete',
+    /** Node has a delegated task */
+    HAS_DELEGATED_TASK: 'output.delegatedTask',
+    /** Output has items to process */
+    HAS_ITEMS: 'output.items && output.items.length > 0',
+    /** Iteration count under limit */
+    UNDER_MAX_ITERATIONS: 'iteration < 10',
+    /** Output indicates success */
+    SUCCESS: 'output.success === true',
+    /** Output indicates failure */
+    FAILURE: 'output.success === false',
+};
+//# sourceMappingURL=condition-evaluator.js.map

package/dist/condition-evaluator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"condition-evaluator.js","sourceRoot":"","sources":["../src/condition-evaluator.ts"],"names":[],"mappings":"AAAA,8EAA8E;AAC9E,uEAAuE;AA4BvE;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,iBAAiB,CAC/B,UAAkB,EAClB,OAAyB;IAEzB,IAAI,CAAC;QACH,iCAAiC;QACjC,MAAM,eAAe,GAAG,kBAAkB,CAAC,UAAU,CAAC,CAAC;QACvD,IAAI,eAAe,EAAE,CAAC;YACpB,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,eAAe,EAAE,CAAC;QACnD,CAAC;QAED,4BAA4B;QAC5B,MAAM,EAAE,GAAG,IAAI,QAAQ,CACrB,QAAQ,EACR,YAAY,EACZ,WAAW,EACX,yBAAyB,UAAU,IAAI,CACxC,CAAC;QAEF,uBAAuB;QACvB,MAAM,MAAM,GAAG,EAAE,CACf,OAAO,CAAC,MAAM,EACd,OAAO,CAAC,UAAU,IAAI,EAAE,cAAc,EAAE,EAAE,EAAE,WAAW,EAAE,EAAE,EAAE,EAC7D,OAAO,CAAC,SAAS,IAAI,CAAC,CACvB,CAAC;QAEF,oBAAoB;QACpB,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;IACrC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO;YACL,MAAM,EAAE,KAAK;YACb,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;SAC9D,CAAC;IACJ,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,kBAAkB,CAAC,UAAkB;IAC5C,yCAAyC;IACzC,MAAM,eAAe,GAAG;QACtB,UAAU;QACV,cAAc;QACd,gBAAgB;QAChB,iBAAiB;QACjB,kBAAkB;QAClB,aAAa;QACb,YAAY;QACZ,aAAa;QACb,YAAY;QACZ,gBAAgB;QAChB,YAAY;QACZ,cAAc;QACd,WAAW;QACX,oBAAoB;QACpB,eAAe;QACf,eAAe;QACf,iBAAiB;QACjB,eAAe;QACf,oBAAoB;QACpB,4BAA4B;QAC5B,aAAa;QACb,WAAW;KACZ,CAAC;IAEF,KAAK,MAAM,OAAO,IAAI,eAAe,EAAE,CAAC;QACtC,IAAI,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YAC7B,OAAO,0CAA0C,OAAO,CAAC,MAAM,EAAE,CAAC;QACpE,CAAC;IACH,CAAC;IAED,oDAAoD;IACpD,IAAI,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;QAC9D,OAAO,yCAAyC,CAAC;IACnD,CAAC;IAED,6BAA6B;IAC7B,IAAI,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;QACpC,OAAO,yCAAyC,CAAC;IACnD,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,0BAA0B,CAAC,UAAkB;IAC3D,oBAAoB;IACpB,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAClD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,WAAW;IACX,MAAM,KAAK,GAAG,kBAAkB,CAAC,UAAU,CAAC,CAAC;IAC7C,OAAO,KAAK,KAAK,SAAS,CAAC;AAC7B,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG;IAC/B,uCAAuC;IACvC,WAAW,EAAE,sBAAsB;IACnC,+CAA+C;IAC/C,kBAAkB,EAAE,yBAAyB;IAC7C,gCAAgC;IAChC,kBAAkB,EAAE,sBAAsB;IAC1C,kCAAkC;IAClC,SAAS,EAAE,yCAAyC;IACpD,kCAAkC;IAClC,oBAAoB,EAAE,gBAAgB;IACtC,+BAA+B;IAC/B,OAAO,EAAE,yBAAyB;IAClC,+BAA+B;IAC/B,OAAO,EAAE,0BAA0B;CAC3B,CAAC"}

package/dist/graph-executor.d.ts

@@ -0,0 +1,63 @@
+import type { CoordinationMode } from '@inf-minds/coordination-modes';
+import type { GraphState } from '@inf-minds/jobs';
+/**
+ * Result of determining the next nodes to execute.
+ */
+export interface NextNodesResult {
+    /** Node IDs to start executing */
+    nodesToStart: string[];
+    /** Node IDs that were skipped (condition not met) */
+    skippedNodes: string[];
+    /** Whether the session should complete */
+    shouldComplete: boolean;
+    /** Final output if session should complete */
+    finalOutput?: unknown;
+}
+/**
+ * Options for determining next nodes.
+ */
+export interface DetermineNextNodesOptions {
+    /** The coordination mode */
+    mode: CoordinationMode;
+    /** Current graph state */
+    graphState: GraphState;
+    /** Node that just completed (or null if starting) */
+    completedNodeId: string | null;
+    /** Output from the completed node */
+    completedOutput: unknown;
+}
+/**
+ * Determine which nodes should be executed next after a node completes.
+ *
+ * This function:
+ * 1. Finds outgoing edges from the completed node
+ * 2. Evaluates edge conditions
+ * 3. Handles loop logic (exit conditions and max iterations)
+ * 4. Checks if session should complete
+ */
+export declare function determineNextNodes(options: DetermineNextNodesOptions): NextNodesResult;
+/**
+ * Update graph state when a node starts.
+ */
+export declare function updateStateForNodeStart(graphState: GraphState, nodeId: string, jobId: string): GraphState;
+/**
+ * Update graph state when a node completes.
+ */
+export declare function updateStateForNodeComplete(graphState: GraphState, nodeId: string, output: unknown): GraphState;
+/**
+ * Update graph state when a node fails.
+ */
+export declare function updateStateForNodeFailure(graphState: GraphState, nodeId: string, error: string): GraphState;
+/**
+ * Update graph state when a node is skipped.
+ */
+export declare function updateStateForNodeSkipped(graphState: GraphState, nodeId: string, reason: string): GraphState;
+/**
+ * Mark graph state as completed.
+ */
+export declare function markGraphComplete(graphState: GraphState): GraphState;
+/**
+ * Mark graph state as failed.
+ */
+export declare function markGraphFailed(graphState: GraphState): GraphState;
+//# sourceMappingURL=graph-executor.d.ts.map

package/dist/graph-executor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-executor.d.ts","sourceRoot":"","sources":["../src/graph-executor.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,+BAA+B,CAAC;AACtE,OAAO,KAAK,EAAE,UAAU,EAAkB,MAAM,iBAAiB,CAAC;AAGlE;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,kCAAkC;IAClC,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,qDAAqD;IACrD,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,0CAA0C;IAC1C,cAAc,EAAE,OAAO,CAAC;IACxB,8CAA8C;IAC9C,WAAW,CAAC,EAAE,OAAO,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,WAAW,yBAAyB;IACxC,4BAA4B;IAC5B,IAAI,EAAE,gBAAgB,CAAC;IACvB,0BAA0B;IAC1B,UAAU,EAAE,UAAU,CAAC;IACvB,qDAAqD;IACrD,eAAe,EAAE,MAAM,GAAG,IAAI,CAAC;IAC/B,qCAAqC;IACrC,eAAe,EAAE,OAAO,CAAC;CAC1B;AAED;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,yBAAyB,GAAG,eAAe,CA+GtF;AAyBD;;GAEG;AACH,wBAAgB,uBAAuB,CACrC,UAAU,EAAE,UAAU,EACtB,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,MAAM,GACZ,UAAU,CAmBZ;AAED;;GAEG;AACH,wBAAgB,0BAA0B,CACxC,UAAU,EAAE,UAAU,EACtB,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,OAAO,GACd,UAAU,CAoBZ;AAED;;GAEG;AACH,wBAAgB,yBAAyB,CACvC,UAAU,EAAE,UAAU,EACtB,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,MAAM,GACZ,UAAU,CAoBZ;AAED;;GAEG;AACH,wBAAgB,yBAAyB,CACvC,UAAU,EAAE,UAAU,EACtB,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,GACb,UAAU,CAmBZ;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,UAAU,EAAE,UAAU,GAAG,UAAU,CAMpE;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,UAAU,EAAE,UAAU,GAAG,UAAU,CAMlE"}

package/dist/graph-executor.js

@@ -0,0 +1,245 @@
+// ABOUTME: Graph executor for coordination mode execution
+// ABOUTME: Handles node scheduling, edge traversal, and state management
+import { evaluateCondition } from './condition-evaluator.js';
+/**
+ * Determine which nodes should be executed next after a node completes.
+ *
+ * This function:
+ * 1. Finds outgoing edges from the completed node
+ * 2. Evaluates edge conditions
+ * 3. Handles loop logic (exit conditions and max iterations)
+ * 4. Checks if session should complete
+ */
+export function determineNextNodes(options) {
+    const { mode, graphState, completedNodeId, completedOutput } = options;
+    const nodesToStart = [];
+    const skippedNodes = [];
+    // If no completed node, we're starting - go to entry node
+    if (!completedNodeId) {
+        return {
+            nodesToStart: [mode.graph.entryNode],
+            skippedNodes: [],
+            shouldComplete: false,
+        };
+    }
+    // Get the completed node definition
+    const completedNode = mode.graph.nodes[completedNodeId];
+    if (!completedNode) {
+        return {
+            nodesToStart: [],
+            skippedNodes: [],
+            shouldComplete: true,
+            finalOutput: { error: `Node ${completedNodeId} not found in graph` },
+        };
+    }
+    // Check if this is an exit node
+    const isExitNode = mode.graph.exitNodes.includes(completedNodeId);
+    // Count iterations for loop handling
+    const currentIteration = graphState.nodes[completedNodeId]?.jobId
+        ? countIterations(graphState, completedNodeId)
+        : 0;
+    // Build condition context (reused for edge and exit conditions)
+    const context = {
+        output: completedOutput,
+        graphState: {
+            completedNodes: graphState.completedNodes,
+            activeNodes: graphState.activeNodes,
+            nodeOutputs: extractNodeOutputs(graphState),
+        },
+        iteration: currentIteration,
+    };
+    // Find outgoing edges
+    const outgoingEdges = mode.graph.edges.filter((e) => e.from === completedNodeId);
+    // Evaluate conditions for each outgoing edge FIRST
+    for (const edge of outgoingEdges) {
+        if (edge.condition) {
+            const evalResult = evaluateCondition(edge.condition, context);
+            if (evalResult.result) {
+                nodesToStart.push(edge.to);
+            }
+            else {
+                skippedNodes.push(edge.to);
+            }
+        }
+        else {
+            // No condition - always traverse
+            nodesToStart.push(edge.to);
+        }
+    }
+    // If we have nodes to traverse, go to them (regardless of exit condition)
+    if (nodesToStart.length > 0) {
+        return {
+            nodesToStart,
+            skippedNodes,
+            shouldComplete: false,
+        };
+    }
+    // No edges to traverse - check exit condition for potential looping
+    if (completedNode.exitCondition) {
+        const exitResult = evaluateCondition(completedNode.exitCondition, context);
+        // If exit condition is NOT met and under max iterations, loop back
+        if (!exitResult.result) {
+            const maxIterations = completedNode.maxIterations ?? Infinity;
+            if (currentIteration < maxIterations) {
+                // Loop: re-execute this node
+                return {
+                    nodesToStart: [completedNodeId],
+                    skippedNodes,
+                    shouldComplete: false,
+                };
+            }
+        }
+        // Exit condition met or max iterations reached - session should complete
+    }
+    // No edges taken and either:
+    // - No exit condition (so we just complete)
+    // - Exit condition is met
+    // - Max iterations reached
+    if (isExitNode || outgoingEdges.length === 0) {
+        return {
+            nodesToStart: [],
+            skippedNodes,
+            shouldComplete: true,
+            finalOutput: completedOutput,
+        };
+    }
+    // Dead end but not an exit node - this is a graph issue
+    return {
+        nodesToStart: [],
+        skippedNodes,
+        shouldComplete: true,
+        finalOutput: { error: `Node ${completedNodeId} has no traversable edges and is not an exit node` },
+    };
+}
+/**
+ * Count how many times a node has been executed in this session.
+ */
+function countIterations(graphState, nodeId) {
+    // In the current model, we track iterations through job count
+    // For now, count how many times the node appears in completedNodes
+    // A more robust implementation would track this in the node state
+    return graphState.completedNodes.filter((id) => id === nodeId).length + 1;
+}
+/**
+ * Extract node outputs from graph state.
+ */
+function extractNodeOutputs(graphState) {
+    const outputs = {};
+    for (const [nodeId, nodeState] of Object.entries(graphState.nodes)) {
+        if (nodeState.output !== undefined) {
+            outputs[nodeId] = nodeState.output;
+        }
+    }
+    return outputs;
+}
+/**
+ * Update graph state when a node starts.
+ */
+export function updateStateForNodeStart(graphState, nodeId, jobId) {
+    const nodeState = graphState.nodes[nodeId] ?? {
+        nodeId,
+        status: 'pending',
+    };
+    return {
+        ...graphState,
+        nodes: {
+            ...graphState.nodes,
+            [nodeId]: {
+                ...nodeState,
+                status: 'active',
+                jobId,
+                startedAt: new Date().toISOString(),
+            },
+        },
+        activeNodes: [...graphState.activeNodes.filter((id) => id !== nodeId), nodeId],
+    };
+}
+/**
+ * Update graph state when a node completes.
+ */
+export function updateStateForNodeComplete(graphState, nodeId, output) {
+    const nodeState = graphState.nodes[nodeId];
+    if (!nodeState) {
+        return graphState;
+    }
+    return {
+        ...graphState,
+        nodes: {
+            ...graphState.nodes,
+            [nodeId]: {
+                ...nodeState,
+                status: 'completed',
+                output,
+                completedAt: new Date().toISOString(),
+            },
+        },
+        activeNodes: graphState.activeNodes.filter((id) => id !== nodeId),
+        completedNodes: [...graphState.completedNodes, nodeId],
+    };
+}
+/**
+ * Update graph state when a node fails.
+ */
+export function updateStateForNodeFailure(graphState, nodeId, error) {
+    const nodeState = graphState.nodes[nodeId];
+    if (!nodeState) {
+        return graphState;
+    }
+    return {
+        ...graphState,
+        nodes: {
+            ...graphState.nodes,
+            [nodeId]: {
+                ...nodeState,
+                status: 'failed',
+                error,
+                completedAt: new Date().toISOString(),
+            },
+        },
+        activeNodes: graphState.activeNodes.filter((id) => id !== nodeId),
+        failedNodes: [...graphState.failedNodes, nodeId],
+    };
+}
+/**
+ * Update graph state when a node is skipped.
+ */
+export function updateStateForNodeSkipped(graphState, nodeId, reason) {
+    const nodeState = graphState.nodes[nodeId] ?? {
+        nodeId,
+        status: 'pending',
+    };
+    return {
+        ...graphState,
+        nodes: {
+            ...graphState.nodes,
+            [nodeId]: {
+                ...nodeState,
+                status: 'skipped',
+                error: reason,
+                completedAt: new Date().toISOString(),
+            },
+        },
+        skippedNodes: [...graphState.skippedNodes, nodeId],
+    };
+}
+/**
+ * Mark graph state as completed.
+ */
+export function markGraphComplete(graphState) {
+    return {
+        ...graphState,
+        status: 'completed',
+        completedAt: new Date().toISOString(),
+    };
+}
+/**
+ * Mark graph state as failed.
+ */
+export function markGraphFailed(graphState) {
+    return {
+        ...graphState,
+        status: 'failed',
+        completedAt: new Date().toISOString(),
+    };
+}
+//# sourceMappingURL=graph-executor.js.map

package/dist/graph-executor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-executor.js","sourceRoot":"","sources":["../src/graph-executor.ts"],"names":[],"mappings":"AAAA,0DAA0D;AAC1D,yEAAyE;AAIzE,OAAO,EAAE,iBAAiB,EAAyB,MAAM,0BAA0B,CAAC;AA8BpF;;;;;;;;GAQG;AACH,MAAM,UAAU,kBAAkB,CAAC,OAAkC;IACnE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,eAAe,EAAE,eAAe,EAAE,GAAG,OAAO,CAAC;IACvE,MAAM,YAAY,GAAa,EAAE,CAAC;IAClC,MAAM,YAAY,GAAa,EAAE,CAAC;IAElC,0DAA0D;IAC1D,IAAI,CAAC,eAAe,EAAE,CAAC;QACrB,OAAO;YACL,YAAY,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC;YACpC,YAAY,EAAE,EAAE;YAChB,cAAc,EAAE,KAAK;SACtB,CAAC;IACJ,CAAC;IAED,oCAAoC;IACpC,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IACxD,IAAI,CAAC,aAAa,EAAE,CAAC;QACnB,OAAO;YACL,YAAY,EAAE,EAAE;YAChB,YAAY,EAAE,EAAE;YAChB,cAAc,EAAE,IAAI;YACpB,WAAW,EAAE,EAAE,KAAK,EAAE,QAAQ,eAAe,qBAAqB,EAAE;SACrE,CAAC;IACJ,CAAC;IAED,gCAAgC;IAChC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;IAElE,qCAAqC;IACrC,MAAM,gBAAgB,GAAG,UAAU,CAAC,KAAK,CAAC,eAAe,CAAC,EAAE,KAAK;QAC/D,CAAC,CAAC,eAAe,CAAC,UAAU,EAAE,eAAe,CAAC;QAC9C,CAAC,CAAC,CAAC,CAAC;IAEN,gEAAgE;IAChE,MAAM,OAAO,GAAqB;QAChC,MAAM,EAAE,eAAe;QACvB,UAAU,EAAE;YACV,cAAc,EAAE,UAAU,CAAC,cAAc;YACzC,WAAW,EAAE,UAAU,CAAC,WAAW;YACnC,WAAW,EAAE,kBAAkB,CAAC,UAAU,CAAC;SAC5C;QACD,SAAS,EAAE,gBAAgB;KAC5B,CAAC;IAEF,sBAAsB;IACtB,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,eAAe,CAAC,CAAC;IAEjF,mDAAmD;IACnD,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,MAAM,UAAU,GAAG,iBAAiB,CAAC,IAAI,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;YAE9D,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;gBACtB,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC7B,CAAC;iBAAM,CAAC;gBACN,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;aAAM,CAAC;YACN,iCAAiC;YACjC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;IAED,0EAA0E;IAC1E,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5B,OAAO;YACL,YAAY;YACZ,YAAY;YACZ,cAAc,EAAE,KAAK;SACtB,CAAC;IACJ,CAAC;IAED,oEAAoE;IACpE,IAAI,aAAa,CAAC,aAAa,EAAE,CAAC;QAChC,MAAM,UAAU,GAAG,iBAAiB,CAAC,aAAa,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;QAE3E,mEAAmE;QACnE,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;YACvB,MAAM,aAAa,GAAG,aAAa,CAAC,aAAa,IAAI,QAAQ,CAAC;YAC9D,IAAI,gBAAgB,GAAG,aAAa,EAAE,CAAC;gBACrC,6BAA6B;gBAC7B,OAAO;oBACL,YAAY,EAAE,CAAC,eAAe,CAAC;oBAC/B,YAAY;oBACZ,cAAc,EAAE,KAAK;iBACtB,CAAC;YACJ,CAAC;QACH,CAAC;QACD,yEAAyE;IAC3E,CAAC;IAED,6BAA6B;IAC7B,4CAA4C;IAC5C,0BAA0B;IAC1B,2BAA2B;IAC3B,IAAI,UAAU,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7C,OAAO;YACL,YAAY,EAAE,EAAE;YAChB,YAAY;YACZ,cAAc,EAAE,IAAI;YACpB,WAAW,EAAE,eAAe;SAC7B,CAAC;IACJ,CAAC;IAED,wDAAwD;IACxD,OAAO;QACL,YAAY,EAAE,EAAE;QAChB,YAAY;QACZ,cAAc,EAAE,IAAI;QACpB,WAAW,EAAE,EAAE,KAAK,EAAE,QAAQ,eAAe,mDAAmD,EAAE;KACnG,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CAAC,UAAsB,EAAE,MAAc;IAC7D,8DAA8D;IAC9D,mEAAmE;IACnE,kEAAkE;IAClE,OAAO,UAAU,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;AAC5E,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAAC,UAAsB;IAChD,MAAM,OAAO,GAA4B,EAAE,CAAC;IAC5C,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QACnE,IAAI,SAAS,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YACnC,OAAO,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;QACrC,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,uBAAuB,CACrC,UAAsB,EACtB,MAAc,EACd,KAAa;IAEb,MAAM,SAAS,GAAmB,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI;QAC5D,MAAM;QACN,MAAM,EAAE,SAAS;KAClB,CAAC;IAEF,OAAO;QACL,GAAG,UAAU;QACb,KAAK,EAAE;YACL,GAAG,UAAU,CAAC,KAAK;YACnB,CAAC,MAAM,CAAC,EAAE;gBACR,GAAG,SAAS;gBACZ,MAAM,EAAE,QAAQ;gBAChB,KAAK;gBACL,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;aACpC;SACF;QACD,WAAW,EAAE,CAAC,GAAG,UAAU,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC;KAC/E,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,0BAA0B,CACxC,UAAsB,EACtB,MAAc,EACd,MAAe;IAEf,MAAM,SAAS,GAAG,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC3C,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,OAAO;QACL,GAAG,UAAU;QACb,KAAK,EAAE;YACL,GAAG,UAAU,CAAC,KAAK;YACnB,CAAC,MAAM,CAAC,EAAE;gBACR,GAAG,SAAS;gBACZ,MAAM,EAAE,WAAW;gBACnB,MAAM;gBACN,WAAW,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;aACtC;SACF;QACD,WAAW,EAAE,UAAU,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC;QACjE,cAAc,EAAE,CAAC,GAAG,UAAU,CAAC,cAAc,EAAE,MAAM,CAAC;KACvD,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,yBAAyB,CACvC,UAAsB,EACtB,MAAc,EACd,KAAa;IAEb,MAAM,SAAS,GAAG,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC3C,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,OAAO;QACL,GAAG,UAAU;QACb,KAAK,EAAE;YACL,GAAG,UAAU,CAAC,KAAK;YACnB,CAAC,MAAM,CAAC,EAAE;gBACR,GAAG,SAAS;gBACZ,MAAM,EAAE,QAAQ;gBAChB,KAAK;gBACL,WAAW,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;aACtC;SACF;QACD,WAAW,EAAE,UAAU,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC;QACjE,WAAW,EAAE,CAAC,GAAG,UAAU,CAAC,WAAW,EAAE,MAAM,CAAC;KACjD,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,yBAAyB,CACvC,UAAsB,EACtB,MAAc,EACd,MAAc;IAEd,MAAM,SAAS,GAAmB,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI;QAC5D,MAAM;QACN,MAAM,EAAE,SAAS;KAClB,CAAC;IAEF,OAAO;QACL,GAAG,UAAU;QACb,KAAK,EAAE;YACL,GAAG,UAAU,CAAC,KAAK;YACnB,CAAC,MAAM,CAAC,EAAE;gBACR,GAAG,SAAS;gBACZ,MAAM,EAAE,SAAS;gBACjB,KAAK,EAAE,MAAM;gBACb,WAAW,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;aACtC;SACF;QACD,YAAY,EAAE,CAAC,GAAG,UAAU,CAAC,YAAY,EAAE,MAAM,CAAC;KACnD,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,UAAsB;IACtD,OAAO;QACL,GAAG,UAAU;QACb,MAAM,EAAE,WAAW;QACnB,WAAW,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;KACtC,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,UAAsB;IACpD,OAAO;QACL,GAAG,UAAU;QACb,MAAM,EAAE,QAAQ;QAChB,WAAW,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;KACtC,CAAC;AACJ,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,7 @@
+export type { SessionStatus, Unsubscribe, SessionFilter, CreateSessionOptions, SessionEvent, KernelSession, Kernel, KernelOptions, MindRegistry, ModeRegistry, StartNodeOptions, NodeCompletionOptions, GraphState, } from './types.js';
+export { SESSION_STATUS } from './types.js';
+export { createMindRegistry, createModeRegistry } from './registries/index.js';
+export { createKernel } from './kernel.js';
+export { evaluateCondition, isValidConditionExpression, COMMON_CONDITIONS, type ConditionContext, type EvaluationResult, } from './condition-evaluator.js';
+export { determineNextNodes, updateStateForNodeStart, updateStateForNodeComplete, updateStateForNodeFailure, updateStateForNodeSkipped, markGraphComplete, markGraphFailed, type NextNodesResult, type DetermineNextNodesOptions, } from './graph-executor.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAIA,YAAY,EACV,aAAa,EACb,WAAW,EACX,aAAa,EACb,oBAAoB,EACpB,YAAY,EACZ,aAAa,EACb,MAAM,EACN,aAAa,EACb,YAAY,EACZ,YAAY,EACZ,gBAAgB,EAChB,qBAAqB,EACrB,UAAU,GACX,MAAM,YAAY,CAAC;AAGpB,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAG5C,OAAO,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAG/E,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAG3C,OAAO,EACL,iBAAiB,EACjB,0BAA0B,EAC1B,iBAAiB,EACjB,KAAK,gBAAgB,EACrB,KAAK,gBAAgB,GACtB,MAAM,0BAA0B,CAAC;AAGlC,OAAO,EACL,kBAAkB,EAClB,uBAAuB,EACvB,0BAA0B,EAC1B,yBAAyB,EACzB,yBAAyB,EACzB,iBAAiB,EACjB,eAAe,EACf,KAAK,eAAe,EACpB,KAAK,yBAAyB,GAC/B,MAAM,qBAAqB,CAAC"}

package/dist/index.js

@@ -0,0 +1,13 @@
+// ABOUTME: Kernel package entry point
+// ABOUTME: Exports kernel session orchestration and graph execution
+// Constant exports
+export { SESSION_STATUS } from './types.js';
+// Registry exports
+export { createMindRegistry, createModeRegistry } from './registries/index.js';
+// Kernel factory
+export { createKernel } from './kernel.js';
+// Condition evaluator
+export { evaluateCondition, isValidConditionExpression, COMMON_CONDITIONS, } from './condition-evaluator.js';
+// Graph executor utilities
+export { determineNextNodes, updateStateForNodeStart, updateStateForNodeComplete, updateStateForNodeFailure, updateStateForNodeSkipped, markGraphComplete, markGraphFailed, } from './graph-executor.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,sCAAsC;AACtC,oEAAoE;AAmBpE,mBAAmB;AACnB,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAE5C,mBAAmB;AACnB,OAAO,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAE/E,iBAAiB;AACjB,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAE3C,sBAAsB;AACtB,OAAO,EACL,iBAAiB,EACjB,0BAA0B,EAC1B,iBAAiB,GAGlB,MAAM,0BAA0B,CAAC;AAElC,2BAA2B;AAC3B,OAAO,EACL,kBAAkB,EAClB,uBAAuB,EACvB,0BAA0B,EAC1B,yBAAyB,EACzB,yBAAyB,EACzB,iBAAiB,EACjB,eAAe,GAGhB,MAAM,qBAAqB,CAAC"}

package/dist/kernel.d.ts

@@ -0,0 +1,45 @@
+import type { Kernel, KernelOptions } from './types.js';
+/**
+ * Create a new kernel instance.
+ *
+ * The kernel is the central orchestrator for multi-mind coordination.
+ * It manages:
+ * - Mind configurations (registered by name)
+ * - Coordination modes (execution graphs)
+ * - Sessions (executing instances of modes)
+ *
+ * @param options - Kernel configuration options
+ * @returns A new Kernel instance
+ *
+ * @example
+ * ```ts
+ * const kernel = createKernel({
+ *   jobManager,
+ *   eventAppender,
+ *   artifactManager,
+ * });
+ *
+ * // Register minds
+ * kernel.registerMind('researcher', {
+ *   model: 'claude-sonnet-4-20250514',
+ *   systemPrompt: 'You are a research assistant...',
+ * });
+ *
+ * // Register modes
+ * kernel.registerMode(createPipelineMode({
+ *   steps: [
+ *     { id: 'research', mind: { type: 'registered', mindType: 'researcher' } },
+ *     { id: 'analyze', mind: { type: 'registered', mindType: 'analyzer' } },
+ *   ],
+ * }));
+ *
+ * // Create and run a session
+ * const session = await kernel.createSession({
+ *   mode: 'pipeline',
+ *   input: { topic: 'quantum computing' },
+ *   accountId: 'acc-123',
+ * });
+ * ```
+ */
+export declare function createKernel(options: KernelOptions): Kernel;
+//# sourceMappingURL=kernel.d.ts.map

package/dist/kernel.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"kernel.d.ts","sourceRoot":"","sources":["../src/kernel.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EACV,MAAM,EACN,aAAa,EAKd,MAAM,YAAY,CAAC;AAIpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAyCG;AACH,wBAAgB,YAAY,CAAC,OAAO,EAAE,aAAa,GAAG,MAAM,CAqL3D"}