%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%                                                          %
%                           ECPP                           %
%                                                          %
%                  by Fran\c{c}ois MORAIN                  %
%               morain@lix.polytechnique.fr                %
%      Version 6.4.5a (config file=Data/ecpp.pkg.DfD)      %
%                                                          %
%           "3 is prime, 5 is prime, 7 is prime            %
%              so every odd number is prime"               %
%                                                          %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Working on 469246065088704393503978116893012784445851101519460622694096941366228098321402716670989745784809246079424928599057499908147229726021301
% Performing a quick factorization
% This number might be prime
% Entering ECPP: delay mode
% Starting phase 1: building the sequence of primes
% N_0=469246065088704393503978116893012784445851101519460622694096941366228098321402716670989745784809246079424928599057499908147229726021301
% Pmax[448]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 0.140000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 0.200000s
%T% Ecpp sieve(4): 0.030000
%T% Ecpp sieve(4): 0.030000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 0.360000s
%T% Ecpp sieve(7): 0.020000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 0.470000s
%T% Ecpp sieve(11): 0.020000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 0.550000s
%T% Ecpp sieve(43): 0.020000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 0.630000s
%T% Ecpp sieve(67): 0.020000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 0.740000s
%T% Ecpp sieve(163): 0.020000
% Extra square factor: 5
% Factorization completed using trial division only
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 0.820000s
%T% Ecpp sieve(20): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 8
% D[[0]]=20
% A[[0]]=2711335844127308567021420509536540322056542869117427560549644402078
% B[[0]]=9668590689172771132956563291657991370918748686580346908893730139566
% m[[0]]=469246065088704393503978116893012784445851101519460622694096941366225386985558589362422724364299709539102872056188382480586680081619224
% Factor [P]=61^1
% Factor [P]=3^1
% Factor [P]=2^3
% End of depth 0 at 0.920000 s

% N_1=320523268503213383540968659079926765331865506502363813315639987272011876356255867050835194237909637663321633918161463443023688580341
% Pmax[437]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 0.940000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 1.000000s
%T% Ecpp sieve(3): 0.020000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 1.190000s
%T% Ecpp sieve(4): 0.030000
%T% Ecpp sieve(4): 0.030000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 1.350000s
%T% Ecpp sieve(7): 0.020000
% Testing if N is a norm in Q(sqrt(-15)) where (h, g)=(-2, 2)
% next D is D_11 = 15 at 1.440000s
%T% Ecpp sieve(15): 0.020000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 1.520000s
%T% Ecpp sieve(20): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 6
% D[[1]]=20
% A[[1]]=-883847887918980307472300279796663186368429558060563634503435821512
% B[[1]]=-158257066988177680938657333321879503015442808188927339425894517681
% m[[1]]=320523268503213383540968659079926765331865506502363813315639987272895724244174847358307494517706300849690063476222027077527124401854
% Factor [P]=7129^1
% Factor [P]=47^1
% Factor [P]=29^1
% Factor [P]=2^1
% End of depth 1 at 1.620000 s

% N_2=16493206501629255287809933174683812181274067476057966932808415096455649783832461324993616461305027909300539336360626111668301
% Pmax[413]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 1.650000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 1.700000s
%T% Ecpp sieve(4): 0.030000
%T% Ecpp sieve(4): 0.030000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 1.860000s
%T% Ecpp sieve(7): 0.020000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 1.930000s
%T% Ecpp sieve(11): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[2]]=11
% A[[2]]=-212954605483594731255659720154733150955060287645636073072524098
% B[[2]]=-43299340756941980330775933832975743824261120619510125406106060
% m[[2]]=16493206501629255287809933174683812181274067476057966932808415309410255267427192580653336616038178864360826981996699184192400
% Factor [P]=5^2
% Factor [P]=3^3
% Factor [P]=2^4
% End of depth 2 at 2.030000 s

% N_3=1527148750150856971093512330989241868636487729264626567852631047167616228465480794504938575559090635588965461295990665203
% Pmax[400]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 2.060000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 2.110000s
%T% Ecpp sieve(3): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 2.230000s
%T% Ecpp sieve(8): 0.030000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 2.300000s
%T% Ecpp sieve(11): 0.020000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 2.370000s
%T% Ecpp sieve(19): 0.020000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-51)) where (h, g)=(-2, 2)
% next D is D_16 = 51 at 2.460000s
%T% Ecpp sieve(51): 0.020000
% Testing if N is a norm in Q(sqrt(-187)) where (h, g)=(-2, 2)
% next D is D_23 = 187 at 2.520000s
%T% Ecpp sieve(187): 0.020000
% Extra square factor: 3
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 7
% D[[3]]=187
% A[[3]]=-1304466166022084983586201684005286298343537170602566781007272
% B[[3]]=-153514322387563155784215844403666870257892632791002590504938
% m[[3]]=1527148750150856971093512330989241868636487729264626567852632351633782250550464380706622580845388979126136063862771672476
% Factor [P]=131^1
% Factor [P]=41^1
% Factor [P]=2^2
% End of depth 3 at 2.640000 s

% N_4=71083073457031138107126807437592714049361744985320544025909158054076626817653341123935141540001348870142248364493189
% Pmax[385]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 2.660000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 2.710000s
%T% Ecpp sieve(3): 0.030000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 2.840000s
%T% Ecpp sieve(4): 0.030000
%T% Ecpp sieve(4): 0.030000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 2.980000s
%T% Ecpp sieve(11): 0.020000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 3.040000s
%T% Ecpp sieve(43): 0.020000
% Testing if N is a norm in Q(sqrt(-15)) where (h, g)=(-2, 2)
% next D is D_11 = 15 at 3.100000s
%T% Ecpp sieve(15): 0.010000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 3.160000s
%T% Ecpp sieve(20): 0.020000
% Testing if N is a norm in Q(sqrt(-51)) where (h, g)=(-2, 2)
% next D is D_16 = 51 at 3.230000s
%T% Ecpp sieve(51): 0.010000
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 3.290000s
%T% Ecpp sieve(52): 0.020000
% Testing if N is a norm in Q(sqrt(-148)) where (h, g)=(-2, 2)
% next D is D_22 = 148 at 3.350000s
%T% Ecpp sieve(148): 0.020000
% Testing if N is a norm in Q(sqrt(-187)) where (h, g)=(-2, 2)
% next D is D_23 = 187 at 3.410000s
%T% Ecpp sieve(187): 0.020000
% Testing if N is a norm in Q(sqrt(-267)) where (h, g)=(-2, 2)
% next D is D_26 = 267 at 3.480000s
%T% Ecpp sieve(267): 0.010000
% Testing if N is a norm in Q(sqrt(-403)) where (h, g)=(-2, 2)
% next D is D_27 = 403 at 3.540000s
%T% Ecpp sieve(403): 0.010000
% Testing if N is a norm in Q(sqrt(-132)) where (h, g)=(-4, 4)
% next D is D_31 = 132 at 3.600000s
%T% Ecpp sieve(132): 0.020000
% Testing if N is a norm in Q(sqrt(-195)) where (h, g)=(-4, 4)
% next D is D_33 = 195 at 3.660000s
%T% Ecpp sieve(195): 0.020000
% Testing if N is a norm in Q(sqrt(-340)) where (h, g)=(-4, 4)
% next D is D_37 = 340 at 3.720000s
%T% Ecpp sieve(340): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 16
% D[[4]]=340
% A[[4]]=15847306309961030677063325558460774034212731717083682967336
% B[[4]]=312462593273620580040553624900316103209314966380449405423
% m[[4]]=71083073457031138107126807437592714049361744985320544025893310747766665786976277798376680765967136138425164681525854
% Factor [P]=211^1
% Factor [P]=2^1
% End of depth 4 at 3.790000 s

% N_5=168443302030879474187504283027470886372895130296968113805434385658214847836436677247338106080490843929917451851957
% Pmax[377]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 3.810000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 3.850000s
%T% Ecpp sieve(3): 0.020000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 3.960000s
%T% Ecpp sieve(4): 0.020000
%T% Ecpp sieve(4): 0.020000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 4.070000s
%T% Ecpp sieve(7): 0.020000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 4.130000s
%T% Ecpp sieve(67): 0.020000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 4.200000s
%T% Ecpp sieve(163): 0.020000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 4.270000s
%T% Ecpp sieve(52): 0.010000
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 4.330000s
%T% Ecpp sieve(91): 0.010000
% Testing if N is a norm in Q(sqrt(-148)) where (h, g)=(-2, 2)
% next D is D_22 = 148 at 4.380000s
%T% Ecpp sieve(148): 0.020000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-267)) where (h, g)=(-2, 2)
% next D is D_26 = 267 at 4.450000s
%T% Ecpp sieve(267): 0.020000
% Extra square factor: 7
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-427)) where (h, g)=(-2, 2)
% next D is D_28 = 427 at 4.520000s
%T% Ecpp sieve(427): 0.010000
% Testing if N is a norm in Q(sqrt(-84)) where (h, g)=(-4, 4)
% next D is D_29 = 84 at 4.570000s
%T% Ecpp sieve(84): 0.020000
% Testing if N is a norm in Q(sqrt(-1092)) where (h, g)=(-8, 8)
% next D is D_56 = 1092 at 4.630000s
%T% Ecpp sieve(1092): 0.010000
% Testing if N is a norm in Q(sqrt(-39)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-219)) where (h, g)=(4, 2)
% next D is D_75 = 219 at 4.700000s
%T% Ecpp sieve(219): 0.010000
% Testing if N is a norm in Q(sqrt(-259)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-291)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-292)) where (h, g)=(4, 2)
% next D is D_78 = 292 at 4.780000s
%T% Ecpp sieve(292): 0.010000
% Extra square factor: 3
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 15
% D[[5]]=292
% A[[5]]=-820136660361456617156571066628733249179071474227680384436
% B[[5]]=-1983723542067176524048411697599635749105398061469203139
% m[[5]]=168443302030879474187504283027470886372895130296968113806254522318576304453593248313966839329669915404145132236394
% Factor [P]=11801^1
% Factor [P]=5393^1
% Factor [P]=47^1
% Factor [P]=11^1
% Factor [P]=2^1
% End of depth 5 at 4.870000 s

% N_6=2559669991520414987028059118503302779926135060612132168007030911266647088326483939287915546505433708937
% Pmax[341]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 4.880000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 4.920000s
%T% Ecpp sieve(4): 0.020000
%T% Ecpp sieve(4): 0.020000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 5.020000s
%T% Ecpp sieve(8): 0.020000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 5.070000s
%T% Ecpp sieve(43): 0.010000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 5.110000s
%T% Ecpp sieve(67): 0.020000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 5.160000s
%T% Ecpp sieve(163): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 5.200000s
%T% Ecpp sieve(52): 0.010000
% Testing if N is a norm in Q(sqrt(-68)) where (h, g)=(4, 2)
% next D is D_70 = 68 at 5.240000s
%T% Ecpp sieve(68): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 8
% D[[6]]=68
% A[[6]]=2735959135330495517041660191051126588337011643298874
% B[[6]]=201217163045714604557962975112923567625650319215448
% m[[6]]=2559669991520414987028059118503302779926135060612129432047895580771130046666292888161327209493790410064
% Factor [P]=157^1
% Factor [P]=23^1
% Factor [P]=13^1
% Factor [P]=11^1
% Factor [P]=3^2
% Factor [P]=2^4
% End of depth 6 at 5.290000 s

% N_7=34423732558102581034608207397550139519168301744036038011065961534307699605742211220287778751097
% Pmax[315]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 5.310000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 5.340000s
%T% Ecpp sieve(3): 0.020000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 5.410000s
%T% Ecpp sieve(4): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[7]]=4
% A[[7]]=117320366543140850081934985719832858043266995688
% B[[7]]=176019076967947852888833465050367103644181764819
% m[[7]]=34423732558102581034608207397550139519168301743918717644522820684225764620022378362244511755410
% Factor [P]=5^1
% Factor [P]=2^1
% End of depth 7 at 5.470000 s

% N_8=3442373255810258103460820739755013951916830174391871764452282068422576462002237836224451175541
% Pmax[311]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 5.490000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[8]]=-1
% Factor [P]=4831^1
% Factor [P]=151^1
% Factor [P]=5^1
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 8 at 5.520000 s

% N_9=78648912852888060220458580364099360867905405221700354189080594477959363392197965316539
% Pmax[286]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 5.530000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 5.560000s
%T% Ecpp sieve(7): 0.010000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 5.590000s
%T% Ecpp sieve(8): 0.020000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 5.630000s
%T% Ecpp sieve(11): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[9]]=11
% A[[9]]=17437327109318223787354652508110627620395291
% B[[9]]=978648172187626209295067016971936338359685
% m[[9]]=78648912852888060220458580364099360867905387784373244870856807123306855281570344921249
% Factor [P]=3^1
% End of depth 9 at 5.670000 s

% N_10=26216304284296020073486193454699786955968462594791081623618935707768951760523448307083
% Pmax[284]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 5.690000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[10]]=1
% Factor [P]=127^1
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 10 at 5.720000 s

