New code for primality testing

[Adrien Prost-Boucle]

Hi,

> 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 ?
http://www.trnicely.net/misc/bpsw.html
It may not be needed to duplicate the mentioned works.

Regards,
Adrien