![]() |
|
|
#12 | |
|
Oct 2004
Austria
248210 Posts |
Quote:
(Feature request to either GGNFS or msieve (or both): input / output polynomials in the same format.) |
|
|
|
|
|
|
#13 | |
|
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
5,881 Posts |
Quote:
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 |
|
|
|
|
|
|
#14 |
|
Nov 2008
2×33×43 Posts |
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 |
|
|
|
|
|
#15 | |
|
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
133718 Posts |
Quote:
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) |
|
|
|
|
|
|
#16 | |
|
"Sander"
Oct 2002
52.345322,5.52471
22458 Posts |
Quote:
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! |
|
|
|
|
|
|
#17 |
|
Nov 2008
232210 Posts |
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?
|
|
|
|
|
|
#18 |
|
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
5,881 Posts |
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 |
|
|
|
|
|
#19 | |
|
"Frank <^>"
Dec 2004
CDP Janesville
2×1,061 Posts |
Quote:
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 |
|
|
|
|
|
|
#20 |
|
Nov 2008
91216 Posts |
The procrels error I mentioned in post #1 has recurred. How can I fix it?
|
|
|
|
|
|
#21 |
|
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
588110 Posts |
|
|
|
|
|
|
#22 |
|
"Frank <^>"
Dec 2004
CDP Janesville
2×1,061 Posts |
|
|
|
|
![]() |
| Thread Tools | |
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 |