AWESOME AI PROOFS
Mathematics & statistics

AI Assisted
Mathematical Proofs

Problems, models, papers and formal proofs, with reported verification and known limitations.

336 records

Open a problem for its statement and individual attempts
Problems, reported evidence, subjects, models, dates, sources and additional information
Problem / reported evidenceSubject / tagsModel / AIDate / yearSourcesAdditional information
ResearchA CH obstruction to a prescribed categoricity threshold
machine-checked (formal proof)self-reported (formal proof)
Number theoryLogicFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA classification of finite Euclidean Ramsey configurations
machine-checked (formal proof)self-reported (formal proof)
Graph theoryAlgebraNumber theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA Complete Local Domain without a Small Cohen–Macaulay Module
machine-checked (formal proof)self-reported (formal proof)
AlgebraFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA continuum temperature singularity for a radial pair potential
machine-checked (formal proof)self-reported (formal proof)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA counterexample to Hadwiger's conjecture
machine-checked (counterexample)self-reported (counterexample)
Graph theoryAlgebraNumber theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA counterexample to integer-degree harmonic dimension comparison
machine-checked (counterexample)self-reported (counterexample)
GeometryAnalysisFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA Counterexample to Kaplansky's Direct-Finiteness Conjecture in Characteristic Two
machine-checked (counterexample)self-reported (counterexample)
AlgebraGroup theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA Counterexample to Kaplansky's Direct-Finiteness Conjecture in Odd Characteristic
machine-checked (counterexample)self-reported (counterexample)
AlgebraGroup theoryNumber theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA counterexample to Kaplansky's quasitrace conjecture and failure of tensor-product stable finiteness
machine-checked (counterexample)self-reported (counterexample)
AlgebraGroup theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA counterexample to Ryser's covering conjecture
machine-checked (counterexample)self-reported (counterexample)
Graph theoryCombinatoricsAlgebraNumber theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA counterexample to Tachikawa's second conjecture
machine-checked (counterexample)self-reported (counterexample)
AlgebraGroup theoryGeometryLogicFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA Counterexample to the Group-Ring Determinant Conjecture
machine-checked (counterexample)self-reported (counterexample)
AlgebraGroup theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA Counterexample to the Infinite Matroid Packing/Covering Conjecture
machine-checked (counterexample)self-reported (counterexample)
CombinatoricsAlgebraFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA Cyclic Polytabloid Proof of Saxl's Conjecture
machine-checked (formal proof)self-reported (formal proof)
Group theoryGeometryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA Direct Proof of Optimal Max-Cut Hardness
machine-checked (formal proof)self-reported (formal proof)
Graph theoryTheoretical computer scienceFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA direct proof of the complete Crouzeix inequality
machine-checked (formal proof)self-reported (formal proof)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA doubling Hilbert subset with no finite-dimensional bi-Lipschitz embedding
machine-checked (formal proof)self-reported (formal proof)
Functional analysisFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA Fock-space inequality and the Laughlin spectral gap
machine-checked (formal proof)self-reported (formal proof)
Number theoryFunctional analysisFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA hyperbolic group with no geometric CAT(0) action
machine-checked (formal proof)self-reported (formal proof)
CombinatoricsGroup theoryGeometryTopologyFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA linear cycle-and-edge decomposition of every graph
machine-checked (formal proof)self-reported (formal proof)
Graph theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA logarithmic independence bound for clique-free graphs
machine-checked (formal proof)self-reported (formal proof)
Graph theoryAlgebraFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA negatively pinched Kähler threefold without bounded holomorphic coordinates
machine-checked (formal proof)self-reported (formal proof)
AlgebraGeometryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA nine-dimensional counterexample to Borsuk's covering assertion
machine-checked (counterexample)self-reported (counterexample)
CombinatoricsAlgebraGeometryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA nonspectrahedral hyperbolicity cone
machine-checked (formal proof)self-reported (formal proof)
GeometryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA Polynomial-Time 2-Approximation for Shortest Common Superstring
machine-checked (formal proof)self-reported (formal proof)
AlgebraTheoretical computer scienceFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA positive solution to Tingley's problem
machine-checked (formal proof)self-reported (formal proof)
CombinatoricsFunctional analysisFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA product counterexample to the simplex maximum for projection-body volume
machine-checked (counterexample)self-reported (counterexample)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA proof of Seymour’s second-neighborhood conjecture
machine-checked (formal proof)self-reported (formal proof)
Graph theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA quadratic bound for Jacobsthal's function
machine-checked (formal proof)self-reported (formal proof)
Number theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA radial continuum phase transition with algebraic decay
machine-checked (formal proof)self-reported (formal proof)
AlgebraFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA single-lattice covering bound of order n log n
machine-checked (formal proof)self-reported (formal proof)
CombinatoricsAlgebraFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA Smooth Metric with No Local Isometric Immersion into Three-Space
machine-checked (formal proof)self-reported (formal proof)
GeometryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA stable coordinate that is not a coordinate in four variables
machine-checked (formal proof)self-reported (formal proof)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA strict inverse-first-power bound for univalent functions
machine-checked (formal proof)self-reported (formal proof)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA superquadratic separation between sensitivity and block sensitivity
machine-checked (formal proof)self-reported (formal proof)
Theoretical computer scienceFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA Three-Manifold Without Conjugate Points and Without a Nonpositively Curved Metric
machine-checked (formal proof)self-reported (formal proof)
GeometryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA Torsion-Free Group Algebra with Zero Divisors
machine-checked (formal proof)self-reported (formal proof)
AlgebraGroup theoryNumber theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA torsion-free hyperbolic group that is not residually finite
machine-checked (formal proof)self-reported (formal proof)
AlgebraGroup theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA translational tile with no fully periodic tiling in dimension three
machine-checked (formal proof)self-reported (formal proof)
CombinatoricsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchA universal group of type F∞
machine-checked (formal proof)self-reported (formal proof)
Group theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchAdditive hardness and unbounded configuration gaps in bin packing
machine-checked (formal proof)self-reported (formal proof)
CombinatoricsAlgebraNumber theoryTheoretical computer scienceFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchAlmost-everywhere Fourier convergence in L log L
machine-checked (formal proof)self-reported (formal proof)
GeometryAnalysisFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchAmple rank-two bundles on the quadric surface without Griffiths-positive metrics
machine-checked (formal proof)self-reported (formal proof)
GeometryTopologyFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchAn algebra of infinite little finitistic dimension
machine-checked (formal proof)self-reported (formal proof)
AlgebraFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchAn Artin group with no geometric CAT(0) action
machine-checked (formal proof)self-reported (formal proof)
Group theoryGeometryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchAn Endpoint Gradient Bound for the Centered Disk Maximal Operator
machine-checked (formal proof)self-reported (formal proof)
Functional analysisAnalysisFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchAn explicit counterexample to the Auslander-Reiten conjecture
machine-checked (counterexample)self-reported (counterexample)
AlgebraGroup theoryLogicFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchAn explicit failure of complex affine-space cancellation
machine-checked (formal proof)self-reported (formal proof)
Number theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchAn explicit noncoordinate polynomial with affine three-space zero fibre
machine-checked (formal proof)self-reported (formal proof)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchAn explicit power saving for the exact discrete Fourier transform
machine-checked (formal proof)self-reported (formal proof)
Number theoryAnalysisTheoretical computer scienceFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchAn exponential state lower bound for two-way nondeterministic complementation
machine-checked (formal proof)self-reported (formal proof)
Number theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchAn exponential two-way deterministic state lower bound for one-way liveness
machine-checked (formal proof)self-reported (formal proof)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchAn infinite finitely presented simple amenable group
machine-checked (formal proof)self-reported (formal proof)
Group theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchAn Upper Bound of 9/4 for the Matrix Multiplication Exponent
machine-checked (formal proof)self-reported (formal proof)
Number theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchApproximate counting of common bases of two matroids
machine-checked (formal proof)self-reported (formal proof)
CombinatoricsProbabilityTheoretical computer scienceFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchAsymptotic midpoint uniform convexity and unbounded diamond distortion in a reflexive tree space
machine-checked (formal proof)self-reported (formal proof)
Graph theoryFunctional analysisFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchAsymptotically minimal maxima of real Littlewood polynomials
machine-checked (formal proof)self-reported (formal proof)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchAverage sensitivity of polynomial threshold functions
machine-checked (formal proof)self-reported (formal proof)
Theoretical computer scienceFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchBackward intertwiners and a transitive commutant
machine-checked (formal proof)self-reported (formal proof)
AlgebraFunctional analysisFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchBeyond the Square-Root Exponent for Depth-Three Boolean Circuits
machine-checked (formal proof)self-reported (formal proof)
Theoretical computer scienceFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchBi-Lipschitz Absorption of c_0 Without a Linear Copy of c_0
machine-checked (formal proof)self-reported (formal proof)
GeometryFunctional analysisFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchBounded recovery for modular spectral averages
machine-checked (formal proof)self-reported (formal proof)
AlgebraFunctional analysisFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchBounded-Step Walks on Gaussian Primes
machine-checked (formal proof)self-reported (formal proof)
Graph theoryGroup theoryNumber theoryGeometryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchBrennan's conjecture and sharp inverse-square integral means
machine-checked (formal proof)self-reported (formal proof)
AlgebraFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchChoiceless polynomial time with counting does not capture polynomial time
machine-checked (formal proof)self-reported (formal proof)
LogicFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchClassical capacity and entropy inequalities for generalized amplitude damping
machine-checked (formal proof)self-reported (formal proof)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchCompatibility entropy and the spectrum of a Thorp sweep
machine-checked (formal proof)self-reported (formal proof)
Group theoryNumber theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchComplex Matrix Multiplication Below 2.258 and Rectangular Bounds
machine-checked (formal proof)self-reported (formal proof)
Number theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchConditional coordinate sweeps and analytic transfer
machine-checked (formal proof)self-reported (formal proof)
Number theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchCounterexamples to the duality conjecture for metric entropy
machine-checked (counterexample)self-reported (counterexample)
CombinatoricsAlgebraGeometryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchCritical bond and site percolation on the cubic lattice
machine-checked (formal proof)self-reported (formal proof)
Graph theoryProbabilityFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchCritical honeycomb chords with prescribed boundary endpoints
machine-checked (formal proof)self-reported (formal proof)
ProbabilityFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchCritical slowing down in the Sherrington–Kirkpatrick model
machine-checked (formal proof)self-reported (formal proof)
AlgebraProbabilityFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchDirectional transience implies ballisticity
machine-checked (formal proof)self-reported (formal proof)
ProbabilityFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchDistortion of countably branching diamonds from midpoint and tree energies
machine-checked (formal proof)self-reported (formal proof)
Graph theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchEntropy and Face Dimension of the Perfect-Matching Polytope
machine-checked (formal proof)self-reported (formal proof)
Graph theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchExact asymptotic moduli in a Daugavet subspace of L1
machine-checked (formal proof)self-reported (formal proof)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchExact derandomization of logarithmic space: L = RL = BPL
machine-checked (formal proof)self-reported (formal proof)
ProbabilityTheoretical computer scienceFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchExponential decay in two-dimensional classical O(n) models
machine-checked (formal proof)self-reported (formal proof)
Graph theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchFinite tensor savings and exact Fourier circuits
machine-checked (formal proof)self-reported (formal proof)
AnalysisTheoretical computer scienceFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchFixed Points of Nonexpansive Maps in Reflexive Banach Spaces
machine-checked (formal proof)self-reported (formal proof)
Functional analysisFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchGeneralized ionization energies for full Coulomb atoms
machine-checked (formal proof)self-reported (formal proof)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchGlobal classical solutions of the three-dimensional relativistic Vlasov–Maxwell system
machine-checked (formal proof)self-reported (formal proof)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchGlobal Support and Convex Injectivity Domains under Weak MTW
machine-checked (formal proof)self-reported (formal proof)
AlgebraGeometryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchHardness of finding large independent sets in three-colorable graphs
machine-checked (formal proof)self-reported (formal proof)
Graph theoryAlgebraNumber theoryTheoretical computer scienceFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchHarmonic heights and the Artin K(π,1) conjecture
machine-checked (formal proof)self-reported (formal proof)
Group theoryGeometryAnalysisFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchIndependent products in real L1: asymptotic midpoint convexity without AUC renormings
machine-checked (formal proof)self-reported (formal proof)
Graph theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchIntegral and fractional expectation thresholds are equivalent
machine-checked (formal proof)self-reported (formal proof)
Graph theoryCombinatoricsAlgebraFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchIntegral points on character varieties of curves
machine-checked (formal proof)self-reported (formal proof)
AlgebraFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchL_1 Embeddings of Graphs of Bounded Treewidth
machine-checked (formal proof)self-reported (formal proof)
Graph theoryGeometryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchLipschitz Equivalent Separable Banach Spaces Need Not Be Linearly Isomorphic
machine-checked (formal proof)self-reported (formal proof)
Functional analysisFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchMaximal Seshadri constants on arbitrary polarized surfaces
machine-checked (formal proof)self-reported (formal proof)
GeometryTopologyFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchMemory and precision in noiseless Gaussian regression
machine-checked (formal proof)self-reported (formal proof)
ProbabilityFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchMidpoint convexity from bounded tree potentials and path costs
machine-checked (formal proof)self-reported (formal proof)
Graph theoryFunctional analysisFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchMidpoint convexity from two recursive potentials
machine-checked (formal proof)self-reported (formal proof)
Graph theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchMidpoint lenses in segment spaces
machine-checked (formal proof)self-reported (formal proof)
GeometryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchNagata's conjecture for plane curves
machine-checked (formal proof)self-reported (formal proof)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchNear-square-root logarithmic integrality gaps for uniform sparsest cut
machine-checked (formal proof)self-reported (formal proof)
Number theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchNontrivial Markov Type Forces Superreflexivity
machine-checked (formal proof)self-reported (formal proof)
Functional analysisProbabilityFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchNonuniqueness for Bounded Measurable Scalar Conductivities in Three Dimensions
machine-checked (formal proof)self-reported (formal proof)
GeometryFunctional analysisFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchOptimal bound for the polynomial Littlewood–Offord problem
self-reported
CombinatoricsProbabilityTheoretical computer science
GPT-6 ProOct 6, 2026
Details

