[QUOTE=schickel;248168][SIZE="5"]OMG!![/SIZE]

[code] 2372 . c164 = 2^3 * 3643 * 210573105529 * 1637298696359 * 4524372432971 * 1324922512882810280489279613245595139932613274649355350306838499328181267164234922312205601317388706765987906189080799222681
2373 . c164 = 2^3 * 6591773131313446548156452460460277667579628005426210805289515348340869867349240770833065713475872946272090464138424975010575114091827888652121452803822875523332977
2374 . c164 = 2 * 379 * 7223392803711043882484924626916759161 * 8427327158675998604545159819262500667078623534136073582373233152369098988022020554146056277433750217488298497800889186865233
2375 . c164 = 2 * 93940813 * 48706534889 * 4175173457705466437170120121 * 608623030638993244370632345293011022612596762301128301201060533177094217472829060321811618890770409403181474384202089
2376 . c164 = 2 * 89^2 * 14709960357635551 * 835398837455262574088453126871401015449 * 59724027880738799388620039576547554627657587436191698087164260890155972445254214268658264310675061503973[/code]This tops Don Leclair's downdriver capture by a full 6 digits....

Now let's hope that 4788 can have this kind of luck.

[SIZE="1"]PS. I hope I'm not letting any cats out of any one's bag.[/SIZE][/QUOTE]

nice!!!
:party::party::bow wave::bow wave::party::party:

Very nice catch! :smile:

:groupwave:
:toot:

I estimate* that at its current size, it has about a 1 in 250 chance of being lost at any given line. It is not unreasonable to think that this single downdriver run might take it under 120 digits, but what it does from there is anyone's guess.

* log(10)*162/3*2, since a 162 digit number (the cofactor) has about a 1/log(10^162) chance of being prime, and considering that we know it's odd, would have to be p=4n+1 to break it, and that it is not divisible by 3

Here's something that Clifford spotted in 572000. Just before it gained the 2^9 driver, it had these lines:[code]2877 . c83 = 2^8 * 3
2878 . c84 = 2^11 * 3
2879 . c84 = 2^[color="red"]18[/color] * 3
2880 . c84 = 2^[color="red"]26[/color] * 3
2881 . c84 = 2^[color="red"]10[/color] * 3
2882 . c85 = 2^10 * 3
2883 . c85 = 2^10 * 3
2884 . c85 = 2^10 * 3
2885 . c85 = 2^10 * 3[/code]And then it dropped into the 2^9 driver....

[QUOTE=Mini-Geek;248242]:groupwave:
:toot:

I estimate* that at its current size, it has about a 1 in 250 chance of being lost at any given line. It is not unreasonable to think that this single downdriver run might take it under 120 digits, but what it does from there is anyone's guess.

* log(10)*162/3*2, since a 162 digit number (the cofactor) has about a 1/log(10^162) chance of being prime, and considering that we know it's odd, would have to be p=4n+1 to break it, and that it is not divisible by 3[/QUOTE]Pretty good guess....it made it to <80 digits.

