mersenneforum.org  

Go Back   mersenneforum.org > Other Stuff > Archived Projects > PSearch

 
 
Thread Tools
Old 2003-04-10, 13:06   #1
bc
 
Mar 2003

210 Posts
Default 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
bc is offline  
Old 2003-04-11, 02:43   #2
wfgarnett3
 
wfgarnett3's Avatar
 
"William Garnett III"
Oct 2002
Bensalem, PA

5416 Posts
Default 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
wfgarnett3 is offline  
Old 2003-04-23, 13:59   #3
1260
 
Feb 2003

25 Posts
Default

Another question: When will the option for primality testing of expressions be implemented?

--Ray
1260 is offline  
Old 2003-04-25, 05:30   #4
wfgarnett3
 
wfgarnett3's Avatar
 
"William Garnett III"
Oct 2002
Bensalem, PA

22×3×7 Posts
Default

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
wfgarnett3 is offline  
Old 2003-04-28, 10:17   #5
1260
 
Feb 2003

25 Posts
Default

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.
1260 is offline  
Old 2003-04-28, 17:21   #6
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

C2116 Posts
Default

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
paulunderwood is online now  
Old 2003-05-01, 13:16   #7
1260
 
Feb 2003

2016 Posts
Default

Yes. I've now switched to WinPFGW. It's really faster. Thanks.
1260 is offline  
 

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
More CUDA Queries EdH Programming 10 2014-11-27 07:38
Website Queries paulofaller Information & Answers 24 2014-04-02 16:57
Result Queries - Factoring Limits S485122 PrimeNet 0 2009-03-10 07:01
Individual Account Report queries shu_the_genius PrimeNet 5 2003-12-19 18:00
copyright, archives...housekeeping queries! maxscribe Lounge 1 2002-08-18 18:07

All times are UTC. The time now is 18:54.

Tue Feb 25 18:54:09 UTC 2020 up 25 days, 13:26, 2 users, load averages: 3.19, 2.90, 2.74

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.