![]() |
|
|
#1563 | |
|
Oct 2006
Berlin, Germany
26F16 Posts |
Quote:
http://www.rechenkraft.net/yoyo/y_status_ecm.php There are more curves needed? yoyo |
|
|
|
|
|
|
#1564 |
|
Sep 2009
11110100012 Posts |
Nope, the t55 you ran on yoyo@home has raised the bar significantly above the usual level for a C156
![]() GPU-based ECM stage 1 is slowly making the "2/7 of GNFS difficulty, 2/9 of SNFS difficulty" rules of thumb for ECM work obsolete, but you're not using that (yet) on yoyo@home. |
|
|
|
|
|
#1565 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
9,497 Posts |
Postprocessing in on, ETA for LA is 25 hours.
|
|
|
|
|
|
#1566 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
949710 Posts |
The good news is the sequence is still alive.
The bad news is none so far! ...Ooops. Spoke too soon. There was a tiny earthquake, @3.3, tiny, but right here. Well. Almost.. Iteration 2953, c127. Will do in 6 hrs. |
|
|
|
|
|
#1567 |
|
"Frank <^>"
Dec 2004
CDP Janesville
84A16 Posts |
|
|
|
|
|
|
#1568 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
9,497 Posts |
c149 in i2954. (t35 only scanned)
I am switching back to Lucas/Fib "regular scheduled programming". c153 now Last fiddled with by Batalov on 2012-03-30 at 18:18 |
|
|
|
|
|
#1569 |
|
May 2008
21078 Posts |
|
|
|
|
|
|
#1570 |
|
Oct 2006
Berlin, Germany
62310 Posts |
|
|
|
|
|
|
#1571 |
|
Oct 2006
Berlin, Germany
26F16 Posts |
|
|
|
|
|
|
#1572 |
|
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88
3×29×83 Posts |
Out of a lack of better places to put this...
Can some explain (or link me to an explanation of) how much ECM to throw at a given composite before NFS/QS? Meaning, what exactly does the "txx" mean, and how do I decide what B1 to use based on size of n and current t-depth? I tried Googling it, but didn't find much. (I do understand that ECM finds factors probabilistically, and that txx says something about the probability of having found a yy-digit factor, but I have no idea of size-of-factor relates to bounds or to txx.) Last fiddled with by Dubslow on 2012-03-30 at 21:27 |
|
|
|
|
|
#1573 |
|
"Nancy"
Aug 2002
Alexandria
2,467 Posts |
The conventional wisdom for GNFS numbers is: do the expected number of curves to find a factor of 1/3 the size of the number. For a 150-digit input, that meant do enough curves for a 50-digit factor, which people abbreviate as "t50" or "p50 test."
Note that the 1/3 rule is not a result of an analysis of the algorithms; in fact, when you look at the complexity functions of ECM and NFS, there can't be a simple such constant. It's just a rule of thumb that, for numbers of the size we usually factor, is usually "close enough." |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Reserved for MF - Sequence 3366 | RichD | Aliquot Sequences | 470 | 2021-04-22 02:17 |
| Reserved for MF - Sequence 3408 | RichD | Aliquot Sequences | 474 | 2021-03-07 20:28 |
| Reserved for MF - Sequence 276 | kar_bon | Aliquot Sequences | 127 | 2020-12-17 10:05 |
| Assignments are reserved but not showing up | prism019 | GPU to 72 | 6 | 2020-09-21 22:11 |
| 80M to 64 bits ... but not really reserved | petrw1 | Lone Mersenne Hunters | 82 | 2010-01-11 01:57 |