![]() |
I'm too late, but I will do a poly search.
|
Here is a nice poly:
[code]# norm 1.106296e-11 alpha -7.271427 e 2.253e-10 n: 147998406675517406327680061413386342160268805242427078451900343934549131780622905201645576998223639153399654673028891064447 skew: 485466.48 c0: 51078287402579048322668610790368 c1: 178209989762650404547514616 c2: -1029621170702724248978 c3: -1854024731158621 c4: 5152589890 c5: 3000 Y0: -547802417747206906822973 Y1: 11796075364271 [/code] Best poly I found after searching with msieve on 2 cores for 5 hours. Who wants to take it? |
[QUOTE=jrk;173745]Here is a nice poly:
[code]# norm 1.106296e-11 alpha -7.271427 e 2.253e-10 n: 147998406675517406327680061413386342160268805242427078451900343934549131780622905201645576998223639153399654673028891064447 skew: 485466.48 c0: 51078287402579048322668610790368 c1: 178209989762650404547514616 c2: -1029621170702724248978 c3: -1854024731158621 c4: 5152589890 c5: 3000 Y0: -547802417747206906822973 Y1: 11796075364271 [/code] Best poly I found after searching with msieve on 2 cores for 5 hours. Who wants to take it?[/QUOTE]I only had an hour or so to do poly selection (with GGNFS) and started sieving with a poly with e ~2e-010 I currently have about 8M relations. If someone can do it faster, go ahead, otherwise i'll just et it run. |
[CODE]factoring 147998406675517406327680061413386342160268805242427078451900343934549131780622905201645576998223639153399654673028891064447 (123 digits)
prp61 factor: 9144862946075842082426787599402608124451702752891743405762217 prp62 factor: 16183775257017394245228171463555101602884842615643067477993191[/CODE] The next step is running ECM through the workers |
Nice split
|
[code]Run 330 out of 1000:
Using B1=3000000, B2=5706890290, polynomial Dickson(6), sigma=1534096427 Step 1 took 8388ms Step 2 took 4139ms ********** Factor found in step 2: 896482203787198998938498849596601211787 Found probable prime factor of 39 digits: 896482203787198998938498849596601211787 Probable prime cofactor 2240984839748758315836634658059607959371667936651269953074814607659897346033187 has 79 digits[/code] |
Line 2390 has a c111. I did 440 curves @ 3e6 and 57 curves @ 11e6.
|
[QUOTE=jrk;173844][quote=smh][code]factoring 147998406675517406327680061413386342160268805242427078451900343934549131780622905201645576998223639153399654673028891064447 (123 digits)
prp61 factor: 9144862946075842082426787599402608124451702752891743405762217 prp62 factor: 16183775257017394245228171463555101602884842615643067477993191[/code][/quote]Nice split[/QUOTE]Very nice![quote=jrk][code]Run 330 out of 1000: Using B1=3000000, B2=5706890290, polynomial Dickson(6), sigma=1534096427 Step 1 took 8388ms Step 2 took 4139ms ********** Factor found in step 2: 896482203787198998938498849596601211787 Found probable prime factor of 39 digits: 896482203787198998938498849596601211787 Probable prime cofactor 2240984839748758315836634658059607959371667936651269953074814607659897346033187 has 79 digits[/code][/quote]Another very nice split!! |
[QUOTE=jrk;173862]Line 2390 has a c111. I did 440 curves @ 3e6 and 57 curves @ 11e6.[/QUOTE]I'll run a few very high level curves.....does someone else want to tackle the NFS if it comes to that? I just had two jobs finish, so my CPUs are open at the moment.
|
[QUOTE=schickel;173865]....does someone else want to tackle the NFS if it comes to that? [/QUOTE]I'll take it if no one else has started it already.
|
[QUOTE=smh;173889]I'll take it if no one else has started it already.[/QUOTE]
Sounds good to me. |
All times are UTC. The time now is 01:19. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.