Information as of 2020-04-07: Inserting more history entries for

**Riesel primes k<300 (k=1-49 done)****Collected:**MersenneForum thread "POST LOTS AND LOTS OF PRIMES HERE":**#1 (2010-03-17) - #1945 (2020-03-11)**(**100%**) done.**Collected:**IDs for Riesel primes of the The Prime Pages:*k*= 1 - 299**100%**) done.**DONE**: MersenneForum thread "Riesel Primes k*2^n-1, k<300 (Part II)" (#1 (2007-07-08) - #986 (2020-04-06)).**Please check your reservations here****.**

# Mprime (Cray)

**mprime** was the software, initially authored by David Slowinski (later versions with Paul Gage), for testing Mersenne numbers for primality on Cray supercomputers.

This software is responsible for the discovery of 7 Mersenne primes. It used Fast Fourier transforms for the multiplication of very large numbers. This represented an advance over the software used by Landon Curt Noll & Laura A. Nickel. Noll had suggested the use of FFT's, but had not implemented them until after his discovery of M26.