Start here
Loop Engineering, in plain language
Bounded state machines, termination contracts, recovery, idempotency, budgets, no-progress detection, and replayable agent loops. Loop engineering turns repeated model decisions into a bounded, recoverable, observable transition system with explicit terminal behavior.
For a small example, a research task can search until it finds one cited answer. Represent running, succeeded, failed, and exhausted states; decrement a call budget; verify the citation before finishing. This is the mechanism to keep in view as the lesson becomes more technical. Before moving on, identify the input, transformation, output, and one observation that would falsify your conclusion.
Key points
- Typed state, actions, observations, and terminal reasons.
- Deterministic workflow versus model decision boundaries.
- Success, failure, cancellation, and deadline semantics.