mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Conjectures 'R Us

Reply
 
Thread Tools
Old 2014-12-20, 19:45   #23
Ken_g6
 
Ken_g6's Avatar
 
Jan 2005
Caught in a sieve

2·197 Posts
Default Invitation code

Hey, guys,

It looks like an invitation code is required to join the BOINC project. How would I go about getting one of those?

Thanks!
Ken_g6 is offline   Reply With Quote
Old 2014-12-20, 19:50   #24
KEP
Quasi Admin Thing
 
KEP's Avatar
 
May 2005

32·101 Posts
Default

Quote:
Originally Posted by Ken_g6 View Post
Hey, guys,

It looks like an invitation code is required to join the BOINC project. How would I go about getting one of those?

Thanks!
Just sent to you in a PM, as it is found on the frontpage of the BOINC site

Take care

KEP
KEP is offline   Reply With Quote
Old 2014-12-20, 20:04   #25
Lennart
 
Lennart's Avatar
 
"Lennart"
Jun 2007

46016 Posts
Default

Quote:
Originally Posted by Ken_g6 View Post
Hey, guys,

It looks like an invitation code is required to join the BOINC project. How would I go about getting one of those?

Thanks!

Look in the main page In the first section About SRbase


Lennart
Lennart is offline   Reply With Quote
Old 2014-12-28, 05:57   #26
Neo
 
Neo's Avatar
 
Dec 2010
Ava, Missouri

23·5 Posts
Default

Yeah, the instructions are not clear ...
You have to goto the website first, attempt to login, and then it will let you create an account.
That's when you use the invite code...
After that's done, then you follow the directions to add the project to your BOINC manager.

Neo
Neo is offline   Reply With Quote
Old 2015-01-02, 09:46   #27
vaughan
 
vaughan's Avatar
 
Jan 2005
Sydney, Australia

5×67 Posts
Default

Quote:
Originally Posted by gd_barnes View Post
Yes, Curtis's response is the point. It took me a little while to add your website to the exclusion (white) list on my anti-virus so that it would not block it. I barely know what I am doing and it took 2 attempts and about 15 minutes of my time. For people who don't know how anti-virus's work, you will likely lose them as potential searchers because they are unable to reach your site.
Ah that's good for us "early adopters" as it allows us to race ahead in the BOINC stats :)

Only problem I've had with this new BOINC project is that they run out of work too often. Primegrid never runs dry.

With respect to Sieving, PG also allows us to sieve using our NVidia GPUs. Dunno why Rebirther hasn't set that up for SRBase yet.
vaughan is offline   Reply With Quote
Old 2015-01-02, 15:10   #28
KEP
Quasi Admin Thing
 
KEP's Avatar
 
May 2005

32×101 Posts
Default

Quote:
Originally Posted by vaughan View Post
With respect to Sieving, PG also allows us to sieve using our NVidia GPUs. Dunno why Rebirther hasn't set that up for SRBase yet.
Well GPU is propably never gonna happen at SRBase, since the work that CRUS does is using either srsieve, sr1sieve or sr2sieve for sieving. None of these 3 programs has been ported to any GPU system. Last I heard of it, the problem is not with the applications themself, but with the required memory getting bigger than the available memory in the GPU.

KEP
KEP is offline   Reply With Quote
Old 2015-01-03, 02:37   #29
vaughan
 
vaughan's Avatar
 
Jan 2005
Sydney, Australia

5×67 Posts
Default

OK thanks for the info KEP.
It appears that SRBase is attracting some crunchers who wouldn't normally be seen on any of the non BOINC math projects. I think its good to see some activity.
vaughan is offline   Reply With Quote
Old 2015-01-03, 13:21   #30
KEP
Quasi Admin Thing
 
KEP's Avatar
 
May 2005

32·101 Posts
Default

Quote:
Originally Posted by vaughan View Post
OK thanks for the info KEP.
It appears that SRBase is attracting some crunchers who wouldn't normally be seen on any of the non BOINC math projects. I think its good to see some activity.
It is very good, because even though we are a few very dedicated crunchers at the mersenneforum, then weather we like it or not, our resources is getting stretched more and more thin, so it was about time to go BOINC if we would like to see all the started base move towards significant levels, within reasonable time. Eventually not even BOINC will be able to run out of work, because the n-range and the amount of remaining k's in a high-n level is going to be many enough to keep a sustainable flow of work at BOINC, weather or not sieving is implemented at srbase.
KEP is offline   Reply With Quote
Old 2015-01-03, 15:19   #31
vaughan
 
vaughan's Avatar
 
Jan 2005
Sydney, Australia

5·67 Posts
Default

KEP do you mean like 17 or Bust and its incredibly long running tasks?

Personally, I cannot stand such long runners and I'll switch to another project. For example, in November and December I was running a project called BOINC@Fiit and I had some tasks that ran for over 1000 hours. One completed OK but I lost the other two I was running on a different PC as I inadvertently re-booted it. The stupid project doesn't have checkpointing enabled so I lost all that CPU time (and electricity). Consequently, I'll never run that project again.
vaughan is offline   Reply With Quote
Old 2015-01-04, 11:27   #32
KEP
Quasi Admin Thing
 
KEP's Avatar
 
May 2005

32·101 Posts
Default

Quote:
Originally Posted by vaughan View Post
KEP do you mean like 17 or Bust and its incredibly long running tasks?

Personally, I cannot stand such long runners and I'll switch to another project. For example, in November and December I was running a project called BOINC@Fiit and I had some tasks that ran for over 1000 hours. One completed OK but I lost the other two I was running on a different PC as I inadvertently re-booted it. The stupid project doesn't have checkpointing enabled so I lost all that CPU time (and electricity). Consequently, I'll never run that project again.
Well eventually yes, but because CRUS is spread over 1031 bases on the Riesel and 1032 bases on the Sierpinski side (2063 bases in total), then there will for the next hundreds of years, be the possibility of offering work, where the test completes in just a few minutes.

For the bases with a low conjecture (conjectured k<=10K), it is most likely, that computation time required per test, will eventually reach the times that you currently see on SeventeenOrBust since the increase in computation speed will not be able to keep up compensating for the increase in the size of the numbers tested.

So as you can see, Rebirther has the possibility of offering plenty of small workunits, it may very well be so for the next hundreds of IRL years of using BOINC, before all 2063 bases reaches an n level where testing time will frequently be above 1 hour.

Another fact is that it may very well be several decades before all bases<=100 is tested to n=25K.

Personally I hope that Rebirther will eventually offer very long tests, since that will attract some entirely new kind of users. But who knows, what the future will hold for us
KEP is offline   Reply With Quote
Old 2015-01-04, 11:35   #33
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

3×223 Posts
Default

Quote:
Originally Posted by KEP View Post
Personally I hope that Rebirther will eventually offer very long tests, since that will attract some entirely new kind of users. But who knows, what the future will hold for us
I think it would be best to offer two or three subprojects so users can decide which runtime they prefer.
Puzzle-Peter is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Sieving for CRUS rebirther Conjectures 'R Us 580 2020-03-12 22:49
Status from CRUS-work. MisterBitcoin MisterBitcoin 10 2018-10-06 02:48
Some CRUS stats vmod Conjectures 'R Us 213 2014-02-28 21:23
What are your CRUS plans? rogue Conjectures 'R Us 35 2013-11-09 09:03
how high will CRUS go Mini-Geek Conjectures 'R Us 1 2010-11-08 20:50

All times are UTC. The time now is 21:24.

Tue Jun 2 21:24:36 UTC 2020 up 69 days, 18:57, 2 users, load averages: 1.88, 2.13, 2.13

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.