What problem does it solve?
Autonomous, iterative improvement by mutating a single target and evaluating results with a fixed scoring function to guide progressive refinements.
Core Features & Use Cases
- Single mutable surface: only one file (or narrow set) can change per experiment to keep changes traceable.
- Immutable evaluation harness: the evaluator never changes during the loop to preserve comparability.
- Composite scoring and git-based ledger: a scoring function guides decisions and every experiment is committed or rolled back to maintain a complete history.
- Autonomous loop: iterations proceed without human approval, with scoring as the sole acceptance criterion.
- Use cases: optimize code quality, prompt templates, or configuration parameters with measurable scores.
Quick Start
Start the autoresearch loop by selecting a target file, an eval command that returns a numeric score, and a parse rule to extract the score; then run the loop to begin automated experimentation.