% N_11=17202299399144370126959444524081225036724712988708058808148907944730283307430084191
% Pmax[274]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 5.730000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 5.750000s
%T% Ecpp sieve(3): 0.020000
% Extra square factor: 5
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[11]]=3
% A[[11]]=-58374967143143846454364576758962133990508
% B[[11]]=147649992445664505765142951349160960471270
% m[[11]]=17202299399144370126959444524081225036724771363675201951995362309307042269564074700
% Factor [P]=5^2
% Factor [P]=67^1
% Factor [P]=3^2
% Factor [P]=2^2
% End of depth 11 at 5.840000 s

% N_12=285278597000735823000985813003005390327110636213519103681515129507579473790449
% Pmax[258]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 5.850000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[12]]=-1
% Factor [P]=19501^1
% Factor [P]=13^1
% Factor [P]=3^2
% Factor [P]=2^4
% End of depth 12 at 5.870000 s

% N_13=7814594786305496907483426584167209875910117589124267561161533944664559
% Pmax[233]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 5.890000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[13]]=1
% Factor [P]=15761^1
% Factor [P]=67^1
% Factor [P]=5^1
% Factor [P]=2^4
% End of depth 13 at 5.910000 s

% N_14=92503444482572902264462377190334846403295182482410621072531361
% Pmax[206]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 5.920000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[14]]=-1
% Factor [P]=29137^1
% Factor [P]=11^1
% Factor [P]=5^1
% Factor [P]=2^5
% End of depth 14 at 5.930000 s

% N_15=1803849925324815492806365718812983148638235328760577403
% Pmax[181]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 5.940000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 5.940000s
%T% Ecpp sieve(7): 0.010000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 5.960000s
%T% Ecpp sieve(8): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[15]]=8
% A[[15]]=2495804130856271382600030042
% B[[15]]=351134134217259231896321309
% m[[15]]=1803849925324815492806365716317179017781963946160547362
% Factor [P]=1451^1
% Factor [P]=43^1
% Factor [P]=3^3
% Factor [P]=2^1
% End of depth 15 at 5.980000 s

% N_16=535390640725014704524179681931668206423311953371
% Pmax[159]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 5.990000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 6.000000s
%T% Ecpp sieve(7): 0.010000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 6.020000s
%T% Ecpp sieve(8): 0.020000
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 6.040000s
%T% Ecpp sieve(35): 0.010000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 6.060000s
%T% Ecpp sieve(40): 0.010000
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 6.070000s
%T% Ecpp sieve(91): 0.010000
% Testing if N is a norm in Q(sqrt(-235)) where (h, g)=(-2, 2)
% next D is D_25 = 235 at 6.090000s
%T% Ecpp sieve(235): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 7
% D[[16]]=235
% A[[16]]=-1117408080579516581726543
% B[[16]]=-61642819614486183364529
% m[[16]]=535390640725014704524180799339748785939893679915
% Factor [P]=47^1
% Factor [P]=23^1
% Factor [P]=5^1
% End of depth 16 at 6.110000 s

% N_17=99054697636450454121032525317252319322829543
% Pmax[147]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 6.120000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[17]]=-1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 17 at 6.120000 s

% N_18=16509116272741742353505420886208719887138257
% Pmax[144]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 6.130000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 6.140000s
%T% Ecpp sieve(3): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[18]]=3
% A[[18]]=-7649255964525360759586
% B[[18]]=-1583808519586060132888
% m[[18]]=16509116272741742353513070142173245247897844
% Factor [P]=17389^1
% Factor [P]=103^1
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 18 at 6.160000 s

% N_19=768122962119867763811230500318769261
% Pmax[120]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 6.160000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 6.160000s
%T% Ecpp sieve(3): 0.010000
% Extra square factor: 5
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[19]]=3
% A[[19]]=972402492932454061
% B[[19]]=-842006579589934021
% m[[19]]=768122962119867762838828007386315201
% Factor [P]=331^1
% Factor [P]=97^1
% Factor [P]=67^1
% Factor [P]=13^1
% End of depth 19 at 6.180000 s

% N_20=27467103561611518876081152133
% Pmax[95]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 6.180000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 6.180000s
%T% Ecpp sieve(3): 0.000000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 6.190000s
%T% Ecpp sieve(4): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[20]]=4
% A[[20]]=194928075471134
% B[[20]]=134044264740762
% m[[20]]=27467103561611323948005681000
% Factor [P]=113^1
% Factor [P]=13^1
% Factor [P]=5^3
% Factor [P]=3^4
% Factor [P]=2^3
% End of depth 20 at 6.200000 s

% N_21=230837334220905495029
% Pmax[68]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 6.200000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 6.200000s
%T% Ecpp sieve(4): 0.000000
%T% Ecpp sieve(4): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[21]]=4
% A[[21]]=30027198290
% B[[21]]=2330058998
% m[[21]]=230837334190878296740
% Factor [P]=5^1
% Factor [P]=2^2
% End of depth 21 at 6.210000 s

% N_22=11541866709543914837
% Pmax[64]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 6.210000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 6.210000s
%T% Ecpp sieve(4): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[22]]=4
% A[[22]]=-3934743428
% B[[22]]=-2769713929
% m[[22]]=11541866713478658266
% Factor [P]=17^2
% Factor [P]=2^1
% End of depth 22 at 6.220000 s

% N_23=19968627531969997
% Pmax[55]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 6.220000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 6.220000s
%T% Ecpp sieve(3): 0.000000
% Extra square factor: 11
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[23]]=3
% A[[23]]=258069506
% B[[23]]=66519772
% m[[23]]=19968627273900492
% Factor [P]=11^2
% Factor [P]=811^1
% Factor [P]=19^1
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 23 at 6.220000 s

% N_24=892497769
% Pmax[30]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 6.220000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[24]]=-1
% Factor [P]=251^1
% Factor [P]=3^1
% Factor [P]=2^3
% End of depth 24 at 6.230000 s

% N_25=148157
% Pmax[18]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 6.230000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[25]]=-1
% Factor [P]=2^2
% End of depth 25 at 6.230000 s

% N_26=37039
% Pmax[16]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 6.230000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[26]]=-1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 26 at 6.230000 s

% N_27=6173
% Pmax[13]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 6.230000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Factorization completed using sieve only
% Number of D tried was 1
% D[[27]]=-1
% Factor [P]=1543^1
% Factor [P]=2^2
% Cofactor is 1
% End of depth 27 at 6.230000 s

% N_28=1543
% Pmax[11]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 6.230000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Factorization completed using sieve only
% Number of D tried was 1
% D[[28]]=-1
% Factor [P]=257^1
% Factor [P]=3^1
% Factor [P]=2^1
% Cofactor is 1
% End of depth 28 at 6.230000 s

% N_29=257
% Pmax[9]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 6.230000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Factorization completed using sieve only
% Number of D tried was 1
% D[[29]]=-1
% Factor [P]=2^8
% Cofactor is 1
% End of depth 29 at 6.230000 s


% Time for building is 6.140000 s

% Starting phase 2: proving
% Starting proving job for step 0
% D=20 h=-2 g=2 invcode=4 (f^4) g0=2
%T% one root in GetInvariant: 0.000000s
% u has been computed
%T% FindJ: 0.030000
% E found
%T% find E: 0.030000
% Entering AEcModProveLarge
%T% ProveStep(20): 0.280000
% N_0 is prime
% Time for proof[0] is 0.280000 s

% Starting proving job for step 1
% D=20 h=-2 g=2 invcode=4 (f^4) g0=2
%T% one root in GetInvariant: 0.000000s
% u has been computed
%T% FindJ: 0.020000
% E found
%T% find E: 0.020000
% Entering AEcModProveLarge
%T% ProveStep(20): 0.260000
% N_1 is prime
% Time for proof[1] is 0.260000 s

% Starting proving job for step 2
% D=11 h=-1 g=1 invcode=1 (gamma2) g0=1
%T% one root in GetInvariant: 0.010000s
% u has been computed
% E found
%T% find E: 0.010000
% Suggested twist(11)=1
% Entering AEcModProveLarge
%T% ProveStep(11): 0.210000
% N_2 is prime
% Time for proof[2] is 0.210000 s

% Starting proving job for step 3
% D=187 h=-2 g=2 invcode=11 (Stark's) g0=2
%T% one root in FindG2G3s: 0.000000s
% Using Stark's theorem
% E found
%T% find E: 0.020000
% Suggested twist(187)=-1
% Entering AEcModProveLarge
%T% ProveStep(187): 0.210000
% N_3 is prime
% Time for proof[3] is 0.210000 s

% Starting proving job for step 4
% D=340 h=-4 g=4 invcode=4 (f^4) g0=4
%T% one root in GetInvariant: 0.000000s
% u has been computed
%T% FindJ: 0.040000
% E found
%T% find E: 0.040000
% Entering AEcModProveLarge
% Twisting
%T% ProveStep(340): 0.390000
% N_4 is prime
% Time for proof[4] is 0.390000 s

% Starting proving job for step 5
% D=292 h=4 g=2 invcode=5 (f^2/sqrt(2)) g0=2
%T% one root in GetInvariant: 0.020000s
% u has been computed
%T% FindJ: 0.040000
% E found
%T% find E: 0.040000
% Entering AEcModProveLarge
% Twisting
%T% ProveStep(292): 0.360000
% N_5 is prime
% Time for proof[5] is 0.360000 s

% Starting proving job for step 6
% D=68 h=4 g=2 invcode=5 (f^2/sqrt(2)) g0=2
%T% one root in GetInvariant: 0.010000s
% u has been computed
% Using the 8 | D theorem (even if D=4 mod 8)
% E found
%T% find E: 0.050000
% Suggested twist(68)=1
% Entering AEcModProveLarge
%T% ProveStep(68): 0.170000
% N_6 is prime
% Time for proof[6] is 0.170000 s

% Starting proving job for step 7
% E found
%T% find E: 0.020000
% Suggested twist(4)=1
% Entering AEcModProveLarge
%T% ProveStep(4): 0.130000
% N_7 is prime
% Time for proof[7] is 0.130000 s

% Starting proving job for step 8
%T% ProveStep(-1): 0.010000
% N_8 is prime
% Time for proof[8] is 0.010000 s

% Starting proving job for step 9
% D=11 h=-1 g=1 invcode=1 (gamma2) g0=1
%T% one root in GetInvariant: 0.000000s
% u has been computed
% E found
%T% find E: 0.000000
% Suggested twist(11)=-1
% Entering AEcModProveLarge
%T% ProveStep(11): 0.080000
% N_9 is prime
% Time for proof[9] is 0.080000 s

% Starting proving job for step 10
%T% ProveStep(1): 0.040000
% N_10 is prime
% Time for proof[10] is 0.040000 s

% Starting proving job for step 11
% E found
%T% find E: 0.000000
% Suggested twist(3)=1
% Entering AEcModProveLarge
%T% ProveStep(3): 0.070000
% N_11 is prime
% Time for proof[11] is 0.070000 s

% Starting proving job for step 12
%T% ProveStep(-1): 0.010000
% N_12 is prime
% Time for proof[12] is 0.010000 s

% Starting proving job for step 13
%T% ProveStep(1): 0.040000
% N_13 is prime
% Time for proof[13] is 0.040000 s

% Starting proving job for step 14
%T% ProveStep(-1): 0.000000
% N_14 is prime
% Time for proof[14] is 0.000000 s

% Starting proving job for step 15
% D=8 h=-1 g=1 invcode=3 (f1^2/sqrt(2)) g0=1
%T% one root in GetInvariant: 0.000000s
% u has been computed
% E found
%T% find E: 0.000000
% Suggested twist(8)=1
% Entering AEcModProveLarge
%T% ProveStep(8): 0.030000
% N_15 is prime
% Time for proof[15] is 0.030000 s

% Starting proving job for step 16
% D=235 h=-2 g=2 invcode=11 (Stark's) g0=2
%T% one root in FindG2G3s: 0.000000s
% Using Stark's theorem
% E found
%T% find E: 0.000000
% Suggested twist(235)=-1
% Entering AEcModProveLarge
%T% ProveStep(235): 0.020000
% N_16 is prime
% Time for proof[16] is 0.020000 s

% Starting proving job for step 17
%T% ProveStep(-1): 0.010000
% N_17 is prime
% Time for proof[17] is 0.010000 s

% Starting proving job for step 18
% M = 1 mod 2: 2 is not a cube
% E found
%T% find E: 0.000000
% Suggested twist(3)=1
% Entering AEcModProveLarge
%T% ProveStep(3): 0.010000
% N_18 is prime
% Time for proof[18] is 0.010000 s

% Starting proving job for step 19
% M = 0 mod 6: hopeless
% E found
%T% find E: 0.010000
% Suggested twist(3)=1
% Entering AEcModProveLarge
%T% ProveStep(3): 0.020000
% N_19 is prime
% Time for proof[19] is 0.020000 s

% Starting proving job for step 20
% E found
%T% find E: 0.000000
% Suggested twist(4)=1
% Entering AEcModProveLarge
%T% ProveStep(4): 0.010000
% N_20 is prime
% Time for proof[20] is 0.010000 s

% Starting proving job for step 21
% E found
%T% find E: 0.000000
% Suggested twist(4)=1
% Entering AEcModProveLarge
%T% ProveStep(4): 0.000000
% N_21 is prime
% Time for proof[21] is 0.000000 s

% Starting proving job for step 22
% E found
%T% find E: 0.000000
% Suggested twist(4)=1
% Entering AEcModProveLarge
%T% ProveStep(4): 0.010000
% N_22 is prime
% Time for proof[22] is 0.010000 s

% Starting proving job for step 23
% M = 1 mod 2: 2 is not a cube
% E found
%T% find E: 0.000000
% Suggested twist(3)=1
% Entering AEcModProveLarge
%T% ProveStep(3): 0.000000
% N_23 is prime
% Time for proof[23] is 0.000000 s

% Starting proving job for step 24
%T% ProveStep(-1): 0.000000
% N_24 is prime
% Time for proof[24] is 0.000000 s

% Starting proving job for step 25
%T% ProveStep(-1): 0.000000
% N_25 is prime
% Time for proof[25] is 0.000000 s

% Starting proving job for step 26
%T% ProveStep(-1): 0.000000
% N_26 is prime
% Time for proof[26] is 0.000000 s

% Starting proving job for step 27
%T% ProveStep(-1): 0.000000
% N_27 is prime
% Time for proof[27] is 0.000000 s

% Starting proving job for step 28
%T% ProveStep(-1): 0.000000
% N_28 is prime
% Time for proof[28] is 0.000000 s

% Starting proving job for step 29
% Using complete factorization theorem
%T% ProveStep(-1): 0.000000
% N_29 is prime
% Time for proof[29] is 0.000000 s
% Time for proving  is 2.370000 s
% Total time is        8.510000 s
This number is prime
%T% PrintCertif: 0.030000
% Time for this number is 8.630000s

Working on 164992318391749137778618203016073568145562169380072113665930277954775700806887801507826900079777702991292960839135826703502083479002436554096072140215655640761972914914253947
% Performing a quick factorization
% This number might be prime
% Entering ECPP: delay mode
% Starting phase 1: building the sequence of primes
% N_0=164992318391749137778618203016073568145562169380072113665930277954775700806887801507826900079777702991292960839135826703502083479002436554096072140215655640761972914914253947
% Pmax[576]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.050000
% next D is D_1 = 0 at 8.850000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 8.980000s
%T% Ecpp sieve(3): 0.040000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 9.310000s
%T% Ecpp sieve(7): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[0]]=7
% A[[0]]=-810469728893559530028024188789138663207644614822185207754708422251580716358070748316100
% B[[0]]=-21071619756700065892347077905072968684298459819055415344202783732194709307418075989678
% m[[0]]=164992318391749137778618203016073568145562169380072113665930277954775700806887801507827710549506596550822988863324615842165291123617258739303826848637907221478330985662570048
% Factor [P]=107^1
% Factor [P]=23^1
% Factor [P]=2^6
% End of depth 0 at 9.530000 s

% N_1=1047543671219455618769162707080922187027390855978718722482795852516607202400496504900368946499813316174973263303310492699647571640194907680464158679385331302559496810637
% Pmax[559]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 9.570000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 9.690000s
%T% Ecpp sieve(4): 0.050000
%T% Ecpp sieve(4): 0.040000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 9.980000s
%T% Ecpp sieve(7): 0.020000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 10.120000s
%T% Ecpp sieve(19): 0.020000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 10.250000s
%T% Ecpp sieve(43): 0.030000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 10.400000s
%T% Ecpp sieve(163): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-148)) where (h, g)=(-2, 2)
% next D is D_22 = 148 at 10.500000s
%T% Ecpp sieve(148): 0.020000
% Testing if N is a norm in Q(sqrt(-427)) where (h, g)=(-2, 2)
% next D is D_28 = 427 at 10.640000s
%T% Ecpp sieve(427): 0.020000
% Testing if N is a norm in Q(sqrt(-532)) where (h, g)=(-4, 4)
% next D is D_43 = 532 at 10.780000s
%T% Ecpp sieve(532): 0.020000
% Testing if N is a norm in Q(sqrt(-203)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-259)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-292)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-388)) where (h, g)=(4, 2)
% next D is D_82 = 388 at 11.050000s
%T% Ecpp sieve(388): 0.020000
% Testing if N is a norm in Q(sqrt(-1387)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-868)) where (h, g)=(8, 4)
% next D is D_109 = 868 at 11.230000s
%T% Ecpp sieve(868): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 11
% D[[1]]=868
% A[[1]]=-326895251092339884144090139638027083724241216689812454727451712780164890788892026310
% B[[1]]=-68587746783669111852913756421916471806275979440828856340037456085518145309628437206
% m[[1]]=1047543671219455618769162707080922187027390855978718722482795852516607202400496504900695841750905656059117353442948519783371812856884720135191610392165496193348388836948
% Factor [P]=971^1
% Factor [P]=151^1
% Factor [P]=47^1
% Factor [P]=13^1
% Factor [P]=11^1
% Factor [P]=2^2
% End of depth 1 at 11.420000 s

