Goal: optimize sort.py so sorting 1,000,000 integers runs below 0.5 seconds while preserving correctness.
| Field | Value |
|---|---|
| Metric | Median runtime in seconds (median_time_s, minimize) |
| Evaluator | python benchmark.py |
| Baseline | 2.117478s |
| Best result | 0.150459s |
| Iterations logged | 8 |
| Visual result | results.png |
This example demonstrates the standard autoresearch artifact bundle:
research.md: goal, constraints, search space, and iteration historyresearch_log.md: detailed hypothesis/evaluation notesautoresearch-results.tsv: machine-readable metric traceresults.png: visual summary of runtime improvement and best-so-far curvefinal_report.md: summary of the best implementation and failed alternatives
From this directory:
python benchmark.pyThe evaluator emits the mechanical contract used by the skill:
{"pass": true, "score": -0.150459}For minimize metrics, score is the negated metric value so higher scores are always better.