Explainer
Loops vs graphs
In July 2026 Peter Steinberger poked the field with one line: “are we still talking loops, or did we shift to graphs yet?” It read as a verdict. It wasn’t. It was a question, and the answer is a test you can run on any agent you build.
A loop is one agent iterating on its own judgment until it’s done. A graph cuts that work into fixed nodes joined by gated edges. Escalate only to buy a gate, determinism, or a real handoff.
1The two shapes
These are not “old vs new.” A loop is a cycle; a graph is a fixed path with checkpoints. The defining difference isn’t how many agents there are. It’s who decides what happens next: the model’s own judgment (loop), or a structure you wired in advance (graph).
The crux node is the loop’s problem: it grades its own work. The gate is the only thing a graph gives you that a loop can’t: an edge the flow is forced through. Everything else a graph “adds”, more steps and more prompts, a loop already has.
2When a graph earns its place
There are exactly three honest reasons to break a loop into a graph. If none apply, you’re adding latency and rigidity for tidiness.
Try to fold every node back into one agent’s loop. If you can and lose nothing — no gate goes unenforced, no determinism disappears, no real tool/model split collapses — it was never a graph. It was a loop wearing a diagram, and you paid latency for the costume.
Rule of thumb: if five nodes collapse back into one loop and nothing is lost, you should collapse them. Master the loop first. Reach for a graph only when the work forces your hand.
3Check yourself
Six questions. The answer appears when you pick one.