Direct discovery · Mathematics

Astra supplies a proof claiming infinitely many prime gaps of at most 186

A claimed bound liminf(p[n+1] − p[n]) ≤ 186, with a paper, conditional Lean development, and numerical certificate.

Summary

The manuscript dated August 30 and released with Astra on September 3 derives DHL[40,2] and applies an admissible forty-element tuple of diameter 186. It builds on existing prime-distribution estimates and extends the sieve’s usable support.

AI role

GPT-6 Astra developed the sieve argument and numerical optimization attributed to it in the released manuscript.

Narrative role

This is an inspectable AI-attributed advance on a recognized number-theory frontier, with the formal certificate’s remaining assumptions made explicit.

Caveat

The Lean proof assumes three project inputs covering exponential-sum estimates and numerical bounds. It is not an end-to-end formal verification of the unconditional claim, and this run did not independently reproduce the certificate.