![]() |
|
|
#12 |
|
Feb 2010
Sweden
173 Posts |
Congratulations ryanp for the nice find. It seems to me that you made your point more than clear with the recent three (or four) factors: ECM is (still) doing a great job for killing Cunningham numbers. This obviously annoys some of the big guys in the field (others are happy as everyone should be), but what to do about it. Good work, I wish you more factors.
|
|
|
|
|
|
#13 |
|
Bemusing Prompter
"Danny"
Dec 2002
California
5×479 Posts |
For those who don't read the other forums, Ryan also holds the current record for finding the largest known Wagstaff PRP.
Maybe he'll also find a new Mersenne prime soon.
|
|
|
|
|
|
#14 |
|
Aug 2004
New Zealand
223 Posts |
Just looking for some more ways to characterize how amazing this result is.
Back in 2000, Brent published "Recent Progress and Prospects for Integer Factorisation Algorithms" which is still a good read today. Included was an empirical formula for when we could expect a particular digit level to be achieved by ECM. In particular, Brent gave: y = 9.3 * sqrt(d) + 1932.3 where d is the number of digits and y the year. If we plug in 83 we see that this shouldn't have happened until 2017; while a value of 77 (the second biggest so far this year) is right on target for 2013. Another thing to note is that the product of two 83 digit numbers is well over 155 digits, so 512-bit RSA keys are now demonstrably vulnerable to ECM (not that anyone should be using keys that small and obviously gnfs is still a better choice for such keys). |
|
|
|
|
|
#15 | |
|
Apr 2011
1010 Posts |
Quote:
This is not a trivial task but it's vastly faster to calculate the order of a curve over a p83 than it is to actually run ecm on the composite, I suggest that a separate list of ECM records be kept where the SNFS difficulty is so high, it's obvious that the factor could only have come from ECM. Richard |
|
|
|
|
|
|
#16 | |
|
Nov 2003
1D2416 Posts |
Quote:
statements immediately. Unless of course you have evidence to back up your infammatory remarks. ![]() ![]() I call upon the moderators to do something about this. Richard's remarks are TOTALLY uncalled for. |
|
|
|
|
|
|
#17 | |
|
Nov 2003
22×5×373 Posts |
Quote:
The fact that he believes that someone might cheat just to set a temporary ECM record says a lot about him. Professionals do not care about such things. Only the hacks who seek attention and fame by accumulating "cpu credits" (and similar) have such attitudes. |
|
|
|
|
|
|
#18 |
|
Apr 2011
2×5 Posts |
I'm getting mixed messages about whether you are actually serious and I wish to seek clarification of your position before replying further....
Richard |
|
|
|
|
|
#19 | |
|
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
22·5·72·11 Posts |
Quote:
My take is that your statement could reasonably be interpreted as an accusation. However, it could equally reasonably be interpreted as an poorly phrased hypothetical "if one wished to cheat, then .... and a list of ECM records ... should be created to draw attention to reports which deserve closer attention." You may wish to clarify in the light of the paragraph above. Paul |
|
|
|
|
|
|
#20 | |
|
"Phil"
Sep 2002
Tracktown, U.S.A.
3×373 Posts |
Well, you did assert that it is possible that Ryan Propper cheated in obtaining his record:
Quote:
This seems a rather silly suggestion, considering that the main use of running ECM to high limits is to eliminate candidates that would otherwise be factored by SNFS or GNFS. |
|
|
|
|
|
|
#21 | |
|
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17×251 Posts |
Quote:
He's practically always serious, I doubt he was joking in any sense. I don't think you need to fear actually being banned based solely on your current remarks, though. Last fiddled with by Mini-Geek on 2013-12-02 at 18:02 |
|
|
|
|
|
|
#22 | |
|
Nov 2003
22·5·373 Posts |
Quote:
independent thread. It was in direct response to a discussion about the record ECM result. |
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| A new factor of F11?! | siegert81 | FermatSearch | 2 | 2018-01-24 04:35 |
| Fun factor | TheMawn | Lounge | 0 | 2014-04-11 02:41 |
| Factor me this | penguinman007 | Factoring | 4 | 2005-08-21 11:19 |
| use of factor? (just to be sure) | Ivan Semenov | Data | 2 | 2004-05-29 14:30 |
| Shortest time to complete a 2^67 trial factor (no factor) | dsouza123 | Software | 12 | 2003-08-21 18:38 |