|Portability||Non-portable (GHC extensions)|
|Maintainer||Daniel Fischer <email@example.com>|
Factorisation proving the primality of the found factors.
For large numbers, this will be very slow in general. Use only if you're paranoid or must be really sure.
produces the prime factorisation
n, proving the primality of the factors, but doesn't report the proofs.
constructs a the prime factorisation of
provenFactorisation bound n
(which must be positive) together with proofs of primality of the factors,
using trial division up to
bound (which is arbitrarily replaced by
if the supplied value is smaller) and elliptic curve factorisation for the
remaining factors if necessary.
Construction of primality proofs can take a very long time, so this
will usually be slow (but should be faster than using
proving the primality of the factors from scratch).