autoresearch-loop

Iteratively optimize one instruction atom against a frozen evaluation suite with KEEP/REVERT ratcheting.

Updated Aug 2, 2026
One-click install
npx skills add https://github.com/leonardoacosta/skills --skill autoresearch-loop-leonardoacosta
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: autoresearch-loop
Source: https://github.com/leonardoacosta/skills/tree/main/meta/skills/autoresearch-loop
Command: npx skills add https://github.com/leonardoacosta/skills --skill autoresearch-loop-leonardoacosta

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill includes references (resource) components.

What problem does it solve? Improving prompt or instruction prose is usually ad hoc: edits pile up without measurement, regressions go unnoticed, and there is no way to restore a known-good version. This Skill turns instruction improvement into a bounded, auditable experiment loop where every candidate is measured against a frozen evaluation suite and only kept when it genuinely improves. ## Core Features & Use Cases - Bounded atom selection: Classifies targets as deterministic code (routed to ordinary tests), bounded instruction atoms (eligible), or multi-atom orchestration (refused), so experimentation never becomes an unbounded rewrite. - Frozen evaluation oracle: Freezes the suite identity and digest before mutation, measures a baseline, and decides KEEP or REVERT per candidate using declared metrics, non-regression rules, and budget gates. - Auditable ratchet with restoration: Persists an audit row for every candidate, restores exact last-KEEP bytes after REVERT, enforces time/iteration/token/cost/diff budgets, stops on plateau, and requires human review before integration. - Use Case: You want to improve one paragraph of a review prompt. The loop freezes your eval suite, tries one bounded candidate at a time, keeps only measured improvements, reverts regressions automatically, and hands the cumulative diff to a human for final approval. ## Quick Start Use the autoresearch-loop skill to iteratively improve this instruction paragraph against my frozen evaluation suite with a KEEP/REVERT ratchet and a five-iteration budget.

Frequently Asked Questions about autoresearch-loop

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I iteratively improve a prompt with measurable results?

Freeze an evaluation suite with a stable digest, measure the unmodified instruction as baseline, then test one bounded candidate at a time. Each candidate is classified KEEP or REVERT by the declared metric and non-regression rule, and only KEEPs advance the baseline.

What is a KEEP/REVERT ratchet in prompt optimization?

A KEEP/REVERT ratchet compares every candidate against the last accepted version using frozen suite measurements. KEEP advances the baseline to the improved candidate; REVERT restores the exact last KEEP bytes, so regressions never accumulate and recovery never depends on chat history.

When should I use ordinary tests instead of an autoresearch loop?

Route deterministic behavior such as code, schemas, and mechanically provable logic to ordinary deterministic tests. The autoresearch loop is only for bounded instruction prose where behavior must be measured by an evaluation suite rather than proven mechanically.

Can I refresh research or edit the evaluation suite mid-run?

No. The suite, descriptor, and any research identifiers are immutable after the first candidate mutation. Refreshed evidence or suite repairs require ending the current run, preparing new frozen inputs, and starting a new run with a new baseline.

What happens when the optimization run hits a plateau or budget limit?

The run stops truthfully with a plateau or budget-exhausted outcome and preserves the full audit trail. A human then reviews the cumulative diff, suite, consumed budgets, and stop reason before any KEEPs are integrated into the target branch.