# Experiment 3: asymptotic arithmetic frames

Goal: use BBMST arithmetic frames plus machine-verified fresh-residue support obstructions to derive the asymptotic count, polynomial minimum-largest upper bound, and logarithmic reciprocal maximum.

Verified components graduated as F-032--F-037. `solution_draft.md` contains the current integrated proof. The key new construction is a cyclic ordered frame with a small last-coordinate anchor and one predecessor-fixing support per layer; F-034/F-037 prove its boundary expansion, F-035 proves covering/strong support-minimality, and F-036 transports pairwise-coprime versions through CRT.

Analytic construction: initial r primes with r~sqrt(k/log k), >=k small tags of product k^(1+o(1)), exact remaining weight decomposed by Bertrand into O(log k) prime-digit coordinates. Expected largest modulus k^(2+o(1)); reciprocal lower (3/pi^2+o(1)) log k.
