AI-Verified in Lean: Polynomials Can Be Evaluated With Half the Multiplications, Decades-Old Proof Finally Published
thomasahle · x · 2026-09-11
thomasahle shares a purely mathematical result: with rational preprocessing, a monic polynomial of degree n can be evaluated in ⌊n/2⌋+1 multiplications (one more for general polynomials), beating Horner's method — e.g. a quartic needs just two multiplications. The 100-page proof sat unpublished for years until AI verified it in Lean. Now shipped with an online chain compiler, paper (arXiv:2609.06022) and GitHub code; useful for approximating exp/sin/cos and for cryptography, hashing and coding theory.
More from Research
- A tractable approach to pairwise interactions in ancestral sequence reconstruction — KevinKaichuang · 2026-09-12
- Generative Reward Models Fix Deceptive Autoformalization in Neurosymbolic Reasoning — CWRU · 2026-09-12
- AIRO launches automated catastrophic AI risk forecasts, matching top human forecasters — soumitrashukla9 · 2026-09-12
- LiveBench agentic coding eval questioned: outlier score rests on 4 Python issues — teortaxesTex · 2026-09-12
- 31 million protein complex predictions run on NVIDIA BioNeMo, saving an estimated 1.35 GWh — AllThingsApx · 2026-09-12
- Why RL Environments Work Better in 2026: Greenblatt's Two Reasons — dejavucoder · 2026-09-12