The preprint is unrefereed and unformalized, relying on author review and rewriting of the AI-discovered argument.

Attempts and sources →
ResearchPerfect completeness for 2-to-1 games
machine-checked (formal proof)self-reported (formal proof)
Number theoryTheoretical computer scienceFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchPetty’s projection-volume conjecture in dimensions at least four
machine-checked (formal proof)self-reported (formal proof)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchPlanar Graph Metrics Embed into L_1 with Constant Distortion
machine-checked (formal proof)self-reported (formal proof)
Graph theoryGeometryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchPolynomial Hitting Lists for Noncommutative Rational Formulas
machine-checked (formal proof)self-reported (formal proof)
Graph theoryNumber theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchPolynomial removal fails for ordered binary matrices
machine-checked (formal proof)self-reported (formal proof)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchPosterior replicas and conditional information in Gaussian regression
machine-checked (formal proof)self-reported (formal proof)
ProbabilityFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchPower-law violations of Yau's nodal upper bound
machine-checked (formal proof)self-reported (formal proof)
GeometryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchProduct-projection localization and the QAC⁰ parity lower bound
machine-checked (formal proof)self-reported (formal proof)
Theoretical computer scienceFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchProjection moments, positive cap domination, and Riesz estimates on the sphere
machine-checked (formal proof)self-reported (formal proof)
ProbabilityFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchQuadratic stabilization of the canonical Foulkes–Howe map
machine-checked (formal proof)self-reported (formal proof)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchQuantitative Superexponential Bounds for van der Waerden Numbers
machine-checked (formal proof)self-reported (formal proof)
Number theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchRandomized quasipolynomial-time mean-payoff games
machine-checked (formal proof)self-reported (formal proof)
ProbabilityTheoretical computer scienceFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchRegular trajectories, pruning and quantum parity
machine-checked (formal proof)self-reported (formal proof)
Theoretical computer scienceFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchRelative generation and the generator problem for finite factors
machine-checked (formal proof)self-reported (formal proof)
AlgebraFunctional analysisFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchReplacing Gaussian observations in memory-constrained inference
machine-checked (formal proof)self-reported (formal proof)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchRiesz transforms and uniform rectifiability in higher codimension
machine-checked (formal proof)self-reported (formal proof)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchRigidity of the Turing degrees
machine-checked (formal proof)self-reported (formal proof)
AlgebraTheoretical computer scienceFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchRouting densities and representation contraction for Thorp sweeps
machine-checked (formal proof)self-reported (formal proof)
AlgebraGroup theoryNumber theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchSharp binary-information contraction on the discrete cube
machine-checked (formal proof)self-reported (formal proof)
AlgebraGroup theoryGeometryTheoretical computer scienceFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchSharp one-dimensional Lieb–Thirring constants
machine-checked (formal proof)self-reported (formal proof)
AlgebraFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchShort Egyptian fractions
machine-checked (formal proof)self-reported (formal proof)
Number theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchSimulating One-Tape Time in Two-Fifths-Power Space
machine-checked (formal proof)self-reported (formal proof)
CombinatoricsAlgebraNumber theoryTheoretical computer scienceFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchSingle-exponential recovery and bounded-price strictness for metric k-median
machine-checked (formal proof)self-reported (formal proof)
Number theoryGeometryProbabilityTheoretical computer scienceFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchSingle-fold Diophantine representations
machine-checked (formal proof)self-reported (formal proof)
Number theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchSmooth counterexamples to Yau's nodal upper bound in dimensions three and four
machine-checked (counterexample)self-reported (counterexample)
GeometryTopologyFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchSquarefree values of quartics and power-free values of polynomials
machine-checked (formal proof)self-reported (formal proof)
Number theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchStaggered extraction for exact matrix multiplication over every field
machine-checked (formal proof)self-reported (formal proof)
Number theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchStrict convexity and differentiability of the planar exponential first-passage limit shape
machine-checked (formal proof)self-reported (formal proof)
GeometryProbabilityFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchSubpolynomial dimension reduction in L_p
machine-checked (formal proof)self-reported (formal proof)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchSubpolynomial query complexity for well-conditioned log-concave sampling
machine-checked (formal proof)self-reported (formal proof)
ProbabilityTheoretical computer scienceLogicFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchSubsphere methods for memory–sample lower bounds in noiseless Gaussian regression
machine-checked (formal proof)self-reported (formal proof)
ProbabilityFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchSymmetry of semialgebraic bounded domains with compact quotient
machine-checked (formal proof)self-reported (formal proof)
AlgebraGroup theoryGeometryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchSymplectic Balls in Symmetric Polar Products
machine-checked (formal proof)self-reported (formal proof)
GeometryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchTalagrand's discrete-convexity conjecture
machine-checked (formal proof)self-reported (formal proof)
Graph theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchTaming implies compatibility on four-manifolds
machine-checked (formal proof)self-reported (formal proof)
GeometryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe Bass trace conjecture and the characteristic-zero Kaplansky idempotent conjecture
machine-checked (formal proof)self-reported (formal proof)
AlgebraGroup theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe circulant Hadamard conjecture
machine-checked (formal proof)self-reported (formal proof)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe complete Crouzeix theorem: optimal similarity and a common positive boundary representation
machine-checked (formal proof)self-reported (formal proof)
AlgebraNumber theoryFunctional analysisFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe cotype–cotype conjecture under the approximation property
machine-checked (formal proof)self-reported (formal proof)
Functional analysisTheoretical computer scienceFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe crossing number of complete bipartite graphs
machine-checked (formal proof)self-reported (formal proof)
Graph theoryNumber theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe crossing number of complete graphs
machine-checked (formal proof)self-reported (formal proof)
Graph theoryNumber theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe Deligne-Drinfeld conjecture
machine-checked (formal proof)self-reported (formal proof)
AlgebraNumber theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe entropy-rate dimension formula for self-similar measures on the line
machine-checked (formal proof)self-reported (formal proof)
ProbabilityFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe Euclidean plane is not five-colorable
machine-checked (formal proof)self-reported (formal proof)
Graph theoryAlgebraNumber theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe Euclidean Steinitz–Bergström theorem
machine-checked (formal proof)self-reported (formal proof)
AlgebraFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe Factor-Two Hardness Threshold for Vertex Cover
machine-checked (formal proof)self-reported (formal proof)
Graph theoryTheoretical computer scienceFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe Falconer distance conjecture in all dimensions
machine-checked (formal proof)self-reported (formal proof)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe Gaussian propeller bound in every dimension
machine-checked (formal proof)self-reported (formal proof)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe Grothendieck homotopy hypothesis via elementary expansions
machine-checked (formal proof)self-reported (formal proof)
Group theoryTopologyFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe Kirchberg–Rørdam character criterion
machine-checked (formal proof)self-reported (formal proof)
AlgebraFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe logarithmic Brunn–Minkowski conjecture
machine-checked (formal proof)self-reported (formal proof)
GeometryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe maximal triangular Hilbert transform at the symmetric point
machine-checked (formal proof)self-reported (formal proof)
GeometryFunctional analysisFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe Partition Principle does not imply Choice
machine-checked (formal proof)self-reported (formal proof)
GeometryLogicFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe Quasi-Riemann Hypothesis: A Zero-Free Half-Plane Re(s)>7/8
machine-checked (formal proof)self-reported (formal proof)
Number theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe second Kahn–Kalai conjecture
machine-checked (formal proof)self-reported (formal proof)
Graph theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe sharp factor-of-IID threshold for the free Ising model on regular trees
machine-checked (formal proof)self-reported (formal proof)
Graph theoryProbabilityFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe strong thin tree conjecture
machine-checked (formal proof)self-reported (formal proof)
Graph theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe Subcritical Hénon–Lane–Emden Conjecture
machine-checked (formal proof)self-reported (formal proof)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe symmetric Mahler conjecture and its equality cases
machine-checked (formal proof)self-reported (formal proof)
GeometryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe trace cone classifies Razak–Jacelon stabilizations
machine-checked (formal proof)self-reported (formal proof)
AlgebraFunctional analysisLogicFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe Unique Games Theorem
machine-checked (formal proof)self-reported (formal proof)
Theoretical computer scienceFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThe weak pinned planar distance theorem
machine-checked (formal proof)self-reported (formal proof)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThompson's group F is nonamenable
machine-checked (formal proof)self-reported (formal proof)
Group theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThree fixed points on the symplectic quadric threefold
machine-checked (formal proof)self-reported (formal proof)
Number theoryGeometryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchThreshold parallel repetition for finite-dimensional entangled games
machine-checked (formal proof)self-reported (formal proof)
ProbabilityFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchTracial projection methods and uniform property Γ
machine-checked (formal proof)self-reported (formal proof)
AlgebraFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchTwo limit cycles for quintic Liénard systems
machine-checked (formal proof)self-reported (formal proof)
Graph theoryGeometryFunctional analysisFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchUniform Bi-Hölder Transport from Weak MTW
machine-checked (formal proof)self-reported (formal proof)
GeometryProbabilityFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchUniform Cartier sections for Fano type contractions
machine-checked (formal proof)self-reported (formal proof)
Number theoryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchUniform exclusion of Landau–Siegel zeros
machine-checked (formal proof)self-reported (formal proof)
Pure mathematicsFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchUnitarizability implies amenability for discrete groups
machine-checked (formal proof)self-reported (formal proof)
Group theoryFunctional analysisFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchUniversal-cover splitting for compact Kähler manifolds
machine-checked (formal proof)self-reported (formal proof)
GeometryTopologyFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchWeak Hessian bounds along every geodesic in RCD spaces
machine-checked (formal proof)self-reported (formal proof)
GeometryFormal verification
OpenAI (unreleased)Oct 6, 2026
Details

