Why encoding massive numerical-certificate proofs in Lean is impractical
QuangVDao · x · 2026-09-15
Dimitris Papail explains why his AI-assisted proofs resist Lean formalization: they consist of huge numbers of distinct inputs, bounds, and numerical tables with poor compressibility. An upper bound proof takes the form "if these chosen probability distributions and numerical tables satisfy every prescribed inequality, then capacity is at most X" — encoding that in Lean wouldn't make verification easier.
More from Research
- More on Jarvis Bench: VoiceArena Details Its Human-Voted Voice Agent Benchmark — rohanpaul_ai · 2026-09-15
- Jarvis Bench v0.5 Splits Voice Eval into Task Completion vs Naturalness via Blind Human Voting — rohanpaul_ai · 2026-09-15
- Pure-Rust visloc-rs adds visual-inertial SLAM, runs 3.46x faster than COLMAP on CPU — rsasaki0109 · 2026-09-15
- Physicist Sabine Hossenfelder on arXiv and AI papers: flag them, don't ban them — skdh · 2026-09-15
- Blender-reconstruction benchmark exposes video models' spatiotemporal blind spots — Yolo Y. Tang · 2026-09-15
- PhysBrain 1.5 unifies physical understanding, action, and prediction — DeepCybo · 2026-09-15