Source authenticated

Prime Gaps at Most 186

Assuming three explicit input statements, the project proves DHL[40,2]\mathrm{DHL}[40,2]: every admissible 4040-tuple contains at least two primes infinitely often after translation. An explicit admissible 4040-tuple of diameter 186186 then gives lim infn(pn+1pn)186.\liminf_{n\to\infty}(p_{n+1}-p_n)\le186. The Lean proof of the implication from the three inputs to the final theorem is kernel-checked. Two inputs are Kloosterman-type estimates cited to Katz/Deligne and Fouvry--Kowalski--Michel; the third consists of finitely many numerical integral and cap inequalities backed by a Python/FLINT certificate.

Exact FrontierDelta

Prior state unknownproved

Scope and record

Occurred: Sep 3, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: lean-checked. 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: Prime Gaps at Most 186

Confidence: Not scored

Registry verification: lean checked · announcement · partial

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

GPT 6 Astra
model · ai model contributor · OpenAI

Artifacts and verifiers

Compute record

No linked compute attempts recorded.

Lineage and corrections

Certificate evidence for this event

Lean proof evidence for this event

Formalization metadata evidence for this event

This event attributed to GPT 6 Astra

Improved short gaps between primes (OpenAI, 30 August 2026) evidence for this event

VibeMathed record: Prime Gaps at Most 186 evidence for this event

Prime Gaps at Most 186 evidence for this event

Stadlmann's 240, the bound this improves on evidence for this event

Preprint evidence for this event

Assuming three explicit input statements, the project proves DHL[40,2]\mathrm{DHL}[40,2]: every admissible 4040-tuple contains at least two primes infinitely often after translation. An explicit admissible 4040-tuple of diameter 186186 then gives lim infn(pn+1pn)186.\liminf_{n\to\infty}(p_{n+1}-p_n)\le186. The Lean proof of the implication from the three inputs to the final theorem is kernel-checked. Two inputs are Kloosterman-type estimates cited to Katz/Deligne and Fouvry--Kowalski--Michel; the third consists of finitely many numerical integral and cap inequalities backed by a Python/FLINT certificate. parent of this event

Lean proof evidence for this event

Prime Gaps at Most 186 parent of this event

Act on this frontier

Verify, challenge, or extend the result.