benchmark-optimization-loop
/benchmark-optimization-loop
Use when the user asks to make something faster, try many variants, run recursive optimization, benchmark latency/throughput/cost, or choose the best implementation by repeated measured tests.
- Author
- ysyecust ↗
- Repository
- everything-claude-code ↗
- Licence
- MIT
- Last repository change
- 06.07.2026
Assessment and security
- Files in this package
- 1
- Scripts
- 0
- HTML comments
- 0
- URLs in SKILL.md
- 0
No signals detected. Repository changed on 06.07.2026, without references to retired models or APIs.
MIT, open: use and modify while retaining author attribution.
What it does and when to use it
Use when the user asks to make something faster, try many variants, run recursive optimization, benchmark latency/throughput/cost, or choose the best implementation by repeated measured tests.
Original author description
Use when the user asks to make something faster, try many variants, run recursive optimization, benchmark latency/throughput/cost, or choose the best implementation by repeated measured tests.
How it works
- Required Baseline
- Loop
- Variant Table
- Recursive Search
- Promotion Gate
SKILL.md preview
--- name: benchmark-optimization-loop description: Use when the user asks to make something faster, try many variants, run recursive optimization, benchmark latency/throughput/cost, or choose the best implementation by repeated measured tests. metadata: origin: ECC tools: Read, Write, Edit, Bash, Grep, Glob --- # Benchmark Optimization Loop Use this skill to convert "make it 20x faster" or "try 50 recursive optimizations" into a bounded measured loop that can actually improve a system. ## Required Baseline Do not optimize until these exist: - the operation being optimized; - the correctness gate that must stay green; - the metric: wall time, p95 latency, rows/sec, cost/run, memory, error rate; - the current baseline; - the search budget: max variants, max time, max spend, max data impact. If the user asks for an unrealistic target, keep the ambition but make the loop bounded and measurable. ## Loop 1. Measure the baseline. 2. Identify bottlenecks from evidence. 3. Generate variants that test one hypothesis each. 4. Run variants with the same input shape. 5. Reject variants that fail correctness, safety, or reproducibility. 6. Promote the fastest safe variant. 7. Codify the winning path in a script, command, test, config, or doc. 8. Rerun the baseline and winner to confirm the delta. ## Variant Table Track variants like this: ```text Variant | Hypothesis | Command | Time | Correct? | Notes baseline | current path | npm run job | 120s | yes | stable batch-500 | fewer round trips | npm run job -- --batch 500 | 42s | yes | winner parallel-8 | more workers | npm run job -- --workers 8 | 31s | no | rate limited ``` ## Recursive Search For recursive or hyperparameter work: - persist every run to a ledger; - compare against the prior accepted winner, not only the previous run; - keep a holdout or replay check; - stop when improvement is within noise, correctness fails, cost exceeds the budget, or the search starts changing more variables than it can explain. Use phrases like "best measured safe variant" instead of "global optimum" unless the search space was actually exhaustive. ## Promotion Gate A variant cannot become the new default until: - correctness tests pass; - the performance delta is repeated or explained; - rollback is obvious; - the change is encoded in source control or a durable runbook; - the final summary includes exact commands and measurements.
Versions
| Repository | Score | Licence |
|---|---|---|
| This page · ysyecust/everything-claude-code | 100 | MIT |
| pekral/cursor-rules | 100 | MIT |
Database snapshot: 13.11.2026 · package version 837410c254f6 (SHA-256 digest of the entire package)
Downloads in the last 30 days: 0 · ranking
Report a problem with this skill: harmful content, incorrect descriptions or an author’s removal request.
Similar skills
- 100perf-loop
Profile and optimize a metric under its budget in a disciplined profile-optimize-reprofile loop: benchmark the whole measured set under a fixed environment, find the single highest-leverage hotspot or regression, optimize one thing, re-benchmark the WHOLE set, and repeat until… - 100autoresearch
Autonomous experiment loop: edit code, commit, run benchmark, extract metrics, keep improvements or revert, repeat forever. Use this skill when the user asks to "run autoresearch", "start an experiment loop", "optimize a metric autonomously", "autonomous experiments", "benchmark… - 90performance:benchmark
Use when timing a program or command, asking whether a change or version made it faster, or building a benchmark harness. For repeated optimization toward a target, use performance:hill-climb. - 100benchmark
Run a bench target (median of 5+ runs), capture the result, and record it in plan/optimization_log.md. Use when benchmarking without a full optimization loop, or to establish a baseline before starting /optimize. - 90bench-profile
Design a performance benchmark for an API — test scenarios, metrics, and tooling. Use when asked to "benchmark this API", "design a load test", or "measure throughput". - 100perf
The general profile-driven perf loop for any language or runtime: baseline, profile, fix the real hot path, re-measure. Use for /perf, "this is slow", or optimization work.