affaan-m/ECC

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.

68Collecting
See how to use itView GitHub source
npx skills add https://github.com/affaan-m/ECC --skill "skills/benchmark-optimization-loop"
Automated source guideGeneral workflowStandard source

Source checked Jul 28, 2026·Refresh due Oct 26, 2026

Reorganized from the pinned upstream SKILL.md

Source-grounded usage guide: 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.

npx skills add https://github.com/affaan-m/ECC --skill "skills/benchmark-optimization-loop"
Check the pinned source

The pinned source supports a structured brief, but not an expanded tutorial. Only detected inputs, outputs, and sections are shown.

316 source words · 5 usable sections

Best fit

  • 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.

Source workflow

Read benchmark-optimization-loop through these 4 source sections

Sections are extracted automatically from the pinned SKILL.md and link back to the source.

01

Required Baseline

Do not optimize until these exist:

SKILL.md · Required Baseline
the operation being optimized;the correctness gate that must stay green;the metric: wall time, p95 latency, rows/sec, cost/run, memory, error rate;
02

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…

SKILL.md · Loop
Measure the baseline.Identify bottlenecks from evidence.Generate variants that test one hypothesis each.
04

Recursive Search

For recursive or hyperparameter work:

SKILL.md · Recursive Search
persist every run to a ledger;compare against the prior accepted winner, not only the previous run;keep a holdout or replay check;

Source checklist

Verify each item before delivery

The source section “Required Baseline” has been checked.

The source section “Loop” has been checked.

The source section “Variant Table” has been checked.

The source section “Recursive Search” has been checked.

FAQ

What does the benchmark-optimization-loop source document cover?

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.

How do I install benchmark-optimization-loop?

The source record exposes this install command: npx skills add https://github.com/affaan-m/ECC --skill "skills/benchmark-optimization-loop". Inspect the command and pinned source before running it.

Repository stars
234,327
Repository forks
35,711
Quality
68/100
Source repository last pushed

Quality breakdown

Based on traceable docs and repository signals; stars are not treated as quality.

68/100
Documentation20/30
Specificity11/25
Maintenance20/20
Trust signals17/25
View original Skill.mdThis page is parsed directly from the repository SKILL.md without editorial rewriting. Collected: Jul 28, 2026 · about 2 min

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:

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.
Source repo
affaan-m/ECC
Skill path
skills/benchmark-optimization-loop/SKILL.md
Commit SHA
4e973d3eaf92
Repository license
MIT
Data collected