Breakthrough Prime Parity Algorithm in x^o(1) Time Written Entirely by Claude Code

Independent researcher xennygrimmato unveiled a deterministic algorithm deciding the parity of the prime-counting function in x^o(1) time, down from x^(1/2+o(1)). The 5488-line Lean 4 proof, with zero sorry, was written entirely by Claude Code and verified across 850,000 intervals.

2026-11-06 ~ 2026-11-06 · 4 related posts

• Prime-counting parity in x^o(1) time, with 5,488 lines of Lean 4 written by Claude Code — xennygrimmato_ · 2026-11-06
• New deterministic algorithm decides parity of prime counting function in x^o(1) time — xennygrimmato_ · 2026-11-06
• Prime parity algorithm details: one SAT query, 855K intervals verified numerically — xennygrimmato_ · 2026-11-06
• Prime parity proof: 5,488 lines of Lean 4 written with Claude Code, zero sorry — xennygrimmato_ · 2026-11-06