---

Claim. For independent uniform signs and $R_n$ the number of zeros of the random Littlewood polynomial in the closed unit disk,

$$R_n=\frac{n}{2}+O\bigl(n^{7/8+\delta}\bigr) \quad\text{almost surely, for every }\delta>0,$$

so $R_n/(n/2)\to1$ almost surely, which answers Problem 522 in the affirmative. The note A fourth moment estimate for logarithmic integrals of random Littlewood polynomials and Erdős's root-count problem was first posted by Yongchan Kwon, who announced it on the site's discussion thread on 2026-04-28, the day its repository was created, naming ChatGPT 5.5 Pro as the system used and saying Kwon had not known of Chojecki's note while working; the revision of 2026-05-07 adds James Zou as coauthor. The mechanism is a uniform fourth-moment concentration estimate for the normalized logarithmic average of $\lvert P_n\rvert$ on a thin annulus around the unit circle, built from a fixed-dimensional Rademacher anti-concentration lemma for small values, a smoothing at scale $(\log n)^Bn^{-1/2}$ controlled by Pisier's inequality on the discrete cube, removal of the smoothing by the Nazarov–Nishry–Sodin logarithmic integrability theorem, and Jensen's formula at three nearby radii with a Borel–Cantelli step. The repository carries a statement on the use of AI and says the route differs from the one circulated in the thread.

Depends on. No page of this wiki.

Standing. Claimed. The thread records no check of the note, no proof claim was registered on the site's proof-claims tab, and no refereed or arXiv version was found; the formal-conjectures statement of the problem cites the note as a proof posted in April 2026, and Kitamura's Lean repository credits it, with Chojecki's note, as an informal proof of the $\{-1,1\}$ statement. The site's label records a Lean formalization of a later claim and no human acceptance (OPEN (LEAN); page last edited 06 December 2025). The other full claims are Chojecki 2026, Snyder 2026, Kawada 2026 and Kitamura 2026.