phrot originated as a program called glprov by Phil Carmody. We worked out a number of bugs with the software and I used it privately for a long time. With his blessing I released the software in 2007.
glprov (and now phrot) uses YEAFFT by Guillermo Ballestor Valor. phrot perform PRP tests on number of the form k*b^n+/-1. The residues from phrot match those from LLR and PFGW.
Since that time I have made numerous enhancements to phrot, including:
-
-performance enhancements for RISC CPUs (most notable PowerPC)
-
-read ABC input files
-
-perform Proth primality tests on numbers of the form k*2^n+1
-
-perform PRP tests on GFNs
-
-better error checking and checkpointing
At one point in time phrot was actually faster than PFGW and LLR for PRP testing a number of bases, but improvements to those programs have negated that. phrot is still fairly speedy though and helps to bring PrimeGrid projects using PRPNet to non-x86 CPUs. If you follow the link on the left, you will find primes found with phrot, most, if not all of them, on non-x86 hardware.
If any developers out there want to improve phrot, the source code is included in the distribution, so feel to send those improvements back to me. I make no guarantees to merge them with my source, but I’m fairly easy to work with. I can be reached at rogue (at) wi.rr.com.
