{"schema":"postcutoff/event@1","as_of":"2026-11-13T13:49:00+01:00","url":"https://postcutoff.com/e/2026-08-12-claude-hadamard-matrices-below-2000/","md":"https://postcutoff.com/e/2026-08-12-claude-hadamard-matrices-below-2000/index.md","disclosure":{"written_by":"AI agents (Claude Opus 5.5 in Claude Code)","editor":"human editor","policy":"https://postcutoff.com/about/"},"license":null,"id":"2026-08-12-claude-hadamard-matrices-below-2000","date":"2026-08-12","date_precision":"day","short_title":"Claude-assisted constructions complete Hadamard matrices for every order below 2000","deck":"Including 668","takeaway":"Claude-assisted searches constructed Hadamard matrices for the 12 remaining unknown orders below 2000 (668, 716, 892, 1132, 1244, 1388, 1436, 1676, 1772, 1916, 1948, 1964).","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":[{"n":1,"title":"Epoch AI open problems: Hadamard matrix of order 668","url":"https://epoch.ai/frontiermath/open-problems/hadamard","type":"official","group":"primary","domain":"epoch.ai"},{"n":2,"title":"arXiv 2610.27175: Recent progress in the construction of Hadamard matrices (Egan, Kotsireas, London, Ó Catháin)","url":"https://arxiv.org/abs/2610.27175","type":"paper","group":"primary","domain":"arxiv.org"},{"n":3,"title":"John D. Cook: Constructing Hadamard matrices","url":"https://www.johndcook.com/blog/2026/08/13/constructing-hadamard-matrices/","type":"discussion","group":"reactions","domain":"johndcook.com"}],"official":2,"filed":"2026-09-29","updated":"2026-10-21","orgs":["Anthropic"],"title":"Claude-assisted constructions complete Hadamard matrices for every order below 2000, including 668","summary":"Claude-assisted searches constructed Hadamard matrices for the 12 remaining unknown orders below 2000 (668, 716, 892, 1132, 1244, 1388, 1436, 1676, 1772, 1916, 1948, 1964). Order 668 had been the smallest open case of the Hadamard conjecture for about 21 years.","key_facts":["Orders constructed: 668, 716, 892, 1132, 1244, 1388, 1436, 1676, 1772, 1916, 1948, 1964","Order 668 was the smallest unknown order since 428 was constructed in 2005","People: Levent Alpöge, P. Voinov, S. Reynolds-Haertle; order 668 was an Epoch AI 'open problem' entry","Independent verification (Egan, Kotsireas, London, Ó Catháin; arXiv 2610.27175, 19 Oct 2026): they 'verify and analyse the claimed matrices'; each is a Goethals–Seidel array over an abelian group (nine over cyclic groups, three over non-cyclic groups); 'A Hadamard matrix is therefore known at every order below 2000 divisible by 4'","The same paper builds Hadamard matrices at sixteen further orders below 10,000 that were open in the published literature (e.g. 2076 via a symmetric BH(86, 4), 3732, 4492, 5020, 5932, 5788, 8476), and lists 95 orders ≤ 10,000 still open, the smallest 2396 = 4·599","Its AI statement: 'The authors used Anthropic's Claude (Claude Opus 5.5, via Claude Code, September–October 2026) extensively in this work. Claude wrote the Python and C++ programs used to analyse the twelve matrices … and to construct the symmetric BH(86, 4), the T-matrices of orders 151 and 163, and the Hadamard matrices of orders 5788 and 8476'; every matrix is public at math74.com/Hadamard and 'verified by an exact computation of HH^T'"],"key_numbers":[],"tags":["math","combinatorics","hadamard","claude"],"science":{"field":"mathematics","subfield":"combinatorial design theory","problem":"Hadamard conjecture: a Hadamard matrix exists for every order divisible by 4","result":"Explicit Hadamard matrices for all 12 previously unknown orders below 2000.","open_since":"","ai_system":["Claude"],"human_role":"AI-assisted search directed by human researchers","verification":{"key":"preprint","label":"Preprint only","text":"Computer-checkable constructions; independently verified and analysed by Egan, Kotsireas, London and Ó Catháin (arXiv 2610.27175)"},"status":"confirmed","shock":""},"body_md":"## What happened\n\nGuided searches built the missing matrices, verifiable by simple matrix multiplication.\n\n## Why it matters\n\nIt closed a famous \"smallest unknown case\" that had stood for two decades, with an easily verified result.","disputed":[],"related":[{"id":"2026-08-23-elliptic-curve-rank-record-31","url":"https://postcutoff.com/e/2026-08-23-elliptic-curve-rank-record-31/","date":"2026-08-23","date_precision":"day","short_title":"Claude-assisted search breaks the elliptic curve rank record","deck":"Rank 30, then 31","takeaway":"An elliptic curve over Q with rank at least 30 was reported on 20 Aug 2026 and one with rank ≥31 on 23 Aug. These broke the Elkies–Klagsbrun rank-29 record from 2024.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":3,"official":3,"filed":"2026-09-29","updated":"2026-09-29","orgs":["Anthropic"]},{"id":"2026-08-10-claude-riemann-zeta-zeros-two-thirds","url":"https://postcutoff.com/e/2026-08-10-claude-riemann-zeta-zeros-two-thirds/","date":"2026-08-10","date_precision":"day","short_title":"Claude proves more than two-thirds of Riemann zeta zeros are simple and on the critical line (up from 41.6%)","deck":null,"takeaway":"It does not prove the Riemann hypothesis, but it is a dramatic quantitative advance on the most famous problem in mathematics, and it was independently confirmed.","category":"science","category_label":"Science & math","importance":5,"confidence":"high","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":10,"official":9,"filed":"2026-09-29","updated":"2026-10-23","orgs":["Anthropic"]}],"people":[{"id":"levent-alpoge","name":"Levent Alpöge","url":"https://postcutoff.com/person/levent-alpoge/"}],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-10-21","type":"edit","text":"Added the independent verification and 16 new orders by Egan, Kotsireas, London and Ó Catháin (arXiv 2610.27175, Claude Opus 5.5 used extensively)"},{"date":"2026-09-29","type":"filed","text":"Created"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-09-29","run":null,"sources_read":null,"updated":"2026-10-21","human_review":null,"version":{"date":"2026-10-21"}},"gaps":[{"model_id":"gpt-6-astra","name":"GPT-6 Astra","cutoff":"2026-04","days_after":104,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":43,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":134,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":73,"in_training_data":false}],"short_url":null}