We present a formally verified proof of Euclid's Theorem - that there are infinitely many primes - using the Stainless verification system. The proof uses the primorial-plus-one specialization of Euclid's finite-list construction and verifies the supporting arithmetic and list lemmas from first principles.
No takes yet. Share an insight, caveat, or question.
Thiago Henrique Ramos da Mata (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: