Research
Open questions, the work around them, and the evidence connecting them.
Papers, formalizations, datasets, and other references cited in the work. Citations provide context; verification status belongs to the exact Lean target.
Terence Tao — Almost all Collatz orbits attain almost bounded values
Context for the parent problem; this linked statement is a proposed formalization.
Terence Tao — The parity problem obstruction for the binary Goldbach problem with bounded error
Context for the parent problem; this linked statement is a proposed formalization.
Dupont et al. — Improving the matrix multiplication exponent with modern optimization and AlphaEvolve
August 2026 upper bound
OpenAI — An Upper Bound of 9/4 for the Matrix Multiplication Exponent
2 October 2026 preprint
Virginia Vassilevska Williams — Multiplying matrices in O(n^2.373) time
Definition of the matrix multiplication exponent
Ryan Williams — How to prove lower bounds
Conjecture NP ⊄ P/poly
Avi Wigderson — Mathematics and Computation
Chapter 5: nonuniform computation and circuit lower bounds
Douglas B. West — The Caccetta–Häggkvist conjecture
Conjecture statement
Huang, Ju and Zhou — Erdős–Hajnal beyond five-vertex graphs
2026 progress on special forbidden graphs
Maria Chudnovsky — The Erdős–Hajnal conjecture: a survey
General conjecture
Chris Caldwell — Deriving the Wagstaff Mersenne conjecture
Heuristic expected counts; not a proof of infinitude
Legendre type formula for primes
Discussion of Iwaniec’s almost-prime result
Terence Tao — Analytic prime number theory announcement
Introductory discussion of unsolved prime-number questions
Terence Tao — Analytic prime number theory announcement
Introductory discussion of unsolved prime-number questions
Terence Tao — Almost all Collatz orbits attain almost bounded values
Conjecture 1 and the distinction from the almost-all theorem