Levent Alpöge may have just dropped a solution to the smallest open Hadamard case (668) as an obfuscated shell script
Summary
Levent Alpöge has apparently used Claude to construct a 668x668 Hadamard matrix via an obfuscated shell script, potentially resolving the smallest open Hadamard case and all 12 unresolved orders below 2000, pending verification.
Similar Articles
Solution to Hadamard Matrix of Order 668 found by Anthropic Researcher using their internal model
An Anthropic researcher reported that Claude helped solve a Hadamard matrix of order 668, a long-standing open problem in combinatorics, potentially marking an AI-assisted breakthrough in the Hadamard conjecture.
Spent 3 months on an Erdős 993 problem with Claude Code + Codex. Found out today a full proof was posted last week.
A researcher reports spending three months running Claude Code and Codex on Erdős Problem #993 (unimodality of independent-set sequences in trees), only to learn that Tong Zhang and Wei Li posted a full proof last week, along with two Lean 4 formalizations that claim a clean build. The result is not yet peer-reviewed.
A claimed 100-page proof of the Hopf problem formalized into 250,000 lines of Lean code in just days
Levent Alpöge claimed a 100-page proof of the Hopf problem written with Claude, and Boris Alexeev from OpenAI formalized it into 250,000 lines of Lean code using Codex in just days.
@gdb: Sol Ultra for solving Erdős problems:
GPT-5.6 Sol Ultra has solved another Erdős problem (#793) with an extremely short and elegant construction, enhancing the original method used by Erdős.
Solving 20 Erdős Problems with 20 Codex Accounts Running in Parallel
Researchers used 20 parallel Codex accounts to solve 20 Erdős problems, including a formal proof of Erdős problem #123 in number theory using Lean.