ade8bcee50
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.
Reported by: Luiz Henrique de Figueiredo
Relnotes: primes(6) now enumerates primes beyond 3825123056546413050,
up to a new limit of 2^64 - 1.
MFC After: 1 week
75 lines
2.9 KiB
C
75 lines
2.9 KiB
C
/*
|
|
* Copyright (c) 1989, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to Berkeley by
|
|
* Landon Curt Noll.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* @(#)primes.h 8.2 (Berkeley) 3/1/94
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
/*
|
|
* primes - generate a table of primes between two values
|
|
*
|
|
* By: Landon Curt Noll chongo@toad.com, ...!{sun,tolsoft}!hoptoad!chongo
|
|
*
|
|
* chongo <for a good prime call: 391581 * 2^216193 - 1> /\oo/\
|
|
*/
|
|
|
|
#include <stdint.h>
|
|
|
|
/* ubig is the type that holds a large unsigned value */
|
|
typedef uint64_t ubig; /* must be >=32 bit unsigned value */
|
|
#define BIG ULONG_MAX /* largest value will sieve */
|
|
|
|
/* bytes in sieve table (must be > 3*5*7*11) */
|
|
#define TABSIZE 256*1024
|
|
|
|
/*
|
|
* prime[i] is the (i-1)th prime.
|
|
*
|
|
* We are able to sieve 2^32-1 because this byte table yields all primes
|
|
* up to 65537 and 65537^2 > 2^32-1.
|
|
*/
|
|
extern const ubig prime[];
|
|
extern const ubig *const pr_limit; /* largest prime in the prime array */
|
|
|
|
/* Maximum size sieving alone can handle. */
|
|
#define SIEVEMAX 4295098368ULL
|
|
|
|
/*
|
|
* To avoid excessive sieves for small factors, we use the table below to
|
|
* setup our sieve blocks. Each element represents an odd number starting
|
|
* with 1. All non-zero elements are factors of 3, 5, 7, 11 and 13.
|
|
*/
|
|
extern const char pattern[];
|
|
extern const size_t pattern_size; /* length of pattern array */
|
|
|
|
/* Test for primality using strong pseudoprime tests. */
|
|
int isprime(ubig);
|