cert-machine · report · generated from the record

Fifty new exact values for a colouring problem, each with a certificate

Colour the numbers 1 to n red or blue: how few three-term progressions of one colour can there be? The exact answer was known up to n = 45. In a second run, Claude Fable 5.2 (Anthropic) and GPT-6.2 Astra (OpenAI), working together, produced a certificate for every n up to 95: 50 new values. With Claude (Anthropic’s AI model, and the same model as one of the two), I checked every certificate in exact arithmetic with a program that shares no code with the search. These values depend on nothing but the definition. One further value is decided far beyond the table: at n = 548, the first length the twelve blocks of the 2008 conjecture fit exactly, the minimum is 15,756, attained by exactly 102 colourings. The two models also proposed much more, an exact formula for every large n; that part is not decided here.

−1 0 1 2 1 45 95 140 190 length n (the published table ended at 45) V(n) minus (117n²/2192 − n/2) decided here: the exact minimum, for every n up to 95 the formula the two models propose for every n: not decided here
−1 0 1 2 1 95 190 length n above the formula decided: exact V(n), n ≤ 95 proposed formula (not decided)
What is left of the minimum after its two leading terms. Solid: the exact minimum V(n), decided here for every n up to 95 by a certificate and a colouring. Dashed: the formula the two models propose for every n, a table of 1,096 corrections that repeats with n, drawn where nothing is decided. On all 95 decided lengths the formula gives exactly the decided value. Beyond 95 it is a proposal: it is proved only from n = 15,756 on, by an argument this page does not decide.Records: certs/twelve-blocks-exact.json · sha256 87ded8bc3af5; corpus/twelve-blocks/run/gpt/optimum-residues.json · sha256 dbe25731effdThe build refuses this figure if a decided value leaves the proposed formula, or the table of decided values has a gap.
lengths with an exact minimum
95
50 of them new; the published table ended at 45, and its 45 values are reproduced
certificate pieces checked
33,368
each one a matrix proved positive semidefinite in exact arithmetic
planted wrong versions refused
14 of 14
a value raised by one, a piece dropped, a flipped site, and others
the exact minimum at n = 548
15,756
with 102 minimising colourings; no paper lemma used. The theorems about every large n are not decided

Two kinds of statement are on this page and they are kept apart. The exact values are decided, by certificates anyone can check. The theorems about every large n are the two models’ and are only read. Nothing here compares the two models.

read this first

What is still open

The conditions of the run:

the certificate

How a lower bound is proved without trusting the search

1 · the exact values

Every length from 1 to 95

  • What was known. The exact minimum for n ≤ 45 (OEIS A121385; the last values by integer programming, R. Pratt, 2014), and upper bounds 90, 95, 100, 104, 110 for n = 46 to 50.
  • What is decided here. The exact minimum for every n from 1 to 95. The five upper bounds of 2014 are sharp. The 45 published values are reproduced by certificates that use none of the earlier computations.
  • The new values, n = 46 to 95. 90, 95, 100, 104, 110, 114, 119, 124, 130, 135, 140, 146, 151, 157, 163, 169, 174, 181, 187, 194, 200, 207, 214, 220, 228, 234, 241, 248, 256, 263, 270, 278, 286, 294, 302, 310, 318, 326, 335, 343, 352, 361, 370, 379, 388, 397, 406, 416, 425, 435
  • A pattern. Every one of the 95 values equals the formula the first run proposed for large n: (117n² + c)/2192 − n/2, with c one of 1,096 integers that depends only on the remainder of n modulo 1096. Whether that holds for every n is open; the two models conjecture it.
  • How far it goes. The largest certificate has 3,146 pieces. The model that found it reports about twenty minutes of search; checking all 95 certificates takes about two minutes.