% N_2=265755385041716015685113999040790203687196043369920962646359279647878338001921647916545675863630929021746585274702382787140866094034642787760172743065142984057
% Pmax[527]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 11.460000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 11.560000s
%T% Ecpp sieve(4): 0.050000
%T% Ecpp sieve(4): 0.040000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[2]]=4
% A[[2]]=-27646015150206941416791257405304265146598848618526568417258870221884835991392072
% B[[2]]=-8641750205852289172508551623451102547198577547327793926718502230893855810057069
% m[[2]]=265755385041716015685113999040790203687196043369920962646359279647878338001921675562560826070572345813003990578967529385989484620603060046630394627901134376130
% Factor [P]=2153^1
% Factor [P]=37^1
% Factor [P]=5^1
% Factor [P]=2^1
% End of depth 2 at 11.860000 s

% N_3=333607894756174308237549113168037312721653059050126112710560097975017057282637269884335905989847410668964726251198866931107423482762029156840103222280833
% Pmax[507]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 11.900000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 11.990000s
%T% Ecpp sieve(4): 0.030000
%T% Ecpp sieve(4): 0.040000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 12.210000s
%T% Ecpp sieve(8): 0.040000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 12.330000s
%T% Ecpp sieve(11): 0.030000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 12.450000s
%T% Ecpp sieve(19): 0.020000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 12.560000s
%T% Ecpp sieve(67): 0.030000
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 12.680000s
%T% Ecpp sieve(88): 0.020000
% Testing if N is a norm in Q(sqrt(-148)) where (h, g)=(-2, 2)
% next D is D_22 = 148 at 12.790000s
%T% Ecpp sieve(148): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 8
% D[[3]]=148
% A[[3]]=-30951994160550329357158492999657630789521649085076337344154393268361327021298
% B[[3]]=-1594766856869671059804237176188113316268327301750699871754854838075313843044
% m[[3]]=333607894756174308237549113168037312721653059050126112710560097975017057282668221878496456319204569161964383881988388580192499820106183550108464549302132
% Factor [P]=2^2
% End of depth 3 at 12.960000 s

% N_4=83401973689043577059387278292009328180413264762531528177640024493754264320667055469624114079801142290491095970497097145048124955026545887527116137325533
% Pmax[505]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 12.990000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 13.080000s
%T% Ecpp sieve(3): 0.040000
% Extra square factor: 53
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 13.350000s
%T% Ecpp sieve(4): 0.040000
%T% Ecpp sieve(4): 0.040000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 13.580000s
%T% Ecpp sieve(11): 0.020000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 13.690000s
%T% Ecpp sieve(19): 0.020000
% Extra square factor: 159
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[4]]=19
% A[[4]]=-16448354565984029350746486639964062276930043426680286491287671886608908451361
% B[[4]]=-1821791004649959143355871681073003698193787600297412115110758513801683132337
% m[[4]]=83401973689043577059387278292009328180413264762531528177640024493754264320683503824190098109151888777131060032774027188474805241517833559413725045776895
% Factor [P]=11^1
% Factor [P]=7^1
% Factor [P]=5^1
% End of depth 4 at 13.870000 s

% N_5=216628503088424875478927995563660592676398090292289683578285777905855232001775334608285969114680230589950805279932538151882611016929437816659026092927
% Pmax[497]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 13.910000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 14.000000s
%T% Ecpp sieve(3): 0.030000
% No factor found, sieve only: no PRP test
% Extra square factor: 11
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 14.220000s
%T% Ecpp sieve(7): 0.030000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 14.350000s
%T% Ecpp sieve(11): 0.020000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 14.460000s
%T% Ecpp sieve(19): 0.030000
% Testing if N is a norm in Q(sqrt(-24)) where (h, g)=(-2, 2)
% next D is D_13 = 24 at 14.570000s
%T% Ecpp sieve(24): 0.020000
% Testing if N is a norm in Q(sqrt(-51)) where (h, g)=(-2, 2)
% next D is D_16 = 51 at 14.680000s
%T% Ecpp sieve(51): 0.020000
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 14.780000s
%T% Ecpp sieve(88): 0.020000
% Testing if N is a norm in Q(sqrt(-187)) where (h, g)=(-2, 2)
% next D is D_23 = 187 at 14.890000s
%T% Ecpp sieve(187): 0.020000
% Testing if N is a norm in Q(sqrt(-267)) where (h, g)=(-2, 2)
% next D is D_26 = 267 at 14.990000s
%T% Ecpp sieve(267): 0.030000
% Extra square factor: 7
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-408)) where (h, g)=(-4, 4)
% next D is D_39 = 408 at 15.130000s
%T% Ecpp sieve(408): 0.020000
% Testing if N is a norm in Q(sqrt(-483)) where (h, g)=(-4, 4)
% next D is D_41 = 483 at 15.230000s
%T% Ecpp sieve(483): 0.020000
% Testing if N is a norm in Q(sqrt(-627)) where (h, g)=(-4, 4)
% next D is D_46 = 627 at 15.340000s
%T% Ecpp sieve(627): 0.020000
% Extra square factor: 7
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-1848)) where (h, g)=(-8, 8)
% next D is D_62 = 1848 at 15.460000s
%T% Ecpp sieve(1848): 0.030000
% Testing if N is a norm in Q(sqrt(-56)) where (h, g)=(4, 2)
% next D is D_69 = 56 at 15.570000s
%T% Ecpp sieve(56): 0.020000
% Testing if N is a norm in Q(sqrt(-184)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-203)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-219)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-259)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-291)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-323)) where (h, g)=(4, 2)
% next D is D_79 = 323 at 15.830000s
%T% Ecpp sieve(323): 0.020000
% Testing if N is a norm in Q(sqrt(-667)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-723)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-1003)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-1243)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-1387)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-1411)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-952)) where (h, g)=(8, 4)
% next D is D_111 = 952 at 16.120000s
%T% Ecpp sieve(952): 0.020000
% Testing if N is a norm in Q(sqrt(-987)) where (h, g)=(8, 4)
% next D is D_112 = 987 at 16.230000s
%T% Ecpp sieve(987): 0.020000
% Testing if N is a norm in Q(sqrt(-1659)) where (h, g)=(8, 4)
% next D is D_122 = 1659 at 16.330000s
%T% Ecpp sieve(1659): 0.030000
% Testing if N is a norm in Q(sqrt(-1752)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-1771)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-1947)) where (h, g)=(8, 4)
% next D is D_128 = 1947 at 16.510000s
%T% Ecpp sieve(1947): 0.020000
% Extra square factor: 7
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-2163)) where (h, g)=(8, 4)
% next D is D_134 = 2163 at 16.630000s
%T% Ecpp sieve(2163): 0.020000
% Testing if N is a norm in Q(sqrt(-3243)) where (h, g)=(8, 4)
% next D is D_145 = 3243 at 16.740000s
%T% Ecpp sieve(3243): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-4323)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-3192)) where (h, g)=(16, 8)
% Testing if N is a norm in Q(sqrt(-8547)) where (h, g)=(16, 8)
% Testing if N is a norm in Q(sqrt(-14763)) where (h, g)=(16, 8)
% Testing if N is a norm in Q(sqrt(-23)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-59)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-83)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-107)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-139)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-211)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-307)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-547)) where (h, g)=(3, 1)
% next D is D_240 = 547 at 17.160000s
%T% Ecpp sieve(547): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 23
% D[[5]]=547
% A[[5]]=917778678383639575475279579980810857263020370797723171508172712004462337684
% B[[5]]=6650907466237937997088727733297979907477421737939124568680843159482597146
% m[[5]]=216628503088424875478927995563660592676398090292289683578285777905855232000857555929902329539204951009969994422669517781084887845421265104654563755244
% Factor [P]=2^2
% End of depth 5 at 17.290000 s