got lucky
a prp44 found with yafu
245274:i1222 size 110
[code]
08/05/11 16:02:01 v1.28 @ VINCENT-6D2C40D, Starting factorization of 78181236693885365330909640287796184567642018482876315733157508340179991065265593167258521195997191019394103
08/05/11 16:02:01 v1.28 @ VINCENT-6D2C40D, ****************************
08/05/11 16:02:01 v1.28 @ VINCENT-6D2C40D, rho: x^2 + 1, starting 1000 iterations on C107
08/05/11 16:02:01 v1.28 @ VINCENT-6D2C40D, rho: x^2 + 3, starting 1000 iterations on C107
08/05/11 16:02:01 v1.28 @ VINCENT-6D2C40D, rho: x^2 + 2, starting 1000 iterations on C107
08/05/11 16:02:02 v1.28 @ VINCENT-6D2C40D, pp1: starting B1 = 20K, B2 = gmp-ecm default on C107
08/05/11 16:02:02 v1.28 @ VINCENT-6D2C40D, pp1: starting B1 = 20K, B2 = gmp-ecm default on C107
08/05/11 16:02:02 v1.28 @ VINCENT-6D2C40D, pp1: starting B1 = 20K, B2 = gmp-ecm default on C107
08/05/11 16:02:02 v1.28 @ VINCENT-6D2C40D, pm1: starting B1 = 100K, B2 = gmp-ecm default on C107
08/05/11 16:02:03 v1.28 @ VINCENT-6D2C40D, Finished 25 curves using Lenstra ECM method on C107 input, B1 = 2K, B2 = gmp-ecm default
08/05/11 16:02:19 v1.28 @ VINCENT-6D2C40D, Finished 90 curves using Lenstra ECM method on C107 input, B1 = 11K, B2 = gmp-ecm default
08/05/11 16:04:36 v1.28 @ VINCENT-6D2C40D, Finished 200 curves using Lenstra ECM method on C107 input, B1 = 50K, B2 = gmp-ecm default
08/05/11 16:04:36 v1.28 @ VINCENT-6D2C40D, pp1: starting B1 = 1250K, B2 = gmp-ecm default on C107
08/05/11 16:04:40 v1.28 @ VINCENT-6D2C40D, pp1: starting B1 = 1250K, B2 = gmp-ecm default on C107
08/05/11 16:04:43 v1.28 @ VINCENT-6D2C40D, pp1: starting B1 = 1250K, B2 = gmp-ecm default on C107
08/05/11 16:04:46 v1.28 @ VINCENT-6D2C40D, pm1: starting B1 = 2500K, B2 = gmp-ecm default on C107
08/05/11 16:24:32 v1.28 @ VINCENT-6D2C40D, Finished 400 curves using Lenstra ECM method on C107 input, B1 = 250K, B2 = gmp-ecm default
08/05/11 16:24:32 v1.28 @ VINCENT-6D2C40D, pp1: starting B1 = 5M, B2 = gmp-ecm default on C107
08/05/11 16:24:44 v1.28 @ VINCENT-6D2C40D, pp1: starting B1 = 5M, B2 = gmp-ecm default on C107
08/05/11 16:24:56 v1.28 @ VINCENT-6D2C40D, pp1: starting B1 = 5M, B2 = gmp-ecm default on C107
08/05/11 16:25:08 v1.28 @ VINCENT-6D2C40D, pm1: starting B1 = 10M, B2 = gmp-ecm default on C107
08/05/11 16:41:37 v1.28 @ VINCENT-6D2C40D, prp44 = 15651166559449275276764540716507947337534667 (curve 81 stg1 B1=1000000 sigma=2686719953 thread=0)
08/05/11 16:41:37 v1.28 @ VINCENT-6D2C40D, Finished 81 curves using Lenstra ECM method on C107 input, B1 = 1M, B2 = gmp-ecm default
08/05/11 16:41:37 v1.28 @ VINCENT-6D2C40D, prp64 = 4995233831096380850223128517813373558138438030426436593379546309
[/code]

Probably not a class record, but a slight oddity anyway:

cubed 17 from sequence 707778:
[CODE] 364 . 255653123697304302243363412673753637703454327171239526645371085269112317458830803591404592585780489907329608741810529159671596 = 2^2 * 571019 * 514251866999292336461005894958749466183 * 217653009213047789835986501624128634445568904039771484583748562932407773722703287
365 . 191740626272242647450533651756137318382057955064085220424299764898788727145525129055537371220448892549203567804095256995171284 = 2^2 * 17^3 * 227 * 311 * 867163639 * 751835833253 * 18938402852121661721520803604040220375038441 * 11193185711105712848962334297550957318004265592981763
366 . 167494771892717867909559876141639561741512508560957464175713477762568196977614058147982532132931521866395148956045920908751916 = 2^2 * 14778548209 * 342934996917466647697 * 148499863951507226937841 * 55638015138463802410933104091179522135221026230371726689056007149395003[/CODE]

Some trivial dribbling
 

Here are the longest/shortest/highest/lowest:

