20030410, 13:06  #1 
Mar 2003
2_{8} Posts 
PRP queries
Some queries on PRP (the program)
1. What/where is the latest version? I currently have 2.3.0 2. Can anyone explain what the "time per bit" is proportional to? Obviously it varies with CPU speed, but it seems to vary per number, where I would have expected it to be constant. I don't know how this stuff works, but I would like to know when I benchmark hardware changes I've got some baseline to work on. Cheers and Happy Hunting 
20030411, 02:43  #2 
"William Garnett III"
Oct 2002
Bensalem, PA
2^{2}×3×7 Posts 
reply
Hi bc,
The latest version of PRP is at this link: http://www.mersenne.org/gimps prp.zip for Windows, and prp.tgz for Linux You do have the latest version of PRP. Time per bit in milliseconds is based on the FFT range. Let's look at the very similar Prime95 page (which deals with mersenne numbers and not proth numbers): http://www.mersenne.org/bench.htm For exponents of 6465000 to 7690000 for mersenne numbers, the FFT range is 384K, which is the amount of memory (if I understand correctly) that is used. So all numbers in that range will have the same time per bit. Now, again if I am understanding correctly, towards the top of the range more memory is starting to be needed so for the next range of 7690000 to 8970000, the FFT is 448K. And since the FFT is bigger and more memory is needed, the time per bit for numbers in this range is slower than the previous range. And so on :) Proth numbers are similar in regards to FFT. Regards, william 
20030423, 13:59  #3 
Feb 2003
2^{5} Posts 
Another question: When will the option for primality testing of expressions be implemented?
Ray 
20030425, 05:30  #4 
"William Garnett III"
Oct 2002
Bensalem, PA
2^{2}·3·7 Posts 
Hi Ray,
Primality is hard to prove for general numbers. For easily factorable numbers when you add or subtract one, try: http://www.primeform.net/openpfgw/ Mersenne, Proths, Riesels, and Generalized Fermat's are all factorable 100% when you add or subtract one, that's why they are easy to prove; they use Wilson's Theorm (I think). For any random odd number, the program to use is: http://www.ellipsa.net/ But it takes a long time to use Primo to prove an odd number prime; but it does allow any odd integer. Regards, william 
20030428, 10:17  #5 
Feb 2003
2^{5} Posts 
Thanks William. I'm now using version 0.4 update 4 of PrimeForm because it has an option to check an expression. Primo can only test up to 2^40960 and the numbers I am testing are over 2^300000.

20030428, 17:21  #6 
Sep 2002
Database er0rr
2·3·569 Posts 
You should use WinPFGW which is over three times faster than PrimeForm :
http://www.teamprimerib.com/pfgw/20030108_Win_Dev_Alpha_PFGW_WinPFGW.zip WinPFGW allows the use of expressions by way of an "ABC2 file"  please see the documentation. HTH 
20030501, 13:16  #7 
Feb 2003
100000_{2} Posts 
Yes. I've now switched to WinPFGW. It's really faster. Thanks.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
More CUDA Queries  EdH  Programming  10  20141127 07:38 
Website Queries  paulofaller  Information & Answers  24  20140402 16:57 
Result Queries  Factoring Limits  S485122  PrimeNet  0  20090310 07:01 
Individual Account Report queries  shu_the_genius  PrimeNet  5  20031219 18:00 
copyright, archives...housekeeping queries!  maxscribe  Lounge  1  20020818 18:07 