![]() |
[QUOTE=hyramgraff;490162]
[B]Question:[/B] What's a good upper limit for running ECM on smaller composites? 45 digits for [I]n[/I] <= 139? 50 digits for C140 <= [I]n[/I] <= C159? 55 digits for C160 <= [I]n[/I] <= 179?[/QUOTE] 0.31 * GNFS input size. So C150 gets 150 * 0.31 = 46.5 digits of ECM. I treat 47 digits at 2 * t45, 48 as half a t50, etc. |
MWRB file
I am reserving the more than a dozen numbers of the form p^37-1 from the MWRB file where 56662 < p < 63824. These are all SNFS-176 & SNFS-177 difficulty. There are still quite a few below SNFS-190 if others want to join in.
|
I am already doing 63823^37-1. Any chance you can skip that one?
|
[QUOTE=Brownfox;491490]I am already doing 63823^37-1. Any chance you can skip that one?[/QUOTE]
Sure, not a problem. I haven't started that one. I will remove it from my list. Let me know if you want another one or two. I am working from the bottom of the list. |
[QUOTE=RichD;491503]Sure, not a problem. I haven't started that one. I will remove it from my list.
Let me know if you want another one or two. I am working from the bottom of the list.[/QUOTE] Thank you. I'll let you know if I need another one. |
63823^37-1 factored. Moving on to 1371890521^19-1 as no-one seems to have reserved this yet.
|
MWRB file
I still have a few left in my group to finish up but identified another group to work. These are a little tougher (SNFS mid-190s). Reserving:
[CODE]49613^41 49789^41 49891^41 51431^41 51973^41 52259^41[/CODE] |
Reserving 13697^43-1 and 13757^43-1.
According to my calculations those are the last with SNFS difficulty below 180 digits |
Is there any list (on FDB or elsewhere) which lists the following:
-lowest p´s not fully factored for p^11-1 -numbers of form p^11-1 recieved enough ECM to start SNFS A huge amount of numbers from that form is in FDB, i´d like to sort them and prepair them for SNFS. For p<1.000.000.000 all numbers should be FF (1B is 99dd). But what about 1B-10B? I noticed some numbers with that form on 105 digits, they had p=11 digits. Anyway I started on C165, but starting with the lowest p´s without factors make much more sense. |
[QUOTE=MisterBitcoin;492417]Is there any list (on FDB or elsewhere) which lists the following:
-lowest p´s not fully factored for p^11-1 -numbers of form p^11-1 recieved enough ECM to start SNFS A huge amount of numbers from that form is in FDB, i´d like to sort them and prepair them for SNFS. For p<1.000.000.000 all numbers should be FF (1B is 99dd). But what about 1B-10B? I noticed some numbers with that form on 105 digits, they had p=11 digits. Anyway I started on C165, but starting with the lowest p´s without factors make much more sense.[/QUOTE] There isn't much documentation about how much ECM work has been done for any given number. I've been posting my progress but I think I'm the only one doing ECM work on numbers without a plan to also run SNFS or GNFS factoring. Since you're asking about numbers that are ready for SNFS I thought I should mention that just last week I finished running 45 digit ECM on all of the C130-C139 numbers in [URL="https://gitlab.com/hyramgraff/odd-perfect-ecm/blob/e2ecd2a115d7ed06c39aaf11bc241dd0ca56639a/t2100.txt"]this [/URL]version of the t2100 file. I believe that they are now ready for SNFS. |
MWRB file
Reserving a few more.
[CODE]26251^41-1 52511^41-1 53093^41-1[/CODE] |
| All times are UTC. The time now is 22:43. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.