% N_6=54157125772106218869731998890915148169099522573072420894571444476463808000214388982475582384801237752492498605667379445271221961355316276163640938811
% Pmax[495]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 17.330000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 17.410000s
%T% Ecpp sieve(8): 0.040000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 17.540000s
%T% Ecpp sieve(67): 0.020000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 17.640000s
%T% Ecpp sieve(163): 0.030000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 17.760000s
%T% Ecpp sieve(40): 0.020000
% Testing if N is a norm in Q(sqrt(-136)) where (h, g)=(4, 2)
% next D is D_71 = 136 at 17.870000s
%T% Ecpp sieve(136): 0.020000
% Testing if N is a norm in Q(sqrt(-955)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-1003)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-1555)) where (h, g)=(4, 2)
% next D is D_96 = 1555 at 18.040000s
%T% Ecpp sieve(1555): 0.020000
% Testing if N is a norm in Q(sqrt(-59)) where (h, g)=(3, 1)
% next D is D_230 = 59 at 18.140000s
%T% Ecpp sieve(59): 0.030000
% Testing if N is a norm in Q(sqrt(-107)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-547)) where (h, g)=(3, 1)
% next D is D_240 = 547 at 18.280000s
%T% Ecpp sieve(547): 0.030000
% Testing if N is a norm in Q(sqrt(-907)) where (h, g)=(3, 1)
% next D is D_243 = 907 at 18.390000s
%T% Ecpp sieve(907): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-1315)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-3235)) where (h, g)=(6, 2)
% next D is D_291 = 3235 at 18.510000s
%T% Ecpp sieve(3235): 0.020000
% Testing if N is a norm in Q(sqrt(-680)) where (h, g)=(12, 4)
% next D is D_299 = 680 at 18.610000s
%T% Ecpp sieve(680): 0.020000
% Testing if N is a norm in Q(sqrt(-1480)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-2440)) where (h, g)=(12, 4)
% next D is D_335 = 2440 at 18.750000s
%T% Ecpp sieve(2440): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 13
% D[[6]]=2440
% A[[6]]=-362781361325502277132230404642106400687435335162756430008879685620331174198
% B[[6]]=-5902839930679943906511130395973861816196594139201742742148620324209030721
% m[[6]]=54157125772106218869731998890915148169099522573072420894571444476463808000577170343801084661933468157134605006354814780433978391364195961783972113010
% Factor [P]=5^1
% Factor [P]=2^1
% End of depth 6 at 18.910000 s

% N_7=5415712577210621886973199889091514816909952257307242089457144447646380800057717034380108466193346815713460500635481478043397839136419596178397211301
% Pmax[491]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 18.940000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 19.020000s
%T% Ecpp sieve(3): 0.030000
% No factor found, sieve only: no PRP test
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 19.220000s
%T% Ecpp sieve(4): 0.050000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[7]]=4
% A[[7]]=70920336511967091431899824958316435563781070691562835504711408899707572930
% B[[7]]=64484797002611078614330429915589162096574132290586874616191187488172344726
% m[[7]]=5415712577210621886973199889091514816909952257307242089457144447646380799986796697868141374761446990755144065071700407351835003631708187278689638372
% Factor [P]=103577^1
% Factor [P]=421^1
% Factor [P]=101^1
% Factor [P]=2^2
% End of depth 7 at 19.370000 s

% N_8=307417664247524947458164880132552577108278305561512346271333562621923374969370538685125341797386869547635472567834392395285370526534901129
% Pmax[457]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 19.400000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 19.470000s
%T% Ecpp sieve(4): 0.040000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[8]]=4
% A[[8]]=248568177129141209594457260810710111791918489509070084660648755512954
% B[[8]]=540343529226730832775785930884540500418987626987470567472074712581360
% m[[8]]=307417664247524947458164880132552577108278305561512346271333562621923126401193409543915747340126058837523680649344883325200709877779388176
% Factor [P]=97^1
% Factor [P]=2^4
% End of depth 8 at 19.590000 s

% N_9=198078391912065043465312422765819959476983444305098161257302553235775210310047299963863239265545141003559072583340775338402519251146513
% Pmax[447]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 19.620000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 19.680000s
%T% Ecpp sieve(4): 0.030000
%T% Ecpp sieve(4): 0.030000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 19.840000s
%T% Ecpp sieve(8): 0.030000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 19.930000s
%T% Ecpp sieve(163): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 20.000000s
%T% Ecpp sieve(52): 0.010000
% Testing if N is a norm in Q(sqrt(-148)) where (h, g)=(-2, 2)
% next D is D_22 = 148 at 20.080000s
%T% Ecpp sieve(148): 0.020000
% Testing if N is a norm in Q(sqrt(-232)) where (h, g)=(-2, 2)
% next D is D_24 = 232 at 20.160000s
%T% Ecpp sieve(232): 0.020000
% Testing if N is a norm in Q(sqrt(-292)) where (h, g)=(4, 2)
% next D is D_78 = 292 at 20.250000s
%T% Ecpp sieve(292): 0.020000
% Testing if N is a norm in Q(sqrt(-772)) where (h, g)=(4, 2)
% next D is D_87 = 772 at 20.330000s
%T% Ecpp sieve(772): 0.010000
% Testing if N is a norm in Q(sqrt(-1027)) where (h, g)=(4, 2)
% next D is D_90 = 1027 at 20.410000s
%T% Ecpp sieve(1027): 0.020000
% Testing if N is a norm in Q(sqrt(-3172)) where (h, g)=(8, 4)
% next D is D_144 = 3172 at 20.490000s
%T% Ecpp sieve(3172): 0.020000
% Extra square factor: 73
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-83)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-107)) where (h, g)=(3, 1)
% next D is D_232 = 107 at 20.620000s
%T% Ecpp sieve(107): 0.020000
% Extra square factor: 73
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-139)) where (h, g)=(3, 1)
% next D is D_233 = 139 at 20.720000s
%T% Ecpp sieve(139): 0.010000
% Testing if N is a norm in Q(sqrt(-211)) where (h, g)=(3, 1)
% next D is D_234 = 211 at 20.800000s
%T% Ecpp sieve(211): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 14
% D[[9]]=211
% A[[9]]=9298383812149453408405439823587306344482145894211185593797608039214
% B[[9]]=1829010073498332382475100322906627543094121864934147503980150248064
% m[[9]]=198078391912065043465312422765819959476983444305098161257302553235765911926235150510454833825721553697214590437446564152808721643107300
% Factor [P]=19^1
% Factor [P]=5^2
% Factor [P]=2^2
% End of depth 9 at 20.890000 s

% N_10=104251785216876338665953906718852610251043918055314821714369764860929427329597447637081491487221870366955047598656086396215116654267
% Pmax[436]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 20.920000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[10]]=-1
% Factor [P]=21937^1
% Factor [P]=29^1
% Factor [P]=7^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 10 at 20.990000 s

% N_11=3901745849488393081829190469485674129335885127058311471369376870641934075943457714634881492898115927546626752346269032847501
% Pmax[411]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 21.010000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 21.060000s
%T% Ecpp sieve(4): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[11]]=4
% A[[11]]=-74013090439260686517233373996544956768085936762413291018576730
% B[[11]]=-50321580464010146898759898181596950823467704826010320836115674
% m[[11]]=3901745849488393081829190469485674129335885127058311471369376944655024515204144231868255489443072695632563514759560051424232
% Factor [P]=2^3
% End of depth 11 at 21.180000 s

% N_12=487718231186049135228648808685709266166985640882288933921172118081878064400518028983531936180384086954070439344945006428029
% Pmax[408]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 21.200000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[12]]=1
% Factor [P]=7^1
% Factor [P]=5^1
% Factor [P]=3^2
% Factor [P]=2^1
% End of depth 12 at 21.290000 s

% N_13=774155922517538309886744140770967089153945461717918942732019235050600102223044490450050692349816011038207046579277787981
% Pmax[399]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 21.310000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 21.360000s
%T% Ecpp sieve(4): 0.030000
%T% Ecpp sieve(4): 0.030000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 21.500000s
%T% Ecpp sieve(7): 0.020000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 21.570000s
%T% Ecpp sieve(11): 0.020000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 21.640000s
%T% Ecpp sieve(20): 0.020000
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 21.710000s
%T% Ecpp sieve(35): 0.020000
% Testing if N is a norm in Q(sqrt(-148)) where (h, g)=(-2, 2)
% next D is D_22 = 148 at 21.780000s
%T% Ecpp sieve(148): 0.010000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-187)) where (h, g)=(-2, 2)
% next D is D_23 = 187 at 21.860000s
%T% Ecpp sieve(187): 0.020000
% Testing if N is a norm in Q(sqrt(-340)) where (h, g)=(-4, 4)
% next D is D_37 = 340 at 21.920000s
%T% Ecpp sieve(340): 0.020000
% Testing if N is a norm in Q(sqrt(-595)) where (h, g)=(-4, 4)
% next D is D_45 = 595 at 21.990000s
%T% Ecpp sieve(595): 0.010000
% Testing if N is a norm in Q(sqrt(-1540)) where (h, g)=(-8, 8)
% next D is D_61 = 1540 at 22.050000s
%T% Ecpp sieve(1540): 0.020000
% Testing if N is a norm in Q(sqrt(-55)) where (h, g)=(4, 2)
% next D is D_68 = 55 at 22.120000s
%T% Ecpp sieve(55): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 12
% D[[13]]=55
% A[[13]]=-1733815666925588677363112714834990113591794236834268889763602
% B[[13]]=-40565754297196721349013518213709334406580233904837717284308
% m[[13]]=774155922517538309886744140770967089153945461717918942732020968866267027811721853562765527339929602832443880848167551584
% Factor [P]=2^5
% End of depth 13 at 22.210000 s

% N_14=24192372578673072183960754399092721536060795678684966960375655277070844619116307923836422729372800088513871276505235987
% Pmax[394]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 22.240000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 22.280000s
%T% Ecpp sieve(8): 0.030000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 22.360000s
%T% Ecpp sieve(19): 0.020000
% Testing if N is a norm in Q(sqrt(-232)) where (h, g)=(-2, 2)
% next D is D_24 = 232 at 22.420000s
%T% Ecpp sieve(232): 0.020000
% Testing if N is a norm in Q(sqrt(-667)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-23)) where (h, g)=(3, 1)
% next D is D_228 = 23 at 22.510000s
%T% Ecpp sieve(23): 0.010000
% Testing if N is a norm in Q(sqrt(-31)) where (h, g)=(3, 1)
% next D is D_229 = 31 at 22.560000s
%T% Ecpp sieve(31): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 6
% D[[14]]=31
% A[[14]]=104755934403007151108208596104806420746572223529849316031428
% B[[14]]=52608010098440194976498019319498074549075596765108418405038
% m[[14]]=24192372578673072183960754399092721536060795678684966960375550521136441611965199715240317922952053516290341427189204560
% Factor [P]=7^1
% Factor [P]=5^1
% Factor [P]=2^4
% End of depth 14 at 22.640000 s

% N_15=43200665319059057471358489998379859885822849426223155286384911644886502878509285205786282005271524136232752548552151
% Pmax[385]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 22.670000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 22.710000s
%T% Ecpp sieve(3): 0.030000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 22.850000s
%T% Ecpp sieve(7): 0.020000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 22.920000s
%T% Ecpp sieve(163): 0.020000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-15)) where (h, g)=(-2, 2)
% next D is D_11 = 15 at 23.000000s
%T% Ecpp sieve(15): 0.020000
% Testing if N is a norm in Q(sqrt(-24)) where (h, g)=(-2, 2)
% next D is D_13 = 24 at 23.060000s
%T% Ecpp sieve(24): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 6
% D[[15]]=24
% A[[15]]=7332901031027707032422331700341771206572897292727733834510
% B[[15]]=2227023646646919316144276404045677969896189441744697256039
% m[[15]]=43200665319059057471358489998379859885822849426223155286377578743855475171476862874085940234064951238940024814717642
% Factor [P]=6203^1
% Factor [P]=2^1
% End of depth 15 at 23.130000 s

% N_16=3482239667826781998336167177041742695939291425618503569754762110579999610791299602940991474614295602042562051807
% Pmax[371]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 23.150000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 23.190000s
%T% Ecpp sieve(3): 0.020000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 23.300000s
%T% Ecpp sieve(7): 0.020000
% Extra square factor: 3
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[16]]=7
% A[[16]]=-74043479597563081116822335142497524178755730948313282584
% B[[16]]=-34736810036107616369739130246844060910124560726155262186
% m[[16]]=3482239667826781998336167177041742695939291425618503569828805590177562691908121938083488998793051332990875334392
% Factor [P]=2^3
% End of depth 16 at 23.400000 s

% N_17=435279958478347749792020897130217836992411428202312946228600698772195336488515242260436124849131416623859416799
% Pmax[368]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 23.420000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 23.460000s
%T% Ecpp sieve(7): 0.010000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 23.510000s
%T% Ecpp sieve(19): 0.010000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 23.570000s
%T% Ecpp sieve(43): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[17]]=43
% A[[17]]=41000625171144661198282028194758607046821513730662709677
% B[[17]]=1181923633946440138223883809980220986775255239642495787
% m[[17]]=435279958478347749792020897130217836992411428202312946187600073601050675290233214065677517802309902893196707123
% Factor [P]=24077^1
% Factor [P]=17^1
% End of depth 17 at 23.620000 s

% N_18=1063450738875391818386648955019845244039127964941677183222455586368857453147214486037877295154296394394447
% Pmax[349]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 23.640000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[18]]=-1
% Factor [P]=24517^1
% Factor [P]=569^1
% Factor [P]=11^1
% Factor [P]=2^1
% End of depth 18 at 23.680000 s

% N_19=3465094658602545379924838582874548137858961465410035296930972522279040922507212198071852178836441
% Pmax[321]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 23.700000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 23.730000s
%T% Ecpp sieve(4): 0.020000
%T% Ecpp sieve(4): 0.020000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 23.820000s
%T% Ecpp sieve(8): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[19]]=8
% A[[19]]=493806907231311693590228241967179040109917934154
% B[[19]]=1304632772697974014388925240729990617608362016984
% m[[19]]=3465094658602545379924838582874548137858961465409541490023741210585450694265245019031742260902288
% Factor [P]=97^1
% Factor [P]=3^1
% Factor [P]=2^4
% End of depth 19 at 23.870000 s

