Skip to main content
MANIFOLD
Will a proof of Cramér's conjecture be published before 2031?
2
Ṁ100Ṁ110
2030
27%
chance

This market resolves to YES if, before January 1, 2031, a mathematically verified proof of Cramér's conjecture is published. Otherwise, it resolves to NO. For background, see the [Cramér's conjecture Wikipedia page](Cramér's conjecture - Wikipedia ).

Resolution Criteria

* YES resolves if a general proof is officially accepted and published establishing Cramér's conjecture in either its asymptotic form (lim sup (p_{n+1} - p_n) / (log p_n)^2 = 1) or its big-O form (p_{n+1} - p_n = O((log p_n)^2)).

* NO resolves if no such proof is published and verified before the close date (including if the conjecture is disproven, or if only partial/conditional progress is made).

Verification & Rules

* The proof must be published in a peer-reviewed mathematics journal or an accepted arXiv pre-print acknowledged as valid by the analytic number theory community.

* Unverified pre-prints, conditional proofs (e.g., assuming the Riemann Hypothesis), improvements to weaker bounds, or computational verifications over finite ranges do NOT count as a YES.

* Trader Responsibility: If a qualifying proof is published, traders are asked to post a link in the comments. If no verified proof is posted by the close date, this market will resolve NO.

Resolution criteria

This market resolves to YES if, before January 1, 2031, 23:59:59 UTC, a mathematically valid proof of Cramér's conjecture is published and broadly accepted by the mathematics community. Otherwise, this market resolves to NO.

  • Forms covered: A qualifying proof must establish Cramér's conjecture in either:

    • Its strong asymptotic form: $\limsup_{n \to \infty} \frac{p_{n+1} - p_n}{(\log p_n)^2} = 1$

    • Its weak / big-$O$ form: $p_{n+1} - p_n = O((\log p_n)^2)$

  • Publication & verification standards:

    • The proof must appear in a reputable peer-reviewed mathematics journal, or be available as a preprint on arXiv that has achieved broad consensus and formal acceptance within the analytic number theory community.

    • Conditional proofs (e.g., proofs that rely on the unproven Riemann Hypothesis or Generalized Riemann Hypothesis), heuristic models, and computational verifications over finite ranges do not qualify for YES.

    • Proofs establishing weaker bounds (e.g., $O(p_n^\theta)$ or $O((\log p_n)^c)$ for $c > 2$) do not qualify.

  • If a disproof is published and verified (e.g., proving that the gap must exceed $c (\log p_n)^2$ infinitely often for some $c > 1$ or that no such $O((\log p_n)^2)$ bound holds), the market resolves to NO.

  • If a proof is claimed before the cutoff but remains under peer review or active dispute as of January 1, 2031, the market will resolve to NO unless consensus on its correctness is achieved within 6 months following the cutoff date.

Background

Formulated by Swedish mathematician Harald Cramér in 1936 using a probabilistic model of primes, Cramér's conjecture states that the gaps between consecutive primes $p_n$ satisfy $p_{n+1} - p_n = O((\log p_n)^2)$, with the limit supremum of $\frac{p_{n+1} - p_n}{(\log p_n)^2}$ equal to $1$.

Unconditionally, the best known general bound for prime gaps is due to Baker, Harman, and Pintz (2001), establishing $p_{n+1} - p_n = O(p_n^{0.525})$. Even assuming the Riemann Hypothesis, the best known upper bound is $O(\sqrt{p_n} \log p_n)$, which remains far from the logarithmic scale predicted by Cramér. Furthermore, heuristic refinements by Andrew Granville in 1995 suggest that the constant in Cramér's limit supremum may actually be strictly greater than $1$ (specifically at least $2e^{-\gamma} \approx 1.1229$), though Granville's heuristic still supports the $O((\log p_n)^2)$ order of magnitude.

Get
Ṁ1,000
to start trading!