mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Sierpinski/Riesel Base 5

Reply
 
Thread Tools
Old 2006-08-29, 19:45   #1
axn
 
axn's Avatar
 
Jun 2003

11B416 Posts
Thumbs up Automated PRP using LLRNet

After around 2 weeks of testing, we have an LLRNet server ready for automated PRP testing Thnaks to ltd for setting up the server alongside PSP.

What do you need to do to participate?

1. Download the LLRNet client from http://base5.greenbank.org. The client is currently available only for Windows (EDIT:- As of 15 Oct, we have a linux build out, thanks to arminius). This is a patched version of the official LLRNet build, since we had to make some changes to allow base 5 PRP.

PS:- LLRNet only works on x86 and compatible machines.

2. Extract the zip file to a folder. Edit the llr-clientconfig.txt with your favorite text editor. Change the following lines:

Code:
-- server location
server = "www.sr5.psp-project.de"
-- Port for Riesel Server
--port =   12925
-- Port for Sierpinski Server
--port =   12920

-- username
--username = "nobody"
Uncomment the suitable "port" line to connect to either Riesel or Sierpinski queue. Uncomment the "username" line and put your user nick there.

3. Run llrnet.exe! You can open a console window using the tray icon and watch the client chugging away.
[For linux, run llrnet]

4. Watch the stats at http://www.sr5.psp-project.de/


If you need to run multiple instances of the client, just create separate folders and run from there

Since the client has been tested on only a couple of machines, you may face some hiccups. Please post any issues you face here. We'll try to work it out.

Users who are familiar with LLRNet might notice the absence of remotegui.bat. Currently, our llrnet build doesn't support the remote gui functionality. However, we do have a workaround. Please PM me if you need it.

Happy crunching!

Last fiddled with by masser on 2008-11-26 at 03:45
axn is offline   Reply With Quote
Old 2006-08-29, 20:43   #2
michaf
 
michaf's Avatar
 
Jan 2005

479 Posts
Default

Very happy here :)

Having
1) a new computer
2) a new niece
3) and now a new LLRNET :>

so far only three tiny comments:
1) could you please put somewhere on the life/live? stat pages whether I am looking at sierpinski or riesel stats?
2) could you make llrnet verbose make so that I can change the update rate, as in, I might not like the default 10k iterations...
and could you also make it output each line on the SAME line? only when a new number is processed on a NEW line? Better
yet, make it an option too :>
3) how come lowest n untested is at approx 1k for all of them? or is this to do with DC'ing?

thanks, Micha

edit: oh come on... one such numbers isn't so much work... get to 100% so I can see my stats rising :>

Last fiddled with by michaf on 2006-08-29 at 20:53
michaf is offline   Reply With Quote
Old 2006-08-29, 20:51   #3
michaf
 
michaf's Avatar
 
Jan 2005

1110111112 Posts
Default

First hiccups:

Getting double output lines: see below.
When it starts crunching again, it is fine.

If you need any parts on what I run, please ask what you need


59912*5^100537+1, bit: 200000 / 233456 [85.66%]. Time per bit: 2.955 ms.
59912*5^100537+1, bit: 210000 / 233456 [89.95%]. Time per bit: 2.970 ms.
59912*5^100537+1, bit: 220000 / 233456 [94.23%]. Time per bit: 2.979 ms.
59912*5^100537+1, bit: 230000 / 233456 [98.51%]. Time per bit: 2.981 ms.
59912*5^100537+1 is not prime. RES64: 851E5DA62D683713 Time: 561.030 sec.
59912*5^100537+1 is not prime. RES64: 851E5DA62D683713 Time: 561.030 sec.
Successfully connected to server!
LOGGED ON
[08/29/06 22:49:15]
Result 59912/100537 succesfully sent to the server.
Result 59912/100537 succesfully sent to the server.

LOGGING OUT
Working on : 26798/100539 (1000000000:P:0:5:257)
LLR tests only k*2^n▒1 numbers, so, we will do a PRP test of 26798*5^100539+1
LLR tests only k*2^n▒1 numbers, so, we will do a PRP test of 26798*5^100539+1
Starting probable prime test of 26798*5^100539+1
Starting probable prime test of 26798*5^100539+1
Using generic reduction FFT length 24K

Using generic reduction FFT length 24K

26798*5^100539+1, bit: 10000 / 233460 [4.28%]. Time per bit: 3.022 ms.
michaf is offline   Reply With Quote
Old 2006-08-29, 22:19   #4
axn
 
axn's Avatar
 
Jun 2003

22·11·103 Posts
Default

Quote:
Originally Posted by michaf View Post
1) could you please put somewhere on the life/live? stat pages whether I am looking at sierpinski or riesel stats?
I'll pass this on to ltd.

Quote:
Originally Posted by michaf View Post
2) could you make llrnet verbose make so that I can change the update rate, as in, I might not like the default 10k iterations...
Ummm.. Not sure what you mean. If you want to see output at higher frequency, just exit LLRNet, edit llr.ini and change OutputIterations?

Quote:
Originally Posted by michaf View Post
and could you also make it output each line on the SAME line? only when a new number is processed on a NEW line? Better
yet, make it an option too :>
Interesting. I used to have his problem (multiple lines and double lines), but since a new client_server.lua, this has not been there. Does stopping and restarting LLRNet help?

Quote:
Originally Posted by michaf View Post
3) how come lowest n untested is at approx 1k for all of them? or is this to do with DC'ing?
That shows the lowest n without a PRP residue. Since the testing started at 100000 for most k's, and our initial testing covered n < 1000, you see the first n higher than 1000 as the lowest untested k. No worries. We'll sort it out soon enough

Quote:
Originally Posted by michaf View Post
oh come on... one such numbers isn't so much work... get to 100% so I can see my stats rising :>
axn is offline   Reply With Quote
Old 2006-08-29, 22:38   #5
ltd
 
ltd's Avatar
 
Apr 2003

22·193 Posts
Default

I will modify the stats pages sometime today to make it more clear if you are looking at riesel or sierpinski.

Lars
ltd is offline   Reply With Quote
Old 2006-08-29, 23:12   #6
Citrix
 
Citrix's Avatar
 
Jun 2003

3·503 Posts
Default

In the stats could you post number of k's left.
Thanks.
Citrix is offline   Reply With Quote
Old 2006-08-30, 10:50   #7
michaf
 
michaf's Avatar
 
Jan 2005

479 Posts
Default

Quote:
Originally Posted by axn1 View Post
I'll pass this on to ltd.


Ummm.. Not sure what you mean. If you want to see output at higher frequency, just exit LLRNet, edit llr.ini and change OutputIterations?
Erm... yep, thats the way to go :)

Quote:
Originally Posted by axn1 View Post
Interesting. I used to have his problem (multiple lines and double lines), but since a new client_server.lua, this has not been there. Does stopping and restarting LLRNet help?
No doesn't help

Quote:
Originally Posted by axn1 View Post
That shows the lowest n without a PRP residue. Since the testing started at 100000 for most k's, and our initial testing covered n < 1000, you see the first n higher than 1000 as the lowest untested k. No worries. We'll sort it out soon enough
Ooooh... I'd love to see some quick results :) at n=1000 one prp shouldn't take too long :)
michaf is offline   Reply With Quote
Old 2006-08-30, 13:53   #8
michaf
 
michaf's Avatar
 
Jan 2005

7378 Posts
Default

Is it so that, for all k/n pairs we don't have any residues on, we still will want to do them twice?

If not, I think it should be wise to do so.
If so, I think it should be wise to make certain two were done by different computers
michaf is offline   Reply With Quote
Old 2006-08-30, 19:19   #9
axn
 
axn's Avatar
 
Jun 2003

22×11×103 Posts
Default

Quote:
Originally Posted by michaf View Post
No doesn't help
Bummer!

Quote:
Originally Posted by michaf View Post
Ooooh... I'd love to see some quick results :) at n=1000 one prp shouldn't take too long :)
Yeah, at that size you spent more time talking to the server than crunching

Quote:
Originally Posted by michaf View Post
Is it so that, for all k/n pairs we don't have any residues on, we still will want to do them twice?

If not, I think it should be wise to do so.
If so, I think it should be wise to make certain two were done by different computers
Yes, eventually we'll be doublecheching everything. But like SOB, we'll not actively focus on doublecheck until we have some major progress for first time test.
axn is offline   Reply With Quote
Old 2006-08-30, 19:30   #10
ltd
 
ltd's Avatar
 
Apr 2003

14048 Posts
Default

I would suggest that we start to recover residues for all k/n pairs <50000 where we have no information within the database very soon. Lets say when sieving reached 1T for example. Axn1 found lots of missed primes on the riesel side.

We can do this any time we want as it only means one update within the database and one adjustement for the scripts to build a queue large enough.

Lars
ltd is offline   Reply With Quote
Old 2006-08-31, 03:36   #11
geoff
 
geoff's Avatar
 
Mar 2003
New Zealand

13×89 Posts
Default

I access the internet from a public computer where I have no ability to change the Windows configuration. Is there any way I can run LLRnet? The console says:
Code:
LLRnet current status :
Sleeping ...
LLR network client 0.9b7 started
Based on LLR version 3.5.0
Loading library 'win32' ...
winloop thread
LLRMain started
server dialog thread started ...
unknown host www.sr5.psp-project.de
unknown host www.sr5.psp-project.de
geoff is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
LLRnet and PRPnet servers for automated LLR mdettweiler Twin Prime Search 229 2020-03-29 06:53
Automated LLR testing with LLRnet mdettweiler No Prime Left Behind 24 2011-11-04 19:20
Automated primality testing with LLRnet mdettweiler Conjectures 'R Us 18 2008-03-04 00:06
Automated PRP discussions ltd Sierpinski/Riesel Base 5 20 2006-09-02 22:19
Automated P-1 thoughts. nucleon Marin's Mersenne-aries 3 2004-03-25 02:45

All times are UTC. The time now is 01:34.

Mon Mar 30 01:34:40 UTC 2020 up 4 days, 23:07, 2 users, load averages: 1.43, 1.53, 1.46

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.