![]() |
|
View Poll Results: Do we need a thread for Prime data collecting? | |||
Yes |
![]() ![]() ![]() ![]() |
12 | 100.00% |
No |
![]() ![]() ![]() ![]() |
0 | 0% |
What ever. |
![]() ![]() ![]() ![]() |
0 | 0% |
Voters: 12. You may not vote on this poll |
![]() |
|
Thread Tools |
![]() |
#1 |
Mar 2006
Germany
57308 Posts |
![]()
I think it's time to manage not only the search for primes (whatever form but mostly Sierpinski (k*2^n+1) and Riesel (k*2^n-1)) but also the results from these searches.
About 1 1/2 years ago a begun to collect all avalable data about Riesel-numbers/-primes. The results you can see at www.rieselprime.org with many new features and data shown there on one website. There're many data missing or to be collect (i update these pages almost every day) and i think many people not involved in any project got their results without any publication. So please tell me what do you think. Vote for such thread neded or not. Perhaps there are other opinions or suggestions for creating such data collection. And perhaps there's someone to collect such data about the Sierpinski side. Thanks K.Bonath PS: Tell me your opinion, if we need such data collecting should it be an own Foum or Subforum and where to locate it. Last fiddled with by kar_bon on 2008-10-21 at 10:50 |
![]() |
![]() |
![]() |
#2 |
A Sunny Moo
Aug 2007
USA
23·33·29 Posts |
![]()
Yes, I agree that this would be a good idea. However, if we want to ensure that we get data from the widest possible range of sources (including users not associated with any particular project, as you mentioned), I think we need to arrange some sort of partnership with the top-5000 website on this--maybe they could have their system set up so that whenever someone reports a Riesel prime, on the "prime successfully reported" page it also gives a prominent link to our new data collection thread, saying "don't forget to report your progress!" or something like that?
|
![]() |
![]() |
![]() |
#3 |
I quite division it
"Chris"
Feb 2005
England
40358 Posts |
![]()
Yes, a good idea. For instance, I've started testing 28 different ks but wasn't sure where to report this. Ok, I'll report it here!
I'm testing k*2^n-1 from n=350,000 upwards for the following ks: 1401, 1403, 1407, 1413, 1419, 1431, 1433, 1435, 1437, 1441, 1445, 1449, 1459, 1467, 1473, 1479, 1483, 1487, 1489, 1491, 1493, 1495, 1497 (Only tested to 351,387.) 3087, 3969, 4851, 5733, 6615 (Tested to 365,300.) |
![]() |
![]() |
![]() |
#4 |
(loop (#_fork))
Feb 2006
Cambridge, England
2×7×461 Posts |
![]()
I would go further than saying that results are needed; it's actually worth recording residues. This lets you do independent double-checks with a much higher precision than 'look, they found no prime in 100k..150k and neither did we'. At sixteen characters per core-devoted per half-hour it's not an unreasonable amount to store.
But this is a job for a database with a Web front-end rather than a thread on a forum. |
![]() |
![]() |
![]() |
#5 | |
(loop (#_fork))
Feb 2006
Cambridge, England
2·7·461 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#6 | |
A Sunny Moo
Aug 2007
USA
23·33·29 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#7 |
Aug 2002
23·29·37 Posts |
![]()
We can set up a database if someone wants to take it and run with it. We can also provide web space.
How big would the database be? (Obviously it would grow over time, but say a year or 2 from now, how big could it grow to?) |
![]() |
![]() |
![]() |
#8 |
Oct 2006
7×37 Posts |
![]()
gimps use this kind of database ... with track of all factors, residues, single and double check.
rieselsieve.com has an automatic factor entry form in fact, we need a complete automation of all process - reserving ranges to factor/to LLR - entering factors in the database - entering residues in the database - removing "completed ranges" from the active database - checking single and double check (comparing them) - answering llrnet request (by increasing values of kbn, like rieselsieve has done with his boinc part) - exporting manual range to test - ... each kbn triplet has to go through test (factoring, first test, second test and maybe third test if test 1 and test 2 are different ...) the database would be huge, the server cost to manage it out of range and the managing of it horrible ... but it would be the best case :D Last fiddled with by tnerual on 2008-10-21 at 18:01 |
![]() |
![]() |
![]() |
#9 | |
(loop (#_fork))
Feb 2006
Cambridge, England
2×7×461 Posts |
![]() Quote:
* which k are interesting? * do you bother storing (k,n) pairs with factors <2^32 at all? Even storing a simple list of them would be huge. * how large does n have to be to be non-trivial? If you only store (k,n) pairs for which the LLR calculation took half an hour or more, I suspect there are have been less than five thousand core-years, or forty million half-hours, applied to the problems, so the database would fit in a couple of gigabytes and grow no more than a gigabyte a year. |
|
![]() |
![]() |
![]() |
#10 | |||||
Mar 2006
Germany
303210 Posts |
![]()
wow! thanls to all for your suggestions. i did not expect so much response!!!
Quote:
i'm checking every day the new primes reported to Top5000 and will include them in the database if they fit, so for now only k*2^n-1 primes. Quote:
Quote:
but there are some things i can't satisfy: my php-knowledge is minimal, SQL no problem, database creation too, time .... the thing i got not so much i want. i'm playing with PHP/SQL but without much success. and time.... the next great change for the RieselPrimeDatabase will be such thing. i hope :-) Quote:
some ideas in mind but not the time to realise. Quote:
but the managing of such a big database is very time consuming, although it runs mostly per scripts for sending/receiving results... so only for one day of this poll i think to speak for all, it's a good idea to make an own forum for such purposes here. need to be cleared where to put such forum!? Last fiddled with by kar_bon on 2008-10-22 at 08:14 |
|||||
![]() |
![]() |
![]() |
#11 |
"Gary"
May 2007
Overland Park, KS
2×19×317 Posts |
![]()
I have an unbelievable amount of results files from here and CRUS.
The reason why I haven't voted yet is I'm more in the 'whatever' category. lol Not that I'm apathetic to the idea. It's just that it's such a huge administrative effort to run 2 projects and I feel like this would add more to that. What we need to get me on board more with the idea would be to have people step up and run with it. I'll be glad to forward what I have if someone will do it. All of this said, I think such an effort is badly needed, especially at RPS, where results are rarely collected on individual reservations, ranges are almost never reported to Wilfred Keller's web page, and individual-reservation search ranges are hidden unless you are one of their 'inside' people. (lol) We attempt to and have been about 98-99% successful collecting all the results here. It's just a matter of what to do with them. I keep a backup of them but if I keel over, I think Max and Karsten would only have perhaps half of them. For that reason, I probably need to forward you guys what I have if I can dig it all up. Gary |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
'All Your Data ❝Я❞ Belong To Us' Thread | ewmayer | Tales From the Crypt(o) | 304 | 2022-09-26 14:16 |
Your opinions on "x times less" and other errors | Jayder | Miscellaneous Math | 12 | 2014-10-26 14:41 |
Opinions wanted on direction of drive 3 | gd_barnes | No Prime Left Behind | 26 | 2008-03-07 05:40 |
Opinions on team drive #3 | gd_barnes | Conjectures 'R Us | 8 | 2008-01-24 01:01 |
Collection of Proofs? | Orgasmic Troll | Math | 1 | 2004-12-30 15:10 |