View Single Post 2021-02-28, 16:12   #6
storm5510
Random Account

Aug 2009

194210 Posts Quote:
 Originally Posted by jocelynl1204 GMP-ECM 7.0.5-dev [configured with GMP 6.1.2, --enable-asm-redc] [P-1] Resuming P-1 residue saved by jocelyn@jocelyn-Dell-DV051 with GMP-ECM 7.0.4 on Fri Feb 5 22:54:18 2021 Input number is ((2^1571-1))/1250961804686347854556649368571289367 (437 digits) Using special division for factor of 2^1571-1 Using lmax = 16777216 with NTT which takes about 9792MB of memory Using B1=10000000000-10000000000, B2=999999913515224-2206728710203396, 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 DCT-I of h took 52891ms Multi-point evaluation 1 of 3: Computing g_i took 97109ms Computing g*h took 106985ms Computing gcd of coefficients and N took 37187ms Multi-point evaluation 2 of 3: Computing g_i took 97891ms Computing g*h took 107078ms Computing gcd of coefficients and N took 37312ms Multi-point 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
The above in red, I have seen this done before. If I understand it correctly, no testing below B1 is done. Values above B1 to B2 would be tested. Would this be an accurate statement?  