Reported in OpenAI's math repository with a machine-checked Lean formalization of the main theorem. The repository's formal artifacts are self-assessed and have not been independently audited or rebuilt for this catalogue.

Attempts and sources →
ResearchLinear Hadwiger conjecture for graph colouring
machine-checkedself-reported
Graph theoryCombinatoricsFormal verification
GPT-6 AstraOct 4, 2026
Details

The preprint is unrefereed by journal reviewers. The authors provide a Lean 4 formalization of the main theorem in an associated repository, but the formal build has not been independently reproduced for this catalogue.

Attempts and sources →
ResearchAmenable actions of free groups on unital simple AF-algebras
self-reported
Operator algebrasTopological dynamicsGroup theory
GPT-6 AstraOct 1, 2026
Details

The preprint is unrefereed and unformalized, with no independent check recorded.

Attempts and sources →
ResearchExponential upper-bound constant for diagonal Ramsey numbers
self-reporteddisputed (certificate)
CombinatoricsGraph theory
GPT-5.4 ProGPT-5.6 Sol MaxClaude2026–Sep 29, 2026
Details

Only the HorizonMath certificate for 3.6961 is recorded here. What is contested is that certificate, not the inequality; whether R(k,k) ≤ 3.6961^(k+o(k)) holds is not decided by it. Other recent bounds on this constant are not catalogued in this entry.

