mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Aliquot Sequences

Reply
 
Thread Tools
Old 2009-06-07, 10:10   #199
Andi47
 
Andi47's Avatar
 
Oct 2004
Austria

46628 Posts
Default

Quote:
Originally Posted by mklasson View Post
Awesome! That's with an optimised 64-bit gnfs-lasieve* under linux though, right? I wonder what the optimal cutoff is for a sluggish windows system...
it's a 32-bit gnfs-lasieve* running under a sluggish windows XP system.

I have seen a benchmark over there in the msieve-1.42 beta feedback thread, saying that quartics sieve ~40% faster than quintics on a c95. This figure might be even better for a c92.
Andi47 is offline   Reply With Quote
Old 2009-06-07, 10:34   #200
mklasson
 
Feb 2004

2×3×43 Posts
Default

Quote:
Originally Posted by Andi47 View Post
it's a 32-bit gnfs-lasieve* running under a sluggish windows XP system.

I have seen a benchmark over there in the msieve-1.42 beta feedback thread, saying that quartics sieve ~40% faster than quintics on a c95. This figure might be even better for a c92.
Wow. Sounds like it's high time I tried out the new msieve.
mklasson is offline   Reply With Quote
Old 2009-06-07, 13:03   #201
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

2·33·109 Posts
Default

i will run some 64 bit gnfs-lasieve* benchmarks tomorrow
i will be comparing with 64-bit msieve instead of yafu
i will do some small ones like a c85 and maybe even c80


BTW what is the smallest nfs people think has ever been done?
henryzz is online now   Reply With Quote
Old 2009-06-07, 13:17   #202
jasonp
Tribal Bullet
 
jasonp's Avatar
 
Oct 2004

1101110101112 Posts
Default

Quote:
Originally Posted by henryzz View Post
BTW what is the smallest nfs people think has ever been done?
The first SNFS factorization was 2^128+1, back in the mid-1980s. It took about 3 hours.

Introductory NFS papers regularly use NFS to factor 11-digit numbers :)
jasonp is offline   Reply With Quote
Old 2009-06-07, 13:34   #203
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

10110111111102 Posts
Default

Quote:
Originally Posted by Andi47 View Post
I just benchmarked GNFS with a quartic against yafu on a c92: GNFS takes a total time of 01:21:20 hours, yafu takes 01:50:00 hours, so GNFS is quite a bit faster on this input size.

So for all who are already using msieve 1.42 beta, I suggest lowering the GNFS_cutoff in the aliqueit.ini file to 90 digits (BTW: If I understood correctly, 90 digits is the minimum input size where msieve will do GNFS poly selection.).


Edit: Does wget need to be in the aliqueit directory if I want to automatically upload new lines of my aliquot sequences to the database?
i presume you included poly selection time in your gnfs time

Last fiddled with by henryzz on 2009-06-07 at 13:34
henryzz is online now   Reply With Quote
Old 2009-06-07, 13:49   #204
Andi47
 
Andi47's Avatar
 
Oct 2004
Austria

46628 Posts
Default

Quote:
Originally Posted by henryzz View Post
i presume you included poly selection time in your gnfs time
Yes, I did, as I described in the msieve feedback thread linked in my previous post.

BTW: I don't think that msieve will do c85 poly selection - according to Jasonp, the lower limit for this is "slightly below 90 digits".

Nevertheless it would be interesting to benchmark some c8x's (with a "hacked" msieve, or possibly (feature request -->) a msieve 1.42 beta2 which hopefully will allow to GNFS c8x's.)
Andi47 is offline   Reply With Quote
Old 2009-06-07, 14:23   #205
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

2×33×109 Posts
Default

Quote:
Originally Posted by Andi47 View Post
Yes, I did, as I described in the msieve feedback thread linked in my previous post.

BTW: I don't think that msieve will do c85 poly selection - according to Jasonp, the lower limit for this is "slightly below 90 digits".

Nevertheless it would be interesting to benchmark some c8x's (with a "hacked" msieve, or possibly (feature request -->) a msieve 1.42 beta2 which hopefully will allow to GNFS c8x's.)
as soon i i had compiled it i did that hack and then recompiled
i virtually always do
i am currently running a c85 benchmark and had a bit of trouble because there are no good parameters for <c90 and as such the polynomial selection would have taken ages and messed up the benchmark
in the end i decided to time 2 minutes on my watch and press ctrl-c to stop the polynomial selection
it then ran for another 2 minutes and then factmsieve.pl was started by aliqueit
the only downside to that method is that it is quite possible that the polynomial would have been improved on with better parameters or more time
edit:
another possiblity to consider is:
when will gnfs-lasieve4I11e become better?

Last fiddled with by henryzz on 2009-06-07 at 14:26
henryzz is online now   Reply With Quote
Old 2009-06-07, 14:44   #206
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

2·33·109 Posts
Default

c85 64-bit asm ggnfs with msieve poly selection and postprocessing
real 25m44.344s
user 24m21.527s
sys 0m10.333s

this makes me think the 4 minutes of poly selection was too much

msieve 64-bit qs
real 17m3.005s
user 16m49.299s
sys 0m1.156s

Last fiddled with by henryzz on 2009-06-07 at 15:06
henryzz is online now   Reply With Quote
Old 2009-06-07, 15:33   #207
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

2×33×109 Posts
Default

i will test the same c85 on a 32-bit operating system tomorrow
henryzz is online now   Reply With Quote
Old 2009-06-07, 16:25   #208
Andi47
 
Andi47's Avatar
 
Oct 2004
Austria

2·17·73 Posts
Default

Quote:
Originally Posted by mklasson View Post
Either there or somewhere included in your PATH env. var. Am I the only one still actively using the PATH variable? A nice directory such as c:\utils with all sorts of useful tools in it is very handy imho.
I intended to put it into the aliqueit folder and got a "wget not found" error. Seems that aliqueit.ini needs a "wget_path=..." variable...

Edit: found that the binary and the .dll files have been dropped to a .bin folder, now it seems to work. But....

After putting the factors to the database, aliqueit doesn't do further work on the sequence. It would be nice if it did, so that it could drop new lines to the database as soon as they are found.

Last fiddled with by Andi47 on 2009-06-07 at 16:30
Andi47 is offline   Reply With Quote
Old 2009-06-07, 19:17   #209
mklasson
 
Feb 2004

2×3×43 Posts
Default

Quote:
Originally Posted by Andi47 View Post
After putting the factors to the database, aliqueit doesn't do further work on the sequence. It would be nice if it did, so that it could drop new lines to the database as soon as they are found.
Yeah, but we wouldn't want to halt the factoring progress while waiting for the connection/transfer to complete. I guess I could start wget from another thread though. My current setup is to let task scheduler run a submit on all my sequences every 6 hours, but yeah, it would be nicer to let the computing aliqueits take care of the submitting as well.
mklasson is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Resuming aliqueit johnadam74 Aliquot Sequences 4 2016-03-28 12:32
Apparent aliqueit issue with specifying factors pakaran Aliquot Sequences 2 2015-09-12 23:10
Using Several Instances of Aliqueit for a large gnfs job EdH Aliquot Sequences 6 2011-12-13 18:58
Setting up aliqueit science_man_88 Aliquot Sequences 185 2011-11-08 12:18
Tried out aliqueit.exe: ggnfs failing Greebley Aliquot Sequences 35 2010-02-13 15:23

All times are UTC. The time now is 09:56.


Fri Aug 6 09:56:20 UTC 2021 up 14 days, 4:25, 1 user, load averages: 4.17, 4.32, 4.08

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.