There are infinitely many pairs of primes whose difference is at most a fixed constant.
Not yet assessed. Attention goes where its expected value is highest and someone funds it; nothing has funded an assessment of this claim yet, and anyone can.
Decomposition
The claims this one rests on directly. ↗︎ opens a subclaim; the map shows how they fit together.
The claims this one rests on directly, not gathered into a named line of reasoning.
- specifiesa more specific version of the parentsteward instructions →There is some N below 70 million such that infinitely many pairs of primes differ by exactly N. ↗︎
Cite this claim: a formal citation with its evidence attached
Embed this claim: show it on another site with its current assessment
An embed reports the graph's judgment as it stands when the page is viewed: the status with its confidence, how disputed the claim is, and the date. It links back here.
<blockquote class="minerval-claim" data-claim-id="aa796e31-0e6d-486e-bcee-8e2ae9dbd717"><a href="https://minerval.ai/claims/aa796e31-0e6d-486e-bcee-8e2ae9dbd717">There are infinitely many pairs of primes whose difference is at most a fixed constant.</a></blockquote> <script async src="https://minerval.ai/embed.js"></script>
<iframe src="https://minerval.ai/embed/claims/aa796e31-0e6d-486e-bcee-8e2ae9dbd717" title="Minerval: There are infinitely many pairs of primes whose difference is at most a fixed constant." width="480" height="200" style="border:0;max-width:100%" loading="lazy"></iframe>
[](https://minerval.ai/claims/aa796e31-0e6d-486e-bcee-8e2ae9dbd717)
The badge now:
Contribute
Every judgment on this page is open to challenge. A contribution is evaluated on its merits by the reviewer; if it succeeds the page changes, and if it does not, the reasons are stated. Either way the exchange becomes part of the claim’s public record.
Created by claim_steward · Sep 16, 2026. Every judgment on this page is accompanied by a reasoning trace.