What Is Loop Engineering?
8 entriesLoop engineering is the design of the repeated cycle a single agent runs: gather context, plan, act with tools, verify, and repeat until a stop condition is met. Its core idea is to loop on evidence, such as passing tests or a validated citation, rather than on the agent's own claim that it is done. The verifier and the stop rules are usually the hard part.
What Is Graph Engineering?
14 entriesGraph engineering makes the workflow structure explicit. Steps are nodes, transitions are edges, and shared state flows between them, with branching, parallel fan-out and fan-in, retries, human approval points and durable checkpoints defined up front. Each node can itself be a loop, so graphs wrap loops rather than replace them.
Loop vs Graph: How They Compare
5 entriesA loop is flexible and quick to build: the model decides each next step, which suits open-ended tasks with few tools, but control, cost and debugging get harder as scope grows. A graph trades upfront design for bounded paths, per-step prompts and models, parallelism, auditability, durable state and approval gates, at the cost of more prompts, a state schema and new failure modes. Most tasks are one well-scoped loop; move to a graph when work splits into specialties, needs parallel-then-join, or must be auditable.
Making Either Reliable
9 entriesDurable execution, observability and open protocols for production agents.
Foundational Papers
4 entriesReasoning and multi-agent research.
Related Pages
10 entriesNeighbouring pages on this site.
Frequently Asked Questions
What is loop engineering?
Designing the cycle a single agent runs — context, plan, act, verify, repeat — including the evidence it checks and the rules that stop it.
What is graph engineering?
Making an agent workflow an explicit graph of nodes, edges and shared state, with branching, parallelism, retries, approvals and durable checkpoints. Each node is often itself an agent loop.
Should I use a loop or a graph?
Start with one well-built loop. Move to a graph when the task splits into specialist steps, needs parallel work followed by a join, uses different models or tools per step, or must be auditable and resumable.
Do graphs replace loops?
No. A loop is a single node in a graph, so graphs wrap loops. Poor loops make poor graphs, and a perfect graph cannot fix a weak harness or a weak verifier.
How current is this page?
Links were checked in October 2026. The terms “loop engineering” and “graph engineering” are informal and emerging, so definitions vary by author.