Math-Prime-Util-GMP

Changes for version 0.11

is_prob_prime is faster at finding composites.
rewrote Lucas inner loop for ~20% speedup.
The previous two changes make is_prob_prime a bit faster, which means a small speedup to almost all functions.
Lower is_prime proving effort. Proves ~30% of 128-bit primes instead of 50%, but runs about 4x faster.
Change ECPP to factor all strategy with backtracking. Not much difference below 200 digits, but a big help after that. Certificates are identical.

Utilities related to prime numbers and factoring, using GMP

To install Math::Prime::Util::GMP, copy and paste the appropriate command in to your terminal.

cpanm Math::Prime::Util::GMP

perl -MCPAN -e shell
install Math::Prime::Util::GMP

For more information on module installation, please visit the detailed CPAN module installation guide.

	Global
`s`	Focus search bar
`?`	Bring up this help dialog

	GitHub
`g` `p`	Go to pull requests
`g` `i`	go to github issues (only if github is preferred repository)

	Search terms
module: (e.g. module:Plugin)
distribution: (e.g. distribution:Dancer auth)
author: (e.g. author:SONGMU Redis)
version: (e.g. version:1.00)