% N_20=744221361383708200155678389792643500399261483120605990125373971345672399971057779001662856723
% Pmax[309]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 23.890000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 23.910000s
%T% Ecpp sieve(7): 0.020000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 23.950000s
%T% Ecpp sieve(8): 0.020000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 24.000000s
%T% Ecpp sieve(19): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[20]]=19
% A[[20]]=54332307670539562896765690154244730479038620559
% B[[20]]=1144455483686469289202736689607901432099465187
% m[[20]]=744221361383708200155678389792643500399261483066273682454834408448906709816813048522624236165
% Factor [P]=2683^1
% Factor [P]=139^1
% Factor [P]=11^1
% Factor [P]=7^2
% Factor [P]=5^1
% End of depth 20 at 24.040000 s

% N_21=740470717995854826351420777996623333938844439130523169538639747321179262797203710331
% Pmax[279]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 24.060000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 24.080000s
%T% Ecpp sieve(7): 0.010000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 24.110000s
%T% Ecpp sieve(8): 0.020000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 24.150000s
%T% Ecpp sieve(19): 0.020000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 24.190000s
%T% Ecpp sieve(67): 0.010000
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 24.220000s
%T% Ecpp sieve(35): 0.010000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 24.260000s
%T% Ecpp sieve(40): 0.010000
% Testing if N is a norm in Q(sqrt(-232)) where (h, g)=(-2, 2)
% next D is D_24 = 232 at 24.290000s
%T% Ecpp sieve(232): 0.010000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-235)) where (h, g)=(-2, 2)
% next D is D_25 = 235 at 24.340000s
%T% Ecpp sieve(235): 0.010000
% Testing if N is a norm in Q(sqrt(-427)) where (h, g)=(-2, 2)
% next D is D_28 = 427 at 24.370000s
%T% Ecpp sieve(427): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 10
% D[[21]]=427
% A[[21]]=-1631867814433800353936342344272241391082781
% B[[21]]=-26457084166108171233394863514833466558637
% m[[21]]=740470717995854826351420777996623333938846070998337603338993683663523535038594793113
% Factor [P]=109^1
% Factor [P]=59^1
% Factor [P]=7^1
% End of depth 21 at 24.410000 s

% N_22=16448690894458867235742514561090773128792368905043374799275688821190295555869889
% Pmax[264]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 24.430000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 24.450000s
%T% Ecpp sieve(4): 0.020000
%T% Ecpp sieve(4): 0.020000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 24.520000s
%T% Ecpp sieve(7): 0.020000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 24.550000s
%T% Ecpp sieve(8): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[22]]=8
% A[[22]]=5166226465976509505573711131726966449858
% B[[22]]=2210906705406159099261348716786962052368
% m[[22]]=16448690894458867235742514561090773128787202678577398289770115110058568589420032
% Factor [P]=21739^1
% Factor [P]=211^1
% Factor [P]=59^1
% Factor [P]=3^1
% Factor [P]=2^9
% End of depth 22 at 24.590000 s

% N_23=39570004002320820983357408501159689001925353310586089119569332764467
% Pmax[225]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 24.610000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 24.620000s
%T% Ecpp sieve(3): 0.020000
% Extra square factor: 11
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 24.680000s
%T% Ecpp sieve(7): 0.010000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 24.710000s
%T% Ecpp sieve(8): 0.020000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 24.740000s
%T% Ecpp sieve(11): 0.010000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 24.770000s
%T% Ecpp sieve(19): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 6
% D[[23]]=19
% A[[23]]=8293282820090111642553146780657947
% B[[23]]=2170392592127558756465901923452881
% m[[23]]=39570004002320820983357408501159680708642533220474446566422552106521
% Factor [P]=1013^1
% Factor [P]=73^1
% End of depth 23 at 24.790000 s

% N_24=535098567963337178100547789708578624574267849740692187405138029
% Pmax[209]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 24.810000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 24.820000s
%T% Ecpp sieve(4): 0.020000
%T% Ecpp sieve(4): 0.020000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 24.880000s
%T% Ecpp sieve(7): 0.020000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 24.910000s
%T% Ecpp sieve(11): 0.010000
% Extra square factor: 43
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[24]]=11
% A[[24]]=41127939586374784168347538879755
% B[[24]]=6388105831314764335875859043159
% m[[24]]=535098567963337178100547789708537496634681474956523839866258275
% Factor [P]=43^2
% Factor [P]=191^1
% Factor [P]=103^1
% Factor [P]=59^1
% Factor [P]=5^2
% Factor [P]=3^1
% End of depth 24 at 24.950000 s

% N_25=3324397986258995794356735971065196832410014811250139
% Pmax[172]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 24.960000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 24.960000s
%T% Ecpp sieve(3): 0.020000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 24.990000s
%T% Ecpp sieve(8): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[25]]=8
% A[[25]]=-110281727909274391182404822
% B[[25]]=-11913922708226460737650647
% m[[25]]=3324397986258995794356736081346924741684405993654962
% Factor [P]=467^1
% Factor [P]=2^1
% End of depth 25 at 25.020000 s

% N_26=3559312619120980507876591093519191372253111342243
% Pmax[162]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 25.030000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[26]]=1
% Factor [P]=7^1
% Factor [P]=2^2
% End of depth 26 at 25.040000 s

% N_27=127118307825749303852735396197113977580468262223
% Pmax[157]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 25.050000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[27]]=1
% Factor [P]=569^1
% Factor [P]=3^1
% Factor [P]=2^4
% End of depth 27 at 25.060000 s

% N_28=4654302424785782947156392655137447919612927
% Pmax[142]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 25.070000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 25.070000s
%T% Ecpp sieve(3): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[28]]=3
% A[[28]]=3816824511516471738860
% B[[28]]=1161760208681949232006
% m[[28]]=4654302424785782947152575830625931447874068
% Factor [P]=61^2
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 28 at 25.090000 s

% N_29=104235026981675690834734744930259147359
% Pmax[127]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 25.090000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 25.090000s
%T% Ecpp sieve(3): 0.010000
% No factor found, sieve only: no PRP test
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[29]]=3
% A[[29]]=12999923638841645332
% B[[29]]=-9091059588243623398
% m[[29]]=104235026981675690821734821291417502028
% Factor [P]=2^2
% End of depth 29 at 25.110000 s

% N_30=26058756745418922705433705322854375507
% Pmax[125]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 25.110000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[30]]=-1
% Factor [P]=1997^1
% Factor [P]=173^1
% Factor [P]=67^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 30 at 25.110000 s

% N_31=187630515060680362169182693913
% Pmax[98]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 25.110000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.010000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 25.120000s
%T% Ecpp sieve(4): 0.000000
%T% Ecpp sieve(4): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[31]]=4
% A[[31]]=668844973595704
% B[[31]]=275303678480003
% m[[31]]=187630515060679693324209098210
% Factor [P]=97^1
% Factor [P]=17^1
% Factor [P]=5^1
% Factor [P]=2^1
% End of depth 31 at 25.130000 s

% N_32=11378442393006652111838029
% Pmax[84]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 25.130000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[32]]=1
% Factor [P]=59^1
% Factor [P]=11^1
% Factor [P]=5^1
% Factor [P]=2^1
% End of depth 32 at 25.130000 s

% N_33=1753226871033382451747
% Pmax[71]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 25.140000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 25.140000s
%T% Ecpp sieve(8): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[33]]=8
% A[[33]]=-74380684290
% B[[33]]=-13603406231
% m[[33]]=1753226871107763136038
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 33 at 25.140000 s

% N_34=292204478517960522673
% Pmax[68]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 25.150000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[34]]=-1
% Factor [P]=103^1
% Factor [P]=29^1
% Factor [P]=19^1
% Factor [P]=3^3
% Factor [P]=2^4
% End of depth 34 at 25.150000 s

% N_35=11918299575857
% Pmax[44]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 25.150000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[35]]=-1
% Factor [P]=2^4
% End of depth 35 at 25.150000 s

% N_36=744893723491
% Pmax[40]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 25.150000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[36]]=-1
% Factor [P]=31^1
% Factor [P]=23^1
% Factor [P]=7^1
% Factor [P]=5^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 36 at 25.150000 s

% N_37=4974913
% Pmax[23]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 25.150000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Factorization completed using sieve only
% Number of D tried was 1
% D[[37]]=-1
% Factor [P]=2879^1
% Factor [P]=3^3
% Factor [P]=2^6
% Cofactor is 1
% End of depth 37 at 25.150000 s

% N_38=2879
% Pmax[12]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 25.160000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Factorization completed using sieve only
% Number of D tried was 1
% D[[38]]=-1
% Factor [P]=1439^1
% Factor [P]=2^1
% Cofactor is 1
% End of depth 38 at 25.160000 s

% N_39=1439
% Pmax[11]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 25.160000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Factorization completed using sieve only
% Number of D tried was 1
% D[[39]]=-1
% Factor [P]=719^1
% Factor [P]=2^1
% Cofactor is 1
% End of depth 39 at 25.160000 s

% N_40=719
% Pmax[10]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 25.160000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Factorization completed using sieve only
% Number of D tried was 1
% D[[40]]=-1
% Factor [P]=359^1
% Factor [P]=2^1
% Cofactor is 1
% End of depth 40 at 25.160000 s

% N_41=359
% Pmax[9]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 25.160000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Factorization completed using sieve only
% Number of D tried was 1
% D[[41]]=-1
% Factor [P]=179^1
% Factor [P]=2^1
% Cofactor is 1
% End of depth 41 at 25.160000 s

% N_42=179
% Pmax[8]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 25.160000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Factorization completed using sieve only
% Number of D tried was 1
% D[[42]]=-1
% Factor [P]=89^1
% Factor [P]=2^1
% Cofactor is 1
% End of depth 42 at 25.160000 s


% Time for building is 16.360000 s

% Starting phase 2: proving
% Starting proving job for step 0
% D=7 h=-1 g=1 invcode=2 (f/sqrt(2)) g0=1
%T% one root in GetInvariant: 0.000000s
% u has been computed
% E found
%T% find E: 0.000000
% Suggested twist(7)=-1
% Entering AEcModProveLarge
%T% ProveStep(7): 0.490000
% N_0 is prime
% Time for proof[0] is 0.490000 s

% Starting proving job for step 1
% D=868 h=8 g=4 invcode=5 (f^2/sqrt(2)) g0=4
%T% one root in GetInvariant: 0.050000s
% u has been computed
%T% FindJ: 0.150000
% E found
%T% find E: 0.150000
% Entering AEcModProveLarge
%T% ProveStep(868): 0.620000
% N_1 is prime
% Time for proof[1] is 0.620000 s

% Starting proving job for step 2
% E found
%T% find E: 0.080000
% Suggested twist(4)=1
% Entering AEcModProveLarge
%T% ProveStep(4): 0.480000
% N_2 is prime
% Time for proof[2] is 0.480000 s

% Starting proving job for step 3
% D=148 h=-2 g=2 invcode=4 (f^4) g0=2
%T% one root in GetInvariant: 0.000000s
% u has been computed
% Using the 8 | D theorem (even if D=4 mod 8)
% E found
%T% find E: 0.080000
% Suggested twist(148)=-1
% Entering AEcModProveLarge
%T% ProveStep(148): 0.420000
% N_3 is prime
% Time for proof[3] is 0.420000 s

% Starting proving job for step 4
% D=19 h=-1 g=1 invcode=1 (gamma2) g0=1
%T% one root in GetInvariant: 0.000000s
% u has been computed
% E found
%T% find E: 0.000000
% Suggested twist(19)=1
% Entering AEcModProveLarge
%T% ProveStep(19): 0.340000
% N_4 is prime
% Time for proof[4] is 0.340000 s

