From e5c17e55df9ac3ba0cc4e6836b1296ca4e09c863 Mon Sep 17 00:00:00 2001
From: christos <christos@NetBSD.org>
Date: Sat, 3 Feb 2018 15:40:29 +0000
Subject: PR/52976: Eitan Adler: handle larger primes Using results from     J.
 Sorenson and J. Webster, Strong pseudoprimes to twelve prime     bases, Math.
 Comp. 86(304):985-1003, 2017. teach primes(6) to enumerate primes up to 2^64
 - 1.  Until Sorenson and Webster's paper, we did not know how many strong
 speudoprime tests were required when testing alleged primes between
 3825123056546413051 and 2^64 - 1.

Adapted from: FreeBSD
---
 primes/primes.h | 5 +----
 1 file changed, 1 insertion(+), 4 deletions(-)

(limited to 'primes/primes.h')

diff --git a/primes/primes.h b/primes/primes.h
index 20da4ef6..2c004465 100644
--- a/primes/primes.h
+++ b/primes/primes.h
@@ -1,4 +1,4 @@
-/*	$NetBSD: primes.h,v 1.6 2014/10/02 21:36:37 ast Exp $	*/
+/*	$NetBSD: primes.h,v 1.7 2018/02/03 15:40:29 christos Exp $	*/
 
 /*
  * Copyright (c) 1989, 1993
@@ -69,6 +69,3 @@ extern const size_t pattern_size;	/* length of pattern array */
 
 /* Test for primality using strong pseudoprime tests. */
 int isprime(uint64_t);
-
-/* Maximum value which the SPSP code can handle. */
-#define	SPSPMAX 3825123056546413050ULL
-- 
cgit v1.2.3-56-ge451