Pith. sign in

REVIEW 2 major objections 8 minor 1 cited by

Gilbreath's conjecture: a Cram\'er random model and a deterministic analysis

T0 review · 2 major / 8 minor · reviewed 2026-07-10 · glm-5.2

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Gilbreath's conjecture holds for Cramér random primes

desk verdict Solid paper. The Cramér-model Gilbreath result is genuinely new and correctly proved; the deterministic inverse theorem is conditional but conceptually valuable. read the letter →

arxiv 2607.08712 v1 pith:FIE4VJIL submitted 2026-07-09 math.CO

Zachary Chase , Zach Hunter , Terence Tao This is my paper · ORCID
classification math.CO MSC 11A4111K99
keywords GilbreathconjectureCramérrandommodelprimegapsabsolutedifferencesinversetheorem2-separatedsetsBorel-Cantellilemmageometricdistribution
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Gilbreath's conjecture says that if you write the primes in a row, then repeatedly take absolute differences of adjacent entries to build a triangle, the left edge of that triangle is all ones after the first row. This paper proves the conjecture is true in the Cramér random model — the standard probabilistic model for primes where each gap is an independent geometric random variable of logarithmic size. The authors establish a more general result: any sequence of independent non-negative integer random variables that grow at most linearly and do not concentrate in any 2-separated set (a set with no two consecutive integers, like the even numbers) will almost surely produce a Gilbreath array whose left edge eventually takes only the values 0 or 1. The proof works by showing that if the left edge fails to reach {0,1}, this forces a tower of nested triangular regions whose values are trapped in 2-separated sets like {0,d}, and the probability of so many values being so constrained is exponentially small. The paper also gives a deterministic inverse theorem: assuming only a Cramér-type bound on prime gaps, the only things that could possibly prevent Gilbreath's conjecture from holding are long runs of zeroes or very long shallow blocks taking just two values {0,d} with d at least 2.

What carries the argument

The argument combines three ingredients: (1) a tower construction that decomposes any failure of the Gilbreath property into nested {0,d}-valued triangular regions, (2) a separation lemma showing that the set of top-row values forcing a given location to be {0,d}-valued is always 2-separated, and (3) a counting bound on the number of possible towers, which grows like n^{O(D)} where D is the maximum entry size. When D is at most δn for small δ, the exponential decay from the separation constraints dominates the polynomial growth of tower count, and Borel-Cantelli gives almost sure convergence to {0,1}.

What would settle it

If normalized prime gaps were shown to concentrate in some 2-separated set (violating axiom (ii) of Theorem 1.3), or if long blocks of zeroes or long shallow {0,d}-valued blocks were shown to occur in the prime gap Gilbreath array, the path to proving the original conjecture via this paper's framework would be blocked.

Watch

Extended reading notes

Core claim

The central mechanism is a tower argument. When the bottom entry of a Gilbreath triangle exceeds 1, one can trace backward through the array and find a nested sequence of triangular regions, each constrained to take only two values 0 and d for some d. Each triangle in this tower casts a shadow onto the top row of the array, and the separation lemma shows that the values in the top row needed to make each triangle {0,d}-valued form a 2-separated set. Since the random variables are assumed not to concentrate in any 2-separated set, the probability of satisfying all these constraints simultaneously is a product of factors each bounded below 1, yielding an exponentially small failure probability

Load-bearing premise

The deterministic inverse theorem assumes a Cramér-type upper bound on prime gaps (itself unproved) and additionally requires ruling out long zero-blocks and long shallow two-valued blocks in the array — conditions the authors note look difficult to establish even assuming the Hardy-Littlewood prime tuples conjecture.

Editorial extensions

