Polynomial evaluation in just two multiplications: 100-page proof finally verified in Lean by AI
srchvrs · x · 2026-09-11
A fun result shared in reply: a quartic polynomial P(x) can be evaluated with just two(!) multiplications using a nested form y = (x + b₀)x + b₁. The authors proved it years ago but the 100-page proof made them unsure enough to publish — until AI verified it in Lean.
Notably, the original result was "done entirely without AI"; AI only served as the verifier.
More from Research
- 3D Representations Guide Trending on Hugging Face Spaces — suvadityamuk · 2026-09-12
- OpenAI Team Disproves Erdős–Simonovits Conjecture, Generalizes Result to All r≥2 — ctjlewis · 2026-09-12
- NanoJudge: A New Benchmark for How Well Models Rank Subjective Choices — arkuto · 2026-09-12
- Dev claims OpenAI helped disprove Erdős–Simonovits Turán conjecture, generalizing r=2 to all r≥2 — ctjlewis · 2026-09-12
- Podcast: Google Fellow John Platt on AI Tractability and AI for Science — ziv_ravid · 2026-09-12
- Stanford Used LLMs to Scan 9,623 Local Legal Codes, Finding Dozens Still Mandating Segregation — chrmanning · 2026-09-12