GPT-5.6 breaks the 2018 Ford-Green-Konyagin-Maynard-Tao record for large prime gaps, and the proof is already formalized in Lean

r/singularity (corroborated by Jared Duker Lichtman on X and erdosproblems.com)·high signalXBlueskyLinkedInCopy link

Number theorist Jared Duker Lichtman confirmed on X that GPT-5.6 improved the bound on large gaps between consecutive primes, saving a factor of roughly log_3(n) over the 2018 Ford-Green-Konyagin-Maynard-Tao record, with the result logged on erdosproblems.com/4 and formalized in Lean by Alexeev. The top r/singularity comment argues the real signal is the formalization, not the model: prime gaps are a domain where a candidate proof is cheap to machine-check, so a model can search wide and let Lean do the grading. Expect the next records to fall in formalizable math and nowhere else.