Claude can't yet prove number field sieve time complexity, reports researcher Geoffrey Irving
geoffreyirving · x · 2026-10-30
Researcher Geoffrey Irving asked whether the general number field sieve has been formalized and whether its correctness follows from the quasi-Riemann hypothesis, then updated that per Claude, the QRH framework still can't prove the algorithm's time complexity. A terse but telling data point on the limits of frontier models in formalized mathematics and complexity proofs, from someone deep in the Lean/formal-proofs scene.
Related event: Claude Gets the Answer Right but Can't Prove Number Field Sieve Complexity(2 posts)→
More from Research
- Noninvasive BCI lets unresponsive ICU patients communicate via brainwaves — ZeroStateReflex · 2026-10-30
- Adobe's EditAgent routes image edits across editors with evidence-based listwise judging — adobe · 2026-10-30
- AskStream benchmark shows models struggle to ask questions proactively in streaming video — CASIA · 2026-10-30
- Co-Design Bench: top coding agents fully satisfy only 26.4% of real-user tasks — Qwen · 2026-10-30
- UniReps 2026 workshop set for December 12 in Paris — ClementineDomi6 · 2026-10-30
- Quantum randomness is falsifiable but never verifiable: a Kolmogorov-complexity argument — jessi_cata · 2026-10-30