A single Rust binary that runs coding agents as always-on background terminals: panes report working, blocked or idle, agents drive each other through a CLI and socket API, and sessions survive restarts.
The hard problem in multi-agent systems is not making one agent smarter, but deciding how work itself should move. This long-form guide introduces Graph Engineering: use the dependency test to expose fake dependencies, measure latency by critical path instead of total steps, compress deterministically before reasoning, give verifiers a falsification objective, model human approval as an edge rather than a node, freeze rules that sit outside optimization, and adopt five canonical graph shapes plus a paste-ready graph spec template — along with clear criteria for when NOT to build a graph at all.
BLOG
