Equation 12 · The Hardest Unsolved Problems in Open-Weight AI
What does this equation mean?
Read the formula alongside the article passage below. Each part has a deeper page with its role in the equation, the supporting passage and nearby citations.
This equation states an equality: the expressions on both sides have the same value under the article’s assumptions. Read the equation part by part below; each part has a contextual explanation and a link to its mathematical background.
Read it piece by piece
Symbol s_obs
bs is part of the quantity the equation computes from the expression on the right.
Symbol c
c is one of the signed contributions combined to compute the quantity on the left.
=
The expressions on both sides represent the same quantity under the stated assumptions.
See an illustrated explanation →subtraction
Subtract the following term or group from the preceding one. A leading minus marks a negative quantity.
subscript
The lower label selects a particular version, component, or indexed member of the quantity. For example, x₀ and xₜ can be values at different positions.
How to interpret it
Read it with the definitions, units, and assumptions supplied by the article.
What the article says around this equation
A simple decomposition makes clear why this is a measurement problem and not merely an inconvenience. Let be an observed benchmark score, the underlying capability the benchmark intends to measure, and c the fraction of test instances the model has effectively memorized, whether verbatim or through a rephrased variant. If a memorized instance is answered correctly with certainty, then approximately . Every published leaderboard number implicitly assumes c 0 . The methods above show that assumption is not something the field can currently verify for a given open-weight release, only something it can occasionally catch violated in…
Read the full surrounding passage
A simple decomposition makes clear why this is a measurement problem and not merely an inconvenience. Let be an observed benchmark score, the underlying capability the benchmark intends to measure, and c the fraction of test instances the model has effectively memorized, whether verbatim or through a rephrased variant. If a memorized instance is answered correctly with certainty, then approximately . Every published leaderboard number implicitly assumes c 0 . The methods above show that assumption is not something the field can currently verify for a given open-weight release, only something it can occasionally catch violated in specific, published cases — which is a different and much weaker guarantee than a general bound on c .
Sources cited in the article section
- [13] Hugging Face Releases Open LLM Leaderboard 2: A Major Upgrade Featuring Tougher Benchmarks, Fairer Scoring, and Enhanced Community Collaboration ↗
- [12] It's Been a Wild Ride, Folks (End of the Open LLM Leaderboard) ↗
- [9] Detecting Pretraining Data from Large Language Models ↗
- [10] Rethinking Benchmark and Contamination for Language Models with Rephrased Samples ↗
- [11] On the Fragility of Benchmark Contamination Detection in Reasoning Models ↗
These citations give research context. Read each source to check which claims it supports.
Return to The Hardest Unsolved Problems in Open-Weight AI