Optimal bound for the polynomial Littlewood–Offord problem, ‘discovered autonomously by GPT-6 Pro’ (exposition by Grebennikov)
Awaiting review
The takeaway
On Oct 6, 2026 Alexandr Grebennikov posted arXiv 2610.08708, an exposition of a proof he says “was discovered autonomously by GPT-6 Pro”.
Status
- Claim
Awaiting review
- Our reporting
- Medium confidence
- Verification
- Preprint only
- Importance
- 3 of 5
- Last verified
- 13 October 2026
Your AI and this story
- GPT-6.2 Astra128 days after its cutoff
- Claude Opus 5.598 days after its cutoff
- Gemini 4 Hydrogen189 days after its cutoff
- Grok 4.7128 days after its cutoff
None of these four assistants can know about it. The closest, Claude Opus 5.5, stops 98 days before it.
Key facts
- Paper: ‘Optimal bound for the polynomial Littlewood–Offord problem’, Alexandr Grebennikov, arXiv 2610.08708 (math.CO), 6 Oct 2026, 8 pages
- Result: P[F(ξ₁,…,ξₙ) = 0] = O_d(r^{-1/2}) for Rademacher ξᵢ, where F is degree-d multilinear with r degree-d monomials on disjoint variable sets; previously (log r)^{O_d(1)} r^{-1/2} (Meka, O. Nguyen, Vu); known before only for d = 1 (Erdős), d = 2 (Kwan–Sauermann) and bounded Chow rank (Grebennikov–Kwan)
- AI statement (quote): ‘The proof was discovered autonomously by GPT-6 Pro (the chat logs can be found here), and the author does not claim any credit for the proof ideas. The argument was subsequently verified, digested, and rewritten from scratch by the author.’
- Chat log: chatgpt.com/share/6ab4f17d-7a3c-83eb-a4e6-a99920bd9384 (linked from the PDF)
- A footnote notes that a similar linear-algebra statement appears implicitly in the AI-assisted Chvátal-conjecture proof (Chang, H. Liu, M. Liu) and its follow-ups
- Not part of OpenAI’s 6 Oct github.com/openai/math release
What happened
The Littlewood–Offord problem asks how likely a random ±1 combination is to hit a fixed value. Erdős settled the linear case, and the polynomial version has been studied since Costello, Tao and Vu’s work on random symmetric matrices. Hoi Nguyen and Van Vu conjectured that a degree-d multilinear polynomial with many nonzero top-degree coefficients vanishes with probability O(m^{-1/2}). The best general bound, by Meka, Oanh Nguyen and Vu, was off by a polylogarithmic factor.
On 6 October 2026 Alexandr Grebennikov, who had earlier worked on the bounded-Chow-rank case with Matthew Kwan, posted an eight-page exposition of an argument that gives the optimal O_d(r^{-1/2}) bound. The key step is an estimate for the total influence of functions p/q with p and q of bounded degree, which also resolves a recent conjecture of Kothari, Kovacs-Deak, Wang and Yang. The author states that the proof “was discovered autonomously by GPT-6 Pro … and the author does not claim any credit for the proof ideas”. He then verified it and rewrote it from scratch, and he links the full ChatGPT conversation.
Why it matters
It is another case where a consumer-tier model (ChatGPT’s GPT-6 Pro) is credited with the whole idea behind an optimal bound in a well-studied area, with a public transcript. The same day, OpenAI’s internal-model release dominated attention.
What is disputed or not yet verified
| Verification | Unrefereed preprint by a specialist in the area; public chat log |
|---|
Sources
2 sources from 2 sites. Numbers match the chips in the text.
2 sources: 1 primary, 1 reaction
Primary
Reactions
- ChatGPT shared conversation (GPT-6 Pro chat log)chatgpt.com, discussion
Changes
- Related: the catalogue that lists this result is now October 2026: the arXiv stream of conjectures settled with disclosed AI help continues (the October blocks were split out of the summer catalogue)
- Filed (PDF and its chat-log link read)