![]() |
![]() |
#1 |
Quasi Admin Thing
May 2005
7×11×13 Posts |
![]()
Hi I've done a bit of thinking, and come up with this disturbing conclusion, that even though we maintain the userinterface of about 10 (currently registered users at www.twinprimesearch.org) users, it will take us an painstakenly 2 years to reach to 20G, and that is with no guarentee of ever finding a twin. So teherefor, also given the fact that there are so many various prime projects, maybe it was about time, that the various developers came together and developed a common prime searching project under BOINC, in which people can decide to support the search for serpinski primes, mersenne primes, 321 primes or twin primes or others. Maybe Rytis at the www.primegrid.com project, which looks for any prime from 2+ up to about just as much as they can store, can help the developers get started or maybe he can workout a solution from which we are allowed to work on any kind of primefinding project or just one we choose for ourself, which choose to work with such a BOINC based project. I'm sure that at least the twinprimes wan't have trouble attracting users, since they are small WU (2 minutes - 5 minutes max), and the chance of finding something is actually rather strong. Well it was just a thought, and at least it would be a chance to decrease the manual work, on the various projects, and also a chance to increase the userinterface.
Regards! KEP |
![]() |
![]() |
![]() |
#2 | |
"Michael Kwok"
Mar 2006
22318 Posts |
![]()
(slightly off topic, considering the title)
Quote:
There's no guarantee that you'll find a twin, but the chance that a specific k will be twin is actually over 5 times greater than the chance of one lottery ticket winning the jackpot (1 in ~8 million, compared with 1 in ~41 million). Back on topic, if anyone has more suggestions on BOINC, feel free to post. |
|
![]() |
![]() |
![]() |
#3 |
"Jason Goatcher"
Mar 2005
1101101100112 Posts |
![]() |
![]() |
![]() |
![]() |
#4 |
Oct 2005
Italy
3×113 Posts |
![]()
But LLR BOINC client will be fast as our current LLR client ?
|
![]() |
![]() |
![]() |
#5 |
Quasi Admin Thing
May 2005
3E916 Posts |
![]()
Hi folks,
I've just recieved a reply from Rytis, that he wouldn't mind setting up the project such as it can work in BOINCwith a perlBOINC solution for 300€. The only thing then needed, is a server strong enough to handle the BOINC demands, and hopefully increased load when going BOINC. So now the discussion might very well be, not if it is possible, but if the twinprimesearch project can organise a fundraising, to collect the money needed to get Rytis to create our beautifull project in BOINC, so can we and will we do that? I personally have no posibility of transferring any money to the project, since it would cost me more than I transfer to support this project, since I don't owe a mastercard nor a visa card :( Regards! |
![]() |
![]() |
![]() |
#6 |
Oct 2005
Fribourg, CH
3748 Posts |
![]()
Couldn't we do it ourselves?
It looks really easy, using that : http://boinc.berkeley.edu/wrapper.php [edit] I'll give it a try next week-end :) Last fiddled with by victor on 2006-11-09 at 17:42 |
![]() |
![]() |
![]() |
#7 | |
Jun 2003
22·3·5·7·13 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#8 | |
Quasi Admin Thing
May 2005
7·11·13 Posts |
![]() Quote:
And, yeah I know I'm not a very small thinker, I think big, and fast, and see BOINC as the only opprtunity to find thousands of normal primes, and find hundreds of twins, maybe it even gives us the opportunity to create a "prime ladder", in which we find the first twin prime, for any k*2^n(-/+)1, and increments the bit with 1 when we find a twin. Doing that will ensure that we keep up maintaining the number one place at the twinprime top20 list. Remember to think big and get far, rather than thinking small and get nowhere :) Regards! KEP |
|
![]() |
![]() |
![]() |
#9 |
Oct 2005
Italy
5238 Posts |
![]()
Of course turning our project in a BOINC project would be beautiful but it is not cheap. There are some problems:
1) Collect 300$: the current (simple and poor ![]() 2) I cannot upload an application on the server , but only PHP / HTML pages (maybe also JSP pages but I am not sure) which can access a database. So it would be necessary a different (and not cheap!) kind of server. BOINC requires (I presume) a server-side application and not only the web server. 3) 300$ would be the initial cost. But it would be necessary to update the site regularly ... and other $$ (and much time!) So I think that for the moment the site is the best I can offer ! ![]() (moreover I have not so much time to spend for the site ...) Anyway if somebody else have time/dollars to spend ... good luck ! |
![]() |
![]() |
![]() |
#10 |
Jun 2003
155416 Posts |
![]()
I think the relevant documentation is here: http://boinc.berkeley.edu/create_project.php
|
![]() |
![]() |
![]() |
#11 |
Oct 2005
Italy
3×113 Posts |
![]()
Hardware requirements:
"Hardware: use a host with good CPU capacity (dual Xeon or Opteron), at least 2 GB of RAM, and at least 40 GB of free disk space. Do whatever you can to make it highly reliable (UPS power supply, RAID disk configuration, hot-swappable spares, tempurature-controlled machine room, etc.). If you anticipate a high-traffic project, use a machine whose RAM capacity is 8 GB or more, and that uses 64-bit processors. " ![]() |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
BOINC | Unregistered | Information & Answers | 6 | 2010-09-21 03:31 |
BOINC.BE | BATKrikke | Teams | 2 | 2010-03-05 18:57 |
Boinc | Xentar | Sierpinski/Riesel Base 5 | 4 | 2009-04-25 10:26 |
BOINC? | masser | Sierpinski/Riesel Base 5 | 1 | 2009-02-09 01:10 |
BOINC | bebarce | Software | 3 | 2005-12-15 18:35 |