Continue the long-gap-dilate campaign from current main. Read AGENTS.md and problems/long-gap-dilate/.

Current record in this repo: SAT G(p, round √p) through p=71. No universal C>2. Record still Shakan 2. Replay compute/run_all.sh first.

This SuperGrok 2026-08-17 start has no compute/qN/ yet. Work in compute/q1/. Outcome to hunt: a certified universal C>2, a construction that beats Shakan on infinitely many primes, or an exact SAT census that extends the p=71 table and implies a new infinite-family bound. Isolated SAT timeouts are an incomplete search. Fetch Green #32 and Shakan (arXiv:2004.14828) before searching. The list id arXiv:2205.14038 is a different paper.