With more Ram and a better machine
compared to a better machine it is no match.
Windows10 64bits 16Gb Ram cpu I53470
steps of 1,000,000,000,000,000
This is done under 17 minutes and would have taken 277 hours on the other pc.
GMPECM 7.0.5dev [configured with GMP 6.1.2, enableasmredc] [P1]
Resuming P1 residue saved by jocelyn@jocelynDellDV051 with GMPECM 7.0.4 on Fri Feb 5 22:54:18 2021
Input number is ((2^15711))/1250961804686347854556649368571289367 (437 digits)
Using special division for factor of 2^15711
Using lmax = 16777216 with NTT which takes about 9792MB of memory
Using B1=1000000000010000000000, B2=9999999135152242206728710203396, polynomial x^1
P = 64579515, l = 16777216, s_1 = 7434240, k = s_2 = 3, m_1 = 7742389
Can't compute success probabilities for B1 <> B2min
Step 1 took 0ms
Computing F from factored S_1 took 199391ms
Computing h took 24828ms
Computing DCTI of h took 52891ms
Multipoint evaluation 1 of 3:
Computing g_i took 97109ms
Computing g*h took 106985ms
Computing gcd of coefficients and N took 37187ms
Multipoint evaluation 2 of 3:
Computing g_i took 97891ms
Computing g*h took 107078ms
Computing gcd of coefficients and N took 37312ms
Multipoint evaluation 3 of 3:
Computing g_i took 97454ms
Computing g*h took 106343ms
Computing gcd of coefficients and N took 36453ms
Step 2 took 1002672ms
Peak memory usage: 9684MB
Now we just have to wait and see if it leads to a factor.
It always depends on B1 being high enough.
