PRPLL NTT now supports both CUDA and OpenCL

For the Great Internet Mersenne Prime Seach (GIMPS) (https://www.mersenne.org), PRPLL NTT now supports CUDA in addition to OpenCL for primality testing using either FP64 FFT or integer NTT.

Special thanks to Mersenne Forum user “Sherpa”, who shared their source code for translating OpenCL into CUDA code at the link below.

https://github.com/shitcoinsherpa/Frey-PRPLL

George Woltman just provided the first official release of a CUDA version of PRPLL.

Current versions:

Linux OpenCL: https://www.dropbox.com/scl/fi/o22fl…lhcbpx225&dl=0
Linux CUDA: https://www.dropbox.com/scl/fi/o35sl…c8sg87q0h&dl=0
Windows OpenCL: https://www.dropbox.com/scl/fi/04uef…y2r7jfh42&dl=0
Windows CUDA: https://www.dropbox.com/scl/fi/l5pyn…mbx0crmax&dl=0
Windows CUDA static-linked: https://www.dropbox.com/scl/fi/3rvda…qtixk2xed&dl=0

https://github.com/gwoltman/gpuowl

The GIMPS largest prime number project is going great with this optimized CUDA / OpenCL software.

Feel free to join: follow instructions shown in Setup Wizard for PRPLL NTT section:

https://download.mersenne.ca/mirror/AutoPrimeNet/quick-start-guide.html

Some sample timings for Mersenne Prime 136279841:

NVIDIA RTX PRO 6000 Blackwell Server Edition

Integer NTT

180 microseconds per iteration

RTX 5090

Integer NTT

185 microseconds per iteration

NVIDIA H100 80GB HBM3

FP64 FFT

196 microseconds per iteration

NVIDIA A100-SXM4-40GB

FP64 FFT

378 microseconds per iteration

RTX 4060

Integer NTT

1365 microseconds per iteration