|
2013-01-27, 11:57
|
#23 |
Mar 2007
Germany
23·3·11 Posts |
I have started 29-30M on my Laptop.
|
|
|
|
2013-01-27, 21:09
|
#24 |
"Ed Hall"
Dec 2009
Adirondack Mtns
67278 Posts |
80-90 is on its way onto dubslow.tk, but it says it'll be about 2 hours to u/l.
Sign me up for 60-64M and I'll put that section into my machines... |
|
|
|
|
2013-01-28, 04:05
|
#25 |
|
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88
3·29·83 Posts |
I'll do 30-36M.
|
|
|
|
|
2013-01-29, 08:07
|
#26 |
May 2008
3×5×73 Posts |
I've started 36M-38M.
|
|
|
|
|
2013-01-29, 22:48
|
#27 |
Sep 2008
Kansas
7×463 Posts |
64-70M is posted.
From remdups4: Code:
Found 9275926 unique, 184506 duplicate, and 0 bad relations. |
|
|
|
|
2013-01-30, 03:04
|
#28 |
|
"Ed Hall"
Dec 2009
Adirondack Mtns
3×1,181 Posts |
60-64M on its way - about an hour left...
I'll do 58-60M now... |
|
|
|
|
2013-01-30, 18:22
|
#29 |
Oct 2006
Berlin, Germany
593 Posts |
Sorry for a sieve newbie question.
How do you sieve? Which program do you use with which parameter? How big is a result file? yoyo |
|
|
|
|
2013-01-30, 18:34
|
#30 |
Sep 2009
977 Posts |
For the larger Aliquot tasks (C150-C180), people usually use ggnfs-lasieve4I14e or ggnfs-lasieve4I15e until they have produced several GBs worth of data (more or less, depending on the size of large primes).
Also, http://gilchrist.ca/jeff/factoring/n...ers_guide.html is how we people in the TI graphing calculators community started factoring 512-bit RSA public keys before RSALS was created, so I consider it a useful resource 
|
|
|
|
|
2013-01-30, 18:53
|
#31 |
|
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88
3·29·83 Posts |
For this team sieve, you're looking at on the order of 100 MB per 1 million q sieved (give or take some constant between .5 and 3 or so, that's a very rough estimate).
If you have copies of gnfs-lasieve4I*, you would put the data in the first post of this thread into a file named whatever, then run "gnfs-lasieve4I14e -a jobfile -R -v -f <qstart> -c <qrange>". In the case of my 30M-36M reservation, <qstart> would be 30000000 and <qrange> would be 6000000. You could also split up a range over multiple cores by adjusting -f and -c individually for each core. Last fiddled with by Dubslow on 2013-01-30 at 19:01 |
|
|
|
|
2013-01-30, 19:05
|
#32 |
|
Oct 2006
Berlin, Germany
593 Posts |
I'm thinking if the team sieving can be easily done in a Boinc project. But this is what most probably is already done by NFS@home.
As I now understood: 1) msieve is used to get the poly. Is this a single msieve run or there are multiple and than somehow the best result is selected? 2) Afterwards ggnfslasieve is used to compute millions of relations How many? 3) How to combine all the sieve results? yoyo |
|
|
|
|
2013-01-30, 19:17
|
#33 | |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
242E16 Posts |
Quote:
For your 3rd question, go to the second part of Step 4 in Jeff's guide (starting with "After reaching an estimated minimum..."). The guide is mostly for a single computer projects, but for larger ones, the principle is the same. The relations are combined (note: defective relations are not a problem, so quorum of two should never be used; instead the defective relations are discarded at the filtering stage), and duplicates are optionally removed. |
|
|
|
|
 |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Team Sieve #28: c162 from 4788:2714 | jrk | Aliquot Sequences | 27 | 2011-10-25 08:51 |
| Team sieve #23: c172 from 4788:i2617 | schickel | Aliquot Sequences | 64 | 2011-02-19 02:28 |
| Team sieve #21: c162 from 4788:2602 | jrk | Aliquot Sequences | 31 | 2010-12-30 21:33 |
| Team sieve #20: c170 from 4788:2549 | schickel | Aliquot Sequences | 153 | 2010-11-09 07:39 |
| Team sieve #5: c140 from 4788:2407 | 10metreh | Aliquot Sequences | 77 | 2009-05-27 20:39 |
