![]() |
|
|
#551 | |
|
Sep 2004
2×5×283 Posts |
Quote:
I can't find that code on factmsieve.py. I found this: Code:
# static global variables PNUM = 0 LARGEP = 3 LARGEPRIMES = '-' + str(LARGEP) + 'p' nonPrefDegAdjust = 12 polySelTimeMultiplier = 1.0 Code:
# This is for an Athlon 2800+ laptop. If your machine is about half as fast, # replace this with a 2. 25% as fast, replace with a 4. It controls how long # the polynomial selection phase will last. $polySelTimeMultiplier=1.0; |
|
|
|
|
|
|
#552 |
|
Tribal Bullet
Oct 2004
3·1,181 Posts |
Sorry, I should have mentioned that the code I posted is from the msieve source.
Without a script providing guidance, the time limit msieve uses is for an entire poly selection job; it will stop when the time has elapsed, or the range given runs out, whichever comes first. If you run with -np then the time limit is for stage 1 and stage2 together, otherwise it is for stage 1 only (stage 2 cannot be interrupted currently). This means you'd get higher throughput if you ran with two copies of 'msieve -np' on two separate cores, since your pipeline is idle for most of the time waiting on a stage 1 hit to begin stage 2. For a large input you can even run them on the same input range, msieve will randomize the portions of the space that are searched so that overlap is unlikely. Make sure to specify a different argument for the -l, -s and -nf options for each run, to avoid files getting overwritten... |
|
|
|
|
|
#553 |
|
Sep 2009
208610 Posts |
How would I combine the output from several -np runs to find the best poly? If possible I want to do it from a script.
I've halted polynomial selection for the c145 I'm working on. 2 days is probably long enough for a number that'll take about 8 days for sieving and linear algebra etc. Chris K |
|
|
|
|
|
#554 |
|
Tribal Bullet
Oct 2004
354310 Posts |
If you have unix tools available, try 'grep norm *.p | sort -gk7 | tail -20' to get the 20 highest E-values. Then you have to find the file with a given E-value, and the polynomial that provides that E-value is below the 'norm' line.
|
|
|
|
|
|
#555 |
|
Sep 2004
2×5×283 Posts |
Another question I don't know if already asked in this thread.
About "Beginners Guide to NFS factoring using GGNFS and MSIEVE" from Jeff's page I was wondering if more than one number can be added to example.n to be factored, like yafu batch of work option. |
|
|
|
|
|
#556 |
|
May 2008
Worcester, United Kingdom
22×7×19 Posts |
No, its strictly one number I'm afraid.
|
|
|
|
|
|
#557 |
|
"Sander"
Oct 2002
52.345322,5.52471
22458 Posts |
Would it be possible to add that to the script?
|
|
|
|
|
|
#558 |
|
May 2008
Worcester, United Kingdom
21416 Posts |
|
|
|
|
|
|
#559 |
|
117F16 Posts |
For a C150, under the script, lattice sieving was started with gnfs-lasieve4I13e instead of gnfs-lasieve4I14e, why? The issue is that too few per special-q are being found and the script is in loop. Minimum relations needed estimated was 1.53361e+07 but for this size of number it needs at least 3 times more. What am I doing wrong?
|
|
|
|
#560 | |
|
May 2008
Worcester, United Kingdom
21416 Posts |
Quote:
|
|
|
|
|
|
|
#561 |
|
Sep 2004
2×5×283 Posts |
For type:SNFS (on example.poly) how do I change the estimated minimum relations in function of the composite size? I want to increase the default settings.
Last fiddled with by em99010pepe on 2011-04-13 at 19:14 |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Msieve & ggnfs on MacOS | xilman | Msieve | 8 | 2017-05-20 00:12 |
| Factorizing with MSIEVE, GGNFS & Factmsieve.py | Romuald | Msieve | 24 | 2015-11-09 20:16 |
| Infinite loop for ggnfs or msieve | Greebley | Aliquot Sequences | 4 | 2013-02-06 19:28 |
| Error running GGNFS+msieve+factmsieve.py | D. B. Staple | Factoring | 6 | 2011-06-12 22:23 |
| A new driver? (or type of driver?) | 10metreh | Aliquot Sequences | 3 | 2010-02-15 15:57 |