Attempts and sources →
ResearchYao's two-probe implicit membership problem
self-reported (bound improvement)
Theoretical computer scienceData structuresRamsey theory
ChatGPT 5.5 ProSep 23, 2026
Details

The improvement applies to the two-probe upper bound in the full-table model. The preprint is unrefereed and unformalized.

Attempts and sources →
ResearchPartial list colouring conjecture of Albertson–Grossman–Haas
self-reported (counterexample)
Graph theoryCombinatorics
ChatGPT 6 Astra UltraSep 20, 2026
Details

The preprint presents an explicit 14-vertex counterexample. It is an unrefereed preprint without a formal theorem prover artifact, though the finite search and graph properties are directly testable.

Attempts and sources →
ResearchReduction of Zieve's conjecture on the Hurwitz existence problem
self-reported (reduction)
Algebraic geometryGroup theoryCombinatorics
GPT-5.6 SolGPT-6 AstraSep 20, 2026
Details

The paper proves a reduction to the three-branch-point case rather than proving the full conjecture unconditionally. The preprint is unrefereed and unformalized.

Attempts and sources →
ResearchHinrichs–Vybíral positive-definite kernel lower bound
self-reported (counterexample)
AnalysisLinear algebraApproximation theory
ChatGPT 6Claude Opus 5Sep 18, 2026
Details

The preprint provides an explicit 8-point counterexample in seven dimensions. The paper has not undergone formal peer review or computer verification in an interactive theorem prover, though the finite arithmetic is directly checkable.

Attempts and sources →
ResearchTalagrand's operator cotype problem
self-reported (counterexample)
Functional analysisProbabilityBanach spaces
ChatGPT (GPT-5.6)Sep 17, 2026
Details

The preprint is unrefereed, unformalized, and relies on author calculation and verification.

Attempts and sources →
ResearchPierce–Birkhoff conjecture for piecewise polynomial functions
self-reported (counterexample)
AlgebraReal algebraic geometry
GPT-5.6GPT-6Claude Opus 5Claude Fable 5.1Sep 9, 2026
Details

The counterexample is an explicit continuous piecewise quadratic function on a semialgebraic partition of Euclidean space. The preprint is unrefereed and unformalized, with verification based on author checks and symbolic validation.

Attempts and sources →
ResearchFinite-time singularity for smooth three-dimensional Euler flow
machine-checkedself-reported
Partial differential equationsAnalysisMathematical physicsFormal verification
OpenAI (unreleased)GPT-6 AstraSep 8, 2026
Details

This very recent preprint is unrefereed and has not yet received broad specialist review. Its smooth, unforced result is distinct from earlier lower-regularity blowup constructions and from the concurrent forced-Euler work of Alpöge and Buckmaster. The public Lean project reports a full formalization, but its review status is self-assessed and the build has not been reproduced for this catalogue.

Attempts and sources →
ResearchNavier–Stokes existence and smoothness, forced finite-time blowup
machine-checkedself-reporteddisputed (attribution and provenance)
Partial differential equationsAnalysisMathematical physicsFormal verification
OpenAI (unreleased)GPT-6 AstraCodexSep 8, 2026
Details

This is a same-day release, not yet peer reviewed or broadly accepted by specialists. The construction uses smooth external forcing, exactly as allowed by alternatives C and D of the official Millennium Prize formulation; it does not establish unforced blowup. OpenAI does not intend to claim the prize. The public Lean project reports full, sorry-free coverage, but its review status is self-assessed and the build has not been reproduced for this catalogue.

Attempts and sources →
ResearchFermat's Last Theorem, end-to-end Lean formalization
verified (formalization)machine-checked (formalization)
Number theoryFormal verification
Anthropic research modelSep 4, 2026
Details

This is an AI-produced formalization of existing mathematics, not a new proof strategy or a new theorem. It builds on the Imperial College FLT project, flt-regular and Mathlib, and reproducing the independent checks requires substantial compute.

