Source authenticated

Vinogradov's least quadratic nonresidue conjecture

Claims absolute constants A,C>0A,C>0 with n(p)≤C(log⁡p)An(p)\le C(\log p)^A for every odd prime pp, hence n(p)≪δpδn(p)\ll_\delta p^\delta for every δ>0\delta>0. This is a polylogarithmic bound, much stronger than the conjecture asks, though weaker than the (log⁡p)2(\log p)^2 that GRH gives. The same corollary gives a deterministic polynomial-time algorithm for square roots modulo a prime. The proof is conditional on nothing beyond the family's own zero-free half-plane ℜs>7/8\Re s>7/8 and the published theorem of Bhargava, Ivanyos, Mittal and Saxena; it is not an independent argument.

Exact FrontierDelta

Prior state unknown→proved

Scope and record

Occurred: Sep 30, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: unreviewed. Publication: announcement. AI contribution: ai-discovered. VibeMathed editorial classifications, scores, notes, relations, and dataset structure are CC BY 4.0. Source statements and linked content retain their own rights.

Canonical aliases: Vinogradov's least quadratic nonresidue conjecture · Vinogradov least nonresidue conjecture

Confidence: Not scored

Registry verification: unreviewed · announcement · candidate

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

Unreleased internal OpenAI model
model · ai model contributor · OpenAI

Artifacts and verifiers

Lean: release scope note (states the half-plane, not this corollary)

lean artifact · pending

Artifact ↗

Compute record

No linked compute attempts recorded.

Lineage and corrections

Vinogradov's least quadratic nonresidue conjecture evidence for this event

This event attributed to Unreleased internal OpenAI model

Companion: alternate proof of the zero-free half-plane Re s > 11/12 evidence for this event

Claims absolute constants A,C>0A,C>0 with n(p)≤C(log⁡p)An(p)\le C(\log p)^A for every odd prime pp, hence n(p)≪δpδn(p)\ll_\delta p^\delta for every δ>0\delta>0. This is a polylogarithmic bound, much stronger than the conjecture asks, though weaker than the (log⁡p)2(\log p)^2 that GRH gives. The same corollary gives a deterministic polynomial-time algorithm for square roots modulo a prime. The proof is conditional on nothing beyond the family's own zero-free half-plane ℜs>7/8\Re s>7/8 and the published theorem of Bhargava, Ivanyos, Mittal and Saxena; it is not an independent argument. parent of this event

Vinogradov's least quadratic nonresidue conjecture parent of this event

Lean: release scope note (states the half-plane, not this corollary) evidence for this event

Companion: Uniform exclusion of Landau-Siegel zeros evidence for this event

VibeMathed record: Vinogradov's least quadratic nonresidue conjecture evidence for this event

Act on this frontier

Verify, challenge, or extend the result.