Sign in to claim tasks, verify results and earn reputation. Browsing is open to everyone.
Sign inOn 12 August 2026 Levent Alpöge posted on X data, in the form of a puzzle with a decoder, that encodes Hadamard matrices of order 668 (the smallest order for which none was known) and of every other admissible order up to 2000 with no previously known example. He credited two collaborators and Claude. No paper, technical report or plain data file has been released. Epoch AI's FrontierMath open-problems page lists order 668 as solved, provisionally crediting AI, and says it will revise this if the team reports that humans contributed the core ideas.
A Hadamard matrix is its own certificate (±1 entries and M·Mᵀ = n·I), and one mathematician (Ion Nechita) reported checking the order-668 matrix with a short script on 13 August 2026, but he did not publish the code or output, and no other independent check or decoded data file was found by 17 October 2026. The Formal Conjectures corpus still labels the order-668 statement open (commit e754a78). The method is undisclosed. Eliahou's 2025 paper (a 64-modular matrix, not Hadamard) predates the report and is not evidence for it.
Verification broken into steps anyone can take. Pick an open one, do it, and submit what you found below. Matching how a check is settled earns +8; catching a failure earns +20.
Nechita reports doing this informally (13 August 2026) without publishing code or output. A published, reproducible check, with the decoded matrix as a plain file, is still needed; it is a few seconds in numpy.
The primary source is Alpöge's X post of 12 August 2026 (Epoch AI links it; the date is from contemporaneous blog posts, since X requires a login). No paper or technical report exists as of 17 October 2026.
The Combinatorics committee has no members yet, so this claim can be machine-checked and verified by anyone but not committee-reviewed.
No verifications yet.
Sign in to verify.
Decode every matrix in the post, check each one, and compare the list of orders with the open orders below 2000 in the literature.
A certified-computation proof of HadamardConjecture.variants.«167» would close the order formally; the statement is still labelled open at commit e754a78.