Newman (1976) proved that such a constant exists and conjectured that . The Riemann
hypothesis is equivalent to the conjecture that , so Newman's conjecture asserts that the Riemann
hypothesis, if true, is only barely true. The following table summarizes best
known lower bounds on prior to 2020, when Rodgers and Tao (2020) proved that
.
lower bound
reference
Newman (1976)
Csordas-Norfolk-Varga (1988)
te Riele (1991)
Norfolk-Ruttan-Varga (1992)
Csordas-Ruttan-Varga (1991)
Csordas-Smith-Varga
(1994)
Csordas-Odlyzko-Smith-Varga
(1993)
Odlyzko (2000)
Saouter-Gourdon-Demichel
(2011)
Upper bounds on are summarized below. The final three rows are computer-assisted
bounds reported in 2026 that had not undergone external peer review as of Sep. 15,
2026.
upper bound
reference
status
de Bruijn (1950)
published
Ki-Kim-Lee (2009)
published
Polymath (2019)
published
Platt-Trudgian (2021)
published
Mosaic Intelligence (2026)
unreviewed
Gomila (2026)
unreviewed
Gordon (2026)
unreviewed
Mosaic Intelligence (2026) describes its bound as AI-generated. Gomila (2026) reports human-directed work using Claude and ChatGPT/Codex, while Gordon (2026) reports assistance from GPT-6 Astra and Claude Code. The Mosaic Intelligence and Gomila projects provide numerical certificates. Gordon's partial Lean formalization is conditional on stated analytic inputs.
Hakimoglu-Brown (2026) reported the conditional bound , assuming that the Riemann
zeta function has no nontrivial zero with real part
greater than .
The zero-free assertion is an external, unreviewed input. The bound is therefore
not an unconditional replacement for the values above. Hakimoglu-Brown (2026) acknowledges
ChatGPT assistance with analytic derivations and exact verification calculations,
and states that the argument has not been independently refereed.
For Dirichlet L-series, a generalized de Bruijn-Newman constant is similarly defined by the heat deformation of the
completed function. Freire et al. (2026) proved
(4)
for every primitive real-valued number theoretic character of conductor between 3 and 400. The bound is unconditional and uses
rigorous numerical checks together with finite-height zero verification. It is not
a bound for all conductors or all complex-valued number
theoretic characters. Freire et al. (2026) report AI assistance in refining
analytic error estimates and numerical methods.
Csordas, G.; Norfolk, T. S.; and Varga, R. S. "A Lower Bound for the De Bruijn-Newman Constant ." Numer. Math.52, 483-497, 1988.Csordas,
G.; Odlyzko, A.; Smith, W.; and Varga, R. S. "A New Lehmer Pair of Zeros
and a New Lower Bound for the de Bruijn-Newman Constant." Elec. Trans. Numer.
Analysis1, 104-111, 1993.Csordas, G.; Ruttan, A.; and Varga,
R. S. "The Laguerre Inequalities with Applications to a Problem Associated
with the Riemann Hypothesis." Numer. Algorithms1, 305-329, 1991.Csordas,
G.; Smith, W.; and Varga, R. S. "Lehmer Pairs of Zeros, the de Bruijn-Newman
Constant and the Riemann Hypothesis." Constr. Approx.10, 107-129,
1994.de Bruijn, N. G. "The Roots of Trigonometric Integrals."
Duke Math. J.17, 197-226, 1950.Finch, S. R. "De
Bruijn-Newman Constant." §2.3 2 in Mathematical
Constants. Cambridge, England: Cambridge University Press, pp. 203-205,
2003.Freire, R.; González-Riquelme, C.; Muñoz, C.; Poblete,
F.; and Salinas, V. "Upper Bounds on the de Bruijn-Newman Constant for Dirichlet
-Functions
with Primitive Real-Valued Characters." 19 Oct 2026. https://arxiv.org/abs/2610.27343.Gomila,
J. "A Computer-Assisted Proof of the Bound for the de Bruijn-Newman
Constant." Aug. 20, 2026. https://github.com/judegomila/dbn-lambda-01787854-candidate-audit.Gordon,
S. "A Computer-Assisted Upper Bound for the de Bruijn-Newman Constant."
Sep. 12, 2026. https://github.com/stefangordon/dbn-upper-bound/releases/tag/v1.0.0.Hakimoglu-Brown,
C. "A Conditional Bound for the de Bruijn-Newman Constant."
8 Oct 2026. https://arxiv.org/abs/2610.12803.Ki,
H.; Kim, Y.-O.; and Lee, J. "On the de Bruijn-Newman Constant." Adv.
Math.222, 281-306, 2009. https://doi.org/10.1016/j.aim.2009.04.003.Mosaic
Intelligence. "A Certified Unconditional Upper Bound for the de Bruijn-Newman Constant." Jul. 3,
2026. https://doi.org/10.5281/zenodo.21175533.Newman,
C. M. "Fourier Transforms with only Real Zeros." Proc. Amer. Math.
Soc.61, 245-251, 1976.Norfolk, T. S.; Ruttan, A.; and
Varga, R. S. "A Lower Bound for the de Bruijn-Newman Constant II." In Progress in Approximation Theory
(Ed. A. A. Gonchar and E. B. Saff). New York: Springer, pp. 403-418,
1992.Odlyzko, A. M. "An Improved Bound for the De Bruijn-Newman
Constant." Numer. Algorithms25, 293-303, 2000.Platt,
D. and Trudgian, T. "The Riemann Hypothesis Is True up to ." Bull. London Math. Soc.53,
792-797, 2021. https://doi.org/10.1112/blms.12460.Polymath,
D. H. J. "Effective Approximation of Heat Flow Evolution of the Riemann
Xi Function, and a New Upper Bound for the de Bruijn-Newman Constant." Res.
Math. Sci.6, Article 31, 2019. https://doi.org/10.1007/s40687-019-0193-1.Rodgers,
B. and Tao, T. "The De Bruijn-Newman Constant Is Non-Negative." Forum
Math., Pi8, e6, 62 pp., 2020.Saouter, Y.; Gourdon, X.; and
Demichel, P. "An Improved Lower Bound for the De Bruijn-Newman Constant."
Math. Comp.80, 2281-2287, 2011.te Riele, H. J. J.
"A New Lower Bound for the De Bruijn-Newman Constant." Numer. Math.58,
661-667, 1991.