Large Prime Detector – Now Available Under Open Source and Supports Multiple Threads!
Large Prime Detector – Now Available Under Open Source and Supports Multiple Threads!
I’m sure this is the correct place, right? It seems to be a software tool. Lightweight Java Prime Finder is a multithreaded application I built in Java to locate large prime numbers. It focuses on simplicity and speed. The program is optimized for performance, allowing it to identify primes with thousands of digits in just a few minutes.
Using it is straightforward. You provide a starting value like x^y + c, and it tests each subsequent number using the Fermat primality check and trial division. The interface guides you through steps, suggesting settings tailored to your system.
A good starting point is a modest number such as 3^3000 to verify everything works. The cool part is discovering previously unknown primes. For instance, the biggest prime found with this tool so far is 12^15000 + 9367, which has 16,188 digits. As of now, it hasn’t been discovered or calculated by anyone else.
It took my machine—a quad-core i5 at 3.10 GHz running at full capacity—for 36 hours straight to scan from that number and confirm its primality. I’ve attached the full file for reference.
Please note:
- Replace the main menu with simpler functions.
- Avoid repeatedly restarting by using a consistent input method.
- Share any feedback on my code if you like!
That’s all—I’m completely self-taught.
Well done, a comparable initiative exists on Boinc and PrimeGrid.
PrimeGrid sparked my idea to build this program! I appreciate what they achieved.
Ensure you're using Windows, then obtain and extract the file. Execute the generated "run.bat" to complete the process.