@gotza02/mathinking 1.0.0

package/dist/types/index.d.ts

@@ -0,0 +1,142 @@
+export interface ThoughtStep {
+    id: string;
+    stepNumber: number;
+    thought: string;
+    thoughtType: ThoughtType;
+    timestamp: string;
+    parentId?: string;
+    branchLabel?: string;
+    isRevision?: boolean;
+    revisedFromId?: string;
+    hypothesis?: string;
+    verificationStatus?: VerificationStatus;
+    verificationEvidence?: string;
+    confidence: number;
+    metadata?: Record<string, unknown>;
+}
+export type ThoughtType = 'initial_analysis' | 'decomposition' | 'hypothesis' | 'verification' | 'branch_exploration' | 'synthesis' | 'revision' | 'conclusion';
+export type VerificationStatus = 'pending' | 'verified' | 'refuted' | 'partially_verified' | 'needs_more_evidence';
+export interface ThinkingSession {
+    sessionId: string;
+    problemStatement: string;
+    totalThoughts: number;
+    currentStep: number;
+    thoughtHistory: ThoughtStep[];
+    branches: Branch[];
+    status: SessionStatus;
+    createdAt: string;
+    updatedAt: string;
+    finalConclusion?: string;
+}
+export interface Branch {
+    id: string;
+    label: string;
+    parentThoughtId: string;
+    thoughtIds: string[];
+    status: 'active' | 'merged' | 'abandoned';
+    mergedIntoId?: string;
+}
+export type SessionStatus = 'in_progress' | 'awaiting_verification' | 'completed' | 'paused';
+export interface SequentialThinkingInput {
+    action: ThinkingAction;
+    sessionId?: string;
+    problemStatement?: string;
+    thought?: string;
+    thoughtType?: ThoughtType;
+    totalThoughts?: number;
+    branchFromThoughtId?: string;
+    branchLabel?: string;
+    reviseThoughtId?: string;
+    hypothesis?: string;
+    verificationEvidence?: string;
+    verificationStatus?: VerificationStatus;
+    confidence?: number;
+}
+export type ThinkingAction = 'start_session' | 'add_thought' | 'create_branch' | 'revise_thought' | 'set_hypothesis' | 'verify_hypothesis' | 'adjust_total_thoughts' | 'conclude' | 'get_status' | 'get_history';
+export interface SequentialThinkingOutput {
+    success: boolean;
+    sessionId: string;
+    currentStep: number;
+    totalThoughts: number;
+    status: SessionStatus;
+    thought?: ThoughtStep;
+    thoughtHistory?: ThoughtStep[];
+    branches?: Branch[];
+    message: string;
+    nextSuggestedActions?: string[];
+    conclusion?: string;
+}
+export interface TaskNode {
+    id: string;
+    name: string;
+    description?: string;
+    toolName: string;
+    toolInput: Record<string, unknown>;
+    dependencies: string[];
+    timeout?: number;
+    retryCount?: number;
+    retryDelay?: number;
+}
+export interface ExecutionPlan {
+    planId: string;
+    name: string;
+    description?: string;
+    tasks: TaskNode[];
+    metadata?: Record<string, unknown>;
+}
+export interface TaskResult {
+    taskId: string;
+    taskName: string;
+    status: TaskStatus;
+    result?: unknown;
+    error?: string;
+    startTime: string;
+    endTime: string;
+    duration: number;
+    retries: number;
+}
+export type TaskStatus = 'pending' | 'running' | 'completed' | 'failed' | 'skipped';
+export interface ExecutionResult {
+    planId: string;
+    planName: string;
+    status: ExecutionStatus;
+    taskResults: TaskResult[];
+    startTime: string;
+    endTime: string;
+    totalDuration: number;
+    successCount: number;
+    failureCount: number;
+    skippedCount: number;
+    executionOrder: string[][];
+    aggregatedResults: Record<string, unknown>;
+    errors: ExecutionError[];
+}
+export type ExecutionStatus = 'completed' | 'completed_with_errors' | 'failed';
+export interface ExecutionError {
+    taskId: string;
+    taskName: string;
+    error: string;
+    timestamp: string;
+}
+export interface OrchestratorInput {
+    action: OrchestratorAction;
+    plan?: ExecutionPlan;
+    planId?: string;
+}
+export type OrchestratorAction = 'execute_plan' | 'validate_plan' | 'get_execution_status';
+export interface OrchestratorOutput {
+    success: boolean;
+    message: string;
+    result?: ExecutionResult;
+    validationErrors?: string[];
+    executionOrder?: string[][];
+}
+export interface ToolDefinition {
+    name: string;
+    description: string;
+    execute: (input: Record<string, unknown>) => Promise<unknown>;
+}
+export interface ToolRegistry {
+    [toolName: string]: ToolDefinition;
+}
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/types/index.ts"],"names":[],"mappings":"AAIA,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,WAAW,CAAC;IACzB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,kBAAkB,CAAC,EAAE,kBAAkB,CAAC;IACxC,oBAAoB,CAAC,EAAE,MAAM,CAAC;IAC9B,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACpC;AAED,MAAM,MAAM,WAAW,GACnB,kBAAkB,GAClB,eAAe,GACf,YAAY,GACZ,cAAc,GACd,oBAAoB,GACpB,WAAW,GACX,UAAU,GACV,YAAY,CAAC;AAEjB,MAAM,MAAM,kBAAkB,GAC1B,SAAS,GACT,UAAU,GACV,SAAS,GACT,oBAAoB,GACpB,qBAAqB,CAAC;AAE1B,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,gBAAgB,EAAE,MAAM,CAAC;IACzB,aAAa,EAAE,MAAM,CAAC;IACtB,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,EAAE,WAAW,EAAE,CAAC;IAC9B,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,MAAM,EAAE,aAAa,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,eAAe,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,WAAW,MAAM;IACrB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,eAAe,EAAE,MAAM,CAAC;IACxB,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,MAAM,EAAE,QAAQ,GAAG,QAAQ,GAAG,WAAW,CAAC;IAC1C,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,MAAM,aAAa,GACrB,aAAa,GACb,uBAAuB,GACvB,WAAW,GACX,QAAQ,CAAC;AAEb,MAAM,WAAW,uBAAuB;IACtC,MAAM,EAAE,cAAc,CAAC;IACvB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,WAAW,CAAC,EAAE,WAAW,CAAC;IAC1B,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,oBAAoB,CAAC,EAAE,MAAM,CAAC;IAC9B,kBAAkB,CAAC,EAAE,kBAAkB,CAAC;IACxC,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,MAAM,cAAc,GACtB,eAAe,GACf,aAAa,GACb,eAAe,GACf,gBAAgB,GAChB,gBAAgB,GAChB,mBAAmB,GACnB,uBAAuB,GACvB,UAAU,GACV,YAAY,GACZ,aAAa,CAAC;AAElB,MAAM,WAAW,wBAAwB;IACvC,OAAO,EAAE,OAAO,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,EAAE,MAAM,CAAC;IACtB,MAAM,EAAE,aAAa,CAAC;IACtB,OAAO,CAAC,EAAE,WAAW,CAAC;IACtB,cAAc,CAAC,EAAE,WAAW,EAAE,CAAC;IAC/B,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IACpB,OAAO,EAAE,MAAM,CAAC;IAChB,oBAAoB,CAAC,EAAE,MAAM,EAAE,CAAC;IAChC,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAMD,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACnC,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,aAAa;IAC5B,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,KAAK,EAAE,QAAQ,EAAE,CAAC;IAClB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACpC;AAED,MAAM,WAAW,UAAU;IACzB,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,UAAU,CAAC;IACnB,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,MAAM,UAAU,GAClB,SAAS,GACT,SAAS,GACT,WAAW,GACX,QAAQ,GACR,SAAS,CAAC;AAEd,MAAM,WAAW,eAAe;IAC9B,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,eAAe,CAAC;IACxB,WAAW,EAAE,UAAU,EAAE,CAAC;IAC1B,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,aAAa,EAAE,MAAM,CAAC;IACtB,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,cAAc,EAAE,MAAM,EAAE,EAAE,CAAC;IAC3B,iBAAiB,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC3C,MAAM,EAAE,cAAc,EAAE,CAAC;CAC1B;AAED,MAAM,MAAM,eAAe,GACvB,WAAW,GACX,uBAAuB,GACvB,QAAQ,CAAC;AAEb,MAAM,WAAW,cAAc;IAC7B,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,iBAAiB;IAChC,MAAM,EAAE,kBAAkB,CAAC;IAC3B,IAAI,CAAC,EAAE,aAAa,CAAC;IACrB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,MAAM,kBAAkB,GAC1B,cAAc,GACd,eAAe,GACf,sBAAsB,CAAC;AAE3B,MAAM,WAAW,kBAAkB;IACjC,OAAO,EAAE,OAAO,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,CAAC,EAAE,eAAe,CAAC;IACzB,gBAAgB,CAAC,EAAE,MAAM,EAAE,CAAC;IAC5B,cAAc,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;CAC7B;AAMD,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,OAAO,CAAC,OAAO,CAAC,CAAC;CAC/D;AAED,MAAM,WAAW,YAAY;IAC3B,CAAC,QAAQ,EAAE,MAAM,GAAG,cAAc,CAAC;CACpC"}