If this is right

  • The general Theorem 1.3 applies to any random model satisfying two simple axioms — sublinear growth and non-concentration in 2-separated sets — so any future prime gap model meeting these criteria automatically satisfies the Gilbreath property.
  • The deterministic inverse theorem (Theorem 1.6) reduces the original Gilbreath conjecture to ruling out two specific combinatorial configurations in the prime gap array, giving concrete targets for future work on the actual primes.
  • The continuous model analysis reveals that the expected row values c_i satisfy a lower bound summing to log n, meaning the decay is at best 1/i — this constrains how fast Gilbreath arrays can contract and suggests the linear growth threshold in Theorem 1.3 may be near-optimal.
  • The gap between the proven lower bound δn and the counterexample at 2^n for the growth threshold in Theorem 1.3 highlights the mysterious behavior of the constants c_i as a key open problem.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The non-concentration axiom (ii) in Theorem 1.3 is verified for the Cramér model but not for actual primes; if one could show that normalized prime gaps do not concentrate in any 2-separated set, the probabilistic part of the argument would transfer to the deterministic setting.
  • The lower bound on c_i summing to log n suggests that even in the continuous (exponential) model, the expected contraction of Gilbreath arrays is only logarithmic over n rows — meaning the array needs roughly n rows to shrink by a factor of n, which is consistent with but does not by itself prove the conjecture.
  • The irregular non-monotone behavior of the constants c_i (which first decrease then increase) may reflect discrete arithmetic structure analogous to the binary-digit-dependent behavior of Pascal's triangle modulo 2, suggesting deeper number-theoretic structure in the difference operator.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 8 minor

Summary. This paper studies Gilbreath's conjecture through three lenses: (1) a Cramér random model (Theorem 1.2), in which normalized prime gaps are replaced by independent geometric random variables of logarithmic size, and the left diagonal of the resulting Gilbreath array is shown to be {0,1}-valued almost surely after finitely many rows; (2) a general random-model theorem (Theorem 1.3) subsuming Theorem 1.2 and a prior result of the first author, requiring only that the random variables grow at most linearly and do not concentrate in 2-separated sets; (3) a continuous exponential model (Section 2, Theorem 1.4) for which a lower bound on the expected row-values c_i is proved via Jensen's inequality; and (4) a deterministic inverse theorem (Theorem 1.6) showing that, assuming a Cramér-type bound on initial values, the only obstructions to Gilbreath's conjecture are long zero-blocks or long shallow {0,d}-valued blocks. The probabilistic proofs proceed via a tower construction (Definition 3.12), a separation lemma (Lemma 3.11), a large-shadow lemma (Lemma 3.14), and a union bound with Borel–Cantelli. The deterministic argument uses coarse monotonicity (Lemma 5.2), good blocks (Definition 5.4), and a pigeonhole-based dichotomy (Lemma 5.8).

Significance. Theorem 1.2 provides the first rigorous verification of Gilbreath's conjecture for a random model with the correct logarithmic scale for prime gaps, improving on the first author's prior work [1] where the random variables grew too slowly. The general Theorem 1.3 is a clean, self-contained result with a well-motivated axiom (non-concentration in 2-separated sets) that precisely identifies the key obstruction. The deterministic inverse theorem (Theorem 1.6), while conditional on unproved hypotheses, makes the heuristic obstructions rigorous and could guide future work on the actual conjecture. The continuous model analysis and the lower bound of Theorem 1.4 (showing c_i cannot decay faster than 1/i) is a modest but interesting contribution that connects to the optimality of the linear growth threshold in Theorem 1.3. The paper is largely self-contained, with the probabilistic core verifiable from first principles.

