![]() |
|
|
#12 |
|
May 2010
Prime hunting commission.
110100100002 Posts |
Using QS:
Code:
SIQS parameters: 75469 primes, sieve limit: 153624 Multiplier: 41, factor base: 2032369 Maybe if I mess with the number of CPUs.. Hmm.. went to 14 hours, just slowly climbed upwards 20 hours anyway. Last fiddled with by 3.14159 on 2010-05-28 at 00:14 |
|
|
|
|
|
#13 |
|
Tribal Bullet
Oct 2004
3,541 Posts |
Once you know what you're doing, GGNFS+msieve will finish a number of that size in about an hour. Comparing the best available QS against the public state of the art in GGNFS makes the crossover point between the two algorithms around 90 digits.
PS: consider adding quote tags to portions of your posts that quote others (or the 'quote' button on the relevant post), it makes everyone's posts more legible Last fiddled with by jasonp on 2010-05-28 at 01:30 |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Manual Testing LL result syntax (where to find documentation) | preda | GPU Computing | 15 | 2017-04-17 15:02 |
| C++ template function syntax issues | ewmayer | Programming | 4 | 2013-04-13 17:45 |
| GGNFS & 512 BIT i can puke. | silentfrog | Factoring | 1 | 2009-09-10 08:57 |
| GGNFS or something better? | Zeta-Flux | Factoring | 1 | 2007-08-07 22:40 |
| ggnfs | ATH | Factoring | 3 | 2006-08-12 22:50 |