![]() |
|
|
#34 |
|
"Mark"
Apr 2003
Between here and the
143138 Posts |
I have made changes to support testing of numbers of the form b^n+/-1, which includes GFNs. Note that genefer is faster than phrot, but the advantage of phrot is that it will handle higher bases than genefer. The maximum base for genefer decreases as n increases. This does not happen with phrot. phrot can handle bases up to 5000000 for any n. Residues from phrot will match residues from PFGW for GFN tests.
I will no longer build phrot for Windows because PFGW should be much faster. This software targets non-x86 users. You can download the latest sources from here. Note that I have to make some changes to PRPNet so that the client can correctly support GFN testing when using phrot. Last fiddled with by rogue on 2010-01-22 at 19:41 |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Msieve announcements | jasonp | Msieve | 101 | 2021-07-08 20:27 |
| Primenet maintenance announcements | Madpoo | PrimeNet | 7 | 2015-11-12 05:50 |
| GMP-ECM Announcements | akruppa | GMP-ECM | 12 | 2013-02-27 15:30 |
| Compiling Phrot | rogue | Sierpinski/Riesel Base 5 | 142 | 2009-01-09 03:42 |
| Announcements | hhh | Prime Cullen Prime | 10 | 2007-05-16 20:42 |