This is the authors' abstract. We don't add key points for this paper.
FINDING: The Polymath project refined Maynard–Zhang sieve methods to prove bounded prime gaps with \(H_m ≤ 246\) for infinitely many \(m\)-tuples of primes, a dramatic reduction from Zhang's original 70 million. | MATH: \(H_m := n→∞(pₙ₊ₘ-p_n)\); twin prime conjecture ⇔ \(H_1=2\). Zhang (2013): \(H_1 ≤ 70,000,000\). Maynard (2013): \(H_1 ≤ 600\). Polymath8b (2014): \(H_1 ≤ 246\) (unconditional), \(H_1 ≤ 6\) under Elliott–Halberstam. Key tool: multidimensional Selberg sieve with weights \(w(n) = (∑d_i | n+h_i λd_1,,d_k)^2\), optimizing \(λ\) via a quadratic form whose spectral gap yields the bound. | CONNECTION: The optimal sieve weights correspond to a **root system** structure — specifically, the \(k\)-dimensional simplex lattice \(Z^k\) with \(L^2\) norm. The ratio of the best constant \(246/2 = 123\) is not a golden ratio, but the **spectral gap** in the sieve's quadratic form mirrors the **gap ratio** in cry Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Andrew Stewart Caldin (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: