New code for primality testing
adrien.prost-boucle at laposte.net
Thu Nov 22 07:48:00 UTC 2018
> 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
Yes and no... testing all number up to 2^64 would be a bit slow xD
Besides about BPSW returning proven primality under 2^64,
this has already been mentioned in this mailing list I think.
This article maybe ?
It may not be needed to duplicate the mentioned works.
More information about the gmp-devel