mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Factoring

Reply
 
Thread Tools
Old 2008-11-28, 18:40   #12
Andi47
 
Andi47's Avatar
 
Oct 2004
Austria

2·17·73 Posts
Default

Quote:
Originally Posted by 10metreh View Post
I am not a GNFS expert. When you make a poly with msieve, it has R0 and R1 values. Which one do you use for a GGNFS "m" value? When using R0 I get a polynomial error. Same with R1.

10metreh

P.S. Henry, I think my joining has induced an increase in your posting rate. Do you agree?
The R0 and R1 are called Y0 and Y1 in GGNFS, the A0, A1, etc. are called c0, c1, etc. in GGNFS. You need not specify an "m" value for GGNFS.

(Feature request to either GGNFS or msieve (or both): input / output polynomials in the same format.)
Andi47 is offline   Reply With Quote
Old 2008-11-28, 19:01   #13
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

5,881 Posts
Default

Quote:
Originally Posted by 10metreh View Post
I am not a GNFS expert. When you make a poly with msieve, it has R0 and R1 values. Which one do you use for a GGNFS "m" value? When using R0 I get a polynomial error. Same with R1.

10metreh

P.S. Henry, I think my joining has induced an increase in your posting rate. Do you agree?
yes it has although i have posted more recently in other things as well

if you cant get the msieve polynomials to work in ggnfs dont worry the ggnfs polynomial selection isnt that rubbish
it will help much more for larger jobs
with the size we are doing convinience plays a large part in what we do
i would probably waste the time i save by using the msieve polynomial selection in converting it to the ggnfs format
henryzz is online now   Reply With Quote
Old 2008-11-28, 19:47   #14
10metreh
 
10metreh's Avatar
 
Nov 2008

232210 Posts
Default

I have converted the msieve poly and it runs 4 times faster than the best poly that polyselect has found in the same time!

I haven't tested pol51 but I will stick to msieve for the time being.

P.S. I hope closing the program will save the relations to spairs.out so I can restart - I am trying to save energy.

P.P.S. Currently I am on "total yield: 375000, q=945000" (values not exact). How high do these have to get?

Last fiddled with by 10metreh on 2008-11-28 at 19:50
10metreh is offline   Reply With Quote
Old 2008-11-28, 20:29   #15
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

588110 Posts
Default

Quote:
Originally Posted by 10metreh View Post
I have converted the msieve poly and it runs 4 times faster than the best poly that polyselect has found in the same time!

I haven't tested pol51 but I will stick to msieve for the time being.

P.S. I hope closing the program will save the relations to spairs.out so I can restart - I am trying to save energy.

P.P.S. Currently I am on "total yield: 375000, q=945000" (values not exact). How high do these have to get?
polyselect is rubbish
pol51 is much better and only a little worse than msieve although i dont think msieve is anywhere near as good as it will get

re P.S.
it wont save the relations
especially if they arent using the same polys

re P.P.S.
as a vague estimate q will get to 1.5mil for this factorization
but dont rely on it as it is as vague as my estimate the other day(which was about half my estimate)
henryzz is online now   Reply With Quote
Old 2008-11-28, 21:26   #16
smh
 
smh's Avatar
 
"Sander"
Oct 2002
52.345322,5.52471

22458 Posts
Default

Quote:
Originally Posted by 10metreh View Post
... it runs 4 times faster than the best poly that polyselect has found in the same time!
Told you!!

The only advantage of polyselect is that it can find deg. 4 poly's, but a deg5 poly from pol51/msieve will be better than a deg4 poly from polyselect.

Even running msieve's QS will be faster!
smh is offline   Reply With Quote
Old 2008-11-29, 08:25   #17
10metreh
 
10metreh's Avatar
 
Nov 2008

2·33·43 Posts
Default

The relations do get saved, but in a file called spairs.add. This suggests that there is a way of resuming work, but I have not found it yet: using factLat.pl as before starts the sieving from the beginning, and saving the spairs.add file as spairs.out is no help. How do I resume?
10metreh is offline   Reply With Quote
Old 2008-11-29, 10:22   #18
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

5,881 Posts
Default

i am just doing the linear algebra on a 100 digit gnfs for my aliquot sequence
q went up to 1.4M and that produced 3.6M relations

it will save the relations, at the 100 digit level, every 100k q values
it will also do a postprocessing run to see if you have sieved enough

Last fiddled with by henryzz on 2008-11-29 at 10:25
henryzz is online now   Reply With Quote
Old 2008-11-29, 10:42   #19
schickel
 
schickel's Avatar
 
"Frank <^>"
Dec 2004
CDP Janesville

2·1,061 Posts
Default

Quote:
Originally Posted by 10metreh View Post
The relations do get saved, but in a file called spairs.add. This suggests that there is a way of resuming work, but I have not found it yet: using factLat.pl as before starts the sieving from the beginning, and saving the spairs.add file as spairs.out is no help. How do I resume?
If you are interrupting the siever before the end of the sieve block, yes, it is supposed to resume from where it left off and add in all the relations it found before it was interrupted. I have never had it work correctly for me, so I found the easiest way is to interrupt only after a block has finished and procrels has run. If you interrupt it before procrels runs, the job file is not updated and it will start the block over again.

Probably the best way is to change the range of each block to bring the completion time to a value where you could interrupt it a little easier. What is the digit level of the job and how long does each block take? On my bigger jobs, I usually have the "qstep" set to 100000 which seems to take ~4 hours on my NFS machines. After a couple of blocks you can get a feel for what the relation yield is for each block so that you can tell approximately how far a block is along as the job progresses. On my XP machine the output doesn't scroll while a job is running, so you can tell what the start/end values are, but on my 98 machine, the progress lines scroll the screen, so the only way to tell how far along is know what the yield is for each block.

I run all my machines 24/7, so it doesn't matter how long the blocks are, anyway. (They help keep the bedroom warm this time of year, but do make it hard to keep cool during the summer.....)

Frank
schickel is offline   Reply With Quote
Old 2008-11-29, 10:49   #20
10metreh
 
10metreh's Avatar
 
Nov 2008

2×33×43 Posts
Default

The procrels error I mentioned in post #1 has recurred. How can I fix it?
10metreh is offline   Reply With Quote
Old 2008-11-29, 10:52   #21
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

5,881 Posts
Default

Quote:
Originally Posted by 10metreh View Post
The procrels error I mentioned in post #1 has recurred. How can I fix it?
could you post your ggnfs.log
henryzz is online now   Reply With Quote
Old 2008-11-29, 10:57   #22
schickel
 
schickel's Avatar
 
"Frank <^>"
Dec 2004
CDP Janesville

41128 Posts
Default

Quote:
Originally Posted by 10metreh View Post
The procrels error I mentioned in post #1 has recurred. How can I fix it?
Are you trying to run procrels manually or is it crashing under the control of the script?

Frank
schickel is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
Factoring with GGNFS VolMike Factoring 19 2007-10-22 18:12
GGNFS or something better? Zeta-Flux Factoring 1 2007-08-07 22:40
ggnfs sqrt problem hallstei Factoring 7 2007-05-01 12:51
How do you get around the |a|<2^31 problem in ggnfs? fivemack Factoring 4 2007-03-22 01:00
ggnfs ATH Factoring 3 2006-08-12 22:50

All times are UTC. The time now is 10:35.


Tue Jul 27 10:35:40 UTC 2021 up 4 days, 5:04, 0 users, load averages: 2.04, 2.00, 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.