mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Factoring

Reply
 
Thread Tools
Old 2013-04-17, 00:27   #1
kosta
 
Jan 2013

23×7 Posts
Default What Murphy score to expect or need [cado-nfs]

What Murphy score can I expect for a 181 digit composite? So far Cado reports going over 26% of the region it wants to search and I got one with 1.17*10E-14
It is by the way 40% better than most other found so far. Is this likely to be good enough?

I now realize I bit off a little bit more than i can easily chew. I was fooled after observing that record factorizations were much much bigger, and when Dubslow factored a number I wanted of more than 212 digits in 10 days. I've been running polyselect already for more than a week on an 8core machine of 2008 vintage. :-(

K
kosta is offline   Reply With Quote
Old 2013-04-17, 00:40   #2
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

2·33·132 Posts
Default

You would need ~2000 CPU-days to sieve this project, are you sure that you are ready for this? (it is roughly equivalent to a SNFS-270-digit project)

If CADO calcluated E-value is not very different from msieve's, then you should expect a much higher E, possibly 9e-14 ... 1e-13.
Batalov is offline   Reply With Quote
Old 2013-04-17, 15:02   #3
kosta
 
Jan 2013

23·7 Posts
Default

Thanks, Sergei, actually i made a mistake caused by frustration. This is a 191 digit number actually, so it would take even longer than that. But it is a factor of M61^16+1 which is 294 digits. (a few factors of 103 digits in total already have been taken off by ECM). Because this was much more than the remaining composite number I thought the SNFS form of it would be useless. But thanks for pointing out that the SNFS equivalent difficulty is about the same.

Could you confirm for me that I should go for SNFS which comes from the 294 digit parent vs GNFS with 191 digits. Does it matter that 294 > 280 ?

If I get totally frustrated at some point I may ask people to help sieving, but for now I will put effort to make sure I undertsand what I'm doing, and also try obtain some cpu's.

Last fiddled with by kosta on 2013-04-17 at 15:03
kosta is offline   Reply With Quote
Old 2013-04-17, 17:30   #4
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

2·33·132 Posts
Default

191-digit GNFS is better than the 294-digit SNFS. It's a GNFS job.

You would expect a poly with E ~= 2e-14 for this input. Sieving would take ~6000 CPU days and the matrix would be quite hard to finish on a home-computer (rough guess is that less than 16Gb won't work).

This would be a project of the distributed type.
Batalov is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
What to expect from GTX1080 for ECM? fivemack GPU Computing 10 2016-05-11 09:07
Murphy's Law and other tools Uncwilly Lounge 5 2014-07-07 22:36
Bug in top5000's score page? MooooMoo No Prime Left Behind 3 2009-06-10 11:51
Murphy's law in full effect against me JuanTutors Lounge 3 2007-06-15 16:42
primes to expect per k? roger Riesel Prime Search 4 2007-04-29 04:29

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

Wed Sep 23 00:39:27 UTC 2020 up 12 days, 21:50, 1 user, load averages: 1.95, 1.90, 1.86

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.