=================================================================== --- a/paper/kk-lower-bound.md version 8 +++ b/paper/kk-lower-bound.md version 9 @@ -1,18 +1,22 @@ # A two-class Erdős–Rankin lower bound from finite estimates -**Local exposition for manuscript-binding review, 8 October 2026.** +**Revised manuscript for editorial review, 27 October 2026.** -Chris Benjaminsen provided project direction. The three-band construction follows the architecture of Kalmynin and Konyagin and its existing fixed-offset adaptation in the project record. Earlier mathematical sources and contributors retain their credit. This new exposition was prepared by the actual gpt-6.1-sol assistant at high reasoning effort from the frozen Lean sources. It makes no claim to sole authorship or novelty. The original manuscript is preserved byte for byte in `original-manuscript-verbatim.md`. +Theorem 1 retains the mathematical statement accepted for the three mapped claims in [return #2597](https://solveathome.org/projects/twin-primes/return/2597). This editorial revision updates source qualifications and references. Its new text and file hash have not yet received independent acceptance. -The preserved contribution record distinguishes historical authorship from this revision. The original project manuscript's Methods and AI disclosure records [return #1093](https://solveathome.org/projects/twin-primes/return/1093) under nielsegberts with model gpt-6-astra (the manuscript names GitHub Copilot CLI), and [return #1730](https://solveathome.org/projects/twin-primes/return/1730) under Benjaminsen with deepseek-v4-flash (the manuscript names Freebuff). It also retains [return #158](https://solveathome.org/projects/twin-primes/return/158) for the historical OCR/source-custody and priced-constant discussion, and the recorded Codex revisions. These are historical credits, not claims that a new Astra or DeepSeek worker performed this source review. The linked [project contribution record](https://solveathome.org/projects/twin-primes/docs/research/RESEARCH-CONTRIBUTIONS-2026-09-27.md) and complete original disclosure remain part of the provenance; no author dates have been reconstructed here. +**Historical exposition record (8 October 2026).** Chris Benjaminsen provided project direction. The three-band construction follows the architecture of Kalmynin and Konyagin and its existing fixed-offset adaptation in the project record. Earlier mathematical sources and contributors retain their credit. That exposition was prepared by the actual gpt-6.1-sol assistant at high reasoning effort from the frozen Lean sources. It makes no claim to sole authorship or novelty. The original manuscript is preserved byte for byte in `original-manuscript-verbatim.md`. +The preserved contribution record distinguishes historical authorship from the 8 October exposition. The original project manuscript's Methods and AI disclosure records [return #1093](https://solveathome.org/projects/twin-primes/return/1093) under nielsegberts with model gpt-6-astra (the manuscript names GitHub Copilot CLI), and [return #1730](https://solveathome.org/projects/twin-primes/return/1730) under Benjaminsen with deepseek-v4-flash (the manuscript names Freebuff). It also retains [return #158](https://solveathome.org/projects/twin-primes/return/158) for the historical OCR/source-custody and priced-constant discussion, and the recorded Codex revisions. These are historical credits, not claims that a new Astra or DeepSeek worker performed this source review. The linked [project contribution record](https://solveathome.org/projects/twin-primes/docs/research/RESEARCH-CONTRIBUTIONS-2026-09-27.md) and complete original disclosure remain part of the provenance; no author dates have been reconstructed here. + +The 27 October revision was prepared under the contributor account alvinhhh by gpt-6.1-sol at high reasoning effort. It reuses the complete served manuscript, SHA-256 `6c287c180b331318a19b3fb0a0e571147e01d785c4efa4341cf3bba5bd1c8e80`, and preserves its mathematical and historical credits. This revision checked source records and text only; it ran no mathematical program, Lean build, numerical experiment or kernel checker. No additional historical worker identity is inferred. + ## Abstract Let $P(y)=\prod_{p\le y}p$, where the product includes every prime at or below the real cutoff $y$. The integers surviving the two exclusions are $$ -\mathcal T_y=\{n\in\mathbb Z:\gcd(n(n+2),P(y))=1\}. +\mathcal T_y=\{n\in\mathbb Z\colon\gcd(n(n+2),P(y))=1\}. $$ We explain the frozen formal proof that their largest consecutive gap satisfies @@ -34,9 +38,9 @@ d>0,\qquad s,s+d\in\mathcal T_S, \qquad s+i\notin\mathcal T_S\quad(00$ and $Y$ such that, for every real $y\ge Y$, an attained largest integer survivor gap $d\in\mathbb N$ exists for $S=\{p\in\mathbb N:p\text{ prime},\ p\le y\}$, where the last comparison uses the real value of $p$, and $$ @@ -119,18 +123,18 @@ \{0,-2\}\pmod p,&\text{otherwise}. \end{cases} \tag{5} $$ -The actual cover still has one pair at each prime. Formula (5) describes an auxiliary sieve, whose benefit is an additional factor from the middle band. Its local cardinality $g(p)$ is $1$ at $p=2$, $2$ at $p=3$, $4$ at middle-band primes, and $2$ at other primes at least $5$. A collision of the four middle-band residues would force a prime divisor of $1$, $2$ or $3$; the band lies above $3$, so no collision occurs. All local densities satisfy $0X$. Thus the actual weights satisfy @@ -174,9 +178,9 @@ $$ The sifted weight sum is exactly $S(X,\Omega)$. These identities are established for the counting weights, not supplied as unspecified sieve hypotheses. -Put $\nu(p)=g(p)/p$, extending multiplicatively on squarefree divisors, and $h(d)=\prod_{p\mid d}\nu(p)/(1-\nu(p))$. At a real level $H>1$, the Selberg denominator is +Put $\nu(p)=\frac{g(p)}{p}$, extending multiplicatively on squarefree divisors, and $h(d)=\prod_{p\mid d}\nu(p)/(1-\nu(p))$. At a real level $H>1$, the Selberg denominator is $$ J(H)=\sum_{\substack{d\mid P_{\mathrm{aux}}\\d^2\le H}}h(d). $$ @@ -184,9 +188,9 @@ The explicit coefficients are $$ \lambda_d=\nu(d)^{-1}J(H)^{-1}\mu(d) -\sum_{\substack{k\mid P_{\mathrm{aux}}\\d\mid k,\ k^2\le H}}h(k). +\sum_{\substack{k\mid P_{\mathrm{aux}}\\ d\mid k,\ k^2\le H}}h(k). $$ They have $\lambda_1=1$, vanish outside $d^2\le H$, and their quadratic main term is exactly $1/J(H)$, by finite Möbius inversion and diagonalization. Expanding the square against (8) gives the bound by $X/J(H)$ plus the actual remainder sum. The construction uses the squared-level convention above throughout. @@ -215,9 +219,9 @@ Also $4H^5\le y/(12L)$ on the stated domain. With $C_s=2e^E$, the resulting finite estimate is $$ S(X,\Omega)\le C_sX V(\sqrt y)+\frac y{12L}, -\qquad V(\sqrt y)=\prod_{p\le\sqrt y}(1-g(p)/p). \tag{10} +\qquad V(\sqrt y)=\prod_{p\le\sqrt y}(1-\frac{g(p)}{p}). \tag{10} $$ The product is bounded by elementary finite estimates as well. Define $C=4\exp(10\log4)$. The ordinary inverse product obeys @@ -304,9 +308,9 @@ u=r\frac{12L_2}{L_3},\qquad \log u=L_3+\log12-\log L_3+\log r. $$ -The bound $\log t\le2\sqrt t$ makes both $r-1$ and $(\log u)/L_3-1$ arbitrarily small at explicit sufficiently large thresholds. Their product gives $(u\log u)/L_2\to12$. Moreover $u\ge\sqrt{L_2}$ proves its growth. The same parameter estimates give $u\le48L_2$ and $\log Z\ge\sqrt L/48$; at the chosen larger threshold, a quadratic exponential bound implies $48L_2\le\sqrt Z$. Thus the range in (14) is proved for these exact parameters. These are parameter limits, not estimates for the number of smooth integers. +The bound $\log t\le2\sqrt t$ makes both $r-1$ and $\frac{\log u}{L_3}-1$ arbitrarily small at explicit sufficiently large thresholds. Their product gives $\frac{u\log u}{L_2}\to12$. Moreover $u\ge\sqrt{L_2}$ proves its growth. The same parameter estimates give $u\le48L_2$ and $\log Z\ge\sqrt L/48$; at the chosen larger threshold, a quadratic exponential bound implies $48L_2\le\sqrt Z$. Thus the range in (14) is proved for these exact parameters. These are parameter limits, not estimates for the number of smooth integers. Take the eventual error tolerance $1/2$, so $u\log u\ge(23/2)L_2$, and enlarge the threshold until $\sqrt u\ge288\log4$. Then the positive shift term in (14) is at most $u\log u/48$. Its total exponent is therefore at most $$ @@ -471,11 +475,11 @@ A lower-bound construction supplies no upper bound for $G_2$, no conclusion about infinitely many twin primes, and no assertion about a specified interval containing a twin pair. ## 9. Seven retained open obligations from the original manuscript -The following blocks preserve the original printed statements and their surrounding domains. Their equation numbers refer to `original-manuscript-verbatim.md`, not the independently numbered formulas above. **OPEN** means not established as that full statement by the frozen proof package. It does not dispute an external published theorem. Each obligation is distinct from the sufficient finite estimate used in this paper. +The following blocks retain the original statements and domains, with the O5 sieve interface and its application explicitly corrected below. The original equation numbers refer to `original-manuscript-verbatim.md`, not the independently numbered formulas above. The earlier wording is preserved in the [complete manuscript baseline](https://solveathome.org/files/6c287c180b331318a19b3fb0a0e571147e01d785c4efa4341cf3bba5bd1c8e80). **OPEN** means not established as that full statement by the frozen proof package. It does not dispute an external published theorem or erase later evidence for a narrower component. Each obligation is distinct from the sufficient finite estimate used in this paper. -### O1. OPEN — Mertens prime-harmonic asymptotic (original Eq. 8) +### O1. OPEN: Mertens prime-harmonic asymptotic (original Eq. 8) The exact constant-plus-o(1) prime harmonic asymptotic is not proved. Section 5 uses elementary finite product bounds instead. @@ -489,9 +493,9 @@ > We need only bounded errors and differences of this estimate, not a > numerically explicit error term. Its use is recorded in [R4, section 6.3] > and in [KK, section 2]. -### O2. OPEN — Uniform smooth-number asymptotic (original Eq. 9) +### O2. OPEN: Uniform smooth-number asymptotic (original Eq. 9) The two-variable uniform equality for every fixed positive epsilon, with Z and u both tending to infinity, remains open in this package. The finite upper bound in Section 6 is sufficient at A=12 and has a weaker decay exponent. @@ -511,9 +515,9 @@ > the underlying range (1.13) of its Theorem 1.2 as > $(\log x)^{1+\varepsilon}\leq y\leq x$, (1.13)$'$ on p. 418. > We will use only its upper-bound consequence. -### O3. OPEN — The arbitrary fixed A>4 route (original Eqs. 23–24) +### O3. OPEN: The arbitrary fixed A>4 route (original Eqs. 23–24) Quantified parameter limits underlying Eq.23 are proved for $A\ge4$ with $B=\operatorname{chooseB}(A)$. The printed smooth equality and $o(y/L)$ conclusion for every fixed $A>4$ in Eq.24 are not proved. The main theorem fixes $A=12$; its logarithmic shape is unchanged. @@ -544,9 +548,9 @@ > $L^{4-A+o(1)}L_3^2/L_2^4$, which tends to zero. > This discharges the smooth-number range rather than assuming that a > fixed-$u$ estimate applies while $u$ grows. -### O4. OPEN — Dyadic prime-count asymptotic (original Eq. 10) +### O4. OPEN: Dyadic prime-count asymptotic (original Eq. 10) The coefficient-$1/2$ asymptotic is not proved. The literal inclusive reserved interval has the sufficient eventual lower bound $y/(3\log y)$ proved in Section 7. @@ -559,11 +563,11 @@ > $$ > No explicit prime-count threshold is required. This is the final counting > input in [KK, section 2] and [R4, section 7]. -### O5. OPEN — External one-class comparison and the general quoted sieve (original Eqs. 5–7, 11) +### O5. OPEN: External one-class comparison and the general quoted sieve (original Eqs. 5–7, 11) -The full external Ford–Green–Konyagin–Maynard–Tao one-class theorem and the quoted arbitrary-kappa/multiplicative-g/nonnegative-weight sieve are not established here as those statements. Actual incidence/CRT moments, the residue-set interpretation, and the required finite dimension-four sieve are proved. The finite cover identity is also proved, and is not an open obligation. +The full external Ford–Green–Konyagin–Maynard–Tao one-class theorem and a correctly qualified general sieve remain external to the frozen proof package. Actual incidence/CRT moments, the residue-set interpretation, and the required finite dimension-four sieve are proved. The finite cover identity is also proved. The embedding in original Eq. (4) now has the separate kernel-checked maximum formulation in [return #5265](https://solveathome.org/projects/twin-primes/return/5265), accepted as proven after reviewer #1828's rerun. Its domain is every integer modulus $P\ge1$, with largest gaps over all integer starts. Return #2472 already covered its per-width form. This evidence closes the embedding component, while the external one-class asymptotic in Eq. (5) remains separate. No proof was rerun for this editorial revision. Original statement and domain (`original-manuscript-verbatim.md`, lines 116–131): @@ -584,50 +588,46 @@ > is external mathematical input, not a result established by computation > in this assignment. -Original statement and domain (`original-manuscript-verbatim.md`, lines 138–160): +Corrected interface corresponding to the original Input S (`original-manuscript-verbatim.md`, lines 138–160). The earlier formulation allowed $\frac{g(p)}{p}$ arbitrarily close to $1$ while claiming a constant depending only on $\kappa$; that formulation is invalid. Finding #120070 and [return #4439, review #1620](https://solveathome.org/projects/twin-primes/return/4439) record the defect. The operative interface below includes a fixed local-density margin and fixed level constant. It is an open external input, not a theorem established by this manuscript and not a verbatim quotation of Kalmynin–Konyagin. -> **Input S ([KK, Lemma 1]).** Let $\kappa$ be fixed. For primes $p\leq z$, +> **Input S (corrected general interface).** Fix $\kappa>0$, $A>1$ and $C_{\rm lev}>0$. Let $X\ge2$ and $2\le z\le C_{\rm lev}X$. For primes $p\leq z$, > suppose a multiplicative function $g$ satisfies -> $0\leq g(p)\leq\kappa$ and $g(p) $0\leq g(p)\leq\kappa$ and the uniform margin +> $$ +> \frac{g(p)}p\le1-\frac1A.\qquad(\Omega_1) +> $$ +> Suppose nonnegative weights > $w_t$ satisfy, for every squarefree $d\mid P(z)$, > $$ > \sum_{d\mid t}w_t=\frac{Xg(d)}d+r_d,\qquad |r_d|\leq g(d). > \tag{6} > $$ -> With $z\ll X$, the quoted lemma bounds their sifted sum by +> The general bound sought under these hypotheses is > $$ > \sum_{\gcd(t,P(z))=1}w_t -> \ll_\kappa X\prod_{p\leq z}\left(1-\frac{g(p)}p\right). +> \ll_{\kappa,A,C_{\rm lev}} X\prod_{p\leq z}\left(1-\frac{g(p)}p\right). > \tag{7} > $$ -> We use only $z\leq X$; its proportionality constant is fixed. -> The statement was read in arXiv v2, page 4, and in the journal's online -> text. Its proof cites Halberstam and Richert, *Sieve Methods* (1974), -> Theorem 2.2. That printed book theorem has not been independently read -> here. A second carrier of the same statement is [FI], Theorem 6.9 with -> Corollary 6.10: it was reached at OCR custody in return #158 and -> re-read there, so it is not counted as a page reading. Sections 4--8 -> establish deductions conditional on using (7) in this stated form. They -> do not reconstruct its underlying sieve proof. +> The intended concrete level has $C_{\rm lev}=1$; changing the level constant is not free. The historical source record read Kalmynin–Konyagin, arXiv v2, page 4, and the journal text, and traced its sieve input to Halberstam and Richert, *Sieve Methods* (1974), Theorem 2.2. This editorial revision did not read that printed book page. The secondary Friedlander–Iwaniec citation, Theorem 6.9 with Corollary 6.10, remains the OCR-custody record of return #158, not an independent page verification here. A source reading and the precise general theorem remain obligations. The finite proof in Sections 4–8 above instead proves the particular bounds it needs and does not assume this general Input S. -Original statement and domain (`original-manuscript-verbatim.md`, lines 196–228): +Corrected application corresponding to the original Lemma 2 (`original-manuscript-verbatim.md`, lines 196–228). The density margin and parameter dependence in corrected Input S are retained: > **Lemma 2 (elementary reduction from Input S).** For sets > $\Omega_p\subset\mathbb Z/p\mathbb Z$ with -> $g(p)=|\Omega_p|\leq\kappa$ and $g(p) $g(p)=|\Omega_p|\leq\kappa$ and $\frac{g(p)}{p}\le1-1/A$, define > $$ > S(X,\Omega)= > \#\{1\leq n\leq X:n\bmod p\notin\Omega_p > \text{ for every }p\leq z\}, > \qquad > V(z)=\prod_{p\leq z}\left(1-\frac{g(p)}p\right). > $$ -> For integral $X$ and $z\ll X$, Input S implies +> For integer $X\ge2$ and $2\le z\le C_{\rm lev}X$, corrected Input S would imply > $$ -> S(X,\Omega)\ll_\kappa X V(z). +> S(X,\Omega)\ll_{\kappa,A,C_{\rm lev}} X V(z). > \tag{11} > $$ > > **Proof.** For $1\leq n\leq X$, set @@ -645,12 +645,14 @@ > $|r_d|\leq g(d)$, for every such $d$, including $d>X$. > > Since $D(n)\mid P(z)$, it is coprime to $P(z)$ exactly when > $D(n)=1$. Hence the left side of (7) is exactly $S(X,\Omega)$. -> Applying Input S proves (11). $\square$ +> Applying corrected Input S would give (11). $\square$ -### O6. OPEN — Original harmonic-density expansion and two-sided Euler-product comparisons (Eqs. 20–21) +For the actual residue data in (5), $g(2)=1$, $g(3)=2$, and $g(p)\le4$ for $p\ge5$. Thus $\frac{g(p)}{p}\le4/5$ at every prime, so $A=5$ is a valid fixed choice. At sufficiently large $y$, the interval size is at least $2$ and the stated concrete level condition is available. This check supplies the omitted margin for the concrete data; it neither proves the general sieve nor justifies a constant uniform as $A$ varies. The independently proved finite sieve in Section 5 and Theorem 1 are unchanged. +### O6. OPEN: Original harmonic-density expansion and two-sided Euler-product comparisons (Eqs. 20–21) + The printed $O(1)$ harmonic-density expansion and both directions of the $\asymp$ product comparisons remain unproved as stated. One-sided finite inequalities (10)–(11) and the exact parameter substitution prove the required sieve budget. Original statement and domain (`original-manuscript-verbatim.md`, lines 355–387): @@ -688,11 +690,11 @@ > After fixing $A$, choose $B$ large enough that this term is at most > $y/(4L)$ for all sufficiently large $y$. We have not assigned a > numerical value to the sieve constant. -### O7. OPEN — The separate short construction and its priced constant (original Eq. 28) +### O7. OPEN: The separate short construction and its priced constant (original Eq. 28) -The original $m=\lfloor c y\log y\rfloor$, $z=\sqrt m$ derivation, its $4Cc+o(1)$ coefficient and quoted numerical pricing remain unproved. The original Eq.27 endpoint is actually proved by PrimaryMain.eventual_y_log_gap through the main theorem; it is not classified as an unproved endpoint. +The original $m=\lfloor c y\log y\rfloor$, $z=\sqrt m$ derivation, its $4Cc+o(1)$ coefficient and quoted numerical pricing remain unproved. Its references below to Input S are archival: the operative general input is the corrected O5 interface, with $X\ge2$, a fixed level condition and the margin $\Omega_1$. Its constant can depend on $\kappa,A,C_{\rm lev}$, so the historical numerical pricing is not established by omitting those dependencies. The original Eq.27 endpoint is actually proved by PrimaryMain.eventual_y_log_gap through the main theorem; it is not classified as an unproved endpoint. Original statement and domain (`original-manuscript-verbatim.md`, lines 455–484): @@ -729,11 +731,11 @@ ## 10. Source correspondence and review boundary -The source map accompanying this paper records each section's frozen files, declaration locators, exact source hashes, and statement qualifications. The mathematical chain is finite covering → actual incidence sieve → the smooth budget at $A=12$ and elementary prime supply → cover completion → integer maximum binding. Named intermediate estimates with hypotheses, such as the range conditions in (14), are used only after the parameter lemmas discharge those hypotheses. A definition of a target proposition is not treated as its proof. +The [preserved proof-to-exposition map](https://solveathome.org/files/b6b75ca5c75fa20a4050dc73b12f4a375427a5686361e41f3033835bf485f2d5), from return #2597, records the frozen baseline's files, declaration locators, exact source hashes, and statement qualifications. This editorial revision changes O5's general interface and provenance commentary; the map is historical evidence for the unchanged proof package, not an automatic review of the new wording. The mathematical chain is finite covering → actual incidence sieve → the smooth budget at $A=12$ and elementary prime supply → cover completion → integer maximum binding. Named intermediate estimates with hypotheses, such as the range conditions in (14), are used only after the parameter lemmas discharge those hypotheses. A definition of a target proposition is not treated as its proof. -The proof package's axiom policy allows only Lean's standard `propext`, `Classical.choice`, and `Quot.sound`; individual closures may use a subset. There is no mathematical premise named Input S, M, H, or P in the three final theorem statements. This writing task inspected source and existing evidence and did not run a new proof build or independent checker. Compiler and kernel evidence belongs to its pinned proof package. The new manuscript hash requires an actual new statement-binding review before any public acceptance claim is made. +The proof package's axiom policy allows only Lean's standard `propext`, `Classical.choice`, and `Quot.sound`; individual closures may use a subset. There is no mathematical premise named Input S, M, H, or P in the three final theorem statements. This writing task inspected source and existing evidence and did not run a new proof build or independent checker. Compiler and kernel evidence belongs to its pinned proof package. For the baseline manuscript hash `6c287c180b331318a19b3fb0a0e571147e01d785c4efa4341cf3bba5bd1c8e80`, return #2597 records statement review #695 and kernel receipt #31 (`lean-kernel-v1`). Trusted review #696 accepted Theorem 1 at rung proven for the three mapped declarations only. It reused the receipt and read its evidence without a new Lean rerun. That acceptance does not cover O1–O7 as established claims, the separate $y\log y$ corollary as a reviewed binding, or the whole expository prose. This revised manuscript has a new hash and requires editorial/statement review of its changed passages; it does not erase or enlarge the earlier acceptance. The construction's mathematical lineage remains the original manuscript's project record and Kalmynin–Konyagin three-band architecture. In particular, their polynomial root problem and the fixed-separation pair here are different extremal objects; we do not identify their theorem directly with (1). The finite Möbius/diagonalization adaptation in `SelbergFinite.lean` retains its Arend Mellendijk copyright and PNT+ source credit. The ordinary primorial estimate and arithmetic-function identities are established library dependencies. Full uniform smooth asymptotics, prime-number-theorem asymptotics, and the general external sieve statement remain in Section 9. The adapted-source credits are explicit in the frozen Lean headers and remain in those files: @@ -744,4 +746,65 @@ These code notices and licenses are distinct from the project manuscript's prose publication terms. Attribution additions do not assert sole authorship, a new grant in external material, or completion of the separate source-ledger repair. [Job #3880](https://solveathome.org/projects/twin-primes/job/3880) remains a generated-index/source-provenance repair awaiting the specifically chosen source expert and authoritative history; this manuscript correction neither fabricates that chronology nor closes the handoff. Bibliographic provenance is preserved from the original rather than newly audited here: A. B. Kalmynin and S. V. Konyagin, *A polynomial analogue of Jacobsthal function*, *Izvestiya: Mathematics* **88** (2) (2024), 225–235, DOI 10.4213/im9467e, arXiv:2302.00459v2; A. Hildebrand and G. Tenenbaum, *Integers without large prime factors*, *Journal de Théorie des Nombres de Bordeaux* **5** (1993), 411–484; and the historical sieve citations to Halberstam–Richert and Friedlander–Iwaniec. The original reference list, source-access qualifications, and project contributions remain available verbatim. No novelty or independent literature-completeness claim is made by this rewrite. + + +## Claim sources + +Current equation numbers (1)–(21) refer to Sections 1–8. “Original Eq.” labels refer to the archived statements in O1–O7 and have separate rows even when their numbers coincide. File links below identify immutable source bytes; the line/declaration locators come from the preserved proof-to-exposition map, SHA-256 `b6b75ca5c75fa20a4050dc73b12f4a375427a5686361e41f3033835bf485f2d5`. They are source correspondence, not a fresh compiler or kernel check. Return #2597, statement review #695, kernel receipt #31 and trusted review #696 support the unchanged three mapped main claims for the baseline manuscript. Their scope does not automatically extend to every row, the open general inputs, or this revised hash. Definitions and intermediate estimates retain their stated hypotheses. No numerical table or new experiment is claimed here. + +| Claim, equation or value | Exact source and locator | Calibration and scope | +|---|---|---| +| Theorem 1; current Eq. (1); attained integer maximum | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`PrimaryMain.lean:38`, `PrimaryMain.manuscript_main_goal`](https://solveathome.org/files/cff1bb8609e7ca834419684da3c81bb8630f85a7730ea5b0dd3018f24504ed68); [`IntegerMainBinding.lean:29`, `IntegerMainBinding.integer_maximum_binding`](https://solveathome.org/files/6a87d6209746e706bd2d44629f0333815b36a2f542d609ca8ff13f682d889e09); [`IntegerMainBinding.lean:36`, `IntegerMainBinding.manuscript_integer_main_goal`](https://solveathome.org/files/6a87d6209746e706bd2d44629f0333815b36a2f542d609ca8ff13f682d889e09); statement review #695, kernel receipt #31 and trusted review #696. | The three mapped claims were accepted as proven for the baseline. Domain: every sufficiently large real y and the full prime cutoff; the maximum binding takes a finite prime family. No whole-manuscript or new-hash acceptance follows. | +| Current Eq. (2); cover length m and gap distance m+1 | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`Gaps.lean:100`, `KKFiniteCoreProof.cover_iff_gap_bound`](https://solveathome.org/files/8ba9d1d44ad5c19bceea560734b271516e2fbb2032af4ba62875436090c1b30f); [`Arithmetic.lean:57`, `KKFiniteCoreProof.crt_phase`](https://solveathome.org/files/e97f06258ece1ed02d30a73e73149bcf4cdf695b188fd3b7d7049dfec6270a75); [`Bridges.lean:14`, `KKFiniteCoreProof.fixed_phase_local_bridge`](https://solveathome.org/files/abb24fd3e031f070ff19c20cebbb2063eb22d76c75c8c0f891ad5c9f62f671be) | Finite-cover correspondence used by the main proof; includes m=0, the empty family and period-crossing gaps. This is a package locator, not a separate prose-review verdict. | +| Current Eq. (3); parameters z0, z1, m; fixed A=12 | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`ManuscriptParameters.lean:15`, `ManuscriptParameters.z0`](https://solveathome.org/files/927d7e627436e197b3b644bc13866bea4775b820eaa332af13966de0c40fce03); [`ManuscriptParameters.lean:16`, `ManuscriptParameters.z1`](https://solveathome.org/files/927d7e627436e197b3b644bc13866bea4775b820eaa332af13966de0c40fce03); [`ManuscriptParameters.lean:17`, `ManuscriptParameters.m`](https://solveathome.org/files/927d7e627436e197b3b644bc13866bea4775b820eaa332af13966de0c40fce03) | Definitions of the construction; A=12 is the sufficient fixed choice used by the accepted main proof, not an optimized value. | +| Current Eq. (4); geometry and the additive 2 | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`ManuscriptParameters.lean:155`, `ManuscriptParameters.geometry`](https://solveathome.org/files/927d7e627436e197b3b644bc13866bea4775b820eaa332af13966de0c40fce03) | Conditional geometry lemma with A>=4, B>=1 and its stated sufficient threshold; the final main theorem discharges these conditions. | +| Geometry constants 4096 log 4, 16A, 3072 and 1/2 | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`ManuscriptParameters.lean:18`, `ManuscriptParameters.threshold`](https://solveathome.org/files/927d7e627436e197b3b644bc13866bea4775b820eaa332af13966de0c40fce03); [`ManuscriptParameters.lean:155`, `ManuscriptParameters.geometry`](https://solveathome.org/files/927d7e627436e197b3b644bc13866bea4775b820eaa332af13966de0c40fce03) | Sufficient geometry bounds in Section 3, not a practical onset estimate. | +| Current Eq. (5); local counts 1 at 2, 2 at 3, 4 in the middle band | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`ManuscriptResidues.lean:15`, `ManuscriptResidues.omegaSet`](https://solveathome.org/files/a2ca43af4c608c303a7a2b1e61ca6b04677e636017937c3161e5c6fe1c272515); [`ManuscriptResidues.lean:112`, `ManuscriptResidues.omega_card`](https://solveathome.org/files/a2ca43af4c608c303a7a2b1e61ca6b04677e636017937c3161e5c6fe1c272515); [`ManuscriptResidues.lean:127`, `ManuscriptResidues.omega_bounds`](https://solveathome.org/files/a2ca43af4c608c303a7a2b1e61ca6b04677e636017937c3161e5c6fe1c272515); [`EarlyCover.lean:39`, `EarlyCover.prime_partition`](https://solveathome.org/files/0b884aca9d50098665535a5bd4dedd9fa00e96b95b13fb8e48a4037b83ca9f59) | Exact residue definitions and counts on the stated prime/band domain; the cover and auxiliary sieve remain distinct. | +| Current Eq. (6); uncovered-index trichotomy and count | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`EarlyCover.lean:172`, `EarlyCover.proposition3`](https://solveathome.org/files/0b884aca9d50098665535a5bd4dedd9fa00e96b95b13fb8e48a4037b83ca9f59); [`EarlyCover.lean:188`, `EarlyCover.uncovered_count`](https://solveathome.org/files/0b884aca9d50098665535a5bd4dedd9fa00e96b95b13fb8e48a4037b83ca9f59) | Finite upper bound with the actual m+2 range and all parameter hypotheses retained. | +| Current Eq. (7); short term y/(24L) | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`ReserveBudget.lean:91`, `ReserveBudget.short_floor_budget`](https://solveathome.org/files/dfaf920d927f70fdea77cf67290461f1235e20fd0234c91f3a2d897351a888c0) | Sufficient eventual bound on the natural floor, not an asymptotic identity. | +| Current Eq. (8); incidence weights and divisor remainder | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`IncidenceMoments.lean:9`, `IncidenceMoments.incidence`](https://solveathome.org/files/e91ba8ae5e2d5083ec5946a9a3da2907ebccdc209eb7a595098f44a494757021); [`IncidenceMoments.lean:18`, `IncidenceMoments.weight`](https://solveathome.org/files/e91ba8ae5e2d5083ec5946a9a3da2907ebccdc209eb7a595098f44a494757021); [`CRTMoments.lean:112`, `CRTMoments.residues_card`](https://solveathome.org/files/a9ef14df63a94ed4b51dc1c290b4cbb750ca517c58a519020ffc7e30b5e7fb36); [`DivisorMoments.lean:107`, `DivisorMoments.real_divisor_moment_remainder`](https://solveathome.org/files/9be86aa88442c3c7662442d662adfe6266529d413c0f47670fc99cdc2a65eaf3); [`SieveInterface.lean:113`, `SieveInterface.actual_all_sifted_count`](https://solveathome.org/files/ea07fcd56eb2688d70125f4b0ed11080554dc56821fd73489ab5683882384d73) | Actual nonnegative interval-count weights; CRT and per-class discrepancy supply the moment bound, including d>X. | +| Selberg denominator J(H), coefficients and quadratic main term | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`SelbergFinite.lean:60`, `SelbergFinite.denominator`](https://solveathome.org/files/8b10b2d4bc002b7dc6067b0b73197cf4715b0c3c7ca601025942c2ed84ec0177); [`SelbergFinite.lean:74`, `SelbergFinite.coefficients`](https://solveathome.org/files/8b10b2d4bc002b7dc6067b0b73197cf4715b0c3c7ca601025942c2ed84ec0177); [`SelbergFinite.lean:178`, `SelbergFinite.optimized_main`](https://solveathome.org/files/8b10b2d4bc002b7dc6067b0b73197cf4715b0c3c7ca601025942c2ed84ec0177); [`SelbergFinite.lean:213`, `SelbergFinite.actual_optimized_upper`](https://solveathome.org/files/8b10b2d4bc002b7dc6067b0b73197cf4715b0c3c7ca601025942c2ed84ec0177) | Finite identities with the squared support convention d^2<=H; not the open general Input S. | +| Coefficient bound d; lcm count 3^omega; 12^omega<=4n^2; error 4H^5 | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`SelbergError.lean:117`, `SelbergError.actual_coefficient_abs_le`](https://solveathome.org/files/3ee375547c7fd4acd5796f3f072be725abeba7d2f2f9b40cf73b3f7313c5402f); [`SelbergError.lean:172`, `SelbergError.actual_upper_coarse_error`](https://solveathome.org/files/3ee375547c7fd4acd5796f3f072be725abeba7d2f2f9b40cf73b3f7313c5402f); [`SieveCoarse.lean:136`, `SieveCoarse.actual_survivor_le`](https://solveathome.org/files/8bc57801384e29fc3b6d53e4bec64cea1fb4f77865fdb36fb5b834e457ac5d03) | Coarse sufficient remainder estimate for the concrete data, retaining the exceptional small-prime factors. | +| Half-mass denominator bound and log H/4 condition | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`SelbergEuler.lean:58`, `SelbergEuler.sieve_euler_truncation`](https://solveathome.org/files/a6e6cf8796eeb4e43a5351f90e932304632a819638c34202da04efb0e8da7d56); [`SelbergEuler.lean:181`, `SelbergEuler.denominator_lower`](https://solveathome.org/files/a6e6cf8796eeb4e43a5351f90e932304632a819638c34202da04efb0e8da7d56) | Finite Euler first-moment argument under its displayed moment and positivity conditions. | +| Current Eq. (9); prime-log bound log 4 (2+log N) | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`PrimeLog.lean:108`, `PrimeLog.prime_log_mass_le`](https://solveathome.org/files/8ef54f9d6fb8d484e2f9822ccd5ad063d93cf7141e8f1dc8c0bbc6d41022bd90) | Finite bound for N>=2; no prime number theorem is asserted. | +| k=512 log 4; H=exp(L/16); E=20 log 4 k+80 log 4; Cs=2exp(E) | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`EulerRatio.lean:128`, `EulerRatio.actual_survivor_full_bound`](https://solveathome.org/files/0a09cda1f89f410af890f9085bfbda225136f69ebeab17fbd5ba5e4d13350294); [`SieveParameters.lean:169`, `SieveParameters.actual_uniform_survivor`](https://solveathome.org/files/f7d83b195e5748ef941f5d7a1c9fcd9b11ad99893bac45b9342e1d558939007b) | Fixed coarse constants and the scale choice in the preserved Section 5 proof, as explained in return #2597 and reviewed in #696. | +| Current Eq. (10); full Euler-product sieve bound and y/(12L) | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`EulerRatio.lean:128`, `EulerRatio.actual_survivor_full_bound`](https://solveathome.org/files/0a09cda1f89f410af890f9085bfbda225136f69ebeab17fbd5ba5e4d13350294); [`SieveParameters.lean:169`, `SieveParameters.actual_uniform_survivor`](https://solveathome.org/files/f7d83b195e5748ef941f5d7a1c9fcd9b11ad99893bac45b9342e1d558939007b) | Actual finite sieve at its sufficient y threshold; no unspecified general sieve axiom is used. | +| Current Eq. (11); C=4exp(10 log 4) and factor 128 C^2 | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`MertensBand.lean:181`, `MertensBand.ordinary_inverse_le`](https://solveathome.org/files/6ee922c80814b35e0d47011a2bcb164e99467c85d190f92eb098ab8ba9be17d9); [`MertensBand.lean:333`, `MertensBand.band_product_le`](https://solveathome.org/files/6ee922c80814b35e0d47011a2bcb164e99467c85d190f92eb098ab8ba9be17d9); [`MertensBand.lean:408`, `MertensBand.actual_auxiliary_product_le`](https://solveathome.org/files/6ee922c80814b35e0d47011a2bcb164e99467c85d190f92eb098ab8ba9be17d9); [`RealBand.lean:127`, `RealBand.actual_product_real_le`](https://solveathome.org/files/879496b2388f74b475fa7ac85918f76d58b3a9a671c64fbd9128b11cbebeac36) | Sufficient one-sided finite product bounds with real-cutoff conditions; no two-sided asymptotic or unit leading constant. | +| K=Cs 128 C^2; B=1+6K12^4; sieve budget y/(4L) | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`RealBand.lean:177`, `RealBand.actual_survivor_band_le`](https://solveathome.org/files/879496b2388f74b475fa7ac85918f76d58b3a9a671c64fbd9128b11cbebeac36); [`ManuscriptParameters.lean:226`, `ManuscriptParameters.chooseB`](https://solveathome.org/files/927d7e627436e197b3b644bc13866bea4775b820eaa332af13966de0c40fce03); [`ManuscriptParameters.lean:228`, `ManuscriptParameters.chosen_B_budget`](https://solveathome.org/files/927d7e627436e197b3b644bc13866bea4775b820eaa332af13966de0c40fce03) | Fixed generous coefficient choice for the concrete construction, not a uniform constant for arbitrary A or B. | +| Current Eq. (12); finite Rankin inequality | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`SmoothRankin.lean:80`, `SmoothRankin.finite_rankin`](https://solveathome.org/files/3675eac4ebf6fca98e99e8cd1ee54bf133cbf45925f1e54f45f6d0df0fa79d53); [`SmoothParameters.lean:135`, `SmoothParameters.actual_Psi_eq`](https://solveathome.org/files/0e231daeee4396300239389fcc537f9cd442ee88dcce3a5281d2ac7efeebcb2a) | Finite-prime smooth count, with positive-integer and real-cutoff conventions preserved; not convergence of an unrestricted zeta series. | +| Current Eq. (13); shifted local Euler-factor bound | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`ShiftedRankin.lean:14`, `ShiftedRankin.delta_bounds`](https://solveathome.org/files/3e0eaa6620c3c8dfb95771fc7fa2566fa10bc28f69954cf786e6485a838f5986); [`ShiftedRankin.lean:73`, `ShiftedRankin.prime_ratio_le`](https://solveathome.org/files/3e0eaa6620c3c8dfb95771fc7fa2566fa10bc28f69954cf786e6485a838f5986) | The displayed shift requires its U,Z and delta range; those conditions are later discharged for the chosen parameters. | +| Current Eq. (14); shifted-product/Psi bound and coefficient 6 log 4 | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`ShiftedRankin.lean:190`, `ShiftedRankin.shifted_product_le`](https://solveathome.org/files/3e0eaa6620c3c8dfb95771fc7fa2566fa10bc28f69954cf786e6485a838f5986); [`ShiftedRankin.lean:246`, `ShiftedRankin.finite_Psi_bound`](https://solveathome.org/files/3e0eaa6620c3c8dfb95771fc7fa2566fa10bc28f69954cf786e6485a838f5986) | Finite conditional upper bound with U>=1, log Z>=1 and U<=sqrt Z, not the full uniform smooth asymptotic in O2. | +| u log u/L2 tends to 12; u and Z grow; eventual range | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`SmoothParameters.lean:282`, `SmoothParameters.eventual_u_growth`](https://solveathome.org/files/0e231daeee4396300239389fcc537f9cd442ee88dcce3a5281d2ac7efeebcb2a); [`SmoothParameters.lean:300`, `SmoothParameters.eventual_Z_growth`](https://solveathome.org/files/0e231daeee4396300239389fcc537f9cd442ee88dcce3a5281d2ac7efeebcb2a); [`SmoothParameters.lean:312`, `SmoothParameters.eventual_u_range`](https://solveathome.org/files/0e231daeee4396300239389fcc537f9cd442ee88dcce3a5281d2ac7efeebcb2a); [`SmoothLogLimit.lean:97`, `SmoothLogLimit.eventual_log_u_ratio`](https://solveathome.org/files/0f2f603ee9dd4764942eaddca94f211015ff1fba8737abe7dfddaca8f025a976); [`SmoothLogLimit.lean:136`, `SmoothLogLimit.eventual_u_log_u`](https://solveathome.org/files/0f2f603ee9dd4764942eaddca94f211015ff1fba8737abe7dfddaca8f025a976) | Quantified parameter limits for the chosen construction; no general Input H is inferred. | +| Smooth-budget constants 23/2, 288 log 4, 529/96, 11/2, 96C | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`SmoothBudget.lean:100`, `SmoothBudget.finite_smooth_budget`](https://solveathome.org/files/d69ec8f998d2c866e97eaeb92c7f7c3f237e642d919f52b99e6543dc47949bc2); [`SmoothBudget.lean:123`, `SmoothBudget.eventual_smooth_and_uncovered_budget`](https://solveathome.org/files/d69ec8f998d2c866e97eaeb92c7f7c3f237e642d919f52b99e6543dc47949bc2) | Arithmetic in the sufficient A=12 smooth budget, not numerical optimization or an observed experimental threshold. | +| Current Eq. (15); smooth term y/(24L) | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`SmoothBudget.lean:100`, `SmoothBudget.finite_smooth_budget`](https://solveathome.org/files/d69ec8f998d2c866e97eaeb92c7f7c3f237e642d919f52b99e6543dc47949bc2); [`SmoothBudget.lean:123`, `SmoothBudget.eventual_smooth_and_uncovered_budget`](https://solveathome.org/files/d69ec8f998d2c866e97eaeb92c7f7c3f237e642d919f52b99e6543dc47949bc2) | Sufficient eventual inequality; the required growth and range conditions are discharged before final use. | +| Current Eq. (16); reserved-prime supply y/(3 log y) | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`PrimeReserveBudget.lean:220`, `PrimeReserveBudget.actual_reserved_supply`](https://solveathome.org/files/1895d0e7ea7cc573477a2ca95f98d5f7b9ecde7b6330b230f4cc9e4afaf7e5ea) | Inclusive reserved interval and a sufficient lower bound; the coefficient-1/2 PNT asymptotic remains separate. | +| Current Eq. (17); factorial-log error 1+log(x+1) | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`FactorialLogBounds.lean:14`, `FactorialLogBounds.increment_bounds`](https://solveathome.org/files/0b396c1731097a09b0a154b3c54c2b102699e880b5c51aae984ae58f88e564ea); [`FactorialLogBounds.lean:68`, `FactorialLogBounds.log_factorial_bounds`](https://solveathome.org/files/0b396c1731097a09b0a154b3c54c2b102699e880b5c51aae984ae58f88e564ea) | Finite factorial estimates, including the stated small-x convention. | +| Period-30 wheel; values 0 or 1 and first five values 1 | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`FactorialWheel.lean:12`, `FactorialWheel.wheel`](https://solveathome.org/files/4f2baae48b58657da06269f91c7534bb8293b6a4943f62e8fe40897927181ea4); [`FactorialWheel.lean:19`, `FactorialWheel.wheel_zero_or_one`](https://solveathome.org/files/4f2baae48b58657da06269f91c7534bb8293b6a4943f62e8fe40897927181ea4); [`FactorialWheel.lean:24`, `FactorialWheel.wheel_one`](https://solveathome.org/files/4f2baae48b58657da06269f91c7534bb8293b6a4943f62e8fe40897927181ea4) | Exact finite wheel identity used in the factorial argument, not numerical evidence for the final asymptotic. | +| Current Eq. (18); wheel error 5(1+log(x+1)) | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`FactorialWheel.lean:79`, `FactorialWheel.F_error`](https://solveathome.org/files/4f2baae48b58657da06269f91c7534bb8293b6a4943f62e8fe40897927181ea4); [`FactorialWheel.lean:137`, `FactorialWheel.T_error`](https://solveathome.org/files/4f2baae48b58657da06269f91c7534bb8293b6a4943f62e8fe40897927181ea4) | Bound obtained from the signed factorial wheel with the displayed real domain. | +| Current Eq. (19); weighted factorial/von-Mangoldt identity | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`PrimeFactorial.lean:49`, `PrimeFactorial.log_factorial_weighted`](https://solveathome.org/files/515c254617ee171c49108aa3509c8e7e3b98bdb0a7ff7d4703db97fd9bd8ecc4); [`PrimeFactorial.lean:82`, `PrimeFactorial.T_eq_weighted_wheel`](https://solveathome.org/files/515c254617ee171c49108aa3509c8e7e3b98bdb0a7ff7d4703db97fd9bd8ecc4); [`PrimeFactorial.lean:144`, `PrimeFactorial.primePsi_sub_sixth_le_T`](https://solveathome.org/files/515c254617ee171c49108aa3509c8e7e3b98bdb0a7ff7d4703db97fd9bd8ecc4) | Finite divisor identity and strip comparison; not an invoked PNT formula. | +| Current Eq. (20); two-sided psi bounds and coefficients 6/5, 5 | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`PrimePsiBounds.lean:93`, `PrimePsiBounds.primePsi_two_sided`](https://solveathome.org/files/2f26fc0a8102841431a82579107d29d58ab33defaed2cbd98a8c5aa73a1d4219) | Elementary sufficient psi bounds with the stated N and logarithm conventions. | +| Current Eq. (21); higher-prime-power tail 2 sqrt(N)(log N)^2 | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`PrimePowerTail.lean:84`, `PrimePowerTail.tail_image_cover`](https://solveathome.org/files/f496214b282b394abb5f0b5ded6c45a06eb17dab92095c56023e0728b5c4f2c8); [`PrimePowerTail.lean:130`, `PrimePowerTail.primePsi_theta_tail_bound`](https://solveathome.org/files/f496214b282b394abb5f0b5ded6c45a06eb17dab92095c56023e0728b5c4f2c8) | Finite image-cover upper bound; injectivity of the base/exponent representation is not assumed. | +| Rational logarithm checks; a>=31/36 and a<=2 | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`FactorialWheel.lean:52`, `FactorialWheel.a_lower`](https://solveathome.org/files/4f2baae48b58657da06269f91c7534bb8293b6a4943f62e8fe40897927181ea4); [`PrimeReserveBudget.lean:150`, `PrimeReserveBudget.theta_dyadic_budget`](https://solveathome.org/files/1895d0e7ea7cc573477a2ca95f98d5f7b9ecde7b6330b230f4cc9e4afaf7e5ea) | Sufficient rational bounds used in the package; no fresh numerical logarithm calculation was performed for this revision. | +| 300000^4; 128, 2932, 3060, 275400; error y/90; dyadic margin y/3 | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`PrimeReserveBudget.lean:27`, `PrimeReserveBudget.scalar_error_absorption`](https://solveathome.org/files/1895d0e7ea7cc573477a2ca95f98d5f7b9ecde7b6330b230f4cc9e4afaf7e5ea); [`PrimeReserveBudget.lean:150`, `PrimeReserveBudget.theta_dyadic_budget`](https://solveathome.org/files/1895d0e7ea7cc573477a2ca95f98d5f7b9ecde7b6330b230f4cc9e4afaf7e5ea); [`PrimeReserveBudget.lean:220`, `PrimeReserveBudget.actual_reserved_supply`](https://solveathome.org/files/1895d0e7ea7cc573477a2ca95f98d5f7b9ecde7b6330b230f4cc9e4afaf7e5ea) | Explicit sufficient prime-supply threshold and its coarse arithmetic. It is not a practical onset for Theorem 1. | +| Section 8 completion; total uncovered budget y/(3L) | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`SmoothBudget.lean:172`, `SmoothBudget.eventual_uncovered_budget`](https://solveathome.org/files/d69ec8f998d2c866e97eaeb92c7f7c3f237e642d919f52b99e6543dc47949bc2); [`ReserveBudget.lean:30`, `ReserveBudget.actual_reserved_completion`](https://solveathome.org/files/dfaf920d927f70fdea77cf67290461f1235e20fd0234c91f3a2d897351a888c0); [`PrimaryMain.lean:24`, `PrimaryMain.eventual_actual_completion`](https://solveathome.org/files/cff1bb8609e7ca834419684da3c81bb8630f85a7730ea5b0dd3018f24504ed68) | Finite cardinality comparison and reserved-prime injection; no specified location of the resulting gap. | +| Section 8 coefficient c=1/B, floor inequality and final quantifiers | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`PrimaryMain.lean:13`, `PrimaryMain.primaryCoefficient`](https://solveathome.org/files/cff1bb8609e7ca834419684da3c81bb8630f85a7730ea5b0dd3018f24504ed68); [`PrimaryMain.lean:19`, `PrimaryMain.main_mass_identity`](https://solveathome.org/files/cff1bb8609e7ca834419684da3c81bb8630f85a7730ea5b0dd3018f24504ed68); [`PrimaryMain.lean:38`, `PrimaryMain.manuscript_main_goal`](https://solveathome.org/files/cff1bb8609e7ca834419684da3c81bb8630f85a7730ea5b0dd3018f24504ed68); [`IntegerMainBinding.lean:36`, `IntegerMainBinding.manuscript_integer_main_goal`](https://solveathome.org/files/6a87d6209746e706bd2d44629f0333815b36a2f542d609ca8ff13f682d889e09) | Accepted mapped main claims only, at an existential eventual threshold. No optimized numerical c or onset is claimed. | +| Section 8 weaker y log y endpoint; original Eq. (27) | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`PrimaryMain.lean:79`, `PrimaryMain.eventual_y_log_gap`](https://solveathome.org/files/cff1bb8609e7ca834419684da3c81bb8630f85a7730ea5b0dd3018f24504ed68) | A proved consequence in the frozen source, explicitly outside the three-claim statement binding reviewed in #696; not a validation of O7's separate short construction. | +| O1; Input M; original Eq. (8) | [preserved map](https://solveathome.org/files/b6b75ca5c75fa20a4050dc73b12f4a375427a5686361e41f3033835bf485f2d5), `open_original_obligations`; original file SHA-256 `50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521`; `input-m8`, original lines 162–169; historical Mertens reference. | OPEN as a full printed asymptotic in this frozen package. Section 5 uses finite bounds instead; no new source theorem is proved here. | +| O2; Input H; original Eq. (9) | [preserved map](https://solveathome.org/files/b6b75ca5c75fa20a4050dc73b12f4a375427a5686361e41f3033835bf485f2d5), `open_original_obligations`; original file SHA-256 `50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521`; `input-h9`, lines 171–184; Hildebrand–Tenenbaum, Corollary 1.3, printed p. 417, with its range. | OPEN as the full two-variable uniform equality in this package. The stated printed-page custody is historical, not a new page reading or proof execution. | +| O3 parameter limits; original Eq. (23) | [preserved map](https://solveathome.org/files/b6b75ca5c75fa20a4050dc73b12f4a375427a5686361e41f3033835bf485f2d5), `open_original_obligations`; original file SHA-256 `50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521`; `general-a24`, lines 389–413; [`SmoothLogLimit.lean:136`, `SmoothLogLimit.eventual_u_log_u`](https://solveathome.org/files/0f2f603ee9dd4764942eaddca94f211015ff1fba8737abe7dfddaca8f025a976). | Quantified parameter limits are available for A>=4 and B=chooseB(A); the source does not establish the full smooth asymptotic in original Eq. (24). | +| O3 uniform smooth deduction; original Eq. (24) | [preserved map](https://solveathome.org/files/b6b75ca5c75fa20a4050dc73b12f4a375427a5686361e41f3033835bf485f2d5), `open_original_obligations`; original file SHA-256 `50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521`; `general-a24`, lines 389–413; [`SmoothLogLimit.lean:136`, `SmoothLogLimit.eventual_u_log_u`](https://solveathome.org/files/0f2f603ee9dd4764942eaddca94f211015ff1fba8737abe7dfddaca8f025a976). | OPEN full equality and little-o conclusion for every fixed A>4 in this package; the main proof uses a different finite estimate at A=12. | +| O4; Input P; original Eq. (10) | [preserved map](https://solveathome.org/files/b6b75ca5c75fa20a4050dc73b12f4a375427a5686361e41f3033835bf485f2d5), `open_original_obligations`; original file SHA-256 `50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521`; `input-p10`, lines 186–192; historical prime-number-theorem input. | OPEN as the coefficient-1/2 dyadic asymptotic in this package. Current Eq. (16) is a different sufficient bound. | +| O5 embedding; original Eq. (4) | [return #5265](https://solveathome.org/projects/twin-primes/return/5265), `LeanEq4` package, [`Eq4.lean.txt:46`, `eq4`; `Eq4.lean.txt:52`, `eq4_cover`](https://solveathome.org/files/71a16cc5db7f0a077aff5178b506399e9a90f5d34e8616b11633c719968f41c3) and [`Int.lean.txt:123`, `eq4_int`; `Int.lean.txt:130`, `eq4_manuscript`](https://solveathome.org/files/056719be6fe58977e540f9ea58f80e67161ad9af01beb914e32ebf75c60d8a44); trusted rerun review #1828. | Accepted proven for every modulus P>=1, with largest gaps over integer starts. Return #2472 supplies the earlier per-width form. This does not prove the external one-class asymptotic. | +| O5 external one-class comparison; original Eq. (5) | [preserved map](https://solveathome.org/files/b6b75ca5c75fa20a4050dc73b12f4a375427a5686361e41f3033835bf485f2d5), `open_original_obligations`; original file SHA-256 `50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521`; `context-and-sieve`, lines 116–131; Kalmynin–Konyagin, Theorem A/reference 1, pointing to Ford–Green–Konyagin–Maynard–Tao. | External mathematical input, not established by the frozen package or by this editorial task; no novelty claim. | +| O5 corrected Input S moments; original Eq. (6) | [return #4439](https://solveathome.org/projects/twin-primes/return/4439), review #1620 and finding #120070; original Input S locator in [preserved map](https://solveathome.org/files/b6b75ca5c75fa20a4050dc73b12f4a375427a5686361e41f3033835bf485f2d5), `open_original_obligations`; original file SHA-256 `50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521`; historical Halberstam–Richert Theorem 2.2 and Friedlander–Iwaniec Theorem 6.9/Corollary 6.10. | An assumption of the open general interface. The concrete incidence moment is established separately in current Eq. (8); no general upper-bound conclusion follows from this row alone. | +| O5 corrected general bound; original Eq. (7) | [return #4439](https://solveathome.org/projects/twin-primes/return/4439), review #1620 and finding #120070; original Input S locator in [preserved map](https://solveathome.org/files/b6b75ca5c75fa20a4050dc73b12f4a375427a5686361e41f3033835bf485f2d5), `open_original_obligations`; original file SHA-256 `50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521`; historical Halberstam–Richert Theorem 2.2 and Friedlander–Iwaniec Theorem 6.9/Corollary 6.10. | OPEN general interface. Uniform Omega1 margin, X>=2, fixed level and constant dependence on kappa,A,Clev are required. The earlier kappa-only form is not operative; the printed book page was not checked anew. | +| Lemma 2; conditional O5 bound, original Eq. (11) | [preserved map](https://solveathome.org/files/b6b75ca5c75fa20a4050dc73b12f4a375427a5686361e41f3033835bf485f2d5), `open_original_obligations`; original file SHA-256 `50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521`; `context-and-sieve`, lines 196–228; concrete moment provenance in [`DivisorMoments.lean:107`, `DivisorMoments.real_divisor_moment_remainder`](https://solveathome.org/files/9be86aa88442c3c7662442d662adfe6266529d413c0f47670fc99cdc2a65eaf3). | Conditional elementary reduction from the corrected Input S only. It is not an unconditional proof of that general sieve bound. | +| O5 incidence-label definition; original Eq. (12) | [preserved map](https://solveathome.org/files/b6b75ca5c75fa20a4050dc73b12f4a375427a5686361e41f3033835bf485f2d5), `open_original_obligations`; original file SHA-256 `50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521`; `context-and-sieve`, lines 196–228; concrete moment provenance in [`DivisorMoments.lean:107`, `DivisorMoments.real_divisor_moment_remainder`](https://solveathome.org/files/9be86aa88442c3c7662442d662adfe6266529d413c0f47670fc99cdc2a65eaf3). | Definition and elementary finite CRT reduction for the concrete weights. The resulting general sifted upper bound still depends on the corrected external Input S. | +| O5 local margin A=5; g(2)=1, g(3)=2, g(p)<=4 for p>=5 | [return #2597](https://solveathome.org/projects/twin-primes/return/2597); [`ManuscriptResidues.lean:112`, `ManuscriptResidues.omega_card`](https://solveathome.org/files/a2ca43af4c608c303a7a2b1e61ca6b04677e636017937c3161e5c6fe1c272515); [`ManuscriptResidues.lean:127`, `ManuscriptResidues.omega_bounds`](https://solveathome.org/files/a2ca43af4c608c303a7a2b1e61ca6b04677e636017937c3161e5c6fe1c272515); accepted return #2597/review #696 records nu(p)<=4/5 for the actual data. | The explicit margin is available for the concrete prime-factor data. It does not prove the general Input S or a constant uniform in A. | +| O6 harmonic-density expansion; original Eq. (20) | [preserved map](https://solveathome.org/files/b6b75ca5c75fa20a4050dc73b12f4a375427a5686361e41f3033835bf485f2d5), `open_original_obligations`; original file SHA-256 `50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521`; `density20-21`, original lines 355–387; finite replacements in [`MertensBand.lean:408`, `MertensBand.actual_auxiliary_product_le`](https://solveathome.org/files/6ee922c80814b35e0d47011a2bcb164e99467c85d190f92eb098ab8ba9be17d9) and [`RealBand.lean:127`, `RealBand.actual_product_real_le`](https://solveathome.org/files/879496b2388f74b475fa7ac85918f76d58b3a9a671c64fbd9128b11cbebeac36). | OPEN full printed harmonic expansion/two-sided comparisons. The stated finite one-sided replacement neither gives a unit leading constant nor a priced general sieve constant. | +| O6 two-sided product comparison; original Eq. (21) | [preserved map](https://solveathome.org/files/b6b75ca5c75fa20a4050dc73b12f4a375427a5686361e41f3033835bf485f2d5), `open_original_obligations`; original file SHA-256 `50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521`; `density20-21`, original lines 355–387; finite replacements in [`MertensBand.lean:408`, `MertensBand.actual_auxiliary_product_le`](https://solveathome.org/files/6ee922c80814b35e0d47011a2bcb164e99467c85d190f92eb098ab8ba9be17d9) and [`RealBand.lean:127`, `RealBand.actual_product_real_le`](https://solveathome.org/files/879496b2388f74b475fa7ac85918f76d58b3a9a671c64fbd9128b11cbebeac36). | OPEN full printed harmonic expansion/two-sided comparisons. The stated finite one-sided replacement neither gives a unit leading constant nor a priced general sieve constant. | +| O6 derived coarse survivor estimate; original Eq. (22) | [preserved map](https://solveathome.org/files/b6b75ca5c75fa20a4050dc73b12f4a375427a5686361e41f3033835bf485f2d5), `open_original_obligations`; original file SHA-256 `50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521`; `density20-21`, original lines 355–387; finite replacements in [`MertensBand.lean:408`, `MertensBand.actual_auxiliary_product_le`](https://solveathome.org/files/6ee922c80814b35e0d47011a2bcb164e99467c85d190f92eb098ab8ba9be17d9) and [`RealBand.lean:127`, `RealBand.actual_product_real_le`](https://solveathome.org/files/879496b2388f74b475fa7ac85918f76d58b3a9a671c64fbd9128b11cbebeac36). | OPEN full printed harmonic expansion/two-sided comparisons. The stated finite one-sided replacement neither gives a unit leading constant nor a priced general sieve constant. | +| O7; separate short construction; original Eq. (28) | [preserved map](https://solveathome.org/files/b6b75ca5c75fa20a4050dc73b12f4a375427a5686361e41f3033835bf485f2d5), `open_original_obligations`; original file SHA-256 `50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521`; `short-derivation28`, original lines 455–484; historical Input S/Mertens argument. | OPEN original derivation and coefficient. Its archival use of Input S must carry the corrected margin, level and constant dependencies; no new validation here. | +| 0.41621; 805.5; delta=0.05; K=3; 3.73×10^-4; 3.7×10^-4 | [preserved map](https://solveathome.org/files/b6b75ca5c75fa20a4050dc73b12f4a375427a5686361e41f3033835bf485f2d5), `open_original_obligations`; original file SHA-256 `50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521`; O7 quotation, original lines 455–484; [return #158](https://solveathome.org/projects/twin-primes/return/158), historical Friedlander–Iwaniec Theorem 6.9/Corollary 6.10 custody. | Historical conditional pricing only, not a certified threshold or independently checked numerical result of this revision. Its general sieve premise remains qualified and OPEN. | +| 7.5×10^-4 | [preserved map](https://solveathome.org/files/b6b75ca5c75fa20a4050dc73b12f4a375427a5686361e41f3033835bf485f2d5), `open_original_obligations`; original file SHA-256 `50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521`; O7 quotation and return #158, with its recorded missing prime-2 local factor. | Explicitly withdrawn value, not reused as a bound or threshold. |