[QUOTE=alpertron;346776]New P-1 factorization record:

P-1 found a factor in stage #2, B1=100000000, B2=2000000000.
M164503 has a factor: 21054105612284665760256195805146033137688353 (44 digits, 143 bits)
k = 2[SUP]4[/SUP] × 7 × 97 × 757 × 1289 × 42737 × 23542721 × 36366457 × 164980549[/QUOTE]
Another nice find and working on factoring the lower numbers!

YACS2F ([B]y[/B]et [B]a[/B]nother [B]c[/B]omposite [B]s[/B]tage #[B]2[/B] [B]f[/B]actor):

P-1 found a factor in stage #2, B1=565000, B2=11017500.
TheJudger/Pminus1, M63323077 has a factor: 68205072662349548620633421760422165673044571137810937540436645541918441353903 (255.23 bits / 77 digits)

Splits into 3 factors:
f[SUB]1[/SUB] = 35159552370479510750561 (74.90 bits / 23 digits)
f[SUB]2[/SUB] = 507279605993833393198631 (78.75 bits / 24 digits)
f[SUB]3[/SUB] = 3824070900985809209362680950233 (101.59 bits / 31 digits)

k[SUB]1[/SUB] = 2[SUP]4[/SUP] * 5 * 7 * 94153 * 5265373
k[SUB]2[/SUB] = 5 * 181 * 257 * 2633 * 6540679
k[SUB]3[/SUB] = 2[SUP]2[/SUP] * 3 * 7 * 19 * 229 * 593 * 743 * 138829 * 1350647

Oliver

three factor? *whistle* really nice, and rare.

[QUOTE=TheJudger;346843]P-1 found a factor in stage #2, B1=565000, B2=11017500.
TheJudger/Pminus1, M63323077 has a factor: 68205072662349548620633421760422165673044571137810937540436645541918441353903 (255.23 bits / 77 digits)[/QUOTE]:showoff:

[QUOTE=YuL;346671][B]My first factor above 100 bits[/B]

ECM found a factor in curve #6, stage #2
Sigma=2606317706517304, B1=1000000, B2=100000000.
[URL="http://www.mersenne.ca/exponent.php?exponentdetails=400069"]M400069[/URL] has a factor: 17384946805580300647271050027369
k=22 × 3 × 251 × 7213624012067538472153

103.778 bits[/QUOTE]
[QUOTE=alpertron;346776][B]New P-1 factorization record[/B]:

P-1 found a factor in stage #2, B1=100000000, B2=2000000000.
M164503 has a factor: 21054105612284665760256195805146033137688353 (44 digits, 143 bits)
k = 2[SUP]4[/SUP] × 7 × 97 × 757 × 1289 × 42737 × 23542721 × 36366457 × 164980549[/QUOTE]
[QUOTE=TheJudger;346843]YACS2F ([B]y[/B]et [B]a[/B]nother [B]c[/B]omposite [B]s[/B]tage #[B]2[/B] [B]f[/B]actor):

P-1 found a factor in stage #2, B1=565000, B2=11017500.
TheJudger/Pminus1, M63323077 has a factor: 68205072662349548620633421760422165673044571137810937540436645541918441353903 (255.23 bits / 77 digits)

[B]Splits into 3 factors[/B]:
f[SUB]1[/SUB] = 35159552370479510750561 (74.90 bits / 23 digits)
f[SUB]2[/SUB] = 507279605993833393198631 (78.75 bits / 24 digits)
f[SUB]3[/SUB] = 3824070900985809209362680950233 (101.59 bits / 31 digits)[/QUOTE]
Very nice, all of them!
[SIZE="0"](Some emphasis added)[/SIZE]

P-1 found a factor in stage #1, B1=580000.
UID: Jwb52z/Clay, M61839119 has a factor: 21738927757882013620583

74.203 bits.

It was barely missed by trial factoring, I think.

[QUOTE=firejuggler;346844]three factor? *whistle* really nice, and rare.[/QUOTE]

And I still haven't figured out when/why stage #2 finds composite factors. But I guess 3 factors in stage #2 don't happen every day.

Oliver

[QUOTE=TheJudger;346904]And I still haven't figured out when/why stage #2 finds composite factors. But I guess 3 factors in stage #2 don't happen every day.

Oliver[/QUOTE]
All 3 prime factors' [B]min B2[/B] value is lower than the [B]actual B2[/B] value that was used:

[URL="http://www.mersenne.ca/exponent/63323077"]M63,323,077[/URL]

P-1 found a factor in stage #2, B1=565000, B2=[B]11,017,500[/B]
24 × 5 × 7 × 94153 × [B]5,265,373[/B]
5 × 181 × 257 × 2633 × [B]6,540,679[/B]
22 × 3 × 7 × 19 × 229 × 593 × 743 × 138829 × [B]1,350,647[/B]

Yes, I'm unsure about the
[QUOTE]There is an enhancement to Pollard's algorithm called stage 2 that uses a second bound, B2. Stage 2 will find the factor q if k has just one factor between B1 and B2 and all remaining factors are below B1.[/QUOTE] (taken from [url]http://mersenne.org/various/math.php[/url]) part. And then there is Brent-Suyama extension aswell.

Oliver

Found two today with some manual testing:

[code]GMP-ECM 6.4.3 [configured with GMP 5.1.0, --enable-asm-redc] [ECM]
Input number is 2^201403-1 (60629 digits)
Using B1=1000000, B2=974637522, polynomial Dickson(3), sigma=3213589569
Step 1 took 14148836ms
Step 2 took 2368143ms
********** Factor found in step 2: 2508992110550760564547884607969
Found probable prime factor of 31 digits: 2508992110550760564547884607969
Composite cofactor (2^201403-1)/2508992110550760564547884607969 has 60598 digits[/code]

and:

[code]GMP-ECM 6.4.3 [configured with GMP 5.1.0, --enable-asm-redc] [ECM]
Input number is 2^207481-1 (62459 digits)
Using B1=250000, B2=183032866, polynomial Dickson(3), sigma=2211227441
Step 1 took 3350126ms
Step 2 took 1023982ms
********** Factor found in step 2: 2051067332098179933221407
Found probable prime factor of 25 digits: 2051067332098179933221407
Composite cofactor (2^207481-1)/2051067332098179933221407 has 62434 digits[/code]

They're both on factordb.com now, not sure if there's a good way to also upload them to mersenne.org's database...

You can mimic the recognizeable formats and paste into [url]http://mersenne.org/manual_result/[/url]
[CODE]M207481 has a factor: 2051067332098179933221407

M201403 has a factor: 2508992110550760564547884607969[/CODE]