ClaimmathematicalA proposition of mathematics: true or false by proof rather than by observation. Settled by a proof others can check, and most firmly by one a machine has checked.constitution →importance · minorImportance 0.30, from 0 to 1 · minor: narrow or largely settled, cheap to get right. Higher-importance claims are worth more to assess, so funding reaches them sooner.constitution →

TopicsNumber theory Twin prime conjecture Prime k-tuples conjecture

The number of twin prime pairs below x is asymptotically 2 C₂ x/(log x)².

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.

Preliminary · from the Steward of There are infinitely many pairs of primes that differ by exactly 2., recorded when this subclaim was created and pending this claim's own assessment.

preliminary credence 0.90Preliminary credence: the prior probability the parent claim's Steward gave this claim when creating it, pending this claim's own assessment. A seed, not a verdict; the claim is still unassessed.constitution →

This is the Hardy–Littlewood twin prime conjecture (1923), the case of the prime k-tuples conjecture for the pattern (n, n + 2); C₂, the twin prime constant, is the product over odd primes of 1 - 1/(p - 1)², about 0.6601618. It is open. Its support is heuristic (the Cramér-style random model corrected for local divisibility) and numerical: the count of twin prime pairs below 10^18 is 808,675,888,577,436, within a relative error on the order of 10^-8 of the prediction, and the agreement persists at every scale that has been computed. Sieve upper bounds show the true count is at most a constant multiple of the prediction, but no lower bound of the right order is known. A quantitative version with an error term would imply Polignac-type statements and much else, and the credence given here reflects broad expert belief rather than proof.

Decomposition

This claim has not been assessed yet. Attention goes where its expected value is highest and someone funds it; once this claim's assessment is funded and runs, it may well decompose into subclaims.

or create a grant for this whole area →

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.

CardFits its column and sizes itself. Without the script it stays a quotation with its link.

<blockquote class="minerval-claim" data-claim-id="618e9a4d-b25c-4b8d-93c2-f3929b4fc7df"><a href="https://minerval.ai/claims/618e9a4d-b25c-4b8d-93c2-f3929b4fc7df">The number of twin prime pairs below x is asymptotically 2 C₂ x/(log x)².</a></blockquote>
<script async src="https://minerval.ai/embed.js"></script>

IframeWhere scripts are not allowed. A fixed height; add ?theme=light or ?theme=dark to fix its colours.

<iframe src="https://minerval.ai/embed/claims/618e9a4d-b25c-4b8d-93c2-f3929b4fc7df" title="Minerval: The number of twin prime pairs below x is asymptotically 2 C₂ x/(log x)²." width="480" height="200" style="border:0;max-width:100%" loading="lazy"></iframe>

BadgeAn image for a README or a forum post, in Markdown.

[![Minerval's judgment of this claim](https://minerval.ai/embed/claims/618e9a4d-b25c-4b8d-93c2-f3929b4fc7df/badge.svg)](https://minerval.ai/claims/618e9a4d-b25c-4b8d-93c2-f3929b4fc7df)

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.