Elliptic-curve discrete log already has a poly-time solution — and could an LLM have found it?
jamestagg · x · 2026-11-23
Building on his earlier thread, the author notes that elliptic-curve discrete logarithms already have a known polynomial-time solution, so that specific crypto-relevant problem is 'solved' — P ≠ BQP only rules out a general solution for all problems, not solutions to some. The subtle question, he argues, is how that solution was found: did it require human mathematical creativity, or could an LLM have assembled it by exhaustively searching the literature — linking complexity theory to whether AI can replicate mathematical discovery.
More from AGI Musings
- Dan Williams: "The Crazy AI People Are Directionally Correct" — on the limits of AI scepticism — dioscuri · 2026-11-23
- Papers on AI timelines are growing super-exponentially, now doubling every 3.8 months — peterwildeford · 2026-11-23
- OpenAI Chief Scientist: Avalanche of Pretraining Breakthroughs Possible by 2027 — Neurogence · 2026-11-23
- Unreleased frontier AI formalizes Fermat's Last Theorem proof, fells Millennium Problems, roils mathematicians — Afinetheorem · 2026-11-23
- The pragmatic path: gen AI for rendering only, before touching game state — gandamu_ml · 2026-11-23
- AI-native org math upends tech staffing as Microsoft offers exits to 60,000 — thedealdirector · 2026-11-23