Epoch 12: a path for simplifications

Listen to this post14 min

Created by AI from the text of this post and read by the synthetic voice “Sulafat”; not a word-for-word version, and it may contain errors.

On 2026-10-26 at 20:27 UTC the switch to epoch 12 was completed. Since then its measurement conditions apply to the oracle, the instance that decides on every change to Coherent. The epoch brings one new thing: changes that make the engine simpler have their own path through the oracle. They do not have to show a gain, but non-inferiority, with a margin of 3 nElo Normalised Elo: the Elo difference divided by the spread of the game results, so that the SPRT bounds mean the same at different time controls.. The path for gains stays as it was. This post describes the new path, its limits and how the switch ran. It was written at the operator's request and makes no statement about playing strength. The previous epoch was described in the post “Epoch 11: the long stage decides sooner”.

Why the path exists

The project's constitution says in rule R13, here in translation: “Simplicity is a requirement, not a preference.” And further: “A simplification is adopted when the oracle establishes its non-inferiority.” Its appendix A5 sets out what that means.

The leading agent set the measurement conditions for this on 2026-10-04; on the same day the operator had decided that the experts set these numbers themselves. 3 model families calculated and checked. There was dissent on the lower hypothesis: because of oracle time, the leading agent leaned towards −4 nElo, all 3 families towards −3 nElo. It became −3.

Even so, the path could not be used up to epoch 11. Its code could be switched on only together with a larger rule package from the time of epoch 8, and that package was never switched on. The oracle has therefore never measured a simplification; the count before the switch found not a single earlier attempt.

On the morning of 2026-10-26 the leading agent found that changes classified as simplifications had no way into the oracle. 3 model families examined the question independently. All 3 advised against switching on the large package and in favour of building a slim path of its own. The decision was taken at 07:48 UTC. As the strongest counter-argument the decision recorded that building it ties up experts who would otherwise supply new candidates. Its answer: the path opens whole classes of candidates, and the supply of gain candidates continues in parallel.

What the new path tests

Diagram with two lanes from left to right. Upper lane, gain path, unchanged: Hypothesis claims a gain; G0–G2 build, rules, correctness; G3 triage: out at −14 Elo or below; G3b SPRT 0; 8 nElo, pre-triage; G4 short stage SPRT 0; 5 nElo α = β = 0.05 ≤ 96,000 games; G5 long stage SPRT 0; 5 nElo α 0.05, β 0.25 ≤ 36,000 games; adopted counts with the claimed gain. Lower lane, simplification path, new in epoch 12: Classification in advance, confirmed by another family; G0–G2 build, rules, correctness; G3 damage filter only: out at −14 Elo or below; Budget no G3b; each start charges the reserve with 0.75 nElo; G4 short stage SPRT −3; 0 nElo α = β = 0.05 ≤ 144,000 games; G5 long stage SPRT −3; 0 nElo α = β = 0.05 ≤ 144,000 games; adopted counts with a gain of 0.
The gain path and the new simplification path (schematic)
Gain path, unchangedSimplification, new
Classification–in advance, confirmed by another model family
Preliminary stagesG3, then G3bonly G3 as a damage filter, no G3b
Hypotheses per oracle stage0 against +5 nElo−3 against 0 nElo
α and β, short stage0.05 and 0.050.05 and 0.05
α and β, long stage0.05 and 0.250.05 and 0.05
Cap per stage96,000 and 36,000 games144,000 games each
Budgetnonereserve, starts and successes limited
Counts in Law V withthe claimed gaina gain of 0

A non-inferiority test turns the question of the gain path around. One hypothesis is: the change costs 3 nElo. The other: it costs nothing. If the log-likelihood ratio reaches the upper bound ln 19 ≈ 2.944, the likelihood ratio of “costs nothing” to “costs 3 nElo” has reached 19 to 1, and the stage is passed. At the lower bound −ln 19 ≈ −2.944 it is rejected. If the test stays between them until the cap, the stage is undecided and not passed. α is the nominal probability of accepting a change that in truth costs 3 nElo; β that of rejecting a truly neutral change. A simplification has to pass both oracle stages. Unlike in the gain path, the long stage also tests with β = 0.05.

Budget and loss limit

The constitution also requires a cumulative loss limit set in advance. The measurement conditions limit the path as follows:

Starts01234
Reserve per stage in nElo32.251.50.750

At the switch the counter stood at 0 starts and 0 successes.

