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

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ér 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ér type bound on prime gaps), namely long blocks of zeroes, or very long shallow $\{0,d\}$-valued blocks for some $d \geq 2$.