CodeSOTAβOriginal site ↗

CodeSOTA editorial / Living benchmark

Small enough to run.
Useful enough to choose.

A leaderboard for models with fewer than one billion parameters. Start with fresh-text loss, then test whether robust task performance predicts what people actually prefer.

First measurement, limited scope. 11 pinned models · instruct and raw-base sections · 20 recent arXiv cs.CL abstracts · 31,535 UTF-8 bytes. This academic-text pilot does not establish general usefulness, contamination immunity or human preference.

Open track / live text

Sorted by bits per UTF-8 byte (BPB), lower is better. No composite score. CodeSOTA measurement · subset · codesota-live-arxiv-2026-10-snapshot1.

System / pinned revisionParametersLive BPB ↓Scoring speed¹GPU-slot time²Evidence
Qwen/Qwen2.5-0.5B-Instruct
7ae557604adf · instruct
494.0M1.03358,237 tokens/s1.56sInspect run →
HuggingFaceTB/SmolLM2-360M-Instruct
a10cc1512eab · instruct
361.8M1.049510,340 tokens/s1.24sInspect run →
HuggingFaceTB/SmolLM2-135M-Instruct
12fd25f77366 · instruct
134.5M1.144815,482 tokens/s1.07sInspect run →

SlayerLab / raw base & adapted checkpoints

Same text-loss protocol, without instruction tuning by CodeSOTA. These are not fixed-SFT base-track results. ARC/Decision adaptation is identified per system.

System / pinned revisionParametersLive BPB ↓Scoring speed¹GPU-slot time²Evidence
SlayerLab/Slayer139-1.01
2e72c696d7c5 · base / ARC-adapted
139.3M1.120423,283 tokens/s0.96sInspect run →
SlayerLab/Slayer139-1.02
c4298d757ba3 · base / ARC-adapted
139.3M1.121623,106 tokens/s0.96sInspect run →
SlayerLab/Slayer-149M-Decision-v1
ccfd7d3d91f3 · decision-tuned
149.3M1.138119,162 tokens/s1.01sInspect run →
SlayerLab/Slayer149-Balanced-ARC-E-ft-v2
7d11e8fd6376 · base / ARC-adapted
149.3M1.140319,395 tokens/s1.01sInspect run →
SlayerLab/Slayer139-1.01b
283ffb6d620b · base / ARC-adapted
139.3M1.142723,318 tokens/s0.94sInspect run →
SlayerLab/Slayer149-ARC
0e6793ecfb85 · base / ARC-adapted
149.3M1.144619,224 tokens/s1.01sInspect run →
SlayerLab/Slayer149
7857dd28ec05 · base
148.9M1.148022,011 tokens/s1.40sInspect run →
SlayerLab/Slayer149-Balanced-ARC-E-ft-45500
e7d4b8dea441 · base / ARC-adapted
149.3M1.154719,507 tokens/s1.00sInspect run →

¹ Teacher-forced scoring, not generation throughput; tokens differ between tokenizers. ² Model loading + loss-scoring wall time on one RTX 3090; excludes corpus collection and tokenization. It is not kernel-active GPU time.

Parameters vs live-text loss

Lower BPB is better. Same corpus and protocol; raw-text likelihoods; instruct and raw-base systems are distinguished below.

Favourable model size / loss regionObserved Pareto frontier

Green uses cohort medians, not a universal quality threshold. Frontier points have no measured alternative with both smaller model size and lower loss. Lines connect observed points; they do not predict intermediate models. Uncertainty is not included in frontier membership.

Measurement axisCurrent evidence
Live text lossMeasured on this narrow academic corpus
Procedural correctness & robustnessPlanned · not measured
Dev–private gapPlanned · not measured
Behaviour at lengthPlanned · not measured
Human pairwise preferencePlanned · not measured

Classical tasks / under-1B pilots

32 pinned examples per benchmark, mean answer-token log likelihood, FP32, input ceiling 1,024 tokens; keep the last prefix tokens as needed and the complete answer. Base/adapted and instruct systems use the same likelihood protocol; this is not a chat or fixed-SFT comparison. No composite score.

