What problem does it solve?
It solves the problem of getting a better result when one execution is not enough, by running multiple full Algorithm cycles that build on prior learnings and are reviewed between iterations.
Core Features & Use Cases
- Multi-pass iterative improvement: Revisit the same target across repeated Algorithm cycles (Observe → Think → Plan → Build → Execute → Verify → Learn) until the result improves.
- Evolving evaluation criteria: Uses ISC/ISA fields so each iteration refines what “ideal” means and tracks iteration history and cumulative improvements.
- Optional autonomous mode: Supports an opt-in autoresearch loop with dead-ends tracking and confidence gating to avoid repeatedly retrying failed approaches.
Quick Start
Run iterative improvement on a specific file by invoking /loop with your target path, a clear goal for what “better” means, and a chosen number of iterations.