Shortest (=400 lines):[code] 49458 400. sz 118 2^3 * 3 * 5^2 * 7
491490 400. sz 119 2^8 * 3 * 367 * 1223
322344 400. sz 120 2^3 * 3 * 5 * 31 * 3291163
911484 400. sz 123 2^2 * 3 * 73331
178710 400. sz 123 2^5 * 3 * 7 * 17 * 19 * 73 * 541
546660 400. sz 124 2^3 * 3 * 5 * 11 * 13^2
151680 400. sz 125 2^3 * 3 * 5^3 * 578547653
689652 400. sz 126 2^3 * 3
929406 400. sz 130 2^3 * 3 * 5 * 89 * 127 * 331 * 509 * 1543
330084 400. sz 134 2 * 3^3 * 41 * 97 * 895231
78288 400. sz 135 2^3 * 3 * 5 * 17
457326 400. sz 142 2^3 * 3 * 5 * 7
949080 400. sz 147 2^3 * 3 * 5 * 43 * 186411589992350421893[/code]Longest (>7000 lines):[code]283752 7009. sz 159 2^3 * 3 * 331 * 53120107732317517
144984 7062. sz 150 2^5 * 3 * 7 * 37^2 * 83 * 109 * 655002391
1578 7300. sz 142 2 * 3 * 19 * 179 * 3331
392430 7362. sz 148 2^2 * 7
955296 7776. sz 149 2^2 * 7
842592 8003. sz 172 2^3 * 3 * 5 * 13 * 587 * 823 * 1627
195528 8017. sz 144 2 * 3^4 * 24110979082363
552150 8197. sz 147 2^2 * 3 * 7^2 * 17 * 953 * 16493
453798 8565. sz 148 2^2 * 7
933436 12378. sz 160 2^2 * 5 * 7 * 29[/code]Smallest (<110 digits):[code]532656 3129. sz 99 2^2 * 7
237060 2025. sz 105 2 * 3
904960 3210. sz 106 2 * 3^2
761040 1025. sz 107 2^4 * 3 * 5
860952 1042. sz 107 2^4 * 3^3 * 5 * 37 * 142867 * 5357039
540560 1997. sz 108 2^3 * 3 * 13
910032 729. sz 108 2^4 * 22123
804126 907. sz 108 2^5 * 10781 * 28099
615020 644. sz 109 2^2 * 3^2 * 7 * 11 * 3769
878376 2479. sz 109 2^4 * 3[/code]Largest (>170 digits):[code] 19560 486. sz 170 2^3 * 3 * 5 * 7 * 59 * 4520183
842592 8003. sz 172 2^3 * 3 * 5 * 13 * 587 * 823 * 1627
564 3373. sz 175 2^2 * 3^2 * 7 * 13 * 71 * 4292236942619
2340 693. sz 176 2^3 * 3^2 * 5 * 13 * 67
3270 645. sz 177 2^5 * 3 * 7 * 73
966 893. sz 178 2^2 * 3^2 * 5 * 83 * 2099
162126 4283. sz 178 2^3 * 3 * 5 * 461
552 1057. sz 179 2^2 * 3 * 71 * 145633
8352 1737. sz 180 2^2 * 3 * 7^2 * 37 * 4597 * 10841336113
660 890. sz 181 2^3 * 3^2 * 5[/code]Highest powers of 2:[code]701220 992. sz 114 2^10 * 3 * 11 * 23
676080 610. sz 113 2^10 * 3 * 13 * 101 * 1153
589212 1036. sz 118 2^10 * 3 * 23 * 337
947208 1646. sz 119 2^10 * 3 * 23 * 911 * 11597
732000 1484. sz 114 2^10 * 3 * 37 * 599
414480 507. sz 114 2^10 * 3 * 61
140742 606. sz 113 2^10 * 3 * 97 * 151
552876 2040. sz 123 2^10 * 3^2 * 5^2 * 13 * 2377097
531024 2620. sz 115 2^10 * 3^3 * 11^2
622830 871. sz 116 2^10 * 3^3 * 7
979200 2666. sz 114 2^11 * 3 * 23 * 41
820728 857. sz 114 2^11 * 3 * 5 * 11
289788 606. sz 115 2^11 * 3^2 * 257657
383760 1245. sz 119 2^13 * 3^2[/code]Other trivial bits:

Number of:
Sequences <500 lines: 464
Sequences at 110 digits with 2 * 3: 103
Sequences at 110 digits with 2 * 3^2: 54
Sequences with 2 * 3 (any form): 1419

Here's a funny one. I saw this in my last status file:[code]834312 1307. sz 116 2^4 * 3^2 * 31^2[/code]This was the only 2^4 * 31 that was worth looking at. I put the c111 up for some ECM work and just got the factors returned (p39 * p72).

When I uploaded the factor, it did actually escape, but this is what happened:[code] 1308 . c116 = 2^3 * 3^2 * 31[/code]But then the next couple of lines were very interesting (from the line I pulled on):[code]c116 = 2^4 * 3^2 * 31^2
c116 = 2^3 * 3^2 * 31
c117 = 2^3 * 3^2 * p115
c117 = 2^2 * 3 * 569[/code]So I guess it does pay to check at least a few lines beyond where a driver takes over....

Don't know if this was calculated before.
So, anyway, here are the open sequences with most downdriver runs:
[CODE]453798 67
933436 57
552150 55
955296 54
858180 52
392430 51
144984 48
195528 48
250824 48
236754 46
859974 46
577176 45
617508 44
10528 43
500010 43
532488 43
59232 43
34908 42
728910 42
76686 42
892440 42
154560 41
[/CODE]
532 open sequences didn't have a downdriver, 850 had one, 912 had two.

P.S. 858180 is actually finished (but the number of d-runs is 52). Some merging sequences may have even more d-runs.