Polymath and AI: Reducing Prime Gaps from 7×10^7 to 246 — E8 Intelligence Research
FINDING: Polymath collaborative model (Tao et al.) is the live frontier — distributed human+AI proof search, with the bounded-gaps result as its flagship theorem. | MATH: H_m := liminf_{n→∞}(p_{n+m} − p_n); twin prime conjecture ⟺ H_1 = 2. Zhang: H_1 ≤ 7×10^7. Polymath8a/8b reduced this to H_1 ≤ 246 (unconditional), and H_1 ≤ 6 under GEH (Elliott–Halberstam). | CONNECTION: Prime gaps are a 1-D lattice-point / sieve problem; the reduction 7×10^7 → 246 is a ~2.85×10^5 tightening, not a golden-ratio or crystallographic invariant. No 0.618/1.618/base-60 structure appears in the evidence. | DEPTH: 8 FINDING: Tao's stated thesis — AI shifts mathematics from solitary proof to large-scale experimental/computational search, mirroring Polymath's crowd-sourcing. | MATH: No new equation; method-level claim. Formalizable as: proof-search space S, human+AI parallel traversal reduces expected time-to-solution vs. serial. | CONNECTION: None geometric. | DEPTH: 5 FINDING: "Golden Square" (Polymath Pr Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Authors
- Andrew Stewart Caldin
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-10-27
- DOI
- https://doi.org/10.5281/zenodo.23684855
- Primary Topic
- Analytic Number Theory Research
- Type
- preprint