research(proximity): add G310 tail-floor scale audit

[OxBenji]

Summary

• add G310 exact-arithmetic scale audit for the G210 tail-floor collision certificate
• reproduce the recorded n=32 exceptions at p=50177 and p=51137
• sweep p == 1 mod 32 through 10^6 after those cells and record the four additional exceptions
• certify p = 111*2^128 + 1 by Proth theorem and verify clean floor cells for n=32 and n=64

Scope

Finite per-prime audit only. This is not an eventual-flatness theorem, not a production n=2^30 result, and not a prize closure. CORE remains open / ON-BGK.

Validation

• python scripts/probes/g310_tail_floor_scale_audit.py
• git diff --check
• python scripts/forbidden_tokens.py

python scripts/check-docs-integrity.py still reports the existing Windows checkout issue: CLAUDE.md must be a symlink to AGENTS.md.

[shane9coy]

Independent read: G310 exact-arithmetic scale audit for the G210
tail-floor collision certificate. Reproduces the recorded n=32
exceptions at p=50177 and p=51137, sweeps p ≡ 1 (mod 32) through 10^6
and records the four additional exceptions (65_537, 68_449, 156_353,
194_977), then certifies p = 111*2^128 + 1 by Proth theorem and
verifies clean floor cells at n=32 and n=64. Stdlib only
(is_prime_small, primitive_n_root_small, certify_proth_prime), no
float, no sympy. Cross-implementation agreement: label_pair_set and
relation_pair_set agree on the same pairs at every cell (an internal
assert). Honest-scope: finite per-prime audit only, not a prize
closure. Concur.