package/dist/types/index.js

@@ -0,0 +1,5 @@
+// ============================================
+// Sequential Thinking Types (The Brain)
+// ============================================
+export {};
+//# sourceMappingURL=index.js.map

package/dist/types/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/types/index.ts"],"names":[],"mappings":"AAAA,+CAA+C;AAC/C,wCAAwC;AACxC,+CAA+C"}

package/dist/utils/dag.d.ts

@@ -0,0 +1,39 @@
+import type { ExecutionPlan } from '../types/index.js';
+/**
+ * DAG (Directed Acyclic Graph) Utilities
+ * Provides topological sorting and parallel layer detection for task orchestration
+ */
+export interface DAGValidationResult {
+    isValid: boolean;
+    errors: string[];
+    hasCycle: boolean;
+    missingDependencies: string[];
+}
+export interface TopologicalResult {
+    isValid: boolean;
+    order: string[];
+    layers: string[][];
+    errors: string[];
+}
+/**
+ * Validates a DAG for cycles and missing dependencies
+ */
+export declare function validateDAG(plan: ExecutionPlan): DAGValidationResult;
+/**
+ * Performs topological sort and groups tasks into parallel execution layers
+ * Uses Kahn's algorithm for layered topological sort
+ */
+export declare function topologicalSortWithLayers(plan: ExecutionPlan): TopologicalResult;
+/**
+ * Gets the maximum parallelism possible for a plan
+ */
+export declare function getMaxParallelism(plan: ExecutionPlan): number;
+/**
+ * Calculates critical path (longest execution path)
+ */
+export declare function getCriticalPath(plan: ExecutionPlan): string[];
+/**
+ * Visualizes the DAG as ASCII art
+ */
+export declare function visualizeDAG(plan: ExecutionPlan): string;
+//# sourceMappingURL=dag.d.ts.map

