Tag
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.
Two research groups independently used OpenAI's GPT-5.6 Sol Ultra to help produce proofs for the same unclonable encryption problem, submitting nearly simultaneous arXiv preprints. The near collision illustrates AI's growing role in theoretical computer science and raises questions about independent discovery and credit.
The article discusses how LLMs can automate proof generation in dependently-typed languages like Lean and Rocq, making formal verification dramatically more practical by leveraging proof irrelevance and reducing the need for manual proof engineering.
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.