Vinogradov's least primitive root conjecture asserts that the least positive primitive root modulo a prime number
satisfies
|
(1)
|
for every . Here the Vinogradov
notation
means that
for all primes
, where
is a constant that
may depend on
but not on
.
This is stronger than the corresponding conjecture for the least quadratic
nonresidue, since a primitive root modulo an
odd prime is a quadratic
nonresidue. Burgess (1962) proved the unconditional bound
.
Martin (1997) used sieve methods to bound , the least prime number
that is a primitive root modulo
. His estimate depends on zero-free
regions for Dirichlet L-series.
Since
, it also bounds the least primitive
root
.
A uniform zero-free half-plane for Dirichlet L-series implies the conjecture. Specifically, suppose that some fixed
satisfies
for every nonprincipal number
theoretic character
and every
,
independently of the modulus and height. Martin's result
then gives
|
(2)
|
Indeed, for odd ,
write
for the number of distinct prime
factors and
,
where
is the totient function.
Martin's estimate bounds
by a constant depending only on
times
.
The estimates
and
bound the expression inside the power
by a constant times
,
giving the stated logarithmic bound.
OpenAI (2026) claimed the required uniform zero-free half-plane with in its proposed proof of the quasi-Riemann
hypothesis. Conditional on that claim, the preceding argument yields
|
(3)
|
This conditional application of Martin's bound was noted by vengy (2026). The release attributes the zero-free theorem and its Lean formalization to an internal OpenAI model. As of Oct. 25, 2026, independent specialist verification of that underlying theorem had not been reported. The implication therefore does not supply an independent unconditional proof of Vinogradov's conjecture.