AI Assisted
Mathematical Proofs
Problems, models, papers and formal proofs, with reported verification and known limitations.
Problems
View catalogue statistics →| Problem / reported evidence | Subject / tags | Model / AI | Date / year | Sources | Additional information |
|---|---|---|---|---|---|
| ResearchA CH obstruction to a prescribed categoricity threshold machine-checked (formal proof)self-reported (formal proof) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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 | GPT-6 Pro | Oct 6, 2026 | DetailsThe 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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) | OpenAI (unreleased) | Oct 6, 2026 | DetailsReported 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 | GPT-6 Astra | Oct 4, 2026 | DetailsThe 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 | GPT-6 Astra | Oct 1, 2026 | DetailsThe preprint is unrefereed and unformalized, with no independent check recorded. Attempts and sources → | ||
| ResearchExponential upper-bound constant for diagonal Ramsey numbers self-reporteddisputed (certificate) | GPT-5.4 ProGPT-5.6 Sol MaxClaude | 2026–Sep 29, 2026 | DetailsOnly 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) | ChatGPT 5.5 Pro | Sep 23, 2026 | DetailsThe 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) | ChatGPT 6 Astra Ultra | Sep 20, 2026 | DetailsThe 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) | GPT-5.6 SolGPT-6 Astra | Sep 20, 2026 | DetailsThe 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) | ChatGPT 6Claude Opus 5 | Sep 18, 2026 | DetailsThe 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) | ChatGPT (GPT-5.6) | Sep 17, 2026 | DetailsThe preprint is unrefereed, unformalized, and relies on author calculation and verification. Attempts and sources → | ||
| ResearchPierce–Birkhoff conjecture for piecewise polynomial functions self-reported (counterexample) | GPT-5.6GPT-6Claude Opus 5Claude Fable 5.1 | Sep 9, 2026 | DetailsThe 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 | OpenAI (unreleased)GPT-6 Astra | Sep 8, 2026 | DetailsThis 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) | OpenAI (unreleased)GPT-6 AstraCodex | Sep 8, 2026 | DetailsThis 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) | Anthropic research model | Sep 4, 2026 | DetailsThis 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) | GPT-6 Astra | Sep 3, 2026 | DetailsThe 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) | GPT-6 Astra | Sep 3, 2026 | DetailsLean 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 | GPT-5.6 Sol Pro | Sep 2, 2026 | DetailsThe 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 | ChatGPT 5.6 Sol | Sep 2, 2026 | DetailsThe 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 | ChatGPT Plus | Sep 2, 2026 | DetailsThis 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) | CodexChatGPT ProClaude | Sep 1, 2026 | DetailsThe 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 | ChatGPT 5.6 SolClaude | Sep 1, 2026 | DetailsThe 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) | ChatGPT 5.6 Solar | Sep 2026 | DetailsThe 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) | AlphaTensorAlphaEvolveClaude | Oct 5, 2022–Sep 2026 | DetailsThe 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 | ChatGPT 5.6 Sol | Aug 31, 2026 | DetailsThe 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 | GPT-5.6 SolClaude Opus 5 | Aug 31, 2026 | DetailsThe 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) | Anthropic Claude | Aug 28, 2026 | DetailsThe 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 | ChatGPT 5.6 Sol | Aug 27, 2026 | DetailsThe 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 | GPT-5.6 Sol | Aug 27, 2026 | DetailsThe 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 | GPT-5.6 Sol Ultra | Aug 26, 2026 | DetailsThe 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) | GPT-5.6 Sol | Aug 25, 2026 | |||
| ResearchComplex structure on the six-sphere: contested AI-assisted claim self-reported (claimed result)disputed (claimed result) | Claude | Aug 23, 2026 | DetailsThis 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 | RethlasGPT-5.6 Sol | Aug 21, 2026 | DetailsThe 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) | GPT-5.6 Sol Pro | Aug 19, 2026 | DetailsThis 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) | AxiomProver | Aug 18, 2026 | DetailsThis 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 | GPT-5.6 SolClaude Opus 5DanusRethlas | Aug 18, 2026 | DetailsThe preprint is unrefereed, unformalized and has no independent check recorded. Attempts and sources → | ||
| ResearchBerlekamp’s temperature bound for Domineering self-reported | GPT-5.6 Pro | Aug 14, 2026 | DetailsFormal 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 | ChatGPT 5.6 Pro | Aug 12, 2026 | DetailsThe 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 | ProofAtlasClaude Opus 5 | Aug 12, 2026 | DetailsVerification 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 | Anthropic (unreleased) | Aug 10, 2026 | DetailsA 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) | AletheiaGPT-5.2 | Jan 2026–Aug 3, 2026 | |||
| ResearchApproximation hardness of the closest vector problem machine-checkedself-reported | OpenAI (unreleased) | Aug 1, 2026 | DetailsReported by OpenAI; peer review and local proof rebuild are not recorded. Attempts and sources → | ||
| ResearchArithmetic complexity of the permanent machine-checkedself-reported | OpenAI (unreleased) | Aug 1, 2026 | DetailsReported by OpenAI; peer review and local proof rebuild are not recorded. Attempts and sources → | ||
| ResearchAsymptotic size of binary codes machine-checkedself-reported | OpenAI (unreleased) | Aug 1, 2026 | DetailsReported by OpenAI; peer review and local proof rebuild are not recorded. Attempts and sources → | ||
| ResearchAsymptotic sphere-packing density machine-checkedself-reported | OpenAI (unreleased) | Aug 1, 2026 | DetailsReported by OpenAI; peer review and local proof rebuild are not recorded. Attempts and sources → | ||
| ResearchCollatz: an invalid machine-checked disproof debunked | Not specified | Aug 1, 2026 | DetailsThis 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 | OpenAI (unreleased) | Aug 1, 2026 | DetailsThe 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 | OpenAI (unreleased) | Aug 1, 2026 | DetailsReported by OpenAI; peer review and local proof rebuild are not recorded. Attempts and sources → | ||
| ResearchErdős #146: extremal compactness machine-checkedself-reported | OpenAI (unreleased) | Aug 1, 2026 | DetailsReported by OpenAI; peer review and local proof rebuild are not recorded. Attempts and sources → | ||
| ResearchErdős #180: extremal degeneracy machine-checkedself-reported | OpenAI (unreleased) | Aug 1, 2026 | DetailsReported by OpenAI; peer review and local proof rebuild are not recorded. Attempts and sources → | ||
| ResearchErdős #183: multicolour triangle Ramsey numbers machine-checkedself-reported | OpenAI (unreleased) | Aug 1, 2026 | DetailsReported by OpenAI; peer review and local proof rebuild are not recorded. Attempts and sources → | ||
| ResearchExistence of a non-sofic group machine-checkedself-reporteddisputed | OpenAI (unreleased) | Aug 1, 2026 | DetailsThe 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 | OpenAI (unreleased) | Aug 1, 2026 | DetailsAn 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 | OpenAI (unreleased) | Aug 1, 2026 | DetailsReported by OpenAI; peer review and local proof rebuild are not recorded. Attempts and sources → | ||
| ResearchHan’s conjecture on Hochschild homology self-reported | GPT-5.6 Sol Ultra | Aug 2026 | DetailsThe 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 | GPT-5.6 Pro | Aug 2026 | DetailsVerification 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 | Claude Fable 5 | Aug 2026 | DetailsThe 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 | Claude Fable 5GPT-5.5 Pro | Jul 26, 2026 | DetailsThe 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 | CodexClaude | Jul 20, 2026 | DetailsVerification details are reported in the sources; proof artifacts have not been rebuilt for this catalogue. Attempts and sources → | ||
| ResearchCycle double cover conjecture verifiedmachine-checked | GPT-5.6 Sol Ultra | Jul 2026 | DetailsVerification 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 | GPT-5.5 Pro | Jul 2026 | DetailsThis 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 | GPT-5.6 Pro | Jul 2026 | DetailsThe 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 | Aristotle | Jul 2026 | |||
| ResearchKourovka 19.25: Simplicity from group order and totient sum verifiedmachine-checked | Aristotle | Jul 2026 | |||
| ResearchKourovka 20.125: Surjective Rota–Baxter operators verifiedmachine-checked | Aristotle | Jul 2026 | |||
| ResearchKourovka 21.147: Right-relatively convex subgroup lattices verifiedmachine-checked | Aristotle | Jul 2026 | |||
| ResearchKourovka 21.150: Rank bound for p-group extensions verifiedmachine-checked | Aristotle | Jul 2026 | |||
| ResearchKourovka 21.24: Cograph power graphs and chordality verifiedmachine-checked | Aristotle | Jul 2026 | DetailsLean 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 | Aristotle | Jul 2026 | |||
| ResearchKourovka 3.46: Number of maximal locally soluble normal subgroups verifiedmachine-checked | Aristotle | Jul 2026 | |||
| ResearchNon-Calkin unital Banach algebras self-reported | GPT-5.5 Pro | Jul 2026 | |||
| ResearchPrimariness of Lp(L1) self-reported | GPT-5.5 Pro | Jul 2026 | |||
| ResearchSaturated Newton polytopes of Vandermonde powers machine-checked | Codex | Jul 2026 | DetailsThe 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 | GPT-5.6 Pro | Jul 2026 | DetailsThe 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 | GPT-5.5 Pro | Jul 2026 | |||
| ResearchToroidal Elton–Odell theorem self-reported | GPT-5.5 Pro | Jul 2026 | |||
| ResearchUnconditional unclonable encryption verified | GPT-5.6 Sol Ultra | Jul 2026 | DetailsVerification details are reported in the sources; proof artifacts have not been rebuilt for this catalogue. Attempts and sources → | ||
| ResearchWeakly compact basis factorization self-reported | GPT-5.5 Pro | Jul 2026 | |||
| CompetitionsIMO 2026 problem set machine-checkedself-reported | Celiadots-note-3.0Claude Opus 5AxiomProver | Jul 2026 | DetailsPublic formal code does not by itself establish that its statements match the original competition problems. Attempts and sources → | ||
| ResearchFrontierMath evaluation integrity verified (audit) | Not specified | Jan 23, 2025–Jun 12, 2026 | DetailsDisclose 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 | Claude Fable 5 | Jun 2026 | DetailsAn 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 | AutoMath | Jun 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsA 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 | AlphaProof Nexus | May 2026 | DetailsA 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 | AlphaProof Nexus | May 2026 | DetailsA 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | GPT-5.4 Pro | May 2026 | DetailsHuman authors developed the proofs; the AI contribution was a method suggestion. Attempts and sources → | ||
| ResearchErdős #1217: divisibility chains verified | GPT-5.4 Pro | May 2026 | |||
| ResearchErdős #164: primitive set conjecture verified | GPT-5.4 Pro | May 2026 | DetailsThis is a reproof, not a first solution; Lichtman proved the conjecture earlier. Attempts and sources → | ||
| ResearchErdős unit-distance problem verifiedmachine-checked | OpenAI (unreleased)Sol | May 2026 | DetailsVerification 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsA 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsA 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsA 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsA 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 | AlphaProof Nexus | May 2026 | DetailsA 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsA 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | AlphaProof Nexus | May 2026 | DetailsThe 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 | RethlasArchon | Apr 2026 | DetailsVerification 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 | Gauss | Apr 2026 | DetailsFormalization 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 | Claude Opus 4.6GPT-5.3 CodexGPT-5.4 Pro | Feb 28, 2026 | DetailsThe 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 | AxiomProver | Feb 2026 | DetailsOnly a key combinatorial identity is reported as formalized; the geometric reduction requires separate checking. Attempts and sources → | ||
| ResearchSingle-minus gluon tree amplitudes verified | GPT-5.2 ProOpenAI (unreleased) | Feb 2026 | DetailsVerification 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 | Multiple systemsAletheia | Feb 2026 | DetailsLab 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 | Aletheia | Jan 2026 | |||
| ResearchAnti-Ramsey numbers for paths and cycles (Erdős #1105) self-reported | Aletheia | Jan 2026 | |||
| ResearchColouring unit-distance graphs with large girth (Erdős #705) self-reported | Aletheia | Jan 2026 | |||
| ResearchDiscrepancy of fractional parts of scaled integer sequences (Erdős #992) self-reported | Aletheia | Jan 2026 | |||
| ResearchDistinct distances from multiple selected points (Erdős #652) self-reported | Aletheia | Jan 2026 | |||
| ResearchDistinct distances when no four points lie on a circle (Erdős #654) self-reported | Aletheia | Jan 2026 | |||
| ResearchDivisibility between products of factorials (Erdős #728) machine-checked | GPT-5.2 ProAristotle | Jan 2026 | DetailsVerification 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 | Aletheia | Jan 2026 | |||
| ResearchFew distances overall, but at least three among every four points (Erdős #659) self-reported | Aletheia | Jan 2026 | |||
| ResearchForcing distinct distances in high dimensions (Erdős #1089) self-reported | Aletheia | Jan 2026 | |||
| ResearchIrrationality of reciprocal products in fast-growing sequences (Erdős #1051) self-reported | Aletheia | Jan 2026 | |||
| ResearchPolynomial sublevel areas and logarithmic capacity (Erdős #1040) self-reported | Aletheia | Jan 2026 | |||
| ResearchPowerful parts of products of consecutive integers (Erdős #935) self-reported | Aletheia | Jan 2026 | |||
| ResearchImplications between small magma laws machine-checked | Classical automated provers | Dec 2025 | DetailsMost 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) | Not specified | Nov 2025 | DetailsKernel 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 | GPT-5 Pro | Oct 2025 | DetailsThe 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 | Gemini Deep ThinkOpenAI (unreleased)AristotleGemini 2.5 ProGrok 4GPT-5 | Jul 2025–Oct 2025 | DetailsThese 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 | GPT-5 | Mar 2025 | DetailsCompare the same assumptions and objective guarantee before calling a numerical bound an improvement. Attempts and sources → | ||
| CompetitionsIMO 2024 problem set verifiedmachine-checked | AlphaProofAlphaGeometry 2 | Jul 25, 2024 | DetailsVerification details are reported in the sources; proof artifacts have not been rebuilt for this catalogue. Attempts and sources → | ||
| CompetitionsOlympiad geometry problem suite verified | AlphaGeometry | Jan 17, 2024 | DetailsVerification 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 | FunSearch | Dec 14, 2023 | DetailsA 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 | GPT-4 | Sep 2023 | DetailsA 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 | DeepMind neural networks | Dec 2021 | DetailsNeural 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 | Flyspeck (no ML) | Aug 10, 2014 | DetailsHistorical computer-assisted proof and formalization; not evidence of a new AI-discovered theorem. Attempts and sources → | ||
| HistoricalRobbins conjecture verified | EQP | Oct 10, 1996 | DetailsClassical automated deduction predates modern LLMs; keep its role explicit. Attempts and sources → | ||
| HistoricalFour-colour theorem machine-checked | Computer-assisted search (no ML) | Jun 1976 | DetailsHistorical computer assistance and later formalization; not a modern machine-learning discovery. Attempts and sources → |
No records match these filters. Try a broader term or reset the filters.