Claims

../

2026_04_25_chojecki: A manuscript posted on 25 April 2026, credited to GPT-5.5 Pro prompted by Chojecki, proves the upper bound matching the semiprime construction, so the largest rigid set has order n log log n / log n; accepted by the site's curator.

2026_09_16_rogerhu: A research note released on 16 September 2026 from the repository of the user Rogerhu12, its proof credited to GPT-6 Astra, sharpens the accepted order of magnitude to the asymptotic F(n) ~ n log log n / log n; unreviewed.

---