Claims

../

2026_04_25_zribi: Zribi's AI-assisted notes of 25 April to 2 June 2026 claiming the two-fold covering for all large n by a hypergraph matching from linear equations in primes and Kahn's rounding theorem; merged into the joint July submission.

2026_04_30_chojecki: Chojecki's AI-assisted working manuscript of 27 April 2026 asserting the two-fold covering for all large n by a greedy matching; Xu's Lean development of September 2026 declares itself its formalization; pending.

2026_07_21_zribi_chojecki: Zribi and Chojecki's AI-assisted full proof claim of 21 July 2026 on the site's tab, merging their notes: leftover integers paired through prime progressions and a Selberg sieve; a shorter version in September; pending.

---