% Starting proving job for step 5
% D=547 h=3 g=1 invcode=11 (Stark's) g0=1
%T% one root in FindG2G3s: 0.080000s
% Using Stark's theorem
% E found
%T% find E: 0.080000
% Suggested twist(547)=-1
% Entering AEcModProveLarge
%T% ProveStep(547): 0.430000
% N_5 is prime
% Time for proof[5] is 0.430000 s

% Starting proving job for step 6
% D=2440 h=12 g=4 invcode=3 (f1^2/sqrt(2)) g0=4
%T% Factor of degree 1 found: 0.700000
%T% one root in GetInvariant: 0.700000s
% u has been computed
%T% FindJ: 0.770000
% E found
%T% find E: 0.770000
% Entering AEcModProveLarge
% Twisting
%T% ProveStep(2440): 1.460000
% N_6 is prime
% Time for proof[6] is 1.460000 s

% Starting proving job for step 7
% E found
%T% find E: 0.000000
% Suggested twist(4)=1
% Entering AEcModProveLarge
%T% ProveStep(4): 0.330000
% N_7 is prime
% Time for proof[7] is 0.330000 s

% Starting proving job for step 8
% E found
%T% find E: 0.000000
% Suggested twist(4)=1
% Entering AEcModProveLarge
%T% ProveStep(4): 0.270000
% N_8 is prime
% Time for proof[8] is 0.270000 s

% Starting proving job for step 9
% D=211 h=3 g=1 invcode=11 (Stark's) g0=1
%T% Factor of degree 1 found: 0.510000
%T% one root in FindG2G3s: 0.510000s
% Using Stark's theorem
% E found
%T% find E: 0.510000
% Suggested twist(211)=1
% Entering AEcModProveLarge
%T% ProveStep(211): 0.760000
% N_9 is prime
% Time for proof[9] is 0.760000 s

% Starting proving job for step 10
%T% ProveStep(-1): 0.030000
% N_10 is prime
% Time for proof[10] is 0.030000 s

% Starting proving job for step 11
% E found
%T% find E: 0.000000
% Suggested twist(4)=1
% Entering AEcModProveLarge
%T% ProveStep(4): 0.200000
% N_11 is prime
% Time for proof[11] is 0.200000 s

% Starting proving job for step 12
%T% ProveStep(1): 0.090000
% N_12 is prime
% Time for proof[12] is 0.090000 s

% Starting proving job for step 13
% D=55 h=4 g=2 invcode=12 (Stark's with f/sqrt(2)) g0=2
%T% one root in FindG2G3s: 0.020000s
% Using Stark's theorem
% E found
%T% find E: 0.040000
% Suggested twist(55)=-1
% Entering AEcModProveLarge
%T% ProveStep(55): 0.240000
% N_13 is prime
% Time for proof[13] is 0.240000 s

% Starting proving job for step 14
% D=31 h=3 g=1 invcode=12 (Stark's with f/sqrt(2)) g0=1
%T% Factor of degree 1 found: 0.310000
%T% one root in FindG2G3s: 0.310000s
% Using Stark's theorem
% E found
%T% find E: 0.310000
% Suggested twist(31)=-1
% Entering AEcModProveLarge
%T% ProveStep(31): 0.500000
% N_14 is prime
% Time for proof[14] is 0.500000 s

% Starting proving job for step 15
% Entering FindEForD0mod3
% D=24 h=-2 g=2 invcode=10 (w3) g0=2
%T% one root in GetInvariant: 0.000000s
% u has been computed
%T% FindW: 0.020000
% E found
%T% find E: 0.020000
% Suggested twist(24)=-1
% Entering AEcModProveLarge
%T% ProveStep(24): 0.200000
% N_15 is prime
% Time for proof[15] is 0.200000 s

% Starting proving job for step 16
% D=7 h=-1 g=1 invcode=2 (f/sqrt(2)) g0=1
%T% one root in GetInvariant: 0.000000s
% u has been computed
% E found
%T% find E: 0.000000
% Suggested twist(7)=1
% Entering AEcModProveLarge
%T% ProveStep(7): 0.160000
% N_16 is prime
% Time for proof[16] is 0.160000 s

% Starting proving job for step 17
% D=43 h=-1 g=1 invcode=1 (gamma2) g0=1
%T% one root in GetInvariant: 0.000000s
% u has been computed
% E found
%T% find E: 0.000000
% Suggested twist(43)=-1
% Entering AEcModProveLarge
%T% ProveStep(43): 0.150000
% N_17 is prime
% Time for proof[17] is 0.150000 s

% Starting proving job for step 18
%T% ProveStep(-1): 0.020000
% N_18 is prime
% Time for proof[18] is 0.020000 s

% Starting proving job for step 19
% D=8 h=-1 g=1 invcode=3 (f1^2/sqrt(2)) g0=1
%T% one root in GetInvariant: 0.000000s
% u has been computed
% E found
%T% find E: 0.000000
% Suggested twist(8)=-1
% Entering AEcModProveLarge
%T% ProveStep(8): 0.110000
% N_19 is prime
% Time for proof[19] is 0.110000 s

% Starting proving job for step 20
% D=19 h=-1 g=1 invcode=1 (gamma2) g0=1
%T% one root in GetInvariant: 0.000000s
% u has been computed
% E found
%T% find E: 0.000000
% Suggested twist(19)=1
% Entering AEcModProveLarge
%T% ProveStep(19): 0.100000
% N_20 is prime
% Time for proof[20] is 0.100000 s

% Starting proving job for step 21
% D=427 h=-2 g=2 invcode=11 (Stark's) g0=2
%T% one root in FindG2G3s: 0.000000s
% Using Stark's theorem
% E found
%T% find E: 0.010000
% Suggested twist(427)=1
% Entering AEcModProveLarge
%T% ProveStep(427): 0.090000
% N_21 is prime
% Time for proof[21] is 0.090000 s

% Starting proving job for step 22
% D=8 h=-1 g=1 invcode=3 (f1^2/sqrt(2)) g0=1
%T% one root in GetInvariant: 0.000000s
% u has been computed
% E found
%T% find E: 0.000000
% Suggested twist(8)=-1
% Entering AEcModProveLarge
%T% ProveStep(8): 0.070000
% N_22 is prime
% Time for proof[22] is 0.070000 s

% Starting proving job for step 23
% D=19 h=-1 g=1 invcode=1 (gamma2) g0=1
%T% one root in GetInvariant: 0.000000s
% u has been computed
% E found
%T% find E: 0.000000
% Suggested twist(19)=-1
% Entering AEcModProveLarge
%T% ProveStep(19): 0.050000
% N_23 is prime
% Time for proof[23] is 0.050000 s

% Starting proving job for step 24
% D=11 h=-1 g=1 invcode=1 (gamma2) g0=1
%T% one root in GetInvariant: 0.000000s
% u has been computed
% E found
%T% find E: 0.000000
% Suggested twist(11)=1
% Entering AEcModProveLarge
%T% ProveStep(11): 0.050000
% N_24 is prime
% Time for proof[24] is 0.050000 s

% Starting proving job for step 25
% D=8 h=-1 g=1 invcode=3 (f1^2/sqrt(2)) g0=1
%T% one root in GetInvariant: 0.000000s
% u has been computed
% E found
%T% find E: 0.000000
% Suggested twist(8)=-1
% Entering AEcModProveLarge
%T% ProveStep(8): 0.020000
% N_25 is prime
% Time for proof[25] is 0.020000 s

% Starting proving job for step 26
%T% ProveStep(1): 0.020000
% N_26 is prime
% Time for proof[26] is 0.020000 s

% Starting proving job for step 27
%T% ProveStep(1): 0.010000
% N_27 is prime
% Time for proof[27] is 0.010000 s

% Starting proving job for step 28
% M = 1 mod 2: 2 is not a cube
% E found
%T% find E: 0.000000
% Suggested twist(3)=1
% Entering AEcModProveLarge
%T% ProveStep(3): 0.020000
% N_28 is prime
% Time for proof[28] is 0.020000 s

% Starting proving job for step 29
% M = 1 mod 2: 2 is not a cube
% E found
%T% find E: 0.000000
% Suggested twist(3)=1
% Entering AEcModProveLarge
%T% ProveStep(3): 0.010000
% N_29 is prime
% Time for proof[29] is 0.010000 s

% Starting proving job for step 30
%T% ProveStep(-1): 0.000000
% N_30 is prime
% Time for proof[30] is 0.000000 s

% Starting proving job for step 31
% E found
%T% find E: 0.000000
% Suggested twist(4)=1
% Entering AEcModProveLarge
%T% ProveStep(4): 0.010000
% N_31 is prime
% Time for proof[31] is 0.010000 s

% Starting proving job for step 32
%T% ProveStep(1): 0.000000
% N_32 is prime
% Time for proof[32] is 0.000000 s

% Starting proving job for step 33
% D=8 h=-1 g=1 invcode=3 (f1^2/sqrt(2)) g0=1
%T% one root in GetInvariant: 0.000000s
% u has been computed
% E found
%T% find E: 0.000000
% Suggested twist(8)=-1
% Entering AEcModProveLarge
%T% ProveStep(8): 0.000000
% N_33 is prime
% Time for proof[33] is 0.000000 s

% Starting proving job for step 34
%T% ProveStep(-1): 0.000000
% N_34 is prime
% Time for proof[34] is 0.000000 s

% Starting proving job for step 35
%T% ProveStep(-1): 0.000000
% N_35 is prime
% Time for proof[35] is 0.000000 s

% Starting proving job for step 36
%T% ProveStep(-1): 0.000000
% N_36 is prime
% Time for proof[36] is 0.000000 s

% Starting proving job for step 37
%T% ProveStep(-1): 0.000000
% N_37 is prime
% Time for proof[37] is 0.000000 s

% Starting proving job for step 38
%T% ProveStep(-1): 0.000000
% N_38 is prime
% Time for proof[38] is 0.000000 s

% Starting proving job for step 39
%T% ProveStep(-1): 0.000000
% N_39 is prime
% Time for proof[39] is 0.000000 s

% Starting proving job for step 40
%T% ProveStep(-1): 0.000000
% N_40 is prime
% Time for proof[40] is 0.000000 s

% Starting proving job for step 41
%T% ProveStep(-1): 0.000000
% N_41 is prime
% Time for proof[41] is 0.000000 s

% Starting proving job for step 42
% Using complete factorization theorem
%T% ProveStep(-1): 0.000000
% N_42 is prime
% Time for proof[42] is 0.000000 s
% Time for proving  is 7.750000 s
% Total time is        24.110000 s
This number is prime
%T% PrintCertif: 0.060000
% Time for this number is 24.340000s

Working on 144543983809824872363049565316045475677210744069766796011008767043043427444596128231874691917981021047646702432739328698890774433
% Performing a quick factorization
% This number might be prime
% Entering ECPP: delay mode
% Starting phase 1: building the sequence of primes
% N_0=144543983809824872363049565316045475677210744069766796011008767043043427444596128231874691917981021047646702432739328698890774433
% Pmax[426]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 33.070000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[0]]=1
% Factor [P]=163^1
% Factor [P]=2^1
% End of depth 0 at 33.160000 s

% N_1=443386453404370774119783942687256060359542159723211030708615849825286587253362356539492919993806813029591111756869106438315259
% Pmax[418]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 33.190000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[1]]=1
% Factor [P]=491^1
% Factor [P]=5^1
% Factor [P]=2^2
% End of depth 1 at 33.270000 s

% N_2=45151370000445089014234617381594303498935046814990939990694078393613705422949323476526773930122893383868748651412332631193
% Pmax[405]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 33.300000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 33.350000s
%T% Ecpp sieve(4): 0.030000
%T% Ecpp sieve(4): 0.040000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 33.500000s
%T% Ecpp sieve(8): 0.030000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 33.580000s
%T% Ecpp sieve(11): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[2]]=11
% A[[2]]=13034053372592951877392316871603672298527421810506104787178406
% B[[2]]=987141542866373749857210667740077644152323837739232989600776
% m[[2]]=45151370000445089014234617381594303498935046814990939990694065359560332829997446084209902326450594856446938145307545452788
% Factor [P]=3019^1
% Factor [P]=67^1
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 2 at 33.660000 s

% N_3=18601662934270799453475672886640952037977983062079030151780870967932914439889590670451115706022139573928526523274463
% Pmax[383]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 33.680000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 33.720000s
%T% Ecpp sieve(7): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[3]]=7
% A[[3]]=23824819113684430801390655182927834427212753784248340320
% B[[3]]=3260282286531060444871588396418967038666523260863320672806
% m[[3]]=18601662934270799453475672886640952037977983062079030151780847143113800755458789279795932778187712361174742274934144
% Factor [P]=2207^1
% Factor [P]=2^7
% End of depth 3 at 33.790000 s

% N_4=65847526811957689501712140655587873945039869810825746742540946219110361758958672971638298518165610703070989589
% Pmax[365]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 33.810000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[4]]=1
% Factor [P]=4327^1
% Factor [P]=5^1
% Factor [P]=3^2
% Factor [P]=2^1
% End of depth 4 at 33.870000 s

% N_5=169086939403635286191901344671925311211359858795741845113475968002234963302669730045549388897017720008913
% Pmax[347]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 33.890000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 33.920000s
%T% Ecpp sieve(4): 0.020000
%T% Ecpp sieve(4): 0.030000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 34.020000s
%T% Ecpp sieve(7): 0.020000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 34.070000s
%T% Ecpp sieve(8): 0.020000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 34.130000s
%T% Ecpp sieve(11): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[5]]=11
% A[[5]]=21249502437734576431739318333104044210926350973367774
% B[[5]]=4520724034561212131126057506777911388895779547733304
% m[[5]]=169086939403635286191901344671925311211359858795741823863973530267658531563351396941505177970666746641140
% Factor [P]=5^1
% Factor [P]=3^2
% Factor [P]=2^2
% End of depth 5 at 34.180000 s

% N_6=939371885575751589955007470399585062285332548865232354799852945931436286463063316341695433170370814673
% Pmax[339]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 34.200000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 34.230000s
%T% Ecpp sieve(3): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 34.320000s
%T% Ecpp sieve(4): 0.020000
%T% Ecpp sieve(4): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[6]]=4
% A[[6]]=-1591734891587956833591147692272707827322903172259136
% B[[6]]=-553142743151458524496261149495970446879742831217993
% m[[6]]=939371885575751589955007470399585062285332548865233946534744533888269877610755589049522756073543073810
% Factor [P]=53593^1
% Factor [P]=73^1
% Factor [P]=7^2
% Factor [P]=5^1
% Factor [P]=2^1
% End of depth 6 at 34.430000 s

