The language is designed to reduce the cost of building commercial quality software. This goal is achieved by addressing the issues of portability, reuse, ease of use, software maintenance, reliability, testing, and debugging. The language integrates several innovations with a clean and simple syntax.
These primality tests extend Steve Worley's 32 bit primality test. They improve on Jim Sinclair's test that uses 7 SPRP tests. 32 bit numbers are checked with a single SPRP test, two are used for 49 bit numbers, and three for 64 bit numbers.
Numbers under 2^32 can be tested using the SPRP bases in: is.prime.32.base.data
Numbers from 2^32 to 2^64 can be tested using the base pairs in: is.prime.64.base.data
The tests have not yet been independently verified. You should verify them before using them and please let me know.
B. A. Berg, "Disentangling Exceptions", Brown University, December, 2008
Ahmad, Berg, Cetintemel, Humphrey, Hwang, Jhingran, Maskey, Papaemmanouil, Rasin, Tatbul, Xing, Zdonik, "Distributed Operation in the Borealis Stream Processing Engine", 2nd International Conference on Geosensor Networks, Boston, MA, October 2006
B. A. Berg, "A Distributed Catalog for the Borealis Stream Processing Engine", Brown University, May 31, 2006