major comments (2)
  1. In the proof of Proposition 4.1 (specifically the derivation following Lemma 4.4), the bound on the sum over k uses the inequality (n-1 choose k-1)(n+k-1 choose k-1) <= (n+D choose D)^2, and then the binomial theorem gives a factor of 2^D. However, the final stated bound in Proposition 4.1 is 2^D * (en/D + e)^{2D} * (prod rho_i)^{1/2}. The intermediate bound gives 2^D * (n+D choose D)^2, and using (n+D choose D) <= (e(n+D)/D)^D would yield 2^D * (e(n+D)/D)^{2D}. The appearance of the '+e' term inside the parentheses (i.e., (en/D + e)^{2D} rather than (e(n+D)/D)^{2D}) should be clarified — it may arise from a slightly different estimate, but as written the reader cannot easily trace the exact algebraic step. This is a presentation issue in a load-bearing estimate, not an error, but it should be made explicit.
  2. Theorem 1.6, axiom (iii): the condition requires 2^{M-m} < d <= 2^{M-m+1}, but the proof in Section 5 produces d* in {2^{M-m}+1, ..., 2^{M-m+1}} (Proposition 5.3) and good blocks with non-zero value d in {d*, ..., 2^{M-m+1}} (Definition 5.4). The final conclusion (¬iii) states 2^{M-m} < d <= 2^{M-m+1}, which is consistent, but the relationship between the d in the conclusion and the d* from Proposition 5.3 should be stated more explicitly in the proof of the final step (Section 5.4), since the good block's non-zero value d' satisfies d' >= d >= d* > 2^{M-m}, and this chain is what yields the strict inequality in (¬iii).
minor comments (8)
  1. Section 1.3: the values c_0=1, c_1=1, c_2=7/9, c_3=227/288 are given. The Monte Carlo simulation in Figure 1 is mentioned but the figure caption could note the error bars or sample variance, since c_3 is very close to c_2 and the non-monotonicity claim relies on precise values.
  2. Lemma 3.8 is referred to as 'Theorem 3.8' in its proof (e.g., 'From Theorem 3.7(i)') and similarly Lemma 3.7 is called 'Theorem 3.7' in several places (e.g., proof of Lemma 3.8, proof of Lemma 5.5). These should be 'Lemma' throughout.
  3. Section 1.2, footnote 2: the sentence beginning 'The refined Cramér–Granville random model...' is slightly awkward; consider rephrasing for clarity.
  4. Definition 3.12, axiom (ii): 'the bottom vertex I_{j,+inf} of nabla_{I_j} lies in the parent I_{j-1}^- of I_{j-1}' — the notation I_{j-1}^- was defined as the parent of I_{j-1}, but it would help to remind the reader that this means I_j is a subblock of I_{j-1}^-.
  5. Remark 4.5: 'at least than 2^{n+1}' should be 'at least 2^{n+1}'.
  6. The paper uses 'Theorem X.Y' and 'Lemma X.Y' interchangeably in cross-references within proofs (e.g., 'Theorem 5.2' for Lemma 5.2, 'Theorem 5.5' for Lemma 5.5, 'Theorem 5.7' for Lemma 5.7, 'Theorem 5.8' for Lemma 5.8). This is systematic and should be corrected throughout Section 5.
  7. Section 5.1, Lemma 5.1: the inductive claim involves a parameter d that ranges over {1, ..., 2^M}, but the inductive step on d' > d uses the fact that d' <= 2^M (from axiom (i)). This is correct but the bound on d' should be stated explicitly in the inductive step for completeness.
  8. The reference [3] (Eppstein, blog post) is cited for the claim that Cramér-type bounds alone are insufficient. This is a blog post rather than a peer-reviewed source; while acceptable for a heuristic claim, the authors might consider whether a more formal reference exists.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the probabilistic and deterministic results are self-contained, proved from first principles without self-definitional or fitted-input reductions.

full rationale

