Loops and Graphs: stop babysitting agents, approve only the last step
Two layers, split cleanly: a loop lives inside a node (produce, check, correct until green), a graph lives between nodes (what work exists, what runs in parallel, where results return). The argument is that a loop without a check that can actually fail is just a scheduler, and that most teams build the work first and bolt a model-based review onto the end. The graph layer gets four node types — splitter, worker, code node, gate — plus two return edges: a short correction edge that fixes the current run, and a long learning edge that feeds an accepted result back into the splitter's brief as a constraint. Gates should open by blast radius, not model confidence, with irreversible work in a lane that never opens. Written for engineers still approving every step by hand.