Mersenne prime search using integer arithmetic and an IDBWT via an NTT executed on the GPU through OpenCL.
-
Updated
Dec 6, 2025 - C++
Mersenne prime search using integer arithmetic and an IDBWT via an NTT executed on the GPU through OpenCL.
A 32-bit Mersenne Twister pseudorandom number generator.
A prime k-tuple finder based on the rug crate.
(WIP) Esoteric Mathematic Library for TypeScript
Approach to calculating big Mersenne primes with arbitrary precision numbers.
Create an array containing pseudorandom numbers generated using a 32-bit Mersenne Twister pseudorandom number generator.
This repository holds a makefile useful for installing a Mersenne prime gpu computing machine.
Lists all currently known Mersenne primes written in full.
Generate Mersenne prime numbers into files (C++)
A Mersenne Primality Test that implements the Lucas-Lehmer Test
Primality test for Mersenne primes (M_{n}=2^{n}-1)
Configurable Mersenne Twister PRNG implementation written in TypeScript.
Add a description, image, and links to the mersenne topic page so that developers can more easily learn about it.
To associate your repository with the mersenne topic, visit your repo's landing page and select "manage topics."