[Gmp-commit] /var/hg/gmp: mpz/millerrabin.c: Update limit for checked values

[mercurial at gmplib.org]

details:   /var/hg/gmp/rev/05438c96d518
changeset: 18343:05438c96d518
user:      Marco Bodrato <bodrato at mail.dm.unipi.it>
date:      Sat Apr 09 07:54:54 2022 +0200
description:
mpz/millerrabin.c: Update limit for checked values

diffstat:

 mpz/millerrabin.c |  17 +++++++++--------
 1 files changed, 9 insertions(+), 8 deletions(-)

diffs (44 lines):

diff -r d45103d658ca -r 05438c96d518 mpz/millerrabin.c
--- a/mpz/millerrabin.c	Wed Mar 30 23:16:18 2022 +0200
+++ b/mpz/millerrabin.c	Sat Apr 09 07:54:54 2022 +0200
@@ -8,7 +8,7 @@
    With the current implementation, the first 24 MR-tests are substituted by a
    Baillie-PSW probable prime test.
 
-   This implementation the Baillie-PSW test was checked up to 23*10^14,
+   This implementation of the Baillie-PSW test was checked up to 2463*10^12,
    for smaller values no MR-test is performed, regardless of reps, and
    2 ("surely prime") is returned if the number was not proved composite.
 
@@ -19,10 +19,11 @@
    CERTAIN TO BE SUBJECT TO INCOMPATIBLE CHANGES OR DISAPPEAR COMPLETELY IN
    FUTURE GNU MP RELEASES.
 
-Copyright 1991, 1993, 1994, 1996-2002, 2005, 2014, 2018-2021 Free
+Copyright 1991, 1993, 1994, 1996-2002, 2005, 2014, 2018-2022 Free
 Software Foundation, Inc.
 
 Contributed by John Amanatides.
+Changed to "BPSW, then Miller Rabin if required" by Marco Bodrato.
 
 This file is part of the GNU MP Library.
 
@@ -100,12 +101,12 @@
 	  || SIZ (n) - 64 / GMP_NUMB_BITS == (PTR (n) [64 / GMP_NUMB_BITS] < CNST_LIMB(1) << 64 % GMP_NUMB_BITS)
 #endif
 #else
-	  /* Consider numbers up to 65*2^45 that pass the BPSW test as primes.
-	     This implementation was tested up to 23*10^14 > 2^51+2^45 */
-	  /* 2^6 < 65 = 0b1000001 < 2^7 */
-#define GMP_BPSW_LIMB_CONST CNST_LIMB(65)
-#define GMP_BPSW_BITS_CONST (LOG2C(65) - 1)
-#define GMP_BPSW_BITS_LIMIT (45 + GMP_BPSW_BITS_CONST)
+	  /* Consider numbers up to 35*2^46 that pass the BPSW test as primes.
+	     This implementation was tested up to 2463*10^12 > 2^51+2^47+2^46 */
+	  /* 2^5 < 35 = 0b100011 < 2^6 */
+#define GMP_BPSW_LIMB_CONST CNST_LIMB(35)
+#define GMP_BPSW_BITS_CONST (LOG2C(35) - 1)
+#define GMP_BPSW_BITS_LIMIT (46 + GMP_BPSW_BITS_CONST)
 
 #define GMP_BPSW_LIMBS_LIMIT (GMP_BPSW_BITS_LIMIT / GMP_NUMB_BITS)
 #define GMP_BPSW_BITS_MOD (GMP_BPSW_BITS_LIMIT % GMP_NUMB_BITS)