package/dist/utils/dag.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dag.d.ts","sourceRoot":"","sources":["../../src/utils/dag.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAY,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAEjE;;;GAGG;AAEH,MAAM,WAAW,mBAAmB;IAClC,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,QAAQ,EAAE,OAAO,CAAC;IAClB,mBAAmB,EAAE,MAAM,EAAE,CAAC;CAC/B;AAED,MAAM,WAAW,iBAAiB;IAChC,OAAO,EAAE,OAAO,CAAC;IACjB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;IACnB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,aAAa,GAAG,mBAAmB,CA8BpE;AAuED;;;GAGG;AACH,wBAAgB,yBAAyB,CAAC,IAAI,EAAE,aAAa,GAAG,iBAAiB,CAkFhF;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,aAAa,GAAG,MAAM,CAK7D;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,aAAa,GAAG,MAAM,EAAE,CAwC7D;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,aAAa,GAAG,MAAM,CAkCxD"}

package/dist/utils/dag.js

@@ -0,0 +1,241 @@
+/**
+ * Validates a DAG for cycles and missing dependencies
+ */
+export function validateDAG(plan) {
+    const errors = [];
+    const taskIds = new Set(plan.tasks.map(t => t.id));
+    const missingDependencies = [];
+    // Check for missing dependencies
+    for (const task of plan.tasks) {
+        for (const dep of task.dependencies) {
+            if (!taskIds.has(dep)) {
+                missingDependencies.push(`Task "${task.id}" depends on non-existent task "${dep}"`);
+            }
+        }
+    }
+    if (missingDependencies.length > 0) {
+        errors.push(...missingDependencies);
+    }
+    // Check for cycles using DFS
+    const hasCycle = detectCycle(plan.tasks);
+    if (hasCycle) {
+        errors.push('Circular dependency detected in task graph');
+    }
+    return {
+        isValid: errors.length === 0,
+        errors,
+        hasCycle,
+        missingDependencies
+    };
+}
+/**
+ * Detects cycles in the task graph using DFS with coloring
+ */
+function detectCycle(tasks) {
+    const WHITE = 0; // Not visited
+    const GRAY = 1; // Currently visiting (in recursion stack)
+    const BLACK = 2; // Completely visited
+    const color = new Map();
+    const adjacency = buildAdjacencyList(tasks);
+    // Initialize all nodes as white
+    for (const task of tasks) {
+        color.set(task.id, WHITE);
+    }
+    function dfs(nodeId) {
+        color.set(nodeId, GRAY);
+        const neighbors = adjacency.get(nodeId) || [];
+        for (const neighbor of neighbors) {
+            if (color.get(neighbor) === GRAY) {
+                // Found a back edge - cycle exists
+                return true;
+            }
+            if (color.get(neighbor) === WHITE && dfs(neighbor)) {
+                return true;
+            }
+        }
+        color.set(nodeId, BLACK);
+        return false;
+    }
+    // Check all nodes (handles disconnected components)
+    for (const task of tasks) {
+        if (color.get(task.id) === WHITE) {
+            if (dfs(task.id)) {
+                return true;
+            }
+        }
+    }
+    return false;
+}
+/**
+ * Builds adjacency list from tasks (task -> tasks that depend on it)
+ */
+function buildAdjacencyList(tasks) {
+    const adjacency = new Map();
+    // Initialize empty arrays for all tasks
+    for (const task of tasks) {
+        adjacency.set(task.id, []);
+    }
+    // Build reverse adjacency (which tasks depend on which)
+    for (const task of tasks) {
+        for (const dep of task.dependencies) {
+            const dependents = adjacency.get(dep) || [];
+            dependents.push(task.id);
+            adjacency.set(dep, dependents);
+        }
+    }
+    return adjacency;
+}
+/**
+ * Performs topological sort and groups tasks into parallel execution layers
+ * Uses Kahn's algorithm for layered topological sort
+ */
+export function topologicalSortWithLayers(plan) {
+    const validation = validateDAG(plan);
+    if (!validation.isValid) {
+        return {
+            isValid: false,
+            order: [],
+            layers: [],
+            errors: validation.errors
+        };
+    }
+    const tasks = plan.tasks;
+    const taskMap = new Map(tasks.map(t => [t.id, t]));
+    // Calculate in-degree for each task
+    const inDegree = new Map();
+    for (const task of tasks) {
+        inDegree.set(task.id, task.dependencies.length);
+    }
+    // Build reverse adjacency (task -> tasks that depend on it)
+    const dependents = new Map();
+    for (const task of tasks) {
+        dependents.set(task.id, []);
+    }
+    for (const task of tasks) {
+        for (const dep of task.dependencies) {
+            dependents.get(dep).push(task.id);
+        }
+    }
+    const layers = [];
+    const order = [];
+    const processed = new Set();
+    // Start with tasks that have no dependencies (in-degree = 0)
+    let currentLayer = tasks
+        .filter(t => t.dependencies.length === 0)
+        .map(t => t.id);
+    while (currentLayer.length > 0) {
+        // Sort for deterministic ordering
+        currentLayer.sort();
+        layers.push([...currentLayer]);
+        order.push(...currentLayer);
+        const nextLayer = [];
+        for (const taskId of currentLayer) {
+            processed.add(taskId);
+            // Reduce in-degree for all dependent tasks
+            for (const dependentId of dependents.get(taskId) || []) {
+                const newInDegree = inDegree.get(dependentId) - 1;
+                inDegree.set(dependentId, newInDegree);
+                // If all dependencies are satisfied, add to next layer
+                if (newInDegree === 0 && !processed.has(dependentId)) {
+                    nextLayer.push(dependentId);
+                }
+            }
+        }
+        currentLayer = nextLayer;
+    }
+    // Verify all tasks were processed
+    if (order.length !== tasks.length) {
+        return {
+            isValid: false,
+            order: [],
+            layers: [],
+            errors: ['Not all tasks could be processed - possible cycle or invalid graph']
+        };
+    }
+    return {
+        isValid: true,
+        order,
+        layers,
+        errors: []
+    };
+}
+/**
+ * Gets the maximum parallelism possible for a plan
+ */
+export function getMaxParallelism(plan) {
+    const result = topologicalSortWithLayers(plan);
+    if (!result.isValid)
+        return 0;
+    return Math.max(...result.layers.map(layer => layer.length));
+}
+/**
+ * Calculates critical path (longest execution path)
+ */
+export function getCriticalPath(plan) {
+    const result = topologicalSortWithLayers(plan);
+    if (!result.isValid)
+        return [];
+    const taskMap = new Map(plan.tasks.map(t => [t.id, t]));
+    const longestPath = new Map();
+    // Initialize: tasks with no dependencies have path of just themselves
+    for (const task of plan.tasks) {
+        if (task.dependencies.length === 0) {
+            longestPath.set(task.id, [task.id]);
+        }
+    }
+    // Process in topological order
+    for (const taskId of result.order) {
+        const task = taskMap.get(taskId);
+        if (task.dependencies.length > 0) {
+            // Find the longest path among dependencies
+            let maxPath = [];
+            for (const depId of task.dependencies) {
+                const depPath = longestPath.get(depId) || [];
+                if (depPath.length > maxPath.length) {
+                    maxPath = depPath;
+                }
+            }
+            longestPath.set(taskId, [...maxPath, taskId]);
+        }
+    }
+    // Find the overall longest path
+    let criticalPath = [];
+    for (const path of longestPath.values()) {
+        if (path.length > criticalPath.length) {
+            criticalPath = path;
+        }
+    }
+    return criticalPath;
+}
+/**
+ * Visualizes the DAG as ASCII art
+ */
+export function visualizeDAG(plan) {
+    const result = topologicalSortWithLayers(plan);
+    if (!result.isValid) {
+        return `Invalid DAG: ${result.errors.join(', ')}`;
+    }
+    const taskMap = new Map(plan.tasks.map(t => [t.id, t]));
+    const lines = [];
+    lines.push('┌─────────────────────────────────────────────────┐');
+    lines.push('│           DAG Execution Visualization           │');
+    lines.push('├─────────────────────────────────────────────────┤');
+    for (let i = 0; i < result.layers.length; i++) {
+        const layer = result.layers[i];
+        lines.push(`│ Layer ${i + 1} (Parallel):                              │`);
+        for (const taskId of layer) {
+            const task = taskMap.get(taskId);
+            const deps = task.dependencies.length > 0
+                ? ` ← [${task.dependencies.join(', ')}]`
+                : ' (no deps)';
+            const line = `│   ├── ${task.name}${deps}`;
+            lines.push(line.padEnd(50) + '│');
+        }
+        if (i < result.layers.length - 1) {
+            lines.push('│         ↓                                       │');
+        }
+    }
+    lines.push('└─────────────────────────────────────────────────┘');
+    return lines.join('\n');
+}
+//# sourceMappingURL=dag.js.map

