![]() |
|
|
#826 |
|
Jul 2003
So Cal
24·7·19 Posts |
Code:
prp51 factor: 388506058643583355437271607661833307213566452269017 prp77 factor: 32036182249699730203082985730853613751522637113555017710745413833553416908691 |
|
|
|
|
|
#827 |
|
May 2008
21078 Posts |
Now a c171
Code:
193180597261434437130723427223452983749001196443861486431050101233095959046579376056784397572419692971642911818089261513816572456073452501892312801518858596361529181158803 |
|
|
|
|
|
#828 | |
|
Oct 2004
Austria
248210 Posts |
Quote:
This will need *lots* of ECM. My guess is somewhat more than t55, i.e. ~17700 @ 110e6 and a couple of curves at 260e6? |
|
|
|
|
|
|
#829 |
|
Noodles
"Mr. Tuch"
Dec 2007
Chennai, India
3×419 Posts |
If this 171 digit number had been prime, the aliquot sequence would have acquired
the downdriver now, right? @frmky (Greg): How many systems did you make use of in order to find out that p53 factor by using ECM, crack that c106 within half an hour crack that c128 within 5 hours of time Only 13 more iterations count for sequence 314718 to reach (hit) 9000 iterations is being left over! that is remaining actually... Last fiddled with by Raman on 2010-02-19 at 07:20 |
|
|
|
|
|
#830 |
|
Jul 2003
So Cal
85016 Posts |
|
|
|
|
|
|
#831 | |
|
Nov 2008
2×33×43 Posts |
Quote:
Assuming the c171 splits into two factors, there is a 1/2 chance that it will split into primes of the form 8n+1 and 8n+3, losing the 2^3, and a 1/2 chance that it will split into primes of the form 8n+5 and 8n+7, keeping the 2^3. The good news is that it can't pick up a 3, but that wouldn't really matter if it got 2^4 * 31... |
|
|
|
|
|
|
#832 | |
|
Oct 2004
Austria
9B216 Posts |
I guess you also distributed the poly search between these cores? Do you use a script for doing this?
Edit: Quote:
btw: is there any chance to get the downdriver if the 2³ is lost? Last fiddled with by Andi47 on 2010-02-19 at 08:05 Reason: Re: 10metreh |
|
|
|
|
|
|
#833 |
|
Jul 2003
So Cal
85016 Posts |
In this case, no. But the ggnfs distribution includes scripts (search_a5) to distribute the poly search if you use pol5. To distribute msieve polsel, I just run in different directories and concatanate the .p files.
|
|
|
|
|
|
#834 |
|
Sep 2004
13·41 Posts |
i would think cpu time is better spent doing like ecm since gpus are faster at poly's I will do p-1 if no one else is.
|
|
|
|
|
|
#835 |
|
Oct 2004
Austria
9B216 Posts |
To which bounds?
can you please save stage 1 (at the best done with the -chkpnt filename option) and post it, just in case if we want to increase the bounds later, that we don't need to re-do stage 1? Edit2: 59@11e6, no factor Last fiddled with by Andi47 on 2010-02-19 at 08:50 Reason: formatting + a few ECM curves |
|
|
|
|
|
#836 |
|
(loop (#_fork))
Feb 2006
Cambridge, England
23·11·73 Posts |
I'm running 2000@11e7 over the weekend. (raman: 60 hours Fri morning - Mon morning / 15 CPU-minutes per curve * 8 CPUs)
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Reserved for MF - Sequence 3366 | RichD | Aliquot Sequences | 470 | 2021-04-22 02:17 |
| Reserved for MF - Sequence 3408 | RichD | Aliquot Sequences | 474 | 2021-03-07 20:28 |
| Reserved for MF - Sequence 276 | kar_bon | Aliquot Sequences | 127 | 2020-12-17 10:05 |
| Assignments are reserved but not showing up | prism019 | GPU to 72 | 6 | 2020-09-21 22:11 |
| 80M to 64 bits ... but not really reserved | petrw1 | Lone Mersenne Hunters | 82 | 2010-01-11 01:57 |