System / stageARC-Easy ↑HellaSwag ↑BoolQ ↑
Qwen/Qwen2.5-0.5B-Instruct
instruct · 494.0M
59.4%40.6%71.9%
HuggingFaceTB/SmolLM2-360M-Instruct
instruct · 361.8M
43.8%46.9%34.4%
SlayerLab/Slayer139-1.01
base / ARC-adapted · 139.3M
62.5%34.4%56.3%
SlayerLab/Slayer139-1.02
base / ARC-adapted · 139.3M
62.5%34.4%56.3%
SlayerLab/Slayer-149M-Decision-v1
decision-tuned · 149.3M
56.3%31.3%68.8%
SlayerLab/Slayer149-Balanced-ARC-E-ft-v2
base / ARC-adapted · 149.3M
62.5%34.4%62.5%
SlayerLab/Slayer139-1.01b
base / ARC-adapted · 139.3M
37.5%37.5%75.0%
SlayerLab/Slayer149-ARC
base / ARC-adapted · 149.3M
78.1%34.4%50.0%
HuggingFaceTB/SmolLM2-135M-Instruct
instruct · 134.5M
56.3%28.1%21.9%
SlayerLab/Slayer149
base · 148.9M
43.8%34.4%68.8%
SlayerLab/Slayer149-Balanced-ARC-E-ft-45500
base / ARC-adapted · 149.3M
62.5%37.5%78.1%

Watch current GPU processing → · Queue & ETA →

Selection catalogue / sub1b-catalog-v1

50 ways to inspect a small model.

Benchmarks, important variants and validation streams. Select a preset, then add coverage where it earns its cost. These are plans and available adapters, not 50 completed evaluations.

