[libmath-prime-util-perl] 05/72: Update for new M-R base from Panasiuk and Izykowski

[Partha P. Mukherjee]

This is an automated email from the git hooks/post-receive script.

ppm-guest pushed a commit to annotated tag v0.32
in repository libmath-prime-util-perl.

commit 66b60c19e4734aa5d31a9b9eae73c8dcd57d9077
Author: Dana Jacobsen <dana at acm.org>
Date:   Wed Aug 14 00:59:46 2013 -0700

    Update for new M-R base from Panasiuk and Izykowski
---
 factor.c | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/factor.c b/factor.c
index 0530b32..b7166de 100644
--- a/factor.c
+++ b/factor.c
@@ -405,8 +405,8 @@ static const UV mr_bases_small_2[2] = {31, 73};
 static const UV mr_bases_small_3[3] = {2, 7, 61};
 #else
 static const UV mr_bases_large_1[1] = { UVCONST(  9345883071009581737 ) };
-static const UV mr_bases_large_2[2] = { UVCONST(   725270293939359937 ),
-                                        UVCONST(  3569819667048198375 ) };
+static const UV mr_bases_large_2[2] = { UVCONST(         336781006125 ),
+                                        UVCONST(     9639812373923155 ) };
 static const UV mr_bases_large_3[3] = { UVCONST(  4230279247111683200 ),
                                         UVCONST( 14694767155120705706 ),
                                         UVCONST( 16641139526367750375 ) };
@@ -438,7 +438,7 @@ int _XS_is_prob_prime(UV n)
    * So it works out to be faster to do AES-BPSW vs. 3 M-R tests. */
   if (n < UVCONST(341531))
     ret = _XS_miller_rabin(n, mr_bases_large_1, 1);
-  else if (n < UVCONST(885594169))
+  else if (n < UVCONST(1050535501))
     ret = _XS_miller_rabin(n, mr_bases_large_2, 2);
   else
     ret = _SPRP2(n) && _XS_is_almost_extra_strong_lucas_pseudoprime(n,1);

-- 
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-perl/packages/libmath-prime-util-perl.git