gedanken
A runnable test of Einstein’s 1907 step. The full write-up: every number, table and caveat.
Code, preregistration and every transcript go public with the preprint.
The technical write-up
Hassabis has proposed a test for general intelligence: give a system a knowledge cutoff of 1911 and see whether it comes up with general relativity. It cannot be run on real physics, because every model has read the answer. gedanken builds a runnable analogue of one step, Einstein’s 1907 equivalence argument, and asks a narrower question: does an agent check the premise of an equivalence before extending it? In procedurally generated universes a textbook theory is exact on every experiment the agent can run, and the question asks for a clock-rate ratio in a regime no experiment reaches. In one member of each matched pair the equivalence fails for one kind of matter, which one available experiment reveals, so no policy that skips it can beat 1/2. In a preregistered study GPT-6 Luna ran that experiment in 2 of 140 episodes and extended the equivalence in every answer; asked directly, it ran it in 140 of 140 and gave the right verdict in 139.
- 138 / 140
- finds the thought experiment’s pairing
- 2 / 140
- checks it unprompted
- F-ACC · 70 matched pairs + 16 leak pairs · preregistered · exact sign tests · Python
- 2026 · Thought experiments and discovery
- one text, two universes → find the pairing μ → adopt the equivalence → clock ratiothe leap
- lab: free, carriage, field → find the pairing μ
- find the pairing μ → query the consequence class
The test that cannot be run
Nobody can run Hassabis’s test as stated: no frontier model has a 1911 cutoff, and the answer is in every corpus. gedanken runs the step Einstein took in 1907 instead: from a person in free fall who does not feel their weight to the gravitational redshift, derived before anyone had measured it.
When the incumbent theory is exact on everything an agent can observe, whether it extends a frame–field equivalence to a quantity no experiment reaches is a matter of its prior. So the test makes extending the equivalence right exactly when an accessible check passes, and then measures two things: which agents hold the prior, and which also run the check.
The instrument
| member | the field acts as the carriage on | true clock ratio |
|---|---|---|
| I | every kind of object | v* |
| D | every kind but the consequence class | v₀ = 1, the incumbent’s |
| U, the leak twin | what no experiment can tell from I | v₀ = 1 |
Procedurally generated universes with a free regime, an accelerated “carriage” and a field, every law exact and every name alien and regenerated per universe. A textbook states the incumbent theory, exact on every experiment the laboratory serves, and each frame’s kinematics, so the carriage’s clock law follows from it. For three ordinary kinds of matter it also states the field’s law of motion, with a strength to be measured; for a fourth kind, the consequence class, it states none, and the laboratory serves that kind’s motion in the field. The scored question is the clock-rate ratio between two heights in the field, a regime the laboratory never serves; it is fixed only if the agent adopts “the field is the paired frame, for every process”.
Each matched pair has two universes with byte-identical texts. In I the identity holds for every kind of object; in D it fails for one consequence class, visible only by querying that class in the field. So every policy that never makes the check scores at most 1/2, and the fixed blind policies (always-jump, never-jump) score exactly 1/2 on every pair. Leak pairs match an I member with a twin no experiment can tell apart from it: beating 1/2 there would mean the instrument leaks.
Preregistered before any model ran on a test universe
The rules were frozen first: the arms, the 70 test pairs and 16 leak pairs, the exact one-sided sign tests and their families, the leak gate as a stop rule, the cost rule that sizes each model’s set from a six-episode practice check, and the stopping rules. Twenty-nine amendments followed, each logged with its reason and with what had been seen when it was made; the preregistration is a file in the study’s repository, so its dates are as trustworthy as the commit history. Four independent audits re-derived the result: every episode re-scored against regenerated universes with 0 mismatches, every transcript matching its recorded fingerprint.
Two of the three planned models left under the frozen rules before any test episode, one on privacy and one on cost, and the replacements failed on cost or context. GLM-5.3 Flash joined, lost its server mid-run, and was stopped on the only other one, where it waited on rate limits about 91% of the time. One model is fully reported: GPT-6 Luna.
End to end, it never beats chance
| GPT-6 Luna, end to end | value |
|---|---|
| finds the pairing | 138 / 140 |
| queries the consequence class in the field | 2 / 140 |
| answers that apply the equivalence | 139 / 139 |
| right on I members · on D members | 67 / 70 · 0 / 70 |
| balanced accuracy | 0.479 [0.450, 0.500] |
| pairs right in both · wrong in both | 0 · 3 |
L0: the episode text and the laboratory. L-a, the exact one-sided sign test of the pairs right in both against the pairs wrong in both: p = 1.
It found the thought experiment’s pairing in 138 of 140 episodes and applied the equivalence in every answer it gave: 132 of 139 answers were v*, and the other 7 the same ratio inverted. It queried the consequence class in the field in 2. So it was right on the I members and wrong on every D member, and beating 1/2 was not detected.
It was not idle. Of its 5,454 experiments, 75.5% re-measured the three ordinary kinds in the field, whose law the textbook already states, and one used the carriage. In 121 of 140 episodes its visible text reads the clock rate straight off the textbook’s factor n. Afterwards it said that all kinds respond alike in all 138 episodes that gave a verdict, including the 69 in which one kind does not.
Handed the thought experiment, it doubts but does not inquire
L1 hands over the pairing and the value it implies. Balanced accuracy 0.457 [0.421, 0.486]: a gain was not detected (L-b p = 0.91; gain −0.021 [−0.064, 0.021]).
In 19 episodes it declined to answer. In every one it explained, in its own words, that the hand-off matched only the trajectories of matter, not clock rates or signal propagation. In 8 it gave the value the full equivalence would imply anyway: “The hand-off establishes matching trajectories only … Extending the equivalence to light and clocks would give 1.06259, but that extension is not stated.” In none of the 19 did it query the consequence class in the field, the one accessible experiment that bears on whether the equivalence holds for everything. It doubted, but did not inquire.
Asked, it checks every time
| end to end | 0.479 |
|---|---|
| the thought experiment handed over | 0.457 |
| asked to check (scores the verdict, not the clock) | 0.993 |
| S2: “do all kinds respond alike?” | value |
|---|---|
| queries the consequence class in the field | 140 / 140 |
| right verdict | 139 / 140 |
| balanced accuracy | 0.993 [0.979, 1.000] |
| pairs right in both · wrong in both | 69 · 0 |
E-a, the exact one-sided sign test: p = 1.7 × 10⁻²¹. Locked before any of its episodes.
The extension hands over the pairing and asks the one question the leap depends on. The model ran the decisive experiment every time and read it correctly in all but one episode. It differs from the end-to-end arm in three ways: it hands over the pairing, it names the comparison, and it scores a verdict rather than the clock readout. So the model can make the comparison when told which one to make; whether making it would correct the readout was not tested. The extension was added after the end-to-end scores had been read, and locked before any of its episodes.
Where the leap breaks
| finds the pairing | 138 / 140 |
|---|---|
| checks, unprompted (L0) | 2 / 140 |
| checks, unprompted (L1) | 2 / 140 |
| checks, asked (S2) | 140 / 140 |
| right verdict, asked (S2) | 139 / 140 |
The 1907 step splits into typed stages: finding the pairing (computation), checking that it holds for every kind of matter (inference), adopting it (prior) and applying it (computation). GPT-6 Luna finds the pairing, runs the check when told what to compare, and adopts and applies the equivalence whenever it answers. It almost never makes the check unprompted: 1.4%.
So the failure is not a failure to compute, and not an inability to run the check. It is at least a failure to ask, before leaping, the one question the leap depends on. Two other readings fit the same counts: the setup is recognisably relativistic, so the model may recall a prior in which every kind of matter falls alike; or having the data may not be enough: in the one end-to-end episode where it checked a decoy, it saw one kind fall about 22% less far and still extended the equivalence. A textbook that hides the factor n, and an asked check followed by the readout, would separate them.
The RL arm did not learn
| seed 0 | 0: 0.5, 0.1: 0.5, 0.2: 0.5, 0.3: 0.395, 0.4: 0.415, 0.5: 0.5, 0.6: 0.34, 0.7: 0, 0.8: 0, 0.9: 0.5, 1: 0.5, 1.1: 0.5, 1.2: 0.5, 1.3: 0.5, 1.4: 0.5, 1.5: 0.5, 1.6: 0.5, 1.7: 0.5, 1.8: 0.5, 1.9: 0.5, 2: 0.5 |
|---|---|
| seed 1 | 0: 0, 0.1: 0.44, 0.2: 0.485, 0.3: 0.5, 0.4: 0.5, 0.5: 0.5, 0.6: 0.5, 0.7: 0.5, 0.8: 0.135, 0.9: 0.5, 1: 0.5, 1.1: 0.025, 1.2: 0.5, 1.3: 0.5, 1.4: 0.5, 1.5: 0.015, 1.6: 0.5, 1.7: 0.5, 1.8: 0, 1.9: 0, 2: 0.5 |
| seed 2 | 0: 0.5, 0.1: 0.465, 0.2: 0.5, 0.3: 0.5, 0.4: 0.5, 0.5: 0.5, 0.6: 0.5, 0.7: 0.44, 0.8: 0.5, 0.9: 0.37, 1: 0.5, 1.1: 0.5, 1.2: 0.5, 1.3: 0.5, 1.4: 0.5, 1.5: 0.495, 1.6: 0.5, 1.7: 0.5, 1.8: 0.5, 1.9: 0.5, 2: 0.5 |
| learning bar | 0.75 |
| run | rung | per-seed minima | median |
|---|---|---|---|
| E1.2 | R1 | 0.475, 0.315, 0.5 | 0.475 |
| E1.3 | R2 | 0.0, 0.5, 0.495 | 0.495 |
| E1.R | R2, 2 × 10⁶ episodes per seed | 0.5, 0.5, 0.5 | 0.5 |
Final greedy development BA, the minimum over the two training families. A rung learns if its median seed reaches 0.75.
The thesis arm asked whether a 3,315,508-parameter transformer, meta-trained by PPO across two training families, learns a check-then-use rule. Nine runs trained for 9,000,576 episodes and 16.2 hours on a laptop CPU. After episode 0, no run made a single correct jump at any evaluation: the agent stayed on the free “default” answer, which earns 1/2.
The shallow comparator did learn and transfer: a conditional logit that scores candidate frames by one shared linear function reached cross-family BA 1.000 in three of four directions, so the preregistered RL-minus-comparator contrast could not have favoured RL there even if PPO had learned. By its preregistered kill rule the RL arm stopped here: a statement about this interface and this compute, not about RL.
Bugs the practice checks caught
- OpenAI tools sent in strict mode
- Through the router, an OpenAI model’s tools went out in strict mode, so its decoding filled every optional key and the laboratory refused all 156 of its first practice experiments as malformed. They now go out with strict off, as the direct route always sent them, and a regression test fails without the fix.
- A sandbox that could read other processes’ environments
- Code in the python tool could read any same-user process’s start-up environment, where the API key sat. No model used it: none of Luna’s 2,133 python calls touches the environment. The key now lives only in a file the tool cannot read.
- Unbilled reservations counted as spend
- The cost rule sizes each model’s pair set from what its practice check billed, but the report counted the reservations of refused requests as dollars. Recomputed on billed dollars, GLM-5.3 Flash’s set went from 38 pairs to 64.
What this does not show
One fully reported model, and a cheap one: nothing here is a statement about “LLMs”. One universe family and one readout. The setup is recognisable: the kinematics are special relativity’s and the field law is a uniformly accelerated (Rindler) chart, so “finds the pairing” and “adopts the equivalence” may be recall, not imagination; matched pairs keep recognition from raising the score. The asked check names the comparison, was added after the end-to-end scores were read, and scores a verdict; weaker prompts were not run. The preregistration is self-held, and there is no human baseline. One sample per universe, at the vendor’s default sampling. The RL result is a negative at laptop compute, with one architecture and one interface.