package/dist/utils/dag.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dag.js","sourceRoot":"","sources":["../../src/utils/dag.ts"],"names":[],"mappings":"AAqBA;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,IAAmB;IAC7C,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnD,MAAM,mBAAmB,GAAa,EAAE,CAAC;IAEzC,iCAAiC;IACjC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACpC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtB,mBAAmB,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,EAAE,mCAAmC,GAAG,GAAG,CAAC,CAAC;YACtF,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,mBAAmB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACnC,MAAM,CAAC,IAAI,CAAC,GAAG,mBAAmB,CAAC,CAAC;IACtC,CAAC;IAED,6BAA6B;IAC7B,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzC,IAAI,QAAQ,EAAE,CAAC;QACb,MAAM,CAAC,IAAI,CAAC,4CAA4C,CAAC,CAAC;IAC5D,CAAC;IAED,OAAO;QACL,OAAO,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC;QAC5B,MAAM;QACN,QAAQ;QACR,mBAAmB;KACpB,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,WAAW,CAAC,KAAiB;IACpC,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,cAAc;IAC/B,MAAM,IAAI,GAAG,CAAC,CAAC,CAAE,0CAA0C;IAC3D,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,qBAAqB;IAEtC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,SAAS,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;IAE5C,gCAAgC;IAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED,SAAS,GAAG,CAAC,MAAc;QACzB,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAExB,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAC9C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,IAAI,EAAE,CAAC;gBACjC,mCAAmC;gBACnC,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,KAAK,IAAI,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACnD,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QAED,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACzB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,oDAAoD;IACpD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,KAAK,EAAE,CAAC;YACjC,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBACjB,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAAC,KAAiB;IAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE9C,wCAAwC;IACxC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED,wDAAwD;IACxD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACpC,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YAC5C,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACzB,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,yBAAyB,CAAC,IAAmB;IAC3D,MAAM,UAAU,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IACrC,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;QACxB,OAAO;YACL,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,EAAE;YACT,MAAM,EAAE,EAAE;YACV,MAAM,EAAE,UAAU,CAAC,MAAM;SAC1B,CAAC;IACJ,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;IACzB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnD,oCAAoC;IACpC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;IAClD,CAAC;IAED,4DAA4D;IAC5D,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC9B,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACpC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IAEpC,6DAA6D;IAC7D,IAAI,YAAY,GAAG,KAAK;SACrB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,CAAC;SACxC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAElB,OAAO,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/B,kCAAkC;QAClC,YAAY,CAAC,IAAI,EAAE,CAAC;QACpB,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;QAC/B,KAAK,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC;QAE5B,MAAM,SAAS,GAAa,EAAE,CAAC;QAE/B,KAAK,MAAM,MAAM,IAAI,YAAY,EAAE,CAAC;YAClC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAEtB,2CAA2C;YAC3C,KAAK,MAAM,WAAW,IAAI,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBACvD,MAAM,WAAW,GAAG,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAE,GAAG,CAAC,CAAC;gBACnD,QAAQ,CAAC,GAAG,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;gBAEvC,uDAAuD;gBACvD,IAAI,WAAW,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;oBACrD,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBAC9B,CAAC;YACH,CAAC;QACH,CAAC;QAED,YAAY,GAAG,SAAS,CAAC;IAC3B,CAAC;IAED,kCAAkC;IAClC,IAAI,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;QAClC,OAAO;YACL,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,EAAE;YACT,MAAM,EAAE,EAAE;YACV,MAAM,EAAE,CAAC,oEAAoE,CAAC;SAC/E,CAAC;IACJ,CAAC;IAED,OAAO;QACL,OAAO,EAAE,IAAI;QACb,KAAK;QACL,MAAM;QACN,MAAM,EAAE,EAAE;KACX,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAmB;IACnD,MAAM,MAAM,GAAG,yBAAyB,CAAC,IAAI,CAAC,CAAC;IAC/C,IAAI,CAAC,MAAM,CAAC,OAAO;QAAE,OAAO,CAAC,CAAC;IAE9B,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;AAC/D,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,IAAmB;IACjD,MAAM,MAAM,GAAG,yBAAyB,CAAC,IAAI,CAAC,CAAC;IAC/C,IAAI,CAAC,MAAM,CAAC,OAAO;QAAE,OAAO,EAAE,CAAC;IAE/B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAoB,CAAC;IAEhD,sEAAsE;IACtE,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;IAED,+BAA+B;IAC/B,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;QAElC,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACjC,2CAA2C;YAC3C,IAAI,OAAO,GAAa,EAAE,CAAC;YAC3B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACtC,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;gBAC7C,IAAI,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;oBACpC,OAAO,GAAG,OAAO,CAAC;gBACpB,CAAC;YACH,CAAC;YACD,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;IAED,gCAAgC;IAChC,IAAI,YAAY,GAAa,EAAE,CAAC;IAChC,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC;QACxC,IAAI,IAAI,CAAC,MAAM,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;YACtC,YAAY,GAAG,IAAI,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO,YAAY,CAAC;AACtB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,IAAmB;IAC9C,MAAM,MAAM,GAAG,yBAAyB,CAAC,IAAI,CAAC,CAAC;IAC/C,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACpB,OAAO,gBAAgB,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;IACpD,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,CAAC,IAAI,CAAC,qDAAqD,CAAC,CAAC;IAClE,KAAK,CAAC,IAAI,CAAC,qDAAqD,CAAC,CAAC;IAClE,KAAK,CAAC,IAAI,CAAC,qDAAqD,CAAC,CAAC;IAElE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,6CAA6C,CAAC,CAAC;QAE1E,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;YAClC,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC;gBACvC,CAAC,CAAC,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;gBACxC,CAAC,CAAC,YAAY,CAAC;YACjB,MAAM,IAAI,GAAG,WAAW,IAAI,CAAC,IAAI,GAAG,IAAI,EAAE,CAAC;YAC3C,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC;QACpC,CAAC;QAED,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACjC,KAAK,CAAC,IAAI,CAAC,qDAAqD,CAAC,CAAC;QACpE,CAAC;IACH,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,qDAAqD,CAAC,CAAC;IAElE,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}