Attempts and sources →
ResearchErdős–Sós tree-embedding conjecture, benchmark formulation (Erdős
machine-checked (formal benchmark statement)self-reported (formal benchmark statement)
Graph theoryCombinatoricsFormal verification
GPT-6 AstraSep 3, 2026
Details

The compared Lean theorem uses at least (k-1)n/2 + 1 edges. When (k-1)n is odd this is one edge stronger than the sharp classical hypothesis, so it is a marginally weaker result than the full conjecture.

Attempts and sources →
ResearchKöthe conjecture via Krempa's matrix formulation
machine-checked (matrix-form counterexample)self-reported (matrix-form counterexample)
AlgebraRing theoryFormal verification
GPT-6 AstraSep 3, 2026
Details

Lean checks a counterexample to the matrix formulation. The classical implication from that formulation to Köthe's original statement is described but is not part of the formal development, and no independent ring-theory review is recorded.

Attempts and sources →
ResearchDaykin–Frankl conjecture for convex subsets of the Boolean lattice
self-reported
CombinatoricsOrder theory
GPT-5.6 Sol ProSep 2, 2026
Details

The four-page preprint is unrefereed, has no formal artifact, and records author verification but no independent check.

Attempts and sources →
ResearchQuantum-oracle separation between QMA(2) and QMA
self-reported
Quantum computingComplexity theory
ChatGPT 5.6 SolSep 2, 2026
Details

The result is relative to a quantum oracle and does not separate QMA(2) from QMA in the unrelativized setting. The preprint is not formally verified or independently reviewed.

Attempts and sources →
ResearchSmooth counterexample to the Trautman conjecture
self-reported
Complex analysisDifferential geometry
ChatGPT PlusSep 2, 2026
Details

This is a preliminary, unrefereed preprint without formalization or independent review.

Attempts and sources →
ResearchKourovka 21.29: Common neighbours in generalized Saxl graphs
machine-checked (every-base-size counterexamples)self-reported (every-base-size counterexamples)
Group theoryCombinatoricsFormal verification
CodexChatGPT ProClaudeSep 1, 2026
Details

The Lean artifact reportedly covers existence of counterexamples at every base size, but not all additional base-two families or diameter computations; no third party audited statement-to-paper fidelity.

Attempts and sources →
ResearchMcKean's entropy-production monotonicity question for the Boltzmann equation
self-reported
AnalysisPartial differential equationsMathematical physics
ChatGPT 5.6 SolClaudeSep 1, 2026
Details

The counterexamples do not settle the corresponding question for the Landau equation. The preprint is unrefereed, unformalized and lacks an independent check.

Attempts and sources →
ResearchCatalan’s constant: disputed AI-assisted irrationality proof
self-reported (claimed proof)disputed (claimed proof)
Number theoryAnalysis
ChatGPT 5.6 SolarSep 2026
Details

The preprint is disputed. A public technical objection alleges an inconsistent recurrence factor that invalidates the zero count used for the degree bound; the only whole-proof verification claimed in the paper is another language-model reading.

Attempts and sources →
ResearchFewer multiplications for 4 × 4 matrices
verifiedverified (audit)
AlgebraAlgorithms
AlphaTensorAlphaEvolveClaudeOct 5, 2022–Sep 2026
Details

The field matters: the 47-multiplication result is over F₂; the later characteristic-zero construction is a different claim. Neither establishes optimality.

Attempts and sources →
ResearchStable forking conjecture in simple theories
self-reported
LogicModel theory
ChatGPT 5.6 SolAug 31, 2026
Details

The preprint is unrefereed and unformalized, with no independent check recorded. The authors supplied the known structural constraints and wrote the proofs and manuscript.

Attempts and sources →
ResearchUnrestricted Boolean multiplicative complexity of four-term polynomial multiplication
machine-checkedself-reported
Complexity theoryAlgebraFormal verification
GPT-5.6 SolClaude Opus 5Aug 31, 2026
Details

The result settles this natural function, not the general Boyar–Find question. The Lean statements have not received a recorded third-party semantic audit.

Attempts and sources →
ResearchVanishing percolation probability at criticality in every dimension
machine-checked (formal gluing conjecture)self-reported (formal gluing conjecture)
ProbabilityPercolation theoryFormal verification
Anthropic ClaudeAug 28, 2026
Details

The claimed Lean development survives at a pinned commit rather than the repository's main branch. It proves a gluing conjecture reported to imply the percolation result; statement fidelity and the implication have not been independently audited here.

Attempts and sources →
ResearchHeyting algebras as subterminal lattices of elementary toposes
self-reported
LogicCategory theory
ChatGPT 5.6 SolAug 27, 2026
Details

The short preprint is unrefereed, unformalized and has no independent check; the AI disclosure does not assign individual proof steps.

Attempts and sources →
ResearchHyperbolic surfaces with large systoles in every large genus
self-reported
GeometryTopology
GPT-5.6 SolAug 27, 2026
Details

The preprint is unrefereed, unformalized and has no independent check recorded.

Attempts and sources →
ResearchNevanlinna's three-omitted-values question in a half-plane
self-reported
Complex analysis
GPT-5.6 Sol UltraAug 26, 2026
Details

The preprint is unrefereed, unformalized and has no independent check recorded.

Attempts and sources →
ResearchImproved record lower bound for large prime gaps (Erdős
verified (improved bound)self-reported (improved bound)
Number theory
GPT-5.6 SolAug 25, 2026
Details

This is an improvement to the record bound associated with Erdős

Attempts and sources →
ResearchComplex structure on the six-sphere: contested AI-assisted claim
self-reported (claimed result)disputed (claimed result)
Complex geometryDifferential geometry
ClaudeAug 23, 2026
Details

This is an unreviewed claim in a problem with many failed proofs. The manuscript explicitly conflicts with a published corrigendum, contains no AI disclosure itself, and the AI attribution is only from a public author statement.

Attempts and sources →
ResearchBounded mass property on the Hopf threefold
self-reported
Complex analysisAlgebraic geometryDifferential geometry
RethlasGPT-5.6 SolAug 21, 2026
Details

The unrefereed preprint has no formalization or independent check, and the disclosure credits the AI agent with the initial counterexample rather than every part of the final proof.

Attempts and sources →
ResearchFirst open case of the big-line-big-clique conjecture
self-reported (first open case)
CombinatoricsDiscrete geometry
GPT-5.6 Sol ProAug 19, 2026
Details

This settles only the (4,6) case, with an enormous explicit threshold. The preprint is unrefereed, unformalized and has no independent check.

Attempts and sources →
ResearchBounded prime gaps of 246, Lean formalization
machine-checked (conditional formalization)self-reported (conditional formalization)
Number theoryFormal verification
AxiomProverAug 18, 2026
Details

This is a formalization of an existing theorem, not a new prime-gap bound. The public flagship Lean theorem assumes Bombieri–Vinogradov as a hypothesis because that theorem is not yet in Mathlib.

Attempts and sources →
ResearchDimension-free weak-type bound for the vector Riesz transform
self-reported
AnalysisPartial differential equations
GPT-5.6 SolClaude Opus 5DanusRethlasAug 18, 2026
Details

The preprint is unrefereed, unformalized and has no independent check recorded.

Attempts and sources →
ResearchBerlekamp’s temperature bound for Domineering
self-reported
Combinatorial game theory
GPT-5.6 ProAug 14, 2026
Details

Formal coverage is reported as partial, and the bundled audits are not independent replication.

Attempts and sources →
ResearchMinimizers in Gamow's liquid drop model
self-reported
Calculus of variationsGeometric analysisMathematical physics
ChatGPT 5.6 ProAug 12, 2026
Details

The preprint is unrefereed and unformalized. The authors checked and reworked the proof, but no independent review is recorded.

Attempts and sources →
ResearchSendov’s conjecture
verifiedmachine-checked
Complex analysis
ProofAtlasClaude Opus 5Aug 12, 2026
Details

Verification details are reported in the sources; proof artifacts have not been rebuilt for this catalogue.

Attempts and sources →
ResearchProportion of zeta zeros on the critical line
machine-checked
Number theoryAnalysis
Anthropic (unreleased)Aug 10, 2026
Details

A positive proportion on the critical line is not a proof of the Riemann hypothesis.

Attempts and sources →
ResearchSparse additive bases for sets of density zero (Erdős #333)
self-reporteddebunked (novelty claim)
Number theoryCombinatorics
AletheiaGPT-5.2Jan 2026–Aug 3, 2026
Details

Existing literature already contains a solution.

Attempts and sources →
ResearchApproximation hardness of the closest vector problem
machine-checkedself-reported
Complexity theory
OpenAI (unreleased)Aug 1, 2026
Details

Reported by OpenAI; peer review and local proof rebuild are not recorded.

Attempts and sources →
ResearchArithmetic complexity of the permanent
machine-checkedself-reported
Complexity theory
OpenAI (unreleased)Aug 1, 2026
Details

Reported by OpenAI; peer review and local proof rebuild are not recorded.

Attempts and sources →
ResearchAsymptotic size of binary codes
machine-checkedself-reported
Coding theory
OpenAI (unreleased)Aug 1, 2026
Details

Reported by OpenAI; peer review and local proof rebuild are not recorded.

Attempts and sources →
ResearchAsymptotic sphere-packing density
machine-checkedself-reported
Discrete geometry
OpenAI (unreleased)Aug 1, 2026
Details

Reported by OpenAI; peer review and local proof rebuild are not recorded.

Attempts and sources →
ResearchCollatz: an invalid machine-checked disproof
debunked
Number theoryFormal verification
Not specifiedAug 1, 2026
Details

This episode is not a disproof of Collatz. A kernel implementation bug invalidated the certificate; checker versions matter.

Attempts and sources →
ResearchConnes’s rigidity conjecture
machine-checkedself-reporteddisputed
Operator algebras
OpenAI (unreleased)Aug 1, 2026
Details

The original notes report a novelty and attribution dispute, rather than an allegation that the proof is wrong. See the linked coverage.

Attempts and sources →
ResearchEhrhart’s volume conjecture
machine-checkedself-reported
Discrete geometry
OpenAI (unreleased)Aug 1, 2026
Details

Reported by OpenAI; peer review and local proof rebuild are not recorded.

Attempts and sources →
ResearchErdős #146: extremal compactness
machine-checkedself-reported
Graph theory
OpenAI (unreleased)Aug 1, 2026
Details

Reported by OpenAI; peer review and local proof rebuild are not recorded.

Attempts and sources →
ResearchErdős #180: extremal degeneracy
machine-checkedself-reported
Graph theory
OpenAI (unreleased)Aug 1, 2026
Details

Reported by OpenAI; peer review and local proof rebuild are not recorded.

Attempts and sources →
ResearchErdős #183: multicolour triangle Ramsey numbers
machine-checkedself-reported
Graph theory
OpenAI (unreleased)Aug 1, 2026
Details

Reported by OpenAI; peer review and local proof rebuild are not recorded.

Attempts and sources →
ResearchExistence of a non-sofic group
machine-checkedself-reporteddisputed
Group theory
OpenAI (unreleased)Aug 1, 2026
Details

The original notes report a novelty and attribution dispute, rather than an allegation that the proof is wrong. See the linked coverage.

Attempts and sources →
ResearchParallel repetition for quantum games
machine-checkedself-reporteddisputed
Quantum computing
OpenAI (unreleased)Aug 1, 2026
Details

An independent audit found a polarity error in a printed greedy-conditioning lemma and supplied a local repair. The correction does not independently verify the later sampleability, alignment, rounding or main parallel-repetition arguments; the Lean artifact was not rebuilt here.

Attempts and sources →
ResearchUpper bounds for spherical codes
machine-checkedself-reported
Coding theory
OpenAI (unreleased)Aug 1, 2026
Details

Reported by OpenAI; peer review and local proof rebuild are not recorded.

Attempts and sources →
ResearchHan’s conjecture on Hochschild homology
self-reported
AlgebraAlgebraic geometry
GPT-5.6 Sol UltraAug 2026
Details

The authors report checking the arguments and references themselves. This entry does not assert external peer review or machine verification.

Attempts and sources →
ResearchHeil–Ramanathan–Topiwala conjecture
verified
Analysis
GPT-5.6 ProAug 2026
Details

Verification details are reported in the sources; proof artifacts have not been rebuilt for this catalogue.

Attempts and sources →
ResearchJacobian conjecture in characteristic zero
verifiedmachine-checked
Algebraic geometry
Claude Fable 5Aug 2026
Details

The notes report a higher-dimensional counterexample; the two-dimensional question is separate.

Attempts and sources →
ResearchPresentation of the absolute Galois group of Q₂
machine-checkedself-reported
Number theoryAlgebra
Claude Fable 5GPT-5.5 ProJul 26, 2026
Details

The notes describe conditional Lean developments with unformalized classical inputs, not unconditional certificates.

Attempts and sources →
ResearchIs a finite free group scheme killed by its order?
machine-checked
Algebraic geometry
CodexClaudeJul 20, 2026
Details

Verification details are reported in the sources; proof artifacts have not been rebuilt for this catalogue.

Attempts and sources →
ResearchCycle double cover conjecture
verifiedmachine-checked
Graph theory
GPT-5.6 Sol UltraJul 2026
Details

Verification details are reported in the sources; proof artifacts have not been rebuilt for this catalogue.

Attempts and sources →
ResearchErdős–Szemerédi sum-product conjecture over the reals
self-reported
CombinatoricsNumber theory
GPT-5.5 ProJul 2026
Details

This is a source-reported AI reproof following a human disproof, not a claim of first discovery. The domain is the real numbers. The reported seven successes out of eight trials were not independently graded here.

Attempts and sources →
ResearchFeige’s small-deviation conjecture
machine-checked
ProbabilityStatistics
GPT-5.6 ProJul 2026
Details

The paper covers slack δ ≥ 1; the linked Lean coverage is reported as δ = 1 only. Do not label the whole theorem Lean-verified without an audit.

Attempts and sources →
ResearchKourovka 18.50: Number of distinct permuted products
verifiedmachine-checked
Group theory
AristotleJul 2026
Details

Lean coverage is reported; no local rebuild was performed.

Attempts and sources →
ResearchKourovka 19.25: Simplicity from group order and totient sum
verifiedmachine-checked
Group theory
AristotleJul 2026
Details

The notes report native_decide use in this artifact.

Attempts and sources →
ResearchKourovka 20.125: Surjective Rota–Baxter operators
verifiedmachine-checked
Group theory
AristotleJul 2026
Details

Lean coverage is reported; no local rebuild was performed.

Attempts and sources →
ResearchKourovka 21.147: Right-relatively convex subgroup lattices
verifiedmachine-checked
Group theory
AristotleJul 2026
Details

Lean coverage is reported; no local rebuild was performed.

Attempts and sources →
ResearchKourovka 21.150: Rank bound for p-group extensions
verifiedmachine-checked
Group theory
AristotleJul 2026
Details

The notes report native_decide use in this artifact.

Attempts and sources →
ResearchKourovka 21.24: Cograph power graphs and chordality
verifiedmachine-checked
Group theory
AristotleJul 2026
Details

Lean coverage is reported; no local rebuild was performed. Rundström reportedly found an independent solution concurrently.

Attempts and sources →
ResearchKourovka 21.8: Groups generated by class transpositions
verifiedmachine-checked
Group theory
AristotleJul 2026
Details

The notes report native_decide use in this artifact.

Attempts and sources →
ResearchKourovka 3.46: Number of maximal locally soluble normal subgroups
verifiedmachine-checked
Group theory
AristotleJul 2026
Details

Lean coverage is reported; no local rebuild was performed.

Attempts and sources →
ResearchNon-Calkin unital Banach algebras
self-reported
Functional analysis
GPT-5.5 ProJul 2026
Details

Human reading only; no formalization is listed.

Attempts and sources →
ResearchPrimariness of Lp(L1)
self-reported
Functional analysis
GPT-5.5 ProJul 2026
Details

Human reading only; no formalization is listed.

Attempts and sources →
ResearchSaturated Newton polytopes of Vandermonde powers
machine-checked
AlgebraCombinatorics
CodexJul 2026
Details

The linked Lean development is reported to check a seed identity, not the complete theorem.

Attempts and sources →
ResearchSharp thin-shell variance bound for log-concave distributions
self-reported
ProbabilityStatisticsConvex geometry
GPT-5.6 ProJul 2026
Details

The reported bound is Var(|X|²) ≤ 8n under the stated isotropy and log-concavity assumptions. AI worked from human-supplied prompts and mathematical context. No formal artifact is listed.

Attempts and sources →
ResearchStrict cosingularity and adjoints
self-reported
Functional analysis
GPT-5.5 ProJul 2026
Details

Human reading only; no formalization is listed.

Attempts and sources →
ResearchToroidal Elton–Odell theorem
self-reported
Functional analysis
GPT-5.5 ProJul 2026
Details

Human reading only; no formalization is listed.

Attempts and sources →
ResearchUnconditional unclonable encryption
verified
Quantum computingCryptography
GPT-5.6 Sol UltraJul 2026
Details

Verification details are reported in the sources; proof artifacts have not been rebuilt for this catalogue.

Attempts and sources →
ResearchWeakly compact basis factorization
self-reported
Functional analysis
GPT-5.5 ProJul 2026
Details

Human reading only; no formalization is listed.

Attempts and sources →
CompetitionsIMO 2026 problem set
machine-checkedself-reported
Competition mathematics
Celiadots-note-3.0Claude Opus 5AxiomProverJul 2026
Details

Public formal code does not by itself establish that its statements match the original competition problems.

Attempts and sources →
ResearchFrontierMath evaluation integrity
verified (audit)
Evaluation
Not specifiedJan 23, 2025–Jun 12, 2026
Details

Disclose the dataset version and access conditions; neither a score change nor data access alone proves training contamination.

Attempts and sources →
ResearchFarhi–Goldstone–Gutmann QAOA conjecture
machine-checked
Quantum computingOptimization
Claude Fable 5Jun 2026
Details

An independent human proof is reported a day earlier; track discovery priority separately from formal verification.

Attempts and sources →
ResearchThe book Ramsey number R(B₈, B₁₀)
machine-checked
Graph theoryCombinatorics
AutoMathJun 2026
Details

The notes report formal coverage of the upper bound; the lower-bound construction is a separate obligation.

Attempts and sources →
ResearchA bound of 43 for integers using at most two distinct digits across bases (OEIS A306424)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchA divisibility criterion for primes with primitive root 2 (OEIS A091669)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchA harmonic-number formula for a recurrence sequence (OEIS A227582)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchA polynomial coefficient formula for cubed central binomial coefficients (OEIS A002897)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchA recurrence for the middle column of Rule 167 (OEIS A267581)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchAn integer eighth root of an Apéry determinant series (OEIS A228143)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchAsymptotic counts for a restricted married-couple seating problem (OEIS A258667)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchAsymptotic counts of subsets with integer averages (OEIS A051293)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchBounding the size of multiplicative bases (OEIS A194806)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchCharacterizing Carmichael numbers by squarefree denominators (OEIS A309132)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchContinued-fraction denominators are prime or one (OEIS A363102)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchConvergence of rational approximations to e (OEIS A340737)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchCounting divisor blocks with bounded ratios (OEIS A237271)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchCounting integer sequences with restricted rises (OEIS A028859)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchCovering planar sets by finitely many sets with no three collinear points (Erdős #846)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

A formal variant may be weaker than the full numbered question. No local rebuild was performed.

Attempts and sources →
ResearchDensity of multiples of shifted sequences with divergent reciprocal sums (Erdős #26)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

A formal variant may be weaker than the full numbered question. No local rebuild was performed.

Attempts and sources →
ResearchDensity of sums of integers with restricted base-3 and base-4 digits (Erdős #125)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

A formal variant may be weaker than the full numbered question. No local rebuild was performed.

Attempts and sources →
ResearchDigit restrictions in signed sums of powers (OEIS A243106)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchDistinct fractional parts of reciprocal Catalan sums (OEIS A000108)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchDivisibility of a factorial ratio by 30n − 1 (OEIS A211417)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchErdős #1196: primitive sets of large integers
verified
CombinatoricsProbability
GPT-5.4 ProMay 2026
Details

Human authors developed the proofs; the AI contribution was a method suggestion.

Attempts and sources →
ResearchErdős #1217: divisibility chains
verified
CombinatoricsProbability
GPT-5.4 ProMay 2026
Details

The precise density hypothesis and bound are in Theorem 1.6.

Attempts and sources →
ResearchErdős #164: primitive set conjecture
verified
CombinatoricsProbability
GPT-5.4 ProMay 2026
Details

This is a reproof, not a first solution; Lichtman proved the conjecture earlier.

Attempts and sources →
ResearchErdős unit-distance problem
verifiedmachine-checked
Discrete geometry
OpenAI (unreleased)SolMay 2026
Details

Verification details are reported in the sources; proof artifacts have not been rebuilt for this catalogue.

Attempts and sources →
ResearchError bounds for a nested-floor sequence (OEIS A341254)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchEventual periodicity of indexed prime factors in a coupled recurrence (OEIS A382590)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchFibonacci values in a fourth-order recurrence (OEIS A103311)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchGrowing gaps between van der Waerden numbers (Erdős #138)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

A formal variant may be weaker than the full numbered question. No local rebuild was performed.

Attempts and sources →
ResearchIntegrality of a factorial ratio (OEIS A368692)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchIsolated sums in Sidon sets (Erdős #152)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

A formal variant may be weaker than the full numbered question. No local rebuild was performed.

Attempts and sources →
ResearchModular periodicity of a factorial-weighted binomial sum (OEIS A278070)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchNo negative-one power residues for absolute Euler pseudoprimes (OEIS A307865)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchNonintegrality of weighted binomial sums (OEIS A175386)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchOdd coefficients occur only at products of consecutive integers (OEIS A323557)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchOdd squares as XORs of consecutive squares (OEIS A224515)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchOdd terms occur only at products of consecutive integers (OEIS A325046)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchPartitions into distinct non-squarefree integers beyond 23 (OEIS A256012)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchPeriods of powers with prime exponents modulo an integer (OEIS A282779)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchPower-law bounds for sets avoiding divisibility by pair sums (Erdős #12)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

A formal variant may be weaker than the full numbered question. No local rebuild was performed.

Attempts and sources →
ResearchPrimes congruent to ±1 modulo 10 as continued-fraction denominators (OEIS A363347)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchReflection symmetry in cumulative digit-sum comparisons (OEIS A289411)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchRun lengths in the second binary digit of Tribonacci numbers (OEIS A271591)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchSmallest multiples with divisible digit reversals (OEIS A062567)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchSmallest prime factor 1399 outside three exceptional cases (OEIS A248802)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchSmallest prime factor 67 along an index progression (OEIS A248802)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchSplitting a set while preserving positive sumset density (Erdős #741)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

A formal variant may be weaker than the full numbered question. No local rebuild was performed.

Attempts and sources →
ResearchSplitting additive bases into sumsets with bounded gaps (Erdős #741)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

A formal variant may be weaker than the full numbered question. No local rebuild was performed.

Attempts and sources →
ResearchSquare values at odd indices of a recurrence (OEIS A113254)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchSquare-root growth in sets avoiding divisibility by pair sums (Erdős #12)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

A formal variant may be weaker than the full numbered question. No local rebuild was performed.

Attempts and sources →
ResearchStabilization times increase by one or two in a mass-sharing automaton (OEIS A300997)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchUnique occurrences of primes above 5 as continued-fraction denominators (OEIS A372761)
machine-checked
Number theoryCombinatorics
AlphaProof NexusMay 2026
Details

The sequence may contain several conjectures; this entry refers only to the statement in the linked artifact. Its correspondence to the OEIS text has not been audited.

Attempts and sources →
ResearchAnderson’s quasi-completeness problem
verifiedmachine-checked
Commutative algebra
RethlasArchonApr 2026
Details

Verification details are reported in the sources; proof artifacts have not been rebuilt for this catalogue.

Attempts and sources →
ResearchSphere-packing optimality in dimensions 8 and 24
machine-checked
Discrete geometryFormal verification
GaussApr 2026
Details

Formalization of an existing human theorem is distinct from discovering a new packing theorem. The preprint and repository have different reported scopes.

Attempts and sources →
ResearchHamiltonian decompositions of directed toroidal grids
verifiedmachine-checked
Graph theory
Claude Opus 4.6GPT-5.3 CodexGPT-5.4 ProFeb 28, 2026
Details

The linked Lean artifact covers the odd case; later even-case claims need separate evidence.

Attempts and sources →
ResearchParity of k-differentials in genus zero and one
machine-checked
Algebraic geometryNumber theory
AxiomProverFeb 2026
Details

Only a key combinatorial identity is reported as formalized; the geometric reduction requires separate checking.

Attempts and sources →
ResearchSingle-minus gluon tree amplitudes
verified
Mathematical physics
GPT-5.2 ProOpenAI (unreleased)Feb 2026
Details

Verification details are reported in the sources; proof artifacts have not been rebuilt for this catalogue.

Attempts and sources →
CompetitionsFirst Proof: inaugural problem set
verifiedself-reported
Research mathematicsEvaluation
Multiple systemsAletheiaFeb 2026
Details

Lab assessments and organiser assessments differ. Preserve both alongside the exact attempt and grading protocol.

Attempts and sources →
ResearchAn ordinal Ramsey relation at ω^(ω²) (Erdős #591)
self-reported
Number theoryCombinatorics
AletheiaJan 2026
Details

Existing literature already contains a solution.

Attempts and sources →
ResearchAnti-Ramsey numbers for paths and cycles (Erdős #1105)
self-reported
Number theoryCombinatorics
AletheiaJan 2026
Details

Existing literature already contains a solution.

Attempts and sources →
ResearchColouring unit-distance graphs with large girth (Erdős #705)
self-reported
Number theoryCombinatorics
AletheiaJan 2026
Details

Existing literature already contains a solution.

Attempts and sources →
ResearchDiscrepancy of fractional parts of scaled integer sequences (Erdős #992)
self-reported
Number theoryCombinatorics
AletheiaJan 2026
Details

Existing literature already contains a solution.

Attempts and sources →
ResearchDistinct distances from multiple selected points (Erdős #652)
self-reported
Number theoryCombinatorics
AletheiaJan 2026
Details

Source-reported resolution; no formal artifact is listed.

Attempts and sources →
ResearchDistinct distances when no four points lie on a circle (Erdős #654)
self-reported
Number theoryCombinatorics
AletheiaJan 2026
Details

Only part of this question is reported resolved.

Attempts and sources →
ResearchDivisibility between products of factorials (Erdős #728)
machine-checked
Number theory
GPT-5.2 ProAristotleJan 2026
Details

Verification details are reported in the sources; proof artifacts have not been rebuilt for this catalogue.

Attempts and sources →
ResearchEqual products of distinct central binomial coefficients (Erdős #397)
self-reported
Number theoryCombinatorics
AletheiaJan 2026
Details

Existing literature already contains a solution.

Attempts and sources →
ResearchFew distances overall, but at least three among every four points (Erdős #659)
self-reported
Number theoryCombinatorics
AletheiaJan 2026
Details

Existing literature already contains a solution.

Attempts and sources →
ResearchForcing distinct distances in high dimensions (Erdős #1089)
self-reported
Number theoryCombinatorics
AletheiaJan 2026
Details

Existing literature already contains a solution.

Attempts and sources →
ResearchIrrationality of reciprocal products in fast-growing sequences (Erdős #1051)
self-reported
Number theoryCombinatorics
AletheiaJan 2026
Details

Source-reported resolution; no formal artifact is listed.

Attempts and sources →
ResearchPolynomial sublevel areas and logarithmic capacity (Erdős #1040)
self-reported
Number theoryCombinatorics
AletheiaJan 2026
Details

Only part of this question is reported resolved.

Attempts and sources →
ResearchPowerful parts of products of consecutive integers (Erdős #935)
self-reported
Number theoryCombinatorics
AletheiaJan 2026
Details

Only part of this question is reported resolved.

Attempts and sources →
ResearchImplications between small magma laws
machine-checked
AlgebraAutomated reasoning
Classical automated proversDec 2025
Details

Most reported work used classical automated theorem provers. The finite-magma question is separate from the main implication graph.

Attempts and sources →
ResearchDo miniF2F formal statements match the problems?
verified (audit)
Formal verificationEvaluation
Not specifiedNov 2025
Details

Kernel acceptance checks the formal statement; correspondence with the intended problem must be checked separately.

Attempts and sources →
ResearchMajority optimality in correlation distillation with erasures
self-reported
ProbabilityAnalysisTheoretical computer science
GPT-5 ProOct 2025
Details

The counterexample concerns five bits at p = 0.40 in the paper’s parameterization. It does not rule out majority optimality in other regimes. Human checking is described by the authors; no formal artifact is listed.

Attempts and sources →
CompetitionsIMO 2025 problem set
verifiedmachine-checkedself-reporteddisputed
Competition mathematics
Gemini Deep ThinkOpenAI (unreleased)AristotleGemini 2.5 ProGrok 4GPT-5Jul 2025–Oct 2025
Details

These are multiple attempts at one problem set. Scores, time limits, grading and formal coverage are not interchangeable.

Attempts and sources →
ResearchGradient-descent step-size bounds and novelty
disputed
Optimization
GPT-5Mar 2025
Details

Compare the same assumptions and objective guarantee before calling a numerical bound an improvement.

Attempts and sources →
CompetitionsIMO 2024 problem set
verifiedmachine-checked
Competition mathematics
AlphaProofAlphaGeometry 2Jul 25, 2024
Details

Verification details are reported in the sources; proof artifacts have not been rebuilt for this catalogue.

Attempts and sources →
CompetitionsOlympiad geometry problem suite
verified
Geometry
AlphaGeometryJan 17, 2024
Details

Verification details are reported in the sources; proof artifacts have not been rebuilt for this catalogue.

Attempts and sources →
ResearchLarge cap sets in eight dimensions
verified
Combinatorics
FunSearchDec 14, 2023
Details

A larger explicit construction gives a lower bound; it does not determine the maximum cap-set size.

Attempts and sources →
ResearchP versus NP: a disputed proof attempt
disputed
Complexity theory
GPT-4Sep 2023
Details

A disputed argument is not an accepted resolution. Keep the original claim, critique and response together.

Attempts and sources →
ResearchKnot signature bounds from hyperbolic geometry
verified
Knot theoryGeometry
DeepMind neural networksDec 2021
Details

Neural networks identified relevant invariants; human mathematicians formulated and proved the theorem. An initial stronger conjecture had counterexamples. No formal proof artifact is listed.

Attempts and sources →
HistoricalKepler conjecture
machine-checked
Discrete geometry
Flyspeck (no ML)Aug 10, 2014
Details

Historical computer-assisted proof and formalization; not evidence of a new AI-discovered theorem.

Attempts and sources →
HistoricalRobbins conjecture
verified
Algebra
EQPOct 10, 1996
Details

Classical automated deduction predates modern LLMs; keep its role explicit.

Attempts and sources →
HistoricalFour-colour theorem
machine-checked
Graph theory
Computer-assisted search (no ML)Jun 1976
Details

Historical computer assistance and later formalization; not a modern machine-learning discovery.

Attempts and sources →