What problem does it solve?
It reduces the chance that a Claude Code skill produces inconsistent or low-quality outputs by running autonomous optimization loops and selecting only prompt mutations that improve strict, evidence-based pass/fail evals.
Core Features & Use Cases
- Binary eval-driven optimization: Turns user-defined yes/no criteria into an auditable scoring suite that requires quoted evidence for every decision.
- Autonomous mutation loop: Repeatedly runs the target skill across multiple test inputs, mutates the prompt using a structured taxonomy, and keeps only improvements.
- Resumable experimentation: Writes checkpoints and detailed logs (results, changelog, outputs, scores) so optimization can continue after interruptions.
- Best-suited use cases: Optimize a specific skill’s prompt, benchmark changes across versions, fix recurring failure patterns, and improve reliability on representative scenarios.
Quick Start
Use the autoresearch skill to optimize a target skill by first providing the target SKILL.md path, 3–5 test inputs, 3–6 binary eval criteria, runs per experiment (default 5), and an optional budget cap (default 20) so it can begin with a baseline run and subsequent mutations.