LazyAgent Refuses Unrelated Agent Work Before It Starts, Cutting 42% of CPU on Production Workflows

arXiv·medium signalXBlueskyLinkedInCopy link

LazyAgent (arXiv 2609.23058, 19 Sep 2026) replaces the usual plan-then-execute-when-ready runtime with a live, goal-derived demanded set: a backward closure from requested outputs is refreshed as state changes, and a ready node materializes only when the active goal needs it, turning repeated local judgments into one linear-time graph analysis plus constant-time membership tests. Adding one unrelated product raised the eager baseline's bill by 22.5% and LazyAgent's by 0.0%. It saves 42.0% of measured CPU on production scientific workflows and 51.7% of container time on a live release gate spanning four repositories, with proven exact equivalence when the request reaches the whole graph.