The bounded-chaos conjecture for a rigorous EMCHS outcome

From papers

Let χ\chi be the chaotic map used in the EMCHS model, let y0[0,1]y_0\in[0,1], and let ρ(y)\rho(y) denote the proposed invariant density. For a suitable class of functions gg, bounded-chaos conjecture. The averages

1NnNg(χn(y0))\frac{1}{N}\sum_{n\leq N}g(\chi^n(y_0))

converge to

01g(y)ρ(y)dy\int_0^1g(y)\rho(y)\,dy

uniformly in y0y_0. Assuming this conjecture together with the Generalized Riemann Hypothesis, an implementation of EMCHS would yield infinitely many prime gaps at most 200200. 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.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Milad Ghadimi, “Heuristic Bounded Prime Gaps via a Chaotic Multidimensional Sieve and Random Matrix Theory”, arXiv:2507.17986 (2025).

Solutions 0

No solutions have been posted yet.