Exact word-level iteration, with arbitrary origin reset at every step: fold7: D=15, G2=30, entire cyclic gap word matches direct tile fold11: D=135, G2=42, entire cyclic gap word matches direct tile fold13: D=1485, G2=66, entire cyclic gap word matches direct tile fold29, theta=264: G2=theta is False fold29, theta=841: G2=theta is True The sufficient implication (no loose window >=theta) => G24, factor q-1=4, not q-2=3. Abstract legal-interior window only: outer gaps24,30 at q7 sum54>=q^2; L1, empty interior. No long qualifying run is forced by the span alone. All assertions PASS; only tiny tiles and exact integer arithmetic.