The bounded-chaos conjecture for a rigorous EMCHS outcome
Let be the chaotic map used in the EMCHS model, let , and let denote the proposed invariant density. For a suitable class of functions , bounded-chaos conjecture. The averages
converge to
uniformly in . Assuming this conjecture together with the Generalized Riemann Hypothesis, an implementation of EMCHS would yield infinitely many prime gaps at most . The proposed result is a speculative route to rigor: neither the stated bounded-chaos input nor the resulting prime-gap conclusion is established in the source.
References
Primary source
Milad Ghadimi, “Heuristic Bounded Prime Gaps via a Chaotic Multidimensional Sieve and Random Matrix Theory”, arXiv:2507.17986 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.