mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Aliquot Sequences

Reply
 
Thread Tools
Old 2013-01-27, 11:57   #23
Andi_HB
 
Andi_HB's Avatar
 
Mar 2007
Germany

4108 Posts
Default

I have started 29-30M on my Laptop.
Andi_HB is offline   Reply With Quote
Old 2013-01-27, 21:09   #24
EdH
 
EdH's Avatar
 
"Ed Hall"
Dec 2009
Adirondack Mtns

363410 Posts
Default

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...
EdH is offline   Reply With Quote
Old 2013-01-28, 04:05   #25
Dubslow
Basketry That Evening!
 
Dubslow's Avatar
 
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88

3×29×83 Posts
Default

I'll do 30-36M.
Dubslow is offline   Reply With Quote
Old 2013-01-29, 08:07   #26
jrk
 
jrk's Avatar
 
May 2008

3·5·73 Posts
Default

I've started 36M-38M.
jrk is offline   Reply With Quote
Old 2013-01-29, 22:48   #27
RichD
 
RichD's Avatar
 
Sep 2008
Kansas

63248 Posts
Default

64-70M is posted.

From remdups4:
Code:
Found 9275926 unique, 184506 duplicate, and 0 bad relations.
RichD is offline   Reply With Quote
Old 2013-01-30, 03:04   #28
EdH
 
EdH's Avatar
 
"Ed Hall"
Dec 2009
Adirondack Mtns

2·23·79 Posts
Default

60-64M on its way - about an hour left...

I'll do 58-60M now...
EdH is offline   Reply With Quote
Old 2013-01-30, 18:22   #29
yoyo
 
yoyo's Avatar
 
Oct 2006
Berlin, Germany

607 Posts
Default

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
yoyo is offline   Reply With Quote
Old 2013-01-30, 18:34   #30
debrouxl
 
debrouxl's Avatar
 
Sep 2009

977 Posts
Default

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
debrouxl is offline   Reply With Quote
Old 2013-01-30, 18:53   #31
Dubslow
Basketry That Evening!
 
Dubslow's Avatar
 
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88

1C3516 Posts
Default

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
Dubslow is offline   Reply With Quote
Old 2013-01-30, 19:05   #32
yoyo
 
yoyo's Avatar
 
Oct 2006
Berlin, Germany

607 Posts
Default

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
yoyo is offline   Reply With Quote
Old 2013-01-30, 19:17   #33
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

22·2,333 Posts
Default

Quote:
Originally Posted by debrouxl View Post
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
Jeff's guide addresses most of your questions quite thoroughly. For the 2nd question, there exist certain estimates (that the ad hoc organizer of the mini-project should know well) and then the final decision is made by running the filtering (and repeating it if necessary, after extra sieving).

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.
Batalov is offline   Reply With Quote
Reply

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

All times are UTC. The time now is 17:23.

Fri Mar 5 17:23:27 UTC 2021 up 92 days, 13:34, 1 user, load averages: 2.50, 2.02, 1.93

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.