Computer-assisted proof debate: author to release 100GB of independently checkable verifications
DimitrisPapail · x · 2026-09-15
Mathematician Dimitris Papail describes a largely computer-assisted proof whose reductions are presented as elementary proofs, with numerical premises stated as explicit finite inequalities that are independently checkable — to be offered in a large 100GB file. He concedes, however, that passing a verifier does not by itself establish the verifier is correct.
More from Research
- ICML paper: finite context windows impose impossibility results for adversarial regret — burny_tech · 2026-11-02
- WASABI: Blei lab trains diffusion models to sample Boltzmann distributions with 3.3x fewer energy evaluations — skoularidou · 2026-11-02
- A complete math roadmap for machine learning: linear algebra, calculus, probability — TivadarDanka · 2026-11-02
- A base LLM plus 11 lines of code is all you need for a decision model — helloiamleonie · 2026-11-02
- Editor fully resigns from JMLR, arguing AI reviews beat rushed humans and journals need a rethink — roydanroy · 2026-11-02
- flowl: a probabilistic programming language built on optimal transport, not distributions — burny_tech · 2026-11-02