mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Factoring

Reply
 
Thread Tools
Old 2010-05-28, 00:09   #12
3.14159
 
3.14159's Avatar
 
May 2010
Prime hunting commission.

110100100002 Posts
Default

Using QS:
Code:
SIQS parameters: 75469 primes, sieve limit: 153624
Multiplier: 41, factor base: 2032369
Dammit. 25-30 hours needed.
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
3.14159 is offline   Reply With Quote
Old 2010-05-28, 01:25   #13
jasonp
Tribal Bullet
 
jasonp's Avatar
 
Oct 2004

3,541 Posts
Default

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
jasonp is offline   Reply With Quote
Reply



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

All times are UTC. The time now is 00:32.


Sat Jul 17 00:32:45 UTC 2021 up 49 days, 22:20, 1 user, load averages: 0.86, 1.20, 1.37

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.