Have a personal or library account? Click to login
Genefer: Programs for Finding Large Probable Generalized Fermat Primes Cover

Genefer: Programs for Finding Large Probable Generalized Fermat Primes

Open Access
|Nov 2015

Abstract

Genefer is a suite of programs for performing Probable Primality (PRP) tests of Generalised Fermat numbers b2n+1 (GFNs) using a Fermat test. Optimised implementations are available for modern CPUs using single instruction, multiple data (SIMD) instructions, as well as for GPUs using CUDA or OpenCL. Genefer has been extensively used by PrimeGrid – a volunteer computing project searching for large prime numbers of various kinds, including GFNs.

Genefer’s architecture separates the high level logic such as checkpointing and user interface from the architecture-specific performance-critical parts of the implementation, which are suitable for re-use. Genefer is released under the MIT license. Source and binaries are available from www.assembla.com/spaces/genefer.

DOI: https://doi.org/10.5334/jors.ca | Journal eISSN: 2049-9647
Language: English
Published on: Nov 19, 2015
Published by: Ubiquity Press
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year

© 2015 Iain Arthur Bethune, Yves Gallot, published by Ubiquity Press
This work is licensed under the Creative Commons Attribution 4.0 License.