All 95 values, with the number of pieces in each certificate
nExact minimum V(n)Pieces in the certificate
102as published
202as published
302as published
402as published
502as published
602as published
702as published
802as published
912as published
1012as published
1122as published
1222as published
1332as published
1444as published
1552as published
1662as published
1772as published
1882as published
19102as published
20124as published
211412as published
221618as published
231824as published
242022as published
252216as published
262418as published
27268as published
28284as published
29318as published
303428as published
313742as published
324080as published
334370as published
344684as published
354954as published
365240as published
375514as published
385818as published
396236as published
406646as published
417080as published
4274106as published
4378114as published
448258as published
458664as published
469032new
479576new
48100188new
4910476new
50110408new
51114132new
52119156new
5312496new
54130186new
55135276new
56140228new
57146192new
58151146new
59157170new
60163204new
61169234new
62174146new
63181258new
64187168new
65194388new
66200190new
67207250new
68214560new
69220360new
702281,194new
71234396new
72241320new
73248354new
74256526new
75263290new
76270228new
77278482new
78286618new
79294718new
80302856new
81310648new
82318568new
83326374new
84335842new
85343826new
86352784new
87361952new
883701,288new
893792,000new
903882,114new
913972,254new
92406932new
934162,336new
944252,094new
954353,146new
2 · the first twelve-block length

What is decided at n = 548

3 · proposed, not decided

What the two models claim about every large n

PROOF READ means a written proof was followed by the reader named and no error was found. It is not a formal check, and it is not this repository’s verdict. All of this rests on the lower bound of October 2026, which is this repository’s own claim and is not refereed.

ClaimFromRead byStandingHow it was read
For every n ≥ 20,700, a colouring with no more single-coloured progressions than the rounded twelve blocks differs from them only within 75 sites of the eleven block boundaries.GPT-6.2 AstraClaude Fable 5.2PROOF READA new argument: restore one cell and bound the restored colouring. Claude rebuilt the key lemma along its own code path, re-derived the others on paper, and named the weakest steps: everything leans on one paper lemma of October, and three margins at n = 20,700 are within half a site.
At every length n = 548m, m ≥ 1, the twelve blocks are optimal: V(n) = 117n²/2192 − n/2 + (m mod 2), with 2 minimisers at even m and 102 at odd m.GPT-6.2 AstraClaude Fable 5.2PROOF READThe first run reached m ≥ 118. Claude replayed the finite parts with its own program. It did not re-check the first run’s classification inside the windows, which the result needs at every m ≥ 2.
V(548) = 15,756 with 102 minimisers, by finite checks on the 548-site model alone: no paper lemma and no continuum theorem; the October multipliers are reused as numbers whose identities are verified.GPT-6.2 AstraClaude Fable 5.2PROOF READClaude rebuilt the two finite conditions that replace the paper lemmas with its own program; both hold exactly on both grids, one with a smallest slack of exactly zero.
Two explicit maps on the places where the colour changes: one enlarges a colouring by 1,096 sites and adds exactly 117n + 63,568 progressions, one sends length n to 1096q − n. Both keep the correction to the formula, which explains its period 1,096 and why it agrees at the residues r and −r.GPT-6.2 AstraClaude Fable 5.2PROOF READClaude wrote its own test from the document and ran 1,880 cases with no failure, and showed the test fails outside the stated range.
For every n ≥ 15,756, V(n) = (117n² + c_r)/2192 − n/2 with the first run’s table of 1,096 corrections and numbers of minimisers.GPT-6.2 AstraClaude Fable 5.2PROOF READThe first run needed n ≥ 92,000. Claude redid the arithmetic in fractions and tested the maps at the smaller window.

The proofs are in corpus/twelve-blocks-2/run/gpt/Localisation.md; the readings are in the conversation, corpus/twelve-blocks-2/run/CHAT.md.

4 · tested, as far as counting reaches

Three finite tests of those claims

A test that passes decides the test, not the theorem.

who did what

Each step is a separate job

check it yourself

How to re-read it

contact

Write to Carlos

Sent by Web3Forms to Carlos’s inbox; nothing stored here.

Or write to carlos@carlostoledo.co, or open the public pilot form on GitHub.