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.

Related event: AI Agents Collaborate for Four Weeks to Produce New Math Results for $3,000 in GPU Costs(10 posts)→

Original post →

More from Research

Research channel →