New code for primality testing

Marco Bodrato bodrato at
Thu Nov 22 07:33:01 UTC 2018


Il Mer, 21 Novembre 2018 10:43 pm, Torbjörn Granlund ha scritto:
> "Marco Bodrato" <bodrato at> writes:
>   If we can verify the source of the second claim, since we just
> implemented
>   BPSW, we should decide to return 2 (surely prime) for all "probable"
>   primes under this threshold.
> We could check ourselves to a gradually larger bound, then insert our
> latest determined bound into the current GMP code and return 2 for
> smaller primes.

Does this mean that we have to implement an unconditional primality
proving function to test if our "probab_primes" are really primes or they
are not?

Adrien will be happy to read this :-D



More information about the gmp-devel mailing list