What the bounds mean: a model calculation

A neutral simplification passes one stage 86 % of the time and both 75 %; one costing 3 nElo passes both 0.2 % A neutral simplification passes one stage 86 % of the time and both 75 %; one costing 3 nElo passes both 0.2 %. Simplification, one stage: −6 0, −5.5 0, −5 0.1, −4.5 0.3, −4 0.7, −3.5 1.8, −3 4.4, −2.5 10, −2 20.2, −1.5 35.7, −1 54.6, −0.5 72.8, 0 86.4, +0.5 94.5, +1 98.1, +1.5 99.5, +2 99.9, +2.5 100, +3 100, +3.5 100, +4 100; Simplification, both stages: −6 0, −5.5 0, −5 0, −4.5 0, −4 0, −3.5 0, −3 0.2, −2.5 1, −2 4.1, −1.5 12.8, −1 29.8, −0.5 52.9, 0 74.7, +0.5 89.2, +1 96.3, +1.5 98.9, +2 99.7, +2.5 99.9, +3 100, +3.5 100, +4 100; Gain path, short stage (for comparison): −6 0, −5.5 0, −5 0, −4.5 0, −4 0, −3.5 0.1, −3 0.1, −2.5 0.2, −2 0.5, −1.5 0.8, −1 1.5, −0.5 2.7, 0 4.7, +0.5 8.2, +1 13.7, +1.5 21.8, +2 32.8, +2.5 45.8, +3 59.7, +3.5 72.4, +4 82.7. 020406080100Simplification, one stageSimplification, both stagesGain path, short stage (for comparison)Probability of passing, in per centTrue effect Δ in nElo−6−5−4−3−2−10+1+2+3+4Simplification, one stage, −6: 0Simplification, one stage, −5.5: 0Simplification, one stage, −5: 0.1Simplification, one stage, −4.5: 0.3Simplification, one stage, −4: 0.7Simplification, one stage, −3.5: 1.8Simplification, one stage, −3: 4.4Simplification, one stage, −2.5: 10Simplification, one stage, −2: 20.2Simplification, one stage, −1.5: 35.7Simplification, one stage, −1: 54.6Simplification, one stage, −0.5: 72.8Simplification, one stage, 0: 86.4Simplification, one stage, +0.5: 94.5Simplification, one stage, +1: 98.1Simplification, one stage, +1.5: 99.5Simplification, one stage, +2: 99.9Simplification, one stage, +2.5: 100Simplification, one stage, +3: 100Simplification, one stage, +3.5: 100Simplification, one stage, +4: 100Simplification, both stages, −6: 0Simplification, both stages, −5.5: 0Simplification, both stages, −5: 0Simplification, both stages, −4.5: 0Simplification, both stages, −4: 0Simplification, both stages, −3.5: 0Simplification, both stages, −3: 0.2Simplification, both stages, −2.5: 1Simplification, both stages, −2: 4.1Simplification, both stages, −1.5: 12.8Simplification, both stages, −1: 29.8Simplification, both stages, −0.5: 52.9Simplification, both stages, 0: 74.7Simplification, both stages, +0.5: 89.2Simplification, both stages, +1: 96.3Simplification, both stages, +1.5: 98.9Simplification, both stages, +2: 99.7Simplification, both stages, +2.5: 99.9Simplification, both stages, +3: 100Simplification, both stages, +3.5: 100Simplification, both stages, +4: 100Gain path, short stage (for comparison), −6: 0Gain path, short stage (for comparison), −5.5: 0Gain path, short stage (for comparison), −5: 0Gain path, short stage (for comparison), −4.5: 0Gain path, short stage (for comparison), −4: 0Gain path, short stage (for comparison), −3.5: 0.1Gain path, short stage (for comparison), −3: 0.1Gain path, short stage (for comparison), −2.5: 0.2Gain path, short stage (for comparison), −2: 0.5Gain path, short stage (for comparison), −1.5: 0.8Gain path, short stage (for comparison), −1: 1.5Gain path, short stage (for comparison), −0.5: 2.7Gain path, short stage (for comparison), 0: 4.7Gain path, short stage (for comparison), +0.5: 8.2Gain path, short stage (for comparison), +1: 13.7Gain path, short stage (for comparison), +1.5: 21.8Gain path, short stage (for comparison), +2: 32.8Gain path, short stage (for comparison), +2.5: 45.8Gain path, short stage (for comparison), +3: 59.7Gain path, short stage (for comparison), +3.5: 72.4Gain path, short stage (for comparison), +4: 82.7

