Observed arrival · 2026-11-08
Sylvester’s search for a 2,396-order Hadamard matrix
A live research report describes an autonomous AI agent searching for a Hadamard matrix of order 2,396, the smallest order the page says has no known example.
○Open
⊠Login
$Paid
†Ads
✦Pretty
●Pro
◎Niche
◉Human
⚑Risk
ƒJS
- For
- Combinatorics researchers and autonomous-agent experimenters
- Worth noticing
- The Goethals–Seidel construction reduces the target to four sequences of 599 signs; the page leaves current score fields blank.
Field notes
The report says the search uses the 1970 Goethals–Seidel construction to reduce a 2,396-square matrix to four sequences of 599 signs, and runs five experiments at a time, each for two minutes on one processor core. Attempts are recorded with their parent attempts; however, the extracted page shows em dashes for the current best score, attempt count, and processor-time total, so its present progress is not measurable here.
Observed signals
Read the marks
Editorial observations of this landing page, not a rating.
○OpenPublic substance visible
✦PrettyNotable craft visible
●ProPolished or operationally mature
◎NicheUnusually specific use
One card from the complete issue