% N_7=490016325677075486882491361377812043696957880858335210177805212059278704537272059781069842021
% Pmax[308]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 34.450000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[7]]=1
% Factor [P]=653^1
% Factor [P]=3^2
% Factor [P]=2^1
% End of depth 7 at 34.480000 s

% N_8=41689324968272544400416144408525782176021599528529454668862107542902731371215931579127943
% Pmax[295]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 34.500000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 34.520000s
%T% Ecpp sieve(7): 0.020000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 34.560000s
%T% Ecpp sieve(11): 0.020000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 34.600000s
%T% Ecpp sieve(19): 0.010000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 34.630000s
%T% Ecpp sieve(67): 0.020000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 34.670000s
%T% Ecpp sieve(163): 0.010000
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 34.710000s
%T% Ecpp sieve(88): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 7
% D[[8]]=88
% A[[8]]=-399053684150213139916861607146176362057044750
% B[[8]]=-9240140346750020501157599408945346248450063
% m[[8]]=41689324968272544400416144408525782176021599927583138819075247459764338517392293636172694
% Factor [P]=45979^1
% Factor [P]=19^1
% Factor [P]=2^1
% End of depth 8 at 34.750000 s

% N_9=23860621134976118617318515208044508978367469776009378892123090209239880973918467147
% Pmax[274]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 34.770000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 34.780000s
%T% Ecpp sieve(7): 0.010000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 34.810000s
%T% Ecpp sieve(8): 0.030000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 34.850000s
%T% Ecpp sieve(19): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-232)) where (h, g)=(-2, 2)
% next D is D_24 = 232 at 34.880000s
%T% Ecpp sieve(232): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[9]]=232
% A[[9]]=123641024766330545945070048168174012974366
% B[[9]]=18587558586350648540669682703416826850101
% m[[9]]=23860621134976118617318515208044508978367346134984612561577145139191712799905492782
% Factor [P]=2^1
% End of depth 9 at 34.920000 s

% N_10=11930310567488059308659257604022254489183673067492306280788572569595856399952746391
% Pmax[273]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 34.940000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 34.960000s
%T% Ecpp sieve(11): 0.010000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 34.980000s
%T% Ecpp sieve(43): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[10]]=43
% A[[10]]=200603785175214388807501789966129523050916
% B[[10]]=13188581780454507321520177289661574995734
% m[[10]]=11930310567488059308659257604022254489183472463707131066399765067805890270429695476
% Factor [P]=23^1
% Factor [P]=2^2
% End of depth 10 at 35.020000 s

% N_11=129677288777044122920209321782850592273733396344642728982606142041368372504670603
% Pmax[267]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 35.040000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 35.060000s
%T% Ecpp sieve(8): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[11]]=8
% A[[11]]=11050287388620209600751116535532252724262
% B[[11]]=7040954336390394817327645404682784435689
% m[[11]]=129677288777044122920209321782850592273722346057254108773005390924832840251946342
% Factor [P]=11^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 11 at 35.100000 s

% N_12=1964807405712789741215292754285615034450338576625062254136445317042921821999187
% Pmax[261]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 35.120000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 35.140000s
%T% Ecpp sieve(3): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[12]]=3
% A[[12]]=-2736411898218793916036570349624115900475
% B[[12]]=-351795180058783641614971091148543262679
% m[[12]]=1964807405712789741215292754285615034453074988523281048052481887392545937899663
% Factor [P]=523^1
% Factor [P]=109^1
% End of depth 12 at 35.180000 s

% N_13=34466072687789038911279189472970249871999491089222043749933900878708683809
% Pmax[245]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 35.200000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 35.210000s
%T% Ecpp sieve(3): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[13]]=3
% A[[13]]=-7225037615018893583892156461144294357
% B[[13]]=5343629297668962044679047690379720827
% m[[13]]=34466072687789038911279189472970249879224528704240937333826057339852978167
% Factor [P]=6451^1
% Factor [P]=2851^1
% Factor [P]=937^1
% Factor [P]=307^1
% Factor [P]=283^1
% End of depth 13 at 35.260000 s

% N_14=23019884406078022785730755416281733301411274631433197168311
% Pmax[194]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 35.280000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 35.290000s
%T% Ecpp sieve(3): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[14]]=3
% A[[14]]=-245538922848369430115912835059
% B[[14]]=102940395360251354480454557161
% m[[14]]=23019884406078022785730755416527272224259644061549110003371
% Factor [P]=19^1
% Factor [P]=7^2
% End of depth 14 at 35.330000 s

% N_15=24725976805669197406799952112274191433146771279859409241
% Pmax[185]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 35.340000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 35.340000s
%T% Ecpp sieve(3): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[15]]=3
% A[[15]]=-6287543379874871002076575846
% B[[15]]=4448621714226721152196581304
% m[[15]]=24725976805669197406799952118561734813021642281935985088
% Factor [P]=22783^1
% Factor [P]=67^1
% Factor [P]=3^1
% Factor [P]=2^6
% End of depth 15 at 35.370000 s

% N_16=84365816877204027154149205657733172013230420049
% Pmax[156]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 35.380000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 35.390000s
%T% Ecpp sieve(3): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[16]]=3
% A[[16]]=-561793274312361429210989
% B[[16]]=-85345541664873415818595
% m[[16]]=84365816877204027154149767451007484374659631039
% Factor [P]=7^1
% End of depth 16 at 35.410000 s

% N_17=12052259553886289593449966778715354910665661577
% Pmax[154]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 35.420000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 35.430000s
%T% Ecpp sieve(3): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[17]]=3
% A[[17]]=197089024802763300839681
% B[[17]]=55871741568944942510543
% m[[17]]=12052259553886289593449769689690552147364821897
% Factor [P]=631^1
% Factor [P]=19^1
% Factor [P]=3^1
% End of depth 17 at 35.450000 s

% N_18=335092155417084816455355456103943952716791
% Pmax[138]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 35.460000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 35.460000s
%T% Ecpp sieve(3): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[18]]=3
% A[[18]]=-1155090935530308467204
% B[[18]]=-45216340424143254254
% m[[18]]=335092155417084816456510547039474261183996
% Factor [P]=37^1
% Factor [P]=19^1
% Factor [P]=13^2
% Factor [P]=2^2
% End of depth 18 at 35.480000 s

% N_19=705118712317213666822052882068132057
% Pmax[120]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 35.480000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[19]]=-1
% Factor [P]=2801^1
% Factor [P]=79^1
% Factor [P]=43^1
% Factor [P]=11^1
% Factor [P]=3^2
% Factor [P]=2^3
% End of depth 19 at 35.480000 s

% N_20=93568227550773410332924069
% Pmax[87]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 35.490000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 35.490000s
%T% Ecpp sieve(3): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[20]]=3
% A[[20]]=19181684912447
% B[[20]]=1453257733817
% m[[20]]=93568227550754228648011623
% Factor [P]=631^1
% Factor [P]=13^1
% Factor [P]=3^1
% End of depth 20 at 35.490000 s

% N_21=3802195438691301095047
% Pmax[72]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 35.500000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[21]]=-1
% Factor [P]=1789^1
% Factor [P]=47^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 21 at 35.500000 s

% N_22=7536591698463227
% Pmax[53]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 35.500000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[22]]=-1
% Factor [P]=3709^1
% Factor [P]=7^1
% Factor [P]=2^1
% End of depth 22 at 35.500000 s

% N_23=145141002551
% Pmax[38]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 35.500000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[23]]=-1
% Factor [P]=211^1
% Factor [P]=5^2
% Factor [P]=2^1
% End of depth 23 at 35.500000 s

% N_24=13757441
% Pmax[24]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 35.500000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Factorization completed using sieve only
% Number of D tried was 1
% D[[24]]=-1
% Factor [P]=2687^1
% Factor [P]=5^1
% Factor [P]=2^10
% Cofactor is 1
% End of depth 24 at 35.500000 s

% N_25=2687
% Pmax[12]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 35.500000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Factorization completed using sieve only
% Number of D tried was 1
% D[[25]]=-1
% Factor [P]=79^1
% Factor [P]=17^1
% Factor [P]=2^1
% Cofactor is 1
% End of depth 25 at 35.500000 s


% Time for building is 2.450000 s

% Starting phase 2: proving
% Starting proving job for step 0
%T% ProveStep(1): 0.160000
% N_0 is prime
% Time for proof[0] is 0.160000 s

% Starting proving job for step 1
%T% ProveStep(1): 0.130000
% N_1 is prime
% Time for proof[1] is 0.130000 s

% Starting proving job for step 2
% D=11 h=-1 g=1 invcode=1 (gamma2) g0=1
%T% one root in GetInvariant: 0.000000s
% u has been computed
% E found
%T% find E: 0.000000
% Suggested twist(11)=-1
% Entering AEcModProveLarge
%T% ProveStep(11): 0.190000
% N_2 is prime
% Time for proof[2] is 0.190000 s

% Starting proving job for step 3
% D=7 h=-1 g=1 invcode=2 (f/sqrt(2)) g0=1
%T% one root in GetInvariant: 0.000000s
% u has been computed
% E found
%T% find E: 0.000000
% Suggested twist(7)=1
% Entering AEcModProveLarge
%T% ProveStep(7): 0.170000
% N_3 is prime
% Time for proof[3] is 0.170000 s

% Starting proving job for step 4
%T% ProveStep(1): 0.070000
% N_4 is prime
% Time for proof[4] is 0.070000 s

% Starting proving job for step 5
% D=11 h=-1 g=1 invcode=1 (gamma2) g0=1
%T% one root in GetInvariant: 0.000000s
% u has been computed
% E found
%T% find E: 0.000000
% Suggested twist(11)=1
% Entering AEcModProveLarge
%T% ProveStep(11): 0.130000
% N_5 is prime
% Time for proof[5] is 0.130000 s

% Starting proving job for step 6
% E found
%T% find E: 0.010000
% Suggested twist(4)=1
% Entering AEcModProveLarge
%T% ProveStep(4): 0.140000
% N_6 is prime
% Time for proof[6] is 0.140000 s

% Starting proving job for step 7
%T% ProveStep(1): 0.040000
% N_7 is prime
% Time for proof[7] is 0.040000 s

% Starting proving job for step 8
% D=88 h=-2 g=2 invcode=3 (f1^2/sqrt(2)) g0=2
%T% one root in GetInvariant: 0.000000s
% u has been computed
%T% FindJ: 0.010000
% E found
%T% find E: 0.010000
% Entering AEcModProveLarge
% Twisting
%T% ProveStep(88): 0.200000
% N_8 is prime
% Time for proof[8] is 0.200000 s

% Starting proving job for step 9
% D=232 h=-2 g=2 invcode=3 (f1^2/sqrt(2)) g0=2
%T% one root in GetInvariant: 0.000000s
% u has been computed
%T% FindJ: 0.010000
% E found
%T% find E: 0.010000
% Entering AEcModProveLarge
% Twisting
%T% ProveStep(232): 0.160000
% N_9 is prime
% Time for proof[9] is 0.160000 s

% Starting proving job for step 10
% D=43 h=-1 g=1 invcode=1 (gamma2) g0=1
%T% one root in GetInvariant: 0.000000s
% u has been computed
% E found
%T% find E: 0.000000
% Suggested twist(43)=1
% Entering AEcModProveLarge
%T% ProveStep(43): 0.080000
% N_10 is prime
% Time for proof[10] is 0.080000 s

% Starting proving job for step 11
% D=8 h=-1 g=1 invcode=3 (f1^2/sqrt(2)) g0=1
%T% one root in GetInvariant: 0.000000s
% u has been computed
% E found
%T% find E: 0.000000
% Suggested twist(8)=1
% Entering AEcModProveLarge
%T% ProveStep(8): 0.080000
% N_11 is prime
% Time for proof[11] is 0.080000 s

% Starting proving job for step 12
% M = 0 mod 6: hopeless
% E found
%T% find E: 0.000000
% Suggested twist(3)=1
% Entering AEcModProveLarge
%T% ProveStep(3): 0.070000
% N_12 is prime
% Time for proof[12] is 0.070000 s

% Starting proving job for step 13
% M = 1 mod 2: 2 is not a cube
% E found
%T% find E: 0.000000
% Suggested twist(3)=1
% Entering AEcModProveLarge
%T% ProveStep(3): 0.050000
% N_13 is prime
% Time for proof[13] is 0.050000 s

% Starting proving job for step 14
% M = 0 mod 2: 2 is a cube, but not 3
% E found
%T% find E: 0.000000
% Suggested twist(3)=1
% Entering AEcModProveLarge
%T% ProveStep(3): 0.040000
% N_14 is prime
% Time for proof[14] is 0.040000 s

% Starting proving job for step 15
% M = 1 mod 2: 2 is not a cube
% E found
%T% find E: 0.000000
% Suggested twist(3)=1
% Entering AEcModProveLarge
%T% ProveStep(3): 0.030000
% N_15 is prime
% Time for proof[15] is 0.030000 s

% Starting proving job for step 16
% M = 0 mod 2: 2 is a cube, but not 3
% E found
%T% find E: 0.000000
% Suggested twist(3)=1
% Entering AEcModProveLarge
%T% ProveStep(3): 0.020000
% N_16 is prime
% Time for proof[16] is 0.020000 s

