{"id":"75667510-61c5-40ae-890a-490992bde092","arxiv_id":"1908.07095","paper_version":1,"verdict":"REJECT","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"high","formal_verification":"none","parameter_count":2,"one_line_summary":"Under an unproved analog of a known average-order estimate, the paper bounds the n=3,4,5 contributions to the conjectured distribution of consecutive prime residues modulo prime q, and reports fitted lower-order terms from data to 10^18.","lead":"This paper derives conditional bounds on the correction terms in the conjectured distribution of consecutive prime residues modulo prime q. It also extends numerical data to 10^18 and identifies a plausible fitted lower-order term, but the main theorem depends on unproved assumptions.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 3.1 rests on an unproved analogue of (3.5) for S_{q,0} and on Lemma 4.3, whose proof is explicitly only a sketch and not fully rigorous; without these, the advertised rigorous connection from Hardy-Littlewood to Conjecture 2.2 is not established.","rationale":"The paper's stated contribution is to 'begin to rigorously connect' the Hardy-Littlewood conjecture to the Lemke Oliver-Soundararajan conjecture. For that claim to hold, Theorem 3.1 would need to be a theorem whose hypotheses are either proved or are the Hardy-Littlewood conjecture itself. Instead, the proof explicitly assumes that (3.5) holds 'in a similar form' for S_{q,0}, with no derivation supplied. The proof also depends on Lemma 4.3, which the author labels as not fully rigorous and only sketches. Both assumptions are load-bearing: the h-sum truncation and the substitution of the average order into A_{h,ℓ} are essential for the bounds on S_∅, S_{0}, S_{h}, and S_{0,h}, and hence for controlling D_n and D_{\\ge n} in Conjecture 2.2. The numerical lower-order term in Appendix A is fitted to data and cannot serve as independent evidence for these analytic inputs. Therefore the reader's REJECT verdict is appropriate, and no adjustment is needed.","tokens_in":12610,"tokens_out":15826,"duration_ms":155701,"concrete_test":"Derive the S_{q,0} analogue of (3.5) for the restricted sums A_{h,ℓ} = ∑_{T⊂[1,h-1], |T|=ℓ, (t+a,q)=1} S_{q,0}(T), either unconditionally or assuming the Hardy-Littlewood conjecture, by tracking the omitted Euler factors for primes dividing q and the gcd condition. If the leading term is μ_ℓ/ℓ!(-h log h + Ah)^{ℓ/2} with error O(h^{ℓ/2-1/7ℓ+ε}), Theorem 3.1 is at least conditionally sound; if the leading term or error differs, or if a further unproved conjecture is needed, the advertised rigorous connection to Hardy-Littlewood fails.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central theorem is conditional rather than a rigorous connection. After defining M = c log_2 y, the proof discards h > M log y via Lemma 4.3, but Lemma 4.3 is stated with the caveat 'We sketch the details of the proof here. Although not fully rigorous, we expect the key ingredients of the proof to be present.' The bound is taken from Gallagher [10] without stating whether that result is unconditional or conditional on the Hardy-Littlewood conjecture, nor whether e^{-λ} remains valid for λ = c log_2 p_N uniformly in n. In addition, the proof of S_∅ replaces A_{h,ℓ} by the leading term of (3.5), 'appealing to our conjectured form for ∑ S_{q,0} according to (3.5)'. But (3.5) is a theorem for S_0 over all subsets of [1,h], not for the modified, inclusion-exclusion singular series S_{q,0} with the gcd restriction (t+a,q)=1. No derivation of the analogue is given; the omitted factors for primes dividing q and the admissibility condition could change the leading constant or the error term. Since S_{0}, S_{h}, and S_{0,h} are bounded by formally differentiating A_{h,ℓ}, any failure of the assumed analogue propagates to all four bounds and hence to D_n and D_{\\ge n}. The numerical curve fit in Appendix A cannot fill this gap.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the distribution of consecutive prime sequences modulo a prime q, in the direction of the Lemke Oliver-Soundararajan conjectures. After setting up a modified singular series S_{q,0} and rewriting the heuristic asymptotic for D(a,b;y), the paper states Theorem 3.1, which asserts that the quantities S_∅, S_{0}, S_{h}, and S_{0,h}, and hence D_n and D_{≥n}, decay as O_n((log_2 y)^n/(log y)^{n/2-1}) under an assumed analogue of the Montgomery-Soundararajan estimate (3.5) for S_{q,0}. The proof uses a prime-gap lemma (Lemma 4.3) to discard large h, and the paper also fits lower-order terms numerically using data up to 10^18. The abstract claims that this begins a rigorous connection between the Hardy-Littlewood prime k-tuple conjecture and the conjectured prime-pattern asymptotic.","tokens_in":13003,"tokens_out":6674,"duration_ms":64086,"significance":"If Theorem 3.1 were proven under the stated hypothesis, it would provide a useful framework for controlling truncation errors in Conjecture 2.2 and would clarify which terms in the Lemke Oliver-Soundararajan heuristic are negligible. The decomposition into S_∅, S_{0}, S_{h}, S_{0,h}, the use of Lemma 4.4 to relate the relevant finite differences, and the extension of numerical data to x=10^18 are useful contributions. However, the paper does not prove the analogue of (3.5) that its central theorem requires; it relies on a lemma whose proof is explicitly labeled 'not fully rigorous'; and the claimed lower-order correction is obtained by curve-fitting rather than by derivation. The advertised rigorous connection is therefore not established, and the paper's main value is as a heuristic and computational exploration rather than as a proof.","major_comments":[{"comment":"Theorem 3.1 is explicitly conditional on the assumption that (3.5) 'holds in a similar form' for S_{q,0}, but the paper never states the precise form of this analogue, nor does it offer a proof. The definitions of S_{q,0} and S_0 differ by the restriction (t+a,q)=1 and by the omission of primes dividing q, so the Euler factors are genuinely different; the mean value, the implied constants, and the error term in (3.5) need not transfer. In the proof of S_∅, the sum A_{h,ℓ} is simply replaced by the leading term of (3.5) 'appealing to our conjectured form'. Since all four bounds in Theorem 3.1 depend on this substitution, the central claim is not derived from the Hardy-Littlewood conjecture or from the known Montgomery-Soundararajan result alone.","section":"Section 3, Theorem 3.1"},{"comment":"Lemma 4.3 is the only mechanism used to discard the contribution of h > M log y in Section 3, but its proof is prefaced with 'We sketch the details of the proof here. Although not fully rigorous, we expect the key ingredients of the proof to be present.' The proof cites Gallagher's bound P[g_n > λ log p_n] < e^{-λ} without stating whether that bound is unconditional or conditional on the Hardy-Littlewood conjecture, and without justifying that it may be applied uniformly with λ = c log_2 p_N for all n ≤ N. Because this lemma controls the truncation error in Theorem 3.1, the claimed O_n((log_2 y)^n/(log y)^{n/2-1}) bound is not rigorously established.","section":"Section 4, Lemma 4.3"},{"comment":"The bounds for S_{0}, S_{h}, and S_{0,h} are not actually proved. After the detailed treatment of S_∅, the paper states 'We proceed to evaluate S_{0}, S_{h}, and S_{0,h} in an analogous manner' and then asserts, 'In loose terms, taking k derivatives of A_{h,ℓ} corresponds to adding a factor of (log y)^k to the denominator.' No rigorous derivation or explicit final bound is supplied for these three terms. Since D_{≥n}(a,b;y) is the sum S_∅ + S_{0} + S_{h} + S_{0,h}, the claimed bound for D_{≥n} is incomplete.","section":"Section 3, proof of Theorem 3.1"},{"comment":"The treatment of odd ℓ in the proof of S_∅ appears to bound the wrong sign. In (3.18), the summand contains (-z)^ℓ, which is negative for odd ℓ, and the displayed expression is '-C_max' times a positive geometric series, so this is a lower bound, not an upper bound, for the absolute value of the contribution. To deduce S_∅ = O_n((log_2 y)^n/(log y)^{n/2-1}) one needs an estimate for |S_∅|; a negative lower bound does not control the size. The argument would need to take absolute values of the error terms in (3.5) throughout, which is not what is written.","section":"Section 3, proof of S_∅, Case 2"},{"comment":"The claimed lower-order term of size O((log_2 x)^2/(log x)^2) is obtained by fitting residuals with SageMath's find_fit function, and no predicted constant or residual diagnostic is reported. This makes the term a fitted quantity, not a prediction of the conjectural asymptotic. The introduction and Section 3 present the lower-order analysis as tightening the heuristic in [4], but the numerical fitting in Appendix A cannot substitute for a derivation from the singular-series expressions. The sampling justification based on Theorem 3.1, which itself depends on the unproved (3.5) analogue and Lemma 4.3, is also circular for the purpose of validating the conjecture.","section":"Appendix A"},{"comment":"The truncation of D(a,b;y) to h ≤ M log y and to |T| ≥ n is justified using the average-order estimate (3.5) for the sums defining A_{h,ℓ}, B_{h,ℓ}, C_{h,ℓ}, and D_{h,ℓ}. But these are exactly the sums of S_{q,0}(A∪T) that define the object D being truncated. No independent estimate for S_{q,0} on individual sets is given, so the argument assumes the same type of cancellation it is trying to establish. This circularity is load-bearing: if the assumed analogue of (3.5) fails, the entire truncation and the resulting theorem collapse.","section":"Section 3, truncation argument"}],"minor_comments":[{"comment":"There is a typo in the sentence 'Note that (A.2) approximates the the ratio π(...)': 'the the' should be 'the'.","section":"Appendix A"},{"comment":"The text refers to 'Lemma 4.2, whose statement and proof can be found in Appendix 4', but Lemma 4.2 is stated and proved in Section 4, not in an appendix.","section":"Section 3, proof of Theorem 3.1"},{"comment":"Figures 1-5 are referenced and described but not displayed in the manuscript text, making it impossible to assess the claimed agreement between the data, the main term (A.1), and the fitted lower-order term.","section":"Appendix B"},{"comment":"The notation 'O_n' is defined in the introduction, but the subscripts are sometimes omitted or ambiguous (for example in the statement of Lemma 4.3). The paper would benefit from a consistent notation for the dependence of implied constants on q as well as on n.","section":"Throughout"}],"recommendation":"reject","confidential_remarks":"The paper has the structure of an exploratory project: a conditional theorem whose hypothesis is an unproved analogue of a nontrivial result, a key lemma whose proof is only a sketch, and a numerical fit that supplies the advertised lower-order correction. These are not local presentation issues; they are load-bearing gaps that cannot be closed within a routine revision. The abstract and introduction substantially overstate what is established. I would recommend rejection, though the author's strategy of decomposing the sum via finite differences of A_{h,ℓ} is worth acknowledging as a potentially useful heuristic framework."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: the paper has a genuinely new component—the n≥3 truncation in Theorem 3.1, the data extension to 10^18, and the explicit fitted lower-order term—but the central advertised result is not a proof. Theorem 3.1 is conditional on an unproved analogue of (3.5), and the proof leans on Lemma 4.3, which the author himself says is only sketched and “not fully rigorous.” So the abstract’s phrase “begin to rigorously connect” overstates what is established.\n\nWhat is genuinely good: the decomposition of D into S_∅, S_{0}, S_{h}, and S_{0,h} is a sensible way to organize the heuristic, and Lemma 4.4 is a clean combinatorial identity with an exact proof. The numerical extension to 10^18 is useful, and the author is honest that the lower-order term was found by fitting residuals rather than derived. The paper also states the conditional nature of Theorem 3.1 directly, which is more than many heuristic papers do.\n\nThe soft spots are load-bearing, not cosmetic. The theorem assumes that the Montgomery–Soundararajan average-order estimate (3.5) holds “in a similar form” for the modified singular series S_{q,0}, with no derivation and no precise statement of what changes when primes dividing q are excluded. Replacing A_{h,ℓ} by the leading term of (3.5) is exactly the step that could introduce q-dependent constants or error terms, and the proof does not address those. The error term in (3.5) also has exponent ℓ/2 − 1/7ℓ + ϵ, and the proof appears to discard it without checking uniformity over the ranges in question.\n\nLemma 4.3 is a second major gap. Gallagher’s result is quoted without saying whether it is unconditional or conditional on the Hardy-Littlewood conjecture, and the use of e^{−λ} with λ = c log₂ p_N pushes the bound far outside the range in which that exponential tail is known. Uniformity in n is not established. Since Lemma 4.3 is what lets the paper discard all h > M log y, a failure there would invalidate the truncation argument.\n\nMinor point: the numerical lower-order term is a fitted value, not a prediction. The author says this clearly, so it is not a hidden flaw, but it means the data cannot serve as independent confirmation of the conjectured shape.\n\nWho this is for: readers interested in the heuristic shape of the Lemke Oliver–Soundararajan conjecture, especially the lower-order terms, will find the data and the organizing framework useful. As a rigorous proof, it is not there. I would want either a proof of the analogue of (3.5) for S_{q,0}, or a precise conjecture stated separately, and a complete proof or clear citation of Lemma 4.3 with uniform constants. Failing that, the paper should be reframed as a heuristic with numerical evidence. I would not currently cite it as evidence for the truncation bound, though I might cite the 10^18 data with attribution to the author.\n\nFor peer review: I would not desk-reject it, because the idea and data are worth a referee’s time, but acceptance would require either the missing proof or an honest reframing as a heuristic contribution. Send it to a specialist, not to a broad journal.","headline":"The n≥3 truncation and the data to 10^18 are real, but the advertised rigorous bridge from Hardy-Littlewood to Lemke Oliver–Soundararajan is not delivered: the key estimate is an unproved analogue of (3.5) and the large-gap lemma is only sketched.","tokens_in":13481,"tokens_out":3322,"would_cite":false,"duration_ms":38624,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["11N05","11N13"],"pacs":[],"model":"deepseek-v4-flash","headline":"Under one plausible average-order assumption, this paper proves that the high-order error terms in the conjectured formula for consecutive-prime residue patterns decay like $(\\log_2 y)^n/(\\log y)^{n/2-1}$, making the formula truncatable…","keywords":["prime k-tuples","Hardy-Littlewood conjecture","consecutive primes","residue classes","prime patterns","singular series","large prime gaps","analytic number theory"],"falsifier":"Compute the sums $\\sum_{T\\subset[1,h], |T|=\\ell} S_{q,0}(T)$ for a fixed odd prime modulus such as $q=3$ over a range of $h$ and $\\ell$, and compare them with the predicted main term $\\frac{\\mu_\\ell}{\\ell!}(-h\\log h+Ah)^{\\ell/2}$. If the discrepancy exceeds the allowed $O(h^{\\ell/2-1/7\\ell+\\epsilon})$ for any $q$, the main estimate in Theorem 3.1 fails. Alternatively, check the large-gap lemma directly by testing whether the frequency of prime gaps above $c\\log_2 p_N\\log p_n$ is bounded by $(\\log N)^{-c}$ for fixed $c$.","tokens_in":12407,"feed_emoji":"🔢","tokens_out":11290,"duration_ms":98050,"temperature":0.7,"pith_summary":"Prime numbers modulo a fixed modulus are not uniformly spread among consecutive patterns: some residue pairs appear far more often than others. This paper takes a conjectured asymptotic formula for the frequency of such patterns and analyzes its central sum $D(a,b;y)$, separating it into terms by how many auxiliary forbidden positions are included. Under one plausible assumption about the average size of the modified singular series, it proves that the high-order terms decay like $O_n\\big((\\log_2 y)^n/(\\log y)^{n/2-1}\\big)$, so the formula can be truncated with a controlled error. The result is a first rigorous connection from the prime k-tuple conjecture to the observed pattern biases, and the paper extends numerical data to $x=10^{18}$ to support the refined formula.","feed_headline":"Consecutive-prime bias gets a conditional error bound","feed_subtitle":"Under one average-order assumption, high-order pattern-count error terms decay fast enough to be discarded.","key_machinery":"The load-bearing objects are the singular series $S_q(H)$, modified to omit primes dividing the modulus $q$, and its inclusion-exclusion variant $S_{q,0}(H)$. Equation (3.5), a known estimate for the average order of sums of $S_0(T)$ over $\\ell$-subsets of $[1,h]$, is assumed to persist for $S_{q,0}$; that estimate supplies the main size of the alternating sums $A_{h,\\ell}$, $B_{h,\\ell}$, $C_{h,\\ell}$, and $D_{h,\\ell}$. The proof splits the outer sum over gaps $h$ at $h=M\\log y$, using a large-gap probability bound to discard longer gaps, then evaluates the remaining sums with convexity bounds, truncated Taylor series, and finite-difference identities that telescope the four subset sums into differences of $A_{h,\\ell}$. These identities translate extra factors of $\\log y$ into extra decay, giving the theorem.","core_discovery":"The paper's central result, Theorem 3.1, is a conditional decay bound. Assuming the known average-order estimate (3.5) for sums of singular series remains valid in similar form for the modified series $S_{q,0}$, the four pieces $S_\\emptyset$, $S_{\\{0\\}}\\log y$, $S_{\\{h\\}}\\log y$, and $S_{\\{0,h\\}}(\\log y)^2$ are all $O_n\\big((\\log_2 y)^n/(\\log y)^{n/2-1}\\big)$, where $\\log_2 y$ is the second iterated logarithm. Consequently the terms $D_n(a,b;y)$ and their tail $D_{\\ge n}(a,b;y)$, which make up the sum $D(a,b;y)$ in the conjectured asymptotic for $\\pi(x;q,(a,b))$, satisfy the same bound. This means the infinite sum over auxiliary prime positions can be cut off at a finite $n$ while keeping the error under control, turning the heuristic restriction to small sets into a provable approximation.","pith_inferences":["The paper leaves implicit that if the assumed average-order estimate for $S_{q,0}$ were proved unconditionally, the entire conjectured asymptotic for $\\pi(x;q,(a,b))$ would follow from the prime k-tuple conjecture, making the known biases in consecutive-prime residues a theorem rather than a heuristic.","The same truncation logic suggests the biases are a local phenomenon, controlled only by gaps up to $c\\log_2 y\\log y$; a numerical test would be to recompute pattern frequencies with the tail removed and check that the remaining signal matches the conjectured formula.","The method is stated for odd prime $q$, but the author says it readily generalizes to composite moduli; testing composite $q$ numerically would indicate whether the same decay rate holds there.","The curve-fitting evidence for a $O((\\log_2 x)^2/(\\log x)^2)$ lower-order term is plausible as the next correction in the expansion; a sharper test would compare the full truncated model at $x=10^{18}$ against data at several larger $x$."],"forward_implications":["The infinite sum $D(a,b;y)$ can be truncated at any fixed $n$: the tail $D_{\\ge n}(a,b;y)$ has size $O_n((\\log_2 y)^n/(\\log y)^{n/2-1})$, so the conjectured integral for $\\pi(x;q,(a,b))$ has a controlled error once the assumption is accepted.","Because the $|T|\\ge 6$ pieces are negligible, the model only needs singular-series values for sets of size at most five; the paper prepares these up to $\\max H\\le 150$ for numerical integration.","Large gaps $h>c\\log_2 y\\log y$ contribute at most $(\\log y)^{-c}$, so the long-range part of the pattern count cannot be the source of the observed bias.","Theorem 3.1 converts the heuristic statement that only zero- and two-element sets matter into a conditional theorem, the first rigorous bridge from the prime k-tuple conjecture to the pattern-frequency asymptotic."],"supporting_citations":[{"why":"Supplies the conjectured asymptotic for pi(x;q,(a,b)) and the heuristic truncation of D(a,b;y) that Theorem 3.1 refines into a provable bound.","marker":"[4]"},{"why":"Supplies the average-order estimate (3.5) for alternating sums of the singular series, which the theorem assumes extends to the modified series S_{q,0}.","marker":"[9]"},{"why":"Supplies the exponential large-prime-gap probability bound used in Lemma 4.3 to discard gaps larger than c log_2 y log y.","marker":"[10]"}],"fun_headline_variants":["Conditional bound tames prime pattern error terms","Prime pattern errors decay under average-order assumption","Conditional error decay for high-order prime pattern sums","Under one assumption prime pattern error terms shrink","Bias in prime residues gets conditional error bound"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof assumes that a known average-order estimate for alternating sums of the singular series, equation (3.5), continues to hold with minor corrections when the singular series is replaced by the modified series $S_{q,0}$ that excludes primes dividing the modulus $q$; this analog is not proved in the paper, and the large-gap lemma used to discard long tails is only sketched.","fun_headline_variants_meta":{"raw":{"variants":["Conditional bound tames prime pattern error terms","Prime pattern errors decay under average-order assumption","Conditional error decay for high-order prime pattern sums","Under one assumption prime pattern error terms shrink","Bias in prime residues gets conditional error bound"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001816,"raw_usage":{"total_tokens":7127,"prompt_tokens":903,"completion_tokens":6224,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":519,"completion_tokens_details":{"reasoning_tokens":6154}},"tokens_in":519,"tokens_out":6224,"duration_ms":41975,"temperature":1.0,"reasoning_tokens":6154,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T12:26:28.470024+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the sums $\\sum_{T\\subset[1,h], |T|=\\ell} S_{q,0}(T)$ for a fixed odd prime modulus such as $q=3$ over a range of $h$ and $\\ell$, and compare them with the predicted main term $\\frac{\\mu_\\ell}{\\ell!}(-h\\log h+Ah)^{\\ell/2}$. If the discrepancy exceeds the allowed $O(h^{\\ell/2-1/7\\ell+\\epsilon})$ for any $q$, the main estimate in Theorem 3.1 fails. Alternatively, check the large-gap lemma directly by testing whether the frequency of prime gaps above $c\\log_2 p_N\\log p_n$ is bounded by $(\\log N)^{-c}$ for fixed $c$.","supporting_citations":[{"cited_title":"Unexpected biases in the distribution of con- secutive primes,","cited_arxiv_id":null,"evidence_quote":"Supplies the conjectured asymptotic for pi(x;q,(a,b)) and the heuristic truncation of D(a,b;y) that Theorem 3.1 refines into a provable bound."},{"cited_title":"Primes in short intervals,","cited_arxiv_id":null,"evidence_quote":"Supplies the average-order estimate (3.5) for alternating sums of the singular series, which the theorem assumes extends to the modified series S_{q,0}."},{"cited_title":"On the distribution of primes in short intervals,","cited_arxiv_id":null,"evidence_quote":"Supplies the exponential large-prime-gap probability bound used in Lemma 4.3 to discard gaps larger than c log_2 y log y."}],"review_version":1}