mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Factoring

Reply
 
Thread Tools
Old 2008-11-29, 11:15   #23
10metreh
 
10metreh's Avatar
 
Nov 2008

2×33×43 Posts
Default

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
VIE (very important edit): I have downloaded another version of procrels and it works! There was a bug! I will have to redo 2 1/2 hours worth of sieving, though.

Last fiddled with by 10metreh on 2008-11-29 at 11:21
10metreh is offline   Reply With Quote
Old 2008-11-29, 11:38   #24
schickel
 
schickel's Avatar
 
"Frank <^>"
Dec 2004
CDP Janesville

2·1,061 Posts
Default

Quote:
Originally Posted by 10metreh View Post
VIE (very important edit): I have downloaded another version of procrels and it works! There was a bug! I will have to redo 2 1/2 hours worth of sieving, though.
Hmmm, very likely the version you had was compiled for a different architecture. That'll usually result in that "quiet" type of crash (no error reported).
Quote:
Originally Posted by 10metreh
LatSieveTime: 8956
If you're not comfortable with 2-1/2 hours per block, you can always reduce the "qstep" value to 1/2 that or so.....

Frank
schickel is offline   Reply With Quote
Old 2008-11-29, 11:58   #25
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

133718 Posts
Default

Quote:
Originally Posted by schickel View Post
Hmmm, very likely the version you had was compiled for a different architecture.
the link i gave him for binaries was an recent svn version for p4
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
henryzz is online now   Reply With Quote
Old 2008-11-29, 12:03   #26
10metreh
 
10metreh's Avatar
 
Nov 2008

2×33×43 Posts
Default

Perhaps. The lattice siever, polyselect and makefb all worked fine.
10metreh is offline   Reply With Quote
Old 2008-11-29, 12:50   #27
ET_
Banned
 
ET_'s Avatar
 
"Luigi"
Aug 2002
Team Italia

24×7×43 Posts
Default

Quote:
Originally Posted by henryzz View Post
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
Wouldn't it be quicker using msieve QS on C100?

Luigi
ET_ is offline   Reply With Quote
Old 2008-11-29, 12:56   #28
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

10110111110012 Posts
Default

Quote:
Originally Posted by ET_ View Post
Wouldn't it be quicker using msieve QS on C100?

Luigi
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
henryzz is online now   Reply With Quote
Old 2008-11-29, 13:02   #29
ET_
Banned
 
ET_'s Avatar
 
"Luigi"
Aug 2002
Team Italia

113208 Posts
Default

Quote:
Originally Posted by henryzz View Post
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
I see what you mean...
I started my first GNFS with a C123 and now I can say that I've chosen a big candidate to start with.

Luigi
ET_ is offline   Reply With Quote
Old 2008-11-29, 13:06   #30
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

5,881 Posts
Default

Quote:
Originally Posted by ET_ View Post
I see what you mean...
I started my first GNFS with a C123 and now I can say that I've chosen a big candidate to start with.

Luigi
what hardware was that with
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
henryzz is online now   Reply With Quote
Old 2008-11-29, 13:07   #31
10metreh
 
10metreh's Avatar
 
Nov 2008

2·33·43 Posts
Default

On my PC msieve QS is SOOOO slow.
10metreh is offline   Reply With Quote
Old 2008-11-29, 13:16   #32
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

5,881 Posts
Default

Quote:
Originally Posted by 10metreh View Post
On my PC msieve QS is SOOOO slow.
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
henryzz is online now   Reply With Quote
Old 2008-11-29, 13:40   #33
jasonp
Tribal Bullet
 
jasonp's Avatar
 
Oct 2004

354310 Posts
Default

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



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

All times are UTC. The time now is 10:36.


Tue Jul 27 10:36:01 UTC 2021 up 4 days, 5:05, 0 users, load averages: 2.01, 2.00, 1.93

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.