I'll take 3321929519, 3321929563 and 3321929573 from 2^76 to 2^80 next!

I'll take these 3 next:
3321928777, 3321928927 and 3321928963 from 2^79 to 2^80

Oliver

[QUOTE=TheJudger;218557]I'll take these 3 next:
3321928777, 3321928927 and 3321928963 from 2^79 to 2^80

Oliver[/QUOTE]

Looking for a factor? :smile:

Luigi

[QUOTE=ET_;218570]Looking for a factor? :smile:[/QUOTE]

Yep!

But chances are low. On average I will need 80 attempts from 2^79 to 2^80 to find one factor (or 20 attempts from 2^75 to 2^80).

A better attempt for finding factors (of unfactored exponents) would be to take all unfactored exponents to 2^76 in the first step and then to 2^77 in the next step and so on. But I think this would be unfair for users with slower hardware when there are only "big" factoring jobs are available.

Compared to 100MDPP the speedup during TF with mfaktc is higher for OBD.

Oliver

Next: 3321928219, 3321928241 and 3321928307.

Oliver

[QUOTE=TheJudger;218739]Next: 3321928219, 3321928241 and 3321928307.

Oliver[/QUOTE]

I guess 76-80 bits...

Luigi

Taking 3321928171 from 79 to 81

Luigi

Taking 3321928319 from 76 to 81 bits.

Also taking 3321928373 from 76 to 81 bits.

Taking 3321929209 from 75 to 81 bits.

All is *not* well in Italy.
 

MoreGimps seems to be down.

[url]http://downforeveryoneorjustme.com/http://www.moregimps.it/billion/index.php[/url]