Massive AI-generated numerical certificates resist Lean encoding
DimitrisPapail · x · 2026-09-15
Responding to whether such certificates can feasibly be encoded and checked in Lean, Papail argues the obstacle is that the proof is a ton of distinct inputs, bounds, and tables with poor compressibility. Example: an upper bound proof states that if chosen probability distributions and numerical tables satisfy every prescribed inequality, then capacity is at most some value.
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