GMP-ECM 7.0.4-dev [configured with MPIR 2.7.2, --enable-openmp] [P-1]
Tuned for x86_64/corei7/params.h
Resuming P-1 residue
Input number is (98809^41-1)/98808/52488296561287597 (184 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 73728MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4846155ms
Computing h using 32 threads took 275451ms
Computing DCT-I of h using 32 threads took 1924257ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1075143ms
Computing g*h using 32 threads took 4040879ms
Computing gcd of coefficients and N using 32 threads took 617280ms
Step 2 took 12891845ms
Resuming P-1 residue
Input number is (98869^41-1)/98868/83/10333/173146729846774601087 (174 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 70656MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4672588ms
Computing h using 32 threads took 271831ms
Computing DCT-I of h using 32 threads took 1843526ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1056563ms
Computing g*h using 32 threads took 3872990ms
Computing gcd of coefficients and N using 32 threads took 599528ms
Step 2 took 12427196ms
Resuming P-1 residue
Input number is (98887^41-1)/98886/67733 (195 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 76800MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 5100484ms
Computing h using 32 threads took 306121ms
Computing DCT-I of h using 32 threads took 2015939ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1202362ms
Computing g*h using 32 threads took 4228891ms
Computing gcd of coefficients and N using 32 threads took 659821ms
Step 2 took 13722347ms
Resuming P-1 residue
Input number is (98893^41-1)/98892/41/83/4181267113193/49117329069871649 (167 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 67584MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4401303ms
Computing h using 32 threads took 245718ms
Computing DCT-I of h using 32 threads took 1767663ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 946942ms
Computing g*h using 32 threads took 3689080ms
Computing gcd of coefficients and N using 32 threads took 562618ms
Step 2 took 11773302ms
Resuming P-1 residue
Input number is (98899^41-1)/98898/739/39807244401537752479 (178 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 70656MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4802257ms
Computing h using 32 threads took 268743ms
Computing DCT-I of h using 32 threads took 1885428ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1055581ms
Computing g*h using 32 threads took 3965030ms
Computing gcd of coefficients and N using 32 threads took 592461ms
Step 2 took 12685065ms
Resuming P-1 residue
Input number is (98911^41-1)/98910/25835413/405491887/368407149097059124245985787/285303237449356892844999984157 (128 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 55296MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 3765801ms
Computing h using 32 threads took 188215ms
Computing DCT-I of h using 32 threads took 1466893ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 700850ms
Computing g*h using 32 threads took 3084295ms
Computing gcd of coefficients and N using 32 threads took 444915ms
Step 2 took 9755897ms
Resuming P-1 residue
Input number is (98927^41-1)/98926/9677/1163417/1995061/1082179719859487 (169 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 67584MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4653806ms
Computing h using 32 threads took 241926ms
Computing DCT-I of h using 32 threads took 1708211ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 922387ms
Computing g*h using 32 threads took 3561503ms
Computing gcd of coefficients and N using 32 threads took 545317ms
Step 2 took 11765190ms
Resuming P-1 residue
Input number is (98939^41-1)/98938/83/11794691212419400844461648925329 (167 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 67584MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4236145ms
Computing h using 32 threads took 249227ms
Computing DCT-I of h using 32 threads took 1581164ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 947519ms
Computing g*h using 32 threads took 3347313ms
Computing gcd of coefficients and N using 32 threads took 566112ms
Step 2 took 11055183ms
Resuming P-1 residue
Input number is (98947^41-1)/98946/83/2707/2750773/151431451/166856471 (172 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 67584MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4376250ms
Computing h using 32 threads took 256060ms
Computing DCT-I of h using 32 threads took 1633190ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 993102ms
Computing g*h using 32 threads took 3465828ms
Computing gcd of coefficients and N using 32 threads took 589824ms
Step 2 took 11439241ms
Resuming P-1 residue
Input number is (98993^41-1)/98992/277407307901 (189 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 73728MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4674289ms
Computing h using 32 threads took 278009ms
Computing DCT-I of h using 32 threads took 1792358ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1093598ms
Computing g*h using 32 threads took 3796410ms
Computing gcd of coefficients and N using 32 threads took 623317ms
Step 2 took 12363407ms
Resuming P-1 residue
Input number is (99017^41-1)/99016/83 (198 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 76800MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 5026696ms
Computing h using 32 threads took 310910ms
Computing DCT-I of h using 32 threads took 1910965ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1230240ms
Computing g*h using 32 threads took 4020489ms
Computing gcd of coefficients and N using 32 threads took 660976ms
Step 2 took 13328241ms
Resuming P-1 residue
Input number is (99023^41-1)/99022/83/5167/18287/3477689313920239626242246793068615747891 (151 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 61440MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 3643419ms
Computing h using 32 threads took 213566ms
Computing DCT-I of h using 32 threads took 1314308ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 830035ms
Computing g*h using 32 threads took 2854225ms
Computing gcd of coefficients and N using 32 threads took 509765ms
Step 2 took 9455501ms
Resuming P-1 residue
Input number is (99053^41-1)/99052/4727759548829/37930925223733 (174 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 70656MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4436419ms
Computing h using 32 threads took 273001ms
Computing DCT-I of h using 32 threads took 1648868ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1079308ms
Computing g*h using 32 threads took 3480242ms
Computing gcd of coefficients and N using 32 threads took 603100ms
Step 2 took 11640919ms
Resuming P-1 residue
Input number is (99109^41-1)/99108/83/34719703 (191 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 73728MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4873580ms
Computing h using 32 threads took 283766ms
Computing DCT-I of h using 32 threads took 1880202ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1129821ms
Computing g*h using 32 threads took 3962363ms
Computing gcd of coefficients and N using 32 threads took 647030ms
Step 2 took 12921641ms
Resuming P-1 residue
Input number is (99131^41-1)/99130/83 (198 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 76800MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4948680ms
Computing h using 32 threads took 311970ms
Computing DCT-I of h using 32 threads took 1852481ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1234311ms
Computing g*h using 32 threads took 3950725ms
Computing gcd of coefficients and N using 32 threads took 668074ms
Step 2 took 13203129ms
Resuming P-1 residue
Input number is (99133^41-1)/99132/83/4019/25719360517/109236667942390982975269 (161 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 64512MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 3880900ms
Computing h using 32 threads took 242175ms
Computing DCT-I of h using 32 threads took 1439328ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 929438ms
Computing g*h using 32 threads took 3049523ms
Computing gcd of coefficients and N using 32 threads took 550965ms
Step 2 took 10324926ms
Resuming P-1 residue
Input number is (99137^41-1)/99136/821/2543/59903075503 (183 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 73728MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4636209ms
Computing h using 32 threads took 276824ms
Computing DCT-I of h using 32 threads took 1775884ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1084597ms
Computing g*h using 32 threads took 3794490ms
Computing gcd of coefficients and N using 32 threads took 614722ms
Step 2 took 12331458ms
Resuming P-1 residue
Input number is (99173^41-1)/99172/4532398219/171223341871 (179 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 70656MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4463891ms
Computing h using 32 threads took 268868ms
Computing DCT-I of h using 32 threads took 1653267ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1051197ms
Computing g*h using 32 threads took 3536964ms
Computing gcd of coefficients and N using 32 threads took 595082ms
Step 2 took 11751134ms
Resuming P-1 residue
Input number is (99181^41-1)/99180/18287/235137389317/84541928664839/919874912228734770718854829509013 (138 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 58368MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 3408809ms
Computing h using 32 threads took 205313ms
Computing DCT-I of h using 32 threads took 1238523ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 785917ms
Computing g*h using 32 threads took 2663359ms
Computing gcd of coefficients and N using 32 threads took 483962ms
Step 2 took 8880357ms
Resuming P-1 residue
Input number is (99191^41-1)/99190/159737/115766435277237587 (178 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 70656MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4851303ms
Computing h using 32 threads took 267089ms
Computing DCT-I of h using 32 threads took 1888080ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1060230ms
Computing g*h using 32 threads took 4004093ms
Computing gcd of coefficients and N using 32 threads took 601337ms
Step 2 took 12882063ms
Resuming P-1 residue
Input number is (99251^41-1)/99250/3810623/9948979 (187 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 73728MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 5105086ms
Computing h using 32 threads took 277074ms
Computing DCT-I of h using 32 threads took 1973818ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1096983ms
Computing g*h using 32 threads took 4187816ms
Computing gcd of coefficients and N using 32 threads took 626141ms
Step 2 took 13479485ms
Resuming P-1 residue
Input number is (99257^41-1)/99256/3406379959/1306992415558326705224096027693 (161 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 64512MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4469445ms
Computing h using 32 threads took 243300ms
Computing DCT-I of h using 32 threads took 1706869ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 940936ms
Computing g*h using 32 threads took 3622827ms
Computing gcd of coefficients and N using 32 threads took 552462ms
Step 2 took 11794159ms
Resuming P-1 residue
Input number is (99289^41-1)/99288/83/1580269151/847465666219 (177 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 70656MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4904125ms
Computing h using 32 threads took 270537ms
Computing DCT-I of h using 32 threads took 1886474ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1069386ms
Computing g*h using 32 threads took 4001379ms
Computing gcd of coefficients and N using 32 threads took 603927ms
Step 2 took 12953325ms
Resuming P-1 residue
Input number is (99347^41-1)/99346/5603338883 (191 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 73728MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 5108019ms
Computing h using 32 threads took 281348ms
Computing DCT-I of h using 32 threads took 2068448ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1123550ms
Computing g*h using 32 threads took 4382630ms
Computing gcd of coefficients and N using 32 threads took 643941ms
Step 2 took 13826493ms
Resuming P-1 residue
Input number is (99349^41-1)/99348/83/1284100504239979/787717830580866517 (165 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 67584MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4651825ms
Computing h using 32 threads took 247948ms
Computing DCT-I of h using 32 threads took 1796929ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 965241ms
Computing g*h using 32 threads took 3812914ms
Computing gcd of coefficients and N using 32 threads took 571166ms
Step 2 took 12301225ms
Resuming P-1 residue
Input number is (99367^41-1)/99366/83/109717 (193 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 76800MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 5409163ms
Computing h using 32 threads took 313967ms
Computing DCT-I of h using 32 threads took 2067372ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1252985ms
Computing g*h using 32 threads took 4384096ms
Computing gcd of coefficients and N using 32 threads took 670617ms
Step 2 took 14452291ms
Resuming P-1 residue
Input number is (99377^41-1)/99376/83/621860777 (190 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 73728MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 5110234ms
Computing h using 32 threads took 279039ms
Computing DCT-I of h using 32 threads took 1972805ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1104861ms
Computing g*h using 32 threads took 4190421ms
Computing gcd of coefficients and N using 32 threads took 625985ms
Step 2 took 13510248ms
Resuming P-1 residue
Input number is (99391^41-1)/99390/83/6151/2190583851419142167 (176 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 70656MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4907479ms
Computing h using 32 threads took 272112ms
Computing DCT-I of h using 32 threads took 1886520ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1076844ms
Computing g*h using 32 threads took 3998773ms
Computing gcd of coefficients and N using 32 threads took 606532ms
Step 2 took 12972497ms
Resuming P-1 residue
Input number is (99401^41-1)/99400/19927/160639/141814327/3408086065030343318681/2342527221932243846609299 (137 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 58368MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4023157ms
Computing h using 32 threads took 208823ms
Computing DCT-I of h using 32 threads took 1542866ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 801033ms
Computing g*h using 32 threads took 3272387ms
Computing gcd of coefficients and N using 32 threads took 492713ms
Step 2 took 10499132ms
Resuming P-1 residue
Input number is (99409^41-1)/99408/739/652229 (192 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 73728MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 5322193ms
Computing h using 32 threads took 284328ms
Computing DCT-I of h using 32 threads took 2066561ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1137325ms
Computing g*h using 32 threads took 4379058ms
Computing gcd of coefficients and N using 32 threads took 645953ms
Step 2 took 14051915ms
Resuming P-1 residue
Input number is (99439^41-1)/99438/5003/16729/51907/407933027/79576400310798547520149 (156 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 64512MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4480177ms
Computing h using 32 threads took 244080ms
Computing DCT-I of h using 32 threads took 1712922ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 943229ms
Computing g*h using 32 threads took 3631532ms
Computing gcd of coefficients and N using 32 threads took 552493ms
Step 2 took 11826967ms
Resuming P-1 residue
Input number is (99523^41-1)/99522/37591077333540595589997210131617/1642271034862691515618667322610657 (136 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 55296MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4024015ms
Computing h using 32 threads took 208308ms
Computing DCT-I of h using 32 threads took 1541055ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 798648ms
Computing g*h using 32 threads took 3270997ms
Computing gcd of coefficients and N using 32 threads took 497956ms
Step 2 took 10499070ms
Resuming P-1 residue
Input number is (99527^41-1)/99526/83/869119 (193 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 76800MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 5331272ms
Computing h using 32 threads took 286839ms
Computing DCT-I of h using 32 threads took 2069572ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1143175ms
Computing g*h using 32 threads took 4388121ms
Computing gcd of coefficients and N using 32 threads took 648215ms
Step 2 took 14089402ms
Resuming P-1 residue
Input number is (99529^41-1)/99528/83/6971/13613/30341/305369/779576734315931423181413/4607481854676897774348409 (132 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 55296MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 3776847ms
Computing h using 32 threads took 192427ms
Computing DCT-I of h using 32 threads took 1463804ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 715873ms
Computing g*h using 32 threads took 3102283ms
Computing gcd of coefficients and N using 32 threads took 461856ms
Step 2 took 9934019ms
Resuming P-1 residue
Input number is (99551^41-1)/99550/2297/2409712517/185544101548283543652419375729897 (155 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 64512MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4475278ms
Computing h using 32 threads took 244703ms
Computing DCT-I of h using 32 threads took 1709101ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 933946ms
Computing g*h using 32 threads took 3630877ms
Computing gcd of coefficients and N using 32 threads took 551573ms
Step 2 took 11815048ms
Resuming P-1 residue
Input number is (99559^41-1)/99558/1545833312930040931433321801 (173 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 67584MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4857995ms
Computing h using 32 threads took 252285ms
Computing DCT-I of h using 32 threads took 1886708ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 990544ms
Computing g*h using 32 threads took 4010442ms
Computing gcd of coefficients and N using 32 threads took 588327ms
Step 2 took 12864451ms
Resuming P-1 residue
Input number is (99577^41-1)/99576/5212026437/28447677904290265856298866249192621 (156 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 64512MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4462487ms
Computing h using 32 threads took 241911ms
Computing DCT-I of h using 32 threads took 1710723ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 926365ms
Computing g*h using 32 threads took 3629083ms
Computing gcd of coefficients and N using 32 threads took 552477ms
Step 2 took 11808512ms
Resuming P-1 residue
Input number is (99661^41-1)/99660/83/2707/20896585949/11479369770707541826289 (163 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 64512MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4455857ms
Computing h using 32 threads took 247870ms
Computing DCT-I of h using 32 threads took 1798536ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 960857ms
Computing g*h using 32 threads took 3812009ms
Computing gcd of coefficients and N using 32 threads took 569325ms
Step 2 took 12129343ms
Resuming P-1 residue
Input number is (99679^41-1)/99678/13405771/10174077708904873442769455342511079084951 (153 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 61440MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4209266ms
Computing h using 32 threads took 214564ms
Computing DCT-I of h using 32 threads took 1624111ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 835807ms
Computing g*h using 32 threads took 3445220ms
Computing gcd of coefficients and N using 32 threads took 512837ms
Step 2 took 11010738ms
Resuming P-1 residue
Input number is (99709^41-1)/99708/83/60363422827879/165117246690994627075234672829 (156 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 64512MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4492688ms
Computing h using 32 threads took 245452ms
Computing DCT-I of h using 32 threads took 1711393ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 942886ms
Computing g*h using 32 threads took 3632889ms
Computing gcd of coefficients and N using 32 threads took 552899ms
Step 2 took 11858822ms
Resuming P-1 residue
Input number is (99719^41-1)/99718/83/2707/92251/92425099725987937 (173 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 67584MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4865078ms
Computing h using 32 threads took 254438ms
Computing DCT-I of h using 32 threads took 1887784ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 994881ms
Computing g*h using 32 threads took 4006714ms
Computing gcd of coefficients and N using 32 threads took 588701ms
Step 2 took 12881923ms
Resuming P-1 residue
Input number is (99733^41-1)/99732/365602015367 (189 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 73728MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 5101795ms
Computing h using 32 threads took 276200ms
Computing DCT-I of h using 32 threads took 1973834ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1098122ms
Computing g*h using 32 threads took 4181841ms
Computing gcd of coefficients and N using 32 threads took 626251ms
Step 2 took 13491232ms
Resuming P-1 residue
Input number is (99761^41-1)/99760/83/110291/1956623425699/4132703036411057 (166 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 67584MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4660795ms
Computing h using 32 threads took 250241ms
Computing DCT-I of h using 32 threads took 1802856ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 973540ms
Computing g*h using 32 threads took 3818827ms
Computing gcd of coefficients and N using 32 threads took 574520ms
Step 2 took 12364530ms
Resuming P-1 residue
Input number is (99793^41-1)/99792/83/197860589 (190 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 73728MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 5114945ms
Computing h using 32 threads took 279491ms
Computing DCT-I of h using 32 threads took 1972945ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1104409ms
Computing g*h using 32 threads took 4190920ms
Computing gcd of coefficients and N using 32 threads took 626391ms
Step 2 took 13533648ms
********** Factor found in step 2: 56806182637752933991911143677836031571839
Found probable prime factor of 41 digits: 56806182637752933991911143677836031571839
Composite cofactor ((99793^41-1)/99792/83/197860589)/56806182637752933991911143677836031571839 has 149 digits
Resuming P-1 residue
Input number is (99817^41-1)/99816/83/301419947/257121883943149 (176 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 70656MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4911301ms
Computing h using 32 threads took 272518ms
Computing DCT-I of h using 32 threads took 1893743ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1074893ms
Computing g*h using 32 threads took 4007619ms
Computing gcd of coefficients and N using 32 threads took 604801ms
Step 2 took 13005179ms
Resuming P-1 residue
Input number is (99823^41-1)/99822/1231/2789/39074577243469844919949/1626410742369805827741160951 (144 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 58368MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4189111ms
Computing h using 32 threads took 214673ms
Computing DCT-I of h using 32 threads took 1623799ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 837647ms
Computing g*h using 32 threads took 3445844ms
Computing gcd of coefficients and N using 32 threads took 510716ms
Step 2 took 11003312ms
Resuming P-1 residue
Input number is (99833^41-1)/99832/51203681320752447753844719611 (172 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 67584MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4639485ms
Computing h using 32 threads took 246372ms
Computing DCT-I of h using 32 threads took 1797756ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 961917ms
Computing g*h using 32 threads took 3819451ms
Computing gcd of coefficients and N using 32 threads took 569716ms
Step 2 took 12319321ms
Peak memory usage: 74220MB
GMP-ECM 7.0.4-dev [configured with MPIR 2.7.2, --enable-openmp] [P-1]
Tuned for x86_64/corei7/params.h
Resuming P-1 residue
Input number is (99859^41-1)/99858/83/466909 (193 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 76800MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 5343986ms
Computing h using 32 threads took 279913ms
Computing DCT-I of h using 32 threads took 2011072ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1107654ms
Computing g*h using 32 threads took 4295596ms
Computing gcd of coefficients and N using 32 threads took 645127ms
Step 2 took 14168385ms
Resuming P-1 residue
Input number is (99871^41-1)/99870/739/2707/226715978501315538544627 (171 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 67584MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4685116ms
Computing h using 32 threads took 250429ms
Computing DCT-I of h using 32 threads took 1642847ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 947425ms
Computing g*h using 32 threads took 3441850ms
Computing gcd of coefficients and N using 32 threads took 559919ms
Step 2 took 11731416ms
Resuming P-1 residue
Input number is (99881^41-1)/99880/3691/465983673897557/6944215217485009/620880499024495936487 (146 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 61440MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 3776660ms
Computing h using 32 threads took 212925ms
Computing DCT-I of h using 32 threads took 1421559ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 817040ms
Computing g*h using 32 threads took 3057245ms
Computing gcd of coefficients and N using 32 threads took 503852ms
Step 2 took 9835691ms
Resuming P-1 residue
Input number is (99907^41-1)/99906/821/2297 (194 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 76800MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 5045930ms
Computing h using 32 threads took 312907ms
Computing DCT-I of h using 32 threads took 1933539ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1229647ms
Computing g*h using 32 threads took 4073545ms
Computing gcd of coefficients and N using 32 threads took 654486ms
Step 2 took 13371032ms
Resuming P-1 residue
Input number is (99961^41-1)/99960/83/22504632637466870497660643003 (170 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 67584MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4245224ms
Computing h using 32 threads took 247511ms
Computing DCT-I of h using 32 threads took 1577591ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 953213ms
Computing g*h using 32 threads took 3406859ms
Computing gcd of coefficients and N using 32 threads took 569279ms
Step 2 took 11103714ms
Resuming P-1 residue
Input number is (99991^41-1)/99990/83/21157/549317509656401 (180 digits)
Using mpz_mod
Using lmax = 268435456 with NTT which takes about 70656MB of memory
Using B1=100000000000-100000000000, B2=106381511725640448, polynomial x^1
P = 334639305, l = 268435456, s_1 = 109486080, k = s_2 = 1, m_1 = 145
Probability of finding a factor of n digits:
20 25 30 35 40 45 50 55 60 65
0.88 0.64 0.39 0.21 0.097 0.041 0.016 0.0055 0.0018 0.00056
Step 1 took 0ms
Computing F from factored S_1 took 4498461ms
Computing h using 32 threads took 268743ms
Computing DCT-I of h using 32 threads took 1708304ms
Multi-point evaluation 1 of 1:
Computing g_i using 32 threads took 1058092ms
Computing g*h using 32 threads took 3634371ms
Computing gcd of coefficients and N using 32 threads took 604816ms
Step 2 took 11850850ms
Peak memory usage: 74107MB