In the last post, I talked about ReAct-style finite-state machine (attached) that coding assistants implement under the hood such as Claude Code, Codex and Gemini.
One of the low hanging fruits that you can implement is `structured brevity` in your applications.
Which is useful in many ways:
- enables IDE adapters to render rich UIs (diff viewers, terminal panes).
- compresses tokens, every enum value is ~1 token instead of 5–15 words.
- makes post-hoc analytics trivial (count kinds per session, latency, success rate).
- ensure each vertical to ship templates tuned to local signal-to-noise
This way, you can call enforce_rules in Verify phase, and if it fails, bounce to Reflect for auto-shrink or slot repair.
In the next post, I'll cover how Claude exposes low-level todos or Gemini exposes high-level phases, and how we can used that to our advantage.