New GGNFS problem

[henryzz]

Originally Posted by jasonp

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.

as far as i understand the rate at which you find partial relations can be different for different numbers of the same length but the number of partial relations needed in a factorization to create enough full relations is similar for to the numbers of other factorizations of the same length
in other words i think you can say that if one 88 digit needs 820k partial relations then another 88-digit factorization will need ~820k partial relations

[ET_]

Originally Posted by henryzz

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

I'm using one core on my Athlon XP2 3800, one AMD 64, one Pentium4 @2.6GHz, a T7100 dual core and an old but valid Centrino @ 1.8GHz

Luigi

[henryzz]

Originally Posted by ET_

I'm using one core on my Athlon XP2 3800, one AMD 64, one Pentium4 @2.6GHz, a T7100 dual core and an old but valid Centrino @ 1.8GHz

Luigi

thinking about it i did have a 3000+ help with some sievng
it took me several weeks to finish

[10metreh]

It turns out that there is a dll bug in matsolve. I have all my relations though. How do I convert the files so I can use msieve for the postprocessing?

[henryzz]

Originally Posted by 10metreh

It turns out that there is a dll bug in matsolve. I have all my relations though. How do I convert the files so I can use msieve for the postprocessing?

is it just wanting another dll
if so download it like you did the other one

[10metreh]

It's slightly different, but I'll try that. Anyway, how do you convert the files and use msieve?

[henryzz]

Originally Posted by 10metreh

It's slightly different, but I'll try that. Anyway, how do you convert the files and use msieve?

i dont know if you can
you can do the other way because the msieve data file is just all the spairs.out files put together with a line added at the beginning
i dont know if procrels changes the format of the files as well as sorting and spliting the files

edit:
what is the exact error message

[10metreh]

I have received a PM from bearnol with a link to a Blogspot page with info on what to do. However, it tells me to put the poly in a file called "msieve.fb". This looks like a factor base file, not a poly file. Also, what format must the poly be in?

[fivemack]

An example msieve.fb file might be

N 57935987372136483490920868637496989793253957704773020664231348177235315499760770915805111178249998523552665625493027256226450699872037675117751
A5 7216320
A4 -129583820248
A3 -803179631479086866
A2 530219673548549782703
A1 9116716972584175890041876418
A0 -171036670463698531307416446517695
R1 1618246013897711
R0 -1516793739861106227914021468

The 'R' are the 'Y' from ggnfs format poly files, the 'A' are the 'c'. No colons.

[henryzz]

Originally Posted by fivemack

An example msieve.fb file might be

N 57935987372136483490920868637496989793253957704773020664231348177235315499760770915805111178249998523552665625493027256226450699872037675117751
A5 7216320
A4 -129583820248
A3 -803179631479086866
A2 530219673548549782703
A1 9116716972584175890041876418
A0 -171036670463698531307416446517695
R1 1618246013897711
R0 -1516793739861106227914021468

The 'R' are the 'Y' from ggnfs format poly files, the 'A' are the 'c'. No colons.

i think he already has this poly in msieve format
he used msieve poly selection i think

good luck
how much memory do you have
could you post the link

[10metreh]

Sadly I've deleted the message.