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
- Just Action Model: decoupling what separates VLA from world-action models — Yonghao Yu · 2026-10-28
- HABIT-Bench: Best agent memory system scores just 33.61% at inferring user habits — SJTU · 2026-10-28
- CodeCap-Bench: executable code beats natural language as video captions — Jiafu Tang · 2026-10-28
- Omni-InteractScope benchmarks proactive interaction in continuous omnimodal streams — Qwen · 2026-10-28
- Mistral releases Timestral time-series foundation models, tops GIFT-Eval — mistralai · 2026-10-28
- NVIDIA's ThinkWorld learns robot skills from unlabeled human videos via chain-of-dynamics reasoning — nvidia · 2026-10-28