Addition of a small segmented sieve - #608
Open
czurnieden wants to merge 1 commit into
Open
czurnieden wants to merge 1 commit into
czurnieden wants to merge 1 commit into
Conversation
czurnieden
force-pushed
the
small_sieve
branch
from
September 18, 2026 22:57
2bba89b to
4f809ca
Compare
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
A small segmented sieve for
n<2^32with ability to check a small number for primality, get the next small prime and the preceding small prime.The sieve allocates the memory for the base sieve (4100 bytes) and the segments (8196 bytes) only once.
The corresponding tests in
test.chave the macrosMP_SMALL_SIEVE_FULL_ROUND_INCREASINGandMP_SMALL_SIEVE_FULL_ROUND_DECREASINGwhich test the whole range1<n<2^32. That needs more time than offered bytestme.sh. A fix fortestme.shadding a timeout option is in #607