Continue the two-smooth-summands campaign on https://github.com/wustep/maths from current main. Work in compute/q1/.

Outcome to hunt: a certified finite residue cover or explicit ε with a checkable covering template that implies an infinite covering, or an exponent below Balog. Isolated small-N tables are an incomplete search unless they imply an infinite covering. Fetch Green #59 and Erdős #334 before searching. Replay compute/verify_all.py first.