Go Back > Prime Search Projects > Conjectures 'R Us

Thread Tools
Old 2010-01-22, 19:39   #34
rogue's Avatar
Apr 2003
Between here and the

23×5×157 Posts
Default Phrot 0.72 released

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
rogue is offline   Reply With Quote

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
Msieve announcements jasonp Msieve 86 2018-01-11 06:31
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

All times are UTC. The time now is 06:15.

Thu Apr 15 06:15:04 UTC 2021 up 7 days, 55 mins, 0 users, load averages: 1.98, 1.91, 1.79

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.