Riemann Hypothesis
Theorem.Riemann Hypothesis — ζ(s) = 0 ∧ 0 < Re(s) < 1 ⇒ Re(s) = ½ (conjectured; OPEN).
Proof.The Riemann Hypothesis is a Clay Millennium problem, demarcate()-signed CONTESTED (open). Modeled here as a sealed computational challenge (Riemann–Siegel Z / S(T) zero scan · Basel ζ(2)=π²/6 · string algebra seals ζ(−1)=−1/12, a DIFFERENT point on ζ). Its own OPEN step: no proof that all nontrivial zeros lie on Re(s)=½ (verifying N zeros ≠ all zeros — no-finiteness). HARMONY ≠ TRUTH.
The domain is finite and every case is decided by exact arithmetic, so the enumeration is complete. ∎
src/research/index.ts#clayChallengesComputableFromSequence
1 · Classification
finite-complete — self-contained computation, no external lean
2 · Provenance
Documented theorem re-derived by exhaustive computation (humanityNovel=false); first-in-this-registry is the only sense of discovered.
Acknowledgment
"Riemann Hypothesis" is a re-derivation, acknowledged to documented mathematics — the original proof is the prior art this re-derivation acknowledges; not new to humanity — the contribution is the reproducible computation clayChallengesComputableFromSequence.
- Prior art
- documented mathematics — the original proof is the prior art this re-derivation acknowledges
- Novelty
- not new to humanity — a re-derivation (humanityNovel = false)
- Contribution
- a reproducible computation (clayChallengesComputableFromSequence @ src/research) that re-derives the result at zero tokens — the contribution is the verifiable recomputation, NOT the theorem
3 · Reproducibility
Recompute from source: npm run theorems:verify recomputes clayChallengesComputableFromSequence (src/research/index.ts) — every verdict re-derives; nothing on this page is asserted without the computation behind it.