N low · Ś medium · W high · BW very high: planning cost only. ¹ Cost letters are planning estimates. GPU seconds appear only for completed cohort pilots. Full-suite cost and statistical discrimination remain unmeasured. Selecting a preset filters the catalogue; it does not launch GPU jobs.
50 of 50 entries
BenchmarkCost¹Execution / cohortPriority
22. ARC-Easy
knowledge
N–Ś
53.3 GPU-s
pilot
11/11 models measured
Results & runs →
P1
Core small-model signal
0 visits · interest 0.0
24. HellaSwag
commonsense
Ś
53.44 GPU-s
pilot
11/11 models measured
Results & runs →
P1
Core small-model signal
0 visits · interest 0.0
40. BoolQ
reading
N–Ś
80.19 GPU-s
pilot
11/11 models measured
Results & runs →
P1
Core small-model signal
0 visits · interest 0.0
19. BLiMP
grammar
N–Ś
Not timed
planned
Not run on this cohort
P1
Core small-model signal
0 visits · interest 0.0
16. WikiText-2
language-modeling
N
Not timed
planned
Not run on this cohort
P1
Core small-model signal
0 visits · interest 0.0
25. PIQA
commonsense
N
Not timed
planned
Not run on this cohort
P1
Core small-model signal
0 visits · interest 0.0
23. ARC-Challenge
knowledge
N–Ś
Not timed
adapter_ready
Not run on this cohort
P1
Core small-model signal
0 visits · interest 0.0
27. OpenBookQA
knowledge
N
Not timed
adapter_ready
Not run on this cohort
P1
Core small-model signal
0 visits · interest 0.0
26. WinoGrande
commonsense
N
Not timed
planned
Not run on this cohort
P1
Core small-model signal
0 visits · interest 0.0
28. SciQ
knowledge
N
Not timed
planned
Not run on this cohort
P1
Core small-model signal
0 visits · interest 0.0
29. LAMBADA
language-modeling
N–Ś
Not timed
planned
Not run on this cohort
P1
Core small-model signal
0 visits · interest 0.0
20. BLiMP Supplement
grammar
N–Ś
Not timed
planned
Not run on this cohort
P1
Core small-model signal
0 visits · interest 0.0
21. EWoK
world-modeling
Ś
Not timed
planned
Not run on this cohort
P1
Core small-model signal
0 visits · interest 0.0
18. Own held-out EN / PL / code
language-modeling
N–Ś
Not timed
planned
Not run on this cohort
P1
Core small-model signal
0 visits · interest 0.0
17. Uncheatable Eval
language-modeling
N–Ś
Not timed
planned
Not run on this cohort
P1
Core small-model signal
0 visits · interest 0.0
1. MMLU
knowledge · LFM2
Ś–W
Not timed
planned
Not run on this cohort
P2
Liquid reference coverage
0 visits · interest 0.0
2. GPQA
knowledge · LFM2
Ś
Not timed
planned
Not run on this cohort
P2
Liquid reference coverage
0 visits · interest 0.0
3. GPQA Diamond
knowledge · LFM2.5-350M
Ś
Not timed
planned
Not run on this cohort
P2
Liquid reference coverage
0 visits · interest 0.0
4. MMLU-Pro
knowledge · LFM2.5-350M
W
Not timed
planned
Not run on this cohort
P2
Liquid reference coverage
0 visits · interest 0.0
5. IFEval
instruction-following · LFM2 / LFM2.5-350M
Ś
Not timed
planned
Not run on this cohort
P2
Liquid reference coverage
0 visits · interest 0.0
6. IFBench
instruction-following · LFM2 / LFM2.5-350M
Ś
Not timed
planned
Not run on this cohort
P2
Liquid reference coverage
0 visits · interest 0.0
7. Multi-IF
instruction-following · LFM2.5-350M
W
Not timed
planned
Not run on this cohort
P2
Liquid reference coverage
0 visits · interest 0.0
8. GSM8K
math · LFM2
Ś–W
Not timed
adapter_ready
Not run on this cohort
P2
Liquid reference coverage
0 visits · interest 0.0
9. MGSM
math · LFM2
W
Not timed
planned
Not run on this cohort
P2
Liquid reference coverage
0 visits · interest 0.0
10. MMMLU — OpenAI
knowledge · LFM2
W
Not timed
planned
Not run on this cohort
P2
Liquid reference coverage
0 visits · interest 0.0
11. CaseReportBench
extraction · LFM2.5-350M
W
Not timed
planned
Not run on this cohort
P2
Liquid reference coverage
0 visits · interest 0.0
12. BFCL v3
tool-use · LFM2.5-350M
W
Not timed
planned
Not run on this cohort
P2
Liquid reference coverage
0 visits · interest 0.0
13. BFCL v4
tool-use · LFM2.5-350M
W–BW
Not timed
planned
Not run on this cohort
P2
Liquid reference coverage
0 visits · interest 0.0
14. τ²-Bench Telecom
tool-use · LFM2.5-350M
BW
Not timed
planned
Not run on this cohort
P2
Liquid reference coverage
0 visits · interest 0.0
15. τ²-Bench Retail
tool-use · LFM2.5-350M
BW
Not timed
planned
Not run on this cohort
P2
Liquid reference coverage
0 visits · interest 0.0
32. SVAMP
math
Ś
Not timed
planned
Not run on this cohort
P3
Additional task coverage
0 visits · interest 0.0
35. HumanEval
code-generation
Ś
Not timed
adapter_ready
Not run on this cohort
P3
Additional task coverage
0 visits · interest 0.0
36. HumanEval+
code-generation
Ś
Not timed
planned
Not run on this cohort
P3
Additional task coverage
0 visits · interest 0.0
37. MBPP
code-generation
Ś
Not timed
planned
Not run on this cohort
P3
Additional task coverage
0 visits · interest 0.0
38. MBPP+
code-generation
Ś
Not timed
planned
Not run on this cohort
P3
Additional task coverage
0 visits · interest 0.0
41. SQuAD 2.0
reading
Ś
Not timed
planned
Not run on this cohort
P3
Additional task coverage
0 visits · interest 0.0
42. DROP
reading
Ś–W
Not timed
planned
Not run on this cohort
P3
Additional task coverage
0 visits · interest 0.0
50. Belebele
multilingual-reading
Ś–W
Not timed
planned
Not run on this cohort
P3
Additional task coverage
0 visits · interest 0.0
30. MATH-500
math
W
Not timed
planned
Not run on this cohort
P4
Expensive or ambitious extension
0 visits · interest 0.0
31. GSM-Symbolic
math
Ś–W
Not timed
planned
Not run on this cohort
P4
Expensive or ambitious extension
0 visits · interest 0.0
33. BIG-Bench Hard — BBH
reasoning
W
Not timed
planned
Not run on this cohort
P4
Expensive or ambitious extension
0 visits · interest 0.0
34. AIME 2025
math
W
Not timed
planned
Not run on this cohort
P4
Expensive or ambitious extension
0 visits · interest 0.0
39. LiveCodeBench
code-generation
W
Not timed
planned
Not run on this cohort
P4
Expensive or ambitious extension
0 visits · interest 0.0
43. RULER
long-context
Ś–W
Not timed
planned
Not run on this cohort
P4
Expensive or ambitious extension
0 visits · interest 0.0
44. LongBench v2
long-context
BW
Not timed
planned
Not run on this cohort
P4
Expensive or ambitious extension
0 visits · interest 0.0
45. TruthfulQA
truthfulness
Ś
Not timed
planned
Not run on this cohort
P4
Expensive or ambitious extension
0 visits · interest 0.0
46. SimpleQA
truthfulness
Ś–W
Not timed
planned
Not run on this cohort
P4
Expensive or ambitious extension
0 visits · interest 0.0
47. WildBench
preference
W
Not timed
planned
Not run on this cohort
P4
Expensive or ambitious extension
0 visits · interest 0.0
48. AlpacaEval 2.0 — length-controlled
preference
W
Not timed
planned
Not run on this cohort
P4
Expensive or ambitious extension
1 visits · interest 6.9
49. MT-Bench
preference
W
Not timed
planned
Not run on this cohort
P4
Expensive or ambitious extension
0 visits · interest 0.0

Keep related measurements related. GPQA Diamond is a GPQA subset; BFCL v3/v4 share a family; Telecom/Retail are domains of τ²-Bench. HumanEval/+ and MBPP/+ may reuse saved generations only under compatible generation protocols. MMMLU and Belebele require explicit languages and aggregation.

