GitHub - stealthmachines/mersenne-prime-pipeline: 4-track GPU-accelerated Mersenne prime search:

Would YOU Like to Play Right NOW?..

https://josefkulovany.com/demo/Primes/

The Usual Copyright / Intellectual Property NOTICE -

https://zchg.org/t/legal-notice-copyright-applicable-ip-and-licensing-read-me/440

Analog Version



GPU 0

NVIDIA GeForce RTX 2060

Driver version:	32.0.15.9186
Driver date:	1/20/2026
DirectX version:	12 (FL 12.2)
Physical location:	PCI bus 1, device 0, function 0

Utilization	12%
Dedicated GPU memory	1.8/12.0 GB
Shared GPU memory	0.2/16.0 GB
GPU Memory	2.0/28.0 GB

… this shows that this particular test isn’t pushing the graphics card at all, and can be improved dramatically (9-10x increase in speed) by simply pressing up against the hardware’s capability.


This candidate passed when the other candidate (the one in the middle) found a composite. Notice it says LL required, it’s not a guaranteed test unless you wait an eternity, this particular demo version.


image
2^73 in decimal is 9,444,732,965,739,290,427,392

Now there is a thing in 64 bit (or any bit which is not arbitrary precision) called the machine epsilon. Prime95’s machine epsilon is 64 bit, it’s why I mention. This is the point at which a number becomes so small the machine can no longer “see” the number precisely. Normally 64 bit precision is enormous. That’s why they invented a thing called residue, which is supposed to be empirical, but I don’t buy those bullets. When you’re dealing with an exotic prime, this may not be sufficient. Such as it is, I don’t really want to blow $30 worth of electricity, nor hold up my graphics card for over a week to find out until winter, which is one reason I am developing a better way to solve for primes, primes which do not factor with 64 bit precision. And, an analog prime solver with all its derivatives can be useful for other niche projects..

So why am I so focused on this old prime?