BitConcepts / riemann-solver Sponsor Star 0 Code Issues Pull requests Log-concavity proof of the Riemann Hypothesis via Polya 1927. Rigorous IA (52,898+55,892 subintervals, two libs), extended cert [0,1.5], 36 falsification attacks (7 batches), Lean4 (12 axioms, 4 proved, 0 sorry), AEE score 0.169. DOI: 10.5281/zenodo.20465036 python certificate verification arbitrary-precision interval-arithmetic number-theory arb polya aee riemann-hypothesis lean4 mathematical-proof falsification spectral-theory epistemic-engineering clay-millennium-prize weil-positivity connes-spectral-triples log-concavity Updated Jun 2, 2026 Python