The Liquid preset combines the published benchmark lists for LFM2 and LFM2.5-350M. Matching benchmark names does not reproduce Liquid’s internal evaluation protocol. No vendor-reported scores are mixed into our measured table.

Selection rule: measure local model/checkpoint separation, information added beyond existing tests, cost at the required precision and relationship to user tasks. No global aggregate score. AIME may have a floor; long-context tests may exceed model limits; grader-based tests need grader cost and bias analysis.

Core small-model measurements have explicit execution priority, followed by Liquid reference coverage. Benchmark-detail visits break ties within each tier with a seven-day decay. Scheduling still requires pinned data, item IDs, a validated model loader, budgets and an approved scoring protocol. Full catalogue JSON → · Runnable queue ETA →

Why this benchmark exists

Measure behaviour that survives a change in phrasing.

Public questions about world knowledge are easy to optimise against and only indirectly describe daily use. Our next step is newly generated, checkable tasks: extraction, classification with supplied labels, constrained rewriting, context-only QA, format following and autocomplete. Freshly generated items reduce memorisation of fixed questions; generators can still be gamed.

One task, several ways to fail

Illustrative design example; not a measured test item. A fictional product email lists three prices, two dates and a cancellation clause. Ask for the cancellation deadline and total price as JSON. Generate a paraphrase, reorder fields, add a distractor date, and remove the answer in another variant.

Check valid JSON, exact values and null when the deadline is absent. The robust item score passes only when every variant passes. Report ordinary correctness alongside this stricter all-variants score, so users can see the source of a failure.

Fresh text is the first axis, not the whole answer.

Live BPB measures how efficiently a model predicts a fixed sequence of recent text. We use byte-weighted loss so different tokenizers can be compared on identical raw text. Recent publication dates reduce exposure to old public test sets; they do not prove that a model has never seen a document. This pilot covers one domain and only 20 documents.

The methodological reference is UncheatableEval. Its benchmark targets base models and uses multiple fresh-text sources. This CodeSOTA pilot evaluates instruct and raw-base models on raw text, in separately labelled sections with a separate, narrower protocol. Scores are not official UncheatableEval results or comparable with its leaderboard. Its evaluator currently restricts batching to one; our batch-four implementation is independently versioned. BOS handling and context policy also differ and are recorded in every run.

Measure the experience, then validate it.

The next behaviour diagnostics will track repetition after 200–500 generated tokens, completion stopping and abstention when a context lacks the answer. Staying on topic and following subjective tone requests need stronger validation than exact matching. A small-model, blinded pairwise arena comes last: randomise sides, record ties and control for response length and formatting.

Automatic components earn their place by predicting held-out human preferences beyond simple baselines. Until that validation exists, this page makes no “pleasantness” ranking.

Make over-optimisation visible.

Publish generators and a development set, keep evaluation seeds private, rotate them quarterly, then retire and publish old seeds for audit. Display the dev–private gap with uncertainty. A large gap is a diagnostic signal, not proof of cheating. These controls are planned; the current text corpus is identified publicly by source, date and fingerprint.

Report local model separation, paired uncertainty and evaluation cost for each component. Drop or revise components that fail to separate the relevant cohort. Eleven models and 20 abstracts are a pilot, not enough evidence to fit a reliable IRT model or establish broad ranking stability.

Two tracks, two questions

Open track: evaluate the submitted instruct model as it is. The instruct results above are in this track, with no chat template for text-loss scoring. Raw-base Slayer checkpoints have their own text-loss section; this does not imply a completed fixed-SFT evaluation.

Base track — planned: apply the same small, fixed SFT recipe before evaluating task behaviour. Pin the training data, optimiser, budget, seeds and resulting checkpoint. Report raw base-model loss separately. There are no fixed-SFT results yet.

How this fits CodeSOTA

Task: language modelling, text → next-token probabilities. Benchmark: the dated arXiv corpus snapshot. Protocol: codesota-live-bpb-v1, context 1,024 tokens, stride 512, float32, TF32 disabled, batch four. Every content token is scored once; HF tokenizer BOS, otherwise EOS, is an unscored prefix; native Slayer loaders use config BOS or token 0. No chat template or automatically added special tokens.

System: a model at an exact weights revision. Result: byte-weighted loss, parameter count, timing and environment for that system and scope. Source: immutable per-document scores, corpus fingerprints and evaluator source. Explore the ontology →

Monthly refreshes use a bounded retry window on the 16th–18th. A busy GPU or failed refresh retains the last successful cohort. Each snapshot is a separate comparison scope; historical run evidence remains available. Raw third-party text is not mirrored in public artifacts.

Current measured data → · Initial independent serial validation → · Batching experiments →