% Starting proving job for step 17
% M = 1 mod 2: 2 is not a cube
% E found
%T% find E: 0.000000
% Suggested twist(3)=1
% Entering AEcModProveLarge
%T% ProveStep(3): 0.020000
% N_17 is prime
% Time for proof[17] is 0.020000 s

% Starting proving job for step 18
% M = 1 mod 2: 2 is not a cube
% E found
%T% find E: 0.000000
% Suggested twist(3)=1
% Entering AEcModProveLarge
%T% ProveStep(3): 0.010000
% N_18 is prime
% Time for proof[18] is 0.010000 s

% Starting proving job for step 19
%T% ProveStep(-1): 0.000000
% N_19 is prime
% Time for proof[19] is 0.000000 s

% Starting proving job for step 20
% M = 1 mod 2: 2 is not a cube
% E found
%T% find E: 0.000000
% Suggested twist(3)=1
% Entering AEcModProveLarge
%T% ProveStep(3): 0.010000
% N_20 is prime
% Time for proof[20] is 0.010000 s

% Starting proving job for step 21
%T% ProveStep(-1): 0.000000
% N_21 is prime
% Time for proof[21] is 0.000000 s

% Starting proving job for step 22
%T% ProveStep(-1): 0.000000
% N_22 is prime
% Time for proof[22] is 0.000000 s

% Starting proving job for step 23
%T% ProveStep(-1): 0.000000
% N_23 is prime
% Time for proof[23] is 0.000000 s

% Starting proving job for step 24
%T% ProveStep(-1): 0.000000
% N_24 is prime
% Time for proof[24] is 0.000000 s

% Starting proving job for step 25
% Using complete factorization theorem
%T% ProveStep(-1): 0.000000
% N_25 is prime
% Time for proof[25] is 0.000000 s
% Time for proving  is 1.800000 s
% Total time is        4.250000 s
This number is prime
%T% PrintCertif: 0.030000
% Time for this number is 4.360000s

Working on 7144625537205863133998785616533310106640710875591534732705260711750216714885084714525592924198788467382255098280582485397690877
% Performing a quick factorization
% This number might be prime
% Entering ECPP: delay mode
% Starting phase 1: building the sequence of primes
% N_0=7144625537205863133998785616533310106640710875591534732705260711750216714885084714525592924198788467382255098280582485397690877
% Pmax[422]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 37.430000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.010000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 37.490000s
%T% Ecpp sieve(4): 0.030000
%T% Ecpp sieve(4): 0.030000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 37.650000s
%T% Ecpp sieve(19): 0.020000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 37.730000s
%T% Ecpp sieve(163): 0.010000
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 37.800000s
%T% Ecpp sieve(52): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[0]]=52
% A[[0]]=4013489670317235716671769602700826606004229869311234548006122520
% B[[0]]=489709545293477216404435876520824064170047780189322597802566927
% m[[0]]=7144625537205863133998785616533310106640710875591534732705260707736727044567848997853823321497961861378025228969347937391568358
% Factor [P]=1867^1
% Factor [P]=61^2
% Factor [P]=2^1
% End of depth 0 at 37.890000 s

% N_1=514215884195094672789607646501868339341880791212193416101498127762875038816002761858556613673717841209155496595154496497
% Pmax[398]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 37.920000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 37.970000s
%T% Ecpp sieve(4): 0.030000
%T% Ecpp sieve(4): 0.030000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 38.110000s
%T% Ecpp sieve(8): 0.030000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 38.190000s
%T% Ecpp sieve(11): 0.020000
% Extra square factor: 13
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 38.270000s
%T% Ecpp sieve(19): 0.020000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 38.340000s
%T% Ecpp sieve(43): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 6
% D[[1]]=43
% A[[1]]=621843632419330007924168447525510569128361092795087060583234
% B[[1]]=197081852526676813330271309397630027870104321773211615093368
% m[[1]]=514215884195094672789607646501868339341880791212193416101497505919242619485994837690109088163148712848062701508093913264
% Factor [P]=63913^1
% Factor [P]=2^4
% End of depth 1 at 38.410000 s

% N_2=502847507740106348463543847204274110257186322825748885302576848527727750502631348170666656395362360599626349009683
% Pmax[378]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 38.430000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 38.470000s
%T% Ecpp sieve(8): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[2]]=8
% A[[2]]=-1165059715227906437523786813422104908973555459932190634910
% B[[2]]=-285925228624874703995652260586474247983480602013352247323
% m[[2]]=502847507740106348463543847204274110257186322825748885303741908242955656940155134984088761304335916059558539644594
% Factor [P]=54331^1
% Factor [P]=11^1
% Factor [P]=3^2
% Factor [P]=2^1
% End of depth 2 at 38.560000 s

% N_3=46743735205965003187861743756264129418570152652563150165376307129285126107865492548953929914478193436040713
% Pmax[355]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 38.570000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 38.600000s
%T% Ecpp sieve(3): 0.020000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 38.700000s
%T% Ecpp sieve(4): 0.020000
%T% Ecpp sieve(4): 0.030000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 38.800000s
%T% Ecpp sieve(8): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[3]]=8
% A[[3]]=148103768178644531452735781212650782905296209323254362
% B[[3]]=143631566288171109429778406838481826998384745502219324
% m[[3]]=46743735205965003187861743756264129418570152652563150017272538950640594655129711336303147009181984112786352
% Factor [P]=9241^1
% Factor [P]=313^1
% Factor [P]=3^2
% Factor [P]=2^4
% End of depth 3 at 38.860000 s

% N_4=112227067062105105103994495090638538123465782796589771236400239460652336091588214201944126011019251
% Pmax[326]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 38.880000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 38.910000s
%T% Ecpp sieve(3): 0.020000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 39.010000s
%T% Ecpp sieve(8): 0.020000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 39.060000s
%T% Ecpp sieve(19): 0.010000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 39.110000s
%T% Ecpp sieve(43): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[4]]=43
% A[[4]]=20529864358956972838895319974345145125698605618423
% B[[4]]=798733556459902502123304457254936912230617190695
% m[[4]]=112227067062105105103994495090638538123465782796569241372041282487813440771613869056818427405400829
% Factor [P]=67^1
% Factor [P]=13^1
% End of depth 4 at 39.160000 s

% N_5=128848527051785424918478180356645853184231667963914169198669669905641148991519941511846644552699
% Pmax[316]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 39.180000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 39.200000s
%T% Ecpp sieve(8): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[5]]=8
% A[[5]]=390358787239392532283980336489241341347975764118
% B[[5]]=213018228513469115970715738789873665004916671103
% m[[5]]=128848527051785424918478180356645853184231667963523810411430277373357168655030700170498668788582
% Factor [P]=17^1
% Factor [P]=3^2
% Factor [P]=2^1
% End of depth 5 at 39.260000 s

% N_6=421073617816292238295680327962894945046508718835045132063497638475023426977224510361106760747
% Pmax[308]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 39.280000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 39.300000s
%T% Ecpp sieve(8): 0.020000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 39.350000s
%T% Ecpp sieve(19): 0.020000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 39.390000s
%T% Ecpp sieve(163): 0.010000
% Testing if N is a norm in Q(sqrt(-232)) where (h, g)=(-2, 2)
% next D is D_24 = 232 at 39.430000s
%T% Ecpp sieve(232): 0.010000
% Testing if N is a norm in Q(sqrt(-403)) where (h, g)=(-2, 2)
% next D is D_27 = 403 at 39.460000s
%T% Ecpp sieve(403): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 6
% D[[6]]=403
% A[[6]]=-37241204525797754069523801385179663655662194776
% B[[6]]=-859030495033033932950519884281536905792930102
% m[[6]]=421073617816292238295680327962894945046508718872286336589295392544547228362404174016768955524
% Factor [P]=971^1
% Factor [P]=2^2
% End of depth 6 at 39.510000 s

% N_7=108412362980507785349042308950281911700954870976386801387563180366773230783317243567654211
% Pmax[296]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 39.530000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 39.550000s
%T% Ecpp sieve(7): 0.020000
% Extra square factor: 41
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 39.600000s
%T% Ecpp sieve(8): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[7]]=8
% A[[7]]=641123776731690659074000530610551920048715186
% B[[7]]=53162198542907826727629590091861552231568909
% m[[7]]=108412362980507785349042308950281911700954870335263024655872521292772700172765323518939026
% Factor [P]=34033^1
% Factor [P]=5281^1
% Factor [P]=1657^1
% Factor [P]=3^2
% Factor [P]=2^1
% End of depth 7 at 39.650000 s

% N_8=20224015794042393266335115528864482933504965248512311675767413471046706159737
% Pmax[254]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 39.660000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[8]]=-1
% Factor [P]=317^1
% Factor [P]=11^1
% Factor [P]=2^3
% End of depth 8 at 39.680000 s

% N_9=724979057715887341064493673962735981269894079743056770711478831052721041
% Pmax[239]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 39.700000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[9]]=-1
% Factor [P]=5393^1
% Factor [P]=1429^1
% Factor [P]=5^1
% Factor [P]=2^4
% End of depth 9 at 39.710000 s

% N_10=1175906592942201566178453463251575210935991073204970966289464129
% Pmax[210]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 39.720000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[10]]=-1
% Factor [P]=11^1
% Factor [P]=3^1
% Factor [P]=2^6
% End of depth 10 at 39.740000 s

% N_11=556773954991572711258737435251692808208329106631141556008269
% Pmax[199]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 39.750000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 39.760000s
%T% Ecpp sieve(4): 0.020000
%T% Ecpp sieve(4): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[11]]=4
% A[[11]]=-1491735996067166862334745847770
% B[[11]]=-21328021496310765769752403862
% m[[11]]=556773954991572711258737435253184544204396273493476301856040
% Factor [P]=5^1
% Factor [P]=2^3
% End of depth 11 at 39.830000 s

% N_12=13919348874789317781468435881329613605109906837336907546401
% Pmax[194]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 39.840000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 39.850000s
%T% Ecpp sieve(4): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[12]]=4
% A[[12]]=68188393354465113385811571230
% B[[12]]=112946600779853052963593558776
% m[[12]]=13919348874789317781468435881261425211755441723951095975172
% Factor [P]=73^1
% Factor [P]=2^2
% End of depth 12 at 39.890000 s

% N_13=47669002995853828018727520141306250725189868917640739641
% Pmax[185]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 39.900000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 39.900000s
%T% Ecpp sieve(3): 0.020000
% Extra square factor: 55
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 39.940000s
%T% Ecpp sieve(4): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[13]]=4
% A[[13]]=8377991448731775512794889880
% B[[13]]=5488289152103607901575555571
% m[[13]]=47669002995853828018727520132928259276458093404845849762
% Factor [P]=41^1
% Factor [P]=17^2
% Factor [P]=2^1
% End of depth 13 at 39.970000 s

% N_14=2011520085908255043409887759850124874523508034637769
% Pmax[171]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 39.980000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 39.990000s
%T% Ecpp sieve(4): 0.010000
%T% Ecpp sieve(4): 0.010000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 40.030000s
%T% Ecpp sieve(7): 0.010000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 40.050000s
%T% Ecpp sieve(8): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[14]]=8
% A[[14]]=-88644299481401008402704258
% B[[14]]=-4851140498438345147541242
% m[[14]]=2011520085908255043409887848494424355924516437342028
% Factor [P]=17^1
% Factor [P]=3^2
% Factor [P]=2^2
% End of depth 14 at 40.070000 s

% N_15=3286797525993880789885437660938601888765549734219
% Pmax[162]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 40.080000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 40.090000s
%T% Ecpp sieve(7): 0.010000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 40.110000s
%T% Ecpp sieve(8): 0.010000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 40.130000s
%T% Ecpp sieve(19): 0.010000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 40.140000s
%T% Ecpp sieve(43): 0.010000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 40.160000s
%T% Ecpp sieve(67): 0.010000
% No factor found, sieve only: no PRP test
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 40.170000s
%T% Ecpp sieve(35): 0.010000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 40.190000s
%T% Ecpp sieve(40): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 8
% D[[15]]=40
% A[[15]]=3243619870153269101252194
% B[[15]]=256228425527029146153991
% m[[15]]=3286797525993880789885434417318731735496448482026
% Factor [P]=89^1
% Factor [P]=2^1
% End of depth 15 at 40.200000 s

% N_16=18465154640415060617333901220891751323013755517
% Pmax[154]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 40.210000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 40.220000s
%T% Ecpp sieve(4): 0.010000
%T% Ecpp sieve(4): 0.010000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 40.260000s
%T% Ecpp sieve(11): 0.010000
% Extra square factor: 29
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 40.280000s
%T% Ecpp sieve(67): 0.010000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 40.300000s
%T% Ecpp sieve(163): 0.010000
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 40.310000s
%T% Ecpp sieve(52): 0.010000
% Testing if N is a norm in Q(sqrt(-772)) where (h, g)=(4, 2)
% next D is D_87 = 772 at 40.330000s
%T% Ecpp sieve(772): 0.010000
% Testing if N is a norm in Q(sqrt(-1027)) where (h, g)=(4, 2)
% next D is D_90 = 1027 at 40.340000s
%T% Ecpp sieve(1027): 0.010000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-59)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-211)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-283)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-379)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-547)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-643)) where (h, g)=(3, 1)
% next D is D_241 = 643 at 40.370000s
%T% Ecpp sieve(643): 0.000000
% No factor foun