No design phase. Each agent gets a real production library and one instruction: use it, and write as little code as possible.

ModelScore ± 95% CI$ / problem
Opus 5.5mini-SWE
66.9 ± 7.1
$0.664
Sonnet 5.5mini-SWE
63.8 ± 7.0
$0.374
GPT-6 Solmini-SWE
57.6 ± 6.0
$0.237
Opus 5mini-SWE
55.1 ± 6.7
$1.314
DeepSeek V4.1 Flashmini-SWE
43.8 ± 5.3
$0.190
GPT-5.6 Terramini-SWE
40.0 ± 6.6
$0.239
Sonnet 5mini-SWE
39.9 ± 6.8
$0.919
GLM 5.3 Flashmini-SWE
35.0 ± 5.2
$0.192
DeepSeek V4 Flashmini-SWE
34.8 ± 6.4
$0.286
GPT-6 Lunamini-SWE
33.5 ± 7.5
$0.007
GPT-5.6 Lunamini-SWE
30.1 ± 5.8
$0.042

Scores run 0–100: pass rate² × simplicity, averaged over every problem, with problems weighted equally. Error bars and ± show the 95% confidence interval, clustered by task (how it is computed).

How are the confidence intervals computed?

A model's score is its mean over all 242 problems. Each problem counts once: its three runs are averaged first, and a run that did not finish scores 0.

The problems of one task all use the same production library, so a model that handles that library well tends to do well on all of them. Their scores are not independent, and treating them as if they were would make the intervals look far narrower than the data supports. The standard error is therefore clustered by task (15 clusters), following Miller (2024), "Adding Error Bars to Evals":

SE = √( G/(G−1) · Σ_task ( Σ_problem in task (score − mean) )² ) / n

where G is the number of tasks and n the number of problems. The ± shown is 1.96 × SE. The interval says how much the score could move on other tasks like these, not only on reruns of the same ones.

Paired differences use the same clustering on each problem's difference between two models. Both models solve the same problems, so the difficulty they share cancels, and a difference can be clear even when the two leaderboard intervals overlap.