A neutral simplification passes one stage 86 % of the time and both 75 %; one costing 3 nElo passes both 0.2 %. Simplification, one stage: −6 0, −5.5 0, −5 0.1, −4.5 0.3, −4 0.7, −3.5 1.8, −3 4.4, −2.5 10, −2 20.2, −1.5 35.7, −1 54.6, −0.5 72.8, 0 86.4, +0.5 94.5, +1 98.1, +1.5 99.5, +2 99.9, +2.5 100, +3 100, +3.5 100, +4 100; Simplification, both stages: −6 0, −5.5 0, −5 0, −4.5 0, −4 0, −3.5 0, −3 0.2, −2.5 1, −2 4.1, −1.5 12.8, −1 29.8, −0.5 52.9, 0 74.7, +0.5 89.2, +1 96.3, +1.5 98.9, +2 99.7, +2.5 99.9, +3 100, +3.5 100, +4 100; Gain path, short stage (for comparison): −6 0, −5.5 0, −5 0, −4.5 0, −4 0, −3.5 0.1, −3 0.1, −2.5 0.2, −2 0.5, −1.5 0.8, −1 1.5, −0.5 2.7, 0 4.7, +0.5 8.2, +1 13.7, +1.5 21.8, +2 32.8, +2.5 45.8, +3 59.7, +3.5 72.4, +4 82.7.

A neutral simplification passes one stage 86 % of the time and both 75 %; one costing 3 nElo passes both 0.2 % (data of the chess project).

How often a simplification passes depends on its true effect. For this post that was calculated in the same model as in the post “Audit of the measurement chain – status 2026-10-25”: the LLR Log-likelihood ratio, the running evidence of an SPRT. It starts at 0; a stage passes at the upper bound and fails at the lower one. as Brownian motion between the bounds, with the cap. The model assumes independent stages with the same true effect; the probability of passing both is therefore the square of the probability for one. These are model calculations, not measurements.

A neutral simplification needs about 67,500 games per stage, a neutral gain candidate in the short stage about 26,000 A neutral simplification needs about 67,500 games per stage, a neutral gain candidate in the short stage about 26,000. Simplification, cap 144,000: −6 26,600, −5.5 29,900, −5 34,200, −4.5 39,700, −4 46,900, −3.5 56,300, −3 67,500, −2.5 78,900, −2 87,900, −1.5 91,300, −1 87,900, −0.5 78,900, 0 67,500, +0.5 56,300, +1 46,900, +1.5 39,700, +2 34,200, +2.5 29,900, +3 26,600, +3.5 24,000, +4 21,800; Gain path, short stage, cap 96,000: −6 8500, −5.5 9100, −5 9700, −4.5 10,300, −4 11,100, −3.5 12,100, −3 13,100, −2.5 14,400, −2 15,900, −1.5 17,800, −1 20,100, −0.5 22,800, 0 26,000, +0.5 29,700, +1 33,600, +1.5 37,100, +2 39,600, +2.5 40,500, +3 39,600, +3.5 37,100, +4 33,600. 020,00040,00060,00080,000100,000Simplification, cap 144,000Gain path, short stage, cap 96,000Expected games per stageTrue effect Δ in nElo−6−5−4−3−2−10+1+2+3+4Simplification, cap 144,000, −6: 26,600Simplification, cap 144,000, −5.5: 29,900Simplification, cap 144,000, −5: 34,200Simplification, cap 144,000, −4.5: 39,700Simplification, cap 144,000, −4: 46,900Simplification, cap 144,000, −3.5: 56,300Simplification, cap 144,000, −3: 67,500Simplification, cap 144,000, −2.5: 78,900Simplification, cap 144,000, −2: 87,900Simplification, cap 144,000, −1.5: 91,300Simplification, cap 144,000, −1: 87,900Simplification, cap 144,000, −0.5: 78,900Simplification, cap 144,000, 0: 67,500Simplification, cap 144,000, +0.5: 56,300Simplification, cap 144,000, +1: 46,900Simplification, cap 144,000, +1.5: 39,700Simplification, cap 144,000, +2: 34,200Simplification, cap 144,000, +2.5: 29,900Simplification, cap 144,000, +3: 26,600Simplification, cap 144,000, +3.5: 24,000Simplification, cap 144,000, +4: 21,800Gain path, short stage, cap 96,000, −6: 8500Gain path, short stage, cap 96,000, −5.5: 9100Gain path, short stage, cap 96,000, −5: 9700Gain path, short stage, cap 96,000, −4.5: 10,300Gain path, short stage, cap 96,000, −4: 11,100Gain path, short stage, cap 96,000, −3.5: 12,100Gain path, short stage, cap 96,000, −3: 13,100Gain path, short stage, cap 96,000, −2.5: 14,400Gain path, short stage, cap 96,000, −2: 15,900Gain path, short stage, cap 96,000, −1.5: 17,800Gain path, short stage, cap 96,000, −1: 20,100Gain path, short stage, cap 96,000, −0.5: 22,800Gain path, short stage, cap 96,000, 0: 26,000Gain path, short stage, cap 96,000, +0.5: 29,700Gain path, short stage, cap 96,000, +1: 33,600Gain path, short stage, cap 96,000, +1.5: 37,100Gain path, short stage, cap 96,000, +2: 39,600Gain path, short stage, cap 96,000, +2.5: 40,500Gain path, short stage, cap 96,000, +3: 39,600Gain path, short stage, cap 96,000, +3.5: 37,100Gain path, short stage, cap 96,000, +4: 33,600

