● primitive — live in /api/v1/agent/kernelcpm / pertdeterministic · fail-closedno ml
The critpath kernel.
Given a task graph (nodes with durations + directed dependency edges), the kernel emits the canonical schedule: ES/EF/LS/LF per task, total float, the critical path, project duration, and max parallel width across time. Standard CPM/PERT math — DuPont/Kelley-Walker 1957, Kahn 1962. The LLM names the tasks and dependencies; the kernel proves the graph is acyclic and computes the schedule.
Try it · live
–
–
Schedule (topo order)
Gantt — critical path highlighted
Input graph
Output
What's the critical path? The longest chain of dependent tasks — pushing any task on it delays the whole project by the same amount. Float is how much slack each non-critical task has before it becomes critical. Max parallel width is the most concurrent work-streams scheduled at any moment under earliest-start scheduling — your minimum capacity. EcoCloud computes — it assigns no work, books no calendars, and contacts no external system. The LLM decomposes the feature; the kernel governs the resulting graph and emits the canonical schedule. view source · all kernels · → simulate