Quote:
Originally Posted by Prime95
Yes, but it may not work. As far as I know, no one has tried that for years.

Seems fine to me? Everything builds fine with the latest source...
Code:
GMPECM 7.0.4 [configured with GMP 6.1.2, GWNUM 29.4, enableasmredc] [ECM]
Tuned for x86_64/k8/params.h
Due to incompatible licenses, this binary file must not be distributed.
Input number is (2^4096+1)/25860116183332395113497853167940236083358054650286886725246241569916604094012679963198712829716480001 (1133 digits)
Found number: 1*2^4096 + 1
Using special division for factor of 2^4096+1
Using B1=850000000, B2=15892628251516, polynomial x^1, sigma=0:17241075805006320821
dF=524288, k=5, d=5705700, d2=17, i0=132
Expected number of curves to find a factor of n digits:
35 40 45 50 55 60 65 70 75 80
16 51 183 729 3188 15164 77841 427872 2503667 1.6e+07
Using gwnum_ecmStage1(1, 2, 4096, 1, 850000000, 1)
Step 1 took 7762359ms
Estimated memory usage: 13.58GB
Initializing tables of differences for F took 3ms
Computing roots of F took 11918ms
Building F from its roots took 96743ms
Computing 1/F took 80569ms
Initializing table of differences for G took 140ms
Computing roots of G took 8681ms
Building G from its roots took 96779ms
Computing roots of G took 8755ms
Building G from its roots took 97078ms
Computing G * H took 50789ms
Reducing G * H mod F took 96635ms
Computing roots of G took 9421ms
Building G from its roots took 114522ms
Computing G * H took 54272ms
Reducing G * H mod F took 98293ms
Computing roots of G took 8740ms
Building G from its roots took 94358ms
Computing G * H took 49260ms
Reducing G * H mod F took 98047ms
Computing roots of G took 8667ms
Building G from its roots took 93193ms
Computing G * H took 48465ms
Reducing G * H mod F took 96023ms
Computing polyeval(F,G) took 283192ms
Computing product of all F(g_i) took 2667ms
Step 2 took 1609858ms
Expected time to find a factor of n digits:
35 40 45 50 55 60 65 70 75 80
1.78d 5.59d 19.89d 79.11d 345.78d 4.51y 23.13y 127.16y 744.07y 4613y