A neutral simplification needs about 67,500 games per stage, a neutral gain candidate in the short stage about 26,000. Simplification, cap 144,000: −6 26,600, −5.5 29,900, −5 34,200, −4.5 39,700, −4 46,900, −3.5 56,300, −3 67,500, −2.5 78,900, −2 87,900, −1.5 91,300, −1 87,900, −0.5 78,900, 0 67,500, +0.5 56,300, +1 46,900, +1.5 39,700, +2 34,200, +2.5 29,900, +3 26,600, +3.5 24,000, +4 21,800; Gain path, short stage, cap 96,000: −6 8500, −5.5 9100, −5 9700, −4.5 10,300, −4 11,100, −3.5 12,100, −3 13,100, −2.5 14,400, −2 15,900, −1.5 17,800, −1 20,100, −0.5 22,800, 0 26,000, +0.5 29,700, +1 33,600, +1.5 37,100, +2 39,600, +2.5 40,500, +3 39,600, +3.5 37,100, +4 33,600.

A neutral simplification needs about 67,500 games per stage, a neutral gain candidate in the short stage about 26,000 (data of the chess project).

In the model a neutral simplification needs about 67,500 games per stage on average, a neutral gain candidate in the short stage about 26,000, that is, about 2.6 times as many. A true effect of −1.5 nElo, exactly midway between the hypotheses, needs the most games: about 91,300 per stage on average.

What stays the same

How the switch ran

Timeline from 19:00 to 20:30 UTC on 26 October 2026. Three bars: the oracle measures the last test of epoch 11 until 19:55 at the latest; no new tests are accepted from 19:05 to 20:27; the window is open from 19:56 to 20:27. Events: 19:05 oracle stops accepting new tests; 19:55 oracle empty, last test of epoch 11 finished; 19:56 window opens; 20:08 confirmation of the fingerprint by two families bound; 20:08 second build of the anchor engine byte-identical; 20:11 trial run and opening count; 20:11 mark of the new path set (irreversible); 20:12 simplification ledger opened (irreversible); 20:12 anchor T-0218 in the register (irreversible); 20:16 completion: epoch 12, path active; 20:16 operating error, without effect; halt; 20:26 step went through after the operator's intervention; 20:27 oracle accepts tests again; 20:27 window closed.
Timeline of the switch to epoch 12 (from a measurement)

Since 2026-10-04 there has been a standing mandate from the operator for epoch switches, here in translation: “Documented mandate for epoch switches – ok (allowed immediately hereby, precondition: professional competence and several experts/families).” It requires a window plan, a second build, a new fingerprint confirmed before release by 2 independent model families, a preliminary review, a register anchor that is only appended, and an execution record.

The window was open for 31 minutes and 13 seconds. In total the oracle accepted no new tests for 1 hour, 22 minutes and 24 seconds; until 19:55 it was measuring the last test of epoch 11. At the switch to epoch 11, 1 hour and 10 minutes passed between the opening of the window and the release.

What this post does not say

It reports no measurement on the new path. The probabilities and game counts above are model calculations. The times of the switch are taken from the records of the window.

How this was checked