The paper's central rigorous claim, Theorem 1.3 (and its corollary Theorem 1.2), is proved from first principles. The derivation chain is: (1) Lemma 3.11 (Separation) shows that conditioning on neighboring initial values forces a location to lie in a 2-separated set, using only the recurrence (1.1); (2) Lemma 3.13 (Attained tower) shows any failure event produces a tower of {0,d}-valued triangles, using only Lemma 3.8 (Parentage) which itself follows from closure properties of the absolute difference operation; (3) Lemma 3.14 (Large shadow) is a topological connectivity argument; (4) Lemma 4.3 bounds each tower's attainment probability using Lemma 3.11 and the product of rho_i parameters; (5) Lemma 4.4 counts towers combinatorially; (6) Proposition 4.1 combines these via union bound; (7) Theorem 1.3 applies Borel-Cantelli. No step reduces to its inputs by construction. The one self-citation to [1] (Chase, 2024) is for a weaker prior result that Theorem 1.3 subsumes; it is not load-bearing for the new proof. The deterministic Theorem 1.6 is explicitly conditional on unproved axioms (i)-(iii), openly acknowledged by the authors, and its proof uses only the recurrence and pigeonhole arguments. Theorem 1.4 follows from Jensen's inequality. No fitted parameters are renamed as predictions, no uniqueness theorem is imported via self-citation, and no ansatz is smuggled in.

Assumptions & free parameters 3 free parameters · 4 assumptions · 3 invented entities

The paper introduces no postulated physical entities or ad hoc parameters fitted to data. All invented objects (towers, good blocks, constants c_i) are combinatorial/probabilistic constructs whose properties are proved within the paper. The main external assumption is the Cramér-type bound on prime gaps, which is standard in the literature and explicitly labeled as conjectural.

free parameters (3)
  • δ (in Theorem 1.3) = δ(ε) > 0, chosen sufficiently small
    δ is not fitted to data but chosen small enough that δ log(1/δ) → 0, ensuring the union bound closes. It is a proof-internal parameter, not a physical constant.
  • ε (in Theorem 1.3 axiom (ii)) = Any ε > 0; for Cramér model, ε < 1/2 suffices
    Controls the non-concentration in 2-separated sets. Verified for the Cramér model from the geometric distribution. Not a free parameter in the usual sense.
  • M, L, R_m, N' (in Theorem 1.6) = M ~ log^{1/10} N, L ~ log_{10} N, R_m = 100L · 8^{(m+1)M}
    These are scale parameters for the deterministic theorem, chosen to make the pigeonhole arguments work. They are not fitted to data but are proof-internal.
assumptions (4)
  • domain assumption Cramér-type bound on prime gaps: p_{n+1} - p_n ≪ log²(2+n) (equation 1.3)
    Used in §1.1 to argue the top row of the normalized-gap Gilbreath array has maximum size O(log² N). Stated as a conjecture; not proved.
  • domain assumption Independence of normalized prime gaps (Cramér model)
    The Cramér random model treats gaps as independent geometric random variables. This is a modeling assumption, not a theorem about primes.
  • standard math Borel–Cantelli lemma
    Used in the proof of Theorem 1.3 (§4) to pass from P(B_n) ≤ 1/n² to almost-sure finiteness.
  • standard math Jensen's inequality
    Used in the proof of Theorem 1.4 (§2) to lower-bound E[exp(-Σ a_{i,2})].
invented entities (3)
  • Towers (Definition 3.12) independent evidence
    purpose: Structural object connecting a large value at a deep location to a chain of {0,d_j}-valued triangles reaching the top row
    Towers are a combinatorial construct defined within the paper; their existence is proved (Lemma 3.13), not postulated. They serve as the key intermediate structure for the union bound.
  • Good blocks (Definition 5.4) independent evidence
    purpose: Maximal {0,d}-valued blocks used to coarsely partition the triangle in the deterministic argument
    Combinatorial construct; existence and properties proved in Lemma 5.5. Not a postulated physical entity.
  • Constants c_i (continuous model, §1.3) independent evidence
    purpose: Expected values of depth-i entries in the exponential Gilbreath array; model for average decay rate
    Defined as expectations E[a_{(i,j)}] and computed explicitly for i=0,1,2,3. The lower bound c_i ≥ 1/i is proved (Theorem 1.4). Whether c_i → 0 remains open.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Gilbreath's conjecture: a Cram\'er random model and a deterministic analysis." pith.science (2026). https://pith.science/paper/FIE4VJIL

