Open, the site's label (OPEN; page last edited 01 October 2025). The site's proof-claims tab carries a partial proof claim by Rafik Zeraoulia (submitted 2026-07-27, with OpenAI GPT-5.6 Thinking as the assisting system the claim names) that any such covering system with distinct moduli has moduli whose least common multiple is at least $393120$, by an exact computer-assisted sieve, recorded as claimed on its claim page (Zeraoulia, 2026). The discussion thread carries a research note of July 2026 by the pseudonymous user ideal_ombrer, whose Theorem 1.1 asserts that every such covering system uses a modulus $p-1$ with $p>877$, recorded as claimed on its claim page (Ideal Ombrer, 2026), and later posts, without a manuscript, asserting larger bounds on the least common multiple, described on Zeraoulia's claim page.