EXECUTABLE EXERCISE
Run a register-machine loop
Inspect a counter initialized to three, predict its route, validate the bounded Register Machine Profile, run it on Ravenroot and compare the completed payload with counter: "0" and isZero: true.
Teach with explicit graphs
Predict. Execute. Compare evidence.
Use a small, bounded graph to teach state, branching, loops and the difference between inspection and runtime execution. The exercise targets the current 0.7.0-alpha.1 source line.
CLASSROOM CHECKLIST
Predict, inspect, then verify
Before running, write down what should happen to counter: "3". Find the decrement and zero-test branches in the graph. Run the exercise and compare the completed payload with your prediction. The drawing helps you reason about the route; the completed response shows what ran.
Continue
Move from lesson to source-backed reference.
The public repository contains the exercise GraphML, exact input and result, troubleshooting steps and the runtime limitations learners must preserve.