galloty / proth20

An OpenCL implementation of Proth's Theorem
MIT License
3 stars 0 forks source link
maths opencl prime-numbers

proth20

An OpenCL implementation of Proth's Theorem

About

proth20 is an OpenCL™ application.
It performs a fast primality test for numbers of the form k·2n + 1 with Proth's Theorem.
Proth.exe was created by Yves Gallot in 1998. It is a single-threaded CPU program that found many prime number records about 20 years ago.
proth20 is a new highly optimised GPU application, created in 2020.

Build

proth20 is available for tests.
Any number of the form k·2n + 1 such that 3 ≤ k < 100,000,000 and 32 ≤ n < 100,000,000 can be tested.
This version was compiled with gcc and tested on Windows, Linux (Ubuntu) and macOS.
An OpenCL SDK is not required. OpenCL header files are included in the project and the application can be linked with the dynamic OpenCL library of the OS.

TODO