GPU Mersenne primality test.
-
Updated
Nov 1, 2025 - C++
#
lucas-lehmer
Here are 11 public repositories matching this topic...
Mersenne prime search using integer arithmetic and an IDBWT via an NTT executed on the GPU through OpenCL.
gpu opencl mathematics ecm fft elliptic-curves prime-numbers gpu-computing factoring-integers lucas lucas-lehmer mersenne-numbers ntt mersenne-prime p-1 mersenne factoring factoring-algorithms elliptic-curve-cryptography
-
Updated
Nov 1, 2025 - C++
Software to perform the LLR test, proving the primality of Riesel numbers of the form h*2^n-1.
-
Updated
Sep 19, 2017 - Go
Software to perform the LLR test with GNU MP, proving the primality of Riesel numbers of the form h*2^n-1
-
Updated
Feb 9, 2020 - C
A program made to search for Mersenne primes
-
Updated
Oct 14, 2020 - Python
Verified primes of the form h*2^n-1 where h < 2^n
-
Updated
Apr 26, 2019
A simple Lucas-Lehmer primality test implementation for C++
-
Updated
Dec 12, 2017 - C++
A Javascript Implementation of the Lucas-Lehmer Primality Test for Mersenne Primes
-
Updated
Apr 2, 2017 - JavaScript
Primality testing and prime factorization utility
-
Updated
Dec 21, 2017 - Haskell
Primality test for Mersenne primes (M_{n}=2^{n}-1)
-
Updated
Mar 22, 2021 - Rust
Improve this page
Add a description, image, and links to the lucas-lehmer topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the lucas-lehmer topic, visit your repo's landing page and select "manage topics."