![]() |
|
|
#23 |
|
Nov 2008
2×33×43 Posts |
I've tried both ways and it crashed both times. Perhaps there is a bug in the code?
Here is all in my log that is relevant (I started this last night, but it did not want to resume this morning): Code:
[11/28 18:48:44] GGNFS-0.77.1-20060722-pentium4 : makefb [11/28 18:48:50] name: [11/28 18:48:50] n=1230055008086286534595627201713118974133964495903086531402839064679655229427876182135719467916304601 (100 digits) [11/28 18:48:50] c0: 4404605767354605876157364 [11/28 18:48:50] c1: -1198874897864449346549 [11/28 18:48:50] c2: 36988141245696361 [11/28 18:48:50] c3: 7321780823831 [11/28 18:48:50] c4: -140496168 [11/28 18:48:50] c5: 1260 [11/28 18:48:50] RFBsize: 135072 (upto 1799999) [11/28 18:48:50] AFBsize: 134534 (upto 1799999) [11/28 18:48:50] maxNumLargeRatPrimes: 3 [11/28 18:48:50] maxLargeRatPrime: 67108864 [11/28 18:48:50] maxNumLargeAlgPrimes: 3 [11/28 18:48:50] maxLargeAlgPrime: 67108864 -> minimum number of FF's: 302030 -> minimum number of FF's: 302030 -> minimum number of FF's: 302030 LatSieveTime: 8956 [11/29 10:49:05] GGNFS-0.77.1-20060722-pentium4 : procrels -> minimum number of FF's: 302030 Last fiddled with by 10metreh on 2008-11-29 at 11:21 |
|
|
|
|
|
#24 | ||
|
"Frank <^>"
Dec 2004
CDP Janesville
41128 Posts |
Quote:
Quote:
Frank |
||
|
|
|
|
|
#25 | |
|
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
5,881 Posts |
Quote:
he had said previously that he was running on a 1.7 Ghz p4 i have been using the exact same svn version complied for core 2 maybe that p4 build was compiled for prescott and his isnt a prescott????? @10metreh it seems like you pc does siieving at 1/5th of the speed of my pc Last fiddled with by henryzz on 2008-11-29 at 12:01 |
|
|
|
|
|
|
#26 |
|
Nov 2008
91216 Posts |
Perhaps. The lattice siever, polyselect
and makefb all worked fine.
|
|
|
|
|
|
#27 | |
|
Banned
"Luigi"
Aug 2002
Team Italia
24·7·43 Posts |
Quote:
Luigi |
|
|
|
|
|
|
#28 |
|
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
5,881 Posts |
maybe he has never completed a gnfs before so it is worth him starting small
also as the difference isnt much you could use something like RDS's arguments and say what can you learn from QS there is a lot more to learn from doing a gnfs factorization that a QS |
|
|
|
|
|
#29 | |
|
Banned
"Luigi"
Aug 2002
Team Italia
481610 Posts |
Quote:
I started my first GNFS with a C123 and now I can say that I've chosen a big candidate to start with. ![]() Luigi |
|
|
|
|
|
|
#30 | |
|
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
5,881 Posts |
Quote:
my current record is C121 although that was with my old 3800+ i could do lots better with my newish Q6600 but i am waiting for the new version of ggnfs before i break that record |
|
|
|
|
|
|
#31 |
|
Nov 2008
2·33·43 Posts |
On my PC msieve QS is SOOOO slow.
|
|
|
|
|
|
#32 |
|
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
5,881 Posts |
QS seems slow to start off with but seems to speed up
the amount a QS factorization is done seems to me to be based on how many partial rels need to be found unfortunately that number is different for different length numbers just recently i have looked in my msieve.log for how many partial rels were needed for other factoizations and have been able to make a good guess at how many partial rels are needed for a specific factorization can someone more knowledgable than me confirm that the rate of producing partial rels with msieve is linear throughout a factorization |
|
|
|
|
|
#33 |
|
Tribal Bullet
Oct 2004
3×1,181 Posts |
Yes, partial relations are expected to accumulate at an approximately linear rate, but you do not know in advance what that rate will be with great accuracy, or how many partial relations will be 'enough'. There is code to determine when 'enough' has accumulated, so that you will not sieve more than you have to, but it's tricky to find out how long it will take to get there.
What matters with QS is not the number of partial relations collected but how many cycles (full relations) they form. Cycles initially form incredibly slowly but the rate accelerates as sieving progresses. At the 100-digit level I think you need about 1.5-2 million relations, and on a modern PC it takes 11-12 hours. Individual numbers can be better or worse than that, sometimes by a significant factor. If waiting 12 hours for a factor sounds like too much to bear, that's a different problem. |
|
|
|
![]() |
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 |