LLM Engineering Leaderboard
FULL RESULT MATRIX
All eleven boards, cell for cell
The complete harness × model matrix for the eleven LLM infrastructure and training-stack environments, copied from the result appendix with no rewriting. Rows are harnesses; columns are the six foundation models. Every environment keeps its own metric and its own table — nothing is merged and nothing is averaged across environments.
Claude Code only runs Opus-4.8 and Codex CLI only runs GPT-5.6-sol — by design, not a missing run. Row order is fixed to the appendix order and never sorted, so one harness can be read across environments.
TRACES is built and operated by Apodex, which also submits its own solvers. Apodex entries are marked.
LLM solver (harness × model)
Single-model harness (Claude Code / Codex CLI)
ApodexHarness (in-house)
published SOTA / method baseline (ref)
best in column
OUTCOME MARKERS
Refused
safety or content-policy refusal
Fault
harness bug, API, compatibility or quota fault
Gate not met
a hard gate was missed (loss, speed, throughput, no-regression) or training failed
Not submitted
nothing submitted, or not submitted to protocol
Timed out
budget exhausted; nothing submitted inside the limit
Note
a remark on the score, not a failure
Genuine
a real capability failure: the run completed and satisfied none of the required fixes
Harness artifact
no scorable submission ever reached the world
Grounding
stopped to ask the user instead of acting
Out of sweep
not in the sweep this metric was computed from
N/A
route not applicable
A number with a superscript letter (for example 0.000a) means the run happened and either scored a genuine zero or needs a note. — means the configuration was never run. A marker in place of a number means it ran and produced nothing scorable. Heat bars scale to the maximum of their own table and are comparable inside it only.
Every number above comes from the harness × model result-matrix appendix, copied cell for cell with no rewriting. — means the configuration was never run; a marker in place of a number means it ran and produced nothing scorable; a number with a superscript letter is a real score that needs a note. Scores from different environments are not comparable.
01
Pre-training corpus probe
LLM-pretrain-data-probe
Probe a pre-training corpus for its coverage and its poisoning sources using capture–recapture population estimation. Each cell is the mean of 6 episodes — arXiv / bioRxiv / medRxiv × two coverage levels. Score = population-estimate accuracy + canary-source detection + acquisition outcome + budget efficiency, behind a corpus-contamination gate.
02
nanoGPT speedrun
nanogpt-speedrun
Train nanoGPT to a target validation loss as fast as possible. A submission scores only if it clears both the loss gate and the speed gate; otherwise it is 0.
03
Pre-training data filter
pretrain-data-filter
Train a multi-head quality scorer to filter pre-training data. Score = per-dimension Pearson correlation against the reference, behind a throughput gate that zeroes the cell if missed.
04
Operator alignment detection
operator-align
Run TransformerEngine on GPU and find numerically misaligned or mismatched operators. Outcome score = pooled F1 × (0.5 + 0.5 · trigger_rate), computed jointly rather than averaged per instance, with a process score on top.
05
Internal benchmark construction
internal-benchmark
Score a submitted evaluation harness against an internal reference suite. Item difficulty is judged by a fixed held-out model, Qwen-3.5-35B. Only this single-reference setting was scored; the alternative reference-model variant and its subtasks were not run.
06
RL recipe
rl-recipe
Score a submitted reinforcement-learning recipe by its improvement over the default recipe on a held-out set. The outcome score is imputed via the HDS6 proxy (r = 0.979), then combined with anti-gaming and cost terms and normalised to 0–1.
07
Post-training data dedup
posttrain-data-dedup
Deduplicate post-training data and strip contamination against the held-out test sets. Score combines three terms: dedup F1, leak recall on decontamination, and over-deletion rate.
08
Reasoning-length controllable fine-tune
swe-juice
Fine-tune Qwen3-8B so that its reasoning length responds to a reasoning-effort knob, without losing agentic SWE ability. Score = controllability of the effort→length mapping + solve rate on hidden GitHub issues.
09
Patch correctness verdict
solution-verifier
Decide whether a candidate code-fix patch is correct, across pick instances (choose the correct candidate) and rank instances (order the candidates), drawn from OpenSWE and ACR. Score = binary accuracy of the pick and rank verdicts.
10
Inference determinism repair
llm-determinism
Locate and fix the sources of non-determinism in a pinned SGLang deployment. Scored by a hidden bit-exactness test suite, behind a no-regression hard gate that zeroes the cell the moment it is violated. Cells are not all scored the same way: an episode that reached submit gets one repair round, while one that exhausted its budget is scored once on its final state — and the two highest scores in this table are of the latter kind.
11
Rollout three-way verification
LLM-rollout-verify
Build a three-way verifier for mathematical solutions — correct, incorrect, or an ill-posed problem. The agent writes a judge_one function and the environment runs it over the whole corpus. Score = macro-F1 on a hidden held-out set, log-discounted by the output token cost per item.