package/package.json

@@ -0,0 +1,45 @@
+{
+  "name": "@gotza02/mathinking",
+  "version": "1.0.0",
+  "description": "MCP Server with sequential thinking (The Brain) and orchestrator (The Body) capabilities",
+  "type": "module",
+  "main": "dist/index.js",
+  "bin": {
+    "mathinking": "./dist/index.js"
+  },
+  "files": [
+    "dist"
+  ],
+  "publishConfig": {
+    "access": "public"
+  },
+  "scripts": {
+    "build": "tsc",
+    "postbuild": "sed -i '1i #!/usr/bin/env node' dist/index.js",
+    "start": "node dist/index.js",
+    "dev": "tsx src/index.ts",
+    "watch": "tsc --watch",
+    "test": "tsx src/test-all.ts"
+  },
+  "keywords": [
+    "mcp",
+    "agent",
+    "orchestration",
+    "thinking",
+    "reasoning"
+  ],
+  "license": "MIT",
+  "dependencies": {
+    "@modelcontextprotocol/sdk": "^1.0.0",
+    "uuid": "^9.0.0"
+  },
+  "devDependencies": {
+    "@types/node": "^20.10.0",
+    "@types/uuid": "^9.0.0",
+    "tsx": "^4.7.0",
+    "typescript": "^5.3.0"
+  },
+  "engines": {
+    "node": ">=18.0.0"
+  }
+}