Combined Sieve Algorithm for Prime Gaps
From MaRDI portal
Publication:6355473
arXiv2012.03771MaRDI QIDQ6355473
Author name not available (Why is that?)
Publication date: 30 November 2020
Abstract: A new Combined Sieve algorithm is presented with cost proportional to the number of enumerated factors over a series of intervals. This algorithm achieves a significant speedup, over a traditional sieve, when handling many ([10^4, 10^7]) intervals concurrently. The speedup comes from a space-time tradeoff and a novel solution to a modular equation. In real world tests, this new algorithm regularly runs 10,000x faster. This faster sieve paired with higher sieving limits eliminates more composites and accelerates the search for large prime gaps by 30-70%. During the development and testing of this new algorithm, two top-10 record merit prime gaps were discovered.
Has companion code repository: https://github.com/sethtroisi/prime-gap
No records found.
This page was built for publication: Combined Sieve Algorithm for Prime Gaps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6355473)