@misc{pith2026260708712,
  author       = {Pith},
  title        = {Pith review of: Gilbreath's conjecture: a Cram\'er random model and a deterministic analysis},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/FIE4VJIL}},
  note         = {Machine review of arXiv:2607.08712}
}
abstract

Gilbreath's conjecture asserts that if one starts with the sequence of primes and takes successive absolute differences to create a triangular array, then the left diagonal of this array consists entirely of ones after the first row. In this paper, we show that the analogue of this conjecture for a Cram\'er random model holds, in which the (normalized) prime gaps are replaced by independent random variables with geometric distributions of logarithmic size. We also give some preliminary analysis of the associated continuous probabilistic model for this problem, as well as a deterministic "inverse theorem" that isolates the specific obstructions to Gilbreath's conjecture (assuming a Cram\'er type bound on prime gaps), namely long blocks of zeroes, or very long shallow $\{0,d\}$-valued blocks for some $d \geq 2$.

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Piercing Gilbreath's Conjecture: From Deep Number Theory Insights to Fintech and Cybersecurity

    cs.CR 2026-07 reject novelty 7.5 of 10

    The paper proposes an unproven corridor and 0-2-cycle framework under which Gilbreath's conjecture would follow, with only finite computational evidence.

Reference graph

Works this paper leans on

9 extracted references · 9 canonical work pages · cited by 1 Pith paper

  1. [1]

    Chase,A random analogue of Gilbreath’s conjecture, Math

    Z. Chase,A random analogue of Gilbreath’s conjecture, Math. Annalen388(2024), 2611–2625

    work page 2024

  2. [2]

    Cramér,On the order of magnitude of the difference between consecutive prime numbers, Acta Arithm

    H. Cramér,On the order of magnitude of the difference between consecutive prime numbers, Acta Arithm. 2(1936), 23–46

    work page 1936

  3. [3]

    Eppstein,Anti-Gilbreath sequences, 2011.https://11011110.github.io/blog/2011/02/20/ anti-gilbreath-sequences.html

    D. Eppstein,Anti-Gilbreath sequences, 2011.https://11011110.github.io/blog/2011/02/20/ anti-gilbreath-sequences.html

    work page 2011

  4. [4]

    P. X. Gallagher,On the distribution of primes in short intervals, Mathematika23(1976), 4–9

    work page 1976

  5. [5]

    Granville,Harald Cramér and the Distribution of Prime Numbers, Scand

    A. Granville,Harald Cramér and the Distribution of Prime Numbers, Scand. Act. J. 1, 12–28, 1995

    work page 1995

  6. [6]

    A. M. Odlyzko,Iterated absolute values of differences of consecutive primes, Math. Comput.61(1993), 373–380

    work page 1993

  7. [7]

    Packing an upwards equilateral triangle efficiently by downwards equilateral tri- angles

    F. Nazarov,Answer to “Packing an upwards equilateral triangle efficiently by downwards equilateral tri- angles”,https://mathoverflow.net/a/468067/766, 2024

    work page 2024

  8. [8]

    Proth,Sur la série des nombres premiers, Nouvelle Correspondance Mathématique4(1878), 236–240

    F. Proth,Sur la série des nombres premiers, Nouvelle Correspondance Mathématique4(1878), 236–240

    work page

Show all 9 references
  1. [9]

    T.Tao,AlmostallorbitsoftheCollatzmapattainalmostboundedvalues,ForumMath.Pi10(2022),Paper No. e12. 56 p. 28 ZACHARY CHASE, ZACH HUNTER, AND TERENCE TAO DEPARTMENT OFMATHEMATICS, KENTSTATEUNIVERSITY Email address:zachman99323@gmail.com ETH ZURICH, DEPARTMENT OFMATHEMATICS, RÄMIS...

    2022

Pith tools

Reviewed July 10, 2026 · model on record in the stance chip above.