![]() |
|
|
#364 |
|
Aug 2002
Dawn of the Dead
3538 Posts |
Code:
P-1 found a factor in stage #2, B1=810000, B2=21060000. UID: PageFault/boxen_01, M70002167 has a factor: 23343692938910511396401, 2^3 * 5^2 * 714223 * 1167251 |
|
|
|
|
|
#365 |
|
Aug 2002
Dawn of the Dead
5·47 Posts |
Code:
P-1 found a factor in stage #1, B1=95000. UID: PageFault/boxen_01, M8360353 has a factor: 123253905513130626056631481 k: 2^2 * 3^2 * 5 * 7 * 41 * 431 * 1289 * 4073 * 63059 |
|
|
|
|
|
#367 |
|
Aug 2010
Kansas
547 Posts |
45999635683923857777
263130442175552567999 are both factors of 2^340012417-1. Found running 65-68 bits, continuing on up. |
|
|
|
|
|
#368 |
|
Aug 2010
Kansas
547 Posts |
|
|
|
|
|
|
#369 |
|
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88
722110 Posts |
Personally, no. I'm just waiting until quantum computers get under way, with their polynomial-factoring-algorithms. The current record holder is 143=11*13.
|
|
|
|
|
|
#370 |
|
Dec 2009
Peine, Germany
5138 Posts |
|
|
|
|
|
|
#371 |
|
Aug 2002
Dawn of the Dead
5·47 Posts |
You are not alone ... I'm getting all sort of crazy ideas for P-1. Can't act out on this at the moment - current machine is crap. When I do replace it, I will be going for a minimum of 64 GB of ram (even that is too low). All depends on the next job I find ... that is not too far off and I found that I am worth far more than I imagined, and my sector is booming ...
|
|
|
|
|
|
#372 |
|
"Jerry"
Nov 2011
Vancouver, WA
1,123 Posts |
Code:
got assignment: exp=57606359 bit_min=71 bit_max=72
Starting trial factoring M57606359 from 2^71 to 2^72
k_min = 20494119764580
k_max = 40988239535062
Using GPU kernel "barrett79_mul32"
class | candidates | time | ETA | avg. rate | SievePrimes | CPU wait
429/4620 | 1.03G | 10.415s | 2h31m | 98.87M/s | 10816 | 3.62%
M57606359 has a factor: 3086670355345499795863
found 1 factor for M57606359 from 2^71 to 2^72 (partially tested) [mfaktc 0.18 barrett79_mul32]
tf(): total time spent: 15m 40.284s
|
|
|
|
|
|
#373 |
|
Aug 2002
Dawn of the Dead
5×47 Posts |
Right on mate. I remember back in the day, we often found 58 or 59 bit factors within minutes. I once did this with a pentium 133 ... three minutes into the run, which took close to a month if no factor was found.
Let's see ... M15xxxxxx, 58 to 65 bits, these days might take half an hour ... no idea, but maybe a good gpu in minutes ... |
|
|
|
|
|
#374 | ||
|
"Jerry"
Nov 2011
Vancouver, WA
1,123 Posts |
Quote:
Code:
got assignment: exp=57620203 bit_min=71 bit_max=72
Starting trial factoring M57620203 from 2^71 to 2^72
k_min = 20489195787060
k_max = 40978391579682
Using GPU kernel "barrett79_mul32"
found 0 factor(s) already
class | candidates | time | ETA | avg. rate | SievePrimes | CPU wait
876/4620 | 1.07G | 11.111s | 2h23m | 96.07M/s | 7396 | 6.06%
M57620203 has a factor: 3169216471470499491337
found 1 factor for M57620203 from 2^71 to 2^72 (partially tested) [mfaktc 0.18 barrett79_mul32]
estimated total time spent: 3m 24.699s
Quote:
Code:
got assignment: exp=15000607 bit_min=58 bit_max=65
Starting trial factoring M15000607 from 2^58 to 2^65
k_min = 9607290000
k_max = 1229733175044
Using GPU kernel "75bit_mul32"
class | candidates | time | ETA | avg. rate | SievePrimes | CPU wait
89/4620 | 60.82M | 0.956s | 14m58s | 63.62M/s | 11896 | 3.01%
|
||
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| A new factor of F11?! | siegert81 | FermatSearch | 2 | 2018-01-24 04:35 |
| A fond farewell | rogue | Lounge | 10 | 2008-11-21 05:25 |
| who can factor 10^100+27? | aaa120 | Factoring | 17 | 2008-11-13 19:23 |
| New factor | fivemack | ElevenSmooth | 4 | 2008-05-07 19:28 |
| Shortest time to complete a 2^67 trial factor (no factor) | dsouza123 | Software | 12 | 2003-08-21 18:38 |