20120619, 22:39  #1 
Jun 2012
2·53 Posts 
ECPP  Scoring, or other primality tests (PFGW?)
I am thinking of running Primo to get some certification work done for factorDB  the thing that is enticing me is the scoreboards based on the score ((n/1000)^4) where n is the number of digits. I am wondering  what kind of digit size would be the optimum for scoring the highest?
I have created an excel document with prefilled formulae and some data collected from the ECPP website, however I am missing a lot of data. So, if someone could either fill in the data or give me a straight answer I would appreciate it. (BTW: I am not lazy with the working of those sorts of numbers, I just simply don't have the time or money to run for days on end as an experiment). If this may be too tedious for some, or you don't see my view on this (read the BTW) could you suggest another method (nonfactorization, mind you) that I could contribute to the DB? (IE: Primality testing, but how would I go about doing it and submitting the results?) The only way that I can think of for primality testing is PFGW or LLR, but how can I produce something like a certificate? Whenever I try and produce a certificate, the option is grayed out in the GUI. Does this mean I have to use the command line, or am I just plain missing something? Last fiddled with by f1pokerspeed on 20120619 at 22:46 
20120620, 11:54  #2  
"Frank <^>"
Dec 2004
CDP Janesville
2×1,061 Posts 
Quote:
Quote:
Quote:
Quote:
If you figure that (S/G)NFS is too much, you can also run some ECM on some of the larger composites. a client/server setup would allow you to load more than one composite at a time with the added advantage of promoting compsoites as/when something cracks. Quote:


20120620, 15:21  #3  
"William"
May 2003
New Haven
3·787 Posts 
Quote:
let p, q, s, a, and b be primes with b= 1 mod a q = (p^b1)/(b1) s = ((q^a1)/(q1))/((p^a+1)/(p+1)) Then s1 has a factor of (p^b1)/(p1)+p. With a little luck, this may factor s1 sufficiently to complete the N1 proof. For example, for a=7 b=13 p=206081 q is this 64 digit prime s is this 351 digit prime supplying the algebraic factor of s1 was enough to get it fully factored, allowing the primality proof. I have about 90 of these with s ranging from 304 to 692 digits. I'll be glad to make the list available to you or anybody else that wants to do this. If nobody else is interested, I'll do it myself sometime in next week. William 

20120620, 16:25  #4  
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
2·3·13·137 Posts 
Quote:
What do you actually want a prospective contributor to do? Find a currently unknown factor of a list of 90 values for composite 's' or something else? Paul Last fiddled with by xilman on 20120620 at 16:25 

20120620, 16:38  #5  
Jun 2012
2×53 Posts 
Quote:


20120620, 16:43  #6 
"William"
May 2003
New Haven
3×787 Posts 
It's a trivial activity. Most of the time is actually spent clicking the buttons to kick off a primality test. I'll confess that I get a lot of fun out of seeing those primality proofs come together, and I may not be the only one.
But you're right that it is trivial. I wouldn't have even mentioned it except that f1pokerspeed was looking for something to do with the factordb that didn't involve factoring, and I happened to be finishing up the process of gathering the currently interesting examples of this. William 
20120620, 16:58  #7  
"William"
May 2003
New Haven
3·787 Posts 
Quote:
"s1 = (p^b1)/(p1)+p" as text strings from p,a,b, then submit them to the Report Factors page. The build another set of strings of the form "s=1" and do it again. The second set will get the primes into the factordb and will return a page with a link to each of them. Then I'll step through s values, clicking on "open in new tab," "Primality," "Proof" or "N1." Displaying N1 might find a few more more factors, allowing "Proof" the next time. A slightly less trivial project would be to see if minor ECM will complete proofs that are not automatic. An hour or so should exhaust all the automatic possibilities. ECM until bored. 

20120620, 17:48  #8 
Jun 2012
1101010_{2} Posts 
So, would it be possible to just create some ECM work and distribute some of it then?
I could take some of the workload as I have some spare time. 
20120620, 18:03  #9  
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
2·3·13·137 Posts 
Quote:
if/when you and your coworkers get your act together, please send me a list of composites and an estimate of how much ECM work has been done. I'll see what can be found. 

20120620, 21:02  #10  
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 89<O<88
3×29×83 Posts 
Quote:
PS Little brain indeed Last fiddled with by Dubslow on 20120620 at 21:11 

20120622, 01:39  #11  
"Frank <^>"
Dec 2004
CDP Janesville
2122_{10} Posts 
Quote:
You can even set it up on one computer. The client in this case would just use the localhost connection to talk to the server, but this setup would allow multiple composites to be loaded into the server to allow for numbers to be ready on standby should something factor. I set mine up on my home network to allow me to use all my local machines to do ECM work when I don't have them doing something else. To get started with this kind of thing, go to rogue's site and download one of the ECMNet packages. (v3.0.2 will require the installation of a DB backend to work, but the earlier version will not.) After setup, just get some composites of a suitable size and load them into the server and start it up. The "best" initial size would be impossible to guess, since the amount of ECM already done would be unknown, except for numbers from the more wellknown projects, but certainly 200300 digits would be a good starting point until you know how fast/many curves you can run (smaller would work also, but anything below ~140 or so would probably be better attacked with NFS). I can help getting the earlier version up and running, since that's what I'm using, and I'm sure there are others here that could assist you with v3. 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
nonMersenne primality tests  Visar  Information & Answers  33  20151201 18:27 
What are the Primality Tests ( not factoring! ) for Fermat Numbers?  Erasmus  Math  46  20140808 20:05 
Fastest Primality Tests  flouran  Miscellaneous Math  174  20100715 00:02 
Primalitytesting program with multiple types of moduli (PFGWrelated)  Unregistered  Information & Answers  4  20061004 22:38 
Two Primality tests for Fermat numbers  T.Rex  Math  2  20040911 07:26 