![]() |
|
|
#1 | |
|
"Nancy"
Aug 2002
Alexandria
2,467 Posts |
Quote:
Last fiddled with by akruppa on 2010-03-06 at 22:17 |
|
|
|
|
|
|
#2 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
24×593 Posts |
.......stammers........
Wow! Congrats to the monster team!! Last fiddled with by Batalov on 2010-03-06 at 22:19 Reason: (no hamsters were harmed with this image) |
|
|
|
|
|
#3 |
|
May 2008
3·5·73 Posts |
Group order is:
Code:
[2 4] [3 2] [13 1] [23 1] [61 1] [379 1] [13477 1] [272603 1] [12331747 1] [19481797 1] [125550349 1] [789142847 1] [1923401731 1] [10801302048203 1] |
|
|
|
|
|
#4 |
|
Banned
"Luigi"
Aug 2002
Team Italia
24×7×43 Posts |
![]() ![]() ![]() ![]()
|
|
|
|
|
|
#5 |
|
Bemusing Prompter
"Danny"
Dec 2002
California
2·32·7·19 Posts |
Wow, this is an incredible milestone. According to Paul Zimmerman's website, this new divisor broke the previous ECM factoring record by five digits. Maybe you guys will discover a new Mersenne prime soon as well!
Last fiddled with by ixfd64 on 2010-03-06 at 23:53 Reason: reword |
|
|
|
|
|
#6 |
|
Apr 2007
Spessart/Germany
2·34 Posts |
omg, congratulations to the team!
I think we need to buy some PS3... one hour for one stage 1 with B1=3e9... ![]() With ECM 2005 the first 6x-digit factor was found (afaik), now 2010 the first factor with 7x digit. When the first 8x will be found? ![]() ![]() ![]() ![]() ![]()
|
|
|
|
|
|
#7 |
|
Jun 2005
lehigh.edu
210 Posts |
As long as we're recording "wow's", take a look at the step1 prime,
Code:
1923401731 = step1 prime 3000000000 = B1 Small memory might have used B2 = 100*B1 = 300e9, but that's nowhere near Code:
10801302048203 step2 prime = 1.08e13 < 103971375307818 = 1.04e14 = B2 memory needed for this step 2 was? So mostly all of the step 1 bound was needed, and only a factor of 10 below the max possible step2, way far past low-moderate memory use. I'm presuming that epfl isn't entirely satisfied. Arjen has a test-case RSA key consisting of a product of four 256-bit primes (none of this pq stuff, if no one's able to find 70-digit prime factors). That's somewhere up in 77-digits, decimal, and this 73-digit prime seems to have taken all that the ps3 1st step/heavy_memory_gmp-ecm_2nd has. -Bruce PS -- I've posted a link to Arjen's Gif of the ps3s over in the 2- subthread at http://www.mersenneforum.org/showthr...425#post207425 |
|
|
|
|
|
#8 |
|
Oct 2006
vomit_frame_pointer
23·32·5 Posts |
I guess we can kiss off any dreams of having the #1 ECM hit this year.
All the p68 through p72 factors I have found are now ECM misses. |
|
|
|
|
|
#9 |
|
Oct 2004
Austria
2·17·73 Posts |
WOOOOW!!!
![]() ![]() ![]() ![]() Congrats for this giant factor!! ![]() ![]() ![]()
Last fiddled with by Andi47 on 2010-03-07 at 06:06 |
|
|
|
|
|
#10 |
|
Nov 2008
44228 Posts |
![]() ![]() When I saw the thread title I thought it was a hoax.
|
|
|
|
|
|
#11 |
|
(loop (#_fork))
Feb 2006
Cambridge, England
642210 Posts |
Not unless you've been pulling them out of thousand-bit hard SNFS numbers, which you haven't by definition of 'hard'; doing ECM for longer than it would take to factor the number by SNFS is a definition of stupidity.
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Factor a 108-digit number | sweety439 | Factoring | 9 | 2016-12-21 21:22 |
| New 70 digit factor | R.D. Silverman | Cunningham Tables | 16 | 2016-01-23 22:16 |
| 44-digit factor found using ECM w/ B1=1e6 & B2=1e8 | WVU Mersenneer | Factoring | 8 | 2010-04-24 17:01 |
| Probability of n-digit factor? | roger | Factoring | 3 | 2007-05-09 22:51 |
| 160 digit factor found of 366 digit (PRP-1) | AntonVrba | Factoring | 7 | 2005-12-06 22:02 |